Java HashSet

Java HashSet class hierarchy

Java HashSet class is used to create a collection that uses a hash table for storage. It inherits the AbstractSet class and implements Set interface.

The important points about Java HashSet class are:

HashSet stores the elements by using a mechanism called hashing.
HashSet contains unique elements only.
HashSet allows null value.
HashSet class is non synchronized.
HashSet doesn’t maintain the insertion order. Here, elements are inserted on the basis of their hashcode.
HashSet is the best approach for search operations.
The initial default capacity of HashSet is 16, and the load factor is 0.75.

Difference between List and Set

A list can contain duplicate elements whereas Set contains unique elements only.

Hierarchy of HashSet class

The HashSet class extends AbstractSet class which implements Set interface. The Set interface inherits Collection and Iterable interfaces in hierarchical order.

HashSet class declaration

Let’s see the declaration for java.util.HashSet class.

 public class HashSet extends AbstractSet implements Set, Cloneable, Serializable 

Constructors of Java HashSet class

SN	Constructor	Description
1)	HashSet()	It is used to construct a default HashSet.
2)	HashSet(int capacity)	It is used to initialize the capacity of the hash set to the given integer value capacity. The capacity grows automatically as elements are added to the HashSet.
3)	HashSet(int capacity, float loadFactor)	It is used to initialize the capacity of the hash set to the given integer value capacity and the specified load factor.
4)	HashSet(Collection<? extends E> c)	It is used to initialize the hash set by using the elements of the collection c.

Methods of Java HashSet class

Various methods of Java HashSet class are as follows:

SN	Modifier & Type	Method	Description
1)	boolean	add(E e)	It is used to add the specified element to this set if it is not already present.
2)	void	clear()	It is used to remove all of the elements from the set.
3)	object	clone()	It is used to return a shallow copy of this HashSet instance: the elements themselves are not cloned.
4)	boolean	contains(Object o)	It is used to return true if this set contains the specified element.
5)	boolean	isEmpty()	It is used to return true if this set contains no elements.
6)	Iterator<E>	iterator()	It is used to return an iterator over the elements in this set.
7)	boolean	remove(Object o)	It is used to remove the specified element from this set if it is present.
8)	int	size()	It is used to return the number of elements in the set.
9)	Spliterator<E>	spliterator()	It is used to create a late-binding and fail-fast Spliterator over the elements in the set.

Java HashSet Example

Let’s see a simple example of HashSet. Notice, the elements iterate in an unordered collection.

 import java.util.*; class HashSet1{  public static void main(String args[]){   //Creating HashSet and adding elements     HashSet set=new HashSet();    set.add(“One”);      set.add(“Two”);      set.add(“Three”);     set.add(“Four”);    set.add(“Five”);    Iterator i=set.iterator();    while(i.hasNext())    {    System.out.println(i.next());    }  } } 

Five One Four Two Three

Java HashSet example ignoring duplicate elements

In this example, we see that HashSet doesn’t allow duplicate elements.

 import java.util.*; class HashSet2{  public static void main(String args[]){   //Creating HashSet and adding elements   HashSet set=new HashSet();   set.add(“Ravi”);   set.add(“Vijay”);   set.add(“Ravi”);   set.add(“Ajay”);   //Traversing elements   Iterator itr=set.iterator();   while(itr.hasNext()){    System.out.println(itr.next());   }  } } 

       Ajay        Vijay        Ravi

Java HashSet example to remove elements

Here, we see different ways to remove an element.

 import java.util.*; class HashSet3{  public static void main(String args[]){   HashSet set=new HashSet();    set.add(“Ravi”);    set.add(“Vijay”);    set.add(“Arun”);    set.add(“Sumit”);    System.out.println(“An initial list of elements: “+set);    //Removing specific element from HashSet    set.remove(“Ravi”);    System.out.println(“After invoking remove(object) method: “+set);    HashSet set1=new HashSet();    set1.add(“Ajay”);    set1.add(“Gaurav”);    set.addAll(set1);    System.out.println(“Updated List: “+set);    //Removing all the new elements from HashSet    set.removeAll(set1);    System.out.println(“After invoking removeAll() method: “+set);    //Removing elements on the basis of specified condition    set.removeIf(str->str.contains(“Vijay”));      System.out.println(“After invoking removeIf() method: “+set);    //Removing all the elements available in the set    set.clear();    System.out.println(“After invoking clear() method: “+set);  } } 

An initial list of elements: [Vijay, Ravi, Arun, Sumit] After invoking remove(object) method: [Vijay, Arun, Sumit] Updated List: [Vijay, Arun, Gaurav, Sumit, Ajay] After invoking removeAll() method: [Vijay, Arun, Sumit] After invoking removeIf() method: [Arun, Sumit] After invoking clear() method: []

Java HashSet from another Collection

 import java.util.*; class HashSet4{  public static void main(String args[]){    ArrayList list=new ArrayList();    list.add(“Ravi”);    list.add(“Vijay”);    list.add(“Ajay”);        HashSet set=new HashSet(list);    set.add(“Gaurav”);    Iterator i=set.iterator();    while(i.hasNext())    {    System.out.println(i.next());    }  } } 

Vijay Ravi Gaurav Ajay

Java HashSet Example: Book

Let’s see a HashSet example where we are adding books to set and printing all the books.

 import java.util.*; class Book { int id; String name,author,publisher; int quantity; public Book(int id, String name, String author, String publisher, int quantity) { this.id = id; this.name = name; this.author = author; this.publisher = publisher; this.quantity = quantity; } } public class HashSetExample { public static void main(String[] args) { HashSet set=new HashSet(); //Creating Books Book b1=new Book(101,”Let us C”,”Yashwant Kanetkar”,”BPB”,8); Book b2=new Book(102,”Data Communications & Networking”,”Forouzan”,”Mc Graw Hill”,4); Book b3=new Book(103,”Operating System”,”Galvin”,”Wiley”,6); //Adding Books to HashSet set.add(b1); set.add(b2); set.add(b3); //Traversing HashSet for(Book b:set){ System.out.println(b.id+” “+b.name+” “+b.author+” “+b.publisher+” “+b.quantity); } } } 

Output:

101 Let us C Yashwant Kanetkar BPB 8 102 Data Communications & Networking Forouzan Mc Graw Hill 4 103 Operating System Galvin Wiley 6

HashSet in Java