Struct AscendingKey 

pub struct AscendingKey<'a, K, V>(pub &'a [MapEntry<K, V>]);

The entries of a slice in ascending order of their keys (a stable sort, so equal keys keep the order they were held in): MapEntryOrder::AscendingKey.

Tuple Fields

0: &'a [MapEntry<K, V>]

Trait Implementations

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

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<'a, K: Copy, V: Copy> Copy for AscendingKey<'a, K, V>

impl<'a, K: Debug, V: Debug> Debug for AscendingKey<'a, K, V>

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

Formats the value using the given formatter.

impl<K: Ord, V> WireMap<K, V> for AscendingKey<'_, K, V>

fn entry_count(&self) -> usize

The number of entries.

fn try_visit<E, F: FnMut(&K, &V) -> Result<(), E>>( &self, visit: F, ) -> Result<(), E>

Calls visit with each entry, in wire order, stopping at the first error.