| H A D | rbtree.rs | 35 /// tree.try_create_and_insert(30, 300, flags::GFP_KERNEL)?;
41 /// assert_eq!(tree.get(&30).unwrap(), &300);
49 /// assert_eq!(iter.next().unwrap(), (&30, &300));
66 /// assert_eq!(iter.next().unwrap(), (&30, &300));
71 /// *tree.get_mut(&30).unwrap() = 3000;
78 /// assert_eq!(iter.next().unwrap(), (&30, &3000));
89 /// assert_eq!(iter.next().unwrap(), (&30, &3000));
126 /// tree.try_create_and_insert(30, 300, flags::GFP_KERNEL)?;
133 /// assert_eq!(iter.next().unwrap(), (&30, &300));
138 /// let existing = tree.remove(&30)
196 iter(&self) -> Iter<'_, K, V> iter() argument
211 iter_mut(&mut self) -> IterMut<'_, K, V> iter_mut() argument
241 cursor_front(&mut self) -> Option<Cursor<'_, K, V>> cursor_front() argument
256 cursor_back(&mut self) -> Option<Cursor<'_, K, V>> cursor_back() argument
284 try_create_and_insert( &mut self, key: K, value: V, flags: Flags, ) -> Result<Option<RBTreeNode<K, V>>> try_create_and_insert() argument
286 try_create_and_insert( &mut self, key: K, value: V, flags: Flags, ) -> Result<Option<RBTreeNode<K, V>>> try_create_and_insert() argument
296 insert(&mut self, node: RBTreeNode<K, V>) -> Option<RBTreeNode<K, V>> insert() argument
306 raw_entry(&mut self, key: &K) -> RawEntry<'_, K, V> raw_entry() argument
360 entry(&mut self, key: K) -> Entry<'_, K, V> entry() argument
368 find_mut(&mut self, key: &K) -> Option<OccupiedEntry<'_, K, V>> find_mut() argument
376 get(&self, key: &K) -> Option<&V> get() argument
396 get_mut(&mut self, key: &K) -> Option<&mut V> get_mut() argument
403 remove_node(&mut self, key: &K) -> Option<RBTreeNode<K, V>> remove_node() argument
410 remove(&mut self, key: &K) -> Option<V> remove() argument
740 current(&self) -> (&K, &V) current() argument
748 current_mut(&mut self) -> (&K, &mut V) current_mut() argument
760 remove_current(self) -> (Option<Self>, RBTreeNode<K, V>) remove_current() argument
793 remove_prev(&mut self) -> Option<RBTreeNode<K, V>> remove_prev() argument
798 remove_next(&mut self) -> Option<RBTreeNode<K, V>> remove_next() argument
802 remove_neighbor(&mut self, direction: Direction) -> Option<RBTreeNode<K, V>> remove_neighbor() argument
838 peek_prev(&self) -> Option<(&K, &V)> peek_prev() argument
843 peek_next(&self) -> Option<(&K, &V)> peek_next() argument
847 peek(&self, direction: Direction) -> Option<(&K, &V)> peek() argument
857 peek_prev_mut(&mut self) -> Option<(&K, &mut V)> peek_prev_mut() argument
862 peek_next_mut(&mut self) -> Option<(&K, &mut V)> peek_next_mut() argument
866 peek_mut(&mut self, direction: Direction) -> Option<(&K, &mut V)> peek_mut() argument
890 to_key_value<'b>(node: NonNull<bindings::rb_node>) -> (&'b K, &'b V) to_key_value() argument
900 to_key_value_mut<'b>(node: NonNull<bindings::rb_node>) -> (&'b K, &'b mut V) to_key_value_mut() argument
910 to_key_value_raw<'b>(node: NonNull<bindings::rb_node>) -> (&'b K, *mut V) to_key_value_raw() argument
919 let v = unsafe { addr_of_mut!((*this).value) }; to_key_value_raw() localVariable
1044 new(flags: Flags) -> Result<RBTreeNodeReservation<K, V>> new() argument
1062 into_node(mut self, key: K, value: V) -> RBTreeNode<K, V> into_node() argument
1085 new(key: K, value: V, flags: Flags) -> Result<RBTreeNode<K, V>> new() argument
1090 to_key_value(self) -> (K, V) to_key_value() argument
1111 into_reservation(self) -> RBTreeNodeReservation<K, V> into_reservation() argument
1163 insert(self, node: RBTreeNode<K, V>) -> &'a mut V insert() argument
1185 insert(self, value: V, reservation: RBTreeNodeReservation<K, V>) -> &'a mut V insert() argument
1202 get(&self) -> &V get() argument
1210 get_mut(&mut self) -> &mut V get_mut() argument
1220 into_mut(self) -> &'a mut V into_mut() argument
1228 remove_node(self) -> RBTreeNode<K, V> remove_node() argument
1244 remove(self) -> V remove() argument
1251 replace(self, node: RBTreeNode<K, V>) -> RBTreeNode<K, V> replace() argument
[all...] |