Module Stdlib.StackSource
Last-in first-out stacks.
This module implements stacks (LIFOs), with in-place modification.
Unsynchronized 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).
The type of stacks containing elements of type 'a.
Return a new stack, initially empty.
push x s adds the element x at the top of stack s.
pop s removes and returns the topmost element in stack s, or raises Empty if the stack is empty.
pop_opt s removes and returns the topmost element in stack s, or returns None if the stack is empty.
drop s removes the topmost element in stack s, or raises Empty if the stack is empty.
top s returns the topmost element in stack s, or raises Empty if the stack is empty.
top_opt s returns the topmost element in stack s, or None if the stack is empty.
Discard all elements from a stack.
Return a copy of the given stack.
Return true if the given stack is empty, false otherwise.
Return the number of elements in a stack. Time complexity O(1)
iter 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 : value_or_null) ('a : value_or_null). ('acc -> 'a -> 'acc) ->
'acc ->
'a Stdlib.Stack.t ->
'acc @@ portablefold 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.
Stacks and Sequences
Iterate on the stack, top to bottom. It is safe to modify the stack during iteration.
Add the elements from the sequence on the top of the stack.
Create a stack from the sequence.