@univerjs/engine-formula 0.10.14-nightly.202511031023 → 0.10.14-nightly.202511070640

package/lib/es/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;
       }
@@ -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;
     }
   }
@@ -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 });
     };
@@ -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 = ce.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) {
@@ -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 {
@@ -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;
@@ -10802,7 +10821,7 @@ 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) {
@@ -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]);
   }
@@ -17579,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);
@@ -17903,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));
@@ -17946,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);
@@ -18100,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;
@@ -18190,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);
@@ -18282,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;
@@ -18450,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);
@@ -18554,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) {
@@ -18593,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);
@@ -18632,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) {
@@ -18695,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) {
@@ -18789,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);
@@ -18821,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);
@@ -18914,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) {
@@ -18945,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;
@@ -18976,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();
@@ -19270,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)
@@ -19691,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) {
@@ -22840,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);
@@ -25350,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;
@@ -26808,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();
@@ -26929,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;
@@ -30574,7 +30593,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]);
@@ -31573,7 +31592,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,
@@ -31614,8 +31633,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,
@@ -31623,5 +31644,6 @@ export {
   Gc as serializeRangeWithSpreadsheet,
   fs as singleReferenceToGrid,
   yi as strip,
-  ba as stripErrorMargin
+  ba as stripErrorMargin,
+  ui as unquoteSheetName
 };