This package provides a simple interface for building .dot graph files, for input into the dot and graphviz tools. It includes a monadic interface for building graphs.

__This package is deprecated__. Please, use genByteString from the [random package (version >=1.2)](https://hackage.haskell.org/package/random) instead. . Efficient generation of random bytestrings. The implementation populates uninitialized memory with uniformily distributed random 64 bit words (and 8 bit words for remaining bytes at the end of the bytestring). . Random words are generated using the PRNG from the [mwc-random](https://hackage.haskell.org/package/mwc-random) package or the [pcg-random](https://hackage.haskell.org/package/pcg-random) package. It is also possible to use a custom PRNG by providing an instance for the RandomWords type class and using the function generate from the module "Data.ByteString.Random.Internal". . The generated byte strings are suitable for statistical applications. They are /not/ suitable for cryptographic applications. .  . 

This library provides a fast parser combinator library, aimed particularly at dealing efficiently with network protocols and complicated text/binary file formats.

This Haskell library provides a two-dimensional zipper data structure for editing text. The structure represents the body of text and an editing cursor which can be moved through it, along with a set of editing transformations.

Text zippers are generalized over the set of data types that might be used to store lists of characters (e.g., String, T.Text, etc.). Implementations using both of these examples are provided.

Happy is a parser generator for Haskell. Given a grammar specification in BNF, Happy generates Haskell code to parse the grammar. Happy works in a similar way to the yacc tool for C.

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

The config-ini Haskell library exports some simple monadic functions to ease the parsing of .ini-style configuration files, and to write and update them in an efficient diff-minimal way. This means that if you parse a file, update a single field, and reserialize, that file should differ only in the field we changed and that's it: field order, comments, and incidental whitespace will remain unchanged. The library aims to produce human-readable error messages when things go wrong.

This library provides backend-agnostic generation of client functions. For more information, see the README.

This package provides first class functional references. In addition to the usual operations of getting, setting and composition, plus integration with the state monad, lens families provide some unique features:

• Polymorphic updating

• Traversals

• Cast projection functions to read-only lenses

• Cast toList functions to read-only traversals

• Cast semantic editor combinators to modify-only traversals

For optimal first-class support use the lens-family package with rank 2/rank N polymorphism. Lens.Family.Clone allows for first-class support of lenses and traversals for those who require Haskell 98.

OpenGLRaw is a raw Haskell binding for the OpenGL 4.5 graphics system and lots of OpenGL extensions. It is basically a 1:1 mapping of OpenGL's C API, intended as a basis for a nicer interface. OpenGLRaw offers access to all necessary functions, tokens and types plus a general facility for loading extension entries. The module hierarchy closely mirrors the naming structure of the OpenGL extensions, making it easy to find the right module to import. All API entries are loaded dynamically, so no special C header files are needed for building this package. If an API entry is not found at runtime, a userError is thrown.

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

This library provides peek and poke functions for network byte order.

This library provides a framework for size-based enumerations.

A UTF8 layer for Strings. The utf8-string package provides operations for encoding UTF8 strings to Word8 lists and back, and for reading and writing UTF8 without truncation.

This package provides a data type These a b which can hold a value of either type or values of each type. This is usually thought of as an "inclusive or" type (contrasting Either a b as "exclusive or") or as an "outer join" type (contrasting (a, b) as "inner join").

data These a b = This a | That b | These a b

Since version 1, this package was split into parts:

• https://hackage.haskell.org/package/semialign For Align and Zip type-classes.

• https://hackage.haskell.org/package/semialign-indexed For SemialignWithIndex class, providing ialignWith and izipWith

• https://hackage.haskell.org/package/these-lens For lens combinators.

• http://hackage.haskell.org/package/monad-chronicle For transformers variant of These.

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

Cheapskate is an experimental Markdown processor in pure Haskell. It aims to process Markdown efficiently and in the most forgiving possible way. It is designed to deal with any input, including garbage, with linear performance. Output is sanitized by default for protection against cross-site scripting (XSS) attacks.

This package addresses the 'configuration problem' which is propagating configurations that are available at run-time, allowing multiple configurations to coexist without resorting to mutable global variables or System.IO.Unsafe.unsafePerformIO.

This library lets you create a one-shot timer, poll it using STM, and update it to ring at a different time than initially specified. It uses GHC event manager timeouts when available, yielding performance similar to threadDelay and registerDelay. Otherwise, it falls back to forked threads and threadDelay.

This package provides a Dec type for representing deciable relations.

type Neg a = a -> Void

data Dec a
    = Yes a
    | No (Neg a)

This is an industrial-strength monadic parser combinator library. Megaparsec is a feature-rich package that strikes a nice balance between speed, flexibility, and quality of parse errors.

This package supplements the Validity typeclass with standard properties for functions operating on them.

The ListLike module provides a common interface to the various Haskell types that are list-like. Predefined interfaces include standard Haskell lists, Arrays, ByteStrings, and lazy ByteStrings. Custom types can easily be made ListLike instances as well.

ListLike also provides for String-like types, such as String and ByteString, for types that support input and output, and for types that can handle infinite lists.

This Haskell library provides pointed and copointed data types.