50         key: F::Key,  in find()  argument
53         comp: &dyn Comparator<F::Key>,  in find()  argument
92     pub fn first(&mut self, root: Node, pool: &NodePool<F>) -> (F::Key, F::Value) {  in first()  argument
108     pub fn next(&mut self, pool: &NodePool<F>) -> Option<(F::Key, F::Value)> {  in next()  argument
133     pub fn prev(&mut self, root: Node, pool: &NodePool<F>) -> Option<(F::Key, F::Value)> {  in prev()  argument
266         key: F::Key,  in insert()  argument
278     fn try_leaf_insert(&self, key: F::Key, value: F::Value, pool: &mut NodePool<F>) -> bool {  in try_leaf_insert()  argument
293         mut key: F::Key,  in split_and_insert()  argument
399     fn current_crit_key(&self, level: usize, pool: &NodePool<F>) -> Option<F::Key> {  in current_crit_key()  argument
516             let new_ck: Option<F::Key>;  in underflowed_node()
611     fn right_sibling(&self, level: usize, pool: &NodePool<F>) -> Option<(F::Key, Node)> {  in right_sibling()  argument
635     fn update_right_crit_key(&self, level: usize, crit_key: F::Key, pool: &mut NodePool<F>) {  in update_right_crit_key()  argument
730         type Key = i32;  typedef
735         fn splat_key(key: Self::Key) -> Self::LeafKeys {  in splat_key()