Module Recency.Pool

module Set : sig ... end
val bottom : t
val top : t
val is_top : t -> bool
val subset : t -> t -> bool
val equal : t -> t -> bool
val compare : t -> t -> int
val join : t -> t -> t
val meet : t -> t -> t
val union : t -> t -> t
val inter : t -> t -> t
val diff : t -> t -> t
val widen : 'a Core.Context.ctx -> t -> t -> t
val print : Core.Print.printer -> t -> unit
val add : Set.elt -> t -> t
val fold : (Mopsa.addr -> 'a -> 'a) -> t -> 'a -> 'a
val remove : Mopsa.addr -> t -> t
val mem : Mopsa.addr -> t -> bool
val filter : (Set.elt -> bool) -> t -> t
val partition : (Set.elt -> bool) -> t -> t * t
val exists : (Set.elt -> bool) -> t -> bool
val for_all : (Set.elt -> bool) -> t -> bool
val cardinal : t -> int
val find : Set.elt -> t -> Mopsa.addr
val choose : t -> Mopsa.addr
val singleton : Mopsa.addr -> t
val is_empty : t -> bool
val empty : t
val is_bottom : t -> bool
val is_singleton : t -> bool
val elements : t -> Set.elt list
val map : (Mopsa.addr -> Mopsa.addr) -> t -> t
val iter : (Mopsa.addr -> unit) -> t -> unit
val apply : (Set.t -> 'a) -> 'a -> t -> 'a