@woosh/meep-engine 2.90.0 → 2.91.1

package/build/meep.module.js

@@ -52052,7 +52052,7 @@ const COLUMN_USER_DATA = COLUMN_CHILD_2;
  *
  * @type {number}
  */
-const NULL_NODE = 4294967295;
+const NULL_NODE = UINT32_MAX;
 
 /**
  * @readonly
@@ -55534,7 +55534,7 @@ class BinaryUint32BVH {
 
         // build bottom-most level, just above the leaves
         for (i = 0; i < level_node_count; i++) {
-            const leaf_index_0 = i * 2;
+            const leaf_index_0 = i << 1;
             const leaf_index_1 = leaf_index_0 + 1;
 
             const leaf_offset_0 = leaf_node_block_address + leaf_index_0 * BVH_LEAF_NODE_SIZE;
@@ -55562,18 +55562,17 @@ class BinaryUint32BVH {
 
         //build intermediate nodes
         for (; level >= 0; level--) {
-            level_node_count = Math.pow(2, level);
+            level_node_count = 1 << level;
             parentIndex = (level_node_count - 1);
 
             for (i = 0; i < level_node_count; i++) {
 
                 const childIndex0 = (parentIndex << 1) + 1;
-                const childIndex1 = childIndex0 + 1;
 
                 const address_parent = parentIndex * BVH_BINARY_NODE_SIZE;
 
                 const address_child_0 = childIndex0 * BVH_BINARY_NODE_SIZE;
-                const address_child_1 = childIndex1 * BVH_BINARY_NODE_SIZE;
+                const address_child_1 = address_child_0 + BVH_BINARY_NODE_SIZE;
 
                 aabb3_array_combine(
                     float32, address_parent,
@@ -79317,6 +79316,21 @@ function line_segment_compute_line_segment_intersection_2d(
     return collision;
 }
 
+/**
+ *
+ * @param {number} x0
+ * @param {number} y0
+ * @param {number} x1
+ * @param {number} y1
+ * @return {number}
+ */
+function aabb2_compute_area(x0, y0, x1, y1) {
+    const dx = x1 - x0;
+    const dy = y1 - y0;
+
+    return dx * dy;
+}
+
 /**
  *
  * @param {number} ax0
@@ -79655,10 +79669,7 @@ class AABB2 {
         const x1 = this.x1;
         const y1 = this.y1;
 
-        const dx = x1 - x0;
-        const dy = y1 - y0;
-
-        return dx * dy;
+        return aabb2_compute_area(x0, y0, x1, y1);
     }
 
     /**

package/package.json

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

package/src/core/binary/de_interleave_2_bits.spec.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"de_interleave_2_bits.spec.d.ts","sourceRoot":"","sources":["../../../../src/core/binary/de_interleave_2_bits.spec.js"],"names":[],"mappings":""}

package/src/core/binary/de_interleave_bits_by_2.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"de_interleave_bits_by_2.d.ts","sourceRoot":"","sources":["../../../../src/core/binary/de_interleave_bits_by_2.js"],"names":[],"mappings":"AAAA;;;;GAIG;AACH,kDAHW,MAAM,GACJ,MAAM,CAWlB"}

package/src/core/binary/reinterpret_float32_as_int32.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"reinterpret_float32_as_int32.d.ts","sourceRoot":"","sources":["../../../../src/core/binary/reinterpret_float32_as_int32.js"],"names":[],"mappings":"AAIA;;;;GAIG;AACH,oDAHW,MAAM,GACJ,MAAM,CAKlB"}

package/src/core/binary/split_by_2.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"split_by_2.d.ts","sourceRoot":"","sources":["../../../../src/core/binary/split_by_2.js"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AACH,8BAHW,MAAM,GACJ,MAAM,CAUlB"}

package/src/core/binary/split_by_3.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"split_by_3.d.ts","sourceRoot":"","sources":["../../../../src/core/binary/split_by_3.js"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AACH,8BAHW,MAAM,GACJ,MAAM,CASlB"}

package/src/core/bvh2/binary/2/BinaryUint32BVH.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"BinaryUint32BVH.d.ts","sourceRoot":"","sources":["../../../../../../src/core/bvh2/binary/2/BinaryUint32BVH.js"],"names":[],"mappings":"AAcA;;;GAGG;AACH,gCAFU,MAAM,CAEmB;AAEnC;;;;GAIG;AACH,mCAFU,MAAM,CAEsB;AACtC;;;GAGG;AACH,iCAFU,MAAM,CAEoB;AAiDpC;IACI;;;;OAIG;IACH,sBAAc;IAEd;;;;OAIG;IACH,gCAAe;IAEf;;;;OAIG;IACH,+BAAc;IAEd;;;;OAIG;IACH,4BAAwB;IAExB;;;;OAIG;IACH,0BAAsB;IA0CtB;;;OAGG;IACH,2BAOC;IAED,wBAEC;IAnDD;;;OAGG;IACH,oBAFa,MAAM,CAIlB;IAED,2BAEC;IAED,gCAEC;IAED,8BAEC;IAED;;;OAGG;IACH,uBAFa,MAAM,CAIlB;IAED,4BAEC;IAED,0BAEC;IAmBD;;;;OAIG;IACH,2BAHW,MAAM,GACJ,MAAM,CAalB;IAED,6BASC;IAED;;;OAGG;IACH,oBAFW,MAAM,QAchB;IAED;;;;;;;;;;OAUG;IACH,mBATW,MAAM,WACN,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,QAwBhB;IAED;;;;;OAKG;IACH,oBAJW,MAAM,eACN,MAAM,EAAE,GAAC,YAAY,sBACrB,MAAM,QAIhB;IAED;;;;OAIG;IACH,4BAHW,MAAM,GACJ,MAAM,CAQlB;IAED,qCAoBC;IAED;;;;;;;OAOG;IACH,yCAYC;IAED;;;;;;OAMG;IACH,kDAuBC;IAED,wBAUC;IAGD;;;OAGG;IACH,oBAFW,MAAM,EAAE,QAkElB;IAED;;;;;OAKG;IACH,sBAUC;IAED;;OAEG;IACH,cAuEC;CACJ"}
+{"version":3,"file":"BinaryUint32BVH.d.ts","sourceRoot":"","sources":["../../../../../../src/core/bvh2/binary/2/BinaryUint32BVH.js"],"names":[],"mappings":"AAcA;;;GAGG;AACH,gCAFU,MAAM,CAEmB;AAEnC;;;;GAIG;AACH,mCAFU,MAAM,CAEsB;AACtC;;;GAGG;AACH,iCAFU,MAAM,CAEoB;AAiDpC;IACI;;;;OAIG;IACH,sBAAc;IAEd;;;;OAIG;IACH,gCAAe;IAEf;;;;OAIG;IACH,+BAAc;IAEd;;;;OAIG;IACH,4BAAwB;IAExB;;;;OAIG;IACH,0BAAsB;IA0CtB;;;OAGG;IACH,2BAOC;IAED,wBAEC;IAnDD;;;OAGG;IACH,oBAFa,MAAM,CAIlB;IAED,2BAEC;IAED,gCAEC;IAED,8BAEC;IAED;;;OAGG;IACH,uBAFa,MAAM,CAIlB;IAED,4BAEC;IAED,0BAEC;IAmBD;;;;OAIG;IACH,2BAHW,MAAM,GACJ,MAAM,CAalB;IAED,6BASC;IAED;;;OAGG;IACH,oBAFW,MAAM,QAchB;IAED;;;;;;;;;;OAUG;IACH,mBATW,MAAM,WACN,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,QAwBhB;IAED;;;;;OAKG;IACH,oBAJW,MAAM,eACN,MAAM,EAAE,GAAC,YAAY,sBACrB,MAAM,QAIhB;IAED;;;;OAIG;IACH,4BAHW,MAAM,GACJ,MAAM,CAQlB;IAED,qCAoBC;IAED;;;;;;;OAOG;IACH,yCAYC;IAED;;;;;;OAMG;IACH,kDAuBC;IAED,wBAUC;IAGD;;;OAGG;IACH,oBAFW,MAAM,EAAE,QAkElB;IAED;;;;;OAKG;IACH,sBAUC;IAED;;OAEG;IACH,cAsEC;CACJ"}

package/src/core/bvh2/binary/2/BinaryUint32BVH.js

@@ -476,7 +476,7 @@ export class BinaryUint32BVH {
 
         // build bottom-most level, just above the leaves
         for (i = 0; i < level_node_count; i++) {
-            const leaf_index_0 = i * 2;
+            const leaf_index_0 = i << 1;
             const leaf_index_1 = leaf_index_0 + 1;
 
             const leaf_offset_0 = leaf_node_block_address + leaf_index_0 * BVH_LEAF_NODE_SIZE;
@@ -504,18 +504,17 @@ export class BinaryUint32BVH {
 
         //build intermediate nodes
         for (; level >= 0; level--) {
-            level_node_count = Math.pow(2, level);
+            level_node_count = 1 << level;
             parentIndex = (level_node_count - 1);
 
             for (i = 0; i < level_node_count; i++) {
 
                 const childIndex0 = (parentIndex << 1) + 1;
-                const childIndex1 = childIndex0 + 1;
 
                 const address_parent = parentIndex * BVH_BINARY_NODE_SIZE;
 
                 const address_child_0 = childIndex0 * BVH_BINARY_NODE_SIZE;
-                const address_child_1 = childIndex1 * BVH_BINARY_NODE_SIZE;
+                const address_child_1 = address_child_0 + BVH_BINARY_NODE_SIZE;
 
                 aabb3_array_combine(
                     float32, address_parent,

package/src/core/bvh2/bvh3/BVH.js

@@ -23,7 +23,7 @@ const COLUMN_USER_DATA = COLUMN_CHILD_2;
  *
  * @type {number}
  */
-export const NULL_NODE = 4294967295;
+export const NULL_NODE = UINT32_MAX;
 
 /**
  * @readonly

package/src/core/geom/2d/aabb/AABB2.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"AABB2.d.ts","sourceRoot":"","sources":["../../../../../../src/core/geom/2d/aabb/AABB2.js"],"names":[],"mappings":";AAiBA;;;GAGG;AACH;IACI;;;;;;OAMG;IACH,gEA+BC;IApBG;;;OAGG;IACH,WAAY;IACZ;;;OAGG;IACH,WAAY;IACZ;;;OAGG;IACH,WAAY;IACZ;;;OAGG;IACH,WAAY;IAGhB;;;OAGG;IACH,WAFW,MAAM,QAIhB;IAED;;;OAGG;IACH,aAFW,MAAM,QAIhB;IAED;;;OAGG;IACH,gBAFW,MAAM,EAAE,QA8BlB;IAED;;;OAGG;IACH,sBAFW,MAAM,QAShB;IAED;;;;;OAKG;IACH,sBAJW,KAAK,UACL,KAAK,GACH,OAAO,CAcnB;IAED;;;;OAIG;IACH,qBAHW,KAAK,GACH,OAAO,CAcnB;IAED;;;;;;;OAOG;IACH,0EAMC;IAED;;;;OAIG;IACH,qBAHW,MAAM,KACN,MAAM,QAKhB;IAED;;;OAGG;IACH,QAFa,MAAM,CAIlB;IAED;;;OAGG;IACH,QAFa,MAAM,CAIlB;IAED;;;;;;OAMG;IACH,0BALW,OAAO,MACP,OAAO,UACP,OAAO,GACL,OAAO,CA0BnB;IAED;;;;OAIG;IACH,kCAHW,OAAO,UACP,OAAO,QAmBjB;IAED;;;;OAIG;IACH,wBAHW,KAAK,GACH,MAAM,CAIlB;IAED;;;;;;;OAOG;IACH,sBANW,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,GACJ,MAAM,CA4BlB;IAED;;;OAGG;IACH,eAFa,MAAM,CAYlB;IAED;;;OAGG;IACH,sBAFY,MAAM,CAYjB;IAED;;;;;OAKG;IACH,iBAJW,MAAM,KACN,MAAM,GACJ,OAAO,CAInB;IAED;;;OAGG;IACH,mBAFW,KAAK,QAIf;IAED;;;OAGG;IACH,kBAFW,OAAO,QAOjB;IAED;;;OAGG;IACH,YAFa,MAAM,CAIlB;IAED;;;OAGG;IACH,aAFa,MAAM,CAIlB;IAED;;;;;;;OAOG;IACH,0DAiBC;IAED;;;;OAIG;IACH,eAHW,MAAM,KACN,MAAM,QAOhB;IAED;;;;OAIG;IACH,aAHW,MAAM,UACN,MAAM,QAIhB;IAED;;;OAGG;IACH,SAFa,KAAK,CAIjB;IAED;;;;OAIG;IACH,YAHW,KAAK,GACH,KAAK,CAIjB;IAED;;;;OAIG;IACH,cAHW,KAAK,GACH,OAAO,CAOnB;IAED;;;;;;OAMG;IACH,UALW,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,QAQhB;IAED;;;;;;OAMG;IACH,uBALW,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,QAsBhB;IAED;;OAEG;IACH,oCAEC;IAED,mBAEC;IAED;;;;;MAOC;IAED,0BAEC;CACJ;;;qBAqCS,KAAK;qBAML,KAAK;;oBAljBK,kBAAkB;AA0gBtC;;;;;;;GAOG;AACH,gDANW,KAAK,MACL,KAAK,MACL,OAAO,MACP,OAAO,GACL,OAAO,CAsBnB"}
+{"version":3,"file":"AABB2.d.ts","sourceRoot":"","sources":["../../../../../../src/core/geom/2d/aabb/AABB2.js"],"names":[],"mappings":";AAkBA;;;GAGG;AACH;IACI;;;;;;OAMG;IACH,gEA+BC;IApBG;;;OAGG;IACH,WAAY;IACZ;;;OAGG;IACH,WAAY;IACZ;;;OAGG;IACH,WAAY;IACZ;;;OAGG;IACH,WAAY;IAGhB;;;OAGG;IACH,WAFW,MAAM,QAIhB;IAED;;;OAGG;IACH,aAFW,MAAM,QAIhB;IAED;;;OAGG;IACH,gBAFW,MAAM,EAAE,QA8BlB;IAED;;;OAGG;IACH,sBAFW,MAAM,QAShB;IAED;;;;;OAKG;IACH,sBAJW,KAAK,UACL,KAAK,GACH,OAAO,CAcnB;IAED;;;;OAIG;IACH,qBAHW,KAAK,GACH,OAAO,CAcnB;IAED;;;;;;;OAOG;IACH,0EAMC;IAED;;;;OAIG;IACH,qBAHW,MAAM,KACN,MAAM,QAKhB;IAED;;;OAGG;IACH,QAFa,MAAM,CAIlB;IAED;;;OAGG;IACH,QAFa,MAAM,CAIlB;IAED;;;;;;OAMG;IACH,0BALW,OAAO,MACP,OAAO,UACP,OAAO,GACL,OAAO,CA0BnB;IAED;;;;OAIG;IACH,kCAHW,OAAO,UACP,OAAO,QAmBjB;IAED;;;;OAIG;IACH,wBAHW,KAAK,GACH,MAAM,CAIlB;IAED;;;;;;;OAOG;IACH,sBANW,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,GACJ,MAAM,CA4BlB;IAED;;;OAGG;IACH,eAFa,MAAM,CASlB;IAED;;;OAGG;IACH,sBAFY,MAAM,CAYjB;IAED;;;;;OAKG;IACH,iBAJW,MAAM,KACN,MAAM,GACJ,OAAO,CAInB;IAED;;;OAGG;IACH,mBAFW,KAAK,QAIf;IAED;;;OAGG;IACH,kBAFW,OAAO,QAOjB;IAED;;;OAGG;IACH,YAFa,MAAM,CAIlB;IAED;;;OAGG;IACH,aAFa,MAAM,CAIlB;IAED;;;;;;;OAOG;IACH,0DAiBC;IAED;;;;OAIG;IACH,eAHW,MAAM,KACN,MAAM,QAOhB;IAED;;;;OAIG;IACH,aAHW,MAAM,UACN,MAAM,QAIhB;IAED;;;OAGG;IACH,SAFa,KAAK,CAIjB;IAED;;;;OAIG;IACH,YAHW,KAAK,GACH,KAAK,CAIjB;IAED;;;;OAIG;IACH,cAHW,KAAK,GACH,OAAO,CAOnB;IAED;;;;;;OAMG;IACH,UALW,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,QAQhB;IAED;;;;;;OAMG;IACH,uBALW,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,QAsBhB;IAED;;OAEG;IACH,oCAEC;IAED,mBAEC;IAED;;;;;MAOC;IAED,0BAEC;CACJ;;;qBAqCS,KAAK;qBAML,KAAK;;oBAhjBK,kBAAkB;AAwgBtC;;;;;;;GAOG;AACH,gDANW,KAAK,MACL,KAAK,MACL,OAAO,MACP,OAAO,GACL,OAAO,CAsBnB"}

package/src/core/geom/2d/aabb/AABB2.js

@@ -12,6 +12,7 @@ import Vector2 from "../../Vector2.js";
 import {
     line_segment_compute_line_segment_intersection_2d
 } from "../line/line_segment_compute_line_segment_intersection_2d.js";
+import { aabb2_compute_area } from "./aabb2_compute_area.js";
 import { aabb2_compute_overlap } from "./aabb2_compute_overlap.js";
 import { aabb2_overlap_exists } from "./aabb2_overlap_exists.js";
 
@@ -316,10 +317,7 @@ class AABB2 {
         const x1 = this.x1;
         const y1 = this.y1;
 
-        const dx = x1 - x0;
-        const dy = y1 - y0;
-
-        return dx * dy;
+        return aabb2_compute_area(x0, y0, x1, y1);
     }
 
     /**

package/src/core/geom/2d/aabb/aabb2_array_combine.d.ts

@@ -0,0 +1,11 @@
+/**
+ * Merge bounds of two axis-aligned bounding boxes, the result is a box that tightly bounds inputs
+ * @param {ArrayLike<number>|number[]|Float32Array} result where resulting value is written to
+ * @param {number} result_offset
+ * @param {ArrayLike<number>|number[]|Float32Array} a
+ * @param {number} a_offset
+ * @param {ArrayLike<number>|number[]|Float32Array} b
+ * @param {number} b_offset
+ */
+export function aabb2_array_combine(result: ArrayLike<number> | number[] | Float32Array, result_offset: number, a: ArrayLike<number> | number[] | Float32Array, a_offset: number, b: ArrayLike<number> | number[] | Float32Array, b_offset: number): void;
+//# sourceMappingURL=aabb2_array_combine.d.ts.map

package/src/core/geom/2d/aabb/aabb2_array_combine.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"aabb2_array_combine.d.ts","sourceRoot":"","sources":["../../../../../../src/core/geom/2d/aabb/aabb2_array_combine.js"],"names":[],"mappings":"AAGA;;;;;;;;GAQG;AACH,4CAPW,UAAU,MAAM,CAAC,GAAC,MAAM,EAAE,GAAC,YAAY,iBACvC,MAAM,KACN,UAAU,MAAM,CAAC,GAAC,MAAM,EAAE,GAAC,YAAY,YACvC,MAAM,KACN,UAAU,MAAM,CAAC,GAAC,MAAM,EAAE,GAAC,YAAY,YACvC,MAAM,QAwBhB"}

package/src/core/geom/2d/aabb/aabb2_array_combine.js

@@ -0,0 +1,35 @@
+import { max2 } from "../../../math/max2.js";
+import { min2 } from "../../../math/min2.js";
+
+/**
+ * Merge bounds of two axis-aligned bounding boxes, the result is a box that tightly bounds inputs
+ * @param {ArrayLike<number>|number[]|Float32Array} result where resulting value is written to
+ * @param {number} result_offset
+ * @param {ArrayLike<number>|number[]|Float32Array} a
+ * @param {number} a_offset
+ * @param {ArrayLike<number>|number[]|Float32Array} b
+ * @param {number} b_offset
+ */
+export function aabb2_array_combine(
+    result, result_offset,
+    a, a_offset,
+    b, b_offset
+) {
+
+    const a_x0 = a[a_offset];
+    const a_y0 = a[a_offset + 1];
+    const a_x1 = a[a_offset + 2];
+    const a_y1 = a[a_offset + 3];
+
+    const b_x0 = b[b_offset];
+    const b_y0 = b[b_offset + 1];
+    const b_x1 = b[b_offset + 2];
+    const b_y1 = b[b_offset + 3];
+
+    result[result_offset] = min2(a_x0, b_x0);
+    result[result_offset + 1] = min2(a_y0, b_y0);
+
+    result[result_offset + 2] = max2(a_x1, b_x1);
+    result[result_offset + 3] = max2(a_y1, b_y1);
+
+}

package/src/core/geom/2d/aabb/aabb2_array_set.d.ts

@@ -0,0 +1,11 @@
+/**
+ *
+ * @param {ArrayLike<number>|Float32Array|number[]} result
+ * @param {number} result_offset
+ * @param {number} x0
+ * @param {number} y0
+ * @param {number} x1
+ * @param {number} y1
+ */
+export function aabb2_array_set(result: ArrayLike<number> | Float32Array | number[], result_offset: number, x0: number, y0: number, x1: number, y1: number): void;
+//# sourceMappingURL=aabb2_array_set.d.ts.map

package/src/core/geom/2d/aabb/aabb2_array_set.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"aabb2_array_set.d.ts","sourceRoot":"","sources":["../../../../../../src/core/geom/2d/aabb/aabb2_array_set.js"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AACH,wCAPW,UAAU,MAAM,CAAC,GAAC,YAAY,GAAC,MAAM,EAAE,iBACvC,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,QAahB"}

package/src/core/geom/2d/aabb/aabb2_array_set.js

@@ -0,0 +1,21 @@
+/**
+ *
+ * @param {ArrayLike<number>|Float32Array|number[]} result
+ * @param {number} result_offset
+ * @param {number} x0
+ * @param {number} y0
+ * @param {number} x1
+ * @param {number} y1
+ */
+export function aabb2_array_set(
+    result, result_offset,
+    x0, y0,
+    x1, y1,
+) {
+
+    result[result_offset + 0] = x0;
+    result[result_offset + 1] = y0;
+
+    result[result_offset + 2] = x1;
+    result[result_offset + 3] = y1;
+}

package/src/core/geom/2d/aabb/aabb2_compute_area.d.ts

@@ -0,0 +1,10 @@
+/**
+ *
+ * @param {number} x0
+ * @param {number} y0
+ * @param {number} x1
+ * @param {number} y1
+ * @return {number}
+ */
+export function aabb2_compute_area(x0: number, y0: number, x1: number, y1: number): number;
+//# sourceMappingURL=aabb2_compute_area.d.ts.map

package/src/core/geom/2d/aabb/aabb2_compute_area.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"aabb2_compute_area.d.ts","sourceRoot":"","sources":["../../../../../../src/core/geom/2d/aabb/aabb2_compute_area.js"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AACH,uCANW,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,GACL,MAAM,CAOjB"}

package/src/core/geom/2d/aabb/aabb2_compute_area.js

@@ -0,0 +1,14 @@
+/**
+ *
+ * @param {number} x0
+ * @param {number} y0
+ * @param {number} x1
+ * @param {number} y1
+ * @return {number}
+ */
+export function aabb2_compute_area(x0, y0, x1, y1) {
+    const dx = x1 - x0;
+    const dy = y1 - y0;
+
+    return dx * dy;
+}

package/src/core/geom/2d/bvh/BVH2D.d.ts

@@ -0,0 +1,296 @@
+export const COLUMN_PARENT: 4;
+export const COLUMN_CHILD_1: 5;
+export const COLUMN_CHILD_2: 6;
+export const COLUMN_HEIGHT: 7;
+/**
+ * A non-leaf node have both CHILD_1 and CHILD_2 set, when CHILD_1 is not set - it's a leaf node
+ * So we can utilize space of CHILD_2 to store USER_DATA, hence there is overlap in schema
+ * @readonly
+ * @type {number}
+ */
+export const COLUMN_USER_DATA: number;
+/**
+ *
+ * @type {number}
+ */
+export const NULL_NODE: number;
+/**
+ * How many words are used for a single NODE in the tree
+ * One "word" is 4 bytes for the sake of alignment
+ * @readonly
+ * @type {number}
+ */
+export const ELEMENT_WORD_COUNT: number;
+/**
+ * 2D Bounding Volume Hierarchy implementation.
+ * Based on BVH (3D) implementation
+ * @class
+ */
+export class BVH2D {
+    /**
+     *
+     * @type {ArrayBuffer}
+     * @private
+     */
+    private __data_buffer;
+    /**
+     *
+     * @type {Float32Array}
+     * @private
+     */
+    private __data_float32;
+    /**
+     *
+     * @type {Uint32Array}
+     * @private
+     */
+    private __data_uint32;
+    /**
+     * How many nodes are currently reserved, this will grow automatically through {@link #allocate_node} method usage
+     * @type {number}
+     * @private
+     */
+    private __capacity;
+    /**
+     * Number of used nodes. These are either live nodes, or node sitting in the {@link #__free} pool
+     * @type {number}
+     * @private
+     */
+    private __size;
+    /**
+     * Indices of released nodes. Nodes are pulled from here first if available, before the whole tree gets resized
+     * @type {number[]}
+     * @private
+     */
+    private __free;
+    /**
+     * Pointer into __free array that's used as a stack, so this pointer represents top of the stack
+     * @type {number}
+     * @private
+     */
+    private __free_pointer;
+    /**
+     * Root node of the hierarchy
+     * @type {number}
+     * @private
+     */
+    private __root;
+    /**
+     *
+     * @returns {number}
+     */
+    get root(): number;
+    /**
+     *
+     * @param {number} v
+     */
+    set node_capacity(arg: number);
+    /**
+     *
+     * @returns {number}
+     */
+    get node_capacity(): number;
+    __grow_capacity(): void;
+    /**
+     *
+     * @param {number} new_capacity in number of nodes
+     * @private
+     */
+    private __set_capacity;
+    /**
+     * Trim allocated memory region to only contain allocated nodes
+     */
+    trim(): void;
+    /**
+     *
+     * @returns {number}
+     */
+    allocate_node(): number;
+    /**
+     * Release memory used by the node back into the pool
+     * NOTE: Make sure that the node is not "live" (not attached to the hierarchy), otherwise this operation may corrupt the tree
+     * @param {number} id
+     */
+    release_node(id: number): void;
+    /**
+     *
+     * @param {number} id
+     * @returns {boolean}
+     */
+    node_is_leaf(id: number): boolean;
+    /**
+     *
+     * @param {number} id
+     * @returns {number}
+     */
+    node_get_user_data(id: number): number;
+    /**
+     *
+     * @param {number} id
+     * @param {number} value
+     */
+    node_set_user_data(id: number, value: number): void;
+    /**
+     *
+     * @param {number} id
+     * @returns {number}
+     */
+    node_get_child1(id: number): number;
+    /**
+     *
+     * @param {number} node
+     * @param {number} child1
+     */
+    node_set_child1(node: number, child1: number): void;
+    /**
+     *
+     * @param {number} id
+     * @returns {number}
+     */
+    node_get_child2(id: number): number;
+    /**
+     *
+     * @param {number} node
+     * @param {number} child2
+     */
+    node_set_child2(node: number, child2: number): void;
+    /**
+     *
+     * @param {number} id
+     * @returns {number}
+     */
+    node_get_parent(id: number): number;
+    /**
+     *
+     * @param {number} node
+     * @param {number} parent
+     */
+    node_set_parent(node: number, parent: number): void;
+    /**
+     *
+     * @param {number} id
+     * @returns {number}
+     */
+    node_get_height(id: number): number;
+    /**
+     *
+     * @param {number} id
+     * @param {number} height
+     */
+    node_set_height(id: number, height: number): void;
+    /**
+     *
+     * @param {number} id
+     * @param {number[]|Float32Array} result
+     */
+    node_get_aabb(id: number, result: number[] | Float32Array): void;
+    /**
+     *
+     * @param {number} id
+     * @param {number[]|ArrayLike<number>} aabb
+     */
+    node_set_aabb(id: number, aabb: number[] | ArrayLike<number>): void;
+    /**
+     *
+     * @param {number} id
+     * @param {number[]} aabb
+     */
+    node_move_aabb(id: number, aabb: number[]): void;
+    /**
+     *
+     * @param {number} id
+     * @param {number} x0
+     * @param {number} y0
+     * @param {number} z0
+     * @param {number} x1
+     * @param {number} y1
+     * @param {number} z1
+     */
+    node_set_aabb_primitive(id: number, x0: number, y0: number, x1: number, y1: number): void;
+    /**
+     *
+     * @param {number} id
+     * @returns {number}
+     */
+    node_get_surface_area(id: number): number;
+    /**
+     *
+     * @param {number} index_a
+     * @param {number} index_b
+     * @returns {number}
+     */
+    node_get_combined_surface_area(index_a: number, index_b: number): number;
+    /**
+     *
+     * @param {number} destination
+     * @param {number} index_a
+     * @param {number} index_b
+     */
+    node_set_combined_aabb(destination: number, index_a: number, index_b: number): void;
+    /**
+     *
+     * @param {number} leaf
+     * @returns {void}
+     */
+    insert_leaf(leaf: number): void;
+    /**
+     * refit and update nodes up the tree. Only updates bounds
+     * NOTE: Does not update "height"
+     * @param {number} parent
+     * @private
+     */
+    private bubble_up_refit;
+    /**
+     * refit and update nodes up the tree
+     * @param {number} parent
+     * @private
+     */
+    private bubble_up_update;
+    /**
+     * NOTE: Leaf node is not released, make sure to call {@link #release_node} separately when you no longer need the leaf node
+     * @param {number} leaf
+     * @returns {void}
+     */
+    remove_leaf(leaf: number): void;
+    /**
+     * Perform a left or right rotation if node A is imbalanced.
+     * Returns the new root index.
+     * @param {number} iA
+     * @returns {number}
+     * @private
+     */
+    private balance;
+    /**
+     * Release all nodes, this essentially resets the tree to empty state
+     * NOTE: For performance reasons, released memory is not reset, this means that attempting to access cleared nodes' memory will yield garbage data
+     */
+    release_all(): void;
+    /**
+     *
+     * @param {function(node:number, tree:BVH):void} callback
+     * @param {*} [ctx]
+     */
+    traverse(callback: any, ctx?: any): void;
+    /**
+     *
+     * @param {number[]} destination
+     * @param {number} destination_offset
+     * @returns {number}
+     */
+    collect_nodes_all(destination: number[], destination_offset: number): number;
+    /**
+     * Update parent and child links of a given node to point to a new location, useful for re-locating nodes
+     * @param {number} node node to update
+     * @param {number} destination Where updated links should point to
+     * @private
+     */
+    private __move_node_links;
+    /**
+     * Swap two nodes in memory
+     * @param {number} a
+     * @param {number} b
+     * @returns {boolean}
+     */
+    swap_nodes(a: number, b: number): boolean;
+}
+//# sourceMappingURL=BVH2D.d.ts.map

package/src/core/geom/2d/bvh/BVH2D.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"BVH2D.d.ts","sourceRoot":"","sources":["../../../../../../src/core/geom/2d/bvh/BVH2D.js"],"names":[],"mappings":"AASA,8BAA+B;AAC/B,+BAAgC;AAChC,+BAAgC;AAChC,8BAA+B;AAE/B;;;;;GAKG;AACH,+BAFU,MAAM,CAE+B;AAE/C;;;GAGG;AACH,wBAFU,MAAM,CAEoB;AAcpC;;;;;GAKG;AACH,iCAFU,MAAM,CAEoB;AAgBpC;;;;GAIG;AACH;IAEI;;;;OAIG;IACH,sBAA2E;IAE3E;;;;OAIG;IACH,uBAAsD;IAEtD;;;;OAIG;IACH,sBAAoD;IAEpD;;;;OAIG;IACH,mBAA8B;IAE9B;;;;OAIG;IACH,eAAW;IAEX;;;;OAIG;IACH,eAAY;IAEZ;;;;OAIG;IACH,uBAAmB;IAEnB;;;;OAIG;IACH,eAAmB;IAEnB;;;OAGG;IACH,mBAEC;IAUD;;;OAGG;IACH,+BAMC;IAlBD;;;OAGG;IACH,4BAEC;IAcD,wBAgBC;IAED;;;;OAIG;IACH,uBAqBC;IAED;;OAEG;IACH,aAIC;IAED;;;OAGG;IACH,iBAFa,MAAM,CAmDlB;IAED;;;;OAIG;IACH,iBAFW,MAAM,QAMhB;IAED;;;;OAIG;IACH,iBAHW,MAAM,GACJ,OAAO,CAOnB;IAED;;;;OAIG;IACH,uBAHW,MAAM,GACJ,MAAM,CAKlB;IAED;;;;OAIG;IACH,uBAHW,MAAM,SACN,MAAM,QAOhB;IAED;;;;OAIG;IACH,oBAHW,MAAM,GACJ,MAAM,CAKlB;IAED;;;;OAIG;IACH,sBAHW,MAAM,UACN,MAAM,QAIhB;IAED;;;;OAIG;IACH,oBAHW,MAAM,GACJ,MAAM,CAKlB;IAED;;;;OAIG;IACH,sBAHW,MAAM,UACN,MAAM,QAIhB;IAED;;;;OAIG;IACH,oBAHW,MAAM,GACJ,MAAM,CAKlB;IAED;;;;OAIG;IACH,sBAHW,MAAM,UACN,MAAM,QAIhB;IAGD;;;;OAIG;IACH,oBAHW,MAAM,GACJ,MAAM,CAKlB;IAED;;;;OAIG;IACH,oBAHW,MAAM,UACN,MAAM,QAKhB;IAED;;;;OAIG;IACH,kBAHW,MAAM,UACN,MAAM,EAAE,GAAC,YAAY,QAa/B;IAED;;;;OAIG;IACH,kBAHW,MAAM,QACN,MAAM,EAAE,GAAC,UAAU,MAAM,CAAC,QAkBpC;IAED;;;;OAIG;IACH,mBAHW,MAAM,QACN,MAAM,EAAE,QAWlB;IAED;;;;;;;;;OASG;IACH,4BARW,MAAM,MACN,MAAM,MACN,MAAM,MAEN,MAAM,MACN,MAAM,QAkBhB;IAED;;;;OAIG;IACH,0BAHW,MAAM,GACJ,MAAM,CAkBlB;IAED;;;;;OAKG;IACH,wCAJW,MAAM,WACN,MAAM,GACJ,MAAM,CA6BlB;IAED;;;;;OAKG;IACH,oCAJW,MAAM,WACN,MAAM,WACN,MAAM,QA+BhB;IAED;;;;OAIG;IACH,kBAHW,MAAM,GACJ,IAAI,CA0GhB;IAED;;;;;OAKG;IACH,wBAuBC;IAED;;;;OAIG;IACH,yBA4BC;IAED;;;;OAIG;IACH,kBAHW,MAAM,GACJ,IAAI,CA6ChB;IAED;;;;;;OAMG;IACH,gBAoMC;IAED;;;OAGG;IACH,oBAIC;IAED;;;;OAIG;IACH,yCA8BC;IAED;;;;;OAKG;IACH,+BAJW,MAAM,EAAE,sBACR,MAAM,GACJ,MAAM,CAWlB;IAED;;;;;OAKG;IACH,0BA6BC;IAED;;;;;OAKG;IACH,cAJW,MAAM,KACN,MAAM,GACJ,OAAO,CAsCnB;CACJ"}