Module SetDomain.Reverse

Reverses lattice order of a set domain while keeping the set operations same.

Parameters

module Base : S

Signature

include module type of struct include Base end
include Lattice.S
include Lattice.PO
include Printable.S
type elt = Base.elt
val empty : unit -> Base.t
val is_empty : Base.t -> bool
val mem : elt -> Base.t -> bool
val add : elt -> Base.t -> Base.t
val singleton : elt -> Base.t
val remove : elt -> Base.t -> Base.t
val union : Base.t -> Base.t -> Base.t
val inter : Base.t -> Base.t -> Base.t
val diff : Base.t -> Base.t -> Base.t
val subset : Base.t -> Base.t -> bool
val iter : (elt -> unit) -> Base.t -> unit
val map : (elt -> elt) -> Base.t -> Base.t
val fold : (elt -> 'a -> 'a) -> Base.t -> 'a -> 'a
val for_all : (elt -> bool) -> Base.t -> bool
val exists : (elt -> bool) -> Base.t -> bool
val filter : (elt -> bool) -> Base.t -> Base.t
val partition : (elt -> bool) -> Base.t -> Base.t * Base.t
val cardinal : Base.t -> int
val elements : Base.t -> elt list
val of_list : elt list -> Base.t
val min_elt : Base.t -> elt
val max_elt : Base.t -> elt
val choose : Base.t -> elt
val split : elt -> Base.t -> Base.t * bool * Base.t
include sig ... end
type t = Base.t
val equal : t -> t -> bool
val hash : t -> int
val compare : t -> t -> int
val show : t -> string
val pretty : unit -> t -> Pretty.doc
val to_yojson : t -> Printable.json
val invariant : Invariant.context -> t -> Invariant.t
val tag : t -> int
val relift : t -> t
val widen : Base.t -> Base.t -> Base.t
val narrow : Base.t -> Base.t -> Base.t
val bot : unit -> Base.t
val is_bot : Base.t -> bool
val top : unit -> Base.t
val is_top : Base.t -> bool
val leq : Base.t -> Base.t -> bool
val join : Base.t -> Base.t -> Base.t
val meet : Base.t -> Base.t -> Base.t
val name : unit -> string
val pretty_diff : unit -> (t * t) -> Pretty.doc
val printXml : 'a BatInnerIO.output -> Base.t -> unit
val arbitrary : unit -> Base.t QCheck.arbitrary