Struct At 

pub struct At(/* private fields */);

Represents a token with Kind::Delim that has the char @. Use T![@] to refer to this. Not to be conused with T![AtKeyword] which represents a token with Kind::AtKeyword.

Trait Implementations

impl Clone for At

fn clone(&self) -> At

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for At

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

Formats the value using the given formatter.

impl Default for At

fn default() -> At

Returns the “default value” for a type.

impl From<At> for Cursor

fn from(value: At) -> Self

Converts to this type from the input type.

impl Hash for At

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 Ord for At

fn cmp(&self, other: &At) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

where Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized,

Restrict a value to a certain interval.

impl<'a> Parse<'a> for At

fn parse<I>(p: &mut Parser<'a, I>) -> Result<Self>

where I: Iterator<Item = Cursor> + Clone,

fn try_parse<I>(p: &mut Parser<'a, I>) -> Result<Self>

where I: Iterator<Item = Cursor> + Clone,

impl PartialEq<char> for At

fn eq(&self, other: &char) -> 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 PartialEq for At

fn eq(&self, other: &At) -> 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 PartialOrd for At

fn partial_cmp(&self, other: &At) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

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

Tests less than (for self and other) and is used by the < operator.

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

Tests less than or equal to (for self and other) and is used by the <= operator.

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

Tests greater than (for self and other) and is used by the > operator.

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

Tests greater than or equal to (for self and other) and is used by the >= operator.

impl<'a> Peek<'a> for At

fn peek<I>(_: &Parser<'a, I>, c: Cursor) -> bool

where I: Iterator<Item = Cursor> + Clone,

const PEEK_KINDSET: KindSet = KindSet::ANY

impl ToCursors for At

fn to_cursors(&self, s: &mut impl CursorSink)

impl ToSpan for At

fn to_span(&self) -> Span

impl Copy for At

impl Eq for At

impl StructuralPartialEq for At