diff-grok 1.0.10 → 1.2.0

package/src/solver-tools/lsoda/blas.js

@@ -0,0 +1,257 @@
+/**
+ * TypeScript port of liblsoda (https://github.com/sdwfrost/liblsoda)
+ * Original LSODA algorithm by Linda Petzold & Alan Hindmarsh (1983)
+ *
+ * Copyright (c) 2011 Yu Feng, McWilliam Cosmology Center, Carnegie Mellon University
+ * Copyright (c) 2016 Simon Frost
+ * Copyright (c) 2026 Datagrok
+ *
+ * Licensed under the MIT License. See THIRD_PARTY_LICENSES for the full
+ * license text and provenance chain of the original code.
+ */
+// BLAS linear algebra routines
+// All arrays are 1-indexed (element [0] unused), matching the C/Fortran convention.
+/**
+ * Compute dy = da * dx + dy
+ * Arrays are 1-indexed with stride incx/incy.
+ */
+export function daxpy(n, da, dx, incx, dy, incy) {
+    if (n < 0 || da === 0.)
+        return;
+    if (incx !== incy || incx < 1) {
+        let ix = 1;
+        let iy = 1;
+        if (incx < 0)
+            ix = (-n + 1) * incx + 1;
+        if (incy < 0)
+            iy = (-n + 1) * incy + 1;
+        for (let i = 1; i <= n; i++) {
+            dy[iy] = dy[iy] + da * dx[ix];
+            ix += incx;
+            iy += incy;
+        }
+        return;
+    }
+    if (incx === 1) {
+        const m = n % 4;
+        if (m !== 0) {
+            for (let i = 1; i <= m; i++)
+                dy[i] = dy[i] + da * dx[i];
+            if (n < 4)
+                return;
+        }
+        for (let i = m + 1; i <= n; i += 4) {
+            dy[i] = dy[i] + da * dx[i];
+            dy[i + 1] = dy[i + 1] + da * dx[i + 1];
+            dy[i + 2] = dy[i + 2] + da * dx[i + 2];
+            dy[i + 3] = dy[i + 3] + da * dx[i + 3];
+        }
+        return;
+    }
+    for (let i = 1; i <= n * incx; i += incx)
+        dy[i] = da * dx[i] + dy[i];
+}
+/**
+ * Compute dot product dx . dy
+ * Arrays are 1-indexed with stride incx/incy.
+ */
+export function ddot(n, dx, incx, dy, incy) {
+    let dotprod = 0.;
+    if (n <= 0)
+        return dotprod;
+    if (incx !== incy || incx < 1) {
+        let ix = 1;
+        let iy = 1;
+        if (incx < 0)
+            ix = (-n + 1) * incx + 1;
+        if (incy < 0)
+            iy = (-n + 1) * incy + 1;
+        for (let i = 1; i <= n; i++) {
+            dotprod += dx[ix] * dy[iy];
+            ix += incx;
+            iy += incy;
+        }
+        return dotprod;
+    }
+    if (incx === 1) {
+        for (let i = 1; i <= n; i++)
+            dotprod += dx[i] * dy[i];
+        return dotprod;
+    }
+    for (let i = 1; i <= n * incx; i += incx)
+        dotprod += dx[i] * dy[i];
+    return dotprod;
+}
+/**
+ * Scale vector: dx = da * dx
+ * Array is 1-indexed with stride incx.
+ */
+export function dscal(n, da, dx, incx) {
+    if (n <= 0)
+        return;
+    if (incx !== 1) {
+        for (let i = 1; i <= n * incx; i += incx)
+            dx[i] = da * dx[i];
+        return;
+    }
+    const m = n % 5;
+    if (m !== 0) {
+        for (let i = 1; i <= m; i++)
+            dx[i] = da * dx[i];
+        if (n < 5)
+            return;
+    }
+    for (let i = m + 1; i <= n; i += 5) {
+        dx[i] = da * dx[i];
+        dx[i + 1] = da * dx[i + 1];
+        dx[i + 2] = da * dx[i + 2];
+        dx[i + 3] = da * dx[i + 3];
+        dx[i + 4] = da * dx[i + 4];
+    }
+}
+/**
+ * Find index of element with maximum absolute value.
+ * Array is 1-indexed. Returns 1-based index (0 if n <= 0).
+ */
+export function idamax(n, dx, incx) {
+    let xindex = 0;
+    if (n <= 0)
+        return xindex;
+    xindex = 1;
+    if (n <= 1 || incx <= 0)
+        return xindex;
+    if (incx !== 1) {
+        let dmax = Math.abs(dx[1]);
+        let ii = 2;
+        for (let i = 1 + incx; i <= n * incx; i += incx) {
+            const xmag = Math.abs(dx[i]);
+            if (xmag > dmax) {
+                xindex = ii;
+                dmax = xmag;
+            }
+            ii++;
+        }
+        return xindex;
+    }
+    let dmax = Math.abs(dx[1]);
+    for (let i = 2; i <= n; i++) {
+        const xmag = Math.abs(dx[i]);
+        if (xmag > dmax) {
+            xindex = i;
+            dmax = xmag;
+        }
+    }
+    return xindex;
+}
+/**
+ * LU factorization by Gaussian elimination with partial pivoting.
+ * a: 2D matrix (a[i][j], 1-indexed rows and columns)
+ * n: matrix dimension
+ * ipvt: pivot indices output (1-indexed)
+ * Returns info: 0 = normal, k = U[k][k] == 0 (singular).
+ */
+export function dgefa(a, n, ipvt) {
+    let info = 0;
+    for (let k = 1; k <= n - 1; k++) {
+        // Find pivot index. a[k] + k - 1 in C => subarray from index k
+        const j = idamax(n - k + 1, a[k].subarray(k - 1), 1) + k - 1;
+        ipvt[k] = j;
+        if (a[k][j] === 0.) {
+            info = k;
+            continue;
+        }
+        // Interchange if necessary
+        if (j !== k) {
+            const t = a[k][j];
+            a[k][j] = a[k][k];
+            a[k][k] = t;
+        }
+        // Compute multipliers
+        const t = -1. / a[k][k];
+        dscal(n - k, t, a[k].subarray(k), 1);
+        // Column elimination with row indexing
+        for (let i = k + 1; i <= n; i++) {
+            const t2 = a[i][j];
+            if (j !== k) {
+                a[i][j] = a[i][k];
+                a[i][k] = t2;
+            }
+            daxpy(n - k, t2, a[k].subarray(k), 1, a[i].subarray(k), 1);
+        }
+    }
+    ipvt[n] = n;
+    if (a[n][n] === 0.)
+        info = n;
+    return info;
+}
+/**
+ * Solve linear system using LU factors from dgefa.
+ * a: LU factored matrix (1-indexed)
+ * n: dimension
+ * ipvt: pivot indices (1-indexed)
+ * b: right-hand side on input, solution on output (1-indexed)
+ * job: 0 = solve A*x=b, nonzero = solve A^T*x=b
+ */
+export function dgesl(a, n, ipvt, b, job) {
+    if (job === 0) {
+        // Solve L * y = b
+        for (let k = 1; k <= n; k++) {
+            const t = ddot(k - 1, a[k], 1, b, 1);
+            b[k] = (b[k] - t) / a[k][k];
+        }
+        // Solve U * x = y
+        for (let k = n - 1; k >= 1; k--) {
+            b[k] = b[k] + ddot(n - k, a[k].subarray(k), 1, b.subarray(k), 1);
+            const j = ipvt[k];
+            if (j !== k) {
+                const t = b[j];
+                b[j] = b[k];
+                b[k] = t;
+            }
+        }
+        return;
+    }
+    // Solve Transpose(U) * y = b
+    for (let k = 1; k <= n - 1; k++) {
+        const j = ipvt[k];
+        const t = b[j];
+        if (j !== k) {
+            b[j] = b[k];
+            b[k] = t;
+        }
+        daxpy(n - k, t, a[k].subarray(k), 1, b.subarray(k), 1);
+    }
+    // Solve Transpose(L) * x = y
+    for (let k = n; k >= 1; k--) {
+        b[k] = b[k] / a[k][k];
+        const t = -b[k];
+        daxpy(k - 1, t, a[k], 1, b, 1);
+    }
+}
+/**
+ * Weighted max-norm: max(i=1..n) |v[i]| * w[i]
+ * Arrays are 1-indexed.
+ */
+export function vmnorm(n, v, w) {
+    let vm = 0.;
+    for (let i = 1; i <= n; i++)
+        vm = Math.max(vm, Math.abs(v[i]) * w[i]);
+    return vm;
+}
+/**
+ * Weighted matrix norm consistent with vmnorm.
+ * fnorm = max(i=1..n) ( w[i] * sum(j=1..n) |a[i][j]| / w[j] )
+ * a is 2D (1-indexed), w is 1-indexed.
+ */
+export function fnorm(n, a, w) {
+    let an = 0.;
+    for (let i = 1; i <= n; i++) {
+        let sum = 0.;
+        const ap1 = a[i];
+        for (let j = 1; j <= n; j++)
+            sum += Math.abs(ap1[j]) / w[j];
+        an = Math.max(an, sum * w[i]);
+    }
+    return an;
+}
+//# sourceMappingURL=blas.js.map

package/src/solver-tools/lsoda/blas.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"blas.js","sourceRoot":"","sources":["blas.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAEH,+BAA+B;AAC/B,oFAAoF;AAEpF;;;GAGG;AACH,MAAM,UAAU,KAAK,CACnB,CAAS,EAAE,EAAU,EAAE,EAAgB,EAAE,IAAY,EACrD,EAAgB,EAAE,IAAY;IAE9B,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,KAAK,EAAE;QAAE,OAAO;IAE/B,IAAI,IAAI,KAAK,IAAI,IAAI,IAAI,GAAG,CAAC,EAAE,CAAC;QAC9B,IAAI,EAAE,GAAG,CAAC,CAAC;QACX,IAAI,EAAE,GAAG,CAAC,CAAC;QACX,IAAI,IAAI,GAAG,CAAC;YAAE,EAAE,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC;QACvC,IAAI,IAAI,GAAG,CAAC;YAAE,EAAE,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC;QACvC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC5B,EAAE,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC;YAC9B,EAAE,IAAI,IAAI,CAAC;YACX,EAAE,IAAI,IAAI,CAAC;QACb,CAAC;QACD,OAAO;IACT,CAAC;IAED,IAAI,IAAI,KAAK,CAAC,EAAE,CAAC;QACf,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAChB,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;YACZ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE;gBACzB,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;YAC7B,IAAI,CAAC,GAAG,CAAC;gBAAE,OAAO;QACpB,CAAC;QACD,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;YACnC,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;YAC3B,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YACvC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YACvC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACzC,CAAC;QACD,OAAO;IACT,CAAC;IAED,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,GAAG,IAAI,EAAE,CAAC,IAAI,IAAI;QACtC,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;AAC/B,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,IAAI,CAClB,CAAS,EAAE,EAAgB,EAAE,IAAY,EACzC,EAAgB,EAAE,IAAY;IAE9B,IAAI,OAAO,GAAG,EAAE,CAAC;IACjB,IAAI,CAAC,IAAI,CAAC;QAAE,OAAO,OAAO,CAAC;IAE3B,IAAI,IAAI,KAAK,IAAI,IAAI,IAAI,GAAG,CAAC,EAAE,CAAC;QAC9B,IAAI,EAAE,GAAG,CAAC,CAAC;QACX,IAAI,EAAE,GAAG,CAAC,CAAC;QACX,IAAI,IAAI,GAAG,CAAC;YAAE,EAAE,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC;QACvC,IAAI,IAAI,GAAG,CAAC;YAAE,EAAE,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC;QACvC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC5B,OAAO,IAAI,EAAE,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC;YAC3B,EAAE,IAAI,IAAI,CAAC;YACX,EAAE,IAAI,IAAI,CAAC;QACb,CAAC;QACD,OAAO,OAAO,CAAC;IACjB,CAAC;IAED,IAAI,IAAI,KAAK,CAAC,EAAE,CAAC;QACf,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE;YACzB,OAAO,IAAI,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;QAC3B,OAAO,OAAO,CAAC;IACjB,CAAC;IAED,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,GAAG,IAAI,EAAE,CAAC,IAAI,IAAI;QACtC,OAAO,IAAI,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;IAC3B,OAAO,OAAO,CAAC;AACjB,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,KAAK,CAAC,CAAS,EAAE,EAAU,EAAE,EAAgB,EAAE,IAAY;IACzE,IAAI,CAAC,IAAI,CAAC;QAAE,OAAO;IAEnB,IAAI,IAAI,KAAK,CAAC,EAAE,CAAC;QACf,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,GAAG,IAAI,EAAE,CAAC,IAAI,IAAI;YACtC,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;QACrB,OAAO;IACT,CAAC;IAED,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IAChB,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;QACZ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE;YACzB,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;QACrB,IAAI,CAAC,GAAG,CAAC;YAAE,OAAO;IACpB,CAAC;IACD,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QACnC,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;QACnB,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAC3B,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAC3B,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAC3B,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAC7B,CAAC;AACH,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,MAAM,CAAC,CAAS,EAAE,EAAgB,EAAE,IAAY;IAC9D,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,IAAI,CAAC,IAAI,CAAC;QAAE,OAAO,MAAM,CAAC;IAC1B,MAAM,GAAG,CAAC,CAAC;IACX,IAAI,CAAC,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC;QAAE,OAAO,MAAM,CAAC;IAEvC,IAAI,IAAI,KAAK,CAAC,EAAE,CAAC;QACf,IAAI,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QAC3B,IAAI,EAAE,GAAG,CAAC,CAAC;QACX,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,IAAI,EAAE,CAAC,IAAI,CAAC,GAAG,IAAI,EAAE,CAAC,IAAI,IAAI,EAAE,CAAC;YAChD,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;YAC7B,IAAI,IAAI,GAAG,IAAI,EAAE,CAAC;gBAChB,MAAM,GAAG,EAAE,CAAC;gBACZ,IAAI,GAAG,IAAI,CAAC;YACd,CAAC;YACD,EAAE,EAAE,CAAC;QACP,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,IAAI,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAC3B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC5B,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QAC7B,IAAI,IAAI,GAAG,IAAI,EAAE,CAAC;YAChB,MAAM,GAAG,CAAC,CAAC;YACX,IAAI,GAAG,IAAI,CAAC;QACd,CAAC;IACH,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,KAAK,CAAC,CAAiB,EAAE,CAAS,EAAE,IAAgB;IAClE,IAAI,IAAI,GAAG,CAAC,CAAC;IAEb,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAChC,+DAA+D;QAC/D,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAC7D,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QAEZ,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC;YACnB,IAAI,GAAG,CAAC,CAAC;YACT,SAAS;QACX,CAAC;QAED,2BAA2B;QAC3B,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;YACZ,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAClB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAClB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QACd,CAAC;QAED,sBAAsB;QACtB,MAAM,CAAC,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACxB,KAAK,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAErC,uCAAuC;QACvC,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAChC,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YACnB,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;gBACZ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBAClB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC;YACf,CAAC;YACD,KAAK,CAAC,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAC7D,CAAC;IACH,CAAC;IAED,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IACZ,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,EAAE;QAAE,IAAI,GAAG,CAAC,CAAC;IAC7B,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,KAAK,CACnB,CAAiB,EAAE,CAAS,EAAE,IAAgB,EAC9C,CAAe,EAAE,GAAW;IAE5B,IAAI,GAAG,KAAK,CAAC,EAAE,CAAC;QACd,kBAAkB;QAClB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC5B,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YACrC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC9B,CAAC;QACD,kBAAkB;QAClB,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAChC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YACjE,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;YAClB,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;gBACZ,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;gBACf,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;gBACZ,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;YACX,CAAC;QACH,CAAC;QACD,OAAO;IACT,CAAC;IAED,6BAA6B;IAC7B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAChC,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;QAClB,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACf,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;YACZ,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YACZ,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QACX,CAAC;QACD,KAAK,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACzD,CAAC;IACD,6BAA6B;IAC7B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC5B,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACtB,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAChB,KAAK,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IACjC,CAAC;AACH,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,MAAM,CAAC,CAAS,EAAE,CAAe,EAAE,CAAe;IAChE,IAAI,EAAE,GAAG,EAAE,CAAC;IACZ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE;QACzB,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC3C,OAAO,EAAE,CAAC;AACZ,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,KAAK,CAAC,CAAS,EAAE,CAAiB,EAAE,CAAe;IACjE,IAAI,EAAE,GAAG,EAAE,CAAC;IACZ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC5B,IAAI,GAAG,GAAG,EAAE,CAAC;QACb,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACjB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE;YACzB,GAAG,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACjC,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAChC,CAAC;IACD,OAAO,EAAE,CAAC;AACZ,CAAC"}

package/src/solver-tools/lsoda/blas.ts

@@ -0,0 +1,279 @@
+/**
+ * TypeScript port of liblsoda (https://github.com/sdwfrost/liblsoda)
+ * Original LSODA algorithm by Linda Petzold & Alan Hindmarsh (1983)
+ *
+ * Copyright (c) 2011 Yu Feng, McWilliam Cosmology Center, Carnegie Mellon University
+ * Copyright (c) 2016 Simon Frost
+ * Copyright (c) 2026 Datagrok
+ *
+ * Licensed under the MIT License. See THIRD_PARTY_LICENSES for the full
+ * license text and provenance chain of the original code.
+ */
+
+// BLAS linear algebra routines
+// All arrays are 1-indexed (element [0] unused), matching the C/Fortran convention.
+
+/**
+ * Compute dy = da * dx + dy
+ * Arrays are 1-indexed with stride incx/incy.
+ */
+export function daxpy(
+  n: number, da: number, dx: Float64Array, incx: number,
+  dy: Float64Array, incy: number,
+): void {
+  if (n < 0 || da === 0.) return;
+
+  if (incx !== incy || incx < 1) {
+    let ix = 1;
+    let iy = 1;
+    if (incx < 0) ix = (-n + 1) * incx + 1;
+    if (incy < 0) iy = (-n + 1) * incy + 1;
+    for (let i = 1; i <= n; i++) {
+      dy[iy] = dy[iy] + da * dx[ix];
+      ix += incx;
+      iy += incy;
+    }
+    return;
+  }
+
+  if (incx === 1) {
+    const m = n % 4;
+    if (m !== 0) {
+      for (let i = 1; i <= m; i++)
+        dy[i] = dy[i] + da * dx[i];
+      if (n < 4) return;
+    }
+    for (let i = m + 1; i <= n; i += 4) {
+      dy[i] = dy[i] + da * dx[i];
+      dy[i + 1] = dy[i + 1] + da * dx[i + 1];
+      dy[i + 2] = dy[i + 2] + da * dx[i + 2];
+      dy[i + 3] = dy[i + 3] + da * dx[i + 3];
+    }
+    return;
+  }
+
+  for (let i = 1; i <= n * incx; i += incx)
+    dy[i] = da * dx[i] + dy[i];
+}
+
+/**
+ * Compute dot product dx . dy
+ * Arrays are 1-indexed with stride incx/incy.
+ */
+export function ddot(
+  n: number, dx: Float64Array, incx: number,
+  dy: Float64Array, incy: number,
+): number {
+  let dotprod = 0.;
+  if (n <= 0) return dotprod;
+
+  if (incx !== incy || incx < 1) {
+    let ix = 1;
+    let iy = 1;
+    if (incx < 0) ix = (-n + 1) * incx + 1;
+    if (incy < 0) iy = (-n + 1) * incy + 1;
+    for (let i = 1; i <= n; i++) {
+      dotprod += dx[ix] * dy[iy];
+      ix += incx;
+      iy += incy;
+    }
+    return dotprod;
+  }
+
+  if (incx === 1) {
+    for (let i = 1; i <= n; i++)
+      dotprod += dx[i] * dy[i];
+    return dotprod;
+  }
+
+  for (let i = 1; i <= n * incx; i += incx)
+    dotprod += dx[i] * dy[i];
+  return dotprod;
+}
+
+/**
+ * Scale vector: dx = da * dx
+ * Array is 1-indexed with stride incx.
+ */
+export function dscal(n: number, da: number, dx: Float64Array, incx: number): void {
+  if (n <= 0) return;
+
+  if (incx !== 1) {
+    for (let i = 1; i <= n * incx; i += incx)
+      dx[i] = da * dx[i];
+    return;
+  }
+
+  const m = n % 5;
+  if (m !== 0) {
+    for (let i = 1; i <= m; i++)
+      dx[i] = da * dx[i];
+    if (n < 5) return;
+  }
+  for (let i = m + 1; i <= n; i += 5) {
+    dx[i] = da * dx[i];
+    dx[i + 1] = da * dx[i + 1];
+    dx[i + 2] = da * dx[i + 2];
+    dx[i + 3] = da * dx[i + 3];
+    dx[i + 4] = da * dx[i + 4];
+  }
+}
+
+/**
+ * Find index of element with maximum absolute value.
+ * Array is 1-indexed. Returns 1-based index (0 if n <= 0).
+ */
+export function idamax(n: number, dx: Float64Array, incx: number): number {
+  let xindex = 0;
+  if (n <= 0) return xindex;
+  xindex = 1;
+  if (n <= 1 || incx <= 0) return xindex;
+
+  if (incx !== 1) {
+    let dmax = Math.abs(dx[1]);
+    let ii = 2;
+    for (let i = 1 + incx; i <= n * incx; i += incx) {
+      const xmag = Math.abs(dx[i]);
+      if (xmag > dmax) {
+        xindex = ii;
+        dmax = xmag;
+      }
+      ii++;
+    }
+    return xindex;
+  }
+
+  let dmax = Math.abs(dx[1]);
+  for (let i = 2; i <= n; i++) {
+    const xmag = Math.abs(dx[i]);
+    if (xmag > dmax) {
+      xindex = i;
+      dmax = xmag;
+    }
+  }
+  return xindex;
+}
+
+/**
+ * LU factorization by Gaussian elimination with partial pivoting.
+ * a: 2D matrix (a[i][j], 1-indexed rows and columns)
+ * n: matrix dimension
+ * ipvt: pivot indices output (1-indexed)
+ * Returns info: 0 = normal, k = U[k][k] == 0 (singular).
+ */
+export function dgefa(a: Float64Array[], n: number, ipvt: Int32Array): number {
+  let info = 0;
+
+  for (let k = 1; k <= n - 1; k++) {
+    // Find pivot index. a[k] + k - 1 in C => subarray from index k
+    const j = idamax(n - k + 1, a[k].subarray(k - 1), 1) + k - 1;
+    ipvt[k] = j;
+
+    if (a[k][j] === 0.) {
+      info = k;
+      continue;
+    }
+
+    // Interchange if necessary
+    if (j !== k) {
+      const t = a[k][j];
+      a[k][j] = a[k][k];
+      a[k][k] = t;
+    }
+
+    // Compute multipliers
+    const t = -1. / a[k][k];
+    dscal(n - k, t, a[k].subarray(k), 1);
+
+    // Column elimination with row indexing
+    for (let i = k + 1; i <= n; i++) {
+      const t2 = a[i][j];
+      if (j !== k) {
+        a[i][j] = a[i][k];
+        a[i][k] = t2;
+      }
+      daxpy(n - k, t2, a[k].subarray(k), 1, a[i].subarray(k), 1);
+    }
+  }
+
+  ipvt[n] = n;
+  if (a[n][n] === 0.) info = n;
+  return info;
+}
+
+/**
+ * Solve linear system using LU factors from dgefa.
+ * a: LU factored matrix (1-indexed)
+ * n: dimension
+ * ipvt: pivot indices (1-indexed)
+ * b: right-hand side on input, solution on output (1-indexed)
+ * job: 0 = solve A*x=b, nonzero = solve A^T*x=b
+ */
+export function dgesl(
+  a: Float64Array[], n: number, ipvt: Int32Array,
+  b: Float64Array, job: number,
+): void {
+  if (job === 0) {
+    // Solve L * y = b
+    for (let k = 1; k <= n; k++) {
+      const t = ddot(k - 1, a[k], 1, b, 1);
+      b[k] = (b[k] - t) / a[k][k];
+    }
+    // Solve U * x = y
+    for (let k = n - 1; k >= 1; k--) {
+      b[k] = b[k] + ddot(n - k, a[k].subarray(k), 1, b.subarray(k), 1);
+      const j = ipvt[k];
+      if (j !== k) {
+        const t = b[j];
+        b[j] = b[k];
+        b[k] = t;
+      }
+    }
+    return;
+  }
+
+  // Solve Transpose(U) * y = b
+  for (let k = 1; k <= n - 1; k++) {
+    const j = ipvt[k];
+    const t = b[j];
+    if (j !== k) {
+      b[j] = b[k];
+      b[k] = t;
+    }
+    daxpy(n - k, t, a[k].subarray(k), 1, b.subarray(k), 1);
+  }
+  // Solve Transpose(L) * x = y
+  for (let k = n; k >= 1; k--) {
+    b[k] = b[k] / a[k][k];
+    const t = -b[k];
+    daxpy(k - 1, t, a[k], 1, b, 1);
+  }
+}
+
+/**
+ * Weighted max-norm: max(i=1..n) |v[i]| * w[i]
+ * Arrays are 1-indexed.
+ */
+export function vmnorm(n: number, v: Float64Array, w: Float64Array): number {
+  let vm = 0.;
+  for (let i = 1; i <= n; i++)
+    vm = Math.max(vm, Math.abs(v[i]) * w[i]);
+  return vm;
+}
+
+/**
+ * Weighted matrix norm consistent with vmnorm.
+ * fnorm = max(i=1..n) ( w[i] * sum(j=1..n) |a[i][j]| / w[j] )
+ * a is 2D (1-indexed), w is 1-indexed.
+ */
+export function fnorm(n: number, a: Float64Array[], w: Float64Array): number {
+  let an = 0.;
+  for (let i = 1; i <= n; i++) {
+    let sum = 0.;
+    const ap1 = a[i];
+    for (let j = 1; j <= n; j++)
+      sum += Math.abs(ap1[j]) / w[j];
+    an = Math.max(an, sum * w[i]);
+  }
+  return an;
+}

package/src/solver-tools/lsoda/cfode.js

@@ -0,0 +1,84 @@
+/**
+ * TypeScript port of liblsoda (https://github.com/sdwfrost/liblsoda)
+ * Original LSODA algorithm by Linda Petzold & Alan Hindmarsh (1983)
+ *
+ * Copyright (c) 2011 Yu Feng, McWilliam Cosmology Center, Carnegie Mellon University
+ * Copyright (c) 2016 Simon Frost
+ * Copyright (c) 2026 Datagrok
+ *
+ * Licensed under the MIT License. See THIRD_PARTY_LICENSES for the full
+ * license text and provenance chain of the original code.
+ */
+/**
+ * Set coefficients for the current method.
+ * Computes elco and tesco arrays for all orders.
+ * meth=1: Adams (orders 1-12), meth=2: BDF (orders 1-5).
+ */
+export function cfode(ctx, meth) {
+    const c = ctx.common;
+    const pc = new Float64Array(13);
+    if (meth === 1) {
+        c.elco[1][1] = 1.;
+        c.elco[1][2] = 1.;
+        c.tesco[1][1] = 0.;
+        c.tesco[1][2] = 2.;
+        c.tesco[2][1] = 1.;
+        c.tesco[12][3] = 0.;
+        pc[1] = 1.;
+        let rqfac = 1.;
+        for (let nq = 2; nq <= 12; nq++) {
+            const rq1fac = rqfac;
+            rqfac = rqfac / nq;
+            const nqm1 = nq - 1;
+            const fnqm1 = nqm1;
+            const nqp1 = nq + 1;
+            // Form coefficients of p(x)*(x+nq-1)
+            pc[nq] = 0.;
+            for (let i = nq; i >= 2; i--)
+                pc[i] = pc[i - 1] + fnqm1 * pc[i];
+            pc[1] = fnqm1 * pc[1];
+            // Compute integral, -1 to 0, of p(x) and x*p(x)
+            let pint = pc[1];
+            let xpin = pc[1] / 2.;
+            let tsign = 1.;
+            for (let i = 2; i <= nq; i++) {
+                tsign = -tsign;
+                pint += tsign * pc[i] / i;
+                xpin += tsign * pc[i] / (i + 1);
+            }
+            // Store coefficients in elco and tesco
+            c.elco[nq][1] = pint * rq1fac;
+            c.elco[nq][2] = 1.;
+            for (let i = 2; i <= nq; i++)
+                c.elco[nq][i + 1] = rq1fac * pc[i] / i;
+            const agamq = rqfac * xpin;
+            const ragq = 1. / agamq;
+            c.tesco[nq][2] = ragq;
+            if (nq < 12)
+                c.tesco[nqp1][1] = ragq * rqfac / nqp1;
+            c.tesco[nqm1][3] = ragq;
+        }
+        return;
+    }
+    // meth = 2 (BDF)
+    pc[1] = 1.;
+    let rq1fac = 1.;
+    for (let nq = 1; nq <= 5; nq++) {
+        const fnq = nq;
+        const nqp1 = nq + 1;
+        // Form coefficients of p(x)*(x+nq)
+        pc[nqp1] = 0.;
+        for (let i = nq + 1; i >= 2; i--)
+            pc[i] = pc[i - 1] + fnq * pc[i];
+        pc[1] *= fnq;
+        // Store coefficients in elco and tesco
+        for (let i = 1; i <= nqp1; i++)
+            c.elco[nq][i] = pc[i] / pc[2];
+        c.elco[nq][2] = 1.;
+        c.tesco[nq][1] = rq1fac;
+        c.tesco[nq][2] = nqp1 / c.elco[nq][1];
+        c.tesco[nq][3] = (nq + 2) / c.elco[nq][1];
+        rq1fac /= fnq;
+    }
+}
+//# sourceMappingURL=cfode.js.map

package/src/solver-tools/lsoda/cfode.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"cfode.js","sourceRoot":"","sources":["cfode.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAIH;;;;GAIG;AACH,MAAM,UAAU,KAAK,CAAC,GAAiB,EAAE,IAAY;IACnD,MAAM,CAAC,GAAG,GAAG,CAAC,MAAO,CAAC;IACtB,MAAM,EAAE,GAAG,IAAI,YAAY,CAAC,EAAE,CAAC,CAAC;IAEhC,IAAI,IAAI,KAAK,CAAC,EAAE,CAAC;QACf,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC;QAClB,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC;QAClB,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC;QACnB,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC;QACnB,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC;QACnB,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC;QACpB,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC;QACX,IAAI,KAAK,GAAG,EAAE,CAAC;QAEf,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,IAAI,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC;YAChC,MAAM,MAAM,GAAG,KAAK,CAAC;YACrB,KAAK,GAAG,KAAK,GAAG,EAAE,CAAC;YACnB,MAAM,IAAI,GAAG,EAAE,GAAG,CAAC,CAAC;YACpB,MAAM,KAAK,GAAG,IAAI,CAAC;YACnB,MAAM,IAAI,GAAG,EAAE,GAAG,CAAC,CAAC;YAEpB,qCAAqC;YACrC,EAAE,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC;YACZ,KAAK,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE;gBAC1B,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,KAAK,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;YACpC,EAAE,CAAC,CAAC,CAAC,GAAG,KAAK,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;YAEtB,gDAAgD;YAChD,IAAI,IAAI,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;YACjB,IAAI,IAAI,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC;YACtB,IAAI,KAAK,GAAG,EAAE,CAAC;YACf,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC7B,KAAK,GAAG,CAAC,KAAK,CAAC;gBACf,IAAI,IAAI,KAAK,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;gBAC1B,IAAI,IAAI,KAAK,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAClC,CAAC;YAED,uCAAuC;YACvC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,GAAG,MAAM,CAAC;YAC9B,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC;YACnB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE;gBAC1B,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,MAAM,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;YACzC,MAAM,KAAK,GAAG,KAAK,GAAG,IAAI,CAAC;YAC3B,MAAM,IAAI,GAAG,EAAE,GAAG,KAAK,CAAC;YACxB,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;YACtB,IAAI,EAAE,GAAG,EAAE;gBACT,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,GAAG,KAAK,GAAG,IAAI,CAAC;YACzC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;QAC1B,CAAC;QACD,OAAO;IACT,CAAC;IAED,iBAAiB;IACjB,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC;IACX,IAAI,MAAM,GAAG,EAAE,CAAC;IAEhB,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC;QAC/B,MAAM,GAAG,GAAG,EAAE,CAAC;QACf,MAAM,IAAI,GAAG,EAAE,GAAG,CAAC,CAAC;QAEpB,mCAAmC;QACnC,EAAE,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC;QACd,KAAK,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE;YAC9B,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,GAAG,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;QAClC,EAAE,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC;QAEb,uCAAuC;QACvC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,IAAI,EAAE,CAAC,EAAE;YAC5B,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;QAChC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC;QACnB,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC;QACxB,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QACtC,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QAC1C,MAAM,IAAI,GAAG,CAAC;IAChB,CAAC;AACH,CAAC"}