13 writes to Right
System.Collections (13)
System\Collections\Generic\SortedSet.cs (13)
360
parent.
Right
= node;
679
successor.
Right
= match.Right;
956
root.
Right
= new Node(arr[endIndex], NodeColor.Black);
966
root.
Right
= new Node(arr[endIndex], NodeColor.Black);
976
root.
Right
= size % 2 == 0 ?
1652
next.target.
Right
= clonedNode;
1735
Right
= child.Left;
1749
grandChild.
Right
= this;
1750
child.
Right
= grandChild.Left;
1762
child.
Right
= this;
1774
Right
= grandChild.Left;
1777
grandChild.
Right
= child;
1813
Right
= newChild;
56 references to Right
System.Collections (56)
System\Collections\Generic\SortedSet.cs (49)
211
Node? node = current.
Right
;
253
if (current.
Right
!= null)
255
processQueue.Enqueue(current.
Right
);
352
current = (order < 0) ? current.Left : current.
Right
;
425
if (parent.
Right
== sibling)
486
current = order < 0 ? current.Left : current.
Right
;
612
bool parentIsOnRight = grandParent.
Right
== parent;
613
bool currentIsOnRight = parent.
Right
== current;
664
Debug.Assert(match.
Right
== null);
671
Debug.Assert((successor.
Right
== null && successor.IsRed) || (successor.
Right
!.IsRed && successor.IsBlack));
673
successor.
Right
?.ColorBlack();
678
parentOfSuccessor.Left = successor.
Right
;
679
successor.Right = match.
Right
;
704
current = order < 0 ? current.Left : current.
Right
;
736
current = order < 0 ? current.Left : current.
Right
;
752
current = current.
Right
;
957
root.
Right
.ColorRed();
1493
while (current.
Right
!= null)
1495
current = current.
Right
;
1620
public bool Is2Node => IsBlack && IsNullOrBlack(Left) && IsNullOrBlack(
Right
);
1622
public bool Is4Node => IsNonNullRed(Left) && IsNonNullRed(
Right
);
1649
if (next.source.
Right
is Node right)
1665
Debug.Assert(IsNonNullRed(sibling.Left) || IsNonNullRed(sibling.
Right
));
1682
Debug.Assert(node == Left ^ node ==
Right
);
1684
return node == Left ?
Right
! : Left!;
1692
Debug.Assert(
Right
!= null);
1696
Right
.ColorBlack();
1713
removeRed =
Right
!.
Right
!;
1718
Debug.Assert(
Right
!.Left!.IsRed);
1721
Debug.Assert(Left!.
Right
!.IsRed);
1734
Node child =
Right
!;
1746
Node grandChild = child.
Right
!;
1748
Left = grandChild.
Right
;
1761
Left = child.
Right
;
1771
Node child =
Right
!;
1776
child.Left = grandChild.
Right
;
1788
Debug.Assert(
Right
!.Is2Node);
1793
Right
.ColorRed();
1818
private int GetCount() => 1 + (Left?.GetCount() ?? 0) + (
Right
?.GetCount() ?? 0);
1820
private bool HasChild(Node child) => child == Left || child ==
Right
;
1826
return (Left == child1 &&
Right
== child2)
1827
|| (Left == child2 &&
Right
== child1);
1878
next = (_reverse ? node.
Right
: node.Left);
1879
other = (_reverse ? node.Left : node.
Right
);
1913
Node? node = (_reverse ? _current.Left : _current.
Right
);
1917
next = (_reverse ? node.
Right
: node.Left);
1918
other = (_reverse ? node.Left : node.
Right
);
System\Collections\Generic\SortedSet.TreeSubSet.cs (7)
138
current = current.
Right
;
177
current = current.
Right
;
207
current = current.
Right
;
223
Node? node = current.
Right
;
233
node = node.
Right
;
268
if (current.
Right
!= null && (!_uBoundActive || Comparer.Compare(_max, current.Item) > 0))
270
processQueue.Enqueue(current.
Right
);