HashSet implementations

Question

As per the HashSet.java, the internal design of the HashSet uses HashMap

 public HashSet() {
        map = new HashMap<>();
    }

the java doc says

This class implements the Set interface, backed by a hash table (actually a HashMap instance).

Most of the books refer HashSet as "it is implemented by a hash table" by Java Generics

What is the reason for the strech of the HashTable ? Why not HashMap ?

"hash table` is not referring to the HashTable class. en.wikipedia.org/wiki/Hash_table — SLaks
– SLaks, Commented Feb 7, 2014 at 19:14

Joni · Accepted Answer · 2014-02-07 19:15:04Z

4

A hash table is an abstract data structure that can be implemented in many different ways. In the Java standard library, HashMap is one such implementation, and HashTable is another. The wording in the documentation refers to hash tables in the generic.

answered Feb 7, 2014 at 19:15

Joni

112k14 gold badges151 silver badges200 bronze badges

Sign up to request clarification or add additional context in comments.

Comments

Ove Sundberg · Accepted Answer · 2014-02-07 20:12:22Z

0

What they are trying to explain is that HashMap is a Java implementation of a general structure - the hash table. And that it implements the Set interface, which means that every entry is guaranteed to be unique

answered Feb 7, 2014 at 20:12

Ove Sundberg

3333 silver badges10 bronze badges

Collectives™ on Stack Overflow

HashSet implementations

2 Answers 2

Comments

Comments

Hot Network Questions

Collectives™ on Stack Overflow

2 Answers 2

Comments

Comments

Related