Struct AmberToken 

pub struct AmberToken<'a> { /* private fields */ }

Leaf token in the amber syntax tree.

It’s a lightweight version of SyntaxToken without access to parent and siblings. It’s much cheaper than SyntaxToken to create and use. This is preferred to use for better performance if you don’t need to visit parent and siblings.

Implementations

impl<'a> AmberToken<'a>

pub fn kind(&self) -> SyntaxKind

Kind of this token.

pub fn text_range(&self) -> TextRange

The range that this token covers in the original text.

pub fn green(&self) -> &'a GreenToken

The underlying green token of this red token.

pub fn text(&self) -> &'a str

Text of this token.

Trait Implementations

impl<'a> Clone for AmberToken<'a>

fn clone(&self) -> AmberToken<'a>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<'a> From<&'a SyntaxToken> for AmberToken<'a>

fn from(token: &'a SyntaxToken) -> Self

Converts to this type from the input type.

impl<'a> From<AmberToken<'a>> for NodeOrToken<AmberNode<'a>, AmberToken<'a>>

fn from(token: AmberToken<'a>) -> Self

Converts to this type from the input type.

impl<'a> Hash for AmberToken<'a>

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, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl<'a> PartialEq for AmberToken<'a>

fn eq(&self, other: &AmberToken<'a>) -> bool

Tests for self and other values to be equal, and is used by ==.

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

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<'a> Copy for AmberToken<'a>

impl<'a> Eq for AmberToken<'a>

impl<'a> StructuralPartialEq for AmberToken<'a>