246     pub fn cursor_front_mut(&mut self) -> Option<CursorMut<'_, K, V>> {  in cursor_front_mut()
261     pub fn cursor_front(&self) -> Option<Cursor<'_, K, V>> {  in cursor_front()
276     pub fn cursor_back_mut(&mut self) -> Option<CursorMut<'_, K, V>> {  in cursor_back_mut()
291     pub fn cursor_back(&self) -> Option<Cursor<'_, K, V>> {  in cursor_back()
321     ) -> Result<Option<RBTreeNode<K, V>>> {  in try_create_and_insert()
331     pub fn insert(&mut self, node: RBTreeNode<K, V>) -> Option<RBTreeNode<K, V>> {  in insert()
403     pub fn find_mut(&mut self, key: &K) -> Option<OccupiedEntry<'_, K, V>> {  in find_mut()
411     pub fn get(&self, key: &K) -> Option<&V> {  in get()
434     pub fn get_mut(&mut self, key: &K) -> Option<&mut V> {  in get_mut()
441     pub fn remove_node(&mut self, key: &K) -> Option<RBTreeNode<K, V>> {  in remove_node()
448     pub fn remove(&mut self, key: &K) -> Option<V> {  in remove()
457     pub fn cursor_lower_bound_mut(&mut self, key: &K) -> Option<CursorMut<'_, K, V>>  in cursor_lower_bound_mut()
478     pub fn cursor_lower_bound(&self, key: &K) -> Option<Cursor<'_, K, V>>  in cursor_lower_bound()
494     fn find_best_match(&self, key: &K) -> Option<NonNull<bindings::rb_node>> {  in find_best_match()
496         let mut best_key: Option<&K> = None;  in find_best_match()
497         let mut best_links: Option<NonNull<bindings::rb_node>> = None;  in find_best_match()
854     pub fn peek_prev(&self) -> Option<(&K, &V)> {  in peek_prev()
859     pub fn peek_next(&self) -> Option<(&K, &V)> {  in peek_next()
863     fn peek(&self, direction: Direction) -> Option<(&K, &V)> {  in peek()
872     fn get_neighbor_raw(&self, direction: Direction) -> Option<NonNull<bindings::rb_node>> {  in get_neighbor_raw()
918     pub fn remove_current(self) -> (Option<Self>, RBTreeNode<K, V>) {  in remove_current()
942     pub fn remove_prev(&mut self) -> Option<RBTreeNode<K, V>> {  in remove_prev()
947     pub fn remove_next(&mut self) -> Option<RBTreeNode<K, V>> {  in remove_next()
951     fn remove_neighbor(&mut self, direction: Direction) -> Option<RBTreeNode<K, V>> {  in remove_neighbor()
968     pub fn move_prev(self) -> Option<Self> {  in move_prev()
973     pub fn move_next(self) -> Option<Self> {  in move_next()
977     fn mv(self, direction: Direction) -> Option<Self> {  in mv()
987     pub fn peek_prev(&self) -> Option<(&K, &V)> {  in peek_prev()
992     pub fn peek_next(&self) -> Option<(&K, &V)> {  in peek_next()
996     fn peek(&self, direction: Direction) -> Option<(&K, &V)> {  in peek()
1006     pub fn peek_prev_mut(&mut self) -> Option<(&K, &mut V)> {  in peek_prev_mut()
1011     pub fn peek_next_mut(&mut self) -> Option<(&K, &mut V)> {  in peek_next_mut()
1015     fn peek_mut(&mut self, direction: Direction) -> Option<(&K, &mut V)> {  in peek_mut()
1024     fn get_neighbor_raw(&self, direction: Direction) -> Option<NonNull<bindings::rb_node>> {  in get_neighbor_raw()
1112     fn next(&mut self) -> Option<Self::Item> {  in next()
1147     fn next(&mut self) -> Option<Self::Item> {  in next()
1167     fn next(&mut self) -> Option<Self::Item> {  in next()