Struct json_ld_syntax::Object

pub struct Object<M = ()> { /* private fields */ }

Object.

Implementations

impl<M> Object<M>

pub fn new() -> Object<M>

pub fn from_vec(entries: Vec<Entry<M>, Global>) -> Object<M>

pub fn capacity(&self) -> usize

pub fn len(&self) -> usize

pub fn is_empty(&self) -> bool

pub fn entries(&self) -> &[Entry<M>]

pub fn iter(&self) -> Iter<'_, Entry<M>>

pub fn iter_mut(&mut self) -> IterMut<'_, M>

pub fn get<Q>(&self, key: &Q) -> Values<'_, M> where Q: Hash + Equivalent<SmallString<[u8; 16]>> + ?Sized,

Returns an iterator over the values matching the given key.

Runs in O(1) (average).

pub fn get_mut<Q>(&mut self, key: &Q) -> ValuesMut<'_, M> where Q: Hash + Equivalent<SmallString<[u8; 16]>> + ?Sized,

Returns an iterator over the values matching the given key.

Runs in O(1) (average).

pub fn get_unique<Q>( &self, key: &Q ) -> Result<Option<&Meta<Value<M>, M>>, Duplicate<&Entry<M>>>where Q: Hash + Equivalent<SmallString<[u8; 16]>> + ?Sized,

Returns the unique entry value matching the given key.

Returns an error if multiple entries match the key.

Runs in O(1) (average).

pub fn get_unique_mut<Q>( &mut self, key: &Q ) -> Result<Option<&mut Meta<Value<M>, M>>, Duplicate<&Entry<M>>>where Q: Hash + Equivalent<SmallString<[u8; 16]>> + ?Sized,

Returns the unique entry value matching the given key.

Returns an error if multiple entries match the key.

Runs in O(1) (average).

pub fn get_entries<Q>(&self, key: &Q) -> Entries<'_, M> where Q: Hash + Equivalent<SmallString<[u8; 16]>> + ?Sized,

Returns an iterator over the entries matching the given key.

Runs in O(1) (average).

pub fn get_unique_entry<Q>( &self, key: &Q ) -> Result<Option<&Entry<M>>, Duplicate<&Entry<M>>>where Q: Hash + Equivalent<SmallString<[u8; 16]>> + ?Sized,

Returns the unique entry matching the given key.

Returns an error if multiple entries match the key.

Runs in O(1) (average).

pub fn get_with_index<Q>(&self, key: &Q) -> ValuesWithIndex<'_, M> where Q: Hash + Equivalent<SmallString<[u8; 16]>> + ?Sized,

Returns an iterator over the entries matching the given key.

Runs in O(1) (average).

pub fn get_entries_with_index<Q>(&self, key: &Q) -> EntriesWithIndex<'_, M> where Q: Hash + Equivalent<SmallString<[u8; 16]>> + ?Sized,

Returns an iterator over the entries matching the given key.

Runs in O(1) (average).

pub fn index_of<Q>(&self, key: &Q) -> Option<usize>where Q: Hash + Equivalent<SmallString<[u8; 16]>> + ?Sized,

pub fn redundant_index_of<Q>(&self, key: &Q) -> Option<usize>where Q: Hash + Equivalent<SmallString<[u8; 16]>> + ?Sized,

pub fn indexes_of<Q>(&self, key: &Q) -> Indexes<'_> where Q: Hash + Equivalent<SmallString<[u8; 16]>> + ?Sized,

pub fn first(&self) -> Option<&Entry<M>>

pub fn last(&self) -> Option<&Entry<M>>

pub fn push( &mut self, key: Meta<SmallString<[u8; 16]>, M>, value: Meta<Value<M>, M> ) -> bool

Push the given key-value pair to the end of the object.

Returns true if the key was not already present in the object, and false otherwise. Any previous entry matching the key is not overridden: duplicates are preserved, in order.

Runs in O(1).

pub fn push_entry(&mut self, entry: Entry<M>) -> bool

pub fn remove_at(&mut self, index: usize) -> Option<Entry<M>>

Removes the entry at the given index.

pub fn insert( &mut self, key: Meta<SmallString<[u8; 16]>, M>, value: Meta<Value<M>, M> ) -> Option<RemovedByInsertion<'_, M>>

Inserts the given key-value pair.

If one or more entries are already matching the given key, all of them are removed and returned in the resulting iterator. Otherwise, None is returned.

pub fn remove<Q, 'q>(&mut self, key: &'q Q) -> RemovedEntries<'_, 'q, M, Q> where Q: Hash + Equivalent<SmallString<[u8; 16]>> + ?Sized,

Remove all entries associated to the given key.

Runs in O(n) time (average).

pub fn remove_unique<Q>( &mut self, key: &Q ) -> Result<Option<Entry<M>>, Duplicate<Entry<M>>>where Q: Hash + Equivalent<SmallString<[u8; 16]>> + ?Sized,

Remove the unique entry associated to the given key.

Returns an error if multiple entries match the key.

Runs in O(n) time (average).

pub fn map_metadata<N>(self, f: impl FnMut(M) -> N) -> Object<N>

Recursively maps the metadata inside the object.

pub fn try_map_metadata<N, E>( self, f: impl FnMut(M) -> Result<N, E> ) -> Result<Object<N>, E>

Tries to recursively maps the metadata inside the object.

pub fn sort(&mut self)

Sort the entries by key name.

Entries with the same key are sorted by value.

Trait Implementations

impl<M> Clone for Object<M>where M: Clone,

fn clone(&self) -> Object<M>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<M> Debug for Object<M>where M: Debug,

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

Formats the value using the given formatter.

impl<M> Default for Object<M>

fn default() -> Object<M>

Returns the “default value” for a type.

impl<M> Extend<(Meta<SmallString<[u8; 16]>, M>, Meta<Value<M>, M>)> for Object<M>

fn extend<I>(&mut self, iter: I)where I: IntoIterator<Item = (Meta<SmallString<[u8; 16]>, M>, Meta<Value<M>, M>)>,

Extends a collection with the contents of an iterator.

fn extend_one(&mut self, item: A)

🔬This is a nightly-only experimental API. (extend_one)

Extends a collection with exactly one element.

fn extend_reserve(&mut self, additional: usize)

🔬This is a nightly-only experimental API. (extend_one)

Reserves capacity in a collection for the given number of additional elements.

impl<M> Extend<Entry<M>> for Object<M>

fn extend<I>(&mut self, iter: I)where I: IntoIterator<Item = Entry<M>>,

Extends a collection with the contents of an iterator.

fn extend_one(&mut self, item: A)

🔬This is a nightly-only experimental API. (extend_one)

Extends a collection with exactly one element.

fn extend_reserve(&mut self, additional: usize)

🔬This is a nightly-only experimental API. (extend_one)

Reserves capacity in a collection for the given number of additional elements.

impl<M> From<Object<M>> for Value<M>

fn from(o: Object<M>) -> Value<M>

Converts to this type from the input type.

impl<M> From<Vec<Entry<M>, Global>> for Object<M>

fn from(entries: Vec<Entry<M>, Global>) -> Object<M>

Converts to this type from the input type.

impl<M> FromIterator<(Meta<SmallString<[u8; 16]>, M>, Meta<Value<M>, M>)> for Object<M>

fn from_iter<I>(iter: I) -> Object<M>where I: IntoIterator<Item = (Meta<SmallString<[u8; 16]>, M>, Meta<Value<M>, M>)>,

Creates a value from an iterator.

impl<M> FromIterator<Entry<M>> for Object<M>

fn from_iter<I>(iter: I) -> Object<M>where I: IntoIterator<Item = Entry<M>>,

Creates a value from an iterator.

impl<M> Hash for Object<M>where M: Hash,

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

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<'a, M> IntoIterator for &'a Object<M>

type Item = &'a Entry<M>

The type of the elements being iterated over.

type IntoIter = Iter<'a, Entry<M>>

Which kind of iterator are we turning this into?

fn into_iter(self) -> <&'a Object<M> as IntoIterator>::IntoIter

Creates an iterator from a value.

impl<'a, M> IntoIterator for &'a mut Object<M>

type Item = (&'a Meta<SmallString<[u8; 16]>, M>, &'a mut Meta<Value<M>, M>)

The type of the elements being iterated over.

type IntoIter = IterMut<'a, M>

Which kind of iterator are we turning this into?

fn into_iter(self) -> <&'a mut Object<M> as IntoIterator>::IntoIter

Creates an iterator from a value.

impl<M> IntoIterator for Object<M>

type Item = Entry<M>

The type of the elements being iterated over.

type IntoIter = IntoIter<Entry<M>, Global>

Which kind of iterator are we turning this into?

fn into_iter(self) -> <Object<M> as IntoIterator>::IntoIter

Creates an iterator from a value.

impl<M> Ord for Object<M>where M: Ord,

fn cmp(&self, other: &Object<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<M> PartialEq<Object<M>> for Object<M>where M: PartialEq<M>,

fn eq(&self, other: &Object<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<M> PartialOrd<Object<M>> for Object<M>where M: PartialOrd<M>,

fn partial_cmp(&self, other: &Object<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<M> PrintWithSize for Object<M>

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

impl<M> StrippedHash for Object<M>

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

impl<M> StrippedOrd for Object<M>

fn stripped_cmp(&self, other: &Object<M>) -> Ordering

impl<M, __M> StrippedPartialEq<Object<__M>> for Object<M>

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

impl<M, __M> StrippedPartialOrd<Object<__M>> for Object<M>

fn stripped_partial_cmp(&self, other: &Object<__M>) -> Option<Ordering>

impl<M> UnorderedPartialEq for Object<M>where M: PartialEq<M>,

fn unordered_eq(&self, other: &Object<M>) -> bool

impl<M> Eq for Object<M>where M: Eq,

impl<M> StrippedEq for Object<M>

impl<M> UnorderedEq for Object<M>where M: Eq,