All Classes and Interfaces

Class
Description
 
Cache implementation that relies on FutureTask.
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.
This can be used to remove a specific cache entry from the cache, for better control of the caching release semantics
This is used by the cache to remove a series of entries that match this filter
Utilities for creating caches
An interface representing useful reflection utilities
 
 
Utility interface to capture generic computation of type V from type K.
This exception should be thrown from the Computable.compute(Object) method if the returned computation should NOT be kept in the cache.
 
Used for doubly linked lists with weak keys
This class contains utilities useful for any code
An implementation of GenericArrayType for those times we need to create this on the fly
This is a poor mans version of a ThreadLocal with the one major upside of a Hk2ThreadLocal.removeAll() method that can be used to remove ALL instances of all thread locals on ALL threads from any other thread.
Represents a single hybrid cache entry.
 
A logger for HK2.
A cache that contains a certain number of entries, and whose oldest accessed entries are removed when removal is necessary.
LRU Cache implementation that relies on entries that keep last hit (get/put) timestamp in order to be able to remove least recently accessed items when running out of cache capacity.
Hybrid cache that allows explicit removals of included entries as well as implicit removal of entries that have been least recently accessed.
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.
Custom MessageInterpolatorImpl for HK2
Wraps a java.lang.reflect.Method but has an equals and hashCode that honors the class hierarchy
Wrapper of methods with an equals and hashCode that makes methods hiding other methods be equal
Map from a key to multiple values.
 
 
 
Data structure concerning scope annotations
This ties the given object with the thread upon which this object is created This class can be used as the key in a hashSet if the incoming object can be used as the key in a hashSet
This class contains various utilities for ensuring java type safety
 
A cache that uses the CAR algorithm to remove entries.
Implements the CAR algorithm as found here: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.105.6057
This is a clock (if non-empty the next verb will always return a new value in a cycle) that can also get values in O(1) complexity.
Implementation of WeakHashClock as needed by the CAR algorithm
 
An implementation of the WeakHashLRU as needed by the CAR algorithm