hw-fingertree

Generic finger-tree structure, with example instances

https://github.com/haskell-works/hw-fingertree#readme

Version on this page:0.1.2.1@rev:1
LTS Haskell 22.18: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 John Ky
This version can be pinned in stack with:hw-fingertree-0.1.2.1@sha256:66ed2c918bf86c50dc340c6f4b6bb31dbb049fcceb7b3796fdc5dc2ef39d9a83,4147

Module documentation for 0.1.2.1

Depends on 3 packages(full list with versions):
base, deepseq, hw-prim
Used by 2 packages in nightly-2022-08-19(full list with versions):
hw-balancedparens, hw-rankselect

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.