Struct pancake_engine_ssi::ds_n_a::ordered_dict::OrderedDict

pub struct OrderedDict<K, V> {
    dict: HashMap<K, DictValue<K, V>>,
    newest_k: Option<K>,
}

A structure that contains

• a hash-map and
• a virtual linked-list connecting neighboring entries in their insertion order.

Fields

dict: HashMap<K, DictValue<K, V>>

newest_k: Option<K>

Implementations

impl<K, V> OrderedDict<K, V>

where K: Hash + Eq + Clone,

pub fn new() -> Self

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

pub fn get_mut<'s, 'a>(&'s mut self, k: &'a K) -> Option<&'s mut V>

pub fn get_newest_key(&self) -> Option<&K>

pub fn get_neighbors<'s, 'a>(&'s self, k: &'a K) -> Option<Neighbors<'s, K, V>>

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

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

where K: Sized,

           / _k
newer_k -- | newer_v
           \ rm_k  -->  older_k

           / newer_k  -->  None
rm_k ----- | rm_v
           \ older_k  -->  None

           / rm_k  -->  newer_k
older_k -- | older_v
           \ _k