Applications and libraries/Data structures

This page contains a list of libraries and tools in a certain category. For a comprehensive list of such pages, see Applications and libraries.

1 Haskell Libraries and Tools for Data Structures

Edison
This is the latest version of the Edison library of efficient data structures. There are also earlier version of Edison by Chris Okasaki. It provides sequences, finite maps, priority queues, and sets/bags. (overview paper).
Data.Tree.AVL
An implementation of AVL trees and related utilities.
Data.StringMap
A library providing maps from String keys to values, based on Tries.
Strafunski
A bundle for generic programming. It provides programming support for generic traversal as useful in the implementation of program transformations.
This is a short preprocessor for stateful Haskell programs. It aleviates the pain of performing single array lookup/write/update functions with some syntax to support it. It also supports hash table operations based on the HashTable implementation available from the author. Finally, it supports monadic if and monadic case constructions. It is lightweight in the sense that it performs no syntactic analysis and is essentially a character transformer.
Partial v0.1
The Partial library provides a partial order class. It also provides routines for generating a Hasse diagram from a set and a partial order. Renderers are provided for the abstract Hasse diagram representation into LaTeX (via Xy-pic) and into dot, the format for AT&T's Graphviz tools. Since no horizontal sorting is done, the Xy-pic output is rather poor at present; dot does a much better job with its layout optimisation algorithm.
Discrete Interval Encoding Trees
The discrete interval encoding tree is a structure for storing subsets of types having a total order and a predecessor and a successor function.
Ranged Sets
A ranged set is a list of non-overlapping ranges. The ranges have upper and lower boundaries, and a boundary divides the base type into values above and below. No value can ever sit on a boundary. So you can have the set {2.0 < x <= 3.0, 5.3 < x < 6}
HList
A heterogeneous collection is a datatype that is capable of storing data of different types, while providing operations for look-up, update, iteration, and others. There are various kinds of heterogeneous collections, differing in representation, invariants, and access operations.
Fast mutable variables for IO and ST
Bulat Ziganshin's preliminary code for fast mutable variables in IO and ST.
Iavor Diatchki's library of monad transformers for Haskell. It enables the quick construction of monads --- abstract data types that capture common programming idioms, such as throwing and catching exceptions or continuations. In many programming languages such features are built into the language (if they're provided at all), but in Haskell they are user-programmable.
Pointless Haskell is library for point-free programming with recursion patterns defined as hylomorphisms. It also allows the visualization of the intermediate data structure of the hylomorphisms with GHood. This feature together with the DrHylo tool allows us to easily visualize recursion trees of Haskell functions.
Stefan Wehr's reactive objects library. Reactive objects are a convenient abstraction for writing programs which have to interact with a concurrent environment. A reactive object has two characteristics: the abandonment of all blocking operations and the unification of the concepts state and process. The former allows a reactive object to accept input from multiple sources without imposing any ordering on the input events. The latter prevents race conditions because the state of an object is only manipulated from the process belonging to the object.
GenUtil
A collection of random useful utility functions written in pure Haskell 98. In general, it trys to conform to the naming scheme put forth the Haskell prelude and fill in the obvious omissions, as well as provide useful routines in general.
The persistent document abstraction takes care of dealing with a document you want to open from and save to disk and that supports undo. This functionality can be used by editors of arbitrary documents and saves you a lot of quite subtle coding.
A generic monad for navigating around arbitrary data structures

1.1 Graphs

FGL - A Functional Graph Library
The functional graph library provides a collection of graph operations.
Data.Relation
Part of the UMinho Haskell libraries, this library provides a representation and operations on relations. A special case of relations are graphs. The operations include graph chopping and slicing, strong connected component analysis, graphs metrics, and more.
Jean-Philippe Bernardy's implementation of Brendan McKay's algorithm for graph canonic labeling and automorphism group (Nauty).

1.2 Strings

Fast Packed Strings
The FPS library provides mmapped and malloc'd packed strings (byte arrays held by a ForeignPtr), along with a list interface to these strings. It lets you do extremely fast IO in Haskell; in some cases, even faster than typical C implementations, as well as conserving space.
MissingH
MissingH is a library of pure-Haskell utility functions relating to strings, logging, and I/O.
HsLocale
A locale-aware replacement for the standard IO routines, and support for wide strings
VariableExpansion
A library for variable expansion inside strings

1.3 Serialising data

New binary
A port of Malcolm Wallace's Binary library from NHC, offering facilities for heap compression and binary I/O. The de-facto standard for binary IO in Haskell
SerTH
SerTH is a binary serialization library for Haskell. It supports serializing cyclic datatypes in a fast binary format. SerTH uses template haskell for deriving the serializing interface for new datatypes.
ByteStream
ByteStream is like the NHC Binary library. It provides marshalling of Haskell objects to byte streams and restoring them back.

1.4 Compressing data

Compression-2005
Features of the Compression-2005 Library:
• easy and uniform access to most competitive compression algorithms as of April?05: LZMA, PPMd and GRZip
• all input/output performed via user-supplied functions (callbacks), so you can compress data in memory, files, pipes, sockets and anything else
• all parameters of compression algorithm are defined with a single string, for example "lzma:8mb:fast:hc4:fb32".

1.5 Benchmarking data structures

Auburn
Auburn is Graeme Moss's kit for benchmarking implementations of lazy data structures. Give it several implementations of an ADT (abstract data type) and it will tell you which one is best for your particular application.
Bench
Simple time and space benchmarking for various list-like data structures. Easily adapted to arbitrary structures