Struct ConcurrentGraph 

pub struct ConcurrentGraph { /* private fields */ }

A concurrent, lock-free graph implementation

Implementations

impl ConcurrentGraph

pub fn new() -> Self

Create a new concurrent graph

pub fn insert(&self, triple: Triple) -> Result<bool, OxirsError>

Insert a triple into the graph (lock-free)

pub fn remove(&self, triple: &Triple) -> Result<bool, OxirsError>

Remove a triple from the graph (lock-free)

pub fn contains(&self, triple: &Triple) -> bool

Check if a triple exists (wait-free)

pub fn len(&self) -> usize

Get the number of triples (wait-free)

pub fn is_empty(&self) -> bool

Check if the graph is empty (wait-free)

pub fn iter(&self) -> impl Iterator<Item = Triple> + '_

Iterate over all triples (wait-free snapshot)

pub fn match_pattern( &self, subject: Option<&Subject>, predicate: Option<&Predicate>, object: Option<&Object>, ) -> Vec<Triple>

Find triples matching a pattern (wait-free)

pub fn stats(&self) -> GraphStats

Get statistics about the graph

pub fn collect(&self)

Force memory reclamation

impl ConcurrentGraph

Batch operations for improved performance

pub fn insert_batch(&self, triples: Vec<Triple>) -> Result<usize, OxirsError>

Insert multiple triples in a batch

For small batches (<100), uses sequential insertion. For large batches, uses parallel insertion with concurrent index updates.

pub fn remove_batch(&self, triples: &[Triple]) -> Result<usize, OxirsError>

Remove multiple triples in a batch

For small batches (<100), uses sequential removal. For large batches, uses parallel removal with concurrent index updates.

pub fn rebuild_indices(&self) -> Result<(), OxirsError>

Rebuild all indices from scratch (useful for optimization after many operations)

This operation is expensive but can improve query performance by defragmenting the index structures and removing empty entries.

pub fn clear(&self) -> Result<(), OxirsError>

Clear all triples from the graph

Trait Implementations

impl Default for ConcurrentGraph

fn default() -> Self

Returns the “default value” for a type.