129     pub fn remove<C: Comparator<K>>(  in remove()  function
137             c.remove();  in remove()
166                 self.root = path.remove(&mut forest.nodes).into();  in retain()
317     pub fn remove(&mut self) -> Option<K> {  in remove()  function
320             *self.root = self.path.remove(self.pool).into();  in remove()
438         assert_eq!(c.remove(), Some(50));  in simple_cursor()
442         assert_eq!(c.remove(), Some(100));  in simple_cursor()
445         assert_eq!(c.remove(), None);  in simple_cursor()
479             assert_eq!(c.remove(), Some(i));  in two_level_sparse_tree()
488             assert_eq!(c.remove(), Some(i));  in two_level_sparse_tree()
526             assert_eq!(c.remove(), Some(i));  in three_level_sparse_tree()
535             assert_eq!(c.remove(), Some(i));  in three_level_sparse_tree()
583             assert_eq!(c.remove(), Some(i));  in four_level()
592             assert_eq!(c.remove(), Some(i));  in four_level()
600                 c.remove();  in four_level()