findInteractions return Iterator<Pair>

Author: dan-on

src/IntervalTree.php

@@ -46,13 +46,13 @@ public function isEmpty(): bool
     /**
      * Find nodes which intervals intersect with given interval
      * @param IntervalInterface $interval
-     * @return Iterator<Node>
+     * @return Iterator<Pair>
      */
     public function findIntersections(IntervalInterface $interval): Iterator
     {
         $searchNode = Node::withPair(new Pair($interval));
         foreach ($this->treeSearchInterval($searchNode) as $node) {
-            yield $node;
+            yield $node->getPair();
         }
     }
 

tests/IntervalTreeTest.php

@@ -44,14 +44,14 @@ public function testFindIntersections(): void
         $checkInterval = [2, 3];
         $overlappingIntervals = [[0, 2], [0, 2], [0, 3], [1, 4], [2, 3], [3, 4]];
         $intersections = $this->tree->findIntersections(NumericInterval::fromArray($checkInterval));
-        foreach ($intersections as $index => $node) {
+        foreach ($intersections as $index => $pair) {
             $overlappingInterval = NumericInterval::fromArray($overlappingIntervals[$index]);
             $overlappingValue = implode('-', $overlappingIntervals[$index]);
             self::assertTrue($overlappingInterval->equalTo(NumericInterval::fromArray([
-                $node->getPair()->getInterval()->getLow(),
-                $node->getPair()->getInterval()->getHigh(),
+                $pair->getInterval()->getLow(),
+                $pair->getInterval()->getHigh(),
             ])));
-            self::assertEquals($overlappingValue, $node->getPair()->getValue());
+            self::assertEquals($overlappingValue, $pair->getValue());
         }
     }