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 library provides everything that microlens provides plus instances to make each, at, and ix usable with arrays, ByteString, and containers. This package is a part of the microlens family; see the readme on Github.

This package provides Data.Scientific, which provides the number type Scientific. Scientific numbers are arbitrary precision and space efficient. They are represented using scientific notation.

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

This tiny package contains the class ObjectName, which corresponds to the general notion of explicitly handled identifiers for API objects, e.g. a texture object name in OpenGL or a buffer object name in OpenAL.

This package provides a library for issuing notifications using FreeDesktop.org's Desktop Notifications protocol. This protocol is supported by services such as Ubuntu's NotifyOSD.

This package provides helper functions for working with haskell-src-exts trees.

This Haskell library provides a Lua module to work with file paths in a platform independent way.

This package provides various extra monoid-related definitions and utilities, such as monoid actions, monoid coproducts, semi-direct products, "deletable" monoids, "split" monoids, and "cut" monoids.

This package defines classes of monads that can perform multiple executions in parallel and combine their results. For any monad that's an instance of the class, the package re-implements a subset of the Control.Monad interface, but with parallel execution.

This package provides a configuration management library for programs and daemons. The features include:

1. Automatic, dynamic reloading in response to modifications to configuration files.

2. A simple, but flexible, configuration language, supporting several of the most commonly needed types of data, along with interpolation of strings from the configuration or the system environment (e.g. $(HOME)).

3. Subscription-based notification of changes to configuration properties.

4. An import directive allows the configuration of a complex application to be split across several smaller files, or common configuration data to be shared across several applications.

This is a modified version of wl-pprint, which was based on Wadler's paper "A Prettier Printer". This version allows the library user to annotate the text with semantic information, which can later be rendered in a variety of ways.

When you've caught all the exceptions that can be handled safely, this is what you're left with.

This package provides combinators for building fast hashing functions. It includes hashing functions for all basic Haskell98 types.

FoldMap lists are lists represented by their foldMap function. FoldMap lists have O(1) cons, snoc and append, just like DLists, but other operations might have favorable performance characteristics as well. These wild claims are still completely unverified though.

This is a small library for working with changes to JSON documents. It includes a library and two command-line executables in the style of the diff and patch commands available on many systems.

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 library provides peek and poke functions for network byte order.

This library provides bindings for the Dot language used by the Graphviz suite of programs for visualising graphs, as well as functions to call those programs. Main features of the graphviz library include:

1. Almost complete coverage of all Graphviz attributes and syntax

2. Support for specifying clusters

3. The ability to use a custom node type

4. Functions for running a Graphviz layout tool with all specified output types

5. Generate and parse Dot code with two options: strict and liberal

6. Functions to convert FGL graphs and other graph-like data structures

7. Round-trip support for passing an FGL graph through Graphviz to augment node and edge labels with positional information, etc.

This library provides an implementation of the older blaze-builder interface in terms of the new builder that shipped with bytestring-0.10.4.0. This implementation is mostly intended as a bridge to the new builder, so that code that uses the old interface can interoperate with code that uses the new implementation.

This package provides an interface to the directory package for users of path. It also implements some missing stuff like recursive scanning and copying of directories, working with temporary files/directories, and more.

This library implements mid-level Haskell bindings to the MySQL mysqlclient client library. It is aimed at speed and ease of use.

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 Haskell package contains Template Haskell functions for generating functions similar to those in Data.List for tuples of statically known size.