544parent.LeftSize += delta; 552sub.LeftSize = node.LeftSize; 616node.LeftSize -= leftmost.Size; 628node.LeftSize += this.LeftSize + this.Size; 642this.LeftSize -= node.LeftSize + node.Size; 825node.LeftSize = Int32.Parse(s.Substring(0, index), TypeConverterHelper.InvariantEnglishUS);

563LeftSize = 0; 662LeftSize = Int32.Parse(s.Substring(0, index), TypeConverterHelper.InvariantEnglishUS);

92if (index + delta <= LeftSize) 101else if (index < LeftSize + Size) 103result = new RBFinger<T>() { Node = this, Offset = index - LeftSize, Index = index, Found = true }; 108result = new RBFinger<T>() { Node = this, Offset = Size, Index = LeftSize + Size, Found = false }; 111result = RightChild.FindIndex(index - LeftSize - Size, exists); 112result.Index += LeftSize + Size; 131result = new RBFinger<T>() { Node = this, Offset = 0, Index = LeftSize, Found = true }; 138result = new RBFinger<T>() { Node = this, Offset = offset, Index = LeftSize + offset, Found = found }; 143result = new RBFinger<T>() { Node = this, Offset = Size, Index = LeftSize + Size }; 147result.Index += LeftSize + Size; 163if (high <= LeftSize) 169if (low >= LeftSize) 172left = low - LeftSize; 185result = new RBFinger<T>() { Node = this, Offset = 0, Index = LeftSize, Found = true }; 191if (LeftSize + Size <= low) 197if (LeftSize + Size >= high) 200right = high - LeftSize; 211result = new RBFinger<T>() { Node = this, Offset = right, Index = LeftSize + right, Found = false }; 214int delta = LeftSize + Size; 224result = new RBFinger<T>() { Node = this, Offset = offset, Index = LeftSize + offset, Found = found }; 281nodeIndex = nodeIndex - startingNode.LeftSize - parent.Size; 403index = node.LeftSize; 407index += parent.LeftSize + parent.Size; 516if (index <= node.LeftSize) 522Debug.Assert(index >= node.LeftSize + node.Size, "InsertNode: index should fall between nodes"); 523node.RightChild = InsertNode(root, node, node.RightChild, index - node.LeftSize - node.Size, out newNode); 552sub.LeftSize = node.LeftSize; 566if (index < node.LeftSize || (index == node.LeftSize && node.Size > 0)) 574bool deleteHere = (index == node.LeftSize); 598node.RightChild = DeleteNode(node, node.RightChild, index - node.LeftSize - node.Size); 628node.LeftSize += this.LeftSize + this.Size; 642this.LeftSize -= node.LeftSize + node.Size; 738if (size != node.LeftSize) 784sb.Append(node.LeftSize);

504int size = LeftSize; 533int size = LeftSize; 551node = InsertNode(this.LeftSize); 588get { return LeftSize; } 646bool b = Verify(LeftChild, checkSort ? Comparison : null, 0, ref index, ref maxItem, out size) && size == LeftSize && size == expectedSize; 653sb.Append(LeftSize);