Enum json_ld::object::node::IndexedEntryKeyRef

source · [−]

pub enum IndexedEntryKeyRef<'a, T, B, M> {
    Index,
    Node(EntryKeyRef<'a, T, B, M>),
}

Variants

`Index`

`Node(EntryKeyRef<'a, T, B, M>)`

Implementations

source

pub fn as_str(&self) -> &'a strwhere
T: AsRef<str>,
B: AsRef<str>,

Trait Implementations

source

impl<'a, T, B, M> Clone for IndexedEntryKeyRef<'a, T, B, M>

source

fn clone(&self) -> IndexedEntryKeyRef<'a, T, B, M>

Returns a copy of the value. Read more

1.0.0 · source

const fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source. Read more

source

impl<'a, T, B, N, M> IntoRefWithContext<'a, str, N> for IndexedEntryKeyRef<'a, T, B, M>where
N: Vocabulary<Iri = T, BlankId = B>,

source

fn into_ref_with(self, vocabulary: &'a N) -> &'a str

source

impl<'a, T, B, M> PartialEq<IndexedEntryKeyRef<'a, T, B, M>> for IndexedEntryKeyRef<'a, T, B, M>where
 T: PartialEq<T>,
 B: PartialEq,
 M: PartialEq<M>,

source

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

This method tests for self and other values to be equal, and is used by ==. Read more

1.0.0 · source

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

This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason. Read more

source

impl<'a, T, B, M> Copy for IndexedEntryKeyRef<'a, T, B, M>

source

impl<'a, T, B, M> Eq for IndexedEntryKeyRef<'a, T, B, M>where
 T: Eq,
 B: Eq,
 M: Eq,

source

impl<'a, T, B, M> StructuralEq for IndexedEntryKeyRef<'a, T, B, M>

source

impl<'a, T, B, M> StructuralPartialEq for IndexedEntryKeyRef<'a, T, B, M>

Auto Trait Implementations

impl<'a, T, B, M> RefUnwindSafe for IndexedEntryKeyRef<'a, T, B, M>where
 B: RefUnwindSafe,
 M: RefUnwindSafe,
 T: RefUnwindSafe,

impl<'a, T, B, M> Send for IndexedEntryKeyRef<'a, T, B, M>where
 B: Sync,
 M: Sync,
 T: Sync,

impl<'a, T, B, M> Sync for IndexedEntryKeyRef<'a, T, B, M>where
 B: Sync,
 M: Sync,
 T: Sync,

impl<'a, T, B, M> Unpin for IndexedEntryKeyRef<'a, T, B, M>

impl<'a, T, B, M> UnwindSafe for IndexedEntryKeyRef<'a, T, B, M>where
 B: RefUnwindSafe,
 M: RefUnwindSafe,
 T: RefUnwindSafe,

Blanket Implementations

source

impl<T> Any for Twhere
T: 'static + ?Sized,

source

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more

source

impl<T> At for T

source

fn at<M>(self, metadata: M) -> Meta<T, M>

Wraps self inside a Meta<Self, M> using the given metadata. Read more

source

impl<T> Borrow<T> for Twhere
T: ?Sized,

const: unstable · source

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more

source

impl<T> BorrowMut<T> for Twhere
T: ?Sized,

const: unstable · source

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more

source

impl<T> BorrowStripped for T

source

fn stripped(&self) -> &Stripped<T>

source

impl<T> BorrowUnordered for T

source

fn unordered(&self) -> &Unordered<T>

source

impl<Q, K> Equivalent<K> for Qwhere
Q: Eq + ?Sized,
K: Borrow<Q> + ?Sized,

source

fn equivalent(&self, key: &K) -> bool

source

impl<Q, K> Equivalent<K> for Qwhere
Q: Eq + ?Sized,
K: Borrow<Q> + ?Sized,

source

fn equivalent(&self, key: &K) -> bool

Compare self to key and return true if they are equal.

source

impl<T> From<T> for T

const: unstable · source

fn from(t: T) -> T

Returns the argument unchanged.

source

impl<T, U> Into for Twhere
U: From<T>,

const: unstable · source

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

source

impl<T, B> IntoId<T, B> for T

type Id = Id<T, B>

The target type of the conversion, which can be borrowed as a Id<T, B>.

source

fn to_ref(self) -> <T as IntoId<T, B>>::Id

Convert the value into a reference.

source

impl<T> ToOwned for Twhere
T: Clone,

type Owned = T

The resulting type after obtaining ownership.

source

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more

source

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more

impl<T> ToOwned for T

type Owned = T

source

impl<T, U> TryFrom for Twhere
U: Into<T>,

type Error = Infallible

The type returned in the event of a conversion error.

const: unstable · source

fn try_from(value: U) -> Result<T, <T as TryFrom>::Error>

Performs the conversion.

source

impl<T, U> TryInto for Twhere
U: TryFrom<T>,

type Error = >::Error

The type returned in the event of a conversion error.

const: unstable · source

fn try_into(self) -> Result<U, >::Error>

Performs the conversion.

source

impl<T> WithContext for Twhere
T: ?Sized,

source

fn with<C>(&self, context: C) -> Contextual<&T, C>

source

Enum json_ld::object::node::IndexedEntryKeyRef

Variants

Index

Node(EntryKeyRef<'a, T, B, M>)

Implementations

impl<'a, T, B, M> IndexedEntryKeyRef<'a, T, B, M>

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

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

pub fn into_str(self) -> &'a strwhere T: AsRef<str>, B: AsRef<str>,

pub fn as_str(&self) -> &'a strwhere T: AsRef<str>, B: AsRef<str>,

Trait Implementations

impl<'a, T, B, M> Clone for IndexedEntryKeyRef<'a, T, B, M>

fn clone(&self) -> IndexedEntryKeyRef<'a, T, B, M>

const fn clone_from(&mut self, source: &Self)

impl<'a, T, B, N, M> IntoRefWithContext<'a, str, N> for IndexedEntryKeyRef<'a, T, B, M>where N: Vocabulary<Iri = T, BlankId = B>,

fn into_ref_with(self, vocabulary: &'a N) -> &'a str

impl<'a, T, B, M> PartialEq<IndexedEntryKeyRef<'a, T, B, M>> for IndexedEntryKeyRef<'a, T, B, M>where T: PartialEq<T>, B: PartialEq<B>, M: PartialEq<M>,

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

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

impl<'a, T, B, M> Copy for IndexedEntryKeyRef<'a, T, B, M>

impl<'a, T, B, M> Eq for IndexedEntryKeyRef<'a, T, B, M>where T: Eq, B: Eq, M: Eq,

impl<'a, T, B, M> StructuralEq for IndexedEntryKeyRef<'a, T, B, M>

impl<'a, T, B, M> StructuralPartialEq for IndexedEntryKeyRef<'a, T, B, M>

Auto Trait Implementations

impl<'a, T, B, M> RefUnwindSafe for IndexedEntryKeyRef<'a, T, B, M>where B: RefUnwindSafe, M: RefUnwindSafe, T: RefUnwindSafe,

impl<'a, T, B, M> Send for IndexedEntryKeyRef<'a, T, B, M>where B: Sync, M: Sync, T: Sync,

impl<'a, T, B, M> Sync for IndexedEntryKeyRef<'a, T, B, M>where B: Sync, M: Sync, T: Sync,

impl<'a, T, B, M> Unpin for IndexedEntryKeyRef<'a, T, B, M>

impl<'a, T, B, M> UnwindSafe for IndexedEntryKeyRef<'a, T, B, M>where B: RefUnwindSafe, M: RefUnwindSafe, T: RefUnwindSafe,

Blanket Implementations

impl<T> Any for Twhere T: 'static + ?Sized,

fn type_id(&self) -> TypeId

impl<T> At for T

fn at<M>(self, metadata: M) -> Meta<T, M>

impl<T> Borrow<T> for Twhere T: ?Sized,

fn borrow(&self) -> &T

impl<T> BorrowMut<T> for Twhere T: ?Sized,

fn borrow_mut(&mut self) -> &mut T

impl<T> BorrowStripped for T

fn stripped(&self) -> &Stripped<T>

impl<T> BorrowUnordered for T

fn unordered(&self) -> &Unordered<T>

impl<Q, K> Equivalent<K> for Qwhere Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,

fn equivalent(&self, key: &K) -> bool

impl<Q, K> Equivalent<K> for Qwhere Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,

fn equivalent(&self, key: &K) -> bool

impl<T> From<T> for T

fn from(t: T) -> T

impl<T, U> Into<U> for Twhere U: From<T>,

fn into(self) -> U

impl<T, B> IntoId<T, B> for T

type Id = Id<T, B>

fn to_ref(self) -> <T as IntoId<T, B>>::Id

impl<T> ToOwned for Twhere T: Clone,

type Owned = T

fn to_owned(&self) -> T

fn clone_into(&self, target: &mut T)

impl<T> ToOwned for T

type Owned = T

impl<T, U> TryFrom<U> for Twhere U: Into<T>,

type Error = Infallible

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

impl<T, U> TryInto<U> for Twhere U: TryFrom<T>,

type Error = <U as TryFrom<T>>::Error

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

impl<T> WithContext for Twhere T: ?Sized,

fn with<C>(&self, context: C) -> Contextual<&T, C>

fn into_with<C>(self, context: C) -> Contextual<T, C>

`Index`

`Node(EntryKeyRef<'a, T, B, M>)`

pub fn into_str(self) -> &'a strwhere
T: AsRef<str>,
B: AsRef<str>,

pub fn as_str(&self) -> &'a strwhere
T: AsRef<str>,
B: AsRef<str>,

impl<'a, T, B, N, M> IntoRefWithContext<'a, str, N> for IndexedEntryKeyRef<'a, T, B, M>where
N: Vocabulary<Iri = T, BlankId = B>,

impl<'a, T, B, M> PartialEq<IndexedEntryKeyRef<'a, T, B, M>> for IndexedEntryKeyRef<'a, T, B, M>where
T: PartialEq<T>,
B: PartialEq<B>,
M: PartialEq<M>,

impl<'a, T, B, M> Eq for IndexedEntryKeyRef<'a, T, B, M>where
T: Eq,
B: Eq,
M: Eq,

impl<'a, T, B, M> RefUnwindSafe for IndexedEntryKeyRef<'a, T, B, M>where
B: RefUnwindSafe,
M: RefUnwindSafe,
T: RefUnwindSafe,

impl<'a, T, B, M> Send for IndexedEntryKeyRef<'a, T, B, M>where
B: Sync,
M: Sync,
T: Sync,

impl<'a, T, B, M> Sync for IndexedEntryKeyRef<'a, T, B, M>where
B: Sync,
M: Sync,
T: Sync,

impl<'a, T, B, M> UnwindSafe for IndexedEntryKeyRef<'a, T, B, M>where
B: RefUnwindSafe,
M: RefUnwindSafe,
T: RefUnwindSafe,

impl<T> Any for Twhere
T: 'static + ?Sized,

impl<T> Borrow<T> for Twhere
T: ?Sized,

impl<T> BorrowMut<T> for Twhere
T: ?Sized,

impl<Q, K> Equivalent<K> for Qwhere
Q: Eq + ?Sized,
K: Borrow<Q> + ?Sized,

impl<Q, K> Equivalent<K> for Qwhere
Q: Eq + ?Sized,
K: Borrow<Q> + ?Sized,

impl<T, U> Into<U> for Twhere
U: From<T>,

impl<T> ToOwned for Twhere
T: Clone,

impl<T, U> TryFrom<U> for Twhere
U: Into<T>,

impl<T, U> TryInto<U> for Twhere
U: TryFrom<T>,

impl<T> WithContext for Twhere
T: ?Sized,