Sequences::find() - Code Metrics - cycle/proxy-factory - Measure and Improve Code Quality continuously with Scrutinizer

Sequences::find() B
last analyzed 2021-01-20 13:04 UTC

↳ Parent: Sequences

Complexity

Conditions	6
Paths	5

Size

Total Lines

Duplication

Lines	0
Ratio	0 %

Importance

Changes

Metric	Value
dl	0
loc	25
rs	8.8977
c	0
b	0
f	0
cc	6
nc	5
nop	2

<?php

/**
 * Spiral Framework. Cycle ProxyFactory
 *
 * @license MIT
 * @author  Valentin V (Vvval)
 */

declare(strict_types=1);

namespace Cycle\ORM\Promise\ConflictResolver;

final class Sequences
{
    /**
     * Examples:
     * [], <any> => 0
     *
     *
     * @param array $sequences
     * @param int   $originSequence
     * @return int
     */
    public function find(array $sequences, int $originSequence): int
    {
        if (empty($sequences) || $originSequence > max($sequences)) {
            return $originSequence;
        }

        $gaps = $this->skippedSequences($sequences);

        if (isset($gaps[$originSequence])) {
            return $originSequence;
        }

        //we do not add "1" as postfix: $var, $var2, $var3, etc
        unset($gaps[1]);
        if (empty($gaps)) {
            $max = max($sequences);
            if ($max === 0) {
                return 2;
            }

            return $max + 1;
        }

        return min($gaps);
    }

    /**
     * @param array $sequences
     * @return array
     */
    private function skippedSequences(array $sequences): array
    {
        $skipped = [];
        $max = max($sequences);

        for ($i = 0; $i < $max; $i++) {
            if (!in_array($i, $sequences, true)) {
                $skipped[$i] = $i;
            }
        }

        return $skipped;
    }
}


1			<?php
2
3			/**
4			* Spiral Framework. Cycle ProxyFactory
5			*
6			* @license MIT
7			* @author Valentin V (Vvval)
8			*/
9
10			declare(strict_types=1);
11
12			namespace Cycle\ORM\Promise\ConflictResolver;
13
14			final class Sequences
15			{
16			/**
17			* Examples:
18			* [], <any> => 0
19			*
20			*
21			* @param array $sequences
22			* @param int $originSequence
23			* @return int
24			*/
25			public function find(array $sequences, int $originSequence): int
26			{
27			if (empty($sequences) \|\| $originSequence > max($sequences)) {
28			return $originSequence;
29			}
30
31			$gaps = $this->skippedSequences($sequences);
32
33			if (isset($gaps[$originSequence])) {
34			return $originSequence;
35			}
36
37			//we do not add "1" as postfix: $var, $var2, $var3, etc
38			unset($gaps[1]);
39			if (empty($gaps)) {
40			$max = max($sequences);
41			if ($max === 0) {
42			return 2;
43			}
44
45			return $max + 1;
46			}
47
48			return min($gaps);
49			}
50
51			/**
52			* @param array $sequences
53			* @return array
54			*/
55			private function skippedSequences(array $sequences): array
56			{
57			$skipped = [];
58			$max = max($sequences);
59
60			for ($i = 0; $i < $max; $i++) {
61			if (!in_array($i, $sequences, true)) {
62			$skipped[$i] = $i;
63			}
64			}
65
66			return $skipped;
67			}
68			}
69

cycle / proxy-factory

Sequences::find() B last analyzed 2021-01-20 13:04 UTC

Complexity

Size

Duplication

Importance

Duplication Side-by-Side

Filter issues like

Sequences::find() B
last analyzed 2021-01-20 13:04 UTC