5 writes to _slots
Microsoft.Build (5)
Collections\RetrievableEntryHashSet\RetrievableEntryHashSet.cs (5)
555_slots = new Slot[capacity]; 709_slots = null; 743_slots = newSlots; 765_slots = new Slot[size]; 798_slots = newSlots;
35 references to _slots
Microsoft.Build (35)
Collections\RetrievableEntryHashSet\RetrievableEntryHashSet.cs (35)
181if ((_count == 0 && _slots.Length > HashHelpers.GetMinPrime()) || 182(_count > 0 && _slots.Length / _count > ShrinkThreshold)) 267Array.Clear(_slots, 0, _lastIndex); 366for (int i = _buckets[hashCode % _buckets.Length] - 1; i >= 0; i = _slots[i].next) 368if (_slots[i].hashCode == hashCode && _constrainedComparer != null ? _constrainedComparer.Equals(_slots[i].value.Key, item, index, length) : _comparer.Equals(_slots[i].value.Key, item)) 370return _slots[i].value; 419for (int i = _buckets[bucket] - 1; i >= 0; last = i, i = _slots[i].next) 421if (_slots[i].hashCode == hashCode && _comparer.Equals(_slots[i].value.Key, item)) 426_buckets[bucket] = _slots[i].next + 1; 431_slots[last].next = _slots[i].next; 433_slots[i].hashCode = -1; 434_slots[i].value = default(T); 435_slots[i].next = _freeList; 682if (_slots[i].hashCode >= 0) 684array[arrayIndex + numCopied] = _slots[i].value; 727if (_slots[i].hashCode >= 0) 729newSlots[newIndex] = _slots[i]; 740Debug.Assert(newSlots.Length <= _slots.Length, "capacity increased after TrimExcess"); 786if (_slots != null) 788Array.Copy(_slots, 0, newSlots, 0, _lastIndex); 824for (int i = _buckets[hashCode % _buckets.Length] - 1; i >= 0; i = _slots[i].next) 826if (_slots[i].hashCode == hashCode && _comparer.Equals(_slots[i].value.Key, key)) 831_slots[i].value = value; 839_freeList = _slots[index].next; 843if (_lastIndex == _slots.Length) 852_slots[index].hashCode = hashCode; 853_slots[index].value = value; 854_slots[index].next = _buckets[bucket] - 1; 976if (_set._slots[_index].hashCode >= 0) 978_current = _set._slots[_index].value;