PHP實(shí)現(xiàn)LRU算法的原理詳解

更新時(shí)間：2022年03月27日 17:14:44 作者：php_kevlin

這篇文章主要為大家詳細(xì)介紹了PHP實(shí)現(xiàn)LRU算法的原理，文中示例代碼介紹的非常詳細(xì)，具有一定的參考價(jià)值，感興趣的小伙伴們可以參考一下，希望能夠給你帶來幫助

1.概念

LRU ：最近最少使用算法

2.代碼

<?php
class Node
{
    public $preKey = null; //鏈表前一個(gè)節(jié)點(diǎn)
    public $nextKey = null;  //鏈表后一個(gè)節(jié)點(diǎn)
    public $key= null;      //當(dāng)前的值
    public $value= null;    //當(dāng)前key

    public function __construct($key,$value){
        $this->key = $key;
        $this->value = $value;
    }

    public function setPre($preKey)
    {
        $this->preKey = $preKey;
    }

    public function setNext($nextKey)
    {
        $this->nextKey = $nextKey;
    }
}

class LRUCache{
    public $cacheTable = [];
    /** Node null  */
    private $headNode = null;
    private $lastNode = null;
    private $cacheCount = 0;
    private $cacheMax = 3;

    public function addNode($key,$value)  //此處采用頭插法
    {
        $addNode = new Node($key,$value);
        if ( !empty($this->headNode))
        {
            $this->headNode->preKey = $addNode; //如果鏈表存在，將節(jié)點(diǎn)添加到節(jié)點(diǎn)前一個(gè)
        }
        $addNode->nextKey = $this->headNode;

        //第一次保存最后一個(gè)節(jié)點(diǎn)為頭結(jié)點(diǎn)
        if ($this->lastNode == null){
            $this->lastNode = $addNode;
        }

        $this->headNode = $addNode;
        $this->cacheTable[$key] = $addNode;
        $this->cacheCount++;

    }

    public function set($key,$value)
    {
        //先判斷是否需要刪除
        $this->shiftNode();
        $this->addNode($key,$value);
        return true;
    }

    //自動刪除
    public function shiftNode()
    {
        while ($this->cacheCount >= $this->cacheMax){
            if (!empty($this->lastNode)){
                if ($this->lastNode->preKey){
                    $this->lastNode->preKey->nextKey = null;
                    $this->lastNode = $this->lastNode->preKey;
                }

                unset($this->cacheTable[$this->lastNode->key]);
            }
            $this->cacheCount --;
        }
    }

    public function dumpAllData()
    {
        $node = $this->headNode;
        while (($node)){
            echo "key=".$node->key."value=".$node->value."\n";
            $node = $node->nextKey;
        }
    }

}


$Cache = new LRUCache();
$Cache->set("a","aaaaaaaaaaa");
$Cache->set("b","bbbbbbbbbbb");
$Cache->set("c","ccccccccccc");
$Cache->set("d","dddddddddddd");
$Cache->set("e","eeeeeeeeeeee");
//$Cache->set("f","ffffffffffff");
$Cache->dumpAllData();
//var_dump($Cache);  //是一個(gè)深度的數(shù)組（對象）

結(jié)果