跳跃表实现[PHP]

跳跃表的简单实现，参考redis跳跃表实现

GitHub源码

class Node
{
    private $id;
    public $value;
    public $level;
    public $forward = [];

    public function __construct($value, $level)
    {
        $this->id = uniqid();
        $this->level = $level;
        $this->value = $value;
        for ($i = 0; $i < $level; $i++) {
            $this->forward[$i] = 0;
        }
    }

    public function getID()
    {
        return $this->id;
    }
}

class SkipList
{
    private $maxLevel;
    public $nodePool = [];
    public $header;

    public function __construct($maxLevel)
    {
        $this->maxLevel = $maxLevel;
        $header = new Node(-1, $maxLevel);
        $this->addToNodePool($header->getID(), $header);
        $this->header = $header->getID();
    }

    public function addToNodePool($id, $object)
    {
        $this->nodePool[$id] = $object;
    }

    /**
     * @param $id
     * @return Node
     */
    public function getFromNodePool($id)
    {
        return isset($this->nodePool[$id]) ? $this->nodePool[$id] : null;
    }

    public function insert($value)
    {
        $visitTrace = [];

        $count = 0;

        $tmp = $this->getFromNodePool($this->header);

        for ($i = $this->maxLevel - 1; $i >= 0; $i--) {
            while ($tmp && $tmp->forward[$i]) {
                $count++;
                if ($count > 20) {
                    break;
                }
                $forward = $this->getFromNodePool($tmp->forward[$i]);

                if ($forward->value < $value) {
                    $tmp = $forward;
                } else if ($forward->value > $value) {
                    break;
                } else {
                    return false;
                }
            }
            if ($tmp) {
                $visitTrace[$i] = $tmp->getID();
            }
        }

        $level = $this->randomLevel();
        $newNode = new Node($value, $level);
        $this->addToNodePool($newNode->getID(), $newNode);

        for ($i = 0; $i < $level; $i++) {
            $trace = $this->getFromNodePool($visitTrace[$i]);
            $newNode->forward[$i] = $trace->forward[$i];
            $trace->forward[$i] = $newNode->getID();
        }

        return true;
    }

    public function find($value)
    {
        $tmp = $this->getFromNodePool($this->header);

        $count = 0;

        for ($i = $this->maxLevel - 1; $i >= 0; $i--) {
            while ($tmp && $tmp->forward[$i]) {
                $count++;
                if ($count > 20) {
                    break;
                }
                $forward = $this->getFromNodePool($tmp->forward[$i]);
                if ($forward->value < $value) {
                    $tmp = $forward;
                } else if ($forward->value > $value) {
                    break;
                } else {
                    return true;
                }
            }
        }

        return false;
    }

    private function randomLevel()
    {
        $level = 1;

        if (rand(0, 1) && $level < $this->maxLevel) {
            $level++;
        }

        return $level;
    }
}

$testData = [898888, 300, 234, 123, 333, 456, 23, 99];

$skipList = new SkipList(3);
foreach ($testData as $value) {
    $skipList->insert($value);
}

$test = [898888, 300, 234, 123, 333, 456, 23, 99, 100, 111];

foreach ($test as $value) {
    $result = $skipList->find($value);
    if (in_array($value, $testData) && in_array($value, $test)) {
        if ($result) {
            echo '正确<br>';
        } else {
            echo '错误<br>';
        }
    } else {
        if ($result) {
            echo '错误<br>';
        } else {
            echo '正确<br>';
        }
    }

}