Module NullByteSet.MaySet

module M : sig ... end
include module type of struct include M end
type t = [
  1. | `Lifted of SetDomain.Make(IntOps.BigIntOps).t
  2. | `Top
]
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 printXml : 'a BatInnerIO.output -> t -> unit
val to_yojson : t -> Yojson.Safe.t
val tag : t -> int
val arbitrary : unit -> t QCheck.arbitrary
val relift : t -> t
val leq : t -> t -> bool
val join : t -> t -> t
val meet : t -> t -> t
val widen : t -> t -> t
val narrow : t -> t -> t
val pretty_diff : unit -> (t * t) -> Lattice.Pretty.doc
val bot : unit -> t
val is_bot : t -> bool
val top : unit -> t
val is_top : t -> bool
val empty : unit -> t
val is_empty : t -> bool
val mem : elt -> t -> bool
val add : elt -> t -> t
val singleton : elt -> t
val union : t -> t -> t
val inter : t -> t -> t
val diff : t -> t -> t
val subset : t -> t -> bool
val disjoint : t -> t -> bool
val iter : (elt -> unit) -> t -> unit
val map : (elt -> elt) -> t -> t
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val for_all : (elt -> bool) -> t -> bool
val exists : (elt -> bool) -> t -> bool
val partition : (elt -> bool) -> t -> t * t
val cardinal : t -> int
val to_seq : t -> elt Stdlib.Seq.t
val of_list : elt list -> t
val max_elt : t -> elt
val choose : t -> elt
val name : unit -> string
val elements : ?max_size:Z.t -> M.t -> M.elt list
val remove : M.elt -> M.t -> Z.t -> M.t
val filter : ?max_size:Z.t -> (M.elt -> bool) -> M.t -> M.t
val min_elt : M.t -> M.elt