Struct GreenNode 

pub struct GreenNode<K: Copy> {
    pub kind: K,
    pub children: Vec<GreenTree<K>>,
    pub length: usize,
}

A green node that contains child elements without parent pointers.

Green nodes represent kind tree nodes with their structural information but without position data or parent references. This design makes them immutable and shareable across different parse trees.

Fields

kind: K

The node kind/category (e.g., expression, statement, declaration)

children: Vec<GreenTree<K>>

The child elements of this node

length: usize

The total byte length of this node and all its children

Implementations

impl<K: Copy> GreenNode<K>

pub fn new(kind: K, children: Vec<GreenTree<K>>) -> Arc<Self>

Creates a new green node from kind and children.

Arguments

• kind - The node kind/category
• children - The child elements of this node

Returns

A reference-counted GreenNode with computed total length

impl<K: Copy> GreenNode<K>

pub fn replace_range( &self, replace_start: usize, replace_end: usize, new_children: Vec<GreenTree<K>>, ) -> Arc<Self>

Replaces a range of child elements with new children.

This method is essential for incremental parsing, allowing efficient updates to kind trees by replacing only the changed portions.

Arguments

• replace_start - The starting index of the range to replace (inclusive)
• replace_end - The ending index of the range to replace (exclusive)
• new_children - The new child elements to insert

Returns

A new Arc<GreenNode<K>> with the specified children replaced

Panics

Panics if the indices are out of bounds or if replace_start > replace_end

Trait Implementations

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

fn clone(&self) -> GreenNode<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 GreenNode<K>

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

Formats the value using the given formatter.