@woosh/meep-engine 2.102.0 → 2.104.0

package/src/core/geom/vec3/v3_angle_cos_between.spec.js

@@ -0,0 +1,124 @@
+import { v3_angle_cos_between } from "./v3_angle_cos_between.js";
+
+function validate_result(value) {
+    expect(typeof value).toBe("number");
+    expect(value).not.toBeNaN();
+    expect(value).toBeGreaterThanOrEqual(-1);
+    expect(value).toBeLessThanOrEqual(1);
+}
+
+test("zero-length vectors produce valid results", () => {
+
+    validate_result(v3_angle_cos_between(
+        0, 0, 0,
+        0, 0, 0
+    ));
+
+    validate_result(v3_angle_cos_between(
+        1, 0, 0,
+        0, 0, 0
+    ));
+
+    validate_result(v3_angle_cos_between(
+        0, 1, 0,
+        0, 0, 0
+    ));
+
+    validate_result(v3_angle_cos_between(
+        0, 0, 1,
+        0, 0, 0
+    ));
+
+    validate_result(v3_angle_cos_between(
+        0, 0, 0,
+        1, 0, 0
+    ));
+
+    validate_result(v3_angle_cos_between(
+        0, 0, 0,
+        0, 1, 0
+    ));
+
+    validate_result(v3_angle_cos_between(
+        0, 0, 0,
+        0, 0, 1
+    ));
+
+});
+test("Right angles", () => {
+
+    expect(v3_angle_cos_between(
+        1, 0, 0,
+        0, 1, 0
+    )).toBeCloseTo(0);
+
+    expect(v3_angle_cos_between(
+        1, 0, 0,
+        0, 0, 1
+    )).toBeCloseTo(0);
+
+    expect(v3_angle_cos_between(
+        -1, 0, 0,
+        0, 1, 0
+    )).toBeCloseTo(0);
+
+    expect(v3_angle_cos_between(
+        -1, 0, 0,
+        0, 0, 1
+    )).toBeCloseTo(0);
+
+    expect(v3_angle_cos_between(
+        0, 1, 0,
+        1, 0, 0
+    )).toBeCloseTo(0);
+
+    expect(v3_angle_cos_between(
+        0, 1, 0,
+        0, 0, 1
+    )).toBeCloseTo(0);
+
+    expect(v3_angle_cos_between(
+        0, -1, 0,
+        1, 0, 0
+    )).toBeCloseTo(0);
+
+    expect(v3_angle_cos_between(
+        0, -1, 0,
+        0, 0, 1
+    )).toBeCloseTo(0);
+
+    expect(v3_angle_cos_between(
+        0, 0, 1,
+        1, 0, 0
+    )).toBeCloseTo(0);
+
+    expect(v3_angle_cos_between(
+        0, 0, 1,
+        0, 1, 0
+    )).toBeCloseTo(0);
+
+    expect(v3_angle_cos_between(
+        0, 0, -1,
+        1, 0, 0
+    )).toBeCloseTo(0);
+
+    expect(v3_angle_cos_between(
+        0, 0, -1,
+        0, 1, 0
+    )).toBeCloseTo(0);
+
+});
+
+test("non-uniform vectors", () => {
+
+    expect(v3_angle_cos_between(
+        3, 0, 0,
+        0, 7, 0
+    )).toBeCloseTo(0);
+
+    expect(v3_angle_cos_between(
+        -3, 0, 0,
+        0, 7, 0
+    )).toBeCloseTo(0);
+
+});

package/src/core/geom/vec3/v3_distance_above_plane.d.ts

@@ -1,4 +1,13 @@
-export declare function v3_distance_above_plane(
-    x: number, y: number, z: number,
-    normalX: number, normalY: number, normalZ: number, planeConstant: number
-): number
+/**
+ * Orthogonal distance of a point to a plane, the distance is positive when the point lies above the plane and negative when the point is below
+ * @param {number} x
+ * @param {number} y
+ * @param {number} z
+ * @param {number} normalX
+ * @param {number} normalY
+ * @param {number} normalZ
+ * @param {number} planeConstant
+ * @returns {number}
+ */
+export function v3_distance_above_plane(x: number, y: number, z: number, normalX: number, normalY: number, normalZ: number, planeConstant: number): number;
+//# sourceMappingURL=v3_distance_above_plane.d.ts.map

package/src/core/geom/vec3/v3_distance_sqr.d.ts

@@ -1 +1,12 @@
-export function v3_distance_sqr(x0: number, y0: number, z0: number, x1: number, y1: number, z1: number): number
+/**
+ *
+ * @param {number} x0
+ * @param {number} y0
+ * @param {number} z0
+ * @param {number} x1
+ * @param {number} y1
+ * @param {number} z1
+ * @returns {number}
+ */
+export function v3_distance_sqr(x0: number, y0: number, z0: number, x1: number, y1: number, z1: number): number;
+//# sourceMappingURL=v3_distance_sqr.d.ts.map

package/src/core/geom/vec3/v3_length.d.ts

@@ -1 +1,9 @@
-export declare function v3_length(x: number, y: number, z: number): number
+/**
+ *
+ * @param {number} x
+ * @param {number} y
+ * @param {number} z
+ * @returns {number}
+ */
+export function v3_length(x: number, y: number, z: number): number;
+//# sourceMappingURL=v3_length.d.ts.map

package/src/core/lang/reactive/compileReactiveExpression.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"compileReactiveExpression.d.ts","sourceRoot":"","sources":["../../../../../src/core/lang/reactive/compileReactiveExpression.js"],"names":[],"mappings":"AAIA;;;;GAIG;AACH,4EAQC"}
+{"version":3,"file":"compileReactiveExpression.d.ts","sourceRoot":"","sources":["../../../../../src/core/lang/reactive/compileReactiveExpression.js"],"names":[],"mappings":"AAIA;;;;GAIG;AACH,4EAMC"}

package/src/core/lang/reactive/compileReactiveExpression.js

@@ -12,7 +12,5 @@ export function compileReactiveExpression(code) {
 
     const parseTree = ReactivePegParser.INSTANCE.parse(code);
 
-    const expression = ReactivePegCompiler.compile(parseTree);
-
-    return expression;
+    return ReactivePegCompiler.compile(parseTree);
 }

package/src/core/lang/reactive/pegjs/ReactivePegCompiler.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"ReactivePegCompiler.d.ts","sourceRoot":"","sources":["../../../../../../src/core/lang/reactive/pegjs/ReactivePegCompiler.js"],"names":[],"mappings":"AAqHA;IAKI;;;;OAIG;IACH,oDAEC;CACJ"}
+{"version":3,"file":"ReactivePegCompiler.d.ts","sourceRoot":"","sources":["../../../../../../src/core/lang/reactive/pegjs/ReactivePegCompiler.js"],"names":[],"mappings":"AA8HA;IAEI;;;;OAIG;IACH,oDAEC;CACJ"}

package/src/core/lang/reactive/pegjs/ReactivePegCompiler.js

@@ -1,3 +1,4 @@
+import { assert } from "../../../assert.js";
 import { ReactiveAdd } from "../../../model/reactive/model/arithmetic/ReactiveAdd.js";
 import { ReactiveDivide } from "../../../model/reactive/model/arithmetic/ReactiveDivide.js";
 import { ReactiveMultiply } from "../../../model/reactive/model/arithmetic/ReactiveMultiply.js";
@@ -110,16 +111,21 @@ const Compiler_Types = {
  * @param {{type:string}} node
  */
 function compile(node) {
-    const c = Compiler_Types[node.type];
+    const node_type = node.type;
 
-    return c(node);
-}
+    assert.isString(node_type, 'node.type');
 
-export class ReactivePegCompiler {
-    constructor() {
+    const type_compiler = Compiler_Types[node_type];
 
+    if (type_compiler === undefined) {
+        throw new Error(`Unsupported node type '${node_type}'`);
     }
 
+    return type_compiler(node);
+}
+
+export class ReactivePegCompiler {
+
     /**
      *
      * @param {Object} syntaxTree

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

@@ -0,0 +1,6 @@
+/**
+ * 1 / pi
+ * @type {number}
+ */
+export const PI_RECIPROCAL: number;
+//# sourceMappingURL=PI_RECIPROCAL.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"PI_RECIPROCAL.d.ts","sourceRoot":"","sources":["../../../../src/core/math/PI_RECIPROCAL.js"],"names":[],"mappings":"AAAA;;;GAGG;AACH,4BAFU,MAAM,CAEyB"}

package/src/core/math/PI_RECIPROCAL.js

@@ -0,0 +1,5 @@
+/**
+ * 1 / pi
+ * @type {number}
+ */
+export const PI_RECIPROCAL = 1 / Math.PI;

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

@@ -1,10 +1,11 @@
 /**
- * Newtonian solver, works by moving along the curve in the direction of gradient
+ * Newtonian solver, works by moving along the curve in the direction of gradient.
+ * Solving for f(x) = 0
  * @param {function(number):number} f Function for which we are trying to solve
- * @param {number} xStart
+ * @param {number} xStart initial guess for input value
  * @param {number} [max_steps]
  * @param {number} [eps]
- * @returns {number}
+ * @returns {number} value for X where function is close to 0 or exactly at 0
  */
 export function newton_solver_1d(f: (arg0: number) => number, xStart: number, max_steps?: number, eps?: number): number;
 //# sourceMappingURL=newton_solver_1d.d.ts.map

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

@@ -1 +1 @@
-{"version":3,"file":"newton_solver_1d.d.ts","sourceRoot":"","sources":["../../../../src/core/math/newton_solver_1d.js"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AACH,2CANoB,MAAM,KAAE,MAAM,UACvB,MAAM,cACN,MAAM,QACN,MAAM,GACJ,MAAM,CAuBlB"}
+{"version":3,"file":"newton_solver_1d.d.ts","sourceRoot":"","sources":["../../../../src/core/math/newton_solver_1d.js"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AACH,2CANoB,MAAM,KAAE,MAAM,UACvB,MAAM,cACN,MAAM,QACN,MAAM,GACJ,MAAM,CAuBlB"}

package/src/core/math/newton_solver_1d.js

@@ -1,10 +1,11 @@
 /**
- * Newtonian solver, works by moving along the curve in the direction of gradient
+ * Newtonian solver, works by moving along the curve in the direction of gradient.
+ * Solving for f(x) = 0
  * @param {function(number):number} f Function for which we are trying to solve
- * @param {number} xStart
+ * @param {number} xStart initial guess for input value
  * @param {number} [max_steps]
  * @param {number} [eps]
- * @returns {number}
+ * @returns {number} value for X where function is close to 0 or exactly at 0
  */
 export function newton_solver_1d(
     f,

package/src/core/math/physics/brdf/D_GGX.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"D_GGX.d.ts","sourceRoot":"","sources":["../../../../../../src/core/math/physics/brdf/D_GGX.js"],"names":[],"mappings":"AAAA;;;;;;GAMG;AACH,2BAJW,MAAM,aACN,MAAM,GACJ,MAAM,CAOlB"}
+{"version":3,"file":"D_GGX.d.ts","sourceRoot":"","sources":["../../../../../../src/core/math/physics/brdf/D_GGX.js"],"names":[],"mappings":"AAEA;;;;;;GAMG;AACH,2BAJW,MAAM,aACN,MAAM,GACJ,MAAM,CAQlB"}

package/src/core/math/physics/brdf/D_GGX.js

@@ -1,3 +1,5 @@
+import { PI_RECIPROCAL } from "../../PI_RECIPROCAL.js";
+
 /**
  * GGX diffuse distribution function
  * @see https://google.github.io/filament/Filament.md.html#listing_diffusebrdf
@@ -7,7 +9,8 @@
  */
 export function D_GGX(NoH, roughness) {
     const a = NoH * roughness;
+
     const k = roughness / (1 - NoH * NoH + a * a);
 
-    return k * k * (1 / Math.PI);
+    return k * k * PI_RECIPROCAL;
 }

package/src/core/math/physics/brdf/brdf_burley.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"brdf_burley.d.ts","sourceRoot":"","sources":["../../../../../../src/core/math/physics/brdf/brdf_burley.js"],"names":[],"mappings":"AAKA;;;;;;;;;;;;;GAaG;AACH,iCANW,MAAM,OACN,MAAM,OACN,MAAM,aACN,MAAM,GACJ,MAAM,CAOlB"}
+{"version":3,"file":"brdf_burley.d.ts","sourceRoot":"","sources":["../../../../../../src/core/math/physics/brdf/brdf_burley.js"],"names":[],"mappings":"AAOA;;;;;;;;;;;;;GAaG;AACH,iCANW,MAAM,OACN,MAAM,OACN,MAAM,aACN,MAAM,GACJ,MAAM,CASlB"}

package/src/core/math/physics/brdf/brdf_burley.js

@@ -1,3 +1,5 @@
+import { PI_RECIPROCAL } from "../../PI_RECIPROCAL.js";
+
 function F_Schlick(u, f0, f90) {
 
     return f0 + (f90 - f0) * Math.pow(1.0 - u, 5.0);
@@ -19,7 +21,9 @@ function F_Schlick(u, f0, f90) {
  */
 export function brdf_burley(NoV, NoL, LoH, roughness) {
     const f90 = 0.5 + 2.0 * roughness * LoH * LoH;
+
     const lightScatter = F_Schlick(NoL, 1.0, f90);
     const viewScatter = F_Schlick(NoV, 1.0, f90);
-    return lightScatter * viewScatter * (1.0 / Math.PI);
+
+    return lightScatter * viewScatter * PI_RECIPROCAL;
 }

package/src/core/math/physics/irradiance/interpolate_irradiance_smith.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"interpolate_irradiance_smith.d.ts","sourceRoot":"","sources":["../../../../../../src/core/math/physics/irradiance/interpolate_irradiance_smith.js"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AACH,uDALW,MAAM,OACN,MAAM,OACN,MAAM,GACL,MAAM,CA+BjB"}
+{"version":3,"file":"interpolate_irradiance_smith.d.ts","sourceRoot":"","sources":["../../../../../../src/core/math/physics/irradiance/interpolate_irradiance_smith.js"],"names":[],"mappings":"AAGA;;;;;;;GAOG;AACH,uDALW,MAAM,OACN,MAAM,OACN,MAAM,GACL,MAAM,CA4BjB"}

package/src/core/math/physics/irradiance/interpolate_irradiance_smith.js

@@ -1,3 +1,6 @@
+// const k = Math.sqrt( (2*0.1*0.1)/Math.PI);
+const k = 0.07978845608028655;
+
 /**
  * Using Smith inverse-square bounded approximation
  * @see "An Inexpensive BRDF Model for Physically-based Rendering" by Christophe Schlick
@@ -24,14 +27,11 @@ export function interpolate_irradiance_smith(distance, min, max) {
     where G is the fall-off
      */
 
-    // const k = Math.sqrt( (2*0.1*0.1)/Math.PI);
 
     const range = max - min;
 
     const v = (distance - min) / range;
 
-    const k = 0.07978845608028655;
-
     const fall_off = v / (v - k * v + k);
 
     return 1 - fall_off;

package/src/core/primitives/strings/insert_after.spec.d.ts

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

package/src/core/primitives/strings/insert_after.spec.d.ts.map

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

package/src/core/primitives/strings/insert_after.spec.js

@@ -0,0 +1,16 @@
+import { insert_after } from "./insert_after.js";
+
+test("basics", () => {
+
+    expect(insert_after("aba", "b", "c")).toBe("abca");
+    expect(insert_after("a", "a", "c")).toBe("ac");
+    expect(insert_after("ba", "a", "c")).toBe("bac");
+
+});
+
+test("non-occurrence", () => {
+
+    expect(insert_after("", "a", "c")).toBe("");
+    expect(insert_after("b", "a", "c")).toBe("b");
+
+});

package/src/core/primitives/strings/insert_before.spec.d.ts

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

package/src/core/primitives/strings/insert_before.spec.d.ts.map

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

package/src/core/primitives/strings/insert_before.spec.js

@@ -0,0 +1,16 @@
+import { insert_before } from "./insert_before.js";
+
+test("basics", () => {
+
+    expect(insert_before("aba", "b", "c")).toBe("acba");
+    expect(insert_before("a", "a", "c")).toBe("ca");
+    expect(insert_before("ba", "a", "c")).toBe("bca");
+
+});
+
+test("non-occurrence", () => {
+
+    expect(insert_before("", "a", "c")).toBe("");
+    expect(insert_before("b", "a", "c")).toBe("b");
+
+});

package/src/core/process/executor/ConcurrentExecutor.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"ConcurrentExecutor.d.ts","sourceRoot":"","sources":["../../../../../src/core/process/executor/ConcurrentExecutor.js"],"names":[],"mappings":";AAmBA;;GAEG;AACH;IAQI;;;;;OAKG;IACH,wBAJW,MAAM,aACN,MAAM,EAwChB;IApCG;;;OAGG;IACH,WAFU,MAAM,CAEU;IAC1B;;;OAGG;IACH,UAFU,MAAM,CAEQ;IAExB;;;OAGG;IACH,iBAFU,MAAM,CAES;IAEzB;;;OAGG;IACH,YAFU,MAAM,CAEI;IAEpB;;;;MAIC;IAED,cAAiB;IAEjB;;;OAGG;IACH,QAFU,MAAM,GAAC,gBAAgB,CAES;IAG9C;;;OAGG;IACH,qCAmEC;IAED;;;OAGG;IACH,oCAaC;IAED;;;;OAIG;IACH,wBAFY,OAAO,CAwBlB;IAED;;;OAGG;IACH,sBAGC;IAED;;;OAGG;IACH,eAFW,MAAM,QAMhB;IAED;;;;OAIG;IACH,kBAkCC;IAED;;OAEG;IACH,qBA8BC;IAED;;;OAGG;IACH,8BAUC;IA+KD;;;OAGG;IACH,aAQC;IAED,0BAMC;;CACJ;;;;mBAjfkB,+BAA+B;wBAqfxC,MAAM"}
+{"version":3,"file":"ConcurrentExecutor.d.ts","sourceRoot":"","sources":["../../../../../src/core/process/executor/ConcurrentExecutor.js"],"names":[],"mappings":";AAmBA;;GAEG;AACH;IAaI;;;;;OAKG;IACH,wBAJW,MAAM,aACN,MAAM,EAwChB;IApCG;;;OAGG;IACH,WAFU,MAAM,CAEU;IAC1B;;;OAGG;IACH,UAFU,MAAM,CAEQ;IAExB;;;OAGG;IACH,iBAFU,MAAM,CAES;IAEzB;;;OAGG;IACH,YAFU,MAAM,CAEI;IAEpB;;;;MAIC;IAED,cAAiB;IAEjB;;;OAGG;IACH,QAFU,MAAM,GAAC,gBAAgB,CAES;IAG9C;;;OAGG;IACH,qCAmEC;IAED;;;OAGG;IACH,oCAaC;IAED;;;;OAIG;IACH,wBAFY,OAAO,CAwBlB;IAED;;;OAGG;IACH,sBAGC;IAED;;;OAGG;IACH,eAFW,MAAM,QAMhB;IAED;;;;OAIG;IACH,kBAkCC;IAED;;OAEG;IACH,qBA8BC;IAED;;;;OAIG;IACH,sBAFa,OAAO,CAYnB;IA+KD;;;OAGG;IACH,aAQC;IAED,0BAMC;;CACJ;;;;mBAvfkB,+BAA+B;wBA2fxC,MAAM"}

package/src/core/process/executor/ConcurrentExecutor.js

@@ -13,7 +13,7 @@ import TaskState from "../task/TaskState.js";
  * @param {TaskGroup|Task} t
  * @returns {boolean}
  */
-function isGroup(t) {
+function isGroupTask(t) {
     return t.children instanceof Array;
 }
 
@@ -21,7 +21,12 @@ function isGroup(t) {
  * @class
  */
 class ConcurrentExecutor {
+    /**
+     * How many time-slice cycles have been executed this far. This is a monotonically increasing counter
+     * @type {number}
+     */
     #cycle_count = 0;
+
     /**
      * Handle of the last scheduled `setTimeout`
      * @type {number}
@@ -134,7 +139,7 @@ class ConcurrentExecutor {
                 const child = children[i];
                 child.on.completed.add(subTaskCompleted);
                 child.on.failed.add(subTaskFailed);
-                if (isGroup(child)) {
+                if (isGroupTask(child)) {
                     this.runGroup(child);
                 } else {
                     this.run(child);
@@ -157,7 +162,7 @@ class ConcurrentExecutor {
         for (let i = 0; i < n; i++) {
             const child = children[i];
 
-            if (isGroup(child)) {
+            if (isGroupTask(child)) {
                 this.removeGroup(child);
             } else {
                 this.removeTask(child);
@@ -255,7 +260,7 @@ class ConcurrentExecutor {
     }
 
     /**
-     * Go through unresolved queue and move tasks who's dependencies have been completed to ready queue or fail them
+     * Go through unresolved queue and move tasks whose dependencies have been completed to ready queue or fail them
      */
     resolveTasks() {
         const queueUnresolved = this.queueUnresolved;
@@ -292,6 +297,7 @@ class ConcurrentExecutor {
     /**
      *
      * @param {Task} task
+     * @returns {boolean}
      */
     contains(task) {
         if (this.queueUnresolved.indexOf(task) !== -1) {

package/src/core/time/current_time_in_seconds.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"current_time_in_seconds.d.ts","sourceRoot":"","sources":["../../../../src/core/time/current_time_in_seconds.js"],"names":[],"mappings":"AAIA;;;GAGG;AACH,2CAFa,MAAM,CAIlB"}
+{"version":3,"file":"current_time_in_seconds.d.ts","sourceRoot":"","sources":["../../../../src/core/time/current_time_in_seconds.js"],"names":[],"mappings":"AAGA;;;GAGG;AACH,2CAFa,MAAM,CAKlB"}

package/src/core/time/current_time_in_seconds.js

@@ -1,4 +1,3 @@
-
 //Use highest available resolution time source
 const source = typeof performance === "undefined" ? Date : performance;
 
@@ -7,5 +6,6 @@ const source = typeof performance === "undefined" ? Date : performance;
  * @returns {number}
  */
 export function current_time_in_seconds() {
+    // time source produces value in milliseconds, we need to scale to seconds
     return source.now() * 1e-3;
 }

package/src/engine/animation/curve/compute_curve_aabb.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"compute_curve_aabb.d.ts","sourceRoot":"","sources":["../../../../../src/engine/animation/curve/compute_curve_aabb.js"],"names":[],"mappings":"AAMA;;;;GAIG;AACH,4EAmCC"}
+{"version":3,"file":"compute_curve_aabb.d.ts","sourceRoot":"","sources":["../../../../../src/engine/animation/curve/compute_curve_aabb.js"],"names":[],"mappings":"AAMA;;;;GAIG;AACH,4EAsCC"}

package/src/engine/animation/curve/compute_curve_aabb.js

@@ -18,29 +18,32 @@ export function compute_curve_aabb(out, curve) {
     const keys = curve.keys;
     const key_count = keys.length;
 
-    let previous = keys[0];
-    x0 = x1 = previous.time;
-    y0 = y1 = previous.value;
+    if (key_count > 0) {
 
+        let previous = keys[0];
+        x0 = x1 = previous.time;
+        y0 = y1 = previous.value;
 
-    for (let i = 1; i < key_count; i++) {
-        const keyframe = keys[i];
+        for (let i = 1; i < key_count; i++) {
+            const keyframe = keys[i];
 
-        const time_delta = keyframe.time - previous.time;
+            const time_delta = keyframe.time - previous.time;
 
-        spline_hermite3_bounds(temp_bounds, 0, 1,
-            previous.value, keyframe.value,
-            previous.outTangent * time_delta,
-            keyframe.inTangent * time_delta
-        );
+            spline_hermite3_bounds(temp_bounds, 0, 1,
+                previous.value, keyframe.value,
+                previous.outTangent * time_delta,
+                keyframe.inTangent * time_delta
+            );
 
-        x0 = min2(x0, keyframe.time)
-        x1 = max2(x1, keyframe.time)
+            x0 = min2(x0, keyframe.time)
+            x1 = max2(x1, keyframe.time)
 
-        y0 = min2(y0, temp_bounds[0]);
-        y1 = max2(y1, temp_bounds[1]);
+            y0 = min2(y0, temp_bounds[0]);
+            y1 = max2(y1, temp_bounds[1]);
+
+            previous = keyframe;
+        }
 
-        previous = keyframe;
     }
 
     out.set(x0, y0, x1, y1);

package/src/engine/ecs/fow/FogOfWar.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"FogOfWar.d.ts","sourceRoot":"","sources":["../../../../../src/engine/ecs/fow/FogOfWar.js"],"names":[],"mappings":"AA+CA;;GAEG;AACH;IAEI;;;OAGG;IACH,oBAFU,OAAO,CAES;IAC1B;;;OAGG;IACH,0BAFU,OAAO,CAEgB;IAEjC;;;OAGG;IACH,SAFU,WAAW,GAAC,IAAI,CAEX;IAEf;;;OAGG;IACH,OAFU,OAAO,CAEM;IAEvB;;;OAGG;IACH,MAFU,OAAO,CAEQ;IAEzB,eAAsC;IAEtC;;;OAGG;IACH,UAFU,aAAa,CAE2B;IAElD;;MAEE;IAEF;;;OAGG;IACH,SAFU,SAAS,CAEgB;IAEnC;;;OAGG;IACH,iBAFU,SAAS,CAEwB;IAE3C;;;OAGG;IACH,sBAFW,MAAM,QAqDhB;IAED;;;;OAIG;IACH,eAHW,MAAM,KACN,MAAM,QAyBhB;IAED,cAOC;IAED,kBAOC;IAED,mBAEC;IAED;;;;;OAKG;IACH,UAJW,MAAM,KACN,MAAM,UACN,MAAM,QA+ChB;IAED;;;;;OAKG;IACH,WAJW,MAAM,KACN,MAAM,UACN,MAAM,QAgDhB;IAED,gBAIC;IAED,sBAqCC;IAED;;;OAGG;IACH,kBAFW,MAAM,QAYhB;IAED;;;OAGG;IACH,0DA+BC;IAED;;;;;OAKG;IACH,yBAJW,MAAM,KACN,MAAM,UACN,MAAM,EAAE,QAelB;IAED;;;;;OAKG;IACH,yEAFW,MAAM,WA+EhB;IAED;;;;;OAKG;IACH,qBAJW,MAAM,KACN,MAAM,GACJ,MAAM,CASlB;IAED,6BAKC;IAED,+BASC;IAED,uBAyBC;IAGD;;;;;OAKG;IACH,UAJW,MAAM,KACN,MAAM,oBAUhB;CACJ;;;;4BAplB2F,OAAO;oBAC/E,+BAA+B;oBAC/B,+BAA+B;oBAE/B,+BAA+B;8BAErB,iDAAiD;mBAD5D,uCAAuC;0BANhC,6CAA6C"}
+{"version":3,"file":"FogOfWar.d.ts","sourceRoot":"","sources":["../../../../../src/engine/ecs/fow/FogOfWar.js"],"names":[],"mappings":"AA+CA;;GAEG;AACH;IAEI;;;OAGG;IACH,oBAFU,OAAO,CAES;IAC1B;;;OAGG;IACH,0BAFU,OAAO,CAEgB;IAEjC;;;OAGG;IACH,SAFU,WAAW,GAAC,IAAI,CAEX;IAEf;;;OAGG;IACH,OAFU,OAAO,CAEM;IAEvB;;;OAGG;IACH,MAFU,OAAO,CAEQ;IAEzB,eAAsC;IAEtC;;;OAGG;IACH,UAFU,aAAa,CAE2B;IAElD;;MAEE;IAEF;;;OAGG;IACH,SAFU,SAAS,CAEgB;IAEnC;;;OAGG;IACH,iBAFU,SAAS,CAEwB;IAE3C;;;OAGG;IACH,sBAFW,MAAM,QAqDhB;IAED;;;;OAIG;IACH,eAHW,MAAM,KACN,MAAM,QAyBhB;IAED,cAOC;IAED,kBAOC;IAED,mBAEC;IAED;;;;;OAKG;IACH,UAJW,MAAM,KACN,MAAM,UACN,MAAM,QA+ChB;IAED;;;;;OAKG;IACH,WAJW,MAAM,KACN,MAAM,UACN,MAAM,QAgDhB;IAED,gBAIC;IAED,sBAqCC;IAED;;;OAGG;IACH,kBAFW,MAAM,QAYhB;IAED;;;OAGG;IACH,0DA+BC;IAED;;;;;OAKG;IACH,yBAJW,MAAM,KACN,MAAM,UACN,MAAM,EAAE,QAelB;IAED;;;;;OAKG;IACH,yEAFW,MAAM,WA+EhB;IAED;;;;;OAKG;IACH,qBAJW,MAAM,KACN,MAAM,GACJ,MAAM,CASlB;IAED,6BAKC;IAED,+BASC;IAED,uBAyBC;IAGD;;;;;OAKG;IACH,UAJW,MAAM,KACN,MAAM,oBAUhB;CACJ;;;;4BAxlB2F,OAAO;oBAM/E,+BAA+B;oBAC/B,+BAA+B;oBAC/B,+BAA+B;8BALrB,iDAAiD;mBAE5D,uCAAuC;0BAQhC,6CAA6C"}

package/src/engine/ecs/fow/FogOfWar.js

@@ -1,18 +1,18 @@
-import { clamp } from "../../../core/math/clamp.js";
-import { max2 } from "../../../core/math/max2.js";
-import { min2 } from "../../../core/math/min2.js";
-import { Sampler2D } from "../../graphics/texture/sampler/Sampler2D.js";
 import { ClampToEdgeWrapping, DataTexture, LinearFilter, RedFormat, UnsignedByteType } from "three";
-import Vector1 from "../../../core/geom/Vector1.js";
-import Vector2 from "../../../core/geom/Vector2.js";
 import { assert } from "../../../core/assert.js";
-import Vector4 from "../../../core/geom/Vector4.js";
-import Signal from "../../../core/events/signal/Signal.js";
+import { BinaryDataType } from "../../../core/binary/type/BinaryDataType.js";
 import { RowFirstTable } from "../../../core/collection/table/RowFirstTable.js";
 import { RowFirstTableSpec } from "../../../core/collection/table/RowFirstTableSpec.js";
-import { BinaryDataType } from "../../../core/binary/type/BinaryDataType.js";
-import { writeSample2DDataToDataTexture } from "../../graphics/texture/sampler/writeSampler2DDataToDataTexture.js";
+import Signal from "../../../core/events/signal/Signal.js";
+import Vector1 from "../../../core/geom/Vector1.js";
+import Vector2 from "../../../core/geom/Vector2.js";
+import Vector4 from "../../../core/geom/Vector4.js";
+import { clamp } from "../../../core/math/clamp.js";
+import { max2 } from "../../../core/math/max2.js";
+import { min2 } from "../../../core/math/min2.js";
 import { computeUnsignedDistanceField } from "../../graphics/texture/sampler/distance/computeUnsignedDistanceField.js";
+import { Sampler2D } from "../../graphics/texture/sampler/Sampler2D.js";
+import { writeSample2DDataToDataTexture } from "../../graphics/texture/sampler/writeSampler2DDataToDataTexture.js";
 
 const samplePosition = [];
 

package/src/engine/ecs/fow/FogOfWar.spec.js

@@ -1,14 +1,13 @@
 import { FogOfWar } from "./FogOfWar.js";
 
 test('getWorldClearance', () => {
-    const sut = new FogOfWar();
+    const fog = new FogOfWar();
 
-    sut.resize(1, 1, 2);
+    fog.resize(1, 1, 2);
 
+    expect(fog.getWorldClearance(1, 1)).toBe(255);
 
-    expect(sut.getWorldClearance(1, 1)).toBe(255);
+    fog.reveal(0, 0, 0.5);
 
-    sut.reveal(0, 0, 0.5);
-
-    expect(sut.getWorldClearance(1, 1)).toBe(0);
+    expect(fog.getWorldClearance(1, 1)).toBe(0);
 });

package/src/engine/google/loadGTAG.d.ts

@@ -0,0 +1,7 @@
+/**
+ * Google tracker initialization
+ * @param {string} id measurement ID
+ * @return {function} tracker function
+ */
+export function loadGTAG(id: string): Function;
+//# sourceMappingURL=loadGTAG.d.ts.map

package/src/engine/google/loadGTAG.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"loadGTAG.d.ts","sourceRoot":"","sources":["../../../../src/engine/google/loadGTAG.js"],"names":[],"mappings":"AAAA;;;;GAIG;AACH,6BAHW,MAAM,YA6BhB"}

package/src/engine/google/loadGTAG.js

@@ -0,0 +1,32 @@
+/**
+ * Google tracker initialization
+ * @param {string} id measurement ID
+ * @return {function} tracker function
+ */
+export function loadGTAG(id) {
+
+    (function (target, s, domTag, sourceURL) {
+
+        const a = s.createElement(domTag);
+        const m = s.getElementsByTagName(domTag)[0];
+
+        a.async = 1;
+        a.src = sourceURL;
+
+        m.parentNode.insertBefore(a, m)
+    })(document, document, 'script', `https://www.googletagmanager.com/gtag/js?id=${id}`);
+
+
+    window.dataLayer = window.dataLayer || [];
+
+    function gtag() {
+        dataLayer.push(arguments);
+    }
+
+    gtag('js', new Date());
+
+    gtag('config', id);
+
+
+    return gtag;
+}

package/src/engine/graphics/texture/sampler/distance/computeUnsignedDistanceField.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"computeUnsignedDistanceField.d.ts","sourceRoot":"","sources":["../../../../../../../src/engine/graphics/texture/sampler/distance/computeUnsignedDistanceField.js"],"names":[],"mappings":"AAEA;;;;GAIG;AACH,sGAFW,MAAM,QAIhB"}
+{"version":3,"file":"computeUnsignedDistanceField.d.ts","sourceRoot":"","sources":["../../../../../../../src/engine/graphics/texture/sampler/distance/computeUnsignedDistanceField.js"],"names":[],"mappings":"AAEA;;;;GAIG;AACH,sGAFW,MAAM,QAShB"}