8 writes to RightChild
PresentationFramework (8)
MS\Internal\Data\RBNode.cs (8)
518node.RightChild = InsertNode(root, node, node.RightChild, index - node.LeftSize - node.Size, out newNode); 546sub.RightChild = node.RightChild; 589node.RightChild = DeleteLeftmost(node.RightChild, out sub); 593node.RightChild = DeleteNode(node, node.RightChild, index - node.LeftSize - node.Size); 626this.RightChild = node.LeftChild; 642node.RightChild = this; 682node.RightChild = node.RightChild.RotateRight(); 838node.RightChild = LoadTree(ref s);
40 references to RightChild
PresentationFramework (40)
MS\Internal\Data\LiveShapingBlock.cs (1)
19private LiveShapingBlock RightChildBlock { get { return (LiveShapingBlock)RightChild; } }
MS\Internal\Data\RBNode.cs (37)
52if (RightChild == null) 54for (node = this, parent = node.Parent; parent.RightChild == node; node = parent, parent = node.Parent) 60for (parent = RightChild, node = parent.LeftChild; node != null; parent = node, node = parent.LeftChild) 77for (parent = LeftChild, node = parent.RightChild; node != null; parent = node, node = parent.RightChild) 102if (RightChild == null) 106result = RightChild.FindIndex(index - LeftSize - Size, exists); 137if (RightChild == null) 141result = RightChild.Find(x, comparison); 154RBNode<T> leftChild = LeftChild, rightChild = RightChild; 401if (node == parent.RightChild) 518node.RightChild = InsertNode(root, node, node.RightChild, index - node.LeftSize - node.Size, out newNode); 546sub.RightChild = node.RightChild; 552if (sub.RightChild != null) sub.RightChild.Parent = sub; 577if (deleteHere && node.RightChild == null) 579if (!IsNodeRed(node.RightChild) && !IsNodeRed(node.RightChild.LeftChild)) 589node.RightChild = DeleteLeftmost(node.RightChild, out sub); 593node.RightChild = DeleteNode(node, node.RightChild, index - node.LeftSize - node.Size); 622RBNode<T> node = this.RightChild; 627if (this.RightChild != null) this.RightChild.Parent = this; 640this.LeftChild = node.RightChild; 652RightChild.IsRed = !RightChild.IsRed; 657if (!IsNodeRed(node.LeftChild) && IsNodeRed(node.RightChild)) 661if (IsNodeRed(node.LeftChild) && IsNodeRed(node.RightChild)) 680if (IsNodeRed(node.RightChild.LeftChild)) 682node.RightChild = node.RightChild.RotateRight(); 727if (!IsNodeRed(node.LeftChild) && IsNodeRed(node.RightChild)) 730if (node.IsRed && (IsNodeRed(node.LeftChild) || IsNodeRed(node.RightChild))) 736if (node.Parent.LeftChild != node && node != node.Parent.RightChild) 762result = Verify(node.RightChild, comparison, blackDepth, ref index, ref maxItem, out rightSize) && result; 788SaveTree(node.RightChild, sb); 840if (node.RightChild != null) node.RightChild.Parent = node;
MS\Internal\Data\RBTree.cs (2)
538while (node.RightChild != null) 539node = node.RightChild;