285     ) -> Result<Option<RBTreeNode<K, V>>> {  in try_create_and_insert()
286         Ok(self.insert(RBTreeNode::new(key, value, flags)?))  in try_create_and_insert()
295     pub fn insert(&mut self, node: RBTreeNode<K, V>) -> Option<RBTreeNode<K, V>> {  in insert()
402     pub fn remove_node(&mut self, key: &K) -> Option<RBTreeNode<K, V>> {  in remove_node()
759     pub fn remove_current(self) -> (Option<Self>, RBTreeNode<K, V>) {  in remove_current()
767         let node = RBTreeNode { node };  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()
812             return Some(RBTreeNode { node });  in remove_neighbor()
1064     pub fn into_node(self, key: K, value: V) -> RBTreeNode<K, V> {  in into_node()
1073         RBTreeNode { node }  in into_node()
1081 pub struct RBTreeNode<K, V> {  struct
1085 impl<K, V> RBTreeNode<K, V> {  impl
1088     pub fn new(key: K, value: V, flags: Flags) -> Result<RBTreeNode<K, V>> {  in new()
1102 unsafe impl<K: Send, V: Send> Send for RBTreeNode<K, V> {}  implementation
1106 unsafe impl<K: Sync, V: Sync> Sync for RBTreeNode<K, V> {}  implementation
1108 impl<K, V> RBTreeNode<K, V> {  implementation
1168     fn insert(self, node: RBTreeNode<K, V>) -> &'a mut V {  in insert()
1233     pub fn remove_node(self) -> RBTreeNode<K, V> {  in remove_node()
1239         RBTreeNode {  in remove_node()
1259     fn replace(self, node: RBTreeNode<K, V>) -> RBTreeNode<K, V> {  in replace()
1278         RBTreeNode { node: old_node }  in replace()