Struct AstWalker 

pub struct AstWalker<'a> { /* private fields */ }

Generic AST walker that converts a tree-sitter parse tree to a panproto Schema.

The walker uses the auto-derived theory to determine vertex and edge kinds directly from the tree-sitter AST, requiring no manual mapping table. Named-scope identity (the part of the vertex ID that survives insertions) is driven by ScopeDetector from the grammar’s tags.scm query.

Implementations

impl<'a> AstWalker<'a>

pub fn new( source: &'a [u8], theory_meta: &'a ExtractedTheoryMeta, protocol: &'a Protocol, config: WalkerConfig, scope_detector: Option<&mut ScopeDetector>, ) -> Self

Create a new walker for the given source, theory, and protocol.

Runs an optional ScopeDetector over the source to build a per-file scope map. Pass None to disable named-scope detection (every non-root vertex gets a positional ID). Pass Some(detector) whose has_query is false for the same effect; the detector short-circuits to an empty scope list.

pub fn walk(&self, tree: &Tree, file_path: &str) -> Result<Schema, ParseError>

Walk the entire parse tree and produce a Schema.

Errors

Returns ParseError::SchemaConstruction if schema building fails.