Struct ParseNode 

pub struct ParseNode {
    pub rule: u32,
    pub start: u32,
    pub end: u32,
    pub first_child: u32,
    pub next_sibling: u32,
}

One node of the parse tree. Twenty bytes.

Children are a linked list rather than a slice, because a node’s children are discovered one at a time and interleaved with the children of every other node being built at the same moment, so a contiguous list would need either a second pass or a per node vector. The list is built in order and read in order, which is the only access pattern the transformer has.

Terminals get no node. A keyword, a symbol and a literal are all recoverable from the token span of the rule that contains them, and giving each one a node would roughly triple the tree for information that is already in the token vector.

Fields

rule: u32

Which rule this is, as an index into RULES.

start: u32

The first token it covers.

end: u32

One past the last token it covers.

first_child: u32

Its first child, or NONE.

next_sibling: u32

The next child of this node’s parent, or NONE.

Trait Implementations

impl Clone for ParseNode

fn clone(&self) -> ParseNode

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for ParseNode

impl Debug for ParseNode

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

Formats the value using the given formatter.

impl Eq for ParseNode

impl PartialEq for ParseNode

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

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for ParseNode