K - the type of keysV - the type of mapped valuesHashtablepublic abstract class Dictionary<K,V> extends Object
Dictionary class is the abstract parent of any class, such as Hashtable, which maps keys to values. Every key and every value is an object. In any one Dictionary object, every key is associated with at most one value. Given a Dictionary and a key, the associated element can be looked up. Any non-null object can be used as a key and as a value.  As a rule, the equals method should be used by implementations of this class to decide if two keys are the same. 
NOTE: This class is obsolete. New implementations should implement the Map interface, rather than extending this class.
| Constructor | Description | 
|---|---|
| Dictionary() | Sole constructor. | 
| Modifier and Type | Method | Description | 
|---|---|---|
| abstract Enumeration | elements() | Returns an enumeration of the values in this dictionary. | 
| abstract V | get | Returns the value to which the key is mapped in this dictionary. | 
| abstract boolean | isEmpty() | Tests if this dictionary maps no keys to value. | 
| abstract Enumeration | keys() | Returns an enumeration of the keys in this dictionary. | 
| abstract V | put | Maps the specified  keyto the specifiedvaluein this dictionary. | 
| abstract V | remove | Removes the  key(and its correspondingvalue) from this dictionary. | 
| abstract int | size() | Returns the number of entries (distinct keys) in this dictionary. | 
public Dictionary()
public abstract int size()
public abstract boolean isEmpty()
isEmpty method is that the result is true if and only if this dictionary contains no entries.true if this dictionary maps no keys to values; false otherwise.public abstract Enumeration<K> keys()
Enumeration object is returned that will generate all the keys for which this dictionary contains entries.public abstract Enumeration<V> elements()
elements method is that an Enumeration is returned that will generate all the elements contained in entries in this dictionary.public abstract V get(Object key)
isEmpty method is that if this dictionary contains an entry for the specified key, the associated value is returned; otherwise, null is returned.key - a key in this dictionary. null if the key is not mapped to any value in this dictionary.NullPointerException - if the key is null.public abstract V put(K key, V value)
key to the specified value in this dictionary. Neither the key nor the value can be null.  If this dictionary already contains an entry for the specified key, the value already in this dictionary for that key is returned, after modifying the entry to contain the new element. 
If this dictionary does not already have an entry for the specified key, an entry is created for the specified key and value, and null is returned. 
 The value can be retrieved by calling the get method with a key that is equal to the original key.
key - the hashtable key.value - the value.key was mapped in this dictionary, or null if the key did not have a previous mapping.NullPointerException - if the key or value is null.public abstract V remove(Object key)
key (and its corresponding value) from this dictionary. This method does nothing if the key is not in this dictionary.key - the key that needs to be removed.key had been mapped in this dictionary, or null if the key did not have a mapping.NullPointerException - if key is null.
    © 1993, 2023, Oracle and/or its affiliates. All rights reserved.
Documentation extracted from Debian's OpenJDK Development Kit package.
Licensed under the GNU General Public License, version 2, with the Classpath Exception.
Various third party code in OpenJDK is licensed under different licenses (see Debian package).
Java and OpenJDK are trademarks or registered trademarks of Oracle and/or its affiliates.
    https://docs.oracle.com/en/java/javase/21/docs/api/java.base/java/util/Dictionary.html