unsafe fn handle_underflow_to_left(&mut self) {
        let left_len = self.node.edges()[self.index - 1].len();
        if left_len > min_load_from_capacity(self.node.capacity()) {
            self.left_kv().steal_rightward();
        } else {
            self.left_kv().merge_children();
        }
    }
/// Right is underflowed. Tries to steal from left,
/// but merges left and right if left is low too.
Right is underflowed. Tries to steal from left,
but merges left and right if left is low too.
Right is underflowed . Tries to steal from left but merges left and right if left is low too .
unsafe fn handle_underflow_to_left(&mut self) {
        let left_len = self.node.edges()[self.index - 1].len();
        if left_len > min_load_from_capacity(self.node.capacity()) {
            self.left_kv().steal_rightward();
        } else {
            self.left_kv().merge_children();
        }
    }
unsafe fn handle_underflow_to_left ( & mut self ) { let left_len = self . node . edges ( ) [ self . index - 1 ] . len ( ) ; if left_len > min_load_from_capacity ( self . node . capacity ( ) ) { self . left_kv ( ) . steal_rightward ( ) ; } else { self . left_kv ( ) . merge_children ( ) ; } }
Right is underflowed.
Right is underflowed .
&mut self