Enum RedTree 

pub enum RedTree<K: Copy> {
    Node(RedNode<K>),
    Leaf(RedLeaf<K>),
}

A red tree element with absolute position information.

Red trees are the position-aware representation of kind trees, computed by applying offsets to green trees. They are used for incremental parsing, error reporting, and diagnostics.

Variants

Node(RedNode<K>)

A red node with child elements

Leaf(RedLeaf<K>)

A red leaf kind

Implementations

impl<K: Copy> RedTree<K>

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

Returns the absolute byte span of this red tree element.

Returns

A Range<usize> representing the absolute byte positions in the source text that this element occupies.

Trait Implementations

impl<K: Clone + Copy> Clone for RedTree<K>

fn clone(&self) -> RedTree<K>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<K: Debug + Copy> Debug for RedTree<K>

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

Formats the value using the given formatter.