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.
Properties
| Versions | 0.1.0, 0.1.1, 0.2.0 |
|---|---|
| Dependencies | base (<3), template-haskell (≥2.0 & <3), type-level (0.2.*) or base (≥3 & <5), template-haskell (≥2.0 & <3), type-level (0.2.*) |
| License | BSD3 |
| Author | John W. Lato, jwlato@gmail.com |
| Maintainer | John W. Lato, jwlato@gmail.com |
| Stability | experimental |
| Category | Data |
| Home page | http://inmachina.net/~jwlato/haskell/ |
| Source repository | darcs get http://tanimoto.us/~jwlato/haskell/AdaptiveTuple |
| Upload date | Tue Mar 16 03:37:30 UTC 2010 |
| Uploaded by | JohnLato |
| Built on | ghc-6.12 |
| Build failure | ghc-7.0 (log) |
Modules
Downloads
- adaptive-tuple-0.2.0.tar.gz (Cabal source package)
- package description (included in the package)