A strict, immutable, thread-safe, single-ended, bounded queue.
|LTS Haskell 20.23:||1.0.0|
|Stackage Nightly 2023-05-31:||1.0.0|
|Latest on Hackage:||1.0.0|
Maintained by firstname.lastname@example.org
This version can be pinned in stack with:
Module documentation for 1.0.0
This library provides a strict, immutable, thread-safe, single-ended, bounded
queue. When the insert limit is reached and a
cons is attempted, this
automatically drops old entries off its end. Thus, writes always succeed and
This data structure is intended as a “sliding window” over some stream of data, where we wish old entries to be naturally forgotten. Since this is an immutable data structure and not a concurrent queue, we provide instances for the usual useful typeclasses with which one can perform analysis over the entire “window”.