List-like data structures with O(log(n)) random access http://code.haskell.org/~bkomuves/
|Latest on Hackage:||0.2|
This package is not currently in any snapshots. If you're interested in using it, we recommend adding it to Stackage Nightly. Doing so will make builds more reliable, and allow stackage.org to host generated Haddocks.
List-like data structures implemented using nested data types and polymorphic
recursion. Also called "n-ary random access lists". They supports
while still having amortized
O(1) access to the left end of the sequence.
Somewhat similar to finger trees, but much simpler, and the ternary and
quaternary versions are also more memory efficient; however, modifying
the right end of the sequence is still slow. See
for general comments and
Data.Nested.Seq.Binary.Lazy for an explanation
of the data structure.