This package provides a simple logging abstraction that allows multiple back-ends.

This package provides a Haskell library including a Storable instance for Complex which is binary compatible with C99, C++ and Fortran complex data types.

The zip-archive library provides functions for creating, modifying, and extracting files from zip archives in Haskell.

This is a Haskell library for writing CGI programs.

This package provides various extra monoid-related definitions and utilities, such as monoid actions, monoid coproducts, semi-direct products, "deletable" monoids, "split" monoids, and "cut" monoids.

This library provides a wrapper to the Linux kernel's inotify feature, allowing applications to subscribe to notifications when a file is accessed or modified.

This is an implementation of Tarjan's Union-Find algorithm (Robert E.: Tarjan. "Efficiency of a Good But Not Linear Set Union Algorithm",JACM 22(2), 1975) in order to maintain an equivalence relation. This implementation is a port of the union-find package using the ST monad transformer (instead of the IO monad).

This library provides instances of Binary for the types defined in the vector package, making it easy to serialize vectors to and from disk. We use the generic interface to vectors, so all vector types are supported. Specific instances are provided for unboxed, boxed and storable vectors.

This package provides a module to use Skylighting to perform syntax highlighting and display the results in Brick-based interfaces.

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 a compatibility layer for using GHC call stacks with different versions of the compiler.

This Haskell library provides a place for lots of orphan instances for the ghc-vector package.

This library provides a wrapper to mmap, allowing files or devices to be lazily loaded into memory as strict or lazy ByteStrings, ForeignPtrs or plain Ptrs, using the virtual memory subsystem to do on-demand loading.

This package provides a version of ghc-hspec-expectations generalized to MonadIO.

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 distributive functors for Haskell. Dual to Traversable.

This library provides functions for use in parsing indentation sensitive contexts. It parses blocks of lines all indented to the same level as well as lines continued at an indented level below.

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

This package provides extra instances for type-classes in the [indexed-traversable](https://hackage.haskell.org/package/indexed-traversable) package. . The intention is to keep this package minimal; it provides instances that formerly existed in @lens@ or @optics-extra@. We recommend putting other instances directly into their defining packages. The @indexed-traversable@ package is light, having only GHC boot libraries as its dependencies.

This package provides modules containing facilities for manipulating Haskell source code using Template Haskell. See http://www.haskell.org/haskellwiki/Template_Haskell for more information.

This package provides a new data structure for accurate on-line accumulation of rank-based statistics such as quantiles and trimmed means. . See original paper: "Computing extremely accurate quantiles using t-digest" by Ted Dunning and Otmar Ertl for more details <https://github.com/tdunning/t-digest/blob/07b8f2ca2be8d0a9f04df2feadad5ddc1bb73c88/docs/t-digest-paper/histo.pdf>.

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

Haddock is a documentation-generation tool for Haskell libraries. These modules expose some functionality of it without pulling in the GHC dependency. Please note that the API is likely to change so specify upper bounds in your project if you can't release often. For interacting with Haddock itself, see the ‘haddock’ package.

Checkers wraps up the expected properties associated with various standard type classes as QuickCheck properties. It also provides some morphism properties, arbitrary instances, and generator combinators for common data types.