Struct VarStack

pub struct VarStack<'s, S, V>(pub RefStack<'s, VarStackEntry<S, V>>);

Like RefStack, but entries have names

Tuple Fields

0: RefStack<'s, VarStackEntry<S, V>>

Implementations

impl<'s, S, V> VarStack<'s, S, V>

pub fn find(&self, name: &S) -> Option<&V>

where S: PartialEq,

pub fn iter(&'s self) -> VarIter<'s, S, V>

where S: Copy,

Trait Implementations

impl<'s, S: Clone, V: Clone> Clone for VarStack<'s, S, V>

fn clone(&self) -> VarStack<'s, S, V>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<S: Copy + Debug, V: Debug> Debug for VarStack<'_, S, V>

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

Formats the value using the given formatter.

impl<'s, S: Hash, V: Hash> Hash for VarStack<'s, S, V>

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<'s, S: Copy, V> IntoIterator for &'s VarStack<'s, S, V>

type Item = (S, &'s V)

The type of the elements being iterated over.

type IntoIter = VarIter<'s, S, V>

Which kind of iterator are we turning this into?

fn into_iter(self) -> VarIter<'s, S, V>

Creates an iterator from a value.

impl<'s, S: Ord, V: Ord> Ord for VarStack<'s, S, V>

fn cmp(&self, other: &VarStack<'s, S, V>) -> Ordering

This method returns an Ordering between self and other.

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

where Self: Sized,

Compares and returns the maximum of two values.

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

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized,

Restrict a value to a certain interval.

impl<'s, S: PartialEq, V: PartialEq> PartialEq for VarStack<'s, S, V>

fn eq(&self, other: &VarStack<'s, S, V>) -> 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<'s, S: PartialOrd, V: PartialOrd> PartialOrd for VarStack<'s, S, V>

fn partial_cmp(&self, other: &VarStack<'s, S, V>) -> Option<Ordering>

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

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

Tests less than (for self and other) and is used by the < operator.

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

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

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

Tests greater than (for self and other) and is used by the > operator.

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

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

impl<'s, S: Copy, V: Copy> Copy for VarStack<'s, S, V>

impl<'s, S: Eq, V: Eq> Eq for VarStack<'s, S, V>

impl<'s, S, V> StructuralPartialEq for VarStack<'s, S, V>