Struct DatasetGraph 

pub struct DatasetGraph<D, G>
where
    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 MutableDataset::graph_mut. It is not designed to be usable “from scratch”.

Implementations

impl<D, G> DatasetGraph<D, G>

where D: Dataset, G: Term,

pub fn new(d: D, g: Option<G>) -> DatasetGraph<D, G>

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

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

Unwrap the inner GraphName and Dataset.

Trait Implementations

impl<D, G> Clone for DatasetGraph<D, G>

where D: Clone + Dataset, G: Clone + Term,

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

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<D, G> Debug for DatasetGraph<D, G>

where D: Debug + Dataset, G: Debug + Term,

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

Formats the value using the given formatter.

impl<D, G> Graph for DatasetGraph<D, G>

where D: Dataset, G: Term,

type Triple<'x> = [<<D as Dataset>::Quad<'x> as Quad>::Term; 3] where DatasetGraph<D, G>: '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, ) -> impl Iterator<Item = Result<<DatasetGraph<D, G> as Graph>::Triple<'_>, <DatasetGraph<D, G> as Graph>::Error>>

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

fn triples_matching<'s, 't, S, P, O>( &'s self, sm: S, pm: P, om: O, ) -> impl Iterator<Item = Result<<DatasetGraph<D, G> as Graph>::Triple<'s>, <DatasetGraph<D, G> as Graph>::Error>> + 't

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

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) -> Result<bool, Self::Error>

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

Return true if this graph contains the given triple.

fn subjects( &self, ) -> impl Iterator<Item = Result<<Self::Triple<'_> as Triple>::Term, Self::Error>>

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

fn subjects_matching<'s, M>( &'s self, matcher: M, ) -> impl Iterator<Item = Result<<Self::Triple<'s> as Triple>::Term, Self::Error>> + 's

where M: TermMatcher + 's,

Build a fallible iterator of all the terms used as subject in this Graph and matching the given TermMatcher.

fn predicates( &self, ) -> impl Iterator<Item = Result<<Self::Triple<'_> as Triple>::Term, Self::Error>>

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

fn predicates_matching<'s, M>( &'s self, matcher: M, ) -> impl Iterator<Item = Result<<Self::Triple<'s> as Triple>::Term, Self::Error>> + 's

where M: TermMatcher + 's,

Build a fallible iterator of all the terms used as predicate in this Graph and matching the given TermMatcher.

fn objects( &self, ) -> impl Iterator<Item = Result<<Self::Triple<'_> as Triple>::Term, Self::Error>>

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

fn objects_matching<'s, M>( &'s self, matcher: M, ) -> impl Iterator<Item = Result<<Self::Triple<'s> as Triple>::Term, Self::Error>> + 's

where M: TermMatcher + 's,

Build a fallible iterator of all the terms used as object in this Graph and matching the given TermMatcher.

fn iris( &self, ) -> impl Iterator<Item = Result<<Self::Triple<'_> as Triple>::Term, Self::Error>>

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

fn blank_nodes( &self, ) -> impl Iterator<Item = Result<<Self::Triple<'_> as Triple>::Term, Self::Error>>

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

fn literals( &self, ) -> impl Iterator<Item = Result<<Self::Triple<'_> as Triple>::Term, Self::Error>>

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

fn triple_terms<'s>( &'s self, ) -> Box<dyn Iterator<Item = Result<<Self::Triple<'s> as Triple>::Term, Self::Error>> + 's>

where <Self::Triple<'s> as Triple>::Term: Clone,

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

fn variables( &self, ) -> impl Iterator<Item = Result<<Self::Triple<'_> as Triple>::Term, Self::Error>>

Build a fallible iterator of all the variables used in this Graph (including those used inside triple terms, 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, G> MutableGraph for DatasetGraph<D, G>

where D: MutableDataset, G: Term,

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, ) -> Result<bool, <DatasetGraph<D, G> as MutableGraph>::MutationError>

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, ) -> Result<bool, <DatasetGraph<D, G> as MutableGraph>::MutationError>

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) -> Result<bool, Self::MutationError>

where T: Triple,

Insert in this graph the given triple.

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

where T: Triple,

Remoe from this graph the given triple.

fn insert_all<TS>( &mut self, src: TS, ) -> Result<usize, StreamError<<TS as Source>::Error, Self::MutationError>>

where TS: TripleSource,

Insert into this graph all triples from the given source.

fn remove_all<TS>( &mut self, src: TS, ) -> Result<usize, StreamError<<TS as Source>::Error, Self::MutationError>>

where TS: TripleSource,

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, G> Copy for DatasetGraph<D, G>

where D: Copy + Dataset, G: Copy + Term,

impl<D, G> SetGraph for DatasetGraph<D, G>

where D: SetDataset, G: Term,