@sdeverywhere/runtime 0.2.8 → 0.2.9

package/dist/index.d.cts

@@ -770,6 +770,7 @@ interface JsModelFunctions {
     GAME(inputs: JsModelLookup, x: number): number;
     INTEG(value: number, rate: number): number;
     INTEGER(x: number): number;
+    INVERT_MATRIX(matrix: number[][], n: number): number[][];
     LN(x: number): number;
     MAX(x: number, y: number): number;
     MIN(x: number, y: number): number;

package/dist/index.d.ts

@@ -770,6 +770,7 @@ interface JsModelFunctions {
     GAME(inputs: JsModelLookup, x: number): number;
     INTEG(value: number, rate: number): number;
     INTEGER(x: number): number;
+    INVERT_MATRIX(matrix: number[][], n: number): number[][];
     LN(x: number): number;
     MAX(x: number, y: number): number;
     MIN(x: number, y: number): number;

package/dist/index.js

@@ -1196,6 +1196,8 @@ function getJsModelFunctions() {
   let ctx;
   const cachedVectors = /* @__PURE__ */ new Map();
   const cachedSortVectors = /* @__PURE__ */ new Map();
+  const cachedInvertWorkMatrices = /* @__PURE__ */ new Map();
+  const cachedInvertResultMatrices = /* @__PURE__ */ new Map();
   return {
     setContext(context) {
       ctx = context;
@@ -1230,6 +1232,74 @@ function getJsModelFunctions() {
     INTEGER(x) {
       return Math.trunc(x);
     },
+    INVERT_MATRIX(matrix, n) {
+      let work = cachedInvertWorkMatrices.get(n);
+      if (work === void 0) {
+        work = Array(n);
+        for (let i = 0; i < n; i++) {
+          work[i] = Array(2 * n);
+        }
+        cachedInvertWorkMatrices.set(n, work);
+      }
+      let result = cachedInvertResultMatrices.get(n);
+      if (result === void 0) {
+        result = Array(n);
+        for (let i = 0; i < n; i++) {
+          result[i] = Array(n);
+        }
+        cachedInvertResultMatrices.set(n, result);
+      }
+      for (let i = 0; i < n; i++) {
+        for (let j = 0; j < n; j++) {
+          work[i][j] = matrix[i][j];
+          work[i][n + j] = i === j ? 1 : 0;
+        }
+      }
+      for (let k = 0; k < n; k++) {
+        let pivot = k;
+        let max = Math.abs(work[k][k]);
+        for (let i = k + 1; i < n; i++) {
+          const v = Math.abs(work[i][k]);
+          if (v > max) {
+            max = v;
+            pivot = i;
+          }
+        }
+        if (max === 0) {
+          for (let i = 0; i < n; i++) {
+            for (let j = 0; j < n; j++) {
+              result[i][j] = _NA_;
+            }
+          }
+          return result;
+        }
+        if (pivot !== k) {
+          const tmpRow = work[k];
+          work[k] = work[pivot];
+          work[pivot] = tmpRow;
+        }
+        const p = work[k][k];
+        for (let j = 0; j < 2 * n; j++) {
+          work[k][j] /= p;
+        }
+        for (let i = 0; i < n; i++) {
+          if (i !== k) {
+            const f = work[i][k];
+            if (f !== 0) {
+              for (let j = 0; j < 2 * n; j++) {
+                work[i][j] -= f * work[k][j];
+              }
+            }
+          }
+        }
+      }
+      for (let i = 0; i < n; i++) {
+        for (let j = 0; j < n; j++) {
+          result[i][j] = work[i][n + j];
+        }
+      }
+      return result;
+    },
     LN(x) {
       return Math.log(x);
     },