Dictionary class is the abstract parent of any class, such as Hashtable, which maps keys to values.
More...
#include <java_util_Dictionary.h>
Inheritance diagram for java::util::Dictionary:


Public Types | |
| enum | { xmogDefaultFlags = xmog_base::GLOBAL, xmogMajorVersion = 3, xmogMinorVersion = 2, xmogPatchVersion = 9, xmogBuildNumber = 2047 } |
|
typedef ::xmog_java_array_template< ::java::util::Dictionary > | array1D |
|
typedef ::xmog_java_array_template< ::xmog_java_array_template< ::java::util::Dictionary > > | array2D |
Public Member Functions | |
| Dictionary (::xmog_dummy _use_java_ctor,::xmog_localenv *p_xenv=NULL, xmog_flags f_xflags=xmogDefaultFlags) | |
| Sole constructor. | |
| virtual ::java::util::Enumeration | elements (::xmog_localenv *p_xenv=NULL, xmog_flags f_xflags=xmogDefaultFlags) |
| Returns an enumeration of the values in this dictionary. | |
| virtual ::java::lang::Object | get (const ::java::lang::Object &key,::xmog_localenv *p_xenv=NULL, xmog_flags f_xflags=xmogDefaultFlags) |
| Returns the value to which the key is mapped in this dictionary. | |
| virtual bool | isEmpty (::xmog_localenv *p_xenv=NULL, xmog_flags f_xflags=xmogDefaultFlags) |
| Tests if this dictionary maps no keys to value. | |
| virtual ::java::util::Enumeration | keys (::xmog_localenv *p_xenv=NULL, xmog_flags f_xflags=xmogDefaultFlags) |
| Returns an enumeration of the keys in this dictionary. | |
| virtual ::java::lang::Object | put (const ::java::lang::Object &key, const ::java::lang::Object &value,::xmog_localenv *p_xenv=NULL, xmog_flags f_xflags=xmogDefaultFlags) |
Maps the specified key to the specified value in this dictionary. | |
| virtual ::java::lang::Object | remove (const ::java::lang::Object &key,::xmog_localenv *p_xenv=NULL, xmog_flags f_xflags=xmogDefaultFlags) |
Removes the key (and its corresponding value) from this dictionary. | |
| virtual jint | size (::xmog_localenv *p_xenv=NULL, xmog_flags f_xflags=xmogDefaultFlags) |
| Returns the number of entries (dinstint keys) in this dictionary. | |
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.
|
||||||||||||||||
|
Sole constructor. (For invocation by subclass constructors, typically implicit.)
|
|
||||||||||||
|
Returns an enumeration of the values in this dictionary.
The general contract for the
Reimplemented in java::util::Hashtable. |
|
||||||||||||||||
|
Returns the value to which the key is mapped in this dictionary.
The general contract for the
Reimplemented in java::util::Hashtable. |
|
||||||||||||
|
Tests if this dictionary maps no keys to value.
The general contract for the
Reimplemented in java::util::Hashtable. |
|
||||||||||||
|
Returns an enumeration of the keys in this dictionary.
The general contract for the keys method is that an
Reimplemented in java::util::Hashtable. |
|
||||||||||||||||||||
|
Maps the specified
Neither the key nor the value can be
If this dictionary already contains an entry for the specified
If this dictionary does not already have an entry for the specified
The
Reimplemented in java::util::Hashtable. |
|
||||||||||||||||
|
Removes the
This method does nothing if the
Reimplemented in java::util::Hashtable. |
|
||||||||||||
|
Returns the number of entries (dinstint keys) in this dictionary.
Reimplemented in java::util::Hashtable. |
1.4.1