104     pub fn get<C: Comparator<K>>(&self, key: K, forest: &MapForest<K, V>, comp: &C) -> Option<V> {  in get()
107             .and_then(|root| Path::default().find(key, root, &forest.nodes, comp))  in get()
121         comp: &C,  in get_or_less()
125             match path.find(key, root, &forest.nodes, comp) {  in get_or_less()
138         comp: &C,  in insert()
140         self.cursor_mut(forest, comp).insert(key, value)  in insert()
149         comp: &C,  in try_insert()
151         self.cursor_mut(forest, comp).try_insert(key, value)  in try_insert()
159         comp: &C,  in remove()
161         let mut c = self.cursor_mut(forest, comp);  in remove()
208         comp: &'a C,  in cursor()
210         MapCursor::new(self, forest, comp)  in cursor()
219         comp: &'a C,  in cursor_mut()
221         MapCursorMut::new(self, forest, comp)  in cursor_mut()
247         comp: &'a C,  in range()
254             cursor: self.cursor(forest, comp),  in range()
290     fn verify<C: Comparator<K>>(&self, forest: &MapForest<K, V>, comp: &C)  in verify()
295             forest.nodes.verify_tree(root, comp);  in verify()
300     fn tpath<C: Comparator<K>>(&self, key: K, forest: &MapForest<K, V>, comp: &C) -> String {  in tpath()
306                 path.find(key, root, &forest.nodes, comp);  in tpath()
371         comp: &impl Comparator<K>,  in goto()
374             let v = self.path.find(elem, root, pool, comp);  in goto()
400         comp: &impl Comparator<K>,  in insert()
402         self.try_insert(root, pool, key, value, comp).panic_on_oom()  in insert()
411         comp: &impl Comparator<K>,  in try_insert()
422                 let old = self.path.find(key, r, pool, comp);  in try_insert()
458     comp: &'a C,  field
469     fn new(container: &'a Map<K, V>, forest: &'a MapForest<K, V>, comp: &'a C) -> Self {  in new()
473             comp,  in new()
515         self.raw.goto(self.root, self.pool, elem, self.comp)  in goto()
541     comp: &'a C,  field
552     fn new(container: &'a mut Map<K, V>, forest: &'a mut MapForest<K, V>, comp: &'a C) -> Self {  in new()
556             comp,  in new()
603         self.raw.goto(self.root, self.pool, elem, self.comp)  in goto()
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()
745                             .is_some_and(|key| self.cursor.comp.cmp(k, key).is_eq())  in next()
796                             .is_some_and(|key| self.cursor.comp.cmp(k, key).is_eq())  in next_back()
836             Bound::Included(k) => self.cursor.comp.cmp(key, k).is_ge(),  in is_in_start_bound()
837             Bound::Excluded(k) => self.cursor.comp.cmp(key, k).is_gt(),  in is_in_start_bound()
844             Bound::Included(k) => self.cursor.comp.cmp(k, key).is_ge(),  in is_in_end_bound()
845             Bound::Excluded(k) => self.cursor.comp.cmp(k, key).is_gt(),  in is_in_end_bound()
860         self.root.map(|root| self.pool.verify_tree(root, self.comp));  in verify()