Class FastTreeMap
- All Implemented Interfaces:
Serializable
,Cloneable
,Map
,NavigableMap
,SortedMap
A customized implementation of java.util.TreeMap
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
TreeMap
only within a single thread, you should use
java.util.TreeMap
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:
-
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> -
Field Summary
Fields -
Constructor Summary
ConstructorsConstructorDescriptionConstruct a an empty map.FastTreeMap
(Comparator comparator) Construct an empty map with the specified comparator.FastTreeMap
(Map map) Construct a new map with the same mappings as the specified map, sorted according to the keys's natural orderFastTreeMap
(SortedMap map) Construct a new map with the same mappings as the specified map, sorted according to the same ordering -
Method Summary
Modifier and TypeMethodDescriptionvoid
clear()
Remove all mappings from this map.clone()
Return a shallow copy of thisFastTreeMap
instance.Return the comparator used to order this map, ornull
if this map uses its keys' natural order.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.entrySet()
Return a collection view of the mappings contained in this map.boolean
Compare the specified object with this list for equality.firstKey()
Return the first (lowest) key currently in this sorted map.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.Return a view of the portion of this map whose keys are strictly less than the specified key.boolean
isEmpty()
Returntrue
if this map contains no mappings.keySet()
Return a set view of the keys contained in this map.lastKey()
Return the last (highest) key currently in this sorted map.Associate the specified value with the specified key in this map.void
Copy all of the mappings from the specified map to this one, replacing any mappings with the same keys.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.Return a view of the portion of this map whose keys are in the range fromKey (inclusive) to toKey (exclusive).Return a view of the portion of this map whose keys are greater than or equal to the specified key.values()
Return a collection view of the values contained in this map.Methods inherited from class java.util.TreeMap
ceilingEntry, ceilingKey, compute, computeIfAbsent, computeIfPresent, descendingKeySet, descendingMap, firstEntry, floorEntry, floorKey, forEach, headMap, higherEntry, higherKey, lastEntry, lowerEntry, lowerKey, merge, navigableKeySet, pollFirstEntry, pollLastEntry, putIfAbsent, replace, replace, replaceAll, subMap, tailMap
Methods inherited from class java.util.AbstractMap
toString
Methods inherited from class java.lang.Object
finalize, getClass, notify, notifyAll, wait, wait, wait
Methods inherited from interface java.util.Map
getOrDefault, remove
-
Field Details
-
map
The underlying map we are managing. -
fast
protected boolean fastAre we operating in "fast" mode?
-
-
Constructor Details
-
FastTreeMap
public FastTreeMap()Construct a an empty map. -
FastTreeMap
Construct an empty map with the specified comparator.- Parameters:
comparator
- the comparator to use for ordering tree elements
-
FastTreeMap
Construct a new map with the same mappings as the specified map, sorted according to the keys's natural order- Parameters:
map
- the map whose mappings are to be copied
-
FastTreeMap
Construct a new map with the same mappings as the specified map, sorted according to the same ordering- Parameters:
map
- the map whose mappings are to be copied
-
-
Method Details
-
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
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.- Specified by:
isEmpty
in interfaceMap
- Overrides:
isEmpty
in classAbstractMap
- Returns:
- is the map currently empty
-
containsKey
Returntrue
if this map contains a mapping for the specified key.- Specified by:
containsKey
in interfaceMap
- Overrides:
containsKey
in classTreeMap
- Parameters:
key
- the key to be searched for- Returns:
- true if the map contains the key
-
containsValue
Returntrue
if this map contains one or more keys mapping to the specified value.- Specified by:
containsValue
in interfaceMap
- Overrides:
containsValue
in classTreeMap
- Parameters:
value
- the value to be searched for- Returns:
- true if the map contains the value
-
comparator
Return the comparator used to order this map, ornull
if this map uses its keys' natural order.- Specified by:
comparator
in interfaceSortedMap
- Overrides:
comparator
in classTreeMap
- Returns:
- the comparator used to order the map, or null if natural order
-
firstKey
Return the first (lowest) key currently in this sorted map. -
lastKey
Return the last (highest) key currently in this sorted map. -
put
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
Copy all of the mappings from the specified map to this one, replacing any mappings with the same keys. -
remove
Remove any mapping for this key, and return any previously mapped value. -
clear
public void clear()Remove all mappings from this map. -
equals
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:
- a suitable integer hash code
-
clone
Return a shallow copy of thisFastTreeMap
instance. The keys and values themselves are not copied. -
headMap
Return a view of the portion of this map whose keys are strictly less than the specified key. -
subMap
Return a view of the portion of this map whose keys are in the range fromKey (inclusive) to toKey (exclusive). -
tailMap
Return a view of the portion of this map whose keys are greater than or equal to the specified key. -
entrySet
Return a collection view of the mappings contained in this map. Each element in the returned collection is aMap.Entry
. -
keySet
Return a set view of the keys contained in this map. -
values
Return a collection view of the values contained in this map.
-