@univerjs/engine-formula 0.10.14 → 0.11.0

package/lib/index.js

@@ -18,7 +18,7 @@ function bc(i, a, e, t, r) {
 }
 var m = /* @__PURE__ */ ((i) => (i.DIV_BY_ZERO = "#DIV/0!", i.NAME = "#NAME?", i.VALUE = "#VALUE!", i.NUM = "#NUM!", i.NA = "#N/A", i.CYCLE = "#CYCLE!", i.REF = "#REF!", i.SPILL = "#SPILL!", i.CALC = "#CALC!", i.ERROR = "#ERROR!", i.CONNECT = "#GETTING_DATA", i.NULL = "#NULL!", i))(m || {});
 const or = new Set(Object.values(m)), za = [...new Set(Object.values(m).map((i) => i.length))];
-var yc = /* @__PURE__ */ ((i) => (i[i.Financial = 0] = "Financial", i[i.Date = 1] = "Date", i[i.Math = 2] = "Math", i[i.Statistical = 3] = "Statistical", i[i.Lookup = 4] = "Lookup", i[i.Database = 5] = "Database", i[i.Text = 6] = "Text", i[i.Logical = 7] = "Logical", i[i.Information = 8] = "Information", i[i.Engineering = 9] = "Engineering", i[i.Cube = 10] = "Cube", i[i.Compatibility = 11] = "Compatibility", i[i.Web = 12] = "Web", i[i.Array = 13] = "Array", i[i.Univer = 14] = "Univer", i[i.User = 15] = "User", i[i.DefinedName = 16] = "DefinedName", i))(yc || {}), X = /* @__PURE__ */ ((i) => (i.PLUS = "+", i.MINUS = "-", i.MULTIPLY = "*", i.DIVIDED = "/", i.CONCATENATE = "&", i.POWER = "^", i.EQUALS = "=", i.NOT_EQUAL = "<>", i.GREATER_THAN = ">", i.GREATER_THAN_OR_EQUAL = ">=", i.LESS_THAN = "<", i.LESS_THAN_OR_EQUAL = "<=", i))(X || {}), k = /* @__PURE__ */ ((i) => (i.EQUALS = "=", i.NOT_EQUAL = "<>", i.GREATER_THAN = ">", i.GREATER_THAN_OR_EQUAL = ">=", i.LESS_THAN = "<", i.LESS_THAN_OR_EQUAL = "<=", i))(k || {});
+var yc = /* @__PURE__ */ ((i) => (i[i.Financial = 0] = "Financial", i[i.Date = 1] = "Date", i[i.Math = 2] = "Math", i[i.Statistical = 3] = "Statistical", i[i.Lookup = 4] = "Lookup", i[i.Database = 5] = "Database", i[i.Text = 6] = "Text", i[i.Logical = 7] = "Logical", i[i.Information = 8] = "Information", i[i.Engineering = 9] = "Engineering", i[i.Cube = 10] = "Cube", i[i.Compatibility = 11] = "Compatibility", i[i.Web = 12] = "Web", i[i.Array = 13] = "Array", i[i.Univer = 14] = "Univer", i[i.User = 15] = "User", i[i.DefinedName = 16] = "DefinedName", i))(yc || {}), X = /* @__PURE__ */ ((i) => (i.PLUS = "+", i.MINUS = "-", i.MULTIPLY = "*", i.DIVIDED = "/", i.CONCATENATE = "&", i.POWER = "^", i.EQUALS = "=", i.NOT_EQUAL = "<>", i.GREATER_THAN = ">", i.GREATER_THAN_OR_EQUAL = ">=", i.LESS_THAN = "<", i.LESS_THAN_OR_EQUAL = "<=", i))(X || {}), F = /* @__PURE__ */ ((i) => (i.EQUALS = "=", i.NOT_EQUAL = "<>", i.GREATER_THAN = ">", i.GREATER_THAN_OR_EQUAL = ">=", i.LESS_THAN = "<", i.LESS_THAN_OR_EQUAL = "<=", i))(F || {});
 const sn = /* @__PURE__ */ new Map([
   ["<>", 4],
   ["<", 4],
@@ -50,7 +50,7 @@ const ls = /* @__PURE__ */ new Set([
 ]);
 var Me = /* @__PURE__ */ ((i) => (i.AT = "@", i.MINUS = "-", i.PLUS = "+", i))(Me || {});
 const pc = " ", zi = [
-  ...Object.values(k),
+  ...Object.values(F),
   ...Object.values(X),
   ...Object.values(K),
   ...Object.values(tt),
@@ -971,31 +971,98 @@ class ga extends Ne {
   nodeMakerTest(e) {
     return this._nodeMaker(e);
   }
-  treeBuilder(e, t = !0, r, n) {
+  treeBuilder(e, t = !0, r) {
+    var f;
     if (t === !0) {
-      const h = hs.get(e), d = n == null ? void 0 : n(e);
+      const h = hs.get(e), d = r && ((f = this._simpleCheckDefinedName) == null ? void 0 : f.call(this, e, r));
       if (h && !d)
         return h;
     }
     this._resetCurrentLexerNode(), this._currentLexerNode.setToken(Tt);
-    const s = [];
-    let o = this._nodeMaker(e, s);
-    if (o === m.VALUE || s.length === 0)
-      return o;
-    let u = !1, c = "", l = [];
+    const n = [];
+    let s = this._nodeMaker(e, n);
+    if (s === m.VALUE || n.length === 0)
+      return s;
+    let o = !1, u = "", c = [];
     if (r) {
-      const { hasDefinedName: h, sequenceString: d, definedNames: _ } = r(s);
-      u = h, c = d, l = _;
+      const { hasDefinedName: h, sequenceString: d, definedNames: _ } = this._handleDefinedName(n, r);
+      o = h, u = d, c = _;
     }
-    if (u && (this._resetCurrentLexerNode(), this._currentLexerNode.setToken(Tt), o = this._nodeMaker(`=${c}`), o === m.VALUE))
-      return o;
-    const f = this._getTopNode(this._currentLexerNode);
-    if (f && (this._currentLexerNode = f), t) {
+    if (o && (this._resetCurrentLexerNode(), this._currentLexerNode.setToken(Tt), s = this._nodeMaker(`=${u}`), s === m.VALUE))
+      return s;
+    const l = this._getTopNode(this._currentLexerNode);
+    if (l && (this._currentLexerNode = l), t) {
       if (!this._suffixExpressionHandler(this._currentLexerNode))
         return m.VALUE;
       hs.set(e, this._currentLexerNode);
     }
-    return u && this._currentLexerNode.setDefinedNames(l), this._currentLexerNode;
+    return o && this._currentLexerNode.setDefinedNames(c), this._currentLexerNode;
+  }
+  _handleDefinedName(e, t) {
+    const { unitId: r, getValueByName: n } = t;
+    if (r == null)
+      return {
+        sequenceString: "",
+        hasDefinedName: !1,
+        definedNames: []
+      };
+    const s = this.getSequenceNode(e);
+    let o = "", u = !1;
+    const c = [];
+    for (let l = 0, f = s.length; l < f; l++) {
+      const h = s[l];
+      if (typeof h == "string") {
+        o += h;
+        continue;
+      }
+      const { nodeType: d, token: _ } = h;
+      if (d === $e.REFERENCE || d === $e.FUNCTION) {
+        const C = n(r, _);
+        if (C) {
+          const E = C.formulaOrRefString, b = this._handleNestedDefinedName(E, t);
+          if (b == null || typeof b != "object")
+            o += b || m.NAME, u = !0, c.push(_);
+          else if (typeof b == "object") {
+            const { sequenceString: R, definedNames: p } = b;
+            o += R, p.forEach((N) => {
+              c.push(N);
+            }), u = !0;
+          }
+        } else this._checkDefinedNameDirty(_, t) ? (o += m.NAME, u = !0, c.push(_)) : o += _;
+      } else
+        o += _;
+    }
+    return {
+      sequenceString: o,
+      hasDefinedName: u,
+      definedNames: c
+    };
+  }
+  _handleNestedDefinedName(e, t) {
+    const r = [], n = this._nodeMaker(e, r);
+    return n === m.VALUE || r.length === 0 ? n : this._handleDefinedName(r, t);
+  }
+  _simpleCheckDefinedName(e, t) {
+    const { getDirtyDefinedNameMap: r, unitId: n } = t, s = r(), o = n;
+    if (o != null && s[o] != null) {
+      const u = Object.keys(s[o]);
+      for (let c = 0, l = u.length; c < l; c++) {
+        const f = u[c];
+        if (e.indexOf(f) > -1)
+          return !0;
+      }
+    }
+    return !1;
+  }
+  _checkDefinedNameDirty(e, t) {
+    const { getDirtyDefinedNameMap: r, unitId: n } = t, s = r(), o = n;
+    if (o != null && s[o] != null) {
+      const u = Object.keys(s[o]);
+      for (let c = 0, l = u.length; c < l; c++)
+        if (u[c] === e)
+          return !0;
+    }
+    return !1;
   }
   // eslint-disable-next-line complexity
   _suffixExpressionHandler(e) {
@@ -2664,62 +2731,11 @@ let Ar = class extends Ne {
     super(), this._definedNamesService = i, this._lexerTreeBuilder = a, this._formulaCurrentConfigService = e;
   }
   treeBuilder(i, a = !0) {
-    return this._lexerTreeBuilder.treeBuilder(i, a, this._injectDefinedName.bind(this), this._simpleCheckDefinedName.bind(this));
-  }
-  _simpleCheckDefinedName(i) {
-    const a = this._formulaCurrentConfigService.getDirtyDefinedNameMap(), e = this._formulaCurrentConfigService.getExecuteUnitId();
-    if (e != null && a[e] != null) {
-      const t = Object.keys(a[e]);
-      for (let r = 0, n = t.length; r < n; r++) {
-        const s = t[r];
-        if (i.indexOf(s) > -1)
-          return !0;
-      }
-    }
-    return !1;
-  }
-  _checkDefinedNameDirty(i) {
-    const a = this._formulaCurrentConfigService.getDirtyDefinedNameMap(), e = this._formulaCurrentConfigService.getExecuteUnitId();
-    if (e != null && a[e] != null) {
-      const t = Object.keys(a[e]);
-      for (let r = 0, n = t.length; r < n; r++)
-        if (t[r] === i)
-          return !0;
-    }
-    return !1;
-  }
-  _injectDefinedName(i) {
-    const a = this._formulaCurrentConfigService.getExecuteUnitId();
-    if (a == null)
-      return {
-        sequenceString: "",
-        hasDefinedName: !1,
-        definedNames: []
-      };
-    const e = this._lexerTreeBuilder.getSequenceNode(i);
-    let t = "", r = !1;
-    const n = [];
-    for (let s = 0, o = e.length; s < o; s++) {
-      const u = e[s];
-      if (typeof u == "string") {
-        t += u;
-        continue;
-      }
-      const { nodeType: c, token: l } = u;
-      if (c === $e.REFERENCE || c === $e.FUNCTION) {
-        const f = this._definedNamesService.getValueByName(a, l);
-        if (f) {
-          let h = f.formulaOrRefString;
-          h.substring(0, 1) === X.EQUALS && (h = h.substring(1)), t += h, n.push(f.name), r = !0;
-        } else this._checkDefinedNameDirty(l) ? (t += m.NAME, r = !0, n.push(l)) : t += l;
-      } else
-        t += l;
-    }
-    return {
-      sequenceString: t,
-      hasDefinedName: r,
-      definedNames: n
-    };
+    return this._lexerTreeBuilder.treeBuilder(i, a, {
+      unitId: this._formulaCurrentConfigService.getExecuteUnitId(),
+      getValueByName: this._definedNamesService.getValueByName.bind(this._definedNamesService),
+      getDirtyDefinedNameMap: this._formulaCurrentConfigService.getDirtyDefinedNameMap.bind(this._formulaCurrentConfigService)
+    });
   }
 };
 Ar = Cl([
@@ -3047,22 +3063,22 @@ class Ht extends Hn {
     return g.create(m.NAME);
   }
   isEqual(e) {
-    return this.compare(e, k.EQUALS);
+    return this.compare(e, F.EQUALS);
   }
   isNotEqual(e) {
-    return this.compare(e, k.NOT_EQUAL);
+    return this.compare(e, F.NOT_EQUAL);
   }
   isGreaterThanOrEqual(e) {
-    return this.compare(e, k.GREATER_THAN_OR_EQUAL);
+    return this.compare(e, F.GREATER_THAN_OR_EQUAL);
   }
   isLessThanOrEqual(e) {
-    return this.compare(e, k.LESS_THAN_OR_EQUAL);
+    return this.compare(e, F.LESS_THAN_OR_EQUAL);
   }
   isLessThan(e) {
-    return this.compare(e, k.LESS_THAN);
+    return this.compare(e, F.LESS_THAN);
   }
   isGreaterThan(e) {
-    return this.compare(e, k.GREATER_THAN);
+    return this.compare(e, F.GREATER_THAN);
   }
   concatenateFront(e) {
     return g.create(m.NAME);
@@ -3286,18 +3302,18 @@ function di(i) {
 function Sl(i, a, e) {
   let t = !1;
   switch (e) {
-    case k.EQUALS:
+    case F.EQUALS:
       t = Cs(i, a);
       break;
-    case k.NOT_EQUAL:
+    case F.NOT_EQUAL:
       t = !Cs(i, a);
       break;
-    case k.GREATER_THAN:
-    case k.GREATER_THAN_OR_EQUAL:
+    case F.GREATER_THAN:
+    case F.GREATER_THAN_OR_EQUAL:
       t = Cs(i, a) || i > di(a);
       break;
-    case k.LESS_THAN:
-    case k.LESS_THAN_OR_EQUAL:
+    case F.LESS_THAN:
+    case F.LESS_THAN_OR_EQUAL:
       t = i < di(a);
       break;
   }
@@ -3324,23 +3340,23 @@ function Is(i) {
 function Aa(i) {
   let a;
   switch (i) {
-    case k.EQUALS:
-      a = k.EQUALS;
+    case F.EQUALS:
+      a = F.EQUALS;
       break;
-    case k.GREATER_THAN:
-      a = k.LESS_THAN;
+    case F.GREATER_THAN:
+      a = F.LESS_THAN;
       break;
-    case k.GREATER_THAN_OR_EQUAL:
-      a = k.LESS_THAN_OR_EQUAL;
+    case F.GREATER_THAN_OR_EQUAL:
+      a = F.LESS_THAN_OR_EQUAL;
       break;
-    case k.LESS_THAN:
-      a = k.GREATER_THAN;
+    case F.LESS_THAN:
+      a = F.GREATER_THAN;
       break;
-    case k.LESS_THAN_OR_EQUAL:
-      a = k.GREATER_THAN_OR_EQUAL;
+    case F.LESS_THAN_OR_EQUAL:
+      a = F.GREATER_THAN_OR_EQUAL;
       break;
-    case k.NOT_EQUAL:
-      a = k.NOT_EQUAL;
+    case F.NOT_EQUAL:
+      a = F.NOT_EQUAL;
       break;
   }
   return a;
@@ -3855,7 +3871,7 @@ var Ve = /* @__PURE__ */ (function() {
     for (; !t[0] && t.length > 1; ) t.shift();
   }
   return function(t, r, n, s, o, u) {
-    var c, l, f, h, d, _, C, E, b, R, p, N, M, w, S, D, L, U, x, F, Q = t.constructor, ne = t.s == r.s ? 1 : -1, z = t.d, G = r.d;
+    var c, l, f, h, d, _, C, E, b, R, p, N, M, w, S, D, L, U, x, k, Q = t.constructor, ne = t.s == r.s ? 1 : -1, z = t.d, G = r.d;
     if (!z || !z[0] || !G || !G[0])
       return new Q(
         // Return NaN if either NaN, or both Infinity or 0.
@@ -3874,9 +3890,9 @@ var Ve = /* @__PURE__ */ (function() {
         _ = h || f < L;
       } else {
         for (h = u / (G[0] + 1) | 0, h > 1 && (G = i(G, h, u), z = i(z, h, u), x = G.length, L = z.length), D = x, p = z.slice(0, x), N = p.length; N < x; ) p[N++] = 0;
-        F = G.slice(), F.unshift(0), U = G[0], G[1] >= u / 2 && ++U;
+        k = G.slice(), k.unshift(0), U = G[0], G[1] >= u / 2 && ++U;
         do
-          h = 0, c = a(G, p, x, N), c < 0 ? (M = p[0], x != N && (M = M * u + (p[1] || 0)), h = M / U | 0, h > 1 ? (h >= u && (h = u - 1), C = i(G, h, u), E = C.length, N = p.length, c = a(C, p, E, N), c == 1 && (h--, e(C, x < E ? F : G, E, u))) : (h == 0 && (c = h = 1), C = G.slice()), E = C.length, E < N && C.unshift(0), e(p, C, N, u), c == -1 && (N = p.length, c = a(G, p, x, N), c < 1 && (h++, e(p, x < N ? F : G, N, u))), N = p.length) : c === 0 && (h++, p = [0]), R[f++] = h, c && p[0] ? p[N++] = z[D] || 0 : (p = [z[D]], N = 1);
+          h = 0, c = a(G, p, x, N), c < 0 ? (M = p[0], x != N && (M = M * u + (p[1] || 0)), h = M / U | 0, h > 1 ? (h >= u && (h = u - 1), C = i(G, h, u), E = C.length, N = p.length, c = a(C, p, E, N), c == 1 && (h--, e(C, x < E ? k : G, E, u))) : (h == 0 && (c = h = 1), C = G.slice()), E = C.length, E < N && C.unshift(0), e(p, C, N, u), c == -1 && (N = p.length, c = a(G, p, x, N), c < 1 && (h++, e(p, x < N ? k : G, N, u))), N = p.length) : c === 0 && (h++, p = [0]), R[f++] = h, c && p[0] ? p[N++] = z[D] || 0 : (p = [z[D]], N = 1);
         while ((D++ < L || p[0] !== void 0) && w--);
         _ = p[0] !== void 0;
       }
@@ -4556,7 +4572,7 @@ const $n = class $n extends Ht {
   }
 };
 A($n, "_instance");
-let ue = $n;
+let ce = $n;
 const Xt = class Xt extends Ht {
   constructor(e) {
     super(e);
@@ -4610,13 +4626,13 @@ const Xt = class Xt extends Ht {
   }
   _compareString(e) {
     switch (e) {
-      case k.GREATER_THAN:
-      case k.GREATER_THAN_OR_EQUAL:
+      case F.GREATER_THAN:
+      case F.GREATER_THAN_OR_EQUAL:
         return !0;
-      case k.EQUALS:
-      case k.LESS_THAN:
-      case k.LESS_THAN_OR_EQUAL:
-      case k.NOT_EQUAL:
+      case F.EQUALS:
+      case F.LESS_THAN:
+      case F.LESS_THAN_OR_EQUAL:
+      case F.NOT_EQUAL:
         return !1;
     }
   }
@@ -4869,13 +4885,13 @@ class y extends Ht {
   }
   _compareString(e) {
     switch (e) {
-      case k.EQUALS:
-      case k.GREATER_THAN:
-      case k.GREATER_THAN_OR_EQUAL:
+      case F.EQUALS:
+      case F.GREATER_THAN:
+      case F.GREATER_THAN_OR_EQUAL:
         return !1;
-      case k.LESS_THAN:
-      case k.LESS_THAN_OR_EQUAL:
-      case k.NOT_EQUAL:
+      case F.LESS_THAN:
+      case F.LESS_THAN_OR_EQUAL:
+      case F.NOT_EQUAL:
         return !0;
     }
   }
@@ -4884,29 +4900,29 @@ class y extends Ht {
   }
   _compareFiniteNumber(e, t, r) {
     switch (r) {
-      case k.EQUALS:
+      case F.EQUALS:
         return bi(e, t);
-      case k.GREATER_THAN:
+      case F.GREATER_THAN:
         return Df(e, t);
-      case k.GREATER_THAN_OR_EQUAL:
+      case F.GREATER_THAN_OR_EQUAL:
         return Lf(e, t);
-      case k.LESS_THAN:
+      case F.LESS_THAN:
         return Pf(e, t);
-      case k.LESS_THAN_OR_EQUAL:
+      case F.LESS_THAN_OR_EQUAL:
         return xf(e, t);
-      case k.NOT_EQUAL:
+      case F.NOT_EQUAL:
         return !bi(e, t);
     }
   }
   _compareBoolean(e) {
     switch (e) {
-      case k.EQUALS:
-      case k.GREATER_THAN:
-      case k.GREATER_THAN_OR_EQUAL:
+      case F.EQUALS:
+      case F.GREATER_THAN:
+      case F.GREATER_THAN_OR_EQUAL:
         return !1;
-      case k.LESS_THAN:
-      case k.LESS_THAN_OR_EQUAL:
-      case k.NOT_EQUAL:
+      case F.LESS_THAN:
+      case F.LESS_THAN_OR_EQUAL:
+      case F.NOT_EQUAL:
         return !0;
     }
   }
@@ -5122,22 +5138,22 @@ class y extends Ht {
   _compareInfinity(e, t, r) {
     let n = !1;
     switch (r) {
-      case k.EQUALS:
+      case F.EQUALS:
         n = e === t;
         break;
-      case k.GREATER_THAN:
+      case F.GREATER_THAN:
         n = e > t;
         break;
-      case k.GREATER_THAN_OR_EQUAL:
+      case F.GREATER_THAN_OR_EQUAL:
         n = e >= t;
         break;
-      case k.LESS_THAN:
+      case F.LESS_THAN:
         n = e < t;
         break;
-      case k.LESS_THAN_OR_EQUAL:
+      case F.LESS_THAN_OR_EQUAL:
         n = e <= t;
         break;
-      case k.NOT_EQUAL:
+      case F.NOT_EQUAL:
         n = e !== t;
         break;
     }
@@ -5209,41 +5225,41 @@ class j extends Ht {
   }
   _compareString(e, t, r) {
     switch (r) {
-      case k.EQUALS:
+      case F.EQUALS:
         return e === t;
-      case k.GREATER_THAN:
+      case F.GREATER_THAN:
         return e > t;
-      case k.GREATER_THAN_OR_EQUAL:
+      case F.GREATER_THAN_OR_EQUAL:
         return e >= t;
-      case k.LESS_THAN:
+      case F.LESS_THAN:
         return e < t;
-      case k.LESS_THAN_OR_EQUAL:
+      case F.LESS_THAN_OR_EQUAL:
         return e <= t;
-      case k.NOT_EQUAL:
+      case F.NOT_EQUAL:
         return e !== t;
     }
   }
   _compareNumber(e) {
     switch (e) {
-      case k.NOT_EQUAL:
-      case k.GREATER_THAN:
-      case k.GREATER_THAN_OR_EQUAL:
+      case F.NOT_EQUAL:
+      case F.GREATER_THAN:
+      case F.GREATER_THAN_OR_EQUAL:
         return !0;
-      case k.EQUALS:
-      case k.LESS_THAN:
-      case k.LESS_THAN_OR_EQUAL:
+      case F.EQUALS:
+      case F.LESS_THAN:
+      case F.LESS_THAN_OR_EQUAL:
         return !1;
     }
   }
   _compareBoolean(e) {
     switch (e) {
-      case k.EQUALS:
-      case k.GREATER_THAN:
-      case k.GREATER_THAN_OR_EQUAL:
+      case F.EQUALS:
+      case F.GREATER_THAN:
+      case F.GREATER_THAN_OR_EQUAL:
         return !1;
-      case k.LESS_THAN:
-      case k.LESS_THAN_OR_EQUAL:
-      case k.NOT_EQUAL:
+      case F.LESS_THAN:
+      case F.LESS_THAN_OR_EQUAL:
+      case F.NOT_EQUAL:
         return !0;
     }
   }
@@ -5474,11 +5490,11 @@ class q extends Ht {
   }
   getFirstCell() {
     const { startRow: e, startColumn: t } = this.getRangePosition();
-    return this.get(e, t) || this._defaultValue || ue.create();
+    return this.get(e, t) || this._defaultValue || ce.create();
   }
   getLastCell() {
     const { endRow: e, endColumn: t } = this.getRangePosition();
-    return this.get(e, t) || this._defaultValue || ue.create();
+    return this.get(e, t) || this._defaultValue || ce.create();
   }
   /**
    * Referring to matrix calculations,
@@ -5494,7 +5510,7 @@ class q extends Ht {
   pickRaw(e) {
     const t = e.getRowCount(), r = e.getColumnCount();
     if (t !== this._rowCount || r !== this._columnCount)
-      return [[ue.create()]];
+      return [[ce.create()]];
     const n = [];
     n[0] = [];
     for (let s = 0; s < t; s++)
@@ -5572,7 +5588,7 @@ class q extends Ht {
         if (!d[p])
           return;
         let M = d[p][N] || this._defaultValue;
-        M == null && (M = ue.create()), h[_][C] = M, C++;
+        M == null && (M = ce.create()), h[_][C] = M, C++;
       }
       _++;
     }
@@ -5603,7 +5619,7 @@ class q extends Ht {
       if (f == null)
         return !0;
       let _;
-      if (n === !0 ? _ = f.compare(e, k.EQUALS) : _ = f.isEqual(e), (_ == null ? void 0 : _.getValue()) === !0)
+      if (n === !0 ? _ = f.compare(e, F.EQUALS) : _ = f.isEqual(e), (_ == null ? void 0 : _.getValue()) === !0)
         return s = f, u = { row: h, column: d }, !1;
       t === Le.MAX ? f.isGreaterThan(e).getValue() === !0 && (o == null || f.minus(e).abs().isLessThanOrEqual(o.minus(e).abs()).getValue() === !0) && (o = f, c = { row: h, column: d }) : t === Le.MIN && f.isLessThan(e).getValue() === !0 && (o == null || f.minus(e).abs().isLessThanOrEqual(o.minus(e).abs()).getValue() === !0) && (o = f, c = { row: h, column: d });
     };
@@ -5778,7 +5794,7 @@ class q extends Ht {
     );
   }
   map(e) {
-    const t = (r, n, s) => r == null ? ue.create() : r.isError() ? r : e(r, n, s);
+    const t = (r, n, s) => r == null ? ce.create() : r.isError() ? r : e(r, n, s);
     return this.mapValue(t);
   }
   mapValue(e) {
@@ -5792,7 +5808,7 @@ class q extends Ht {
           u[c] = g.create(m.VALUE);
         else {
           const f = l[c] || this._defaultValue;
-          f ? u[c] = e(f, o, c) : u[c] = ue.create();
+          f ? u[c] = e(f, o, c) : u[c] = ce.create();
         }
       }
       n.push(u);
@@ -5873,12 +5889,12 @@ class q extends Ht {
   median() {
     const e = this.flattenPosition().numberArray, t = this._createNewArray([e], 1, e.length), r = t.getColumnCount();
     if (r <= 1)
-      return t.get(0, 0) || ue.create();
+      return t.get(0, 0) || ce.create();
     if (t.sortByRow(0), r % 2 === 0) {
-      const n = t.get(0, r / 2) || ue.create(), s = t.get(0, r / 2 - 1) || ue.create();
+      const n = t.get(0, r / 2) || ce.create(), s = t.get(0, r / 2 - 1) || ce.create();
       return n.plus(s).divided(y.create(2));
     }
-    return t.get(0, (r - 1) / 2) || ue.create();
+    return t.get(0, (r - 1) / 2) || ce.create();
   }
   /**
    * ┌──────────────┬────────────────────────────────┬───────────────────┐
@@ -6042,61 +6058,64 @@ class q extends Ht {
         f + u - 1
       );
       if (d.length > 0) {
-        if (s === k.EQUALS) {
-          const C = We.getCellPositions(
+        let C = !1;
+        if (s === F.EQUALS) {
+          const E = We.getCellPositions(
             c,
             l,
             t + h,
             e.getValue(),
             d
           );
-          C != null && C.forEach((E) => {
-            if (E < f || E > f + u - 1)
+          E != null && (E.forEach((b) => {
+            if (b < f || b > f + u - 1)
               return;
-            const b = E - f;
-            r[b] == null && (r[b] = []), r[b][t] = T.create(!0);
-          });
+            const R = b - f;
+            r[R] == null && (r[R] = []), r[R][t] = T.create(!0);
+          }), C = !0);
         } else {
-          const C = We.getCellValuePositions(
+          const E = We.getCellValuePositions(
             c,
             l,
             t + h
           );
-          C != null && C.forEach((E, b) => {
-            let R = ue.create();
-            or.has(b) ? R = g.create(b) : typeof b == "string" ? R = j.create(b) : typeof b == "number" ? R = y.create(b) : typeof b == "boolean" && (R = T.create(b));
-            let p;
-            R.isError() ? p = R : e.isError() ? p = e : p = R.compare(e, s, o), (p.isError() || p.getValue() === !0) && E.forEach((N) => {
-              N >= f && N <= f + u - 1 && (r[N - f] == null && (r[N - f] = []), r[N - f][t] = p);
+          E != null && E.forEach((b, R) => {
+            let p = ce.create();
+            or.has(R) ? p = g.create(R) : typeof R == "string" ? p = j.create(R) : typeof R == "number" ? p = y.create(R) : typeof R == "boolean" && (p = T.create(R));
+            let N;
+            p.isError() ? N = p : e.isError() ? N = e : N = p.compare(e, s, o), (N.isError() || N.getValue() === !0) && b.forEach((M) => {
+              M >= f && M <= f + u - 1 && (r[M - f] == null && (r[M - f] = []), r[M - f][t] = N);
             });
           });
         }
-        if (_.length > 0)
-          for (const C of _) {
-            const [E, b] = C;
-            for (let R = E; R <= b; R++)
-              this.__batchOperatorRowValue(
-                e,
-                t,
-                r,
-                n,
-                R - f,
+        if (!(s === F.EQUALS && !C && !o)) {
+          if (_.length > 0)
+            for (const E of _) {
+              const [b, R] = E;
+              for (let p = b; p <= R; p++)
+                this.__batchOperatorRowValue(
+                  e,
+                  t,
+                  r,
+                  n,
+                  p - f,
+                  c,
+                  l,
+                  f,
+                  h,
+                  s,
+                  o
+                );
+              We.setContinueBuildingCache(
                 c,
                 l,
-                f,
-                h,
-                s,
-                o
+                t + h,
+                b,
+                R
               );
-            We.setContinueBuildingCache(
-              c,
-              l,
-              t + h,
-              E,
-              b
-            );
-          }
-        return;
+            }
+          return;
+        }
       }
     }
     for (let d = 0; d < u; d++)
@@ -6173,7 +6192,7 @@ class q extends Ht {
         }
     else
       r[s][t] = g.create(m.NA);
-    d != null && (d.isError() ? We.set(
+    d != null && (d.isNull() || (d.isError() ? We.set(
       o,
       u,
       t + l,
@@ -6185,7 +6204,7 @@ class q extends Ht {
       t + l,
       d.getValue(),
       s + c
-    ));
+    )));
   }
   // eslint-disable-next-line max-lines-per-function, complexity
   _batchOperatorArray(e, t, r, n) {
@@ -6290,7 +6309,7 @@ class q extends Ht {
 class Mt {
   static create(a, e = !1) {
     if (a == null)
-      return ue.create();
+      return ce.create();
     if (typeof a == "boolean")
       return T.create(a);
     if (typeof a == "string") {
@@ -6639,7 +6658,7 @@ class Xn extends Hn {
     const f = new Array(c);
     this.iterator((C, E, b) => {
       const R = E - t, p = b - n;
-      f[R] || (f[R] = new Array(l)), C == null && (C = ue.create()), f[R][p] = C;
+      f[R] || (f[R] = new Array(l)), C == null && (C = ce.create()), f[R][p] = C;
     });
     const h = {
       calculateValueList: f,
@@ -6846,7 +6865,7 @@ function O(i, a, e, t) {
         continue;
       }
       if (o >= r || c >= n) {
-        u.push(t != null ? t : ue.create());
+        u.push(t != null ? t : ce.create());
         continue;
       }
       const l = e.get(o, c);
@@ -6870,19 +6889,19 @@ function Fr(i, a, e, t = "", r = "") {
 }
 function Va(i) {
   const a = [
-    k.EQUALS,
-    k.NOT_EQUAL,
-    k.GREATER_THAN_OR_EQUAL,
-    k.GREATER_THAN,
-    k.LESS_THAN_OR_EQUAL,
-    k.LESS_THAN
+    F.EQUALS,
+    F.NOT_EQUAL,
+    F.GREATER_THAN_OR_EQUAL,
+    F.GREATER_THAN,
+    F.LESS_THAN_OR_EQUAL,
+    F.LESS_THAN
   ];
   for (const e of a)
     if (i.startsWith(e)) {
       const t = i.substring(e.length);
       return [e, Mt.create(t)];
     }
-  return [k.EQUALS, Mt.create(i)];
+  return [F.EQUALS, Mt.create(i)];
 }
 function Zn(i, a, e, t) {
   if (!e)
@@ -6890,7 +6909,7 @@ function Zn(i, a, e, t) {
       const r = `${a.getValue()}`, [n, s] = Va(r);
       e = n, a = s;
     } else
-      e = k.EQUALS;
+      e = F.EQUALS;
   return i.compare(a, e, t);
 }
 function Hf(i, a) {
@@ -7055,7 +7074,7 @@ function zn(i, a, e) {
       return n;
     if (u != null && u.isError() && r.isError() && u.getValue() === r.getValue())
       return T.create(!0);
-    if (t === k.EQUALS || t === k.NOT_EQUAL) {
+    if (t === F.EQUALS || t === F.NOT_EQUAL) {
       if (u != null && u.isNumber() && r.isString()) {
         const c = r.convertToNumberObjectValue();
         if (c.isNumber())
@@ -7066,9 +7085,9 @@ function zn(i, a, e) {
         if (c.isNumber())
           return c.compare(r, t);
       }
-      if (t === k.EQUALS)
+      if (t === F.EQUALS)
         return T.create(!1);
-      if (t === k.NOT_EQUAL)
+      if (t === F.NOT_EQUAL)
         return T.create(!0);
     }
     return T.create(!1);
@@ -7343,15 +7362,15 @@ let Ws = class extends Ne {
         const S = this._currentConfigService.getUnitData();
         E.iterator((D, L, U) => {
           var ne, z;
-          const x = L - b + e, F = U - R + t, Q = (z = (ne = S[o]) == null ? void 0 : ne[s]) == null ? void 0 : z.cellData.getValue(x, F);
+          const x = L - b + e, k = U - R + t, Q = (z = (ne = S[o]) == null ? void 0 : ne[s]) == null ? void 0 : z.cellData.getValue(x, k);
           if (L === b && U === R)
             _.setValue(e, t, w);
           else if (Q != null)
-            Q.v == null && (Q.v = ""), _.setValue(x, F, Q);
+            Q.v == null && (Q.v = ""), _.setValue(x, k, Q);
           else {
-            if (this._isInOtherArrayFormulaRange(o, s, e, t, x, F))
+            if (this._isInOtherArrayFormulaRange(o, s, e, t, x, k))
               return !0;
-            _.setValue(x, F, { v: "" });
+            _.setValue(x, k, { v: "" });
           }
         });
       } else {
@@ -7371,8 +7390,8 @@ let Ws = class extends Ne {
               return C.setValue(e, t, {}), d.setValue(e, t, { ...this._getValueObjectOfRuntimeData(w) }), !1;
             d.setValue(e, t, { ...U });
           }
-          const x = D - b + e, F = L - R + t;
-          _.setValue(x, F, U);
+          const x = D - b + e, k = L - R + t;
+          _.setValue(x, k, U);
         });
       }
     } else {
@@ -8373,7 +8392,7 @@ class bh extends Ge {
     return ie.NULL;
   }
   execute() {
-    this.setValue(ue.create());
+    this.setValue(ce.create());
   }
 }
 var Y = /* @__PURE__ */ ((i) => (i.ABS = "ABS", i.ACOS = "ACOS", i.ACOSH = "ACOSH", i.ACOT = "ACOT", i.ACOTH = "ACOTH", i.AGGREGATE = "AGGREGATE", i.ARABIC = "ARABIC", i.ASIN = "ASIN", i.ASINH = "ASINH", i.ATAN = "ATAN", i.ATAN2 = "ATAN2", i.ATANH = "ATANH", i.BASE = "BASE", i.CEILING = "CEILING", i.CEILING_MATH = "CEILING.MATH", i.CEILING_PRECISE = "CEILING.PRECISE", i.COMBIN = "COMBIN", i.COMBINA = "COMBINA", i.COS = "COS", i.COSH = "COSH", i.COT = "COT", i.COTH = "COTH", i.CSC = "CSC", i.CSCH = "CSCH", i.DECIMAL = "DECIMAL", i.DEGREES = "DEGREES", i.EVEN = "EVEN", i.EXP = "EXP", i.FACT = "FACT", i.FACTDOUBLE = "FACTDOUBLE", i.FLOOR = "FLOOR", i.FLOOR_MATH = "FLOOR.MATH", i.FLOOR_PRECISE = "FLOOR.PRECISE", i.GCD = "GCD", i.INT = "INT", i.ISO_CEILING = "ISO.CEILING", i.LCM = "LCM", i.LET = "LET", i.LN = "LN", i.LOG = "LOG", i.LOG10 = "LOG10", i.MDETERM = "MDETERM", i.MINVERSE = "MINVERSE", i.MMULT = "MMULT", i.MOD = "MOD", i.MROUND = "MROUND", i.MULTINOMIAL = "MULTINOMIAL", i.MUNIT = "MUNIT", i.ODD = "ODD", i.PI = "PI", i.POWER = "POWER", i.PRODUCT = "PRODUCT", i.QUOTIENT = "QUOTIENT", i.RADIANS = "RADIANS", i.RAND = "RAND", i.RANDARRAY = "RANDARRAY", i.RANDBETWEEN = "RANDBETWEEN", i.ROMAN = "ROMAN", i.ROUND = "ROUND", i.ROUNDBANK = "ROUNDBANK", i.ROUNDDOWN = "ROUNDDOWN", i.ROUNDUP = "ROUNDUP", i.SEC = "SEC", i.SECH = "SECH", i.SERIESSUM = "SERIESSUM", i.SEQUENCE = "SEQUENCE", i.SIGN = "SIGN", i.SIN = "SIN", i.SINH = "SINH", i.SQRT = "SQRT", i.SQRTPI = "SQRTPI", i.SUBTOTAL = "SUBTOTAL", i.SUM = "SUM", i.SUMIF = "SUMIF", i.SUMIFS = "SUMIFS", i.SUMPRODUCT = "SUMPRODUCT", i.SUMSQ = "SUMSQ", i.SUMX2MY2 = "SUMX2MY2", i.SUMX2PY2 = "SUMX2PY2", i.SUMXMY2 = "SUMXMY2", i.TAN = "TAN", i.TANH = "TANH", i.TRUNC = "TRUNC", i))(Y || {}), se = /* @__PURE__ */ ((i) => (i.ASC = "ASC", i.ARRAYTOTEXT = "ARRAYTOTEXT", i.BAHTTEXT = "BAHTTEXT", i.CHAR = "CHAR", i.CLEAN = "CLEAN", i.CODE = "CODE", i.CONCAT = "CONCAT", i.CONCATENATE = "CONCATENATE", i.DBCS = "DBCS", i.DOLLAR = "DOLLAR", i.EXACT = "EXACT", i.FIND = "FIND", i.FINDB = "FINDB", i.FIXED = "FIXED", i.LEFT = "LEFT", i.LEFTB = "LEFTB", i.LEN = "LEN", i.LENB = "LENB", i.LOWER = "LOWER", i.MID = "MID", i.MIDB = "MIDB", i.NUMBERSTRING = "NUMBERSTRING", i.NUMBERVALUE = "NUMBERVALUE", i.PHONETIC = "PHONETIC", i.PROPER = "PROPER", i.REGEXEXTRACT = "REGEXEXTRACT", i.REGEXMATCH = "REGEXMATCH", i.REGEXREPLACE = "REGEXREPLACE", i.REPLACE = "REPLACE", i.REPLACEB = "REPLACEB", i.REPT = "REPT", i.RIGHT = "RIGHT", i.RIGHTB = "RIGHTB", i.SEARCH = "SEARCH", i.SEARCHB = "SEARCHB", i.SUBSTITUTE = "SUBSTITUTE", i.T = "T", i.TEXT = "TEXT", i.TEXTAFTER = "TEXTAFTER", i.TEXTBEFORE = "TEXTBEFORE", i.TEXTJOIN = "TEXTJOIN", i.TEXTSPLIT = "TEXTSPLIT", i.TRIM = "TRIM", i.UNICHAR = "UNICHAR", i.UNICODE = "UNICODE", i.UPPER = "UPPER", i.VALUE = "VALUE", i.VALUETOTEXT = "VALUETOTEXT", i.CALL = "CALL", i.EUROCONVERT = "EUROCONVERT", i.REGISTER_ID = "REGISTER.ID", i))(se || {}), yh = Object.getOwnPropertyDescriptor, Rh = (i, a, e, t) => {
@@ -8398,7 +8417,7 @@ class Vh extends Ge {
       this.setValue(g.create(m.VALUE));
       return;
     }
-    r == null && (r = ue.create()), n == null && (n = ue.create()), r.isReferenceObject() && (r = r.toArrayValueObject()), n.isReferenceObject() && (n = n.toArrayValueObject()), this.setValue(
+    r == null && (r = ce.create()), n == null && (n = ce.create()), r.isReferenceObject() && (r = r.toArrayValueObject()), n.isReferenceObject() && (n = n.toArrayValueObject()), this.setValue(
       this._functionExecutor.calculate(
         r,
         n
@@ -9791,9 +9810,9 @@ let Zs = class extends Ne {
           const E = Vi(r, d, this._lexer, this._astTreeBuilder, this._currentConfigService), { firstRow: b, firstColumn: R } = this._getFirstCellOfRange(_), p = this._dependencyManagerService.getOtherFormulaDependency(r, o, l), N = (p == null ? void 0 : p.getValue(0, 0)) || cr(this._dependencyManagerService), M = new bs(N);
           for (let w = 0; w < _.length; w++) {
             const S = _[w], { startRow: D, startColumn: L, endRow: U, endColumn: x } = S;
-            for (let F = D; F <= U; F++)
+            for (let k = D; k <= U; k++)
               for (let Q = L; Q <= x; Q++) {
-                const ne = Q - R, z = F - b;
+                const ne = Q - R, z = k - b;
                 if (ne === 0 && z === 0) {
                   M.node = E, M.formula = d, M.unitId = r, M.subUnitId = o, M.formulaId = l, M.type = Ks.OTHER_FORMULA, M.isCache = C, t.push(M), this._dependencyManagerService.addOtherFormulaDependency(r, o, l, M), this._dependencyManagerService.addFormulaDependencyByDefinedName(M);
                   continue;
@@ -10789,7 +10808,7 @@ class V {
     if (s == null)
       return g.create(m.NA);
     let o;
-    return t.getRowCount() === 1 ? o = t.get(0, s) || ue.create() : o = t.get(s, 0) || ue.create(), o.isNull() ? y.create(0) : o;
+    return t.getRowCount() === 1 ? o = t.get(0, s) || ce.create() : o = t.get(s, 0) || ce.create(), o.isNull() ? y.create(0) : o;
   }
   _getOneFirstByRaw(a) {
     return a.length === 0 ? g.create(m.NA) : a[0][0] || g.create(m.NA);
@@ -10802,14 +10821,14 @@ class V {
     return r ? this._getOneFirstByRaw(n) : this._getOneLastByRaw(n);
   }
   fuzzySearch(a, e, t, r = !0) {
-    const n = t.pickRaw(e.compare(a, k.EQUALS));
+    const n = t.pickRaw(e.compare(a, F.EQUALS));
     return r ? this._getOneFirstByRaw(n) : this._getOneLastByRaw(n);
   }
   orderSearch(a, e, t, r = Le.MIN, n = !1) {
     const s = e.orderSearch(a, r, n);
     if (s == null)
       return g.create(m.NA);
-    const o = t.get(s.row, s.column) || ue.create();
+    const o = t.get(s.row, s.column) || ce.create();
     return o.isNull() ? g.create(m.NA) : o;
   }
   binarySearchExpand(a, e, t, r = 0, n, s) {
@@ -10822,7 +10841,7 @@ class V {
     return r ? o = s.getFirstTruePosition() : o = s.getLastTruePosition(), o == null ? g.create(m.NA) : n === 0 ? t.slice([o.row, o.row + 1]) : t.slice(void 0, [o.column, o.column + 1]);
   }
   fuzzySearchExpand(a, e, t, r = !0, n = 0) {
-    const s = e.compare(a, k.EQUALS);
+    const s = e.compare(a, F.EQUALS);
     let o;
     return r ? o = s.getFirstTruePosition() : o = s.getLastTruePosition(), o == null ? g.create(m.NA) : n === 0 ? t.slice([o.row, o.row + 1]) : t.slice(void 0, [o.column, o.column + 1]);
   }
@@ -14248,12 +14267,6 @@ class sg extends V {
     A(this, "maxParams", 3);
   }
   calculate(e, t, r) {
-    if (e.isError())
-      return e;
-    if (t.isError())
-      return t;
-    if (r.isError())
-      return r;
     const n = Math.max(
       e.isArray() ? e.getRowCount() : 1,
       t.isArray() ? t.getRowCount() : 1,
@@ -14262,25 +14275,27 @@ class sg extends V {
       e.isArray() ? e.getColumnCount() : 1,
       t.isArray() ? t.getColumnCount() : 1,
       r.isArray() ? r.getColumnCount() : 1
-    ), o = O(n, s, e), u = O(n, s, t), c = O(n, s, r);
-    return o.map((l, f, h) => {
-      const d = u.get(f, h) || ue.create(), _ = c.get(f, h) || ue.create();
-      if (l.isError())
-        return l;
-      if (d.isError())
-        return d;
+    ), o = O(n, s, e, g.create(m.NA)), u = O(n, s, t, g.create(m.NA)), c = O(n, s, r, g.create(m.NA)), l = o.map((f, h, d) => {
+      const _ = u.get(h, d), C = c.get(h, d);
+      if (f.isError())
+        return f;
       if (_.isError())
         return _;
-      if (l.isString() || d.isString() || _.isString())
-        return g.create(m.VALUE);
-      let C = +l.getValue();
-      const E = Math.floor(+d.getValue()), b = +_.getValue();
-      if (C < 0 || C > 9999)
+      if (C.isError())
+        return C;
+      const { isError: E, errorObject: b, variants: R } = B(f, _, C);
+      if (E)
+        return b;
+      const [p, N, M] = R;
+      let w = Math.floor(+p.getValue());
+      const S = Math.floor(+N.getValue()), D = Math.floor(+M.getValue());
+      if (w < 0 || w > 9999)
         return g.create(m.NUM);
-      C >= 0 && C < 1899 && (C += 1900);
-      const R = new Date(C, E - 1, b), p = Re(R);
-      return p < 0 ? g.create(m.NUM) : y.create(p, $a);
+      w >= 0 && w < 1899 && (w += 1900);
+      const L = new Date(w, S - 1, D), U = Re(L);
+      return U < 0 ? g.create(m.NUM) : y.create(U, $a);
     });
+    return n === 1 && s === 1 ? l.get(0, 0) : l;
   }
 }
 class ag extends V {
@@ -14483,7 +14498,7 @@ class lg extends V {
       t.isArray() ? t.getColumnCount() : 1
     ), s = O(r, n, e), o = O(r, n, t);
     return s.map((u, c, l) => {
-      const f = o.get(c, l) || ue.create();
+      const f = o.get(c, l) || ce.create();
       if (u.isError())
         return u;
       if (f.isError())
@@ -14886,7 +14901,7 @@ class yg extends V {
     return o.map((l, f, h) => this._calculateTime(l, u, c, f, h));
   }
   _calculateTime(e, t, r, n, s) {
-    let o = e, u = t.get(n, s) || ue.create(), c = r.get(n, s) || ue.create();
+    let o = e, u = t.get(n, s) || ce.create(), c = r.get(n, s) || ce.create();
     if ((o.isString() || o.isBoolean()) && (o = o.convertToNumberObjectValue()), (u.isString() || u.isBoolean()) && (u = u.convertToNumberObjectValue()), (c.isString() || c.isBoolean()) && (c = c.convertToNumberObjectValue()), o.isError())
       return o;
     if (u.isError())
@@ -15658,7 +15673,7 @@ P.prototype.cos = function() {
   const i = this.toNumber();
   return new P(Math.cos(i));
 };
-let he = class ce {
+let he = class ue {
   constructor(a) {
     A(this, "_inumber", "");
     A(this, "_realNum", 0);
@@ -15687,8 +15702,8 @@ let he = class ce {
     return o;
   }
   static createByComplexStr(a, e, t) {
-    const r = ce.getComplex(a, e, t);
-    return new ce(r);
+    const r = ue.getComplex(a, e, t);
+    return new ue(r);
   }
   _getImReal() {
     if (this._inumber === 0 || this._inumber === "0") {
@@ -15754,7 +15769,7 @@ let he = class ce {
     return this._isError;
   }
   toString() {
-    return ce.getComplex(this._realNum, this._iNum, this._suffix);
+    return ue.getComplex(this._realNum, this._iNum, this._suffix);
   }
   isDifferentSuffixes(a) {
     const e = a.getSuffix();
@@ -15769,15 +15784,15 @@ let he = class ce {
     return this._iNum < 0 && (e = -e), e;
   }
   Conjugate() {
-    return ce.getComplex(this._realNum, -this._iNum, this._suffix);
+    return ue.getComplex(this._realNum, -this._iNum, this._suffix);
   }
   Cos() {
     if (this._iNum) {
       const a = P.cos(this._realNum).mul(P.cosh(this._iNum)).toNumber(), e = P.sin(this._realNum).mul(P.sinh(this._iNum)).negated().toNumber();
-      return ce.getComplex(a, e, this._suffix);
+      return ue.getComplex(a, e, this._suffix);
     } else {
       const a = P.cos(this._realNum).toNumber();
-      return ce.getComplex(a, this._iNum, this._suffix);
+      return ue.getComplex(a, this._iNum, this._suffix);
     }
   }
   Cosh() {
@@ -15785,19 +15800,19 @@ let he = class ce {
       return this._isError = !0, "";
     if (this._iNum) {
       const a = P.cosh(this._realNum).mul(P.cos(this._iNum)).toNumber(), e = P.sinh(this._realNum).mul(P.sin(this._iNum)).toNumber();
-      return ce.getComplex(a, e, this._suffix);
+      return ue.getComplex(a, e, this._suffix);
     } else {
       const a = P.cosh(this._realNum).toNumber();
-      return ce.getComplex(a, this._iNum, this._suffix);
+      return ue.getComplex(a, this._iNum, this._suffix);
     }
   }
   Cot() {
     if (this._iNum) {
       const a = P.cosh(this._iNum * 2).sub(P.cos(this._realNum * 2)), e = P.sin(this._realNum * 2).div(a).toNumber(), t = P.sinh(this._iNum * 2).div(a).negated().toNumber();
-      return ce.getComplex(e, t, this._suffix);
+      return ue.getComplex(e, t, this._suffix);
     } else {
       const a = new P(1).div(P.tan(this._realNum)).toNumber();
-      return ce.getComplex(a, this._iNum, this._suffix);
+      return ue.getComplex(a, this._iNum, this._suffix);
     }
   }
   Coth() {
@@ -15805,45 +15820,45 @@ let he = class ce {
       return this._isError = !0, "";
     if (this._iNum) {
       const a = P.cosh(this._realNum * 2).sub(P.cos(this._iNum * 2)), e = P.sinh(this._realNum * 2).div(a).toNumber(), t = P.sin(this._iNum * 2).div(a).negated().toNumber();
-      return ce.getComplex(e, t, this._suffix);
+      return ue.getComplex(e, t, this._suffix);
     } else {
       const a = new P(1).div(P.tanh(this._realNum)).toNumber();
-      return ce.getComplex(a, this._iNum, this._suffix);
+      return ue.getComplex(a, this._iNum, this._suffix);
     }
   }
   Csc() {
     if (this._iNum) {
       const a = P.cosh(this._iNum * 2).sub(P.cos(this._realNum * 2)), e = P.sin(this._realNum).mul(P.cosh(this._iNum)).mul(2).div(a).toNumber(), t = P.cos(this._realNum).mul(P.sinh(this._iNum)).mul(-2).div(a).toNumber();
-      return ce.getComplex(e, t, this._suffix);
+      return ue.getComplex(e, t, this._suffix);
     } else {
       const a = new P(1).div(P.sin(this._realNum)).toNumber();
-      return ce.getComplex(a, this._iNum, this._suffix);
+      return ue.getComplex(a, this._iNum, this._suffix);
     }
   }
   Csch() {
     if (!Number.isFinite(Math.sinh(this._realNum)) || !Number.isFinite(Math.cosh(this._realNum)))
-      return ce.getComplex(0, 0, this._suffix);
+      return ue.getComplex(0, 0, this._suffix);
     if (this._iNum) {
       const a = P.cosh(this._realNum * 2).sub(P.cos(this._iNum * 2)), e = P.sinh(this._realNum).mul(P.cos(this._iNum)).mul(2).div(a).toNumber(), t = P.cosh(this._realNum).mul(P.sin(this._iNum)).mul(-2).div(a).toNumber();
-      return ce.getComplex(e, t, this._suffix);
+      return ue.getComplex(e, t, this._suffix);
     } else {
       const a = new P(1).div(P.sinh(this._realNum)).toNumber();
-      return ce.getComplex(a, this._iNum, this._suffix);
+      return ue.getComplex(a, this._iNum, this._suffix);
     }
   }
   Div(a) {
     const e = new P(this._realNum), t = new P(this._iNum), r = new P(a.getRealNum()), n = new P(a.getINum()), s = r.mul(r).add(n.mul(n)), o = e.mul(r).add(t.mul(n)).div(s).toNumber(), u = t.mul(r).sub(e.mul(n)).div(s).toNumber(), c = this._suffix === "" ? a.getSuffix() : this._suffix;
-    return ce.getComplex(o, u, c);
+    return ue.getComplex(o, u, c);
   }
   Exp() {
     if (!Number.isFinite(Math.exp(this._realNum)))
       return this._isError = !0, "";
     const a = P.exp(this._realNum).mul(P.cos(this._iNum)).toNumber(), e = P.exp(this._realNum).mul(P.sin(this._iNum)).toNumber();
-    return ce.getComplex(a, e, this._suffix);
+    return ue.getComplex(a, e, this._suffix);
   }
   Ln() {
     const a = P.sqrt(P.pow(this._realNum, 2).add(P.pow(this._iNum, 2))), e = P.ln(a).toNumber(), t = P.acos(new P(this._realNum).div(a)).toNumber();
-    return ce.getComplex(e, t, this._suffix);
+    return ue.getComplex(e, t, this._suffix);
   }
   Log(a) {
     const e = P.sqrt(P.pow(this._realNum, 2).add(P.pow(this._iNum, 2))), t = P.ln(e);
@@ -15853,47 +15868,47 @@ let he = class ce {
     if (o.eq(0))
       return this._isError = !0, "";
     const u = t.mul(n).add(r.mul(s)).div(o).toNumber(), c = r.mul(n).sub(t.mul(s)).div(o).toNumber();
-    return ce.getComplex(u, c, this._suffix);
+    return ue.getComplex(u, c, this._suffix);
   }
   Power(a) {
     if (this._realNum === 0 && this._iNum === 0)
-      return a > 0 ? ce.getComplex(this._realNum, this._iNum, this._suffix) : (this._isError = !0, "");
+      return a > 0 ? ue.getComplex(this._realNum, this._iNum, this._suffix) : (this._isError = !0, "");
     let e = P.sqrt(P.pow(this._realNum, 2).add(P.pow(this._iNum, 2))), t = P.acos(new P(this._realNum).div(e));
     this._iNum < 0 && (t = t.negated()), e = P.pow(e, a), t = t.mul(a);
     const r = P.cos(t).mul(e).toNumber(), n = P.sin(t).mul(e).toNumber();
-    return !Number.isFinite(r) || !Number.isFinite(n) ? (this._isError = !0, "") : ce.getComplex(r, n, this._suffix);
+    return !Number.isFinite(r) || !Number.isFinite(n) ? (this._isError = !0, "") : ue.getComplex(r, n, this._suffix);
   }
   Product(a) {
     const e = new P(this._realNum), t = new P(this._iNum), r = new P(a.getRealNum()), n = new P(a.getINum()), s = e.mul(r).sub(t.mul(n)).toNumber(), o = e.mul(n).add(t.mul(r)).toNumber(), u = this._suffix === "" ? a.getSuffix() : this._suffix;
-    return ce.getComplex(s, o, u);
+    return ue.getComplex(s, o, u);
   }
   Sec() {
     if (this._iNum) {
       const a = P.cosh(this._iNum * 2).add(P.cos(this._realNum * 2)), e = P.cos(this._realNum).mul(P.cosh(this._iNum)).mul(2).div(a).toNumber(), t = P.sin(this._realNum).mul(P.sinh(this._iNum)).mul(2).div(a).toNumber();
-      return ce.getComplex(e, t, this._suffix);
+      return ue.getComplex(e, t, this._suffix);
     } else {
       const a = new P(1).div(P.cos(this._realNum)).toNumber();
-      return ce.getComplex(a, this._iNum, this._suffix);
+      return ue.getComplex(a, this._iNum, this._suffix);
     }
   }
   Sech() {
     if (!Number.isFinite(Math.sinh(this._realNum * 2)) || !Number.isFinite(Math.cosh(this._realNum * 2)))
-      return ce.getComplex(0, 0, this._suffix);
+      return ue.getComplex(0, 0, this._suffix);
     if (this._iNum) {
       const a = P.cosh(this._realNum * 2).add(P.cos(this._iNum * 2)), e = P.cosh(this._realNum).mul(P.cos(this._iNum)).mul(2).div(a).toNumber(), t = P.sinh(this._realNum).mul(P.sin(this._iNum)).mul(-2).div(a).toNumber();
-      return ce.getComplex(e, t, this._suffix);
+      return ue.getComplex(e, t, this._suffix);
     } else {
       const a = new P(1).div(P.cosh(this._realNum)).toNumber();
-      return ce.getComplex(a, this._iNum, this._suffix);
+      return ue.getComplex(a, this._iNum, this._suffix);
     }
   }
   Sin() {
     if (this._iNum) {
       const a = P.sin(this._realNum).mul(P.cosh(this._iNum)).toNumber(), e = P.cos(this._realNum).mul(P.sinh(this._iNum)).toNumber();
-      return ce.getComplex(a, e, this._suffix);
+      return ue.getComplex(a, e, this._suffix);
     } else {
       const a = P.sin(this._realNum).toNumber();
-      return ce.getComplex(a, this._iNum, this._suffix);
+      return ue.getComplex(a, this._iNum, this._suffix);
     }
   }
   Sinh() {
@@ -15901,10 +15916,10 @@ let he = class ce {
       return this._isError = !0, "";
     if (this._iNum) {
       const a = P.sinh(this._realNum).mul(P.cos(this._iNum)).toNumber(), e = P.cosh(this._realNum).mul(P.sin(this._iNum)).toNumber();
-      return ce.getComplex(a, e, this._suffix);
+      return ue.getComplex(a, e, this._suffix);
     } else {
       const a = P.sinh(this._realNum).toNumber();
-      return ce.getComplex(a, this._iNum, this._suffix);
+      return ue.getComplex(a, this._iNum, this._suffix);
     }
   }
   Sqrt() {
@@ -15912,23 +15927,23 @@ let he = class ce {
     let t = P.acos(new P(this._realNum).div(a));
     this._iNum < 0 && (t = t.negated());
     const r = e.mul(P.cos(t.div(2).toNumber())).toNumber(), n = e.mul(P.sin(t.div(2))).toNumber();
-    return ce.getComplex(r, n, this._suffix);
+    return ue.getComplex(r, n, this._suffix);
   }
   Sub(a) {
     const e = new P(this._realNum), t = new P(this._iNum), r = new P(a.getRealNum()), n = new P(a.getINum()), s = e.sub(r).toNumber(), o = t.sub(n).toNumber(), u = this._suffix === "" ? a.getSuffix() : this._suffix;
-    return ce.getComplex(s, o, u);
+    return ue.getComplex(s, o, u);
   }
   Sum(a) {
     const e = new P(this._realNum), t = new P(this._iNum), r = new P(a.getRealNum()), n = new P(a.getINum()), s = e.add(r).toNumber(), o = t.add(n).toNumber(), u = this._suffix === "" ? a.getSuffix() : this._suffix;
-    return ce.getComplex(s, o, u);
+    return ue.getComplex(s, o, u);
   }
   Tan() {
     if (this._iNum) {
       const a = P.cos(this._realNum * 2).add(P.cosh(this._iNum * 2)), e = P.sin(this._realNum * 2).div(a).toNumber(), t = P.sinh(this._iNum * 2).div(a).toNumber();
-      return ce.getComplex(e, t, this._suffix);
+      return ue.getComplex(e, t, this._suffix);
     } else {
       const a = P.tan(this._realNum).toNumber();
-      return ce.getComplex(a, this._iNum, this._suffix);
+      return ue.getComplex(a, this._iNum, this._suffix);
     }
   }
   Tanh() {
@@ -15936,10 +15951,10 @@ let he = class ce {
       return this._isError = !0, "";
     if (this._iNum) {
       const a = P.cosh(this._realNum * 2).add(P.cos(this._iNum * 2)), e = P.sinh(this._realNum * 2).div(a).toNumber(), t = P.sin(this._iNum * 2).div(a).toNumber();
-      return ce.getComplex(e, t, this._suffix);
+      return ue.getComplex(e, t, this._suffix);
     } else {
       const a = P.tanh(this._realNum).toNumber();
-      return ce.getComplex(a, this._iNum, this._suffix);
+      return ue.getComplex(a, this._iNum, this._suffix);
     }
   }
 };
@@ -17583,8 +17598,8 @@ class F1 extends V {
     const D = $(b);
     if (typeof D != "number")
       return D;
-    const L = +R.getValue(), U = +p.getValue(), x = Math.floor(+N.getValue()), F = Math.floor(+M.getValue()), Q = +f.getValue();
-    return Number.isNaN(L) || Number.isNaN(U) || Number.isNaN(x) || Number.isNaN(F) || Number.isNaN(Q) ? g.create(m.VALUE) : L <= 0 || U <= 0 || ![1, 2, 4].includes(x) || F < 0 || F > 4 || Math.floor(w) >= Math.floor(D) ? g.create(m.NUM) : this._getResult(w, S, D, L, U, x, F, Q);
+    const L = +R.getValue(), U = +p.getValue(), x = Math.floor(+N.getValue()), k = Math.floor(+M.getValue()), Q = +f.getValue();
+    return Number.isNaN(L) || Number.isNaN(U) || Number.isNaN(x) || Number.isNaN(k) || Number.isNaN(Q) ? g.create(m.VALUE) : L <= 0 || U <= 0 || ![1, 2, 4].includes(x) || k < 0 || k > 4 || Math.floor(w) >= Math.floor(D) ? g.create(m.NUM) : this._getResult(w, S, D, L, U, x, k, Q);
   }
   _getResult(e, t, r, n, s, o, u, c) {
     let l = $t(e, t, o);
@@ -17907,7 +17922,7 @@ class Z1 extends V {
       const p = f.get(b, R), N = h.get(b, R), M = d.get(b, R), w = _.get(b, R), { isError: S, errorObject: D, variants: L } = B(E, p, N, M, w);
       if (S)
         return D;
-      const [U, x, F, Q, ne] = L, z = +U.getValue(), G = +x.getValue(), ge = +F.getValue();
+      const [U, x, k, Q, ne] = L, z = +U.getValue(), G = +x.getValue(), ge = +k.getValue();
       let de = +Q.getValue();
       const Ee = Math.floor(+ne.getValue());
       return z < 0 || G < 0 || ge <= 0 || de <= 0 || Math.floor(de) > Math.floor(ge) || Ee < 1 || Ee > 12 ? g.create(m.NUM) : (de < 1 && (de = 1), de = Math.floor(de), this._getResult(z, G, ge, de, Ee, b, R));
@@ -17950,7 +17965,7 @@ class z1 extends V {
       const p = f.get(b, R), N = h.get(b, R), M = d.get(b, R), w = _.get(b, R), { isError: S, errorObject: D, variants: L } = B(E, p, N, M, w);
       if (S)
         return D;
-      const [U, x, F, Q, ne] = L, z = +U.getValue(), G = +x.getValue(), ge = +F.getValue(), de = +Q.getValue(), Ee = +ne.getValue();
+      const [U, x, k, Q, ne] = L, z = +U.getValue(), G = +x.getValue(), ge = +k.getValue(), de = +Q.getValue(), Ee = +ne.getValue();
       if (z < 0 || G < 0 || ge <= 0 || de <= 0 || de > ge || Ee <= 0)
         return g.create(m.NUM);
       const pe = na(z, G, ge, de, Ee);
@@ -18104,7 +18119,7 @@ class s0 extends V {
       const N = h.get(R, p), M = d.get(R, p), w = _.get(R, p), S = C.get(R, p), { isError: D, errorObject: L, variants: U } = B(b, N, M, w, S);
       if (D)
         return L;
-      const [x, F, Q, ne, z] = U, G = +x.getValue(), ge = +F.getValue(), de = +Q.getValue(), Ee = +ne.getValue(), pe = +z.getValue(), me = ar(G, ge, de, Ee, pe ? 1 : 0);
+      const [x, k, Q, ne, z] = U, G = +x.getValue(), ge = +k.getValue(), de = +Q.getValue(), Ee = +ne.getValue(), pe = +z.getValue(), me = ar(G, ge, de, Ee, pe ? 1 : 0);
       return Number.isNaN(me) || !Number.isFinite(me) ? g.create(m.NUM) : R === 0 && p === 0 ? y.create(me, ze(this.getLocale())) : y.create(me);
     });
     return c === 1 && l === 1 ? E.get(0, 0) : E;
@@ -18194,9 +18209,9 @@ class o0 extends V {
       u.isArray() ? u.getColumnCount() : 1,
       c.isArray() ? c.getColumnCount() : 1
     ), h = O(l, f, e, g.create(m.NA)), d = O(l, f, t, g.create(m.NA)), _ = O(l, f, r, g.create(m.NA)), C = O(l, f, n, g.create(m.NA)), E = O(l, f, u, g.create(m.NA)), b = O(l, f, c, g.create(m.NA)), R = h.map((p, N, M) => {
-      const w = d.get(N, M), S = _.get(N, M), D = C.get(N, M), L = E.get(N, M), U = b.get(N, M), { isError: x, errorObject: F, variants: Q } = B(p, w, S, D, L, U);
+      const w = d.get(N, M), S = _.get(N, M), D = C.get(N, M), L = E.get(N, M), U = b.get(N, M), { isError: x, errorObject: k, variants: Q } = B(p, w, S, D, L, U);
       if (x)
-        return F;
+        return k;
       const [ne, z, G, ge, de, Ee] = Q, pe = +ne.getValue(), me = +z.getValue(), ve = +G.getValue(), ht = +ge.getValue(), Dt = +de.getValue(), Lt = +Ee.getValue();
       if (me < 1 || Math.floor(me) > Math.ceil(ve))
         return g.create(m.NUM);
@@ -18286,10 +18301,10 @@ class c0 extends V {
       const E = c.get(_, C), b = l.get(_, C), R = f.get(_, C), { isError: p, errorObject: N, variants: M } = B(d, E, b, R);
       if (p)
         return N;
-      const [w, S, D, L] = M, U = +w.getValue(), x = +S.getValue(), F = +D.getValue(), Q = +L.getValue();
-      if (F === 0)
+      const [w, S, D, L] = M, U = +w.getValue(), x = +S.getValue(), k = +D.getValue(), Q = +L.getValue();
+      if (k === 0)
         return g.create(m.DIV_BY_ZERO);
-      const ne = Q * U * (x / F - 1);
+      const ne = Q * U * (x / k - 1);
       return y.create(ne);
     });
     return s === 1 && o === 1 ? h.get(0, 0) : h;
@@ -18454,7 +18469,7 @@ class m0 extends V {
       const N = h.get(R, p), M = d.get(R, p), w = _.get(R, p), S = C.get(R, p), { isError: D, errorObject: L, variants: U } = B(b, N, M, w, S);
       if (D)
         return L;
-      const [x, F, Q, ne, z] = U, G = +x.getValue(), ge = +F.getValue(), de = +Q.getValue(), Ee = +ne.getValue();
+      const [x, k, Q, ne, z] = U, G = +x.getValue(), ge = +k.getValue(), de = +Q.getValue(), Ee = +ne.getValue();
       let pe = +z.getValue();
       if (pe = pe ? 1 : 0, G === 0 && ge === 0)
         return g.create(m.DIV_BY_ZERO);
@@ -18558,12 +18573,12 @@ class d0 extends V {
     const x = $(R);
     if (typeof x != "number")
       return x;
-    const F = +p.getValue(), Q = +N.getValue(), ne = +M.getValue(), z = Math.floor(+w.getValue()), G = Math.floor(+S.getValue());
-    if (Number.isNaN(F) || Number.isNaN(Q) || Number.isNaN(ne) || Number.isNaN(z) || Number.isNaN(G))
+    const k = +p.getValue(), Q = +N.getValue(), ne = +M.getValue(), z = Math.floor(+w.getValue()), G = Math.floor(+S.getValue());
+    if (Number.isNaN(k) || Number.isNaN(Q) || Number.isNaN(ne) || Number.isNaN(z) || Number.isNaN(G))
       return g.create(m.VALUE);
-    if (F < 0 || Q < 0 || ne <= 0 || ![1, 2, 4].includes(z) || G < 0 || G > 4 || !this._validDate(L, x, D, U, z))
+    if (k < 0 || Q < 0 || ne <= 0 || ![1, 2, 4].includes(z) || G < 0 || G > 4 || !this._validDate(L, x, D, U, z))
       return g.create(m.NUM);
-    const ge = Uu(D, L, U, x, F, Q, ne, z, G);
+    const ge = Uu(D, L, U, x, k, Q, ne, z, G);
     return y.create(ge);
   }
   _validDate(e, t, r, n, s) {
@@ -18597,8 +18612,8 @@ class C0 extends V {
     const x = $(R);
     if (typeof x != "number")
       return x;
-    const F = +p.getValue(), Q = +N.getValue(), ne = +M.getValue(), z = Math.floor(+w.getValue()), G = Math.floor(+S.getValue());
-    return Number.isNaN(F) || Number.isNaN(Q) || Number.isNaN(ne) || Number.isNaN(z) || Number.isNaN(G) ? g.create(m.VALUE) : F < 0 || Q <= 0 || ne <= 0 || ![1, 2, 4].includes(z) || G < 0 || G > 4 || !this._validDate(L, x, D, U, z) ? g.create(m.NUM) : this._getResult(D, L, U, x, F, Q, ne, z, G);
+    const k = +p.getValue(), Q = +N.getValue(), ne = +M.getValue(), z = Math.floor(+w.getValue()), G = Math.floor(+S.getValue());
+    return Number.isNaN(k) || Number.isNaN(Q) || Number.isNaN(ne) || Number.isNaN(z) || Number.isNaN(G) ? g.create(m.VALUE) : k < 0 || Q <= 0 || ne <= 0 || ![1, 2, 4].includes(z) || G < 0 || G > 4 || !this._validDate(L, x, D, U, z) ? g.create(m.NUM) : this._getResult(D, L, U, x, k, Q, ne, z, G);
   }
   _validDate(e, t, r, n, s) {
     return this._getDateCorrectOrder(e, t, r, n) && vu(e, t, s) && Mr(n, e, s);
@@ -18636,12 +18651,12 @@ class _0 extends V {
     const D = $(E);
     if (typeof D != "number")
       return D;
-    const L = +b.getValue(), U = +R.getValue(), x = +p.getValue(), F = Math.floor(+N.getValue()), Q = Math.floor(+M.getValue());
-    if (Number.isNaN(L) || Number.isNaN(U) || Number.isNaN(x) || Number.isNaN(F) || Number.isNaN(Q))
+    const L = +b.getValue(), U = +R.getValue(), x = +p.getValue(), k = Math.floor(+N.getValue()), Q = Math.floor(+M.getValue());
+    if (Number.isNaN(L) || Number.isNaN(U) || Number.isNaN(x) || Number.isNaN(k) || Number.isNaN(Q))
       return g.create(m.VALUE);
-    if (L < 0 || U < 0 || x <= 0 || ![1, 2, 4].includes(F) || Q < 0 || Q > 4 || !this._validDate(S, w, D, F))
+    if (L < 0 || U < 0 || x <= 0 || ![1, 2, 4].includes(k) || Q < 0 || Q > 4 || !this._validDate(S, w, D, k))
       return g.create(m.NUM);
-    const ne = this._getResult(w, S, D, L, U, x, F, Q);
+    const ne = this._getResult(w, S, D, L, U, x, k, Q);
     return y.create(ne);
   }
   _validDate(e, t, r, n) {
@@ -18699,12 +18714,12 @@ class A0 extends V {
     const D = $(E);
     if (typeof D != "number")
       return D;
-    const L = +b.getValue(), U = +R.getValue(), x = +p.getValue(), F = Math.floor(+N.getValue()), Q = Math.floor(+M.getValue());
-    if (Number.isNaN(L) || Number.isNaN(U) || Number.isNaN(x) || Number.isNaN(F) || Number.isNaN(Q))
+    const L = +b.getValue(), U = +R.getValue(), x = +p.getValue(), k = Math.floor(+N.getValue()), Q = Math.floor(+M.getValue());
+    if (Number.isNaN(L) || Number.isNaN(U) || Number.isNaN(x) || Number.isNaN(k) || Number.isNaN(Q))
       return g.create(m.VALUE);
-    if (L < 0 || U <= 0 || x <= 0 || ![1, 2, 4].includes(F) || Q < 0 || Q > 4 || !this._validDate(S, w, D, F))
+    if (L < 0 || U <= 0 || x <= 0 || ![1, 2, 4].includes(k) || Q < 0 || Q > 4 || !this._validDate(S, w, D, k))
       return g.create(m.NUM);
-    const ne = this._getResult(w, S, D, L, U, x, F, Q);
+    const ne = this._getResult(w, S, D, L, U, x, k, Q);
     return y.create(ne);
   }
   _validDate(e, t, r, n) {
@@ -18793,7 +18808,7 @@ class b0 extends V {
       const N = h.get(R, p), M = d.get(R, p), w = _.get(R, p), S = C.get(R, p), { isError: D, errorObject: L, variants: U } = B(b, N, M, w, S);
       if (D)
         return L;
-      const [x, F, Q, ne, z] = U, G = +x.getValue(), ge = +F.getValue(), de = +Q.getValue(), Ee = +ne.getValue(), pe = +z.getValue();
+      const [x, k, Q, ne, z] = U, G = +x.getValue(), ge = +k.getValue(), de = +Q.getValue(), Ee = +ne.getValue(), pe = +z.getValue();
       if (G <= -1)
         return g.create(m.NUM);
       const me = qr(G, ge, de, Ee, pe ? 1 : 0);
@@ -18825,9 +18840,9 @@ class y0 extends V {
       u.isArray() ? u.getColumnCount() : 1,
       c.isArray() ? c.getColumnCount() : 1
     ), h = O(l, f, e, g.create(m.NA)), d = O(l, f, t, g.create(m.NA)), _ = O(l, f, r, g.create(m.NA)), C = O(l, f, n, g.create(m.NA)), E = O(l, f, u, g.create(m.NA)), b = O(l, f, c, g.create(m.NA)), R = h.map((p, N, M) => {
-      const w = d.get(N, M), S = _.get(N, M), D = C.get(N, M), L = E.get(N, M), U = b.get(N, M), { isError: x, errorObject: F, variants: Q } = B(p, w, S, D, L, U);
+      const w = d.get(N, M), S = _.get(N, M), D = C.get(N, M), L = E.get(N, M), U = b.get(N, M), { isError: x, errorObject: k, variants: Q } = B(p, w, S, D, L, U);
       if (x)
-        return F;
+        return k;
       const [ne, z, G, ge, de, Ee] = Q, pe = +ne.getValue(), me = +z.getValue(), ve = +G.getValue(), ht = +ge.getValue(), Dt = +de.getValue(), Lt = +Ee.getValue();
       if (me < 1 || Math.floor(me) > Math.ceil(ve) || me - ve >= 1)
         return g.create(m.NUM);
@@ -18918,7 +18933,7 @@ class V0 extends V {
     const D = this._getDateCorrectOrder(p, R, N);
     if (M < 0 || w < 0 || S < 0 || S > 4 || !D)
       return g.create(m.NUM);
-    const L = Du(R, S), { days: U } = _e(R, p, S), { days: x } = _e(N, p, S), { days: F } = _e(N, R, S), Q = (100 + x / L * M * 100) / (1 + U / L * w) - F / L * M * 100;
+    const L = Du(R, S), { days: U } = _e(R, p, S), { days: x } = _e(N, p, S), { days: k } = _e(N, R, S), Q = (100 + x / L * M * 100) / (1 + U / L * w) - k / L * M * 100;
     return y.create(Q);
   }
   _getDateCorrectOrder(e, t, r) {
@@ -18949,7 +18964,7 @@ class N0 extends V {
       const N = h.get(R, p), M = d.get(R, p), w = _.get(R, p), S = C.get(R, p), { isError: D, errorObject: L, variants: U } = B(b, N, M, w, S);
       if (D)
         return L;
-      const [x, F, Q, ne, z] = U, G = +x.getValue(), ge = +F.getValue(), de = +Q.getValue(), Ee = +ne.getValue();
+      const [x, k, Q, ne, z] = U, G = +x.getValue(), ge = +k.getValue(), de = +Q.getValue(), Ee = +ne.getValue();
       let pe = +z.getValue();
       pe = pe ? 1 : 0;
       const me = G === 0 ? -de * ge - Ee : ((1 - (1 + G) ** ge) / G * de * (1 + G * pe) - Ee) / (1 + G) ** ge;
@@ -18980,8 +18995,8 @@ class O0 extends V {
       c.isArray() ? c.getColumnCount() : 1,
       l.isArray() ? l.getColumnCount() : 1
     ), d = O(f, h, e, g.create(m.NA)), _ = O(f, h, t, g.create(m.NA)), C = O(f, h, r, g.create(m.NA)), E = O(f, h, u, g.create(m.NA)), b = O(f, h, c, g.create(m.NA)), R = O(f, h, l, g.create(m.NA)), p = d.map((N, M, w) => {
-      const S = _.get(M, w), D = C.get(M, w), L = E.get(M, w), U = b.get(M, w), x = R.get(M, w), { isError: F, errorObject: Q, variants: ne } = B(N, S, D, L, U, x);
-      if (F)
+      const S = _.get(M, w), D = C.get(M, w), L = E.get(M, w), U = b.get(M, w), x = R.get(M, w), { isError: k, errorObject: Q, variants: ne } = B(N, S, D, L, U, x);
+      if (k)
         return Q;
       const [z, G, ge, de, Ee, pe] = ne, me = +z.getValue(), ve = +G.getValue(), ht = +ge.getValue(), Dt = +de.getValue();
       let Lt = +Ee.getValue();
@@ -19274,7 +19289,7 @@ class j0 extends V {
       const C = t.get(d, _), E = r.get(d, _), b = n.get(d, _), R = s.get(d, _), p = o.get(d, _), N = u.get(d, _), { isError: M, errorObject: w, variants: S } = B(h, C, E, b, R, p, N);
       if (M)
         return w;
-      const [D, L, U, x, F, Q, ne] = S, z = +D.getValue(), G = +L.getValue(), ge = +U.getValue(), de = +x.getValue(), Ee = +F.getValue(), pe = +Q.getValue(), me = +ne.getValue();
+      const [D, L, U, x, k, Q, ne] = S, z = +D.getValue(), G = +L.getValue(), ge = +U.getValue(), de = +x.getValue(), Ee = +k.getValue(), pe = +Q.getValue(), me = +ne.getValue();
       if (z < 0 || G < 0 || ge < 0 || de < 0 || Ee < 0 || Ee > ge || de > Ee || pe < 0)
         return g.create(m.NUM);
       if (ge === 0 && de === 0 && Ee === 0)
@@ -19695,7 +19710,7 @@ class I0 extends V {
     const D = this._getDateCorrectOrder(p, R, N);
     if (M < 0 || w <= 0 || S < 0 || S > 4 || !D)
       return g.create(m.NUM);
-    const L = Du(R, S), { days: U } = _e(R, p, S), { days: x } = _e(N, p, S), { days: F } = _e(N, R, S), Q = ((1 + x / L * M) / (w / 100 + F / L * M) - 1) / (U / L);
+    const L = Du(R, S), { days: U } = _e(R, p, S), { days: x } = _e(N, p, S), { days: k } = _e(N, R, S), Q = ((1 + x / L * M) / (w / 100 + k / L * M) - 1) / (U / L);
     return y.create(Q);
   }
   _getDateCorrectOrder(e, t, r) {
@@ -20497,7 +20512,7 @@ class Ad extends V {
       (o) => O(t, r, o, g.create(m.NA))
     ), s = n[0].map((o, u, c) => {
       for (let l = 0; l < n.length; l += 2) {
-        const f = n[l].get(u, c) || ue.create(), h = n[l + 1].get(u, c) || ue.create();
+        const f = n[l].get(u, c) || ce.create(), h = n[l + 1].get(u, c) || ce.create();
         if (f.isNull())
           continue;
         if (f.isError())
@@ -20819,7 +20834,7 @@ class Md extends V {
   calculate(e, ...t) {
     if (e.isError())
       return e;
-    const r = t.length % 2 !== 0, n = r ? t[t.length - 1] : ue.create();
+    const r = t.length % 2 !== 0, n = r ? t[t.length - 1] : ce.create();
     return !e.isArray() && !t.some((s) => s.isArray()) ? this._handleNonArrayInputs(e, t, n, r) : this._handleArrayInputs(e, t, n, r);
   }
   _handleNonArrayInputs(e, t, r, n) {
@@ -20848,7 +20863,7 @@ class Md extends V {
     ), l = O(s, o, r, g.create(m.NA));
     return u.map((f, h, d) => {
       for (let C = 0; C < c.length - (n ? 1 : 0); C += 2) {
-        const E = c[C].get(h, d) || ue.create(), b = c[C + 1].get(h, d) || ue.create();
+        const E = c[C].get(h, d) || ce.create(), b = c[C + 1].get(h, d) || ce.create();
         if (!E.isNull()) {
           if (E.isError() || f.isError())
             return E.isError() ? E : f;
@@ -20856,7 +20871,7 @@ class Md extends V {
             return b.isNull() ? g.create(m.NA) : b;
         }
       }
-      const _ = l.get(h, d) || ue.create();
+      const _ = l.get(h, d) || ce.create();
       return _.isNull() ? g.create(m.NA) : _;
     });
   }
@@ -22844,7 +22859,7 @@ class fC extends V {
       const u = Is(n), c = Bs(r);
       o = s.binarySearch(e, u, c);
     } else if (r === 2) {
-      const u = s.compare(e, k.EQUALS);
+      const u = s.compare(e, F.EQUALS);
       let c;
       if (n !== -1 ? c = u.getFirstTruePosition() : c = u.getLastTruePosition(), c == null)
         return g.create(m.NA);
@@ -25082,7 +25097,7 @@ class x_ extends V {
       return this._calculateSingleCell(e, t);
     {
       const l = e.flatten(), f = t.flatten();
-      let h = ue.create();
+      let h = ce.create();
       const d = [], _ = [];
       let C = 0;
       return l.iterator((E, b, R) => {
@@ -25134,7 +25149,7 @@ class j_ extends V {
       return this._calculateSingleCell(e, t);
     {
       const l = e.flatten(), f = t.flatten();
-      let h = ue.create();
+      let h = ce.create();
       const d = [], _ = [];
       let C = 0;
       return l.iterator((E, b, R) => {
@@ -25186,7 +25201,7 @@ class U_ extends V {
       return this._calculateSingleCell(e, t);
     {
       const l = e.flatten(), f = t.flatten();
-      let h = ue.create();
+      let h = ce.create();
       const d = [], _ = [];
       let C = 0;
       return l.iterator((E, b, R) => {
@@ -25354,7 +25369,7 @@ class F_ extends V {
     super(...arguments);
     A(this, "minParams", 2);
     A(this, "maxParams", 2);
-    A(this, "_compareType", k.EQUALS);
+    A(this, "_compareType", F.EQUALS);
   }
   setCompareType(e) {
     this._compareType = e;
@@ -26170,9 +26185,9 @@ class mA extends V {
     if (e.isError())
       return e;
     if (e.isNull() || e.isBoolean())
-      return ue.create();
+      return ce.create();
     const t = e.getValue();
-    return W(t) ? y.create(+t) : ue.create();
+    return W(t) ? y.create(+t) : ce.create();
   }
 }
 class gA extends V {
@@ -26812,20 +26827,20 @@ class wA extends V {
     const { coefficients: o, X: u, XTXInverse: c } = s;
     let l = [];
     if (n) {
-      const f = e.flat(), h = f.length, d = r ? f.reduce((x, F) => x + F, 0) / h : 0, _ = c.length, C = h - _, E = o[0].length, b = new Array(E - 2).fill(m.NA), R = o[0][E - 1], p = [];
+      const f = e.flat(), h = f.length, d = r ? f.reduce((x, k) => x + k, 0) / h : 0, _ = c.length, C = h - _, E = o[0].length, b = new Array(E - 2).fill(m.NA), R = o[0][E - 1], p = [];
       for (let x = 0; x < u.length; x++) {
-        let F = R;
+        let k = R;
         for (let Q = E - 2; Q >= 0; Q--)
-          F += o[0][E - 2 - Q] * u[x][Q];
-        p.push(F);
+          k += o[0][E - 2 - Q] * u[x][Q];
+        p.push(k);
       }
       let N = 0, M = 0;
       for (let x = 0; x < h; x++)
         N += (f[x] - d) ** 2, M += (f[x] - p[x]) ** 2;
       const w = N - M, S = N === 0 ? 0 : w / N, D = [];
       for (let x = _ - 1; x >= 0; x--) {
-        const F = C > 0 ? Math.sqrt(M / C * c[x][x]) : 0;
-        D.push(F);
+        const k = C > 0 ? Math.sqrt(M / C * c[x][x]) : 0;
+        D.push(k);
       }
       if (r) {
         const x = D.shift();
@@ -26933,25 +26948,25 @@ class SA extends V {
     const { coefficients: o, Y: u, X: c, XTXInverse: l } = s;
     let f = [];
     if (n) {
-      const h = u.flat(), d = h.length, _ = r ? h.reduce((F, Q) => F + Q, 0) / d : 0, C = l.length, E = d - C, b = o[0].length, R = new Array(b - 2).fill(m.NA), p = o[0][b - 1], N = [];
-      for (let F = 0; F < c.length; F++) {
+      const h = u.flat(), d = h.length, _ = r ? h.reduce((k, Q) => k + Q, 0) / d : 0, C = l.length, E = d - C, b = o[0].length, R = new Array(b - 2).fill(m.NA), p = o[0][b - 1], N = [];
+      for (let k = 0; k < c.length; k++) {
         let Q = p;
         for (let ne = b - 2; ne >= 0; ne--)
-          Q *= o[0][b - 2 - ne] ** c[F][ne];
+          Q *= o[0][b - 2 - ne] ** c[k][ne];
         N.push(Math.log(Q));
       }
       let M = 0, w = 0;
-      for (let F = 0; F < d; F++)
-        M += (h[F] - _) ** 2, !(!r && !Number.isFinite(N[F])) && (w += (h[F] - N[F]) ** 2);
+      for (let k = 0; k < d; k++)
+        M += (h[k] - _) ** 2, !(!r && !Number.isFinite(N[k])) && (w += (h[k] - N[k]) ** 2);
       Number.isFinite(w) || (w = 0);
       const S = M - w, D = M === 0 ? 0 : S / M, L = [];
-      for (let F = C - 1; F >= 0; F--) {
-        const Q = E > 0 ? Math.sqrt(w / E * l[F][F]) : 0;
+      for (let k = C - 1; k >= 0; k--) {
+        const Q = E > 0 ? Math.sqrt(w / E * l[k][k]) : 0;
         L.push(Q);
       }
       if (r) {
-        const F = L.shift();
-        L.push(F);
+        const k = L.shift();
+        L.push(k);
       } else
         L.push(m.NA);
       const U = E > 0 ? Math.sqrt(w / E) : 0, x = E > 0 ? S / (b - 1) / (w / E) : m.NUM;
@@ -28946,7 +28961,7 @@ class ME extends V {
     ), n = Math.max(
       e.isArray() ? e.getColumnCount() : 1,
       t.isArray() ? t.getColumnCount() : 1
-    ), s = O(r, n, e, ue.create()), o = O(r, n, t, ue.create()), u = s.mapValue((c, l, f) => {
+    ), s = O(r, n, e, ce.create()), o = O(r, n, t, ce.create()), u = s.mapValue((c, l, f) => {
       const h = o.get(l, f);
       return c.isError() ? c : h.isError() ? h : this._handleSingleObject(c, h);
     });
@@ -29161,7 +29176,7 @@ class xE extends V {
     ), s = Math.max(
       e.isArray() ? e.getColumnCount() : 1,
       r.isArray() ? r.getColumnCount() : 1
-    ), o = O(n, s, e, ue.create()), u = O(n, s, r, ue.create()), c = o.mapValue((l, f, h) => {
+    ), o = O(n, s, e, ce.create()), u = O(n, s, r, ce.create()), c = o.mapValue((l, f, h) => {
       const d = u.get(f, h);
       return l.isError() ? l : d.isError() ? d : this._handleSingleObject(l, d);
     });
@@ -30314,12 +30329,7 @@ class lb extends V {
       if (c.isBoolean())
         return c;
       let d = c.getValue();
-      if (c.isNull() && (d = 0), c.isString()) {
-        if (!W(d))
-          return c;
-        d = Number(d);
-      }
-      h.isNull() && (h = j.create(" "));
+      c.isNull() && (d = 0), c.isString() && W(d) && (d = Number(d)), h.isNull() && (h = j.create(" "));
       const _ = `${h.getValue()}`, C = qa(_, d);
       return j.create(_ === " " ? C.trimEnd() : C);
     });
@@ -30578,7 +30588,7 @@ class mb extends V {
       return r;
     const [u] = o, c = +u.getValue();
     let l = r;
-    c && (l = r.filter((h) => h !== null));
+    c && (l = r.filter((h) => h !== null && h !== ""));
     let f = "";
     for (let h = 0; h < l.length; h++)
       l[h] !== null && (f += l[h]), h < l.length - 1 && (f += e[h % e.length]);
@@ -31545,7 +31555,7 @@ export {
   Ar as Lexer,
   ae as LexerNode,
   ga as LexerTreeBuilder,
-  ue as NullValueObject,
+  ce as NullValueObject,
   y as NumberValueObject,
   wn as OperatorNodeFactory,
   Ih as OtherFormulaManagerService,
@@ -31577,7 +31587,7 @@ export {
   Wi as UniverFormulaEnginePlugin,
   Io as ValueNodeFactory,
   Mt as ValueObjectFactory,
-  k as compareToken,
+  F as compareToken,
   Ic as convertUnitDataToRuntime,
   Wh as deserializeRangeForR1C1,
   Dr as deserializeRangeWithSheet,
@@ -31618,8 +31628,10 @@ export {
   Wc as isReferenceStrings,
   Xb as matchRefDrawToken,
   K as matchToken,
+  Ds as needsQuoting,
   Kb as normalizeSheetName,
   X as operatorToken,
+  Ls as quoteSheetName,
   $e as sequenceNodeType,
   Ft as serializeRange,
   Ss as serializeRangeToRefString,
@@ -31627,5 +31639,6 @@ export {
   Gc as serializeRangeWithSpreadsheet,
   fs as singleReferenceToGrid,
   yi as strip,
-  ba as stripErrorMargin
+  ba as stripErrorMargin,
+  ui as unquoteSheetName
 };