hw-fingertree

Generic finger-tree structure, with example instances https://github.com/haskell-works/hw-fingertree#readme

LTS Haskell 14.16:	0.1.1.1
Stackage Nightly 2019-12-08:	0.1.1.1
Latest on Hackage:	0.1.1.1

See all snapshots hw-fingertree appears in

BSD-3-Clause licensed

Maintained by John Ky

Module documentation for 0.1.1.1

This version can be pinned in stack with:hw-fingertree-0.1.1.1@sha256:f9ede1f29a1b4de374ab72452fb310c6320ba1bd8fee50c2d785b8dcdd076600,3368

HaskellWorks
- HaskellWorks.Data
  - HaskellWorks.Data.FingerTree
  - HaskellWorks.Data.IntervalMap
    - HaskellWorks.Data.IntervalMap.FingerTree
  - HaskellWorks.Data.PriorityQueue
    - HaskellWorks.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

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.

Depends on 3 packages(full list with versions):

base, deepseq, hw-prim