pub struct Ref<T>(pub T);
Tuple Fields§
§0: T
Trait Implementations§
Source§impl<'de, T> Deserialize<'de> for Ref<T>where
T: Deserialize<'de>,
impl<'de, T> Deserialize<'de> for Ref<T>where
T: Deserialize<'de>,
Source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read more
Source§impl<I: Interpretation, V: Vocabulary, T: LinkedDataResource<I, V>> LinkedData<I, V> for Ref<T>
impl<I: Interpretation, V: Vocabulary, T: LinkedDataResource<I, V>> LinkedData<I, V> for Ref<T>
Source§impl<I: Interpretation, V: Vocabulary, T: LinkedDataResource<I, V>> LinkedDataGraph<I, V> for Ref<T>
impl<I: Interpretation, V: Vocabulary, T: LinkedDataResource<I, V>> LinkedDataGraph<I, V> for Ref<T>
fn visit_graph<S>(&self, visitor: S) -> Result<S::Ok, S::Error>where
S: GraphVisitor<I, V>,
Source§impl<I: Interpretation, V: Vocabulary, T: LinkedDataResource<I, V>> LinkedDataPredicateObjects<I, V> for Ref<T>
impl<I: Interpretation, V: Vocabulary, T: LinkedDataResource<I, V>> LinkedDataPredicateObjects<I, V> for Ref<T>
fn visit_objects<S>(&self, visitor: S) -> Result<S::Ok, S::Error>where
S: PredicateObjectsVisitor<I, V>,
Source§impl<I: Interpretation, V: Vocabulary, T: LinkedDataResource<I, V>> LinkedDataResource<I, V> for Ref<T>
impl<I: Interpretation, V: Vocabulary, T: LinkedDataResource<I, V>> LinkedDataResource<I, V> for Ref<T>
fn interpretation( &self, vocabulary: &mut V, interpretation: &mut I, ) -> ResourceInterpretation<'_, I, V>
fn lexical_representation<'a>( &'a self, vocabulary: &'a mut V, interpretation: &'a mut I, ) -> Option<CowRdfTerm<'a, V>>
fn reference_interpretation( &self, vocabulary: &mut V, interpretation: &mut I, ) -> ResourceInterpretation<'_, I, V>
Source§impl<I: Interpretation, V: Vocabulary, T> LinkedDataSubject<I, V> for Ref<T>
impl<I: Interpretation, V: Vocabulary, T> LinkedDataSubject<I, V> for Ref<T>
fn visit_subject<S>(&self, serializer: S) -> Result<S::Ok, S::Error>where
S: SubjectVisitor<I, V>,
Source§impl<T: Ord> Ord for Ref<T>
impl<T: Ord> Ord for Ref<T>
Source§impl<T: PartialOrd> PartialOrd for Ref<T>
impl<T: PartialOrd> PartialOrd for Ref<T>
impl<T: Copy> Copy for Ref<T>
impl<T: Eq> Eq for Ref<T>
impl<T> StructuralPartialEq for Ref<T>
Auto Trait Implementations§
impl<T> Freeze for Ref<T>where
T: Freeze,
impl<T> RefUnwindSafe for Ref<T>where
T: RefUnwindSafe,
impl<T> Send for Ref<T>where
T: Send,
impl<T> Sync for Ref<T>where
T: Sync,
impl<T> Unpin for Ref<T>where
T: Unpin,
impl<T> UnwindSafe for Ref<T>where
T: 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
fn as_unordered(&self) -> &Unordered<T>
Source§impl<T> CallHasher for T
impl<T> CallHasher for T
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<Q, K> Comparable<K> for Q
impl<Q, K> Comparable<K> for Q
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
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.