fingertree

Generic finger-tree structure, with example instances

Version on this page:	0.1.4.1
LTS Haskell 24.16:	0.1.6.2
Stackage Nightly 2025-10-25:	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.1@sha256:165408a651107150cf99da8f16d9ae98274f82349395a0e3f91a5d1eef82e079,2066

Module documentation for 0.1.4.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 3 packages in nightly-2018-05-18(full list with versions):

compressed, reducers, trifecta

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.