SequenceTest::findProvider() - Code Metrics - Inspection of "Change namespaces" - cycle/proxy-factory - Measure and Improve Code Quality continuously with Scrutinizer

Passed

Push — master ( d3a94c...76e109 )

by Valentin

created 2019-03-04 13:40 UTC

SequenceTest::findProvider() A

↳ Parent: SequenceTest

Complexity

Conditions	1
Paths	1

Size

Total Lines

Duplication

Lines	0
Ratio	0 %

Importance

Changes

Metric	Value
dl	0
loc	18
rs	9.6666
c	0
b	0
f	0
cc	1
nc	1
nop	0

<?php
declare(strict_types=1);

namespace Cycle\ORM\Promise\Tests\Declaration\ConflictResolver;

use Cycle\ORM\Promise\ConflictResolver\Sequences;
use PHPUnit\Framework\TestCase;
use Spiral\Core\Container;

class SequenceTest extends TestCase
{
    /**
     * @dataProvider findProvider
     *
     * @param array $sequence
     * @param int   $pos
     * @param int   $expected
     */
    public function testFind(array $sequence, int $pos, int $expected)
    {
        $this->assertEquals($expected, $this->sequences()->find($sequence, $pos));
    }

    public function findProvider(): array
    {
        return [
            // empty input
            [[], 5, 5],
            // in the gap (not taken)
            [[3, 4, 8, 9,], 6, 6],
            [[3, 4, 8, 9,], 1, 1],
            // in the sequence (taken)
            [[3, 4, 8, 9,], 4, 0],
            [[0, 1, 4, 5,], 5, 2],
            // do not use "1"
            [[0, 3, 4, 8,], 4, 2],
            // full sequence, take next
            [[0, 1, 2, 3,], 3, 4],
            [[0], 0, 2],
        ];
    }

    private function sequences(): Sequences
    {
        $container = new Container();

        return $container->get(Sequences::class);
    }
}

1			<?php
2			declare(strict_types=1);
3
4			namespace Cycle\ORM\Promise\Tests\Declaration\ConflictResolver;
5
6			use Cycle\ORM\Promise\ConflictResolver\Sequences;
7			use PHPUnit\Framework\TestCase;
8			use Spiral\Core\Container;
9
10			class SequenceTest extends TestCase
11			{
12			/**
13			* @dataProvider findProvider
14			*
15			* @param array $sequence
16			* @param int $pos
17			* @param int $expected
18			*/
19			public function testFind(array $sequence, int $pos, int $expected)
20			{
21			$this->assertEquals($expected, $this->sequences()->find($sequence, $pos));
22			}
23
24			public function findProvider(): array
25			{
26			return [
27			// empty input
28			[[], 5, 5],
29			// in the gap (not taken)
30			[[3, 4, 8, 9,], 6, 6],
31			[[3, 4, 8, 9,], 1, 1],
32			// in the sequence (taken)
33			[[3, 4, 8, 9,], 4, 0],
34			[[0, 1, 4, 5,], 5, 2],
35			// do not use "1"
36			[[0, 3, 4, 8,], 4, 2],
37			// full sequence, take next
38			[[0, 1, 2, 3,], 3, 4],
39			[[0], 0, 2],
40			];
41			}
42
43			private function sequences(): Sequences
44			{
45			$container = new Container();
46
47			return $container->get(Sequences::class);
48			}
49			}

cycle / proxy-factory

Push — master ( d3a94c...76e109 )

SequenceTest::findProvider() A

Complexity

Size

Duplication

Importance

Duplication Side-by-Side

Filter issues like