53_items = _emptyArray; 65_items = _emptyArray; 67_items = new T[capacity]; 84_items = _emptyArray; 87_items = new T[count]; 94_items = _emptyArray; 127_items = newItems; 130_items = _emptyArray;

88c.CopyTo(_items, 0); 113return _items.Length; 121if (value != _items.Length) { 125Array.Copy(_items, 0, newItems, 0, _size); 181return _items[index]; 189_items[index] = value; 221if (_size == _items.Length) EnsureCapacity(_size + 1); 222_items[_size++] = item; 286return Array.BinarySearch<T>(_items, index, count, item, comparer); 306Array.Clear(_items, 0, _size); // Don't need to doc this but we clear the elements so that the gc can reclaim the references. 319if ((Object) _items[i] == null) 326if (c.Equals(_items[i], item)) return true; 351list._items[i] = converter(_items[i]); 375Array.Copy(_items, 0, array, arrayIndex, _size); 393Array.Copy(_items, index, array, arrayIndex, count); 398Array.Copy(_items, 0, array, arrayIndex, _size); 406if (_items.Length < min) { 407int newCapacity = _items.Length == 0? _defaultCapacity : _items.Length * 2; 427if(match(_items[i])) { 428return _items[i]; 442if(match(_items[i])) { 443list.Add(_items[i]); 479if( match(_items[i])) return i; 491if(match(_items[i])) { 492return _items[i]; 538if( match(_items[i])) { 557action(_items[i]); 598Array.Copy(_items, index, list._items, 0, count); 615return Array.IndexOf(_items, item, 0, _size); 641return Array.IndexOf(_items, item, index, _size - index); 662return Array.IndexOf(_items, item, index, count); 675if (_size == _items.Length) EnsureCapacity(_size + 1); 677Array.Copy(_items, index, _items, index + 1, _size - index); 679_items[index] = item; 717Array.Copy(_items, index, _items, index + count, _size - index); 723Array.Copy(_items, 0, _items, index, index); 725Array.Copy(_items, index+count, _items, index*2, _size-index); 730itemsToInsert.CopyTo(_items, index); 817return Array.LastIndexOf(_items, item, index, count); 853while( freeIndex < _size && !match(_items[freeIndex])) freeIndex++; 859while( current < _size && match(_items[current])) current++; 863_items[freeIndex++] = _items[current++]; 867Array.Clear(_items, freeIndex, _size - freeIndex); 884Array.Copy(_items, index + 1, _items, index, _size - index); 886_items[_size] = default(T); 909Array.Copy(_items, index + count, _items, index, _size - index); 911Array.Clear(_items, _size, count); 941Array.Reverse(_items, index, count); 980Array.Sort<T>(_items, index, count, comparer); 992Array.Sort(_items, 0, _size, comparer); 1003Array.Copy(_items, 0, array, 0, _size); 1017int threshold = (int)(((double)_items.Length) * 0.9); 1030if( !match(_items[i])) { 1163current = localList._items[index];