module Stack: StackUnsynchronized accesses
Unsynchronized accesses to a stack may lead to an invalid queue state.
Thus, concurrent accesses to stacks must be synchronized (for instance
with a Mutex.t).
type !'a t
The type of stacks containing elements of type 'a.
exception Empty
val create : unit -> 'a tReturn a new stack, initially empty.
val push : 'a -> 'a t -> unitpush x s adds the element x at the top of stack s.
val pop : 'a t -> 'apop s removes and returns the topmost element in stack s,
or raises Stack.Empty if the stack is empty.
val pop_opt : 'a t -> 'a optionpop_opt s removes and returns the topmost element in stack s,
or returns None if the stack is empty.
val drop : 'a t -> unitdrop s removes the topmost element in stack s,
or raises Stack.Empty if the stack is empty.
val top : 'a t -> 'atop s returns the topmost element in stack s,
or raises Stack.Empty if the stack is empty.
val top_opt : 'a t -> 'a optiontop_opt s returns the topmost element in stack s,
or None if the stack is empty.
val clear : 'a t -> unitDiscard all elements from a stack.
val copy : 'a t -> 'a tReturn a copy of the given stack.
val is_empty : 'a t -> boolReturn true if the given stack is empty, false otherwise.
val length : 'a t -> intReturn the number of elements in a stack. Time complexity O(1)
val iter : ('a -> unit) -> 'a t -> unititer f s applies f in turn to all elements of s,
from the element at the top of the stack to the element at the
bottom of the stack. The stack itself is unchanged.
val fold : ('acc -> 'a -> 'acc) -> 'acc -> 'a t -> 'accfold f accu s is (f (... (f (f accu x1) x2) ...) xn)
where x1 is the top of the stack, x2 the second element,
and xn the bottom element. The stack is unchanged.
val to_seq : 'a t -> 'a Seq.tIterate on the stack, top to bottom. It is safe to modify the stack during iteration.
val add_seq : 'a t -> 'a Seq.t -> unitAdd the elements from the sequence on the top of the stack.
val of_seq : 'a Seq.t -> 'a tCreate a stack from the sequence.