@sheetxl/formulas 0.7.28-beta.4 → 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 (59) hide show
  1. package/browser/cjs/index.cjs +1 -1
  2. package/browser/esm/{BIxWkCV-r5U5zPnQ.mjs → -f-RKKojiLg94hp9.mjs} +1 -1
  3. package/browser/esm/{DIUPlZfIoj507k-C.mjs → 0amsHACCOHE_JjXI.mjs} +1 -1
  4. package/browser/esm/{AuzqFslmIMxseCn8.mjs → B3pEie3jQN0SvV5B.mjs} +1 -1
  5. package/browser/esm/{K0CU2XaCnJJwh9a5.mjs → B7750ljsJF3qA9kU.mjs} +1 -1
  6. package/browser/esm/{jFM2MqBdxFWP6QmN.mjs → BM1YhvA2ppUZ3QLB.mjs} +1 -1
  7. package/browser/esm/{CB4iUafw8x-4z_ff.mjs → BR2ai1V5dGPphpRf.mjs} +1 -1
  8. package/browser/esm/{ec8i9mVgadWEbuYy.mjs → BYRjnggsufwbb27W.mjs} +1 -1
  9. package/browser/esm/{DNz39xRoqy8IPYb3.mjs → Bsb5i9Jq-Q8RTmvi.mjs} +1 -1
  10. package/{node/esm/DQXZXiayIDbfnOUM.mjs → browser/esm/BzNFsi4RXuJrn_1n.mjs} +1 -1
  11. package/browser/esm/{DiV1y5wtlmlsRDfm.mjs → C7mAHEhFYDwSEU6O.mjs} +1 -1
  12. package/browser/esm/{BebVPCumXxQqABDP.mjs → C9jpXFBeugwmOTbx.mjs} +1 -1
  13. package/browser/esm/{CWI62PClHru85-mL.mjs → CCGjvL3YYwY09qF-.mjs} +1 -1
  14. package/{node/esm/B2zbBC2YuaYszbHd.mjs → browser/esm/CG1Fn8D-2DrQZoD5.mjs} +1 -1
  15. package/browser/esm/{BM0KaGfI1Lqav17f.mjs → CVv3DuciDQrnFFeu.mjs} +1 -1
  16. package/browser/esm/{Co7O0P5yM1i0exNK.mjs → CWAtVXxcIz86XLzE.mjs} +1 -1
  17. package/browser/esm/{VRXC1SwOYSkv1Vs4.mjs → Cdl7ZalV6WPZHHRE.mjs} +1 -1
  18. package/{node/esm/Ctxig2_c-GErg911.mjs → browser/esm/CkG4LZN-kb7plKXG.mjs} +1 -1
  19. package/{node/esm/BXyQ76W9hObzOdf2.mjs → browser/esm/CltdofO5ik8g_wQ8.mjs} +1 -1
  20. package/browser/esm/{74anAHR6YDREjbgI.mjs → Crb70T1Sp1S4uzq4.mjs} +1 -1
  21. package/{node/esm/wDeMNrClyQscDTwZ.mjs → browser/esm/Ct1gudv1TKk-5FMO.mjs} +1 -1
  22. package/{node/esm/DjFalvyAcEOwNagC.mjs → browser/esm/Cyvobf2wi0quDD3U.mjs} +1 -1
  23. package/{node/esm/B2b-ZmAhe94pNDT0.mjs → browser/esm/D2miaIrotHbpdWei.mjs} +1 -1
  24. package/browser/esm/{BHG0YIMg5kOV3mNl.mjs → DKFABgVKeBMflym9.mjs} +1 -1
  25. package/{node/esm/ymPI-MJUjuYe2n5v.mjs → browser/esm/DtqLXxtPFISlNoUd.mjs} +1 -1
  26. package/{node/esm/CmxGNGhfoNTz4Ku7.mjs → browser/esm/HgVmqQQhKQ_2v0HD.mjs} +1 -1
  27. package/browser/esm/index.mjs +1023 -1020
  28. package/node/esm/{BIxWkCV-r5U5zPnQ.mjs → -f-RKKojiLg94hp9.mjs} +1 -1
  29. package/node/esm/{DcSbVdpEmRbpaZf0.mjs → 2TCIoMd-SYs6i4-N.mjs} +1 -1
  30. package/node/esm/{K0CU2XaCnJJwh9a5.mjs → B7750ljsJF3qA9kU.mjs} +1 -1
  31. package/node/esm/{8_dh9QnzvNBCvWpp.mjs → B8rSUcOwH6g4MUgm.mjs} +1 -1
  32. package/node/esm/{CB4iUafw8x-4z_ff.mjs → BR2ai1V5dGPphpRf.mjs} +1 -1
  33. package/{browser/esm/DQXZXiayIDbfnOUM.mjs → node/esm/BzNFsi4RXuJrn_1n.mjs} +1 -1
  34. package/node/esm/{DiV1y5wtlmlsRDfm.mjs → C7mAHEhFYDwSEU6O.mjs} +1 -1
  35. package/node/esm/{BebVPCumXxQqABDP.mjs → C9jpXFBeugwmOTbx.mjs} +1 -1
  36. package/node/esm/{CWI62PClHru85-mL.mjs → CCGjvL3YYwY09qF-.mjs} +1 -1
  37. package/{browser/esm/B2zbBC2YuaYszbHd.mjs → node/esm/CG1Fn8D-2DrQZoD5.mjs} +1 -1
  38. package/node/esm/{BM0KaGfI1Lqav17f.mjs → CVv3DuciDQrnFFeu.mjs} +1 -1
  39. package/node/esm/{Co7O0P5yM1i0exNK.mjs → CWAtVXxcIz86XLzE.mjs} +1 -1
  40. package/node/esm/{VRXC1SwOYSkv1Vs4.mjs → Cdl7ZalV6WPZHHRE.mjs} +1 -1
  41. package/{browser/esm/Ctxig2_c-GErg911.mjs → node/esm/CkG4LZN-kb7plKXG.mjs} +1 -1
  42. package/{browser/esm/BXyQ76W9hObzOdf2.mjs → node/esm/CltdofO5ik8g_wQ8.mjs} +1 -1
  43. package/node/esm/{74anAHR6YDREjbgI.mjs → Crb70T1Sp1S4uzq4.mjs} +1 -1
  44. package/{browser/esm/wDeMNrClyQscDTwZ.mjs → node/esm/Ct1gudv1TKk-5FMO.mjs} +1 -1
  45. package/{browser/esm/DjFalvyAcEOwNagC.mjs → node/esm/Cyvobf2wi0quDD3U.mjs} +1 -1
  46. package/{browser/esm/B2b-ZmAhe94pNDT0.mjs → node/esm/D2miaIrotHbpdWei.mjs} +1 -1
  47. package/node/esm/{D1iK18Nn8mRQo6Fk.mjs → DDajoVNkJB39_Fkx.mjs} +1 -1
  48. package/node/esm/{BHG0YIMg5kOV3mNl.mjs → DKFABgVKeBMflym9.mjs} +1 -1
  49. package/{browser/esm/ymPI-MJUjuYe2n5v.mjs → node/esm/DtqLXxtPFISlNoUd.mjs} +1 -1
  50. package/node/esm/{Dnrd8jP_j1AWCUX6.mjs → DxRD19RVMzj2YvKF.mjs} +1 -1
  51. package/{browser/esm/CmxGNGhfoNTz4Ku7.mjs → node/esm/HgVmqQQhKQ_2v0HD.mjs} +1 -1
  52. package/node/esm/{BsBiI5HHw7jjXgp5.mjs → ZUay0bTGgyrF8e04.mjs} +1 -1
  53. package/node/esm/index.mjs +1066 -1065
  54. package/package.json +3 -3
  55. package/types/src/_utils/AggregateIFS.d.ts +2 -2
  56. package/types/src/_utils/Errors.d.ts +1 -1
  57. package/types/src/information/Information.d.ts +6 -6
  58. package/types/src/lookupReference/Reference.d.ts +4 -4
  59. 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.4
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,
@@ -2539,10 +2539,10 @@ function jt(n) {
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;
@@ -2627,8 +2627,8 @@ 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) {
@@ -2665,8 +2665,8 @@ var Er = (n, t) => (n ?? 0) + t, Ar = (n, t) => n, Mr = c({
2665
2665
  BYROW: () => Tr,
2666
2666
  FALSE: () => Rr,
2667
2667
  FLATTEN: () => Cr,
2668
- IF: () => vr,
2669
- IFERROR: () => wr,
2668
+ IF: () => wr,
2669
+ IFERROR: () => vr,
2670
2670
  IFNA: () => Br,
2671
2671
  IFS: () => Or,
2672
2672
  LAMBDA: () => Dr,
@@ -2709,22 +2709,12 @@ function Rr() {
2709
2709
  return !1;
2710
2710
  }
2711
2711
  function Cr(n) {
2712
- const t = n[0].empty().sparseBuilder();
2713
- let e = 0;
2714
- for (const u of n) {
2715
- const n = u.entries({
2716
- axis: r.Axis.Row,
2717
- includeEmpty: !0
2718
- });
2719
- let o = n.next();
2720
- for (; !o.done;) t.pushAt(e++, 0, o.value.value), o = n.next();
2721
- }
2722
- return t.build();
2712
+ return n.map((n) => n.flatten()).reduce((n, t) => n.concat(t));
2723
2713
  }
2724
- function vr(n, t, r = !1) {
2714
+ function wr(n, t, r = !1) {
2725
2715
  return n ? t : r;
2726
2716
  }
2727
- function wr(n, r) {
2717
+ function vr(n, r) {
2728
2718
  return t.isError(n) ? r : n;
2729
2719
  }
2730
2720
  function Br(n, r) {
@@ -2840,7 +2830,7 @@ var Wr = c({ PIVOTBY: () => Kr });
2840
2830
  function Kr(n, r, e, u, o, a = 2, i, s = 2, l, c, f = 0) {
2841
2831
  throw t.BuiltIn.NA;
2842
2832
  }
2843
- 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({
2844
2834
  type: u.Number,
2845
2835
  axis: r.Axis.Column
2846
2836
  }), c({
@@ -2862,8 +2852,8 @@ var jr = Object.freeze({ includeEmpty: !0 }), qr = Object.freeze({ axis: r.Axis.
2862
2852
  HLOOKUP: () => pe,
2863
2853
  HSTACK: () => ge,
2864
2854
  HYPERLINK: () => Ie,
2865
- IMAGE: () => Ne,
2866
- INDEX: () => he,
2855
+ IMAGE: () => he,
2856
+ INDEX: () => Ne,
2867
2857
  INDIRECT: () => be,
2868
2858
  LOOKUP: () => Ee,
2869
2859
  MATCH: () => Ae,
@@ -2872,19 +2862,19 @@ var jr = Object.freeze({ includeEmpty: !0 }), qr = Object.freeze({ axis: r.Axis.
2872
2862
  ROWS: () => Se,
2873
2863
  RTD: () => Te,
2874
2864
  SORT: () => Re,
2875
- SORTBY: () => ve,
2876
- TAKE: () => we,
2877
- TOCOL: () => Be,
2878
- TOROW: () => Oe,
2879
- TRANSPOSE: () => De,
2880
- TRIMRANGE: () => ye,
2881
- UNIQUE: () => xe,
2882
- VLOOKUP: () => Ve,
2883
- VSTACK: () => Le,
2884
- WRAPCOLS: () => Pe,
2885
- WRAPROWS: () => Ue,
2886
- XLOOKUP: () => _e,
2887
- 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
2888
2878
  }));
2889
2879
  function $r(r, e, u = 1, o = !0, a) {
2890
2880
  if (r < 1 || e < 1 || u < 1 || u > 4) throw t.BuiltIn.Value;
@@ -3002,7 +2992,7 @@ function pe(n, e, u, o = !0) {
3002
2992
  if (u < 1) return t.BuiltIn.Value;
3003
2993
  if (u > e.getRowCount()) return t.BuiltIn.Ref;
3004
2994
  if (1 === e.size) return t.BuiltIn.NA;
3005
- const a = typeof n, i = He(n);
2995
+ const a = typeof n, i = Ye(n);
3006
2996
  if (o) {
3007
2997
  let o = null, i = -1, s = !0, l = !1;
3008
2998
  const c = e.entries({
@@ -3018,12 +3008,12 @@ function pe(n, e, u, o = !0) {
3018
3008
  f = c.next();
3019
3009
  continue;
3020
3010
  }
3021
- const g = Ge(r, n);
3011
+ const g = ke(r, n);
3022
3012
  if (s) {
3023
3013
  o = r, i = p, s = !1, g > 0 && (l = !0), f = c.next();
3024
3014
  continue;
3025
3015
  }
3026
- const I = Ge(o, n);
3016
+ const I = ke(o, n);
3027
3017
  if (g > 0 && (l = !0), I > 0 && g > 0) return t.BuiltIn.NA;
3028
3018
  if (l && 0 === I && g < 0) return e.getValueAt(u - 1, i) ?? t.BuiltIn.NA;
3029
3019
  if (null != o && g > 0 && I <= 0) return e.getValueAt(u - 1, i) ?? t.BuiltIn.NA;
@@ -3039,7 +3029,7 @@ function pe(n, e, u, o = !0) {
3039
3029
  for (; !l.done;) {
3040
3030
  const { value: r, coords: o } = l.value;
3041
3031
  if (0 !== o.rowIndex) break;
3042
- 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;
3043
3033
  l = s.next();
3044
3034
  }
3045
3035
  return t.BuiltIn.NA;
@@ -3048,8 +3038,8 @@ function ge(n) {
3048
3038
  return n.reduce((n, t) => n.concat(t, r.Axis.Column));
3049
3039
  }
3050
3040
  function Ie(n, t) {}
3051
- function Ne(n, t, r, e, u) {}
3052
- 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) {
3053
3043
  if (e ??= 0, e < 0 || u < 0 || o < 1) return t.BuiltIn.Value;
3054
3044
  if (o > r.length) return t.BuiltIn.Ref;
3055
3045
  const a = r[o - 1], i = a.getRowCount(), s = a.getColumnCount();
@@ -3081,15 +3071,15 @@ function Ee(r, e, u) {
3081
3071
  const o = e.getRowCount(), a = e.getColumnCount(), i = o > 1 && a > 1;
3082
3072
  if (i && !u) {
3083
3073
  if (a > o) {
3084
- const n = We(r, e, !0);
3074
+ const n = je(r, e, !0);
3085
3075
  return -1 === n ? t.BuiltIn.NA : e.getValueAt(o - 1, n) ?? t.BuiltIn.NA;
3086
3076
  }
3087
3077
  {
3088
- const n = We(r, e, !1);
3078
+ const n = je(r, e, !1);
3089
3079
  return -1 === n ? t.BuiltIn.NA : e.getValueAt(n, a - 1) ?? t.BuiltIn.NA;
3090
3080
  }
3091
3081
  }
3092
- 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);
3093
3083
  return -1 === l ? t.BuiltIn.NA : u ? function(r, e, u) {
3094
3084
  const o = r.getRowCount(), a = r.getColumnCount();
3095
3085
  if (o > 1 && a > 1) return t.BuiltIn.NA;
@@ -3102,11 +3092,11 @@ function Ee(r, e, u) {
3102
3092
  }(u, l, s ? a : o) : (s ? e.getValueAt(0, l) : e.getValueAt(l, 0)) ?? 0;
3103
3093
  }
3104
3094
  function Ae(n, t, r = 1) {
3105
- 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);
3106
3096
  }
3107
3097
  function Me(t, r, e, u, o) {
3108
3098
  r = Math.trunc(r), e = Math.trunc(e);
3109
- 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());
3110
3100
  return n.getReference({
3111
3101
  rowStart: i,
3112
3102
  colStart: l,
@@ -3128,30 +3118,52 @@ function Te(n, r, e) {
3128
3118
  return t.BuiltIn.NA;
3129
3119
  }
3130
3120
  function Re(n, e, u, o = !1) {
3131
- 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;
3132
3123
  return n.map((n) => {
3133
3124
  const e = Math.trunc(n);
3134
3125
  if (!(e >= 1 && e <= r)) throw t.BuiltIn.Value;
3135
3126
  return e - 1;
3136
3127
  });
3137
- }(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({
3138
3129
  rowStart: t,
3139
3130
  rowEnd: t
3140
3131
  }) : n.slice({
3141
3132
  colStart: t,
3142
3133
  colEnd: t
3143
- })), m = n.argsort(f, c, s);
3144
- return n.take(m, s).resize(a, i);
3134
+ })), p = n.argsort(m, f, s);
3135
+ return n.take(p, s).resize(a, i);
3136
+ }
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
+ });
3145
3155
  }
3146
- function Ce(n) {
3147
- return n.map((n) => {
3156
+ function ve(n, r) {
3157
+ if (1 !== n.length && n.length !== r) throw t.BuiltIn.Value;
3158
+ const e = n.map((n) => {
3148
3159
  const r = Math.trunc(n);
3149
3160
  if (1 !== r && -1 !== r) throw t.BuiltIn.Value;
3150
3161
  return r;
3151
3162
  });
3163
+ return e.length === r ? e : new Array(r).fill(e[0]);
3152
3164
  }
3153
- function ve(n, e) {
3154
- 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();
3155
3167
  for (let n = 0; n < u.length; n++) {
3156
3168
  const r = u[n];
3157
3169
  if (1 !== r.getColumnCount() || r.getRowCount() !== a) return t.BuiltIn.Value;
@@ -3159,7 +3171,7 @@ function ve(n, e) {
3159
3171
  const s = n.argsort(u, o, r.Axis.Row);
3160
3172
  return n.take(s, r.Axis.Row).resize(a, i);
3161
3173
  }
3162
- function we(n, r, e) {
3174
+ function Oe(n, r, e) {
3163
3175
  if (0 === r || 0 === e) return t.BuiltIn.Calc;
3164
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;
3165
3177
  return n.slice({
@@ -3169,12 +3181,13 @@ function we(n, r, e) {
3169
3181
  colEnd: l - 1
3170
3182
  });
3171
3183
  }
3172
- function Be(n, t = 0, e = !1) {
3173
- 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);
3174
3187
  let s = 0, l = 0, c = i.next();
3175
3188
  for (; !c.done;) {
3176
3189
  const { value: n, coords: r } = c.value;
3177
- if (c = i.next(), Ye(n, t)) s++;
3190
+ if (c = i.next(), Ke(n, t)) s++;
3178
3191
  else if (0 === t || 2 === t) {
3179
3192
  const t = e ? r.colIndex * o + r.rowIndex : r.rowIndex * u + r.colIndex;
3180
3193
  a.pushAt(t - s, 0, n);
@@ -3182,12 +3195,13 @@ function Be(n, t = 0, e = !1) {
3182
3195
  }
3183
3196
  return a.build();
3184
3197
  }
3185
- function Oe(n, t = 0, e = !1) {
3186
- 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);
3187
3201
  let s = 0, l = 0, c = i.next();
3188
3202
  for (; !c.done;) {
3189
3203
  const { value: n, coords: r } = c.value;
3190
- if (c = i.next(), Ye(n, t)) s++;
3204
+ if (c = i.next(), Ke(n, t)) s++;
3191
3205
  else if (0 === t || 2 === t) {
3192
3206
  const t = e ? r.colIndex * o + r.rowIndex : r.rowIndex * u + r.colIndex;
3193
3207
  a.pushAt(0, t - s, n);
@@ -3195,10 +3209,10 @@ function Oe(n, t = 0, e = !1) {
3195
3209
  }
3196
3210
  return a.build();
3197
3211
  }
3198
- function De(n) {
3212
+ function xe(n) {
3199
3213
  return n.transpose();
3200
3214
  }
3201
- function ye(e, u = 3, o = 3) {
3215
+ function Ve(e, u = 3, o = 3) {
3202
3216
  let a = 0, i = e.getRowCount() - 1, s = 0, l = e.getColumnCount() - 1;
3203
3217
  const c = e.isIReferenceRange;
3204
3218
  let f;
@@ -3242,17 +3256,17 @@ function ye(e, u = 3, o = 3) {
3242
3256
  let p;
3243
3257
  return c ? n.getReference(m) : (p = e.slice(m), p);
3244
3258
  }
3245
- function xe(n, e = !1, u = !1) {
3259
+ function Le(n, e = !1, u = !1) {
3246
3260
  const o = e ? r.Axis.Column : r.Axis.Row, a = n.uniqueIndices(o, u);
3247
3261
  if (0 === a.length) throw t.BuiltIn.Calc;
3248
3262
  return n.take(a, o);
3249
3263
  }
3250
- function Ve(n, e, u, o = !0) {
3264
+ function Pe(n, e, u, o = !0) {
3251
3265
  if (t.isError(n)) return n;
3252
3266
  if (u < 1) return t.BuiltIn.Value;
3253
3267
  if (u > e.getColumnCount()) return t.BuiltIn.Ref;
3254
3268
  if (1 === e.size) return t.BuiltIn.NA;
3255
- const a = typeof n, i = He(n);
3269
+ const a = typeof n, i = Ye(n);
3256
3270
  if (o) {
3257
3271
  let o = null, i = -1, s = !0, l = !1;
3258
3272
  const c = e.entries({
@@ -3268,12 +3282,12 @@ function Ve(n, e, u, o = !0) {
3268
3282
  f = c.next();
3269
3283
  continue;
3270
3284
  }
3271
- const g = Ge(r, n);
3285
+ const g = ke(r, n);
3272
3286
  if (s) {
3273
3287
  o = r, i = p, s = !1, g > 0 && (l = !0), f = c.next();
3274
3288
  continue;
3275
3289
  }
3276
- const I = Ge(o, n);
3290
+ const I = ke(o, n);
3277
3291
  if (g > 0 && (l = !0), I > 0 && g > 0) return t.BuiltIn.NA;
3278
3292
  if (l && 0 === I && g < 0) return e.getValueAt(i, u - 1) ?? t.BuiltIn.NA;
3279
3293
  if (null != o && g > 0 && I <= 0) return e.getValueAt(i, u - 1) ?? t.BuiltIn.NA;
@@ -3289,15 +3303,15 @@ function Ve(n, e, u, o = !0) {
3289
3303
  for (; !l.done;) {
3290
3304
  const { value: r, coords: o } = l.value;
3291
3305
  if (0 !== o.colIndex) break;
3292
- 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;
3293
3307
  l = s.next();
3294
3308
  }
3295
3309
  return t.BuiltIn.NA;
3296
3310
  }
3297
- function Le(n) {
3311
+ function Ue(n) {
3298
3312
  return n.reduce((n, t) => n.concat(t, r.Axis.Row));
3299
3313
  }
3300
- function Pe(n, e, u = t.BuiltIn.NA) {
3314
+ function _e(n, e, u = t.BuiltIn.NA) {
3301
3315
  const { rows: o, columns: a } = n.getShape();
3302
3316
  if (o > 1 && a > 1) return t.BuiltIn.Value;
3303
3317
  if (e <= 0 || !Number.isFinite(e)) return t.BuiltIn.Num;
@@ -3312,7 +3326,7 @@ function Pe(n, e, u = t.BuiltIn.NA) {
3312
3326
  for (let n = f + 1; n < l.size; n++) c.pushAt(n % e, Math.floor(n / e), u);
3313
3327
  return c.build();
3314
3328
  }
3315
- function Ue(n, e, u = t.BuiltIn.NA) {
3329
+ function Fe(n, e, u = t.BuiltIn.NA) {
3316
3330
  const { rows: o, columns: a } = n.getShape();
3317
3331
  if (o > 1 && a > 1) return t.BuiltIn.Value;
3318
3332
  if (e <= 0 || !Number.isFinite(e)) return t.BuiltIn.Num;
@@ -3327,7 +3341,7 @@ function Ue(n, e, u = t.BuiltIn.NA) {
3327
3341
  for (let n = f + 1; n < l.size; n++) c.pushAt(s - 1, n % e, u);
3328
3342
  return c.build();
3329
3343
  }
3330
- 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) {
3331
3345
  if (![
3332
3346
  0,
3333
3347
  -1,
@@ -3342,56 +3356,45 @@ function _e(r, e, u, o = t.BuiltIn.NA, a = 0, i = 1) {
3342
3356
  ].includes(i)) throw t.BuiltIn.Value;
3343
3357
  if (2 === a && (2 === i || -2 === i)) throw t.BuiltIn.Value;
3344
3358
  if (e.getColumnCount() > 1 && e.getRowCount() > 1) throw t.BuiltIn.Value;
3345
- const s = e.flatten(jr), l = [], c = [];
3359
+ const s = e.getValuesFlat(jr), l = [], c = [];
3346
3360
  for (let n = 0; n < s.length; n++) null !== s[n] && void 0 !== s[n] && (l.push(s[n]), c.push(n));
3347
3361
  const f = 1 === e.getRowCount();
3348
- if (1 === r.getRowCount() && 1 === r.getColumnCount()) {
3349
- const e = r.getValueAt(0, 0);
3350
- if (null == e) return o;
3351
- if (t.isError(e)) return e;
3352
- const s = ke(e, l, a, i);
3353
- if (-1 === s) return o;
3354
- const m = c[s];
3355
- if (m < (f ? u.getColumnCount() : u.getRowCount())) {
3356
- if (!0 === u.isIReferenceRange) {
3357
- const t = u.getCoords();
3358
- return n.getReference(f ? {
3359
- rowStart: t.rowStart,
3360
- rowEnd: t.rowEnd,
3361
- colStart: t.colStart + m,
3362
- colEnd: t.colStart + m,
3363
- scope: t.scope
3364
- } : {
3365
- rowStart: t.rowStart + m,
3366
- rowEnd: t.rowStart + m,
3367
- colStart: t.colStart,
3368
- colEnd: t.colEnd,
3369
- scope: t.scope
3370
- });
3371
- }
3372
- return u.slice(f ? {
3373
- colStart: m,
3374
- 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
3375
3376
  } : {
3376
- rowStart: m,
3377
- rowEnd: m
3377
+ rowStart: t.rowStart + p,
3378
+ rowEnd: t.rowStart + p,
3379
+ colStart: t.colStart,
3380
+ colEnd: t.colEnd,
3381
+ scope: t.scope
3378
3382
  });
3379
3383
  }
3380
- 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
+ });
3381
3391
  }
3382
- return r.map((n) => {
3383
- if (null === n) return o;
3384
- if (t.isError(n)) return n;
3385
- const r = ke(n, l, a, i);
3386
- if (-1 === r) return o;
3387
- const e = c[r];
3388
- return u.getValueAt(f ? 0 : e, f ? e : 0);
3389
- }, jr);
3392
+ return u.getValueAt(f ? 0 : p, f ? p : 0);
3390
3393
  }
3391
- function Fe(n, t, r = 0, e = 1) {
3392
- 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);
3393
3396
  }
3394
- function Xe(n, r, e, u, o) {
3397
+ function He(n, r, e, u, o) {
3395
3398
  if (![
3396
3399
  0,
3397
3400
  -1,
@@ -3406,30 +3409,28 @@ function Xe(n, r, e, u, o) {
3406
3409
  ].includes(u)) throw t.BuiltIn.Value;
3407
3410
  if (2 === e && (2 === u || -2 === u)) throw t.BuiltIn.Value;
3408
3411
  if (r.getColumnCount() > 1 && r.getRowCount() > 1) throw t.BuiltIn.Value;
3409
- 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 = [];
3410
3415
  for (let n = 0; n < a.length; n++) null !== a[n] && void 0 !== a[n] && (i.push(a[n]), s.push(n));
3411
- return n.map((n) => {
3412
- if (null === n) return t.BuiltIn.NA;
3413
- if (t.isError(n)) return n;
3414
- const r = ke(n, i, e, u, o);
3415
- return -1 === r ? t.BuiltIn.NA : s[r] + 1;
3416
- }, jr);
3416
+ const l = We(n, i, e, u, o);
3417
+ return -1 === l ? t.BuiltIn.NA : s[l] + 1;
3417
3418
  }
3418
- function Ge(t, r) {
3419
+ function ke(t, r) {
3419
3420
  return "number" == typeof t && "number" == typeof r ? t < r ? -1 : t > r ? 1 : 0 : n.compare(t, r);
3420
3421
  }
3421
- function He(n, t = !1) {
3422
+ function Ye(n, t = !1) {
3422
3423
  return "string" != typeof n ? null : (t ? /[*?~]/.test(n) : o.isWildCard(n)) ? o.toRegex(n, "i", !0) : null;
3423
3424
  }
3424
- function ke(n, t, r, e, u = 2 === r) {
3425
- 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;
3426
3427
  if (2 === e || -2 === e) return function(n, t, r, e) {
3427
3428
  let u = 0, o = n.length - 1, a = -1;
3428
3429
  for (; u <= o;) {
3429
- const r = u + o >>> 1, i = Ge(n[r], t);
3430
+ const r = u + o >>> 1, i = ke(n[r], t);
3430
3431
  (e ? i <= 0 : i >= 0) ? (a = r, u = r + 1) : o = r - 1;
3431
3432
  }
3432
- 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;
3433
3434
  }(t, n, r, 2 === e);
3434
3435
  const a = -1 === e ? -1 : 1, i = -1 === e ? t.length - 1 : 0, s = -1 === e ? -1 : t.length;
3435
3436
  if (0 === r || 2 === r) {
@@ -3438,7 +3439,7 @@ function ke(n, t, r, e, u = 2 === r) {
3438
3439
  if (null != e) {
3439
3440
  if (o) {
3440
3441
  if ("string" == typeof e && o.test(e)) return r;
3441
- } else if (0 === Ge(e, n)) return r;
3442
+ } else if (0 === ke(e, n)) return r;
3442
3443
  }
3443
3444
  }
3444
3445
  return -1;
@@ -3447,16 +3448,16 @@ function ke(n, t, r, e, u = 2 === r) {
3447
3448
  for (let e = i; e !== s; e += a) {
3448
3449
  const u = t[e];
3449
3450
  if (null == u) continue;
3450
- const o = Ge(u, n);
3451
+ const o = ke(u, n);
3451
3452
  if (0 === o) return e;
3452
- -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);
3453
3454
  }
3454
3455
  return l;
3455
3456
  }
3456
- function Ye(n, r) {
3457
+ function Ke(n, r) {
3457
3458
  return 0 !== r && ((1 === r || 3 === r) && null === n || !(2 !== r && 3 !== r || !t.isError(n)));
3458
3459
  }
3459
- function We(n, e, u) {
3460
+ function je(n, e, u) {
3460
3461
  const o = typeof n;
3461
3462
  let a = -1, i = null, s = !1;
3462
3463
  const l = u ? r.Axis.Row : r.Axis.Column, c = e.entries({
@@ -3479,21 +3480,21 @@ function We(n, e, u) {
3479
3480
  f = c.next();
3480
3481
  continue;
3481
3482
  }
3482
- const m = Ge(r, n);
3483
+ const m = ke(r, n);
3483
3484
  if (m > 0 && (s = !0), m <= 0) {
3484
- const t = null !== i && 0 === Ge(i, n);
3485
+ const t = null !== i && 0 === ke(i, n);
3485
3486
  s && t || (a = l, i = r);
3486
3487
  }
3487
3488
  f = c.next();
3488
3489
  }
3489
3490
  return a;
3490
3491
  }
3491
- var Ke = (n, r) => {
3492
+ var qe = (n, r) => {
3492
3493
  if (0 === r) throw t.BuiltIn.Ref;
3493
3494
  const e = Math.trunc(r), u = r > 0 ? n : n + e + 1, o = r > 0 ? n + e - 1 : n;
3494
3495
  return u > o ? [o, u] : [u, o];
3495
3496
  };
3496
- function je(n, r, e, u, o, a) {
3497
+ function ze(n, r, e, u, o, a) {
3497
3498
  const i = r.map((n) => n[0]), s = i[0].getColumnCount(), l = i[0].getRowCount();
3498
3499
  for (let n = 1; n < i.length; n++) if (i[n].getColumnCount() !== s || i[n].getRowCount() !== l) throw t.BuiltIn.Value;
3499
3500
  const c = i.length, f = new Array(c);
@@ -3505,81 +3506,81 @@ function je(n, r, e, u, o, a) {
3505
3506
  const p = i.slice(1);
3506
3507
  let g = -1, I = null;
3507
3508
  u && (m ? (g = c, p.push(u)) : I = u);
3508
- const N = i[0].alignReduce(p, (n, t, r) => {
3509
+ const h = i[0].alignReduce(p, (n, t, r) => {
3509
3510
  for (let r = 0; r < c; r++) if (!f[r](t[r])) return n;
3510
3511
  let u = !0;
3511
3512
  return I ? u = I.getValueAt(r.rowIndex, r.colIndex) ?? null : g >= 0 && (u = t[g] ?? null), e(n, u);
3512
3513
  }, null, m && a ? { emptyFold: a } : void 0);
3513
- return null !== N ? N : o;
3514
- }
3515
- var qe = c({
3516
- ABS: () => Qe,
3517
- AGGREGATE: () => ze,
3518
- ARABIC: () => $e,
3519
- BASE: () => Ze,
3520
- CEILING: () => Je,
3521
- CEILING_MATH: () => nu,
3522
- CEILING_PRECISE: () => tu,
3523
- COMBIN: () => eu,
3524
- COMBINA: () => uu,
3525
- DECIMAL: () => ou,
3526
- DEGREES: () => au,
3527
- ECMA_CEILING: () => ru,
3528
- EVEN: () => iu,
3529
- EXP: () => su,
3530
- FACT: () => lu,
3531
- FACTDOUBLE: () => cu,
3532
- FLOOR: () => fu,
3533
- FLOOR_MATH: () => mu,
3534
- FLOOR_PRECISE: () => pu,
3535
- GCD: () => gu,
3536
- INT: () => Iu,
3537
- ISO_CEILING: () => Nu,
3538
- LCM: () => hu,
3539
- LN: () => bu,
3540
- LOG: () => Eu,
3541
- LOG10: () => Au,
3542
- MDETERM: () => Mu,
3543
- MINVERSE: () => du,
3544
- MMULT: () => Su,
3545
- MOD: () => Tu,
3546
- MROUND: () => Ru,
3547
- MULTINOMIAL: () => Cu,
3548
- MUNIT: () => vu,
3549
- ODD: () => wu,
3550
- PERCENTOF: () => Bu,
3551
- PI: () => Ou,
3552
- POWER: () => Du,
3553
- PRODUCT: () => yu,
3554
- QUOTIENT: () => xu,
3555
- RADIANS: () => Vu,
3556
- RAND: () => Lu,
3557
- RANDARRAY: () => Pu,
3558
- RANDBETWEEN: () => Uu,
3559
- ROMAN: () => _u,
3560
- ROUND: () => Fu,
3561
- ROUNDDOWN: () => Xu,
3562
- ROUNDUP: () => Gu,
3563
- SEQUENCE: () => Hu,
3564
- SERIESSUM: () => ku,
3565
- SIGN: () => Yu,
3566
- SQRT: () => Wu,
3567
- SQRTPI: () => Ku,
3568
- SUBTOTAL: () => ju,
3569
- SUM: () => qu,
3570
- SUMIF: () => Qu,
3571
- SUMIFS: () => zu,
3572
- SUMPRODUCT: () => $u,
3573
- SUMSQ: () => Zu,
3574
- SUMX2MY2: () => Ju,
3575
- SUMX2PY2: () => no,
3576
- SUMXMY2: () => to,
3577
- 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
3578
3579
  });
3579
- function Qe(n) {
3580
+ function $e(n) {
3580
3581
  return Math.abs(n);
3581
3582
  }
3582
- function ze(e, u, o, ...a) {
3583
+ function Ze(e, u, o, ...a) {
3583
3584
  const i = Math.trunc(e), s = Math.trunc(u);
3584
3585
  if (i < 1 || i > 19) return t.BuiltIn.Value;
3585
3586
  if (s < 0 || s > 7) return t.BuiltIn.Value;
@@ -3592,39 +3593,39 @@ function ze(e, u, o, ...a) {
3592
3593
  const g = 2 === s || 3 === s || 6 === s || 7 === s;
3593
3594
  let I = (1 === s || 3 === s || 5 === s || 7 === s ? m.map((t) => n.filterHidden(t)) : m).map((t) => n.filterTotals(t));
3594
3595
  g ? I = I.map((n) => n.filter((n) => !t.isError(n))) : 2 !== i && 3 !== i && I.forEach(f);
3595
- 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();
3596
3597
  switch (i) {
3597
3598
  case 1: {
3598
- const n = h.numericalCount ?? 0;
3599
+ const n = N.numericalCount ?? 0;
3599
3600
  if (0 === n) throw t.BuiltIn.Div0;
3600
- return N.getStats().getSnappedSum() / n;
3601
+ return h.getStats().getSnappedSum() / n;
3601
3602
  }
3602
- case 2: return h.numericalCount ?? 0;
3603
- case 3: return N.getStats().getCount();
3604
- case 4: return h.max ?? 0;
3605
- 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;
3606
3607
  case 6: {
3607
3608
  let n = 1, t = !1;
3608
- return N.forEach((r) => {
3609
+ return h.forEach((r) => {
3609
3610
  "number" == typeof r && (n *= r, t = !0);
3610
3611
  }), t ? n : 0;
3611
3612
  }
3612
3613
  case 7:
3613
- if ((h.numericalCount ?? 0) < 2) throw t.BuiltIn.Div0;
3614
- return h.stdDev;
3614
+ if ((N.numericalCount ?? 0) < 2) throw t.BuiltIn.Div0;
3615
+ return N.stdDev;
3615
3616
  case 8:
3616
- if ((h.numericalCount ?? 0) < 1) throw t.BuiltIn.Div0;
3617
- return h.stdDevP;
3618
- 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();
3619
3620
  case 10:
3620
- if ((h.numericalCount ?? 0) < 2) throw t.BuiltIn.Div0;
3621
- return h.var;
3621
+ if ((N.numericalCount ?? 0) < 2) throw t.BuiltIn.Div0;
3622
+ return N.var;
3622
3623
  case 11:
3623
- if ((h.numericalCount ?? 0) < 1) throw t.BuiltIn.Div0;
3624
- return h.varP;
3624
+ if ((N.numericalCount ?? 0) < 1) throw t.BuiltIn.Div0;
3625
+ return N.varP;
3625
3626
  case 12: return b().getPercentile(.5) ?? 0;
3626
3627
  case 13: {
3627
- const n = N.getStats().getFrequencies({ filterFn: (n) => "number" == typeof n }).getValueCounts({
3628
+ const n = h.getStats().getFrequencies({ filterFn: (n) => "number" == typeof n }).getValueCounts({
3628
3629
  sortBy: "frequency",
3629
3630
  descending: !0
3630
3631
  }).next();
@@ -3639,7 +3640,7 @@ function ze(e, u, o, ...a) {
3639
3640
  default: return t.BuiltIn.Value;
3640
3641
  }
3641
3642
  }
3642
- function $e(n) {
3643
+ function Je(n) {
3643
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.");
3644
3645
  let r = 0;
3645
3646
  return n.replace(/[MDLV]|C[MD]?|X[CL]?|I[XV]?/g, (n) => {
@@ -3660,59 +3661,59 @@ function $e(n) {
3660
3661
  }[n];
3661
3662
  }), r;
3662
3663
  }
3663
- function Ze(n, t, r = 0) {
3664
+ function nu(n, t, r = 0) {
3664
3665
  if (n = Math.trunc(n), t = Math.trunc(t), r = Math.trunc(r), n < 0 || n >= 2 ** 53) return NaN;
3665
3666
  if (t < 2 || t > 36) return NaN;
3666
3667
  if (r < 0) return NaN;
3667
3668
  const e = n.toString(t).toUpperCase();
3668
3669
  return new Array(Math.max(r + 1 - e.length, 0)).join("0") + e;
3669
3670
  }
3670
- function Je(n, t) {
3671
+ function tu(n, t) {
3671
3672
  if (0 === t) return 0;
3672
3673
  if (n > 0 && t < 0) return NaN;
3673
3674
  if (n / t % 1 == 0) return n;
3674
3675
  const r = Math.abs(t), e = Math.floor(Math.abs(n) / r);
3675
3676
  return n < 0 ? t < 0 ? -r * (e + 1) : -r * e : (e + 1) * r;
3676
3677
  }
3677
- function nu(n, t, r = 0) {
3678
+ function ru(n, t, r = 0) {
3678
3679
  if (0 === (t = Math.abs(t ?? 1))) return 0;
3679
- if (n >= 0) return Je(n, t);
3680
+ if (n >= 0) return tu(n, t);
3680
3681
  const e = r ? t : 0;
3681
- return Je(n, t) - e;
3682
- }
3683
- function tu(n, t = 1) {
3684
- return 0 === t ? 0 : Je(n, Math.abs(t));
3682
+ return tu(n, t) - e;
3685
3683
  }
3686
- function ru(n, t) {
3687
- return Je(n, t);
3688
- }
3689
- function eu(n, t) {
3690
- 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));
3691
3686
  }
3692
3687
  function uu(n, t) {
3693
- 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);
3694
3689
  }
3695
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) {
3696
3697
  if ((t = Math.trunc(t)) < 2 || t > 36) return NaN;
3697
3698
  const r = "0123456789abcdefghijklmnopqrstuvwxyz".slice(0, t);
3698
3699
  return new RegExp(`^[${r}]+$`, "i").test(n) ? parseInt(n, t) : NaN;
3699
3700
  }
3700
- function au(n) {
3701
+ function su(n) {
3701
3702
  return n * (180 / Math.PI);
3702
3703
  }
3703
- function iu(n) {
3704
- return Je(n, n < 0 ? -2 : 2);
3704
+ function lu(n) {
3705
+ return tu(n, n < 0 ? -2 : 2);
3705
3706
  }
3706
- function su(n) {
3707
+ function cu(n) {
3707
3708
  return Math.exp(n);
3708
3709
  }
3709
- function lu(n) {
3710
- 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);
3711
3712
  }
3712
- function cu(n) {
3713
- 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);
3714
3715
  }
3715
- function fu(n, r) {
3716
+ function pu(n, r) {
3716
3717
  if (0 === n) return 0;
3717
3718
  if (0 === r) throw t.BuiltIn.Div0;
3718
3719
  if (r = r ?? (n > 0 ? 1 : -1), n > 0 && r < 0) return NaN;
@@ -3720,56 +3721,60 @@ function fu(n, r) {
3720
3721
  const e = Math.abs(r), u = Math.floor(Math.abs(n) / e);
3721
3722
  return n < 0 ? r < 0 ? -e * u : -e * (u + 1) : u * e;
3722
3723
  }
3723
- function mu(n, t = n > 0 ? 1 : -1, r = 0) {
3724
- return 0 === t ? 0 : 0 === r || n >= 0 ? fu(n, Math.abs(t)) : fu(n, t) + t;
3725
- }
3726
- function pu(n, t = 1) {
3727
- return 0 === t ? 0 : fu(n, Math.abs(t));
3728
- }
3729
- function gu(t) {
3730
- let r, e = n.parseAsNumber(t[0]);
3731
- if (e < 0 || e > mo) return NaN;
3732
- e = Math.abs(Math.trunc(e));
3733
- const u = t.length;
3734
- for (let o = 1; o < u; o++) {
3735
- if (r = n.parseAsNumber(t[o]), r < 0 || r > mo) return NaN;
3736
- for (r = Math.abs(Math.trunc(r)); e && r;) e > r ? e %= r : r %= e;
3737
- 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;
3738
3740
  }
3739
- return e;
3741
+ return r;
3740
3742
  }
3741
- function Iu(n) {
3743
+ function Nu(n) {
3742
3744
  return Math.floor(n);
3743
3745
  }
3744
- function Nu(n, t) {
3745
- return tu(n, t);
3746
+ function bu(n, t) {
3747
+ return eu(n, t);
3746
3748
  }
3747
- function hu(t) {
3748
- let r, e, u, o = n.parseAsNumber(t[0]);
3749
- if (o < 0 || o > mo) return NaN;
3750
- o = Math.abs(Math.trunc(o));
3751
- const a = t.length;
3752
- for (let i = 1; i < a; i++) {
3753
- const a = n.parseAsNumber(t[i]);
3754
- if (a < 0 || a > mo) return NaN;
3755
- for (r = Math.abs(Math.trunc(a)), e = o, u = r; e && u;) e > u ? e %= u : u %= e;
3756
- 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;
3757
3762
  }
3758
- return o;
3763
+ return u;
3759
3764
  }
3760
- function bu(n) {
3765
+ function Au(n) {
3761
3766
  return n <= 0 ? NaN : Math.log(n);
3762
3767
  }
3763
- function Eu(n, r) {
3768
+ function Mu(n, r) {
3764
3769
  if (n <= 0) return NaN;
3765
3770
  if (void 0 === r) return Math.log10(n);
3766
3771
  if (1 === r) throw t.BuiltIn.Div0;
3767
3772
  return Math.log(n) / Math.log(r);
3768
3773
  }
3769
- function Au(n) {
3774
+ function du(n) {
3770
3775
  return n <= 0 ? NaN : Math.log10(n);
3771
3776
  }
3772
- function Mu(n) {
3777
+ function Su(n) {
3773
3778
  const { rows: r, columns: e } = n.getShape();
3774
3779
  if (r !== e) return t.BuiltIn.Value;
3775
3780
  const u = n.getValues();
@@ -3789,7 +3794,7 @@ function Mu(n) {
3789
3794
  for (let n = 0; n < r; n++) i *= o[n][n];
3790
3795
  return i;
3791
3796
  }
3792
- function du(n) {
3797
+ function Tu(n) {
3793
3798
  const { rows: r, columns: e } = n.getShape();
3794
3799
  if (r !== e) return t.BuiltIn.Value;
3795
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)]);
@@ -3807,7 +3812,7 @@ function du(n) {
3807
3812
  }
3808
3813
  return u.map((n) => n.slice(r));
3809
3814
  }
3810
- function Su(n, r) {
3815
+ function Ru(n, r) {
3811
3816
  const { rows: e, columns: u } = n.getShape(), { rows: o, columns: a } = r.getShape();
3812
3817
  if (u !== o) return t.BuiltIn.Value;
3813
3818
  const i = n.getValues(), s = r.getValues(), l = new Array(e);
@@ -3824,61 +3829,62 @@ function Su(n, r) {
3824
3829
  }
3825
3830
  return l;
3826
3831
  }
3827
- function Tu(n, r) {
3832
+ function Cu(n, r) {
3828
3833
  if (0 === r) throw t.BuiltIn.Div0;
3829
- return n - r * Iu(n / r);
3834
+ return n - r * Nu(n / r);
3830
3835
  }
3831
- function Ru(n, t) {
3836
+ function wu(n, t) {
3832
3837
  return 0 === t ? 0 : n > 0 && t < 0 || n < 0 && t > 0 ? NaN : n / t % 1 == 0 ? n : Math.round(n / t) * t;
3833
3838
  }
3834
- function Cu(n) {
3839
+ function vu(n) {
3840
+ mo(n);
3835
3841
  let t = 0, r = 1;
3836
3842
  const e = n.length;
3837
3843
  for (let u = 0; u < e; u++) {
3838
3844
  const e = n[u];
3839
3845
  if (e < 0) return NaN;
3840
- t += e, r *= ao(e);
3846
+ t += e, r *= so(e);
3841
3847
  }
3842
- return ao(t) / r;
3848
+ return so(t) / r;
3843
3849
  }
3844
- function vu(r) {
3850
+ function Bu(r) {
3845
3851
  if (r <= 0) return t.BuiltIn.Value;
3846
3852
  const e = n.createRange().sparseBuilder();
3847
3853
  for (let n = 0; n < r; n++) e.pushAt(n, n, 1);
3848
3854
  return e.build();
3849
3855
  }
3850
- function wu(n) {
3856
+ function Ou(n) {
3851
3857
  if (0 === n) return 1;
3852
3858
  let t = Math.ceil(Math.abs(n));
3853
3859
  return t = 1 & t ? t : t + 1, n > 0 ? t : -t;
3854
3860
  }
3855
- function Bu(n, r) {
3861
+ function Du(n, r) {
3856
3862
  const e = n.getStats().getSnappedSum(), u = r.getStats().getSnappedSum();
3857
3863
  if (0 === u) throw t.BuiltIn.Div0;
3858
3864
  return e / u;
3859
3865
  }
3860
- function Ou() {
3866
+ function yu() {
3861
3867
  return Math.PI;
3862
3868
  }
3863
- function Du(n, t) {
3869
+ function xu(n, t) {
3864
3870
  return 0 === n && 0 === t ? NaN : n ** t;
3865
3871
  }
3866
- function yu(n) {
3872
+ function Vu(n) {
3867
3873
  let t = 1;
3868
3874
  for (const r of n) for (const n of r.values()) t *= n;
3869
3875
  return t;
3870
3876
  }
3871
- function xu(n, r) {
3877
+ function Lu(n, r) {
3872
3878
  if (0 === r) throw t.BuiltIn.Div0;
3873
3879
  return Math.trunc(n / r);
3874
3880
  }
3875
- function Vu(n) {
3881
+ function Pu(n) {
3876
3882
  return n / 180 * Math.PI;
3877
3883
  }
3878
- function Lu() {
3884
+ function Uu() {
3879
3885
  return n.markVolatile(), Math.random();
3880
3886
  }
3881
- 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) {
3882
3888
  if (0 === r || 0 === e) return t.BuiltIn.Calc;
3883
3889
  if (r < 0 || e < 0) return t.BuiltIn.Value;
3884
3890
  if (u > o) return t.BuiltIn.NA;
@@ -3888,11 +3894,11 @@ function Pu(r = 1, e = 1, u = 0, o = 1, a = !1) {
3888
3894
  return a && (n = Math.floor(u + Math.random() * (o - u + 1)), n > o && (n = o)), n;
3889
3895
  }));
3890
3896
  }
3891
- function Uu(t, r) {
3897
+ function Fu(t, r) {
3892
3898
  const e = n.parseAsNumber(t), u = n.parseAsNumber(r);
3893
3899
  return e > u ? NaN : (n.markVolatile(), Math.floor(Math.random() * (u - e + 1) + e));
3894
3900
  }
3895
- function _u(n, r = 0) {
3901
+ function Xu(n, r = 0) {
3896
3902
  if ((n = Math.trunc(n)) < 0 || n > 3999) return t.BuiltIn.Value;
3897
3903
  if (0 === n) return "";
3898
3904
  if (0 !== r) return t.BuiltIn.Value;
@@ -3932,11 +3938,11 @@ function _u(n, r = 0) {
3932
3938
  for (; a--;) o = (u[Number(e.pop()) + 10 * a] || "") + o;
3933
3939
  return new Array(+e.join("") + 1).join("M") + o;
3934
3940
  }
3935
- function Fu(n, t) {
3941
+ function Gu(n, t) {
3936
3942
  const r = Math.pow(10, Math.abs(t)), e = n > 0 ? 1 : -1;
3937
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;
3938
3944
  }
3939
- function Xu(n, t) {
3945
+ function Hu(n, t) {
3940
3946
  const r = Math.pow(10, Math.abs(t)), e = n > 0 ? 1 : -1;
3941
3947
  if (t > 0) {
3942
3948
  const t = 1 / r * .5;
@@ -3948,11 +3954,11 @@ function Xu(n, t) {
3948
3954
  return e * Math.round((Math.abs(n) - t) / r) * r;
3949
3955
  }
3950
3956
  }
3951
- function Gu(n, t) {
3957
+ function ku(n, t) {
3952
3958
  const r = Math.abs(n), e = n >= 0 ? 1 : -1, u = Math.pow(10, Math.abs(t));
3953
3959
  return t > 0 ? e * Math.ceil(r * u) / u : 0 === t ? e * Math.ceil(r) : e * Math.ceil(r / u) * u;
3954
3960
  }
3955
- function Hu(r, e = 1, u = 1, o = 1) {
3961
+ function Yu(r, e = 1, u = 1, o = 1) {
3956
3962
  if (r ??= 1, 0 === r || 0 === e) return t.BuiltIn.Calc;
3957
3963
  if (r < 0 || e < 0) return t.BuiltIn.Value;
3958
3964
  const a = n.getEntireCoords();
@@ -3963,27 +3969,31 @@ function Hu(r, e = 1, u = 1, o = 1) {
3963
3969
  return i += o, n;
3964
3970
  });
3965
3971
  }
3966
- function ku(n, r, e, o) {
3967
- let a, i = 0;
3968
- for (const s of o.values({
3969
- coerce: (n, r, e) => o.isLiteral() ? r === u.Number ? e(n, r) : t.BuiltIn.Value : e(n, r),
3970
- includeEmpty: !0
3971
- })) {
3972
- if ("number" != typeof s) throw t.BuiltIn.Value;
3973
- 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);
3974
3977
  }
3975
- 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;
3976
3986
  }
3977
- function Yu(n) {
3987
+ function Ku(n) {
3978
3988
  return n > 0 ? 1 : 0 === n ? 0 : -1;
3979
3989
  }
3980
- function Wu(n) {
3990
+ function ju(n) {
3981
3991
  return Math.sqrt(n);
3982
3992
  }
3983
- function Ku(n) {
3993
+ function qu(n) {
3984
3994
  return n < 0 ? NaN : Math.sqrt(n * Math.PI);
3985
3995
  }
3986
- function ju(e, u) {
3996
+ function zu(e, u) {
3987
3997
  const o = Math.trunc(e), a = o >= 101, i = a ? o - 100 : o;
3988
3998
  let s = (a ? u.map((t) => n.filterHidden(t)) : u).map((t) => n.filterTotals(t));
3989
3999
  2 !== i && 3 !== i && s.forEach(f);
@@ -4020,7 +4030,7 @@ function ju(e, u) {
4020
4030
  default: return t.BuiltIn.Value;
4021
4031
  }
4022
4032
  }
4023
- function qu(n) {
4033
+ function Qu(n) {
4024
4034
  let t = 0, r = null;
4025
4035
  for (const e of n) {
4026
4036
  const n = e.getStats(), u = n.getAggregates();
@@ -4028,13 +4038,13 @@ function qu(n) {
4028
4038
  }
4029
4039
  return r ? r.getSnappedSum(t) : t;
4030
4040
  }
4031
- function Qu(n, t, r) {
4041
+ function $u(n, t, r) {
4032
4042
  return br(n, t, r, m((n, t) => (null === n && (n = 0), "number" != typeof t ? n : n + t)), Ar);
4033
4043
  }
4034
- function zu(t, r) {
4035
- 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);
4036
4046
  }
4037
- function $u(n) {
4047
+ function Ju(n) {
4038
4048
  const r = n[0], e = n.slice(1), u = r.getRowCount(), o = r.getColumnCount(), a = e.length;
4039
4049
  for (let n = 0; n < a; n++) if (e[n].getRowCount() !== u || e[n].getColumnCount() !== o) throw t.BuiltIn.Value;
4040
4050
  if (1 === u && 1 === o) {
@@ -4046,28 +4056,28 @@ function $u(n) {
4046
4056
  for (const t of r.values()) "number" == typeof t && (n += t);
4047
4057
  return n;
4048
4058
  }
4049
- return lo(r, e, so);
4059
+ return fo(r, e, co);
4050
4060
  }
4051
- function Zu(n) {
4061
+ function no(n) {
4052
4062
  let t = 0;
4053
4063
  for (const r of n) for (const n of r.values()) t += n ** 2;
4054
4064
  return t;
4055
4065
  }
4056
- function Ju(n, t) {
4057
- 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);
4058
4068
  }
4059
- function no(n, t) {
4060
- 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);
4061
4071
  }
4062
- function to(n, t) {
4063
- return co(n, t, (n, t) => (n - t) ** 2);
4072
+ function eo(n, t) {
4073
+ return po(n, t, (n, t) => (n - t) ** 2);
4064
4074
  }
4065
- function ro(n, t = 0) {
4075
+ function uo(n, t = 0) {
4066
4076
  if (0 === t) return Math.trunc(n);
4067
4077
  const r = Math.pow(10, t);
4068
4078
  return Math.trunc(n * r) / r;
4069
4079
  }
4070
- var eo = [
4080
+ var oo = [
4071
4081
  1,
4072
4082
  1,
4073
4083
  2,
@@ -4169,221 +4179,224 @@ var eo = [
4169
4179
  9426890448883248e138,
4170
4180
  9332621544394415e140,
4171
4181
  9332621544394415e142
4172
- ], uo = [], oo = [];
4173
- function ao(n) {
4174
- 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;
4175
4185
  }
4176
- function io(n) {
4177
- 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;
4178
4188
  }
4179
- var so = (n) => {
4189
+ var co = (n) => {
4180
4190
  let t = 1;
4181
4191
  const r = n.length;
4182
4192
  for (let e = 0; e < r; e++) t *= n[e];
4183
4193
  return t;
4184
- }, lo = (n, t, r) => n.alignReduce(t, (n, t) => {
4194
+ }, fo = (n, t, r) => n.alignReduce(t, (n, t) => {
4185
4195
  const e = t.length;
4186
4196
  for (let r = 0; r < e; r++) if ("number" != typeof t[r]) return n;
4187
4197
  return n + r(t);
4188
- }, 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) => {
4189
4202
  const u = n.getRowCount(), o = n.getColumnCount();
4190
4203
  if (u * o !== r.getRowCount() * r.getColumnCount()) throw t.BuiltIn.NA;
4191
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;
4192
- for (const r of n.values(fo)) if (t.isError(r)) throw r;
4193
- 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;
4194
4207
  let a = 0;
4195
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);
4196
4209
  if (0 === a) throw t.BuiltIn.Div0;
4197
4210
  return i;
4198
- }, fo = { axis: r.Axis.Row }, mo = 9007199254740992, po = c({
4199
- ACOS: () => go,
4200
- ACOSH: () => Io,
4201
- ACOT: () => No,
4202
- ACOTH: () => ho,
4203
- ASIN: () => bo,
4204
- ASINH: () => Eo,
4205
- ATAN: () => Ao,
4206
- ATAN2: () => Mo,
4207
- ATANH: () => So,
4208
- COS: () => To,
4209
- COSH: () => Ro,
4210
- COT: () => Co,
4211
- COTH: () => vo,
4212
- CSC: () => wo,
4213
- CSCH: () => Bo,
4214
- SEC: () => Oo,
4215
- SECH: () => Do,
4216
- SIN: () => yo,
4217
- SINH: () => xo,
4218
- TAN: () => Vo,
4219
- 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
4220
4233
  });
4221
- function go(n) {
4234
+ function No(n) {
4222
4235
  return n > 1 || n < -1 ? NaN : Math.acos(n);
4223
4236
  }
4224
- function Io(n) {
4237
+ function bo(n) {
4225
4238
  return n < 1 ? NaN : Math.acosh(n);
4226
4239
  }
4227
- function No(n) {
4240
+ function Eo(n) {
4228
4241
  return Math.PI / 2 - Math.atan(n);
4229
4242
  }
4230
- function ho(n) {
4243
+ function Ao(n) {
4231
4244
  return Math.abs(n) <= 1 ? NaN : Math.atanh(1 / n);
4232
4245
  }
4233
- function bo(n) {
4246
+ function Mo(n) {
4234
4247
  return n > 1 || n < -1 ? NaN : Math.asin(n);
4235
4248
  }
4236
- function Eo(n) {
4249
+ function So(n) {
4237
4250
  return Math.asinh(n);
4238
4251
  }
4239
- function Ao(n) {
4252
+ function To(n) {
4240
4253
  return Math.atan(n);
4241
4254
  }
4242
- function Mo(n, r) {
4255
+ function Ro(n, r) {
4243
4256
  if (0 === r && 0 === n) throw t.BuiltIn.Div0;
4244
4257
  return Math.atan2(r, n);
4245
4258
  }
4246
- function So(n) {
4259
+ function Co(n) {
4247
4260
  return Math.abs(n) > 1 ? NaN : Math.atanh(n);
4248
4261
  }
4249
- function To(n) {
4250
- return Math.abs(n) >= Po ? NaN : Math.cos(n);
4262
+ function wo(n) {
4263
+ return Math.abs(n) >= Fo ? NaN : Math.cos(n);
4251
4264
  }
4252
- function Ro(n) {
4265
+ function vo(n) {
4253
4266
  return Math.cosh(n);
4254
4267
  }
4255
- function Co(n) {
4256
- if (Math.abs(n) >= Po) return NaN;
4268
+ function Bo(n) {
4269
+ if (Math.abs(n) >= Fo) return NaN;
4257
4270
  if (0 === n) throw t.BuiltIn.Div0;
4258
4271
  return 1 / Math.tan(n);
4259
4272
  }
4260
- function vo(n) {
4273
+ function Oo(n) {
4261
4274
  if (0 === n) throw t.BuiltIn.Div0;
4262
4275
  return 1 / Math.tanh(n);
4263
4276
  }
4264
- function wo(n) {
4265
- if (Math.abs(n) >= Po) return NaN;
4277
+ function Do(n) {
4278
+ if (Math.abs(n) >= Fo) return NaN;
4266
4279
  if (0 === n) throw t.BuiltIn.Div0;
4267
4280
  return 1 / Math.sin(n);
4268
4281
  }
4269
- function Bo(n) {
4282
+ function yo(n) {
4270
4283
  if (0 === n) throw t.BuiltIn.Div0;
4271
4284
  return 1 / Math.sinh(n);
4272
4285
  }
4273
- function Oo(n) {
4274
- 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);
4275
4288
  }
4276
- function Do(n) {
4289
+ function Vo(n) {
4277
4290
  return 1 / Math.cosh(n);
4278
4291
  }
4279
- function yo(n) {
4280
- return Math.abs(n) >= Po ? NaN : Math.sin(n);
4292
+ function Lo(n) {
4293
+ return Math.abs(n) >= Fo ? NaN : Math.sin(n);
4281
4294
  }
4282
- function xo(n) {
4295
+ function Po(n) {
4283
4296
  return Math.sinh(n);
4284
4297
  }
4285
- function Vo(n) {
4286
- return Math.abs(n) >= Po ? NaN : Math.tan(n);
4298
+ function Uo(n) {
4299
+ return Math.abs(n) >= Fo ? NaN : Math.tan(n);
4287
4300
  }
4288
- function Lo(n) {
4301
+ function _o(n) {
4289
4302
  return Math.tanh(n);
4290
4303
  }
4291
- var Po = 2 ** 27, Uo = c({
4292
- ADD: () => _o,
4293
- DIVIDE: () => Fo,
4294
- EQ: () => Xo,
4295
- GT: () => Go,
4296
- GTE: () => Ho,
4297
- ISBETWEEN: () => Zo,
4298
- LT: () => ko,
4299
- LTE: () => Yo,
4300
- MINUS: () => Wo,
4301
- MULTIPLY: () => Ko,
4302
- NE: () => jo,
4303
- POW: () => qo,
4304
- UMINUS: () => Qo,
4305
- UNARY_PERCENT: () => zo,
4306
- 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
4307
4320
  });
4308
- function _o(n, t) {
4321
+ function Go(n, t) {
4309
4322
  return n + t;
4310
4323
  }
4311
- function Fo(n, r) {
4324
+ function Ho(n, r) {
4312
4325
  if (0 === r) throw t.BuiltIn.Div0;
4313
4326
  return n / r;
4314
4327
  }
4315
- function Xo(t, r) {
4328
+ function ko(t, r) {
4316
4329
  return 0 === n.compare(t, r);
4317
4330
  }
4318
- function Go(t, r) {
4331
+ function Yo(t, r) {
4319
4332
  return n.compare(t, r) > 0;
4320
4333
  }
4321
- function Ho(t, r) {
4334
+ function Wo(t, r) {
4322
4335
  return n.compare(t, r) >= 0;
4323
4336
  }
4324
- function ko(t, r) {
4337
+ function Ko(t, r) {
4325
4338
  return n.compare(t, r) < 0;
4326
4339
  }
4327
- function Yo(t, r) {
4340
+ function jo(t, r) {
4328
4341
  return n.compare(t, r) <= 0;
4329
4342
  }
4330
- function Wo(n, t) {
4343
+ function qo(n, t) {
4331
4344
  return n - t;
4332
4345
  }
4333
- function Ko(n, t) {
4346
+ function zo(n, t) {
4334
4347
  return n * t;
4335
4348
  }
4336
- function jo(t, r) {
4349
+ function Qo(t, r) {
4337
4350
  return 0 !== n.compare(t, r);
4338
4351
  }
4339
- function qo(n, r) {
4352
+ function $o(n, r) {
4340
4353
  if (0 === n) {
4341
4354
  if (r < 0) throw t.BuiltIn.Div0;
4342
4355
  if (0 === r) return NaN;
4343
4356
  }
4344
4357
  return n ** r;
4345
4358
  }
4346
- function Qo(n) {
4359
+ function Zo(n) {
4347
4360
  return -1 * n;
4348
4361
  }
4349
- function zo(n) {
4350
- return Fo(n, 100);
4362
+ function Jo(n) {
4363
+ return Ho(n, 100);
4351
4364
  }
4352
- function $o(n) {
4365
+ function na(n) {
4353
4366
  return n;
4354
4367
  }
4355
- function Zo(n, t, r, e = !0, u = !0) {
4368
+ function ta(n, t, r, e = !0, u = !0) {
4356
4369
  return (e ? n >= t : n > t) && (u ? n <= r : n < r);
4357
4370
  }
4358
- var Jo = c({
4359
- AVEDEV: () => na,
4360
- AVERAGE: () => ta,
4361
- AVERAGEA: () => ra,
4362
- AVERAGEIF: () => ea,
4363
- AVERAGEIFS: () => ua,
4364
- AVERAGE_WEIGHTED: () => oa,
4365
- COUNT: () => aa,
4366
- COUNTA: () => ia,
4367
- COUNTBLANK: () => sa,
4368
- COUNTIF: () => la,
4369
- COUNTIFS: () => ca,
4370
- COUNTUNIQUE: () => fa,
4371
- COUNTUNIQUEIFS: () => ma,
4372
- LARGE: () => pa,
4373
- MAX: () => ga,
4374
- MAXA: () => Ia,
4375
- MAXIF: () => Na,
4376
- MAXIFS: () => ha,
4377
- MEDIAN: () => ba,
4378
- MIN: () => Ea,
4379
- MINA: () => Aa,
4380
- MINIF: () => Ma,
4381
- MINIFS: () => da,
4382
- PERMUT: () => Sa,
4383
- PERMUTATIONA: () => Ta,
4384
- 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
4385
4398
  });
4386
- function na(n) {
4399
+ function ea(n) {
4387
4400
  let r = 0;
4388
4401
  const e = [];
4389
4402
  for (const t of n) for (const n of t.values()) r += n, e.push(n);
@@ -4394,21 +4407,21 @@ function na(n) {
4394
4407
  for (let n = 0; n < u; n++) r += Math.abs(e[n] - o);
4395
4408
  return r / u;
4396
4409
  }
4397
- function ta(n) {
4398
- return wa(n);
4410
+ function ua(n) {
4411
+ return Da(n);
4399
4412
  }
4400
- function ra(n) {
4401
- return wa(n, va);
4413
+ function oa(n) {
4414
+ return Da(n, Oa);
4402
4415
  }
4403
- function ea(n, r, e) {
4416
+ function aa(n, r, e) {
4404
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);
4405
4418
  return t.isError(o) ? o : u ? o / u : t.BuiltIn.Div0;
4406
4419
  }
4407
- function ua(r, e) {
4408
- 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);
4409
4422
  return t.isError(u) ? u : 0 === o || null === o ? t.BuiltIn.Div0 : u / o;
4410
4423
  }
4411
- function oa(n) {
4424
+ function sa(n) {
4412
4425
  let r = 0, e = 0;
4413
4426
  const u = n.length;
4414
4427
  for (let o = 0; o < u; o++) {
@@ -4424,31 +4437,31 @@ function oa(n) {
4424
4437
  if (0 === e) throw t.BuiltIn.Div0;
4425
4438
  return r / e;
4426
4439
  }
4427
- function aa(n) {
4440
+ function la(n) {
4428
4441
  let t = 0;
4429
4442
  for (const r of n) t += r.getStats().getAggregates().numericalCount ?? 0;
4430
4443
  return t;
4431
4444
  }
4432
- function ia(n) {
4445
+ function ca(n) {
4433
4446
  let t = 0;
4434
4447
  for (const r of n) t += r.getStats().getAggregates().count ?? 0;
4435
4448
  return t;
4436
4449
  }
4437
- function sa(n) {
4450
+ function fa(n) {
4438
4451
  return n.getColumnCount() * n.getRowCount() - (n.getStats().getAggregates().count ?? 0);
4439
4452
  }
4440
- function la(n, t) {
4453
+ function ma(n, t) {
4441
4454
  return br(n, t, void 0, (n) => null === n ? 1 : n + 1, Er);
4442
4455
  }
4443
- function ca(t) {
4444
- 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);
4445
4458
  }
4446
- function fa(n) {
4459
+ function ga(n) {
4447
4460
  const t = /* @__PURE__ */ new Set(), r = n.length;
4448
- 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));
4449
4462
  return t.size;
4450
4463
  }
4451
- function ma(r, e) {
4464
+ function Ia(r, e) {
4452
4465
  const u = r.getRowCount(), o = r.getColumnCount(), a = e.length, i = new Array(a), s = new Array(a);
4453
4466
  for (let r = 0; r < a; r++) {
4454
4467
  const a = e[r][0];
@@ -4460,30 +4473,30 @@ function ma(r, e) {
4460
4473
  const r = t[0];
4461
4474
  if (null === r) return n;
4462
4475
  for (let r = 0; r < a; r++) if (!s[r](t[r + 1])) return n;
4463
- return l.add(Ca(r)), n;
4476
+ return l.add(Ba(r)), n;
4464
4477
  }, null), l.size;
4465
4478
  }
4466
- function pa(n, t) {
4479
+ function ha(n, t) {
4467
4480
  const r = n.getStats().getSortedNumbers().getLarge(t);
4468
4481
  return null === r ? NaN : r;
4469
4482
  }
4470
- function ga(n) {
4483
+ function Na(n) {
4471
4484
  let t = Number.MIN_SAFE_INTEGER;
4472
4485
  for (const r of n) t = Math.max(r.getStats().getAggregates().max ?? 0, t);
4473
4486
  return t === Number.MIN_SAFE_INTEGER ? 0 : t;
4474
4487
  }
4475
- function Ia(n) {
4488
+ function ba(n) {
4476
4489
  let t = 0;
4477
- 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);
4478
4491
  return t;
4479
4492
  }
4480
- function Na(n, t, r) {
4493
+ function Ea(n, t, r) {
4481
4494
  return br(n, t, r, m((n, t) => "number" != typeof t ? n ?? 0 : null === n ? t : Math.max(n, t)), Ar);
4482
4495
  }
4483
- function ha(t, r) {
4484
- 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);
4485
4498
  }
4486
- function ba(n) {
4499
+ function Ma(n) {
4487
4500
  const t = [];
4488
4501
  for (const r of n) for (const n of r.values()) t.push(n);
4489
4502
  if (0 === t.length) return NaN;
@@ -4495,45 +4508,45 @@ function ba(n) {
4495
4508
  }
4496
4509
  return t[Math.floor(r / 2)];
4497
4510
  }
4498
- function Ea(n) {
4511
+ function da(n) {
4499
4512
  let t = Number.MAX_SAFE_INTEGER;
4500
4513
  for (const r of n) t = Math.min(r.getStats().getAggregates().min ?? 0, t);
4501
4514
  return t === Number.MAX_SAFE_INTEGER ? 0 : t;
4502
4515
  }
4503
- function Aa(n) {
4516
+ function Sa(n) {
4504
4517
  let t = Number.MAX_SAFE_INTEGER;
4505
- 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);
4506
4519
  return t === Number.MAX_SAFE_INTEGER ? 0 : t;
4507
4520
  }
4508
- function Ma(n, t, r) {
4521
+ function Ta(n, t, r) {
4509
4522
  return br(n, t, r, m((n, t) => "number" != typeof t ? n ?? 0 : null === n ? t : Math.min(n, t)), Ar);
4510
4523
  }
4511
- function da(t, r) {
4512
- 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);
4513
4526
  }
4514
- function Sa(n, t) {
4527
+ function Ca(n, t) {
4515
4528
  if (n = Math.trunc(n), t = Math.trunc(t), n < 0 || t < 0 || t > n) return NaN;
4516
4529
  let r = 1;
4517
4530
  for (let e = n; e > n - t; e--) r *= e;
4518
4531
  return r;
4519
4532
  }
4520
- function Ta(n, t) {
4533
+ function wa(n, t) {
4521
4534
  return n = Math.trunc(n), t = Math.trunc(t), n < 0 || t < 0 ? NaN : Math.pow(n, t);
4522
4535
  }
4523
- function Ra(n, t) {
4536
+ function va(n, t) {
4524
4537
  const r = n.getStats().getSortedNumbers().getSmall(t);
4525
4538
  return null === r ? NaN : r;
4526
4539
  }
4527
- var Ca = (n) => {
4540
+ var Ba = (n) => {
4528
4541
  if (null === n) return "\0";
4529
4542
  const r = typeof n;
4530
4543
  return "number" === r ? "" + n.toString() : "string" === r ? "" + n : "boolean" === r ? "" + (n ? "1" : "0") : t.isError(n) ? "" + n.getCode() : "" + String(n);
4531
- }, va = Object.freeze({ coerce: (n, r, e, o) => {
4544
+ }, Oa = Object.freeze({ coerce: (n, r, e, o) => {
4532
4545
  if (r === u.String) return 0;
4533
4546
  if (r === u.Boolean) return o.isLiteral() ? null : n ? 1 : 0;
4534
4547
  if (t.isError(n)) throw n;
4535
4548
  return null;
4536
- } }), wa = (n, r) => {
4549
+ } }), Da = (n, r) => {
4537
4550
  let e = 0, u = 0, o = null;
4538
4551
  for (const t of n) {
4539
4552
  const n = t.getStats(r), a = n.getAggregates();
@@ -4541,151 +4554,151 @@ var Ca = (n) => {
4541
4554
  }
4542
4555
  if (0 === u) throw t.BuiltIn.Div0;
4543
4556
  return (o ? o.getSnappedSum(e) : e) / u;
4544
- }, Ba = c({
4545
- BETADIST: () => Da,
4546
- BETAINV: () => xa,
4547
- BETA_DIST: () => Oa,
4548
- BETA_INV: () => ya,
4549
- BINOMDIST: () => La,
4550
- BINOM_DIST: () => Va,
4551
- BINOM_DIST_RANGE: () => Pa,
4552
- BINOM_INV: () => Ua,
4553
- CHIDIST: () => Fa,
4554
- CHIINV: () => Ha,
4555
- CHISQ_DIST: () => _a,
4556
- CHISQ_DIST_RT: () => Xa,
4557
- CHISQ_INV: () => Ga,
4558
- CHISQ_INV_RT: () => ka,
4559
- CHISQ_TEST: () => Ya,
4560
- CHITEST: () => Wa,
4561
- CONFIDENCE: () => ja,
4562
- CONFIDENCE_NORM: () => Ka,
4563
- CONFIDENCE_T: () => qa,
4564
- CORREL: () => Qa,
4565
- COVAR: () => za,
4566
- COVARIANCE_P: () => $a,
4567
- COVARIANCE_S: () => Za,
4568
- CRITBINOM: () => Ja,
4569
- DEVSQ: () => ni,
4570
- EXPONDIST: () => ri,
4571
- EXPON_DIST: () => ti,
4572
- FDIST: () => ui,
4573
- FINV: () => ii,
4574
- FISHER: () => fi,
4575
- FISHERINV: () => mi,
4576
- FORECAST: () => pi,
4577
- FORECAST_LINEAR: () => gi,
4578
- FREQUENCY: () => Ii,
4579
- FTEST: () => ci,
4580
- F_DIST: () => ei,
4581
- F_DIST_RT: () => oi,
4582
- F_INV: () => ai,
4583
- F_INV_RT: () => si,
4584
- F_TEST: () => li,
4585
- GAMMA: () => Ni,
4586
- GAMMADIST: () => bi,
4587
- GAMMAINV: () => Ai,
4588
- GAMMALN: () => Mi,
4589
- GAMMALN_PRECISE: () => di,
4590
- GAMMA_DIST: () => hi,
4591
- GAMMA_INV: () => Ei,
4592
- GAUSS: () => Si,
4593
- GEOMEAN: () => Ti,
4594
- HARMEAN: () => Ri,
4595
- HYPGEOMDIST: () => vi,
4596
- HYPGEOM_DIST: () => Ci,
4597
- INTERCEPT: () => wi,
4598
- KURT: () => Bi,
4599
- LOGINV: () => xi,
4600
- LOGNORMDIST: () => Di,
4601
- LOGNORM_DIST: () => Oi,
4602
- LOGNORM_INV: () => yi,
4603
- MODE: () => Vi,
4604
- MODE_MULT: () => Li,
4605
- MODE_SNGL: () => Pi,
4606
- NEGBINOMDIST: () => _i,
4607
- NEGBINOM_DIST: () => Ui,
4608
- NORMDIST: () => Xi,
4609
- NORMINV: () => Hi,
4610
- NORMSDIST: () => Yi,
4611
- NORMSINV: () => Ki,
4612
- NORM_DIST: () => Fi,
4613
- NORM_INV: () => Gi,
4614
- NORM_S_DIST: () => ki,
4615
- NORM_S_INV: () => Wi,
4616
- PEARSON: () => ji,
4617
- PERCENTILE: () => qi,
4618
- PERCENTILE_EXC: () => Qi,
4619
- PERCENTILE_INC: () => zi,
4620
- PERCENTRANK: () => $i,
4621
- PERCENTRANK_EXC: () => Zi,
4622
- PERCENTRANK_INC: () => Ji,
4623
- PHI: () => ns,
4624
- POISSON: () => rs,
4625
- POISSON_DIST: () => ts,
4626
- PROB: () => es,
4627
- QUARTILE: () => us,
4628
- QUARTILE_EXC: () => os,
4629
- QUARTILE_INC: () => as,
4630
- RANK: () => is,
4631
- RANK_AVG: () => ss,
4632
- RANK_EQ: () => ls,
4633
- RSQ: () => cs,
4634
- SKEW: () => fs,
4635
- SKEW_P: () => ms,
4636
- SLOPE: () => ps,
4637
- STANDARDIZE: () => gs,
4638
- STDEV: () => Ns,
4639
- STDEVA: () => Es,
4640
- STDEVP: () => bs,
4641
- STDEVPA: () => As,
4642
- STDEV_P: () => hs,
4643
- STDEV_S: () => Is,
4644
- STEYX: () => Ms,
4645
- TDIST: () => Ss,
4646
- TINV: () => vs,
4647
- TRIMMEAN: () => Bs,
4648
- T_DIST: () => ds,
4649
- T_DIST_2T: () => Ts,
4650
- T_DIST_RT: () => Rs,
4651
- T_INV: () => Cs,
4652
- T_INV_2T: () => ws,
4653
- VAR: () => Vs,
4654
- VARA: () => Ls,
4655
- VARP: () => ys,
4656
- VARPA: () => Ps,
4657
- VAR_P: () => Ds,
4658
- VAR_S: () => xs,
4659
- WEIBULL: () => _s,
4660
- WEIBULL_DIST: () => Us,
4661
- ZTEST: () => Xs,
4662
- 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
4663
4676
  });
4664
- function Oa(n, t, r, e, u = 0, o = 1) {
4677
+ function xa(n, t, r, e, u = 0, o = 1) {
4665
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));
4666
4679
  }
4667
- function Da(n, t, r, e = 0, u = 1) {
4668
- 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);
4669
4682
  }
4670
- function ya(n, t, r, e = 0, u = 1) {
4683
+ function La(n, t, r, e = 0, u = 1) {
4671
4684
  return t <= 0 || r <= 0 || n < 0 || n > 1 ? NaN : i.beta.inv(n, t, r) * (u - e) + e;
4672
4685
  }
4673
- function xa(n, t, r, e = 0, u = 1) {
4674
- 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);
4675
4688
  }
4676
- function Va(n, t, r, e) {
4689
+ function Ua(n, t, r, e) {
4677
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);
4678
4691
  }
4679
- function La(n, t, r, e) {
4680
- return Va(n, t, r, e);
4692
+ function _a(n, t, r, e) {
4693
+ return Ua(n, t, r, e);
4681
4694
  }
4682
- function Pa(n, t, r, e = r) {
4695
+ function Fa(n, t, r, e = r) {
4683
4696
  if (n < 0 || t < 0 || t > 1 || r < 0 || r > n || e < r || e > n) return NaN;
4684
4697
  let u = 0;
4685
- 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);
4686
4699
  return u;
4687
4700
  }
4688
- function Ua(n, t, r) {
4701
+ function Xa(n, t, r) {
4689
4702
  if (n < 0 || t < 0 || t > 1 || r <= 0 || r >= 1) return NaN;
4690
4703
  let e = 0;
4691
4704
  for (; e <= n;) {
@@ -4694,25 +4707,25 @@ function Ua(n, t, r) {
4694
4707
  }
4695
4708
  return NaN;
4696
4709
  }
4697
- function _a(n, t, r) {
4710
+ function Ga(n, t, r) {
4698
4711
  return n < 0 || t < 1 || t > 10 ** 10 ? NaN : r ? i.chisquare.cdf(n, t) : i.chisquare.pdf(n, t);
4699
4712
  }
4700
- function Fa(n, t) {
4701
- return Xa(n, t);
4713
+ function Ha(n, t) {
4714
+ return ka(n, t);
4702
4715
  }
4703
- function Xa(n, t) {
4716
+ function ka(n, t) {
4704
4717
  return t = Math.trunc(t), n < 0 || t < 1 || t > 10 ** 10 ? NaN : 1 - i.chisquare.cdf(n, t);
4705
4718
  }
4706
- function Ga(n, t) {
4719
+ function Ya(n, t) {
4707
4720
  return t = Math.trunc(t), n < 0 || n > 1 || t < 1 || t > 10 ** 10 ? NaN : i.chisquare.inv(n, t);
4708
4721
  }
4709
- function Ha(n, t) {
4710
- return ka(n, t);
4722
+ function Wa(n, t) {
4723
+ return Ka(n, t);
4711
4724
  }
4712
- function ka(n, t) {
4725
+ function Ka(n, t) {
4713
4726
  return t = Math.trunc(t), n < 0 || n > 1 || t < 1 || t > 10 ** 10 ? NaN : i.chisquare.inv(1 - n, t);
4714
4727
  }
4715
- function Ya(n, r) {
4728
+ function ja(n, r) {
4716
4729
  const e = n.getRowCount(), u = n.getColumnCount();
4717
4730
  if (e * u !== r.getRowCount() * r.getColumnCount()) throw t.BuiltIn.NA;
4718
4731
  if (f(n), f(r), 1 === e && 1 === u) throw t.BuiltIn.NA;
@@ -4726,38 +4739,38 @@ function Ya(n, r) {
4726
4739
  a += (n - r) ** 2 / r;
4727
4740
  }
4728
4741
  }
4729
- return Xa(a, o);
4742
+ return ka(a, o);
4730
4743
  }
4731
- function Wa(n, t) {
4732
- return Ya(n, t);
4744
+ function qa(n, t) {
4745
+ return ja(n, t);
4733
4746
  }
4734
- function Ka(n, t, r) {
4747
+ function za(n, t, r) {
4735
4748
  return r = Math.trunc(r), n <= 0 || n >= 1 || t <= 0 || r < 1 ? NaN : i.normalci(1, n, t, r)[1] - 1;
4736
4749
  }
4737
- function ja(n, t, r) {
4738
- return Ka(n, t, r);
4750
+ function Qa(n, t, r) {
4751
+ return za(n, t, r);
4739
4752
  }
4740
- function qa(n, r, e) {
4753
+ function $a(n, r, e) {
4741
4754
  if (e = Math.trunc(e), n <= 0 || n >= 1 || r <= 0 || e < 1) return NaN;
4742
4755
  if (1 === e) throw t.BuiltIn.Div0;
4743
4756
  return i.tci(1, n, r, e)[1] - 1;
4744
4757
  }
4745
- function Qa(n, r) {
4746
- const e = Hs(n, r);
4758
+ function Za(n, r) {
4759
+ const e = Ws(n, r);
4747
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);
4748
4761
  }
4749
- function za(n, t) {
4750
- return $a(n, t);
4762
+ function Ja(n, t) {
4763
+ return ni(n, t);
4751
4764
  }
4752
- function $a(n, r) {
4753
- const e = Hs(n, r);
4765
+ function ni(n, r) {
4766
+ const e = Ws(n, r);
4754
4767
  return t.isError(e) ? e : null === e ? t.BuiltIn.NA : 0 === e.n ? t.BuiltIn.Div0 : e.ssXY / e.n;
4755
4768
  }
4756
- function Za(n, r) {
4757
- const e = Hs(n, r);
4769
+ function ti(n, r) {
4770
+ const e = Ws(n, r);
4758
4771
  return t.isError(e) ? e : null === e ? t.BuiltIn.NA : e.n <= 1 ? t.BuiltIn.Div0 : e.ssXY / (e.n - 1);
4759
4772
  }
4760
- function Ja(n, t, r) {
4773
+ function ri(n, t, r) {
4761
4774
  if ((n = Math.floor(n)) < 0) return NaN;
4762
4775
  if (t < 0 || t > 1) return NaN;
4763
4776
  if (r <= 0 || r >= 1) return NaN;
@@ -4768,7 +4781,7 @@ function Ja(n, t, r) {
4768
4781
  }
4769
4782
  return e;
4770
4783
  }
4771
- function ni(n) {
4784
+ function ei(n) {
4772
4785
  let t = 0, r = [];
4773
4786
  for (const e of n) for (const n of e.values()) t += n, r.push(n);
4774
4787
  const e = r.length, u = t / e;
@@ -4776,31 +4789,31 @@ function ni(n) {
4776
4789
  for (let n = 0; n < e; n++) t += (r[n] - u) ** 2;
4777
4790
  return t;
4778
4791
  }
4779
- function ti(n, t, r) {
4792
+ function ui(n, t, r) {
4780
4793
  return n < 0 || t <= 0 ? NaN : r ? i.exponential.cdf(n, t) : i.exponential.pdf(n, t);
4781
4794
  }
4782
- function ri(n, t, r) {
4783
- return ti(n, t, r);
4795
+ function oi(n, t, r) {
4796
+ return ui(n, t, r);
4784
4797
  }
4785
- function ei(n, t, r, e) {
4798
+ function ai(n, t, r, e) {
4786
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));
4787
4800
  }
4788
- function ui(n, t, r) {
4789
- return oi(n, t, r);
4801
+ function ii(n, t, r) {
4802
+ return si(n, t, r);
4790
4803
  }
4791
- function oi(n, t, r) {
4804
+ function si(n, t, r) {
4792
4805
  return n < 0 || t < 1 || r < 1 ? NaN : (t = Math.trunc(t), r = Math.trunc(r), 1 - i.centralF.cdf(n, t, r));
4793
4806
  }
4794
- function ai(n, t, r) {
4807
+ function li(n, t, r) {
4795
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));
4796
4809
  }
4797
- function ii(n, t, r) {
4798
- return si(n, t, r);
4810
+ function ci(n, t, r) {
4811
+ return fi(n, t, r);
4799
4812
  }
4800
- function si(n, t, r) {
4813
+ function fi(n, t, r) {
4801
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));
4802
4815
  }
4803
- function li(n, r) {
4816
+ function mi(n, r) {
4804
4817
  const e = [], u = [];
4805
4818
  for (const [t, o] of [[n, e], [r, u]]) t.forEach((n) => {
4806
4819
  "number" == typeof n && o.push(n);
@@ -4818,29 +4831,29 @@ function li(n, r) {
4818
4831
  const c = i.centralF.cdf(s / l, e.length - 1, u.length - 1);
4819
4832
  return 2 * Math.min(c, 1 - c);
4820
4833
  }
4821
- function ci(n, t) {
4822
- return li(n, t);
4834
+ function pi(n, t) {
4835
+ return mi(n, t);
4823
4836
  }
4824
- function fi(n) {
4837
+ function gi(n) {
4825
4838
  if (1 === n || -1 === n) throw t.BuiltIn.Div0;
4826
4839
  return Math.log((1 + n) / (1 - n)) / 2;
4827
4840
  }
4828
- function mi(n) {
4841
+ function Ii(n) {
4829
4842
  const t = Math.exp(2 * n);
4830
4843
  return (t - 1) / (t + 1);
4831
4844
  }
4832
- function pi(n, t, r) {
4833
- return gi(n, t, r);
4845
+ function hi(n, t, r) {
4846
+ return Ni(n, t, r);
4834
4847
  }
4835
- function gi(n, r, e) {
4836
- const u = Hs(r, e);
4848
+ function Ni(n, r, e) {
4849
+ const u = Ws(r, e);
4837
4850
  if (t.isError(u)) return u;
4838
4851
  if (null === u || 0 === u.n) return t.BuiltIn.NA;
4839
4852
  if (0 === u.ssX) return t.BuiltIn.Div0;
4840
4853
  const o = u.ssXY / u.ssX;
4841
4854
  return u.yMean - o * u.xMean + o * n;
4842
4855
  }
4843
- function Ii(n, t) {
4856
+ function bi(n, t) {
4844
4857
  const r = [];
4845
4858
  for (const n of t.values()) "number" == typeof n && r.push(n);
4846
4859
  const e = [];
@@ -4861,31 +4874,31 @@ function Ii(n, t) {
4861
4874
  for (let n = 0; n < e.length; n++) e[n] > a && i++;
4862
4875
  return o[r.length][0] = i, o;
4863
4876
  }
4864
- function Ni(n) {
4877
+ function Ei(n) {
4865
4878
  return 0 === n || n < 0 && n === Math.trunc(n) ? NaN : i.gammafn(n);
4866
4879
  }
4867
- function hi(n, t, r, e) {
4880
+ function Ai(n, t, r, e) {
4868
4881
  return n < 0 || t <= 0 || r <= 0 ? NaN : e ? i.gamma.cdf(n, t, r, !0) : i.gamma.pdf(n, t, r, !1);
4869
4882
  }
4870
- function bi(n, t, r, e) {
4871
- return hi(n, t, r, e);
4883
+ function Mi(n, t, r, e) {
4884
+ return Ai(n, t, r, e);
4872
4885
  }
4873
- function Ei(n, t, r) {
4886
+ function di(n, t, r) {
4874
4887
  return n < 0 || n > 1 || t <= 0 || r <= 0 ? NaN : i.gamma.inv(n, t, r);
4875
4888
  }
4876
- function Ai(n, t, r) {
4877
- return Ei(n, t, r);
4889
+ function Si(n, t, r) {
4890
+ return di(n, t, r);
4878
4891
  }
4879
- function Mi(n) {
4892
+ function Ti(n) {
4880
4893
  return n <= 0 ? NaN : i.gammaln(n);
4881
4894
  }
4882
- function di(n) {
4895
+ function Ri(n) {
4883
4896
  return n <= 0 ? NaN : i.gammaln(n);
4884
4897
  }
4885
- function Si(n) {
4898
+ function Ci(n) {
4886
4899
  return i.normal.cdf(n, 0, 1) - .5;
4887
4900
  }
4888
- function Ti(n) {
4901
+ function wi(n) {
4889
4902
  const t = [];
4890
4903
  for (const r of n) for (const n of r.values()) {
4891
4904
  if (n <= 0) return NaN;
@@ -4893,7 +4906,7 @@ function Ti(n) {
4893
4906
  }
4894
4907
  return i.geomean(t);
4895
4908
  }
4896
- function Ri(n) {
4909
+ function vi(n) {
4897
4910
  let t = 0, r = 0;
4898
4911
  for (const e of n) for (const n of e.values()) {
4899
4912
  if (n <= 0) return NaN;
@@ -4901,14 +4914,14 @@ function Ri(n) {
4901
4914
  }
4902
4915
  return t / r;
4903
4916
  }
4904
- function Ci(n, t, r, e, u) {
4917
+ function Bi(n, t, r, e, u) {
4905
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;
4906
4919
  if (t > e) return NaN;
4907
4920
  if (r > e) return NaN;
4908
4921
  if (t < n || r < n) return NaN;
4909
4922
  if (n < t - e + r) return NaN;
4910
4923
  function o(n, t, r, e) {
4911
- 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);
4912
4925
  }
4913
4926
  return u ? function(n, t, r, e) {
4914
4927
  let u = 0;
@@ -4916,18 +4929,18 @@ function Ci(n, t, r, e, u) {
4916
4929
  return u;
4917
4930
  }(n, t, r, e) : o(n, t, r, e);
4918
4931
  }
4919
- function vi(n, t, r, e) {
4920
- return Ci(n, t, r, e, !1);
4932
+ function Oi(n, t, r, e) {
4933
+ return Bi(n, t, r, e, !1);
4921
4934
  }
4922
- function wi(n, r) {
4923
- const e = Hs(n, r);
4935
+ function Di(n, r) {
4936
+ const e = Ws(n, r);
4924
4937
  if (t.isError(e)) return e;
4925
4938
  if (null === e) return t.BuiltIn.NA;
4926
4939
  if (0 === e.ssX) return t.BuiltIn.Div0;
4927
4940
  const u = e.ssXY / e.ssX;
4928
4941
  return e.yMean - u * e.xMean;
4929
4942
  }
4930
- function Bi(n) {
4943
+ function yi(n) {
4931
4944
  let r = 0;
4932
4945
  const e = [];
4933
4946
  for (const t of n) for (const n of t.values()) r += n, e.push(n);
@@ -4940,22 +4953,22 @@ function Bi(n) {
4940
4953
  if (0 === a) throw t.BuiltIn.Div0;
4941
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));
4942
4955
  }
4943
- function Oi(n, t, r, e) {
4956
+ function xi(n, t, r, e) {
4944
4957
  return n <= 0 || r <= 0 ? NaN : e ? i.lognormal.cdf(n, t, r) : i.lognormal.pdf(n, t, r);
4945
4958
  }
4946
- function Di(n, t, r) {
4947
- return Oi(n, t, r, !0);
4959
+ function Vi(n, t, r) {
4960
+ return xi(n, t, r, !0);
4948
4961
  }
4949
- function yi(n, t, r) {
4962
+ function Li(n, t, r) {
4950
4963
  return n <= 0 || n >= 1 || r <= 0 ? NaN : i.lognormal.inv(n, t, r);
4951
4964
  }
4952
- function xi(n, t, r) {
4953
- return yi(n, t, r);
4965
+ function Pi(n, t, r) {
4966
+ return Li(n, t, r);
4954
4967
  }
4955
- function Vi(n) {
4956
- return Pi(n);
4968
+ function Ui(n) {
4969
+ return Fi(n);
4957
4970
  }
4958
- function Li(n) {
4971
+ function _i(n) {
4959
4972
  const r = /* @__PURE__ */ new Map();
4960
4973
  let e = 0;
4961
4974
  for (const t of n) {
@@ -4978,7 +4991,7 @@ function Li(n) {
4978
4991
  const o = [...r.entries()].filter(([, { count: n }]) => n === u).sort((n, t) => n[1].firstSeen - t[1].firstSeen).map(([n]) => [n]);
4979
4992
  return 0 === o.length ? t.BuiltIn.NA : o;
4980
4993
  }
4981
- function Pi(n) {
4994
+ function Fi(n) {
4982
4995
  const r = /* @__PURE__ */ new Map();
4983
4996
  let e = 0;
4984
4997
  for (const t of n) {
@@ -5000,122 +5013,112 @@ function Pi(n) {
5000
5013
  for (const [n, { count: t, firstSeen: e }] of r) t < 2 || (t > o || t === o && e < a) && (u = n, o = t, a = e);
5001
5014
  return null === u ? t.BuiltIn.NA : u;
5002
5015
  }
5003
- function Ui(n, t, r, e) {
5016
+ function Xi(n, t, r, e) {
5004
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);
5005
5018
  }
5006
- function _i(n, t, r) {
5007
- return Ui(n, t, r, !1);
5019
+ function Gi(n, t, r) {
5020
+ return Xi(n, t, r, !1);
5008
5021
  }
5009
- function Fi(n, t, r, e) {
5022
+ function Hi(n, t, r, e) {
5010
5023
  return r <= 0 ? NaN : e ? i.normal.cdf(n, t, r) : i.normal.pdf(n, t, r);
5011
5024
  }
5012
- function Xi(n, t, r, e) {
5013
- return Fi(n, t, r, e);
5025
+ function ki(n, t, r, e) {
5026
+ return Hi(n, t, r, e);
5014
5027
  }
5015
- function Gi(n, t, r) {
5028
+ function Yi(n, t, r) {
5016
5029
  return n <= 0 || n >= 1 || r <= 0 ? NaN : i.normal.inv(n, t, r);
5017
5030
  }
5018
- function Hi(n, t, r) {
5019
- return Gi(n, t, r);
5031
+ function Wi(n, t, r) {
5032
+ return Yi(n, t, r);
5020
5033
  }
5021
- function ki(n, t) {
5034
+ function Ki(n, t) {
5022
5035
  return t ? i.normal.cdf(n, 0, 1) : i.normal.pdf(n, 0, 1);
5023
5036
  }
5024
- function Yi(n) {
5025
- return ki(n, !0);
5037
+ function ji(n) {
5038
+ return Ki(n, !0);
5026
5039
  }
5027
- function Wi(n) {
5040
+ function qi(n) {
5028
5041
  return n <= 0 || n >= 1 ? NaN : i.normal.inv(n, 0, 1);
5029
5042
  }
5030
- function Ki(n) {
5031
- return Wi(n);
5043
+ function zi(n) {
5044
+ return qi(n);
5032
5045
  }
5033
- function ji(n, t) {
5034
- return Qa(n, t);
5046
+ function Qi(n, t) {
5047
+ return Za(n, t);
5035
5048
  }
5036
- function qi(n, t) {
5037
- return zi(n, t);
5049
+ function $i(n, t) {
5050
+ return Ji(n, t);
5038
5051
  }
5039
- function Qi(n, t) {
5052
+ function Zi(n, t) {
5040
5053
  if (t <= 0 || t >= 1) return NaN;
5041
5054
  const r = n.getStats().getSortedNumbers().getPercentile(t, !0);
5042
5055
  return null === r ? NaN : r;
5043
5056
  }
5044
- function zi(n, t) {
5057
+ function Ji(n, t) {
5045
5058
  if (t < 0 || t > 1) return NaN;
5046
5059
  const r = n.getStats().getSortedNumbers().getPercentile(t, !1);
5047
5060
  return null === r ? NaN : r;
5048
5061
  }
5049
- function $i(n, t, r = 3) {
5050
- return Ji(n, t, r);
5062
+ function ns(n, t, r = 3) {
5063
+ return rs(n, t, r);
5051
5064
  }
5052
- function Zi(n, r, e = 3) {
5065
+ function ts(n, r, e = 3) {
5053
5066
  return n.getStats().getSortedNumbers().getPercentRankOf(r, !0, e) ?? t.BuiltIn.NA;
5054
5067
  }
5055
- function Ji(n, r, e = 3) {
5068
+ function rs(n, r, e = 3) {
5056
5069
  return n.getStats().getSortedNumbers().getPercentRankOf(r, !1, e) ?? t.BuiltIn.NA;
5057
5070
  }
5058
- function ns(n) {
5059
- return Math.exp(-.5 * n * n) / Gs;
5071
+ function es(n) {
5072
+ return Math.exp(-.5 * n * n) / Ys;
5060
5073
  }
5061
- function ts(n, t, r) {
5074
+ function us(n, t, r) {
5062
5075
  return n < 0 || t <= 0 ? NaN : (n = Math.trunc(n), r ? i.poisson.cdf(n, t) : i.poisson.pdf(n, t));
5063
5076
  }
5064
- function rs(n, t, r) {
5065
- return ts(n, t, r);
5077
+ function os(n, t, r) {
5078
+ return us(n, t, r);
5066
5079
  }
5067
- function es(n, r, e, u) {
5068
- const o = n.flatten({ includeEmpty: !0 }), a = r.flatten({ includeEmpty: !0 });
5069
- 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;
5070
5083
  f(n), f(r);
5071
- let i = 0;
5072
- for (const n of a) if (null !== n) {
5073
- if ("number" != typeof n) return t.BuiltIn.Num;
5074
- i += n;
5075
- }
5076
- if (1e10 !== Math.round(1e10 * i)) return t.BuiltIn.Num;
5077
- const s = u ?? e;
5078
- let l = 0;
5079
- for (let n = 0; n < o.length; n++) {
5080
- const r = o[n];
5081
- if ("number" != typeof r) return t.BuiltIn.Num;
5082
- r >= e && r <= s && (l += a[n] ?? 0);
5083
- }
5084
- 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;
5085
5088
  }
5086
- function us(n, t) {
5087
- return as(n, t);
5089
+ function is(n, t) {
5090
+ return ls(n, t);
5088
5091
  }
5089
- function os(n, t) {
5092
+ function ss(n, t) {
5090
5093
  if ((t = Math.trunc(t)) < 1 || t > 3) return NaN;
5091
5094
  const r = t / 4, e = n.getStats().getSortedNumbers().getPercentile(r, !0);
5092
5095
  return null === e ? NaN : e;
5093
5096
  }
5094
- function as(n, t) {
5097
+ function ls(n, t) {
5095
5098
  if ((t = Math.trunc(t)) < 0 || t > 4) return NaN;
5096
5099
  const r = t / 4, e = n.getStats().getSortedNumbers().getPercentile(r, !1);
5097
5100
  return null === e ? NaN : e;
5098
5101
  }
5099
- function is(n, t, r = 0) {
5100
- return ls(n, t, r);
5102
+ function cs(n, t, r = 0) {
5103
+ return ms(n, t, r);
5101
5104
  }
5102
- function ss(n, r, e = 0) {
5105
+ function fs(n, r, e = 0) {
5103
5106
  const u = r.getStats().getSortedNumbers().getRankOf(n, 0 === e, !0);
5104
5107
  return null === u ? t.BuiltIn.NA : u;
5105
5108
  }
5106
- function ls(n, r, e = 0) {
5109
+ function ms(n, r, e = 0) {
5107
5110
  const u = r.getStats().getSortedNumbers().getRankOf(n, 0 === e, !1);
5108
5111
  return null === u ? t.BuiltIn.NA : u;
5109
5112
  }
5110
- function cs(n, r) {
5111
- const e = Hs(n, r);
5113
+ function ps(n, r) {
5114
+ const e = Ws(n, r);
5112
5115
  if (t.isError(e)) return e;
5113
5116
  if (null === e) return t.BuiltIn.NA;
5114
5117
  if (0 === e.ssX || 0 === e.ssY) return t.BuiltIn.Div0;
5115
5118
  const u = e.ssXY / Math.sqrt(e.ssX * e.ssY);
5116
5119
  return u * u;
5117
5120
  }
5118
- function fs(n) {
5121
+ function gs(n) {
5119
5122
  let r = 0, e = 0;
5120
5123
  for (const t of n) t.forEach((n) => {
5121
5124
  "number" == typeof n && (e += n, r++);
@@ -5134,7 +5137,7 @@ function fs(n) {
5134
5137
  });
5135
5138
  return r / ((r - 1) * (r - 2)) * i;
5136
5139
  }
5137
- function ms(n) {
5140
+ function Is(n) {
5138
5141
  let r = 0, e = 0;
5139
5142
  for (const t of n) t.forEach((n) => {
5140
5143
  "number" == typeof n && (e += n, r++);
@@ -5153,66 +5156,66 @@ function ms(n) {
5153
5156
  });
5154
5157
  return i / r;
5155
5158
  }
5156
- function ps(n, r) {
5157
- const e = Hs(n, r);
5159
+ function hs(n, r) {
5160
+ const e = Ws(n, r);
5158
5161
  return t.isError(e) ? e : null === e ? t.BuiltIn.NA : 0 === e.ssX ? t.BuiltIn.Div0 : e.ssXY / e.ssX;
5159
5162
  }
5160
- function gs(n, t, r) {
5163
+ function Ns(n, t, r) {
5161
5164
  return r <= 0 ? NaN : (n - t) / r;
5162
5165
  }
5163
- function Is(n) {
5164
- const t = xs(n);
5166
+ function bs(n) {
5167
+ const t = Ps(n);
5165
5168
  return Math.sqrt(t);
5166
5169
  }
5167
- function Ns(n) {
5168
- return Is(n);
5170
+ function Es(n) {
5171
+ return bs(n);
5169
5172
  }
5170
- function hs(n) {
5171
- const t = Ds(n);
5173
+ function As(n) {
5174
+ const t = Vs(n);
5172
5175
  return Math.sqrt(t);
5173
5176
  }
5174
- function bs(n) {
5175
- return hs(n);
5177
+ function Ms(n) {
5178
+ return As(n);
5176
5179
  }
5177
- function Es(n) {
5178
- const t = Ls(n);
5180
+ function ds(n) {
5181
+ const t = _s(n);
5179
5182
  return Math.sqrt(t);
5180
5183
  }
5181
- function As(n) {
5182
- const t = Ps(n);
5184
+ function Ss(n) {
5185
+ const t = Fs(n);
5183
5186
  return Math.sqrt(t);
5184
5187
  }
5185
- function Ms(n, r) {
5186
- const e = Hs(n, r);
5188
+ function Ts(n, r) {
5189
+ const e = Ws(n, r);
5187
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));
5188
5191
  }
5189
- function ds(n, t, r) {
5192
+ function Rs(n, t, r) {
5190
5193
  return t < 1 ? NaN : r ? 0 === n ? .5 : i.studentt.cdf(n, t) : i.studentt.pdf(n, t);
5191
5194
  }
5192
- function Ss(n, t, r) {
5193
- 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);
5194
5197
  }
5195
- function Ts(n, t) {
5198
+ function ws(n, t) {
5196
5199
  return t < 1 || n < 0 ? NaN : 2 * (1 - i.studentt.cdf(n, t));
5197
5200
  }
5198
- function Rs(n, t) {
5201
+ function vs(n, t) {
5199
5202
  return t < 1 ? NaN : 0 === n ? .5 : 1 - i.studentt.cdf(n, t);
5200
5203
  }
5201
- function Cs(n, t) {
5204
+ function Bs(n, t) {
5202
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);
5203
5206
  }
5204
- function vs(n, t) {
5205
- return ws(n, t);
5207
+ function Os(n, t) {
5208
+ return Ds(n, t);
5206
5209
  }
5207
- function ws(n, t) {
5210
+ function Ds(n, t) {
5208
5211
  if (n <= 0 || t < 1) return NaN;
5209
5212
  const r = 1 - n / 2;
5210
5213
  return 1 === (t = Math.trunc(t)) ? Math.tan(Math.PI * (r - .5)) : i.studentt.inv(r, t);
5211
5214
  }
5212
- function Bs(n, r) {
5215
+ function ys(n, r) {
5213
5216
  if (r < 0 || r >= 1) return NaN;
5214
5217
  const e = [];
5215
- 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);
5216
5219
  const u = e.length, o = Math.floor(u * r / 2);
5217
5220
  let a = 0, i = 0;
5218
5221
  if (0 === o) {
@@ -5229,20 +5232,20 @@ function Bs(n, r) {
5229
5232
  if (0 === i) throw t.BuiltIn.Div0;
5230
5233
  return a / i;
5231
5234
  }
5232
- var Os = { axis: r.Axis.Row };
5233
- function Ds(n) {
5235
+ var xs = { axis: r.Axis.Row };
5236
+ function Vs(n) {
5234
5237
  let t = 0, r = 0;
5235
- const e = ta(n);
5238
+ const e = ua(n);
5236
5239
  for (const u of n) for (const n of u.values()) t += Math.pow(n - e, 2), r++;
5237
5240
  const u = t / r;
5238
5241
  return isNaN(u) ? NaN : u;
5239
5242
  }
5240
- function ys(n) {
5241
- return Ds(n);
5243
+ function Ls(n) {
5244
+ return Vs(n);
5242
5245
  }
5243
- function xs(n) {
5246
+ function Ps(n) {
5244
5247
  let r = 0, e = 0;
5245
- const o = ta(n);
5248
+ const o = ua(n);
5246
5249
  for (const t of n) for (const n of t.values({
5247
5250
  type: u.Number,
5248
5251
  onError: "value"
@@ -5250,47 +5253,47 @@ function xs(n) {
5250
5253
  if (e < 2) throw t.BuiltIn.Div0;
5251
5254
  return r / (e - 1);
5252
5255
  }
5253
- function Vs(n) {
5254
- return xs(n);
5256
+ function Us(n) {
5257
+ return Ps(n);
5255
5258
  }
5256
- function Ls(n) {
5259
+ function _s(n) {
5257
5260
  let r = 0, e = 0;
5258
- const u = ra(n);
5261
+ const u = oa(n);
5259
5262
  for (const t of n) for (const n of t.values({ type: null })) {
5260
- const t = ks(n);
5263
+ const t = Ks(n);
5261
5264
  null !== t && (r += Math.pow(t - u, 2), e++);
5262
5265
  }
5263
5266
  if (e < 2) throw t.BuiltIn.Div0;
5264
5267
  return r / (e - 1);
5265
5268
  }
5266
- function Ps(n) {
5267
- const t = ra(n);
5269
+ function Fs(n) {
5270
+ const t = oa(n);
5268
5271
  let r = 0, e = 0;
5269
5272
  for (const u of n) for (const n of u.values({ type: null })) {
5270
- const u = ks(n);
5273
+ const u = Ks(n);
5271
5274
  null !== u && (r += Math.pow(u - t, 2), e++);
5272
5275
  }
5273
5276
  return r / e;
5274
5277
  }
5275
- function Us(n, t, r, e) {
5278
+ function Xs(n, t, r, e) {
5276
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;
5277
5280
  }
5278
- function _s(n, t, r, e) {
5279
- return Us(n, t, r, e);
5281
+ function Gs(n, t, r, e) {
5282
+ return Xs(n, t, r, e);
5280
5283
  }
5281
- function Fs(n, r, e = 0) {
5284
+ function Hs(n, r, e = 0) {
5282
5285
  const u = n.size;
5283
5286
  if (!e) {
5284
5287
  if (u < 2) throw t.BuiltIn.Div0;
5285
- e = Is([n]);
5288
+ e = bs([n]);
5286
5289
  }
5287
- return 1 - ki((ta([n]) - r) / (e / Math.sqrt(u)), !0);
5290
+ return 1 - Ki((ua([n]) - r) / (e / Math.sqrt(u)), !0);
5288
5291
  }
5289
- function Xs(n, t, r = 0) {
5290
- return Fs(n, t, r);
5292
+ function ks(n, t, r = 0) {
5293
+ return Hs(n, t, r);
5291
5294
  }
5292
- var Gs = 2.5066282746310002;
5293
- function Hs(n, r) {
5295
+ var Ys = 2.5066282746310002;
5296
+ function Ws(n, r) {
5294
5297
  const e = n.getRowCount(), u = n.getColumnCount();
5295
5298
  if (e * u !== r.getRowCount() * r.getColumnCount()) return null;
5296
5299
  r.getRowCount() === e && r.getColumnCount() === u || (r = r.reshape(e, u));
@@ -5319,14 +5322,14 @@ function Hs(n, r) {
5319
5322
  ssXY: g
5320
5323
  };
5321
5324
  }
5322
- function ks(n) {
5325
+ function Ks(n) {
5323
5326
  return "number" == typeof n ? n : !0 === n ? 1 : !1 === n || "string" == typeof n ? 0 : null;
5324
5327
  }
5325
- var Ys = c({
5326
- DELAY: () => Ws,
5327
- WAIT: () => Qs
5328
+ var js = c({
5329
+ DELAY: () => qs,
5330
+ WAIT: () => Zs
5328
5331
  });
5329
- async function Ws(n, t, r = "No label") {
5332
+ async function qs(n, t, r = "No label") {
5330
5333
  return new Promise((r) => {
5331
5334
  setTimeout(() => {
5332
5335
  r(t);
@@ -5334,87 +5337,87 @@ async function Ws(n, t, r = "No label") {
5334
5337
  });
5335
5338
  }
5336
5339
  globalThis.debugEventTarget ??= new EventTarget();
5337
- var Ks = globalThis.debugEventTarget, js = /* @__PURE__ */ new Map();
5338
- function qs(n) {
5340
+ var zs = globalThis.debugEventTarget, Qs = /* @__PURE__ */ new Map();
5341
+ function $s(n) {
5339
5342
  const { inbox: t, waiters: r } = function(n) {
5340
- if (js.has(n)) return js.get(n);
5343
+ if (Qs.has(n)) return Qs.get(n);
5341
5344
  const t = {
5342
5345
  inbox: [],
5343
5346
  waiters: []
5344
5347
  };
5345
- return Ks.addEventListener(n, (n) => {
5348
+ return zs.addEventListener(n, (n) => {
5346
5349
  t.waiters.length ? t.waiters.shift()(n.detail) : t.inbox.push(n.detail);
5347
- }), js.set(n, t), t;
5350
+ }), Qs.set(n, t), t;
5348
5351
  }(n);
5349
5352
  return t.length ? Promise.resolve(t.shift()) : new Promise((n) => r.push(n));
5350
5353
  }
5351
- async function Qs(n, t) {
5352
- const r = await qs(n);
5354
+ async function Zs(n, t) {
5355
+ const r = await $s(n);
5353
5356
  let e = t?.getValueAt(0, 0) ?? "", u = `event["${n}"`;
5354
5357
  return void 0 !== r && (u += `, payload: ${r}`), "" !== e && (u += `, input: ${e}`), u += "]", console.log(u), "" + r + e;
5355
5358
  }
5356
- var zs = c({
5357
- ARRAYTOTEXT: () => Zs,
5358
- ASC: () => $s,
5359
- CHAR: () => Js,
5360
- CLEAN: () => nl,
5361
- CODE: () => tl,
5362
- CONCAT: () => rl,
5363
- CONCATENATE: () => ul,
5364
- DBCS: () => al,
5365
- DETECTLANGUAGE: () => ol,
5366
- DOLLAR: () => il,
5367
- EXACT: () => sl,
5368
- FIND: () => ll,
5369
- FINDB: () => cl,
5370
- FIXED: () => fl,
5371
- JOIN: () => ml,
5372
- LEFT: () => pl,
5373
- LEFTB: () => gl,
5374
- LEN: () => Il,
5375
- LENB: () => Nl,
5376
- LOWER: () => hl,
5377
- MID: () => bl,
5378
- MIDB: () => El,
5379
- NUMBERVALUE: () => Al,
5380
- PROPER: () => Ml,
5381
- REPLACE: () => dl,
5382
- REPLACEB: () => Sl,
5383
- REPT: () => Tl,
5384
- RIGHT: () => Rl,
5385
- RIGHTB: () => Cl,
5386
- SEARCH: () => vl,
5387
- SEARCHB: () => wl,
5388
- SPLIT: () => Bl,
5389
- SUBSTITUTE: () => Ol,
5390
- T: () => Dl,
5391
- TEXT: () => yl,
5392
- TEXTAFTER: () => xl,
5393
- TEXTBEFORE: () => Vl,
5394
- TEXTJOIN: () => Ll,
5395
- TEXTSPLIT: () => Pl,
5396
- TRANSLATE: () => Ul,
5397
- TRIM: () => _l,
5398
- UNICHAR: () => Fl,
5399
- UNICODE: () => Xl,
5400
- UPPER: () => Gl,
5401
- VALUE: () => Hl,
5402
- 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
5403
5406
  });
5404
- function $s(n) {
5405
- return Yl() ? Ql(n) : n;
5407
+ function nl(n) {
5408
+ return jl() ? Zl(n) : n;
5406
5409
  }
5407
- function Zs(n, r = 0) {
5410
+ function tl(n, r = 0) {
5408
5411
  if (0 !== (r = Math.floor(r)) && 1 !== r) throw t.BuiltIn.Value;
5409
5412
  const e = 1 === r;
5410
5413
  let u = null;
5411
5414
  if (!e) {
5412
5415
  if (1 === n.size) {
5413
5416
  const t = n.getValueAt(0, 0);
5414
- return null === t ? null : kl(t, r);
5417
+ return null === t ? null : Kl(t, r);
5415
5418
  }
5416
5419
  const { rows: t, columns: e } = n.getShape(), u = [];
5417
- 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));
5418
5421
  return u.join(", ");
5419
5422
  }
5420
5423
  const o = n.getValues();
@@ -5422,35 +5425,35 @@ function Zs(n, r = 0) {
5422
5425
  const a = o.length;
5423
5426
  for (let n = 0; n < a; n++) {
5424
5427
  const t = o[n], e = t.length;
5425
- 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 += ",");
5426
5429
  n < a - 1 && (u += ";");
5427
5430
  }
5428
5431
  return e && (u += "}"), u;
5429
5432
  }
5430
- function Js(n) {
5433
+ function rl(n) {
5431
5434
  const r = Math.trunc(n);
5432
5435
  if (!(r >= 1 && r <= 255)) throw t.BuiltIn.Value;
5433
5436
  return String.fromCharCode(r);
5434
5437
  }
5435
- function nl(n) {
5438
+ function el(n) {
5436
5439
  return n.replace(/[\x00-\x1F\x80-\x9F]/g, "");
5437
5440
  }
5438
- function tl(n) {
5441
+ function ul(n) {
5439
5442
  if (0 === n.length) throw t.BuiltIn.Value;
5440
5443
  return n.charCodeAt(0);
5441
5444
  }
5442
- function rl(n) {
5445
+ function ol(n) {
5443
5446
  let r = "";
5444
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;
5445
5448
  return r;
5446
5449
  }
5447
- var el = {
5450
+ var al = {
5448
5451
  type: u.String,
5449
5452
  coerce: [u.Boolean, u.Number],
5450
5453
  onError: "value",
5451
5454
  misalignValue: t.BuiltIn.NA
5452
5455
  };
5453
- function ul(r) {
5456
+ function il(r) {
5454
5457
  let u = n.createRange(1, 1, "");
5455
5458
  for (const n of r) u = u.broadcast(n, (n, r) => {
5456
5459
  if (null !== n && t.isError(n)) return n;
@@ -5460,16 +5463,16 @@ function ul(r) {
5460
5463
  let o = e.MAX_TEXT_LENGTH;
5461
5464
  const a = u.charCodeAt(o - 1), i = u.charCodeAt(o);
5462
5465
  return a >= 55296 && a <= 56319 && i >= 56320 && i <= 57343 && o--, u.slice(0, o);
5463
- }, el);
5466
+ }, al);
5464
5467
  return u;
5465
5468
  }
5466
- function ol(n) {
5469
+ function sl(n) {
5467
5470
  return t.BuiltIn.NA;
5468
5471
  }
5469
- function al(n) {
5470
- return Yl() ? ql(n) : n;
5472
+ function ll(n) {
5473
+ return jl() ? $l(n) : n;
5471
5474
  }
5472
- function il(t, r = 2) {
5475
+ function cl(t, r = 2) {
5473
5476
  if ((r = Math.trunc(r)) < 0) {
5474
5477
  const n = Math.pow(10, -r);
5475
5478
  t = Math.round(t / n) * n, r = 0;
@@ -5477,25 +5480,25 @@ function il(t, r = 2) {
5477
5480
  const e = n.getRuntime().getLocaleProfile().currencySymbol, u = r > 0 ? `.${"0".repeat(r)}` : "", o = `${e}#,##0${u}_);(${e}#,##0${u})`;
5478
5481
  return n.getNumberFormat(o, t).trim();
5479
5482
  }
5480
- function sl(n, t) {
5483
+ function fl(n, t) {
5481
5484
  return n === t;
5482
5485
  }
5483
- function ll(n, r, e = 1) {
5484
- if (e = Math.trunc(e), !Zl(r)) {
5486
+ function ml(n, r, e = 1) {
5487
+ if (e = Math.trunc(e), !tc(r)) {
5485
5488
  if (e < 1 || e > r.length) throw t.BuiltIn.Value;
5486
5489
  const u = r.indexOf(n, e - 1);
5487
5490
  if (-1 === u) throw t.BuiltIn.Value;
5488
5491
  return u + 1;
5489
5492
  }
5490
- if (e < 1 || e > Jl(r)) throw t.BuiltIn.Value;
5491
- 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));
5492
5495
  if (-1 === u) throw t.BuiltIn.Value;
5493
- return tc(r, u) + 1;
5496
+ return uc(r, u) + 1;
5494
5497
  }
5495
- function cl(n, t, r = 1) {
5496
- return ll(n, t, r);
5498
+ function pl(n, t, r = 1) {
5499
+ return ml(n, t, r);
5497
5500
  }
5498
- function fl(t, r = 2, e = !1) {
5501
+ function gl(t, r = 2, e = !1) {
5499
5502
  if ((r = Math.trunc(r)) < 0) {
5500
5503
  const n = Math.pow(10, -r);
5501
5504
  t = Math.round(t / n) * n, r = 0;
@@ -5503,35 +5506,35 @@ function fl(t, r = 2, e = !1) {
5503
5506
  const u = `${e ? "" : "#,"}##0${r > 0 ? `.${"0".repeat(r)}` : ""}`;
5504
5507
  return n.getNumberFormat(u, t).trim();
5505
5508
  }
5506
- function ml(n, t) {
5507
- return Ll(n, !0, [t]);
5509
+ function Il(n, t) {
5510
+ return _l(n, !0, [t]);
5508
5511
  }
5509
- function pl(n, r = 1) {
5512
+ function hl(n, r = 1) {
5510
5513
  if (r < 0) throw t.BuiltIn.Value;
5511
- 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);
5512
5515
  }
5513
- function gl(n, t = 1) {
5514
- return pl(n, t);
5516
+ function Nl(n, t = 1) {
5517
+ return hl(n, t);
5515
5518
  }
5516
- function Il(n) {
5517
- return Zl(n) ? Jl(n) : n.length;
5519
+ function bl(n) {
5520
+ return tc(n) ? rc(n) : n.length;
5518
5521
  }
5519
- function Nl(n) {
5520
- return Il(n);
5522
+ function El(n) {
5523
+ return bl(n);
5521
5524
  }
5522
- function hl(n) {
5525
+ function Al(n) {
5523
5526
  return n.toLowerCase();
5524
5527
  }
5525
- function bl(n, r, e) {
5528
+ function Ml(n, r, e) {
5526
5529
  if (r = Math.trunc(r), e = Math.trunc(e), r < 1 || e < 0) return t.BuiltIn.Value;
5527
- if (!Zl(n)) return r > n.length ? "" : n.slice(r - 1, r + e - 1);
5528
- const u = nc(n, r - 1);
5529
- 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));
5530
5533
  }
5531
- function El(n, t, r) {
5532
- return bl(n, t, r);
5534
+ function dl(n, t, r) {
5535
+ return Ml(n, t, r);
5533
5536
  }
5534
- function Al(r, u, o) {
5537
+ function Sl(r, u, o) {
5535
5538
  const a = n.getRuntime().getLocaleProfile();
5536
5539
  if (u = u ?? a.decimal, o = o ?? a.group, 0 === u.length || 0 === o.length) throw t.BuiltIn.Value;
5537
5540
  if (0 === r.length) return 0;
@@ -5544,50 +5547,50 @@ function Al(r, u, o) {
5544
5547
  for (const n of f) if (n !== u && !"-0123456789%()".includes(n)) throw t.BuiltIn.Value;
5545
5548
  const m = l.replace(u, ".").split(" ").join("").split(c).join("").match(/^([(-]?)(\d*\.?\d+)(\)?)(%*)$/);
5546
5549
  if (!m) throw t.BuiltIn.Value;
5547
- const p = m[1], g = m[3], I = m[4].length, N = "(" === p, h = "-" === p;
5548
- 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;
5549
5552
  let b = Number(e.truncateNumberText(m[2]));
5550
5553
  if (isNaN(b)) throw t.BuiltIn.Value;
5551
- return b /= 100 ** I, N || h ? -b : b;
5554
+ return b /= 100 ** I, h || N ? -b : b;
5552
5555
  }
5553
- function Ml(n) {
5556
+ function Tl(n) {
5554
5557
  return (n = n.toLowerCase()).replace(/(^|\P{L})(\p{L})/gu, (n, t, r) => t + (1 === r.length ? r.toUpperCase() : r));
5555
5558
  }
5556
- function dl(n, r, e, u) {
5557
- 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);
5558
5561
  }
5559
- function Sl(n, t, r, e) {
5560
- return dl(n, t, r, e);
5562
+ function Cl(n, t, r, e) {
5563
+ return Rl(n, t, r, e);
5561
5564
  }
5562
- function Tl(n, r) {
5565
+ function wl(n, r) {
5563
5566
  return (r = Math.floor(r)) < 0 || n.length * r > e.MAX_TEXT_LENGTH ? t.BuiltIn.Value : n.repeat(r);
5564
5567
  }
5565
- function Rl(n, r = 1) {
5568
+ function vl(n, r = 1) {
5566
5569
  if (r < 0) throw t.BuiltIn.Value;
5567
- if (!Zl(n)) {
5570
+ if (!tc(n)) {
5568
5571
  const t = n.length;
5569
5572
  return r > t ? n : n.slice(t - r);
5570
5573
  }
5571
- const e = Jl(n);
5572
- 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)));
5573
5576
  }
5574
- function Cl(n, t = 1) {
5575
- return Rl(n, t);
5577
+ function Bl(n, t = 1) {
5578
+ return vl(n, t);
5576
5579
  }
5577
- function vl(n, r, e = 1) {
5578
- 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;
5579
5582
  if (e < 1 || e > a) throw t.BuiltIn.Value;
5580
- 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);
5581
5584
  if (-1 === l) throw t.BuiltIn.Value;
5582
- return u ? tc(r, s + l) + 1 : l + e;
5585
+ return u ? uc(r, s + l) + 1 : l + e;
5583
5586
  }
5584
- function wl(n, t, r = 1) {
5585
- return vl(n, t, r);
5587
+ function Dl(n, t, r = 1) {
5588
+ return Ol(n, t, r);
5586
5589
  }
5587
- function Bl(n, t, r = !0, e = !0) {
5588
- 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);
5589
5592
  }
5590
- function Ol(n, r, u, o) {
5593
+ function xl(n, r, u, o) {
5591
5594
  if (!n || !r) return n;
5592
5595
  if (void 0 === o) o = -1;
5593
5596
  else if ((o = Math.floor(o)) <= 0) return t.BuiltIn.Value;
@@ -5599,10 +5602,10 @@ function Ol(n, r, u, o) {
5599
5602
  } else i += r.length;
5600
5603
  return a;
5601
5604
  }
5602
- function Dl(n) {
5605
+ function Vl(n) {
5603
5606
  return "string" == typeof n ? n : "";
5604
5607
  }
5605
- function yl(r, e) {
5608
+ function Ll(r, e) {
5606
5609
  if (null === r && (r = 0), "string" == typeof r && "" !== r.trim()) try {
5607
5610
  r = n.parseAsNumber(r.trim());
5608
5611
  } catch (n) {}
@@ -5613,23 +5616,23 @@ function yl(r, e) {
5613
5616
  return t.BuiltIn.Value;
5614
5617
  }
5615
5618
  }
5616
- function xl(n, r, e = 1, u = 0, o = 0, a) {
5619
+ function Pl(n, r, e = 1, u = 0, o = 0, a) {
5617
5620
  if (!n || !r) return t.BuiltIn.Value;
5618
5621
  if (0 === (e = Math.floor(e))) return t.BuiltIn.Value;
5619
- const i = rc(n, r, u);
5622
+ const i = oc(n, r, u);
5620
5623
  1 === o && i.push([n.length, n.length]);
5621
5624
  const s = e > 0 ? e - 1 : i.length + e;
5622
5625
  return s < 0 || s >= i.length ? a ?? t.BuiltIn.NA : n.substring(i[s][1]);
5623
5626
  }
5624
- function Vl(n, r, e = 1, u = 0, o = 0, a) {
5627
+ function Ul(n, r, e = 1, u = 0, o = 0, a) {
5625
5628
  if (!n || !r) return t.BuiltIn.Value;
5626
5629
  if (0 === (e = Math.floor(e))) return t.BuiltIn.Value;
5627
- const i = rc(n, r, u);
5630
+ const i = oc(n, r, u);
5628
5631
  1 === o && i.push([n.length, n.length]);
5629
5632
  const s = e > 0 ? e - 1 : i.length + e;
5630
5633
  return s < 0 || s >= i.length ? a ?? t.BuiltIn.NA : n.substring(0, i[s][0]);
5631
5634
  }
5632
- function Ll(n, r, u) {
5635
+ function _l(n, r, u) {
5633
5636
  let o = "", a = !0;
5634
5637
  for (const i of u) for (const u of i.values({ includeEmpty: !r })) if (0 !== u.length || !r) {
5635
5638
  if (a || (o += n), o += u, o.length > e.MAX_TEXT_LENGTH) return t.BuiltIn.Calc;
@@ -5637,13 +5640,13 @@ function Ll(n, r, u) {
5637
5640
  }
5638
5641
  return o;
5639
5642
  }
5640
- 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) {
5641
5644
  if (!n) return [[""]];
5642
5645
  if (0 !== o && 1 !== o) throw t.BuiltIn.Value;
5643
5646
  const i = (n) => {
5644
5647
  if (0 === n.length) return null;
5645
5648
  if (n.some((n) => 0 === n.length)) throw t.BuiltIn.Value;
5646
- 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" : "");
5647
5650
  }, s = (n, t) => t ? n.split(t) : [n], l = i(r);
5648
5651
  let c = [n];
5649
5652
  if (e && (c = s(n, i(e))), u) {
@@ -5677,39 +5680,39 @@ function Pl(n, r, e, u = !1, o = 0, a = void 0) {
5677
5680
  }
5678
5681
  return f.length > 0 ? f : [[""]];
5679
5682
  }
5680
- function Ul(n, r, e) {
5683
+ function Xl(n, r, e) {
5681
5684
  return t.BuiltIn.NA;
5682
5685
  }
5683
- function _l(n) {
5686
+ function Gl(n) {
5684
5687
  return n.replace(/ +/g, " ").replace(/^ +| +$/g, "");
5685
5688
  }
5686
- function Fl(n) {
5689
+ function Hl(n) {
5687
5690
  if (!(n >= 1)) throw t.BuiltIn.Value;
5688
5691
  const r = Math.trunc(n);
5689
5692
  if (r > 1114111) throw t.BuiltIn.Value;
5690
5693
  if (r >= 55296 && r <= 57343 || r >= 64976 && r <= 65007 || (65535 & r) >= 65534) throw t.BuiltIn.NA;
5691
5694
  return String.fromCodePoint(r);
5692
5695
  }
5693
- function Xl(n) {
5696
+ function kl(n) {
5694
5697
  if (0 === n.length) throw t.BuiltIn.Value;
5695
5698
  const r = n.codePointAt(0);
5696
5699
  if (r >= 55296 && r <= 57343) throw t.BuiltIn.Value;
5697
5700
  return r;
5698
5701
  }
5699
- function Gl(n) {
5702
+ function Yl(n) {
5700
5703
  return n.toUpperCase();
5701
5704
  }
5702
- function Hl(t) {
5705
+ function Wl(t) {
5703
5706
  return null === t ? 0 : n.parseAsNumber(t);
5704
5707
  }
5705
- function kl(r, e = 0) {
5708
+ function Kl(r, e = 0) {
5706
5709
  if (0 !== (e = Math.floor(e)) && 1 !== e) throw t.BuiltIn.Value;
5707
5710
  return "string" == typeof r ? 1 === e ? "\"" + r + "\"" : r : n.toText(r);
5708
5711
  }
5709
- var Yl = () => {
5712
+ var jl = () => {
5710
5713
  const t = n.getRuntime().getLocale().toLowerCase().split(/[-_]/)[0];
5711
5714
  return "ja" === t || "zh" === t || "ko" === t;
5712
- }, Wl = {
5715
+ }, ql = {
5713
5716
  latin: {
5714
5717
  halfRE: /[!-~]/g,
5715
5718
  fullRE: /[!-~]/g,
@@ -5735,11 +5738,11 @@ var Yl = () => {
5735
5738
  half: "¢£¬¯¦¥₩ |←↑→↓■°",
5736
5739
  full: "¢£¬ ̄¦¥₩ │←↑→↓■○"
5737
5740
  }
5738
- }, 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);
5739
- 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) {
5740
5743
  return n.replace(/[.*+?^${}()|[\]\\]/g, "\\$&");
5741
5744
  }
5742
- 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) => {
5743
5746
  const t = n.length;
5744
5747
  let r = 0;
5745
5748
  for (let e = 0; e < t - 1; e++) {
@@ -5749,7 +5752,7 @@ var $l = /[\uD800-\uDBFF][\uDC00-\uDFFF]/, Zl = (n) => $l.test(n), Jl = (n) => {
5749
5752
  u >= 56320 && u <= 57343 && (r++, e++);
5750
5753
  }
5751
5754
  return t - r;
5752
- }, nc = (n, t) => {
5755
+ }, ec = (n, t) => {
5753
5756
  const r = Math.trunc(t), e = n.length;
5754
5757
  let u = 0;
5755
5758
  for (let t = 0; t < r && u < e; t++) {
@@ -5757,40 +5760,40 @@ var $l = /[\uD800-\uDBFF][\uDC00-\uDFFF]/, Zl = (n) => $l.test(n), Jl = (n) => {
5757
5760
  u += t >= 55296 && t <= 56319 && r >= 56320 && r <= 57343 ? 2 : 1;
5758
5761
  }
5759
5762
  return Math.min(u, e);
5760
- }, 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) => {
5761
5764
  const e = [];
5762
5765
  if (1 === r) {
5763
- const r = new RegExp(zl(t), "gi");
5766
+ const r = new RegExp(Jl(t), "gi");
5764
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;
5765
5768
  return e;
5766
5769
  }
5767
5770
  for (let r = n.indexOf(t); -1 !== r; r = n.indexOf(t, r + 1)) e.push([r, r + t.length]);
5768
5771
  return e;
5769
- }, ec = c({ BAHTTEXT: () => uc });
5770
- function uc(n) {
5772
+ }, ac = c({ BAHTTEXT: () => ic });
5773
+ function ic(n) {
5771
5774
  try {
5772
5775
  return s(n);
5773
5776
  } catch (n) {
5774
5777
  throw Error(`Error in https://github.com/jojoee/bahttext \n${n.toString()}`);
5775
5778
  }
5776
5779
  }
5777
- var oc = c({ FILTERXML: () => ac });
5778
- async function ac(n, r) {
5779
- if (cc) throw t.BuiltIn.Blocked;
5780
- if (!sc || !lc) try {
5781
- 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;
5782
5785
  } catch (n) {
5783
- 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;
5784
5787
  }
5785
- 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;
5786
5789
  try {
5787
- const t = sc.parseFromString(n, "text/xml");
5788
- return [[lc.evaluateXPathToString(r, t, null, {})]];
5790
+ const t = fc.parseFromString(n, "text/xml");
5791
+ return [[mc.evaluateXPathToString(r, t, null, {})]];
5789
5792
  } catch (n) {
5790
5793
  throw t.BuiltIn.Value;
5791
5794
  }
5792
5795
  }
5793
- var ic = async () => {
5796
+ var cc = async () => {
5794
5797
  const [n, t] = await Promise.all([import(
5795
5798
  /* webpackIgnore: true */
5796
5799
  /* @vite-ignore */
@@ -5800,17 +5803,17 @@ var ic = async () => {
5800
5803
  /* @vite-ignore */
5801
5804
  "https://esm.sh/@xmldom/xmldom@0.8.11"
5802
5805
  )]);
5803
- lc = n;
5806
+ mc = n;
5804
5807
  const r = t.DOMParser;
5805
- sc = new r();
5806
- }, sc = null, lc = null, cc = !1, fc = null, mc = c({
5807
- ENCODEURL: () => pc,
5808
- WEBSERVICE: () => gc
5808
+ fc = new r();
5809
+ }, fc = null, mc = null, pc = !1, gc = null, Ic = c({
5810
+ ENCODEURL: () => hc,
5811
+ WEBSERVICE: () => Nc
5809
5812
  });
5810
- function pc(n) {
5813
+ function hc(n) {
5811
5814
  return encodeURIComponent(n);
5812
5815
  }
5813
- async function gc(n) {
5816
+ async function Nc(n) {
5814
5817
  try {
5815
5818
  const t = await fetch(n, {
5816
5819
  method: "GET",
@@ -5825,7 +5828,7 @@ async function gc(n) {
5825
5828
  throw t.BuiltIn.Value;
5826
5829
  }
5827
5830
  }
5828
- var Ic = {
5831
+ var bc = {
5829
5832
  DAVERAGE: {
5830
5833
  p: [
5831
5834
  {
@@ -6066,7 +6069,7 @@ var Ic = {
6066
6069
  ],
6067
6070
  r: { s: "*" }
6068
6071
  }
6069
- }, Nc = {
6072
+ }, Ec = {
6070
6073
  DATE: {
6071
6074
  p: [
6072
6075
  { n: "year" },
@@ -6247,7 +6250,7 @@ var Ic = {
6247
6250
  p: [{ n: "serialNumber" }],
6248
6251
  r: { s: "number" }
6249
6252
  }
6250
- }, hc = {
6253
+ }, Ac = {
6251
6254
  BESSELI: {
6252
6255
  p: [{
6253
6256
  n: "x",
@@ -6288,7 +6291,7 @@ var Ic = {
6288
6291
  }],
6289
6292
  r: { s: "number" }
6290
6293
  }
6291
- }, bc = {
6294
+ }, Mc = {
6292
6295
  BIN2DEC: {
6293
6296
  p: [{
6294
6297
  n: "number",
@@ -6477,7 +6480,7 @@ var Ic = {
6477
6480
  }],
6478
6481
  r: { s: "*" }
6479
6482
  }
6480
- }, Ec = { CONVERT: {
6483
+ }, dc = { CONVERT: {
6481
6484
  p: [
6482
6485
  {
6483
6486
  n: "number",
@@ -6493,7 +6496,7 @@ var Ic = {
6493
6496
  }
6494
6497
  ],
6495
6498
  r: { s: "number" }
6496
- } }, Ac = {
6499
+ } }, Sc = {
6497
6500
  DELTA: {
6498
6501
  p: [{
6499
6502
  n: "number1",
@@ -6522,7 +6525,7 @@ var Ic = {
6522
6525
  }],
6523
6526
  r: { s: "number" }
6524
6527
  }
6525
- }, Mc = {
6528
+ }, Tc = {
6526
6529
  ERF: {
6527
6530
  p: [{
6528
6531
  n: "lowerLimit",
@@ -6557,7 +6560,7 @@ var Ic = {
6557
6560
  }],
6558
6561
  r: { s: "number" }
6559
6562
  }
6560
- }, dc = {
6563
+ }, Rc = {
6561
6564
  COMPLEX: {
6562
6565
  p: [
6563
6566
  {
@@ -6795,7 +6798,7 @@ var Ic = {
6795
6798
  }],
6796
6799
  r: { s: "*" }
6797
6800
  }
6798
- }, Sc = {
6801
+ }, Cc = {
6799
6802
  CELL: {
6800
6803
  p: [{
6801
6804
  n: "infoType",
@@ -7002,7 +7005,7 @@ var Ic = {
7002
7005
  }],
7003
7006
  r: { s: "number" }
7004
7007
  }
7005
- }, Tc = {
7008
+ }, wc = {
7006
7009
  DATESTRING: {
7007
7010
  p: [{ n: "number" }],
7008
7011
  r: { s: "*" }
@@ -7011,13 +7014,13 @@ var Ic = {
7011
7014
  p: [{ n: "number" }, { n: "number2" }],
7012
7015
  r: { s: "*" }
7013
7016
  }
7014
- }, Rc = { PHONETIC: {
7017
+ }, vc = { PHONETIC: {
7015
7018
  p: [{
7016
7019
  n: "reference",
7017
7020
  r: "p"
7018
7021
  }],
7019
7022
  r: { s: "*" }
7020
- } }, Cc = {
7023
+ } }, Bc = {
7021
7024
  AND: {
7022
7025
  p: [{
7023
7026
  n: "logical",
@@ -7315,7 +7318,7 @@ var Ic = {
7315
7318
  }],
7316
7319
  r: { s: "*" }
7317
7320
  }
7318
- }, vc = { GROUPBY: {
7321
+ }, Oc = { GROUPBY: {
7319
7322
  p: [
7320
7323
  {
7321
7324
  n: "rowFields",
@@ -7365,7 +7368,7 @@ var Ic = {
7365
7368
  s: "*",
7366
7369
  r: "m"
7367
7370
  }
7368
- } }, wc = { PIVOTBY: {
7371
+ } }, Dc = { PIVOTBY: {
7369
7372
  p: [
7370
7373
  {
7371
7374
  n: "rowFields",
@@ -7433,7 +7436,7 @@ var Ic = {
7433
7436
  s: "*",
7434
7437
  r: "m"
7435
7438
  }
7436
- } }, Bc = {
7439
+ } }, yc = {
7437
7440
  ADDRESS: {
7438
7441
  p: [
7439
7442
  { n: "rowNum" },
@@ -7777,7 +7780,7 @@ var Ic = {
7777
7780
  p: [
7778
7781
  {
7779
7782
  n: "lookupValue",
7780
- r: "r",
7783
+ s: "*",
7781
7784
  o: "accept"
7782
7785
  },
7783
7786
  {
@@ -7863,13 +7866,15 @@ var Ic = {
7863
7866
  },
7864
7867
  {
7865
7868
  n: "sortIndex",
7866
- d: 1,
7869
+ r: "r",
7870
+ o: "accept-ref",
7867
7871
  m: "?",
7868
7872
  u: 1
7869
7873
  },
7870
7874
  {
7871
7875
  n: "sortOrder",
7872
- d: 1,
7876
+ r: "r",
7877
+ o: "accept-ref",
7873
7878
  m: "?",
7874
7879
  u: 1
7875
7880
  },
@@ -8094,7 +8099,7 @@ var Ic = {
8094
8099
  p: [
8095
8100
  {
8096
8101
  n: "lookupValue",
8097
- r: "r",
8102
+ s: "*",
8098
8103
  o: "accept"
8099
8104
  },
8100
8105
  {
@@ -8132,7 +8137,7 @@ var Ic = {
8132
8137
  p: [
8133
8138
  {
8134
8139
  n: "lookupValue",
8135
- r: "r",
8140
+ s: "*",
8136
8141
  o: "accept"
8137
8142
  },
8138
8143
  {
@@ -8154,7 +8159,7 @@ var Ic = {
8154
8159
  ],
8155
8160
  r: { s: "*" }
8156
8161
  }
8157
- }, Oc = {
8162
+ }, xc = {
8158
8163
  ABS: {
8159
8164
  p: [{ n: "number" }],
8160
8165
  r: { s: "number" }
@@ -8301,12 +8306,10 @@ var Ic = {
8301
8306
  r: { s: "number" }
8302
8307
  },
8303
8308
  GCD: {
8309
+ x: ["noReferenceLift", "noMemberFilter"],
8304
8310
  p: [{
8305
8311
  n: "number",
8306
- g: [{
8307
- n: "number",
8308
- s: "*"
8309
- }]
8312
+ g: [{ n: "number" }]
8310
8313
  }],
8311
8314
  r: { s: "number" }
8312
8315
  },
@@ -8323,12 +8326,10 @@ var Ic = {
8323
8326
  r: { s: "number" }
8324
8327
  },
8325
8328
  LCM: {
8329
+ x: ["noReferenceLift", "noMemberFilter"],
8326
8330
  p: [{
8327
8331
  n: "number",
8328
- g: [{
8329
- n: "number",
8330
- s: "*"
8331
- }]
8332
+ g: [{ n: "number" }]
8332
8333
  }],
8333
8334
  r: { s: "number" }
8334
8335
  },
@@ -8390,6 +8391,7 @@ var Ic = {
8390
8391
  r: { s: "number" }
8391
8392
  },
8392
8393
  MULTINOMIAL: {
8394
+ x: ["noReferenceLift", "noMemberFilter"],
8393
8395
  p: [{
8394
8396
  n: "number",
8395
8397
  g: [{ n: "number" }]
@@ -8536,7 +8538,6 @@ var Ic = {
8536
8538
  { n: "m" },
8537
8539
  {
8538
8540
  n: "coefficients",
8539
- s: "number",
8540
8541
  r: "r"
8541
8542
  }
8542
8543
  ],
@@ -8681,7 +8682,7 @@ var Ic = {
8681
8682
  }],
8682
8683
  r: { s: "number" }
8683
8684
  }
8684
- }, Dc = {
8685
+ }, Vc = {
8685
8686
  ACOS: {
8686
8687
  p: [{ n: "number" }],
8687
8688
  r: { s: "number" }
@@ -8766,7 +8767,7 @@ var Ic = {
8766
8767
  p: [{ n: "number" }],
8767
8768
  r: { s: "number" }
8768
8769
  }
8769
- }, yc = {
8770
+ }, Lc = {
8770
8771
  ADD: {
8771
8772
  p: [{ n: "value1" }, { n: "value2" }],
8772
8773
  r: { s: "number" }
@@ -8879,7 +8880,7 @@ var Ic = {
8879
8880
  ],
8880
8881
  r: { s: "boolean" }
8881
8882
  }
8882
- }, xc = {
8883
+ }, Pc = {
8883
8884
  "BETA.DIST": {
8884
8885
  fn: "BETA_DIST",
8885
8886
  p: [
@@ -10110,7 +10111,7 @@ var Ic = {
10110
10111
  ],
10111
10112
  r: { s: "number" }
10112
10113
  }
10113
- }, Vc = {
10114
+ }, Uc = {
10114
10115
  AVEDEV: {
10115
10116
  p: [{
10116
10117
  n: "number",
@@ -10440,7 +10441,7 @@ var Ic = {
10440
10441
  }, { n: "k" }],
10441
10442
  r: { s: "number" }
10442
10443
  }
10443
- }, Lc = {
10444
+ }, _c = {
10444
10445
  DELAY: {
10445
10446
  p: [
10446
10447
  { n: "time" },
@@ -10468,7 +10469,7 @@ var Ic = {
10468
10469
  }],
10469
10470
  r: { s: "string" }
10470
10471
  }
10471
- }, Pc = {
10472
+ }, Fc = {
10472
10473
  ASC: {
10473
10474
  p: [{
10474
10475
  n: "text",
@@ -11074,10 +11075,10 @@ var Ic = {
11074
11075
  }],
11075
11076
  r: { s: "string" }
11076
11077
  }
11077
- }, Uc = { BAHTTEXT: {
11078
+ }, Xc = { BAHTTEXT: {
11078
11079
  p: [{ n: "number" }],
11079
11080
  r: { s: "string" }
11080
- } }, _c = { FILTERXML: {
11081
+ } }, Gc = { FILTERXML: {
11081
11082
  p: [{
11082
11083
  n: "xml",
11083
11084
  s: "string"
@@ -11089,7 +11090,7 @@ var Ic = {
11089
11090
  s: "*",
11090
11091
  r: "m"
11091
11092
  }
11092
- } }, Fc = {
11093
+ } }, Hc = {
11093
11094
  ENCODEURL: {
11094
11095
  p: [{
11095
11096
  n: "text",
@@ -11104,5 +11105,5 @@ var Ic = {
11104
11105
  }],
11105
11106
  r: { s: "string" }
11106
11107
  }
11107
- }, Xc = () => import("./BXyQ76W9hObzOdf2.mjs"), Gc = () => import("./wDeMNrClyQscDTwZ.mjs"), Hc = () => import("./DjFalvyAcEOwNagC.mjs"), kc = () => import("./VRXC1SwOYSkv1Vs4.mjs"), Yc = () => import("./DcSbVdpEmRbpaZf0.mjs"), Wc = () => import("./Co7O0P5yM1i0exNK.mjs"), Kc = () => import("./8_dh9QnzvNBCvWpp.mjs"), jc = () => import("./BHG0YIMg5kOV3mNl.mjs"), qc = () => import("./K0CU2XaCnJJwh9a5.mjs"), Qc = () => import("./ymPI-MJUjuYe2n5v.mjs"), zc = () => import("./B2zbBC2YuaYszbHd.mjs"), $c = () => import("./BM0KaGfI1Lqav17f.mjs"), Zc = () => import("./BebVPCumXxQqABDP.mjs"), Jc = () => import("./74anAHR6YDREjbgI.mjs"), nf = () => import("./BIxWkCV-r5U5zPnQ.mjs"), tf = () => import("./Ctxig2_c-GErg911.mjs"), rf = () => import("./CmxGNGhfoNTz4Ku7.mjs"), ef = () => import("./B2b-ZmAhe94pNDT0.mjs"), uf = () => import("./CB4iUafw8x-4z_ff.mjs"), of = () => import("./DQXZXiayIDbfnOUM.mjs"), af = () => import("./DiV1y5wtlmlsRDfm.mjs"), sf = () => import("./D1iK18Nn8mRQo6Fk.mjs"), lf = () => import("./BsBiI5HHw7jjXgp5.mjs"), cf = () => import("./Dnrd8jP_j1AWCUX6.mjs"), ff = () => import("./CWI62PClHru85-mL.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);
11108
- 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 };