Struct RegistOrderMap 

pub struct RegistOrderMap<K, V> { /* private fields */ }

An RegistOrderMap is like a std::collections::HashMap, but it is sorted according to the key in descending order. The RegistOrderMap is a HashMap with guaranteed registration order. I have only implemented the minimum required methods, so please request them if you have any requests.

Implementations

impl<K, V> RegistOrderMap<K, V>

pub fn new() -> Self

Creates an empty RegistOrderMap.

pub fn get(&self, k: &K) -> Option<&V>

where K: Eq,

Returns a ref2erence to the value corresponding to the key.

pub fn insert(&mut self, k: K, v: V)

where K: Eq,

Inserts a key-value pair into the map.

pub fn is_empty(&self) -> bool

Returns true if the map contains no elements.

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

An iterator visiting all key-value pairs in arbitrary order. The iterator element type is (&'a K, &'a V).

pub fn len(&self) -> usize

Returns the number of elements in the map.

pub fn with_capacity(capacity: usize) -> Self

Creates an empty RegistOrderMap with at least the specified capacity.

Trait Implementations

impl<K: Clone, V: Clone> Clone for RegistOrderMap<K, V>

fn clone(&self) -> RegistOrderMap<K, V>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<K: Debug, V: Debug> Debug for RegistOrderMap<K, V>

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

Formats the value using the given formatter.

impl<K, V> Default for RegistOrderMap<K, V>

fn default() -> Self

Returns the “default value” for a type.

impl<K, V, const N: usize> From<[(K, V); N]> for RegistOrderMap<K, V>

where K: Eq + Copy, V: Copy,

fn from(arr: [(K, V); N]) -> Self

Converts to this type from the input type.