Atomic cache provides an atomic getOrInsert(k,v) method This cache assumes that (k,v) pair is immutable
A hash backed cache with a size boundary Operations on this cache may required O(N) time to execute (N = size of cache)
Base trait for a caching strategy
An unbounded hash-backed cache Operations on this cache execute in O(1) time
A Cache Strategy that completely ignores caching and always returns the input object Operations on this cache execute in O(1) time
Base trait for a caching strategy
K is the cache key V is the cache value