Struct MemoryRegistry 

pub struct MemoryRegistry { /* private fields */ }

Thread-safe in-memory schema registry.

Implementations

impl MemoryRegistry

pub fn new() -> Self

pub fn add(&self, schema: Schema) -> Result<(), RegistryError>

Add a schema to the registry.

pub fn load_directory(&self, dir: &Path) -> Result<usize, RegistryError>

Load all .csdl files from a directory recursively.

Each file may contain multiple schema documents (separated by ---). Returns the total number of schema versions loaded.

pub fn load_file(&self, path: &Path) -> Result<usize, RegistryError>

Load a single CSDL file.

If the file contains multiple schemas (separated by ---), all are added to the registry. Returns the count of schemas loaded.

pub fn insert(&self, schema: Schema) -> Result<(), RegistryError>

Alias for add() — adds a schema to the registry.

pub fn len(&self) -> usize

Returns the total number of schema versions stored.

pub fn is_empty(&self) -> bool

pub fn all_names(&self) -> Vec<String>

Returns all schema names (deduplicated, one entry per name regardless of versions).

pub fn all_schemas(&self) -> Vec<Schema>

Returns all schemas (latest non-deprecated version of each).

Trait Implementations

impl Clone for MemoryRegistry

fn clone(&self) -> MemoryRegistry

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Default for MemoryRegistry

fn default() -> Self

Returns the “default value” for a type.

impl SchemaRegistry for MemoryRegistry

fn get_by_fingerprint(&self, fp: &EventFingerprint) -> Option<Schema>

Look up a schema by its fingerprint.

fn get_by_name(&self, name: &str, version: Option<u32>) -> Option<Schema>

Look up a schema by name and optional version. If version is None, returns the latest non-deprecated version.

fn list_for_chain(&self, chain_slug: &str) -> Vec<Schema>

Returns all schemas applicable to the given chain slug.

fn history(&self, name: &str) -> Vec<Schema>

Returns the full evolution chain for a schema: from oldest to newest.