fingertree

Generic finger-tree structure, with example instances

Version on this page:	0.1.1.0@rev:1
LTS Haskell 24.16:	0.1.6.2
Stackage Nightly 2025-10-24:	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.1.0@sha256:b372fff57444c1cc01cde49a46bf8e250b8e89de4c3232d0d554034563951030,1904

Module documentation for 0.1.1.0

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

Depends on 1 package(full list with versions):

base

Used by 12 packages in lts-2.22(full list with versions):

compressed, diagrams-lib, distributed-process-async, distributed-process-client-server, distributed-process-execution, distributed-process-extras, distributed-process-supervisor, distributed-process-task, ide-backend, ide-backend-common, 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.