HashSet内部使用hashmap实现，那么为什么hashmap比hashset更快？

Question

HashSet internally uses hashmap for its implementation, then why is hashmap faster than hashset?

I tried reading the above mentioned post in search but was unable to find a clear answer

Answer 1

Because HashSet uses a HashMap. It must incur the cost of using a HashMap, plus the overhead of the HashSet itself.

Answer 2

in a HashMap you store element value pairs when in a Set you store only element.

When you call add(value) for Set actually you call put as well (for HashMap ).

Set backed by HashMap