Struct Stack 

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

A simple stack abstraction.

Implementations

impl<T> Stack<T>

pub fn new() -> Self

Creates a new empty stack.

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

Pushes a value onto the top of the stack.

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

Pops the top item from the stack and returns it.

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

Returns a reference to the top item without removing it.

pub fn len(&self) -> usize

Returns the number of items in the stack.

pub fn empty(&self) -> bool

Returns true if the stack contains no items.

pub fn is_empty(&self) -> bool

Returns true if the stack contains no items.

Trait Implementations

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

fn clone(&self) -> Stack<T>

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

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

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

Formats the value using the given formatter.

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

fn default() -> Stack<T>

Returns the “default value” for a type.

impl<T: Eq> Eq for Stack<T>

impl<T> FromIterator<T> for Stack<T>

fn from_iter<I: IntoIterator<Item = T>>(iter: I) -> Self

Creates a value from an iterator.

impl<T: PartialEq> PartialEq for Stack<T>

fn eq(&self, other: &Stack<T>) -> bool

Equality operator ==.

fn ne(&self, other: &Rhs) -> bool

Inequality operator !=.

impl<T: PartialEq> StructuralPartialEq for Stack<T>