Struct CrossRefStore 

pub struct CrossRefStore { /* private fields */ }

Concurrent forward/reverse index of CrossRef edges.

Implementations

impl CrossRefStore

pub fn new() -> Self

Create an empty store.

pub fn insert(&self, crossref: CrossRef)

Insert a cross-reference, indexing it in both directions.

pub fn get_forward(&self, id: &UniversalNodeId) -> Vec<CrossRef>

All cross-refs originating from id.

pub fn get_reverse(&self, id: &UniversalNodeId) -> Vec<CrossRef>

All cross-refs pointing to id.

pub fn get_all(&self, id: &UniversalNodeId) -> Vec<CrossRef>

All cross-refs where id appears as source or target.

pub fn count(&self) -> u64

Total number of cross-refs inserted.

pub fn by_type( &self, id: &UniversalNodeId, ref_type: &CrossRefType, ) -> Vec<CrossRef>

Filter cross-refs involving id (either direction) by relationship type.

pub fn all(&self) -> Vec<CrossRef>

Every cross-ref in the store, each yielded exactly once.

The forward index holds one copy of each cross-ref under its source key (the reverse index is the mirror), so flattening the forward map enumerates the store without duplication. Ordering is unspecified (DashMap iteration order). Intended for whole-store projections such as the conversation.graph RPC, which scopes the result to a conversation by intersecting each cross-ref’s endpoints against that conversation’s node UID set (there is no conv_id on a CrossRef to filter by directly).

pub fn clear(&self)

Remove all entries (useful for calibration resets).

Trait Implementations

impl Default for CrossRefStore

fn default() -> Self

Returns the “default value” for a type.