Lines Matching refs:right
286 Node* right() const { return m_right; }
309 // given node based on the values in the left and right children. It
312 // in the left and right children. This method should return true if
339 current = current->right();
353 return treeSearchFullComparisons(current->right(), data);
357 // We may need to traverse both the left and right subtrees.
360 result = treeSearchFullComparisons(current->right(), data);
373 x = x->right();
390 if (x->right())
391 return treeMinimum(x->right());
393 while (y && x == y->right()) {
424 // Returns the new root of the subtree (x's right child).
428 Node* y = x->right();
430 // Turn y's left subtree into x's right subtree.
463 // Turn x's right subtree into y's left subtree.
464 y->setLeft(x->right());
465 if (x->right())
466 x->right()->setParent(y);
479 // Put y on x's right.
503 Node* y = x->parent()->parent()->right();
515 if (x == x->parent()->right()) {
529 // Same as "then" clause with "right" and "left" exchanged.
574 Node* w = xParent->right();
581 w = xParent->right();
584 && (!w->right() || w->right()->color() == Black)) {
590 if (!w->right() || w->right()->color() == Black) {
595 w = xParent->right();
600 if (w->right())
601 w->right()->setColor(Black);
607 // Same as "then" clause with "right" and "left"
623 if ((!w->right() || w->right()->color() == Black)
632 w->right()->setColor(Black);
660 if (!z->left() || !z->right())
670 x = y->right();
712 if (node->right())
713 visitInorderImpl(node->right(), visitor);
723 if (node->right())
724 markFree(node->right());
769 if (!((!node->right() || node->right()->color() == Black)))
777 bool rightValid = checkInvariantsFromNode(node->right(), &rightCount);
810 dumpFromNode(node->right(), indentation + 2);