[−][src]Struct grdf::hash_dataset::HashGraph
Graph implementation based on HashMap
and HashSet
.
Implementations
impl<T: Hash + Eq> HashGraph<T>
[src]
pub fn new() -> HashGraph<T>
[src]
Create a new empty HashGraph
.
pub fn from_graph<G: SizedGraph<T>>(g: G) -> HashGraph<T>
[src]
Create a new HashGraph
from another graph by consuming its triples.
Trait Implementations
impl<T: Hash + Eq> Default for HashGraph<T>
[src]
impl<T: Hash + Eq> Graph<T> for HashGraph<T>
[src]
type Iter = Iterators
Iterators.
fn triples<'a>(&'a self) -> Iter<'a, T> where
T: 'a,
[src]
T: 'a,
fn subjects<'a>(&'a self) -> Subjects<'a, T> where
T: 'a,
[src]
T: 'a,
fn predicates<'a>(&'a self, subject: &T) -> Predicates<'a, T> where
T: 'a,
[src]
T: 'a,
fn objects<'a>(&'a self, subject: &T, predicate: &T) -> Objects<'a, T> where
T: 'a,
[src]
T: 'a,
fn contains(&self, Triple: Triple<&T>) -> bool
[src]
impl<'a, T: 'a + Hash + Eq> IntoIterator for &'a HashGraph<T>
[src]
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.
fn into_iter(self) -> Self::IntoIter
[src]
impl<T: Clone + Hash + Eq> IntoIterator for HashGraph<T>
[src]
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.
fn into_iter(self) -> Self::IntoIter
[src]
impl<T: Hash + Eq> MutableGraph<T> for HashGraph<T>
[src]
impl<T: Clone + Hash + Eq> SizedGraph<T> for HashGraph<T>
[src]
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.
fn into_triples(self) -> IntoIter<T>
[src]
fn into_subjects(self) -> IntoSubjects<T>
[src]
fn into_predicates(self, subject: &T) -> IntoPredicates<T>
[src]
fn into_objects(self, subject: &T, predicate: &T) -> IntoObjects<T>
[src]
Auto Trait Implementations
impl<T> RefUnwindSafe for HashGraph<T> where
T: RefUnwindSafe,
T: RefUnwindSafe,
impl<T> Send for HashGraph<T> where
T: Send,
T: Send,
impl<T> Sync for HashGraph<T> where
T: Sync,
T: Sync,
impl<T> Unpin for HashGraph<T> where
T: Unpin,
T: Unpin,
impl<T> UnwindSafe for HashGraph<T> where
T: UnwindSafe,
T: UnwindSafe,
Blanket Implementations
impl<T> Any for T where
T: 'static + ?Sized,
[src]
T: 'static + ?Sized,
impl<T> Borrow<T> for T where
T: ?Sized,
[src]
T: ?Sized,
impl<T> BorrowMut<T> for T where
T: ?Sized,
[src]
T: ?Sized,
fn borrow_mut(&mut self) -> &mut T
[src]
impl<T> From<T> for T
[src]
impl<T, U> Into<U> for T where
U: From<T>,
[src]
U: From<T>,
impl<I> IntoIterator for I where
I: Iterator,
[src]
I: Iterator,
type Item = <I as Iterator>::Item
The type of the elements being iterated over.
type IntoIter = I
Which kind of iterator are we turning this into?
fn into_iter(self) -> I
[src]
impl<T, U> TryFrom<U> for T where
U: Into<T>,
[src]
U: Into<T>,
type Error = Infallible
The type returned in the event of a conversion error.
fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>
[src]
impl<T, U> TryInto<U> for T where
U: TryFrom<T>,
[src]
U: TryFrom<T>,