adaptive-tuple: Self-optimizing tuple types
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.
Flags
Automatic Flags
Name | Description | Default |
---|---|---|
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
Downloads
- adaptive-tuple-0.2.0.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)
Maintainer's Corner
For package maintainers and hackage trustees
Candidates
- 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] |
Tested with | ghc ==6.12.1, ghc ==6.10.4 |
License | BSD-3-Clause |
Author | John W. Lato, jwlato@gmail.com |
Maintainer | John W. Lato, jwlato@gmail.com |
Category | Data |
Home page | http://inmachina.net/~jwlato/haskell/ |
Source repo | head: darcs get http://tanimoto.us/~jwlato/haskell/AdaptiveTuple |
Uploaded | by JohnLato at 2010-03-16T03:37:30Z |
Distributions | |
Reverse Dependencies | 1 direct, 0 indirect [details] |
Downloads | 2890 total (10 in the last 30 days) |
Rating | (no votes yet) [estimated by Bayesian average] |
Your Rating | |
Status | Docs uploaded by user Build status unknown [no reports yet] |