| H A D | rbtree.rs | 171 pub struct RBTree<K, V> {
173 _p: PhantomData<Node<K, V>>,
177 // fields, so we use the same Send condition as would be used for a struct with K and V fields.
178 unsafe impl<K: Send, V: Send> Send for RBTree<K, V> {}
181 // fields, so we use the same Sync condition as would be used for a struct with K and V fields.
182 unsafe impl<K: Sync, V: Sync> Sync for RBTree<K, V> {}
184 impl<K, V> RBTree<K,
201 iter(&self) -> Iter<'_, K, V> iter() argument
216 iter_mut(&mut self) -> IterMut<'_, K, V> iter_mut() argument
246 cursor_front_mut(&mut self) -> Option<CursorMut<'_, K, V>> cursor_front_mut() argument
261 cursor_front(&self) -> Option<Cursor<'_, K, V>> cursor_front() argument
276 cursor_back_mut(&mut self) -> Option<CursorMut<'_, K, V>> cursor_back_mut() argument
291 cursor_back(&self) -> Option<Cursor<'_, K, V>> cursor_back() argument
318 try_create_and_insert( &mut self, key: K, value: V, flags: Flags, ) -> Result<Option<RBTreeNode<K, V>>> try_create_and_insert() argument
321 try_create_and_insert( &mut self, key: K, value: V, flags: Flags, ) -> Result<Option<RBTreeNode<K, V>>> try_create_and_insert() argument
331 insert(&mut self, node: RBTreeNode<K, V>) -> Option<RBTreeNode<K, V>> insert() argument
341 raw_entry(&mut self, key: &K) -> RawEntry<'_, K, V> raw_entry() argument
395 entry(&mut self, key: K) -> Entry<'_, K, V> entry() argument
403 find_mut(&mut self, key: &K) -> Option<OccupiedEntry<'_, K, V>> find_mut() argument
438 remove_node(&mut self, key: &K) -> Option<RBTreeNode<K, V>> remove_node() argument
454 cursor_lower_bound_mut(&mut self, key: &K) -> Option<CursorMut<'_, K, V>> where K: Ord, cursor_lower_bound_mut() argument
475 cursor_lower_bound(&self, key: &K) -> Option<Cursor<'_, K, V>> where K: Ord, cursor_lower_bound() argument
826 current(&self) -> (&K, &V) current() argument
837 to_key_value<'b>(node: NonNull<bindings::rb_node>) -> (&'b K, &'b V) to_key_value() argument
851 peek_prev(&self) -> Option<(&K, &V)> peek_prev() argument
856 peek_next(&self) -> Option<(&K, &V)> peek_next() argument
860 peek(&self, direction: Direction) -> Option<(&K, &V)> peek() argument
895 current(&self) -> (&K, &V) current() argument
903 current_mut(&mut self) -> (&K, &mut V) current_mut() argument
915 remove_current(self) -> (Option<Self>, RBTreeNode<K, V>) remove_current() argument
939 remove_prev(&mut self) -> Option<RBTreeNode<K, V>> remove_prev() argument
944 remove_next(&mut self) -> Option<RBTreeNode<K, V>> remove_next() argument
948 remove_neighbor(&mut self, direction: Direction) -> Option<RBTreeNode<K, V>> remove_neighbor() argument
984 peek_prev(&self) -> Option<(&K, &V)> peek_prev() argument
989 peek_next(&self) -> Option<(&K, &V)> peek_next() argument
993 peek(&self, direction: Direction) -> Option<(&K, &V)> peek() argument
1003 peek_prev_mut(&mut self) -> Option<(&K, &mut V)> peek_prev_mut() argument
1008 peek_next_mut(&mut self) -> Option<(&K, &mut V)> peek_next_mut() argument
1012 peek_mut(&mut self, direction: Direction) -> Option<(&K, &mut V)> peek_mut() argument
1037 to_key_value<'b>(node: NonNull<bindings::rb_node>) -> (&'b K, &'b V) to_key_value() argument
1048 to_key_value_mut<'b>(node: NonNull<bindings::rb_node>) -> (&'b K, &'b mut V) to_key_value_mut() argument
1059 to_key_value_raw<'b>(node: NonNull<bindings::rb_node>) -> (&'b K, *mut V) to_key_value_raw() argument
1193 new(flags: Flags) -> Result<RBTreeNodeReservation<K, V>> new() argument
1211 into_node(self, key: K, value: V) -> RBTreeNode<K, V> into_node() argument
1235 new(key: K, value: V, flags: Flags) -> Result<RBTreeNode<K, V>> new() argument
1240 to_key_value(self) -> (K, V) to_key_value() argument
1263 into_reservation(self) -> RBTreeNodeReservation<K, V> into_reservation() argument
1315 insert(self, node: RBTreeNode<K, V>) -> &'a mut V insert() argument
1337 insert(self, value: V, reservation: RBTreeNodeReservation<K, V>) -> &'a mut V insert() argument
1380 remove_node(self) -> RBTreeNode<K, V> remove_node() argument
1404 replace(self, node: RBTreeNode<K, V>) -> RBTreeNode<K, V> replace() argument
[all...] |