Struct PartialPath 

#[non_exhaustive]
pub struct PartialPath<'a> {
    pub start: NodeId,
    pub end: NodeId,
    pub pre: PartialSymbolStack<'a>,
    pub post: PartialSymbolStack<'a>,
    pub edges: Vec<PathEdge>,
}

A walk from start to end: the symbol stack it needs on entry and the one it leaves.

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.

start: NodeId

The node the walk starts at.

end: NodeId

The node the walk ends at.

pre: PartialSymbolStack<'a>

The symbol stack the walk needs on entry.

post: PartialSymbolStack<'a>

The symbol stack the walk leaves.

edges: Vec<PathEdge>

The edges followed, in order.

Implementations

impl PartialPath<'_>

pub fn concatenate( &self, graph: &StackGraph, rhs: &Self, ) -> Result<Self, PathError>

This walk followed by rhs, which must start where this one ends.

Errors

Returns the PathError that keeps the walks apart.

impl<'a> PartialPath<'a>

pub fn seed( graph: &'a StackGraph, node: NodeId, ) -> Result<Self, TransitionError>

The walk that only visits node: the symbol stack node needs on entry and the one it leaves.

Errors

Returns TransitionError::UnknownNode when graph has no node.

Trait Implementations

impl<'a> Clone for PartialPath<'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 PartialPath<'a>

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

Formats the value using the given formatter.

impl<'a> Eq for PartialPath<'a>

impl<'a> PartialEq for PartialPath<'a>

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

Equality operator ==.

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

Inequality operator !=.

impl<'a> StructuralPartialEq for PartialPath<'a>