Struct sophia::dataset::adapter::DatasetGraph

pub struct DatasetGraph<D: ?Sized, E, M: GraphNameMatcher> { /* fields omitted */ }

The adapter returned by Dataset::union_graph

Trait Implementations

impl<'a, D: ?Sized, E, M> Graph<'a> for DatasetGraph<D, E, M> where
    D: Dataset<'a>,
    E: Borrow<D>,
    M: GraphNameMatcher, 

type Triple = QuadAsTriple<D::Quad>

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

type Error = D::Error

The error type that this graph may raise.

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

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

fn triples_with_s<T>(&'a self, s: &'a Term<T>) -> GTripleSource<'a, Self> where
    T: TermData, 

An iterator visiting all triples with the given subject.

fn triples_with_p<T>(&'a self, p: &'a Term<T>) -> GTripleSource<'a, Self> where
    T: TermData, 

An iterator visiting all triples with the given predicate.

fn triples_with_o<T>(&'a self, o: &'a Term<T>) -> GTripleSource<'a, Self> where
    T: TermData, 

An iterator visiting all triples with the given object.

fn triples_with_sp<T, U>(
    &'a self,
    s: &'a Term<T>,
    p: &'a Term<U>
) -> GTripleSource<'a, Self> where
    T: TermData,
    U: TermData, 

An iterator visiting all triples with the given subject and predicate.

fn triples_with_so<T, U>(
    &'a self,
    s: &'a Term<T>,
    o: &'a Term<U>
) -> GTripleSource<'a, Self> where
    T: TermData,
    U: TermData, 

An iterator visiting all triples with the given subject and object.

fn triples_with_po<T, U>(
    &'a self,
    p: &'a Term<T>,
    o: &'a Term<U>
) -> GTripleSource<'a, Self> where
    T: TermData,
    U: TermData, 

An iterator visiting all triples with the given predicate and object.

fn triples_with_spo<T, U, V>(
    &'a self,
    s: &'a Term<T>,
    p: &'a Term<U>,
    o: &'a Term<V>
) -> GTripleSource<'a, Self> where
    T: TermData,
    U: TermData,
    V: TermData, 

An iterator visiting all triples with the given subject, predicate and object.

fn contains<T, U, V>(
    &'a self,
    s: &'a Term<T>,
    p: &'a Term<U>,
    o: &'a Term<V>
) -> GResult<'a, Self, bool> where
    T: TermData,
    U: TermData,
    V: TermData, 

Return true if this graph contains the given triple.

fn triples_matching<S: ?Sized, P: ?Sized, O: ?Sized>(
    &'a self,
    ms: &'a S,
    mp: &'a P,
    mo: &'a O
) -> GTripleSource<'a, Self> where
    S: TermMatcher,
    P: TermMatcher,
    O: TermMatcher, 

An iterator visiting all triples matching the given subject, predicate and object.

fn subjects(&'a self) -> GResultTermSet<'a, Self>

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

fn predicates(&'a self) -> GResultTermSet<'a, Self>

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

fn objects(&'a self) -> GResultTermSet<'a, Self>

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

fn iris(&'a self) -> GResultTermSet<'a, Self>

Build a Hashset of all the IRIs used in this Graph.

fn bnodes(&'a self) -> GResultTermSet<'a, Self>

Build a Hashset of all the BNodes used in this Graph.

fn literals(&'a self) -> GResultTermSet<'a, Self>

Build a Hashset of all the Literals used in this Graph.

fn variables(&'a self) -> GResultTermSet<'a, Self>

Build a Hashset of all the variables used in this Graph.

fn borrow_as_dataset(&self) -> GraphAsDataset<Self, &Self>

Dataset adapter borrowing this graph

fn borrow_mut_as_dataset(&mut self) -> GraphAsDataset<Self, &mut Self>

Dataset adapter borrowing this graph mutably

fn as_dataset(self) -> GraphAsDataset<Self, Self> where
    Self: Sized, 

Dataset adapter taking ownership of this graph

impl<D, E, F> MutableGraph for DatasetGraph<D, E, Option<Term<F>>> where
    D: MutableDataset,
    E: BorrowMut<D>,
    F: TermData, 

type MutationError = D::MutationError

The error type that this graph may raise during mutations.

fn insert<T, U, V>(
    &mut self,
    s: &Term<T>,
    p: &Term<U>,
    o: &Term<V>
) -> MGResult<Self, bool> where
    T: TermData,
    U: TermData,
    V: TermData, 

Insert the given triple in this graph.

fn remove<T, U, V>(
    &mut self,
    s: &Term<T>,
    p: &Term<U>,
    o: &Term<V>
) -> MGResult<Self, bool> where
    T: TermData,
    U: TermData,
    V: TermData, 

Insert the given triple in this graph.

fn inserter(&mut self) -> Inserter<Self>

Return a TripleSink that will insert into this graph all the triples it receives.

fn insert_all<'a, TS>(
    &mut self,
    src: &mut TS
) -> CoercedResult<usize, TS::Error, Self::MutationError> where
    TS: TripleSource<'a>,
    TS::Error: CoercibleWith<Self::MutationError>, 

Insert into this graph all triples from the given source.

fn remover(&mut self) -> Remover<Self>

Return a TripleSink that will remove from this graph all the triples it receives.

fn remove_all<'a, TS>(
    &mut self,
    src: &mut TS
) -> CoercedResult<usize, TS::Error, Self::MutationError> where
    TS: TripleSource<'a>,
    TS::Error: CoercibleWith<Self::MutationError>, 

Remove from this graph all triples from the given source.

fn remove_matching<S: ?Sized, P: ?Sized, O: ?Sized>(
    &mut self,
    ms: &S,
    mp: &P,
    mo: &O
) -> MGResult<Self, usize> where
    S: TermMatcher,
    P: TermMatcher,
    O: TermMatcher,
    Self::Error: Into<Self::MutationError>,
    Never: CoercibleWith<Self::MutationError>,
    Self::MutationError: From<CoercedError<Never, Self::MutationError>>, 

Remove all triples matching the given matchers.

fn retain<S: ?Sized, P: ?Sized, O: ?Sized>(
    &mut self,
    ms: &S,
    mp: &P,
    mo: &O
) -> MGResult<Self, ()> where
    S: TermMatcher,
    P: TermMatcher,
    O: TermMatcher,
    Self::Error: Into<Self::MutationError>,
    Never: CoercibleWith<Self::MutationError>,
    Self::MutationError: From<CoercedError<Never, Self::MutationError>>, 

Keep only the triples matching the given matchers.

impl<D, E, F> SetGraph for DatasetGraph<D, E, Option<Term<F>>> where
    D: SetDataset,
    E: Borrow<D>,
    F: TermData,