Event\ListenerQueue

Complexity

Total Complexity

8

Size/Duplication

Total Lines	66
Duplicated Lines	0 %

Coupling/Cohesion

Components	1
Dependencies	0

Test Coverage

Coverage

79.17%

Importance

Changes	1
Bugs	0	Features	0

4 Methods

Rating	Name	Duplication	Size	Complexity
A	add()	0	11	1
A	get()	0	4	1
A	eject()	0	11	3
A	lsort()	0	9	3

<?php

namespace Event;

class ListenerQueue
{
    private $listeners = [];

    /**
     * Add listener to queue with priority
     *
     * @param callable $callback
     * @param int $priority
     * @return void
     */
    public function add($callback, $priority)
    {
        $this->eject($callback);

        $this->listeners[] = [
            'callback' => $callback,
            'priority' => $priority
        ];

        $this->lsort();
    }

    /**
     * Get listeners array
     *
     * @return array
     */
    public function get()
    {
        return $this->listeners;
    }

    /**
     * Remove listener from listeners
     *
     * @param callable $callback
     * @return bool true on success false on failure
     */
    public function eject($callback)
    {
        foreach ($this->listeners as $key => $value) {
            $finded = in_array($callback, $value, true);
            if ($finded) {
                unset($this->listeners[$key]);
            }
        }

        $this->lsort();
    }

    /**
     * Sorting listeners in priority
     *
     * @return void
     */
    private function lsort()
    {
        uasort($this->listeners, function ($a, $b) {
            if ($a['priority'] == $b['priority']) {
                return 0;
            }
            return ($a['priority'] > $b['priority']) ? -1 : 1;
        });
    }
}