fix: finds the lowest intersecting interval #47

Author: alexbol99

dist/main.cjs.js

@@ -403,7 +403,7 @@ class IntervalTree {
     }
 
     /**
-     * @param {Interval} interval - optional if the iterator is intended to start from the beginning or end
+     * @param {Interval} interval - optional if the iterator is intended to start from the beginning
      * @param outputMapperFn(value,key) - optional function that maps (value, key) to custom output
      * @returns {Iterator}
      */
@@ -657,8 +657,12 @@ class IntervalTree {
         let curr = node;
         while (curr && curr != this.nil_node) {
             if (curr.less_than(search_node)) {
-                if (curr.intersect(search_node) && (!best || curr.less_than(best))) best = curr;
-                curr = curr.right;
+                if (curr.intersect(search_node)) {
+                    best = curr;
+                    curr = curr.left;
+                } else {
+                    curr = curr.right;
+                }
             } else {
                 if (!best || curr.less_than(best)) best = curr;
                 curr = curr.left;

dist/main.esm.js

@@ -399,7 +399,7 @@ class IntervalTree {
     }
 
     /**
-     * @param {Interval} interval - optional if the iterator is intended to start from the beginning or end
+     * @param {Interval} interval - optional if the iterator is intended to start from the beginning
      * @param outputMapperFn(value,key) - optional function that maps (value, key) to custom output
      * @returns {Iterator}
      */
@@ -653,8 +653,12 @@ class IntervalTree {
         let curr = node;
         while (curr && curr != this.nil_node) {
             if (curr.less_than(search_node)) {
-                if (curr.intersect(search_node) && (!best || curr.less_than(best))) best = curr;
-                curr = curr.right;
+                if (curr.intersect(search_node)) {
+                    best = curr;
+                    curr = curr.left;
+                } else {
+                    curr = curr.right;
+                }
             } else {
                 if (!best || curr.less_than(best)) best = curr;
                 curr = curr.left;

dist/main.umd.js

@@ -405,7 +405,7 @@
         }
 
         /**
-         * @param {Interval} interval - optional if the iterator is intended to start from the beginning or end
+         * @param {Interval} interval - optional if the iterator is intended to start from the beginning
          * @param outputMapperFn(value,key) - optional function that maps (value, key) to custom output
          * @returns {Iterator}
          */
@@ -659,8 +659,12 @@
             let curr = node;
             while (curr && curr != this.nil_node) {
                 if (curr.less_than(search_node)) {
-                    if (curr.intersect(search_node) && (!best || curr.less_than(best))) best = curr;
-                    curr = curr.right;
+                    if (curr.intersect(search_node)) {
+                        best = curr;
+                        curr = curr.left;
+                    } else {
+                        curr = curr.right;
+                    }
                 } else {
                     if (!best || curr.less_than(best)) best = curr;
                     curr = curr.left;

package.json

@@ -1,6 +1,6 @@
 {
   "name": "@flatten-js/interval-tree",
-  "version": "1.1.0",
+  "version": "1.1.1",
   "description": "Interval search tree",
   "author": "Alex Bol",
   "license": "MIT",