String sets
include Stdlib.Set.S with type elt := string and type t := set
val empty : setThe empty set.
val is_empty : set -> boolTest whether a set is empty or not.
val mem : string -> set -> boolmem x s tests whether x belongs to the set s.
add x s returns a set containing all elements of s, plus x. If x was already in s, s is returned unchanged (the result of the function is then physically equal to s).
- before 4.03
 Physical equality was not ensured.
val singleton : string -> setsingleton x returns the one-element set containing only x.
remove x s returns a set containing all elements of s, except x. If x was not in s, s is returned unchanged (the result of the function is then physically equal to s).
- before 4.03
 Physical equality was not ensured.
Set difference: diff s1 s2 contains the elements of s1 that are not in s2.
Total ordering between sets. Can be used as the ordering function for doing sets of sets.
equal s1 s2 tests whether the sets s1 and s2 are equal, that is, contain equal elements.
val iter : (string -> unit) -> set -> unititer f s applies f in turn to all elements of s. The elements of s are presented to f in increasing order with respect to the ordering over the type of the elements.
map f s is the set whose elements are f a0,f a1... f
        aN, where a0,a1...aN are the elements of s.
The elements are passed to f in increasing order with respect to the ordering over the type of the elements.
If no element of s is changed by f, s is returned unchanged. (If each output of f is physically equal to its input, the returned set is physically equal to s.)
- since
 - 4.04.0
 
val fold : (string -> 'a -> 'a) -> set -> 'a -> 'afold f s a computes (f xN ... (f x2 (f x1 a))...), where x1 ... xN are the elements of s, in increasing order.
val for_all : (string -> bool) -> set -> boolfor_all p s checks if all elements of the set satisfy the predicate p.
val exists : (string -> bool) -> set -> boolexists p s checks if at least one element of the set satisfies the predicate p.
filter p s returns the set of all elements in s that satisfy predicate p. If p satisfies every element in s, s is returned unchanged (the result of the function is then physically equal to s).
- before 4.03
 Physical equality was not ensured.
partition p s returns a pair of sets (s1, s2), where s1 is the set of all the elements of s that satisfy the predicate p, and s2 is the set of all the elements of s that do not satisfy p.
val cardinal : set -> intReturn the number of elements of a set.
val elements : set -> string listReturn the list of all elements of the given set. The returned list is sorted in increasing order with respect to the ordering Ord.compare, where Ord is the argument given to Set.Make.
val min_elt : set -> stringReturn the smallest element of the given set (with respect to the Ord.compare ordering), or raise Not_found if the set is empty.
val min_elt_opt : set -> string optionReturn the smallest element of the given set (with respect to the Ord.compare ordering), or None if the set is empty.
- since
 - 4.05
 
val max_elt : set -> stringSame as Set.S.min_elt, but returns the largest element of the given set.
val max_elt_opt : set -> string optionSame as Set.S.min_elt_opt, but returns the largest element of the given set.
- since
 - 4.05
 
val choose : set -> stringReturn one element of the given set, or raise Not_found if the set is empty. Which element is chosen is unspecified, but equal elements will be chosen for equal sets.
val choose_opt : set -> string optionReturn one element of the given set, or None if the set is empty. Which element is chosen is unspecified, but equal elements will be chosen for equal sets.
- since
 - 4.05
 
split x s returns a triple (l, present, r), where l is the set of elements of s that are strictly less than x; r is the set of elements of s that are strictly greater than x; present is false if s contains no element equal to x, or true if s contains an element equal to x.
val find : string -> set -> stringfind x s returns the element of s equal to x (according to Ord.compare), or raise Not_found if no such element exists.
- since
 - 4.01.0
 
val find_opt : string -> set -> string optionfind_opt x s returns the element of s equal to x (according to Ord.compare), or None if no such element exists.
- since
 - 4.05
 
val find_first : (string -> bool) -> set -> stringfind_first f s, where f is a monotonically increasing function, returns the lowest element e of s such that f e, or raises Not_found if no such element exists.
For example, find_first (fun e -> Ord.compare e x >= 0) s will return the first element e of s where Ord.compare e x >= 0 (intuitively: e >= x), or raise Not_found if x is greater than any element of s.
- since
 - 4.05
 
val find_first_opt : (string -> bool) -> set -> string optionfind_first_opt f s, where f is a monotonically increasing function, returns an option containing the lowest element e of s such that f e, or None if no such element exists.
- since
 - 4.05
 
val find_last : (string -> bool) -> set -> stringfind_last f s, where f is a monotonically decreasing function, returns the highest element e of s such that f e, or raises Not_found if no such element exists.
- since
 - 4.05
 
val find_last_opt : (string -> bool) -> set -> string optionfind_last_opt f s, where f is a monotonically decreasing function, returns an option containing the highest element e of s such that f e, or None if no such element exists.
- since
 - 4.05
 
val of_list : string list -> setof_list l creates a set from a list of elements. This is usually more efficient than folding add over the list, except perhaps for lists with many duplicated elements.
- since
 - 4.02.0
 
Iterators
val to_seq_from : string -> set -> string Stdlib.Seq.tto_seq_from x s iterates on a subset of the elements of s in ascending order, from x or above.
- since
 - 4.07
 
val to_seq : set -> string Stdlib.Seq.tIterate on the whole set, in ascending order
- since
 - 4.07
 
val add_seq : string Stdlib.Seq.t -> set -> setAdd the given elements to the set, in order.
- since
 - 4.07
 
val of_seq : string Stdlib.Seq.t -> setBuild a set from the given bindings
- since
 - 4.07
 
type t = setval min_elt : set -> string optionException safe Set.S.min_elt.
val get_min_elt : set -> stringget_min_elt is like min_elt but 
- raises Invalid_argument
 on the empty set.
val max_elt : set -> string optionException safe Set.S.max_elt.
val get_max_elt : set -> stringget_max_elt is like max_elt but 
- raises Invalid_argument
 on the empty set.
val choose : set -> string optionException safe Set.S.choose.
val get_any_elt : set -> stringget_any_elt is like choose but 
- raises Invalid_argument
 on the empty set.
val find : string -> set -> string optionException safe Set.S.find.
val get : string -> set -> stringget is like Set.S.find but 
- raises Invalid_argument
 if
eltis not ins.
val of_list : string list -> setof_list ss is a set from the list ss.
val of_stdlib_set : Stdlib.Set.Make(Stdlib.String).t -> setof_stdlib_set s is a set from the stdlib-compatible set s.
val to_stdlib_set : set -> Stdlib.Set.Make(Stdlib.String).tto_stdlib_set s is the stdlib-compatible set equivalent to s.
val pp : ?sep:(Stdlib.Format.formatter -> unit -> unit) -> (Stdlib.Format.formatter -> string -> unit) -> Stdlib.Format.formatter -> set -> unitpp ~sep pp_elt ppf ss formats the elements of ss on ppf. Each element is formatted with pp_elt and elements are separated by ~sep (defaults to Format.pp_print_cut. If the set is empty leaves ppf untouched.
val dump : Stdlib.Format.formatter -> set -> unitdump ppf ss prints an unspecified representation of ss on ppf.