Enum substack::Substack

pub enum Substack<'a, T> {
    Frame(Stackframe<'a, T>),
    Bottom,
}

A FILO stack that lives on the regular call stack as a linked list.

Variants

Frame(Stackframe<'a, T>)

A level in the linked list

Bottom

The end of the list

Implementations

impl<'a, T> Substack<'a, T>

pub fn opt(&'a self) -> Option<&'a Stackframe<'a, T>>

Convert the substack into an option of stackframe

pub fn iter(&self) -> SubstackIterator<'_, T>

Construct an iterator starting from the top and moving down the stack

pub fn push(&'a self, item: T) -> Self

Add the item to this substack

pub fn new_frame(&'a self, item: T) -> Stackframe<'a, T>

Create a new frame on top of this substack

pub fn pop(&'a self, count: usize) -> &'a Self

obtain the previous stackframe if one exists.

Panics

if the index is greater than the number of stack frames

pub fn len(&self) -> usize

number of stackframes

pub fn is_empty(&self) -> bool

is this the bottom of the stack

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

Get a reference to the value held in this stackframe

pub fn unreverse(&self) -> Vec<T>where T: Clone,

Clones the elements into a vector starting at the bottom of the stack

pub fn rfold<'b, U, F: FnMut(U, &'b T) -> U>( &'b self, default: U, callback: F ) -> U

Visit all of the elements lowest first. This uses internal recursion, but since the iterator itself fits on the stack it’s very likely that the reversed slices to it also will. If the callback is pure, these stack frames should store a single reference to the corresponding item.

Trait Implementations

impl<'a, T: Clone> Clone for Substack<'a, T>

fn clone(&self) -> Substack<'a, T>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<'a, T: Debug> Debug for Substack<'a, T>

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

Formats the value using the given formatter.

impl<'a, T: Copy> Copy for Substack<'a, T>