MCPcopy Create free account
hub / github.com/algorithmzuo/algorithm-journey / put

Method put

src/class035/Code02_LRU.java:102–115  ·  view source on GitHub ↗
(int key, int value)

Source from the content-addressed store, hash-verified

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

Callers 15

mainMethod · 0.45
mainMethod · 0.45
pathSumMethod · 0.45
fMethod · 0.45
len1Method · 0.45
len2Method · 0.45
insertMethod · 0.45
incMethod · 0.45
decMethod · 0.45
insertMethod · 0.45
removeMethod · 0.45
pushMethod · 0.45

Calls 6

moveNodeToTailMethod · 0.80
removeHeadMethod · 0.80
getMethod · 0.45
sizeMethod · 0.45
removeMethod · 0.45
addNodeMethod · 0.45

Tested by

no test coverage detected