Skip to main content

MapView

Struct MapView 

Source
pub struct MapView<'a, K, V>(/* private fields */);
Available on crate feature zeroize only.
Expand description

A decoded map view that wipes owned entry storage on growth and drop. Lookup and duplicate-key handling match the ordinary map view.

Implementations§

Source§

impl<'a, K, V> MapView<'a, K, V>

Source

pub fn new(entries: Vec<(K, V)>) -> Self

Adopt an existing allocation without shrinking it.

Source

pub fn push(&mut self, key: K, value: V)

Append a wire entry, retaining last-occurrence lookup semantics.

Methods from Deref<Target = MapView<'a, K, V>>§

Source

pub fn len(&self) -> usize

Returns the number of entries (including duplicates).

Source

pub fn is_empty(&self) -> bool

Returns true if there are no entries.

Source

pub fn iter(&self) -> Iter<'_, (K, V)> ⓘ

Iterate over all entries in wire order.

If duplicate keys exist, all occurrences are yielded.

Source

pub fn keys(&self) -> impl Iterator<Item = &K>

Iterate over all keys in wire order.

Source

pub fn values(&self) -> impl Iterator<Item = &V>

Iterate over all values in wire order.

Source

pub fn get<Q>(&self, key: &Q) -> Option<&V>
where K: Borrow<Q>, Q: PartialEq + ?Sized,

Look up a value by key, returning the last occurrence (last-write-wins).

Accepts any type that K can borrow as, so map.get("key") works when K is &str. O(n) scan.

Source

pub fn contains_key<Q>(&self, key: &Q) -> bool
where K: Borrow<Q>, Q: PartialEq + ?Sized,

Returns true if an entry with the given key exists.

Source

pub fn iter_unique(&self) -> impl ExactSizeIterator<Item = &(K, V)>
where K: Ord,

Iterate over key-value pairs with duplicate keys removed.

Each distinct key is yielded exactly once, at the position of its last wire occurrence, carrying that occurrence’s value — i.e. last-write-wins, mirroring the merge semantics that an owned HashMap decode applies. Callers that need first-occurrence position should use iter and filter themselves.

Used by the generated view Serialize impl: a JSON object cannot hold duplicate keys, but MapView preserves all wire entries (including malformed duplicates), so the JSON encode path must deduplicate.

The work happens when this is called, not lazily: it sorts an index vector, O(n log n) over the wire-entry count regardless of how many entries are duplicates, allocating one Vec<usize>. Survivors are yielded in wire order. A map with at most one entry skips the sort.

§Panics

Only if K’s Ord is not a total order, in which case the underlying sort_unstable_by may panic.

Source

pub fn len_unique(&self) -> usize
where K: Ord,

Count of distinct keys (iter_unique().len()). Same cost as iter_unique; a caller that needs both should call iter_unique once and take its len().

§Panics

As iter_unique.

Trait Implementations§

Source§

impl<'a, K: Clone, V: Clone> Clone for MapView<'a, K, V>

Source§

fn clone(&self) -> Self

Returns a duplicate of the value. Read more
1.0.0 (const: unstable) · Source§

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

Performs copy-assignment from source. Read more
Source§

impl<K, V> Debug for MapView<'_, K, V>

Source§

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

Formats the value using the given formatter. Read more
Source§

impl<K, V> Default for MapView<'_, K, V>

Source§

fn default() -> Self

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

impl<'a, K, V> Deref for MapView<'a, K, V>

Source§

type Target = MapView<'a, K, V>

The resulting type after dereferencing.
Source§

fn deref(&self) -> &Self::Target

Dereferences the value.
Source§

impl<K, V> Drop for MapView<'_, K, V>

Source§

fn drop(&mut self)

Executes the destructor for this type. Read more
Source§

fn pin_drop(self: Pin<&mut Self>)

🔬This is a nightly-only experimental API. (pin_ergonomics)
Execute the destructor for this type, but different to Drop::drop, it requires self to be pinned. Read more
Source§

impl<'a, K: Eq, V: Eq> Eq for MapView<'a, K, V>

Source§

impl<K, V> From<Vec<(K, V)>> for MapView<'_, K, V>

Source§

fn from(entries: Vec<(K, V)>) -> Self

Converts to this type from the input type.
Source§

impl<K, V> FromIterator<(K, V)> for MapView<'_, K, V>

Source§

fn from_iter<I: IntoIterator<Item = (K, V)>>(source: I) -> Self

Creates a value from an iterator. Read more
Source§

impl<K, V> IntoIterator for MapView<'_, K, V>

Source§

type Item = (K, V)

The type of the elements being iterated over.
Source§

type IntoIter = IntoIter<(K, V)>

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<'b, K, V> IntoIterator for &'b MapView<'_, K, V>

Source§

type Item = &'b (K, V)

The type of the elements being iterated over.
Source§

type IntoIter = Iter<'b, (K, V)>

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<'a, K: PartialEq, V: PartialEq> PartialEq for MapView<'a, K, V>

Source§

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

Equality operator ==. Read more
1.0.0 (const: unstable) · Source§

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

Inequality operator !=. Read more
Source§

impl<'a, K: PartialEq, V: PartialEq> StructuralPartialEq for MapView<'a, K, V>

Source§

impl<K, V> Zeroize for MapView<'_, K, V>

Source§

fn zeroize(&mut self)

Zero out this object from memory using Rust intrinsics which ensure the zeroization operation is not “optimized away” by the compiler.
Source§

impl<K, V> ZeroizeOnDrop for MapView<'_, K, V>

Auto Trait Implementations§

§

impl<'a, K, V> Forget for MapView<'a, K, V>

§

impl<'a, K, V> Freeze for MapView<'a, K, V>
where MapView<'a, K, V>: Freeze,

§

impl<'a, K, V> Move for MapView<'a, K, V>

§

impl<'a, K, V> RefUnwindSafe for MapView<'a, K, V>
where MapView<'a, K, V>: RefUnwindSafe,

§

impl<'a, K, V> Send for MapView<'a, K, V>
where MapView<'a, K, V>: Send,

§

impl<'a, K, V> Sync for MapView<'a, K, V>
where MapView<'a, K, V>: Sync,

§

impl<'a, K, V> Unpin for MapView<'a, K, V>
where MapView<'a, K, V>: Unpin,

§

impl<'a, K, V> UnsafeUnpin for MapView<'a, K, V>
where MapView<'a, K, V>: UnsafeUnpin,

§

impl<'a, K, V> UnwindSafe for MapView<'a, K, V>
where MapView<'a, K, V>: UnwindSafe,

Blanket Implementations§

Source§

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

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

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

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

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

Source§

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

Mutably borrows from an owned value. Read more
Source§

impl<T> CloneToUninit for T
where T: Clone,

Source§

unsafe fn clone_to_uninit(&self, dest: *mut u8)

🔬This is a nightly-only experimental API. (clone_to_uninit)
Performs copy-assignment from self to dest. Read more
Source§

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

Source§

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

Checks if this value is equivalent to the given key. Read more
Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

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

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<P, T> Receiver for P
where P: Deref<Target = T> + ?Sized, T: ?Sized,

Source§

type Target = T

🔬This is a nightly-only experimental API. (arbitrary_self_types)
The target type on which the method may be called.
Source§

impl<T> ToOwned for T
where T: Clone,

Source§

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, U> TryFrom<U> for T
where U: Into<T>,

Source§

type Error = !

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, !>

Performs the conversion.
Source§

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

Source§

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

The type returned in the event of a conversion error.
Source§

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

Performs the conversion.