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

var node = cache[key];

if (!node) {

node = new DLinkedNode(key, data);

cache[key] = node;

this.addNode(node);

count++;

if (count > capacity) {

var tail = this.popTail();

delete cache[tail.key];

count--;

}

} else {

node.data = http://www.veick.cn/news/data;

this.moveToHead(node);

}

this.addNode = function(node) {

node.prev = head;

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