@woosh/meep-engine 2.131.41 → 2.131.42

package/package.json

@@ -5,7 +5,7 @@
   "description": "Pure JavaScript game engine. Fully featured and production ready.",
   "type": "module",
   "author": "Alexander Goldring",
-  "version": "2.131.41",
+  "version": "2.131.42",
   "main": "build/meep.module.js",
   "module": "build/meep.module.js",
   "exports": {

package/src/core/bvh2/bvh3/query/bvh_query_user_data_overlaps_aabb.d.ts

@@ -0,0 +1,9 @@
+/**
+ *
+ * @param {number[]} result
+ * @param {number} result_offset
+ * @param {BVH} bvh
+ * @param {number[]|Float32Array|AABB3} aabb
+ */
+export function bvh_query_user_data_overlaps_aabb(result: number[], result_offset: number, bvh: BVH, aabb: number[] | Float32Array | AABB3): number;
+//# sourceMappingURL=bvh_query_user_data_overlaps_aabb.d.ts.map

package/src/core/bvh2/bvh3/query/bvh_query_user_data_overlaps_aabb.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"bvh_query_user_data_overlaps_aabb.d.ts","sourceRoot":"","sources":["../../../../../../src/core/bvh2/bvh3/query/bvh_query_user_data_overlaps_aabb.js"],"names":[],"mappings":"AASA;;;;;;GAMG;AACH,0DALW,MAAM,EAAE,iBACR,MAAM,kBAEN,MAAM,EAAE,GAAC,YAAY,QAAM,UAoErC"}

package/src/core/bvh2/bvh3/query/bvh_query_user_data_overlaps_aabb.js

@@ -0,0 +1,83 @@
+//
+import { SCRATCH_UINT32_TRAVERSAL_STACK } from "../../../collection/SCRATCH_UINT32_TRAVERSAL_STACK.js";
+import { aabb3_intersects_aabb3 } from "../../../geom/3d/aabb/aabb3_intersects_aabb3.js";
+import { NULL_NODE } from "../BVH.js";
+
+const stack = SCRATCH_UINT32_TRAVERSAL_STACK;
+
+const scratch_aabb = new Float32Array(6);
+
+/**
+ *
+ * @param {number[]} result
+ * @param {number} result_offset
+ * @param {BVH} bvh
+ * @param {number[]|Float32Array|AABB3} aabb
+ */
+export function bvh_query_user_data_overlaps_aabb(
+    result,
+    result_offset,
+    bvh,
+    aabb
+) {
+    const root = bvh.root;
+
+    if (root === NULL_NODE) {
+        return 0;
+    }
+
+    /**
+     *
+     * @type {number}
+     */
+    const stack_top = stack.pointer++;
+
+    stack[stack_top] = root;
+
+    let result_cursor = result_offset;
+
+    while (stack.pointer > stack_top) {
+        stack.pointer--;
+
+        /**
+         *
+         * @type {number}
+         */
+        const node = stack[stack.pointer];
+
+        // test node against the ray
+        bvh.node_get_aabb(node, scratch_aabb);
+
+       const intersection_exists = aabb3_intersects_aabb3(
+            scratch_aabb[0], scratch_aabb[1], scratch_aabb[2],
+            scratch_aabb[3], scratch_aabb[4], scratch_aabb[5],
+            aabb[0], aabb[1], aabb[2],
+            aabb[3], aabb[4], aabb[5]
+        )
+
+        if (!intersection_exists) {
+            // fully outside
+            continue;
+        }
+
+        const node_is_leaf = bvh.node_is_leaf(node);
+
+        if (node_is_leaf) {
+            // leaf node
+            result[result_cursor++] = bvh.node_get_user_data(node);
+
+        }  else {
+            // read in-order
+            const child1 = bvh.node_get_child1(node);
+            const child2 = bvh.node_get_child2(node);
+
+            // write to stack in reverse order, so that fist child ends up being visited first
+            stack[stack.pointer++] = child1;
+            stack[stack.pointer++] = child2;
+        }
+    }
+
+    // drop stack frame
+
+    return result_cursor - result_offset;
+}