fingertree

Generic finger-tree structure, with example instances

Version on this page:	0.1.3.1
LTS Haskell 24.25:	0.1.6.2
Stackage Nightly 2025-12-24:	0.1.6.3
Latest on Hackage:	0.1.6.3

See all snapshots fingertree appears in

BSD-3-Clause licensed

Maintained by Ross Paterson

This version can be pinned in stack with:fingertree-0.1.3.1@sha256:55664c897d390667560efb62bb12ac97c1333e5b5d148e6bd80206f7e8fa1705,2066

Module documentation for 0.1.3.1

Data
- Data.FingerTree
- Data.IntervalMap
  - Data.IntervalMap.FingerTree
- Data.PriorityQueue
  - Data.PriorityQueue.FingerTree

Depends on 1 package(full list with versions):

base

Used by 5 packages in nightly-2017-12-30(full list with versions):

diagrams-lib, fingertree-psqueue, reducers, trifecta, yi-rope

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.