4 use super::{Comparator, Forest, MAX_PATH, Node, NodeData, NodePool, slice_insert, slice_shift};
17     node: [Node; MAX_PATH],
29             node: [Node(0); MAX_PATH],  in default()
51         root: Node,  in find()  argument
92     pub fn first(&mut self, root: Node, pool: &NodePool<F>) -> (F::Key, F::Value) {  in first()  argument
133     pub fn prev(&mut self, root: Node, pool: &NodePool<F>) -> Option<(F::Key, F::Value)> {  in prev()  argument
166     fn next_node(&mut self, level: usize, pool: &NodePool<F>) -> Option<Node> {  in next_node()  argument
195     fn prev_leaf(&mut self, pool: &NodePool<F>) -> Option<Node> {  in prev_leaf()  argument
205     fn goto_subtree_last(&mut self, level: usize, root: Node, pool: &NodePool<F>) -> Node {  in goto_subtree_last()  argument
226     pub fn set_root_node(&mut self, root: Node) {  in set_root_node()  argument
233     pub fn leaf_pos(&self) -> Option<(Node, usize)> {  in leaf_pos()  argument
239     fn leaf_node(&self) -> Node {  in leaf_node()  argument
269     ) -> Result<Node, OutOfMemory> {  in insert()  argument
380     pub fn remove(&mut self, pool: &mut NodePool<F>) -> Option<Node> {  in remove()  argument
435     fn balance_nodes(&mut self, status: Removed, pool: &mut NodePool<F>) -> Option<Node> {  in balance_nodes()  argument
611     fn right_sibling(&self, level: usize, pool: &NodePool<F>) -> Option<(F::Key, Node)> {  in right_sibling()  argument