414if (NIL != Next(nodeId)) 421nodeId = Minimum(Next(nodeId)); 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))))); 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))))); 609if (Next(z_id) != NIL) 611root_id = RBInsert(Next(z_id), x_id, z_id, -1, false); // z_id is existing mainTreeNodeID 612SetKey(z_id, Key(Next(z_id))); 874if (Next(z_id) != NIL) 875return RBDeleteX(Next(z_id), Next(z_id), z_id); // delete root of satellite tree. 881if (Next(mNode) != NIL) 882root_id = Next(mNode); 884if (SubTreeSize(Next(mNode)) == 2) // Next(mNode) == root_id 886else if (SubTreeSize(Next(mNode)) == 1) 927SetNext(z_id, Next(y_id)); //z.value = y.value; 930if (Next(mNode) != NIL) 975if (mNode == NIL || SubTreeSize(Next(mNode)) != 1) 980int satelliteRootId = Next(mNode); 1015else if (Next(mNode) != NIL) 1074if (mNode != NIL && Next(mNode) == z_id) 1295if (Next(nodeId) != NIL) 1297return new NodePath(SearchSubTree(Next(nodeId), key), nodeId); 1353else if (NIL != Next(node)) 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)) 1489else if (Next(x_id) != NIL && index >= rank && index <= rank + SubTreeSize(Next(x_id)) - 1) 1494return ComputeNodeByIndex(Next(x_id), index); //satellite tree root 1498if (Next(x_id) == NIL) 1501index -= rank + SubTreeSize(Next(x_id)) - 1; 1513Debug.Assert(NIL == Next(x_id), "has unexpected satellite tree"); 1540if (Next(curNodeId) != NIL) 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))); 1912Debug.Assert(NIL != tree.Next(_mainTreeNodeID), "MainTreeNodeID should have a Next"); 1922Debug.Assert(NIL == tree.Next(_nodeID), "NodeID should not have a Next"); 1935Debug.Assert(NIL == tree.Next(node), "duplicate node should not have a next"); 1940(tree.Next(_mainTreeNodeID) == node), "NodeID parent change doesn't align");

654if (_records.Next(nodeId) == IndexTree.NIL) 657int span = _records.SubTreeSize(_records.Next(nodeId));