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
Base trait for a caching strategy
K is the cache key V is the cache value
(Since version 1.2) This will be removed in favor of a pluggable cache in 2.0
(Since version 1.2) This will be removed in favor of a pluggable cache in 2.0
An unbounded hash-backed cache Operations on this cache execute in O(1) time
An unbounded hash-backed cache Operations on this cache execute in O(1) time
(Since version 1.2) This will be removed in favor of a pluggable cache in 2.0
(Since version 1.2) This will be removed in favor of a pluggable cache in 2.0
A Cache Strategy that completely ignores caching and always returns the input object 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
(Since version 1.2) This will be removed in favor of a pluggable cache in 2.0
A hash backed cache with a size boundary Operations on this cache may required O(N) time to execute (N = size of cache)
(Since version 1.2) This will be removed in favor of a pluggable cache in 2.0