rolling-queue: Bounded channel for STM that discards old entries when full
This package provides a FIFO channel for STM supporting a size limit. When this limit is reached, older entries are discarded to make way for newer entries.
The motivation for this is logging. If log entries are written to a plain
TChan, the program will use a lot of memory if it produces log entries
faster than they can be processed. If log entries are written to a bounded
channel where writes block (e.g. the
stm-chans package), the program may
deadlock if the log channel fills up. With
entries will be discarded instead.
Possible improvements (not available in
Discard lower-priority entries first.
Discard every other entry, so some of the older entries will still be available.
|Dependencies||base (==4.*), stm [details]|
|Copyright||Copyright (c) Joseph Adams 2012|
|Source repo||head: git clone git://github.com/joeyadams/haskell-rolling-queue.git|
|Uploaded||by JoeyAdams at 2012-02-16T09:11:29Z|
|Downloads||1438 total (26 in the last 30 days)|
|Rating||(no votes yet) [estimated by Bayesian average]|
Docs uploaded by user
Build status unknown [no reports yet]
For package maintainers and hackage trustees