Struct Archive 

pub struct Archive {
    pub nodes: Vec<Definition>,
    pub connections: Vec<Connection>,
}

A .prx archive: the nodes and connections of one serialized ontology.

Fields

nodes: Vec<Definition>

The node definitions (concepts, axioms, lenses, …).

connections: Vec<Connection>

The connections (morphisms) — functors / adjunctions / lenses / nat-trans.

Implementations

impl Archive

pub fn new() -> Self

An empty archive.

pub fn root(&self) -> Result<ContentAddress, CodecError>

The Merkle root — the content address over the sorted, deduplicated set of every node’s and connection’s definition-bearing address.

impl Archive

pub fn recursive_addresses( &self, ) -> Result<BTreeMap<String, ContentAddress>, RecursiveAddressError>

The recursive (transitive) content address of every node, keyed by name — each address fixes the node’s reachable definition, cycle-safe. See the module doc. Edge kinds resolve against the default_kind_vocab (the meta kind floor). Err on a dangling local edge or an unlabeled automorphic cycle (fail-closed).

pub fn recursive_addresses_grounded( &self, vocab: &KindVocab, ) -> Result<BTreeMap<String, ContentAddress>, RecursiveAddressError>

As recursive_addresses, but resolving edge kinds against an EXPLICIT KindVocab. Two peers agree on a concept’s MEANING (not just spelling) by recomputing with the SAME vocab; a vocab in which a kind’s properties differ yields a different address (A3).

pub fn recursive_root(&self) -> Result<ContentAddress, RecursiveAddressError>

The recursive Merkle root — the content address over the sorted set of every node’s RECURSIVE address. The transitive-identity analogue of root; additive, leaves root untouched. Kinds resolve against the default_kind_vocab.

pub fn recursive_root_grounded( &self, vocab: &KindVocab, ) -> Result<ContentAddress, RecursiveAddressError>

As recursive_root, but resolving edge kinds against an explicit KindVocab.

pub fn extract_concept( &self, name: &str, ) -> Result<Archive, RecursiveAddressError>

The minimal sub-archive carrying name and its transitive LOCAL closure (every node reachable by Local edges) PLUS the ontology’s connections — the teach-a-peer payload. A peer that loads it (1) recomputes name’s recursive address to the SAME value as in this archive — because a recursive address depends only on this closure plus the Grounded leaves (whose foreign roots the peer must already hold; a Grounded edge is kept verbatim as a foreign-atom address) — and (2) holds the functors needed to INTERPRET (rebind via apply) the concept, not merely identify it.

The connections ride whole: a functor is ontology-level (it maps generic KINDS, e.g. Synset → Concept), so it is the interpretation machinery for every concept of the ontology, not one concept’s. Err if name is absent or a local edge dangles.

Trait Implementations

impl Clone for Archive

fn clone(&self) -> Archive

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Archive

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

Formats the value using the given formatter.

impl Default for Archive

fn default() -> Archive

Returns the “default value” for a type.

impl<'de> Deserialize<'de> for Archive

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

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Eq for Archive

impl PartialEq for Archive

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

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 Archive