@woosh/meep-engine 2.63.0 → 2.64.0

package/build/meep.cjs

@@ -53508,8 +53508,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;
 
@@ -53646,6 +53646,7 @@ Vector2.one = Object.freeze(new Vector2(1, 1));
  * @type {boolean}
  */
 Vector2.prototype.isVector2 = true;
+
 /**
  *
  * @param {number} x0
@@ -62095,9 +62096,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];
     }
 
@@ -62107,6 +62111,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) {
@@ -62227,7 +62234,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) {
@@ -79042,7 +79049,7 @@ class ExplicitBinaryBoundingVolumeHierarchy {
     /**
      *
      * @param {number} id
-     * @param {number[]} result
+     * @param {number[]|Float32Array} result
      */
     node_get_aabb(id, result) {
         assert.isNonNegativeInteger(id, 'id');
@@ -80201,18 +80208,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
@@ -80227,21 +80222,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;