Hashtable (Java SE 25 & JDK 25)
- Type Parameters:
K- the type of keys maintained by this mapV- the type of mapped values
- All Implemented Interfaces:
Serializable, Cloneable, Map<K,V>
- Direct Known Subclasses:
Properties, UIDefaults
-
Constructor Summary
Constructors
Constructs a new, empty hashtable with a default initial capacity (11) and load factor (0.75).
Hashtable(int initialCapacity) Constructs a new, empty hashtable with the specified initial capacity and default load factor (0.75).
Hashtable(int initialCapacity, float loadFactor) Constructs a new, empty hashtable with the specified initial capacity and the specified load factor.
Hashtable(Map<? extends K, ? extends V> t) Constructs a new hashtable with the same mappings as the given Map.
-
Method Summary
voidclear()Clears this hashtable so that it contains no keys.
clone()Creates a shallow copy of this hashtable.
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
nullif there is no current mapping (optional operation).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 unlessnull(optional operation).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 (optional operation).
booleanTests if some key maps into the specified value in this hashtable.
booleanTests if the specified object is a key in this hashtable.
booleanReturns true if this hashtable maps one or more keys to this value.
elements()Returns an enumeration of the values in this hashtable.
entrySet()Returns a
Setview of the mappings contained in this map.booleanCompares the specified Object with this Map for equality, as per the definition in the Map interface.
Returns the value to which the specified key is mapped, or
nullif this map contains no mapping for the key.inthashCode()Returns the hash code value for this Map as per the definition in the Map interface.
booleanisEmpty()Tests if this hashtable maps no keys to values.
keys()Returns an enumeration of the keys in this hashtable.
keySet()Returns a
Setview of the keys contained in this map.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 (optional operation).
Maps the specified
keyto the specifiedvaluein this hashtable.voidputAll(Map<? extends K, ? extends V> t) Copies all of the mappings from the specified map to this hashtable.
protected voidrehash()Increases the capacity of and internally reorganizes this hashtable, in order to accommodate and access its entries more efficiently.
Removes the key (and its corresponding value) from this hashtable.
intsize()Returns the number of keys in this hashtable.
toString()Returns a string representation of this
Hashtableobject in the form of a set of entries, enclosed in braces and separated by the ASCII characters "," (comma and space).values()Returns a
Collectionview of the values contained in this map.
-
Constructor Details
-
Hashtable
-
Hashtable
-
Hashtable
-
Hashtable
-
-
Method Details
-
size
-
isEmpty
-
keys
-
elements
-
contains
-
containsValue
-
containsKey
-
get
-
rehash
-
put
-
remove
-
putAll
-
clear
-
clone
-
toString
-
keySet
-
entrySet
-
values
-
equals
-
hashCode
-
computeIfAbsent
-
computeIfPresent
-
compute
-
merge
-