Struct GraphAsDataset

pub struct GraphAsDataset<T>(/* private fields */);

I wrap a Graph as a Dataset containing only that graph as the default graph.

Implementations

impl<T> GraphAsDataset<T>

where T: Graph,

pub fn new(graph: T) -> Self

Wrap the given graph with the given name.

pub fn unwrap(self) -> T

Unwrap the inner graph and name.

Trait Implementations

impl<T: Clone> Clone for GraphAsDataset<T>

fn clone(&self) -> GraphAsDataset<T>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<T> Dataset for GraphAsDataset<T>

where T: Graph,

type Quad<'x> = ([<<T as Graph>::Triple<'x> as Triple>::Term; 3], Option<<<T as Graph>::Triple<'x> as Triple>::Term>) where Self: 'x

Determine the type of Quads that the methods of this dataset will yield.

type Error = <T as Graph>::Error

The error type that this dataset may raise.

fn quads(&self) -> DQuadSource<'_, Self>

An iterator visiting all quads of this dataset in arbitrary order.

fn quads_matching<'s, S, P, O, G>( &'s self, sm: S, pm: P, om: O, gm: G, ) -> DQuadSource<'s, Self>

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

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

fn contains<TS, TP, TO, TG>( &self, s: TS, p: TP, o: TO, g: GraphName<TG>, ) -> DResult<Self, bool>

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

Return true if this dataset contains the given quad.

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

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

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

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

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

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

fn graph_names(&self) -> DTermSource<'_, Self>

Build a fallible iterator of all the terms used as graph name in this Dataset.

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

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

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

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

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

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

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

where GTerm<'s, T>: Clone,

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

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

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

fn graph<T>(&self, graph_name: GraphName<T>) -> DatasetGraph<&Self, T>

where T: for<'x> Term<BorrowTerm<'x> = DTerm<'x, Self>> + 'static,

Borrows one of the graphs of this dataset

fn graph_mut<T>( &mut self, graph_name: GraphName<T>, ) -> DatasetGraph<&mut Self, T>

where T: for<'x> Term<BorrowTerm<'x> = DTerm<'x, Self>> + 'static,

Borrows mutably one of the graphs of this dataset

fn partial_union_graph<M>(&self, selector: M) -> PartialUnionGraph<&Self, M>

where M: GraphNameMatcher + Copy,

Borrows a graph that is the union of some of this dataset’s graphs

fn union_graph(&self) -> UnionGraph<&Self>

Borrows a graph that is the union of all this dataset’s graphs (default and named)

fn into_union_graph(self) -> UnionGraph<Self>

where Self: Sized,

Convert into a graph that is the union of all this dataset’s graphs (default and named)

impl<T: Debug> Debug for GraphAsDataset<T>

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

Formats the value using the given formatter.

impl<T> MutableDataset for GraphAsDataset<T>

where T: MutableGraph,

type MutationError = GraphAsDatasetMutationError<<T as MutableGraph>::MutationError>

The error type that this dataset may raise during mutations.

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

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

Insert the given quad in this dataset.

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

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

Remove the given quad from this dataset.

fn insert_quad<T>(&mut self, quad: T) -> MdResult<Self, bool>

where T: Quad,

Insert in this graph the given quad.

fn remove_quad<T>(&mut self, quad: T) -> MdResult<Self, bool>

where T: Quad,

Remove from this graph a the given quad.

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

Insert into this dataset all quads from the given source.

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

Remove from this dataset all quads from the given source.

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

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

Remove all quads matching the given matchers.

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

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

Keep only the quads matching the given matchers.

impl<T: Copy> Copy for GraphAsDataset<T>