This library implements the 'patience diff' algorithm, as well as the patience algorithm for the longest increasing subsequence problem. Patience diff computes the difference between two lists, for example the lines of two versions of a source file. It provides a good balance between performance, nice output for humans, and simplicity of implementation.

This package contains a MonadRef type class that abstracts over the details of manipulating references, allowing one to write code that can operate in either the ST monad or the IO monad.

This package is an enhancement of the Text.Regex library, providing the PCRE backend to accompany regex-base, with bundled code from https://www.pcre.org.

LeanCheck support for test-framework. This package can be used to incorporate LeanCheck tests into test-framework test suites.

This package provides strict versions of some standard Haskell data types, such as pairs, Maybe and Either. It also contains strict IO operations.

This library provides law-abiding lenses for Aeson, using microlens.

This package provides a low-level networking interface.

This package provides functions for converting emoji names to emoji characters and vice versa.

How does it differ from the emoji package?

• It supports a fuller range of emojis, including all those supported by GitHub

• It supports lookup of emoji aliases from emoji

• It uses Text rather than String

• It has a lighter dependency footprint: in particular, it does not require aeson

• It does not require TemplateHaskell

ghc-blaze-textual is a fast Haskell library for rendering common Haskell datatypes in text form using the ghc-blaze-builder library.

Wrapper for the Data.Version.Version Haskell type.

An integration library for hspec and hedgehog.

This Haskell library provides pointed and copointed data types.

Implementation of bidirectional TOML serialization.

This package provides a canonical anonymous 1-tuple type missing from Haskell for attaching typeclass instances.

There is also the OneTuple package which by using a boxed data-type provides a 1-tuple type which has laziness properties which are more faithful to the ones of Haskell's native tuples; whereas the primary purpose of Only is to provide the traditionally so named type-wrapper for attaching typeclass instances.

This is a simple time library providing a simple but powerful and performant API. The backbone of the library are the Timeable and Time type classes. Each Timeable instances can be converted to a type that has a Time instances, and thus are different representations of current time.

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

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 Haskell library including a Storable instance for Complex which is binary compatible with C99, C++ and Fortran complex data types.

This library lets you derive automatically Haskell functions that let you query each endpoint of a <http://hackage.haskell.org/package/servant servant> webservice. . See <http://docs.servant.dev/en/stable/tutorial/Client.html the client section of the tutorial>. . <https://github.com/haskell-servant/servant/blob/master/servant-client/CHANGELOG.md CHANGELOG>.

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 library for testing code involving bottoms or infinite values. For the underlying theory and a larger example involving use of QuickCheck, see the article "Chasing Bottoms A Case Study in Program Verification in the Presence of Partial and Infinite Values".

This package provides filtrable containers.

__This package is deprecated__. Please, use genByteString from the [random package (version >=1.2)](https://hackage.haskell.org/package/random) instead. . Efficient generation of random bytestrings. The implementation populates uninitialized memory with uniformily distributed random 64 bit words (and 8 bit words for remaining bytes at the end of the bytestring). . Random words are generated using the PRNG from the [mwc-random](https://hackage.haskell.org/package/mwc-random) package or the [pcg-random](https://hackage.haskell.org/package/pcg-random) package. It is also possible to use a custom PRNG by providing an instance for the RandomWords type class and using the function generate from the module "Data.ByteString.Random.Internal". . The generated byte strings are suitable for statistical applications. They are /not/ suitable for cryptographic applications. .  . 

The psqueues package provides Priority Search Queues in three different flavors:

• OrdPSQ k p v, which uses the Ord k instance to provide fast insertion, deletion and lookup. This implementation is based on Ralf Hinze's A Simple Implementation Technique for Priority Search Queues.

  Hence, it is similar to the PSQueue library, although it is considerably faster and provides a slightly different API.

• IntPSQ p v is a far more efficient implementation. It fixes the key type to Int and uses a https://en.wikipedia.org/wiki/Radix_tree, radix tree (like IntMap) with an additional min-heap property.

• HashPSQ k p v is a fairly straightforward extension of IntPSQ: it simply uses the keys' hashes as indices in the IntPSQ. If there are any hash collisions, it uses an OrdPSQ to resolve those. The performance of this implementation is comparable to that of IntPSQ, but it is more widely applicable since the keys are not restricted to Int, but rather to any Hashable datatype.

Each of the three implementations provides the same API, so they can be used interchangeably.

Typical applications of Priority Search Queues include:

• Caches, and more specifically LRU Caches;

• Schedulers;

• Pathfinding algorithms, such as Dijkstra's and A*.