Java Hashtable Class
Java.util package provides a Hashtable class which implements hash table and maps keys to value. 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. If many entries are to be made into a Hashtable, creating it with a sufficiently large capacity may allow the entries to be inserted more efficiently than letting it perform automatic rehashing as needed to grow the table.
The declaration of java.util.Hashtable class is:
public class Hashtable<K,V> extends Dictionary<K,V> implements Map<K,V>, Cloneable, Serializable
Here, K and V are the type of key and value respectively maintained by the container.
|S.N||Constructors & Description|
Creates an empty Hashtable with a default initial capacity (11) and load factor (0.75).
Creates an empty Hashtable with the specified initial capacity and default load factor (0.75).
Hashtable(int initialCapacity, float loadFactor)|
Creates an empty Hashtable with the specified initial capacity and the specified load factor.
Hashtable(Map<? extends K,? extends V> t)|
Creates a new Hashtable with the same mappings as the given Map.
The java.util.Hashtable class has a number of methods which are listed below:
|S.N||Methods & Description|
Clears the hashtable so that it contains no keys.
Creates a shallow copy of this hashtable.
V compute(K key, BiFunction<? super K,? super V,? extends V> remappingFunction)|
Attempts to compute a mapping for the specified key and its current mapped value (or null if there is no current mapping).
V computeIfAbsent(K key, Function<? super K,? extends V> mappingFunction)|
If the specified key is not already associated with a value (or is mapped to null), attempts to compute its value using the given mapping function and enters it into this map unless null.
V computeIfPresent(K key, BiFunction<? super K,? super V,? extends V> remappingFunction)|
If the value for the specified key is present and non-null, attempts to compute a new mapping given the key and its current mapped value.
boolean contains(Object value)|
Returns true if some key maps into the specified value in this hashtable.
boolean containsKey(Object key)|
Returns true if the specified object is a key in this hashtable.
boolean containsValue(Object value)|
Returns true if this hashtable maps one or more keys to this value.
Returns an enumeration of the values in this hashtable.
Returns a Set view of the mappings contained in this map.
boolean equals(Object obj)|
Compares the specified Object with this Map for equality, as per the definition in the Map interface.
void forEach(BiConsumer<? super K,? super V> action)|
Performs the given action for each entry in this map until all entries have been processed or the action throws an exception.
V get(Object key)|
Returns the value to which the specified key is mapped, or null if this map contains no mapping for the key.
V getOrDefault(Object key, V defaultValue)|
Returns the value to which the specified key is mapped, or defaultValue if this map contains no mapping for the key.
Returns the hash code value for this Map as per the definition in the Map interface.
Checks whether the hashtable maps no keys to values.
Returns an enumeration of the keys in this hashtable.
Returns a Set view of the keys contained in this map.
V merge(K key, V value, BiFunction<? super V,? super V,? extends V> remappingFunction)|
If the specified key is not already associated with a value or is associated with null, associates it with the given non-null value.
V put(K key, V value)|
Maps the specified key to the specified value in the hashtable.
void putAll(Map<? extends K,? extends V> t)|
Copies all of the mappings from the specified map to this hashtable.
V putIfAbsent(K key, V value)|
If the specified key is not already associated with a value (or is mapped to null) associates it with the given value and returns null, else returns the current value.
protected void rehash()|
Increases the capacity of and internally reorganizes this hashtable, in order to accommodate and access its entries more efficiently.
V remove(Object key)|
Removes the key (and its corresponding value) from this hashtable.
boolean remove(Object key, Object value)|
Removes the entry for the specified key only if it is currently mapped to the specified value.
V replace(K key, V value)|
Replaces the entry for the specified key only if it is currently mapped to some value.
boolean replace(K key, V oldValue, V newValue)|
Replaces the entry for the specified key only if currently mapped to the specified value.
void replaceAll(BiFunction<? super K,? super V,? extends V> function)|
Replaces each entry's value with the result of invoking the given function on that entry until all entries have been processed or the function throws an exception.
Returns the number of keys in the hashtable.
Returns a string representation of this Hashtable object in the form of a set of entries, enclosed in braces and separated by ", " (comma and space).
Returns a Collection view of the values contained in this hashtable.
This class inherits the methods of following class: