`sig
module Tree :
sig
type 'elt t =
('elt, Comparator.Poly.comparator_witness) Core_set.Tree.t
val length : 'a t -> int
val is_empty : 'a t -> bool
val iter : 'a t -> f:('a -> unit) -> unit
val fold : 'a t -> init:'accum -> f:('accum -> 'a -> 'accum) -> 'accum
val exists : 'a t -> f:('a -> bool) -> bool
val for_all : 'a t -> f:('a -> bool) -> bool
val count : 'a t -> f:('a -> bool) -> int
val sum :
(module Commutative_group.S with type t = 'sum) ->
'a t -> f:('a -> 'sum) -> 'sum
val find : 'a t -> f:('a -> bool) -> 'a option
val find_map : 'a t -> f:('a -> 'b option) -> 'b option
val to_list : 'a t -> 'a list
val to_array : 'a t -> 'a array
val invariants : 'a t -> bool
val mem : 'a t -> 'a -> bool
val add : 'a t -> 'a -> 'a t
val remove : 'a t -> 'a -> 'a t
val union : 'a t -> 'a t -> 'a t
val inter : 'a t -> 'a t -> 'a t
val diff : 'a t -> 'a t -> 'a t
val symmetric_diff : 'a t -> 'a t -> ('a, 'a) Either.t Sequence.t
val compare_direct : 'a t -> 'a t -> int
val equal : 'a t -> 'a t -> bool
val subset : 'a t -> 'a t -> bool
val fold_until :
'a t ->
init:'b -> f:('b -> 'a -> [ `Continue of 'b | `Stop of 'b ]) -> 'b
val fold_right : 'a t -> init:'b -> f:('a -> 'b -> 'b) -> 'b
val iter2 :
'a t ->
'a t ->
f:([ `Both of 'a * 'a | `Left of 'a | `Right of 'a ] -> unit) -> unit
val filter : 'a t -> f:('a -> bool) -> 'a t
val partition_tf : 'a t -> f:('a -> bool) -> 'a t * 'a t
val elements : 'a t -> 'a list
val min_elt : 'a t -> 'a option
val min_elt_exn : 'a t -> 'a
val max_elt : 'a t -> 'a option
val max_elt_exn : 'a t -> 'a
val choose : 'a t -> 'a option
val choose_exn : 'a t -> 'a
val split : 'a t -> 'a -> 'a t * 'a option * 'a t
val group_by : 'a t -> equiv:('a -> 'a -> bool) -> 'a t list
val find_exn : 'a t -> f:('a -> bool) -> 'a
val find_index : 'a t -> int -> 'a option
val remove_index : 'a t -> int -> 'a t
val to_tree : 'a t -> 'a t
val to_sequence :
?order:[ `Decreasing | `Increasing ] ->
?greater_or_equal_to:'a ->
?less_or_equal_to:'a -> 'a t -> 'a Sequence.t
val to_map :
'a t ->
f:('a -> 'b) ->
('a, 'b, Comparator.Poly.comparator_witness) Core_set_intf.Map.t
val empty : 'a t
val singleton : 'a -> 'a t
val union_list : 'a t list -> 'a t
val of_list : 'a list -> 'a t
val of_array : 'a array -> 'a t
val of_sorted_array : 'a array -> 'a t Or_error.t
val of_sorted_array_unchecked : 'a array -> 'a t
val stable_dedup_list : 'a list -> 'a list
val map : ('a, 'c) Tree.t -> f:('a -> 'b) -> 'b t
val filter_map : ('a, 'c) Tree.t -> f:('a -> 'b option) -> 'b t
val of_tree : 'a t -> 'a t
val of_map_keys :
('a, 'b, Comparator.Poly.comparator_witness) Core_set_intf.Map.t ->
'a t
val t_of_sexp :
(Sexplib.Sexp.t -> 'elt) ->
Sexplib.Sexp.t -> 'elt Core_set.Poly.Tree.t
val sexp_of_t :
('elt -> Sexplib.Sexp.t) ->
'elt Core_set.Poly.Tree.t -> Sexplib.Sexp.t
end
type 'elt t = ('elt, Comparator.Poly.comparator_witness) Core_set.Poly.t
val length : 'a t -> int
val is_empty : 'a t -> bool
val iter : 'a t -> f:('a -> unit) -> unit
val fold : 'a t -> init:'accum -> f:('accum -> 'a -> 'accum) -> 'accum
val exists : 'a t -> f:('a -> bool) -> bool
val for_all : 'a t -> f:('a -> bool) -> bool
val count : 'a t -> f:('a -> bool) -> int
val sum :
(module Commutative_group.S with type t = 'sum) ->
'a t -> f:('a -> 'sum) -> 'sum
val find : 'a t -> f:('a -> bool) -> 'a option
val find_map : 'a t -> f:('a -> 'b option) -> 'b option
val to_list : 'a t -> 'a list
val to_array : 'a t -> 'a array
val invariants : 'a t -> bool
val mem : 'a t -> 'a -> bool
val add : 'a t -> 'a -> 'a t
val remove : 'a t -> 'a -> 'a t
val union : 'a t -> 'a t -> 'a t
val inter : 'a t -> 'a t -> 'a t
val diff : 'a t -> 'a t -> 'a t
val symmetric_diff : 'a t -> 'a t -> ('a, 'a) Either.t Sequence.t
val compare_direct : 'a t -> 'a t -> int
val equal : 'a t -> 'a t -> bool
val subset : 'a t -> 'a t -> bool
val fold_until :
'a t ->
init:'b -> f:('b -> 'a -> [ `Continue of 'b | `Stop of 'b ]) -> 'b
val fold_right : 'a t -> init:'b -> f:('a -> 'b -> 'b) -> 'b
val iter2 :
'a t ->
'a t ->
f:([ `Both of 'a * 'a | `Left of 'a | `Right of 'a ] -> unit) -> unit
val filter : 'a t -> f:('a -> bool) -> 'a t
val partition_tf : 'a t -> f:('a -> bool) -> 'a t * 'a t
val elements : 'a t -> 'a list
val min_elt : 'a t -> 'a option
val min_elt_exn : 'a t -> 'a
val max_elt : 'a t -> 'a option
val max_elt_exn : 'a t -> 'a
val choose : 'a t -> 'a option
val choose_exn : 'a t -> 'a
val split : 'a t -> 'a -> 'a t * 'a option * 'a t
val group_by : 'a t -> equiv:('a -> 'a -> bool) -> 'a t list
val find_exn : 'a t -> f:('a -> bool) -> 'a
val find_index : 'a t -> int -> 'a option
val remove_index : 'a t -> int -> 'a t
val to_tree : 'a t -> 'a Tree.t
val to_sequence :
?order:[ `Decreasing | `Increasing ] ->
?greater_or_equal_to:'a -> ?less_or_equal_to:'a -> 'a t -> 'a Sequence.t
val to_map :
'a t ->
f:('a -> 'b) ->
('a, 'b, Comparator.Poly.comparator_witness) Core_set_intf.Map.t
val empty : 'a t
val singleton : 'a -> 'a t
val union_list : 'a t list -> 'a t
val of_list : 'a list -> 'a t
val of_array : 'a array -> 'a t
val of_sorted_array : 'a array -> 'a t Or_error.t
val of_sorted_array_unchecked : 'a array -> 'a t
val stable_dedup_list : 'a list -> 'a list
val map : ('a, 'c) t -> f:('a -> 'b) -> 'b t
val filter_map : ('a, 'c) t -> f:('a -> 'b option) -> 'b t
val of_tree : 'a Tree.t -> 'a t
val of_map_keys :
('a, 'b, Comparator.Poly.comparator_witness) Core_set_intf.Map.t -> 'a t
val t_of_sexp :
(Sexplib.Sexp.t -> 'elt) -> Sexplib.Sexp.t -> 'elt Core_set.Poly.t
val sexp_of_t :
('elt -> Sexplib.Sexp.t) -> 'elt Core_set.Poly.t -> Sexplib.Sexp.t
val compare :
('elt -> 'elt -> int) ->
'elt Core_set.Poly.t -> 'elt Core_set.Poly.t -> int
val bin_t :
'elt Bin_prot.Type_class.t -> 'elt Core_set.Poly.t Bin_prot.Type_class.t
val bin_read_t :
'elt Bin_prot.Read.reader -> 'elt Core_set.Poly.t Bin_prot.Read.reader
val __bin_read_t__ :
'elt Bin_prot.Read.reader ->
(int -> 'elt Core_set.Poly.t) Bin_prot.Read.reader
val bin_reader_t :
'elt Bin_prot.Type_class.reader ->
'elt Core_set.Poly.t Bin_prot.Type_class.reader
val bin_size_t :
'elt Bin_prot.Size.sizer -> 'elt Core_set.Poly.t Bin_prot.Size.sizer
val bin_write_t :
'elt Bin_prot.Write.writer -> 'elt Core_set.Poly.t Bin_prot.Write.writer
val bin_writer_t :
'elt Bin_prot.Type_class.writer ->
'elt Core_set.Poly.t Bin_prot.Type_class.writer
end`