6 writes to LeftSize
PresentationFramework (6)
src\Framework\MS\Internal\Data\RBNode.cs (5)
547parent.LeftSize += delta; 555sub.LeftSize = node.LeftSize; 619node.LeftSize -= leftmost.Size; 631node.LeftSize += this.LeftSize + this.Size; 645this.LeftSize -= node.LeftSize + node.Size;
src\Framework\MS\Internal\Data\RBTree.cs (1)
569LeftSize = 0;
37 references to LeftSize
PresentationFramework (37)
src\Framework\MS\Internal\Data\RBNode.cs (33)
95if (index + delta <= LeftSize) 104else if (index < LeftSize + Size) 106result = new RBFinger<T>() { Node = this, Offset = index - LeftSize, Index = index, Found = true }; 111result = new RBFinger<T>() { Node = this, Offset = Size, Index = LeftSize + Size, Found = false }; 114result = RightChild.FindIndex(index - LeftSize - Size, exists); 115result.Index += LeftSize + Size; 134result = new RBFinger<T>() { Node = this, Offset = 0, Index = LeftSize, Found = true }; 141result = new RBFinger<T>() { Node = this, Offset = offset, Index = LeftSize + offset, Found = found }; 146result = new RBFinger<T>() { Node = this, Offset = Size, Index = LeftSize + Size }; 150result.Index += LeftSize + Size; 166if (high <= LeftSize) 172if (low >= LeftSize) 175left = low - LeftSize; 188result = new RBFinger<T>() { Node = this, Offset = 0, Index = LeftSize, Found = true }; 194if (LeftSize + Size <= low) 200if (LeftSize + Size >= high) 203right = high - LeftSize; 214result = new RBFinger<T>() { Node = this, Offset = right, Index = LeftSize + right, Found = false }; 217int delta = LeftSize + Size; 227result = new RBFinger<T>() { Node = this, Offset = offset, Index = LeftSize + offset, Found = found }; 284nodeIndex = nodeIndex - startingNode.LeftSize - parent.Size; 406index = node.LeftSize; 410index += parent.LeftSize + parent.Size; 519if (index <= node.LeftSize) 525Debug.Assert(index >= node.LeftSize + node.Size, "InsertNode: index should fall between nodes"); 526node.RightChild = InsertNode(root, node, node.RightChild, index - node.LeftSize - node.Size, out newNode); 555sub.LeftSize = node.LeftSize; 569if (index < node.LeftSize || (index == node.LeftSize && node.Size > 0)) 577bool deleteHere = (index == node.LeftSize); 601node.RightChild = DeleteNode(node, node.RightChild, index - node.LeftSize - node.Size); 631node.LeftSize += this.LeftSize + this.Size; 645this.LeftSize -= node.LeftSize + node.Size;
src\Framework\MS\Internal\Data\RBTree.cs (4)
510int size = LeftSize; 539int size = LeftSize; 557node = InsertNode(this.LeftSize); 596get { return LeftSize; }