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://www.soi.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.
Downloads
- fingertree-0.1.0.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'.
Versions [RSS] | 0.0, 0.0.1.0, 0.0.1.1, 0.1.0.0, 0.1.0.1, 0.1.0.2, 0.1.1.0, 0.1.2.0, 0.1.2.1, 0.1.3.0, 0.1.3.1, 0.1.4.0, 0.1.4.1, 0.1.4.2, 0.1.5.0 (info) |
---|---|
Dependencies | base (<4.11) [details] |
License | BSD-3-Clause |
Copyright | (c) 2006 Ross Paterson, Ralf Hinze |
Author | |
Maintainer | Ross Paterson <ross@soi.city.ac.uk> |
Revised | Revision 1 made by HerbertValerioRiedel at 2018-08-30T10:06:13Z |
Category | Data Structures |
Source repo | head: darcs get http://code.haskell.org/~ross/fingertree |
Uploaded | by RossPaterson at 2015-02-06T16:11:06Z |
Distributions | Arch:0.1.5.0, Debian:0.1.4.2, Fedora:0.1.4.2, LTSHaskell:0.1.5.0, NixOS:0.1.5.0, Stackage:0.1.5.0, openSUSE:0.1.5.0 |
Downloads | 94286 total (256 in the last 30 days) |
Rating | 2.0 (votes: 2) [estimated by Bayesian average] |
Your Rating | |
Status | Docs available [build log] Last success reported on 2015-02-12 [all 1 reports] |