Struct Stack

pub struct Stack<T: 'static + Debug + Clone + Eq + Hash>(pub Option<Head<T>>);

Common linked-list

Tuple Fields

0: Option<Head<T>>

Implementations

impl<T: 'static + Debug + Clone + Eq + Hash> Stack<T>

pub fn new() -> Self

this is identical to Stack(None)

pub fn is_empty(&self) -> bool

pub fn push(&self, name: Option<Name>, elem: T) -> Self

return a stack with the new item as head

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

return the top item, if there is one

pub fn name(&self) -> Option<Name>

get the incremental name of this stack, if it’s not empty

pub fn pull(&self) -> Option<Self>

return the stack without the top item (this is sometimes called tail)

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

return an iterator over the elements from the top of the stack

Trait Implementations

impl<T: Clone + 'static + Debug + Clone + Eq + Hash> 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: Debug + 'static + Debug + Clone + Eq + Hash> Debug for Stack<T>

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

Formats the value using the given formatter.

impl<T: Hash + 'static + Debug + Clone + Eq + 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, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl<T: PartialEq + 'static + Debug + Clone + Eq + Hash> PartialEq for Stack<T>

fn eq(&self, other: &Stack<T>) -> 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.

impl<T: Eq + 'static + Debug + Clone + Eq + Hash> Eq for Stack<T>

impl<T: 'static + Debug + Clone + Eq + Hash> StructuralPartialEq for Stack<T>