Enum EntryKeyRef

pub enum EntryKeyRef<'a, T, B> {
    Id,
    Type,
    Graph,
    Included,
    Reverse,
    Property(&'a Id<T, B>),
}

Variants

Id

Type

Graph

Included

Reverse

Property(&'a Id<T, B>)

Implementations

impl<'a, T, B> EntryKeyRef<'a, T, B>

pub fn into_keyword(self) -> Option<Keyword>

pub fn as_keyword(&self) -> Option<Keyword>

pub fn into_str(self) -> &'a str

where T: AsRef<str>, B: AsRef<str>,

pub fn as_str(&self) -> &'a str

where T: AsRef<str>, B: AsRef<str>,

Trait Implementations

impl<'a, T, B> Clone for EntryKeyRef<'a, T, B>

fn clone(&self) -> Self

Returns a duplicate of the value.

fn clone_from(&mut self, _source: &Self)

Performs copy-assignment from source.

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> PartialEq for EntryKeyRef<'a, T, B>

fn eq(&self, other: &EntryKeyRef<'a, T, B>) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<'a, T, B> Copy for EntryKeyRef<'a, T, B>

impl<'a, T: Eq, B: Eq> Eq for EntryKeyRef<'a, T, B>

impl<'a, T, B> StructuralPartialEq for EntryKeyRef<'a, T, B>