Uses of Interface
com.google.common.cache.ReferenceEntry
Packages that use ReferenceEntry
-
Uses of ReferenceEntry in com.google.common.cache
Classes in com.google.common.cache that implement ReferenceEntryModifier and TypeClassDescription(package private) static class
private static enum
(package private) static final class
(package private) static final class
(package private) static class
Used for strongly-referenced keys.(package private) static final class
(package private) static final class
(package private) static final class
(package private) static class
LocalCache.WeakEntry<K,
V> Used for weakly-referenced keys.(package private) static final class
Fields in com.google.common.cache declared as ReferenceEntryModifier and TypeFieldDescription(package private) final ReferenceEntry
<K, V> LocalCache.SoftValueReference.entry
(package private) final ReferenceEntry
<K, V> LocalCache.WeakValueReference.entry
(package private) final ReferenceEntry
<K, V> LocalCache.AccessQueue.head
(package private) final ReferenceEntry
<K, V> LocalCache.WriteQueue.head
(package private) final ReferenceEntry
<K, V> LocalCache.StrongEntry.next
(package private) final ReferenceEntry
<K, V> LocalCache.WeakEntry.next
(package private) ReferenceEntry
<K, V> LocalCache.StrongAccessEntry.nextAccess
(package private) ReferenceEntry
<K, V> LocalCache.StrongAccessWriteEntry.nextAccess
(package private) ReferenceEntry
<K, V> LocalCache.WeakAccessEntry.nextAccess
(package private) ReferenceEntry
<K, V> LocalCache.WeakAccessWriteEntry.nextAccess
(package private) ReferenceEntry
<K, V> LocalCache.HashIterator.nextEntry
(package private) ReferenceEntry
<K, V> LocalCache.StrongAccessWriteEntry.nextWrite
(package private) ReferenceEntry
<K, V> LocalCache.StrongWriteEntry.nextWrite
(package private) ReferenceEntry
<K, V> LocalCache.WeakAccessWriteEntry.nextWrite
(package private) ReferenceEntry
<K, V> LocalCache.WeakWriteEntry.nextWrite
(package private) ReferenceEntry
<K, V> LocalCache.StrongAccessEntry.previousAccess
(package private) ReferenceEntry
<K, V> LocalCache.StrongAccessWriteEntry.previousAccess
(package private) ReferenceEntry
<K, V> LocalCache.WeakAccessEntry.previousAccess
(package private) ReferenceEntry
<K, V> LocalCache.WeakAccessWriteEntry.previousAccess
(package private) ReferenceEntry
<K, V> LocalCache.StrongAccessWriteEntry.previousWrite
(package private) ReferenceEntry
<K, V> LocalCache.StrongWriteEntry.previousWrite
(package private) ReferenceEntry
<K, V> LocalCache.WeakAccessWriteEntry.previousWrite
(package private) ReferenceEntry
<K, V> LocalCache.WeakWriteEntry.previousWrite
Fields in com.google.common.cache with type parameters of type ReferenceEntryModifier and TypeFieldDescription(package private) final Queue
<ReferenceEntry<K, V>> LocalCache.Segment.accessQueue
A queue of elements currently in the map, ordered by access time.(package private) AtomicReferenceArray
<ReferenceEntry<K, V>> LocalCache.HashIterator.currentTable
(package private) final Queue
<ReferenceEntry<K, V>> LocalCache.Segment.recencyQueue
The recency queue is used to record which entries were accessed for updating the access list's ordering.(package private) AtomicReferenceArray
<ReferenceEntry<K, V>> LocalCache.Segment.table
The per-segment table.(package private) final Queue
<ReferenceEntry<K, V>> LocalCache.Segment.writeQueue
A queue of elements currently in the map, ordered by write time.Methods in com.google.common.cache that return ReferenceEntryModifier and TypeMethodDescription(package private) ReferenceEntry
<K, V> LocalCache.copyEntry
(ReferenceEntry<K, V> original, ReferenceEntry<K, V> newNext) This method is a convenience for testing.(package private) <K,
V> ReferenceEntry <K, V> LocalCache.EntryFactory.copyEntry
(LocalCache.Segment<K, V> segment, ReferenceEntry<K, V> original, ReferenceEntry<K, V> newNext, K key) Copies an entry, assigning it a newnext
entry.(package private) ReferenceEntry
<K, V> LocalCache.Segment.copyEntry
(ReferenceEntry<K, V> original, ReferenceEntry<K, V> newNext) Copiesoriginal
into a new entry chained tonewNext
.(package private) ReferenceEntry
<K, V> Returns the internal entry for the specified key.LocalCache.LoadingValueReference.getEntry()
(package private) ReferenceEntry
<K, V> LocalCache.SoftValueReference.getEntry()
LocalCache.StrongValueReference.getEntry()
LocalCache.ValueReference.getEntry()
Returns the entry associated with this value reference, ornull
if this value reference is independent of any entry.LocalCache.WeakValueReference.getEntry()
(package private) ReferenceEntry
<K, V> LocalCache.Segment.getFirst
(int hash) Returns first entry of bin for given hash.(package private) ReferenceEntry
<K, V> LocalCache.Segment.getLiveEntry
(Object key, int hash, long now) LocalCache.AbstractReferenceEntry.getNext()
LocalCache.NullEntry.getNext()
LocalCache.StrongEntry.getNext()
LocalCache.WeakEntry.getNext()
ReferenceEntry.getNext()
Returns the next entry in the chain.(package private) ReferenceEntry
<K, V> LocalCache.Segment.getNextEvictable()
LocalCache.AbstractReferenceEntry.getNextInAccessQueue()
LocalCache.NullEntry.getNextInAccessQueue()
LocalCache.StrongAccessEntry.getNextInAccessQueue()
LocalCache.StrongAccessWriteEntry.getNextInAccessQueue()
LocalCache.WeakAccessEntry.getNextInAccessQueue()
LocalCache.WeakAccessWriteEntry.getNextInAccessQueue()
LocalCache.WeakEntry.getNextInAccessQueue()
ReferenceEntry.getNextInAccessQueue()
Returns the next entry in the access queue.LocalCache.AbstractReferenceEntry.getNextInWriteQueue()
LocalCache.NullEntry.getNextInWriteQueue()
LocalCache.StrongAccessWriteEntry.getNextInWriteQueue()
LocalCache.StrongWriteEntry.getNextInWriteQueue()
LocalCache.WeakAccessWriteEntry.getNextInWriteQueue()
LocalCache.WeakEntry.getNextInWriteQueue()
LocalCache.WeakWriteEntry.getNextInWriteQueue()
ReferenceEntry.getNextInWriteQueue()
Returns the next entry in the write queue.LocalCache.AbstractReferenceEntry.getPreviousInAccessQueue()
LocalCache.NullEntry.getPreviousInAccessQueue()
LocalCache.StrongAccessEntry.getPreviousInAccessQueue()
LocalCache.StrongAccessWriteEntry.getPreviousInAccessQueue()
LocalCache.WeakAccessEntry.getPreviousInAccessQueue()
LocalCache.WeakAccessWriteEntry.getPreviousInAccessQueue()
LocalCache.WeakEntry.getPreviousInAccessQueue()
ReferenceEntry.getPreviousInAccessQueue()
Returns the previous entry in the access queue.LocalCache.AbstractReferenceEntry.getPreviousInWriteQueue()
LocalCache.NullEntry.getPreviousInWriteQueue()
LocalCache.StrongAccessWriteEntry.getPreviousInWriteQueue()
LocalCache.StrongWriteEntry.getPreviousInWriteQueue()
LocalCache.WeakAccessWriteEntry.getPreviousInWriteQueue()
LocalCache.WeakEntry.getPreviousInWriteQueue()
LocalCache.WeakWriteEntry.getPreviousInWriteQueue()
ReferenceEntry.getPreviousInWriteQueue()
Returns the previous entry in the write queue.(package private) abstract <K,
V> ReferenceEntry <K, V> LocalCache.EntryFactory.newEntry
(LocalCache.Segment<K, V> segment, K key, int hash, ReferenceEntry<K, V> next) Creates a new entry.(package private) ReferenceEntry
<K, V> LocalCache.newEntry
(K key, int hash, ReferenceEntry<K, V> next) This method is a convenience for testing.(package private) ReferenceEntry
<K, V> LocalCache.Segment.newEntry
(K key, int hash, ReferenceEntry<K, V> next) (package private) static <K,
V> ReferenceEntry <K, V> LocalCache.nullEntry()
LocalCache.AccessQueue.peek()
LocalCache.WriteQueue.peek()
LocalCache.AccessQueue.poll()
LocalCache.WriteQueue.poll()
(package private) ReferenceEntry
<K, V> LocalCache.Segment.removeEntryFromChain
(ReferenceEntry<K, V> first, ReferenceEntry<K, V> entry) (package private) ReferenceEntry
<K, V> LocalCache.Segment.removeValueFromChain
(ReferenceEntry<K, V> first, ReferenceEntry<K, V> entry, K key, int hash, V value, LocalCache.ValueReference<K, V> valueReference, RemovalCause cause) Methods in com.google.common.cache that return types with arguments of type ReferenceEntryModifier and TypeMethodDescriptionLocalCache.AccessQueue.iterator()
LocalCache.WriteQueue.iterator()
(package private) AtomicReferenceArray
<ReferenceEntry<K, V>> LocalCache.Segment.newEntryArray
(int size) Methods in com.google.common.cache with parameters of type ReferenceEntryModifier and TypeMethodDescription(package private) boolean
LocalCache.HashIterator.advanceTo
(ReferenceEntry<K, V> entry) Advances to the given entry.(package private) static <K,
V> void LocalCache.connectAccessOrder
(ReferenceEntry<K, V> previous, ReferenceEntry<K, V> next) (package private) static <K,
V> void LocalCache.connectWriteOrder
(ReferenceEntry<K, V> previous, ReferenceEntry<K, V> next) (package private) <K,
V> void LocalCache.EntryFactory.copyAccessEntry
(ReferenceEntry<K, V> original, ReferenceEntry<K, V> newEntry) (package private) ReferenceEntry
<K, V> LocalCache.copyEntry
(ReferenceEntry<K, V> original, ReferenceEntry<K, V> newNext) This method is a convenience for testing.(package private) <K,
V> ReferenceEntry <K, V> LocalCache.EntryFactory.copyEntry
(LocalCache.Segment<K, V> segment, ReferenceEntry<K, V> original, ReferenceEntry<K, V> newNext, K key) Copies an entry, assigning it a newnext
entry.(package private) ReferenceEntry
<K, V> LocalCache.Segment.copyEntry
(ReferenceEntry<K, V> original, ReferenceEntry<K, V> newNext) Copiesoriginal
into a new entry chained tonewNext
.LocalCache.LoadingValueReference.copyFor
(ReferenceQueue<V> queue, V value, ReferenceEntry<K, V> entry) LocalCache.SoftValueReference.copyFor
(ReferenceQueue<V> queue, V value, ReferenceEntry<K, V> entry) LocalCache.StrongValueReference.copyFor
(ReferenceQueue<V> queue, V value, ReferenceEntry<K, V> entry) LocalCache.ValueReference.copyFor
(ReferenceQueue<V> queue, V value, ReferenceEntry<K, V> entry) Creates a copy of this reference for the given entry.LocalCache.WeakValueReference.copyFor
(ReferenceQueue<V> queue, V value, ReferenceEntry<K, V> entry) LocalCache.WeightedSoftValueReference.copyFor
(ReferenceQueue<V> queue, V value, ReferenceEntry<K, V> entry) LocalCache.WeightedWeakValueReference.copyFor
(ReferenceQueue<V> queue, V value, ReferenceEntry<K, V> entry) (package private) <K,
V> void LocalCache.EntryFactory.copyWriteEntry
(ReferenceEntry<K, V> original, ReferenceEntry<K, V> newEntry) (package private) void
LocalCache.Segment.evictEntries
(ReferenceEntry<K, V> newest) Performs eviction if the segment is over capacity.(package private) V
LocalCache.getLiveValue
(ReferenceEntry<K, V> entry, long now) Gets the value from an entry.(package private) V
LocalCache.Segment.getLiveValue
(ReferenceEntry<K, V> entry, long now) Gets the value from an entry.(package private) boolean
LocalCache.isExpired
(ReferenceEntry<K, V> entry, long now) Returns true if the entry has expired.(package private) boolean
LocalCache.isLive
(ReferenceEntry<K, V> entry, long now) This method is a convenience for testing.(package private) abstract <K,
V> ReferenceEntry <K, V> LocalCache.EntryFactory.newEntry
(LocalCache.Segment<K, V> segment, K key, int hash, ReferenceEntry<K, V> next) Creates a new entry.(package private) ReferenceEntry
<K, V> LocalCache.newEntry
(K key, int hash, ReferenceEntry<K, V> next) This method is a convenience for testing.(package private) ReferenceEntry
<K, V> LocalCache.Segment.newEntry
(K key, int hash, ReferenceEntry<K, V> next) (package private) LocalCache.ValueReference
<K, V> LocalCache.newValueReference
(ReferenceEntry<K, V> entry, V value, int weight) This method is a convenience for testing.(package private) static <K,
V> void LocalCache.nullifyAccessOrder
(ReferenceEntry<K, V> nulled) (package private) static <K,
V> void LocalCache.nullifyWriteOrder
(ReferenceEntry<K, V> nulled) boolean
LocalCache.AccessQueue.offer
(ReferenceEntry<K, V> entry) boolean
LocalCache.WriteQueue.offer
(ReferenceEntry<K, V> entry) (package private) void
LocalCache.reclaimKey
(ReferenceEntry<K, V> entry) (package private) boolean
LocalCache.Segment.reclaimKey
(ReferenceEntry<K, V> entry, int hash) Removes an entry whose key has been garbage collected.(package private) void
LocalCache.Segment.recordLockedRead
(ReferenceEntry<K, V> entry, long now) Updates the eviction metadata thatentry
was just read.(package private) void
LocalCache.Segment.recordRead
(ReferenceEntry<K, V> entry, long now) Records the relative order in which this read was performed by addingentry
to the recency queue.(package private) void
LocalCache.Segment.recordWrite
(ReferenceEntry<K, V> entry, int weight, long now) Updates eviction metadata thatentry
was just written.(package private) abstract <K,
V> LocalCache.ValueReference <K, V> LocalCache.Strength.referenceValue
(LocalCache.Segment<K, V> segment, ReferenceEntry<K, V> entry, V value, int weight) Creates a reference for the given value according to this value strength.(package private) void
LocalCache.Segment.removeCollectedEntry
(ReferenceEntry<K, V> entry) (package private) boolean
LocalCache.Segment.removeEntry
(ReferenceEntry<K, V> entry, int hash, RemovalCause cause) (package private) ReferenceEntry
<K, V> LocalCache.Segment.removeEntryFromChain
(ReferenceEntry<K, V> first, ReferenceEntry<K, V> entry) (package private) ReferenceEntry
<K, V> LocalCache.Segment.removeValueFromChain
(ReferenceEntry<K, V> first, ReferenceEntry<K, V> entry, K key, int hash, V value, LocalCache.ValueReference<K, V> valueReference, RemovalCause cause) (package private) V
LocalCache.Segment.scheduleRefresh
(ReferenceEntry<K, V> entry, K key, int hash, V oldValue, long now, CacheLoader<? super K, V> loader) void
LocalCache.AbstractReferenceEntry.setNextInAccessQueue
(ReferenceEntry<K, V> next) void
LocalCache.NullEntry.setNextInAccessQueue
(ReferenceEntry<Object, Object> next) void
LocalCache.StrongAccessEntry.setNextInAccessQueue
(ReferenceEntry<K, V> next) void
LocalCache.StrongAccessWriteEntry.setNextInAccessQueue
(ReferenceEntry<K, V> next) void
LocalCache.WeakAccessEntry.setNextInAccessQueue
(ReferenceEntry<K, V> next) void
LocalCache.WeakAccessWriteEntry.setNextInAccessQueue
(ReferenceEntry<K, V> next) void
LocalCache.WeakEntry.setNextInAccessQueue
(ReferenceEntry<K, V> next) void
ReferenceEntry.setNextInAccessQueue
(ReferenceEntry<K, V> next) Sets the next entry in the access queue.void
LocalCache.AbstractReferenceEntry.setNextInWriteQueue
(ReferenceEntry<K, V> next) void
LocalCache.NullEntry.setNextInWriteQueue
(ReferenceEntry<Object, Object> next) void
LocalCache.StrongAccessWriteEntry.setNextInWriteQueue
(ReferenceEntry<K, V> next) void
LocalCache.StrongWriteEntry.setNextInWriteQueue
(ReferenceEntry<K, V> next) void
LocalCache.WeakAccessWriteEntry.setNextInWriteQueue
(ReferenceEntry<K, V> next) void
LocalCache.WeakEntry.setNextInWriteQueue
(ReferenceEntry<K, V> next) void
LocalCache.WeakWriteEntry.setNextInWriteQueue
(ReferenceEntry<K, V> next) void
ReferenceEntry.setNextInWriteQueue
(ReferenceEntry<K, V> next) Sets the next entry in the write queue.void
LocalCache.AbstractReferenceEntry.setPreviousInAccessQueue
(ReferenceEntry<K, V> previous) void
LocalCache.NullEntry.setPreviousInAccessQueue
(ReferenceEntry<Object, Object> previous) void
LocalCache.StrongAccessEntry.setPreviousInAccessQueue
(ReferenceEntry<K, V> previous) void
LocalCache.StrongAccessWriteEntry.setPreviousInAccessQueue
(ReferenceEntry<K, V> previous) void
LocalCache.WeakAccessEntry.setPreviousInAccessQueue
(ReferenceEntry<K, V> previous) void
LocalCache.WeakAccessWriteEntry.setPreviousInAccessQueue
(ReferenceEntry<K, V> previous) void
LocalCache.WeakEntry.setPreviousInAccessQueue
(ReferenceEntry<K, V> previous) void
ReferenceEntry.setPreviousInAccessQueue
(ReferenceEntry<K, V> previous) Sets the previous entry in the access queue.void
LocalCache.AbstractReferenceEntry.setPreviousInWriteQueue
(ReferenceEntry<K, V> previous) void
LocalCache.NullEntry.setPreviousInWriteQueue
(ReferenceEntry<Object, Object> previous) void
LocalCache.StrongAccessWriteEntry.setPreviousInWriteQueue
(ReferenceEntry<K, V> previous) void
LocalCache.StrongWriteEntry.setPreviousInWriteQueue
(ReferenceEntry<K, V> previous) void
LocalCache.WeakAccessWriteEntry.setPreviousInWriteQueue
(ReferenceEntry<K, V> previous) void
LocalCache.WeakEntry.setPreviousInWriteQueue
(ReferenceEntry<K, V> previous) void
LocalCache.WeakWriteEntry.setPreviousInWriteQueue
(ReferenceEntry<K, V> previous) void
ReferenceEntry.setPreviousInWriteQueue
(ReferenceEntry<K, V> previous) Sets the previous entry in the write queue.(package private) void
Sets a new value of an entry.(package private) V
LocalCache.Segment.waitForLoadingValue
(ReferenceEntry<K, V> e, K key, LocalCache.ValueReference<K, V> valueReference) Method parameters in com.google.common.cache with type arguments of type ReferenceEntryModifier and TypeMethodDescription(package private) void
LocalCache.Segment.initTable
(AtomicReferenceArray<ReferenceEntry<K, V>> newTable) Constructors in com.google.common.cache with parameters of type ReferenceEntryModifierConstructorDescription(package private)
SoftValueReference
(ReferenceQueue<V> queue, V referent, ReferenceEntry<K, V> entry) (package private)
StrongAccessEntry
(K key, int hash, ReferenceEntry<K, V> next) (package private)
StrongAccessWriteEntry
(K key, int hash, ReferenceEntry<K, V> next) (package private)
StrongEntry
(K key, int hash, ReferenceEntry<K, V> next) (package private)
StrongWriteEntry
(K key, int hash, ReferenceEntry<K, V> next) (package private)
WeakAccessEntry
(ReferenceQueue<K> queue, K key, int hash, ReferenceEntry<K, V> next) (package private)
WeakAccessWriteEntry
(ReferenceQueue<K> queue, K key, int hash, ReferenceEntry<K, V> next) (package private)
WeakEntry
(ReferenceQueue<K> queue, K key, int hash, ReferenceEntry<K, V> next) (package private)
WeakValueReference
(ReferenceQueue<V> queue, V referent, ReferenceEntry<K, V> entry) (package private)
WeakWriteEntry
(ReferenceQueue<K> queue, K key, int hash, ReferenceEntry<K, V> next) (package private)
WeightedSoftValueReference
(ReferenceQueue<V> queue, V referent, ReferenceEntry<K, V> entry, int weight) (package private)
WeightedWeakValueReference
(ReferenceQueue<V> queue, V referent, ReferenceEntry<K, V> entry, int weight)