Struct sophia_api::dataset::adapter::DatasetGraph

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

The adapter returned by Dataset::graph, Dataset::graph_mut, and Dataset::union_graph.

Implementations

impl<D: ?Sized, E, M: GraphNameMatcher> DatasetGraph<D, E, M>

pub fn new(dataset: E, gmatcher: M) -> DatasetGraph<D, E, M>

Wrap a dataset as a graph

pub fn unwrap(self) -> E

Unwrap this adapter to get the original graph.

Trait Implementations

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

type Triple = FromQuad<D::Quad>

Determine the type of Triples that the methods of this graph will yield (see streaming_mode)

type Error = D::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_with_s<'s, TS>(&'s self, s: &'s TS) -> GTripleSource<'s, Self> where
    TS: TTerm + ?Sized, 

An iterator visiting all triples with the given subject.

fn triples_with_p<'s, TP>(&'s self, p: &'s TP) -> GTripleSource<'s, Self> where
    TP: TTerm + ?Sized, 

An iterator visiting all triples with the given predicate.

fn triples_with_o<'s, TO>(&'s self, o: &'s TO) -> GTripleSource<'s, Self> where
    TO: TTerm + ?Sized, 

An iterator visiting all triples with the given object.

fn triples_with_sp<'s, TS, TP>(
    &'s self,
    s: &'s TS,
    p: &'s TP
) -> GTripleSource<'s, Self> where
    TS: TTerm + ?Sized,
    TP: TTerm + ?Sized, 

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

fn triples_with_so<'s, TS, TO>(
    &'s self,
    s: &'s TS,
    o: &'s TO
) -> GTripleSource<'s, Self> where
    TS: TTerm + ?Sized,
    TO: TTerm + ?Sized, 

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

fn triples_with_po<'s, TP, TO>(
    &'s self,
    p: &'s TP,
    o: &'s TO
) -> GTripleSource<'s, Self> where
    TP: TTerm + ?Sized,
    TO: TTerm + ?Sized, 

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

fn triples_with_spo<'s, TS, TP, TO>(
    &'s self,
    s: &'s TS,
    p: &'s TP,
    o: &'s TO
) -> GTripleSource<'s, Self> where
    TS: TTerm + ?Sized,
    TP: TTerm + ?Sized,
    TO: TTerm + ?Sized, 

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

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

Return true if this graph contains the given triple.

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

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

fn subjects(&self) -> GResultTermSet<Self> where
    GTerm<Self>: Clone + Eq + Hash, 

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

fn predicates(&self) -> GResultTermSet<Self> where
    GTerm<Self>: Clone + Eq + Hash, 

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

fn objects(&self) -> GResultTermSet<Self> where
    GTerm<Self>: Clone + Eq + Hash, 

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

fn iris(&self) -> GResultTermSet<Self> where
    GTerm<Self>: Clone + Eq + Hash, 

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

fn bnodes(&self) -> GResultTermSet<Self> where
    GTerm<Self>: Clone + Eq + Hash, 

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

fn literals(&self) -> GResultTermSet<Self> where
    GTerm<Self>: Clone + Eq + Hash, 

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

fn variables(&self) -> GResultTermSet<Self> where
    GTerm<Self>: Clone + Eq + Hash, 

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

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

Dataset adapter borrowing this graph

fn as_dataset_mut(&mut self) -> GraphAsDataset<Self, &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, E, T> MutableGraph for DatasetGraph<D, E, Option<&T>> where
    D: MutableDataset,
    E: BorrowMut<D>,
    T: TTerm + ?Sized, 

type MutationError = D::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: TTerm + ?Sized,
    TP: TTerm + ?Sized,
    TO: TTerm + ?Sized, 

Insert the given triple in this graph.

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

Remove the given triple from this graph.

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

Insert into this graph all triples from the given source.

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

Remove from this graph all triples from the given source.

fn remove_matching<'s, S, P, O>(
    &'s mut self,
    ms: &S,
    mp: &P,
    mo: &O
) -> Result<usize, Self::MutationError> where
    S: TermMatcher + ?Sized,
    P: TermMatcher + ?Sized,
    O: TermMatcher + ?Sized,
    GTerm<Self>: Clone,
    <Self as Graph>::Error: Into<Self::MutationError>, 

Remove all triples matching the given matchers.

fn retain_matching<'s, S, P, O>(
    &'s mut self,
    ms: &S,
    mp: &P,
    mo: &O
) -> Result<(), Self::MutationError> where
    S: TermMatcher + ?Sized,
    P: TermMatcher + ?Sized,
    O: TermMatcher + ?Sized,
    GTerm<Self>: Clone,
    <Self as Graph>::Error: Into<Self::MutationError>, 

Keep only the triples matching the given matchers.

impl<D, E, T> SetGraph for DatasetGraph<D, E, Option<&T>> where
    D: Dataset + SetDataset,
    E: Borrow<D>,
    T: TTerm + ?Sized,