@woosh/meep-engine 2.113.1 → 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);
@@ -53057,7 +53074,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
@@ -84985,7 +85002,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
      */
@@ -85074,9 +85091,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) {
@@ -85131,6 +85150,7 @@ class Deque {
     }
 
     /**
+     * Number of elements in the collection
      * @returns {number}
      */
     size() {
@@ -86078,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.1",
+  "version": "2.113.3",
   "main": "build/meep.module.js",
   "module": "build/meep.module.js",
   "exports": {

package/src/core/binary/BinaryBuffer.d.ts

@@ -3,6 +3,12 @@
  * Mostly useful for serialization/deserialization tasks
  */
 export class BinaryBuffer {
+    /**
+     *
+     * @param {EndianType} type
+     * @return {BinaryBuffer}
+     */
+    static fromEndianness(type: EndianType): BinaryBuffer;
     /**
      *
      * @param {ArrayBuffer} v

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

@@ -1 +1 @@
-{"version":3,"file":"BinaryBuffer.d.ts","sourceRoot":"","sources":["../../../../src/core/binary/BinaryBuffer.js"],"names":[],"mappings":"AA4BA;;;GAGG;AACH;IA88BI;;;;OAIG;IACH,0BAHW,WAAW,GACV,YAAY,CAQvB;IAED;;;;;OAKG;IACH,8BAJW,YAAY,UACZ,YAAY,GACV,MAAM,CAQlB;IAED;;;;;OAKG;IACH,2BAJW,YAAY,UACZ,YAAY,GACV,MAAM,CAQlB;IAED;;;;;OAKG;IACH,yBAJW,YAAY,UACZ,YAAY,GACV,MAAM,CAQlB;IAED;;;;;OAKG;IACH,0BAJW,YAAY,UACZ,YAAY,GACV,MAAM,CAQlB;IAED;;;;;OAKG;IACH,0BAJW,YAAY,UACZ,YAAY,GACV,MAAM,CAQlB;IAED;;;;;OAKG;IACH,2BAJW,YAAY,UACZ,YAAY,GACV,MAAM,CAQlB;IAED;;;;;OAKG;IACH,2BAJW,YAAY,UACZ,YAAY,GACV,MAAM,CAQlB;IAED;;;;;OAKG;IACH,yBAJW,YAAY,UACZ,YAAY,UACZ,MAAM,cAUhB;IAzkCD;;;OAGG;IACH,YAFU,UAAU,GAAC,OAAO,CAES;IAErC;;;OAGG;IACH,UAFU,MAAM,CAEH;IAEb;;;;OAIG;IACH,QAFU,MAAM,CAEL;IAEX;;;OAGG;IACH,UAFU,MAAM,CAEgB;IAEhC;;;;OAIG;IACH,aAA6C;IAE7C;;;;OAIG;IACH,iBAAmC;IAEnC;;;;OAIG;IACH,qBAAyC;IAEzC;;;;OAIG;IACH,qBAAmB;IAEnB;;;OAGG;IACH,4BAEC;IAED;;OAEG;IACH,sBAFW,WAAW,QAcrB;IAED;;;OAGG;IACH,QAFa,YAAY,CAMxB;IAED;;;OAGG;IACH,sBAFW,MAAM,QAoBhB;IAED;;;OAGG;IACH,6BAFW,MAAM,QAgBhB;IAED,sBAMC;IAED,sBAMC;IAED,mBAMC;IAED,oBAMC;IAED;;;OAGG;IACH,aAFa,MAAM,CAQlB;IAED;;;OAGG;IACH,aAFa,MAAM,CAQlB;IAED;;;OAGG;IACH,cAFa,MAAM,CAQlB;IAED;;;OAGG;IACH,gBAFa,MAAM,CAQlB;IAED;;;OAGG;IACH,gBAFa,MAAM,CAQlB;IAED;;;OAGG;IACH,cAFa,MAAM,CAQlB;IAED;;;OAGG;IACH,gBAFa,MAAM,CAUlB;IAED;;;OAGG;IACH,gBAFa,MAAM,CAUlB;IAED;;;OAGG;IACH,cAFa,MAAM,CAQlB;IAED;;;OAGG;IACH,gBAFa,MAAM,CAQlB;IAED;;;OAGG;IACH,gBAFa,MAAM,CAQlB;IAED;;;;;OAKG;IACH,4BAFW,UAAU,sBAFV,MAAM,UACN,MAAM,QAOhB;IAED;;;;;OAKG;IACH,6BAFW,WAAW,sBAFX,MAAM,UACN,MAAM,QAOhB;IAED;;;;;OAKG;IACH,6BAFW,WAAW,GAAC,MAAM,EAAE,GAAC,UAAU,MAAM,CAAC,sBAFtC,MAAM,UACN,MAAM,QAOhB;IAED;;;;;OAKG;IACH,2BAFW,SAAS,sBAFT,MAAM,UACN,MAAM,QAOhB;IAED;;;;;OAKG;IACH,4BAFW,UAAU,sBAFV,MAAM,UACN,MAAM,QAOhB;IAED;;;;;OAKG;IACH,4BAFW,UAAU,sBAFV,MAAM,UACN,MAAM,QAOhB;IAED;;;;;OAKG;IACH,8BAFW,YAAY,GAAC,MAAM,EAAE,sBAFrB,MAAM,UACN,MAAM,QAOhB;IAED;;;;;OAKG;IACH,8BAFW,YAAY,sBAFZ,MAAM,UACN,MAAM,QAOhB;IAED;;;;;OAKG;IACH,0BAFW,YAAY,GAAC,MAAM,EAAE,iBAFrB,MAAM,UACN,MAAM,QAOhB;IAED;;;OAGG;IACH,oBAFW,MAAM,QAShB;IAED;;;OAGG;IACH,oBAFW,MAAM,QAShB;IAED;;;OAGG;IACH,iBAFW,MAAM,QAShB;IAED;;;OAGG;IACH,kBAFW,MAAM,QAShB;IAED;;;OAGG;IACH,kBAFW,MAAM,QAShB;IAED;;;OAGG;IACH,kBAFW,MAAM,QAShB;IAED;;;;;OAKG;IACH,wBAJW,UAAU,GAAC,MAAM,EAAE,iBACnB,MAAM,UACN,MAAM,QAMhB;IAED;;;OAGG;IACH,mBAFW,MAAM,QAShB;IAED;;;OAGG;IACH,qBAFW,MAAM,QAShB;IAED;;;OAGG;IACH,qBAFW,MAAM,QAShB;IAED;;;;;OAKG;IACH,yBAJW,WAAW,GAAC,MAAM,EAAE,iBACpB,MAAM,UACN,MAAM,QAMhB;IAED;;;OAGG;IACH,mBAFW,MAAM,QAQhB;IAED;;;OAGG;IACH,qBAFW,MAAM,QAgBhB;IAED;;;OAGG;IACH,qBAFW,MAAM,QAgBhB;IAED;;;;OAIG;IACH,oBAFW,MAAM,QAsBhB;IAED;;;OAGG;IACH,eAFa,MAAM,CAqBlB;IAED;;;OAGG;IACH,mBAFW,MAAM,QAShB;IAED;;;OAGG;IACH,qBAFW,MAAM,QAShB;IAED;;;OAGG;IACH,qBAFW,MAAM,QAShB;IAED;;;;;OAKG;IACH,yBAJW,WAAW,GAAC,MAAM,EAAE,GAAC,UAAU,MAAM,CAAC,iBACtC,MAAM,UACN,MAAM,QAMhB;IAED;;;;;OAKG;IACH,kBAJW,UAAU,GAAC,iBAAiB,iBAC5B,MAAM,UACN,MAAM,QAgChB;IAED;;;;;OAKG;IACH,uBAJW,UAAU,sBACV,MAAM,UACN,MAAM,QAiBhB;IAED;;;;OAIG;IACH,sCAgFC;IAED;;;;OAIG;IACH,yBAkEC;IAED;;;OAGG;IACH,yBAFW,MAAM,QAqBhB;IAED;;;;;OAKG;IACH,4BAJW,MAAM,oBACN,OAAO,GACL,MAAM,CAgBlB;IAkIL;;;OAGG;IACH,yBAFU,OAAO,CAEoB;CANpC;2BArmC0B,iBAAiB"}
+{"version":3,"file":"BinaryBuffer.d.ts","sourceRoot":"","sources":["../../../../src/core/binary/BinaryBuffer.js"],"names":[],"mappings":"AA4BA;;;GAGG;AACH;IA88BI;;;;OAIG;IACH,4BAHW,UAAU,GACT,YAAY,CAUvB;IAED;;;;OAIG;IACH,0BAHW,WAAW,GACV,YAAY,CAQvB;IAED;;;;;OAKG;IACH,8BAJW,YAAY,UACZ,YAAY,GACV,MAAM,CAQlB;IAED;;;;;OAKG;IACH,2BAJW,YAAY,UACZ,YAAY,GACV,MAAM,CAQlB;IAED;;;;;OAKG;IACH,yBAJW,YAAY,UACZ,YAAY,GACV,MAAM,CAQlB;IAED;;;;;OAKG;IACH,0BAJW,YAAY,UACZ,YAAY,GACV,MAAM,CAQlB;IAED;;;;;OAKG;IACH,0BAJW,YAAY,UACZ,YAAY,GACV,MAAM,CAQlB;IAED;;;;;OAKG;IACH,2BAJW,YAAY,UACZ,YAAY,GACV,MAAM,CAQlB;IAED;;;;;OAKG;IACH,2BAJW,YAAY,UACZ,YAAY,GACV,MAAM,CAQlB;IAED;;;;;OAKG;IACH,yBAJW,YAAY,UACZ,YAAY,UACZ,MAAM,cAUhB;IAxlCD;;;OAGG;IACH,YAFU,UAAU,GAAC,OAAO,CAES;IAErC;;;OAGG;IACH,UAFU,MAAM,CAEH;IAEb;;;;OAIG;IACH,QAFU,MAAM,CAEL;IAEX;;;OAGG;IACH,UAFU,MAAM,CAEgB;IAEhC;;;;OAIG;IACH,aAA6C;IAE7C;;;;OAIG;IACH,iBAAmC;IAEnC;;;;OAIG;IACH,qBAAyC;IAEzC;;;;OAIG;IACH,qBAAmB;IAEnB;;;OAGG;IACH,4BAEC;IAED;;OAEG;IACH,sBAFW,WAAW,QAcrB;IAED;;;OAGG;IACH,QAFa,YAAY,CAMxB;IAED;;;OAGG;IACH,sBAFW,MAAM,QAoBhB;IAED;;;OAGG;IACH,6BAFW,MAAM,QAgBhB;IAED,sBAMC;IAED,sBAMC;IAED,mBAMC;IAED,oBAMC;IAED;;;OAGG;IACH,aAFa,MAAM,CAQlB;IAED;;;OAGG;IACH,aAFa,MAAM,CAQlB;IAED;;;OAGG;IACH,cAFa,MAAM,CAQlB;IAED;;;OAGG;IACH,gBAFa,MAAM,CAQlB;IAED;;;OAGG;IACH,gBAFa,MAAM,CAQlB;IAED;;;OAGG;IACH,cAFa,MAAM,CAQlB;IAED;;;OAGG;IACH,gBAFa,MAAM,CAUlB;IAED;;;OAGG;IACH,gBAFa,MAAM,CAUlB;IAED;;;OAGG;IACH,cAFa,MAAM,CAQlB;IAED;;;OAGG;IACH,gBAFa,MAAM,CAQlB;IAED;;;OAGG;IACH,gBAFa,MAAM,CAQlB;IAED;;;;;OAKG;IACH,4BAFW,UAAU,sBAFV,MAAM,UACN,MAAM,QAOhB;IAED;;;;;OAKG;IACH,6BAFW,WAAW,sBAFX,MAAM,UACN,MAAM,QAOhB;IAED;;;;;OAKG;IACH,6BAFW,WAAW,GAAC,MAAM,EAAE,GAAC,UAAU,MAAM,CAAC,sBAFtC,MAAM,UACN,MAAM,QAOhB;IAED;;;;;OAKG;IACH,2BAFW,SAAS,sBAFT,MAAM,UACN,MAAM,QAOhB;IAED;;;;;OAKG;IACH,4BAFW,UAAU,sBAFV,MAAM,UACN,MAAM,QAOhB;IAED;;;;;OAKG;IACH,4BAFW,UAAU,sBAFV,MAAM,UACN,MAAM,QAOhB;IAED;;;;;OAKG;IACH,8BAFW,YAAY,GAAC,MAAM,EAAE,sBAFrB,MAAM,UACN,MAAM,QAOhB;IAED;;;;;OAKG;IACH,8BAFW,YAAY,sBAFZ,MAAM,UACN,MAAM,QAOhB;IAED;;;;;OAKG;IACH,0BAFW,YAAY,GAAC,MAAM,EAAE,iBAFrB,MAAM,UACN,MAAM,QAOhB;IAED;;;OAGG;IACH,oBAFW,MAAM,QAShB;IAED;;;OAGG;IACH,oBAFW,MAAM,QAShB;IAED;;;OAGG;IACH,iBAFW,MAAM,QAShB;IAED;;;OAGG;IACH,kBAFW,MAAM,QAShB;IAED;;;OAGG;IACH,kBAFW,MAAM,QAShB;IAED;;;OAGG;IACH,kBAFW,MAAM,QAShB;IAED;;;;;OAKG;IACH,wBAJW,UAAU,GAAC,MAAM,EAAE,iBACnB,MAAM,UACN,MAAM,QAMhB;IAED;;;OAGG;IACH,mBAFW,MAAM,QAShB;IAED;;;OAGG;IACH,qBAFW,MAAM,QAShB;IAED;;;OAGG;IACH,qBAFW,MAAM,QAShB;IAED;;;;;OAKG;IACH,yBAJW,WAAW,GAAC,MAAM,EAAE,iBACpB,MAAM,UACN,MAAM,QAMhB;IAED;;;OAGG;IACH,mBAFW,MAAM,QAQhB;IAED;;;OAGG;IACH,qBAFW,MAAM,QAgBhB;IAED;;;OAGG;IACH,qBAFW,MAAM,QAgBhB;IAED;;;;OAIG;IACH,oBAFW,MAAM,QAsBhB;IAED;;;OAGG;IACH,eAFa,MAAM,CAqBlB;IAED;;;OAGG;IACH,mBAFW,MAAM,QAShB;IAED;;;OAGG;IACH,qBAFW,MAAM,QAShB;IAED;;;OAGG;IACH,qBAFW,MAAM,QAShB;IAED;;;;;OAKG;IACH,yBAJW,WAAW,GAAC,MAAM,EAAE,GAAC,UAAU,MAAM,CAAC,iBACtC,MAAM,UACN,MAAM,QAMhB;IAED;;;;;OAKG;IACH,kBAJW,UAAU,GAAC,iBAAiB,iBAC5B,MAAM,UACN,MAAM,QAgChB;IAED;;;;;OAKG;IACH,uBAJW,UAAU,sBACV,MAAM,UACN,MAAM,QAiBhB;IAED;;;;OAIG;IACH,sCAgFC;IAED;;;;OAIG;IACH,yBAkEC;IAED;;;OAGG;IACH,yBAFW,MAAM,QAqBhB;IAED;;;;;OAKG;IACH,4BAJW,MAAM,oBACN,OAAO,GACL,MAAM,CAgBlB;IAiJL;;;OAGG;IACH,yBAFU,OAAO,CAEoB;CANpC;2BApnC0B,iBAAiB"}

package/src/core/binary/BinaryBuffer.js

@@ -1004,6 +1004,21 @@ export class BinaryBuffer {
         return result;
     }
 
+    /**
+     *
+     * @param {EndianType} type
+     * @return {BinaryBuffer}
+     */
+    static fromEndianness(type) {
+        assert.enum(type, EndianType, 'type');
+
+        const r = new BinaryBuffer();
+
+        r.endianness = type;
+
+        return r;
+    }
+
     /**
      *
      * @param {ArrayBuffer} v

package/src/core/binary/type/DataTypeIndices.d.ts

@@ -1,5 +1,6 @@
 /**
  * *
+ * Provides stable indices, mainly useful for serialization where other data is subject to change
  */
 export type DataTypeIndices = number;
 export namespace DataTypeIndices {

package/src/core/binary/type/DataTypeIndices.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"DataTypeIndices.d.ts","sourceRoot":"","sources":["../../../../../src/core/binary/type/DataTypeIndices.js"],"names":[],"mappings":";;;8BAIU,MAAM"}
+{"version":3,"file":"DataTypeIndices.d.ts","sourceRoot":"","sources":["../../../../../src/core/binary/type/DataTypeIndices.js"],"names":[],"mappings":";;;;8BAKU,MAAM"}

package/src/core/binary/type/DataTypeIndices.js

@@ -1,7 +1,8 @@
 import { BinaryDataType } from "./BinaryDataType.js";
 
 /***
- *
+ * Provides stable indices, mainly useful for serialization where other data is subject to change
+ * @readonly
  * @enum {number}
  */
 export const DataTypeIndices = {

package/src/core/collection/CuckooFilter.d.ts

@@ -1,4 +1,7 @@
 /**
+ * Space-efficient probabilistic data structure that allows testing whether a key is included in the set or not
+ * Provides definite "not in set" answer and a probabilistic "is in set" answer, certainty probability of which can be controlled
+ * @see https://en.wikipedia.org/wiki/Cuckoo_filter
  * @description Inspired by MGunlogson's CuckooFilter4J library
  */
 export class CuckooFilter {

package/src/core/collection/CuckooFilter.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"CuckooFilter.d.ts","sourceRoot":"","sources":["../../../../src/core/collection/CuckooFilter.js"],"names":[],"mappings":"AAqDA;;GAEG;AACH;IACI;;;;OAIG;IACH,+BAHW,MAAM,EA2ChB;IA5BG;;;OAGG;IACH,cAFU,MAAM,CAEgC;IAChD,sBAA8D;IAE9D;;;OAGG;IACH,cAFU,MAAM,CAE8C;IAE9D;;;OAGG;IACH,MAFU,MAAM,CAEQ;IAExB;;;OAGG;IACH,SAFU,MAAM,CAEA;IAEhB,yBAA4B;IAC5B,qBAAqB;IACrB,uBAAuB;IAG3B,oBAEC;IAED;;;;;;OAMG;IACH,uBAEC;IAED;;;;;;;;;OASG;IACH,mBAkBC;IAED;;;;;;OAMG;IACH,yBASC;IAED;;;;;;OAMG;IACH,0BAUC;IAED;;;;;OAKG;IACH,oBAIC;IAED;;;;;;OAMG;IACH,2BAUC;IAED;;;;;;;OAOG;IACH,2BALW,MAAM,kBACN,MAAM,OACN,MAAM,GACJ,MAAM,CAelB;IAED;;;;;;OAMG;IACH,0BALW,MAAM,kBACN,MAAM,OACN,MAAM,GACJ,OAAO,CAanB;IAED;;;;;;;;OAQG;IACH,wBAsBC;IAED;;;;;;;OAOG;IACH,gCAaC;IAED;;;;;OAKG;IACH,yCASC;IAED;;;;;;;;;;OAUG;IACH,mCAIC;IAED;;;;;OAKG;IACH,gCAWC;IAED;;;;;;;;;;;;;;;OAeG;IACH,aAJW,MAAM,GACJ,OAAO,CA8CnB;IAED,+BAcC;IAED;;;;;;;OAOG;IACH,sBAMC;IAED;;;;;;;;;;;;;;;;;OAiBG;IACH,aAJW,MAAM,GACJ,OAAO,CA6BnB;IAGD;;;;;;OAMG;IACH,mBAHW,MAAM,GACJ,OAAO,CAUnB;CACJ;uBA5gBsB,qBAAqB"}
+{"version":3,"file":"CuckooFilter.d.ts","sourceRoot":"","sources":["../../../../src/core/collection/CuckooFilter.js"],"names":[],"mappings":"AAqDA;;;;;GAKG;AACH;IACI;;;;OAIG;IACH,+BAHW,MAAM,EA2ChB;IA5BG;;;OAGG;IACH,cAFU,MAAM,CAEgC;IAChD,sBAA8D;IAE9D;;;OAGG;IACH,cAFU,MAAM,CAE8C;IAE9D;;;OAGG;IACH,MAFU,MAAM,CAEQ;IAExB;;;OAGG;IACH,SAFU,MAAM,CAEA;IAEhB,yBAA4B;IAC5B,qBAAqB;IACrB,uBAAuB;IAG3B,oBAEC;IAED;;;;;;OAMG;IACH,uBAEC;IAED;;;;;;;;;OASG;IACH,mBAkBC;IAED;;;;;;OAMG;IACH,yBASC;IAED;;;;;;OAMG;IACH,0BAUC;IAED;;;;;OAKG;IACH,oBAIC;IAED;;;;;;OAMG;IACH,2BAUC;IAED;;;;;;;OAOG;IACH,2BALW,MAAM,kBACN,MAAM,OACN,MAAM,GACJ,MAAM,CAelB;IAED;;;;;;OAMG;IACH,0BALW,MAAM,kBACN,MAAM,OACN,MAAM,GACJ,OAAO,CAanB;IAED;;;;;;;;OAQG;IACH,wBAsBC;IAED;;;;;;;OAOG;IACH,gCAaC;IAED;;;;;OAKG;IACH,yCASC;IAED;;;;;;;;;;OAUG;IACH,mCAIC;IAED;;;;;OAKG;IACH,gCAWC;IAED;;;;;;;;;;;;;;;OAeG;IACH,aAJW,MAAM,GACJ,OAAO,CA8CnB;IAED,+BAcC;IAED;;;;;;;OAOG;IACH,sBAMC;IAED;;;;;;;;;;;;;;;;;OAiBG;IACH,aAJW,MAAM,GACJ,OAAO,CA6BnB;IAGD;;;;;;OAMG;IACH,mBAHW,MAAM,GACJ,OAAO,CAUnB;CACJ;uBA/gBsB,qBAAqB"}

package/src/core/collection/CuckooFilter.js

@@ -52,6 +52,9 @@ function createMaskFromBitCount(count) {
 }
 
 /**
+ * Space-efficient probabilistic data structure that allows testing whether a key is included in the set or not
+ * Provides definite "not in set" answer and a probabilistic "is in set" answer, certainty probability of which can be controlled
+ * @see https://en.wikipedia.org/wiki/Cuckoo_filter
  * @description Inspired by MGunlogson's CuckooFilter4J library
  */
 export class CuckooFilter {
@@ -454,10 +457,10 @@ export class CuckooFilter {
      */
     __checkVictim(i1, i2, tag) {
         return this.__victim_tag === tag
-               && (
-                   this.__victim_index === i1
-                   || this.__victim_index === i2
-               );
+            && (
+                this.__victim_index === i1
+                || this.__victim_index === i2
+            );
     }
 
     /**
@@ -520,7 +523,7 @@ export class CuckooFilter {
         const i2 = this.__compute_alt_bucket_index(i1, tag);
 
         return this.__findTag(i1, i2, tag)
-               || (this.__victim_exists && this.__victim_tag === tag && (this.__victim_index === i1 || this.__victim_index === i2)) //check the victim
+            || (this.__victim_exists && this.__victim_tag === tag && (this.__victim_index === i1 || this.__victim_index === i2)) //check the victim
             ;
     }
 }

package/src/core/collection/SCRATCH_UINT32_TRAVERSAL_STACK.js

@@ -4,7 +4,7 @@
  * @readonly
  * @type {Uint32Array|{pointer:number}}
  */
-export const SCRATCH_UINT32_TRAVERSAL_STACK = new Uint32Array(781250);
+export 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

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/collection/queue/Deque.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"Deque.d.ts","sourceRoot":"","sources":["../../../../../src/core/collection/queue/Deque.js"],"names":[],"mappings":"AAcA;;;GAGG;AACH;IA8BI;;;OAGG;IACH,uBAFW,MAAM,EAUhB;IAqFD;;;OAGG;IACH,WAFY,OAAO,CAIlB;IAED,cAeC;IAED;;OAEG;IACH,QAFa,MAAM,CAalB;IA+CD;;;;OAIG;IACH,UAHW,CAAC,GACC,OAAO,CAYnB;IA4BD;;;;OAIG;IACH,WAFa,OAAO,CAInB;IAED;;;OAGG;IACH,YAFW,CAAC,QAOX;IAED;;;OAGG;IACH,eAFa,CAAC,GAAC,SAAS,CAQvB;IAED;;;OAGG;IACH,YAFa,CAAC,GAAC,SAAS,CAIvB;IAED;;;OAGG;IACH,WAFW,CAAC,QAOX;IAED;;;OAGG;IACH,cAFa,CAAC,CASb;IAGD;;;OAGG;IACH,WAFa,CAAC,GAAC,SAAS,CAKvB;IAED;;;;OAIG;IACH,yBAHW,MAAM,GACJ,CAAC,GAAC,SAAS,CAmBvB;IAED;;;;;OAKG;IACH,iBAJW,CAAC,EAAE,kBACH,MAAM,GACJ,CAAC,EAAE,CAUf;IAoBL,gBAAoB;IACpB,uBAAoB;IACpB,eAAmB;IAEnB;;OAEG;IACH,sBAAmB;IAzBf;;;OAGG;IACH,qBAFa,UAAU,CAAC,EAAC,IAAI,CAAC,CAS7B;;CACJ"}
+{"version":3,"file":"Deque.d.ts","sourceRoot":"","sources":["../../../../../src/core/collection/queue/Deque.js"],"names":[],"mappings":"AAcA;;;GAGG;AACH;IA8BI;;;OAGG;IACH,uBAFW,MAAM,EAUhB;IAuFD;;;OAGG;IACH,WAFY,OAAO,CAIlB;IAED,cAeC;IAED;;;OAGG;IACH,QAFa,MAAM,CAalB;IA+CD;;;;OAIG;IACH,UAHW,CAAC,GACC,OAAO,CAYnB;IA4BD;;;;OAIG;IACH,WAFa,OAAO,CAInB;IAED;;;OAGG;IACH,YAFW,CAAC,QAOX;IAED;;;OAGG;IACH,eAFa,CAAC,GAAC,SAAS,CAQvB;IAED;;;OAGG;IACH,YAFa,CAAC,GAAC,SAAS,CAIvB;IAED;;;OAGG;IACH,WAFW,CAAC,QAOX;IAED;;;OAGG;IACH,cAFa,CAAC,CASb;IAGD;;;OAGG;IACH,WAFa,CAAC,GAAC,SAAS,CAKvB;IAED;;;;OAIG;IACH,yBAHW,MAAM,GACJ,CAAC,GAAC,SAAS,CAmBvB;IAED;;;;;OAKG;IACH,iBAJW,CAAC,EAAE,kBACH,MAAM,GACJ,CAAC,EAAE,CAUf;IAoBL,gBAAoB;IACpB,uBAAoB;IACpB,eAAmB;IAEnB;;OAEG;IACH,sBAAmB;IAzBf;;;OAGG;IACH,qBAFa,UAAU,CAAC,EAAC,IAAI,CAAC,CAS7B;;CACJ"}

package/src/core/collection/queue/Deque.js

@@ -21,7 +21,7 @@ export 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
      */
@@ -112,9 +112,11 @@ export 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) {
@@ -169,6 +171,7 @@ export class Deque {
     }
 
     /**
+     * Number of elements in the collection
      * @returns {number}
      */
     size() {

package/src/core/collection/table/RowFirstTableSpec.d.ts

@@ -13,10 +13,10 @@ export class RowFirstTableSpec {
     /**
      *
      * @param {BinaryDataType[]} types
-     * @param {EndianType} [endianType]
+     * @param {EndianType} [endianness]
      * @constructor
      */
-    constructor(types: BinaryDataType[], endianType?: EndianType);
+    constructor(types: BinaryDataType[], endianness?: EndianType);
     /**
      * @readonly
      * @type {BinaryDataType[]}

package/src/core/collection/table/RowFirstTableSpec.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"RowFirstTableSpec.d.ts","sourceRoot":"","sources":["../../../../../src/core/collection/table/RowFirstTableSpec.js"],"names":[],"mappings":"AA+HA;;;GAGG;AACH;IAwGI;;;;;OAKG;IACH,kBAJW,cAAc,EAAE,eAChB,UAAU,GACR,iBAAiB,CAmB7B;IA9HD;;;;;OAKG;IACH,mBAJW,cAAc,EAAE,eAChB,UAAU,EAiEpB;IAzDG;;;OAGG;IACH,gBAFU,cAAc,EAAE,CAER;IAElB;;;OAGG;IACH,qBAFU,UAAU,CAEQ;IAE5B;;;OAGG;IACH,wBAFU,WAAW,CAEyB;IAc9C;;;OAGG;IACH,yBAFU,MAAM,CAEgB;IAEhC;;;OAGG;IACH,+BAFmB,QAAQ,QAAE,MAAM,QAAE,MAAM,EAAE,KAAG,IAAI,CAEA;IAEpD;;;OAGG;IACH,gCAFmB,QAAQ,QAAE,MAAM,QAAE,MAAM,EAAE,KAAG,IAAI,CAEC;IAIrD,mBAAsC;IACtC,mBAAsC;IAQ1C;;;OAGG;IACH,kBAFY,MAAM,CAIjB;IAED;;;OAGG;IACH,QAFY,MAAM,CAQjB;IAED;;;;OAIG;IACH,cAHW,iBAAiB,GACf,OAAO,CAQnB;IA4BL;;;OAGG;IACH,8BAFU,OAAO,CAE8B;CAN9C;+BA3P8B,qCAAqC;2BADzC,4BAA4B"}
+{"version":3,"file":"RowFirstTableSpec.d.ts","sourceRoot":"","sources":["../../../../../src/core/collection/table/RowFirstTableSpec.js"],"names":[],"mappings":"AA+HA;;;GAGG;AACH;IA4GI;;;;;OAKG;IACH,kBAJW,cAAc,EAAE,eAChB,UAAU,GACR,iBAAiB,CAmB7B;IAlID;;;;;OAKG;IACH,mBAJW,cAAc,EAAE,eAChB,UAAU,EAqEpB;IA5DG;;;OAGG;IACH,gBAFU,cAAc,EAAE,CAER;IAElB;;;OAGG;IACH,qBAFU,UAAU,CAEQ;IAE5B;;;OAGG;IACH,wBAFU,WAAW,CAEyB;IAiB9C;;;OAGG;IACH,yBAFU,MAAM,CAEgB;IAEhC;;;OAGG;IACH,+BAFmB,QAAQ,QAAE,MAAM,QAAE,MAAM,EAAE,KAAG,IAAI,CAEA;IAEpD;;;OAGG;IACH,gCAFmB,QAAQ,QAAE,MAAM,QAAE,MAAM,EAAE,KAAG,IAAI,CAEC;IAIrD,mBAAsC;IACtC,mBAAsC;IAQ1C;;;OAGG;IACH,kBAFY,MAAM,CAIjB;IAED;;;OAGG;IACH,QAFY,MAAM,CAQjB;IAED;;;;OAIG;IACH,cAHW,iBAAiB,GACf,OAAO,CAQnB;IA4BL;;;OAGG;IACH,8BAFU,OAAO,CAE8B;CAN9C;+BA/P8B,qCAAqC;2BADzC,4BAA4B"}

package/src/core/collection/table/RowFirstTableSpec.js

@@ -133,11 +133,12 @@ export class RowFirstTableSpec {
     /**
      *
      * @param {BinaryDataType[]} types
-     * @param {EndianType} [endianType]
+     * @param {EndianType} [endianness]
      * @constructor
      */
-    constructor(types, endianType = EndianType.BigEndian) {
+    constructor(types, endianness = EndianType.BigEndian) {
         assert.isArray(types, 'types');
+        assert.enum(endianness, EndianType, 'endianness');
 
         const numTypes = types.length;
 
@@ -151,7 +152,7 @@ export class RowFirstTableSpec {
          * @readonly
          * @type {EndianType}
          */
-        this.endianType = endianType;
+        this.endianType = endianness;
 
         /**
          * @readonly
@@ -163,6 +164,9 @@ export class RowFirstTableSpec {
 
         for (let index = 0; index < numTypes; index++) {
             const type = types[index];
+
+            assert.enum(type, BinaryDataType, `type[${index}]`);
+
             this.columnOffsets[index] = byteOffset;
 
             const columnByteSize = DataTypeByteSizes[type];
@@ -181,13 +185,13 @@ export class RowFirstTableSpec {
          * @readonly
          * @type {function(DataView, number, number[]): void}
          */
-        this.readRowMethod = genRowReader(types, endianType);
+        this.readRowMethod = genRowReader(types, endianness);
 
         /**
          * @readonly
          * @type {function(DataView, number, number[]): void}
          */
-        this.writeRowMethod = genRowWriter(types, endianType);
+        this.writeRowMethod = genRowWriter(types, endianness);
 
 
         //generate cell readers/writers
@@ -195,8 +199,8 @@ export class RowFirstTableSpec {
         this.cellReaders = new Array(numTypes);
 
         for (let i = 0; i < numTypes; i++) {
-            this.cellReaders[i] = compileDataViewValueReader(types[i], this.columnOffsets[i], endianType);
-            this.cellWriters[i] = compileDataViewValueWriter(types[i], this.columnOffsets[i], endianType);
+            this.cellReaders[i] = compileDataViewValueReader(types[i], this.columnOffsets[i], endianness);
+            this.cellWriters[i] = compileDataViewValueWriter(types[i], this.columnOffsets[i], endianness);
         }
     }
 

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);
 
     }