Method right_sibling_branch_level

cranelift/bforest/src/path.rs:597–602

Find the level where the right sibling to the current node at `level` branches off. This will be an inner node with two adjacent sub-trees: In one the current node at level is a right-most node, in the other, the right sibling is a left-most node. Returns `None` if the current node is a right-most node so no right sibling exists.

(&self, level: usize, pool: &NodePool<F>)

    ///
    /// Returns `None` if the current node is a right-most node so no right sibling exists.
    fn right_sibling_branch_level(&self, level: usize, pool: &NodePool<F>) -> Option<usize> {
        (0..level).rposition(|l| match pool[self.node[l]] {
            NodeData::Inner { size, .. } => self.entry[l] < size,
            _ => panic!("Expected inner node"),
        })
    }

    /// Find the level where the left sibling to the current node at `level` branches off.
    fn left_sibling_branch_level(&self, level: usize) -> Option<usize> {