4 writes to keys
System (4)
compmod\system\collections\generic\sortedlist.cs (4)
93keys = emptyKeys; 109keys = new TKey[capacity]; 229keys = newKeys; 233keys = emptyKeys;
28 references to keys
System (28)
compmod\system\collections\generic\sortedlist.cs (28)
168dictionary.Keys.CopyTo(keys, 0); 170Array.Sort<TKey, TValue>(keys, values, comparer); 179int i = Array.BinarySearch<TKey>(keys, 0, _size, key, comparer); 214return keys.Length; 217if (value != keys.Length) { 226Array.Copy(keys, 0, newKeys, 0, _size); 376Array.Clear(keys, 0, _size); 420KeyValuePair<TKey, TValue> entry = new KeyValuePair<TKey, TValue>(keys[i],values[i]); 449keyValuePairArray[i + arrayIndex] = new KeyValuePair<TKey, TValue>(keys[i],values[i]); 460objects[i + arrayIndex] = new KeyValuePair<TKey, TValue>(keys[i],values[i]); 477int newCapacity = keys.Length == 0? _defaultCapacity: keys.Length * 2; 516return keys[index]; 534int i = Array.BinarySearch<TKey>(keys, 0, _size, key, comparer); 587int ret = Array.BinarySearch<TKey>(keys, 0, _size, key, comparer); 603if (_size == keys.Length) EnsureCapacity(_size + 1); 605Array.Copy(keys, index, keys, index + 1, _size - index); 608keys[index] = key; 632Array.Copy(keys, index + 1, keys, index, _size - index); 635keys[_size] = default(TKey); 667int threshold = (int)(((double)keys.Length) * 0.9); 729key = _sortedList.keys[index]; 818currentKey = _sortedList.keys[index]; 957Array.Copy(_dict.keys, 0, array, arrayIndex, _dict.Count); 966Array.Copy(_dict.keys, 0, array, arrayIndex, _dict.Count); 998int i = Array.BinarySearch<TKey>(_dict.keys, 0,