5 writes to _slots
Microsoft.Build (5)
Collections\RetrievableEntryHashSet\RetrievableEntryHashSet.cs (5)
558_slots = new Slot[capacity]; 712_slots = null; 746_slots = newSlots; 768_slots = new Slot[size]; 801_slots = newSlots;
35 references to _slots
Microsoft.Build (35)
Collections\RetrievableEntryHashSet\RetrievableEntryHashSet.cs (35)
184if ((_count == 0 && _slots.Length > HashHelpers.GetMinPrime()) || 185(_count > 0 && _slots.Length / _count > ShrinkThreshold)) 270Array.Clear(_slots, 0, _lastIndex); 369for (int i = _buckets[hashCode % _buckets.Length] - 1; i >= 0; i = _slots[i].next) 371if (_slots[i].hashCode == hashCode && _constrainedComparer != null ? _constrainedComparer.Equals(_slots[i].value.Key, item, index, length) : _comparer.Equals(_slots[i].value.Key, item)) 373return _slots[i].value; 422for (int i = _buckets[bucket] - 1; i >= 0; last = i, i = _slots[i].next) 424if (_slots[i].hashCode == hashCode && _comparer.Equals(_slots[i].value.Key, item)) 429_buckets[bucket] = _slots[i].next + 1; 434_slots[last].next = _slots[i].next; 436_slots[i].hashCode = -1; 437_slots[i].value = default(T); 438_slots[i].next = _freeList; 685if (_slots[i].hashCode >= 0) 687array[arrayIndex + numCopied] = _slots[i].value; 730if (_slots[i].hashCode >= 0) 732newSlots[newIndex] = _slots[i]; 743Debug.Assert(newSlots.Length <= _slots.Length, "capacity increased after TrimExcess"); 789if (_slots != null) 791Array.Copy(_slots, 0, newSlots, 0, _lastIndex); 827for (int i = _buckets[hashCode % _buckets.Length] - 1; i >= 0; i = _slots[i].next) 829if (_slots[i].hashCode == hashCode && _comparer.Equals(_slots[i].value.Key, key)) 834_slots[i].value = value; 842_freeList = _slots[index].next; 846if (_lastIndex == _slots.Length) 855_slots[index].hashCode = hashCode; 856_slots[index].value = value; 857_slots[index].next = _buckets[bucket] - 1; 979if (_set._slots[_index].hashCode >= 0) 981_current = _set._slots[_index].value;