緩存接口定義

/*** 緩存接口* * @author zhi**/ public interface ICache<K, V> {/*** 添加緩存數(shù)據(jù)* * @param key* @param value*/void put(K key, V value);/*** 獲取緩存數(shù)據(jù)* * @param key* @return*/V get(K key);/*** 刪除緩存數(shù)據(jù)* * @param key* @return*/V remove(K key);/*** 清除緩存*/void clear(); }

利用LinkedHashMap實(shí)現(xiàn)

import java.util.LinkedHashMap; import java.util.Map;public class LRUCache<K, V> implements ICache<K, V> {private Map<K, V> map = null;@SuppressWarnings("serial")public LRUCache(final int maxCapacity) {map = new LinkedHashMap<K, V>(maxCapacity, 0.75f, true) {@Overrideprotected boolean removeEldestEntry(java.util.Map.Entry<K, V> eldest) {return size() > maxCapacity;}};}@Overridepublic V get(K key) {return map.get(key);}@Overridepublic synchronized void put(K key, V value) {map.put(key, value);}@Overridepublic V remove(K key) {return map.remove(key);}@Overridepublic void clear() {map.clear();} }

?利用雙鏈表實(shí)現(xiàn)

import java.util.HashMap;public class LRUCache<K, V> implements ICache<K, V> {private final int maxCapacity;private CacheItem first;private CacheItem last;private HashMap<K, CacheItem> cache;public LRUCache(final int maxCapacity) {this.maxCapacity = maxCapacity;cache = new HashMap<K, CacheItem>(maxCapacity);}@Overridepublic V get(K key) {CacheItem item = cache.get(key);if (item == null) {return null;}moveToFirst(item);return item.value;}@Overridepublic synchronized void put(K key, V value) {CacheItem item = cache.get(key);if (item != null) {item.value = value;moveToFirst(item);} else {if (cache.size() == maxCapacity) {cache.remove(last.key);last = last.pre;if (last == null) {first = null;} else {last.next = null;}}item = new CacheItem(key, value);cache.put(key, item);if (first != null) {item.next = first;first.pre = item;}first = item;if (last == null) {last = item;}}}@Overridepublic V remove(K key) {if (cache.containsKey(key)) {CacheItem item = cache.get(key);if (item.pre != null) {item.pre.next = item.next;}if (item.next != null) {item.next.pre = item.pre;}if (item == first) {first = item.next;}if (item == last) {last = item.pre;}return cache.remove(key).value;} else {return null;}}private void moveToFirst(CacheItem item) {if (item == first) {return;}if (item.next == null) {last = item.pre;}item.pre.next = item.next;item.next = first;first = item;first.pre = null;}@Overridepublic void clear() {first = last = null;cache.clear();}class CacheItem {CacheItem pre;CacheItem next;K key;V value;public CacheItem(K key, V value) {this.key = key;this.value = value;}} }

?

轉(zhuǎn)載于:https://www.cnblogs.com/zhi-leaf/p/10825553.html

總結(jié)

以上是生活随笔為你收集整理的LRU缓存简单实现的全部?jī)?nèi)容，希望文章能夠幫你解決所遇到的問(wèn)題。

如果覺(jué)得生活随笔網(wǎng)站內(nèi)容還不錯(cuò)，歡迎將生活随笔推薦給好友。