The adaptive-containers package

[Tags:bsd3, library]

Self optimizing polymorphic container types.

Adaptive containers are polymorphic container types that use class associated data types to specialize particular element types to a more efficient container representation. The resulting structures tend to be both more time and space efficient.

A self-optimizing pair, for example, will unpack the constructors, yielding a representation for (Int,Char) requiring 8 bytes, instead of 24.

This difference can be visualized. Consider the expression:

 [ (x,y) | x <- [1..3], y <- [x..3] ]

Currently supported adaptive containers: pairs, lists, maybes

Most unboxed element types are supported.

Properties

Versions 0.1, 0.2, 0.2.1, 0.3
Dependencies base [details]
License BSD3
Author Don Stewart
Maintainer Don Stewart (dons@galois.com)
Stability Unknown
Category Data
Home page http://code.haskell.org/~dons/code/adaptive-containers
Uploaded Sat Apr 11 23:07:53 UTC 2009 by DonaldStewart
Distributions NixOS:0.3
Downloads 1047 total (15 in the last 30 days)
Votes
0 []
Status Docs uploaded by user
Build status unknown [no reports yet]

Modules

[Index]

Downloads

Maintainer's Corner

For package maintainers and hackage trustees