Struct IncrementalTree 

pub struct IncrementalTree {
    pub root: Node,
    pub source: String,
    /* private fields */
}

A parse tree with incremental parsing support and node mapping

Maintains an AST along with efficient lookup structures for finding nodes by position, enabling fast incremental updates. The node_map provides O(1) access to nodes at specific byte positions.

Fields

root: Node

source: String

Implementations

impl IncrementalTree

pub fn new(root: Node, source: String) -> IncrementalTree

Create a new incremental tree

pub fn find_containing_node(&self, start: usize, end: usize) -> Option<&Node>

Find the smallest node containing the given byte range

Trait Implementations

impl Clone for IncrementalTree

fn clone(&self) -> IncrementalTree

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for IncrementalTree

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

Formats the value using the given formatter.