Struct Stack 

pub struct Stack<T, const N: usize = 128> { /* private fields */ }

Bounded-capacity stack with const fn operations. Used to store syntax spans via Syntax type alias.

Implementations

impl<T, const N: usize> Stack<T, N>

pub const fn as_slice(&self) -> &[T]

Returns the underlying slice of elements.

pub fn iter( &self, ) -> impl ExactSizeIterator<Item = &T> + DoubleEndedIterator + '_

Iterates over elements in this stack in the order of their insertion.

pub const fn is_empty(&self) -> bool

Checks whether the stack is empty (has 0 elements).

pub const fn len(&self) -> usize

Returns the number of elements in the stack.

Trait Implementations

impl<T, const N: usize> AsRef<[T]> for Stack<T, N>

fn as_ref(&self) -> &[T]

Converts this type into a shared reference of the (usually inferred) input type.

impl<T: Debug, const N: usize> Debug for Stack<T, N>

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

Formats the value using the given formatter.

impl<'a, T, const N: usize> IntoIterator for &'a Stack<T, N>

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) -> Self::IntoIter

Creates an iterator from a value.

impl<T: PartialEq, const N: usize> PartialEq for Stack<T, N>

fn eq(&self, other: &Self) -> bool

Tests for self and other values to be equal, and is used by ==.

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

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.