`sig type elt type t val empty : BatSet.S.t val is_empty : BatSet.S.t -> bool val singleton : BatSet.S.elt -> BatSet.S.t val mem : BatSet.S.elt -> BatSet.S.t -> bool val find : BatSet.S.elt -> BatSet.S.t -> BatSet.S.elt val add : BatSet.S.elt -> BatSet.S.t -> BatSet.S.t val remove : BatSet.S.elt -> BatSet.S.t -> BatSet.S.t val update : BatSet.S.elt -> BatSet.S.elt -> BatSet.S.t -> BatSet.S.t val union : BatSet.S.t -> BatSet.S.t -> BatSet.S.t val inter : BatSet.S.t -> BatSet.S.t -> BatSet.S.t val diff : BatSet.S.t -> BatSet.S.t -> BatSet.S.t val sym_diff : BatSet.S.t -> BatSet.S.t -> BatSet.S.t val compare : BatSet.S.t -> BatSet.S.t -> int val equal : BatSet.S.t -> BatSet.S.t -> bool val subset : BatSet.S.t -> BatSet.S.t -> bool val disjoint : BatSet.S.t -> BatSet.S.t -> bool val compare_subset : BatSet.S.t -> BatSet.S.t -> int val iter : (BatSet.S.elt -> unit) -> BatSet.S.t -> unit val at_rank_exn : int -> BatSet.S.t -> BatSet.S.elt val map : (BatSet.S.elt -> BatSet.S.elt) -> BatSet.S.t -> BatSet.S.t val filter : (BatSet.S.elt -> bool) -> BatSet.S.t -> BatSet.S.t val filter_map : (BatSet.S.elt -> BatSet.S.elt option) -> BatSet.S.t -> BatSet.S.t val fold : (BatSet.S.elt -> 'a -> 'a) -> BatSet.S.t -> 'a -> 'a val for_all : (BatSet.S.elt -> bool) -> BatSet.S.t -> bool val exists : (BatSet.S.elt -> bool) -> BatSet.S.t -> bool val partition : (BatSet.S.elt -> bool) -> BatSet.S.t -> BatSet.S.t * BatSet.S.t val split : BatSet.S.elt -> BatSet.S.t -> BatSet.S.t * bool * BatSet.S.t val split_opt : BatSet.S.elt -> BatSet.S.t -> BatSet.S.t * BatSet.S.elt option * BatSet.S.t val split_lt : BatSet.S.elt -> BatSet.S.t -> BatSet.S.t * BatSet.S.t val split_le : BatSet.S.elt -> BatSet.S.t -> BatSet.S.t * BatSet.S.t val cardinal : BatSet.S.t -> int val elements : BatSet.S.t -> BatSet.S.elt list val to_list : BatSet.S.t -> BatSet.S.elt list val to_array : BatSet.S.t -> BatSet.S.elt array val min_elt : BatSet.S.t -> BatSet.S.elt val pop_min : BatSet.S.t -> BatSet.S.elt * BatSet.S.t val pop_max : BatSet.S.t -> BatSet.S.elt * BatSet.S.t val max_elt : BatSet.S.t -> BatSet.S.elt val choose : BatSet.S.t -> BatSet.S.elt val pop : BatSet.S.t -> BatSet.S.elt * BatSet.S.t val enum : BatSet.S.t -> BatSet.S.elt BatEnum.t val backwards : BatSet.S.t -> BatSet.S.elt BatEnum.t val of_enum : BatSet.S.elt BatEnum.t -> BatSet.S.t val of_list : BatSet.S.elt list -> BatSet.S.t val of_array : BatSet.S.elt array -> BatSet.S.t val print : ?first:string -> ?last:string -> ?sep:string -> ('a BatInnerIO.output -> BatSet.S.elt -> unit) -> 'a BatInnerIO.output -> BatSet.S.t -> unit module Infix : sig val ( <-- ) : BatSet.S.t -> BatSet.S.elt -> BatSet.S.t val ( <. ) : BatSet.S.t -> BatSet.S.t -> bool val ( >. ) : BatSet.S.t -> BatSet.S.t -> bool val ( <=. ) : BatSet.S.t -> BatSet.S.t -> bool val ( >=. ) : BatSet.S.t -> BatSet.S.t -> bool val ( -. ) : BatSet.S.t -> BatSet.S.t -> BatSet.S.t val ( &&. ) : BatSet.S.t -> BatSet.S.t -> BatSet.S.t val ( ||. ) : BatSet.S.t -> BatSet.S.t -> BatSet.S.t end module Exceptionless : sig val min_elt : BatSet.S.t -> BatSet.S.elt option val max_elt : BatSet.S.t -> BatSet.S.elt option val choose : BatSet.S.t -> BatSet.S.elt option val find : BatSet.S.elt -> BatSet.S.t -> BatSet.S.elt option end module Labels : sig val iter : f:(BatSet.S.elt -> unit) -> BatSet.S.t -> unit val fold : f:(BatSet.S.elt -> 'a -> 'a) -> BatSet.S.t -> init:'a -> 'a val for_all : f:(BatSet.S.elt -> bool) -> BatSet.S.t -> bool val exists : f:(BatSet.S.elt -> bool) -> BatSet.S.t -> bool val map : f:(BatSet.S.elt -> BatSet.S.elt) -> BatSet.S.t -> BatSet.S.t val filter : f:(BatSet.S.elt -> bool) -> BatSet.S.t -> BatSet.S.t val filter_map : f:(BatSet.S.elt -> BatSet.S.elt option) -> BatSet.S.t -> BatSet.S.t val partition : f:(BatSet.S.elt -> bool) -> BatSet.S.t -> BatSet.S.t * BatSet.S.t end end`