539Size += delta; 829node.Size = Int32.Parse(s.Substring(0, index), TypeConverterHelper.InvariantEnglishUS);

62Size = MaxSize;

75int size = Size; 439size = Size;

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

101else if (index < LeftSize + Size) 108result = new RBFinger<T>() { Node = this, Offset = Size, Index = LeftSize + Size, Found = false }; 111result = RightChild.FindIndex(index - LeftSize - Size, exists); 112result.Index += LeftSize + Size; 134else if ((compR = comparison(x, GetItemAt(Size - 1))) <= 0) 137int offset = BinarySearch(x, 1, Size - 1, comparison, compR, out found); 143result = new RBFinger<T>() { Node = this, Offset = Size, Index = LeftSize + Size }; 147result.Index += LeftSize + Size; 160int left = 0, right = Size; 174compL = (left < Size) ? comparison(x, GetItemAt(left)) : +1; 191if (LeftSize + Size <= low) 197if (LeftSize + Size >= high) 214int delta = LeftSize + Size; 278if (parent == null || comparison(x, parent.GetItemAt(parent.Size - 1)) >= 0) 281nodeIndex = nodeIndex - startingNode.LeftSize - parent.Size; 285int offset = parent.BinarySearch(x, 1, parent.Size - 1, comparison, -1, out found); 298if (newFinger.Offset == newFinger.Node.Size) 329if (newNode.Size < MaxSize) 347if (successor.Size < MaxSize) 368Copy(node, offset + 1, node, offset, node.Size - offset - 1); 370node.SetItemAt(node.Size, default(T)); 372if (node.Size == 0) 390return root.InsertNode(index + node.Size); 407index += parent.LeftSize + parent.Size; 414if (Size < MaxSize) 417Copy(this, offset, this, offset + 1, Size - offset); 423Debug.Assert(successor != null && successor.Size < MaxSize, "InsertAt: successor should have room"); 424if (successor.Size == 0) 444Debug.Assert(succsucc.Size == MaxSize, "InsertAt: outer nodes should be full"); 448Copy(successor, 0, successor, s, successor.Size); 452Copy(succsucc, 0, successor, s + successor.Size, s); 467Copy(successor, offset - (MaxSize - s), successor, offset - (MaxSize - s) + 1, successor.Size + s + s - (offset - (MaxSize - s))); 478int s = (Size + successor.Size + 1) / 2; 483Copy(successor, 0, successor, MaxSize - s + 1, successor.Size); 493Copy(successor, 0, successor, MaxSize - s, successor.Size); 497Copy(successor, offset - s, successor, offset - s + 1, successor.Size + MaxSize - offset); 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); 536for (int k = Size + delta; k < Size; ++k) 566if (index < node.LeftSize || (index == node.LeftSize && node.Size > 0)) 575Debug.Assert(!deleteHere || node.Size == 0, "DeleteNode: Deleted node should be empty"); 598node.RightChild = DeleteNode(node, node.RightChild, index - node.LeftSize - node.Size); 616node.LeftSize -= leftmost.Size; 628node.LeftSize += this.LeftSize + this.Size; 642this.LeftSize -= node.LeftSize + node.Size; 726if (node.Size <= 0) 729if (node.Size > MaxSize) 749for (int k = 1; k < node.Size; ++k) 756for (int j=node.Size; j<MaxSize; ++j) 762size += node.Size; 764maxItem = node.GetItemAt(node.Size - 1); 786sb.Append(node.Size); 787for (int k = 0; k < node.Size; ++k) 832for (int k = 0; k < node.Size-1; ++k) // read data 839node.SetItemAt(node.Size - 1, AsT(Int32.Parse(s.Substring(0, index), TypeConverterHelper.InvariantEnglishUS)));

98else if (node.Size < MaxSize) 106if (successor.Size >= MaxSize) 110successor = InsertNode(finger.Index + node.Size - finger.Offset); 548if (node.Size < MaxSize) 550node.InsertAt(node.Size, item);