432while (Left(x_id) != NIL) 434x_id = Left(x_id); 449SetRight(x_id, Left(y_id)); 450if (Left(y_id) != NIL) 452SetParent(Left(y_id), x_id); 469else if (x_id == Left(Parent(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))))); 502int y_id = Left(x_id); 524else if (x_id == Left(Parent(x_id))) // x is left child of its parent 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))))); 591Debug.Assert((NIL == Left(z_id)) || (0 > Compare(root_id, Left(z_id), z_id)), "Left is not left"); 593z_id = Left(z_id); 629SetLeft(newMainTreeNodeId, Left(z_id)); 633if (Left(Parent(z_id)) == z_id) 639if (Left(z_id) != NIL) 640SetParent(Left(z_id), newMainTreeNodeId); 680int c = (position) - (SubTreeSize(Left(y_id))); 684z_id = Left(z_id); 747if (Parent(x_id) == Left(Parent(Parent(x_id)))) // if x.parent is a left child 772y_id = Left(Parent(Parent(x_id))); // y = x.parent.parent.left; 782if (x_id == Left(Parent(x_id))) 891if (Left(z_id) == NIL || Right(z_id) == NIL) 896if (Left(y_id) != NIL) 897x_id = Left(y_id); 916else if (y_id == Left(py_id)) // update y's parent to point to X as its child 981SetLeft(satelliteRootId, Left(mNode)); 988if (Left(Parent(mNode)) == mNode) 999if (Left(mNode) != NIL) 1001SetParent(Left(mNode), satelliteRootId); 1034SetLeft(y_id, Left(z_id)); 1041if (Left(Parent(z_id)) == z_id) 1056if (Left(z_id) != NIL) 1058SetParent(Left(z_id), y_id); 1108if ((x_id != NIL && x_id == Left(Parent(x_id))) || (x_id == NIL && Left(px_id) == NIL)) 1127if (color(Left(w_id)) == NodeColor.black && color(Right(w_id)) == NodeColor.black) 1137SetColor(Left(w_id), NodeColor.black); 1154w_id = Left(px_id); 1162w_id = (x_id == NIL) ? Left(px_id) : Left(Parent(x_id)); 1170w_id = (x_id == NIL) ? Left(px_id) : Left(Parent(x_id)); 1179if (color(Right(w_id)) == NodeColor.black && color(Left(w_id)) == NodeColor.black) 1187if (color(Left(w_id)) == NodeColor.black) 1192w_id = (x_id == NIL) ? Left(px_id) : Left(Parent(x_id)); 1197SetColor(Left(w_id), NodeColor.black); 1229Debug.Assert((NIL == Left(x_id)) || (0 > Compare(root_id, Left(x_id), x_id)), "Search duplicate Left is not left"); 1231x_id = Left(x_id); 1259Debug.Assert((NIL == Left(x_id)) || (0 > Compare(NIL, Left(x_id), x_id)), "Search Left is not left"); 1261x_id = Left(x_id); 1408int myRank = SubTreeSize(Left(nodeId)); 1417myRank += (SubTreeSize(Left(parent)) + 1); 1429int myRank = SubTreeSize(Left(nodeId)); 1435myRank += (SubTreeSize(Left(parent)) + ((Next(parent) == NIL) ? 1 : SubTreeSize(Next(parent)))); 1483while (x_id != NIL && !(((rank = SubTreeSize(Left(x_id)) + 1) == index) && Next(x_id) == NIL)) 1487x_id = Left(x_id); 1515int y_id = Left(x_id); 1543if (!CheckUnique(Left(curNodeId)) || !CheckUnique(Right(curNodeId))) 1587if ((index = IndexOf(Left(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)));

558if (c < 0) { x = _records.Left(x); } // < for decsending 568if (c > 0) { x = _records.Left(x); } // > for ascending 601if (c > 0) { x = _records.Left(x); } 620if (c > 0) { x = _records.Left(x); } 637if (c < 0) { x = _records.Left(x); } 1013GetUniqueKeyValues(list, _records.Left(curNodeId));