Remorhaz\JSON\Path\Runtime\Matcher\SliceElementMatcher

Complexity

Total Complexity

29

Size/Duplication

Total Lines	101
Duplicated Lines	0 %

Test Coverage

Coverage

90.2%

Importance

Changes	1
Bugs	0	Features	1

9 Methods

Rating	Name	Duplication	Size	Complexity
A	match()	0	15	5
A	__construct()	0	7	1
A	findArrayLength()	0	9	4
A	detectStart()	0	11	4
A	isInRange()	0	5	4
A	detectEnd()	0	13	6
A	isOnStep()	0	3	1
A	getIndex()	0	3	2
A	getSortIndex()	0	8	2

<?php
declare(strict_types=1);

namespace Remorhaz\JSON\Path\Runtime\Matcher;

use Remorhaz\JSON\Data\Value\ArrayValueInterface;
use function is_int;
use function iterator_count;
use function max;
use Remorhaz\JSON\Data\Value\NodeValueInterface;

final class SliceElementMatcher implements SortedChildMatcherInterface
{

    private $start;

    private $end;

    private $step;

    private $isReverse;

    public function __construct(?int $start, ?int $end, ?int $step)
    {
        $this->step = $step ?? 1;
        $this->isReverse = $this->step < 0;

        $this->start = $start;
        $this->end = $end;
    }

    public function match($address, NodeValueInterface $value, NodeValueInterface $container): bool
    {
        if (0 == $this->step || !is_int($address)) {
            return false;
        }

        $count = $this->findArrayLength($container);
        if (!isset($count)) {
            return false;
        }

        $start = $this->detectStart($count);
        $end = $this->detectEnd($count);

        return $this->isInRange($address, $start, $end) && $this->isOnStep($address, $start);
    }

    private function findArrayLength(NodeValueInterface $value): ?int
    {
        $count = $value instanceof ArrayValueInterface
            ? iterator_count($value->createChildIterator())
            : null;

        return isset($count) && $count > 0
            ? $count
            : null;
    }

    private function detectStart(int $count): int
    {
        $start = $this->start;
        if (!isset($start)) {
            $start = $this->isReverse ? -1 : 0;
        }
        if ($start < 0) {
            $start = max($start + $count, 0);
        }

        return $start;
    }

    private function detectEnd(int $count): int
    {
        $end = $this->end;
        if (!isset($end)) {
            $end = $this->isReverse ? -$count - 1 : $count;
        }
        if ($end > $count) {
            return $count;
        }

        return $end < 0
            ? max($end + $count, $this->isReverse ? -1 : 0)
            : $end;
    }

    private function isInRange(int $address, int $start, int $end): bool
    {
        return $this->isReverse
            ? $address <= $start && $address > $end
            : $address >= $start && $address < $end;
    }

    private function isOnStep(int $address, int $start): bool
    {
        return 0 == $this->getIndex($address, $start) % $this->step;
    }

    private function getIndex(int $address, int $start): int
    {
        return $this->isReverse ? $start - $address : $address - $start;
    }

    public function getSortIndex($address, NodeValueInterface $value, NodeValueInterface $container): int
    {
        $count = $this->findArrayLength($container);
        if (!isset($count)) {
            throw new Exception\AddressNotSortableException($address);
        }

        return $this->getIndex($address, $this->detectStart($count));
    }
}