539parent.LeftSize += delta; 547sub.LeftSize = node.LeftSize; 611node.LeftSize -= leftmost.Size; 623node.LeftSize += this.LeftSize + this.Size; 637this.LeftSize -= node.LeftSize + node.Size; 820node.LeftSize = Int32.Parse(s.AsSpan(0, index), TypeConverterHelper.InvariantEnglishUS);

558LeftSize = 0; 657LeftSize = Int32.Parse(s.AsSpan(0, index), TypeConverterHelper.InvariantEnglishUS);

87if (index + delta <= LeftSize) 96else if (index < LeftSize + Size) 98result = new RBFinger<T>() { Node = this, Offset = index - LeftSize, Index = index, Found = true }; 103result = new RBFinger<T>() { Node = this, Offset = Size, Index = LeftSize + Size, Found = false }; 106result = RightChild.FindIndex(index - LeftSize - Size, exists); 107result.Index += LeftSize + Size; 126result = new RBFinger<T>() { Node = this, Offset = 0, Index = LeftSize, Found = true }; 133result = new RBFinger<T>() { Node = this, Offset = offset, Index = LeftSize + offset, Found = found }; 138result = new RBFinger<T>() { Node = this, Offset = Size, Index = LeftSize + Size }; 142result.Index += LeftSize + Size; 158if (high <= LeftSize) 164if (low >= LeftSize) 167left = low - LeftSize; 180result = new RBFinger<T>() { Node = this, Offset = 0, Index = LeftSize, Found = true }; 186if (LeftSize + Size <= low) 192if (LeftSize + Size >= high) 195right = high - LeftSize; 206result = new RBFinger<T>() { Node = this, Offset = right, Index = LeftSize + right, Found = false }; 209int delta = LeftSize + Size; 219result = new RBFinger<T>() { Node = this, Offset = offset, Index = LeftSize + offset, Found = found }; 276nodeIndex = nodeIndex - startingNode.LeftSize - parent.Size; 398index = node.LeftSize; 402index += parent.LeftSize + parent.Size; 511if (index <= node.LeftSize) 517Debug.Assert(index >= node.LeftSize + node.Size, "InsertNode: index should fall between nodes"); 518node.RightChild = InsertNode(root, node, node.RightChild, index - node.LeftSize - node.Size, out newNode); 547sub.LeftSize = node.LeftSize; 561if (index < node.LeftSize || (index == node.LeftSize && node.Size > 0)) 569bool deleteHere = (index == node.LeftSize); 593node.RightChild = DeleteNode(node, node.RightChild, index - node.LeftSize - node.Size); 623node.LeftSize += this.LeftSize + this.Size; 637this.LeftSize -= node.LeftSize + node.Size; 733if (size != node.LeftSize) 779sb.Append(node.LeftSize);

499int size = LeftSize; 528int size = LeftSize; 546node = InsertNode(this.LeftSize); 583get { return LeftSize; } 641bool b = Verify(LeftChild, checkSort ? Comparison : null, 0, ref index, ref maxItem, out size) && size == LeftSize && size == expectedSize; 648sb.Append(LeftSize);