pub struct CppLabelStat { /* private fields */ }Expand description
A label: again:.
Implementations§
Source§impl CppLabelStat
impl CppLabelStat
pub fn get_label(&self) -> Option<CppNameToken>
Trait Implementations§
Source§impl Clone for CppLabelStat
impl Clone for CppLabelStat
Source§impl CppAstNode for CppLabelStat
impl CppAstNode for CppLabelStat
fn syntax(&self) -> &CppSyntaxNode
Source§fn can_cast(kind: CppSyntaxKind) -> bool
fn can_cast(kind: CppSyntaxKind) -> bool
Is a node of this kind a node of type
Self? Read morefn cast(syntax: CppSyntaxNode) -> Option<Self>
Source§fn child<N: CppAstNode>(&self) -> Option<N>
fn child<N: CppAstNode>(&self) -> Option<N>
The first child node of type
N.Source§fn token<N: CppAstToken>(&self) -> Option<N>
fn token<N: CppAstToken>(&self) -> Option<N>
The first child token of type
N.Source§fn token_by_kind(&self, kind: CppTokenKind) -> Option<CppGeneralToken>
fn token_by_kind(&self, kind: CppTokenKind) -> Option<CppGeneralToken>
The first child token with the given kind, as a generic token.
Source§fn children<N: CppAstNode>(&self) -> CppAstChildren<N> ⓘ
fn children<N: CppAstNode>(&self) -> CppAstChildren<N> ⓘ
All child nodes of type
N.Source§fn tokens<N: CppAstToken>(&self) -> CppAstTokenChildren<N> ⓘ
fn tokens<N: CppAstToken>(&self) -> CppAstTokenChildren<N> ⓘ
All child tokens of type
N.Source§fn descendants<N: CppAstNode>(&self) -> impl Iterator<Item = N>
fn descendants<N: CppAstNode>(&self) -> impl Iterator<Item = N>
All descendant nodes of type
N.Source§fn walk_descendants<N: CppAstNode>(&self) -> impl Iterator<Item = WalkEvent<N>>
fn walk_descendants<N: CppAstNode>(&self) -> impl Iterator<Item = WalkEvent<N>>
All descendants of type
N, with enter/leave events.Source§fn ancestors<N: CppAstNode>(&self) -> impl Iterator<Item = N>
fn ancestors<N: CppAstNode>(&self) -> impl Iterator<Item = N>
All ancestor nodes of type
N, innermost first.Source§fn get_root(&self) -> CppSyntaxNode
fn get_root(&self) -> CppSyntaxNode
The root of the tree this node belongs to.
Source§fn previous_sibling<N: CppAstNode>(&self) -> Option<N>
fn previous_sibling<N: CppAstNode>(&self) -> Option<N>
The sibling node immediately before this one, when it is of type
N. Read moreSource§fn next_sibling<N: CppAstNode>(&self) -> Option<N>
fn next_sibling<N: CppAstNode>(&self) -> Option<N>
The sibling node immediately after this one, when it is of type
N.Source§fn get_parent<N: CppAstNode>(&self) -> Option<N>
fn get_parent<N: CppAstNode>(&self) -> Option<N>
The parent node, if it is of type
N.fn get_position(&self) -> TextSize
fn get_range(&self) -> TextRange
Source§fn get_self_or_ancestor<N: CppAstNode>(&self) -> Option<N>
fn get_self_or_ancestor<N: CppAstNode>(&self) -> Option<N>
The containing node of type
N, starting from this node itself.Source§fn get_syntax_id(&self) -> CppSyntaxId
fn get_syntax_id(&self) -> CppSyntaxId
A storable, comparable handle to this node. See
CppSyntaxId.Source§impl Debug for CppLabelStat
impl Debug for CppLabelStat
impl Eq for CppLabelStat
Source§impl Hash for CppLabelStat
impl Hash for CppLabelStat
Source§impl PartialEq for CppLabelStat
impl PartialEq for CppLabelStat
impl StructuralPartialEq for CppLabelStat
Auto Trait Implementations§
impl !RefUnwindSafe for CppLabelStat
impl !Send for CppLabelStat
impl !Sync for CppLabelStat
impl !UnwindSafe for CppLabelStat
impl Forget for CppLabelStat
impl Freeze for CppLabelStat
impl Move for CppLabelStat
impl Unpin for CppLabelStat
impl UnsafeUnpin for CppLabelStat
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Compare self to
key and return true if they are equal.Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ
fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ
Converts
self into a Left variant of Either<Self, Self>
if into_left is true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
Converts
self into a Left variant of Either<Self, Self>
if into_left(&self) returns true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read more