@@ -68,8 +68,8 @@ |
||
| 68 | 68 | |
| 69 | 69 | $this->assertEquals(1, $kdTree->points()->count()); |
| 70 | 70 | $kdTree->put(new Point(1, 1)) |
| 71 | - ->put(new Point(2, 2)) |
|
| 72 | - ->put(new Point(3, 3)); |
|
| 71 | + ->put(new Point(2, 2)) |
|
| 72 | + ->put(new Point(3, 3)); |
|
| 73 | 73 | |
| 74 | 74 | $kdTree->delete(new Point(2, 2)); |
| 75 | 75 | |
@@ -94,7 +94,7 @@ |
||
| 94 | 94 | |
| 95 | 95 | private function reset(): void |
| 96 | 96 | { |
| 97 | - $this->bestDistance = (float)PHP_INT_MAX; |
|
| 97 | + $this->bestDistance = (float) PHP_INT_MAX; |
|
| 98 | 98 | $this->closestPoint = null; |
| 99 | 99 | $this->visited = 0; |
| 100 | 100 | } |
@@ -17,7 +17,7 @@ |
||
| 17 | 17 | $partitionSearch = new PartitionSearch($this->prepareKdTree()); |
| 18 | 18 | $pointsList = new PointsList(2); |
| 19 | 19 | $pointsList->addPoint(new Point(80, 80)) |
| 20 | - ->addPoint(new Point(99,99)) |
|
| 20 | + ->addPoint(new Point(99, 99)) |
|
| 21 | 21 | ->addPoint(new Point(70, 70)) |
| 22 | 22 | ->addPoint(new Point(60, 70)); |
| 23 | 23 | $partition = new Partition($pointsList); |