Struct NonEmptyObject

Source

pub struct NonEmptyObject(/* private fields */);

Expand description

Non-empty JSON object.

Implementations§

Source §

pub fn get_mut<Q>(&mut self, key: &Q) -> ValuesMut<'_>
where Q: ?Sized + Hash + Equivalent<Key>,

Returns an iterator over the values matching the given key.

Runs in O(1) (average).

Source

pub fn get_unique_mut<Q>( &mut self, key: &Q, ) -> Result<Option<&mut Value>, Duplicate<&Entry>>
where Q: ?Sized + Hash + Equivalent<Key>,

Returns the unique entry value matching the given key.

Returns an error if multiple entries match the key.

Runs in O(1) (average).

Source

pub fn get_or_insert_with<Q>( &mut self, key: &Q, f: impl FnOnce() -> Value, ) -> &Value
where Q: ?Sized + Hash + Equivalent<Key> + ToOwned, Q::Owned: Into<Key>,

Returns the (first) value associated to key, or insert a key-value entry where value is returned by the given function f.

Source

pub fn get_mut_or_insert_with<Q>( &mut self, key: &Q, f: impl FnOnce() -> Value, ) -> &mut Value
where Q: ?Sized + Hash + Equivalent<Key> + ToOwned, Q::Owned: Into<Key>,

Returns a mutable reference to the (first) value associated to key, or insert a key-value entry where value is returned by the given function f.

Source

pub fn push(&mut self, key: Key, value: Value) -> 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).

Source

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

Source

pub fn push_front(&mut self, key: Key, value: Value) -> bool

Push the given key-value pair to the top 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(n).

Source

pub fn push_entry_front(&mut self, entry: Entry) -> bool

Source

pub fn insert( &mut self, key: Key, value: Value, ) -> Option<RemovedByInsertion<'_>>

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.

Source

pub fn insert_front( &mut self, key: Key, value: Value, ) -> RemovedByInsertFront<'_>

Inserts the given key-value pair on top of the object.

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

Source

pub fn sort(&mut self)

Sort the entries by key name.

Entries with the same key are sorted by value.

Source

pub fn try_remove_at( &mut self, index: usize, ) -> Result<Option<Entry>, EmptyObject>

Tries to remove the entry at the given index.

Returns an error if this would leave the object empty.

Source

pub fn try_remove<'q, Q>( &mut self, key: &'q Q, ) -> Result<RemovedEntries<'_, 'q, Q>, EmptyObject>
where Q: ?Sized + Hash + Equivalent<Key>,

Tries to remove all entries associated to the given key.

Returns an error if this would leave the object empty.

Runs in O(n) time (average).

Source

pub fn try_remove_unique<Q>( &mut self, key: &Q, ) -> Result<Option<Entry>, RemoveUniqueError>
where Q: ?Sized + Hash + Equivalent<Key>,

Tries to remove the unique entry associated to the given key.

Returns an error if multiple entries match the key, or if the object would be left empty.

Runs in O(n) time (average).

Methods from Deref<Target = Object>§

Source

pub fn capacity(&self) -> usize

Source

pub fn len(&self) -> usize

Source

pub fn is_empty(&self) -> bool

Source

pub fn get_fragment(&self, index: usize) -> Result<FragmentRef<'_>, usize>

Source

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

Source

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

Source

pub fn iter_mapped<'m>( &self, code_map: &'m CodeMap, offset: usize, ) -> IterMapped<'_, 'm>

Source

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

Checks if this object contains the given key.

Runs in O(1) (average).

Source

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

Returns an iterator over the values matching the given key.

Runs in O(1) (average).

Source

pub fn get_unique<Q>( &self, key: &Q, ) -> Result<Option<&Value>, Duplicate<&Entry>>
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).

Source

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

Returns an iterator over the entries matching the given key.

Runs in O(1) (average).

Source

pub fn get_unique_entry<Q>( &self, key: &Q, ) -> Result<Option<&Entry>, Duplicate<&Entry>>
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).

Source

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

Returns an iterator over the values matching the given key.

Runs in O(1) (average).

Source

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

Returns an iterator over the entries matching the given key.

Runs in O(1) (average).

Source

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

Source

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

Source