@woosh/meep-engine 2.113.2 → 2.113.3

package/build/meep.module.js

@@ -48983,6 +48983,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;
@@ -48999,20 +49007,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;
     }
@@ -49022,14 +49025,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);
@@ -86081,6 +86098,8 @@ function get_pending_asset_priority_score(pending_asset) {
 }
 
 
+// TODO handle 429 HTTP error gracefully
+
 /**
  * Handles loading/generating assets
  * @template CTX

package/package.json

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

package/src/core/collection/array/typed/is_typed_array_equals.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"is_typed_array_equals.d.ts","sourceRoot":"","sources":["../../../../../../src/core/collection/array/typed/is_typed_array_equals.js"],"names":[],"mappings":"AAGA;;;;;GAKG;AACH,yCAJW,UAAU,GAAC,WAAW,KACtB,UAAU,GAAC,WAAW,GACpB,OAAO,CAkEnB"}
+{"version":3,"file":"is_typed_array_equals.d.ts","sourceRoot":"","sources":["../../../../../../src/core/collection/array/typed/is_typed_array_equals.js"],"names":[],"mappings":"AAGA;;;;;GAKG;AACH,yCAJW,UAAU,GAAC,WAAW,KACtB,UAAU,GAAC,WAAW,GACpB,OAAO,CAmFnB"}

package/src/core/collection/array/typed/is_typed_array_equals.js

@@ -21,6 +21,14 @@ export 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;
@@ -37,20 +45,15 @@ export 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;
     }
@@ -60,14 +63,28 @@ export 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);

package/src/core/collection/array/typed/sparse_typed_array_hash.d.ts

@@ -0,0 +1,10 @@
+/**
+ *
+ * @param {Uint32Array} array
+ * @param {number} offset
+ * @param {number} length
+ * @param {number} [sample_limit]
+ * @returns {number}
+ */
+export function sparse_typed_array_hash(array: Uint32Array, offset: number, length: number, sample_limit?: number): number;
+//# sourceMappingURL=sparse_typed_array_hash.d.ts.map

package/src/core/collection/array/typed/sparse_typed_array_hash.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"sparse_typed_array_hash.d.ts","sourceRoot":"","sources":["../../../../../../src/core/collection/array/typed/sparse_typed_array_hash.js"],"names":[],"mappings":"AAIA;;;;;;;GAOG;AACH,+CANW,WAAW,UACX,MAAM,UACN,MAAM,iBACN,MAAM,GACJ,MAAM,CAelB"}

package/src/core/collection/array/typed/sparse_typed_array_hash.js

@@ -0,0 +1,26 @@
+import { min2 } from "../../../math/min2.js";
+import { computeStridedArrayHash } from "../../../primitives/array/computeStridedArrayHash.js";
+import { computeHashFloat } from "../../../primitives/numbers/computeHashFloat.js";
+
+/**
+ *
+ * @param {Uint32Array} array
+ * @param {number} offset
+ * @param {number} length
+ * @param {number} [sample_limit]
+ * @returns {number}
+ */
+export function sparse_typed_array_hash(array, offset, length, sample_limit = 31) {
+    // limit hash evaluation to first 1k of the data to random memory access and keep CPU cache usage more coherent
+    const hash_evaluation_length = min2(length, 1024);
+
+    // compute stride so that we don't have to iterate over the entire buffer, instead picking at most X(509) values to consider
+    const stride = Math.max(1, Math.ceil(hash_evaluation_length / sample_limit));
+
+    // TODO implement fast dedicated float and int paths
+
+    return computeStridedArrayHash(
+        array, 0, hash_evaluation_length, stride,
+        computeHashFloat
+    );
+}

package/src/core/geom/3d/compute_triangle_normal.d.ts

@@ -1,9 +1,9 @@
 /**
  *
- * @param {number[]|vec3} result
- * @param {number[]} vA
- * @param {number[]} vB
- * @param {number[]} vC
+ * @param {number[]|vec3|Float32Array|Float64Array} result
+ * @param {number[]|vec3|Float32Array|Float64Array} vA
+ * @param {number[]|vec3|Float32Array|Float64Array} vB
+ * @param {number[]|vec3|Float32Array|Float64Array} vC
  */
-export function compute_triangle_normal(result: number[] | vec3, vA: number[], vB: number[], vC: number[]): void;
+export function compute_triangle_normal(result: number[] | vec3 | Float32Array | Float64Array, vA: number[] | vec3 | Float32Array | Float64Array, vB: number[] | vec3 | Float32Array | Float64Array, vC: number[] | vec3 | Float32Array | Float64Array): void;
 //# sourceMappingURL=compute_triangle_normal.d.ts.map

package/src/core/geom/3d/compute_triangle_normal.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"compute_triangle_normal.d.ts","sourceRoot":"","sources":["../../../../../src/core/geom/3d/compute_triangle_normal.js"],"names":[],"mappings":"AAEA;;;;;;GAMG;AACH,gDALW,MAAM,EAAE,OAAK,MACb,MAAM,EAAE,MACR,MAAM,EAAE,MACR,MAAM,EAAE,QAiBlB"}
+{"version":3,"file":"compute_triangle_normal.d.ts","sourceRoot":"","sources":["../../../../../src/core/geom/3d/compute_triangle_normal.js"],"names":[],"mappings":"AAEA;;;;;;GAMG;AACH,gDALW,MAAM,EAAE,UAAM,YAAY,GAAC,YAAY,MACvC,MAAM,EAAE,UAAM,YAAY,GAAC,YAAY,MACvC,MAAM,EAAE,UAAM,YAAY,GAAC,YAAY,MACvC,MAAM,EAAE,UAAM,YAAY,GAAC,YAAY,QAiBjD"}

package/src/core/geom/3d/compute_triangle_normal.js

@@ -2,10 +2,10 @@ import { v3_compute_triangle_normal } from "./v3_compute_triangle_normal.js";
 
 /**
  *
- * @param {number[]|vec3} result
- * @param {number[]} vA
- * @param {number[]} vB
- * @param {number[]} vC
+ * @param {number[]|vec3|Float32Array|Float64Array} result
+ * @param {number[]|vec3|Float32Array|Float64Array} vA
+ * @param {number[]|vec3|Float32Array|Float64Array} vB
+ * @param {number[]|vec3|Float32Array|Float64Array} vC
  */
 export function compute_triangle_normal(result, vA, vB, vC) {
 

package/src/core/math/random/roundFair.js

@@ -9,7 +9,7 @@ export function roundFair(number, random) {
     const mantissa = number % 1;
     const roll = random();
 
-    if (roll < mantissa) {
+    if (roll > mantissa) {
         return Math.floor(number);
     } else {
         return Math.ceil(number);

package/src/engine/asset/AssetManager.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"AssetManager.d.ts","sourceRoot":"","sources":["../../../../src/engine/asset/AssetManager.js"],"names":[],"mappings":"AA4CA;;;;GAIG;AACH;IAgII;;;;;OAKG;IACH,oCAJW,GAAG,EAYb;IA7ID;;;;OAIG;IACH,eAEG;IAEH;;;OAGG;IACH,aAFU,YAAY,gBAAgB,EAAE,YAAY,CAAC,CAER;IAe7C;;;;;;OAMG;IACH,kBAFU,MAAM,CAEY;IAyB5B;;;;OAIG;IACH,iBAAc;IAEd;;;OAGG;IACH,mBAFU,iBAAiB,CAEiB;IAwE5C,gBAQC;IAED;;;;OAIG;IACH,qBAHW,MAAM,GACL,QAAQ,IAAI,CAAC,CAexB;IAED;;;;;OAKG;IACH,oCAFa,OAAO,CAOnB;IAED;;OAEG;IACH,cAEC;IAED,8BAEC;IAED;;;;;;OAMG;IACH,4DAJW,iBAAiB,GAEf,cAAc,CAY1B;IAED;;;;;;;;;OASG;IACH,qFAsCC;IAED;;;;;OAKG;IACH,aAJW,MAAM,QACN,MAAM,sBAehB;IA2QD;;;;;OAKG;IACH,sBA2BC;IAGD;;;;OAIG;IACH,uBAHW,MAAM,GACL,OAAO,CAIlB;IAED;;;;OAIG;IACH,sBAHW,MAAM,GACJ,wBAAY,SAAS,CAMjC;IAaD;;;;OAIG;IACH,+BAHW,MAAM,4CAqBhB;IAED;;;;OAIG;IACH,iCAHW,MAAM,+CAyBhB;IAED;;;;;;OAMG;IACH,6BAJW,MAAM,kCAEJ,QAAQ,OAAO,CAAC,CAU5B;IAED;;;;;OAKG;IACH,0BAJW,MAAM,iEAwChB;IAED;;;OAGG;IACH,uBAFW,MAAM,iBAkBhB;IAED;;;;;;OAMG;IACH,yCAFa,aAAS,IAAI,CAYzB;IAED;;;;;OAKG;IACH,eAJW,MAAM,QACN,MAAM,GACJ,OAAO,CAMnB;IAED;;;;OAIG;IACH,2BAHW,MAAM,GACL,mBAAiB,CAa5B;IAED;;;;OAIG;IACH,oBAHW,MAAM,GACL,gBAAgB,GAAC,SAAS,CAQrC;IAED;;;;;OAKG;IACH,mBAJW,MAAM,QACN,MAAM,QACN,MAAM,QAUhB;IAGL;;;OAGG;IACH,yBAFU,OAAO,CAEoB;;CANpC;4BA72B2B,0CAA0C;iCAOrC,uBAAuB;6BAM3B,mBAAmB;kCAFd,6BAA6B;kCAD7B,wBAAwB;4BAE9B,0BAA0B"}
+{"version":3,"file":"AssetManager.d.ts","sourceRoot":"","sources":["../../../../src/engine/asset/AssetManager.js"],"names":[],"mappings":"AA8CA;;;;GAIG;AACH;IAgII;;;;;OAKG;IACH,oCAJW,GAAG,EAYb;IA7ID;;;;OAIG;IACH,eAEG;IAEH;;;OAGG;IACH,aAFU,YAAY,gBAAgB,EAAE,YAAY,CAAC,CAER;IAe7C;;;;;;OAMG;IACH,kBAFU,MAAM,CAEY;IAyB5B;;;;OAIG;IACH,iBAAc;IAEd;;;OAGG;IACH,mBAFU,iBAAiB,CAEiB;IAwE5C,gBAQC;IAED;;;;OAIG;IACH,qBAHW,MAAM,GACL,QAAQ,IAAI,CAAC,CAexB;IAED;;;;;OAKG;IACH,oCAFa,OAAO,CAOnB;IAED;;OAEG;IACH,cAEC;IAED,8BAEC;IAED;;;;;;OAMG;IACH,4DAJW,iBAAiB,GAEf,cAAc,CAY1B;IAED;;;;;;;;;OASG;IACH,qFAsCC;IAED;;;;;OAKG;IACH,aAJW,MAAM,QACN,MAAM,sBAehB;IA2QD;;;;;OAKG;IACH,sBA2BC;IAGD;;;;OAIG;IACH,uBAHW,MAAM,GACL,OAAO,CAIlB;IAED;;;;OAIG;IACH,sBAHW,MAAM,GACJ,wBAAY,SAAS,CAMjC;IAaD;;;;OAIG;IACH,+BAHW,MAAM,4CAqBhB;IAED;;;;OAIG;IACH,iCAHW,MAAM,+CAyBhB;IAED;;;;;;OAMG;IACH,6BAJW,MAAM,kCAEJ,QAAQ,OAAO,CAAC,CAU5B;IAED;;;;;OAKG;IACH,0BAJW,MAAM,iEAwChB;IAED;;;OAGG;IACH,uBAFW,MAAM,iBAkBhB;IAED;;;;;;OAMG;IACH,yCAFa,aAAS,IAAI,CAYzB;IAED;;;;;OAKG;IACH,eAJW,MAAM,QACN,MAAM,GACJ,OAAO,CAMnB;IAED;;;;OAIG;IACH,2BAHW,MAAM,GACL,mBAAiB,CAa5B;IAED;;;;OAIG;IACH,oBAHW,MAAM,GACL,gBAAgB,GAAC,SAAS,CAQrC;IAED;;;;;OAKG;IACH,mBAJW,MAAM,QACN,MAAM,QACN,MAAM,QAUhB;IAGL;;;OAGG;IACH,yBAFU,OAAO,CAEoB;;CANpC;4BA/2B2B,0CAA0C;iCAOrC,uBAAuB;6BAM3B,mBAAmB;kCAFd,6BAA6B;kCAD7B,wBAAwB;4BAE9B,0BAA0B"}

package/src/engine/asset/AssetManager.js

@@ -42,6 +42,8 @@ function get_pending_asset_priority_score(pending_asset) {
 }
 
 
+// TODO handle 429 HTTP error gracefully
+
 /**
  * Handles loading/generating assets
  * @template CTX

package/src/engine/graphics/geometry/buffered/computeBufferAttributeHash.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"computeBufferAttributeHash.d.ts","sourceRoot":"","sources":["../../../../../../src/engine/graphics/geometry/buffered/computeBufferAttributeHash.js"],"names":[],"mappings":"AAIA;;;;GAIG;AACH,sDAHW,MAAM,eAAe,GACnB,MAAM,CAyBlB"}
+{"version":3,"file":"computeBufferAttributeHash.d.ts","sourceRoot":"","sources":["../../../../../../src/engine/graphics/geometry/buffered/computeBufferAttributeHash.js"],"names":[],"mappings":"AAEA;;;;GAIG;AACH,sDAHW,MAAM,eAAe,GACnB,MAAM,CAgBlB"}

package/src/engine/graphics/geometry/buffered/computeBufferAttributeHash.js

@@ -1,6 +1,4 @@
-import { min2 } from "../../../../core/math/min2.js";
-import { computeStridedArrayHash } from "../../../../core/primitives/array/computeStridedArrayHash.js";
-import { computeHashFloat } from "../../../../core/primitives/numbers/computeHashFloat.js";
+import { sparse_typed_array_hash } from "../../../../core/collection/array/typed/sparse_typed_array_hash.js";
 
 /**
  *
@@ -16,16 +14,7 @@ export function computeBufferAttributeHash(attribute) {
 
         result += data_size;
 
-        // limit hash evaluation to first 1k of the data to random memory access and keep CPU cache usage more coherent
-        const hash_evaluation_length = min2(data_size, 1024);
-
-        // compute stride so that we don't have to iterate over the entire buffer, instead picking at most X(509) values to consider
-        const stride = Math.max(1, Math.ceil(hash_evaluation_length / 31));
-
-        result ^= computeStridedArrayHash(
-            data, 0, hash_evaluation_length, stride,
-            computeHashFloat
-        );
+        result ^= sparse_typed_array_hash(data, 0, data_size);
 
     }