Nested and Inner Type Summary

Modifier and Type	Class and Description
private static class	LRUHybridCache.CacheEntryImplComparator<K, V>
public static interface	LRUHybridCache.CycleHandler< Key type. K> Should a cycle be detected during computation of a value for given key, this interface allows client code to register a callback that would get invoked in such a case.
private class	LRUHybridCache.HybridCacheEntryImpl<V1>
private class	LRUHybridCache.OriginThreadAwareFuture Helper class, that remembers the future task origin thread, so that cycles could be detected.

Field Summary

Modifier and Type	Field and Description
private final ConcurrentHashMap<K, LRUHybridCache<K, V>.OriginThreadAwareFuture>	cache
private static final Comparator<LRUHybridCache.OriginThreadAwareFuture>	COMPARATOR
private final Computable<K, HybridCacheEntry<V>>	computable
private final LRUHybridCache.CycleHandler<K>	cycleHandler
private static final LRUHybridCache.CycleHandler<Object>	EMPTY_CYCLE_HANDLER
private final int	maxCacheSize
private final ReentrantLock	prunningLock

Access	Constructor and Description
public	LRUHybridCache(int The maximum number of entries in the cache maxCacheSize, Computable<K, HybridCacheEntry<V>> The thing that can create the entry computable) Create new cache with given computable to compute values.
public	LRUHybridCache(int The maximum number of entries in the cache maxCacheSize, Computable<K, HybridCacheEntry<V>> The thing that can create the entry computable, LRUHybridCache.CycleHandler<K> What to do if a cycle is detected cycleHandler) Create new cache with given computable and cycleHandler.

Method Summary

Modifier and Type	Method and Description
public void	clear() Empty the cache.
public HybridCacheEntry<V>	compute(final K key) Implements org.glassfish.hk2.utilities.cache.Computable.compute. Defines an expensive computation to retrieve value V from key K.
public boolean	Returns: true if given key is present in the cache. containsKey(final K key) Returns true if the key has already been cached.
public HybridCacheEntry<V>	Returns: an instance of cache entry. createCacheEntry(final K cache entry key. k, final V cache entry value. v, final boolean should this entry be kept in the cache this must be set to false. dropMe) Create cache entry for given values.
public int	getMaximumCacheSize()
public void	releaseMatching(CacheKeyFilter<K> Entries in the cache that match this filter will be removed from the cache. If filter is null nothing will be removed from the cache filter) This method will remove all cache entries for which this filter matches
public void	remove(final K item key. key) Remove given item from the cache.
private void	removeLRUItem() Remove least recently used item form the cache.
public int	Returns: The current size of the cache size() Return the size of the cache

Inherited from java.lang.Object:: clone equals finalize getClass hashCode notify notifyAll toString wait wait wait

Field Detail

cache	back to summary
private final ConcurrentHashMap<K, LRUHybridCache<K, V>.OriginThreadAwareFuture> cache

COMPARATOR	back to summary
private static final Comparator<LRUHybridCache.OriginThreadAwareFuture> COMPARATOR

computable	back to summary
private final Computable<K, HybridCacheEntry<V>> computable

cycleHandler	back to summary
private final LRUHybridCache.CycleHandler<K> cycleHandler

EMPTY_CYCLE_HANDLER	back to summary
private static final LRUHybridCache.CycleHandler<Object> EMPTY_CYCLE_HANDLER

maxCacheSize	back to summary
private final int maxCacheSize

prunningLock	back to summary
private final ReentrantLock prunningLock

LRUHybridCache	back to summary
public LRUHybridCache(int maxCacheSize, Computable<K, HybridCacheEntry<V>> computable) Create new cache with given computable to compute values. Parameters maxCacheSize:int The maximum number of entries in the cache computable:Computable<K, HybridCacheEntry<V>> The thing that can create the entry Annotations @SuppressWarnings:unchecked

LRUHybridCache	back to summary
public LRUHybridCache(int maxCacheSize, Computable<K, HybridCacheEntry<V>> computable, LRUHybridCache.CycleHandler<K> cycleHandler) Create new cache with given computable and cycleHandler. Parameters maxCacheSize:int The maximum number of entries in the cache computable:Computable<K, HybridCacheEntry<V>> The thing that can create the entry cycleHandler:LRUHybridCache.CycleHandler<K> What to do if a cycle is detected

Method Detail

clear	back to summary
public void clear() Empty the cache.

compute	back to summary
public HybridCacheEntry<V> compute(final K key) Implements org.glassfish.hk2.utilities.cache.Computable.compute. Doc from org.glassfish.hk2.utilities.cache.Computable.compute. Defines an expensive computation to retrieve value V from key K. Annotations @Override

compute

back to summary

public HybridCacheEntry<V> compute(final K key)

Implements org.glassfish.hk2.utilities.cache.Computable.compute.

Doc from org.glassfish.hk2.utilities.cache.Computable.compute.

Defines an expensive computation to retrieve value V from key K.

Annotations

@Override

containsKey	back to summary
public boolean containsKey(final K key) Returns true if the key has already been cached. Returns:boolean true if given key is present in the cache.

containsKey

back to summary

public boolean containsKey(final K key)

Returns true if the key has already been cached.

Returns:boolean: true if given key is present in the cache.

createCacheEntry	back to summary
public HybridCacheEntry<V> createCacheEntry(final K k, final V v, final boolean dropMe) Create cache entry for given values. Parameters k:K cache entry key. v:V cache entry value. dropMe:boolean should this entry be kept in the cache this must be set to false. Returns:HybridCacheEntry<V> an instance of cache entry.

createCacheEntry

back to summary

public HybridCacheEntry<V> createCacheEntry(final K k, final V v, final boolean dropMe)

Create cache entry for given values.

Parameters

k:K: cache entry key.
v:V: cache entry value.
dropMe:boolean: should this entry be kept in the cache this must be set to false.

Returns:HybridCacheEntry<V>

an instance of cache entry.

getMaximumCacheSize	back to summary
public int getMaximumCacheSize()

releaseMatching	back to summary
public void releaseMatching(CacheKeyFilter<K> filter) This method will remove all cache entries for which this filter matches Parameters filter:CacheKeyFilter<K> Entries in the cache that match this filter will be removed from the cache. If filter is null nothing will be removed from the cache

releaseMatching

back to summary

public void releaseMatching(CacheKeyFilter<K> filter)

This method will remove all cache entries for which this filter matches

Parameters

filter:CacheKeyFilter<K>: Entries in the cache that match this filter will be removed from the cache. If filter is null nothing will be removed from the cache

remove	back to summary
public void remove(final K key) Remove given item from the cache. Parameters key:K item key.

remove

back to summary

public void remove(final K key)

Remove given item from the cache.

Parameters

key:K: item key.

removeLRUItem	back to summary
private void removeLRUItem() Remove least recently used item form the cache. No checks are done here. The method just tries to remove the least recently used cache item. An exception will be thrown if the cache is empty.

size	back to summary
public int size() Return the size of the cache Returns:int The current size of the cache

size

back to summary

public int size()

Return the size of the cache

Returns:int: The current size of the cache

org.glassfish.hk2.utilities.cache back to summary

private Class LRUHybridCache.CacheEntryImplComparator<K, V>

Class Inheritance

extends Object
implements Comparator<LRUHybridCache<K, V>.OriginThreadAwareFuture>

java.lang.Object
org.glassfish.hk2.utilities.cache.LRUHybridCache.CacheEntryImplComparator

All Implemented Interfaces

java.util.Comparator

Constructor Summary

Access	Constructor and Description
private	CacheEntryImplComparator()

Method Summary

Modifier and Type	Method and Description
public int	compare(LRUHybridCache<K, V>.OriginThreadAwareFuture first, LRUHybridCache<K, V>.OriginThreadAwareFuture second) Implements java.util.Comparator.compare. Compares its two arguments for order.

Inherited from java.lang.Object:: clone equals finalize getClass hashCode notify notifyAll toString wait wait wait

Constructor Detail

CacheEntryImplComparator	back to summary
private CacheEntryImplComparator()

Method Detail

compare back to summary

compare	back to summary
public int compare(LRUHybridCache<K, V>.OriginThreadAwareFuture first, LRUHybridCache<K, V>.OriginThreadAwareFuture second) Implements java.util.Comparator.compare. Doc from java.util.Comparator.compare. Compares its two arguments for order. Returns a negative integer, zero, or a positive integer as the first argument is less than, equal to, or greater than the second. The implementor must ensure that `signum(compare(x, y)) == -signum(compare(y, x))` for all `x` and `y`. (This implies that `compare(x, y)` must throw an exception if and only if `compare(y, x)` throws an exception.) The implementor must also ensure that the relation is transitive: `((compare(x, y)>0) && (compare(y, z)>0))` implies `compare(x, z)>0`. Finally, the implementor must ensure that `compare(x, y)==0` implies that `signum(compare(x, z))==signum(compare(y, z))` for all `z`. Annotations @Override

public int compare(LRUHybridCache<K, V>.OriginThreadAwareFuture first, LRUHybridCache<K, V>.OriginThreadAwareFuture second)

Implements java.util.Comparator.compare.

Doc from java.util.Comparator.compare.

Compares its two arguments for order. Returns a negative integer, zero, or a positive integer as the first argument is less than, equal to, or greater than the second.

The implementor must ensure that signum(compare(x, y)) == -signum(compare(y, x)) for all x and y. (This implies that compare(x, y) must throw an exception if and only if compare(y, x) throws an exception.)

The implementor must also ensure that the relation is transitive: ((compare(x, y)>0) && (compare(y, z)>0)) implies compare(x, z)>0.

Finally, the implementor must ensure that compare(x, y)==0 implies that signum(compare(x, z))==signum(compare(y, z)) for all z.

Annotations

@Override

org.glassfish.hk2.utilities.cache back to summary

public Interface LRUHybridCache.CycleHandler<K>

Type Parameters

<K>: Key type.

Should a cycle be detected during computation of a value for given key, this interface allows client code to register a callback that would get invoked in such a case. The cycle is defined as follows. If any thread starts computation for given key and code from the very same thread requests the computed value before the computation ends, a cycle is detected. Registered cycle handler is then given a chance to handle the cycle and throw a runtime exception if appropriate.

Method Summary

Modifier and Type	Method and Description
public void	handleCycle(K instance that caused the cycle. key) Handle cycle that was detected while computing a cache value for given key.

Method Detail

handleCycle	back to summary
public void handleCycle(K key) Handle cycle that was detected while computing a cache value for given key. This method would typically just throw a runtime exception. Parameters key:K instance that caused the cycle.

handleCycle

back to summary

public void handleCycle(K key)

Handle cycle that was detected while computing a cache value for given key. This method would typically just throw a runtime exception.

Parameters

key:K: instance that caused the cycle.

org.glassfish.hk2.utilities.cache back to summary

private final Class LRUHybridCache.HybridCacheEntryImpl<V1>

Class Inheritance

extends Object
implements HybridCacheEntry<V1>

java.lang.Object
org.glassfish.hk2.utilities.cache.LRUHybridCache.HybridCacheEntryImpl

All Implemented Interfaces

org.glassfish.hk2.utilities.cache.HybridCacheEntry, org.glassfish.hk2.utilities.cache.CacheEntry

Field Summary

Modifier and Type	Field and Description
private final boolean	dropMe
private final K	key
private final V1	value

Constructor Summary

Access	Constructor and Description
public	HybridCacheEntryImpl(K key, V1 value, boolean dropMe)

Method Summary

Modifier and Type	Method and Description
public boolean	dropMe() Implements org.glassfish.hk2.utilities.cache.HybridCacheEntry.dropMe. Tell the cache if this entry should be dropped as opposed to being kept in the cache.
public boolean	equals(Object obj) Overrides java.lang.Object.equals. Indicates whether some other object is "equal to" this one.
public V1	getValue() Implements org.glassfish.hk2.utilities.cache.HybridCacheEntry.getValue. Getter for this cache entry internal value.
public int	hashCode() Overrides java.lang.Object.hashCode. Returns a hash code value for this object.
public void	removeFromCache() Implements org.glassfish.hk2.utilities.cache.CacheEntry.removeFromCache. Call this method on this entry to remove it from the LRUCache.

Inherited from java.lang.Object:: clone finalize getClass notify notifyAll toString wait wait wait

Field Detail

dropMe	back to summary
private final boolean dropMe

key	back to summary
private final K key

value	back to summary
private final V1 value

Constructor Detail

HybridCacheEntryImpl	back to summary
public HybridCacheEntryImpl(K key, V1 value, boolean dropMe)

Method Detail

dropMe	back to summary
public boolean dropMe() Implements org.glassfish.hk2.utilities.cache.HybridCacheEntry.dropMe. Doc from org.glassfish.hk2.utilities.cache.HybridCacheEntry.dropMe. Tell the cache if this entry should be dropped as opposed to being kept in the cache. Annotations @Override

dropMe

back to summary

public boolean dropMe()

Implements org.glassfish.hk2.utilities.cache.HybridCacheEntry.dropMe.

Doc from org.glassfish.hk2.utilities.cache.HybridCacheEntry.dropMe.

Tell the cache if this entry should be dropped as opposed to being kept in the cache.

Annotations

@Override

equals back to summary

equals	back to summary
public boolean equals(Object obj) Overrides java.lang.Object.equals. Doc from java.lang.Object.equals. Indicates whether some other object is "equal to" this one. The `equals` method implements an equivalence relation on non-null object references: It is reflexive: for any non-null reference value `x`, `x.equals(x)` should return `true`. It is symmetric: for any non-null reference values `x` and `y`, `x.equals(y)` should return `true` if and only if `y.equals(x)` returns `true`. It is transitive: for any non-null reference values `x`, `y`, and `z`, if `x.equals(y)` returns `true` and `y.equals(z)` returns `true`, then `x.equals(z)` should return `true`. It is consistent: for any non-null reference values `x` and `y`, multiple invocations of `x.equals(y)` consistently return `true` or consistently return `false`, provided no information used in `equals` comparisons on the objects is modified. For any non-null reference value `x`, `x.equals(null)` should return `false`. An equivalence relation partitions the elements it operates on into equivalence classes; all the members of an equivalence class are equal to each other. Members of an equivalence class are substitutable for each other, at least for some purposes. Annotations @SuppressWarnings:unchecked @Override

public boolean equals(Object obj)

Overrides java.lang.Object.equals.

Doc from java.lang.Object.equals.

Indicates whether some other object is "equal to" this one.

The equals method implements an equivalence relation on non-null object references:

It is reflexive: for any non-null reference value x, x.equals(x) should return true.
It is symmetric: for any non-null reference values x and y, x.equals(y) should return true if and only if y.equals(x) returns true.
It is transitive: for any non-null reference values x, y, and z, if x.equals(y) returns true and y.equals(z) returns true, then x.equals(z) should return true.
It is consistent: for any non-null reference values x and y, multiple invocations of x.equals(y) consistently return true or consistently return false, provided no information used in equals comparisons on the objects is modified.
For any non-null reference value x, x.equals(null) should return false.

An equivalence relation partitions the elements it operates on into equivalence classes; all the members of an equivalence class are equal to each other. Members of an equivalence class are substitutable for each other, at least for some purposes.

Annotations

@SuppressWarnings:unchecked
@Override

getValue	back to summary
public V1 getValue() Implements org.glassfish.hk2.utilities.cache.HybridCacheEntry.getValue. Doc from org.glassfish.hk2.utilities.cache.HybridCacheEntry.getValue. Getter for this cache entry internal value. Annotations @Override

getValue

back to summary

public V1 getValue()

Implements org.glassfish.hk2.utilities.cache.HybridCacheEntry.getValue.

Doc from org.glassfish.hk2.utilities.cache.HybridCacheEntry.getValue.

Getter for this cache entry internal value.

Annotations

@Override

hashCode back to summary

hashCode	back to summary
public int hashCode() Overrides java.lang.Object.hashCode. Doc from java.lang.Object.hashCode. Returns a hash code value for this object. This method is supported for the benefit of hash tables such as those provided by `java.util.HashMap`. The general contract of `hashCode` is: Whenever it is invoked on the same object more than once during an execution of a Java application, the `hashCode` method must consistently return the same integer, provided no information used in `equals` comparisons on the object is modified. This integer need not remain consistent from one execution of an application to another execution of the same application. If two objects are equal according to the `equals` method, then calling the `hashCode` method on each of the two objects must produce the same integer result. It is not required that if two objects are unequal according to the `equals` method, then calling the `hashCode` method on each of the two objects must produce distinct integer results. However, the programmer should be aware that producing distinct integer results for unequal objects may improve the performance of hash tables. Annotations @Override

public int hashCode()

Overrides java.lang.Object.hashCode.

Doc from java.lang.Object.hashCode.

Returns a hash code value for this object. This method is supported for the benefit of hash tables such as those provided by java.util.HashMap.

The general contract of hashCode is:

Whenever it is invoked on the same object more than once during an execution of a Java application, the hashCode method must consistently return the same integer, provided no information used in equals comparisons on the object is modified. This integer need not remain consistent from one execution of an application to another execution of the same application.
If two objects are equal according to the equals method, then calling the hashCode method on each of the two objects must produce the same integer result.
It is not required that if two objects are unequal according to the equals method, then calling the hashCode method on each of the two objects must produce distinct integer results. However, the programmer should be aware that producing distinct integer results for unequal objects may improve the performance of hash tables.

Annotations

@Override

removeFromCache	back to summary
public void removeFromCache() Implements org.glassfish.hk2.utilities.cache.CacheEntry.removeFromCache. Doc from org.glassfish.hk2.utilities.cache.CacheEntry.removeFromCache. Call this method on this entry to remove it from the LRUCache. If this entry has already been removed this method will do nothing. Annotations @Override

removeFromCache

back to summary

public void removeFromCache()

Implements org.glassfish.hk2.utilities.cache.CacheEntry.removeFromCache.

Doc from org.glassfish.hk2.utilities.cache.CacheEntry.removeFromCache.

Call this method on this entry to remove it from the LRUCache. If this entry has already been removed this method will do nothing.

Annotations

@Override

org.glassfish.hk2.utilities.cache back to summary

private Class LRUHybridCache.OriginThreadAwareFuture

Class Inheritance

extends Object
implements Future<HybridCacheEntry<V>>

java.lang.Object
org.glassfish.hk2.utilities.cache.LRUHybridCache.OriginThreadAwareFuture

All Implemented Interfaces

java.util.concurrent.Future

Helper class, that remembers the future task origin thread, so that cycles could be detected.

Field Summary

Modifier and Type	Field and Description
private final FutureTask<HybridCacheEntry<V>>	future
private final K	key
private volatile long	lastHit
private volatile long	threadId

Constructor Summary

Access	Constructor and Description
pack-priv	OriginThreadAwareFuture(LRUHybridCache<K, HybridCacheEntry<V>> cache, final K key)

Method Summary

Modifier and Type	Method and Description
public boolean	cancel(boolean mayInterruptIfRunning) Implements java.util.concurrent.Future.cancel. Attempts to cancel execution of this task.
public boolean	equals(Object obj) Overrides java.lang.Object.equals. Indicates whether some other object is "equal to" this one.
public HybridCacheEntry<V>	get() Implements java.util.concurrent.Future.get. Waits if necessary for the computation to complete, and then retrieves its result.
public HybridCacheEntry<V>	get(long timeout, TimeUnit unit) Implements java.util.concurrent.Future.get. Waits if necessary for at most the given time for the computation to complete, and then retrieves its result, if available.
public int	hashCode() Overrides java.lang.Object.hashCode. Returns a hash code value for this object.
public boolean	isCancelled() Implements java.util.concurrent.Future.isCancelled. Returns `true` if this task was cancelled before it completed normally.
public boolean	isDone() Implements java.util.concurrent.Future.isDone. Returns `true` if this task completed.
public void	run()

Inherited from java.lang.Object:: clone finalize getClass notify notifyAll toString wait wait wait

Field Detail

future	back to summary
private final FutureTask<HybridCacheEntry<V>> future

key	back to summary
private final K key

lastHit	back to summary
private volatile long lastHit

threadId	back to summary
private volatile long threadId

Constructor Detail

OriginThreadAwareFuture	back to summary
pack-priv OriginThreadAwareFuture(LRUHybridCache<K, HybridCacheEntry<V>> cache, final K key)

Method Detail

cancel back to summary

cancel	back to summary
public boolean cancel(boolean mayInterruptIfRunning) Implements java.util.concurrent.Future.cancel. Doc from java.util.concurrent.Future.cancel. Attempts to cancel execution of this task. This method has no effect if the task is already completed or cancelled, or could not be cancelled for some other reason. Otherwise, if this task has not started when `cancel` is called, this task should never run. If the task has already started, then the `mayInterruptIfRunning` parameter determines whether the thread executing this task (when known by the implementation) is interrupted in an attempt to stop the task. The return value from this method does not necessarily indicate whether the task is now cancelled; use `isCancelled`. Annotations @Override

public boolean cancel(boolean mayInterruptIfRunning)

Implements java.util.concurrent.Future.cancel.

Doc from java.util.concurrent.Future.cancel.

Attempts to cancel execution of this task. This method has no effect if the task is already completed or cancelled, or could not be cancelled for some other reason. Otherwise, if this task has not started when cancel is called, this task should never run. If the task has already started, then the mayInterruptIfRunning parameter determines whether the thread executing this task (when known by the implementation) is interrupted in an attempt to stop the task.

The return value from this method does not necessarily indicate whether the task is now cancelled; use isCancelled.

Annotations

@Override

equals back to summary

equals	back to summary
public boolean equals(Object obj) Overrides java.lang.Object.equals. Doc from java.lang.Object.equals. Indicates whether some other object is "equal to" this one. The `equals` method implements an equivalence relation on non-null object references: It is reflexive: for any non-null reference value `x`, `x.equals(x)` should return `true`. It is symmetric: for any non-null reference values `x` and `y`, `x.equals(y)` should return `true` if and only if `y.equals(x)` returns `true`. It is transitive: for any non-null reference values `x`, `y`, and `z`, if `x.equals(y)` returns `true` and `y.equals(z)` returns `true`, then `x.equals(z)` should return `true`. It is consistent: for any non-null reference values `x` and `y`, multiple invocations of `x.equals(y)` consistently return `true` or consistently return `false`, provided no information used in `equals` comparisons on the objects is modified. For any non-null reference value `x`, `x.equals(null)` should return `false`. An equivalence relation partitions the elements it operates on into equivalence classes; all the members of an equivalence class are equal to each other. Members of an equivalence class are substitutable for each other, at least for some purposes. Annotations @SuppressWarnings:unchecked, rawtypes @Override

public boolean equals(Object obj)

Overrides java.lang.Object.equals.

Doc from java.lang.Object.equals.

Indicates whether some other object is "equal to" this one.

The equals method implements an equivalence relation on non-null object references:

It is reflexive: for any non-null reference value x, x.equals(x) should return true.
It is symmetric: for any non-null reference values x and y, x.equals(y) should return true if and only if y.equals(x) returns true.
It is transitive: for any non-null reference values x, y, and z, if x.equals(y) returns true and y.equals(z) returns true, then x.equals(z) should return true.
It is consistent: for any non-null reference values x and y, multiple invocations of x.equals(y) consistently return true or consistently return false, provided no information used in equals comparisons on the objects is modified.
For any non-null reference value x, x.equals(null) should return false.

Annotations

@SuppressWarnings:unchecked, rawtypes
@Override

get

back to summary

public HybridCacheEntry<V> get() throws InterruptedException, ExecutionException

Implements java.util.concurrent.Future.get.

Doc from java.util.concurrent.Future.get.

Waits if necessary for the computation to complete, and then retrieves its result.

Annotations

@Override

Exceptions

InterruptedException:: if the current thread was interrupted while waiting
ExecutionException:: if the computation threw an exception

get

back to summary

public HybridCacheEntry<V> get(long timeout, TimeUnit unit) throws InterruptedException, ExecutionException, TimeoutException

Implements java.util.concurrent.Future.get.

Doc from java.util.concurrent.Future.get.

Waits if necessary for at most the given time for the computation to complete, and then retrieves its result, if available.

Annotations

@Override

Exceptions

InterruptedException:: if the current thread was interrupted while waiting
ExecutionException:: if the computation threw an exception
TimeoutException:: if the wait timed out

hashCode back to summary

public int hashCode()

Overrides java.lang.Object.hashCode.

Doc from java.lang.Object.hashCode.

Returns a hash code value for this object. This method is supported for the benefit of hash tables such as those provided by java.util.HashMap.

The general contract of hashCode is:

Whenever it is invoked on the same object more than once during an execution of a Java application, the hashCode method must consistently return the same integer, provided no information used in equals comparisons on the object is modified. This integer need not remain consistent from one execution of an application to another execution of the same application.
If two objects are equal according to the equals method, then calling the hashCode method on each of the two objects must produce the same integer result.
It is not required that if two objects are unequal according to the equals method, then calling the hashCode method on each of the two objects must produce distinct integer results. However, the programmer should be aware that producing distinct integer results for unequal objects may improve the performance of hash tables.

Annotations

@Override

isCancelled back to summary

public boolean isCancelled()

Implements java.util.concurrent.Future.isCancelled.

Doc from java.util.concurrent.Future.isCancelled.

Returns true if this task was cancelled before it completed normally.

Annotations

@Override

isDone back to summary

public boolean isDone()

Implements java.util.concurrent.Future.isDone.

Doc from java.util.concurrent.Future.isDone.

Returns true if this task completed. Completion may be due to normal termination, an exception, or cancellation -- in all of these cases, this method will return true.

Annotations

@Override

run	back to summary
public void run()

public Class LRUHybridCache<K, V>

Nested and Inner Type Summary

Field Summary

Constructor Summary

Method Summary

Field Detail

Constructor Detail

Method Detail

private Class LRUHybridCache.CacheEntryImplComparator<K, V>

Constructor Summary

Method Summary

Constructor Detail

Method Detail

public Interface LRUHybridCache.CycleHandler<K>

Method Summary

Method Detail

private final Class LRUHybridCache.HybridCacheEntryImpl<V1>

Field Summary

Constructor Summary

Method Summary

Field Detail

Constructor Detail

Method Detail

private Class LRUHybridCache.OriginThreadAwareFuture

Field Summary

Constructor Summary

Method Summary

Field Detail

Constructor Detail

Method Detail