Struct AssociationStore 

pub struct AssociationStore { /* private fields */ }

Manages cross-galaxy associations in the Associations galaxy.

Implementations

impl AssociationStore

pub fn open(env: &Environment) -> Result<Self>

Open the association store from an LMDB environment.

pub fn put(&self, env: &Environment, assoc: &Association) -> Result<()>

Create or update an association.

pub fn get( &self, env: &Environment, source: Uuid, target: Uuid, ) -> Result<Option<Association>>

Get an association between two specific memories.

pub fn delete( &self, env: &Environment, source: Uuid, target: Uuid, ) -> Result<bool>

Delete an association.

pub fn find_from( &self, env: &Environment, source: Uuid, ) -> Result<Vec<Association>>

Find all associations where the given UUID is the source.

pub fn find_to( &self, env: &Environment, target: Uuid, ) -> Result<Vec<Association>>

Find all associations where the given UUID is the target.

pub fn traverse_cross_galaxy( &self, env: &Environment, store: &MemoryStore, seed_id: Uuid, min_weight: f32, ) -> Result<Vec<(Association, Galaxy, Memory)>>

Traverse cross-galaxy associations starting from a seed memory ID (S9 traversal).

Walks association edges (outgoing and incoming) with weight >= min_weight, resolving each neighbor across galaxies via store.find_across_galaxies().

pub fn count(&self, env: &Environment) -> Result<usize>

Count all associations.

pub fn find_cycles(&self, env: &Environment) -> Result<Vec<(Uuid, Uuid)>>

Find all direct circular associations (A→B and B→A both exist).

Circular links can artificially inflate importance in retention calculations. This method scans all associations and returns pairs of UUIDs where both directions exist, allowing the retention engine to avoid double-counting.