Bindings to the Xft, X Free Type interface library, and some Xrender parts.

Async provides a library to run IO operations asynchronously, and wait for their results. It is a higher-level interface over threads in Haskell, in which Async a is a concurrent thread that will eventually deliver a value of type a.

Provides a FilePath datatype and utility functions for operating on it. Unlike the filepath package, this package does not simply reuse String, increasing type safety.

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.

Takes an error-throwing expression and puts it back in the Maybe it belongs in.

Note that this suffers from the https://ghc.haskell.org/trac/ghc/ticket/5902. Buyer beware.

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

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 package provides a Haskell library including a couple of different implementations of mutable hash tables in the ST monad, as well as a typeclass abstracting their common operations, and a set of wrappers to use the hash tables in the IO monad.

This package provides helper functions for working with haskell-src-exts trees.

This Haskell package provides the core MonadUnliftIO typeclass, instances for base and transformers, and basic utility functions.

wordexp(3) wrapper library for Haskell to perform word expansion like a posix-shell.

This package exports a module which is the recommended starting point for using microlens if you aren't trying to keep your dependencies minimal. By importing Lens.Micro.Platform you get all functions and instances from microlens, microlens-th, microlens-mtl, microlens-ghc, as well as instances for Vector, Text, and HashMap. The minor and major versions of microlens-platform are incremented whenever the minor and major versions of any other microlens package are incremented, so you can depend on the exact version of microlens-platform without specifying the version of microlens you need. This package is a part of the microlens family; see the readme on Github.

A library for generating concise pretty printers based on precedence rules.

This library provides Numeric.Interval.Interval, which represents a closed, convex set of floating point values.

This package provides a simple applicative parser in Parsec style.

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

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 package provides the Yale Haskell system running on top of CLISP.

The Glasgow Haskell Compiler (GHC) is a state-of-the-art compiler and interactive environment for the functional language Haskell.

The Glasgow Haskell Compiler (GHC) is a state-of-the-art compiler and interactive environment for the functional language Haskell.

The Glasgow Haskell Compiler (GHC) is a state-of-the-art compiler and interactive environment for the functional language Haskell.

The Glasgow Haskell Compiler (GHC) is a state-of-the-art compiler and interactive environment for the functional language Haskell.

The Glasgow Haskell Compiler (GHC) is a state-of-the-art compiler and interactive environment for the functional language Haskell.

The Glasgow Haskell Compiler (GHC) is a state-of-the-art compiler and interactive environment for the functional language Haskell.