unsafe fn handle_underflow_to_right(&mut self) {
        let right_len = self.node.edges()[self.index + 1].len();
        if right_len > min_load_from_capacity(self.node.capacity()) {
            self.right_kv().steal_leftward();
        } else {
            self.right_kv().merge_children();
        }
    }
/// Left is underflowed. Tries to steal from the right,
/// but merges left and right if right is low too.
Left is underflowed. Tries to steal from the right,
but merges left and right if right is low too.
Left is underflowed . Tries to steal from the right but merges left and right if right is low too .
unsafe fn handle_underflow_to_right(&mut self) {
        let right_len = self.node.edges()[self.index + 1].len();
        if right_len > min_load_from_capacity(self.node.capacity()) {
            self.right_kv().steal_leftward();
        } else {
            self.right_kv().merge_children();
        }
    }
unsafe fn handle_underflow_to_right ( & mut self ) { let right_len = self . node . edges ( ) [ self . index + 1 ] . len ( ) ; if right_len > min_load_from_capacity ( self . node . capacity ( ) ) { self . right_kv ( ) . steal_leftward ( ) ; } else { self . right_kv ( ) . merge_children ( ) ; } }
Left is underflowed.
Left is underflowed .
&mut self