Struct sixtyfps_compilerlib::parser::SyntaxNode[−][src]

pub struct SyntaxNode {
    pub node: SyntaxNode<Language>,
    pub source_file: SourceFile,
}

Fields

node: SyntaxNode<Language>source_file: SourceFile

Implementations

`impl SyntaxNode`[src]

`pub fn child_node(&self, kind: SyntaxKind) -> Option<SyntaxNode>`[src]

`pub fn child_token(&self, kind: SyntaxKind) -> Option<SyntaxToken>`[src]

`pub fn child_text(&self, kind: SyntaxKind) -> Option<String>`[src]

`pub fn kind(&self) -> SyntaxKind`[src]

`pub fn children(&self) -> impl Iterator<Item = SyntaxNode>`[src]

`pub fn children_with_tokens(&self) -> impl Iterator<Item = NodeOrToken>`[src]

`pub fn text(&self) -> SyntaxText`[src]

`pub fn parent(&self) -> Option<SyntaxNode>`[src]

Methods from Deref<Target = SyntaxNode<Language>>

`pub fn replace_with(&self, replacement: GreenNode) -> GreenNode`[src]

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) -> <L as Language>::Kind`[src]

`pub fn text_range(&self) -> TextRange`[src]

`pub fn text(&self) -> SyntaxText`[src]

`pub fn green(&self) -> &GreenNodeData`[src]

`pub fn parent(&self) -> Option<SyntaxNode<L>>`[src]

`pub fn ancestors(&self) -> impl Iterator<Item = SyntaxNode<L>>`[src]

`pub fn children(&self) -> SyntaxNodeChildren<L>`[src]

`pub fn children_with_tokens(&self) -> SyntaxElementChildren<L>`[src]

`pub fn first_child(&self) -> Option<SyntaxNode<L>>`[src]

`pub fn last_child(&self) -> Option<SyntaxNode<L>>`[src]

`pub fn first_child_or_token( &self ) -> Option<NodeOrToken<SyntaxNode<L>, SyntaxToken<L>>>`[src]

`pub fn last_child_or_token( &self ) -> Option<NodeOrToken<SyntaxNode<L>, SyntaxToken<L>>>`[src]

`pub fn next_sibling(&self) -> Option<SyntaxNode<L>>`[src]

`pub fn prev_sibling(&self) -> Option<SyntaxNode<L>>`[src]

`pub fn next_sibling_or_token( &self ) -> Option<NodeOrToken<SyntaxNode<L>, SyntaxToken<L>>>`[src]

`pub fn prev_sibling_or_token( &self ) -> Option<NodeOrToken<SyntaxNode<L>, SyntaxToken<L>>>`[src]

`pub fn first_token(&self) -> Option<SyntaxToken<L>>`[src]

Return the leftmost token in the subtree of this node.

`pub fn last_token(&self) -> Option<SyntaxToken<L>>`[src]

Return the rightmost token in the subtree of this node.

`pub fn siblings( &self, direction: Direction ) -> impl Iterator<Item = SyntaxNode<L>>`[src]

`pub fn siblings_with_tokens( &self, direction: Direction ) -> impl Iterator<Item = NodeOrToken<SyntaxNode<L>, SyntaxToken<L>>>`[src]

`pub fn descendants(&self) -> impl Iterator<Item = SyntaxNode<L>>`[src]

`pub fn descendants_with_tokens( &self ) -> impl Iterator<Item = NodeOrToken<SyntaxNode<L>, SyntaxToken<L>>>`[src]

`pub fn preorder(&self) -> Preorder<L>`[src]

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

`pub fn preorder_with_tokens( &self ) -> impl Iterator<Item = WalkEvent<NodeOrToken<SyntaxNode<L>, SyntaxToken<L>>>>`[src]

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<L>>`[src]

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 ) -> NodeOrToken<SyntaxNode<L>, SyntaxToken<L>>`[src]

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