Struct ordered_map::OrderedMap

pub struct OrderedMap<K, V, C, F> where
    F: Fn(&V) -> C,  { /* fields omitted */ }

Methods

impl<K, V, C, F> OrderedMap<K, V, C, F> where
    K: Eq + Hash + Copy,
    C: PartialOrd,
    F: Fn(&V) -> C, 

pub fn new(to_comparable: F) -> Self where
    F: Fn(&V) -> C, 

The function to_comparable is used to convert the value to something comparable

pub fn unordered(&self) -> &HashMap<K, V>

Retrieve the underlying unordered HashMap NOTE: You should not modify this map directly

pub fn descending_keys(&self) -> impl Iterator<Item = K> + '_

Keys of this map in descending order

pub fn ascending_keys(&self) -> impl Iterator<Item = K> + '_

Keys of this map in ascending order

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

Insert a new key-value pair to the map

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

Remove a key-value pair from the map