(node *LRUNode)
| 84 | } |
| 85 | |
| 86 | func (cache *LRUCache) insertInFront(node *LRUNode) { |
| 87 | cache.front.prev = node |
| 88 | node.next = cache.front |
| 89 | cache.front = node |
| 90 | } |
| 91 | |
| 92 | func (cache *LRUCache) bringNodeToFront(node *LRUNode) { |
| 93 | if node == cache.front { |