Enum CellTokenTree 

pub enum CellTokenTree {
    Group(CellTokenGroup),
    Literal(LiteralToken),
    Punct(Punct),
    Ident(IdentToken),
    Adj(Span),
}

One token tree in a framed Macaulay2 cell.

Lexical atoms retain their raw token types. Delimiter groups recursively contain CellTokenStream, while Self::Adj represents the inferred application boundary that does not exist in TokenTree.

Variants

Group(CellTokenGroup)

A recursively framed delimiter group.

Literal(LiteralToken)

A lexical literal.

Punct(Punct)

Lexical punctuation.

Ident(IdentToken)

A lexical identifier or keyword.

Adj(Span)

Inferred same-line adjacency at its zero-width source position.

Implementations

impl CellTokenTree

pub fn spelling(&self) -> Option<&str>

Returns the lexical spelling of a flat token or the empty adjacency spelling.

pub fn leading_trivia(&self) -> &[Trivia]

Returns comments attached before this cell token.

pub fn trailing_trivia(&self) -> &[Trivia]

Returns comments attached after this cell token.

Trait Implementations

impl Clone for CellTokenTree

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for CellTokenTree

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

Formats the value using the given formatter.

impl Eq for CellTokenTree

impl PartialEq for CellTokenTree

fn eq(&self, other: &Self) -> bool

Equality operator ==.

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

Inequality operator !=.

impl Spanned for CellTokenTree

fn try_span(&self) -> Option<Span>

Returns the smallest span covering this value, when its constituents share one source snapshot.

fn span(&self) -> Span

Returns the smallest span covering this value.

fn expect_span(&self) -> Span

Returns this value’s span when one source snapshot covers it.

impl StructuralPartialEq for CellTokenTree