#[repr(u8)]pub enum Ref<'a, T = IriBuf, B = BlankIdBuf> {
    Iri(&'a T),
    Blank(&'a B),
    Invalid(&'a str),
}Expand description
Id to a reference.
Variants§
Iri(&'a T)
Node identifier, essentially an IRI.
Blank(&'a B)
Blank node identifier.
Invalid(&'a str)
Invalid reference.
Trait Implementations§
source§impl<'a, T, B> PartialEq for Ref<'a, T, B>
 
impl<'a, T, B> PartialEq for Ref<'a, T, B>
impl<'a, T, B> Eq for Ref<'a, T, B>
impl<'a, T, B> StructuralPartialEq for Ref<'a, T, B>
Auto Trait Implementations§
impl<'a, T, B> Freeze for Ref<'a, T, B>
impl<'a, T, B> RefUnwindSafe for Ref<'a, T, B>where
    T: RefUnwindSafe,
    B: RefUnwindSafe,
impl<'a, T, B> Send for Ref<'a, T, B>
impl<'a, T, B> Sync for Ref<'a, T, B>
impl<'a, T, B> Unpin for Ref<'a, T, B>
impl<'a, T, B> UnwindSafe for Ref<'a, T, B>where
    T: RefUnwindSafe,
    B: RefUnwindSafe,
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§default unsafe fn clone_to_uninit(&self, dst: *mut T)
 
default unsafe fn clone_to_uninit(&self, dst: *mut T)
🔬This is a nightly-only experimental API. (
clone_to_uninit)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.