Struct stack_graphs::partial::PartialSymbolStack

#[repr(C)]
pub struct PartialSymbolStack { /* private fields */ }

A pattern that might match against a symbol stack. Consists of a (possibly empty) list of partial scoped symbols, along with an optional symbol stack variable.

Implementations

impl PartialSymbolStack

pub fn can_match_empty(&self) -> bool

Returns whether this partial symbol stack can match the empty symbol stack.

pub fn can_only_match_empty(&self) -> bool

Returns whether this partial symbol stack can only match the empty symbol stack.

pub fn contains_symbols(&self) -> bool

Returns whether this partial symbol stack contains any symbols.

pub fn has_variable(&self) -> bool

Returns whether this partial symbol stack has a symbol stack variable.

pub fn len(&self) -> usize

pub fn empty() -> PartialSymbolStack

Returns an empty partial symbol stack.

pub fn from_variable(variable: SymbolStackVariable) -> PartialSymbolStack

Returns a partial symbol stack containing only a symbol stack variable.

pub fn have_reversal(&self, partials: &PartialPaths) -> bool

Returns whether this partial symbol stack is iterable in both directions without needing mutable access to the arena.

pub fn with_offset( self, partials: &mut PartialPaths, symbol_variable_offset: u32, scope_variable_offset: u32 ) -> PartialSymbolStack

Applies an offset to this partial symbol stack.

When concatenating partial paths, we have to ensure that the left- and right-hand sides have non-overlapping sets of variables. To do this, we find the maximum value of any variable on the left-hand side, and add this “offset” to the values of all of the variables on the right-hand side.

pub fn push_front( &mut self, partials: &mut PartialPaths, symbol: PartialScopedSymbol )

Pushes a new PartialScopedSymbol onto the front of this partial symbol stack.

pub fn push_back( &mut self, partials: &mut PartialPaths, symbol: PartialScopedSymbol )

Pushes a new PartialScopedSymbol onto the back of this partial symbol stack.

pub fn pop_front( &mut self, partials: &mut PartialPaths ) -> Option<PartialScopedSymbol>

Removes and returns the PartialScopedSymbol at the front of this partial symbol stack. If the stack is empty, returns None.

pub fn pop_back( &mut self, partials: &mut PartialPaths ) -> Option<PartialScopedSymbol>

Removes and returns the PartialScopedSymbol at the back of this partial symbol stack. If the stack is empty, returns None.

pub fn display<'a>( self, graph: &'a StackGraph, partials: &'a mut PartialPaths ) -> impl Display + 'a

pub fn matches( self, partials: &mut PartialPaths, other: PartialSymbolStack ) -> bool

Returns whether two partial symbol stacks “match”. They must be the same length, and each respective partial scoped symbol must match.

pub fn apply_partial_bindings( self, partials: &mut PartialPaths, symbol_bindings: &PartialSymbolStackBindings, scope_bindings: &PartialScopeStackBindings ) -> Result<PartialSymbolStack, PathResolutionError>

Applies a set of bindings to this partial symbol stack, producing a new partial symbol stack.

pub fn unify( self, partials: &mut PartialPaths, rhs: PartialSymbolStack, symbol_bindings: &mut PartialSymbolStackBindings, scope_bindings: &mut PartialScopeStackBindings ) -> Result<PartialSymbolStack, PathResolutionError>

Given two partial symbol stacks, returns the largest possible partial symbol stack such that any symbol stack that satisfies the result also satisfies both inputs. This takes into account any existing variable assignments, and updates those variable assignments with whatever constraints are necessary to produce a correct result.

Note that this operation is commutative. (Concatenating partial paths, defined in PartialPath::concatenate, is not.)

pub fn equals( self, partials: &mut PartialPaths, other: PartialSymbolStack ) -> bool

pub fn cmp( self, graph: &StackGraph, partials: &mut PartialPaths, other: PartialSymbolStack ) -> Ordering

pub fn iter<'a>( &self, partials: &'a mut PartialPaths ) -> impl Iterator<Item = PartialScopedSymbol> + 'a

Returns an iterator over the contents of this partial symbol stack.

pub fn iter_unordered<'a>( &self, partials: &'a PartialPaths ) -> impl Iterator<Item = PartialScopedSymbol> + 'a

Returns an iterator over the contents of this partial symbol stack, with no guarantee about the ordering of the elements.

pub fn variable(&self) -> Option<SymbolStackVariable>

pub fn largest_symbol_stack_variable(&self) -> u32

Returns the largest value of any symbol stack variable in this partial symbol stack.

pub fn largest_scope_stack_variable(&self, partials: &PartialPaths) -> u32

Returns the largest value of any scope stack variable in this partial symbol stack.

Trait Implementations

impl Clone for PartialSymbolStack

fn clone(&self) -> PartialSymbolStack

Returns a copy of the value.

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

Performs copy-assignment from source.

impl From<PartialSymbolStack> for sg_partial_symbol_stack

fn from(stack: PartialSymbolStack) -> sg_partial_symbol_stack

Converts to this type from the input type.

impl Niche for PartialSymbolStackwhere Deque<PartialScopedSymbol>: Niche,

type Output = MaybeUninit<PartialSymbolStack>

The type that is used to store values of Self inside of a ControlledOption. This might be Self itself, if your niche is a valid instance of the type, but which violates some runtime constraint. But if you cannot easily create your niche as an instance of Self, you can use some other type, you can use some other type instead.

fn none() -> Self::Output

Returns the niche value for this type that should be used to represent None for a ControlledOption.

fn is_none(value: &Self::Output) -> bool

Returns whether value is the niche value for this type.

fn into_some(value: Self) -> Self::Output

Transforms a non-niche value of this type into its Output type. When Output is Self, this will be the identity function.

fn from_some(value: Self::Output) -> Self

Transforms a non-niche value of this type from its Output type. When Output is Self, this will be the identity function.

impl Copy for PartialSymbolStack