chimera: Lazy infinite streams with O(1) indexing and applications for memoization
There are plenty of memoizing libraries on Hackage, but they usually fall into two categories:
Store cache as a flat array, enabling us to obtain cached values in O(1) time, which is nice. The drawback is that one must specify the size of the array beforehand, limiting an interval of inputs, and actually allocate it at once.
Store cache as a lazy binary tree. Thanks to laziness, one can freely use the full range of inputs. The drawback is that obtaining values from a tree takes logarithmic time and is unfriendly to CPU cache, which kinda defeats the purpose.
This package intends to tackle both issues,
providing a data type
lazy infinite compact streams with cache-friendly O(1) indexing.
Additional features include:
memoization of recursive functions and recurrent sequences,
memoization of functions of several, possibly signed arguments,
efficient memoization of boolean predicates.
[Skip to Readme]
Define Representable instance from adjunctions package
Use -f <flag> to enable a flag, or -f -<flag> to disable that flag. More info
|Versions [RSS]||0.2.0.0, 0.3.0.0, 0.3.1.0, 0.3.2.0, 0.3.3.0, 0.3.4.0|
|Dependencies||adjunctions (<4.5), base (>=4.9 && <5), distributive (<0.7), infinite-list (<0.2), mtl (<2.4), primitive (<0.10), transformers (<0.7), vector (<0.14) [details]|
|Source repo||head: git clone https://github.com/Bodigrim/chimera|
|Uploaded||by Bodigrim at 2023-10-15T17:07:21Z|
|Distributions||Arch:0.3.4.0, LTSHaskell:0.3.4.0, NixOS:0.3.3.0, Stackage:0.3.4.0|
|Reverse Dependencies||2 direct, 7648 indirect [details]|
|Downloads||3864 total (73 in the last 30 days)|
|Rating||(no votes yet) [estimated by Bayesian average]|
|Status||Docs uploaded by user
Build status unknown [no reports yet]