Enum RedTree 

pub enum RedTree<'a, L: Language> {
    Node(RedNode<'a, L>),
    Leaf(RedLeaf<L>),
}

A red tree element with absolute position information.

Variants

Node(RedNode<'a, L>)

A red node with child elements

Leaf(RedLeaf<L>)

A red leaf kind

Implementations

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

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

Returns the absolute byte span of this red tree element.

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

where T: From<L::ElementType> + From<L::TokenType>,

Returns the kind of this red tree element.

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

Returns the text of this red tree element from the source.

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

Returns an iterator over the child elements if this is a node.

pub fn as_node(&self) -> Option<RedNode<'a, L>>

Returns this element as a node if it is one.

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

Returns this element as a leaf if it is one.

Trait Implementations

impl<'a, L: Language> Clone for RedTree<'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 RedTree<'a, L>

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

Formats the value using the given formatter.

impl<'a, L: Language> PartialEq for RedTree<'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 RedTree<'a, L>

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