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]
Downloads
- hw-fingertree-strict-0.1.1.0.tar.gz [browse] (Cabal source package)
- Package description (revised from the package)
Note: This package has metadata revisions in the cabal description newer than included in the tarball. To unpack the package including the revisions, use 'cabal get'.
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, semigroups (>=0.18 && <0.19) [details] |
| License | BSD-3-Clause |
| Copyright | 2017 John Ky; 2006 Ross Paterson, Ralf Hinze |
| Author | John Ky |
| Maintainer | newhoggy@gmail.com |
| Revised | Revision 1 made by GeorgeWilson at 2018-05-29T06:00:59Z |
| 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 2018-05-29T05:39:52Z |
| Distributions | LTSHaskell:0.1.2.1 |
| Reverse Dependencies | 2 direct, 0 indirect [details] |
| Downloads | 4961 total (38 in the last 30 days) |
| Rating | (no votes yet) [estimated by Bayesian average] |
| Your Rating | |
| Status | Docs available [build log] Last success reported on 2018-05-29 [all 1 reports] |
