Initx\Querabilis\Driver\InMemoryQueue

Complexity

Total Complexity

5

Size/Duplication

Total Lines	31
Duplicated Lines	0 %

Test Coverage

Coverage

100%

Importance

Changes

0

4 Methods

Rating	Name	Duplication	Size	Complexity
A	offer()	0	5	1
A	peek()	0	3	1
A	poll()	0	5	2
A	add()	0	3	1

<?php declare(strict_types=1);

namespace Initx\Querabilis\Driver;

use Initx\Querabilis\Envelope;
use Initx\Querabilis\Queue;

final class InMemoryQueue implements Queue
{
    use HasDefaultRemoveAndElement;

    /**
     * @var Envelope[]
     */
    private $items = [];

    public function add(Envelope $envelope): bool
    {
        return $this->offer($envelope);
    }

    public function offer(Envelope $envelope): bool
    {
        $this->items[] = $envelope;

        return true;
    }

    public function poll(): ?Envelope
    {
        $item = array_shift($this->items);

        return $item ?: null;
    }

    public function peek(): ?Envelope
    {
        return $this->items[0] ?? null;
    }
}