11 writes to LeftChild
PresentationFramework (11)
MS\Internal\Data\RBNode.cs (7)
514node.LeftChild = InsertNode(root, node, node.LeftChild, index, out newNode); 546sub.LeftChild = node.LeftChild; 566node.LeftChild = DeleteNode(node, node.LeftChild, index); 611node.LeftChild = DeleteLeftmost(node.LeftChild, out leftmost); 629node.LeftChild = this; 641this.LeftChild = node.RightChild; 838node.LeftChild = LoadTree(ref s); // read subtrees
MS\Internal\Data\RBTree.cs (4)
421LeftChild = InsertNode(this, this, LeftChild, index, out node); 427LeftChild = DeleteNode(this, LeftChild, index); 558LeftChild = null; 660this.LeftChild = LoadTree(ref s);
65 references to LeftChild
PresentationFramework (65)
MS\Internal\Data\LiveShapingBlock.cs (1)
16LiveShapingBlock LeftChildBlock { get { return (LiveShapingBlock)LeftChild; } }
MS\Internal\Data\RBNode.cs (50)
61for (parent = RightChild, node = parent.LeftChild; node != null; parent = node, node = parent.LeftChild) 70if (LeftChild == null) 72for (node = this, parent = node.Parent; parent != null && parent.LeftChild == node; node = parent, parent = node.Parent) 78for (parent = LeftChild, node = parent.RightChild; node != null; parent = node, node = parent.RightChild) 90if (LeftChild == null) 94result = LeftChild.FindIndex(index, exists); 121if (LeftChild == null) 125result = LeftChild.Find(x, comparison); 155RBNode<T> leftChild = LeftChild, rightChild = RightChild; 271while (parent != null && node == parent.LeftChild) 291if (startingNode.LeftChild != null) 293RBFinger<T> newFinger = startingNode.LeftChild.Find(x, comparison); 514node.LeftChild = InsertNode(root, node, node.LeftChild, index, out newNode); 539if (parent.LeftChild == node) 546sub.LeftChild = node.LeftChild; 552if (sub.LeftChild != null) sub.LeftChild.Parent = sub; 564if (!IsNodeRed(node.LeftChild) && !IsNodeRed(node.LeftChild.LeftChild)) 566node.LeftChild = DeleteNode(node, node.LeftChild, index); 573if (IsNodeRed(node.LeftChild)) 580if (!IsNodeRed(node.RightChild) && !IsNodeRed(node.RightChild.LeftChild)) 602if (node.LeftChild == null) 608if (!IsNodeRed(node.LeftChild) && !IsNodeRed(node.LeftChild.LeftChild)) 611node.LeftChild = DeleteLeftmost(node.LeftChild, out leftmost); 627this.RightChild = node.LeftChild; 637RBNode<T> node = this.LeftChild; 642if (this.LeftChild != null) this.LeftChild.Parent = this; 652LeftChild.IsRed = !LeftChild.IsRed; 658if (!IsNodeRed(node.LeftChild) && IsNodeRed(node.RightChild)) 660if (IsNodeRed(node.LeftChild) && IsNodeRed(node.LeftChild.LeftChild)) 662if (IsNodeRed(node.LeftChild) && IsNodeRed(node.RightChild)) 670if (IsNodeRed(node.LeftChild.LeftChild)) 681if (IsNodeRed(node.RightChild.LeftChild)) 720result = Verify(node.LeftChild, comparison, blackDepth, ref index, ref maxItem, out size); 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) 788SaveTree(node.LeftChild, sb); 840if (node.LeftChild != null) node.LeftChild.Parent = node;
MS\Internal\Data\RBTree.cs (14)
111LeftChild.IsRed = false; 421LeftChild = InsertNode(this, this, LeftChild, index, out node); 427LeftChild = DeleteNode(this, LeftChild, index); 428if (LeftChild != null) 429LeftChild.IsRed = false; 504if (LeftChild != null) 505LeftChild.IsRed = false; 531RBNode<T> node = LeftChild; 552LeftChild.IsRed = false; 597if (LeftChild != null) 598LeftChild.IsRed = false; 642bool b = Verify(LeftChild, checkSort ? Comparison : null, 0, ref index, ref maxItem, out size) && size == LeftSize && size == expectedSize; 650SaveTree(LeftChild, sb); 661this.LeftChild.Parent = this;