KDTree\Search\PartitionSearch

Complexity

Total Complexity

5

Size/Duplication

Total Lines	46
Duplicated Lines	0 %

Importance

Changes	2
Bugs	0	Features	2

3 Methods

Rating	Name	Duplication	Size	Complexity
A	partitionAdd()	0	12	3
A	find()	0	6	1
A	__construct()	0	3	1

<?php

declare(strict_types=1);

namespace KDTree\Search;

use KDTree\Exceptions\InvalidDimensionsCount;
use KDTree\Interfaces\{KDTreeInterface,
    NodeInterface,
    PartitionInterface,
    PartitionSearchInterface,
    PointInterface,
    PointsListInterface};
use KDTree\Structure\PointsList;

/**
 * Class PartitionSearch
 *
 * @package KDTree\Search
 */
final class PartitionSearch implements PartitionSearchInterface
{
    /**
     * @var KDTreeInterface
     */
    private $tree;

    /**
     * @param KDTreeInterface $tree
     */
    public function __construct(KDTreeInterface $tree)
    {
        $this->tree = $tree;
    }

    /**
     * @param PartitionInterface $partition
     *
     * @return PointsListInterface<PointInterface>
     * @throws InvalidDimensionsCount
     */
    public function find(PartitionInterface $partition): PointsListInterface
    {
        $pointsList = new PointsList($this->tree->getDimensions());
        $this->partitionAdd($this->tree->getRoot(), $partition, $pointsList);

        return $pointsList;
    }

    /**
     * @param NodeInterface|null                  $node
     * @param PartitionInterface                  $partition
     * @param PointsListInterface<PointInterface> $pointsList
     */
    private function partitionAdd(
        ?NodeInterface $node,
        PartitionInterface $partition,
        PointsListInterface $pointsList
    ): void {
        if (null !== $node) {
            if ($partition->contains($node->getPoint())) {
                $pointsList->addPoint($node->getPoint());
            }

            $this->partitionAdd($node->getLeft(), $partition, $pointsList);
            $this->partitionAdd($node->getRight(), $partition, $pointsList);
        }
    }
}