LRU（最近最少使用）算法原理及PHP实现( 五 )_由于内存是有限的

node.next = head.next;

head.next.prev = node;

head.next = node;

}

this.removeNode = function(node) {

var prev = node.prev;

var next = node.next;

prev.next = next;

next.prev = prev;

}

this.moveToHead = function(node) {

this.removeNode(node);

this.addNode(node);

}

this.popTail = function() {

var preNode = tail.prev;

this.removeNode(preNode);

return preNode;

LRU（最近最少使用）算法原理及PHP实现( 五 )