The package provides mutable and immutable bit arrays.

This package turn Data.Serialize Gets and Puts into Sources, Sinks, and Conduits.

With this package you can build a Storable instance of a record type from Storable instances of its elements in an elegant way. It does not do any magic, just a bit arithmetic to compute the right offsets, that would be otherwise done manually or by a preprocessor like C2HS. There is no guarantee that the generated memory layout is compatible with that of a corresponding C struct. However, the module generates the smallest layout that is possible with respect to the alignment of the record elements.

ghc-citeproc parses Citation Style Language style files and uses them to generate a list of formatted citations and bibliography entries. For more information about CSL, see https://citationstyles.org/.

This library implements unicode-casemap, the simple, non locale-sensitive unicode collation algorithm described in RFC 5051. Proper unicode collation can be done using text-icu, but that is a big dependency that depends on a large C library, and rfc5051 might be better for some purposes.

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 package provides a pipe-based interface to the Aspell program (no dynamic linking required).

SecureMem is similar to ByteString, except that it provides a memory chunk that will be auto-scrubbed after it run out of scope.

This Haskell package provides an either monad transformer.

This library provides a conduit-based, streaming interface for extracting and creating tar files.

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.

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 is a lightweight package providing commonly useful parser combinators.

Implementation of bidirectional TOML serialization.

This package defines new symbols for a number of functions, operators and types in the base package. All symbols are documented with their actual definition and information regarding their Unicode code point. They should be completely interchangeable with their definitions. For further Unicode goodness you can enable the UnicodeSyntax language extension. This extension enables Unicode characters to be used to stand for certain ASCII character sequences, i.e. → instead of ->, ∀ instead of forall and many others.

This package provides a mid-Level PostgreSQL client library, forked from ghc-mysql-simple.

This package provides type classes, a monad and a monad transformer that support unchecked extensible exceptions as well as asynchronous exceptions. It is compatible with the transformers package.

This package contains the Control.Monad.Fail module providing the MonadFail class that became available in base-4.9.0.0 for older base package versions. This package turns into an empty package when used with GHC versions which already provide the Control.Monad.Fail module.

This package provides tools to parse Haskell sources to the template-haskell abstract syntax.

Derive instances of Arbitrary for QuickCheck, with various options to customize implementations.

Automating the arbitrary boilerplate also ensures that when a type changes to have more or fewer constructors, then the generator either fixes itself to generate that new case (when using the uniform distribution) or causes a compilation error so you remember to fix it (when using an explicit distribution).

This package also offers a simple (optional) strategy to ensure termination for recursive types: make Test.QuickCheck.Gen's size parameter decrease at every recursive call; when it reaches zero, sample directly from a trivially terminating generator given explicitly (genericArbitraryRec and withBaseCase) or implicitly (genericArbitrary').

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 Cairo vector graphics rendering backend for the Charts library.

The functions for creating temporary files and directories in the base library are quite limited. The unixutils package contains some good ones, but they aren't portable to Windows. This library just repackages the Cabal implementations of its own temporary file and folder functions so that you can use them without linking against Cabal or depending on it being installed. This is a better maintained fork of the "temporary" package.

This package provides Type-level booleans.