6 writes to _size
System.Collections.NonGeneric (6)
System\Collections\SortedList.cs (6)
84_size = 0; 167_size = d.Count; 288_size = 0; 299sl._size = _size; 505_size++; 515_size--;
30 references to _size
System.Collections.NonGeneric (30)
System\Collections\SortedList.cs (30)
177int i = Array.BinarySearch(keys, 0, _size, key, comparer); 208if (_size > 0) 210Array.Copy(keys, newKeys, _size); 211Array.Copy(values, newValues, _size); 219Debug.Assert(_size == 0, "Size is not zero"); 233return _size; 286Array.Clear(keys, 0, _size); // Don't need to doc this but we clear the elements so that the gc can reclaim the references. 287Array.Clear(values, 0, _size); // Don't need to doc this but we clear the elements so that the gc can reclaim the references. 296SortedList sl = new SortedList(_size); 297Array.Copy(keys, sl.keys, _size); 298Array.Copy(values, sl.values, _size); 299sl._size = _size; 395return new SortedListEnumerator(this, 0, _size, SortedListEnumerator.DictEntry); 405return new SortedListEnumerator(this, 0, _size, SortedListEnumerator.DictEntry); 457int i = Array.BinarySearch(keys, 0, _size, key, comparer); 479int ret = Array.BinarySearch(keys, 0, _size, key, comparer); 491return Array.IndexOf(values, value, 0, _size); 497if (_size == keys.Length) EnsureCapacity(_size + 1); 498if (index < _size) 500Array.Copy(keys, index, keys, index + 1, _size - index); 501Array.Copy(values, index, values, index + 1, _size - index); 516if (index < _size) 518Array.Copy(keys, index + 1, keys, index, _size - index); 519Array.Copy(values, index + 1, values, index, _size - index); 521keys[_size] = null!; 522values[_size] = null; 567Capacity = _size; 899get { return sortedList._size; } 1003get { return sortedList._size; }