fingertree

Generic finger-tree structure, with example instances

Version on this page:	0.1.6.1
LTS Haskell 24.28:	0.1.6.3
Stackage Nightly 2026-01-19:	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.6.1@sha256:801e199e5a38b4d5c3a004be290144c20f5582e48f28793219a5f65cdf72af1e,2141

Module documentation for 0.1.6.1

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

Depends on 2 packages(full list with versions):

base, deepseq

Used by 10 packages in nightly-2025-05-24(full list with versions):

conduit-algorithms, core-text, diagrams-lib, diff-loc, distributed-process-client-server, distributed-process-extras, reducers, trifecta, what4, 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.