11 writes to LeftChild
PresentationFramework (11)
MS\Internal\Data\RBNode.cs (7)
518node.LeftChild = InsertNode(root, node, node.LeftChild, index, out newNode); 550sub.LeftChild = node.LeftChild; 570node.LeftChild = DeleteNode(node, node.LeftChild, index); 615node.LeftChild = DeleteLeftmost(node.LeftChild, out leftmost); 633node.LeftChild = this; 645this.LeftChild = node.RightChild; 842node.LeftChild = LoadTree(ref s); // read subtrees
MS\Internal\Data\RBTree.cs (4)
425LeftChild = InsertNode(this, this, LeftChild, index, out node); 431LeftChild = DeleteNode(this, LeftChild, index); 562LeftChild = null; 664this.LeftChild = LoadTree(ref s);
65 references to LeftChild
PresentationFramework (65)
MS\Internal\Data\LiveShapingBlock.cs (1)
24LiveShapingBlock LeftChildBlock { get { return (LiveShapingBlock)LeftChild; } }
MS\Internal\Data\RBNode.cs (50)
65for (parent = RightChild, node = parent.LeftChild; node != null; parent = node, node = parent.LeftChild) 74if (LeftChild == null) 76for (node = this, parent = node.Parent; parent != null && parent.LeftChild == node; node = parent, parent = node.Parent) 82for (parent = LeftChild, node = parent.RightChild; node != null; parent = node, node = parent.RightChild) 94if (LeftChild == null) 98result = LeftChild.FindIndex(index, exists); 125if (LeftChild == null) 129result = LeftChild.Find(x, comparison); 159RBNode<T> leftChild = LeftChild, rightChild = RightChild; 275while (parent != null && node == parent.LeftChild) 295if (startingNode.LeftChild != null) 297RBFinger<T> newFinger = startingNode.LeftChild.Find(x, comparison); 518node.LeftChild = InsertNode(root, node, node.LeftChild, index, out newNode); 543if (parent.LeftChild == node) 550sub.LeftChild = node.LeftChild; 556if (sub.LeftChild != null) sub.LeftChild.Parent = sub; 568if (!IsNodeRed(node.LeftChild) && !IsNodeRed(node.LeftChild.LeftChild)) 570node.LeftChild = DeleteNode(node, node.LeftChild, index); 577if (IsNodeRed(node.LeftChild)) 584if (!IsNodeRed(node.RightChild) && !IsNodeRed(node.RightChild.LeftChild)) 606if (node.LeftChild == null) 612if (!IsNodeRed(node.LeftChild) && !IsNodeRed(node.LeftChild.LeftChild)) 615node.LeftChild = DeleteLeftmost(node.LeftChild, out leftmost); 631this.RightChild = node.LeftChild; 641RBNode<T> node = this.LeftChild; 646if (this.LeftChild != null) this.LeftChild.Parent = this; 656LeftChild.IsRed = !LeftChild.IsRed; 662if (!IsNodeRed(node.LeftChild) && IsNodeRed(node.RightChild)) 664if (IsNodeRed(node.LeftChild) && IsNodeRed(node.LeftChild.LeftChild)) 666if (IsNodeRed(node.LeftChild) && IsNodeRed(node.RightChild)) 674if (IsNodeRed(node.LeftChild.LeftChild)) 685if (IsNodeRed(node.RightChild.LeftChild)) 724result = Verify(node.LeftChild, comparison, blackDepth, ref index, ref maxItem, out size); 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) 792SaveTree(node.LeftChild, sb); 844if (node.LeftChild != null) node.LeftChild.Parent = node;
MS\Internal\Data\RBTree.cs (14)
115LeftChild.IsRed = false; 425LeftChild = InsertNode(this, this, LeftChild, index, out node); 431LeftChild = DeleteNode(this, LeftChild, index); 432if (LeftChild != null) 433LeftChild.IsRed = false; 508if (LeftChild != null) 509LeftChild.IsRed = false; 535RBNode<T> node = LeftChild; 556LeftChild.IsRed = false; 601if (LeftChild != null) 602LeftChild.IsRed = false; 646bool b = Verify(LeftChild, checkSort ? Comparison : null, 0, ref index, ref maxItem, out size) && size == LeftSize && size == expectedSize; 654SaveTree(LeftChild, sb); 665this.LeftChild.Parent = this;