@sheetxl/formulas-extended 0.8.0-beta.11 → 0.8.0-beta.13

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 (76) hide show
  1. package/{node/esm/D25GpXzrju6GyQn2.mjs → browser/esm/-gjh-c5r-kqWZw9o.mjs} +1 -1
  2. package/{node/esm/D0XFBj8GRIDAu37v.mjs → browser/esm/B6ojJF7WA6DiQR2T.mjs} +1 -1
  3. package/browser/esm/{Bf0x5wP966yEyeU1.mjs → BHd0M_vc0wMVhN4M.mjs} +1 -1
  4. package/browser/esm/{D4kfW2yw0rsWNLi0.mjs → Bp7v8eImXSaAUiaa.mjs} +1 -1
  5. package/browser/esm/{CjKII1gh4dO5nTCs.mjs → BuGd_WozQ5GACryc.mjs} +1 -1
  6. package/browser/esm/{cfrOLasJbMwF7L77.mjs → BzsAYB0O4AGQyHhT.mjs} +1 -1
  7. package/browser/esm/{B0dkCLIUbDz5vaVn.mjs → C5QRZhBj0R2s5scX.mjs} +1 -1
  8. package/browser/esm/{0yxQHUFt5rjQCIev.mjs → C8cZUVI0utH84RoY.mjs} +1 -1
  9. package/browser/esm/{qAolCiBy-hQL59hu.mjs → CYYsvsWpauQOJMsM.mjs} +1 -1
  10. package/browser/esm/{CoHdir1CxZhcwJYt.mjs → D23E5LzPcseeh6hA.mjs} +1 -1
  11. package/{node/esm/o8LeKZ4-9nq29pqg.mjs → browser/esm/D5YXRS6-9JR6Jnuy.mjs} +1 -1
  12. package/browser/esm/{zWOO2QFn-kMYJv1L.mjs → DRA4FqoQ1dJXOyPu.mjs} +1 -1
  13. package/{node/esm/BJjZHVPRHerJoONT.mjs → browser/esm/DvQaVDnNxRMcD29t.mjs} +1 -1
  14. package/browser/esm/{g4CKPtGz1NpGDtQq.mjs → DygYeEKVAggDDD_C.mjs} +12 -41
  15. package/browser/esm/{BfcYyyl5rbLdyDeQ.mjs → JeU0hWKFq05N2_wk.mjs} +1 -1
  16. package/{node/esm/CNDVQpzD85y-8iJ4.mjs → browser/esm/KELE0bwOYLDc5LU1.mjs} +1 -1
  17. package/{node/esm/CZ7GTErfSkfNcFRk.mjs → browser/esm/N6ZNg1DcQqnCub6Y.mjs} +1 -1
  18. package/{node/esm/Dt0ErrS3YGvCicxr.mjs → browser/esm/NLoLzdQXAOTuwqvv.mjs} +1 -1
  19. package/{node/esm/DXTaMRX8ten_8WHT.mjs → browser/esm/P2KKIUxWzaRqA578.mjs} +1 -1
  20. package/browser/esm/{CiTyrOKe-UEYKcPV.mjs → TsVRWlV0aBAj11q_.mjs} +1 -1
  21. package/browser/esm/declarations.mjs +24 -28
  22. package/browser/esm/index.mjs +836 -844
  23. package/{node/esm/D4ySsDPVL4IH96en.mjs → browser/esm/kHBrNyVWu-GLkTFD.mjs} +1 -1
  24. package/browser/esm/{C2ZfbEIW-6-61CUe.mjs → pEF9hsQQaka-GGnX.mjs} +1 -1
  25. package/{browser/esm/D25GpXzrju6GyQn2.mjs → node/esm/-gjh-c5r-kqWZw9o.mjs} +1 -1
  26. package/{browser/esm/D0XFBj8GRIDAu37v.mjs → node/esm/B6ojJF7WA6DiQR2T.mjs} +1 -1
  27. package/node/esm/{Bf0x5wP966yEyeU1.mjs → BHd0M_vc0wMVhN4M.mjs} +1 -1
  28. package/node/esm/{C3Qy2cWt_qACxJiF.mjs → BVcZk6dCLKI8-HRM.mjs} +1 -1
  29. package/node/esm/{CgY5V9Cmm0UJmyGW.mjs → BbUWXLsnVo-QSDn_.mjs} +12 -41
  30. package/node/esm/{D4kfW2yw0rsWNLi0.mjs → Bp7v8eImXSaAUiaa.mjs} +1 -1
  31. package/node/esm/{CjKII1gh4dO5nTCs.mjs → BuGd_WozQ5GACryc.mjs} +1 -1
  32. package/node/esm/{cfrOLasJbMwF7L77.mjs → BzsAYB0O4AGQyHhT.mjs} +1 -1
  33. package/node/esm/{B0dkCLIUbDz5vaVn.mjs → C5QRZhBj0R2s5scX.mjs} +1 -1
  34. package/node/esm/{0yxQHUFt5rjQCIev.mjs → C8cZUVI0utH84RoY.mjs} +1 -1
  35. package/node/esm/{qAolCiBy-hQL59hu.mjs → CYYsvsWpauQOJMsM.mjs} +1 -1
  36. package/{browser/esm/o8LeKZ4-9nq29pqg.mjs → node/esm/D5YXRS6-9JR6Jnuy.mjs} +1 -1
  37. package/{browser/esm/BJjZHVPRHerJoONT.mjs → node/esm/DvQaVDnNxRMcD29t.mjs} +1 -1
  38. package/node/esm/{Bnco0vB0yNDiLGre.mjs → FxwjPPWZTalxCLby.mjs} +1 -1
  39. package/node/esm/{BfcYyyl5rbLdyDeQ.mjs → JeU0hWKFq05N2_wk.mjs} +1 -1
  40. package/{browser/esm/CNDVQpzD85y-8iJ4.mjs → node/esm/KELE0bwOYLDc5LU1.mjs} +1 -1
  41. package/{browser/esm/CZ7GTErfSkfNcFRk.mjs → node/esm/N6ZNg1DcQqnCub6Y.mjs} +1 -1
  42. package/{browser/esm/Dt0ErrS3YGvCicxr.mjs → node/esm/NLoLzdQXAOTuwqvv.mjs} +1 -1
  43. package/{browser/esm/DXTaMRX8ten_8WHT.mjs → node/esm/P2KKIUxWzaRqA578.mjs} +1 -1
  44. package/node/esm/{CiTyrOKe-UEYKcPV.mjs → TsVRWlV0aBAj11q_.mjs} +1 -1
  45. package/node/esm/declarations.mjs +24 -28
  46. package/node/esm/index.mjs +894 -902
  47. package/{browser/esm/D4ySsDPVL4IH96en.mjs → node/esm/kHBrNyVWu-GLkTFD.mjs} +1 -1
  48. package/node/esm/{C2ZfbEIW-6-61CUe.mjs → pEF9hsQQaka-GGnX.mjs} +1 -1
  49. package/package.json +3 -3
  50. package/types/src/_utils/AnyArgs.d.ts +0 -12
  51. package/types/src/_utils/FinanaceSolver.d.ts +0 -27
  52. package/types/src/_utils/FinanceAmor.d.ts +0 -9
  53. package/types/src/_utils/FinanceCashflow.d.ts +0 -17
  54. package/types/src/_utils/FinanceCoupon.d.ts +0 -63
  55. package/types/src/_utils/FinanceDate.d.ts +0 -7
  56. package/types/src/_utils/FinanceDayCount.d.ts +0 -74
  57. package/types/src/_utils/FinanceOdd.d.ts +0 -62
  58. package/types/src/_utils/FinanceSecurity.d.ts +0 -21
  59. package/types/src/_utils/FinanceUtils.d.ts +0 -34
  60. package/types/src/cube/Cube.d.ts +7 -7
  61. package/types/src/financial/ACCRINT.d.ts +0 -23
  62. package/types/src/financial/AMORDEGRC.d.ts +0 -22
  63. package/types/src/financial/Cashflow.d.ts +0 -49
  64. package/types/src/financial/Coupon.d.ts +0 -14
  65. package/types/src/financial/Date.d.ts +0 -29
  66. package/types/src/financial/Depreciation.d.ts +0 -9
  67. package/types/src/financial/Odd.d.ts +0 -18
  68. package/types/src/financial/Security.d.ts +0 -10
  69. package/types/src/financial/SecurityMaturity.d.ts +0 -40
  70. package/types/src/financial/TBill.d.ts +0 -17
  71. package/types/src/financial/VDB.d.ts +0 -17
  72. package/browser/esm/BDiwqEqe9Jl-Rmly.mjs +0 -19
  73. package/node/esm/0vsGDvrSkTeFOp0A.mjs +0 -19
  74. package/types/src/.generated/decl/financial/STOCKHISTORY.decl.d.ts +0 -4
  75. package/types/src/.generated/desc/financial/STOCKHISTORY.desc.d.ts +0 -4
  76. package/types/src/financial/STOCKHISTORY.d.ts +0 -17
@@ -1,69 +1,69 @@
1
1
  /**
2
- * @license @sheetxl/formulas-extended - Formulas Enterprise - TypeScript formulas compatible with Excel built-ins. - v0.8.0-beta.11
2
+ * @license @sheetxl/formulas-extended - Formulas Enterprise - TypeScript formulas compatible with Excel built-ins. - v0.8.0-beta.13
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.
6
6
  */
7
- import { C as e, S as t, _ as n, a as r, b as i, c as a, d as o, f as s, g as c, h as l, i as u, l as d, m as f, n as p, o as m, p as h, r as g, s as _, t as v, u as y, v as b, x, y as S } from "./g4CKPtGz1NpGDtQq.mjs";
8
- import { FormulaContext as C, FormulaError as w, IRange as T, ScalarType as E, ValueKind as D } from "@sheetxl/primitives";
9
- var O = Object.defineProperty, k = (e, t) => {
7
+ import { S as e, _ as t, a as n, b as r, c as i, d as a, f as o, g as s, h as c, i as l, l as u, m as d, n as f, o as p, p as m, r as h, s as g, t as _, u as v, v as y, x as b, y as x } from "./DygYeEKVAggDDD_C.mjs";
8
+ import { FormulaContext as S, FormulaError as C, IRange as w, ScalarType as T, ValueKind as E } from "@sheetxl/primitives";
9
+ var D = Object.defineProperty, O = (e, t) => {
10
10
  let n = {};
11
- for (var r in e) O(n, r, {
11
+ for (var r in e) D(n, r, {
12
12
  get: e[r],
13
13
  enumerable: !0
14
14
  });
15
- return t || O(n, Symbol.toStringTag, { value: "Module" }), n;
16
- }, ee = k({
17
- CUBEKPIMEMBER: () => te,
18
- CUBEMEMBER: () => A,
19
- CUBEMEMBERPROPERTY: () => j,
20
- CUBERANKEDMEMBER: () => M,
21
- CUBESET: () => N,
22
- CUBESETCOUNT: () => ne,
23
- CUBEVALUE: () => re
15
+ return t || D(n, Symbol.toStringTag, { value: "Module" }), n;
16
+ }, k = O({
17
+ CUBEKPIMEMBER: () => ee,
18
+ CUBEMEMBER: () => te,
19
+ CUBEMEMBERPROPERTY: () => A,
20
+ CUBERANKEDMEMBER: () => j,
21
+ CUBESET: () => M,
22
+ CUBESETCOUNT: () => N,
23
+ CUBEVALUE: () => ne
24
24
  });
25
- function te(e, t, n, r) {
26
- throw w.BuiltIn.NA;
25
+ function ee(e, t, n, r) {
26
+ throw C.BuiltIn.NA;
27
27
  }
28
- function A(e, t, n) {
29
- throw w.BuiltIn.NA;
28
+ function te(e, t, n) {
29
+ throw C.BuiltIn.NA;
30
30
  }
31
- function j(e, t, n) {
32
- throw w.BuiltIn.NA;
31
+ function A(e, t, n) {
32
+ throw C.BuiltIn.NA;
33
33
  }
34
- function M(e, t, n, r) {
35
- throw w.BuiltIn.NA;
34
+ function j(e, t, n, r) {
35
+ throw C.BuiltIn.NA;
36
36
  }
37
- function N(e, t, n, r, i) {
38
- throw w.BuiltIn.NA;
37
+ function M(e, t, n, r, i) {
38
+ throw C.BuiltIn.NA;
39
39
  }
40
- function ne(e) {
41
- throw w.BuiltIn.NA;
40
+ function N(e) {
41
+ throw C.BuiltIn.NA;
42
42
  }
43
- function re(e, ...t) {
44
- throw w.BuiltIn.NA;
43
+ function ne(e, ...t) {
44
+ throw C.BuiltIn.NA;
45
45
  }
46
- function ie(e) {
46
+ function re(e) {
47
47
  if (e === null) return 0;
48
48
  if (typeof e == "string") try {
49
- return C.parseAsNumber(e);
49
+ return S.parseAsNumber(e);
50
50
  } catch {
51
- return C.parseAsSerialDate(e);
51
+ return S.parseAsSerialDate(e);
52
52
  }
53
- return C.parseAsSerialDate(e);
53
+ return S.parseAsSerialDate(e);
54
54
  }
55
55
  function P(e) {
56
- if (e === void 0) throw w.BuiltIn.NA;
57
- return ie(e);
56
+ if (e === void 0) throw C.BuiltIn.NA;
57
+ return re(e);
58
58
  }
59
59
  function F(e) {
60
- return e === null ? 0 : C.parseAsNumber(e);
60
+ return e === null ? 0 : S.parseAsNumber(e);
61
61
  }
62
62
  function I(e) {
63
- if (e === void 0) throw w.BuiltIn.NA;
63
+ if (e === void 0) throw C.BuiltIn.NA;
64
64
  return F(e);
65
65
  }
66
- var ae = [
66
+ var L = [
67
67
  31,
68
68
  29,
69
69
  31,
@@ -76,7 +76,7 @@ var ae = [
76
76
  31,
77
77
  30,
78
78
  31
79
- ], oe = [
79
+ ], ie = [
80
80
  31,
81
81
  28,
82
82
  31,
@@ -90,26 +90,26 @@ var ae = [
90
90
  30,
91
91
  31
92
92
  ];
93
- function L(e) {
93
+ function R(e) {
94
94
  return e % 4 == 0 && e % 100 != 0 || e % 400 == 0;
95
95
  }
96
- function R(e, t) {
97
- return L(e) ? ae[t] : oe[t];
96
+ function ae(e, t) {
97
+ return R(e) ? L[t] : ie[t];
98
98
  }
99
- var z = (e, t) => R(e, t - 1), se = (e) => e.d === z(e.y, e.m);
100
- function B(e) {
101
- let t = C.getDateParts(e);
99
+ var z = (e, t) => ae(e, t - 1), B = (e) => e.d === z(e.y, e.m);
100
+ function V(e) {
101
+ let t = S.getDateParts(e);
102
102
  return {
103
103
  y: t.year,
104
104
  m: t.month,
105
105
  d: t.day
106
106
  };
107
107
  }
108
- function ce(e, t, n) {
108
+ function oe(e, t, n) {
109
109
  let r = t <= 2 ? e - 1 : e, i = Math.floor(r / 400), a = r - 400 * i, o = Math.floor((153 * (t + (t > 2 ? -3 : 9)) + 2) / 5) + n - 1, s = 146097 * i + (365 * a + Math.floor(a / 4) - Math.floor(a / 100) + o) - 693900;
110
110
  return s >= 60 ? s + 1 : s;
111
111
  }
112
- function le(e, t) {
112
+ function se(e, t) {
113
113
  let n = e.m - 1 + t, r = e.y + Math.floor(n / 12);
114
114
  return n = (n % 12 + 12) % 12 + 1, {
115
115
  y: r,
@@ -117,17 +117,17 @@ function le(e, t) {
117
117
  d: Math.min(e.d, z(r, n))
118
118
  };
119
119
  }
120
- function V(e) {
121
- return C.getDateParts(Math.max(0, Math.floor(e)));
120
+ function H(e) {
121
+ return S.getDateParts(Math.max(0, Math.floor(e)));
122
122
  }
123
- function ue(e, t, n, r, i, a) {
123
+ function ce(e, t, n, r, i, a) {
124
124
  return 360 * (r - e) + 30 * (i - t) + (a - n);
125
125
  }
126
- function H(e, t, n) {
126
+ function U(e, t, n) {
127
127
  switch (n) {
128
128
  case 0: return function(e, t) {
129
129
  return {
130
- days: Math.abs(fe(e, t)),
130
+ days: Math.abs(ue(e, t)),
131
131
  yearDays: 360
132
132
  };
133
133
  }(e, t);
@@ -136,22 +136,22 @@ function H(e, t, n) {
136
136
  days: 0,
137
137
  yearDays: 365
138
138
  };
139
- let n = V(e), r = V(t), i = n.year, a = r.year, o = Math.abs(t - e), s = Math.abs(a - i), c = s + 1, l = a < i ? a : i, u = a < i ? i : a, d, f = C.getSerialDate(l, 1, 1);
140
- if (l === 1900 && (f += 1), s === 0) d = C.getSerialDate(l, 12, 31) - f + 1;
139
+ let n = H(e), r = H(t), i = n.year, a = r.year, o = Math.abs(t - e), s = Math.abs(a - i), c = s + 1, l = a < i ? a : i, u = a < i ? i : a, d, f = S.getSerialDate(l, 1, 1);
140
+ if (l === 1900 && (f += 1), s === 0) d = S.getSerialDate(l, 12, 31) - f + 1;
141
141
  else if (s === 1) {
142
- let n = Math.min(e, t), r = Math.max(e, t), i = V(n), a = V(r), o = a.month - i.month;
143
- if (o > 0 || o === 0 && a.day > i.day) d = (C.getSerialDate(u + 1, 1, 1) - f) / c;
142
+ let n = Math.min(e, t), r = Math.max(e, t), i = H(n), a = H(r), o = a.month - i.month;
143
+ if (o > 0 || o === 0 && a.day > i.day) d = (S.getSerialDate(u + 1, 1, 1) - f) / c;
144
144
  else {
145
145
  d = 365;
146
- for (let e of [l, u]) if (L(e)) {
147
- let t = C.getSerialDate(e, 2, 29);
146
+ for (let e of [l, u]) if (R(e)) {
147
+ let t = S.getSerialDate(e, 2, 29);
148
148
  if (t >= n && t <= r) {
149
149
  d = 366;
150
150
  break;
151
151
  }
152
152
  }
153
153
  }
154
- } else d = (C.getSerialDate(u + 1, 1, 1) - f) / c;
154
+ } else d = (S.getSerialDate(u + 1, 1, 1) - f) / c;
155
155
  return {
156
156
  days: o,
157
157
  yearDays: d
@@ -167,71 +167,71 @@ function H(e, t, n) {
167
167
  yearDays: 365
168
168
  };
169
169
  case 4: return function(e, t) {
170
- let n = V(e), r = V(t), i = n.day, a = r.day;
170
+ let n = H(e), r = H(t), i = n.day, a = r.day;
171
171
  return i === 31 && (i = 30), a === 31 && (a = 30), {
172
- days: Math.abs(ue(n.year, n.month, i, r.year, r.month, a)),
172
+ days: Math.abs(ce(n.year, n.month, i, r.year, r.month, a)),
173
173
  yearDays: 360
174
174
  };
175
175
  }(e, t);
176
176
  }
177
177
  }
178
- function U(e) {
178
+ function W(e) {
179
179
  return e >= 0 && Math.floor(e) <= 2958465;
180
180
  }
181
- function W(e, t, n) {
181
+ function G(e, t, n) {
182
182
  let r = Math.floor(e), i = Math.floor(t);
183
183
  if (r > i) {
184
184
  let e = r;
185
185
  r = i, i = e;
186
186
  }
187
- if (n === 0) return fe(r, i) / 360;
188
- let { days: a, yearDays: o } = H(r, i, n);
187
+ if (n === 0) return ue(r, i) / 360;
188
+ let { days: a, yearDays: o } = U(r, i, n);
189
189
  return a / o;
190
190
  }
191
- function de(e, t, n) {
192
- let r = B(e), i = B(t).y - r.y, a = e;
191
+ function le(e, t, n) {
192
+ let r = V(e), i = V(t).y - r.y, a = e;
193
193
  for (; i > 0; --i) {
194
- let e = le(r, 12 * i);
195
- if (a = ce(e.y, e.m, e.d), a <= t) break;
194
+ let e = se(r, 12 * i);
195
+ if (a = oe(e.y, e.m, e.d), a <= t) break;
196
196
  }
197
197
  if (i <= 0 && (i = 0, a = e), n === 0 || n === 4) return i + function(e, t, n) {
198
- let r = V(e), i = V(t), a = r.day, o = i.day;
199
- return (r.month === 2 && a === 29 || a === 31) && (a = 30), o === 31 && (n || a >= 30) && (o = 30), ue(r.year, r.month, a, i.year, i.month, o);
198
+ let r = H(e), i = H(t), a = r.day, o = i.day;
199
+ return (r.month === 2 && a === 29 || a === 31) && (a = 30), o === 31 && (n || a >= 30) && (o = 30), ce(r.year, r.month, a, i.year, i.month, o);
200
200
  }(a, t, n === 4) / 360;
201
201
  let o = t - a;
202
- return n === 2 ? i + o / 360 : n === 3 ? i + o / 365 : i + o / (L(B(t).y) ? 366 : 365);
202
+ return n === 2 ? i + o / 360 : n === 3 ? i + o / 365 : i + o / (R(V(t).y) ? 366 : 365);
203
203
  }
204
- function fe(e, t) {
205
- let n = V(e), r = V(t), i = n.year, a = n.month, o = n.day, s = r.year, c = r.month, l = r.day, u = !1;
206
- return a === 2 ? o === (L(i) ? 29 : 28) && (o = 30, u = !0) : o === 31 && (o = 30), u && c === 2 && l === (L(s) ? 29 : 28) && (l = 30), l !== 31 || u || (o < 30 ? (c === 12 ? (s += 1, c = 1) : c += 1, l = 1) : l = 30), ue(i, a, o, s, c, l);
204
+ function ue(e, t) {
205
+ let n = H(e), r = H(t), i = n.year, a = n.month, o = n.day, s = r.year, c = r.month, l = r.day, u = !1;
206
+ return a === 2 ? o === (R(i) ? 29 : 28) && (o = 30, u = !0) : o === 31 && (o = 30), u && c === 2 && l === (R(s) ? 29 : 28) && (l = 30), l !== 31 || u || (o < 30 ? (c === 12 ? (s += 1, c = 1) : c += 1, l = 1) : l = 30), ce(i, a, o, s, c, l);
207
207
  }
208
- function pe(e, t, n) {
208
+ function de(e, t, n) {
209
209
  let r = Math.floor(e), i = Math.floor(t), a, o;
210
- return n === 0 || n === 4 ? (a = H(r, i, n).days, o = 360) : (a = me(i) - me(r), o = n !== 3 && L(V(r).year) ? 366 : 365), {
210
+ return n === 0 || n === 4 ? (a = U(r, i, n).days, o = 360) : (a = fe(i) - fe(r), o = n !== 3 && R(H(r).year) ? 366 : 365), {
211
211
  days: a === 0 ? o : a,
212
212
  yearDays: o
213
213
  };
214
214
  }
215
- function me(e) {
216
- let t = V(e);
217
- return t.month === 2 && t.day === 29 && L(t.year) ? e - 1 : e;
215
+ function fe(e) {
216
+ let t = H(e);
217
+ return t.month === 2 && t.day === 29 && R(t.year) ? e - 1 : e;
218
218
  }
219
- function G(e) {
219
+ function K(e) {
220
220
  let t = e === void 0 ? 0 : F(e), n = Math.trunc(t);
221
- if (t < 0 || n > 4) throw w.BuiltIn.Num;
221
+ if (t < 0 || n > 4) throw C.BuiltIn.Num;
222
222
  return n;
223
223
  }
224
- function he(e, t) {
224
+ function pe(e, t) {
225
225
  let n = Math.floor(e), r = Math.floor(t);
226
- if (!U(e) || !U(t) || n >= r) throw w.BuiltIn.Num;
226
+ if (!W(e) || !W(t) || n >= r) throw C.BuiltIn.Num;
227
227
  return {
228
228
  settlement: n,
229
229
  maturity: r
230
230
  };
231
231
  }
232
- function ge(e, t, n, r, i) {
233
- let a = G(i), o = P(e), s = P(t), c = I(n), l = I(r), u = he(o, s);
234
- if (c <= 0 || l <= 0) throw w.BuiltIn.Num;
232
+ function me(e, t, n, r, i) {
233
+ let a = K(i), o = P(e), s = P(t), c = I(n), l = I(r), u = pe(o, s);
234
+ if (c <= 0 || l <= 0) throw C.BuiltIn.Num;
235
235
  return {
236
236
  ...u,
237
237
  x: c,
@@ -239,27 +239,27 @@ function ge(e, t, n, r, i) {
239
239
  basis: a
240
240
  };
241
241
  }
242
- function _e(e, t, n) {
243
- let r = P(e), i = P(t), a = I(n), o = he(r, i);
242
+ function he(e, t, n) {
243
+ let r = P(e), i = P(t), a = I(n), o = pe(r, i);
244
244
  if (o.maturity > function(e) {
245
- let t = C.getDateParts(e);
246
- if (t.year >= 9999) throw w.BuiltIn.Num;
247
- if (t.day === 0) return C.getSerialDate(t.year + 1, t.month, 1) - 1;
248
- let n = R(t.year + 1, t.month - 1);
249
- return t.day > n ? C.getSerialDate(t.year + 1, t.month + 1, 1) : C.getSerialDate(t.year + 1, t.month, t.day);
250
- }(o.settlement) || a <= 0) throw w.BuiltIn.Num;
245
+ let t = S.getDateParts(e);
246
+ if (t.year >= 9999) throw C.BuiltIn.Num;
247
+ if (t.day === 0) return S.getSerialDate(t.year + 1, t.month, 1) - 1;
248
+ let n = ae(t.year + 1, t.month - 1);
249
+ return t.day > n ? S.getSerialDate(t.year + 1, t.month + 1, 1) : S.getSerialDate(t.year + 1, t.month, t.day);
250
+ }(o.settlement) || a <= 0) throw C.BuiltIn.Num;
251
251
  return {
252
252
  ...o,
253
253
  x: a,
254
254
  days: o.maturity - o.settlement
255
255
  };
256
256
  }
257
- function ve(e, t, n, r, i, a) {
258
- let o = G(a), s = P(e), c = P(t), l = P(n), u = I(r), d = I(i);
259
- if (!U(s) || !U(c) || !U(l)) throw w.BuiltIn.Num;
257
+ function ge(e, t, n, r, i, a) {
258
+ let o = K(a), s = P(e), c = P(t), l = P(n), u = I(r), d = I(i);
259
+ if (!W(s) || !W(c) || !W(l)) throw C.BuiltIn.Num;
260
260
  let f = Math.floor(s), p = Math.floor(c), m = Math.floor(l);
261
- if (!(m < f && f < p)) throw w.BuiltIn.Num;
262
- let { days: h, yearDays: g } = H(m, f, o), _ = H(m, p, o).days;
261
+ if (!(m < f && f < p)) throw C.BuiltIn.Num;
262
+ let { days: h, yearDays: g } = U(m, f, o), _ = U(m, p, o).days;
263
263
  return {
264
264
  rate: u,
265
265
  x: d,
@@ -269,100 +269,100 @@ function ve(e, t, n, r, i, a) {
269
269
  B: g
270
270
  };
271
271
  }
272
- function ye(e, t, n, r, i, a = !1) {
273
- let o = a ? 0 : G(i), s = P(e);
274
- if (!U(s)) throw w.BuiltIn.Num;
272
+ function _e(e, t, n, r, i, a = !1) {
273
+ let o = a ? 0 : K(i), s = P(e);
274
+ if (!W(s)) throw C.BuiltIn.Num;
275
275
  let c = P(t);
276
- if (!U(c)) throw w.BuiltIn.Num;
276
+ if (!W(c)) throw C.BuiltIn.Num;
277
277
  let l = n.map(I), u = Math.trunc(I(r));
278
- if (u !== 1 && u !== 2 && u !== 4) throw w.BuiltIn.Num;
279
- return a && (o = G(i)), {
280
- ...he(s, c),
278
+ if (u !== 1 && u !== 2 && u !== 4) throw C.BuiltIn.Num;
279
+ return a && (o = K(i)), {
280
+ ...pe(s, c),
281
281
  numbers: l,
282
282
  frequency: u,
283
283
  basis: o
284
284
  };
285
285
  }
286
- var K = (e) => Number.isFinite(e) ? e : 0, be = k({
287
- ACCRINT: () => xe,
288
- ACCRINTM: () => Se
286
+ var q = (e) => Number.isFinite(e) ? e : 0, ve = O({
287
+ ACCRINT: () => ye,
288
+ ACCRINTM: () => be
289
289
  });
290
- function xe(e, t, n, r, i, a, o = 0, s = !0) {
290
+ function ye(e, t, n, r, i, a, o = 0, s = !0) {
291
291
  let c = function(e) {
292
292
  if (e === void 0) return !0;
293
293
  if (e === null) return !1;
294
294
  if (typeof e == "boolean") return e;
295
295
  if (typeof e == "number") return e !== 0;
296
- throw w.isError(e) ? e : w.BuiltIn.Value;
296
+ throw C.isError(e) ? e : C.BuiltIn.Value;
297
297
  }(s), l = P(e);
298
- if (!U(l)) throw w.BuiltIn.Num;
298
+ if (!W(l)) throw C.BuiltIn.Num;
299
299
  let u = P(t);
300
- if (!U(u)) throw w.BuiltIn.Num;
300
+ if (!W(u)) throw C.BuiltIn.Num;
301
301
  let d = P(n);
302
- if (!U(d)) throw w.BuiltIn.Num;
302
+ if (!W(d)) throw C.BuiltIn.Num;
303
303
  let f = I(r), p = i === void 0 ? 1e3 : F(i), m = Math.trunc(I(a));
304
- if (m !== 1 && m !== 2 && m !== 4) throw w.BuiltIn.Num;
305
- let h = G(o), g = Math.floor(l), _ = Math.floor(d);
306
- if (g >= _ || f <= 0 || p <= 0) throw w.BuiltIn.Num;
304
+ if (m !== 1 && m !== 2 && m !== 4) throw C.BuiltIn.Num;
305
+ let h = K(o), g = Math.floor(l), _ = Math.floor(d);
306
+ if (g >= _ || f <= 0 || p <= 0) throw C.BuiltIn.Num;
307
307
  let v = function(e, t, n, r, i, a) {
308
- let o = 12 / r, s = se(B(t)), c;
308
+ let o = 12 / r, s = B(V(t)), c;
309
309
  if (n > t && a) {
310
310
  c = t;
311
- for (let e = t; e < n;) c = e, e = ke(e, o, s);
312
- } else c = ke(t, -o, s);
313
- let l = i === 3 ? 365 / r : i === 1 ? t - ke(t, -o, s) : 360 / r, u = De(Math.max(e, c), n, i) / l;
311
+ for (let e = t; e < n;) c = e, e = De(e, o, s);
312
+ } else c = De(t, -o, s);
313
+ let l = i === 3 ? 365 / r : i === 1 ? t - De(t, -o, s) : 360 / r, u = Te(Math.max(e, c), n, i) / l;
314
314
  for (let t = c; t > e;) {
315
- let n = ke(t, -o, s);
316
- e <= n ? a && (u += 1) : u += De(e, t, i) / Oe(n, t, r, i), t = n;
315
+ let n = De(t, -o, s);
316
+ e <= n ? a && (u += 1) : u += Te(e, t, i) / Ee(n, t, r, i), t = n;
317
317
  }
318
318
  return u;
319
319
  }(g, Math.floor(u), _, m, h, c);
320
- return K(f / m * p * v);
320
+ return q(f / m * p * v);
321
321
  }
322
- function Se(e, t, n, r, i = 0) {
322
+ function be(e, t, n, r, i = 0) {
323
323
  let a = P(e);
324
- if (!U(a)) throw w.BuiltIn.Num;
324
+ if (!W(a)) throw C.BuiltIn.Num;
325
325
  let o = P(t);
326
- if (!U(o)) throw w.BuiltIn.Num;
327
- let s = I(n), c = r === void 0 ? 1e3 : F(r), l = G(i);
328
- if (Math.floor(a) > Math.floor(o) || s <= 0 || c <= 0) throw w.BuiltIn.Num;
329
- let u = c * s * W(a, o, l);
326
+ if (!W(o)) throw C.BuiltIn.Num;
327
+ let s = I(n), c = r === void 0 ? 1e3 : F(r), l = K(i);
328
+ if (Math.floor(a) > Math.floor(o) || s <= 0 || c <= 0) throw C.BuiltIn.Num;
329
+ let u = c * s * G(a, o, l);
330
330
  return Number.isFinite(u) ? u : 0;
331
331
  }
332
- var Ce = (e, t) => 360 * (t.y - e.y) + 30 * (t.m - e.m) + (t.d - e.d), we = (e) => e.m === 2 && e.d === z(e.y, 2);
333
- function Te(e, t, n) {
334
- let r = B(e), i = B(t);
335
- return we(i) && (n || we(r)) && (i.d = 30), i.d === 31 && (n || r.d >= 30) && (i.d = 30), (r.d === 31 || we(r)) && (r.d = 30), Ce(r, i);
332
+ var xe = (e, t) => 360 * (t.y - e.y) + 30 * (t.m - e.m) + (t.d - e.d), Se = (e) => e.m === 2 && e.d === z(e.y, 2);
333
+ function Ce(e, t, n) {
334
+ let r = V(e), i = V(t);
335
+ return Se(i) && (n || Se(r)) && (i.d = 30), i.d === 31 && (n || r.d >= 30) && (i.d = 30), (r.d === 31 || Se(r)) && (r.d = 30), xe(r, i);
336
336
  }
337
- function Ee(e, t) {
338
- let n = B(e), r = B(t);
339
- return n.d === 31 && (n.d = 30), r.d === 31 && (r.d = 30), Ce(n, r);
337
+ function we(e, t) {
338
+ let n = V(e), r = V(t);
339
+ return n.d === 31 && (n.d = 30), r.d === 31 && (r.d = 30), xe(n, r);
340
340
  }
341
- var De = (e, t, n) => n === 0 ? Te(e, t, !1) : n === 4 ? Ee(e, t) : t - e, Oe = (e, t, n, r) => r === 1 ? t - e : r === 3 ? 365 / n : r === 4 ? Ee(e, t) : Te(e, t, !0);
342
- function ke(e, t, n) {
343
- if (e < 1) throw w.BuiltIn.Num;
344
- let r = le(B(e), t), i = ce(r.y, r.m, n ? z(r.y, r.m) : r.d);
345
- if (i < 1 || i > 2958465) throw w.BuiltIn.Num;
341
+ var Te = (e, t, n) => n === 0 ? Ce(e, t, !1) : n === 4 ? we(e, t) : t - e, Ee = (e, t, n, r) => r === 1 ? t - e : r === 3 ? 365 / n : r === 4 ? we(e, t) : Ce(e, t, !0);
342
+ function De(e, t, n) {
343
+ if (e < 1) throw C.BuiltIn.Num;
344
+ let r = se(V(e), t), i = oe(r.y, r.m, n ? z(r.y, r.m) : r.d);
345
+ if (i < 1 || i > 2958465) throw C.BuiltIn.Num;
346
346
  return i;
347
347
  }
348
- function Ae(e, t, n, r, i, a, o) {
348
+ function Oe(e, t, n, r, i, a, o) {
349
349
  let s = I(e), c = Math.floor(I(t)), l = Math.floor(I(n)), u = I(r), d = I(i), f = I(a);
350
- if (s <= 0 || u < 0 || u > s || d < 0 || f <= 0 || !C.isValidDate(c) || !C.isValidDate(l) || c > l) return null;
350
+ if (s <= 0 || u < 0 || u > s || d < 0 || f <= 0 || !S.isValidDate(c) || !S.isValidDate(l) || c > l) return null;
351
351
  let p = Math.floor(F(o ?? 0));
352
352
  return p < 0 || p === 2 || p > 4 ? null : {
353
353
  cost: s,
354
354
  salvage: u,
355
355
  periodIndex: d > 1 ? Math.floor(d) : Math.ceil(d),
356
356
  rate: f,
357
- ...pe(c, l, p)
357
+ ...de(c, l, p)
358
358
  };
359
359
  }
360
- var q = (e) => {
360
+ var J = (e) => {
361
361
  let t = e.getLocaleProfile().currencySymbol;
362
362
  return `${t}#,##0.00_);[Red](${t}#,##0.00)`;
363
- }, J = (e, t) => {
363
+ }, Y = (e, t) => {
364
364
  if (e === 0) {
365
- if (t < 0) throw w.BuiltIn.Div0;
365
+ if (t < 0) throw C.BuiltIn.Div0;
366
366
  if (t === 0) return NaN;
367
367
  }
368
368
  if (!Number.isInteger(t) || Math.abs(t) > 4294967294) {
@@ -375,28 +375,28 @@ var q = (e) => {
375
375
  let n = Math.abs(t), r = 1, i = e;
376
376
  for (; n > 0;) n % 2 == 1 && (r *= i), i *= i, n = Math.floor(n / 2);
377
377
  return t < 0 ? 1 / r : r;
378
- }, je = (e) => e >= 2147483648 || e <= -2147483649 || Number.isNaN(e) ? -2147483648 : Math.trunc(e), Me = (e, t = 0) => {
378
+ }, ke = (e) => e >= 2147483648 || e <= -2147483649 || Number.isNaN(e) ? -2147483648 : Math.trunc(e), Ae = (e, t = 0) => {
379
379
  let n = 10 ** t, r = Number(Math.abs(e).toPrecision(15));
380
380
  return Math.sign(e) * Math.round(r * n) / n;
381
- }, Ne = k({ AMORDEGRC: () => Fe }), Pe = 1e6;
382
- function Fe(e, t, n, r, i, a, o = 0) {
383
- let s = Ae(e, t, n, r, i, a, o);
381
+ }, je = O({ AMORDEGRC: () => Ne }), Me = 1e6;
382
+ function Ne(e, t, n, r, i, a, o = 0) {
383
+ let s = Oe(e, t, n, r, i, a, o);
384
384
  if (!s) return NaN;
385
385
  let { cost: c, salvage: l, periodIndex: u, rate: d, days: f, yearDays: p } = s, m = f / p, h = 1 / d;
386
386
  if (h <= 2) return NaN;
387
387
  let g = d * (h <= 4 ? 1.5 : h <= 6 ? 2 : 2.5), _ = Math.ceil(h);
388
388
  if (c - l === 0) return 0;
389
- let v = Me(Math.min(c * g * m, c - l));
389
+ let v = Ae(Math.min(c * g * m, c - l));
390
390
  if (u === 0) return v;
391
391
  let y = c - v, b = Math.min(u, _ - 3), x = 1;
392
392
  if (b >= 1) {
393
- if (b - 1 <= Pe) for (; x < b; x++) {
393
+ if (b - 1 <= Me) for (; x < b; x++) {
394
394
  if (y < l) return 0;
395
395
  y -= y * g;
396
396
  }
397
- else y *= J(1 - g, b - 1), x = b;
397
+ else y *= Y(1 - g, b - 1), x = b;
398
398
  if (y < l) return 0;
399
- if (u === b) return Me(y * g);
399
+ if (u === b) return Ae(y * g);
400
400
  y -= y * g, x++;
401
401
  }
402
402
  for (; x <= u; x++) {
@@ -404,56 +404,56 @@ function Fe(e, t, n, r, i, a, o = 0) {
404
404
  let e = _ - x;
405
405
  if (e < 1) return 0;
406
406
  let t = e <= 2 ? y / e : y * g;
407
- if (x === u) return Me(t);
407
+ if (x === u) return Ae(t);
408
408
  y -= t;
409
409
  }
410
410
  return 0;
411
411
  }
412
- var Ie = k({
413
- CUMIPMT: () => We,
414
- CUMPRINC: () => Ge,
415
- FV: () => Le,
416
- IPMT: () => He,
417
- ISPMT: () => Ke,
418
- NPER: () => Be,
419
- PMT: () => ze,
420
- PPMT: () => Ue,
421
- PV: () => Re,
422
- RATE: () => Ve
412
+ var Pe = O({
413
+ CUMIPMT: () => He,
414
+ CUMPRINC: () => Ue,
415
+ FV: () => Fe,
416
+ IPMT: () => Be,
417
+ ISPMT: () => We,
418
+ NPER: () => Re,
419
+ PMT: () => Le,
420
+ PPMT: () => Ve,
421
+ PV: () => Ie,
422
+ RATE: () => ze
423
423
  });
424
- function Le(e, t, n, r = 0, i = 0) {
425
- if (C.formatResults(q(C.getRuntime())), e === 0) return -(r + n * t);
426
- let a = J(1 + e, t);
424
+ function Fe(e, t, n, r = 0, i = 0) {
425
+ if (S.formatResults(J(S.getRuntime())), e === 0) return -(r + n * t);
426
+ let a = Y(1 + e, t);
427
427
  return -(r * a + (a - 1) / e * (1 + e * +!!i) * n);
428
428
  }
429
- function Re(e, t, n, r = 0, i = 0) {
430
- if (C.formatResults(q(C.getRuntime())), e === 0) return -(r + n * t);
431
- let a = J(1 + e, t);
432
- if (a === 0) throw w.BuiltIn.Div0;
429
+ function Ie(e, t, n, r = 0, i = 0) {
430
+ if (S.formatResults(J(S.getRuntime())), e === 0) return -(r + n * t);
431
+ let a = Y(1 + e, t);
432
+ if (a === 0) throw C.BuiltIn.Div0;
433
433
  return -(r + (a - 1) / e * (1 + e * +!!i) * n) / a;
434
434
  }
435
- function ze(e, t, n, r = 0, i = 0) {
436
- if (C.formatResults(q(C.getRuntime())), t === 0) return NaN;
435
+ function Le(e, t, n, r = 0, i = 0) {
436
+ if (S.formatResults(J(S.getRuntime())), t === 0) return NaN;
437
437
  if (e === 0) return (-n - r) / t;
438
438
  if (e <= -1) return NaN;
439
439
  let a = t * Math.log1p(e), o = (n / -Math.expm1(-a) + r / Math.expm1(a)) * e;
440
440
  return -(i ? o / (1 + e) : o);
441
441
  }
442
- function Be(e, t, n, r = 0, i = 0) {
442
+ function Re(e, t, n, r = 0, i = 0) {
443
443
  if (e === 0) {
444
- if (t === 0) throw w.BuiltIn.Div0;
444
+ if (t === 0) throw C.BuiltIn.Div0;
445
445
  return (-n - r) / t;
446
446
  }
447
447
  if (e <= -1) return NaN;
448
448
  let a = Math.log(1 + e);
449
- if (a === 0) throw w.BuiltIn.Div0;
449
+ if (a === 0) throw C.BuiltIn.Div0;
450
450
  return i && (t *= 1 + e), Math.log((t - r * e) / (n * e + t)) / a;
451
451
  }
452
- function Ve(e, t, n, r = 0, i = 0, a = .1) {
453
- if (C.formatResults("0%"), a <= -1) throw w.BuiltIn.Value;
452
+ function ze(e, t, n, r = 0, i = 0, a = .1) {
453
+ if (S.formatResults("0%"), a <= -1) throw C.BuiltIn.Value;
454
454
  let o = +!!i, s = (i) => {
455
455
  if (i === 0) return n + t * e + r;
456
- let a = J(1 + i, e);
456
+ let a = Y(1 + i, e);
457
457
  return n * a + (a - 1) / i * (1 + i * o) * t + r;
458
458
  }, c = a, l = s(c), u = l > 0 ? a - .001 : a + .001, d = s(u);
459
459
  for (let e = 0; e < 200; e++) {
@@ -466,15 +466,15 @@ function Ve(e, t, n, r = 0, i = 0, a = .1) {
466
466
  }
467
467
  return NaN;
468
468
  }
469
- function He(e, t, n, r, i = 0, a = 0) {
470
- if (C.formatResults(q(C.getRuntime())), t < 1 || t - 1 >= n) return NaN;
469
+ function Be(e, t, n, r, i = 0, a = 0) {
470
+ if (S.formatResults(J(S.getRuntime())), t < 1 || t - 1 >= n) return NaN;
471
471
  if (t === 1 && a || e === 0) return 0;
472
472
  if (e <= -1) return NaN;
473
473
  let o = Math.log1p(e), s = t - 1, c = -e * (r * -Math.expm1((s - n) * o) - i * (s * o < 700 ? Math.exp(-n * o) * Math.expm1(s * o) : Math.exp((s - n) * o) - Math.exp(-n * o))) / -Math.expm1(-n * o);
474
474
  return a ? c / (1 + e) : c;
475
475
  }
476
- function Ue(e, t, n, r, i = 0, a = 0) {
477
- if (C.formatResults(q(C.getRuntime())), t < 1 || t - 1 >= n) return NaN;
476
+ function Ve(e, t, n, r, i = 0, a = 0) {
477
+ if (S.formatResults(J(S.getRuntime())), t < 1 || t - 1 >= n) return NaN;
478
478
  if (e === 0) return -(r + i) / n;
479
479
  if (e <= -1) return NaN;
480
480
  let o = Math.log1p(e), s = -Math.expm1(-n * o);
@@ -482,31 +482,31 @@ function Ue(e, t, n, r, i = 0, a = 0) {
482
482
  let c = a ? t - 2 : t - 1;
483
483
  return -(r + i) * (e * Math.exp((c - n) * o)) / s;
484
484
  }
485
- function We(e, t, n, r, i, a) {
486
- let o = Je(...qe(e, t, n, r, i, a));
485
+ function He(e, t, n, r, i, a) {
486
+ let o = Ke(...Ge(e, t, n, r, i, a));
487
487
  if (!o) return NaN;
488
488
  let s = o.count * o.payment - o.principal;
489
489
  return Number.isFinite(s) ? s : NaN;
490
490
  }
491
- function Ge(e, t, n, r, i, a) {
492
- let o = Je(...qe(e, t, n, r, i, a));
491
+ function Ue(e, t, n, r, i, a) {
492
+ let o = Ke(...Ge(e, t, n, r, i, a));
493
493
  return o ? o.principal : NaN;
494
494
  }
495
- function Ke(e, t, n, r) {
496
- if (n === 0) throw w.BuiltIn.Div0;
495
+ function We(e, t, n, r) {
496
+ if (n === 0) throw C.BuiltIn.Div0;
497
497
  let i = r * (t - n) * e / n;
498
498
  return Number.isFinite(i) ? i : NaN;
499
499
  }
500
- var qe = (e, t, n, r, i, a) => [
500
+ var Ge = (e, t, n, r, i, a) => [
501
501
  I(e),
502
502
  I(t),
503
503
  I(n),
504
504
  I(r),
505
505
  I(i),
506
506
  I(a)
507
- ], Je = (e, t, n, r, i, a) => {
507
+ ], Ke = (e, t, n, r, i, a) => {
508
508
  if (e <= 0 || t <= 0 || n <= 0 || r < 1 || r > i || i > t || a !== 0 && a !== 1) return null;
509
- let o = ze(e, t, n, 0, a);
509
+ let o = Le(e, t, n, 0, a);
510
510
  if (!Number.isFinite(o)) return null;
511
511
  let s = Math.ceil(r), c = Math.floor(i), l = c - s + 1;
512
512
  if (l <= 0) return {
@@ -529,28 +529,28 @@ var qe = (e, t, n, r, i, a) => [
529
529
  principal: p,
530
530
  count: l
531
531
  };
532
- }, Ye = (e) => {
533
- let t = C.getArgs().getRawAt(e), n = t;
532
+ }, qe = (e) => {
533
+ let t = S.getArgs().getRawAt(e), n = t;
534
534
  return !0 !== n?.isIRange || n.size === 1 && !0 === t.isIReferenceRange;
535
535
  };
536
- function Xe(e, t, n, r = "xnpv") {
536
+ function Je(e, t, n, r = "xnpv") {
537
537
  let i = r === "xirr", a = e.flatten({ onError: "value" }), o = t.flatten({ onError: "value" }), s = a.getRowCount();
538
- if (s !== o.getRowCount()) throw w.BuiltIn.Num;
539
- let c = !Ye(n + 1), l = Ye(n) || i, u = !c || i, d = +!i, f = [], p = [], m;
538
+ if (s !== o.getRowCount()) throw C.BuiltIn.Num;
539
+ let c = !qe(n + 1), l = qe(n) || i, u = !c || i, d = +!i, f = [], p = [], m;
540
540
  for (let e = 0; e < s; e++) {
541
541
  let t = a.getValueAt(e, 0) ?? null, n = o.getValueAt(e, 0) ?? null;
542
542
  if (e === 0) {
543
- if (w.isError(n)) throw n;
544
- if (!i && (m = Ze(n, u, i, 0), m < d || m > 2958465)) throw w.BuiltIn.Num;
545
- if (w.isError(t)) throw t;
543
+ if (C.isError(n)) throw n;
544
+ if (!i && (m = Ye(n, u, i, 0), m < d || m > 2958465)) throw C.BuiltIn.Num;
545
+ if (C.isError(t)) throw t;
546
546
  } else {
547
- if (w.isError(t)) throw t;
548
- if (w.isError(n)) throw n;
547
+ if (C.isError(t)) throw t;
548
+ if (C.isError(n)) throw n;
549
549
  }
550
550
  if (i && t === null) continue;
551
- if (i && n === null && c) throw w.BuiltIn.Num;
552
- let r = Ze(n, u, i, e), s = Qe(t, l, i, e);
553
- if (r > 2958465 || r < d || !i && r < m) throw w.BuiltIn.Num;
551
+ if (i && n === null && c) throw C.BuiltIn.Num;
552
+ let r = Ye(n, u, i, e), s = Xe(t, l, i, e);
553
+ if (r > 2958465 || r < d || !i && r < m) throw C.BuiltIn.Num;
554
554
  m === void 0 && (m = r), f.push(s), p.push(r);
555
555
  }
556
556
  let h = m ?? 0;
@@ -559,46 +559,46 @@ function Xe(e, t, n, r = "xnpv") {
559
559
  days: p.map((e) => e - h)
560
560
  };
561
561
  }
562
- function Ze(e, t, n, r) {
563
- let i = t ? ie(e) : e;
564
- if (typeof i != "number" || Number.isNaN(i)) throw n || r === 0 ? w.BuiltIn.Value : w.BuiltIn.Num;
562
+ function Ye(e, t, n, r) {
563
+ let i = t ? re(e) : e;
564
+ if (typeof i != "number" || Number.isNaN(i)) throw n || r === 0 ? C.BuiltIn.Value : C.BuiltIn.Num;
565
565
  return Math.trunc(i);
566
566
  }
567
- function Qe(e, t, n, r) {
567
+ function Xe(e, t, n, r) {
568
568
  let i = t ? F(e) : e;
569
- if (typeof i != "number" || Number.isNaN(i)) throw n || r === 0 ? w.BuiltIn.Value : w.BuiltIn.Num;
569
+ if (typeof i != "number" || Number.isNaN(i)) throw n || r === 0 ? C.BuiltIn.Value : C.BuiltIn.Num;
570
570
  return i;
571
571
  }
572
- var $e = k({
573
- IRR: () => tt,
574
- MIRR: () => nt,
575
- NPV: () => et,
576
- XIRR: () => it,
577
- XNPV: () => rt
572
+ var Ze = O({
573
+ IRR: () => $e,
574
+ MIRR: () => et,
575
+ NPV: () => Qe,
576
+ XIRR: () => nt,
577
+ XNPV: () => tt
578
578
  });
579
- function et(e, t) {
580
- C.formatResults(q(C.getRuntime()));
579
+ function Qe(e, t) {
580
+ S.formatResults(J(S.getRuntime()));
581
581
  let n = [];
582
582
  for (let e of t) for (let t of e.values()) n.push(t);
583
583
  let r = n.length, i = 1 + e;
584
- if (i === 0 || !Number.isFinite(J(i, r - 1))) throw w.BuiltIn.Div0;
584
+ if (i === 0 || !Number.isFinite(Y(i, r - 1))) throw C.BuiltIn.Div0;
585
585
  let a = 0;
586
586
  for (let e = r - 1; e >= 0; e--) a += n[e], a /= i;
587
587
  return a;
588
588
  }
589
- function tt(e, t = .1) {
590
- if (C.formatResults("0%"), C.getArgs().getKindAt(0) === D.Error) throw e[0];
591
- if (t <= -1 || 1 + t === t || e === void 0) throw w.BuiltIn.Value;
589
+ function $e(e, t = .1) {
590
+ if (S.formatResults("0%"), S.getArgs().getKindAt(0) === E.Error) throw e[0];
591
+ if (t <= -1 || 1 + t === t || e === void 0) throw C.BuiltIn.Value;
592
592
  let n = [];
593
593
  for (let t of e) {
594
- if (w.isError(t)) throw w.BuiltIn.Value;
594
+ if (C.isError(t)) throw C.BuiltIn.Value;
595
595
  typeof t == "number" && n.push(t);
596
596
  }
597
597
  let r = !1, i = !1;
598
598
  for (let e of n) e > 0 ? r = !0 : e < 0 && (i = !0);
599
599
  if (!r || !i) return NaN;
600
600
  let a = (e) => {
601
- if (e === 0) throw w.BuiltIn.Div0;
601
+ if (e === 0) throw C.BuiltIn.Div0;
602
602
  let t = 1 / e, r = 0, i = 1;
603
603
  for (let e = 0; e < n.length; e++) r += n[e] / i, i *= t;
604
604
  return r;
@@ -617,50 +617,50 @@ function tt(e, t = .1) {
617
617
  }
618
618
  return NaN;
619
619
  }
620
- function nt(e, t, n) {
621
- if (C.formatResults("0%"), e === void 0) throw w.BuiltIn.Value;
620
+ function et(e, t, n) {
621
+ if (S.formatResults("0%"), e === void 0) throw C.BuiltIn.Value;
622
622
  let r = [];
623
623
  for (let t of e) {
624
- if (w.isError(t)) throw t;
624
+ if (C.isError(t)) throw t;
625
625
  typeof t == "number" && r.push(t);
626
626
  }
627
627
  let i = r.length;
628
- if (i < 2 || !Number.isFinite(J(1 + n, i - 1))) throw w.BuiltIn.Div0;
629
- if (!Number.isFinite(J(1 + n, i)) || !Number.isFinite(J(1 + t, i))) return NaN;
628
+ if (i < 2 || !Number.isFinite(Y(1 + n, i - 1))) throw C.BuiltIn.Div0;
629
+ if (!Number.isFinite(Y(1 + n, i)) || !Number.isFinite(Y(1 + t, i))) return NaN;
630
630
  let a = 0, o = 0;
631
631
  for (let e = 0; e < i; e++) {
632
632
  let i = r[e];
633
633
  if (i > 0) {
634
634
  let t = (1 + n) ** +e;
635
- if (t === 0) throw w.BuiltIn.Div0;
635
+ if (t === 0) throw C.BuiltIn.Div0;
636
636
  a += i / t;
637
637
  } else if (i < 0) {
638
638
  let n = (1 + t) ** +e;
639
- if (n === 0) throw w.BuiltIn.Div0;
639
+ if (n === 0) throw C.BuiltIn.Div0;
640
640
  o += i / n;
641
641
  }
642
642
  }
643
- if (o === 0) throw w.BuiltIn.Div0;
643
+ if (o === 0) throw C.BuiltIn.Div0;
644
644
  let s = (-(a * (1 + n) ** (i - 1)) / o) ** (1 / (i - 1)) - 1;
645
645
  return Number.isFinite(s) ? s : NaN;
646
646
  }
647
- function rt(e, t, n) {
647
+ function tt(e, t, n) {
648
648
  let r = I(e);
649
- if (t === void 0 || n === void 0) throw w.BuiltIn.NA;
649
+ if (t === void 0 || n === void 0) throw C.BuiltIn.NA;
650
650
  if (r <= 0) return NaN;
651
- let i = Xe(t, n, 1), a = 0;
651
+ let i = Je(t, n, 1), a = 0;
652
652
  for (let e = 0; e < i.values.length; e++) {
653
- let t = J(1 + r, i.days[e] / 365);
653
+ let t = Y(1 + r, i.days[e] / 365);
654
654
  if (!Number.isFinite(t)) return NaN;
655
655
  a += i.values[e] / t;
656
656
  }
657
657
  return Number.isFinite(a) ? a : NaN;
658
658
  }
659
- function it(e, t, n = .1) {
659
+ function nt(e, t, n = .1) {
660
660
  let r = F(n);
661
- if (e === void 0 || t === void 0) throw w.BuiltIn.NA;
662
- let i = Xe(e, t, 0, "xirr"), a = i.values, o = a.length;
663
- if (o === 1) throw w.BuiltIn.NA;
661
+ if (e === void 0 || t === void 0) throw C.BuiltIn.NA;
662
+ let i = Je(e, t, 0, "xirr"), a = i.values, o = a.length;
663
+ if (o === 1) throw C.BuiltIn.NA;
664
664
  let s = !1, c = !1;
665
665
  for (let e of a) e > 0 ? s = !0 : e < 0 && (c = !0);
666
666
  if (!s || !c) return NaN;
@@ -735,133 +735,133 @@ function it(e, t, n = .1) {
735
735
  let y = Math.abs(u(p)) <= Math.abs(u(m)) ? p : m;
736
736
  return Number.isFinite(y) ? y : NaN;
737
737
  }
738
- var at = k({
739
- DOLLARDE: () => ct,
740
- DOLLARFR: () => lt,
741
- EFFECT: () => ot,
742
- NOMINAL: () => st
738
+ var rt = O({
739
+ DOLLARDE: () => ot,
740
+ DOLLARFR: () => st,
741
+ EFFECT: () => it,
742
+ NOMINAL: () => at
743
743
  });
744
- function ot(e, t) {
744
+ function it(e, t) {
745
745
  let n = I(e), r = Math.trunc(I(t));
746
746
  if (n <= 0 || r < 1) return NaN;
747
- let i = J(1 + n / r, r) - 1;
747
+ let i = Y(1 + n / r, r) - 1;
748
748
  return Number.isFinite(i) ? i : NaN;
749
749
  }
750
- function st(e, t) {
750
+ function at(e, t) {
751
751
  let n = I(e), r = Math.trunc(I(t));
752
752
  if (n <= 0 || r < 1) return NaN;
753
- let i = (J(n + 1, 1 / r) - 1) * r;
753
+ let i = (Y(n + 1, 1 / r) - 1) * r;
754
754
  return Number.isFinite(i) ? i : NaN;
755
755
  }
756
- function ct(e, t) {
757
- let n = I(e), { denominator: r, scale: i } = ut(I(t));
756
+ function ot(e, t) {
757
+ let n = I(e), { denominator: r, scale: i } = ct(I(t));
758
758
  if (Number.isNaN(r)) return NaN;
759
759
  let a = n < 0 ? -1 : 1, o = Math.abs(n), s = Math.trunc(o);
760
760
  return a * (s + (o - s) * i / r);
761
761
  }
762
- function lt(e, t) {
763
- let n = I(e), { denominator: r, scale: i } = ut(I(t));
762
+ function st(e, t) {
763
+ let n = I(e), { denominator: r, scale: i } = ct(I(t));
764
764
  if (Number.isNaN(r)) return NaN;
765
765
  let a = n < 0 ? -1 : 1, o = Math.abs(n), s = Math.trunc(o);
766
766
  return a * (s + (o - s) * r / i);
767
767
  }
768
- var ut = (e) => {
768
+ var ct = (e) => {
769
769
  if (e < 0) return {
770
770
  denominator: NaN,
771
771
  scale: 1
772
772
  };
773
773
  let t = Math.trunc(e);
774
- if (t === 0) throw w.BuiltIn.Div0;
774
+ if (t === 0) throw C.BuiltIn.Div0;
775
775
  return {
776
776
  denominator: t,
777
777
  scale: 10 ** Math.ceil(Math.log10(t))
778
778
  };
779
- }, Y = (e, t) => R(e, t - 1), dt = (e) => e.d === Y(e.y, e.m);
779
+ }, lt = (e, t) => ae(e, t - 1), ut = (e) => e.d === lt(e.y, e.m);
780
780
  function X(e, t = !1) {
781
- let n = Math.min(e.d, Y(e.y, e.m)), r = e.m <= 2 ? e.y - 1 : e.y, i = Math.floor(r / 400), a = r - 400 * i, o = Math.floor((153 * (e.m + (e.m > 2 ? -3 : 9)) + 2) / 5) + n - 1, s = 146097 * i + (365 * a + Math.floor(a / 4) - Math.floor(a / 100) + o) - 693900;
781
+ let n = Math.min(e.d, lt(e.y, e.m)), r = e.m <= 2 ? e.y - 1 : e.y, i = Math.floor(r / 400), a = r - 400 * i, o = Math.floor((153 * (e.m + (e.m > 2 ? -3 : 9)) + 2) / 5) + n - 1, s = 146097 * i + (365 * a + Math.floor(a / 4) - Math.floor(a / 100) + o) - 693900;
782
782
  return !t && s >= 60 ? s + 1 : s;
783
783
  }
784
- function ft(e, t) {
784
+ function dt(e, t) {
785
785
  let n = X(e) < 1;
786
786
  return X(t, n) - X(e, n);
787
787
  }
788
- function pt(e) {
789
- let t = C.getDateParts(e);
788
+ function ft(e) {
789
+ let t = S.getDateParts(e);
790
790
  return {
791
791
  y: t.year,
792
792
  m: t.month,
793
793
  d: t.day
794
794
  };
795
795
  }
796
- function mt(e, t, n, r) {
796
+ function pt(e, t, n, r) {
797
797
  let i = e.m - 1 - t, a = e.y + Math.floor(i / 12);
798
798
  i = (i % 12 + 12) % 12 + 1;
799
- let o = Y(a, i);
799
+ let o = lt(a, i);
800
800
  return {
801
801
  y: a,
802
802
  m: i,
803
803
  d: r ? o : Math.min(n, o)
804
804
  };
805
805
  }
806
- function ht(e, t, n, r = !1) {
807
- let i = dt(e), a = mt(e, t * n, e.d, i);
808
- return r && !i && (a.d = Math.min(e.d, a.m === 2 ? 29 : Y(a.y, a.m))), a;
806
+ function mt(e, t, n, r = !1) {
807
+ let i = ut(e), a = pt(e, t * n, e.d, i);
808
+ return r && !i && (a.d = Math.min(e.d, a.m === 2 ? 29 : lt(a.y, a.m))), a;
809
809
  }
810
- function gt(e, t, n) {
811
- let r = 12 / n, i = pt(t), a = 0, o = i;
812
- for (; (a === 0 ? t : X(o)) > e;) a++, o = ht(i, a, r);
810
+ function ht(e, t, n) {
811
+ let r = 12 / n, i = ft(t), a = 0, o = i;
812
+ for (; (a === 0 ? t : X(o)) > e;) a++, o = mt(i, a, r);
813
813
  return {
814
814
  maturity: i,
815
815
  pcd: o,
816
- ncd: ht(i, a - 1, r),
816
+ ncd: mt(i, a - 1, r),
817
817
  count: a,
818
818
  step: r
819
819
  };
820
820
  }
821
+ function gt(e, t, n) {
822
+ return Math.max(0, X(ht(e, t, n).pcd));
823
+ }
821
824
  function _t(e, t, n) {
822
- return Math.max(0, X(gt(e, t, n).pcd));
825
+ return X(ht(e, t, n).ncd);
823
826
  }
824
827
  function vt(e, t, n) {
825
- return X(gt(e, t, n).ncd);
826
- }
827
- function yt(e, t, n) {
828
- let r = gt(e, t, n);
828
+ let r = ht(e, t, n);
829
829
  return X(r.pcd) <= 0 ? NaN : r.count;
830
830
  }
831
- function bt(e, t, n, r) {
831
+ function yt(e, t, n, r) {
832
832
  return function(e, t, n) {
833
- let { days: r } = H(e, t, n);
833
+ let { days: r } = U(e, t, n);
834
834
  return e < t ? r : 0;
835
- }(_t(e, t, n), e, r);
835
+ }(gt(e, t, n), e, r);
836
836
  }
837
- function xt(e, t, n, r) {
838
- let i = gt(e, t, n);
837
+ function bt(e, t, n, r) {
838
+ let i = ht(e, t, n);
839
839
  if (r !== 0 && r !== 4) return X(i.ncd) - e;
840
- let a = pt(e), o = ht(i.maturity, i.count - 1, i.step, !0), s = i.pcd.y === a.y && i.pcd.m === a.m && i.pcd.d === a.d, c = s ? ht(i.maturity, i.count, i.step, !0).d : a.d, l = o.d;
841
- return r === 4 ? (c = Math.min(c, 30), l = Math.min(l, 30)) : ((c === 31 || s && a.m === 2 && c >= Y(a.y, 2)) && (c = 30), (l === 31 || o.m === 2 && l >= Y(o.y, 2)) && (l = 30)), 360 * (o.y - a.y) + 30 * (o.m - a.m) + (l - c);
840
+ let a = ft(e), o = mt(i.maturity, i.count - 1, i.step, !0), s = i.pcd.y === a.y && i.pcd.m === a.m && i.pcd.d === a.d, c = s ? mt(i.maturity, i.count, i.step, !0).d : a.d, l = o.d;
841
+ return r === 4 ? (c = Math.min(c, 30), l = Math.min(l, 30)) : ((c === 31 || s && a.m === 2 && c >= lt(a.y, 2)) && (c = 30), (l === 31 || o.m === 2 && l >= lt(o.y, 2)) && (l = 30)), 360 * (o.y - a.y) + 30 * (o.m - a.m) + (l - c);
842
842
  }
843
- function St(e, t, n, r) {
843
+ function xt(e, t, n, r) {
844
844
  if (r === 3) return 365 / n;
845
845
  if (r !== 1) return 360 / n;
846
- let i = 12 / n, a = pt(t), o = [a], s = [a], c = dt(a), l = a.d, u = (e) => e[e.length - 1];
846
+ let i = 12 / n, a = ft(t), o = [a], s = [a], c = ut(a), l = a.d, u = (e) => e[e.length - 1];
847
847
  for (; X(u(o)) > e || X(u(s)) > e;) {
848
- let e = mt(u(o), i, u(o).d, c);
849
- dt(e) && (c = !0), o.push(e);
850
- let t = mt(u(s), i, l, !1);
848
+ let e = pt(u(o), i, u(o).d, c);
849
+ ut(e) && (c = !0), o.push(e);
850
+ let t = pt(u(s), i, l, !1);
851
851
  l = t.d, s.push(t);
852
852
  }
853
853
  let d = s.findIndex((t) => X(t) <= e);
854
- if (X(s[d - 1]) !== X(o[d - 1])) return ft(s[d], s[d - 1]);
854
+ if (X(s[d - 1]) !== X(o[d - 1])) return dt(s[d], s[d - 1]);
855
855
  let f = o.findIndex((t) => X(t) <= e);
856
- return ft(o[f], o[f - 1]);
856
+ return dt(o[f], o[f - 1]);
857
857
  }
858
- function Ct(e, t, n, r) {
858
+ function St(e, t, n, r) {
859
859
  let i = P(e), a = P(t), o = Math.floor(i), s = Math.floor(a);
860
- if (!U(i) || !U(a) || o >= s) throw w.BuiltIn.Num;
860
+ if (!W(i) || !W(a) || o >= s) throw C.BuiltIn.Num;
861
861
  let c = Math.trunc(I(n));
862
- if (c !== 1 && c !== 2 && c !== 4) throw w.BuiltIn.Num;
862
+ if (c !== 1 && c !== 2 && c !== 4) throw C.BuiltIn.Num;
863
863
  let l = r === void 0 ? 0 : F(r), u = Math.trunc(l);
864
- if (l < 0 || u > 4) throw w.BuiltIn.Num;
864
+ if (l < 0 || u > 4) throw C.BuiltIn.Num;
865
865
  return {
866
866
  settlement: o,
867
867
  maturity: s,
@@ -869,8 +869,8 @@ function Ct(e, t, n, r) {
869
869
  basis: u
870
870
  };
871
871
  }
872
- function wt(e, t, n, r) {
873
- let i = yt(e, t, n), a = bt(e, t, n, r), o = r === 1 ? a + xt(e, t, n, r) : St(e, t, n, r);
872
+ function Ct(e, t, n, r) {
873
+ let i = vt(e, t, n), a = yt(e, t, n, r), o = r === 1 ? a + bt(e, t, n, r) : xt(e, t, n, r);
874
874
  return {
875
875
  N: i,
876
876
  A: a,
@@ -878,8 +878,8 @@ function wt(e, t, n, r) {
878
878
  DSC: o - a
879
879
  };
880
880
  }
881
- function Tt(e, t, n, r, i, a, o) {
882
- let { N: s, A: c, E: l, DSC: u } = wt(e, t, a, o);
881
+ function wt(e, t, n, r, i, a, o) {
882
+ let { N: s, A: c, E: l, DSC: u } = Ct(e, t, a, o);
883
883
  if (Number.isNaN(s)) return NaN;
884
884
  let d = 100 * n / a, f = r / a;
885
885
  if (s === 1) return (d + i) / (f * u / l + 1) - d * c / l;
@@ -889,8 +889,8 @@ function Tt(e, t, n, r, i, a, o) {
889
889
  for (let e = 1; e <= s; e++) m += d / (1 + f) ** (e - 1 + u / l);
890
890
  return m + i / p - d * c / l;
891
891
  }
892
- function Et(e, t, n, r, i, a) {
893
- let { N: o, A: s, E: c, DSC: l } = wt(e, t, i, a);
892
+ function Tt(e, t, n, r, i, a) {
893
+ let { N: o, A: s, E: c, DSC: l } = Ct(e, t, i, a);
894
894
  if (Number.isNaN(o)) return NaN;
895
895
  let u = l / c - 1, d = 1 + r / i, f = 100 * n / i, p = 0, m = 0;
896
896
  for (let e = 1; e <= o; e++) {
@@ -902,100 +902,100 @@ function Et(e, t, n, r, i, a) {
902
902
  let _ = 100 / g;
903
903
  return p += h * _, m += _, p / m / i;
904
904
  }
905
- var Dt = k({
906
- COUPDAYBS: () => Ot,
907
- COUPDAYS: () => kt,
908
- COUPDAYSNC: () => At,
909
- COUPNCD: () => jt,
910
- COUPNUM: () => Nt,
911
- COUPPCD: () => Mt
905
+ var Et = O({
906
+ COUPDAYBS: () => Dt,
907
+ COUPDAYS: () => Ot,
908
+ COUPDAYSNC: () => kt,
909
+ COUPNCD: () => At,
910
+ COUPNUM: () => Mt,
911
+ COUPPCD: () => jt
912
912
  });
913
+ function Dt(e, t, n, r = 0) {
914
+ let i = St(e, t, n, r);
915
+ return yt(i.settlement, i.maturity, i.frequency, i.basis);
916
+ }
913
917
  function Ot(e, t, n, r = 0) {
914
- let i = Ct(e, t, n, r);
915
- return bt(i.settlement, i.maturity, i.frequency, i.basis);
918
+ let i = St(e, t, n, r);
919
+ return xt(i.settlement, i.maturity, i.frequency, i.basis);
916
920
  }
917
921
  function kt(e, t, n, r = 0) {
918
- let i = Ct(e, t, n, r);
919
- return St(i.settlement, i.maturity, i.frequency, i.basis);
922
+ let i = St(e, t, n, r);
923
+ return bt(i.settlement, i.maturity, i.frequency, i.basis);
920
924
  }
921
925
  function At(e, t, n, r = 0) {
922
- let i = Ct(e, t, n, r);
923
- return xt(i.settlement, i.maturity, i.frequency, i.basis);
926
+ let i = St(e, t, n, r);
927
+ return _t(i.settlement, i.maturity, i.frequency);
924
928
  }
925
929
  function jt(e, t, n, r = 0) {
926
- let i = Ct(e, t, n, r);
927
- return vt(i.settlement, i.maturity, i.frequency);
930
+ let i = St(e, t, n, r);
931
+ return gt(i.settlement, i.maturity, i.frequency);
928
932
  }
929
933
  function Mt(e, t, n, r = 0) {
930
- let i = Ct(e, t, n, r);
931
- return _t(i.settlement, i.maturity, i.frequency);
932
- }
933
- function Nt(e, t, n, r = 0) {
934
- let i = Ct(e, t, n, r);
935
- return yt(i.settlement, i.maturity, i.frequency);
934
+ let i = St(e, t, n, r);
935
+ return vt(i.settlement, i.maturity, i.frequency);
936
936
  }
937
- var Pt = k({
938
- DATEDIF: () => Ft,
939
- DAYS360: () => Lt,
940
- YEARFRAC: () => It
937
+ var Nt = O({
938
+ DATEDIF: () => Pt,
939
+ DAYS360: () => It,
940
+ YEARFRAC: () => Ft
941
941
  });
942
- function Ft(e, t, n) {
942
+ function Pt(e, t, n) {
943
943
  let r = Math.floor(e), i = Math.floor(t);
944
- if (!U(e) || !U(t) || r > i) return NaN;
945
- let a = C.getDateParts(r), o = C.getDateParts(i);
944
+ if (!W(e) || !W(t) || r > i) return NaN;
945
+ let a = S.getDateParts(r), o = S.getDateParts(i);
946
946
  n = n.toLowerCase();
947
- let s = o.year - a.year, c = o.month - a.month, l = o.day - a.day, u = c < 0 || c === 0 && l < 0, d = l < 0 ? -1 : 0, f = i - C.getSerialDate(o.year, o.month + d, a.day), p = (d + 12 * s + c) % 12;
947
+ let s = o.year - a.year, c = o.month - a.month, l = o.day - a.day, u = c < 0 || c === 0 && l < 0, d = l < 0 ? -1 : 0, f = i - S.getSerialDate(o.year, o.month + d, a.day), p = (d + 12 * s + c) % 12;
948
948
  switch (n) {
949
949
  case "y": return s - +!!u;
950
950
  case "m": return 12 * s + c + d;
951
951
  case "d": return i - r;
952
952
  case "md": return f;
953
953
  case "ym": return p;
954
- case "yd": return C.getSerialDate(a.year, a.month + p, a.day) + f - r;
954
+ case "yd": return S.getSerialDate(a.year, a.month + p, a.day) + f - r;
955
955
  }
956
956
  return NaN;
957
957
  }
958
- function It(e, t, n = 0) {
958
+ function Ft(e, t, n = 0) {
959
959
  let r = n === void 0 ? 0 : F(n), i = Math.trunc(r);
960
960
  if (r < 0 || i > 4) return NaN;
961
961
  let a = P(e);
962
- if (!U(a)) return NaN;
962
+ if (!W(a)) return NaN;
963
963
  let o = P(t);
964
- return U(o) ? W(a, o, i) : NaN;
965
- }
966
- function Lt(e, t, n = !1) {
967
- if (!U(e) || !U(t)) return NaN;
968
- let r = Math.floor(e), i = Math.floor(t);
969
- return n ? (i >= r ? 1 : -1) * H(r, i, 4).days : function(e, t) {
970
- let n = V(e), r = V(t), i = n.year, a = n.month, o = n.day, s = r.year, c = r.month, l = r.day;
971
- return a === 2 ? V(e + 1).month === 3 && (o = 30) : o === 31 && (o = 30), l === 31 && (o < 30 ? (c === 12 ? (s += 1, c = 1) : c += 1, l = 1) : l = 30), ue(i, a, o, s, c, l);
972
- }(r, i);
973
- }
974
- var Rt = k({
975
- AMORLINC: () => Ut,
976
- DB: () => Vt,
977
- DDB: () => Ht,
978
- SLN: () => zt,
979
- SYD: () => Bt
964
+ return W(o) ? G(a, o, i) : NaN;
965
+ }
966
+ function It(e, t, n = !1) {
967
+ if (!W(e) || !W(t)) return NaN;
968
+ let r = .5 / 86400, i = Math.floor(e + r), a = Math.floor(t + r);
969
+ return n ? (a >= i ? 1 : -1) * U(i, a, 4).days : function(e, t) {
970
+ let n = H(e), r = H(t), i = n.year, a = n.month, o = n.day, s = r.year, c = r.month, l = r.day;
971
+ return a === 2 ? H(e + 1).month === 3 && (o = 30) : o === 31 && (o = 30), l === 31 && (o < 30 ? (c === 12 ? (s += 1, c = 1) : c += 1, l = 1) : l = 30), ce(i, a, o, s, c, l);
972
+ }(i, a);
973
+ }
974
+ var Lt = O({
975
+ AMORLINC: () => Ht,
976
+ DB: () => Bt,
977
+ DDB: () => Vt,
978
+ SLN: () => Rt,
979
+ SYD: () => zt
980
980
  });
981
- function zt(e, t, n) {
982
- if (C.formatResults(q(C.getRuntime())), n === 0) throw w.BuiltIn.Div0;
981
+ function Rt(e, t, n) {
982
+ if (S.formatResults(J(S.getRuntime())), n === 0) throw C.BuiltIn.Div0;
983
983
  return (e - t) / n;
984
984
  }
985
- function Bt(e, t, n, r) {
986
- if (C.formatResults(q(C.getRuntime())), t < 0 || n <= 0 || r <= 0 || r > n) return NaN;
985
+ function zt(e, t, n, r) {
986
+ if (S.formatResults(J(S.getRuntime())), t < 0 || n <= 0 || r <= 0 || r > n) return NaN;
987
987
  let i = n * (n + 1) / 2;
988
- if (!Number.isFinite(i)) throw w.BuiltIn.Div0;
988
+ if (!Number.isFinite(i)) throw C.BuiltIn.Div0;
989
989
  return (e - t) * (n + 1 - r) / i;
990
990
  }
991
- function Vt(e, t, n, r, i = 12) {
992
- if (C.formatResults(q(C.getRuntime())), e < 0 || t < 0 || n <= 0 || r <= 0) return NaN;
993
- let a = je(i);
991
+ function Bt(e, t, n, r, i = 12) {
992
+ if (S.formatResults(J(S.getRuntime())), e < 0 || t < 0 || n <= 0 || r <= 0) return NaN;
993
+ let a = ke(i);
994
994
  if (a < 1 || a > 12) return NaN;
995
- let o = je(n), s = je(r);
995
+ let o = ke(n), s = ke(r);
996
996
  if (s > o + +(a < 12)) return NaN;
997
997
  if (e === 0) return 0;
998
- let c = Me(1 - J(t / e, 1 / n), 3);
998
+ let c = Ae(1 - Y(t / e, 1 / n), 3);
999
999
  if (c === 0) return 0;
1000
1000
  let l = e * c * (a / 12), u = Math.max(s, 1);
1001
1001
  if (u === 1) return l;
@@ -1003,13 +1003,13 @@ function Vt(e, t, n, r, i = 12) {
1003
1003
  for (let e = 2; e < u; e++) d -= d * c;
1004
1004
  return u === o + 1 ? d / 12 * c * (12 - a) : d * c;
1005
1005
  }
1006
- function Ht(e, t, n, r, i = 2) {
1007
- if (C.formatResults(q(C.getRuntime())), e < 0 || t < 0 || n <= 0 || r <= 0 || r > n || i <= 0) return NaN;
1008
- let a = i / n, o = Math.max(r, 1) - 1, s = o === 0 ? e : e * J(1 - a, o), c = s * a;
1006
+ function Vt(e, t, n, r, i = 2) {
1007
+ if (S.formatResults(J(S.getRuntime())), e < 0 || t < 0 || n <= 0 || r <= 0 || r > n || i <= 0) return NaN;
1008
+ let a = i / n, o = Math.max(r, 1) - 1, s = o === 0 ? e : e * Y(1 - a, o), c = s * a;
1009
1009
  return Number.isFinite(c) ? (s - c < t && (c = s - t), Math.max(c, 0)) : NaN;
1010
1010
  }
1011
- function Ut(e, t, n, r, i, a, o = 0) {
1012
- let s = Ae(e, t, n, r, i, a, o);
1011
+ function Ht(e, t, n, r, i, a, o = 0) {
1012
+ let s = Oe(e, t, n, r, i, a, o);
1013
1013
  if (!s) return NaN;
1014
1014
  let { cost: c, salvage: l, periodIndex: u, rate: d, days: f, yearDays: p } = s, m = c * d;
1015
1015
  if (!Number.isFinite(m)) return 0;
@@ -1018,71 +1018,71 @@ function Ut(e, t, n, r, i, a, o = 0) {
1018
1018
  let _ = Math.floor((h - g) / m);
1019
1019
  return u <= _ ? m : u === _ + 1 ? (h - g) % m : 0;
1020
1020
  }
1021
- var Wt = k({
1022
- FVSCHEDULE: () => Gt,
1023
- PDURATION: () => qt,
1024
- RRI: () => Kt
1021
+ var Ut = O({
1022
+ FVSCHEDULE: () => Wt,
1023
+ PDURATION: () => Kt,
1024
+ RRI: () => Gt
1025
1025
  });
1026
- function Gt(e, t) {
1027
- if (e === void 0 || t === void 0) throw w.BuiltIn.NA;
1028
- let n = I(e), r = C.getArgs().getRawAt(1), i = r, a = !0 === i?.isIRange, o = a && i.size === 1 && !0 === i.isIReferenceRange;
1026
+ function Wt(e, t) {
1027
+ if (e === void 0 || t === void 0) throw C.BuiltIn.NA;
1028
+ let n = I(e), r = S.getArgs().getRawAt(1), i = r, a = !0 === i?.isIRange, o = a && i.size === 1 && !0 === i.isIReferenceRange;
1029
1029
  if (!a || o) n *= 1 + I(a ? i.getValueAt(0, 0) ?? null : r);
1030
1030
  else for (let e of t.values()) if (e != null) {
1031
- if (w.isError(e)) throw e;
1032
- if (typeof e != "number") throw w.BuiltIn.Value;
1031
+ if (C.isError(e)) throw e;
1032
+ if (typeof e != "number") throw C.BuiltIn.Value;
1033
1033
  n *= 1 + e;
1034
1034
  }
1035
1035
  return Number.isFinite(n) ? n : 0;
1036
1036
  }
1037
- function Kt(e, t, n) {
1037
+ function Gt(e, t, n) {
1038
1038
  if (e <= 0 || n < 0 && t > 0 || n > 0 && t < 0) return NaN;
1039
1039
  if (t === 0) return n === 0 ? 0 : NaN;
1040
- let r = J(n / t, 1 / e) - 1;
1040
+ let r = Y(n / t, 1 / e) - 1;
1041
1041
  return Number.isFinite(r) ? r : NaN;
1042
1042
  }
1043
- function qt(e, t, n) {
1043
+ function Kt(e, t, n) {
1044
1044
  if (e <= 0 || t <= 0 || n <= 0) return NaN;
1045
1045
  let r = Math.log(1 + e);
1046
- if (r === 0) throw w.BuiltIn.Div0;
1046
+ if (r === 0) throw C.BuiltIn.Div0;
1047
1047
  return (Math.log(n) - Math.log(t)) / r;
1048
1048
  }
1049
- function Jt(e, t, n, r) {
1049
+ function qt(e, t, n, r) {
1050
1050
  let i = e.map((e) => {
1051
1051
  let t = P(e);
1052
- if (!U(t)) throw w.BuiltIn.Num;
1052
+ if (!W(t)) throw C.BuiltIn.Num;
1053
1053
  return Math.floor(t);
1054
1054
  }), a = t.map(I), o = Math.trunc(I(n));
1055
- if (o !== 1 && o !== 2 && o !== 4) throw w.BuiltIn.Num;
1055
+ if (o !== 1 && o !== 2 && o !== 4) throw C.BuiltIn.Num;
1056
1056
  return {
1057
1057
  dates: i,
1058
1058
  numbers: a,
1059
1059
  frequency: o,
1060
- basis: G(r)
1060
+ basis: K(r)
1061
1061
  };
1062
1062
  }
1063
- var Yt = (e) => ce(e.y, e.m, e.d);
1064
- function Xt(e, t, n) {
1065
- let r = se(e), i = e.m - 1 + t * n, a = e.y + Math.floor(i / 12);
1066
- return i = (i % 12 + 12) % 12 + 1, ce(a, i, r ? z(a, i) : Math.min(e.d, z(a, i)));
1063
+ var Jt = (e) => oe(e.y, e.m, e.d);
1064
+ function Yt(e, t, n) {
1065
+ let r = B(e), i = e.m - 1 + t * n, a = e.y + Math.floor(i / 12);
1066
+ return i = (i % 12 + 12) % 12 + 1, oe(a, i, r ? z(a, i) : Math.min(e.d, z(a, i)));
1067
1067
  }
1068
- var Zt = (e, t) => 360 * (t.y - e.y) + 30 * (t.m - e.m) + (t.d - e.d);
1069
- function Qt(e, t) {
1068
+ var Xt = (e, t) => 360 * (t.y - e.y) + 30 * (t.m - e.m) + (t.d - e.d);
1069
+ function Zt(e, t) {
1070
1070
  return e !== 0 && e !== 4 ? (e, t) => t - e : (n, r) => {
1071
- let i = B(n), a = B(r);
1072
- return e === 4 ? (i.d === 31 && (i.d = 30), a.d === 31 && (a.d = 30), Zt(i, a)) : (se(i) && (i.d = 30), t && se(a) && (a.d = 30), Zt(i, a));
1071
+ let i = V(n), a = V(r);
1072
+ return e === 4 ? (i.d === 31 && (i.d = 30), a.d === 31 && (a.d = 30), Xt(i, a)) : (B(i) && (i.d = 30), t && B(a) && (a.d = 30), Xt(i, a));
1073
1073
  };
1074
1074
  }
1075
- function $t(e, t, n, r, i) {
1076
- let a = 12 / r, o = B(n), s = Qt(i, !1), c = Qt(i, !0), l = B(t);
1077
- for (; Yt(l) > n;) l = le(l, -a);
1078
- if (Yt(l) < 1) throw w.BuiltIn.Num;
1075
+ function Qt(e, t, n, r, i) {
1076
+ let a = 12 / r, o = V(n), s = Zt(i, !1), c = Zt(i, !0), l = V(t);
1077
+ for (; Jt(l) > n;) l = se(l, -a);
1078
+ if (Jt(l) < 1) throw C.BuiltIn.Num;
1079
1079
  let u = 1;
1080
- for (; Xt(o, u, a) < t;) u++;
1081
- if (Xt(o, u, a) > 2958465) throw w.BuiltIn.Num;
1080
+ for (; Yt(o, u, a) < t;) u++;
1081
+ if (Yt(o, u, a) > 2958465) throw C.BuiltIn.Num;
1082
1082
  let d = 0, f = 0, p = 0, m = n, h = o;
1083
1083
  for (let n = 0; n < u; n++) {
1084
- h = le(h, a);
1085
- let r = Yt(h), i = c(m, r);
1084
+ h = se(h, a);
1085
+ let r = Jt(h), i = c(m, r);
1086
1086
  e > m && (d += Math.min(s(m, Math.min(r, e)), i) / i), e < r && (p += Math.min(s(Math.max(m, e), Math.min(r, t)), i) / i), f += n + 1 === u ? (i - c(t, r)) / i : 1, m = r;
1087
1087
  }
1088
1088
  return {
@@ -1091,20 +1091,20 @@ function $t(e, t, n, r, i) {
1091
1091
  DSC: p
1092
1092
  };
1093
1093
  }
1094
- function en(e, t, n, r, i, a) {
1095
- if (_t(r, t, i) !== r) throw w.BuiltIn.Num;
1096
- let o = 12 / i, s = yt(n, r, i);
1097
- if (Number.isNaN(s)) throw w.BuiltIn.Num;
1098
- let c = [r], l = B(r);
1099
- for (let e = 0; e < s; e++) l = le(l, -o), c.push(Yt(l));
1100
- if (c[c.length - 1] < 1) throw w.BuiltIn.Num;
1101
- let u = (e, t) => H(e, t, a).days, d = wt(e, r, i, a);
1102
- if (Number.isNaN(d.N)) throw w.BuiltIn.Num;
1094
+ function $t(e, t, n, r, i, a) {
1095
+ if (gt(r, t, i) !== r) throw C.BuiltIn.Num;
1096
+ let o = 12 / i, s = vt(n, r, i);
1097
+ if (Number.isNaN(s)) throw C.BuiltIn.Num;
1098
+ let c = [r], l = V(r);
1099
+ for (let e = 0; e < s; e++) l = se(l, -o), c.push(Jt(l));
1100
+ if (c[c.length - 1] < 1) throw C.BuiltIn.Num;
1101
+ let u = (e, t) => U(e, t, a).days, d = Ct(e, r, i, a);
1102
+ if (Number.isNaN(d.N)) throw C.BuiltIn.Num;
1103
1103
  let f = d.E, p = u(n, r);
1104
- if (p === f) throw w.BuiltIn.Num;
1104
+ if (p === f) throw C.BuiltIn.Num;
1105
1105
  if (p < f) {
1106
- let a = yt(e, t, i) - 1;
1107
- if (Number.isNaN(a)) throw w.BuiltIn.Num;
1106
+ let a = vt(e, t, i) - 1;
1107
+ if (Number.isNaN(a)) throw C.BuiltIn.Num;
1108
1108
  return {
1109
1109
  N: a,
1110
1110
  A: u(n, e) / f,
@@ -1112,24 +1112,24 @@ function en(e, t, n, r, i, a) {
1112
1112
  u: u(e, r) / f
1113
1113
  };
1114
1114
  }
1115
- let m = yt(r, t, i), h = 0, g = 0;
1115
+ let m = vt(r, t, i), h = 0, g = 0;
1116
1116
  for (let t = 0; t < s; t++) {
1117
1117
  let r = c[s - t], o = c[s - t - 1], l = a === 1 ? o - r : a === 3 ? 365 / i : 360 / i, d = Math.max(r, n);
1118
1118
  e > d && o > d && (h += u(d, Math.min(o, e)) / l), g += t === 0 ? o > n ? u(n, o) / l : 0 : 1;
1119
1119
  }
1120
- let _ = B(e), v = ce(_.y, _.m, z(_.y, _.m)), y = v < r && vt(v - 1, r, i) === v, b = se(B(r)) && e !== v && !y ? 1 : 0;
1120
+ let _ = V(e), v = oe(_.y, _.m, z(_.y, _.m)), y = v < r && _t(v - 1, r, i) === v, b = B(V(r)) && e !== v && !y ? 1 : 0;
1121
1121
  return {
1122
1122
  N: m,
1123
1123
  A: h,
1124
1124
  DC: g,
1125
- u: d.N - 1 + b + (a === 2 || a === 3 ? vt(e, r, i) - e : d.DSC) / f
1125
+ u: d.N - 1 + b + (a === 2 || a === 3 ? _t(e, r, i) - e : d.DSC) / f
1126
1126
  };
1127
1127
  }
1128
- var tn = (e) => Number.isFinite(e) ? e : 0;
1129
- function nn(e, t, n) {
1128
+ var en = (e) => Number.isFinite(e) ? e : 0;
1129
+ function tn(e, t, n) {
1130
1130
  return (100 * e + (100 - t) / n) / ((100 + t) / 2 - (100 - t) / (4 * n));
1131
1131
  }
1132
- function rn(e, t, n) {
1132
+ function nn(e, t, n) {
1133
1133
  let r = e;
1134
1134
  for (let e = 0; e < 100; e++) {
1135
1135
  let e = n(r);
@@ -1141,23 +1141,23 @@ function rn(e, t, n) {
1141
1141
  }
1142
1142
  return r;
1143
1143
  }
1144
- var an = k({
1145
- ODDFPRICE: () => sn,
1146
- ODDFYIELD: () => cn,
1147
- ODDLPRICE: () => ln,
1148
- ODDLYIELD: () => un
1144
+ var rn = O({
1145
+ ODDFPRICE: () => on,
1146
+ ODDFYIELD: () => sn,
1147
+ ODDLPRICE: () => cn,
1148
+ ODDLYIELD: () => ln
1149
1149
  });
1150
- function on(e, t, n, r, i, a, o, s, c) {
1151
- let { N: l, A: u, DC: d, u: f } = en(e, t, n, r, s, c), p = a / s, m = 100 * i / s, h = J(1 + p, l + f);
1152
- if (!Number.isFinite(h)) throw w.BuiltIn.Num;
1150
+ function an(e, t, n, r, i, a, o, s, c) {
1151
+ let { N: l, A: u, DC: d, u: f } = $t(e, t, n, r, s, c), p = a / s, m = 100 * i / s, h = Y(1 + p, l + f);
1152
+ if (!Number.isFinite(h)) throw C.BuiltIn.Num;
1153
1153
  let g = 0;
1154
- for (let e = 1; e <= l; e++) g += m / J(1 + p, e + f);
1155
- let _ = o / h + m * d / J(1 + p, f) + g - m * u;
1156
- if (!Number.isFinite(_)) throw w.BuiltIn.Num;
1154
+ for (let e = 1; e <= l; e++) g += m / Y(1 + p, e + f);
1155
+ let _ = o / h + m * d / Y(1 + p, f) + g - m * u;
1156
+ if (!Number.isFinite(_)) throw C.BuiltIn.Num;
1157
1157
  return _;
1158
1158
  }
1159
- function sn(e, t, n, r, i, a, o, s, c = 0) {
1160
- let l = Jt([
1159
+ function on(e, t, n, r, i, a, o, s, c = 0) {
1160
+ let l = qt([
1161
1161
  e,
1162
1162
  t,
1163
1163
  n,
@@ -1167,11 +1167,11 @@ function sn(e, t, n, r, i, a, o, s, c = 0) {
1167
1167
  a,
1168
1168
  o
1169
1169
  ], s, c), [u, d, f, p] = l.dates, [m, h, g] = l.numbers;
1170
- if (!(f < u && u < p && p < d) || m < 0 || h < 0 || g <= 0) throw w.BuiltIn.Num;
1171
- return on(u, d, f, p, m, h, g, l.frequency, l.basis);
1170
+ if (!(f < u && u < p && p < d) || m < 0 || h < 0 || g <= 0) throw C.BuiltIn.Num;
1171
+ return an(u, d, f, p, m, h, g, l.frequency, l.basis);
1172
1172
  }
1173
- function cn(e, t, n, r, i, a, o, s, c = 0) {
1174
- let l = Jt([
1173
+ function sn(e, t, n, r, i, a, o, s, c = 0) {
1174
+ let l = qt([
1175
1175
  e,
1176
1176
  t,
1177
1177
  n,
@@ -1181,25 +1181,25 @@ function cn(e, t, n, r, i, a, o, s, c = 0) {
1181
1181
  a,
1182
1182
  o
1183
1183
  ], s, c), [u, d, f, p] = l.dates, [m, h, g] = l.numbers;
1184
- if (!(f < u && u < p && p < d) || m < 0 || h <= 0 || g <= 0) throw w.BuiltIn.Num;
1185
- en(u, d, f, p, l.frequency, l.basis);
1186
- let _ = rn(nn(m, h, de(u, d, l.basis)), (e) => {
1184
+ if (!(f < u && u < p && p < d) || m < 0 || h <= 0 || g <= 0) throw C.BuiltIn.Num;
1185
+ $t(u, d, f, p, l.frequency, l.basis);
1186
+ let _ = nn(tn(m, h, le(u, d, l.basis)), (e) => {
1187
1187
  try {
1188
- return on(u, d, f, p, m, e, g, l.frequency, l.basis) - h;
1188
+ return an(u, d, f, p, m, e, g, l.frequency, l.basis) - h;
1189
1189
  } catch {
1190
1190
  return NaN;
1191
1191
  }
1192
1192
  }, (e) => function(e, t, n, r, i, a, o, s, c) {
1193
- let { N: l, DC: u, u: d } = en(e, t, n, r, s, c), f = 1 + a / s, p = 100 * i / s, m = -o * (l + d) / s / J(f, l + d + 1);
1194
- m += -p * u * d / s / J(f, d + 1);
1195
- for (let e = 1; e <= l; e++) m += -p * (e + d) / s / J(f, e + d + 1);
1193
+ let { N: l, DC: u, u: d } = $t(e, t, n, r, s, c), f = 1 + a / s, p = 100 * i / s, m = -o * (l + d) / s / Y(f, l + d + 1);
1194
+ m += -p * u * d / s / Y(f, d + 1);
1195
+ for (let e = 1; e <= l; e++) m += -p * (e + d) / s / Y(f, e + d + 1);
1196
1196
  return m;
1197
1197
  }(u, d, f, p, m, e, g, l.frequency, l.basis));
1198
- if (!Number.isFinite(_)) throw w.BuiltIn.Num;
1198
+ if (!Number.isFinite(_)) throw C.BuiltIn.Num;
1199
1199
  return _;
1200
1200
  }
1201
- function ln(e, t, n, r, i, a, o, s = 0) {
1202
- let c = Jt([
1201
+ function cn(e, t, n, r, i, a, o, s = 0) {
1202
+ let c = qt([
1203
1203
  e,
1204
1204
  t,
1205
1205
  n
@@ -1208,12 +1208,12 @@ function ln(e, t, n, r, i, a, o, s = 0) {
1208
1208
  i,
1209
1209
  a
1210
1210
  ], o, s), [l, u, d] = c.dates, [f, p, m] = c.numbers;
1211
- if (!(d < l && l < u) || f < 0 || p < 0 || m <= 0) throw w.BuiltIn.Num;
1212
- let { A: h, DC: g, DSC: _ } = $t(l, u, d, c.frequency, c.basis), v = 100 * f / c.frequency;
1213
- return (m + tn(v * g)) / (1 + p / c.frequency * _) - tn(v * h);
1211
+ if (!(d < l && l < u) || f < 0 || p < 0 || m <= 0) throw C.BuiltIn.Num;
1212
+ let { A: h, DC: g, DSC: _ } = Qt(l, u, d, c.frequency, c.basis), v = 100 * f / c.frequency;
1213
+ return (m + en(v * g)) / (1 + p / c.frequency * _) - en(v * h);
1214
1214
  }
1215
- function un(e, t, n, r, i, a, o, s = 0) {
1216
- let c = Jt([
1215
+ function ln(e, t, n, r, i, a, o, s = 0) {
1216
+ let c = qt([
1217
1217
  e,
1218
1218
  t,
1219
1219
  n
@@ -1222,145 +1222,134 @@ function un(e, t, n, r, i, a, o, s = 0) {
1222
1222
  i,
1223
1223
  a
1224
1224
  ], o, s), [l, u, d] = c.dates, [f, p, m] = c.numbers;
1225
- if (!(d < l && l < u) || f < 0 || p <= 0 || m <= 0) throw w.BuiltIn.Num;
1226
- let { A: h, DC: g, DSC: _ } = $t(l, u, d, c.frequency, c.basis), v = 100 * f / c.frequency, y = m + tn(v * g), b = p + tn(v * h);
1225
+ if (!(d < l && l < u) || f < 0 || p <= 0 || m <= 0) throw C.BuiltIn.Num;
1226
+ let { A: h, DC: g, DSC: _ } = Qt(l, u, d, c.frequency, c.basis), v = 100 * f / c.frequency, y = m + en(v * g), b = p + en(v * h);
1227
1227
  return (y - b) / b * (c.frequency / _);
1228
1228
  }
1229
- var dn = k({ STOCKHISTORY: () => fn });
1230
- function fn(e, t, n, r = 0, i = 1, a = [
1231
- 0,
1232
- 1,
1233
- 2,
1234
- 3,
1235
- 4
1236
- ]) {
1237
- let o = n ?? t;
1238
- if (!C.isValidDate(t) || !C.isValidDate(o)) throw w.BuiltIn.Num;
1239
- }
1240
- var pn = k({
1241
- DURATION: () => hn,
1242
- MDURATION: () => gn,
1243
- PRICE: () => mn,
1244
- YIELD: () => _n
1229
+ var un = O({
1230
+ DURATION: () => fn,
1231
+ MDURATION: () => pn,
1232
+ PRICE: () => dn,
1233
+ YIELD: () => mn
1245
1234
  });
1246
- function mn(e, t, n, r, i, a, o = 0) {
1247
- let s = ye(e, t, [
1235
+ function dn(e, t, n, r, i, a, o = 0) {
1236
+ let s = _e(e, t, [
1248
1237
  n,
1249
1238
  r,
1250
1239
  i
1251
1240
  ], a, o), [c, l, u] = s.numbers;
1252
- if (c < 0 || l < 0 || u <= 0) throw w.BuiltIn.Num;
1253
- return Tt(s.settlement, s.maturity, c, l, u, s.frequency, s.basis);
1241
+ if (c < 0 || l < 0 || u <= 0) throw C.BuiltIn.Num;
1242
+ return wt(s.settlement, s.maturity, c, l, u, s.frequency, s.basis);
1254
1243
  }
1255
- function hn(e, t, n, r, i, a = 0) {
1256
- let o = ye(e, t, [n, r], i, a, !0), [s, c] = o.numbers;
1257
- if (s < 0 || c < 0) throw w.BuiltIn.Num;
1258
- return Et(o.settlement, o.maturity, s, c, o.frequency, o.basis);
1244
+ function fn(e, t, n, r, i, a = 0) {
1245
+ let o = _e(e, t, [n, r], i, a, !0), [s, c] = o.numbers;
1246
+ if (s < 0 || c < 0) throw C.BuiltIn.Num;
1247
+ return Tt(o.settlement, o.maturity, s, c, o.frequency, o.basis);
1259
1248
  }
1260
- function gn(e, t, n, r, i, a = 0) {
1261
- let o = ye(e, t, [n, r], i, a, !0), [s, c] = o.numbers;
1262
- if (s < 0 || c < 0) throw w.BuiltIn.Num;
1263
- return Et(o.settlement, o.maturity, s, c, o.frequency, o.basis) / (1 + c / o.frequency);
1249
+ function pn(e, t, n, r, i, a = 0) {
1250
+ let o = _e(e, t, [n, r], i, a, !0), [s, c] = o.numbers;
1251
+ if (s < 0 || c < 0) throw C.BuiltIn.Num;
1252
+ return Tt(o.settlement, o.maturity, s, c, o.frequency, o.basis) / (1 + c / o.frequency);
1264
1253
  }
1265
- function _n(e, t, n, r, i, a, o = 0) {
1266
- let s = ye(e, t, [
1254
+ function mn(e, t, n, r, i, a, o = 0) {
1255
+ let s = _e(e, t, [
1267
1256
  n,
1268
1257
  r,
1269
1258
  i
1270
1259
  ], a, o), [c, l, u] = s.numbers;
1271
- if (c < 0 || l <= 0 || u <= 0) throw w.BuiltIn.Num;
1272
- let { settlement: d, maturity: f, frequency: p, basis: m } = s, h = wt(d, f, p, m);
1273
- if (Number.isNaN(h.N)) throw w.BuiltIn.Num;
1260
+ if (c < 0 || l <= 0 || u <= 0) throw C.BuiltIn.Num;
1261
+ let { settlement: d, maturity: f, frequency: p, basis: m } = s, h = Ct(d, f, p, m);
1262
+ if (Number.isNaN(h.N)) throw C.BuiltIn.Num;
1274
1263
  if (h.N > 1) {
1275
- let e = rn(nn(c, l, de(d, f, m)), (e) => Tt(d, f, c, e, u, p, m) - l, (e) => function(e, t, n, r, i, a, o) {
1276
- let { N: s, A: c, E: l, DSC: u } = wt(e, t, a, o);
1264
+ let e = nn(tn(c, l, le(d, f, m)), (e) => wt(d, f, c, e, u, p, m) - l, (e) => function(e, t, n, r, i, a, o) {
1265
+ let { N: s, A: c, E: l, DSC: u } = Ct(e, t, a, o);
1277
1266
  if (Number.isNaN(s)) return NaN;
1278
1267
  let d = 100 * n / a, f = 1 + r / a, p = -i * (s - 1 + u / l) / a / f ** (s + u / l);
1279
1268
  for (let e = 1; e <= s; e++) p += -d * (e - 1 + u / l) / a / f ** (e + u / l);
1280
1269
  return p;
1281
1270
  }(d, f, c, e, u, p, m));
1282
- if (Number.isNaN(e)) throw w.BuiltIn.Num;
1271
+ if (Number.isNaN(e)) throw C.BuiltIn.Num;
1283
1272
  return e;
1284
1273
  }
1285
- let g = h.A, _ = H(d, f, m).days, v = m === 1 || m === 2 || m === 3 ? g + _ : h.E, y = l / 100 + g / v * (c / p);
1286
- return K((u / 100 + c / p - y) / y * p * (v / _));
1287
- }
1288
- var vn = k({
1289
- DISC: () => yn,
1290
- INTRATE: () => Sn,
1291
- PRICEDISC: () => bn,
1292
- PRICEMAT: () => wn,
1293
- RECEIVED: () => Cn,
1294
- YIELDDISC: () => xn,
1295
- YIELDMAT: () => Tn
1274
+ let g = h.A, _ = U(d, f, m).days, v = m === 1 || m === 2 || m === 3 ? g + _ : h.E, y = l / 100 + g / v * (c / p);
1275
+ return q((u / 100 + c / p - y) / y * p * (v / _));
1276
+ }
1277
+ var hn = O({
1278
+ DISC: () => gn,
1279
+ INTRATE: () => yn,
1280
+ PRICEDISC: () => _n,
1281
+ PRICEMAT: () => xn,
1282
+ RECEIVED: () => bn,
1283
+ YIELDDISC: () => vn,
1284
+ YIELDMAT: () => Sn
1296
1285
  });
1297
- function yn(e, t, n, r, i = 0) {
1298
- let a = ge(e, t, n, r, i), o = (1 - a.x / a.y) / W(a.settlement, a.maturity, a.basis);
1286
+ function gn(e, t, n, r, i = 0) {
1287
+ let a = me(e, t, n, r, i), o = (1 - a.x / a.y) / G(a.settlement, a.maturity, a.basis);
1299
1288
  return Number.isFinite(o) ? o : NaN;
1300
1289
  }
1301
- function bn(e, t, n, r, i = 0) {
1302
- let a = ge(e, t, n, r, i), o = a.y - a.x * a.y * W(a.settlement, a.maturity, a.basis);
1290
+ function _n(e, t, n, r, i = 0) {
1291
+ let a = me(e, t, n, r, i), o = a.y - a.x * a.y * G(a.settlement, a.maturity, a.basis);
1303
1292
  return Number.isFinite(o) ? o : NaN;
1304
1293
  }
1305
- function xn(e, t, n, r, i = 0) {
1306
- let a = ge(e, t, n, r, i), o = (a.y - a.x) / a.x / W(a.settlement, a.maturity, a.basis);
1294
+ function vn(e, t, n, r, i = 0) {
1295
+ let a = me(e, t, n, r, i), o = (a.y - a.x) / a.x / G(a.settlement, a.maturity, a.basis);
1307
1296
  return Number.isFinite(o) ? o : NaN;
1308
1297
  }
1309
- function Sn(e, t, n, r, i = 0) {
1310
- let a = ge(e, t, n, r, i), o = (a.y - a.x) / a.x / W(a.settlement, a.maturity, a.basis);
1298
+ function yn(e, t, n, r, i = 0) {
1299
+ let a = me(e, t, n, r, i), o = (a.y - a.x) / a.x / G(a.settlement, a.maturity, a.basis);
1311
1300
  return Number.isFinite(o) ? o : NaN;
1312
1301
  }
1313
- function Cn(e, t, n, r, i = 0) {
1314
- let a = ge(e, t, n, r, i), o = 1 - a.y * W(a.settlement, a.maturity, a.basis);
1315
- if (!(o > 0)) throw w.BuiltIn.Num;
1302
+ function bn(e, t, n, r, i = 0) {
1303
+ let a = me(e, t, n, r, i), o = 1 - a.y * G(a.settlement, a.maturity, a.basis);
1304
+ if (!(o > 0)) throw C.BuiltIn.Num;
1316
1305
  return a.x / o;
1317
1306
  }
1318
- function wn(e, t, n, r, i, a = 0) {
1319
- let o = ve(e, t, n, r, i, a);
1320
- if (o.rate < 0 || o.x < 0) throw w.BuiltIn.Num;
1321
- return (100 + K(o.DIM / o.B * o.rate * 100)) / (1 + o.DSM / o.B * o.x) - K(o.A / o.B * o.rate * 100);
1307
+ function xn(e, t, n, r, i, a = 0) {
1308
+ let o = ge(e, t, n, r, i, a);
1309
+ if (o.rate < 0 || o.x < 0) throw C.BuiltIn.Num;
1310
+ return (100 + q(o.DIM / o.B * o.rate * 100)) / (1 + o.DSM / o.B * o.x) - q(o.A / o.B * o.rate * 100);
1322
1311
  }
1323
- function Tn(e, t, n, r, i, a = 0) {
1324
- let o = ve(e, t, n, r, i, a);
1325
- if (o.rate < 0 || o.x <= 0) throw w.BuiltIn.Num;
1312
+ function Sn(e, t, n, r, i, a = 0) {
1313
+ let o = ge(e, t, n, r, i, a);
1314
+ if (o.rate < 0 || o.x <= 0) throw C.BuiltIn.Num;
1326
1315
  return ((1 + o.DIM / o.B * o.rate) / (o.x / 100 + o.A / o.B * o.rate) - 1) / (o.DSM / o.B);
1327
1316
  }
1328
- var En = k({
1329
- TBILLEQ: () => kn,
1330
- TBILLPRICE: () => Dn,
1331
- TBILLYIELD: () => On
1317
+ var Cn = O({
1318
+ TBILLEQ: () => En,
1319
+ TBILLPRICE: () => wn,
1320
+ TBILLYIELD: () => Tn
1332
1321
  });
1333
- function Dn(e, t, n) {
1334
- let r = _e(e, t, n), i = 100 * (1 - K(r.x * r.days) / 360);
1335
- if (i < 0) throw w.BuiltIn.Num;
1322
+ function wn(e, t, n) {
1323
+ let r = he(e, t, n), i = 100 * (1 - q(r.x * r.days) / 360);
1324
+ if (i < 0) throw C.BuiltIn.Num;
1336
1325
  return i;
1337
1326
  }
1338
- function On(e, t, n) {
1339
- let r = _e(e, t, n);
1327
+ function Tn(e, t, n) {
1328
+ let r = he(e, t, n);
1340
1329
  return (100 - r.x) / r.x * 360 / r.days;
1341
1330
  }
1342
- function kn(e, t, n) {
1343
- let r = _e(e, t, n), i = K(r.x * r.days);
1331
+ function En(e, t, n) {
1332
+ let r = he(e, t, n), i = q(r.x * r.days);
1344
1333
  if (r.days <= 182) {
1345
1334
  let e = 360 - i;
1346
- if (!(e > 0)) throw w.BuiltIn.Num;
1347
- return K(365 * r.x) / e;
1335
+ if (!(e > 0)) throw C.BuiltIn.Num;
1336
+ return q(365 * r.x) / e;
1348
1337
  }
1349
1338
  let a = 1 - i / 360;
1350
- if (!(a > 0)) throw w.BuiltIn.Num;
1339
+ if (!(a > 0)) throw C.BuiltIn.Num;
1351
1340
  let o = r.days / (r.days > 365 ? 366 : 365);
1352
1341
  return (-2 * o + 2 * Math.sqrt(o * o - (2 * o - 1) * (1 - 1 / a))) / (2 * o - 1);
1353
1342
  }
1354
- var An = k({ VDB: () => Mn }), jn = 1e7;
1355
- function Mn(e, t, n, r, i, a = 2, o = !1) {
1356
- if (C.formatResults(q(C.getRuntime())), e < 0 || t < 0 || n < 0 || a < 0 || r < 0 || i > n || r > i) return NaN;
1357
- if (n === 0) throw w.BuiltIn.Div0;
1343
+ var Dn = O({ VDB: () => kn }), On = 1e7;
1344
+ function kn(e, t, n, r, i, a = 2, o = !1) {
1345
+ if (S.formatResults(J(S.getRuntime())), e < 0 || t < 0 || n < 0 || a < 0 || r < 0 || i > n || r > i) return NaN;
1346
+ if (n === 0) throw C.BuiltIn.Div0;
1358
1347
  if (r === i) return 0;
1359
1348
  let s = a / n;
1360
1349
  if (o) return function(e, t, n, r, i, a) {
1361
1350
  let o = Math.floor(r) + 1, s = Math.ceil(i), c = 0;
1362
1351
  for (let n = o; n <= s; n++) {
1363
- let l = Nn(n === 1 ? e : e * J(1 - a, n - 1), a, t);
1352
+ let l = An(n === 1 ? e : e * Y(1 - a, n - 1), a, t);
1364
1353
  if (Number.isNaN(l)) return NaN;
1365
1354
  l = Math.max(l, 0), n === o ? l *= Math.min(i, o) - r : n === s && (l *= i - (s - 1)), c += l;
1366
1355
  }
@@ -1369,7 +1358,7 @@ function Mn(e, t, n, r, i, a = 2, o = !1) {
1369
1358
  let c = function(e, t, n, r, i) {
1370
1359
  let a = Math.floor(i), o = i - a, s = e, c = !1, l = 0;
1371
1360
  if (o > 0) {
1372
- let e = Nn(s, r, t);
1361
+ let e = An(s, r, t);
1373
1362
  if (Number.isNaN(e)) return NaN;
1374
1363
  let i;
1375
1364
  if (l = (s - t) / n, l > e && l > 0) i = l * o;
@@ -1379,12 +1368,12 @@ function Mn(e, t, n, r, i, a = 2, o = !1) {
1379
1368
  }
1380
1369
  s -= i;
1381
1370
  }
1382
- if (a > jn) return s * J(1 - r, a);
1371
+ if (a > On) return s * Y(1 - r, a);
1383
1372
  for (let e = 1; e <= a; e++) {
1384
1373
  let i;
1385
1374
  if (c) i = l;
1386
1375
  else {
1387
- if (i = Nn(s, r, t), Number.isNaN(i)) return NaN;
1376
+ if (i = An(s, r, t), Number.isNaN(i)) return NaN;
1388
1377
  l = (s - t) / (n - (o + e - 1)), l > i && l > 0 && (c = !0, i = l);
1389
1378
  }
1390
1379
  s -= i;
@@ -1397,7 +1386,7 @@ function Mn(e, t, n, r, i, a = 2, o = !1) {
1397
1386
  let u;
1398
1387
  if (s) u = c;
1399
1388
  else {
1400
- if (u = Nn(e, r, t), Number.isNaN(u)) return NaN;
1389
+ if (u = An(e, r, t), Number.isNaN(u)) return NaN;
1401
1390
  c = (e - t) / (n - (l - 1)), c > u && c > 0 && (s = !0, u = c);
1402
1391
  }
1403
1392
  o += l === a ? u * (i - (a - 1)) : u, e -= u;
@@ -1405,10 +1394,10 @@ function Mn(e, t, n, r, i, a = 2, o = !1) {
1405
1394
  return o;
1406
1395
  }(c, t, n - r, s, i - r);
1407
1396
  }
1408
- var Nn = (e, t, n) => {
1397
+ var An = (e, t, n) => {
1409
1398
  let r = e * t;
1410
1399
  return Number.isFinite(r) ? e - r < n ? e - n : r : NaN;
1411
- }, Z = () => w.BuiltIn.Value, Pn = (e, t) => {
1400
+ }, Z = () => C.BuiltIn.Value, jn = (e, t) => {
1412
1401
  let n, r = !1;
1413
1402
  if (!0 === e?.isIFunction) n = [e];
1414
1403
  else {
@@ -1460,12 +1449,12 @@ var Nn = (e, t, n) => {
1460
1449
  vertical: r,
1461
1450
  named: n.length > 1
1462
1451
  } : Z();
1463
- }, Fn = (e, t, n) => {
1452
+ }, Mn = (e, t, n) => {
1464
1453
  let r;
1465
1454
  try {
1466
1455
  r = e.twoArgs ? e.fn.execute(t, n()) : e.fn.execute(t);
1467
1456
  } catch (e) {
1468
- if (w.isError(e)) return e;
1457
+ if (C.isError(e)) return e;
1469
1458
  throw e;
1470
1459
  }
1471
1460
  if (!0 === r?.isIRange) {
@@ -1473,23 +1462,23 @@ var Nn = (e, t, n) => {
1473
1462
  return !0 === e.isIReferenceRange && e.size === 1 ? e.getValueAt(0, 0) : Z();
1474
1463
  }
1475
1464
  return r ?? null;
1476
- }, In = (e, t) => {
1465
+ }, Nn = (e, t) => {
1477
1466
  let n = e;
1478
- if (n === void 0) n = +!!Rn(t);
1467
+ if (n === void 0) n = +!!Fn(t);
1479
1468
  else if (!Number.isInteger(n) || n < 0 || n > 3) return Z();
1480
1469
  return {
1481
1470
  hasHeader: n === 1 || n === 3,
1482
1471
  show: n === 2 || n === 3
1483
1472
  };
1484
- }, Ln = (e) => w.isError(e) ? "error" : typeof e, Rn = (e) => {
1473
+ }, Pn = (e) => C.isError(e) ? "error" : typeof e, Fn = (e) => {
1485
1474
  if (e.getRowCount() < 2) return !1;
1486
1475
  let t = e.getColumnCount();
1487
1476
  for (let n = 0; n < t; n++) {
1488
1477
  let t = e.getValueAt(0, n), r = e.getValueAt(1, n);
1489
- if (t !== null && r !== null && Ln(t) !== Ln(r)) return !0;
1478
+ if (t !== null && r !== null && Pn(t) !== Pn(r)) return !0;
1490
1479
  }
1491
1480
  return !1;
1492
- }, zn = (e, t) => Number.isInteger(e) && Math.abs(e) <= t, Bn = (e, t, n) => {
1481
+ }, In = (e, t) => Number.isInteger(e) && Math.abs(e) <= t, Ln = (e, t, n) => {
1493
1482
  let r = Array(t).fill(1);
1494
1483
  if (!e) return {
1495
1484
  keyDirections: r,
@@ -1520,14 +1509,14 @@ var Nn = (e, t, n) => {
1520
1509
  keyDirections: r,
1521
1510
  byValue: null
1522
1511
  };
1523
- }, Vn = (e) => e.size === 1 && !0 === e.isIReferenceRange && e.getValueAt(0, 0) === null, Hn = (e, t) => {
1512
+ }, Rn = (e) => e.size === 1 && !0 === e.isIReferenceRange && e.getValueAt(0, 0) === null, zn = (e, t) => {
1524
1513
  if (e.getColumnCount() !== 1 || e.getRowCount() !== t) return !1;
1525
1514
  for (let t of e.entries()) {
1526
1515
  let e = typeof t.value;
1527
1516
  if (e !== "boolean" && e !== "number") return !1;
1528
1517
  }
1529
1518
  return !0;
1530
- }, Un = class {
1519
+ }, Bn = class {
1531
1520
  constructor(e, t) {
1532
1521
  let n = e.getColumnCount(), r = e.getRowCount(), i = t ? { filter: t } : void 0, a = Array(n), o = Array(n);
1533
1522
  for (let t = 0; t < n; t++) {
@@ -1537,7 +1526,7 @@ var Nn = (e, t, n) => {
1537
1526
  colStart: 0,
1538
1527
  colEnd: t
1539
1528
  });
1540
- o[t] = s, a[t] = C.createGrouping(s, i);
1529
+ o[t] = s, a[t] = S.createGrouping(s, i);
1541
1530
  }
1542
1531
  let s = [], c = [];
1543
1532
  for (let e = 0; e < n; e++) {
@@ -1563,7 +1552,7 @@ var Nn = (e, t, n) => {
1563
1552
  return t === null ? this.groupings[this.fieldCount - 1].getMembers(e) : this.groupings[t.level].getMembers(e, [t.group]);
1564
1553
  }
1565
1554
  sort(e, t, n) {
1566
- let r = (t, n, r) => Wn(t.keys[r], n.keys[r], e.keyDirections[r]), i = e.byValue, a = (e, n) => Gn(t(e), t(n), i.direction);
1555
+ let r = (t, n, r) => Vn(t.keys[r], n.keys[r], e.keyDirections[r]), i = e.byValue, a = (e, n) => Hn(t(e), t(n), i.direction);
1567
1556
  if (n) {
1568
1557
  let e = [], t = (n) => {
1569
1558
  for (let r of n) r.children.length === 0 ? e.push(r) : t(r.children);
@@ -1622,10 +1611,10 @@ var Nn = (e, t, n) => {
1622
1611
  }
1623
1612
  return n;
1624
1613
  }
1625
- }, Wn = (e, t, n) => e === null || t === null ? e === t ? 0 : e === null ? 1 : -1 : n * C.compare(e, t), Gn = (e, t, n) => {
1626
- let r = w.isError(e), i = w.isError(t);
1627
- return r || i ? r && i ? 0 : r ? 1 : -1 : n * C.compare(e, t);
1628
- }, Kn = (e) => `Row Field ${e + 1}`, qn = (e) => `Column Field ${e + 1}`, Jn = (e) => `Value ${e + 1}`, Yn = (e) => {
1614
+ }, Vn = (e, t, n) => e === null || t === null ? e === t ? 0 : e === null ? 1 : -1 : n * S.compare(e, t), Hn = (e, t, n) => {
1615
+ let r = C.isError(e), i = C.isError(t);
1616
+ return r || i ? r && i ? 0 : r ? 1 : -1 : n * S.compare(e, t);
1617
+ }, Un = (e) => `Row Field ${e + 1}`, Wn = (e) => `Column Field ${e + 1}`, Gn = (e) => `Value ${e + 1}`, Kn = (e) => {
1629
1618
  let t = e.getColumnCount();
1630
1619
  if (t === 1) return [e];
1631
1620
  let n = e.getRowCount(), r = Array(t);
@@ -1641,38 +1630,38 @@ var Nn = (e, t, n) => {
1641
1630
  rowEnd: e.getRowCount() - 1,
1642
1631
  colStart: 0,
1643
1632
  colEnd: e.getColumnCount() - 1
1644
- }), Xn = k({ GROUPBY: () => Zn });
1645
- function Zn(e, t, n, r, i = 1, a, o, s = 0) {
1646
- if (e.getRowCount() !== t.getRowCount() || Vn(t)) return w.BuiltIn.Value;
1647
- let c = Pn(n, t.getColumnCount());
1648
- if (w.isError(c)) return c;
1649
- let l = In(r, t);
1650
- if (w.isError(l)) return l;
1633
+ }), qn = O({ GROUPBY: () => Jn });
1634
+ function Jn(e, t, n, r, i = 1, a, o, s = 0) {
1635
+ if (e.getRowCount() !== t.getRowCount() || Rn(t)) return C.BuiltIn.Value;
1636
+ let c = jn(n, t.getColumnCount());
1637
+ if (C.isError(c)) return c;
1638
+ let l = Nn(r, t);
1639
+ if (C.isError(l)) return l;
1651
1640
  let u = e.getColumnCount(), d = i;
1652
- if (!zn(d, u) || s !== 0 && s !== 1) return w.BuiltIn.Value;
1641
+ if (!In(d, u) || s !== 0 && s !== 1) return C.BuiltIn.Value;
1653
1642
  let f = s === 1;
1654
- if ((f || c.vertical) && Math.abs(d) > 1 || o && !Hn(o, e.getRowCount())) return w.BuiltIn.Value;
1655
- let { measures: p, vertical: m } = c, h = t.getColumnCount(), g = Bn(a, u, m ? h : p.length);
1656
- if (w.isError(g)) return g;
1643
+ if ((f || c.vertical) && Math.abs(d) > 1 || o && !zn(o, e.getRowCount())) return C.BuiltIn.Value;
1644
+ let { measures: p, vertical: m } = c, h = t.getColumnCount(), g = Ln(a, u, m ? h : p.length);
1645
+ if (C.isError(g)) return g;
1657
1646
  let _ = e, v = t, y = o, b = null, x = null;
1658
1647
  if (l.hasHeader) {
1659
- if (_.getRowCount() < 2) return w.BuiltIn.Value;
1660
- b = Qn(_), x = Qn(v), _ = Q(_), v = Q(v), y &&= Q(y);
1648
+ if (_.getRowCount() < 2) return C.BuiltIn.Value;
1649
+ b = Yn(_), x = Yn(v), _ = Q(_), v = Q(v), y &&= Q(y);
1661
1650
  }
1662
- let S = new Un(_, y);
1663
- if (S.getRecordCount() === 0) return w.BuiltIn.Value;
1664
- let T = Yn(v), E = Array(T.length), D = /* @__PURE__ */ new Map(), O = (e) => {
1651
+ let w = new Bn(_, y);
1652
+ if (w.getRecordCount() === 0) return C.BuiltIn.Value;
1653
+ let T = Kn(v), E = Array(T.length), D = /* @__PURE__ */ new Map(), O = (e) => {
1665
1654
  let t = D.get(e);
1666
- return t || (t = p.map((t) => (m ? T.map((e, t) => t) : [t.column]).map((n) => Fn(t, S.getMembers(T[n], e), ((e) => () => E[e] ??= S.getMembers(T[e], null))(n)))), D.set(e, t), t);
1667
- }, k = g.byValue, ee = S.sort(g, (e) => m ? O(e)[0][k.measure] : O(e)[k.measure][0], f), te = f ? er(ee, d) : S.lines(ee, d), A = [];
1655
+ return t || (t = p.map((t) => (m ? T.map((e, t) => t) : [t.column]).map((n) => Mn(t, w.getMembers(T[n], e), ((e) => () => E[e] ??= w.getMembers(T[e], null))(n)))), D.set(e, t), t);
1656
+ }, k = g.byValue, ee = w.sort(g, (e) => m ? O(e)[0][k.measure] : O(e)[k.measure][0], f), te = f ? Zn(ee, d) : w.lines(ee, d), A = [];
1668
1657
  if (m) {
1669
1658
  l.show && A.push([
1670
- ...$n(b, u),
1659
+ ...Xn(b, u),
1671
1660
  "",
1672
- ...T.map((e, t) => x ? x[t] : Jn(t))
1661
+ ...T.map((e, t) => x ? x[t] : Gn(t))
1673
1662
  ]);
1674
1663
  for (let e of te) {
1675
- let t = S.keyCells(e, d), n = O(e.node);
1664
+ let t = w.keyCells(e, d), n = O(e.node);
1676
1665
  for (let e = 0; e < p.length; e++) A.push([
1677
1666
  ...t,
1678
1667
  p[e].label,
@@ -1680,24 +1669,24 @@ function Zn(e, t, n, r, i = 1, a, o, s = 0) {
1680
1669
  ]);
1681
1670
  }
1682
1671
  } else {
1683
- c.named && A.push([...Array(u).fill(""), ...p.map((e) => e.label)]), l.show && A.push([...$n(b, u), ...p.map((e) => x ? x[e.column] : Jn(e.column))]);
1672
+ c.named && A.push([...Array(u).fill(""), ...p.map((e) => e.label)]), l.show && A.push([...Xn(b, u), ...p.map((e) => x ? x[e.column] : Gn(e.column))]);
1684
1673
  for (let e of te) {
1685
- let t = S.keyCells(e, d);
1674
+ let t = w.keyCells(e, d);
1686
1675
  for (let n of O(e.node)) t.push(n[0]);
1687
1676
  A.push(t);
1688
1677
  }
1689
1678
  }
1690
- return C.createRange(A.length, A[0].length, A);
1679
+ return S.createRange(A.length, A[0].length, A);
1691
1680
  }
1692
- var Qn = (e) => {
1681
+ var Yn = (e) => {
1693
1682
  let t = e.getColumnCount(), n = Array(t);
1694
1683
  for (let r = 0; r < t; r++) n[r] = e.getValueAt(0, r);
1695
1684
  return n;
1696
- }, $n = (e, t) => {
1685
+ }, Xn = (e, t) => {
1697
1686
  let n = Array(t);
1698
- for (let r = 0; r < t; r++) n[r] = e ? e[r] : Kn(r);
1687
+ for (let r = 0; r < t; r++) n[r] = e ? e[r] : Un(r);
1699
1688
  return n;
1700
- }, er = (e, t) => {
1689
+ }, Zn = (e, t) => {
1701
1690
  let n = e.map((e) => ({
1702
1691
  kind: "group",
1703
1692
  node: e
@@ -1709,30 +1698,30 @@ var Qn = (e) => {
1709
1698
  kind: "total",
1710
1699
  node: null
1711
1700
  }), n;
1712
- }, tr = k({ PIVOTBY: () => nr });
1713
- function nr(e, t, n, r, i, a = 1, o, s = 1, c, l, u = 0) {
1701
+ }, Qn = O({ PIVOTBY: () => $n });
1702
+ function $n(e, t, n, r, i, a = 1, o, s = 1, c, l, u = 0) {
1714
1703
  let d = n.getRowCount();
1715
- if (!e && !t || Vn(n) || e && e.getRowCount() !== d || t && t.getRowCount() !== d) return w.BuiltIn.Value;
1716
- let f = Pn(r, n.getColumnCount());
1717
- if (w.isError(f)) return f;
1718
- let p = In(i, n);
1719
- if (w.isError(p)) return p;
1704
+ if (!e && !t || Rn(n) || e && e.getRowCount() !== d || t && t.getRowCount() !== d) return C.BuiltIn.Value;
1705
+ let f = jn(r, n.getColumnCount());
1706
+ if (C.isError(f)) return f;
1707
+ let p = Nn(i, n);
1708
+ if (C.isError(p)) return p;
1720
1709
  let m = e ? e.getColumnCount() : 0, h = t ? t.getColumnCount() : 0, g = e ? a : 0, _ = t ? s : 0;
1721
- if (e && !zn(g, m) || t && !zn(_, h) || f.vertical && Math.abs(g) > 1 || !Number.isInteger(u) || u < 0 || u > 4 || l && !Hn(l, d)) return w.BuiltIn.Value;
1722
- let { measures: v, vertical: y } = f, b = n.getColumnCount(), x = y ? b : v.length, S = Bn(o, m, x);
1723
- if (w.isError(S)) return S;
1724
- let T = Bn(c, h, x);
1725
- if (w.isError(T)) return T;
1710
+ if (e && !In(g, m) || t && !In(_, h) || f.vertical && Math.abs(g) > 1 || !Number.isInteger(u) || u < 0 || u > 4 || l && !zn(l, d)) return C.BuiltIn.Value;
1711
+ let { measures: v, vertical: y } = f, b = n.getColumnCount(), x = y ? b : v.length, w = Ln(o, m, x);
1712
+ if (C.isError(w)) return w;
1713
+ let T = Ln(c, h, x);
1714
+ if (C.isError(T)) return T;
1726
1715
  let E = e, D = t, O = n, k = l, ee = null, te = null, A = null;
1727
1716
  if (p.hasHeader) {
1728
- if (d < 2) return w.BuiltIn.Value;
1729
- E &&= (ee = rr(E), Q(E)), D &&= (te = rr(D), Q(D)), A = rr(O), O = Q(O), k &&= Q(k);
1717
+ if (d < 2) return C.BuiltIn.Value;
1718
+ E &&= (ee = er(E), Q(E)), D &&= (te = er(D), Q(D)), A = er(O), O = Q(O), k &&= Q(k);
1730
1719
  }
1731
- let j = E ? new Un(E, k) : null, M = D ? new Un(D, k) : null;
1732
- if ((j ?? M).getRecordCount() === 0) return w.BuiltIn.Value;
1733
- let N = new ir(j, M, Yn(O), k), ne = (e, t, n, r) => {
1720
+ let j = E ? new Bn(E, k) : null, M = D ? new Bn(D, k) : null;
1721
+ if ((j ?? M).getRecordCount() === 0) return C.BuiltIn.Value;
1722
+ let N = new tr(j, M, Kn(O), k), ne = (e, t, n, r) => {
1734
1723
  let i = N.members(e, t, r);
1735
- return i ? Fn(n, i, () => {
1724
+ return i ? Mn(n, i, () => {
1736
1725
  switch (u) {
1737
1726
  case 0: return N.members(null, t, r);
1738
1727
  case 1: return N.members(e, null, r);
@@ -1741,56 +1730,56 @@ function nr(e, t, n, r, i, a = 1, o, s = 1, c, l, u = 0) {
1741
1730
  default: return N.members(null, null, r);
1742
1731
  }
1743
1732
  }) : "";
1744
- }, re = (e) => (t, n) => y ? ne(t, n, v[0], e.measure) : ne(t, n, v[e.measure], v[e.measure].column), ie = [{
1733
+ }, re = (e) => (t, n) => y ? ne(t, n, v[0], e.measure) : ne(t, n, v[e.measure], v[e.measure].column), P = [{
1745
1734
  kind: "total",
1746
1735
  node: null
1747
- }], P = j ? j.lines(j.sort(S, (e) => re(S.byValue)(e, null), !1), g) : ie, F = M ? M.lines(M.sort(T, (e) => re(T.byValue)(null, e), !1), _) : ie, I = [];
1748
- for (let e of F) if (y) for (let t = 0; t < b; t++) I.push({
1736
+ }], F = j ? j.lines(j.sort(w, (e) => re(w.byValue)(e, null), !1), g) : P, I = M ? M.lines(M.sort(T, (e) => re(T.byValue)(null, e), !1), _) : P, L = [];
1737
+ for (let e of I) if (y) for (let t = 0; t < b; t++) L.push({
1749
1738
  line: e,
1750
1739
  measure: -1,
1751
1740
  column: t
1752
1741
  });
1753
- else for (let t = 0; t < v.length; t++) I.push({
1742
+ else for (let t = 0; t < v.length; t++) L.push({
1754
1743
  line: e,
1755
1744
  measure: t,
1756
1745
  column: v[t].column
1757
1746
  });
1758
- let ae = !!M && !f.named && b > 1, oe = m + +!!y, L = () => Array(oe).fill(""), R = [];
1747
+ let ie = !!M && !f.named && b > 1, R = m + +!!y, ae = () => Array(R).fill(""), z = [];
1759
1748
  if (p.show && M) {
1760
1749
  let e = [];
1761
- for (let t = 0; t < h; t++) e.push(te ? String(te[t] ?? "") : qn(t));
1762
- R.push([
1763
- ...L(),
1750
+ for (let t = 0; t < h; t++) e.push(te ? String(te[t] ?? "") : Wn(t));
1751
+ z.push([
1752
+ ...ae(),
1764
1753
  e.join(", "),
1765
- ...Array(I.length - 1).fill("")
1754
+ ...Array(L.length - 1).fill("")
1766
1755
  ]);
1767
1756
  }
1768
1757
  if (M) {
1769
- let e = I.map((e) => M.keyCells(e.line, _));
1770
- for (let t = 0; t < h; t++) R.push([...L(), ...e.map((e) => e[t])]);
1758
+ let e = L.map((e) => M.keyCells(e.line, _));
1759
+ for (let t = 0; t < h; t++) z.push([...ae(), ...e.map((e) => e[t])]);
1771
1760
  }
1772
- if (f.named && !y && R.push([...L(), ...I.map((e) => v[e.measure].label)]), p.show) {
1761
+ if (f.named && !y && z.push([...ae(), ...L.map((e) => v[e.measure].label)]), p.show) {
1773
1762
  let e = [];
1774
- for (let t = 0; t < m; t++) e.push(ee ? ee[t] : Kn(t));
1775
- y && e.push(""), R.push([...e, ...I.map((e) => A ? A[e.column] : Jn(e.column))]);
1763
+ for (let t = 0; t < m; t++) e.push(ee ? ee[t] : Un(t));
1764
+ y && e.push(""), z.push([...e, ...L.map((e) => A ? A[e.column] : Gn(e.column))]);
1776
1765
  }
1777
- let z = (e, t) => I.map((n) => ae && n.line.kind !== "group" ? "" : ne(e, n.line.node, t ?? v[n.measure], n.column));
1778
- for (let e of P) {
1766
+ let B = (e, t) => L.map((n) => ie && n.line.kind !== "group" ? "" : ne(e, n.line.node, t ?? v[n.measure], n.column));
1767
+ for (let e of F) {
1779
1768
  let t = j ? j.keyCells(e, g) : [];
1780
- if (y) for (let n of v) R.push([
1769
+ if (y) for (let n of v) z.push([
1781
1770
  ...t,
1782
1771
  n.label,
1783
- ...z(e.node, n)
1772
+ ...B(e.node, n)
1784
1773
  ]);
1785
- else R.push([...t, ...z(e.node, null)]);
1774
+ else z.push([...t, ...B(e.node, null)]);
1786
1775
  }
1787
- return C.createRange(R.length, R[0].length, R);
1776
+ return S.createRange(z.length, z[0].length, z);
1788
1777
  }
1789
- var rr = (e) => {
1778
+ var er = (e) => {
1790
1779
  let t = e.getColumnCount(), n = Array(t);
1791
1780
  for (let r = 0; r < t; r++) n[r] = e.getValueAt(0, r);
1792
1781
  return n;
1793
- }, ir = class {
1782
+ }, tr = class {
1794
1783
  constructor(e, t, n, r) {
1795
1784
  this._rows = e, this._cols = t, this._columns = n, this._filter = r, this._crossed = /* @__PURE__ */ new Map();
1796
1785
  }
@@ -1805,7 +1794,7 @@ var rr = (e) => {
1805
1794
  _cross(e, t) {
1806
1795
  let n = `${e},${t}`, r = this._crossed.get(n);
1807
1796
  if (r) return r;
1808
- let i = this._rows, a = this._cols, o = i.prefixes[e].concat(a.prefixes[t], T.Axis.Column), s = C.createGrouping(o, this._filter ? { filter: this._filter } : void 0), c = i.groupings[e], l = a.groupings[t], u = l.getGroupCount(), d = /* @__PURE__ */ new Map();
1797
+ let i = this._rows, a = this._cols, o = i.prefixes[e].concat(a.prefixes[t], w.Axis.Column), s = S.createGrouping(o, this._filter ? { filter: this._filter } : void 0), c = i.groupings[e], l = a.groupings[t], u = l.getGroupCount(), d = /* @__PURE__ */ new Map();
1809
1798
  for (let e = 0; e < s.getGroupCount(); e++) {
1810
1799
  let t = s.getFirstRecord(e);
1811
1800
  d.set(c.getGroup(t) * u + l.getGroup(t), e);
@@ -1815,34 +1804,34 @@ var rr = (e) => {
1815
1804
  groupOf: d
1816
1805
  }, this._crossed.set(n, r), r;
1817
1806
  }
1818
- }, ar = k({
1819
- FORECAST_ETS: () => or,
1820
- FORECAST_ETS_CONFINT: () => sr,
1821
- FORECAST_ETS_SEASONALITY: () => cr,
1822
- FORECAST_ETS_STAT: () => lr
1807
+ }, nr = O({
1808
+ FORECAST_ETS: () => rr,
1809
+ FORECAST_ETS_CONFINT: () => ir,
1810
+ FORECAST_ETS_SEASONALITY: () => ar,
1811
+ FORECAST_ETS_STAT: () => or
1823
1812
  });
1824
- function or(e, t, n, r = 1, i = 1, a = 1) {
1825
- let o = pr(t, n, i, a);
1826
- if (w.isError(o)) return o;
1813
+ function rr(e, t, n, r = 1, i = 1, a = 1) {
1814
+ let o = ur(t, n, i, a);
1815
+ if (C.isError(o)) return o;
1827
1816
  let { values: s, stepSize: c, lastTime: l, firstTime: u } = o;
1828
- if ((e - u) / c <= -.999) return w.BuiltIn.Num;
1817
+ if ((e - u) / c <= -.999) return C.BuiltIn.Num;
1829
1818
  let d = (e - l) / c;
1830
- if (d > 2147483647) return w.BuiltIn.Num;
1831
- let f = gr(s, r);
1832
- if (w.isError(f)) return f;
1833
- let { alpha: p, beta: m, gamma: h, period: g, b0: _ } = f, { L: v, T: y, S: b, finalIndex: x } = hr(s, p, m, h, g, _).finalState, S = v + d * y;
1819
+ if (d > 2147483647) return C.BuiltIn.Num;
1820
+ let f = pr(s, r);
1821
+ if (C.isError(f)) return f;
1822
+ let { alpha: p, beta: m, gamma: h, period: g, b0: _ } = f, { L: v, T: y, S: b, finalIndex: x } = fr(s, p, m, h, g, _).finalState, S = v + d * y;
1834
1823
  return g > 1 && (S += b[((x + Math.round(d)) % g + g) % g]), S;
1835
1824
  }
1836
- function sr(e, t, n, r = .95, i = 1, a = 1, o = 1) {
1837
- if (r < 0 || r >= 1) return w.BuiltIn.Num;
1838
- let s = pr(t, n, a, o);
1839
- if (w.isError(s)) return s;
1825
+ function ir(e, t, n, r = .95, i = 1, a = 1, o = 1) {
1826
+ if (r < 0 || r >= 1) return C.BuiltIn.Num;
1827
+ let s = ur(t, n, a, o);
1828
+ if (C.isError(s)) return s;
1840
1829
  let { values: c, stepSize: l, lastTime: u } = s;
1841
- if (e <= u) return w.BuiltIn.Num;
1830
+ if (e <= u) return C.BuiltIn.Num;
1842
1831
  let d = Math.round((e - u) / l);
1843
- if (d > 2147483647) return w.BuiltIn.Num;
1844
- let f = gr(c, i);
1845
- if (w.isError(f)) return f;
1832
+ if (d > 2147483647) return C.BuiltIn.Num;
1833
+ let f = pr(c, i);
1834
+ if (C.isError(f)) return f;
1846
1835
  let { alpha: p, beta: m, gamma: h, period: g, b0: _ } = f, v = function(e, t, n, r, i, a) {
1847
1836
  let o = e.length, s, c, l = Array(Math.max(1, i)).fill(0);
1848
1837
  if (i > 1 && o >= 2 * i) {
@@ -1869,27 +1858,27 @@ function sr(e, t, n, r = .95, i = 1, a = 1, o = 1) {
1869
1858
  return a;
1870
1859
  }(p, h, g, d);
1871
1860
  return function(e) {
1872
- let t = (1 + e) / 2, n = C.getFunction("NORM.S.INV");
1861
+ let t = (1 + e) / 2, n = S.getFunction("NORM.S.INV");
1873
1862
  if (n) return n.execute(t);
1874
1863
  let r = Math.sqrt(-2 * Math.log(1 - t));
1875
1864
  return r - (2.515517 + .802853 * r + .010328 * r * r) / (1 + 1.432788 * r + .189269 * r * r + .001308 * r * r * r);
1876
1865
  }(r) * v * Math.sqrt(y);
1877
1866
  }
1878
- function cr(e, t, n = 1, r = 1) {
1879
- let i = pr(e, t, n, r);
1880
- if (w.isError(i)) return i;
1867
+ function ar(e, t, n = 1, r = 1) {
1868
+ let i = ur(e, t, n, r);
1869
+ if (C.isError(i)) return i;
1881
1870
  let { values: a } = i;
1882
- return a.length < 4 ? 0 : mr(a);
1871
+ return a.length < 4 ? 0 : dr(a);
1883
1872
  }
1884
- function lr(e, t, n, r = 1, i = 1, a = 1) {
1885
- let o = dr(n);
1886
- if (o === null || o < 1 || o > 8) return w.BuiltIn.Num;
1887
- let s = pr(e, t, i, a);
1888
- if (w.isError(s)) return s;
1873
+ function or(e, t, n, r = 1, i = 1, a = 1) {
1874
+ let o = cr(n);
1875
+ if (o === null || o < 1 || o > 8) return C.BuiltIn.Num;
1876
+ let s = ur(e, t, i, a);
1877
+ if (C.isError(s)) return s;
1889
1878
  let { values: c, stepSize: l } = s;
1890
1879
  if (o === 8) return l;
1891
- let u = gr(c, r);
1892
- if (w.isError(u)) return u;
1880
+ let u = pr(c, r);
1881
+ if (C.isError(u)) return u;
1893
1882
  let { alpha: d, beta: f, gamma: p, period: m, b0: h } = u;
1894
1883
  switch (o) {
1895
1884
  case 1: return d;
@@ -1928,9 +1917,9 @@ function lr(e, t, n, r = 1, i = 1, a = 1) {
1928
1917
  if (o === 7) return e.rmse;
1929
1918
  }
1930
1919
  }
1931
- return w.BuiltIn.Num;
1920
+ return C.BuiltIn.Num;
1932
1921
  }
1933
- function ur(e, t) {
1922
+ function sr(e, t) {
1934
1923
  let n = e.map((e) => e.value);
1935
1924
  switch (t) {
1936
1925
  case 1: return n.reduce((e, t) => e + t, 0) / n.length;
@@ -1946,43 +1935,43 @@ function ur(e, t) {
1946
1935
  default: return n.reduce((e, t) => e + t, 0);
1947
1936
  }
1948
1937
  }
1949
- function dr(e) {
1938
+ function cr(e) {
1950
1939
  return Number.isInteger(e) ? e : null;
1951
1940
  }
1952
- var fr = 8784;
1953
- function pr(e, t, n, r) {
1954
- let i = dr(n);
1955
- if (i !== 0 && i !== 1) return w.BuiltIn.Num;
1956
- let a = dr(r);
1957
- if (a === null || a < 1 || a > 7) return w.BuiltIn.Num;
1941
+ var lr = 8784;
1942
+ function ur(e, t, n, r) {
1943
+ let i = cr(n);
1944
+ if (i !== 0 && i !== 1) return C.BuiltIn.Num;
1945
+ let a = cr(r);
1946
+ if (a === null || a < 1 || a > 7) return C.BuiltIn.Num;
1958
1947
  let o = e.flatten(), s = t.flatten();
1959
- if (o.getRowCount() !== s.getRowCount()) return w.BuiltIn.NA;
1948
+ if (o.getRowCount() !== s.getRowCount()) return C.BuiltIn.NA;
1960
1949
  if (e.hasError()) return e.firstError();
1961
1950
  if (t.hasError()) return t.firstError();
1962
- if (o.getRowCount() < 2) return w.BuiltIn.Div0;
1951
+ if (o.getRowCount() < 2) return C.BuiltIn.Div0;
1963
1952
  let c = [];
1964
1953
  for (let [[e, t]] of o.alignValues([s])) typeof e == "number" && typeof t == "number" && c.push({
1965
1954
  time: t,
1966
1955
  value: e
1967
1956
  });
1968
- if (c.sort((e, t) => e.time - t.time), c.length < 2) return w.BuiltIn.Div0;
1957
+ if (c.sort((e, t) => e.time - t.time), c.length < 2) return C.BuiltIn.Div0;
1969
1958
  let l = [], u = [c[0]];
1970
1959
  for (let e = 1; e < c.length; e++) {
1971
1960
  let t = c[e];
1972
1961
  t.time === c[e - 1].time ? u.push(t) : (l.push({
1973
1962
  time: u[0].time,
1974
- value: ur(u, a)
1963
+ value: sr(u, a)
1975
1964
  }), u = [t]);
1976
1965
  }
1977
1966
  if (l.push({
1978
1967
  time: u[0].time,
1979
- value: ur(u, a)
1980
- }), l.length < 2) return w.BuiltIn.Div0;
1968
+ value: sr(u, a)
1969
+ }), l.length < 2) return C.BuiltIn.Div0;
1981
1970
  let d = [];
1982
1971
  for (let e = 1; e < l.length; e++) d.push(l[e].time - l[e - 1].time);
1983
1972
  d.sort((e, t) => e - t);
1984
1973
  let f = Math.floor(d.length / 2), p = d.length % 2 == 0 ? (d[f - 1] + d[f]) / 2 : d[f];
1985
- if (p <= 0) return w.BuiltIn.Num;
1974
+ if (p <= 0) return C.BuiltIn.Num;
1986
1975
  let m = [l[0].value];
1987
1976
  for (let e = 1; e < l.length; e++) {
1988
1977
  let t = l[e - 1].time, n = l[e].time, r = t + p;
@@ -1993,7 +1982,7 @@ function pr(e, t, n, r) {
1993
1982
  let n = l[e - 1].value, i = l[e].value;
1994
1983
  m.push(n + t / (r + 1) * (i - n));
1995
1984
  }
1996
- } else if (Math.abs(n - r) > .01 * p) return w.BuiltIn.Num;
1985
+ } else if (Math.abs(n - r) > .01 * p) return C.BuiltIn.Num;
1997
1986
  m.push(l[e].value);
1998
1987
  }
1999
1988
  return {
@@ -2003,7 +1992,7 @@ function pr(e, t, n, r) {
2003
1992
  firstTime: l[0].time
2004
1993
  };
2005
1994
  }
2006
- function mr(e) {
1995
+ function dr(e) {
2007
1996
  let t = e.length;
2008
1997
  if (t < 4) return 0;
2009
1998
  let n = e.reduce((e, t) => e + t, 0) / t, r = 0;
@@ -2018,7 +2007,7 @@ function mr(e) {
2018
2007
  }
2019
2008
  return a;
2020
2009
  }
2021
- function hr(e, t, n, r, i, a) {
2010
+ function fr(e, t, n, r, i, a) {
2022
2011
  let o = e.length, s, c;
2023
2012
  if (i > 1 && o >= 2 * i) {
2024
2013
  let t = 0, n = 0;
@@ -2052,16 +2041,16 @@ function hr(e, t, n, r, i, a) {
2052
2041
  }
2053
2042
  };
2054
2043
  }
2055
- function gr(e, t) {
2056
- let n = dr(t);
2057
- if (n === null || n < 0 || n > fr) return w.BuiltIn.Num;
2044
+ function pr(e, t) {
2045
+ let n = cr(t);
2046
+ if (n === null || n < 0 || n > lr) return C.BuiltIn.Num;
2058
2047
  let r = 1;
2059
- n === 1 ? (r = mr(e), r <= 1 && (r = 1)) : n > 1 && (r = n), r > 1 && e.length < 2 * r && (r = 1);
2048
+ n === 1 ? (r = dr(e), r <= 1 && (r = 1)) : n > 1 && (r = n), r > 1 && e.length < 2 * r && (r = 1);
2060
2049
  let i = e.length;
2061
2050
  if (r === 1) {
2062
- let t = Math.max(1, Math.floor(i / 4)), n = vr((t) => {
2051
+ let t = Math.max(1, Math.floor(i / 4)), n = hr((t) => {
2063
2052
  let n = Math.max(.001, Math.min(.999, t[0])), r = Math.max(.001, Math.min(.999, t[1])), i = t[2];
2064
- return hr(e, n, r, 0, 1, i).mse;
2053
+ return fr(e, n, r, 0, 1, i).mse;
2065
2054
  }, [
2066
2055
  .9,
2067
2056
  .1,
@@ -2075,7 +2064,7 @@ function gr(e, t) {
2075
2064
  b0: n[2]
2076
2065
  };
2077
2066
  }
2078
- let a = vr((t) => hr(e, Math.max(.001, Math.min(.999, t[0])), Math.max(.001, Math.min(.999, t[1])), Math.max(.001, Math.min(.999, t[2])), r).mse, [
2067
+ let a = hr((t) => fr(e, Math.max(.001, Math.min(.999, t[0])), Math.max(.001, Math.min(.999, t[1])), Math.max(.001, Math.min(.999, t[2])), r).mse, [
2079
2068
  .9,
2080
2069
  .1,
2081
2070
  .1
@@ -2088,10 +2077,10 @@ function gr(e, t) {
2088
2077
  b0: 0
2089
2078
  };
2090
2079
  }
2091
- function _r(e, t, n, r, i) {
2080
+ function mr(e, t, n, r, i) {
2092
2081
  for (let a = 0; a < e.length; ++a) e[a] = t * n[a] + r * i[a];
2093
2082
  }
2094
- function vr(e, t, n) {
2083
+ function hr(e, t, n) {
2095
2084
  let r = (n ||= {}).maxIterations || 200 * t.length, i = n.nonZeroDelta || 1.05, a = n.zeroDelta || .001, o = n.minErrorDelta || 1e-6, s = n.minTolerance || 1e-5, c = n.rho === void 0 ? 1 : n.rho, l = n.chi === void 0 ? 2 : n.chi, u = n.psi === void 0 ? -.5 : n.psi, d = n.sigma === void 0 ? .5 : n.sigma, f, p = t.length, m = Array(p + 1);
2096
2085
  m[0] = t, m[0].fx = e(t), m[0].id = 0;
2097
2086
  for (let n = 0; n < p; ++n) {
@@ -2124,12 +2113,12 @@ function vr(e, t, n) {
2124
2113
  _[e] /= p;
2125
2114
  }
2126
2115
  let t = m[p];
2127
- if (_r(v, 1 + c, _, -c, t), v.fx = e(v), v.fx < m[0].fx) _r(b, 1 + l, _, -l, t), b.fx = e(b), h(b.fx < v.fx ? b : v);
2116
+ if (mr(v, 1 + c, _, -c, t), v.fx = e(v), v.fx < m[0].fx) mr(b, 1 + l, _, -l, t), b.fx = e(b), h(b.fx < v.fx ? b : v);
2128
2117
  else if (v.fx >= m[p - 1].fx) {
2129
2118
  let n = !1;
2130
- if (v.fx > t.fx ? (_r(y, 1 + u, _, -u, t), y.fx = e(y), y.fx < t.fx ? h(y) : n = !0) : (_r(y, 1 - u * c, _, u * c, t), y.fx = e(y), y.fx < v.fx ? h(y) : n = !0), n) {
2119
+ if (v.fx > t.fx ? (mr(y, 1 + u, _, -u, t), y.fx = e(y), y.fx < t.fx ? h(y) : n = !0) : (mr(y, 1 - u * c, _, u * c, t), y.fx = e(y), y.fx < v.fx ? h(y) : n = !0), n) {
2131
2120
  if (d >= 1) break;
2132
- for (let t = 1; t < m.length; ++t) _r(m[t], 1 - d, m[0], d, m[t]), m[t].fx = e(m[t]);
2121
+ for (let t = 1; t < m.length; ++t) mr(m[t], 1 - d, m[0], d, m[t]), m[t].fx = e(m[t]);
2133
2122
  }
2134
2123
  } else h(v);
2135
2124
  }
@@ -2138,15 +2127,15 @@ function vr(e, t, n) {
2138
2127
  x: m[0]
2139
2128
  };
2140
2129
  }
2141
- var yr = Object.freeze({ includeEmpty: !0 }), br = (Object.freeze({ axis: T.Axis.Column }), Object.freeze({ axis: T.Axis.Row }), Object.freeze({
2142
- type: E.Number,
2143
- axis: T.Axis.Row
2144
- })), xr = (e, t, n = !1) => {
2130
+ var gr = Object.freeze({ includeEmpty: !0 }), _r = (Object.freeze({ axis: w.Axis.Column }), Object.freeze({ axis: w.Axis.Row }), Object.freeze({
2131
+ type: T.Number,
2132
+ axis: w.Axis.Row
2133
+ })), vr = (e, t, n = !1) => {
2145
2134
  let r = e.getRowCount(), i = e.getColumnCount(), a = r * i;
2146
- if (a === 0) throw w.BuiltIn.Value;
2135
+ if (a === 0) throw C.BuiltIn.Value;
2147
2136
  let o = r === 1, s = r > 1 && i > 1;
2148
2137
  if (!t || t.size === 0) {
2149
- let t = Dr(e, a, n), c = Array(a);
2138
+ let t = wr(e, a, n), c = Array(a);
2150
2139
  for (let e = 0; e < a; e++) c[e] = [e + 1];
2151
2140
  return {
2152
2141
  ys: t,
@@ -2160,8 +2149,8 @@ var yr = Object.freeze({ includeEmpty: !0 }), br = (Object.freeze({ axis: T.Axis
2160
2149
  }
2161
2150
  let c = t.getRowCount(), l = t.getColumnCount();
2162
2151
  if (s) {
2163
- if (c !== r || l !== i) throw w.BuiltIn.Ref;
2164
- let u = Dr(e, a, n), d = Dr(t, a), f = Array(a);
2152
+ if (c !== r || l !== i) throw C.BuiltIn.Ref;
2153
+ let u = wr(e, a, n), d = wr(t, a), f = Array(a);
2165
2154
  for (let e = 0; e < a; e++) f[e] = [d[e]];
2166
2155
  return {
2167
2156
  ys: u,
@@ -2173,32 +2162,32 @@ var yr = Object.freeze({ includeEmpty: !0 }), br = (Object.freeze({ axis: T.Axis
2173
2162
  yCols: i
2174
2163
  };
2175
2164
  }
2176
- if ((o ? l : c) !== a) throw w.BuiltIn.Ref;
2165
+ if ((o ? l : c) !== a) throw C.BuiltIn.Ref;
2177
2166
  let u = o ? c : l;
2178
2167
  return {
2179
- ys: Dr(e, a, n),
2180
- xs: Or(t, a, u, o),
2168
+ ys: wr(e, a, n),
2169
+ xs: Tr(t, a, u, o),
2181
2170
  k: u,
2182
2171
  isRowOriented: o,
2183
2172
  isRectangularY: s,
2184
2173
  yRows: r,
2185
2174
  yCols: i
2186
2175
  };
2187
- }, Sr = (e, t, n) => {
2176
+ }, yr = (e, t, n) => {
2188
2177
  if (e === void 0) return n(t);
2189
2178
  if (e === null) return n(!1);
2190
2179
  if (typeof e == "boolean") return n(e);
2191
- if (Array.isArray(e)) throw w.BuiltIn.Value;
2192
- return n(Cr(((e) => {
2180
+ if (Array.isArray(e)) throw C.BuiltIn.Value;
2181
+ return n(br(((e) => {
2193
2182
  let t = e.getRowCount(), n = e.getColumnCount();
2194
- if (t === 1 && n === 1 || !C.isImplicitIntersect()) return e.getValueAt(0, 0);
2195
- let r = e.getCoords(), i = C.getRow() - r.rowStart, a = C.getColumn() - r.colStart, o = i >= 0 && i < t, s = a >= 0 && a < n;
2183
+ if (t === 1 && n === 1 || !S.isImplicitIntersect()) return e.getValueAt(0, 0);
2184
+ let r = e.getCoords(), i = S.getRow() - r.rowStart, a = S.getColumn() - r.colStart, o = i >= 0 && i < t, s = a >= 0 && a < n;
2196
2185
  if (o && s) return e.getValueAt(i, a);
2197
2186
  if (o && n === 1) return e.getValueAt(i, 0);
2198
2187
  if (s && t === 1) return e.getValueAt(0, a);
2199
- throw w.BuiltIn.Value;
2188
+ throw C.BuiltIn.Value;
2200
2189
  })(e)));
2201
- }, Cr = (e) => {
2190
+ }, br = (e) => {
2202
2191
  if (e == null) return !1;
2203
2192
  if (typeof e == "boolean") return e;
2204
2193
  if (typeof e == "number") return !(e > -22250738585072014e-324 && e < 22250738585072014e-324);
@@ -2206,17 +2195,17 @@ var yr = Object.freeze({ includeEmpty: !0 }), br = (Object.freeze({ axis: T.Axis
2206
2195
  let t = e.toUpperCase();
2207
2196
  if (t === "TRUE") return !0;
2208
2197
  if (t === "FALSE") return !1;
2209
- throw w.BuiltIn.Value;
2198
+ throw C.BuiltIn.Value;
2210
2199
  }
2211
- throw w.BuiltIn.Value;
2212
- }, wr = (e, t, n) => {
2200
+ throw C.BuiltIn.Value;
2201
+ }, xr = (e, t, n) => {
2213
2202
  let r, i, a;
2214
2203
  if (t && t.size > 0) {
2215
2204
  let n = ((e, t) => {
2216
2205
  let n = e.getRowCount(), r = e.getColumnCount(), i = n * r;
2217
- if (i === 0) throw w.BuiltIn.Ref;
2206
+ if (i === 0) throw C.BuiltIn.Ref;
2218
2207
  if (t.k === 1) {
2219
- let t = Dr(e, i), a = Array(i);
2208
+ let t = wr(e, i), a = Array(i);
2220
2209
  for (let e = 0; e < i; e++) a[e] = [t[e]];
2221
2210
  return {
2222
2211
  xs: a,
@@ -2225,9 +2214,9 @@ var yr = Object.freeze({ includeEmpty: !0 }), br = (Object.freeze({ axis: T.Axis
2225
2214
  };
2226
2215
  }
2227
2216
  let a = t.isRowOriented ? r : n;
2228
- if ((t.isRowOriented ? n : r) !== t.k) throw w.BuiltIn.Ref;
2217
+ if ((t.isRowOriented ? n : r) !== t.k) throw C.BuiltIn.Ref;
2229
2218
  return {
2230
- xs: Or(e, a, t.k, t.isRowOriented),
2219
+ xs: Tr(e, a, t.k, t.isRowOriented),
2231
2220
  rows: t.isRowOriented ? 1 : a,
2232
2221
  cols: t.isRowOriented ? a : 1
2233
2222
  };
@@ -2241,7 +2230,7 @@ var yr = Object.freeze({ includeEmpty: !0 }), br = (Object.freeze({ axis: T.Axis
2241
2230
  o[e] = t;
2242
2231
  }
2243
2232
  return o;
2244
- }, Tr = (e, t, n) => {
2233
+ }, Sr = (e, t, n) => {
2245
2234
  let r = e.length, i = t.length > 0 ? t[0].length : 0, a = [], o = [];
2246
2235
  n && (a.push(Array(r).fill(1)), o.push(i));
2247
2236
  for (let e = i - 1; e >= 0; e--) {
@@ -2251,20 +2240,20 @@ var yr = Object.freeze({ includeEmpty: !0 }), br = (Object.freeze({ axis: T.Axis
2251
2240
  }
2252
2241
  let s = [], c = [], l = [];
2253
2242
  for (let e = 0; e < a.length; e++) {
2254
- let t = a[e].slice(), n = Math.sqrt(kr(t, t)), i = Array(c.length).fill(0);
2243
+ let t = a[e].slice(), n = Math.sqrt(Er(t, t)), i = Array(c.length).fill(0);
2255
2244
  for (let e = 0; e < 2; e++) for (let e = 0; e < c.length; e++) {
2256
- let n = kr(c[e], t);
2245
+ let n = Er(c[e], t);
2257
2246
  for (let i = 0; i < r; i++) t[i] -= n * c[e][i];
2258
2247
  i[e] += n;
2259
2248
  }
2260
- let o = Math.sqrt(kr(t, t));
2249
+ let o = Math.sqrt(Er(t, t));
2261
2250
  if (!(o <= 1e-10 * (n || 1))) {
2262
2251
  for (let e = 0; e < r; e++) t[e] /= o;
2263
2252
  i.push(o), c.push(t), l.push(i), s.push(e);
2264
2253
  }
2265
2254
  }
2266
2255
  let u = s.length, d = Array(u);
2267
- for (let t = 0; t < u; t++) d[t] = kr(c[t], e);
2256
+ for (let t = 0; t < u; t++) d[t] = Er(c[t], e);
2268
2257
  let f = Array(u).fill(0);
2269
2258
  for (let e = u - 1; e >= 0; e--) {
2270
2259
  let t = d[e];
@@ -2319,8 +2308,8 @@ var yr = Object.freeze({ includeEmpty: !0 }), br = (Object.freeze({ axis: T.Axis
2319
2308
  ssResid: _,
2320
2309
  predict: g
2321
2310
  };
2322
- }, Er = (e, t, n) => {
2323
- let r = t.length, i = w.BuiltIn.NA, a = (e, t) => {
2311
+ }, Cr = (e, t, n) => {
2312
+ let r = t.length, i = C.BuiltIn.NA, a = (e, t) => {
2324
2313
  let n = Array(r).fill(i);
2325
2314
  return n[0] = e, r > 1 && (n[1] = t), n;
2326
2315
  }, o = e.standardErrors.slice();
@@ -2328,105 +2317,108 @@ var yr = Object.freeze({ includeEmpty: !0 }), br = (Object.freeze({ axis: T.Axis
2328
2317
  t.slice(),
2329
2318
  o,
2330
2319
  a(e.r2, e.sey),
2331
- a(e.f ?? w.BuiltIn.Num, e.df),
2320
+ a(e.f ?? C.BuiltIn.Num, e.df),
2332
2321
  a(e.ssReg, e.ssResid)
2333
2322
  ];
2334
- }, Dr = (e, t, n = !1) => {
2323
+ }, wr = (e, t, n = !1) => {
2335
2324
  let r = Array(t), i = 0;
2336
- for (let t of e.values(yr)) {
2337
- if (typeof t != "number") throw w.BuiltIn.Value;
2325
+ for (let t of e.values(gr)) {
2326
+ if (typeof t != "number") throw C.BuiltIn.Value;
2338
2327
  if (n) {
2339
- if (t <= 0) throw w.BuiltIn.Num;
2328
+ if (t <= 0) throw C.BuiltIn.Num;
2340
2329
  r[i++] = Math.log(t);
2341
2330
  } else r[i++] = t;
2342
2331
  }
2343
2332
  return r;
2344
- }, Or = (e, t, n, r) => {
2345
- let i = Dr(e, t * n), a = Array(t);
2333
+ }, Tr = (e, t, n, r) => {
2334
+ let i = wr(e, t * n), a = Array(t);
2346
2335
  for (let e = 0; e < t; e++) {
2347
2336
  let o = Array(n);
2348
2337
  for (let a = 0; a < n; a++) o[a] = r ? i[a * t + e] : i[e * n + a];
2349
2338
  a[e] = o;
2350
2339
  }
2351
2340
  return a;
2352
- }, kr = (e, t) => {
2341
+ }, Er = (e, t) => {
2353
2342
  let n = 0;
2354
2343
  for (let r = 0; r < e.length; r++) n += e[r] * t[r];
2355
2344
  return n;
2356
- }, Ar = k({
2357
- GROWTH: () => Fr,
2358
- LINEST: () => Mr,
2359
- LOGEST: () => Nr,
2360
- TREND: () => Pr
2361
- }), jr = () => {
2362
- if (C.getArgs().getAreaCountAt(1) > 1) throw w.BuiltIn.Ref;
2345
+ }, Dr = O({
2346
+ GROWTH: () => Mr,
2347
+ LINEST: () => kr,
2348
+ LOGEST: () => Ar,
2349
+ TREND: () => jr
2350
+ }), Or = () => {
2351
+ if (S.getArgs().getAreaCountAt(1) > 1) throw C.BuiltIn.Ref;
2363
2352
  };
2364
- function Mr(e, t, n, r) {
2365
- jr();
2366
- let i = xr(e, t);
2367
- return Sr(n, !0, (e) => {
2368
- let t = Tr(i.ys, i.xs, e);
2369
- return Sr(r, !1, (n) => n ? Er(t, t.coefficients, e) : [t.coefficients.slice()]);
2353
+ function kr(e, t, n, r) {
2354
+ Or();
2355
+ let i = vr(e, t);
2356
+ return yr(n, !0, (e) => {
2357
+ let t = Sr(i.ys, i.xs, e);
2358
+ return yr(r, !1, (n) => n ? Cr(t, t.coefficients, e) : [t.coefficients.slice()]);
2370
2359
  });
2371
2360
  }
2372
- function Nr(e, t, n, r) {
2373
- jr();
2374
- let i = xr(e, t, !0);
2375
- return Sr(n, !0, (e) => {
2376
- let t = Tr(i.ys, i.xs, e), n = Ir(t);
2377
- return Sr(r, !1, (r) => r ? Er(t, n, e) : [n]);
2361
+ function Ar(e, t, n, r) {
2362
+ Or();
2363
+ let i = vr(e, t, !0);
2364
+ return yr(n, !0, (e) => {
2365
+ let t = Sr(i.ys, i.xs, e), n = Nr(t);
2366
+ return yr(r, !1, (r) => r ? Cr(t, n, e) : [n]);
2378
2367
  });
2379
2368
  }
2380
- function Pr(e, t, n, r) {
2381
- jr();
2382
- let i = xr(e, t);
2383
- return Sr(r, !0, (e) => {
2384
- let t = Tr(i.ys, i.xs, e);
2385
- return wr(i, n, t.predict);
2369
+ function jr(e, t, n, r) {
2370
+ Or();
2371
+ let i = vr(e, t);
2372
+ return yr(r, !0, (e) => {
2373
+ let t = Sr(i.ys, i.xs, e);
2374
+ return xr(i, n, t.predict);
2386
2375
  });
2387
2376
  }
2388
- function Fr(e, t, n, r) {
2389
- jr();
2390
- let i = xr(e, t, !0);
2391
- return Sr(r, !0, (e) => {
2392
- let t = Tr(i.ys, i.xs, e).coefficients.map(Math.exp), r = i.k;
2393
- return wr(i, n, (e) => {
2377
+ function Mr(e, t, n, r) {
2378
+ Or();
2379
+ let i = vr(e, t, !0);
2380
+ return yr(r, !0, (e) => {
2381
+ let t = Sr(i.ys, i.xs, e).coefficients.map(Math.exp), r = i.k;
2382
+ return xr(i, n, (e) => {
2394
2383
  let n = t[r];
2395
2384
  for (let i = 0; i < r; i++) n *= t[r - 1 - i] ** e[i];
2396
- return Number.isFinite(n) ? n : w.BuiltIn.Num;
2385
+ return Number.isFinite(n) ? n : C.BuiltIn.Num;
2397
2386
  });
2398
2387
  });
2399
2388
  }
2400
- var Ir = (e) => e.coefficients.map((e) => {
2389
+ var Nr = (e) => e.coefficients.map((e) => {
2401
2390
  let t = Math.exp(e);
2402
- return Number.isFinite(t) ? t : w.BuiltIn.Num;
2403
- }), Lr = k({
2404
- TTEST: () => Rr,
2405
- T_TEST: () => zr
2406
- });
2407
- function Rr(e, t, n, r) {
2408
- return zr(e, t, n, r);
2391
+ return Number.isFinite(t) ? t : C.BuiltIn.Num;
2392
+ }), Pr = O({
2393
+ TTEST: () => Ir,
2394
+ T_TEST: () => Lr
2395
+ }), Fr = (e) => {
2396
+ let t = e.getCode();
2397
+ return t === C.Code.Null || t === C.Code.GettingData ? C.BuiltIn.Num : e;
2398
+ };
2399
+ function Ir(e, t, n, r) {
2400
+ return Lr(e, t, n, r);
2409
2401
  }
2410
- function zr(e, t, n, r) {
2411
- if (n = Math.floor(n + Br), r = Math.floor(r + Br), n !== 1 && n !== 2 || r < 1 || r > 3) return NaN;
2402
+ function Lr(e, t, n, r) {
2403
+ if (n = Math.floor(n + Rr), r = Math.floor(r + Rr), n !== 1 && n !== 2 || r < 1 || r > 3) return NaN;
2412
2404
  for (let n of [e, t]) if (n.size === 1 && n.isIReferenceRange) {
2413
2405
  if (n.hasError()) throw n.firstError();
2414
- if (n.entries({ includeEmpty: !1 }).next().done) throw w.BuiltIn.Value;
2406
+ if (n.entries({ includeEmpty: !1 }).next().done) throw C.BuiltIn.Value;
2415
2407
  }
2416
2408
  let i;
2417
2409
  if (r === 1) {
2418
2410
  let n = e.getShape(), r = t.getShape();
2419
- if (n.rows * n.columns !== r.rows * r.columns) throw w.BuiltIn.NA;
2411
+ if (n.rows * n.columns !== r.rows * r.columns) throw C.BuiltIn.NA;
2420
2412
  let a = [], o = [];
2421
2413
  for (let [[n, r]] of e.flatten().alignValues([t.flatten()])) {
2422
- if (w.isError(n)) throw n;
2423
- if (w.isError(r)) throw r;
2414
+ if (C.isError(n)) throw Fr(n);
2415
+ if (C.isError(r)) throw Fr(r);
2424
2416
  typeof n == "number" && typeof r == "number" && (a.push(n), o.push(r));
2425
2417
  }
2426
- if (a.length < 2) throw w.BuiltIn.Div0;
2418
+ if (a.length < 2) throw C.BuiltIn.Div0;
2427
2419
  i = function(e, t) {
2428
2420
  let n = e.length;
2429
- if (!Number.isFinite(Ur(e)) || !Number.isFinite(Ur(t))) return { error: w.BuiltIn.Num };
2421
+ if (!Number.isFinite(Vr(e)) || !Number.isFinite(Vr(t))) return { error: C.BuiltIn.Num };
2430
2422
  let r = 0;
2431
2423
  for (let i = 0; i < n; i++) r += e[i] - t[i];
2432
2424
  let i = r / n, a = 0;
@@ -2434,23 +2426,23 @@ function zr(e, t, n, r) {
2434
2426
  let n = e[r] - t[r] - i;
2435
2427
  a += n * n;
2436
2428
  }
2437
- return a === 0 ? { error: w.BuiltIn.Div0 } : {
2429
+ return a === 0 ? { error: C.BuiltIn.Div0 } : {
2438
2430
  x: Math.abs(i) * Math.sqrt(n * (n - 1) / a),
2439
2431
  df: n - 1
2440
2432
  };
2441
2433
  }(a, o);
2442
2434
  } else {
2443
- if (e.hasError()) throw e.firstError();
2444
- if (t.hasError()) throw t.firstError();
2445
- let n = e.getValuesFlat(br), a = t.getValuesFlat(br);
2446
- if (n.length < 2 || a.length < 2) throw w.BuiltIn.Div0;
2435
+ if (e.hasError()) throw Fr(e.firstError());
2436
+ if (t.hasError()) throw Fr(t.firstError());
2437
+ let n = e.getValuesFlat(_r), a = t.getValuesFlat(_r);
2438
+ if (n.length < 2 || a.length < 2) throw C.BuiltIn.Div0;
2447
2439
  i = r === 2 ? function(e, t) {
2448
2440
  let n = e.length, r = t.length, i = 0, a = 0, o = 0, s = 0;
2449
2441
  for (let t of e) i += t, a += t * t;
2450
2442
  for (let e of t) o += e, s += e * e;
2451
- if (!Number.isFinite(a) || !Number.isFinite(s)) return { error: w.BuiltIn.Num };
2443
+ if (!Number.isFinite(a) || !Number.isFinite(s)) return { error: C.BuiltIn.Num };
2452
2444
  let c = a - i ** 2 / n, l = s - o ** 2 / r, u = Math.sqrt(c + l);
2453
- if (u === 0) return { error: w.BuiltIn.Div0 };
2445
+ if (u === 0) return { error: C.BuiltIn.Div0 };
2454
2446
  let d = n + r - 2;
2455
2447
  return {
2456
2448
  x: Math.abs(i / n - o / r) / u * Math.sqrt(n * r * d / (n + r)),
@@ -2460,9 +2452,9 @@ function zr(e, t, n, r) {
2460
2452
  let n = e.length, r = t.length, i = 0, a = 0, o = 0, s = 0;
2461
2453
  for (let t of e) i += t, a += t * t;
2462
2454
  for (let e of t) o += e, s += e * e;
2463
- if (!Number.isFinite(a) || !Number.isFinite(s)) return { error: w.BuiltIn.Num };
2455
+ if (!Number.isFinite(a) || !Number.isFinite(s)) return { error: C.BuiltIn.Num };
2464
2456
  let c = (a - i ** 2 / n) / (n * (n - 1)), l = (s - o ** 2 / r) / (r * (r - 1));
2465
- if (c + l === 0) return { error: w.BuiltIn.Div0 };
2457
+ if (c + l === 0) return { error: C.BuiltIn.Div0 };
2466
2458
  let u = Math.abs(i / n - o / r) / Math.sqrt(c + l), d = c / (c + l);
2467
2459
  return {
2468
2460
  x: u,
@@ -2475,14 +2467,14 @@ function zr(e, t, n, r) {
2475
2467
  let n = .5 * function(e, t, n) {
2476
2468
  if (n <= 0) return 0;
2477
2469
  if (n >= 1) return 1;
2478
- let r = Hr(e) + Hr(t) - Hr(e + t), i = Math.exp(Math.log(n) * e + Math.log(1 - n) * t - r);
2479
- return n < (e + 1) / (e + t + 2) ? i * Vr(e, t, n) / e : 1 - i * Vr(t, e, 1 - n) / t;
2470
+ let r = Br(e) + Br(t) - Br(e + t), i = Math.exp(Math.log(n) * e + Math.log(1 - n) * t - r);
2471
+ return n < (e + 1) / (e + t + 2) ? i * zr(e, t, n) / e : 1 - i * zr(t, e, 1 - n) / t;
2480
2472
  }(t / 2, .5, t / (t + e * e));
2481
2473
  return e >= 0 ? 1 - n : n;
2482
2474
  }(-i.x, i.df) * n;
2483
2475
  }
2484
- var Br = 2 ** -22;
2485
- function Vr(e, t, n) {
2476
+ var Rr = 2 ** -22;
2477
+ function zr(e, t, n) {
2486
2478
  let r = 1e-30, i = e + t, a = e + 1, o = e - 1, s = 1, c = 1 - i * n / a;
2487
2479
  Math.abs(c) < r && (c = r), c = 1 / c;
2488
2480
  let l = c;
@@ -2494,7 +2486,7 @@ function Vr(e, t, n) {
2494
2486
  }
2495
2487
  return l;
2496
2488
  }
2497
- function Hr(e) {
2489
+ function Br(e) {
2498
2490
  let t = [
2499
2491
  .9999999999998099,
2500
2492
  676.5203681218851,
@@ -2506,19 +2498,19 @@ function Hr(e) {
2506
2498
  9984369578019572e-21,
2507
2499
  1.5056327351493116e-7
2508
2500
  ];
2509
- if (e < .5) return Math.log(Math.PI / Math.sin(Math.PI * e)) - Hr(1 - e);
2501
+ if (e < .5) return Math.log(Math.PI / Math.sin(Math.PI * e)) - Br(1 - e);
2510
2502
  e--;
2511
2503
  let n = t[0];
2512
2504
  for (let r = 1; r < 9; r++) n += t[r] / (e + r);
2513
2505
  let r = e + 7.5;
2514
2506
  return .5 * Math.log(2 * Math.PI) + (e + .5) * Math.log(r) - r + Math.log(n);
2515
2507
  }
2516
- function Ur(e) {
2508
+ function Vr(e) {
2517
2509
  let t = 0;
2518
2510
  for (let n of e) t += n * n;
2519
2511
  return t;
2520
2512
  }
2521
- var $ = "\\p{L}\\p{N}_", Wr = {
2513
+ var $ = "\\p{L}\\p{N}_", Hr = {
2522
2514
  alpha: "\\p{L}",
2523
2515
  digit: "\\p{Nd}",
2524
2516
  alnum: "\\p{L}\\p{N}",
@@ -2533,7 +2525,7 @@ var $ = "\\p{L}\\p{N}_", Wr = {
2533
2525
  ascii: "\\x00-\\x7F",
2534
2526
  print: "\\P{C}",
2535
2527
  graph: "\\P{C}"
2536
- }, Gr = {
2528
+ }, Ur = {
2537
2529
  alpha: "\\P{L}",
2538
2530
  digit: "\\P{Nd}",
2539
2531
  upper: "\\P{Lu}",
@@ -2542,18 +2534,18 @@ var $ = "\\p{L}\\p{N}_", Wr = {
2542
2534
  cntrl: "\\P{Cc}",
2543
2535
  print: "\\p{C}",
2544
2536
  graph: "\\p{C}"
2545
- }, Kr = `(?:(?<=[${$}])(?![${$}])|(?<![${$}])(?=[${$}]))`, qr = `(?:(?<=[${$}])(?=[${$}])|(?<![${$}])(?![${$}]))`, Jr = (e, t) => {
2537
+ }, Wr = `(?:(?<=[${$}])(?![${$}])|(?<![${$}])(?=[${$}]))`, Gr = `(?:(?<=[${$}])(?=[${$}])|(?<![${$}])(?![${$}]))`, Kr = (e, t) => {
2546
2538
  if (!e.startsWith("[:", t)) return null;
2547
2539
  let n = e.indexOf(":]", t + 2);
2548
2540
  if (n === -1) return null;
2549
2541
  let r = e.slice(t + 2, n), i = r.startsWith("^");
2550
2542
  i && (r = r.slice(1));
2551
- let a = i ? Gr[r] : Wr[r];
2543
+ let a = i ? Ur[r] : Hr[r];
2552
2544
  return a === void 0 ? null : {
2553
2545
  emit: a,
2554
2546
  next: n + 2
2555
2547
  };
2556
- }, Yr = (e, t) => {
2548
+ }, qr = (e, t) => {
2557
2549
  if (!e.startsWith("(?", t)) return null;
2558
2550
  let n = t + 2, r = "", i = "", a = !1;
2559
2551
  for (; n < e.length;) {
@@ -2574,13 +2566,13 @@ var $ = "\\p{L}\\p{N}_", Wr = {
2574
2566
  group: !0,
2575
2567
  next: n + 1
2576
2568
  } : null;
2577
- }, Xr = (e) => e.replace(/[^ims]/g, ""), Zr = (e) => (RegExp(`${e.source}|`, e.flags.replace("g", "")).exec("")?.length ?? 1) - 1, Qr = (e, t, n = "") => {
2569
+ }, Jr = (e) => e.replace(/[^ims]/g, ""), Yr = (e) => (RegExp(`${e.source}|`, e.flags.replace("g", "")).exec("")?.length ?? 1) - 1, Xr = (e, t, n = "") => {
2578
2570
  let r = (t ? "i" : "") + n, i = (e, t) => {
2579
2571
  try {
2580
2572
  let n = new RegExp(e, t ? `${r}u` : r);
2581
2573
  return {
2582
2574
  regex: n,
2583
- groups: Zr(n)
2575
+ groups: Yr(n)
2584
2576
  };
2585
2577
  } catch {
2586
2578
  return null;
@@ -2621,11 +2613,11 @@ var $ = "\\p{L}\\p{N}_", Wr = {
2621
2613
  continue;
2622
2614
  }
2623
2615
  if (i === "b") {
2624
- t += Kr, n += 2;
2616
+ t += Wr, n += 2;
2625
2617
  continue;
2626
2618
  }
2627
2619
  if (i === "B") {
2628
- t += qr, n += 2;
2620
+ t += Gr, n += 2;
2629
2621
  continue;
2630
2622
  }
2631
2623
  if (i === "w") {
@@ -2649,7 +2641,7 @@ var $ = "\\p{L}\\p{N}_", Wr = {
2649
2641
  continue;
2650
2642
  }
2651
2643
  if (r) {
2652
- let i = Jr(e, n);
2644
+ let i = Kr(e, n);
2653
2645
  if (i) {
2654
2646
  t += i.emit, n = i.next;
2655
2647
  continue;
@@ -2665,10 +2657,10 @@ var $ = "\\p{L}\\p{N}_", Wr = {
2665
2657
  r = !0, t += o, n += 1, e[n] === "^" && (t += "^", n += 1), e[n] === "]" && (t += "\\]", n += 1);
2666
2658
  continue;
2667
2659
  }
2668
- let s = Yr(e, n);
2660
+ let s = qr(e, n);
2669
2661
  if (s) {
2670
2662
  s.on.includes("U") && (i = !0), s.off.includes("U") && (i = !1);
2671
- let e = Xr(s.on), r = Xr(s.off);
2663
+ let e = Jr(s.on), r = Jr(s.off);
2672
2664
  s.group ? t += e || r ? `(?${e}${r ? `-${r}` : ""}:` : "(?:" : (e || r) && (t += `(?${e}${r ? `-${r}` : ""}:`, a.push(")")), n = s.next;
2673
2665
  } else if (i && /[*+?]/.test(o)) e[n + 1] === "?" ? (t += o, n += 2) : (t += `${o}?`, n += 1);
2674
2666
  else {
@@ -2685,48 +2677,48 @@ var $ = "\\p{L}\\p{N}_", Wr = {
2685
2677
  return t + a.join("");
2686
2678
  })(e);
2687
2679
  } catch {
2688
- return w.BuiltIn.Value;
2680
+ return C.BuiltIn.Value;
2689
2681
  }
2690
2682
  let o = a.replace(/\\([pP])\{([A-Za-z_]+)\}/g, "\\$1{Script=$2}");
2691
- return i(a, !0) ?? (o === a ? null : i(o, !0)) ?? i(e, !1) ?? w.BuiltIn.Value;
2692
- }, $r = (e, t) => {
2683
+ return i(a, !0) ?? (o === a ? null : i(o, !0)) ?? i(e, !1) ?? C.BuiltIn.Value;
2684
+ }, Zr = (e, t) => {
2693
2685
  let n = Math.trunc(e);
2694
- return n >= 0 && n <= t ? n : w.BuiltIn.Value;
2695
- }, ei = k({
2696
- REGEXEXTRACT: () => ti,
2697
- REGEXMATCH: () => ni,
2698
- REGEXREPLACE: () => ri,
2699
- REGEXTEST: () => ii
2686
+ return n >= 0 && n <= t ? n : C.BuiltIn.Value;
2687
+ }, Qr = O({
2688
+ REGEXEXTRACT: () => $r,
2689
+ REGEXMATCH: () => ei,
2690
+ REGEXREPLACE: () => ti,
2691
+ REGEXTEST: () => ni
2700
2692
  });
2701
- function ti(e, t, n = 0, r = 0) {
2702
- let i = $r(n, 2);
2703
- if (w.isError(i)) return i;
2704
- let a = $r(r, 1);
2705
- if (w.isError(a)) return a;
2706
- let o = Qr(t, a === 1);
2707
- if (w.isError(o)) return o;
2693
+ function $r(e, t, n = 0, r = 0) {
2694
+ let i = Zr(n, 2);
2695
+ if (C.isError(i)) return i;
2696
+ let a = Zr(r, 1);
2697
+ if (C.isError(a)) return a;
2698
+ let o = Xr(t, a === 1);
2699
+ if (C.isError(o)) return o;
2708
2700
  let { regex: s } = o;
2709
2701
  if (i === 0) {
2710
2702
  let t = e.match(s);
2711
- return t ? C.createRange().replace([[t[0]]]) : w.BuiltIn.NA;
2703
+ return t ? S.createRange().replace([[t[0]]]) : C.BuiltIn.NA;
2712
2704
  }
2713
2705
  if (i === 1) {
2714
2706
  let t = [...e.matchAll(new RegExp(s.source, `${s.flags}g`))];
2715
- return t.length === 0 ? w.BuiltIn.NA : C.createRange().replace([t.map((e) => e[0])]);
2707
+ return t.length === 0 ? C.BuiltIn.NA : S.createRange().replace([t.map((e) => e[0])]);
2716
2708
  }
2717
- if (o.groups === 0) return w.BuiltIn.Value;
2709
+ if (o.groups === 0) return C.BuiltIn.Value;
2718
2710
  let c = e.match(s);
2719
- return c ? C.createRange().replace([c.slice(1).map((e) => e ?? w.BuiltIn.NA)]) : w.BuiltIn.NA;
2711
+ return c ? S.createRange().replace([c.slice(1).map((e) => e ?? C.BuiltIn.NA)]) : C.BuiltIn.NA;
2720
2712
  }
2721
- function ni(e, t, n = !1) {
2722
- let r = Qr(t, n);
2723
- return w.isError(r) ? r : r.regex.test(e);
2713
+ function ei(e, t, n = !1) {
2714
+ let r = Xr(t, n);
2715
+ return C.isError(r) ? r : r.regex.test(e);
2724
2716
  }
2725
- function ri(e, t, n, r = 0, i = 0) {
2726
- let a = $r(i, 1);
2727
- if (w.isError(a)) return a;
2728
- let o = Qr(t, a === 1);
2729
- if (w.isError(o)) return o;
2717
+ function ti(e, t, n, r = 0, i = 0) {
2718
+ let a = Zr(i, 1);
2719
+ if (C.isError(a)) return a;
2720
+ let o = Xr(t, a === 1);
2721
+ if (C.isError(o)) return o;
2730
2722
  let { regex: s, groups: c } = o, l = ((e, t) => {
2731
2723
  let n = "", r = 0;
2732
2724
  for (; r < e.length;) {
@@ -2739,7 +2731,7 @@ function ri(e, t, n, r = 0, i = 0) {
2739
2731
  n += "$&", r += 1 + i.length;
2740
2732
  continue;
2741
2733
  }
2742
- if (a > t) return w.BuiltIn.Value;
2734
+ if (a > t) return C.BuiltIn.Value;
2743
2735
  n += `$${a}`, r += 1 + i.length;
2744
2736
  continue;
2745
2737
  }
@@ -2762,7 +2754,7 @@ function ri(e, t, n, r = 0, i = 0) {
2762
2754
  n += "$&", r += 1 + i.length;
2763
2755
  continue;
2764
2756
  }
2765
- if (a > t) return w.BuiltIn.Value;
2757
+ if (a > t) return C.BuiltIn.Value;
2766
2758
  n += `$${a}`, r += 1 + i.length;
2767
2759
  continue;
2768
2760
  }
@@ -2776,20 +2768,20 @@ function ri(e, t, n, r = 0, i = 0) {
2776
2768
  n += "$&", r = i + 1;
2777
2769
  continue;
2778
2770
  }
2779
- if (e > t) return w.BuiltIn.Value;
2771
+ if (e > t) return C.BuiltIn.Value;
2780
2772
  n += `$${e}`;
2781
2773
  } else n += `$<${a}>`;
2782
2774
  r = i + 1;
2783
2775
  continue;
2784
2776
  }
2785
2777
  }
2786
- return w.BuiltIn.Value;
2778
+ return C.BuiltIn.Value;
2787
2779
  }
2788
2780
  n += i + a, r += 2;
2789
2781
  }
2790
2782
  return n;
2791
2783
  })(n, c);
2792
- if (w.isError(l)) return l;
2784
+ if (C.isError(l)) return l;
2793
2785
  let u = Math.trunc(r), d = new RegExp(s.source, `${s.flags}g`);
2794
2786
  if (u === 0) return e.replace(d, l);
2795
2787
  let f = [...e.matchAll(d)], p = u > 0 ? u - 1 : f.length + u;
@@ -2797,11 +2789,11 @@ function ri(e, t, n, r = 0, i = 0) {
2797
2789
  let m = f[p], h = m.index;
2798
2790
  return e.slice(0, h) + m[0].replace(s, l) + e.slice(h + m[0].length);
2799
2791
  }
2800
- function ii(e, t, n = 0) {
2801
- let r = $r(n, 1);
2802
- if (w.isError(r)) return r;
2803
- let i = Qr(t, r === 1);
2804
- return w.isError(i) ? i : i.regex.test(e);
2792
+ function ni(e, t, n = 0) {
2793
+ let r = Zr(n, 1);
2794
+ if (C.isError(r)) return r;
2795
+ let i = Xr(t, r === 1);
2796
+ return C.isError(i) ? i : i.regex.test(e);
2805
2797
  }
2806
- var ai = () => import("./CNDVQpzD85y-8iJ4.mjs"), oi = () => import("./0yxQHUFt5rjQCIev.mjs"), si = () => import("./DXTaMRX8ten_8WHT.mjs"), ci = () => import("./CjKII1gh4dO5nTCs.mjs"), li = () => import("./CiTyrOKe-UEYKcPV.mjs"), ui = () => import("./B0dkCLIUbDz5vaVn.mjs"), di = () => import("./qAolCiBy-hQL59hu.mjs"), fi = () => import("./cfrOLasJbMwF7L77.mjs"), pi = () => import("./BfcYyyl5rbLdyDeQ.mjs"), mi = () => import("./CZ7GTErfSkfNcFRk.mjs"), hi = () => import("./D4ySsDPVL4IH96en.mjs"), gi = () => import("./BDiwqEqe9Jl-Rmly.mjs"), _i = () => import("./Dt0ErrS3YGvCicxr.mjs"), vi = () => import("./D25GpXzrju6GyQn2.mjs"), yi = () => import("./BJjZHVPRHerJoONT.mjs"), bi = () => import("./Bf0x5wP966yEyeU1.mjs"), xi = () => import("./D0XFBj8GRIDAu37v.mjs"), Si = () => import("./o8LeKZ4-9nq29pqg.mjs"), Ci = () => import("./D4kfW2yw0rsWNLi0.mjs"), wi = () => import("./zWOO2QFn-kMYJv1L.mjs"), Ti = () => import("./CoHdir1CxZhcwJYt.mjs"), Ei = () => import("./C2ZfbEIW-6-61CUe.mjs"), Di = (C, w, T) => (T ||= /* @__PURE__ */ new Map(), w(T, C, ee, e, ai, "Cube"), w(T, C, be, t, oi, "Financial"), w(T, C, Ne, x, si, "Financial"), w(T, C, Ie, S, ci, "Financial", i), w(T, C, $e, b, li, "Financial"), w(T, C, at, n, ui, "Financial"), w(T, C, Dt, c, di, "Financial"), w(T, C, Pt, l, fi, "Financial"), w(T, C, Rt, f, pi, "Financial"), w(T, C, Wt, h, mi, "Financial"), w(T, C, an, s, hi, "Financial"), w(T, C, dn, o, gi, "Financial"), w(T, C, pn, y, _i, "Financial"), w(T, C, vn, d, vi, "Financial"), w(T, C, En, a, yi, "Financial"), w(T, C, An, _, bi, "Financial"), w(T, C, Xn, m, xi, "Lookup & Reference"), w(T, C, tr, r, Si, "Lookup & Reference"), w(T, C, ar, u, Ci, "Statistical"), w(T, C, Ar, g, wi, "Statistical"), w(T, C, Lr, p, Ti, "Statistical"), w(T, C, ei, v, Ei, "Text"), T);
2807
- export { Di as default };
2798
+ var ri = () => import("./KELE0bwOYLDc5LU1.mjs"), ii = () => import("./C8cZUVI0utH84RoY.mjs"), ai = () => import("./P2KKIUxWzaRqA578.mjs"), oi = () => import("./BuGd_WozQ5GACryc.mjs"), si = () => import("./TsVRWlV0aBAj11q_.mjs"), ci = () => import("./C5QRZhBj0R2s5scX.mjs"), li = () => import("./CYYsvsWpauQOJMsM.mjs"), ui = () => import("./BzsAYB0O4AGQyHhT.mjs"), di = () => import("./JeU0hWKFq05N2_wk.mjs"), fi = () => import("./N6ZNg1DcQqnCub6Y.mjs"), pi = () => import("./kHBrNyVWu-GLkTFD.mjs"), mi = () => import("./NLoLzdQXAOTuwqvv.mjs"), hi = () => import("./-gjh-c5r-kqWZw9o.mjs"), gi = () => import("./DvQaVDnNxRMcD29t.mjs"), _i = () => import("./BHd0M_vc0wMVhN4M.mjs"), vi = () => import("./B6ojJF7WA6DiQR2T.mjs"), yi = () => import("./D5YXRS6-9JR6Jnuy.mjs"), bi = () => import("./Bp7v8eImXSaAUiaa.mjs"), xi = () => import("./DRA4FqoQ1dJXOyPu.mjs"), Si = () => import("./D23E5LzPcseeh6hA.mjs"), Ci = () => import("./pEF9hsQQaka-GGnX.mjs"), wi = (S, C, w) => (w ||= /* @__PURE__ */ new Map(), C(w, S, k, e, ri, "Cube"), C(w, S, ve, b, ii, "Financial"), C(w, S, je, r, ai, "Financial"), C(w, S, Pe, y, oi, "Financial", x), C(w, S, Ze, t, si, "Financial"), C(w, S, rt, s, ci, "Financial"), C(w, S, Et, c, li, "Financial"), C(w, S, Nt, d, ui, "Financial"), C(w, S, Lt, m, di, "Financial"), C(w, S, Ut, o, fi, "Financial"), C(w, S, rn, a, pi, "Financial"), C(w, S, un, v, mi, "Financial"), C(w, S, hn, u, hi, "Financial"), C(w, S, Cn, i, gi, "Financial"), C(w, S, Dn, g, _i, "Financial"), C(w, S, qn, p, vi, "Lookup & Reference"), C(w, S, Qn, n, yi, "Lookup & Reference"), C(w, S, nr, l, bi, "Statistical"), C(w, S, Dr, h, xi, "Statistical"), C(w, S, Pr, f, Si, "Statistical"), C(w, S, Qr, _, Ci, "Text"), w);
2799
+ export { wi as default };