Struct Parse 

pub struct Parse { /* private fields */ }

The result of parsing a source file: a lossless green tree, the interner needed to read token text back, and the diagnostics gathered while parsing.

Implementations

impl Parse

pub fn syntax_node(&self) -> ResolvedNode<SyntaxKind>

The resolved (interner-carrying) red tree root. Cheap to produce; supports Display/.text() and the byte-exact round-trip.

pub fn errors(&self) -> &[SyntaxError]

The parse diagnostics (lexer/parser recovery + indentation issues).

pub fn green(&self) -> &GreenNode

The raw green tree (position-independent, shared).

pub fn debug_tree(&self) -> String

A stable, indented S-expression dump of the tree (kinds + byte ranges + token text) — the golden-fixture review surface.

Trait Implementations

impl Clone for Parse

fn clone(&self) -> Parse

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Parse

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

Formats the value using the given formatter.

impl Eq for Parse

impl PartialEq for Parse

Equality compares the lossless green tree and the diagnostics; the interner is excluded because it is a derived token-text cache (two parses with equal green trees reference equal token text). This makes Parse a sound salsa tracked-fn return: an unchanged reparse backdates instead of invalidating dependents — the Phase-3 incrementality precondition (Playbook §4). GreenNode equality is structural, so this is O(tree) worst case but short-circuits on the first difference.

fn eq(&self, other: &Self) -> 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.