@hackage q4c12-twofinger0
Efficient alternating finger trees
Categories
License
BSD-2-Clause
Maintainer
quasicomputational <quasicomputational@gmail.com>
Links
Versions
Installation
CustomDependencies (6)
- QuickCheck >=2.10.1 && <2.11
- base >=4.9.1.0 && <4.11
- bifunctors >=5.4.2 && <5.5
- deepseq >=1.4.3.0 && <1.5
- semigroupoids >=5.2.1 && <5.3
- streams >=3.3 && <3.4 Show all…
Dependents (1)
@hackage/acme-everything
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.