Module Core_kernel.Md5.Set
module Tree : sig ... endinclude Set_intf.S_plain with module Elt := Elt and module Tree := Tree
include Set_intf.Creators_and_accessors0 with type (a, b) set := (a, b) Base.Set.t with type t := t with type tree := Tree.t with type elt := Elt.t with type named := named with type comparator_witness := Elt.comparator_witness
include Set_intf.Accessors0
include Set_intf.Set.Accessors0
val iter : t ‑> f:(elt ‑> unit) ‑> unitval fold : t ‑> init:'accum ‑> f:('accum ‑> elt ‑> 'accum) ‑> 'accumval exists : t ‑> f:(elt ‑> bool) ‑> boolval for_all : t ‑> f:(elt ‑> bool) ‑> boolval count : t ‑> f:(elt ‑> bool) ‑> intval find : t ‑> f:(elt ‑> bool) ‑> elt optionval find_map : t ‑> f:(elt ‑> 'a option) ‑> 'a optionval to_list : t ‑> elt listval to_array : t ‑> elt arrayval invariants : t ‑> boolval mem : t ‑> elt ‑> boolval remove : t ‑> elt ‑> tval compare_direct : t ‑> t ‑> intval equal : t ‑> t ‑> boolval is_subset : t ‑> of_:t ‑> boolval subset : t ‑> t ‑> bool- Deprecated [since 2016-09] Replace [Set.subset t1 t2] with [Set.is_subset t1 ~of_:t2]
module Named : sig ... endval fold_right : t ‑> init:'b ‑> f:(elt ‑> 'b ‑> 'b) ‑> 'bval iter2 : t ‑> t ‑> f:([ `Both of elt * elt | `Left of elt | `Right of elt ] ‑> unit) ‑> unitval filter : t ‑> f:(elt ‑> bool) ‑> tval partition_tf : t ‑> f:(elt ‑> bool) ‑> t * tval elements : t ‑> elt listval min_elt : t ‑> elt optionval min_elt_exn : t ‑> eltval max_elt : t ‑> elt optionval max_elt_exn : t ‑> eltval choose : t ‑> elt optionval choose_exn : t ‑> eltval group_by : t ‑> equiv:(elt ‑> elt ‑> bool) ‑> t listval find_exn : t ‑> f:(elt ‑> bool) ‑> eltval find_index : t ‑> int ‑> elt option- Deprecated [since 2016-10] Use [nth]
val nth : t ‑> int ‑> elt optionval remove_index : t ‑> int ‑> tval to_sequence : ?order:[ `Decreasing | `Increasing ] ‑> ?greater_or_equal_to:elt ‑> ?less_or_equal_to:elt ‑> t ‑> elt Base.Sequence.t