pub struct BVecTreeNode<K, V> { /* private fields */ }
Implementations§
Source§impl<K: Ord, V> BVecTreeNode<K, V>
impl<K: Ord, V> BVecTreeNode<K, V>
pub fn find_key_id(&self, value: &K) -> (usize, bool)
Sourcepub fn shift_right(&mut self, idx: usize)
pub fn shift_right(&mut self, idx: usize)
Shifts keys and children right so that there is a space for one at idx
Sourcepub fn shift_right_rchild(&mut self, idx: usize)
pub fn shift_right_rchild(&mut self, idx: usize)
Shifts keys and children right so that there is a space for key at idx
, and child at idx + 1
Sourcepub fn shift_left(&mut self, idx: usize)
pub fn shift_left(&mut self, idx: usize)
Shifts keys and children left to fill in a gap at idx
Sourcepub fn shift_left_rchild(&mut self, idx: usize)
pub fn shift_left_rchild(&mut self, idx: usize)
Shifts keys and children left to fill in a gap at idx
, used when the right child is none
pub fn insert_leaf_key(&mut self, idx: usize, key: (K, V))
pub fn insert_node_at(&mut self, value: (K, V), idx: usize) -> Option<(K, V)>
pub fn insert_node(&mut self, value: (K, V)) -> Option<(K, V)>
pub fn insert_node_rchild_at( &mut self, value: (K, V), idx: usize, ) -> Option<(K, V)>
pub fn insert_node_rchild(&mut self, value: (K, V)) -> Option<(K, V)>
Trait Implementations§
Auto Trait Implementations§
impl<K, V> Freeze for BVecTreeNode<K, V>
impl<K, V> RefUnwindSafe for BVecTreeNode<K, V>where
K: RefUnwindSafe,
V: RefUnwindSafe,
impl<K, V> Send for BVecTreeNode<K, V>
impl<K, V> Sync for BVecTreeNode<K, V>
impl<K, V> Unpin for BVecTreeNode<K, V>
impl<K, V> UnwindSafe for BVecTreeNode<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