Package | Description |
---|---|
com.google.common.cache |
This package contains caching utilities.
|
Modifier and Type | Class and Description |
---|---|
(package private) static class |
LocalCache.AbstractReferenceEntry<K,V> |
private static class |
LocalCache.NullEntry |
(package private) static class |
LocalCache.StrongAccessEntry<K,V> |
(package private) static class |
LocalCache.StrongAccessWriteEntry<K,V> |
(package private) static class |
LocalCache.StrongEntry<K,V>
Used for strongly-referenced keys.
|
(package private) static class |
LocalCache.StrongWriteEntry<K,V> |
(package private) static class |
LocalCache.WeakAccessEntry<K,V> |
(package private) static class |
LocalCache.WeakAccessWriteEntry<K,V> |
(package private) static class |
LocalCache.WeakEntry<K,V>
Used for weakly-referenced keys.
|
(package private) static class |
LocalCache.WeakWriteEntry<K,V> |
Modifier and Type | Field and Description |
---|---|
(package private) LocalCache.ReferenceEntry<K,V> |
LocalCache.WeakValueReference.entry |
(package private) LocalCache.ReferenceEntry<K,V> |
LocalCache.SoftValueReference.entry |
(package private) LocalCache.ReferenceEntry<K,V> |
LocalCache.WriteQueue.head |
(package private) LocalCache.ReferenceEntry<K,V> |
LocalCache.AccessQueue.head |
(package private) LocalCache.ReferenceEntry<K,V> |
LocalCache.StrongEntry.next |
(package private) LocalCache.ReferenceEntry<K,V> |
LocalCache.WeakEntry.next |
(package private) LocalCache.ReferenceEntry<K,V> |
LocalCache.StrongAccessEntry.nextAccess |
(package private) LocalCache.ReferenceEntry<K,V> |
LocalCache.StrongAccessWriteEntry.nextAccess |
(package private) LocalCache.ReferenceEntry<K,V> |
LocalCache.WeakAccessEntry.nextAccess |
(package private) LocalCache.ReferenceEntry<K,V> |
LocalCache.WeakAccessWriteEntry.nextAccess |
(package private) LocalCache.ReferenceEntry<K,V> |
LocalCache.HashIterator.nextEntry |
(package private) LocalCache.ReferenceEntry<K,V> |
LocalCache.StrongWriteEntry.nextWrite |
(package private) LocalCache.ReferenceEntry<K,V> |
LocalCache.StrongAccessWriteEntry.nextWrite |
(package private) LocalCache.ReferenceEntry<K,V> |
LocalCache.WeakWriteEntry.nextWrite |
(package private) LocalCache.ReferenceEntry<K,V> |
LocalCache.WeakAccessWriteEntry.nextWrite |
(package private) LocalCache.ReferenceEntry<K,V> |
LocalCache.StrongAccessEntry.previousAccess |
(package private) LocalCache.ReferenceEntry<K,V> |
LocalCache.StrongAccessWriteEntry.previousAccess |
(package private) LocalCache.ReferenceEntry<K,V> |
LocalCache.WeakAccessEntry.previousAccess |
(package private) LocalCache.ReferenceEntry<K,V> |
LocalCache.WeakAccessWriteEntry.previousAccess |
(package private) LocalCache.ReferenceEntry<K,V> |
LocalCache.StrongWriteEntry.previousWrite |
(package private) LocalCache.ReferenceEntry<K,V> |
LocalCache.StrongAccessWriteEntry.previousWrite |
(package private) LocalCache.ReferenceEntry<K,V> |
LocalCache.WeakWriteEntry.previousWrite |
(package private) LocalCache.ReferenceEntry<K,V> |
LocalCache.WeakAccessWriteEntry.previousWrite |
Modifier and Type | Field and Description |
---|---|
(package private) java.util.Queue<LocalCache.ReferenceEntry<K,V>> |
LocalCache.Segment.accessQueue
A queue of elements currently in the map, ordered by access time.
|
(package private) java.util.concurrent.atomic.AtomicReferenceArray<LocalCache.ReferenceEntry<K,V>> |
LocalCache.HashIterator.currentTable |
(package private) java.util.Queue<LocalCache.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) java.util.concurrent.atomic.AtomicReferenceArray<LocalCache.ReferenceEntry<K,V>> |
LocalCache.Segment.table
The per-segment table.
|
(package private) java.util.Queue<LocalCache.ReferenceEntry<K,V>> |
LocalCache.Segment.writeQueue
A queue of elements currently in the map, ordered by write time.
|
Modifier and Type | Method and Description |
---|---|
(package private) LocalCache.ReferenceEntry<K,V> |
LocalCache.copyEntry(LocalCache.ReferenceEntry<K,V> original,
LocalCache.ReferenceEntry<K,V> newNext)
This method is a convenience for testing.
|
(package private) LocalCache.ReferenceEntry<K,V> |
LocalCache.Segment.copyEntry(LocalCache.ReferenceEntry<K,V> original,
LocalCache.ReferenceEntry<K,V> newNext)
Copies
original into a new entry chained to newNext . |
(package private) <K,V> LocalCache.ReferenceEntry<K,V> |
LocalCache.EntryFactory.copyEntry(LocalCache.Segment<K,V> segment,
LocalCache.ReferenceEntry<K,V> original,
LocalCache.ReferenceEntry<K,V> newNext)
Copies an entry, assigning it a new
next entry. |
LocalCache.ReferenceEntry<K,V> |
LocalCache.ValueReference.getEntry()
Returns the entry associated with this value reference, or
null if this value
reference is independent of any entry. |
LocalCache.ReferenceEntry<K,V> |
LocalCache.WeakValueReference.getEntry() |
LocalCache.ReferenceEntry<K,V> |
LocalCache.SoftValueReference.getEntry() |
LocalCache.ReferenceEntry<K,V> |
LocalCache.StrongValueReference.getEntry() |
LocalCache.ReferenceEntry<K,V> |
LocalCache.LoadingValueReference.getEntry() |
(package private) LocalCache.ReferenceEntry<K,V> |
LocalCache.getEntry(java.lang.Object key)
Returns the internal entry for the specified key.
|
(package private) LocalCache.ReferenceEntry<K,V> |
LocalCache.Segment.getEntry(java.lang.Object key,
int hash) |
(package private) LocalCache.ReferenceEntry<K,V> |
LocalCache.Segment.getFirst(int hash)
Returns first entry of bin for given hash.
|
(package private) LocalCache.ReferenceEntry<K,V> |
LocalCache.Segment.getLiveEntry(java.lang.Object key,
int hash,
long now) |
LocalCache.ReferenceEntry<K,V> |
LocalCache.ReferenceEntry.getNext()
Returns the next entry in the chain.
|
LocalCache.ReferenceEntry<java.lang.Object,java.lang.Object> |
LocalCache.NullEntry.getNext() |
LocalCache.ReferenceEntry<K,V> |
LocalCache.AbstractReferenceEntry.getNext() |
LocalCache.ReferenceEntry<K,V> |
LocalCache.StrongEntry.getNext() |
LocalCache.ReferenceEntry<K,V> |
LocalCache.WeakEntry.getNext() |
(package private) LocalCache.ReferenceEntry<K,V> |
LocalCache.Segment.getNextEvictable() |
LocalCache.ReferenceEntry<K,V> |
LocalCache.ReferenceEntry.getNextInAccessQueue()
Returns the next entry in the access queue.
|
LocalCache.ReferenceEntry<java.lang.Object,java.lang.Object> |
LocalCache.NullEntry.getNextInAccessQueue() |
LocalCache.ReferenceEntry<K,V> |
LocalCache.AbstractReferenceEntry.getNextInAccessQueue() |
LocalCache.ReferenceEntry<K,V> |
LocalCache.StrongAccessEntry.getNextInAccessQueue() |
LocalCache.ReferenceEntry<K,V> |
LocalCache.StrongAccessWriteEntry.getNextInAccessQueue() |
LocalCache.ReferenceEntry<K,V> |
LocalCache.WeakEntry.getNextInAccessQueue() |
LocalCache.ReferenceEntry<K,V> |
LocalCache.WeakAccessEntry.getNextInAccessQueue() |
LocalCache.ReferenceEntry<K,V> |
LocalCache.WeakAccessWriteEntry.getNextInAccessQueue() |
LocalCache.ReferenceEntry<K,V> |
LocalCache.ReferenceEntry.getNextInWriteQueue()
Returns the next entry in the write queue.
|
LocalCache.ReferenceEntry<java.lang.Object,java.lang.Object> |
LocalCache.NullEntry.getNextInWriteQueue() |
LocalCache.ReferenceEntry<K,V> |
LocalCache.AbstractReferenceEntry.getNextInWriteQueue() |
LocalCache.ReferenceEntry<K,V> |
LocalCache.StrongWriteEntry.getNextInWriteQueue() |
LocalCache.ReferenceEntry<K,V> |
LocalCache.StrongAccessWriteEntry.getNextInWriteQueue() |
LocalCache.ReferenceEntry<K,V> |
LocalCache.WeakEntry.getNextInWriteQueue() |
LocalCache.ReferenceEntry<K,V> |
LocalCache.WeakWriteEntry.getNextInWriteQueue() |
LocalCache.ReferenceEntry<K,V> |
LocalCache.WeakAccessWriteEntry.getNextInWriteQueue() |
LocalCache.ReferenceEntry<K,V> |
LocalCache.ReferenceEntry.getPreviousInAccessQueue()
Returns the previous entry in the access queue.
|
LocalCache.ReferenceEntry<java.lang.Object,java.lang.Object> |
LocalCache.NullEntry.getPreviousInAccessQueue() |
LocalCache.ReferenceEntry<K,V> |
LocalCache.AbstractReferenceEntry.getPreviousInAccessQueue() |
LocalCache.ReferenceEntry<K,V> |
LocalCache.StrongAccessEntry.getPreviousInAccessQueue() |
LocalCache.ReferenceEntry<K,V> |
LocalCache.StrongAccessWriteEntry.getPreviousInAccessQueue() |
LocalCache.ReferenceEntry<K,V> |
LocalCache.WeakEntry.getPreviousInAccessQueue() |
LocalCache.ReferenceEntry<K,V> |
LocalCache.WeakAccessEntry.getPreviousInAccessQueue() |
LocalCache.ReferenceEntry<K,V> |
LocalCache.WeakAccessWriteEntry.getPreviousInAccessQueue() |
LocalCache.ReferenceEntry<K,V> |
LocalCache.ReferenceEntry.getPreviousInWriteQueue()
Returns the previous entry in the write queue.
|
LocalCache.ReferenceEntry<java.lang.Object,java.lang.Object> |
LocalCache.NullEntry.getPreviousInWriteQueue() |
LocalCache.ReferenceEntry<K,V> |
LocalCache.AbstractReferenceEntry.getPreviousInWriteQueue() |
LocalCache.ReferenceEntry<K,V> |
LocalCache.StrongWriteEntry.getPreviousInWriteQueue() |
LocalCache.ReferenceEntry<K,V> |
LocalCache.StrongAccessWriteEntry.getPreviousInWriteQueue() |
LocalCache.ReferenceEntry<K,V> |
LocalCache.WeakEntry.getPreviousInWriteQueue() |
LocalCache.ReferenceEntry<K,V> |
LocalCache.WeakWriteEntry.getPreviousInWriteQueue() |
LocalCache.ReferenceEntry<K,V> |
LocalCache.WeakAccessWriteEntry.getPreviousInWriteQueue() |
(package private) LocalCache.ReferenceEntry<K,V> |
LocalCache.newEntry(K key,
int hash,
LocalCache.ReferenceEntry<K,V> next)
This method is a convenience for testing.
|
(package private) LocalCache.ReferenceEntry<K,V> |
LocalCache.Segment.newEntry(K key,
int hash,
LocalCache.ReferenceEntry<K,V> next) |
(package private) abstract <K,V> LocalCache.ReferenceEntry<K,V> |
LocalCache.EntryFactory.newEntry(LocalCache.Segment<K,V> segment,
K key,
int hash,
LocalCache.ReferenceEntry<K,V> next)
Creates a new entry.
|
(package private) static <K,V> LocalCache.ReferenceEntry<K,V> |
LocalCache.nullEntry() |
LocalCache.ReferenceEntry<K,V> |
LocalCache.WriteQueue.peek() |
LocalCache.ReferenceEntry<K,V> |
LocalCache.AccessQueue.peek() |
LocalCache.ReferenceEntry<K,V> |
LocalCache.WriteQueue.poll() |
LocalCache.ReferenceEntry<K,V> |
LocalCache.AccessQueue.poll() |
(package private) LocalCache.ReferenceEntry<K,V> |
LocalCache.Segment.removeEntryFromChain(LocalCache.ReferenceEntry<K,V> first,
LocalCache.ReferenceEntry<K,V> entry) |
(package private) LocalCache.ReferenceEntry<K,V> |
LocalCache.Segment.removeValueFromChain(LocalCache.ReferenceEntry<K,V> first,
LocalCache.ReferenceEntry<K,V> entry,
K key,
int hash,
V value,
LocalCache.ValueReference<K,V> valueReference,
RemovalCause cause) |
Modifier and Type | Method and Description |
---|---|
java.util.Iterator<LocalCache.ReferenceEntry<K,V>> |
LocalCache.WriteQueue.iterator() |
java.util.Iterator<LocalCache.ReferenceEntry<K,V>> |
LocalCache.AccessQueue.iterator() |
(package private) java.util.concurrent.atomic.AtomicReferenceArray<LocalCache.ReferenceEntry<K,V>> |
LocalCache.Segment.newEntryArray(int size) |
Modifier and Type | Method and Description |
---|---|
(package private) boolean |
LocalCache.HashIterator.advanceTo(LocalCache.ReferenceEntry<K,V> entry)
Advances to the given entry.
|
(package private) static <K,V> void |
LocalCache.connectAccessOrder(LocalCache.ReferenceEntry<K,V> previous,
LocalCache.ReferenceEntry<K,V> next) |
(package private) static <K,V> void |
LocalCache.connectAccessOrder(LocalCache.ReferenceEntry<K,V> previous,
LocalCache.ReferenceEntry<K,V> next) |
(package private) static <K,V> void |
LocalCache.connectWriteOrder(LocalCache.ReferenceEntry<K,V> previous,
LocalCache.ReferenceEntry<K,V> next) |
(package private) static <K,V> void |
LocalCache.connectWriteOrder(LocalCache.ReferenceEntry<K,V> previous,
LocalCache.ReferenceEntry<K,V> next) |
(package private) <K,V> void |
LocalCache.EntryFactory.copyAccessEntry(LocalCache.ReferenceEntry<K,V> original,
LocalCache.ReferenceEntry<K,V> newEntry) |
(package private) <K,V> void |
LocalCache.EntryFactory.copyAccessEntry(LocalCache.ReferenceEntry<K,V> original,
LocalCache.ReferenceEntry<K,V> newEntry) |
(package private) LocalCache.ReferenceEntry<K,V> |
LocalCache.copyEntry(LocalCache.ReferenceEntry<K,V> original,
LocalCache.ReferenceEntry<K,V> newNext)
This method is a convenience for testing.
|
(package private) LocalCache.ReferenceEntry<K,V> |
LocalCache.copyEntry(LocalCache.ReferenceEntry<K,V> original,
LocalCache.ReferenceEntry<K,V> newNext)
This method is a convenience for testing.
|
(package private) LocalCache.ReferenceEntry<K,V> |
LocalCache.Segment.copyEntry(LocalCache.ReferenceEntry<K,V> original,
LocalCache.ReferenceEntry<K,V> newNext)
Copies
original into a new entry chained to newNext . |
(package private) LocalCache.ReferenceEntry<K,V> |
LocalCache.Segment.copyEntry(LocalCache.ReferenceEntry<K,V> original,
LocalCache.ReferenceEntry<K,V> newNext)
Copies
original into a new entry chained to newNext . |
(package private) <K,V> LocalCache.ReferenceEntry<K,V> |
LocalCache.EntryFactory.copyEntry(LocalCache.Segment<K,V> segment,
LocalCache.ReferenceEntry<K,V> original,
LocalCache.ReferenceEntry<K,V> newNext)
Copies an entry, assigning it a new
next entry. |
(package private) <K,V> LocalCache.ReferenceEntry<K,V> |
LocalCache.EntryFactory.copyEntry(LocalCache.Segment<K,V> segment,
LocalCache.ReferenceEntry<K,V> original,
LocalCache.ReferenceEntry<K,V> newNext)
Copies an entry, assigning it a new
next entry. |
LocalCache.ValueReference<K,V> |
LocalCache.ValueReference.copyFor(java.lang.ref.ReferenceQueue<V> queue,
V value,
LocalCache.ReferenceEntry<K,V> entry)
Creates a copy of this reference for the given entry.
|
LocalCache.ValueReference<K,V> |
LocalCache.WeakValueReference.copyFor(java.lang.ref.ReferenceQueue<V> queue,
V value,
LocalCache.ReferenceEntry<K,V> entry) |
LocalCache.ValueReference<K,V> |
LocalCache.SoftValueReference.copyFor(java.lang.ref.ReferenceQueue<V> queue,
V value,
LocalCache.ReferenceEntry<K,V> entry) |
LocalCache.ValueReference<K,V> |
LocalCache.StrongValueReference.copyFor(java.lang.ref.ReferenceQueue<V> queue,
V value,
LocalCache.ReferenceEntry<K,V> entry) |
LocalCache.ValueReference<K,V> |
LocalCache.WeightedWeakValueReference.copyFor(java.lang.ref.ReferenceQueue<V> queue,
V value,
LocalCache.ReferenceEntry<K,V> entry) |
LocalCache.ValueReference<K,V> |
LocalCache.WeightedSoftValueReference.copyFor(java.lang.ref.ReferenceQueue<V> queue,
V value,
LocalCache.ReferenceEntry<K,V> entry) |
LocalCache.ValueReference<K,V> |
LocalCache.LoadingValueReference.copyFor(java.lang.ref.ReferenceQueue<V> queue,
V value,
LocalCache.ReferenceEntry<K,V> entry) |
(package private) <K,V> void |
LocalCache.EntryFactory.copyWriteEntry(LocalCache.ReferenceEntry<K,V> original,
LocalCache.ReferenceEntry<K,V> newEntry) |
(package private) <K,V> void |
LocalCache.EntryFactory.copyWriteEntry(LocalCache.ReferenceEntry<K,V> original,
LocalCache.ReferenceEntry<K,V> newEntry) |
(package private) void |
LocalCache.Segment.evictEntries(LocalCache.ReferenceEntry<K,V> newest)
Performs eviction if the segment is over capacity.
|
(package private) V |
LocalCache.getLiveValue(LocalCache.ReferenceEntry<K,V> entry,
long now)
Gets the value from an entry.
|
(package private) V |
LocalCache.Segment.getLiveValue(LocalCache.ReferenceEntry<K,V> entry,
long now)
Gets the value from an entry.
|
(package private) boolean |
LocalCache.isExpired(LocalCache.ReferenceEntry<K,V> entry,
long now)
Returns true if the entry has expired.
|
(package private) boolean |
LocalCache.isLive(LocalCache.ReferenceEntry<K,V> entry,
long now)
This method is a convenience for testing.
|
(package private) LocalCache.ReferenceEntry<K,V> |
LocalCache.newEntry(K key,
int hash,
LocalCache.ReferenceEntry<K,V> next)
This method is a convenience for testing.
|
(package private) LocalCache.ReferenceEntry<K,V> |
LocalCache.Segment.newEntry(K key,
int hash,
LocalCache.ReferenceEntry<K,V> next) |
(package private) abstract <K,V> LocalCache.ReferenceEntry<K,V> |
LocalCache.EntryFactory.newEntry(LocalCache.Segment<K,V> segment,
K key,
int hash,
LocalCache.ReferenceEntry<K,V> next)
Creates a new entry.
|
(package private) LocalCache.ValueReference<K,V> |
LocalCache.newValueReference(LocalCache.ReferenceEntry<K,V> entry,
V value,
int weight)
This method is a convenience for testing.
|
(package private) static <K,V> void |
LocalCache.nullifyAccessOrder(LocalCache.ReferenceEntry<K,V> nulled) |
(package private) static <K,V> void |
LocalCache.nullifyWriteOrder(LocalCache.ReferenceEntry<K,V> nulled) |
boolean |
LocalCache.WriteQueue.offer(LocalCache.ReferenceEntry<K,V> entry) |
boolean |
LocalCache.AccessQueue.offer(LocalCache.ReferenceEntry<K,V> entry) |
(package private) void |
LocalCache.reclaimKey(LocalCache.ReferenceEntry<K,V> entry) |
(package private) boolean |
LocalCache.Segment.reclaimKey(LocalCache.ReferenceEntry<K,V> entry,
int hash)
Removes an entry whose key has been garbage collected.
|
(package private) void |
LocalCache.Segment.recordLockedRead(LocalCache.ReferenceEntry<K,V> entry,
long now)
Updates the eviction metadata that
entry was just read. |
(package private) void |
LocalCache.Segment.recordRead(LocalCache.ReferenceEntry<K,V> entry,
long now)
Records the relative order in which this read was performed by adding
entry to the
recency queue. |
(package private) void |
LocalCache.Segment.recordWrite(LocalCache.ReferenceEntry<K,V> entry,
int weight,
long now)
Updates eviction metadata that
entry was just written. |
(package private) abstract <K,V> LocalCache.ValueReference<K,V> |
LocalCache.Strength.referenceValue(LocalCache.Segment<K,V> segment,
LocalCache.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(LocalCache.ReferenceEntry<K,V> entry) |
(package private) boolean |
LocalCache.Segment.removeEntry(LocalCache.ReferenceEntry<K,V> entry,
int hash,
RemovalCause cause) |
(package private) LocalCache.ReferenceEntry<K,V> |
LocalCache.Segment.removeEntryFromChain(LocalCache.ReferenceEntry<K,V> first,
LocalCache.ReferenceEntry<K,V> entry) |
(package private) LocalCache.ReferenceEntry<K,V> |
LocalCache.Segment.removeEntryFromChain(LocalCache.ReferenceEntry<K,V> first,
LocalCache.ReferenceEntry<K,V> entry) |
(package private) LocalCache.ReferenceEntry<K,V> |
LocalCache.Segment.removeValueFromChain(LocalCache.ReferenceEntry<K,V> first,
LocalCache.ReferenceEntry<K,V> entry,
K key,
int hash,
V value,
LocalCache.ValueReference<K,V> valueReference,
RemovalCause cause) |
(package private) LocalCache.ReferenceEntry<K,V> |
LocalCache.Segment.removeValueFromChain(LocalCache.ReferenceEntry<K,V> first,
LocalCache.ReferenceEntry<K,V> entry,
K key,
int hash,
V value,
LocalCache.ValueReference<K,V> valueReference,
RemovalCause cause) |
(package private) V |
LocalCache.Segment.scheduleRefresh(LocalCache.ReferenceEntry<K,V> entry,
K key,
int hash,
V oldValue,
long now,
CacheLoader<? super K,V> loader) |
void |
LocalCache.ReferenceEntry.setNextInAccessQueue(LocalCache.ReferenceEntry<K,V> next)
Sets the next entry in the access queue.
|
void |
LocalCache.AbstractReferenceEntry.setNextInAccessQueue(LocalCache.ReferenceEntry<K,V> next) |
void |
LocalCache.StrongAccessEntry.setNextInAccessQueue(LocalCache.ReferenceEntry<K,V> next) |
void |
LocalCache.StrongAccessWriteEntry.setNextInAccessQueue(LocalCache.ReferenceEntry<K,V> next) |
void |
LocalCache.WeakEntry.setNextInAccessQueue(LocalCache.ReferenceEntry<K,V> next) |
void |
LocalCache.WeakAccessEntry.setNextInAccessQueue(LocalCache.ReferenceEntry<K,V> next) |
void |
LocalCache.WeakAccessWriteEntry.setNextInAccessQueue(LocalCache.ReferenceEntry<K,V> next) |
void |
LocalCache.NullEntry.setNextInAccessQueue(LocalCache.ReferenceEntry<java.lang.Object,java.lang.Object> next) |
void |
LocalCache.ReferenceEntry.setNextInWriteQueue(LocalCache.ReferenceEntry<K,V> next)
Sets the next entry in the write queue.
|
void |
LocalCache.AbstractReferenceEntry.setNextInWriteQueue(LocalCache.ReferenceEntry<K,V> next) |
void |
LocalCache.StrongWriteEntry.setNextInWriteQueue(LocalCache.ReferenceEntry<K,V> next) |
void |
LocalCache.StrongAccessWriteEntry.setNextInWriteQueue(LocalCache.ReferenceEntry<K,V> next) |
void |
LocalCache.WeakEntry.setNextInWriteQueue(LocalCache.ReferenceEntry<K,V> next) |
void |
LocalCache.WeakWriteEntry.setNextInWriteQueue(LocalCache.ReferenceEntry<K,V> next) |
void |
LocalCache.WeakAccessWriteEntry.setNextInWriteQueue(LocalCache.ReferenceEntry<K,V> next) |
void |
LocalCache.NullEntry.setNextInWriteQueue(LocalCache.ReferenceEntry<java.lang.Object,java.lang.Object> next) |
void |
LocalCache.ReferenceEntry.setPreviousInAccessQueue(LocalCache.ReferenceEntry<K,V> previous)
Sets the previous entry in the access queue.
|
void |
LocalCache.AbstractReferenceEntry.setPreviousInAccessQueue(LocalCache.ReferenceEntry<K,V> previous) |
void |
LocalCache.StrongAccessEntry.setPreviousInAccessQueue(LocalCache.ReferenceEntry<K,V> previous) |
void |
LocalCache.StrongAccessWriteEntry.setPreviousInAccessQueue(LocalCache.ReferenceEntry<K,V> previous) |
void |
LocalCache.WeakEntry.setPreviousInAccessQueue(LocalCache.ReferenceEntry<K,V> previous) |
void |
LocalCache.WeakAccessEntry.setPreviousInAccessQueue(LocalCache.ReferenceEntry<K,V> previous) |
void |
LocalCache.WeakAccessWriteEntry.setPreviousInAccessQueue(LocalCache.ReferenceEntry<K,V> previous) |
void |
LocalCache.NullEntry.setPreviousInAccessQueue(LocalCache.ReferenceEntry<java.lang.Object,java.lang.Object> previous) |
void |
LocalCache.ReferenceEntry.setPreviousInWriteQueue(LocalCache.ReferenceEntry<K,V> previous)
Sets the previous entry in the write queue.
|
void |
LocalCache.AbstractReferenceEntry.setPreviousInWriteQueue(LocalCache.ReferenceEntry<K,V> previous) |
void |
LocalCache.StrongWriteEntry.setPreviousInWriteQueue(LocalCache.ReferenceEntry<K,V> previous) |
void |
LocalCache.StrongAccessWriteEntry.setPreviousInWriteQueue(LocalCache.ReferenceEntry<K,V> previous) |
void |
LocalCache.WeakEntry.setPreviousInWriteQueue(LocalCache.ReferenceEntry<K,V> previous) |
void |
LocalCache.WeakWriteEntry.setPreviousInWriteQueue(LocalCache.ReferenceEntry<K,V> previous) |
void |
LocalCache.WeakAccessWriteEntry.setPreviousInWriteQueue(LocalCache.ReferenceEntry<K,V> previous) |
void |
LocalCache.NullEntry.setPreviousInWriteQueue(LocalCache.ReferenceEntry<java.lang.Object,java.lang.Object> previous) |
(package private) void |
LocalCache.Segment.setValue(LocalCache.ReferenceEntry<K,V> entry,
K key,
V value,
long now)
Sets a new value of an entry.
|
(package private) V |
LocalCache.Segment.waitForLoadingValue(LocalCache.ReferenceEntry<K,V> e,
K key,
LocalCache.ValueReference<K,V> valueReference) |
Modifier and Type | Method and Description |
---|---|
(package private) void |
LocalCache.Segment.initTable(java.util.concurrent.atomic.AtomicReferenceArray<LocalCache.ReferenceEntry<K,V>> newTable) |
Constructor and Description |
---|
SoftValueReference(java.lang.ref.ReferenceQueue<V> queue,
V referent,
LocalCache.ReferenceEntry<K,V> entry) |
StrongAccessEntry(K key,
int hash,
LocalCache.ReferenceEntry<K,V> next) |
StrongAccessWriteEntry(K key,
int hash,
LocalCache.ReferenceEntry<K,V> next) |
StrongEntry(K key,
int hash,
LocalCache.ReferenceEntry<K,V> next) |
StrongWriteEntry(K key,
int hash,
LocalCache.ReferenceEntry<K,V> next) |
WeakAccessEntry(java.lang.ref.ReferenceQueue<K> queue,
K key,
int hash,
LocalCache.ReferenceEntry<K,V> next) |
WeakAccessWriteEntry(java.lang.ref.ReferenceQueue<K> queue,
K key,
int hash,
LocalCache.ReferenceEntry<K,V> next) |
WeakEntry(java.lang.ref.ReferenceQueue<K> queue,
K key,
int hash,
LocalCache.ReferenceEntry<K,V> next) |
WeakValueReference(java.lang.ref.ReferenceQueue<V> queue,
V referent,
LocalCache.ReferenceEntry<K,V> entry) |
WeakWriteEntry(java.lang.ref.ReferenceQueue<K> queue,
K key,
int hash,
LocalCache.ReferenceEntry<K,V> next) |
WeightedSoftValueReference(java.lang.ref.ReferenceQueue<V> queue,
V referent,
LocalCache.ReferenceEntry<K,V> entry,
int weight) |
WeightedWeakValueReference(java.lang.ref.ReferenceQueue<V> queue,
V referent,
LocalCache.ReferenceEntry<K,V> entry,
int weight) |