95     pub fn contains<C: Comparator<K>>(&self, key: K, forest: &SetForest<K>, comp: &C) -> bool {  in contains()
98             .and_then(|root| Path::default().find(key, root, &forest.nodes, comp))  in contains()
111         comp: &C,  in insert()
113         self.cursor(forest, comp).insert(key)  in insert()
121         comp: &C,  in try_insert()
123         self.cursor(forest, comp).try_insert(key)  in try_insert()
133         comp: &C,  in remove()
135         let mut c = self.cursor(forest, comp);  in remove()
176         comp: &'a C,  in cursor()
178         SetCursor::new(self, forest, comp)  in cursor()
211     comp: &'a C,  field
221     fn new(container: &'a mut Set<K>, forest: &'a mut SetForest<K>, comp: &'a C) -> Self {  in new()
225             comp,  in new()
269                 if self.path.find(elem, root, self.pool, self.comp).is_some() {  in goto()
305                 if self.path.find(elem, root, self.pool, self.comp).is_none() {  in try_insert()
334         self.root.map(|root| self.pool.verify_tree(root, self.comp));  in verify()