@sheetxl/formulas 0.8.0-beta.21 → 0.8.0-beta.23
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/esm/{Cvl0kBQedMoaGKZz.mjs → -3OnHOj2LLDR1fc_.mjs} +1 -1
- package/browser/esm/{DFpfRnloKbWmMR4B.mjs → B3ZIxkXpijIr7_0H.mjs} +1 -1
- package/browser/esm/{sEnzSvD52gctYJAN.mjs → B4JL4tyPYordrFSn.mjs} +1 -1
- package/browser/esm/{36J0hb76F3B-Yt_s.mjs → B8Lb4ycMbsisimyJ.mjs} +1 -1
- package/browser/esm/{DOTlsneAHs5EdPxc.mjs → BMu9wmB3CUBwBBW1.mjs} +1 -1
- package/{node/esm/88LXPDuhlvyD60fy.mjs → browser/esm/BXyl3EySzcpdcg4a.mjs} +1 -1
- package/browser/esm/{JYuF4ff9ziOhTnnS.mjs → Bgm6ooSL37aLrze-.mjs} +1 -1
- package/{node/esm/DPTl2dlCelXbEuml.mjs → browser/esm/C6XhGX3n-kOXcVe-.mjs} +1 -1
- package/{node/esm/BFFmVQRfdZ1yIulh.mjs → browser/esm/CEL8D-iv8wA9zzGP.mjs} +1 -1
- package/browser/esm/{CCUYDvC14VKi3pBi.mjs → CZM973Z0Okl_3JQc.mjs} +1 -1
- package/{node/esm/yDs0erVJTPEM7IFS.mjs → browser/esm/CcHSbpd59O15t-0s.mjs} +1 -1
- package/browser/esm/{Dk6lfBjBZaMcnv8I.mjs → Cod2iEVYfjhcXGHs.mjs} +1 -1
- package/browser/esm/{D21CuJHvf_XaiX9c.mjs → CuoQKYMmPOfl94gW.mjs} +1 -1
- package/browser/esm/{CWwf_lLPzVmbPPpz.mjs → DKarKpru6FjwvLA_.mjs} +1 -1
- package/browser/esm/{ByRF8BNaAbA79LCH.mjs → DMTraB6qAjSlyDKP.mjs} +1 -1
- package/browser/esm/{CD9mkmFJMlZrNADp.mjs → DRcy1_Zqu53jue2l.mjs} +1 -1
- package/browser/esm/{CfVMqm2AzXF9CdI3.mjs → DTQMfBMFzcfiKUUd.mjs} +1 -1
- package/{node/esm/DgH5-IPiJ5PXzF3E.mjs → browser/esm/DTtayzMN3z3KzrEs.mjs} +1 -1
- package/{node/esm/C_O_CTtUMItlRiCC.mjs → browser/esm/DgQs_yv8yoyN7IvY.mjs} +1 -1
- package/browser/esm/{BI-pi-NwnVgRzoGz.mjs → DhGoS8Vi10avRc0T.mjs} +1 -1
- package/browser/esm/{n3Xd5PoUQhwyyT05.mjs → FJ3f_AG3AtqiwPvE.mjs} +1 -1
- package/{node/esm/D_7qCMxspQ3wsAVl.mjs → browser/esm/KGE7M7zDiMjCOz64.mjs} +1 -1
- package/browser/esm/{D-Umi0mibCub9Vsr.mjs → OkSc7RXqdqBX_dhB.mjs} +1 -1
- package/browser/esm/{39oTdbbzAtAsdBlF.mjs → UzUKr0PdyOTCvFQK.mjs} +1 -1
- package/browser/esm/declarations.mjs +2 -2
- package/browser/esm/index.mjs +790 -792
- package/{node/esm/COB1SzRuMOHUTnrw.mjs → browser/esm/j3fzAwgnII1ABYoy.mjs} +1 -1
- package/{node/esm/CEdVWRdSFVYnuVUV.mjs → browser/esm/tT_Sh3neAQCj8w1k.mjs} +1 -1
- package/node/esm/{Cvl0kBQedMoaGKZz.mjs → -3OnHOj2LLDR1fc_.mjs} +1 -1
- package/node/esm/{AZGy2Uev0yRLRmA5.mjs → 09cs4iXujO7ozZKl.mjs} +1 -1
- package/node/esm/{sEnzSvD52gctYJAN.mjs → B4JL4tyPYordrFSn.mjs} +1 -1
- package/node/esm/{J89e38tEnJKMMtJV.mjs → B4cV-4I4AxsDqTeg.mjs} +1 -1
- package/node/esm/{36J0hb76F3B-Yt_s.mjs → B8Lb4ycMbsisimyJ.mjs} +1 -1
- package/node/esm/{CJqIrIx1V5su8DBU.mjs → BBsG5_MNOOBzpkm3.mjs} +1 -1
- package/{browser/esm/88LXPDuhlvyD60fy.mjs → node/esm/BXyl3EySzcpdcg4a.mjs} +1 -1
- package/node/esm/{Hnk6ODJMVM17S8Lj.mjs → BgWNOg6VC2WA3Wld.mjs} +1 -1
- package/node/esm/{JYuF4ff9ziOhTnnS.mjs → Bgm6ooSL37aLrze-.mjs} +1 -1
- package/{browser/esm/DPTl2dlCelXbEuml.mjs → node/esm/C6XhGX3n-kOXcVe-.mjs} +1 -1
- package/{browser/esm/BFFmVQRfdZ1yIulh.mjs → node/esm/CEL8D-iv8wA9zzGP.mjs} +1 -1
- package/node/esm/{dQJG9TMB06CuunYH.mjs → CHRc41kLdyeK5TBj.mjs} +1 -1
- package/node/esm/{Di3s39PkZ9FUAh99.mjs → CRPSImZV4jAnwQKI.mjs} +1 -1
- package/{browser/esm/yDs0erVJTPEM7IFS.mjs → node/esm/CcHSbpd59O15t-0s.mjs} +1 -1
- package/node/esm/{CSDOBBqCH6vwnnJa.mjs → Cwmf3WtWvqEbXl9w.mjs} +1 -1
- package/node/esm/{Dgic_pZAx_r79ToI.mjs → DBovrQMoOcTgfyy5.mjs} +1 -1
- package/node/esm/{CWwf_lLPzVmbPPpz.mjs → DKarKpru6FjwvLA_.mjs} +1 -1
- package/node/esm/{CD9mkmFJMlZrNADp.mjs → DRcy1_Zqu53jue2l.mjs} +1 -1
- package/{browser/esm/DgH5-IPiJ5PXzF3E.mjs → node/esm/DTtayzMN3z3KzrEs.mjs} +1 -1
- package/{browser/esm/C_O_CTtUMItlRiCC.mjs → node/esm/DgQs_yv8yoyN7IvY.mjs} +1 -1
- package/node/esm/{BI-pi-NwnVgRzoGz.mjs → DhGoS8Vi10avRc0T.mjs} +1 -1
- package/{browser/esm/D_7qCMxspQ3wsAVl.mjs → node/esm/KGE7M7zDiMjCOz64.mjs} +1 -1
- package/node/esm/{D-Umi0mibCub9Vsr.mjs → OkSc7RXqdqBX_dhB.mjs} +1 -1
- package/node/esm/{39oTdbbzAtAsdBlF.mjs → UzUKr0PdyOTCvFQK.mjs} +1 -1
- package/node/esm/declarations.mjs +2 -2
- package/node/esm/index.mjs +1181 -1183
- package/{browser/esm/COB1SzRuMOHUTnrw.mjs → node/esm/j3fzAwgnII1ABYoy.mjs} +1 -1
- package/{browser/esm/CEdVWRdSFVYnuVUV.mjs → node/esm/tT_Sh3neAQCj8w1k.mjs} +1 -1
- package/package.json +3 -3
- package/types/src/_utils/Distributions.d.ts +3 -5
package/browser/esm/index.mjs
CHANGED
|
@@ -1,136 +1,136 @@
|
|
|
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.23
|
|
3
3
|
*
|
|
4
4
|
* (C) 2026-present SheetXL Inc. & Michael T. Ford
|
|
5
5
|
* License: MIT
|
|
6
6
|
*/
|
|
7
|
-
import { C as e, D as t, E as n, O as r, S as i, T as a, _ as o, a as s, b as c, c as l, d as u, f as d, g as f, h as p, i as m, k as h, l as g, m as _, n as ee, o as te, p as ne, r as re, s as ie, t as ae, u as oe, v as se, w as ce, x as le, y as ue } from "./
|
|
8
|
-
import { FormulaContext as v, FormulaError as y, IRange as b, Scalar as
|
|
9
|
-
var
|
|
7
|
+
import { C as e, D as t, E as n, O as r, S as i, T as a, _ as o, a as s, b as c, c as l, d as u, f as d, g as f, h as p, i as m, k as h, l as g, m as _, n as ee, o as te, p as ne, r as re, s as ie, t as ae, u as oe, v as se, w as ce, x as le, y as ue } from "./Cod2iEVYfjhcXGHs.mjs";
|
|
8
|
+
import { FormulaContext as v, FormulaError as y, IRange as b, Scalar as x, ScalarType as S, ValueKind as C, WildCard as de } from "@sheetxl/primitives";
|
|
9
|
+
var fe = Object.create, pe = Object.defineProperty, me = Object.getOwnPropertyDescriptor, he = Object.getOwnPropertyNames, ge = Object.getPrototypeOf, _e = Object.prototype.hasOwnProperty, ve = (e, t) => () => (t || (e((t = { exports: {} }).exports, t), e = null), t.exports), w = (e, t) => {
|
|
10
10
|
let n = {};
|
|
11
|
-
for (var r in e)
|
|
11
|
+
for (var r in e) pe(n, r, {
|
|
12
12
|
get: e[r],
|
|
13
13
|
enumerable: !0
|
|
14
14
|
});
|
|
15
|
-
return t ||
|
|
16
|
-
},
|
|
17
|
-
if (t && typeof t == "object" || typeof t == "function") for (var i, a =
|
|
15
|
+
return t || pe(n, Symbol.toStringTag, { value: "Module" }), n;
|
|
16
|
+
}, ye = (e, t, n) => (n = e == null ? {} : fe(ge(e)), ((e, t, n, r) => {
|
|
17
|
+
if (t && typeof t == "object" || typeof t == "function") for (var i, a = he(t), o = 0, s = a.length; o < s; o++) i = a[o], _e.call(e, i) || i === n || pe(e, i, {
|
|
18
18
|
get: ((e) => t[e]).bind(null, i),
|
|
19
|
-
enumerable: !(r =
|
|
19
|
+
enumerable: !(r = me(t, i)) || r.enumerable
|
|
20
20
|
});
|
|
21
21
|
return e;
|
|
22
|
-
})(!t && e && e.__esModule &&
|
|
22
|
+
})(!t && e && e.__esModule && _e.call(e, "default") ? n : pe(n, "default", {
|
|
23
23
|
value: e,
|
|
24
24
|
enumerable: !0
|
|
25
|
-
}), e)),
|
|
26
|
-
DAVERAGE: () =>
|
|
27
|
-
DCOUNT: () =>
|
|
28
|
-
DCOUNTA: () =>
|
|
29
|
-
DGET: () =>
|
|
30
|
-
DMAX: () =>
|
|
31
|
-
DMIN: () =>
|
|
32
|
-
DPRODUCT: () =>
|
|
33
|
-
DSTDEV: () =>
|
|
34
|
-
DSTDEVP: () =>
|
|
35
|
-
DSUM: () =>
|
|
36
|
-
DVAR: () =>
|
|
37
|
-
DVARP: () =>
|
|
25
|
+
}), e)), T = (e) => e > -22250738585072014e-324 && e < 22250738585072014e-324 ? 0 : e, be = 2 ** -22, E = (e) => Math.trunc(e + be), xe = (e) => Math.abs(e) >= .5 ? Math.log((1 + e) / (1 - e)) / 2 : Math.log1p(2 * e / (1 - e)) / 2, D = (e) => e !== 0 && Number.isFinite(e) ? Number(e.toPrecision(15)) : e, Se = w({
|
|
26
|
+
DAVERAGE: () => Ce,
|
|
27
|
+
DCOUNT: () => we,
|
|
28
|
+
DCOUNTA: () => Te,
|
|
29
|
+
DGET: () => Ee,
|
|
30
|
+
DMAX: () => De,
|
|
31
|
+
DMIN: () => Oe,
|
|
32
|
+
DPRODUCT: () => ke,
|
|
33
|
+
DSTDEV: () => Ae,
|
|
34
|
+
DSTDEVP: () => je,
|
|
35
|
+
DSUM: () => Me,
|
|
36
|
+
DVAR: () => Ne,
|
|
37
|
+
DVARP: () => Pe
|
|
38
38
|
});
|
|
39
|
-
function
|
|
40
|
-
let r =
|
|
39
|
+
function Ce(e, t, n) {
|
|
40
|
+
let r = O(e, t, n);
|
|
41
41
|
if (y.isError(r)) return r;
|
|
42
42
|
let i = r.getStats().getAggregates().average;
|
|
43
43
|
if (i == null) throw y.BuiltIn.Div0;
|
|
44
44
|
return i;
|
|
45
45
|
}
|
|
46
|
-
function
|
|
47
|
-
if (t === void 0) return
|
|
48
|
-
let r =
|
|
46
|
+
function we(e, t, n) {
|
|
47
|
+
if (t === void 0) return Le(e, n);
|
|
48
|
+
let r = Ie(e, t, n);
|
|
49
49
|
return y.isError(r) ? r : r.getStats().getAggregates().numericalCount ?? 0;
|
|
50
50
|
}
|
|
51
|
-
function
|
|
52
|
-
if (t === void 0) return
|
|
53
|
-
let r =
|
|
51
|
+
function Te(e, t, n) {
|
|
52
|
+
if (t === void 0) return Le(e, n);
|
|
53
|
+
let r = Ie(e, t, n);
|
|
54
54
|
return y.isError(r) ? r : r.getStats().getAggregates().count ?? 0;
|
|
55
55
|
}
|
|
56
|
-
function
|
|
57
|
-
let r =
|
|
56
|
+
function Ee(e, t, n) {
|
|
57
|
+
let r = Ie(e, t, n);
|
|
58
58
|
if (y.isError(r)) return r;
|
|
59
59
|
let { rows: i } = r.getShape();
|
|
60
60
|
return i === 0 ? y.BuiltIn.Value : i > 1 ? y.BuiltIn.Num : r.getValueAt(0, 0);
|
|
61
61
|
}
|
|
62
|
-
function
|
|
63
|
-
let r =
|
|
62
|
+
function De(e, t, n) {
|
|
63
|
+
let r = O(e, t, n);
|
|
64
64
|
return y.isError(r) ? r : r.getStats().getAggregates().max ?? 0;
|
|
65
65
|
}
|
|
66
|
-
function
|
|
67
|
-
let r =
|
|
66
|
+
function Oe(e, t, n) {
|
|
67
|
+
let r = O(e, t, n);
|
|
68
68
|
return y.isError(r) ? r : r.getStats().getAggregates().min ?? 0;
|
|
69
69
|
}
|
|
70
|
-
function
|
|
71
|
-
let r =
|
|
70
|
+
function ke(e, t, n) {
|
|
71
|
+
let r = O(e, t, n);
|
|
72
72
|
if (y.isError(r)) return r;
|
|
73
73
|
let i = 1, a = !1;
|
|
74
74
|
return r.forEach((e) => {
|
|
75
75
|
typeof e == "number" && (i *= e, a = !0);
|
|
76
76
|
}), a ? i : 0;
|
|
77
77
|
}
|
|
78
|
-
function
|
|
79
|
-
let r =
|
|
78
|
+
function Ae(e, t, n) {
|
|
79
|
+
let r = O(e, t, n);
|
|
80
80
|
if (y.isError(r)) return r;
|
|
81
81
|
let i = r.getStats().getAggregates();
|
|
82
82
|
return (i.numericalCount ?? 0) < 2 ? y.BuiltIn.Div0 : i.stdDev ?? 0;
|
|
83
83
|
}
|
|
84
|
-
function
|
|
85
|
-
let r =
|
|
84
|
+
function je(e, t, n) {
|
|
85
|
+
let r = O(e, t, n);
|
|
86
86
|
if (y.isError(r)) return r;
|
|
87
87
|
let i = r.getStats().getAggregates();
|
|
88
88
|
return i.numericalCount ? i.stdDevP ?? 0 : y.BuiltIn.Div0;
|
|
89
89
|
}
|
|
90
|
-
function
|
|
91
|
-
let r =
|
|
90
|
+
function Me(e, t, n) {
|
|
91
|
+
let r = O(e, t, n);
|
|
92
92
|
return y.isError(r) ? r : r.getStats().getAggregates().sum ?? 0;
|
|
93
93
|
}
|
|
94
|
-
function
|
|
95
|
-
let r =
|
|
94
|
+
function Ne(e, t, n) {
|
|
95
|
+
let r = O(e, t, n);
|
|
96
96
|
if (y.isError(r)) return r;
|
|
97
97
|
let i = r.getStats().getAggregates();
|
|
98
98
|
return (i.numericalCount ?? 0) < 2 ? y.BuiltIn.Div0 : i.var ?? 0;
|
|
99
99
|
}
|
|
100
|
-
function
|
|
101
|
-
let r =
|
|
100
|
+
function Pe(e, t, n) {
|
|
101
|
+
let r = O(e, t, n);
|
|
102
102
|
if (y.isError(r)) return r;
|
|
103
103
|
let i = r.getStats().getAggregates();
|
|
104
104
|
return i.numericalCount ? i.varP ?? 0 : y.BuiltIn.Div0;
|
|
105
105
|
}
|
|
106
|
-
function
|
|
106
|
+
function Fe(e, t, n) {
|
|
107
107
|
return y.isError(e) ? e : y.isError(t) ? v.getArgs().isDirectAt(1) ? t : y.BuiltIn.Value : y.isError(n) ? n : null;
|
|
108
108
|
}
|
|
109
|
-
function
|
|
110
|
-
let r =
|
|
109
|
+
function Ie(e, t, n) {
|
|
110
|
+
let r = Fe(e, t, n);
|
|
111
111
|
if (r) return r;
|
|
112
112
|
if (e.getShape().rows < 2 || n.getShape().rows < 2) return y.BuiltIn.Value;
|
|
113
113
|
let i = function(e, t) {
|
|
114
114
|
let { columns: n } = e.getShape();
|
|
115
115
|
if (typeof t == "boolean" && (t = +!!t), typeof t == "number") {
|
|
116
|
-
let e = Math.trunc(
|
|
116
|
+
let e = Math.trunc(D(t)) - 1;
|
|
117
117
|
return e < 0 || e >= n ? -1 : e;
|
|
118
118
|
}
|
|
119
|
-
return typeof t == "string" ?
|
|
119
|
+
return typeof t == "string" ? Re(e, t) : -1;
|
|
120
120
|
}(e, t);
|
|
121
|
-
return i < 0 ? y.BuiltIn.Value : e.take(
|
|
121
|
+
return i < 0 ? y.BuiltIn.Value : e.take(ze(e, n)).slice({
|
|
122
122
|
colStart: i,
|
|
123
123
|
colEnd: i
|
|
124
124
|
});
|
|
125
125
|
}
|
|
126
|
-
function
|
|
127
|
-
let r =
|
|
126
|
+
function O(e, t, n) {
|
|
127
|
+
let r = Ie(e, t, n);
|
|
128
128
|
return y.isError(r) ? r : r.hasError() ? r.firstError() : r;
|
|
129
129
|
}
|
|
130
|
-
function
|
|
131
|
-
return
|
|
130
|
+
function Le(e, t) {
|
|
131
|
+
return Fe(e, void 0, t) || (e.getShape().rows < 2 || t.getShape().rows < 2 ? y.BuiltIn.Value : ze(e, t).length);
|
|
132
132
|
}
|
|
133
|
-
function
|
|
133
|
+
function Re(e, t) {
|
|
134
134
|
let { columns: n } = e.getShape(), r = typeof t == "string" ? t.toUpperCase() : t;
|
|
135
135
|
for (let t = 0; t < n; t++) {
|
|
136
136
|
let n = e.getValueAt(0, t);
|
|
@@ -140,10 +140,10 @@ function ze(e, t) {
|
|
|
140
140
|
}
|
|
141
141
|
return -1;
|
|
142
142
|
}
|
|
143
|
-
function
|
|
143
|
+
function ze(e, t) {
|
|
144
144
|
let { rows: n } = e.getShape(), r = function(e, t) {
|
|
145
145
|
let { rows: n, columns: r } = t.getShape(), i = [];
|
|
146
|
-
for (let n = 0; n < r; n++) i[n] =
|
|
146
|
+
for (let n = 0; n < r; n++) i[n] = Re(e, t.getValueAt(0, n));
|
|
147
147
|
let a = [];
|
|
148
148
|
for (let e = 1; e < n; e++) {
|
|
149
149
|
let n = [], o = !1;
|
|
@@ -167,37 +167,37 @@ function Be(e, t) {
|
|
|
167
167
|
for (let t = 1; t < n; t++) r.some((n) => n !== null && n.every(({ dbColIndex: n, evaluator: r }) => r(e.getValueAt(t, n)))) && i.push(t);
|
|
168
168
|
return i;
|
|
169
169
|
}
|
|
170
|
-
var
|
|
171
|
-
DATE: () =>
|
|
172
|
-
DATEVALUE: () =>
|
|
173
|
-
DAY: () =>
|
|
174
|
-
DAYS: () =>
|
|
175
|
-
EDATE: () =>
|
|
176
|
-
EOMONTH: () =>
|
|
177
|
-
HOUR: () =>
|
|
178
|
-
ISOWEEKNUM: () =>
|
|
179
|
-
MINUTE: () =>
|
|
180
|
-
MONTH: () =>
|
|
181
|
-
NETWORKDAYS: () =>
|
|
182
|
-
NETWORKDAYS_INTL: () =>
|
|
183
|
-
NOW: () =>
|
|
184
|
-
SECOND: () =>
|
|
185
|
-
TIME: () =>
|
|
186
|
-
TIMEVALUE: () =>
|
|
187
|
-
TODAY: () =>
|
|
188
|
-
WEEKDAY: () =>
|
|
189
|
-
WEEKNUM: () =>
|
|
190
|
-
WORKDAY: () =>
|
|
191
|
-
WORKDAY_INTL: () =>
|
|
192
|
-
YEAR: () =>
|
|
170
|
+
var Be = w({
|
|
171
|
+
DATE: () => Ve,
|
|
172
|
+
DATEVALUE: () => He,
|
|
173
|
+
DAY: () => Ue,
|
|
174
|
+
DAYS: () => We,
|
|
175
|
+
EDATE: () => qe,
|
|
176
|
+
EOMONTH: () => Je,
|
|
177
|
+
HOUR: () => et,
|
|
178
|
+
ISOWEEKNUM: () => tt,
|
|
179
|
+
MINUTE: () => nt,
|
|
180
|
+
MONTH: () => rt,
|
|
181
|
+
NETWORKDAYS: () => it,
|
|
182
|
+
NETWORKDAYS_INTL: () => ot,
|
|
183
|
+
NOW: () => st,
|
|
184
|
+
SECOND: () => ct,
|
|
185
|
+
TIME: () => lt,
|
|
186
|
+
TIMEVALUE: () => ut,
|
|
187
|
+
TODAY: () => dt,
|
|
188
|
+
WEEKDAY: () => ft,
|
|
189
|
+
WEEKNUM: () => pt,
|
|
190
|
+
WORKDAY: () => mt,
|
|
191
|
+
WORKDAY_INTL: () => ht,
|
|
192
|
+
YEAR: () => gt
|
|
193
193
|
});
|
|
194
|
-
function
|
|
195
|
-
if (v.formatResults("Short Date"), e =
|
|
194
|
+
function Ve(e, t, n) {
|
|
195
|
+
if (v.formatResults("Short Date"), e = Ct(e), t = Ct(t), n = Ct(n), e < 0 || e >= 1e4 || (e < 1900 && (e += 1900), t < -32767 || t > 32766) || e + Math.floor((t - 1) / 12) > 9999) return NaN;
|
|
196
196
|
(n > 32767 || n < -32768) && (n = 32767);
|
|
197
197
|
let r = v.getSerialDate(e, t, n);
|
|
198
198
|
return r == null || r < 0 || r > v.getSerialDate(9999, 12, 31) ? NaN : r;
|
|
199
199
|
}
|
|
200
|
-
function
|
|
200
|
+
function He(e) {
|
|
201
201
|
try {
|
|
202
202
|
let t = v.parseAsSerialDate(e);
|
|
203
203
|
return Math.floor(t);
|
|
@@ -205,20 +205,20 @@ function Ue(e) {
|
|
|
205
205
|
throw y.BuiltIn.Value;
|
|
206
206
|
}
|
|
207
207
|
}
|
|
208
|
-
function
|
|
208
|
+
function Ue(e) {
|
|
209
209
|
return v.getDateParts(e).day;
|
|
210
210
|
}
|
|
211
|
-
function
|
|
212
|
-
return
|
|
211
|
+
function We(e, t) {
|
|
212
|
+
return k(Ge(e)) - k(Ge(t));
|
|
213
213
|
}
|
|
214
|
-
function
|
|
215
|
-
return e === null ? 0 : typeof e == "boolean" ? +!!e :
|
|
214
|
+
function Ge(e) {
|
|
215
|
+
return e === null ? 0 : typeof e == "boolean" ? +!!e : A(e);
|
|
216
216
|
}
|
|
217
|
-
function
|
|
217
|
+
function k(e) {
|
|
218
218
|
if (!(e >= 0) || Math.floor(e) > v.getSerialDate(9999, 12, 31)) throw y.BuiltIn.Num;
|
|
219
219
|
return Math.floor(e);
|
|
220
220
|
}
|
|
221
|
-
function
|
|
221
|
+
function A(e) {
|
|
222
222
|
if (e === null) return 0;
|
|
223
223
|
if (typeof e == "string") try {
|
|
224
224
|
return v.parseAsNumber(e);
|
|
@@ -227,29 +227,29 @@ function k(e) {
|
|
|
227
227
|
}
|
|
228
228
|
return v.parseAsSerialDate(e);
|
|
229
229
|
}
|
|
230
|
-
function
|
|
230
|
+
function Ke(e) {
|
|
231
231
|
return e === null ? 0 : v.parseAsNumber(e);
|
|
232
232
|
}
|
|
233
|
-
function
|
|
233
|
+
function j(e, t) {
|
|
234
234
|
if (e === void 0) throw y.BuiltIn.NA;
|
|
235
235
|
return t(e);
|
|
236
236
|
}
|
|
237
|
-
function
|
|
238
|
-
let n =
|
|
239
|
-
return
|
|
237
|
+
function qe(e, t) {
|
|
238
|
+
let n = k(j(e, A)), { year: r, month: i, day: a } = v.getDateParts(n), { year: o, month: s } = $e(r, i, Xe(t));
|
|
239
|
+
return Ye(o, s, v.getSerialDate(o, s, Math.min(a, Qe(o, s))));
|
|
240
240
|
}
|
|
241
|
-
function
|
|
242
|
-
let n =
|
|
243
|
-
return
|
|
241
|
+
function Je(e, t) {
|
|
242
|
+
let n = k(j(e, A)), { year: r, month: i } = v.getDateParts(n), { year: a, month: o } = $e(r, i, Xe(t));
|
|
243
|
+
return Ye(a, o, v.getSerialDate(a, o, Qe(a, o)));
|
|
244
244
|
}
|
|
245
|
-
function
|
|
245
|
+
function Ye(e, t, n) {
|
|
246
246
|
if (v.getSerialDate(e, t, 1) < 0 || n > v.getSerialDate(9999, 12, 31)) throw y.BuiltIn.Num;
|
|
247
247
|
return n;
|
|
248
248
|
}
|
|
249
|
-
function
|
|
250
|
-
return Math.trunc(
|
|
249
|
+
function Xe(e) {
|
|
250
|
+
return Math.trunc(j(e, Ke));
|
|
251
251
|
}
|
|
252
|
-
var
|
|
252
|
+
var Ze = [
|
|
253
253
|
31,
|
|
254
254
|
28,
|
|
255
255
|
31,
|
|
@@ -263,33 +263,33 @@ var Qe = [
|
|
|
263
263
|
30,
|
|
264
264
|
31
|
|
265
265
|
];
|
|
266
|
-
function
|
|
267
|
-
return t === 2 ? e % 4 != 0 || e % 100 == 0 && e % 400 != 0 ? 28 : 29 :
|
|
266
|
+
function Qe(e, t) {
|
|
267
|
+
return t === 2 ? e % 4 != 0 || e % 100 == 0 && e % 400 != 0 ? 28 : 29 : Ze[t - 1];
|
|
268
268
|
}
|
|
269
|
-
function
|
|
269
|
+
function $e(e, t, n) {
|
|
270
270
|
let r = t + n - 1;
|
|
271
271
|
return {
|
|
272
272
|
year: e + Math.floor(r / 12),
|
|
273
273
|
month: (r % 12 + 12) % 12 + 1
|
|
274
274
|
};
|
|
275
275
|
}
|
|
276
|
-
function
|
|
276
|
+
function et(e) {
|
|
277
277
|
return v.getDateParts(e).hour;
|
|
278
278
|
}
|
|
279
|
-
function
|
|
280
|
-
let t =
|
|
279
|
+
function tt(e) {
|
|
280
|
+
let t = k(e), { year: n, dow: r } = v.getDateParts(t), i = t + 4 - r, a = n;
|
|
281
281
|
return i < v.getSerialDate(a, 1, 1) ? --a : i >= v.getSerialDate(a + 1, 1, 1) && (a += 1), Math.floor((i - v.getSerialDate(a, 1, 1)) / 7) + 1;
|
|
282
282
|
}
|
|
283
|
-
function
|
|
283
|
+
function nt(e) {
|
|
284
284
|
return v.getDateParts(e).minute;
|
|
285
285
|
}
|
|
286
|
-
function
|
|
286
|
+
function rt(e) {
|
|
287
287
|
return v.getDateParts(e).month;
|
|
288
288
|
}
|
|
289
|
-
function
|
|
290
|
-
return
|
|
289
|
+
function it(e, t, n) {
|
|
290
|
+
return ot(e, t, 1, n);
|
|
291
291
|
}
|
|
292
|
-
function
|
|
292
|
+
function at(e) {
|
|
293
293
|
let t = e === null ? 0 : e;
|
|
294
294
|
if (typeof t == "string") {
|
|
295
295
|
if (t.length !== 7 || /[^01]/.test(t)) throw y.BuiltIn.Value;
|
|
@@ -298,47 +298,47 @@ function ot(e) {
|
|
|
298
298
|
return n;
|
|
299
299
|
}
|
|
300
300
|
if (typeof t == "boolean" && (t = +!!t), typeof t != "number") throw y.BuiltIn.Value;
|
|
301
|
-
let n =
|
|
301
|
+
let n = yt[Math.trunc(t)];
|
|
302
302
|
if (n == null) throw y.BuiltIn.Num;
|
|
303
303
|
return n;
|
|
304
304
|
}
|
|
305
|
-
function
|
|
306
|
-
let i =
|
|
305
|
+
function ot(e, t, n = 1, r) {
|
|
306
|
+
let i = at(n), a = k(j(e, A)), o = k(j(t, A)), s = 1;
|
|
307
307
|
if (a > o) {
|
|
308
308
|
s = -1;
|
|
309
309
|
let e = a;
|
|
310
310
|
a = o, o = e;
|
|
311
311
|
}
|
|
312
|
-
let c =
|
|
313
|
-
for (let e = a; e <= o; e++) i.includes(
|
|
312
|
+
let c = St(r), l = xt(), u = 0;
|
|
313
|
+
for (let e = a; e <= o; e++) i.includes(bt(e, l)) || c.has(e) || u++;
|
|
314
314
|
return s * u;
|
|
315
315
|
}
|
|
316
|
-
function
|
|
316
|
+
function st() {
|
|
317
317
|
return v.formatResults("Short DateTime"), v.getNow();
|
|
318
318
|
}
|
|
319
|
-
function
|
|
319
|
+
function ct(e) {
|
|
320
320
|
return v.getDateParts(e).second;
|
|
321
321
|
}
|
|
322
|
-
function
|
|
323
|
-
if (v.formatResults("Medium Time"), e =
|
|
322
|
+
function lt(e, t, n) {
|
|
323
|
+
if (v.formatResults("Medium Time"), e = Ct(e), t = Ct(t), n = Ct(n), e < -32768 || e > 32767 || t < -32768 || t > 32767 || n < -32768 || n > 32767) return NaN;
|
|
324
324
|
let r = 3600 * e + 60 * t + n;
|
|
325
325
|
if (r < 0) return NaN;
|
|
326
326
|
let i = r / 86400;
|
|
327
327
|
return i - Math.floor(i);
|
|
328
328
|
}
|
|
329
|
-
function
|
|
329
|
+
function ut(e) {
|
|
330
330
|
let t = v.parseAsSerialDate(e);
|
|
331
331
|
return t - Math.floor(t);
|
|
332
332
|
}
|
|
333
|
-
function
|
|
333
|
+
function dt() {
|
|
334
334
|
return v.formatResults("Short Date"), Math.floor(v.getNow());
|
|
335
335
|
}
|
|
336
|
-
function
|
|
337
|
-
let n =
|
|
336
|
+
function ft(e, t = 1) {
|
|
337
|
+
let n = vt[Tt(t)];
|
|
338
338
|
if (!n) throw y.BuiltIn.Num;
|
|
339
339
|
return n[v.getDateParts(e).dow % 7];
|
|
340
340
|
}
|
|
341
|
-
function
|
|
341
|
+
function pt(e, t = 1) {
|
|
342
342
|
if (e === void 0) throw y.BuiltIn.NA;
|
|
343
343
|
let n;
|
|
344
344
|
if (e === null) n = 0;
|
|
@@ -348,33 +348,34 @@ function mt(e, t = 1) {
|
|
|
348
348
|
n = v.parseAsSerialDate(e);
|
|
349
349
|
}
|
|
350
350
|
else n = v.parseAsSerialDate(e);
|
|
351
|
-
n =
|
|
352
|
-
let r = t === null ? 0 :
|
|
353
|
-
if (r === 21) return
|
|
354
|
-
let i =
|
|
351
|
+
n = k(n);
|
|
352
|
+
let r = t === null ? 0 : Tt(v.parseAsNumber(t));
|
|
353
|
+
if (r === 21) return tt(n);
|
|
354
|
+
let i = _t[r];
|
|
355
355
|
if (i === void 0) throw y.BuiltIn.Num;
|
|
356
356
|
let a = v.getSerialDate(v.getDateParts(n).year, 1, 1), o = (v.getDateParts(a).dow % 7 - i + 7) % 7, s = Math.floor(n) - a + 1;
|
|
357
357
|
return Math.floor((s + o - 1) / 7) + 1;
|
|
358
358
|
}
|
|
359
|
-
function
|
|
360
|
-
return
|
|
359
|
+
function mt(e, t, n) {
|
|
360
|
+
return ht(e, t, 1, n);
|
|
361
361
|
}
|
|
362
|
-
function
|
|
363
|
-
let i =
|
|
362
|
+
function ht(e, t, n = 1, r) {
|
|
363
|
+
let i = k(j(e, A)), a = Math.floor(j(t, Ke));
|
|
364
|
+
if (a === 0) return i;
|
|
364
365
|
if (y.isError(n)) throw y.BuiltIn.Num;
|
|
365
|
-
let o =
|
|
366
|
-
if (o.length === 7
|
|
367
|
-
let s =
|
|
366
|
+
let o = at(n);
|
|
367
|
+
if (o.length === 7) throw y.BuiltIn.Value;
|
|
368
|
+
let s = St(r), c = xt(), l = v.getSerialDate(9999, 12, 31), u = a < 0 ? -1 : 1, d = Math.abs(a), f = i;
|
|
368
369
|
for (; d > 0;) {
|
|
369
370
|
if (f += u, f < 0 || f > l) throw y.BuiltIn.Num;
|
|
370
|
-
o.includes(
|
|
371
|
+
o.includes(bt(f, c)) || s.has(f) || d--;
|
|
371
372
|
}
|
|
372
373
|
return f;
|
|
373
374
|
}
|
|
374
|
-
function
|
|
375
|
+
function gt(e) {
|
|
375
376
|
return v.getDateParts(e).year;
|
|
376
377
|
}
|
|
377
|
-
var
|
|
378
|
+
var _t = [
|
|
378
379
|
void 0,
|
|
379
380
|
0,
|
|
380
381
|
1,
|
|
@@ -393,7 +394,7 @@ var vt = [
|
|
|
393
394
|
5,
|
|
394
395
|
6,
|
|
395
396
|
0
|
|
396
|
-
],
|
|
397
|
+
], vt = [
|
|
397
398
|
void 0,
|
|
398
399
|
[
|
|
399
400
|
1,
|
|
@@ -492,7 +493,7 @@ var vt = [
|
|
|
492
493
|
6,
|
|
493
494
|
7
|
|
494
495
|
]
|
|
495
|
-
],
|
|
496
|
+
], yt = [
|
|
496
497
|
void 0,
|
|
497
498
|
[6, 0],
|
|
498
499
|
[0, 1],
|
|
@@ -512,24 +513,28 @@ var vt = [
|
|
|
512
513
|
[5],
|
|
513
514
|
[6]
|
|
514
515
|
];
|
|
515
|
-
function
|
|
516
|
+
function bt(e, t) {
|
|
516
517
|
return (t + Math.floor(e)) % 7;
|
|
517
518
|
}
|
|
518
|
-
function
|
|
519
|
+
function xt() {
|
|
519
520
|
return v.getDateParts(0).dow % 7;
|
|
520
521
|
}
|
|
521
|
-
function
|
|
522
|
+
function St(e) {
|
|
522
523
|
let t = /* @__PURE__ */ new Set();
|
|
523
524
|
for (let n = 0; n < (e?.length ?? 0); n++) {
|
|
524
525
|
let r = e[n];
|
|
525
|
-
r != null && t.add(
|
|
526
|
+
r != null && t.add(k(A(r)));
|
|
526
527
|
}
|
|
527
528
|
return t;
|
|
528
529
|
}
|
|
529
|
-
function
|
|
530
|
-
return Math.floor(e +
|
|
530
|
+
function Ct(e) {
|
|
531
|
+
return Math.floor(e + wt);
|
|
532
|
+
}
|
|
533
|
+
var wt = 1 / 4194304;
|
|
534
|
+
function Tt(e) {
|
|
535
|
+
return e >= 0 ? Math.floor(e + wt) : Math.trunc(e);
|
|
531
536
|
}
|
|
532
|
-
var
|
|
537
|
+
var Et = ve((e) => {
|
|
533
538
|
var t = function(e) {
|
|
534
539
|
e.version = "1.0.2";
|
|
535
540
|
var t = Math;
|
|
@@ -789,12 +794,12 @@ var Tt = 1 / 4194304, Et = ye((e) => {
|
|
|
789
794
|
var e = {};
|
|
790
795
|
return t(e), e;
|
|
791
796
|
}) : t({}) : t({});
|
|
792
|
-
}), Dt =
|
|
797
|
+
}), Dt = w({
|
|
793
798
|
BESSELI: () => jt,
|
|
794
799
|
BESSELJ: () => Mt,
|
|
795
800
|
BESSELK: () => Nt,
|
|
796
801
|
BESSELY: () => Pt
|
|
797
|
-
}), Ot =
|
|
802
|
+
}), Ot = ye(Et(), 1), kt = 2 ** 27 + 1, M = (e) => {
|
|
798
803
|
if (y.isError(e)) throw e;
|
|
799
804
|
if (e === void 0) throw y.BuiltIn.NA;
|
|
800
805
|
return e === null ? 0 : v.parseAsNumber(e);
|
|
@@ -803,33 +808,33 @@ var Tt = 1 / 4194304, Et = ye((e) => {
|
|
|
803
808
|
return t < 0 || t > 1e7 ? NaN : t;
|
|
804
809
|
};
|
|
805
810
|
function jt(e, t) {
|
|
806
|
-
let n =
|
|
811
|
+
let n = M(e), r = At(M(t));
|
|
807
812
|
if (Number.isNaN(r)) return NaN;
|
|
808
813
|
let i = Ot.default.besseli(Math.abs(n), r);
|
|
809
814
|
return n < 0 && r % 2 == 1 ? -i : i;
|
|
810
815
|
}
|
|
811
816
|
function Mt(e, t) {
|
|
812
|
-
let n =
|
|
817
|
+
let n = M(e), r = At(M(t));
|
|
813
818
|
return Number.isNaN(r) || Math.abs(n) > kt ? NaN : Ot.default.besselj(n, r);
|
|
814
819
|
}
|
|
815
820
|
function Nt(e, t) {
|
|
816
|
-
let n =
|
|
821
|
+
let n = M(e), r = At(M(t));
|
|
817
822
|
if (Number.isNaN(r)) return NaN;
|
|
818
823
|
if (!(n > 0)) return Ot.default.besselk(n, r);
|
|
819
|
-
let i =
|
|
824
|
+
let i = T(Ot.default.besselk(n, 0));
|
|
820
825
|
if (r === 0) return i;
|
|
821
|
-
let a =
|
|
826
|
+
let a = T(Ot.default.besselk(n, 1)), o = 2 / n;
|
|
822
827
|
for (let e = 1; e < r; e++) {
|
|
823
|
-
let t =
|
|
828
|
+
let t = T(a * e * o) + i;
|
|
824
829
|
i = a, a = t;
|
|
825
830
|
}
|
|
826
831
|
return a;
|
|
827
832
|
}
|
|
828
833
|
function Pt(e, t) {
|
|
829
|
-
let n =
|
|
834
|
+
let n = M(e), r = At(M(t));
|
|
830
835
|
return Number.isNaN(r) || Math.abs(n) > kt ? NaN : Ot.default.bessely(n, r);
|
|
831
836
|
}
|
|
832
|
-
var Ft =
|
|
837
|
+
var Ft = w({
|
|
833
838
|
BIN2DEC: () => It,
|
|
834
839
|
BIN2HEX: () => Lt,
|
|
835
840
|
BIN2OCT: () => Rt,
|
|
@@ -849,12 +854,12 @@ var Ft = C({
|
|
|
849
854
|
OCT2HEX: () => Qt
|
|
850
855
|
});
|
|
851
856
|
function It(e) {
|
|
852
|
-
let t =
|
|
857
|
+
let t = P(e, $t);
|
|
853
858
|
return t.length === 10 && t.substring(0, 1) === "1" ? parseInt(t.substring(1), 2) + on : parseInt(t, 2);
|
|
854
859
|
}
|
|
855
860
|
function Lt(e, t) {
|
|
856
|
-
t =
|
|
857
|
-
let n =
|
|
861
|
+
t = N(t);
|
|
862
|
+
let n = P(e, $t);
|
|
858
863
|
if (e = parseInt(n, 2), n.length === 10 && n.substring(0, 1) === "1") return (parseInt(n.substring(1), 2) + 0xfffffffe00).toString(16).toUpperCase();
|
|
859
864
|
let r = e.toString(16);
|
|
860
865
|
if (t === void 0) return r.toUpperCase();
|
|
@@ -863,8 +868,8 @@ function Lt(e, t) {
|
|
|
863
868
|
throw y.BuiltIn.Num;
|
|
864
869
|
}
|
|
865
870
|
function Rt(e, t) {
|
|
866
|
-
t =
|
|
867
|
-
let n =
|
|
871
|
+
t = N(t);
|
|
872
|
+
let n = P(e, $t);
|
|
868
873
|
if (e = parseInt(n, 2), n.length === 10 && n.substring(0, 1) === "1") return (parseInt(n.substring(1), 2) + 1073741312).toString(8);
|
|
869
874
|
let r = e.toString(8);
|
|
870
875
|
if (t === void 0) return r.toUpperCase();
|
|
@@ -873,10 +878,10 @@ function Rt(e, t) {
|
|
|
873
878
|
throw y.BuiltIn.Num;
|
|
874
879
|
}
|
|
875
880
|
function zt(e, t) {
|
|
876
|
-
return e =
|
|
881
|
+
return e = F(e), t = F(t), un(e, t, (e, t) => e & t);
|
|
877
882
|
}
|
|
878
883
|
function Bt(e, t) {
|
|
879
|
-
e =
|
|
884
|
+
e = F(e);
|
|
880
885
|
let n = ln(t);
|
|
881
886
|
if (e === 0) return 0;
|
|
882
887
|
if (Math.abs(n) > 53) return NaN;
|
|
@@ -886,16 +891,16 @@ function Bt(e, t) {
|
|
|
886
891
|
return r > BigInt(cn) ? NaN : Number(r);
|
|
887
892
|
}
|
|
888
893
|
function Vt(e, t) {
|
|
889
|
-
return e =
|
|
894
|
+
return e = F(e), t = F(t), un(e, t, (e, t) => e | t);
|
|
890
895
|
}
|
|
891
896
|
function Ht(e, t) {
|
|
892
|
-
return Bt(e =
|
|
897
|
+
return Bt(e = F(e), -ln(t));
|
|
893
898
|
}
|
|
894
899
|
function Ut(e, t) {
|
|
895
|
-
return e =
|
|
900
|
+
return e = F(e), t = F(t), un(e, t, (e, t) => e ^ t);
|
|
896
901
|
}
|
|
897
902
|
function Wt(e, t) {
|
|
898
|
-
if (t =
|
|
903
|
+
if (t = N(t), (e = sn(e)) < on || e > an) throw y.BuiltIn.Num;
|
|
899
904
|
if (e < 0) return "1" + "0".repeat(9 - (512 + e).toString(2).length) + (512 + e).toString(2);
|
|
900
905
|
let n = parseInt(e, 10).toString(2);
|
|
901
906
|
if (t === void 0) return n;
|
|
@@ -903,7 +908,7 @@ function Wt(e, t) {
|
|
|
903
908
|
return "0".repeat(t - n.length) + n;
|
|
904
909
|
}
|
|
905
910
|
function Gt(e, t) {
|
|
906
|
-
if (t =
|
|
911
|
+
if (t = N(t), (e = sn(e)) < -549755813888 || e >= 549755813888) throw y.BuiltIn.Num;
|
|
907
912
|
if (e < 0) return (1099511627776 + e).toString(16).toUpperCase();
|
|
908
913
|
let n = parseInt(e, 10).toString(16);
|
|
909
914
|
if (t === void 0) return n.toUpperCase();
|
|
@@ -911,7 +916,7 @@ function Gt(e, t) {
|
|
|
911
916
|
return "0".repeat(t - n.length) + n.toUpperCase();
|
|
912
917
|
}
|
|
913
918
|
function Kt(e, t) {
|
|
914
|
-
if (t =
|
|
919
|
+
if (t = N(t), (e = sn(e)) < -536870912 || e >= 536870912) throw y.BuiltIn.Num;
|
|
915
920
|
if (e < 0) return (e + 1073741824).toString(8);
|
|
916
921
|
let n = parseInt(e, 10).toString(8);
|
|
917
922
|
if (t === void 0) return n.toUpperCase();
|
|
@@ -919,26 +924,26 @@ function Kt(e, t) {
|
|
|
919
924
|
return "0".repeat(t - n.length) + n;
|
|
920
925
|
}
|
|
921
926
|
function qt(e, t) {
|
|
922
|
-
t =
|
|
923
|
-
let n =
|
|
927
|
+
t = N(t);
|
|
928
|
+
let n = P(e, tn), r = n.length === 10 && n.substring(0, 1).toLowerCase() === "f", i = r ? parseInt(n, 16) - 1099511627776 : parseInt(n, 16);
|
|
924
929
|
if (i < on || i > an) return NaN;
|
|
925
930
|
if (r) return "1" + "0".repeat(9 - (i + 512).toString(2).length) + (i + 512).toString(2);
|
|
926
931
|
let a = i.toString(2);
|
|
927
932
|
return t === void 0 ? a : (t = Math.trunc(t)) <= 0 || t < a.length ? NaN : "0".repeat(t - a.length) + a;
|
|
928
933
|
}
|
|
929
934
|
function Jt(e) {
|
|
930
|
-
let t = parseInt(
|
|
935
|
+
let t = parseInt(P(e, tn), 16);
|
|
931
936
|
return t >= 549755813888 ? t - 1099511627776 : t;
|
|
932
937
|
}
|
|
933
938
|
function Yt(e, t) {
|
|
934
|
-
t =
|
|
935
|
-
let n = Jt(
|
|
939
|
+
t = N(t);
|
|
940
|
+
let n = Jt(P(e, tn));
|
|
936
941
|
if (n > nn || n < rn) throw y.BuiltIn.Num;
|
|
937
942
|
return Kt(n, t);
|
|
938
943
|
}
|
|
939
944
|
function Xt(e, t) {
|
|
940
|
-
t =
|
|
941
|
-
let n =
|
|
945
|
+
t = N(t);
|
|
946
|
+
let n = P(e, en);
|
|
942
947
|
if (t !== void 0 && t > 10 || t !== void 0 && t < 0) throw y.BuiltIn.Num;
|
|
943
948
|
t = t === void 0 ? NaN : Math.trunc(t);
|
|
944
949
|
let r = n.length === 10 && n.substring(0, 1) === "7", i = Zt(n);
|
|
@@ -950,17 +955,17 @@ function Xt(e, t) {
|
|
|
950
955
|
return "0".repeat(t - a.length) + a;
|
|
951
956
|
}
|
|
952
957
|
function Zt(e) {
|
|
953
|
-
let t = parseInt(
|
|
958
|
+
let t = parseInt(P(e, en), 8);
|
|
954
959
|
return t >= 536870912 ? t - 1073741824 : t;
|
|
955
960
|
}
|
|
956
961
|
function Qt(e, t) {
|
|
957
|
-
t =
|
|
958
|
-
let n =
|
|
962
|
+
t = N(t);
|
|
963
|
+
let n = P(e, en);
|
|
959
964
|
if ((t = t === void 0 ? NaN : Math.trunc(t)) < 0 || t > 10) return NaN;
|
|
960
965
|
let r = Zt(n), i = Gt(r);
|
|
961
966
|
return t === 0 || r < 0 ? i : t < i.length ? NaN : "0".repeat(t - i.length) + i;
|
|
962
967
|
}
|
|
963
|
-
var $t = /^[01]{1,10}$/, en = /^[0-7]{1,10}$/, tn = /^[0-9a-fA-F]{1,10}$/, nn = 536870911, rn = -536870912, an = 511, on = -512,
|
|
968
|
+
var $t = /^[01]{1,10}$/, en = /^[0-7]{1,10}$/, tn = /^[0-9a-fA-F]{1,10}$/, nn = 536870911, rn = -536870912, an = 511, on = -512, N = (e) => {
|
|
964
969
|
if (e === void 0) return;
|
|
965
970
|
if (typeof e == "boolean") throw y.BuiltIn.Value;
|
|
966
971
|
let t = Math.trunc(e === null ? 0 : v.parseAsNumber(e));
|
|
@@ -972,7 +977,7 @@ var $t = /^[01]{1,10}$/, en = /^[0-7]{1,10}$/, tn = /^[0-9a-fA-F]{1,10}$/, nn =
|
|
|
972
977
|
if (e === null) return 0;
|
|
973
978
|
if (typeof e == "boolean") throw y.BuiltIn.Value;
|
|
974
979
|
return Math.trunc(v.parseAsNumber(e));
|
|
975
|
-
},
|
|
980
|
+
}, P = (e, t) => {
|
|
976
981
|
if (y.isError(e)) throw e;
|
|
977
982
|
if (e === void 0) throw y.BuiltIn.NA;
|
|
978
983
|
if (e === null) return "0";
|
|
@@ -982,7 +987,7 @@ var $t = /^[01]{1,10}$/, en = /^[0-7]{1,10}$/, tn = /^[0-9a-fA-F]{1,10}$/, nn =
|
|
|
982
987
|
if (n === "") return "0";
|
|
983
988
|
if (!t.test(n)) throw y.BuiltIn.Num;
|
|
984
989
|
return n;
|
|
985
|
-
}, cn = 0xffffffffffff,
|
|
990
|
+
}, cn = 0xffffffffffff, F = (e) => {
|
|
986
991
|
if (y.isError(e)) throw e;
|
|
987
992
|
let t = typeof e;
|
|
988
993
|
if (t === "boolean") return +!!e;
|
|
@@ -998,7 +1003,7 @@ var $t = /^[01]{1,10}$/, en = /^[0-7]{1,10}$/, tn = /^[0-9a-fA-F]{1,10}$/, nn =
|
|
|
998
1003
|
}, ln = (e) => {
|
|
999
1004
|
if (y.isError(e)) throw e;
|
|
1000
1005
|
return e == null ? 0 : typeof e == "boolean" ? +!!e : Math.trunc(v.parseAsNumber(e));
|
|
1001
|
-
}, un = (e, t, n) => Number(n(BigInt(e), BigInt(t))), dn =
|
|
1006
|
+
}, un = (e, t, n) => Number(n(BigInt(e), BigInt(t))), dn = w({ CONVERT: () => fn });
|
|
1002
1007
|
function fn(e, t, n) {
|
|
1003
1008
|
e = e == null ? 0 : v.parseAsNumber(e), t = pn(t), n = pn(n);
|
|
1004
1009
|
let r = xn(t), i = xn(n);
|
|
@@ -2173,7 +2178,7 @@ function xn(e) {
|
|
|
2173
2178
|
}
|
|
2174
2179
|
return null;
|
|
2175
2180
|
}
|
|
2176
|
-
var Sn =
|
|
2181
|
+
var Sn = w({
|
|
2177
2182
|
DELTA: () => Cn,
|
|
2178
2183
|
GESTEP: () => wn
|
|
2179
2184
|
});
|
|
@@ -2203,7 +2208,7 @@ var En = [
|
|
|
2203
2208
|
-26190838401581408e-21,
|
|
2204
2209
|
36899182659531625e-22
|
|
2205
2210
|
];
|
|
2206
|
-
function
|
|
2211
|
+
function I(e) {
|
|
2207
2212
|
let t = e, n = e + 5.2421875;
|
|
2208
2213
|
n = (e + .5) * Math.log(n) - n;
|
|
2209
2214
|
let r = .9999999999999971;
|
|
@@ -2261,7 +2266,7 @@ function An(e) {
|
|
|
2261
2266
|
}
|
|
2262
2267
|
var jn = (e, t) => {
|
|
2263
2268
|
let n = e < t ? e : t, r = e < t ? t : e;
|
|
2264
|
-
return r < 30 ?
|
|
2269
|
+
return r < 30 ? I(e) + I(t) - I(e + t) : I(n) - function(e, t) {
|
|
2265
2270
|
return t * Math.log(e) + (e + t - .5) * Math.log1p(t / e) - t + An(e + t) - An(e);
|
|
2266
2271
|
}(r, n);
|
|
2267
2272
|
}, Mn = [
|
|
@@ -2331,7 +2336,7 @@ function Bn(e, t, n) {
|
|
|
2331
2336
|
}(e, t);
|
|
2332
2337
|
return n ? r : 1 - r;
|
|
2333
2338
|
}
|
|
2334
|
-
let r =
|
|
2339
|
+
let r = I(e), i = -~(8.5 * Math.log(e >= 1 ? e : 1 / e) + .4 * e + 17);
|
|
2335
2340
|
if (t < e + 1) {
|
|
2336
2341
|
let a = e, o = 1 / e, s = o;
|
|
2337
2342
|
for (let e = 1; e <= i; e++) {
|
|
@@ -2350,7 +2355,7 @@ function Bn(e, t, n) {
|
|
|
2350
2355
|
return n ? l : 1 - l;
|
|
2351
2356
|
}
|
|
2352
2357
|
function Vn(e, t) {
|
|
2353
|
-
let n = 4 * 2 ** -52, r = t - 1, i =
|
|
2358
|
+
let n = 4 * 2 ** -52, r = t - 1, i = I(t), a, o = 0, s = 0;
|
|
2354
2359
|
if (e >= 1) return 1 / 0;
|
|
2355
2360
|
if (e <= 0) return 0;
|
|
2356
2361
|
if (t > 1) {
|
|
@@ -2392,7 +2397,7 @@ function Gn(e, t, n, r) {
|
|
|
2392
2397
|
return Math.exp(n * Math.log(e) + r * i - jn(n, r));
|
|
2393
2398
|
}
|
|
2394
2399
|
function Kn(e, t, n) {
|
|
2395
|
-
if (!Number.isFinite(
|
|
2400
|
+
if (!Number.isFinite(I(t)) || !Number.isFinite(I(n))) return NaN;
|
|
2396
2401
|
let r = 4 * 2 ** -52, i = t - 1, a = n - 1, o, s;
|
|
2397
2402
|
if (e <= 0) return 0;
|
|
2398
2403
|
if (e >= 1) return 1;
|
|
@@ -2417,7 +2422,7 @@ function Kn(e, t, n) {
|
|
|
2417
2422
|
}
|
|
2418
2423
|
return o;
|
|
2419
2424
|
}
|
|
2420
|
-
var qn =
|
|
2425
|
+
var qn = w({
|
|
2421
2426
|
ERF: () => Yn,
|
|
2422
2427
|
ERFC: () => Zn,
|
|
2423
2428
|
ERFC_PRECISE: () => Qn,
|
|
@@ -2443,7 +2448,7 @@ function Qn(e) {
|
|
|
2443
2448
|
if (e === void 0) throw y.BuiltIn.NA;
|
|
2444
2449
|
return Fn(Jn(e));
|
|
2445
2450
|
}
|
|
2446
|
-
var $n = Math.PI,
|
|
2451
|
+
var $n = Math.PI, L = 2 ** 27, er = 134217729, tr = (e, t) => {
|
|
2447
2452
|
let n = e + t, r = n - e;
|
|
2448
2453
|
return [n, e - (n - r) + (t - r)];
|
|
2449
2454
|
}, nr = (e) => {
|
|
@@ -2457,7 +2462,7 @@ var $n = Math.PI, I = 2 ** 27, er = 134217729, tr = (e, t) => {
|
|
|
2457
2462
|
c
|
|
2458
2463
|
];
|
|
2459
2464
|
}, rr = (e, t) => Math.sin(e) + Math.cos(e) * t, ir = (e, t) => Math.cos(e) - Math.sin(e) * t;
|
|
2460
|
-
function
|
|
2465
|
+
function R(e) {
|
|
2461
2466
|
let [t, n, r] = nr(e);
|
|
2462
2467
|
switch (t) {
|
|
2463
2468
|
case 0: return rr(n, r);
|
|
@@ -2466,7 +2471,7 @@ function L(e) {
|
|
|
2466
2471
|
default: return -ir(n, r);
|
|
2467
2472
|
}
|
|
2468
2473
|
}
|
|
2469
|
-
function
|
|
2474
|
+
function z(e) {
|
|
2470
2475
|
let [t, n, r] = nr(e);
|
|
2471
2476
|
switch (t) {
|
|
2472
2477
|
case 0: return ir(n, r);
|
|
@@ -2475,8 +2480,8 @@ function R(e) {
|
|
|
2475
2480
|
default: return rr(n, r);
|
|
2476
2481
|
}
|
|
2477
2482
|
}
|
|
2478
|
-
var ar = (e) =>
|
|
2479
|
-
COMPLEX: () =>
|
|
2483
|
+
var ar = (e) => R(e) / z(e), or = w({
|
|
2484
|
+
COMPLEX: () => B,
|
|
2480
2485
|
IMABS: () => sr,
|
|
2481
2486
|
IMAGINARY: () => cr,
|
|
2482
2487
|
IMARGUMENT: () => lr,
|
|
@@ -2506,7 +2511,7 @@ var ar = (e) => L(e) / R(e), or = C({
|
|
|
2506
2511
|
IMTAN: () => Jr,
|
|
2507
2512
|
IMTANH: () => Yr
|
|
2508
2513
|
});
|
|
2509
|
-
function
|
|
2514
|
+
function B(e, t, n = "i") {
|
|
2510
2515
|
if (y.isError(n)) throw n;
|
|
2511
2516
|
if (n ||= "i", n !== "i" && n !== "j") throw y.BuiltIn.Value;
|
|
2512
2517
|
let r = Tr(e), i = Tr(t);
|
|
@@ -2517,14 +2522,14 @@ function z(e, t, n = "i") {
|
|
|
2517
2522
|
return i === 1 ? v.toText(r) + a + n : i === -1 ? v.toText(r) + a + "-" + n : v.toText(r) + a + v.toText(i) + n;
|
|
2518
2523
|
}
|
|
2519
2524
|
function sr(e) {
|
|
2520
|
-
let { real: t, im: n } =
|
|
2525
|
+
let { real: t, im: n } = H(e);
|
|
2521
2526
|
return Math.hypot(t, n);
|
|
2522
2527
|
}
|
|
2523
2528
|
function cr(e) {
|
|
2524
|
-
return
|
|
2529
|
+
return H(e).im;
|
|
2525
2530
|
}
|
|
2526
2531
|
function lr(e) {
|
|
2527
|
-
let { real: t, im: n } =
|
|
2532
|
+
let { real: t, im: n } = H(e);
|
|
2528
2533
|
if (t === 0 && n === 0) throw y.BuiltIn.Div0;
|
|
2529
2534
|
return ur(t, n);
|
|
2530
2535
|
}
|
|
@@ -2534,21 +2539,21 @@ var ur = (e, t) => e === 0 && t === 0 ? 0 : e === 0 ? t > 0 ? Math.PI / 2 : -Mat
|
|
|
2534
2539
|
return n;
|
|
2535
2540
|
};
|
|
2536
2541
|
function fr(e) {
|
|
2537
|
-
let { real: t, im: n, unit: r } =
|
|
2538
|
-
return n === 0 ? v.toText(t) :
|
|
2542
|
+
let { real: t, im: n, unit: r } = H(e);
|
|
2543
|
+
return n === 0 ? v.toText(t) : B(t, -n, r);
|
|
2539
2544
|
}
|
|
2540
2545
|
var pr = (e) => (Math.exp(e) + Math.exp(-e)) / 2, mr = (e) => (Math.exp(e) - Math.exp(-e)) / 2, hr = (e, t) => ({
|
|
2541
|
-
real:
|
|
2542
|
-
im: -
|
|
2546
|
+
real: z(e) * pr(t),
|
|
2547
|
+
im: -R(e) * mr(t)
|
|
2543
2548
|
}), gr = (e, t) => ({
|
|
2544
|
-
real:
|
|
2545
|
-
im:
|
|
2549
|
+
real: R(e) * pr(t),
|
|
2550
|
+
im: z(e) * mr(t)
|
|
2546
2551
|
}), _r = (e, t) => ({
|
|
2547
|
-
real:
|
|
2548
|
-
im:
|
|
2552
|
+
real: z(t) * pr(e),
|
|
2553
|
+
im: R(t) * mr(e)
|
|
2549
2554
|
}), vr = (e, t) => ({
|
|
2550
|
-
real:
|
|
2551
|
-
im:
|
|
2555
|
+
real: z(t) * mr(e),
|
|
2556
|
+
im: R(t) * pr(e)
|
|
2552
2557
|
}), yr = {
|
|
2553
2558
|
real: 1,
|
|
2554
2559
|
im: 0
|
|
@@ -2572,7 +2577,7 @@ var pr = (e) => (Math.exp(e) + Math.exp(-e)) / 2, mr = (e) => (Math.exp(e) - Mat
|
|
|
2572
2577
|
im: (e.im * t.real - e.real * t.im) / n
|
|
2573
2578
|
};
|
|
2574
2579
|
}, xr = (e) => {
|
|
2575
|
-
if (Math.abs(e) >=
|
|
2580
|
+
if (Math.abs(e) >= L) throw y.BuiltIn.Num;
|
|
2576
2581
|
}, Sr = (e, t) => {
|
|
2577
2582
|
let n = Math.tanh(t);
|
|
2578
2583
|
if (Math.abs(n) === 1) return {
|
|
@@ -2580,13 +2585,13 @@ var pr = (e) => (Math.exp(e) + Math.exp(-e)) / 2, mr = (e) => (Math.exp(e) - Mat
|
|
|
2580
2585
|
im: n
|
|
2581
2586
|
};
|
|
2582
2587
|
if (xr(e), t === 0) return {
|
|
2583
|
-
real:
|
|
2588
|
+
real: R(e) / z(e),
|
|
2584
2589
|
im: 0
|
|
2585
2590
|
};
|
|
2586
|
-
let r =
|
|
2591
|
+
let r = z(2 * e) + Math.cosh(2 * t);
|
|
2587
2592
|
if (r === 0) throw y.BuiltIn.Num;
|
|
2588
2593
|
return {
|
|
2589
|
-
real:
|
|
2594
|
+
real: R(2 * e) / r,
|
|
2590
2595
|
im: Math.sinh(2 * t) / r
|
|
2591
2596
|
};
|
|
2592
2597
|
}, Cr = (e, t) => {
|
|
@@ -2596,26 +2601,26 @@ var pr = (e) => (Math.exp(e) + Math.exp(-e)) / 2, mr = (e) => (Math.exp(e) - Mat
|
|
|
2596
2601
|
im: -n
|
|
2597
2602
|
};
|
|
2598
2603
|
if (t === 0) {
|
|
2599
|
-
if (Math.abs(e) >=
|
|
2604
|
+
if (Math.abs(e) >= L) return {
|
|
2600
2605
|
real: 0,
|
|
2601
2606
|
im: 0
|
|
2602
2607
|
};
|
|
2603
|
-
let t =
|
|
2608
|
+
let t = R(e);
|
|
2604
2609
|
if (t === 0) throw y.BuiltIn.Num;
|
|
2605
2610
|
return {
|
|
2606
|
-
real:
|
|
2611
|
+
real: z(e) / t,
|
|
2607
2612
|
im: 0
|
|
2608
2613
|
};
|
|
2609
2614
|
}
|
|
2610
2615
|
xr(e);
|
|
2611
|
-
let r = Math.cosh(2 * t) -
|
|
2616
|
+
let r = Math.cosh(2 * t) - z(2 * e);
|
|
2612
2617
|
if (r === 0) throw y.BuiltIn.Num;
|
|
2613
2618
|
return {
|
|
2614
|
-
real:
|
|
2619
|
+
real: R(2 * e) / r,
|
|
2615
2620
|
im: -Math.sinh(2 * t) / r
|
|
2616
2621
|
};
|
|
2617
|
-
},
|
|
2618
|
-
if (Number.isFinite(t.real) && Number.isFinite(t.im) && Math.abs(e) >=
|
|
2622
|
+
}, V = (e, t) => {
|
|
2623
|
+
if (Number.isFinite(t.real) && Number.isFinite(t.im) && Math.abs(e) >= L) throw y.BuiltIn.Num;
|
|
2619
2624
|
return t;
|
|
2620
2625
|
}, wr = (e) => {
|
|
2621
2626
|
if (!Number.isFinite(e.real) || !Number.isFinite(e.im)) throw y.BuiltIn.Num;
|
|
@@ -2626,151 +2631,151 @@ var pr = (e) => (Math.exp(e) + Math.exp(-e)) / 2, mr = (e) => (Math.exp(e) - Mat
|
|
|
2626
2631
|
return e === null ? 0 : v.parseAsNumber(e);
|
|
2627
2632
|
};
|
|
2628
2633
|
function Er(e) {
|
|
2629
|
-
let { real: t, im: n, unit: r } =
|
|
2630
|
-
return
|
|
2634
|
+
let { real: t, im: n, unit: r } = H(e), i = wr(V(t, hr(t, n)));
|
|
2635
|
+
return B(i.real, i.im, r);
|
|
2631
2636
|
}
|
|
2632
2637
|
function Dr(e) {
|
|
2633
|
-
let { real: t, im: n, unit: r } =
|
|
2634
|
-
return
|
|
2638
|
+
let { real: t, im: n, unit: r } = H(e), i = wr(V(n, _r(t, n)));
|
|
2639
|
+
return B(i.real, i.im, r);
|
|
2635
2640
|
}
|
|
2636
2641
|
function Or(e) {
|
|
2637
|
-
let { real: t, im: n, unit: r } =
|
|
2638
|
-
return
|
|
2642
|
+
let { real: t, im: n, unit: r } = H(e), i = Cr(t, n);
|
|
2643
|
+
return B(i.real, i.im, r);
|
|
2639
2644
|
}
|
|
2640
2645
|
function kr(e) {
|
|
2641
|
-
let { real: t, im: n, unit: r } =
|
|
2642
|
-
return
|
|
2646
|
+
let { real: t, im: n, unit: r } = H(e), i = br(_r(t, n), vr(t, n));
|
|
2647
|
+
return B(i.real, i.im, r);
|
|
2643
2648
|
}
|
|
2644
2649
|
function Ar(e) {
|
|
2645
|
-
let { real: t, im: n, unit: r } =
|
|
2646
|
-
return
|
|
2650
|
+
let { real: t, im: n, unit: r } = H(e), i = br(yr, V(t, gr(t, n)));
|
|
2651
|
+
return B(i.real, i.im, r);
|
|
2647
2652
|
}
|
|
2648
2653
|
function jr(e) {
|
|
2649
|
-
let { real: t, im: n, unit: r } =
|
|
2650
|
-
return
|
|
2654
|
+
let { real: t, im: n, unit: r } = H(e), i = br(yr, V(n, vr(t, n)));
|
|
2655
|
+
return B(i.real, i.im, r);
|
|
2651
2656
|
}
|
|
2652
2657
|
function Mr(e, t) {
|
|
2653
|
-
let n =
|
|
2658
|
+
let n = H(ti(e)), r = n.real, i = n.im, a = n.unit, o = H(ti(t)), s = o.real, c = o.im, l = o.unit;
|
|
2654
2659
|
if (s === 0 && c === 0 || a !== l) throw y.BuiltIn.Num;
|
|
2655
2660
|
let u = a, d = s ** 2 + c ** 2, f = wr({
|
|
2656
2661
|
real: (r * s + i * c) / d,
|
|
2657
2662
|
im: (i * s - r * c) / d
|
|
2658
2663
|
});
|
|
2659
|
-
return
|
|
2664
|
+
return B(f.real, f.im, u);
|
|
2660
2665
|
}
|
|
2661
2666
|
function Nr(e) {
|
|
2662
|
-
let { real: t, im: n, unit: r } =
|
|
2667
|
+
let { real: t, im: n, unit: r } = H(e), i = Math.exp(t);
|
|
2663
2668
|
if (!Number.isFinite(i)) {
|
|
2664
2669
|
if (n === 0) throw y.BuiltIn.Num;
|
|
2665
2670
|
i = Number.MAX_VALUE;
|
|
2666
2671
|
}
|
|
2667
|
-
let a = wr(
|
|
2668
|
-
real: i *
|
|
2669
|
-
im: i *
|
|
2672
|
+
let a = wr(V(n, {
|
|
2673
|
+
real: i * z(n),
|
|
2674
|
+
im: i * R(n)
|
|
2670
2675
|
}));
|
|
2671
|
-
return
|
|
2676
|
+
return B(a.real, a.im, r);
|
|
2672
2677
|
}
|
|
2673
2678
|
function Pr(e) {
|
|
2674
|
-
let { real: t, im: n, unit: r } =
|
|
2675
|
-
return
|
|
2679
|
+
let { real: t, im: n, unit: r } = H(e);
|
|
2680
|
+
return B(dr(t, n), ur(t, n), r);
|
|
2676
2681
|
}
|
|
2677
2682
|
function Fr(e, t = 10) {
|
|
2678
2683
|
let n = Pr(e);
|
|
2679
2684
|
return y.isError(n) ? n : t <= 0 || t === 1 ? NaN : Mr(n, Math.log(t));
|
|
2680
2685
|
}
|
|
2681
2686
|
function Ir(e) {
|
|
2682
|
-
let { real: t, im: n, unit: r } =
|
|
2683
|
-
return
|
|
2687
|
+
let { real: t, im: n, unit: r } = H(e);
|
|
2688
|
+
return B(dr(t, n) / Math.LN10, ur(t, n) / Math.LN10, r);
|
|
2684
2689
|
}
|
|
2685
2690
|
function Lr(e) {
|
|
2686
|
-
let { real: t, im: n, unit: r } =
|
|
2687
|
-
return
|
|
2691
|
+
let { real: t, im: n, unit: r } = H(e);
|
|
2692
|
+
return B(dr(t, n) / Math.LN2, ur(t, n) / Math.LN2, r);
|
|
2688
2693
|
}
|
|
2689
2694
|
function Rr(e, t) {
|
|
2690
|
-
let { real: n, im: r, unit: i } =
|
|
2695
|
+
let { real: n, im: r, unit: i } = H(ti(e)), a = v.parseAsNumber(ti(t) ?? 0), o = Math.sqrt(n * n + r * r);
|
|
2691
2696
|
if (n === 0 && r === 0) {
|
|
2692
|
-
if (a > 0) return
|
|
2697
|
+
if (a > 0) return B(0, 0, i);
|
|
2693
2698
|
throw y.BuiltIn.Num;
|
|
2694
2699
|
}
|
|
2695
2700
|
let s = a * Math.log(o);
|
|
2696
2701
|
if (!Number.isFinite(s)) throw y.BuiltIn.Num;
|
|
2697
2702
|
let c = o ** +a;
|
|
2698
2703
|
if (!Number.isFinite(c)) throw y.BuiltIn.Num;
|
|
2699
|
-
let l = a * ur(n, r), u =
|
|
2700
|
-
real: c *
|
|
2701
|
-
im: c *
|
|
2704
|
+
let l = a * ur(n, r), u = V(l, {
|
|
2705
|
+
real: c * z(l),
|
|
2706
|
+
im: c * R(l)
|
|
2702
2707
|
});
|
|
2703
|
-
return
|
|
2708
|
+
return B(u.real, u.im, i);
|
|
2704
2709
|
}
|
|
2705
2710
|
function zr(e) {
|
|
2706
2711
|
let t = e.length;
|
|
2707
|
-
if (t === 0) return
|
|
2708
|
-
let n =
|
|
2712
|
+
if (t === 0) return B(0, 0, "i");
|
|
2713
|
+
let n = H(e[0]), r = B(n.real, n.im, n.unit);
|
|
2709
2714
|
for (let n = 1; n < t; n++) {
|
|
2710
|
-
let t = e[n], i =
|
|
2715
|
+
let t = e[n], i = H(r), a = H(t), o = i.unit;
|
|
2711
2716
|
if (o !== a.unit) throw y.BuiltIn.Value;
|
|
2712
2717
|
let s = i.real, c = i.im, l = a.real, u = a.im, d = {
|
|
2713
2718
|
real: s * l - c * u,
|
|
2714
2719
|
im: s * u + c * l
|
|
2715
2720
|
};
|
|
2716
2721
|
if (!Number.isFinite(d.real) || !Number.isFinite(d.im)) throw y.BuiltIn.Value;
|
|
2717
|
-
r =
|
|
2722
|
+
r = B(d.real, d.im, o);
|
|
2718
2723
|
}
|
|
2719
2724
|
return r;
|
|
2720
2725
|
}
|
|
2721
2726
|
function Br(e) {
|
|
2722
|
-
return
|
|
2727
|
+
return H(e).real;
|
|
2723
2728
|
}
|
|
2724
2729
|
function Vr(e) {
|
|
2725
|
-
let { real: t, im: n, unit: r } =
|
|
2726
|
-
return
|
|
2730
|
+
let { real: t, im: n, unit: r } = H(e), i = br(yr, V(t, hr(t, n)));
|
|
2731
|
+
return B(i.real, i.im, r);
|
|
2727
2732
|
}
|
|
2728
2733
|
function Hr(e) {
|
|
2729
|
-
let { real: t, im: n, unit: r } =
|
|
2730
|
-
return
|
|
2734
|
+
let { real: t, im: n, unit: r } = H(e), i = br(yr, V(n, _r(t, n)));
|
|
2735
|
+
return B(i.real, i.im, r);
|
|
2731
2736
|
}
|
|
2732
2737
|
function Ur(e) {
|
|
2733
|
-
let { real: t, im: n, unit: r } =
|
|
2734
|
-
return
|
|
2738
|
+
let { real: t, im: n, unit: r } = H(e), i = wr(V(t, gr(t, n)));
|
|
2739
|
+
return B(i.real, i.im, r);
|
|
2735
2740
|
}
|
|
2736
2741
|
function Wr(e) {
|
|
2737
|
-
let { real: t, im: n, unit: r } =
|
|
2738
|
-
return
|
|
2742
|
+
let { real: t, im: n, unit: r } = H(e), i = wr(V(n, vr(t, n)));
|
|
2743
|
+
return B(i.real, i.im, r);
|
|
2739
2744
|
}
|
|
2740
2745
|
function Gr(e) {
|
|
2741
|
-
let { real: t, im: n, unit: r } =
|
|
2746
|
+
let { real: t, im: n, unit: r } = H(e), i = Math.sqrt(Math.sqrt(t * t + n * n));
|
|
2742
2747
|
if (!Number.isFinite(i)) throw y.BuiltIn.Num;
|
|
2743
2748
|
let a = ur(t, n) / 2;
|
|
2744
|
-
return
|
|
2749
|
+
return B(i * z(a), i * R(a), r);
|
|
2745
2750
|
}
|
|
2746
2751
|
function Kr(e, t) {
|
|
2747
|
-
let n =
|
|
2752
|
+
let n = H(ti(e)), r = n.real, i = n.im, a = n.unit, o = H(ti(t)), s = o.real, c = o.im;
|
|
2748
2753
|
if (a !== o.unit) throw y.BuiltIn.Num;
|
|
2749
|
-
return
|
|
2754
|
+
return B(r - s, i - c, a);
|
|
2750
2755
|
}
|
|
2751
2756
|
function qr(e) {
|
|
2752
2757
|
let t, n = 0, r = 0, i = e.length;
|
|
2753
2758
|
for (let a = 0; a < i; a++) {
|
|
2754
|
-
let i = e[a], { real: o, im: s, unit: c } =
|
|
2759
|
+
let i = e[a], { real: o, im: s, unit: c } = H(i);
|
|
2755
2760
|
if (t ||= c, t !== c) throw y.BuiltIn.Value;
|
|
2756
2761
|
n += o, r += s;
|
|
2757
2762
|
}
|
|
2758
|
-
return
|
|
2763
|
+
return B(n, r, t);
|
|
2759
2764
|
}
|
|
2760
2765
|
function Jr(e) {
|
|
2761
|
-
let { real: t, im: n, unit: r } =
|
|
2762
|
-
return
|
|
2766
|
+
let { real: t, im: n, unit: r } = H(e), i = Sr(t, n);
|
|
2767
|
+
return B(i.real, i.im, r);
|
|
2763
2768
|
}
|
|
2764
2769
|
function Yr(e) {
|
|
2765
|
-
let { real: t, im: n, unit: r } =
|
|
2766
|
-
return
|
|
2770
|
+
let { real: t, im: n, unit: r } = H(e), i = br(vr(t, n), _r(t, n));
|
|
2771
|
+
return B(i.real, i.im, r);
|
|
2767
2772
|
}
|
|
2768
2773
|
var Xr = String.raw`[+-]?\s*[0-9]+[.]?[0-9]*(?:[eE][+-]?[0-9]+)?`, Zr = new RegExp(String.raw`^\s*([+-]?\s*(?:[0-9]+[.]?[0-9]*(?:[eE][+-]?[0-9]+)?)?)\s*([ij])\s*$`), Qr = new RegExp(String.raw`^\s*(${Xr})\s*([+-]\s*(?:[0-9]+[.]?[0-9]*(?:[eE][+-]?[0-9]+)?)?)\s*([ij])\s*$`), $r = /^\s*[+-]?\s*$/, ei = (e) => $r.test(e) ? Number(`${e.replace(/\s+/g, "")}1`) : Number(e.replace(/\s+/g, "")), ti = (e) => {
|
|
2769
2774
|
if (y.isError(e)) throw e;
|
|
2770
2775
|
if (e === void 0) throw y.BuiltIn.NA;
|
|
2771
2776
|
return e;
|
|
2772
2777
|
};
|
|
2773
|
-
function
|
|
2778
|
+
function H(e) {
|
|
2774
2779
|
let t = 0, n = 0, r = "i";
|
|
2775
2780
|
if (typeof e == "number") return {
|
|
2776
2781
|
real: e,
|
|
@@ -2803,7 +2808,7 @@ function V(e) {
|
|
|
2803
2808
|
};
|
|
2804
2809
|
throw y.BuiltIn.Num;
|
|
2805
2810
|
}
|
|
2806
|
-
var ni =
|
|
2811
|
+
var ni = w({
|
|
2807
2812
|
FXHISTORY: () => bi,
|
|
2808
2813
|
STOCKHISTORY: () => _i
|
|
2809
2814
|
}), ri = 864e5, ii = (e) => Math.round(Date.parse(`${e}T00:00:00Z`) / ri) + 25569, ai = (e) => (/* @__PURE__ */ new Date((Math.floor(e) - 25569) * ri)).toISOString().slice(0, 10), oi = [
|
|
@@ -2972,8 +2977,8 @@ function bi(e, t, n, r, i = 1) {
|
|
|
2972
2977
|
}
|
|
2973
2978
|
var xi = (e, t, n = 0) => {
|
|
2974
2979
|
let r = (e) => y.isError(e) ? e : t(e);
|
|
2975
|
-
return v.getArgs().getKindAt(n) ===
|
|
2976
|
-
}, Si =
|
|
2980
|
+
return v.getArgs().getKindAt(n) === C.Reference ? r(e.getValueAt(0, 0)) : v.createRange(e.getRowCount(), e.getColumnCount(), (t, n) => r(e.getValueAt(n.rowIndex, n.colIndex)));
|
|
2981
|
+
}, Si = w({
|
|
2977
2982
|
CELL: () => Ci,
|
|
2978
2983
|
ERROR_TYPE: () => wi,
|
|
2979
2984
|
INFO: () => Ti,
|
|
@@ -3098,10 +3103,10 @@ function Ri(e) {
|
|
|
3098
3103
|
function zi(e) {
|
|
3099
3104
|
if (typeof e == "boolean") return y.BuiltIn.Value;
|
|
3100
3105
|
let t = e == null ? 0 : v.parseAsNumber(e);
|
|
3101
|
-
return Math.trunc(
|
|
3106
|
+
return Math.trunc(D(t)) % 2 == 0;
|
|
3102
3107
|
}
|
|
3103
3108
|
function Bi(e) {
|
|
3104
|
-
return v.getArgs().getKindAt(0) ===
|
|
3109
|
+
return v.getArgs().getKindAt(0) === C.Omitted;
|
|
3105
3110
|
}
|
|
3106
3111
|
function Vi(e) {
|
|
3107
3112
|
if (typeof e != "string") return !1;
|
|
@@ -3122,7 +3127,7 @@ function Ui(e) {
|
|
|
3122
3127
|
return Ii(e);
|
|
3123
3128
|
}
|
|
3124
3129
|
function Wi(e) {
|
|
3125
|
-
if (v.getArgs().getKindAt(0) ===
|
|
3130
|
+
if (v.getArgs().getKindAt(0) === C.Lambda) return y.BuiltIn.Value;
|
|
3126
3131
|
let t = !0 === e?.isIRange ? e : null;
|
|
3127
3132
|
return t ? xi(t, Gi) : Gi(e);
|
|
3128
3133
|
}
|
|
@@ -3154,41 +3159,41 @@ function Yi(e) {
|
|
|
3154
3159
|
return (e = qi(e)).isIReferenceRange ? 1 : y.BuiltIn.NA;
|
|
3155
3160
|
}
|
|
3156
3161
|
var Xi = {
|
|
3157
|
-
[
|
|
3158
|
-
[
|
|
3159
|
-
[
|
|
3160
|
-
[
|
|
3161
|
-
[
|
|
3162
|
-
[
|
|
3163
|
-
[
|
|
3164
|
-
[
|
|
3162
|
+
[C.Number]: 1,
|
|
3163
|
+
[C.Null]: 1,
|
|
3164
|
+
[C.String]: 2,
|
|
3165
|
+
[C.Boolean]: 4,
|
|
3166
|
+
[C.Error]: 16,
|
|
3167
|
+
[C.Array]: 64,
|
|
3168
|
+
[C.RichData]: 128,
|
|
3169
|
+
[C.Lambda]: 128
|
|
3165
3170
|
};
|
|
3166
3171
|
function Zi(e) {
|
|
3167
|
-
if (y.isError(e)) return Xi[
|
|
3172
|
+
if (y.isError(e)) return Xi[C.Error];
|
|
3168
3173
|
let t = v.getArgs().getKindAt(0);
|
|
3169
|
-
if (t ===
|
|
3170
|
-
if (e.getColumnCount() > 1 || e.getRowCount() > 1) return Xi[
|
|
3174
|
+
if (t === C.Reference) {
|
|
3175
|
+
if (e.getColumnCount() > 1 || e.getRowCount() > 1) return Xi[C.Array];
|
|
3171
3176
|
t = function(e) {
|
|
3172
|
-
if (e === null) return
|
|
3173
|
-
if (y.isError(e)) return
|
|
3177
|
+
if (e === null) return C.Null;
|
|
3178
|
+
if (y.isError(e)) return C.Error;
|
|
3174
3179
|
let t = typeof e;
|
|
3175
|
-
if (t === "string") return
|
|
3176
|
-
if (t === "boolean") return
|
|
3180
|
+
if (t === "string") return C.String;
|
|
3181
|
+
if (t === "boolean") return C.Boolean;
|
|
3177
3182
|
if (!0 === e?.isIRichData) {
|
|
3178
3183
|
let t = e.toPrimitive?.();
|
|
3179
3184
|
switch (typeof t) {
|
|
3180
|
-
case "string": return
|
|
3181
|
-
case "number": return
|
|
3182
|
-
case "boolean": return
|
|
3185
|
+
case "string": return C.String;
|
|
3186
|
+
case "number": return C.Number;
|
|
3187
|
+
case "boolean": return C.Boolean;
|
|
3183
3188
|
}
|
|
3184
|
-
return y.isError(t) ?
|
|
3189
|
+
return y.isError(t) ? C.Error : C.RichData;
|
|
3185
3190
|
}
|
|
3186
|
-
return
|
|
3191
|
+
return C.Number;
|
|
3187
3192
|
}(e.getValueAt(0, 0));
|
|
3188
3193
|
}
|
|
3189
3194
|
return Xi[t] ?? 1;
|
|
3190
3195
|
}
|
|
3191
|
-
var Qi = /* @__PURE__ */ RegExp("^([a-zA-Z]+:\\/\\/)?((([a-z\\d]([a-z\\d-]*[a-z\\d])*)\\.)+[a-z]{2,}|((\\d{1,3}\\.){3}\\d{1,3}))(\\:\\d+)?(\\/[-a-z\\d%_.~+]*)*(\\?[;&a-z\\d%_.~+=-]*)?(\\#[-a-z\\d_]*)?$", "i"), $i =
|
|
3196
|
+
var Qi = /* @__PURE__ */ RegExp("^([a-zA-Z]+:\\/\\/)?((([a-z\\d]([a-z\\d-]*[a-z\\d])*)\\.)+[a-z]{2,}|((\\d{1,3}\\.){3}\\d{1,3}))(\\:\\d+)?(\\/[-a-z\\d%_.~+]*)*(\\?[;&a-z\\d%_.~+=-]*)?(\\#[-a-z\\d_]*)?$", "i"), $i = w({
|
|
3192
3197
|
DATESTRING: () => ea,
|
|
3193
3198
|
NUMBERSTRING: () => ta
|
|
3194
3199
|
});
|
|
@@ -3198,11 +3203,11 @@ function ea(e) {
|
|
|
3198
3203
|
function ta(e, t) {
|
|
3199
3204
|
return y.BuiltIn.NA;
|
|
3200
3205
|
}
|
|
3201
|
-
var na =
|
|
3206
|
+
var na = w({ PHONETIC: () => ra });
|
|
3202
3207
|
function ra(e) {
|
|
3203
3208
|
return y.BuiltIn.NA;
|
|
3204
3209
|
}
|
|
3205
|
-
function
|
|
3210
|
+
function U(e, t, n, r, i) {
|
|
3206
3211
|
let a = null;
|
|
3207
3212
|
n && (a = v.getResizedReference(n.getCoords(), e.getRowCount(), e.getColumnCount()));
|
|
3208
3213
|
let o = v.createCriteria(t), s = o(null);
|
|
@@ -3228,7 +3233,7 @@ function H(e, t, n, r, i) {
|
|
|
3228
3233
|
return r;
|
|
3229
3234
|
}(r, e, t)) } : void 0);
|
|
3230
3235
|
}
|
|
3231
|
-
var ia = (e, t) => (e ?? 0) + t,
|
|
3236
|
+
var ia = (e, t) => (e ?? 0) + t, W = (e, t) => e, aa = w({
|
|
3232
3237
|
AND: () => sa,
|
|
3233
3238
|
BYCOL: () => ca,
|
|
3234
3239
|
BYROW: () => la,
|
|
@@ -3250,7 +3255,7 @@ var ia = (e, t) => (e ?? 0) + t, U = (e, t) => e, aa = C({
|
|
|
3250
3255
|
SWITCH: () => Ta,
|
|
3251
3256
|
TRUE: () => Ea,
|
|
3252
3257
|
XOR: () => Da
|
|
3253
|
-
}), oa = (e) => typeof e == "number" ?
|
|
3258
|
+
}), oa = (e) => typeof e == "number" ? T(e) : e;
|
|
3254
3259
|
function sa(e) {
|
|
3255
3260
|
let t = !1, n = !1;
|
|
3256
3261
|
for (let r of e) for (let e of r.values()) t = !0, e || (n = !0);
|
|
@@ -3374,7 +3379,7 @@ function Sa(e, t, n) {
|
|
|
3374
3379
|
return r;
|
|
3375
3380
|
}
|
|
3376
3381
|
function Ca(e, t, n, r) {
|
|
3377
|
-
return
|
|
3382
|
+
return U(e, t, n, r, null);
|
|
3378
3383
|
}
|
|
3379
3384
|
function wa(e, t, n) {
|
|
3380
3385
|
let r = t.getRowCount(), i = t.getColumnCount();
|
|
@@ -3412,9 +3417,9 @@ function Da(e) {
|
|
|
3412
3417
|
return t ? n % 2 == 1 : y.BuiltIn.Value;
|
|
3413
3418
|
}
|
|
3414
3419
|
var Oa = Object.freeze({ includeEmpty: !0 }), ka = Object.freeze({ axis: b.Axis.Column }), Aa = Object.freeze({ axis: b.Axis.Row }), ja = (Object.freeze({
|
|
3415
|
-
type:
|
|
3420
|
+
type: S.Number,
|
|
3416
3421
|
axis: b.Axis.Column
|
|
3417
|
-
}),
|
|
3422
|
+
}), w({
|
|
3418
3423
|
ADDRESS: () => Ma,
|
|
3419
3424
|
AREAS: () => Na,
|
|
3420
3425
|
ARRAYFORMULA: () => Fa,
|
|
@@ -3652,17 +3657,17 @@ function $a(e, t, n, r = !0) {
|
|
|
3652
3657
|
l = o.next();
|
|
3653
3658
|
continue;
|
|
3654
3659
|
}
|
|
3655
|
-
let f =
|
|
3660
|
+
let f = G(i, e);
|
|
3656
3661
|
if (r) {
|
|
3657
3662
|
t = i, n = d, r = !1, f > 0 && (a = !0), l = o.next();
|
|
3658
3663
|
continue;
|
|
3659
3664
|
}
|
|
3660
|
-
let p =
|
|
3665
|
+
let p = G(t, e);
|
|
3661
3666
|
if (f > 0 && (a = !0), p > 0 && f > 0) return y.BuiltIn.NA;
|
|
3662
3667
|
if (a && p === 0 && f < 0 || t != null && f > 0 && p <= 0) return s(n);
|
|
3663
3668
|
t = i, n = d, l = o.next();
|
|
3664
3669
|
}
|
|
3665
|
-
return r ||
|
|
3670
|
+
return r || G(t, e) > 0 ? y.BuiltIn.NA : s(n);
|
|
3666
3671
|
}
|
|
3667
3672
|
if (!l) {
|
|
3668
3673
|
let t = i.slice({
|
|
@@ -3696,7 +3701,7 @@ function to(e) {
|
|
|
3696
3701
|
}
|
|
3697
3702
|
function no(e, t) {
|
|
3698
3703
|
let n = v.getArgs(), r = t;
|
|
3699
|
-
return n.getLength() < 2 ? r = void 0 : r != null && n.getKindAt(1) !==
|
|
3704
|
+
return n.getLength() < 2 ? r = void 0 : r != null && n.getKindAt(1) !== C.Omitted || (r = 0), v.createRichData("hyperlink", {
|
|
3700
3705
|
address: e,
|
|
3701
3706
|
friendly: r
|
|
3702
3707
|
});
|
|
@@ -3749,7 +3754,7 @@ function io(e, t = void 0, n = 0, r = void 0, i = void 0) {
|
|
|
3749
3754
|
}
|
|
3750
3755
|
function ao(e, t, n = void 0, r = 1) {
|
|
3751
3756
|
if (t ??= 0, t < 0 || n !== void 0 && n < 0 || r < 1) return y.BuiltIn.Value;
|
|
3752
|
-
let i =
|
|
3757
|
+
let i = E(t), a = n === void 0 ? 0 : E(n), o = Io(r);
|
|
3753
3758
|
if (o > e.length) return y.BuiltIn.Ref;
|
|
3754
3759
|
let s = e[o - 1];
|
|
3755
3760
|
if (s.size === 0 && !s.isIReferenceRange) return i <= 1 && a <= 1 ? 0 : y.BuiltIn.Ref;
|
|
@@ -3841,7 +3846,7 @@ function mo(e, t, n, r = !1) {
|
|
|
3841
3846
|
let i = Ha(e), a = i.getRowCount(), o = i.getColumnCount(), s = r ? b.Axis.Column : b.Axis.Row, c = r ? a : o, l = function(e, t) {
|
|
3842
3847
|
if (e.length > t) throw y.BuiltIn.Value;
|
|
3843
3848
|
return e.map((e) => {
|
|
3844
|
-
let n = Math.trunc(
|
|
3849
|
+
let n = Math.trunc(D(e));
|
|
3845
3850
|
if (!(n >= 1 && n <= t)) throw y.BuiltIn.Value;
|
|
3846
3851
|
return n - 1;
|
|
3847
3852
|
});
|
|
@@ -4012,17 +4017,17 @@ function Do(e, t, n, r = !0) {
|
|
|
4012
4017
|
l = o.next();
|
|
4013
4018
|
continue;
|
|
4014
4019
|
}
|
|
4015
|
-
let f =
|
|
4020
|
+
let f = G(i, e);
|
|
4016
4021
|
if (r) {
|
|
4017
4022
|
t = i, n = d, r = !1, f > 0 && (a = !0), l = o.next();
|
|
4018
4023
|
continue;
|
|
4019
4024
|
}
|
|
4020
|
-
let p =
|
|
4025
|
+
let p = G(t, e);
|
|
4021
4026
|
if (f > 0 && (a = !0), p > 0 && f > 0) return y.BuiltIn.NA;
|
|
4022
4027
|
if (a && p === 0 && f < 0 || t != null && f > 0 && p <= 0) return s(n);
|
|
4023
4028
|
t = i, n = d, l = o.next();
|
|
4024
4029
|
}
|
|
4025
|
-
return r ||
|
|
4030
|
+
return r || G(t, e) > 0 ? y.BuiltIn.NA : s(n);
|
|
4026
4031
|
}
|
|
4027
4032
|
if (!l) {
|
|
4028
4033
|
let t = i.slice({
|
|
@@ -4159,9 +4164,9 @@ function Po(e, t, n, r, i, a = !1) {
|
|
|
4159
4164
|
if (c < i) break;
|
|
4160
4165
|
}
|
|
4161
4166
|
}
|
|
4162
|
-
let l =
|
|
4167
|
+
let l = G(e[c], t);
|
|
4163
4168
|
if (l === 0) {
|
|
4164
|
-
for (; c + 1 < e.length && r(c + 1) &&
|
|
4169
|
+
for (; c + 1 < e.length && r(c + 1) && G(e[c + 1], t) === 0;) c++;
|
|
4165
4170
|
return c;
|
|
4166
4171
|
}
|
|
4167
4172
|
(n ? l < 0 : l > 0) ? (o = c, i = Math.max(s, c) + 1) : a = Math.min(s, c) - 1;
|
|
@@ -4170,23 +4175,23 @@ function Po(e, t, n, r, i, a = !1) {
|
|
|
4170
4175
|
}(s, e, r === 2);
|
|
4171
4176
|
return l === -1 ? y.BuiltIn.NA : c[l] + 1;
|
|
4172
4177
|
}
|
|
4173
|
-
function
|
|
4178
|
+
function G(e, t) {
|
|
4174
4179
|
return typeof e == "number" && typeof t == "number" ? e < t ? -1 : +(e > t) : v.compare(e, t);
|
|
4175
4180
|
}
|
|
4176
4181
|
function Fo() {
|
|
4177
4182
|
let e = v.getArgs().getKindAt(1);
|
|
4178
|
-
return e !==
|
|
4183
|
+
return e !== C.Reference && e !== C.Array;
|
|
4179
4184
|
}
|
|
4180
4185
|
function Io(e) {
|
|
4181
4186
|
return Number.isFinite(e) ? Math.trunc(e === 0 ? 0 : Number(e.toPrecision(15))) : e;
|
|
4182
4187
|
}
|
|
4183
4188
|
function Lo(e, t = !1) {
|
|
4184
|
-
return typeof e == "string" && (t ? /[*?~]/.test(e) :
|
|
4189
|
+
return typeof e == "string" && (t ? /[*?~]/.test(e) : de.isWildCard(e)) ? de.toRegex(e, "i", !0) : null;
|
|
4185
4190
|
}
|
|
4186
4191
|
function Ro(e, t, n, r) {
|
|
4187
4192
|
let i = 0, a = e.length - 1, o = -1, s = -1;
|
|
4188
4193
|
for (; i <= a;) {
|
|
4189
|
-
let n = i + a >>> 1, c = t === null ? zo(e[n]) :
|
|
4194
|
+
let n = i + a >>> 1, c = t === null ? zo(e[n]) : G(e[n], t);
|
|
4190
4195
|
c === 0 ? (o = n, r ? a = n - 1 : i = n + 1) : (r ? c < 0 : c > 0) ? (s = n, i = n + 1) : a = n - 1;
|
|
4191
4196
|
}
|
|
4192
4197
|
return o === -1 ? n === 0 || n === 2 ? -1 : (r ? n === -1 : n === 1) ? s : s + 1 < e.length ? s + 1 : -1 : o;
|
|
@@ -4204,7 +4209,7 @@ function Bo(e, t, n) {
|
|
|
4204
4209
|
for (; !c.done;) {
|
|
4205
4210
|
let { value: e, coords: n } = c.value, r = i ? n.colIndex : n.rowIndex;
|
|
4206
4211
|
if (e == null) return r;
|
|
4207
|
-
t === -1 && (o === -1 ||
|
|
4212
|
+
t === -1 && (o === -1 || G(e, s) > 0) && (o = r, s = e), c = a.next();
|
|
4208
4213
|
}
|
|
4209
4214
|
return o;
|
|
4210
4215
|
}
|
|
@@ -4217,7 +4222,7 @@ function Vo(e, t, n, r) {
|
|
|
4217
4222
|
}), o = a.next();
|
|
4218
4223
|
for (; !o.done;) {
|
|
4219
4224
|
let { value: e, coords: n } = o.value;
|
|
4220
|
-
if (e != null && (r ? typeof e == "string" && r.test(e) :
|
|
4225
|
+
if (e != null && (r ? typeof e == "string" && r.test(e) : G(e, t) === 0)) return i ? n.colIndex : n.rowIndex;
|
|
4221
4226
|
o = a.next();
|
|
4222
4227
|
}
|
|
4223
4228
|
return -1;
|
|
@@ -4232,7 +4237,7 @@ function Ho(e, t, n, r, i = n === 2) {
|
|
|
4232
4237
|
if (r != null) {
|
|
4233
4238
|
if (a) {
|
|
4234
4239
|
if (typeof r == "string" && a.test(r)) return n;
|
|
4235
|
-
} else if (
|
|
4240
|
+
} else if (G(r, e) === 0) return n;
|
|
4236
4241
|
}
|
|
4237
4242
|
}
|
|
4238
4243
|
return -1;
|
|
@@ -4241,9 +4246,9 @@ function Ho(e, t, n, r, i = n === 2) {
|
|
|
4241
4246
|
for (let r = s; r !== c; r += o) {
|
|
4242
4247
|
let i = t[r];
|
|
4243
4248
|
if (i == null) continue;
|
|
4244
|
-
let a =
|
|
4249
|
+
let a = G(i, e);
|
|
4245
4250
|
if (a === 0) return r;
|
|
4246
|
-
n === -1 ? a < 0 && (l === -1 ||
|
|
4251
|
+
n === -1 ? a < 0 && (l === -1 || G(i, u) > 0) && (l = r, u = i) : a > 0 && (l === -1 || G(i, u) < 0) && (l = r, u = i);
|
|
4247
4252
|
}
|
|
4248
4253
|
return l;
|
|
4249
4254
|
}
|
|
@@ -4266,9 +4271,9 @@ function Wo(e, t, n) {
|
|
|
4266
4271
|
l = c.next();
|
|
4267
4272
|
continue;
|
|
4268
4273
|
}
|
|
4269
|
-
let d =
|
|
4274
|
+
let d = G(t, e);
|
|
4270
4275
|
if (d > 0 && (o = !0), d <= 0) {
|
|
4271
|
-
let n = a !== null &&
|
|
4276
|
+
let n = a !== null && G(a, e) === 0;
|
|
4272
4277
|
o && n || (i = u, a = t);
|
|
4273
4278
|
}
|
|
4274
4279
|
l = c.next();
|
|
@@ -4321,7 +4326,7 @@ function qo(e, t, n, r, i, a) {
|
|
|
4321
4326
|
}, null, d && a ? { emptyFold: a } : void 0);
|
|
4322
4327
|
return h === null ? i : h;
|
|
4323
4328
|
}
|
|
4324
|
-
function
|
|
4329
|
+
function K(e) {
|
|
4325
4330
|
return (t, n) => y.isError(t) ? t : y.isError(n) ? n : e(t, n);
|
|
4326
4331
|
}
|
|
4327
4332
|
function Jo(e) {
|
|
@@ -4340,7 +4345,7 @@ var Xo = (e) => {
|
|
|
4340
4345
|
let n = Math.min(t, e - t), r = 1;
|
|
4341
4346
|
for (let t = 1; t <= n; t++) if (r = r / t * (e - n + t), !Number.isFinite(r)) return NaN;
|
|
4342
4347
|
return r;
|
|
4343
|
-
}, Qo =
|
|
4348
|
+
}, Qo = w({
|
|
4344
4349
|
ABS: () => $o,
|
|
4345
4350
|
AGGREGATE: () => ts,
|
|
4346
4351
|
ARABIC: () => ns,
|
|
@@ -4513,9 +4518,9 @@ function rs(e, t, n = 1) {
|
|
|
4513
4518
|
}
|
|
4514
4519
|
function is(e, t) {
|
|
4515
4520
|
if (t === 0) return 0;
|
|
4516
|
-
if (
|
|
4521
|
+
if (T(t) === 0) throw y.BuiltIn.Div0;
|
|
4517
4522
|
if (e > 0 && t < 0) return NaN;
|
|
4518
|
-
let n = Math.abs(t), r =
|
|
4523
|
+
let n = Math.abs(t), r = D(Math.abs(e) / n);
|
|
4519
4524
|
if (r % 1 == 0) return (e < 0 ? -1 : 1) * r * n;
|
|
4520
4525
|
let i = Math.floor(r);
|
|
4521
4526
|
return e < 0 ? t < 0 ? -n * (i + 1) : -n * i : (i + 1) * n;
|
|
@@ -4572,11 +4577,11 @@ function ps(e) {
|
|
|
4572
4577
|
}
|
|
4573
4578
|
function ms(e) {
|
|
4574
4579
|
if (e < 0) return NaN;
|
|
4575
|
-
let t = Math.trunc(
|
|
4580
|
+
let t = Math.trunc(D(e));
|
|
4576
4581
|
return t > 170 ? NaN : Xo(t);
|
|
4577
4582
|
}
|
|
4578
4583
|
function hs(e) {
|
|
4579
|
-
let t =
|
|
4584
|
+
let t = q(e);
|
|
4580
4585
|
if (t < -1) return NaN;
|
|
4581
4586
|
let n = 1;
|
|
4582
4587
|
for (let e = Math.trunc(t); e > 1; e -= 2) if (n *= e, !Number.isFinite(n)) return NaN;
|
|
@@ -4584,9 +4589,9 @@ function hs(e) {
|
|
|
4584
4589
|
}
|
|
4585
4590
|
function gs(e, t) {
|
|
4586
4591
|
if (e === 0) return 0;
|
|
4587
|
-
if (t === 0 ||
|
|
4592
|
+
if (t === 0 || T(t) === 0) throw y.BuiltIn.Div0;
|
|
4588
4593
|
if (t ??= e > 0 ? 1 : -1, e > 0 && t < 0) return NaN;
|
|
4589
|
-
let n = Math.abs(t), r =
|
|
4594
|
+
let n = Math.abs(t), r = D(Math.abs(e) / n);
|
|
4590
4595
|
if (r % 1 == 0) return (e < 0 ? -1 : 1) * r * n;
|
|
4591
4596
|
let i = Math.floor(r);
|
|
4592
4597
|
return e < 0 ? t < 0 ? -n * i : -n * (i + 1) : i * n;
|
|
@@ -4614,7 +4619,7 @@ function ys(e) {
|
|
|
4614
4619
|
}
|
|
4615
4620
|
function bs(e) {
|
|
4616
4621
|
let t = Math.round(e);
|
|
4617
|
-
return
|
|
4622
|
+
return D(e) === D(t) ? t : Math.floor(e);
|
|
4618
4623
|
}
|
|
4619
4624
|
function xs(e, t = 1) {
|
|
4620
4625
|
return os(e, t);
|
|
@@ -4661,7 +4666,7 @@ function Ds(e) {
|
|
|
4661
4666
|
let { lu: t, sign: n, singular: r } = Ko(e);
|
|
4662
4667
|
if (r) return 0;
|
|
4663
4668
|
let i = n;
|
|
4664
|
-
for (let e = 0; e < t.length; e++) i =
|
|
4669
|
+
for (let e = 0; e < t.length; e++) i = T(i * t[e][e]);
|
|
4665
4670
|
return Number.isFinite(i) ? i : NaN;
|
|
4666
4671
|
})(r) : r;
|
|
4667
4672
|
}
|
|
@@ -4685,7 +4690,7 @@ function Os(e) {
|
|
|
4685
4690
|
for (let r = t - 1; r >= 0; r--) {
|
|
4686
4691
|
let o = i[r];
|
|
4687
4692
|
for (let i = r + 1; i < t; i++) o -= n[r][i] * a[i][e];
|
|
4688
|
-
a[r][e] =
|
|
4693
|
+
a[r][e] = T(o / n[r][r]);
|
|
4689
4694
|
}
|
|
4690
4695
|
}
|
|
4691
4696
|
return a;
|
|
@@ -4712,13 +4717,13 @@ function ks(e, t) {
|
|
|
4712
4717
|
return c;
|
|
4713
4718
|
}
|
|
4714
4719
|
function As(e, t) {
|
|
4715
|
-
if (
|
|
4716
|
-
if (e !== 0 &&
|
|
4720
|
+
if (T(t) === 0) throw y.BuiltIn.Div0;
|
|
4721
|
+
if (e !== 0 && T(e) === 0 || Math.abs(e / t) > js) return NaN;
|
|
4717
4722
|
let n = e % t;
|
|
4718
4723
|
return n !== 0 && n < 0 != t < 0 && (n += t), n === t ? 0 : n;
|
|
4719
4724
|
}
|
|
4720
4725
|
var js = 1099511627776;
|
|
4721
|
-
function
|
|
4726
|
+
function q(e) {
|
|
4722
4727
|
if (e === void 0) throw y.BuiltIn.NA;
|
|
4723
4728
|
if (e === null) return 0;
|
|
4724
4729
|
if (typeof e == "boolean") throw y.BuiltIn.Value;
|
|
@@ -4726,7 +4731,7 @@ function K(e) {
|
|
|
4726
4731
|
return v.parseAsNumber(e);
|
|
4727
4732
|
}
|
|
4728
4733
|
function Ms(e, t) {
|
|
4729
|
-
let n =
|
|
4734
|
+
let n = q(e), r = q(t);
|
|
4730
4735
|
if (r === 0) return 0;
|
|
4731
4736
|
if (n > 0 && r < 0 || n < 0 && r > 0) return NaN;
|
|
4732
4737
|
let i = n / r;
|
|
@@ -4767,8 +4772,8 @@ function Is(e, t) {
|
|
|
4767
4772
|
let n = v.getArgs(), r = [e, t];
|
|
4768
4773
|
for (let e = 0; e < 2; e++) if (r[e].hasError()) throw !0 === n.getRawAt(e)?.isIRange ? y.BuiltIn.Num : r[e].errors().next().value.value;
|
|
4769
4774
|
let i = e.getStats().getSnappedSum(), a = t.getStats().getSnappedSum();
|
|
4770
|
-
if (
|
|
4771
|
-
return
|
|
4775
|
+
if (T(a) === 0) throw y.BuiltIn.Div0;
|
|
4776
|
+
return T(i / a);
|
|
4772
4777
|
}
|
|
4773
4778
|
function Ls() {
|
|
4774
4779
|
return Math.PI;
|
|
@@ -4787,11 +4792,11 @@ function zs(e, t) {
|
|
|
4787
4792
|
}
|
|
4788
4793
|
function Bs(e) {
|
|
4789
4794
|
let t = 0, n = !1;
|
|
4790
|
-
for (let r of e) for (let e of r.values()) t = n ?
|
|
4795
|
+
for (let r of e) for (let e of r.values()) t = n ? T(t * e) : e, n = !0;
|
|
4791
4796
|
return n ? t : 0;
|
|
4792
4797
|
}
|
|
4793
4798
|
function Vs(e, t) {
|
|
4794
|
-
let n =
|
|
4799
|
+
let n = q(e), r = q(t);
|
|
4795
4800
|
if (r === 0) throw y.BuiltIn.Div0;
|
|
4796
4801
|
return Math.trunc(n / r);
|
|
4797
4802
|
}
|
|
@@ -4814,9 +4819,9 @@ function Ws(e = 1, t = 1, n = 0, r = 1, i = !1) {
|
|
|
4814
4819
|
}) : y.BuiltIn.Value;
|
|
4815
4820
|
}
|
|
4816
4821
|
function Gs(e, t) {
|
|
4817
|
-
let n =
|
|
4822
|
+
let n = q(t), r = q(e);
|
|
4818
4823
|
if (r > n) return NaN;
|
|
4819
|
-
let i = Math.ceil(
|
|
4824
|
+
let i = Math.ceil(T(r)), a = Math.ceil(T(n));
|
|
4820
4825
|
return i + Math.floor(v.getRandom() * (a - i + 1));
|
|
4821
4826
|
}
|
|
4822
4827
|
function Ks(e, t = 0) {
|
|
@@ -4825,52 +4830,52 @@ function Ks(e, t = 0) {
|
|
|
4825
4830
|
if (e === 0) return "";
|
|
4826
4831
|
let r = e, i = "";
|
|
4827
4832
|
for (let e = 0; e <= _c / 2; e++) {
|
|
4828
|
-
let t = 2 * e, a = Math.floor(r /
|
|
4833
|
+
let t = 2 * e, a = Math.floor(r / J[t]);
|
|
4829
4834
|
if (a % 5 == 4) {
|
|
4830
4835
|
let e = a === 4 ? t - 1 : t - 2, o = 0;
|
|
4831
|
-
for (; o < n && t < _c;) o++,
|
|
4832
|
-
i += gc[t] + gc[e], r = r +
|
|
4836
|
+
for (; o < n && t < _c;) o++, J[e] - J[t + 1] <= r ? t++ : o = n;
|
|
4837
|
+
i += gc[t] + gc[e], r = r + J[t] - J[e];
|
|
4833
4838
|
} else {
|
|
4834
|
-
a > 4 && (i += gc[t - 1], r -=
|
|
4835
|
-
let e = Math.floor(r /
|
|
4836
|
-
for (r -= e *
|
|
4839
|
+
a > 4 && (i += gc[t - 1], r -= J[t - 1]);
|
|
4840
|
+
let e = Math.floor(r / J[t]);
|
|
4841
|
+
for (r -= e * J[t]; e > 0; e--) i += gc[t];
|
|
4837
4842
|
}
|
|
4838
4843
|
}
|
|
4839
4844
|
return i;
|
|
4840
4845
|
}
|
|
4841
4846
|
function qs(e, t) {
|
|
4842
|
-
let n =
|
|
4847
|
+
let n = E(t);
|
|
4843
4848
|
if (n >= mc) return 0;
|
|
4844
4849
|
let r = e > 0 ? 1 : -1, i = Math.abs(e);
|
|
4845
|
-
if (n === 0) return r * Math.round(
|
|
4850
|
+
if (n === 0) return r * Math.round(D(i));
|
|
4846
4851
|
let a = hc(n);
|
|
4847
4852
|
if (a === void 0) return n > 0 ? e : 0;
|
|
4848
4853
|
if (n > 0) {
|
|
4849
|
-
let t =
|
|
4850
|
-
return Number.isFinite(t) ? r *
|
|
4854
|
+
let t = D(D(i) * a);
|
|
4855
|
+
return Number.isFinite(t) ? r * D(Math.round(t) / a) : e;
|
|
4851
4856
|
}
|
|
4852
|
-
return r * Math.round(
|
|
4857
|
+
return r * Math.round(D(i / a)) * a;
|
|
4853
4858
|
}
|
|
4854
4859
|
function Js(e, t) {
|
|
4855
4860
|
let n = pc(t), r = e > 0 ? 1 : -1, i = Math.abs(e);
|
|
4856
|
-
if (n === 0) return r * Math.floor(
|
|
4861
|
+
if (n === 0) return r * Math.floor(D(i));
|
|
4857
4862
|
let a = hc(n);
|
|
4858
4863
|
if (a === void 0) return n > 0 ? e : 0;
|
|
4859
4864
|
if (n > 0) {
|
|
4860
|
-
let t =
|
|
4861
|
-
return Number.isFinite(t) ? r *
|
|
4865
|
+
let t = D(D(i) * a);
|
|
4866
|
+
return Number.isFinite(t) ? r * D(Math.floor(t) / a) : e;
|
|
4862
4867
|
}
|
|
4863
|
-
return r * Math.floor(
|
|
4868
|
+
return r * Math.floor(D(i / a)) * a;
|
|
4864
4869
|
}
|
|
4865
4870
|
function Ys(e, t) {
|
|
4866
4871
|
let n = pc(t), r = Js(e, n);
|
|
4867
|
-
if (r ===
|
|
4872
|
+
if (r === D(e)) return r;
|
|
4868
4873
|
let i = r + Math.sign(e) * 10 ** -n;
|
|
4869
4874
|
return Number.isFinite(i) ? i : NaN;
|
|
4870
4875
|
}
|
|
4871
4876
|
var Xs = (e) => {
|
|
4872
4877
|
if (e <= -1.1920928955078125e-7) return y.BuiltIn.Value;
|
|
4873
|
-
let t = Math.trunc(
|
|
4878
|
+
let t = Math.trunc(D(e));
|
|
4874
4879
|
return t <= 0 ? y.BuiltIn.Calc : t > v.getEntireCoords().rowEnd + 1 ? y.BuiltIn.Value : t;
|
|
4875
4880
|
};
|
|
4876
4881
|
function Zs(e, t = 1, n = 1, r = 1) {
|
|
@@ -4886,7 +4891,7 @@ function Zs(e, t = 1, n = 1, r = 1) {
|
|
|
4886
4891
|
});
|
|
4887
4892
|
}
|
|
4888
4893
|
function Qs(e, t, n, r) {
|
|
4889
|
-
let i =
|
|
4894
|
+
let i = q(e), a = q(t), o = q(n);
|
|
4890
4895
|
if (r === void 0) throw y.BuiltIn.NA;
|
|
4891
4896
|
if (y.isError(r)) throw r;
|
|
4892
4897
|
let s = v.getArgs().getRawAt(3), c = s, l = !0 === c?.isIRange, u = l && c.size === 1 && !0 === c.isIReferenceRange;
|
|
@@ -4910,14 +4915,14 @@ var $s = (e, t) => {
|
|
|
4910
4915
|
return n;
|
|
4911
4916
|
};
|
|
4912
4917
|
function ec(e) {
|
|
4913
|
-
let t =
|
|
4918
|
+
let t = T(e);
|
|
4914
4919
|
return t > 0 ? 1 : t === 0 ? 0 : -1;
|
|
4915
4920
|
}
|
|
4916
4921
|
function tc(e) {
|
|
4917
4922
|
return Math.sqrt(e);
|
|
4918
4923
|
}
|
|
4919
4924
|
function nc(e) {
|
|
4920
|
-
let t =
|
|
4925
|
+
let t = q(e);
|
|
4921
4926
|
return t < 0 ? NaN : Math.sqrt(t * Math.PI);
|
|
4922
4927
|
}
|
|
4923
4928
|
function rc(e, t) {
|
|
@@ -4967,10 +4972,10 @@ function ic(e) {
|
|
|
4967
4972
|
return n ? n.getSnappedSum(t) : t;
|
|
4968
4973
|
}
|
|
4969
4974
|
function ac(e, t, n) {
|
|
4970
|
-
return
|
|
4975
|
+
return U(e, t, n, K((e, t) => (e === null && (e = 0), typeof t == "number" ? e + t : e)), W);
|
|
4971
4976
|
}
|
|
4972
4977
|
function oc(e, t) {
|
|
4973
|
-
return qo(v, t,
|
|
4978
|
+
return qo(v, t, K((e, t) => typeof t == "number" ? e === null ? t : e + t : e), e, 0, W);
|
|
4974
4979
|
}
|
|
4975
4980
|
function sc(e) {
|
|
4976
4981
|
let t = v.getArgs().getRepeatingArgsAt(0);
|
|
@@ -4994,28 +4999,28 @@ function sc(e) {
|
|
|
4994
4999
|
}
|
|
4995
5000
|
function cc(e) {
|
|
4996
5001
|
let t = 0;
|
|
4997
|
-
for (let n of e) for (let e of n.values()) t +=
|
|
5002
|
+
for (let n of e) for (let e of n.values()) t += T(e ** 2);
|
|
4998
5003
|
return t;
|
|
4999
5004
|
}
|
|
5000
5005
|
function lc(e, t) {
|
|
5001
|
-
return wc(e, t, (e, t) =>
|
|
5006
|
+
return wc(e, t, (e, t) => T(e ** 2) - T(t ** 2));
|
|
5002
5007
|
}
|
|
5003
5008
|
function uc(e, t) {
|
|
5004
|
-
return wc(e, t, (e, t) =>
|
|
5009
|
+
return wc(e, t, (e, t) => T(e ** 2) + T(t ** 2));
|
|
5005
5010
|
}
|
|
5006
5011
|
function dc(e, t) {
|
|
5007
|
-
return wc(e, t, (e, t) =>
|
|
5012
|
+
return wc(e, t, (e, t) => T((e - t) ** 2));
|
|
5008
5013
|
}
|
|
5009
5014
|
function fc(e, t = 0) {
|
|
5010
5015
|
let n = pc(t);
|
|
5011
|
-
if (n === 0) return Math.trunc(
|
|
5016
|
+
if (n === 0) return Math.trunc(D(e));
|
|
5012
5017
|
let r = hc(n);
|
|
5013
5018
|
if (r === void 0) return n > 0 ? e : 0;
|
|
5014
5019
|
if (n > 0) {
|
|
5015
|
-
let t =
|
|
5016
|
-
return Number.isFinite(t) ?
|
|
5020
|
+
let t = D(D(e) * r);
|
|
5021
|
+
return Number.isFinite(t) ? D(Math.trunc(t) / r) : e;
|
|
5017
5022
|
}
|
|
5018
|
-
return Math.trunc(
|
|
5023
|
+
return Math.trunc(D(e / r)) * r;
|
|
5019
5024
|
}
|
|
5020
5025
|
var pc = (e) => Math.trunc(e), mc = 2147483646, hc = (e) => {
|
|
5021
5026
|
let t = 10 ** Math.abs(e);
|
|
@@ -5028,7 +5033,7 @@ var pc = (e) => Math.trunc(e), mc = 2147483646, hc = (e) => {
|
|
|
5028
5033
|
"X",
|
|
5029
5034
|
"V",
|
|
5030
5035
|
"I"
|
|
5031
|
-
],
|
|
5036
|
+
], J = [
|
|
5032
5037
|
1e3,
|
|
5033
5038
|
500,
|
|
5034
5039
|
100,
|
|
@@ -5036,19 +5041,19 @@ var pc = (e) => Math.trunc(e), mc = 2147483646, hc = (e) => {
|
|
|
5036
5041
|
10,
|
|
5037
5042
|
5,
|
|
5038
5043
|
1
|
|
5039
|
-
], _c =
|
|
5044
|
+
], _c = J.length - 1, vc = Object.fromEntries(gc.map((e, t) => [e, J[t]])), yc = 255, bc = (e) => {
|
|
5040
5045
|
let t = e[0], n = e.length;
|
|
5041
|
-
for (let r = 1; r < n; r++) t =
|
|
5046
|
+
for (let r = 1; r < n; r++) t = T(t * e[r]);
|
|
5042
5047
|
return t;
|
|
5043
5048
|
}, xc = (e, t, n) => e.alignReduce(t, (e, t) => {
|
|
5044
5049
|
let r = t.length;
|
|
5045
5050
|
for (let n = 0; n < r; n++) if (typeof t[n] != "number") return e;
|
|
5046
5051
|
return e + n(t);
|
|
5047
5052
|
}, 0), Sc = (e) => {
|
|
5048
|
-
if (v.getArgs().getRepeatingArgsAt(0).getKindAt(0) ===
|
|
5053
|
+
if (v.getArgs().getRepeatingArgsAt(0).getKindAt(0) === C.Omitted) throw y.BuiltIn.NA;
|
|
5049
5054
|
if (e.length === 0) throw y.BuiltIn.Value;
|
|
5050
5055
|
}, Cc = (e, t) => {
|
|
5051
|
-
if (e.getRowCount() !== 1 || e.getColumnCount() !== 1 || v.getArgs().getKindAt(t) ===
|
|
5056
|
+
if (e.getRowCount() !== 1 || e.getColumnCount() !== 1 || v.getArgs().getKindAt(t) === C.Array) return;
|
|
5052
5057
|
let n = e.getValueAt(0, 0);
|
|
5053
5058
|
if (n === null) throw y.BuiltIn.Value;
|
|
5054
5059
|
if (y.isError(n)) throw n;
|
|
@@ -5062,7 +5067,7 @@ var pc = (e) => Math.trunc(e), mc = 2147483646, hc = (e) => {
|
|
|
5062
5067
|
let a = 0, o = e.alignReduce([t], (e, t) => typeof t[0] != "number" || typeof t[1] != "number" ? e : (a++, e + n(t[0], t[1])), 0);
|
|
5063
5068
|
if (a === 0) throw y.BuiltIn.Div0;
|
|
5064
5069
|
return o;
|
|
5065
|
-
}, Tc = { onlyWhileFiltered: !0 }, Ec = { axis: b.Axis.Row }, Dc = 9007199254740992, Oc =
|
|
5070
|
+
}, Tc = { onlyWhileFiltered: !0 }, Ec = { axis: b.Axis.Row }, Dc = 9007199254740992, Oc = w({
|
|
5066
5071
|
ACOS: () => kc,
|
|
5067
5072
|
ACOSH: () => Ac,
|
|
5068
5073
|
ACOT: () => jc,
|
|
@@ -5092,11 +5097,11 @@ function Ac(e) {
|
|
|
5092
5097
|
return e < 1 ? NaN : Math.log(e + Math.sqrt(e * e - 1));
|
|
5093
5098
|
}
|
|
5094
5099
|
function jc(e) {
|
|
5095
|
-
let t = Math.atan(
|
|
5100
|
+
let t = Math.atan(T(1 / e));
|
|
5096
5101
|
return e < 0 ? Math.PI + t : t;
|
|
5097
5102
|
}
|
|
5098
5103
|
function Mc(e) {
|
|
5099
|
-
return Math.abs(e) <= 1 ? NaN : Math.abs(e) <= 2 ? Math.log((e + 1) / (e - 1)) / 2 :
|
|
5104
|
+
return Math.abs(e) <= 1 ? NaN : Math.abs(e) <= 2 ? Math.log((e + 1) / (e - 1)) / 2 : xe(T(1 / e));
|
|
5100
5105
|
}
|
|
5101
5106
|
function Nc(e) {
|
|
5102
5107
|
return e > 1 || e < -1 ? NaN : Math.asin(e);
|
|
@@ -5116,51 +5121,51 @@ function Ic(e, t) {
|
|
|
5116
5121
|
return e >= 0 ? r : t >= 0 ? r + Math.PI : r - Math.PI;
|
|
5117
5122
|
}
|
|
5118
5123
|
function Lc(e) {
|
|
5119
|
-
return Math.abs(e) >= 1 ? NaN :
|
|
5124
|
+
return Math.abs(e) >= 1 ? NaN : xe(e);
|
|
5120
5125
|
}
|
|
5121
5126
|
function Rc(e) {
|
|
5122
|
-
return Math.abs(e) >=
|
|
5127
|
+
return Math.abs(e) >= L ? NaN : z(e);
|
|
5123
5128
|
}
|
|
5124
5129
|
function zc(e) {
|
|
5125
5130
|
return Number.isFinite(Math.exp(Math.abs(e))) ? Math.cosh(e) : NaN;
|
|
5126
5131
|
}
|
|
5127
5132
|
function Bc(e) {
|
|
5128
|
-
if (Math.abs(e) >=
|
|
5133
|
+
if (Math.abs(e) >= L) return NaN;
|
|
5129
5134
|
if (e === 0) throw y.BuiltIn.Div0;
|
|
5130
5135
|
return 1 / ar(e);
|
|
5131
5136
|
}
|
|
5132
5137
|
function Vc(e) {
|
|
5133
5138
|
if (e === 0) throw y.BuiltIn.Div0;
|
|
5134
|
-
return
|
|
5139
|
+
return T(1 / Math.tanh(e));
|
|
5135
5140
|
}
|
|
5136
5141
|
function Hc(e) {
|
|
5137
|
-
if (Math.abs(e) >=
|
|
5142
|
+
if (Math.abs(e) >= L) return NaN;
|
|
5138
5143
|
if (e === 0) throw y.BuiltIn.Div0;
|
|
5139
|
-
return 1 /
|
|
5144
|
+
return 1 / R(e);
|
|
5140
5145
|
}
|
|
5141
5146
|
function Uc(e) {
|
|
5142
5147
|
if (e === 0) throw y.BuiltIn.Div0;
|
|
5143
|
-
return
|
|
5148
|
+
return T(1 / Math.sinh(e));
|
|
5144
5149
|
}
|
|
5145
5150
|
function Wc(e) {
|
|
5146
|
-
return Math.abs(e) >=
|
|
5151
|
+
return Math.abs(e) >= L ? NaN : 1 / z(e);
|
|
5147
5152
|
}
|
|
5148
5153
|
function Gc(e) {
|
|
5149
|
-
return
|
|
5154
|
+
return T(1 / Math.cosh(e));
|
|
5150
5155
|
}
|
|
5151
5156
|
function Kc(e) {
|
|
5152
|
-
return Math.abs(e) >=
|
|
5157
|
+
return Math.abs(e) >= L ? NaN : R(e);
|
|
5153
5158
|
}
|
|
5154
5159
|
function qc(e) {
|
|
5155
5160
|
return Number.isFinite(Math.exp(Math.abs(e))) ? Math.sinh(e) : NaN;
|
|
5156
5161
|
}
|
|
5157
5162
|
function Jc(e) {
|
|
5158
|
-
return Math.abs(e) >=
|
|
5163
|
+
return Math.abs(e) >= L ? NaN : ar(e);
|
|
5159
5164
|
}
|
|
5160
5165
|
function Yc(e) {
|
|
5161
5166
|
return Math.tanh(e);
|
|
5162
5167
|
}
|
|
5163
|
-
var Xc =
|
|
5168
|
+
var Xc = w({
|
|
5164
5169
|
ADD: () => Qc,
|
|
5165
5170
|
DIVIDE: () => $c,
|
|
5166
5171
|
EQ: () => el,
|
|
@@ -5234,8 +5239,8 @@ function fl(e, t, n, r = !0, i = !0) {
|
|
|
5234
5239
|
}
|
|
5235
5240
|
var pl = (e) => !!e.isIReferenceRange, ml = (e) => Object.freeze({ coerce: (t, n, r, i) => {
|
|
5236
5241
|
let a = pl(i);
|
|
5237
|
-
if (n ===
|
|
5238
|
-
if (n ===
|
|
5242
|
+
if (n === S.String) return a ? 0 : e;
|
|
5243
|
+
if (n === S.Boolean) return a ? +!!t : null;
|
|
5239
5244
|
if (y.isError(t)) throw t;
|
|
5240
5245
|
return null;
|
|
5241
5246
|
} }), hl = ml(null), gl = ml(0), _l = (e, t) => {
|
|
@@ -5244,7 +5249,7 @@ var pl = (e) => !!e.isIReferenceRange, ml = (e) => Object.freeze({ coerce: (t, n
|
|
|
5244
5249
|
if (typeof e == "string") return t ? 0 : null;
|
|
5245
5250
|
if (y.isError(e)) throw e;
|
|
5246
5251
|
return null;
|
|
5247
|
-
}, vl =
|
|
5252
|
+
}, vl = w({
|
|
5248
5253
|
AVEDEV: () => yl,
|
|
5249
5254
|
AVERAGE: () => bl,
|
|
5250
5255
|
AVERAGEA: () => xl,
|
|
@@ -5289,11 +5294,11 @@ function xl(e) {
|
|
|
5289
5294
|
return ql(e, gl);
|
|
5290
5295
|
}
|
|
5291
5296
|
function Sl(e, t, n) {
|
|
5292
|
-
let r =
|
|
5297
|
+
let r = U(e, t, n, (e, t) => typeof t == "number" ? e + 1 : e, W), i = U(e, t, n, K((e, t) => (e === null && (e = 0), typeof t == "number" ? e + t : e)), W);
|
|
5293
5298
|
return y.isError(i) ? i : r ? i / r : y.BuiltIn.Div0;
|
|
5294
5299
|
}
|
|
5295
5300
|
function Cl(e, t) {
|
|
5296
|
-
let n = qo(v, t,
|
|
5301
|
+
let n = qo(v, t, K((e, t) => typeof t == "number" ? e === null ? t : e + t : e), e, null, W), r = qo(v, t, (e, t) => typeof t == "number" ? e === null ? 1 : e + 1 : e, e, 0, W);
|
|
5297
5302
|
return y.isError(n) ? n : r === 0 || r === null ? y.BuiltIn.Div0 : n / r;
|
|
5298
5303
|
}
|
|
5299
5304
|
function wl(e) {
|
|
@@ -5320,7 +5325,7 @@ function El(e) {
|
|
|
5320
5325
|
let t = v.getArgs().getRepeatingArgsAt(0), n = 0;
|
|
5321
5326
|
for (let r = 0; r < e.length; r++) {
|
|
5322
5327
|
let i = e[r];
|
|
5323
|
-
y.isError(i) ? n++ : n += !0 === i.isIReferenceRange || t.getKindAt(r) ===
|
|
5328
|
+
y.isError(i) ? n++ : n += !0 === i.isIReferenceRange || t.getKindAt(r) === C.Reference ? i.getStats().getAggregates().count ?? 0 : i.getRowCount() * i.getColumnCount();
|
|
5324
5329
|
}
|
|
5325
5330
|
return n;
|
|
5326
5331
|
}
|
|
@@ -5331,7 +5336,7 @@ function Dl(e) {
|
|
|
5331
5336
|
return e.getColumnCount() * e.getRowCount() - t;
|
|
5332
5337
|
}
|
|
5333
5338
|
function Ol(e, t) {
|
|
5334
|
-
return
|
|
5339
|
+
return U(e, t, void 0, (e) => e === null ? 1 : e + 1, ia);
|
|
5335
5340
|
}
|
|
5336
5341
|
function kl(e) {
|
|
5337
5342
|
return qo(v, e, (e) => e === null ? 1 : e + 1, void 0, 0, ia);
|
|
@@ -5371,10 +5376,10 @@ function Pl(e) {
|
|
|
5371
5376
|
return Kl(e, !0, hl);
|
|
5372
5377
|
}
|
|
5373
5378
|
function Fl(e, t, n) {
|
|
5374
|
-
return
|
|
5379
|
+
return U(e, t, n, K((e, t) => typeof t == "number" ? e === null ? t : Math.max(e, t) : e ?? 0), W);
|
|
5375
5380
|
}
|
|
5376
5381
|
function Il(e, t) {
|
|
5377
|
-
return qo(v, t,
|
|
5382
|
+
return qo(v, t, K((e, t) => typeof t == "number" ? e === null ? t : Math.max(e, t) : e), e, 0, W);
|
|
5378
5383
|
}
|
|
5379
5384
|
function Ll(e) {
|
|
5380
5385
|
let t = [];
|
|
@@ -5395,10 +5400,10 @@ function zl(e) {
|
|
|
5395
5400
|
return Kl(e, !1, hl);
|
|
5396
5401
|
}
|
|
5397
5402
|
function Bl(e, t, n) {
|
|
5398
|
-
return
|
|
5403
|
+
return U(e, t, n, K((e, t) => typeof t == "number" ? e === null ? t : Math.min(e, t) : e ?? 0), W);
|
|
5399
5404
|
}
|
|
5400
5405
|
function Vl(e, t) {
|
|
5401
|
-
return qo(v, t,
|
|
5406
|
+
return qo(v, t, K((e, t) => typeof t == "number" ? e === null ? t : Math.min(e, t) : e), e, 0, W);
|
|
5402
5407
|
}
|
|
5403
5408
|
function Hl(e, t) {
|
|
5404
5409
|
if (e = Math.trunc(e), t = Math.trunc(t), e < 0 || t < 0 || t > e || e > 2147483646) return NaN;
|
|
@@ -5439,7 +5444,7 @@ function Zl(e, t, n) {
|
|
|
5439
5444
|
return e < 0 ? 0 : e === 0 && t === 1 ? 1 / n : t >= 30 ? Math.exp(function(e, t) {
|
|
5440
5445
|
let n = t / e - 1;
|
|
5441
5446
|
return -e * n * n * (1 + zn(n) * n) / 2 - Math.log1p(n) - .5 * Math.log(e) - .5 * Math.log(2 * Math.PI) - An(e);
|
|
5442
|
-
}(t, e / n)) / n : Math.exp((t - 1) * Math.log(e) - e / n -
|
|
5447
|
+
}(t, e / n)) / n : Math.exp((t - 1) * Math.log(e) - e / n - I(t) - t * Math.log(n));
|
|
5443
5448
|
}
|
|
5444
5449
|
function Ql(e, t) {
|
|
5445
5450
|
return e < 0 ? 1 : ((e, t) => Bn(e, t, !0))(t / 2, e / 2);
|
|
@@ -5468,160 +5473,152 @@ var au = 1e5;
|
|
|
5468
5473
|
function ou(e, t) {
|
|
5469
5474
|
if (t < 0 || e % 1 != 0 || e < 0) return 0;
|
|
5470
5475
|
let n = e <= 170 ? t ** +e * Math.exp(-t) / Xo(e) : 1 / 0;
|
|
5471
|
-
return Number.isFinite(n) ? n : t === 0 ? +(e === 0) : Math.exp(e * Math.log(t) - t -
|
|
5476
|
+
return Number.isFinite(n) ? n : t === 0 ? +(e === 0) : Math.exp(e * Math.log(t) - t - I(e + 1));
|
|
5472
5477
|
}
|
|
5473
5478
|
var su = (e, t, n) => {
|
|
5474
5479
|
if (n === 0 || n === 1) return +(t * n === e);
|
|
5475
5480
|
let r = Zo(t, e) * n ** +e * (1 - n) ** (t - e);
|
|
5476
|
-
return Number.isFinite(r) ? r : Math.exp(
|
|
5481
|
+
return Number.isFinite(r) ? r : Math.exp(I(t + 1) - I(e + 1) - I(t - e + 1) + e * Math.log(n) + (t - e) * Math.log(1 - n));
|
|
5477
5482
|
};
|
|
5478
5483
|
function cu(e, t, n) {
|
|
5479
|
-
|
|
5480
|
-
if (e < 0) return 0;
|
|
5481
|
-
if (e >= t) return 1;
|
|
5482
|
-
if (n < 0 || n > 1 || t <= 0) return NaN;
|
|
5483
|
-
let a = n, o = (e = Math.floor(e)) + 1, s = t - e, c = o + s, l = Math.exp(F(c) - F(s) - F(o) + o * Math.log(a) + s * Math.log(1 - a));
|
|
5484
|
-
return r = a < (o + 1) / (c + 2) ? l * uu(a, o, s, i) : 1 - l * uu(1 - a, s, o, i), Math.round(1 / i * (1 - r)) / (1 / i);
|
|
5484
|
+
return e < 0 ? 0 : e >= t ? 1 : n < 0 || n > 1 || t <= 0 ? NaN : n === 0 ? 1 : n === 1 ? 0 : Wn(1 - n, n, t - (e = Math.floor(e)), e + 1);
|
|
5485
5485
|
}
|
|
5486
5486
|
function lu(e, t, n) {
|
|
5487
|
-
|
|
5488
|
-
|
|
5489
|
-
|
|
5490
|
-
|
|
5491
|
-
|
|
5492
|
-
|
|
5493
|
-
|
|
5494
|
-
|
|
5495
|
-
|
|
5496
|
-
|
|
5497
|
-
|
|
5498
|
-
|
|
5499
|
-
|
|
5500
|
-
|
|
5501
|
-
|
|
5502
|
-
|
|
5503
|
-
|
|
5504
|
-
|
|
5505
|
-
|
|
5506
|
-
|
|
5507
|
-
|
|
5508
|
-
|
|
5509
|
-
|
|
5510
|
-
|
|
5511
|
-
|
|
5512
|
-
|
|
5513
|
-
|
|
5514
|
-
|
|
5515
|
-
|
|
5516
|
-
|
|
5517
|
-
|
|
5518
|
-
|
|
5519
|
-
|
|
5520
|
-
|
|
5521
|
-
|
|
5522
|
-
|
|
5523
|
-
|
|
5524
|
-
|
|
5525
|
-
|
|
5526
|
-
|
|
5527
|
-
|
|
5528
|
-
|
|
5529
|
-
|
|
5530
|
-
|
|
5531
|
-
|
|
5532
|
-
|
|
5533
|
-
|
|
5534
|
-
|
|
5535
|
-
|
|
5536
|
-
|
|
5537
|
-
|
|
5538
|
-
|
|
5539
|
-
|
|
5540
|
-
|
|
5541
|
-
|
|
5542
|
-
|
|
5543
|
-
|
|
5544
|
-
|
|
5545
|
-
|
|
5546
|
-
|
|
5547
|
-
|
|
5548
|
-
|
|
5549
|
-
|
|
5550
|
-
|
|
5551
|
-
|
|
5552
|
-
|
|
5553
|
-
|
|
5554
|
-
|
|
5555
|
-
|
|
5556
|
-
|
|
5557
|
-
|
|
5558
|
-
|
|
5559
|
-
|
|
5560
|
-
|
|
5561
|
-
|
|
5562
|
-
|
|
5563
|
-
|
|
5564
|
-
|
|
5565
|
-
|
|
5566
|
-
|
|
5567
|
-
|
|
5568
|
-
|
|
5569
|
-
|
|
5570
|
-
|
|
5571
|
-
|
|
5572
|
-
|
|
5573
|
-
|
|
5574
|
-
|
|
5575
|
-
|
|
5576
|
-
|
|
5577
|
-
|
|
5578
|
-
|
|
5579
|
-
|
|
5580
|
-
|
|
5581
|
-
|
|
5582
|
-
|
|
5583
|
-
|
|
5584
|
-
|
|
5585
|
-
|
|
5586
|
-
|
|
5587
|
-
|
|
5588
|
-
|
|
5589
|
-
|
|
5590
|
-
|
|
5591
|
-
|
|
5592
|
-
|
|
5593
|
-
|
|
5594
|
-
|
|
5595
|
-
|
|
5596
|
-
|
|
5597
|
-
|
|
5598
|
-
|
|
5599
|
-
|
|
5600
|
-
|
|
5601
|
-
|
|
5602
|
-
|
|
5603
|
-
|
|
5604
|
-
|
|
5605
|
-
|
|
5606
|
-
|
|
5607
|
-
|
|
5608
|
-
|
|
5609
|
-
|
|
5610
|
-
|
|
5611
|
-
ZTEST: () => Nf,
|
|
5612
|
-
Z_TEST: () => Mf
|
|
5613
|
-
}), J = 1e10, fu = 22250738585072014e-324, pu = (e) => ((e) => {
|
|
5487
|
+
if (e !== e >>> 0 || e < 0) return 0;
|
|
5488
|
+
let r = Zo(e + t - 1, t - 1) * (1 - n) ** e * n ** +t;
|
|
5489
|
+
return Number.isFinite(r) ? r : Math.exp(I(e + t) - I(e + 1) - I(t) + e * Math.log1p(-n) + t * Math.log(n));
|
|
5490
|
+
}
|
|
5491
|
+
var uu = w({
|
|
5492
|
+
BETADIST: () => vu,
|
|
5493
|
+
BETAINV: () => bu,
|
|
5494
|
+
BETA_DIST: () => _u,
|
|
5495
|
+
BETA_INV: () => yu,
|
|
5496
|
+
BINOMDIST: () => Su,
|
|
5497
|
+
BINOM_DIST: () => xu,
|
|
5498
|
+
BINOM_DIST_RANGE: () => Cu,
|
|
5499
|
+
BINOM_INV: () => Tu,
|
|
5500
|
+
CHIDIST: () => Du,
|
|
5501
|
+
CHIINV: () => Au,
|
|
5502
|
+
CHISQ_DIST: () => Eu,
|
|
5503
|
+
CHISQ_DIST_RT: () => Ou,
|
|
5504
|
+
CHISQ_INV: () => ku,
|
|
5505
|
+
CHISQ_INV_RT: () => ju,
|
|
5506
|
+
CHISQ_TEST: () => Mu,
|
|
5507
|
+
CHITEST: () => Nu,
|
|
5508
|
+
CONFIDENCE: () => Fu,
|
|
5509
|
+
CONFIDENCE_NORM: () => Pu,
|
|
5510
|
+
CONFIDENCE_T: () => Iu,
|
|
5511
|
+
CORREL: () => Lu,
|
|
5512
|
+
COVAR: () => Ru,
|
|
5513
|
+
COVARIANCE_P: () => zu,
|
|
5514
|
+
COVARIANCE_S: () => Bu,
|
|
5515
|
+
CRITBINOM: () => Vu,
|
|
5516
|
+
DEVSQ: () => Hu,
|
|
5517
|
+
EXPONDIST: () => Wu,
|
|
5518
|
+
EXPON_DIST: () => Uu,
|
|
5519
|
+
FDIST: () => Ku,
|
|
5520
|
+
FINV: () => Yu,
|
|
5521
|
+
FISHER: () => $u,
|
|
5522
|
+
FISHERINV: () => ed,
|
|
5523
|
+
FORECAST: () => td,
|
|
5524
|
+
FORECAST_LINEAR: () => nd,
|
|
5525
|
+
FREQUENCY: () => rd,
|
|
5526
|
+
FTEST: () => Qu,
|
|
5527
|
+
F_DIST: () => Gu,
|
|
5528
|
+
F_DIST_RT: () => qu,
|
|
5529
|
+
F_INV: () => Ju,
|
|
5530
|
+
F_INV_RT: () => Xu,
|
|
5531
|
+
F_TEST: () => Zu,
|
|
5532
|
+
GAMMA: () => id,
|
|
5533
|
+
GAMMADIST: () => od,
|
|
5534
|
+
GAMMAINV: () => cd,
|
|
5535
|
+
GAMMALN: () => ld,
|
|
5536
|
+
GAMMALN_PRECISE: () => ud,
|
|
5537
|
+
GAMMA_DIST: () => ad,
|
|
5538
|
+
GAMMA_INV: () => sd,
|
|
5539
|
+
GAUSS: () => dd,
|
|
5540
|
+
GEOMEAN: () => fd,
|
|
5541
|
+
HARMEAN: () => pd,
|
|
5542
|
+
HYPGEOMDIST: () => hd,
|
|
5543
|
+
HYPGEOM_DIST: () => md,
|
|
5544
|
+
INTERCEPT: () => gd,
|
|
5545
|
+
KURT: () => _d,
|
|
5546
|
+
LOGINV: () => xd,
|
|
5547
|
+
LOGNORMDIST: () => yd,
|
|
5548
|
+
LOGNORM_DIST: () => vd,
|
|
5549
|
+
LOGNORM_INV: () => bd,
|
|
5550
|
+
MODE: () => Cd,
|
|
5551
|
+
MODE_MULT: () => Td,
|
|
5552
|
+
MODE_SNGL: () => Ed,
|
|
5553
|
+
NEGBINOMDIST: () => Od,
|
|
5554
|
+
NEGBINOM_DIST: () => Dd,
|
|
5555
|
+
NORMDIST: () => Ad,
|
|
5556
|
+
NORMINV: () => Md,
|
|
5557
|
+
NORMSDIST: () => Pd,
|
|
5558
|
+
NORMSINV: () => Id,
|
|
5559
|
+
NORM_DIST: () => kd,
|
|
5560
|
+
NORM_INV: () => jd,
|
|
5561
|
+
NORM_S_DIST: () => Nd,
|
|
5562
|
+
NORM_S_INV: () => Fd,
|
|
5563
|
+
PEARSON: () => Ld,
|
|
5564
|
+
PERCENTILE: () => Rd,
|
|
5565
|
+
PERCENTILE_EXC: () => zd,
|
|
5566
|
+
PERCENTILE_INC: () => Bd,
|
|
5567
|
+
PERCENTRANK: () => Vd,
|
|
5568
|
+
PERCENTRANK_EXC: () => Hd,
|
|
5569
|
+
PERCENTRANK_INC: () => Ud,
|
|
5570
|
+
PHI: () => Wd,
|
|
5571
|
+
POISSON: () => Kd,
|
|
5572
|
+
POISSON_DIST: () => Gd,
|
|
5573
|
+
PROB: () => qd,
|
|
5574
|
+
QUARTILE: () => Jd,
|
|
5575
|
+
QUARTILE_EXC: () => Yd,
|
|
5576
|
+
QUARTILE_INC: () => Xd,
|
|
5577
|
+
RANK: () => Zd,
|
|
5578
|
+
RANK_AVG: () => Qd,
|
|
5579
|
+
RANK_EQ: () => $d,
|
|
5580
|
+
RSQ: () => ef,
|
|
5581
|
+
SKEW: () => tf,
|
|
5582
|
+
SKEW_P: () => nf,
|
|
5583
|
+
SLOPE: () => rf,
|
|
5584
|
+
STANDARDIZE: () => af,
|
|
5585
|
+
STDEV: () => sf,
|
|
5586
|
+
STDEVA: () => uf,
|
|
5587
|
+
STDEVP: () => lf,
|
|
5588
|
+
STDEVPA: () => df,
|
|
5589
|
+
STDEV_P: () => cf,
|
|
5590
|
+
STDEV_S: () => of,
|
|
5591
|
+
STEYX: () => ff,
|
|
5592
|
+
TDIST: () => mf,
|
|
5593
|
+
TINV: () => vf,
|
|
5594
|
+
TRIMMEAN: () => bf,
|
|
5595
|
+
T_DIST: () => pf,
|
|
5596
|
+
T_DIST_2T: () => hf,
|
|
5597
|
+
T_DIST_RT: () => gf,
|
|
5598
|
+
T_INV: () => _f,
|
|
5599
|
+
T_INV_2T: () => yf,
|
|
5600
|
+
VAR: () => Tf,
|
|
5601
|
+
VARA: () => Df,
|
|
5602
|
+
VARP: () => Cf,
|
|
5603
|
+
VARPA: () => Of,
|
|
5604
|
+
VAR_P: () => Sf,
|
|
5605
|
+
VAR_S: () => wf,
|
|
5606
|
+
WEIBULL: () => Af,
|
|
5607
|
+
WEIBULL_DIST: () => kf,
|
|
5608
|
+
ZTEST: () => Mf,
|
|
5609
|
+
Z_TEST: () => jf
|
|
5610
|
+
}), Y = 1e10, du = 22250738585072014e-324, fu = (e) => ((e) => {
|
|
5614
5611
|
let t = 0;
|
|
5615
5612
|
for (let n = 0; n < e.length; n++) t += e[n];
|
|
5616
5613
|
return t;
|
|
5617
|
-
})(e) / e.length,
|
|
5618
|
-
let n =
|
|
5614
|
+
})(e) / e.length, pu = (e) => Math.exp(fu(e.map(Math.log))), mu = (e, t) => {
|
|
5615
|
+
let n = fu(e), r = 0;
|
|
5619
5616
|
for (let t = 0; t < e.length; t++) {
|
|
5620
5617
|
let i = e[t] - n;
|
|
5621
5618
|
r += i * i;
|
|
5622
5619
|
}
|
|
5623
5620
|
return Math.sqrt(r / (e.length - +!!t));
|
|
5624
|
-
},
|
|
5621
|
+
}, hu = 2 ** -22, gu = (e, t, n) => {
|
|
5625
5622
|
let r = 0, i = Math.floor(e);
|
|
5626
5623
|
for (; r < i;) {
|
|
5627
5624
|
let a = r + Math.floor((i - r) / 2), o = cu(a, e, t) > n, s = o ? r : a + 1, c = o ? a : i;
|
|
@@ -5630,61 +5627,61 @@ var du = C({
|
|
|
5630
5627
|
}
|
|
5631
5628
|
return cu(r, e, t) > n ? r : NaN;
|
|
5632
5629
|
};
|
|
5633
|
-
function
|
|
5630
|
+
function _u(e, t, n, r, i = 0, a = 1) {
|
|
5634
5631
|
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) : Un(e, t, n))(e, t, n) : function(e, t, n) {
|
|
5635
5632
|
return e > 1 || e < 0 ? 0 : t === 1 && n === 1 ? 1 : t < 512 && n < 512 ? e ** (t - 1) * (1 - e) ** (n - 1) / On(t, n) : Math.exp((t - 1) * Math.log(e) + (n - 1) * Math.log(1 - e) - jn(t, n));
|
|
5636
5633
|
}(e, t, n) / (a - i));
|
|
5637
5634
|
}
|
|
5638
|
-
function
|
|
5639
|
-
return
|
|
5635
|
+
function vu(e, t, n, r = 0, i = 1) {
|
|
5636
|
+
return _u(e, t, n, !0, r, i);
|
|
5640
5637
|
}
|
|
5641
|
-
function
|
|
5638
|
+
function yu(e, t, n, r = 0, i = 1) {
|
|
5642
5639
|
return t <= 0 || n <= 0 || e <= 0 || e >= 1 || r >= i ? NaN : ((e, t, n) => Kn(e, t, n))(e, t, n) * (i - r) + r;
|
|
5643
5640
|
}
|
|
5644
|
-
function
|
|
5645
|
-
return
|
|
5641
|
+
function bu(e, t, n, r = 0, i = 1) {
|
|
5642
|
+
return yu(e, t, n, r, i);
|
|
5646
5643
|
}
|
|
5647
|
-
function
|
|
5644
|
+
function xu(e, t, n, r) {
|
|
5648
5645
|
return e = Math.trunc(e), (t = Math.trunc(t)) < 0 || n < 0 || n > 1 || e < 0 || e > t || t > 2147483646 ? NaN : r ? cu(e, t, n) : su(e, t, n);
|
|
5649
5646
|
}
|
|
5650
|
-
function
|
|
5651
|
-
return
|
|
5647
|
+
function Su(e, t, n, r) {
|
|
5648
|
+
return xu(e, t, n, r);
|
|
5652
5649
|
}
|
|
5653
|
-
function
|
|
5650
|
+
function Cu(e, t, n, r = n) {
|
|
5654
5651
|
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;
|
|
5655
|
-
if (r - n >
|
|
5652
|
+
if (r - n > wu) return cu(r, e, t) - (n > 0 ? cu(n - 1, e, t) : 0);
|
|
5656
5653
|
let i = 0;
|
|
5657
5654
|
for (let a = n; a <= r; a++) i += su(a, e, t);
|
|
5658
5655
|
return i;
|
|
5659
5656
|
}
|
|
5660
|
-
var
|
|
5661
|
-
function
|
|
5662
|
-
return (e = Math.floor(e)) < 0 || e > 2147483646 || t <= 0 || t >= 1 || n <= 0 || n >= 1 ? NaN :
|
|
5657
|
+
var wu = 1e5;
|
|
5658
|
+
function Tu(e, t, n) {
|
|
5659
|
+
return (e = Math.floor(e)) < 0 || e > 2147483646 || t <= 0 || t >= 1 || n <= 0 || n >= 1 ? NaN : gu(e, t, n);
|
|
5663
5660
|
}
|
|
5664
|
-
function
|
|
5665
|
-
return t = Math.trunc(t), e < 0 || t < 1 || t >
|
|
5661
|
+
function Eu(e, t, n) {
|
|
5662
|
+
return t = Math.trunc(t), e < 0 || t < 1 || t > Y ? NaN : n ? function(e, t) {
|
|
5666
5663
|
return e < 0 ? 0 : Ln(t / 2, e / 2);
|
|
5667
5664
|
}(e, t) : function(e, t) {
|
|
5668
|
-
return e < 0 ? 0 : e === 0 && t === 2 ? .5 : Math.exp((t / 2 - 1) * Math.log(e) - e / 2 - t / 2 * Math.log(2) -
|
|
5665
|
+
return e < 0 ? 0 : e === 0 && t === 2 ? .5 : Math.exp((t / 2 - 1) * Math.log(e) - e / 2 - t / 2 * Math.log(2) - I(t / 2));
|
|
5669
5666
|
}(e, t);
|
|
5670
5667
|
}
|
|
5668
|
+
function Du(e, t) {
|
|
5669
|
+
return Ou(e, t);
|
|
5670
|
+
}
|
|
5671
5671
|
function Ou(e, t) {
|
|
5672
|
-
return
|
|
5672
|
+
return t = Math.trunc(t), e < 0 || t < 1 || t > Y ? NaN : Ql(e, t);
|
|
5673
5673
|
}
|
|
5674
5674
|
function ku(e, t) {
|
|
5675
|
-
return t = Math.trunc(t), e < 0 || t < 1 || t >
|
|
5675
|
+
return t = Math.trunc(t), e < 0 || e >= 1 || t < 1 || t > Y ? NaN : $l(e, t);
|
|
5676
5676
|
}
|
|
5677
5677
|
function Au(e, t) {
|
|
5678
|
-
return
|
|
5678
|
+
return ju(e, t);
|
|
5679
5679
|
}
|
|
5680
5680
|
function ju(e, t) {
|
|
5681
|
-
return
|
|
5681
|
+
return t = Math.trunc(t), e <= 0 || e > 1 || t < 1 || t > Y ? NaN : $l(1 - e, t);
|
|
5682
5682
|
}
|
|
5683
5683
|
function Mu(e, t) {
|
|
5684
|
-
|
|
5685
|
-
}
|
|
5686
|
-
function Nu(e, t) {
|
|
5687
|
-
let n = Y(e) ?? Y(t);
|
|
5684
|
+
let n = Pf(e) ?? Pf(t);
|
|
5688
5685
|
if (n) return n;
|
|
5689
5686
|
let r = e.getRowCount(), i = e.getColumnCount();
|
|
5690
5687
|
if (r * i !== t.getRowCount() * t.getColumnCount()) throw y.BuiltIn.NA;
|
|
@@ -5701,86 +5698,86 @@ function Nu(e, t) {
|
|
|
5701
5698
|
o += (e - t) ** 2 / t, s++;
|
|
5702
5699
|
}
|
|
5703
5700
|
}
|
|
5704
|
-
return s === 0 ? y.BuiltIn.Div0 : Number.isFinite(o) ?
|
|
5701
|
+
return s === 0 ? y.BuiltIn.Div0 : Number.isFinite(o) ? Ou(o, a) : y.BuiltIn.Num;
|
|
5705
5702
|
}
|
|
5706
|
-
function
|
|
5707
|
-
return
|
|
5703
|
+
function Nu(e, t) {
|
|
5704
|
+
return Mu(e, t);
|
|
5708
5705
|
}
|
|
5709
|
-
function
|
|
5706
|
+
function Pu(e, t, n) {
|
|
5710
5707
|
return n = Math.trunc(n), e <= 0 || e >= 1 || t <= 0 || n < 1 || 1 - e / 2 == 1 ? NaN : function(e, t, n) {
|
|
5711
5708
|
return 1 + Math.abs(Xl(e / 2, 0, 1) * t / Math.sqrt(n)) - 1;
|
|
5712
5709
|
}(e, t, n);
|
|
5713
5710
|
}
|
|
5714
|
-
function
|
|
5715
|
-
return
|
|
5711
|
+
function Fu(e, t, n) {
|
|
5712
|
+
return Pu(e, t, n);
|
|
5716
5713
|
}
|
|
5717
|
-
function
|
|
5714
|
+
function Iu(e, t, n) {
|
|
5718
5715
|
if (n = Math.trunc(n), e <= 0 || e >= 1 || t <= 0 || n < 1) return NaN;
|
|
5719
5716
|
if (n === 1) throw y.BuiltIn.Div0;
|
|
5720
|
-
return n - 1 >
|
|
5717
|
+
return n - 1 > Y || e / 2 < du ? NaN : function(e, t, n) {
|
|
5721
5718
|
return 1 + Math.abs(iu(e / 2, n - 1) * t / Math.sqrt(n)) - 1;
|
|
5722
5719
|
}(e, t, n);
|
|
5723
5720
|
}
|
|
5724
|
-
function
|
|
5721
|
+
function Lu(e, t) {
|
|
5725
5722
|
let n = X(e, t);
|
|
5726
5723
|
return y.isError(n) ? n : n === null ? y.BuiltIn.NA : Number.isFinite(n.ssX) && Number.isFinite(n.ssY) ? n.ssX === 0 || n.ssY === 0 ? y.BuiltIn.Div0 : n.ssXY / Math.sqrt(n.ssX * n.ssY) : y.BuiltIn.Num;
|
|
5727
5724
|
}
|
|
5728
|
-
function
|
|
5729
|
-
return
|
|
5725
|
+
function Ru(e, t) {
|
|
5726
|
+
return zu(e, t);
|
|
5730
5727
|
}
|
|
5731
|
-
function
|
|
5728
|
+
function zu(e, t) {
|
|
5732
5729
|
let n = X(e, t);
|
|
5733
5730
|
return y.isError(n) ? n : n === null ? y.BuiltIn.NA : n.n === 0 ? y.BuiltIn.Div0 : Number.isFinite(n.ssXY) ? n.ssXY / n.n : y.BuiltIn.Num;
|
|
5734
5731
|
}
|
|
5735
|
-
function
|
|
5732
|
+
function Bu(e, t) {
|
|
5736
5733
|
let n = X(e, t);
|
|
5737
5734
|
return y.isError(n) ? n : n === null ? y.BuiltIn.NA : n.n <= 1 ? y.BuiltIn.Div0 : Number.isFinite(n.ssXY) ? n.ssXY / (n.n - 1) : y.BuiltIn.Num;
|
|
5738
5735
|
}
|
|
5739
|
-
function
|
|
5740
|
-
return
|
|
5736
|
+
function Vu(e, t, n) {
|
|
5737
|
+
return Tu(e, t, n);
|
|
5741
5738
|
}
|
|
5742
|
-
function
|
|
5739
|
+
function Hu(e) {
|
|
5743
5740
|
let t = 0, n = [];
|
|
5744
5741
|
for (let r of e) for (let e of r.values()) t += e, n.push(e);
|
|
5745
5742
|
let r = n.length;
|
|
5746
5743
|
if (r === 0) throw y.BuiltIn.Num;
|
|
5747
5744
|
let i = t / r;
|
|
5748
5745
|
t = 0;
|
|
5749
|
-
for (let e = 0; e < r; e++) t +=
|
|
5746
|
+
for (let e = 0; e < r; e++) t += T((n[e] - i) ** 2);
|
|
5750
5747
|
return t;
|
|
5751
5748
|
}
|
|
5752
|
-
function
|
|
5749
|
+
function Uu(e, t, n) {
|
|
5753
5750
|
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;
|
|
5754
5751
|
}
|
|
5755
|
-
function
|
|
5756
|
-
return
|
|
5752
|
+
function Wu(e, t, n) {
|
|
5753
|
+
return Uu(e, t, n);
|
|
5757
5754
|
}
|
|
5758
|
-
function
|
|
5759
|
-
return e < 0 || t < 1 || n < 1 ? NaN : (t = Math.trunc(t), n = Math.trunc(n), t >
|
|
5755
|
+
function Gu(e, t, n, r) {
|
|
5756
|
+
return e < 0 || t < 1 || n < 1 ? NaN : (t = Math.trunc(t), n = Math.trunc(n), t > Y || n > Y ? NaN : r ? eu(e, t, n) : function(e, t, n) {
|
|
5760
5757
|
return e < 0 ? 0 : e === 0 && t < 2 ? 1 / 0 : e === 0 && t === 2 ? 1 : t < 512 && n < 512 ? 1 / On(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) - jn(t / 2, n / 2));
|
|
5761
5758
|
}(e, t, n));
|
|
5762
5759
|
}
|
|
5763
|
-
function
|
|
5764
|
-
return
|
|
5760
|
+
function Ku(e, t, n) {
|
|
5761
|
+
return qu(e, t, n);
|
|
5765
5762
|
}
|
|
5766
|
-
function
|
|
5767
|
-
return e < 0 || t < 1 || n < 1 ? NaN : (t = Math.trunc(t), n = Math.trunc(n), t >
|
|
5763
|
+
function qu(e, t, n) {
|
|
5764
|
+
return e < 0 || t < 1 || n < 1 ? NaN : (t = Math.trunc(t), n = Math.trunc(n), t > Y || n > Y ? NaN : function(e, t, n) {
|
|
5768
5765
|
if (e < 0) return 1;
|
|
5769
5766
|
let r = t * e + n;
|
|
5770
5767
|
return Wn(n / r, t * e / r, n / 2, t / 2);
|
|
5771
5768
|
}(e, t, n));
|
|
5772
5769
|
}
|
|
5770
|
+
function Ju(e, t, n) {
|
|
5771
|
+
return e < 0 || e > 1 || t < 1 || n < 1 ? NaN : (t = Math.trunc(t), n = Math.trunc(n), t > Y || n > Y ? NaN : tu(e, t, n));
|
|
5772
|
+
}
|
|
5773
5773
|
function Yu(e, t, n) {
|
|
5774
|
-
return
|
|
5774
|
+
return Xu(e, t, n);
|
|
5775
5775
|
}
|
|
5776
5776
|
function Xu(e, t, n) {
|
|
5777
|
-
return
|
|
5778
|
-
}
|
|
5779
|
-
function Zu(e, t, n) {
|
|
5780
|
-
return e < 0 || e > 1 || t < 1 || n < 1 ? NaN : (t = Math.trunc(t), n = Math.trunc(n), t > J || n > J ? NaN : tu(1 - e, t, n));
|
|
5777
|
+
return e < 0 || e > 1 || t < 1 || n < 1 ? NaN : (t = Math.trunc(t), n = Math.trunc(n), t > Y || n > Y ? NaN : tu(1 - e, t, n));
|
|
5781
5778
|
}
|
|
5782
|
-
function
|
|
5783
|
-
let n =
|
|
5779
|
+
function Zu(e, t) {
|
|
5780
|
+
let n = Pf(e) ?? Pf(t);
|
|
5784
5781
|
if (n) return n;
|
|
5785
5782
|
if (e.hasError()) return Yo(e);
|
|
5786
5783
|
if (t.hasError()) return Yo(t);
|
|
@@ -5797,25 +5794,25 @@ function Qu(e, t) {
|
|
|
5797
5794
|
for (let e = 0; e < r.length; e++) s += (a - r[e]) ** 2;
|
|
5798
5795
|
s /= r.length - 1;
|
|
5799
5796
|
for (let e = 0; e < i.length; e++) c += (o - i[e]) ** 2;
|
|
5800
|
-
if (c /= i.length - 1, s =
|
|
5797
|
+
if (c /= i.length - 1, s = T(s), c = T(c), s === 0 || c === 0) return y.BuiltIn.Div0;
|
|
5801
5798
|
if (!Number.isFinite(s) || !Number.isFinite(c)) return y.BuiltIn.Num;
|
|
5802
5799
|
let l = eu(s / c, r.length - 1, i.length - 1);
|
|
5803
5800
|
return 2 * Math.min(l, 1 - l);
|
|
5804
5801
|
}
|
|
5805
|
-
function
|
|
5806
|
-
return
|
|
5802
|
+
function Qu(e, t) {
|
|
5803
|
+
return Zu(e, t);
|
|
5807
5804
|
}
|
|
5808
|
-
function
|
|
5805
|
+
function $u(e) {
|
|
5809
5806
|
return e > -1 && e < 1 ? Math.log((1 + e) / (1 - e)) / 2 : NaN;
|
|
5810
5807
|
}
|
|
5811
|
-
function
|
|
5808
|
+
function ed(e) {
|
|
5812
5809
|
let t = Math.exp(2 * e);
|
|
5813
5810
|
return t === Infinity ? 1 : (t - 1) / (t + 1);
|
|
5814
5811
|
}
|
|
5815
|
-
function
|
|
5816
|
-
return
|
|
5812
|
+
function td(e, t, n) {
|
|
5813
|
+
return nd(e, t, n);
|
|
5817
5814
|
}
|
|
5818
|
-
function
|
|
5815
|
+
function nd(e, t, n) {
|
|
5819
5816
|
let r = X(t, n);
|
|
5820
5817
|
if (y.isError(r)) return r;
|
|
5821
5818
|
if (r === null) return y.BuiltIn.NA;
|
|
@@ -5824,7 +5821,7 @@ function rd(e, t, n) {
|
|
|
5824
5821
|
let i = r.ssXY / r.ssX, a = r.yMean - i * r.xMean + i * e;
|
|
5825
5822
|
return Number.isFinite(a) ? a : y.BuiltIn.Num;
|
|
5826
5823
|
}
|
|
5827
|
-
function
|
|
5824
|
+
function rd(e, t) {
|
|
5828
5825
|
if (e = v.flattenAreas(e), t = v.flattenAreas(t), e.hasError()) throw e.firstError();
|
|
5829
5826
|
let n = [];
|
|
5830
5827
|
for (let e of t.values()) typeof e == "number" && n.push(e);
|
|
@@ -5846,42 +5843,42 @@ function id(e, t) {
|
|
|
5846
5843
|
for (let e = 0; e < r.length; e++) r[e] > o && s++;
|
|
5847
5844
|
return a[n.length][0] = s, a;
|
|
5848
5845
|
}
|
|
5849
|
-
function
|
|
5846
|
+
function id(e) {
|
|
5850
5847
|
return e === 0 || e < 0 && e === Math.trunc(e) ? NaN : Dn(e);
|
|
5851
5848
|
}
|
|
5852
|
-
function
|
|
5853
|
-
return e < 0 || t <= 0 || n <= 0 ? NaN : Number.isFinite(
|
|
5849
|
+
function ad(e, t, n, r) {
|
|
5850
|
+
return e < 0 || t <= 0 || n <= 0 ? NaN : Number.isFinite(I(t)) && Number.isFinite(e / n * 2) ? r ? function(e, t, n) {
|
|
5854
5851
|
return e < 0 ? 0 : Ln(t, e / n);
|
|
5855
5852
|
}(e, t, n) : Zl(e, t, n) : NaN;
|
|
5856
5853
|
}
|
|
5857
|
-
function
|
|
5858
|
-
return
|
|
5854
|
+
function od(e, t, n, r) {
|
|
5855
|
+
return ad(e, t, n, r);
|
|
5859
5856
|
}
|
|
5860
|
-
function
|
|
5857
|
+
function sd(e, t, n) {
|
|
5861
5858
|
return e < 0 || e >= 1 || t <= 0 || n <= 0 ? NaN : (r = n, Vn(e, t) * r);
|
|
5862
5859
|
var r;
|
|
5863
5860
|
}
|
|
5864
|
-
function
|
|
5865
|
-
return
|
|
5861
|
+
function cd(e, t, n) {
|
|
5862
|
+
return sd(e, t, n);
|
|
5863
|
+
}
|
|
5864
|
+
function ld(e) {
|
|
5865
|
+
return e <= 0 ? NaN : I(e);
|
|
5866
5866
|
}
|
|
5867
5867
|
function ud(e) {
|
|
5868
|
-
return e <= 0 ? NaN :
|
|
5868
|
+
return e <= 0 ? NaN : I(e);
|
|
5869
5869
|
}
|
|
5870
5870
|
function dd(e) {
|
|
5871
|
-
return e <= 0 ? NaN : F(e);
|
|
5872
|
-
}
|
|
5873
|
-
function fd(e) {
|
|
5874
5871
|
return Yl(e, 0, 1) - .5;
|
|
5875
5872
|
}
|
|
5876
|
-
function
|
|
5873
|
+
function fd(e) {
|
|
5877
5874
|
let t = [];
|
|
5878
5875
|
for (let n of e) for (let e of n.values()) {
|
|
5879
5876
|
if (e <= 0) return NaN;
|
|
5880
5877
|
t.push(e);
|
|
5881
5878
|
}
|
|
5882
|
-
return
|
|
5879
|
+
return pu(t);
|
|
5883
5880
|
}
|
|
5884
|
-
function
|
|
5881
|
+
function pd(e) {
|
|
5885
5882
|
let t = 0, n = 0;
|
|
5886
5883
|
for (let r of e) for (let e of r.values()) {
|
|
5887
5884
|
if (e <= 0) return NaN;
|
|
@@ -5890,14 +5887,14 @@ function md(e) {
|
|
|
5890
5887
|
if (t === 0) throw y.BuiltIn.NA;
|
|
5891
5888
|
return t / n;
|
|
5892
5889
|
}
|
|
5893
|
-
function
|
|
5890
|
+
function md(e, t, n, r, i) {
|
|
5894
5891
|
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;
|
|
5895
5892
|
let a = (e) => {
|
|
5896
5893
|
if (e > t || e > n || t - e > r - n) return 0;
|
|
5897
5894
|
let i = cs(n, e) * cs(r - n, t - e) / cs(r, t);
|
|
5898
5895
|
if (Number.isFinite(i)) return i;
|
|
5899
5896
|
if (r > 2147483646) return NaN;
|
|
5900
|
-
let a = (e, t) =>
|
|
5897
|
+
let a = (e, t) => I(e + 1) - I(t + 1) - I(e - t + 1);
|
|
5901
5898
|
return Math.exp(a(n, e) + a(r - n, t - e) - a(r, t));
|
|
5902
5899
|
};
|
|
5903
5900
|
if (!i) return a(e);
|
|
@@ -5905,10 +5902,10 @@ function hd(e, t, n, r, i) {
|
|
|
5905
5902
|
for (let e = 0; e <= s; e++) o += a(e);
|
|
5906
5903
|
return o;
|
|
5907
5904
|
}
|
|
5908
|
-
function
|
|
5909
|
-
return
|
|
5905
|
+
function hd(e, t, n, r) {
|
|
5906
|
+
return md(e, t, n, r, !1);
|
|
5910
5907
|
}
|
|
5911
|
-
function
|
|
5908
|
+
function gd(e, t) {
|
|
5912
5909
|
let n = X(e, t);
|
|
5913
5910
|
if (y.isError(n)) return n;
|
|
5914
5911
|
if (n === null) return y.BuiltIn.NA;
|
|
@@ -5917,7 +5914,7 @@ function _d(e, t) {
|
|
|
5917
5914
|
let r = n.ssXY / n.ssX, i = n.yMean - r * n.xMean;
|
|
5918
5915
|
return Number.isFinite(i) ? i : y.BuiltIn.Num;
|
|
5919
5916
|
}
|
|
5920
|
-
function
|
|
5917
|
+
function _d(e) {
|
|
5921
5918
|
let t = 0, n = [];
|
|
5922
5919
|
for (let r of e) for (let e of r.values()) t += e, n.push(e);
|
|
5923
5920
|
let r = n.length;
|
|
@@ -5925,31 +5922,31 @@ function vd(e) {
|
|
|
5925
5922
|
t /= r;
|
|
5926
5923
|
let i = 0;
|
|
5927
5924
|
for (let e = 0; e < r; e++) i += (n[e] - t) ** 4;
|
|
5928
|
-
let a =
|
|
5925
|
+
let a = mu(n, !0);
|
|
5929
5926
|
if (a === 0) throw y.BuiltIn.Div0;
|
|
5930
5927
|
return i /= a ** 4, r * (r + 1) / ((r - 1) * (r - 2) * (r - 3)) * i - 3 * (r - 1) * (r - 1) / ((r - 2) * (r - 3));
|
|
5931
5928
|
}
|
|
5932
|
-
function
|
|
5929
|
+
function vd(e, t, n, r) {
|
|
5933
5930
|
return e <= 0 || n <= 0 ? NaN : r ? function(e, t, n) {
|
|
5934
5931
|
return e < 0 ? 0 : .5 * Fn(-(Math.log(e) - t) / Math.sqrt(2 * n * n));
|
|
5935
5932
|
}(e, t, n) : function(e, t, n) {
|
|
5936
5933
|
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));
|
|
5937
5934
|
}(e, t, n);
|
|
5938
5935
|
}
|
|
5939
|
-
function
|
|
5940
|
-
return
|
|
5936
|
+
function yd(e, t, n) {
|
|
5937
|
+
return vd(e, t, n, !0);
|
|
5941
5938
|
}
|
|
5942
|
-
function
|
|
5939
|
+
function bd(e, t, n) {
|
|
5943
5940
|
return e <= 0 || e >= 1 || n <= 0 ? NaN : (r = e, i = t, a = n, Math.exp(-1.4142135623730951 * a * In(2 * r) + i));
|
|
5944
5941
|
var r, i, a;
|
|
5945
5942
|
}
|
|
5946
|
-
function
|
|
5947
|
-
return
|
|
5943
|
+
function xd(e, t, n) {
|
|
5944
|
+
return bd(e, t, n);
|
|
5948
5945
|
}
|
|
5949
|
-
var
|
|
5946
|
+
var Sd = () => {
|
|
5950
5947
|
let e = v.getArgs().getRepeatingArgsAt(0);
|
|
5951
5948
|
for (let t = 0; t < e.getLength(); t++) {
|
|
5952
|
-
if (e.getKindAt(t) ===
|
|
5949
|
+
if (e.getKindAt(t) === C.Reference) {
|
|
5953
5950
|
let n = e.getRawAt(t);
|
|
5954
5951
|
if (Array.isArray(n) && n.isSheetSpan) return y.BuiltIn.Ref;
|
|
5955
5952
|
}
|
|
@@ -5957,17 +5954,17 @@ var Cd = () => {
|
|
|
5957
5954
|
}
|
|
5958
5955
|
return null;
|
|
5959
5956
|
};
|
|
5960
|
-
function
|
|
5961
|
-
return
|
|
5957
|
+
function Cd(e) {
|
|
5958
|
+
return Ed(e);
|
|
5962
5959
|
}
|
|
5963
|
-
var
|
|
5960
|
+
var wd = (e) => {
|
|
5964
5961
|
for (let t of e) if (t.size === 1 && pl(t) && t.entries({ includeEmpty: !1 }).next().done) throw y.BuiltIn.Value;
|
|
5965
5962
|
};
|
|
5966
|
-
function
|
|
5967
|
-
let t =
|
|
5963
|
+
function Td(e) {
|
|
5964
|
+
let t = Sd();
|
|
5968
5965
|
if (t) throw t;
|
|
5969
5966
|
for (let t of e) if (t.hasError()) throw t.firstError();
|
|
5970
|
-
|
|
5967
|
+
wd(e);
|
|
5971
5968
|
let n = /* @__PURE__ */ new Map(), r = 0;
|
|
5972
5969
|
for (let t of e) {
|
|
5973
5970
|
let e = t.entries({ includeEmpty: !1 }), i = e.next();
|
|
@@ -5988,10 +5985,10 @@ function Ed(e) {
|
|
|
5988
5985
|
let a = [...n.entries()].filter(([, { count: e }]) => e === i).sort((e, t) => e[1].firstSeen - t[1].firstSeen).map(([e]) => [e]);
|
|
5989
5986
|
return a.length === 0 ? y.BuiltIn.NA : a;
|
|
5990
5987
|
}
|
|
5991
|
-
function
|
|
5992
|
-
let t =
|
|
5988
|
+
function Ed(e) {
|
|
5989
|
+
let t = Sd();
|
|
5993
5990
|
if (t) return t;
|
|
5994
|
-
|
|
5991
|
+
wd(e);
|
|
5995
5992
|
let n = /* @__PURE__ */ new Map(), r = 0;
|
|
5996
5993
|
for (let t of e) {
|
|
5997
5994
|
if (t.hasError()) return t.firstError();
|
|
@@ -6012,7 +6009,7 @@ function Dd(e) {
|
|
|
6012
6009
|
for (let [e, { count: t, firstSeen: r }] of n) t < 2 || (t > a || t === a && r < o) && (i = e, a = t, o = r);
|
|
6013
6010
|
return i === null ? y.BuiltIn.NA : i;
|
|
6014
6011
|
}
|
|
6015
|
-
function
|
|
6012
|
+
function Dd(e, t, n, r) {
|
|
6016
6013
|
return e < 0 ? NaN : (e = Math.trunc(e), t = Math.trunc(t), n <= 0 || n >= 1 || t < 1 ? NaN : r ? function(e, t, n) {
|
|
6017
6014
|
if (e < 0) return 0;
|
|
6018
6015
|
let r = 0, i = !1, a = Math.min(e, au);
|
|
@@ -6025,68 +6022,68 @@ function Od(e, t, n, r) {
|
|
|
6025
6022
|
return i && e <= au ? r : Un(n, t, Math.floor(e) + 1);
|
|
6026
6023
|
}(e, t, n) : lu(e, t, n));
|
|
6027
6024
|
}
|
|
6028
|
-
function
|
|
6029
|
-
return
|
|
6025
|
+
function Od(e, t, n) {
|
|
6026
|
+
return Dd(e, t, n, !1);
|
|
6030
6027
|
}
|
|
6031
|
-
function
|
|
6028
|
+
function kd(e, t, n, r) {
|
|
6032
6029
|
if (n <= 0) return NaN;
|
|
6033
6030
|
if (r) return Yl(e, t, n);
|
|
6034
6031
|
let i = (e - t) / n;
|
|
6035
6032
|
return Number.isFinite(i * i) ? Jl(e, t, n) : NaN;
|
|
6036
6033
|
}
|
|
6037
|
-
function
|
|
6038
|
-
return
|
|
6034
|
+
function Ad(e, t, n, r) {
|
|
6035
|
+
return kd(e, t, n, r);
|
|
6039
6036
|
}
|
|
6040
|
-
function
|
|
6037
|
+
function jd(e, t, n) {
|
|
6041
6038
|
return e <= 0 || e >= 1 || n <= 0 ? NaN : Xl(e, t, n);
|
|
6042
6039
|
}
|
|
6043
|
-
function
|
|
6044
|
-
return
|
|
6040
|
+
function Md(e, t, n) {
|
|
6041
|
+
return jd(e, t, n);
|
|
6045
6042
|
}
|
|
6046
|
-
function
|
|
6043
|
+
function Nd(e, t) {
|
|
6047
6044
|
return t ? Yl(e, 0, 1) : Number.isFinite(e * e) ? Jl(e, 0, 1) : NaN;
|
|
6048
6045
|
}
|
|
6046
|
+
function Pd(e) {
|
|
6047
|
+
return Nd(e, !0);
|
|
6048
|
+
}
|
|
6049
6049
|
function Fd(e) {
|
|
6050
|
-
return
|
|
6050
|
+
return e <= 0 || e >= 1 ? NaN : Xl(e, 0, 1);
|
|
6051
6051
|
}
|
|
6052
6052
|
function Id(e) {
|
|
6053
|
-
return
|
|
6053
|
+
return Fd(e);
|
|
6054
6054
|
}
|
|
6055
|
-
function Ld(e) {
|
|
6056
|
-
return
|
|
6055
|
+
function Ld(e, t) {
|
|
6056
|
+
return Lu(e, t);
|
|
6057
6057
|
}
|
|
6058
6058
|
function Rd(e, t) {
|
|
6059
|
-
return
|
|
6059
|
+
return Bd(e = v.flattenAreas(e), t);
|
|
6060
6060
|
}
|
|
6061
6061
|
function zd(e, t) {
|
|
6062
|
-
return Vd(e = v.flattenAreas(e), t);
|
|
6063
|
-
}
|
|
6064
|
-
function Bd(e, t) {
|
|
6065
6062
|
if ((e = v.flattenAreas(e)).hasError()) throw e.firstError();
|
|
6066
6063
|
if (t <= 0 || t >= 1) return NaN;
|
|
6067
6064
|
let n = e.getStats().getSortedNumbers().getPercentile(t, !0);
|
|
6068
6065
|
return n === null ? NaN : n;
|
|
6069
6066
|
}
|
|
6070
|
-
function
|
|
6067
|
+
function Bd(e, t) {
|
|
6071
6068
|
if ((e = v.flattenAreas(e)).hasError()) throw e.firstError();
|
|
6072
6069
|
if (t < 0 || t > 1) return NaN;
|
|
6073
6070
|
let n = e.getStats().getSortedNumbers().getPercentile(t, !1);
|
|
6074
6071
|
return n === null ? NaN : n;
|
|
6075
6072
|
}
|
|
6076
|
-
function
|
|
6077
|
-
return
|
|
6073
|
+
function Vd(e, t, n = 3) {
|
|
6074
|
+
return Ud(e = v.flattenAreas(e), t, n);
|
|
6078
6075
|
}
|
|
6079
|
-
function
|
|
6076
|
+
function Hd(e, t, n = 3) {
|
|
6080
6077
|
return (e = v.flattenAreas(e)).hasError() ? e.firstError() : e.getStats().getSortedNumbers().getPercentRankOf(t, !0, n) ?? y.BuiltIn.NA;
|
|
6081
6078
|
}
|
|
6082
|
-
function
|
|
6079
|
+
function Ud(e, t, n = 3) {
|
|
6083
6080
|
return (e = v.flattenAreas(e)).hasError() ? e.firstError() : e.getStats().getSortedNumbers().getPercentRankOf(t, !1, n) ?? y.BuiltIn.NA;
|
|
6084
6081
|
}
|
|
6085
|
-
function
|
|
6086
|
-
return Number.isFinite(e * e) ? Math.exp(-.5 * e * e) /
|
|
6082
|
+
function Wd(e) {
|
|
6083
|
+
return Number.isFinite(e * e) ? Math.exp(-.5 * e * e) / Nf : NaN;
|
|
6087
6084
|
}
|
|
6088
|
-
function
|
|
6089
|
-
return e < 0 || t < 0 ? NaN : (e = Math.trunc(e), Number.isFinite(
|
|
6085
|
+
function Gd(e, t, n) {
|
|
6086
|
+
return e < 0 || t < 0 ? NaN : (e = Math.trunc(e), Number.isFinite(I(e + 1)) ? n ? function(e, t) {
|
|
6090
6087
|
if (e < 0) return 0;
|
|
6091
6088
|
if (e <= 170) {
|
|
6092
6089
|
let n = [];
|
|
@@ -6100,11 +6097,11 @@ function Kd(e, t, n) {
|
|
|
6100
6097
|
return 1 - Ln(Math.floor(e) + 1, t);
|
|
6101
6098
|
}(e, t) : ou(e, t) : NaN);
|
|
6102
6099
|
}
|
|
6103
|
-
function
|
|
6104
|
-
return !n && e >= 0 && e < 1 && t < 0 ? Math.exp(-t) :
|
|
6100
|
+
function Kd(e, t, n) {
|
|
6101
|
+
return !n && e >= 0 && e < 1 && t < 0 ? Math.exp(-t) : Gd(e, t, n);
|
|
6105
6102
|
}
|
|
6106
|
-
function
|
|
6107
|
-
|
|
6103
|
+
function qd(e, t, n, r) {
|
|
6104
|
+
wd([e, t]);
|
|
6108
6105
|
let i = e.flatten(), a = t.flatten();
|
|
6109
6106
|
if (i.getRowCount() !== a.getRowCount()) return y.BuiltIn.NA;
|
|
6110
6107
|
if (e.hasError()) return Yo(e);
|
|
@@ -6113,37 +6110,37 @@ function Jd(e, t, n, r) {
|
|
|
6113
6110
|
for (let [[e, t]] of i.alignValues([a])) typeof e == "number" && typeof t == "number" && (s += t, e >= n && e <= o && (c += t));
|
|
6114
6111
|
return Math.round(1e10 * s) === 1e10 ? c : y.BuiltIn.Num;
|
|
6115
6112
|
}
|
|
6116
|
-
function
|
|
6117
|
-
return
|
|
6113
|
+
function Jd(e, t) {
|
|
6114
|
+
return Xd(e = v.flattenAreas(e), t);
|
|
6118
6115
|
}
|
|
6119
|
-
function
|
|
6116
|
+
function Yd(e, t) {
|
|
6120
6117
|
if ((e = v.flattenAreas(e)).hasError()) throw e.firstError();
|
|
6121
6118
|
if ((t = Math.trunc(t)) < 1 || t > 3) return NaN;
|
|
6122
6119
|
let n = t / 4, r = e.getStats().getSortedNumbers().getPercentile(n, !0);
|
|
6123
6120
|
return r === null ? NaN : r;
|
|
6124
6121
|
}
|
|
6125
|
-
function
|
|
6122
|
+
function Xd(e, t) {
|
|
6126
6123
|
if ((e = v.flattenAreas(e)).hasError()) throw e.firstError();
|
|
6127
6124
|
if ((t = Math.trunc(t)) < 0 || t > 4) return NaN;
|
|
6128
6125
|
let n = t / 4, r = e.getStats().getSortedNumbers().getPercentile(n, !1);
|
|
6129
6126
|
return r === null ? NaN : r;
|
|
6130
6127
|
}
|
|
6131
|
-
function
|
|
6132
|
-
return
|
|
6128
|
+
function Zd(e, t, n = !1) {
|
|
6129
|
+
return $d(e, t, n);
|
|
6133
6130
|
}
|
|
6134
|
-
function
|
|
6131
|
+
function Qd(e, t, n = !1) {
|
|
6135
6132
|
let r = v.flattenAreas(t);
|
|
6136
6133
|
if (r.hasError()) return r.firstError();
|
|
6137
6134
|
let i = r.getStats().getSortedNumbers().getRankOf(e, !n, !0);
|
|
6138
6135
|
return i === null ? y.BuiltIn.NA : i;
|
|
6139
6136
|
}
|
|
6140
|
-
function
|
|
6137
|
+
function $d(e, t, n = !1) {
|
|
6141
6138
|
let r = v.flattenAreas(t);
|
|
6142
6139
|
if (r.hasError()) return r.firstError();
|
|
6143
6140
|
let i = r.getStats().getSortedNumbers().getRankOf(e, !n, !1);
|
|
6144
6141
|
return i === null ? y.BuiltIn.NA : i;
|
|
6145
6142
|
}
|
|
6146
|
-
function
|
|
6143
|
+
function ef(e, t) {
|
|
6147
6144
|
let n = X(e, t);
|
|
6148
6145
|
if (y.isError(n)) return n;
|
|
6149
6146
|
if (n === null) return y.BuiltIn.NA;
|
|
@@ -6152,7 +6149,7 @@ function tf(e, t) {
|
|
|
6152
6149
|
let r = n.ssXY / Math.sqrt(n.ssX * n.ssY);
|
|
6153
6150
|
return r * r;
|
|
6154
6151
|
}
|
|
6155
|
-
function
|
|
6152
|
+
function tf(e) {
|
|
6156
6153
|
let t = 0, n = 0;
|
|
6157
6154
|
for (let r of e) {
|
|
6158
6155
|
if (r.hasError()) return r.firstError();
|
|
@@ -6163,7 +6160,7 @@ function nf(e) {
|
|
|
6163
6160
|
if (t < 3) return y.BuiltIn.Div0;
|
|
6164
6161
|
let r = n / t, i = 0;
|
|
6165
6162
|
for (let t of e) t.forEach((e) => {
|
|
6166
|
-
typeof e == "number" && (i +=
|
|
6163
|
+
typeof e == "number" && (i += T((e - r) ** 2));
|
|
6167
6164
|
});
|
|
6168
6165
|
let a = Math.sqrt(i / (t - 1));
|
|
6169
6166
|
if (a === 0 || !Number.isFinite(a)) return y.BuiltIn.Div0;
|
|
@@ -6173,7 +6170,7 @@ function nf(e) {
|
|
|
6173
6170
|
});
|
|
6174
6171
|
return t / ((t - 1) * (t - 2)) * o;
|
|
6175
6172
|
}
|
|
6176
|
-
function
|
|
6173
|
+
function nf(e) {
|
|
6177
6174
|
let t = 0, n = 0;
|
|
6178
6175
|
for (let r of e) {
|
|
6179
6176
|
if (r.hasError()) return r.firstError();
|
|
@@ -6184,7 +6181,7 @@ function rf(e) {
|
|
|
6184
6181
|
if (t < 3) return y.BuiltIn.Div0;
|
|
6185
6182
|
let r = n / t, i = 0;
|
|
6186
6183
|
for (let t of e) t.forEach((e) => {
|
|
6187
|
-
typeof e == "number" && (i +=
|
|
6184
|
+
typeof e == "number" && (i += T((e - r) ** 2));
|
|
6188
6185
|
});
|
|
6189
6186
|
let a = Math.sqrt(i / t);
|
|
6190
6187
|
if (a === 0 || !Number.isFinite(a)) return y.BuiltIn.Div0;
|
|
@@ -6194,7 +6191,7 @@ function rf(e) {
|
|
|
6194
6191
|
});
|
|
6195
6192
|
return o / t;
|
|
6196
6193
|
}
|
|
6197
|
-
function
|
|
6194
|
+
function rf(e, t) {
|
|
6198
6195
|
let n = X(e, t);
|
|
6199
6196
|
if (y.isError(n)) return n;
|
|
6200
6197
|
if (n === null) return y.BuiltIn.NA;
|
|
@@ -6203,69 +6200,69 @@ function af(e, t) {
|
|
|
6203
6200
|
let r = n.ssXY / n.ssX;
|
|
6204
6201
|
return Number.isFinite(r) ? r : y.BuiltIn.Num;
|
|
6205
6202
|
}
|
|
6206
|
-
function
|
|
6203
|
+
function af(e, t, n) {
|
|
6207
6204
|
return n <= 0 ? NaN : (e - t) / n;
|
|
6208
6205
|
}
|
|
6209
|
-
function
|
|
6210
|
-
let t =
|
|
6206
|
+
function of(e) {
|
|
6207
|
+
let t = wf(e);
|
|
6211
6208
|
return Math.sqrt(t);
|
|
6212
6209
|
}
|
|
6210
|
+
function sf(e) {
|
|
6211
|
+
return of(e);
|
|
6212
|
+
}
|
|
6213
6213
|
function cf(e) {
|
|
6214
|
-
|
|
6214
|
+
let t = Sf(e);
|
|
6215
|
+
return Math.sqrt(t);
|
|
6215
6216
|
}
|
|
6216
6217
|
function lf(e) {
|
|
6217
|
-
|
|
6218
|
-
return Math.sqrt(t);
|
|
6218
|
+
return cf(e);
|
|
6219
6219
|
}
|
|
6220
6220
|
function uf(e) {
|
|
6221
|
-
|
|
6221
|
+
let t = Df(e);
|
|
6222
|
+
return Math.sqrt(t);
|
|
6222
6223
|
}
|
|
6223
6224
|
function df(e) {
|
|
6224
6225
|
let t = Of(e);
|
|
6225
6226
|
return Math.sqrt(t);
|
|
6226
6227
|
}
|
|
6227
|
-
function ff(e) {
|
|
6228
|
-
let t = kf(e);
|
|
6229
|
-
return Math.sqrt(t);
|
|
6230
|
-
}
|
|
6231
|
-
function pf(e, t) {
|
|
6228
|
+
function ff(e, t) {
|
|
6232
6229
|
let n = X(e, t);
|
|
6233
6230
|
return y.isError(n) ? n : n === null ? y.BuiltIn.NA : n.n < 3 || n.ssX === 0 ? y.BuiltIn.Div0 : Number.isFinite(n.ssX) && Number.isFinite(n.ssY) ? Math.sqrt((n.ssY - n.ssXY * n.ssXY / n.ssX) / (n.n - 2)) : y.BuiltIn.Num;
|
|
6234
6231
|
}
|
|
6235
|
-
function
|
|
6236
|
-
return (t = Math.trunc(t)) < 1 || t >
|
|
6232
|
+
function pf(e, t, n) {
|
|
6233
|
+
return (t = Math.trunc(t)) < 1 || t > Y ? NaN : n ? e === 0 ? .5 : function(e, t) {
|
|
6237
6234
|
if (!Number.isFinite(e * e)) return NaN;
|
|
6238
6235
|
let n = .5 * ru(e, t);
|
|
6239
6236
|
return e > 0 ? 1 - n : n;
|
|
6240
|
-
}(e, t) : function(e, t) {
|
|
6237
|
+
}(e, t) : Number.isFinite(e * e) ? function(e, t) {
|
|
6241
6238
|
return t = t > 1e100 ? 1e100 : t, 1 / (Math.sqrt(t) * On(.5, t / 2)) * (1 + e * e / t) ** (-(t + 1) / 2);
|
|
6242
|
-
}(e, t);
|
|
6239
|
+
}(e, t) : NaN;
|
|
6240
|
+
}
|
|
6241
|
+
function mf(e, t, n) {
|
|
6242
|
+
return e < 0 || (n = Math.floor(n + hu)) !== 1 && n !== 2 ? NaN : n === 1 ? gf(e, t) : hf(e, t);
|
|
6243
6243
|
}
|
|
6244
|
-
function hf(e, t
|
|
6245
|
-
return
|
|
6244
|
+
function hf(e, t) {
|
|
6245
|
+
return (t = Math.trunc(t)) < 1 || e < 0 || t > Y ? NaN : 2 * nu(e, t);
|
|
6246
6246
|
}
|
|
6247
6247
|
function gf(e, t) {
|
|
6248
|
-
return (t = Math.trunc(t)) < 1 ||
|
|
6248
|
+
return (t = Math.trunc(t)) < 1 || t > Y ? NaN : e === 0 ? .5 : nu(e, t);
|
|
6249
6249
|
}
|
|
6250
6250
|
function _f(e, t) {
|
|
6251
|
-
|
|
6251
|
+
if (e === 0 && Math.trunc(t) === 1) throw y.BuiltIn.Div0;
|
|
6252
|
+
return e <= 0 || e >= 1 || t < 1 || (t = Math.trunc(t)) > Y ? NaN : t === 1 ? Math.tan(Math.PI * (e - .5)) : iu(e, t);
|
|
6252
6253
|
}
|
|
6253
6254
|
function vf(e, t) {
|
|
6254
|
-
|
|
6255
|
-
return e <= 0 || e >= 1 || t < 1 || (t = Math.trunc(t)) > J ? NaN : t === 1 ? Math.tan(Math.PI * (e - .5)) : iu(e, t);
|
|
6255
|
+
return yf(e, t);
|
|
6256
6256
|
}
|
|
6257
6257
|
function yf(e, t) {
|
|
6258
|
-
return bf(e, t);
|
|
6259
|
-
}
|
|
6260
|
-
function bf(e, t) {
|
|
6261
6258
|
if (e === 0 && Math.trunc(t) === 1) throw y.BuiltIn.Div0;
|
|
6262
|
-
return e <= 0 || t < 1 || (t = Math.trunc(t)) >
|
|
6259
|
+
return e <= 0 || t < 1 || (t = Math.trunc(t)) > Y ? NaN : t === 1 ? Math.tan(Math.PI * (.5 - e / 2)) : -iu(e / 2, t);
|
|
6263
6260
|
}
|
|
6264
|
-
function
|
|
6261
|
+
function bf(e, t) {
|
|
6265
6262
|
if ((e = v.flattenAreas(e)).hasError()) return e.firstError();
|
|
6266
6263
|
if (t < 0 || t >= 1) return NaN;
|
|
6267
6264
|
let n = [];
|
|
6268
|
-
for (let { value: t } of e.entries(
|
|
6265
|
+
for (let { value: t } of e.entries(xf)) typeof t == "number" && n.push(t);
|
|
6269
6266
|
let r = n.length, i = Math.floor(r * t / 2), a = 0, o = 0;
|
|
6270
6267
|
if (i === 0) {
|
|
6271
6268
|
for (let e = 0; e < r; e++) a += n[e];
|
|
@@ -6280,29 +6277,29 @@ function xf(e, t) {
|
|
|
6280
6277
|
}
|
|
6281
6278
|
return o === 0 ? NaN : a / o;
|
|
6282
6279
|
}
|
|
6283
|
-
var
|
|
6284
|
-
function
|
|
6280
|
+
var xf = { axis: b.Axis.Row };
|
|
6281
|
+
function Sf(e) {
|
|
6285
6282
|
let t = 0, n = 0, r = bl(e);
|
|
6286
6283
|
for (let i of e) for (let e of i.values()) t += (e - r) ** 2, n++;
|
|
6287
6284
|
let i = t / n;
|
|
6288
6285
|
return isNaN(i) ? NaN : i;
|
|
6289
6286
|
}
|
|
6290
|
-
function
|
|
6291
|
-
return
|
|
6287
|
+
function Cf(e) {
|
|
6288
|
+
return Sf(e);
|
|
6292
6289
|
}
|
|
6293
|
-
function
|
|
6290
|
+
function wf(e) {
|
|
6294
6291
|
let t = 0, n = 0, r = bl(e);
|
|
6295
6292
|
for (let i of e) for (let e of i.values({
|
|
6296
|
-
type:
|
|
6293
|
+
type: S.Number,
|
|
6297
6294
|
onError: "value"
|
|
6298
6295
|
})) typeof e == "number" && (t += (e - r) ** 2, n++);
|
|
6299
6296
|
if (n < 2) throw y.BuiltIn.Div0;
|
|
6300
6297
|
return t / (n - 1);
|
|
6301
6298
|
}
|
|
6302
|
-
function
|
|
6303
|
-
return
|
|
6299
|
+
function Tf(e) {
|
|
6300
|
+
return wf(e);
|
|
6304
6301
|
}
|
|
6305
|
-
var
|
|
6302
|
+
var Ef = (e) => {
|
|
6306
6303
|
let t = [], n = 0;
|
|
6307
6304
|
for (let r of e) {
|
|
6308
6305
|
let e = pl(r);
|
|
@@ -6318,17 +6315,17 @@ var Df = (e) => {
|
|
|
6318
6315
|
count: r
|
|
6319
6316
|
};
|
|
6320
6317
|
};
|
|
6321
|
-
function
|
|
6322
|
-
let { sigma: t, count: n } =
|
|
6318
|
+
function Df(e) {
|
|
6319
|
+
let { sigma: t, count: n } = Ef(e);
|
|
6323
6320
|
if (n < 2) throw y.BuiltIn.Div0;
|
|
6324
6321
|
return t / (n - 1);
|
|
6325
6322
|
}
|
|
6326
|
-
function
|
|
6327
|
-
let { sigma: t, count: n } =
|
|
6323
|
+
function Of(e) {
|
|
6324
|
+
let { sigma: t, count: n } = Ef(e);
|
|
6328
6325
|
if (n === 0) throw y.BuiltIn.Div0;
|
|
6329
6326
|
return t / n;
|
|
6330
6327
|
}
|
|
6331
|
-
function
|
|
6328
|
+
function kf(e, t, n, r) {
|
|
6332
6329
|
if (e < 0 || t <= 0 || n <= 0) return NaN;
|
|
6333
6330
|
if (!r && e === 0) return 0;
|
|
6334
6331
|
let i = (e / n) ** +t;
|
|
@@ -6339,10 +6336,10 @@ function Af(e, t, n, r) {
|
|
|
6339
6336
|
if (o === 0) throw y.BuiltIn.Div0;
|
|
6340
6337
|
return a / o * Math.exp(-i);
|
|
6341
6338
|
}
|
|
6342
|
-
function
|
|
6343
|
-
return
|
|
6339
|
+
function Af(e, t, n, r) {
|
|
6340
|
+
return kf(e, t, n, r);
|
|
6344
6341
|
}
|
|
6345
|
-
function
|
|
6342
|
+
function jf(e, t, n) {
|
|
6346
6343
|
let r = [];
|
|
6347
6344
|
if (e === void 0) r.push(0);
|
|
6348
6345
|
else {
|
|
@@ -6362,14 +6359,14 @@ function Mf(e, t, n) {
|
|
|
6362
6359
|
if (e === 0) throw y.BuiltIn.Div0;
|
|
6363
6360
|
n = Math.sqrt(e / (i - 1));
|
|
6364
6361
|
} else if (!(n > 0)) throw y.BuiltIn.Num;
|
|
6365
|
-
return 1 -
|
|
6362
|
+
return 1 - Nd((a - t) / (n / Math.sqrt(i)), !0);
|
|
6366
6363
|
}
|
|
6367
|
-
function
|
|
6368
|
-
return
|
|
6364
|
+
function Mf(e, t, n) {
|
|
6365
|
+
return jf(e, t, n);
|
|
6369
6366
|
}
|
|
6370
|
-
var
|
|
6367
|
+
var Nf = 2.5066282746310002, Pf = (e) => e.size === 1 && pl(e) ? e.hasError() ? e.firstError() : e.entries({ includeEmpty: !1 }).next().done ? y.BuiltIn.Value : null : null;
|
|
6371
6368
|
function X(e, t) {
|
|
6372
|
-
let n =
|
|
6369
|
+
let n = Pf(e) ?? Pf(t);
|
|
6373
6370
|
if (n) return n;
|
|
6374
6371
|
let r = e.getRowCount(), i = e.getColumnCount();
|
|
6375
6372
|
if (r * i !== t.getRowCount() * t.getColumnCount()) return null;
|
|
@@ -6397,7 +6394,7 @@ function X(e, t) {
|
|
|
6397
6394
|
ssXY: m
|
|
6398
6395
|
};
|
|
6399
6396
|
}
|
|
6400
|
-
var Ff =
|
|
6397
|
+
var Ff = w({
|
|
6401
6398
|
DELAY: () => Lf,
|
|
6402
6399
|
WAIT: () => Hf
|
|
6403
6400
|
});
|
|
@@ -6482,7 +6479,7 @@ var Uf = [
|
|
|
6482
6479
|
toFull: e,
|
|
6483
6480
|
toHalf: t
|
|
6484
6481
|
};
|
|
6485
|
-
}, qf = /[\x20-\x7E\xA2-\xAF\u20A9\u309B\u309C\uFF61-\uFFDC]/g, Jf = /[\u2018\u2019\u201C\u201D\u3000-\u30FE\u3131-\u3164\uFF01-\uFFE6]/g, Yf = /[\u3131\u3132\u3134\u3137-\u3139\u3141-\u3143\u3145-\u314E][\u314F-\u3163][\u3133\u3135\u3136\u313A-\u313F]?/g, Xf = /[\u3041-\u30FE][\u3099\u309A]|[\u1100-\u1112][\u1161-\u1175][\u11A8-\u11C2]?|[\uAC00-\uD7A3][\u11A8-\u11C2]/g, Zf =
|
|
6482
|
+
}, qf = /[\x20-\x7E\xA2-\xAF\u20A9\u309B\u309C\uFF61-\uFFDC]/g, Jf = /[\u2018\u2019\u201C\u201D\u3000-\u30FE\u3131-\u3164\uFF01-\uFFE6]/g, Yf = /[\u3131\u3132\u3134\u3137-\u3139\u3141-\u3143\u3145-\u314E][\u314F-\u3163][\u3133\u3135\u3136\u313A-\u313F]?/g, Xf = /[\u3041-\u30FE][\u3099\u309A]|[\u1100-\u1112][\u1161-\u1175][\u11A8-\u11C2]?|[\uAC00-\uD7A3][\u11A8-\u11C2]/g, Zf = w({
|
|
6486
6483
|
ARRAYTOTEXT: () => tp,
|
|
6487
6484
|
ASC: () => ep,
|
|
6488
6485
|
CHAR: () => np,
|
|
@@ -6568,7 +6565,7 @@ function tp(e, t = 0) {
|
|
|
6568
6565
|
return n && (r += "}"), r;
|
|
6569
6566
|
}
|
|
6570
6567
|
function np(e) {
|
|
6571
|
-
let t =
|
|
6568
|
+
let t = E(e);
|
|
6572
6569
|
if (!(t >= 1 && t <= 255)) throw y.BuiltIn.Value;
|
|
6573
6570
|
return String.fromCharCode(t);
|
|
6574
6571
|
}
|
|
@@ -6581,12 +6578,12 @@ function ip(e) {
|
|
|
6581
6578
|
}
|
|
6582
6579
|
function ap(e) {
|
|
6583
6580
|
let t = "";
|
|
6584
|
-
for (let n of e) for (let e of n.values()) if (t += e, t.length >
|
|
6581
|
+
for (let n of e) for (let e of n.values()) if (t += e, t.length > x.MAX_TEXT_LENGTH) throw y.BuiltIn.Calc;
|
|
6585
6582
|
return t;
|
|
6586
6583
|
}
|
|
6587
6584
|
var op = {
|
|
6588
|
-
type:
|
|
6589
|
-
coerce: [
|
|
6585
|
+
type: S.String,
|
|
6586
|
+
coerce: [S.Boolean, S.Number],
|
|
6590
6587
|
onError: "value",
|
|
6591
6588
|
misalignValue: y.BuiltIn.NA
|
|
6592
6589
|
};
|
|
@@ -6598,8 +6595,8 @@ function sp(e) {
|
|
|
6598
6595
|
if (e !== null && y.isError(e)) return e;
|
|
6599
6596
|
if (t !== null && y.isError(t)) return t;
|
|
6600
6597
|
let n = (e ?? "") + (t ?? "");
|
|
6601
|
-
if (n.length <=
|
|
6602
|
-
let r =
|
|
6598
|
+
if (n.length <= x.MAX_TEXT_LENGTH) return n;
|
|
6599
|
+
let r = x.MAX_TEXT_LENGTH, i = n.charCodeAt(r - 1), a = n.charCodeAt(r);
|
|
6603
6600
|
return i >= 55296 && i <= 56319 && a >= 56320 && a <= 57343 && r--, n.slice(0, r);
|
|
6604
6601
|
}, op);
|
|
6605
6602
|
}
|
|
@@ -6625,7 +6622,7 @@ function dp(e, t) {
|
|
|
6625
6622
|
return e === t;
|
|
6626
6623
|
}
|
|
6627
6624
|
function fp(e, t, n = 1) {
|
|
6628
|
-
n =
|
|
6625
|
+
n = E(n);
|
|
6629
6626
|
let r = Q(t), i = r ? dm(t) : t.length;
|
|
6630
6627
|
if (n < 1 || n > i + 1) throw y.BuiltIn.Value;
|
|
6631
6628
|
let a = r ? $(t, n - 1) : n - 1, o = t.indexOf(e, a);
|
|
@@ -6633,7 +6630,7 @@ function fp(e, t, n = 1) {
|
|
|
6633
6630
|
return r ? fm(t, o) + 1 : o + 1;
|
|
6634
6631
|
}
|
|
6635
6632
|
function pp(e, t, n = 1) {
|
|
6636
|
-
if ((n =
|
|
6633
|
+
if ((n = E(n)) < 1 || n > t.length + 1) throw y.BuiltIn.Value;
|
|
6637
6634
|
let r = t.indexOf(e, n - 1);
|
|
6638
6635
|
if (r === -1) throw y.BuiltIn.Value;
|
|
6639
6636
|
return r + 1;
|
|
@@ -6650,7 +6647,7 @@ function hp(e, t) {
|
|
|
6650
6647
|
}
|
|
6651
6648
|
function gp(e, t = 1) {
|
|
6652
6649
|
if (t < 0) throw y.BuiltIn.Value;
|
|
6653
|
-
return t =
|
|
6650
|
+
return t = E(t), Q(e) ? e.slice(0, $(e, t)) : t > e.length ? e : e.slice(0, t);
|
|
6654
6651
|
}
|
|
6655
6652
|
function _p(e, t = 1) {
|
|
6656
6653
|
return gp(e, t);
|
|
@@ -6700,17 +6697,17 @@ function wp(e) {
|
|
|
6700
6697
|
return (e = um(e, !1)).replace(/(^|\P{L})(\p{L})/gu, (e, t, n) => t + um(n, !0));
|
|
6701
6698
|
}
|
|
6702
6699
|
function Tp(e, t, n, r) {
|
|
6703
|
-
return n +
|
|
6700
|
+
return n + be < 0 ? y.BuiltIn.Value : (t = E(t), n = E(n), t < 1 ? y.BuiltIn.Value : Q(e) ? e.slice(0, $(e, t - 1)) + r + e.slice($(e, t - 1 + n)) : e.slice(0, t - 1) + r + e.slice(t - 1 + n));
|
|
6704
6701
|
}
|
|
6705
6702
|
function Ep(e, t, n, r) {
|
|
6706
|
-
return n +
|
|
6703
|
+
return n + be < 0 ? y.BuiltIn.Value : (t = E(t), n = E(n), t < 1 ? y.BuiltIn.Value : e.slice(0, t - 1) + r + e.slice(t - 1 + n));
|
|
6707
6704
|
}
|
|
6708
6705
|
function Dp(e, t) {
|
|
6709
|
-
return (t = Math.floor(t)) < 0 || e.length * t >
|
|
6706
|
+
return (t = Math.floor(t)) < 0 || e.length * t > x.MAX_TEXT_LENGTH ? y.BuiltIn.Value : e.repeat(t);
|
|
6710
6707
|
}
|
|
6711
6708
|
function Op(e, t = 1) {
|
|
6712
6709
|
if (t < 0) throw y.BuiltIn.Value;
|
|
6713
|
-
if (t =
|
|
6710
|
+
if (t = E(t), !Q(e)) {
|
|
6714
6711
|
let n = e.length;
|
|
6715
6712
|
return t > n ? e : e.slice(n - t);
|
|
6716
6713
|
}
|
|
@@ -6721,16 +6718,16 @@ function kp(e, t = 1) {
|
|
|
6721
6718
|
return Op(e, t);
|
|
6722
6719
|
}
|
|
6723
6720
|
function Ap(e, t, n = 1) {
|
|
6724
|
-
n =
|
|
6721
|
+
n = E(n);
|
|
6725
6722
|
let r = Q(t), i = r ? dm(t) : t.length;
|
|
6726
6723
|
if (n < 1 || n > i) throw y.BuiltIn.Value;
|
|
6727
|
-
let a =
|
|
6724
|
+
let a = de.toRegex(am(e), "i"), o = r ? $(t, n - 1) : n - 1, s = am(t).slice(o).search(a);
|
|
6728
6725
|
if (s === -1) throw y.BuiltIn.Value;
|
|
6729
6726
|
return r ? fm(t, o + s) + 1 : s + n;
|
|
6730
6727
|
}
|
|
6731
6728
|
function jp(e, t, n = 1) {
|
|
6732
|
-
if ((n =
|
|
6733
|
-
let r =
|
|
6729
|
+
if ((n = E(n)) < 1 || n > t.length) throw y.BuiltIn.Value;
|
|
6730
|
+
let r = de.toRegex(am(e), "i"), i = am(t).slice(n - 1).search(r);
|
|
6734
6731
|
if (i === -1) throw y.BuiltIn.Value;
|
|
6735
6732
|
return i + n;
|
|
6736
6733
|
}
|
|
@@ -6739,11 +6736,11 @@ function Mp(e, t, n = !0, r = !0) {
|
|
|
6739
6736
|
}
|
|
6740
6737
|
function Np(e, t, n, r) {
|
|
6741
6738
|
let i = -1;
|
|
6742
|
-
if (r !== void 0 && (r === null || (i =
|
|
6739
|
+
if (r !== void 0 && (r === null || (i = E(v.parseAsNumber(r)), i <= 0))) return y.BuiltIn.Value;
|
|
6743
6740
|
if (!e || !t) return e;
|
|
6744
6741
|
let a = e, o = 0, s = 0;
|
|
6745
6742
|
for (; (o = a.indexOf(t, o)) !== -1;) if (++s, s === i || i === -1) {
|
|
6746
|
-
if (a = a.substring(0, o) + n + a.substring(o + t.length), a.length >
|
|
6743
|
+
if (a = a.substring(0, o) + n + a.substring(o + t.length), a.length > x.MAX_TEXT_LENGTH) return y.BuiltIn.Value;
|
|
6747
6744
|
if (i !== -1) break;
|
|
6748
6745
|
o += n.length;
|
|
6749
6746
|
} else o += 1;
|
|
@@ -6755,7 +6752,8 @@ function Pp(e) {
|
|
|
6755
6752
|
}
|
|
6756
6753
|
var Fp = (e) => typeof e == "string" ? e : "";
|
|
6757
6754
|
function Ip(e, t) {
|
|
6758
|
-
if (e === null && (e = 0), t === "") return "";
|
|
6755
|
+
if (e === null && (e = 0), t === "") return typeof e == "number" && e < 0 ? "-" : "";
|
|
6756
|
+
if (t.length > 255) return y.BuiltIn.Value;
|
|
6759
6757
|
if (typeof e == "string" && e.trim() !== "") try {
|
|
6760
6758
|
e = v.parseAsNumber(e.trim());
|
|
6761
6759
|
} catch {}
|
|
@@ -6774,7 +6772,7 @@ function Rp(e, t, n, r = 0, i = 0, a) {
|
|
|
6774
6772
|
function zp(e, t, n) {
|
|
6775
6773
|
let r = "", i = 0;
|
|
6776
6774
|
for (let a of n) for (let n of a.values({ includeEmpty: !t })) if (n.length !== 0 || !t) {
|
|
6777
|
-
if (i > 0 && e.length > 0 && (r += e[(i - 1) % e.length]), r += n, r.length >
|
|
6775
|
+
if (i > 0 && e.length > 0 && (r += e[(i - 1) % e.length]), r += n, r.length > x.MAX_TEXT_LENGTH) return y.BuiltIn.Calc;
|
|
6778
6776
|
i += 1;
|
|
6779
6777
|
}
|
|
6780
6778
|
return r;
|
|
@@ -6917,7 +6915,7 @@ var Xp = /[\uD800-\uDBFF][\uDC00-\uDFFF]/, Q = (e) => Xp.test(e), Zp = /[\uD800-
|
|
|
6917
6915
|
if (c !== 0 && c !== 1) return y.BuiltIn.Value;
|
|
6918
6916
|
let l = Math.trunc(a);
|
|
6919
6917
|
if (l !== 0 && l !== 1) return y.BuiltIn.Value;
|
|
6920
|
-
let u = Math.floor(n +
|
|
6918
|
+
let u = Math.floor(n + be);
|
|
6921
6919
|
if (u === 0) return y.BuiltIn.Value;
|
|
6922
6920
|
if (t.length === 0 || t.some((e) => e.length === 0)) return s === u > 0 ? e : "";
|
|
6923
6921
|
let d = Math.min(...t.map((e) => e.length));
|
|
@@ -6945,7 +6943,7 @@ var Xp = /[\uD800-\uDBFF][\uDC00-\uDFFF]/, Q = (e) => Xp.test(e), Zp = /[\uD800-
|
|
|
6945
6943
|
l === 1 && (u > 0 ? f.push([e.length, e.length]) : f.unshift([0, 0]));
|
|
6946
6944
|
let p = u > 0 ? u - 1 : f.length + u;
|
|
6947
6945
|
return p < 0 || p >= f.length ? o ?? y.BuiltIn.NA : s ? e.substring(f[p][1]) : e.substring(0, f[p][0]);
|
|
6948
|
-
}, mm =
|
|
6946
|
+
}, mm = ve((e, t) => {
|
|
6949
6947
|
var n = "", r = "หนึ่ง", i = [
|
|
6950
6948
|
"สาม",
|
|
6951
6949
|
"สี่",
|
|
@@ -7062,7 +7060,7 @@ var Xp = /[\uD800-\uDBFF][\uDC00-\uDFFF]/, Q = (e) => Xp.test(e), Zp = /[\uD800-
|
|
|
7062
7060
|
handleStringInput: _,
|
|
7063
7061
|
formatSatang: ee
|
|
7064
7062
|
}, e.default = { bahttext: h };
|
|
7065
|
-
}), hm =
|
|
7063
|
+
}), hm = w({ BAHTTEXT: () => _m }), gm = mm();
|
|
7066
7064
|
function _m(e) {
|
|
7067
7065
|
try {
|
|
7068
7066
|
return (0, gm.bahttext)(e);
|
|
@@ -7070,7 +7068,7 @@ function _m(e) {
|
|
|
7070
7068
|
throw Error(`Error in https://github.com/jojoee/bahttext \n${e.toString()}`);
|
|
7071
7069
|
}
|
|
7072
7070
|
}
|
|
7073
|
-
var vm =
|
|
7071
|
+
var vm = w({ FILTERXML: () => ym });
|
|
7074
7072
|
function ym(e, t) {
|
|
7075
7073
|
if (Tm) throw y.BuiltIn.Blocked;
|
|
7076
7074
|
return Cm && wm ? xm(e, t) : (v.defer(bm, {
|
|
@@ -7118,7 +7116,7 @@ var Sm = async () => {
|
|
|
7118
7116
|
wm = e;
|
|
7119
7117
|
let n = t.DOMParser;
|
|
7120
7118
|
Cm = new n();
|
|
7121
|
-
}, Cm = null, wm = null, Tm = !1, Em = null, Dm =
|
|
7119
|
+
}, Cm = null, wm = null, Tm = !1, Em = null, Dm = w({ IMPORTDATA: () => jm }), Om = "Resource at url not found.";
|
|
7122
7120
|
function km(e) {
|
|
7123
7121
|
let t = e.split(/[?#]/, 1)[0];
|
|
7124
7122
|
return /\.tsv$/i.test(t) ? " " : ",";
|
|
@@ -7153,7 +7151,7 @@ function jm(e, t, n) {
|
|
|
7153
7151
|
};
|
|
7154
7152
|
return v.defer(Am, i), [[y.BuiltIn.Busy]];
|
|
7155
7153
|
}
|
|
7156
|
-
var Mm =
|
|
7154
|
+
var Mm = w({
|
|
7157
7155
|
ENCODEURL: () => Nm,
|
|
7158
7156
|
WEBSERVICE: () => Fm
|
|
7159
7157
|
});
|
|
@@ -7185,5 +7183,5 @@ async function Im(e, t, n) {
|
|
|
7185
7183
|
throw y.isError(e, y.Code.Blocked) ? new y.Value(e.message) : y.BuiltIn.Value;
|
|
7186
7184
|
}
|
|
7187
7185
|
}
|
|
7188
|
-
var Lm = () => import("./
|
|
7186
|
+
var Lm = () => import("./B8Lb4ycMbsisimyJ.mjs"), Rm = () => import("./CuoQKYMmPOfl94gW.mjs"), zm = () => import("./CcHSbpd59O15t-0s.mjs"), Bm = () => import("./j3fzAwgnII1ABYoy.mjs"), Vm = () => import("./BMu9wmB3CUBwBBW1.mjs"), Hm = () => import("./CEL8D-iv8wA9zzGP.mjs"), Um = () => import("./CZM973Z0Okl_3JQc.mjs"), Wm = () => import("./B4JL4tyPYordrFSn.mjs"), Gm = () => import("./DgQs_yv8yoyN7IvY.mjs"), Km = () => import("./tT_Sh3neAQCj8w1k.mjs"), qm = () => import("./OkSc7RXqdqBX_dhB.mjs"), Jm = () => import("./BXyl3EySzcpdcg4a.mjs"), Ym = () => import("./UzUKr0PdyOTCvFQK.mjs"), Xm = () => import("./DMTraB6qAjSlyDKP.mjs"), Zm = () => import("./DRcy1_Zqu53jue2l.mjs"), Qm = () => import("./DTtayzMN3z3KzrEs.mjs"), $m = () => import("./Bgm6ooSL37aLrze-.mjs"), eh = () => import("./-3OnHOj2LLDR1fc_.mjs"), th = () => import("./C6XhGX3n-kOXcVe-.mjs"), nh = () => import("./KGE7M7zDiMjCOz64.mjs"), rh = () => import("./FJ3f_AG3AtqiwPvE.mjs"), ih = () => import("./DTQMfBMFzcfiKUUd.mjs"), ah = () => import("./B3ZIxkXpijIr7_0H.mjs"), oh = () => import("./DhGoS8Vi10avRc0T.mjs"), sh = () => import("./DKarKpru6FjwvLA_.mjs"), ch = (v, y, b) => (b ||= /* @__PURE__ */ new Map(), y(b, v, Se, h, Lm, "Database"), y(b, v, Be, t, Rm, "Date & Time", r), y(b, v, Dt, n, zm, "Engineering"), y(b, v, Ft, a, Bm, "Engineering"), y(b, v, dn, ce, Vm, "Engineering"), y(b, v, Sn, e, Hm, "Engineering"), y(b, v, qn, i, Um, "Engineering"), y(b, v, or, le, Wm, "Engineering"), y(b, v, ni, c, Gm, "Financial"), y(b, v, Si, se, Km, "Information", ue), y(b, v, $i, o, qm, "Japanese"), y(b, v, na, f, Jm, "Japanese"), y(b, v, aa, p, Ym, "Logical"), y(b, v, ja, ne, Xm, "Lookup & Reference", _), y(b, v, Qo, u, Zm, "Math & Trig", d), y(b, v, Oc, oe, Qm, "Math & Trig"), y(b, v, Xc, g, $m, "Operators"), y(b, v, uu, l, eh, "Statistical"), y(b, v, vl, ie, th, "Statistical"), y(b, v, Ff, te, nh, "Testing"), y(b, v, Zf, s, rh, "Text"), y(b, v, hm, m, ih, "Thai"), y(b, v, vm, re, ah, "Web"), y(b, v, Dm, ee, oh, "Web"), y(b, v, Mm, ae, sh, "Web"), b);
|
|
7189
7187
|
export { ch as default };
|