The adaptive-tuple package
Self optimizing tuple types.
Adaptive tuples are tuple types in which the number of elements is determined at run-time. These structures are designed to combine the space-efficiency of tuples with the size flexibility of lists.
Adaptive tuples provide lazy and strict, unpacked data structures for all tuple sizes from 0 to 20 elements. Adaptive tuples of more than 20 elements are allowed, however they are stored in an ordinary list.
|Versions||0.1.0, 0.1.1, 0.2.0|
|Change log||None available|
|Dependencies||base (<5), haskell98, template-haskell (>=2.0 && <3), type-level (==0.2.*)|
|Author||John W. Lato, email@example.com|
|Maintainer||John W. Lato, firstname.lastname@example.org|
|Uploaded||Wed Jan 27 21:42:11 UTC 2010 by JohnLato|
|Downloads||513 total (21 in last 30 days)|
|Status||Docs uploaded by user|
Build status unknown [no reports yet]
|splitbase||Use the new split-up base package.||Enabled|
Use -f <flag> to enable a flag, or -f -<flag> to disable that flag. More info
- adaptive-tuple-0.1.0.tar.gz [browse] (Cabal source package)
- Package description (included in the package)
For package maintainers and hackage trustees