14 writes to Right
System (14)
compmod\system\collections\generic\sortedset.cs (14)
151
myCurrent.
Right
= myRight;
408
parent.
Right
= node;
745
parent.
Right
= newChild;
767
succesor.
Right
= match.Right;
842
node.
Right
= x.Left;
852
grandChild.
Right
= node;
853
child.
Right
= grandChild.Left;
861
x.
Right
= node;
869
node.
Right
= grandChild.Left;
872
grandChild.
Right
= child;
1086
root.
Right
= new Node(arr[endIndex], false);
1094
root.
Right
= new Node(arr[endIndex], false);
1104
root.
Right
= ConstructRootFromSortedArray(arr, midpt + 2, endIndex, new Node(arr[midpt + 1], true));
1106
root.
Right
= ConstructRootFromSortedArray(arr, midpt + 1, endIndex, null);
51 references to Right
System (51)
compmod\system\collections\generic\sortedset.cs (51)
146
Node theirRight = theirCurrent.
Right
;
239
current = (reverse ? current.
Right
: current.Left);
247
Node node = (reverse ? current.Left : current.
Right
);
250
node = (reverse ? node.
Right
: node.Left);
282
if (current.
Right
!= null) {
283
processQueue.Add(current.
Right
);
401
current = (order < 0) ? current.Left : current.
Right
;
469
if (parent.
Right
== sibling) {
486
sibling = (parent.Left == current) ? parent.
Right
: parent.Left;
505
Debug.Assert(parent.
Right
== sibling, "sibling must be left child of parent!");
506
Debug.Assert(sibling.
Right
.IsRed, "Right child of sibling must be red!");
507
sibling.
Right
.IsRed = false;
512
Debug.Assert(parent.
Right
== sibling, "sibling must be left child of parent!");
519
Debug.Assert(sibling.
Right
.IsRed, "Right child of sibling must be red!");
551
current = current.
Right
; // continue the search in right sub tree after we find a match
679
return parent.
Right
;
691
bool parentIsOnRight = (grandParent.
Right
== parent);
692
bool currentIsOnRight = (parent.
Right
== current);
711
return IsBlack(node) && IsNullOrBlack(node.Left) && IsNullOrBlack(node.
Right
);
715
return IsRed(node.Left) && IsRed(node.
Right
);
755
Debug.Assert(match.
Right
== null, "Right child must be null!");
760
Debug.Assert((succesor.
Right
== null && succesor.IsRed) || (succesor.
Right
.IsRed && !succesor.IsRed), "Succesor must be in valid state");
761
if (succesor.
Right
!= null) {
762
succesor.
Right
.IsRed = false;
766
parentOfSuccesor.Left = succesor.
Right
;
767
succesor.Right = match.
Right
;
788
current = (order < 0) ? current.Left : current.
Right
;
806
current = (order < 0) ? current.Left : current.
Right
;
822
current = current.
Right
;
841
Node x = node.
Right
;
849
Node grandChild = child.
Right
;
851
node.Left = grandChild.
Right
;
860
node.Left = x.
Right
;
866
Node child = node.
Right
;
871
child.Left = grandChild.
Right
;
881
Debug.Assert(IsRed(sibling.Left) || IsRed(sibling.
Right
), "sibling must have at least one red child");
959
node.
Right
.IsRed = false;
1087
root.
Right
.IsRed = true;
1862
current = (reverse ? current.
Right
: current.Left);
1864
current = current.
Right
;
1876
Node node = (reverse ? current.Left : current.
Right
);
1880
node = (reverse ? node.
Right
: node.Left);
1882
node = node.
Right
;
1911
if (current.
Right
!= null && (!uBoundActive || Comparer.Compare(max, current.Item) > 0)) {
1912
processQueue.Add(current.
Right
);
2267
next = (reverse ? node.
Right
: node.Left);
2268
other = (reverse ? node.Left : node.
Right
);
2296
SortedSet<T>.Node node = (reverse ? current.Left : current.
Right
);
2299
next = (reverse ? node.
Right
: node.Left);
2300
other = (reverse ? node.Left : node.
Right
);