pub struct Dataset { /* private fields */ }
Expand description
An in-memory RDF dataset.
It can accommodate a fairly large number of quads (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 dataset = Dataset::default();
// insertion
let ex = NamedNodeRef::new("http://example.com")?;
let quad = QuadRef::new(ex, ex, ex, ex);
dataset.insert(quad);
// simple filter
let results: Vec<_> = dataset.quads_for_subject(ex).collect();
assert_eq!(vec![quad], results);
// direct access to a dataset graph
let results: Vec<_> = dataset.graph(ex).iter().collect();
assert_eq!(vec![TripleRef::new(ex, ex, ex)], results);
Implementations§
source§impl Dataset
impl Dataset
sourcepub fn graph<'a, 'b>(
&'a self,
graph_name: impl Into<GraphNameRef<'b>>
) -> GraphView<'a>
pub fn graph<'a, 'b>( &'a self, graph_name: impl Into<GraphNameRef<'b>> ) -> GraphView<'a>
Provides a read-only view on an RDF graph contained in this dataset.
use oxrdf::*;
let mut dataset = Dataset::default();
let ex = NamedNodeRef::new("http://example.com")?;
dataset.insert(QuadRef::new(ex, ex, ex, ex));
let results: Vec<_> = dataset.graph(ex).iter().collect();
assert_eq!(vec![TripleRef::new(ex, ex, ex)], results);
sourcepub fn graph_mut<'a, 'b>(
&'a mut self,
graph_name: impl Into<GraphNameRef<'b>>
) -> GraphViewMut<'a>
pub fn graph_mut<'a, 'b>( &'a mut self, graph_name: impl Into<GraphNameRef<'b>> ) -> GraphViewMut<'a>
Provides a read/write view on an RDF graph contained in this dataset.
use oxrdf::*;
let mut dataset = Dataset::default();
let ex = NamedNodeRef::new("http://example.com")?;
// We edit and query the dataset http://example.com graph
{
let mut graph = dataset.graph_mut(ex);
graph.insert(TripleRef::new(ex, ex, ex));
let results: Vec<_> = graph.iter().collect();
assert_eq!(vec![TripleRef::new(ex, ex, ex)], results);
}
// We have also changes the dataset itself
let results: Vec<_> = dataset.iter().collect();
assert_eq!(vec![QuadRef::new(ex, ex, ex, ex)], results);
pub fn quads_for_subject<'a, 'b>( &'a self, subject: impl Into<SubjectRef<'b>> ) -> impl Iterator<Item = QuadRef<'a>> + 'a
pub fn quads_for_predicate<'a, 'b>( &'a self, predicate: impl Into<NamedNodeRef<'b>> ) -> impl Iterator<Item = QuadRef<'a>> + 'a
pub fn quads_for_object<'a, 'b>( &'a self, object: impl Into<TermRef<'b>> ) -> impl Iterator<Item = QuadRef<'a>> + 'a
sourcepub fn contains<'a>(&self, quad: impl Into<QuadRef<'a>>) -> bool
pub fn contains<'a>(&self, quad: impl Into<QuadRef<'a>>) -> bool
Checks if the dataset contains the given quad
sourcepub fn remove<'a>(&mut self, quad: impl Into<QuadRef<'a>>) -> bool
pub fn remove<'a>(&mut self, quad: impl Into<QuadRef<'a>>) -> bool
Removes a concrete quad from the dataset.
sourcepub fn canonicalize(&mut self)
pub fn canonicalize(&mut self)
Applies on the dataset 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 (Dataset isomorphism):
use oxrdf::*;
let iri = NamedNodeRef::new("http://example.com")?;
let mut graph1 = Graph::new();
let bnode1 = BlankNode::default();
let g1 = BlankNode::default();
graph1.insert(QuadRef::new(iri, iri, &bnode1, &g1));
graph1.insert(QuadRef::new(&bnode1, iri, iri, &g1));
let mut graph2 = Graph::new();
let bnode2 = BlankNode::default();
let g2 = BlankNode::default();
graph2.insert(QuadRef::new(iri, iri, &bnode2, &g2));
graph2.insert(QuadRef::new(&bnode2, iri, iri, &g2));
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 quad 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 dataset.
Trait Implementations§
source§impl Extend<Quad> for Dataset
impl Extend<Quad> for Dataset
source§fn extend<I: IntoIterator<Item = Quad>>(&mut self, iter: I)
fn extend<I: IntoIterator<Item = Quad>>(&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<'a, T: Into<QuadRef<'a>>> Extend<T> for Dataset
impl<'a, T: Into<QuadRef<'a>>> Extend<T> for Dataset
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
)