pub fn hoist_lone_child(&mut self) {
        // Necessary for correctness, but in a private module
        debug_assert!(self.is_empty());
        debug_assert!(!self.is_leaf());

        unsafe {
            let ret = ptr::read(self.edges().get_unchecked(0));
            self.destroy();
            ptr::write(self, ret);
        }
    }
/// When a node has no keys or values and only a single edge, extract that edge.
When a node has no keys or values and only a single edge, extract that edge.
When a node has no keys or values and only a single edge extract that edge .
pub fn hoist_lone_child(&mut self) {
        // Necessary for correctness, but in a private module
        debug_assert!(self.is_empty());
        debug_assert!(!self.is_leaf());
        unsafe {
            let ret = ptr::read(self.edges().get_unchecked(0));
            self.destroy();
            ptr::write(self, ret);
        }
    }
pub fn hoist_lone_child ( & mut self ) { // Necessary for correctness, but in a private module debug_assert ! ( self is_empty ( ) ) ; debug_assert ! ( self is_leaf ( ) ) ; unsafe { let ret = ptr :: read ( self . edges ( ) . get_unchecked ( 0 ) ) ; self . destroy ( ) ; ptr :: write ( self , ret ) ; } }
When a node has no keys or values and only a single edge, extract that edge.
When a node has no keys or values and only a single edge extract that edge .
&mut self