@woosh/meep-engine 2.120.0 → 2.120.1

package/README.md

@@ -13,7 +13,7 @@ To help get you started, various samples are provided under `/samples` folder. F
 
 ## Quality
 
-Meep is covered by 2,073 unit tests
+Meep is covered by 2,458 unit tests
 
 The aim is not to have 100% coverage, [but to ensure quality](https://about.codecov.io/blog/the-case-against-100-code-coverage/). As a result, the tests are written to cover complex code first and to exhaustively validate critical algorithms.
 Most of the test code is significantly larger than the code that is being tested.

package/package.json

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

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

@@ -0,0 +1,2 @@
+export const FLOAT32_MAX: 3.4028234663852886e+38;
+//# sourceMappingURL=FLOAT32_MAX.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"FLOAT32_MAX.d.ts","sourceRoot":"","sources":["../../../../src/core/binary/FLOAT32_MAX.js"],"names":[],"mappings":"AAAA,0BAA2B,sBAAsB,CAAC"}

package/src/core/binary/FLOAT32_MAX.js

@@ -0,0 +1 @@
+export const FLOAT32_MAX = 3.4028234663852886e+38;

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

@@ -2,12 +2,11 @@
  * Fixed-sized container structure, where ends are connected into a circle/ring
  * This is a FIFO structure (first in, first out)
  * @see https://en.wikipedia.org/wiki/Circular_buffer
+ * @template V
  */
-export class RingBuffer {
+export class RingBuffer<V> {
     /**
-     * @template V
      * @param {number} size
-     * @constructor
      */
     constructor(size: number);
     /**

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

@@ -1 +1 @@
-{"version":3,"file":"RingBuffer.d.ts","sourceRoot":"","sources":["../../../../src/core/collection/RingBuffer.js"],"names":[],"mappings":"AAGA;;;;GAIG;AACH;IACI;;;;OAIG;IACH,kBAHW,MAAM,EAqChB;IA7BG;;;OAGG;IACH,MAFU,MAAM,CAEA;IAEhB;;;OAGG;IACH,MAFU,MAAM,CAEH;IAEb;;;OAGG;IACH,MAFU,MAAM,CAEH;IAEb;;;OAGG;IACH,OAFU,MAAM,CAEF;IAEd;;;OAGG;IACH,MAFU,CAAC,EAAE,CAEc;IAG/B;;;OAGG;IACH,iBAFW,MAAM,QAkBhB;IAED;;;OAGG;IACH,WAFY,CAAC,CAIZ;IAED;;;;OAIG;IACH,oBAHW,MAAM,GACJ,CAAC,CAUb;IAED,cAIC;IAED;;;OAGG;IACH,cAFW,CAAC,QAuBX;IAED;;;OAGG;IACH,SAFa,CAAC,GAAC,SAAS,CAcvB;IAED;;;OAGG;IACH,4BAFW,MAAM,QA4BhB;IAED;;;;;OAKG;IACH,oBAJW,CAAS,IAAC,EAAD,CAAC,KAAE,OAAO,YACnB,GAAC,GACC,CAAC,GAAC,SAAS,CAoBvB;IAED;;;;OAIG;IACH,iBAHW,CAAS,IAAC,EAAD,CAAC,QAAC,YACX,GAAC,QAgBX;IAED;;;;OAIG;IACH,gBAHW,CAAC,GACC,OAAO,CAInB;CACJ"}
+{"version":3,"file":"RingBuffer.d.ts","sourceRoot":"","sources":["../../../../src/core/collection/RingBuffer.js"],"names":[],"mappings":"AAGA;;;;;GAKG;AACH,wBAFa,CAAC;IAGV;;OAEG;IACH,kBAFW,MAAM,EAoChB;IA7BG;;;OAGG;IACH,MAFU,MAAM,CAEA;IAEhB;;;OAGG;IACH,MAFU,MAAM,CAEH;IAEb;;;OAGG;IACH,MAFU,MAAM,CAEH;IAEb;;;OAGG;IACH,OAFU,MAAM,CAEF;IAEd;;;OAGG;IACH,MAFU,CAAC,EAAE,CAEc;IAG/B;;;OAGG;IACH,iBAFW,MAAM,QAsBhB;IAED;;;OAGG;IACH,WAFY,CAAC,CAIZ;IAED;;;;OAIG;IACH,oBAHW,MAAM,GACJ,CAAC,CAUb;IAED,cAIC;IAED;;;OAGG;IACH,cAFW,CAAC,QAuBX;IAED;;;OAGG;IACH,SAFa,CAAC,GAAC,SAAS,CAcvB;IAED;;;OAGG;IACH,4BAFW,MAAM,QA8BhB;IAED;;;;;OAKG;IACH,oBAJW,CAAS,IAAC,EAAD,CAAC,KAAE,OAAO,YACnB,GAAC,GACC,CAAC,GAAC,SAAS,CAoBvB;IAED;;;;OAIG;IACH,iBAHW,CAAS,IAAC,EAAD,CAAC,QAAC,YACX,GAAC,QAgBX;IAED;;;;OAIG;IACH,gBAHW,CAAC,GACC,OAAO,CAInB;CACJ"}

package/src/core/collection/RingBuffer.js

@@ -5,12 +5,11 @@ import { min2 } from "../math/min2.js";
  * Fixed-sized container structure, where ends are connected into a circle/ring
  * This is a FIFO structure (first in, first out)
  * @see https://en.wikipedia.org/wiki/Circular_buffer
+ * @template V
  */
 export class RingBuffer {
     /**
-     * @template V
      * @param {number} size
-     * @constructor
      */
     constructor(size) {
         assert.isNumber(size, 'size');
@@ -59,6 +58,10 @@ export class RingBuffer {
             return;
         }
 
+        /**
+         *
+         * @type {V[]}
+         */
         const array = new Array(new_size);
 
         this.data = array;
@@ -158,17 +161,19 @@ export class RingBuffer {
         const tail = this.tail;
         const count = this.count;
 
+        const data = this.data;
+
         for (let i = index; i < count; i++) {
             const p = tail + i;
 
             const j = (p) % size;
             const k = (p + 1) % size;
 
-            this.data[j] = this.data[k];
+            data[j] = data[k];
         }
 
         // Clear the last element (important for GC if holding objects)
-        this.data[(tail + count - 1) % size] = undefined;
+        data[(tail + count - 1) % size] = undefined;
 
         // update head and handle underflow
         this.head = (this.head - 1 + size) % size;

package/src/core/color/Color.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"Color.d.ts","sourceRoot":"","sources":["../../../../src/core/color/Color.js"],"names":[],"mappings":"AAmBA;;;GAGG;AACH;IAimBI;;;;;;OAMG;IACH,kBALW,MAAM,KACN,MAAM,KACN,MAAM,GACJ,KAAK,CAIjB;IAED;;;;;;OAMG;IACH,kBALW,MAAM,KACN,MAAM,KACN,MAAM,GACL,KAAK,CAQhB;IAGD;;;;OAIG;IACH,kBAHW,MAAM,GACL,KAAK,CAQhB;IAED;;;;;OAKG;IACH,kCAJW,KAAK,WACL,KAAK,GACH,KAAK,CAOjB;IAED;;;;;OAKG;IACH,kCAJW,KAAK,WACL,KAAK,GACH,KAAK,CAMjB;IA/pBD;;;;;;OAMG;IACH,gBALW,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,EAuChB;IA/BG;;;;OAIG;IACH,GAFU,MAAM,CAEN;IACV;;;;OAIG;IACH,GAFU,MAAM,CAEN;IACV;;;;OAIG;IACH,GAFU,MAAM,CAEN;IAEV;;;;OAIG;IACH,GAFU,MAAM,CAEN;IAEV;;;OAGG;IACH,oBAFU,MAAM,CAAC,MAAM,EAAC,MAAM,EAAC,MAAM,EAAC,MAAM,EAAC,MAAM,EAAC,MAAM,EAAC,MAAM,EAAC,MAAM,CAAC,CAE5C;IAWjC;;;OAGG;IACH,SAFW,MAAM,EAIhB;IAdD;;;OAGG;IACH,SAFa,MAAM,CAIlB;IAkBD;;;OAGG;IACH,SAFW,MAAM,EAIhB;IAdD;;;OAGG;IACH,SAFa,MAAM,CAIlB;IAkBD;;;OAGG;IACH,SAFW,MAAM,EAIhB;IAdD;;;OAGG;IACH,SAFa,MAAM,CAIlB;IAkBD;;;OAGG;IACH,SAFW,MAAM,EAIhB;IAdD;;;OAGG;IACH,SAFa,MAAM,CAIlB;IAYD;;;OAGG;IACH,SAFa,MAAM,CAIlB;IAED;;;OAGG;IACH,SAFa,MAAM,CAIlB;IAED;;;OAGG;IACH,SAFa,MAAM,CAIlB;IAED;;;OAGG;IACH,SAFa,MAAM,CAIlB;IAED;;;OAGG;IACH,cAFY,MAAM,CAIjB;IAED;;;;;OAKG;IACH,UAJW,MAAM,KACN,MAAM,KACN,MAAM,QAKhB;IAED;;;;;OAKG;IACH,eAJW,MAAM,KACN,MAAM,KACN,MAAM,QAQhB;IAED;;;OAGG;IACH,QAFW,MAAM,QAIhB;IAED;;;;;;OAMG;IACH,OALW,MAAM,KACN,MAAM,KACN,MAAM,MACN,MAAM,QAyChB;IAED;;;;;OAKG;IACH,UAJW,MAAM,KACN,MAAM,KACN,MAAM,QAsBhB;IAED;;;;;OAKG;IACH,UAJW,MAAM,KACN,MAAM,KACN,MAAM,QAqDhB;IAED;;;;;;;OAOG;IACH,UALW,MAAM,KACN,MAAM,KACN,MAAM,QAyDhB;IAED;;;;;OAKG;IACH,UAJW,MAAM,KACN,MAAM,KACN,MAAM,QAMhB;IAED;;;OAGG;IACH,oBAFY,MAAM,CAIjB;IAED;;;;MAMC;IAED;;;OAGG;IACH,UAFa,MAAM,CAIlB;IAED;;;OAGG;IACH,YAFa,MAAM,CAIlB;IAED;;;OAGG;IACH,gBAFW,MAAM,QAUhB;IAED;;;;OAIG;IACH,SAFa,MAAM,CAQlB;IAED;;;OAGG;IACH,mBAFa,MAAM,CAIlB;IAED;;;OAGG;IACH,cAFW,KAAK,WAOf;IAED;;;OAGG;IACH,YAFW,KAAK,QAIf;IAED;;;OAGG;IACH,SAFa,KAAK,CAQjB;IAED;;;OAGG;IACH,QAFa,MAAM,CAIlB;IAED;;;;;aAEC;IAED;;;;;MAOC;IAWD;;;;;OAKG;IACH,sBAJW,MAAM,EAAE,uBACR,MAAM,GACJ,MAAM,EAAE,CASpB;IAED;;;;OAIG;IACH,kBAHW,MAAM,EAAE,GAAC,YAAY,WACrB,MAAM,QAShB;IAGD;;;OAGG;IACH,uBAFW,YAAY,QAOtB;IAED;;;OAGG;IACH,yBAFW,YAAY,QAStB;IAED;;;;OAIG;IACH,WAHW,MAAM,GACJ,IAAI,CAYhB;IAED;;;;;OAKG;IACH,cAJW,KAAK,KACL,KAAK,KACL,MAAM,QAOhB;IAoEL;;;OAGG;IACH,sCAxJe,MAAM,EAAE,uBACR,MAAM,KACJ,MAAM,EAAE,CAsJG;IAnKxB,sDAOC;CAsJJ;;aAUS,QAAQ,CAAC,KAAK,CAAC;eAMf,QAAQ,CAAC,KAAK,CAAC;cAMf,QAAQ,CAAC,KAAK,CAAC;gBAMf,QAAQ,CAAC,KAAK,CAAC;cAMf,QAAQ,CAAC,KAAK,CAAC;iBAMf,QAAQ,CAAC,KAAK,CAAC;eAMf,QAAQ,CAAC,KAAK,CAAC;eAMf,QAAQ,CAAC,KAAK,CAAC;qBAMf,QAAQ,CAAC,KAAK,CAAC;;mBA/uBN,4BAA4B"}
+{"version":3,"file":"Color.d.ts","sourceRoot":"","sources":["../../../../src/core/color/Color.js"],"names":[],"mappings":"AAmBA;;;GAGG;AACH;IA0iBI;;;;;OAKG;IACH,yBAJW,MAAM,EAAE,GAAC,YAAY,WACrB,MAAM,GACJ,KAAK,CAQjB;IAyDD;;;;;;OAMG;IACH,kBALW,MAAM,KACN,MAAM,KACN,MAAM,GACJ,KAAK,CAIjB;IAED;;;;;;OAMG;IACH,kBALW,MAAM,KACN,MAAM,KACN,MAAM,GACL,KAAK,CAQhB;IAGD;;;;OAIG;IACH,kBAHW,MAAM,GACL,KAAK,CAQhB;IAED;;;;;OAKG;IACH,kCAJW,KAAK,WACL,KAAK,GACH,KAAK,CAOjB;IAED;;;;;OAKG;IACH,kCAJW,KAAK,WACL,KAAK,GACH,KAAK,CAMjB;IA7qBD;;;;;;OAMG;IACH,gBALW,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,EAuChB;IA/BG;;;;OAIG;IACH,GAFU,MAAM,CAEN;IACV;;;;OAIG;IACH,GAFU,MAAM,CAEN;IACV;;;;OAIG;IACH,GAFU,MAAM,CAEN;IAEV;;;;OAIG;IACH,GAFU,MAAM,CAEN;IAEV;;;OAGG;IACH,oBAFU,MAAM,CAAC,MAAM,EAAC,MAAM,EAAC,MAAM,EAAC,MAAM,EAAE,MAAM,EAAC,MAAM,EAAC,MAAM,EAAC,MAAM,CAAC,CAE7C;IAWjC;;;OAGG;IACH,SAFW,MAAM,EAIhB;IAdD;;;OAGG;IACH,SAFa,MAAM,CAIlB;IAkBD;;;OAGG;IACH,SAFW,MAAM,EAIhB;IAdD;;;OAGG;IACH,SAFa,MAAM,CAIlB;IAkBD;;;OAGG;IACH,SAFW,MAAM,EAIhB;IAdD;;;OAGG;IACH,SAFa,MAAM,CAIlB;IAkBD;;;OAGG;IACH,SAFW,MAAM,EAIhB;IAdD;;;OAGG;IACH,SAFa,MAAM,CAIlB;IAYD;;;OAGG;IACH,SAFa,MAAM,CAIlB;IAED;;;OAGG;IACH,SAFa,MAAM,CAIlB;IAED;;;OAGG;IACH,SAFa,MAAM,CAIlB;IAED;;;OAGG;IACH,SAFa,MAAM,CAIlB;IAED;;;OAGG;IACH,cAFY,MAAM,CAIjB;IAED;;;;;OAKG;IACH,UAJW,MAAM,KACN,MAAM,KACN,MAAM,QAKhB;IAED;;;;;OAKG;IACH,eAJW,MAAM,KACN,MAAM,KACN,MAAM,QAQhB;IAED;;;OAGG;IACH,QAFW,MAAM,QAIhB;IAED;;;;;;OAMG;IACH,OALW,MAAM,KACN,MAAM,KACN,MAAM,MACN,MAAM,QAyChB;IAED;;;;;OAKG;IACH,UAJW,MAAM,KACN,MAAM,KACN,MAAM,QAsBhB;IAED;;;;;OAKG;IACH,UAJW,MAAM,KACN,MAAM,KACN,MAAM,QAqDhB;IAED;;;;;;;OAOG;IACH,UALW,MAAM,KACN,MAAM,KACN,MAAM,QAyDhB;IAED;;;;;OAKG;IACH,UAJW,MAAM,KACN,MAAM,KACN,MAAM,QAMhB;IAED;;;OAGG;IACH,oBAFY,MAAM,CAIjB;IAED;;;;MAMC;IAED;;;OAGG;IACH,UAFa,MAAM,CAIlB;IAED;;;OAGG;IACH,YAFa,MAAM,CAIlB;IAED;;;OAGG;IACH,gBAFW,MAAM,QAUhB;IAED;;;;OAIG;IACH,SAFa,MAAM,CAQlB;IAED;;;OAGG;IACH,mBAFa,MAAM,CAIlB;IAED;;;OAGG;IACH,cAFW,KAAK,WAOf;IAED;;;OAGG;IACH,YAFW,KAAK,QAIf;IAED;;;OAGG;IACH,SAFa,KAAK,CAQjB;IAED;;;OAGG;IACH,QAFa,MAAM,CAIlB;IAED;;;;;aAEC;IAED;;;;;MAOC;IAWD;;;;;OAKG;IACH,sBAJW,MAAM,EAAE,uBACR,MAAM,GACJ,MAAM,EAAE,CASpB;IAED;;;;OAIG;IACH,kBAHW,MAAM,EAAE,GAAC,YAAY,WACrB,MAAM,QAShB;IAiBD;;;OAGG;IACH,uBAFW,YAAY,QAOtB;IAED;;;OAGG;IACH,yBAFW,YAAY,QAStB;IAED;;;;OAIG;IACH,WAHW,MAAM,GACJ,IAAI,CAYhB;IAED;;;;;OAKG;IACH,cAJW,KAAK,KACL,KAAK,KACL,MAAM,QAOhB;IAoEL;;;OAGG;IACH,sCAtKe,MAAM,EAAE,uBACR,MAAM,KACJ,MAAM,EAAE,CAoKG;IAjLxB,sDAOC;CAoKJ;;aAUS,QAAQ,CAAC,KAAK,CAAC;eAMf,QAAQ,CAAC,KAAK,CAAC;cAMf,QAAQ,CAAC,KAAK,CAAC;gBAMf,QAAQ,CAAC,KAAK,CAAC;cAMf,QAAQ,CAAC,KAAK,CAAC;iBAMf,QAAQ,CAAC,KAAK,CAAC;eAMf,QAAQ,CAAC,KAAK,CAAC;eAMf,QAAQ,CAAC,KAAK,CAAC;qBAMf,QAAQ,CAAC,KAAK,CAAC;;mBA7vBN,4BAA4B"}

package/src/core/color/Color.js

@@ -63,7 +63,7 @@ export class Color {
 
         /**
          * @readonly
-         * @type {Signal<number,number,number,number,number,number,number,number>}
+         * @type {Signal<number,number,number,number, number,number,number,number>}
          */
         this.onChanged = new Signal();
     }
@@ -575,6 +575,20 @@ export class Color {
         this.set(r, g, b, a);
     }
 
+    /**
+     *
+     * @param {number[]|Float32Array} source
+     * @param {number} [offset]
+     * @returns {Color}
+     */
+    static fromArray(source, offset){
+        const r = new Color();
+
+        r.fromArray(source,offset);
+
+        return r;
+    }
+
 
     /**
      *

package/src/core/geom/Vector4.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"Vector4.d.ts","sourceRoot":"","sources":["../../../../src/core/geom/Vector4.js"],"names":[],"mappings":";AAMA;IA2WI;;;;;;OAMG;IACH,gBALW,OAAO,MACP,OAAO,qBAEP,OAAO,QASjB;IAxXD;;;;;;;;OAQG;IACH,4DAOC;IANG,UAAU;IACV,UAAU;IACV,UAAU;IACV,UAAU;IAEV,eAA6B;IAGjC,gBAEC;IAED,gBAEC;IAED,gBAEC;IAED,gBAEC;IAED;;;;OAIG;IACH,qBAHW,MAAM,EAAE,WACR,MAAM,QAShB;IAED;;;;OAIG;IACH,oBAHW,MAAM,EAAE,WACR,MAAM,QAOhB;IAED;;;;;;;OAOG;IACH,iDAFa,OAAO,CAkCnB;IAED;;;OAGG;IACH,oBAFW,OAAO,QAQjB;IAED;;;;OAIG;IACH,+BAFa,OAAO,CAOnB;IAED;;;;;;;;;;;;;;;;;;;OAmBG;IACH,kBAlBW,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,GACJ,OAAO,CAoBnB;IAED;;;;OAIG;IACH,WAHW,OAAO,GACL,MAAM,CAIlB;IAED;;;;OAIG;IACH,SAHW,OAAO,GAAC,OAAO,GACb,OAAO,CASnB;IAED;;;;OAIG;IACH,qBAHW,OAAO,GACL,OAAO,CAUnB;IAED;;;;OAIG;IACH,WAHW,OAAO,GACL,OAAO,CAInB;IAED;;;OAGG;IACH,SAFa,OAAO,CAQnB;IAED;;;OAGG;IACH,mBAFW,UAAU,QAyBpB;IAED;;;;OAIG;IACH,aAHW,OAAO,GACL,OAAO,CAInB;IAED;;;OAGG;IACH,QAFY,MAAM,CASjB;IAED;;;;OAIG;IACH,gBAJW,OAAO,MACP,OAAO,mBAKjB;IAED;;;OAGG;IACH,gBAFW,MAAM,EAAE,QAOlB;IAED;;OAEG;IACH,WAFa,MAAM,EAAE,CAQpB;IAED;;;;OAIG;IACH,mBAHW,MAAM,EAAE,UACR,MAAM,QAIhB;IAED;;;;;MAOC;IAED,0BAEC;IAED;;;OAGG;IACH,uBAFW,YAAY,QAOtB;IAED;;;OAGG;IACH,yBAFW,YAAY,QAStB;IAED,sDAOC;CAiBJ"}
+{"version":3,"file":"Vector4.d.ts","sourceRoot":"","sources":["../../../../src/core/geom/Vector4.js"],"names":[],"mappings":";AAMA;IA2YI;;;;;;OAMG;IACH,gBALW,OAAO,MACP,OAAO,qBAEP,OAAO,QASjB;IAxZD;;;;;;;;OAQG;IACH,4DAOC;IANG,UAAU;IACV,UAAU;IACV,UAAU;IACV,UAAU;IAEV,eAA6B;IAOjC;;;OAGG;IACH,SAFW,MAAM,EAIhB;IAVD,SAMW,MAAM,CAJhB;IAcD;;;OAGG;IACH,SAFW,MAAM,EAIhB;IAVD,SAMW,MAAM,CAJhB;IAcD;;;OAGG;IACH,SAFW,MAAM,EAIhB;IAVD,SAMW,MAAM,CAJhB;IAcD;;;OAGG;IACH,SAFW,MAAM,EAIhB;IAVD,SAMW,MAAM,CAJhB;IAUD;;;;OAIG;IACH,qBAHW,MAAM,EAAE,WACR,MAAM,QAShB;IAED;;;;OAIG;IACH,oBAHW,MAAM,EAAE,WACR,MAAM,QAOhB;IAED;;;;;;;OAOG;IACH,iDAFa,OAAO,CAkCnB;IAED;;;OAGG;IACH,oBAFW,OAAO,QAQjB;IAED;;;;OAIG;IACH,+BAFa,OAAO,CAOnB;IAED;;;;;;;;;;;;;;;;;;;OAmBG;IACH,kBAlBW,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,GACJ,OAAO,CAoBnB;IAED;;;;OAIG;IACH,WAHW,OAAO,GACL,MAAM,CAIlB;IAED;;;;OAIG;IACH,SAHW,OAAO,GAAC,OAAO,GACb,OAAO,CASnB;IAED;;;;OAIG;IACH,qBAHW,OAAO,GACL,OAAO,CAUnB;IAED;;;;OAIG;IACH,WAHW,OAAO,GACL,OAAO,CAInB;IAED;;;OAGG;IACH,SAFa,OAAO,CAQnB;IAED;;;OAGG;IACH,mBAFW,UAAU,QAyBpB;IAED;;;;OAIG;IACH,aAHW,OAAO,GACL,OAAO,CAInB;IAED;;;OAGG;IACH,QAFY,MAAM,CASjB;IAED;;;;OAIG;IACH,gBAJW,OAAO,MACP,OAAO,mBAKjB;IAED;;;OAGG;IACH,gBAFW,MAAM,EAAE,QAOlB;IAED;;OAEG;IACH,WAFa,MAAM,EAAE,CAQpB;IAED;;;;OAIG;IACH,mBAHW,MAAM,EAAE,UACR,MAAM,QAIhB;IAED;;;;;MAOC;IAED,0BAEC;IAED;;;OAGG;IACH,uBAFW,YAAY,QAOtB;IAED;;;OAGG;IACH,yBAFW,YAAY,QAStB;IAED,sDAOC;CAiBJ"}

package/src/core/geom/Vector4.js

@@ -27,18 +27,50 @@ class Vector4 {
         return this.x;
     }
 
+    /**
+     *
+     * @param {number} v
+     */
+    set 0(v) {
+        this.x = v;
+    }
+
     get 1() {
         return this.y;
     }
 
+    /**
+     *
+     * @param {number} v
+     */
+    set 1(v) {
+        this.y = v;
+    }
+
     get 2() {
         return this.z;
     }
 
+    /**
+     *
+     * @param {number} v
+     */
+    set 2(v) {
+        this.z = v;
+    }
+
     get 3() {
         return this.w;
     }
 
+    /**
+     *
+     * @param {number} v
+     */
+    set 3(v) {
+        this.w = v;
+    }
+
     /**
      *
      * @param {number[]} array

package/src/core/geom/mat2/M2_IDENTITY.d.ts

@@ -0,0 +1,6 @@
+/**
+ * 2x2 Identity matrix
+ * @type {Readonly<number[]>}
+ */
+export const M2_IDENTITY: Readonly<number[]>;
+//# sourceMappingURL=M2_IDENTITY.d.ts.map

package/src/core/geom/mat2/M2_IDENTITY.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"M2_IDENTITY.d.ts","sourceRoot":"","sources":["../../../../../src/core/geom/mat2/M2_IDENTITY.js"],"names":[],"mappings":"AAAA;;;GAGG;AACH,0BAFU,QAAQ,CAAC,MAAM,EAAE,CAAC,CAKzB"}

package/src/core/geom/mat2/M2_IDENTITY.js

@@ -0,0 +1,8 @@
+/**
+ * 2x2 Identity matrix
+ * @type {Readonly<number[]>}
+ */
+export const M2_IDENTITY = Object.freeze([
+    1, 0,
+    0, 1
+]);

package/src/core/geom/mat2/m2_is_diagonal.d.ts

@@ -0,0 +1,8 @@
+/**
+ *
+ * @param {number[]} m
+ * @param {number} [tolerance]
+ * @returns {boolean}
+ */
+export function m2_is_diagonal(m: number[], tolerance?: number): boolean;
+//# sourceMappingURL=m2_is_diagonal.d.ts.map

package/src/core/geom/mat2/m2_is_diagonal.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"m2_is_diagonal.d.ts","sourceRoot":"","sources":["../../../../../src/core/geom/mat2/m2_is_diagonal.js"],"names":[],"mappings":"AAAA;;;;;GAKG;AACH,kCAJW,MAAM,EAAE,cACR,MAAM,GACJ,OAAO,CAInB"}

package/src/core/geom/mat2/m2_is_diagonal.js

@@ -0,0 +1,9 @@
+/**
+ *
+ * @param {number[]} m
+ * @param {number} [tolerance]
+ * @returns {boolean}
+ */
+export function m2_is_diagonal(m, tolerance = 1e-6) {
+    return Math.abs(m[1]) < tolerance && Math.abs(m[2]) < tolerance;
+}

package/src/core/geom/mat2/m2_is_orthogonal.d.ts

@@ -0,0 +1,8 @@
+/**
+ * Check if m * m^T is close to the identity matrix.
+ * @param {number[]} m
+ * @param {number} [tolerance]
+ * @returns {boolean}
+ */
+export function m2_is_orthogonal(m: number[], tolerance?: number): boolean;
+//# sourceMappingURL=m2_is_orthogonal.d.ts.map

package/src/core/geom/mat2/m2_is_orthogonal.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"m2_is_orthogonal.d.ts","sourceRoot":"","sources":["../../../../../src/core/geom/mat2/m2_is_orthogonal.js"],"names":[],"mappings":"AAGA;;;;;GAKG;AACH,oCAJW,MAAM,EAAE,cACR,MAAM,GACJ,OAAO,CAenB"}

package/src/core/geom/mat2/m2_is_orthogonal.js

@@ -0,0 +1,23 @@
+import { m2_multiply } from "./m2_multiply.js";
+import { m2_transpose } from "./m2_transpose.js";
+
+/**
+ * Check if m * m^T is close to the identity matrix.
+ * @param {number[]} m
+ * @param {number} [tolerance]
+ * @returns {boolean}
+ */
+export function m2_is_orthogonal(m, tolerance = 1e-6) {
+
+    const mt = m2_transpose([], m);
+    const m_mt = [];
+
+    m2_multiply(m_mt, m, mt);
+
+    return (
+        Math.abs(m_mt[0] - 1) < tolerance &&
+        Math.abs(m_mt[1]) < tolerance &&
+        Math.abs(m_mt[2]) < tolerance &&
+        Math.abs(m_mt[3] - 1) < tolerance
+    );
+}

package/src/core/geom/mat2/m2_transpose.d.ts

@@ -0,0 +1,9 @@
+/**
+ * Transposes a 2x2 matrix, stored in a flattened array.
+ *
+ * @param {number[]} out Output: The transposed matrix. Can be the same array as `m`.
+ * @param {number[]} m Input: The 2x2 matrix to transpose, stored as a flattened array [a, b, c, d], representing [[a, c], [b, d]].
+ * @returns {number[]} The `out` parameter.
+ */
+export function m2_transpose(out: number[], m: number[]): number[];
+//# sourceMappingURL=m2_transpose.d.ts.map

package/src/core/geom/mat2/m2_transpose.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"m2_transpose.d.ts","sourceRoot":"","sources":["../../../../../src/core/geom/mat2/m2_transpose.js"],"names":[],"mappings":"AAAA;;;;;;GAMG;AACH,kCAJW,MAAM,EAAE,KACR,MAAM,EAAE,GACN,MAAM,EAAE,CAWpB"}

package/src/core/geom/mat2/m2_transpose.js

@@ -0,0 +1,17 @@
+/**
+ * Transposes a 2x2 matrix, stored in a flattened array.
+ *
+ * @param {number[]} out Output: The transposed matrix. Can be the same array as `m`.
+ * @param {number[]} m Input: The 2x2 matrix to transpose, stored as a flattened array [a, b, c, d], representing [[a, c], [b, d]].
+ * @returns {number[]} The `out` parameter.
+ */
+export function m2_transpose(out, m) {
+    const b = m[1]; // Cache m[1] (which becomes m[2] after the swap)
+
+    out[0] = m[0];
+    out[1] = m[2];
+    out[2] = b; // Use the cached value
+    out[3] = m[3];
+
+    return out;
+}

package/src/core/graph/graph_compute_adjacency_matrix.d.ts

@@ -1,9 +1,11 @@
 /**
- * NOTE: does not clear matrix before writing adjacency
- * @template T
- * @param {Graph<T>} graph
- * @param {SquareMatrix} result
- * @param {Map<T,number>} node_indices
+ * Computes the adjacency matrix of a graph.
+ * Writes 1 to matrix elements where nodes are connected, leaves existing values where there are no connections.
+ * Does NOT zero-fill the matrix before writing.
+ * @template T Type of the graph's nodes.
+ * @param {Graph<T>} graph Input graph.
+ * @param {SquareMatrix} result Output: Adjacency matrix (modified in-place).
+ * @param {Map<T,number>} node_indices Map from graph nodes to matrix indices.
  */
 export function graph_compute_adjacency_matrix<T>(graph: Graph<T>, result: SquareMatrix, node_indices: Map<T, number>): void;
 //# sourceMappingURL=graph_compute_adjacency_matrix.d.ts.map

package/src/core/graph/graph_compute_adjacency_matrix.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"graph_compute_adjacency_matrix.d.ts","sourceRoot":"","sources":["../../../../src/core/graph/graph_compute_adjacency_matrix.js"],"names":[],"mappings":"AAEA;;;;;;GAMG;AACH,+CALa,CAAC,SACH,KAAK,CAAC,CAAC,CAAC,UACR,YAAY,gBACZ,GAAG,CAAC,CAAC,EAAC,MAAM,CAAC,QAYvB"}
+{"version":3,"file":"graph_compute_adjacency_matrix.d.ts","sourceRoot":"","sources":["../../../../src/core/graph/graph_compute_adjacency_matrix.js"],"names":[],"mappings":"AAGA;;;;;;;;GAQG;AACH,+CALa,CAAC,SACH,KAAK,CAAC,CAAC,CAAC,UACR,YAAY,gBACZ,GAAG,CAAC,CAAC,EAAC,MAAM,CAAC,QAevB"}

package/src/core/graph/graph_compute_adjacency_matrix.js

@@ -1,11 +1,14 @@
+import { assert } from "../assert.js";
 
 
 /**
- * NOTE: does not clear matrix before writing adjacency
- * @template T
- * @param {Graph<T>} graph
- * @param {SquareMatrix} result
- * @param {Map<T,number>} node_indices
+ * Computes the adjacency matrix of a graph.
+ * Writes 1 to matrix elements where nodes are connected, leaves existing values where there are no connections.
+ * Does NOT zero-fill the matrix before writing.
+ * @template T Type of the graph's nodes.
+ * @param {Graph<T>} graph Input graph.
+ * @param {SquareMatrix} result Output: Adjacency matrix (modified in-place).
+ * @param {Map<T,number>} node_indices Map from graph nodes to matrix indices.
  */
 export function graph_compute_adjacency_matrix(graph, result, node_indices) {
     const edges = graph.getEdges();
@@ -14,6 +17,9 @@ export function graph_compute_adjacency_matrix(graph, result, node_indices) {
         const a = node_indices.get(edge.first);
         const b = node_indices.get(edge.second);
 
+        assert.isNonNegativeInteger(a, 'a');
+        assert.isNonNegativeInteger(b, 'b');
+
         result.setCellValue(a, b, 1);
         result.setCellValue(b, a, 1);
     }

package/src/core/graph/graph_compute_distance_matrix.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"graph_compute_distance_matrix.d.ts","sourceRoot":"","sources":["../../../../src/core/graph/graph_compute_distance_matrix.js"],"names":[],"mappings":"AAKA;;;;;;;;;GASG;AACH,8CAPa,CAAC,SACH,KAAK,CAAC,CAAC,CAAC,cACR,CAAC,EAAE,WACH,MAAM,EAAE,kBACR,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,GACZ,YAAY,CAyFxB;6BAnG4B,gCAAgC"}
+{"version":3,"file":"graph_compute_distance_matrix.d.ts","sourceRoot":"","sources":["../../../../src/core/graph/graph_compute_distance_matrix.js"],"names":[],"mappings":"AAIA;;;;;;;;;GASG;AACH,8CAPa,CAAC,SACH,KAAK,CAAC,CAAC,CAAC,cACR,CAAC,EAAE,WACH,MAAM,EAAE,kBACR,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,GACZ,YAAY,CAgExB;6BA1E4B,gCAAgC"}

package/src/core/graph/graph_compute_distance_matrix.js

@@ -1,6 +1,5 @@
-import { BitSet } from "../binary/BitSet.js";
 import { BinaryDataType } from "../binary/type/BinaryDataType.js";
-import BinaryHeap from "../collection/heap/BinaryHeap.js";
+import { Deque } from "../collection/queue/Deque.js";
 import { SquareMatrix } from "../math/matrix/SquareMatrix.js";
 
 /**
@@ -18,86 +17,61 @@ export function graph_compute_distance_matrix(graph, node_array, targets, node_i
 
     const m_distances = new SquareMatrix(node_count, BinaryDataType.Float32);
 
-    const flags = BitSet.fixedSize(node_count);
-
     // initialize distances
     m_distances.fill(Number.POSITIVE_INFINITY);
 
-    let source_node;
+    // fill diagonal
+    for (let i = 0; i < node_count; i++) {
+        // Distance to self is 0
+        m_distances.setCellValue(i, i, 0);
+    }
 
     /**
      *
-     * @param {number} other_node
-     * @returns {number}
+     * @type {Deque<number>}
      */
-    function score(other_node) {
-        return m_distances.getCellValue(source_node, other_node);
-    }
-
-    for (let i = 0; i < targets.length; i++) {
-        source_node = targets[i];
-
-        // distance to self is always 0
-        m_distances.setCellValue(source_node, source_node, 0);
+    const queue = new Deque();
 
-        const heap = new BinaryHeap(score);
-        heap.push(source_node);
+    for (const target_index of targets) {
 
-        while (!heap.isEmpty()) {
-            const t = heap.pop();
+        queue.addLast(target_index);
 
-            const distance_to_this_node = m_distances.getCellValue(source_node, t);
-            if (flags.get(t)) {
-                // already visited
-                for (let v = 0; v < node_count; v++) {
-                    const shortcut_distance = distance_to_this_node + m_distances.getCellValue(t, v);
+        while (!queue.isEmpty()) {
+            const index_1 = queue.removeFirst();
+            const node_1 = node_array[index_1];
 
-                    if (shortcut_distance < m_distances.getCellValue(source_node, v)) {
-                        m_distances.setCellValue(source_node, v, shortcut_distance)
-                    }
+            const node_1_container = graph.getNodeContainer(node_1);
 
-                }
-            } else {
-                // not visited yet
-                const t_node = node_array[t];
-
-                const t_node_container = graph.getNodeContainer(t_node);
+            const edges = node_1_container.getEdges();
+            const edge_count = edges.length;
 
-                const node_edges = t_node_container.getEdges();
-                const node_edge_count = node_edges.length;
+            for (let i = 0; i < edge_count; i++) {
 
-                for (let i1 = 0; i1 < node_edge_count; i1++) {
+                const edge = edges[i];
 
-                    /**
-                     *
-                     * @type {WeightedEdge<N>}
-                     */
-                    const node_edge = node_edges[i1];
+                const node_0 = edge.other(node_1);
 
-                    const neighbour_node = node_edge.other(t_node);
+                if (!edge.validateTransition(node_0, node_1)) {
+                    continue;
+                }
 
-                    const neighbour_node_index = node_index_map.get(neighbour_node);
+                const index_0 = node_index_map.get(node_0);
 
-                    if (neighbour_node_index === -1) {
-                        // not in the input set
-                        continue;
-                    }
+                // If we haven't visited this neighbor yet, its distance is the current distance + 1
+                if (m_distances.getCellValue(index_0, target_index) === Number.POSITIVE_INFINITY) {
 
-                    const transition_cost = node_edge.weight + 1e-5;
+                    const transition_cost = edge.weight;
 
-                    const distance_to_neighbour = distance_to_this_node + transition_cost;
+                    const new_distance = m_distances.getCellValue(index_1, target_index) + transition_cost;
 
-                    if (distance_to_neighbour < m_distances.getCellValue(source_node, neighbour_node_index)) {
-                        m_distances.setCellValue(source_node, neighbour_node_index, distance_to_neighbour);
+                    m_distances.setCellValue(index_0, target_index, new_distance);
 
-                        heap.push(neighbour_node_index);
-                    }
+                    queue.addLast(index_0);
                 }
             }
         }
-
-        flags.set(source_node, true);
     }
 
+
     return m_distances;
 }

package/src/core/graph/graph_compute_laplacian_matrix.d.ts

@@ -1,10 +1,10 @@
 /**
- * Laplacian matrix (graph Laplacian)
- * NOTE: does not clear matrix before writing
- * @template T
- * @param {Graph<T>} graph
- * @param {SquareMatrix} result
- * @param {Map<T,number>} node_indices
+ * Computes the Laplacian matrix of a graph.
+ * Does NOT clear the matrix before writing.
+ * @template T Type of graph nodes.
+ * @param {Graph<T>} graph Input graph.
+ * @param {SquareMatrix} result Output: Laplacian matrix (modified in-place).
+ * @param {Map<T,number>} node_indices Map from graph nodes to matrix indices.
  */
 export function graph_compute_laplacian_matrix<T>(graph: Graph<T>, result: SquareMatrix, node_indices: Map<T, number>): void;
 import { SquareMatrix } from "../math/matrix/SquareMatrix.js";

package/src/core/graph/graph_compute_laplacian_matrix.js

@@ -4,12 +4,12 @@ import { graph_compute_adjacency_matrix } from "./graph_compute_adjacency_matrix
 import { graph_compute_degree_matrix } from "./graph_compute_degree_matrix.js";
 
 /**
- * Laplacian matrix (graph Laplacian)
- * NOTE: does not clear matrix before writing
- * @template T
- * @param {Graph<T>} graph
- * @param {SquareMatrix} result
- * @param {Map<T,number>} node_indices
+ * Computes the Laplacian matrix of a graph.
+ * Does NOT clear the matrix before writing.
+ * @template T Type of graph nodes.
+ * @param {Graph<T>} graph Input graph.
+ * @param {SquareMatrix} result Output: Laplacian matrix (modified in-place).
+ * @param {Map<T,number>} node_indices Map from graph nodes to matrix indices.
  */
 export function graph_compute_laplacian_matrix(graph, result, node_indices) {
     const degree = new SquareMatrix(result.size, BinaryDataType.Uint8);

package/src/core/json/abstractJSONDeserializer.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"abstractJSONDeserializer.d.ts","sourceRoot":"","sources":["../../../../src/core/json/abstractJSONDeserializer.js"],"names":[],"mappings":"AAAA;;;;GAIG;AACH,yCAJa,CAAC,QACH,CAAC,iBACD,GAAG,CAAC,MAAM,WAAW,OAqB/B"}
+{"version":3,"file":"abstractJSONDeserializer.d.ts","sourceRoot":"","sources":["../../../../src/core/json/abstractJSONDeserializer.js"],"names":[],"mappings":"AAAA;;;;GAIG;AACH,yCAJa,CAAC,QACH,CAAC,iBACD,GAAG,CAAC,MAAM,WAAW,OA2B/B"}

package/src/core/json/abstractJSONDeserializer.js

@@ -21,5 +21,11 @@ export function abstractJSONDeserializer(json, deserializers) {
         throw new Error(`No deserializer found for type '${typeName}'`);
     }
 
-    return deserializer(json.data);
+    const payload = json.data;
+
+    if (payload === undefined) {
+        console.warn(`No serialized payload for type '${typeName}'`);
+    }
+
+    return deserializer(payload);
 }

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

@@ -1 +1 @@
-{"version":3,"file":"bell_membership_function.d.ts","sourceRoot":"","sources":["../../../../src/core/math/bell_membership_function.js"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AACH,4CANW,MAAM,KACN,MAAM,KACN,MAAM,KACN,MAAM,GACJ,MAAM,CASlB"}
+{"version":3,"file":"bell_membership_function.d.ts","sourceRoot":"","sources":["../../../../src/core/math/bell_membership_function.js"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AACH,4CANW,MAAM,KACN,MAAM,KACN,MAAM,KACN,MAAM,GACJ,MAAM,CAclB"}

package/src/core/math/bell_membership_function.js

@@ -10,8 +10,13 @@
  * @returns {number}
  */
 export function bell_membership_function(v, a, b, c) {
+    if(a === 0){
+        // avoid division by 0
+        return 0;
+    }
 
-    const N = (v - c) / a;
+    const vc = v - c;
+    const N = vc / a;
 
     const d = 1 + Math.pow(N, b * 2);
 

package/src/core/math/linalg/m2/m2_polar_decomp.d.ts

@@ -0,0 +1,19 @@
+/**
+ * Performs a polar decomposition of a 2x2 matrix.
+ * This function decomposes a 2x2 matrix `m` into two matrices, `R` and `S`,
+ * such that m = S * R, where:
+ *  - R is a 2x2 orthogonal matrix (representing a rotation).
+ *  - S is a 2x2 symmetric positive semi-definite matrix.
+ * The input matrix `m` and output matrices `R` and `S` are stored in a flattened,
+ * transposed format (consistent with the Taichi programming language convention).
+ *
+ * @param {number[]} R Output: 2x2 orthogonal matrix (rotation), stored as a flattened
+ *  array [c, s, -s, c], where 'c' is the cosine and 's' is the sine of the rotation
+ *  angle. Modified in-place.
+ * @param {number[]} S Output: 2x2 symmetric positive semi-definite matrix,
+ *  stored as a flattened array. Modified in-place.
+ * @param {number[]} m Input: 2x2 matrix, stored as a flattened, *transposed* array [a, b, c, d],
+ * representing the matrix [[a, c], [b, d]]. Will be read from, but NOT modified.
+ */
+export function m2_polar_decomp(R: number[], S: number[], m: number[]): void;
+//# sourceMappingURL=m2_polar_decomp.d.ts.map

package/src/core/math/linalg/m2/m2_polar_decomp.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"m2_polar_decomp.d.ts","sourceRoot":"","sources":["../../../../../../src/core/math/linalg/m2/m2_polar_decomp.js"],"names":[],"mappings":"AAGA;;;;;;;;;;;;;;;;GAgBG;AACH,mCARW,MAAM,EAAE,KAGR,MAAM,EAAE,KAER,MAAM,EAAE,QASlB"}

package/src/core/math/linalg/m2/m2_polar_decomp.js

@@ -0,0 +1,27 @@
+import { m2_multiply } from "../../../geom/mat2/m2_multiply.js";
+import { m2_polar_decomp_noS } from "./m2_polar_decomp_noS.js";
+
+/**
+ * Performs a polar decomposition of a 2x2 matrix.
+ * This function decomposes a 2x2 matrix `m` into two matrices, `R` and `S`,
+ * such that m = S * R, where:
+ *  - R is a 2x2 orthogonal matrix (representing a rotation).
+ *  - S is a 2x2 symmetric positive semi-definite matrix.
+ * The input matrix `m` and output matrices `R` and `S` are stored in a flattened,
+ * transposed format (consistent with the Taichi programming language convention).
+ *
+ * @param {number[]} R Output: 2x2 orthogonal matrix (rotation), stored as a flattened
+ *  array [c, s, -s, c], where 'c' is the cosine and 's' is the sine of the rotation
+ *  angle. Modified in-place.
+ * @param {number[]} S Output: 2x2 symmetric positive semi-definite matrix,
+ *  stored as a flattened array. Modified in-place.
+ * @param {number[]} m Input: 2x2 matrix, stored as a flattened, *transposed* array [a, b, c, d],
+ * representing the matrix [[a, c], [b, d]]. Will be read from, but NOT modified.
+ */
+export function m2_polar_decomp(R, S, m) {
+    // transposed as in taichi
+
+    m2_polar_decomp_noS(R, m);
+
+    m2_multiply(S, m, R);
+}