HashMap and Hashtable both implements Map interface and used to store data in key and value pairs. Both use hashing techniques to get unique keys.
Apart from some similarities, there are many differences between HashMap and Hashtable classes as follows:
| java.util.HashMap | java.util.HashTable |
| HashMap class introduced in JDK 1.2. | Hashtable is a legacy class. |
| HashMap inherits AbstractMap class. | Hashtable inherits Dictionary class. |
| HashMap is traversed by Iterator. | Hashtable is traversed by the Enumerator and Iterator. |
| Hashmap, Iterator is fail-fast. | Hashtable, Enumerator is not fail-fast. |
| HashMap is not synchronized and not-thread safe. | Hashtable is synchronized and thread safe. |
| HashMap can be synchronized by calling this code Map m = Collections.synchronizedMap(hashMap); |
Hashtable is internally synchronized and can’t be unsynchronized. |
| HashMap class allows only one null key and multiple null values. | Hashtable doesn’t allow any null key or value. |
| HashMap is fast. | Hashtable is slow. |
For more detail:
- Java: HashMap Class methods and Examples
- Java: How HashMap Work?
- Java: Hashtable Class methods and Examples
- Java: Difference between HashMap and Hashtable
Facing Issues On IT 