Module id.xfunction

Class CacheQueue<T>

Object
CacheQueue<T>
All Implemented Interfaces:
Iterable<T>, Collection<T>

public class CacheQueue<T> extends Object implements Collection<T>
Cache implementation in form of a FIFO queue which caches only N last added items. Ordinary Queue does not delete elements automatically - this cache does.

It is based on LinkedHashMap (and relies on LinkedHashMap.removeEldestEntry(java.util.Map.Entry<K, V>)) so all LinkedHashMap properties applies to CacheQueue.