Struct rb_tree::rbmap::Entry [−][src]
pub struct Entry<'a, K: PartialOrd, V> { /* fields omitted */ }
Implementations
impl<'a, K: PartialOrd + Copy, V> Entry<'a, K, V>
[src]
impl<'a, K: PartialOrd + Copy, V> Entry<'a, K, V>
[src]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
impl<'a, K: PartialOrd + Copy, V: Default> Entry<'a, K, V>
[src]
impl<'a, K: PartialOrd + Copy, V: Default> Entry<'a, K, V>
[src]pub fn or_default<F>(self) -> &'a mut V where
F: FnOnce() -> V,
[src]
F: FnOnce() -> V,
Auto Trait Implementations
impl<'a, K, V> RefUnwindSafe for Entry<'a, K, V> where
K: RefUnwindSafe,
V: RefUnwindSafe,
K: RefUnwindSafe,
V: RefUnwindSafe,
impl<'a, K, V> Send for Entry<'a, K, V> where
K: Send,
V: Send,
K: Send,
V: Send,
impl<'a, K, V> Sync for Entry<'a, K, V> where
K: Sync,
V: Sync,
K: Sync,
V: Sync,
impl<'a, K, V> Unpin for Entry<'a, K, V> where
K: Unpin,
K: Unpin,