@woosh/meep-engine 2.113.1 → 2.113.3

package/build/meep.cjs

@@ -48985,6 +48985,14 @@ function is_typed_array_equals(a, b) {
         return false;
     }
 
+    const a_constructor = a.constructor;
+    const b_constructor = b.constructor;
+
+    if (a_constructor !== b_constructor) {
+        // incompatible constructors
+        return false;
+    }
+
     if (a_length === 0) {
         // both arrays are empty
         return true;
@@ -49001,20 +49009,15 @@ function is_typed_array_equals(a, b) {
         return false;
     }
 
-    const a_constructor = a.constructor;
-    const b_constructor = b.constructor;
-
-    if (a_constructor !== b_constructor) {
-        // incompatible constructors
-        return false;
-    }
-
 
     const a_buffer = a.buffer;
     const b_buffer = b.buffer;
 
     // check if buffers are the same
-    if (a_buffer === b_buffer && a.byteOffset === b.byteOffset) {
+    const a_offset = a.byteOffset;
+    const b_offset = b.byteOffset;
+
+    if (a_buffer === b_buffer && a_offset === b_offset) {
         // using the same buffer and pointing to the same range within it
         return true;
     }
@@ -49024,14 +49027,28 @@ function is_typed_array_equals(a, b) {
 
     const bytes_per_element = a_constructor.BYTES_PER_ELEMENT;
 
-    if (bytes_per_element < 4 && byte_length % 4 === 0) {
+    if (
+        bytes_per_element < 4
+        && byte_length % 4 === 0
+        && a_offset % 4 === 0
+        && b_offset % 4 === 0
+    ) {
+
         // 4 byte alignment, can use uint32
-        a_proxy = new Uint32Array(a_buffer, a.byteOffset, byte_length / 4);
-        b_proxy = new Uint32Array(b_buffer, b.byteOffset, byte_length / 4);
-    } else if (bytes_per_element < 2 && byte_length % 2 === 0) {
+        a_proxy = new Uint32Array(a_buffer, a_offset, byte_length >>> 2);
+        b_proxy = new Uint32Array(b_buffer, b_offset, byte_length >>> 2);
+
+    } else if (
+        bytes_per_element < 2
+        && byte_length % 2 === 0
+        && a_offset % 2 === 0
+        && b_offset % 2 === 0
+    ) {
+
         // 2 byte alignment, can use uint16
-        a_proxy = new Uint16Array(a_buffer, a.byteOffset, byte_length / 2);
-        b_proxy = new Uint16Array(b_buffer, b.byteOffset, byte_length / 2);
+        a_proxy = new Uint16Array(a_buffer, a_offset, byte_length >>> 1);
+        b_proxy = new Uint16Array(b_buffer, b_offset, byte_length >>> 1);
+
     }
 
     return isArrayEqualStrict(a_proxy, b_proxy);
@@ -53059,7 +53076,7 @@ class BVH {
  * @readonly
  * @type {Uint32Array|{pointer:number}}
  */
-const SCRATCH_UINT32_TRAVERSAL_STACK = new Uint32Array(781250);
+const SCRATCH_UINT32_TRAVERSAL_STACK = new Uint32Array(781250); // size is fairly arbitrary
 
 /**
  * Pointer used to track current top of the stack, make sure to unwind once your traversal is done
@@ -84987,7 +85004,7 @@ class Deque {
     /**
      * Using static array allocator to preserve data locality.
      * Initialization via "[]" would give us a dynamically sized array,
-     * but it would have unpredictable locality as array may or may not have it's elements stored next to each other in memory
+     * but it would have unpredictable locality as array may or may not have its elements stored next to each other in memory
      * @type {T[]}
      * @private
      */
@@ -85076,9 +85093,11 @@ class Deque {
         const length = this.#data.length;
 
         if (UINT32_MAX === length) {
+            // array is already as big as it can get
             throw new Error('Maximum array size exceeded');
         }
 
+        // double existing length
         let new_length = length * 2;
 
         if (new_length > UINT32_MAX) {
@@ -85133,6 +85152,7 @@ class Deque {
     }
 
     /**
+     * Number of elements in the collection
      * @returns {number}
      */
     size() {
@@ -86080,6 +86100,8 @@ function get_pending_asset_priority_score(pending_asset) {
 }
 
 
+// TODO handle 429 HTTP error gracefully
+
 /**
  * Handles loading/generating assets
  * @template CTX