Module Locksets.MustLockset

type elt = Lockset.elt
val empty : unit -> Lockset.t
val is_empty : Lockset.t -> bool
val mem : elt -> Lockset.t -> bool
val add : elt -> Lockset.t -> Lockset.t
val singleton : elt -> Lockset.t
val remove : elt -> Lockset.t -> Lockset.t
val union : Lockset.t -> Lockset.t -> Lockset.t
val inter : Lockset.t -> Lockset.t -> Lockset.t
val diff : Lockset.t -> Lockset.t -> Lockset.t
val subset : Lockset.t -> Lockset.t -> bool
val disjoint : Lockset.t -> Lockset.t -> bool
val iter : (elt -> unit) -> Lockset.t -> unit
val map : (elt -> elt) -> Lockset.t -> Lockset.t
val fold : (elt -> 'a -> 'a) -> Lockset.t -> 'a -> 'a
val for_all : (elt -> bool) -> Lockset.t -> bool
val exists : (elt -> bool) -> Lockset.t -> bool
val filter : (elt -> bool) -> Lockset.t -> Lockset.t
val partition : (elt -> bool) -> Lockset.t -> Lockset.t * Lockset.t
val cardinal : Lockset.t -> int
val elements : Lockset.t -> elt list
val of_list : elt list -> Lockset.t
val min_elt : Lockset.t -> elt
val max_elt : Lockset.t -> elt
val choose : Lockset.t -> elt
type t = Lockset.t
val equal : t -> t -> bool
val hash : t -> int
val compare : t -> t -> int
val show : t -> string
val pretty : unit -> t -> Printable.Pretty.doc
val to_yojson : t -> Yojson.Safe.t
val tag : t -> int
val relift : t -> t
val widen : Lockset.t -> Lockset.t -> Lockset.t
val narrow : Lockset.t -> Lockset.t -> Lockset.t
val bot : unit -> Lockset.t
val is_bot : Lockset.t -> bool
val top : unit -> Lockset.t
val is_top : Lockset.t -> bool
val leq : Lockset.t -> Lockset.t -> bool
val join : Lockset.t -> Lockset.t -> Lockset.t
val meet : Lockset.t -> Lockset.t -> Lockset.t
val name : unit -> string
val pretty_diff : unit -> (t * t) -> Lattice.Pretty.doc
val printXml : 'a BatInnerIO.output -> Lockset.t -> unit
val arbitrary : unit -> Lockset.t QCheck.arbitrary