Struct Table 

pub struct Table {
    pub source: &'static str,
    pub nodes: &'static [Node],
    pub rules: &'static [Rule],
}

A set of rules, as an automaton over their patterns.

Fields

source: &'static str

The rule file this was built from, so that anything said about a rule can name a file somebody can open.

nodes: &'static [Node]

The trie. Node zero is the root.

rules: &'static [Rule]

The rules, in the order the file writes them.

Implementations

impl Table

pub fn find<S: Subject>( &self, subject: &S, term: S::Node, ) -> Option<Match<S::Node>>

The rule that fires on this term, and what it bound.

The term is matched as a whole. Finding the terms in a function worth matching is the caller’s job and not this one’s.

pub fn find_in<S: Subject>( &self, subject: &S, term: S::Node, left: &mut Vec<S::Node>, bindings: &mut Vec<S::Node>, ) -> Option<usize>

Table::find with the two stacks the walk needs handed in, for a caller that asks more than once and would rather not pay for them every time.

Both are emptied before the walk. What bindings holds afterwards is what the pattern bound when a rule fired, and nothing anybody reads when none did.

pub fn rule<N>(&self, found: &Match<N>) -> &Rule

The rule a match found, which is the one thing every caller wants out of it.

Trait Implementations

impl Debug for Table

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

Formats the value using the given formatter.