K
- the type of the keys in this mapV
- the type of the values in this mappublic class Flat3Map<K,V> extends Object implements IterableMap<K,V>, Serializable, Cloneable
Map
implementation that stores data in simple fields until
the size is greater than 3.
This map is designed for performance and can outstrip HashMap. It also has good garbage collection characteristics.
The design uses two distinct modes of operation - flat and delegate. While the map is size 3 or less, operations map straight onto fields using switch statements. Once size 4 is reached, the map switches to delegate mode and only switches back when cleared. In delegate mode, all operations are forwarded straight to a HashMap resulting in the 5% performance loss.
The performance gains on puts are due to not needing to create a Map Entry object. This is a large saving not only in performance but in garbage collection.
Whilst in flat mode this map is also easy for the garbage collector to dispatch. This is because it contains no complex objects or arrays which slow the progress.
Do not use Flat3Map
if the size is likely to grow beyond 3.
Note that Flat3Map 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 |
---|
Flat3Map()
Constructor.
|
Flat3Map(Map<? extends K,? extends V> map)
Constructor copying elements from another map.
|
Modifier and Type | Method and Description |
---|---|
void |
clear()
Clears the map, resetting the size to zero and nullifying references
to avoid garbage collection issues.
|
Flat3Map<K,V> |
clone()
Clones the map without cloning the keys or values.
|
boolean |
containsKey(Object key)
Checks whether the map contains the specified key.
|
boolean |
containsValue(Object value)
Checks whether the map contains the specified value.
|
protected AbstractHashedMap<K,V> |
createDelegateMap()
Create an instance of the map used for storage when in delegation mode.
|
Set<Map.Entry<K,V>> |
entrySet()
Gets the entrySet view of the map.
|
boolean |
equals(Object obj)
Compares this map with another.
|
V |
get(Object key)
Gets the value mapped to the key specified.
|
int |
hashCode()
Gets the standard Map hashCode.
|
boolean |
isEmpty()
Checks whether the map is currently empty.
|
Set<K> |
keySet()
Gets the keySet view of the map.
|
MapIterator<K,V> |
mapIterator()
Gets an iterator over the map.
|
V |
put(K key,
V value)
Puts a key-value mapping into this map.
|
void |
putAll(Map<? extends K,? extends V> map)
Puts all the values from the specified map into this map.
|
V |
remove(Object key)
Removes the specified mapping from this map.
|
int |
size()
Gets the size of the map.
|
String |
toString()
Gets the map as a String.
|
Collection<V> |
values()
Gets the values view of the map.
|
finalize, getClass, notify, notifyAll, wait, wait, wait
compute, computeIfAbsent, computeIfPresent, forEach, getOrDefault, merge, putIfAbsent, remove, replace, replace, replaceAll
public Flat3Map()
public Flat3Map(Map<? extends K,? extends V> map)
map
- the map to copyNullPointerException
- if the map is nullpublic int size()
public boolean isEmpty()
public boolean containsKey(Object key)
containsKey
in interface Map<K,V>
containsKey
in interface Get<K,V>
key
- the key to search forMap.containsKey(Object)
public boolean containsValue(Object value)
containsValue
in interface Map<K,V>
containsValue
in interface Get<K,V>
value
- the value to search forMap.containsValue(Object)
public void putAll(Map<? extends K,? extends V> map)
putAll
in interface Map<K,V>
putAll
in interface Put<K,V>
map
- the map to addNullPointerException
- if the map is nullMap.putAll(Map)
protected AbstractHashedMap<K,V> createDelegateMap()
This can be overridden by subclasses to provide a different map implementation. Not every AbstractHashedMap is suitable, identity and reference based maps would be poor choices.
public void clear()
public MapIterator<K,V> mapIterator()
A MapIterator returns the keys in the map. It also provides convenient methods to get the key and value, and set the value. It avoids the need to create an entrySet/keySet/values object. It also avoids creating the Map Entry object.
mapIterator
in interface IterableGet<K,V>
public Set<Map.Entry<K,V>> entrySet()
NOTE: from 4.0, the returned Map Entry will be an independent object and will
not change anymore as the iterator progresses. To avoid this additional object
creation and simply iterate through the entries, use mapIterator()
.
public Set<K> keySet()
mapIterator()
.public Collection<V> values()
mapIterator()
.public int hashCode()
Copyright © 2001–2019 The Apache Software Foundation. All rights reserved.