2 writes to slots
System.Core (2)
System\Linq\Parallel\Utils\HashLookup.cs (2)
40slots = new Slot[7]; 170slots = newSlots;
24 references to slots
System.Core (24)
System\Linq\Parallel\Utils\HashLookup.cs (24)
87for (int i = buckets[bucket] - 1; i >= 0; last = i, i = slots[i].next) 89if (slots[i].hashCode == hashCode && AreKeysEqual(slots[i].key, key)) 93buckets[bucket] = slots[i].next + 1; 97slots[last].next = slots[i].next; 99slots[i].hashCode = -1; 100slots[i].key = default(TKey); 101slots[i].value = default(TValue); 102slots[i].next = freeList; 114for (int i = buckets[hashCode % buckets.Length] - 1; i >= 0; i = slots[i].next) 116if (slots[i].hashCode == hashCode && AreKeysEqual(slots[i].key, key)) 120slots[i].value = value; 125value = slots[i].value; 137freeList = slots[index].next; 141if (count == slots.Length) Resize(); 147slots[index].hashCode = hashCode; 148slots[index].key = key; 149slots[index].value = value; 150slots[index].next = buckets[bucket] - 1; 162Array.Copy(slots, 0, newSlots, 0, count); 180get { return new KeyValuePair<TKey, TValue>(slots[index].key, slots[index].value); }