@woosh/meep-engine 2.63.0 → 2.64.0

package/build/meep.module.js

@@ -53506,8 +53506,8 @@ class Vector2 {
      * @returns {number}
      */
     hash() {
-        const x = Math.sin(this.x) * 1367130550;
-        const y = Math.sin(this.y) * 1367130550;
+        const x = computeHashFloat(this.x);
+        const y = computeHashFloat(this.y);
 
         let hash = ((x << 5) - x) + y;
 
@@ -53644,6 +53644,7 @@ Vector2.one = Object.freeze(new Vector2(1, 1));
  * @type {boolean}
  */
 Vector2.prototype.isVector2 = true;
+
 /**
  *
  * @param {number} x0
@@ -62093,9 +62094,12 @@ class List {
     /**
      * Retrieve element at a given position in the list
      * @param {number} index
-     * @returns {T}
+     * @returns {T|undefined}
      */
     get(index) {
+        assert.isNumber(index, 'index');
+        assert.isNonNegativeInteger(index, 'index');
+
         return this.data[index];
     }
 
@@ -62105,6 +62109,9 @@ class List {
      * @param {T} value
      */
     set(index, value) {
+        assert.isNumber(index, 'index');
+        assert.isNonNegativeInteger(index, 'index');
+
         const oldValue = this.data[index];
 
         if (oldValue !== undefined) {
@@ -62225,7 +62232,7 @@ class List {
     /**
      * Replace the data, replacements is performed surgically, meaning that diff is computed and add/remove operations are performed on the set
      * This method is tailored to work well with visualisation as only elements that's missing from the new set is removed, and only elements that are new to are added
-     * Conversely, relevant events are dispatched that a visualisation can observe. This results in fewer changes required to the visualisation
+     * Conversely, relevant events are dispatched that can observe. This results in fewer changes required to the visualisation
      * @param {T[]} newOutput
      */
     patch(newOutput) {
@@ -79040,7 +79047,7 @@ class ExplicitBinaryBoundingVolumeHierarchy {
     /**
      *
      * @param {number} id
-     * @param {number[]} result
+     * @param {number[]|Float32Array} result
      */
     node_get_aabb(id, result) {
         assert.isNonNegativeInteger(id, 'id');
@@ -80199,18 +80206,6 @@ function bvh_query_leaves_generic(
     return result_cursor - result_offset;
 }
 
-class BVHQuery {
-    /**
-     *
-     * @param {number} node
-     * @param {ExplicitBinaryBoundingVolumeHierarchy} tree
-     * @returns {boolean}
-     */
-    evaluate(node, tree) {
-        throw new Error('Not Implemented');
-    }
-}
-
 /**
  *
  * @param {ArrayLike<number>|number[]|Float32Array} aabb bounding box, order: x0,y0,z0,x1,y1,z1
@@ -80225,21 +80220,33 @@ function aabb3_array_intersects_ray_array(aabb, ray) {
     );
 }
 
+class BVHQuery {
+    /**
+     *
+     * @param {number} node
+     * @param {ExplicitBinaryBoundingVolumeHierarchy} tree
+     * @returns {boolean}
+     */
+    evaluate(node, tree) {
+        throw new Error('Not Implemented');
+    }
+}
+
 const scratch_aabb = [];
 
 class BVHQueryIntersectsRay extends BVHQuery {
-    constructor() {
-        super();
-
-        this.ray = [];
-    }
+    /**
+     *
+     * @type {number[]}
+     */
+    ray = [];
 
     /**
      *
      * @param {number[]|ArrayLike<number>} ray
      * @returns {BVHQueryIntersectsRay}
      */
-    static from(ray){
+    static from(ray) {
         const r = new BVHQueryIntersectsRay();
 
         r.ray = ray;

package/package.json

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

package/src/core/binary/UINT16_MAX.js

@@ -0,0 +1,5 @@
+/**
+ * equal to `Math.pow(2,16) - 1`
+ * @type {number}
+ */
+export const UINT16_MAX = 65535;

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

@@ -1,9 +1,9 @@
-import { aabb3_compute_surface_area } from "../../geom/3d/aabb/aabb3_compute_surface_area.js";
-import { min2 } from "../../math/min2.js";
-import { max2 } from "../../math/max2.js";
 import { assert } from "../../assert.js";
-import { typed_array_copy } from "../../collection/array/typed/typed_array_copy.js";
 import { array_copy } from "../../collection/array/array_copy.js";
+import { typed_array_copy } from "../../collection/array/typed/typed_array_copy.js";
+import { aabb3_compute_surface_area } from "../../geom/3d/aabb/aabb3_compute_surface_area.js";
+import { max2 } from "../../math/max2.js";
+import { min2 } from "../../math/min2.js";
 
 export const COLUMN_PARENT = 6;
 export const COLUMN_CHILD_1 = 7;
@@ -373,7 +373,7 @@ export class ExplicitBinaryBoundingVolumeHierarchy {
     /**
      *
      * @param {number} id
-     * @param {number[]} result
+     * @param {number[]|Float32Array} result
      */
     node_get_aabb(id, result) {
         assert.isNonNegativeInteger(id, 'id');

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

@@ -1,18 +1,16 @@
-import { BVHQuery } from "./BVHQuery.js";
 import { aabb3_array_intersects_frustum_array } from "../../../geom/3d/aabb/aabb3_array_intersects_frustum_array.js";
+import { BVHQuery } from "./BVHQuery.js";
 
 const scratch_aabb = [];
 
 export class BVHQueryIntersectsFrustum extends BVHQuery {
-    constructor() {
-        super();
-
-        /**
-         * Collection of 6 planes: normal_x, normal_y, normal_z, offset
-         * @type {number[]}
-         */
-        this.frustum = [];
-    }
+
+    /**
+     * Collection of 6 planes: normal_x, normal_y, normal_z, offset
+     * @type {number[]}
+     */
+    frustum = [];
+
 
     /**
      *

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

@@ -1,21 +1,21 @@
-import { BVHQuery } from "./BVHQuery.js";
 import { aabb3_array_intersects_ray_array } from "../../../geom/3d/aabb/aabb3_array_intersects_ray_array.js";
+import { BVHQuery } from "./BVHQuery.js";
 
 const scratch_aabb = [];
 
 export class BVHQueryIntersectsRay extends BVHQuery {
-    constructor() {
-        super();
-
-        this.ray = [];
-    }
+    /**
+     *
+     * @type {number[]}
+     */
+    ray = [];
 
     /**
      *
      * @param {number[]|ArrayLike<number>} ray
      * @returns {BVHQueryIntersectsRay}
      */
-    static from(ray){
+    static from(ray) {
         const r = new BVHQueryIntersectsRay();
 
         r.ray = ray;

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

@@ -0,0 +1,37 @@
+import { aabb3_array_intersects_sphere_array } from "../../../geom/3d/aabb/aabb3_array_intersects_sphere_array.js";
+import { BVHQuery } from "./BVHQuery.js";
+
+const scratch_aabb = [];
+
+export class BVHQueryIntersectsSphere extends BVHQuery {
+
+    /**
+     *
+     * @type {number[]}
+     */
+    sphere = [];
+
+    /**
+     *
+     * @param {number[]|ArrayLike<number>} sphere
+     * @returns {BVHQueryIntersectsRay}
+     */
+    static from(sphere) {
+        const r = new BVHQueryIntersectsSphere();
+
+        r.sphere = sphere;
+
+        return r;
+    }
+
+    evaluate(node, tree) {
+
+        tree.node_get_aabb(node, scratch_aabb);
+
+        // test node against the ray
+        return aabb3_array_intersects_sphere_array(
+            scratch_aabb,
+            this.sphere
+        );
+    }
+}

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

@@ -1,5 +1,6 @@
-import { NULL_NODE } from "../ExplicitBinaryBoundingVolumeHierarchy.js";
+import { assert } from "../../../assert.js";
 import { SCRATCH_UINT32_TRAVERSAL_STACK } from "../../../collection/SCRATCH_UINT32_TRAVERSAL_STACK.js";
+import { NULL_NODE } from "../ExplicitBinaryBoundingVolumeHierarchy.js";
 
 const stack = SCRATCH_UINT32_TRAVERSAL_STACK;
 
@@ -15,9 +16,15 @@ const stack = SCRATCH_UINT32_TRAVERSAL_STACK;
  */
 export function bvh_query_user_data_generic(
     result, result_offset,
-    bvh,root, query
+    bvh, root, query
 ) {
 
+    assert.isArrayLike(result, 'result');
+    assert.isNonNegativeInteger(result_offset, 'result_offset');
+    assert.defined(bvh, 'bvh');
+    assert.isNonNegativeInteger(root, 'root');
+    assert.defined(query, 'query');
+
     if (root === NULL_NODE) {
         return 0;
     }
@@ -44,13 +51,14 @@ export function bvh_query_user_data_generic(
         // test node against the query
         const pass = query.evaluate(node, bvh);
 
-        if (!pass) {
+        if (pass === false) {
             continue;
         }
 
         const node_is_leaf = bvh.node_is_leaf(node);
 
-        if (!node_is_leaf) {
+        if (node_is_leaf === false) {
+            // binary-node
 
             // read in-order
             const child1 = bvh.node_get_child1(node);

package/src/core/bvh2/bvh3/query/bvh_query_user_data_generic.spec.js

@@ -0,0 +1,29 @@
+import { ExplicitBinaryBoundingVolumeHierarchy } from "../ExplicitBinaryBoundingVolumeHierarchy.js";
+import { bvh_query_user_data_generic } from "./bvh_query_user_data_generic.js";
+import { BVHQueryAny } from "./BVHQueryAny.js";
+
+test("all-accepting query", () => {
+    const bvh = new ExplicitBinaryBoundingVolumeHierarchy();
+
+    const leaf_a = bvh.allocate_node();
+    const leaf_b = bvh.allocate_node();
+
+    bvh.node_set_user_data(leaf_a, 7);
+    bvh.node_set_user_data(leaf_b, 13);
+
+    bvh.insert_leaf(leaf_a);
+    bvh.insert_leaf(leaf_b);
+
+    const result = [];
+
+    const count = bvh_query_user_data_generic(
+        result, 1,
+        bvh, bvh.root,
+        BVHQueryAny.INSTANCE
+    );
+
+    expect(count).toBe(2);
+    expect(result).toContain(7);
+    expect(result).toContain(13);
+
+});

package/src/core/collection/list/List.js

@@ -6,8 +6,8 @@
 import { assert } from "../../assert.js";
 import Signal from "../../events/signal/Signal.js";
 import { invokeObjectEquals } from "../../model/object/invokeObjectEquals.js";
-import { arraySetDiff } from "../array/arraySetDiff.js";
 import { arrayIndexByEquality } from "../array/arrayIndexByEquality.js";
+import { arraySetDiff } from "../array/arraySetDiff.js";
 
 
 /**
@@ -51,9 +51,12 @@ class List {
     /**
      * Retrieve element at a given position in the list
      * @param {number} index
-     * @returns {T}
+     * @returns {T|undefined}
      */
     get(index) {
+        assert.isNumber(index, 'index');
+        assert.isNonNegativeInteger(index, 'index');
+
         return this.data[index];
     }
 
@@ -63,6 +66,9 @@ class List {
      * @param {T} value
      */
     set(index, value) {
+        assert.isNumber(index, 'index');
+        assert.isNonNegativeInteger(index, 'index');
+
         const oldValue = this.data[index];
 
         if (oldValue !== undefined) {
@@ -183,7 +189,7 @@ class List {
     /**
      * Replace the data, replacements is performed surgically, meaning that diff is computed and add/remove operations are performed on the set
      * This method is tailored to work well with visualisation as only elements that's missing from the new set is removed, and only elements that are new to are added
-     * Conversely, relevant events are dispatched that a visualisation can observe. This results in fewer changes required to the visualisation
+     * Conversely, relevant events are dispatched that can observe. This results in fewer changes required to the visualisation
      * @param {T[]} newOutput
      */
     patch(newOutput) {

package/src/core/geom/3d/aabb/aabb3_from_v3_array.js

@@ -1,10 +1,10 @@
-import { min2 } from "../../../math/min2.js";
-import { max2 } from "../../../math/max2.js";
 import { assert } from "../../../assert.js";
+import { max2 } from "../../../math/max2.js";
+import { min2 } from "../../../math/min2.js";
 
 /**
  *
- * @param {AABB3} result
+ * @param {ArrayLike<number>|number[]|Float32Array|AABB3} result
  * @param {number[]|ArrayLike<number>|Float32Array} input
  * @param {number} input_length length of the input array
  */
@@ -33,5 +33,12 @@ export function aabb3_from_v3_array(result, input, input_length) {
         z1 = max2(z, z1);
     }
 
-    result.setBounds(x0, y0, z0, x1, y1, z1);
+    // read out
+    result[0] = x0;
+    result[1] = y0;
+    result[2] = z0;
+
+    result[3] = x1;
+    result[4] = y1;
+    result[5] = z1;
 }

package/src/core/geom/Vector2.js

@@ -6,11 +6,12 @@
 import { assert } from "../assert.js";
 import Signal from "../events/signal/Signal.js";
 import { clamp } from "../math/clamp.js";
+import { EPSILON } from "../math/EPSILON.js";
+import { epsilonEquals } from "../math/epsilonEquals.js";
 import { lerp } from "../math/lerp.js";
 import { max2 } from "../math/max2.js";
 import { min2 } from "../math/min2.js";
-import { EPSILON } from "../math/EPSILON.js";
-import { epsilonEquals } from "../math/epsilonEquals.js";
+import { computeHashFloat } from "../primitives/numbers/computeHashFloat.js";
 
 class Vector2 {
     /**
@@ -542,8 +543,8 @@ class Vector2 {
      * @returns {number}
      */
     hash() {
-        const x = Math.sin(this.x) * 1367130550;
-        const y = Math.sin(this.y) * 1367130550;
+        const x = computeHashFloat(this.x);
+        const y = computeHashFloat(this.y);
 
         let hash = ((x << 5) - x) + y;
 
@@ -680,6 +681,7 @@ Vector2.one = Object.freeze(new Vector2(1, 1));
  * @type {boolean}
  */
 Vector2.prototype.isVector2 = true;
+
 /**
  *
  * @param {number} x0