std/container/rbtree.d

120      * Get the right child
122     @property inout(RBNode)* right() inout
150      * Set the right child.  Also updates the new child's parent node.  This
155     @property Node right(Node newNode)
165     // performs rotate-right operation, where this is T, _right is R, _left is
177      * Rotate right.  This performs the following operations:
179      *  - This node becomes the new parent's right child.
180      *  - The old right child of the new parent becomes the left child of this
194             parent.right = _left;
198         _left.right = &this;
221      *  - The right child becomes the parent of this node.
223      *  - The old left child of the new parent becomes the right child of this
237             parent.right = _right;
244         right = tmp;
321                         // parent is right node, y is 'uncle'
406                 _parent.right = y;
412                 y.right = &this;
414                 y.right = _right;
421             right = yr;
427                     yp.right = &this;
448             _parent.right = x;
468                     Node wr = w.right;
495                     // right node
505                     Node wr = w.right;
542                 _parent.right = null;
582         if (n.right is null)
589             return n.right.leftmost;
624             copy.right = _right.dup(alloc);
635             copy.right = _right.dup();
849                     cur = cur.right;
867                     cur = cur.right;
901                         // add to right of new parent
918                     nxt = newParent.right;
922                         // add to right of new parent
924                         newParent.right = result = allocate(n);
1502                 cur = cur.right;
1516                 cur = cur.right;
1632                 printTree(n.right, indent + 2);
1662                 if (n.parent.left !is n && n.parent.right !is n)
1678                             (n.right !is null && n.right.color == n.color.Red))
1683                 int r = recurse(n.right, path ~ "R");
1689                         "Node at path " ~ path ~ " has different number of black nodes on left and right paths"