A stack implemented with a list. See Stack_intf for documentation.
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
of_list l returns a stack whose top is the first element of
l and bottom is the
last element of
create () returns an empty stack.
singleton a creates a new stack containing only
push t a adds
a to the top of stack
pop t removes and returns the top element of
Some a, or returns
t is empty.
top t returns
Some a, where
a is the top of
is_empty t, in which
clear t discards all elements from
until_empty t f repeatedly pops an element
a off of
t and runs
f a, until
t becomes empty. It is fine if
f adds more elements to
t, in which case the
most-recently-added element will be processed next.