KDTreeTest::testPut() - Code Metrics - Inspection of "KDTreeTest" - f1r3starter/kdtree - Measure and Improve Code Quality continuously with Scrutinizer

Passed

Push — master ( 645ae2...0beaa6 )

by Andrii

created 2019-12-24 18:46 UTC

KDTreeTest::testPut() A

↳ Parent: KDTreeTest

Complexity

Conditions	1
Paths	1

Size

Total Lines	13
Code Lines	9

Duplication

Lines	0
Ratio	0 %

Importance

Changes	1
Bugs	0	Features	0

Metric	Value
cc	1
eloc	9
c	1
b	0
f	0
nc	1
nop	0
dl	0
loc	13
rs	9.9666

<?php

namespace Structure;

use KDTree\Exceptions\InvalidDimensionsCount;
use KDTree\Exceptions\PointAlreadyExists;
use KDTree\Structure\KDTree;
use KDTree\ValueObject\Point;
use PHPUnit\Framework\TestCase;

class KDTreeTest extends TestCase
{
    public function testEmptyConstruction(): void
    {
        $dimensions = 2;
        $kdTree = new KDTree($dimensions);

        $this->assertEquals(0, $kdTree->size());
        $this->assertTrue($kdTree->isEmpty());
        $this->assertEquals($dimensions, $kdTree->getDimensions());
        $this->assertNull($kdTree->getRoot());
    }

    public function testInvalidDimensionsCount()
    {
        $this->expectException(InvalidDimensionsCount::class);
        new KDTree(0);
    }

    public function testPut(): void
    {
        $point = new Point(1, 1);
        $kdTree = new KDTree(2);
        $kdTree->put($point);

        $this->assertTrue($kdTree->contains($point));
        $this->assertEquals(1, $kdTree->size());
        $this->assertEquals($point, $kdTree->points()->current());
        $this->assertEquals($point, $kdTree->getRoot()->getPoint());

        $this->expectException(PointAlreadyExists::class);
        $kdTree->put($point);
    }

    public function testDelete(): void
    {
        $point = new Point(1, 1);
        $kdTree = new KDTree(2);
        $kdTree->put($point);
        $kdTree->delete($point);

        $this->assertFalse($kdTree->contains($point));
    }
}


1			<?php
2
3			namespace Structure;
4
5			use KDTree\Exceptions\InvalidDimensionsCount;
6			use KDTree\Exceptions\PointAlreadyExists;
7			use KDTree\Structure\KDTree;
8			use KDTree\ValueObject\Point;
9			use PHPUnit\Framework\TestCase;
10
11			class KDTreeTest extends TestCase
12			{
13			public function testEmptyConstruction(): void
14			{
15			$dimensions = 2;
16			$kdTree = new KDTree($dimensions);
17
18			$this->assertEquals(0, $kdTree->size());
19			$this->assertTrue($kdTree->isEmpty());
20			$this->assertEquals($dimensions, $kdTree->getDimensions());
21			$this->assertNull($kdTree->getRoot());
22			}
23
24			public function testInvalidDimensionsCount()
25			{
26			$this->expectException(InvalidDimensionsCount::class);
27			new KDTree(0);
28			}
29
30			public function testPut(): void
31			{
32			$point = new Point(1, 1);
33			$kdTree = new KDTree(2);
34			$kdTree->put($point);
35
36			$this->assertTrue($kdTree->contains($point));
37			$this->assertEquals(1, $kdTree->size());
38			$this->assertEquals($point, $kdTree->points()->current());
39			$this->assertEquals($point, $kdTree->getRoot()->getPoint());
40
41			$this->expectException(PointAlreadyExists::class);
42			$kdTree->put($point);
43			}
44
45			public function testDelete(): void
46			{
47			$point = new Point(1, 1);
48			$kdTree = new KDTree(2);
49			$kdTree->put($point);
50			$kdTree->delete($point);
51
52			$this->assertFalse($kdTree->contains($point));
53			}
54			}
55

f1r3starter / kdtree

Push — master ( 645ae2...0beaa6 )

KDTreeTest::testPut() A

Complexity

Size

Duplication

Importance

Duplication Side-by-Side

Filter issues like