[−][src]Struct grdf::hash_dataset::HashDataset
Implementations
impl<T: Hash + Eq> HashDataset<T>
[src]
Trait Implementations
impl<T: 'static + Hash + Eq> Dataset<T> for HashDataset<T>
[src]
type Graph = HashGraph<T>
Type of graphs in the dataset.
type Graphs = Graphs<'a, T>
Graph iterator. Read more
type Quads = Quads<'a, T>
Quads iterator.
fn graph(&self, id: Option<&T>) -> Option<&HashGraph<T>>
[src]
fn graphs<'a>(&'a self) -> Graphs<'a, T>
[src]
fn quads<'a>(&'a self) -> Quads<'a, T>
[src]
fn default_graph(&self) -> &Self::Graph
[src]
fn subjects<'a>(
&'a self,
id: Option<&T>
) -> Option<<<Self::Graph as Graph<T>>::Iter as Iter<'a, T>>::Subjects>
[src]
&'a self,
id: Option<&T>
) -> Option<<<Self::Graph as Graph<T>>::Iter as Iter<'a, T>>::Subjects>
fn predicates<'a>(
&'a self,
id: Option<&T>,
subject: &T
) -> Option<<<Self::Graph as Graph<T>>::Iter as Iter<'a, T>>::Predicates>
[src]
&'a self,
id: Option<&T>,
subject: &T
) -> Option<<<Self::Graph as Graph<T>>::Iter as Iter<'a, T>>::Predicates>
fn objects<'a>(
&'a self,
id: Option<&T>,
subject: &T,
predicate: &T
) -> Option<<<Self::Graph as Graph<T>>::Iter as Iter<'a, T>>::Objects>
[src]
&'a self,
id: Option<&T>,
subject: &T,
predicate: &T
) -> Option<<<Self::Graph as Graph<T>>::Iter as Iter<'a, T>>::Objects>
impl<T: Hash + Eq> Default for HashDataset<T>
[src]
fn default() -> HashDataset<T>
[src]
impl<T: 'static + Hash + Eq> MutableDataset<T> for HashDataset<T>
[src]
type GraphsMut = GraphsMut<'a, T>
Iterator over mutable graphs.
fn graph_mut(&mut self, id: Option<&T>) -> Option<&mut Self::Graph>
[src]
fn graphs_mut<'a>(&'a mut self) -> Self::GraphsMut
[src]
fn insert_graph(&mut self, id: T, graph: Self::Graph) -> Option<Self::Graph>
[src]
fn insert(&mut self, quad: Quad<T>)
[src]
fn absorb<D: SizedDataset<T>>(&mut self, other: D) where
D::Graph: SizedGraph<T>,
[src]
D::Graph: SizedGraph<T>,
fn default_graph_mut(&mut self) -> &mut Self::Graph
[src]
impl<T: 'static + Clone + Hash + Eq> SizedDataset<T> for HashDataset<T>
[src]
type IntoGraphs = IntoGraphs<T>
Consuming graphs iterator.
type IntoQuads = IntoQuads<T>
Consuming quads iterator.
fn into_graph(self, id: Option<&T>) -> Option<Self::Graph>
[src]
fn into_graphs(self) -> Self::IntoGraphs
[src]
fn into_quads(self) -> Self::IntoQuads
[src]
fn into_default_graph(self) -> Self::Graph
[src]
fn subjects(
self,
id: Option<&T>
) -> Option<<Self::Graph as SizedGraph<T>>::IntoSubjects>
[src]
self,
id: Option<&T>
) -> Option<<Self::Graph as SizedGraph<T>>::IntoSubjects>
fn predicates(
self,
id: Option<&T>,
subject: &T
) -> Option<<Self::Graph as SizedGraph<T>>::IntoPredicates>
[src]
self,
id: Option<&T>,
subject: &T
) -> Option<<Self::Graph as SizedGraph<T>>::IntoPredicates>
fn objects(
self,
id: Option<&T>,
subject: &T,
predicate: &T
) -> Option<<Self::Graph as SizedGraph<T>>::IntoObjects>
[src]
self,
id: Option<&T>,
subject: &T,
predicate: &T
) -> Option<<Self::Graph as SizedGraph<T>>::IntoObjects>
Auto Trait Implementations
impl<T> RefUnwindSafe for HashDataset<T> where
T: RefUnwindSafe,
T: RefUnwindSafe,
impl<T> Send for HashDataset<T> where
T: Send,
T: Send,
impl<T> Sync for HashDataset<T> where
T: Sync,
T: Sync,
impl<T> Unpin for HashDataset<T> where
T: Unpin,
T: Unpin,
impl<T> UnwindSafe for HashDataset<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<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>,