Struct Tree 

pub struct Tree { /* private fields */ }

Implementations

impl Tree

pub const ROOT: ElementId = 0

pub fn text(&self) -> &str

The whole source text.

pub fn len(&self) -> usize

Number of elements (nodes and tokens).

pub fn is_empty(&self) -> bool

pub fn kind(&self, e: ElementId) -> SyntaxKind

pub fn is_token(&self, e: ElementId) -> bool

pub fn subtree_end(&self, e: ElementId) -> ElementId

One past the last element of e’s subtree, in preorder.

pub fn parent(&self, e: ElementId) -> Option<ElementId>

pub fn first_child(&self, e: ElementId) -> Option<ElementId>

pub fn last_child(&self, e: ElementId) -> Option<ElementId>

pub fn next_sibling(&self, e: ElementId) -> Option<ElementId>

pub fn prev_sibling(&self, e: ElementId) -> Option<ElementId>

pub fn children(&self, e: ElementId) -> Children<'_>

pub fn text_range(&self, e: ElementId) -> TextRange

pub fn text_of(&self, e: ElementId) -> &str

pub fn has_descendant_of_kind(&self, e: ElementId, kind: SyntaxKind) -> bool

Whether any element strictly inside e’s subtree has kind.

pub fn find_kinds<const N: usize, const M: usize>( &self, e: ElementId, nodes: [SyntaxKind; N], tokens: [SyntaxKind; M], ) -> KindScan<'_>

The elements of e’s subtree (e included), in preorder, that are nodes of one of nodes or tokens of one of tokens: a scan of the raw kind words, cheaper than a kind/is_token walk.

Trait Implementations

impl Clone for Tree

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Tree

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

Formats the value using the given formatter.

impl Eq for Tree

impl PartialEq for Tree

fn eq(&self, other: &Self) -> bool

Equality operator ==.

fn ne(&self, other: &Rhs) -> bool

Inequality operator !=.

impl StructuralPartialEq for Tree