11 writes to LeftChild
PresentationFramework (11)
MS\Internal\Data\RBNode.cs (7)
513node.LeftChild = InsertNode(root, node, node.LeftChild, index, out newNode); 545sub.LeftChild = node.LeftChild; 565node.LeftChild = DeleteNode(node, node.LeftChild, index); 610node.LeftChild = DeleteLeftmost(node.LeftChild, out leftmost); 628node.LeftChild = this; 640this.LeftChild = node.RightChild; 837node.LeftChild = LoadTree(ref s); // read subtrees
MS\Internal\Data\RBTree.cs (4)
420LeftChild = InsertNode(this, this, LeftChild, index, out node); 426LeftChild = DeleteNode(this, LeftChild, index); 555LeftChild = null; 656this.LeftChild = LoadTree(ref s);
59 references to LeftChild
PresentationFramework (59)
MS\Internal\Data\LiveShapingBlock.cs (1)
17private LiveShapingBlock LeftChildBlock { get { return (LiveShapingBlock)LeftChild; } }
MS\Internal\Data\RBNode.cs (47)
60for (parent = RightChild, node = parent.LeftChild; node != null; parent = node, node = parent.LeftChild) 69if (LeftChild == null) 71for (node = this, parent = node.Parent; parent != null && parent.LeftChild == node; node = parent, parent = node.Parent) 77for (parent = LeftChild, node = parent.RightChild; node != null; parent = node, node = parent.RightChild) 89if (LeftChild == null) 93result = LeftChild.FindIndex(index, exists); 120if (LeftChild == null) 124result = LeftChild.Find(x, comparison); 154RBNode<T> leftChild = LeftChild, rightChild = RightChild; 270while (parent != null && node == parent.LeftChild) 290if (startingNode.LeftChild != null) 292RBFinger<T> newFinger = startingNode.LeftChild.Find(x, comparison); 513node.LeftChild = InsertNode(root, node, node.LeftChild, index, out newNode); 538if (parent.LeftChild == node) 545sub.LeftChild = node.LeftChild; 551sub.LeftChild?.Parent = sub; 563if (!IsNodeRed(node.LeftChild) && !IsNodeRed(node.LeftChild.LeftChild)) 565node.LeftChild = DeleteNode(node, node.LeftChild, index); 572if (IsNodeRed(node.LeftChild)) 579if (!IsNodeRed(node.RightChild) && !IsNodeRed(node.RightChild.LeftChild)) 601if (node.LeftChild == null) 607if (!IsNodeRed(node.LeftChild) && !IsNodeRed(node.LeftChild.LeftChild)) 610node.LeftChild = DeleteLeftmost(node.LeftChild, out leftmost); 626this.RightChild = node.LeftChild; 636RBNode<T> node = this.LeftChild; 641this.LeftChild?.Parent = this; 651LeftChild.IsRed = !LeftChild.IsRed; 657if (!IsNodeRed(node.LeftChild) && IsNodeRed(node.RightChild)) 659if (IsNodeRed(node.LeftChild) && IsNodeRed(node.LeftChild.LeftChild)) 661if (IsNodeRed(node.LeftChild) && IsNodeRed(node.RightChild)) 669if (IsNodeRed(node.LeftChild.LeftChild)) 680if (IsNodeRed(node.RightChild.LeftChild)) 719result = Verify(node.LeftChild, comparison, blackDepth, ref index, ref maxItem, out size); 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) 787SaveTree(node.LeftChild, sb); 839node.LeftChild?.Parent = node;
MS\Internal\Data\RBTree.cs (11)
110LeftChild.IsRed = false; 420LeftChild = InsertNode(this, this, LeftChild, index, out node); 426LeftChild = DeleteNode(this, LeftChild, index); 427LeftChild?.IsRed = false; 502LeftChild?.IsRed = false; 528RBNode<T> node = LeftChild; 549LeftChild.IsRed = false; 594LeftChild?.IsRed = false; 638bool b = Verify(LeftChild, checkSort ? Comparison : null, 0, ref index, ref maxItem, out size) && size == LeftSize && size == expectedSize; 646SaveTree(LeftChild, sb); 657this.LeftChild.Parent = this;