Module type IStdlib__RecencyMap.S
A functional map interface where only the N most recently-accessed elements are guaranteed to be persisted, similarly to an LRU cache. The map stores at most 2*N elements.
val equal : t -> t -> boolval pp : F.formatter -> t -> unitval empty : tval add : key -> value -> t -> tval bindings : t -> (key * value) listval filter : t -> f:((key * value) -> bool) -> tval find_opt : key -> t -> value optionval fold : t -> init:'acc -> f:('acc -> (key * value) -> 'acc) -> 'accval fold_map : t -> init:'acc -> f:('acc -> value -> 'acc * value) -> 'acc * tval is_empty : t -> boolval mem : t -> key -> boolval union_left_biased : t -> t -> t