@sheetxl/formulas 0.8.0-beta.5 → 0.8.0-beta.7
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.
- package/browser/cjs/index.cjs +1 -1
- package/browser/esm/{D3awenvxpQ1KDx15.mjs → 0x5l9_ZIbiV0OsPM.mjs} +1 -1
- package/browser/esm/{DSiBIwQ60UGTT4By.mjs → BMqGkc9lB3bzYJi2.mjs} +1 -1
- package/{node/esm/CfnUiLfVLC77gZtw.mjs → browser/esm/Bx8w0EgTgcvUP2FG.mjs} +1 -1
- package/{node/esm/BFNihluoZBNsYXCL.mjs → browser/esm/ByDxheg-vywRUW_k.mjs} +1 -1
- package/browser/esm/{D3HxZeTF0H2Pzj3w.mjs → ByxQneGrvNXRw1C3.mjs} +1 -1
- package/browser/esm/{Ag3eE6q5ZJM3fVav.mjs → C8T9tdc0Ro3dYT5i.mjs} +1 -1
- package/browser/esm/{Bm7qgQ2w1girWceN.mjs → CHSEyxhpLg7gA_-m.mjs} +1 -1
- package/browser/esm/{DPOEWf1NF3NI3XZ4.mjs → CNlk9maTZcfnUoqC.mjs} +1 -1
- package/{node/esm/Oyz1gF7vrQIcrZTJ.mjs → browser/esm/CfvEeNcQ1nU48r9h.mjs} +1 -1
- package/browser/esm/{5X8bpCTLz5g9VT2o.mjs → CnvR3EiK8b4IYqeQ.mjs} +1 -1
- package/browser/esm/{CqHYqOQrHyPoH-64.mjs → DDC5dkydbI95ULio.mjs} +1 -1
- package/browser/esm/{DMENp5P58xDDh86d.mjs → DNbjcGCykjUZf_DR.mjs} +1 -1
- package/{node/esm/CuaSmoQylFRBvp9P.mjs → browser/esm/DNqckj8TulTGo7FR.mjs} +1 -1
- package/browser/esm/{BsYQTAuC7Hq--ggs.mjs → DRamw-nLOZBXeDlT.mjs} +1 -1
- package/{node/esm/D8mtKfymlOxIp6fe.mjs → browser/esm/DSERN9sINhqwboEy.mjs} +1 -1
- package/{node/esm/Dv_OzvnifdH_iW01.mjs → browser/esm/Dbe7sAcT1MMSJCLl.mjs} +1 -1
- package/{node/esm/CyH2KnOPfO7f3wqp.mjs → browser/esm/Dl4FJb5rdXwETLy5.mjs} +1 -1
- package/browser/esm/{RZCrfC-2dhllAOfT.mjs → DxQH39LzO3Dy-i--.mjs} +1 -1
- package/{node/esm/Be2CwRYRoOSahicS.mjs → browser/esm/IdYYtD2hRuVaaSo5.mjs} +1 -1
- package/browser/esm/{C2unqUZMcJQswbkM.mjs → L8H_ruX1UE3o8Y3Y.mjs} +1 -1
- package/browser/esm/{DzU54uqsXvnhSKrR.mjs → LSB9NC_9pLFIXB2r.mjs} +1 -1
- package/browser/esm/{DTcWwF0L7wM4TA6R.mjs → VmFmgY9dzxIwm52h.mjs} +1 -1
- package/browser/esm/{CMZlUqf3eqW0b4t2.mjs → _EPqEYbpgoySRKpA.mjs} +1 -1
- package/browser/esm/{D0HY0ZIA1GFd17Hz.mjs → e3gK86aUTL33K049.mjs} +1 -1
- package/browser/esm/index.mjs +741 -741
- package/browser/esm/{B_w20YqHLHl33cfQ.mjs → rcUA627TgCowf8TT.mjs} +1 -1
- package/node/esm/{1riNkHcbYB6zVyQd.mjs → 3mZkK3J9uUuf4_r4.mjs} +1 -1
- package/node/esm/{DSiBIwQ60UGTT4By.mjs → BMqGkc9lB3bzYJi2.mjs} +1 -1
- package/node/esm/{DK2Jv1ksEXj01Txu.mjs → BS95wBl9mVWJgoWK.mjs} +1 -1
- package/node/esm/{CP1nc1n-SQUEvyg-.mjs → BVPS5Un1I5hdlqAx.mjs} +1 -1
- package/{browser/esm/CfnUiLfVLC77gZtw.mjs → node/esm/Bx8w0EgTgcvUP2FG.mjs} +1 -1
- package/{browser/esm/BFNihluoZBNsYXCL.mjs → node/esm/ByDxheg-vywRUW_k.mjs} +1 -1
- package/node/esm/{Ag3eE6q5ZJM3fVav.mjs → C8T9tdc0Ro3dYT5i.mjs} +1 -1
- package/node/esm/{Bm7qgQ2w1girWceN.mjs → CHSEyxhpLg7gA_-m.mjs} +1 -1
- package/node/esm/{DPOEWf1NF3NI3XZ4.mjs → CNlk9maTZcfnUoqC.mjs} +1 -1
- package/node/esm/{D-XKQ7s9vsHkQnZN.mjs → CSUb3dsHnebxlWcC.mjs} +1 -1
- package/{browser/esm/Oyz1gF7vrQIcrZTJ.mjs → node/esm/CfvEeNcQ1nU48r9h.mjs} +1 -1
- package/node/esm/{5X8bpCTLz5g9VT2o.mjs → CnvR3EiK8b4IYqeQ.mjs} +1 -1
- package/{browser/esm/CuaSmoQylFRBvp9P.mjs → node/esm/DNqckj8TulTGo7FR.mjs} +1 -1
- package/node/esm/{BsYQTAuC7Hq--ggs.mjs → DRamw-nLOZBXeDlT.mjs} +1 -1
- package/{browser/esm/D8mtKfymlOxIp6fe.mjs → node/esm/DSERN9sINhqwboEy.mjs} +1 -1
- package/{browser/esm/Dv_OzvnifdH_iW01.mjs → node/esm/Dbe7sAcT1MMSJCLl.mjs} +1 -1
- package/node/esm/{ChJD5hRF7wcBxJhZ.mjs → DgpL9kNphy9gXRFA.mjs} +1 -1
- package/{browser/esm/CyH2KnOPfO7f3wqp.mjs → node/esm/Dl4FJb5rdXwETLy5.mjs} +1 -1
- package/node/esm/{BZhz4wO8xRM_GaZ2.mjs → DpY6ubhJ6C7xwhJX.mjs} +1 -1
- package/node/esm/{DPbVTkgPOiFKUnlX.mjs → FLGhbLcK_-CaBWel.mjs} +1 -1
- package/{browser/esm/Be2CwRYRoOSahicS.mjs → node/esm/IdYYtD2hRuVaaSo5.mjs} +1 -1
- package/node/esm/{C2unqUZMcJQswbkM.mjs → L8H_ruX1UE3o8Y3Y.mjs} +1 -1
- package/node/esm/{DzU54uqsXvnhSKrR.mjs → LSB9NC_9pLFIXB2r.mjs} +1 -1
- package/node/esm/{DTcWwF0L7wM4TA6R.mjs → VmFmgY9dzxIwm52h.mjs} +1 -1
- package/node/esm/{CMZlUqf3eqW0b4t2.mjs → _EPqEYbpgoySRKpA.mjs} +1 -1
- package/node/esm/index.mjs +789 -789
- package/package.json +3 -3
package/browser/esm/index.mjs
CHANGED
|
@@ -1,5 +1,5 @@
|
|
|
1
1
|
/**
|
|
2
|
-
* @license @sheetxl/formulas - Formulas - TypeScript formulas compatible with Excel built-ins. - v0.8.0-beta.
|
|
2
|
+
* @license @sheetxl/formulas - Formulas - TypeScript formulas compatible with Excel built-ins. - v0.8.0-beta.7
|
|
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.
|
|
@@ -4684,11 +4684,11 @@ function fo(e, t = 1) {
|
|
|
4684
4684
|
function po(e) {
|
|
4685
4685
|
_s(e);
|
|
4686
4686
|
let t, n = e[0];
|
|
4687
|
-
if (n < 0 || n >
|
|
4687
|
+
if (n < 0 || n > Ss) return NaN;
|
|
4688
4688
|
n = Math.abs(Math.trunc(n));
|
|
4689
4689
|
let r = e.length;
|
|
4690
4690
|
for (let i = 1; i < r; i++) {
|
|
4691
|
-
if (t = e[i], t < 0 || t >
|
|
4691
|
+
if (t = e[i], t < 0 || t > Ss) return NaN;
|
|
4692
4692
|
for (t = Math.abs(Math.trunc(t)); n && t;) n > t ? n %= t : t %= n;
|
|
4693
4693
|
n += t;
|
|
4694
4694
|
}
|
|
@@ -4704,15 +4704,15 @@ function ho(e, t = 1) {
|
|
|
4704
4704
|
function go(e) {
|
|
4705
4705
|
_s(e);
|
|
4706
4706
|
let t, n, r, i = e[0];
|
|
4707
|
-
if (i < 0 || i >
|
|
4707
|
+
if (i < 0 || i > Ss) return NaN;
|
|
4708
4708
|
i = Math.abs(Math.trunc(i));
|
|
4709
4709
|
let a = e.length;
|
|
4710
4710
|
for (let o = 1; o < a; o++) {
|
|
4711
4711
|
let a = e[o];
|
|
4712
|
-
if (a < 0 || a >
|
|
4712
|
+
if (a < 0 || a > Ss) return NaN;
|
|
4713
4713
|
if (t = Math.abs(Math.trunc(a)), i !== 0 && t !== 0) {
|
|
4714
4714
|
for (n = i, r = t; n && r;) n > r ? n %= r : r %= n;
|
|
4715
|
-
if (i = i / (n + r) * t, i >
|
|
4715
|
+
if (i = i / (n + r) * t, i > Ss) return NaN;
|
|
4716
4716
|
} else i = 0;
|
|
4717
4717
|
}
|
|
4718
4718
|
return i;
|
|
@@ -4978,7 +4978,7 @@ function qo(n, r, i, a) {
|
|
|
4978
4978
|
return (t === null ? 0 : e.parseAsNumber(t)) * Jo(o, s);
|
|
4979
4979
|
}
|
|
4980
4980
|
let p = 0, m = 0;
|
|
4981
|
-
for (let e of a.values(
|
|
4981
|
+
for (let e of a.values(xs)) if (e !== null) {
|
|
4982
4982
|
if (t.isError(e)) throw e;
|
|
4983
4983
|
if (typeof e != "number") throw t.BuiltIn.Value;
|
|
4984
4984
|
p += e * Jo(o, s + m * c), m++;
|
|
@@ -5004,40 +5004,40 @@ function Zo(e) {
|
|
|
5004
5004
|
return t < 0 ? NaN : Math.sqrt(t * Math.PI);
|
|
5005
5005
|
}
|
|
5006
5006
|
function Qo(r, i) {
|
|
5007
|
-
let a = Math.trunc(r), o = a >= 101, s = o ? a - 100 : a, c =
|
|
5007
|
+
let a = Math.trunc(r), o = a >= 101, s = o ? a - 100 : a, c = o ? void 0 : bs, l = i.map((t) => e.filterHidden(t, c)).map((t) => e.filterTotals(t));
|
|
5008
5008
|
if (s !== 2 && s !== 3) {
|
|
5009
|
-
for (let e of
|
|
5009
|
+
for (let e of l) if (e.hasError()) return e.firstError();
|
|
5010
5010
|
}
|
|
5011
|
-
let
|
|
5011
|
+
let u = l.reduce((e, t) => e.concat(t, n.Axis.Row, null)), d = u.getStats().getAggregates();
|
|
5012
5012
|
switch (s) {
|
|
5013
5013
|
case 1: {
|
|
5014
|
-
let e =
|
|
5014
|
+
let e = d.numericalCount ?? 0;
|
|
5015
5015
|
if (e === 0) throw t.BuiltIn.Div0;
|
|
5016
|
-
return
|
|
5016
|
+
return u.getStats().getSnappedSum() / e;
|
|
5017
5017
|
}
|
|
5018
|
-
case 2: return
|
|
5019
|
-
case 3: return
|
|
5020
|
-
case 4: return
|
|
5021
|
-
case 5: return
|
|
5018
|
+
case 2: return d.numericalCount ?? 0;
|
|
5019
|
+
case 3: return u.getStats().getCount();
|
|
5020
|
+
case 4: return d.max ?? 0;
|
|
5021
|
+
case 5: return d.min ?? 0;
|
|
5022
5022
|
case 6: {
|
|
5023
5023
|
let e = 1, t = !1;
|
|
5024
|
-
return
|
|
5024
|
+
return u.forEach((n) => {
|
|
5025
5025
|
typeof n == "number" && (e *= n, t = !0);
|
|
5026
5026
|
}), t ? e : 0;
|
|
5027
5027
|
}
|
|
5028
5028
|
case 7:
|
|
5029
|
-
if ((
|
|
5030
|
-
return
|
|
5029
|
+
if ((d.numericalCount ?? 0) < 2) throw t.BuiltIn.Div0;
|
|
5030
|
+
return d.stdDev;
|
|
5031
5031
|
case 8:
|
|
5032
|
-
if ((
|
|
5033
|
-
return
|
|
5034
|
-
case 9: return
|
|
5032
|
+
if ((d.numericalCount ?? 0) < 1) throw t.BuiltIn.Div0;
|
|
5033
|
+
return d.stdDevP;
|
|
5034
|
+
case 9: return u.getStats().getSnappedSum();
|
|
5035
5035
|
case 10:
|
|
5036
|
-
if ((
|
|
5037
|
-
return
|
|
5036
|
+
if ((d.numericalCount ?? 0) < 2) throw t.BuiltIn.Div0;
|
|
5037
|
+
return d.var;
|
|
5038
5038
|
case 11:
|
|
5039
|
-
if ((
|
|
5040
|
-
return
|
|
5039
|
+
if ((d.numericalCount ?? 0) < 1) throw t.BuiltIn.Div0;
|
|
5040
|
+
return d.varP;
|
|
5041
5041
|
default: return t.BuiltIn.Value;
|
|
5042
5042
|
}
|
|
5043
5043
|
}
|
|
@@ -5140,222 +5140,222 @@ var cs = (e) => Math.trunc(e), ls = 2147483646, us = (e) => {
|
|
|
5140
5140
|
let i = e.getRowCount(), a = e.getColumnCount();
|
|
5141
5141
|
if (i * a !== n.getRowCount() * n.getColumnCount()) throw t.BuiltIn.NA;
|
|
5142
5142
|
i === n.getRowCount() && a === n.getColumnCount() || (n = n.reshape(i, a));
|
|
5143
|
-
for (let n of e.values(
|
|
5144
|
-
for (let e of n.values(
|
|
5143
|
+
for (let n of e.values(xs)) if (t.isError(n)) throw n;
|
|
5144
|
+
for (let e of n.values(xs)) if (t.isError(e)) throw e;
|
|
5145
5145
|
let o = 0, s = e.alignReduce([n], (e, t) => typeof t[0] != "number" || typeof t[1] != "number" ? e : (o++, e + r(t[0], t[1])), 0);
|
|
5146
5146
|
if (o === 0) throw t.BuiltIn.Div0;
|
|
5147
5147
|
return s;
|
|
5148
|
-
}, bs = { axis: n.Axis.Row },
|
|
5149
|
-
ACOS: () =>
|
|
5150
|
-
ACOSH: () =>
|
|
5151
|
-
ACOT: () =>
|
|
5152
|
-
ACOTH: () =>
|
|
5153
|
-
ASIN: () =>
|
|
5154
|
-
ASINH: () =>
|
|
5155
|
-
ATAN: () =>
|
|
5156
|
-
ATAN2: () =>
|
|
5157
|
-
ATANH: () =>
|
|
5158
|
-
COS: () =>
|
|
5159
|
-
COSH: () =>
|
|
5160
|
-
COT: () =>
|
|
5161
|
-
COTH: () =>
|
|
5162
|
-
CSC: () =>
|
|
5163
|
-
CSCH: () =>
|
|
5164
|
-
SEC: () =>
|
|
5165
|
-
SECH: () =>
|
|
5166
|
-
SIN: () =>
|
|
5167
|
-
SINH: () =>
|
|
5168
|
-
TAN: () =>
|
|
5169
|
-
TANH: () =>
|
|
5148
|
+
}, bs = { onlyWhileFiltered: !0 }, xs = { axis: n.Axis.Row }, Ss = 9007199254740992, Cs = m({
|
|
5149
|
+
ACOS: () => ws,
|
|
5150
|
+
ACOSH: () => Ts,
|
|
5151
|
+
ACOT: () => Es,
|
|
5152
|
+
ACOTH: () => Ds,
|
|
5153
|
+
ASIN: () => Os,
|
|
5154
|
+
ASINH: () => ks,
|
|
5155
|
+
ATAN: () => As,
|
|
5156
|
+
ATAN2: () => js,
|
|
5157
|
+
ATANH: () => Ms,
|
|
5158
|
+
COS: () => Ns,
|
|
5159
|
+
COSH: () => Ps,
|
|
5160
|
+
COT: () => Fs,
|
|
5161
|
+
COTH: () => Is,
|
|
5162
|
+
CSC: () => Ls,
|
|
5163
|
+
CSCH: () => Rs,
|
|
5164
|
+
SEC: () => zs,
|
|
5165
|
+
SECH: () => Bs,
|
|
5166
|
+
SIN: () => Vs,
|
|
5167
|
+
SINH: () => Hs,
|
|
5168
|
+
TAN: () => Us,
|
|
5169
|
+
TANH: () => Ws
|
|
5170
5170
|
});
|
|
5171
|
-
function
|
|
5171
|
+
function ws(e) {
|
|
5172
5172
|
return e > 1 || e < -1 ? NaN : Math.PI / 2 - Math.asin(e);
|
|
5173
5173
|
}
|
|
5174
|
-
function
|
|
5174
|
+
function Ts(e) {
|
|
5175
5175
|
return e < 1 ? NaN : Math.log(e + Math.sqrt(e * e - 1));
|
|
5176
5176
|
}
|
|
5177
|
-
function
|
|
5177
|
+
function Es(e) {
|
|
5178
5178
|
let t = Math.atan(g(1 / e));
|
|
5179
5179
|
return e < 0 ? Math.PI + t : t;
|
|
5180
5180
|
}
|
|
5181
|
-
function
|
|
5181
|
+
function Ds(e) {
|
|
5182
5182
|
return Math.abs(e) <= 1 ? NaN : Math.abs(e) <= 2 ? Math.log((e + 1) / (e - 1)) / 2 : _(g(1 / e));
|
|
5183
5183
|
}
|
|
5184
|
-
function
|
|
5184
|
+
function Os(e) {
|
|
5185
5185
|
return e > 1 || e < -1 ? NaN : Math.asin(e);
|
|
5186
5186
|
}
|
|
5187
|
-
function
|
|
5187
|
+
function ks(e) {
|
|
5188
5188
|
let t = Math.abs(e), n = Math.log(t + Math.sqrt(t * t + 1));
|
|
5189
5189
|
return e < 0 ? -n : n;
|
|
5190
5190
|
}
|
|
5191
|
-
function
|
|
5191
|
+
function As(e) {
|
|
5192
5192
|
return Math.atan(e);
|
|
5193
5193
|
}
|
|
5194
|
-
function
|
|
5194
|
+
function js(e, n) {
|
|
5195
5195
|
if (n === 0 && e === 0) throw t.BuiltIn.Div0;
|
|
5196
5196
|
let r = n / e;
|
|
5197
5197
|
if (e !== 0 && !Number.isFinite(r)) return NaN;
|
|
5198
5198
|
let i = Math.atan(r);
|
|
5199
5199
|
return e >= 0 ? i : n >= 0 ? i + Math.PI : i - Math.PI;
|
|
5200
5200
|
}
|
|
5201
|
-
function
|
|
5201
|
+
function Ms(e) {
|
|
5202
5202
|
return Math.abs(e) >= 1 ? NaN : _(e);
|
|
5203
5203
|
}
|
|
5204
|
-
function
|
|
5204
|
+
function Ns(e) {
|
|
5205
5205
|
return Math.abs(e) >= N ? NaN : F(e);
|
|
5206
5206
|
}
|
|
5207
|
-
function
|
|
5207
|
+
function Ps(e) {
|
|
5208
5208
|
return Number.isFinite(Math.exp(Math.abs(e))) ? Math.cosh(e) : NaN;
|
|
5209
5209
|
}
|
|
5210
|
-
function
|
|
5210
|
+
function Fs(e) {
|
|
5211
5211
|
if (Math.abs(e) >= N) return NaN;
|
|
5212
5212
|
if (e === 0) throw t.BuiltIn.Div0;
|
|
5213
5213
|
return 1 / kn(e);
|
|
5214
5214
|
}
|
|
5215
|
-
function
|
|
5215
|
+
function Is(e) {
|
|
5216
5216
|
if (e === 0) throw t.BuiltIn.Div0;
|
|
5217
5217
|
return g(1 / Math.tanh(e));
|
|
5218
5218
|
}
|
|
5219
|
-
function
|
|
5219
|
+
function Ls(e) {
|
|
5220
5220
|
if (Math.abs(e) >= N) return NaN;
|
|
5221
5221
|
if (e === 0) throw t.BuiltIn.Div0;
|
|
5222
5222
|
return 1 / P(e);
|
|
5223
5223
|
}
|
|
5224
|
-
function
|
|
5224
|
+
function Rs(e) {
|
|
5225
5225
|
if (e === 0) throw t.BuiltIn.Div0;
|
|
5226
5226
|
return g(1 / Math.sinh(e));
|
|
5227
5227
|
}
|
|
5228
|
-
function
|
|
5228
|
+
function zs(e) {
|
|
5229
5229
|
return Math.abs(e) >= N ? NaN : 1 / F(e);
|
|
5230
5230
|
}
|
|
5231
|
-
function
|
|
5231
|
+
function Bs(e) {
|
|
5232
5232
|
return g(1 / Math.cosh(e));
|
|
5233
5233
|
}
|
|
5234
|
-
function
|
|
5234
|
+
function Vs(e) {
|
|
5235
5235
|
return Math.abs(e) >= N ? NaN : P(e);
|
|
5236
5236
|
}
|
|
5237
|
-
function
|
|
5237
|
+
function Hs(e) {
|
|
5238
5238
|
return Number.isFinite(Math.exp(Math.abs(e))) ? Math.sinh(e) : NaN;
|
|
5239
5239
|
}
|
|
5240
|
-
function
|
|
5240
|
+
function Us(e) {
|
|
5241
5241
|
return Math.abs(e) >= N ? NaN : kn(e);
|
|
5242
5242
|
}
|
|
5243
|
-
function
|
|
5243
|
+
function Ws(e) {
|
|
5244
5244
|
return Math.tanh(e);
|
|
5245
5245
|
}
|
|
5246
|
-
var
|
|
5247
|
-
ADD: () =>
|
|
5248
|
-
DIVIDE: () =>
|
|
5249
|
-
EQ: () =>
|
|
5250
|
-
GT: () =>
|
|
5251
|
-
GTE: () =>
|
|
5252
|
-
ISBETWEEN: () =>
|
|
5253
|
-
LT: () =>
|
|
5254
|
-
LTE: () =>
|
|
5255
|
-
MINUS: () =>
|
|
5256
|
-
MULTIPLY: () =>
|
|
5257
|
-
NE: () =>
|
|
5258
|
-
POW: () =>
|
|
5259
|
-
UMINUS: () =>
|
|
5260
|
-
UNARY_PERCENT: () =>
|
|
5261
|
-
UPLUS: () =>
|
|
5262
|
-
}),
|
|
5263
|
-
function
|
|
5246
|
+
var Gs = m({
|
|
5247
|
+
ADD: () => qs,
|
|
5248
|
+
DIVIDE: () => Js,
|
|
5249
|
+
EQ: () => Ys,
|
|
5250
|
+
GT: () => Xs,
|
|
5251
|
+
GTE: () => Zs,
|
|
5252
|
+
ISBETWEEN: () => sc,
|
|
5253
|
+
LT: () => Qs,
|
|
5254
|
+
LTE: () => $s,
|
|
5255
|
+
MINUS: () => ec,
|
|
5256
|
+
MULTIPLY: () => tc,
|
|
5257
|
+
NE: () => nc,
|
|
5258
|
+
POW: () => rc,
|
|
5259
|
+
UMINUS: () => ic,
|
|
5260
|
+
UNARY_PERCENT: () => ac,
|
|
5261
|
+
UPLUS: () => oc
|
|
5262
|
+
}), Ks = (e) => e > -22250738585072014e-324 && e < 22250738585072014e-324 ? 0 : e;
|
|
5263
|
+
function qs(e, t) {
|
|
5264
5264
|
return e + t;
|
|
5265
5265
|
}
|
|
5266
|
-
function
|
|
5267
|
-
if (
|
|
5268
|
-
return
|
|
5266
|
+
function Js(e, n) {
|
|
5267
|
+
if (Ks(n) === 0) throw t.BuiltIn.Div0;
|
|
5268
|
+
return Ks(e / n);
|
|
5269
5269
|
}
|
|
5270
|
-
function
|
|
5270
|
+
function Ys(t, n) {
|
|
5271
5271
|
return e.compare(t, n) === 0;
|
|
5272
5272
|
}
|
|
5273
|
-
function
|
|
5273
|
+
function Xs(t, n) {
|
|
5274
5274
|
return e.compare(t, n) > 0;
|
|
5275
5275
|
}
|
|
5276
|
-
function
|
|
5276
|
+
function Zs(t, n) {
|
|
5277
5277
|
return e.compare(t, n) >= 0;
|
|
5278
5278
|
}
|
|
5279
|
-
function
|
|
5279
|
+
function Qs(t, n) {
|
|
5280
5280
|
return e.compare(t, n) < 0;
|
|
5281
5281
|
}
|
|
5282
|
-
function
|
|
5282
|
+
function $s(t, n) {
|
|
5283
5283
|
return e.compare(t, n) <= 0;
|
|
5284
5284
|
}
|
|
5285
|
-
function
|
|
5285
|
+
function ec(e, t) {
|
|
5286
5286
|
return e - t;
|
|
5287
5287
|
}
|
|
5288
|
-
function
|
|
5289
|
-
return
|
|
5288
|
+
function tc(e, t) {
|
|
5289
|
+
return Ks(e * t);
|
|
5290
5290
|
}
|
|
5291
|
-
function
|
|
5291
|
+
function nc(t, n) {
|
|
5292
5292
|
return e.compare(t, n) !== 0;
|
|
5293
5293
|
}
|
|
5294
|
-
function
|
|
5294
|
+
function rc(e, n) {
|
|
5295
5295
|
if (e === 0) {
|
|
5296
5296
|
if (n < 0) throw t.BuiltIn.Div0;
|
|
5297
5297
|
if (n === 0) return NaN;
|
|
5298
5298
|
}
|
|
5299
5299
|
if (e < 0) {
|
|
5300
|
-
if (Number.isInteger(n) && Math.abs(n) <= 4294967294) return
|
|
5300
|
+
if (Number.isInteger(n) && Math.abs(n) <= 4294967294) return Ks(e ** n);
|
|
5301
5301
|
let t = Number((1 / n).toPrecision(15));
|
|
5302
|
-
return Number.isInteger(t) && Math.abs(t % 2) === 1 ?
|
|
5302
|
+
return Number.isInteger(t) && Math.abs(t % 2) === 1 ? Ks(-((-e) ** n)) : NaN;
|
|
5303
5303
|
}
|
|
5304
|
-
return
|
|
5305
|
-
}
|
|
5306
|
-
function rc(e) {
|
|
5307
|
-
return -1 * e;
|
|
5304
|
+
return Ks(e ** n);
|
|
5308
5305
|
}
|
|
5309
5306
|
function ic(e) {
|
|
5310
|
-
return
|
|
5307
|
+
return -1 * e;
|
|
5311
5308
|
}
|
|
5312
5309
|
function ac(e) {
|
|
5310
|
+
return Js(e, 100);
|
|
5311
|
+
}
|
|
5312
|
+
function oc(e) {
|
|
5313
5313
|
return e;
|
|
5314
5314
|
}
|
|
5315
|
-
function
|
|
5315
|
+
function sc(e, t, n, r = !0, i = !0) {
|
|
5316
5316
|
return (r ? e >= t : e > t) && (i ? e <= n : e < n);
|
|
5317
5317
|
}
|
|
5318
|
-
var
|
|
5319
|
-
let s =
|
|
5318
|
+
var cc = (e) => !!e.isIReferenceRange, lc = (e) => Object.freeze({ coerce: (n, r, a, o) => {
|
|
5319
|
+
let s = cc(o);
|
|
5320
5320
|
if (r === i.String) return s ? 0 : e;
|
|
5321
5321
|
if (r === i.Boolean) return s ? +!!n : null;
|
|
5322
5322
|
if (t.isError(n)) throw n;
|
|
5323
5323
|
return null;
|
|
5324
|
-
} }),
|
|
5324
|
+
} }), uc = lc(null), dc = lc(0), fc = (e, n) => {
|
|
5325
5325
|
if (typeof e == "number") return e;
|
|
5326
5326
|
if (typeof e == "boolean") return n ? +!!e : null;
|
|
5327
5327
|
if (typeof e == "string") return n ? 0 : null;
|
|
5328
5328
|
if (t.isError(e)) throw e;
|
|
5329
5329
|
return null;
|
|
5330
|
-
},
|
|
5331
|
-
AVEDEV: () =>
|
|
5332
|
-
AVERAGE: () =>
|
|
5333
|
-
AVERAGEA: () =>
|
|
5334
|
-
AVERAGEIF: () =>
|
|
5335
|
-
AVERAGEIFS: () =>
|
|
5336
|
-
AVERAGE_WEIGHTED: () =>
|
|
5337
|
-
COUNT: () =>
|
|
5338
|
-
COUNTA: () =>
|
|
5339
|
-
COUNTBLANK: () =>
|
|
5340
|
-
COUNTIF: () =>
|
|
5341
|
-
COUNTIFS: () =>
|
|
5342
|
-
COUNTUNIQUE: () =>
|
|
5343
|
-
COUNTUNIQUEIFS: () =>
|
|
5344
|
-
LARGE: () =>
|
|
5345
|
-
MAX: () =>
|
|
5346
|
-
MAXA: () =>
|
|
5347
|
-
MAXIF: () =>
|
|
5348
|
-
MAXIFS: () =>
|
|
5349
|
-
MEDIAN: () =>
|
|
5350
|
-
MIN: () =>
|
|
5351
|
-
MINA: () =>
|
|
5352
|
-
MINIF: () =>
|
|
5353
|
-
MINIFS: () =>
|
|
5354
|
-
PERMUT: () =>
|
|
5355
|
-
PERMUTATIONA: () =>
|
|
5356
|
-
SMALL: () =>
|
|
5330
|
+
}, pc = m({
|
|
5331
|
+
AVEDEV: () => mc,
|
|
5332
|
+
AVERAGE: () => hc,
|
|
5333
|
+
AVERAGEA: () => gc,
|
|
5334
|
+
AVERAGEIF: () => _c,
|
|
5335
|
+
AVERAGEIFS: () => vc,
|
|
5336
|
+
AVERAGE_WEIGHTED: () => yc,
|
|
5337
|
+
COUNT: () => bc,
|
|
5338
|
+
COUNTA: () => xc,
|
|
5339
|
+
COUNTBLANK: () => Sc,
|
|
5340
|
+
COUNTIF: () => Cc,
|
|
5341
|
+
COUNTIFS: () => wc,
|
|
5342
|
+
COUNTUNIQUE: () => Tc,
|
|
5343
|
+
COUNTUNIQUEIFS: () => Ec,
|
|
5344
|
+
LARGE: () => Dc,
|
|
5345
|
+
MAX: () => Oc,
|
|
5346
|
+
MAXA: () => kc,
|
|
5347
|
+
MAXIF: () => Ac,
|
|
5348
|
+
MAXIFS: () => jc,
|
|
5349
|
+
MEDIAN: () => Mc,
|
|
5350
|
+
MIN: () => Nc,
|
|
5351
|
+
MINA: () => Pc,
|
|
5352
|
+
MINIF: () => Fc,
|
|
5353
|
+
MINIFS: () => Ic,
|
|
5354
|
+
PERMUT: () => Lc,
|
|
5355
|
+
PERMUTATIONA: () => Rc,
|
|
5356
|
+
SMALL: () => zc
|
|
5357
5357
|
});
|
|
5358
|
-
function
|
|
5358
|
+
function mc(e) {
|
|
5359
5359
|
let n = 0, r = [];
|
|
5360
5360
|
for (let t of e) for (let e of t.values()) n += e, r.push(e);
|
|
5361
5361
|
let i = r.length;
|
|
@@ -5365,21 +5365,21 @@ function pc(e) {
|
|
|
5365
5365
|
for (let e = 0; e < i; e++) n += Math.abs(r[e] - a);
|
|
5366
5366
|
return n / i;
|
|
5367
5367
|
}
|
|
5368
|
-
function mc(e) {
|
|
5369
|
-
return Vc(e);
|
|
5370
|
-
}
|
|
5371
5368
|
function hc(e) {
|
|
5372
|
-
return
|
|
5369
|
+
return Hc(e);
|
|
5370
|
+
}
|
|
5371
|
+
function gc(e) {
|
|
5372
|
+
return Hc(e, dc);
|
|
5373
5373
|
}
|
|
5374
|
-
function
|
|
5374
|
+
function _c(e, n, r) {
|
|
5375
5375
|
let i = U(e, n, r, (e, t) => typeof t == "number" ? e + 1 : e, W), a = U(e, n, r, q((e, t) => (e === null && (e = 0), typeof t == "number" ? e + t : e)), W);
|
|
5376
5376
|
return t.isError(a) ? a : i ? a / i : t.BuiltIn.Div0;
|
|
5377
5377
|
}
|
|
5378
|
-
function
|
|
5378
|
+
function vc(n, r) {
|
|
5379
5379
|
let i = Ha(e, r, q((e, t) => typeof t == "number" ? e === null ? t : e + t : e), n, null, W), a = Ha(e, r, (e, t) => typeof t == "number" ? e === null ? 1 : e + 1 : e, n, 0, W);
|
|
5380
5380
|
return t.isError(i) ? i : a === 0 || a === null ? t.BuiltIn.Div0 : i / a;
|
|
5381
5381
|
}
|
|
5382
|
-
function
|
|
5382
|
+
function yc(e) {
|
|
5383
5383
|
let n = 0, r = 0, i = e.length;
|
|
5384
5384
|
for (let a = 0; a < i; a++) {
|
|
5385
5385
|
let [i, o] = e[a], s = i.getRowCount() * i.getColumnCount();
|
|
@@ -5394,12 +5394,12 @@ function vc(e) {
|
|
|
5394
5394
|
if (r === 0) throw t.BuiltIn.Div0;
|
|
5395
5395
|
return n / r;
|
|
5396
5396
|
}
|
|
5397
|
-
function
|
|
5397
|
+
function bc(e) {
|
|
5398
5398
|
let n = 0;
|
|
5399
5399
|
for (let r of e) t.isError(r) || (n += r.getStats().getAggregates().numericalCount ?? 0);
|
|
5400
5400
|
return n;
|
|
5401
5401
|
}
|
|
5402
|
-
function
|
|
5402
|
+
function xc(n) {
|
|
5403
5403
|
let r = e.getArgs().getRepeatingArgsAt(0), i = 0;
|
|
5404
5404
|
for (let e = 0; e < n.length; e++) {
|
|
5405
5405
|
let o = n[e];
|
|
@@ -5411,28 +5411,28 @@ function bc(n) {
|
|
|
5411
5411
|
}
|
|
5412
5412
|
return i;
|
|
5413
5413
|
}
|
|
5414
|
-
function
|
|
5414
|
+
function Sc(n) {
|
|
5415
5415
|
if (e.getArgs().getAreaCountAt(0) > 1) return t.BuiltIn.Value;
|
|
5416
5416
|
let r = 0;
|
|
5417
5417
|
for (let { value: e } of n.entries({ includeEmpty: !1 })) e !== "" && r++;
|
|
5418
5418
|
return n.getColumnCount() * n.getRowCount() - r;
|
|
5419
5419
|
}
|
|
5420
|
-
function
|
|
5420
|
+
function Cc(e, t) {
|
|
5421
5421
|
return U(e, t, void 0, (e) => e === null ? 1 : e + 1, ii);
|
|
5422
5422
|
}
|
|
5423
|
-
function
|
|
5423
|
+
function wc(t) {
|
|
5424
5424
|
return Ha(e, t, (e) => e === null ? 1 : e + 1, void 0, 0, ii);
|
|
5425
5425
|
}
|
|
5426
|
-
function
|
|
5426
|
+
function Tc(e) {
|
|
5427
5427
|
let n = /* @__PURE__ */ new Set(), r = e.length;
|
|
5428
5428
|
for (let i = 0; i < r; i++) {
|
|
5429
5429
|
let r = e[i];
|
|
5430
|
-
if (t.isError(r)) n.add(
|
|
5431
|
-
else for (let e of r.values()) n.add(
|
|
5430
|
+
if (t.isError(r)) n.add(Bc(r));
|
|
5431
|
+
else for (let e of r.values()) n.add(Bc(e));
|
|
5432
5432
|
}
|
|
5433
5433
|
return n.size;
|
|
5434
5434
|
}
|
|
5435
|
-
function
|
|
5435
|
+
function Ec(n, r) {
|
|
5436
5436
|
let i = n.getRowCount(), a = n.getColumnCount(), o = r.length, s = Array(o), c = Array(o);
|
|
5437
5437
|
for (let n = 0; n < o; n++) {
|
|
5438
5438
|
let o = r[n][0];
|
|
@@ -5444,26 +5444,26 @@ function Tc(n, r) {
|
|
|
5444
5444
|
let n = t[0];
|
|
5445
5445
|
if (n === null) return e;
|
|
5446
5446
|
for (let n = 0; n < o; n++) if (!c[n](t[n + 1])) return e;
|
|
5447
|
-
return l.add(
|
|
5447
|
+
return l.add(Bc(n)), e;
|
|
5448
5448
|
}, null), l.size;
|
|
5449
5449
|
}
|
|
5450
|
-
function
|
|
5450
|
+
function Dc(t, n) {
|
|
5451
5451
|
let r = e.flattenAreas(t).getStats().getSortedNumbers().getLarge(n);
|
|
5452
5452
|
return r === null ? NaN : r;
|
|
5453
5453
|
}
|
|
5454
|
-
function Dc(e) {
|
|
5455
|
-
return Bc(e, !0);
|
|
5456
|
-
}
|
|
5457
5454
|
function Oc(e) {
|
|
5458
|
-
return
|
|
5455
|
+
return Vc(e, !0);
|
|
5459
5456
|
}
|
|
5460
|
-
function kc(e
|
|
5457
|
+
function kc(e) {
|
|
5458
|
+
return Vc(e, !0, uc);
|
|
5459
|
+
}
|
|
5460
|
+
function Ac(e, t, n) {
|
|
5461
5461
|
return U(e, t, n, q((e, t) => typeof t == "number" ? e === null ? t : Math.max(e, t) : e ?? 0), W);
|
|
5462
5462
|
}
|
|
5463
|
-
function
|
|
5463
|
+
function jc(t, n) {
|
|
5464
5464
|
return Ha(e, n, q((e, t) => typeof t == "number" ? e === null ? t : Math.max(e, t) : e), t, 0, W);
|
|
5465
5465
|
}
|
|
5466
|
-
function
|
|
5466
|
+
function Mc(e) {
|
|
5467
5467
|
let t = [];
|
|
5468
5468
|
for (let n of e) for (let e of n.values()) t.push(e);
|
|
5469
5469
|
if (t.length === 0) return NaN;
|
|
@@ -5475,36 +5475,36 @@ function jc(e) {
|
|
|
5475
5475
|
}
|
|
5476
5476
|
return t[Math.floor(n / 2)];
|
|
5477
5477
|
}
|
|
5478
|
-
function Mc(e) {
|
|
5479
|
-
return Bc(e, !1);
|
|
5480
|
-
}
|
|
5481
5478
|
function Nc(e) {
|
|
5482
|
-
return
|
|
5479
|
+
return Vc(e, !1);
|
|
5480
|
+
}
|
|
5481
|
+
function Pc(e) {
|
|
5482
|
+
return Vc(e, !1, uc);
|
|
5483
5483
|
}
|
|
5484
|
-
function
|
|
5484
|
+
function Fc(e, t, n) {
|
|
5485
5485
|
return U(e, t, n, q((e, t) => typeof t == "number" ? e === null ? t : Math.min(e, t) : e ?? 0), W);
|
|
5486
5486
|
}
|
|
5487
|
-
function
|
|
5487
|
+
function Ic(t, n) {
|
|
5488
5488
|
return Ha(e, n, q((e, t) => typeof t == "number" ? e === null ? t : Math.min(e, t) : e), t, 0, W);
|
|
5489
5489
|
}
|
|
5490
|
-
function
|
|
5490
|
+
function Lc(e, t) {
|
|
5491
5491
|
if (e = Math.trunc(e), t = Math.trunc(t), e < 0 || t < 0 || t > e || e > 2147483646) return NaN;
|
|
5492
5492
|
let n = 1;
|
|
5493
5493
|
for (let r = e; r > e - t; r--) if (n *= r, !Number.isFinite(n)) return NaN;
|
|
5494
5494
|
return n;
|
|
5495
5495
|
}
|
|
5496
|
-
function
|
|
5496
|
+
function Rc(e, t) {
|
|
5497
5497
|
return e = Math.trunc(e), t = Math.trunc(t), e < 0 || t < 0 || e > 2147483646 || t > 2147483646 ? NaN : e ** +t;
|
|
5498
5498
|
}
|
|
5499
|
-
function
|
|
5499
|
+
function zc(t, n) {
|
|
5500
5500
|
let r = (t = e.flattenAreas(t)).getStats().getSortedNumbers().getSmall(n);
|
|
5501
5501
|
return r === null ? NaN : r;
|
|
5502
5502
|
}
|
|
5503
|
-
var
|
|
5503
|
+
var Bc = (e) => {
|
|
5504
5504
|
if (e === null) return "\0";
|
|
5505
5505
|
let n = typeof e;
|
|
5506
5506
|
return n === "number" ? "" + e.toString() : n === "string" ? "" + e : n === "boolean" ? "" + (e ? "1" : "0") : t.isError(e) ? "" + e.getCode() : "" + String(e);
|
|
5507
|
-
},
|
|
5507
|
+
}, Vc = (e, t, n) => {
|
|
5508
5508
|
let r = 0, i = !1;
|
|
5509
5509
|
for (let a of e) {
|
|
5510
5510
|
let e = a.getStats(n).getAggregates();
|
|
@@ -5513,7 +5513,7 @@ var zc = (e) => {
|
|
|
5513
5513
|
r = i ? t ? Math.max(r, o) : Math.min(r, o) : o, i = !0;
|
|
5514
5514
|
}
|
|
5515
5515
|
return i ? r : 0;
|
|
5516
|
-
},
|
|
5516
|
+
}, Hc = (e, n) => {
|
|
5517
5517
|
let r = 0, i = 0, a = null;
|
|
5518
5518
|
for (let t of e) {
|
|
5519
5519
|
let e = t.getStats(n), o = e.getAggregates();
|
|
@@ -5521,257 +5521,257 @@ var zc = (e) => {
|
|
|
5521
5521
|
}
|
|
5522
5522
|
if (i === 0) throw t.BuiltIn.Div0;
|
|
5523
5523
|
return (a ? a.getSnappedSum(r) : r) / i;
|
|
5524
|
-
},
|
|
5525
|
-
function
|
|
5524
|
+
}, Uc = (e, t, n) => Math.exp(-.5 * Math.log(2 * Math.PI) - Math.log(n) - (e - t) ** 2 / (2 * n * n)), Wc = (e, t, n) => .5 * M(-(e - t) / Math.sqrt(2 * n * n)), Gc = (e, t, n) => -1.4142135623730951 * n * on(2 * e) + t;
|
|
5525
|
+
function Kc(e, t, n) {
|
|
5526
5526
|
return e < 0 ? 0 : e === 0 && t === 1 ? 1 / n : t >= 30 ? Math.exp(function(e, t) {
|
|
5527
5527
|
let n = t / e - 1;
|
|
5528
5528
|
return -e * n * n * (1 + ln(n) * n) / 2 - Math.log1p(n) - .5 * Math.log(e) - .5 * Math.log(2 * Math.PI) - en(e);
|
|
5529
5529
|
}(t, e / n)) / n : Math.exp((t - 1) * Math.log(e) - e / n - j(t) - t * Math.log(n));
|
|
5530
5530
|
}
|
|
5531
|
-
function
|
|
5531
|
+
function qc(e, t) {
|
|
5532
5532
|
return e < 0 ? 1 : ((e, t) => un(e, t, !0))(t / 2, e / 2);
|
|
5533
5533
|
}
|
|
5534
|
-
var
|
|
5535
|
-
function
|
|
5534
|
+
var Jc = (e, t) => 2 * dn(e, .5 * t);
|
|
5535
|
+
function Yc(e, t, n) {
|
|
5536
5536
|
if (e < 0) return 0;
|
|
5537
5537
|
let r = t * e + n;
|
|
5538
5538
|
return mn(t * e / r, n / r, t / 2, n / 2);
|
|
5539
5539
|
}
|
|
5540
|
-
var
|
|
5541
|
-
function
|
|
5540
|
+
var Xc = (e, t, n) => n / (t * (1 / gn(e, t / 2, n / 2) - 1));
|
|
5541
|
+
function Zc(e, t) {
|
|
5542
5542
|
if (!Number.isFinite(e * e)) return NaN;
|
|
5543
|
-
let n = .5 *
|
|
5543
|
+
let n = .5 * Qc(e, t);
|
|
5544
5544
|
return e > 0 ? n : 1 - n;
|
|
5545
5545
|
}
|
|
5546
|
-
function
|
|
5546
|
+
function Qc(e, t) {
|
|
5547
5547
|
let n = t + e * e;
|
|
5548
5548
|
return mn(t / n, e * e / n, t / 2, .5);
|
|
5549
5549
|
}
|
|
5550
|
-
function
|
|
5550
|
+
function $c(e, t) {
|
|
5551
5551
|
let n = gn(2 * Math.min(e, 1 - e), .5 * t, .5);
|
|
5552
5552
|
return n = Math.sqrt(t * (1 - n) / n), e > .5 ? n : -n;
|
|
5553
5553
|
}
|
|
5554
|
-
var
|
|
5555
|
-
function
|
|
5554
|
+
var el = 1e5;
|
|
5555
|
+
function tl(e, t) {
|
|
5556
5556
|
if (t < 0 || e % 1 != 0 || e < 0) return 0;
|
|
5557
5557
|
let n = e <= 170 ? t ** +e * Math.exp(-t) / Ua(e) : Infinity;
|
|
5558
5558
|
return Number.isFinite(n) ? n : t === 0 ? +(e === 0) : Math.exp(e * Math.log(t) - t - j(e + 1));
|
|
5559
5559
|
}
|
|
5560
|
-
var
|
|
5560
|
+
var nl = (e, t, n) => {
|
|
5561
5561
|
if (n === 0 || n === 1) return +(t * n === e);
|
|
5562
5562
|
let r = Wa(t, e) * n ** +e * (1 - n) ** (t - e);
|
|
5563
5563
|
return Number.isFinite(r) ? r : Math.exp(j(t + 1) - j(e + 1) - j(t - e + 1) + e * Math.log(n) + (t - e) * Math.log(1 - n));
|
|
5564
5564
|
};
|
|
5565
|
-
function
|
|
5565
|
+
function rl(e, t, n) {
|
|
5566
5566
|
let r, i = 1e-10;
|
|
5567
5567
|
if (e < 0) return 0;
|
|
5568
5568
|
if (e >= t) return 1;
|
|
5569
5569
|
if (n < 0 || n > 1 || t <= 0) return NaN;
|
|
5570
5570
|
let a = n, o = (e = Math.floor(e)) + 1, s = t - e, c = o + s, l = Math.exp(j(c) - j(s) - j(o) + o * Math.log(a) + s * Math.log(1 - a));
|
|
5571
|
-
return r = a < (o + 1) / (c + 2) ? l *
|
|
5571
|
+
return r = a < (o + 1) / (c + 2) ? l * al(a, o, s, i) : 1 - l * al(1 - a, s, o, i), Math.round(1 / i * (1 - r)) / (1 / i);
|
|
5572
5572
|
}
|
|
5573
|
-
function
|
|
5573
|
+
function il(e, t, n) {
|
|
5574
5574
|
return e !== e >>> 0 || e < 0 ? 0 : Wa(e + t - 1, t - 1) * (1 - n) ** e * n ** +t;
|
|
5575
5575
|
}
|
|
5576
|
-
function
|
|
5576
|
+
function al(e, t, n, r) {
|
|
5577
5577
|
let i, a = 0, o = 1, s = 1, c = 1, l = 0, u = 0;
|
|
5578
5578
|
for (; Math.abs((s - u) / s) > r;) u = s, i = -(t + l) * (t + n + l) * e / (t + 2 * l) / (t + 2 * l + 1), a = s + i * a, o = c + i * o, l += 1, i = l * (n - l) * e / (t + 2 * l - 1) / (t + 2 * l), s = a + i * s, c = o + i * c, a /= c, o /= c, s /= c, c = 1;
|
|
5579
5579
|
return s / t;
|
|
5580
5580
|
}
|
|
5581
|
-
var
|
|
5582
|
-
BETADIST: () =>
|
|
5583
|
-
BETAINV: () =>
|
|
5584
|
-
BETA_DIST: () =>
|
|
5585
|
-
BETA_INV: () =>
|
|
5586
|
-
BINOMDIST: () =>
|
|
5587
|
-
BINOM_DIST: () =>
|
|
5588
|
-
BINOM_DIST_RANGE: () =>
|
|
5589
|
-
BINOM_INV: () =>
|
|
5590
|
-
CHIDIST: () =>
|
|
5591
|
-
CHIINV: () =>
|
|
5592
|
-
CHISQ_DIST: () =>
|
|
5593
|
-
CHISQ_DIST_RT: () =>
|
|
5594
|
-
CHISQ_INV: () =>
|
|
5595
|
-
CHISQ_INV_RT: () =>
|
|
5596
|
-
CHISQ_TEST: () =>
|
|
5597
|
-
CHITEST: () =>
|
|
5598
|
-
CONFIDENCE: () =>
|
|
5599
|
-
CONFIDENCE_NORM: () =>
|
|
5600
|
-
CONFIDENCE_T: () =>
|
|
5601
|
-
CORREL: () =>
|
|
5602
|
-
COVAR: () =>
|
|
5603
|
-
COVARIANCE_P: () =>
|
|
5604
|
-
COVARIANCE_S: () =>
|
|
5605
|
-
CRITBINOM: () =>
|
|
5606
|
-
DEVSQ: () =>
|
|
5607
|
-
EXPONDIST: () =>
|
|
5608
|
-
EXPON_DIST: () =>
|
|
5609
|
-
FDIST: () =>
|
|
5610
|
-
FINV: () =>
|
|
5611
|
-
FISHER: () =>
|
|
5612
|
-
FISHERINV: () =>
|
|
5613
|
-
FORECAST: () =>
|
|
5614
|
-
FORECAST_LINEAR: () =>
|
|
5615
|
-
FREQUENCY: () =>
|
|
5616
|
-
FTEST: () =>
|
|
5617
|
-
F_DIST: () =>
|
|
5618
|
-
F_DIST_RT: () =>
|
|
5619
|
-
F_INV: () =>
|
|
5620
|
-
F_INV_RT: () =>
|
|
5621
|
-
F_TEST: () =>
|
|
5622
|
-
GAMMA: () =>
|
|
5623
|
-
GAMMADIST: () =>
|
|
5624
|
-
GAMMAINV: () =>
|
|
5625
|
-
GAMMALN: () =>
|
|
5626
|
-
GAMMALN_PRECISE: () =>
|
|
5627
|
-
GAMMA_DIST: () =>
|
|
5628
|
-
GAMMA_INV: () =>
|
|
5629
|
-
GAUSS: () =>
|
|
5630
|
-
GEOMEAN: () =>
|
|
5631
|
-
HARMEAN: () =>
|
|
5632
|
-
HYPGEOMDIST: () =>
|
|
5633
|
-
HYPGEOM_DIST: () =>
|
|
5634
|
-
INTERCEPT: () =>
|
|
5635
|
-
KURT: () =>
|
|
5636
|
-
LOGINV: () =>
|
|
5637
|
-
LOGNORMDIST: () =>
|
|
5638
|
-
LOGNORM_DIST: () =>
|
|
5639
|
-
LOGNORM_INV: () =>
|
|
5640
|
-
MODE: () =>
|
|
5641
|
-
MODE_MULT: () =>
|
|
5642
|
-
MODE_SNGL: () =>
|
|
5643
|
-
NEGBINOMDIST: () =>
|
|
5644
|
-
NEGBINOM_DIST: () =>
|
|
5645
|
-
NORMDIST: () =>
|
|
5646
|
-
NORMINV: () =>
|
|
5647
|
-
NORMSDIST: () =>
|
|
5648
|
-
NORMSINV: () =>
|
|
5649
|
-
NORM_DIST: () =>
|
|
5650
|
-
NORM_INV: () =>
|
|
5651
|
-
NORM_S_DIST: () =>
|
|
5652
|
-
NORM_S_INV: () =>
|
|
5653
|
-
PEARSON: () =>
|
|
5654
|
-
PERCENTILE: () =>
|
|
5655
|
-
PERCENTILE_EXC: () =>
|
|
5656
|
-
PERCENTILE_INC: () =>
|
|
5657
|
-
PERCENTRANK: () =>
|
|
5658
|
-
PERCENTRANK_EXC: () =>
|
|
5659
|
-
PERCENTRANK_INC: () =>
|
|
5660
|
-
PHI: () =>
|
|
5661
|
-
POISSON: () =>
|
|
5662
|
-
POISSON_DIST: () =>
|
|
5663
|
-
PROB: () =>
|
|
5664
|
-
QUARTILE: () =>
|
|
5665
|
-
QUARTILE_EXC: () =>
|
|
5666
|
-
QUARTILE_INC: () =>
|
|
5667
|
-
RANK: () =>
|
|
5668
|
-
RANK_AVG: () =>
|
|
5669
|
-
RANK_EQ: () =>
|
|
5670
|
-
RSQ: () =>
|
|
5671
|
-
SKEW: () =>
|
|
5672
|
-
SKEW_P: () =>
|
|
5673
|
-
SLOPE: () =>
|
|
5674
|
-
STANDARDIZE: () =>
|
|
5675
|
-
STDEV: () =>
|
|
5676
|
-
STDEVA: () =>
|
|
5677
|
-
STDEVP: () =>
|
|
5678
|
-
STDEVPA: () =>
|
|
5679
|
-
STDEV_P: () =>
|
|
5680
|
-
STDEV_S: () =>
|
|
5681
|
-
STEYX: () =>
|
|
5682
|
-
TDIST: () =>
|
|
5683
|
-
TINV: () =>
|
|
5684
|
-
TRIMMEAN: () =>
|
|
5685
|
-
T_DIST: () =>
|
|
5686
|
-
T_DIST_2T: () =>
|
|
5687
|
-
T_DIST_RT: () =>
|
|
5688
|
-
T_INV: () =>
|
|
5689
|
-
T_INV_2T: () =>
|
|
5690
|
-
VAR: () =>
|
|
5691
|
-
VARA: () =>
|
|
5692
|
-
VARP: () =>
|
|
5693
|
-
VARPA: () =>
|
|
5694
|
-
VAR_P: () =>
|
|
5695
|
-
VAR_S: () =>
|
|
5696
|
-
WEIBULL: () =>
|
|
5697
|
-
WEIBULL_DIST: () =>
|
|
5698
|
-
ZTEST: () =>
|
|
5699
|
-
Z_TEST: () =>
|
|
5700
|
-
}), X = 1e10,
|
|
5581
|
+
var ol = m({
|
|
5582
|
+
BETADIST: () => ml,
|
|
5583
|
+
BETAINV: () => gl,
|
|
5584
|
+
BETA_DIST: () => pl,
|
|
5585
|
+
BETA_INV: () => hl,
|
|
5586
|
+
BINOMDIST: () => vl,
|
|
5587
|
+
BINOM_DIST: () => _l,
|
|
5588
|
+
BINOM_DIST_RANGE: () => yl,
|
|
5589
|
+
BINOM_INV: () => xl,
|
|
5590
|
+
CHIDIST: () => Cl,
|
|
5591
|
+
CHIINV: () => El,
|
|
5592
|
+
CHISQ_DIST: () => Sl,
|
|
5593
|
+
CHISQ_DIST_RT: () => wl,
|
|
5594
|
+
CHISQ_INV: () => Tl,
|
|
5595
|
+
CHISQ_INV_RT: () => Dl,
|
|
5596
|
+
CHISQ_TEST: () => Ol,
|
|
5597
|
+
CHITEST: () => kl,
|
|
5598
|
+
CONFIDENCE: () => jl,
|
|
5599
|
+
CONFIDENCE_NORM: () => Al,
|
|
5600
|
+
CONFIDENCE_T: () => Ml,
|
|
5601
|
+
CORREL: () => Nl,
|
|
5602
|
+
COVAR: () => Pl,
|
|
5603
|
+
COVARIANCE_P: () => Fl,
|
|
5604
|
+
COVARIANCE_S: () => Il,
|
|
5605
|
+
CRITBINOM: () => Ll,
|
|
5606
|
+
DEVSQ: () => Rl,
|
|
5607
|
+
EXPONDIST: () => Bl,
|
|
5608
|
+
EXPON_DIST: () => zl,
|
|
5609
|
+
FDIST: () => Hl,
|
|
5610
|
+
FINV: () => Gl,
|
|
5611
|
+
FISHER: () => Yl,
|
|
5612
|
+
FISHERINV: () => Xl,
|
|
5613
|
+
FORECAST: () => Zl,
|
|
5614
|
+
FORECAST_LINEAR: () => Ql,
|
|
5615
|
+
FREQUENCY: () => $l,
|
|
5616
|
+
FTEST: () => Jl,
|
|
5617
|
+
F_DIST: () => Vl,
|
|
5618
|
+
F_DIST_RT: () => Ul,
|
|
5619
|
+
F_INV: () => Wl,
|
|
5620
|
+
F_INV_RT: () => Kl,
|
|
5621
|
+
F_TEST: () => ql,
|
|
5622
|
+
GAMMA: () => eu,
|
|
5623
|
+
GAMMADIST: () => nu,
|
|
5624
|
+
GAMMAINV: () => iu,
|
|
5625
|
+
GAMMALN: () => au,
|
|
5626
|
+
GAMMALN_PRECISE: () => ou,
|
|
5627
|
+
GAMMA_DIST: () => tu,
|
|
5628
|
+
GAMMA_INV: () => ru,
|
|
5629
|
+
GAUSS: () => su,
|
|
5630
|
+
GEOMEAN: () => cu,
|
|
5631
|
+
HARMEAN: () => lu,
|
|
5632
|
+
HYPGEOMDIST: () => du,
|
|
5633
|
+
HYPGEOM_DIST: () => uu,
|
|
5634
|
+
INTERCEPT: () => fu,
|
|
5635
|
+
KURT: () => pu,
|
|
5636
|
+
LOGINV: () => _u,
|
|
5637
|
+
LOGNORMDIST: () => hu,
|
|
5638
|
+
LOGNORM_DIST: () => mu,
|
|
5639
|
+
LOGNORM_INV: () => gu,
|
|
5640
|
+
MODE: () => yu,
|
|
5641
|
+
MODE_MULT: () => xu,
|
|
5642
|
+
MODE_SNGL: () => Su,
|
|
5643
|
+
NEGBINOMDIST: () => wu,
|
|
5644
|
+
NEGBINOM_DIST: () => Cu,
|
|
5645
|
+
NORMDIST: () => Eu,
|
|
5646
|
+
NORMINV: () => Ou,
|
|
5647
|
+
NORMSDIST: () => Au,
|
|
5648
|
+
NORMSINV: () => Mu,
|
|
5649
|
+
NORM_DIST: () => Tu,
|
|
5650
|
+
NORM_INV: () => Du,
|
|
5651
|
+
NORM_S_DIST: () => ku,
|
|
5652
|
+
NORM_S_INV: () => ju,
|
|
5653
|
+
PEARSON: () => Nu,
|
|
5654
|
+
PERCENTILE: () => Pu,
|
|
5655
|
+
PERCENTILE_EXC: () => Fu,
|
|
5656
|
+
PERCENTILE_INC: () => Iu,
|
|
5657
|
+
PERCENTRANK: () => Lu,
|
|
5658
|
+
PERCENTRANK_EXC: () => Ru,
|
|
5659
|
+
PERCENTRANK_INC: () => zu,
|
|
5660
|
+
PHI: () => Bu,
|
|
5661
|
+
POISSON: () => Hu,
|
|
5662
|
+
POISSON_DIST: () => Vu,
|
|
5663
|
+
PROB: () => Uu,
|
|
5664
|
+
QUARTILE: () => Wu,
|
|
5665
|
+
QUARTILE_EXC: () => Gu,
|
|
5666
|
+
QUARTILE_INC: () => Ku,
|
|
5667
|
+
RANK: () => qu,
|
|
5668
|
+
RANK_AVG: () => Ju,
|
|
5669
|
+
RANK_EQ: () => Yu,
|
|
5670
|
+
RSQ: () => Xu,
|
|
5671
|
+
SKEW: () => Zu,
|
|
5672
|
+
SKEW_P: () => Qu,
|
|
5673
|
+
SLOPE: () => $u,
|
|
5674
|
+
STANDARDIZE: () => ed,
|
|
5675
|
+
STDEV: () => nd,
|
|
5676
|
+
STDEVA: () => ad,
|
|
5677
|
+
STDEVP: () => id,
|
|
5678
|
+
STDEVPA: () => od,
|
|
5679
|
+
STDEV_P: () => rd,
|
|
5680
|
+
STDEV_S: () => td,
|
|
5681
|
+
STEYX: () => sd,
|
|
5682
|
+
TDIST: () => ld,
|
|
5683
|
+
TINV: () => pd,
|
|
5684
|
+
TRIMMEAN: () => hd,
|
|
5685
|
+
T_DIST: () => cd,
|
|
5686
|
+
T_DIST_2T: () => ud,
|
|
5687
|
+
T_DIST_RT: () => dd,
|
|
5688
|
+
T_INV: () => fd,
|
|
5689
|
+
T_INV_2T: () => md,
|
|
5690
|
+
VAR: () => bd,
|
|
5691
|
+
VARA: () => Sd,
|
|
5692
|
+
VARP: () => vd,
|
|
5693
|
+
VARPA: () => Cd,
|
|
5694
|
+
VAR_P: () => _d,
|
|
5695
|
+
VAR_S: () => yd,
|
|
5696
|
+
WEIBULL: () => Td,
|
|
5697
|
+
WEIBULL_DIST: () => wd,
|
|
5698
|
+
ZTEST: () => Dd,
|
|
5699
|
+
Z_TEST: () => Ed
|
|
5700
|
+
}), X = 1e10, sl = 22250738585072014e-324, cl = (e) => ((e) => {
|
|
5701
5701
|
let t = 0;
|
|
5702
5702
|
for (let n = 0; n < e.length; n++) t += e[n];
|
|
5703
5703
|
return t;
|
|
5704
|
-
})(e) / e.length,
|
|
5705
|
-
let n =
|
|
5704
|
+
})(e) / e.length, ll = (e) => Math.exp(cl(e.map(Math.log))), ul = (e, t) => {
|
|
5705
|
+
let n = cl(e), r = 0;
|
|
5706
5706
|
for (let t = 0; t < e.length; t++) {
|
|
5707
5707
|
let i = e[t] - n;
|
|
5708
5708
|
r += i * i;
|
|
5709
5709
|
}
|
|
5710
5710
|
return Math.sqrt(r / (e.length - +!!t));
|
|
5711
|
-
},
|
|
5711
|
+
}, dl = 2 ** -22, fl = (e, t, n) => {
|
|
5712
5712
|
let r = 0, i = Math.floor(e);
|
|
5713
5713
|
for (; r < i;) {
|
|
5714
|
-
let a = r + Math.floor((i - r) / 2), o =
|
|
5714
|
+
let a = r + Math.floor((i - r) / 2), o = rl(a, e, t) > n, s = o ? r : a + 1, c = o ? a : i;
|
|
5715
5715
|
if (s === r && c === i) break;
|
|
5716
5716
|
r = s, i = c;
|
|
5717
5717
|
}
|
|
5718
|
-
return
|
|
5718
|
+
return rl(r, e, t) > n ? r : NaN;
|
|
5719
5719
|
};
|
|
5720
|
-
function
|
|
5720
|
+
function pl(e, t, n, r, i = 0, a = 1) {
|
|
5721
5721
|
return t <= 0 || n <= 0 || e < i || e > a || i === a ? NaN : (e = (e - i) / (a - i), r ? ((e, t, n) => e > 1 || e < 0 ? +(e > 1) : pn(e, t, n))(e, t, n) : function(e, t, n) {
|
|
5722
5722
|
return e > 1 || e < 0 ? 0 : t === 1 && n === 1 ? 1 : t < 512 && n < 512 ? e ** (t - 1) * (1 - e) ** (n - 1) / Qt(t, n) : Math.exp((t - 1) * Math.log(e) + (n - 1) * Math.log(1 - e) - tn(t, n));
|
|
5723
5723
|
}(e, t, n) / (a - i));
|
|
5724
5724
|
}
|
|
5725
|
-
function pl(e, t, n, r = 0, i = 1) {
|
|
5726
|
-
return fl(e, t, n, !0, r, i);
|
|
5727
|
-
}
|
|
5728
5725
|
function ml(e, t, n, r = 0, i = 1) {
|
|
5729
|
-
return
|
|
5726
|
+
return pl(e, t, n, !0, r, i);
|
|
5730
5727
|
}
|
|
5731
5728
|
function hl(e, t, n, r = 0, i = 1) {
|
|
5732
|
-
return
|
|
5729
|
+
return t <= 0 || n <= 0 || e <= 0 || e >= 1 || r >= i ? NaN : ((e, t, n) => gn(e, t, n))(e, t, n) * (i - r) + r;
|
|
5733
5730
|
}
|
|
5734
|
-
function gl(e, t, n, r) {
|
|
5735
|
-
return
|
|
5731
|
+
function gl(e, t, n, r = 0, i = 1) {
|
|
5732
|
+
return hl(e, t, n, r, i);
|
|
5736
5733
|
}
|
|
5737
5734
|
function _l(e, t, n, r) {
|
|
5738
|
-
return
|
|
5735
|
+
return e = Math.trunc(e), (t = Math.trunc(t)) < 0 || n < 0 || n > 1 || e < 0 || e > t || t > 2147483646 ? NaN : r ? rl(e, t, n) : nl(e, t, n);
|
|
5739
5736
|
}
|
|
5740
|
-
function vl(e, t, n, r
|
|
5737
|
+
function vl(e, t, n, r) {
|
|
5738
|
+
return _l(e, t, n, r);
|
|
5739
|
+
}
|
|
5740
|
+
function yl(e, t, n, r = n) {
|
|
5741
5741
|
if (e = Math.trunc(e), n = Math.trunc(n), r = Math.trunc(r), e < 0 || t < 0 || t > 1 || n < 0 || n > e || r < n || r > e || e > 2147483646) return NaN;
|
|
5742
|
-
if (r - n >
|
|
5742
|
+
if (r - n > bl) return rl(r, e, t) - (n > 0 ? rl(n - 1, e, t) : 0);
|
|
5743
5743
|
let i = 0;
|
|
5744
|
-
for (let a = n; a <= r; a++) i +=
|
|
5744
|
+
for (let a = n; a <= r; a++) i += nl(a, e, t);
|
|
5745
5745
|
return i;
|
|
5746
5746
|
}
|
|
5747
|
-
var
|
|
5748
|
-
function bl(e, t, n) {
|
|
5749
|
-
return (e = Math.floor(e)) < 0 || e > 2147483646 || t <= 0 || t >= 1 || n <= 0 || n >= 1 ? NaN : dl(e, t, n);
|
|
5750
|
-
}
|
|
5747
|
+
var bl = 1e5;
|
|
5751
5748
|
function xl(e, t, n) {
|
|
5749
|
+
return (e = Math.floor(e)) < 0 || e > 2147483646 || t <= 0 || t >= 1 || n <= 0 || n >= 1 ? NaN : fl(e, t, n);
|
|
5750
|
+
}
|
|
5751
|
+
function Sl(e, t, n) {
|
|
5752
5752
|
return t = Math.trunc(t), e < 0 || t < 1 || t > X ? NaN : n ? function(e, t) {
|
|
5753
5753
|
return e < 0 ? 0 : sn(t / 2, e / 2);
|
|
5754
5754
|
}(e, t) : function(e, t) {
|
|
5755
5755
|
return e < 0 ? 0 : e === 0 && t === 2 ? .5 : Math.exp((t / 2 - 1) * Math.log(e) - e / 2 - t / 2 * Math.log(2) - j(t / 2));
|
|
5756
5756
|
}(e, t);
|
|
5757
5757
|
}
|
|
5758
|
-
function Sl(e, t) {
|
|
5759
|
-
return Cl(e, t);
|
|
5760
|
-
}
|
|
5761
5758
|
function Cl(e, t) {
|
|
5762
|
-
return
|
|
5759
|
+
return wl(e, t);
|
|
5763
5760
|
}
|
|
5764
5761
|
function wl(e, t) {
|
|
5765
|
-
return t = Math.trunc(t), e < 0 ||
|
|
5762
|
+
return t = Math.trunc(t), e < 0 || t < 1 || t > X ? NaN : qc(e, t);
|
|
5766
5763
|
}
|
|
5767
5764
|
function Tl(e, t) {
|
|
5768
|
-
return
|
|
5765
|
+
return t = Math.trunc(t), e < 0 || e >= 1 || t < 1 || t > X ? NaN : Jc(e, t);
|
|
5769
5766
|
}
|
|
5770
5767
|
function El(e, t) {
|
|
5771
|
-
return
|
|
5768
|
+
return Dl(e, t);
|
|
5772
5769
|
}
|
|
5773
|
-
function Dl(e,
|
|
5774
|
-
|
|
5770
|
+
function Dl(e, t) {
|
|
5771
|
+
return t = Math.trunc(t), e <= 0 || e > 1 || t < 1 || t > X ? NaN : Jc(1 - e, t);
|
|
5772
|
+
}
|
|
5773
|
+
function Ol(e, n) {
|
|
5774
|
+
let r = kd(e) ?? kd(n);
|
|
5775
5775
|
if (r) return r;
|
|
5776
5776
|
let i = e.getRowCount(), a = e.getColumnCount();
|
|
5777
5777
|
if (i * a !== n.getRowCount() * n.getColumnCount()) throw t.BuiltIn.NA;
|
|
@@ -5788,45 +5788,45 @@ function Dl(e, n) {
|
|
|
5788
5788
|
s += (e - n) ** 2 / n, c++;
|
|
5789
5789
|
}
|
|
5790
5790
|
}
|
|
5791
|
-
return c === 0 ? t.BuiltIn.Div0 : Number.isFinite(s) ?
|
|
5791
|
+
return c === 0 ? t.BuiltIn.Div0 : Number.isFinite(s) ? wl(s, o) : t.BuiltIn.Num;
|
|
5792
5792
|
}
|
|
5793
|
-
function
|
|
5794
|
-
return
|
|
5793
|
+
function kl(e, t) {
|
|
5794
|
+
return Ol(e, t);
|
|
5795
5795
|
}
|
|
5796
|
-
function
|
|
5796
|
+
function Al(e, t, n) {
|
|
5797
5797
|
return n = Math.trunc(n), e <= 0 || e >= 1 || t <= 0 || n < 1 || 1 - e / 2 == 1 ? NaN : function(e, t, n) {
|
|
5798
|
-
return 1 + Math.abs(
|
|
5798
|
+
return 1 + Math.abs(Gc(e / 2, 0, 1) * t / Math.sqrt(n)) - 1;
|
|
5799
5799
|
}(e, t, n);
|
|
5800
5800
|
}
|
|
5801
|
-
function
|
|
5802
|
-
return
|
|
5801
|
+
function jl(e, t, n) {
|
|
5802
|
+
return Al(e, t, n);
|
|
5803
5803
|
}
|
|
5804
|
-
function
|
|
5804
|
+
function Ml(e, n, r) {
|
|
5805
5805
|
if (r = Math.trunc(r), e <= 0 || e >= 1 || n <= 0 || r < 1) return NaN;
|
|
5806
5806
|
if (r === 1) throw t.BuiltIn.Div0;
|
|
5807
|
-
return r - 1 > X || e / 2 <
|
|
5808
|
-
return 1 + Math.abs(
|
|
5807
|
+
return r - 1 > X || e / 2 < sl ? NaN : function(e, t, n) {
|
|
5808
|
+
return 1 + Math.abs($c(e / 2, n - 1) * t / Math.sqrt(n)) - 1;
|
|
5809
5809
|
}(e, n, r);
|
|
5810
5810
|
}
|
|
5811
|
-
function
|
|
5811
|
+
function Nl(e, n) {
|
|
5812
5812
|
let r = Z(e, n);
|
|
5813
5813
|
return t.isError(r) ? r : r === null ? t.BuiltIn.NA : Number.isFinite(r.ssX) && Number.isFinite(r.ssY) ? r.ssX === 0 || r.ssY === 0 ? t.BuiltIn.Div0 : r.ssXY / Math.sqrt(r.ssX * r.ssY) : t.BuiltIn.Num;
|
|
5814
5814
|
}
|
|
5815
|
-
function
|
|
5816
|
-
return
|
|
5815
|
+
function Pl(e, t) {
|
|
5816
|
+
return Fl(e, t);
|
|
5817
5817
|
}
|
|
5818
|
-
function
|
|
5818
|
+
function Fl(e, n) {
|
|
5819
5819
|
let r = Z(e, n);
|
|
5820
5820
|
return t.isError(r) ? r : r === null ? t.BuiltIn.NA : r.n === 0 ? t.BuiltIn.Div0 : Number.isFinite(r.ssXY) ? r.ssXY / r.n : t.BuiltIn.Num;
|
|
5821
5821
|
}
|
|
5822
|
-
function
|
|
5822
|
+
function Il(e, n) {
|
|
5823
5823
|
let r = Z(e, n);
|
|
5824
5824
|
return t.isError(r) ? r : r === null ? t.BuiltIn.NA : r.n <= 1 ? t.BuiltIn.Div0 : Number.isFinite(r.ssXY) ? r.ssXY / (r.n - 1) : t.BuiltIn.Num;
|
|
5825
5825
|
}
|
|
5826
|
-
function
|
|
5827
|
-
return
|
|
5826
|
+
function Ll(e, t, n) {
|
|
5827
|
+
return xl(e, t, n);
|
|
5828
5828
|
}
|
|
5829
|
-
function
|
|
5829
|
+
function Rl(e) {
|
|
5830
5830
|
let n = 0, r = [];
|
|
5831
5831
|
for (let t of e) for (let e of t.values()) n += e, r.push(e);
|
|
5832
5832
|
let i = r.length;
|
|
@@ -5836,38 +5836,38 @@ function Ll(e) {
|
|
|
5836
5836
|
for (let e = 0; e < i; e++) n += (r[e] - a) ** 2;
|
|
5837
5837
|
return n;
|
|
5838
5838
|
}
|
|
5839
|
-
function
|
|
5839
|
+
function zl(e, t, n) {
|
|
5840
5840
|
return e < 0 || t <= 0 ? NaN : Number.isFinite(t * e) ? n ? ((e, t) => e < 0 ? 0 : 1 - Math.exp(-t * e))(e, t) : ((e, t) => e < 0 ? 0 : t * Math.exp(-t * e))(e, t) : NaN;
|
|
5841
5841
|
}
|
|
5842
|
-
function
|
|
5843
|
-
return
|
|
5842
|
+
function Bl(e, t, n) {
|
|
5843
|
+
return zl(e, t, n);
|
|
5844
5844
|
}
|
|
5845
|
-
function
|
|
5846
|
-
return e < 0 || t < 1 || n < 1 ? NaN : (t = Math.trunc(t), n = Math.trunc(n), t > X || n > X ? NaN : r ?
|
|
5845
|
+
function Vl(e, t, n, r) {
|
|
5846
|
+
return e < 0 || t < 1 || n < 1 ? NaN : (t = Math.trunc(t), n = Math.trunc(n), t > X || n > X ? NaN : r ? Yc(e, t, n) : function(e, t, n) {
|
|
5847
5847
|
return e < 0 ? 0 : e === 0 && t < 2 ? Infinity : e === 0 && t === 2 ? 1 : t < 512 && n < 512 ? 1 / Qt(t / 2, n / 2) * (t / n) ** (t / 2) * e ** (t / 2 - 1) * (1 + t / n * e) ** (-(t + n) / 2) : Math.exp(t / 2 * Math.log(t / n) + (t / 2 - 1) * Math.log(e) - (t + n) / 2 * Math.log(1 + t / n * e) - tn(t / 2, n / 2));
|
|
5848
5848
|
}(e, t, n));
|
|
5849
5849
|
}
|
|
5850
|
-
function Vl(e, t, n) {
|
|
5851
|
-
return Hl(e, t, n);
|
|
5852
|
-
}
|
|
5853
5850
|
function Hl(e, t, n) {
|
|
5851
|
+
return Ul(e, t, n);
|
|
5852
|
+
}
|
|
5853
|
+
function Ul(e, t, n) {
|
|
5854
5854
|
return e < 0 || t < 1 || n < 1 ? NaN : (t = Math.trunc(t), n = Math.trunc(n), t > X || n > X ? NaN : function(e, t, n) {
|
|
5855
5855
|
if (e < 0) return 1;
|
|
5856
5856
|
let r = t * e + n;
|
|
5857
5857
|
return mn(n / r, t * e / r, n / 2, t / 2);
|
|
5858
5858
|
}(e, t, n));
|
|
5859
5859
|
}
|
|
5860
|
-
function Ul(e, t, n) {
|
|
5861
|
-
return e < 0 || e > 1 || t < 1 || n < 1 ? NaN : (t = Math.trunc(t), n = Math.trunc(n), t > X || n > X ? NaN : Yc(e, t, n));
|
|
5862
|
-
}
|
|
5863
5860
|
function Wl(e, t, n) {
|
|
5864
|
-
return
|
|
5861
|
+
return e < 0 || e > 1 || t < 1 || n < 1 ? NaN : (t = Math.trunc(t), n = Math.trunc(n), t > X || n > X ? NaN : Xc(e, t, n));
|
|
5865
5862
|
}
|
|
5866
5863
|
function Gl(e, t, n) {
|
|
5867
|
-
return
|
|
5864
|
+
return Kl(e, t, n);
|
|
5868
5865
|
}
|
|
5869
|
-
function Kl(e, n) {
|
|
5870
|
-
|
|
5866
|
+
function Kl(e, t, n) {
|
|
5867
|
+
return e < 0 || e > 1 || t < 1 || n < 1 ? NaN : (t = Math.trunc(t), n = Math.trunc(n), t > X || n > X ? NaN : Xc(1 - e, t, n));
|
|
5868
|
+
}
|
|
5869
|
+
function ql(e, n) {
|
|
5870
|
+
let r = kd(e) ?? kd(n);
|
|
5871
5871
|
if (r) return r;
|
|
5872
5872
|
if (e.hasError()) return e.firstError();
|
|
5873
5873
|
if (n.hasError()) return n.firstError();
|
|
@@ -5886,23 +5886,23 @@ function Kl(e, n) {
|
|
|
5886
5886
|
for (let e = 0; e < a.length; e++) l += (s - a[e]) ** 2;
|
|
5887
5887
|
if (l /= a.length - 1, c = g(c), l = g(l), c === 0 || l === 0) return t.BuiltIn.Div0;
|
|
5888
5888
|
if (!Number.isFinite(c) || !Number.isFinite(l)) return t.BuiltIn.Num;
|
|
5889
|
-
let u =
|
|
5889
|
+
let u = Yc(c / l, i.length - 1, a.length - 1);
|
|
5890
5890
|
return 2 * Math.min(u, 1 - u);
|
|
5891
5891
|
}
|
|
5892
|
-
function
|
|
5893
|
-
return
|
|
5892
|
+
function Jl(e, t) {
|
|
5893
|
+
return ql(e, t);
|
|
5894
5894
|
}
|
|
5895
|
-
function
|
|
5895
|
+
function Yl(e) {
|
|
5896
5896
|
return e > -1 && e < 1 ? Math.log((1 + e) / (1 - e)) / 2 : NaN;
|
|
5897
5897
|
}
|
|
5898
|
-
function
|
|
5898
|
+
function Xl(e) {
|
|
5899
5899
|
let t = Math.exp(2 * e);
|
|
5900
5900
|
return t === Infinity ? 1 : (t - 1) / (t + 1);
|
|
5901
5901
|
}
|
|
5902
|
-
function
|
|
5903
|
-
return
|
|
5902
|
+
function Zl(e, t, n) {
|
|
5903
|
+
return Ql(e, t, n);
|
|
5904
5904
|
}
|
|
5905
|
-
function
|
|
5905
|
+
function Ql(e, n, r) {
|
|
5906
5906
|
let i = Z(n, r);
|
|
5907
5907
|
if (t.isError(i)) return i;
|
|
5908
5908
|
if (i === null) return t.BuiltIn.NA;
|
|
@@ -5911,7 +5911,7 @@ function Zl(e, n, r) {
|
|
|
5911
5911
|
let a = i.ssXY / i.ssX, o = i.yMean - a * i.xMean + a * e;
|
|
5912
5912
|
return Number.isFinite(o) ? o : t.BuiltIn.Num;
|
|
5913
5913
|
}
|
|
5914
|
-
function
|
|
5914
|
+
function $l(t, n) {
|
|
5915
5915
|
if (t = e.flattenAreas(t), n = e.flattenAreas(n), t.hasError()) throw t.firstError();
|
|
5916
5916
|
let r = [];
|
|
5917
5917
|
for (let e of n.values()) typeof e == "number" && r.push(e);
|
|
@@ -5933,42 +5933,42 @@ function Ql(t, n) {
|
|
|
5933
5933
|
for (let e = 0; e < i.length; e++) i[e] > s && c++;
|
|
5934
5934
|
return o[r.length][0] = c, o;
|
|
5935
5935
|
}
|
|
5936
|
-
function
|
|
5936
|
+
function eu(e) {
|
|
5937
5937
|
return e === 0 || e < 0 && e === Math.trunc(e) ? NaN : Zt(e);
|
|
5938
5938
|
}
|
|
5939
|
-
function
|
|
5939
|
+
function tu(e, t, n, r) {
|
|
5940
5940
|
return e < 0 || t <= 0 || n <= 0 ? NaN : Number.isFinite(j(t)) && Number.isFinite(e / n * 2) ? r ? function(e, t, n) {
|
|
5941
5941
|
return e < 0 ? 0 : sn(t, e / n);
|
|
5942
|
-
}(e, t, n) :
|
|
5942
|
+
}(e, t, n) : Kc(e, t, n) : NaN;
|
|
5943
5943
|
}
|
|
5944
|
-
function
|
|
5945
|
-
return
|
|
5944
|
+
function nu(e, t, n, r) {
|
|
5945
|
+
return tu(e, t, n, r);
|
|
5946
5946
|
}
|
|
5947
|
-
function
|
|
5947
|
+
function ru(e, t, n) {
|
|
5948
5948
|
return e < 0 || e >= 1 || t <= 0 || n <= 0 ? NaN : (r = n, dn(e, t) * r);
|
|
5949
5949
|
var r;
|
|
5950
5950
|
}
|
|
5951
|
-
function
|
|
5952
|
-
return
|
|
5953
|
-
}
|
|
5954
|
-
function iu(e) {
|
|
5955
|
-
return e <= 0 ? NaN : j(e);
|
|
5951
|
+
function iu(e, t, n) {
|
|
5952
|
+
return ru(e, t, n);
|
|
5956
5953
|
}
|
|
5957
5954
|
function au(e) {
|
|
5958
5955
|
return e <= 0 ? NaN : j(e);
|
|
5959
5956
|
}
|
|
5960
5957
|
function ou(e) {
|
|
5961
|
-
return
|
|
5958
|
+
return e <= 0 ? NaN : j(e);
|
|
5962
5959
|
}
|
|
5963
5960
|
function su(e) {
|
|
5961
|
+
return Wc(e, 0, 1) - .5;
|
|
5962
|
+
}
|
|
5963
|
+
function cu(e) {
|
|
5964
5964
|
let t = [];
|
|
5965
5965
|
for (let n of e) for (let e of n.values()) {
|
|
5966
5966
|
if (e <= 0) return NaN;
|
|
5967
5967
|
t.push(e);
|
|
5968
5968
|
}
|
|
5969
|
-
return
|
|
5969
|
+
return ll(t);
|
|
5970
5970
|
}
|
|
5971
|
-
function
|
|
5971
|
+
function lu(e) {
|
|
5972
5972
|
let n = 0, r = 0;
|
|
5973
5973
|
for (let t of e) for (let e of t.values()) {
|
|
5974
5974
|
if (e <= 0) return NaN;
|
|
@@ -5977,7 +5977,7 @@ function cu(e) {
|
|
|
5977
5977
|
if (n === 0) throw t.BuiltIn.NA;
|
|
5978
5978
|
return n / r;
|
|
5979
5979
|
}
|
|
5980
|
-
function
|
|
5980
|
+
function uu(e, t, n, r, i) {
|
|
5981
5981
|
if (e = Math.trunc(e), t = Math.trunc(t), n = Math.trunc(n), r = Math.trunc(r), e < 0 || t < 0 || n < 0 || r < 0 || t > r || n > r || e > 2147483646 || r > 2147483646) return NaN;
|
|
5982
5982
|
let a = (e) => {
|
|
5983
5983
|
if (e > t || e > n || t - e > r - n) return 0;
|
|
@@ -5992,10 +5992,10 @@ function lu(e, t, n, r, i) {
|
|
|
5992
5992
|
for (let e = 0; e <= s; e++) o += a(e);
|
|
5993
5993
|
return o;
|
|
5994
5994
|
}
|
|
5995
|
-
function
|
|
5996
|
-
return
|
|
5995
|
+
function du(e, t, n, r) {
|
|
5996
|
+
return uu(e, t, n, r, !1);
|
|
5997
5997
|
}
|
|
5998
|
-
function
|
|
5998
|
+
function fu(e, n) {
|
|
5999
5999
|
let r = Z(e, n);
|
|
6000
6000
|
if (t.isError(r)) return r;
|
|
6001
6001
|
if (r === null) return t.BuiltIn.NA;
|
|
@@ -6004,7 +6004,7 @@ function du(e, n) {
|
|
|
6004
6004
|
let i = r.ssXY / r.ssX, a = r.yMean - i * r.xMean;
|
|
6005
6005
|
return Number.isFinite(a) ? a : t.BuiltIn.Num;
|
|
6006
6006
|
}
|
|
6007
|
-
function
|
|
6007
|
+
function pu(e) {
|
|
6008
6008
|
let n = 0, r = [];
|
|
6009
6009
|
for (let t of e) for (let e of t.values()) n += e, r.push(e);
|
|
6010
6010
|
let i = r.length;
|
|
@@ -6012,28 +6012,28 @@ function fu(e) {
|
|
|
6012
6012
|
n /= i;
|
|
6013
6013
|
let a = 0;
|
|
6014
6014
|
for (let e = 0; e < i; e++) a += (r[e] - n) ** 4;
|
|
6015
|
-
let o =
|
|
6015
|
+
let o = ul(r, !0);
|
|
6016
6016
|
if (o === 0) throw t.BuiltIn.Div0;
|
|
6017
6017
|
return a /= o ** 4, i * (i + 1) / ((i - 1) * (i - 2) * (i - 3)) * a - 3 * (i - 1) * (i - 1) / ((i - 2) * (i - 3));
|
|
6018
6018
|
}
|
|
6019
|
-
function
|
|
6019
|
+
function mu(e, t, n, r) {
|
|
6020
6020
|
return e <= 0 || n <= 0 ? NaN : r ? function(e, t, n) {
|
|
6021
6021
|
return e < 0 ? 0 : .5 * M(-(Math.log(e) - t) / Math.sqrt(2 * n * n));
|
|
6022
6022
|
}(e, t, n) : function(e, t, n) {
|
|
6023
6023
|
return e <= 0 ? 0 : Math.exp(-Math.log(e) - .5 * Math.log(2 * Math.PI) - Math.log(n) - (Math.log(e) - t) ** 2 / (2 * n * n));
|
|
6024
6024
|
}(e, t, n);
|
|
6025
6025
|
}
|
|
6026
|
-
function mu(e, t, n) {
|
|
6027
|
-
return pu(e, t, n, !0);
|
|
6028
|
-
}
|
|
6029
6026
|
function hu(e, t, n) {
|
|
6027
|
+
return mu(e, t, n, !0);
|
|
6028
|
+
}
|
|
6029
|
+
function gu(e, t, n) {
|
|
6030
6030
|
return e <= 0 || e >= 1 || n <= 0 ? NaN : (r = e, i = t, a = n, Math.exp(-1.4142135623730951 * a * on(2 * r) + i));
|
|
6031
6031
|
var r, i, a;
|
|
6032
6032
|
}
|
|
6033
|
-
function
|
|
6034
|
-
return
|
|
6033
|
+
function _u(e, t, n) {
|
|
6034
|
+
return gu(e, t, n);
|
|
6035
6035
|
}
|
|
6036
|
-
var
|
|
6036
|
+
var vu = () => {
|
|
6037
6037
|
let n = e.getArgs().getRepeatingArgsAt(0);
|
|
6038
6038
|
for (let e = 0; e < n.getLength(); e++) {
|
|
6039
6039
|
if (n.getKindAt(e) === a.Reference) {
|
|
@@ -6044,17 +6044,17 @@ var _u = () => {
|
|
|
6044
6044
|
}
|
|
6045
6045
|
return null;
|
|
6046
6046
|
};
|
|
6047
|
-
function
|
|
6048
|
-
return
|
|
6047
|
+
function yu(e) {
|
|
6048
|
+
return Su(e);
|
|
6049
6049
|
}
|
|
6050
|
-
var
|
|
6051
|
-
for (let n of e) if (n.size === 1 &&
|
|
6050
|
+
var bu = (e) => {
|
|
6051
|
+
for (let n of e) if (n.size === 1 && cc(n) && n.entries({ includeEmpty: !1 }).next().done) throw t.BuiltIn.Value;
|
|
6052
6052
|
};
|
|
6053
|
-
function
|
|
6054
|
-
let n =
|
|
6053
|
+
function xu(e) {
|
|
6054
|
+
let n = vu();
|
|
6055
6055
|
if (n) throw n;
|
|
6056
6056
|
for (let t of e) if (t.hasError()) throw t.firstError();
|
|
6057
|
-
|
|
6057
|
+
bu(e);
|
|
6058
6058
|
let r = /* @__PURE__ */ new Map(), i = 0;
|
|
6059
6059
|
for (let t of e) {
|
|
6060
6060
|
let e = t.entries({ includeEmpty: !1 }), n = e.next();
|
|
@@ -6075,10 +6075,10 @@ function bu(e) {
|
|
|
6075
6075
|
let o = [...r.entries()].filter(([, { count: e }]) => e === a).sort((e, t) => e[1].firstSeen - t[1].firstSeen).map(([e]) => [e]);
|
|
6076
6076
|
return o.length === 0 ? t.BuiltIn.NA : o;
|
|
6077
6077
|
}
|
|
6078
|
-
function
|
|
6079
|
-
let n =
|
|
6078
|
+
function Su(e) {
|
|
6079
|
+
let n = vu();
|
|
6080
6080
|
if (n) return n;
|
|
6081
|
-
|
|
6081
|
+
bu(e);
|
|
6082
6082
|
let r = /* @__PURE__ */ new Map(), i = 0;
|
|
6083
6083
|
for (let t of e) {
|
|
6084
6084
|
if (t.hasError()) return t.firstError();
|
|
@@ -6099,85 +6099,85 @@ function xu(e) {
|
|
|
6099
6099
|
for (let [e, { count: t, firstSeen: n }] of r) t < 2 || (t > o || t === o && n < s) && (a = e, o = t, s = n);
|
|
6100
6100
|
return a === null ? t.BuiltIn.NA : a;
|
|
6101
6101
|
}
|
|
6102
|
-
function
|
|
6102
|
+
function Cu(e, t, n, r) {
|
|
6103
6103
|
return e = Math.trunc(e), t = Math.trunc(t), n <= 0 || n >= 1 || e < 0 || t < 1 ? NaN : r ? function(e, t, n) {
|
|
6104
6104
|
if (e < 0) return 0;
|
|
6105
|
-
let r = 0, i = !1, a = Math.min(e,
|
|
6105
|
+
let r = 0, i = !1, a = Math.min(e, el);
|
|
6106
6106
|
for (let o = 0; o <= a; o++) {
|
|
6107
|
-
let a =
|
|
6107
|
+
let a = il(o, t, n);
|
|
6108
6108
|
if (!Number.isFinite(a)) return pn(n, t, Math.floor(e) + 1);
|
|
6109
6109
|
if (a === 0 && i) return r;
|
|
6110
6110
|
a !== 0 && (i = !0), r += a;
|
|
6111
6111
|
}
|
|
6112
|
-
return i && e <=
|
|
6113
|
-
}(e, t, n) :
|
|
6112
|
+
return i && e <= el ? r : pn(n, t, Math.floor(e) + 1);
|
|
6113
|
+
}(e, t, n) : il(e, t, n);
|
|
6114
6114
|
}
|
|
6115
|
-
function
|
|
6116
|
-
return
|
|
6115
|
+
function wu(e, t, n) {
|
|
6116
|
+
return Cu(e, t, n, !1);
|
|
6117
6117
|
}
|
|
6118
|
-
function
|
|
6118
|
+
function Tu(e, t, n, r) {
|
|
6119
6119
|
if (n <= 0) return NaN;
|
|
6120
|
-
if (r) return
|
|
6120
|
+
if (r) return Wc(e, t, n);
|
|
6121
6121
|
let i = (e - t) / n;
|
|
6122
|
-
return Number.isFinite(i * i) ?
|
|
6123
|
-
}
|
|
6124
|
-
function Tu(e, t, n, r) {
|
|
6125
|
-
return wu(e, t, n, r);
|
|
6122
|
+
return Number.isFinite(i * i) ? Uc(e, t, n) : NaN;
|
|
6126
6123
|
}
|
|
6127
|
-
function Eu(e, t, n) {
|
|
6128
|
-
return
|
|
6124
|
+
function Eu(e, t, n, r) {
|
|
6125
|
+
return Tu(e, t, n, r);
|
|
6129
6126
|
}
|
|
6130
6127
|
function Du(e, t, n) {
|
|
6131
|
-
return
|
|
6128
|
+
return e <= 0 || e >= 1 || n <= 0 ? NaN : Gc(e, t, n);
|
|
6132
6129
|
}
|
|
6133
|
-
function Ou(e, t) {
|
|
6134
|
-
return
|
|
6130
|
+
function Ou(e, t, n) {
|
|
6131
|
+
return Du(e, t, n);
|
|
6135
6132
|
}
|
|
6136
|
-
function ku(e) {
|
|
6137
|
-
return
|
|
6133
|
+
function ku(e, t) {
|
|
6134
|
+
return t ? Wc(e, 0, 1) : Number.isFinite(e * e) ? Uc(e, 0, 1) : NaN;
|
|
6138
6135
|
}
|
|
6139
6136
|
function Au(e) {
|
|
6140
|
-
return
|
|
6137
|
+
return ku(e, !0);
|
|
6141
6138
|
}
|
|
6142
6139
|
function ju(e) {
|
|
6143
|
-
return
|
|
6140
|
+
return e <= 0 || e >= 1 ? NaN : Gc(e, 0, 1);
|
|
6144
6141
|
}
|
|
6145
|
-
function Mu(e
|
|
6146
|
-
return
|
|
6142
|
+
function Mu(e) {
|
|
6143
|
+
return ju(e);
|
|
6147
6144
|
}
|
|
6148
|
-
function Nu(
|
|
6149
|
-
return
|
|
6145
|
+
function Nu(e, t) {
|
|
6146
|
+
return Nl(e, t);
|
|
6150
6147
|
}
|
|
6151
6148
|
function Pu(t, n) {
|
|
6149
|
+
return Iu(t = e.flattenAreas(t), n);
|
|
6150
|
+
}
|
|
6151
|
+
function Fu(t, n) {
|
|
6152
6152
|
if ((t = e.flattenAreas(t)).hasError()) throw t.firstError();
|
|
6153
6153
|
if (n <= 0 || n >= 1) return NaN;
|
|
6154
6154
|
let r = t.getStats().getSortedNumbers().getPercentile(n, !0);
|
|
6155
6155
|
return r === null ? NaN : r;
|
|
6156
6156
|
}
|
|
6157
|
-
function
|
|
6157
|
+
function Iu(t, n) {
|
|
6158
6158
|
if ((t = e.flattenAreas(t)).hasError()) throw t.firstError();
|
|
6159
6159
|
if (n < 0 || n > 1) return NaN;
|
|
6160
6160
|
let r = t.getStats().getSortedNumbers().getPercentile(n, !1);
|
|
6161
6161
|
return r === null ? NaN : r;
|
|
6162
6162
|
}
|
|
6163
|
-
function
|
|
6164
|
-
return
|
|
6163
|
+
function Lu(t, n, r = 3) {
|
|
6164
|
+
return zu(t = e.flattenAreas(t), n, r);
|
|
6165
6165
|
}
|
|
6166
|
-
function
|
|
6166
|
+
function Ru(n, r, i = 3) {
|
|
6167
6167
|
return (n = e.flattenAreas(n)).hasError() ? n.firstError() : n.getStats().getSortedNumbers().getPercentRankOf(r, !0, i) ?? t.BuiltIn.NA;
|
|
6168
6168
|
}
|
|
6169
|
-
function
|
|
6169
|
+
function zu(n, r, i = 3) {
|
|
6170
6170
|
return (n = e.flattenAreas(n)).hasError() ? n.firstError() : n.getStats().getSortedNumbers().getPercentRankOf(r, !1, i) ?? t.BuiltIn.NA;
|
|
6171
6171
|
}
|
|
6172
|
-
function
|
|
6173
|
-
return Number.isFinite(e * e) ? Math.exp(-.5 * e * e) /
|
|
6172
|
+
function Bu(e) {
|
|
6173
|
+
return Number.isFinite(e * e) ? Math.exp(-.5 * e * e) / Od : NaN;
|
|
6174
6174
|
}
|
|
6175
|
-
function
|
|
6175
|
+
function Vu(e, t, n) {
|
|
6176
6176
|
return e < 0 || t < 0 ? NaN : (e = Math.trunc(e), Number.isFinite(j(e + 1)) ? n ? function(e, t) {
|
|
6177
6177
|
if (e < 0) return 0;
|
|
6178
6178
|
if (e <= 170) {
|
|
6179
6179
|
let n = [];
|
|
6180
|
-
for (let r = 0; r <= e; r++) n.push(
|
|
6180
|
+
for (let r = 0; r <= e; r++) n.push(tl(r, t));
|
|
6181
6181
|
if (n.every(Number.isFinite)) {
|
|
6182
6182
|
let e = 0;
|
|
6183
6183
|
for (let t = n.length - 1; t >= 0; t--) e += n[t];
|
|
@@ -6185,13 +6185,13 @@ function Bu(e, t, n) {
|
|
|
6185
6185
|
}
|
|
6186
6186
|
}
|
|
6187
6187
|
return 1 - sn(Math.floor(e) + 1, t);
|
|
6188
|
-
}(e, t) :
|
|
6188
|
+
}(e, t) : tl(e, t) : NaN);
|
|
6189
6189
|
}
|
|
6190
|
-
function
|
|
6191
|
-
return
|
|
6190
|
+
function Hu(e, t, n) {
|
|
6191
|
+
return Vu(e, t, n);
|
|
6192
6192
|
}
|
|
6193
|
-
function
|
|
6194
|
-
|
|
6193
|
+
function Uu(e, n, r, i) {
|
|
6194
|
+
bu([e, n]);
|
|
6195
6195
|
let a = e.flatten(), o = n.flatten();
|
|
6196
6196
|
if (a.getRowCount() !== o.getRowCount()) return t.BuiltIn.NA;
|
|
6197
6197
|
if (e.hasError()) return e.firstError();
|
|
@@ -6200,37 +6200,37 @@ function Hu(e, n, r, i) {
|
|
|
6200
6200
|
for (let [[e, t]] of a.alignValues([o])) typeof e == "number" && typeof t == "number" && (c += t, e >= r && e <= s && (l += t));
|
|
6201
6201
|
return Math.round(1e10 * c) === 1e10 ? l : t.BuiltIn.Num;
|
|
6202
6202
|
}
|
|
6203
|
-
function Uu(t, n) {
|
|
6204
|
-
return Gu(t = e.flattenAreas(t), n);
|
|
6205
|
-
}
|
|
6206
6203
|
function Wu(t, n) {
|
|
6204
|
+
return Ku(t = e.flattenAreas(t), n);
|
|
6205
|
+
}
|
|
6206
|
+
function Gu(t, n) {
|
|
6207
6207
|
if ((t = e.flattenAreas(t)).hasError()) throw t.firstError();
|
|
6208
6208
|
if ((n = Math.trunc(n)) < 1 || n > 3) return NaN;
|
|
6209
6209
|
let r = n / 4, i = t.getStats().getSortedNumbers().getPercentile(r, !0);
|
|
6210
6210
|
return i === null ? NaN : i;
|
|
6211
6211
|
}
|
|
6212
|
-
function
|
|
6212
|
+
function Ku(t, n) {
|
|
6213
6213
|
if ((t = e.flattenAreas(t)).hasError()) throw t.firstError();
|
|
6214
6214
|
if ((n = Math.trunc(n)) < 0 || n > 4) return NaN;
|
|
6215
6215
|
let r = n / 4, i = t.getStats().getSortedNumbers().getPercentile(r, !1);
|
|
6216
6216
|
return i === null ? NaN : i;
|
|
6217
6217
|
}
|
|
6218
|
-
function
|
|
6219
|
-
return
|
|
6218
|
+
function qu(e, t, n = !1) {
|
|
6219
|
+
return Yu(e, t, n);
|
|
6220
6220
|
}
|
|
6221
|
-
function
|
|
6221
|
+
function Ju(n, r, i = !1) {
|
|
6222
6222
|
let a = e.flattenAreas(r);
|
|
6223
6223
|
if (a.hasError()) return a.firstError();
|
|
6224
6224
|
let o = a.getStats().getSortedNumbers().getRankOf(n, !i, !0);
|
|
6225
6225
|
return o === null ? t.BuiltIn.NA : o;
|
|
6226
6226
|
}
|
|
6227
|
-
function
|
|
6227
|
+
function Yu(n, r, i = !1) {
|
|
6228
6228
|
let a = e.flattenAreas(r);
|
|
6229
6229
|
if (a.hasError()) return a.firstError();
|
|
6230
6230
|
let o = a.getStats().getSortedNumbers().getRankOf(n, !i, !1);
|
|
6231
6231
|
return o === null ? t.BuiltIn.NA : o;
|
|
6232
6232
|
}
|
|
6233
|
-
function
|
|
6233
|
+
function Xu(e, n) {
|
|
6234
6234
|
let r = Z(e, n);
|
|
6235
6235
|
if (t.isError(r)) return r;
|
|
6236
6236
|
if (r === null) return t.BuiltIn.NA;
|
|
@@ -6239,7 +6239,7 @@ function Yu(e, n) {
|
|
|
6239
6239
|
let i = r.ssXY / Math.sqrt(r.ssX * r.ssY);
|
|
6240
6240
|
return i * i;
|
|
6241
6241
|
}
|
|
6242
|
-
function
|
|
6242
|
+
function Zu(e) {
|
|
6243
6243
|
let n = 0, r = 0;
|
|
6244
6244
|
for (let t of e) {
|
|
6245
6245
|
if (t.hasError()) return t.firstError();
|
|
@@ -6260,7 +6260,7 @@ function Xu(e) {
|
|
|
6260
6260
|
});
|
|
6261
6261
|
return n / ((n - 1) * (n - 2)) * s;
|
|
6262
6262
|
}
|
|
6263
|
-
function
|
|
6263
|
+
function Qu(e) {
|
|
6264
6264
|
let n = 0, r = 0;
|
|
6265
6265
|
for (let t of e) {
|
|
6266
6266
|
if (t.hasError()) return t.firstError();
|
|
@@ -6281,7 +6281,7 @@ function Zu(e) {
|
|
|
6281
6281
|
});
|
|
6282
6282
|
return s / n;
|
|
6283
6283
|
}
|
|
6284
|
-
function
|
|
6284
|
+
function $u(e, n) {
|
|
6285
6285
|
let r = Z(e, n);
|
|
6286
6286
|
if (t.isError(r)) return r;
|
|
6287
6287
|
if (r === null) return t.BuiltIn.NA;
|
|
@@ -6290,67 +6290,67 @@ function Qu(e, n) {
|
|
|
6290
6290
|
let i = r.ssXY / r.ssX;
|
|
6291
6291
|
return Number.isFinite(i) ? i : t.BuiltIn.Num;
|
|
6292
6292
|
}
|
|
6293
|
-
function
|
|
6293
|
+
function ed(e, t, n) {
|
|
6294
6294
|
return n <= 0 ? NaN : (e - t) / n;
|
|
6295
6295
|
}
|
|
6296
|
-
function ed(e) {
|
|
6297
|
-
let t = vd(e);
|
|
6298
|
-
return Math.sqrt(t);
|
|
6299
|
-
}
|
|
6300
6296
|
function td(e) {
|
|
6301
|
-
|
|
6297
|
+
let t = yd(e);
|
|
6298
|
+
return Math.sqrt(t);
|
|
6302
6299
|
}
|
|
6303
6300
|
function nd(e) {
|
|
6304
|
-
|
|
6305
|
-
return Math.sqrt(t);
|
|
6301
|
+
return td(e);
|
|
6306
6302
|
}
|
|
6307
6303
|
function rd(e) {
|
|
6308
|
-
|
|
6304
|
+
let t = _d(e);
|
|
6305
|
+
return Math.sqrt(t);
|
|
6309
6306
|
}
|
|
6310
6307
|
function id(e) {
|
|
6311
|
-
|
|
6312
|
-
return Math.sqrt(t);
|
|
6308
|
+
return rd(e);
|
|
6313
6309
|
}
|
|
6314
6310
|
function ad(e) {
|
|
6315
6311
|
let t = Sd(e);
|
|
6316
6312
|
return Math.sqrt(t);
|
|
6317
6313
|
}
|
|
6318
|
-
function od(e
|
|
6314
|
+
function od(e) {
|
|
6315
|
+
let t = Cd(e);
|
|
6316
|
+
return Math.sqrt(t);
|
|
6317
|
+
}
|
|
6318
|
+
function sd(e, n) {
|
|
6319
6319
|
let r = Z(e, n);
|
|
6320
6320
|
return t.isError(r) ? r : r === null ? t.BuiltIn.NA : r.n < 3 || r.ssX === 0 ? t.BuiltIn.Div0 : Number.isFinite(r.ssX) && Number.isFinite(r.ssY) ? Math.sqrt((r.ssY - r.ssXY * r.ssXY / r.ssX) / (r.n - 2)) : t.BuiltIn.Num;
|
|
6321
6321
|
}
|
|
6322
|
-
function
|
|
6322
|
+
function cd(e, t, n) {
|
|
6323
6323
|
return (t = Math.trunc(t)) < 1 || t > X ? NaN : n ? e === 0 ? .5 : function(e, t) {
|
|
6324
6324
|
if (!Number.isFinite(e * e)) return NaN;
|
|
6325
|
-
let n = .5 *
|
|
6325
|
+
let n = .5 * Qc(e, t);
|
|
6326
6326
|
return e > 0 ? 1 - n : n;
|
|
6327
6327
|
}(e, t) : function(e, t) {
|
|
6328
6328
|
return t = t > 1e100 ? 1e100 : t, 1 / (Math.sqrt(t) * Qt(.5, t / 2)) * (1 + e * e / t) ** (-(t + 1) / 2);
|
|
6329
6329
|
}(e, t);
|
|
6330
6330
|
}
|
|
6331
|
-
function
|
|
6332
|
-
return e < 0 || (n = Math.floor(n +
|
|
6333
|
-
}
|
|
6334
|
-
function ld(e, t) {
|
|
6335
|
-
return (t = Math.trunc(t)) < 1 || e < 0 || t > X ? NaN : 2 * Xc(e, t);
|
|
6331
|
+
function ld(e, t, n) {
|
|
6332
|
+
return e < 0 || (n = Math.floor(n + dl)) !== 1 && n !== 2 ? NaN : n === 1 ? dd(e, t) : ud(e, t);
|
|
6336
6333
|
}
|
|
6337
6334
|
function ud(e, t) {
|
|
6338
|
-
return (t = Math.trunc(t)) < 1 || t > X ? NaN :
|
|
6335
|
+
return (t = Math.trunc(t)) < 1 || e < 0 || t > X ? NaN : 2 * Zc(e, t);
|
|
6339
6336
|
}
|
|
6340
6337
|
function dd(e, t) {
|
|
6341
|
-
return
|
|
6338
|
+
return (t = Math.trunc(t)) < 1 || t > X ? NaN : e === 0 ? .5 : Zc(e, t);
|
|
6342
6339
|
}
|
|
6343
6340
|
function fd(e, t) {
|
|
6344
|
-
return
|
|
6341
|
+
return e <= 0 || e >= 1 || t < 1 || (t = Math.trunc(t)) > X ? NaN : t === 1 ? Math.tan(Math.PI * (e - .5)) : $c(e, t);
|
|
6345
6342
|
}
|
|
6346
6343
|
function pd(e, t) {
|
|
6347
|
-
return
|
|
6344
|
+
return md(e, t);
|
|
6345
|
+
}
|
|
6346
|
+
function md(e, t) {
|
|
6347
|
+
return e <= 0 || t < 1 || (t = Math.trunc(t)) > X ? NaN : t === 1 ? Math.tan(Math.PI * (.5 - e / 2)) : -$c(e / 2, t);
|
|
6348
6348
|
}
|
|
6349
|
-
function
|
|
6349
|
+
function hd(t, n) {
|
|
6350
6350
|
if ((t = e.flattenAreas(t)).hasError()) return t.firstError();
|
|
6351
6351
|
if (n < 0 || n >= 1) return NaN;
|
|
6352
6352
|
let r = [];
|
|
6353
|
-
for (let { value: e } of t.entries(
|
|
6353
|
+
for (let { value: e } of t.entries(gd)) typeof e == "number" && r.push(e);
|
|
6354
6354
|
let i = r.length, a = Math.floor(i * n / 2), o = 0, s = 0;
|
|
6355
6355
|
if (a === 0) {
|
|
6356
6356
|
for (let e = 0; e < i; e++) o += r[e];
|
|
@@ -6365,18 +6365,18 @@ function md(t, n) {
|
|
|
6365
6365
|
}
|
|
6366
6366
|
return s === 0 ? NaN : o / s;
|
|
6367
6367
|
}
|
|
6368
|
-
var
|
|
6369
|
-
function
|
|
6370
|
-
let t = 0, n = 0, r =
|
|
6368
|
+
var gd = { axis: n.Axis.Row };
|
|
6369
|
+
function _d(e) {
|
|
6370
|
+
let t = 0, n = 0, r = hc(e);
|
|
6371
6371
|
for (let i of e) for (let e of i.values()) t += (e - r) ** 2, n++;
|
|
6372
6372
|
let i = t / n;
|
|
6373
6373
|
return isNaN(i) ? NaN : i;
|
|
6374
6374
|
}
|
|
6375
|
-
function _d(e) {
|
|
6376
|
-
return gd(e);
|
|
6377
|
-
}
|
|
6378
6375
|
function vd(e) {
|
|
6379
|
-
|
|
6376
|
+
return _d(e);
|
|
6377
|
+
}
|
|
6378
|
+
function yd(e) {
|
|
6379
|
+
let n = 0, r = 0, a = hc(e);
|
|
6380
6380
|
for (let t of e) for (let e of t.values({
|
|
6381
6381
|
type: i.Number,
|
|
6382
6382
|
onError: "value"
|
|
@@ -6384,15 +6384,15 @@ function vd(e) {
|
|
|
6384
6384
|
if (r < 2) throw t.BuiltIn.Div0;
|
|
6385
6385
|
return n / (r - 1);
|
|
6386
6386
|
}
|
|
6387
|
-
function
|
|
6388
|
-
return
|
|
6387
|
+
function bd(e) {
|
|
6388
|
+
return yd(e);
|
|
6389
6389
|
}
|
|
6390
|
-
var
|
|
6390
|
+
var xd = (e) => {
|
|
6391
6391
|
let t = [], n = 0;
|
|
6392
6392
|
for (let r of e) {
|
|
6393
|
-
let e =
|
|
6393
|
+
let e = cc(r);
|
|
6394
6394
|
for (let i of r.values({ type: null })) {
|
|
6395
|
-
let r =
|
|
6395
|
+
let r = fc(i, e);
|
|
6396
6396
|
r !== null && (t.push(r), n += r);
|
|
6397
6397
|
}
|
|
6398
6398
|
}
|
|
@@ -6403,17 +6403,17 @@ var bd = (e) => {
|
|
|
6403
6403
|
count: r
|
|
6404
6404
|
};
|
|
6405
6405
|
};
|
|
6406
|
-
function
|
|
6407
|
-
let { sigma: n, count: r } =
|
|
6406
|
+
function Sd(e) {
|
|
6407
|
+
let { sigma: n, count: r } = xd(e);
|
|
6408
6408
|
if (r < 2) throw t.BuiltIn.Div0;
|
|
6409
6409
|
return n / (r - 1);
|
|
6410
6410
|
}
|
|
6411
|
-
function
|
|
6412
|
-
let { sigma: n, count: r } =
|
|
6411
|
+
function Cd(e) {
|
|
6412
|
+
let { sigma: n, count: r } = xd(e);
|
|
6413
6413
|
if (r === 0) throw t.BuiltIn.Div0;
|
|
6414
6414
|
return n / r;
|
|
6415
6415
|
}
|
|
6416
|
-
function
|
|
6416
|
+
function wd(e, n, r, i) {
|
|
6417
6417
|
if (e < 0 || n <= 0 || r <= 0) return NaN;
|
|
6418
6418
|
if (!i && e === 0) return 0;
|
|
6419
6419
|
let a = (e / r) ** +n;
|
|
@@ -6424,10 +6424,10 @@ function Cd(e, n, r, i) {
|
|
|
6424
6424
|
if (s === 0) throw t.BuiltIn.Div0;
|
|
6425
6425
|
return o / s * Math.exp(-a);
|
|
6426
6426
|
}
|
|
6427
|
-
function
|
|
6428
|
-
return
|
|
6427
|
+
function Td(e, t, n, r) {
|
|
6428
|
+
return wd(e, t, n, r);
|
|
6429
6429
|
}
|
|
6430
|
-
function
|
|
6430
|
+
function Ed(n, r, i) {
|
|
6431
6431
|
let a = [];
|
|
6432
6432
|
if (n === void 0) a.push(0);
|
|
6433
6433
|
else {
|
|
@@ -6447,14 +6447,14 @@ function Td(n, r, i) {
|
|
|
6447
6447
|
if (e === 0) throw t.BuiltIn.Div0;
|
|
6448
6448
|
i = Math.sqrt(e / (o - 1));
|
|
6449
6449
|
} else if (!(i > 0)) throw t.BuiltIn.Num;
|
|
6450
|
-
return 1 -
|
|
6450
|
+
return 1 - ku((s - r) / (i / Math.sqrt(o)), !0);
|
|
6451
6451
|
}
|
|
6452
|
-
function
|
|
6453
|
-
return
|
|
6452
|
+
function Dd(e, t, n) {
|
|
6453
|
+
return Ed(e, t, n);
|
|
6454
6454
|
}
|
|
6455
|
-
var
|
|
6455
|
+
var Od = 2.5066282746310002, kd = (e) => e.size === 1 && cc(e) ? e.hasError() ? e.firstError() : e.entries({ includeEmpty: !1 }).next().done ? t.BuiltIn.Value : null : null;
|
|
6456
6456
|
function Z(e, n) {
|
|
6457
|
-
let r =
|
|
6457
|
+
let r = kd(e) ?? kd(n);
|
|
6458
6458
|
if (r) return r;
|
|
6459
6459
|
let i = e.getRowCount(), a = e.getColumnCount();
|
|
6460
6460
|
if (i * a !== n.getRowCount() * n.getColumnCount()) return null;
|
|
@@ -6482,11 +6482,11 @@ function Z(e, n) {
|
|
|
6482
6482
|
ssXY: h
|
|
6483
6483
|
};
|
|
6484
6484
|
}
|
|
6485
|
-
var
|
|
6486
|
-
DELAY: () =>
|
|
6487
|
-
WAIT: () =>
|
|
6485
|
+
var Ad = m({
|
|
6486
|
+
DELAY: () => jd,
|
|
6487
|
+
WAIT: () => Fd
|
|
6488
6488
|
});
|
|
6489
|
-
async function
|
|
6489
|
+
async function jd(e, t, n = "No label") {
|
|
6490
6490
|
return new Promise((n) => {
|
|
6491
6491
|
setTimeout(() => {
|
|
6492
6492
|
n(t);
|
|
@@ -6494,81 +6494,81 @@ async function Ad(e, t, n = "No label") {
|
|
|
6494
6494
|
});
|
|
6495
6495
|
}
|
|
6496
6496
|
globalThis.debugEventTarget ??= new EventTarget();
|
|
6497
|
-
var
|
|
6498
|
-
function
|
|
6497
|
+
var Md = globalThis.debugEventTarget, Nd = /* @__PURE__ */ new Map();
|
|
6498
|
+
function Pd(e) {
|
|
6499
6499
|
let { inbox: t, waiters: n } = function(e) {
|
|
6500
|
-
if (
|
|
6500
|
+
if (Nd.has(e)) return Nd.get(e);
|
|
6501
6501
|
let t = {
|
|
6502
6502
|
inbox: [],
|
|
6503
6503
|
waiters: []
|
|
6504
6504
|
};
|
|
6505
|
-
return
|
|
6505
|
+
return Md.addEventListener(e, (e) => {
|
|
6506
6506
|
t.waiters.length ? t.waiters.shift()(e.detail) : t.inbox.push(e.detail);
|
|
6507
|
-
}),
|
|
6507
|
+
}), Nd.set(e, t), t;
|
|
6508
6508
|
}(e);
|
|
6509
6509
|
return t.length ? Promise.resolve(t.shift()) : new Promise((e) => n.push(e));
|
|
6510
6510
|
}
|
|
6511
|
-
async function
|
|
6512
|
-
let n = await
|
|
6511
|
+
async function Fd(e, t) {
|
|
6512
|
+
let n = await Pd(e), r = t?.getValueAt(0, 0) ?? "", i = `event["${e}"`;
|
|
6513
6513
|
return n !== void 0 && (i += `, payload: ${n}`), r !== "" && (i += `, input: ${r}`), i += "]", console.log(i), "" + n + r;
|
|
6514
6514
|
}
|
|
6515
|
-
var
|
|
6516
|
-
ARRAYTOTEXT: () =>
|
|
6517
|
-
ASC: () =>
|
|
6518
|
-
CHAR: () =>
|
|
6519
|
-
CLEAN: () =>
|
|
6520
|
-
CODE: () =>
|
|
6521
|
-
CONCAT: () =>
|
|
6522
|
-
CONCATENATE: () =>
|
|
6523
|
-
DBCS: () =>
|
|
6524
|
-
DETECTLANGUAGE: () =>
|
|
6525
|
-
DOLLAR: () =>
|
|
6526
|
-
EXACT: () =>
|
|
6527
|
-
FIND: () =>
|
|
6528
|
-
FINDB: () =>
|
|
6529
|
-
FIXED: () =>
|
|
6530
|
-
JOIN: () =>
|
|
6531
|
-
LEFT: () =>
|
|
6532
|
-
LEFTB: () =>
|
|
6533
|
-
LEN: () =>
|
|
6534
|
-
LENB: () =>
|
|
6535
|
-
LOWER: () =>
|
|
6536
|
-
MID: () =>
|
|
6537
|
-
MIDB: () =>
|
|
6538
|
-
NUMBERVALUE: () =>
|
|
6539
|
-
PROPER: () =>
|
|
6540
|
-
REPLACE: () =>
|
|
6541
|
-
REPLACEB: () =>
|
|
6542
|
-
REPT: () =>
|
|
6543
|
-
RIGHT: () =>
|
|
6544
|
-
RIGHTB: () =>
|
|
6545
|
-
SEARCH: () =>
|
|
6546
|
-
SEARCHB: () =>
|
|
6547
|
-
SPLIT: () =>
|
|
6548
|
-
SUBSTITUTE: () =>
|
|
6549
|
-
T: () =>
|
|
6550
|
-
TEXT: () =>
|
|
6551
|
-
TEXTAFTER: () =>
|
|
6552
|
-
TEXTBEFORE: () =>
|
|
6553
|
-
TEXTJOIN: () =>
|
|
6554
|
-
TEXTSPLIT: () =>
|
|
6555
|
-
TRANSLATE: () =>
|
|
6556
|
-
TRIM: () =>
|
|
6557
|
-
UNICHAR: () =>
|
|
6558
|
-
UNICODE: () =>
|
|
6559
|
-
UPPER: () =>
|
|
6560
|
-
VALUE: () =>
|
|
6561
|
-
VALUETOTEXT: () =>
|
|
6562
|
-
}),
|
|
6515
|
+
var Id = m({
|
|
6516
|
+
ARRAYTOTEXT: () => Bd,
|
|
6517
|
+
ASC: () => zd,
|
|
6518
|
+
CHAR: () => Vd,
|
|
6519
|
+
CLEAN: () => Hd,
|
|
6520
|
+
CODE: () => Ud,
|
|
6521
|
+
CONCAT: () => Wd,
|
|
6522
|
+
CONCATENATE: () => Kd,
|
|
6523
|
+
DBCS: () => Jd,
|
|
6524
|
+
DETECTLANGUAGE: () => qd,
|
|
6525
|
+
DOLLAR: () => Yd,
|
|
6526
|
+
EXACT: () => Xd,
|
|
6527
|
+
FIND: () => Zd,
|
|
6528
|
+
FINDB: () => Qd,
|
|
6529
|
+
FIXED: () => $d,
|
|
6530
|
+
JOIN: () => ef,
|
|
6531
|
+
LEFT: () => tf,
|
|
6532
|
+
LEFTB: () => nf,
|
|
6533
|
+
LEN: () => rf,
|
|
6534
|
+
LENB: () => af,
|
|
6535
|
+
LOWER: () => of,
|
|
6536
|
+
MID: () => sf,
|
|
6537
|
+
MIDB: () => cf,
|
|
6538
|
+
NUMBERVALUE: () => lf,
|
|
6539
|
+
PROPER: () => uf,
|
|
6540
|
+
REPLACE: () => df,
|
|
6541
|
+
REPLACEB: () => ff,
|
|
6542
|
+
REPT: () => pf,
|
|
6543
|
+
RIGHT: () => mf,
|
|
6544
|
+
RIGHTB: () => hf,
|
|
6545
|
+
SEARCH: () => gf,
|
|
6546
|
+
SEARCHB: () => _f,
|
|
6547
|
+
SPLIT: () => vf,
|
|
6548
|
+
SUBSTITUTE: () => yf,
|
|
6549
|
+
T: () => bf,
|
|
6550
|
+
TEXT: () => Sf,
|
|
6551
|
+
TEXTAFTER: () => Cf,
|
|
6552
|
+
TEXTBEFORE: () => wf,
|
|
6553
|
+
TEXTJOIN: () => Tf,
|
|
6554
|
+
TEXTSPLIT: () => Ef,
|
|
6555
|
+
TRANSLATE: () => Df,
|
|
6556
|
+
TRIM: () => Of,
|
|
6557
|
+
UNICHAR: () => kf,
|
|
6558
|
+
UNICODE: () => Af,
|
|
6559
|
+
UPPER: () => jf,
|
|
6560
|
+
VALUE: () => Mf,
|
|
6561
|
+
VALUETOTEXT: () => Nf
|
|
6562
|
+
}), Ld = /* @__PURE__ */ new Set([
|
|
6563
6563
|
32,
|
|
6564
6564
|
9,
|
|
6565
6565
|
13,
|
|
6566
6566
|
10
|
|
6567
|
-
]),
|
|
6568
|
-
function
|
|
6569
|
-
return
|
|
6567
|
+
]), Rd = 255;
|
|
6568
|
+
function zd(e) {
|
|
6569
|
+
return Pf() ? zf(e) : e;
|
|
6570
6570
|
}
|
|
6571
|
-
function
|
|
6571
|
+
function Bd(e, n = 0) {
|
|
6572
6572
|
if ((n = Math.floor(n)) !== 0 && n !== 1) throw t.BuiltIn.Value;
|
|
6573
6573
|
let r = n === 1;
|
|
6574
6574
|
if (e.size === 1) {
|
|
@@ -6580,10 +6580,10 @@ function zd(e, n = 0) {
|
|
|
6580
6580
|
if (!r) {
|
|
6581
6581
|
if (e.size === 1) {
|
|
6582
6582
|
let t = e.getValueAt(0, 0);
|
|
6583
|
-
return t === null ? null :
|
|
6583
|
+
return t === null ? null : Nf(t, n);
|
|
6584
6584
|
}
|
|
6585
6585
|
let { rows: t, columns: r } = e.getShape(), i = [];
|
|
6586
|
-
for (let a = 0; a < t; a++) for (let t = 0; t < r; t++) i.push(
|
|
6586
|
+
for (let a = 0; a < t; a++) for (let t = 0; t < r; t++) i.push(Nf(e.getValueAt(a, t), n));
|
|
6587
6587
|
return i.join(", ");
|
|
6588
6588
|
}
|
|
6589
6589
|
let a = e.getValues();
|
|
@@ -6591,35 +6591,35 @@ function zd(e, n = 0) {
|
|
|
6591
6591
|
let o = a.length;
|
|
6592
6592
|
for (let e = 0; e < o; e++) {
|
|
6593
6593
|
let t = a[e], r = t.length;
|
|
6594
|
-
for (let e = 0; e < r; e++) i +=
|
|
6594
|
+
for (let e = 0; e < r; e++) i += Nf(t[e], n), e < r - 1 && (i += ",");
|
|
6595
6595
|
e < o - 1 && (i += ";");
|
|
6596
6596
|
}
|
|
6597
6597
|
return r && (i += "}"), i;
|
|
6598
6598
|
}
|
|
6599
|
-
function
|
|
6599
|
+
function Vd(e) {
|
|
6600
6600
|
let n = Q(e);
|
|
6601
6601
|
if (!(n >= 1 && n <= 255)) throw t.BuiltIn.Value;
|
|
6602
6602
|
return String.fromCharCode(n);
|
|
6603
6603
|
}
|
|
6604
|
-
function
|
|
6604
|
+
function Hd(e) {
|
|
6605
6605
|
return e.replace(/[\x00-\x1F\x80-\x9F]/g, "");
|
|
6606
6606
|
}
|
|
6607
|
-
function
|
|
6607
|
+
function Ud(e) {
|
|
6608
6608
|
if (e.length === 0) throw t.BuiltIn.Value;
|
|
6609
6609
|
return e.charCodeAt(0);
|
|
6610
6610
|
}
|
|
6611
|
-
function
|
|
6611
|
+
function Wd(e) {
|
|
6612
6612
|
let n = "";
|
|
6613
6613
|
for (let i of e) for (let e of i.values()) if (n += e, n.length > r.MAX_TEXT_LENGTH) throw t.BuiltIn.Calc;
|
|
6614
6614
|
return n;
|
|
6615
6615
|
}
|
|
6616
|
-
var
|
|
6616
|
+
var Gd = {
|
|
6617
6617
|
type: i.String,
|
|
6618
6618
|
coerce: [i.Boolean, i.Number],
|
|
6619
6619
|
onError: "value",
|
|
6620
6620
|
misalignValue: t.BuiltIn.NA
|
|
6621
6621
|
};
|
|
6622
|
-
function
|
|
6622
|
+
function Kd(n) {
|
|
6623
6623
|
let i = e.createRange(1, 1, "");
|
|
6624
6624
|
for (let a of n) {
|
|
6625
6625
|
let n = t.isError(a) ? e.createRange(1, 1, a) : a;
|
|
@@ -6630,77 +6630,77 @@ function Gd(n) {
|
|
|
6630
6630
|
if (i.length <= r.MAX_TEXT_LENGTH) return i;
|
|
6631
6631
|
let a = r.MAX_TEXT_LENGTH, o = i.charCodeAt(a - 1), s = i.charCodeAt(a);
|
|
6632
6632
|
return o >= 55296 && o <= 56319 && s >= 56320 && s <= 57343 && a--, i.slice(0, a);
|
|
6633
|
-
},
|
|
6633
|
+
}, Gd);
|
|
6634
6634
|
}
|
|
6635
6635
|
return i.getRowCount() === 1 && i.getColumnCount() === 1 ? i.getValueAt(0, 0) ?? "" : i;
|
|
6636
6636
|
}
|
|
6637
|
-
function
|
|
6637
|
+
function qd(e) {
|
|
6638
6638
|
return t.BuiltIn.NA;
|
|
6639
6639
|
}
|
|
6640
|
-
function
|
|
6641
|
-
return
|
|
6640
|
+
function Jd(e) {
|
|
6641
|
+
return Pf() ? Rf(e) : e;
|
|
6642
6642
|
}
|
|
6643
|
-
function
|
|
6644
|
-
if ((r = Math.trunc(r)) >
|
|
6645
|
-
n =
|
|
6643
|
+
function Yd(n, r = 2) {
|
|
6644
|
+
if ((r = Math.trunc(r)) > Kf) throw t.BuiltIn.Value;
|
|
6645
|
+
n = Gf(n, r < 0 ? r : Math.min(r, 15)), r < 0 && (r = 0, n ||= 0);
|
|
6646
6646
|
let i = e.getRuntime().getLocaleProfile().currencySymbol, a = r > 0 ? `.${"0".repeat(r)}` : "", o = `(${i}#,##0${a})`, s = Object.is(n, -0) ? o : `${i}#,##0${a}_);${o}`;
|
|
6647
|
-
if (
|
|
6647
|
+
if (Jf(n, r, !0, i.length) > qf) throw t.BuiltIn.Value;
|
|
6648
6648
|
return e.getNumberFormat(s, n).trim();
|
|
6649
6649
|
}
|
|
6650
|
-
function
|
|
6650
|
+
function Xd(e, t) {
|
|
6651
6651
|
return e === t;
|
|
6652
6652
|
}
|
|
6653
|
-
function
|
|
6653
|
+
function Zd(e, n, r = 1) {
|
|
6654
6654
|
r = Q(r);
|
|
6655
|
-
let i =
|
|
6655
|
+
let i = Hf(n), a = i ? ip(n) : n.length;
|
|
6656
6656
|
if (r < 1 || r > a + 1) throw t.BuiltIn.Value;
|
|
6657
6657
|
let o = i ? $(n, r - 1) : r - 1, s = n.indexOf(e, o);
|
|
6658
6658
|
if (s === -1) throw t.BuiltIn.Value;
|
|
6659
|
-
return i ?
|
|
6659
|
+
return i ? ap(n, s) + 1 : s + 1;
|
|
6660
6660
|
}
|
|
6661
|
-
function
|
|
6661
|
+
function Qd(e, n, r = 1) {
|
|
6662
6662
|
if ((r = Q(r)) < 1 || r > n.length + 1) throw t.BuiltIn.Value;
|
|
6663
6663
|
let i = n.indexOf(e, r - 1);
|
|
6664
6664
|
if (i === -1) throw t.BuiltIn.Value;
|
|
6665
6665
|
return i + 1;
|
|
6666
6666
|
}
|
|
6667
|
-
function
|
|
6668
|
-
if ((r = Math.trunc(r)) >
|
|
6669
|
-
n =
|
|
6667
|
+
function $d(n, r = 2, i = !1) {
|
|
6668
|
+
if ((r = Math.trunc(r)) > Kf) throw t.BuiltIn.Value;
|
|
6669
|
+
n = Gf(n, r < 0 ? r : Math.min(r, 15)), r < 0 && (r = 0);
|
|
6670
6670
|
let a = `${i ? "" : "#,"}##0${r > 0 ? `.${"0".repeat(r)}` : ""}`;
|
|
6671
|
-
if (
|
|
6671
|
+
if (Jf(n, r, !i, 0) > qf) throw t.BuiltIn.Value;
|
|
6672
6672
|
return e.getNumberFormat(a, n).trim();
|
|
6673
6673
|
}
|
|
6674
|
-
function
|
|
6675
|
-
return
|
|
6674
|
+
function ef(e, t) {
|
|
6675
|
+
return Tf([e], !0, [t]);
|
|
6676
6676
|
}
|
|
6677
|
-
function
|
|
6677
|
+
function tf(e, n = 1) {
|
|
6678
6678
|
if (n < 0) throw t.BuiltIn.Value;
|
|
6679
|
-
return n = Q(n),
|
|
6679
|
+
return n = Q(n), Hf(e) ? e.slice(0, $(e, n)) : n > e.length ? e : e.slice(0, n);
|
|
6680
6680
|
}
|
|
6681
|
-
function
|
|
6682
|
-
return
|
|
6683
|
-
}
|
|
6684
|
-
function nf(e) {
|
|
6685
|
-
return Hf.test(e) ? rp(e) : e.length;
|
|
6681
|
+
function nf(e, t = 1) {
|
|
6682
|
+
return tf(e, t);
|
|
6686
6683
|
}
|
|
6687
6684
|
function rf(e) {
|
|
6688
|
-
return e.length;
|
|
6685
|
+
return Uf.test(e) ? ip(e) : e.length;
|
|
6689
6686
|
}
|
|
6690
6687
|
function af(e) {
|
|
6691
|
-
return
|
|
6688
|
+
return e.length;
|
|
6692
6689
|
}
|
|
6693
|
-
function of(e
|
|
6690
|
+
function of(e) {
|
|
6691
|
+
return rp(e, !1);
|
|
6692
|
+
}
|
|
6693
|
+
function sf(e, n, r) {
|
|
6694
6694
|
if (n < 1 || r < 0) return t.BuiltIn.Value;
|
|
6695
|
-
if (n = Math.trunc(n), r = Math.trunc(r), !
|
|
6695
|
+
if (n = Math.trunc(n), r = Math.trunc(r), !Hf(e)) return n > e.length ? "" : e.slice(n - 1, n + r - 1);
|
|
6696
6696
|
let i = $(e, n - 1);
|
|
6697
6697
|
return i >= e.length ? "" : e.slice(i, $(e, n - 1 + r));
|
|
6698
6698
|
}
|
|
6699
|
-
function
|
|
6699
|
+
function cf(e, n, r) {
|
|
6700
6700
|
return n < 1 || r < 0 ? t.BuiltIn.Value : (n = Math.trunc(n), r = Math.trunc(r), n > e.length ? "" : e.slice(n - 1, n - 1 + r));
|
|
6701
6701
|
}
|
|
6702
|
-
function
|
|
6703
|
-
if (r?.length === 0 || i?.length === 0 || n.length >
|
|
6702
|
+
function lf(n, r, i) {
|
|
6703
|
+
if (r?.length === 0 || i?.length === 0 || n.length > Rd) throw t.BuiltIn.Value;
|
|
6704
6704
|
if (n.length === 0) return 0;
|
|
6705
6705
|
let a = e.getRuntime().getLocaleProfile(), o = r === void 0 ? a.decimal : r[0], s = i === void 0 ? a.group : i[0];
|
|
6706
6706
|
if (o === s) {
|
|
@@ -6708,7 +6708,7 @@ function cf(n, r, i) {
|
|
|
6708
6708
|
s = a.decimal;
|
|
6709
6709
|
}
|
|
6710
6710
|
let c = [], l = !1, u = 0;
|
|
6711
|
-
for (; u < n.length;) if (
|
|
6711
|
+
for (; u < n.length;) if (Ld.has(n.charCodeAt(u))) u += 1;
|
|
6712
6712
|
else if (!l && n.startsWith(s, u)) u += s.length;
|
|
6713
6713
|
else if (n.startsWith(o, u)) l = !0, c.push(a.decimal), u += o.length;
|
|
6714
6714
|
else {
|
|
@@ -6722,48 +6722,48 @@ function cf(n, r, i) {
|
|
|
6722
6722
|
for (let e = 0; e < d; e++) f /= 100;
|
|
6723
6723
|
return f;
|
|
6724
6724
|
}
|
|
6725
|
-
function
|
|
6726
|
-
return (e =
|
|
6727
|
-
}
|
|
6728
|
-
function uf(e, n, r, i) {
|
|
6729
|
-
return r + Uf < 0 ? t.BuiltIn.Value : (n = Q(n), r = Q(r), n < 1 ? t.BuiltIn.Value : Vf(e) ? e.slice(0, $(e, n - 1)) + i + e.slice($(e, n - 1 + r)) : e.slice(0, n - 1) + i + e.slice(n - 1 + r));
|
|
6725
|
+
function uf(e) {
|
|
6726
|
+
return (e = rp(e, !1)).replace(/(^|\P{L})(\p{L})/gu, (e, t, n) => t + rp(n, !0));
|
|
6730
6727
|
}
|
|
6731
6728
|
function df(e, n, r, i) {
|
|
6732
|
-
return r +
|
|
6729
|
+
return r + Wf < 0 ? t.BuiltIn.Value : (n = Q(n), r = Q(r), n < 1 ? t.BuiltIn.Value : Hf(e) ? e.slice(0, $(e, n - 1)) + i + e.slice($(e, n - 1 + r)) : e.slice(0, n - 1) + i + e.slice(n - 1 + r));
|
|
6730
|
+
}
|
|
6731
|
+
function ff(e, n, r, i) {
|
|
6732
|
+
return r + Wf < 0 ? t.BuiltIn.Value : (n = Q(n), r = Q(r), n < 1 ? t.BuiltIn.Value : e.slice(0, n - 1) + i + e.slice(n - 1 + r));
|
|
6733
6733
|
}
|
|
6734
|
-
function
|
|
6734
|
+
function pf(e, n) {
|
|
6735
6735
|
return (n = Math.floor(n)) < 0 || e.length * n > r.MAX_TEXT_LENGTH ? t.BuiltIn.Value : e.repeat(n);
|
|
6736
6736
|
}
|
|
6737
|
-
function
|
|
6737
|
+
function mf(e, n = 1) {
|
|
6738
6738
|
if (n < 0) throw t.BuiltIn.Value;
|
|
6739
|
-
if (n = Q(n), !
|
|
6739
|
+
if (n = Q(n), !Hf(e)) {
|
|
6740
6740
|
let t = e.length;
|
|
6741
6741
|
return n > t ? e : e.slice(t - n);
|
|
6742
6742
|
}
|
|
6743
|
-
let r =
|
|
6743
|
+
let r = ip(e);
|
|
6744
6744
|
return n >= r ? e : e.slice($(e, r - n));
|
|
6745
6745
|
}
|
|
6746
|
-
function
|
|
6747
|
-
return
|
|
6746
|
+
function hf(e, t = 1) {
|
|
6747
|
+
return mf(e, t);
|
|
6748
6748
|
}
|
|
6749
|
-
function
|
|
6749
|
+
function gf(e, n, r = 1) {
|
|
6750
6750
|
r = Q(r);
|
|
6751
|
-
let i =
|
|
6751
|
+
let i = Hf(n), a = i ? ip(n) : n.length;
|
|
6752
6752
|
if (r < 1 || r > a) throw t.BuiltIn.Value;
|
|
6753
|
-
let s = o.toRegex(
|
|
6753
|
+
let s = o.toRegex(Qf(e), "i"), c = i ? $(n, r - 1) : r - 1, l = Qf(n).slice(c).search(s);
|
|
6754
6754
|
if (l === -1) throw t.BuiltIn.Value;
|
|
6755
|
-
return i ?
|
|
6755
|
+
return i ? ap(n, c + l) + 1 : l + r;
|
|
6756
6756
|
}
|
|
6757
|
-
function
|
|
6757
|
+
function _f(e, n, r = 1) {
|
|
6758
6758
|
if ((r = Q(r)) < 1 || r > n.length) throw t.BuiltIn.Value;
|
|
6759
|
-
let i = o.toRegex(
|
|
6759
|
+
let i = o.toRegex(Qf(e), "i"), a = Qf(n).slice(r - 1).search(i);
|
|
6760
6760
|
if (a === -1) throw t.BuiltIn.Value;
|
|
6761
6761
|
return a + r;
|
|
6762
6762
|
}
|
|
6763
|
-
function
|
|
6764
|
-
return
|
|
6763
|
+
function vf(e, t, n = !0, r = !0) {
|
|
6764
|
+
return Ef(e, n ? t.split("") : [t], void 0, r);
|
|
6765
6765
|
}
|
|
6766
|
-
function
|
|
6766
|
+
function yf(n, i, a, o) {
|
|
6767
6767
|
let s = -1;
|
|
6768
6768
|
if (o !== void 0 && (o === null || (s = Q(e.parseAsNumber(o)), s <= 0))) return t.BuiltIn.Value;
|
|
6769
6769
|
if (!n || !i) return n;
|
|
@@ -6775,12 +6775,12 @@ function vf(n, i, a, o) {
|
|
|
6775
6775
|
} else l += 1;
|
|
6776
6776
|
return c;
|
|
6777
6777
|
}
|
|
6778
|
-
function
|
|
6778
|
+
function bf(e) {
|
|
6779
6779
|
let t = !0 === e?.isIRange ? e : null;
|
|
6780
|
-
return t ? Sr(t,
|
|
6780
|
+
return t ? Sr(t, xf) : xf(e);
|
|
6781
6781
|
}
|
|
6782
|
-
var
|
|
6783
|
-
function
|
|
6782
|
+
var xf = (e) => typeof e == "string" ? e : "";
|
|
6783
|
+
function Sf(n, r) {
|
|
6784
6784
|
if (n === null && (n = 0), r === "") return "";
|
|
6785
6785
|
if (typeof n == "string" && n.trim() !== "") try {
|
|
6786
6786
|
n = e.parseAsNumber(n.trim());
|
|
@@ -6791,13 +6791,13 @@ function xf(n, r) {
|
|
|
6791
6791
|
return t.BuiltIn.Value;
|
|
6792
6792
|
}
|
|
6793
6793
|
}
|
|
6794
|
-
function Sf(e, t, n, r = 0, i = 0, a) {
|
|
6795
|
-
return ap(e, t, n ?? 1, n !== void 0, r, i, a, !0);
|
|
6796
|
-
}
|
|
6797
6794
|
function Cf(e, t, n, r = 0, i = 0, a) {
|
|
6798
|
-
return
|
|
6795
|
+
return op(e, t, n ?? 1, n !== void 0, r, i, a, !0);
|
|
6799
6796
|
}
|
|
6800
|
-
function wf(e, n, i) {
|
|
6797
|
+
function wf(e, t, n, r = 0, i = 0, a) {
|
|
6798
|
+
return op(e, t, n ?? 1, n !== void 0, r, i, a, !1);
|
|
6799
|
+
}
|
|
6800
|
+
function Tf(e, n, i) {
|
|
6801
6801
|
let a = "", o = 0;
|
|
6802
6802
|
for (let s of i) for (let i of s.values({ includeEmpty: !n })) if (i.length !== 0 || !n) {
|
|
6803
6803
|
if (o > 0 && e.length > 0 && (a += e[(o - 1) % e.length]), a += i, a.length > r.MAX_TEXT_LENGTH) return t.BuiltIn.Calc;
|
|
@@ -6805,13 +6805,13 @@ function wf(e, n, i) {
|
|
|
6805
6805
|
}
|
|
6806
6806
|
return a;
|
|
6807
6807
|
}
|
|
6808
|
-
function
|
|
6808
|
+
function Ef(e, n, r, i = !1, a = 0, o = void 0) {
|
|
6809
6809
|
if (!e || (a = Math.trunc(a)) !== 0 && a !== 1 || n.length === 0 && (!r || r.length === 0)) throw t.BuiltIn.Value;
|
|
6810
6810
|
let s = (e) => {
|
|
6811
6811
|
if (e.length === 0) return null;
|
|
6812
6812
|
if (e.some((e) => e.length === 0)) throw t.BuiltIn.Value;
|
|
6813
6813
|
let n = [...e].sort((e, t) => t.length - e.length);
|
|
6814
|
-
return new RegExp(n.map((e) =>
|
|
6814
|
+
return new RegExp(n.map((e) => Bf(e)).join("|"), a === 1 ? "i" : "");
|
|
6815
6815
|
}, c = (e, t) => t ? e.split(t) : [e], l = s(n), u = [e];
|
|
6816
6816
|
if (r && (u = c(e, s(r))), i) {
|
|
6817
6817
|
let e = [];
|
|
@@ -6843,39 +6843,39 @@ function Tf(e, n, r, i = !1, a = 0, o = void 0) {
|
|
|
6843
6843
|
}
|
|
6844
6844
|
return d.length > 0 ? d : [[""]];
|
|
6845
6845
|
}
|
|
6846
|
-
function
|
|
6846
|
+
function Df(e, n, r) {
|
|
6847
6847
|
return t.BuiltIn.NA;
|
|
6848
6848
|
}
|
|
6849
|
-
function
|
|
6849
|
+
function Of(e) {
|
|
6850
6850
|
return e.replace(/ +/g, " ").replace(/^ +| +$/g, "");
|
|
6851
6851
|
}
|
|
6852
|
-
function
|
|
6852
|
+
function kf(e) {
|
|
6853
6853
|
if (!(e >= 1)) throw t.BuiltIn.Value;
|
|
6854
6854
|
let n = Math.trunc(e);
|
|
6855
6855
|
if (n > 1114111) throw t.BuiltIn.Value;
|
|
6856
6856
|
if (n >= 55296 && n <= 57343 || n >= 64976 && n <= 65007 || (65535 & n) >= 65534) throw t.BuiltIn.NA;
|
|
6857
6857
|
return String.fromCodePoint(n);
|
|
6858
6858
|
}
|
|
6859
|
-
function
|
|
6859
|
+
function Af(e) {
|
|
6860
6860
|
if (e.length === 0) throw t.BuiltIn.Value;
|
|
6861
6861
|
let n = e.codePointAt(0);
|
|
6862
6862
|
if (n >= 55296 && n <= 56319) throw t.BuiltIn.Value;
|
|
6863
6863
|
return n;
|
|
6864
6864
|
}
|
|
6865
|
-
function
|
|
6866
|
-
return
|
|
6865
|
+
function jf(e) {
|
|
6866
|
+
return rp(e, !0);
|
|
6867
6867
|
}
|
|
6868
|
-
function
|
|
6868
|
+
function Mf(t) {
|
|
6869
6869
|
return t === null ? 0 : e.parseAsNumber(t);
|
|
6870
6870
|
}
|
|
6871
|
-
function
|
|
6871
|
+
function Nf(n, r = 0) {
|
|
6872
6872
|
if ((r = Math.floor(r)) !== 0 && r !== 1) throw t.BuiltIn.Value;
|
|
6873
6873
|
return typeof n == "string" ? r === 1 ? "\"" + n.replace(/"/g, "\"\"") + "\"" : n : e.toText(n);
|
|
6874
6874
|
}
|
|
6875
|
-
var
|
|
6875
|
+
var Pf = () => {
|
|
6876
6876
|
let t = e.getRuntime().getLocale().toLowerCase().split(/[-_]/)[0];
|
|
6877
6877
|
return t === "ja" || t === "zh" || t === "ko";
|
|
6878
|
-
},
|
|
6878
|
+
}, Ff = {
|
|
6879
6879
|
latin: {
|
|
6880
6880
|
halfRE: /[!-~]/g,
|
|
6881
6881
|
fullRE: /[!-~]/g,
|
|
@@ -6901,45 +6901,45 @@ var Nf = () => {
|
|
|
6901
6901
|
half: "¢£¬¯¦¥₩ |←↑→↓■°",
|
|
6902
6902
|
full: "¢£¬ ̄¦¥₩ │←↑→↓■○"
|
|
6903
6903
|
}
|
|
6904
|
-
},
|
|
6905
|
-
function
|
|
6904
|
+
}, If = (e, t) => e[`${t}RE`] || RegExp("[" + e[t] + "]", "g"), Lf = Object.keys(Ff).map((e) => Ff[e]), Rf = (e) => Lf.reduce((e, t) => e.replace(If(t, "half"), ((e) => (t) => e.delta ? String.fromCharCode(t.charCodeAt(0) + e.delta) : [...e.full][[...e.half].indexOf(t)])(t)), e), zf = (e) => Lf.reduce((e, t) => e.replace(If(t, "full"), ((e) => (t) => e.delta ? String.fromCharCode(t.charCodeAt(0) - e.delta) : [...e.half][[...e.full].indexOf(t)])(t)), e);
|
|
6905
|
+
function Bf(e) {
|
|
6906
6906
|
return e.replace(/[.*+?^${}()|[\]\\]/g, "\\$&");
|
|
6907
6907
|
}
|
|
6908
|
-
var
|
|
6908
|
+
var Vf = /[\uD800-\uDBFF][\uDC00-\uDFFF]/, Hf = (e) => Vf.test(e), Uf = /[\uD800-\uDBFF][\uDC00-\uDFFF]|[\uD800-\uDBFF]$/, Wf = 2 ** -22, Gf = (e, t) => {
|
|
6909
6909
|
if (t < -308) return 0;
|
|
6910
6910
|
let n = 10 ** t, r = Number(Math.abs(e).toPrecision(15)), i = Number((r * n).toPrecision(15));
|
|
6911
6911
|
return Number.isFinite(i) ? Math.sign(e) * Math.round(i) / n : e;
|
|
6912
|
-
},
|
|
6912
|
+
}, Kf = 127, qf = 255, Jf = (e, t, n, r) => {
|
|
6913
6913
|
let i = Math.abs(e), a = i < 1 ? 1 : Math.floor(Math.log10(i)) + 1;
|
|
6914
6914
|
return a + (n ? Math.floor((a - 1) / 3) : 0) + (t > 0 ? t + 1 : 0) + +(e < 0) + r;
|
|
6915
|
-
}, Q = (e) => Math.trunc(e +
|
|
6915
|
+
}, Q = (e) => Math.trunc(e + Wf), Yf = new Map([
|
|
6916
6916
|
[8490, 75],
|
|
6917
6917
|
[8491, 197],
|
|
6918
6918
|
[8486, 937],
|
|
6919
6919
|
[7838, 223]
|
|
6920
|
-
].map(([e, t]) => [String.fromCharCode(e), String.fromCharCode(t)])),
|
|
6920
|
+
].map(([e, t]) => [String.fromCharCode(e), String.fromCharCode(t)])), Xf = RegExp(`[${[...Yf.keys()].join("")}]`), Zf = new RegExp(Xf.source, "g"), Qf = (e) => Xf.test(e) ? e.replace(Zf, (e) => Yf.get(e)) : e, $f = /* @__PURE__ */ new Set([
|
|
6921
6921
|
181,
|
|
6922
6922
|
7838,
|
|
6923
6923
|
8486,
|
|
6924
6924
|
8490,
|
|
6925
6925
|
8491
|
|
6926
|
-
]),
|
|
6927
|
-
if (
|
|
6926
|
+
]), ep = /* @__PURE__ */ new Map([[304, "i"]]), tp = "ς", np = /^[\x00-\x7F]*$/, rp = (e, t) => {
|
|
6927
|
+
if (np.test(e)) return t ? e.toUpperCase() : e.toLowerCase();
|
|
6928
6928
|
let n = "";
|
|
6929
6929
|
for (let r = 0; r < e.length; r++) {
|
|
6930
6930
|
let i = e[r], a = e.charCodeAt(r);
|
|
6931
|
-
if (a >= 55296 && a <= 57343 ||
|
|
6931
|
+
if (a >= 55296 && a <= 57343 || $f.has(a)) {
|
|
6932
6932
|
n += i;
|
|
6933
6933
|
continue;
|
|
6934
6934
|
}
|
|
6935
6935
|
if (!t) {
|
|
6936
|
-
let t =
|
|
6936
|
+
let t = ep.get(a);
|
|
6937
6937
|
if (t !== void 0) {
|
|
6938
6938
|
n += t;
|
|
6939
6939
|
continue;
|
|
6940
6940
|
}
|
|
6941
6941
|
if (a === 931 && r === e.length - 1) {
|
|
6942
|
-
n +=
|
|
6942
|
+
n += tp;
|
|
6943
6943
|
continue;
|
|
6944
6944
|
}
|
|
6945
6945
|
}
|
|
@@ -6947,7 +6947,7 @@ var Bf = /[\uD800-\uDBFF][\uDC00-\uDFFF]/, Vf = (e) => Bf.test(e), Hf = /[\uD800
|
|
|
6947
6947
|
n += o.length === 1 ? o : i;
|
|
6948
6948
|
}
|
|
6949
6949
|
return n;
|
|
6950
|
-
},
|
|
6950
|
+
}, ip = (e) => {
|
|
6951
6951
|
let t = e.length, n = 0;
|
|
6952
6952
|
for (let r = 0; r < t - 1; r++) {
|
|
6953
6953
|
let t = e.charCodeAt(r);
|
|
@@ -6964,12 +6964,12 @@ var Bf = /[\uD800-\uDBFF][\uDC00-\uDFFF]/, Vf = (e) => Bf.test(e), Hf = /[\uD800
|
|
|
6964
6964
|
i += t >= 55296 && t <= 56319 && n >= 56320 && n <= 57343 ? 2 : 1;
|
|
6965
6965
|
}
|
|
6966
6966
|
return Math.min(i, r);
|
|
6967
|
-
},
|
|
6967
|
+
}, ap = (e, t) => ip(e.slice(0, t)), op = (e, n, r, i, a, o, s, c) => {
|
|
6968
6968
|
let l = Math.trunc(a);
|
|
6969
6969
|
if (l !== 0 && l !== 1) return t.BuiltIn.Value;
|
|
6970
6970
|
let u = Math.trunc(o);
|
|
6971
6971
|
if (u !== 0 && u !== 1) return t.BuiltIn.Value;
|
|
6972
|
-
let d = Math.floor(r +
|
|
6972
|
+
let d = Math.floor(r + Wf);
|
|
6973
6973
|
if (d === 0) return t.BuiltIn.Value;
|
|
6974
6974
|
if (n.length === 0 || n.some((e) => e.length === 0)) return c === d > 0 ? e : "";
|
|
6975
6975
|
let f = Math.min(...n.map((e) => e.length));
|
|
@@ -6977,7 +6977,7 @@ var Bf = /[\uD800-\uDBFF][\uDC00-\uDFFF]/, Vf = (e) => Bf.test(e), Hf = /[\uD800
|
|
|
6977
6977
|
let p = ((e, t, n) => {
|
|
6978
6978
|
let r = [], i = t.filter((e) => e.length > 0);
|
|
6979
6979
|
if (i.length === 0) return r;
|
|
6980
|
-
let a = n === 1 ? i.map((e) => new RegExp(
|
|
6980
|
+
let a = n === 1 ? i.map((e) => new RegExp(Bf(e), "gi")) : null, o = 0;
|
|
6981
6981
|
for (; o <= e.length;) {
|
|
6982
6982
|
let t = null;
|
|
6983
6983
|
for (let n = 0; n < i.length; n++) {
|
|
@@ -6997,7 +6997,7 @@ var Bf = /[\uD800-\uDBFF][\uDC00-\uDFFF]/, Vf = (e) => Bf.test(e), Hf = /[\uD800
|
|
|
6997
6997
|
u === 1 && (d > 0 ? p.push([e.length, e.length]) : p.unshift([0, 0]));
|
|
6998
6998
|
let m = d > 0 ? d - 1 : p.length + d;
|
|
6999
6999
|
return m < 0 || m >= p.length ? s ?? t.BuiltIn.NA : c ? e.substring(p[m][1]) : e.substring(0, p[m][0]);
|
|
7000
|
-
},
|
|
7000
|
+
}, sp = p((e, t) => {
|
|
7001
7001
|
var n = "", r = "หนึ่ง", i = [
|
|
7002
7002
|
"สาม",
|
|
7003
7003
|
"สี่",
|
|
@@ -7111,31 +7111,31 @@ var Bf = /[\uD800-\uDBFF][\uDC00-\uDFFF]/, Vf = (e) => Bf.test(e), Hf = /[\uD800
|
|
|
7111
7111
|
handleStringInput: _,
|
|
7112
7112
|
formatSatang: v
|
|
7113
7113
|
}, e.default = { bahttext: h };
|
|
7114
|
-
}),
|
|
7115
|
-
function
|
|
7114
|
+
}), cp = m({ BAHTTEXT: () => up }), lp = sp();
|
|
7115
|
+
function up(e) {
|
|
7116
7116
|
try {
|
|
7117
|
-
return (0,
|
|
7117
|
+
return (0, lp.bahttext)(e);
|
|
7118
7118
|
} catch (e) {
|
|
7119
7119
|
throw Error(`Error in https://github.com/jojoee/bahttext \n${e.toString()}`);
|
|
7120
7120
|
}
|
|
7121
7121
|
}
|
|
7122
|
-
var
|
|
7123
|
-
async function
|
|
7124
|
-
if (
|
|
7125
|
-
if (!
|
|
7126
|
-
|
|
7122
|
+
var dp = m({ FILTERXML: () => fp });
|
|
7123
|
+
async function fp(e, n) {
|
|
7124
|
+
if (gp) throw t.BuiltIn.Blocked;
|
|
7125
|
+
if (!mp || !hp) try {
|
|
7126
|
+
_p ??= pp(), await _p;
|
|
7127
7127
|
} catch (e) {
|
|
7128
|
-
throw
|
|
7128
|
+
throw gp || (gp = !0, console.warn(`FILTERXML is unavailable: XML libraries could not be loaded (${e?.message ?? e}).`)), t.BuiltIn.Blocked;
|
|
7129
7129
|
}
|
|
7130
|
-
if (!
|
|
7130
|
+
if (!mp) throw gp = !0, console.warn("Unable to load XML libraries"), t.BuiltIn.Blocked;
|
|
7131
7131
|
try {
|
|
7132
|
-
let t =
|
|
7133
|
-
return [[
|
|
7132
|
+
let t = mp.parseFromString(e, "text/xml");
|
|
7133
|
+
return [[hp.evaluateXPathToString(n, t, null, {})]];
|
|
7134
7134
|
} catch {
|
|
7135
7135
|
throw t.BuiltIn.Value;
|
|
7136
7136
|
}
|
|
7137
7137
|
}
|
|
7138
|
-
var
|
|
7138
|
+
var pp = async () => {
|
|
7139
7139
|
let [e, t] = await Promise.all([import(
|
|
7140
7140
|
/* webpackIgnore: true */
|
|
7141
7141
|
/* @vite-ignore */
|
|
@@ -7145,17 +7145,17 @@ var fp = async () => {
|
|
|
7145
7145
|
/* @vite-ignore */
|
|
7146
7146
|
"https://esm.sh/@xmldom/xmldom@0.8.11"
|
|
7147
7147
|
)]);
|
|
7148
|
-
|
|
7148
|
+
hp = e;
|
|
7149
7149
|
let n = t.DOMParser;
|
|
7150
|
-
|
|
7151
|
-
},
|
|
7152
|
-
ENCODEURL: () =>
|
|
7153
|
-
WEBSERVICE: () =>
|
|
7150
|
+
mp = new n();
|
|
7151
|
+
}, mp = null, hp = null, gp = !1, _p = null, vp = m({
|
|
7152
|
+
ENCODEURL: () => yp,
|
|
7153
|
+
WEBSERVICE: () => bp
|
|
7154
7154
|
});
|
|
7155
|
-
function
|
|
7155
|
+
function yp(e) {
|
|
7156
7156
|
return encodeURIComponent(e);
|
|
7157
7157
|
}
|
|
7158
|
-
async function
|
|
7158
|
+
async function bp(e) {
|
|
7159
7159
|
try {
|
|
7160
7160
|
let t = await fetch(e, {
|
|
7161
7161
|
method: "GET",
|
|
@@ -7170,7 +7170,7 @@ async function yp(e) {
|
|
|
7170
7170
|
throw t.BuiltIn.Value;
|
|
7171
7171
|
}
|
|
7172
7172
|
}
|
|
7173
|
-
var
|
|
7173
|
+
var xp = {
|
|
7174
7174
|
DAVERAGE: {
|
|
7175
7175
|
p: [
|
|
7176
7176
|
{
|
|
@@ -7425,7 +7425,7 @@ var bp = {
|
|
|
7425
7425
|
],
|
|
7426
7426
|
r: { s: "*" }
|
|
7427
7427
|
}
|
|
7428
|
-
},
|
|
7428
|
+
}, Sp = {
|
|
7429
7429
|
DATE: {
|
|
7430
7430
|
p: [
|
|
7431
7431
|
{ n: "year" },
|
|
@@ -7680,7 +7680,7 @@ var bp = {
|
|
|
7680
7680
|
p: [{ n: "serialNumber" }],
|
|
7681
7681
|
r: { s: "number" }
|
|
7682
7682
|
}
|
|
7683
|
-
},
|
|
7683
|
+
}, Cp = {
|
|
7684
7684
|
Weekend: { m: [
|
|
7685
7685
|
["Saturday, Sunday", 1],
|
|
7686
7686
|
["Sunday, Monday", 2],
|
|
@@ -7721,7 +7721,7 @@ var bp = {
|
|
|
7721
7721
|
["Week begins on Sunday", 17],
|
|
7722
7722
|
["Week begins on Monday (ISO 8601)", 21]
|
|
7723
7723
|
] }
|
|
7724
|
-
},
|
|
7724
|
+
}, wp = {
|
|
7725
7725
|
BESSELI: {
|
|
7726
7726
|
p: [{
|
|
7727
7727
|
n: "x",
|
|
@@ -7786,7 +7786,7 @@ var bp = {
|
|
|
7786
7786
|
}],
|
|
7787
7787
|
r: { s: "number" }
|
|
7788
7788
|
}
|
|
7789
|
-
},
|
|
7789
|
+
}, Tp = {
|
|
7790
7790
|
BIN2DEC: {
|
|
7791
7791
|
p: [{
|
|
7792
7792
|
n: "number",
|
|
@@ -8027,7 +8027,7 @@ var bp = {
|
|
|
8027
8027
|
}],
|
|
8028
8028
|
r: { s: "*" }
|
|
8029
8029
|
}
|
|
8030
|
-
},
|
|
8030
|
+
}, Ep = { CONVERT: {
|
|
8031
8031
|
p: [
|
|
8032
8032
|
{
|
|
8033
8033
|
n: "number",
|
|
@@ -8048,7 +8048,7 @@ var bp = {
|
|
|
8048
8048
|
}
|
|
8049
8049
|
],
|
|
8050
8050
|
r: { s: "number" }
|
|
8051
|
-
} },
|
|
8051
|
+
} }, Dp = {
|
|
8052
8052
|
DELTA: {
|
|
8053
8053
|
p: [{
|
|
8054
8054
|
n: "number1",
|
|
@@ -8085,7 +8085,7 @@ var bp = {
|
|
|
8085
8085
|
}],
|
|
8086
8086
|
r: { s: "number" }
|
|
8087
8087
|
}
|
|
8088
|
-
},
|
|
8088
|
+
}, Op = {
|
|
8089
8089
|
ERF: {
|
|
8090
8090
|
p: [{
|
|
8091
8091
|
n: "lowerLimit",
|
|
@@ -8131,7 +8131,7 @@ var bp = {
|
|
|
8131
8131
|
}],
|
|
8132
8132
|
r: { s: "number" }
|
|
8133
8133
|
}
|
|
8134
|
-
},
|
|
8134
|
+
}, kp = {
|
|
8135
8135
|
COMPLEX: {
|
|
8136
8136
|
p: [
|
|
8137
8137
|
{
|
|
@@ -8412,7 +8412,7 @@ var bp = {
|
|
|
8412
8412
|
}],
|
|
8413
8413
|
r: { s: "*" }
|
|
8414
8414
|
}
|
|
8415
|
-
},
|
|
8415
|
+
}, Ap = {
|
|
8416
8416
|
CELL: {
|
|
8417
8417
|
p: [{
|
|
8418
8418
|
n: "infoType",
|
|
@@ -8610,7 +8610,7 @@ var bp = {
|
|
|
8610
8610
|
}],
|
|
8611
8611
|
r: { s: "number" }
|
|
8612
8612
|
}
|
|
8613
|
-
},
|
|
8613
|
+
}, jp = {
|
|
8614
8614
|
CellInfoType: {
|
|
8615
8615
|
s: "string",
|
|
8616
8616
|
m: [
|
|
@@ -8672,7 +8672,7 @@ var bp = {
|
|
|
8672
8672
|
["User", "user"]
|
|
8673
8673
|
]
|
|
8674
8674
|
}
|
|
8675
|
-
},
|
|
8675
|
+
}, Mp = {
|
|
8676
8676
|
DATESTRING: {
|
|
8677
8677
|
p: [{ n: "number" }],
|
|
8678
8678
|
r: { s: "*" }
|
|
@@ -8681,13 +8681,13 @@ var bp = {
|
|
|
8681
8681
|
p: [{ n: "number" }, { n: "number2" }],
|
|
8682
8682
|
r: { s: "*" }
|
|
8683
8683
|
}
|
|
8684
|
-
},
|
|
8684
|
+
}, Np = { PHONETIC: {
|
|
8685
8685
|
p: [{
|
|
8686
8686
|
n: "reference",
|
|
8687
8687
|
r: "p"
|
|
8688
8688
|
}],
|
|
8689
8689
|
r: { s: "*" }
|
|
8690
|
-
} },
|
|
8690
|
+
} }, Pp = {
|
|
8691
8691
|
AND: {
|
|
8692
8692
|
p: [{
|
|
8693
8693
|
n: "logical",
|
|
@@ -8998,7 +8998,7 @@ var bp = {
|
|
|
8998
8998
|
}],
|
|
8999
8999
|
r: { s: "*" }
|
|
9000
9000
|
}
|
|
9001
|
-
},
|
|
9001
|
+
}, Fp = { GROUPBY: {
|
|
9002
9002
|
p: [
|
|
9003
9003
|
{
|
|
9004
9004
|
n: "rowFields",
|
|
@@ -9047,7 +9047,7 @@ var bp = {
|
|
|
9047
9047
|
s: "*",
|
|
9048
9048
|
r: "m"
|
|
9049
9049
|
}
|
|
9050
|
-
} },
|
|
9050
|
+
} }, Ip = { PIVOTBY: {
|
|
9051
9051
|
p: [
|
|
9052
9052
|
{
|
|
9053
9053
|
n: "rowFields",
|
|
@@ -9113,7 +9113,7 @@ var bp = {
|
|
|
9113
9113
|
s: "*",
|
|
9114
9114
|
r: "m"
|
|
9115
9115
|
}
|
|
9116
|
-
} },
|
|
9116
|
+
} }, Lp = {
|
|
9117
9117
|
ADDRESS: {
|
|
9118
9118
|
p: [
|
|
9119
9119
|
{ n: "rowNum" },
|
|
@@ -9849,7 +9849,7 @@ var bp = {
|
|
|
9849
9849
|
],
|
|
9850
9850
|
r: { s: "*" }
|
|
9851
9851
|
}
|
|
9852
|
-
},
|
|
9852
|
+
}, Rp = {
|
|
9853
9853
|
MatchType: { m: [
|
|
9854
9854
|
["Less than", 1],
|
|
9855
9855
|
["Exact match", 0],
|
|
@@ -9874,7 +9874,7 @@ var bp = {
|
|
|
9874
9874
|
["Binary search (sorted ascending order)", 2],
|
|
9875
9875
|
["Binary search (sorted descending order)", -2]
|
|
9876
9876
|
] }
|
|
9877
|
-
},
|
|
9877
|
+
}, zp = {
|
|
9878
9878
|
ABS: {
|
|
9879
9879
|
p: [{ n: "number" }],
|
|
9880
9880
|
r: { s: "number" }
|
|
@@ -10482,7 +10482,7 @@ var bp = {
|
|
|
10482
10482
|
}],
|
|
10483
10483
|
r: { s: "number" }
|
|
10484
10484
|
}
|
|
10485
|
-
},
|
|
10485
|
+
}, Bp = {
|
|
10486
10486
|
AggregateFunction: { m: [
|
|
10487
10487
|
["AVERAGE", 1],
|
|
10488
10488
|
["COUNT", 2],
|
|
@@ -10538,7 +10538,7 @@ var bp = {
|
|
|
10538
10538
|
["VAR (visible rows)", 110],
|
|
10539
10539
|
["VARP (visible rows)", 111]
|
|
10540
10540
|
] }
|
|
10541
|
-
},
|
|
10541
|
+
}, Vp = {
|
|
10542
10542
|
ACOS: {
|
|
10543
10543
|
p: [{ n: "number" }],
|
|
10544
10544
|
r: { s: "number" }
|
|
@@ -10623,7 +10623,7 @@ var bp = {
|
|
|
10623
10623
|
p: [{ n: "number" }],
|
|
10624
10624
|
r: { s: "number" }
|
|
10625
10625
|
}
|
|
10626
|
-
},
|
|
10626
|
+
}, Hp = {
|
|
10627
10627
|
ADD: {
|
|
10628
10628
|
p: [{ n: "value1" }, { n: "value2" }],
|
|
10629
10629
|
r: { s: "number" }
|
|
@@ -10736,7 +10736,7 @@ var bp = {
|
|
|
10736
10736
|
],
|
|
10737
10737
|
r: { s: "boolean" }
|
|
10738
10738
|
}
|
|
10739
|
-
},
|
|
10739
|
+
}, Up = {
|
|
10740
10740
|
"BETA.DIST": {
|
|
10741
10741
|
fn: "BETA_DIST",
|
|
10742
10742
|
p: [
|
|
@@ -11988,7 +11988,7 @@ var bp = {
|
|
|
11988
11988
|
],
|
|
11989
11989
|
r: { s: "number" }
|
|
11990
11990
|
}
|
|
11991
|
-
},
|
|
11991
|
+
}, Wp = {
|
|
11992
11992
|
AVEDEV: {
|
|
11993
11993
|
p: [{
|
|
11994
11994
|
n: "number",
|
|
@@ -12309,7 +12309,7 @@ var bp = {
|
|
|
12309
12309
|
}, { n: "k" }],
|
|
12310
12310
|
r: { s: "number" }
|
|
12311
12311
|
}
|
|
12312
|
-
},
|
|
12312
|
+
}, Gp = {
|
|
12313
12313
|
DELAY: {
|
|
12314
12314
|
p: [
|
|
12315
12315
|
{ n: "time" },
|
|
@@ -12337,7 +12337,7 @@ var bp = {
|
|
|
12337
12337
|
}],
|
|
12338
12338
|
r: { s: "string" }
|
|
12339
12339
|
}
|
|
12340
|
-
},
|
|
12340
|
+
}, Kp = {
|
|
12341
12341
|
ASC: {
|
|
12342
12342
|
p: [{
|
|
12343
12343
|
n: "text",
|
|
@@ -12948,10 +12948,10 @@ var bp = {
|
|
|
12948
12948
|
}],
|
|
12949
12949
|
r: { s: "string" }
|
|
12950
12950
|
}
|
|
12951
|
-
},
|
|
12951
|
+
}, qp = { BAHTTEXT: {
|
|
12952
12952
|
p: [{ n: "number" }],
|
|
12953
12953
|
r: { s: "string" }
|
|
12954
|
-
} },
|
|
12954
|
+
} }, Jp = { FILTERXML: {
|
|
12955
12955
|
p: [{
|
|
12956
12956
|
n: "xml",
|
|
12957
12957
|
s: "string"
|
|
@@ -12963,7 +12963,7 @@ var bp = {
|
|
|
12963
12963
|
s: "*",
|
|
12964
12964
|
r: "m"
|
|
12965
12965
|
}
|
|
12966
|
-
} },
|
|
12966
|
+
} }, Yp = {
|
|
12967
12967
|
ENCODEURL: {
|
|
12968
12968
|
p: [{
|
|
12969
12969
|
n: "text",
|
|
@@ -12978,5 +12978,5 @@ var bp = {
|
|
|
12978
12978
|
}],
|
|
12979
12979
|
r: { s: "string" }
|
|
12980
12980
|
}
|
|
12981
|
-
},
|
|
12982
|
-
export {
|
|
12981
|
+
}, Xp = () => import("./CnvR3EiK8b4IYqeQ.mjs"), Zp = () => import("./0x5l9_ZIbiV0OsPM.mjs"), Qp = () => import("./LSB9NC_9pLFIXB2r.mjs"), $p = () => import("./CNlk9maTZcfnUoqC.mjs"), em = () => import("./DxQH39LzO3Dy-i--.mjs"), tm = () => import("./DSERN9sINhqwboEy.mjs"), nm = () => import("./rcUA627TgCowf8TT.mjs"), rm = () => import("./C8T9tdc0Ro3dYT5i.mjs"), im = () => import("./IdYYtD2hRuVaaSo5.mjs"), am = () => import("./_EPqEYbpgoySRKpA.mjs"), om = () => import("./DRamw-nLOZBXeDlT.mjs"), sm = () => import("./CfvEeNcQ1nU48r9h.mjs"), cm = () => import("./VmFmgY9dzxIwm52h.mjs"), lm = () => import("./ByDxheg-vywRUW_k.mjs"), um = () => import("./DNbjcGCykjUZf_DR.mjs"), dm = () => import("./L8H_ruX1UE3o8Y3Y.mjs"), fm = () => import("./Bx8w0EgTgcvUP2FG.mjs"), pm = () => import("./Dl4FJb5rdXwETLy5.mjs"), mm = () => import("./CHSEyxhpLg7gA_-m.mjs"), hm = () => import("./DNqckj8TulTGo7FR.mjs"), gm = () => import("./BMqGkc9lB3bzYJi2.mjs"), _m = () => import("./ByxQneGrvNXRw1C3.mjs"), vm = () => import("./DDC5dkydbI95ULio.mjs"), ym = () => import("./e3gK86aUTL33K049.mjs"), bm = () => import("./Dbe7sAcT1MMSJCLl.mjs"), xm = (e, t, n) => (n ||= /* @__PURE__ */ new Map(), t(n, e, y, xp, Xp, "Database"), t(n, e, ge, Sp, Zp, "Date & Time", Cp), t(n, e, tt, wp, Qp, "Engineering"), t(n, e, lt, Tp, $p, "Engineering"), t(n, e, Rt, Ep, em, "Engineering"), t(n, e, Kt, Dp, tm, "Engineering"), t(n, e, _n, Op, nm, "Engineering"), t(n, e, An, kp, rm, "Engineering"), t(n, e, Cr, Ap, im, "Information", jp), t(n, e, $r, Mp, am, "Japanese"), t(n, e, ni, Np, om, "Japanese"), t(n, e, ai, Pp, sm, "Logical"), t(n, e, Oi, Fp, cm, "Lookup & Reference"), t(n, e, Ai, Ip, lm, "Lookup & Reference"), t(n, e, Fi, Lp, um, "Lookup & Reference", Rp), t(n, e, Ga, zp, dm, "Math & Trig", Bp), t(n, e, Cs, Vp, fm, "Math & Trig"), t(n, e, Gs, Hp, pm, "Operators"), t(n, e, ol, Up, mm, "Statistical"), t(n, e, pc, Wp, hm, "Statistical"), t(n, e, Ad, Gp, gm, "Testing"), t(n, e, Id, Kp, _m, "Text"), t(n, e, cp, qp, vm, "Thai"), t(n, e, dp, Jp, ym, "Web"), t(n, e, vp, Yp, bm, "Web"), n);
|
|
12982
|
+
export { xm as default };
|