Enum canonical_collections::Stack

pub enum Stack<T, S: Store> {
    Empty,
    Node {
        value: T,
        prev: Repr<Self, S>,
    },
}

Proof of concept stack structure using a self-referential repr

Variants

Empty

Represents an empty stack.

Node

Non-empty top node

Fields of Node

value: T

The value on top of the stack

prev: Repr<Self, S>

A repr referencing the previous state of the stack

Implementations

impl<T, S> Stack<T, S> where
    S: Store,
    T: Canon<S> + Clone, 

pub fn new() -> Self

Creates a new Stack

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

Pushes a value to the stack

pub fn pop(&mut self) -> Result<Option<T>, S::Error>

Pops a value from the stack, if any and returns it

Trait Implementations

impl<T: Canon<S>, S: Store + Canon<S>> Canon<S> for Stack<T, S>

fn write(&self, sink: &mut impl Sink<S>) -> Result<(), S::Error>

Write the value as bytes to a Sink

fn read(source: &mut impl Source<S>) -> Result<Self, S::Error>

Read the value from bytes in a Source

fn encoded_len(&self) -> usize

Returns the number of bytes needed to encode this value

impl<T: Clone, S: Clone + Store> Clone for Stack<T, S>

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

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<T: Debug, S: Debug + Store> Debug for Stack<T, S>

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

Formats the value using the given formatter.