@sheetxl/formulas 0.7.28-beta.3 → 0.8.0-beta.1

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (60) hide show
  1. package/README.md +0 -1
  2. package/browser/cjs/index.cjs +1 -1
  3. package/browser/esm/{-K3H4uuFynImIzaZ.mjs → -f-RKKojiLg94hp9.mjs} +1 -1
  4. package/browser/esm/{BEcbx0ePT8A6OjyJ.mjs → 0amsHACCOHE_JjXI.mjs} +1 -1
  5. package/browser/esm/{CHfLioI7aeuBiog7.mjs → B3pEie3jQN0SvV5B.mjs} +1 -1
  6. package/{node/esm/Cy5JRFfnImDAp0Ll.mjs → browser/esm/B7750ljsJF3qA9kU.mjs} +1 -1
  7. package/browser/esm/{B6rygD_RAHNXcOAb.mjs → BM1YhvA2ppUZ3QLB.mjs} +1 -1
  8. package/browser/esm/{BlqScy7PLzA3TJWD.mjs → BR2ai1V5dGPphpRf.mjs} +1 -1
  9. package/browser/esm/{tRrV1IMjoctvX4ZH.mjs → BYRjnggsufwbb27W.mjs} +1 -1
  10. package/browser/esm/{od91bpLi591BCMYw.mjs → Bsb5i9Jq-Q8RTmvi.mjs} +1 -1
  11. package/browser/esm/{B3UCYNFvj_EjJphm.mjs → BzNFsi4RXuJrn_1n.mjs} +1 -1
  12. package/browser/esm/{B8wDjOEoDr9y2rBc.mjs → C7mAHEhFYDwSEU6O.mjs} +1 -1
  13. package/browser/esm/{DMcqvOS9dt8YgeTi.mjs → C9jpXFBeugwmOTbx.mjs} +1 -1
  14. package/browser/esm/{BDqiJ8pkk7cc_o9u.mjs → CCGjvL3YYwY09qF-.mjs} +1 -1
  15. package/{node/esm/BmmkpHOZkUEBeAyW.mjs → browser/esm/CG1Fn8D-2DrQZoD5.mjs} +1 -1
  16. package/browser/esm/{C75Qbz3eEqNXEhpL.mjs → CVv3DuciDQrnFFeu.mjs} +1 -1
  17. package/browser/esm/{CDZHVK66T1WYATSp.mjs → CWAtVXxcIz86XLzE.mjs} +1 -1
  18. package/browser/esm/{BghB7zHcCqFgdw90.mjs → Cdl7ZalV6WPZHHRE.mjs} +1 -1
  19. package/browser/esm/{DOUIWQ7CkAL8H3TI.mjs → CkG4LZN-kb7plKXG.mjs} +1 -1
  20. package/{node/esm/Dnec7DXcVTbiXqmG.mjs → browser/esm/CltdofO5ik8g_wQ8.mjs} +1 -1
  21. package/{node/esm/CwRS0LJWcQtYVRc8.mjs → browser/esm/Crb70T1Sp1S4uzq4.mjs} +1 -1
  22. package/{node/esm/B6y-wWIovFMjN5tD.mjs → browser/esm/Ct1gudv1TKk-5FMO.mjs} +1 -1
  23. package/{node/esm/Bl0eYznrlnTAaweo.mjs → browser/esm/Cyvobf2wi0quDD3U.mjs} +1 -1
  24. package/browser/esm/{B9-TE-YYGCaJ-yME.mjs → D2miaIrotHbpdWei.mjs} +1 -1
  25. package/browser/esm/{l-wX1u0rFT9w8qf4.mjs → DKFABgVKeBMflym9.mjs} +1 -1
  26. package/{node/esm/CJcU813BPMqm5rOx.mjs → browser/esm/DtqLXxtPFISlNoUd.mjs} +1 -1
  27. package/{node/esm/CitESUUMpeNocyom.mjs → browser/esm/HgVmqQQhKQ_2v0HD.mjs} +1 -1
  28. package/browser/esm/index.mjs +1048 -1032
  29. package/node/esm/{-K3H4uuFynImIzaZ.mjs → -f-RKKojiLg94hp9.mjs} +1 -1
  30. package/node/esm/{BSC7kpdD1DnC5HDg.mjs → 2TCIoMd-SYs6i4-N.mjs} +1 -1
  31. package/{browser/esm/Cy5JRFfnImDAp0Ll.mjs → node/esm/B7750ljsJF3qA9kU.mjs} +1 -1
  32. package/node/esm/{D4U0YPOGduCwF-01.mjs → B8rSUcOwH6g4MUgm.mjs} +1 -1
  33. package/node/esm/{BlqScy7PLzA3TJWD.mjs → BR2ai1V5dGPphpRf.mjs} +1 -1
  34. package/node/esm/{B3UCYNFvj_EjJphm.mjs → BzNFsi4RXuJrn_1n.mjs} +1 -1
  35. package/node/esm/{B8wDjOEoDr9y2rBc.mjs → C7mAHEhFYDwSEU6O.mjs} +1 -1
  36. package/node/esm/{DMcqvOS9dt8YgeTi.mjs → C9jpXFBeugwmOTbx.mjs} +1 -1
  37. package/node/esm/{BDqiJ8pkk7cc_o9u.mjs → CCGjvL3YYwY09qF-.mjs} +1 -1
  38. package/{browser/esm/BmmkpHOZkUEBeAyW.mjs → node/esm/CG1Fn8D-2DrQZoD5.mjs} +1 -1
  39. package/node/esm/{C75Qbz3eEqNXEhpL.mjs → CVv3DuciDQrnFFeu.mjs} +1 -1
  40. package/node/esm/{CDZHVK66T1WYATSp.mjs → CWAtVXxcIz86XLzE.mjs} +1 -1
  41. package/node/esm/{BghB7zHcCqFgdw90.mjs → Cdl7ZalV6WPZHHRE.mjs} +1 -1
  42. package/node/esm/{DOUIWQ7CkAL8H3TI.mjs → CkG4LZN-kb7plKXG.mjs} +1 -1
  43. package/{browser/esm/Dnec7DXcVTbiXqmG.mjs → node/esm/CltdofO5ik8g_wQ8.mjs} +1 -1
  44. package/{browser/esm/CwRS0LJWcQtYVRc8.mjs → node/esm/Crb70T1Sp1S4uzq4.mjs} +1 -1
  45. package/{browser/esm/B6y-wWIovFMjN5tD.mjs → node/esm/Ct1gudv1TKk-5FMO.mjs} +1 -1
  46. package/{browser/esm/Bl0eYznrlnTAaweo.mjs → node/esm/Cyvobf2wi0quDD3U.mjs} +1 -1
  47. package/node/esm/{B9-TE-YYGCaJ-yME.mjs → D2miaIrotHbpdWei.mjs} +1 -1
  48. package/node/esm/{BwSSmpNc_yz9k1Td.mjs → DDajoVNkJB39_Fkx.mjs} +1 -1
  49. package/node/esm/{l-wX1u0rFT9w8qf4.mjs → DKFABgVKeBMflym9.mjs} +1 -1
  50. package/{browser/esm/CJcU813BPMqm5rOx.mjs → node/esm/DtqLXxtPFISlNoUd.mjs} +1 -1
  51. package/node/esm/{B2aMDwqSRk2dNVyP.mjs → DxRD19RVMzj2YvKF.mjs} +1 -1
  52. package/{browser/esm/CitESUUMpeNocyom.mjs → node/esm/HgVmqQQhKQ_2v0HD.mjs} +1 -1
  53. package/node/esm/{CYv-b3CPx4IESjrY.mjs → ZUay0bTGgyrF8e04.mjs} +1 -1
  54. package/node/esm/index.mjs +1090 -1074
  55. package/package.json +3 -3
  56. package/types/src/_utils/AggregateIFS.d.ts +2 -2
  57. package/types/src/_utils/Errors.d.ts +1 -1
  58. package/types/src/information/Information.d.ts +6 -6
  59. package/types/src/lookupReference/Reference.d.ts +4 -4
  60. package/types/src/mathTrig/Math.d.ts +6 -3
@@ -1,5 +1,5 @@
1
1
  /**
2
- * @license @sheetxl/formulas - Formulas - TypeScript formulas compatible with Excel built-ins. - v0.7.28-beta.3
2
+ * @license @sheetxl/formulas - Formulas - TypeScript formulas compatible with Excel built-ins. - v0.8.0-beta.1
3
3
  *
4
4
  * (C) 2026-present SheetXL Inc. & Michael T. Ford
5
5
  * License: The license can be found at https://www.sheetxl.com/license.
@@ -26,8 +26,8 @@ function m(n) {
26
26
  var p = c({
27
27
  DAVERAGE: () => g,
28
28
  DCOUNT: () => I,
29
- DCOUNTA: () => N,
30
- DGET: () => h,
29
+ DCOUNTA: () => h,
30
+ DGET: () => N,
31
31
  DMAX: () => b,
32
32
  DMIN: () => E,
33
33
  DPRODUCT: () => A,
@@ -38,7 +38,7 @@ var p = c({
38
38
  DVARP: () => R
39
39
  });
40
40
  function g(n, r, e) {
41
- const u = v(n, r, e);
41
+ const u = w(n, r, e);
42
42
  if (t.isError(u)) return u;
43
43
  const o = u.getStats().getAggregates().average;
44
44
  if (null == o) throw t.BuiltIn.Div0;
@@ -48,26 +48,26 @@ function I(n, r, e) {
48
48
  const u = C(n, r, e);
49
49
  return t.isError(u) ? u : u.getStats().getAggregates().numericalCount ?? 0;
50
50
  }
51
- function N(n, r, e) {
51
+ function h(n, r, e) {
52
52
  const u = C(n, r, e);
53
53
  return t.isError(u) ? u : u.getStats().getAggregates().count ?? 0;
54
54
  }
55
- function h(n, r, e) {
55
+ function N(n, r, e) {
56
56
  const u = C(n, r, e);
57
57
  if (t.isError(u)) return u;
58
58
  const { rows: o } = u.getShape();
59
59
  return 0 === o ? t.BuiltIn.Value : o > 1 ? t.BuiltIn.Num : u.getValueAt(0, 0);
60
60
  }
61
61
  function b(n, r, e) {
62
- const u = v(n, r, e);
62
+ const u = w(n, r, e);
63
63
  return t.isError(u) ? u : u.getStats().getAggregates().max ?? 0;
64
64
  }
65
65
  function E(n, r, e) {
66
- const u = v(n, r, e);
66
+ const u = w(n, r, e);
67
67
  return t.isError(u) ? u : u.getStats().getAggregates().min ?? 0;
68
68
  }
69
69
  function A(n, r, e) {
70
- const u = v(n, r, e);
70
+ const u = w(n, r, e);
71
71
  if (t.isError(u)) return u;
72
72
  let o = 1, a = !1;
73
73
  return u.forEach((n) => {
@@ -75,39 +75,39 @@ function A(n, r, e) {
75
75
  }), a ? o : 0;
76
76
  }
77
77
  function M(n, r, e) {
78
- const u = v(n, r, e);
78
+ const u = w(n, r, e);
79
79
  if (t.isError(u)) return u;
80
80
  const o = u.getStats().getAggregates();
81
81
  return (o.numericalCount ?? 0) < 2 ? t.BuiltIn.Div0 : o.stdDev ?? 0;
82
82
  }
83
83
  function d(n, r, e) {
84
- const u = v(n, r, e);
84
+ const u = w(n, r, e);
85
85
  if (t.isError(u)) return u;
86
86
  const o = u.getStats().getAggregates();
87
87
  return o.numericalCount ? o.stdDevP ?? 0 : t.BuiltIn.Div0;
88
88
  }
89
89
  function S(n, r, e) {
90
- const u = v(n, r, e);
90
+ const u = w(n, r, e);
91
91
  return t.isError(u) ? u : u.getStats().getAggregates().sum ?? 0;
92
92
  }
93
93
  function T(n, r, e) {
94
- const u = v(n, r, e);
94
+ const u = w(n, r, e);
95
95
  if (t.isError(u)) return u;
96
96
  const o = u.getStats().getAggregates();
97
97
  return (o.numericalCount ?? 0) < 2 ? t.BuiltIn.Div0 : o.var ?? 0;
98
98
  }
99
99
  function R(n, r, e) {
100
- const u = v(n, r, e);
100
+ const u = w(n, r, e);
101
101
  if (t.isError(u)) return u;
102
102
  const o = u.getStats().getAggregates();
103
103
  return o.numericalCount ? o.varP ?? 0 : t.BuiltIn.Div0;
104
104
  }
105
105
  function C(r, e, u) {
106
- const o = w(r, e);
106
+ const o = v(r, e);
107
107
  return o < 0 ? t.BuiltIn.Value : r.take(function(t, r) {
108
108
  const { rows: e } = t.getShape(), u = function(t, r) {
109
109
  const { rows: e, columns: u } = r.getShape(), o = [];
110
- for (let n = 0; n < u; n++) o[n] = w(t, r.getValueAt(0, n));
110
+ for (let n = 0; n < u; n++) o[n] = v(t, r.getValueAt(0, n));
111
111
  const a = [];
112
112
  for (let t = 1; t < e; t++) {
113
113
  const e = [];
@@ -133,11 +133,11 @@ function C(r, e, u) {
133
133
  colEnd: o
134
134
  });
135
135
  }
136
- function v(n, r, e) {
136
+ function w(n, r, e) {
137
137
  const u = C(n, r, e);
138
138
  return t.isError(u) || f(u), u;
139
139
  }
140
- function w(n, t) {
140
+ function v(n, t) {
141
141
  const { columns: r } = n.getShape();
142
142
  if ("number" == typeof t) {
143
143
  const n = Math.trunc(t) - 1;
@@ -167,8 +167,8 @@ var B = c({
167
167
  NETWORKDAYS_INTL: () => K,
168
168
  NOW: () => j,
169
169
  SECOND: () => q,
170
- TIME: () => Q,
171
- TIMEVALUE: () => z,
170
+ TIME: () => z,
171
+ TIMEVALUE: () => Q,
172
172
  TODAY: () => $,
173
173
  WEEKDAY: () => Z,
174
174
  WEEKNUM: () => J,
@@ -288,13 +288,13 @@ function j() {
288
288
  function q(t) {
289
289
  return n.getDateParts(t).second;
290
290
  }
291
- function Q(t, r, e) {
291
+ function z(t, r, e) {
292
292
  if (t < 0 || t > 32767 || r < 0 || r > 32767 || e < 0 || e > 32767) return NaN;
293
293
  n.formatResults("Medium Time");
294
294
  const u = (3600 * t + 60 * r + e) / 86400;
295
295
  return u - Math.floor(u);
296
296
  }
297
- function z(t) {
297
+ function Q(t) {
298
298
  const r = n.parseAsSerialDate(t);
299
299
  return r - Math.floor(r);
300
300
  }
@@ -520,8 +520,8 @@ function gn(t, r) {
520
520
  return t = n.parseAsNumber(t), r = n.parseAsNumber(r), (r = Math.trunc(r)) < 0 ? NaN : a.bessely(t, r);
521
521
  }
522
522
  var In = c({
523
- BIN2DEC: () => Nn,
524
- BIN2HEX: () => hn,
523
+ BIN2DEC: () => hn,
524
+ BIN2HEX: () => Nn,
525
525
  BIN2OCT: () => bn,
526
526
  BITAND: () => En,
527
527
  BITLSHIFT: () => An,
@@ -531,19 +531,19 @@ var In = c({
531
531
  DEC2BIN: () => Tn,
532
532
  DEC2HEX: () => Rn,
533
533
  DEC2OCT: () => Cn,
534
- HEX2BIN: () => vn,
535
- HEX2DEC: () => wn,
534
+ HEX2BIN: () => wn,
535
+ HEX2DEC: () => vn,
536
536
  HEX2OCT: () => Bn,
537
537
  OCT2BIN: () => On,
538
538
  OCT2DEC: () => Dn,
539
539
  OCT2HEX: () => yn
540
540
  });
541
- function Nn(r) {
541
+ function hn(r) {
542
542
  const e = (r = n.parseAsNumber(r)).toString();
543
543
  if (!xn.test(e)) throw t.BuiltIn.Num;
544
544
  return 10 === e.length && "1" === e.substring(0, 1) ? parseInt(e.substring(1), 2) + Un : parseInt(e, 2);
545
545
  }
546
- function hn(r, e) {
546
+ function Nn(r, e) {
547
547
  e = n.parseAsNumber(e);
548
548
  const u = (r = n.parseAsNumber(r)).toString();
549
549
  if (!xn.test(u)) throw t.BuiltIn.Num;
@@ -609,7 +609,7 @@ function Cn(r, e) {
609
609
  if (e < u.length) throw t.BuiltIn.Num;
610
610
  return "0".repeat(e - u.length) + u;
611
611
  }
612
- function vn(r, e) {
612
+ function wn(r, e) {
613
613
  if (e = n.parseAsNumber(e), t.isError(r)) throw r;
614
614
  if (r.length > 10 || !/^[0-9a-fA-F]*$/.test(r)) return NaN;
615
615
  const u = 10 === r.length && "f" === r.substring(0, 1).toLowerCase(), o = u ? parseInt(r, 16) - 1099511627776 : parseInt(r, 16);
@@ -618,7 +618,7 @@ function vn(r, e) {
618
618
  const a = o.toString(2);
619
619
  return void 0 === e ? a : (e = Math.trunc(e)) <= 0 || e < a.length ? NaN : "0".repeat(e - a.length) + a;
620
620
  }
621
- function wn(n) {
621
+ function vn(n) {
622
622
  if (!/^[0-9A-Fa-f]{1,10}$/.test(n)) return NaN;
623
623
  const t = parseInt(n, 16);
624
624
  return t >= 549755813888 ? t - 1099511627776 : t;
@@ -626,7 +626,7 @@ function wn(n) {
626
626
  function Bn(r, e) {
627
627
  if (e = n.parseAsNumber(e), t.isError(r)) throw r;
628
628
  if (r.length > 10 || !/^[0-9a-fA-F]*$/.test(r)) throw t.BuiltIn.Num;
629
- const u = wn(r);
629
+ const u = vn(r);
630
630
  if (u > Vn || u < Ln) throw t.BuiltIn.Num;
631
631
  return Cn(u, e);
632
632
  }
@@ -2195,17 +2195,17 @@ function Kn(t, r = 0) {
2195
2195
  }
2196
2196
  var jn = c({
2197
2197
  ERF: () => qn,
2198
- ERFC: () => zn,
2198
+ ERFC: () => Qn,
2199
2199
  ERFC_PRECISE: () => $n,
2200
- ERF_PRECISE: () => Qn
2200
+ ERF_PRECISE: () => zn
2201
2201
  });
2202
2202
  function qn(t, r) {
2203
2203
  return t = n.parseAsNumber(t), void 0 !== r ? (r = n.parseAsNumber(r), i.erf(r) - i.erf(t)) : i.erf(t);
2204
2204
  }
2205
- function Qn(t) {
2205
+ function zn(t) {
2206
2206
  return t = n.parseAsNumber(t), i.erf(t);
2207
2207
  }
2208
- function zn(t) {
2208
+ function Qn(t) {
2209
2209
  return t = n.parseAsNumber(t), i.erfc(t);
2210
2210
  }
2211
2211
  function $n(t) {
@@ -2221,8 +2221,8 @@ var Zn = c({
2221
2221
  IMCOSH: () => pt,
2222
2222
  IMCOT: () => gt,
2223
2223
  IMCOTH: () => It,
2224
- IMCSC: () => Nt,
2225
- IMCSCH: () => ht,
2224
+ IMCSC: () => ht,
2225
+ IMCSCH: () => Nt,
2226
2226
  IMDIV: () => bt,
2227
2227
  IMEXP: () => Et,
2228
2228
  IMLN: () => At,
@@ -2232,8 +2232,8 @@ var Zn = c({
2232
2232
  IMPOWER: () => Tt,
2233
2233
  IMPRODUCT: () => Rt,
2234
2234
  IMREAL: () => Ct,
2235
- IMSEC: () => vt,
2236
- IMSECH: () => wt,
2235
+ IMSEC: () => wt,
2236
+ IMSECH: () => vt,
2237
2237
  IMSIN: () => Bt,
2238
2238
  IMSINH: () => Ot,
2239
2239
  IMSQRT: () => Dt,
@@ -2322,11 +2322,11 @@ function It(n) {
2322
2322
  const { real: t, im: r, unit: e } = Xt(n), u = lt(at(t, r), it(t, r));
2323
2323
  return Jn(u.real, u.im, e);
2324
2324
  }
2325
- function Nt(n) {
2325
+ function ht(n) {
2326
2326
  const { real: t, im: r, unit: e } = Xt(n), u = lt(st, ot(t, r));
2327
2327
  return Jn(u.real, u.im, e);
2328
2328
  }
2329
- function ht(n) {
2329
+ function Nt(n) {
2330
2330
  const { real: t, im: r, unit: e } = Xt(n), u = lt(st, it(t, r));
2331
2331
  return Jn(u.real, u.im, e);
2332
2332
  }
@@ -2376,11 +2376,11 @@ function Rt(n) {
2376
2376
  function Ct(n) {
2377
2377
  return Xt(n).real;
2378
2378
  }
2379
- function vt(n) {
2379
+ function wt(n) {
2380
2380
  const { real: t, im: r, unit: e } = Xt(n), u = lt(st, ut(t, r));
2381
2381
  return Jn(u.real, u.im, e);
2382
2382
  }
2383
- function wt(n) {
2383
+ function vt(n) {
2384
2384
  const { real: t, im: r, unit: e } = Xt(n), u = lt(st, at(t, r));
2385
2385
  return Jn(u.real, u.im, e);
2386
2386
  }
@@ -2455,8 +2455,8 @@ var Gt = c({
2455
2455
  ISDATE: () => Kt,
2456
2456
  ISEMAIL: () => jt,
2457
2457
  ISERR: () => qt,
2458
- ISERROR: () => Qt,
2459
- ISEVEN: () => zt,
2458
+ ISERROR: () => zt,
2459
+ ISEVEN: () => Qt,
2460
2460
  ISFORMULA: () => $t,
2461
2461
  ISLOGICAL: () => Zt,
2462
2462
  ISNA: () => Jt,
@@ -2487,13 +2487,13 @@ function Ht(r, e) {
2487
2487
  });
2488
2488
  break;
2489
2489
  case "col":
2490
- u = e.getCoords().colStart + 1;
2490
+ e.getValueAt(0, 0), u = e.getCoords().colStart + 1;
2491
2491
  break;
2492
2492
  case "contents":
2493
2493
  u = e.getValueAt(0, 0);
2494
2494
  break;
2495
2495
  case "row":
2496
- u = e.getCoords().rowStart + 1;
2496
+ e.getValueAt(0, 0), u = e.getCoords().rowStart + 1;
2497
2497
  break;
2498
2498
  case "type":
2499
2499
  const a = e.getValueAt(0, 0);
@@ -2534,22 +2534,22 @@ function Kt(t) {
2534
2534
  }
2535
2535
  }
2536
2536
  function jt(n) {
2537
- return "string" == typeof n && (!!n.toLowerCase().startsWith("mailto:") || /^[^\s@]+@[^\s@]+\.[^\s@]+$/i.test(n));
2537
+ return "string" == typeof n && (n.length > 7 && "mailto:" === n.substring(0, 7).toLowerCase() ? !/\s/.test(n) : /^[^\s@]+@[^\s@]+\.[^\s@]+$/i.test(n));
2538
2538
  }
2539
2539
  function qt(n) {
2540
2540
  return t.isError(n) && !(n instanceof t.NA);
2541
2541
  }
2542
- function Qt(n) {
2542
+ function zt(n) {
2543
2543
  return t.isError(n);
2544
2544
  }
2545
- function zt(n) {
2545
+ function Qt(n) {
2546
2546
  if (n.size > 1) return t.BuiltIn.Value;
2547
2547
  const r = n.getValueAt(0, 0) ?? 0;
2548
2548
  return Math.trunc(r) % 2 == 0;
2549
2549
  }
2550
2550
  function $t(t) {
2551
2551
  const r = t.getCoords(), e = r.scope ?? void 0;
2552
- return t.map((t, u) => null !== n.getFormulaAt(r.rowStart + u.rowIndex, r.colStart + u.colIndex, e)).fillEmpty(!1);
2552
+ return n.createRange(t.getRowCount(), t.getColumnCount(), (t, u) => null !== n.getFormulaAt(r.rowStart + u.rowIndex, r.colStart + u.colIndex, e));
2553
2553
  }
2554
2554
  function Zt(n) {
2555
2555
  return "boolean" == typeof n;
@@ -2627,14 +2627,28 @@ function gr(n) {
2627
2627
  function Ir(n, r) {
2628
2628
  return t.BuiltIn.NA;
2629
2629
  }
2630
- var Nr = c({ PHONETIC: () => hr });
2631
- function hr(n) {
2630
+ var hr = c({ PHONETIC: () => Nr });
2631
+ function Nr(n) {
2632
2632
  return t.BuiltIn.NA;
2633
2633
  }
2634
2634
  function br(t, r, e, u, o) {
2635
2635
  let a = null;
2636
2636
  e && (a = n.getResizedReference(e.getCoords(), t.getRowCount(), t.getColumnCount()));
2637
2637
  const i = n.createCriteria(r), s = i(null);
2638
+ if (a && !s) {
2639
+ let n = 0;
2640
+ const r = t.entries();
2641
+ let e = r.next();
2642
+ for (; !e.done;) {
2643
+ const t = e.value;
2644
+ if (i(t.value)) {
2645
+ const r = t.coords;
2646
+ n = u(n, a.getValueAt(r.rowIndex, r.colIndex) ?? null);
2647
+ }
2648
+ e = r.next();
2649
+ }
2650
+ return n;
2651
+ }
2638
2652
  return t.alignReduce(a ? [a] : [], (n, t) => i(t[0]) ? u(n, (a ? t[1] : t[0]) ?? null) : n, 0, s ? { emptyFold: o ?? ((n, t) => function(n, t, r) {
2639
2653
  let e = n(t, null);
2640
2654
  if (1 === r) return e;
@@ -2651,8 +2665,8 @@ var Er = (n, t) => (n ?? 0) + t, Ar = (n, t) => n, Mr = c({
2651
2665
  BYROW: () => Tr,
2652
2666
  FALSE: () => Rr,
2653
2667
  FLATTEN: () => Cr,
2654
- IF: () => vr,
2655
- IFERROR: () => wr,
2668
+ IF: () => wr,
2669
+ IFERROR: () => vr,
2656
2670
  IFNA: () => Br,
2657
2671
  IFS: () => Or,
2658
2672
  LAMBDA: () => Dr,
@@ -2695,22 +2709,12 @@ function Rr() {
2695
2709
  return !1;
2696
2710
  }
2697
2711
  function Cr(n) {
2698
- const t = n[0].empty().sparseBuilder();
2699
- let e = 0;
2700
- for (const u of n) {
2701
- const n = u.entries({
2702
- axis: r.Axis.Row,
2703
- includeEmpty: !0
2704
- });
2705
- let o = n.next();
2706
- for (; !o.done;) t.pushAt(e++, 0, o.value.value), o = n.next();
2707
- }
2708
- return t.build();
2712
+ return n.map((n) => n.flatten()).reduce((n, t) => n.concat(t));
2709
2713
  }
2710
- function vr(n, t, r = !1) {
2714
+ function wr(n, t, r = !1) {
2711
2715
  return n ? t : r;
2712
2716
  }
2713
- function wr(n, r) {
2717
+ function vr(n, r) {
2714
2718
  return t.isError(n) ? r : n;
2715
2719
  }
2716
2720
  function Br(n, r) {
@@ -2826,7 +2830,7 @@ var Wr = c({ PIVOTBY: () => Kr });
2826
2830
  function Kr(n, r, e, u, o, a = 2, i, s = 2, l, c, f = 0) {
2827
2831
  throw t.BuiltIn.NA;
2828
2832
  }
2829
- var jr = Object.freeze({ includeEmpty: !0 }), qr = Object.freeze({ axis: r.Axis.Column }), Qr = Object.freeze({ axis: r.Axis.Row }), zr = (Object.freeze({
2833
+ var jr = Object.freeze({ includeEmpty: !0 }), qr = Object.freeze({ axis: r.Axis.Column }), zr = Object.freeze({ axis: r.Axis.Row }), Qr = (Object.freeze({
2830
2834
  type: u.Number,
2831
2835
  axis: r.Axis.Column
2832
2836
  }), c({
@@ -2848,8 +2852,8 @@ var jr = Object.freeze({ includeEmpty: !0 }), qr = Object.freeze({ axis: r.Axis.
2848
2852
  HLOOKUP: () => pe,
2849
2853
  HSTACK: () => ge,
2850
2854
  HYPERLINK: () => Ie,
2851
- IMAGE: () => Ne,
2852
- INDEX: () => he,
2855
+ IMAGE: () => he,
2856
+ INDEX: () => Ne,
2853
2857
  INDIRECT: () => be,
2854
2858
  LOOKUP: () => Ee,
2855
2859
  MATCH: () => Ae,
@@ -2858,19 +2862,19 @@ var jr = Object.freeze({ includeEmpty: !0 }), qr = Object.freeze({ axis: r.Axis.
2858
2862
  ROWS: () => Se,
2859
2863
  RTD: () => Te,
2860
2864
  SORT: () => Re,
2861
- SORTBY: () => ve,
2862
- TAKE: () => we,
2863
- TOCOL: () => Be,
2864
- TOROW: () => Oe,
2865
- TRANSPOSE: () => De,
2866
- TRIMRANGE: () => ye,
2867
- UNIQUE: () => xe,
2868
- VLOOKUP: () => Ve,
2869
- VSTACK: () => Le,
2870
- WRAPCOLS: () => Pe,
2871
- WRAPROWS: () => Ue,
2872
- XLOOKUP: () => _e,
2873
- XMATCH: () => Fe
2865
+ SORTBY: () => Be,
2866
+ TAKE: () => Oe,
2867
+ TOCOL: () => De,
2868
+ TOROW: () => ye,
2869
+ TRANSPOSE: () => xe,
2870
+ TRIMRANGE: () => Ve,
2871
+ UNIQUE: () => Le,
2872
+ VLOOKUP: () => Pe,
2873
+ VSTACK: () => Ue,
2874
+ WRAPCOLS: () => _e,
2875
+ WRAPROWS: () => Fe,
2876
+ XLOOKUP: () => Xe,
2877
+ XMATCH: () => Ge
2874
2878
  }));
2875
2879
  function $r(r, e, u = 1, o = !0, a) {
2876
2880
  if (r < 1 || e < 1 || u < 1 || u > 4) throw t.BuiltIn.Value;
@@ -2975,10 +2979,10 @@ function ce(n, e, u) {
2975
2979
  }
2976
2980
  function fe(r) {
2977
2981
  const e = r.getCoords(), u = e.scope ?? void 0;
2978
- return r.map((r, o) => {
2982
+ return n.createRange(r.getRowCount(), r.getColumnCount(), (r, o) => {
2979
2983
  const a = n.getFormulaAt(e.rowStart + o.rowIndex, e.colStart + o.colIndex, u);
2980
2984
  return null === a ? t.BuiltIn.NA : "=" + a;
2981
- }).fillEmpty(t.BuiltIn.NA);
2985
+ });
2982
2986
  }
2983
2987
  function me(n, r, e) {
2984
2988
  throw t.BuiltIn.Ref;
@@ -2988,7 +2992,7 @@ function pe(n, e, u, o = !0) {
2988
2992
  if (u < 1) return t.BuiltIn.Value;
2989
2993
  if (u > e.getRowCount()) return t.BuiltIn.Ref;
2990
2994
  if (1 === e.size) return t.BuiltIn.NA;
2991
- const a = typeof n, i = He(n);
2995
+ const a = typeof n, i = Ye(n);
2992
2996
  if (o) {
2993
2997
  let o = null, i = -1, s = !0, l = !1;
2994
2998
  const c = e.entries({
@@ -3004,12 +3008,12 @@ function pe(n, e, u, o = !0) {
3004
3008
  f = c.next();
3005
3009
  continue;
3006
3010
  }
3007
- const g = Ge(r, n);
3011
+ const g = ke(r, n);
3008
3012
  if (s) {
3009
3013
  o = r, i = p, s = !1, g > 0 && (l = !0), f = c.next();
3010
3014
  continue;
3011
3015
  }
3012
- const I = Ge(o, n);
3016
+ const I = ke(o, n);
3013
3017
  if (g > 0 && (l = !0), I > 0 && g > 0) return t.BuiltIn.NA;
3014
3018
  if (l && 0 === I && g < 0) return e.getValueAt(u - 1, i) ?? t.BuiltIn.NA;
3015
3019
  if (null != o && g > 0 && I <= 0) return e.getValueAt(u - 1, i) ?? t.BuiltIn.NA;
@@ -3025,7 +3029,7 @@ function pe(n, e, u, o = !0) {
3025
3029
  for (; !l.done;) {
3026
3030
  const { value: r, coords: o } = l.value;
3027
3031
  if (0 !== o.rowIndex) break;
3028
- if (i ? i.test("string" == typeof r ? r : String(r)) : 0 === Ge(r, n)) return e.getValueAt(u - 1, o.colIndex) ?? t.BuiltIn.NA;
3032
+ if (i ? i.test("string" == typeof r ? r : String(r)) : 0 === ke(r, n)) return e.getValueAt(u - 1, o.colIndex) ?? t.BuiltIn.NA;
3029
3033
  l = s.next();
3030
3034
  }
3031
3035
  return t.BuiltIn.NA;
@@ -3034,8 +3038,8 @@ function ge(n) {
3034
3038
  return n.reduce((n, t) => n.concat(t, r.Axis.Column));
3035
3039
  }
3036
3040
  function Ie(n, t) {}
3037
- function Ne(n, t, r, e, u) {}
3038
- function he(r, e, u = 0, o = 1) {
3041
+ function he(n, t, r, e, u) {}
3042
+ function Ne(r, e, u = 0, o = 1) {
3039
3043
  if (e ??= 0, e < 0 || u < 0 || o < 1) return t.BuiltIn.Value;
3040
3044
  if (o > r.length) return t.BuiltIn.Ref;
3041
3045
  const a = r[o - 1], i = a.getRowCount(), s = a.getColumnCount();
@@ -3067,15 +3071,15 @@ function Ee(r, e, u) {
3067
3071
  const o = e.getRowCount(), a = e.getColumnCount(), i = o > 1 && a > 1;
3068
3072
  if (i && !u) {
3069
3073
  if (a > o) {
3070
- const n = We(r, e, !0);
3074
+ const n = je(r, e, !0);
3071
3075
  return -1 === n ? t.BuiltIn.NA : e.getValueAt(o - 1, n) ?? t.BuiltIn.NA;
3072
3076
  }
3073
3077
  {
3074
- const n = We(r, e, !1);
3078
+ const n = je(r, e, !1);
3075
3079
  return -1 === n ? t.BuiltIn.NA : e.getValueAt(n, a - 1) ?? t.BuiltIn.NA;
3076
3080
  }
3077
3081
  }
3078
- const s = i ? a > o : 1 === o, l = We(r, e, s);
3082
+ const s = i ? a > o : 1 === o, l = je(r, e, s);
3079
3083
  return -1 === l ? t.BuiltIn.NA : u ? function(r, e, u) {
3080
3084
  const o = r.getRowCount(), a = r.getColumnCount();
3081
3085
  if (o > 1 && a > 1) return t.BuiltIn.NA;
@@ -3088,11 +3092,11 @@ function Ee(r, e, u) {
3088
3092
  }(u, l, s ? a : o) : (s ? e.getValueAt(0, l) : e.getValueAt(l, 0)) ?? 0;
3089
3093
  }
3090
3094
  function Ae(n, t, r = 1) {
3091
- return Xe(n, t, 0 === r ? 0 : r > 0 ? -1 : 1, 0 === r ? 1 : r > 0 ? 2 : -2, 0 === r);
3095
+ return He(n, t, 0 === r ? 0 : r > 0 ? -1 : 1, 0 === r ? 1 : r > 0 ? 2 : -2, 0 === r);
3092
3096
  }
3093
3097
  function Me(t, r, e, u, o) {
3094
3098
  r = Math.trunc(r), e = Math.trunc(e);
3095
- const a = t.getCoords(), [i, s] = Ke(a.rowStart + r, u ?? t.getRowCount()), [l, c] = Ke(a.colStart + e, o ?? t.getColumnCount());
3099
+ const a = t.getCoords(), [i, s] = qe(a.rowStart + r, u ?? t.getRowCount()), [l, c] = qe(a.colStart + e, o ?? t.getColumnCount());
3096
3100
  return n.getReference({
3097
3101
  rowStart: i,
3098
3102
  colStart: l,
@@ -3114,30 +3118,52 @@ function Te(n, r, e) {
3114
3118
  return t.BuiltIn.NA;
3115
3119
  }
3116
3120
  function Re(n, e, u, o = !1) {
3117
- const a = n.getRowCount(), i = n.getColumnCount(), s = o ? r.Axis.Column : r.Axis.Row, l = function(n, r) {
3121
+ const a = n.getRowCount(), i = n.getColumnCount(), s = o ? r.Axis.Column : r.Axis.Row, l = o ? a : i, c = function(n, r) {
3122
+ if (n.length > r) throw t.BuiltIn.Value;
3118
3123
  return n.map((n) => {
3119
3124
  const e = Math.trunc(n);
3120
3125
  if (!(e >= 1 && e <= r)) throw t.BuiltIn.Value;
3121
3126
  return e - 1;
3122
3127
  });
3123
- }(e ?? [1], o ? a : i), c = Ce(u ?? [1]), f = l.map((t) => o ? n.slice({
3128
+ }(we(e), l), f = ve(we(u), c.length), m = c.map((t) => o ? n.slice({
3124
3129
  rowStart: t,
3125
3130
  rowEnd: t
3126
3131
  }) : n.slice({
3127
3132
  colStart: t,
3128
3133
  colEnd: t
3129
- })), m = n.argsort(f, c, s);
3130
- return n.take(m, s).resize(a, i);
3134
+ })), p = n.argsort(m, f, s);
3135
+ return n.take(p, s).resize(a, i);
3131
3136
  }
3132
- function Ce(n) {
3133
- return n.map((n) => {
3137
+ var Ce = Object.freeze({
3138
+ includeEmpty: !0,
3139
+ onError: "value"
3140
+ });
3141
+ function we(r) {
3142
+ if (!r) return [1];
3143
+ if (r.getRowCount() > 1 && r.getColumnCount() > 1) throw t.BuiltIn.Value;
3144
+ if (r.isIReferenceRange && 1 === r.getRowCount() && 1 === r.getColumnCount()) {
3145
+ const n = r.getValueAt(0, 0);
3146
+ if (t.isError(n)) throw n;
3147
+ }
3148
+ return r.getValuesFlat(Ce).map((r) => {
3149
+ if ("number" == typeof r) return r;
3150
+ if (null === r) return 0;
3151
+ if ("boolean" == typeof r) return r ? 1 : 0;
3152
+ if ("string" == typeof r) return n.parseAsNumber(r);
3153
+ throw t.BuiltIn.Value;
3154
+ });
3155
+ }
3156
+ function ve(n, r) {
3157
+ if (1 !== n.length && n.length !== r) throw t.BuiltIn.Value;
3158
+ const e = n.map((n) => {
3134
3159
  const r = Math.trunc(n);
3135
3160
  if (1 !== r && -1 !== r) throw t.BuiltIn.Value;
3136
3161
  return r;
3137
3162
  });
3163
+ return e.length === r ? e : new Array(r).fill(e[0]);
3138
3164
  }
3139
- function ve(n, e) {
3140
- const u = e.map(([n]) => n), o = Ce(e.map(([, n]) => n ?? 1)), a = n.getRowCount(), i = n.getColumnCount();
3165
+ function Be(n, e) {
3166
+ const u = e.map(([n]) => n), o = ve(e.map(([, n]) => n ?? 1), u.length), a = n.getRowCount(), i = n.getColumnCount();
3141
3167
  for (let n = 0; n < u.length; n++) {
3142
3168
  const r = u[n];
3143
3169
  if (1 !== r.getColumnCount() || r.getRowCount() !== a) return t.BuiltIn.Value;
@@ -3145,7 +3171,7 @@ function ve(n, e) {
3145
3171
  const s = n.argsort(u, o, r.Axis.Row);
3146
3172
  return n.take(s, r.Axis.Row).resize(a, i);
3147
3173
  }
3148
- function we(n, r, e) {
3174
+ function Oe(n, r, e) {
3149
3175
  if (0 === r || 0 === e) return t.BuiltIn.Calc;
3150
3176
  const u = n.getRowCount(), o = n.getColumnCount(), a = r >= 0 ? 0 : Math.max(0, u + r), i = r >= 0 ? Math.min(r, u) : u, s = void 0 === e || e >= 0 ? 0 : Math.max(0, o + e), l = void 0 === e ? o : e >= 0 ? Math.min(e, o) : o;
3151
3177
  return n.slice({
@@ -3155,12 +3181,13 @@ function we(n, r, e) {
3155
3181
  colEnd: l - 1
3156
3182
  });
3157
3183
  }
3158
- function Be(n, t = 0, e = !1) {
3159
- const u = n.getColumnCount(), o = n.getRowCount(), a = n.empty().sparseBuilder(r.Axis.Column), i = n.entries(e ? qr : Qr);
3184
+ function De(n, t = 0, e = !1) {
3185
+ if (0 === t) return n.flatten(e ? qr : zr);
3186
+ const u = n.getColumnCount(), o = n.getRowCount(), a = n.empty().sparseBuilder(r.Axis.Column), i = n.entries(e ? qr : zr);
3160
3187
  let s = 0, l = 0, c = i.next();
3161
3188
  for (; !c.done;) {
3162
3189
  const { value: n, coords: r } = c.value;
3163
- if (c = i.next(), Ye(n, t)) s++;
3190
+ if (c = i.next(), Ke(n, t)) s++;
3164
3191
  else if (0 === t || 2 === t) {
3165
3192
  const t = e ? r.colIndex * o + r.rowIndex : r.rowIndex * u + r.colIndex;
3166
3193
  a.pushAt(t - s, 0, n);
@@ -3168,12 +3195,13 @@ function Be(n, t = 0, e = !1) {
3168
3195
  }
3169
3196
  return a.build();
3170
3197
  }
3171
- function Oe(n, t = 0, e = !1) {
3172
- const u = n.getColumnCount(), o = n.getRowCount(), a = n.empty().sparseBuilder(r.Axis.Row), i = n.entries(e ? qr : Qr);
3198
+ function ye(n, t = 0, e = !1) {
3199
+ if (0 === t) return n.flatten(e ? qr : zr).transpose();
3200
+ const u = n.getColumnCount(), o = n.getRowCount(), a = n.empty().sparseBuilder(r.Axis.Row), i = n.entries(e ? qr : zr);
3173
3201
  let s = 0, l = 0, c = i.next();
3174
3202
  for (; !c.done;) {
3175
3203
  const { value: n, coords: r } = c.value;
3176
- if (c = i.next(), Ye(n, t)) s++;
3204
+ if (c = i.next(), Ke(n, t)) s++;
3177
3205
  else if (0 === t || 2 === t) {
3178
3206
  const t = e ? r.colIndex * o + r.rowIndex : r.rowIndex * u + r.colIndex;
3179
3207
  a.pushAt(0, t - s, n);
@@ -3181,10 +3209,10 @@ function Oe(n, t = 0, e = !1) {
3181
3209
  }
3182
3210
  return a.build();
3183
3211
  }
3184
- function De(n) {
3212
+ function xe(n) {
3185
3213
  return n.transpose();
3186
3214
  }
3187
- function ye(e, u = 3, o = 3) {
3215
+ function Ve(e, u = 3, o = 3) {
3188
3216
  let a = 0, i = e.getRowCount() - 1, s = 0, l = e.getColumnCount() - 1;
3189
3217
  const c = e.isIReferenceRange;
3190
3218
  let f;
@@ -3228,17 +3256,17 @@ function ye(e, u = 3, o = 3) {
3228
3256
  let p;
3229
3257
  return c ? n.getReference(m) : (p = e.slice(m), p);
3230
3258
  }
3231
- function xe(n, e = !1, u = !1) {
3259
+ function Le(n, e = !1, u = !1) {
3232
3260
  const o = e ? r.Axis.Column : r.Axis.Row, a = n.uniqueIndices(o, u);
3233
3261
  if (0 === a.length) throw t.BuiltIn.Calc;
3234
3262
  return n.take(a, o);
3235
3263
  }
3236
- function Ve(n, e, u, o = !0) {
3264
+ function Pe(n, e, u, o = !0) {
3237
3265
  if (t.isError(n)) return n;
3238
3266
  if (u < 1) return t.BuiltIn.Value;
3239
3267
  if (u > e.getColumnCount()) return t.BuiltIn.Ref;
3240
3268
  if (1 === e.size) return t.BuiltIn.NA;
3241
- const a = typeof n, i = He(n);
3269
+ const a = typeof n, i = Ye(n);
3242
3270
  if (o) {
3243
3271
  let o = null, i = -1, s = !0, l = !1;
3244
3272
  const c = e.entries({
@@ -3254,12 +3282,12 @@ function Ve(n, e, u, o = !0) {
3254
3282
  f = c.next();
3255
3283
  continue;
3256
3284
  }
3257
- const g = Ge(r, n);
3285
+ const g = ke(r, n);
3258
3286
  if (s) {
3259
3287
  o = r, i = p, s = !1, g > 0 && (l = !0), f = c.next();
3260
3288
  continue;
3261
3289
  }
3262
- const I = Ge(o, n);
3290
+ const I = ke(o, n);
3263
3291
  if (g > 0 && (l = !0), I > 0 && g > 0) return t.BuiltIn.NA;
3264
3292
  if (l && 0 === I && g < 0) return e.getValueAt(i, u - 1) ?? t.BuiltIn.NA;
3265
3293
  if (null != o && g > 0 && I <= 0) return e.getValueAt(i, u - 1) ?? t.BuiltIn.NA;
@@ -3275,15 +3303,15 @@ function Ve(n, e, u, o = !0) {
3275
3303
  for (; !l.done;) {
3276
3304
  const { value: r, coords: o } = l.value;
3277
3305
  if (0 !== o.colIndex) break;
3278
- if (i ? i.test("string" == typeof r ? r : String(r)) : 0 === Ge(r, n)) return e.getValueAt(o.rowIndex, u - 1) ?? t.BuiltIn.NA;
3306
+ if (i ? i.test("string" == typeof r ? r : String(r)) : 0 === ke(r, n)) return e.getValueAt(o.rowIndex, u - 1) ?? t.BuiltIn.NA;
3279
3307
  l = s.next();
3280
3308
  }
3281
3309
  return t.BuiltIn.NA;
3282
3310
  }
3283
- function Le(n) {
3311
+ function Ue(n) {
3284
3312
  return n.reduce((n, t) => n.concat(t, r.Axis.Row));
3285
3313
  }
3286
- function Pe(n, e, u = t.BuiltIn.NA) {
3314
+ function _e(n, e, u = t.BuiltIn.NA) {
3287
3315
  const { rows: o, columns: a } = n.getShape();
3288
3316
  if (o > 1 && a > 1) return t.BuiltIn.Value;
3289
3317
  if (e <= 0 || !Number.isFinite(e)) return t.BuiltIn.Num;
@@ -3298,7 +3326,7 @@ function Pe(n, e, u = t.BuiltIn.NA) {
3298
3326
  for (let n = f + 1; n < l.size; n++) c.pushAt(n % e, Math.floor(n / e), u);
3299
3327
  return c.build();
3300
3328
  }
3301
- function Ue(n, e, u = t.BuiltIn.NA) {
3329
+ function Fe(n, e, u = t.BuiltIn.NA) {
3302
3330
  const { rows: o, columns: a } = n.getShape();
3303
3331
  if (o > 1 && a > 1) return t.BuiltIn.Value;
3304
3332
  if (e <= 0 || !Number.isFinite(e)) return t.BuiltIn.Num;
@@ -3313,7 +3341,7 @@ function Ue(n, e, u = t.BuiltIn.NA) {
3313
3341
  for (let n = f + 1; n < l.size; n++) c.pushAt(s - 1, n % e, u);
3314
3342
  return c.build();
3315
3343
  }
3316
- function _e(r, e, u, o = t.BuiltIn.NA, a = 0, i = 1) {
3344
+ function Xe(r, e, u, o = t.BuiltIn.NA, a = 0, i = 1) {
3317
3345
  if (![
3318
3346
  0,
3319
3347
  -1,
@@ -3328,56 +3356,45 @@ function _e(r, e, u, o = t.BuiltIn.NA, a = 0, i = 1) {
3328
3356
  ].includes(i)) throw t.BuiltIn.Value;
3329
3357
  if (2 === a && (2 === i || -2 === i)) throw t.BuiltIn.Value;
3330
3358
  if (e.getColumnCount() > 1 && e.getRowCount() > 1) throw t.BuiltIn.Value;
3331
- const s = e.flatten(jr), l = [], c = [];
3359
+ const s = e.getValuesFlat(jr), l = [], c = [];
3332
3360
  for (let n = 0; n < s.length; n++) null !== s[n] && void 0 !== s[n] && (l.push(s[n]), c.push(n));
3333
3361
  const f = 1 === e.getRowCount();
3334
- if (1 === r.getRowCount() && 1 === r.getColumnCount()) {
3335
- const e = r.getValueAt(0, 0);
3336
- if (null == e) return o;
3337
- if (t.isError(e)) return e;
3338
- const s = ke(e, l, a, i);
3339
- if (-1 === s) return o;
3340
- const m = c[s];
3341
- if (m < (f ? u.getColumnCount() : u.getRowCount())) {
3342
- if (!0 === u.isIReferenceRange) {
3343
- const t = u.getCoords();
3344
- return n.getReference(f ? {
3345
- rowStart: t.rowStart,
3346
- rowEnd: t.rowEnd,
3347
- colStart: t.colStart + m,
3348
- colEnd: t.colStart + m,
3349
- scope: t.scope
3350
- } : {
3351
- rowStart: t.rowStart + m,
3352
- rowEnd: t.rowStart + m,
3353
- colStart: t.colStart,
3354
- colEnd: t.colEnd,
3355
- scope: t.scope
3356
- });
3357
- }
3358
- return u.slice(f ? {
3359
- colStart: m,
3360
- colEnd: m
3362
+ if (null == r) return o;
3363
+ if (t.isError(r)) return r;
3364
+ const m = We(r, l, a, i);
3365
+ if (-1 === m) return o;
3366
+ const p = c[m];
3367
+ if (p < (f ? u.getColumnCount() : u.getRowCount())) {
3368
+ if (!0 === u.isIReferenceRange) {
3369
+ const t = u.getCoords();
3370
+ return n.getReference(f ? {
3371
+ rowStart: t.rowStart,
3372
+ rowEnd: t.rowEnd,
3373
+ colStart: t.colStart + p,
3374
+ colEnd: t.colStart + p,
3375
+ scope: t.scope
3361
3376
  } : {
3362
- rowStart: m,
3363
- rowEnd: m
3377
+ rowStart: t.rowStart + p,
3378
+ rowEnd: t.rowStart + p,
3379
+ colStart: t.colStart,
3380
+ colEnd: t.colEnd,
3381
+ scope: t.scope
3364
3382
  });
3365
3383
  }
3366
- return u.getValueAt(f ? 0 : m, f ? m : 0);
3384
+ return u.slice(f ? {
3385
+ colStart: p,
3386
+ colEnd: p
3387
+ } : {
3388
+ rowStart: p,
3389
+ rowEnd: p
3390
+ });
3367
3391
  }
3368
- return r.map((n) => {
3369
- if (null === n) return o;
3370
- if (t.isError(n)) return n;
3371
- const r = ke(n, l, a, i);
3372
- if (-1 === r) return o;
3373
- const e = c[r];
3374
- return u.getValueAt(f ? 0 : e, f ? e : 0);
3375
- }, jr);
3392
+ return u.getValueAt(f ? 0 : p, f ? p : 0);
3376
3393
  }
3377
- function Fe(n, t, r = 0, e = 1) {
3378
- return Xe(n, t, r, e, 2 === r);
3394
+ function Ge(n, t, r = 0, e = 1) {
3395
+ return He(n, t, r, e, 2 === r);
3379
3396
  }
3380
- function Xe(n, r, e, u, o) {
3397
+ function He(n, r, e, u, o) {
3381
3398
  if (![
3382
3399
  0,
3383
3400
  -1,
@@ -3392,30 +3409,28 @@ function Xe(n, r, e, u, o) {
3392
3409
  ].includes(u)) throw t.BuiltIn.Value;
3393
3410
  if (2 === e && (2 === u || -2 === u)) throw t.BuiltIn.Value;
3394
3411
  if (r.getColumnCount() > 1 && r.getRowCount() > 1) throw t.BuiltIn.Value;
3395
- const a = r.flatten(jr), i = [], s = [];
3412
+ if (null === n) return t.BuiltIn.NA;
3413
+ if (t.isError(n)) return n;
3414
+ const a = r.getValuesFlat(jr), i = [], s = [];
3396
3415
  for (let n = 0; n < a.length; n++) null !== a[n] && void 0 !== a[n] && (i.push(a[n]), s.push(n));
3397
- return n.map((n) => {
3398
- if (null === n) return t.BuiltIn.NA;
3399
- if (t.isError(n)) return n;
3400
- const r = ke(n, i, e, u, o);
3401
- return -1 === r ? t.BuiltIn.NA : s[r] + 1;
3402
- }, jr);
3416
+ const l = We(n, i, e, u, o);
3417
+ return -1 === l ? t.BuiltIn.NA : s[l] + 1;
3403
3418
  }
3404
- function Ge(t, r) {
3419
+ function ke(t, r) {
3405
3420
  return "number" == typeof t && "number" == typeof r ? t < r ? -1 : t > r ? 1 : 0 : n.compare(t, r);
3406
3421
  }
3407
- function He(n, t = !1) {
3422
+ function Ye(n, t = !1) {
3408
3423
  return "string" != typeof n ? null : (t ? /[*?~]/.test(n) : o.isWildCard(n)) ? o.toRegex(n, "i", !0) : null;
3409
3424
  }
3410
- function ke(n, t, r, e, u = 2 === r) {
3411
- const o = u ? He(n, 2 === r) : null;
3425
+ function We(n, t, r, e, u = 2 === r) {
3426
+ const o = u ? Ye(n, 2 === r) : null;
3412
3427
  if (2 === e || -2 === e) return function(n, t, r, e) {
3413
3428
  let u = 0, o = n.length - 1, a = -1;
3414
3429
  for (; u <= o;) {
3415
- const r = u + o >>> 1, i = Ge(n[r], t);
3430
+ const r = u + o >>> 1, i = ke(n[r], t);
3416
3431
  (e ? i <= 0 : i >= 0) ? (a = r, u = r + 1) : o = r - 1;
3417
3432
  }
3418
- return -1 !== a && 0 === Ge(n[a], t) ? a : 0 === r || 2 === r ? -1 : (e ? -1 === r : 1 === r) ? a : a + 1 < n.length ? a + 1 : -1;
3433
+ return -1 !== a && 0 === ke(n[a], t) ? a : 0 === r || 2 === r ? -1 : (e ? -1 === r : 1 === r) ? a : a + 1 < n.length ? a + 1 : -1;
3419
3434
  }(t, n, r, 2 === e);
3420
3435
  const a = -1 === e ? -1 : 1, i = -1 === e ? t.length - 1 : 0, s = -1 === e ? -1 : t.length;
3421
3436
  if (0 === r || 2 === r) {
@@ -3424,7 +3439,7 @@ function ke(n, t, r, e, u = 2 === r) {
3424
3439
  if (null != e) {
3425
3440
  if (o) {
3426
3441
  if ("string" == typeof e && o.test(e)) return r;
3427
- } else if (0 === Ge(e, n)) return r;
3442
+ } else if (0 === ke(e, n)) return r;
3428
3443
  }
3429
3444
  }
3430
3445
  return -1;
@@ -3433,16 +3448,16 @@ function ke(n, t, r, e, u = 2 === r) {
3433
3448
  for (let e = i; e !== s; e += a) {
3434
3449
  const u = t[e];
3435
3450
  if (null == u) continue;
3436
- const o = Ge(u, n);
3451
+ const o = ke(u, n);
3437
3452
  if (0 === o) return e;
3438
- -1 === r ? o < 0 && (-1 === l || Ge(u, c) > 0) && (l = e, c = u) : o > 0 && (-1 === l || Ge(u, c) < 0) && (l = e, c = u);
3453
+ -1 === r ? o < 0 && (-1 === l || ke(u, c) > 0) && (l = e, c = u) : o > 0 && (-1 === l || ke(u, c) < 0) && (l = e, c = u);
3439
3454
  }
3440
3455
  return l;
3441
3456
  }
3442
- function Ye(n, r) {
3457
+ function Ke(n, r) {
3443
3458
  return 0 !== r && ((1 === r || 3 === r) && null === n || !(2 !== r && 3 !== r || !t.isError(n)));
3444
3459
  }
3445
- function We(n, e, u) {
3460
+ function je(n, e, u) {
3446
3461
  const o = typeof n;
3447
3462
  let a = -1, i = null, s = !1;
3448
3463
  const l = u ? r.Axis.Row : r.Axis.Column, c = e.entries({
@@ -3465,21 +3480,21 @@ function We(n, e, u) {
3465
3480
  f = c.next();
3466
3481
  continue;
3467
3482
  }
3468
- const m = Ge(r, n);
3483
+ const m = ke(r, n);
3469
3484
  if (m > 0 && (s = !0), m <= 0) {
3470
- const t = null !== i && 0 === Ge(i, n);
3485
+ const t = null !== i && 0 === ke(i, n);
3471
3486
  s && t || (a = l, i = r);
3472
3487
  }
3473
3488
  f = c.next();
3474
3489
  }
3475
3490
  return a;
3476
3491
  }
3477
- var Ke = (n, r) => {
3492
+ var qe = (n, r) => {
3478
3493
  if (0 === r) throw t.BuiltIn.Ref;
3479
3494
  const e = Math.trunc(r), u = r > 0 ? n : n + e + 1, o = r > 0 ? n + e - 1 : n;
3480
3495
  return u > o ? [o, u] : [u, o];
3481
3496
  };
3482
- function je(n, r, e, u, o, a) {
3497
+ function ze(n, r, e, u, o, a) {
3483
3498
  const i = r.map((n) => n[0]), s = i[0].getColumnCount(), l = i[0].getRowCount();
3484
3499
  for (let n = 1; n < i.length; n++) if (i[n].getColumnCount() !== s || i[n].getRowCount() !== l) throw t.BuiltIn.Value;
3485
3500
  const c = i.length, f = new Array(c);
@@ -3489,82 +3504,83 @@ function je(n, r, e, u, o, a) {
3489
3504
  f[t] = e, e(null) || (m = !1);
3490
3505
  }
3491
3506
  const p = i.slice(1);
3492
- let g = -1;
3493
- u && (g = c, p.push(u));
3494
- const I = i[0].alignReduce(p, (n, t) => {
3507
+ let g = -1, I = null;
3508
+ u && (m ? (g = c, p.push(u)) : I = u);
3509
+ const h = i[0].alignReduce(p, (n, t, r) => {
3495
3510
  for (let r = 0; r < c; r++) if (!f[r](t[r])) return n;
3496
- return e(n, !(g >= 0) || (t[g] ?? null));
3511
+ let u = !0;
3512
+ return I ? u = I.getValueAt(r.rowIndex, r.colIndex) ?? null : g >= 0 && (u = t[g] ?? null), e(n, u);
3497
3513
  }, null, m && a ? { emptyFold: a } : void 0);
3498
- return null !== I ? I : o;
3499
- }
3500
- var qe = c({
3501
- ABS: () => Qe,
3502
- AGGREGATE: () => ze,
3503
- ARABIC: () => $e,
3504
- BASE: () => Ze,
3505
- CEILING: () => Je,
3506
- CEILING_MATH: () => nu,
3507
- CEILING_PRECISE: () => tu,
3508
- COMBIN: () => eu,
3509
- COMBINA: () => uu,
3510
- DECIMAL: () => ou,
3511
- DEGREES: () => au,
3512
- ECMA_CEILING: () => ru,
3513
- EVEN: () => iu,
3514
- EXP: () => su,
3515
- FACT: () => lu,
3516
- FACTDOUBLE: () => cu,
3517
- FLOOR: () => fu,
3518
- FLOOR_MATH: () => mu,
3519
- FLOOR_PRECISE: () => pu,
3520
- GCD: () => gu,
3521
- INT: () => Iu,
3522
- ISO_CEILING: () => Nu,
3523
- LCM: () => hu,
3524
- LN: () => bu,
3525
- LOG: () => Eu,
3526
- LOG10: () => Au,
3527
- MDETERM: () => Mu,
3528
- MINVERSE: () => du,
3529
- MMULT: () => Su,
3530
- MOD: () => Tu,
3531
- MROUND: () => Ru,
3532
- MULTINOMIAL: () => Cu,
3533
- MUNIT: () => vu,
3534
- ODD: () => wu,
3535
- PERCENTOF: () => Bu,
3536
- PI: () => Ou,
3537
- POWER: () => Du,
3538
- PRODUCT: () => yu,
3539
- QUOTIENT: () => xu,
3540
- RADIANS: () => Vu,
3541
- RAND: () => Lu,
3542
- RANDARRAY: () => Pu,
3543
- RANDBETWEEN: () => Uu,
3544
- ROMAN: () => _u,
3545
- ROUND: () => Fu,
3546
- ROUNDDOWN: () => Xu,
3547
- ROUNDUP: () => Gu,
3548
- SEQUENCE: () => Hu,
3549
- SERIESSUM: () => ku,
3550
- SIGN: () => Yu,
3551
- SQRT: () => Wu,
3552
- SQRTPI: () => Ku,
3553
- SUBTOTAL: () => ju,
3554
- SUM: () => qu,
3555
- SUMIF: () => Qu,
3556
- SUMIFS: () => zu,
3557
- SUMPRODUCT: () => $u,
3558
- SUMSQ: () => Zu,
3559
- SUMX2MY2: () => Ju,
3560
- SUMX2PY2: () => no,
3561
- SUMXMY2: () => to,
3562
- TRUNC: () => ro
3514
+ return null !== h ? h : o;
3515
+ }
3516
+ var Qe = c({
3517
+ ABS: () => $e,
3518
+ AGGREGATE: () => Ze,
3519
+ ARABIC: () => Je,
3520
+ BASE: () => nu,
3521
+ CEILING: () => tu,
3522
+ CEILING_MATH: () => ru,
3523
+ CEILING_PRECISE: () => eu,
3524
+ COMBIN: () => ou,
3525
+ COMBINA: () => au,
3526
+ DECIMAL: () => iu,
3527
+ DEGREES: () => su,
3528
+ ECMA_CEILING: () => uu,
3529
+ EVEN: () => lu,
3530
+ EXP: () => cu,
3531
+ FACT: () => fu,
3532
+ FACTDOUBLE: () => mu,
3533
+ FLOOR: () => pu,
3534
+ FLOOR_MATH: () => gu,
3535
+ FLOOR_PRECISE: () => Iu,
3536
+ GCD: () => hu,
3537
+ INT: () => Nu,
3538
+ ISO_CEILING: () => bu,
3539
+ LCM: () => Eu,
3540
+ LN: () => Au,
3541
+ LOG: () => Mu,
3542
+ LOG10: () => du,
3543
+ MDETERM: () => Su,
3544
+ MINVERSE: () => Tu,
3545
+ MMULT: () => Ru,
3546
+ MOD: () => Cu,
3547
+ MROUND: () => wu,
3548
+ MULTINOMIAL: () => vu,
3549
+ MUNIT: () => Bu,
3550
+ ODD: () => Ou,
3551
+ PERCENTOF: () => Du,
3552
+ PI: () => yu,
3553
+ POWER: () => xu,
3554
+ PRODUCT: () => Vu,
3555
+ QUOTIENT: () => Lu,
3556
+ RADIANS: () => Pu,
3557
+ RAND: () => Uu,
3558
+ RANDARRAY: () => _u,
3559
+ RANDBETWEEN: () => Fu,
3560
+ ROMAN: () => Xu,
3561
+ ROUND: () => Gu,
3562
+ ROUNDDOWN: () => Hu,
3563
+ ROUNDUP: () => ku,
3564
+ SEQUENCE: () => Yu,
3565
+ SERIESSUM: () => Wu,
3566
+ SIGN: () => Ku,
3567
+ SQRT: () => ju,
3568
+ SQRTPI: () => qu,
3569
+ SUBTOTAL: () => zu,
3570
+ SUM: () => Qu,
3571
+ SUMIF: () => $u,
3572
+ SUMIFS: () => Zu,
3573
+ SUMPRODUCT: () => Ju,
3574
+ SUMSQ: () => no,
3575
+ SUMX2MY2: () => to,
3576
+ SUMX2PY2: () => ro,
3577
+ SUMXMY2: () => eo,
3578
+ TRUNC: () => uo
3563
3579
  });
3564
- function Qe(n) {
3580
+ function $e(n) {
3565
3581
  return Math.abs(n);
3566
3582
  }
3567
- function ze(e, u, o, ...a) {
3583
+ function Ze(e, u, o, ...a) {
3568
3584
  const i = Math.trunc(e), s = Math.trunc(u);
3569
3585
  if (i < 1 || i > 19) return t.BuiltIn.Value;
3570
3586
  if (s < 0 || s > 7) return t.BuiltIn.Value;
@@ -3577,39 +3593,39 @@ function ze(e, u, o, ...a) {
3577
3593
  const g = 2 === s || 3 === s || 6 === s || 7 === s;
3578
3594
  let I = (1 === s || 3 === s || 5 === s || 7 === s ? m.map((t) => n.filterHidden(t)) : m).map((t) => n.filterTotals(t));
3579
3595
  g ? I = I.map((n) => n.filter((n) => !t.isError(n))) : 2 !== i && 3 !== i && I.forEach(f);
3580
- const N = I.reduce((n, t) => n.concat(t, r.Axis.Row, null)), h = N.getStats().getAggregates(), b = () => N.getStats().getSortedNumbers();
3596
+ const h = I.reduce((n, t) => n.concat(t, r.Axis.Row, null)), N = h.getStats().getAggregates(), b = () => h.getStats().getSortedNumbers();
3581
3597
  switch (i) {
3582
3598
  case 1: {
3583
- const n = h.numericalCount ?? 0;
3599
+ const n = N.numericalCount ?? 0;
3584
3600
  if (0 === n) throw t.BuiltIn.Div0;
3585
- return N.getStats().getSnappedSum() / n;
3601
+ return h.getStats().getSnappedSum() / n;
3586
3602
  }
3587
- case 2: return h.numericalCount ?? 0;
3588
- case 3: return N.getStats().getCount();
3589
- case 4: return h.max ?? 0;
3590
- case 5: return h.min ?? 0;
3603
+ case 2: return N.numericalCount ?? 0;
3604
+ case 3: return h.getStats().getCount();
3605
+ case 4: return N.max ?? 0;
3606
+ case 5: return N.min ?? 0;
3591
3607
  case 6: {
3592
3608
  let n = 1, t = !1;
3593
- return N.forEach((r) => {
3609
+ return h.forEach((r) => {
3594
3610
  "number" == typeof r && (n *= r, t = !0);
3595
3611
  }), t ? n : 0;
3596
3612
  }
3597
3613
  case 7:
3598
- if ((h.numericalCount ?? 0) < 2) throw t.BuiltIn.Div0;
3599
- return h.stdDev;
3614
+ if ((N.numericalCount ?? 0) < 2) throw t.BuiltIn.Div0;
3615
+ return N.stdDev;
3600
3616
  case 8:
3601
- if ((h.numericalCount ?? 0) < 1) throw t.BuiltIn.Div0;
3602
- return h.stdDevP;
3603
- case 9: return N.getStats().getSnappedSum();
3617
+ if ((N.numericalCount ?? 0) < 1) throw t.BuiltIn.Div0;
3618
+ return N.stdDevP;
3619
+ case 9: return h.getStats().getSnappedSum();
3604
3620
  case 10:
3605
- if ((h.numericalCount ?? 0) < 2) throw t.BuiltIn.Div0;
3606
- return h.var;
3621
+ if ((N.numericalCount ?? 0) < 2) throw t.BuiltIn.Div0;
3622
+ return N.var;
3607
3623
  case 11:
3608
- if ((h.numericalCount ?? 0) < 1) throw t.BuiltIn.Div0;
3609
- return h.varP;
3624
+ if ((N.numericalCount ?? 0) < 1) throw t.BuiltIn.Div0;
3625
+ return N.varP;
3610
3626
  case 12: return b().getPercentile(.5) ?? 0;
3611
3627
  case 13: {
3612
- const n = N.getStats().getFrequencies({ filterFn: (n) => "number" == typeof n }).getValueCounts({
3628
+ const n = h.getStats().getFrequencies({ filterFn: (n) => "number" == typeof n }).getValueCounts({
3613
3629
  sortBy: "frequency",
3614
3630
  descending: !0
3615
3631
  }).next();
@@ -3624,7 +3640,7 @@ function ze(e, u, o, ...a) {
3624
3640
  default: return t.BuiltIn.Value;
3625
3641
  }
3626
3642
  }
3627
- function $e(n) {
3643
+ function Je(n) {
3628
3644
  if (n = n.toUpperCase(), !/^M*(?:D?C{0,3}|C[MD])(?:L?X{0,3}|X[CL])(?:V?I{0,3}|I[XV])$/.test(n)) throw new t.Value("Invalid roman numeral in ARABIC evaluation.");
3629
3645
  let r = 0;
3630
3646
  return n.replace(/[MDLV]|C[MD]?|X[CL]?|I[XV]?/g, (n) => {
@@ -3645,59 +3661,59 @@ function $e(n) {
3645
3661
  }[n];
3646
3662
  }), r;
3647
3663
  }
3648
- function Ze(n, t, r = 0) {
3664
+ function nu(n, t, r = 0) {
3649
3665
  if (n = Math.trunc(n), t = Math.trunc(t), r = Math.trunc(r), n < 0 || n >= 2 ** 53) return NaN;
3650
3666
  if (t < 2 || t > 36) return NaN;
3651
3667
  if (r < 0) return NaN;
3652
3668
  const e = n.toString(t).toUpperCase();
3653
3669
  return new Array(Math.max(r + 1 - e.length, 0)).join("0") + e;
3654
3670
  }
3655
- function Je(n, t) {
3671
+ function tu(n, t) {
3656
3672
  if (0 === t) return 0;
3657
3673
  if (n > 0 && t < 0) return NaN;
3658
3674
  if (n / t % 1 == 0) return n;
3659
3675
  const r = Math.abs(t), e = Math.floor(Math.abs(n) / r);
3660
3676
  return n < 0 ? t < 0 ? -r * (e + 1) : -r * e : (e + 1) * r;
3661
3677
  }
3662
- function nu(n, t, r = 0) {
3678
+ function ru(n, t, r = 0) {
3663
3679
  if (0 === (t = Math.abs(t ?? 1))) return 0;
3664
- if (n >= 0) return Je(n, t);
3680
+ if (n >= 0) return tu(n, t);
3665
3681
  const e = r ? t : 0;
3666
- return Je(n, t) - e;
3667
- }
3668
- function tu(n, t = 1) {
3669
- return 0 === t ? 0 : Je(n, Math.abs(t));
3682
+ return tu(n, t) - e;
3670
3683
  }
3671
- function ru(n, t) {
3672
- return Je(n, t);
3673
- }
3674
- function eu(n, t) {
3675
- return n = Math.trunc(n), t = Math.trunc(t), n < 0 || t < 0 || n < t ? NaN : lu(n) / lu(t) / lu(n - t);
3684
+ function eu(n, t = 1) {
3685
+ return 0 === t ? 0 : tu(n, Math.abs(t));
3676
3686
  }
3677
3687
  function uu(n, t) {
3678
- return n = Math.trunc(n), 0 !== (t = Math.trunc(t)) || 0 !== n && 1 !== n ? n < 0 || t < 0 ? NaN : eu(n + t - 1, n - 1) : 1;
3688
+ return tu(n, t);
3679
3689
  }
3680
3690
  function ou(n, t) {
3691
+ return n = Math.trunc(n), t = Math.trunc(t), n < 0 || t < 0 || n < t ? NaN : fu(n) / fu(t) / fu(n - t);
3692
+ }
3693
+ function au(n, t) {
3694
+ return n = Math.trunc(n), 0 !== (t = Math.trunc(t)) || 0 !== n && 1 !== n ? n < 0 || t < 0 ? NaN : ou(n + t - 1, n - 1) : 1;
3695
+ }
3696
+ function iu(n, t) {
3681
3697
  if ((t = Math.trunc(t)) < 2 || t > 36) return NaN;
3682
3698
  const r = "0123456789abcdefghijklmnopqrstuvwxyz".slice(0, t);
3683
3699
  return new RegExp(`^[${r}]+$`, "i").test(n) ? parseInt(n, t) : NaN;
3684
3700
  }
3685
- function au(n) {
3701
+ function su(n) {
3686
3702
  return n * (180 / Math.PI);
3687
3703
  }
3688
- function iu(n) {
3689
- return Je(n, n < 0 ? -2 : 2);
3704
+ function lu(n) {
3705
+ return tu(n, n < 0 ? -2 : 2);
3690
3706
  }
3691
- function su(n) {
3707
+ function cu(n) {
3692
3708
  return Math.exp(n);
3693
3709
  }
3694
- function lu(n) {
3695
- return (n = Math.trunc(n)) > 170 || n < 0 ? NaN : n <= 100 ? eo[n] : ao(n);
3710
+ function fu(n) {
3711
+ return (n = Math.trunc(n)) > 170 || n < 0 ? NaN : n <= 100 ? oo[n] : so(n);
3696
3712
  }
3697
- function cu(n) {
3698
- return (n = Math.trunc(n)) < -1 ? NaN : -1 === n ? 1 : io(n);
3713
+ function mu(n) {
3714
+ return (n = Math.trunc(n)) < -1 ? NaN : -1 === n ? 1 : lo(n);
3699
3715
  }
3700
- function fu(n, r) {
3716
+ function pu(n, r) {
3701
3717
  if (0 === n) return 0;
3702
3718
  if (0 === r) throw t.BuiltIn.Div0;
3703
3719
  if (r = r ?? (n > 0 ? 1 : -1), n > 0 && r < 0) return NaN;
@@ -3705,56 +3721,60 @@ function fu(n, r) {
3705
3721
  const e = Math.abs(r), u = Math.floor(Math.abs(n) / e);
3706
3722
  return n < 0 ? r < 0 ? -e * u : -e * (u + 1) : u * e;
3707
3723
  }
3708
- function mu(n, t = n > 0 ? 1 : -1, r = 0) {
3709
- return 0 === t ? 0 : 0 === r || n >= 0 ? fu(n, Math.abs(t)) : fu(n, t) + t;
3710
- }
3711
- function pu(n, t = 1) {
3712
- return 0 === t ? 0 : fu(n, Math.abs(t));
3713
- }
3714
- function gu(t) {
3715
- let r, e = n.parseAsNumber(t[0]);
3716
- if (e < 0 || e > mo) return NaN;
3717
- e = Math.abs(Math.trunc(e));
3718
- const u = t.length;
3719
- for (let o = 1; o < u; o++) {
3720
- if (r = n.parseAsNumber(t[o]), r < 0 || r > mo) return NaN;
3721
- for (r = Math.abs(Math.trunc(r)); e && r;) e > r ? e %= r : r %= e;
3722
- e += r;
3724
+ function gu(n, t = n > 0 ? 1 : -1, r = 0) {
3725
+ return 0 === t ? 0 : 0 === r || n >= 0 ? pu(n, Math.abs(t)) : pu(n, t) + t;
3726
+ }
3727
+ function Iu(n, t = 1) {
3728
+ return 0 === t ? 0 : pu(n, Math.abs(t));
3729
+ }
3730
+ function hu(n) {
3731
+ mo(n);
3732
+ let t, r = n[0];
3733
+ if (r < 0 || r > Io) return NaN;
3734
+ r = Math.abs(Math.trunc(r));
3735
+ const e = n.length;
3736
+ for (let u = 1; u < e; u++) {
3737
+ if (t = n[u], t < 0 || t > Io) return NaN;
3738
+ for (t = Math.abs(Math.trunc(t)); r && t;) r > t ? r %= t : t %= r;
3739
+ r += t;
3723
3740
  }
3724
- return e;
3741
+ return r;
3725
3742
  }
3726
- function Iu(n) {
3743
+ function Nu(n) {
3727
3744
  return Math.floor(n);
3728
3745
  }
3729
- function Nu(n, t) {
3730
- return tu(n, t);
3746
+ function bu(n, t) {
3747
+ return eu(n, t);
3731
3748
  }
3732
- function hu(t) {
3733
- let r, e, u, o = n.parseAsNumber(t[0]);
3734
- if (o < 0 || o > mo) return NaN;
3735
- o = Math.abs(Math.trunc(o));
3736
- const a = t.length;
3737
- for (let i = 1; i < a; i++) {
3738
- const a = n.parseAsNumber(t[i]);
3739
- if (a < 0 || a > mo) return NaN;
3740
- for (r = Math.abs(Math.trunc(a)), e = o, u = r; e && u;) e > u ? e %= u : u %= e;
3741
- if (o = o / (e + u) * r, o > mo) return NaN;
3749
+ function Eu(n) {
3750
+ mo(n);
3751
+ let t, r, e, u = n[0];
3752
+ if (u < 0 || u > Io) return NaN;
3753
+ u = Math.abs(Math.trunc(u));
3754
+ const o = n.length;
3755
+ for (let a = 1; a < o; a++) {
3756
+ const o = n[a];
3757
+ if (o < 0 || o > Io) return NaN;
3758
+ if (t = Math.abs(Math.trunc(o)), 0 !== u && 0 !== t) {
3759
+ for (r = u, e = t; r && e;) r > e ? r %= e : e %= r;
3760
+ if (u = u / (r + e) * t, u > Io) return NaN;
3761
+ } else u = 0;
3742
3762
  }
3743
- return o;
3763
+ return u;
3744
3764
  }
3745
- function bu(n) {
3765
+ function Au(n) {
3746
3766
  return n <= 0 ? NaN : Math.log(n);
3747
3767
  }
3748
- function Eu(n, r) {
3768
+ function Mu(n, r) {
3749
3769
  if (n <= 0) return NaN;
3750
3770
  if (void 0 === r) return Math.log10(n);
3751
3771
  if (1 === r) throw t.BuiltIn.Div0;
3752
3772
  return Math.log(n) / Math.log(r);
3753
3773
  }
3754
- function Au(n) {
3774
+ function du(n) {
3755
3775
  return n <= 0 ? NaN : Math.log10(n);
3756
3776
  }
3757
- function Mu(n) {
3777
+ function Su(n) {
3758
3778
  const { rows: r, columns: e } = n.getShape();
3759
3779
  if (r !== e) return t.BuiltIn.Value;
3760
3780
  const u = n.getValues();
@@ -3774,7 +3794,7 @@ function Mu(n) {
3774
3794
  for (let n = 0; n < r; n++) i *= o[n][n];
3775
3795
  return i;
3776
3796
  }
3777
- function du(n) {
3797
+ function Tu(n) {
3778
3798
  const { rows: r, columns: e } = n.getShape();
3779
3799
  if (r !== e) return t.BuiltIn.Value;
3780
3800
  const u = n.getValues().map((n, e) => [...n.map((n) => "number" != typeof n ? t.BuiltIn.Value : n), ...Array.from({ length: r }, (n, t) => e === t ? 1 : 0)]);
@@ -3792,7 +3812,7 @@ function du(n) {
3792
3812
  }
3793
3813
  return u.map((n) => n.slice(r));
3794
3814
  }
3795
- function Su(n, r) {
3815
+ function Ru(n, r) {
3796
3816
  const { rows: e, columns: u } = n.getShape(), { rows: o, columns: a } = r.getShape();
3797
3817
  if (u !== o) return t.BuiltIn.Value;
3798
3818
  const i = n.getValues(), s = r.getValues(), l = new Array(e);
@@ -3809,61 +3829,62 @@ function Su(n, r) {
3809
3829
  }
3810
3830
  return l;
3811
3831
  }
3812
- function Tu(n, r) {
3832
+ function Cu(n, r) {
3813
3833
  if (0 === r) throw t.BuiltIn.Div0;
3814
- return n - r * Iu(n / r);
3834
+ return n - r * Nu(n / r);
3815
3835
  }
3816
- function Ru(n, t) {
3836
+ function wu(n, t) {
3817
3837
  return 0 === t ? 0 : n > 0 && t < 0 || n < 0 && t > 0 ? NaN : n / t % 1 == 0 ? n : Math.round(n / t) * t;
3818
3838
  }
3819
- function Cu(n) {
3839
+ function vu(n) {
3840
+ mo(n);
3820
3841
  let t = 0, r = 1;
3821
3842
  const e = n.length;
3822
3843
  for (let u = 0; u < e; u++) {
3823
3844
  const e = n[u];
3824
3845
  if (e < 0) return NaN;
3825
- t += e, r *= ao(e);
3846
+ t += e, r *= so(e);
3826
3847
  }
3827
- return ao(t) / r;
3848
+ return so(t) / r;
3828
3849
  }
3829
- function vu(r) {
3850
+ function Bu(r) {
3830
3851
  if (r <= 0) return t.BuiltIn.Value;
3831
3852
  const e = n.createRange().sparseBuilder();
3832
3853
  for (let n = 0; n < r; n++) e.pushAt(n, n, 1);
3833
3854
  return e.build();
3834
3855
  }
3835
- function wu(n) {
3856
+ function Ou(n) {
3836
3857
  if (0 === n) return 1;
3837
3858
  let t = Math.ceil(Math.abs(n));
3838
3859
  return t = 1 & t ? t : t + 1, n > 0 ? t : -t;
3839
3860
  }
3840
- function Bu(n, r) {
3861
+ function Du(n, r) {
3841
3862
  const e = n.getStats().getSnappedSum(), u = r.getStats().getSnappedSum();
3842
3863
  if (0 === u) throw t.BuiltIn.Div0;
3843
3864
  return e / u;
3844
3865
  }
3845
- function Ou() {
3866
+ function yu() {
3846
3867
  return Math.PI;
3847
3868
  }
3848
- function Du(n, t) {
3869
+ function xu(n, t) {
3849
3870
  return 0 === n && 0 === t ? NaN : n ** t;
3850
3871
  }
3851
- function yu(n) {
3872
+ function Vu(n) {
3852
3873
  let t = 1;
3853
3874
  for (const r of n) for (const n of r.values()) t *= n;
3854
3875
  return t;
3855
3876
  }
3856
- function xu(n, r) {
3877
+ function Lu(n, r) {
3857
3878
  if (0 === r) throw t.BuiltIn.Div0;
3858
3879
  return Math.trunc(n / r);
3859
3880
  }
3860
- function Vu(n) {
3881
+ function Pu(n) {
3861
3882
  return n / 180 * Math.PI;
3862
3883
  }
3863
- function Lu() {
3884
+ function Uu() {
3864
3885
  return n.markVolatile(), Math.random();
3865
3886
  }
3866
- function Pu(r = 1, e = 1, u = 0, o = 1, a = !1) {
3887
+ function _u(r = 1, e = 1, u = 0, o = 1, a = !1) {
3867
3888
  if (0 === r || 0 === e) return t.BuiltIn.Calc;
3868
3889
  if (r < 0 || e < 0) return t.BuiltIn.Value;
3869
3890
  if (u > o) return t.BuiltIn.NA;
@@ -3873,11 +3894,11 @@ function Pu(r = 1, e = 1, u = 0, o = 1, a = !1) {
3873
3894
  return a && (n = Math.floor(u + Math.random() * (o - u + 1)), n > o && (n = o)), n;
3874
3895
  }));
3875
3896
  }
3876
- function Uu(t, r) {
3897
+ function Fu(t, r) {
3877
3898
  const e = n.parseAsNumber(t), u = n.parseAsNumber(r);
3878
3899
  return e > u ? NaN : (n.markVolatile(), Math.floor(Math.random() * (u - e + 1) + e));
3879
3900
  }
3880
- function _u(n, r = 0) {
3901
+ function Xu(n, r = 0) {
3881
3902
  if ((n = Math.trunc(n)) < 0 || n > 3999) return t.BuiltIn.Value;
3882
3903
  if (0 === n) return "";
3883
3904
  if (0 !== r) return t.BuiltIn.Value;
@@ -3917,11 +3938,11 @@ function _u(n, r = 0) {
3917
3938
  for (; a--;) o = (u[Number(e.pop()) + 10 * a] || "") + o;
3918
3939
  return new Array(+e.join("") + 1).join("M") + o;
3919
3940
  }
3920
- function Fu(n, t) {
3941
+ function Gu(n, t) {
3921
3942
  const r = Math.pow(10, Math.abs(t)), e = n > 0 ? 1 : -1;
3922
3943
  return t > 0 ? e * Math.round(Math.abs(n) * r) / r : 0 === t ? e * Math.round(Math.abs(n)) : e * Math.round(Math.abs(n) / r) * r;
3923
3944
  }
3924
- function Xu(n, t) {
3945
+ function Hu(n, t) {
3925
3946
  const r = Math.pow(10, Math.abs(t)), e = n > 0 ? 1 : -1;
3926
3947
  if (t > 0) {
3927
3948
  const t = 1 / r * .5;
@@ -3933,11 +3954,11 @@ function Xu(n, t) {
3933
3954
  return e * Math.round((Math.abs(n) - t) / r) * r;
3934
3955
  }
3935
3956
  }
3936
- function Gu(n, t) {
3957
+ function ku(n, t) {
3937
3958
  const r = Math.abs(n), e = n >= 0 ? 1 : -1, u = Math.pow(10, Math.abs(t));
3938
3959
  return t > 0 ? e * Math.ceil(r * u) / u : 0 === t ? e * Math.ceil(r) : e * Math.ceil(r / u) * u;
3939
3960
  }
3940
- function Hu(r, e = 1, u = 1, o = 1) {
3961
+ function Yu(r, e = 1, u = 1, o = 1) {
3941
3962
  if (r ??= 1, 0 === r || 0 === e) return t.BuiltIn.Calc;
3942
3963
  if (r < 0 || e < 0) return t.BuiltIn.Value;
3943
3964
  const a = n.getEntireCoords();
@@ -3948,27 +3969,31 @@ function Hu(r, e = 1, u = 1, o = 1) {
3948
3969
  return i += o, n;
3949
3970
  });
3950
3971
  }
3951
- function ku(n, r, e, o) {
3952
- let a, i = 0;
3953
- for (const s of o.values({
3954
- coerce: (n, r, e) => o.isLiteral() ? r === u.Number ? e(n, r) : t.BuiltIn.Value : e(n, r),
3955
- includeEmpty: !0
3956
- })) {
3957
- if ("number" != typeof s) throw t.BuiltIn.Value;
3958
- 0 === i ? a = s * Math.pow(n, r) : a += s * Math.pow(n, r + i * e), i++;
3972
+ function Wu(r, e, u, o) {
3973
+ const a = n.getArgs().getRawAt(3), i = a, s = !0 === i?.isIRange, l = s && 1 === i.size && !0 === i.isIReferenceRange;
3974
+ if (!s || l) {
3975
+ const t = s ? i.getValueAt(0, 0) ?? null : a;
3976
+ return (null === t ? 0 : n.parseAsNumber(t)) * Math.pow(r, e);
3959
3977
  }
3960
- return a;
3978
+ if (o.getRowCount() > 1 && o.getColumnCount() > 1) throw t.BuiltIn.Value;
3979
+ let c = 0, f = 0;
3980
+ for (const n of o.values()) {
3981
+ if (t.isError(n)) throw n;
3982
+ if ("number" != typeof n) throw t.BuiltIn.Value;
3983
+ c += n * Math.pow(r, e + f * u), f++;
3984
+ }
3985
+ return c;
3961
3986
  }
3962
- function Yu(n) {
3987
+ function Ku(n) {
3963
3988
  return n > 0 ? 1 : 0 === n ? 0 : -1;
3964
3989
  }
3965
- function Wu(n) {
3990
+ function ju(n) {
3966
3991
  return Math.sqrt(n);
3967
3992
  }
3968
- function Ku(n) {
3993
+ function qu(n) {
3969
3994
  return n < 0 ? NaN : Math.sqrt(n * Math.PI);
3970
3995
  }
3971
- function ju(e, u) {
3996
+ function zu(e, u) {
3972
3997
  const o = Math.trunc(e), a = o >= 101, i = a ? o - 100 : o;
3973
3998
  let s = (a ? u.map((t) => n.filterHidden(t)) : u).map((t) => n.filterTotals(t));
3974
3999
  2 !== i && 3 !== i && s.forEach(f);
@@ -4005,7 +4030,7 @@ function ju(e, u) {
4005
4030
  default: return t.BuiltIn.Value;
4006
4031
  }
4007
4032
  }
4008
- function qu(n) {
4033
+ function Qu(n) {
4009
4034
  let t = 0, r = null;
4010
4035
  for (const e of n) {
4011
4036
  const n = e.getStats(), u = n.getAggregates();
@@ -4013,13 +4038,13 @@ function qu(n) {
4013
4038
  }
4014
4039
  return r ? r.getSnappedSum(t) : t;
4015
4040
  }
4016
- function Qu(n, t, r) {
4041
+ function $u(n, t, r) {
4017
4042
  return br(n, t, r, m((n, t) => (null === n && (n = 0), "number" != typeof t ? n : n + t)), Ar);
4018
4043
  }
4019
- function zu(t, r) {
4020
- return je(n, r, m((n, t) => "number" != typeof t ? n : null === n ? t : n + t), t, 0, Ar);
4044
+ function Zu(t, r) {
4045
+ return ze(n, r, m((n, t) => "number" != typeof t ? n : null === n ? t : n + t), t, 0, Ar);
4021
4046
  }
4022
- function $u(n) {
4047
+ function Ju(n) {
4023
4048
  const r = n[0], e = n.slice(1), u = r.getRowCount(), o = r.getColumnCount(), a = e.length;
4024
4049
  for (let n = 0; n < a; n++) if (e[n].getRowCount() !== u || e[n].getColumnCount() !== o) throw t.BuiltIn.Value;
4025
4050
  if (1 === u && 1 === o) {
@@ -4031,28 +4056,28 @@ function $u(n) {
4031
4056
  for (const t of r.values()) "number" == typeof t && (n += t);
4032
4057
  return n;
4033
4058
  }
4034
- return lo(r, e, so);
4059
+ return fo(r, e, co);
4035
4060
  }
4036
- function Zu(n) {
4061
+ function no(n) {
4037
4062
  let t = 0;
4038
4063
  for (const r of n) for (const n of r.values()) t += n ** 2;
4039
4064
  return t;
4040
4065
  }
4041
- function Ju(n, t) {
4042
- return co(n, t, (n, t) => n ** 2 - t ** 2);
4066
+ function to(n, t) {
4067
+ return po(n, t, (n, t) => n ** 2 - t ** 2);
4043
4068
  }
4044
- function no(n, t) {
4045
- return co(n, t, (n, t) => n ** 2 + t ** 2);
4069
+ function ro(n, t) {
4070
+ return po(n, t, (n, t) => n ** 2 + t ** 2);
4046
4071
  }
4047
- function to(n, t) {
4048
- return co(n, t, (n, t) => (n - t) ** 2);
4072
+ function eo(n, t) {
4073
+ return po(n, t, (n, t) => (n - t) ** 2);
4049
4074
  }
4050
- function ro(n, t = 0) {
4075
+ function uo(n, t = 0) {
4051
4076
  if (0 === t) return Math.trunc(n);
4052
4077
  const r = Math.pow(10, t);
4053
4078
  return Math.trunc(n * r) / r;
4054
4079
  }
4055
- var eo = [
4080
+ var oo = [
4056
4081
  1,
4057
4082
  1,
4058
4083
  2,
@@ -4154,221 +4179,224 @@ var eo = [
4154
4179
  9426890448883248e138,
4155
4180
  9332621544394415e140,
4156
4181
  9332621544394415e142
4157
- ], uo = [], oo = [];
4158
- function ao(n) {
4159
- return n <= 100 ? eo[n] : uo[n] > 0 ? uo[n] : uo[n] = ao(n - 1) * n;
4182
+ ], ao = [], io = [];
4183
+ function so(n) {
4184
+ return n <= 100 ? oo[n] : ao[n] > 0 ? ao[n] : ao[n] = so(n - 1) * n;
4160
4185
  }
4161
- function io(n) {
4162
- return 1 === n || 0 === n ? 1 : 2 === n ? 2 : oo[n] > 0 ? oo[n] : oo[n] = io(n - 2) * n;
4186
+ function lo(n) {
4187
+ return 1 === n || 0 === n ? 1 : 2 === n ? 2 : io[n] > 0 ? io[n] : io[n] = lo(n - 2) * n;
4163
4188
  }
4164
- var so = (n) => {
4189
+ var co = (n) => {
4165
4190
  let t = 1;
4166
4191
  const r = n.length;
4167
4192
  for (let e = 0; e < r; e++) t *= n[e];
4168
4193
  return t;
4169
- }, lo = (n, t, r) => n.alignReduce(t, (n, t) => {
4194
+ }, fo = (n, t, r) => n.alignReduce(t, (n, t) => {
4170
4195
  const e = t.length;
4171
4196
  for (let r = 0; r < e; r++) if ("number" != typeof t[r]) return n;
4172
4197
  return n + r(t);
4173
- }, 0), co = (n, r, e) => {
4198
+ }, 0), mo = (r) => {
4199
+ if (n.getArgs().getRepeatingArgsAt(0).isOmittedAt(0)) throw t.BuiltIn.NA;
4200
+ if (0 === r.length) throw t.BuiltIn.Value;
4201
+ }, po = (n, r, e) => {
4174
4202
  const u = n.getRowCount(), o = n.getColumnCount();
4175
4203
  if (u * o !== r.getRowCount() * r.getColumnCount()) throw t.BuiltIn.NA;
4176
4204
  if (u === r.getRowCount() && o === r.getColumnCount() || (r = r.reshape(u, o)), 1 === u && 1 === o && (null === n.getValueAt(0, 0) || null === r.getValueAt(0, 0))) throw t.BuiltIn.Value;
4177
- for (const r of n.values(fo)) if (t.isError(r)) throw r;
4178
- for (const n of r.values(fo)) if (t.isError(n)) throw n;
4205
+ for (const r of n.values(go)) if (t.isError(r)) throw r;
4206
+ for (const n of r.values(go)) if (t.isError(n)) throw n;
4179
4207
  let a = 0;
4180
4208
  const i = n.alignReduce([r], (n, t) => "number" != typeof t[0] || "number" != typeof t[1] ? n : (a++, n + e(t[0], t[1])), 0);
4181
4209
  if (0 === a) throw t.BuiltIn.Div0;
4182
4210
  return i;
4183
- }, fo = { axis: r.Axis.Row }, mo = 9007199254740992, po = c({
4184
- ACOS: () => go,
4185
- ACOSH: () => Io,
4186
- ACOT: () => No,
4187
- ACOTH: () => ho,
4188
- ASIN: () => bo,
4189
- ASINH: () => Eo,
4190
- ATAN: () => Ao,
4191
- ATAN2: () => Mo,
4192
- ATANH: () => So,
4193
- COS: () => To,
4194
- COSH: () => Ro,
4195
- COT: () => Co,
4196
- COTH: () => vo,
4197
- CSC: () => wo,
4198
- CSCH: () => Bo,
4199
- SEC: () => Oo,
4200
- SECH: () => Do,
4201
- SIN: () => yo,
4202
- SINH: () => xo,
4203
- TAN: () => Vo,
4204
- TANH: () => Lo
4211
+ }, go = { axis: r.Axis.Row }, Io = 9007199254740992, ho = c({
4212
+ ACOS: () => No,
4213
+ ACOSH: () => bo,
4214
+ ACOT: () => Eo,
4215
+ ACOTH: () => Ao,
4216
+ ASIN: () => Mo,
4217
+ ASINH: () => So,
4218
+ ATAN: () => To,
4219
+ ATAN2: () => Ro,
4220
+ ATANH: () => Co,
4221
+ COS: () => wo,
4222
+ COSH: () => vo,
4223
+ COT: () => Bo,
4224
+ COTH: () => Oo,
4225
+ CSC: () => Do,
4226
+ CSCH: () => yo,
4227
+ SEC: () => xo,
4228
+ SECH: () => Vo,
4229
+ SIN: () => Lo,
4230
+ SINH: () => Po,
4231
+ TAN: () => Uo,
4232
+ TANH: () => _o
4205
4233
  });
4206
- function go(n) {
4234
+ function No(n) {
4207
4235
  return n > 1 || n < -1 ? NaN : Math.acos(n);
4208
4236
  }
4209
- function Io(n) {
4237
+ function bo(n) {
4210
4238
  return n < 1 ? NaN : Math.acosh(n);
4211
4239
  }
4212
- function No(n) {
4240
+ function Eo(n) {
4213
4241
  return Math.PI / 2 - Math.atan(n);
4214
4242
  }
4215
- function ho(n) {
4243
+ function Ao(n) {
4216
4244
  return Math.abs(n) <= 1 ? NaN : Math.atanh(1 / n);
4217
4245
  }
4218
- function bo(n) {
4246
+ function Mo(n) {
4219
4247
  return n > 1 || n < -1 ? NaN : Math.asin(n);
4220
4248
  }
4221
- function Eo(n) {
4249
+ function So(n) {
4222
4250
  return Math.asinh(n);
4223
4251
  }
4224
- function Ao(n) {
4252
+ function To(n) {
4225
4253
  return Math.atan(n);
4226
4254
  }
4227
- function Mo(n, r) {
4255
+ function Ro(n, r) {
4228
4256
  if (0 === r && 0 === n) throw t.BuiltIn.Div0;
4229
4257
  return Math.atan2(r, n);
4230
4258
  }
4231
- function So(n) {
4259
+ function Co(n) {
4232
4260
  return Math.abs(n) > 1 ? NaN : Math.atanh(n);
4233
4261
  }
4234
- function To(n) {
4235
- return Math.abs(n) >= Po ? NaN : Math.cos(n);
4262
+ function wo(n) {
4263
+ return Math.abs(n) >= Fo ? NaN : Math.cos(n);
4236
4264
  }
4237
- function Ro(n) {
4265
+ function vo(n) {
4238
4266
  return Math.cosh(n);
4239
4267
  }
4240
- function Co(n) {
4241
- if (Math.abs(n) >= Po) return NaN;
4268
+ function Bo(n) {
4269
+ if (Math.abs(n) >= Fo) return NaN;
4242
4270
  if (0 === n) throw t.BuiltIn.Div0;
4243
4271
  return 1 / Math.tan(n);
4244
4272
  }
4245
- function vo(n) {
4273
+ function Oo(n) {
4246
4274
  if (0 === n) throw t.BuiltIn.Div0;
4247
4275
  return 1 / Math.tanh(n);
4248
4276
  }
4249
- function wo(n) {
4250
- if (Math.abs(n) >= Po) return NaN;
4277
+ function Do(n) {
4278
+ if (Math.abs(n) >= Fo) return NaN;
4251
4279
  if (0 === n) throw t.BuiltIn.Div0;
4252
4280
  return 1 / Math.sin(n);
4253
4281
  }
4254
- function Bo(n) {
4282
+ function yo(n) {
4255
4283
  if (0 === n) throw t.BuiltIn.Div0;
4256
4284
  return 1 / Math.sinh(n);
4257
4285
  }
4258
- function Oo(n) {
4259
- return Math.abs(n) >= Po ? NaN : 1 / Math.cos(n);
4286
+ function xo(n) {
4287
+ return Math.abs(n) >= Fo ? NaN : 1 / Math.cos(n);
4260
4288
  }
4261
- function Do(n) {
4289
+ function Vo(n) {
4262
4290
  return 1 / Math.cosh(n);
4263
4291
  }
4264
- function yo(n) {
4265
- return Math.abs(n) >= Po ? NaN : Math.sin(n);
4292
+ function Lo(n) {
4293
+ return Math.abs(n) >= Fo ? NaN : Math.sin(n);
4266
4294
  }
4267
- function xo(n) {
4295
+ function Po(n) {
4268
4296
  return Math.sinh(n);
4269
4297
  }
4270
- function Vo(n) {
4271
- return Math.abs(n) >= Po ? NaN : Math.tan(n);
4298
+ function Uo(n) {
4299
+ return Math.abs(n) >= Fo ? NaN : Math.tan(n);
4272
4300
  }
4273
- function Lo(n) {
4301
+ function _o(n) {
4274
4302
  return Math.tanh(n);
4275
4303
  }
4276
- var Po = 2 ** 27, Uo = c({
4277
- ADD: () => _o,
4278
- DIVIDE: () => Fo,
4279
- EQ: () => Xo,
4280
- GT: () => Go,
4281
- GTE: () => Ho,
4282
- ISBETWEEN: () => Zo,
4283
- LT: () => ko,
4284
- LTE: () => Yo,
4285
- MINUS: () => Wo,
4286
- MULTIPLY: () => Ko,
4287
- NE: () => jo,
4288
- POW: () => qo,
4289
- UMINUS: () => Qo,
4290
- UNARY_PERCENT: () => zo,
4291
- UPLUS: () => $o
4304
+ var Fo = 2 ** 27, Xo = c({
4305
+ ADD: () => Go,
4306
+ DIVIDE: () => Ho,
4307
+ EQ: () => ko,
4308
+ GT: () => Yo,
4309
+ GTE: () => Wo,
4310
+ ISBETWEEN: () => ta,
4311
+ LT: () => Ko,
4312
+ LTE: () => jo,
4313
+ MINUS: () => qo,
4314
+ MULTIPLY: () => zo,
4315
+ NE: () => Qo,
4316
+ POW: () => $o,
4317
+ UMINUS: () => Zo,
4318
+ UNARY_PERCENT: () => Jo,
4319
+ UPLUS: () => na
4292
4320
  });
4293
- function _o(n, t) {
4321
+ function Go(n, t) {
4294
4322
  return n + t;
4295
4323
  }
4296
- function Fo(n, r) {
4324
+ function Ho(n, r) {
4297
4325
  if (0 === r) throw t.BuiltIn.Div0;
4298
4326
  return n / r;
4299
4327
  }
4300
- function Xo(t, r) {
4328
+ function ko(t, r) {
4301
4329
  return 0 === n.compare(t, r);
4302
4330
  }
4303
- function Go(t, r) {
4331
+ function Yo(t, r) {
4304
4332
  return n.compare(t, r) > 0;
4305
4333
  }
4306
- function Ho(t, r) {
4334
+ function Wo(t, r) {
4307
4335
  return n.compare(t, r) >= 0;
4308
4336
  }
4309
- function ko(t, r) {
4337
+ function Ko(t, r) {
4310
4338
  return n.compare(t, r) < 0;
4311
4339
  }
4312
- function Yo(t, r) {
4340
+ function jo(t, r) {
4313
4341
  return n.compare(t, r) <= 0;
4314
4342
  }
4315
- function Wo(n, t) {
4343
+ function qo(n, t) {
4316
4344
  return n - t;
4317
4345
  }
4318
- function Ko(n, t) {
4346
+ function zo(n, t) {
4319
4347
  return n * t;
4320
4348
  }
4321
- function jo(t, r) {
4349
+ function Qo(t, r) {
4322
4350
  return 0 !== n.compare(t, r);
4323
4351
  }
4324
- function qo(n, r) {
4352
+ function $o(n, r) {
4325
4353
  if (0 === n) {
4326
4354
  if (r < 0) throw t.BuiltIn.Div0;
4327
4355
  if (0 === r) return NaN;
4328
4356
  }
4329
4357
  return n ** r;
4330
4358
  }
4331
- function Qo(n) {
4359
+ function Zo(n) {
4332
4360
  return -1 * n;
4333
4361
  }
4334
- function zo(n) {
4335
- return Fo(n, 100);
4362
+ function Jo(n) {
4363
+ return Ho(n, 100);
4336
4364
  }
4337
- function $o(n) {
4365
+ function na(n) {
4338
4366
  return n;
4339
4367
  }
4340
- function Zo(n, t, r, e = !0, u = !0) {
4368
+ function ta(n, t, r, e = !0, u = !0) {
4341
4369
  return (e ? n >= t : n > t) && (u ? n <= r : n < r);
4342
4370
  }
4343
- var Jo = c({
4344
- AVEDEV: () => na,
4345
- AVERAGE: () => ta,
4346
- AVERAGEA: () => ra,
4347
- AVERAGEIF: () => ea,
4348
- AVERAGEIFS: () => ua,
4349
- AVERAGE_WEIGHTED: () => oa,
4350
- COUNT: () => aa,
4351
- COUNTA: () => ia,
4352
- COUNTBLANK: () => sa,
4353
- COUNTIF: () => la,
4354
- COUNTIFS: () => ca,
4355
- COUNTUNIQUE: () => fa,
4356
- COUNTUNIQUEIFS: () => ma,
4357
- LARGE: () => pa,
4358
- MAX: () => ga,
4359
- MAXA: () => Ia,
4360
- MAXIF: () => Na,
4361
- MAXIFS: () => ha,
4362
- MEDIAN: () => ba,
4363
- MIN: () => Ea,
4364
- MINA: () => Aa,
4365
- MINIF: () => Ma,
4366
- MINIFS: () => da,
4367
- PERMUT: () => Sa,
4368
- PERMUTATIONA: () => Ta,
4369
- SMALL: () => Ra
4371
+ var ra = c({
4372
+ AVEDEV: () => ea,
4373
+ AVERAGE: () => ua,
4374
+ AVERAGEA: () => oa,
4375
+ AVERAGEIF: () => aa,
4376
+ AVERAGEIFS: () => ia,
4377
+ AVERAGE_WEIGHTED: () => sa,
4378
+ COUNT: () => la,
4379
+ COUNTA: () => ca,
4380
+ COUNTBLANK: () => fa,
4381
+ COUNTIF: () => ma,
4382
+ COUNTIFS: () => pa,
4383
+ COUNTUNIQUE: () => ga,
4384
+ COUNTUNIQUEIFS: () => Ia,
4385
+ LARGE: () => ha,
4386
+ MAX: () => Na,
4387
+ MAXA: () => ba,
4388
+ MAXIF: () => Ea,
4389
+ MAXIFS: () => Aa,
4390
+ MEDIAN: () => Ma,
4391
+ MIN: () => da,
4392
+ MINA: () => Sa,
4393
+ MINIF: () => Ta,
4394
+ MINIFS: () => Ra,
4395
+ PERMUT: () => Ca,
4396
+ PERMUTATIONA: () => wa,
4397
+ SMALL: () => va
4370
4398
  });
4371
- function na(n) {
4399
+ function ea(n) {
4372
4400
  let r = 0;
4373
4401
  const e = [];
4374
4402
  for (const t of n) for (const n of t.values()) r += n, e.push(n);
@@ -4379,21 +4407,21 @@ function na(n) {
4379
4407
  for (let n = 0; n < u; n++) r += Math.abs(e[n] - o);
4380
4408
  return r / u;
4381
4409
  }
4382
- function ta(n) {
4383
- return wa(n);
4410
+ function ua(n) {
4411
+ return Da(n);
4384
4412
  }
4385
- function ra(n) {
4386
- return wa(n, va);
4413
+ function oa(n) {
4414
+ return Da(n, Oa);
4387
4415
  }
4388
- function ea(n, r, e) {
4416
+ function aa(n, r, e) {
4389
4417
  const u = br(n, r, e, (n, t) => "number" != typeof t ? n : n + 1, Ar), o = br(n, r, e, m((n, t) => (null === n && (n = 0), "number" != typeof t ? n : n + t)), Ar);
4390
4418
  return t.isError(o) ? o : u ? o / u : t.BuiltIn.Div0;
4391
4419
  }
4392
- function ua(r, e) {
4393
- const u = je(n, e, m((n, t) => "number" != typeof t ? n : null === n ? t : n + t), r, null, Ar), o = je(n, e, (n, t) => "number" != typeof t ? n : null === n ? 1 : n + 1, r, 0, Ar);
4420
+ function ia(r, e) {
4421
+ const u = ze(n, e, m((n, t) => "number" != typeof t ? n : null === n ? t : n + t), r, null, Ar), o = ze(n, e, (n, t) => "number" != typeof t ? n : null === n ? 1 : n + 1, r, 0, Ar);
4394
4422
  return t.isError(u) ? u : 0 === o || null === o ? t.BuiltIn.Div0 : u / o;
4395
4423
  }
4396
- function oa(n) {
4424
+ function sa(n) {
4397
4425
  let r = 0, e = 0;
4398
4426
  const u = n.length;
4399
4427
  for (let o = 0; o < u; o++) {
@@ -4409,31 +4437,31 @@ function oa(n) {
4409
4437
  if (0 === e) throw t.BuiltIn.Div0;
4410
4438
  return r / e;
4411
4439
  }
4412
- function aa(n) {
4440
+ function la(n) {
4413
4441
  let t = 0;
4414
4442
  for (const r of n) t += r.getStats().getAggregates().numericalCount ?? 0;
4415
4443
  return t;
4416
4444
  }
4417
- function ia(n) {
4445
+ function ca(n) {
4418
4446
  let t = 0;
4419
4447
  for (const r of n) t += r.getStats().getAggregates().count ?? 0;
4420
4448
  return t;
4421
4449
  }
4422
- function sa(n) {
4450
+ function fa(n) {
4423
4451
  return n.getColumnCount() * n.getRowCount() - (n.getStats().getAggregates().count ?? 0);
4424
4452
  }
4425
- function la(n, t) {
4453
+ function ma(n, t) {
4426
4454
  return br(n, t, void 0, (n) => null === n ? 1 : n + 1, Er);
4427
4455
  }
4428
- function ca(t) {
4429
- return je(n, t, (n) => null === n ? 1 : n + 1, void 0, 0, Er);
4456
+ function pa(t) {
4457
+ return ze(n, t, (n) => null === n ? 1 : n + 1, void 0, 0, Er);
4430
4458
  }
4431
- function fa(n) {
4459
+ function ga(n) {
4432
4460
  const t = /* @__PURE__ */ new Set(), r = n.length;
4433
- for (let e = 0; e < r; e++) for (const r of n[e].values()) t.add(Ca(r));
4461
+ for (let e = 0; e < r; e++) for (const r of n[e].values()) t.add(Ba(r));
4434
4462
  return t.size;
4435
4463
  }
4436
- function ma(r, e) {
4464
+ function Ia(r, e) {
4437
4465
  const u = r.getRowCount(), o = r.getColumnCount(), a = e.length, i = new Array(a), s = new Array(a);
4438
4466
  for (let r = 0; r < a; r++) {
4439
4467
  const a = e[r][0];
@@ -4445,30 +4473,30 @@ function ma(r, e) {
4445
4473
  const r = t[0];
4446
4474
  if (null === r) return n;
4447
4475
  for (let r = 0; r < a; r++) if (!s[r](t[r + 1])) return n;
4448
- return l.add(Ca(r)), n;
4476
+ return l.add(Ba(r)), n;
4449
4477
  }, null), l.size;
4450
4478
  }
4451
- function pa(n, t) {
4479
+ function ha(n, t) {
4452
4480
  const r = n.getStats().getSortedNumbers().getLarge(t);
4453
4481
  return null === r ? NaN : r;
4454
4482
  }
4455
- function ga(n) {
4483
+ function Na(n) {
4456
4484
  let t = Number.MIN_SAFE_INTEGER;
4457
4485
  for (const r of n) t = Math.max(r.getStats().getAggregates().max ?? 0, t);
4458
4486
  return t === Number.MIN_SAFE_INTEGER ? 0 : t;
4459
4487
  }
4460
- function Ia(n) {
4488
+ function ba(n) {
4461
4489
  let t = 0;
4462
- for (const r of n) t = Math.max(r.getStats(va).getAggregates().max ?? 0, t);
4490
+ for (const r of n) t = Math.max(r.getStats(Oa).getAggregates().max ?? 0, t);
4463
4491
  return t;
4464
4492
  }
4465
- function Na(n, t, r) {
4493
+ function Ea(n, t, r) {
4466
4494
  return br(n, t, r, m((n, t) => "number" != typeof t ? n ?? 0 : null === n ? t : Math.max(n, t)), Ar);
4467
4495
  }
4468
- function ha(t, r) {
4469
- return je(n, r, m((n, t) => "number" != typeof t ? n : null === n ? t : Math.max(n, t)), t, 0, Ar);
4496
+ function Aa(t, r) {
4497
+ return ze(n, r, m((n, t) => "number" != typeof t ? n : null === n ? t : Math.max(n, t)), t, 0, Ar);
4470
4498
  }
4471
- function ba(n) {
4499
+ function Ma(n) {
4472
4500
  const t = [];
4473
4501
  for (const r of n) for (const n of r.values()) t.push(n);
4474
4502
  if (0 === t.length) return NaN;
@@ -4480,45 +4508,45 @@ function ba(n) {
4480
4508
  }
4481
4509
  return t[Math.floor(r / 2)];
4482
4510
  }
4483
- function Ea(n) {
4511
+ function da(n) {
4484
4512
  let t = Number.MAX_SAFE_INTEGER;
4485
4513
  for (const r of n) t = Math.min(r.getStats().getAggregates().min ?? 0, t);
4486
4514
  return t === Number.MAX_SAFE_INTEGER ? 0 : t;
4487
4515
  }
4488
- function Aa(n) {
4516
+ function Sa(n) {
4489
4517
  let t = Number.MAX_SAFE_INTEGER;
4490
- for (const r of n) t = Math.min(r.getStats(va).getAggregates().min ?? t, t);
4518
+ for (const r of n) t = Math.min(r.getStats(Oa).getAggregates().min ?? t, t);
4491
4519
  return t === Number.MAX_SAFE_INTEGER ? 0 : t;
4492
4520
  }
4493
- function Ma(n, t, r) {
4521
+ function Ta(n, t, r) {
4494
4522
  return br(n, t, r, m((n, t) => "number" != typeof t ? n ?? 0 : null === n ? t : Math.min(n, t)), Ar);
4495
4523
  }
4496
- function da(t, r) {
4497
- return je(n, r, m((n, t) => "number" != typeof t ? n : null === n ? t : Math.min(n, t)), t, 0, Ar);
4524
+ function Ra(t, r) {
4525
+ return ze(n, r, m((n, t) => "number" != typeof t ? n : null === n ? t : Math.min(n, t)), t, 0, Ar);
4498
4526
  }
4499
- function Sa(n, t) {
4527
+ function Ca(n, t) {
4500
4528
  if (n = Math.trunc(n), t = Math.trunc(t), n < 0 || t < 0 || t > n) return NaN;
4501
4529
  let r = 1;
4502
4530
  for (let e = n; e > n - t; e--) r *= e;
4503
4531
  return r;
4504
4532
  }
4505
- function Ta(n, t) {
4533
+ function wa(n, t) {
4506
4534
  return n = Math.trunc(n), t = Math.trunc(t), n < 0 || t < 0 ? NaN : Math.pow(n, t);
4507
4535
  }
4508
- function Ra(n, t) {
4536
+ function va(n, t) {
4509
4537
  const r = n.getStats().getSortedNumbers().getSmall(t);
4510
4538
  return null === r ? NaN : r;
4511
4539
  }
4512
- var Ca = (n) => {
4540
+ var Ba = (n) => {
4513
4541
  if (null === n) return "\0";
4514
4542
  const r = typeof n;
4515
4543
  return "number" === r ? "" + n.toString() : "string" === r ? "" + n : "boolean" === r ? "" + (n ? "1" : "0") : t.isError(n) ? "" + n.getCode() : "" + String(n);
4516
- }, va = Object.freeze({ coerce: (n, r, e, o) => {
4544
+ }, Oa = Object.freeze({ coerce: (n, r, e, o) => {
4517
4545
  if (r === u.String) return 0;
4518
4546
  if (r === u.Boolean) return o.isLiteral() ? null : n ? 1 : 0;
4519
4547
  if (t.isError(n)) throw n;
4520
4548
  return null;
4521
- } }), wa = (n, r) => {
4549
+ } }), Da = (n, r) => {
4522
4550
  let e = 0, u = 0, o = null;
4523
4551
  for (const t of n) {
4524
4552
  const n = t.getStats(r), a = n.getAggregates();
@@ -4526,151 +4554,151 @@ var Ca = (n) => {
4526
4554
  }
4527
4555
  if (0 === u) throw t.BuiltIn.Div0;
4528
4556
  return (o ? o.getSnappedSum(e) : e) / u;
4529
- }, Ba = c({
4530
- BETADIST: () => Da,
4531
- BETAINV: () => xa,
4532
- BETA_DIST: () => Oa,
4533
- BETA_INV: () => ya,
4534
- BINOMDIST: () => La,
4535
- BINOM_DIST: () => Va,
4536
- BINOM_DIST_RANGE: () => Pa,
4537
- BINOM_INV: () => Ua,
4538
- CHIDIST: () => Fa,
4539
- CHIINV: () => Ha,
4540
- CHISQ_DIST: () => _a,
4541
- CHISQ_DIST_RT: () => Xa,
4542
- CHISQ_INV: () => Ga,
4543
- CHISQ_INV_RT: () => ka,
4544
- CHISQ_TEST: () => Ya,
4545
- CHITEST: () => Wa,
4546
- CONFIDENCE: () => ja,
4547
- CONFIDENCE_NORM: () => Ka,
4548
- CONFIDENCE_T: () => qa,
4549
- CORREL: () => Qa,
4550
- COVAR: () => za,
4551
- COVARIANCE_P: () => $a,
4552
- COVARIANCE_S: () => Za,
4553
- CRITBINOM: () => Ja,
4554
- DEVSQ: () => ni,
4555
- EXPONDIST: () => ri,
4556
- EXPON_DIST: () => ti,
4557
- FDIST: () => ui,
4558
- FINV: () => ii,
4559
- FISHER: () => fi,
4560
- FISHERINV: () => mi,
4561
- FORECAST: () => pi,
4562
- FORECAST_LINEAR: () => gi,
4563
- FREQUENCY: () => Ii,
4564
- FTEST: () => ci,
4565
- F_DIST: () => ei,
4566
- F_DIST_RT: () => oi,
4567
- F_INV: () => ai,
4568
- F_INV_RT: () => si,
4569
- F_TEST: () => li,
4570
- GAMMA: () => Ni,
4571
- GAMMADIST: () => bi,
4572
- GAMMAINV: () => Ai,
4573
- GAMMALN: () => Mi,
4574
- GAMMALN_PRECISE: () => di,
4575
- GAMMA_DIST: () => hi,
4576
- GAMMA_INV: () => Ei,
4577
- GAUSS: () => Si,
4578
- GEOMEAN: () => Ti,
4579
- HARMEAN: () => Ri,
4580
- HYPGEOMDIST: () => vi,
4581
- HYPGEOM_DIST: () => Ci,
4582
- INTERCEPT: () => wi,
4583
- KURT: () => Bi,
4584
- LOGINV: () => xi,
4585
- LOGNORMDIST: () => Di,
4586
- LOGNORM_DIST: () => Oi,
4587
- LOGNORM_INV: () => yi,
4588
- MODE: () => Vi,
4589
- MODE_MULT: () => Li,
4590
- MODE_SNGL: () => Pi,
4591
- NEGBINOMDIST: () => _i,
4592
- NEGBINOM_DIST: () => Ui,
4593
- NORMDIST: () => Xi,
4594
- NORMINV: () => Hi,
4595
- NORMSDIST: () => Yi,
4596
- NORMSINV: () => Ki,
4597
- NORM_DIST: () => Fi,
4598
- NORM_INV: () => Gi,
4599
- NORM_S_DIST: () => ki,
4600
- NORM_S_INV: () => Wi,
4601
- PEARSON: () => ji,
4602
- PERCENTILE: () => qi,
4603
- PERCENTILE_EXC: () => Qi,
4604
- PERCENTILE_INC: () => zi,
4605
- PERCENTRANK: () => $i,
4606
- PERCENTRANK_EXC: () => Zi,
4607
- PERCENTRANK_INC: () => Ji,
4608
- PHI: () => ns,
4609
- POISSON: () => rs,
4610
- POISSON_DIST: () => ts,
4611
- PROB: () => es,
4612
- QUARTILE: () => us,
4613
- QUARTILE_EXC: () => os,
4614
- QUARTILE_INC: () => as,
4615
- RANK: () => is,
4616
- RANK_AVG: () => ss,
4617
- RANK_EQ: () => ls,
4618
- RSQ: () => cs,
4619
- SKEW: () => fs,
4620
- SKEW_P: () => ms,
4621
- SLOPE: () => ps,
4622
- STANDARDIZE: () => gs,
4623
- STDEV: () => Ns,
4624
- STDEVA: () => Es,
4625
- STDEVP: () => bs,
4626
- STDEVPA: () => As,
4627
- STDEV_P: () => hs,
4628
- STDEV_S: () => Is,
4629
- STEYX: () => Ms,
4630
- TDIST: () => Ss,
4631
- TINV: () => vs,
4632
- TRIMMEAN: () => Bs,
4633
- T_DIST: () => ds,
4634
- T_DIST_2T: () => Ts,
4635
- T_DIST_RT: () => Rs,
4636
- T_INV: () => Cs,
4637
- T_INV_2T: () => ws,
4638
- VAR: () => Vs,
4639
- VARA: () => Ls,
4640
- VARP: () => ys,
4641
- VARPA: () => Ps,
4642
- VAR_P: () => Ds,
4643
- VAR_S: () => xs,
4644
- WEIBULL: () => _s,
4645
- WEIBULL_DIST: () => Us,
4646
- ZTEST: () => Xs,
4647
- Z_TEST: () => Fs
4557
+ }, ya = c({
4558
+ BETADIST: () => Va,
4559
+ BETAINV: () => Pa,
4560
+ BETA_DIST: () => xa,
4561
+ BETA_INV: () => La,
4562
+ BINOMDIST: () => _a,
4563
+ BINOM_DIST: () => Ua,
4564
+ BINOM_DIST_RANGE: () => Fa,
4565
+ BINOM_INV: () => Xa,
4566
+ CHIDIST: () => Ha,
4567
+ CHIINV: () => Wa,
4568
+ CHISQ_DIST: () => Ga,
4569
+ CHISQ_DIST_RT: () => ka,
4570
+ CHISQ_INV: () => Ya,
4571
+ CHISQ_INV_RT: () => Ka,
4572
+ CHISQ_TEST: () => ja,
4573
+ CHITEST: () => qa,
4574
+ CONFIDENCE: () => Qa,
4575
+ CONFIDENCE_NORM: () => za,
4576
+ CONFIDENCE_T: () => $a,
4577
+ CORREL: () => Za,
4578
+ COVAR: () => Ja,
4579
+ COVARIANCE_P: () => ni,
4580
+ COVARIANCE_S: () => ti,
4581
+ CRITBINOM: () => ri,
4582
+ DEVSQ: () => ei,
4583
+ EXPONDIST: () => oi,
4584
+ EXPON_DIST: () => ui,
4585
+ FDIST: () => ii,
4586
+ FINV: () => ci,
4587
+ FISHER: () => gi,
4588
+ FISHERINV: () => Ii,
4589
+ FORECAST: () => hi,
4590
+ FORECAST_LINEAR: () => Ni,
4591
+ FREQUENCY: () => bi,
4592
+ FTEST: () => pi,
4593
+ F_DIST: () => ai,
4594
+ F_DIST_RT: () => si,
4595
+ F_INV: () => li,
4596
+ F_INV_RT: () => fi,
4597
+ F_TEST: () => mi,
4598
+ GAMMA: () => Ei,
4599
+ GAMMADIST: () => Mi,
4600
+ GAMMAINV: () => Si,
4601
+ GAMMALN: () => Ti,
4602
+ GAMMALN_PRECISE: () => Ri,
4603
+ GAMMA_DIST: () => Ai,
4604
+ GAMMA_INV: () => di,
4605
+ GAUSS: () => Ci,
4606
+ GEOMEAN: () => wi,
4607
+ HARMEAN: () => vi,
4608
+ HYPGEOMDIST: () => Oi,
4609
+ HYPGEOM_DIST: () => Bi,
4610
+ INTERCEPT: () => Di,
4611
+ KURT: () => yi,
4612
+ LOGINV: () => Pi,
4613
+ LOGNORMDIST: () => Vi,
4614
+ LOGNORM_DIST: () => xi,
4615
+ LOGNORM_INV: () => Li,
4616
+ MODE: () => Ui,
4617
+ MODE_MULT: () => _i,
4618
+ MODE_SNGL: () => Fi,
4619
+ NEGBINOMDIST: () => Gi,
4620
+ NEGBINOM_DIST: () => Xi,
4621
+ NORMDIST: () => ki,
4622
+ NORMINV: () => Wi,
4623
+ NORMSDIST: () => ji,
4624
+ NORMSINV: () => zi,
4625
+ NORM_DIST: () => Hi,
4626
+ NORM_INV: () => Yi,
4627
+ NORM_S_DIST: () => Ki,
4628
+ NORM_S_INV: () => qi,
4629
+ PEARSON: () => Qi,
4630
+ PERCENTILE: () => $i,
4631
+ PERCENTILE_EXC: () => Zi,
4632
+ PERCENTILE_INC: () => Ji,
4633
+ PERCENTRANK: () => ns,
4634
+ PERCENTRANK_EXC: () => ts,
4635
+ PERCENTRANK_INC: () => rs,
4636
+ PHI: () => es,
4637
+ POISSON: () => os,
4638
+ POISSON_DIST: () => us,
4639
+ PROB: () => as,
4640
+ QUARTILE: () => is,
4641
+ QUARTILE_EXC: () => ss,
4642
+ QUARTILE_INC: () => ls,
4643
+ RANK: () => cs,
4644
+ RANK_AVG: () => fs,
4645
+ RANK_EQ: () => ms,
4646
+ RSQ: () => ps,
4647
+ SKEW: () => gs,
4648
+ SKEW_P: () => Is,
4649
+ SLOPE: () => hs,
4650
+ STANDARDIZE: () => Ns,
4651
+ STDEV: () => Es,
4652
+ STDEVA: () => ds,
4653
+ STDEVP: () => Ms,
4654
+ STDEVPA: () => Ss,
4655
+ STDEV_P: () => As,
4656
+ STDEV_S: () => bs,
4657
+ STEYX: () => Ts,
4658
+ TDIST: () => Cs,
4659
+ TINV: () => Os,
4660
+ TRIMMEAN: () => ys,
4661
+ T_DIST: () => Rs,
4662
+ T_DIST_2T: () => ws,
4663
+ T_DIST_RT: () => vs,
4664
+ T_INV: () => Bs,
4665
+ T_INV_2T: () => Ds,
4666
+ VAR: () => Us,
4667
+ VARA: () => _s,
4668
+ VARP: () => Ls,
4669
+ VARPA: () => Fs,
4670
+ VAR_P: () => Vs,
4671
+ VAR_S: () => Ps,
4672
+ WEIBULL: () => Gs,
4673
+ WEIBULL_DIST: () => Xs,
4674
+ ZTEST: () => ks,
4675
+ Z_TEST: () => Hs
4648
4676
  });
4649
- function Oa(n, t, r, e, u = 0, o = 1) {
4677
+ function xa(n, t, r, e, u = 0, o = 1) {
4650
4678
  return t <= 0 || r <= 0 || n < u || n > o || u === o ? NaN : (n = (n - u) / (o - u), e ? i.beta.cdf(n, t, r) : i.beta.pdf(n, t, r) / (o - u));
4651
4679
  }
4652
- function Da(n, t, r, e = 0, u = 1) {
4653
- return Oa(n, t, r, !0, e, u);
4680
+ function Va(n, t, r, e = 0, u = 1) {
4681
+ return xa(n, t, r, !0, e, u);
4654
4682
  }
4655
- function ya(n, t, r, e = 0, u = 1) {
4683
+ function La(n, t, r, e = 0, u = 1) {
4656
4684
  return t <= 0 || r <= 0 || n < 0 || n > 1 ? NaN : i.beta.inv(n, t, r) * (u - e) + e;
4657
4685
  }
4658
- function xa(n, t, r, e = 0, u = 1) {
4659
- return ya(n, t, r, e, u);
4686
+ function Pa(n, t, r, e = 0, u = 1) {
4687
+ return La(n, t, r, e, u);
4660
4688
  }
4661
- function Va(n, t, r, e) {
4689
+ function Ua(n, t, r, e) {
4662
4690
  return t < 0 || r < 0 || r > 1 || n < 0 || n > t ? NaN : e ? i.binomial.cdf(n, t, r) : i.binomial.pdf(n, t, r);
4663
4691
  }
4664
- function La(n, t, r, e) {
4665
- return Va(n, t, r, e);
4692
+ function _a(n, t, r, e) {
4693
+ return Ua(n, t, r, e);
4666
4694
  }
4667
- function Pa(n, t, r, e = r) {
4695
+ function Fa(n, t, r, e = r) {
4668
4696
  if (n < 0 || t < 0 || t > 1 || r < 0 || r > n || e < r || e > n) return NaN;
4669
4697
  let u = 0;
4670
- for (let o = r; o <= e; o++) u += eu(n, o) * Math.pow(t, o) * Math.pow(1 - t, n - o);
4698
+ for (let o = r; o <= e; o++) u += ou(n, o) * Math.pow(t, o) * Math.pow(1 - t, n - o);
4671
4699
  return u;
4672
4700
  }
4673
- function Ua(n, t, r) {
4701
+ function Xa(n, t, r) {
4674
4702
  if (n < 0 || t < 0 || t > 1 || r <= 0 || r >= 1) return NaN;
4675
4703
  let e = 0;
4676
4704
  for (; e <= n;) {
@@ -4679,25 +4707,25 @@ function Ua(n, t, r) {
4679
4707
  }
4680
4708
  return NaN;
4681
4709
  }
4682
- function _a(n, t, r) {
4710
+ function Ga(n, t, r) {
4683
4711
  return n < 0 || t < 1 || t > 10 ** 10 ? NaN : r ? i.chisquare.cdf(n, t) : i.chisquare.pdf(n, t);
4684
4712
  }
4685
- function Fa(n, t) {
4686
- return Xa(n, t);
4713
+ function Ha(n, t) {
4714
+ return ka(n, t);
4687
4715
  }
4688
- function Xa(n, t) {
4716
+ function ka(n, t) {
4689
4717
  return t = Math.trunc(t), n < 0 || t < 1 || t > 10 ** 10 ? NaN : 1 - i.chisquare.cdf(n, t);
4690
4718
  }
4691
- function Ga(n, t) {
4719
+ function Ya(n, t) {
4692
4720
  return t = Math.trunc(t), n < 0 || n > 1 || t < 1 || t > 10 ** 10 ? NaN : i.chisquare.inv(n, t);
4693
4721
  }
4694
- function Ha(n, t) {
4695
- return ka(n, t);
4722
+ function Wa(n, t) {
4723
+ return Ka(n, t);
4696
4724
  }
4697
- function ka(n, t) {
4725
+ function Ka(n, t) {
4698
4726
  return t = Math.trunc(t), n < 0 || n > 1 || t < 1 || t > 10 ** 10 ? NaN : i.chisquare.inv(1 - n, t);
4699
4727
  }
4700
- function Ya(n, r) {
4728
+ function ja(n, r) {
4701
4729
  const e = n.getRowCount(), u = n.getColumnCount();
4702
4730
  if (e * u !== r.getRowCount() * r.getColumnCount()) throw t.BuiltIn.NA;
4703
4731
  if (f(n), f(r), 1 === e && 1 === u) throw t.BuiltIn.NA;
@@ -4711,38 +4739,38 @@ function Ya(n, r) {
4711
4739
  a += (n - r) ** 2 / r;
4712
4740
  }
4713
4741
  }
4714
- return Xa(a, o);
4742
+ return ka(a, o);
4715
4743
  }
4716
- function Wa(n, t) {
4717
- return Ya(n, t);
4744
+ function qa(n, t) {
4745
+ return ja(n, t);
4718
4746
  }
4719
- function Ka(n, t, r) {
4747
+ function za(n, t, r) {
4720
4748
  return r = Math.trunc(r), n <= 0 || n >= 1 || t <= 0 || r < 1 ? NaN : i.normalci(1, n, t, r)[1] - 1;
4721
4749
  }
4722
- function ja(n, t, r) {
4723
- return Ka(n, t, r);
4750
+ function Qa(n, t, r) {
4751
+ return za(n, t, r);
4724
4752
  }
4725
- function qa(n, r, e) {
4753
+ function $a(n, r, e) {
4726
4754
  if (e = Math.trunc(e), n <= 0 || n >= 1 || r <= 0 || e < 1) return NaN;
4727
4755
  if (1 === e) throw t.BuiltIn.Div0;
4728
4756
  return i.tci(1, n, r, e)[1] - 1;
4729
4757
  }
4730
- function Qa(n, r) {
4731
- const e = Hs(n, r);
4758
+ function Za(n, r) {
4759
+ const e = Ws(n, r);
4732
4760
  return t.isError(e) ? e : null === e ? t.BuiltIn.NA : 0 === e.ssX || 0 === e.ssY ? t.BuiltIn.Div0 : e.ssXY / Math.sqrt(e.ssX * e.ssY);
4733
4761
  }
4734
- function za(n, t) {
4735
- return $a(n, t);
4762
+ function Ja(n, t) {
4763
+ return ni(n, t);
4736
4764
  }
4737
- function $a(n, r) {
4738
- const e = Hs(n, r);
4765
+ function ni(n, r) {
4766
+ const e = Ws(n, r);
4739
4767
  return t.isError(e) ? e : null === e ? t.BuiltIn.NA : 0 === e.n ? t.BuiltIn.Div0 : e.ssXY / e.n;
4740
4768
  }
4741
- function Za(n, r) {
4742
- const e = Hs(n, r);
4769
+ function ti(n, r) {
4770
+ const e = Ws(n, r);
4743
4771
  return t.isError(e) ? e : null === e ? t.BuiltIn.NA : e.n <= 1 ? t.BuiltIn.Div0 : e.ssXY / (e.n - 1);
4744
4772
  }
4745
- function Ja(n, t, r) {
4773
+ function ri(n, t, r) {
4746
4774
  if ((n = Math.floor(n)) < 0) return NaN;
4747
4775
  if (t < 0 || t > 1) return NaN;
4748
4776
  if (r <= 0 || r >= 1) return NaN;
@@ -4753,7 +4781,7 @@ function Ja(n, t, r) {
4753
4781
  }
4754
4782
  return e;
4755
4783
  }
4756
- function ni(n) {
4784
+ function ei(n) {
4757
4785
  let t = 0, r = [];
4758
4786
  for (const e of n) for (const n of e.values()) t += n, r.push(n);
4759
4787
  const e = r.length, u = t / e;
@@ -4761,31 +4789,31 @@ function ni(n) {
4761
4789
  for (let n = 0; n < e; n++) t += (r[n] - u) ** 2;
4762
4790
  return t;
4763
4791
  }
4764
- function ti(n, t, r) {
4792
+ function ui(n, t, r) {
4765
4793
  return n < 0 || t <= 0 ? NaN : r ? i.exponential.cdf(n, t) : i.exponential.pdf(n, t);
4766
4794
  }
4767
- function ri(n, t, r) {
4768
- return ti(n, t, r);
4795
+ function oi(n, t, r) {
4796
+ return ui(n, t, r);
4769
4797
  }
4770
- function ei(n, t, r, e) {
4798
+ function ai(n, t, r, e) {
4771
4799
  return n < 0 || t < 1 || r < 1 ? NaN : (t = Math.trunc(t), r = Math.trunc(r), e ? i.centralF.cdf(n, t, r) : i.centralF.pdf(n, t, r));
4772
4800
  }
4773
- function ui(n, t, r) {
4774
- return oi(n, t, r);
4801
+ function ii(n, t, r) {
4802
+ return si(n, t, r);
4775
4803
  }
4776
- function oi(n, t, r) {
4804
+ function si(n, t, r) {
4777
4805
  return n < 0 || t < 1 || r < 1 ? NaN : (t = Math.trunc(t), r = Math.trunc(r), 1 - i.centralF.cdf(n, t, r));
4778
4806
  }
4779
- function ai(n, t, r) {
4807
+ function li(n, t, r) {
4780
4808
  return n < 0 || n > 1 || t < 1 || r < 1 ? NaN : (t = Math.trunc(t), r = Math.trunc(r), i.centralF.inv(n, t, r));
4781
4809
  }
4782
- function ii(n, t, r) {
4783
- return si(n, t, r);
4810
+ function ci(n, t, r) {
4811
+ return fi(n, t, r);
4784
4812
  }
4785
- function si(n, t, r) {
4813
+ function fi(n, t, r) {
4786
4814
  return n < 0 || n > 1 || t < 1 || t >= Math.pow(10, 10) || r < 1 || r >= Math.pow(10, 10) ? NaN : (t = Math.trunc(t), r = Math.trunc(r), i.centralF.inv(1 - n, t, r));
4787
4815
  }
4788
- function li(n, r) {
4816
+ function mi(n, r) {
4789
4817
  const e = [], u = [];
4790
4818
  for (const [t, o] of [[n, e], [r, u]]) t.forEach((n) => {
4791
4819
  "number" == typeof n && o.push(n);
@@ -4803,29 +4831,29 @@ function li(n, r) {
4803
4831
  const c = i.centralF.cdf(s / l, e.length - 1, u.length - 1);
4804
4832
  return 2 * Math.min(c, 1 - c);
4805
4833
  }
4806
- function ci(n, t) {
4807
- return li(n, t);
4834
+ function pi(n, t) {
4835
+ return mi(n, t);
4808
4836
  }
4809
- function fi(n) {
4837
+ function gi(n) {
4810
4838
  if (1 === n || -1 === n) throw t.BuiltIn.Div0;
4811
4839
  return Math.log((1 + n) / (1 - n)) / 2;
4812
4840
  }
4813
- function mi(n) {
4841
+ function Ii(n) {
4814
4842
  const t = Math.exp(2 * n);
4815
4843
  return (t - 1) / (t + 1);
4816
4844
  }
4817
- function pi(n, t, r) {
4818
- return gi(n, t, r);
4845
+ function hi(n, t, r) {
4846
+ return Ni(n, t, r);
4819
4847
  }
4820
- function gi(n, r, e) {
4821
- const u = Hs(r, e);
4848
+ function Ni(n, r, e) {
4849
+ const u = Ws(r, e);
4822
4850
  if (t.isError(u)) return u;
4823
4851
  if (null === u || 0 === u.n) return t.BuiltIn.NA;
4824
4852
  if (0 === u.ssX) return t.BuiltIn.Div0;
4825
4853
  const o = u.ssXY / u.ssX;
4826
4854
  return u.yMean - o * u.xMean + o * n;
4827
4855
  }
4828
- function Ii(n, t) {
4856
+ function bi(n, t) {
4829
4857
  const r = [];
4830
4858
  for (const n of t.values()) "number" == typeof n && r.push(n);
4831
4859
  const e = [];
@@ -4846,31 +4874,31 @@ function Ii(n, t) {
4846
4874
  for (let n = 0; n < e.length; n++) e[n] > a && i++;
4847
4875
  return o[r.length][0] = i, o;
4848
4876
  }
4849
- function Ni(n) {
4877
+ function Ei(n) {
4850
4878
  return 0 === n || n < 0 && n === Math.trunc(n) ? NaN : i.gammafn(n);
4851
4879
  }
4852
- function hi(n, t, r, e) {
4880
+ function Ai(n, t, r, e) {
4853
4881
  return n < 0 || t <= 0 || r <= 0 ? NaN : e ? i.gamma.cdf(n, t, r, !0) : i.gamma.pdf(n, t, r, !1);
4854
4882
  }
4855
- function bi(n, t, r, e) {
4856
- return hi(n, t, r, e);
4883
+ function Mi(n, t, r, e) {
4884
+ return Ai(n, t, r, e);
4857
4885
  }
4858
- function Ei(n, t, r) {
4886
+ function di(n, t, r) {
4859
4887
  return n < 0 || n > 1 || t <= 0 || r <= 0 ? NaN : i.gamma.inv(n, t, r);
4860
4888
  }
4861
- function Ai(n, t, r) {
4862
- return Ei(n, t, r);
4889
+ function Si(n, t, r) {
4890
+ return di(n, t, r);
4863
4891
  }
4864
- function Mi(n) {
4892
+ function Ti(n) {
4865
4893
  return n <= 0 ? NaN : i.gammaln(n);
4866
4894
  }
4867
- function di(n) {
4895
+ function Ri(n) {
4868
4896
  return n <= 0 ? NaN : i.gammaln(n);
4869
4897
  }
4870
- function Si(n) {
4898
+ function Ci(n) {
4871
4899
  return i.normal.cdf(n, 0, 1) - .5;
4872
4900
  }
4873
- function Ti(n) {
4901
+ function wi(n) {
4874
4902
  const t = [];
4875
4903
  for (const r of n) for (const n of r.values()) {
4876
4904
  if (n <= 0) return NaN;
@@ -4878,7 +4906,7 @@ function Ti(n) {
4878
4906
  }
4879
4907
  return i.geomean(t);
4880
4908
  }
4881
- function Ri(n) {
4909
+ function vi(n) {
4882
4910
  let t = 0, r = 0;
4883
4911
  for (const e of n) for (const n of e.values()) {
4884
4912
  if (n <= 0) return NaN;
@@ -4886,14 +4914,14 @@ function Ri(n) {
4886
4914
  }
4887
4915
  return t / r;
4888
4916
  }
4889
- function Ci(n, t, r, e, u) {
4917
+ function Bi(n, t, r, e, u) {
4890
4918
  if (n = Math.trunc(n), t = Math.trunc(t), r = Math.trunc(r), (e = Math.trunc(e)) <= 0 || n < 0 || t <= 0 || r <= 0) return NaN;
4891
4919
  if (t > e) return NaN;
4892
4920
  if (r > e) return NaN;
4893
4921
  if (t < n || r < n) return NaN;
4894
4922
  if (n < t - e + r) return NaN;
4895
4923
  function o(n, t, r, e) {
4896
- return eu(r, n) * eu(e - r, t - n) / eu(e, t);
4924
+ return ou(r, n) * ou(e - r, t - n) / ou(e, t);
4897
4925
  }
4898
4926
  return u ? function(n, t, r, e) {
4899
4927
  let u = 0;
@@ -4901,18 +4929,18 @@ function Ci(n, t, r, e, u) {
4901
4929
  return u;
4902
4930
  }(n, t, r, e) : o(n, t, r, e);
4903
4931
  }
4904
- function vi(n, t, r, e) {
4905
- return Ci(n, t, r, e, !1);
4932
+ function Oi(n, t, r, e) {
4933
+ return Bi(n, t, r, e, !1);
4906
4934
  }
4907
- function wi(n, r) {
4908
- const e = Hs(n, r);
4935
+ function Di(n, r) {
4936
+ const e = Ws(n, r);
4909
4937
  if (t.isError(e)) return e;
4910
4938
  if (null === e) return t.BuiltIn.NA;
4911
4939
  if (0 === e.ssX) return t.BuiltIn.Div0;
4912
4940
  const u = e.ssXY / e.ssX;
4913
4941
  return e.yMean - u * e.xMean;
4914
4942
  }
4915
- function Bi(n) {
4943
+ function yi(n) {
4916
4944
  let r = 0;
4917
4945
  const e = [];
4918
4946
  for (const t of n) for (const n of t.values()) r += n, e.push(n);
@@ -4925,22 +4953,22 @@ function Bi(n) {
4925
4953
  if (0 === a) throw t.BuiltIn.Div0;
4926
4954
  return o /= Math.pow(a, 4), u * (u + 1) / ((u - 1) * (u - 2) * (u - 3)) * o - 3 * (u - 1) * (u - 1) / ((u - 2) * (u - 3));
4927
4955
  }
4928
- function Oi(n, t, r, e) {
4956
+ function xi(n, t, r, e) {
4929
4957
  return n <= 0 || r <= 0 ? NaN : e ? i.lognormal.cdf(n, t, r) : i.lognormal.pdf(n, t, r);
4930
4958
  }
4931
- function Di(n, t, r) {
4932
- return Oi(n, t, r, !0);
4959
+ function Vi(n, t, r) {
4960
+ return xi(n, t, r, !0);
4933
4961
  }
4934
- function yi(n, t, r) {
4962
+ function Li(n, t, r) {
4935
4963
  return n <= 0 || n >= 1 || r <= 0 ? NaN : i.lognormal.inv(n, t, r);
4936
4964
  }
4937
- function xi(n, t, r) {
4938
- return yi(n, t, r);
4965
+ function Pi(n, t, r) {
4966
+ return Li(n, t, r);
4939
4967
  }
4940
- function Vi(n) {
4941
- return Pi(n);
4968
+ function Ui(n) {
4969
+ return Fi(n);
4942
4970
  }
4943
- function Li(n) {
4971
+ function _i(n) {
4944
4972
  const r = /* @__PURE__ */ new Map();
4945
4973
  let e = 0;
4946
4974
  for (const t of n) {
@@ -4963,7 +4991,7 @@ function Li(n) {
4963
4991
  const o = [...r.entries()].filter(([, { count: n }]) => n === u).sort((n, t) => n[1].firstSeen - t[1].firstSeen).map(([n]) => [n]);
4964
4992
  return 0 === o.length ? t.BuiltIn.NA : o;
4965
4993
  }
4966
- function Pi(n) {
4994
+ function Fi(n) {
4967
4995
  const r = /* @__PURE__ */ new Map();
4968
4996
  let e = 0;
4969
4997
  for (const t of n) {
@@ -4985,122 +5013,112 @@ function Pi(n) {
4985
5013
  for (const [n, { count: t, firstSeen: e }] of r) t < 2 || (t > o || t === o && e < a) && (u = n, o = t, a = e);
4986
5014
  return null === u ? t.BuiltIn.NA : u;
4987
5015
  }
4988
- function Ui(n, t, r, e) {
5016
+ function Xi(n, t, r, e) {
4989
5017
  return n = Math.trunc(n), t = Math.trunc(t), r <= 0 || r >= 1 || n < 0 || t < 1 ? NaN : e ? i.negbin.cdf(n, t, r) : i.negbin.pdf(n, t, r);
4990
5018
  }
4991
- function _i(n, t, r) {
4992
- return Ui(n, t, r, !1);
5019
+ function Gi(n, t, r) {
5020
+ return Xi(n, t, r, !1);
4993
5021
  }
4994
- function Fi(n, t, r, e) {
5022
+ function Hi(n, t, r, e) {
4995
5023
  return r <= 0 ? NaN : e ? i.normal.cdf(n, t, r) : i.normal.pdf(n, t, r);
4996
5024
  }
4997
- function Xi(n, t, r, e) {
4998
- return Fi(n, t, r, e);
5025
+ function ki(n, t, r, e) {
5026
+ return Hi(n, t, r, e);
4999
5027
  }
5000
- function Gi(n, t, r) {
5028
+ function Yi(n, t, r) {
5001
5029
  return n <= 0 || n >= 1 || r <= 0 ? NaN : i.normal.inv(n, t, r);
5002
5030
  }
5003
- function Hi(n, t, r) {
5004
- return Gi(n, t, r);
5031
+ function Wi(n, t, r) {
5032
+ return Yi(n, t, r);
5005
5033
  }
5006
- function ki(n, t) {
5034
+ function Ki(n, t) {
5007
5035
  return t ? i.normal.cdf(n, 0, 1) : i.normal.pdf(n, 0, 1);
5008
5036
  }
5009
- function Yi(n) {
5010
- return ki(n, !0);
5037
+ function ji(n) {
5038
+ return Ki(n, !0);
5011
5039
  }
5012
- function Wi(n) {
5040
+ function qi(n) {
5013
5041
  return n <= 0 || n >= 1 ? NaN : i.normal.inv(n, 0, 1);
5014
5042
  }
5015
- function Ki(n) {
5016
- return Wi(n);
5043
+ function zi(n) {
5044
+ return qi(n);
5017
5045
  }
5018
- function ji(n, t) {
5019
- return Qa(n, t);
5046
+ function Qi(n, t) {
5047
+ return Za(n, t);
5020
5048
  }
5021
- function qi(n, t) {
5022
- return zi(n, t);
5049
+ function $i(n, t) {
5050
+ return Ji(n, t);
5023
5051
  }
5024
- function Qi(n, t) {
5052
+ function Zi(n, t) {
5025
5053
  if (t <= 0 || t >= 1) return NaN;
5026
5054
  const r = n.getStats().getSortedNumbers().getPercentile(t, !0);
5027
5055
  return null === r ? NaN : r;
5028
5056
  }
5029
- function zi(n, t) {
5057
+ function Ji(n, t) {
5030
5058
  if (t < 0 || t > 1) return NaN;
5031
5059
  const r = n.getStats().getSortedNumbers().getPercentile(t, !1);
5032
5060
  return null === r ? NaN : r;
5033
5061
  }
5034
- function $i(n, t, r = 3) {
5035
- return Ji(n, t, r);
5062
+ function ns(n, t, r = 3) {
5063
+ return rs(n, t, r);
5036
5064
  }
5037
- function Zi(n, r, e = 3) {
5065
+ function ts(n, r, e = 3) {
5038
5066
  return n.getStats().getSortedNumbers().getPercentRankOf(r, !0, e) ?? t.BuiltIn.NA;
5039
5067
  }
5040
- function Ji(n, r, e = 3) {
5068
+ function rs(n, r, e = 3) {
5041
5069
  return n.getStats().getSortedNumbers().getPercentRankOf(r, !1, e) ?? t.BuiltIn.NA;
5042
5070
  }
5043
- function ns(n) {
5044
- return Math.exp(-.5 * n * n) / Gs;
5071
+ function es(n) {
5072
+ return Math.exp(-.5 * n * n) / Ys;
5045
5073
  }
5046
- function ts(n, t, r) {
5074
+ function us(n, t, r) {
5047
5075
  return n < 0 || t <= 0 ? NaN : (n = Math.trunc(n), r ? i.poisson.cdf(n, t) : i.poisson.pdf(n, t));
5048
5076
  }
5049
- function rs(n, t, r) {
5050
- return ts(n, t, r);
5077
+ function os(n, t, r) {
5078
+ return us(n, t, r);
5051
5079
  }
5052
- function es(n, r, e, u) {
5053
- const o = n.flatten({ includeEmpty: !0 }), a = r.flatten({ includeEmpty: !0 });
5054
- if (o.length !== a.length) return t.BuiltIn.NA;
5080
+ function as(n, r, e, u) {
5081
+ const o = n.flatten(), a = r.flatten();
5082
+ if (o.getRowCount() !== a.getRowCount()) return t.BuiltIn.NA;
5055
5083
  f(n), f(r);
5056
- let i = 0;
5057
- for (const n of a) if (null !== n) {
5058
- if ("number" != typeof n) return t.BuiltIn.Num;
5059
- i += n;
5060
- }
5061
- if (1e10 !== Math.round(1e10 * i)) return t.BuiltIn.Num;
5062
- const s = u ?? e;
5063
- let l = 0;
5064
- for (let n = 0; n < o.length; n++) {
5065
- const r = o[n];
5066
- if ("number" != typeof r) return t.BuiltIn.Num;
5067
- r >= e && r <= s && (l += a[n] ?? 0);
5068
- }
5069
- return l;
5084
+ const i = u ?? e;
5085
+ let s = 0, l = 0;
5086
+ for (const [[n, t]] of o.alignValues([a])) "number" == typeof n && "number" == typeof t && (s += t, n >= e && n <= i && (l += t));
5087
+ return 1e10 !== Math.round(1e10 * s) ? t.BuiltIn.Num : l;
5070
5088
  }
5071
- function us(n, t) {
5072
- return as(n, t);
5089
+ function is(n, t) {
5090
+ return ls(n, t);
5073
5091
  }
5074
- function os(n, t) {
5092
+ function ss(n, t) {
5075
5093
  if ((t = Math.trunc(t)) < 1 || t > 3) return NaN;
5076
5094
  const r = t / 4, e = n.getStats().getSortedNumbers().getPercentile(r, !0);
5077
5095
  return null === e ? NaN : e;
5078
5096
  }
5079
- function as(n, t) {
5097
+ function ls(n, t) {
5080
5098
  if ((t = Math.trunc(t)) < 0 || t > 4) return NaN;
5081
5099
  const r = t / 4, e = n.getStats().getSortedNumbers().getPercentile(r, !1);
5082
5100
  return null === e ? NaN : e;
5083
5101
  }
5084
- function is(n, t, r = 0) {
5085
- return ls(n, t, r);
5102
+ function cs(n, t, r = 0) {
5103
+ return ms(n, t, r);
5086
5104
  }
5087
- function ss(n, r, e = 0) {
5105
+ function fs(n, r, e = 0) {
5088
5106
  const u = r.getStats().getSortedNumbers().getRankOf(n, 0 === e, !0);
5089
5107
  return null === u ? t.BuiltIn.NA : u;
5090
5108
  }
5091
- function ls(n, r, e = 0) {
5109
+ function ms(n, r, e = 0) {
5092
5110
  const u = r.getStats().getSortedNumbers().getRankOf(n, 0 === e, !1);
5093
5111
  return null === u ? t.BuiltIn.NA : u;
5094
5112
  }
5095
- function cs(n, r) {
5096
- const e = Hs(n, r);
5113
+ function ps(n, r) {
5114
+ const e = Ws(n, r);
5097
5115
  if (t.isError(e)) return e;
5098
5116
  if (null === e) return t.BuiltIn.NA;
5099
5117
  if (0 === e.ssX || 0 === e.ssY) return t.BuiltIn.Div0;
5100
5118
  const u = e.ssXY / Math.sqrt(e.ssX * e.ssY);
5101
5119
  return u * u;
5102
5120
  }
5103
- function fs(n) {
5121
+ function gs(n) {
5104
5122
  let r = 0, e = 0;
5105
5123
  for (const t of n) t.forEach((n) => {
5106
5124
  "number" == typeof n && (e += n, r++);
@@ -5119,7 +5137,7 @@ function fs(n) {
5119
5137
  });
5120
5138
  return r / ((r - 1) * (r - 2)) * i;
5121
5139
  }
5122
- function ms(n) {
5140
+ function Is(n) {
5123
5141
  let r = 0, e = 0;
5124
5142
  for (const t of n) t.forEach((n) => {
5125
5143
  "number" == typeof n && (e += n, r++);
@@ -5138,66 +5156,66 @@ function ms(n) {
5138
5156
  });
5139
5157
  return i / r;
5140
5158
  }
5141
- function ps(n, r) {
5142
- const e = Hs(n, r);
5159
+ function hs(n, r) {
5160
+ const e = Ws(n, r);
5143
5161
  return t.isError(e) ? e : null === e ? t.BuiltIn.NA : 0 === e.ssX ? t.BuiltIn.Div0 : e.ssXY / e.ssX;
5144
5162
  }
5145
- function gs(n, t, r) {
5163
+ function Ns(n, t, r) {
5146
5164
  return r <= 0 ? NaN : (n - t) / r;
5147
5165
  }
5148
- function Is(n) {
5149
- const t = xs(n);
5166
+ function bs(n) {
5167
+ const t = Ps(n);
5150
5168
  return Math.sqrt(t);
5151
5169
  }
5152
- function Ns(n) {
5153
- return Is(n);
5170
+ function Es(n) {
5171
+ return bs(n);
5154
5172
  }
5155
- function hs(n) {
5156
- const t = Ds(n);
5173
+ function As(n) {
5174
+ const t = Vs(n);
5157
5175
  return Math.sqrt(t);
5158
5176
  }
5159
- function bs(n) {
5160
- return hs(n);
5177
+ function Ms(n) {
5178
+ return As(n);
5161
5179
  }
5162
- function Es(n) {
5163
- const t = Ls(n);
5180
+ function ds(n) {
5181
+ const t = _s(n);
5164
5182
  return Math.sqrt(t);
5165
5183
  }
5166
- function As(n) {
5167
- const t = Ps(n);
5184
+ function Ss(n) {
5185
+ const t = Fs(n);
5168
5186
  return Math.sqrt(t);
5169
5187
  }
5170
- function Ms(n, r) {
5171
- const e = Hs(n, r);
5188
+ function Ts(n, r) {
5189
+ const e = Ws(n, r);
5172
5190
  return t.isError(e) ? e : null === e || 0 === e.n ? t.BuiltIn.NA : e.n < 3 || 0 === e.ssX ? t.BuiltIn.Div0 : Math.sqrt((e.ssY - e.ssXY * e.ssXY / e.ssX) / (e.n - 2));
5173
5191
  }
5174
- function ds(n, t, r) {
5192
+ function Rs(n, t, r) {
5175
5193
  return t < 1 ? NaN : r ? 0 === n ? .5 : i.studentt.cdf(n, t) : i.studentt.pdf(n, t);
5176
5194
  }
5177
- function Ss(n, t, r) {
5178
- return n < 0 || 1 !== (r = Math.trunc(r)) && 2 !== r ? NaN : 1 === r ? Rs(n, t) : Ts(n, t);
5195
+ function Cs(n, t, r) {
5196
+ return n < 0 || 1 !== (r = Math.trunc(r)) && 2 !== r ? NaN : 1 === r ? vs(n, t) : ws(n, t);
5179
5197
  }
5180
- function Ts(n, t) {
5198
+ function ws(n, t) {
5181
5199
  return t < 1 || n < 0 ? NaN : 2 * (1 - i.studentt.cdf(n, t));
5182
5200
  }
5183
- function Rs(n, t) {
5201
+ function vs(n, t) {
5184
5202
  return t < 1 ? NaN : 0 === n ? .5 : 1 - i.studentt.cdf(n, t);
5185
5203
  }
5186
- function Cs(n, t) {
5204
+ function Bs(n, t) {
5187
5205
  return n <= 0 || n >= 1 || t < 1 ? NaN : 1 === (t = Math.trunc(t)) ? Math.tan(Math.PI * (n - .5)) : i.studentt.inv(n, t);
5188
5206
  }
5189
- function vs(n, t) {
5190
- return ws(n, t);
5207
+ function Os(n, t) {
5208
+ return Ds(n, t);
5191
5209
  }
5192
- function ws(n, t) {
5210
+ function Ds(n, t) {
5193
5211
  if (n <= 0 || t < 1) return NaN;
5194
5212
  const r = 1 - n / 2;
5195
5213
  return 1 === (t = Math.trunc(t)) ? Math.tan(Math.PI * (r - .5)) : i.studentt.inv(r, t);
5196
5214
  }
5197
- function Bs(n, r) {
5215
+ function ys(n, r) {
5198
5216
  if (r < 0 || r >= 1) return NaN;
5199
5217
  const e = [];
5200
- for (const { value: t } of n.entries(Os)) "number" == typeof t && e.push(t);
5218
+ for (const { value: t } of n.entries(xs)) "number" == typeof t && e.push(t);
5201
5219
  const u = e.length, o = Math.floor(u * r / 2);
5202
5220
  let a = 0, i = 0;
5203
5221
  if (0 === o) {
@@ -5214,20 +5232,20 @@ function Bs(n, r) {
5214
5232
  if (0 === i) throw t.BuiltIn.Div0;
5215
5233
  return a / i;
5216
5234
  }
5217
- var Os = { axis: r.Axis.Row };
5218
- function Ds(n) {
5235
+ var xs = { axis: r.Axis.Row };
5236
+ function Vs(n) {
5219
5237
  let t = 0, r = 0;
5220
- const e = ta(n);
5238
+ const e = ua(n);
5221
5239
  for (const u of n) for (const n of u.values()) t += Math.pow(n - e, 2), r++;
5222
5240
  const u = t / r;
5223
5241
  return isNaN(u) ? NaN : u;
5224
5242
  }
5225
- function ys(n) {
5226
- return Ds(n);
5243
+ function Ls(n) {
5244
+ return Vs(n);
5227
5245
  }
5228
- function xs(n) {
5246
+ function Ps(n) {
5229
5247
  let r = 0, e = 0;
5230
- const o = ta(n);
5248
+ const o = ua(n);
5231
5249
  for (const t of n) for (const n of t.values({
5232
5250
  type: u.Number,
5233
5251
  onError: "value"
@@ -5235,47 +5253,47 @@ function xs(n) {
5235
5253
  if (e < 2) throw t.BuiltIn.Div0;
5236
5254
  return r / (e - 1);
5237
5255
  }
5238
- function Vs(n) {
5239
- return xs(n);
5256
+ function Us(n) {
5257
+ return Ps(n);
5240
5258
  }
5241
- function Ls(n) {
5259
+ function _s(n) {
5242
5260
  let r = 0, e = 0;
5243
- const u = ra(n);
5261
+ const u = oa(n);
5244
5262
  for (const t of n) for (const n of t.values({ type: null })) {
5245
- const t = ks(n);
5263
+ const t = Ks(n);
5246
5264
  null !== t && (r += Math.pow(t - u, 2), e++);
5247
5265
  }
5248
5266
  if (e < 2) throw t.BuiltIn.Div0;
5249
5267
  return r / (e - 1);
5250
5268
  }
5251
- function Ps(n) {
5252
- const t = ra(n);
5269
+ function Fs(n) {
5270
+ const t = oa(n);
5253
5271
  let r = 0, e = 0;
5254
5272
  for (const u of n) for (const n of u.values({ type: null })) {
5255
- const u = ks(n);
5273
+ const u = Ks(n);
5256
5274
  null !== u && (r += Math.pow(u - t, 2), e++);
5257
5275
  }
5258
5276
  return r / e;
5259
5277
  }
5260
- function Us(n, t, r, e) {
5278
+ function Xs(n, t, r, e) {
5261
5279
  return n < 0 || t <= 0 || r <= 0 ? NaN : e || 0 !== n ? e ? 1 - Math.exp(-Math.pow(n / r, t)) : Math.pow(n, t - 1) * Math.exp(-Math.pow(n / r, t)) * t / Math.pow(r, t) : 0;
5262
5280
  }
5263
- function _s(n, t, r, e) {
5264
- return Us(n, t, r, e);
5281
+ function Gs(n, t, r, e) {
5282
+ return Xs(n, t, r, e);
5265
5283
  }
5266
- function Fs(n, r, e = 0) {
5284
+ function Hs(n, r, e = 0) {
5267
5285
  const u = n.size;
5268
5286
  if (!e) {
5269
5287
  if (u < 2) throw t.BuiltIn.Div0;
5270
- e = Is([n]);
5288
+ e = bs([n]);
5271
5289
  }
5272
- return 1 - ki((ta([n]) - r) / (e / Math.sqrt(u)), !0);
5290
+ return 1 - Ki((ua([n]) - r) / (e / Math.sqrt(u)), !0);
5273
5291
  }
5274
- function Xs(n, t, r = 0) {
5275
- return Fs(n, t, r);
5292
+ function ks(n, t, r = 0) {
5293
+ return Hs(n, t, r);
5276
5294
  }
5277
- var Gs = 2.5066282746310002;
5278
- function Hs(n, r) {
5295
+ var Ys = 2.5066282746310002;
5296
+ function Ws(n, r) {
5279
5297
  const e = n.getRowCount(), u = n.getColumnCount();
5280
5298
  if (e * u !== r.getRowCount() * r.getColumnCount()) return null;
5281
5299
  r.getRowCount() === e && r.getColumnCount() === u || (r = r.reshape(e, u));
@@ -5304,14 +5322,14 @@ function Hs(n, r) {
5304
5322
  ssXY: g
5305
5323
  };
5306
5324
  }
5307
- function ks(n) {
5325
+ function Ks(n) {
5308
5326
  return "number" == typeof n ? n : !0 === n ? 1 : !1 === n || "string" == typeof n ? 0 : null;
5309
5327
  }
5310
- var Ys = c({
5311
- DELAY: () => Ws,
5312
- WAIT: () => Qs
5328
+ var js = c({
5329
+ DELAY: () => qs,
5330
+ WAIT: () => Zs
5313
5331
  });
5314
- async function Ws(n, t, r = "No label") {
5332
+ async function qs(n, t, r = "No label") {
5315
5333
  return new Promise((r) => {
5316
5334
  setTimeout(() => {
5317
5335
  r(t);
@@ -5319,87 +5337,87 @@ async function Ws(n, t, r = "No label") {
5319
5337
  });
5320
5338
  }
5321
5339
  globalThis.debugEventTarget ??= new EventTarget();
5322
- var Ks = globalThis.debugEventTarget, js = /* @__PURE__ */ new Map();
5323
- function qs(n) {
5340
+ var zs = globalThis.debugEventTarget, Qs = /* @__PURE__ */ new Map();
5341
+ function $s(n) {
5324
5342
  const { inbox: t, waiters: r } = function(n) {
5325
- if (js.has(n)) return js.get(n);
5343
+ if (Qs.has(n)) return Qs.get(n);
5326
5344
  const t = {
5327
5345
  inbox: [],
5328
5346
  waiters: []
5329
5347
  };
5330
- return Ks.addEventListener(n, (n) => {
5348
+ return zs.addEventListener(n, (n) => {
5331
5349
  t.waiters.length ? t.waiters.shift()(n.detail) : t.inbox.push(n.detail);
5332
- }), js.set(n, t), t;
5350
+ }), Qs.set(n, t), t;
5333
5351
  }(n);
5334
5352
  return t.length ? Promise.resolve(t.shift()) : new Promise((n) => r.push(n));
5335
5353
  }
5336
- async function Qs(n, t) {
5337
- const r = await qs(n);
5354
+ async function Zs(n, t) {
5355
+ const r = await $s(n);
5338
5356
  let e = t?.getValueAt(0, 0) ?? "", u = `event["${n}"`;
5339
5357
  return void 0 !== r && (u += `, payload: ${r}`), "" !== e && (u += `, input: ${e}`), u += "]", console.log(u), "" + r + e;
5340
5358
  }
5341
- var zs = c({
5342
- ARRAYTOTEXT: () => Zs,
5343
- ASC: () => $s,
5344
- CHAR: () => Js,
5345
- CLEAN: () => nl,
5346
- CODE: () => tl,
5347
- CONCAT: () => rl,
5348
- CONCATENATE: () => ul,
5349
- DBCS: () => al,
5350
- DETECTLANGUAGE: () => ol,
5351
- DOLLAR: () => il,
5352
- EXACT: () => sl,
5353
- FIND: () => ll,
5354
- FINDB: () => cl,
5355
- FIXED: () => fl,
5356
- JOIN: () => ml,
5357
- LEFT: () => pl,
5358
- LEFTB: () => gl,
5359
- LEN: () => Il,
5360
- LENB: () => Nl,
5361
- LOWER: () => hl,
5362
- MID: () => bl,
5363
- MIDB: () => El,
5364
- NUMBERVALUE: () => Al,
5365
- PROPER: () => Ml,
5366
- REPLACE: () => dl,
5367
- REPLACEB: () => Sl,
5368
- REPT: () => Tl,
5369
- RIGHT: () => Rl,
5370
- RIGHTB: () => Cl,
5371
- SEARCH: () => vl,
5372
- SEARCHB: () => wl,
5373
- SPLIT: () => Bl,
5374
- SUBSTITUTE: () => Ol,
5375
- T: () => Dl,
5376
- TEXT: () => yl,
5377
- TEXTAFTER: () => xl,
5378
- TEXTBEFORE: () => Vl,
5379
- TEXTJOIN: () => Ll,
5380
- TEXTSPLIT: () => Pl,
5381
- TRANSLATE: () => Ul,
5382
- TRIM: () => _l,
5383
- UNICHAR: () => Fl,
5384
- UNICODE: () => Xl,
5385
- UPPER: () => Gl,
5386
- VALUE: () => Hl,
5387
- VALUETOTEXT: () => kl
5359
+ var Js = c({
5360
+ ARRAYTOTEXT: () => tl,
5361
+ ASC: () => nl,
5362
+ CHAR: () => rl,
5363
+ CLEAN: () => el,
5364
+ CODE: () => ul,
5365
+ CONCAT: () => ol,
5366
+ CONCATENATE: () => il,
5367
+ DBCS: () => ll,
5368
+ DETECTLANGUAGE: () => sl,
5369
+ DOLLAR: () => cl,
5370
+ EXACT: () => fl,
5371
+ FIND: () => ml,
5372
+ FINDB: () => pl,
5373
+ FIXED: () => gl,
5374
+ JOIN: () => Il,
5375
+ LEFT: () => hl,
5376
+ LEFTB: () => Nl,
5377
+ LEN: () => bl,
5378
+ LENB: () => El,
5379
+ LOWER: () => Al,
5380
+ MID: () => Ml,
5381
+ MIDB: () => dl,
5382
+ NUMBERVALUE: () => Sl,
5383
+ PROPER: () => Tl,
5384
+ REPLACE: () => Rl,
5385
+ REPLACEB: () => Cl,
5386
+ REPT: () => wl,
5387
+ RIGHT: () => vl,
5388
+ RIGHTB: () => Bl,
5389
+ SEARCH: () => Ol,
5390
+ SEARCHB: () => Dl,
5391
+ SPLIT: () => yl,
5392
+ SUBSTITUTE: () => xl,
5393
+ T: () => Vl,
5394
+ TEXT: () => Ll,
5395
+ TEXTAFTER: () => Pl,
5396
+ TEXTBEFORE: () => Ul,
5397
+ TEXTJOIN: () => _l,
5398
+ TEXTSPLIT: () => Fl,
5399
+ TRANSLATE: () => Xl,
5400
+ TRIM: () => Gl,
5401
+ UNICHAR: () => Hl,
5402
+ UNICODE: () => kl,
5403
+ UPPER: () => Yl,
5404
+ VALUE: () => Wl,
5405
+ VALUETOTEXT: () => Kl
5388
5406
  });
5389
- function $s(n) {
5390
- return Yl() ? Ql(n) : n;
5407
+ function nl(n) {
5408
+ return jl() ? Zl(n) : n;
5391
5409
  }
5392
- function Zs(n, r = 0) {
5410
+ function tl(n, r = 0) {
5393
5411
  if (0 !== (r = Math.floor(r)) && 1 !== r) throw t.BuiltIn.Value;
5394
5412
  const e = 1 === r;
5395
5413
  let u = null;
5396
5414
  if (!e) {
5397
5415
  if (1 === n.size) {
5398
5416
  const t = n.getValueAt(0, 0);
5399
- return null === t ? null : kl(t, r);
5417
+ return null === t ? null : Kl(t, r);
5400
5418
  }
5401
5419
  const { rows: t, columns: e } = n.getShape(), u = [];
5402
- for (let o = 0; o < t; o++) for (let t = 0; t < e; t++) u.push(kl(n.getValueAt(o, t), r));
5420
+ for (let o = 0; o < t; o++) for (let t = 0; t < e; t++) u.push(Kl(n.getValueAt(o, t), r));
5403
5421
  return u.join(", ");
5404
5422
  }
5405
5423
  const o = n.getValues();
@@ -5407,35 +5425,35 @@ function Zs(n, r = 0) {
5407
5425
  const a = o.length;
5408
5426
  for (let n = 0; n < a; n++) {
5409
5427
  const t = o[n], e = t.length;
5410
- for (let n = 0; n < e; n++) u += kl(t[n], r), n < e - 1 && (u += ",");
5428
+ for (let n = 0; n < e; n++) u += Kl(t[n], r), n < e - 1 && (u += ",");
5411
5429
  n < a - 1 && (u += ";");
5412
5430
  }
5413
5431
  return e && (u += "}"), u;
5414
5432
  }
5415
- function Js(n) {
5433
+ function rl(n) {
5416
5434
  const r = Math.trunc(n);
5417
5435
  if (!(r >= 1 && r <= 255)) throw t.BuiltIn.Value;
5418
5436
  return String.fromCharCode(r);
5419
5437
  }
5420
- function nl(n) {
5438
+ function el(n) {
5421
5439
  return n.replace(/[\x00-\x1F\x80-\x9F]/g, "");
5422
5440
  }
5423
- function tl(n) {
5441
+ function ul(n) {
5424
5442
  if (0 === n.length) throw t.BuiltIn.Value;
5425
5443
  return n.charCodeAt(0);
5426
5444
  }
5427
- function rl(n) {
5445
+ function ol(n) {
5428
5446
  let r = "";
5429
5447
  for (const u of n) for (const n of u.values()) if (r += n, r.length > e.MAX_TEXT_LENGTH) throw t.BuiltIn.Calc;
5430
5448
  return r;
5431
5449
  }
5432
- var el = {
5450
+ var al = {
5433
5451
  type: u.String,
5434
5452
  coerce: [u.Boolean, u.Number],
5435
5453
  onError: "value",
5436
5454
  misalignValue: t.BuiltIn.NA
5437
5455
  };
5438
- function ul(r) {
5456
+ function il(r) {
5439
5457
  let u = n.createRange(1, 1, "");
5440
5458
  for (const n of r) u = u.broadcast(n, (n, r) => {
5441
5459
  if (null !== n && t.isError(n)) return n;
@@ -5445,16 +5463,16 @@ function ul(r) {
5445
5463
  let o = e.MAX_TEXT_LENGTH;
5446
5464
  const a = u.charCodeAt(o - 1), i = u.charCodeAt(o);
5447
5465
  return a >= 55296 && a <= 56319 && i >= 56320 && i <= 57343 && o--, u.slice(0, o);
5448
- }, el);
5466
+ }, al);
5449
5467
  return u;
5450
5468
  }
5451
- function ol(n) {
5469
+ function sl(n) {
5452
5470
  return t.BuiltIn.NA;
5453
5471
  }
5454
- function al(n) {
5455
- return Yl() ? ql(n) : n;
5472
+ function ll(n) {
5473
+ return jl() ? $l(n) : n;
5456
5474
  }
5457
- function il(t, r = 2) {
5475
+ function cl(t, r = 2) {
5458
5476
  if ((r = Math.trunc(r)) < 0) {
5459
5477
  const n = Math.pow(10, -r);
5460
5478
  t = Math.round(t / n) * n, r = 0;
@@ -5462,25 +5480,25 @@ function il(t, r = 2) {
5462
5480
  const e = n.getRuntime().getLocaleProfile().currencySymbol, u = r > 0 ? `.${"0".repeat(r)}` : "", o = `${e}#,##0${u}_);(${e}#,##0${u})`;
5463
5481
  return n.getNumberFormat(o, t).trim();
5464
5482
  }
5465
- function sl(n, t) {
5483
+ function fl(n, t) {
5466
5484
  return n === t;
5467
5485
  }
5468
- function ll(n, r, e = 1) {
5469
- if (e = Math.trunc(e), !Zl(r)) {
5486
+ function ml(n, r, e = 1) {
5487
+ if (e = Math.trunc(e), !tc(r)) {
5470
5488
  if (e < 1 || e > r.length) throw t.BuiltIn.Value;
5471
5489
  const u = r.indexOf(n, e - 1);
5472
5490
  if (-1 === u) throw t.BuiltIn.Value;
5473
5491
  return u + 1;
5474
5492
  }
5475
- if (e < 1 || e > Jl(r)) throw t.BuiltIn.Value;
5476
- const u = r.indexOf(n, nc(r, e - 1));
5493
+ if (e < 1 || e > rc(r)) throw t.BuiltIn.Value;
5494
+ const u = r.indexOf(n, ec(r, e - 1));
5477
5495
  if (-1 === u) throw t.BuiltIn.Value;
5478
- return tc(r, u) + 1;
5496
+ return uc(r, u) + 1;
5479
5497
  }
5480
- function cl(n, t, r = 1) {
5481
- return ll(n, t, r);
5498
+ function pl(n, t, r = 1) {
5499
+ return ml(n, t, r);
5482
5500
  }
5483
- function fl(t, r = 2, e = !1) {
5501
+ function gl(t, r = 2, e = !1) {
5484
5502
  if ((r = Math.trunc(r)) < 0) {
5485
5503
  const n = Math.pow(10, -r);
5486
5504
  t = Math.round(t / n) * n, r = 0;
@@ -5488,35 +5506,35 @@ function fl(t, r = 2, e = !1) {
5488
5506
  const u = `${e ? "" : "#,"}##0${r > 0 ? `.${"0".repeat(r)}` : ""}`;
5489
5507
  return n.getNumberFormat(u, t).trim();
5490
5508
  }
5491
- function ml(n, t) {
5492
- return Ll(n, !0, [t]);
5509
+ function Il(n, t) {
5510
+ return _l(n, !0, [t]);
5493
5511
  }
5494
- function pl(n, r = 1) {
5512
+ function hl(n, r = 1) {
5495
5513
  if (r < 0) throw t.BuiltIn.Value;
5496
- return Zl(n) ? n.slice(0, nc(n, r)) : r > n.length ? n : n.slice(0, r);
5514
+ return tc(n) ? n.slice(0, ec(n, r)) : r > n.length ? n : n.slice(0, r);
5497
5515
  }
5498
- function gl(n, t = 1) {
5499
- return pl(n, t);
5516
+ function Nl(n, t = 1) {
5517
+ return hl(n, t);
5500
5518
  }
5501
- function Il(n) {
5502
- return Zl(n) ? Jl(n) : n.length;
5519
+ function bl(n) {
5520
+ return tc(n) ? rc(n) : n.length;
5503
5521
  }
5504
- function Nl(n) {
5505
- return Il(n);
5522
+ function El(n) {
5523
+ return bl(n);
5506
5524
  }
5507
- function hl(n) {
5525
+ function Al(n) {
5508
5526
  return n.toLowerCase();
5509
5527
  }
5510
- function bl(n, r, e) {
5528
+ function Ml(n, r, e) {
5511
5529
  if (r = Math.trunc(r), e = Math.trunc(e), r < 1 || e < 0) return t.BuiltIn.Value;
5512
- if (!Zl(n)) return r > n.length ? "" : n.slice(r - 1, r + e - 1);
5513
- const u = nc(n, r - 1);
5514
- return u >= n.length ? "" : n.slice(u, nc(n, r - 1 + e));
5530
+ if (!tc(n)) return r > n.length ? "" : n.slice(r - 1, r + e - 1);
5531
+ const u = ec(n, r - 1);
5532
+ return u >= n.length ? "" : n.slice(u, ec(n, r - 1 + e));
5515
5533
  }
5516
- function El(n, t, r) {
5517
- return bl(n, t, r);
5534
+ function dl(n, t, r) {
5535
+ return Ml(n, t, r);
5518
5536
  }
5519
- function Al(r, u, o) {
5537
+ function Sl(r, u, o) {
5520
5538
  const a = n.getRuntime().getLocaleProfile();
5521
5539
  if (u = u ?? a.decimal, o = o ?? a.group, 0 === u.length || 0 === o.length) throw t.BuiltIn.Value;
5522
5540
  if (0 === r.length) return 0;
@@ -5529,50 +5547,50 @@ function Al(r, u, o) {
5529
5547
  for (const n of f) if (n !== u && !"-0123456789%()".includes(n)) throw t.BuiltIn.Value;
5530
5548
  const m = l.replace(u, ".").split(" ").join("").split(c).join("").match(/^([(-]?)(\d*\.?\d+)(\)?)(%*)$/);
5531
5549
  if (!m) throw t.BuiltIn.Value;
5532
- const p = m[1], g = m[3], I = m[4].length, N = "(" === p, h = "-" === p;
5533
- if (N && ")" !== g || !N && ")" === g) throw t.BuiltIn.Value;
5550
+ const p = m[1], g = m[3], I = m[4].length, h = "(" === p, N = "-" === p;
5551
+ if (h && ")" !== g || !h && ")" === g) throw t.BuiltIn.Value;
5534
5552
  let b = Number(e.truncateNumberText(m[2]));
5535
5553
  if (isNaN(b)) throw t.BuiltIn.Value;
5536
- return b /= 100 ** I, N || h ? -b : b;
5554
+ return b /= 100 ** I, h || N ? -b : b;
5537
5555
  }
5538
- function Ml(n) {
5556
+ function Tl(n) {
5539
5557
  return (n = n.toLowerCase()).replace(/(^|\P{L})(\p{L})/gu, (n, t, r) => t + (1 === r.length ? r.toUpperCase() : r));
5540
5558
  }
5541
- function dl(n, r, e, u) {
5542
- return r = Math.trunc(r), e = Math.trunc(e), r < 1 || e < 0 ? t.BuiltIn.Value : Zl(n) ? n.slice(0, nc(n, r - 1)) + u + n.slice(nc(n, r - 1 + e)) : n.slice(0, r - 1) + u + n.slice(r - 1 + e);
5559
+ function Rl(n, r, e, u) {
5560
+ return r = Math.trunc(r), e = Math.trunc(e), r < 1 || e < 0 ? t.BuiltIn.Value : tc(n) ? n.slice(0, ec(n, r - 1)) + u + n.slice(ec(n, r - 1 + e)) : n.slice(0, r - 1) + u + n.slice(r - 1 + e);
5543
5561
  }
5544
- function Sl(n, t, r, e) {
5545
- return dl(n, t, r, e);
5562
+ function Cl(n, t, r, e) {
5563
+ return Rl(n, t, r, e);
5546
5564
  }
5547
- function Tl(n, r) {
5565
+ function wl(n, r) {
5548
5566
  return (r = Math.floor(r)) < 0 || n.length * r > e.MAX_TEXT_LENGTH ? t.BuiltIn.Value : n.repeat(r);
5549
5567
  }
5550
- function Rl(n, r = 1) {
5568
+ function vl(n, r = 1) {
5551
5569
  if (r < 0) throw t.BuiltIn.Value;
5552
- if (!Zl(n)) {
5570
+ if (!tc(n)) {
5553
5571
  const t = n.length;
5554
5572
  return r > t ? n : n.slice(t - r);
5555
5573
  }
5556
- const e = Jl(n);
5557
- return r >= e ? n : n.slice(nc(n, e - Math.trunc(r)));
5574
+ const e = rc(n);
5575
+ return r >= e ? n : n.slice(ec(n, e - Math.trunc(r)));
5558
5576
  }
5559
- function Cl(n, t = 1) {
5560
- return Rl(n, t);
5577
+ function Bl(n, t = 1) {
5578
+ return vl(n, t);
5561
5579
  }
5562
- function vl(n, r, e = 1) {
5563
- const u = Zl(r), a = u ? Jl(r) : r.length;
5580
+ function Ol(n, r, e = 1) {
5581
+ const u = tc(r), a = u ? rc(r) : r.length;
5564
5582
  if (e < 1 || e > a) throw t.BuiltIn.Value;
5565
- const i = o.isWildCard(n) ? o.toRegex(n, "i") : new RegExp(n.replace(/[.*+?^${}()|[\]\\]/g, "\\$&"), "i"), s = u ? nc(r, e - 1) : e - 1, l = r.slice(s).search(i);
5583
+ const i = o.isWildCard(n) ? o.toRegex(n, "i") : new RegExp(n.replace(/[.*+?^${}()|[\]\\]/g, "\\$&"), "i"), s = u ? ec(r, e - 1) : e - 1, l = r.slice(s).search(i);
5566
5584
  if (-1 === l) throw t.BuiltIn.Value;
5567
- return u ? tc(r, s + l) + 1 : l + e;
5585
+ return u ? uc(r, s + l) + 1 : l + e;
5568
5586
  }
5569
- function wl(n, t, r = 1) {
5570
- return vl(n, t, r);
5587
+ function Dl(n, t, r = 1) {
5588
+ return Ol(n, t, r);
5571
5589
  }
5572
- function Bl(n, t, r = !0, e = !0) {
5573
- return Pl(n, r ? t.split("") : [t], void 0, e);
5590
+ function yl(n, t, r = !0, e = !0) {
5591
+ return Fl(n, r ? t.split("") : [t], void 0, e);
5574
5592
  }
5575
- function Ol(n, r, u, o) {
5593
+ function xl(n, r, u, o) {
5576
5594
  if (!n || !r) return n;
5577
5595
  if (void 0 === o) o = -1;
5578
5596
  else if ((o = Math.floor(o)) <= 0) return t.BuiltIn.Value;
@@ -5584,10 +5602,10 @@ function Ol(n, r, u, o) {
5584
5602
  } else i += r.length;
5585
5603
  return a;
5586
5604
  }
5587
- function Dl(n) {
5605
+ function Vl(n) {
5588
5606
  return "string" == typeof n ? n : "";
5589
5607
  }
5590
- function yl(r, e) {
5608
+ function Ll(r, e) {
5591
5609
  if (null === r && (r = 0), "string" == typeof r && "" !== r.trim()) try {
5592
5610
  r = n.parseAsNumber(r.trim());
5593
5611
  } catch (n) {}
@@ -5598,23 +5616,23 @@ function yl(r, e) {
5598
5616
  return t.BuiltIn.Value;
5599
5617
  }
5600
5618
  }
5601
- function xl(n, r, e = 1, u = 0, o = 0, a) {
5619
+ function Pl(n, r, e = 1, u = 0, o = 0, a) {
5602
5620
  if (!n || !r) return t.BuiltIn.Value;
5603
5621
  if (0 === (e = Math.floor(e))) return t.BuiltIn.Value;
5604
- const i = rc(n, r, u);
5622
+ const i = oc(n, r, u);
5605
5623
  1 === o && i.push([n.length, n.length]);
5606
5624
  const s = e > 0 ? e - 1 : i.length + e;
5607
5625
  return s < 0 || s >= i.length ? a ?? t.BuiltIn.NA : n.substring(i[s][1]);
5608
5626
  }
5609
- function Vl(n, r, e = 1, u = 0, o = 0, a) {
5627
+ function Ul(n, r, e = 1, u = 0, o = 0, a) {
5610
5628
  if (!n || !r) return t.BuiltIn.Value;
5611
5629
  if (0 === (e = Math.floor(e))) return t.BuiltIn.Value;
5612
- const i = rc(n, r, u);
5630
+ const i = oc(n, r, u);
5613
5631
  1 === o && i.push([n.length, n.length]);
5614
5632
  const s = e > 0 ? e - 1 : i.length + e;
5615
5633
  return s < 0 || s >= i.length ? a ?? t.BuiltIn.NA : n.substring(0, i[s][0]);
5616
5634
  }
5617
- function Ll(n, r, u) {
5635
+ function _l(n, r, u) {
5618
5636
  let o = "", a = !0;
5619
5637
  for (const i of u) for (const u of i.values({ includeEmpty: !r })) if (0 !== u.length || !r) {
5620
5638
  if (a || (o += n), o += u, o.length > e.MAX_TEXT_LENGTH) return t.BuiltIn.Calc;
@@ -5622,13 +5640,13 @@ function Ll(n, r, u) {
5622
5640
  }
5623
5641
  return o;
5624
5642
  }
5625
- function Pl(n, r, e, u = !1, o = 0, a = void 0) {
5643
+ function Fl(n, r, e, u = !1, o = 0, a = void 0) {
5626
5644
  if (!n) return [[""]];
5627
5645
  if (0 !== o && 1 !== o) throw t.BuiltIn.Value;
5628
5646
  const i = (n) => {
5629
5647
  if (0 === n.length) return null;
5630
5648
  if (n.some((n) => 0 === n.length)) throw t.BuiltIn.Value;
5631
- return new RegExp(n.map((n) => zl(n)).join("|"), 1 === o ? "i" : "");
5649
+ return new RegExp(n.map((n) => Jl(n)).join("|"), 1 === o ? "i" : "");
5632
5650
  }, s = (n, t) => t ? n.split(t) : [n], l = i(r);
5633
5651
  let c = [n];
5634
5652
  if (e && (c = s(n, i(e))), u) {
@@ -5662,39 +5680,39 @@ function Pl(n, r, e, u = !1, o = 0, a = void 0) {
5662
5680
  }
5663
5681
  return f.length > 0 ? f : [[""]];
5664
5682
  }
5665
- function Ul(n, r, e) {
5683
+ function Xl(n, r, e) {
5666
5684
  return t.BuiltIn.NA;
5667
5685
  }
5668
- function _l(n) {
5686
+ function Gl(n) {
5669
5687
  return n.replace(/ +/g, " ").replace(/^ +| +$/g, "");
5670
5688
  }
5671
- function Fl(n) {
5689
+ function Hl(n) {
5672
5690
  if (!(n >= 1)) throw t.BuiltIn.Value;
5673
5691
  const r = Math.trunc(n);
5674
5692
  if (r > 1114111) throw t.BuiltIn.Value;
5675
5693
  if (r >= 55296 && r <= 57343 || r >= 64976 && r <= 65007 || (65535 & r) >= 65534) throw t.BuiltIn.NA;
5676
5694
  return String.fromCodePoint(r);
5677
5695
  }
5678
- function Xl(n) {
5696
+ function kl(n) {
5679
5697
  if (0 === n.length) throw t.BuiltIn.Value;
5680
5698
  const r = n.codePointAt(0);
5681
5699
  if (r >= 55296 && r <= 57343) throw t.BuiltIn.Value;
5682
5700
  return r;
5683
5701
  }
5684
- function Gl(n) {
5702
+ function Yl(n) {
5685
5703
  return n.toUpperCase();
5686
5704
  }
5687
- function Hl(t) {
5705
+ function Wl(t) {
5688
5706
  return null === t ? 0 : n.parseAsNumber(t);
5689
5707
  }
5690
- function kl(r, e = 0) {
5708
+ function Kl(r, e = 0) {
5691
5709
  if (0 !== (e = Math.floor(e)) && 1 !== e) throw t.BuiltIn.Value;
5692
5710
  return "string" == typeof r ? 1 === e ? "\"" + r + "\"" : r : n.toText(r);
5693
5711
  }
5694
- var Yl = () => {
5712
+ var jl = () => {
5695
5713
  const t = n.getRuntime().getLocale().toLowerCase().split(/[-_]/)[0];
5696
5714
  return "ja" === t || "zh" === t || "ko" === t;
5697
- }, Wl = {
5715
+ }, ql = {
5698
5716
  latin: {
5699
5717
  halfRE: /[!-~]/g,
5700
5718
  fullRE: /[!-~]/g,
@@ -5720,11 +5738,11 @@ var Yl = () => {
5720
5738
  half: "¢£¬¯¦¥₩ |←↑→↓■°",
5721
5739
  full: "¢£¬ ̄¦¥₩ │←↑→↓■○"
5722
5740
  }
5723
- }, Kl = (n, t) => n[`${t}RE`] || new RegExp("[" + n[t] + "]", "g"), jl = Object.keys(Wl).map((n) => Wl[n]), ql = (n) => jl.reduce((n, t) => n.replace(Kl(t, "half"), ((n) => (t) => n.delta ? String.fromCharCode(t.charCodeAt(0) + n.delta) : [...n.full][[...n.half].indexOf(t)])(t)), n), Ql = (n) => jl.reduce((n, t) => n.replace(Kl(t, "full"), ((n) => (t) => n.delta ? String.fromCharCode(t.charCodeAt(0) - n.delta) : [...n.half][[...n.full].indexOf(t)])(t)), n);
5724
- function zl(n) {
5741
+ }, zl = (n, t) => n[`${t}RE`] || new RegExp("[" + n[t] + "]", "g"), Ql = Object.keys(ql).map((n) => ql[n]), $l = (n) => Ql.reduce((n, t) => n.replace(zl(t, "half"), ((n) => (t) => n.delta ? String.fromCharCode(t.charCodeAt(0) + n.delta) : [...n.full][[...n.half].indexOf(t)])(t)), n), Zl = (n) => Ql.reduce((n, t) => n.replace(zl(t, "full"), ((n) => (t) => n.delta ? String.fromCharCode(t.charCodeAt(0) - n.delta) : [...n.half][[...n.full].indexOf(t)])(t)), n);
5742
+ function Jl(n) {
5725
5743
  return n.replace(/[.*+?^${}()|[\]\\]/g, "\\$&");
5726
5744
  }
5727
- var $l = /[\uD800-\uDBFF][\uDC00-\uDFFF]/, Zl = (n) => $l.test(n), Jl = (n) => {
5745
+ var nc = /[\uD800-\uDBFF][\uDC00-\uDFFF]/, tc = (n) => nc.test(n), rc = (n) => {
5728
5746
  const t = n.length;
5729
5747
  let r = 0;
5730
5748
  for (let e = 0; e < t - 1; e++) {
@@ -5734,7 +5752,7 @@ var $l = /[\uD800-\uDBFF][\uDC00-\uDFFF]/, Zl = (n) => $l.test(n), Jl = (n) => {
5734
5752
  u >= 56320 && u <= 57343 && (r++, e++);
5735
5753
  }
5736
5754
  return t - r;
5737
- }, nc = (n, t) => {
5755
+ }, ec = (n, t) => {
5738
5756
  const r = Math.trunc(t), e = n.length;
5739
5757
  let u = 0;
5740
5758
  for (let t = 0; t < r && u < e; t++) {
@@ -5742,40 +5760,40 @@ var $l = /[\uD800-\uDBFF][\uDC00-\uDFFF]/, Zl = (n) => $l.test(n), Jl = (n) => {
5742
5760
  u += t >= 55296 && t <= 56319 && r >= 56320 && r <= 57343 ? 2 : 1;
5743
5761
  }
5744
5762
  return Math.min(u, e);
5745
- }, tc = (n, t) => Jl(n.slice(0, t)), rc = (n, t, r) => {
5763
+ }, uc = (n, t) => rc(n.slice(0, t)), oc = (n, t, r) => {
5746
5764
  const e = [];
5747
5765
  if (1 === r) {
5748
- const r = new RegExp(zl(t), "gi");
5766
+ const r = new RegExp(Jl(t), "gi");
5749
5767
  for (let t = r.exec(n); null !== t; t = r.exec(n)) e.push([t.index, t.index + t[0].length]), r.lastIndex = t.index + 1;
5750
5768
  return e;
5751
5769
  }
5752
5770
  for (let r = n.indexOf(t); -1 !== r; r = n.indexOf(t, r + 1)) e.push([r, r + t.length]);
5753
5771
  return e;
5754
- }, ec = c({ BAHTTEXT: () => uc });
5755
- function uc(n) {
5772
+ }, ac = c({ BAHTTEXT: () => ic });
5773
+ function ic(n) {
5756
5774
  try {
5757
5775
  return s(n);
5758
5776
  } catch (n) {
5759
5777
  throw Error(`Error in https://github.com/jojoee/bahttext \n${n.toString()}`);
5760
5778
  }
5761
5779
  }
5762
- var oc = c({ FILTERXML: () => ac });
5763
- async function ac(n, r) {
5764
- if (cc) throw t.BuiltIn.Blocked;
5765
- if (!sc || !lc) try {
5766
- fc ??= ic(), await fc;
5780
+ var sc = c({ FILTERXML: () => lc });
5781
+ async function lc(n, r) {
5782
+ if (pc) throw t.BuiltIn.Blocked;
5783
+ if (!fc || !mc) try {
5784
+ gc ??= cc(), await gc;
5767
5785
  } catch (n) {
5768
- throw cc || (cc = !0, console.warn(`FILTERXML is unavailable: XML libraries could not be loaded (${n?.message ?? n}).`)), t.BuiltIn.Blocked;
5786
+ throw pc || (pc = !0, console.warn(`FILTERXML is unavailable: XML libraries could not be loaded (${n?.message ?? n}).`)), t.BuiltIn.Blocked;
5769
5787
  }
5770
- if (!sc) throw cc = !0, console.warn("Unable to load XML libraries"), t.BuiltIn.Blocked;
5788
+ if (!fc) throw pc = !0, console.warn("Unable to load XML libraries"), t.BuiltIn.Blocked;
5771
5789
  try {
5772
- const t = sc.parseFromString(n, "text/xml");
5773
- return [[lc.evaluateXPathToString(r, t, null, {})]];
5790
+ const t = fc.parseFromString(n, "text/xml");
5791
+ return [[mc.evaluateXPathToString(r, t, null, {})]];
5774
5792
  } catch (n) {
5775
5793
  throw t.BuiltIn.Value;
5776
5794
  }
5777
5795
  }
5778
- var ic = async () => {
5796
+ var cc = async () => {
5779
5797
  const [n, t] = await Promise.all([import(
5780
5798
  /* webpackIgnore: true */
5781
5799
  /* @vite-ignore */
@@ -5785,17 +5803,17 @@ var ic = async () => {
5785
5803
  /* @vite-ignore */
5786
5804
  "https://esm.sh/@xmldom/xmldom@0.8.11"
5787
5805
  )]);
5788
- lc = n;
5806
+ mc = n;
5789
5807
  const r = t.DOMParser;
5790
- sc = new r();
5791
- }, sc = null, lc = null, cc = !1, fc = null, mc = c({
5792
- ENCODEURL: () => pc,
5793
- WEBSERVICE: () => gc
5808
+ fc = new r();
5809
+ }, fc = null, mc = null, pc = !1, gc = null, Ic = c({
5810
+ ENCODEURL: () => hc,
5811
+ WEBSERVICE: () => Nc
5794
5812
  });
5795
- function pc(n) {
5813
+ function hc(n) {
5796
5814
  return encodeURIComponent(n);
5797
5815
  }
5798
- async function gc(n) {
5816
+ async function Nc(n) {
5799
5817
  try {
5800
5818
  const t = await fetch(n, {
5801
5819
  method: "GET",
@@ -5810,7 +5828,7 @@ async function gc(n) {
5810
5828
  throw t.BuiltIn.Value;
5811
5829
  }
5812
5830
  }
5813
- var Ic = {
5831
+ var bc = {
5814
5832
  DAVERAGE: {
5815
5833
  p: [
5816
5834
  {
@@ -6051,7 +6069,7 @@ var Ic = {
6051
6069
  ],
6052
6070
  r: { s: "*" }
6053
6071
  }
6054
- }, Nc = {
6072
+ }, Ec = {
6055
6073
  DATE: {
6056
6074
  p: [
6057
6075
  { n: "year" },
@@ -6232,7 +6250,7 @@ var Ic = {
6232
6250
  p: [{ n: "serialNumber" }],
6233
6251
  r: { s: "number" }
6234
6252
  }
6235
- }, hc = {
6253
+ }, Ac = {
6236
6254
  BESSELI: {
6237
6255
  p: [{
6238
6256
  n: "x",
@@ -6273,7 +6291,7 @@ var Ic = {
6273
6291
  }],
6274
6292
  r: { s: "number" }
6275
6293
  }
6276
- }, bc = {
6294
+ }, Mc = {
6277
6295
  BIN2DEC: {
6278
6296
  p: [{
6279
6297
  n: "number",
@@ -6462,7 +6480,7 @@ var Ic = {
6462
6480
  }],
6463
6481
  r: { s: "*" }
6464
6482
  }
6465
- }, Ec = { CONVERT: {
6483
+ }, dc = { CONVERT: {
6466
6484
  p: [
6467
6485
  {
6468
6486
  n: "number",
@@ -6478,7 +6496,7 @@ var Ic = {
6478
6496
  }
6479
6497
  ],
6480
6498
  r: { s: "number" }
6481
- } }, Ac = {
6499
+ } }, Sc = {
6482
6500
  DELTA: {
6483
6501
  p: [{
6484
6502
  n: "number1",
@@ -6507,7 +6525,7 @@ var Ic = {
6507
6525
  }],
6508
6526
  r: { s: "number" }
6509
6527
  }
6510
- }, Mc = {
6528
+ }, Tc = {
6511
6529
  ERF: {
6512
6530
  p: [{
6513
6531
  n: "lowerLimit",
@@ -6542,7 +6560,7 @@ var Ic = {
6542
6560
  }],
6543
6561
  r: { s: "number" }
6544
6562
  }
6545
- }, dc = {
6563
+ }, Rc = {
6546
6564
  COMPLEX: {
6547
6565
  p: [
6548
6566
  {
@@ -6780,7 +6798,7 @@ var Ic = {
6780
6798
  }],
6781
6799
  r: { s: "*" }
6782
6800
  }
6783
- }, Sc = {
6801
+ }, Cc = {
6784
6802
  CELL: {
6785
6803
  p: [{
6786
6804
  n: "infoType",
@@ -6987,7 +7005,7 @@ var Ic = {
6987
7005
  }],
6988
7006
  r: { s: "number" }
6989
7007
  }
6990
- }, Tc = {
7008
+ }, wc = {
6991
7009
  DATESTRING: {
6992
7010
  p: [{ n: "number" }],
6993
7011
  r: { s: "*" }
@@ -6996,13 +7014,13 @@ var Ic = {
6996
7014
  p: [{ n: "number" }, { n: "number2" }],
6997
7015
  r: { s: "*" }
6998
7016
  }
6999
- }, Rc = { PHONETIC: {
7017
+ }, vc = { PHONETIC: {
7000
7018
  p: [{
7001
7019
  n: "reference",
7002
7020
  r: "p"
7003
7021
  }],
7004
7022
  r: { s: "*" }
7005
- } }, Cc = {
7023
+ } }, Bc = {
7006
7024
  AND: {
7007
7025
  p: [{
7008
7026
  n: "logical",
@@ -7300,7 +7318,7 @@ var Ic = {
7300
7318
  }],
7301
7319
  r: { s: "*" }
7302
7320
  }
7303
- }, vc = { GROUPBY: {
7321
+ }, Oc = { GROUPBY: {
7304
7322
  p: [
7305
7323
  {
7306
7324
  n: "rowFields",
@@ -7350,7 +7368,7 @@ var Ic = {
7350
7368
  s: "*",
7351
7369
  r: "m"
7352
7370
  }
7353
- } }, wc = { PIVOTBY: {
7371
+ } }, Dc = { PIVOTBY: {
7354
7372
  p: [
7355
7373
  {
7356
7374
  n: "rowFields",
@@ -7418,7 +7436,7 @@ var Ic = {
7418
7436
  s: "*",
7419
7437
  r: "m"
7420
7438
  }
7421
- } }, Bc = {
7439
+ } }, yc = {
7422
7440
  ADDRESS: {
7423
7441
  p: [
7424
7442
  { n: "rowNum" },
@@ -7762,7 +7780,7 @@ var Ic = {
7762
7780
  p: [
7763
7781
  {
7764
7782
  n: "lookupValue",
7765
- r: "r",
7783
+ s: "*",
7766
7784
  o: "accept"
7767
7785
  },
7768
7786
  {
@@ -7848,13 +7866,15 @@ var Ic = {
7848
7866
  },
7849
7867
  {
7850
7868
  n: "sortIndex",
7851
- d: 1,
7869
+ r: "r",
7870
+ o: "accept-ref",
7852
7871
  m: "?",
7853
7872
  u: 1
7854
7873
  },
7855
7874
  {
7856
7875
  n: "sortOrder",
7857
- d: 1,
7876
+ r: "r",
7877
+ o: "accept-ref",
7858
7878
  m: "?",
7859
7879
  u: 1
7860
7880
  },
@@ -8079,7 +8099,7 @@ var Ic = {
8079
8099
  p: [
8080
8100
  {
8081
8101
  n: "lookupValue",
8082
- r: "r",
8102
+ s: "*",
8083
8103
  o: "accept"
8084
8104
  },
8085
8105
  {
@@ -8117,7 +8137,7 @@ var Ic = {
8117
8137
  p: [
8118
8138
  {
8119
8139
  n: "lookupValue",
8120
- r: "r",
8140
+ s: "*",
8121
8141
  o: "accept"
8122
8142
  },
8123
8143
  {
@@ -8139,7 +8159,7 @@ var Ic = {
8139
8159
  ],
8140
8160
  r: { s: "*" }
8141
8161
  }
8142
- }, Oc = {
8162
+ }, xc = {
8143
8163
  ABS: {
8144
8164
  p: [{ n: "number" }],
8145
8165
  r: { s: "number" }
@@ -8286,12 +8306,10 @@ var Ic = {
8286
8306
  r: { s: "number" }
8287
8307
  },
8288
8308
  GCD: {
8309
+ x: ["noReferenceLift", "noMemberFilter"],
8289
8310
  p: [{
8290
8311
  n: "number",
8291
- g: [{
8292
- n: "number",
8293
- s: "*"
8294
- }]
8312
+ g: [{ n: "number" }]
8295
8313
  }],
8296
8314
  r: { s: "number" }
8297
8315
  },
@@ -8308,12 +8326,10 @@ var Ic = {
8308
8326
  r: { s: "number" }
8309
8327
  },
8310
8328
  LCM: {
8329
+ x: ["noReferenceLift", "noMemberFilter"],
8311
8330
  p: [{
8312
8331
  n: "number",
8313
- g: [{
8314
- n: "number",
8315
- s: "*"
8316
- }]
8332
+ g: [{ n: "number" }]
8317
8333
  }],
8318
8334
  r: { s: "number" }
8319
8335
  },
@@ -8375,6 +8391,7 @@ var Ic = {
8375
8391
  r: { s: "number" }
8376
8392
  },
8377
8393
  MULTINOMIAL: {
8394
+ x: ["noReferenceLift", "noMemberFilter"],
8378
8395
  p: [{
8379
8396
  n: "number",
8380
8397
  g: [{ n: "number" }]
@@ -8521,7 +8538,6 @@ var Ic = {
8521
8538
  { n: "m" },
8522
8539
  {
8523
8540
  n: "coefficients",
8524
- s: "number",
8525
8541
  r: "r"
8526
8542
  }
8527
8543
  ],
@@ -8666,7 +8682,7 @@ var Ic = {
8666
8682
  }],
8667
8683
  r: { s: "number" }
8668
8684
  }
8669
- }, Dc = {
8685
+ }, Vc = {
8670
8686
  ACOS: {
8671
8687
  p: [{ n: "number" }],
8672
8688
  r: { s: "number" }
@@ -8751,7 +8767,7 @@ var Ic = {
8751
8767
  p: [{ n: "number" }],
8752
8768
  r: { s: "number" }
8753
8769
  }
8754
- }, yc = {
8770
+ }, Lc = {
8755
8771
  ADD: {
8756
8772
  p: [{ n: "value1" }, { n: "value2" }],
8757
8773
  r: { s: "number" }
@@ -8864,7 +8880,7 @@ var Ic = {
8864
8880
  ],
8865
8881
  r: { s: "boolean" }
8866
8882
  }
8867
- }, xc = {
8883
+ }, Pc = {
8868
8884
  "BETA.DIST": {
8869
8885
  fn: "BETA_DIST",
8870
8886
  p: [
@@ -10095,7 +10111,7 @@ var Ic = {
10095
10111
  ],
10096
10112
  r: { s: "number" }
10097
10113
  }
10098
- }, Vc = {
10114
+ }, Uc = {
10099
10115
  AVEDEV: {
10100
10116
  p: [{
10101
10117
  n: "number",
@@ -10425,7 +10441,7 @@ var Ic = {
10425
10441
  }, { n: "k" }],
10426
10442
  r: { s: "number" }
10427
10443
  }
10428
- }, Lc = {
10444
+ }, _c = {
10429
10445
  DELAY: {
10430
10446
  p: [
10431
10447
  { n: "time" },
@@ -10453,7 +10469,7 @@ var Ic = {
10453
10469
  }],
10454
10470
  r: { s: "string" }
10455
10471
  }
10456
- }, Pc = {
10472
+ }, Fc = {
10457
10473
  ASC: {
10458
10474
  p: [{
10459
10475
  n: "text",
@@ -11059,10 +11075,10 @@ var Ic = {
11059
11075
  }],
11060
11076
  r: { s: "string" }
11061
11077
  }
11062
- }, Uc = { BAHTTEXT: {
11078
+ }, Xc = { BAHTTEXT: {
11063
11079
  p: [{ n: "number" }],
11064
11080
  r: { s: "string" }
11065
- } }, _c = { FILTERXML: {
11081
+ } }, Gc = { FILTERXML: {
11066
11082
  p: [{
11067
11083
  n: "xml",
11068
11084
  s: "string"
@@ -11074,7 +11090,7 @@ var Ic = {
11074
11090
  s: "*",
11075
11091
  r: "m"
11076
11092
  }
11077
- } }, Fc = {
11093
+ } }, Hc = {
11078
11094
  ENCODEURL: {
11079
11095
  p: [{
11080
11096
  n: "text",
@@ -11089,5 +11105,5 @@ var Ic = {
11089
11105
  }],
11090
11106
  r: { s: "string" }
11091
11107
  }
11092
- }, Xc = () => import("./Dnec7DXcVTbiXqmG.mjs"), Gc = () => import("./B6y-wWIovFMjN5tD.mjs"), Hc = () => import("./Bl0eYznrlnTAaweo.mjs"), kc = () => import("./BghB7zHcCqFgdw90.mjs"), Yc = () => import("./BSC7kpdD1DnC5HDg.mjs"), Wc = () => import("./CDZHVK66T1WYATSp.mjs"), Kc = () => import("./D4U0YPOGduCwF-01.mjs"), jc = () => import("./l-wX1u0rFT9w8qf4.mjs"), qc = () => import("./Cy5JRFfnImDAp0Ll.mjs"), Qc = () => import("./CJcU813BPMqm5rOx.mjs"), zc = () => import("./BmmkpHOZkUEBeAyW.mjs"), $c = () => import("./C75Qbz3eEqNXEhpL.mjs"), Zc = () => import("./DMcqvOS9dt8YgeTi.mjs"), Jc = () => import("./CwRS0LJWcQtYVRc8.mjs"), nf = () => import("./-K3H4uuFynImIzaZ.mjs"), tf = () => import("./DOUIWQ7CkAL8H3TI.mjs"), rf = () => import("./CitESUUMpeNocyom.mjs"), ef = () => import("./B9-TE-YYGCaJ-yME.mjs"), uf = () => import("./BlqScy7PLzA3TJWD.mjs"), of = () => import("./B3UCYNFvj_EjJphm.mjs"), af = () => import("./B8wDjOEoDr9y2rBc.mjs"), sf = () => import("./BwSSmpNc_yz9k1Td.mjs"), lf = () => import("./CYv-b3CPx4IESjrY.mjs"), cf = () => import("./B2aMDwqSRk2dNVyP.mjs"), ff = () => import("./BDqiJ8pkk7cc_o9u.mjs"), mf = (n, t, r) => (r || (r = /* @__PURE__ */ new Map()), t(r, n, p, Ic, Xc, "Database"), t(r, n, B, Nc, Gc, "Date & Time"), t(r, n, cn, hc, Hc, "Engineering"), t(r, n, In, bc, kc, "Engineering"), t(r, n, Fn, Ec, Yc, "Engineering"), t(r, n, Yn, Ac, Wc, "Engineering"), t(r, n, jn, Mc, Kc, "Engineering"), t(r, n, Zn, dc, jc, "Engineering"), t(r, n, Gt, Sc, qc, "Information"), t(r, n, pr, Tc, Qc, "Japanese"), t(r, n, Nr, Rc, zc, "Japanese"), t(r, n, Mr, Cc, $c, "Logical"), t(r, n, kr, vc, Zc, "Lookup & Reference"), t(r, n, Wr, wc, Jc, "Lookup & Reference"), t(r, n, zr, Bc, nf, "Lookup & Reference"), t(r, n, qe, Oc, tf, "Math & Trig"), t(r, n, po, Dc, rf, "Math & Trig"), t(r, n, Uo, yc, ef, "Operators"), t(r, n, Ba, xc, uf, "Statistical"), t(r, n, Jo, Vc, of, "Statistical"), t(r, n, Ys, Lc, af, "Testing"), t(r, n, zs, Pc, sf, "Text"), t(r, n, ec, Uc, lf, "Thai"), t(r, n, oc, _c, cf, "Web"), t(r, n, mc, Fc, ff, "Web"), r);
11093
- export { mf as default };
11108
+ }, kc = () => import("./CltdofO5ik8g_wQ8.mjs"), Yc = () => import("./Ct1gudv1TKk-5FMO.mjs"), Wc = () => import("./Cyvobf2wi0quDD3U.mjs"), Kc = () => import("./Cdl7ZalV6WPZHHRE.mjs"), jc = () => import("./2TCIoMd-SYs6i4-N.mjs"), qc = () => import("./CWAtVXxcIz86XLzE.mjs"), zc = () => import("./B8rSUcOwH6g4MUgm.mjs"), Qc = () => import("./DKFABgVKeBMflym9.mjs"), $c = () => import("./B7750ljsJF3qA9kU.mjs"), Zc = () => import("./DtqLXxtPFISlNoUd.mjs"), Jc = () => import("./CG1Fn8D-2DrQZoD5.mjs"), nf = () => import("./CVv3DuciDQrnFFeu.mjs"), tf = () => import("./C9jpXFBeugwmOTbx.mjs"), rf = () => import("./Crb70T1Sp1S4uzq4.mjs"), ef = () => import("./-f-RKKojiLg94hp9.mjs"), uf = () => import("./CkG4LZN-kb7plKXG.mjs"), of = () => import("./HgVmqQQhKQ_2v0HD.mjs"), af = () => import("./D2miaIrotHbpdWei.mjs"), sf = () => import("./BR2ai1V5dGPphpRf.mjs"), lf = () => import("./BzNFsi4RXuJrn_1n.mjs"), cf = () => import("./C7mAHEhFYDwSEU6O.mjs"), ff = () => import("./DDajoVNkJB39_Fkx.mjs"), mf = () => import("./ZUay0bTGgyrF8e04.mjs"), pf = () => import("./DxRD19RVMzj2YvKF.mjs"), gf = () => import("./CCGjvL3YYwY09qF-.mjs"), If = (n, t, r) => (r || (r = /* @__PURE__ */ new Map()), t(r, n, p, bc, kc, "Database"), t(r, n, B, Ec, Yc, "Date & Time"), t(r, n, cn, Ac, Wc, "Engineering"), t(r, n, In, Mc, Kc, "Engineering"), t(r, n, Fn, dc, jc, "Engineering"), t(r, n, Yn, Sc, qc, "Engineering"), t(r, n, jn, Tc, zc, "Engineering"), t(r, n, Zn, Rc, Qc, "Engineering"), t(r, n, Gt, Cc, $c, "Information"), t(r, n, pr, wc, Zc, "Japanese"), t(r, n, hr, vc, Jc, "Japanese"), t(r, n, Mr, Bc, nf, "Logical"), t(r, n, kr, Oc, tf, "Lookup & Reference"), t(r, n, Wr, Dc, rf, "Lookup & Reference"), t(r, n, Qr, yc, ef, "Lookup & Reference"), t(r, n, Qe, xc, uf, "Math & Trig"), t(r, n, ho, Vc, of, "Math & Trig"), t(r, n, Xo, Lc, af, "Operators"), t(r, n, ya, Pc, sf, "Statistical"), t(r, n, ra, Uc, lf, "Statistical"), t(r, n, js, _c, cf, "Testing"), t(r, n, Js, Fc, ff, "Text"), t(r, n, ac, Xc, mf, "Thai"), t(r, n, sc, Gc, pf, "Web"), t(r, n, Ic, Hc, gf, "Web"), r);
11109
+ export { If as default };