Struct PartialUnionGraph 

pub struct PartialUnionGraph<D: Dataset, M: GraphNameMatcher> { /* private fields */ }

I wrap a Dataset as a Graph corresponding to the union of a subset of its graphs, determined by a GraphNameMatcher.

Implementations

impl<D: Dataset, M: GraphNameMatcher + Copy> PartialUnionGraph<D, M>

pub fn new(d: D, m: M) -> Self

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

pub fn unwrap(self) -> (D, M)

Unwrap the inner GraphName and Dataset.

Trait Implementations

impl<D: Clone + Dataset, M: Clone + GraphNameMatcher> Clone for PartialUnionGraph<D, M>

fn clone(&self) -> PartialUnionGraph<D, M>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<D: Debug + Dataset, M: Debug + GraphNameMatcher> Debug for PartialUnionGraph<D, M>

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

Formats the value using the given formatter.

impl<D: Dataset, M: GraphNameMatcher + Copy> Graph for PartialUnionGraph<D, M>

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) -> impl Iterator<Item = GResult<Self, Self::Triple<'_>>> + '_

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, ) -> impl Iterator<Item = GResult<Self, Self::Triple<'s>>> + 's

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) -> impl Iterator<Item = GResult<Self, GTerm<'_, Self>>> + '_

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

fn predicates( &self, ) -> impl Iterator<Item = GResult<Self, GTerm<'_, Self>>> + '_

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

fn objects(&self) -> impl Iterator<Item = GResult<Self, GTerm<'_, Self>>> + '_

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

fn iris(&self) -> impl Iterator<Item = GResult<Self, GTerm<'_, 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, ) -> impl Iterator<Item = GResult<Self, GTerm<'_, 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) -> impl Iterator<Item = GResult<Self, GTerm<'_, 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, ) -> Box<dyn Iterator<Item = GResult<Self, GTerm<'_, 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) -> impl Iterator<Item = GResult<Self, GTerm<'_, 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: Copy + Dataset, M: Copy + GraphNameMatcher> Copy for PartialUnionGraph<D, M>