A HashSet is an unordered collection of the unique elements. It is found in System.Collections.Generic namespace. It is used in a situation where we want to prevent duplicates from being inserted in the collection. As far as performance is concerned, it is better in comparison to the list. HashSet
Here, mySet1 and mySet2 are the two HashSets and the function returns the elements of mySet2 which are not in mySet1.
Exception: This method will give ArgumentNullException if the HashSet is null.
Below given are some examples to understand the implementation in a better way:
7 8 9 10
The elements in mySet1 are : Punjab Haryana Jammu Himachal Delhi The elements in mySet2 are : Bangalore Kerala Uttar Pradesh Himachal Delhi The elements in mySet2 are : Bangalore Kerala Uttar Pradesh
- C# | Check if HashSet and the specified collection contain the same elements
- C# | Check if a HashSet and a specified collection share common elements
- C# | Remove all elements from a HashSet
- C# | Remove elements from a HashSet with conditions defined by the predicate
- C# | Remove all elements from the Collection<T>
- C# | Create HashSet from another collection
- C# | Check if a HashSet is a subset of the specified collection
- C# | Check if a HashSet is a superset of the specified collection
- C# | Check if a HashSet is a proper superset of the specified collection
- C# | Check if a HashSet is a proper subset of the specified collection
- C# | Remove the specified element from a HashSet
- C# | Remove element at specified index of Collection<T>
- C# | Copy the elements of collection over a range of elements in ArrayList
- C# | Number of elements in HashSet
- C# | Get the number of elements contained in Collection<T>
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.