Class FastHashMap
- java.lang.Object
-
- java.util.AbstractMap<K,V>
-
- java.util.HashMap
-
- org.apache.commons.collections.FastHashMap
-
- All Implemented Interfaces:
Serializable
,Cloneable
,Map
public class FastHashMap extends HashMap
A customized implementation of
java.util.HashMap
designed to operate in a multithreaded environment where the large majority of method calls are read-only, instead of structural changes. When operating in "fast" mode, read calls are non-synchronized and write calls perform the following steps:- Clone the existing collection
- Perform the modification on the clone
- Replace the existing collection with the (modified) clone
When first created, objects of this class default to "slow" mode, where all accesses of any type are synchronized but no cloning takes place. This is appropriate for initially populating the collection, followed by a switch to "fast" mode (by calling
setFast(true)
) after initialization is complete.NOTE: If you are creating and accessing a
HashMap
only within a single thread, you should usejava.util.HashMap
directly (with no synchronization), for maximum performance.NOTE: This class is not cross-platform. Using it may cause unexpected failures on some architectures. It suffers from the same problems as the double-checked locking idiom. In particular, the instruction that clones the internal collection and the instruction that sets the internal reference to the clone can be executed or perceived out-of-order. This means that any read operation might fail unexpectedly, as it may be reading the state of the internal collection before the internal collection is fully formed. For more information on the double-checked locking idiom, see the Double-Checked Locking Idiom Is Broken Declaration.
- Since:
- Commons Collections 1.0
- Version:
- $Revision: 646777 $ $Date: 2008-04-10 14:33:15 +0200 (Thu, 10 Apr 2008) $
- Author:
- Craig R. McClanahan, Stephen Colebourne
- See Also:
- Serialized Form
-
-
Nested Class Summary
-
Nested classes/interfaces inherited from class java.util.AbstractMap
AbstractMap.SimpleEntry<K extends Object,V extends Object>, AbstractMap.SimpleImmutableEntry<K extends Object,V extends Object>
-
-
Constructor Summary
Constructors Constructor Description FastHashMap()
Construct an empty map.FastHashMap(int capacity)
Construct an empty map with the specified capacity.FastHashMap(int capacity, float factor)
Construct an empty map with the specified capacity and load factor.FastHashMap(Map map)
Construct a new map with the same mappings as the specified map.
-
Method Summary
All Methods Instance Methods Concrete Methods Modifier and Type Method Description void
clear()
Remove all mappings from this map.Object
clone()
Return a shallow copy of thisFastHashMap
instance.boolean
containsKey(Object key)
Returntrue
if this map contains a mapping for the specified key.boolean
containsValue(Object value)
Returntrue
if this map contains one or more keys mapping to the specified value.Set
entrySet()
Return a collection view of the mappings contained in this map.boolean
equals(Object o)
Compare the specified object with this list for equality.Object
get(Object key)
Return the value to which this map maps the specified key.boolean
getFast()
Returns true if this map is operating in fast mode.int
hashCode()
Return the hash code value for this map.boolean
isEmpty()
Returntrue
if this map contains no mappings.Set
keySet()
Return a set view of the keys contained in this map.Object
put(Object key, Object value)
Associate the specified value with the specified key in this map.void
putAll(Map in)
Copy all of the mappings from the specified map to this one, replacing any mappings with the same keys.Object
remove(Object key)
Remove any mapping for this key, and return any previously mapped value.void
setFast(boolean fast)
Sets whether this map is operating in fast mode.int
size()
Return the number of key-value mappings in this map.Collection
values()
Return a collection view of the values contained in this map.-
Methods inherited from class java.util.HashMap
compute, computeIfAbsent, computeIfPresent, forEach, getOrDefault, merge, putIfAbsent, remove, replace, replace, replaceAll
-
Methods inherited from class java.util.AbstractMap
toString
-
-
-
-
Field Detail
-
map
protected HashMap map
The underlying map we are managing.
-
fast
protected boolean fast
Are we currently operating in "fast" mode?
-
-
Constructor Detail
-
FastHashMap
public FastHashMap()
Construct an empty map.
-
FastHashMap
public FastHashMap(int capacity)
Construct an empty map with the specified capacity.- Parameters:
capacity
- the initial capacity of the empty map
-
FastHashMap
public FastHashMap(int capacity, float factor)
Construct an empty map with the specified capacity and load factor.- Parameters:
capacity
- the initial capacity of the empty mapfactor
- the load factor of the new map
-
FastHashMap
public FastHashMap(Map map)
Construct a new map with the same mappings as the specified map.- Parameters:
map
- the map whose mappings are to be copied
-
-
Method Detail
-
getFast
public boolean getFast()
Returns true if this map is operating in fast mode.- Returns:
- true if this map is operating in fast mode
-
setFast
public void setFast(boolean fast)
Sets whether this map is operating in fast mode.- Parameters:
fast
- true if this map should operate in fast mode
-
get
public Object get(Object key)
Return the value to which this map maps the specified key. Returnsnull
if the map contains no mapping for this key, or if there is a mapping with a value ofnull
. Use thecontainsKey()
method to disambiguate these cases.
-
size
public int size()
Return the number of key-value mappings in this map.
-
isEmpty
public boolean isEmpty()
Returntrue
if this map contains no mappings.
-
containsKey
public boolean containsKey(Object key)
Returntrue
if this map contains a mapping for the specified key.- Specified by:
containsKey
in interfaceMap
- Overrides:
containsKey
in classHashMap
- Parameters:
key
- the key to be searched for- Returns:
- true if the map contains the key
-
containsValue
public boolean containsValue(Object value)
Returntrue
if this map contains one or more keys mapping to the specified value.- Specified by:
containsValue
in interfaceMap
- Overrides:
containsValue
in classHashMap
- Parameters:
value
- the value to be searched for- Returns:
- true if the map contains the value
-
put
public Object put(Object key, Object value)
Associate the specified value with the specified key in this map. If the map previously contained a mapping for this key, the old value is replaced and returned.
-
putAll
public void putAll(Map in)
Copy all of the mappings from the specified map to this one, replacing any mappings with the same keys.
-
remove
public Object remove(Object key)
Remove any mapping for this key, and return any previously mapped value.
-
clear
public void clear()
Remove all mappings from this map.
-
equals
public boolean equals(Object o)
Compare the specified object with this list for equality. This implementation uses exactly the code that is used to define the list equals function in the documentation for theMap.equals
method.- Specified by:
equals
in interfaceMap
- Overrides:
equals
in classAbstractMap
- Parameters:
o
- the object to be compared to this list- Returns:
- true if the two maps are equal
-
hashCode
public int hashCode()
Return the hash code value for this map. This implementation uses exactly the code that is used to define the list hash function in the documentation for theMap.hashCode
method.- Specified by:
hashCode
in interfaceMap
- Overrides:
hashCode
in classAbstractMap
- Returns:
- suitable integer hash code
-
clone
public Object clone()
Return a shallow copy of thisFastHashMap
instance. The keys and values themselves are not copied.
-
entrySet
public Set entrySet()
Return a collection view of the mappings contained in this map. Each element in the returned collection is aMap.Entry
.
-
keySet
public Set keySet()
Return a set view of the keys contained in this map.
-
values
public Collection values()
Return a collection view of the values contained in this map.
-
-