Struct sophia::graph::inmem::HashGraph

pub struct HashGraph<I> where
    I: TermIndexMap,
    I::Index: Hash,
    <I::Factory as TermFactory>::TermData: 'static,  { /* fields omitted */ }

A generic implementation of Graph and MutableGraph, storing its terms in a TermIndexMap, and its triples in a HashSet.

Implementations

impl<I> HashGraph<I> where
    I: TermIndexMap,
    I::Index: Hash, 

pub fn new() -> HashGraph<I>

pub fn len(&self) -> usize

pub fn is_empty(&self) -> bool

Trait Implementations

impl<I> CollectibleGraph for HashGraph<I> where
    I: TermIndexMap,
    I::Index: Hash,
    <I::Factory as TermFactory>::TermData: 'static, 

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

impl<I: Default> Default for HashGraph<I> where
    I: TermIndexMap,
    I::Index: Hash,
    <I::Factory as TermFactory>::TermData: 'static,
    I::Index: Default, 

fn default() -> HashGraph<I>

Returns the "default value" for a type.

impl<I> Graph for HashGraph<I> where
    I: TermIndexMap,
    I::Index: Hash,
    <I::Factory as TermFactory>::TermData: 'static, 

type Triple = ByTermRefs<Term<Self::TermData>>

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

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_with_s<TS>(
    &'s self,
    s: &'s TS
) -> Box<dyn Iterator<Item = Result<StreamedTriple<'s, Self::Triple>, Self::Error>> + 's> where
    TS: TTerm + ?Sized, 

An iterator visiting all triples with the given subject.

fn triples_with_p<TP>(
    &'s self,
    p: &'s TP
) -> Box<dyn Iterator<Item = Result<StreamedTriple<'s, Self::Triple>, Self::Error>> + 's> where
    TP: TTerm + ?Sized, 

An iterator visiting all triples with the given predicate.

fn triples_with_o<TO>(
    &'s self,
    o: &'s TO
) -> Box<dyn Iterator<Item = Result<StreamedTriple<'s, Self::Triple>, Self::Error>> + 's> where
    TO: TTerm + ?Sized, 

An iterator visiting all triples with the given object.

fn triples_with_sp<TS, TP>(
    &'s self,
    s: &'s TS,
    p: &'s TP
) -> Box<dyn Iterator<Item = Result<StreamedTriple<'s, Self::Triple>, Self::Error>> + 's> where
    TP: TTerm + ?Sized,
    TS: TTerm + ?Sized, 

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

fn triples_with_so<TS, TO>(
    &'s self,
    s: &'s TS,
    o: &'s TO
) -> Box<dyn Iterator<Item = Result<StreamedTriple<'s, Self::Triple>, Self::Error>> + 's> where
    TO: TTerm + ?Sized,
    TS: TTerm + ?Sized, 

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

fn triples_with_po<TP, TO>(
    &'s self,
    p: &'s TP,
    o: &'s TO
) -> Box<dyn Iterator<Item = Result<StreamedTriple<'s, Self::Triple>, Self::Error>> + 's> where
    TO: TTerm + ?Sized,
    TP: TTerm + ?Sized, 

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

fn triples_with_spo<TS, TP, TO>(
    &'s self,
    s: &'s TS,
    p: &'s TP,
    o: &'s TO
) -> Box<dyn Iterator<Item = Result<StreamedTriple<'s, Self::Triple>, Self::Error>> + 's> where
    TO: TTerm + ?Sized,
    TP: TTerm + ?Sized,
    TS: 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
) -> Result<bool, Self::Error> where
    TO: TTerm + ?Sized,
    TP: TTerm + ?Sized,
    TS: TTerm + ?Sized, 

Return true if this graph contains the given triple.

fn triples_matching<S, P, O>(
    &'s self,
    ms: &'s S,
    mp: &'s P,
    mo: &'s O
) -> Box<dyn Iterator<Item = Result<StreamedTriple<'s, Self::Triple>, Self::Error>> + 's> where
    O: TermMatcher + ?Sized,
    P: TermMatcher + ?Sized,
    S: TermMatcher + ?Sized, 

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

fn subjects(
    &self
) -> Result<HashSet<<<Self::Triple as TripleStreamingMode>::UnsafeTriple as UnsafeTriple>::Term, RandomState>, Self::Error> where
    <<Self::Triple as TripleStreamingMode>::UnsafeTriple as UnsafeTriple>::Term: Clone,
    <<Self::Triple as TripleStreamingMode>::UnsafeTriple as UnsafeTriple>::Term: Eq,
    <<Self::Triple as TripleStreamingMode>::UnsafeTriple as UnsafeTriple>::Term: Hash, 

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

fn predicates(
    &self
) -> Result<HashSet<<<Self::Triple as TripleStreamingMode>::UnsafeTriple as UnsafeTriple>::Term, RandomState>, Self::Error> where
    <<Self::Triple as TripleStreamingMode>::UnsafeTriple as UnsafeTriple>::Term: Clone,
    <<Self::Triple as TripleStreamingMode>::UnsafeTriple as UnsafeTriple>::Term: Eq,
    <<Self::Triple as TripleStreamingMode>::UnsafeTriple as UnsafeTriple>::Term: Hash, 

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

fn objects(
    &self
) -> Result<HashSet<<<Self::Triple as TripleStreamingMode>::UnsafeTriple as UnsafeTriple>::Term, RandomState>, Self::Error> where
    <<Self::Triple as TripleStreamingMode>::UnsafeTriple as UnsafeTriple>::Term: Clone,
    <<Self::Triple as TripleStreamingMode>::UnsafeTriple as UnsafeTriple>::Term: Eq,
    <<Self::Triple as TripleStreamingMode>::UnsafeTriple as UnsafeTriple>::Term: Hash, 

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

fn iris(
    &self
) -> Result<HashSet<<<Self::Triple as TripleStreamingMode>::UnsafeTriple as UnsafeTriple>::Term, RandomState>, Self::Error> where
    <<Self::Triple as TripleStreamingMode>::UnsafeTriple as UnsafeTriple>::Term: Clone,
    <<Self::Triple as TripleStreamingMode>::UnsafeTriple as UnsafeTriple>::Term: Eq,
    <<Self::Triple as TripleStreamingMode>::UnsafeTriple as UnsafeTriple>::Term: Hash, 

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

fn bnodes(
    &self
) -> Result<HashSet<<<Self::Triple as TripleStreamingMode>::UnsafeTriple as UnsafeTriple>::Term, RandomState>, Self::Error> where
    <<Self::Triple as TripleStreamingMode>::UnsafeTriple as UnsafeTriple>::Term: Clone,
    <<Self::Triple as TripleStreamingMode>::UnsafeTriple as UnsafeTriple>::Term: Eq,
    <<Self::Triple as TripleStreamingMode>::UnsafeTriple as UnsafeTriple>::Term: Hash, 

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

fn literals(
    &self
) -> Result<HashSet<<<Self::Triple as TripleStreamingMode>::UnsafeTriple as UnsafeTriple>::Term, RandomState>, Self::Error> where
    <<Self::Triple as TripleStreamingMode>::UnsafeTriple as UnsafeTriple>::Term: Clone,
    <<Self::Triple as TripleStreamingMode>::UnsafeTriple as UnsafeTriple>::Term: Eq,
    <<Self::Triple as TripleStreamingMode>::UnsafeTriple as UnsafeTriple>::Term: Hash, 

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

fn variables(
    &self
) -> Result<HashSet<<<Self::Triple as TripleStreamingMode>::UnsafeTriple as UnsafeTriple>::Term, RandomState>, Self::Error> where
    <<Self::Triple as TripleStreamingMode>::UnsafeTriple as UnsafeTriple>::Term: Clone,
    <<Self::Triple as TripleStreamingMode>::UnsafeTriple as UnsafeTriple>::Term: Eq,
    <<Self::Triple as TripleStreamingMode>::UnsafeTriple as UnsafeTriple>::Term: 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, Self>

Dataset adapter taking ownership of this graph

impl<I> IndexedGraph for HashGraph<I> where
    I: TermIndexMap,
    I::Index: Hash,
    <I::Factory as TermFactory>::TermData: 'static, 

type Index = I::Index

The type used to represent terms internally.

type TermData = <I::Factory as TermFactory>::TermData

fn with_capacity(capacity: usize) -> Self

Construct a new empty graph, provisioning for storing capacity triples.

fn shrink_to_fit(&mut self)

Shrink the memory consumption of the graph as much as possible.

fn get_index<T: ?Sized>(&self, t: &T) -> Option<Self::Index> where
    T: TTerm, 

Return the index for the given term, if it exists.

fn get_term(&self, i: Self::Index) -> Option<&Term<Self::TermData>>

Return the term for the given index, if it exists.

fn insert_indexed<TS: ?Sized, TP: ?Sized, TO: ?Sized>(
    &mut self,
    s: &TS,
    p: &TP,
    o: &TO
) -> Option<[Self::Index; 3]> where
    TS: TTerm,
    TP: TTerm,
    TO: TTerm, 

Insert a triple in this Graph, and return the corresponding tuple of indices.

fn remove_indexed<TS: ?Sized, TP: ?Sized, TO: ?Sized>(
    &mut self,
    s: &TS,
    p: &TP,
    o: &TO
) -> Option<[Self::Index; 3]> where
    TS: TTerm,
    TP: TTerm,
    TO: TTerm, 

Remove a triple from this Graph, and return the corresponding tuple of indices.

impl<I> MutableGraph for HashGraph<I> where
    I: TermIndexMap,
    I::Index: Hash,
    <I::Factory as TermFactory>::TermData: 'static, 

type MutationError = Infallible

The error type that this graph may raise during mutations.

fn insert<TS_: ?Sized, TP_: ?Sized, TO_: ?Sized>(
    &mut self,
    s: &TS_,
    p: &TP_,
    o: &TO_
) -> MGResult<Self, bool> where
    TS_: TTerm,
    TP_: TTerm,
    TO_: TTerm, 

Insert the given triple in this graph.

fn remove<TS_: ?Sized, TP_: ?Sized, TO_: ?Sized>(
    &mut self,
    s: &TS_,
    p: &TP_,
    o: &TO_
) -> MGResult<Self, bool> where
    TS_: TTerm,
    TP_: TTerm,
    TO_: TTerm, 

Remove the given triple from this graph.

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>(
    &'s mut self,
    ms: &S,
    mp: &P,
    mo: &O
) -> Result<usize, Self::MutationError> where
    O: TermMatcher + ?Sized,
    P: TermMatcher + ?Sized,
    S: TermMatcher + ?Sized,
    <<Self::Triple as TripleStreamingMode>::UnsafeTriple as UnsafeTriple>::Term: Clone,
    Self::Error: Into<Self::MutationError>, 

Remove all triples matching the given matchers.

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

Keep only the triples matching the given matchers.

impl<I> SetGraph for HashGraph<I> where
    I: TermIndexMap,
    I::Index: Hash,