228             pool: &forest.nodes,  in iter()
237             pool: forest.nodes,  in into_iter()
336     fn next(&mut self, pool: &NodePool<MapTypes<K, V>>) -> Option<(K, V)> {  in next()
337         self.path.next(pool)  in next()
343         pool: &NodePool<MapTypes<K, V>>,  in prev()
345         root.expand().and_then(|root| self.path.prev(root, pool))  in prev()
348     fn key(&self, pool: &NodePool<MapTypes<K, V>>) -> Option<K> {  in key()
351             .and_then(|(node, entry)| pool[node].unwrap_leaf().0.get(entry).cloned())  in key()
354     fn value(&self, pool: &NodePool<MapTypes<K, V>>) -> Option<V> {  in value()
357             .and_then(|(node, entry)| pool[node].unwrap_leaf().1.get(entry).cloned())  in value()
360     fn value_mut<'a>(&self, pool: &'a mut NodePool<MapTypes<K, V>>) -> Option<&'a mut V> {  in value_mut()
363             .and_then(move |(node, entry)| pool[node].unwrap_leaf_mut().1.get_mut(entry))  in value_mut()
369         pool: &NodePool<MapTypes<K, V>>,  in goto()
374             let v = self.path.find(elem, root, pool, comp);  in goto()
376                 self.path.normalize(pool);  in goto()
385         pool: &NodePool<MapTypes<K, V>>,  in goto_first()
387         root.map(|root| self.path.first(root, pool).1)  in goto_first()
397         pool: &mut NodePool<MapTypes<K, V>>,  in insert()
402         self.try_insert(root, pool, key, value, comp).panic_on_oom()  in insert()
408         pool: &mut NodePool<MapTypes<K, V>>,  in try_insert()
415                 let node = pool.alloc_node(NodeData::leaf(key, value))?;  in try_insert()
422                 let old = self.path.find(key, r, pool, comp);  in try_insert()
424                     *self.path.value_mut(pool) = value;  in try_insert()
426                     *root = self.path.insert(key, value, pool)?.into();  in try_insert()
436         pool: &mut NodePool<MapTypes<K, V>>,  in remove()
438         let value = self.value(pool);  in remove()
440             *root = self.path.remove(pool).into();  in remove()
457     pool: &'a NodePool<MapTypes<K, V>>,  field
472             pool: &forest.nodes,  in new()
488         self.raw.next(self.pool)  in next()
495         self.raw.prev(self.root, self.pool)  in prev()
500         self.raw.key(self.pool)  in key()
505         self.raw.value(self.pool)  in value()
515         self.raw.goto(self.root, self.pool, elem, self.comp)  in goto()
520         self.raw.goto_first(self.root, self.pool)  in goto_first()
540     pool: &'a mut NodePool<MapTypes<K, V>>,  field
555             pool: &mut forest.nodes,  in new()
571         self.raw.next(self.pool)  in next()
578         self.raw.prev(self.root, self.pool)  in prev()
583         self.raw.key(self.pool)  in key()
588         self.raw.value(self.pool)  in value()
593         self.raw.value_mut(self.pool)  in value_mut()
603         self.raw.goto(self.root, self.pool, elem, self.comp)  in goto()
608         self.raw.goto_first(self.root, self.pool)  in goto_first()
617         self.raw.insert(self.root, self.pool, key, value, self.comp)  in insert()
623             .try_insert(self.root, self.pool, key, value, self.comp)  in try_insert()
629         self.raw.remove(self.root, self.pool)  in remove()
640     pool: &'a NodePool<MapTypes<K, V>>,  field
656             Some(root) => Some(self.path.first(root, self.pool)),  in next()
657             None => self.path.next(self.pool),  in next()
669     pool: NodePool<MapTypes<K, V>>,  field
685             Some(root) => Some(self.path.first(root, &self.pool)),  in next()
686             None => self.path.next(&self.pool),  in next()
859         self.raw.path.verify(self.pool);  in verify()
860         self.root.map(|root| self.pool.verify_tree(root, self.comp));  in verify()