51         root: Node,  in find()
55         let mut node = root;  in find()
85                 NodeData::Free { .. } => panic!("Free {} reached from {}", node, root),  in find()
92     pub fn first(&mut self, root: Node, pool: &NodePool<F>) -> (F::Key, F::Value) {  in first()
93         let mut node = root;  in first()
101                 NodeData::Free { .. } => panic!("Free {} reached from {}", node, root),  in first()
133     pub fn prev(&mut self, root: Node, pool: &NodePool<F>) -> Option<(F::Key, F::Value)> {  in prev()
136             self.goto_subtree_last(0, root, pool);  in prev()
205     fn goto_subtree_last(&mut self, level: usize, root: Node, pool: &NodePool<F>) -> Node {  in goto_subtree_last()
206         let mut node = root;  in goto_subtree_last()
219                 NodeData::Free { .. } => panic!("Free {} reached from {}", node, root),  in goto_subtree_last()
226     pub fn set_root_node(&mut self, root: Node) {  in set_root_node()
228         self.node[0] = root;  in set_root_node()
368         let root = pool.alloc_node(NodeData::inner(orig_root, key, rhs_node))?;  in split_and_insert()  localVariable
371         slice_insert(&mut self.node[0..self.size], 0, root);  in split_and_insert()
748         let root = pool.alloc_node(NodeData::leaf(10, 'a')).panic_on_oom();  in search_single_leaf()  localVariable
753         assert_eq!(p.find(5, root, &pool, &comp), None);  in search_single_leaf()
755         assert_eq!(p.node[0], root);  in search_single_leaf()
759         assert_eq!(p.find(10, root, &pool, &comp), Some('a'));  in search_single_leaf()
761         assert_eq!(p.node[0], root);  in search_single_leaf()
765         assert_eq!(p.find(15, root, &pool, &comp), None);  in search_single_leaf()
767         assert_eq!(p.node[0], root);  in search_single_leaf()
771         match pool[root] {  in search_single_leaf()
785         assert_eq!(p.find(15, root, &pool, &comp), None);  in search_single_leaf()
787         assert_eq!(p.node[0], root);  in search_single_leaf()
791         assert_eq!(p.find(25, root, &pool, &comp), None);  in search_single_leaf()
793         assert_eq!(p.node[0], root);  in search_single_leaf()
803         let root = pool  in search_single_inner()  localVariable
810         assert_eq!(p.find(5, root, &pool, &comp), None);  in search_single_inner()
812         assert_eq!(p.node[0], root);  in search_single_inner()
817         assert_eq!(p.find(10, root, &pool, &comp), Some('a'));  in search_single_inner()
819         assert_eq!(p.node[0], root);  in search_single_inner()
825         assert_eq!(p.find(15, root, &pool, &comp), None);  in search_single_inner()
827         assert_eq!(p.node[0], root);  in search_single_inner()
832         assert_eq!(p.find(20, root, &pool, &comp), Some('b'));  in search_single_inner()
834         assert_eq!(p.node[0], root);  in search_single_inner()
839         assert_eq!(p.find(25, root, &pool, &comp), None);  in search_single_inner()
841         assert_eq!(p.node[0], root);  in search_single_inner()