ComputeNodeByIndex() [2/2]

int System.Data.RBTree< K >.ComputeNodeByIndex ( int x_id, int index )

inlineprivate

Definition at line 1197 of file RBTree.cs.

    {
        while (x_id != 0)
        {
            int num = Left(x_id);
            int num2 = SubTreeSize(num) + 1;
            if (index < num2)
            {
                x_id = num;
                continue;
            }
            if (num2 >= index)
            {
                break;
            }
            x_id = Right(x_id);
            index -= num2;
        }
        return x_id;
    }

References System.index, System.Collections.Generic.Left, System.Data.Right, and System.Data.RBTree< K >.SubTreeSize().