hw-fingertree: Generic finger-tree structure, with example instances

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

• Ralf Hinze and Ross Paterson, "Finger trees: a simple general-purpose data structure", Journal of Functional Programming 16:2 (2006) pp 197-217. http://staff.city.ac.uk/~ross/papers/FingerTree.html

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

Modules

[Index] [Quick Jump]

Downloads

• hw-fingertree-0.1.2.1.tar.gz [browse] (Cabal source package)
• Package description (revised from the package)

Note: This package has metadata revisions in the cabal description newer than included in the tarball. To unpack the package including the revisions, use 'cabal get'.

Maintainer's Corner

Package maintainers

• newhoggy, haskellworks

For package maintainers and hackage trustees

• edit package information

Candidates

• 0.1.0.0, 0.1.0.1