This package provides functions to prevent or capture writing to stdout and other handles.

More complex tests for chell.

To store passwords securely, they should be salted, then hashed with a slow hash function. This library uses PBKDF1-SHA256, and handles all the details. It uses the cryptohash package for speed; if you need a pure Haskell library, pwstore-purehaskell has the exact same API, but uses only pure Haskell. It is about 25 times slower than this package, but still quite usable.

This package includes backported versions of types that were added to transformers in transformers 0.3 and 0.4 for users who need strict transformers 0.2 or 0.3 compatibility to run on old versions of the platform, but also need those types.

Long lived application data typically should not contain any thunks. This library can be used to examine values for unexpected thunks, which can then be used in assertions. This can be invaluable in avoiding memory leaks, or tracking down existing ones.

This package provides default instances for types from the base package.

This Haskell library offers (among other things) the following selection of synchronisation primitives:

• Broadcast: Wake multiple threads by broadcasting a value.

• Event: Wake multiple threads by signalling an event.

• Lock: Enforce exclusive access to a resource. Also known as a binary semaphore or mutex. The package additionally provides an alternative that works in the STM monad.

• RLock: A lock which can be acquired multiple times by the same thread. Also known as a reentrant mutex.

• ReadWriteLock: Multiple-reader, single-writer locks. Used to protect shared resources which may be concurrently read, but only sequentially written.

• ReadWriteVar: Concurrent read, sequential write variables.

Please consult the API documentation of the individual modules for more detailed information.

This package was inspired by the concurrency libraries of Java and Python.

Parse jira wiki text into an abstract syntax tree for easy transformation to other formats.

This package provides functions to fork threads and wait for their result, whether it's an exception or a normal value. Besides waiting for the termination of a single thread this package also provides functions to wait for a group of threads to terminate. This package is similar to the threadmanager, async and spawn packages. The advantages of this package are:

• Simpler API.

• More efficient in both space and time.

• No space-leak when forking a large number of threads.

• Correct handling of asynchronous exceptions.

• GHC specific functionality like forkOn and forkIOWithUnmask.

This package provides a simple type class for converting values of different string types into values of other string types.

language-python is a Haskell library for lexical analysis, parsing and pretty printing Python code. It supports versions 2.x and 3.x of Python.

Alex is a tool for generating lexical analysers in Haskell. It takes a description of tokens based on regular expressions and generates a Haskell module containing code for scanning text efficiently. It is similar to the tool lex or flex for C/C++.

This package provides the Network.Multicast Haskell module for sending UDP datagrams over multicast (class D) addresses.

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

This module defines the Pandoc data structure, which is used by pandoc to represent structured documents. It also provides functions for building up, manipulating and serialising Pandoc structures.

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

This Haskell package provides interfaces and helper functions for the ghc-persistent package.

wizards is a package designed for the quick and painless development of interrogative programs, which revolve around a dialogue with the user, who is asked a series of questions in a sequence much like an installation wizard.

Everything from interactive system scripts, to installation wizards, to full-blown shells can be implemented with the support of wizards.

It is developed transparently on top of a free monad, which separates out the semantics of the program from any particular interface. A variety of backends exist, including console-based System.Console.Wizard.Haskeline and System.Console.Wizard.BasicIO, and the pure System.Console.Wizard.Pure. It is also possible to write your own backends, or extend existing back-ends with new features. While both built-in IO backends operate on a console, there is no reason why wizards cannot also be used for making GUI wizard interfaces.

An implementation of the git-lfs protocol.

A PointedList tracks the position in a non-empty list which works similarly to a zipper. A current item is always required, and therefore the list may never be empty. A circular PointedList wraps around to the other end when progressing past the actual edge.

Most data types in the Haskell platform do not have Lift instances. This package provides orphan instances for containers, text, bytestring and vector.

This Haskell package provides striped pooling abstraction for managing flexibly-sized collections of resources such as database connections.

This package provides the bytestring builder that is debuting in bytestring-0.10.4.0, which should be shipping with GHC 7.8. Compatibility package for older packages.

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