@photivra/engine 2.4.1 → 2.6.0

package/dist/core/portable-math.js

@@ -53,4 +53,346 @@ export function equalWithinUlps(a, b, maximumUlps) {
         return true;
     return Math.abs(a - b) <= maximumUlps * Number.EPSILON * Math.max(Math.abs(a), Math.abs(b));
 }
+// ---------------------------------------------------------------------------------------------------------------
+// Portable logarithm, exponential, power, cube root and cosine/sine of 2πu.
+//
+// Each function below is a fixed sequence of correctly rounded binary64 operations (+, −, ×, ÷, exact
+// power-of-two scaling through the IEEE 754 bit pattern, Math.round/Math.floor and integer operations), with
+// every constant written as a decimal literal of at most 17 significant digits (ECMAScript converts these
+// exactly to the nearest double). The bits of every result are therefore the same in every conforming
+// JavaScript engine, unlike Math.pow, Math.exp, Math.log, Math.cbrt and Math.cos, which ECMA-262 leaves
+// "implementation-approximated" (docs/NUMERICAL_CORRECTNESS.md, "Cross-engine determinism").
+//
+// Methods (textbook; no code copied):
+// - Error-free transformations (double-double arithmetic): TwoSum (Knuth, The Art of Computer Programming
+//   vol. 2, §4.2.2), FastTwoSum and TwoProduct with Veltkamp's splitting (Dekker, "A floating-point technique
+//   for extending the available precision", Numerische Mathematik 18, 1971). Exact barring overflow and
+//   underflow, which the arguments here cannot reach.
+// - log2(x): x = m·2^e with m in [√½, √2); ln m = 2·atanh(s) = 2(s + s³/3 + s⁵/5 + …), s = (m − 1)/(m + 1),
+//   |s| ≤ 0.1716 (J.-M. Muller, Elementary Functions: Algorithms and Implementation, 3rd ed., 2016, ch. 11).
+//   s carries a double-double correction; the series runs to s²³ (truncation below 2^-62 relative).
+// - 2^t: t = n + r with n = round(t), |r| ≤ ½; 2^r = e^(r·ln 2) by its Taylor series to degree 14 (truncation
+//   below 2^-57 relative), then an exact scaling by 2^n (Muller, ch. 11, "additive range reduction").
+// - x^y = 2^(y·log2 x) with log2 x and y·log2 x carried as double-double; e^x = 2^(x·log2 e) and
+//   ∛x = 2^(log2 x / 3) likewise; ln x = log2 x · ln 2; e^x − 1 by its Taylor series for |x| < 1.
+// - cos(2πu), sin(2πu): u = q/4 + r with q = round(4u) and |r| ≤ ⅛ (exact), then the Taylor series of cos and
+//   sin of 2πr to degrees 18 and 19 (truncation below 2^-66).
+//
+// Error bounds (from the operation counts above): portableExp2, portableExp, portableLog, portableLog2 and
+// portableCbrt within 1 ulp; portableExpm1 within 2 ulps; portablePow within 1 ulp for |y| ≤ 4 (the double-double
+// logarithm has relative error below 2^-56, so the error of y·log2 x adds at most |y|·2^-57·ln 2 relative);
+// portableCosTwoPi and portableSinTwoPi within 2 ulps. Checked against 60-digit decimal references (Python decimal)
+// on 2·10⁵ pseudo-random arguments per function (6·10⁵ for portableLog; |y| ≤ 4 and y = 1/2.4, 1.4 for portablePow):
+// largest errors 0.53 ulp (log, log2), 0.86 (exp2), 0.94 (exp, cbrt, pow), 0.97 (pow with y = 1/2.4), 1.59 (cos,
+// sin of 2πu) and 1.66 (e^x − 1); spot values are in test/portable-math.test.ts. These are accuracy bounds;
+// determinism does not depend on them.
+/** Bit access to a double: the high 32-bit word is at index HIGH of the view (detected once, so either byte order works). */
+// The tables and constants below are built by expressions marked pure (/* @__PURE__ */), so a bundler drops them from a
+// bundle that uses none of the functions that read them (a capture-only bundle keeps only portableHypot and equalWithinUlps).
+const BITS = /* @__PURE__ */ new Float64Array(1), WORDS = /* @__PURE__ */ (() => new Uint32Array(BITS.buffer))();
+const HIGH = /* @__PURE__ */ (() => (new Uint8Array(new Uint16Array([1]).buffer)[0] === 1 ? 1 : 0))(), LOW = 1 - HIGH;
+/** 2^k for every integer k in [−1074, 1023] at POW2[k + 1074], built by exact halving and doubling. */
+const POW2 = /* @__PURE__ */ (() => {
+    const table = new Float64Array(2098);
+    table[1074] = 1;
+    for (let k = 1; k <= 1023; k++)
+        table[1074 + k] = table[1073 + k] * 2;
+    for (let k = 1; k <= 1074; k++)
+        table[1074 - k] = table[1075 - k] / 2;
+    return table;
+})();
+/** v·2^k for an integer k in [−1100, 1100]: one exact multiplication (a single rounding only when the result is subnormal). */
+function scaleByPowerOfTwo(v, k) {
+    if (k > 1023)
+        return v * POW2[2097] * POW2[1074 + k - 1023];
+    if (k < -1074)
+        return v * POW2[1074 + k + 1074] * POW2[0]; // exact first factor (v·2^(k+1074) is normal), one rounding
+    return v * POW2[1074 + k];
+}
+// Double-double arithmetic, written out inline below (local variables only, which keeps it fast):
+// - FastTwoSum (|a| ≥ |b| or a = 0): s = a + b, err = b − (s − a), so a + b = s + err exactly;
+// - TwoSum (any a, b): s = a + b, b' = s − a, err = (a − (s − b')) + (b − b');
+// - TwoProduct: p = a·b, err = ((ah·bh − p) + ah·bl + al·bh) + al·bl, with Veltkamp's split
+//   ah = c − (c − a), al = a − ah, c = (2^27 + 1)·a (and likewise for b), so a·b = p + err exactly.
+const SPLITTER = 134217729; // 2^27 + 1 (Veltkamp)
+const LN2_HI = 0.6931471805599453, LN2_LO = 2.3190468138462996e-17;
+const LOG2E_HI = 1.4426950408889634, LOG2E_LO = 2.0355273740931033e-17;
+const SQRT2 = 1.4142135623730951, TWO_POW_54 = 18014398509481984, MIN_NORMAL = 2.2250738585072014e-308;
+/** Veltkamp halves of a constant (the same values the split gives at each use). */
+function splitHigh(a) { const c = SPLITTER * a; return c - (c - a); }
+const LN2_HI_H = /* @__PURE__ */ splitHigh(LN2_HI), LN2_HI_L = LN2_HI - LN2_HI_H, LOG2E_HI_H = /* @__PURE__ */ splitHigh(LOG2E_HI), LOG2E_HI_L = LOG2E_HI - LOG2E_HI_H;
+/** The low part of the last double-double result (its high part is the return value). */
+const LOW_PART = /* @__PURE__ */ new Float64Array(1);
+/**
+ * log2 m for m in [√½, √2] by the atanh series to s²³ (no table): builds LOG2_TABLE once. Returns the high part, the low
+ * part in LOW_PART[0]; relative error below 2^-56.
+ */
+function log2SeriesDoubleDouble(x) {
+    let e = 0;
+    if (x < MIN_NORMAL) {
+        x *= TWO_POW_54;
+        e = -54;
+    }
+    BITS[0] = x;
+    const high = WORDS[HIGH];
+    e += (high >>> 20) - 1023;
+    let m = x * POW2[1074 - ((high >>> 20) - 1023)]; // exact: m in [1, 2)
+    if (m > SQRT2) {
+        m *= 0.5;
+        e += 1;
+    }
+    // s = f/(2 + f) with f = m − 1 (exact), as sHi + sLo: 2 + f = dh + dl exactly (FastTwoSum), then the residual
+    // f − sHi·(dh + dl) with sHi·dh = p + pe exactly (TwoProduct).
+    const f = m - 1, dh = 2 + f, dl = f - (dh - 2), sHi = f / dh, p = sHi * dh;
+    let c = SPLITTER * sHi;
+    const ah = c - (c - sHi), al = sHi - ah;
+    c = SPLITTER * dh;
+    const bh = c - (c - dh), bl = dh - bh, pe = ((ah * bh - p) + ah * bl + al * bh) + al * bl;
+    const sLo = (((f - p) - pe) - sHi * dl) / dh;
+    const z = sHi * sHi;
+    const tail = sHi * z * (0.6666666666666666 + z * (0.4 + z * (0.2857142857142857 + z * (0.2222222222222222 + z * (0.18181818181818182 + z * (0.15384615384615385 +
+        z * (0.13333333333333333 + z * (0.11764705882352941 + z * (0.10526315789473684 + z * (0.09523809523809523 + z * 0.08695652173913043))))))))));
+    // ln m = 2sHi + (2sLo + tail) = lh + ll (FastTwoSum); times log2 e = LOG2E_HI + LOG2E_LO (TwoProduct of the high parts); plus e (TwoSum).
+    const a1 = 2 * sHi, b1 = 2 * sLo + tail, lh = a1 + b1, ll = b1 - (lh - a1), q = lh * LOG2E_HI;
+    c = SPLITTER * lh;
+    const ch = c - (c - lh), cl = lh - ch, qe = ((ch * LOG2E_HI_H - q) + ch * LOG2E_HI_L + cl * LOG2E_HI_H) + cl * LOG2E_HI_L;
+    const pl = qe + (lh * LOG2E_LO + ll * LOG2E_HI);
+    const t = e + q, tb = t - e, te = (e - (t - tb)) + (q - tb), b2 = te + pl, hi = t + b2;
+    LOW_PART[0] = b2 - (hi - t);
+    return hi;
+}
+/** log2(k/128) for k = 90 … 182 (the table's range of k = round(128·m), m in [√½, √2]) as double-doubles. */
+const LOG2_TABLE_LO = /* @__PURE__ */ new Float64Array(183);
+const LOG2_TABLE_HI = /* @__PURE__ */ (() => {
+    const table = new Float64Array(183);
+    for (let k = 90; k <= 182; k++) {
+        table[k] = log2SeriesDoubleDouble(k / 128);
+        LOG2_TABLE_LO[k] = LOW_PART[0];
+    }
+    return table;
+})();
+/**
+ * log2 x as a double-double for finite x > 0: returns the high part, the low part in LOW_PART[0]. x = m·2^e with m in
+ * [√½, √2]; m = F·(1 + f/F) with F = k/128, k = round(128·m), so log2 m = log2 F (table) + 2·atanh(s)·log2 e with
+ * s = f/(m + F), |s| < 2^-8.4, by its series to s⁷ (truncation below 2^-70 relative). Relative error below 2^-56.
+ */
+function log2DoubleDouble(x) {
+    let e = 0;
+    if (x < MIN_NORMAL) {
+        x *= TWO_POW_54;
+        e = -54;
+    }
+    BITS[0] = x;
+    const high = WORDS[HIGH];
+    e += (high >>> 20) - 1023;
+    let m = x * POW2[1074 - ((high >>> 20) - 1023)]; // exact: m in [1, 2)
+    if (m > SQRT2) {
+        m *= 0.5;
+        e += 1;
+    }
+    // F = k/128 (exact) and f = m − F (exact, F/2 ≤ m ≤ 2F); m + F = dh + dl exactly (TwoSum); s = f/(dh + dl) as sHi + sLo
+    // from the residual f − sHi·(dh + dl), with sHi·dh = p + pe exactly (TwoProduct).
+    const k = Math.round(m * 128), F = k / 128, f = m - F, dh = m + F, db = dh - m, dl = (m - (dh - db)) + (F - db);
+    const sHi = f / dh, p = sHi * dh;
+    let c = SPLITTER * sHi;
+    const ah = c - (c - sHi), al = sHi - ah;
+    c = SPLITTER * dh;
+    const bh = c - (c - dh), bl = dh - bh, pe = ((ah * bh - p) + ah * bl + al * bh) + al * bl;
+    const sLo = (((f - p) - pe) - sHi * dl) / dh, z = sHi * sHi;
+    const tail = sHi * z * (0.6666666666666666 + z * (0.4 + z * 0.2857142857142857));
+    // ln(m/F) = 2sHi + (2sLo + tail) = lh + ll (FastTwoSum); times log2 e = LOG2E_HI + LOG2E_LO (TwoProduct of the high
+    // parts); plus log2 F (TwoSum with the table's high part), then plus e (TwoSum).
+    const a1 = 2 * sHi, b1 = 2 * sLo + tail, lh = a1 + b1, ll = b1 - (lh - a1), q = lh * LOG2E_HI;
+    c = SPLITTER * lh;
+    const ch = c - (c - lh), cl = lh - ch, qe = ((ch * LOG2E_HI_H - q) + ch * LOG2E_HI_L + cl * LOG2E_HI_H) + cl * LOG2E_HI_L;
+    const pl = qe + (lh * LOG2E_LO + ll * LOG2E_HI), th = LOG2_TABLE_HI[k];
+    const t = th + q, tb = t - th, low = ((th - (t - tb)) + (q - tb)) + (pl + LOG2_TABLE_LO[k]);
+    const u = e + t, ub = u - e, b2 = ((e - (u - ub)) + (t - ub)) + low, hi = u + b2;
+    LOW_PART[0] = b2 - (hi - u);
+    return hi;
+}
+/** 2^(th + tl) for a double-double exponent; within 1 ulp (plus the error the exponent carries). */
+function exp2DoubleDouble(th, tl) {
+    if (th !== th)
+        return NaN;
+    if (th > 1024)
+        return Infinity;
+    if (th < -1080)
+        return 0;
+    // th = n + r exactly (|r| ≤ ½); w = r·ln 2 = wh + wl (TwoProduct with LN2_HI, plus r·LN2_LO).
+    const n = Math.round(th), r = (th - n) + tl, wh = r * LN2_HI, c = SPLITTER * r, ah = c - (c - r), al = r - ah;
+    const wl = (((ah * LN2_HI_H - wh) + ah * LN2_HI_L + al * LN2_HI_H) + al * LN2_HI_L) + r * LN2_LO;
+    const q = 0.5 + wh * (0.16666666666666666 + wh * (0.041666666666666664 + wh * (0.008333333333333333 + wh * (0.001388888888888889 + wh * (0.0001984126984126984 +
+        wh * (2.48015873015873e-05 + wh * (2.7557319223985893e-06 + wh * (2.755731922398589e-07 + wh * (2.505210838544172e-08 + wh * (2.08767569878681e-09 +
+            wh * (1.6059043836821613e-10 + wh * 1.1470745597729725e-11)))))))))));
+    return scaleByPowerOfTwo(1 + (wh + (wl + wh * wh * q)), n);
+}
+/** log2 x, bit-identical in every JavaScript engine (within 1 ulp). 0 → −∞; negative or NaN → NaN; +∞ → +∞. */
+export function portableLog2(x) {
+    if (!(x > 0))
+        return x === 0 ? -Infinity : NaN;
+    if (x === Infinity)
+        return Infinity;
+    const h = log2DoubleDouble(x);
+    return h + LOW_PART[0];
+}
+/** ln(k/128) for k = 90 … 182 as double-doubles (log2(k/128)·ln 2, TwoProduct with LN2_HI plus the small products). */
+const LN_TABLE_LO = /* @__PURE__ */ new Float64Array(183);
+const LN_TABLE_HI = /* @__PURE__ */ (() => {
+    const table = new Float64Array(183);
+    for (let k = 90; k <= 182; k++) {
+        const h = LOG2_TABLE_HI[k], l = LOG2_TABLE_LO[k], p = h * LN2_HI, c = SPLITTER * h, ah = c - (c - h), al = h - ah;
+        const pe = ((ah * LN2_HI_H - p) + ah * LN2_HI_L + al * LN2_HI_H) + al * LN2_HI_L, lo = pe + (h * LN2_LO + l * LN2_HI), hi = p + lo;
+        table[k] = hi;
+        LN_TABLE_LO[k] = lo - (hi - p);
+    }
+    return table;
+})();
+/** ln 2 = LN2_E_HI + LN2_E_LO with the low 32 bits of LN2_E_HI zero, so e·LN2_E_HI is exact for every exponent e here. */
+const LN2_E_HI = /* @__PURE__ */ (() => { BITS[0] = LN2_HI; WORDS[LOW] = 0; return BITS[0]; })(), LN2_E_LO = (LN2_HI - LN2_E_HI) + LN2_LO;
+/**
+ * Natural logarithm, bit-identical in every JavaScript engine (within 1 ulp). 0 → −∞; negative or NaN → NaN; +∞ → +∞.
+ * x = m·2^e, m in [√½, √2]; ln x = e·ln 2 + ln F (table, F = k/128, k = round(128·m)) + 2·atanh(s), s = (m − F)/(m + F),
+ * with s as a double-double and the three terms added with TwoSum.
+ */
+export function portableLog(x) {
+    if (!(x > 0))
+        return x === 0 ? -Infinity : NaN;
+    if (x === Infinity)
+        return Infinity;
+    let e = 0;
+    if (x < MIN_NORMAL) {
+        x *= TWO_POW_54;
+        e = -54;
+    }
+    BITS[0] = x;
+    const high = WORDS[HIGH];
+    e += (high >>> 20) - 1023;
+    let m = x * POW2[1074 - ((high >>> 20) - 1023)]; // exact: m in [1, 2)
+    if (m > SQRT2) {
+        m *= 0.5;
+        e += 1;
+    }
+    const k = Math.round(m * 128), F = k / 128, f = m - F, dh = m + F, db = dh - m, dl = (m - (dh - db)) + (F - db);
+    const sHi = f / dh, p = sHi * dh;
+    let c = SPLITTER * sHi;
+    const ah = c - (c - sHi), al = sHi - ah;
+    c = SPLITTER * dh;
+    const bh = c - (c - dh), bl = dh - bh, pe = ((ah * bh - p) + ah * bl + al * bh) + al * bl;
+    const sLo = (((f - p) - pe) - sHi * dl) / dh, z = sHi * sHi;
+    const tail = sHi * z * (0.6666666666666666 + z * (0.4 + z * 0.2857142857142857));
+    // (e·LN2_E_HI + ln F) + 2sHi with TwoSum errors, then the low parts.
+    const A = e * LN2_E_HI, B = LN_TABLE_HI[k], t = A + B, tb = t - A, te = (A - (t - tb)) + (B - tb);
+    const a2 = 2 * sHi, u = t + a2, ub = u - t, ue = (t - (u - ub)) + (a2 - ub);
+    return u + ((te + ue) + ((e * LN2_E_LO + LN_TABLE_LO[k]) + (2 * sLo + tail)));
+}
+/** 2^x, bit-identical in every JavaScript engine (within 1 ulp). */
+export function portableExp2(x) { return exp2DoubleDouble(x, 0); }
+/** e^x, bit-identical in every JavaScript engine (within 1 ulp). */
+export function portableExp(x) {
+    if (x !== x)
+        return NaN;
+    if (x > 710)
+        return Infinity;
+    if (x < -746)
+        return 0;
+    // x·log2 e = th + tl: x·LOG2E_HI = th + te exactly (TwoProduct), plus x·LOG2E_LO.
+    const th = x * LOG2E_HI, c = SPLITTER * x, ah = c - (c - x), al = x - ah;
+    const te = ((ah * LOG2E_HI_H - th) + ah * LOG2E_HI_L + al * LOG2E_HI_H) + al * LOG2E_HI_L;
+    return exp2DoubleDouble(th, te + x * LOG2E_LO);
+}
+/**
+ * e^x − 1, bit-identical in every JavaScript engine (within 2 ulps): the Taylor series to degree 20 for |x| < 1
+ * (truncation below 2^-60 relative), else portableExp(x) − 1.
+ */
+export function portableExpm1(x) {
+    if (x !== x)
+        return NaN;
+    if (x === 0)
+        return x;
+    if (!(x > -1 && x < 1))
+        return portableExp(x) - 1;
+    return x + x * x * (0.5 + x * (0.16666666666666666 + x * (0.041666666666666664 + x * (0.008333333333333333 + x * (0.001388888888888889 + x * (0.0001984126984126984 +
+        x * (2.48015873015873e-05 + x * (2.7557319223985893e-06 + x * (2.755731922398589e-07 + x * (2.505210838544172e-08 + x * (2.08767569878681e-09 +
+            x * (1.6059043836821613e-10 + x * (1.1470745597729725e-11 + x * (7.647163731819816e-13 + x * (4.779477332387385e-14 + x * (2.8114572543455206e-15 +
+                x * (1.5619206968586225e-16 + x * (8.22063524662433e-18 + x * 4.110317623312165e-19))))))))))))))))));
+}
+/**
+ * x^y for x ≥ 0 and finite y, bit-identical in every JavaScript engine (within 1 ulp for |y| ≤ 4). x = 0 gives 0 for
+ * y > 0, 1 for y = 0 and +∞ for y < 0; negative x or a non-finite argument gives NaN (the callers never pass them).
+ */
+export function portablePow(x, y) {
+    if (!(x >= 0) || !Number.isFinite(x) || !Number.isFinite(y))
+        return NaN;
+    if (y === 0 || x === 1)
+        return 1;
+    if (x === 0)
+        return y > 0 ? 0 : Infinity;
+    // y·(lh + ll): lh·y = p + pe exactly (TwoProduct), then FastTwoSum(p, pe + ll·y).
+    const lh = log2DoubleDouble(x), ll = LOW_PART[0], p = lh * y;
+    let c = SPLITTER * lh;
+    const ah = c - (c - lh), al = lh - ah;
+    c = SPLITTER * y;
+    const bh = c - (c - y), bl = y - bh, pe = ((ah * bh - p) + ah * bl + al * bh) + al * bl;
+    const b = pe + ll * y, th = p + b;
+    return exp2DoubleDouble(th, b - (th - p));
+}
+/** ∛(2^r) for r = 0, 1, 2 (only scale the cube root's starting value, so their last bits do not matter). */
+const CBRT_POWERS_OF_TWO = [1, 1.2599210498948732, 1.5874010519681994];
+/**
+ * Cube root, bit-identical in every JavaScript engine (within 1 ulp; exact for ±0, ±∞ and cubes of powers of two).
+ * |x| = m·2^(3q + r) with m in [1, 2) and r in {0, 1, 2}, w = m·2^r: a cubic fit to ∛m (within 1.7·10⁻⁴) times ∛(2^r),
+ * one Halley step y ← y(y³ + 2w)/(2y³ + w) (cubic convergence: below 10⁻¹¹), then one Newton step y + (w − y³)/(3y²)
+ * with w − y³ formed exactly (TwoProduct), which leaves only the final rounding and errors near 10⁻²².
+ */
+export function portableCbrt(x) {
+    if (x === 0 || x !== x || !Number.isFinite(x))
+        return x;
+    let a = x < 0 ? -x : x, shift = 0;
+    if (a < MIN_NORMAL) {
+        a *= TWO_POW_54;
+        shift = -18;
+    }
+    BITS[0] = a;
+    const high = WORDS[HIGH], e = (high >>> 20) - 1023, q = Math.floor(e / 3), r = e - 3 * q;
+    const m = a * POW2[1074 - e], w = m * CBRT_SCALE[r]; // exact: m in [1, 2)
+    let y = (0.5561432746078446 + m * (0.5806821751356804 + m * (-0.15894786280039686 + m * 0.022291567104952514))) * CBRT_POWERS_OF_TWO[r];
+    const y3 = y * y * y;
+    y = y * (y3 + 2 * w) / (2 * y3 + w);
+    // y² = p + pe exactly; y³ = p·y + pe·y = t + te (TwoProduct of p and y, plus pe·y); w − y³ = (w − t) − te.
+    const p = y * y;
+    let c = SPLITTER * y;
+    const yh = c - (c - y), yl = y - yh, pe = ((yh * yh - p) + yh * yl + yl * yh) + yl * yl, t = p * y;
+    c = SPLITTER * p;
+    const ph = c - (c - p), pll = p - ph, te = (((ph * yh - t) + ph * yl + pll * yh) + pll * yl) + pe * y;
+    const root = scaleByPowerOfTwo(y + ((w - t) - te) / (3 * p), q + shift);
+    return x < 0 ? -root : root;
+}
+/** 2^r for r = 0, 1, 2. */
+const CBRT_SCALE = [1, 2, 4];
+/** cos(2πr) and sin(2πr) for |r| ≤ ⅛ (Taylor series in z = r²). */
+function cosTwoPiReduced(r) {
+    const z = r * r;
+    return 1 + z * (-19.739208802178716 + z * (64.9393940226683 + z * (-85.45681720669373 + z * (60.24464137187666 + z * (-26.4262567833744 + z * (7.903536371318469 +
+        z * (-1.714390711088672 + z * (0.28200596845579123 + z * -0.03638284114254567))))))));
+}
+function sinTwoPiReduced(r) {
+    const z = r * r;
+    return r * (6.283185307179586 + z * (-41.34170224039976 + z * (81.60524927607506 + z * (-76.70585975306139 + z * (42.058693944897655 + z * (-15.09464257682299 +
+        z * (3.819952584848282 + z * (-0.7181223017785006 + z * (0.10422916220813984 + z * -0.012031585942120627)))))))));
+}
+/** cos(2πu) for finite u (u in turns), bit-identical in every JavaScript engine (within 2 ulps). */
+export function portableCosTwoPi(u) {
+    if (!Number.isFinite(u))
+        return NaN;
+    const t = 4 * u, q = Math.round(t), r = (t - q) / 4, quadrant = ((q % 4) + 4) % 4;
+    return quadrant === 0 ? cosTwoPiReduced(r) : quadrant === 1 ? -sinTwoPiReduced(r) : quadrant === 2 ? -cosTwoPiReduced(r) : sinTwoPiReduced(r);
+}
+/** sin(2πu) for finite u (u in turns), bit-identical in every JavaScript engine (within 2 ulps). */
+export function portableSinTwoPi(u) {
+    if (!Number.isFinite(u))
+        return NaN;
+    const t = 4 * u, q = Math.round(t), r = (t - q) / 4, quadrant = ((q % 4) + 4) % 4;
+    return quadrant === 0 ? sinTwoPiReduced(r) : quadrant === 1 ? cosTwoPiReduced(r) : quadrant === 2 ? -sinTwoPiReduced(r) : -cosTwoPiReduced(r);
+}
 //# sourceMappingURL=portable-math.js.map

package/dist/core/portable-math.js.map

@@ -1 +1 @@
-{"version":3,"file":"portable-math.js","sourceRoot":"","sources":["../../src/core/portable-math.ts"],"names":[],"mappings":"AAAA,sCAAsC;AAEtC;;;;;;;;;;;;GAYG;AAEH,MAAM,KAAK,GAAG,CAAC,IAAI,GAAG,CAAC;AACvB,MAAM,KAAK,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC;AACxB,MAAM,UAAU,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC;AAC7B,MAAM,QAAQ,GAAG,CAAC,IAAI,GAAG,CAAC;AAE1B;;;;;;;GAOG;AACH,MAAM,UAAU,aAAa,CAAC,GAAG,MAAyB;IACxD,IAAI,OAAO,GAAG,CAAC,CAAC;IAChB,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;QAC3B,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QAClC,IAAI,CAAC,CAAC,SAAS,IAAI,OAAO,CAAC;YAAE,OAAO,GAAG,SAAS,CAAC;IACnD,CAAC;IACD,IAAI,OAAO,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,OAAO,CAAC;QAAE,OAAO,OAAO,CAAC;IAC/D,MAAM,KAAK,GAAG,OAAO,GAAG,KAAK,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,OAAO,GAAG,KAAK,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;IAC5E,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;QAC3B,MAAM,MAAM,GAAG,KAAK,GAAG,KAAK,CAAC;QAC7B,GAAG,IAAI,MAAM,GAAG,MAAM,CAAC;IACzB,CAAC;IACD,OAAO,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC;AAChC,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,eAAe,CAAC,CAAS,EAAE,CAAS,EAAE,WAAmB;IACvE,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC;QAAE,OAAO,KAAK,CAAC;IAC7D,IAAI,CAAC,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC;IACzB,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,WAAW,GAAG,MAAM,CAAC,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;AAC9F,CAAC","sourcesContent":["// SPDX-License-Identifier: Apache-2.0\n\n/**\n * Floating-point helpers that give bit-identical results in every JavaScript engine.\n *\n * ECMAScript requires `+ - * /` and `Math.sqrt` to be correctly rounded IEEE 754 binary64\n * (double-precision) operations. A fixed sequence of them gives the same bits in every\n * conforming engine. `Math.hypot`, `Math.exp`, `Math.atan`, `Math.cos` and the other\n * transcendental functions are \"implementation-approximated\" (ECMA-262 §21.3.2). They can\n * differ in the last bit between V8, JavaScriptCore and SpiderMonkey.\n *\n * So any value that is stored and later recomputed for an exact identity check must use\n * only the correctly rounded operations.\n * @see docs/NUMERICAL_CORRECTNESS.md §Cross-engine determinism\n */\n\nconst LARGE = 2 ** 500;\nconst SMALL = 2 ** -500;\nconst SCALE_DOWN = 2 ** -600;\nconst SCALE_UP = 2 ** 600;\n\n/**\n * Euclidean norm (vector length) of the components. Unlike `Math.hypot`, it uses only correctly\n * rounded IEEE operations, so the result is bit-identical in every JavaScript engine.\n *\n * Components are summed in argument order. Inputs far from 1 are first rescaled by an exact power\n * of two, so squaring cannot overflow or underflow. Non-finite input gives a non-finite result;\n * callers validate inputs first.\n */\nexport function portableHypot(...values: readonly number[]): number {\n  let maximum = 0;\n  for (const value of values) {\n    const magnitude = Math.abs(value);\n    if (!(magnitude <= maximum)) maximum = magnitude;\n  }\n  if (maximum === 0 || !Number.isFinite(maximum)) return maximum;\n  const scale = maximum > LARGE ? SCALE_DOWN : maximum < SMALL ? SCALE_UP : 1;\n  let sum = 0;\n  for (const value of values) {\n    const scaled = value * scale;\n    sum += scaled * scaled;\n  }\n  return Math.sqrt(sum) / scale;\n}\n\n/**\n * True when two finite numbers differ by at most `maximumUlps` ULPs (units in the last place).\n * One ULP here is `Number.EPSILON` times the larger magnitude. Use it to accept an archived value\n * that another engine or an earlier release computed with an implementation-approximated function.\n */\nexport function equalWithinUlps(a: number, b: number, maximumUlps: number): boolean {\n  if (!Number.isFinite(a) || !Number.isFinite(b)) return false;\n  if (a === b) return true;\n  return Math.abs(a - b) <= maximumUlps * Number.EPSILON * Math.max(Math.abs(a), Math.abs(b));\n}\n"]}
+{"version":3,"file":"portable-math.js","sourceRoot":"","sources":["../../src/core/portable-math.ts"],"names":[],"mappings":"AAAA,sCAAsC;AAEtC;;;;;;;;;;;;GAYG;AAEH,MAAM,KAAK,GAAG,CAAC,IAAI,GAAG,CAAC;AACvB,MAAM,KAAK,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC;AACxB,MAAM,UAAU,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC;AAC7B,MAAM,QAAQ,GAAG,CAAC,IAAI,GAAG,CAAC;AAE1B;;;;;;;GAOG;AACH,MAAM,UAAU,aAAa,CAAC,GAAG,MAAyB;IACxD,IAAI,OAAO,GAAG,CAAC,CAAC;IAChB,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;QAC3B,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QAClC,IAAI,CAAC,CAAC,SAAS,IAAI,OAAO,CAAC;YAAE,OAAO,GAAG,SAAS,CAAC;IACnD,CAAC;IACD,IAAI,OAAO,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,OAAO,CAAC;QAAE,OAAO,OAAO,CAAC;IAC/D,MAAM,KAAK,GAAG,OAAO,GAAG,KAAK,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,OAAO,GAAG,KAAK,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;IAC5E,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;QAC3B,MAAM,MAAM,GAAG,KAAK,GAAG,KAAK,CAAC;QAC7B,GAAG,IAAI,MAAM,GAAG,MAAM,CAAC;IACzB,CAAC;IACD,OAAO,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC;AAChC,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,eAAe,CAAC,CAAS,EAAE,CAAS,EAAE,WAAmB;IACvE,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC;QAAE,OAAO,KAAK,CAAC;IAC7D,IAAI,CAAC,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC;IACzB,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,WAAW,GAAG,MAAM,CAAC,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;AAC9F,CAAC;AAED,kHAAkH;AAClH,4EAA4E;AAC5E,EAAE;AACF,sGAAsG;AACtG,6GAA6G;AAC7G,0GAA0G;AAC1G,sGAAsG;AACtG,wGAAwG;AACxG,6FAA6F;AAC7F,EAAE;AACF,sCAAsC;AACtC,0GAA0G;AAC1G,8GAA8G;AAC9G,wGAAwG;AACxG,sDAAsD;AACtD,4GAA4G;AAC5G,6GAA6G;AAC7G,oGAAoG;AACpG,8GAA8G;AAC9G,sGAAsG;AACtG,iGAAiG;AACjG,kGAAkG;AAClG,8GAA8G;AAC9G,8DAA8D;AAC9D,EAAE;AACF,2GAA2G;AAC3G,kHAAkH;AAClH,4GAA4G;AAC5G,oHAAoH;AACpH,qHAAqH;AACrH,iHAAiH;AACjH,4GAA4G;AAC5G,uCAAuC;AAEvC,6HAA6H;AAC7H,wHAAwH;AACxH,8HAA8H;AAC9H,MAAM,IAAI,GAAG,eAAe,CAAC,IAAI,YAAY,CAAC,CAAC,CAAC,EAAE,KAAK,GAAG,eAAe,CAAC,CAAC,GAAgB,EAAE,CAAC,IAAI,WAAW,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC;AAC9H,MAAM,IAAI,GAAG,eAAe,CAAC,CAAC,GAAW,EAAE,CAAC,CAAC,IAAI,UAAU,CAAC,IAAI,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,GAAG,GAAG,CAAC,GAAG,IAAI,CAAC;AAC9H,uGAAuG;AACvG,MAAM,IAAI,GAAG,eAAe,CAAC,CAAC,GAAiB,EAAE;IAC/C,MAAM,KAAK,GAAG,IAAI,YAAY,CAAC,IAAI,CAAC,CAAC;IACrC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAChB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,IAAI,EAAE,CAAC,EAAE;QAAE,KAAK,CAAC,IAAI,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,IAAI,GAAG,CAAC,CAAE,GAAG,CAAC,CAAC;IACvE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,IAAI,EAAE,CAAC,EAAE;QAAE,KAAK,CAAC,IAAI,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,IAAI,GAAG,CAAC,CAAE,GAAG,CAAC,CAAC;IACvE,OAAO,KAAK,CAAC;AACf,CAAC,CAAC,EAAE,CAAC;AACL,+HAA+H;AAC/H,SAAS,iBAAiB,CAAC,CAAS,EAAE,CAAS;IAC7C,IAAI,CAAC,GAAG,IAAI;QAAE,OAAO,CAAC,GAAG,IAAI,CAAC,IAAI,CAAE,GAAG,IAAI,CAAC,IAAI,GAAG,CAAC,GAAG,IAAI,CAAE,CAAC;IAC9D,IAAI,CAAC,GAAG,CAAC,IAAI;QAAE,OAAO,CAAC,GAAG,IAAI,CAAC,IAAI,GAAG,CAAC,GAAG,IAAI,CAAE,GAAG,IAAI,CAAC,CAAC,CAAE,CAAC,CAAC,4DAA4D;IACzH,OAAO,CAAC,GAAG,IAAI,CAAC,IAAI,GAAG,CAAC,CAAE,CAAC;AAC7B,CAAC;AACD,kGAAkG;AAClG,+FAA+F;AAC/F,+EAA+E;AAC/E,4FAA4F;AAC5F,oGAAoG;AACpG,MAAM,QAAQ,GAAG,SAAS,CAAC,CAAC,sBAAsB;AAClD,MAAM,MAAM,GAAG,kBAAkB,EAAE,MAAM,GAAG,sBAAsB,CAAC;AACnE,MAAM,QAAQ,GAAG,kBAAkB,EAAE,QAAQ,GAAG,sBAAsB,CAAC;AACvE,MAAM,KAAK,GAAG,kBAAkB,EAAE,UAAU,GAAG,iBAAiB,EAAE,UAAU,GAAG,uBAAuB,CAAC;AACvG,mFAAmF;AACnF,SAAS,SAAS,CAAC,CAAS,IAAY,MAAM,CAAC,GAAG,QAAQ,GAAG,CAAC,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;AACrF,MAAM,QAAQ,GAAG,eAAe,CAAC,SAAS,CAAC,MAAM,CAAC,EAAE,QAAQ,GAAG,MAAM,GAAG,QAAQ,EAAE,UAAU,GAAG,eAAe,CAAC,SAAS,CAAC,QAAQ,CAAC,EAAE,UAAU,GAAG,QAAQ,GAAG,UAAU,CAAC;AACvK,yFAAyF;AACzF,MAAM,QAAQ,GAAG,eAAe,CAAC,IAAI,YAAY,CAAC,CAAC,CAAC,CAAC;AAErD;;;GAGG;AACH,SAAS,sBAAsB,CAAC,CAAS;IACvC,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,IAAI,CAAC,GAAG,UAAU,EAAE,CAAC;QAAC,CAAC,IAAI,UAAU,CAAC;QAAC,CAAC,GAAG,CAAC,EAAE,CAAC;IAAC,CAAC;IACjD,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IACZ,MAAM,IAAI,GAAG,KAAK,CAAC,IAAI,CAAE,CAAC;IAC1B,CAAC,IAAI,CAAC,IAAI,KAAK,EAAE,CAAC,GAAG,IAAI,CAAC;IAC1B,IAAI,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,KAAK,EAAE,CAAC,GAAG,IAAI,CAAC,CAAE,CAAC,CAAC,qBAAqB;IACvE,IAAI,CAAC,GAAG,KAAK,EAAE,CAAC;QAAC,CAAC,IAAI,GAAG,CAAC;QAAC,CAAC,IAAI,CAAC,CAAC;IAAC,CAAC;IACpC,8GAA8G;IAC9G,+DAA+D;IAC/D,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,GAAG,GAAG,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,GAAG,GAAG,EAAE,CAAC;IAC3E,IAAI,CAAC,GAAG,QAAQ,GAAG,GAAG,CAAC;IACvB,MAAM,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,EAAE,EAAE,GAAG,GAAG,GAAG,EAAE,CAAC;IACxC,CAAC,GAAG,QAAQ,GAAG,EAAE,CAAC;IAClB,MAAM,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,EAAE,GAAG,CAAC,CAAC,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC;IAC1F,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,GAAG,GAAG,GAAG,EAAE,CAAC,GAAG,EAAE,CAAC;IAC7C,MAAM,CAAC,GAAG,GAAG,GAAG,GAAG,CAAC;IACpB,MAAM,IAAI,GAAG,GAAG,GAAG,CAAC,GAAG,CAAC,kBAAkB,GAAG,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,kBAAkB,GAAG,CAAC,GAAG,CAAC,kBAAkB,GAAG,CAAC,GAAG,CAAC,mBAAmB,GAAG,CAAC,GAAG,CAAC,mBAAmB;QAC7J,CAAC,GAAG,CAAC,mBAAmB,GAAG,CAAC,GAAG,CAAC,mBAAmB,GAAG,CAAC,GAAG,CAAC,mBAAmB,GAAG,CAAC,GAAG,CAAC,mBAAmB,GAAG,CAAC,GAAG,mBAAmB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAChJ,0IAA0I;IAC1I,MAAM,EAAE,GAAG,CAAC,GAAG,GAAG,EAAE,EAAE,GAAG,CAAC,GAAG,GAAG,GAAG,IAAI,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,EAAE,GAAG,EAAE,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,GAAG,EAAE,GAAG,QAAQ,CAAC;IAC9F,CAAC,GAAG,QAAQ,GAAG,EAAE,CAAC;IAClB,MAAM,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,EAAE,GAAG,CAAC,CAAC,EAAE,GAAG,UAAU,GAAG,CAAC,CAAC,GAAG,EAAE,GAAG,UAAU,GAAG,EAAE,GAAG,UAAU,CAAC,GAAG,EAAE,GAAG,UAAU,CAAC;IAC1H,MAAM,EAAE,GAAG,EAAE,GAAG,CAAC,EAAE,GAAG,QAAQ,GAAG,EAAE,GAAG,QAAQ,CAAC,CAAC;IAChD,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,EAAE,GAAG,CAAC,GAAG,EAAE,CAAC;IACvF,QAAQ,CAAC,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;IAC5B,OAAO,EAAE,CAAC;AACZ,CAAC;AACD,6GAA6G;AAC7G,MAAM,aAAa,GAAG,eAAe,CAAC,IAAI,YAAY,CAAC,GAAG,CAAC,CAAC;AAC5D,MAAM,aAAa,GAAG,eAAe,CAAC,CAAC,GAAiB,EAAE;IACxD,MAAM,KAAK,GAAG,IAAI,YAAY,CAAC,GAAG,CAAC,CAAC;IACpC,KAAK,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC,IAAI,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;QAAC,KAAK,CAAC,CAAC,CAAC,GAAG,sBAAsB,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC;QAAC,aAAa,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAE,CAAC;IAAC,CAAC;IAChH,OAAO,KAAK,CAAC;AACf,CAAC,CAAC,EAAE,CAAC;AACL;;;;GAIG;AACH,SAAS,gBAAgB,CAAC,CAAS;IACjC,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,IAAI,CAAC,GAAG,UAAU,EAAE,CAAC;QAAC,CAAC,IAAI,UAAU,CAAC;QAAC,CAAC,GAAG,CAAC,EAAE,CAAC;IAAC,CAAC;IACjD,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IACZ,MAAM,IAAI,GAAG,KAAK,CAAC,IAAI,CAAE,CAAC;IAC1B,CAAC,IAAI,CAAC,IAAI,KAAK,EAAE,CAAC,GAAG,IAAI,CAAC;IAC1B,IAAI,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,KAAK,EAAE,CAAC,GAAG,IAAI,CAAC,CAAE,CAAC,CAAC,qBAAqB;IACvE,IAAI,CAAC,GAAG,KAAK,EAAE,CAAC;QAAC,CAAC,IAAI,GAAG,CAAC;QAAC,CAAC,IAAI,CAAC,CAAC;IAAC,CAAC;IACpC,wHAAwH;IACxH,kFAAkF;IAClF,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,GAAG,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC;IAChH,MAAM,GAAG,GAAG,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,GAAG,GAAG,EAAE,CAAC;IACjC,IAAI,CAAC,GAAG,QAAQ,GAAG,GAAG,CAAC;IACvB,MAAM,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,EAAE,EAAE,GAAG,GAAG,GAAG,EAAE,CAAC;IACxC,CAAC,GAAG,QAAQ,GAAG,EAAE,CAAC;IAClB,MAAM,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,EAAE,GAAG,CAAC,CAAC,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC;IAC1F,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,GAAG,GAAG,GAAG,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,GAAG,GAAG,GAAG,CAAC;IAC5D,MAAM,IAAI,GAAG,GAAG,GAAG,CAAC,GAAG,CAAC,kBAAkB,GAAG,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,GAAG,kBAAkB,CAAC,CAAC,CAAC;IACjF,oHAAoH;IACpH,iFAAiF;IACjF,MAAM,EAAE,GAAG,CAAC,GAAG,GAAG,EAAE,EAAE,GAAG,CAAC,GAAG,GAAG,GAAG,IAAI,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,EAAE,GAAG,EAAE,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,GAAG,EAAE,GAAG,QAAQ,CAAC;IAC9F,CAAC,GAAG,QAAQ,GAAG,EAAE,CAAC;IAClB,MAAM,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,EAAE,GAAG,CAAC,CAAC,EAAE,GAAG,UAAU,GAAG,CAAC,CAAC,GAAG,EAAE,GAAG,UAAU,GAAG,EAAE,GAAG,UAAU,CAAC,GAAG,EAAE,GAAG,UAAU,CAAC;IAC1H,MAAM,EAAE,GAAG,EAAE,GAAG,CAAC,EAAE,GAAG,QAAQ,GAAG,EAAE,GAAG,QAAQ,CAAC,EAAE,EAAE,GAAG,aAAa,CAAC,CAAC,CAAE,CAAC;IACxE,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,GAAG,EAAE,EAAE,GAAG,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,GAAG,aAAa,CAAC,CAAC,CAAE,CAAC,CAAC;IAC7F,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,GAAG,GAAG,EAAE,EAAE,GAAG,CAAC,GAAG,EAAE,CAAC;IACjF,QAAQ,CAAC,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;IAC5B,OAAO,EAAE,CAAC;AACZ,CAAC;AACD,oGAAoG;AACpG,SAAS,gBAAgB,CAAC,EAAU,EAAE,EAAU;IAC9C,IAAI,EAAE,KAAK,EAAE;QAAE,OAAO,GAAG,CAAC;IAC1B,IAAI,EAAE,GAAG,IAAI;QAAE,OAAO,QAAQ,CAAC;IAC/B,IAAI,EAAE,GAAG,CAAC,IAAI;QAAE,OAAO,CAAC,CAAC;IACzB,8FAA8F;IAC9F,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,EAAE,GAAG,CAAC,GAAG,MAAM,EAAE,CAAC,GAAG,QAAQ,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,GAAG,CAAC,GAAG,EAAE,CAAC;IAC9G,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,QAAQ,GAAG,EAAE,CAAC,GAAG,EAAE,GAAG,QAAQ,GAAG,EAAE,GAAG,QAAQ,CAAC,GAAG,EAAE,GAAG,QAAQ,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC;IACjG,MAAM,CAAC,GAAG,GAAG,GAAG,EAAE,GAAG,CAAC,mBAAmB,GAAG,EAAE,GAAG,CAAC,oBAAoB,GAAG,EAAE,GAAG,CAAC,oBAAoB,GAAG,EAAE,GAAG,CAAC,oBAAoB,GAAG,EAAE,GAAG,CAAC,qBAAqB;QAC5J,EAAE,GAAG,CAAC,oBAAoB,GAAG,EAAE,GAAG,CAAC,sBAAsB,GAAG,EAAE,GAAG,CAAC,qBAAqB,GAAG,EAAE,GAAG,CAAC,qBAAqB,GAAG,EAAE,GAAG,CAAC,oBAAoB;YAClJ,EAAE,GAAG,CAAC,sBAAsB,GAAG,EAAE,GAAG,sBAAsB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACxE,OAAO,iBAAiB,CAAC,CAAC,GAAG,CAAC,EAAE,GAAG,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AAC7D,CAAC;AAED,+GAA+G;AAC/G,MAAM,UAAU,YAAY,CAAC,CAAS;IACpC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QAAE,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC;IAC/C,IAAI,CAAC,KAAK,QAAQ;QAAE,OAAO,QAAQ,CAAC;IACpC,MAAM,CAAC,GAAG,gBAAgB,CAAC,CAAC,CAAC,CAAC;IAC9B,OAAO,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAE,CAAC;AAC1B,CAAC;AACD,uHAAuH;AACvH,MAAM,WAAW,GAAG,eAAe,CAAC,IAAI,YAAY,CAAC,GAAG,CAAC,CAAC;AAC1D,MAAM,WAAW,GAAG,eAAe,CAAC,CAAC,GAAiB,EAAE;IACtD,MAAM,KAAK,GAAG,IAAI,YAAY,CAAC,GAAG,CAAC,CAAC;IACpC,KAAK,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC,IAAI,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;QAC/B,MAAM,CAAC,GAAG,aAAa,CAAC,CAAC,CAAE,EAAE,CAAC,GAAG,aAAa,CAAC,CAAC,CAAE,EAAE,CAAC,GAAG,CAAC,GAAG,MAAM,EAAE,CAAC,GAAG,QAAQ,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,GAAG,CAAC,GAAG,EAAE,CAAC;QACpH,MAAM,EAAE,GAAG,CAAC,CAAC,EAAE,GAAG,QAAQ,GAAG,CAAC,CAAC,GAAG,EAAE,GAAG,QAAQ,GAAG,EAAE,GAAG,QAAQ,CAAC,GAAG,EAAE,GAAG,QAAQ,EAAE,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,GAAG,MAAM,GAAG,CAAC,GAAG,MAAM,CAAC,EAAE,EAAE,GAAG,CAAC,GAAG,EAAE,CAAC;QACnI,KAAK,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC;QAAC,WAAW,CAAC,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;IAChD,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC,CAAC,EAAE,CAAC;AACL,0HAA0H;AAC1H,MAAM,QAAQ,GAAG,eAAe,CAAC,CAAC,GAAW,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,OAAO,IAAI,CAAC,CAAC,CAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,QAAQ,GAAG,CAAC,MAAM,GAAG,QAAQ,CAAC,GAAG,MAAM,CAAC;AACnJ;;;;GAIG;AACH,MAAM,UAAU,WAAW,CAAC,CAAS;IACnC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QAAE,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC;IAC/C,IAAI,CAAC,KAAK,QAAQ;QAAE,OAAO,QAAQ,CAAC;IACpC,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,IAAI,CAAC,GAAG,UAAU,EAAE,CAAC;QAAC,CAAC,IAAI,UAAU,CAAC;QAAC,CAAC,GAAG,CAAC,EAAE,CAAC;IAAC,CAAC;IACjD,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IACZ,MAAM,IAAI,GAAG,KAAK,CAAC,IAAI,CAAE,CAAC;IAC1B,CAAC,IAAI,CAAC,IAAI,KAAK,EAAE,CAAC,GAAG,IAAI,CAAC;IAC1B,IAAI,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,KAAK,EAAE,CAAC,GAAG,IAAI,CAAC,CAAE,CAAC,CAAC,qBAAqB;IACvE,IAAI,CAAC,GAAG,KAAK,EAAE,CAAC;QAAC,CAAC,IAAI,GAAG,CAAC;QAAC,CAAC,IAAI,CAAC,CAAC;IAAC,CAAC;IACpC,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,GAAG,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC;IAChH,MAAM,GAAG,GAAG,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,GAAG,GAAG,EAAE,CAAC;IACjC,IAAI,CAAC,GAAG,QAAQ,GAAG,GAAG,CAAC;IACvB,MAAM,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,EAAE,EAAE,GAAG,GAAG,GAAG,EAAE,CAAC;IACxC,CAAC,GAAG,QAAQ,GAAG,EAAE,CAAC;IAClB,MAAM,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,EAAE,GAAG,CAAC,CAAC,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC;IAC1F,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,GAAG,GAAG,GAAG,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,GAAG,GAAG,GAAG,CAAC;IAC5D,MAAM,IAAI,GAAG,GAAG,GAAG,CAAC,GAAG,CAAC,kBAAkB,GAAG,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,GAAG,kBAAkB,CAAC,CAAC,CAAC;IACjF,qEAAqE;IACrE,MAAM,CAAC,GAAG,CAAC,GAAG,QAAQ,EAAE,CAAC,GAAG,WAAW,CAAC,CAAC,CAAE,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC;IACnG,MAAM,EAAE,GAAG,CAAC,GAAG,GAAG,EAAE,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE,EAAE,GAAG,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC;IAC5E,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,QAAQ,GAAG,WAAW,CAAC,CAAC,CAAE,CAAC,GAAG,CAAC,CAAC,GAAG,GAAG,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;AACjF,CAAC;AACD,oEAAoE;AACpE,MAAM,UAAU,YAAY,CAAC,CAAS,IAAY,OAAO,gBAAgB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;AAClF,oEAAoE;AACpE,MAAM,UAAU,WAAW,CAAC,CAAS;IACnC,IAAI,CAAC,KAAK,CAAC;QAAE,OAAO,GAAG,CAAC;IACxB,IAAI,CAAC,GAAG,GAAG;QAAE,OAAO,QAAQ,CAAC;IAC7B,IAAI,CAAC,GAAG,CAAC,GAAG;QAAE,OAAO,CAAC,CAAC;IACvB,kFAAkF;IAClF,MAAM,EAAE,GAAG,CAAC,GAAG,QAAQ,EAAE,CAAC,GAAG,QAAQ,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,GAAG,CAAC,GAAG,EAAE,CAAC;IACzE,MAAM,EAAE,GAAG,CAAC,CAAC,EAAE,GAAG,UAAU,GAAG,EAAE,CAAC,GAAG,EAAE,GAAG,UAAU,GAAG,EAAE,GAAG,UAAU,CAAC,GAAG,EAAE,GAAG,UAAU,CAAC;IAC1F,OAAO,gBAAgB,CAAC,EAAE,EAAE,EAAE,GAAG,CAAC,GAAG,QAAQ,CAAC,CAAC;AACjD,CAAC;AACD;;;GAGG;AACH,MAAM,UAAU,aAAa,CAAC,CAAS;IACrC,IAAI,CAAC,KAAK,CAAC;QAAE,OAAO,GAAG,CAAC;IACxB,IAAI,CAAC,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IACtB,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAAE,OAAO,WAAW,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IAClD,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,mBAAmB,GAAG,CAAC,GAAG,CAAC,oBAAoB,GAAG,CAAC,GAAG,CAAC,oBAAoB,GAAG,CAAC,GAAG,CAAC,oBAAoB,GAAG,CAAC,GAAG,CAAC,qBAAqB;QACjK,CAAC,GAAG,CAAC,oBAAoB,GAAG,CAAC,GAAG,CAAC,sBAAsB,GAAG,CAAC,GAAG,CAAC,qBAAqB,GAAG,CAAC,GAAG,CAAC,qBAAqB,GAAG,CAAC,GAAG,CAAC,oBAAoB;YAC7I,CAAC,GAAG,CAAC,sBAAsB,GAAG,CAAC,GAAG,CAAC,sBAAsB,GAAG,CAAC,GAAG,CAAC,qBAAqB,GAAG,CAAC,GAAG,CAAC,qBAAqB,GAAG,CAAC,GAAG,CAAC,sBAAsB;gBACjJ,CAAC,GAAG,CAAC,sBAAsB,GAAG,CAAC,GAAG,CAAC,oBAAoB,GAAG,CAAC,GAAG,qBAAqB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AAC1G,CAAC;AACD;;;GAGG;AACH,MAAM,UAAU,WAAW,CAAC,CAAS,EAAE,CAAS;IAC9C,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC;QAAE,OAAO,GAAG,CAAC;IACxE,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IACjC,IAAI,CAAC,KAAK,CAAC;QAAE,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC;IACzC,kFAAkF;IAClF,MAAM,EAAE,GAAG,gBAAgB,CAAC,CAAC,CAAC,EAAE,EAAE,GAAG,QAAQ,CAAC,CAAC,CAAE,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;IAC9D,IAAI,CAAC,GAAG,QAAQ,GAAG,EAAE,CAAC;IACtB,MAAM,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC;IACtC,CAAC,GAAG,QAAQ,GAAG,CAAC,CAAC;IACjB,MAAM,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,GAAG,CAAC,GAAG,EAAE,EAAE,EAAE,GAAG,CAAC,CAAC,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC;IACxF,MAAM,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC;IAClC,OAAO,gBAAgB,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;AAC5C,CAAC;AACD,4GAA4G;AAC5G,MAAM,kBAAkB,GAAG,CAAC,CAAC,EAAE,kBAAkB,EAAE,kBAAkB,CAAC,CAAC;AACvE;;;;;GAKG;AACH,MAAM,UAAU,YAAY,CAAC,CAAS;IACpC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC;QAAE,OAAO,CAAC,CAAC;IACxD,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,KAAK,GAAG,CAAC,CAAC;IAClC,IAAI,CAAC,GAAG,UAAU,EAAE,CAAC;QAAC,CAAC,IAAI,UAAU,CAAC;QAAC,KAAK,GAAG,CAAC,EAAE,CAAC;IAAC,CAAC;IACrD,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IACZ,MAAM,IAAI,GAAG,KAAK,CAAC,IAAI,CAAE,EAAE,CAAC,GAAG,CAAC,IAAI,KAAK,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IAC1F,MAAM,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,IAAI,GAAG,CAAC,CAAE,EAAE,CAAC,GAAG,CAAC,GAAG,UAAU,CAAC,CAAC,CAAE,CAAC,CAAC,qBAAqB;IAC5E,IAAI,CAAC,GAAG,CAAC,kBAAkB,GAAG,CAAC,GAAG,CAAC,kBAAkB,GAAG,CAAC,GAAG,CAAC,CAAC,mBAAmB,GAAG,CAAC,GAAG,oBAAoB,CAAC,CAAC,CAAC,GAAG,kBAAkB,CAAC,CAAC,CAAE,CAAC;IACzI,MAAM,EAAE,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IACrB,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;IACpC,2GAA2G;IAC3G,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IAChB,IAAI,CAAC,GAAG,QAAQ,GAAG,CAAC,CAAC;IACrB,MAAM,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,GAAG,CAAC,GAAG,EAAE,EAAE,EAAE,GAAG,CAAC,CAAC,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,GAAG,EAAE,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IACnG,CAAC,GAAG,QAAQ,GAAG,CAAC,CAAC;IACjB,MAAM,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,GAAG,CAAC,GAAG,EAAE,EAAE,EAAE,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,GAAG,GAAG,EAAE,CAAC,GAAG,GAAG,GAAG,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;IACtG,MAAM,IAAI,GAAG,iBAAiB,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,CAAC;IACxE,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC;AAC9B,CAAC;AACD,2BAA2B;AAC3B,MAAM,UAAU,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;AAC7B,mEAAmE;AACnE,SAAS,eAAe,CAAC,CAAS;IAChC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IAChB,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,kBAAkB,GAAG,CAAC,GAAG,CAAC,gBAAgB,GAAG,CAAC,GAAG,CAAC,CAAC,iBAAiB,GAAG,CAAC,GAAG,CAAC,iBAAiB,GAAG,CAAC,GAAG,CAAC,CAAC,gBAAgB,GAAG,CAAC,GAAG,CAAC,iBAAiB;QAC9J,CAAC,GAAG,CAAC,CAAC,iBAAiB,GAAG,CAAC,GAAG,CAAC,mBAAmB,GAAG,CAAC,GAAG,CAAC,mBAAmB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AAC1F,CAAC;AACD,SAAS,eAAe,CAAC,CAAS;IAChC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IAChB,OAAO,CAAC,GAAG,CAAC,iBAAiB,GAAG,CAAC,GAAG,CAAC,CAAC,iBAAiB,GAAG,CAAC,GAAG,CAAC,iBAAiB,GAAG,CAAC,GAAG,CAAC,CAAC,iBAAiB,GAAG,CAAC,GAAG,CAAC,kBAAkB,GAAG,CAAC,GAAG,CAAC,CAAC,iBAAiB;QAC5J,CAAC,GAAG,CAAC,iBAAiB,GAAG,CAAC,GAAG,CAAC,CAAC,kBAAkB,GAAG,CAAC,GAAG,CAAC,mBAAmB,GAAG,CAAC,GAAG,CAAC,oBAAoB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AACtH,CAAC;AACD,oGAAoG;AACpG,MAAM,UAAU,gBAAgB,CAAC,CAAS;IACxC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC;QAAE,OAAO,GAAG,CAAC;IACpC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,EAAE,QAAQ,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;IAClF,OAAO,QAAQ,KAAK,CAAC,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;AAChJ,CAAC;AACD,oGAAoG;AACpG,MAAM,UAAU,gBAAgB,CAAC,CAAS;IACxC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC;QAAE,OAAO,GAAG,CAAC;IACpC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,EAAE,QAAQ,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;IAClF,OAAO,QAAQ,KAAK,CAAC,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,KAAK,CAAC,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;AAChJ,CAAC","sourcesContent":["// SPDX-License-Identifier: Apache-2.0\n\n/**\n * Floating-point helpers that give bit-identical results in every JavaScript engine.\n *\n * ECMAScript requires `+ - * /` and `Math.sqrt` to be correctly rounded IEEE 754 binary64\n * (double-precision) operations. A fixed sequence of them gives the same bits in every\n * conforming engine. `Math.hypot`, `Math.exp`, `Math.atan`, `Math.cos` and the other\n * transcendental functions are \"implementation-approximated\" (ECMA-262 §21.3.2). They can\n * differ in the last bit between V8, JavaScriptCore and SpiderMonkey.\n *\n * So any value that is stored and later recomputed for an exact identity check must use\n * only the correctly rounded operations.\n * @see docs/NUMERICAL_CORRECTNESS.md §Cross-engine determinism\n */\n\nconst LARGE = 2 ** 500;\nconst SMALL = 2 ** -500;\nconst SCALE_DOWN = 2 ** -600;\nconst SCALE_UP = 2 ** 600;\n\n/**\n * Euclidean norm (vector length) of the components. Unlike `Math.hypot`, it uses only correctly\n * rounded IEEE operations, so the result is bit-identical in every JavaScript engine.\n *\n * Components are summed in argument order. Inputs far from 1 are first rescaled by an exact power\n * of two, so squaring cannot overflow or underflow. Non-finite input gives a non-finite result;\n * callers validate inputs first.\n */\nexport function portableHypot(...values: readonly number[]): number {\n  let maximum = 0;\n  for (const value of values) {\n    const magnitude = Math.abs(value);\n    if (!(magnitude <= maximum)) maximum = magnitude;\n  }\n  if (maximum === 0 || !Number.isFinite(maximum)) return maximum;\n  const scale = maximum > LARGE ? SCALE_DOWN : maximum < SMALL ? SCALE_UP : 1;\n  let sum = 0;\n  for (const value of values) {\n    const scaled = value * scale;\n    sum += scaled * scaled;\n  }\n  return Math.sqrt(sum) / scale;\n}\n\n/**\n * True when two finite numbers differ by at most `maximumUlps` ULPs (units in the last place).\n * One ULP here is `Number.EPSILON` times the larger magnitude. Use it to accept an archived value\n * that another engine or an earlier release computed with an implementation-approximated function.\n */\nexport function equalWithinUlps(a: number, b: number, maximumUlps: number): boolean {\n  if (!Number.isFinite(a) || !Number.isFinite(b)) return false;\n  if (a === b) return true;\n  return Math.abs(a - b) <= maximumUlps * Number.EPSILON * Math.max(Math.abs(a), Math.abs(b));\n}\n\n// ---------------------------------------------------------------------------------------------------------------\n// Portable logarithm, exponential, power, cube root and cosine/sine of 2πu.\n//\n// Each function below is a fixed sequence of correctly rounded binary64 operations (+, −, ×, ÷, exact\n// power-of-two scaling through the IEEE 754 bit pattern, Math.round/Math.floor and integer operations), with\n// every constant written as a decimal literal of at most 17 significant digits (ECMAScript converts these\n// exactly to the nearest double). The bits of every result are therefore the same in every conforming\n// JavaScript engine, unlike Math.pow, Math.exp, Math.log, Math.cbrt and Math.cos, which ECMA-262 leaves\n// \"implementation-approximated\" (docs/NUMERICAL_CORRECTNESS.md, \"Cross-engine determinism\").\n//\n// Methods (textbook; no code copied):\n// - Error-free transformations (double-double arithmetic): TwoSum (Knuth, The Art of Computer Programming\n//   vol. 2, §4.2.2), FastTwoSum and TwoProduct with Veltkamp's splitting (Dekker, \"A floating-point technique\n//   for extending the available precision\", Numerische Mathematik 18, 1971). Exact barring overflow and\n//   underflow, which the arguments here cannot reach.\n// - log2(x): x = m·2^e with m in [√½, √2); ln m = 2·atanh(s) = 2(s + s³/3 + s⁵/5 + …), s = (m − 1)/(m + 1),\n//   |s| ≤ 0.1716 (J.-M. Muller, Elementary Functions: Algorithms and Implementation, 3rd ed., 2016, ch. 11).\n//   s carries a double-double correction; the series runs to s²³ (truncation below 2^-62 relative).\n// - 2^t: t = n + r with n = round(t), |r| ≤ ½; 2^r = e^(r·ln 2) by its Taylor series to degree 14 (truncation\n//   below 2^-57 relative), then an exact scaling by 2^n (Muller, ch. 11, \"additive range reduction\").\n// - x^y = 2^(y·log2 x) with log2 x and y·log2 x carried as double-double; e^x = 2^(x·log2 e) and\n//   ∛x = 2^(log2 x / 3) likewise; ln x = log2 x · ln 2; e^x − 1 by its Taylor series for |x| < 1.\n// - cos(2πu), sin(2πu): u = q/4 + r with q = round(4u) and |r| ≤ ⅛ (exact), then the Taylor series of cos and\n//   sin of 2πr to degrees 18 and 19 (truncation below 2^-66).\n//\n// Error bounds (from the operation counts above): portableExp2, portableExp, portableLog, portableLog2 and\n// portableCbrt within 1 ulp; portableExpm1 within 2 ulps; portablePow within 1 ulp for |y| ≤ 4 (the double-double\n// logarithm has relative error below 2^-56, so the error of y·log2 x adds at most |y|·2^-57·ln 2 relative);\n// portableCosTwoPi and portableSinTwoPi within 2 ulps. Checked against 60-digit decimal references (Python decimal)\n// on 2·10⁵ pseudo-random arguments per function (6·10⁵ for portableLog; |y| ≤ 4 and y = 1/2.4, 1.4 for portablePow):\n// largest errors 0.53 ulp (log, log2), 0.86 (exp2), 0.94 (exp, cbrt, pow), 0.97 (pow with y = 1/2.4), 1.59 (cos,\n// sin of 2πu) and 1.66 (e^x − 1); spot values are in test/portable-math.test.ts. These are accuracy bounds;\n// determinism does not depend on them.\n\n/** Bit access to a double: the high 32-bit word is at index HIGH of the view (detected once, so either byte order works). */\n// The tables and constants below are built by expressions marked pure (/* @__PURE__ */), so a bundler drops them from a\n// bundle that uses none of the functions that read them (a capture-only bundle keeps only portableHypot and equalWithinUlps).\nconst BITS = /* @__PURE__ */ new Float64Array(1), WORDS = /* @__PURE__ */ ((): Uint32Array => new Uint32Array(BITS.buffer))();\nconst HIGH = /* @__PURE__ */ ((): number => (new Uint8Array(new Uint16Array([1]).buffer)[0] === 1 ? 1 : 0))(), LOW = 1 - HIGH;\n/** 2^k for every integer k in [−1074, 1023] at POW2[k + 1074], built by exact halving and doubling. */\nconst POW2 = /* @__PURE__ */ ((): Float64Array => {\n  const table = new Float64Array(2098);\n  table[1074] = 1;\n  for (let k = 1; k <= 1023; k++) table[1074 + k] = table[1073 + k]! * 2;\n  for (let k = 1; k <= 1074; k++) table[1074 - k] = table[1075 - k]! / 2;\n  return table;\n})();\n/** v·2^k for an integer k in [−1100, 1100]: one exact multiplication (a single rounding only when the result is subnormal). */\nfunction scaleByPowerOfTwo(v: number, k: number): number {\n  if (k > 1023) return v * POW2[2097]! * POW2[1074 + k - 1023]!;\n  if (k < -1074) return v * POW2[1074 + k + 1074]! * POW2[0]!; // exact first factor (v·2^(k+1074) is normal), one rounding\n  return v * POW2[1074 + k]!;\n}\n// Double-double arithmetic, written out inline below (local variables only, which keeps it fast):\n// - FastTwoSum (|a| ≥ |b| or a = 0): s = a + b, err = b − (s − a), so a + b = s + err exactly;\n// - TwoSum (any a, b): s = a + b, b' = s − a, err = (a − (s − b')) + (b − b');\n// - TwoProduct: p = a·b, err = ((ah·bh − p) + ah·bl + al·bh) + al·bl, with Veltkamp's split\n//   ah = c − (c − a), al = a − ah, c = (2^27 + 1)·a (and likewise for b), so a·b = p + err exactly.\nconst SPLITTER = 134217729; // 2^27 + 1 (Veltkamp)\nconst LN2_HI = 0.6931471805599453, LN2_LO = 2.3190468138462996e-17;\nconst LOG2E_HI = 1.4426950408889634, LOG2E_LO = 2.0355273740931033e-17;\nconst SQRT2 = 1.4142135623730951, TWO_POW_54 = 18014398509481984, MIN_NORMAL = 2.2250738585072014e-308;\n/** Veltkamp halves of a constant (the same values the split gives at each use). */\nfunction splitHigh(a: number): number { const c = SPLITTER * a; return c - (c - a); }\nconst LN2_HI_H = /* @__PURE__ */ splitHigh(LN2_HI), LN2_HI_L = LN2_HI - LN2_HI_H, LOG2E_HI_H = /* @__PURE__ */ splitHigh(LOG2E_HI), LOG2E_HI_L = LOG2E_HI - LOG2E_HI_H;\n/** The low part of the last double-double result (its high part is the return value). */\nconst LOW_PART = /* @__PURE__ */ new Float64Array(1);\n\n/**\n * log2 m for m in [√½, √2] by the atanh series to s²³ (no table): builds LOG2_TABLE once. Returns the high part, the low\n * part in LOW_PART[0]; relative error below 2^-56.\n */\nfunction log2SeriesDoubleDouble(x: number): number {\n  let e = 0;\n  if (x < MIN_NORMAL) { x *= TWO_POW_54; e = -54; }\n  BITS[0] = x;\n  const high = WORDS[HIGH]!;\n  e += (high >>> 20) - 1023;\n  let m = x * POW2[1074 - ((high >>> 20) - 1023)]!; // exact: m in [1, 2)\n  if (m > SQRT2) { m *= 0.5; e += 1; }\n  // s = f/(2 + f) with f = m − 1 (exact), as sHi + sLo: 2 + f = dh + dl exactly (FastTwoSum), then the residual\n  // f − sHi·(dh + dl) with sHi·dh = p + pe exactly (TwoProduct).\n  const f = m - 1, dh = 2 + f, dl = f - (dh - 2), sHi = f / dh, p = sHi * dh;\n  let c = SPLITTER * sHi;\n  const ah = c - (c - sHi), al = sHi - ah;\n  c = SPLITTER * dh;\n  const bh = c - (c - dh), bl = dh - bh, pe = ((ah * bh - p) + ah * bl + al * bh) + al * bl;\n  const sLo = (((f - p) - pe) - sHi * dl) / dh;\n  const z = sHi * sHi;\n  const tail = sHi * z * (0.6666666666666666 + z * (0.4 + z * (0.2857142857142857 + z * (0.2222222222222222 + z * (0.18181818181818182 + z * (0.15384615384615385 +\n    z * (0.13333333333333333 + z * (0.11764705882352941 + z * (0.10526315789473684 + z * (0.09523809523809523 + z * 0.08695652173913043))))))))));\n  // ln m = 2sHi + (2sLo + tail) = lh + ll (FastTwoSum); times log2 e = LOG2E_HI + LOG2E_LO (TwoProduct of the high parts); plus e (TwoSum).\n  const a1 = 2 * sHi, b1 = 2 * sLo + tail, lh = a1 + b1, ll = b1 - (lh - a1), q = lh * LOG2E_HI;\n  c = SPLITTER * lh;\n  const ch = c - (c - lh), cl = lh - ch, qe = ((ch * LOG2E_HI_H - q) + ch * LOG2E_HI_L + cl * LOG2E_HI_H) + cl * LOG2E_HI_L;\n  const pl = qe + (lh * LOG2E_LO + ll * LOG2E_HI);\n  const t = e + q, tb = t - e, te = (e - (t - tb)) + (q - tb), b2 = te + pl, hi = t + b2;\n  LOW_PART[0] = b2 - (hi - t);\n  return hi;\n}\n/** log2(k/128) for k = 90 … 182 (the table's range of k = round(128·m), m in [√½, √2]) as double-doubles. */\nconst LOG2_TABLE_LO = /* @__PURE__ */ new Float64Array(183);\nconst LOG2_TABLE_HI = /* @__PURE__ */ ((): Float64Array => {\n  const table = new Float64Array(183);\n  for (let k = 90; k <= 182; k++) { table[k] = log2SeriesDoubleDouble(k / 128); LOG2_TABLE_LO[k] = LOW_PART[0]!; }\n  return table;\n})();\n/**\n * log2 x as a double-double for finite x > 0: returns the high part, the low part in LOW_PART[0]. x = m·2^e with m in\n * [√½, √2]; m = F·(1 + f/F) with F = k/128, k = round(128·m), so log2 m = log2 F (table) + 2·atanh(s)·log2 e with\n * s = f/(m + F), |s| < 2^-8.4, by its series to s⁷ (truncation below 2^-70 relative). Relative error below 2^-56.\n */\nfunction log2DoubleDouble(x: number): number {\n  let e = 0;\n  if (x < MIN_NORMAL) { x *= TWO_POW_54; e = -54; }\n  BITS[0] = x;\n  const high = WORDS[HIGH]!;\n  e += (high >>> 20) - 1023;\n  let m = x * POW2[1074 - ((high >>> 20) - 1023)]!; // exact: m in [1, 2)\n  if (m > SQRT2) { m *= 0.5; e += 1; }\n  // F = k/128 (exact) and f = m − F (exact, F/2 ≤ m ≤ 2F); m + F = dh + dl exactly (TwoSum); s = f/(dh + dl) as sHi + sLo\n  // from the residual f − sHi·(dh + dl), with sHi·dh = p + pe exactly (TwoProduct).\n  const k = Math.round(m * 128), F = k / 128, f = m - F, dh = m + F, db = dh - m, dl = (m - (dh - db)) + (F - db);\n  const sHi = f / dh, p = sHi * dh;\n  let c = SPLITTER * sHi;\n  const ah = c - (c - sHi), al = sHi - ah;\n  c = SPLITTER * dh;\n  const bh = c - (c - dh), bl = dh - bh, pe = ((ah * bh - p) + ah * bl + al * bh) + al * bl;\n  const sLo = (((f - p) - pe) - sHi * dl) / dh, z = sHi * sHi;\n  const tail = sHi * z * (0.6666666666666666 + z * (0.4 + z * 0.2857142857142857));\n  // ln(m/F) = 2sHi + (2sLo + tail) = lh + ll (FastTwoSum); times log2 e = LOG2E_HI + LOG2E_LO (TwoProduct of the high\n  // parts); plus log2 F (TwoSum with the table's high part), then plus e (TwoSum).\n  const a1 = 2 * sHi, b1 = 2 * sLo + tail, lh = a1 + b1, ll = b1 - (lh - a1), q = lh * LOG2E_HI;\n  c = SPLITTER * lh;\n  const ch = c - (c - lh), cl = lh - ch, qe = ((ch * LOG2E_HI_H - q) + ch * LOG2E_HI_L + cl * LOG2E_HI_H) + cl * LOG2E_HI_L;\n  const pl = qe + (lh * LOG2E_LO + ll * LOG2E_HI), th = LOG2_TABLE_HI[k]!;\n  const t = th + q, tb = t - th, low = ((th - (t - tb)) + (q - tb)) + (pl + LOG2_TABLE_LO[k]!);\n  const u = e + t, ub = u - e, b2 = ((e - (u - ub)) + (t - ub)) + low, hi = u + b2;\n  LOW_PART[0] = b2 - (hi - u);\n  return hi;\n}\n/** 2^(th + tl) for a double-double exponent; within 1 ulp (plus the error the exponent carries). */\nfunction exp2DoubleDouble(th: number, tl: number): number {\n  if (th !== th) return NaN;\n  if (th > 1024) return Infinity;\n  if (th < -1080) return 0;\n  // th = n + r exactly (|r| ≤ ½); w = r·ln 2 = wh + wl (TwoProduct with LN2_HI, plus r·LN2_LO).\n  const n = Math.round(th), r = (th - n) + tl, wh = r * LN2_HI, c = SPLITTER * r, ah = c - (c - r), al = r - ah;\n  const wl = (((ah * LN2_HI_H - wh) + ah * LN2_HI_L + al * LN2_HI_H) + al * LN2_HI_L) + r * LN2_LO;\n  const q = 0.5 + wh * (0.16666666666666666 + wh * (0.041666666666666664 + wh * (0.008333333333333333 + wh * (0.001388888888888889 + wh * (0.0001984126984126984 +\n    wh * (2.48015873015873e-05 + wh * (2.7557319223985893e-06 + wh * (2.755731922398589e-07 + wh * (2.505210838544172e-08 + wh * (2.08767569878681e-09 +\n    wh * (1.6059043836821613e-10 + wh * 1.1470745597729725e-11)))))))))));\n  return scaleByPowerOfTwo(1 + (wh + (wl + wh * wh * q)), n);\n}\n\n/** log2 x, bit-identical in every JavaScript engine (within 1 ulp). 0 → −∞; negative or NaN → NaN; +∞ → +∞. */\nexport function portableLog2(x: number): number {\n  if (!(x > 0)) return x === 0 ? -Infinity : NaN;\n  if (x === Infinity) return Infinity;\n  const h = log2DoubleDouble(x);\n  return h + LOW_PART[0]!;\n}\n/** ln(k/128) for k = 90 … 182 as double-doubles (log2(k/128)·ln 2, TwoProduct with LN2_HI plus the small products). */\nconst LN_TABLE_LO = /* @__PURE__ */ new Float64Array(183);\nconst LN_TABLE_HI = /* @__PURE__ */ ((): Float64Array => {\n  const table = new Float64Array(183);\n  for (let k = 90; k <= 182; k++) {\n    const h = LOG2_TABLE_HI[k]!, l = LOG2_TABLE_LO[k]!, p = h * LN2_HI, c = SPLITTER * h, ah = c - (c - h), al = h - ah;\n    const pe = ((ah * LN2_HI_H - p) + ah * LN2_HI_L + al * LN2_HI_H) + al * LN2_HI_L, lo = pe + (h * LN2_LO + l * LN2_HI), hi = p + lo;\n    table[k] = hi; LN_TABLE_LO[k] = lo - (hi - p);\n  }\n  return table;\n})();\n/** ln 2 = LN2_E_HI + LN2_E_LO with the low 32 bits of LN2_E_HI zero, so e·LN2_E_HI is exact for every exponent e here. */\nconst LN2_E_HI = /* @__PURE__ */ ((): number => { BITS[0] = LN2_HI; WORDS[LOW] = 0; return BITS[0]!; })(), LN2_E_LO = (LN2_HI - LN2_E_HI) + LN2_LO;\n/**\n * Natural logarithm, bit-identical in every JavaScript engine (within 1 ulp). 0 → −∞; negative or NaN → NaN; +∞ → +∞.\n * x = m·2^e, m in [√½, √2]; ln x = e·ln 2 + ln F (table, F = k/128, k = round(128·m)) + 2·atanh(s), s = (m − F)/(m + F),\n * with s as a double-double and the three terms added with TwoSum.\n */\nexport function portableLog(x: number): number {\n  if (!(x > 0)) return x === 0 ? -Infinity : NaN;\n  if (x === Infinity) return Infinity;\n  let e = 0;\n  if (x < MIN_NORMAL) { x *= TWO_POW_54; e = -54; }\n  BITS[0] = x;\n  const high = WORDS[HIGH]!;\n  e += (high >>> 20) - 1023;\n  let m = x * POW2[1074 - ((high >>> 20) - 1023)]!; // exact: m in [1, 2)\n  if (m > SQRT2) { m *= 0.5; e += 1; }\n  const k = Math.round(m * 128), F = k / 128, f = m - F, dh = m + F, db = dh - m, dl = (m - (dh - db)) + (F - db);\n  const sHi = f / dh, p = sHi * dh;\n  let c = SPLITTER * sHi;\n  const ah = c - (c - sHi), al = sHi - ah;\n  c = SPLITTER * dh;\n  const bh = c - (c - dh), bl = dh - bh, pe = ((ah * bh - p) + ah * bl + al * bh) + al * bl;\n  const sLo = (((f - p) - pe) - sHi * dl) / dh, z = sHi * sHi;\n  const tail = sHi * z * (0.6666666666666666 + z * (0.4 + z * 0.2857142857142857));\n  // (e·LN2_E_HI + ln F) + 2sHi with TwoSum errors, then the low parts.\n  const A = e * LN2_E_HI, B = LN_TABLE_HI[k]!, t = A + B, tb = t - A, te = (A - (t - tb)) + (B - tb);\n  const a2 = 2 * sHi, u = t + a2, ub = u - t, ue = (t - (u - ub)) + (a2 - ub);\n  return u + ((te + ue) + ((e * LN2_E_LO + LN_TABLE_LO[k]!) + (2 * sLo + tail)));\n}\n/** 2^x, bit-identical in every JavaScript engine (within 1 ulp). */\nexport function portableExp2(x: number): number { return exp2DoubleDouble(x, 0); }\n/** e^x, bit-identical in every JavaScript engine (within 1 ulp). */\nexport function portableExp(x: number): number {\n  if (x !== x) return NaN;\n  if (x > 710) return Infinity;\n  if (x < -746) return 0;\n  // x·log2 e = th + tl: x·LOG2E_HI = th + te exactly (TwoProduct), plus x·LOG2E_LO.\n  const th = x * LOG2E_HI, c = SPLITTER * x, ah = c - (c - x), al = x - ah;\n  const te = ((ah * LOG2E_HI_H - th) + ah * LOG2E_HI_L + al * LOG2E_HI_H) + al * LOG2E_HI_L;\n  return exp2DoubleDouble(th, te + x * LOG2E_LO);\n}\n/**\n * e^x − 1, bit-identical in every JavaScript engine (within 2 ulps): the Taylor series to degree 20 for |x| < 1\n * (truncation below 2^-60 relative), else portableExp(x) − 1.\n */\nexport function portableExpm1(x: number): number {\n  if (x !== x) return NaN;\n  if (x === 0) return x;\n  if (!(x > -1 && x < 1)) return portableExp(x) - 1;\n  return x + x * x * (0.5 + x * (0.16666666666666666 + x * (0.041666666666666664 + x * (0.008333333333333333 + x * (0.001388888888888889 + x * (0.0001984126984126984 +\n    x * (2.48015873015873e-05 + x * (2.7557319223985893e-06 + x * (2.755731922398589e-07 + x * (2.505210838544172e-08 + x * (2.08767569878681e-09 +\n    x * (1.6059043836821613e-10 + x * (1.1470745597729725e-11 + x * (7.647163731819816e-13 + x * (4.779477332387385e-14 + x * (2.8114572543455206e-15 +\n    x * (1.5619206968586225e-16 + x * (8.22063524662433e-18 + x * 4.110317623312165e-19))))))))))))))))));\n}\n/**\n * x^y for x ≥ 0 and finite y, bit-identical in every JavaScript engine (within 1 ulp for |y| ≤ 4). x = 0 gives 0 for\n * y > 0, 1 for y = 0 and +∞ for y < 0; negative x or a non-finite argument gives NaN (the callers never pass them).\n */\nexport function portablePow(x: number, y: number): number {\n  if (!(x >= 0) || !Number.isFinite(x) || !Number.isFinite(y)) return NaN;\n  if (y === 0 || x === 1) return 1;\n  if (x === 0) return y > 0 ? 0 : Infinity;\n  // y·(lh + ll): lh·y = p + pe exactly (TwoProduct), then FastTwoSum(p, pe + ll·y).\n  const lh = log2DoubleDouble(x), ll = LOW_PART[0]!, p = lh * y;\n  let c = SPLITTER * lh;\n  const ah = c - (c - lh), al = lh - ah;\n  c = SPLITTER * y;\n  const bh = c - (c - y), bl = y - bh, pe = ((ah * bh - p) + ah * bl + al * bh) + al * bl;\n  const b = pe + ll * y, th = p + b;\n  return exp2DoubleDouble(th, b - (th - p));\n}\n/** ∛(2^r) for r = 0, 1, 2 (only scale the cube root's starting value, so their last bits do not matter). */\nconst CBRT_POWERS_OF_TWO = [1, 1.2599210498948732, 1.5874010519681994];\n/**\n * Cube root, bit-identical in every JavaScript engine (within 1 ulp; exact for ±0, ±∞ and cubes of powers of two).\n * |x| = m·2^(3q + r) with m in [1, 2) and r in {0, 1, 2}, w = m·2^r: a cubic fit to ∛m (within 1.7·10⁻⁴) times ∛(2^r),\n * one Halley step y ← y(y³ + 2w)/(2y³ + w) (cubic convergence: below 10⁻¹¹), then one Newton step y + (w − y³)/(3y²)\n * with w − y³ formed exactly (TwoProduct), which leaves only the final rounding and errors near 10⁻²².\n */\nexport function portableCbrt(x: number): number {\n  if (x === 0 || x !== x || !Number.isFinite(x)) return x;\n  let a = x < 0 ? -x : x, shift = 0;\n  if (a < MIN_NORMAL) { a *= TWO_POW_54; shift = -18; }\n  BITS[0] = a;\n  const high = WORDS[HIGH]!, e = (high >>> 20) - 1023, q = Math.floor(e / 3), r = e - 3 * q;\n  const m = a * POW2[1074 - e]!, w = m * CBRT_SCALE[r]!; // exact: m in [1, 2)\n  let y = (0.5561432746078446 + m * (0.5806821751356804 + m * (-0.15894786280039686 + m * 0.022291567104952514))) * CBRT_POWERS_OF_TWO[r]!;\n  const y3 = y * y * y;\n  y = y * (y3 + 2 * w) / (2 * y3 + w);\n  // y² = p + pe exactly; y³ = p·y + pe·y = t + te (TwoProduct of p and y, plus pe·y); w − y³ = (w − t) − te.\n  const p = y * y;\n  let c = SPLITTER * y;\n  const yh = c - (c - y), yl = y - yh, pe = ((yh * yh - p) + yh * yl + yl * yh) + yl * yl, t = p * y;\n  c = SPLITTER * p;\n  const ph = c - (c - p), pll = p - ph, te = (((ph * yh - t) + ph * yl + pll * yh) + pll * yl) + pe * y;\n  const root = scaleByPowerOfTwo(y + ((w - t) - te) / (3 * p), q + shift);\n  return x < 0 ? -root : root;\n}\n/** 2^r for r = 0, 1, 2. */\nconst CBRT_SCALE = [1, 2, 4];\n/** cos(2πr) and sin(2πr) for |r| ≤ ⅛ (Taylor series in z = r²). */\nfunction cosTwoPiReduced(r: number): number {\n  const z = r * r;\n  return 1 + z * (-19.739208802178716 + z * (64.9393940226683 + z * (-85.45681720669373 + z * (60.24464137187666 + z * (-26.4262567833744 + z * (7.903536371318469 +\n    z * (-1.714390711088672 + z * (0.28200596845579123 + z * -0.03638284114254567))))))));\n}\nfunction sinTwoPiReduced(r: number): number {\n  const z = r * r;\n  return r * (6.283185307179586 + z * (-41.34170224039976 + z * (81.60524927607506 + z * (-76.70585975306139 + z * (42.058693944897655 + z * (-15.09464257682299 +\n    z * (3.819952584848282 + z * (-0.7181223017785006 + z * (0.10422916220813984 + z * -0.012031585942120627)))))))));\n}\n/** cos(2πu) for finite u (u in turns), bit-identical in every JavaScript engine (within 2 ulps). */\nexport function portableCosTwoPi(u: number): number {\n  if (!Number.isFinite(u)) return NaN;\n  const t = 4 * u, q = Math.round(t), r = (t - q) / 4, quadrant = ((q % 4) + 4) % 4;\n  return quadrant === 0 ? cosTwoPiReduced(r) : quadrant === 1 ? -sinTwoPiReduced(r) : quadrant === 2 ? -cosTwoPiReduced(r) : sinTwoPiReduced(r);\n}\n/** sin(2πu) for finite u (u in turns), bit-identical in every JavaScript engine (within 2 ulps). */\nexport function portableSinTwoPi(u: number): number {\n  if (!Number.isFinite(u)) return NaN;\n  const t = 4 * u, q = Math.round(t), r = (t - q) / 4, quadrant = ((q % 4) + 4) % 4;\n  return quadrant === 0 ? sinTwoPiReduced(r) : quadrant === 1 ? cosTwoPiReduced(r) : quadrant === 2 ? -sinTwoPiReduced(r) : -cosTwoPiReduced(r);\n}\n"]}

package/dist/core/version.d.ts

@@ -6,4 +6,4 @@
  * own versions. Release checks confirm it matches package.json and the packed package.
  * @see docs/RELEASE_1_0_1.md
  */
-export declare const ENGINE_API_VERSION: "2.4.1";
+export declare const ENGINE_API_VERSION: "2.6.0";

package/dist/core/version.js

@@ -7,5 +7,5 @@
  * own versions. Release checks confirm it matches package.json and the packed package.
  * @see docs/RELEASE_1_0_1.md
  */
-export const ENGINE_API_VERSION = "2.4.1";
+export const ENGINE_API_VERSION = "2.6.0";
 //# sourceMappingURL=version.js.map

package/dist/core/version.js.map

@@ -1 +1 @@
-{"version":3,"file":"version.js","sourceRoot":"","sources":["../../src/core/version.ts"],"names":[],"mappings":"AAAA,sCAAsC;AAEtC;;;;;;;GAOG;AACH,MAAM,CAAC,MAAM,kBAAkB,GAAG,OAAgB,CAAC","sourcesContent":["// SPDX-License-Identifier: Apache-2.0\n\n/**\n * Version of the engine release. Since 1.0.1 it equals the npm package version.\n *\n * New captures and plans record this version as their creator. Archived records keep the\n * version they were made with. Proof-of-concept (POC), schema and model contracts have their\n * own versions. Release checks confirm it matches package.json and the packed package.\n * @see docs/RELEASE_1_0_1.md\n */\nexport const ENGINE_API_VERSION = \"2.4.1\" as const;\n"]}
+{"version":3,"file":"version.js","sourceRoot":"","sources":["../../src/core/version.ts"],"names":[],"mappings":"AAAA,sCAAsC;AAEtC;;;;;;;GAOG;AACH,MAAM,CAAC,MAAM,kBAAkB,GAAG,OAAgB,CAAC","sourcesContent":["// SPDX-License-Identifier: Apache-2.0\n\n/**\n * Version of the engine release. Since 1.0.1 it equals the npm package version.\n *\n * New captures and plans record this version as their creator. Archived records keep the\n * version they were made with. Proof-of-concept (POC), schema and model contracts have their\n * own versions. Release checks confirm it matches package.json and the packed package.\n * @see docs/RELEASE_1_0_1.md\n */\nexport const ENGINE_API_VERSION = \"2.6.0\" as const;\n"]}

package/dist/facade/chart-scenes.d.ts

@@ -361,6 +361,15 @@ export declare function resolveChartScene(input: {
     scene: ChartScene;
     aspect: number;
 }): ResolvedChartScene;
+/**
+ * Internal (not exported from the package): {@link resolveChartScene} with the step wedge's geometric levels computed
+ * with the portable power (`portablePow`, within 1 ulp) instead of `**`, whose last bit differs between JavaScript
+ * engines. Every other value, the geometry and the material order are the same. The display view uses its materials.
+ */
+export declare function resolvePortableChartScene(input: {
+    scene: ChartScene;
+    aspect: number;
+}): ResolvedChartScene;
 /** An axis-aligned rectangle in chart frame units: u0 ≤ u ≤ u1, v0 ≤ v ≤ v1. */
 export interface ChartRectangle {
     u0: number;

package/dist/facade/chart-scenes.js

@@ -23,6 +23,7 @@
  * levels, like the grey ramp: the step (below 0.1 % of the range) is far below sensor noise.
  * @see docs/QUICK_START.md for the chart catalogue and their analytic definitions.
  */
+import { portablePow } from "../core/portable-math.js";
 import { InvalidConfigurationError } from "../core/configuration-error.js";
 import { prepareColorimetricSpectrum } from "../color/color-matching-functions.js";
 import { requireInputObject, requireInputKeys } from "../core/record-validation.js";
@@ -124,6 +125,15 @@ export function resolveChartScene(input) {
         throw new InvalidConfigurationError("Chart aspect must be positive.");
     return resolveScene(scene, aspect, { pictureHeight: 2 * aspect, nested: false });
 }
+/**
+ * Internal (not exported from the package): {@link resolveChartScene} with the step wedge's geometric levels computed
+ * with the portable power (`portablePow`, within 1 ulp) instead of `**`, whose last bit differs between JavaScript
+ * engines. Every other value, the geometry and the material order are the same. The display view uses its materials.
+ */
+export function resolvePortableChartScene(input) {
+    requireInputObject(input, "resolveChartScene input");
+    return resolveScene(input.scene, input.aspect, { pictureHeight: 2 * input.aspect, nested: false, pow: portablePow });
+}
 function resolveScene(scene, aspect, context) {
     requireInputObject(scene, "chart scene");
     const preset = scene.preset;
@@ -209,7 +219,7 @@ function resolveScene(scene, aspect, context) {
                 throw new InvalidConfigurationError("spacing must be equal-density or linear.");
             if (!(hi > lo) || (spacing === "equal-density" && lo <= 0))
                 throw new InvalidConfigurationError("Step wedge needs 0 < minimum < maximum reflectance.");
-            const values = calculateStepWedgeReflectances({ steps, minimumReflectance: lo, maximumReflectance: hi, spacing });
+            const values = stepWedgeReflectances(steps, lo, hi, spacing, context.pow);
             return done({ steps, minimumReflectance: lo, maximumReflectance: hi, spacing, stepReflectances: values }, values.map((reflectanceValue) => ({ kind: "neutral", reflectance: reflectanceValue })), (u) => Math.min(steps - 1, Math.max(0, Math.floor((u + 1) / 2 * steps))));
         }
         case "grey-ramp": {
@@ -390,7 +400,7 @@ function resolveScene(scene, aspect, context) {
             const list = record.elements;
             if (!Array.isArray(list) || list.length < 1 || list.length > 256)
                 throw new InvalidConfigurationError("elements must list 1 to 256 chart elements.");
-            const nested = { pictureHeight: context.pictureHeight, nested: true };
+            const nested = { pictureHeight: context.pictureHeight, nested: true, ...(context.pow ? { pow: context.pow } : {}) };
             const background = resolveScene(get("background"), aspect, nested);
             const materials = [...background.materials], inputs = [...chartMaterialInputs(background)];
             for (const key of background.defaultedParameters)
@@ -410,7 +420,7 @@ function resolveScene(scene, aspect, context) {
                 if (e.mask === undefined)
                     defaulted.push("elements." + index + ".placement.mask");
                 // The element's own frame: u = ±1 across its width; frequencies keep the composite's picture height.
-                const chart = resolveScene(e.scene, height / width, { pictureHeight: context.pictureHeight * 2 / width, nested: true });
+                const chart = resolveScene(e.scene, height / width, { pictureHeight: context.pictureHeight * 2 / width, nested: true, ...(context.pow ? { pow: context.pow } : {}) });
                 for (const key of chart.defaultedParameters)
                     defaulted.push("elements." + index + ".parameters." + key);
                 const offset = materials.length;
@@ -636,11 +646,14 @@ export function calculateStepWedgeReflectances(input) {
         throw new InvalidConfigurationError("spacing must be equal-density or linear.");
     if (!(hi > lo) || (input.spacing === "equal-density" && lo <= 0))
         throw new InvalidConfigurationError("Step wedge needs 0 < minimum < maximum reflectance.");
+    return stepWedgeReflectances(steps, lo, hi, input.spacing, undefined);
+}
+function stepWedgeReflectances(steps, lo, hi, spacing, pow) {
     return Array.from({ length: steps }, (_, k) => {
         if (k === steps - 1)
             return hi;
         const t = k / (steps - 1);
-        return input.spacing === "linear" ? lo + (hi - lo) * t : lo * (hi / lo) ** t;
+        return spacing === "linear" ? lo + (hi - lo) * t : lo * (pow ? pow(hi / lo, t) : (hi / lo) ** t);
     });
 }
 /** Centres (frame units) of a point grid: one disk centred in each of columns × rows equal cells, row-major from the top-left. */