36     left: NodePtr<K, V>,  field
96             left: NodePtr::null(),  in new()
151         self.parent().left() == *self  in is_left_child()
162         while !temp.left().is_null() {  in min_node()
163             temp = temp.left();  in min_node()
197         if !self.left().is_null() {  in prev()
198             self.left().max_node()  in prev()
222     fn set_left(&mut self, left: NodePtr<K, V>) {  in set_left()
226         unsafe { (*self.0).left = left }  in set_left()
246     fn left(&self) -> NodePtr<K, V> {  in left()  method
250         unsafe { (*self.0).left.clone() }  in left()
275         if !self.left().is_null() {  in deep_clone()
276             node.set_left(self.left().deep_clone());  in deep_clone()
277             node.left().set_parent(node);  in deep_clone()
397         self.tree_print(node.left(), -1);  in tree_print()
879         node.set_right(temp.left());  in left_rotate()
881         if !temp.left().is_null() {  in left_rotate()
882             temp.left().set_parent(node.clone());  in left_rotate()
888         } else if node == node.parent().left() {  in left_rotate()
913         let mut temp = node.left();  in right_rotate()
969             if parent == gparent.left() {  in insert_fixup()
994                 let mut uncle = gparent.left();  in insert_fixup()
1004                 if parent.left() == node {  in insert_fixup()
1031                     x = x.left();  in insert()
1068                     Ordering::Less => &mut (*temp.0).left,  in find_node()
1087             while !temp.left().is_null() {  in first_child()
1088                 temp = temp.left();  in first_child()
1194                 self.clear_recurse(current.left());  in clear_recurse()
1227             if parent.left() == node {  in delete_fixup()
1238                 if other.left().is_black_color() && other.right().is_black_color() {  in delete_fixup()
1245                         other.left().set_black_color();  in delete_fixup()
1259                 other = parent.left();  in delete_fixup()
1265                     other = parent.left();  in delete_fixup()
1269                 if other.left().is_black_color() && other.right().is_black_color() {  in delete_fixup()
1275                     if other.left().is_black_color() {  in delete_fixup()
1279                         other = parent.left();  in delete_fixup()
1284                     other.left().set_black_color();  in delete_fixup()
1303         if !node.left().is_null() && !node.right().is_null() {  in delete()
1310                 if node.parent().left() == node {  in delete()
1335             replace.set_left(node.left());  in delete()
1336             node.left().set_parent(replace);  in delete()
1346         if !node.left().is_null() {  in delete()
1347             child = node.left();  in delete()
1361             if parent.left() == node {  in delete()