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.


Automatic Flags

Use the new split-up base package.


Use -f <flag> to enable a flag, or -f -<flag> to disable that flag. More info


Maintainer's Corner

Package maintainers

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]
License BSD-3-Clause
Author John W. Lato,
Maintainer John W. Lato,
Category Data
Home page
Source repo head: darcs get
Uploaded by JohnLato at 2010-03-16T03:37:30Z
Reverse Dependencies 1 direct, 0 indirect [details]
Downloads 2833 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]