16 writes to Left
System.Collections (16)
System\Collections\Generic\SortedSet.cs (16)
364
parent.
Left
= node;
678
parentOfSuccessor.
Left
= successor.Right;
682
successor.
Left
= match.Left;
951
root.
Left
= redNode;
960
root.
Left
= redNode;
965
root.
Left
= new Node(arr[startIndex], NodeColor.Black);
969
root.Left.
Left
= redNode;
975
root.
Left
= ConstructRootFromSortedArray(arr, startIndex, midpt - 1, redNode);
1645
next.target.
Left
= clonedNode;
1736
child.
Left
= this;
1748
Left
= grandChild.Right;
1751
grandChild.
Left
= child;
1761
Left
= child.Right;
1775
grandChild.
Left
= this;
1776
child.
Left
= grandChild.Right;
1809
Left
= newChild;
56 references to Left
System.Collections (56)
System\Collections\Generic\SortedSet.cs (48)
200
current = current.
Left
;
215
node = node.
Left
;
249
if (current.
Left
!= null)
251
processQueue.Enqueue(current.
Left
);
352
current = (order < 0) ? current.
Left
: current.Right;
486
current = order < 0 ? current.
Left
: current.Right;
665
successor = match.
Left
!;
670
Debug.Assert(successor.
Left
== null);
682
successor.Left = match.
Left
;
704
current = order < 0 ? current.
Left
: current.Right;
736
current = order < 0 ? current.
Left
: current.Right;
758
current = current.
Left
;
969
root.
Left
.Left = redNode;
1472
while (current.
Left
!= null)
1474
current = current.
Left
;
1620
public bool Is2Node => IsBlack && IsNullOrBlack(
Left
) && IsNullOrBlack(Right);
1622
public bool Is4Node => IsNonNullRed(
Left
) && IsNonNullRed(Right);
1642
if (next.source.
Left
is Node left)
1665
Debug.Assert(IsNonNullRed(sibling.
Left
) || IsNonNullRed(sibling.Right));
1670
bool currentIsLeftChild =
Left
== current;
1671
return IsNonNullRed(sibling.
Left
) ?
1682
Debug.Assert(node ==
Left
^ node == Right);
1684
return node ==
Left
? Right! :
Left
!;
1691
Debug.Assert(
Left
!= null);
1695
Left
.ColorBlack();
1708
removeRed =
Left
!.
Left
!;
1718
Debug.Assert(Right!.
Left
!.IsRed);
1721
Debug.Assert(
Left
!.Right!.IsRed);
1735
Right = child.
Left
;
1745
Node child =
Left
!;
1750
child.Right = grandChild.
Left
;
1760
Node child =
Left
!;
1772
Node grandChild = child.
Left
!;
1774
Right = grandChild.
Left
;
1787
Debug.Assert(
Left
!.Is2Node);
1792
Left
.ColorRed();
1807
if (
Left
== child)
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 (8)
147
current = current.
Left
;
168
current = current.
Left
;
203
current = current.
Left
;
211
current = current.
Left
;
229
node = node.
Left
;
237
node = node.
Left
;
264
if (current.
Left
!= null && (!_lBoundActive || Comparer.Compare(_min, current.Item) < 0))
266
processQueue.Enqueue(current.
Left
);