37     right: NodePtr<K, V>,  field
97             right: NodePtr::null(),  in new()
156         self.parent().right() == *self  in is_right_child()
171         while !temp.right().is_null() {  in max_node()
172             temp = temp.right();  in max_node()
179         if !self.right().is_null() {  in next()
180             self.right().min_node()  in next()
230     fn set_right(&mut self, right: NodePtr<K, V>) {  in set_right()
234         unsafe { (*self.0).right = right }  in set_right()
254     fn right(&self) -> NodePtr<K, V> {  in right()  method
258         unsafe { (*self.0).right.clone() }  in right()
279         if !self.right().is_null() {  in deep_clone()
280             node.set_right(self.right().deep_clone());  in deep_clone()
281             node.right().set_parent(node);  in deep_clone()
398         self.tree_print(node.right(), 1);  in tree_print()
878         let mut temp = node.right();  in left_rotate()
914         node.set_left(temp.right());  in right_rotate()
916         if !temp.right().is_null() {  in right_rotate()
917             temp.right().set_parent(node.clone());  in right_rotate()
923         } else if node == node.parent().right() {  in right_rotate()
971                 let mut uncle = gparent.right();  in insert_fixup()
981                 if parent.right() == node {  in insert_fixup()
1034                     x = x.right();  in insert()
1069                     Ordering::Greater => &mut (*temp.0).right,  in find_node()
1100             while !temp.right().is_null() {  in last_child()
1101                 temp = temp.right();  in last_child()
1195                 self.clear_recurse(current.right());  in clear_recurse()
1228                 other = parent.right();  in delete_fixup()
1234                     other = parent.right();  in delete_fixup()
1238                 if other.left().is_black_color() && other.right().is_black_color() {  in delete_fixup()
1244                     if other.right().is_black_color() {  in delete_fixup()
1248                         other = parent.right();  in delete_fixup()
1253                     other.right().set_black_color();  in delete_fixup()
1269                 if other.left().is_black_color() && other.right().is_black_color() {  in delete_fixup()
1276                         other.right().set_black_color();  in delete_fixup()
1303         if !node.left().is_null() && !node.right().is_null() {  in delete()
1306             let mut replace = node.right().min_node();  in delete()
1319             child = replace.right();  in delete()
1329                 replace.set_right(node.right());  in delete()
1330                 node.right().set_parent(replace);  in delete()
1349             child = node.right();  in delete()