acc: Sequence optimized for monoidal construction and folding
Data structure intended for accumulating a sequence of elements
for later traversal or folding.
Useful for implementing all kinds of builders on top.
.
The benchmarks show that for the described use-case it
is on average 2 times faster than DList
and Seq
,
is on par with list when you always prepend elements and
is exponentially faster than list when you append.
[Skip to Readme]
Downloads
- acc-0.2.0.3.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
- No Candidates
Versions [RSS] | 0.1, 0.1.0.1, 0.1.0.2, 0.1.1, 0.1.2, 0.1.3, 0.1.3.1, 0.2, 0.2.0.1, 0.2.0.2, 0.2.0.3 |
---|---|
Dependencies | base (>=4.13 && <5), deepseq (>=1.4 && <2), semigroupoids (>=5.3 && <7) [details] |
License | MIT |
Copyright | (c) 2020 Nikita Volkov |
Author | Nikita Volkov <nikita.y.volkov@mail.ru> |
Maintainer | Nikita Volkov <nikita.y.volkov@mail.ru> |
Revised | Revision 1 made by AndreasAbel at 2024-07-06T15:01:28Z |
Home page | https://github.com/nikita-volkov/acc |
Bug tracker | https://github.com/nikita-volkov/acc/issues |
Source repo | head: git clone https://github.com/nikita-volkov/acc.git |
Uploaded | by NikitaVolkov at 2023-11-29T19:03:16Z |
Distributions | LTSHaskell:0.2.0.3, NixOS:0.2.0.3, Stackage:0.2.0.3 |
Reverse Dependencies | 3 direct, 4 indirect [details] |
Downloads | 1933 total (21 in the last 30 days) |
Rating | 2.0 (votes: 1) [estimated by Bayesian average] |
Your Rating | |
Status | Docs available [build log] Last success reported on 2023-11-29 [all 1 reports] |