fingertree

Generic finger-tree structure, with example instances

Version on this page:	0.1.4.2
LTS Haskell 24.18:	0.1.6.2
Stackage Nightly 2025-11-04:	0.1.6.2
Latest on Hackage:	0.1.6.2

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.4.2@sha256:b368fda61b14073bd798f45c8fa91e1c5331628193a8b88d93fb5a4341849c64,2063

Module documentation for 0.1.4.2

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

Depends on 1 package(full list with versions):

base

Used by 6 packages in nightly-2019-05-05(full list with versions):

diagrams-lib, pure-zlib, reducers, trifecta, unbeliever, 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.