286     ) -> Result<Option<RBTreeNode<K, V>>> {  in try_create_and_insert()
287         Ok(self.insert(RBTreeNode::new(key, value, flags)?))  in try_create_and_insert()
296     pub fn insert(&mut self, node: RBTreeNode<K, V>) -> Option<RBTreeNode<K, V>> {  in insert()
403     pub fn remove_node(&mut self, key: &K) -> Option<RBTreeNode<K, V>> {  in remove_node()
760     pub fn remove_current(self) -> (Option<Self>, RBTreeNode<K, V>) {  in remove_current()
768         let node = RBTreeNode { node };  in remove_current()
793     pub fn remove_prev(&mut self) -> Option<RBTreeNode<K, V>> {  in remove_prev()
798     pub fn remove_next(&mut self) -> Option<RBTreeNode<K, V>> {  in remove_next()
802     fn remove_neighbor(&mut self, direction: Direction) -> Option<RBTreeNode<K, V>> {  in remove_neighbor()
813             return Some(RBTreeNode { node });  in remove_neighbor()
1062     pub fn into_node(mut self, key: K, value: V) -> RBTreeNode<K, V> {  in into_node()
1070         RBTreeNode { node }  in into_node()
1078 pub struct RBTreeNode<K, V> {  struct
1082 impl<K, V> RBTreeNode<K, V> {  argument
1085     pub fn new(key: K, value: V, flags: Flags) -> Result<RBTreeNode<K, V>> {  in new()
1097 unsafe impl<K: Send, V: Send> Send for RBTreeNode<K, V> {}  implementation
1101 unsafe impl<K: Sync, V: Sync> Sync for RBTreeNode<K, V> {}  implementation
1103 impl<K, V> RBTreeNode<K, V> {  impl
1163     fn insert(self, node: RBTreeNode<K, V>) -> &'a mut V {  in insert()
1228     pub fn remove_node(self) -> RBTreeNode<K, V> {  in remove_node()
1234         RBTreeNode {  in remove_node()
1251     fn replace(self, node: RBTreeNode<K, V>) -> RBTreeNode<K, V> {  in replace()
1270         RBTreeNode { node: old_node }  in replace()