adaptive-tuple: Self-optimizing tuple types
[ bsd3, data, library ] [ Propose Tags ]
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.
Use the new split-up base package.
Use -f <flag> to enable a flag, or -f -<flag> to disable that flag. More info
- adaptive-tuple-0.2.0.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)
For package maintainers and hackage trustees
- No Candidates
|Versions [RSS]||0.1.0, 0.1.1, 0.2.0|
|Dependencies||base (<5), template-haskell (>=2.0 && <3), type-level (>=0.2 && <0.3) [details]|
|Author||John W. Lato, firstname.lastname@example.org|
|Maintainer||John W. Lato, email@example.com|
|Source repo||head: darcs get http://tanimoto.us/~jwlato/haskell/AdaptiveTuple|
|Uploaded||by JohnLato at 2010-03-16T03:37:30Z|
|Reverse Dependencies||1 direct, 0 indirect [details]|
|Downloads||2766 total (5 in the last 30 days)|
|Rating||(no votes yet) [estimated by Bayesian average]|
|Status||Docs uploaded by user
Build status unknown [no reports yet]