Struct HashDataset

pub struct HashDataset<S = Term, P = S, O = S, G = S> { /* private fields */ }

Implementations

impl<S, P, O, G> HashDataset<S, P, O, G>

pub fn new() -> Self

pub fn is_empty(&self) -> bool

Returns the number of quads in the dataset.

pub fn len(&self) -> usize

Returns the number of quads in the dataset.

pub fn graph<W: ?Sized + Equivalent<G> + Hash>( &self, id: Option<&W>, ) -> Option<&HashGraph<S, P, O>>

where G: Eq + Hash,

pub fn graph_entry<W: ?Sized + Equivalent<G> + Hash>( &self, id: Option<&W>, ) -> Option<(Option<&G>, &HashGraph<S, P, O>)>

where G: Eq + Hash,

pub fn graphs(&self) -> Graphs<'_, S, P, O, G>

pub fn quads(&self) -> Quads<'_, S, P, O, G>

pub fn graph_mut<W: ?Sized + Equivalent<G> + Hash>( &mut self, id: Option<&W>, ) -> Option<&mut HashGraph<S, P, O>>

where G: Eq + Hash,

pub fn graphs_mut(&mut self) -> GraphsMut<'_, S, P, O, G>

pub fn insert_graph( &mut self, id: G, graph: HashGraph<S, P, O>, ) -> Option<HashGraph<S, P, O>>

where G: Eq + Hash,

pub fn into_graph(self, id: Option<&G>) -> Option<HashGraph<S, P, O>>

where G: Eq + Hash,

pub fn into_graphs(self) -> IntoGraphs<S, P, O, G>

pub fn into_quads(self) -> IntoQuads<S, P, O, G>

impl<S: Eq + Hash, P: Eq + Hash, O: Eq + Hash, G: Eq + Hash> HashDataset<S, P, O, G>

pub fn insert(&mut self, quad: Quad<S, P, O, G>) -> bool

pub fn remove<T: ?Sized + Equivalent<S> + Hash, U: ?Sized + Equivalent<P> + Hash, V: ?Sized + Equivalent<O> + Hash, W: ?Sized + Equivalent<G> + Hash>( &mut self, Quad: Quad<&T, &U, &V, &W>, )

pub fn remove_graph<W: ?Sized + Equivalent<G> + Hash>( &mut self, g: &W, ) -> Option<HashGraph<S, P, O>>

pub fn take<T: ?Sized + Equivalent<S> + Hash, U: ?Sized + Equivalent<P> + Hash, V: ?Sized + Equivalent<O> + Hash, W: ?Sized + Equivalent<G> + Hash>( &mut self, Quad: Quad<&T, &U, &V, &W>, ) -> Option<Quad<S, P, O, G>>

where S: Clone, P: Clone, G: Clone,

pub fn take_match<T: ?Sized + Equivalent<S> + Hash, U: ?Sized + Equivalent<P> + Hash, V: ?Sized + Equivalent<O> + Hash, W: ?Sized + Equivalent<G> + Hash>( &mut self, Quad: Quad<Option<&T>, Option<&U>, Option<&V>, Option<&W>>, ) -> Option<Quad<S, P, O, G>>

where S: Clone, P: Clone, O: Clone, G: Clone,

pub fn absorb<D: SizedDataset<Subject = S, Predicate = P, Object = O, GraphLabel = G>>( &mut self, other: D, )

where D::Graph: SizedGraph,

pub fn substitute_blank_ids<B>(self, f: impl Fn(B) -> B) -> Self

where S: Clone + MaybeBlankId<BlankId = B> + IntoBlankId + FromBlankId, P: Clone + MaybeBlankId<BlankId = B> + IntoBlankId + FromBlankId, O: MaybeBlankId<BlankId = B> + IntoBlankId + FromBlankId, G: Clone + MaybeBlankId<BlankId = B> + IntoBlankId + FromBlankId,

Substitutes the blank node identifiers in the dataset.

pub fn view<'a, A>( &'a self, graph_label: Option<&'a G>, subject: &'a S, access: A, ) -> View<'a, Self, A>

impl<S: Eq + Hash, P: Eq + Hash, O: Eq + Hash, G: Eq + Hash> HashDataset<S, P, O, G>

pub fn is_isomorphic_to<I, B, L>(&self, other: &Self) -> bool

where S: AsRdfTerm<I, B, L>, P: AsRdfTerm<I, B, L>, O: AsRdfTerm<I, B, L>, G: AsRdfTerm<I, B, L>, I: PartialEq, L: PartialEq, B: Eq + Hash,

Checks that there is an isomorphism between this dataset and other.

There is an isomorphism if there exists a blank node identifier bijection between self and other. This is equivalent to self.find_blank_id_bijection(other).is_some().

pub fn find_blank_id_bijection<'u, 'v, I, B, L>( &'u self, other: &'v Self, ) -> Option<HashBijection<'u, 'v, B, B>>

where S: AsRdfTerm<I, B, L>, P: AsRdfTerm<I, B, L>, O: AsRdfTerm<I, B, L>, G: AsRdfTerm<I, B, L>, I: PartialEq + 'u + 'v, L: PartialEq + 'u + 'v, B: Eq + Hash,

Finds a blank node identifier bijection between from self to other. If such bijection exists, there is an isomorphism between self and other.

impl<S: Eq + Hash, P: Eq + Hash, O: Eq + Hash, G: Eq + Hash> HashDataset<S, P, O, G>

pub fn default_graph(&self) -> &<Self as Dataset>::Graph

Get the default graph of the dataset.

This is the same as graph(None).

pub fn subjects<'a>( &'a self, id: Option<&<Self as Dataset>::GraphLabel>, ) -> Option<<<Self as Dataset>::Graph as Graph>::Subjects<'a>>

where <Self as Dataset>::Graph: 'a, <Self as Dataset>::Subject: 'a, <Self as Dataset>::Predicate: 'a, <Self as Dataset>::Object: 'a,

Iterate through all the subjects of the given graph.

pub fn predicates<'a>( &'a self, id: Option<&<Self as Dataset>::GraphLabel>, subject: &<Self as Dataset>::Subject, ) -> Option<<<Self as Dataset>::Graph as Graph>::Predicates<'a>>

where <Self as Dataset>::Graph: 'a, <Self as Dataset>::Predicate: 'a, <Self as Dataset>::Object: 'a,

Iterate through all the predicates of the given subject of the given graph.

pub fn objects<'a>( &'a self, id: Option<&<Self as Dataset>::GraphLabel>, subject: &<Self as Dataset>::Subject, predicate: &<Self as Dataset>::Predicate, ) -> Option<<<Self as Dataset>::Graph as Graph>::Objects<'a>>

where <Self as Dataset>::Graph: 'a, <Self as Dataset>::Object: 'a,

Iterate through all the objects of the given subject and predicate of the given graph.

impl<S: Clone + Eq + Hash, P: Clone + Eq + Hash, O: Eq + Hash, G: Clone + Eq + Hash> HashDataset<S, P, O, G>

pub fn into_default_graph(self) -> <Self as Dataset>::Graph

Consumes the dataset and returns the default graph.

pub fn into_subjects( self, id: Option<&<Self as Dataset>::GraphLabel>, ) -> Option<<<Self as Dataset>::Graph as SizedGraph>::IntoSubjects>

Consumes the dataset and returns an iterator over the subjects of the given graph.

pub fn into_predicates( self, id: Option<&<Self as Dataset>::GraphLabel>, subject: &<Self as Dataset>::Subject, ) -> Option<<<Self as Dataset>::Graph as SizedGraph>::IntoPredicates>

Consumes the dataset and returns an iterator over the predicates of the given subject of the given graph.

pub fn into_objects( self, id: Option<&<Self as Dataset>::GraphLabel>, subject: &<Self as Dataset>::Subject, predicate: &<Self as Dataset>::Predicate, ) -> Option<<<Self as Dataset>::Graph as SizedGraph>::IntoObjects>

Consumes the dataset and returns an iterator over the objects of the given subject and predicate of the given graph.

impl<S: Eq + Hash, P: Eq + Hash, O: Eq + Hash, G: Eq + Hash> HashDataset<S, P, O, G>

pub fn default_graph_mut(&mut self) -> &mut <Self as Dataset>::Graph

Get the default graph mutably.

Note to implementors: the default graph should always exists.

Trait Implementations

impl<S: Clone, P: Clone, O: Clone, G: Clone> Clone for HashDataset<S, P, O, G>

fn clone(&self) -> HashDataset<S, P, O, G>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<S: Eq + Hash, P: Eq + Hash, O: Eq + Hash, G: Eq + Hash> Dataset for HashDataset<S, P, O, G>

type Subject = S

type Predicate = P

type Object = O

type GraphLabel = G

type Graph = HashGraph<S, P, O>

Type of graphs in the dataset.

type Graphs<'a> = Graphs<'a, S, P, O, G> where Self: 'a, S: 'a, P: 'a, O: 'a, G: 'a

Graph iterator.

type Quads<'a> = Quads<'a, S, P, O, G> where Self: 'a, S: 'a, P: 'a, O: 'a

Quads iterator.

type PatternMatching<'a, 'p> = PatternMatching<'a, 'p, S, P, O, G> where Self: 'a, S: 'p, P: 'p, O: 'p, G: 'p

fn graph(&self, id: Option<&G>) -> Option<&HashGraph<S, P, O>>

Get the graph with the given name. Input None to get the default graph.

fn graphs(&self) -> Graphs<'_, S, P, O, G>

Returns an iterator over the graphs of the dataset.

fn quads(&self) -> Quads<'_, S, P, O, G>

Returns an iterator over the quads of the dataset.

fn pattern_matching<'p>( &self, Quad: Quad<Option<&'p Self::Subject>, Option<&'p Self::Predicate>, Option<&'p Self::Object>, Option<&'p Self::GraphLabel>>, ) -> Self::PatternMatching<'_, 'p>

fn default_graph(&self) -> &Self::Graph

Get the default graph of the dataset.

fn len(&self) -> usize

Returns the number of quads in the dataset.

fn is_empty(&self) -> bool

Checks is the dataset is empty.

fn subjects<'a>( &'a self, id: Option<&Self::GraphLabel>, ) -> Option<<Self::Graph as Graph>::Subjects<'a>>

where Self::Graph: 'a, Self::Subject: 'a, Self::Predicate: 'a, Self::Object: 'a,

Iterate through all the subjects of the given graph.

fn view<'a, A>( &'a self, graph_label: Option<&'a Self::GraphLabel>, subject: &'a Self::Subject, access: A, ) -> View<'_, Self, A>

Creates a view for the dataset, using the given subject from the given graph.

fn predicates<'a>( &'a self, id: Option<&Self::GraphLabel>, subject: &Self::Subject, ) -> Option<<Self::Graph as Graph>::Predicates<'a>>

where Self::Graph: 'a, Self::Predicate: 'a, Self::Object: 'a,

Iterate through all the predicates of the given subject of the given graph.

fn objects<'a>( &'a self, id: Option<&Self::GraphLabel>, subject: &Self::Subject, predicate: &Self::Predicate, ) -> Option<<Self::Graph as Graph>::Objects<'a>>

where Self::Graph: 'a, Self::Object: 'a,

Iterate through all the objects of the given subject and predicate of the given graph.

fn contains( &self, Quad: Quad<&Self::Subject, &Self::Predicate, &Self::Object, &Self::GraphLabel>, ) -> bool

Checks if the given quad is defined in the dataset.

fn any_match( &self, pattern: Quad<Option<&Self::Subject>, Option<&Self::Predicate>, Option<&Self::Object>, Option<&Self::GraphLabel>>, ) -> Option<Quad<&Self::Subject, &Self::Predicate, &Self::Object, &Self::GraphLabel>>

fn first_match( &self, pattern: Quad<Option<&Self::Subject>, Option<&Self::Predicate>, Option<&Self::Object>, Option<&Self::GraphLabel>>, ) -> Option<Quad<&Self::Subject, &Self::Predicate, &Self::Object, &Self::GraphLabel>>

👎Deprecated: use any_match instead

impl<S: Debug, P: Debug, O: Debug, G: Debug> Debug for HashDataset<S, P, O, G>

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

Formats the value using the given formatter.

impl<S, P, O, G> Default for HashDataset<S, P, O, G>

fn default() -> Self

Returns the “default value” for a type.

impl<S: Eq + Hash, P: Eq + Hash, O: Eq + Hash, G: Eq + Hash> Extend<Quad<S, P, O, G>> for HashDataset<S, P, O, G>

fn extend<I: IntoIterator<Item = Quad<S, P, O, G>>>(&mut self, iter: I)

Extends a collection with the contents of an iterator.

fn extend_one(&mut self, item: A)

🔬This is a nightly-only experimental API. (extend_one)

Extends a collection with exactly one element.

fn extend_reserve(&mut self, additional: usize)

🔬This is a nightly-only experimental API. (extend_one)

Reserves capacity in a collection for the given number of additional elements.

impl<S: Eq + Hash, P: Eq + Hash, O: Eq + Hash, G: Eq + Hash> FromIterator<Quad<S, P, O, G>> for HashDataset<S, P, O, G>

fn from_iter<I: IntoIterator<Item = Quad<S, P, O, G>>>(iter: I) -> Self

Creates a value from an iterator.

impl<'a, S, P, O, G> IntoIterator for &'a HashDataset<S, P, O, G>

type Item = Quad<&'a S, &'a P, &'a O, &'a G>

The type of the elements being iterated over.

type IntoIter = Quads<'a, S, P, O, G>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<S: Clone, P: Clone, O, G: Clone> IntoIterator for HashDataset<S, P, O, G>

type Item = Quad<S, P, O, G>

The type of the elements being iterated over.

type IntoIter = IntoQuads<S, P, O, G>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<S: Eq + Hash, P: Eq + Hash, O: Eq + Hash, G: Eq + Hash> MutableDataset for HashDataset<S, P, O, G>

type GraphsMut<'a> = GraphsMut<'a, S, P, O, G> where Self: 'a, S: 'a, P: 'a, O: 'a, G: 'a

Iterator over mutable graphs.

fn graph_mut(&mut self, id: Option<&G>) -> Option<&mut Self::Graph>

Get the given graph mutably.

fn graphs_mut(&mut self) -> Self::GraphsMut<'_>

Returns an iterator over the (mutable) graphs of the dataset.

fn insert_graph(&mut self, id: G, graph: Self::Graph) -> Option<Self::Graph>

Insert a graph in the dataset with the given name.

fn insert(&mut self, quad: Quad<S, P, O, G>) -> bool

Insert a quad in the dataset.

fn remove(&mut self, quad: Quad<&S, &P, &O, &G>)

Remove a quad from the dataset.

fn absorb<D: SizedDataset<Subject = S, Predicate = P, Object = O, GraphLabel = G>>( &mut self, other: D, )

where D::Graph: SizedGraph,

Absorb the given other dataset.

fn default_graph_mut(&mut self) -> &mut Self::Graph

Get the default graph mutably.

impl<S, P, O, G> PartialEq for HashDataset<S, P, O, G>

where S: Eq + Hash, P: Eq + Hash, O: Eq + Hash, G: Eq + Hash,

fn eq(&self, other: &Self) -> 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<S: Clone + Eq + Hash, P: Clone + Eq + Hash, O: Eq + Hash, G: Clone + Eq + Hash> SizedDataset for HashDataset<S, P, O, G>

type IntoGraphs = IntoGraphs<S, P, O, G>

Consuming graphs iterator.

type IntoQuads = IntoQuads<S, P, O, G>

Consuming quads iterator.

fn into_graph(self, id: Option<&G>) -> Option<Self::Graph>

Consumes the dataset and returns the given graph.

fn into_graphs(self) -> Self::IntoGraphs

Consumes the dataset and returns an iterator over its graphs.

fn into_quads(self) -> Self::IntoQuads

Consumes the dataset and returns an iterator over its quads.

fn into_default_graph(self) -> Self::Graph

Consumes the dataset and returns the default graph.

fn into_subjects( self, id: Option<&Self::GraphLabel>, ) -> Option<<Self::Graph as SizedGraph>::IntoSubjects>

Consumes the dataset and returns an iterator over the subjects of the given graph.

fn into_predicates( self, id: Option<&Self::GraphLabel>, subject: &Self::Subject, ) -> Option<<Self::Graph as SizedGraph>::IntoPredicates>

Consumes the dataset and returns an iterator over the predicates of the given subject of the given graph.

fn into_objects( self, id: Option<&Self::GraphLabel>, subject: &Self::Subject, predicate: &Self::Predicate, ) -> Option<<Self::Graph as SizedGraph>::IntoObjects>

Consumes the dataset and returns an iterator over the objects of the given subject and predicate of the given graph.

impl<S, P, O, G> Eq for HashDataset<S, P, O, G>

where S: Eq + Hash, P: Eq + Hash, O: Eq + Hash, G: Eq + Hash,