Skip navigation links

Uses of Interface
oracle.javatools.util.Maps.LinkedEntry

Packages that use Maps.LinkedEntry

oracle.javatools.util

Provides general utilities.

Uses of Maps.LinkedEntry in oracle.javatools.util

Classes in oracle.javatools.util with type parameters of type Maps.LinkedEntry

static class

Maps.AbstractLinkedHashMap<K,V,E extends Maps.LinkedEntry<K,V>> An abstract, but nearly complete, implementation of the Map interface that is functionally equivalent to LinkedHashMap but is based on Maps.AbstractHashMap and allows subclasses the same customization options.

Subinterfaces of Maps.LinkedEntry in oracle.javatools.util

static interface

Maps.TimedEntry<K,V>

Classes in oracle.javatools.util that implement Maps.LinkedEntry

static class	Maps.EvictedLinkedEntry<K,V>
static class	Maps.SoftLinkedEntry<K,V> An Maps.LinkedEntry implementation which holds its value with a SoftReference.
static class	Maps.StrongLinkedEntry<K,V> The default Maps.LinkedEntry implementation.
static class	Maps.TimedEvictedLinkedEntry<K,V>
static class	Maps.TimedSoftLinkedEntry<K,V>
static class	Maps.TimedStrongLinkedEntry<K,V>
static class	Maps.TimedWeakLinkedEntry<K,V>
static class	Maps.WeakLinkedEntry<K,V> An Maps.LinkedEntry implementation which holds its value with a WeakReference.

Methods in oracle.javatools.util that return Maps.LinkedEntry

protected Maps.LinkedEntry<K,V>	Maps.CacheStrategy.createDefaultEntry(int hashCode, K key, V value, Maps.LinkedEntry<K,V> next)
protected Maps.LinkedEntry<K,V>	Maps.TimedLruCacheStrategy.createDefaultEntry(int hashCode, K key, V value, Maps.LinkedEntry<K,V> next)
protected Maps.LinkedEntry<K,V>	Maps.CacheMap.createEntry(int hashCode, K key, V value, Maps.LinkedEntry<K,V> next) Creates an entry for this map.
protected Maps.LinkedEntry<K,V>	Maps.CacheStrategy.createEntry(int hashCode, K key, V value, Maps.LinkedEntry<K,V> next, java.lang.ref.ReferenceQueue<V> queue)
protected Maps.LinkedEntry<K,V>	Maps.CacheStrategy.createEvictedEntry(int hashCode, K key, V value, Maps.LinkedEntry<K,V> next, java.lang.ref.ReferenceQueue<V> queue)
protected Maps.LinkedEntry<K,V>	Maps.TimedLruCacheStrategy.createEvictedEntry(int hashCode, K key, V value, Maps.LinkedEntry<K,V> next, java.lang.ref.ReferenceQueue<V> queue)
protected Maps.LinkedEntry<K,V>	Maps.CacheStrategy.createSoftEntry(int hashCode, K key, V value, Maps.LinkedEntry<K,V> next, java.lang.ref.ReferenceQueue<V> queue)
protected Maps.LinkedEntry<K,V>	Maps.TimedLruCacheStrategy.createSoftEntry(int hashCode, K key, V value, Maps.LinkedEntry<K,V> next, java.lang.ref.ReferenceQueue<V> queue)
protected Maps.LinkedEntry<K,V>	Maps.CacheStrategy.createWeakEntry(int hashCode, K key, V value, Maps.LinkedEntry<K,V> next, java.lang.ref.ReferenceQueue<V> queue)
protected Maps.LinkedEntry<K,V>	Maps.TimedLruCacheStrategy.createWeakEntry(int hashCode, K key, V value, Maps.LinkedEntry<K,V> next, java.lang.ref.ReferenceQueue<V> queue)
Maps.LinkedEntry<K,V>	Maps.LinkedEntry.getAfter() Gets the next entry in the iteration list of the containing map.
Maps.LinkedEntry<K,V>	Maps.StrongLinkedEntry.getAfter()
Maps.LinkedEntry<K,V>	Maps.SoftLinkedEntry.getAfter()
Maps.LinkedEntry<K,V>	Maps.WeakLinkedEntry.getAfter()
Maps.LinkedEntry<K,V>	Maps.LinkedEntry.getBefore() Gets the previous entry in the iteration list of the containing map.
Maps.LinkedEntry<K,V>	Maps.StrongLinkedEntry.getBefore()
Maps.LinkedEntry<K,V>	Maps.SoftLinkedEntry.getBefore()
Maps.LinkedEntry<K,V>	Maps.WeakLinkedEntry.getBefore()
protected Maps.LinkedEntry<K,V>	Maps.CacheMap.getEldestEntry()

Methods in oracle.javatools.util with parameters of type Maps.LinkedEntry

protected Maps.LinkedEntry<K,V>	Maps.CacheStrategy.createDefaultEntry(int hashCode, K key, V value, Maps.LinkedEntry<K,V> next)
protected Maps.LinkedEntry<K,V>	Maps.TimedLruCacheStrategy.createDefaultEntry(int hashCode, K key, V value, Maps.LinkedEntry<K,V> next)
protected Maps.LinkedEntry<K,V>	Maps.CacheMap.createEntry(int hashCode, K key, V value, Maps.LinkedEntry<K,V> next) Creates an entry for this map.
protected Maps.LinkedEntry<K,V>	Maps.CacheStrategy.createEntry(int hashCode, K key, V value, Maps.LinkedEntry<K,V> next, java.lang.ref.ReferenceQueue<V> queue)
protected Maps.LinkedEntry<K,V>	Maps.CacheStrategy.createEvictedEntry(int hashCode, K key, V value, Maps.LinkedEntry<K,V> next, java.lang.ref.ReferenceQueue<V> queue)
protected Maps.LinkedEntry<K,V>	Maps.TimedLruCacheStrategy.createEvictedEntry(int hashCode, K key, V value, Maps.LinkedEntry<K,V> next, java.lang.ref.ReferenceQueue<V> queue)
protected Maps.LinkedEntry<K,V>	Maps.CacheStrategy.createSoftEntry(int hashCode, K key, V value, Maps.LinkedEntry<K,V> next, java.lang.ref.ReferenceQueue<V> queue)
protected Maps.LinkedEntry<K,V>	Maps.TimedLruCacheStrategy.createSoftEntry(int hashCode, K key, V value, Maps.LinkedEntry<K,V> next, java.lang.ref.ReferenceQueue<V> queue)
protected Maps.LinkedEntry<K,V>	Maps.CacheStrategy.createWeakEntry(int hashCode, K key, V value, Maps.LinkedEntry<K,V> next, java.lang.ref.ReferenceQueue<V> queue)
protected Maps.LinkedEntry<K,V>	Maps.TimedLruCacheStrategy.createWeakEntry(int hashCode, K key, V value, Maps.LinkedEntry<K,V> next, java.lang.ref.ReferenceQueue<V> queue)
protected void	Maps.CacheStrategy.entryAccessed(Maps.CacheMap<K,V> map, Maps.LinkedEntry<K,V> entry) Invoked when the value of an existing entry is accessed by Maps.AbstractHashMap.get(java.lang.Object).
protected void	Maps.TimedLruCacheStrategy.entryAccessed(Maps.CacheMap<K,V> map, Maps.LinkedEntry<K,V> entry) Invoked when the value of an existing entry is accessed by Maps.AbstractHashMap.get(java.lang.Object).
protected void	Maps.CacheMap.entryAccessed(Maps.LinkedEntry<K,V> entry)
protected void	Maps.CacheStrategy.entryAdded(Maps.CacheMap<K,V> map, Maps.LinkedEntry<K,V> entry) Invoked when a new entry is added to this map, when entries are added by Maps.AbstractHashMap.put(K, V).
protected void	Maps.BoundedLruCacheStrategy.entryAdded(Maps.CacheMap<K,V> map, Maps.LinkedEntry<K,V> entry) Invoked when a new entry is added to this map, when entries are added by Maps.AbstractHashMap.put(K, V).
protected void	Maps.TimedLruCacheStrategy.entryAdded(Maps.CacheMap<K,V> map, Maps.LinkedEntry<K,V> entry) Invoked when a new entry is added to this map, when entries are added by Maps.AbstractHashMap.put(K, V).
protected void	Maps.CacheMap.entryAdded(Maps.LinkedEntry<K,V> entry)
protected void	Maps.CacheStrategy.entryChanged(Maps.CacheMap<K,V> map, Maps.LinkedEntry<K,V> oldEntry, V oldValue, Maps.LinkedEntry<K,V> newEntry) Invoked when the value of an existing entry is changed or when entries are changed by Maps.AbstractHashMap.put(K, V).
protected void	Maps.CacheStrategy.entryChanged(Maps.CacheMap<K,V> map, Maps.LinkedEntry<K,V> oldEntry, V oldValue, Maps.LinkedEntry<K,V> newEntry) Invoked when the value of an existing entry is changed or when entries are changed by Maps.AbstractHashMap.put(K, V).
protected void	Maps.TimedLruCacheStrategy.entryChanged(Maps.CacheMap<K,V> map, Maps.LinkedEntry<K,V> oldEntry, V oldValue, Maps.LinkedEntry<K,V> newEntry) Invoked when the value of an existing entry is changed or when entries are changed by Maps.AbstractHashMap.put(K, V).
protected void	Maps.TimedLruCacheStrategy.entryChanged(Maps.CacheMap<K,V> map, Maps.LinkedEntry<K,V> oldEntry, V oldValue, Maps.LinkedEntry<K,V> newEntry) Invoked when the value of an existing entry is changed or when entries are changed by Maps.AbstractHashMap.put(K, V).
protected void	Maps.CacheMap.entryChanged(Maps.LinkedEntry<K,V> oldEntry, V oldValue, Maps.LinkedEntry<K,V> newEntry)
protected void	Maps.CacheMap.entryChanged(Maps.LinkedEntry<K,V> oldEntry, V oldValue, Maps.LinkedEntry<K,V> newEntry)
protected void	Maps.CacheStrategy.entryEvicted(Maps.CacheMap<K,V> map, Maps.LinkedEntry<K,V> entry) Invoked when an existing entry is evicted by Maps.AbstractLinkedHashMap.evictEntry(E).
protected void	Maps.TimedLruCacheStrategy.entryEvicted(Maps.CacheMap<K,V> map, Maps.LinkedEntry<K,V> entry) Invoked when an existing entry is evicted by Maps.AbstractLinkedHashMap.evictEntry(E).
protected void	Maps.CacheMap.entryEvicted(Maps.LinkedEntry<K,V> entry) Invoked when an existing entry is evicted by Maps.AbstractLinkedHashMap.evictEntry(E), e.g., because Maps.AbstractLinkedHashMap.removeEldestEntry(E) returned true.
protected void	Maps.CacheStrategy.entryPurged(Maps.CacheMap<K,V> map, Maps.LinkedEntry<K,V> entry) Invoked when an existing entry is purged after its value has been garbage collected.
protected void	Maps.TimedLruCacheStrategy.entryPurged(Maps.CacheMap<K,V> map, Maps.LinkedEntry<K,V> entry) Invoked when an existing entry is purged after its value has been garbage collected.
protected void	Maps.CacheMap.entryPurged(Maps.LinkedEntry<K,V> entry)
protected void	Maps.CacheStrategy.entryRemoved(Maps.CacheMap<K,V> map, Maps.LinkedEntry<K,V> entry) Invoked when an existing entry is removed by a remove method of this map, of a view collection of this map, or of an iterator of a view collection of this map The Maps.CacheMap implementation never invokes Maps.CacheStrategy.entryRemoved(oracle.javatools.util.Maps.CacheMap<K, V>, oracle.javatools.util.Maps.LinkedEntry<K, V>) when entries are removed by the Maps.CacheMap.clear() method of this map, or of a view collection of this map.
protected void	Maps.TimedLruCacheStrategy.entryRemoved(Maps.CacheMap<K,V> map, Maps.LinkedEntry<K,V> entry) Invoked when an existing entry is removed by a remove method of this map, of a view collection of this map, or of an iterator of a view collection of this map The Maps.CacheMap implementation never invokes Maps.CacheStrategy.entryRemoved(oracle.javatools.util.Maps.CacheMap<K, V>, oracle.javatools.util.Maps.LinkedEntry<K, V>) when entries are removed by the Maps.CacheMap.clear() method of this map, or of a view collection of this map.
protected void	Maps.CacheMap.entryRemoved(Maps.LinkedEntry<K,V> entry)
protected boolean	Maps.CacheMap.evictEntry(Maps.LinkedEntry<K,V> entry) Evicts an existing entry from this map.
protected boolean	Maps.CacheMap.removeEldestEntry(Maps.LinkedEntry<K,V> eldest) Gets whether to evict the eldest entry from this map.
void	Maps.LinkedEntry.setAfter(Maps.LinkedEntry<K,V> after) Sets the next entry in the iteration list of the containing map.
void	Maps.StrongLinkedEntry.setAfter(Maps.LinkedEntry<K,V> after)
void	Maps.SoftLinkedEntry.setAfter(Maps.LinkedEntry<K,V> after)
void	Maps.WeakLinkedEntry.setAfter(Maps.LinkedEntry<K,V> after)
void	Maps.LinkedEntry.setBefore(Maps.LinkedEntry<K,V> before) Sets the previous entry in the iteration list of the containing map.
void	Maps.StrongLinkedEntry.setBefore(Maps.LinkedEntry<K,V> before)
void	Maps.SoftLinkedEntry.setBefore(Maps.LinkedEntry<K,V> before)
void	Maps.WeakLinkedEntry.setBefore(Maps.LinkedEntry<K,V> before)

Constructors in oracle.javatools.util with parameters of type Maps.LinkedEntry

Maps.EvictedLinkedEntry(int keyHashCode, K key, V value, Maps.LinkedEntry<K,V> next, java.lang.ref.ReferenceQueue<V> queue)

Maps.SoftLinkedEntry(int hash, K key, V value, Maps.LinkedEntry<K,V> next, java.lang.ref.ReferenceQueue<V> queue)

Maps.StrongLinkedEntry(int keyHashCode, K key, V value, Maps.LinkedEntry<K,V> next)

Maps.TimedEvictedLinkedEntry(long time, int keyHashCode, K key, V value, Maps.LinkedEntry<K,V> next, java.lang.ref.ReferenceQueue<V> queue)

Maps.TimedSoftLinkedEntry(long time, int keyHashCode, K key, V value, Maps.LinkedEntry<K,V> next, java.lang.ref.ReferenceQueue<V> queue)

Maps.TimedStrongLinkedEntry(long time, int keyHashCode, K key, V value, Maps.LinkedEntry<K,V> next)

Maps.TimedWeakLinkedEntry(long time, int keyHashCode, K key, V value, Maps.LinkedEntry<K,V> next, java.lang.ref.ReferenceQueue<V> queue)

Maps.WeakLinkedEntry(int keyHashCode, K key, V value, Maps.LinkedEntry<K,V> next, java.lang.ref.ReferenceQueue<V> queue)

Skip navigation links