@woosh/meep-engine 2.94.8 → 2.95.1

package/build/meep.cjs

@@ -114510,7 +114510,7 @@ class StorageAchievementGateway extends AchievementGateway {
  * If multiple elements with the same highest score exist, the result will be first such encountered element
  * @template T
  * @param {T[]} array
- * @param {function(T):number} scoreFunction
+ * @param {function(el:T, index:number):number} scoreFunction
  * @returns {T|undefined}
  */
 function arrayPickBestElement(array, scoreFunction) {
@@ -114526,13 +114526,13 @@ function arrayPickBestElement(array, scoreFunction) {
 
     bestElement = array[0];
 
-    bestScore = scoreFunction(bestElement);
+    bestScore = scoreFunction(bestElement, 0);
 
     for (let i = 1; i < size; i++) {
         const el = array[i];
 
         // compute score
-        const score = scoreFunction(el);
+        const score = scoreFunction(el, i);
 
         if (score > bestScore) {
             bestScore = score;

package/build/meep.module.js

@@ -114508,7 +114508,7 @@ class StorageAchievementGateway extends AchievementGateway {
  * If multiple elements with the same highest score exist, the result will be first such encountered element
  * @template T
  * @param {T[]} array
- * @param {function(T):number} scoreFunction
+ * @param {function(el:T, index:number):number} scoreFunction
  * @returns {T|undefined}
  */
 function arrayPickBestElement(array, scoreFunction) {
@@ -114524,13 +114524,13 @@ function arrayPickBestElement(array, scoreFunction) {
 
     bestElement = array[0];
 
-    bestScore = scoreFunction(bestElement);
+    bestScore = scoreFunction(bestElement, 0);
 
     for (let i = 1; i < size; i++) {
         const el = array[i];
 
         // compute score
-        const score = scoreFunction(el);
+        const score = scoreFunction(el, i);
 
         if (score > bestScore) {
             bestScore = score;

package/package.json

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

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

@@ -1 +1 @@
-{"version":3,"file":"arrayPickBestElement.d.ts","sourceRoot":"","sources":["../../../../../src/core/collection/array/arrayPickBestElement.js"],"names":[],"mappings":"AAEA;;;;;;;GAOG;AACH,gFAHuB,MAAM,KAqC5B"}
+{"version":3,"file":"arrayPickBestElement.d.ts","sourceRoot":"","sources":["../../../../../src/core/collection/array/arrayPickBestElement.js"],"names":[],"mappings":"AAEA;;;;;;;GAOG;AACH,2EAkCC"}

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

@@ -5,7 +5,7 @@ import { assert } from "../../assert.js";
  * If multiple elements with the same highest score exist, the result will be first such encountered element
  * @template T
  * @param {T[]} array
- * @param {function(T):number} scoreFunction
+ * @param {function(el:T, index:number):number} scoreFunction
  * @returns {T|undefined}
  */
 export function arrayPickBestElement(array, scoreFunction) {
@@ -23,7 +23,7 @@ export function arrayPickBestElement(array, scoreFunction) {
 
     bestElement = array[0];
 
-    bestScore = scoreFunction(bestElement);
+    bestScore = scoreFunction(bestElement, 0);
 
     assert.isNumber(bestScore, 'bestScore');
 
@@ -31,7 +31,7 @@ export function arrayPickBestElement(array, scoreFunction) {
         const el = array[i];
 
         // compute score
-        const score = scoreFunction(el);
+        const score = scoreFunction(el, i);
 
         assert.isNumber(score, 'score');
 

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

@@ -1,8 +1,8 @@
 /**
  * @template T
  * @param {T[]} array
- * @param {function(T):number} scoreFunction
+ * @param {function(el:T, index:number):number} scoreFunction
  * @returns {T[]}
  */
-export function arrayPickBestElements<T>(array: T[], scoreFunction: (arg0: T) => number): T[];
+export function arrayPickBestElements<T>(array: T[], scoreFunction: any): T[];
 //# sourceMappingURL=arrayPickBestElements.d.ts.map

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

@@ -1 +1 @@
-{"version":3,"file":"arrayPickBestElements.d.ts","sourceRoot":"","sources":["../../../../../src/core/collection/array/arrayPickBestElements.js"],"names":[],"mappings":"AAEA;;;;;GAKG;AACH,iFAHuB,MAAM,OA6C5B"}
+{"version":3,"file":"arrayPickBestElements.d.ts","sourceRoot":"","sources":["../../../../../src/core/collection/array/arrayPickBestElements.js"],"names":[],"mappings":"AAEA;;;;;GAKG;AACH,8EA0CC"}

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

@@ -3,7 +3,7 @@ import { assert } from "../../assert.js";
 /**
  * @template T
  * @param {T[]} array
- * @param {function(T):number} scoreFunction
+ * @param {function(el:T, index:number):number} scoreFunction
  * @returns {T[]}
  */
 export function arrayPickBestElements(array, scoreFunction) {
@@ -22,7 +22,7 @@ export function arrayPickBestElements(array, scoreFunction) {
 
     const first = array[0];
 
-    bestScore = scoreFunction(first);
+    bestScore = scoreFunction(first, 0);
 
     assert.isNumber(bestScore, 'bestScore');
 
@@ -32,7 +32,7 @@ export function arrayPickBestElements(array, scoreFunction) {
         const el = array[i];
 
         // compute score
-        const score = scoreFunction(el);
+        const score = scoreFunction(el, i);
 
         assert.isNumber(score, 'score');
 

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

@@ -0,0 +1,8 @@
+/**
+ * Returns a copy without any duplicate elements
+ * @template T
+ * @param {T[]} input
+ * @return {T[]}
+ */
+export function array_deduplicate<T>(input: T[]): T[];
+//# sourceMappingURL=array_deduplicate.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"array_deduplicate.d.ts","sourceRoot":"","sources":["../../../../../src/core/collection/array/array_deduplicate.js"],"names":[],"mappings":"AAAA;;;;;GAKG;AACH,sDAEC"}

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

@@ -0,0 +1,9 @@
+/**
+ * Returns a copy without any duplicate elements
+ * @template T
+ * @param {T[]} input
+ * @return {T[]}
+ */
+export function array_deduplicate(input) {
+    return Array.from(new Set(input));
+}

package/src/core/collection/array/array_deduplicate.spec.d.ts

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=array_deduplicate.spec.d.ts.map

package/src/core/collection/array/array_deduplicate.spec.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"array_deduplicate.spec.d.ts","sourceRoot":"","sources":["../../../../../src/core/collection/array/array_deduplicate.spec.js"],"names":[],"mappings":""}

package/src/core/collection/array/array_deduplicate.spec.js

@@ -0,0 +1,11 @@
+import { array_deduplicate } from "./array_deduplicate.js";
+
+test("basics", () => {
+    expect(array_deduplicate([])).toEqual([]);
+    expect(array_deduplicate([1])).toEqual([1]);
+    expect(array_deduplicate([1, 2])).toEqual([1, 2]);
+    expect(array_deduplicate([1, 2, 2])).toEqual([1, 2]);
+    expect(array_deduplicate([1, 2, 1])).toEqual([1, 2]);
+    expect(array_deduplicate([1, 1, 2])).toEqual([1, 2]);
+    expect(array_deduplicate([1, 2])).toEqual([1, 2]);
+});

package/src/core/geom/2d/hash-grid/SpatialHashGrid.spec.js

@@ -209,7 +209,7 @@ test("add 3 element and remove in same order, expect grid to be empty", () => {
     expect(grid.is_cell_empty(1, 1)).toBe(true);
 });
 
-test("performance, insertion 1m random", () => {
+test.skip("performance, insertion 1m random", () => {
     const grid = new SpatialHashGrid(100, 100, 1);
 
     const random = seededRandom(42);

package/src/core/geom/2d/hash-grid/shg_query_elements_circle.spec.js

@@ -3,7 +3,7 @@ import { seededRandom } from "../../../math/random/seededRandom.js";
 import { shg_query_elements_circle } from "./shg_query_elements_circle.js";
 import { SpatialHashGrid } from "./SpatialHashGrid.js";
 
-test("performance, 10k objects, 1m queries", () => {
+test.skip("performance, 10k objects, 1m queries", () => {
     const OBJECT_COUNT = 30000;
     const QUERY_COUNT = 1e6;
 

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

@@ -1 +1 @@
-{"version":3,"file":"NodeInstance.d.ts","sourceRoot":"","sources":["../../../../../../src/core/model/node-graph/node/NodeInstance.js"],"names":[],"mappings":"AAcA;IAEI;;;OAGG;IACH,IAFU,MAAM,CAEE;IAElB;;;OAGG;IACH,6BAAmB;IAEnB;;;OAGG;IACH,WAFU,yBAAyB,EAAE,CAEtB;IAEf;;;OAGG;IACH,gBAAgB;IAEhB;;;OAGG;IACH,qBAAmB;IAEnB;;;OAGG;IACH,aAFU,gBAAgB,CAED;IAEzB;;;;;;OAMG;IACH,wBAFU,MAAM,CAEE;IAElB;;OAEG;IACH;QACI;;;WAGG;mCADO,OAAO,MAAM,WAAO;QAG9B;;;WAGG;iCADO,OAAO,MAAM,MAAI;QAG3B;;;WAGG;mCADO,OAAO,MAAM,MAAI;MAG7B;IAEF;;;;;;OAMG;IACH,yBALW,MAAM,aACN,aAAa,UACb,YAAY,GACV,MAAM,CAsBlB;IAED;;;OAGG;IACH,gDAEC;IAED;;;OAGG;IACH,+CAEC;IAGD;;;OAGG;IACH,mCAEC;IAED;;;;OAIG;IACH,kCAEC;IAED;;;;OAIG;IACH,mBAHW,MAAM,oBAKhB;IAED;;;;OAIG;IACH,mBAHW,MAAM,OAKhB;IAED;;;;OAIG;IACH,yBAHW,MAAM,KAOhB;IAED;;;;OAIG;IACH,2BAHW,MAAM,oBAmChB;IAED;;;;OAIG;IACH,oBAHW,MAAM,GACJ,OAAO,CAkBnB;IAED;;;OAGG;IACH,uCAQC;IAED,wBAIC;IAED;;;OAGG;IACH,4CAwBC;IAED;;;;OAIG;IACH,kBAHW,MAAM,GACJ,yBAAyB,GAAC,SAAS,CAe/C;IAED,eAEC;IAED;;;;OAIG;IACH,cAHW,YAAY,GACV,OAAO,CAQnB;IAED,mBAEC;IAIL;;;OAGG;IACH,yBAFU,OAAO,CAEoB;CAPpC;0CAjUuC,gCAAgC;iBAHvD,kCAAkC;mBAChC,kCAAkC;8BAGzB,oBAAoB"}
+{"version":3,"file":"NodeInstance.d.ts","sourceRoot":"","sources":["../../../../../../src/core/model/node-graph/node/NodeInstance.js"],"names":[],"mappings":"AAcA;;;;GAIG;AACH;IAEI;;;;OAIG;IACH,aAFU,MAAM,CAEE;IAElB;;;OAGG;IACH,6BAAmB;IAEnB;;;OAGG;IACH,WAFU,yBAAyB,EAAE,CAEtB;IAEf;;;OAGG;IACH,gBAAgB;IAEhB;;;OAGG;IACH,qBAAmB;IAEnB;;;OAGG;IACH,aAFU,gBAAgB,CAED;IAEzB;;;;;;OAMG;IACH,wBAFU,MAAM,CAEE;IAElB;;OAEG;IACH;QACI;;;WAGG;mCADO,OAAO,MAAM,WAAO;QAG9B;;;WAGG;iCADO,OAAO,MAAM,MAAI;QAG3B;;;WAGG;mCADO,OAAO,MAAM,MAAI;QAI3B;;;;WAIG;qCADO,wCAAwC;MAGpD;IAEF;;;;;;OAMG;IACH,yBALW,MAAM,aACN,aAAa,UACb,YAAY,GACV,MAAM,CAsBlB;IAED;;;OAGG;IACH,gDAEC;IAED;;;OAGG;IACH,+CAEC;IAGD;;;OAGG;IACH,mCAEC;IAED;;;;OAIG;IACH,kCAEC;IAED;;;;OAIG;IACH,mBAHW,MAAM,oBAKhB;IAED;;;;OAIG;IACH,mBAHW,MAAM,OAKhB;IAED;;;;OAIG;IACH,yBAHW,MAAM,KAOhB;IAED;;;;OAIG;IACH,2BAHW,MAAM,oBAmChB;IAED;;;;OAIG;IACH,oBAHW,MAAM,GACJ,OAAO,CAkBnB;IAED;;;OAGG;IACH,uCAQC;IAED,wBAIC;IAED;;;OAGG;IACH,mDAqCC;IAED;;;;OAIG;IACH,kBAHW,MAAM,GACJ,yBAAyB,GAAC,SAAS,CAe/C;IAED,eAEC;IAED;;;;OAIG;IACH,cAHW,YAAY,GACV,OAAO,CAQnB;IAED,mBAEC;IAIL;;;OAGG;IACH,yBAFU,OAAO,CAEoB;CAPpC;0CA3VyC,gCAAgC;iBAHzD,kCAAkC;mBAChC,kCAAkC;8BAGvB,oBAAoB"}

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

@@ -1,10 +1,10 @@
-import {assert} from "../../../assert.js";
-import {isArrayEqual} from "../../../collection/array/isArrayEqual.js";
+import { assert } from "../../../assert.js";
+import { isArrayEqual } from "../../../collection/array/isArrayEqual.js";
 import List from "../../../collection/list/List.js";
 import Signal from "../../../events/signal/Signal.js";
-import {objectDeepEquals} from "../../object/objectDeepEquals.js";
-import {NodeInstancePortReference} from "./NodeInstancePortReference.js";
-import {PortDirection} from "./PortDirection.js";
+import { objectDeepEquals } from "../../object/objectDeepEquals.js";
+import { NodeInstancePortReference } from "./NodeInstancePortReference.js";
+import { PortDirection } from "./PortDirection.js";
 
 /**
  *
@@ -12,10 +12,16 @@ import {PortDirection} from "./PortDirection.js";
  */
 let id_counter = 0;
 
+/**
+ * Represents a node instance in a graph, its main purpose is to provide connection medium for the graph.
+ * A useful analogy is that of a "class" and an "object", there can be multiple instances (objects) of the same class. In this analogy `NodeInstance` is the object, and `NodeDescription` is a class.
+ * There can be multiple `NodeInstance`s referencing the same `NodeDescription`.
+ */
 export class NodeInstance {
 
     /**
-     *
+     * Unique identifier
+     * @readonly
      * @type {number}
      */
     id = id_counter++;
@@ -78,6 +84,13 @@ export class NodeInstance {
          * @type {Signal<string, *>}
          */
         parameterRemoved: new Signal(),
+
+        /**
+         * fires: (newDescription:NodeDescription, oldDescription:NodeDescription|null)
+         * @readonly
+         * @type {Signal<NodeDescription, NodeDescription>}
+         */
+        descriptionChanged: new Signal()
     };
 
     /**
@@ -256,32 +269,45 @@ export class NodeInstance {
 
     /**
      *
-     * @param {NodeDescription} node
+     * @param {NodeDescription} description
      */
-    setDescription(node) {
-        this.description = node;
+    setDescription(description) {
+        assert.defined(description, 'description');
+        assert.isObject(description, 'description');
+        assert.equal(description.isNodeDescription, true, 'description.isNodeDescription !== true');
 
-        node.configureNode(this);
+        if (!this.connections.isEmpty()) {
+            throw new Error("Node is has connections, can only change description for unconnected nodes");
+        }
+
+        const old_description = this.description;
+
+        this.description = description;
+
+        description.configureNode(this);
 
         //generate endpoints
-        this.endpoints = node.getPorts().map((port, port_index) => {
-            const endpoint = new NodeInstancePortReference();
+        this.endpoints = description.getPorts()
+            .map((port, port_index) => {
+                const endpoint = new NodeInstancePortReference();
 
-            endpoint.id = port_index;
-            endpoint.port = port;
-            endpoint.instance = this;
+                endpoint.id = port_index;
+                endpoint.port = port;
+                endpoint.instance = this;
 
-            return endpoint;
-        });
+                return endpoint;
+            });
 
         //clear parameters
         this.clearParameters();
 
         // TODO address parameters in NodeDescription as well
         //populate parameter defaults
-        node.parameters.forEach(pd => {
+        description.parameters.forEach(pd => {
             this.parameters[pd.id] = pd.defaultValue;
         });
+
+        this.on.descriptionChanged.send2(description, old_description);
     }
 
     /**
@@ -322,7 +348,7 @@ export class NodeInstance {
     }
 
     toString() {
-        return `NodeInstance{ id = ${this.id}, description = ${this.description.id} }`
+        return `NodeInstance{ id = ${this.id}, description = ${this.description?.id} }`
     }
 }
 

package/src/engine/graphics/texture/sampler/HarmonicDiffusionGrid.spec.js

@@ -1,6 +1,6 @@
+import { randomIntegerBetween } from "../../../../core/math/random/randomIntegerBetween.js";
 import { seededRandom } from "../../../../core/math/random/seededRandom.js";
 import { HarmonicDiffusionGrid } from "./HarmonicDiffusionGrid.js";
-import { randomIntegerBetween } from "../../../../core/math/random/randomIntegerBetween.js";
 
 test("constructor doesn't throw", () => {
     new HarmonicDiffusionGrid([], 0, 0);
@@ -77,7 +77,7 @@ test("20 step 4x1, corners assigned", () => {
     expect(grid.data[3]).toBe(-7);
 });
 
-test("performance 512x512", () => {
+test.skip("performance 512x512", () => {
     const w = 139;
     const h = 139;