Struct grdf::hash_dataset::HashDataset

pub struct HashDataset<T: Hash + Eq> { /* fields omitted */ }

Implementations

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

pub fn new() -> Self

Trait Implementations

impl<T: 'static + Hash + Eq> Dataset<T> for HashDataset<T>

type Graph = HashGraph<T>

Type of graphs in the dataset.

type Graphs = Graphs<'a, T>

Graph iterator.

type Quads = Quads<'a, T>

Quads iterator.

pub fn graph(&self, id: Option<&T>) -> Option<&HashGraph<T>>

Get the graph with the given name. Input None to get the default graph.

pub fn graphs<'a>(&'a self) -> Graphs<'a, T>

Returns an iterator over the graphs of the dataset.

pub fn quads<'a>(&'a self) -> Quads<'a, T>

Returns an iterator over the quads of the dataset.

pub fn default_graph(&self) -> &Self::Graph

Get the default graph of the dataset.

pub fn subjects<'a>(
    &'a self,
    id: Option<&T>
) -> Option<<Self::Graph as Graph<T>>::Subjects> where
    Self::Graph: 'a,
    T: 'a, 

Iterate through all the subjects of the given graph.

pub fn predicates<'a>(
    &'a self,
    id: Option<&T>,
    subject: &T
) -> Option<<Self::Graph as Graph<T>>::Predicates> where
    Self::Graph: 'a,
    T: 'a, 

Iterate through all the predicates of the given subject of the given graph.

pub fn objects<'a>(
    &'a self,
    id: Option<&T>,
    subject: &T,
    predicate: &T
) -> Option<<Self::Graph as Graph<T>>::Objects> where
    Self::Graph: 'a,
    T: 'a, 

Iterate through all the objects of the given subect and predicate of the given graph.

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

pub fn default() -> HashDataset<T>

Returns the "default value" for a type.

impl<T: 'static + Hash + Eq> MutableDataset<T> for HashDataset<T>

type GraphsMut = GraphsMut<'a, T>

Iterator over mutable graphs.

pub fn graph_mut(&mut self, id: Option<&T>) -> Option<&mut Self::Graph>

Get the given graph mutabily.

pub fn graphs_mut<'a>(&'a mut self) -> Self::GraphsMut

Returns an iterator over the (mutable) graphs of the dataset.

pub fn insert_graph(&mut self, id: T, graph: Self::Graph) -> Option<Self::Graph>

Insert a graph in the dataset with the given name.

pub fn insert(&mut self, quad: Quad<T>)

Insert a quad in the dataset.

pub fn absorb<D: SizedDataset<T>>(&mut self, other: D) where
    D::Graph: SizedGraph<T>, 

Absorb the given other dataset.

pub fn default_graph_mut(&mut self) -> &mut Self::Graph

Get the default graph mutabily.

impl<T: 'static + Clone + Hash + Eq> SizedDataset<T> for HashDataset<T>

type IntoGraphs = IntoGraphs<T>

Consuming graphs iterator.

type IntoQuads = IntoQuads<T>

Consuming quads iterator.

pub fn into_graph(mut self: Self, id: Option<&T>) -> Option<Self::Graph>

Consumes the dataset and returns the given graph.

pub fn into_graphs(self) -> Self::IntoGraphs

Consumes the dataset and returns an iterator over its graphs.

pub fn into_quads(self) -> Self::IntoQuads

Consumes the dataset and returns an iterator over its quads.

pub fn into_default_graph(self) -> Self::Graph

Consumes the dataset and returns the default graph.

pub fn subjects(
    self,
    id: Option<&T>
) -> Option<<Self::Graph as SizedGraph<T>>::IntoSubjects>

Consumes the dataset and returns an iterator over the subjects of the given graph.

pub fn predicates(
    self,
    id: Option<&T>,
    subject: &T
) -> Option<<Self::Graph as SizedGraph<T>>::IntoPredicates>

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

pub fn objects(
    self,
    id: Option<&T>,
    subject: &T,
    predicate: &T
) -> Option<<Self::Graph as SizedGraph<T>>::IntoObjects>

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