1 write to _thisSet
System.Collections.Immutable (1)
System\Collections\Frozen\FrozenSetInternalBase.cs (1)
26_thisSet = default;
27 references to _thisSet
System.Collections.Immutable (27)
System\Collections\Frozen\FrozenSetInternalBase.cs (27)
27_thisSet.Store(this); 33Debug.Assert(_thisSet.Count != 0, "EmptyFrozenSet should have been used."); 48return _thisSet.Count < otherCount && IsSubsetOfSetWithCompatibleComparer(otherAsSet); 54return uniqueCount == _thisSet.Count && unfoundCount > 0; 60Debug.Assert(_thisSet.Count != 0, "EmptyFrozenSet should have been used."); 75return _thisSet.Count > otherCount && ContainsAllElements(otherAsSet); 81return uniqueCount < _thisSet.Count && unfoundCount == 0; 87Debug.Assert(_thisSet.Count != 0, "EmptyFrozenSet should have been used."); 92return _thisSet.Count <= otherAsSet.Count && IsSubsetOfSetWithCompatibleComparer(otherAsSet); 97return uniqueCount == _thisSet.Count && unfoundCount >= 0; 103Debug.Assert(_thisSet.Count != 0, "EmptyFrozenSet should have been used."); 118otherCount > _thisSet.Count && 131Debug.Assert(_thisSet.Count != 0, "EmptyFrozenSet should have been used."); 135if (_thisSet.FindItemIndex(element) >= 0) 147Debug.Assert(_thisSet.Count != 0, "EmptyFrozenSet should have been used."); 152return _thisSet.Count == otherAsSet.Count && ContainsAllElements(otherAsSet); 157return uniqueCount == _thisSet.Count && unfoundCount == 0; 163HashSet<T> hs => _thisSet.Comparer.Equals(hs.Comparer), 164SortedSet<T> sortedSet => _thisSet.Comparer.Equals(sortedSet.Comparer), 165ImmutableHashSet<T> ihs => _thisSet.Comparer.Equals(ihs.KeyComparer), 166ImmutableSortedSet<T> iss => _thisSet.Comparer.Equals(iss.KeyComparer), 167FrozenSet<T> fs => _thisSet.Comparer.Equals(fs.Comparer), 192Debug.Assert(_thisSet.Count != 0, "EmptyFrozenSet should have been used."); 195int intArrayLength = (_thisSet.Count / BitsPerInt32) + 1; 211int index = _thisSet.FindItemIndex(item); 243if (_thisSet.FindItemIndex(element) < 0) 254foreach (T item in _thisSet)