WS\Utils\Collections\ArrayQueue

Complexity

Total Complexity

9

Size/Duplication

Total Lines	44
Duplicated Lines	0 %

Test Coverage

Coverage

100%

Importance

Changes	2
Bugs	0	Features	0

7 Methods

Rating	Name	Duplication	Size	Complexity
A	offer()	0	3	1
A	poll()	0	8	2
A	getIndexIterator()	0	3	1
A	peek()	0	7	2
A	stream()	0	3	1
A	afterElementsSet()	0	2	1
A	afterElementAdd()	0	2	1

<?php
/**
 * @author  Igor Pomiluyko pomiluyko@worksolutions.ru
 * @license MIT
 */

namespace WS\Utils\Collections;

use RuntimeException;
use WS\Utils\Collections\Iterator\Iterator;
use WS\Utils\Collections\Iterator\IteratorFactory;

class ArrayQueue extends AbstractCollection implements Queue, IndexIterable
{
    use RemoveTraverseTrait;

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

    public function poll()
    {
        if ($this->isEmpty()) {
            throw new RuntimeException('Queue is empty');
        }

        $this->pointer--;
        return array_shift($this->elements);
    }

    public function peek()
    {
        if ($this->isEmpty()) {
            throw new RuntimeException('Queue is empty');
        }

        return $this->elements[0];
    }

    public function stream(): Stream
    {
        return new SerialStream($this);
    }

    public function getIndexIterator(): Iterator
    {
        return IteratorFactory::directSequence($this->size());
    }

    protected function afterElementAdd($element): void
    {
    }

    protected function afterElementsSet(): void
    {
    }
}