89_size = count; 93_size = 0; 222_items[_size++] = item; 307_size = 0; 353list._size = _size; 599list._size = count; 680_size++; 732_size += count; 869_size = freeIndex; 882_size--; 907_size -= count;

116if (value < _size) { 124if (_size > 0) { 125Array.Copy(_items, 0, newItems, 0, _size); 140return _size; 177if ((uint) index >= (uint)_size) { 185if ((uint) index >= (uint)_size) { 221if (_size == _items.Length) EnsureCapacity(_size + 1); 248InsertRange(_size, collection); 281if (_size - index < count) 304if (_size > 0) 306Array.Clear(_items, 0, _size); // Don't need to doc this but we clear the elements so that the gc can reclaim the references. 318for(int i=0; i<_size; i++) 325for(int i=0; i<_size; i++) { 349List<TOutput> list = new List<TOutput>(_size); 350for( int i = 0; i< _size; i++) { 353list._size = _size; 375Array.Copy(_items, 0, array, arrayIndex, _size); 387if (_size - index < count) { 398Array.Copy(_items, 0, array, arrayIndex, _size); 426for(int i = 0 ; i < _size; i++) { 441for(int i = 0 ; i < _size; i++) { 452return FindIndex(0, _size, match); 458return FindIndex(startIndex, _size - startIndex, match); 462if( (uint)startIndex > (uint)_size ) { 466if (count < 0 || startIndex > _size - count) { 490for(int i = _size - 1 ; i >= 0; i--) { 501return FindLastIndex(_size - 1, _size, match); 518if(_size == 0) { 526if ( (uint)startIndex >= (uint)_size) { 553for(int i = 0 ; i < _size; i++) { 591if (_size - index < count) { 615return Array.IndexOf(_items, item, 0, _size); 636if (index > _size) 641return Array.IndexOf(_items, item, index, _size - index); 654if (index > _size) 657if (count <0 || index > _size - count) ThrowHelper.ThrowArgumentOutOfRangeException(ExceptionArgument.count, ExceptionResource.ArgumentOutOfRange_Count); 671if ((uint) index > (uint)_size) { 675if (_size == _items.Length) EnsureCapacity(_size + 1); 676if (index < _size) { 677Array.Copy(_items, index, _items, index + 1, _size - index); 706if ((uint)index > (uint)_size) { 715EnsureCapacity(_size + count); 716if (index < _size) { 717Array.Copy(_items, index, _items, index + count, _size - index); 725Array.Copy(_items, index+count, _items, index*2, _size-index); 757if (_size == 0) { // Special case for empty list 761return LastIndexOf(item, _size - 1, _size); 776if (index >= _size) 805if (_size == 0) { // Special case for empty list 809if (index >= _size) { 853while( freeIndex < _size && !match(_items[freeIndex])) freeIndex++; 854if( freeIndex >= _size) return 0; 857while( current < _size) { 859while( current < _size && match(_items[current])) current++; 861if( current < _size) { 867Array.Clear(_items, freeIndex, _size - freeIndex); 868int result = _size - freeIndex; 878if ((uint)index >= (uint)_size) { 883if (index < _size) { 884Array.Copy(_items, index + 1, _items, index, _size - index); 886_items[_size] = default(T); 901if (_size - index < count) 906int i = _size; 908if (index < _size) { 909Array.Copy(_items, index + count, _items, index, _size - index); 911Array.Clear(_items, _size, count); 938if (_size - index < count) 976if (_size - index < count) 990if( _size > 0) { 992Array.Sort(_items, 0, _size, comparer); 1002T[] array = new T[_size]; 1003Array.Copy(_items, 0, array, 0, _size); 1018if( _size < threshold ) { 1019Capacity = _size; 1029for(int i = 0 ; i < _size; i++) { 1161if (version == localList._version && ((uint)index < (uint)localList._size)) 1176index = list._size + 1; 1189if( index == 0 || index == list._size + 1) {