Struct biome_js_syntax::JsThisExpression
source · pub struct JsThisExpression { /* private fields */ }
Implementations§
source§impl JsThisExpression
impl JsThisExpression
sourcepub const unsafe fn new_unchecked(syntax: SyntaxNode) -> Self
pub const unsafe fn new_unchecked(syntax: SyntaxNode) -> Self
Create an AstNode from a SyntaxNode without checking its kind
§Safety
This function must be guarded with a call to AstNode::can_cast or a match on SyntaxNode::kind
pub fn as_fields(&self) -> JsThisExpressionFields
pub fn this_token(&self) -> SyntaxResult<SyntaxToken>
source§impl JsThisExpression
impl JsThisExpression
pub fn with_this_token(self, element: SyntaxToken) -> Self
Trait Implementations§
source§impl AstNode for JsThisExpression
impl AstNode for JsThisExpression
type Language = JsLanguage
const KIND_SET: SyntaxKindSet<Language> = _
source§fn can_cast(kind: SyntaxKind) -> bool
fn can_cast(kind: SyntaxKind) -> bool
Returns
true
if a node with the given kind can be cased to this AST node.source§fn cast(syntax: SyntaxNode) -> Option<Self>
fn cast(syntax: SyntaxNode) -> Option<Self>
Tries to cast the passed syntax node to this AST node. Read more
source§fn syntax(&self) -> &SyntaxNode
fn syntax(&self) -> &SyntaxNode
Returns the underlying syntax node.
source§fn into_syntax(self) -> SyntaxNode
fn into_syntax(self) -> SyntaxNode
Returns the underlying syntax node.
source§fn cast_ref(syntax: &SyntaxNode<Self::Language>) -> Option<Self>where
Self: Sized,
fn cast_ref(syntax: &SyntaxNode<Self::Language>) -> Option<Self>where
Self: Sized,
Takes a reference of a syntax node and tries to cast it to this AST node. Read more
source§fn try_cast(
syntax: SyntaxNode<Self::Language>
) -> Result<Self, SyntaxNode<Self::Language>>
fn try_cast( syntax: SyntaxNode<Self::Language> ) -> Result<Self, SyntaxNode<Self::Language>>
Tries to cast the passed syntax node to this AST node. Read more
source§fn try_cast_node<T>(node: T) -> Result<Self, T>
fn try_cast_node<T>(node: T) -> Result<Self, T>
Tries to cast the AST
node
into this node. Read moresource§fn unwrap_cast(syntax: SyntaxNode<Self::Language>) -> Selfwhere
Self: Sized,
fn unwrap_cast(syntax: SyntaxNode<Self::Language>) -> Selfwhere
Self: Sized,
Cast this node to this AST node Read more
source§fn text(&self) -> String
fn text(&self) -> String
Returns the string representation of this node without the leading and trailing trivia
fn range(&self) -> TextRange
fn clone_subtree(&self) -> Selfwhere
Self: Sized,
fn parent<T>(&self) -> Option<T>
source§fn with_leading_trivia_pieces<I>(self, trivia: I) -> Option<Self>where
I: IntoIterator<Item = SyntaxTriviaPiece<Self::Language>>,
<I as IntoIterator>::IntoIter: ExactSizeIterator,
fn with_leading_trivia_pieces<I>(self, trivia: I) -> Option<Self>where
I: IntoIterator<Item = SyntaxTriviaPiece<Self::Language>>,
<I as IntoIterator>::IntoIter: ExactSizeIterator,
Return a new version of this node with the leading trivia of its first token replaced with
trivia
.source§fn with_trailing_trivia_pieces<I>(self, trivia: I) -> Option<Self>where
I: IntoIterator<Item = SyntaxTriviaPiece<Self::Language>>,
<I as IntoIterator>::IntoIter: ExactSizeIterator,
fn with_trailing_trivia_pieces<I>(self, trivia: I) -> Option<Self>where
I: IntoIterator<Item = SyntaxTriviaPiece<Self::Language>>,
<I as IntoIterator>::IntoIter: ExactSizeIterator,
Return a new version of this node with the trailing trivia of its last token replaced with
trivia
.fn prepend_trivia_pieces<I>(self, trivia: I) -> Option<Self>where
I: IntoIterator<Item = SyntaxTriviaPiece<Self::Language>>,
<I as IntoIterator>::IntoIter: ExactSizeIterator,
fn append_trivia_pieces<I>(self, trivia: I) -> Option<Self>where
I: IntoIterator<Item = SyntaxTriviaPiece<Self::Language>>,
<I as IntoIterator>::IntoIter: ExactSizeIterator,
source§fn trim_trivia(self) -> Option<Self>
fn trim_trivia(self) -> Option<Self>
Return a new version of this node without leading and trailing newlines and whitespaces.
source§fn trim_leading_trivia(self) -> Option<Self>
fn trim_leading_trivia(self) -> Option<Self>
Return a new version of this node without leading newlines and whitespaces.
source§fn trim_trailing_trivia(self) -> Option<Self>
fn trim_trailing_trivia(self) -> Option<Self>
Return a new version of this node without trailing newlines and whitespaces.
source§impl Clone for JsThisExpression
impl Clone for JsThisExpression
source§fn clone(&self) -> JsThisExpression
fn clone(&self) -> JsThisExpression
Returns a copy of the value. Read more
1.0.0 · source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source
. Read moresource§impl Debug for JsThisExpression
impl Debug for JsThisExpression
source§impl Display for JsThisExpression
impl Display for JsThisExpression
source§impl From<JsThisExpression> for AnyJsExpression
impl From<JsThisExpression> for AnyJsExpression
source§fn from(node: JsThisExpression) -> AnyJsExpression
fn from(node: JsThisExpression) -> AnyJsExpression
Converts to this type from the input type.
source§impl From<JsThisExpression> for JsSyntaxElement
impl From<JsThisExpression> for JsSyntaxElement
source§fn from(n: JsThisExpression) -> SyntaxElement
fn from(n: JsThisExpression) -> SyntaxElement
Converts to this type from the input type.
source§impl From<JsThisExpression> for JsSyntaxNode
impl From<JsThisExpression> for JsSyntaxNode
source§fn from(n: JsThisExpression) -> SyntaxNode
fn from(n: JsThisExpression) -> SyntaxNode
Converts to this type from the input type.
source§impl Hash for JsThisExpression
impl Hash for JsThisExpression
source§impl PartialEq for JsThisExpression
impl PartialEq for JsThisExpression
source§fn eq(&self, other: &JsThisExpression) -> bool
fn eq(&self, other: &JsThisExpression) -> bool
This method tests for
self
and other
values to be equal, and is used
by ==
.impl Eq for JsThisExpression
impl StructuralPartialEq for JsThisExpression
Auto Trait Implementations§
impl Freeze for JsThisExpression
impl RefUnwindSafe for JsThisExpression
impl !Send for JsThisExpression
impl !Sync for JsThisExpression
impl Unpin for JsThisExpression
impl UnwindSafe for JsThisExpression
Blanket Implementations§
source§impl<T> AstNodeExt for Twhere
T: AstNode,
impl<T> AstNodeExt for Twhere
T: AstNode,
source§fn replace_node_discard_trivia<N>(self, prev_node: N, next_node: N) -> Option<T>
fn replace_node_discard_trivia<N>(self, prev_node: N, next_node: N) -> Option<T>
source§fn replace_node<N>(self, prev_node: N, next_node: N) -> Option<T>
fn replace_node<N>(self, prev_node: N, next_node: N) -> Option<T>
Return a new version of this node with the node
prev_node
replaced with next_node
,
transfering the leading and trailing trivia of prev_node
to next_node
Read moresource§fn replace_token_discard_trivia(
self,
prev_token: SyntaxToken<<T as AstNode>::Language>,
next_token: SyntaxToken<<T as AstNode>::Language>
) -> Option<T>
fn replace_token_discard_trivia( self, prev_token: SyntaxToken<<T as AstNode>::Language>, next_token: SyntaxToken<<T as AstNode>::Language> ) -> Option<T>
source§fn replace_token(
self,
prev_token: SyntaxToken<<T as AstNode>::Language>,
next_token: SyntaxToken<<T as AstNode>::Language>
) -> Option<T>
fn replace_token( self, prev_token: SyntaxToken<<T as AstNode>::Language>, next_token: SyntaxToken<<T as AstNode>::Language> ) -> Option<T>
Return a new version of this node with the token
prev_token
replaced with next_token
,
transfering the leading and trailing trivia of prev_token
to next_token
Read morefn detach(self) -> T
source§impl<L, T> BatchMutationExt<L> for T
impl<L, T> BatchMutationExt<L> for T
source§fn begin(self) -> BatchMutation<L>
fn begin(self) -> BatchMutation<L>
It starts a BatchMutation
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<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.