Package org.apache.cxf.common.util
Class CacheMap<K,V> 
java.lang.Object
org.apache.cxf.common.util.CacheMap<K,V> 
- All Implemented Interfaces:
- Map<K,- V> 
Implements a useful caching map. It weakly references the keys,
 but strongly references the data. It works much like the WeakHashMap,
 in that when the keys are garbage collected, the data is removed from
 the map.
 The main difference is that keys used for lookups don't have to be "=="
 the same to maintain the data in the cache.  Basically, lookups in this
 map use a ".equals" compare, but the keys are then stored with a "=="
 compare so if the original key is garbage collected, the other keys that
 may reference the data keep the data in the cache.
 
 Note that this implementation is not synchronized. Not even a little.
 'Read-only' operations can trigger internal modifications. If you share this
 class between threads, you must protect every operation.
 
- 
Nested Class Summary
- 
Constructor SummaryConstructors
- 
Method SummaryMethods inherited from class java.lang.Objectclone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, waitMethods inherited from interface java.util.Mapcompute, computeIfAbsent, computeIfPresent, equals, forEach, getOrDefault, hashCode, merge, putIfAbsent, remove, replace, replace, replaceAll
- 
Constructor Details- 
CacheMappublic CacheMap()
 
- 
- 
Method Details- 
clearpublic void clear()
- 
containsKey- Specified by:
- containsKeyin interface- Map<K,- V> 
 
- 
containsValue- Specified by:
- containsValuein interface- Map<K,- V> 
 
- 
entrySet
- 
get
- 
isEmptypublic boolean isEmpty()
- 
keySet
- 
put
- 
putAll
- 
remove
- 
sizepublic int size()
- 
values
- 
toString
 
-