Struct rb_tree::rbmap::Entry

pub struct Entry<'a, K: PartialOrd, V> { /* fields omitted */ }

Implementations

impl<'a, K: PartialOrd + Copy, V> Entry<'a, K, V>

Follows a similar implementation to std::collections::HashMap, in terms of behaviour, only differs in types used. For further detail about any given method, please refer to the documentation of HashMap::Entry. For the time being only copyable keys can utilise these methods

pub fn insert(self, val: V) -> (&'a K, &'a mut V)

pub fn and_modify<F>(self, f: F) -> Entry<'a, K, V> where
    F: FnOnce(&mut V), 

pub fn or_insert(self, default: V) -> &'a mut V

pub fn or_insert_with<F>(self, default: F) -> &'a mut V where
    F: FnOnce() -> V, 

impl<'a, K: PartialOrd + Copy, V: Default> Entry<'a, K, V>

pub fn or_default<F>(self) -> &'a mut V where
    F: FnOnce() -> V,