Commit e1beffa

committed

完善LRU实现

1 parent bf00483 commit e1beffaCopy full SHA for e1beffa

File tree

+26

-0

lines changed

+26

-0

lines changed

Lines changed: 8 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -26,6 +26,14 @@ public LRULinkedHashMap(int maxCapacity) {`
`26`	`26`	`this.maxCapacity = maxCapacity;`
`27`	`27`	`}`
`28`	`28`
	`29`	`+`
	`30`	`+ /**`
	`31`	`+ * LinkedHashMap自带的判断是否删除最老的元素方法,默认返回false,即不删除老数据`
	`32`	`+ * 我们要做的就是重写这个方法,当满足一定条件时删除老数据`
	`33`	`+ *`
	`34`	`+ * @param eldest 尾部元素`
	`35`	`+ * @return 是否删除尾部元素`
	`36`	`+ */`
`29`	`37`	`@Override`
`30`	`38`	`protected boolean removeEldestEntry(Map.Entry<K, V> eldest) {`
`31`	`39`	`return size() > maxCapacity;`

Lines changed: 17 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,17 @@`
	`1`	`+package com.mistray;`
	`2`	`+`
	`3`	`+/**`
	`4`	`+ * @author ZJY(MistRay)`
	`5`	`+ * @Project algorithm-study`
	`6`	`+ * @Package com.mistray`
	`7`	`+ * @create 2019年10月14日 20:39`
	`8`	`+ * @Desc`
	`9`	`+ */`
	`10`	`+public class LruExecutor {`
	`11`	`+`
	`12`	`+ public static void main(String[] args) {`
	`13`	`+ LRULinkedHashMap<String, Object> lruMap = new LRULinkedHashMap<String, Object>(8191);`
	`14`	`+ lruMap.put("111",222);`
	`15`	`+ }`
	`16`	`+}`
	`17`	`+`

Lines changed: 1 addition & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -20,6 +20,7 @@`
`20`	`20`	`* @Package com.mistray`
`21`	`21`	`* @create 2019年10月14日 20:24`
`22`	`22`	`* @Desc 读写锁`
	`23`	`+ * 逻辑: 给map加读写锁.读时加读锁,写时加写锁.`
`23`	`24`	`*/`
`24`	`25`	`public class ReadWriteMapWrapFactory {`
`25`	`26`

Comments

(0)