public class HashMap<K,V> extends Map<K,V>
Constructor and Description |
---|
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<K,V> map)
Constructs a new
HashMap instance containing the mappings from the specified map. |
Modifier and Type | Method and Description |
---|---|
void |
clear()
Removes all mappings from this hash map, leaving it empty.
|
boolean |
containsKey(K key)
Returns whether this map contains the specified key.
|
boolean |
containsValue(V value)
Returns whether this map contains the specified value.
|
Set<MapEntry<K,V>> |
entrySet()
Returns a set containing all of the mappings in this map.
|
V |
get(K 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(K key,
V 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(K 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.
|
public HashMap()
HashMap
instance.public HashMap(int capacity)
HashMap
instance with the specified capacity.capacity
- the initial capacity of this hash map.ProgrammerError
- when the capacity is less than zero.public HashMap(int capacity, float loadFactor)
HashMap
instance with the specified capacity and load factor.capacity
- the initial capacity of this hash map.loadFactor
- the initial load factor.ProgrammerError
- when the capacity is less than zero or the load factor is less or equal to zeropublic HashMap(Map<K,V> map)
HashMap
instance containing the mappings from the specified map.
Changes from the java.util version: The constructor there supported covariance, taking a Map<? extends K, ?
extends V> argument where the keys & values can be subclasses of E and V. This constructor only allows maps
of exact type K and V, but you can call the putAll method instead if really need to copy a map with subtypes.map
- the mappings to add.public void clear()
public boolean containsKey(K key)
containsKey
in class Map<K,V>
key
- the key to search for.true
if this map contains the specified key, false
otherwise.public boolean containsValue(V value)
containsValue
in class Map<K,V>
value
- the value to search for.true
if this map contains the specified value, false
otherwise.public Set<MapEntry<K,V>> entrySet()
MapEntry
. As the
set is backed by this map, changes in one will be reflected in the other.public boolean isEmpty()
public Set<K> keySet()
public void putAll(Map<? extends K,? extends V> map)
public int size()
public Collection<V> values()
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.