pub struct InMemoryDataset { /* private fields */ }Expand description
In-memory dataset implementation for testing.
Each stored triple carries an optional graph label: None places it in the
default graph, Some(iri) in the named graph iri. This lets the in-memory
dataset exercise GRAPH / FROM scoping without a backing quad store.
Implementations§
Source§impl InMemoryDataset
impl InMemoryDataset
pub fn new() -> Self
Sourcepub fn add_triple(
&mut self,
subject: AlgebraTerm,
predicate: AlgebraTerm,
object: AlgebraTerm,
)
pub fn add_triple( &mut self, subject: AlgebraTerm, predicate: AlgebraTerm, object: AlgebraTerm, )
Add a triple to the default graph.
Sourcepub fn add_triple_in_graph(
&mut self,
graph: NamedNode,
subject: AlgebraTerm,
predicate: AlgebraTerm,
object: AlgebraTerm,
)
pub fn add_triple_in_graph( &mut self, graph: NamedNode, subject: AlgebraTerm, predicate: AlgebraTerm, object: AlgebraTerm, )
Add a triple to the named graph graph.
Sourcepub fn from_triples(
triples: Vec<(AlgebraTerm, AlgebraTerm, AlgebraTerm)>,
) -> Self
pub fn from_triples( triples: Vec<(AlgebraTerm, AlgebraTerm, AlgebraTerm)>, ) -> Self
Build a default-graph-only dataset from a list of triples.
Trait Implementations§
Source§impl Clone for InMemoryDataset
impl Clone for InMemoryDataset
Source§fn clone(&self) -> InMemoryDataset
fn clone(&self) -> InMemoryDataset
Returns a duplicate of the value. Read more
1.0.0 (const: unstable) · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source. Read moreSource§impl Dataset for InMemoryDataset
impl Dataset for InMemoryDataset
Source§fn find_triples(
&self,
pattern: &TriplePattern,
) -> Result<Vec<(AlgebraTerm, AlgebraTerm, AlgebraTerm)>>
fn find_triples( &self, pattern: &TriplePattern, ) -> Result<Vec<(AlgebraTerm, AlgebraTerm, AlgebraTerm)>>
Find all triples matching the given pattern in the dataset’s active
default graph. Read more
Source§fn find_triples_in(
&self,
selector: &GraphSelector,
pattern: &TriplePattern,
) -> Result<Vec<(AlgebraTerm, AlgebraTerm, AlgebraTerm)>>
fn find_triples_in( &self, selector: &GraphSelector, pattern: &TriplePattern, ) -> Result<Vec<(AlgebraTerm, AlgebraTerm, AlgebraTerm)>>
Source§fn has_graph_support(&self) -> bool
fn has_graph_support(&self) -> bool
Whether this dataset can honor graph-scoped access
(
Dataset::find_triples_in) and named-graph enumeration
(Dataset::named_graphs). Read moreSource§fn named_graphs(&self) -> Result<Vec<AlgebraTerm>>
fn named_graphs(&self) -> Result<Vec<AlgebraTerm>>
Enumerate the named graphs visible in this dataset, as
Term::Iri
values, for GRAPH ?g evaluation. Read moreSource§fn contains_triple(
&self,
subject: &AlgebraTerm,
predicate: &AlgebraTerm,
object: &AlgebraTerm,
) -> Result<bool>
fn contains_triple( &self, subject: &AlgebraTerm, predicate: &AlgebraTerm, object: &AlgebraTerm, ) -> Result<bool>
Check if a triple exists in the dataset
Source§fn predicates(&self) -> Result<Vec<AlgebraTerm>>
fn predicates(&self) -> Result<Vec<AlgebraTerm>>
Get all predicates in the dataset
Source§impl Debug for InMemoryDataset
impl Debug for InMemoryDataset
Source§impl Default for InMemoryDataset
impl Default for InMemoryDataset
Source§fn default() -> InMemoryDataset
fn default() -> InMemoryDataset
Returns the “default value” for a type. Read more
Auto Trait Implementations§
impl Freeze for InMemoryDataset
impl RefUnwindSafe for InMemoryDataset
impl Send for InMemoryDataset
impl Sync for InMemoryDataset
impl Unpin for InMemoryDataset
impl UnsafeUnpin for InMemoryDataset
impl UnwindSafe for InMemoryDataset
Blanket Implementations§
Source§impl<'a, T, E> AsTaggedExplicit<'a, E> for Twhere
T: 'a,
impl<'a, T, E> AsTaggedExplicit<'a, E> for Twhere
T: 'a,
Source§impl<'a, T, E> AsTaggedImplicit<'a, E> for Twhere
T: 'a,
impl<'a, T, E> AsTaggedImplicit<'a, E> for Twhere
T: 'a,
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
impl<ST, DT> CastableFrom<ST, Initialized, Initialized> for DT
impl<ST, DT> CastableFrom<ST, Uninit, Uninit> for DT
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<T> Downcast for Twhere
T: Any,
impl<T> Downcast for Twhere
T: Any,
Source§fn into_any(self: Box<T>) -> Box<dyn Any>
fn into_any(self: Box<T>) -> Box<dyn Any>
Converts
Box<dyn Trait> (where Trait: Downcast) to Box<dyn Any>, which can then be
downcast into Box<dyn ConcreteType> where ConcreteType implements Trait.Source§fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>
fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>
Converts
Rc<Trait> (where Trait: Downcast) to Rc<Any>, which can then be further
downcast into Rc<ConcreteType> where ConcreteType implements Trait.Source§fn as_any(&self) -> &(dyn Any + 'static)
fn as_any(&self) -> &(dyn Any + 'static)
Converts
&Trait (where Trait: Downcast) to &Any. This is needed since Rust cannot
generate &Any’s vtable from &Trait’s.Source§fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
Converts
&mut Trait (where Trait: Downcast) to &Any. This is needed since Rust cannot
generate &mut Any’s vtable from &mut Trait’s.Source§impl<T> DowncastSend for T
impl<T> DowncastSend for T
Source§impl<T> DowncastSync for T
impl<T> DowncastSync for T
impl<T> Fruit for T
Source§impl<T> Instrument for T
impl<T> Instrument for T
Source§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
Source§fn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left is true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left(&self) returns true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§impl<T> Pointable for T
impl<T> Pointable for T
Source§impl<T> PolicyExt for Twhere
T: ?Sized,
impl<T> PolicyExt for Twhere
T: ?Sized,
impl<T> Read<Exclusive, BecauseExclusive> for Twhere
T: ?Sized,
Source§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
Source§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self from the equivalent element of its
superset. Read moreSource§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
Checks if
self is actually part of its subset T (and can be converted to it).Source§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
Use with care! Same as
self.to_subset but without any property checks. Always succeeds.Source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.