diff-grok 1.0.10 → 1.1.0

package/src/solver-tools/ab5-method.ts

@@ -0,0 +1,397 @@
+/* The Adams-Bashforth-Moulton predictor-corrector method of order 5 (AB5).
+
+   Uses the 5-step Adams-Bashforth formula as predictor and the 4-step
+   Adams-Moulton formula as corrector in PECE mode (Predict-Evaluate-
+   Correct-Evaluate), with Milne's device for local error estimation.
+   Bootstrapping is performed using the Runge-Kutta-Fehlberg 4(5) method.
+
+   References:
+   [1] E. Hairer, S.P. Norsett, G. Wanner, "Solving Ordinary Differential
+       Equations I: Nonstiff Problems", Springer, 2nd ed., 1993.
+   [2] L.F. Shampine, M.K. Gordon, "Computer Solution of Ordinary Differential
+       Equations: The Initial Value Problem", W.H. Freeman, 1975.
+*/
+
+import {ODEs, max, abs, SAFETY, PSHRNK, PSGROW, REDUCE_COEF, GROW_COEF,
+  ERR_CONTR, TINY, ERROR_MSG} from './solver-defs';
+import {Callback} from './callbacks/callback-base';
+
+// Adams-Bashforth 5-step coefficients (pre-divided by 720)
+// y_{n+1} = y_n + h * (AB0*f_n + AB1*f_{n-1} + AB2*f_{n-2} + AB3*f_{n-3} + AB4*f_{n-4})
+const AB0 = 1901.0 / 720.0;
+const AB1 = -2774.0 / 720.0;
+const AB2 = 2616.0 / 720.0;
+const AB3 = -1274.0 / 720.0;
+const AB4 = 251.0 / 720.0;
+
+// Adams-Moulton 4-step coefficients (pre-divided by 720)
+// y_{n+1} = y_n + h * (AM_NEW*f_{n+1} + AM0*f_n + AM1*f_{n-1} + AM2*f_{n-2} + AM3*f_{n-3})
+const AM_NEW = 251.0 / 720.0;
+const AM0 = 646.0 / 720.0;
+const AM1 = -264.0 / 720.0;
+const AM2 = 106.0 / 720.0;
+const AM3 = -19.0 / 720.0;
+
+// Milne error estimation coefficient for the AB5-AM4 pair: 2/27 = 38/513
+const MILNE = 2.0 / 27.0;
+
+// Number of uniformly-spaced history points required for AB5
+const HIST_LEN = 5;
+
+// Fehlberg 4(5) Butcher tableau coefficients (used during bootstrap phase)
+const C2 = 1.0 / 4.0;
+const C3 = 3.0 / 8.0;
+const C4 = 12.0 / 13.0;
+const C6 = 1.0 / 2.0;
+
+const A21 = 1.0 / 4.0;
+const A31 = 3.0 / 32.0;
+const A32 = 9.0 / 32.0;
+const A41 = 1932.0 / 2197.0;
+const A42 = -7200.0 / 2197.0;
+const A43 = 7296.0 / 2197.0;
+const A51 = 439.0 / 216.0;
+const A52 = -8.0;
+const A53 = 3680.0 / 513.0;
+const A54 = -845.0 / 4104.0;
+const A61 = -8.0 / 27.0;
+const A62 = 2.0;
+const A63 = -3544.0 / 2565.0;
+const A64 = 1859.0 / 4104.0;
+const A65 = -11.0 / 40.0;
+
+const B1 = 25.0 / 216.0;
+const B3 = 1408.0 / 2565.0;
+const B4 = 2197.0 / 4104.0;
+const B5 = -1.0 / 5.0;
+
+const RKE1 = 1.0 / 360.0;
+const RKE3 = -128.0 / 4275.0;
+const RKE4 = -2197.0 / 75240.0;
+const RKE5 = 1.0 / 50.0;
+const RKE6 = 2.0 / 55.0;
+
+/** Solve initial value problem using the Adams-Bashforth-Moulton predictor-corrector method of order 5
+ * @param odes initial value problem for ordinary differential equations
+ * @param callback computations control callback
+ * @returns solution of the problem
+ * @example
+ * // Example. Solve the following initial value problem using the AB5 method:
+ * //   dx/dt = x + y - t
+ * //   dy/dt = x * y + t
+ * //   x(0) = 1
+ * //   y(0) = -1
+ * // on [0, 2] with the step 0.01.
+ * import { ODEs, ab5 } from 'diff-grok';
+ *
+ * const task: ODEs = {
+ *   name: 'Example', // name of your model
+ *   arg: {
+ *       name: 't',  // name of the argument
+ *       start: 0,   // initial value of the argument
+ *       finish: 2,  // final value of the argument
+ *       step: 0.01, // solution grid step
+ *   },
+ *   initial: [1, -1], // initial values
+ *   func: (t: number, y: Float64Array, output: Float64Array) => { // right-hand side of the system
+ *     output[0] = y[0] + y[1] - t; // 1-st equation
+ *     output[1] = y[0] * y[1] + t; // 2-nd equation
+ *   },
+ *   tolerance: 1e-7, // tolerance
+ *   solutionColNames: ['x', 'y'], // names of solution functions
+ * };
+ *
+ * try {
+ *   // Solve the problem using the AB5 method
+ *   const solution = ab5(task);
+ *
+ *   // Print a table with the results
+ *   console.log(task.arg.name, task.solutionColNames[0], task.solutionColNames[1]);
+ *   const length = solution[0].length;
+ *   for (let i = 0; i < length; ++i)
+ *     console.log(solution[0][i], solution[1][i], solution[2][i]);
+ * } catch (err) {
+ *   console.log('Solver failed: ', err instanceof Error ? err.message : 'Unknown problem!');
+ * }
+*/
+export function ab5(odes: ODEs, callback?: Callback): Float64Array[] {
+  const f = odes.func;
+
+  // operating variables
+  const t0 = odes.arg.start;
+  const t1 = odes.arg.finish;
+  let h = odes.arg.step;
+  const hDataframe = h;
+  const hMax = hDataframe * 10;
+  const tolerance = odes.tolerance;
+
+  const rowCount = Math.trunc((t1 - t0) / h) + 1;
+  const dim = odes.initial.length;
+
+  // result arrays
+  const tArr = new Float64Array(rowCount);
+  const yArrs = Array<Float64Array>(dim);
+
+  for (let i = 0; i < dim; ++i)
+    yArrs[i] = new Float64Array(rowCount);
+
+  // method routine
+  let timeDataframe = t0 + hDataframe;
+  let t = t0;
+  let tPrev = t0;
+  let hNext = 0.0;
+  let flag = true;
+  let index = 1;
+  let errmax = 0;
+  let hTemp = 0;
+  let tNew = 0;
+
+  // working buffers
+  const y = new Float64Array(odes.initial);
+  const yPrev = new Float64Array(odes.initial);
+  const dydt = new Float64Array(dim);
+  const yScale = new Float64Array(dim);
+  const yTemp = new Float64Array(dim);
+  const yErr = new Float64Array(dim);
+
+  // AB5-AM4 history: fBuf[0] = f(t_n, y_n), fBuf[4] = f(t_{n-4}, y_{n-4})
+  const fBuf: Float64Array[] = [];
+  for (let i = 0; i < HIST_LEN; ++i)
+    fBuf[i] = new Float64Array(dim);
+  let histCount = 0;
+  let lastH = 0;
+
+  // AB5-AM4 corrector buffers
+  const yCorr = new Float64Array(dim);
+  const fPred = new Float64Array(dim);
+
+  // RKF45 stage buffers (bootstrap)
+  const k1 = new Float64Array(dim);
+  const k2 = new Float64Array(dim);
+  const k3 = new Float64Array(dim);
+  const k4 = new Float64Array(dim);
+  const k5 = new Float64Array(dim);
+  const k6 = new Float64Array(dim);
+
+  // store initial f-value
+  f(t, y, fBuf[0]);
+  histCount = 1;
+
+  // 1. SOLUTION AT THE POINT t0
+  tArr[0] = t0;
+  for (let i = 0; i < dim; ++i)
+    yArrs[i][0] = y[i];
+
+  // 2. COMPUTE NUMERICAL SOLUTION FOR THE POINTS FROM THE INTERVAL (t0, t1)
+  while (flag) {
+    // compute derivative
+    f(t, y, dydt);
+
+    // check whether to go on computations
+    if (callback)
+      callback.onIterationStart();
+
+    // compute scale vector
+    for (let i = 0; i < dim; ++i)
+      yScale[i] = abs(y[i]) + h * abs(dydt[i]) + TINY;
+
+    // check end point
+    if (t + h > t1) {
+      h = t1 - t;
+      flag = false;
+    }
+
+    // if step size changed, history is invalid (AB5 needs uniform spacing)
+    if (histCount > 1 && h !== lastH) {
+      histCount = 1;
+      f(t, y, fBuf[0]);
+    }
+
+    // adaptive step loop
+    while (true) {
+      if (histCount < HIST_LEN) {
+        // BOOTSTRAP PHASE: RKF45 single step to build up history
+
+        // Stage 1: k1 = f(t, y)
+        f(t, y, k1);
+
+        // Stage 2: k2 = f(t + C2*h, y + h*A21*k1)
+        for (let i = 0; i < dim; ++i)
+          yTemp[i] = y[i] + h * A21 * k1[i];
+        f(t + C2 * h, yTemp, k2);
+
+        // Stage 3: k3 = f(t + C3*h, y + h*(A31*k1 + A32*k2))
+        for (let i = 0; i < dim; ++i)
+          yTemp[i] = y[i] + h * (A31 * k1[i] + A32 * k2[i]);
+        f(t + C3 * h, yTemp, k3);
+
+        // Stage 4: k4 = f(t + C4*h, y + h*(A41*k1 + A42*k2 + A43*k3))
+        for (let i = 0; i < dim; ++i)
+          yTemp[i] = y[i] + h * (A41 * k1[i] + A42 * k2[i] + A43 * k3[i]);
+        f(t + C4 * h, yTemp, k4);
+
+        // Stage 5: k5 = f(t + h, y + h*(A51*k1 + A52*k2 + A53*k3 + A54*k4))
+        for (let i = 0; i < dim; ++i)
+          yTemp[i] = y[i] + h * (A51 * k1[i] + A52 * k2[i] + A53 * k3[i] + A54 * k4[i]);
+        f(t + h, yTemp, k5);
+
+        // Stage 6: k6 = f(t + C6*h, y + h*(A61*k1 + A62*k2 + A63*k3 + A64*k4 + A65*k5))
+        for (let i = 0; i < dim; ++i)
+          yTemp[i] = y[i] + h * (A61 * k1[i] + A62 * k2[i] + A63 * k3[i] + A64 * k4[i] + A65 * k5[i]);
+        f(t + C6 * h, yTemp, k6);
+
+        // 4th-order solution
+        for (let i = 0; i < dim; ++i)
+          yTemp[i] = y[i] + h * (B1 * k1[i] + B3 * k3[i] + B4 * k4[i] + B5 * k5[i]);
+
+        // Error estimate: difference between 4th and 5th order solutions
+        for (let i = 0; i < dim; ++i)
+          yErr[i] = h * (RKE1 * k1[i] + RKE3 * k3[i] + RKE4 * k4[i] + RKE5 * k5[i] + RKE6 * k6[i]);
+
+        // estimating error
+        errmax = 0;
+        for (let i = 0; i < dim; ++i)
+          errmax = max(errmax, abs(yErr[i] / yScale[i]));
+        errmax /= tolerance;
+
+        // processing the error obtained
+        if (errmax > 1) {
+          hTemp = SAFETY * h * errmax**PSHRNK;
+          h = max(hTemp, REDUCE_COEF * h);
+          tNew = t + h;
+          if (tNew == t)
+            throw new Error(ERROR_MSG.AB5_FAILS);
+          // step size changed, reset history if needed
+          if (histCount > 1) {
+            histCount = 1;
+            f(t, y, fBuf[0]);
+          }
+        } else {
+          // step accepted
+          t = t + h;
+
+          for (let i = 0; i < dim; ++i)
+            y[i] = yTemp[i];
+
+          // shift history and store new f-value
+          for (let j = Math.min(histCount, HIST_LEN - 1); j > 0; --j)
+            fBuf[j].set(fBuf[j - 1]);
+          f(t, y, fBuf[0]);
+          histCount++;
+          lastH = h;
+
+          // during bootstrap, keep h constant for uniform spacing
+          hNext = h;
+          if (hNext > hMax)
+            hNext = hMax;
+
+          break;
+        }
+      } else {
+        // AB5-AM4 PHASE: Predictor-Corrector (PECE)
+
+        // Predict (Adams-Bashforth 5-step)
+        for (let i = 0; i < dim; ++i) {
+          yTemp[i] = y[i] + h * (AB0 * fBuf[0][i] + AB1 * fBuf[1][i] +
+            AB2 * fBuf[2][i] + AB3 * fBuf[3][i] + AB4 * fBuf[4][i]);
+        }
+
+        // Evaluate f at predicted point
+        f(t + h, yTemp, fPred);
+
+        // Correct (Adams-Moulton 4-step)
+        for (let i = 0; i < dim; ++i) {
+          yCorr[i] = y[i] + h * (AM_NEW * fPred[i] + AM0 * fBuf[0][i] +
+            AM1 * fBuf[1][i] + AM2 * fBuf[2][i] + AM3 * fBuf[3][i]);
+        }
+
+        // Error estimate (Milne's device)
+        for (let i = 0; i < dim; ++i)
+          yErr[i] = MILNE * (yCorr[i] - yTemp[i]);
+
+        // estimating error
+        errmax = 0;
+        for (let i = 0; i < dim; ++i)
+          errmax = max(errmax, abs(yErr[i] / yScale[i]));
+        errmax /= tolerance;
+
+        // processing the error obtained
+        if (errmax > 1) {
+          // step rejected: shrink step and re-bootstrap
+          hTemp = SAFETY * h * errmax**PSHRNK;
+          h = max(hTemp, REDUCE_COEF * h);
+          tNew = t + h;
+          if (tNew == t)
+            throw new Error(ERROR_MSG.AB5_FAILS);
+          histCount = 1;
+          f(t, y, fBuf[0]);
+        } else {
+          if (errmax > ERR_CONTR)
+            hNext = SAFETY * h * errmax**PSGROW;
+          else
+            hNext = GROW_COEF * h;
+
+          if (hNext > hMax)
+            hNext = hMax;
+
+          t = t + h;
+
+          for (let i = 0; i < dim; ++i)
+            y[i] = yCorr[i];
+
+          // shift history and store f at corrected point (PECE final evaluate)
+          const recycled = fBuf[HIST_LEN - 1];
+          for (let j = HIST_LEN - 1; j > 0; --j)
+            fBuf[j] = fBuf[j - 1];
+          fBuf[0] = recycled;
+          f(t, y, fBuf[0]);
+          lastH = h;
+
+          break;
+        }
+      }
+    } // while (true)
+
+    // compute linearly interpolated results and store them in dataframe
+    while (timeDataframe < t) {
+      const cLeft = (t - timeDataframe) / (t - tPrev);
+      const cRight = 1.0 - cLeft;
+
+      tArr[index] = timeDataframe;
+
+      for (let j = 0; j < dim; ++j)
+        yArrs[j][index] = cRight * y[j] + cLeft * yPrev[j];
+
+      timeDataframe += hDataframe;
+      ++index;
+    }
+
+    h = hNext;
+    tPrev = t;
+
+    for (let i = 0; i < dim; ++i)
+      yPrev[i] = y[i];
+  } // while (flag)
+
+  // perform final callback actions
+  if (callback)
+    callback.onComputationsCompleted();
+
+  // 3. solution at the point t1
+  tArr[rowCount - 1] = t1;
+
+  for (let i = 0; i < dim; ++i)
+    yArrs[i][rowCount - 1] = y[i];
+
+  // 4. prepare output
+  const solution = Array<Float64Array>(dim + 1);
+
+  // independent variable
+  solution[0] = tArr;
+
+  // functions
+  for (let i = 0; i < dim; ++i)
+    solution[i + 1] = yArrs[i];
+
+  return solution;
+} // ab5

package/src/solver-tools/index.js

@@ -1,6 +1,12 @@
 export { mrt } from './mrt-method';
 export { ros3prw } from './ros3prw-method';
 export { ros34prw } from './ros34prw-method';
+export { rk4 } from './rk4-method';
+export { ab5 } from './ab5-method';
+export { ab4 } from './ab4-method';
+export { rkdp } from './rkdp-method';
+export { rk3 } from './rk3-method';
+export { lsoda } from './lsoda-method';
 export { CallbackAction, DEFAULT_OPTIONS } from './solver-defs';
 export { getCallback } from './callbacks/callback-tools';
 export { Callback } from './callbacks/callback-base';

package/src/solver-tools/index.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["index.ts"],"names":[],"mappings":"AACA,OAAO,EAAC,GAAG,EAAC,MAAM,cAAc,CAAC;AACjC,OAAO,EAAC,OAAO,EAAC,MAAM,kBAAkB,CAAC;AACzC,OAAO,EAAC,QAAQ,EAAC,MAAM,mBAAmB,CAAC;AAC3C,OAAO,EAAC,cAAc,EAAE,eAAe,EAA8B,MAAM,eAAe,CAAC;AAC3F,OAAO,EAAC,WAAW,EAAC,MAAM,4BAA4B,CAAC;AACvD,OAAO,EAAC,QAAQ,EAAC,MAAM,2BAA2B,CAAC;AACnD,OAAO,EAAC,mBAAmB,EAAC,MAAM,mCAAmC,CAAC;AACtE,OAAO,EAAC,mBAAmB,EAAC,MAAM,mCAAmC,CAAC"}
+{"version":3,"file":"index.js","sourceRoot":"","sources":["index.ts"],"names":[],"mappings":"AACA,OAAO,EAAC,GAAG,EAAC,MAAM,cAAc,CAAC;AACjC,OAAO,EAAC,OAAO,EAAC,MAAM,kBAAkB,CAAC;AACzC,OAAO,EAAC,QAAQ,EAAC,MAAM,mBAAmB,CAAC;AAC3C,OAAO,EAAC,GAAG,EAAC,MAAM,cAAc,CAAC;AACjC,OAAO,EAAC,GAAG,EAAC,MAAM,cAAc,CAAC;AACjC,OAAO,EAAC,GAAG,EAAC,MAAM,cAAc,CAAC;AACjC,OAAO,EAAC,IAAI,EAAC,MAAM,eAAe,CAAC;AACnC,OAAO,EAAC,GAAG,EAAC,MAAM,cAAc,CAAC;AACjC,OAAO,EAAC,KAAK,EAAC,MAAM,gBAAgB,CAAC;AACrC,OAAO,EAAC,cAAc,EAAE,eAAe,EAA8B,MAAM,eAAe,CAAC;AAC3F,OAAO,EAAC,WAAW,EAAC,MAAM,4BAA4B,CAAC;AACvD,OAAO,EAAC,QAAQ,EAAC,MAAM,2BAA2B,CAAC;AACnD,OAAO,EAAC,mBAAmB,EAAC,MAAM,mCAAmC,CAAC;AACtE,OAAO,EAAC,mBAAmB,EAAC,MAAM,mCAAmC,CAAC"}

package/src/solver-tools/index.ts

@@ -2,6 +2,12 @@ export {ODEs, Func} from './solver-defs';
 export {mrt} from './mrt-method';
 export {ros3prw} from './ros3prw-method';
 export {ros34prw} from './ros34prw-method';
+export {rk4} from './rk4-method';
+export {ab5} from './ab5-method';
+export {ab4} from './ab4-method';
+export {rkdp} from './rkdp-method';
+export {rk3} from './rk3-method';
+export {lsoda} from './lsoda-method';
 export {CallbackAction, DEFAULT_OPTIONS, SolverOptions, SolverMethod} from './solver-defs';
 export {getCallback} from './callbacks/callback-tools';
 export {Callback} from './callbacks/callback-base';

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

@@ -0,0 +1,246 @@
+// 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,+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"}