6 writes to _size
mscorlib (6)
system\collections\sortedlist.cs (6)
99_size = 0; 174_size = d.Count; 284_size = 0; 296sl._size = _size; 493_size++; 503_size--;
30 references to _size
mscorlib (30)
system\collections\sortedlist.cs (30)
183int i = Array.BinarySearch(keys, 0, _size, key, comparer); 209if (_size > 0) { 210Array.Copy(keys, 0, newKeys, 0, _size); 211Array.Copy(values, 0, newValues, 0, _size); 218Contract.Assert( _size == 0, "Size is not zero"); 230return _size; 282Array.Clear(keys, 0, _size); // Don't need to doc this but we clear the elements so that the gc can reclaim the references. 283Array.Clear(values, 0, _size); // Don't need to doc this but we clear the elements so that the gc can reclaim the references. 293SortedList sl = new SortedList(_size); 294Array.Copy(keys, 0, sl.keys, 0, _size); 295Array.Copy(values, 0, sl.values, 0, _size); 296sl._size = _size; 384return new SortedListEnumerator(this, 0, _size, SortedListEnumerator.DictEntry); 393return new SortedListEnumerator(this, 0, _size, SortedListEnumerator.DictEntry); 449int i = Array.BinarySearch(keys, 0, _size, key, comparer); 470int ret = Array.BinarySearch(keys, 0, _size, key, comparer); 481return Array.IndexOf(values, value, 0, _size); 486if (_size == keys.Length) EnsureCapacity(_size + 1); 487if (index < _size) { 488Array.Copy(keys, index, keys, index + 1, _size - index); 489Array.Copy(values, index, values, index + 1, _size - index); 504if (index < _size) { 505Array.Copy(keys, index + 1, keys, index, _size - index); 506Array.Copy(values, index + 1, values, index, _size - index); 508keys[_size] = null; 509values[_size] = null; 553Capacity = _size; 833get { return sortedList._size; } 921get { return sortedList._size; }