Circular fixed-sized mutable vectors
|Version on this page:||0.4.0.2|
|LTS Haskell 20.15:||0.4.0.3|
|Stackage Nightly 2023-03-20:||0.4.0.3|
|Latest on Hackage:||0.4.0.3|
Module documentation for 0.4.0.2
Circular stacks of fixed size.
Circular stacks are just normal vectors with a pointer to the last element.
Circular stacks may not be what you need because:
- You need all values at a later time anyways.
- You don’t want a monadic work flow, because circular stacks use mutable vectors.
Circular stacks are useful to you because:
- They have a fixed size and consequently have constant memory usage. Constant memory usage is important if values are gathered continuously but only a specific number of values is needed at a later time.
- They are fast, especially when summary statistics need to be computed across the stack.
Elements pushed on a circular stack replace the oldest (deepest) elements on the stack. QuickCheck and unit tests with HSpec give promising results — have a look yourself.
I use circular stacks, for example, as the data type for traces of Markov chains. In this case, lists cannot be used reliably, because the space requirement increases linearly with the chain length.
Circular is actively developed and functions may be removed, renamed, or
changed. Ideas are welcome!
Revision history for circular
- Tooling updtes related to GHC 9.2.1.
- Minor changes mostly related to tooling.
- Nix support.
- Do not export data constructors nor record fields.
Cabal changes, versioning changes.
- Change monadic folds so that commutativity is not anymore required.
foldKM, a fold over the last k elements on the stack.
- Make functions more consistent (
toVectornow both work on mutable stacks).
- Sort functions.
- Improve documentation.
- Complete rewrite using mutable vectors. A monadic interface is required now, but it is much cleaner in every other sense.
- Add benchmark.
- Many small improvements.