196     pub fn iter(&self) -> Iter<'_, K, V> {  in iter()  argument
211     pub fn iter_mut(&mut self) -> IterMut<'_, K, V> {  in iter_mut()  argument
241     pub fn cursor_front(&mut self) -> Option<Cursor<'_, K, V>> {  in cursor_front()  argument
256     pub fn cursor_back(&mut self) -> Option<Cursor<'_, K, V>> {  in cursor_back()  argument
284         value: V,  in try_create_and_insert()
286     ) -> Result<Option<RBTreeNode<K, V>>> {  in try_create_and_insert()  argument
296     pub fn insert(&mut self, node: RBTreeNode<K, V>) -> Option<RBTreeNode<K, V>> {  in insert()  argument
306     fn raw_entry(&mut self, key: &K) -> RawEntry<'_, K, V> {  in raw_entry()  argument
360     pub fn entry(&mut self, key: K) -> Entry<'_, K, V> {  in entry()  argument
368     pub fn find_mut(&mut self, key: &K) -> Option<OccupiedEntry<'_, K, V>> {  in find_mut()  argument
376     pub fn get(&self, key: &K) -> Option<&V> {  in get()
396     pub fn get_mut(&mut self, key: &K) -> Option<&mut V> {  in get_mut()
403     pub fn remove_node(&mut self, key: &K) -> Option<RBTreeNode<K, V>> {  in remove_node()  argument
410     pub fn remove(&mut self, key: &K) -> Option<V> {  in remove()
740     pub fn current(&self) -> (&K, &V) {  in current()
748     pub fn current_mut(&mut self) -> (&K, &mut V) {  in current_mut()
760     pub fn remove_current(self) -> (Option<Self>, RBTreeNode<K, V>) {  in remove_current()  argument
793     pub fn remove_prev(&mut self) -> Option<RBTreeNode<K, V>> {  in remove_prev()  argument
798     pub fn remove_next(&mut self) -> Option<RBTreeNode<K, V>> {  in remove_next()  argument
802     fn remove_neighbor(&mut self, direction: Direction) -> Option<RBTreeNode<K, V>> {  in remove_neighbor()  argument
838     pub fn peek_prev(&self) -> Option<(&K, &V)> {  in peek_prev()
843     pub fn peek_next(&self) -> Option<(&K, &V)> {  in peek_next()
847     fn peek(&self, direction: Direction) -> Option<(&K, &V)> {  in peek()
857     pub fn peek_prev_mut(&mut self) -> Option<(&K, &mut V)> {  in peek_prev_mut()
862     pub fn peek_next_mut(&mut self) -> Option<(&K, &mut V)> {  in peek_next_mut()
866     fn peek_mut(&mut self, direction: Direction) -> Option<(&K, &mut V)> {  in peek_mut()
890     unsafe fn to_key_value<'b>(node: NonNull<bindings::rb_node>) -> (&'b K, &'b V) {  in to_key_value()
900     unsafe fn to_key_value_mut<'b>(node: NonNull<bindings::rb_node>) -> (&'b K, &'b mut V) {  in to_key_value_mut()
910     unsafe fn to_key_value_raw<'b>(node: NonNull<bindings::rb_node>) -> (&'b K, *mut V) {  in to_key_value_raw()
1044     pub fn new(flags: Flags) -> Result<RBTreeNodeReservation<K, V>> {  in new()  argument
1062     pub fn into_node(mut self, key: K, value: V) -> RBTreeNode<K, V> {  in into_node()  argument
1085     pub fn new(key: K, value: V, flags: Flags) -> Result<RBTreeNode<K, V>> {  in new()  argument
1090     pub fn to_key_value(self) -> (K, V) {  in to_key_value()  argument
1111     pub fn into_reservation(self) -> RBTreeNodeReservation<K, V> {  in into_reservation()  argument
1163     fn insert(self, node: RBTreeNode<K, V>) -> &'a mut V {  in insert()  argument
1185     pub fn insert(self, value: V, reservation: RBTreeNodeReservation<K, V>) -> &'a mut V {  in insert()  argument
1202     pub fn get(&self) -> &V {  in get()
1210     pub fn get_mut(&mut self) -> &mut V {  in get_mut()
1220     pub fn into_mut(self) -> &'a mut V {  in into_mut()
1228     pub fn remove_node(self) -> RBTreeNode<K, V> {  in remove_node()  argument
1244     pub fn remove(self) -> V {  in remove()
1251     fn replace(self, node: RBTreeNode<K, V>) -> RBTreeNode<K, V> {  in replace()  argument