Struct InternedGraph 

pub struct InternedGraph { /* private fields */ }

Term dictionary + triple store backed by interned u32 IDs.

Implementations

impl InternedGraph

pub fn new() -> Self

Create an empty graph.

pub fn intern(&mut self, term: &str) -> u32

Intern term: return existing ID if present, otherwise allocate a new one.

pub fn intern_or_none(&self, term: &str) -> Option<u32>

Intern without inserting. Returns None when the term is unknown.

pub fn term(&self, id: u32) -> Option<&str>

Resolve an ID back to the original term string.

pub fn add_triple(&mut self, s: &str, p: &str, o: &str)

Add a triple, interning each component as needed.

pub fn predicate_pairs(&self, pred_id: u32) -> &[(u32, u32)]

Return all (subject_id, object_id) pairs for the given predicate ID. Returns an empty slice when the predicate has no triples.

pub fn num_entities(&self) -> usize

Number of distinct terms in the dictionary.

pub fn num_triples(&self) -> usize

Total number of triples stored.

pub fn from_rdf_triples(triples: Vec<RdfTriple>) -> Self

Build an InternedGraph from a collection of RdfTriples.

Uses parallel term-collection when triples.len() <= PARALLEL_THRESHOLD, single-threaded otherwise.

pub fn into_quad_store(&self) -> QuadStore

Emit a QuadStore (default graph only) containing all stored triples.

Trait Implementations

impl Default for InternedGraph

fn default() -> Self

Returns the “default value” for a type.