Size

src\Framework\MS\Internal\Data\RBNode.cs (1)

542Size += delta;

src\Framework\MS\Internal\Data\RBTree.cs (1)

65Size = MaxSize;

src\Framework\MS\Internal\Data\LiveShapingBlock.cs (2)

78int size = Size; 442size=Size;

src\Framework\MS\Internal\Data\RBFinger.cs (2)

47if (finger.Offset == finger.Node.Size) 63finger.Offset = finger.Node.Size - 1;

src\Framework\MS\Internal\Data\RBNode.cs (49)

104else if (index < LeftSize + Size) 111result = new RBFinger<T>() { Node = this, Offset = Size, Index = LeftSize + Size, Found = false }; 114result = RightChild.FindIndex(index - LeftSize - Size, exists); 115result.Index += LeftSize + Size; 137else if ((compR = comparison(x, GetItemAt(Size - 1))) <= 0) 140int offset = BinarySearch(x, 1, Size - 1, comparison, compR, out found); 146result = new RBFinger<T>() { Node = this, Offset = Size, Index = LeftSize + Size }; 150result.Index += LeftSize + Size; 163int left=0, right=Size; 177compL = (left < Size) ? comparison(x, GetItemAt(left)) : +1; 194if (LeftSize + Size <= low) 200if (LeftSize + Size >= high) 217int delta = LeftSize + Size; 281if (parent == null || comparison(x, parent.GetItemAt(parent.Size-1)) >= 0) 284nodeIndex = nodeIndex - startingNode.LeftSize - parent.Size; 288int offset = parent.BinarySearch(x, 1, parent.Size - 1, comparison, -1, out found); 301if (newFinger.Offset == newFinger.Node.Size) 332if (newNode.Size < MaxSize) 350if (successor.Size < MaxSize) 371Copy(node, offset + 1, node, offset, node.Size - offset - 1); 373node.SetItemAt(node.Size, default(T)); 375if (node.Size == 0) 393return root.InsertNode(index + node.Size); 410index += parent.LeftSize + parent.Size; 417if (Size < MaxSize) 420Copy(this, offset, this, offset + 1, Size - offset); 426Debug.Assert(successor != null && successor.Size < MaxSize, "InsertAt: successor should have room"); 427if (successor.Size == 0) 447Debug.Assert(succsucc.Size == MaxSize, "InsertAt: outer nodes should be full"); 451Copy(successor, 0, successor, s, successor.Size); 455Copy(succsucc, 0, successor, s + successor.Size, s); 470Copy(successor, offset - (MaxSize - s), successor, offset - (MaxSize - s) + 1, successor.Size + s + s - (offset - (MaxSize - s))); 481int s = (Size + successor.Size + 1) / 2; 486Copy(successor, 0, successor, MaxSize - s + 1, successor.Size); 496Copy(successor, 0, successor, MaxSize - s, successor.Size); 500Copy(successor, offset - s, successor, offset - s + 1, successor.Size + MaxSize - offset); 525Debug.Assert(index >= node.LeftSize + node.Size, "InsertNode: index should fall between nodes"); 526node.RightChild = InsertNode(root, node, node.RightChild, index - node.LeftSize - node.Size, out newNode); 539for (int k=Size+delta; k<Size; ++k) 569if (index < node.LeftSize || (index == node.LeftSize && node.Size > 0)) 578Debug.Assert(!deleteHere || node.Size == 0, "DeleteNode: Deleted node should be empty"); 601node.RightChild = DeleteNode(node, node.RightChild, index - node.LeftSize - node.Size); 619node.LeftSize -= leftmost.Size; 631node.LeftSize += this.LeftSize + this.Size; 645this.LeftSize -= node.LeftSize + node.Size;

src\Framework\MS\Internal\Data\RBTree.cs (5)

101else if (node.Size < MaxSize) 109if (successor.Size >= MaxSize) 113successor = InsertNode(finger.Index + node.Size - finger.Offset); 551if (node.Size < MaxSize) 553node.InsertAt(node.Size, item);