fingertree: Generic finger-tree structure, with example instances
This version is deprecated.
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
- Data
- Data.FingerTree
- IntervalMap
- Data.IntervalMap.FingerTree
- PriorityQueue
- Data.PriorityQueue.FingerTree
Downloads
- fingertree-0.1.6.0.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)
Maintainer's Corner
For package maintainers and hackage trustees
Candidates
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, 0.1.6.0, 0.1.6.1 (info) |
---|---|
Change log | changelog |
Dependencies | base (<6), deepseq (>=1.4 && <1.5) [details] |
License | BSD-3-Clause |
Copyright | (c) 2006 Ross Paterson, Ralf Hinze |
Author | |
Maintainer | Ross Paterson <R.Paterson@city.ac.uk> |
Category | Data Structures |
Bug tracker | http://hub.darcs.net/ross/fingertree/issues |
Source repo | head: darcs get http://hub.darcs.net/ross/fingertree |
Uploaded | by RossPaterson at 2025-05-12T22:47:14Z |
Distributions | Arch:0.1.5.0, Debian:0.1.4.2, Fedora:0.1.5.0, LTSHaskell:0.1.6.1, NixOS:0.1.5.0, Stackage:0.1.6.1 |
Reverse Dependencies | 60 direct, 2314 indirect [details] |
Downloads | 100669 total (45 in the last 30 days) |
Rating | 2.0 (votes: 2) [estimated by Bayesian average] |
Your Rating | |
Status | Docs not available [build log] All reported builds failed as of 2025-05-12 [all 2 reports] |