The
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.
RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4