65_items = emptyArray; 77_items = emptyArray; 79_items = new Object[capacity]; 94_items = emptyArray; 97_items = new Object[count]; 125_items = newItems; 128_items = new Object[_defaultCapacity];

109return _items.Length; 119if (value != _items.Length) { 123Array.Copy(_items, 0, newItems, 0, _size); 173return _items[index]; 178_items[index] = value; 205if (_size == _items.Length) EnsureCapacity(_size + 1); 206_items[_size] = value; 250return Array.BinarySearch((Array)_items, index, count, value, comparer); 270Array.Clear(_items, 0, _size); // Don't need to doc this but we clear the elements so that the gc can reclaim the references. 285Array.Copy(_items, 0, la._items, 0, _size); 297if (_items[i]==null) 303if ( (_items[i] != null) && (_items[i].Equals(item)) ) 324Array.Copy(_items, 0, array, arrayIndex, _size); 338Array.Copy(_items, index, array, arrayIndex, count); 346if (_items.Length < min) { 347int newCapacity = _items.Length == 0? _defaultCapacity: _items.Length * 2; 416return Array.IndexOf((Array)_items, value, 0, _size); 433return Array.IndexOf((Array)_items, value, startIndex, _size - startIndex); 451return Array.IndexOf((Array)_items, value, startIndex, count); 464if (_size == _items.Length) EnsureCapacity(_size + 1); 466Array.Copy(_items, index, _items, index + 1, _size - index); 468_items[index] = value; 490Array.Copy(_items, index, _items, index + count, _size - index); 495itemsToInsert.CopyTo(_items, index); 554return Array.LastIndexOf((Array)_items, value, startIndex, count); 603Array.Copy(_items, index + 1, _items, index, _size - index); 605_items[_size] = null; 626Array.Copy(_items, index + count, _items, index, _size - index); 628while (i > _size) _items[--i] = null; 668Array.Reverse(_items, index, count); 682c.CopyTo(_items, index); 728Array.Sort(_items, index, count, comparer); 760Array.Copy(_items, 0, array, 0, _size); 776Array.Copy(_items, 0, array, 0, _size); 2520Array.Copy(_baseList._items, _baseIndex, array, 0, _baseSize); 2571currentElement = list._items[++index];