fingertree

Generic finger-tree structure, with example instances

Version on this page:0.1.0.0@rev:1
LTS Haskell 24.17:0.1.6.2
Stackage Nightly 2025-10-26: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.0.0@sha256:775757b6f92e7f3b6620d9d0114342a5c0982e3e81a977216d204078e89c2ea1,1848

Module documentation for 0.1.0.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 3 packages in lts-0.7(full list with versions):
compressed, diagrams-lib, 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

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