HashMap vs HashSet is the most frequently asked question during any core java interview and interview is not said completed until they will not cover the Collection Framework and multi-threading interview and collections are uncompleted without Covering Hash Set and Hash Map.
Both HashMap and HashSet are part of collection framework which allows us to work with collection of objects. Collection Framework has their own interfaces and implementation classes. Basically collection is divided as Set Interface, List and Queue Interfaces. All this interfaces have their own property also apart from they get from collection like Set allows Collection of objects but forbids duplicate value, List allows duplicate along with indexing.Queue woks on FCFS algorithm.
First we have one look on What HashMap and Hashset is then will go for Differences between HashSet and HashMap
What is HashSet in Java?
HashSet is implementation of Set Interface which does not allow duplicate value all the methods which are in Collection Framework are also in Set Interface by default but when we are talking about Hash set the main thing is objects which are going to be stored in HashSet must override equals() and hashCode() method so that we can check for equality and no duplicate value are stored in our set.if we have created our own objects we need to implement hashCode() and equal() in such a manner that will be able to compare objects correctly when storing in a set so that duplicate objects are not stored,if we have not override this method objects will take default implementation of this method.
public boolean add(Object o) Method is used to add element in a set which returns false if it’s a duplicate value in case of HashSet otherwise returns true if added successfully.
What is HashMap?
public Object put(Object Key,Object value) method is used to add element in map.
You can read more about HashMap in my article How HashMap works in Java and Difference between HashMap and hashtable in Java
Difference between HashSet and HashMap in Java
Following are some differences between HashMap and Hashset:
Hash Map
|
Hash Set
|
HashMap is a implementation of Map interface
|
HashSet is an implementation of Set Interface
|
HashMap Stores data in form of key value pair
|
HashSet Store only objects
|
Put method is used to add element in map
|
Add method is used to add element is Set
|
In hash map hashcode value is calculated using key object
|
Here member object is used for calculating hashcode value which can be same for two objects so equal () method is used to check for equality if it returns false that means two objects are different.
|
HashMap is faster than hashset because unique key is used to access object
|
HashSet is slower than Hashmap
|
Please let me know if you need any other difference between HashSet and HashMap in Java and I will add them here.
Related Java Tutorials
How to deal with UnSupportedClassVersionError in Java
Key differences between Vector and ArrayList in java
Key differences between Vector and ArrayList in java
Posts
13 comments :
hashCode can be the same for 2 keys in a HashMap so HashMap uses equals.
In Oracle's Java implementation HashSet is only a wrapper around a HashMap.
Yes you are correct, hashcode is used to find the bucket location and then while comparing object it uses equals in place of hashcode. you can read more on this on How HashMap works in Java
You made a good point, but the explanation is horrible!
Another difference between HashMap vs HashSet is that HashMap uses put() method while HashSet uses add() method. HashMap requires two object as key and value , while HashSet only need one object to store. Overall HashSet vs HashMap is comparison between Map and Set Collection type in java.
HashSet internally uses HashMap to store Objects.Objects are stored as a key in HashMap and a new dummy Object is placed as value.Since Hashmap does not allow duplicate key,HashSet maintains its uniqueness.
Please share your view on Vector Vs synchronized(arrayList)
So there is no concept of key object in HashSet.
Am i right?
As we know that HashSet is the wrapper on the HashMap to implement unique set i have below 2 questions
1. why HashSet does not support get() method like the HashMap?
2. Why HashSet is slower than HashMap?
What is the underlying implementation behind HASH SET & HASH MAP--- the same concept of key value pair, now how can HASH MAP is faster than HASH SET when conceptual implementation behind both collection is same?
1. Because HashSet does not implement Map interface and Set interface does not declare get() method.
And there is no key, that you can pass to get() method in case of a set (since all keys are values). If you need to check that specified key exists in the set just use contains() method.
2. It should not be slower, because HashMap does not allow duplicated keys as well. So, performance in worst case (when we need to call to hashcode() and equals() both) is same.
By the way, why I can not edit my comment here?
your articles are awesome..easy to understand.
Is there an article where you explain how hashset is implemented using a hashmap?
Also what is the internal working of hashmap, like it is a combination of array and linked list or what actually is a bucket, Map.Entry and all??
Can you please provide me the links to such articles?
1. When Hashset is just a wrapper which uses HashMap, How is it slower than HashMap?
2. When both classes do not have the same methods, how was this performance comparison done (Again add method of HashSet only delegates the call to a internal HashMap's put method)?
how hashmap works internally in java? could u please explain in detail
Post a Comment