The type of the set elements

An interval: a range (x, y) of set values where all the elements from x to y inclusive are in the set

The type of sets

Equality over sets

Comparison over sets

Pretty-print a set

The empty set

Test whether a set is empty or not

singleton x is the set containing just x.

cardinal t is the number of elements in the set t

mem elt t tests whether elt is in set t

fold f t acc folds f across all the intervals in t

fold_individual f t acc folds f across all the individual elements of t

filter_map_individual f t is the set of all f(x) for x in t.

iter f t iterates f across all the intervals in t

add interval t returns the set consisting of t plus interval

remove interval t returns the set consisting of t minus interval

min_elt t returns the smallest (in terms of the ordering) element in t, or raises Not_found if the set is empty.

max_elt t returns the largest (in terms of the ordering) element in t, or raises Not_found if the set is empty.

min_interval t returns the smallest (in terms of the ordering) interval in t, or raises Not_found if the set is empty.

max_interval t returns the largest (in terms of the ordering) interval in t, or raises Not_found if the set is empty.

choose t returns one interval, or raises Not_found if the set is empty

take n returns Some a, b where cardinal a = n and diff t a = b or None if cardinal t < n

set union

Iterated set union.

set difference

set intersection

subsets

Cross product on all elements of sets

find_next_gap from t returns the next element that's absent in set t and greater than or equal to from *

elements t returns the list of intervals in the set t.

elements_individual t returns the list of elements in the set t.

of_list li returns the set of elements in the list li.