fingertree

Generic finger-tree structure, with example instances

Version on this page:0.1.3.1
LTS Haskell 22.14:0.1.5.0
Stackage Nightly 2024-03-29:0.1.5.0
Latest on Hackage:0.1.5.0

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.3.1@sha256:55664c897d390667560efb62bb12ac97c1333e5b5d148e6bd80206f7e8fa1705,2066

Module documentation for 0.1.3.1

  • Data
    • Data.FingerTree
    • Data.IntervalMap
      • Data.IntervalMap.FingerTree
    • Data.PriorityQueue
      • Data.PriorityQueue.FingerTree

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.