Uses of Interface
org.docx4j.com.google.common.cache.ReferenceEntry

Packages that use ReferenceEntry

Package	Description
org.docx4j.com.google.common.cache

Uses of ReferenceEntry in org.docx4j.com.google.common.cache

Classes in org.docx4j.com.google.common.cache that implement ReferenceEntry

Modifier and Type	Class	Description
(package private) static class	LocalCache.AbstractReferenceEntry<K,V>
private static enum	LocalCache.NullEntry
(package private) static final class	LocalCache.StrongAccessEntry<K,V>
(package private) static final class	LocalCache.StrongAccessWriteEntry<K,V>
(package private) static class	LocalCache.StrongEntry<K,V>	Used for strongly-referenced keys.
(package private) static final class	LocalCache.StrongWriteEntry<K,V>
(package private) static final class	LocalCache.WeakAccessEntry<K,V>
(package private) static final class	LocalCache.WeakAccessWriteEntry<K,V>
(package private) static class	LocalCache.WeakEntry<K,V>	Used for weakly-referenced keys.
(package private) static final class	LocalCache.WeakWriteEntry<K,V>

Fields in org.docx4j.com.google.common.cache declared as ReferenceEntry

Modifier and Type	Field	Description
(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 @Nullable ReferenceEntry<K,V>	LocalCache.StrongEntry.next
(package private) final @Nullable 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) @Nullable 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 org.docx4j.com.google.common.cache with type parameters of type ReferenceEntry

Modifier and Type	Field	Description
(package private) final Queue<ReferenceEntry<K,V>>	LocalCache.Segment.accessQueue	A queue of elements currently in the map, ordered by access time.
(package private) @MonotonicNonNull 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) @MonotonicNonNull 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 org.docx4j.com.google.common.cache that return ReferenceEntry

Modifier and Type	Method	Description
(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)	Copies an entry, assigning it a new next entry.
(package private) ReferenceEntry<K,V>	LocalCache.Segment.copyEntry(ReferenceEntry<K,V> original, ReferenceEntry<K,V> newNext)	Copies original into a new entry chained to newNext.
(package private) ReferenceEntry<K,V>	LocalCache.getEntry(@Nullable Object key)	Returns the internal entry for the specified key.
ReferenceEntry<K,V>	LocalCache.LoadingValueReference.getEntry()
(package private) @Nullable ReferenceEntry<K,V>	LocalCache.Segment.getEntry(Object key, int hash)
ReferenceEntry<K,V>	LocalCache.SoftValueReference.getEntry()
ReferenceEntry<K,V>	LocalCache.StrongValueReference.getEntry()
@Nullable 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.
ReferenceEntry<K,V>	LocalCache.WeakValueReference.getEntry()
(package private) ReferenceEntry<K,V>	LocalCache.Segment.getFirst(int hash)	Returns first entry of bin for given hash.
(package private) @Nullable ReferenceEntry<K,V>	LocalCache.Segment.getLiveEntry(Object key, int hash, long now)
ReferenceEntry<K,V>	LocalCache.AbstractReferenceEntry.getNext()
ReferenceEntry<Object,Object>	LocalCache.NullEntry.getNext()
ReferenceEntry<K,V>	LocalCache.StrongEntry.getNext()
ReferenceEntry<K,V>	LocalCache.WeakEntry.getNext()
@Nullable ReferenceEntry<K,V>	ReferenceEntry.getNext()	Returns the next entry in the chain.
(package private) ReferenceEntry<K,V>	LocalCache.Segment.getNextEvictable()
ReferenceEntry<K,V>	LocalCache.AbstractReferenceEntry.getNextInAccessQueue()
ReferenceEntry<Object,Object>	LocalCache.NullEntry.getNextInAccessQueue()
ReferenceEntry<K,V>	LocalCache.StrongAccessEntry.getNextInAccessQueue()
ReferenceEntry<K,V>	LocalCache.StrongAccessWriteEntry.getNextInAccessQueue()
ReferenceEntry<K,V>	LocalCache.WeakAccessEntry.getNextInAccessQueue()
ReferenceEntry<K,V>	LocalCache.WeakAccessWriteEntry.getNextInAccessQueue()
ReferenceEntry<K,V>	LocalCache.WeakEntry.getNextInAccessQueue()
ReferenceEntry<K,V>	ReferenceEntry.getNextInAccessQueue()	Returns the next entry in the access queue.
ReferenceEntry<K,V>	LocalCache.AbstractReferenceEntry.getNextInWriteQueue()
ReferenceEntry<Object,Object>	LocalCache.NullEntry.getNextInWriteQueue()
ReferenceEntry<K,V>	LocalCache.StrongAccessWriteEntry.getNextInWriteQueue()
ReferenceEntry<K,V>	LocalCache.StrongWriteEntry.getNextInWriteQueue()
ReferenceEntry<K,V>	LocalCache.WeakAccessWriteEntry.getNextInWriteQueue()
ReferenceEntry<K,V>	LocalCache.WeakEntry.getNextInWriteQueue()
ReferenceEntry<K,V>	LocalCache.WeakWriteEntry.getNextInWriteQueue()
ReferenceEntry<K,V>	ReferenceEntry.getNextInWriteQueue()	Returns the next entry in the write queue.
ReferenceEntry<K,V>	LocalCache.AbstractReferenceEntry.getPreviousInAccessQueue()
ReferenceEntry<Object,Object>	LocalCache.NullEntry.getPreviousInAccessQueue()
ReferenceEntry<K,V>	LocalCache.StrongAccessEntry.getPreviousInAccessQueue()
ReferenceEntry<K,V>	LocalCache.StrongAccessWriteEntry.getPreviousInAccessQueue()
ReferenceEntry<K,V>	LocalCache.WeakAccessEntry.getPreviousInAccessQueue()
ReferenceEntry<K,V>	LocalCache.WeakAccessWriteEntry.getPreviousInAccessQueue()
ReferenceEntry<K,V>	LocalCache.WeakEntry.getPreviousInAccessQueue()
ReferenceEntry<K,V>	ReferenceEntry.getPreviousInAccessQueue()	Returns the previous entry in the access queue.
ReferenceEntry<K,V>	LocalCache.AbstractReferenceEntry.getPreviousInWriteQueue()
ReferenceEntry<Object,Object>	LocalCache.NullEntry.getPreviousInWriteQueue()
ReferenceEntry<K,V>	LocalCache.StrongAccessWriteEntry.getPreviousInWriteQueue()
ReferenceEntry<K,V>	LocalCache.StrongWriteEntry.getPreviousInWriteQueue()
ReferenceEntry<K,V>	LocalCache.WeakAccessWriteEntry.getPreviousInWriteQueue()
ReferenceEntry<K,V>	LocalCache.WeakEntry.getPreviousInWriteQueue()
ReferenceEntry<K,V>	LocalCache.WeakWriteEntry.getPreviousInWriteQueue()
ReferenceEntry<K,V>	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, @Nullable ReferenceEntry<K,V> next)	Creates a new entry.
(package private) ReferenceEntry<K,V>	LocalCache.newEntry(K key, int hash, @Nullable ReferenceEntry<K,V> next)	This method is a convenience for testing.
(package private) ReferenceEntry<K,V>	LocalCache.Segment.newEntry(K key, int hash, @Nullable ReferenceEntry<K,V> next)
(package private) static <K, V> ReferenceEntry<K,V>	LocalCache.nullEntry()
ReferenceEntry<K,V>	LocalCache.AccessQueue.peek()
ReferenceEntry<K,V>	LocalCache.WriteQueue.peek()
ReferenceEntry<K,V>	LocalCache.AccessQueue.poll()
ReferenceEntry<K,V>	LocalCache.WriteQueue.poll()
(package private) @Nullable ReferenceEntry<K,V>	LocalCache.Segment.removeEntryFromChain(ReferenceEntry<K,V> first, ReferenceEntry<K,V> entry)
(package private) @Nullable ReferenceEntry<K,V>	LocalCache.Segment.removeValueFromChain(ReferenceEntry<K,V> first, ReferenceEntry<K,V> entry, @Nullable K key, int hash, V value, LocalCache.ValueReference<K,V> valueReference, RemovalCause cause)

Methods in org.docx4j.com.google.common.cache that return types with arguments of type ReferenceEntry

Modifier and Type	Method	Description
Iterator<ReferenceEntry<K,V>>	LocalCache.AccessQueue.iterator()
Iterator<ReferenceEntry<K,V>>	LocalCache.WriteQueue.iterator()
(package private) AtomicReferenceArray<ReferenceEntry<K,V>>	LocalCache.Segment.newEntryArray(int size)

Methods in org.docx4j.com.google.common.cache with parameters of type ReferenceEntry

Modifier and Type	Method	Description
(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)	Copies an entry, assigning it a new next entry.
(package private) ReferenceEntry<K,V>	LocalCache.Segment.copyEntry(ReferenceEntry<K,V> original, ReferenceEntry<K,V> newNext)	Copies original into a new entry chained to newNext.
LocalCache.ValueReference<K,V>	LocalCache.LoadingValueReference.copyFor(ReferenceQueue<V> queue, @Nullable V value, ReferenceEntry<K,V> entry)
LocalCache.ValueReference<K,V>	LocalCache.SoftValueReference.copyFor(ReferenceQueue<V> queue, V value, ReferenceEntry<K,V> entry)
LocalCache.ValueReference<K,V>	LocalCache.StrongValueReference.copyFor(ReferenceQueue<V> queue, V value, ReferenceEntry<K,V> entry)
LocalCache.ValueReference<K,V>	LocalCache.ValueReference.copyFor(ReferenceQueue<V> queue, @Nullable V value, ReferenceEntry<K,V> entry)	Creates a copy of this reference for the given entry.
LocalCache.ValueReference<K,V>	LocalCache.WeakValueReference.copyFor(ReferenceQueue<V> queue, V value, ReferenceEntry<K,V> entry)
LocalCache.ValueReference<K,V>	LocalCache.WeightedSoftValueReference.copyFor(ReferenceQueue<V> queue, V value, ReferenceEntry<K,V> entry)
LocalCache.ValueReference<K,V>	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) @Nullable 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, @Nullable ReferenceEntry<K,V> next)	Creates a new entry.
(package private) ReferenceEntry<K,V>	LocalCache.newEntry(K key, int hash, @Nullable ReferenceEntry<K,V> next)	This method is a convenience for testing.
(package private) ReferenceEntry<K,V>	LocalCache.Segment.newEntry(K key, int hash, @Nullable 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 that entry 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 adding entry to the recency queue.
(package private) void	LocalCache.Segment.recordWrite(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, 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) @Nullable ReferenceEntry<K,V>	LocalCache.Segment.removeEntryFromChain(ReferenceEntry<K,V> first, ReferenceEntry<K,V> entry)
(package private) @Nullable ReferenceEntry<K,V>	LocalCache.Segment.removeValueFromChain(ReferenceEntry<K,V> first, ReferenceEntry<K,V> entry, @Nullable 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	LocalCache.Segment.setValue(ReferenceEntry<K,V> entry, K key, V value, long now)	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 org.docx4j.com.google.common.cache with type arguments of type ReferenceEntry

Modifier and Type	Method	Description
(package private) void	LocalCache.Segment.initTable(AtomicReferenceArray<ReferenceEntry<K,V>> newTable)

Constructors in org.docx4j.com.google.common.cache with parameters of type ReferenceEntry

Modifier	Constructor	Description
(package private)	SoftValueReference(ReferenceQueue<V> queue, V referent, ReferenceEntry<K,V> entry)
(package private)	StrongAccessEntry(K key, int hash, @Nullable ReferenceEntry<K,V> next)
(package private)	StrongAccessWriteEntry(K key, int hash, @Nullable ReferenceEntry<K,V> next)
(package private)	StrongEntry(K key, int hash, @Nullable ReferenceEntry<K,V> next)
(package private)	StrongWriteEntry(K key, int hash, @Nullable ReferenceEntry<K,V> next)
(package private)	WeakAccessEntry(ReferenceQueue<K> queue, K key, int hash, @Nullable ReferenceEntry<K,V> next)
(package private)	WeakAccessWriteEntry(ReferenceQueue<K> queue, K key, int hash, @Nullable ReferenceEntry<K,V> next)
(package private)	WeakEntry(ReferenceQueue<K> queue, K key, int hash, @Nullable 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, @Nullable 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)