185             pool: &forest.nodes,  in iter()
210     pool: &'a mut NodePool<SetTypes<K>>,  field
224             pool: &mut forest.nodes,  in new()
240         self.path.next(self.pool).map(|(k, _)| k)  in next()
249             .and_then(|root| self.path.prev(root, self.pool).map(|(k, _)| k))  in prev()
256             .and_then(|(node, entry)| self.pool[node].unwrap_leaf().0.get(entry).cloned())  in elem()
269                 if self.path.find(elem, root, self.pool, self.comp).is_some() {  in goto()
272                     self.path.normalize(self.pool);  in goto()
281         self.root.map(|root| self.path.first(root, self.pool).0)  in goto_first()
298                 let root = self.pool.alloc_node(NodeData::leaf(elem, SetValue()))?;  in try_insert()
305                 if self.path.find(elem, root, self.pool, self.comp).is_none() {  in try_insert()
306                     *self.root = self.path.insert(elem, SetValue(), self.pool)?.into();  in try_insert()
320             *self.root = self.path.remove(self.pool).into();  in remove()
333         self.path.verify(self.pool);  in verify()
334         self.root.map(|root| self.pool.verify_tree(root, self.comp));  in verify()
350     pool: &'a NodePool<SetTypes<K>>,  field
365             Some(root) => Some(self.path.first(root, self.pool).0),  in next()
366             None => self.path.next(self.pool).map(|(k, _)| k),  in next()