Struct TypeApp 

pub struct TypeApp {
    pub head: TypeAtom,
    pub rest: Vec<TypeAtom>,
}

txapp — a postfix type application arg1 arg2 … argN ctor, upstream’s N-ary chain flattened into a greedy atom run (the way OpChain/PatCons flatten their own left-recursions). head is always present; when rest is non-empty the LAST atom is the type constructor (a bare or Mod.-qualified name — list/option/ result/Eq.t/implicit) and every atom before it (including head) is one of its arguments. This is unambiguous because SATySFi always parenthesizes a nested single-argument application (('a list) list, ('a t) implicit — never 'a list list), so a flat run of atoms can only be one constructor applied to the preceding arguments:

• int → head = int, rest = [] (a bare atom).
• 'a option → head = 'a, rest = [option] (one arg).
• 'a 'e result → head = 'a, rest = ['e, result] (satysfi-base’s two-parameter result/either/t/map).
• ('a Eq.t) implicit → head = ('a Eq.t), rest = [implicit] (satysfi-base’s typeclass-dictionary marker).

Elaboration (typecheck::lower_type_app) does the head/args/ctor split; the grammar itself is a plain, always-terminating greedy Vec<TypeAtom> (each atom consumes ≥1 token, stopping at the first non-atom — ->, *, ), ;, …). Both the unqualified and Mod.-qualified constructor forms fall out for free, since a Mod.t ctor is just a TypeAtom::NameMod like any other atom.

Fields

head: TypeAtom

rest: Vec<TypeAtom>

Trait Implementations

impl Clone for TypeApp

fn clone(&self) -> TypeApp

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for TypeApp

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

Formats the value using the given formatter.

impl<__SyanMacro_Atom> Parse<__SyanMacro_Atom> for TypeApp

where __SyanMacro_Atom: Spanned + Clone, TypeAtom: Parse<__SyanMacro_Atom>, Vec<TypeAtom>: 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 TypeApp

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

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for TypeApp

impl<__SyanMacro_Atom> Unparse<__SyanMacro_Atom> for TypeApp

where TypeAtom: Unparse<__SyanMacro_Atom>, Vec<TypeAtom>: Unparse<__SyanMacro_Atom>,

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