SlayerBirden\DFCodeGeneration\Util\ArrayUtils

Complexity

Total Complexity

10

Size/Duplication

Total Lines	52
Duplicated Lines	0 %

Test Coverage

Coverage

100%

Importance

Changes

0

2 Methods

Rating	Name	Duplication	Size	Complexity
A	isSequential()	0	12	3
B	merge()	0	26	7

<?php
declare(strict_types=1);

namespace SlayerBirden\DFCodeGeneration\Util;

final class ArrayUtils
{
    public static function isSequential(array $list): bool
    {
        $i = 0;
        $count = count($list);
        while (array_key_exists($i, $list)) {
            $i += 1;
            if ($i === $count) {
                return true;
            }
        }

        return false;
    }

    /**
     * Recursively merges/replaces array $a and array $b.
     *
     * If determined that $b is list, it is appended to $a and the resulting array is made unique
     * Otherwise values from $b replaces values from $a with the same keys
     *
     * @param array $a
     * @param array $b
     * @return array
     */
    public static function merge(array $a, array $b): array
    {
        if (self::isSequential($b)) {
            foreach ($b as $value) {
                $a[] = $value;
            }
            $unique = array_unique($a, SORT_REGULAR);
            if (self::isSequential($a)) {
                return array_values($unique);
            }
            return $unique;
        }

        foreach ($b as $key => $value) {
            if (array_key_exists($key, $a)) {
                if (is_array($value)) {
                    $a[$key] = self::merge($a[$key], $value);
                } else {
                    $a[$key] = $value;
                }
            } else {
                $a[$key] = $value;
            }
        }

        return $a;
    }
}