Struct RedNode 

pub struct RedNode<'a, L: Language> {
    pub green: &'a GreenNode<'a, L>,
    pub offset: usize,
}

A red node that wraps a green node with absolute offset information.

Red nodes are position-aware views into the immutable green tree structure. They are small, copyable handles that can be used for traversal and analysis.

Design Note: Reference vs Owned

We store &'a GreenNode<'a, L> here instead of GreenNode<'a, L> to keep RedNode as small as possible (16 bytes: 8 for pointer + 8 for offset). This makes it efficient to pass RedNode by value during tree traversal.

Fields

green: &'a GreenNode<'a, L>

The underlying green node that contains the structural information.

offset: usize

The absolute byte offset of this node in the source text.

Implementations

impl<'a, L: Language> RedNode<'a, L>

pub fn text<'s, S: Source + ?Sized>(&self, source: &'s S) -> Cow<'s, str>

Returns the text content of this red node from the source.

pub fn new(green: &'a GreenNode<'a, L>, offset: usize) -> Self

Creates a new red node from a green node and absolute offset.

pub fn span(&self) -> Range<usize>

Returns the absolute byte span of this red node.

pub fn element_type(&self) -> L::ElementType

Returns the element type of this red node.

pub fn green(&self) -> &'a GreenNode<'a, L>

Returns the underlying green node.

pub fn kind<T>(&self) -> T

where T: From<L::ElementType>,

Returns the kind of this red node.

pub fn child_at(&self, idx: usize) -> RedTree<'a, L>

Gets the child element at the specified index.

Arguments

• idx - The zero-based index of the child.

Panics

Panics if the index is out of bounds.

pub fn children(&self) -> RedChildren<'a, L>

Returns an iterator over the child elements of this red node.

pub fn child_index_at_offset(&self, offset: usize) -> Option<usize>

Finds the index of the child element containing the specified absolute byte offset.

Arguments

• offset - The absolute byte offset to search for.

pub fn child_at_offset(&self, offset: usize) -> Option<RedTree<'a, L>>

Finds the child element containing the specified absolute byte offset.

Arguments

• offset - The absolute byte offset to search for.

pub fn leaf_at_offset(&self, offset: usize) -> Option<RedLeaf<L>>

Finds the leaf element at the specified absolute byte offset by traversing down the tree.

This method performs a deep search, following child nodes until a leaf is found.

Arguments

• offset - The absolute byte offset to search for.

pub fn first_token(&self) -> Option<RedLeaf<L>>

Returns the first child token if any.

Trait Implementations

impl<'a, L: Language> Clone for RedNode<'a, L>

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<'a, L: Language> Debug for RedNode<'a, L>

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

Formats the value using the given formatter.

impl<'a, L: Language> PartialEq for RedNode<'a, L>

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.

impl<'a, L: Language> Copy for RedNode<'a, L>

impl<'a, L: Language> Eq for RedNode<'a, L>