17 writes to Left
System (17)
compmod\system\collections\generic\sortedset.cs (17)
139
myCurrent.
Left
= (theirCurrent.Left != null ? new SortedSet<T>.Node(theirCurrent.Left.Item, theirCurrent.Left.IsRed) : null);
156
myRight.
Left
= (theirRight.Left != null ? new SortedSet<T>.Node(theirRight.Left.Item, theirRight.Left.IsRed) : null);
410
parent.
Left
= node;
743
parent.
Left
= newChild;
766
parentOfSuccesor.
Left
= succesor.Right;
770
succesor.
Left
= match.Left;
843
x.
Left
= node;
851
node.
Left
= grandChild.Right;
854
grandChild.
Left
= child;
860
node.
Left
= x.Right;
870
grandChild.
Left
= node;
871
child.
Left
= grandChild.Right;
1082
root.
Left
= redNode;
1089
root.
Left
= redNode;
1093
root.
Left
= new Node(arr[startIndex], false);
1096
root.Left.
Left
= redNode;
1102
root.
Left
= ConstructRootFromSortedArray(arr, startIndex, midpt - 1, redNode);
59 references to Left
System (59)
compmod\system\collections\generic\sortedset.cs (59)
139
myCurrent.Left = (theirCurrent.
Left
!= null ? new SortedSet<T>.Node(theirCurrent.
Left
.Item, theirCurrent.
Left
.IsRed) : null);
140
theirCurrent = theirCurrent.
Left
;
141
myCurrent = myCurrent.
Left
;
156
myRight.Left = (theirRight.
Left
!= null ? new SortedSet<T>.Node(theirRight.
Left
.Item, theirRight.
Left
.IsRed) : null);
157
theirRight = theirRight.
Left
;
158
myRight = myRight.
Left
;
239
current = (reverse ? current.Right : current.
Left
);
247
Node node = (reverse ? current.
Left
: current.Right);
250
node = (reverse ? node.Right : node.
Left
);
279
if (current.
Left
!= null) {
280
processQueue.Add(current.
Left
);
401
current = (order < 0) ? current.
Left
: current.Right;
486
sibling = (parent.
Left
== current) ? parent.Right : parent.
Left
;
499
Debug.Assert(parent.
Left
== sibling, "sibling must be left child of parent!");
500
Debug.Assert(sibling.
Left
.IsRed, "Left child of sibling must be red!");
501
sibling.
Left
.IsRed = false;
513
Debug.Assert(sibling.
Left
.IsRed, "Left child of sibling must be red!");
518
Debug.Assert(parent.
Left
== sibling, "sibling must be left child of parent!");
549
current = current.
Left
;
678
if (parent.
Left
== node) {
681
return parent.
Left
;
711
return IsBlack(node) && IsNullOrBlack(node.
Left
) && IsNullOrBlack(node.Right);
715
return IsRed(node.
Left
) && IsRed(node.Right);
742
if (parent.
Left
== child) {
756
succesor = match.
Left
;
759
Debug.Assert(succesor.
Left
== null, "Left child of succesor must be null!");
770
succesor.Left = match.
Left
;
788
current = (order < 0) ? current.
Left
: current.Right;
806
current = (order < 0) ? current.
Left
: current.Right;
825
current = current.
Left
;
842
node.Right = x.
Left
;
848
Node child = node.
Left
;
853
child.Right = grandChild.
Left
;
859
Node x = node.
Left
;
867
Node grandChild = child.
Left
;
869
node.Right = grandChild.
Left
;
881
Debug.Assert(IsRed(sibling.
Left
) || IsRed(sibling.Right), "sibling must have at least one red child");
882
if (IsRed(sibling.
Left
)) {
883
if (parent.
Left
== current) {
888
if (parent.
Left
== current) {
958
node.
Left
.IsRed = false;
1096
root.
Left
.Left = redNode;
1862
current = (reverse ? current.Right : current.
Left
);
1866
current = current.
Left
;
1876
Node node = (reverse ? current.
Left
: current.Right);
1880
node = (reverse ? node.Right : node.
Left
);
1884
node = node.
Left
;
1908
if (current.
Left
!= null && (!lBoundActive || Comparer.Compare(min, current.Item) < 0)) {
1909
processQueue.Add(current.
Left
);
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);