fingertree

Generic finger-tree structure, with example instances

Version on this page:0.1.1.0
LTS Haskell 8.23:0.1.1.0
Stackage Nightly 2017-07-20:0.1.1.0
Latest on Hackage:0.1.1.0
BSD3 licensed
Maintained by Ross Paterson

Module documentation for 0.1.1.0

A general sequence representation with arbitrary annotations, for use as a base for implementations of various collection types, with examples, as described in section 4 of

For a tuned sequence type, see Data.Sequence in the containers package, which is a specialization of this structure.

comments powered byDisqus