LRU算法用途之广就不说了,凡是要用cache的地方都可以见到它的身影。特别是线程多,并发高,数据量大的环境下。
jdk1.5真好,在LinkedHashMap.java的源码中直接有这样的字样、“This kind of map is well-suited to building LRU caches.......The removeEldestEntry(Map.Entry) method may be overridden to impose a policy for removing stale mappings automatically when new mappings are added to the map.”
就是说自己写一下removeEldestEntry就搞定了。
以下是代码,增加的是线程安全的代码
jdk1.5真好,在LinkedHashMap.java的源码中直接有这样的字样、“This kind of map is well-suited to building LRU caches.......The removeEldestEntry(Map.Entry) method may be overridden to impose a policy for removing stale mappings automatically when new mappings are added to the map.”
就是说自己写一下removeEldestEntry就搞定了。
以下是代码,增加的是线程安全的代码
- import java.util.LinkedHashMap;
- import java.util.concurrent.locks.Lock;
- import java.util.concurrent.locks.ReentrantLock;
- public class LRULinkedHashMap<K, V> extends LinkedHashMap<K, V>
- {
- private final int maxCapacity;
- private static final float DEFAULT_LOAD_FACTOR = 0.75f;
- private final Lock lock = new ReentrantLock();
- public LRULinkedHashMap(int maxCapacity)
- {
- super(maxCapacity, DEFAULT_LOAD_FACTOR, true);
- this.maxCapacity = maxCapacity;
- }
- @Override
- protected boolean removeEldestEntry(java.util.Map.Entry<K, V> eldest)
- {
- return size() > maxCapacity;
- }
- @Override
- public V get(Object key)
- {
- try {
- lock.lock();
- return super.get(key);
- }
- finally {
- lock.unlock();
- }
- }
- @Override
- public V put(K key, V value)
- {
- try {
- lock.lock();
- return super.put(key, value);
- }
- finally {
- lock.unlock();
- }
- }
- }