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

57Size = MaxSize;

69int size = Size; 433size = Size;

43if (finger.Offset == finger.Node.Size) 59finger.Offset = finger.Node.Size - 1;

96else if (index < LeftSize + Size) 103result = new RBFinger<T>() { Node = this, Offset = Size, Index = LeftSize + Size, Found = false }; 106result = RightChild.FindIndex(index - LeftSize - Size, exists); 107result.Index += LeftSize + Size; 129else if ((compR = comparison(x, GetItemAt(Size - 1))) <= 0) 132int offset = BinarySearch(x, 1, Size - 1, comparison, compR, out found); 138result = new RBFinger<T>() { Node = this, Offset = Size, Index = LeftSize + Size }; 142result.Index += LeftSize + Size; 155int left = 0, right = Size; 169compL = (left < Size) ? comparison(x, GetItemAt(left)) : +1; 186if (LeftSize + Size <= low) 192if (LeftSize + Size >= high) 209int delta = LeftSize + Size; 273if (parent == null || comparison(x, parent.GetItemAt(parent.Size - 1)) >= 0) 276nodeIndex = nodeIndex - startingNode.LeftSize - parent.Size; 280int offset = parent.BinarySearch(x, 1, parent.Size - 1, comparison, -1, out found); 293if (newFinger.Offset == newFinger.Node.Size) 324if (newNode.Size < MaxSize) 342if (successor.Size < MaxSize) 363Copy(node, offset + 1, node, offset, node.Size - offset - 1); 365node.SetItemAt(node.Size, default(T)); 367if (node.Size == 0) 385return root.InsertNode(index + node.Size); 402index += parent.LeftSize + parent.Size; 409if (Size < MaxSize) 412Copy(this, offset, this, offset + 1, Size - offset); 418Debug.Assert(successor != null && successor.Size < MaxSize, "InsertAt: successor should have room"); 419if (successor.Size == 0) 439Debug.Assert(succsucc.Size == MaxSize, "InsertAt: outer nodes should be full"); 443Copy(successor, 0, successor, s, successor.Size); 447Copy(succsucc, 0, successor, s + successor.Size, s); 462Copy(successor, offset - (MaxSize - s), successor, offset - (MaxSize - s) + 1, successor.Size + s + s - (offset - (MaxSize - s))); 473int s = (Size + successor.Size + 1) / 2; 478Copy(successor, 0, successor, MaxSize - s + 1, successor.Size); 488Copy(successor, 0, successor, MaxSize - s, successor.Size); 492Copy(successor, offset - s, successor, offset - s + 1, successor.Size + MaxSize - offset); 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); 531for (int k = Size + delta; k < Size; ++k) 561if (index < node.LeftSize || (index == node.LeftSize && node.Size > 0)) 570Debug.Assert(!deleteHere || node.Size == 0, "DeleteNode: Deleted node should be empty"); 593node.RightChild = DeleteNode(node, node.RightChild, index - node.LeftSize - node.Size); 611node.LeftSize -= leftmost.Size; 623node.LeftSize += this.LeftSize + this.Size; 637this.LeftSize -= node.LeftSize + node.Size; 721if (node.Size <= 0) 724if (node.Size > MaxSize) 744for (int k = 1; k < node.Size; ++k) 751for (int j=node.Size; j<MaxSize; ++j) 757size += node.Size; 759maxItem = node.GetItemAt(node.Size - 1); 781sb.Append(node.Size); 782for (int k = 0; k < node.Size; ++k) 827for (int k = 0; k < node.Size-1; ++k) // read data 834node.SetItemAt(node.Size - 1, AsT(Int32.Parse(s.AsSpan(0, index), TypeConverterHelper.InvariantEnglishUS)));

93else if (node.Size < MaxSize) 101if (successor.Size >= MaxSize) 105successor = InsertNode(finger.Index + node.Size - finger.Offset); 540if (node.Size < MaxSize) 542node.InsertAt(node.Size, item);