LeftChild

9 writes to LeftChild

PresentationFramework (9)

src\Framework\MS\Internal\Data\RBNode.cs (6)

521node.LeftChild = InsertNode(root, node, node.LeftChild, index, out newNode); 553sub.LeftChild = node.LeftChild; 573node.LeftChild = DeleteNode(node, node.LeftChild, index); 618node.LeftChild = DeleteLeftmost(node.LeftChild, out leftmost); 636node.LeftChild = this; 648this.LeftChild = node.RightChild;

src\Framework\MS\Internal\Data\RBTree.cs (3)

431LeftChild = InsertNode(this, this, LeftChild, index, out node); 437LeftChild = DeleteNode(this, LeftChild, index); 568LeftChild = null;

55 references to LeftChild

PresentationFramework (55)

src\Framework\MS\Internal\Data\LiveShapingBlock.cs (1)

27LiveShapingBlock LeftChildBlock { get { return (LiveShapingBlock)LeftChild; } }

src\Framework\MS\Internal\Data\RBNode.cs (43)

68for (parent = RightChild, node = parent.LeftChild; node != null; parent = node, node = parent.LeftChild) 77if (LeftChild == null) 79for (node = this, parent = node.Parent; parent != null && parent.LeftChild == node; node = parent, parent = node.Parent) 85for (parent = LeftChild, node = parent.RightChild; node != null; parent = node, node = parent.RightChild) 97if (LeftChild == null) 101result = LeftChild.FindIndex(index, exists); 128if (LeftChild == null) 132result = LeftChild.Find(x, comparison); 162RBNode<T> leftChild = LeftChild, rightChild = RightChild; 278while (parent != null && node == parent.LeftChild) 298if (startingNode.LeftChild != null) 300RBFinger<T> newFinger = startingNode.LeftChild.Find(x, comparison); 521node.LeftChild = InsertNode(root, node, node.LeftChild, index, out newNode); 546if (parent.LeftChild == node) 553sub.LeftChild = node.LeftChild; 559if (sub.LeftChild != null) sub.LeftChild.Parent = sub; 571if (!IsNodeRed(node.LeftChild) && !IsNodeRed(node.LeftChild.LeftChild)) 573node.LeftChild = DeleteNode(node, node.LeftChild, index); 580if (IsNodeRed(node.LeftChild)) 587if (!IsNodeRed(node.RightChild) && !IsNodeRed(node.RightChild.LeftChild)) 609if (node.LeftChild == null) 615if (!IsNodeRed(node.LeftChild) && !IsNodeRed(node.LeftChild.LeftChild)) 618node.LeftChild = DeleteLeftmost(node.LeftChild, out leftmost); 634this.RightChild = node.LeftChild; 644RBNode<T> node = this.LeftChild; 649if (this.LeftChild != null) this.LeftChild.Parent = this; 659LeftChild.IsRed = !LeftChild.IsRed; 665if (!IsNodeRed(node.LeftChild) && IsNodeRed(node.RightChild)) 667if (IsNodeRed(node.LeftChild) && IsNodeRed(node.LeftChild.LeftChild)) 669if (IsNodeRed(node.LeftChild) && IsNodeRed(node.RightChild)) 677if (IsNodeRed(node.LeftChild.LeftChild)) 688if (IsNodeRed(node.RightChild.LeftChild))

src\Framework\MS\Internal\Data\RBTree.cs (11)

118LeftChild.IsRed = false; 431LeftChild = InsertNode(this, this, LeftChild, index, out node); 437LeftChild = DeleteNode(this, LeftChild, index); 438if (LeftChild != null) 439LeftChild.IsRed = false; 514if (LeftChild != null) 515LeftChild.IsRed = false; 541RBNode<T> node = LeftChild; 562LeftChild.IsRed = false; 609if (LeftChild != null) 610LeftChild.IsRed = false;