Generic finger-tree structure, with example instances

Version on this page:
LTS Haskell 22.17:
Stackage Nightly 2024-04-18:
Latest on Hackage:

See all snapshots fingertree appears in

BSD-3-Clause licensed
Maintained by Ross Paterson
This version can be pinned in stack with:fingertree-,1848

Module documentation for

  • Data
    • Data.FingerTree
    • Data.IntervalMap
      • Data.IntervalMap.FingerTree
    • Data.PriorityQueue
      • Data.PriorityQueue.FingerTree
Depends on 1 package(full list with versions):
Used by 3 packages in lts-0.7(full list with versions):

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

For a tuned sequence type, see Data.Sequence in the containers package, which is a specialization of this structure.