Struct EvalNode 

pub struct EvalNode<'a, T> { /* private fields */ }

One node under ParseResult::eval: dispatch on name, fold children on demand with eval.

Implementations

impl<'a, T> EvalNode<'a, T>

pub fn name(&self) -> &'a str

The rule display name for a tree node, the token TYPE name (e.g. "NUMBER") for a token — rule names are lowercase and terminal names uppercase by Lark convention, so one match dispatches both — and "" for a placeholder hole.

pub fn len(&self) -> usize

Number of children (0 for a leaf).

pub fn is_empty(&self) -> bool

pub fn eval(&self, i: usize) -> T

Fold child i by re-entering the evaluator closure. Children not evaled are never visited — arms may skip subtrees.

Panics

On a leaf node or an out-of-range index (like slice indexing).

pub fn eval_all(&self) -> Vec<T>

Fold every child, in order.

pub fn token(&self) -> Option<&'a Token>

The token behind this node, when it is a token leaf.

pub fn text(&self) -> &'a str

The token text, or "" for non-token nodes.