Struct StackState 

#[non_exhaustive]
pub struct StackState<'a> {
    pub symbols: VecDeque<&'a str>,
}

The symbol stack a path carries through the graph, top first.

Fields (Non-exhaustive)

Non-exhaustive structs could have additional fields added in future. Therefore, non-exhaustive structs cannot be constructed in external crates using the traditional Struct { .. } syntax; cannot be matched against without a wildcard ..; and struct update syntax will not work.

symbols: VecDeque<&'a str>

Symbols still to resolve.

Implementations

impl<'a> StackState<'a>

pub fn new() -> Self

An empty state.

pub fn apply( &mut self, graph: &'a StackGraph, id: NodeId, ) -> Result<(), TransitionError>

Applies node id of graph.

Errors

Returns the TransitionError that blocks the node, leaving the state unchanged.

Trait Implementations

impl<'a> Clone for StackState<'a>

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<'a> Debug for StackState<'a>

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

Formats the value using the given formatter.

impl<'a> Default for StackState<'a>

fn default() -> Self

Returns the “default value” for a type.

impl<'a> Eq for StackState<'a>

impl<'a> PartialEq for StackState<'a>

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

Equality operator ==.

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

Inequality operator !=.

impl<'a> StructuralPartialEq for StackState<'a>