9 writes to _items
System.Private.CoreLib (9)
src\libraries\System.Private.CoreLib\src\System\Collections\Generic\List.cs (9)
39_items = s_emptyArray; 52_items = s_emptyArray; 54_items = new T[capacity]; 71_items = s_emptyArray; 75_items = new T[count]; 82_items = s_emptyArray; 116_items = newItems; 120_items = s_emptyArray; 484_items = newItems;
80 references to _items
System.Private.CoreLib (80)
src\libraries\System.Private.CoreLib\src\System\Collections\Generic\CollectionExtensions.cs (7)
105if (list._items.Length - list._size < source.Length) 110source.CopyTo(list._items.AsSpan(list._size)); 137if (list._items.Length - list._size < source.Length) 147Array.Copy(list._items, index, list._items, index + source.Length, list._size - index); 153source.CopyTo(list._items.AsSpan(index)); 172new ReadOnlySpan<T>(list._items, 0, list._size).CopyTo(destination);
src\libraries\System.Private.CoreLib\src\System\Collections\Generic\List.cs (70)
76c.CopyTo(_items, 0); 99get => _items.Length; 107if (value != _items.Length) 114Array.Copy(_items, newItems, _size); 152return _items[index]; 161_items[index] = value; 199T[] array = _items; 216Debug.Assert(_size == _items.Length); 220_items[size] = item; 255if (_items.Length - _size < count) 260c.CopyTo(_items, _size); 309return Array.BinarySearch(_items, index, count, item, comparer); 329Array.Clear(_items, 0, size); // Clear the elements so that the gc can reclaim the references. 374list._items[i] = converter(_items[i]); 397Array.Copy(_items, 0, array!, arrayIndex, _size); 417Array.Copy(_items, index, array, arrayIndex, count); 423Array.Copy(_items, 0, array, arrayIndex, _size); 439if (_items.Length < capacity) 444return _items.Length; 476Array.Copy(_items, newItems, length: indexToInsert); 481Array.Copy(_items, indexToInsert, newItems, indexToInsert + insertionCount, _size - indexToInsert); 490Debug.Assert(_items.Length < capacity); 492int newCapacity = _items.Length == 0 ? DefaultCapacity : 2 * _items.Length; 517if (match(_items[i])) 519return _items[i]; 535if (match(_items[i])) 537list.Add(_items[i]); 569if (match(_items[i])) return i; 583if (match(_items[i])) 585return _items[i]; 630if (match(_items[i])) 653action(_items[i]); 691Array.Copy(_items, index, list._items, 0, count); 719=> Array.IndexOf(_items, item, 0, _size); 743return Array.IndexOf(_items, item, index, _size - index); 763return Array.IndexOf(_items, item, index, count); 777if (_size == _items.Length) 783Array.Copy(_items, index, _items, index + 1, _size - index); 785_items[index] = item; 826if (_items.Length - _size < count) 832Array.Copy(_items, index, _items, index + count, _size - index); 839Array.Copy(_items, 0, _items, index, index); 841Array.Copy(_items, index + count, _items, index * 2, _size - index); 845c.CopyTo(_items, index); 935return Array.LastIndexOf(_items, item, index, count); 972while (freeIndex < _size && !match(_items[freeIndex])) freeIndex++; 979while (current < _size && match(_items[current])) current++; 984_items[freeIndex++] = _items[current++]; 990Array.Clear(_items, freeIndex, _size - freeIndex); // Clear the elements so that the gc can reclaim the references. 1010Array.Copy(_items, index + 1, _items, index, _size - index); 1014_items[_size] = default!; 1040Array.Copy(_items, index + count, _items, index, _size - index); 1046Array.Clear(_items, _size, count); 1077Array.Reverse(_items, index, count); 1117Array.Sort(_items, index, count, comparer); 1131ArraySortHelper<T>.Sort(new Span<T>(_items, 0, _size), comparison); 1146Array.Copy(_items, array, _size); 1161int threshold = (int)(((double)_items.Length) * 0.9); 1177if (!match(_items[i])) 1210_current = localList._items[_index];
src\libraries\System.Private.CoreLib\src\System\Runtime\InteropServices\CollectionsMarshal.cs (3)
28T[] items = list._items; 37Debug.Assert(typeof(T[]) == list._items.GetType(), "Implementation depends on List<T> always using a T[] and not U[] where U : T."); 132Array.Clear(list._items, count, list._size - count);