Method inner_remove

cranelift/bforest/src/node.rs:309–329

Remove the sub-tree at `index` from this inner node. Note that `index` refers to a sub-tree entry and not a key entry as it does for `try_inner_insert()`. It is possible to remove the first sub-tree (which can't be inserted by `try_inner_insert()`). Return an indication of the node's health (i.e. below half capacity).

(&mut self, index: usize)

    ///
    /// Return an indication of the node's health (i.e. below half capacity).
    pub fn inner_remove(&mut self, index: usize) -> Removed {
        match *self {
            Self::Inner {
                ref mut size,
                ref mut keys,
                ref mut tree,
            } => {
                let ents = usize::from(*size) + 1;
                debug_assert!(ents <= tree.len());
                debug_assert!(index < ents);
                // Leave an invalid 0xff size when node becomes empty.
                *size = ents.wrapping_sub(2) as u8;
                if ents > 1 {
                    slice_shift(&mut keys[index.saturating_sub(1)..ents - 1], 1);
                }
                slice_shift(&mut tree[index..ents], 1);
                Removed::new(index, ents - 1, tree.len())
            }
            _ => panic!("Expected inner node"),
        }
    }

    /// Remove the key-value pair at `index` from this leaf node.
    ///