Free-ebooks-library - Bahar Ali Khan

The commonality of these types is captured by the interface
ISet.
For historical reasons, HashSet lives in System.Core.dll
(whereas SortedSet and ISet live in System.dll).
HashSet is implemented with a hashtable that stores just keys; SortedSet is
implemented with a red/black tree.
Here’s the definition for HashSet:
public class HashSet : ICollection, IEnumerable, IEnumerable
{
// Constructors
public HashSet();
public HashSet (IEnumerable collection);
public HashSet (IEqualityComparer comparer);
public HashSet (IEnumerable collection, IEqualityComparer comparer);
// Testing for membership
public bool Contains (T item);
// Adding / removing
public bool Add (T item);
public bool Remove (T item);
public int RemoveWhere (Predicate match);
public void Clear();
// Set operations - destructive
public void UnionWith (IEnumerable other); // Adds
public void IntersectWith (IEnumerable other); // Removes
public void ExceptWith (IEnumerable other); // Removes
public void SymmetricExceptWith (IEnumerable other); // Removes
// Set operations - bool
public bool IsSubsetOf (IEnumerable other);
public bool IsProperSubsetOf (IEnumerable other);
public bool IsSupersetOf (IEnumerable other);
public bool IsProperSupersetOf (IEnumerable other);
public bool Overlaps (IEnumerable other);
public bool SetEquals (IEnumerable other);
// Other
public int Count { get; }
public IEqualityComparer Comparer { get; }
public void CopyTo (T[] array);
public void CopyTo (T[] array, int arrayIndex);
public void CopyTo (T[] array, int arrayIndex, int count);
public void TrimExcess();
public static IEqualityComparer CreateSetComparer();
}
SortedSet offers the same set of members, plus the following:
290 | Chapter 7: Collections