@woosh/meep-engine 3.55.0 → 3.57.0

package/src/core/math/spline/spline3_hermite_nearest_point.d.ts

@@ -1,3 +1,19 @@
+/**
+ * Minimise ‖(curve_mono...)(t) − point[]‖² over t ∈ [0, 1], where the curve
+ * is `dim`-dimensional with monomial coefficients packed as
+ * `[α0_0, α1_0, α2_0, α3_0, α0_1, α1_1, ..., α3_{dim-1}]`.
+ *
+ * The squared distance is a degree-6 polynomial in t; its derivative is a
+ * quintic. We hand the quintic to the polynomial root finder, then test the
+ * roots plus the endpoints t = 0 and t = 1.
+ *
+ * @param {ArrayLike<number>} curve_mono
+ * @param {number} dim
+ * @param {ArrayLike<number>} point
+ * @param {number} point_offset
+ * @returns {number} parameter t ∈ [0, 1] of the closest point
+ */
+export function nearest_t_to_fixed_point(curve_mono: ArrayLike<number>, dim: number, point: ArrayLike<number>, point_offset: number): number;
 /**
  * Finds the parameter 't' of the nearest point on a 1D Hermite spline
  * function graph to a reference point. The curve is defined by (t, p(t)).

package/src/core/math/spline/spline3_hermite_nearest_point.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"spline3_hermite_nearest_point.d.ts","sourceRoot":"","sources":["../../../../../src/core/math/spline/spline3_hermite_nearest_point.js"],"names":[],"mappings":"AA6BA;;;;;;;;;;;;GAYG;AACH,qDARW,MAAM,SACN,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,GACJ,MAAM,CAgBlB;AAED;;;;;;;;;;;;;GAaG;AACH,yDARW,MAAM,EAAE,GAAC,YAAY,GAAC,YAAY,cAClC,MAAM,aACN,UAAU,MAAM,CAAC,oBACjB,MAAM,UACN,UAAU,MAAM,CAAC,iBACjB,MAAM,GACJ,IAAI,CAgGhB"}
+{"version":3,"file":"spline3_hermite_nearest_point.d.ts","sourceRoot":"","sources":["../../../../../src/core/math/spline/spline3_hermite_nearest_point.js"],"names":[],"mappings":"AAkBA;;;;;;;;;;;;;;GAcG;AACH,qDANW,UAAU,MAAM,CAAC,OACjB,MAAM,SACN,UAAU,MAAM,CAAC,gBACjB,MAAM,GACJ,MAAM,CA0ClB;AAED;;;;;;;;;;;;GAYG;AACH,qDARW,MAAM,SACN,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,MACN,MAAM,GACJ,MAAM,CAgBlB;AAED;;;;;;;;;;;;;GAaG;AACH,yDARW,MAAM,EAAE,GAAC,YAAY,GAAC,YAAY,cAClC,MAAM,aACN,UAAU,MAAM,CAAC,oBACjB,MAAM,UACN,UAAU,MAAM,CAAC,iBACjB,MAAM,GACJ,IAAI,CAiBhB"}

package/src/core/math/spline/spline3_hermite_nearest_point.js

@@ -1,167 +1,134 @@
-import { spline3_hermite } from "./spline3_hermite.js";
-
-/**
- * Helper to evaluate a polynomial given its coefficients.
- * @param {Float32Array} p - Polynomial coefficients [c0, c1, c2, ...]
- * @param {number} t - The value at which to evaluate.
- * @param {number} size
- * @returns {number}
- */
-function polyval(p, t, size) {
-    let result = 0;
-
-    for (let i = size - 1; i >= 0; i--) {
-        result = result * t + p[i];
-    }
-
-    return result;
-}
-
-const quintic_coeffs = new Float32Array(6);
-const quartic_coeffs = new Float32Array(5);
-
-const scalar_reference = new Float64Array(2);
-const scalar_spline = new Float64Array(4);
-const scalar_result = new Float64Array(1);
-
-const NEWTON_STEPS = 3;
-const START_ROOT_COUNT = 5;
-
-/**
- * Finds the parameter 't' of the nearest point on a 1D Hermite spline
- * function graph to a reference point. The curve is defined by (t, p(t)).
- * Scalar facade over {@link spline3_hermite_nearest_point_array}.
- *
- * @param {number} ref_t - The 't' coordinate of the reference point.
- * @param {number} ref_p - The 'p' coordinate of the reference point.
- * @param {number} p0 - The start value of the spline (at t=0).
- * @param {number} p1 - The end value of the spline (at t=1).
- * @param {number} m0 - The tangent at the start.
- * @param {number} m1 - The tangent at the end.
- * @returns {number} The parameter 't' of the nearest point. This value is always in [0..1] range
- */
-export function spline3_hermite_nearest_point(
-    ref_t, ref_p,
-    p0, p1, m0, m1
-) {
-    scalar_reference[0] = ref_t;
-    scalar_reference[1] = ref_p;
-    scalar_spline[0] = p0;
-    scalar_spline[1] = p1;
-    scalar_spline[2] = m0;
-    scalar_spline[3] = m1;
-
-    spline3_hermite_nearest_point_array(scalar_result, 0, scalar_reference, 0, scalar_spline, 0);
-
-    return scalar_result[0];
-}
-
-/**
- * Finds the nearest parameter on a 1D Hermite spline using packed inputs and
- * writes it into `out[out_offset]`. The reference is `[ref_t, ref_p]` and the
- * spline is `[p0, p1, m0, m1]`. All inputs are read before the output store,
- * so the destination may overlap either input.
- *
- * @param {number[]|Float32Array|Float64Array} out
- * @param {number} out_offset
- * @param {ArrayLike<number>} reference
- * @param {number} reference_offset
- * @param {ArrayLike<number>} spline
- * @param {number} spline_offset
- * @returns {void}
- */
-export function spline3_hermite_nearest_point_array(
-    out, out_offset,
-    reference, reference_offset,
-    spline, spline_offset
-) {
-    const ref_t = reference[reference_offset];
-    const ref_p = reference[reference_offset + 1];
-    const p0 = spline[spline_offset];
-    const p1 = spline[spline_offset + 1];
-    const m0 = spline[spline_offset + 2];
-    const m1 = spline[spline_offset + 3];
-
-    // 1. Calculate polynomial coefficients A, B, C for p(t)
-    const A = 2 * p0 - 2 * p1 + m0 + m1;
-    const B = -3 * p0 + 3 * p1 - 2 * m0 - m1;
-    const C = m0;
-    const D_minus_Rp = p0 - ref_p;
-
-    // 2. Form the quintic polynomial f(t) = c5*t^5 + ... + c0
-
-    quintic_coeffs[0] = (C * D_minus_Rp - ref_t)
-    quintic_coeffs[1] = (C * C + 2 * B * D_minus_Rp + 1)
-    quintic_coeffs[2] = (3 * B * C + 3 * A * D_minus_Rp)
-    quintic_coeffs[3] = (4 * A * C + 2 * B * B)
-    quintic_coeffs[4] = (5 * A * B)
-    quintic_coeffs[5] = (3 * A * A)
-
-    // Derivative of the quintic (a quartic) for Newton's method
-
-    quartic_coeffs[0] = quintic_coeffs[1]
-    quartic_coeffs[1] = 2 * quintic_coeffs[2]
-    quartic_coeffs[2] = 3 * quintic_coeffs[3]
-    quartic_coeffs[3] = 4 * quintic_coeffs[4]
-    quartic_coeffs[4] = 5 * quintic_coeffs[5]
-
-
-    // 3. Initialize by checking the endpoints t=0 and t=1
-    let best_t = 0;
-    let dt = 0 - ref_t;
-    let dp = p0 - ref_p;
-    let min_dist_sq = dt * dt + dp * dp;
-
-    dt = 1 - ref_t;
-    dp = p1 - ref_p;
-    const dist_sq_at_1 = dt * dt + dp * dp;
-    if (dist_sq_at_1 < min_dist_sq) {
-        min_dist_sq = dist_sq_at_1;
-        best_t = 1;
-    }
-
-    // 4. Find roots and check them on the fly
-    const tolerance = 1e-7;
-
-
-    // Start Newton's method from several points to find multiple roots
-    for (let i = 0; i <= START_ROOT_COUNT; i++) {
-        let t = i / START_ROOT_COUNT; // Starting guess for the root
-
-        for (let j = NEWTON_STEPS; j > 0; j--) {
-
-            const f_t = polyval(quintic_coeffs, t, 6);
-
-            // derivative of the polynomial we are finding the root of
-            const fp_t = polyval(quartic_coeffs, t, 5);
-
-            if (Math.abs(fp_t) < tolerance) {
-                break;
-            }
-
-            const t_new = t - f_t / fp_t;
-
-            if (Math.abs(t_new - t) < tolerance) {
-                break;
-            }
-
-            t = t_new;
-        }
-
-        // Check if the found root is valid and yields a better distance
-        if (t > 0 && t < 1) {
-            // Endpoints already checked
-            const p = spline3_hermite(t, p0, p1, m0, m1);
-            const current_dt = t - ref_t;
-            const current_dp = p - ref_p;
-            const dist_sq = current_dt * current_dt + current_dp * current_dp;
-
-            if (dist_sq < min_dist_sq) {
-                min_dist_sq = dist_sq;
-                best_t = t;
-            }
-        }
-    }
-
-    out[out_offset] = best_t;
-}
+import { cubic_residual_times_derivative_accumulate } from "../linalg/cubic_residual_times_derivative_accumulate.js";
+import { polynomial_cubic_horner_eval } from "../linalg/polynomial_cubic_horner_eval.js";
+import { polynomial_real_roots_in_interval } from "../linalg/polynomial_real_roots_in_interval.js";
+import { spline3_hermite_to_monomial } from "./spline3_hermite_to_monomial.js";
+
+const EDGE_QUINTIC_LEN = 6;
+const _edge_quintic = new Float64Array(EDGE_QUINTIC_LEN);
+const _edge_roots = new Float64Array(5);
+
+// 2D curve (t, p(t)) in monomial basis: axis 0 is 0 + 1*t + 0*t^2 + 0*t^3.
+const _graph_mono = new Float64Array(8);
+_graph_mono[1] = 1;
+const _graph_point = new Float64Array(2);
+
+const scalar_reference = new Float64Array(2);
+const scalar_spline = new Float64Array(4);
+const scalar_result = new Float64Array(1);
+
+/**
+ * Minimise ‖(curve_mono...)(t) − point[]‖² over t ∈ [0, 1], where the curve
+ * is `dim`-dimensional with monomial coefficients packed as
+ * `[α0_0, α1_0, α2_0, α3_0, α0_1, α1_1, ..., α3_{dim-1}]`.
+ *
+ * The squared distance is a degree-6 polynomial in t; its derivative is a
+ * quintic. We hand the quintic to the polynomial root finder, then test the
+ * roots plus the endpoints t = 0 and t = 1.
+ *
+ * @param {ArrayLike<number>} curve_mono
+ * @param {number} dim
+ * @param {ArrayLike<number>} point
+ * @param {number} point_offset
+ * @returns {number} parameter t ∈ [0, 1] of the closest point
+ */
+export function nearest_t_to_fixed_point(curve_mono, dim, point, point_offset) {
+    for (let i = 0; i < EDGE_QUINTIC_LEN; i++) {
+        _edge_quintic[i] = 0;
+    }
+
+    for (let d = 0; d < dim; d++) {
+        cubic_residual_times_derivative_accumulate(
+            _edge_quintic, curve_mono, 4 * d, point[point_offset + d]
+        );
+    }
+
+    // Aberth iteration cap of 32 is plenty for the degree-5 quintic that
+    // comes out of `(p(t) - offset)·p'(t)` on a smooth Hermite cubic — the
+    // routine's own convergence check still fires early in the common case.
+    const root_count = polynomial_real_roots_in_interval(
+        _edge_quintic, 5, 0, 1, _edge_roots, 0,
+        32
+    );
+
+    let best_t = 0;
+    let best_d2 = Number.POSITIVE_INFINITY;
+
+    for (let i = -2; i < root_count; i++) {
+        const t = i === -2 ? 0 : (i === -1 ? 1 : _edge_roots[i]);
+        let d2 = 0;
+
+        for (let d = 0; d < dim; d++) {
+            const base = 4 * d;
+            const v = polynomial_cubic_horner_eval(curve_mono, base, t);
+            const dv = v - point[point_offset + d];
+            d2 += dv * dv;
+        }
+
+        if (d2 < best_d2) {
+            best_d2 = d2;
+            best_t = t;
+        }
+    }
+
+    return best_t;
+}
+
+/**
+ * Finds the parameter 't' of the nearest point on a 1D Hermite spline
+ * function graph to a reference point. The curve is defined by (t, p(t)).
+ * Scalar facade over {@link spline3_hermite_nearest_point_array}.
+ *
+ * @param {number} ref_t - The 't' coordinate of the reference point.
+ * @param {number} ref_p - The 'p' coordinate of the reference point.
+ * @param {number} p0 - The start value of the spline (at t=0).
+ * @param {number} p1 - The end value of the spline (at t=1).
+ * @param {number} m0 - The tangent at the start.
+ * @param {number} m1 - The tangent at the end.
+ * @returns {number} The parameter 't' of the nearest point. This value is always in [0..1] range
+ */
+export function spline3_hermite_nearest_point(
+    ref_t, ref_p,
+    p0, p1, m0, m1
+) {
+    scalar_reference[0] = ref_t;
+    scalar_reference[1] = ref_p;
+    scalar_spline[0] = p0;
+    scalar_spline[1] = p1;
+    scalar_spline[2] = m0;
+    scalar_spline[3] = m1;
+
+    spline3_hermite_nearest_point_array(scalar_result, 0, scalar_reference, 0, scalar_spline, 0);
+
+    return scalar_result[0];
+}
+
+/**
+ * Finds the nearest parameter on a 1D Hermite spline using packed inputs and
+ * writes it into `out[out_offset]`. The reference is `[ref_t, ref_p]` and the
+ * spline is `[p0, p1, m0, m1]`. All inputs are read before the output store,
+ * so the destination may overlap either input.
+ *
+ * @param {number[]|Float32Array|Float64Array} out
+ * @param {number} out_offset
+ * @param {ArrayLike<number>} reference
+ * @param {number} reference_offset
+ * @param {ArrayLike<number>} spline
+ * @param {number} spline_offset
+ * @returns {void}
+ */
+export function spline3_hermite_nearest_point_array(
+    out, out_offset,
+    reference, reference_offset,
+    spline, spline_offset
+) {
+    _graph_point[0] = reference[reference_offset];
+    _graph_point[1] = reference[reference_offset + 1];
+    const p0 = spline[spline_offset];
+    const p1 = spline[spline_offset + 1];
+    const m0 = spline[spline_offset + 2];
+    const m1 = spline[spline_offset + 3];
+
+    spline3_hermite_to_monomial(_graph_mono, 4, 1, p0, p1, m0, m1);
+
+    out[out_offset] = nearest_t_to_fixed_point(_graph_mono, 2, _graph_point, 0);
+}

package/src/core/model/DebouncedObservedBoolean.d.ts

@@ -17,7 +17,7 @@ export class DebouncedObservedBoolean extends ObservedBoolean {
     constructor(source: ObservedBoolean, time: number, mode?: DebouncedObservedBooleanMode | number);
     __source: ObservedBoolean;
     time: number;
-    __timeout_ms: any;
+    __timeout: number;
     mode: number;
     link(): void;
     unlink(): void;
@@ -26,7 +26,6 @@ export class DebouncedObservedBoolean extends ObservedBoolean {
      * @private
      */
     private __clearTimeout;
-    __timeout: number;
     /**
      *
      */

package/src/core/model/DebouncedObservedBoolean.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"DebouncedObservedBoolean.d.ts","sourceRoot":"","sources":["../../../../src/core/model/DebouncedObservedBoolean.js"],"names":[],"mappings":"2CAYU,MAAM;;;;;;AAQhB;;GAEG;AACH;IACI;;;;;OAKG;IACH,oBAJW,eAAe,QACf,MAAM,SACN,4BAA4B,GAAC,MAAM,EAY7C;IAPG,0BAAsB;IAEtB,aAAgB;IAEhB,kBAAwB;IAExB,aAAgB;IAGpB,aAGC;IAED,eAGC;IAGD;;;OAGG;IACH,uBAKC;IAFO,kBAAqB;IAI7B;;OAEG;IACH,0BAOC;IAED;;;OAGG;IACH,OAFW,OAAO,QAYjB;IAED;;;;;OAKG;IACH,6BAYC;CAMJ;4BAhH2B,sBAAsB"}
+{"version":3,"file":"DebouncedObservedBoolean.d.ts","sourceRoot":"","sources":["../../../../src/core/model/DebouncedObservedBoolean.js"],"names":[],"mappings":"2CAYU,MAAM;;;;;;AAQhB;;GAEG;AACH;IACI;;;;;OAKG;IACH,oBAJW,eAAe,QACf,MAAM,SACN,4BAA4B,GAAC,MAAM,EAY7C;IAPG,0BAAsB;IAEtB,aAAgB;IAEhB,kBAAqB;IAErB,aAAgB;IAGpB,aAGC;IAED,eAGC;IAGD;;;OAGG;IACH,uBAKC;IAED;;OAEG;IACH,0BAOC;IAED;;;OAGG;IACH,OAFW,OAAO,QAYjB;IAED;;;;;OAKG;IACH,6BAYC;CAMJ;4BAhH2B,sBAAsB"}

package/src/core/model/DebouncedObservedBoolean.js

@@ -35,7 +35,7 @@ export class DebouncedObservedBoolean extends ObservedBoolean {
 
         this.time = time;
 
-        this.__timeout_ms = null;
+        this.__timeout = null;
 
         this.mode = mode;
     }

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":"AAoBA;;;;GAIG;AACH;IAEI;;;;OAIG;IACH,aAFU,MAAM,CAEE;IAElB;;;OAGG;IACH,aAFU,eAAe,CAEN;IAEnB;;;OAGG;IACH,WAFU,yBAAyB,EAAE,CAEtB;IAEf;;;OAGG;IACH,gBAAgB;IAEhB;;;OAGG;IACH,qBAAmB;IAEnB;;;OAGG;IACH,sBAFU,KAAK,UAAU,CAAC,CAED;IAEzB;;;;;;OAMG;IACH,wBAFU,IAAI,EAAE,CAEE;IAElB;;OAEG;IACH;QACI;;;WAGG;;QAEH;;;WAGG;;QAEH;;;WAGG;;QAGH;;;;WAIG;;MAEL;IAEF;;;;;;OAMG;IACH,8BALW,MAAM,aACN,aAAa,UACb,UAAU,EAAE,GACV,MAAM,CAsBlB;IAED;;;OAGG;IACH,gDAEC;IAED;;;OAGG;IACH,+CAEC;IAGD;;;OAGG;IACH,8DAEC;IAED;;;;OAIG;IACH,6DAEC;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,iBAHW,MAAM,GACJ,OAAO,CAInB;IAED;;;;OAIG;IACH,oBAHW,MAAM,GACJ,OAAO,CAkBnB;IAED;;;OAGG;IACH,uCAQC;IAED,wBAIC;IAED;;;OAGG;IACH,4BAFW,eAAe,QAsCzB;IAED;;;;OAIG;IACH,qBAHW,MAAM,GACJ,yBAAyB,GAAC,SAAS,CAoB/C;IAED;;;;OAIG;IACH,6BAHW,MAAM,GACJ,SAAS,GAAC,yBAAyB,CAmB/C;IAED;;;OAGG;IACH,QAFY,MAAM,CAIjB;IAED;;;;OAIG;IACH,cAHW,YAAY,GACV,OAAO,CAQnB;IAED,mBAYC;IAIL;;;OAGG;IACH,yBAFU,OAAO,CAEoB;CAPpC;yBAhZY,OAAO,kBAAkB,EAAE,UAAU;8BACrC,OAAO,sBAAsB,EAAE,eAAe;mBAC9C,OAAO,WAAW,EAAE,IAAI;0CANK,gCAAgC;iBAHzD,kCAAkC;8BAIrB,oBAAoB"}
+{"version":3,"file":"NodeInstance.d.ts","sourceRoot":"","sources":["../../../../../../src/core/model/node-graph/node/NodeInstance.js"],"names":[],"mappings":"AAqBA;;;;GAIG;AACH;IAEI;;;;OAIG;IACH,aAFU,MAAM,CAEE;IAElB;;;OAGG;IACH,aAFU,eAAe,CAEN;IAEnB;;;OAGG;IACH,WAFU,yBAAyB,EAAE,CAEtB;IAEf;;;OAGG;IACH,gBAAgB;IAEhB;;;OAGG;IACH,qBAAmB;IAEnB;;;OAGG;IACH,sBAFU,KAAK,UAAU,CAAC,CAED;IAEzB;;;;;;OAMG;IACH,wBAFU,IAAI,EAAE,CAEE;IAElB;;OAEG;IACH;QACI;;;WAGG;;QAEH;;;WAGG;;QAEH;;;WAGG;;QAGH;;;;WAIG;;MAEL;IAEF;;;;;;OAMG;IACH,8BALW,MAAM,aACN,aAAa,UACb,UAAU,EAAE,GACV,MAAM,CAsBlB;IAED;;;OAGG;IACH,gDAEC;IAED;;;OAGG;IACH,+CAEC;IAGD;;;OAGG;IACH,8DAEC;IAED;;;;OAIG;IACH,6DAEC;IAED;;;;OAIG;IACH,mBAHW,MAAM,oBAKhB;IAED;;;;OAIG;IACH,mBAHW,MAAM,OAKhB;IAED;;;;OAIG;IACH,yBAHW,MAAM,KAOhB;IAED;;;;OAIG;IACH,2BAHW,MAAM,oBA6BhB;IAED;;;;OAIG;IACH,iBAHW,MAAM,GACJ,OAAO,CAInB;IAED;;;;OAIG;IACH,oBAHW,MAAM,GACJ,OAAO,CAkBnB;IAED;;;OAGG;IACH,uCAQC;IAED,wBAIC;IAED;;;OAGG;IACH,4BAFW,eAAe,QAsCzB;IAED;;;;OAIG;IACH,qBAHW,MAAM,GACJ,yBAAyB,GAAC,SAAS,CAoB/C;IAED;;;;OAIG;IACH,6BAHW,MAAM,GACJ,SAAS,GAAC,yBAAyB,CAmB/C;IAED;;;OAGG;IACH,QAFY,MAAM,CAIjB;IAED;;;;OAIG;IACH,cAHW,YAAY,GACV,OAAO,CAQnB;IAED,mBAYC;IAIL;;;OAGG;IACH,yBAFU,OAAO,CAEoB;CAPpC;yBA1YY,OAAO,kBAAkB,EAAE,UAAU;8BACrC,OAAO,sBAAsB,EAAE,eAAe;mBAC9C,OAAO,WAAW,EAAE,IAAI;0CANK,gCAAgC;iBAJzD,kCAAkC;8BAKrB,oBAAoB"}

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

@@ -2,6 +2,7 @@ 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 { objectsEqual } from "../../../function/objectsEqual.js";
 import { objectDeepEquals } from "../../object/objectDeepEquals.js";
 import { NodeInstancePortReference } from "./NodeInstancePortReference.js";
 import { PortDirection } from "./PortDirection.js";
@@ -216,13 +217,7 @@ export class NodeInstance {
         }
 
         // perform .equals check if available
-        if (
-            value !== undefined
-            && old_value !== undefined
-            && typeof value === "object"
-            && typeof value.equals === "function"
-            && value.equals(old_value)
-        ) {
+        if (objectsEqual(value, old_value)) {
             // parameter value has not changed
             return;
         }

package/src/core/model/node-graph/node/parameter/NodeParameterDescription.js

@@ -66,7 +66,7 @@ export class NodeParameterDescription {
                 break;
             default:
 
-                problemConsumer(`Unexpected data type '${type}'`);
+                problemConsumer(`Unexpected data type '${this.type}'`);
                 result = false;
         }
 

package/src/core/model/object/optional_equality.d.ts

@@ -1,10 +1,10 @@
 /**
+ * @deprecated Use {@link objectsEqual} directly instead.
  * @template {{equals(T):boolean}} T
  * @param {undefined|null|T} a
  * @param {undefined|null|T} b
  * @return {boolean}
  */
-export function optional_equality<T extends {
-    equals(T: any): boolean;
-}>(a: T, b: T): boolean;
+export const optional_equality: typeof objectsEqual;
+import { objectsEqual } from "../../function/objectsEqual.js";
 //# sourceMappingURL=optional_equality.d.ts.map

package/src/core/model/object/optional_equality.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"optional_equality.d.ts","sourceRoot":"","sources":["../../../../../src/core/model/object/optional_equality.js"],"names":[],"mappings":"AAAA;;;;;GAKG;AACH;oBALyB,OAAO;gBAGpB,OAAO,CAsBlB"}
+{"version":3,"file":"optional_equality.d.ts","sourceRoot":"","sources":["../../../../../src/core/model/object/optional_equality.js"],"names":[],"mappings":"AAEA;;;;;;GAMG;AACH,oDAA8C;6BATjB,gCAAgC"}

package/src/core/model/object/optional_equality.js

@@ -1,27 +1,10 @@
-/**
- * @template {{equals(T):boolean}} T
- * @param {undefined|null|T} a
- * @param {undefined|null|T} b
- * @return {boolean}
- */
-export function optional_equality(a, b) {
-    if (a === b) {
-        return true;
-    }
-
-    if (a === undefined || b === undefined) {
-        // we know that a!==b
-        return false;
-    }
-
-    if (a === null || b === null) {
-        // we know that a!==b
-        return false;
-    }
-
-    if (typeof a !== typeof b) {
-        return false;
-    }
-
-    return a.equals(b);
-}
+import { objectsEqual } from "../../function/objectsEqual.js";
+
+/**
+ * @deprecated Use {@link objectsEqual} directly instead.
+ * @template {{equals(T):boolean}} T
+ * @param {undefined|null|T} a
+ * @param {undefined|null|T} b
+ * @return {boolean}
+ */
+export const optional_equality = objectsEqual;

package/src/core/model/object/write_property.js

@@ -14,7 +14,7 @@ export function write_property(root, parts, part_offset, part_count, value) {
     const last_index = part_offset + part_count - 1;
 
     // resolve parent of the property
-    const thing = read_property(root, parts, 0, last_index, true);
+    const thing = read_property(root, parts, part_offset, part_count - 1, true);
 
     const last_part = parts[last_index];
 

package/src/core/model/reactive/evaluation/MultiPredicateEvaluator.js

@@ -66,13 +66,13 @@ class ExpressionNode {
         let result = 0;
 
         if (n === 0) {
-            return scoringFunction(this.expression);
+            result = scoringFunction(this.expression);
         } else {
 
             for (let i = 0; i < n; i++) {
                 const parent = this.parents[i];
 
-                result = max2(parent.computeMaxParentScore(scoringFunction));
+                result = max2(result, parent.computeMaxParentScore(scoringFunction));
             }
         }
 

package/src/core/primitives/strings/string_compute_byte_size.d.ts

@@ -1,7 +1,7 @@
 /**
  * Compute byte size of a UTF8 string
- * @param {string} value
- * @returns {number}
+ * @deprecated Use {@link utf8_encoded_length} instead
+ * @type {(value: string) => number}
  */
-export function string_compute_byte_size(value: string): number;
+export const string_compute_byte_size: (value: string) => number;
 //# sourceMappingURL=string_compute_byte_size.d.ts.map

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

@@ -1 +1 @@
-{"version":3,"file":"string_compute_byte_size.d.ts","sourceRoot":"","sources":["../../../../../src/core/primitives/strings/string_compute_byte_size.js"],"names":[],"mappings":"AAAA;;;;GAIG;AACH,gDAHW,MAAM,GACJ,MAAM,CAiBlB"}
+{"version":3,"file":"string_compute_byte_size.d.ts","sourceRoot":"","sources":["../../../../../src/core/primitives/strings/string_compute_byte_size.js"],"names":[],"mappings":"AAEA;;;;GAIG;AACH,uCAFU,CAAC,KAAK,EAAE,MAAM,KAAK,MAAM,CAEyB"}

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

@@ -1,21 +1,8 @@
-/**
- * Compute byte size of a UTF8 string
- * @param {string} value
- * @returns {number}
- */
-export function string_compute_byte_size(value) {
-    const length = value.length;
-
-    let p = 0;
-
-    for (let i = 0; i < length; i++) {
-        let c = value.charCodeAt(i);
-        while (c > 0xff) {
-            p++;
-            c >>= 8;
-        }
-        p++;
-    }
-
-    return p;
-}
+import { utf8_encoded_length } from "../../binary/utf8/utf8_encoded_length.js";
+
+/**
+ * Compute byte size of a UTF8 string
+ * @deprecated Use {@link utf8_encoded_length} instead
+ * @type {(value: string) => number}
+ */
+export const string_compute_byte_size = utf8_encoded_length;

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":";mBASa,OAAO,iBAAiB,EAAE,IAAI;wBAC9B,OAAO,sBAAsB,EAAE,OAAO;AAYnD;;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,IAAI,EAAE,CAES;IAEzB;;;OAGG;IACH,YAFU,IAAI,EAAE,CAEI;IAEpB;;;;MAIC;IAED,cAAiB;IAEjB;;;OAGG;IACH,QAFU,MAAM,GAAC,gBAAgB,CAES;IAG9C;;;OAGG;IACH,oBAFW,SAAS,QAqEnB;IAED;;;OAGG;IACH,mBAFW,SAAS,QAmBnB;IAED;;;;OAIG;IACH,iBAHW,IAAI,GACH,OAAO,CA6BlB;IA6BD;;;OAGG;IACH,UAFW,IAAI,QAKd;IAED;;;OAGG;IACH,eAFW,IAAI,EAAE,QAMhB;IAED;;;;OAIG;IACH,kBAkCC;IAED;;OAEG;IACH,qBAgDC;IAED;;;;OAIG;IACH,eAHW,IAAI,GACF,OAAO,CAYnB;IA8QD,aAYC;IAED,0BAMC;;CACJ;;;;mBAlpBkB,+BAA+B;wBAspBxC,MAAM"}
+{"version":3,"file":"ConcurrentExecutor.d.ts","sourceRoot":"","sources":["../../../../../src/core/process/executor/ConcurrentExecutor.js"],"names":[],"mappings":";mBASa,OAAO,iBAAiB,EAAE,IAAI;wBAC9B,OAAO,sBAAsB,EAAE,OAAO;AAYnD;;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,IAAI,EAAE,CAES;IAEzB;;;OAGG;IACH,YAFU,IAAI,EAAE,CAEI;IAEpB;;;;MAIC;IAED,cAAiB;IAEjB;;;OAGG;IACH,QAFU,MAAM,GAAC,gBAAgB,CAES;IAG9C;;;OAGG;IACH,oBAFW,SAAS,QAgFnB;IAED;;;OAGG;IACH,mBAFW,SAAS,QAmBnB;IAED;;;;OAIG;IACH,iBAHW,IAAI,GACH,OAAO,CA6BlB;IA6BD;;;OAGG;IACH,UAFW,IAAI,QAKd;IAED;;;OAGG;IACH,eAFW,IAAI,EAAE,QAMhB;IAED;;;;OAIG;IACH,kBAkCC;IAED;;OAEG;IACH,qBAgDC;IAED;;;;OAIG;IACH,eAHW,IAAI,GACF,OAAO,CAYnB;IA8QD,aAYC;IAED,0BAMC;;CACJ;;;;mBA7pBkB,+BAA+B;wBAiqBxC,MAAM"}

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

@@ -131,7 +131,17 @@ class ConcurrentExecutor {
         }
 
         function subTaskFailed(reason) {
-            signalFailure(reason);
+            signalFailure(reason);
+        }
+
+        function subTaskCancelled() {
+            if (!resolved) {
+                resolved = true;
+
+                self.#cancel(taskGroup);
+
+                self.prod();
+            }
         }
 
 
@@ -141,7 +151,8 @@ class ConcurrentExecutor {
             for (; i < numChildren; i++) {
                 const child = children[i];
                 child.on.completed.add(subTaskCompleted);
-                child.on.failed.add(subTaskFailed);
+                child.on.failed.add(subTaskFailed);
+                child.on.cancelled.add(subTaskCancelled);
                 if (isGroupTask(child)) {
                     this.runGroup(child);
                 } else {
@@ -699,6 +710,7 @@ function tryResolve(unresolvedTask) {
             default:
                 console.error("Unknown dependency task state", dependency.state, "dependency:", dependency, "dependant:", unresolvedTask, "Failing the task.");
             //intended fallthrough
+            case TaskState.CANCELLED:
             case TaskState.FAILED:
                 //fail dependant task
                 return ResolutionType.FAILED;

package/src/engine/achievements/gateway/StorageAchievementGateway.d.ts

@@ -5,11 +5,14 @@ export class StorageAchievementGateway extends AchievementGateway {
      * @param {String} [key]
      */
     constructor(storage: Storage, key?: string);
-    last: Promise<void>;
     storage: Storage;
     key: string;
-    getUnlocked(): Promise<any>;
-    unlock(id: any): Promise<void>;
+    /**
+     * @private
+     * @type {StorageBackedSet<string>}
+     */
+    private set;
+    unlock(id: any): Promise<any>;
 }
 import { AchievementGateway } from "../AchievementGateway.js";
 //# sourceMappingURL=StorageAchievementGateway.d.ts.map

package/src/engine/achievements/gateway/StorageAchievementGateway.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"StorageAchievementGateway.d.ts","sourceRoot":"","sources":["../../../../../src/engine/achievements/gateway/StorageAchievementGateway.js"],"names":[],"mappings":"AAGA;IAGI;;;;OAIG;IACH,qBAHW,OAAO,gBASjB;IAbD,oBAAyB;IAUrB,iBAAsB;IAEtB,YAAc;IAGlB,4BAiBC;IAED,+BAmCC;CACJ;mCAzEkC,0BAA0B"}
+{"version":3,"file":"StorageAchievementGateway.d.ts","sourceRoot":"","sources":["../../../../../src/engine/achievements/gateway/StorageAchievementGateway.js"],"names":[],"mappings":"AAGA;IACI;;;;OAIG;IACH,qBAHW,OAAO,gBAejB;IATG,iBAAsB;IAEtB,YAAc;IAEd;;;OAGG;IACH,YAA6C;IAOjD,8BAEC;CACJ;mCA7BkC,0BAA0B"}