Index of values

add x s returns a set containing all elements of s, plus x.

Add a new binding.

Add the given elements to the set, in order.

Return the number of elements of a set.

Return one element of the given set, or raise Not_found if the set is empty.

Return one element of the given set, or None if the set is empty.

Clear the table.

Total ordering between sets.

Set difference: diff s1 s2 contains the elements of s1 that are not in s2.

Test if two sets are disjoint.

Return the list of all elements of the given set.

The empty set.

equal s1 s2 tests whether the sets s1 and s2 are equal, that is, contain equal elements.

exists f s checks if at least one element of the set satisfies the predicate f.

filter f s returns the set of all elements in s that satisfy predicate f.

filter_map f s returns the set of all v such that f x = Some v for some element x of s.

find x s returns the element of s equal to x (according to Ord.compare), or raise Not_found if no such element exists.

Return the current binding of the given key.

Return the list of all data associated with the given key.

find_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.

find_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.

find_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.

find_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.

find_opt x s returns the element of s equal to x (according to Ord.compare), or None if no such element exists.

fold f s init computes (f xN ... (f x2 (f x1 init))...), where x1 ... xN are the elements of s, in increasing order.

for_all f s checks if all elements of the set satisfy the predicate f.

Set intersection.

Test whether a set is empty or not.

iter f s applies f in turn to all elements of s.

Length of the table.

map f s is the set whose elements are f a0,f a1...

Same as Set.S.min_elt, but returns the largest element of the given set.

Same as Set.S.min_elt_opt, but returns the largest element of the given set.

mem x s tests whether x belongs to the set s.

Memoization.

Return the smallest element of the given set (with respect to the Ord.compare ordering), or raise Not_found if the set is empty.

Return the smallest element of the given set (with respect to the Ord.compare ordering), or None if the set is empty.

of_list l creates a set from a list of elements.

Build a set from the given bindings

Set the boolean to false.

Set the boolean to true.

partition f s returns a pair of sets (s1, s2), where s1 is the set of all the elements of s that satisfy the predicate f, and s2 is the set of all the elements of s that do not satisfy f.

remove x s returns a set containing all elements of s, except x.

Add a new binding.

singleton x returns the one-element set containing only x.

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.

subset s1 s2 tests whether the set s1 is a subset of the set s2.

Iterate on the whole set, in descending order

Iterate on the whole set, in ascending order

to_seq_from x s iterates on a subset of the elements of s in ascending order, from x or above.

Set union.