Map interface, to minimize the effort required to implement this interface.
More...
#include <java_util_AbstractMap.h>
Inheritance diagram for java::util::AbstractMap:


Public Types | |
| enum | { xmogDefaultFlags = xmog_base::GLOBAL, xmogMajorVersion = 3, xmogMinorVersion = 2, xmogPatchVersion = 9, xmogBuildNumber = 2047 } |
|
typedef ::xmog_java_array_template< ::java::util::AbstractMap > | array1D |
|
typedef ::xmog_java_array_template< ::xmog_java_array_template< ::java::util::AbstractMap > > | array2D |
Public Member Functions | |
| AbstractMap (::xmog_dummy _use_java_ctor,::xmog_localenv *p_xenv=NULL, xmog_flags f_xflags=xmogDefaultFlags) | |
| Sole constructor. | |
| virtual void | clear (::xmog_localenv *p_xenv=NULL, xmog_flags f_xflags=xmogDefaultFlags) |
| Removes all mappings from this map (optional operation). | |
| virtual bool | containsKey (const ::java::lang::Object &key,::xmog_localenv *p_xenv=NULL, xmog_flags f_xflags=xmogDefaultFlags) |
Returns true if this map contains a mapping for the specified key. | |
| virtual bool | containsValue (const ::java::lang::Object &value,::xmog_localenv *p_xenv=NULL, xmog_flags f_xflags=xmogDefaultFlags) |
Returns true if this map maps one or more keys to this value. | |
| virtual ::java::util::Set | entrySet (::xmog_localenv *p_xenv=NULL, xmog_flags f_xflags=xmogDefaultFlags) |
| Returns a set view of the mappings contained in this map. | |
| virtual bool | equals (const ::java::lang::Object &o,::xmog_localenv *p_xenv=NULL, xmog_flags f_xflags=xmogDefaultFlags) |
| Compares the specified object with this map for equality. | |
| 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 this map maps the specified key. | |
| virtual jint | hashCode (::xmog_localenv *p_xenv=NULL, xmog_flags f_xflags=xmogDefaultFlags) |
| Returns the hash code value for this map. | |
| virtual bool | isEmpty (::xmog_localenv *p_xenv=NULL, xmog_flags f_xflags=xmogDefaultFlags) |
Returns true if this map contains no key-value mappings. | |
| virtual ::java::util::Set | keySet (::xmog_localenv *p_xenv=NULL, xmog_flags f_xflags=xmogDefaultFlags) |
| Returns a Set view of the keys contained in this map. | |
| 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) |
| Associates the specified value with the specified key in this map (optional operation). | |
| virtual void | putAll (const ::java::util::Map &t,::xmog_localenv *p_xenv=NULL, xmog_flags f_xflags=xmogDefaultFlags) |
| Copies all of the mappings from the specified map to this map (optional operation). | |
| virtual ::java::lang::Object | remove (const ::java::lang::Object &key,::xmog_localenv *p_xenv=NULL, xmog_flags f_xflags=xmogDefaultFlags) |
| Removes the mapping for this key from this map if present (optional operation). | |
| virtual jint | size (::xmog_localenv *p_xenv=NULL, xmog_flags f_xflags=xmogDefaultFlags) |
| Returns the number of key-value mappings in this map. | |
| virtual ::java::lang::String | toString (::xmog_localenv *p_xenv=NULL, xmog_flags f_xflags=xmogDefaultFlags) |
| Returns a string representation of this map. | |
| virtual ::java::util::Collection | values (::xmog_localenv *p_xenv=NULL, xmog_flags f_xflags=xmogDefaultFlags) |
| Returns a collection view of the values contained in this map. | |
Map interface, to minimize the effort required to implement this interface.
To implement an unmodifiable map, the programmer needs only to extend this class and provide an implementation for the entrySet method, which returns a set-view of the map's mappings. Typically, the returned set will, in turn, be implemented atop AbstractSet. This set should not support the add or remove methods, and its iterator should not support the remove method.
To implement a modifiable map, the programmer must additionally override this class's put method (which otherwise throws an UnsupportedOperationException), and the iterator returned by entrySet().iterator() must additionally implement its remove method.
The programmer should generally provide a void (no argument) and map constructor, as per the recommendation in the Map interface specification.
The documentation for each non-abstract methods in this class describes its implementation in detail. Each of these methods may be overridden if the map being implemented admits a more efficient implementation.
This class is a member of the Java Collections Framework.
|
||||||||||||||||
|
Sole constructor. (For invocation by subclass constructors, typically implicit.)
|
|
||||||||||||
|
Removes all mappings from this map (optional operation).
This implementation calls
Note that this implementation throws an
Reimplemented from java::util::Map. Reimplemented in java::util::HashMap. |
|
||||||||||||||||
|
Returns
This implementation iterates over
Reimplemented from java::util::Map. Reimplemented in java::util::HashMap. |
|
||||||||||||||||
|
Returns
More formally, returns
This implementation iterates over entrySet() searching for an entry with the specified value. If such an entry is found,
Reimplemented from java::util::Map. Reimplemented in java::util::HashMap. |
|
||||||||||||
|
Returns a set view of the mappings contained in this map.
Each element in this set is a Map.Entry. The set is backed by the map, so changes to the map are reflected in the set, and vice-versa. (If the map is modified while an iteration over the set is in progress, the results of the iteration are undefined.) The set supports element removal, which removes the corresponding entry from the map, via the
Reimplemented from java::util::Map. Reimplemented in java::util::HashMap. |
|
||||||||||||||||
|
Compares the specified object with this map for equality.
Returns
This implementation first checks if the specified object is this map; if so it returns
Reimplemented from java::util::Map. Reimplemented in java::util::HashMap. |
|
||||||||||||||||
|
Returns the value to which this map maps the specified key.
Returns
This implementation iterates over
Reimplemented from java::util::Map. Reimplemented in java::util::HashMap. |
|
||||||||||||
|
Returns the hash code value for this map.
The hash code of a map is defined to be the sum of the hash codes of each entry in the map's
This implementation iterates over
Reimplemented from java::util::Map. Reimplemented in java::util::HashMap. |
|
||||||||||||
|
Returns
This implementation returns
Reimplemented from java::util::Map. Reimplemented in java::util::HashMap. |
|
||||||||||||
|
Returns a Set view of the keys contained in this map. The Set is backed by the map, so changes to the map are reflected in the Set, and vice-versa. (If the map is modified while an iteration over the Set is in progress, the results of the iteration are undefined.) The Set supports element removal, which removes the corresponding entry from the map, via the Iterator.remove, Set.remove, removeAll retainAll, and clear operations. It does not support the add or addAll operations. This implementation returns a Set that subclasses AbstractSet. The subclass's iterator method returns a "wrapper object" over this map's entrySet() iterator. The size method delegates to this map's size method and the contains method delegates to this map's containsKey method. The Set is created the first time this method is called, and returned in response to all subsequent calls. No synchronization is performed, so there is a slight chance that multiple calls to this method will not all return the same Set.
Reimplemented from java::util::Map. Reimplemented in java::util::HashMap. |
|
||||||||||||||||||||
|
Associates the specified value with the specified key in this map (optional operation). If the map previously contained a mapping for this key, the old value is replaced.
This implementation always throws an
Reimplemented from java::util::Map. Reimplemented in java::util::HashMap. |
|
||||||||||||||||
|
Copies all of the mappings from the specified map to this map (optional operation). These mappings will replace any mappings that this map had for any of the keys currently in the specified map.
This implementation iterates over the specified map's
Note that this implementation throws an
Reimplemented from java::util::Map. Reimplemented in java::util::HashMap. |
|
||||||||||||||||
|
Removes the mapping for this key from this map if present (optional operation).
This implementation iterates over
Note that this implementation throws an
Reimplemented from java::util::Map. Reimplemented in java::util::HashMap. |
|
||||||||||||
|
Returns the number of key-value mappings in this map.
If the map contains more than
This implementation returns
Reimplemented from java::util::Map. Reimplemented in java::util::HashMap. |
|
||||||||||||
|
Returns a string representation of this map.
The string representation consists of a list of key-value mappings in the order returned by the map's
This implementation creates an empty string buffer, appends a left brace, and iterates over the map's
Reimplemented from java::lang::Object. Reimplemented in java::util::HashMap. |
|
||||||||||||
|
Returns a collection view of the values contained in this map.
The collection is backed by the map, so changes to the map are reflected in the collection, and vice-versa. (If the map is modified while an iteration over the collection is in progress, the results of the iteration are undefined.) The collection supports element removal, which removes the corresponding entry from the map, via the
This implementation returns a collection that subclasses abstract collection. The subclass's iterator method returns a "wrapper object" over this map's The collection is created the first time this method is called, and returned in response to all subsequent calls. No synchronization is performed, so there is a slight chance that multiple calls to this method will not all return the same Collection.
Reimplemented from java::util::Map. Reimplemented in java::util::HashMap. |
1.4.1