HashSet in Java

HashSet in Java implements the Set interface of the Collections Framework. It is used to store the unique elements, and it doesn't maintain any specific order of elements.

• HashSet does not allow duplicate elements.
• Uses HashMap internally which is an implementation of hash table data structure.
• Also implements Serializable and Cloneable interfaces.
• HashSet is not thread-safe. To make it thread-safe, synchronization is needed externally.
• Does not support primitive types directly; requires wrapper classes (Integer, Character, etc.).

HashSet Size: 2
Elements in HashSet: [1, 2]

Hierarchy Diagram of HashSet

It implements the Set interface, which is a sub-interface of the Collection interface.

Capacity of HashSet

Capacity refers to the number of buckets in the hash table. The default capacity of a HashSet is 16 and the load factor is 0.75.

When the number of elements exceeds the threshold, the capacity automatically increases

new capacity = old capacity × 2

Collision in HashSet

HashSet internally uses a hash table (via HashMap), where elements are stored based on their hash codes. Sometimes, different elements may produce the same hash code, leading to a collision.

Note: HashSet handles collisions using chaining (LinkedList) and converts it into a balanced tree (Red-Black Tree) when the number of elements in a bucket exceeds a threshold (Java 8+).

Load Factor

Load Factor is a measure that controls how full the HashSet can get before resizing. Default Load Factor = 0.75. If the number of elements exceeds the threshold, the capacity is doubled.

Threshold = capacity × load factor

Constructors of HashSet class

To create a HashSet, we need to create an object of the HashSet class. The HashSet class consists of various constructors that allow the possible creation of the HashSet. The following are the constructors available in this class.

1. HashSet()

Creates a new empty HashSet with default capacity (16) and load factor (0.75).

HashSet<String> set = new HashSet<>();

2. HashSet(int initialCapacity)

Creates an empty HashSet with the specified initial capacity and default load factor (0.75).

HashSet<Type> set = new HashSet<>( initialCapacity);

3. HashSet(int initialCapacity, float loadFactor)

Creates an empty HashSet with the given initial capacity and load factor.

HashSet<Type> set = new HashSet<>( initialCapacity, loadFactor);

4. HashSet(Collection<? extends E> c)

Creates a new HashSet containing the elements of the specified collection (removes duplicates automatically).

HashSet<Type> set = new HashSet<>(c);

Performing Various Operations on HashSet

Let’s see how to perform a few frequently used operations on the HashSet.

1. Adding Elements in HashSet

To add an element to the HashSet, we can use the add() method. However, the insertion order is not retained in the HashSet. We need to keep a note that duplicate elements are not allowed and all duplicate elements are ignored.

HashSet : [Geek, For, Geeks]

2. Removing Elements in HashSet

The values can be removed from the HashSet using the remove() method.

HashSet : [A, B, Geek, For, Geeks, Z]
HashSet after removing element [A, Geek, For, Geeks, Z]
B exists in Set : false

3. Iterating through the HashSet

Iterate through the elements of HashSet using the iterator() method. Also, the most famous one is to use the enhanced for loop.

Using iterator : A, B, Geeks, For, Z, 
Using enhanced for loop : A , B , Geeks , For , Z , 

Methods of HashSet

Differences between HashSet and HashMap.