Struct StoreRegistry 

pub struct StoreRegistry { /* private fields */ }

StoreRegistry

StoreRegistry owns the generated mapping from schema Store paths to their row, index, and schema store handles. It validates registration invariants once at generated wiring time and then serves cheap immutable lookups during runtime operations.

Implementations

impl StoreRegistry

pub fn new() -> Self

Create an empty store registry.

pub fn iter(&self) -> impl Iterator<Item = (&'static str, StoreHandle)>

Iterate registered stores.

Iteration order follows registration order. Semantic result ordering must still not depend on this iteration order; callers that need deterministic ordering must sort by store path.

pub fn register_store( &mut self, name: &'static str, data: &'static LocalKey<RefCell<DataStore>>, index: &'static LocalKey<RefCell<IndexStore>>, schema: &'static LocalKey<RefCell<SchemaStore>>, allocations: StoreAllocationIdentities, capabilities: StoreRuntimeStorageCapabilities, ) -> Result<(), InternalError>

Register a Store path to its row/index/schema store triplet with an explicit allocation identity decision.

Heap stores must pass StoreAllocationIdentities::absent explicitly because allocation identities are intentionally unavailable.

pub fn register_journaled_store( &mut self, name: &'static str, data: &'static LocalKey<RefCell<DataStore>>, index: &'static LocalKey<RefCell<IndexStore>>, schema: &'static LocalKey<RefCell<SchemaStore>>, journal: &'static LocalKey<RefCell<JournalTailStore>>, allocations: StoreAllocationIdentities, capabilities: StoreRuntimeStorageCapabilities, ) -> Result<(), InternalError>

Register one journaled store with its journal-tail storage handle.

pub fn try_get_store(&self, path: &str) -> Result<StoreHandle, InternalError>

Look up a store handle by path.

Trait Implementations

impl Default for StoreRegistry

fn default() -> StoreRegistry

Returns the “default value” for a type.