81     root: PackedOption<Node>,  field
93             root: None.into(),  in new()
100         self.root.is_none()  in is_empty()
105         self.root  in get()
107             .and_then(|root| Path::default().find(key, root, &forest.nodes, comp))  in get()
123         self.root.expand().and_then(|root| {  in get_or_less()
125             match path.find(key, root, &forest.nodes, comp) {  in get_or_less()
127                 None => path.prev(root, &forest.nodes),  in get_or_less()
171         if let Some(root) = self.root.take() {  in clear()
172             forest.nodes.free_tree(root);  in clear()
186         if let Some(root) = self.root.expand() {  in retain()
187             path.first(root, &forest.nodes);  in retain()
197                 self.root = path.remove(&mut forest.nodes).into();  in retain()
227             root: self.root,  in iter()
236             root: self.root,  in into_iter()
294         if let Some(root) = self.root.expand() {  in verify()
295             forest.nodes.verify_tree(root, comp);  in verify()
302         match self.root.expand() {  in tpath()
304             Some(root) => {  in tpath()
306                 path.find(key, root, &forest.nodes, comp);  in tpath()
332     fn is_empty(&self, root: &PackedOption<Node>) -> bool {  in is_empty()
333         root.is_none()  in is_empty()
342         root: &PackedOption<Node>,  in prev()
345         root.expand().and_then(|root| self.path.prev(root, pool))  in prev()
368         root: &PackedOption<Node>,  in goto()
373         root.expand().and_then(|root| {  in goto()
374             let v = self.path.find(elem, root, pool, comp);  in goto()
384         root: &PackedOption<Node>,  in goto_first()
387         root.map(|root| self.path.first(root, pool).1)  in goto_first()
396         root: &mut PackedOption<Node>,  in insert()
402         self.try_insert(root, pool, key, value, comp).panic_on_oom()  in insert()
407         root: &mut PackedOption<Node>,  in try_insert()
413         match root.expand() {  in try_insert()
416                 *root = node.into();  in try_insert()
426                     *root = self.path.insert(key, value, pool)?.into();  in try_insert()
435         root: &mut PackedOption<Node>,  in remove()
440             *root = self.path.remove(pool).into();  in remove()
456     root: &'a PackedOption<Node>,  field
471             root: &container.root,  in new()
480         self.raw.is_empty(self.root)  in is_empty()
495         self.raw.prev(self.root, self.pool)  in prev()
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()
539     root: &'a mut PackedOption<Node>,  field
554             root: &mut container.root,  in new()
563         self.raw.is_empty(self.root)  in is_empty()
578         self.raw.prev(self.root, self.pool)  in prev()
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()
639     root: PackedOption<Node>,  field
655         match self.root.take() {  in next()
656             Some(root) => Some(self.path.first(root, self.pool)),  in next()
668     root: PackedOption<Node>,  field
684         match self.root.take() {  in next()
685             Some(root) => Some(self.path.first(root, &self.pool)),  in next()
860         self.root.map(|root| self.pool.verify_tree(root, self.comp));  in verify()