Struct sophia::dataset::inmem::HashDataset

pub struct HashDataset<I> where
    I: TermIndexMap,
    I::Index: Hash,
    <I::Factory as TermFactory>::TermData: 'static,  { /* fields omitted */ }

A generic implementation of Dataset and MutableDataset, storing its terms in a TermIndexMap, and its triples in a HashSet.

Methods

impl<I> HashDataset<I> where
    I: TermIndexMap,
    I::Index: Hash, 

pub fn new() -> HashDataset<I>

pub fn len(&self) -> usize

pub fn is_empty(&self) -> bool

Trait Implementations

impl<I> IndexedDataset for HashDataset<I> where
    I: TermIndexMap,
    I::Index: Hash,
    <I::Factory as TermFactory>::TermData: 'static, 

type Index = I::Index

The type used to represent terms internally.

type TermData = <I::Factory as TermFactory>::TermData

fn get_index<T>(&self, t: &Term<T>) -> Option<Self::Index> where
    T: TermData, 

Return the index for the given term, if it exists.

fn get_index_for_graph_name<T>(
    &self,
    g: Option<&Term<T>>
) -> Option<Self::Index> where
    T: TermData, 

Return the index for the given graph name, if it exists.

fn get_term(&self, i: Self::Index) -> Option<&Term<Self::TermData>>

Return the term for the given index, if it exists.

fn get_graph_name(
    &self,
    i: Self::Index
) -> Option<Option<&Term<Self::TermData>>>

Return the graph name for the given index, if it exists

fn insert_indexed<T, U, V, W>(
    &mut self,
    s: &Term<T>,
    p: &Term<U>,
    o: &Term<V>,
    g: Option<&Term<W>>
) -> Option<[I::Index; 4]> where
    T: TermData,
    U: TermData,
    V: TermData,
    W: TermData, 

Insert a triple in this Dataset, and return the corresponding tuple of indices.

fn remove_indexed<T, U, V, W>(
    &mut self,
    s: &Term<T>,
    p: &Term<U>,
    o: &Term<V>,
    g: Option<&Term<W>>
) -> Option<[I::Index; 4]> where
    T: TermData,
    U: TermData,
    V: TermData,
    W: TermData, 

Remove a triple from this Dataset, and return the corresponding tuple of indices.

fn shrink_to_fit(&mut self)

impl<'a, I> Dataset<'a> for HashDataset<I> where
    I: TermIndexMap,
    I::Index: Hash,
    <I::Factory as TermFactory>::TermData: 'static, 

type Quad = ([&'a Term<Self::TermData>; 3], Option<&'a Term<Self::TermData>>)

The type of Quads that the methods of this dataset will yield.

type Error = Never

The error type that this dataset may raise.

fn quads(&'a self) -> DQuadSource<'a, Self>

An iterator visiting all quads of this dataset in arbitrary order.

fn quads_with_s<T>(&'a self, s: &'a Term<T>) -> DQuadSource<'a, Self> where
    T: TermData, 

An iterator visiting all quads with the given subject.

fn quads_with_p<T>(&'a self, p: &'a Term<T>) -> DQuadSource<'a, Self> where
    T: TermData, 

An iterator visiting all quads with the given predicate.

fn quads_with_o<T>(&'a self, o: &'a Term<T>) -> DQuadSource<'a, Self> where
    T: TermData, 

An iterator visiting add quads with the given object.

fn quads_with_g<T>(&'a self, g: Option<&'a Term<T>>) -> DQuadSource<'a, Self> where
    T: TermData, 

An iterator visiting add quads with the given graph name.

fn quads_with_sp<T, U>(
    &'a self,
    s: &'a Term<T>,
    p: &'a Term<U>
) -> DQuadSource<'a, Self> where
    T: TermData,
    U: TermData, 

An iterator visiting add quads with the given subject and predicate.

fn quads_with_so<T, U>(
    &'a self,
    s: &'a Term<T>,
    o: &'a Term<U>
) -> DQuadSource<'a, Self> where
    T: TermData,
    U: TermData, 

An iterator visiting add quads with the given subject and object.

fn quads_with_sg<T, U>(
    &'a self,
    s: &'a Term<T>,
    g: Option<&'a Term<U>>
) -> DQuadSource<'a, Self> where
    T: TermData,
    U: TermData, 

An iterator visiting add quads with the given subject and graph name.

fn quads_with_po<T, U>(
    &'a self,
    p: &'a Term<T>,
    o: &'a Term<U>
) -> DQuadSource<'a, Self> where
    T: TermData,
    U: TermData, 

An iterator visiting add quads with the given predicate and object.

fn quads_with_pg<T, U>(
    &'a self,
    p: &'a Term<T>,
    g: Option<&'a Term<U>>
) -> DQuadSource<'a, Self> where
    T: TermData,
    U: TermData, 

An iterator visiting add quads with the given predicate and graph name.

fn quads_with_og<T, U>(
    &'a self,
    o: &'a Term<T>,
    g: Option<&'a Term<U>>
) -> DQuadSource<'a, Self> where
    T: TermData,
    U: TermData, 

An iterator visiting add quads with the given object and graph name.

fn quads_with_spo<T, U, V>(
    &'a self,
    s: &'a Term<T>,
    p: &'a Term<U>,
    o: &'a Term<V>
) -> DQuadSource<'a, Self> where
    T: TermData,
    U: TermData,
    V: TermData, 

An iterator visiting add quads with the given subject, predicate and object.

fn quads_with_spg<T, U, V>(
    &'a self,
    s: &'a Term<T>,
    p: &'a Term<U>,
    g: Option<&'a Term<V>>
) -> DQuadSource<'a, Self> where
    T: TermData,
    U: TermData,
    V: TermData, 

An iterator visiting add quads with the given subject, predicate and graph name.

fn quads_with_sog<T, U, V>(
    &'a self,
    s: &'a Term<T>,
    o: &'a Term<U>,
    g: Option<&'a Term<V>>
) -> DQuadSource<'a, Self> where
    T: TermData,
    U: TermData,
    V: TermData, 

An iterator visiting add quads with the given subject, object and graph name.

fn quads_with_pog<T, U, V>(
    &'a self,
    p: &'a Term<T>,
    o: &'a Term<U>,
    g: Option<&'a Term<V>>
) -> DQuadSource<'a, Self> where
    T: TermData,
    U: TermData,
    V: TermData, 

An iterator visiting add quads with the given predicate, object and graph name.

fn quads_with_spog<T, U, V, W>(
    &'a self,
    s: &'a Term<T>,
    p: &'a Term<U>,
    o: &'a Term<V>,
    g: Option<&'a Term<W>>
) -> DQuadSource<'a, Self> where
    T: TermData,
    U: TermData,
    V: TermData,
    W: TermData, 

An iterator visiting add quads with the given subject, predicate, object and graph name.

fn contains<T, U, V, W>(
    &'a self,
    s: &'a Term<T>,
    p: &'a Term<U>,
    o: &'a Term<V>,
    g: Option<&'a Term<W>>
) -> DResult<'a, Self, bool> where
    T: TermData,
    U: TermData,
    V: TermData,
    W: TermData, 

Return true if this dataset contains the given quad.

fn quads_matching<S: ?Sized, P: ?Sized, O: ?Sized, G: ?Sized>(
    &'a self,
    ms: &'a S,
    mp: &'a P,
    mo: &'a O,
    mg: &'a G
) -> DQuadSource<'a, Self> where
    S: TermMatcher,
    P: TermMatcher,
    O: TermMatcher,
    G: GraphNameMatcher, 

An iterator visiting add quads matching the given subject, predicate, object and graph name.

fn subjects(&'a self) -> DResultTermSet<'a, Self>

Build a Hashset of all the terms used as subject in this Dataset.

fn predicates(&'a self) -> DResultTermSet<'a, Self>

Build a Hashset of all the terms used as predicate in this Dataset.

fn objects(&'a self) -> DResultTermSet<'a, Self>

Build a Hashset of all the terms used as object in this Dataset.

fn graph_names(&'a self) -> DResultTermSet<'a, Self>

Build a Hashset of all the terms used as graph names in this Dataset.

fn iris(&'a self) -> DResultTermSet<'a, Self>

Build a Hashset of all the IRIs used in this Dataset.

fn bnodes(&'a self) -> DResultTermSet<'a, Self>

Build a Hashset of all the BNodes used in this Dataset.

fn literals(&'a self) -> DResultTermSet<'a, Self>

Build a Hashset of all the Literals used in this Dataset.

fn variables(&'a self) -> DResultTermSet<'a, Self>

Build a Hashset of all the variables used in this Dataset.

fn graph<T>(
    &self,
    graph_name: Option<&Term<T>>
) -> DatasetGraph<Self, &Self, Option<BoxTerm>> where
    T: TermData, 

Borrows one of the graphs of this dataset

fn graph_mut<T>(
    &mut self,
    graph_name: Option<&Term<T>>
) -> DatasetGraph<Self, &mut Self, Option<BoxTerm>> where
    T: TermData, 

Borrows mutably one of the graphs of this dataset

fn union_graph<T>(&'a self, gmatcher: T) -> DatasetGraph<Self, &Self, T> where
    T: GraphNameMatcher, 

Borrows a graph containing the union of all graphs matched by gmatcher

impl<I> MutableDataset for HashDataset<I> where
    I: TermIndexMap,
    I::Index: Hash,
    <I::Factory as TermFactory>::TermData: 'static, 

type MutationError = Never

The error type that this dataset may raise during mutations.

fn insert<T_, U_, V_, W_>(
    &mut self,
    s: &Term<T_>,
    p: &Term<U_>,
    o: &Term<V_>,
    g: Option<&Term<W_>>
) -> MDResult<Self, bool> where
    T_: TermData,
    U_: TermData,
    V_: TermData,
    W_: TermData, 

Insert the given quad in this dataset.

fn remove<T_, U_, V_, W_>(
    &mut self,
    s: &Term<T_>,
    p: &Term<U_>,
    o: &Term<V_>,
    g: Option<&Term<W_>>
) -> MDResult<Self, bool> where
    T_: TermData,
    U_: TermData,
    V_: TermData,
    W_: TermData, 

Remove the given quad in this dataset.

fn inserter(&mut self) -> Inserter<Self>

Return a QuadSink that will insert into this dataset all the quads it receives.

fn insert_all<'a, TS>(
    &mut self,
    src: &mut TS
) -> CoercedResult<usize, TS::Error, Self::MutationError> where
    TS: QuadSource<'a>,
    TS::Error: CoercibleWith<Self::MutationError>, 

Insert into this dataset all quads from the given source.

fn remover(&mut self) -> Remover<Self>

Return a QuadSink that will remove from this dataset all the quads it receives.

fn remove_all<'a, TS>(
    &mut self,
    src: &mut TS
) -> CoercedResult<usize, TS::Error, Self::MutationError> where
    TS: QuadSource<'a>,
    TS::Error: CoercibleWith<Self::MutationError>, 

Remove from this dataset all quads from the given source.

fn remove_matching<S: ?Sized, P: ?Sized, O: ?Sized, G: ?Sized>(
    &mut self,
    ms: &S,
    mp: &P,
    mo: &O,
    mg: &G
) -> MDResult<Self, usize> where
    S: TermMatcher,
    P: TermMatcher,
    O: TermMatcher,
    G: GraphNameMatcher,
    Self::Error: Into<Self::MutationError>,
    Never: CoercibleWith<Self::MutationError>,
    Self::MutationError: From<CoercedError<Never, Self::MutationError>>, 

Remove all quads matching the given matchers.

fn retain<S: ?Sized, P: ?Sized, O: ?Sized, G: ?Sized>(
    &mut self,
    ms: &S,
    mp: &P,
    mo: &O,
    mg: &G
) -> MDResult<Self, ()> where
    S: TermMatcher,
    P: TermMatcher,
    O: TermMatcher,
    G: GraphNameMatcher,
    Self::Error: Into<Self::MutationError>,
    Never: CoercibleWith<Self::MutationError>,
    Self::MutationError: From<CoercedError<Never, Self::MutationError>>, 

Keep only the quads matching the given matchers.

impl<I> SetDataset for HashDataset<I> where
    I: TermIndexMap,
    I::Index: Hash, 

impl<I: Default> Default for HashDataset<I> where
    I: TermIndexMap,
    I::Index: Hash,
    <I::Factory as TermFactory>::TermData: 'static,
    I::Index: Default, 

fn default() -> HashDataset<I>

Returns the "default value" for a type.