Struct Schema 

pub struct Schema {
    pub name: String,
    pub generics: Vec<String>,
    pub fields: Vec<Field>,
    pub is_tuple: bool,
}

Canonical schema description. Field order is preserved exactly as declared; see the module docs for the rationale.

Fields

name: String

Schema name. Anonymous schemas declared inline carry an empty string so the canonical form remains deterministic even when hosts forget to pass a name through.

generics: Vec<String>

Generic type parameters (e.g. ["T"] for Page<T>). Empty for monomorphic schemas.

fields: Vec<Field>

Fields in declaration order. Reordering invalidates the hash even when each field’s name + type are otherwise identical, because the binary layout’s field offsets are declaration-order dependent.

is_tuple: bool

Wave T2: marks an anonymous positional record synthesised for a Tuple<...>. The binary layout, buffer builder, verifier and codegen treat such a schema exactly like any other record (its fields carry the synthetic positional names "0", "1", …), so the whole record/return ABI is reused unchanged. The only behavioural fork is the host decode: a tuple schema decodes to a positional Value::Tuple, which JSON projection later emits as an array, rather than to a branded object.

Serialised only when true, so every pre-T2 (non-tuple) schema’s canonical bytes — and therefore its ABI hash — stay unchanged.

Implementations

impl Schema

pub fn new(name: impl Into<String>) -> Self

Build an empty schema with the given name. Convenience ctor used by tests and by future codegen-side conversions.

pub fn tuple(name: impl Into<String>, elements: Vec<TypeRepr>) -> Self

Wave T2: build an anonymous positional-record schema for a Tuple<...> from its element types in order. Field names are the synthetic decimal indices "0", "1", … so the existing declaration-order layout pass assigns one slot per element; the is_tuple flag drives positional Value::Tuple host decode.

Trait Implementations

impl Clone for Schema

fn clone(&self) -> Schema

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Schema

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for Schema

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Eq for Schema

impl PartialEq for Schema

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

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl StructuralPartialEq for Schema