@com.github.javaparser.ast.expr.MarkerAnnotationExprThreadSafe public class StampedCommonCache extends Object
Represents a simple key-value cache, which is thread safe and backed by a Map instance. StampedCommonCache has better performance than ConcurrentCommonCache, but it is not reentrant, in other words, it may cause deadlock if getAndPut(Object, MemoizeCache.ValueProvider) or getAndPut(Object, MemoizeCache.ValueProvider, boolean) is called recursively: readlock -> upgrade to writelock -> readlock (fails to get and waits forever)
 -  type of the keys -  type of the values| Constructor and description | 
|---|
                                StampedCommonCache
                                ()Constructs a cache with unlimited size  | 
                        
                                StampedCommonCache
                                (int initialCapacity, int maxSize, EvictionStrategy evictionStrategy)Constructs a cache with limited size  | 
                        
                                StampedCommonCache
                                (int initialCapacity, int maxSize)Constructs a LRU cache with the specified initial capacity and max size.  | 
                        
                                StampedCommonCache
                                (int maxSize)Constructs a LRU cache with the default initial capacity(16)  | 
                        
                                StampedCommonCache
                                (Map<K, V> map)Constructs a cache backed by the specified Map instance  | 
                        
| Type Params | Return Type | Name and description | 
|---|---|---|
 | 
                            void | 
                            cleanUpNullReferences(){@inheritDoc}  | 
                        
 | 
                            Map<K, V> | 
                            clearAll(){@inheritDoc}  | 
                        
 | 
                            boolean | 
                            containsKey(Object key){@inheritDoc}  | 
                        
 | 
                            boolean | 
                            containsValue(Object value) | 
                        
 | 
                            Object | 
                            convertValue(V value){@inheritDoc}  | 
                        
 | 
                            Set<Entry<K, V>> | 
                            entrySet() | 
                        
 | 
                            V | 
                            get(Object key){@inheritDoc}  | 
                        
 | 
                            V | 
                            getAndPut(K key, ValueProvider<? super K, ? extends V> valueProvider){@inheritDoc}  | 
                        
 | 
                            V | 
                            getAndPut(K key, ValueProvider<? super K, ? extends V> valueProvider, boolean shouldCache) | 
                        
 | 
                            boolean | 
                            isEmpty() | 
                        
 | 
                            Set<K> | 
                            keySet() | 
                        
 | 
                            Set<K> | 
                            keys(){@inheritDoc}  | 
                        
 | 
                            V | 
                            put(K key, V value){@inheritDoc}  | 
                        
 | 
                            void | 
                            putAll(Map<? extends K, ? extends V> m) | 
                        
 | 
                            V | 
                            remove(Object key){@inheritDoc}  | 
                        
 | 
                            int | 
                            size(){@inheritDoc}  | 
                        
 | 
                            Collection<V> | 
                            values(){@inheritDoc}  | 
                        
Constructs a cache with unlimited size
Constructs a cache with limited size
initialCapacity -   initial capacity of the cachemaxSize -           max size of the cacheevictionStrategy -  LRU or FIFO, see EvictableCache.EvictionStrategyConstructs a LRU cache with the specified initial capacity and max size. The LRU cache is slower than LRUCache
initialCapacity -  initial capacity of the LRU cachemaxSize -          max size of the LRU cacheConstructs a LRU cache with the default initial capacity(16)
maxSize -  max size of the LRU cache{@inheritDoc}
{@inheritDoc}
{@inheritDoc}
{@inheritDoc}
{@inheritDoc}
{@inheritDoc}
{@inheritDoc}
{@inheritDoc}
{@inheritDoc}
{@inheritDoc}
{@inheritDoc}
Copyright © 2003-2020 The Apache Software Foundation. All rights reserved.