Sauls\Component\Helper\Operation\ArrayOperation\Merge

Complexity

Total Complexity

12

Size/Duplication

Total Lines	42
Duplicated Lines	0 %

Test Coverage

Coverage

100%

Importance

Changes

0

5 Methods

Rating	Name	Duplication	Size	Complexity
A	mergeCurrentArrayValues()	0	8	3
A	execute()	0	9	2
A	canMergeArrayValue()	0	3	3
A	mergeIntegerKeyValue()	0	6	2
A	mergeNextArray()	0	4	2

<?php
/**
 * This file is part of the sauls/helpers package.
 *
 * @author    Saulius Vaičeliūnas <vaiceliunas@inbox.lt>
 * @link      http://saulius.vaiceliunas.lt
 * @copyright 2018
 *
 * For the full copyright and license information, please view the LICENSE
 * file that was distributed with this source code.
 */

namespace Sauls\Component\Helper\Operation\ArrayOperation;

class Merge implements MergeInterface
{
    public function execute(... $arrays): array
    {
        $result = \array_shift($arrays);
        while (!empty($arrays)) {
            $nextArray = \array_shift($arrays);
            $this->mergeNextArray($nextArray, $result);
        }

        return $result;
    }

    private function mergeNextArray(array $nextArray, &$result): void
    {
        foreach ($nextArray as $key => $value) {
            $this->mergeCurrentArrayValues($key, $value, $result);
        }
    }

    private function mergeCurrentArrayValues($key, $value, &$result): void
    {
        if (\is_int($key)) {
            $this->mergeIntegerKeyValue($key, $value, $result);
        } elseif ($this->canMergeArrayValue($key, $value, $result)) {
            $result[$key] = $this->execute($result[$key], $value);
        } else {
            $result[$key] = $value;
        }
    }

    private function canMergeArrayValue($key, $value, $result): bool
    {
        return \is_array($value) && isset($result[$key]) && \is_array($result[$key]);
    }

    private function mergeIntegerKeyValue($key, $value, &$result): void
    {
        if (\array_key_exists($key, $result)) {
            $result[] = $value;
        } else {
            $result[$key] = $value;
        }
    }
}