Struct grdf::hash_dataset::HashGraph

pub struct HashGraph<T: Hash + Eq = Term> { /* fields omitted */ }

Graph implementation based on HashMap and HashSet.

Implementations

impl<T: Hash + Eq> HashGraph<T>

pub fn new() -> HashGraph<T>

Create a new empty HashGraph.

pub fn from_graph<G: SizedGraph<T>>(g: G) -> HashGraph<T>

Create a new HashGraph from another graph by consuming its triples.

Trait Implementations

impl<T: Hash + Eq> Default for HashGraph<T>

pub fn default() -> HashGraph<T>

Returns the "default value" for a type.

impl<T: Hash + Eq> Graph<T> for HashGraph<T>

type Objects = Objects<'a, T>

Objects iterator.

type Predicates = Predicates<'a, T>

Subject predicates iterator.

type Subjects = Subjects<'a, T>

Graph subjects iterator.

type Triples = Iter<'a, T>

Triple iterators.

pub fn triples<'a>(&'a self) -> Iter<'a, T> where
    T: 'a, 

pub fn subjects<'a>(&'a self) -> Subjects<'a, T> where
    T: 'a, 

Iterate through all the subjects of the graph.

pub fn predicates<'a>(&'a self, subject: &T) -> Predicates<'a, T> where
    T: 'a, 

Iterate through all the predicates associated to the given subject.

pub fn objects<'a>(&'a self, subject: &T, predicate: &T) -> Objects<'a, T> where
    T: 'a, 

Iterate through all the objects associated to the given subject and predicate.

pub fn contains(&self, Triple(subject, predicate, object): Triple<&T>) -> bool

Checks if the given triple is defined in the graph.

impl<'a, T: 'a + Hash + Eq> IntoIterator for &'a HashGraph<T>

type IntoIter = Iter<'a, T>

Which kind of iterator are we turning this into?

type Item = Triple<&'a T>

The type of the elements being iterated over.

pub fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<T: Clone + Hash + Eq> IntoIterator for HashGraph<T>

type IntoIter = IntoIter<T>

Which kind of iterator are we turning this into?

type Item = Triple<T>

The type of the elements being iterated over.

pub fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<T: Hash + Eq> MutableGraph<T> for HashGraph<T>

pub fn insert(&mut self, triple: Triple<T>)

Insert the given triple into the graph.

pub fn absorb<G: SizedGraph<T>>(&mut self, other: G)

Absorb the given other graph.

impl<T: Clone + Hash + Eq> SizedGraph<T> for HashGraph<T>

type IntoObjects = IntoObjects<T>

Consuming objects iterator.

type IntoPredicates = IntoPredicates<T>

Consuming predicates iterator.

type IntoSubjects = IntoSubjects<T>

Consuming subjects iterator.

type IntoTriples = IntoIter<T>

Consuming triples iterator.

pub fn into_triples(self) -> IntoIter<T>

Consumes the graph and returns an iterator over its triples.

pub fn into_subjects(self) -> IntoSubjects<T>

Consumes the graph and returns an iterator over its subjects.

pub fn into_predicates(mut self: Self, subject: &T) -> IntoPredicates<T>

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

pub fn into_objects(
    mut self: Self,
    subject: &T,
    predicate: &T
) -> IntoObjects<T>

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