@woosh/meep-engine 2.113.3 → 2.113.6

package/build/meep.module.js

@@ -50533,11 +50533,12 @@ function computeIntegerArrayHash(data, offset, length) {
 }
 
 /**
- * Computes hash on integer values
+ * Computes hash on integer values, useful for building composite hashes
  * @param {...number} value
  * @returns {number}
  */
-function computeHashIntegerArray(...value) {
+function combine_hash(...value) {
+
     return computeIntegerArrayHash(value, 0, value.length);
 }
 
@@ -50799,7 +50800,7 @@ class Vector4 {
      * @return {number}
      */
     hash() {
-        return computeHashIntegerArray(
+        return combine_hash(
             computeHashFloat(this.x),
             computeHashFloat(this.y),
             computeHashFloat(this.z),
@@ -50926,16 +50927,21 @@ function computeStringHash(string) {
 
     const length = string.length;
 
-    let hash = 0;
+    let hash = length;
 
     for (let i = 0; i < length; i++) {
-        const charCode = string.charCodeAt(i);
+        const code_point = string.charCodeAt(i);
 
-        hash = (31 * hash + charCode) | 0;
+        /*
+         * Avoiding potentially expensive multiplication operation by using 2 cheaper operation instead
+         * (h<<5) - h ===  h*31
+         */
+        hash = ((hash << 5) - hash) + code_point;
 
     }
 
-    return hash;
+    // force uint32
+    return hash >>> 0;
 }
 
 /**
@@ -59809,9 +59815,9 @@ function array_swap_one(array, index0, index1) {
 }
 
 /**
- *
+ * @example `const my_array = new ( UintArrayForCount(x) )(length);`
  * @param {number} max_value maximum value to be contained in the array
- * @returns {function} constructor
+ * @returns {function} TypedArray constructor
  */
 function UintArrayForCount(max_value) {
 
@@ -75863,15 +75869,6 @@ class GenericRendererAdapter extends AbstractRenderAdapter {
 
 }
 
-/**
- *
- * @param {Plane} plane
- * @returns {number}
- */
-function planeHash(plane) {
-    return mortonEncode_magicbits(plane.normal.x, plane.normal.y, plane.normal.z) ^ plane.constant;
-}
-
 /**
  * @template T
  * @param {T[]} array
@@ -75897,6 +75894,23 @@ function computeHashArray(array, elementHashFunction, thisArg) {
     return hash;
 }
 
+/**
+ *
+ * @param {THREE.Color} c
+ */
+function computeHashColor(c) {
+    return c.getHex();
+}
+
+/**
+ *
+ * @param {Plane} plane
+ * @returns {number}
+ */
+function planeHash(plane) {
+    return mortonEncode_magicbits(plane.normal.x, plane.normal.y, plane.normal.z) ^ plane.constant;
+}
+
 /**
  *
  * @param {THREE.Texture} texture
@@ -75910,14 +75924,6 @@ function textureHashById(texture) {
     return texture.id;
 }
 
-/**
- *
- * @param {THREE.Color} c
- */
-function computeHashColor(c) {
-    return c.getHex();
-}
-
 /**
  *
  * @param {Material|MeshStandardMaterial|ShaderMaterial} material
@@ -75925,7 +75931,7 @@ function computeHashColor(c) {
  */
 function computeMaterialHash(material) {
 
-    let hash = computeHashIntegerArray(
+    let hash = combine_hash(
         computeHashFloat(material.alphaTest),
         material.blendDst,
         material.blendDstAlpha === null ? 0 : computeHashFloat(material.blendDstAlpha),
@@ -75959,7 +75965,7 @@ function computeMaterialHash(material) {
 
 
     if (material.isMeshStandardMaterial) {
-        hash = computeHashIntegerArray(
+        hash = combine_hash(
             hash,
             computeHashColor(material.color),
             computeHashFloat(material.roughness),
@@ -76507,7 +76513,7 @@ function computeTextureHash(t) {
 
     const specificHash = computeSpecificHash(t);
 
-    return computeHashIntegerArray(
+    return combine_hash(
         t.mapping,
         t.wrapS,
         t.wrapT,
@@ -85548,7 +85554,7 @@ class AssetDescription {
      * @returns {number}
      */
     hash() {
-        return computeHashIntegerArray(
+        return combine_hash(
             computeStringHash(this.path),
             computeStringHash(this.type)
         );
@@ -98228,7 +98234,7 @@ function isArrayEqual(first, second) {
  * @param {KeyValuePair<string,string>} pair
  */
 function computeStringPairHash(pair) {
-    return computeHashIntegerArray(
+    return combine_hash(
         computeStringHash(pair.key),
         computeStringHash(pair.value)
     );
@@ -98463,7 +98469,7 @@ class HTMLElementCacheKey {
         const tagHash = computeStringHash(this.tag);
 
 
-        this.__hash = computeHashIntegerArray(
+        this.__hash = combine_hash(
             styleHash,
             attributeHash,
             tagHash
@@ -102796,7 +102802,7 @@ class GUIElement {
      * @return {number}
      */
     hash() {
-        return computeHashIntegerArray(
+        return combine_hash(
             this.flags,
             computeStringHash(this.klass),
             this.anchor.hash(),
@@ -102933,7 +102939,7 @@ class ViewportPosition {
     }
 
     hash() {
-        return computeHashIntegerArray(
+        return combine_hash(
             this.position.hash(),
             this.offset.hash(),
             this.anchor.hash(),

package/package.json

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

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

@@ -0,0 +1,10 @@
+/**
+ * Find a range of unset bits in the {@link BitSet}
+ * useful for allocation algorithms
+ * @param {BitSet} bitset
+ * @param {number} bit_count
+ * @param {number} start_index
+ * @returns {number}
+ */
+export function bitset_find_clear_gap(bitset: BitSet, bit_count: number, start_index?: number): number;
+//# sourceMappingURL=bitset_find_clear_gap.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"bitset_find_clear_gap.d.ts","sourceRoot":"","sources":["../../../../src/core/binary/bitset_find_clear_gap.js"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AACH,iEAJW,MAAM,gBACN,MAAM,GACJ,MAAM,CAuBlB"}

package/src/core/binary/bitset_find_clear_gap.js

@@ -0,0 +1,30 @@
+/**
+ * Find a range of unset bits in the {@link BitSet}
+ * useful for allocation algorithms
+ * @param {BitSet} bitset
+ * @param {number} bit_count
+ * @param {number} start_index
+ * @returns {number}
+ */
+export function bitset_find_clear_gap(bitset, bit_count, start_index = 0) {
+    let slot_index = start_index;
+
+    main_loop:while (true) {
+
+        slot_index = bitset.nextClearBit(slot_index)
+
+        const search_range_end = slot_index + bit_count;
+
+        for (let i = slot_index; i < search_range_end; i++) {
+            if (bitset.get(i)) {
+                // slot is occupied
+                slot_index = i + 1;
+
+                continue main_loop;
+            }
+        }
+
+        // found a hole big enough
+        return slot_index;
+    }
+}

package/src/core/collection/array/combine_hash.d.ts

@@ -0,0 +1,7 @@
+/**
+ * Computes hash on integer values, useful for building composite hashes
+ * @param {...number} value
+ * @returns {number}
+ */
+export function combine_hash(...value: number[]): number;
+//# sourceMappingURL=combine_hash.d.ts.map

package/src/core/collection/array/combine_hash.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"combine_hash.d.ts","sourceRoot":"","sources":["../../../../../src/core/collection/array/combine_hash.js"],"names":[],"mappings":"AAGA;;;;GAIG;AACH,uCAHc,MAAM,KACP,MAAM,CAMlB"}

package/src/core/collection/array/combine_hash.js

@@ -0,0 +1,13 @@
+import { assert } from "../../assert.js";
+import { computeIntegerArrayHash } from "../../primitives/array/computeIntegerArrayHash.js";
+
+/**
+ * Computes hash on integer values, useful for building composite hashes
+ * @param {...number} value
+ * @returns {number}
+ */
+export function combine_hash(...value) {
+    assert.isArray(value, 'value');
+
+    return computeIntegerArrayHash(value, 0, value.length);
+}

package/src/core/collection/array/computeHashIntegerArray.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"computeHashIntegerArray.d.ts","sourceRoot":"","sources":["../../../../../src/core/collection/array/computeHashIntegerArray.js"],"names":[],"mappings":"AAEA;;;;GAIG;AACH,kDAHc,MAAM,KACP,MAAM,CAIlB"}
+{"version":3,"file":"computeHashIntegerArray.d.ts","sourceRoot":"","sources":["../../../../../src/core/collection/array/computeHashIntegerArray.js"],"names":[],"mappings":"AAEA;;;GAGG;AACH,gDAFsB,CAAC,MAAM,CAAC,OAAG,MAAM,CAEa"}

package/src/core/collection/array/computeHashIntegerArray.js

@@ -1,10 +1,7 @@
-import { computeIntegerArrayHash } from "../../primitives/array/computeIntegerArrayHash.js";
+import { combine_hash } from "./combine_hash.js";
 
 /**
- * Computes hash on integer values
- * @param {...number} value
- * @returns {number}
+ * @deprecated use {@link combine_hash} instead
+ * @type {function(...[number]): number}
  */
-export function computeHashIntegerArray(...value) {
-    return computeIntegerArrayHash(value, 0, value.length);
-}
+export const computeHashIntegerArray = combine_hash;

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

@@ -1,7 +1,7 @@
 /**
- *
+ * @example `const my_array = new ( UintArrayForCount(x) )(length);`
  * @param {number} max_value maximum value to be contained in the array
- * @returns {function} constructor
+ * @returns {function} TypedArray constructor
  */
 export function UintArrayForCount(max_value: number): Function;
 //# sourceMappingURL=uint_array_for_count.d.ts.map

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

@@ -1 +1 @@
-{"version":3,"file":"uint_array_for_count.d.ts","sourceRoot":"","sources":["../../../../../../src/core/collection/array/typed/uint_array_for_count.js"],"names":[],"mappings":"AAAA;;;;GAIG;AACH,6CAHW,MAAM,YAchB"}
+{"version":3,"file":"uint_array_for_count.d.ts","sourceRoot":"","sources":["../../../../../../src/core/collection/array/typed/uint_array_for_count.js"],"names":[],"mappings":"AAEA;;;;GAIG;AACH,6CAHW,MAAM,YAehB"}

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

@@ -1,9 +1,12 @@
+import { assert } from "../../../assert.js";
+
 /**
- *
+ * @example `const my_array = new ( UintArrayForCount(x) )(length);`
  * @param {number} max_value maximum value to be contained in the array
- * @returns {function} constructor
+ * @returns {function} TypedArray constructor
  */
 export function UintArrayForCount(max_value) {
+    assert.isNonNegativeInteger(max_value, 'max_value');
 
     if (max_value <= 256) {
         return Uint8Array;

package/src/core/collection/map/HashMap.js

@@ -1,7 +1,7 @@
 import { assert } from "../../assert.js";
 import { ctz32 } from "../../binary/ctz32.js";
 import { ceilPowerOfTwo } from "../../binary/operations/ceilPowerOfTwo.js";
-import { isPowerOfTwo } from "../../math/isPowerOrTwo.js";
+import { isPowerOfTwo } from "../../math/isPowerOfTwo.js";
 import { min2 } from "../../math/min2.js";
 import { invokeObjectEquals } from "../../model/object/invokeObjectEquals.js";
 import { invokeObjectHash } from "../../model/object/invokeObjectHash.js";

package/src/core/function/FunctionCompiler.js

@@ -1,11 +1,11 @@
 import { assert } from "../assert.js";
 import { Cache } from "../cache/Cache.js";
+import { combine_hash } from "../collection/array/combine_hash.js";
+import { computeHashArray } from "../collection/array/computeHashArray.js";
 import { isArrayEqualStrict } from "../collection/array/isArrayEqualStrict.js";
 import { invokeObjectEquals } from "../model/object/invokeObjectEquals.js";
 import { invokeObjectHash } from "../model/object/invokeObjectHash.js";
 import { computeStringHash } from "../primitives/strings/computeStringHash.js";
-import { computeHashArray } from "../collection/array/computeHashArray.js";
-import { computeHashIntegerArray } from "../collection/array/computeHashIntegerArray.js";
 import { string_compute_byte_size } from "../primitives/strings/string_compute_byte_size.js";
 
 /**
@@ -49,7 +49,7 @@ class FunctionDefinition {
     }
 
     updateHash() {
-        this.__hash = computeHashIntegerArray(
+        this.__hash = combine_hash(
             computeStringHash(this.name),
             computeStringHash(this.body),
             computeHashArray(this.args, computeStringHash)

package/src/core/geom/ConicRay.js

@@ -1,5 +1,5 @@
 import { assert } from "../assert.js";
-import { computeHashIntegerArray } from "../collection/array/computeHashIntegerArray.js";
+import { combine_hash } from "../collection/array/combine_hash.js";
 import { EPSILON } from "../math/EPSILON.js";
 import { epsilonEquals } from "../math/epsilonEquals.js";
 import { computeHashFloat } from "../primitives/numbers/computeHashFloat.js";
@@ -81,7 +81,7 @@ export class ConicRay {
     }
 
     hash() {
-        return computeHashIntegerArray(
+        return combine_hash(
             computeHashFloat(this.angle),
             this.direction.hash()
         );

package/src/core/geom/Vector4.js

@@ -1,5 +1,5 @@
 import { assert } from "../assert.js";
-import { computeHashIntegerArray } from "../collection/array/computeHashIntegerArray.js";
+import { combine_hash } from "../collection/array/combine_hash.js";
 import { Signal } from "../events/signal/Signal.js";
 import { lerp } from "../math/lerp.js";
 import { computeHashFloat } from "../primitives/numbers/computeHashFloat.js";
@@ -273,7 +273,7 @@ class Vector4 {
      * @return {number}
      */
     hash() {
-        return computeHashIntegerArray(
+        return combine_hash(
             computeHashFloat(this.x),
             computeHashFloat(this.y),
             computeHashFloat(this.z),

package/src/core/math/{isPowerOrTwo.d.ts → isPowerOfTwo.d.ts}

@@ -6,4 +6,4 @@
  * @returns {boolean}
  */
 export function isPowerOfTwo(value: number): boolean;
-//# sourceMappingURL=isPowerOrTwo.d.ts.map
+//# sourceMappingURL=isPowerOfTwo.d.ts.map

package/src/core/math/isPowerOfTwo.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"isPowerOfTwo.d.ts","sourceRoot":"","sources":["../../../../src/core/math/isPowerOfTwo.js"],"names":[],"mappings":"AAEA;;;;;;GAMG;AACH,oCAHW,MAAM,GACJ,OAAO,CAQnB"}

package/src/core/model/node-graph/NodeGraph.d.ts

@@ -25,6 +25,12 @@ export class NodeGraph {
      * @private
      */
     private readonly __idpConnections;
+    /**
+     * Gets incremented every time structure of the graph changes, meaning nodes or connections are added/removed
+     * Unsigned integer value
+     * @return {number}
+     */
+    get version(): number;
     /**
      * @readonly
      */
@@ -138,6 +144,7 @@ export class NodeGraph {
      * Same as getNode but throw exception when node doesn't exist
      * @param {number} id
      * @returns {NodeInstance}
+     * @throws if node doesn't exist
      */
     getNodeSafe(id: number): NodeInstance;
     /**
@@ -207,6 +214,7 @@ export class NodeGraph {
      * @type {boolean}
      */
     readonly isNodeGraph: boolean;
+    #private;
 }
 import { NodeInstance } from "./node/NodeInstance.js";
 import { Connection } from "./Connection.js";

package/src/core/model/node-graph/NodeGraph.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"NodeGraph.d.ts","sourceRoot":"","sources":["../../../../../src/core/model/node-graph/NodeGraph.js"],"names":[],"mappings":"AASA;IAEI;;;;OAIG;IACH,uBAAmB;IAEnB;;;;OAIG;IACH,6BAAyB;IAEzB;;;;;OAKG;IACH,4BAA0B;IAE1B;;;;;OAKG;IACH,kCAAgC;IAEhC;;OAEG;IACH;QACI;;;WAGG;;QAGH;;;WAGG;;QAGH;;;WAGG;;QAGH;;;WAGG;;MAEL;IAEF;;OAEG;IACH,cAMC;IAED;;;OAGG;IACH,YAFW,SAAS,QAYnB;IAED;;;OAGG;IACH,SAFa,SAAS,CAQrB;IAED;;;;;;OAMG;IACH,aAHW,SAAS,GACP;QAAC,WAAW,EAAC,UAAU,EAAE,CAAC;QAAC,KAAK,EAAC,YAAY,EAAE,CAAA;KAAC,CAe5D;IAED;;;;;;;;OAQG;IACH,sCAJW,YAAY,EAAE,GAEZ;QAAC,WAAW,EAAC,UAAU,EAAE,CAAC;QAAC,KAAK,EAAC,YAAY,EAAE,CAAA;KAAC,CAmF5D;IAED;;;;OAIG;IACH,8BAHoB,YAAY,+BAK/B;IAED;;;;OAIG;IACH,oCAHoB,UAAU,+BAK7B;IAED;;;OAGG;IACH,YAFY,YAAY,EAAE,CAIzB;IAED;;;OAGG;IACH,kBAFY,UAAU,EAAE,CAIvB;IAED;;;;OAIG;IACH,cAHW,YAAY,GACV,OAAO,CAenB;IAED;;;;OAIG;IACH,qDAFa,YAAY,EAAE,CAqB1B;IAED;;;;OAIG;IACH,0DAFa,YAAY,EAAE,CAqB1B;IAED;;;;OAIG;IACH,YAHW,MAAM,GACJ,YAAY,GAAC,SAAS,CAkBlC;IAED;;;;OAIG;IACH,gBAHW,MAAM,GACJ,YAAY,CAUxB;IAED;;;;OAIG;IACH,kBAHW,MAAM,GACJ,UAAU,GAAC,SAAS,CAgBhC;IAED;;;;;OAKG;IACH,+BAJW,MAAM,WACN,MAAM,GACJ,4BAA0B,SAAS,CAY/C;IAED;;;;OAIG;IACH,mCAFa,MAAM,CAclB;IAED;;;OAGG;IACH,cAFW,YAAY,QAgBtB;IAED;;;;OAIG;IACH,eAHW,MAAM,GACJ,OAAO,CA4BnB;IAED;;;;;;;;OAQG;IACH,uCANW,MAAM,cACN,MAAM,cACN,MAAM,cACN,MAAM,GACJ,MAAM,CAqClB;IAED;;;;;;;OAOG;IACH,6BANW,MAAM,cACN,MAAM,cACN,MAAM,cACN,MAAM,GACJ,MAAM,CAoDlB;IAED;;;;OAIG;IACH,qBAHW,MAAM,GACJ,OAAO,CAuBnB;IAED;;;;;OAKG;IACH,iCAJW,MAAM,UACN,MAAM,EAAE,GACN,MAAM,CAyBlB;IAGL;;;OAGG;IACH,sBAFU,OAAO,CAEc;CAN9B;6BA5nB4B,wBAAwB;2BAD1B,iBAAiB"}
+{"version":3,"file":"NodeGraph.d.ts","sourceRoot":"","sources":["../../../../../src/core/model/node-graph/NodeGraph.js"],"names":[],"mappings":"AASA;IAEI;;;;OAIG;IACH,uBAAmB;IAEnB;;;;OAIG;IACH,6BAAyB;IAEzB;;;;;OAKG;IACH,4BAA0B;IAE1B;;;;;OAKG;IACH,kCAAgC;IAQhC;;;;OAIG;IACH,sBAEC;IAED;;OAEG;IACH;QACI;;;WAGG;;QAGH;;;WAGG;;QAGH;;;WAGG;;QAGH;;;WAGG;;MAEL;IAEF;;OAEG;IACH,cAQC;IAED;;;OAGG;IACH,YAFW,SAAS,QAYnB;IAED;;;OAGG;IACH,SAFa,SAAS,CAQrB;IAED;;;;;;OAMG;IACH,aAHW,SAAS,GACP;QAAC,WAAW,EAAC,UAAU,EAAE,CAAC;QAAC,KAAK,EAAC,YAAY,EAAE,CAAA;KAAC,CAe5D;IAED;;;;;;;;OAQG;IACH,sCAJW,YAAY,EAAE,GAEZ;QAAC,WAAW,EAAC,UAAU,EAAE,CAAC;QAAC,KAAK,EAAC,YAAY,EAAE,CAAA;KAAC,CAmF5D;IAED;;;;OAIG;IACH,8BAHoB,YAAY,+BAK/B;IAED;;;;OAIG;IACH,oCAHoB,UAAU,+BAK7B;IAED;;;OAGG;IACH,YAFY,YAAY,EAAE,CAIzB;IAED;;;OAGG;IACH,kBAFY,UAAU,EAAE,CAIvB;IAED;;;;OAIG;IACH,cAHW,YAAY,GACV,OAAO,CAgBnB;IAED;;;;OAIG;IACH,qDAFa,YAAY,EAAE,CAsB1B;IAED;;;;OAIG;IACH,0DAFa,YAAY,EAAE,CAqB1B;IAED;;;;OAIG;IACH,YAHW,MAAM,GACJ,YAAY,GAAC,SAAS,CAkBlC;IAED;;;;;OAKG;IACH,gBAJW,MAAM,GACJ,YAAY,CAWxB;IAED;;;;OAIG;IACH,kBAHW,MAAM,GACJ,UAAU,GAAC,SAAS,CAgBhC;IAED;;;;;OAKG;IACH,+BAJW,MAAM,WACN,MAAM,GACJ,4BAA0B,SAAS,CAY/C;IAED;;;;OAIG;IACH,mCAFa,MAAM,CAclB;IAED;;;OAGG;IACH,cAFW,YAAY,QAkBtB;IAED;;;;OAIG;IACH,eAHW,MAAM,GACJ,OAAO,CA8BnB;IAED;;;;;;;;OAQG;IACH,uCANW,MAAM,cACN,MAAM,cACN,MAAM,cACN,MAAM,GACJ,MAAM,CAqClB;IAED;;;;;;;OAOG;IACH,6BANW,MAAM,cACN,MAAM,cACN,MAAM,cACN,MAAM,GACJ,MAAM,CAsDlB;IAED;;;;OAIG;IACH,qBAHW,MAAM,GACJ,OAAO,CAyBnB;IAED;;;;;OAKG;IACH,iCAJW,MAAM,UACN,MAAM,EAAE,GACN,MAAM,CAyBlB;IAGL;;;OAGG;IACH,sBAFU,OAAO,CAEc;;CAN9B;6BAxpB4B,wBAAwB;2BAD1B,iBAAiB"}

package/src/core/model/node-graph/NodeGraph.js

@@ -39,6 +39,21 @@ export class NodeGraph {
      */
     __idpConnections = new IdPool();
 
+    /**
+     * Gets incremented every time structure of the graph changes
+     * @type {number}
+     */
+    #version = 0;
+
+    /**
+     * Gets incremented every time structure of the graph changes, meaning nodes or connections are added/removed
+     * Unsigned integer value
+     * @return {number}
+     */
+    get version() {
+        return this.#version;
+    }
+
     /**
      * @readonly
      */
@@ -77,6 +92,8 @@ export class NodeGraph {
 
         this.__idpNodes.reset();
         this.__idpConnections.reset();
+
+        this.#version++;
     }
 
     /**
@@ -261,6 +278,7 @@ export class NodeGraph {
      * @returns {boolean}
      */
     hasNode(node) {
+
         const existing_node = this.getNode(node.id);
 
         if (existing_node === undefined) {
@@ -281,6 +299,7 @@ export class NodeGraph {
      * @returns {NodeInstance[]}
      */
     getNodesByDescription(description) {
+
         assert.defined(description, 'description');
         assert.notNull(description, 'description');
         assert.equal(description.isNodeDescription, true, 'description.isNodeDescription !== true');
@@ -354,6 +373,7 @@ export class NodeGraph {
      * Same as getNode but throw exception when node doesn't exist
      * @param {number} id
      * @returns {NodeInstance}
+     * @throws if node doesn't exist
      */
     getNodeSafe(id) {
         const result = this.getNode(id);
@@ -441,6 +461,8 @@ export class NodeGraph {
 
         //record the node
         this.nodes.add(node);
+
+        this.#version++;
     }
 
     /**
@@ -473,6 +495,8 @@ export class NodeGraph {
         //release id
         this.__idpNodes.release(id);
 
+        this.#version++;
+
         return true;
     }
 
@@ -529,6 +553,7 @@ export class NodeGraph {
      * @param {number} targetNode
      * @param {number} targetPort
      * @returns {number} ID of created or already existing connection
+     * @throws if any node or port are not found
      */
     createConnection(sourceNode, sourcePort, targetNode, targetPort) {
         assert.isNonNegativeInteger(sourceNode, 'sourceNode');
@@ -579,6 +604,8 @@ export class NodeGraph {
         array_push_if_unique(sourceEndpoint.connections, connection);
         array_push_if_unique(targetEndpoint.connections, connection);
 
+        this.#version++;
+
         return id;
     }
 
@@ -607,6 +634,8 @@ export class NodeGraph {
         array_remove_first(sourceEndpoint.connections, connection);
         array_remove_first(targetEndpoint.connections, connection);
 
+        this.#version++;
+
         return true;
     }
 

package/src/core/model/node-graph/node/NodeInstancePortReference.js

@@ -1,5 +1,5 @@
 import { assert } from "../../../assert.js";
-import { computeHashIntegerArray } from "../../../collection/array/computeHashIntegerArray.js";
+import { combine_hash } from "../../../collection/array/combine_hash.js";
 
 /**
  *
@@ -133,7 +133,7 @@ export class NodeInstancePortReference {
     }
 
     hash() {
-        return computeHashIntegerArray(
+        return combine_hash(
             this.instance.hash(),
             this.port.hash()
         );

package/src/core/model/reactive/model/ReactiveBinaryExpression.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"ReactiveBinaryExpression.d.ts","sourceRoot":"","sources":["../../../../../../src/core/model/reactive/model/ReactiveBinaryExpression.js"],"names":[],"mappings":"AAIA;;GAEG;AACH;IACI,cAqBC;IAlBG;;;OAGG;IACH,MAFU,0BAAmB,IAAI,CAEjB;IAChB;;;OAGG;IACH,OAFU,0BAAmB,IAAI,CAEhB;IAEjB;;;;OAIG;IACH,mBAA2B;IAI/B,uBAQC;IAED,wBAcC;IAED,eAMC;IAED,0BAQC;IAED,eAUC;IAED;;;OAGG;IACH,kCAFa,IAAE,OAAO,GAAC,MAAM,CAI5B;IAED,2CAKC;IAED;;;;OAIG;IACH,qCAkBC;IAED,mBAaC;IAyBL;;;;;;OAMG;IACH,wBAFU,OAAO,CAE+B;IAEhD;;;OAGG;IACH,6BAFU,OAAO,CAEoC;CAfpD;mCAlKkC,yBAAyB"}
+{"version":3,"file":"ReactiveBinaryExpression.d.ts","sourceRoot":"","sources":["../../../../../../src/core/model/reactive/model/ReactiveBinaryExpression.js"],"names":[],"mappings":"AAIA;;GAEG;AACH;IACI,cAqBC;IAlBG;;;OAGG;IACH,MAFU,0BAAmB,IAAI,CAEjB;IAChB;;;OAGG;IACH,OAFU,0BAAmB,IAAI,CAEhB;IAEjB;;;;OAIG;IACH,mBAA2B;IAI/B,uBAQC;IAED,wBAcC;IAED,eAMC;IAED,0BAQC;IAED,eAUC;IAED;;;OAGG;IACH,kCAFa,IAAE,OAAO,GAAC,MAAM,CAI5B;IAED,2CAKC;IAED;;;;OAIG;IACH,qCAkBC;IAED,mBAaC;IAyBL;;;;;;OAMG;IACH,wBAFU,OAAO,CAE+B;IAEhD;;;OAGG;IACH,6BAFU,OAAO,CAEoC;CAfpD;mCAjKkC,yBAAyB"}

package/src/core/model/reactive/model/ReactiveBinaryExpression.js

@@ -1,6 +1,6 @@
 import { assert } from "../../../assert.js";
+import { combine_hash } from "../../../collection/array/combine_hash.js";
 import { ReactiveExpression } from "./ReactiveExpression.js";
-import { computeHashIntegerArray } from "../../../collection/array/computeHashIntegerArray.js";
 
 /**
  * @extends {ReactiveExpression}
@@ -56,7 +56,7 @@ export class ReactiveBinaryExpression extends ReactiveExpression {
     }
 
     hash() {
-        return computeHashIntegerArray(
+        return combine_hash(
             this.left.hash(),
             this.right.hash(),
             super.hash()

package/src/core/model/reactive/model/terminal/ReactiveReference.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"ReactiveReference.d.ts","sourceRoot":"","sources":["../../../../../../../src/core/model/reactive/model/terminal/ReactiveReference.js"],"names":[],"mappings":"AAOA;;GAEG;AACH;IAEI;;;OAGG;IACH,kBAFW,MAAM,EAgBhB;IAXG;;;OAGG;IACH,MAFU,MAAM,CAEA;IAEhB;;;OAGG;IACH,QAFU,mDAA0C,CAElC;IAGtB;;;OAGG;IACH,YAFW,iBAAiB,QAU3B;IAED;;;OAGG;IACH,SAFY,iBAAiB,CAQ5B;IAED,gCAEC;IAED,2BAmBC;IAED,mBAQC;IAED,wBAKC;IAED,iBAEC;IAGD,eAKC;IAED,0BAGC;IAOL;;;OAGG;IACH,qBAFU,OAAO,CAEqB;IAEtC;;;OAGG;IACH,sBAFU,OAAO,CAEsB;CAZtC;;IAcD;;;;;OAKG;IACH,6DAaC;;mCAtJkC,0BAA0B"}
+{"version":3,"file":"ReactiveReference.d.ts","sourceRoot":"","sources":["../../../../../../../src/core/model/reactive/model/terminal/ReactiveReference.js"],"names":[],"mappings":"AAOA;;GAEG;AACH;IAEI;;;OAGG;IACH,kBAFW,MAAM,EAgBhB;IAXG;;;OAGG;IACH,MAFU,MAAM,CAEA;IAEhB;;;OAGG;IACH,QAFU,mDAA0C,CAElC;IAGtB;;;OAGG;IACH,YAFW,iBAAiB,QAU3B;IAED;;;OAGG;IACH,SAFY,iBAAiB,CAQ5B;IAED,gCAEC;IAED,2BAmBC;IAED,mBAQC;IAED,wBAKC;IAED,iBAEC;IAGD,eAKC;IAED,0BAGC;IAOL;;;OAGG;IACH,qBAFU,OAAO,CAEqB;IAEtC;;;OAGG;IACH,sBAFU,OAAO,CAEsB;CAZtC;;IAcD;;;;;OAKG;IACH,6DAaC;;mCArJkC,0BAA0B"}

package/src/core/model/reactive/model/terminal/ReactiveReference.js

@@ -1,8 +1,8 @@
 import { assert } from "../../../../assert.js";
+import { combine_hash } from "../../../../collection/array/combine_hash.js";
 import DataType from "../../../../parser/simple/DataType.js";
 import { computeStringHash } from "../../../../primitives/strings/computeStringHash.js";
 import { ReactiveExpression } from "../ReactiveExpression.js";
-import { computeHashIntegerArray } from "../../../../collection/array/computeHashIntegerArray.js";
 
 
 /**
@@ -104,7 +104,7 @@ export class ReactiveReference extends ReactiveExpression {
 
 
     hash() {
-        return computeHashIntegerArray(
+        return combine_hash(
             computeStringHash(this.name),
             super.hash()
         );

package/src/core/primitives/strings/computeStringHash.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"computeStringHash.d.ts","sourceRoot":"","sources":["../../../../../src/core/primitives/strings/computeStringHash.js"],"names":[],"mappings":"AAAA;;;;GAIG;AACH,0CAHW,MAAM,GAAC,IAAI,GAAC,SAAS,GACnB,MAAM,CAuBlB"}
+{"version":3,"file":"computeStringHash.d.ts","sourceRoot":"","sources":["../../../../../src/core/primitives/strings/computeStringHash.js"],"names":[],"mappings":"AAEA;;;;GAIG;AACH,0CAHW,MAAM,GAAC,IAAI,GAAC,SAAS,GACnB,MAAM,CA8BlB"}

package/src/core/primitives/strings/computeStringHash.js

@@ -1,3 +1,5 @@
+import { assert } from "../../assert.js";
+
 /**
  *
  * @param {string|null|undefined} string
@@ -12,16 +14,23 @@ export function computeStringHash(string) {
         return 1;
     }
 
+    assert.isString(string,'string');
+
     const length = string.length;
 
-    let hash = 0;
+    let hash = length;
 
     for (let i = 0; i < length; i++) {
-        const charCode = string.charCodeAt(i);
+        const code_point = string.charCodeAt(i);
 
-        hash = (31 * hash + charCode) | 0;
+        /*
+         * Avoiding potentially expensive multiplication operation by using 2 cheaper operation instead
+         * (h<<5) - h ===  h*31
+         */
+        hash = ((hash << 5) - hash) + code_point;
 
     }
 
-    return hash;
+    // force uint32
+    return hash >>> 0;
 }

package/src/engine/animation/curve/compression/downsample_float_array_curve_by_error.js

@@ -1,13 +1,13 @@
 //
 
 
-import { max2 } from "../../../../core/math/max2.js";
+import { array_copy } from "../../../../core/collection/array/array_copy.js";
+import { isPowerOfTwo } from "../../../../core/math/isPowerOfTwo.js";
 import { lerp } from "../../../../core/math/lerp.js";
-import { min3 } from "../../../../core/math/min3.js";
+import { max2 } from "../../../../core/math/max2.js";
 import { max3 } from "../../../../core/math/max3.js";
+import { min3 } from "../../../../core/math/min3.js";
 import { downsample_float_array } from "./downsample_float_array.js";
-import { array_copy } from "../../../../core/collection/array/array_copy.js";
-import { isPowerOfTwo } from "../../../../core/math/isPowerOrTwo.js";
 
 /**
  *