The q4c12-twofinger package

[ Tags: bsd2, data-structures, library ] [ Propose Tags ]

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]

Properties

Versions 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 BSD2
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 repository head: git clone https://github.com/quasicomputational/mega
Uploaded Wed Jan 17 16:46:22 UTC 2018 by quasicomputational
Distributions NixOS:0.1
Downloads 484 total (318 in the last 30 days)
Rating (no votes yet) [estimated by rule of succession]
Your Rating
  • λ
  • λ
  • λ
Status Docs available [build log]
Last success reported on 2018-01-17 [all 1 reports]
Hackage Matrix CI

Modules

[Index]

Downloads

Maintainer's Corner

For package maintainers and hackage trustees


Readme for q4c12-twofinger-0.2

[back to package description]

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.