Struct Schema 

pub struct Schema {

    pub protocol: String,
    pub vertices: HashMap<Name, Vertex>,
    pub edges: HashMap<Edge, Name>,
    pub hyper_edges: HashMap<Name, HyperEdge>,
    pub constraints: HashMap<Name, Vec<Constraint>>,
    pub required: HashMap<Name, Vec<Edge>>,
    pub nsids: HashMap<Name, Name>,
    pub entries: Vec<Name>,
    pub variants: HashMap<Name, Vec<Variant>>,
    pub orderings: HashMap<Edge, u32>,
    pub recursion_points: HashMap<Name, RecursionPoint>,
    pub spans: HashMap<Name, Span>,
    pub usage_modes: HashMap<Edge, UsageMode>,
    pub nominal: HashMap<Name, bool>,
    pub coercions: HashMap<(Name, Name), CoercionSpec>,
    pub mergers: HashMap<Name, Expr>,
    pub defaults: HashMap<Name, Expr>,
    pub policies: HashMap<Name, Expr>,
    pub outgoing: HashMap<Name, SmallVec<Edge, 4>>,
    pub incoming: HashMap<Name, SmallVec<Edge, 4>>,
    pub between: HashMap<(Name, Name), SmallVec<Edge, 2>>,
}

A schema: a model of the protocol’s schema theory.

Contains both the raw data (vertices, edges, constraints, etc.) and precomputed adjacency indices for efficient graph traversal.

Fields

protocol: String

The protocol this schema belongs to.

vertices: HashMap<Name, Vertex>

Vertices keyed by their ID.

edges: HashMap<Edge, Name>

Edges keyed by the edge itself, value is the edge kind.

hyper_edges: HashMap<Name, HyperEdge>

Hyper-edges keyed by their ID.

constraints: HashMap<Name, Vec<Constraint>>

Constraints per vertex ID.

required: HashMap<Name, Vec<Edge>>

Required edges per vertex ID.

nsids: HashMap<Name, Name>

NSID mapping: vertex ID to NSID string.

entries: Vec<Name>

Declared entry vertices.

Semantically, this is the finite family of basepoints that makes the schema a pointed schema: E → Ob(C_S) selecting the sorts at which the W-algebra of instances may be rooted. Parsers set this explicitly per their protocol’s notion of a top-level definition (a record, a top-level type, a path root, etc.); consumers that need to choose an instance root consult it via primary_entry.

Empty means the parser declined to supply a pointing; consumers should then either fall back to a deterministic (but non- canonical) selection or report an error. Order is preserved for reproducibility; the set carries no duplicates.

variants: HashMap<Name, Vec<Variant>>

Coproduct variants per union vertex ID.

orderings: HashMap<Edge, u32>

Edge ordering positions (edge → position index).

recursion_points: HashMap<Name, RecursionPoint>

Recursion points (fixpoint markers).

spans: HashMap<Name, Span>

Spans connecting pairs of vertices.

usage_modes: HashMap<Edge, UsageMode>

Edge usage modes (default: Structural for all).

nominal: HashMap<Name, bool>

Whether each vertex uses nominal identity (true) or structural identity (false). Absent = structural.

coercions: HashMap<(Name, Name), CoercionSpec>

Coercion specifications: (source_kind, target_kind) to coercion spec.

mergers: HashMap<Name, Expr>

Merger expressions: vertex_id to merger expression.

defaults: HashMap<Name, Expr>

Default value expressions: vertex_id to default expression.

policies: HashMap<Name, Expr>

Conflict resolution policy expressions: sort_name to policy expression.

outgoing: HashMap<Name, SmallVec<Edge, 4>>

Outgoing edges per vertex ID.

incoming: HashMap<Name, SmallVec<Edge, 4>>

Incoming edges per vertex ID.

between: HashMap<(Name, Name), SmallVec<Edge, 2>>

Edges between a specific (src, tgt) pair.

Implementations

impl Schema

pub fn forget_layout(&self) -> Self

Strip every constraint whose sort belongs to the layout enrichment fibre (per panproto_gat::is_layout_sort).

This is the schema-level forgetful U sending a decorated schema to its abstract base in the parse/decorate/emit lens. Idempotent.

pub fn forget_layout_in_place(&mut self)

In-place variant of Self::forget_layout.

pub fn is_layout_free(&self) -> bool

Returns true when no constraint sort belongs to the layout enrichment fibre. This is the well-formedness predicate for an AbstractSchema.

pub fn vertex(&self, id: &str) -> Option<&Vertex>

Look up a vertex by ID.

pub fn outgoing_edges(&self, vertex_id: &str) -> &[Edge]

Return all outgoing edges from the given vertex.

pub fn incoming_edges(&self, vertex_id: &str) -> &[Edge]

Return all incoming edges to the given vertex.

pub fn edges_between(&self, src: &str, tgt: &str) -> &[Edge]

Return edges between a specific (src, tgt) pair.

pub fn has_vertex(&self, id: &str) -> bool

Returns true if the given vertex ID exists in this schema.

pub fn vertex_count(&self) -> usize

Returns the number of vertices in the schema.

pub fn edge_count(&self) -> usize

Returns the number of edges in the schema.

pub fn entry_vertices(&self) -> &[Name]

Return the declared entry vertices.

See Schema::entries for semantics. Use primary_entry for callers that need a single root and want a deterministic fallback when no entries are declared.

pub fn constraints_for(&self, vertex_id: &str) -> &[Constraint]

Return every constraint attached to the given vertex.

Tree-sitter-derived schemas attach byte ranges, interstitials, formatting, and field:<name> entries here.

pub fn field_text(&self, vertex_id: &str, field_name: &str) -> Option<&str>

Return the text value of a tree-sitter field('<name>', ...) anonymous-token child on the given vertex, if any.

Tree-sitter rules of the form field('op', choice('+', '-', '*', '/')) attach a field name to an unnamed token alternative. The walker emits the token’s text as a field:<name> constraint on the parent vertex; this is the supported accessor for that text.

Returns None if no field:<name> constraint exists on vertex_id. Named-node field children continue to surface as edges (use outgoing_edges and filter by Edge::kind for those).

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 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.