rewrite code for using iterators

Author: dan-on

examples/index.php

@@ -2,6 +2,8 @@
 require_once 'vendor/autoload.php';
 
 use Danon\IntervalTree\IntervalTree;
+use Danon\IntervalTree\Interval;
+use Danon\IntervalTree\Node;
 
 $tree = new IntervalTree();
 $intervals = [[6,8],[1,4],[2,3],[5,12],[1,1],[3,5],[5,7]];
@@ -15,11 +17,30 @@
 $sorted_intervals = $tree->getKeys(); //  expected array [[1,1],[1,4],[5,7],[5,12],[6,8]]
 
 // Search items which keys intersect with given interval, and return array of values
-$valuesInRange = $tree->search([2,3], function($value, $key) {
-    return $value;
-});
+$valuesInRange = $tree->iterateIntersections([2,3]);
 
-print_r($valuesInRange);
+foreach($valuesInRange as $node) {
+    echo $node->getValue() . "\n";
+}
+
+echo $tree->hasIntersect([66,83]);
+echo $tree->countIntersections([2,3]);
+
+print_r($tree->getIntersections([2,3]));
+
+
+// $tree = new IntervalTree();
+// $intervals = [[6,8],[1,4],[2,3],[5,12],[1,1],[3,5],[5,7]];
+
+// // Insert interval as a key and string "val0", "val1" etc. as a value 
+// for ($i=0; $i < count($intervals); $i++) {
+//     $tree->insert($intervals[$i], "val" . $i);
+// }
+// $iterator = $tree->searchIterator(new Node(new Interval(2,3)), null);
+// foreach($iterator as $node) {
+//     echo "123\n";
+//     //print_r($node->getValue());
+// }
 
 // Array
 // (

src/Interval.php

@@ -1,13 +1,18 @@
 <?php
 namespace Danon\IntervalTree;
+use InvalidArgumentException;
 
 class Interval {
 
     public $low;
     public $high;
 
-    public function __construct($low, $high)
+    public function __construct(int $low, int $high)
     {
+        if($low > $high) {
+            throw new InvalidArgumentException('Low interval cannot be greater than high');
+        }
+
         $this->low = $low;
         $this->high = $high;
     }