♻️ Refactoring code.

Author: crossoverJie

src/main/java/com/crossoverjie/actual/LRUMap.java

@@ -1,10 +1,7 @@
 package com.crossoverjie.actual;
 
-import com.sun.scenario.effect.impl.prism.PrImage;
-
 import java.util.HashMap;
 import java.util.Map;
-import java.util.concurrent.LinkedBlockingQueue;
 
 /**
  * Function:
@@ -16,8 +13,14 @@
 public class LRUMap<K, V> {
     private final Map<K, V> cacheMap = new HashMap<>();
 
-    private int queueSize;
+    /**
+     * 最大缓存大小
+     */
+    private int cacheSize;
 
+    /**
+     * 节点大小
+     */
     private int nodeCount;
 
 
@@ -31,8 +34,8 @@ public class LRUMap<K, V> {
      */
     private Node<K, V> tailer;
 
-    public LRUMap(int queueSize) {
-        this.queueSize = queueSize;
+    public LRUMap(int cacheSize) {
+        this.cacheSize = cacheSize;
         //头结点的下一个结点为空
         header = new Node<>();
         header.next = null;
@@ -125,7 +128,7 @@ private void addNode(K key, V value) {
         Node<K, V> node = new Node<>(key, value);
 
         //容量满了删除最后一个
-        if (queueSize == nodeCount) {
+        if (cacheSize == nodeCount) {
             //删除尾结点
             delTail();
 

src/test/java/com/crossoverjie/actual/LRUMapTest.java

@@ -23,6 +23,21 @@ public void put() throws Exception {
         lruMap.put("5",5) ;
         System.out.println(lruMap.toString());
     }
+    @Test
+    public void put2() throws Exception {
+        LRUMap<String,Integer> lruMap = new LRUMap(4) ;
+        lruMap.put("1",1) ;
+        lruMap.put("2",2) ;
+        lruMap.put("3",3) ;
+
+        System.out.println(lruMap.toString());
+
+        lruMap.put("4",4) ;
+        System.out.println(lruMap.toString());
+
+        lruMap.put("5",5) ;
+        System.out.println(lruMap.toString());
+    }
 
     @Test
     public void get() throws Exception {