383if (Right(x_id) != NIL) 384return Minimum(Right(x_id)); //return left most node in right sub-tree. 387while (y_id != NIL && x_id == Right(y_id)) 446int y_id = Right(x_id); 484SetSubTreeSize(x_id, (SubTreeSize(Left(x_id)) + SubTreeSize(Right(x_id)) + (Next(x_id) == NIL ? 1 : SubTreeSize(Next(x_id))))); 489SetSubTreeSize(y_id, (SubTreeSize(Left(y_id)) + SubTreeSize(Right(y_id)) + (Next(y_id) == NIL ? 1 : SubTreeSize(Next(y_id))))); 504SetLeft(x_id, Right(y_id)); // Turn y's right subtree into x's left subtree 505if (Right(y_id) != NIL) 507SetParent(Right(y_id), x_id); 535SetSubTreeSize(x_id, (SubTreeSize(Left(x_id)) + SubTreeSize(Right(x_id)) + (Next(x_id) == NIL ? 1 : SubTreeSize(Next(x_id))))); 540SetSubTreeSize(y_id, (SubTreeSize(Left(y_id)) + SubTreeSize(Right(y_id)) + (Next(y_id) == NIL ? 1 : SubTreeSize(Next(y_id))))); 598Debug.Assert((NIL == Right(z_id)) || (0 < Compare(root_id, Right(z_id), z_id)), "Right is not right"); 600z_id = Right(z_id); 630SetRight(newMainTreeNodeId, Right(z_id)); 635else if (Right(Parent(z_id)) == z_id) 641if (Right(z_id) != NIL) 642SetParent(Right(z_id), newMainTreeNodeId); 689z_id = Right(z_id); 749y_id = Right(Parent(Parent(x_id))); // x.parent.parent.right; 759if (x_id == Right(Parent(x_id))) 891if (Left(z_id) == NIL || Right(z_id) == NIL) 899x_id = Right(y_id); 982SetRight(satelliteRootId, Right(mNode)); 1003if (Right(mNode) != NIL) 1005SetParent(Right(mNode), satelliteRootId); 1035SetRight(y_id, Right(z_id)); 1060if (Right(z_id) != NIL) 1062SetParent(Right(z_id), y_id); 1112w_id = (x_id == NIL) ? Right(px_id) : Right(Parent(x_id)); // w is x's right sibling and it cannot be NIL 1124w_id = (x_id == NIL) ? Right(px_id) : Right(Parent(x_id)); 1127if (color(Left(w_id)) == NodeColor.black && color(Right(w_id)) == NodeColor.black) 1135if (color(Right(w_id)) == NodeColor.black) 1140w_id = (x_id == NIL) ? Right(px_id) : Right(Parent(x_id)); 1145SetColor(Right(w_id), NodeColor.black); 1179if (color(Right(w_id)) == NodeColor.black && color(Left(w_id)) == NodeColor.black) 1189SetColor(Right(w_id), NodeColor.black); 1236Debug.Assert((NIL == Right(x_id)) || (0 < Compare(root_id, Right(x_id), x_id)), "Search duplicate Right is not right"); 1238x_id = Right(x_id); 1266Debug.Assert((NIL == Right(x_id)) || (0 < Compare(NIL, Right(x_id), x_id)), "Search Right is not right"); 1268x_id = Right(x_id); 1415if (nodeId == Right(parent)) 1433if (nodeId == Right(parent)) 1503x_id = Right(x_id); 1523x_id = Right(x_id); 1543if (!CheckUnique(Left(curNodeId)) || !CheckUnique(Right(curNodeId))) 1591if ((index = IndexOf(Right(nodeId), item)) != -1) 1762int myCorrectSize = SubTreeSize(Left(nodeId)) + SubTreeSize(Right(nodeId)) + (Next(nodeId) == NIL ? 1 : SubTreeSize(Next(nodeId))); 1785int myCorrectSize = SubTreeSize(Left(nodeId)) + SubTreeSize(Right(nodeId)) + (Next(nodeId) == NIL ? 1 : SubTreeSize(Next(nodeId)));

559else { x = _records.Right(x); } 569else { x = _records.Right(x); } 602else { x = _records.Right(x); } 621else { x = _records.Right(x); } 638else { x = _records.Right(x); } 1023GetUniqueKeyValues(list, _records.Right(curNodeId));