chillerlan\HTTP\Psr15\PriorityQueueDispatcher

Complexity

Total Complexity

7

Size/Duplication

Total Lines	48
Duplicated Lines	0 %

Importance

Changes	1
Bugs	0	Features	0

3 Methods

Rating	Name	Duplication	Size	Complexity
A	addStack()	0	18	4
A	add()	0	11	2
A	sortMiddleware()	0	4	1

<?php
/**
 * Class PriorityQueueDispatcher
 *
 * @link https://github.com/libreworks/caridea-dispatch
 *
 * @filesource   PriorityQueueDispatcher.php
 * @created      10.03.2019
 * @package      chillerlan\HTTP\Psr15
 * @author       smiley <smiley@chillerlan.net>
 * @copyright    2019 smiley
 * @license      MIT
 */

namespace chillerlan\HTTP\Psr15;

use Psr\Http\Server\MiddlewareInterface;

use function usort;

class PriorityQueueDispatcher extends QueueDispatcher{

	/**
	 * @inheritDoc
	 */
	public function addStack(iterable $middlewareStack):QueueDispatcher{

		foreach($middlewareStack as $middleware){

			if(!$middleware instanceof MiddlewareInterface){
				throw new MiddlewareException('invalid middleware');
			}

			if(!$middleware instanceof PriorityMiddlewareInterface){
				$middleware = new PriorityMiddleware($middleware);
			}

			$this->middlewareStack[] = $middleware;
		}

		$this->sortMiddleware();

		return $this;
	}

	/**
	 * @inheritDoc
	 */
	public function add(MiddlewareInterface $middleware):QueueDispatcher{

		if(!$middleware instanceof PriorityMiddlewareInterface){
			$middleware = new PriorityMiddleware($middleware);
		}

		$this->middlewareStack[] = $middleware;

		$this->sortMiddleware();

		return $this;
	}

	/**
	 *
	 */
	protected function sortMiddleware():void{
		usort(
			$this->middlewareStack,
			fn(PriorityMiddlewareInterface $a, PriorityMiddlewareInterface $b) => $b->getPriority() <=> $a->getPriority()
		);
	}

}