Struct SchemaGraph 

pub struct SchemaGraph {
    pub defs: Vec<SchemaTypeDef>,
    pub root: SchemaType,
}

A self-contained schema graph in the recursive in-memory form.

Anywhere a schema travels with a value (typed pair, oplog custom payload, REST/RPC envelope, public oplog rendering), the payload owns its own SchemaGraph — there is no implicit external registry that consumers must look up.

Recursive references between types go through SchemaType::Ref, pointing at named definitions in SchemaGraph::defs.

Single-root vs multi-root carriers

The common case is single-root: one SchemaGraph describes one payload, with root as the entry type and defs as the named-type registry reachable from it.

Multi-root carriers (today, agent-layer carriers such as [crate::schema::agent::AgentTypeSchema] and [crate::schema::agent::AgentDependencySchema]) use the same shape purely as a definition registry: many roots embedded elsewhere in the carrier reference shared types in defs, and the SchemaGraph::root field is a sentinel (see SchemaGraph::empty). Such carriers must not be passed to root-oriented walkers/renderers as if root were the payload root.

Fields

defs: Vec<SchemaTypeDef>

Named type definitions in this graph. The defining set is exactly the types reachable from root (directly or transitively) that need to be named — typically because they participate in a recursive cycle or are referenced multiple times.

root: SchemaType

Root schema type. Anonymous types appear inline; named types appear as SchemaType::Ref.

Implementations

impl SchemaGraph

pub fn anonymous(root: SchemaType) -> SchemaGraph

Convenience: an anonymous root schema with no named definitions.

pub fn empty() -> SchemaGraph

Convenience: an empty graph with no definitions and a sentinel root.

Used as the initial value for multi-root carriers such as [crate::schema::agent::AgentTypeSchema] and [crate::schema::agent::AgentDependencySchema], where the agent’s constructor and methods each act as their own root and only the defs registry is consulted. The root field is a placeholder (empty record) and is not consumed by agent-layer helpers.

pub fn lookup(&self, id: &TypeId) -> Option<&SchemaTypeDef>

Look up a named definition by its TypeId.

pub fn contains_stream_type(&self) -> bool

Whether any type reachable from the root is a stream, including unselected alternatives.

pub fn resolve_ref<'a>( &'a self, ty: &'a SchemaType, ) -> Result<&'a SchemaType, RefResolutionError>

Walk through any number of SchemaType::Ref indirections and return the first non-ref body in this graph. Detects recursive cycles (RefResolutionError::RecursiveRef) and dangling references (RefResolutionError::DanglingRef).

Trait Implementations

impl Clone for SchemaGraph

fn clone(&self) -> SchemaGraph

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for SchemaGraph

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for SchemaGraph

fn deserialize<__D>( __deserializer: __D, ) -> Result<SchemaGraph, <__D as Deserializer<'de>>::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Eq for SchemaGraph

impl FromSchema for SchemaGraph

fn from_value(value: &SchemaValue) -> Result<SchemaGraph, FromSchemaError>

impl IntoSchema for SchemaGraph

fn type_id() -> TypeId

fn register_in(builder: &mut SchemaBuilder) -> SchemaType

fn to_value(&self) -> SchemaValue

impl PartialEq for SchemaGraph

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

Equality operator ==.

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

Inequality operator !=.

impl Serialize for SchemaGraph

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

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl StructuralPartialEq for SchemaGraph