The fingertree package
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.
Properties
| Versions | 0.0, 0.0.1.0, 0.0.1.1 |
|---|---|
| Dependencies | base (<6) |
| License | BSD3 |
| Copyright | (c) 2006 Ross Paterson, Ralf Hinze |
| Maintainer | Ross Paterson <ross@soi.city.ac.uk> |
| Category | Data Structures |
| Source repository | darcs get http://code.haskell.org/~ross/fingertree |
| Upload date | Sun Sep 2 15:34:46 UTC 2012 |
| Uploaded by | RossPaterson |
| Built on | ghc-7.4 |
| Distributions | NixOS: 0.0.1.1, Debian: 0.0.1.1 |
Modules
- Data
- Data.FingerTree
- IntervalMap
- PriorityQueue
Downloads
- fingertree-0.0.1.1.tar.gz (Cabal source package)
- package description (included in the package)