Lines Matching refs:root
342 root: NodePtr<K, V>, field
362 new.root = self.root.deep_clone(); in clone()
406 if self.root.is_null() { in print_tree()
411 self.tree_print(self.root, 0); in print_tree()
815 let iter = if self.root.is_null() { in into_iter()
837 root: NodePtr::null(), in new()
851 self.root.is_null() in is_empty()
878 if node == self.root { in left_rotate()
879 self.root = temp; in left_rotate()
913 if node == self.root { in right_rotate()
914 self.root = temp; in right_rotate()
1005 self.root.set_black_color(); in insert_fixup()
1013 let mut x = self.root; in insert()
1029 self.root = node; in insert()
1049 if self.root.is_null() { in find_node()
1052 let mut temp = &self.root; in find_node()
1071 if self.root.is_null() { in first_child()
1074 let mut temp = self.root; in first_child()
1084 if self.root.is_null() { in last_child()
1087 let mut temp = self.root; in last_child()
1204 let root = self.root; in clear() localVariable
1205 self.root = NodePtr::null(); in clear()
1206 self.clear_recurse(root); in clear()
1213 self.root = NodePtr::null(); in fast_clear()
1229 while node != self.root && node.is_black_color() { in delete_fixup()
1258 node = self.root; in delete_fixup()
1289 node = self.root; in delete_fixup()
1310 if node == self.root { in delete()
1311 self.root = replace; in delete()
1359 if self.root == node { in delete()
1360 self.root = child in delete()