Struct DatasetGraph

pub struct DatasetGraph<D: Dataset, G: Term> { /* private fields */ }

I wrap a Dataset as a Graph corresponding to a specific graph (default or named) of the wrapped dataset.

This graph is also mutable if the underlying dataset is.

NB: this type is design to be the return type of Dataset::graph and Dataset::graph_mut. It is not designed to be usable “from scratch”.

Implementations

impl<D: Dataset, G: Term> DatasetGraph<D, G>

pub fn new(d: D, g: GraphName<G>) -> Self

Wrap the given dataset as a single Graph (selected via the given graph name).

pub fn unwrap(self) -> (D, GraphName<G>)

Unwrap the inner GraphName and Dataset.

Trait Implementations

impl<D: Clone + Dataset, G: Clone + Term> Clone for DatasetGraph<D, G>

fn clone(&self) -> DatasetGraph<D, G>

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<D: Debug + Dataset, G: Debug + Term> Debug for DatasetGraph<D, G>

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

Formats the value using the given formatter.

impl<D: Dataset, G: Term> Graph for DatasetGraph<D, G>

type Triple<'x> = [<<D as Dataset>::Quad<'x> as Quad>::Term; 3] where Self: 'x

Determine the type of Triples that the methods of this graph will yield.

type Error = <D as Dataset>::Error

The error type that this graph may raise.

fn triples(&self) -> GTripleSource<'_, Self>

An iterator visiting all triples of this graph in arbitrary order.

fn triples_matching<'s, S, P, O>( &'s self, sm: S, pm: P, om: O, ) -> GTripleSource<'s, Self>

where S: TermMatcher + 's, P: TermMatcher + 's, O: TermMatcher + 's,

An iterator visiting all triples matching the given subject, predicate and object. See crate::term::matcher.

fn contains<TS, TP, TO>(&self, s: TS, p: TP, o: TO) -> GResult<Self, bool>

where TS: Term, TP: Term, TO: Term,

Return true if this graph contains the given triple.

fn subjects(&self) -> GTermSource<'_, Self>

Build a fallible iterator of all the terms used as subject in this Graph.

fn predicates(&self) -> GTermSource<'_, Self>

Build a fallible iterator of all the terms used as predicate in this Graph.

fn objects(&self) -> GTermSource<'_, Self>

Build a fallible iterator of all the terms used as object in this Graph.

fn iris(&self) -> GTermSource<'_, Self>

Build a fallible iterator of all the IRIs used in this Graph (including those used inside quoted triples, if any).

fn blank_nodes(&self) -> GTermSource<'_, Self>

Build a fallible iterator of all the blank nodes used in this Graph (including those used inside quoted triples, if any).

fn literals(&self) -> GTermSource<'_, Self>

Build a fallible iterator of all the literals used in this Graph (including those used inside quoted triples, if any).

fn quoted_triples<'s>(&'s self) -> GTermSource<'s, Self>

where GTerm<'s, Self>: Clone,

Build a fallible iterator of all the quoted triples used in this Graph (including those used inside quoted triples, if any).

fn variables(&self) -> GTermSource<'_, Self>

Build a fallible iterator of all the variables used in this Graph (including those used inside quoted triples, if any).

fn as_dataset(&self) -> GraphAsDataset<&Self>

Dataset adapter borrowing this graph

fn as_dataset_mut(&mut self) -> GraphAsDataset<&mut Self>

Dataset adapter borrowing this graph mutably

fn into_dataset(self) -> GraphAsDataset<Self>

where Self: Sized,

Dataset adapter taking ownership of this graph

impl<D: MutableDataset, G: Term> MutableGraph for DatasetGraph<D, G>

type MutationError = <D as MutableDataset>::MutationError

The error type that this graph may raise during mutations.

fn insert<TS, TP, TO>(&mut self, s: TS, p: TP, o: TO) -> MgResult<Self, bool>

where TS: Term, TP: Term, TO: Term,

Insert in this graph a triple made of the the given terms.

fn remove<TS, TP, TO>(&mut self, s: TS, p: TP, o: TO) -> MgResult<Self, bool>

where TS: Term, TP: Term, TO: Term,

Remove from this graph the triple made of the the given terms.

fn insert_triple<T>(&mut self, triple: T) -> MgResult<Self, bool>

where T: Triple,

Insert in this graph the given triple.

fn remove_triple<T>(&mut self, triple: T) -> MgResult<Self, bool>

where T: Triple,

Remoe from this graph the given triple.

fn insert_all<TS: TripleSource>( &mut self, src: TS, ) -> StreamResult<usize, TS::Error, <Self as MutableGraph>::MutationError>

Insert into this graph all triples from the given source.

fn remove_all<TS: TripleSource>( &mut self, src: TS, ) -> StreamResult<usize, TS::Error, <Self as MutableGraph>::MutationError>

Remove from this graph all triples from the given source.

fn remove_matching<S, P, O>( &mut self, ms: S, mp: P, mo: O, ) -> Result<usize, Self::MutationError>

where S: TermMatcher, P: TermMatcher, O: TermMatcher, Self::MutationError: From<Self::Error>,

Remove all triples matching the given matchers.

fn retain_matching<S, P, O>( &mut self, ms: S, mp: P, mo: O, ) -> Result<(), Self::MutationError>

where S: TermMatcher, P: TermMatcher, O: TermMatcher, Self::MutationError: From<Self::Error>,

Keep only the triples matching the given matchers.

impl<D: Copy + Dataset, G: Copy + Term> Copy for DatasetGraph<D, G>

impl<D: SetDataset, G: Term> SetGraph for DatasetGraph<D, G>