hw-fingertree

Generic finger-tree structure, with example instances

Version on this page:	0.1.0.0
LTS Haskell 22.17:	0.1.2.1@rev:2
Stackage Nightly 2023-12-26:	0.1.2.1@rev:2
Latest on Hackage:	0.1.2.1@rev:2

See all snapshots hw-fingertree appears in

BSD-3-Clause licensed

Maintained by Ross Paterson

This version can be pinned in stack with:hw-fingertree-0.1.0.0@sha256:2e848243206edf69e3cb5755f32757b7f6db1a4f04f9960e4031dcf87b974e1a,1986

Module documentation for 0.1.0.0

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

Depends on 2 packages(full list with versions):

base, deepseq

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.