4 writes to Right
System.Speech (4)
Internal\RBList.cs (4)
203
node.Parent.
Right
= newNode;
214
node.
Right
= newNode.Left;
225
newNode.
Right
= node;
299
node.
Right
= InsertNode(node.Right, newNode);
35 references to Right
System.Speech (35)
Internal\RBList.cs (35)
65
else if (_root.
Right
!= null)
67
_root = FindRoot(_root.
Right
);
101
return _root != null && _root.Left == null && _root.
Right
== null;
109
return _root != null && (_root.
Right
!= null || _root.Left != null);
144
return node.Parent.Parent.
Right
;
156
return parent.
Right
;
201
else if (node.Parent.
Right
== node)
213
TreeNode newNode = node.
Right
!;
223
node.Left = newNode.
Right
;
241
if (node.
Right
== null)
252
return FindMinSubTree(node.
Right
);
259
if (node.
Right
== null)
267
TakeParent(node, node.
Right
);
276
TakeParent(successor, successor.
Right
);
299
node.Right = InsertNode(node.
Right
, newNode);
325
return TryFindItem(node.
Right
, key, out item);
388
if (node == node.Parent.
Right
&& node.Parent == node.Parent.Parent!.Left)
393
else if (node == node.Parent.Left && node.Parent == node.Parent.Parent!.
Right
)
396
node = node.
Right
!;
416
Debug.Assert(node.Parent == node.Parent.Parent!.
Right
); // From case 3
424
Debug.Assert(node.Left == null || node.
Right
== null);
426
TreeNode? onlyChild = node.Left ?? node.
Right
;
429
Debug.Assert(node.Parent == null || node.Parent.Left == onlyChild || node.Parent.
Right
== onlyChild);
477
Debug.Assert(sibling.Left != null && sibling.
Right
!= null);
483
if (sibling == parent.
Right
)
487
sibling = parent.
Right
;
506
IsBlack(sibling.
Right
))
522
IsBlack(sibling.
Right
))
535
if (sibling == sibling.Parent!.
Right
&&
538
GetColor(sibling.
Right
) == NodeColor.BLACK)
547
GetColor(sibling.
Right
) == NodeColor.RED &&
551
SetColor(sibling.
Right
, NodeColor.BLACK);
564
if (sibling == sibling.Parent!.
Right
)
566
Debug.Assert(GetColor(sibling.
Right
) == NodeColor.RED);
567
SetColor(sibling.
Right
, NodeColor.BLACK);