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.
Note that the derived compare
and equal
functions are sensitive to the underlying implementation and in particular won't equate some objects that denote the same map.
include Ppx_compare_lib.Comparable.S with type t := t
val compare : t Base__Ppx_compare_lib.compare
include Ppx_compare_lib.Equal.S with type t := t
val equal : t Base__Ppx_compare_lib.equal
val pp : F.formatter -> t -> unit
val empty : t
val is_empty : t -> bool