pub struct DContext<G, WG>where
G: InfallibleGraph,
WG: Borrow<G>,{ /* private fields */ }Expand description
A type alias for acp access context description.
Implementations§
Source§impl<G, WG> DContext<G, WG>where
G: InfallibleGraph,
WG: Borrow<G>,
impl<G, WG> DContext<G, WG>where
G: InfallibleGraph,
WG: Borrow<G>,
Sourcepub fn into_parts(self) -> (HContext<ArcTerm>, WG)
pub fn into_parts(self) -> (HContext<ArcTerm>, WG)
Convert into parts.
Source§impl<G: InfallibleGraph> DContext<G, G>
impl<G: InfallibleGraph> DContext<G, G>
Sourcepub fn into_with_arced_graph(self) -> DContext<G, Arc<G>>
pub fn into_with_arced_graph(self) -> DContext<G, Arc<G>>
Convert into nre context with inner graph wrapped in an arc.
Trait Implementations§
Source§impl<G, WG> Description for DContext<G, WG>
impl<G, WG> Description for DContext<G, WG>
Source§impl<G, WG> MutableDescription for DContext<G, WG>
impl<G, WG> MutableDescription for DContext<G, WG>
Source§impl<G, WG> SimpleDescription for DContext<G, WG>
impl<G, WG> SimpleDescription for DContext<G, WG>
Auto Trait Implementations§
impl<G, WG> Freeze for DContext<G, WG>where
WG: Freeze,
impl<G, WG> RefUnwindSafe for DContext<G, WG>where
WG: RefUnwindSafe,
impl<G, WG> Send for DContext<G, WG>where
WG: Send,
impl<G, WG> Sync for DContext<G, WG>where
WG: Sync,
impl<G, WG> Unpin for DContext<G, WG>where
WG: Unpin,
impl<G, WG> UnwindSafe for DContext<G, WG>where
WG: UnwindSafe,
Blanket Implementations§
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
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<D> DescriptionExt for Dwhere
D: Description,
impl<D> DescriptionExt for Dwhere
D: Description,
Source§fn get_all_triples<'g, TP>(
&'g self,
p: &'g TP,
) -> UnwrappingIterator<'g, Self::Graph>where
TP: Term,
fn get_all_triples<'g, TP>(
&'g self,
p: &'g TP,
) -> UnwrappingIterator<'g, Self::Graph>where
TP: Term,
Get all triples about the subject with given predicate.
Source§fn get_all<'g, TP>(&'g self, p: &'g TP) -> ObjectIterator<'g, Self::Graph>where
TP: Term,
fn get_all<'g, TP>(&'g self, p: &'g TP) -> ObjectIterator<'g, Self::Graph>where
TP: Term,
Get all objects of triples about the subject with given
predicate.
Source§fn get_all_handles<'g, H, TP>(
&'g self,
p: &'g TP,
) -> OwnedObjectHandleIterator<'g, Self::Graph, H>
fn get_all_handles<'g, H, TP>( &'g self, p: &'g TP, ) -> OwnedObjectHandleIterator<'g, Self::Graph, H>
Get handles to all objects of triples about the subject
with given predicate.
Source§fn get_first<'g, TP>(
&'g self,
p: &'g TP,
) -> Option<<<Self::Graph as Graph>::Triple<'g> as Triple>::Term>where
TP: Term,
fn get_first<'g, TP>(
&'g self,
p: &'g TP,
) -> Option<<<Self::Graph as Graph>::Triple<'g> as Triple>::Term>where
TP: Term,
Get object of first triple about the subject with given
predicate.
Source§fn get_first_handle<'g, H, TP>(&'g self, p: &'g TP) -> Option<H>
fn get_first_handle<'g, H, TP>(&'g self, p: &'g TP) -> Option<H>
Get handle to object of first triple about the subject
with given predicate.
Source§fn has_any<'g, TP>(&'g self, p: &'g TP) -> boolwhere
TP: Term,
fn has_any<'g, TP>(&'g self, p: &'g TP) -> boolwhere
TP: Term,
Check if there exist a triple about the subject with
given predicate.
Source§fn has_any_with<'g, TP, TO>(&'g self, p: &'g TP, o: &'g TO) -> bool
fn has_any_with<'g, TP, TO>(&'g self, p: &'g TP, o: &'g TO) -> bool
Check if there exist a triple about the subject with
given predicate and given object.
Source§fn has_common<'g, TP1, TP2>(&'g self, p1: &'g TP1, p2: &'g TP2) -> bool
fn has_common<'g, TP1, TP2>(&'g self, p1: &'g TP1, p2: &'g TP2) -> bool
Check if there are triples about the subject with given
predicates with common object.
Source§fn add<'s, TP, TO>(&'s mut self, p: &'s TP, o: &'s TO) -> bool
fn add<'s, TP, TO>(&'s mut self, p: &'s TP, o: &'s TO) -> bool
Add a statement about the subject with given predicate
and object to the description.
Returns if the addition actually changed the graph.
Return value is significant only if backing graph is
also a
SetGraph.Source§fn add_all<'s, G, TP, TO>(
&'s mut self,
po_iter: impl Iterator<Item = (&'s TP, &'s TO)>,
) -> usize
fn add_all<'s, G, TP, TO>( &'s mut self, po_iter: impl Iterator<Item = (&'s TP, &'s TO)>, ) -> usize
Add statements about subject with given predicate,
object pairs ro given graph. Read more
Source§fn add_all_with<'s, TP, TO>(
&'s mut self,
p: &TP,
o_iter: impl Iterator<Item = &'s TO>,
) -> usize
fn add_all_with<'s, TP, TO>( &'s mut self, p: &TP, o_iter: impl Iterator<Item = &'s TO>, ) -> usize
Add statements about resource with given predicate, and
each of object.
Source§fn remove<'s, TP, TO>(&'s mut self, p: &'s TP, o: &'s TO) -> bool
fn remove<'s, TP, TO>(&'s mut self, p: &'s TP, o: &'s TO) -> bool
Remove any statement about the subject with given predicate and object from given graph.
Returns if the removal actually changed the graph.
Return value is significant only if
G is also a
SetGraph.Source§fn remove_all<'s, TP, TO>(
&'s mut self,
po_iter: impl Iterator<Item = (&'s TP, &'s TO)>,
) -> usize
fn remove_all<'s, TP, TO>( &'s mut self, po_iter: impl Iterator<Item = (&'s TP, &'s TO)>, ) -> usize
Remove statements about the subject with given
predicate, object pairs from given graph. Read more
Source§fn remove_all_with<'s, TP>(&'s mut self, p: &'s TP) -> usizewhere
Self: MutableDescription,
TP: Term,
fn remove_all_with<'s, TP>(&'s mut self, p: &'s TP) -> usizewhere
Self: MutableDescription,
TP: Term,
Remove any statements about the resource with given
predicate from given graph. Read more