Struct CompatGraph

pub struct CompatGraph<D>(pub D);

A graph type to wrap around few common rust types, providing graph implementations for them.

Tuple Fields

0: D

Trait Implementations

impl<D: Clone> Clone for CompatGraph<D>

fn clone(&self) -> CompatGraph<D>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<T: Term + FromTerm + Clone> CollectibleGraph for CompatGraph<EcoVec<[T; 3]>>

fn from_triple_source<TS: TripleSource>( triples: TS, ) -> StreamResult<Self, TS::Error, Self::Error>

Construct a graph from the given source

impl<D: Debug> Debug for CompatGraph<D>

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

Formats the value using the given formatter.

impl<D: Default> Default for CompatGraph<D>

fn default() -> CompatGraph<D>

Returns the “default value” for a type.

impl<T> Deref for CompatGraph<T>

type Target = T

The resulting type after dereferencing.

fn deref(&self) -> &Self::Target

Dereferences the value.

impl<T: Triple> Graph for CompatGraph<EcoVec<T>>

type Triple<'x> = [<<T as Triple>::Term as Term>::BorrowTerm<'x>; 3] where Self: 'x

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

type Error = Infallible

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_matching<'s, S, P, O>( &'s self, sm: S, pm: P, om: O, ) -> Box<dyn Iterator<Item = Result<Self::Triple<'s>, Self::Error>> + '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) -> Result<bool, Self::Error>

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

Return true if this graph contains the given triple.

fn subjects( &self, ) -> Box<dyn 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 predicates( &self, ) -> Box<dyn 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 objects( &self, ) -> Box<dyn 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 iris( &self, ) -> Box<dyn 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 quoted triples, if any).

fn blank_nodes( &self, ) -> Box<dyn 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 quoted triples, if any).

fn literals( &self, ) -> Box<dyn 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 quoted triples, if any).

fn quoted_triples<'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 quoted triples used in this Graph (including those used inside quoted triples, if any).

fn variables( &self, ) -> Box<dyn 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 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: Hash> Hash for CompatGraph<D>

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl<T: Term + FromTerm + Clone> MutableGraph for CompatGraph<EcoVec<[T; 3]>>

type MutationError = Infallible

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, <Self 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) -> MgResult<Self, bool>

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 TripleSource>::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 TripleSource>::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: PartialEq> PartialEq for CompatGraph<D>

fn eq(&self, other: &CompatGraph<D>) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<D: Copy> Copy for CompatGraph<D>

impl<D: Eq> Eq for CompatGraph<D>

impl<D> StructuralPartialEq for CompatGraph<D>