Struct rslint_rowan::cursor::SyntaxNode

pub struct SyntaxNode(_);

Implementations

impl SyntaxNode

pub fn new_root(green: GreenNode) -> SyntaxNode

pub fn replace_with(&self, replacement: GreenNode) -> GreenNode

Returns a green tree, equal to the green tree this node belongs two, except with this node substitute. The complexity of operation is proportional to the depth of the tree

pub fn kind(&self) -> SyntaxKind

pub fn text_range(&self) -> TextRange

pub fn text(&self) -> SyntaxText

pub fn green(&self) -> &GreenNode

pub fn parent(&self) -> Option<SyntaxNode>

pub fn ancestors(&self) -> impl Iterator<Item = SyntaxNode>

pub fn children(&self) -> SyntaxNodeChildren

pub fn children_with_tokens(&self) -> SyntaxElementChildren

pub fn first_child(&self) -> Option<SyntaxNode>

pub fn first_child_or_token(&self) -> Option<SyntaxElement>

pub fn last_child(&self) -> Option<SyntaxNode>

pub fn last_child_or_token(&self) -> Option<SyntaxElement>

pub fn next_sibling(&self) -> Option<SyntaxNode>

pub fn next_sibling_or_token(&self) -> Option<SyntaxElement>

pub fn prev_sibling(&self) -> Option<SyntaxNode>

pub fn prev_sibling_or_token(&self) -> Option<SyntaxElement>

pub fn first_token(&self) -> Option<SyntaxToken>

Return the leftmost token in the subtree of this node

pub fn last_token(&self) -> Option<SyntaxToken>

Return the rightmost token in the subtree of this node

pub fn siblings(&self, direction: Direction) -> impl Iterator<Item = SyntaxNode>

pub fn siblings_with_tokens(
    &self,
    direction: Direction
) -> impl Iterator<Item = SyntaxElement>

pub fn descendants(&self) -> impl Iterator<Item = SyntaxNode>

pub fn descendants_with_tokens(&self) -> impl Iterator<Item = SyntaxElement>

pub fn preorder(&self) -> impl Iterator<Item = WalkEvent<SyntaxNode>>

Traverse the subtree rooted at the current node (including the current node) in preorder, excluding tokens.

pub fn preorder_with_tokens<'a>(
    &'a self
) -> impl Iterator<Item = WalkEvent<SyntaxElement>>

Traverse the subtree rooted at the current node (including the current node) in preorder, including tokens.

pub fn token_at_offset(&self, offset: TextSize) -> TokenAtOffset<SyntaxToken>

Find a token in the subtree corresponding to this node, which covers the offset. Precondition: offset must be withing node's range.

pub fn covering_element(&self, range: TextRange) -> SyntaxElement

Return the deepest node or token in the current subtree that fully contains the range. If the range is empty and is contained in two leaf nodes, either one can be returned. Precondition: range must be contained withing the current node

Trait Implementations

impl Clone for SyntaxNode

fn clone(&self) -> SyntaxNode

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for SyntaxNode

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

Formats the value using the given formatter.

impl Display for SyntaxNode

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

Formats the value using the given formatter.

impl Drop for SyntaxNode

fn drop(&mut self)

Executes the destructor for this type.

impl Eq for SyntaxNode

impl<L: Language> From<SyntaxNode<L>> for SyntaxNode

fn from(node: SyntaxNode<L>) -> SyntaxNode

Performs the conversion.

impl From<SyntaxNode> for SyntaxElement

fn from(node: SyntaxNode) -> SyntaxElement

Performs the conversion.

impl<L: Language> From<SyntaxNode> for SyntaxNode<L>

fn from(raw: SyntaxNode) -> SyntaxNode<L>

Performs the conversion.

impl Hash for SyntaxNode

fn hash<H: Hasher>(&self, state: &mut H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H) where
    H: Hasher, 

Feeds a slice of this type into the given Hasher.

impl PartialEq<SyntaxNode> for SyntaxNode

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

This method tests for self and other values to be equal, and is used by ==.

#[must_use]fn ne(&self, other: &Rhs) -> bool

This method tests for !=.