acc: Sequence optimized for monoidal construction and folding

[ library, mit, unclassified ] [ Propose Tags ]

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.

Versions [RSS] [faq] 0.1,,, 0.1.1, 0.1.2, 0.1.3
Dependencies base (>=4.11 && <5), deepseq (==1.4.*), semigroupoids (>=5.3 && <6) [details]
License MIT
Copyright (c) 2020 Nikita Volkov
Author Nikita Volkov <>
Maintainer Nikita Volkov <>
Home page
Bug tracker
Source repo head: git clone git://
Uploaded by NikitaVolkov at 2020-10-05T12:07:33Z
Distributions NixOS:0.1.3, Stackage:0.1.3
Downloads 655 total (20 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Hackage Matrix CI
Docs available [build log]
Last success reported on 2020-10-05 [all 1 reports]


[Index] [Quick Jump]


Maintainer's Corner

For package maintainers and hackage trustees