Cycle\ORM\Promise\ConflictResolver\Sequences

Complexity

Total Complexity

9

Size/Duplication

Total Lines	55
Duplicated Lines	0 %

Coupling/Cohesion

Components	0
Dependencies	0

Importance

Changes

0

2 Methods

Rating	Name	Duplication	Size	Complexity
B	find()	0	25	6
A	skippedSequences()	0	13	3

<?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;
    }
}