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 minimum (resp maximum) element from the collection using the provided
cmp function, or
None if the collection is empty. In case of a tie, the first
element encountered while traversing the collection is returned. The implementation
fold so it has the same complexity as
invariant t checks the invariants of the queue.
create () returns an empty queue. The arguments
referring to the underlying hashtable.
clear the queue
first t returns the front element of the queue, without removing it.
dequeue t returns the front element of the queue.
dequeue_all t ~f dequeues every element of the queue and applies f to each
remove q k removes the key-value pair with key k from the queue.