The adaptive-tuple package

[ Tags: 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.

Properties

Versions 0.1.0, 0.1.1, 0.2.0
Dependencies base (<5), template-haskell (>=2.0 && <3), type-level (==0.2.*) [details]
License BSD3
Author John W. Lato, jwlato@gmail.com
Maintainer John W. Lato, jwlato@gmail.com
Category Data
Home page http://inmachina.net/~jwlato/haskell/
Source repository head: darcs get http://tanimoto.us/~jwlato/haskell/AdaptiveTuple
Uploaded Tue Mar 16 03:37:30 UTC 2010 by JohnLato
Distributions NixOS:0.2.0
Downloads 1024 total (76 in the last 30 days)
Rating (no votes yet) [estimated by rule of succession]
Your Rating
  • λ
  • λ
  • λ
Status Docs uploaded by user
Build status unknown [no reports yet]
Hackage Matrix CI

Modules

[Index]

Flags

NameDescriptionDefaultType
splitbase

Use the new split-up base package.

EnabledAutomatic

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

Downloads

Maintainer's Corner

For package maintainers and hackage trustees