hw-fingertree-strict: Generic strict finger-tree structure
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.
[Skip to Readme]
Modules
[Index] [Quick Jump]
- HaskellWorks
- Data
- FingerTree
- IntervalMap
- Item
- PriorityQueue
- Segment
- SegmentMap
- SegmentSet
- Data
Downloads
- hw-fingertree-strict-0.1.1.2.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)
Maintainer's Corner
For package maintainers and hackage trustees
Candidates
| Versions [RSS] | 0.1.0.0, 0.1.0.1, 0.1.0.2, 0.1.0.3, 0.1.1.0, 0.1.1.1, 0.1.1.2, 0.1.1.3, 0.1.2.0, 0.1.2.1 |
|---|---|
| Dependencies | base (>=4.7 && <5), deepseq (>=1.4 && <1.5), semigroups (>=0.18 && <0.19) [details] |
| License | BSD-3-Clause |
| Copyright | 2017-2019 John Ky; 2006 Ross Paterson, Ralf Hinze |
| Author | John Ky |
| Maintainer | newhoggy@gmail.com |
| Category | Data Structures |
| Home page | https://github.com/haskell-works/hw-fingertree-strict#readme |
| Bug tracker | https://github.com/haskell-works/hw-fingertree-strict/issues |
| Source repo | head: git clone https://github.com/haskell-works/hw-fingertree-strict |
| Uploaded | by haskellworks at 2019-10-03T01:29:02Z |
| Distributions | |
| Reverse Dependencies | 2 direct, 0 indirect [details] |
| Downloads | 5052 total (37 in the last 30 days) |
| Rating | (no votes yet) [estimated by Bayesian average] |
| Your Rating | |
| Status | Docs available [build log] Last success reported on 2019-10-03 [all 1 reports] |
