Struct Store 

pub struct Store { /* private fields */ }

The graph store. Three maps: nodes, outgoing edges, incoming edges.

Clone backs the atomic-batch rollback: batch_update snapshots the store before preparing items so a refused batch can restore the pre-call graph wholesale.

Implementations

impl Store

pub fn new() -> Store

pub fn upsert(&mut self, id: EntityId, entity: Entity)

Insert or update a node. If the node already exists, replace it.

pub fn remove(&mut self, id: &EntityId) -> Option<Entity>

Remove a node and cascade-delete all its edges.

pub fn get(&self, id: &EntityId) -> Option<&Entity>

pub fn get_mut(&mut self, id: &EntityId) -> Option<&mut Entity>

pub fn contains(&self, id: &EntityId) -> bool

pub fn all_ids(&self) -> impl Iterator<Item = &EntityId>

pub fn all_entities(&self) -> impl Iterator<Item = &Entity>

pub fn remove_entities_by_mem(&mut self, mem: &str) -> usize

Drop every entity whose EntityId::mem() matches mem, cascading edges via the existing Store::remove mechanism. Returns the number of entities removed (excluding edge-only cascades — same accounting as remove).

Used by [Engine::reload_one_mem] to clear one mem’s slice of the store before reloading entities from the on-disk branch tip. Pure-iteration implementation: walks all_ids(), filters by mem, then calls remove on each. The 132-entity workspace today reloads the whole store in <1 s so the per-mem filtered case is microseconds; if the workspace ever grows past 10k entities the loop can switch to a mem-keyed bucket on Store without changing this signature.

pub fn len(&self) -> usize

pub fn is_empty(&self) -> bool

pub fn add_edge(&mut self, from: EntityId, edge: Edge)

Add an edge. Idempotent: if (from, to, type) exists, update source; else append. Stores in both out_edges and in_edges for bidirectional traversal.

pub fn remove_edge(&mut self, from: &EntityId, to: &EntityId, rel_type: &str)

Remove a specific edge by (from, to, type).

pub fn remove_edges_from(&mut self, id: &EntityId)

Remove all outgoing edges from a node (and their mirrors).

pub fn outgoing(&self, id: &EntityId) -> &[Edge]

Get all outgoing edges for a node.

pub fn incoming(&self, id: &EntityId) -> &[InEdge]

Get all incoming edges for a node.

pub fn rename_node(&mut self, old_id: &EntityId, new_id: EntityId) -> bool

Rename a node. Updates all edge references.

pub fn edge_count(&self) -> usize

Total edge count (outgoing edges only, since in_edges are mirrors).

pub fn clear(&mut self)

Clear all nodes and edges.

Trait Implementations

impl Clone for Store

fn clone(&self) -> Store

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Store

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

Formats the value using the given formatter.

impl Default for Store

fn default() -> Store

Returns the “default value” for a type.