@woosh/meep-engine 2.87.1 → 2.87.2

package/package.json

@@ -5,7 +5,7 @@
   "description": "Fully featured ECS game engine written in JavaScript",
   "type": "module",
   "author": "Alexander Goldring",
-  "version": "2.87.1",
+  "version": "2.87.2",
   "main": "build/meep.module.js",
   "module": "build/meep.module.js",
   "exports": {

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

@@ -0,0 +1,14 @@
+/**
+ * @template T
+ * @param {QuadTreeNode<T>} tree
+ * @param {number} origin_x
+ * @param {number} origin_y
+ * @param {number} direction_x
+ * @param {number} direction_y
+ * @param {number} max_distance
+ * @param {function(data:T, origin_x:number, origin_y:number, direction_x:number, direction_y:number, max_distance2:number):boolean} [predicate]
+ * @param {*} [predicateContext]
+ * @returns {number}
+ */
+export function qt_query_data_raycast<T>(tree: QuadTreeNode<T>, origin_x: number, origin_y: number, direction_x: number, direction_y: number, max_distance: number, predicate: any, predicateContext?: any): number;
+//# sourceMappingURL=qt_query_data_raycast.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"qt_query_data_raycast.d.ts","sourceRoot":"","sources":["../../../../../../src/core/geom/2d/quad-tree/qt_query_data_raycast.js"],"names":[],"mappings":"AAQA;;;;;;;;;;;GAWG;AACH,0EATW,MAAM,YACN,MAAM,eACN,MAAM,eACN,MAAM,gBACN,MAAM,2CAGJ,MAAM,CA6DlB"}

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

@@ -0,0 +1,80 @@
+import { aabb2_distance_sqr_to_point } from "../aabb/aabb2_distance_sqr_to_point.js";
+
+/**
+ *
+ * @type {QuadTreeNode[]}
+ */
+const node_stack = [];
+
+/**
+ * @template T
+ * @param {QuadTreeNode<T>} tree
+ * @param {number} origin_x
+ * @param {number} origin_y
+ * @param {number} direction_x
+ * @param {number} direction_y
+ * @param {number} max_distance
+ * @param {function(data:T, origin_x:number, origin_y:number, direction_x:number, direction_y:number, max_distance2:number):boolean} [predicate]
+ * @param {*} [predicateContext]
+ * @returns {number}
+ */
+export function qt_query_data_raycast(
+    tree,
+    origin_x, origin_y,
+    direction_x, direction_y,
+    max_distance,
+    predicate, predicateContext
+) {
+
+    let stack_pointer = 0;
+
+    const max_distance2 = max_distance * max_distance;
+
+    node_stack[stack_pointer] = tree;
+    stack_pointer++;
+
+    let best_match = undefined;
+    let best_match_distance2 = max_distance2;
+
+    while (stack_pointer > 0) {
+
+        --stack_pointer;
+        const node = node_stack[stack_pointer];
+
+        const d2 = aabb2_distance_sqr_to_point(node.x0, node.y0, node.x1, node.y1, origin_x, origin_y);
+
+        if (d2 > best_match_distance2) {
+            // too far, not a match
+            continue;
+        }
+
+        const data = node.data;
+        const data_count = data.length;
+
+        for (let i = 0; i < data_count; i++) {
+            const datum = data[i];
+
+            const d2_to_datum = aabb2_distance_sqr_to_point(datum.x0, datum.y0, datum.x1, datum.y1, origin_x, origin_y);
+
+            if (d2_to_datum < best_match_distance2 && predicate.call(
+                predicateContext,
+                datum.data,
+                origin_x, origin_y,
+                direction_x, direction_y,
+                best_match_distance2
+            )) {
+                best_match = datum;
+                best_match_distance2 = d2_to_datum;
+            }
+        }
+
+        if (node.isSplit()) {
+            node_stack[stack_pointer++] = node.topLeft;
+            node_stack[stack_pointer++] = node.bottomLeft;
+            node_stack[stack_pointer++] = node.topRight;
+            node_stack[stack_pointer++] = node.bottomRight;
+        }
+    }
+
+    return best_match;
+}