Generic caching library
val memoize : ?destruct:('b ‑> unit) ‑> ?expire:[ `Lru of int | `Keep_all | `Keep_one ] ‑> ('a ‑> 'b) ‑> 'a ‑> 'b
memoize ~destruct ~expire f
memoizes the results of f
.
Parameter expire: Strategy used to prune out values from the cache
`Keep_one
: only keeps the last result around`Keep_all
: (the default value) never delete any values from the cache`Lru n
: keep n
values in the cache and them removes the least recently
usedval unit : (unit ‑> 'a) ‑> unit ‑> 'a
Returns memoized version of any function with argument unit. In effect this builds a lazy value.
These modules implement memoization and give you access to the cache. This, for instance, enables you to flush it.
This enables you to implement your own caching strategy and store.
Generic caching is based on separating the replacement policie and the
store and tying them together with Make
.
module Make : functor (Strat : Strategy) -> functor (Store : Store) -> S with type 'a with_init_args = 'a Store.with_init_args Strat.with_init_args