Struct IndexedGraph 

pub struct IndexedGraph { /* private fields */ }

Multi-indexed graph with term interning

Implementations

impl IndexedGraph

pub fn new() -> Self

Create a new indexed graph

pub fn with_interner(interner: Arc<TermInterner>) -> Self

Create a new indexed graph with a custom interner

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

Insert a triple into the graph

pub fn batch_insert(&self, triples: &[Triple]) -> Vec<bool>

Batch insert multiple triples for better performance

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

Remove a triple from the graph

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

Query triples matching a pattern using the most efficient index

pub fn len(&self) -> usize

Get the number of triples in the graph

pub fn is_empty(&self) -> bool

Check if the graph is empty

pub fn memory_usage(&self) -> MemoryUsage

Get memory usage statistics

pub fn index_stats(&self) -> IndexStats

Get index statistics

pub fn clear(&self)

Clear all data from the graph

pub fn interner(&self) -> &Arc<TermInterner>

Get a reference to the term interner

pub fn par_insert_batch(&self, triples: Vec<Triple>) -> Vec<bool>

Parallel insert of multiple triples using rayon

pub fn par_remove_batch(&self, triples: &[Triple]) -> Vec<bool>

Parallel remove of multiple triples

pub fn par_query_batch( &self, patterns: Vec<(Option<Subject>, Option<Predicate>, Option<Object>)>, ) -> Vec<Vec<Triple>>

Parallel query with multiple patterns

pub fn par_transform<F>(&self, transform: F) -> Vec<Triple>

where F: Fn(&Triple) -> Option<Triple> + Send + Sync,

Apply a transformation to all triples in parallel

pub fn par_map<F, R>(&self, mapper: F) -> Vec<R>

where F: Fn(&Triple) -> R + Send + Sync, R: Send,

Parallel map over all triples

pub fn par_filter<F>(&self, predicate: F) -> Vec<Triple>

where F: Fn(&Triple) -> bool + Send + Sync,

Parallel filter triples

pub fn par_fold<F, R>(&self, init: R, fold_fn: F) -> R

where F: Fn(R, &Triple) -> R + Send + Sync, R: Send + Sync + Clone + 'static + Add<Output = R>,

Parallel fold operation

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

Iterator over all triples in the graph

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

Match a pattern and return matching triples

Trait Implementations

impl Debug for IndexedGraph

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

Formats the value using the given formatter.

impl Default for IndexedGraph

fn default() -> Self

Returns the “default value” for a type.