This package provides a set of helper programs necessary to build the Gtk2Hs suite of libraries. These tools include a modified c2hs binding tool that is used to generate FFI declarations, a tool to build a type hierarchy that mirrors the C type hierarchy of GObjects found in glib, and a generator for signal declarations that are used to call back from C to Haskell. These tools are not needed to actually run Gtk2Hs programs.

This package provides a binary serialization library, similar to binary, that introduces an isolate primitive for parser isolation, and labeled blocks for better error messages.

This package contains a backend for ghc-persistent using the MySQL database server. Internally it uses the ghc-mysql-simple and mysql packages in order to access the database. This package supports only MySQL 5.1 and above. However, it has been tested only on MySQL 5.5. Only the InnoDB storage engine is officially supported.

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

Network.HostName is a simple package providing a means to determine the hostname.

This library uses GHC.Generics to derive efficient optics (traversals, lenses and prisms) for algebraic data types in a type-directed way, with a focus on good type inference and error messages when possible. The library exposes a van Laarhoven interface. For an alternative interface, supporting an opaque optic type, see generic-optics.

This package provides the ability to adapt to locale conventions such as date and time formats.

This library provides a half-precision floating-point computation library for Haskell.

The YAML 1.2 format provides a much richer data-model and feature-set than the JavaScript Object Notation format. However, sometimes it's desirable to ignore the extra capabilities and treat YAML as if it was merely a more convenient markup format for humans to write JSON data. To this end this module provides a compatibility layer atop ghc-hsyaml ,which allows decoding YAML documents in the more limited JSON data-model while also providing convenience by reusing ghc-aeson's FromJSON instances for decoding the YAML data into native Haskell data types.

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 provides Haskell bindings to bibutils, a library that interconverts between various bibliography formats using a common MODS-format XML intermediate.

vty is a terminal GUI library in the niche of ncurses, intended to be easy to use and to provide good support for common terminal types.

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

For examples and an introduction to the library please take a look at the <https://github.com/CRogers/should-not-typecheck#should-not-typecheck- README> on github.

This package provides Haskell bindings to bzlib and Conduit support for streaming compression and decompression.

ANSI terminal backend for the prettyprinter package.

This library encourages an error-handling style that directly uses the type system, rather than out-of-band exceptions.

This library contains simple and easy-to-use primitives for I/O using streams.

This package provides a library to parse and render YAML documents.

This is a lightweight package providing commonly useful parser combinators.

This package provides a Haskell library for setting environment variables.

A prettyprinter/text rendering engine. Easy to use, well-documented, ANSI terminal backend exists, HTML backend is trivial to implement, no name clashes, Text-based, extensible.

Skylighting is a syntax highlighting library with support for over one hundred languages. It derives its tokenizers from XML syntax definitions used by KDE's KSyntaxHighlighting framework, so any syntax supported by that framework can be added. An optional command-line program is provided. Skylighting is intended to be the successor to highlighting-kate.

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