4 use super::{Comparator, Forest, MAX_PATH, Node, NodeData, NodePool, slice_insert, slice_shift};
52         pool: &NodePool<F>,  in find()
92     pub fn first(&mut self, root: Node, pool: &NodePool<F>) -> (F::Key, F::Value) {  in first()
108     pub fn next(&mut self, pool: &NodePool<F>) -> Option<(F::Key, F::Value)> {  in next()
133     pub fn prev(&mut self, root: Node, pool: &NodePool<F>) -> Option<(F::Key, F::Value)> {  in prev()
166     fn next_node(&mut self, level: usize, pool: &NodePool<F>) -> Option<Node> {  in next_node()
195     fn prev_leaf(&mut self, pool: &NodePool<F>) -> Option<Node> {  in prev_leaf()
205     fn goto_subtree_last(&mut self, level: usize, root: Node, pool: &NodePool<F>) -> Node {  in goto_subtree_last()
256     pub fn value_mut<'a>(&self, pool: &'a mut NodePool<F>) -> &'a mut F::Value {  in value_mut()
268         pool: &mut NodePool<F>,  in insert()
278     fn try_leaf_insert(&self, key: F::Key, value: F::Value, pool: &mut NodePool<F>) -> bool {  in try_leaf_insert()
295         pool: &mut NodePool<F>,  in split_and_insert()
380     pub fn remove(&mut self, pool: &mut NodePool<F>) -> Option<Node> {  in remove()
399     fn current_crit_key(&self, level: usize, pool: &NodePool<F>) -> Option<F::Key> {  in current_crit_key()
408     fn update_crit_key(&mut self, pool: &mut NodePool<F>) {  in update_crit_key()
435     fn balance_nodes(&mut self, status: Removed, pool: &mut NodePool<F>) -> Option<Node> {  in balance_nodes()
487     fn heal_level(&mut self, status: Removed, level: usize, pool: &mut NodePool<F>) -> bool {  in heal_level()
511     fn underflowed_node(&mut self, level: usize, pool: &mut NodePool<F>) {  in underflowed_node()
563     fn empty_node(&mut self, level: usize, pool: &mut NodePool<F>) -> bool {  in empty_node()
597     fn right_sibling_branch_level(&self, level: usize, pool: &NodePool<F>) -> Option<usize> {  in right_sibling_branch_level()
611     fn right_sibling(&self, level: usize, pool: &NodePool<F>) -> Option<(F::Key, Node)> {  in right_sibling()
635     fn update_right_crit_key(&self, level: usize, crit_key: F::Key, pool: &mut NodePool<F>) {  in update_right_crit_key()
649     pub fn normalize(&mut self, pool: &NodePool<F>) {  in normalize()
662     pub fn verify(&self, pool: &NodePool<F>) {  in verify()
747         let mut pool = NodePool::<TF>::new();  in search_single_leaf()
800         let mut pool = NodePool::<TF>::new();  in search_single_inner()