Module SetPt

type elt = int
type t =
  1. | Empty
  2. | Leaf of int
  3. | Branch of int * int * t * t
val empty : t
val is_empty : t -> bool
val singleton : int -> t
val zero_bit : int -> int -> bool
val mem : int -> t -> bool
val lowest_bit : int -> int
val branching_bit : int -> int -> int
val mask : int -> int -> int
val join : (int * t * int * t) -> t
val match_prefix : int -> int -> int -> bool
val add : int -> t -> t
val branch : (int * int * t * t) -> t
val remove : int -> t -> t
val merge : (t * t) -> t
val union : t -> t -> t
val subset : t -> t -> bool
val inter : t -> t -> t
val diff : t -> t -> t
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 choose : t -> int
val elements : t -> int list
val min_elt : t -> int
val max_elt : t -> int
val equal : 'a -> 'a -> bool
val compare : 'a -> 'a -> int
val make : int list -> t
val intersect : t -> t -> bool