535Size += delta; 825node.Size = Int32.Parse(s.AsSpan(0, index), TypeConverterHelper.InvariantEnglishUS);

58Size = MaxSize;

67int size = Size; 431size = Size;

44if (finger.Offset == finger.Node.Size) 60finger.Offset = finger.Node.Size - 1;

97else if (index < LeftSize + Size) 104result = new RBFinger<T>() { Node = this, Offset = Size, Index = LeftSize + Size, Found = false }; 107result = RightChild.FindIndex(index - LeftSize - Size, exists); 108result.Index += LeftSize + Size; 130else if ((compR = comparison(x, GetItemAt(Size - 1))) <= 0) 133int offset = BinarySearch(x, 1, Size - 1, comparison, compR, out found); 139result = new RBFinger<T>() { Node = this, Offset = Size, Index = LeftSize + Size }; 143result.Index += LeftSize + Size; 156int left = 0, right = Size; 170compL = (left < Size) ? comparison(x, GetItemAt(left)) : +1; 187if (LeftSize + Size <= low) 193if (LeftSize + Size >= high) 210int delta = LeftSize + Size; 274if (parent == null || comparison(x, parent.GetItemAt(parent.Size - 1)) >= 0) 277nodeIndex = nodeIndex - startingNode.LeftSize - parent.Size; 281int offset = parent.BinarySearch(x, 1, parent.Size - 1, comparison, -1, out found); 294if (newFinger.Offset == newFinger.Node.Size) 325if (newNode.Size < MaxSize) 343if (successor.Size < MaxSize) 364Copy(node, offset + 1, node, offset, node.Size - offset - 1); 366node.SetItemAt(node.Size, default(T)); 368if (node.Size == 0) 386return root.InsertNode(index + node.Size); 403index += parent.LeftSize + parent.Size; 410if (Size < MaxSize) 413Copy(this, offset, this, offset + 1, Size - offset); 419Debug.Assert(successor != null && successor.Size < MaxSize, "InsertAt: successor should have room"); 420if (successor.Size == 0) 440Debug.Assert(succsucc.Size == MaxSize, "InsertAt: outer nodes should be full"); 444Copy(successor, 0, successor, s, successor.Size); 448Copy(succsucc, 0, successor, s + successor.Size, s); 463Copy(successor, offset - (MaxSize - s), successor, offset - (MaxSize - s) + 1, successor.Size + s + s - (offset - (MaxSize - s))); 474int s = (Size + successor.Size + 1) / 2; 479Copy(successor, 0, successor, MaxSize - s + 1, successor.Size); 489Copy(successor, 0, successor, MaxSize - s, successor.Size); 493Copy(successor, offset - s, successor, offset - s + 1, successor.Size + MaxSize - offset); 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); 532for (int k = Size + delta; k < Size; ++k) 562if (index < node.LeftSize || (index == node.LeftSize && node.Size > 0)) 571Debug.Assert(!deleteHere || node.Size == 0, "DeleteNode: Deleted node should be empty"); 594node.RightChild = DeleteNode(node, node.RightChild, index - node.LeftSize - node.Size); 612node.LeftSize -= leftmost.Size; 624node.LeftSize += this.LeftSize + this.Size; 638this.LeftSize -= node.LeftSize + node.Size; 722if (node.Size <= 0) 725if (node.Size > MaxSize) 745for (int k = 1; k < node.Size; ++k) 752for (int j=node.Size; j<MaxSize; ++j) 758size += node.Size; 760maxItem = node.GetItemAt(node.Size - 1); 782sb.Append(node.Size); 783for (int k = 0; k < node.Size; ++k) 828for (int k = 0; k < node.Size-1; ++k) // read data 835node.SetItemAt(node.Size - 1, AsT(Int32.Parse(s.AsSpan(0, index), TypeConverterHelper.InvariantEnglishUS)));

94else if (node.Size < MaxSize) 102if (successor.Size >= MaxSize) 106successor = InsertNode(finger.Index + node.Size - finger.Offset); 541if (node.Size < MaxSize) 543node.InsertAt(node.Size, item);