Tree.t contains just the tree data structure that a set is based on, without
including the comparator. Accordingly, any operation on a
Tree.t must also take
as an argument the corresponding comparator.
Checks whether the provided element is there, using polymorphic compare if
is not provided
fold t ~init ~f returns
f (... f (f (f init e1) e2) e3 ...) en, where
are the elements of
true if and only if there exists an element for which the provided
function evaluates to
true. This is a short-circuiting operation.
true if and only if the provided function evaluates to
true for all
elements. This is a short-circuiting operation.
Returns the number of elements for which the provided function evaluates to true.
Returns as an
option the first element for which
f evaluates to true.
Returns the first evaluation of
f that returns
Some, and returns
None if there
is no such element.
Returns a min (resp max) element from the collection using the provided
function. In case of a tie, the first element encountered while traversing the
collection is returned. The implementation uses
fold so it has the same complexity
None iff the collection is empty.