@woosh/meep-engine 2.155.0 → 2.156.0

package/src/core/geom/2d/hash-grid/shg_query_elements_line.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"shg_query_elements_line.d.ts","sourceRoot":"","sources":["../../../../../../src/core/geom/2d/hash-grid/shg_query_elements_line.js"],"names":[],"mappings":"AAaA;;;;;;;;;;;GAWG;AACH,gDATW,MAAM,EAAE,iBACR,MAAM,6BAEN,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,GACJ,MAAM,CA0GlB"}
+{"version":3,"file":"shg_query_elements_line.d.ts","sourceRoot":"","sources":["../../../../../../src/core/geom/2d/hash-grid/shg_query_elements_line.js"],"names":[],"mappings":"AAaA;;;;;;;;;;;GAWG;AACH,gDATW,MAAM,EAAE,iBACR,MAAM,6BAEN,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,GACJ,MAAM,CA+GlB"}

package/src/core/geom/2d/hash-grid/shg_query_elements_line.js

@@ -116,12 +116,17 @@ export function shg_query_elements_line(
             x + 0.5, y + step_y + 0.5
         );
 
-        if (move_x_distance <= move_y_distance && x !== igrid_x1) {
+        // Step along whichever axis keeps us closest to the line, but if the preferred axis can no longer move
+        // (already at the endpoint column/row) fall back to the other axis, so we always reach the endpoint cell.
+        const canX = x !== igrid_x1;
+        const canY = y !== igrid_y1;
+
+        if (canX && (move_x_distance <= move_y_distance || !canY)) {
             x += step_x;
-        } else if (y !== igrid_y1) {
+        } else if (canY) {
             y += step_y;
         } else {
-            // unexpected, or we just reached the end
+            // both axes are at the endpoint — we're done
             break;
         }
     }

package/src/core/geom/2d/quad-tree/QuadTreeDatum.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"QuadTreeDatum.d.ts","sourceRoot":"","sources":["../../../../../../src/core/geom/2d/quad-tree/QuadTreeDatum.js"],"names":[],"mappings":"AAGA;;;GAGG;AACH;IAQI;;;OAGG;IACH,4DAAD;IAAC,cACJ;IAXI;;;OAGG;IACH,MAFU,CAAC,GAAC,IAAI,CAEJ;IAEZ;;;OAGG;IACH,YAFU,eAAa,IAAI,CAET;IAElB,mBA2BC;IAED;;;;;;OAMG;IACH,WALW,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,QA8BhB;IAED;;;;OAIG;IACH,SAHW,MAAM,MACN,MAAM,QAUhB;IAGL,yBAAuC;CAFtC;kBApGiB,wBAAwB"}
+{"version":3,"file":"QuadTreeDatum.d.ts","sourceRoot":"","sources":["../../../../../../src/core/geom/2d/quad-tree/QuadTreeDatum.js"],"names":[],"mappings":"AAGA;;;GAGG;AACH;IAQI;;;OAGG;IACH,4DAAD;IAAC,cACJ;IAXI;;;OAGG;IACH,MAFU,CAAC,GAAC,IAAI,CAEJ;IAEZ;;;OAGG;IACH,YAFU,eAAa,IAAI,CAET;IAElB,mBA2BC;IAED;;;;;;OAMG;IACH,WALW,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,QAsChB;IAED;;;;OAIG;IACH,SAHW,MAAM,MACN,MAAM,QAUhB;IAGL,yBAAuC;CAFtC;kBA5GiB,wBAAwB"}

package/src/core/geom/2d/quad-tree/QuadTreeDatum.js

@@ -81,7 +81,15 @@ export class QuadTreeDatum extends AABB2 {
 
             this.disconnect();
 
-            node.insertDatum(this);
+            // disconnect() may rebalance and merge `node` out of the tree (merges null only downward child
+            // pointers, never the upward parentNode link). Re-inserting into a possibly-detached `node` would
+            // place the datum in dead subtree; walk up the surviving parentNode chain to the live root instead.
+            let root = node;
+            while (root.parentNode !== null) {
+                root = root.parentNode;
+            }
+
+            root.insertDatum(this);
         }
     }
 

package/src/core/geom/2d/quad-tree/qt_query_data_nearest_to_point.d.ts

@@ -3,7 +3,9 @@
  * @param {QuadTreeNode<N>} tree
  * @param {number} x
  * @param {number} y
- * @param {number} [max_distance]
+ * @param {number} [max_distance] linear distance cutoff. Data farther than this are ignored.
+ * NOTE: this is a LINEAR distance, not squared — it is squared internally. Callers holding a
+ * squared distance (e.g. from {@link aabb2_distance_sqr_to_point}) must pass `Math.sqrt(...)`.
  * @returns {QuadTreeDatum<N>}
  */
 export function qt_query_data_nearest_to_point<N>(tree: QuadTreeNode<N>, x: number, y: number, max_distance?: number): QuadTreeDatum<N>;

package/src/core/geom/2d/quad-tree/qt_query_data_nearest_to_point.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"qt_query_data_nearest_to_point.d.ts","sourceRoot":"","sources":["../../../../../../src/core/geom/2d/quad-tree/qt_query_data_nearest_to_point.js"],"names":[],"mappings":"AAQA;;;;;;;GAOG;AACH,4EALW,MAAM,KACN,MAAM,iBACN,MAAM,oBA8ChB"}
+{"version":3,"file":"qt_query_data_nearest_to_point.d.ts","sourceRoot":"","sources":["../../../../../../src/core/geom/2d/quad-tree/qt_query_data_nearest_to_point.js"],"names":[],"mappings":"AAQA;;;;;;;;;GASG;AACH,4EAPW,MAAM,KACN,MAAM,iBACN,MAAM,oBAgDhB"}

package/src/core/geom/2d/quad-tree/qt_query_data_nearest_to_point.js

@@ -11,7 +11,9 @@ const node_stack = [];
  * @param {QuadTreeNode<N>} tree
  * @param {number} x
  * @param {number} y
- * @param {number} [max_distance]
+ * @param {number} [max_distance] linear distance cutoff. Data farther than this are ignored.
+ * NOTE: this is a LINEAR distance, not squared — it is squared internally. Callers holding a
+ * squared distance (e.g. from {@link aabb2_distance_sqr_to_point}) must pass `Math.sqrt(...)`.
  * @returns {QuadTreeDatum<N>}
  */
 export function qt_query_data_nearest_to_point(tree, x, y, max_distance = Infinity) {