Struct Rule 

pub struct Rule<'a> {
    pub symbol: Symbol,
    pub children: &'a [StateId],
    pub result: StateId,
    pub weight: f64,
}

Borrowed view of one transition rule in an Explicit automaton.

A rule means: when a node has symbol and its children have exactly children, the node may receive result.

Fields

symbol: Symbol

Symbol on the tree node matched by this rule.

children: &'a [StateId]

Required child-state tuple, in left-to-right child order.

result: StateId

State assigned to the parent node when the rule applies.

weight: f64

Weight assigned to this transition rule.

Trait Implementations

impl<'a> Clone for Rule<'a>

fn clone(&self) -> Rule<'a>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<'a> Copy for Rule<'a>

impl<'a> Debug for Rule<'a>

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

Formats the value using the given formatter.

impl<'a> PartialEq for Rule<'a>

fn eq(&self, other: &Rule<'a>) -> 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<'a> StructuralPartialEq for Rule<'a>