8 writes to RightChild
PresentationFramework (8)
MS\Internal\Data\RBNode.cs (8)
519node.RightChild = InsertNode(root, node, node.RightChild, index - node.LeftSize - node.Size, out newNode); 547sub.RightChild = node.RightChild; 590node.RightChild = DeleteLeftmost(node.RightChild, out sub); 594node.RightChild = DeleteNode(node, node.RightChild, index - node.LeftSize - node.Size); 627this.RightChild = node.LeftChild; 643node.RightChild = this; 683node.RightChild = node.RightChild.RotateRight(); 839node.RightChild = LoadTree(ref s);
40 references to RightChild
PresentationFramework (40)
MS\Internal\Data\LiveShapingBlock.cs (1)
17LiveShapingBlock RightChildBlock { get { return (LiveShapingBlock)RightChild; } }
MS\Internal\Data\RBNode.cs (37)
53if (RightChild == null) 55for (node = this, parent = node.Parent; parent.RightChild == node; node = parent, parent = node.Parent) 61for (parent = RightChild, node = parent.LeftChild; node != null; parent = node, node = parent.LeftChild) 78for (parent = LeftChild, node = parent.RightChild; node != null; parent = node, node = parent.RightChild) 103if (RightChild == null) 107result = RightChild.FindIndex(index - LeftSize - Size, exists); 138if (RightChild == null) 142result = RightChild.Find(x, comparison); 155RBNode<T> leftChild = LeftChild, rightChild = RightChild; 402if (node == parent.RightChild) 519node.RightChild = InsertNode(root, node, node.RightChild, index - node.LeftSize - node.Size, out newNode); 547sub.RightChild = node.RightChild; 553if (sub.RightChild != null) sub.RightChild.Parent = sub; 578if (deleteHere && node.RightChild == null) 580if (!IsNodeRed(node.RightChild) && !IsNodeRed(node.RightChild.LeftChild)) 590node.RightChild = DeleteLeftmost(node.RightChild, out sub); 594node.RightChild = DeleteNode(node, node.RightChild, index - node.LeftSize - node.Size); 623RBNode<T> node = this.RightChild; 628if (this.RightChild != null) this.RightChild.Parent = this; 641this.LeftChild = node.RightChild; 653RightChild.IsRed = !RightChild.IsRed; 658if (!IsNodeRed(node.LeftChild) && IsNodeRed(node.RightChild)) 662if (IsNodeRed(node.LeftChild) && IsNodeRed(node.RightChild)) 681if (IsNodeRed(node.RightChild.LeftChild)) 683node.RightChild = node.RightChild.RotateRight(); 728if (!IsNodeRed(node.LeftChild) && IsNodeRed(node.RightChild)) 731if (node.IsRed && (IsNodeRed(node.LeftChild) || IsNodeRed(node.RightChild))) 737if (node.Parent.LeftChild != node && node != node.Parent.RightChild) 763result = Verify(node.RightChild, comparison, blackDepth, ref index, ref maxItem, out rightSize) && result; 789SaveTree(node.RightChild, sb); 841if (node.RightChild != null) node.RightChild.Parent = node;
MS\Internal\Data\RBTree.cs (2)
539while (node.RightChild != null) 540node = node.RightChild;