Struct `Stack`

struct Stack<T: Clone> { ... }

Implementation of a Stack which maintains popped elements and length of previous states in order to rewind the stack to a previous state.

Implementations

fn new() -> Self: Creates a new Stack.
fn is_empty(self: &Self) -> bool: Returns true if the stack is currently empty.
fn peek(self: &Self) -> Option<&T>: Returns the top-most &T in the Stack.
fn push(self: &mut Self, elem: T): Pushes a T onto the Stack.
fn pop(self: &mut Self) -> Option<T>: Pops the top-most T from the Stack.
fn len(self: &Self) -> usize: Returns the size of the stack
fn snapshot(self: &mut Self): Takes a snapshot of the current Stack.
fn clear_snapshot(self: &mut Self): The parsing after the last snapshot was successful so clearing it.
fn restore(self: &mut Self): Rewinds the Stack to the most recent snapshot(). If no snapshot() has been taken, this function return the stack to its initial state.

fn into(self: Self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of [From]<T> for U chooses to do.