308             let rhs_node = pool.alloc_node(split.rhs_data)?;  in split_and_insert()  localVariable
321                 node = rhs_node;  in split_and_insert()
334                     if entry == 0 && node == rhs_node {  in split_and_insert()
352             ins_node = Some(rhs_node);  in split_and_insert()
356                 if pnode.try_inner_insert(pentry, key, rhs_node) {  in split_and_insert()
358                     if node == rhs_node {  in split_and_insert()
367         let rhs_node = ins_node.expect("empty path");  in split_and_insert()  localVariable
368         let root = pool.alloc_node(NodeData::inner(orig_root, key, rhs_node))?;  in split_and_insert()
369         let entry = if self.node[0] == rhs_node { 1 } else { 0 };  in split_and_insert()
514         if let Some((crit_key, rhs_node)) = self.right_sibling(level, pool) {  in underflowed_node()
519             let mut rhs = pool[rhs_node];  in underflowed_node()
533             pool[rhs_node] = rhs;  in underflowed_node()
571         let rhs_node = self.right_sibling(level, pool).map(|(_, n)| n);  in empty_node()  localVariable
580         match rhs_node {  in empty_node()