This package provides utilities and combinators for parsing command line options in Haskell.

The HMatrix package provides a Haskell library for dealing with linear systems, matrix decompositions, and other numerical computations based on BLAS and LAPACK.

This package provides Haskell APIs to efficiently access the <https://www.unicode.org/ucd/ Unicode character database> (UCD). Performance is the primary goal in the design of this package. The Haskell data structures are generated programmatically from the UCD files.

This package provides bindings and types to bridge Haskell and <https://www.lua.org/ Lua>. . The full Lua interpreter version 5.4.4 is included. Alternatively, a system-wide Lua installation can be linked instead.

This is a set of macros to be used when writing Haskell FFI. They were designed to be able to fully describe C interfaces, so that hsc2hs can extract from them all Haskell code needed to mimic such interfaces. All Haskell names used are automatically derived from C names, structures are mapped to Haskell instances of Storable, and there are also macros you can use with C code to help write bindings to inline functions or macro functions.

This library provides Kan extensions, Kan lifts, various forms of the Yoneda lemma, and (co)density (co)monads for Haskell.

Containers with merging via monoidal accumulation. The Monoid instances provided by the containers and unordered-containers packages merge structures in a left-biased manner instead of using the underlying monoidal structure of the value. This package wraps the types provided by these packages, but provides Monoid instances implemented in terms of the value type's mappend'.

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 a Haskell library for working with files and directories. It includes code for pattern matching, finding files, modifying file contents, and more.

This package provides several functions to quickly search for substrings in strict or lazy ByteStrings. It also provides functions for breaking or splitting on substrings and replacing all occurrences of a substring (the first in case of overlaps) with another.

Alternative parser for the Cassava package written with Megaparsec that provides for better error messages at the expense of some speed.

This library provides support for parsing and generating BitTorrent files.

This library provides tools for reading and manipulating the .cabal file format. . Version 3.6 (unlike the following versions) is a dummy package that prevents module name clases between Cabal and Cabal-syntax if used together with a Cabal flag as described below. . In Cabal-3.7 this package was split off. To avoid module name clashes, you can add this to your .cabal file: . > flag Cabal-syntax > description: Use the new Cabal-syntax package > default: False > manual: False > > library > -- ... > if flag(Cabal-syntax) > build-depends: Cabal-syntax >= 3.7 > else > build-depends: Cabal < 3.7, Cabal-syntax < 3.7 . This will default to the older build, but will allow consumers to opt-in to the newer libraries by requiring Cabal or Cabal-syntax >= 3.7

This library parses and dumps documents that are formatted according to RFC 4180, The common Format and MIME Type for Comma-Separated Values (CSV) Files. This format is used, among many other things, as a lingua franca for spreadsheets, and for certain web services.

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.

Transformers provides functor and monad transformers, inspired by the paper "Functional Programming with Overloading and Higher-Order Polymorphism", by Mark P Jones, in Advanced School of Functional Programming, 1995 http://web.cecs.pdx.edu/~mpj/pubs/springschool.html.

This package contains:

• the monad transformer class (in Control.Monad.Trans.Class)

• concrete functor and monad transformers, each with associated operations and functions to lift operations associated with other transformers.

This package can be used on its own in portable Haskell code, in which case operations need to be manually lifted through transformer stacks (see Control.Monad.Trans.Class for some examples). Alternatively, it can be used with the non-portable monad classes in the mtl or monads-tf packages, which automatically lift operations introduced by monad transformers through other transformers.

This library provides backend-agnostic generation of client functions. For more information, see the README.

This is only for use in developing libraries that should conform to the persistent interface, not for users of the persistent suite of database libraries.

This library provides a type for specifying Optional function arguments.

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.

This package (formerly binary-serialise-cbor) provides pure, efficient serialization of Haskell values directly into ByteStrings for storage or transmission purposes. By providing a set of type class instances, you can also serialise any custom data type you have as well.

The underlying binary format used is the 'Concise Binary Object Representation', or CBOR, specified in RFC 7049. As a result, serialised Haskell values have implicit structure outside of the Haskell program itself, meaning they can be inspected or analyzed without custom tools.

An implementation of the standard bijection between CBOR and JSON is provided by the https://hackage.haskell.org/package/cborg-json package. Also see https://hackage.haskell.org/package/cbor-tool for a convenient command-line utility for working with CBOR data.

This is a Haskell library to derive Template Haskell's Lift class for datatypes.

This library provides Haskell bindings to the MySQL mysqlclient client library. It is a fairly faithful, low level library that implements most of the MySQL client API. The major departure from the C API is that in Haskell, resource management is mostly automatic and safe.

This library deliberately avoids the question of providing a ``good'' API. Its purpose is to serve as a base upon which higher-level libraries can be built.

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).