Set.Using_comparatorinclude Set_intf.Creators2_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) Tree.tinclude Set_intf.Set.Creators2_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) Tree.tval empty : comparator:('a, 'cmp) Base.Comparator.t -> ('a, 'cmp) tval singleton : comparator:('a, 'cmp) Base.Comparator.t -> 'a -> ('a, 'cmp) tval union_list : comparator:('a, 'cmp) Base.Comparator.t -> ('a, 'cmp) t list -> ('a, 'cmp) tval of_list : comparator:('a, 'cmp) Base.Comparator.t -> 'a list -> ('a, 'cmp) tval of_array : comparator:('a, 'cmp) Base.Comparator.t -> 'a array -> ('a, 'cmp) tval of_sorted_array : comparator:('a, 'cmp) Base.Comparator.t -> 'a array -> ('a, 'cmp) t Base.Or_error.tval of_sorted_array_unchecked : comparator:('a, 'cmp) Base.Comparator.t ->
'a array -> ('a, 'cmp) tval of_increasing_iterator_unchecked : comparator:('a, 'cmp) Base.Comparator.t -> len:int ->
f:(int -> 'a) -> ('a, 'cmp) tval stable_dedup_list : comparator:('a, 'cmp) Base.Comparator.t -> 'a list -> 'a listval map : comparator:('b, 'cmp) Base.Comparator.t -> ('a, _) t -> f:('a -> 'b) -> ('b, 'cmp) tval filter_map : comparator:('b, 'cmp) Base.Comparator.t -> ('a, _) t -> f:('a -> 'b option) ->
('b, 'cmp) tval of_tree : comparator:('a, 'cmp) Base.Comparator.t -> ('a, 'cmp) Tree.t -> ('a, 'cmp) tval of_hash_set : comparator:('a, 'cmp) Comparator.t -> 'a Hash_set.t -> ('a, 'cmp) tval of_hashtbl_keys : comparator:('a, 'cmp) Comparator.t -> ('a, _) Hashtbl.t -> ('a, 'cmp) tval of_map_keys : ('a, _, 'cmp) Base.Map.t -> ('a, 'cmp) tval quickcheck_generator : comparator:('a, 'cmp) Comparator.t -> 'a Quickcheck.Generator.t -> ('a, 'cmp) t Quickcheck.Generator.t