A priority search queue efficiently supports the operations of both a search tree and a priority queue. A Binding is a product of a key and a priority. Bindings can be inserted, deleted, modified and queried in logarithmic time, and the binding with the least priority can be retrieved in constant time. A queue can be built from a list of bindings, sorted by keys, in linear time.

This package provides functions for signed 15.16 precision fixed point arithmetic.

This Haskell package provides three useful generalizations:

class Functor f => FunctorWithIndex i f | f -> i where
  imap :: (i -> a -> b) -> f a -> f b

class Foldable f => FoldableWithIndex i f | f -> i where
  ifoldMap :: Monoid m => (i -> a -> m) -> f a -> m

class (FunctorWithIndex i t, FoldableWithIndex i t, Traversable t)
       => TraversableWithIndex i t | t -> i where
  itraverse :: Applicative f => (i -> a -> f b) -> t a -> f (t b)

The ghc-keys package provides similar functionality, but uses associated TypeFamilies instead of FunctionalDependencies.

This Haskell package provides a validator that can validate an email address string against RFC 5322.

This Haskell package provides extras for the ghc-contravariant package.

This Haskell package provides an either monad transformer.

This library provides a wrapper to mmap, allowing files or devices to be lazily loaded into memory as strict or lazy ByteStrings, ForeignPtrs or plain Ptrs, using the virtual memory subsystem to do on-demand loading.

GHC 7.4 introduced a new casMutVar PrimOp which is difficult to use safely, because pointer equality is a highly unstable property in Haskell. This library provides a safer method based on the concept of Tickets.

The ghc-ini Haskell library lets programmers quickly and easily read and write configuration files in the simple INI format.

Difference lists are a list-like type supporting O(1) append. This is particularly useful for efficient logging and pretty printing (e.g. with the Writer monad), where list append quickly becomes too expensive.

This package provides a Haskell library including a Storable instance for Complex which is binary compatible with C99, C++ and Fortran complex data types.

Haddock is a documentation-generation tool for Haskell libraries. These modules expose some functionality of it without pulling in the GHC dependency. Please note that the API is likely to change so specify upper bounds in your project if you can't release often. For interacting with Haddock itself, see the ‘haddock’ package.

This Haskell package provides additional data structures, and other added capabilities layered on top of the Par monad.

This library lets you write interactive programs without callbacks or side-effects. Functional Reactive Programming (FRP) uses composable events and time-varying values to describe interactive systems as pure functions. Just like other pure functional code, functional reactive code is easier to get right on the first try, maintain, and reuse. Reflex is a fully-deterministic, higher-order FRP interface and an engine that efficiently implements that interface.

This package provides a variety of alternative parser combinator libraries, including the original HuttonMeijer set. The Poly sets have features like good error reporting, arbitrary token type, running state, lazy parsing, and so on. Finally, Text.Parse is a proposed replacement for the standard Read class, for better deserialisation of Haskell values from Strings.

This package includes backported versions of types that were added to transformers in transformers 0.3 and 0.4 for users who need strict transformers 0.2 or 0.3 compatibility to run on old versions of the platform, but also need those types.

This package converts between bytestrings and their hexadecimal string representation.

This package provides orphan instances for Template Haskell datatypes. In particular, instances for Ord and Lift, as well as a few missing Show and Eq instances. These instances used to live in the haskell-src-meta package, and that's where the version number started.

This library provides the natural numbers for Haskell.

This library provides tools to infer a software license from a given license file.

Lets multiple threads and external processes concurrently output to the console, without it getting all garbled up.

Built on top of that is a way of defining multiple output regions, which are automatically laid out on the screen and can be individually updated by concurrent threads. Can be used for progress displays etc.

This library provides typeclasses for rendering ghc-commonmark to Pandoc types.

The threadDelay and timeout functions from the Haskell base library use the bounded Int type for specifying the delay or timeout period. This package provides alternative functions which use the unbounded Integer type.

Bindings to the Xft, X Free Type interface library, and some Xrender parts.