Struct rpds::stack::Stack

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

A persistent stack with structural sharing. This data structure supports fast push(), pop(), and peek().

Complexity

Let n be the number of elements in the stack.

Temporal complexity

Operation	Best case	Average	Worst case
new()	Θ(1)	Θ(1)	Θ(1)
push()	Θ(1)	Θ(1)	Θ(1)
pop()	Θ(1)	Θ(1)	Θ(1)
peek()	Θ(1)	Θ(1)	Θ(1)
size()	Θ(1)	Θ(1)	Θ(1)
clone()	Θ(1)	Θ(1)	Θ(1)
iterator creation	Θ(1)	Θ(1)	Θ(1)
iterator step	Θ(1)	Θ(1)	Θ(1)
iterator full	Θ(n)	Θ(n)	Θ(n)

Implementation details

This is a thin wrapper around a List.

Methods

impl<T> Stack<T>

fn new() -> Stack<T>

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

fn pop(&self) -> Option<Stack<T>>

fn push(&self, v: T) -> Stack<T>

fn size(&self) -> usize

fn is_empty(&self) -> bool

fn iter(&self) -> Iter<T>

Trait Implementations

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

fn fmt(&self, __arg_0: &mut Formatter) -> Result

Formats the value using the given formatter.

impl<T> Default for Stack<T>

fn default() -> Stack<T>

Returns the "default value" for a type.

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

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

This method tests for self and other values to be equal, and is used by ==.

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

This method tests for !=.

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

impl<T: PartialOrd<T>> PartialOrd<Stack<T>> for Stack<T>

fn partial_cmp(&self, other: &Stack<T>) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

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

This method tests less than (for self and other) and is used by the < operator.

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

This method tests less than or equal to (for self and other) and is used by the <= operator.

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

This method tests greater than (for self and other) and is used by the > operator.

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

This method tests greater than or equal to (for self and other) and is used by the >= operator.

impl<T: Ord> Ord for Stack<T>

fn cmp(&self, other: &Stack<T>) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

Compares and returns the minimum of two values.

impl<T: Hash> Hash for Stack<T>

fn hash<H: Hasher>(&self, state: &mut H)

Feeds this value into the given [Hasher].

fn hash_slice<H>(data: &[Self], state: &mut H) where
    H: Hasher, 

Feeds a slice of this type into the given [Hasher].

impl<T> Clone for Stack<T>

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

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<T: Display> Display for Stack<T>

fn fmt(&self, fmt: &mut Formatter) -> Result

Formats the value using the given formatter.

impl<'a, T> IntoIterator for &'a Stack<T>

type Item = &'a T

The type of the elements being iterated over.

type IntoIter = Iter<'a, T>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Iter<'a, T>

Creates an iterator from a value.

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

fn from_iter<I: IntoIterator<Item = T>>(into_iter: I) -> Stack<T>

Creates a value from an iterator.