540parent.LeftSize += delta; 548sub.LeftSize = node.LeftSize; 612node.LeftSize -= leftmost.Size; 624node.LeftSize += this.LeftSize + this.Size; 638this.LeftSize -= node.LeftSize + node.Size; 821node.LeftSize = Int32.Parse(s.AsSpan(0, index), TypeConverterHelper.InvariantEnglishUS);

559LeftSize = 0; 658LeftSize = Int32.Parse(s.AsSpan(0, index), TypeConverterHelper.InvariantEnglishUS);

88if (index + delta <= LeftSize) 97else if (index < LeftSize + Size) 99result = new RBFinger<T>() { Node = this, Offset = index - LeftSize, Index = index, Found = true }; 104result = new RBFinger<T>() { Node = this, Offset = Size, Index = LeftSize + Size, Found = false }; 107result = RightChild.FindIndex(index - LeftSize - Size, exists); 108result.Index += LeftSize + Size; 127result = new RBFinger<T>() { Node = this, Offset = 0, Index = LeftSize, Found = true }; 134result = new RBFinger<T>() { Node = this, Offset = offset, Index = LeftSize + offset, Found = found }; 139result = new RBFinger<T>() { Node = this, Offset = Size, Index = LeftSize + Size }; 143result.Index += LeftSize + Size; 159if (high <= LeftSize) 165if (low >= LeftSize) 168left = low - LeftSize; 181result = new RBFinger<T>() { Node = this, Offset = 0, Index = LeftSize, Found = true }; 187if (LeftSize + Size <= low) 193if (LeftSize + Size >= high) 196right = high - LeftSize; 207result = new RBFinger<T>() { Node = this, Offset = right, Index = LeftSize + right, Found = false }; 210int delta = LeftSize + Size; 220result = new RBFinger<T>() { Node = this, Offset = offset, Index = LeftSize + offset, Found = found }; 277nodeIndex = nodeIndex - startingNode.LeftSize - parent.Size; 399index = node.LeftSize; 403index += parent.LeftSize + parent.Size; 512if (index <= node.LeftSize) 518Debug.Assert(index >= node.LeftSize + node.Size, "InsertNode: index should fall between nodes"); 519node.RightChild = InsertNode(root, node, node.RightChild, index - node.LeftSize - node.Size, out newNode); 548sub.LeftSize = node.LeftSize; 562if (index < node.LeftSize || (index == node.LeftSize && node.Size > 0)) 570bool deleteHere = (index == node.LeftSize); 594node.RightChild = DeleteNode(node, node.RightChild, index - node.LeftSize - node.Size); 624node.LeftSize += this.LeftSize + this.Size; 638this.LeftSize -= node.LeftSize + node.Size; 734if (size != node.LeftSize) 780sb.Append(node.LeftSize);

500int size = LeftSize; 529int size = LeftSize; 547node = InsertNode(this.LeftSize); 584get { return LeftSize; } 642bool b = Verify(LeftChild, checkSort ? Comparison : null, 0, ref index, ref maxItem, out size) && size == LeftSize && size == expectedSize; 649sb.Append(LeftSize);