H A D | LocalCache.java | 83 * The concurrent hash map implementation built by {@link CacheBuilder}. 96 * concurrently readable hash table. The map supports non-blocking reads and concurrent writes 158 * Mask value for indexing into segments. The upper bits of a key's hash code are used to choose 169 /** The segments, each of which is a specialized hash table. */ 427 * Returns the default equivalence strategy used to compare and hash keys or values referenced 441 Segment<K, V> segment, K key, int hash, @Nullable ReferenceEntry<K, V> next) { 442 return new StrongEntry<K, V>(key, hash, next); 448 Segment<K, V> segment, K key, int hash, @Nullable ReferenceEntry<K, V> next) { 449 return new StrongAccessEntry<K, V>(key, hash, next); 463 Segment<K, V> segment, K key, int hash, 577 newEntry( Segment<K, V> segment, K key, int hash, @Nullable ReferenceEntry<K, V> next) argument 1059 StrongEntry(K key, int hash, @Nullable ReferenceEntry<K, V> next) argument 1136 final int hash; field in class:LocalCache.StrongEntry 1163 StrongAccessEntry(K key, int hash, @Nullable ReferenceEntry<K, V> next) argument 1210 StrongWriteEntry(K key, int hash, @Nullable ReferenceEntry<K, V> next) argument 1257 StrongAccessWriteEntry(K key, int hash, @Nullable ReferenceEntry<K, V> next) argument 1346 WeakEntry(ReferenceQueue<K> queue, K key, int hash, @Nullable ReferenceEntry<K, V> next) argument 1423 final int hash; field in class:LocalCache.WeakEntry 1450 WeakAccessEntry( ReferenceQueue<K> queue, K key, int hash, @Nullable ReferenceEntry<K, V> next) argument 1498 WeakWriteEntry( ReferenceQueue<K> queue, K key, int hash, @Nullable ReferenceEntry<K, V> next) argument 1546 WeakAccessWriteEntry( ReferenceQueue<K> queue, K key, int hash, @Nullable ReferenceEntry<K, V> next) argument 1863 newEntry(K key, int hash, @Nullable ReferenceEntry<K, V> next) argument 1887 int hash(Object key) { method in class:LocalCache 1918 segmentFor(int hash) argument 2177 newEntry(K key, int hash, @Nullable ReferenceEntry<K, V> next) argument 2207 get(K key, int hash, CacheLoader<? super K, V> loader) argument 2242 lockedGetOrLoad(K key, int hash, CacheLoader<? super K, V> loader) argument 2348 loadSync(K key, int hash, LoadingValueReference<K, V> loadingValueReference, CacheLoader<? super K, V> loader) argument 2354 loadAsync(final K key, final int hash, final LoadingValueReference<K, V> loadingValueReference, CacheLoader<? super K, V> loader) argument 2377 getAndRecordStats(K key, int hash, LoadingValueReference<K, V> loadingValueReference, ListenableFuture<V> newValue) argument 2396 scheduleRefresh(ReferenceEntry<K, V> entry, K key, int hash, V oldValue, long now, CacheLoader<? super K, V> loader) argument 2414 refresh(K key, int hash, CacheLoader<? super K, V> loader) argument 2437 insertLoadingValueReference(final K key, final int hash) argument 2671 enqueueNotification(@ullable K key, int hash, ValueReference<K, V> valueReference, RemovalCause cause) argument 2717 getFirst(int hash) argument 2726 getEntry(Object key, int hash) argument 2747 getLiveEntry(Object key, int hash, long now) argument 2781 get(Object key, int hash) argument 2803 containsKey(Object key, int hash) argument 2851 put(K key, int hash, V value, boolean onlyIfAbsent) argument 2994 replace(K key, int hash, V oldValue, V newValue) argument 3047 replace(K key, int hash, V newValue) argument 3093 remove(Object key, int hash) argument 3138 storeLoadedValue(K key, int hash, LoadingValueReference<K, V> oldValueReference, V newValue) argument 3190 remove(Object key, int hash, Object value) argument 3267 removeValueFromChain(ReferenceEntry<K, V> first, ReferenceEntry<K, V> entry, @Nullable K key, int hash, ValueReference<K, V> valueReference, RemovalCause cause) argument 3310 reclaimKey(ReferenceEntry<K, V> entry, int hash) argument 3340 reclaimValue(K key, int hash, ValueReference<K, V> valueReference) argument 3375 removeLoadingValue(K key, int hash, LoadingValueReference<K, V> valueReference) argument 3408 removeEntry(ReferenceEntry<K, V> entry, int hash, RemovalCause cause) argument [all...] |