[−][src]Trait grdf::MutableDataset
Mutable dataset.
Associated Types
type GraphsMut: Iterator<Item = (Option<&'a T>, &'a mut Self::Graph)>
[src]
Iterator over mutable graphs.
Required methods
pub fn graph_mut(&mut self, id: Option<&T>) -> Option<&mut Self::Graph>
[src]
Get the given graph mutabily.
Use the input None
to get the default graph.
Note to implementors: the default graph should always exists.
pub fn graphs_mut<'a>(&'a mut self) -> Self::GraphsMut
[src]
Returns an iterator over the (mutable) graphs of the dataset.
pub fn insert_graph(&mut self, id: T, graph: Self::Graph) -> Option<Self::Graph>
[src]
Insert a graph in the dataset with the given name.
If a graph with the given name already exists, it is replaced and the previous graph definition is returned.
pub fn insert(&mut self, quad: Quad<T>)
[src]
Insert a quad in the dataset.
pub fn absorb<D: SizedDataset<T>>(&mut self, other: D) where
D::Graph: SizedGraph<T>,
[src]
D::Graph: SizedGraph<T>,
Absorb the given other dataset.
Adds all the quads of other
in the dataset.
Provided methods
pub fn default_graph_mut(&mut self) -> &mut Self::Graph
[src]
Get the default graph mutabily.
Note to implementors: the default graph should always exists.
Implementors
impl<T: 'static + Hash + Eq> MutableDataset<T> for HashDataset<T>
[src]
type GraphsMut = GraphsMut<'a, T>
pub fn graph_mut(&mut self, id: Option<&T>) -> Option<&mut Self::Graph>
[src]
pub fn graphs_mut<'a>(&'a mut self) -> Self::GraphsMut
[src]
pub fn insert_graph(&mut self, id: T, graph: Self::Graph) -> Option<Self::Graph>
[src]
pub fn insert(&mut self, quad: Quad<T>)
[src]
pub fn absorb<D: SizedDataset<T>>(&mut self, other: D) where
D::Graph: SizedGraph<T>,
[src]
D::Graph: SizedGraph<T>,