Search\PartitionSearchTest

Complexity

Total Complexity

2

Size/Duplication

Total Lines	31
Duplicated Lines	0 %

Importance

Changes	2
Bugs	0	Features	0

2 Methods

Rating	Name	Duplication	Size	Complexity
A	testSearch()	0	13	1
A	prepareKdTree()	0	10	1

<?php

namespace Search;

use KDTree\Exceptions\InvalidDimensionsCount;
use KDTree\Exceptions\InvalidPointProvided;
use KDTree\Exceptions\PointAlreadyExists;
use KDTree\Interfaces\KDTreeInterface;
use KDTree\Search\PartitionSearch;
use KDTree\Structure\KDTree;
use KDTree\Structure\PointsList;
use KDTree\ValueObject\Partition;
use KDTree\ValueObject\Point;
use PHPUnit\Framework\TestCase;

final class PartitionSearchTest extends TestCase
{
    public function testSearch(): void
    {
        $partitionSearch = new PartitionSearch($this->prepareKdTree());
        $pointsList = new PointsList(2);
        $pointsList->addPoint(new Point(80, 80))
            ->addPoint(new Point(99, 99))
            ->addPoint(new Point(70, 70))
            ->addPoint(new Point(60, 70));
        $partition = new Partition($pointsList);

        $points = $partitionSearch->find($partition);
        $this->assertCount(1, $points);
        $this->assertEquals([91, 91], $points->current()->getAxises());
    }

    /**
     * @return KDTreeInterface
     * @throws InvalidDimensionsCount|InvalidPointProvided|PointAlreadyExists
     */
    private function prepareKdTree(): KDTreeInterface
    {
        $kdTree = new KDTree(2);
        $kdTree->put(new Point(1, 1))
            ->put(new Point(3, 3))
            ->put(new Point(9, 9))
            ->put(new Point(91, 91))
            ->put(new Point(4, 4));

        return $kdTree;
    }
}