@woosh/meep-engine 2.109.22 → 2.109.23

package/build/meep.cjs

@@ -49144,7 +49144,7 @@ function computeStridedIntegerArrayHash(
     let hash = length;
 
     for (let i = offset; i < length; i += stride) {
-        const value = array[i] >>> 0; //force int32
+        const value = array[i] >>> 0; //force uint32
 
         /**
          * Simple hashing scheme, multiplying existing hash by a prime and adding next value

package/build/meep.module.js

@@ -49142,7 +49142,7 @@ function computeStridedIntegerArrayHash(
     let hash = length;
 
     for (let i = offset; i < length; i += stride) {
-        const value = array[i] >>> 0; //force int32
+        const value = array[i] >>> 0; //force uint32
 
         /**
          * Simple hashing scheme, multiplying existing hash by a prime and adding next value

package/package.json

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

package/src/core/primitives/array/computeStridedArrayHash.d.ts

@@ -0,0 +1,13 @@
+/**
+ * Useful for computing hashes of large arrays, can pick a relevant stride and skip large chunks of memory while still capturing good amount of unique information from evenly-spaced areas of the array
+ * @template T
+ * @param {T[]|Uint32Array|Uint16Array|Uint8Array} array
+ * @param {number} offset
+ * @param {number} length
+ * @param {number} stride
+ * @param {function(T):number} elementHash
+ * @param {*} [elementHashContext]
+ * @return {number}
+ */
+export function computeStridedArrayHash<T>(array: Uint8Array | Uint16Array | Uint32Array | T[], offset: number, length: number, stride: number, elementHash: (arg0: T) => number, elementHashContext?: any): number;
+//# sourceMappingURL=computeStridedArrayHash.d.ts.map

package/src/core/primitives/array/computeStridedArrayHash.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"computeStridedArrayHash.d.ts","sourceRoot":"","sources":["../../../../../src/core/primitives/array/computeStridedArrayHash.js"],"names":[],"mappings":"AAEA;;;;;;;;;;GAUG;AACH,wGAPW,MAAM,UACN,MAAM,UACN,MAAM,4BACM,MAAM,6BAEjB,MAAM,CAwBjB"}

package/src/core/primitives/array/computeStridedArrayHash.js

@@ -0,0 +1,36 @@
+import { assert } from "../../assert.js";
+
+/**
+ * Useful for computing hashes of large arrays, can pick a relevant stride and skip large chunks of memory while still capturing good amount of unique information from evenly-spaced areas of the array
+ * @template T
+ * @param {T[]|Uint32Array|Uint16Array|Uint8Array} array
+ * @param {number} offset
+ * @param {number} length
+ * @param {number} stride
+ * @param {function(T):number} elementHash
+ * @param {*} [elementHashContext]
+ * @return {number}
+ */
+export function computeStridedArrayHash(
+    array, offset, length, stride,
+    elementHash, elementHashContext
+) {
+
+    assert.isFunction(elementHash, 'elementHash');
+
+    let hash = length;
+
+    for (let i = offset; i < length; i += stride) {
+        const value = elementHash.call(elementHashContext, array[i]);
+
+        /**
+         * Simple hashing scheme, multiplying existing hash by a prime and adding next value
+         * (h<<5) - h ===  h*31
+         * @type {number}
+         */
+        hash = ((hash << 5) - hash) + value;
+    }
+
+    // force uint32
+    return hash >>> 0;
+}

package/src/core/primitives/array/computeStridedIntegerArrayHash.js

@@ -12,7 +12,7 @@ export function computeStridedIntegerArrayHash(
     let hash = length;
 
     for (let i = offset; i < length; i += stride) {
-        const value = array[i] >>> 0; //force int32
+        const value = array[i] >>> 0; //force uint32
 
         /**
          * Simple hashing scheme, multiplying existing hash by a prime and adding next value
@@ -25,3 +25,4 @@ export function computeStridedIntegerArrayHash(
     // force uint32
     return hash >>> 0;
 }
+

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":"AAGA;;;;GAIG;AACH,sDAHW,MAAM,eAAe,GACnB,MAAM,CAsBlB"}
+{"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"}

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

@@ -1,5 +1,6 @@
 import { min2 } from "../../../../core/math/min2.js";
-import { computeStridedIntegerArrayHash } from "../../../../core/primitives/array/computeStridedIntegerArrayHash.js";
+import { computeStridedArrayHash } from "../../../../core/primitives/array/computeStridedArrayHash.js";
+import { computeHashFloat } from "../../../../core/primitives/numbers/computeHashFloat.js";
 
 /**
  *
@@ -21,7 +22,10 @@ export function computeBufferAttributeHash(attribute) {
         // 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 ^= computeStridedIntegerArrayHash(data, 0, hash_evaluation_length, stride);
+        result ^= computeStridedArrayHash(
+            data, 0, hash_evaluation_length, stride,
+            computeHashFloat
+        );
 
     }