8 writes to RightChild
PresentationFramework (8)
MS\Internal\Data\RBNode.cs (8)
523node.RightChild = InsertNode(root, node, node.RightChild, index - node.LeftSize - node.Size, out newNode); 551sub.RightChild = node.RightChild; 594node.RightChild = DeleteLeftmost(node.RightChild, out sub); 598node.RightChild = DeleteNode(node, node.RightChild, index - node.LeftSize - node.Size); 631this.RightChild = node.LeftChild; 647node.RightChild = this; 687node.RightChild = node.RightChild.RotateRight(); 843node.RightChild = LoadTree(ref s);
40 references to RightChild
PresentationFramework (40)
MS\Internal\Data\LiveShapingBlock.cs (1)
25LiveShapingBlock RightChildBlock { get { return (LiveShapingBlock)RightChild; } }
MS\Internal\Data\RBNode.cs (37)
57if (RightChild == null) 59for (node = this, parent = node.Parent; parent.RightChild == node; node = parent, parent = node.Parent) 65for (parent = RightChild, node = parent.LeftChild; node != null; parent = node, node = parent.LeftChild) 82for (parent = LeftChild, node = parent.RightChild; node != null; parent = node, node = parent.RightChild) 107if (RightChild == null) 111result = RightChild.FindIndex(index - LeftSize - Size, exists); 142if (RightChild == null) 146result = RightChild.Find(x, comparison); 159RBNode<T> leftChild = LeftChild, rightChild = RightChild; 406if (node == parent.RightChild) 523node.RightChild = InsertNode(root, node, node.RightChild, index - node.LeftSize - node.Size, out newNode); 551sub.RightChild = node.RightChild; 557if (sub.RightChild != null) sub.RightChild.Parent = sub; 582if (deleteHere && node.RightChild == null) 584if (!IsNodeRed(node.RightChild) && !IsNodeRed(node.RightChild.LeftChild)) 594node.RightChild = DeleteLeftmost(node.RightChild, out sub); 598node.RightChild = DeleteNode(node, node.RightChild, index - node.LeftSize - node.Size); 627RBNode<T> node = this.RightChild; 632if (this.RightChild != null) this.RightChild.Parent = this; 645this.LeftChild = node.RightChild; 657RightChild.IsRed = !RightChild.IsRed; 662if (!IsNodeRed(node.LeftChild) && IsNodeRed(node.RightChild)) 666if (IsNodeRed(node.LeftChild) && IsNodeRed(node.RightChild)) 685if (IsNodeRed(node.RightChild.LeftChild)) 687node.RightChild = node.RightChild.RotateRight(); 732if (!IsNodeRed(node.LeftChild) && IsNodeRed(node.RightChild)) 735if (node.IsRed && (IsNodeRed(node.LeftChild) || IsNodeRed(node.RightChild))) 741if (node.Parent.LeftChild != node && node != node.Parent.RightChild) 767result = Verify(node.RightChild, comparison, blackDepth, ref index, ref maxItem, out rightSize) && result; 793SaveTree(node.RightChild, sb); 845if (node.RightChild != null) node.RightChild.Parent = node;
MS\Internal\Data\RBTree.cs (2)
546while (node.RightChild != null) 547node = node.RightChild;