79_size = segmentedList._size; 97_size = count; 228_size = size + 1; 243_size = size + 1; 325_size = 0; 370list._size = _size; 629list._size = count; 718_size++; 787_size += count; 969_size = freeIndex; 982_size--; 1014_size -= count;

79_size = segmentedList._size; 127if (value < _size) 137if (_size > 0) 139SegmentedArray.Copy(_items, newItems, _size); 152public int Count => _size; 173if ((uint)index >= (uint)_size) 182if ((uint)index >= (uint)_size) 225var size = _size; 241var size = _size; 268=> InsertRange(_size, collection); 299if (_size - index < count) 324var size = _size; 346return _size != 0 && IndexOf(item) != -1; 365var list = new SegmentedList<TOutput>(_size); 366for (var i = 0; i < _size; i++) 370list._size = _size; 391SegmentedArray.Copy(_items, 0, array!, arrayIndex, _size); 405if (_size - index < count) 417SegmentedArray.Copy(_items, 0, array, arrayIndex, _size); 450for (var i = 0; i < _size; i++) 468for (var i = 0; i < _size; i++) 479=> FindIndex(0, _size, match); 482=> FindIndex(startIndex, _size - startIndex, match); 486if ((uint)startIndex > (uint)_size) 491if (count < 0 || startIndex > _size - count) 517for (var i = _size - 1; i >= 0; i--) 528=> FindLastIndex(_size - 1, _size, match); 540if (_size == 0) 551if ((uint)startIndex >= (uint)_size) 583for (var i = 0; i < _size; i++) 622if (_size - index < count) 642=> SegmentedArray.IndexOf(_items, item, 0, _size); 664if (index > _size) 666return SegmentedArray.IndexOf(_items, item, index, _size - index); 680if (index > _size) 683if (count < 0 || index > _size - count) 691if (index > _size) 694if (count < 0 || index > _size - count) 707if ((uint)index > (uint)_size) 711if (_size == _items.Length) 712EnsureCapacity(_size + 1); 713if (index < _size) 715SegmentedArray.Copy(_items, index, _items, index + 1, _size - index); 748if ((uint)index > (uint)_size) 758EnsureCapacity(_size + count); 759if (index < _size) 761SegmentedArray.Copy(_items, index, _items, index + count, _size - index); 770SegmentedArray.Copy(_items, index + count, _items, index * 2, _size - index); 811if (_size == 0) 817return LastIndexOf(item, _size - 1, _size); 832if (index >= _size) 848if (_size == 0) 864if (index >= _size) 879if (_size == 0) 895if (index >= _size) 942while (freeIndex < _size && !match(_items[freeIndex])) 944if (freeIndex >= _size) 948while (current < _size) 951while (current < _size && match(_items[current])) 954if (current < _size) 965SegmentedArray.Clear(_items, freeIndex, _size - freeIndex); // Clear the elements so that the gc can reclaim the references. 968var result = _size - freeIndex; 978if ((uint)index >= (uint)_size) 983if (index < _size) 985SegmentedArray.Copy(_items, index + 1, _items, index, _size - index); 991_items[_size] = default!; 1009if (_size - index < count) 1015if (index < _size) 1017SegmentedArray.Copy(_items, index + count, _items, index, _size - index); 1025SegmentedArray.Clear(_items, _size, count); 1051if (_size - index < count) 1091if (_size - index < count) 1108if (_size > 1) 1110SegmentedArray.Sort<T>(_items, 0, _size, Comparer<T>.Create(comparison)); 1119if (_size == 0) 1124var array = new T[_size]; 1125SegmentedArray.Copy(_items, array, _size); 1141if (_size < threshold) 1143Capacity = _size; 1154for (var i = 0; i < _size; i++) 1187if (_version == localList._version && ((uint)_index < (uint)localList._size)) 1203_index = _list._size + 1; 1214if (_index == 0 || _index == _list._size + 1)