pub struct BVecTreeMap<S, K, V> { /* private fields */ }
Implementations§
Source§impl<K: Ord + Debug, V: Debug> BVecTreeMap<Vec<BVecTreeNode<K, V>>, K, V>
impl<K: Ord + Debug, V: Debug> BVecTreeMap<Vec<BVecTreeNode<K, V>>, K, V>
Source§impl<S: Vector<BVecTreeNode<K, V>>, K: Ord + Debug, V: Debug> BVecTreeMap<S, K, V>
impl<S: Vector<BVecTreeNode<K, V>>, K: Ord + Debug, V: Debug> BVecTreeMap<S, K, V>
pub fn new_in(buf: S) -> Self
pub fn len(&self) -> usize
pub fn is_empty(&self) -> bool
pub fn clear(&mut self)
pub fn height(&self) -> usize
pub fn get_mut(&mut self, key: &K) -> Option<&mut V>
pub fn contains_key(&self, key: &K) -> bool
pub fn insert(&mut self, key: K, value: V) -> Option<V>
pub fn remove(&mut self, key: &K) -> Option<V>
pub fn remove_entry(&mut self, key: &K) -> Option<(K, V)>
Trait Implementations§
Auto Trait Implementations§
impl<S, K, V> Freeze for BVecTreeMap<S, K, V>where
S: Freeze,
impl<S, K, V> RefUnwindSafe for BVecTreeMap<S, K, V>
impl<S, K, V> Send for BVecTreeMap<S, K, V>
impl<S, K, V> Sync for BVecTreeMap<S, K, V>
impl<S, K, V> Unpin for BVecTreeMap<S, K, V>
impl<S, K, V> UnwindSafe for BVecTreeMap<S, K, V>
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