29         tree: [Node; INNER_SIZE],
79         let mut tree = [right; INNER_SIZE];  in inner()  localVariable
80         tree[0] = left;  in inner()
84             tree,  in inner()
103                 ref tree,  in unwrap_inner()
108                 (&keys[0..size], &tree[0..=size])  in unwrap_inner()
172                 ref mut tree,  in try_inner_insert()
181                     slice_insert(&mut tree[1..=sz + 1], index, node);  in try_inner_insert()
229                 ref tree,  in split()
234                 let l_ents = split_pos(tree.len(), insert_index + 1);  in split()
235                 let r_ents = tree.len() - l_ents;  in split()
251                 let mut r_tree = *tree;  in split()
252                 r_tree[0..r_ents].copy_from_slice(&tree[l_ents..]);  in split()
261                         tree: r_tree,  in split()
314                 ref mut tree,  in inner_remove()
317                 debug_assert!(ents <= tree.len());  in inner_remove()
324                 slice_shift(&mut tree[index..ents], 1);  in inner_remove()
325                 Removed::new(index, ents - 1, tree.len())  in inner_remove()
369                     tree: ref mut l_tree,  in balance()
374                     tree: ref mut r_tree,  in balance()
561             Self::Inner { size, keys, tree } => {  in fmt()
562                 write!(f, "[ {}", tree[0])?;  in fmt()
564                     write!(f, " {} {}", keys[i], tree[i + 1])?;  in fmt()