Struct json_ld_core::context::Definitions

source · [−]

pub struct Definitions<T, B, L, M> { /* private fields */ }

Implementations

source

impl<T, B, L, M> Definitions<T, B, L, M>

source

pub fn into_parts(
self
) -> (HashMap<Key, NormalTermDefinition<T, B, L, M>>, Option<TypeTermDefinition>)

source

pub fn len(&self) -> usize

source

pub fn is_empty(&self) -> bool

source

pub fn get<Q: ?Sized>(
 &self,
 key: &Q
) -> Option<TermDefinitionRef<'_, T, B, L, M>>where
 Q: Hash + Eq,
 Key: Borrow<Q>,
 KeywordType: Borrow<Q>,

source

pub fn get_normal<Q: ?Sized>(
 &self,
 key: &Q
) -> Option<&NormalTermDefinition<T, B, L, M>>where
 Q: Hash + Eq,
 Key: Borrow<Q>,

source

pub fn get_type(&self) -> Option<&TypeTermDefinition>

source

pub fn contains_key<Q: ?Sized>(&self, key: &Q) -> boolwhere
 Q: Hash + Eq,
 Key: Borrow<Q>,
 KeywordType: Borrow<Q>,

source

pub fn insert(
&mut self,
binding: Binding<T, B, L, M>
) -> Option<TermDefinition<T, B, L, M>>

source

pub fn insert_normal(
 &mut self,
 key: Key,
 definition: NormalTermDefinition<T, B, L, M>
) -> Option<NormalTermDefinition<T, B, L, M>>

source

pub fn insert_type(
&mut self,
definition: TypeTermDefinition
) -> Option<TypeTermDefinition>

source

pub fn set_normal(
 &mut self,
 key: Key,
 definition: Option<NormalTermDefinition<T, B, L, M>>
) -> Option<NormalTermDefinition<T, B, L, M>>

source

pub fn set_type(
&mut self,
definition: Option<TypeTermDefinition>
) -> Option<TypeTermDefinition>

source

pub fn iter(&self) -> Iter<'_, T, B, L, M>ⓘNotable traits for Iter<'a, T, B, L, M>`impl<'a, T, B, L, M> Iterator for Iter<'a, T, B, L, M> type Item = BindingRef<'a, T, B, L, M>;`

Trait Implementations

source

impl<T: Clone, B: Clone, L: Clone, M: Clone> Clone for Definitions<T, B, L, M>

source

fn clone(&self) -> Definitions<T, B, L, 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<T, B, L, M> Default for Definitions<T, B, L, M>

source

fn default() -> Self

Returns the “default value” for a type. Read more

source

impl<'a, T, B, L, M> IntoIterator for &'a Definitions<T, B, L, M>

type Item = BindingRef<'a, T, B, L, M>

The type of the elements being iterated over.

type IntoIter = Iter<'a, T, B, L, M>

Which kind of iterator are we turning this into?

source

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value. Read more

source

impl<T, B, L, M> IntoIterator for Definitions<T, B, L, M>

type Item = Binding<T, B, L, M>

The type of the elements being iterated over.

type IntoIter = IntoIter<T, B, L, M>

Which kind of iterator are we turning this into?

source

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value. Read more

Auto Trait Implementations

impl<T, B, L, M> RefUnwindSafe for Definitions<T, B, L, M>where
 B: RefUnwindSafe,
 L: RefUnwindSafe,
 M: RefUnwindSafe,
 T: RefUnwindSafe,

impl<T, B, L, M> Send for Definitions<T, B, L, M>where
 B: Send,
 L: Send,
 M: Send,
 T: Send,

impl<T, B, L, M> Sync for Definitions<T, B, L, M>where
 B: Sync,
 L: Sync,
 M: Sync,
 T: Sync,

impl<T, B, L, M> Unpin for Definitions<T, B, L, M>where
 B: Unpin,
 L: Unpin,
 M: Unpin,
 T: Unpin,

impl<T, B, L, M> UnwindSafe for Definitions<T, B, L, M>where
 B: UnwindSafe,
 L: UnwindSafe,
 M: UnwindSafe,
 T: UnwindSafe,

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

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

source

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

Struct json_ld_core::context::Definitions

Implementations

impl<T, B, L, M> Definitions<T, B, L, M>

pub fn into_parts( self) -> (HashMap<Key, NormalTermDefinition<T, B, L, M>>, Option<TypeTermDefinition>)

pub fn len(&self) -> usize

pub fn is_empty(&self) -> bool

pub fn get<Q: ?Sized>( &self, key: &Q) -> Option<TermDefinitionRef<'_, T, B, L, M>>where Q: Hash + Eq, Key: Borrow<Q>, KeywordType: Borrow<Q>,

pub fn get_normal<Q: ?Sized>( &self, key: &Q) -> Option<&NormalTermDefinition<T, B, L, M>>where Q: Hash + Eq, Key: Borrow<Q>,

pub fn get_type(&self) -> Option<&TypeTermDefinition>

pub fn contains_key<Q: ?Sized>(&self, key: &Q) -> boolwhere Q: Hash + Eq, Key: Borrow<Q>, KeywordType: Borrow<Q>,

pub fn insert( &mut self, binding: Binding<T, B, L, M>) -> Option<TermDefinition<T, B, L, M>>

pub fn insert_normal( &mut self, key: Key, definition: NormalTermDefinition<T, B, L, M>) -> Option<NormalTermDefinition<T, B, L, M>>

pub fn insert_type( &mut self, definition: TypeTermDefinition) -> Option<TypeTermDefinition>

pub fn set_normal( &mut self, key: Key, definition: Option<NormalTermDefinition<T, B, L, M>>) -> Option<NormalTermDefinition<T, B, L, M>>

pub fn set_type( &mut self, definition: Option<TypeTermDefinition>) -> Option<TypeTermDefinition>

pub fn iter(&self) -> Iter<'_, T, B, L, M>ⓘNotable traits for Iter<'a, T, B, L, M>impl<'a, T, B, L, M> Iterator for Iter<'a, T, B, L, M> type Item = BindingRef<'a, T, B, L, M>;

Trait Implementations

impl<T: Clone, B: Clone, L: Clone, M: Clone> Clone for Definitions<T, B, L, M>

fn clone(&self) -> Definitions<T, B, L, M>

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

impl<T, B, L, M> Default for Definitions<T, B, L, M>

fn default() -> Self

impl<'a, T, B, L, M> IntoIterator for &'a Definitions<T, B, L, M>

type Item = BindingRef<'a, T, B, L, M>

type IntoIter = Iter<'a, T, B, L, M>

fn into_iter(self) -> Self::IntoIter

impl<T, B, L, M> IntoIterator for Definitions<T, B, L, M>

type Item = Binding<T, B, L, M>

type IntoIter = IntoIter<T, B, L, M>

fn into_iter(self) -> Self::IntoIter

Auto Trait Implementations

impl<T, B, L, M> RefUnwindSafe for Definitions<T, B, L, M>where B: RefUnwindSafe, L: RefUnwindSafe, M: RefUnwindSafe, T: RefUnwindSafe,

impl<T, B, L, M> Send for Definitions<T, B, L, M>where B: Send, L: Send, M: Send, T: Send,

impl<T, B, L, M> Sync for Definitions<T, B, L, M>where B: Sync, L: Sync, M: Sync, T: Sync,

impl<T, B, L, M> Unpin for Definitions<T, B, L, M>where B: Unpin, L: Unpin, M: Unpin, T: Unpin,

impl<T, B, L, M> UnwindSafe for Definitions<T, B, L, M>where B: UnwindSafe, L: UnwindSafe, M: UnwindSafe, T: UnwindSafe,

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<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>

pub fn into_parts(
self
) -> (HashMap<Key, NormalTermDefinition<T, B, L, M>>, Option<TypeTermDefinition>)

pub fn get<Q: ?Sized>(
&self,
key: &Q
) -> Option<TermDefinitionRef<'_, T, B, L, M>>where
Q: Hash + Eq,
Key: Borrow<Q>,
KeywordType: Borrow<Q>,

pub fn get_normal<Q: ?Sized>(
&self,
key: &Q
) -> Option<&NormalTermDefinition<T, B, L, M>>where
Q: Hash + Eq,
Key: Borrow<Q>,

pub fn contains_key<Q: ?Sized>(&self, key: &Q) -> boolwhere
Q: Hash + Eq,
Key: Borrow<Q>,
KeywordType: Borrow<Q>,

pub fn insert(
&mut self,
binding: Binding<T, B, L, M>
) -> Option<TermDefinition<T, B, L, M>>

pub fn insert_normal(
&mut self,
key: Key,
definition: NormalTermDefinition<T, B, L, M>
) -> Option<NormalTermDefinition<T, B, L, M>>

pub fn insert_type(
&mut self,
definition: TypeTermDefinition
) -> Option<TypeTermDefinition>

pub fn set_normal(
&mut self,
key: Key,
definition: Option<NormalTermDefinition<T, B, L, M>>
) -> Option<NormalTermDefinition<T, B, L, M>>

pub fn set_type(
&mut self,
definition: Option<TypeTermDefinition>
) -> Option<TypeTermDefinition>

pub fn iter(&self) -> Iter<'_, T, B, L, M>ⓘNotable traits for Iter<'a, T, B, L, M>`impl<'a, T, B, L, M> Iterator for Iter<'a, T, B, L, M> type Item = BindingRef<'a, T, B, L, M>;`

impl<T, B, L, M> RefUnwindSafe for Definitions<T, B, L, M>where
B: RefUnwindSafe,
L: RefUnwindSafe,
M: RefUnwindSafe,
T: RefUnwindSafe,

impl<T, B, L, M> Send for Definitions<T, B, L, M>where
B: Send,
L: Send,
M: Send,
T: Send,

impl<T, B, L, M> Sync for Definitions<T, B, L, M>where
B: Sync,
L: Sync,
M: Sync,
T: Sync,

impl<T, B, L, M> Unpin for Definitions<T, B, L, M>where
B: Unpin,
L: Unpin,
M: Unpin,
T: Unpin,

impl<T, B, L, M> UnwindSafe for Definitions<T, B, L, M>where
B: UnwindSafe,
L: UnwindSafe,
M: UnwindSafe,
T: UnwindSafe,

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<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,