This package provides efficient vector-based hashtable implementation similar to .NET Generic Dictionary implementation (at the time of 2015).

This package provides an abstract class to manipulate sequence of bytes. The use case of this class is abstracting manipulation of types that are just wrapping a bytestring with stronger and more meaniful name.

This package provides a basic random number generation library, including the ability to split random number generators.

This library provides functions to read, write and manipulate MIDI, WAVE and SoundFont2 multimedia files. It is written entirely in Haskell (without any FFI). It uses efficient parsing and building combinators for binary data stored in ByteStrings (based on the one in binary package).

This package provides instances defined in later versions of ghc-binary package.

A clean and powerful stream processing library that lets you build and connect reusable streaming components. Advantages over traditional streaming libraries:

• Concise API: Use simple commands like for, (>->), await, and yield

• Blazing fast: Implementation tuned for speed, including shortcut fusion

• Lightweight Dependency: pipes is small and compiles very rapidly, including dependencies

• Elegant semantics: Use practical category theory

• ListT: Correct implementation of ListT that interconverts with pipes

• Bidirectionality: Implement duplex channels

This package provides Haskell modules for accessing and manipulating fields of records.

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

The doctest program checks examples in source code comments. It is modeled after doctest for Python, see the Doctest website.

This library provides access to system information and functionality to Lua scripts via Haskell's System module. Intended usage for this package is to preload it by adding the loader function to package.preload. Note that the Lua package library must have already been loaded before the loader can be added.

This package provides a data structure representing a bidirectional mapping between two key types. Each value in the bimap is associated with exactly one value of the opposite type.

This library provides finger trees, a general sequence representation with arbitrary annotations, for use as a base for implementations of various collection types. It includes examples, as described in section 4 of Ralf Hinze and Ross Paterson, "Finger trees: a simple general-purpose data structure".

This package defines the type class MonadBaseControl, a subset of MonadBase into which generic control operations such as catch can be lifted from IO or any other base monad.

This package contains a wrapped name module for TimeLocale.

This package provides utilities to inline C++ code into Haskell using inline-c.

Utilities to parse, print, diff, and analyse data in CoNLL-U, a format used in linguistics to represent the syntactic annotation of sentences. See https://universaldependencies.org/format.html

This package provides a plotting library for Haskell, using gnuplot for rendering.

This package provides Haskell modules to allow use of Accessor to access state in transformers State monad.

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

This package provides a Pure Haskell implementation of the SplitMix pseudorandom number generator. SplitMix is a "splittable" pseudorandom number generator that is quite fast: 9 64-bit arithmetic/logical operations per 64 bits generated. SplitMix is tested with two standard statistical test suites (DieHarder and TestU01, this implementation only using the former) and it appears to be adequate for "everyday" use, such as Monte Carlo algorithms and randomized data structures where speed is important. In particular, it should not be used for cryptographic or security applications, because generated sequences of pseudorandom values are too predictable (the mixing functions are easily inverted, and two successive outputs suffice to reconstruct the internal state).

Old-time is a package for backwards compatibility with the old time library. For new projects, the newer time library is recommended.

This package provides a monad transformer version of the ST monad for strict state threads.

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.