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

Versions0.1, 0.2, 0.2.1, 0.3
Dependenciesbase
LicenseBSD3
AuthorDon Stewart
MaintainerDon Stewart (dons@galois.com)
CategoryData
Home pagehttp://code.haskell.org/~dons/code/adaptive-containers
Upload dateSat Apr 11 23:07:53 UTC 2009
Uploaded byDonaldStewart
Downloads390 total (41 in last 30 days)

Modules

[Index]

Downloads

Maintainers' corner

For package maintainers and hackage trustees