(int key, int value)
| 100 | } |
| 101 | |
| 102 | public void put(int key, int value) { |
| 103 | if (keyNodeMap.containsKey(key)) { |
| 104 | DoubleNode node = keyNodeMap.get(key); |
| 105 | node.val = value; |
| 106 | nodeList.moveNodeToTail(node); |
| 107 | } else { |
| 108 | if (keyNodeMap.size() == capacity) { |
| 109 | keyNodeMap.remove(nodeList.removeHead().key); |
| 110 | } |
| 111 | DoubleNode newNode = new DoubleNode(key, value); |
| 112 | keyNodeMap.put(key, newNode); |
| 113 | nodeList.addNode(newNode); |
| 114 | } |
| 115 | } |
| 116 | |
| 117 | } |
| 118 |
no test coverage detected