This Haskell library provides simple read-only access to the local computer's networking configuration. It is currently capable of getting a list of all the network interfaces and their respective IPv4, IPv6 and MAC addresses.

This package provides a data structure representing a bidirectional mapping between two key types. Each value in the bimap is associated with exactly one value of the opposite type.

This package provides Haskell bindings to SDL2_image.

This package provides a basic random number generation library, including the ability to split random number generators.

Clear to write, read and edit Haskell DSL for HTML.

• Names are consistent, and do not conflict with base or are keywords (all have suffix -).

• Same combinator can be used for attributes and elements (e.g. style_).

Pandoc is a Haskell library for converting from one markup format to another, and a command-line tool that uses this library. It can read and write Markdown and (subsets of) other formats, such as HTML, reStructuredText, LaTeX, DocBook, and many more.

Pandoc extends standard Markdown syntax with footnotes, embedded LaTeX, definition lists, tables, and other features. A compatibility mode is provided for those who need a drop-in replacement for Markdown.pl.

The psqueues package provides Priority Search Queues in three different flavors:

• OrdPSQ k p v, which uses the Ord k instance to provide fast insertion, deletion and lookup. This implementation is based on Ralf Hinze's A Simple Implementation Technique for Priority Search Queues.

  Hence, it is similar to the PSQueue library, although it is considerably faster and provides a slightly different API.

• IntPSQ p v is a far more efficient implementation. It fixes the key type to Int and uses a https://en.wikipedia.org/wiki/Radix_tree, radix tree (like IntMap) with an additional min-heap property.

• HashPSQ k p v is a fairly straightforward extension of IntPSQ: it simply uses the keys' hashes as indices in the IntPSQ. If there are any hash collisions, it uses an OrdPSQ to resolve those. The performance of this implementation is comparable to that of IntPSQ, but it is more widely applicable since the keys are not restricted to Int, but rather to any Hashable datatype.

Each of the three implementations provides the same API, so they can be used interchangeably.

Typical applications of Priority Search Queues include:

• Caches, and more specifically LRU Caches;

• Schedulers;

• Pathfinding algorithms, such as Dijkstra's and A*.

This library provides functions for parsing and pretty printing Roman numerals. Because the notation of Roman numerals has varied through the centuries this package allows for some customisation using a configuration that is passed to the conversion functions.

This package provides a Haskell library including a couple of different implementations of mutable hash tables in the ST monad, as well as a typeclass abstracting their common operations, and a set of wrappers to use the hash tables in the IO monad.

This haskell library provides validity and validity-based testing for ghc-hspec.

This package provides a pretty printing class similar to Show, based on the HughesPJ pretty printing library. It provides the pretty printing class and instances for the Prelude types.

Safe conversions between textual types

This Haskell package provides an abstract interface to highly-parameterizable queues/deques.

Background: There exists a feature space for queues that extends between:

• Simple, single-ended, non-concurrent, bounded queues

• Double-ended, thread-safe, growable queues with important points in between (such as the queues used for work stealing).

This package includes an interface for Deques that allows the programmer to use a single API for all of the above, while using the type system to select an efficient implementation given the requirements (using type families).

This package also includes a simple reference implementation based on IORef and Data.Sequence.

This library provides convenient combinators for working with and building parsing combinator libraries. Given a few simple instances, you get access to a large number of canned definitions. Instances exist for the parsers provided by parsec, attoparsec and base's Text.Read.

The config-ini Haskell library exports some simple monadic functions to ease the parsing of .ini-style configuration files, and to write and update them in an efficient diff-minimal way. This means that if you parse a file, update a single field, and reserialize, that file should differ only in the field we changed and that's it: field order, comments, and incidental whitespace will remain unchanged. The library aims to produce human-readable error messages when things go wrong.

This library provides an interface to GSL special functions for Haskell.

A thread safe API to write a line of textual data to a Handle, such as sending some messages to the terminal - that has the following properties:

• Properly handle character encoding settings on the Handle

• For reasonably sized messages, ensure that the entire message is written in one chunk to avoid interleaving data with other threads

• Avoid unnecessary memory allocations and copies

• Minimize locking.

This is the IRC core library for glirc. The client is available in its own glirc package.

In Haskell you very often acquire values using the with... idiom using functions of type (a -> IO r) -> IO r. This idiom forms a Monad, which is a special case of the ContT monad (from transformers) or the Codensity monad (from kan-extensions). The main purpose behind this package is to provide a restricted form of these monads specialized to this unusually common case.

The reason this package defines a specialized version of these types is to:

• be more beginner-friendly,

• simplify inferred types and error messages, and:

• provide some additional type class instances that would otherwise be orphan instances

This package provides a Haskell library for globbing: matching patterns against file paths.

Haskeline wrapper for GHCi-like REPL interfaces. Composable with normal mtl transformers.

This package provides semigroups for Haskell. In mathematics, a semigroup is an algebraic structure consisting of a set together with an associative binary operation. A semigroup generalizes a monoid in that there might not exist an identity element. It also (originally) generalized a group (a monoid with all inverses) to a type where every element did not have to have an inverse, thus the name semigroup.

The functional graph library, FGL, is a collection of type and function definitions to address graph problems. The basis of the library is an inductive definition of graphs in the style of algebraic data types that encourages inductive, recursive definitions of graph algorithms.

This package provides bindings to the ALSA simple mixer API.