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
Where, mySet1 and mySet2 are HashSets.
Return Type: This method returns true if the both HashSets share at least one common element otherwise it returns false.
Below given are some examples to understand the implementation in a better way :
- C# | Check if SortedSet and a specified collection share common elements
- C# | Check if HashSet and the specified collection contain the same elements
- C# | Remove all elements in a collection from a HashSet
- C# | Check if a HashSet is a superset of the specified collection
- C# | Check if a HashSet is a subset of the specified collection
- C# | Check if a HashSet is a proper subset of the specified collection
- C# | Check if a HashSet is a proper superset of the specified collection
- C# | Create HashSet from another collection
- C# | Check if SortedSet and the specified collection contain the same elements
- C# | Number of elements in HashSet
- C# | Remove all elements from a HashSet
- C# | Check if a HashSet contains the specified element
- C# | Copy the elements of collection over a range of elements in ArrayList
- C# | Check if two HashSet<T> objects are equal
- C# | Remove elements from a HashSet with conditions defined by the predicate
- C# | Remove all elements from the Collection<T>
- C# | Check if an element is in the Collection<T>
- C# | Copying the Collection<T> elements to an array
- C# | Get the number of elements contained in Collection<T>
- C# | Adding the elements of the specified collection to the end of the List
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.