pub struct BeTree<K, V> { /* private fields */ }
Expand description
A map based on a B๐-tree
Implementationsยง
Sourceยงimpl<K, V> BeTree<K, V>
impl<K, V> BeTree<K, V>
Sourcepub fn insert(&mut self, key: K, value: V)
pub fn insert(&mut self, key: K, value: V)
Insert a key-value pair into the tree.
If the key is already present in the tree, the value is replaced. The key is not updated, though; this matters for
types that can be ==
without being identical.
Trait Implementationsยง
Auto Trait Implementationsยง
impl<K, V> Freeze for BeTree<K, V>
impl<K, V> RefUnwindSafe for BeTree<K, V>where
K: RefUnwindSafe,
V: RefUnwindSafe,
impl<K, V> Send for BeTree<K, V>
impl<K, V> Sync for BeTree<K, V>
impl<K, V> Unpin for BeTree<K, V>
impl<K, V> UnwindSafe for BeTree<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