ImmutableHashSet<T>
public sealed class ImmutableHashSet<T> : IImmutableSet<T>, IReadOnlyCollection<T>, IEnumerable<T>, IEnumerable, IHashKeyCollection<T>, ICollection<T>, ISet<T>, ICollection, IStrongEnumerable<T, Enumerator<T>>
Represents an immutable, unordered hash set.
NuGet package: System.Collections.Immutable (about immutable collections and how to install)
public sealed class Builder<T> : IReadOnlyCollection<T>, IEnumerable<T>, IEnumerable, ISet<T>, ICollection<T>
Represents a hash set that mutates with little or no memory allocations and that can produce or build on immutable hash set instances very efficiently.
NuGet package: System.Collections.Immutable (about immutable collections and how to install)
Enumerates the contents of the immutable hash set without allocating any memory.
NuGet package: System.Collections.Immutable (about immutable collections and how to install)
Gets an immutable hash set for this type that uses the default IEqualityComparer<T>.
Gets the number of elements in the immutable hash set.
Gets a value that indicates whether the current immutable hash set is empty.
Gets the object that is used to obtain hash codes for the keys and to check the equality of values in the immutable hash set.
Adds the specified element to the hash set.
Retrieves an empty immutable hash set that has the same sorting and ordering semantics as this instance.
Determines whether this immutable hash set contains the specified element.
Removes the elements in the specified collection from the current immutable hash set.
Returns an enumerator that iterates through the collection.
Creates an immutable hash set that contains elements that exist in both this set and the specified set.
Determines whether the current immutable hash set is a proper (strict) subset of a specified collection.
Determines whether the current immutable hash set is a proper (strict) superset of a specified collection.
Determines whether the current immutable hash set is a subset of a specified collection.
Determines whether the current immutable hash set is a superset of a specified collection.
Determines whether the current immutable hash set overlaps with the specified collection.
Removes the specified element from this immutable hash set.
Determines whether the current immutable hash set and the specified collection contain the same elements.
Creates an immutable hash set that contains only elements that are present either in the current set or in the specified collection, but not both.
Creates an immutable hash set that has the same contents as this set and can be efficiently mutated across multiple operations by using standard mutable interfaces.
Searches the set for a given value and returns the equal value it finds, if any.
Creates a new immutable hash set that contains all elements that are present in either the current set or in the specified collection.
Gets an instance of the immutable hash set that uses the specified equality comparer for its search methods.