PHP implement a class that implements a circular queue array, into the queue, the queue

class list {
    private $size = 100;
    private $arr = [];

    public function __construct(int $size)
    {
        if ($size > 1) {
            $this->size = $size;
        }
    }

    //入
    public function push(string $data)
    {
        if (count($this->arr) == $this->size) {
            return false;
        } else {
            $this->arr[] = $data;
            return true;
        }
    }

    //出
    public function pull()
    {
        if (empty($this->arr)) {
            return false;
        } else {
            return array_shift($this->arr);
        }
    }

    //是否为空
    public function isEmpty()
    {
        return empty($this->arr);
    }

    //长度
    public function getSize()
    {
        return count($this->arr);
    }
}