Lines Matching refs:right
61 if (x->right())
62 return treeMinimum(x->right());
64 while (y && x == y->right()) {
124 NodeType* right() const
167 NodeType* y = x->parent()->parent()->right();
175 if (x == x->parent()->right()) {
186 // Same as "then" clause with "right" and "left" exchanged.
218 if (!z->left() || !z->right())
228 x = y->right();
254 y->setRight(z->right());
258 if (z->right())
259 z->right()->setParent(y);
291 current = current->right();
303 current = current->right();
322 current = current->right();
369 while (x->right())
370 x = x->right();
383 while (x->right())
384 x = x->right();
391 ASSERT(!z->right());
402 x = x->right();
420 // Returns the new root of the subtree (x's right child).
424 NodeType* y = x->right();
426 // Turn y's left subtree into x's right subtree.
456 // Turn x's right subtree into y's left subtree.
457 y->setLeft(x->right());
458 if (x->right())
459 x->right()->setParent(y);
472 // Put y on x's right.
490 NodeType* w = xParent->right();
497 w = xParent->right();
500 && (!w->right() || w->right()->color() == Black)) {
506 if (!w->right() || w->right()->color() == Black) {
511 w = xParent->right();
516 if (w->right())
517 w->right()->setColor(Black);
523 // Same as "then" clause with "right" and "left"
539 if ((!w->right() || w->right()->color() == Black)
548 w->right()->setColor(Black);