module Ocsigen_cache:sig
..end
It is based on a structure of doubly linked lists with maximum size,
that keeps only the mostly recently used values first, if you call the up
function each time you use a value.
(Insertion, remove and "up" in time 1).
This structure is exported, so that it can be used in other cases.
Not (preemptive) thread safe.
Author(s): Vincent Balat, Raphaƫl Proust (adding timers)
module Make:
val clear_all_caches : unit -> unit
module Dlist:sig
..end