Struct OrderedMap 

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

An OrderedMap is like a std::collections::HashMap, but it is sorted according to the value in descending order. It doesn’t require the value of the map, V, to be comparable, the comparison of the value is done on C, which is the return value of extract_comparable(&V).

Implementations

impl<'a, K, V: 'a, C> OrderedMap<K, V, C>

where K: Eq + Hash + Copy + 'a, C: PartialOrd + 'a,

pub fn new(extract_comparable: fn(&V) -> C) -> Self

The function extract_comparable is used to convert the value of type &V to something comparable of type C

pub fn len(&self) -> usize

pub fn descending_keys(&'a self) -> DescendingKeys<'a, K, C>

Keys of this map in descending order

pub fn descending_values(&'a self) -> DescendingValues<'a, K, V, C>

Values of this map in descending order

pub fn descending_items(&'a self) -> DescendingItems<'a, K, V, C>

(K, V) pairs of this map in descending order

pub fn insert(&mut self, k: K, v: V) -> Option<V>

Insert a new key-value pair to the map, the old value is returned as Option<V>

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

Remove a key-value pair from the map

Trait Implementations

impl<K: Clone, V: Clone, C: Clone> Clone for OrderedMap<K, V, C>

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

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<K: Debug, V: Debug, C: Debug> Debug for OrderedMap<K, V, C>

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

Formats the value using the given formatter.