Module Email_message__Headers.Name.Set
include Core_kernel.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 Core_kernel.Set_intf.Accessors0
include Core_kernel.Set_intf.Set.Accessors0
val iter : t ‑> f:(elt ‑> unit) ‑> unit
val fold : t ‑> init:'accum ‑> f:('accum ‑> elt ‑> 'accum) ‑> 'accum
val exists : t ‑> f:(elt ‑> bool) ‑> bool
val for_all : t ‑> f:(elt ‑> bool) ‑> bool
val count : t ‑> f:(elt ‑> bool) ‑> int
val find : t ‑> f:(elt ‑> bool) ‑> elt option
val find_map : t ‑> f:(elt ‑> 'a option) ‑> 'a option
val to_list : t ‑> elt list
val to_array : t ‑> elt array
val invariants : t ‑> bool
val mem : t ‑> elt ‑> bool
val remove : t ‑> elt ‑> t
val compare_direct : t ‑> t ‑> int
val equal : t ‑> t ‑> bool
val is_subset : t ‑> of_:t ‑> bool
val subset : t ‑> t ‑> bool
- Deprecated [since 2016-09] Replace [Set.subset t1 t2] with [Set.is_subset t1 ~of_:t2]
module Named : sig ... end
val fold_right : t ‑> init:'b ‑> f:(elt ‑> 'b ‑> 'b) ‑> 'b
val iter2 : t ‑> t ‑> f:([ `Both of elt * elt | `Left of elt | `Right of elt ] ‑> unit) ‑> unit
val filter : t ‑> f:(elt ‑> bool) ‑> t
val partition_tf : t ‑> f:(elt ‑> bool) ‑> t * t
val elements : t ‑> elt list
val min_elt : t ‑> elt option
val min_elt_exn : t ‑> elt
val max_elt : t ‑> elt option
val max_elt_exn : t ‑> elt
val choose : t ‑> elt option
val choose_exn : t ‑> elt
val group_by : t ‑> equiv:(elt ‑> elt ‑> bool) ‑> t list
val find_exn : t ‑> f:(elt ‑> bool) ‑> elt
val find_index : t ‑> int ‑> elt option
- Deprecated [since 2016-10] Use [nth]
val nth : t ‑> int ‑> elt option
val remove_index : t ‑> int ‑> t
val to_sequence : ?order:[ `Decreasing | `Increasing ] ‑> ?greater_or_equal_to:elt ‑> ?less_or_equal_to:elt ‑> t ‑> elt Base.Sequence.t