This package provides a small, efficient, and portable regex library for Perl 5 compatible regular expressions. The PCRE library is a set of functions that implement regular expression pattern matching using the same syntax and semantics as Perl 5.

This package provides default instances for types from the base package.

Provides an efficient Haskell implementation of Peano numbers

Provides default instances for types from the dlist package.

This Haskell library provides simple read-only access to the local computer's networking configuration. It is currently capable of getting a list of all the network interfaces and their respective IPv4, IPv6 and MAC addresses.

Old-time is a package for backwards compatibility with the old time library. For new projects, the newer time library is recommended.

Please see the README and documentation at <https://www.stackage.org/package/githash>

Provides a small set of helper functions for testing Megaparsec parsers with Hspec.

This package exposes combinators that can wrap arbitrary monadic actions. They run the action and potentially retry running it with some configurable delay for a configurable number of times. The purpose is to make it easier to work with IO and especially network IO actions that often experience temporary failure and warrant retrying of the original action. For example, a database query may time out for a while, in which case we should hang back for a bit and retry the query instead of simply raising an exception.

Haskell library for parsing of ISO 8601 dates, originally from aeson.

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

Clear to write, read and edit Haskell DSL for HTML.

• Names are consistent, and do not conflict with base or are keywords (all have suffix -).

• Same combinator can be used for attributes and elements (e.g. style_).

th-reify-many provides functions for recursively reifying top level declarations. The main intended use case is for enumerating the names of datatypes reachable from an initial datatype, and passing these names to some function which generates instances.

This package provides several functions to quickly search for substrings in strict or lazy ByteStrings. It also provides functions for breaking or splitting on substrings and replacing all occurrences of a substring (the first in case of overlaps) with another.

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

This library provides tools for ensuring that class members are shared.

This Haskell package was originally present in classy-prelude.

This package provides low-level bindings to the zlib package.

This package provides a simple type class for converting values of different string types into values of other string types.

This package provides the tldr command and a Haskell client library allowing users to update and view tldr pages from a shell. The tldr pages are a community effort to simplify the man pages with practical examples.

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.

Reasonably fast data encoding library.

This package provides an implementation of the standard diff algorithm, and utilities for pretty printing.