Struct json_ld_core::Indexed

pub struct Indexed<T, M> { /* private fields */ }

Indexed objects.

Nodes and value objects may be indexed by a string in JSON-LD. This type is a wrapper around any kind of indexable data.

It is a pointer type that Deref into the underlying value.

Implementations

impl<T, M> Indexed<T, M>

pub fn new(value: T, index: Option<Entry<String, M>>) -> Indexed<T, M>

Create a new (maybe) indexed value.

pub fn inner(&self) -> &T

Get a reference to the inner value.

pub fn inner_mut(&mut self) -> &mut T

pub fn into_inner(self) -> T

Drop the index and return the underlying value.

pub fn index(&self) -> Option<&str>

Get the index, if any.

pub fn index_entry(&self) -> Option<&Entry<String, M>>

Get the index entry, if any.

pub fn set_index(&mut self, index: Option<Entry<String, M>>)

Set the value index.

pub fn into_parts(self) -> (T, Option<Entry<String, M>>)

Turn this indexed value into its components: inner value and index.

pub fn map_inner<U, F>(self, f: F) -> Indexed<U, M>where
    F: FnOnce(T) -> U,

Cast the inner value.

pub fn cast<U: From<T>>(self) -> Indexed<U, M>

Cast the inner value.

pub fn try_cast<U: TryFrom<T>>(
    self
) -> Result<Indexed<U, M>, Indexed<U::Error, M>>

Try to cast the inner value.

impl<T, B, M> Indexed<Node<T, B, M>, M>

pub fn entries(&self) -> IndexedEntries<'_, T, B, M>

impl<T: Eq + Hash, B: Eq + Hash, M> Indexed<Node<T, B, M>, M>

pub fn equivalent(&self, other: &Self) -> bool

impl<T: Eq + Hash, B: Eq + Hash, M> Indexed<Object<T, B, M>, M>

pub fn equivalent(&self, other: &Self) -> bool

impl<T, B, M> Indexed<Object<T, B, M>, M>

pub fn into_indexed_node(self) -> Option<Indexed<Node<T, B, M>, M>>

Converts this indexed object into an indexed node, if it is one.

pub fn into_indexed_value(self) -> Option<Indexed<Value<T, M>, M>>

Converts this indexed object into an indexed node, if it is one.

pub fn into_indexed_list(self) -> Option<Indexed<List<T, B, M>, M>>

Converts this indexed object into an indexed list, if it is one.

pub fn into_unnamed_graph(self) -> Result<Meta<Graph<T, B, M>, M>, Self>

Try to convert this object into an unnamed graph.

pub fn entries(&self) -> IndexedEntries<'_, T, B, M>

Trait Implementations

impl<T, M> AsMut<T> for Indexed<T, M>

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

Converts this type into a mutable reference of the (usually inferred) input type.

impl<T, M> AsRef<T> for Indexed<T, M>

fn as_ref(&self) -> &T

Converts this type into a shared reference of the (usually inferred) input type.

impl<T: Clone, M: Clone> Clone for Indexed<T, M>

fn clone(&self) -> Indexed<T, M>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<T: Debug, M: Debug> Debug for Indexed<T, M>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<T, M> Deref for Indexed<T, M>

type Target = T

The resulting type after dereferencing.

fn deref(&self) -> &T

Dereferences the value.

impl<T, M> DerefMut for Indexed<T, M>

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

Mutably dereferences the value.

impl<T, M> From<T> for Indexed<T, M>

fn from(value: T) -> Indexed<T, M>

Converts to this type from the input type.

impl<T: Hash, M: Hash> Hash for Indexed<T, M>

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)where
    H: Hasher,
    Self: Sized,

Feeds a slice of this type into the given Hasher.

impl<T: IntoJsonWithContextMeta<M, N>, M, N> IntoJsonWithContextMeta<M, N> for Indexed<T, M>

fn into_json_meta_with(self, meta: M, vocabulary: &N) -> Meta<Value<M>, M>

impl<T: MappedEq, M> MappedEq<Indexed<T, M>> for Indexed<T, M>

type BlankId = <T as MappedEq<T>>::BlankId

fn mapped_eq<'a, 'b, F: Clone + Fn(&'a Self::BlankId) -> &'b Self::BlankId>(
    &'a self,
    other: &Self,
    f: F
) -> boolwhere
    Self::BlankId: 'a + 'b,

Structural equality with mapped blank identifiers.

impl<T: Ord, M: Ord> Ord for Indexed<T, M>

fn cmp(&self, other: &Indexed<T, M>) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Selfwhere
    Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Selfwhere
    Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Selfwhere
    Self: Sized + PartialOrd<Self>,

Restrict a value to a certain interval.

impl<T: PartialEq, M: PartialEq> PartialEq<Indexed<T, M>> for Indexed<T, M>

fn eq(&self, other: &Indexed<T, M>) -> bool

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

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.

impl<T: PartialOrd, M: PartialOrd> PartialOrd<Indexed<T, M>> for Indexed<T, M>

fn partial_cmp(&self, other: &Indexed<T, M>) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

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

This method tests less than (for self and other) and is used by the < operator.

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

This method tests less than or equal to (for self and other) and is used by the <= operator.

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

This method tests greater than (for self and other) and is used by the > operator.

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

This method tests greater than or equal to (for self and other) and is used by the >= operator.

impl<T, B, M, N: Vocabulary<Iri = T, BlankId = B>> PrecomputeSizeWithContext<N> for Indexed<Node<T, B, M>, M>

fn contextual_pre_compute_size(
    &self,
    vocabulary: &N,
    options: &Options,
    sizes: &mut Vec<Size>
) -> Size

impl<T, B, M, N: Vocabulary<Iri = T, BlankId = B>> PrecomputeSizeWithContext<N> for Indexed<Object<T, B, M>, M>

fn contextual_pre_compute_size(
    &self,
    vocabulary: &N,
    options: &Options,
    sizes: &mut Vec<Size>
) -> Size

impl<T, B, M, N: Vocabulary<Iri = T, BlankId = B>> PrintWithSizeAndContext<N> for Indexed<Node<T, B, M>, M>

fn contextual_fmt_with_size(
    &self,
    vocabulary: &N,
    f: &mut Formatter<'_>,
    options: &Options,
    indent: usize,
    sizes: &[Size],
    index: &mut usize
) -> Result

impl<T, B, M, N: Vocabulary<Iri = T, BlankId = B>> PrintWithSizeAndContext<N> for Indexed<Object<T, B, M>, M>

fn contextual_fmt_with_size(
    &self,
    vocabulary: &N,
    f: &mut Formatter<'_>,
    options: &Options,
    indent: usize,
    sizes: &[Size],
    index: &mut usize
) -> Result

impl<T: StrippedHash, M> StrippedHash for Indexed<T, M>

fn stripped_hash<H: Hasher>(&self, state: &mut H)

impl<T: StrippedPartialEq<__T>, M, __T, __M> StrippedPartialEq<Indexed<__T, __M>> for Indexed<T, M>

fn stripped_eq(&self, other: &Indexed<__T, __M>) -> bool

impl<T, B, M, O: TryFromJsonObject<T, B, M>> TryFromJson<T, B, M> for Indexed<O, M>

fn try_from_json_in(
    vocabulary: &mut impl VocabularyMut<Iri = T, BlankId = B>,
    Meta: Meta<Value<M>, M>
) -> Result<Meta<Self, M>, Meta<InvalidExpandedJson<M>, M>>

impl<T, B, M, O: TryFromJsonObject<T, B, M>> TryFromJsonObject<T, B, M> for Indexed<O, M>

fn try_from_json_object_in(
    vocabulary: &mut impl VocabularyMut<Iri = T, BlankId = B>,
    Meta: Meta<Object<M>, M>
) -> Result<Meta<Self, M>, Meta<InvalidExpandedJson<M>, M>>

impl<T: Eq, M: Eq> Eq for Indexed<T, M>

impl<T: StrippedEq, M> StrippedEq for Indexed<T, M>

impl<T, M> StructuralEq for Indexed<T, M>

impl<T, M> StructuralPartialEq for Indexed<T, M>