4 use super::{Comparator, Forest, MAX_PATH, Node, NodeData, NodePool, slice_insert, slice_shift};
60                 NodeData::Inner { size, keys, tree } => {  in find()
72                 NodeData::Leaf { size, keys, vals } => {  in find()
85                 NodeData::Free { .. } => panic!("Free {} reached from {}", node, root),  in find()
99                 NodeData::Inner { tree, .. } => node = tree[0],  in first()
100                 NodeData::Leaf { keys, vals, .. } => return (keys.borrow()[0], vals.borrow()[0]),  in first()
101                 NodeData::Free { .. } => panic!("Free {} reached from {}", node, root),  in first()
210                 NodeData::Inner { size, ref tree, .. } => {  in goto_subtree_last()
214                 NodeData::Leaf { size, .. } => {  in goto_subtree_last()
219                 NodeData::Free { .. } => panic!("Free {} reached from {}", node, root),  in goto_subtree_last()
368         let root = pool.alloc_node(NodeData::inner(orig_root, key, rhs_node))?;  in split_and_insert()
421             NodeData::Inner {  in update_crit_key()
453         while let NodeData::Inner {  in balance_nodes()
599             NodeData::Inner { size, .. } => self.entry[l] < size,  in right_sibling_branch_level()
640             NodeData::Inner { ref mut keys, .. } => {  in update_right_crit_key()
665                 NodeData::Inner { size, tree, .. } => {  in verify()
680                 NodeData::Leaf { size, .. } => {  in verify()
689                 NodeData::Free { .. } => {  in verify()
748         let root = pool.alloc_node(NodeData::leaf(10, 'a')).panic_on_oom();  in search_single_leaf()
772             NodeData::Leaf {  in search_single_leaf()
801         let leaf1 = pool.alloc_node(NodeData::leaf(10, 'a')).panic_on_oom();  in search_single_inner()
802         let leaf2 = pool.alloc_node(NodeData::leaf(20, 'b')).panic_on_oom();  in search_single_inner()
804             .alloc_node(NodeData::inner(leaf1, 20, leaf2))  in search_single_inner()