This package contains an implementation of a high-quality splittable pseudorandom number generator. The generator is based on a cryptographic hash function built on top of the ThreeFish block cipher. See the paper "Splittable Pseudorandom Number Generators Using Cryptographic Hashing" by Claessen, Pałka for details and the rationale of the design.

Utilities to package up Haskell functions and values into a Lua module. . This package is part of HsLua, a Haskell framework built around the embeddable scripting language <https://lua.org Lua>.

This library provides the POSIX regex backend used by the Haskell library regex-base.

This library provides parsers and printers for bencoded data. Bencode is the encoding used by the peer-to-peer file sharing system BitTorrent for storing and transmitting loosely structured data.

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

Trifecta is a modern parser combinator library for Haskell, with slicing and Clang-style colored diagnostics.

This package provides a variety of alternative parser combinator libraries, including the original HuttonMeijer set. The Poly sets have features like good error reporting, arbitrary token type, running state, lazy parsing, and so on. Finally, Text.Parse is a proposed replacement for the standard Read class, for better deserialisation of Haskell values from Strings.

Random shuffle implementation, on immutable lists. Based on perfect shuffle implementation by Oleg Kiselyov.

This package provides Prism and Traversals for These.

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 profides a class for encoding and decoding UTF8 strings with instances for several common types. It also includes several functions for working with UTF8. It aims to be lightweight, depending only on Base and including only one module.

This package provides optimized functions to determine the edit distances for fuzzy matching, including Levenshtein and restricted Damerau-Levenshtein algorithms.

This library provides data structures for describing changes to other data structures. In this library, a patch is something that can be applied, analogous to a function, and which distinguishes returning the argument it was provided from returning something else.

This package provides a Haskell library for working with base16-encoded data quickly and efficiently, using the ByteString type.

This package provides a low-level networking interface.

This package provides a plugin that allows you to set breakpoints for debugging purposes. See the [README](https://github.com/aaronallen8455/breakpoint#breakpoint) for details.

This library provides a SOCKS proxy (version 5) implementation.

This package provides a family of combinators for defining webservices APIs and serving them . You can learn about the basics in the <http://docs.servant.dev/en/stable/tutorial/index.html tutorial>. . <https://github.com/haskell-servant/servant/blob/master/servant-server/example/greet.hs Here> is a runnable example, with comments, that defines a dummy API and implements a webserver that serves this API, using this package. . <https://github.com/haskell-servant/servant/blob/master/servant-server/CHANGELOG.md CHANGELOG>

This package provides a library and an executable for working with derived Show instances. By using the library, derived Show instances can be parsed into a generic data structure. The ppsh tool uses the library to produce human-readable versions of Show instances, which can be quite handy for debugging Haskell programs. We can also render complex generic values into an interactive Html page, for easier examination.

Efficient hashing-based container types. The containers have been optimized for performance critical use, both in terms of large data quantities and high speed.

A clone of wl-pprint for use with the text library.

This library provides Pure Haskell solver routines for use by the diagrams framework. It currently includes routines for finding real roots of low-degree (n < 5) polynomials, and solving tridiagonal and cyclic tridiagonal linear systems.

This package provides a pure interface for compressing and decompressing LZMA streams of data represented as lazy ByteStrings. A monadic incremental interface is provided as well.

This package provides a type called @DMap@ which generalizes @Data.Map.Map@, allowing keys to specify the type of value that can be associated with them.