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.

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 new(green: &'a GreenNode<'a, L>, offset: usize) -> Self

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

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

Returns the absolute byte span of this red node.

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

Gets the child element at the specified index.

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 child element at the specified absolute byte offset.

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

Finds the child element at the specified absolute byte offset.

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>