Indatus\Dispatcher\Queue

Complexity

Total Complexity

3

Size/Duplication

Total Lines	37
Duplicated Lines	0 %

Coupling/Cohesion

Components	1
Dependencies	0

Test Coverage

Coverage

100%

Importance

Changes

0

3 Methods

Rating	Name	Duplication	Size	Complexity
A	add()	0	6	1
A	size()	0	4	1
A	flush()	0	7	1

<?php namespace Indatus\Dispatcher;

/**
 * This file is part of Dispatcher
 *
 * (c) Ben Kuhl <bkuhl@indatus.com>
 *
 * For the full copyright and license information, please view the LICENSE
 * file that was distributed with this source code.
 */

class Queue
{
    /** @var QueueItem[] */
    protected $queue = [];

    /**
     * Add an item to the queue
     * @param QueueItem $item
     */
    public function add(QueueItem $item)
    {
        $this->queue[] = $item;

        return true;
    }

    /**
     * The size of the queue
     * @return int
     */
    public function size()
    {
        return count($this->queue);
    }

    /**
     * Get all items in the queue
     * @return QueueItem[]
     */
    public function flush()
    {
        $queue = $this->queue;
        $this->queue = [];

        return $queue;
    }
}