Struct vector_trees::btree::BVecTreeNode

pub struct BVecTreeNode<K, V> { /* fields omitted */ }

Implementations

impl<K: Ord, V> BVecTreeNode<K, V>

pub fn find_key_id(&self, value: &K) -> (usize, bool)

pub fn shift_right(&mut self, idx: usize)

Shifts keys and children right so that there is a space for one at idx

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

pub fn shift_left(&mut self, idx: usize)

Shifts keys and children left to fill in a gap at idx

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)>

pub fn merge(&mut self, mid: (K, V), other: &mut Self)

Appends all keys and children of other to the end of self, adding mid as key in the middle

Trait Implementations

impl<K: Debug, V: Debug> Debug for BVecTreeNode<K, V>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<K, V> Default for BVecTreeNode<K, V>

fn default() -> Self

Returns the "default value" for a type.