@woosh/meep-engine 2.94.1 → 2.94.4

package/build/meep.module.js

@@ -502,6 +502,19 @@ assert.isFunction = function (value, name = 'value') {
     }
 };
 
+/**
+ *
+ * @param {Object|*} value
+ * @param {string} [name]
+ */
+assert.isObject = function (value, name = 'value') {
+    const typeofValue = typeof value;
+
+    if (typeofValue !== 'object') {
+        throw new Error(`expected ${name} to be an object, instead was '${typeofValue}'(=${value})`);
+    }
+};
+
 /**
  *
  * @param {number|*} value
@@ -1723,6 +1736,23 @@ function clamp$1(value, min, max) {
     }
 }
 
+/**
+ * Clamps a value to 0..1 range
+ * Same as `clamp(value, 0, 1)`
+ * Works the same as `saturate` function in GLSL
+ * @param {number} value
+ * @returns {number}
+ */
+function clamp01(value) {
+    if (value < 0) {
+        return 0;
+    } else if (value > 1) {
+        return 1;
+    } else {
+        return value;
+    }
+}
+
 /**
  * Very small value, used for comparison when compensation for rounding error is required
  * @type {number}
@@ -1752,16 +1782,6 @@ function lerp$1(a, b, fraction) {
     return (b - a) * fraction + a;
 }
 
-/**
- * Returns lowest value out of 2 supplied
- * @param {number} a
- * @param {number} b
- * @returns {number}
- */
-function min2(a, b) {
-    return a < b ? a : b;
-}
-
 /**
  *
  * @param {number} v
@@ -4252,23 +4272,23 @@ let Quaternion$1 = class Quaternion {
         this.set(x, y, z, w);
     }
 
-
     /**
-     * @see https://github.com/toji/gl-matrix/blob/master/src/gl-matrix/quat.js
-     * @param {Quaternion} other
+     *
+     * @param {Quaternion} from
+     * @param {Quaternion} to
      * @param {number} t
      */
-    slerp(other, t) {
+    slerpQuaternions(from, to, t) {
 
-        const ax = this.x,
-            ay = this.y,
-            az = this.z,
-            aw = this.w;
+        const ax = from.x,
+            ay = from.y,
+            az = from.z,
+            aw = from.w;
 
-        let bx = other.x,
-            by = other.y,
-            bz = other.z,
-            bw = other.w;
+        let bx = to.x,
+            by = to.y,
+            bz = to.z,
+            bw = to.w;
 
         let omega, cosom, sinom, scale0, scale1;
 
@@ -4306,6 +4326,16 @@ let Quaternion$1 = class Quaternion {
         this.set(_x, _y, _z, _w);
     }
 
+
+    /**
+     * @see https://github.com/toji/gl-matrix/blob/master/src/gl-matrix/quat.js
+     * @param {Quaternion} other
+     * @param {number} t
+     */
+    slerp(other, t) {
+        this.slerpQuaternions(this, other, t);
+    }
+
     /**
      * @see https://github.com/gareth-cross/quat/blob/master/include/quaternion.hpp
      * TODO implement
@@ -4587,9 +4617,9 @@ let Quaternion$1 = class Quaternion {
 
     /**
      *
-     * @param {number} x
-     * @param {number} y
-     * @param {number} z
+     * @param {number} x in radians
+     * @param {number} y in radians
+     * @param {number} z in radians
      * @returns {Quaternion}
      */
     static fromEulerAngles(x, y, z) {
@@ -4616,9 +4646,9 @@ let Quaternion$1 = class Quaternion {
             result.copy(to);
         } else {
             // clamp to 1, to make sure we don't overshoot
-            const t = min2(1, max_delta / angle);
+            const t = clamp01(max_delta / angle);
 
-            from.slerp(to, t);
+            result.slerpQuaternions(from, to, t);
         }
 
     }
@@ -5001,6 +5031,24 @@ class Transform {
     toString() {
         return `{ position: ${this.position}, rotation: ${this.rotation}, scale: ${this.scale} }`;
     }
+
+    /**
+     * @deprecated use {@link Quaternion.rotateTowards} instead
+     * @param {Quaternion} sourceQuaternion
+     * @param {Vector3} targetVector
+     * @param {Number} limit
+     */
+    static adjustRotation(
+        sourceQuaternion,
+        targetVector,
+        limit = Infinity
+    ) {
+        const q = new Quaternion$1();
+
+        q.lookRotation(targetVector);
+
+        sourceQuaternion.rotateTowards(q, limit);
+    }
 }
 
 /**
@@ -5013,22 +5061,7 @@ Transform.typeName = "Transform";
  * @readonly
  * @type {boolean}
  */
-Transform.prototype.isTransform = true;
-
-
-/**
- * @deprecated use {@link Quaternion.rotateTowards} instead
- * @param {Quaternion} sourceQuaternion
- * @param {Vector3} targetVector
- * @param {Number} limit
- */
-Transform.adjustRotation = function (sourceQuaternion, targetVector, limit = Infinity) {
-    const q = new Quaternion$1();
-
-    q.lookRotation(targetVector);
-
-    sourceQuaternion.rotateTowards(q, limit);
-};
+Transform.prototype.isTransform = true;
 
 /**
  * Common utilities
@@ -47275,6 +47308,16 @@ function max2(a, b) {
     return a < b ? b : a;
 }
 
+/**
+ * Returns lowest value out of 2 supplied
+ * @param {number} a
+ * @param {number} b
+ * @returns {number}
+ */
+function min2(a, b) {
+    return a < b ? a : b;
+}
+
 /**
  *
  * @param {number} x
@@ -53300,23 +53343,6 @@ function bvh_query_leaves_ray(
     return result_cursor - result_offset;
 }
 
-/**
- * Clamps a value to 0..1 range
- * Same as `clamp(value, 0, 1)`
- * Works the same as `saturate` function in GLSL
- * @param {number} value
- * @returns {number}
- */
-function clamp01(value) {
-    if (value < 0) {
-        return 0;
-    } else if (value > 1) {
-        return 1;
-    } else {
-        return value;
-    }
-}
-
 /**
  * Returns lowest value out of 3 supplied
  * @param {number} a
@@ -70086,7 +70112,7 @@ BitSet.prototype.nextSetBit = function (fromIndex) {
 
 
     //scan the rest of the words
-    const word_count = bit_length / 32;
+    const word_count = (bit_length + 31) >> 5; // Math.ceil(x /32)
     for (; word_index < word_count; word_index++) {
         word = data[word_index];
 
@@ -70122,8 +70148,6 @@ BitSet.prototype.nextClearBit = function (fromIndex) {
     // treat first word specially, as we may need to mask out portion of a word to skip certain number of bits
     let bit_index = fromIndex & 31;
 
-    const set_length = this.__length;
-    const word_count = set_length / 32;
     const data = this.__data_uint32;
 
     if (bit_index !== 0) {
@@ -70143,6 +70167,8 @@ BitSet.prototype.nextClearBit = function (fromIndex) {
 
         word_index++;
     }
+    const set_length = this.__length;
+    const word_count = (set_length + 31) >> 5; // Math.ceil(x /32)
 
     //scan the rest
     for (; word_index < word_count; word_index++) {
@@ -113611,12 +113637,13 @@ function resolvePathByArray(object, parts, missingPropertyHandler) {
 /**
  *
  * @param {object} object
- * @param {string} path
+ * @param {string} path separated with forward slash "/"
  * @param {function} [missingPropertyHandler] Allows custom handling of missing properties
  * @returns {*}
  * @throws {Error} if a path can not be resolved
  */
 function resolvePath(object, path, missingPropertyHandler) {
+
     const parts = path.split("/");
 
     return resolvePathByArray(object, parts, missingPropertyHandler);
@@ -116584,7 +116611,7 @@ function compute_neighbors(result, index, width, height) {
 /**
  *
  * @param {number} node
- * @param {number[]} g_score
+ * @param {number[]|Float32Array} g_score
  * @param {number} width
  * @param {number} height
  * @returns {number[]}
@@ -116613,11 +116640,11 @@ function compute_path(node, g_score, width, height) {
 
         // normalize
         if (_dx !== 0) {
-            _dx /= Math.abs(_dx);
+            _dx = sign$1(_dx);
         }
 
         if (_dy !== 0) {
-            _dy /= Math.abs(_dy);
+            _dy = sign$1(_dy);
         }
 
         const direction_change = dx !== _dx || dy !== _dy;
@@ -116678,6 +116705,7 @@ function compute_path(node, g_score, width, height) {
 
     }
 
+    // so far the path is from goal to start, we need to reverse it
     result.reverse();
 
     return result;
@@ -116725,7 +116753,6 @@ let g_score = new Float32Array(1024);
  * @param {number} height
  * @param {number} start
  * @param {number} goal
- * @param {number} crossing_penalty
  * @param {number} block_value value in the field that signifies impassible obstacle
  * @returns {Array.<number>} array of indices representing path from start to end
  */
@@ -116733,7 +116760,6 @@ function find_path_on_grid_astar(
     field,
     width, height,
     start, goal,
-    crossing_penalty,
     block_value
 ) {
 
@@ -116788,7 +116814,7 @@ function find_path_on_grid_astar(
             }
 
             // Cost of traversing to this neighbour
-            const transition_cost = neighbor_value * crossing_penalty + 1;
+            const transition_cost = neighbor_value + 1;
 
             // updated path cost
             const cost_so_far = g_score[currentNode] + transition_cost;

package/package.json

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

package/src/core/assert.d.ts

@@ -53,6 +53,12 @@ export namespace assert {
      * @param {string} [name]
      */
     export function isFunction(value: any, name?: string): void;
+    /**
+     *
+     * @param {Object|*} value
+     * @param {string} [name]
+     */
+    export function isObject(value: any, name?: string): void;
     /**
      *
      * @param {number|*} value

package/src/core/assert.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"assert.d.ts","sourceRoot":"","sources":["../../../src/core/assert.js"],"names":[],"mappings":"AA6BA,6CAIC;;IAsJD;;;;;OAKG;IACH,kEAQC;;;;;;;;;;;;;;;IAmBD;;;;;;OAMG;IACH,uGAGC;IAGD;;;;OAIG;IACH,0DAMC;IAED;;;;OAIG;IACH,0DAMC;IAED;;;;OAIG;IACH,2DAMC;IAED;;;;OAIG;IACH,4DAMC;IAED;;;;OAIG;IACH,2DAMC;IAED;;;;OAIG;IACH,sEAMC;IAED;;;;OAIG;IACH,4DAKC;IAED;;;;OAIG;IACH,+EAKC;IAGD;;;;OAIG;IACH,yDAMC;IAED;;;;OAIG;IACH,wDAIC;IAED;;;;OAIG;IACH,yDAMC;IAED;;;;OAIG;IACH,2DAIC;IAED;;;;OAIG;IACH,mEAIC;IAED;;;;;OAKG;IACH,2EAgBC;;AAlZD,wDAEC;AAED,6CAEC;AAbD,qDAKC;AAUD;;;;;GAKG;AACH,kCAJW,MAAM,KACN,MAAM,MACN,MAAM,QAIhB;AAQD;;;;;GAKG;AACH,gCAJW,MAAM,KACN,MAAM,MACN,MAAM,QAiBhB;AAyBD;;;;;GAKG;AACH,uCAJW,MAAM,KACN,MAAM,MACN,MAAM,QAiBhB;AA5CD;;;;;GAKG;AACH,6BAJW,MAAM,KACN,MAAM,MACN,MAAM,QAiBhB;AAyBD;;;;;GAKG;AACH,oCAJW,MAAM,KACN,MAAM,MACN,MAAM,QAiBhB;AAKD;;;;;GAKG;AACH,0CAHW,MAAM,cACN,MAAM,QAehB;AAED;;;;;GAKG;AACH,iEAFW,MAAM,QAIhB;AAED;;;;;GAKG;AACH,mEAFW,MAAM,QAIhB;AAED;;;;;GAKG;AACH,+IAFW,MAAM,QAMhB"}
+{"version":3,"file":"assert.d.ts","sourceRoot":"","sources":["../../../src/core/assert.js"],"names":[],"mappings":"AA6BA,6CAIC;;IAsJD;;;;;OAKG;IACH,kEAQC;;;;;;;;;;;;;;;IAmBD;;;;;;OAMG;IACH,uGAGC;IAGD;;;;OAIG;IACH,0DAMC;IAED;;;;OAIG;IACH,0DAMC;IAED;;;;OAIG;IACH,2DAMC;IAED;;;;OAIG;IACH,4DAMC;IAED;;;;OAIG;IACH,0DAMC;IAED;;;;OAIG;IACH,2DAMC;IAED;;;;OAIG;IACH,sEAMC;IAED;;;;OAIG;IACH,4DAKC;IAED;;;;OAIG;IACH,+EAKC;IAGD;;;;OAIG;IACH,yDAMC;IAED;;;;OAIG;IACH,wDAIC;IAED;;;;OAIG;IACH,yDAMC;IAED;;;;OAIG;IACH,2DAIC;IAED;;;;OAIG;IACH,mEAIC;IAED;;;;;OAKG;IACH,2EAgBC;;AA/ZD,wDAEC;AAED,6CAEC;AAbD,qDAKC;AAUD;;;;;GAKG;AACH,kCAJW,MAAM,KACN,MAAM,MACN,MAAM,QAIhB;AAQD;;;;;GAKG;AACH,gCAJW,MAAM,KACN,MAAM,MACN,MAAM,QAiBhB;AAyBD;;;;;GAKG;AACH,uCAJW,MAAM,KACN,MAAM,MACN,MAAM,QAiBhB;AA5CD;;;;;GAKG;AACH,6BAJW,MAAM,KACN,MAAM,MACN,MAAM,QAiBhB;AAyBD;;;;;GAKG;AACH,oCAJW,MAAM,KACN,MAAM,MACN,MAAM,QAiBhB;AAKD;;;;;GAKG;AACH,0CAHW,MAAM,cACN,MAAM,QAehB;AAED;;;;;GAKG;AACH,iEAFW,MAAM,QAIhB;AAED;;;;;GAKG;AACH,mEAFW,MAAM,QAIhB;AAED;;;;;GAKG;AACH,+IAFW,MAAM,QAMhB"}

package/src/core/assert.js

@@ -279,6 +279,19 @@ assert.isFunction = function (value, name = 'value') {
     }
 };
 
+/**
+ *
+ * @param {Object|*} value
+ * @param {string} [name]
+ */
+assert.isObject = function (value, name = 'value') {
+    const typeofValue = typeof value;
+
+    if (typeofValue !== 'object') {
+        throw new Error(`expected ${name} to be an object, instead was '${typeofValue}'(=${value})`);
+    }
+};
+
 /**
  *
  * @param {number|*} value

package/src/core/binary/BitSet.js

@@ -286,7 +286,7 @@ BitSet.prototype.nextSetBit = function (fromIndex) {
 
 
     //scan the rest of the words
-    const word_count = bit_length / 32;
+    const word_count = (bit_length + 31) >> 5; // Math.ceil(x /32)
     for (; word_index < word_count; word_index++) {
         word = data[word_index];
 
@@ -322,8 +322,6 @@ BitSet.prototype.nextClearBit = function (fromIndex) {
     // treat first word specially, as we may need to mask out portion of a word to skip certain number of bits
     let bit_index = fromIndex & 31;
 
-    const set_length = this.__length;
-    const word_count = set_length / 32;
     const data = this.__data_uint32;
 
     if (bit_index !== 0) {
@@ -343,6 +341,8 @@ BitSet.prototype.nextClearBit = function (fromIndex) {
 
         word_index++;
     }
+    const set_length = this.__length;
+    const word_count = (set_length + 31) >> 5; // Math.ceil(x /32)
 
     //scan the rest
     for (; word_index < word_count; word_index++) {

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

@@ -1 +1 @@
-{"version":3,"file":"Quaternion.d.ts","sourceRoot":"","sources":["../../../../src/core/geom/Quaternion.js"],"names":[],"mappings":";AA0BA;IAk7CI;;;;OAIG;IACH,kCAFa,UAAU,CAQtB;IAED;;;;;;OAMG;IACH,0BALW,MAAM,KACN,MAAM,KACN,MAAM,GACJ,UAAU,CAQtB;IAED;;;;;;OAMG;IACH,6BALW,UAAU,QACV,UAAU,MACV,UAAU,aACV,MAAM,QAiBhB;IAn+CD;;;;;;;OAOG;IACH,4DAwBC;IAtBG;;;OAGG;IACH,UAAU;IACV;;;OAGG;IACH,UAAU;IACV;;;OAGG;IACH,UAAU;IACV;;;OAGG;IACH,UAAU;IAEV,0DAA6B;IAqBjC,mBAEC;IAlBD,gBAEC;IAkBD,mBAEC;IAlBD,gBAEC;IAkBD,mBAEC;IAlBD,gBAEC;IAkBD,mBAEC;IAlBD,gBAEC;IA+BD;;;;;;;;OAQG;IACH,kBAPW,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,QAiDhB;IAED;;;;;OAKG;IACH,uBAJW,OAAO,QACP,OAAO,QAMjB;IAED;;;;OAIG;IACH,WAHW,UAAU,GACT,MAAM,CAQjB;IAED;;;OAGG;IACH,mBAFW,UAAU,QAKpB;IAED;;OAEG;IACH,eAqBC;IAED;;;;OAIG;IACH,eAHW,UAAU,GACT,MAAM,CAoBjB;IAED;;;;OAIG;IACH,oBAHW,OAAO,SACP,MAAM,QAIhB;IAED;;;;;;OAMG;IACH,mBALW,MAAM,MACN,MAAM,MACN,MAAM,SACN,MAAM,QAwBhB;IAED;;;;;OAKG;IACH,2BAJW,OAAO,SACP,UAAU,SACV,UAAU,QA+BpB;IAED;;;;OAIG;IACH,wBAHW,OAAO,GACL,MAAM,CAYlB;IAED;;;;OAIG;IACH,kBAHW,OAAO,GACL,MAAM,CAkBlB;IAED,kBAWC;IAED;;;;OAIG;IACH,oBAHW,MAAM,GACL,UAAU,CASrB;IAED;;OAEG;IACH,gBAFW,UAAU,QAIpB;IAED;;;;OAIG;IACH,2BAHW,UAAU,UACV,UAAU,QAcpB;IAED;;;;;;;;;;;OAWG;IACH,yBAVW,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,GACL,UAAU,CAYrB;IAED;;;OAGG;IACH,UAFY,MAAM,CASjB;IAED;;;;OAIG;IACH,qBAHW,UAAU,aACV,MAAM,QAIhB;IAED;;;;;OAKG;IACH,4BAJW,OAAO,OACP,OAAO,YACP,OAAO,QAuBjB;IAED;;;;OAIG;IACH,eAHW,OAAO,UACP,OAAO,QAUjB;IAED;;;OAGG;IACH,wBAFsB,MAAM,QAM3B;IAED;;;;;;;OAOG;IACH,kBANW,MAAM,KACN,MAAM,KACN,MAAM,mBAEJ,UAAU,CAmCtB;IAED;;;;OAIG;IACH,yBAFW,OAAO,QA4BjB;IAED;;;OAGG;IACH,yBAFW,OAAO,QA2BjB;IAED;;;OAGG;IACH,yBAFW,OAAO,QA0BjB;IAED;;;;;;OAMG;IACH,mBAJW,MAAM,KACN,MAAM,KACN,MAAM,QAIhB;IAED;;;;;;;;OAQG;IACH,sBAJW,MAAM,KACN,MAAM,KACN,MAAM,QAqBhB;IAED;;;;;;;;OAQG;IACH,sBAJW,MAAM,KACN,MAAM,KACN,MAAM,QAqBhB;IAED;;;;;;;;OAQG;IACH,sBAJW,MAAM,KACN,MAAM,KACN,MAAM,QAqBhB;IAED;;;;;;;;OAQG;IACH,sBAJW,MAAM,KACN,MAAM,KACN,MAAM,QAqBhB;IAED;;;;;;;;OAQG;IACH,sBAJW,MAAM,KACN,MAAM,KACN,MAAM,QAqBhB;IAED;;;;;;;;OAQG;IACH,sBAJW,MAAM,KACN,MAAM,KACN,MAAM,QAqBhB;IAED;;;;OAIG;IACH,yBAHW,OAAO,MACP,OAAO,QA+CjB;IAED;;;;OAIG;IACH,uBAHW,OAAO,MACP,OAAO,QAiEjB;IAED;;;;OAIG;IACH,sBAHW,OAAO,MACP,OAAO,QAwCjB;IAED;;;OAGG;IACH,wCASC;IAED;;;;;;;;;;;;;;OAcG;IACH,6BAXW,MAAM,OACN,MAAM,OACN,MAAM,OACN,MAAM,OACN,MAAM,OACN,MAAM,OACN,MAAM,OACN,MAAM,OACN,MAAM,GACJ,UAAU,CA4EtB;IAED;;;;OAIG;IACH,YAHW,UAAU,KACV,MAAM,QAMhB;IAED;;;;;OAKG;IACH,uBAJW,UAAU,UACV,UAAU,KACV,MAAM,QAgBhB;IAGD;;;;OAIG;IACH,aAHW,UAAU,KACV,MAAM,QAiDhB;IAED;;;;;;OAMG;IACH,qCAJW,UAAU,KACV,UAAU,KACV,MAAM,QAIhB;IAED;;;OAGG;IACH,iCAIC;IAED;;;;OAIG;IACH,YAHW,UAAU,GACR,UAAU,CAItB;IAED;;;OAGG;IACH,SAFa,UAAU,CAQtB;IAED;;;;;;;OAOG;IACH,OANW,MAAM,KACN,MAAM,KACN,MAAM,KACN,MAAM,GACJ,UAAU,CA+BtB;IAED;;;OAGG;IACH,aAFa,UAAU,CAItB;IAED;;;;;MAOC;IAED,yBAEC;IAED;;;OAGG;IACH,2CAKC;IAED;;;OAGG;IACH,6CAOC;IAED;;;OAGG;IACH,kDAKC;IAED;;;OAGG;IACH,oDAOC;IAED;;;OAGG;IACH,wBAFW,MAAM,QAIhB;IAED;;;OAGG;IACH,kBAFa,MAAM,CAIlB;IAED;;;;OAIG;IACH,qBAHW,MAAM,EAAE,WACR,MAAM,QAShB;IAED;;;;OAIG;IACH,oBAHW,MAAM,EAAE,WACR,MAAM,QAOhB;IAED,oBAEC;IAED;;;;OAIG;IACH,cAHW,UAAU,GACR,OAAO,CAQnB;IAED;;;OAGG;IACH,QAFa,MAAM,CAQlB;IAED;;;;;OAKG;IACH,qBAJW,UAAU,cACV,MAAM,GACL,OAAO,CAIlB;IAED;;;;;;;;;OASG;IACH,uBAKC;IAED;;;;OAIG;IACH,sBAHsB,MAAM,GAChB,UAAU,CAkBrB;IAED,mBAEC;IAuDL,mBAhKe,MAAM,EAAE,WACR,MAAM,UA+JS;IAC9B,iBAnJe,MAAM,EAAE,WACR,MAAM,UAkJO;IAn6CxB;;OAEG;IACH,sDAOC;CAs5CJ;;kBAOS,UAAU;;mBAhgDD,4BAA4B;oBAU3B,cAAc"}
+{"version":3,"file":"Quaternion.d.ts","sourceRoot":"","sources":["../../../../src/core/geom/Quaternion.js"],"names":[],"mappings":";AA0BA;IA47CI;;;;OAIG;IACH,kCAFa,UAAU,CAQtB;IAED;;;;;;OAMG;IACH,0BALW,MAAM,KACN,MAAM,KACN,MAAM,GACJ,UAAU,CAQtB;IAED;;;;;;OAMG;IACH,6BALW,UAAU,QACV,UAAU,MACV,UAAU,aACV,MAAM,QAkBhB;IA9+CD;;;;;;;OAOG;IACH,4DAwBC;IAtBG;;;OAGG;IACH,UAAU;IACV;;;OAGG;IACH,UAAU;IACV;;;OAGG;IACH,UAAU;IACV;;;OAGG;IACH,UAAU;IAEV,0DAA6B;IAqBjC,mBAEC;IAlBD,gBAEC;IAkBD,mBAEC;IAlBD,gBAEC;IAkBD,mBAEC;IAlBD,gBAEC;IAkBD,mBAEC;IAlBD,gBAEC;IA+BD;;;;;;;;OAQG;IACH,kBAPW,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,QAiDhB;IAED;;;;;OAKG;IACH,uBAJW,OAAO,QACP,OAAO,QAMjB;IAED;;;;OAIG;IACH,WAHW,UAAU,GACT,MAAM,CAQjB;IAED;;;OAGG;IACH,mBAFW,UAAU,QAKpB;IAED;;OAEG;IACH,eAqBC;IAED;;;;OAIG;IACH,eAHW,UAAU,GACT,MAAM,CAoBjB;IAED;;;;OAIG;IACH,oBAHW,OAAO,SACP,MAAM,QAIhB;IAED;;;;;;OAMG;IACH,mBALW,MAAM,MACN,MAAM,MACN,MAAM,SACN,MAAM,QAwBhB;IAED;;;;;OAKG;IACH,2BAJW,OAAO,SACP,UAAU,SACV,UAAU,QA+BpB;IAED;;;;OAIG;IACH,wBAHW,OAAO,GACL,MAAM,CAYlB;IAED;;;;OAIG;IACH,kBAHW,OAAO,GACL,MAAM,CAkBlB;IAED,kBAWC;IAED;;;;OAIG;IACH,oBAHW,MAAM,GACL,UAAU,CASrB;IAED;;OAEG;IACH,gBAFW,UAAU,QAIpB;IAED;;;;OAIG;IACH,2BAHW,UAAU,UACV,UAAU,QAcpB;IAED;;;;;;;;;;;OAWG;IACH,yBAVW,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,GACL,UAAU,CAYrB;IAED;;;OAGG;IACH,UAFY,MAAM,CASjB;IAED;;;;OAIG;IACH,qBAHW,UAAU,aACV,MAAM,QAIhB;IAED;;;;;OAKG;IACH,4BAJW,OAAO,OACP,OAAO,YACP,OAAO,QAuBjB;IAED;;;;OAIG;IACH,eAHW,OAAO,UACP,OAAO,QAUjB;IAED;;;OAGG;IACH,wBAFsB,MAAM,QAM3B;IAED;;;;;;;OAOG;IACH,kBANW,MAAM,KACN,MAAM,KACN,MAAM,mBAEJ,UAAU,CAmCtB;IAED;;;;OAIG;IACH,yBAFW,OAAO,QA4BjB;IAED;;;OAGG;IACH,yBAFW,OAAO,QA2BjB;IAED;;;OAGG;IACH,yBAFW,OAAO,QA0BjB;IAED;;;;;;OAMG;IACH,mBAJW,MAAM,KACN,MAAM,KACN,MAAM,QAIhB;IAED;;;;;;;;OAQG;IACH,sBAJW,MAAM,KACN,MAAM,KACN,MAAM,QAqBhB;IAED;;;;;;;;OAQG;IACH,sBAJW,MAAM,KACN,MAAM,KACN,MAAM,QAqBhB;IAED;;;;;;;;OAQG;IACH,sBAJW,MAAM,KACN,MAAM,KACN,MAAM,QAqBhB;IAED;;;;;;;;OAQG;IACH,sBAJW,MAAM,KACN,MAAM,KACN,MAAM,QAqBhB;IAED;;;;;;;;OAQG;IACH,sBAJW,MAAM,KACN,MAAM,KACN,MAAM,QAqBhB;IAED;;;;;;;;OAQG;IACH,sBAJW,MAAM,KACN,MAAM,KACN,MAAM,QAqBhB;IAED;;;;OAIG;IACH,yBAHW,OAAO,MACP,OAAO,QA+CjB;IAED;;;;OAIG;IACH,uBAHW,OAAO,MACP,OAAO,QAiEjB;IAED;;;;OAIG;IACH,sBAHW,OAAO,MACP,OAAO,QAwCjB;IAED;;;OAGG;IACH,wCASC;IAED;;;;;;;;;;;;;;OAcG;IACH,6BAXW,MAAM,OACN,MAAM,OACN,MAAM,OACN,MAAM,OACN,MAAM,OACN,MAAM,OACN,MAAM,OACN,MAAM,OACN,MAAM,GACJ,UAAU,CA4EtB;IAED;;;;OAIG;IACH,YAHW,UAAU,KACV,MAAM,QAMhB;IAED;;;;;OAKG;IACH,uBAJW,UAAU,UACV,UAAU,KACV,MAAM,QAgBhB;IAED;;;;;OAKG;IACH,uBAJW,UAAU,MACV,UAAU,KACV,MAAM,QAiDhB;IAGD;;;;OAIG;IACH,aAHW,UAAU,KACV,MAAM,QAIhB;IAED;;;;;;OAMG;IACH,qCAJW,UAAU,KACV,UAAU,KACV,MAAM,QAIhB;IAED;;;OAGG;IACH,iCAIC;IAED;;;;OAIG;IACH,YAHW,UAAU,GACR,UAAU,CAItB;IAED;;;OAGG;IACH,SAFa,UAAU,CAQtB;IAED;;;;;;;OAOG;IACH,OANW,MAAM,KACN,MAAM,KACN,MAAM,KACN,MAAM,GACJ,UAAU,CA+BtB;IAED;;;OAGG;IACH,aAFa,UAAU,CAItB;IAED;;;;;MAOC;IAED,yBAEC;IAED;;;OAGG;IACH,2CAKC;IAED;;;OAGG;IACH,6CAOC;IAED;;;OAGG;IACH,kDAKC;IAED;;;OAGG;IACH,oDAOC;IAED;;;OAGG;IACH,wBAFW,MAAM,QAIhB;IAED;;;OAGG;IACH,kBAFa,MAAM,CAIlB;IAED;;;;OAIG;IACH,qBAHW,MAAM,EAAE,WACR,MAAM,QAShB;IAED;;;;OAIG;IACH,oBAHW,MAAM,EAAE,WACR,MAAM,QAOhB;IAED,oBAEC;IAED;;;;OAIG;IACH,cAHW,UAAU,GACR,OAAO,CAQnB;IAED;;;OAGG;IACH,QAFa,MAAM,CAQlB;IAED;;;;;OAKG;IACH,qBAJW,UAAU,cACV,MAAM,GACL,OAAO,CAIlB;IAED;;;;;;;;;OASG;IACH,uBAKC;IAED;;;;OAIG;IACH,sBAHsB,MAAM,GAChB,UAAU,CAkBrB;IAED,mBAEC;IAwDL,mBAjKe,MAAM,EAAE,WACR,MAAM,UAgKS;IAC9B,iBApJe,MAAM,EAAE,WACR,MAAM,UAmJO;IA96CxB;;OAEG;IACH,sDAOC;CAi6CJ;;kBAOS,UAAU;;mBA3gDD,4BAA4B;oBAU3B,cAAc"}

package/src/core/geom/Quaternion.js

@@ -6,10 +6,10 @@
 import { assert } from "../assert.js";
 import Signal from "../events/signal/Signal.js";
 import { clamp } from "../math/clamp.js";
+import { clamp01 } from "../math/clamp01.js";
 import { EPSILON } from "../math/EPSILON.js";
 import { epsilonEquals } from "../math/epsilonEquals.js";
 import { lerp } from "../math/lerp.js";
-import { min2 } from "../math/min2.js";
 import { computeHashFloat } from "../primitives/numbers/computeHashFloat.js";
 import { quat_decode_from_uint32 } from "./3d/quaternion/quat_decode_from_uint32.js";
 import { quat_encode_to_uint32 } from "./3d/quaternion/quat_encode_to_uint32.js";
@@ -1152,24 +1152,24 @@ class Quaternion {
         this.set(x, y, z, w);
     }
 
-
     /**
-     * @see https://github.com/toji/gl-matrix/blob/master/src/gl-matrix/quat.js
-     * @param {Quaternion} other
+     *
+     * @param {Quaternion} from
+     * @param {Quaternion} to
      * @param {number} t
      */
-    slerp(other, t) {
+    slerpQuaternions(from, to, t) {
         assert.isNumber(t, 't');
 
-        const ax = this.x,
-            ay = this.y,
-            az = this.z,
-            aw = this.w;
+        const ax = from.x,
+            ay = from.y,
+            az = from.z,
+            aw = from.w;
 
-        let bx = other.x,
-            by = other.y,
-            bz = other.z,
-            bw = other.w;
+        let bx = to.x,
+            by = to.y,
+            bz = to.z,
+            bw = to.w;
 
         let omega, cosom, sinom, scale0, scale1;
 
@@ -1207,6 +1207,16 @@ class Quaternion {
         this.set(_x, _y, _z, _w);
     }
 
+
+    /**
+     * @see https://github.com/toji/gl-matrix/blob/master/src/gl-matrix/quat.js
+     * @param {Quaternion} other
+     * @param {number} t
+     */
+    slerp(other, t) {
+        this.slerpQuaternions(this, other, t);
+    }
+
     /**
      * @see https://github.com/gareth-cross/quat/blob/master/include/quaternion.hpp
      * TODO implement
@@ -1497,9 +1507,9 @@ class Quaternion {
 
     /**
      *
-     * @param {number} x
-     * @param {number} y
-     * @param {number} z
+     * @param {number} x in radians
+     * @param {number} y in radians
+     * @param {number} z in radians
      * @returns {Quaternion}
      */
     static fromEulerAngles(x, y, z) {
@@ -1519,6 +1529,7 @@ class Quaternion {
      */
     static rotateTowards(result, from, to, max_delta) {
         assert.isNumber(max_delta, 'max_delta');
+        assert.notNaN(max_delta, 'max_delta');
 
         const angle = from.angleTo(to);
 
@@ -1527,9 +1538,9 @@ class Quaternion {
             result.copy(to);
         } else {
             // clamp to 1, to make sure we don't overshoot
-            const t = min2(1, max_delta / angle);
+            const t = clamp01(max_delta / angle);
 
-            from.slerp(to, t);
+            result.slerpQuaternions(from, to, t);
         }
 
     }

package/src/core/geom/Quaternion.spec.js

@@ -1,6 +1,7 @@
+import { DEG_TO_RAD } from "../math/DEG_TO_RAD.js";
+import { decode_octahedron_to_unit } from "./3d/normal/octahedron/decode_octahedron_to_unit.js";
 import Quaternion from "./Quaternion.js";
 import Vector3 from "./Vector3.js";
-import { decode_octahedron_to_unit } from "./3d/normal/octahedron/decode_octahedron_to_unit.js";
 
 /**
  *
@@ -401,3 +402,28 @@ test("angleTo between identical quaternions should be 0", () => {
 
     expect(a.angleTo(b)).toBeCloseTo(0);
 });
+
+
+test("rotateTowards", () => {
+
+    const a = Quaternion.fromEulerAngles(30 * DEG_TO_RAD, 0, 0);
+    const b = Quaternion.fromEulerAngles(60 * DEG_TO_RAD, 0, 0);
+
+    const result = new Quaternion();
+
+    Quaternion.rotateTowards(result, a, b, 9 * DEG_TO_RAD);
+
+    expect(result.angleTo(a)).toBeCloseTo(9 * DEG_TO_RAD);
+
+    Quaternion.rotateTowards(result, a, b, 0);
+
+    expect(result.equals(a)).toBe(true);
+
+    Quaternion.rotateTowards(result, a, b, Infinity);
+
+    expect(result.equals(b)).toBe(true);
+
+    Quaternion.rotateTowards(result, a, b, -10);
+
+    expect(result.roughlyEquals(a)).toBe(true);
+});

package/src/core/json/resolvePath.d.ts

@@ -1,7 +1,7 @@
 /**
  *
  * @param {object} object
- * @param {string} path
+ * @param {string} path separated with forward slash "/"
  * @param {function} [missingPropertyHandler] Allows custom handling of missing properties
  * @returns {*}
  * @throws {Error} if a path can not be resolved

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

@@ -1 +1 @@
-{"version":3,"file":"resolvePath.d.ts","sourceRoot":"","sources":["../../../../src/core/json/resolvePath.js"],"names":[],"mappings":"AAGA;;;;;;;GAOG;AACH,oCANW,MAAM,QACN,MAAM,0CAShB"}
+{"version":3,"file":"resolvePath.d.ts","sourceRoot":"","sources":["../../../../src/core/json/resolvePath.js"],"names":[],"mappings":"AAIA;;;;;;;GAOG;AACH,oCANW,MAAM,QACN,MAAM,0CAYhB"}

package/src/core/json/resolvePath.js

@@ -1,15 +1,19 @@
+import { assert } from "../assert.js";
 import { resolvePathByArray } from "./resolvePathByArray.js";
 
 
 /**
  *
  * @param {object} object
- * @param {string} path
+ * @param {string} path separated with forward slash "/"
  * @param {function} [missingPropertyHandler] Allows custom handling of missing properties
  * @returns {*}
  * @throws {Error} if a path can not be resolved
  */
 export function resolvePath(object, path, missingPropertyHandler) {
+    assert.isString(path, 'path');
+    assert.isObject(object, "object");
+
     const parts = path.split("/");
 
     return resolvePathByArray(object, parts, missingPropertyHandler);

package/src/core/math/iabs.d.ts

@@ -0,0 +1,9 @@
+/**
+ * Branchless fast integer Absolute value function.
+ * Same as Math.abs(x) but for integer values only.
+ * Only valid for integers up to and including 32 bit.
+ * @param {number} x
+ * @return {number}
+ */
+export function iabs(x: number): number;
+//# sourceMappingURL=iabs.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"iabs.d.ts","sourceRoot":"","sources":["../../../../src/core/math/iabs.js"],"names":[],"mappings":"AAEA;;;;;;GAMG;AACH,wBAHW,MAAM,GACL,MAAM,CAOjB"}

package/src/core/math/iabs.js

@@ -0,0 +1,15 @@
+import { assert } from "../assert.js";
+
+/**
+ * Branchless fast integer Absolute value function.
+ * Same as Math.abs(x) but for integer values only.
+ * Only valid for integers up to and including 32 bit.
+ * @param {number} x
+ * @return {number}
+ */
+export function iabs(x) {
+    // adapted from https://graphics.stanford.edu/~seander/bithacks.html
+    assert.isInteger(x, 'x');
+
+    return (x ^ (x >> 31)) - (x >> 31);
+}

package/src/core/math/iabs.spec.d.ts

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

package/src/core/math/iabs.spec.d.ts.map

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

package/src/core/math/iabs.spec.js

@@ -0,0 +1,9 @@
+import { iabs } from "./iabs.js";
+
+test("basics", () => {
+    expect(iabs(0)).toBe(0);
+    expect(iabs(1)).toBe(1);
+    expect(iabs(1023)).toBe(1023);
+    expect(iabs(-1)).toBe(1);
+    expect(iabs(-1023)).toBe(1023);
+});

package/src/engine/ecs/transform/Transform.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"Transform.d.ts","sourceRoot":"","sources":["../../../../../src/engine/ecs/transform/Transform.js"],"names":[],"mappings":"AA0BA;;;GAGG;AACH;IAwQI;;;;OAIG;IACH,4BAFa,SAAS,CAQrB;IAjRD;;;OAGG;IACH,mBAHU,OAAO,CAGe;IAEhC;;;OAGG;IACH,mBAHU,UAAU,CAGkB;IAEtC;;;OAGG;IACH,gBAHU,OAAO,CAGY;IAE7B;;;;OAIG;IACH,iBAFU,YAAY,CAEW;IAEjC;;;;OAIG;IACH,OAFU,MAAM,CAEM;IAOtB;;;;OAIG;IACH,uBAMC;IAED;;;OAGG;IACH,kBAMC;IAED;;;OAGG;IACH,qBAMC;IAED;;;;OAIG;IACH,kDAIC;IAED;;;;OAIG;IACH,oDAIC;IAYD;;;;OAIG;IACH,cAHW,MAAM,GAAC,cAAc,GACnB,IAAI,CAIhB;IAED;;;;OAIG;IACH,gBAHW,MAAM,GAAC,cAAc,GACnB,IAAI,CAIhB;IAED;;;;OAIG;IACH,gBAHW,MAAM,GAAC,cAAc,SACrB,OAAO,QAQjB;IAED;;;;OAIG;IACH,cAHW,MAAM,GAAC,cAAc,GACnB,OAAO,CAInB;IAED;;OAEG;IACH,qBAEC;IAED;;;;OAIG;IACH,eAHW,OAAO,OACP,OAAO,QAmBjB;IAED,0BAwBC;IAED;;;;MAMC;IAED;;;OAGG;IACH,YAFW,SAAS,QAenB;IAED;;;OAGG;IACH,SAFa,SAAS,CAQrB;IAED;;;;OAIG;IACH,cAHW,SAAS,GACP,OAAO,CAMnB;IAED;;;OAGG;IACH,QAFa,MAAM,CAKlB;IAeD;;;;OAIG;IACH,sBAHW,SAAS,KACT,SAAS,QAMnB;IAED;;;OAGG;IACH,eAFW,OAAK,MAAM,EAAE,GAAC,YAAY,QAcpC;IAED;;;OAGG;IACH,kBAFW,MAAM,EAAE,GAAC,YAAY,QAI/B;IAED;;;;;OAKG;IACH,qBAEC;IAED,mBAEC;IASL;;;OAGG;IACH,sBAFU,OAAO,CAEc;;CAZ9B;;kBAIS,MAAM;IAWhB;;;;;OAKG;IACH,mGAMC;;oBArXmB,+BAA+B;uBAD5B,kCAAkC;+BAE1B,qBAAqB"}
+{"version":3,"file":"Transform.d.ts","sourceRoot":"","sources":["../../../../../src/engine/ecs/transform/Transform.js"],"names":[],"mappings":"AA0BA;;;GAGG;AACH;IAwQI;;;;OAIG;IACH,4BAFa,SAAS,CAQrB;IAqDD;;;;;OAKG;IACH,wCAJW,UAAU,gBACV,OAAO,wBAajB;IAtVD;;;OAGG;IACH,mBAHU,OAAO,CAGe;IAEhC;;;OAGG;IACH,mBAHU,UAAU,CAGkB;IAEtC;;;OAGG;IACH,gBAHU,OAAO,CAGY;IAE7B;;;;OAIG;IACH,iBAFU,YAAY,CAEW;IAEjC;;;;OAIG;IACH,OAFU,MAAM,CAEM;IAOtB;;;;OAIG;IACH,uBAMC;IAED;;;OAGG;IACH,kBAMC;IAED;;;OAGG;IACH,qBAMC;IAED;;;;OAIG;IACH,kDAIC;IAED;;;;OAIG;IACH,oDAIC;IAYD;;;;OAIG;IACH,cAHW,MAAM,GAAC,cAAc,GACnB,IAAI,CAIhB;IAED;;;;OAIG;IACH,gBAHW,MAAM,GAAC,cAAc,GACnB,IAAI,CAIhB;IAED;;;;OAIG;IACH,gBAHW,MAAM,GAAC,cAAc,SACrB,OAAO,QAQjB;IAED;;;;OAIG;IACH,cAHW,MAAM,GAAC,cAAc,GACnB,OAAO,CAInB;IAED;;OAEG;IACH,qBAEC;IAED;;;;OAIG;IACH,eAHW,OAAO,OACP,OAAO,QAmBjB;IAED,0BAwBC;IAED;;;;MAMC;IAED;;;OAGG;IACH,YAFW,SAAS,QAenB;IAED;;;OAGG;IACH,SAFa,SAAS,CAQrB;IAED;;;;OAIG;IACH,cAHW,SAAS,GACP,OAAO,CAMnB;IAED;;;OAGG;IACH,QAFa,MAAM,CAKlB;IAeD;;;;OAIG;IACH,sBAHW,SAAS,KACT,SAAS,QAMnB;IAED;;;OAGG;IACH,eAFW,OAAK,MAAM,EAAE,GAAC,YAAY,QAcpC;IAED;;;OAGG;IACH,kBAFW,MAAM,EAAE,GAAC,YAAY,QAI/B;IAED;;;;;OAKG;IACH,qBAEC;IAED,mBAEC;IA2BL;;;OAGG;IACH,sBAFU,OAAO,CAEc;;CAZ9B;;kBAIS,MAAM;;oBAhXI,+BAA+B;uBAD5B,kCAAkC;+BAE1B,qBAAqB"}