q4c12-twofinger: Efficient alternating finger trees
This package provides efficient alternating sequences based on finger trees. These can represent sequences made up of two types of element, e and a where two of the same type of element cannot follow each other directly.
Four different flavours are provided, isomorphic to ([(a, e)], a), ([(e, a)], e), [(a, e)], and [(e, a)].
Cons-like operations are O(1) amortised, and append operations are O(log(min(n, m))) amortised.
For more details, please see the Haddock documentation of Q4C12.TwoFinger.
[Skip to Readme]
Downloads
- q4c12-twofinger-0.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, 0.0.0.1, 0.0.0.2, 0.1, 0.2 |
|---|---|
| Change log | CHANGELOG.markdown |
| Dependencies | base (>=4.9.1.0 && <4.11), bifunctors (>=5.4.2 && <5.6), containers (>=0.5.10.2 && <0.5.11), deepseq (>=1.4.3.0 && <1.5), semigroupoids (>=5.2.1 && <5.3) [details] |
| License | BSD-2-Clause |
| Author | quasicomputational <quasicomputational@gmail.com> |
| Maintainer | quasicomputational <quasicomputational@gmail.com> |
| Category | Data Structures |
| Home page | https://github.com/quasicomputational/mega/tree/master/packages/twofinger |
| Bug tracker | https://github.com/quasicomputational/mega/issues |
| Source repo | head: git clone https://github.com/quasicomputational/mega |
| Uploaded | by quasicomputational at 2018-01-17T16:46:22Z |
| Distributions | |
| Reverse Dependencies | 1 direct, 0 indirect [details] |
| Downloads | 3004 total (18 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-01-17 [all 1 reports] |