4 writes to keys
mscorlib (4)
system\collections\sortedlist.cs (4)
97keys = emptyArray; 114keys = new Object[initialCapacity]; 213keys = newKeys; 219keys = emptyArray;
26 references to keys
mscorlib (26)
system\collections\sortedlist.cs (26)
171d.Keys.CopyTo(keys, 0); 173Array.Sort(keys, values, comparer); 183int i = Array.BinarySearch(keys, 0, _size, key, comparer); 197return keys.Length; 205if (value != keys.Length) { 210Array.Copy(keys, 0, newKeys, 0, _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. 294Array.Copy(keys, 0, sl.keys, 0, _size); 339DictionaryEntry entry = new DictionaryEntry(keys[i],values[i]); 351array[i] = new KeyValuePairs(keys[i],values[i]); 361int newCapacity = keys.Length == 0? 16: keys.Length * 2; 401return keys[index]; 449int i = Array.BinarySearch(keys, 0, _size, key, comparer); 470int ret = Array.BinarySearch(keys, 0, _size, key, comparer); 486if (_size == keys.Length) EnsureCapacity(_size + 1); 488Array.Copy(keys, index, keys, index + 1, _size - index); 491keys[index] = key; 505Array.Copy(keys, index + 1, keys, index, _size - index); 508keys[_size] = null; 773key = sortedList.keys[index]; 871Array.Copy(sortedList.keys, 0, array, arrayIndex, sortedList.Count); 896int i = Array.BinarySearch(sortedList.keys, 0,