Struct Stack

pub struct Stack<T: Clone> { /* private fields */ }

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

Implementations

impl<T: Clone> Stack<T>

pub fn new() -> Self

Creates a new Stack.

pub fn is_empty(&self) -> bool

Returns true if the stack is currently empty.

pub fn peek(&self) -> Option<&T>

Returns the top-most &T in the Stack.

pub fn push(&mut self, elem: T)

Pushes a T onto the Stack.

pub fn pop(&mut self) -> Option<T>

Pops the top-most T from the Stack.

pub fn len(&self) -> usize

Returns the size of the stack

pub fn snapshot(&mut self)

Takes a snapshot of the current Stack.

pub fn clear_snapshot(&mut self)

The parsing after the last snapshot was successful so clearing it.

pub fn restore(&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.

Trait Implementations

impl<T: Debug + Clone> Debug for Stack<T>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<T: Clone> Default for Stack<T>

fn default() -> Self

Returns the “default value” for a type.

impl<T: Clone> Index<Range<usize>> for Stack<T>

type Output = [T]

The returned type after indexing.

fn index(&self, range: Range<usize>) -> &[T]

Performs the indexing (container[index]) operation.