HashSet In C#

Introduction

 

C# HashSet is an unordered collection that contains unique elements. The HashSet<T> class represents a hash set that is defined in the System.Collections.Generic namespace. .NET HashSet class provides several methods to add items, remove items, find and search items. The HashSet class also offers methods to compare two objects and supports operations such as union, intersection, subset, superset, overlap and symmetric differences.

 

Create Hashset<T>

 

Like any other object in .NET and C#, we use the new operator to create a HashSet object and pass a data type. The following code snippet creates two objects of int type data. 

HashSet<int> firstset = new HashSet<int>();
HashSet<int> secondset = new HashSet<int>();

Add Items to HashSet

 

The Add method is used to insert items to a HashSet. The following code snippet adds items to both of the HashSet objects defined in the previous section. 

for (int i = 1; i < 10; i++) {
    firstset.Add(5 * i);
}
for (int j = 1; j < 10; j++) {
    secondset.Add(10 * j);
}

Read HashSet Items

 

All collection objects in C# and .NET can be read using a foreach loop. The following code snippet reads both HashSet collections and prints their itesm to the console.

namespace ConsoleApplication14 {
    class Program {
        static void Main(string[] args) {
            HashSet < int > firstset = new HashSet < int > ();
            HashSet < int > secondset = new HashSet < int > ();
            for (int i = 1; i <= 10; i++) {
                firstset.Add(5 * i);
            }
            for (int j = 1; j <= 10; j++) {
                secondset.Add(10 * j);
            }
            Console.WriteLine("The table of five(5) is:");
            foreach(int a in firstset) {
                Console.WriteLine(a);
            }
            Console.WriteLine("The table of Ten(10) is:");
            foreach(int b in secondset) {
                Console.WriteLine(b);
            }
        }
    }
}

Here is the output.

 

Remove Items from HashSet

 

The Remove() method removes items from a HashSet. The Remove method takes the item as an input and removes it from the collection.

 

The following code snippet is an example of using the Remove method.

namespace ConsoleApplication14 {
    class Program {
        static void Main(string[] args) {
            HashSet < int > firstset = new HashSet < int > ();
            for (int i = 1; i <= 10; i++) {
                firstset.Add(5 * i);
            }
            Console.WriteLine("The table of five(5) is:");
            foreach(int a in firstset) {
                Console.WriteLine(a);
            }
            for (int i = 1; i <= 10; i++) {
                if (i < 8) {
                    firstset.Remove(5 * i);
                }
            }
            Console.WriteLine("After Removal the elements the hashset is as,");
            foreach(int a in firstset) {
                Console.WriteLine(a);
            }
        }
    }
}

Here is the output.

 

 

Finding Items in HashSet

 

The Contains method of HashSet is used to find items in a collection. This method finds an element and if the element is present in the list, it returns true, otherwise it returns false. The following code example uses Contains method to find items in a collection. 

namespace ConsoleApplication14 {
    class Program {
        static void Main(string[] args) {
            HashSet < int > firstset = new HashSet < int > ();
            for (int i = 1; i <= 10; i++) {
                firstset.Add(5 * i);
            }
            Console.WriteLine("The table of five(5) is:");
            foreach(int a in firstset) {
                Console.WriteLine(a);
            }
            Console.WriteLine("ITem contain is:" + firstset.Contains(15));
            Console.WriteLine("ITem contain is:" + firstset.Contains(55));
            Console.WriteLine("ITem contain is:" + firstset.Contains(45));
        }
    }
}

Here is the output.

 

 

Summary

 

In this article, I've explained C# HashSet and how to use its methods and properties.