java.lang.Object | ||
↳ | java.util.AbstractMap<K, V> | |
↳ | java.util.HashMap<K, V> |
![]()
LinkedHashMap<K, V>
|
HashMap is an implementation of Map. All optional operations (adding and removing) are supported. Keys and values can be any objects.
Public Constructors | |||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|
HashMap()
Constructs a new empty
HashMap instance. | |||||||||||
HashMap(int capacity)
Constructs a new
HashMap instance with the specified capacity. | |||||||||||
HashMap(int capacity, float loadFactor)
Constructs a new
HashMap instance with the specified capacity and
load factor. | |||||||||||
HashMap(Map<? extends K, ? extends V> map)
Constructs a new
HashMap instance containing the mappings from the
specified map. |
Public Methods | |||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|
void |
clear()
Removes all mappings from this hash map, leaving it empty.
| ||||||||||
boolean |
containsKey(Object key)
Returns whether this map contains the specified key.
| ||||||||||
boolean |
containsValue(Object value)
Returns whether this map contains the specified value.
| ||||||||||
Set<Entry<K, V>> |
entrySet()
Returns a set containing all of the mappings in this map.
| ||||||||||
V |
get(Object key)
Returns the value of the mapping with the specified key.
| ||||||||||
boolean |
isEmpty()
Returns whether this map is empty.
| ||||||||||
Set<K> |
keySet()
Returns a set of the keys contained in this map.
| ||||||||||
V |
put(Object key, Object value)
Maps the specified key to the specified value.
| ||||||||||
void |
putAll(Map<? extends K, ? extends V> map)
Copies all the mappings in the specified map to this map.
| ||||||||||
V |
remove(Object key)
Removes the mapping with the specified key from this map.
| ||||||||||
int |
size()
Returns the number of elements in this map.
| ||||||||||
Collection<V> |
values()
Returns a collection of the values contained in this map.
|
[Expand]
Inherited Methods | |||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|
![]() | |||||||||||
![]() | |||||||||||
![]() |
Constructs a new empty HashMap
instance.
Constructs a new HashMap
instance with the specified capacity.
capacity | the initial capacity of this hash map. |
---|
IllegalArgumentException | when the capacity is less than zero. |
---|
Constructs a new HashMap
instance with the specified capacity and
load factor.
capacity | the initial capacity of this hash map. |
---|---|
loadFactor | the initial load factor. |
IllegalArgumentException | when the capacity is less than zero or the load factor is less or equal to zero. |
---|
Constructs a new HashMap
instance containing the mappings from the
specified map.
map | the mappings to add. |
---|
Returns whether this map contains the specified key.
key | the key to search for. |
---|
true
if this map contains the specified key, false
otherwise.
Returns whether this map contains the specified value.
value | the value to search for. |
---|
true
if this map contains the specified value, false
otherwise.
Returns a set containing all of the mappings in this map. Each mapping is an
instance of Map.Entry
. As the set is backed by this map, changes in
one will be reflected in the other.
Returns the value of the mapping with the specified key.
key | the key. |
---|
null
if
no mapping for the specified key is found.
Returns whether this map is empty.
true
if this map has no elements, false
otherwise.Returns a set of the keys contained in this map. The set is backed by this map so changes to one are reflected by the other. The set does not support adding.
Maps the specified key to the specified value.
key | the key. |
---|---|
value | the value. |
null
if there was no such mapping.
Copies all the mappings in the specified map to this map. These mappings will replace all mappings that this map had for any of the keys currently in the given map.
map | the map to copy mappings from. |
---|
NullPointerException | if map is null .
|
---|
Removes the mapping with the specified key from this map.
key | the key of the mapping to remove. |
---|
null
if no mapping for
the specified key was found.
Returns the number of elements in this map.
Returns a collection of the values contained in this map. The collection is backed by this map so changes to one are reflected by the other. The collection supports remove, removeAll, retainAll and clear operations, and it does not support add or addAll operations.
This method returns a collection which is the subclass of AbstractCollection.
The iterator method of this subclass returns a "wrapper object" over the
iterator of map's entrySet(). The size
method wraps the map's size
method and the contains
method wraps the map's containsValue method.
The collection is created when this method is called for the first time and returned in response to all subsequent calls. This method may return different collections when multiple concurrent calls occur, since no synchronization is performed.