public class HashedMap extends AbstractHashedMap implements java.io.Serializable, java.lang.Cloneable
Map
implementation that is a general purpose alternative
to HashMap
.
This implementation improves on the JDK1.4 HashMap by adding the
MapIterator
functionality and many methods for subclassing.
Note that HashedMap is not synchronized and is not thread-safe.
If you wish to use this map from multiple threads concurrently, you must use
appropriate synchronization. The simplest approach is to wrap this map
using Collections.synchronizedMap(Map)
. This class may throw
exceptions when accessed by concurrent threads without synchronization.
Constructor and Description |
---|
HashedMap()
Constructs a new empty map with default size and load factor.
|
HashedMap(int initialCapacity)
Constructs a new, empty map with the specified initial capacity.
|
HashedMap(int initialCapacity,
float loadFactor)
Constructs a new, empty map with the specified initial capacity and
load factor.
|
HashedMap(java.util.Map map)
Constructor copying elements from another map.
|
Modifier and Type | Method and Description |
---|---|
java.lang.Object |
clone()
Clones the map without cloning the keys or values.
|
clear, containsKey, containsValue, entrySet, equals, get, hashCode, isEmpty, keySet, mapIterator, put, putAll, remove, size, toString, values
public HashedMap()
public HashedMap(int initialCapacity)
initialCapacity
- the initial capacityjava.lang.IllegalArgumentException
- if the initial capacity is less than onepublic HashedMap(int initialCapacity, float loadFactor)
initialCapacity
- the initial capacityloadFactor
- the load factorjava.lang.IllegalArgumentException
- if the initial capacity is less than onejava.lang.IllegalArgumentException
- if the load factor is less than zeropublic HashedMap(java.util.Map map)
map
- the map to copyjava.lang.NullPointerException
- if the map is nullCopyright © 2010 - 2020 Adobe. All Rights Reserved