pub struct Graph { /* private fields */ }
Expand description
An in-memory RDF graph.
It can accommodate a fairly large number of triples (in the few millions). Beware: it interns the string and does not do any garbage collection yet: if you insert and remove a lot of different terms, memory will grow without any reduction.
Usage example:
use oxrdf::*;
let mut graph = Graph::default();
// insertion
let ex = NamedNodeRef::new("http://example.com")?;
let triple = TripleRef::new(ex, ex, ex);
graph.insert(triple);
// simple filter
let results: Vec<_> = graph.triples_for_subject(ex).collect();
assert_eq!(vec![triple], results);
Implementations§
source§impl Graph
impl Graph
pub fn triples_for_subject<'a, 'b>( &'a self, subject: impl Into<SubjectRef<'b>> ) -> impl Iterator<Item = TripleRef<'a>> + 'a
pub fn objects_for_subject_predicate<'a, 'b>( &'a self, subject: impl Into<SubjectRef<'b>>, predicate: impl Into<NamedNodeRef<'b>> ) -> impl Iterator<Item = TermRef<'a>> + 'a
pub fn object_for_subject_predicate<'a, 'b>( &'a self, subject: impl Into<SubjectRef<'b>>, predicate: impl Into<NamedNodeRef<'b>> ) -> Option<TermRef<'a>>
pub fn predicates_for_subject_object<'a, 'b>( &'a self, subject: impl Into<SubjectRef<'b>>, object: impl Into<TermRef<'b>> ) -> impl Iterator<Item = NamedNodeRef<'a>> + 'a
pub fn triples_for_predicate<'a, 'b>( &'a self, predicate: impl Into<NamedNodeRef<'b>> ) -> impl Iterator<Item = TripleRef<'a>> + 'a
pub fn subjects_for_predicate_object<'a, 'b>( &'a self, predicate: impl Into<NamedNodeRef<'b>>, object: impl Into<TermRef<'b>> ) -> impl Iterator<Item = SubjectRef<'a>> + 'a
pub fn subject_for_predicate_object<'a, 'b>( &'a self, predicate: impl Into<NamedNodeRef<'b>>, object: impl Into<TermRef<'b>> ) -> Option<SubjectRef<'a>>
pub fn triples_for_object<'a, 'b>( &'a self, object: impl Into<TermRef<'b>> ) -> impl Iterator<Item = TripleRef<'a>> + 'a
sourcepub fn contains<'a>(&self, triple: impl Into<TripleRef<'a>>) -> bool
pub fn contains<'a>(&self, triple: impl Into<TripleRef<'a>>) -> bool
Checks if the graph contains the given triple.
sourcepub fn insert<'a>(&mut self, triple: impl Into<TripleRef<'a>>) -> bool
pub fn insert<'a>(&mut self, triple: impl Into<TripleRef<'a>>) -> bool
Adds a triple to the graph.
sourcepub fn remove<'a>(&mut self, triple: impl Into<TripleRef<'a>>) -> bool
pub fn remove<'a>(&mut self, triple: impl Into<TripleRef<'a>>) -> bool
Removes a concrete triple from the graph.
sourcepub fn canonicalize(&mut self)
pub fn canonicalize(&mut self)
Applies on the graph the canonicalization process described in Canonical Forms for Isomorphic and Equivalent RDF Graphs: Algorithms for Leaning and Labelling Blank Nodes, Aidan Hogan, 2017.
Usage example (Graph isomorphism):
use oxrdf::*;
let iri = NamedNodeRef::new("http://example.com")?;
let mut graph1 = Graph::new();
let bnode1 = BlankNode::default();
graph1.insert(TripleRef::new(iri, iri, &bnode1));
graph1.insert(TripleRef::new(&bnode1, iri, iri));
let mut graph2 = Graph::new();
let bnode2 = BlankNode::default();
graph2.insert(TripleRef::new(iri, iri, &bnode2));
graph2.insert(TripleRef::new(&bnode2, iri, iri));
assert_ne!(graph1, graph2);
graph1.canonicalize();
graph2.canonicalize();
assert_eq!(graph1, graph2);
Warning 1: Blank node ids depends on the current shape of the graph. Adding a new triple might change the ids of a lot of blank nodes. Hence, this canonization might not be suitable for diffs.
Warning 2: The canonicalization algorithm is not stable and canonical blank node Ids might change between Oxigraph version.
Warning 3: This implementation worst-case complexity is in O(b!) with b the number of blank nodes in the input graph.
Trait Implementations§
source§impl<'a, T: Into<TripleRef<'a>>> Extend<T> for Graph
impl<'a, T: Into<TripleRef<'a>>> Extend<T> for Graph
source§fn extend<I: IntoIterator<Item = T>>(&mut self, iter: I)
fn extend<I: IntoIterator<Item = T>>(&mut self, iter: I)
source§fn extend_one(&mut self, item: A)
fn extend_one(&mut self, item: A)
extend_one
)source§fn extend_reserve(&mut self, additional: usize)
fn extend_reserve(&mut self, additional: usize)
extend_one
)source§impl Extend<Triple> for Graph
impl Extend<Triple> for Graph
source§fn extend<I: IntoIterator<Item = Triple>>(&mut self, iter: I)
fn extend<I: IntoIterator<Item = Triple>>(&mut self, iter: I)
source§fn extend_one(&mut self, item: A)
fn extend_one(&mut self, item: A)
extend_one
)source§fn extend_reserve(&mut self, additional: usize)
fn extend_reserve(&mut self, additional: usize)
extend_one
)