pub enum EntryKeyRef<'a, T, B> {
Id,
Type,
Graph,
Included,
Reverse,
Property(&'a Id<T, B>),
}Expand description
Key of a node object entry.
Variants§
Id
The @id entry, identifying the node or mapping the term to an IRI.
Type
The @type entry, giving the type of the node or the values.
Graph
The @graph entry, holding the node objects of a named graph.
Included
The @included entry, holding node objects included alongside this one.
Reverse
The @reverse entry, mapping the term to a reverse property.
Property(&'a Id<T, B>)
A property of a node object.
Implementations§
Source§impl<'a, T, B> EntryKeyRef<'a, T, B>
impl<'a, T, B> EntryKeyRef<'a, T, B>
Trait Implementations§
Source§impl<'a, T, B> Clone for EntryKeyRef<'a, T, B>
impl<'a, T, B> Clone for EntryKeyRef<'a, T, B>
impl<'a, T, B> Copy for EntryKeyRef<'a, T, B>
impl<'a, T: Eq, B: Eq> Eq for EntryKeyRef<'a, T, B>
Source§impl<'a, T, B, N: Vocabulary<Iri = T, BlankId = B>> IntoRefWithContext<'a, str, N> for EntryKeyRef<'a, T, B>
impl<'a, T, B, N: Vocabulary<Iri = T, BlankId = B>> IntoRefWithContext<'a, str, N> for EntryKeyRef<'a, T, B>
fn into_ref_with(self, vocabulary: &'a N) -> &'a str
impl<'a, T: PartialEq, B: PartialEq> StructuralPartialEq for EntryKeyRef<'a, T, B>
Auto Trait Implementations§
impl<'a, T, B> Freeze for EntryKeyRef<'a, T, B>
impl<'a, T, B> RefUnwindSafe for EntryKeyRef<'a, T, B>where
&'a Id<T, B>: RefUnwindSafe,
impl<'a, T, B> Send for EntryKeyRef<'a, T, B>
impl<'a, T, B> Sync for EntryKeyRef<'a, T, B>
impl<'a, T, B> Unpin for EntryKeyRef<'a, T, B>
impl<'a, T, B> UnsafeUnpin for EntryKeyRef<'a, T, B>where
&'a Id<T, B>: UnsafeUnpin,
impl<'a, T, B> UnwindSafe for EntryKeyRef<'a, T, B>where
&'a Id<T, B>: 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> BorrowUnordered for T
impl<T> BorrowUnordered for T
Source§fn as_unordered(&self) -> &Unordered<T>
fn as_unordered(&self) -> &Unordered<T>
Views this value as an
Unordered reference.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<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Checks if
self is equivalent to key.Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Compare self to
key and return true if they are equal.