4 writes to keys
System.Collections (4)
System\Collections\Generic\SortedList.cs (4)
75keys = Array.Empty<TKey>(); 91keys = new TKey[capacity]; 245keys = newKeys; 250keys = Array.Empty<TKey>();
28 references to keys
System.Collections (28)
System\Collections\Generic\SortedList.cs (28)
155TKey[] keys = this.keys; 158Debug.Assert(count == this.keys.Length); 183int i = Array.BinarySearch<TKey>(keys, 0, _size, key, comparer); 225return keys.Length; 229if (value != keys.Length) 242Array.Copy(keys, newKeys, _size); 396Array.Clear(keys, 0, _size); 447KeyValuePair<TKey, TValue> entry = new KeyValuePair<TKey, TValue>(keys[i], values[i]); 480keyValuePairArray[i + index] = new KeyValuePair<TKey, TValue>(keys[i], values[i]); 495objects[i + index] = new KeyValuePair<TKey, TValue>(keys[i], values[i]); 510int newCapacity = keys.Length == 0 ? DefaultCapacity : keys.Length * 2; 565return keys[index]; 584int i = Array.BinarySearch<TKey>(keys, 0, _size, key, comparer); 642int ret = Array.BinarySearch<TKey>(keys, 0, _size, key, comparer); 659if (_size == keys.Length) EnsureCapacity(_size + 1); 662Array.Copy(keys, index, keys, index + 1, _size - index); 665keys[index] = key; 693Array.Copy(keys, index + 1, keys, index, _size - index); 698keys[_size] = default(TKey)!; 736int threshold = (int)(keys.Length * 0.9); 798_key = _sortedList.keys[_index]; 899_currentKey = _sortedList.keys[_index]; 1049Array.Copy(_dict.keys, 0, array, arrayIndex, _dict.Count); 1060Array.Copy(_dict.keys, 0, array!, arrayIndex, _dict.Count); 1095int i = Array.BinarySearch<TKey>(_dict.keys, 0,