195     pub fn iter(&self) -> Iter<'_, K, V> {  in iter()  argument
210     pub fn iter_mut(&mut self) -> IterMut<'_, K, V> {  in iter_mut()  argument
240     pub fn cursor_front(&mut self) -> Option<Cursor<'_, K, V>> {  in cursor_front()  argument
255     pub fn cursor_back(&mut self) -> Option<Cursor<'_, K, V>> {  in cursor_back()  argument
282         key: K,  in try_create_and_insert()
285     ) -> Result<Option<RBTreeNode<K, V>>> {  in try_create_and_insert()
295     pub fn insert(&mut self, node: RBTreeNode<K, V>) -> Option<RBTreeNode<K, V>> {  in insert()  argument
305     fn raw_entry(&mut self, key: &K) -> RawEntry<'_, K, V> {  in raw_entry()  argument
359     pub fn entry(&mut self, key: K) -> Entry<'_, K, V> {  in entry()  argument
367     pub fn find_mut(&mut self, key: &K) -> Option<OccupiedEntry<'_, K, V>> {  in find_mut()  argument
402     pub fn remove_node(&mut self, key: &K) -> Option<RBTreeNode<K, V>> {  in remove_node()
418     pub fn cursor_lower_bound(&mut self, key: &K) -> Option<Cursor<'_, K, V>>  in cursor_lower_bound()  argument
739     pub fn current(&self) -> (&K, &V) {  in current()
747     pub fn current_mut(&mut self) -> (&K, &mut V) {  in current_mut()
759     pub fn remove_current(self) -> (Option<Self>, RBTreeNode<K, V>) {  in remove_current()
792     pub fn remove_prev(&mut self) -> Option<RBTreeNode<K, V>> {  in remove_prev()
797     pub fn remove_next(&mut self) -> Option<RBTreeNode<K, V>> {  in remove_next()
801     fn remove_neighbor(&mut self, direction: Direction) -> Option<RBTreeNode<K, V>> {  in remove_neighbor()
837     pub fn peek_prev(&self) -> Option<(&K, &V)> {  in peek_prev()
842     pub fn peek_next(&self) -> Option<(&K, &V)> {  in peek_next()
846     fn peek(&self, direction: Direction) -> Option<(&K, &V)> {  in peek()
856     pub fn peek_prev_mut(&mut self) -> Option<(&K, &mut V)> {  in peek_prev_mut()
861     pub fn peek_next_mut(&mut self) -> Option<(&K, &mut V)> {  in peek_next_mut()
865     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()
901     unsafe fn to_key_value_mut<'b>(node: NonNull<bindings::rb_node>) -> (&'b K, &'b mut V) {  in to_key_value_mut()
912     unsafe fn to_key_value_raw<'b>(node: NonNull<bindings::rb_node>) -> (&'b K, *mut V) {  in to_key_value_raw()
1046     pub fn new(flags: Flags) -> Result<RBTreeNodeReservation<K, V>> {  in new()
1064     pub fn into_node(self, key: K, value: V) -> RBTreeNode<K, V> {  in into_node()
1088     pub fn new(key: K, value: V, flags: Flags) -> Result<RBTreeNode<K, V>> {  in new()
1093     pub fn to_key_value(self) -> (K, V) {  in to_key_value()
1116     pub fn into_reservation(self) -> RBTreeNodeReservation<K, V> {  in into_reservation()
1168     fn insert(self, node: RBTreeNode<K, V>) -> &'a mut V {  in insert()
1190     pub fn insert(self, value: V, reservation: RBTreeNodeReservation<K, V>) -> &'a mut V {  in insert()
1233     pub fn remove_node(self) -> RBTreeNode<K, V> {  in remove_node()
1259     fn replace(self, node: RBTreeNode<K, V>) -> RBTreeNode<K, V> {  in replace()  argument