hw-fingertree

Generic finger-tree structure, with example instances

Version0.1.2.1
CategoryData Structures
LicenceBSD-3-Clause
MaintainerJohn Ky <newhoggy@gmail.com>
Homepagegithub.com/haskell-works/hw-fingertree#readme
Pinned byhackage hw-fingertree 0.1.2.1
Sourcehw-fingertree-0.1.2.1 on Hackage

Modules

HaskellWorks.Data.FingerTreeA general sequence representation with arbitrary annotations, for
HaskellWorks.Data.IntervalMap.FingerTreeInterval maps implemented using the FingerTree type, following
HaskellWorks.Data.PriorityQueue.FingerTreeMin-priority queues implemented using the FingerTree type,

Description

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

base-4.22.0.0with GHC
deepseq-1.5.1.0with GHC
hw-prim-0.6.3.2in this set

Used by in this set · 0

Nothing in this set depends on it.