This package provides a GHC.Generics-based Control.DeepSeq.Generics.genericRnf function which can be used for providing an rnf implementation.

This package (formerly binary-serialise-cbor) provides pure, efficient serialization of Haskell values directly into ByteStrings for storage or transmission purposes. By providing a set of type class instances, you can also serialise any custom data type you have as well.

The underlying binary format used is the 'Concise Binary Object Representation', or CBOR, specified in RFC 7049. As a result, serialised Haskell values have implicit structure outside of the Haskell program itself, meaning they can be inspected or analyzed without custom tools.

An implementation of the standard bijection between CBOR and JSON is provided by the https://hackage.haskell.org/package/cborg-json package. Also see https://hackage.haskell.org/package/cbor-tool for a convenient command-line utility for working with CBOR data.

This package provides Haskell bindings for libcmark-gfm, the reference parser for GitHub Flavored Markdown, a fully specified variant of Markdown. It includes sources for libcmark-gfm and does not require prior installation of the C library.

This Haskell package aims to reexport all the non-conflicting and most general definitions from the "base" package.

This includes APIs for applicatives, arrows, monoids, foldables, traversables, exceptions, generics, ST, MVars and STM.

This package will never have any dependencies other than "base".

Versioning policy:

The versioning policy of this package deviates from PVP in the sense that its exports in part are transitively determined by the version of "base". Therefore it's recommended for the users of ghc-base-prelude to specify the bounds of "base" as well.

This library implements the GHC API. It is like the compiler-provided ghc package, but it can be loaded on many compiler versions.

This library provides a SOCKS proxy (version 5) implementation.

This Haskell library provides strict left folds that stream in constant memory, and you can combine folds using Applicative style to derive new folds. Derived folds still traverse the container just once and are often as efficient as hand-written folds.

A rich drop-in replacement for base. For details and documentation please visit the project's home page.

LeanCheck is a simple enumerative property-based testing library. Properties are defined as Haskell functions returning a boolean value which should be true for all possible choices of argument values. LeanCheck applies enumerated argument values to these properties in search for a counterexample. Properties can be viewed as parameterized unit tests. LeanCheck works by producing tiers of test values: a possibly infinite list of finite sublists of same-and-increasingly-sized values.

This package provides the following modules: Math.NumberTheory.Logarithms and Math.NumberTheory.Powers.Integer from the arithmoi package, GHC.Integer.Logarithms.Compat and Math.NumberTheory.Power.Natural, as well as some additional functions in migrated modules.

This package provides ordered containers of intervals, with efficient search for all keys containing a point or overlapping an interval. See the example code on the home page for a quick introduction.

This library provides tools to calculate various string metrics efficiently.

This library provides Control.Lens. The combinators in Control.Lens provide a highly generic toolbox for composing families of getters, folds, isomorphisms, traversals, setters and lenses and their indexed variants.

This library provides a pure Haskell implementation of the Unicode Collation Algorithm described at http://www.unicode.org/reports/tr10/. It is not as fully-featured or as performant as text-icu, but it avoids a dependency on a large C library. Locale-specific tailorings are also provided.

This library provides core modules of a markup combinator library for Haskell.

This Haskell package provides some useful control operators for looping.

This library provides minimal Haskell binding to libxml2.

This package provides filtrable containers.

This Haskell library algorithms for vector arrays.

Provides generalisations of swap :: (a,b) -> (b,a) and assoc :: ((a,b),c) -> (a,(b,c)) to Bifunctors supporting similar operations (e.g. Either, These).

This library provides a framework for size-based enumerations.

This package defines an Active abstraction for time-varying values with finite start and end times. It is used for describing animations within the diagrams framework.

Get terminal window height and width without ncurses dependency.

This package provides the ShortText type which is suitable for keeping many short strings in memory. This is similar to how ShortByteString relates to ByteString.

The main difference between Text and ShortText is that ShortText uses UTF-8 instead of UTF-16 internally and also doesn't support zero-copy slicing (thereby saving 2 words). Consequently, the memory footprint of a (boxed) ShortText value is 4 words (2 words when unboxed) plus the length of the UTF-8 encoded payload.