49_items = s_emptyArray; 62_items = s_emptyArray; 64_items = new SegmentedArray<T>(capacity); 78_items = (SegmentedArray<T>)segmentedList._items.Clone(); 88_items = s_emptyArray; 93_items = new SegmentedArray<T>(count); 106_items = s_emptyArray; 141_items = newItems; 145_items = s_emptyArray;

135return ref self._list._items[index];

67return ref ReadOnlyList._items[index];

78_items = (SegmentedArray<T>)segmentedList._items.Clone(); 94if ((T[][])_items.SyncRoot is { Length: 1 } segments) 124get => _items.Length; 132if (value != _items.Length) 139SegmentedArray.Copy(_items, newItems, _size); 177return _items[index]; 186_items[index] = value; 224var array = _items; 244_items[size] = item; 302return SegmentedArray.BinarySearch<T>(_items, index, count, item, comparer); 328SegmentedArray.Clear(_items, 0, size); // Clear the elements so that the gc can reclaim the references. 368list._items[i] = converter(_items[i]); 391SegmentedArray.Copy(_items, 0, array!, arrayIndex, _size); 411SegmentedArray.Copy(_items, index, array, arrayIndex, count); 417SegmentedArray.Copy(_items, 0, array, arrayIndex, _size); 427if (_items.Length < min) 429var newCapacity = _items.Length == 0 ? DefaultCapacity : _items.Length * 2; 452if (match(_items[i])) 454return _items[i]; 470if (match(_items[i])) 472list.Add(_items[i]); 504if (match(_items[i])) 519if (match(_items[i])) 521return _items[i]; 566if (match(_items[i])) 589action(_items[i]); 628SegmentedArray.Copy(_items, index, list._items, 0, count); 642=> SegmentedArray.IndexOf(_items, item, 0, _size); 666return SegmentedArray.IndexOf(_items, item, index, _size - index); 686return SegmentedArray.IndexOf(_items, item, index, count); 697return SegmentedArray.IndexOf(_items, item, index, count, comparer); 711if (_size == _items.Length) 715SegmentedArray.Copy(_items, index, _items, index + 1, _size - index); 717_items[index] = item; 761SegmentedArray.Copy(_items, index, _items, index + count, _size - index); 768SegmentedArray.Copy(_items, 0, _items, index, index); 770SegmentedArray.Copy(_items, index + count, _items, index * 2, _size - index); 774SegmentedArray.Copy(list._items, 0, _items, index, list.Count); 778SegmentedArray.Copy(array, 0, _items, index, array.Length); 784_items[targetIndex++] = item; 874return SegmentedArray.LastIndexOf(_items, item, index, count); 905return SegmentedArray.LastIndexOf(_items, item, index, count, comparer); 942while (freeIndex < _size && !match(_items[freeIndex])) 951while (current < _size && match(_items[current])) 957_items[freeIndex++] = _items[current++]; 965SegmentedArray.Clear(_items, freeIndex, _size - freeIndex); // Clear the elements so that the gc can reclaim the references. 985SegmentedArray.Copy(_items, index + 1, _items, index, _size - index); 991_items[_size] = default!; 1017SegmentedArray.Copy(_items, index + count, _items, index, _size - index); 1025SegmentedArray.Clear(_items, _size, count); 1056SegmentedArray.Reverse(_items, index, count); 1096SegmentedArray.Sort<T>(_items, index, count, comparer); 1110SegmentedArray.Sort<T>(_items, 0, _size, Comparer<T>.Create(comparison)); 1125SegmentedArray.Copy(_items, array, _size); 1140var threshold = (int)(_items.Length * 0.9); 1156if (!match(_items[i])) 1189_current = localList._items[_index];