fingertree

Generic finger-tree structure, with example instances

Version on this page:	0.1.0.1@rev:1
LTS Haskell 24.28:	0.1.6.3
Stackage Nightly 2026-01-18:	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.0.1@sha256:24eefc8246bb45d2421e09122b7ad73f8a7dd107cffb98fadff434adede447ad,1848

Module documentation for 0.1.0.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 9 packages in lts-1.9(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, reducers

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://www.soi.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.