pub struct DatasetPathAdapter<'a> { /* private fields */ }Expand description
Adapter to make Dataset implement PathDataset
Implementations§
Trait Implementations§
Source§impl<'a> PathDataset for DatasetPathAdapter<'a>
impl<'a> PathDataset for DatasetPathAdapter<'a>
Source§fn find_outgoing(
&self,
subject: &AlgebraTerm,
predicate: &AlgebraTerm,
) -> Result<Vec<AlgebraTerm>>
fn find_outgoing( &self, subject: &AlgebraTerm, predicate: &AlgebraTerm, ) -> Result<Vec<AlgebraTerm>>
Find all triples matching subject and predicate
Source§fn find_incoming(
&self,
predicate: &AlgebraTerm,
object: &AlgebraTerm,
) -> Result<Vec<AlgebraTerm>>
fn find_incoming( &self, predicate: &AlgebraTerm, object: &AlgebraTerm, ) -> Result<Vec<AlgebraTerm>>
Find all triples matching predicate and object
Source§fn find_predicates(
&self,
subject: &AlgebraTerm,
object: &AlgebraTerm,
) -> Result<Vec<AlgebraTerm>>
fn find_predicates( &self, subject: &AlgebraTerm, object: &AlgebraTerm, ) -> Result<Vec<AlgebraTerm>>
Find all predicates between subject and object
Source§fn get_predicates(&self) -> Result<Vec<AlgebraTerm>>
fn get_predicates(&self) -> Result<Vec<AlgebraTerm>>
Get all distinct predicates in the dataset
Source§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
Auto Trait Implementations§
impl<'a> !RefUnwindSafe for DatasetPathAdapter<'a>
impl<'a> !UnwindSafe for DatasetPathAdapter<'a>
impl<'a> Freeze for DatasetPathAdapter<'a>
impl<'a> Send for DatasetPathAdapter<'a>
impl<'a> Sync for DatasetPathAdapter<'a>
impl<'a> Unpin for DatasetPathAdapter<'a>
impl<'a> UnsafeUnpin for DatasetPathAdapter<'a>
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> 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.