Module Ptset.BigPos

module BigPos: S 

type t 

type elt = int 

val empty : t

val is_empty : t -> bool

val mem : int -> t -> bool

val add : int -> t -> t

val singleton : int -> t

val remove : int -> t -> t

val union : t -> t -> t

val subset : t -> t -> bool

val inter : t -> t -> t

val diff : t -> t -> t

val equal : t -> t -> bool

val compare : t -> t -> int

val elements : t -> int list

val choose : t -> int

val cardinal : t -> int

val iter : (int -> unit) -> t -> unit

val fold : (int -> 'a -> 'a) -> t -> 'a -> 'a

val for_all : (int -> bool) -> t -> bool

val exists : (int -> bool) -> t -> bool

val filter : (int -> bool) -> t -> t

val partition : (int -> bool) -> t -> t * t

val split : int -> t -> t * bool * t

Warning: min_elt and max_elt are linear w.r.t. the size of the set. In other words, min_elt t is barely more efficient than fold
      min t (choose t).

val min_elt : t -> int

val max_elt : t -> int

Additional functions not appearing in the signature Set.S from ocaml standard library.

intersect u v determines if sets u and v have a non-empty intersection.

val intersect : t -> t -> bool

val choose_and_remove : t -> int * t

val to_string : t -> string