This class implements a hash table, which maps keys to values.
Hash table is basically a data structure which holds some information along with its reference number. Java - The Hashtable Class Hashtable was part of the original java.util and is a concrete implementation of a Dictionary.
Any non- null object can be used as a key or as a value. To successfully store and retrieve objects from a hashtable, the objects used as keys must implement the hashCode method and the equals method.
Hashtable in Java. However, Java 2 re-engineered Hashtable so that it also implements the Map interface. Hash table is implemented in an array which works in such a way that the information is stored inside the array in the index number provided. h.put( 3 , "Geeks" ); h.put( 2 , "forGeeks" ); h.put( 1 , "isBest" ); // create a clone or shallow copy of hash table h. h1 = (Hashtable
)h.clone(); // checking clone h1. Java Hashtable class implements a hashtable, which maps keys to values.
It inherits Dictionary class and implements the Map interface. Thus, Hashtable is now integrated into the collections framework.