Struct MathElemCst 

pub struct MathElemCst {
    pub base: MathBot,
    pub scripts: Vec<MathScript>,
}

mathtop: one math element, i.e. a mathbot base with any postfix ^/_/' script combos (mathtop’s seven alternatives, flattened to a Vec in source order — the same Ops/OpChain deferred- precedence technique, since combos 3–6 interleave sub/superscript application order in a way elaboration is better placed to resolve).

No direct self-loop. Unlike Expr/PatBot/TypeExpr, this grammar corner needs no fourth singleton SCC at all: scripts is a Vec, so an empty run already degenerates to plain mathbot, and mathbot’s only recursive spot ({ … } re-entering mathmain) is threaded through MathErased exactly like every other nested reference to “one math element” (matharg’s math-mode argument, Atomic::MathText’s program-mode embed, InlineElem::EmbedMath’s inline-text embed, MathGroupArg’s { … } script operand). So MathElemCst is structurally acyclic within #[recurse]’s SCC analysis — like OpChain/AppExpr/Atomic — and monomorphizes exactly once (one stream type). This is safer than carving out a real self-loop would have been, not a shortcut: every recursive edge is erased, so there is no bounded-depth engine to blow up.

Fields

base: MathBot

scripts: Vec<MathScript>

Trait Implementations

impl Clone for MathElemCst

fn clone(&self) -> MathElemCst

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for MathElemCst

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

Formats the value using the given formatter.

impl<__SyanMacro_Atom> Parse<__SyanMacro_Atom> for MathElemCst

where __SyanMacro_Atom: Spanned + Clone, MathBot: Parse<__SyanMacro_Atom>, Vec<MathScript>: Parse<__SyanMacro_Atom>,

type Error = ParseError<<__SyanMacro_Atom as Spanned>::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<__SyanMacro_S: ParseStream<Atom = __SyanMacro_Atom>>( __syan_stream: &mut __SyanMacro_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 MathElemCst

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

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for MathElemCst

impl<__SyanMacro_Atom> Unparse<__SyanMacro_Atom> for MathElemCst

where MathBot: Unparse<__SyanMacro_Atom>, Vec<MathScript>: Unparse<__SyanMacro_Atom>,

fn unparse<__Syan_Emitter: Emitter<__SyanMacro_Atom>>( &self, __syan_sink: &mut __Syan_Emitter, ) -> Result<(), <__Syan_Emitter as Emitter<__SyanMacro_Atom>>::Error>