PipeLine::insert() - Code Metrics - SlayerBirden/dataflow - Measure and Improve Code Quality continuously with Scrutinizer

PipeLine::insert() A
last analyzed 2019-09-19 12:24 UTC

↳ Parent: PipeLine

Complexity

Conditions	4
Paths	1

Size

Total Lines

Duplication

Lines	0
Ratio	0 %

Code Coverage

Tests	10
CRAP Score	4

Importance

Changes

Metric	Value
cc	4
nc	1
nop	2
dl	0
loc	15
rs	9.7666
c	0
b	0
f	0
ccs	10
cts	10
cp	1
crap	4

<?php
declare(strict_types=1);

namespace SlayerBirden\DataFlow;

class PipeLine implements PipeLineInterface, \Countable
{
    private $queue = [];
    private $pointer = 0;
    private $queueOrder = PHP_INT_MAX;

    public function current(): PipeInterface
    {
        return $this->queue[$this->pointer]['item'];
    }

    public function insert(PipeInterface $handler, int $priority = 0): void
    {
        $this->queue[] = [
            'item' => $handler,
            'p' => $priority,
            '_p' => $this->queueOrder--,
        ];
        usort($this->queue, function ($itemA, $itemB) {
            if ($itemA['p'] == $itemB['p']) {
                return ($itemA['_p'] > $itemB['_p']) ? -1 : 1;
            }

            return ($itemA['p'] > $itemB['p']) ? -1 : 1;
        });
    }

    public function next(): void
    {
        $this->pointer++;
    }

    public function valid(): bool
    {
        return isset($this->queue[$this->pointer]);
    }

    public function count(): int
    {
        return count($this->queue);
    }

    public function rewind(): void
    {
        $this->pointer = 0;
    }
}


1		<?php
2		declare(strict_types=1);
3
4		namespace SlayerBirden\DataFlow;
5
6		class PipeLine implements PipeLineInterface, \Countable
7		{
8		private $queue = [];
9		private $pointer = 0;
10		private $queueOrder = PHP_INT_MAX;
11
12	6	public function current(): PipeInterface
13		{
14	6	return $this->queue[$this->pointer]['item'];
15		}
16
17	8	public function insert(PipeInterface $handler, int $priority = 0): void
18		{
19	8	$this->queue[] = [
20	8	'item' => $handler,
21	8	'p' => $priority,
22	8	'_p' => $this->queueOrder--,
23		];
24		usort($this->queue, function ($itemA, $itemB) {
25	8	if ($itemA['p'] == $itemB['p']) {
26	5	return ($itemA['_p'] > $itemB['_p']) ? -1 : 1;
27		}
28
29	3	return ($itemA['p'] > $itemB['p']) ? -1 : 1;
30	8	});
31	8	}
32
33	5	public function next(): void
34		{
35	5	$this->pointer++;
36	5	}
37
38	4	public function valid(): bool
39		{
40	4	return isset($this->queue[$this->pointer]);
41		}
42
43	1	public function count(): int
44		{
45	1	return count($this->queue);
46		}
47
48	5	public function rewind(): void
49		{
50	5	$this->pointer = 0;
51	5	}
52		}
53

SlayerBirden / dataflow

PipeLine::insert() A last analyzed 2019-09-19 12:24 UTC

Complexity

Size

Duplication

Code Coverage

Importance

Duplication Side-by-Side

Filter issues like

PipeLine::insert() A
last analyzed 2019-09-19 12:24 UTC