Combinators for building fast hashing functions. Includes hashing
functions for all basic Haskell 98 types.
This module provides set and multiset operations on ordered lists.
Prettyprint and compare Data values.
* Size limit for the output
* Time limit for the computation
* Escape exceptions
* Do not escape unicode characters
* Comparison: Highlight the first difference
* Comparison: Yes, No or Maybe results
Formatting time is slow. This package provides mechanisms to cache formatted
date.
Provides several utilities for easily converting among the various
standard library Date and Time types, and for converting between these
and standard external representations.
This package provides a "GHC.Generics"-based
'Control.DeepSeq.Generics.genericRnf' function which can be used for
providing a 'rnf' implementation.
A simple directory-like tree datatype, with useful IO functions and
Foldable and Traversable instance. Provides a simple data structure
mirroring a directory tree on the filesystem, as well as useful
functions for reading and writing file and directory structures in the
IO monad.
This package is the canonical source for some orphan instances. Orphan
instances are placed here to avoid dependencies elsewhere.
An inductive representation of manipulating graph data structures.
Differences lists are a list-like type supporting O(1) append. This is
particularly useful for efficient logging and pretty printing, (e.g.
with the Writer monad), where list append quickly becomes too expensive.