ANSI terminal backend for the prettyprinter package.

Manipulate identifiers and structurally non-complex pieces of text by delimiting word boundaries via a combination of whitespace, control-characters, and case-sensitivity.

Has support for common idioms like casing of programmatic variable names, taking, dropping, and splitting by word, and modifying the first character of a piece of text.

Caution: this library makes heavy use of the text library's internal loop optimisation framework. Since internal modules are not guaranteed to have a stable API there is potential for build breakage when the text dependency is upgraded. Consider yourself warned!

This is an implementation of Tarjan's Union-Find algorithm (Robert E.: Tarjan. "Efficiency of a Good But Not Linear Set Union Algorithm",JACM 22(2), 1975) in order to maintain an equivalence relation. This implementation is a port of the union-find package using the ST monad transformer (instead of the IO monad).

This package provides a data type for colours and transparency. Colours can be blended and composed. Various colour spaces are supported. A module of colour names ("Data.Colour.Names") is provided.

Knowledge of GHC's installation directories.

This package provides a Haskell type inhabited by finitely many values and indexed by type-level naturals.

This is an industrial-strength monadic parser combinator library. Megaparsec is a feature-rich package that strikes a nice balance between speed, flexibility, and quality of parse errors.

This package provides a backwards compatibility layer for Template Haskell newer than 2.8.

This Haskell library provides a purely functional interface for statistics based on hmatrix and GSL.

This package provides a writer monad for multi-line string literals.

This package tries to compat as many time features as possible.

Provides Default instances for types from the old-locale package.

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

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.

The ListLike module provides a common interface to the various Haskell types that are list-like. Predefined interfaces include standard Haskell lists, Arrays, ByteStrings, and lazy ByteStrings. Custom types can easily be made ListLike instances as well.

ListLike also provides for String-like types, such as String and ByteString, for types that support input and output, and for types that can handle infinite lists.

The Union/Find algorithm implements these operations in (effectively) constant-time:

1. Check whether two elements are in the same equivalence class.

2. Create a union of two equivalence classes.

3. Look up the descriptor of the equivalence class.

This package provides Haskell bindings to SDL2_ttf C++ library.

This package provides a functional library for creating efficient memo functions using tries.

This library is intended to be a comprehensive solution to parsing and selecting quality-indexed values in HTTP headers. It is capable of parsing both media types and language parameters from the Accept and Content header families, and can be extended to match against other accept headers as well. Selecting the appropriate header value is achieved by comparing a list of server options against the quality-indexed values supplied by the client. . In the following example, the Accept header is parsed and then matched against a list of server options to serve the appropriate media using mapAcceptMedia': . > getHeader >>= maybe send406Error sendResourceWith . mapAcceptMedia > [ ("text/html", asHtml) > , ("application/json", asJson) > ] . Similarly, the Content-Type header can be used to produce a parser for request bodies based on the given content type with mapContentMedia': . > getContentType >>= maybe send415Error readRequestBodyWith . mapContentMedia > [ ("application/json", parseJson) > , ("text/plain", parseText) > ] . The API is agnostic to your choice of server.

This package provides default instances for types from the base package.

The ghc-lib-parser-ex package contains GHC API parse tree utilities.

This library provides adjunctions and representable functors for Haskell.

This library provides minimal Haskell binding to libxml2.

Haskellers are usually familiar with monoids and semigroups. A monoid has an appending operation <> (or mappend), and an identity element, mempty. A semigroup has an appending <> operation, but does not require a mempty element. A Semiring has two appending operations, plus and times, and two respective identity elements, zero and one. More formally, a Semiring R is a set equipped with two binary relations + and *, such that: (R,+) is a commutative monoid with identity element 0, (R,*) is a monoid with identity element 1, (*) left and right distributes over addition, and . multiplication by 0 annihilates R.