is new.
Type Parameters:
K - the type of keys maintained by this map
V - the type of mapped values
Subinterfaces:
ConcurrentMap
<K,V>,
ConcurrentNavigableMap
<K,V>,
NavigableMap
<K,V>,
SortedMap
<K,V>
All Known Implementing Classes:
AbstractMap
,
Attributes
,
AuthProvider
,
ConcurrentHashMap
,
ConcurrentSkipListMap
,
EnumMap
,
HashMap
,
Hashtable
,
IdentityHashMap
,
LinkedHashMap
,
PrinterStateReasons
,
Properties
,
Provider
,
RenderingHints
,
TreeMap
,
UIDefaults
,
WeakHashMap
public interface Map<K,V>
An object that maps keys to values. A map cannot contain duplicate keys; each key can map to at most one value.
This interface takes the place of the Dictionary class, which was a totally abstract class rather than an interface.
The Map interface provides three collection views , which allow a map's contents to be viewed as a set of keys, collection of values, or set of key-value mappings. The order of a map is defined as the order in which the iterators on the map's collection views return their elements. Some map implementations, like the TreeMap class, make specific guarantees as to their order; others, like the HashMap class, do not.
Note: great care must be exercised if mutable objects are used as map keys. The behavior of a map is not specified if the value of an object is changed in a manner that affects
equals
comparisons while the object is a key in the map. A special case of this prohibition is that it is not permissible for a map to contain itself as a key. While it is permissible for a map to contain itself as a value, extreme caution is advised: the
equals
and
hashCode
methods are no longer well defined on
a
such a map.
All general-purpose map implementation classes should provide two "standard" constructors: a void (no arguments) constructor which creates an empty map, and a constructor with a single argument of type Map , which creates a new map with the same key-value mappings as its argument. In effect, the latter constructor allows the user to copy any map, producing an equivalent map of the desired class. There is no way to enforce this recommendation (as interfaces cannot contain constructors) but all of the general-purpose map implementations in the JDK comply.
The "destructive" methods contained in this interface, that is, the methods that modify the map on which they operate, are specified to throw UnsupportedOperationException if this map does not support the operation. If this is the case, these methods may, but are not required to, throw an UnsupportedOperationException if the invocation would have no effect on the map. For example, invoking the putAll(Map) method on an unmodifiable map may, but is not required to, throw the exception if the map whose mappings are to be "superimposed" is empty.
Some map implementations have restrictions on the keys and values they may contain. For example, some implementations prohibit null keys and values, and some have restrictions on the types of their keys. Attempting to insert an ineligible key or value throws an unchecked exception, typically NullPointerException or ClassCastException . Attempting to query the presence of an ineligible key or value may throw an exception, or it may simply return false; some implementations will exhibit the former behavior and some will exhibit the latter. More generally, attempting an operation on an ineligible key or value whose completion would not result in the insertion of an ineligible element into the map may throw an exception or it may succeed, at the option of the implementation. Such exceptions are marked as "optional" in the specification for this interface.
This interface is a member of the Java Collections Framework .
Many methods in Collections Framework interfaces are defined in terms of the
equals
method. For example, the specification for the
containsKey(Object key)
contains(Object key)
method says: "returns
true
if and only if this map
contains
contain
a mapping for a key
k
such that
(key==null ? k==null : key.equals(k))
." This specification should
not
be construed to imply that invoking
Map.containsKey
with a non-null argument
key
will cause
key.equals(k)
to be invoked for any key
k
. Implementations are free to implement optimizations whereby the
equals
invocation is avoided, for example, by first comparing the hash codes of the two keys. (The
Object.hashCode()
specification guarantees that two objects with unequal hash codes cannot be equal.) More generally, implementations of the various Collections Framework interfaces are free to take advantage of the specified behavior of underlying
Object
methods wherever the implementor deems it appropriate.
| Nested Class Summary | |
|---|---|
| static interface |
Map.Entry
<
K
,
V
>
A map entry (key-value pair). |
| Method Summary | |
|---|---|
| void |
clear
() Removes all
of the
mappings from this map (optional operation). |
| boolean |
containsKey
(
Object
key) Returns true if this map contains a mapping for the specified key. |
| boolean |
containsValue
(
Object
value) Returns true if this map maps one or more keys to the specified value. |
| Set < Map.Entry < K , V |
entrySet
() Returns a
Set
|
| boolean |
equals
(
Object
o) Compares the specified object with this map for equality. |
| V |
get
(
Object
Returns the value to which
the specified key is mapped, or null if
this map
contains no mapping for
|
| int |
hashCode
() Returns the hash code value for this map. |
| boolean |
isEmpty
() Returns true if this map contains no key-value mappings. |
| Set < K |
keySet
() Returns a
Set
|
| V |
put
(
K
key,
V
value) Associates the specified value with the specified key in this map (optional operation). |
| void |
putAll
(
Map
<? extends
K
,? extends
V
Copies all of the mappings from the specified map to this map (optional operation). |
| V |
remove
(
Object
Removes the mapping for
a
|
| int |
size
() Returns the number of key-value mappings in this map. |
| Collection < V |
values
() Returns a
Collection
|
| Method Detail |
|---|
int size()
map
boolean isEmpty()
mappings
boolean containsKey(Object key)
tested
key
(optional)
specified
key is
null
and this map does not permit
null
keys
(optional)
boolean containsValue(Object value)
tested
value
(optional)
specified
value is
null
and this map does not permit
null
values
(optional)
V get(Object key)
Returns the value to which the specified key is mapped, or null if this map contains no mapping for the key.
More formally, if this map contains a mapping from a key k to a value v such that (key==null ? k==null : key.equals(k)), then this method returns v; otherwise it returns null. (There can be at most one such mapping.)
If this map permits null values, then a return value of null does not
Returns the value to which this map maps the specified key. Returns
null
if the map contains no mapping for this key. A return value of
null
does not
necessarily
indicate that the map contains no mapping for the key; it's also possible that the map explicitly maps the key to
null.
null
.
The
containsKey
containsKey
operation may be used to distinguish these two cases.
More formally, if this map contains a mapping from a key
k
to a value
v
such that
(key==null ? k==null : key.equals(k))
, then this method returns
v
; otherwise it returns
null
. (There can be at most one such mapping.)
the
key whose associated value is to be
returned
key is mapped,
this
the key
(optional)
specified
key is
null
and this map does not permit
null
keys
(optional)
V put(K key,
V value)
the
.)
associated
key
the
previous value associated with
key
, or
null
if there was no mapping for
key
. (A
null
return can also indicate that the map previously associated
null
with
key
, if the implementation supports
null
values.)
map
map
NullPointerException
- if the specified key or value is null and this map does not permit null keys or values
IllegalArgumentException
- if some property of the specified key or value prevents it from being stored in this map
V remove(Object key)
a
Returns the value to which
this
the
map previously associated the key, or
null
if the map contained no mapping for
the
this
key.
If this map permits null values, then a return value of
(A
null
does not
necessarily
indicate that the map contained no mapping for the key; it's also possible that the map explicitly mapped the key to
return can also indicate that the map previously associated
null
.
with the specified key if the implementation supports
null
values.) The map will not contain a mapping for the specified key once the call returns.
The map will not contain a mapping for the specified key once the call returns.
map
the
previous value associated with
key
, or
if there was no mapping for
key
.
Throws:
operation is not supported by this map
ClassCastException
- if the key is of an inappropriate type for this map (optional)
NullPointerException
- if the specified key is null and this map does not permit null keys (optional)
void putAll(Map<? extends K,? extends V> m)
> t)
undefined
m
mappings
map
operation
map
map
NullPointerException
- if the specified map is null, or if this map does not permit null keys or values, and the specified map contains null keys or values
IllegalArgumentException
- if some property of a key or value in the specified map prevents it from being stored in this map
void clear()
of the
mappings from this map (optional operation).
The map will be empty after this call returns.
if the
clear
operation
is not supported by this
map
Set<K> keySet()
Set
,
retainAll
, and
clear
operations. It does not support the
add
or
addAll
operations.
map
Collection<V> values()
Collection
add
or
addAll
operations.
map
Set<Map.Entry<K,V>> entrySet()
Returns a
Set
view of the mappings contained in this map.
map
boolean equals(Object o)
maps
m1
m2
m1.entrySet().equals(m2.entrySet())
map
map
int hashCode()
hash codes
entrySet()
m1.equals(m2)
m1.hashCode()==m2.hashCode()
m1
m2
Object.hashCode()
.
map