4 writes to keys
System.Collections.NonGeneric (4)
System\Collections\SortedList.cs (4)
82keys = Array.Empty<object>(); 99keys = new object[initialCapacity]; 213keys = newKeys; 220keys = Array.Empty<object>();
28 references to keys
System.Collections.NonGeneric (28)
System\Collections\SortedList.cs (28)
157d.Keys.CopyTo(keys, 0); 162Array.Sort(keys, comparer); 163for (int i = 0; i < keys.Length; i++) 165values[i] = d[keys[i]]; 177int i = Array.BinarySearch(keys, 0, _size, key, comparer); 193return keys.Length; 202if (value != keys.Length) 210Array.Copy(keys, newKeys, _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. 297Array.Copy(keys, sl.keys, _size); 346DictionaryEntry entry = new DictionaryEntry(keys[i], values[i]); 360array[i] = new DebugViewDictionaryItem<object, object?>(keys[i], values[i]); 371int newCapacity = keys.Length == 0 ? 16 : keys.Length * 2; 413return keys[index]; 457int i = Array.BinarySearch(keys, 0, _size, key, comparer); 479int ret = Array.BinarySearch(keys, 0, _size, key, comparer); 497if (_size == keys.Length) EnsureCapacity(_size + 1); 500Array.Copy(keys, index, keys, index + 1, _size - index); 503keys[index] = key; 518Array.Copy(keys, index + 1, keys, index, _size - index); 521keys[_size] = null!; 829_key = _sortedList.keys[_index]; 944Array.Copy(sortedList.keys, 0, array!, arrayIndex, sortedList.Count); 973int i = Array.BinarySearch(sortedList.keys, 0,