fingertree

Generic finger-tree structure, with example instances

LTS Haskell 24.25:	0.1.6.2
Stackage Nightly 2025-12-23:	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.3@sha256:cd256474cab1d0a2e40f9440ad8194f790b06cef7aa70e5bc12bad09fc8acd96,2144

Module documentation for 0.1.6.3

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 11 packages in nightly-2025-12-23(full list with versions):

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