Skip to main content

MapView

Struct MapView 

Source
pub struct MapView<'a, K, V> { /* private fields */ }
Expand description

A borrowed view of a map field.

Protobuf map<K, V> fields are encoded as repeated sub-messages, each containing a key (field 1) and value (field 2). This type stores the decoded entries in a Vec<(K, V)>, borrowing string and bytes keys/values directly from the input buffer.

Lookup is O(n) linear scan, which is appropriate for the typically small maps found in protobuf messages (metadata labels, headers, etc.). If duplicate keys appear on the wire, get returns the last occurrence (last-write-wins, per the protobuf spec). That rule is about whole entries; within one entry, a repeated scalar key or value also last-wins, while a repeated message value merges — the same as the owned decoder.

For larger maps where O(1) lookup matters, collect into a HashMap:

ⓘ
use std::collections::HashMap;
let index: HashMap<&str, &str> = view.labels.into_iter().collect();

Duplicate keys resolve last-write-wins in the collected map (matching proto map semantics), since HashMap::from_iter keeps the last value.

§Allocation

Like RepeatedView, the Vec backing store requires allocation. The individual keys and values borrow from the input buffer where possible (string keys as &'a str, bytes values as &'a [u8]).

Implementations§

Source§

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

Source

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

Construct from a Vec of entries, for ViewEncode use.

Duplicate keys are kept and all encoded — valid protobuf wire data (decoders apply last-write-wins). Mirrors RepeatedView::new.

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

Source§

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

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

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

Source§

fn default() -> Self

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

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

Source§

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

Source§

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

Converts to this type from the input type.
Source§

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

Duplicate keys are kept and all encoded; see MapView::new.

Source§

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

Creates a value from an iterator. Read more
Source§

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

Auto Trait Implementations§

§

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

§

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

§

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

§

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

§

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

§

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

§

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

§

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

§

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

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