Struct Protocol 

pub struct Protocol {

    pub name: String,
    pub schema_theory: String,
    pub instance_theory: String,
    pub schema_composition: Option<CompositionSpec>,
    pub instance_composition: Option<CompositionSpec>,
    pub edge_rules: Vec<EdgeRule>,
    pub obj_kinds: Vec<String>,
    pub constraint_sorts: Vec<String>,
    pub has_order: bool,
    pub has_coproducts: bool,
    pub has_recursion: bool,
    pub has_causal: bool,
    pub nominal_identity: bool,
    pub has_defaults: bool,
    pub has_coercions: bool,
    pub has_mergers: bool,
    pub has_policies: bool,
}

Identifies the schema and instance theories for a data-format protocol, together with structural well-formedness rules.

Protocols are the Level-1 configuration objects that drive schema construction and validation. Each protocol names a schema theory GAT and an instance theory GAT (both defined in panproto-protocols), and supplies edge rules, recognized vertex kinds, and constraint sorts.

Fields

name: String

Human-readable protocol name (e.g., "atproto", "sql").

schema_theory: String

Name of the schema theory GAT in the theory registry.

instance_theory: String

Name of the instance theory GAT in the theory registry.

schema_composition: Option<CompositionSpec>

Composition recipe that produced the schema theory.

instance_composition: Option<CompositionSpec>

Composition recipe that produced the instance theory.

edge_rules: Vec<EdgeRule>

Well-formedness rules for each edge kind.

obj_kinds: Vec<String>

Vertex kinds that are considered “object-like” (containers).

constraint_sorts: Vec<String>

Recognized constraint sorts (e.g., "maxLength", "format").

has_order: bool

Whether this protocol uses ordered collections (ThOrder).

has_coproducts: bool

Whether this protocol has coproduct/union types (ThCoproduct).

has_recursion: bool

Whether this protocol supports recursive types (ThRecursion).

has_causal: bool

Whether this protocol has causal/temporal ordering (ThCausal).

nominal_identity: bool

Whether this protocol uses nominal identity (ThNominal).

has_defaults: bool

Whether this protocol supports default value expressions (ThValued).

has_coercions: bool

Whether this protocol supports type coercion expressions (ThCoercible).

has_mergers: bool

Whether this protocol supports merge/split expressions (ThMergeable).

has_policies: bool

Whether this protocol supports conflict resolution policies (ThPolicied).

Implementations

impl Protocol

pub fn find_edge_rule(&self, edge_kind: &str) -> Option<&EdgeRule>

Returns the EdgeRule for the given edge kind, if one exists.

pub fn is_known_vertex_kind(&self, kind: &str) -> bool

Returns true if kind is a recognized vertex kind in this protocol.

The set of recognized kinds is the union of all kinds mentioned in edge rules (both source and target) plus obj_kinds.

Trait Implementations

impl Clone for Protocol

fn clone(&self) -> Protocol

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Protocol

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

Formats the value using the given formatter.

impl Default for Protocol

fn default() -> Protocol

Returns the “default value” for a type.

impl<'de> Deserialize<'de> for Protocol

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

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl PartialEq for Protocol

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

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

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl Eq for Protocol

impl StructuralPartialEq for Protocol