iterateIntersections -> findIntersections

Author: dan-on

src/IntervalTree.php

@@ -42,11 +42,11 @@ public function isEmpty(): bool
     }
 
     /**
-     * Iterator of nodes which intervals intersect with given interval
+     * Find nodes which intervals intersect with given interval
      * @param Interval $interval
      * @return Iterator<Node>
      */
-    public function iterateIntersections(Interval $interval): Iterator
+    public function findIntersections(Interval $interval): Iterator
     {
         $searchNode = Node::withPair(new Pair($interval));
         foreach ($this->treeSearchInterval($searchNode) as $node) {
@@ -62,8 +62,8 @@ public function iterateIntersections(Interval $interval): Iterator
      */
     public function hasIntersection(Interval $interval): bool
     {
-        $nodesIterator = $this->iterateIntersections($interval);
-        return $nodesIterator->current() !== null;
+        $nodes = $this->findIntersections($interval);
+        return $nodes->current() !== null;
     }
 
     /**
@@ -74,8 +74,8 @@ public function hasIntersection(Interval $interval): bool
      */
     public function countIntersections(Interval $interval): int
     {
-        $nodesIterator = $this->iterateIntersections($interval);
-        return iterator_count($nodesIterator);
+        $nodes = $this->findIntersections($interval);
+        return iterator_count($nodes);
     }
 
     /**

tests/IntervalTreeTest.php

@@ -32,7 +32,7 @@ public function testFindAllIntersections(): void
     {
         $checkInterval = [2, 3];
         $overlappingIntervals = [[0, 2], [0, 2], [0, 3], [1, 4], [2, 3], [3, 4]];
-        $intersections = $this->tree->iterateIntersections(Interval::fromArray($checkInterval));
+        $intersections = $this->tree->findIntersections(Interval::fromArray($checkInterval));
         foreach ($intersections as $index => $node) {
             $overlappingInterval = Interval::fromArray($overlappingIntervals[$index]);
             $overlappingValue = implode('-', $overlappingIntervals[$index]);