pub struct Entry<K, V> { /* private fields */ }Expand description
The wrapper struct that allows TreeMap<K, V> to use AVLTreeT is Ord, Entry<K, V> must implement Eq and PartialOrd,
which themselves must implement PartialEq.
All traits use key for ordering.
See the module-level documentation for more details.
Implementations§
Trait Implementations§
Source§impl<K: Ord, V> Ord for Entry<K, V>
impl<K: Ord, V> Ord for Entry<K, V>
Source§impl<K: PartialOrd, V> PartialOrd for Entry<K, V>
impl<K: PartialOrd, V> PartialOrd for Entry<K, V>
impl<K: Eq, V> Eq for Entry<K, V>
Auto Trait Implementations§
impl<K, V> Freeze for Entry<K, V>
impl<K, V> RefUnwindSafe for Entry<K, V>where
K: RefUnwindSafe,
V: RefUnwindSafe,
impl<K, V> Send for Entry<K, V>
impl<K, V> Sync for Entry<K, V>
impl<K, V> Unpin for Entry<K, V>
impl<K, V> UnwindSafe for Entry<K, V>where
K: UnwindSafe,
V: UnwindSafe,
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more