Package0.1.6.3Data Structures
fingertree
Generic finger-tree structure, with example instances
- Version0.1.6.3
- CategoryData Structures
- LicenceBSD-3-Clause
- MaintainerRoss Paterson <R.Paterson@city.ac.uk>
- Pinned byhackage fingertree 0.1.6.3
- Sourcehackage.haskell.org/package/fingertree-0.1.6.3
Modules
- Data.FingerTreeA general sequence representation with arbitrary annotations, for
- Data.IntervalMap.FingerTreeInterval maps implemented using the FingerTree type, following
- Data.PriorityQueue.FingerTreeMin-priority queues implemented using the FingerTree type,
Description
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. https://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.
Depends on
2 packages- base-4.23.0.0with GHC
- deepseq-1.5.2.0with GHC