Struct NamingOpTok 

pub struct NamingOpTok {
    pub tok: Token,
    pub span: Span,
}

The operator token accepted inside a ( ‹op› ) NAMING form (see OpNameTok) — BinOpTok’s whole alternative set, PLUS !/before. Upstream parser.mly’s binop nonterminal is used in exactly two productions, both naming forms (VAL LPAREN binop RPAREN and LPAREN binop RPAREN as a bare atomic-expression reference) — never for infix chaining — and it accepts UNOP_EXCLAM/BEFORE/ LNOT there, unlike this grammar’s flattened infix operator chain (cst.rs’s OpRhs, which uses BinOpTok directly and correctly excludes them: !/before are not simple infix operators here). LNOT (not) has no reserved keyword token in this port at all (see the not note beside crate::token::Token::Mod): it lexes as an ordinary VarTok, so let not x = ../val not : ty (unparenthesized) already parse via the plain-name arm of cst.rs’s BindName/ast::Atomic:: OpRef’s sibling Var arm, with no token to add here. Kept as its own struct (mirroring BinOpTok’s shape) rather than widening BinOpTok itself, so the infix-chain grammar’s exclusion stays intact by construction — nothing downstream of BinOpTok::parse can ever see !/before.

Fields

tok: Token

span: Span

Implementations

impl NamingOpTok

pub fn op_text(&self) -> String

The operator’s source text, e.g. "+", "mod", "::", "!", "before" — BinOpTok::op_text plus the two naming-only additions.

Trait Implementations

impl Clone for NamingOpTok

fn clone(&self) -> NamingOpTok

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for NamingOpTok

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

Formats the value using the given formatter.

impl Parse<WithSpan<Token, Span>> for NamingOpTok

type Error = ParseError<Span>

Every error must be convertible to the universal one, so a field’s failure can become the enclosing type’s failure with no per-field where-predicate. Stating it HERE rather than at each derived impl is what keeps it out of the obligation graph: a per-field <FieldTy as Parse<Atom>>::Error: Into<…> predicate re-creates a projection cycle on a recursive field (E0275), which decycle’s bound-peeling does not break.

fn parse_stream<S: ParseStream<Atom = Atom>>( stream: &mut S, ) -> Result<Self, Self::Error>

Parse from a reborrowable stream.

fn parse(stream: impl IntoParseStream<Atom = Atom>) -> Result<Self, Self::Error>

Parse from anything that can become a stream — String, TokenStream, an existing stream.

fn attempt(self) -> Attempt<Self>

Wrap this value in Attempt, the atomic-parse marker: parsing an Attempt<Self> parses Self but rewinds the stream on failure (it requires Atom: Clone). This is the value constructor; value.attempt() is sugar for Attempt(value).

impl PartialEq for NamingOpTok

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

Equality operator ==.

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

Inequality operator !=.

impl Spanned for NamingOpTok

type Span = Span

fn span(&self) -> Span

impl StructuralPartialEq for NamingOpTok

impl Unparse<WithSpan<Token, Span>> for NamingOpTok

fn unparse<S: Emitter<Atom>>(&self, sink: &mut S) -> Result<(), S::Error>