A Tree.t
contains just the tree data structure that a set is based on, without
including the comparator. Accordingly, any operation on a Tree.t
must also take
as an argument the corresponding comparator.
include sig ... end
val sexp_of_t : ('elt ‑> Base.Sexp.t) ‑> ('cmp ‑> Base.Sexp.t) ‑> ('elt, 'cmp) t ‑> Base.Sexp.t
module Named = Set_intf.Tree.Named
include Set_intf.Creators_and_accessors2_with_comparator with type (a, b) set := (a, b) t with type (a, b) t := (a, b) t with type (a, b) tree := (a, b) t with type (a, b) named := (a, b) Named.t with module Named := Named
include Set_intf.Accessors2_with_comparator
include Set_intf.Set.Accessors2_with_comparator
val length : ('a, 'b) t ‑> int
val is_empty : ('a, 'b) t ‑> bool
val iter : ('a, 'b) t ‑> f:('a ‑> unit) ‑> unit
val fold : ('a, 'b) t ‑> init:'accum ‑> f:('accum ‑> 'a ‑> 'accum) ‑> 'accum
val fold_result : ('a, 'b) t ‑> init:'accum ‑> f:('accum ‑> 'a ‑> ('accum, 'e) Base.Result.t) ‑> ('accum, 'e) Base.Result.t
val exists : ('a, 'b) t ‑> f:('a ‑> bool) ‑> bool
val for_all : ('a, 'b) t ‑> f:('a ‑> bool) ‑> bool
val count : ('a, 'b) t ‑> f:('a ‑> bool) ‑> int
val sum : (module Base.Commutative_group.S with type t = 'sum) ‑> ('a, 'b) t ‑> f:('a ‑> 'sum) ‑> 'sum
val find : ('a, 'b) t ‑> f:('a ‑> bool) ‑> 'a option
val find_map : ('a, 'c) t ‑> f:('a ‑> 'b option) ‑> 'b option
val to_list : ('a, 'b) t ‑> 'a list
val to_array : ('a, 'b) t ‑> 'a array
val invariants : comparator:('a, 'cmp) Base.Comparator.t ‑> ('a, 'cmp) t ‑> bool
val mem : comparator:('a, 'cmp) Base.Comparator.t ‑> ('a, 'cmp) t ‑> 'a ‑> bool
val add : comparator:('a, 'cmp) Base.Comparator.t ‑> ('a, 'cmp) t ‑> 'a ‑> ('a, 'cmp) t
val remove : comparator:('a, 'cmp) Base.Comparator.t ‑> ('a, 'cmp) t ‑> 'a ‑> ('a, 'cmp) t
val union : comparator:('a, 'cmp) Base.Comparator.t ‑> ('a, 'cmp) t ‑> ('a, 'cmp) t ‑> ('a, 'cmp) t
val inter : comparator:('a, 'cmp) Base.Comparator.t ‑> ('a, 'cmp) t ‑> ('a, 'cmp) t ‑> ('a, 'cmp) t
val diff : comparator:('a, 'cmp) Base.Comparator.t ‑> ('a, 'cmp) t ‑> ('a, 'cmp) t ‑> ('a, 'cmp) t
val symmetric_diff : comparator:('a, 'cmp) Base.Comparator.t ‑> ('a, 'cmp) t ‑> ('a, 'cmp) t ‑> ('a, 'a) Base.Either.t Base.Sequence.t
val compare_direct : comparator:('a, 'cmp) Base.Comparator.t ‑> ('a, 'cmp) t ‑> ('a, 'cmp) t ‑> int
val equal : comparator:('a, 'cmp) Base.Comparator.t ‑> ('a, 'cmp) t ‑> ('a, 'cmp) t ‑> bool
val is_subset : comparator:('a, 'cmp) Base.Comparator.t ‑> ('a, 'cmp) t ‑> of_:('a, 'cmp) t ‑> bool
val subset : comparator:('a, 'cmp) Base.Comparator.t ‑> ('a, 'cmp) t ‑> ('a, 'cmp) t ‑> bool
module Named : sig ... end
val fold_until : ('a, 'b) t ‑> init:'accum ‑> f:('accum ‑> 'a ‑> ('accum, 'final) Base__.Set_intf.Continue_or_stop.t) ‑> finish:('accum ‑> 'final) ‑> 'final
val fold_right : ('a, 'b) t ‑> init:'accum ‑> f:('a ‑> 'accum ‑> 'accum) ‑> 'accum
val iter2 : comparator:('a, 'cmp) Base.Comparator.t ‑> ('a, 'cmp) t ‑> ('a, 'cmp) t ‑> f:([ `Both of 'a * 'a | `Left of 'a | `Right of 'a ] ‑> unit) ‑> unit
val filter : comparator:('a, 'cmp) Base.Comparator.t ‑> ('a, 'cmp) t ‑> f:('a ‑> bool) ‑> ('a, 'cmp) t
val partition_tf : comparator:('a, 'cmp) Base.Comparator.t ‑> ('a, 'cmp) t ‑> f:('a ‑> bool) ‑> ('a, 'cmp) t * ('a, 'cmp) t
val elements : ('a, 'b) t ‑> 'a list
val min_elt : ('a, 'b) t ‑> 'a option
val min_elt_exn : ('a, 'b) t ‑> 'a
val max_elt : ('a, 'b) t ‑> 'a option
val max_elt_exn : ('a, 'b) t ‑> 'a
val choose : ('a, 'b) t ‑> 'a option
val choose_exn : ('a, 'b) t ‑> 'a
val split : comparator:('a, 'cmp) Base.Comparator.t ‑> ('a, 'cmp) t ‑> 'a ‑> ('a, 'cmp) t * 'a option * ('a, 'cmp) t
val group_by : comparator:('a, 'cmp) Base.Comparator.t ‑> ('a, 'cmp) t ‑> equiv:('a ‑> 'a ‑> bool) ‑> ('a, 'cmp) t list
val find_exn : ('a, 'b) t ‑> f:('a ‑> bool) ‑> 'a
val nth : ('a, 'b) t ‑> int ‑> 'a option
val remove_index : comparator:('a, 'cmp) Base.Comparator.t ‑> ('a, 'cmp) t ‑> int ‑> ('a, 'cmp) t
val to_sequence : comparator:('a, 'cmp) Base.Comparator.t ‑> ?order:[ `Decreasing | `Increasing ] ‑> ?greater_or_equal_to:'a ‑> ?less_or_equal_to:'a ‑> ('a, 'cmp) t ‑> 'a Base.Sequence.t
val merge_to_sequence : comparator:('a, 'cmp) Base.Comparator.t ‑> ?order:[ `Decreasing | `Increasing ] ‑> ?greater_or_equal_to:'a ‑> ?less_or_equal_to:'a ‑> ('a, 'cmp) t ‑> ('a, 'cmp) t ‑> ('a, 'a) Base__.Set_intf.Merge_to_sequence_element.t Base.Sequence.t
val to_map : comparator:('a, 'cmp) Comparator.t ‑> ('a, 'cmp) t ‑> f:('a ‑> 'b) ‑> ('a, 'b, 'cmp) Map.t
val obs : 'a Quickcheck.Observer.t ‑> ('a, 'cmp) t Quickcheck.Observer.t
val shrinker : comparator:('a, 'cmp) Comparator.t ‑> 'a Quickcheck.Shrinker.t ‑> ('a, 'cmp) t Quickcheck.Shrinker.t
include Set_intf.Creators2_with_comparator with type (a, b) t := (a, b) t with type (a, b) tree := (a, b) tree
include Set_intf.Set.Creators2_with_comparator
val empty : comparator:('a, 'cmp) Base.Comparator.t ‑> ('a, 'cmp) t
val singleton : comparator:('a, 'cmp) Base.Comparator.t ‑> 'a ‑> ('a, 'cmp) t
val union_list : comparator:('a, 'cmp) Base.Comparator.t ‑> ('a, 'cmp) t list ‑> ('a, 'cmp) t
val of_list : comparator:('a, 'cmp) Base.Comparator.t ‑> 'a list ‑> ('a, 'cmp) t
val of_array : comparator:('a, 'cmp) Base.Comparator.t ‑> 'a array ‑> ('a, 'cmp) t
val of_sorted_array : comparator:('a, 'cmp) Base.Comparator.t ‑> 'a array ‑> ('a, 'cmp) t Base.Or_error.t
val of_sorted_array_unchecked : comparator:('a, 'cmp) Base.Comparator.t ‑> 'a array ‑> ('a, 'cmp) t
val of_increasing_iterator_unchecked : comparator:('a, 'cmp) Base.Comparator.t ‑> len:int ‑> f:(int ‑> 'a) ‑> ('a, 'cmp) t
val stable_dedup_list : comparator:('a, 'cmp) Base.Comparator.t ‑> 'a list ‑> 'a list
val map : comparator:('b, 'cmp) Base.Comparator.t ‑> ('a, 'c) set ‑> f:('a ‑> 'b) ‑> ('b, 'cmp) t
val filter_map : comparator:('b, 'cmp) Base.Comparator.t ‑> ('a, 'c) set ‑> f:('a ‑> 'b option) ‑> ('b, 'cmp) t
val of_tree : comparator:('a, 'cmp) Base.Comparator.t ‑> ('a, 'cmp) tree ‑> ('a, 'cmp) t
val of_hash_set : comparator:('a, 'cmp) Comparator.t ‑> 'a Hash_set.t ‑> ('a, 'cmp) t
val of_hashtbl_keys : comparator:('a, 'cmp) Comparator.t ‑> ('a, _) Hashtbl.t ‑> ('a, 'cmp) t
val gen : comparator:('a, 'cmp) Comparator.t ‑> 'a Quickcheck.Generator.t ‑> ('a, 'cmp) t Quickcheck.Generator.t