@graffiticode/l0179-view 0.1.0 → 0.1.2

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.
@@ -1,4501 +0,0 @@
1
- /*!
2
- * decimal.js v10.6.0
3
- * An arbitrary-precision Decimal type for JavaScript.
4
- * https://github.com/MikeMcl/decimal.js
5
- * Copyright (c) 2025 Michael Mclaughlin <M8ch88l@gmail.com>
6
- * MIT Licence
7
- */
8
- var Ht = 9e15, bt = 1e9, ns = "0123456789abcdef", un = "2.3025850929940456840179914546843642076011014886287729760333279009675726096773524802359972050895982983419677840422862486334095254650828067566662873690987816894829072083255546808437998948262331985283935053089653777326288461633662222876982198867465436674744042432743651550489343149393914796194044002221051017141748003688084012647080685567743216228355220114804663715659121373450747856947683463616792101806445070648000277502684916746550586856935673420670581136429224554405758925724208241314695689016758940256776311356919292033376587141660230105703089634572075440370847469940168269282808481184289314848524948644871927809676271275775397027668605952496716674183485704422507197965004714951050492214776567636938662976979522110718264549734772662425709429322582798502585509785265383207606726317164309505995087807523710333101197857547331541421808427543863591778117054309827482385045648019095610299291824318237525357709750539565187697510374970888692180205189339507238539205144634197265287286965110862571492198849978748873771345686209167058", fn = "3.1415926535897932384626433832795028841971693993751058209749445923078164062862089986280348253421170679821480865132823066470938446095505822317253594081284811174502841027019385211055596446229489549303819644288109756659334461284756482337867831652712019091456485669234603486104543266482133936072602491412737245870066063155881748815209209628292540917153643678925903600113305305488204665213841469519415116094330572703657595919530921861173819326117931051185480744623799627495673518857527248912279381830119491298336733624406566430860213949463952247371907021798609437027705392171762931767523846748184676694051320005681271452635608277857713427577896091736371787214684409012249534301465495853710507922796892589235420199561121290219608640344181598136297747713099605187072113499999983729780499510597317328160963185950244594553469083026425223082533446850352619311881710100031378387528865875332083814206171776691473035982534904287554687311595628638823537875937519577818577805321712268066130019278766111959092164201989380952572010654858632789", ss = {
9
- // These values must be integers within the stated ranges (inclusive).
10
- // Most of these values can be changed at run-time using the `Decimal.config` method.
11
- // The maximum number of significant digits of the result of a calculation or base conversion.
12
- // E.g. `Decimal.config({ precision: 20 });`
13
- precision: 20,
14
- // 1 to MAX_DIGITS
15
- // The rounding mode used when rounding to `precision`.
16
- //
17
- // ROUND_UP 0 Away from zero.
18
- // ROUND_DOWN 1 Towards zero.
19
- // ROUND_CEIL 2 Towards +Infinity.
20
- // ROUND_FLOOR 3 Towards -Infinity.
21
- // ROUND_HALF_UP 4 Towards nearest neighbour. If equidistant, up.
22
- // ROUND_HALF_DOWN 5 Towards nearest neighbour. If equidistant, down.
23
- // ROUND_HALF_EVEN 6 Towards nearest neighbour. If equidistant, towards even neighbour.
24
- // ROUND_HALF_CEIL 7 Towards nearest neighbour. If equidistant, towards +Infinity.
25
- // ROUND_HALF_FLOOR 8 Towards nearest neighbour. If equidistant, towards -Infinity.
26
- //
27
- // E.g.
28
- // `Decimal.rounding = 4;`
29
- // `Decimal.rounding = Decimal.ROUND_HALF_UP;`
30
- rounding: 4,
31
- // 0 to 8
32
- // The modulo mode used when calculating the modulus: a mod n.
33
- // The quotient (q = a / n) is calculated according to the corresponding rounding mode.
34
- // The remainder (r) is calculated as: r = a - n * q.
35
- //
36
- // UP 0 The remainder is positive if the dividend is negative, else is negative.
37
- // DOWN 1 The remainder has the same sign as the dividend (JavaScript %).
38
- // FLOOR 3 The remainder has the same sign as the divisor (Python %).
39
- // HALF_EVEN 6 The IEEE 754 remainder function.
40
- // EUCLID 9 Euclidian division. q = sign(n) * floor(a / abs(n)). Always positive.
41
- //
42
- // Truncated division (1), floored division (3), the IEEE 754 remainder (6), and Euclidian
43
- // division (9) are commonly used for the modulus operation. The other rounding modes can also
44
- // be used, but they may not give useful results.
45
- modulo: 1,
46
- // 0 to 9
47
- // The exponent value at and beneath which `toString` returns exponential notation.
48
- // JavaScript numbers: -7
49
- toExpNeg: -7,
50
- // 0 to -EXP_LIMIT
51
- // The exponent value at and above which `toString` returns exponential notation.
52
- // JavaScript numbers: 21
53
- toExpPos: 21,
54
- // 0 to EXP_LIMIT
55
- // The minimum exponent value, beneath which underflow to zero occurs.
56
- // JavaScript numbers: -324 (5e-324)
57
- minE: -Ht,
58
- // -1 to -EXP_LIMIT
59
- // The maximum exponent value, above which overflow to Infinity occurs.
60
- // JavaScript numbers: 308 (1.7976931348623157e+308)
61
- maxE: Ht,
62
- // 1 to EXP_LIMIT
63
- // Whether to use cryptographically-secure random number generation, if available.
64
- crypto: !1
65
- // true/false
66
- }, Vs, Tt, X = !0, hn = "[DecimalError] ", wt = hn + "Invalid argument: ", Hs = hn + "Precision limit exceeded", Ks = hn + "crypto unavailable", Gs = "[object Decimal]", Ke = Math.floor, Me = Math.pow, Pi = /^0b([01]+(\.[01]*)?|\.[01]+)(p[+-]?\d+)?$/i, vi = /^0x([0-9a-f]+(\.[0-9a-f]*)?|\.[0-9a-f]+)(p[+-]?\d+)?$/i, ki = /^0o([0-7]+(\.[0-7]*)?|\.[0-7]+)(p[+-]?\d+)?$/i, qs = /^(\d+(\.\d*)?|\.\d+)(e[+-]?\d+)?$/i, ot = 1e7, $ = 7, Di = 9007199254740991, Fi = un.length - 1, is = fn.length - 1, O = { toStringTag: Gs };
67
- O.absoluteValue = O.abs = function() {
68
- var e = new this.constructor(this);
69
- return e.s < 0 && (e.s = 1), _(e);
70
- };
71
- O.ceil = function() {
72
- return _(new this.constructor(this), this.e + 1, 2);
73
- };
74
- O.clampedTo = O.clamp = function(e, t) {
75
- var r, n = this, a = n.constructor;
76
- if (e = new a(e), t = new a(t), !e.s || !t.s) return new a(NaN);
77
- if (e.gt(t)) throw Error(wt + t);
78
- return r = n.cmp(e), r < 0 ? e : n.cmp(t) > 0 ? t : new a(n);
79
- };
80
- O.comparedTo = O.cmp = function(e) {
81
- var t, r, n, a, o = this, i = o.d, l = (e = new o.constructor(e)).d, p = o.s, f = e.s;
82
- if (!i || !l)
83
- return !p || !f ? NaN : p !== f ? p : i === l ? 0 : !i ^ p < 0 ? 1 : -1;
84
- if (!i[0] || !l[0]) return i[0] ? p : l[0] ? -f : 0;
85
- if (p !== f) return p;
86
- if (o.e !== e.e) return o.e > e.e ^ p < 0 ? 1 : -1;
87
- for (n = i.length, a = l.length, t = 0, r = n < a ? n : a; t < r; ++t)
88
- if (i[t] !== l[t]) return i[t] > l[t] ^ p < 0 ? 1 : -1;
89
- return n === a ? 0 : n > a ^ p < 0 ? 1 : -1;
90
- };
91
- O.cosine = O.cos = function() {
92
- var e, t, r = this, n = r.constructor;
93
- return r.d ? r.d[0] ? (e = n.precision, t = n.rounding, n.precision = e + Math.max(r.e, r.sd()) + $, n.rounding = 1, r = Bi(n, Zs(n, r)), n.precision = e, n.rounding = t, _(Tt == 2 || Tt == 3 ? r.neg() : r, e, t, !0)) : new n(1) : new n(NaN);
94
- };
95
- O.cubeRoot = O.cbrt = function() {
96
- var e, t, r, n, a, o, i, l, p, f, g = this, m = g.constructor;
97
- if (!g.isFinite() || g.isZero()) return new m(g);
98
- for (X = !1, o = g.s * Me(g.s * g, 1 / 3), !o || Math.abs(o) == 1 / 0 ? (r = Fe(g.d), e = g.e, (o = (e - r.length + 1) % 3) && (r += o == 1 || o == -2 ? "0" : "00"), o = Me(r, 1 / 3), e = Ke((e + 1) / 3) - (e % 3 == (e < 0 ? -1 : 2)), o == 1 / 0 ? r = "5e" + e : (r = o.toExponential(), r = r.slice(0, r.indexOf("e") + 1) + e), n = new m(r), n.s = g.s) : n = new m(o.toString()), i = (e = m.precision) + 3; ; )
99
- if (l = n, p = l.times(l).times(l), f = p.plus(g), n = ge(f.plus(g).times(l), f.plus(p), i + 2, 1), Fe(l.d).slice(0, i) === (r = Fe(n.d)).slice(0, i))
100
- if (r = r.slice(i - 3, i + 1), r == "9999" || !a && r == "4999") {
101
- if (!a && (_(l, e + 1, 0), l.times(l).times(l).eq(g))) {
102
- n = l;
103
- break;
104
- }
105
- i += 4, a = 1;
106
- } else {
107
- (!+r || !+r.slice(1) && r.charAt(0) == "5") && (_(n, e + 1, 1), t = !n.times(n).times(n).eq(g));
108
- break;
109
- }
110
- return X = !0, _(n, e, m.rounding, t);
111
- };
112
- O.decimalPlaces = O.dp = function() {
113
- var e, t = this.d, r = NaN;
114
- if (t) {
115
- if (e = t.length - 1, r = (e - Ke(this.e / $)) * $, e = t[e], e) for (; e % 10 == 0; e /= 10) r--;
116
- r < 0 && (r = 0);
117
- }
118
- return r;
119
- };
120
- O.dividedBy = O.div = function(e) {
121
- return ge(this, new this.constructor(e));
122
- };
123
- O.dividedToIntegerBy = O.divToInt = function(e) {
124
- var t = this, r = t.constructor;
125
- return _(ge(t, new r(e), 0, 1, 1), r.precision, r.rounding);
126
- };
127
- O.equals = O.eq = function(e) {
128
- return this.cmp(e) === 0;
129
- };
130
- O.floor = function() {
131
- return _(new this.constructor(this), this.e + 1, 3);
132
- };
133
- O.greaterThan = O.gt = function(e) {
134
- return this.cmp(e) > 0;
135
- };
136
- O.greaterThanOrEqualTo = O.gte = function(e) {
137
- var t = this.cmp(e);
138
- return t == 1 || t === 0;
139
- };
140
- O.hyperbolicCosine = O.cosh = function() {
141
- var e, t, r, n, a, o = this, i = o.constructor, l = new i(1);
142
- if (!o.isFinite()) return new i(o.s ? 1 / 0 : NaN);
143
- if (o.isZero()) return l;
144
- r = i.precision, n = i.rounding, i.precision = r + Math.max(o.e, o.sd()) + 4, i.rounding = 1, a = o.d.length, a < 32 ? (e = Math.ceil(a / 3), t = (1 / mn(4, e)).toString()) : (e = 16, t = "2.3283064365386962890625e-10"), o = Kt(i, 1, o.times(t), new i(1), !0);
145
- for (var p, f = e, g = new i(8); f--; )
146
- p = o.times(o), o = l.minus(p.times(g.minus(p.times(g))));
147
- return _(o, i.precision = r, i.rounding = n, !0);
148
- };
149
- O.hyperbolicSine = O.sinh = function() {
150
- var e, t, r, n, a = this, o = a.constructor;
151
- if (!a.isFinite() || a.isZero()) return new o(a);
152
- if (t = o.precision, r = o.rounding, o.precision = t + Math.max(a.e, a.sd()) + 4, o.rounding = 1, n = a.d.length, n < 3)
153
- a = Kt(o, 2, a, a, !0);
154
- else {
155
- e = 1.4 * Math.sqrt(n), e = e > 16 ? 16 : e | 0, a = a.times(1 / mn(5, e)), a = Kt(o, 2, a, a, !0);
156
- for (var i, l = new o(5), p = new o(16), f = new o(20); e--; )
157
- i = a.times(a), a = a.times(l.plus(i.times(p.times(i).plus(f))));
158
- }
159
- return o.precision = t, o.rounding = r, _(a, t, r, !0);
160
- };
161
- O.hyperbolicTangent = O.tanh = function() {
162
- var e, t, r = this, n = r.constructor;
163
- return r.isFinite() ? r.isZero() ? new n(r) : (e = n.precision, t = n.rounding, n.precision = e + 7, n.rounding = 1, ge(r.sinh(), r.cosh(), n.precision = e, n.rounding = t)) : new n(r.s);
164
- };
165
- O.inverseCosine = O.acos = function() {
166
- var e = this, t = e.constructor, r = e.abs().cmp(1), n = t.precision, a = t.rounding;
167
- return r !== -1 ? r === 0 ? e.isNeg() ? pt(t, n, a) : new t(0) : new t(NaN) : e.isZero() ? pt(t, n + 4, a).times(0.5) : (t.precision = n + 6, t.rounding = 1, e = new t(1).minus(e).div(e.plus(1)).sqrt().atan(), t.precision = n, t.rounding = a, e.times(2));
168
- };
169
- O.inverseHyperbolicCosine = O.acosh = function() {
170
- var e, t, r = this, n = r.constructor;
171
- return r.lte(1) ? new n(r.eq(1) ? 0 : NaN) : r.isFinite() ? (e = n.precision, t = n.rounding, n.precision = e + Math.max(Math.abs(r.e), r.sd()) + 4, n.rounding = 1, X = !1, r = r.times(r).minus(1).sqrt().plus(r), X = !0, n.precision = e, n.rounding = t, r.ln()) : new n(r);
172
- };
173
- O.inverseHyperbolicSine = O.asinh = function() {
174
- var e, t, r = this, n = r.constructor;
175
- return !r.isFinite() || r.isZero() ? new n(r) : (e = n.precision, t = n.rounding, n.precision = e + 2 * Math.max(Math.abs(r.e), r.sd()) + 6, n.rounding = 1, X = !1, r = r.times(r).plus(1).sqrt().plus(r), X = !0, n.precision = e, n.rounding = t, r.ln());
176
- };
177
- O.inverseHyperbolicTangent = O.atanh = function() {
178
- var e, t, r, n, a = this, o = a.constructor;
179
- return a.isFinite() ? a.e >= 0 ? new o(a.abs().eq(1) ? a.s / 0 : a.isZero() ? a : NaN) : (e = o.precision, t = o.rounding, n = a.sd(), Math.max(n, e) < 2 * -a.e - 1 ? _(new o(a), e, t, !0) : (o.precision = r = n - a.e, a = ge(a.plus(1), new o(1).minus(a), r + e, 1), o.precision = e + 4, o.rounding = 1, a = a.ln(), o.precision = e, o.rounding = t, a.times(0.5))) : new o(NaN);
180
- };
181
- O.inverseSine = O.asin = function() {
182
- var e, t, r, n, a = this, o = a.constructor;
183
- return a.isZero() ? new o(a) : (t = a.abs().cmp(1), r = o.precision, n = o.rounding, t !== -1 ? t === 0 ? (e = pt(o, r + 4, n).times(0.5), e.s = a.s, e) : new o(NaN) : (o.precision = r + 6, o.rounding = 1, a = a.div(new o(1).minus(a.times(a)).sqrt().plus(1)).atan(), o.precision = r, o.rounding = n, a.times(2)));
184
- };
185
- O.inverseTangent = O.atan = function() {
186
- var e, t, r, n, a, o, i, l, p, f = this, g = f.constructor, m = g.precision, h = g.rounding;
187
- if (f.isFinite()) {
188
- if (f.isZero())
189
- return new g(f);
190
- if (f.abs().eq(1) && m + 4 <= is)
191
- return i = pt(g, m + 4, h).times(0.25), i.s = f.s, i;
192
- } else {
193
- if (!f.s) return new g(NaN);
194
- if (m + 4 <= is)
195
- return i = pt(g, m + 4, h).times(0.5), i.s = f.s, i;
196
- }
197
- for (g.precision = l = m + 10, g.rounding = 1, r = Math.min(28, l / $ + 2 | 0), e = r; e; --e) f = f.div(f.times(f).plus(1).sqrt().plus(1));
198
- for (X = !1, t = Math.ceil(l / $), n = 1, p = f.times(f), i = new g(f), a = f; e !== -1; )
199
- if (a = a.times(p), o = i.minus(a.div(n += 2)), a = a.times(p), i = o.plus(a.div(n += 2)), i.d[t] !== void 0) for (e = t; i.d[e] === o.d[e] && e--; ) ;
200
- return r && (i = i.times(2 << r - 1)), X = !0, _(i, g.precision = m, g.rounding = h, !0);
201
- };
202
- O.isFinite = function() {
203
- return !!this.d;
204
- };
205
- O.isInteger = O.isInt = function() {
206
- return !!this.d && Ke(this.e / $) > this.d.length - 2;
207
- };
208
- O.isNaN = function() {
209
- return !this.s;
210
- };
211
- O.isNegative = O.isNeg = function() {
212
- return this.s < 0;
213
- };
214
- O.isPositive = O.isPos = function() {
215
- return this.s > 0;
216
- };
217
- O.isZero = function() {
218
- return !!this.d && this.d[0] === 0;
219
- };
220
- O.lessThan = O.lt = function(e) {
221
- return this.cmp(e) < 0;
222
- };
223
- O.lessThanOrEqualTo = O.lte = function(e) {
224
- return this.cmp(e) < 1;
225
- };
226
- O.logarithm = O.log = function(e) {
227
- var t, r, n, a, o, i, l, p, f = this, g = f.constructor, m = g.precision, h = g.rounding, x = 5;
228
- if (e == null)
229
- e = new g(10), t = !0;
230
- else {
231
- if (e = new g(e), r = e.d, e.s < 0 || !r || !r[0] || e.eq(1)) return new g(NaN);
232
- t = e.eq(10);
233
- }
234
- if (r = f.d, f.s < 0 || !r || !r[0] || f.eq(1))
235
- return new g(r && !r[0] ? -1 / 0 : f.s != 1 ? NaN : r ? 0 : 1 / 0);
236
- if (t)
237
- if (r.length > 1)
238
- o = !0;
239
- else {
240
- for (a = r[0]; a % 10 === 0; ) a /= 10;
241
- o = a !== 1;
242
- }
243
- if (X = !1, l = m + x, i = Ot(f, l), n = t ? pn(g, l + 10) : Ot(e, l), p = ge(i, n, l, 1), Tr(p.d, a = m, h))
244
- do
245
- if (l += 10, i = Ot(f, l), n = t ? pn(g, l + 10) : Ot(e, l), p = ge(i, n, l, 1), !o) {
246
- +Fe(p.d).slice(a + 1, a + 15) + 1 == 1e14 && (p = _(p, m + 1, 0));
247
- break;
248
- }
249
- while (Tr(p.d, a += 10, h));
250
- return X = !0, _(p, m, h);
251
- };
252
- O.minus = O.sub = function(e) {
253
- var t, r, n, a, o, i, l, p, f, g, m, h, x = this, N = x.constructor;
254
- if (e = new N(e), !x.d || !e.d)
255
- return !x.s || !e.s ? e = new N(NaN) : x.d ? e.s = -e.s : e = new N(e.d || x.s !== e.s ? x : NaN), e;
256
- if (x.s != e.s)
257
- return e.s = -e.s, x.plus(e);
258
- if (f = x.d, h = e.d, l = N.precision, p = N.rounding, !f[0] || !h[0]) {
259
- if (h[0]) e.s = -e.s;
260
- else if (f[0]) e = new N(x);
261
- else return new N(p === 3 ? -0 : 0);
262
- return X ? _(e, l, p) : e;
263
- }
264
- if (r = Ke(e.e / $), g = Ke(x.e / $), f = f.slice(), o = g - r, o) {
265
- for (m = o < 0, m ? (t = f, o = -o, i = h.length) : (t = h, r = g, i = f.length), n = Math.max(Math.ceil(l / $), i) + 2, o > n && (o = n, t.length = 1), t.reverse(), n = o; n--; ) t.push(0);
266
- t.reverse();
267
- } else {
268
- for (n = f.length, i = h.length, m = n < i, m && (i = n), n = 0; n < i; n++)
269
- if (f[n] != h[n]) {
270
- m = f[n] < h[n];
271
- break;
272
- }
273
- o = 0;
274
- }
275
- for (m && (t = f, f = h, h = t, e.s = -e.s), i = f.length, n = h.length - i; n > 0; --n) f[i++] = 0;
276
- for (n = h.length; n > o; ) {
277
- if (f[--n] < h[n]) {
278
- for (a = n; a && f[--a] === 0; ) f[a] = ot - 1;
279
- --f[a], f[n] += ot;
280
- }
281
- f[n] -= h[n];
282
- }
283
- for (; f[--i] === 0; ) f.pop();
284
- for (; f[0] === 0; f.shift()) --r;
285
- return f[0] ? (e.d = f, e.e = dn(f, r), X ? _(e, l, p) : e) : new N(p === 3 ? -0 : 0);
286
- };
287
- O.modulo = O.mod = function(e) {
288
- var t, r = this, n = r.constructor;
289
- return e = new n(e), !r.d || !e.s || e.d && !e.d[0] ? new n(NaN) : !e.d || r.d && !r.d[0] ? _(new n(r), n.precision, n.rounding) : (X = !1, n.modulo == 9 ? (t = ge(r, e.abs(), 0, 3, 1), t.s *= e.s) : t = ge(r, e, 0, n.modulo, 1), t = t.times(e), X = !0, r.minus(t));
290
- };
291
- O.naturalExponential = O.exp = function() {
292
- return as(this);
293
- };
294
- O.naturalLogarithm = O.ln = function() {
295
- return Ot(this);
296
- };
297
- O.negated = O.neg = function() {
298
- var e = new this.constructor(this);
299
- return e.s = -e.s, _(e);
300
- };
301
- O.plus = O.add = function(e) {
302
- var t, r, n, a, o, i, l, p, f, g, m = this, h = m.constructor;
303
- if (e = new h(e), !m.d || !e.d)
304
- return !m.s || !e.s ? e = new h(NaN) : m.d || (e = new h(e.d || m.s === e.s ? m : NaN)), e;
305
- if (m.s != e.s)
306
- return e.s = -e.s, m.minus(e);
307
- if (f = m.d, g = e.d, l = h.precision, p = h.rounding, !f[0] || !g[0])
308
- return g[0] || (e = new h(m)), X ? _(e, l, p) : e;
309
- if (o = Ke(m.e / $), n = Ke(e.e / $), f = f.slice(), a = o - n, a) {
310
- for (a < 0 ? (r = f, a = -a, i = g.length) : (r = g, n = o, i = f.length), o = Math.ceil(l / $), i = o > i ? o + 1 : i + 1, a > i && (a = i, r.length = 1), r.reverse(); a--; ) r.push(0);
311
- r.reverse();
312
- }
313
- for (i = f.length, a = g.length, i - a < 0 && (a = i, r = g, g = f, f = r), t = 0; a; )
314
- t = (f[--a] = f[a] + g[a] + t) / ot | 0, f[a] %= ot;
315
- for (t && (f.unshift(t), ++n), i = f.length; f[--i] == 0; ) f.pop();
316
- return e.d = f, e.e = dn(f, n), X ? _(e, l, p) : e;
317
- };
318
- O.precision = O.sd = function(e) {
319
- var t, r = this;
320
- if (e !== void 0 && e !== !!e && e !== 1 && e !== 0) throw Error(wt + e);
321
- return r.d ? (t = Ws(r.d), e && r.e + 1 > t && (t = r.e + 1)) : t = NaN, t;
322
- };
323
- O.round = function() {
324
- var e = this, t = e.constructor;
325
- return _(new t(e), e.e + 1, t.rounding);
326
- };
327
- O.sine = O.sin = function() {
328
- var e, t, r = this, n = r.constructor;
329
- return r.isFinite() ? r.isZero() ? new n(r) : (e = n.precision, t = n.rounding, n.precision = e + Math.max(r.e, r.sd()) + $, n.rounding = 1, r = Ui(n, Zs(n, r)), n.precision = e, n.rounding = t, _(Tt > 2 ? r.neg() : r, e, t, !0)) : new n(NaN);
330
- };
331
- O.squareRoot = O.sqrt = function() {
332
- var e, t, r, n, a, o, i = this, l = i.d, p = i.e, f = i.s, g = i.constructor;
333
- if (f !== 1 || !l || !l[0])
334
- return new g(!f || f < 0 && (!l || l[0]) ? NaN : l ? i : 1 / 0);
335
- for (X = !1, f = Math.sqrt(+i), f == 0 || f == 1 / 0 ? (t = Fe(l), (t.length + p) % 2 == 0 && (t += "0"), f = Math.sqrt(t), p = Ke((p + 1) / 2) - (p < 0 || p % 2), f == 1 / 0 ? t = "5e" + p : (t = f.toExponential(), t = t.slice(0, t.indexOf("e") + 1) + p), n = new g(t)) : n = new g(f.toString()), r = (p = g.precision) + 3; ; )
336
- if (o = n, n = o.plus(ge(i, o, r + 2, 1)).times(0.5), Fe(o.d).slice(0, r) === (t = Fe(n.d)).slice(0, r))
337
- if (t = t.slice(r - 3, r + 1), t == "9999" || !a && t == "4999") {
338
- if (!a && (_(o, p + 1, 0), o.times(o).eq(i))) {
339
- n = o;
340
- break;
341
- }
342
- r += 4, a = 1;
343
- } else {
344
- (!+t || !+t.slice(1) && t.charAt(0) == "5") && (_(n, p + 1, 1), e = !n.times(n).eq(i));
345
- break;
346
- }
347
- return X = !0, _(n, p, g.rounding, e);
348
- };
349
- O.tangent = O.tan = function() {
350
- var e, t, r = this, n = r.constructor;
351
- return r.isFinite() ? r.isZero() ? new n(r) : (e = n.precision, t = n.rounding, n.precision = e + 10, n.rounding = 1, r = r.sin(), r.s = 1, r = ge(r, new n(1).minus(r.times(r)).sqrt(), e + 10, 0), n.precision = e, n.rounding = t, _(Tt == 2 || Tt == 4 ? r.neg() : r, e, t, !0)) : new n(NaN);
352
- };
353
- O.times = O.mul = function(e) {
354
- var t, r, n, a, o, i, l, p, f, g = this, m = g.constructor, h = g.d, x = (e = new m(e)).d;
355
- if (e.s *= g.s, !h || !h[0] || !x || !x[0])
356
- return new m(!e.s || h && !h[0] && !x || x && !x[0] && !h ? NaN : !h || !x ? e.s / 0 : e.s * 0);
357
- for (r = Ke(g.e / $) + Ke(e.e / $), p = h.length, f = x.length, p < f && (o = h, h = x, x = o, i = p, p = f, f = i), o = [], i = p + f, n = i; n--; ) o.push(0);
358
- for (n = f; --n >= 0; ) {
359
- for (t = 0, a = p + n; a > n; )
360
- l = o[a] + x[n] * h[a - n - 1] + t, o[a--] = l % ot | 0, t = l / ot | 0;
361
- o[a] = (o[a] + t) % ot | 0;
362
- }
363
- for (; !o[--i]; ) o.pop();
364
- return t ? ++r : o.shift(), e.d = o, e.e = dn(o, r), X ? _(e, m.precision, m.rounding) : e;
365
- };
366
- O.toBinary = function(e, t) {
367
- return cs(this, 2, e, t);
368
- };
369
- O.toDecimalPlaces = O.toDP = function(e, t) {
370
- var r = this, n = r.constructor;
371
- return r = new n(r), e === void 0 ? r : (Ze(e, 0, bt), t === void 0 ? t = n.rounding : Ze(t, 0, 8), _(r, e + r.e + 1, t));
372
- };
373
- O.toExponential = function(e, t) {
374
- var r, n = this, a = n.constructor;
375
- return e === void 0 ? r = gt(n, !0) : (Ze(e, 0, bt), t === void 0 ? t = a.rounding : Ze(t, 0, 8), n = _(new a(n), e + 1, t), r = gt(n, !0, e + 1)), n.isNeg() && !n.isZero() ? "-" + r : r;
376
- };
377
- O.toFixed = function(e, t) {
378
- var r, n, a = this, o = a.constructor;
379
- return e === void 0 ? r = gt(a) : (Ze(e, 0, bt), t === void 0 ? t = o.rounding : Ze(t, 0, 8), n = _(new o(a), e + a.e + 1, t), r = gt(n, !1, e + n.e + 1)), a.isNeg() && !a.isZero() ? "-" + r : r;
380
- };
381
- O.toFraction = function(e) {
382
- var t, r, n, a, o, i, l, p, f, g, m, h, x = this, N = x.d, w = x.constructor;
383
- if (!N) return new w(x);
384
- if (f = r = new w(1), n = p = new w(0), t = new w(n), o = t.e = Ws(N) - x.e - 1, i = o % $, t.d[0] = Me(10, i < 0 ? $ + i : i), e == null)
385
- e = o > 0 ? t : f;
386
- else {
387
- if (l = new w(e), !l.isInt() || l.lt(f)) throw Error(wt + l);
388
- e = l.gt(t) ? o > 0 ? t : f : l;
389
- }
390
- for (X = !1, l = new w(Fe(N)), g = w.precision, w.precision = o = N.length * $ * 2; m = ge(l, t, 0, 1, 1), a = r.plus(m.times(n)), a.cmp(e) != 1; )
391
- r = n, n = a, a = f, f = p.plus(m.times(a)), p = a, a = t, t = l.minus(m.times(a)), l = a;
392
- return a = ge(e.minus(r), n, 0, 1, 1), p = p.plus(a.times(f)), r = r.plus(a.times(n)), p.s = f.s = x.s, h = ge(f, n, o, 1).minus(x).abs().cmp(ge(p, r, o, 1).minus(x).abs()) < 1 ? [f, n] : [p, r], w.precision = g, X = !0, h;
393
- };
394
- O.toHexadecimal = O.toHex = function(e, t) {
395
- return cs(this, 16, e, t);
396
- };
397
- O.toNearest = function(e, t) {
398
- var r = this, n = r.constructor;
399
- if (r = new n(r), e == null) {
400
- if (!r.d) return r;
401
- e = new n(1), t = n.rounding;
402
- } else {
403
- if (e = new n(e), t === void 0 ? t = n.rounding : Ze(t, 0, 8), !r.d) return e.s ? r : e;
404
- if (!e.d)
405
- return e.s && (e.s = r.s), e;
406
- }
407
- return e.d[0] ? (X = !1, r = ge(r, e, 0, t, 1).times(e), X = !0, _(r)) : (e.s = r.s, r = e), r;
408
- };
409
- O.toNumber = function() {
410
- return +this;
411
- };
412
- O.toOctal = function(e, t) {
413
- return cs(this, 8, e, t);
414
- };
415
- O.toPower = O.pow = function(e) {
416
- var t, r, n, a, o, i, l = this, p = l.constructor, f = +(e = new p(e));
417
- if (!l.d || !e.d || !l.d[0] || !e.d[0]) return new p(Me(+l, f));
418
- if (l = new p(l), l.eq(1)) return l;
419
- if (n = p.precision, o = p.rounding, e.eq(1)) return _(l, n, o);
420
- if (t = Ke(e.e / $), t >= e.d.length - 1 && (r = f < 0 ? -f : f) <= Di)
421
- return a = Xs(p, l, r, n), e.s < 0 ? new p(1).div(a) : _(a, n, o);
422
- if (i = l.s, i < 0) {
423
- if (t < e.d.length - 1) return new p(NaN);
424
- if (e.d[t] & 1 || (i = 1), l.e == 0 && l.d[0] == 1 && l.d.length == 1)
425
- return l.s = i, l;
426
- }
427
- return r = Me(+l, f), t = r == 0 || !isFinite(r) ? Ke(f * (Math.log("0." + Fe(l.d)) / Math.LN10 + l.e + 1)) : new p(r + "").e, t > p.maxE + 1 || t < p.minE - 1 ? new p(t > 0 ? i / 0 : 0) : (X = !1, p.rounding = l.s = 1, r = Math.min(12, (t + "").length), a = as(e.times(Ot(l, n + r)), n), a.d && (a = _(a, n + 5, 1), Tr(a.d, n, o) && (t = n + 10, a = _(as(e.times(Ot(l, t + r)), t), t + 5, 1), +Fe(a.d).slice(n + 1, n + 15) + 1 == 1e14 && (a = _(a, n + 1, 0)))), a.s = i, X = !0, p.rounding = o, _(a, n, o));
428
- };
429
- O.toPrecision = function(e, t) {
430
- var r, n = this, a = n.constructor;
431
- return e === void 0 ? r = gt(n, n.e <= a.toExpNeg || n.e >= a.toExpPos) : (Ze(e, 1, bt), t === void 0 ? t = a.rounding : Ze(t, 0, 8), n = _(new a(n), e, t), r = gt(n, e <= n.e || n.e <= a.toExpNeg, e)), n.isNeg() && !n.isZero() ? "-" + r : r;
432
- };
433
- O.toSignificantDigits = O.toSD = function(e, t) {
434
- var r = this, n = r.constructor;
435
- return e === void 0 ? (e = n.precision, t = n.rounding) : (Ze(e, 1, bt), t === void 0 ? t = n.rounding : Ze(t, 0, 8)), _(new n(r), e, t);
436
- };
437
- O.toString = function() {
438
- var e = this, t = e.constructor, r = gt(e, e.e <= t.toExpNeg || e.e >= t.toExpPos);
439
- return e.isNeg() && !e.isZero() ? "-" + r : r;
440
- };
441
- O.truncated = O.trunc = function() {
442
- return _(new this.constructor(this), this.e + 1, 1);
443
- };
444
- O.valueOf = O.toJSON = function() {
445
- var e = this, t = e.constructor, r = gt(e, e.e <= t.toExpNeg || e.e >= t.toExpPos);
446
- return e.isNeg() ? "-" + r : r;
447
- };
448
- function Fe(e) {
449
- var t, r, n, a = e.length - 1, o = "", i = e[0];
450
- if (a > 0) {
451
- for (o += i, t = 1; t < a; t++)
452
- n = e[t] + "", r = $ - n.length, r && (o += St(r)), o += n;
453
- i = e[t], n = i + "", r = $ - n.length, r && (o += St(r));
454
- } else if (i === 0)
455
- return "0";
456
- for (; i % 10 === 0; ) i /= 10;
457
- return o + i;
458
- }
459
- function Ze(e, t, r) {
460
- if (e !== ~~e || e < t || e > r)
461
- throw Error(wt + e);
462
- }
463
- function Tr(e, t, r, n) {
464
- var a, o, i, l;
465
- for (o = e[0]; o >= 10; o /= 10) --t;
466
- return --t < 0 ? (t += $, a = 0) : (a = Math.ceil((t + 1) / $), t %= $), o = Me(10, $ - t), l = e[a] % o | 0, n == null ? t < 3 ? (t == 0 ? l = l / 100 | 0 : t == 1 && (l = l / 10 | 0), i = r < 4 && l == 99999 || r > 3 && l == 49999 || l == 5e4 || l == 0) : i = (r < 4 && l + 1 == o || r > 3 && l + 1 == o / 2) && (e[a + 1] / o / 100 | 0) == Me(10, t - 2) - 1 || (l == o / 2 || l == 0) && (e[a + 1] / o / 100 | 0) == 0 : t < 4 ? (t == 0 ? l = l / 1e3 | 0 : t == 1 ? l = l / 100 | 0 : t == 2 && (l = l / 10 | 0), i = (n || r < 4) && l == 9999 || !n && r > 3 && l == 4999) : i = ((n || r < 4) && l + 1 == o || !n && r > 3 && l + 1 == o / 2) && (e[a + 1] / o / 1e3 | 0) == Me(10, t - 3) - 1, i;
467
- }
468
- function cn(e, t, r) {
469
- for (var n, a = [0], o, i = 0, l = e.length; i < l; ) {
470
- for (o = a.length; o--; ) a[o] *= t;
471
- for (a[0] += ns.indexOf(e.charAt(i++)), n = 0; n < a.length; n++)
472
- a[n] > r - 1 && (a[n + 1] === void 0 && (a[n + 1] = 0), a[n + 1] += a[n] / r | 0, a[n] %= r);
473
- }
474
- return a.reverse();
475
- }
476
- function Bi(e, t) {
477
- var r, n, a;
478
- if (t.isZero()) return t;
479
- n = t.d.length, n < 32 ? (r = Math.ceil(n / 3), a = (1 / mn(4, r)).toString()) : (r = 16, a = "2.3283064365386962890625e-10"), e.precision += r, t = Kt(e, 1, t.times(a), new e(1));
480
- for (var o = r; o--; ) {
481
- var i = t.times(t);
482
- t = i.times(i).minus(i).times(8).plus(1);
483
- }
484
- return e.precision -= r, t;
485
- }
486
- var ge = /* @__PURE__ */ function() {
487
- function e(n, a, o) {
488
- var i, l = 0, p = n.length;
489
- for (n = n.slice(); p--; )
490
- i = n[p] * a + l, n[p] = i % o | 0, l = i / o | 0;
491
- return l && n.unshift(l), n;
492
- }
493
- function t(n, a, o, i) {
494
- var l, p;
495
- if (o != i)
496
- p = o > i ? 1 : -1;
497
- else
498
- for (l = p = 0; l < o; l++)
499
- if (n[l] != a[l]) {
500
- p = n[l] > a[l] ? 1 : -1;
501
- break;
502
- }
503
- return p;
504
- }
505
- function r(n, a, o, i) {
506
- for (var l = 0; o--; )
507
- n[o] -= l, l = n[o] < a[o] ? 1 : 0, n[o] = l * i + n[o] - a[o];
508
- for (; !n[0] && n.length > 1; ) n.shift();
509
- }
510
- return function(n, a, o, i, l, p) {
511
- var f, g, m, h, x, N, w, U, Q, ee, G, Y, ie, Ce, xe, ve, de, Be, Ae, rt, ct = n.constructor, _e = n.s == a.s ? 1 : -1, T = n.d, C = a.d;
512
- if (!T || !T[0] || !C || !C[0])
513
- return new ct(
514
- // Return NaN if either NaN, or both Infinity or 0.
515
- !n.s || !a.s || (T ? C && T[0] == C[0] : !C) ? NaN : (
516
- // Return ±0 if x is 0 or y is ±Infinity, or return ±Infinity as y is 0.
517
- T && T[0] == 0 || !C ? _e * 0 : _e / 0
518
- )
519
- );
520
- for (p ? (x = 1, g = n.e - a.e) : (p = ot, x = $, g = Ke(n.e / x) - Ke(a.e / x)), Ae = C.length, de = T.length, Q = new ct(_e), ee = Q.d = [], m = 0; C[m] == (T[m] || 0); m++) ;
521
- if (C[m] > (T[m] || 0) && g--, o == null ? (Ce = o = ct.precision, i = ct.rounding) : l ? Ce = o + (n.e - a.e) + 1 : Ce = o, Ce < 0)
522
- ee.push(1), N = !0;
523
- else {
524
- if (Ce = Ce / x + 2 | 0, m = 0, Ae == 1) {
525
- for (h = 0, C = C[0], Ce++; (m < de || h) && Ce--; m++)
526
- xe = h * p + (T[m] || 0), ee[m] = xe / C | 0, h = xe % C | 0;
527
- N = h || m < de;
528
- } else {
529
- for (h = p / (C[0] + 1) | 0, h > 1 && (C = e(C, h, p), T = e(T, h, p), Ae = C.length, de = T.length), ve = Ae, G = T.slice(0, Ae), Y = G.length; Y < Ae; ) G[Y++] = 0;
530
- rt = C.slice(), rt.unshift(0), Be = C[0], C[1] >= p / 2 && ++Be;
531
- do
532
- h = 0, f = t(C, G, Ae, Y), f < 0 ? (ie = G[0], Ae != Y && (ie = ie * p + (G[1] || 0)), h = ie / Be | 0, h > 1 ? (h >= p && (h = p - 1), w = e(C, h, p), U = w.length, Y = G.length, f = t(w, G, U, Y), f == 1 && (h--, r(w, Ae < U ? rt : C, U, p))) : (h == 0 && (f = h = 1), w = C.slice()), U = w.length, U < Y && w.unshift(0), r(G, w, Y, p), f == -1 && (Y = G.length, f = t(C, G, Ae, Y), f < 1 && (h++, r(G, Ae < Y ? rt : C, Y, p))), Y = G.length) : f === 0 && (h++, G = [0]), ee[m++] = h, f && G[0] ? G[Y++] = T[ve] || 0 : (G = [T[ve]], Y = 1);
533
- while ((ve++ < de || G[0] !== void 0) && Ce--);
534
- N = G[0] !== void 0;
535
- }
536
- ee[0] || ee.shift();
537
- }
538
- if (x == 1)
539
- Q.e = g, Vs = N;
540
- else {
541
- for (m = 1, h = ee[0]; h >= 10; h /= 10) m++;
542
- Q.e = m + g * x - 1, _(Q, l ? o + Q.e + 1 : o, i, N);
543
- }
544
- return Q;
545
- };
546
- }();
547
- function _(e, t, r, n) {
548
- var a, o, i, l, p, f, g, m, h, x = e.constructor;
549
- e: if (t != null) {
550
- if (m = e.d, !m) return e;
551
- for (a = 1, l = m[0]; l >= 10; l /= 10) a++;
552
- if (o = t - a, o < 0)
553
- o += $, i = t, g = m[h = 0], p = g / Me(10, a - i - 1) % 10 | 0;
554
- else if (h = Math.ceil((o + 1) / $), l = m.length, h >= l)
555
- if (n) {
556
- for (; l++ <= h; ) m.push(0);
557
- g = p = 0, a = 1, o %= $, i = o - $ + 1;
558
- } else
559
- break e;
560
- else {
561
- for (g = l = m[h], a = 1; l >= 10; l /= 10) a++;
562
- o %= $, i = o - $ + a, p = i < 0 ? 0 : g / Me(10, a - i - 1) % 10 | 0;
563
- }
564
- if (n = n || t < 0 || m[h + 1] !== void 0 || (i < 0 ? g : g % Me(10, a - i - 1)), f = r < 4 ? (p || n) && (r == 0 || r == (e.s < 0 ? 3 : 2)) : p > 5 || p == 5 && (r == 4 || n || r == 6 && // Check whether the digit to the left of the rounding digit is odd.
565
- (o > 0 ? i > 0 ? g / Me(10, a - i) : 0 : m[h - 1]) % 10 & 1 || r == (e.s < 0 ? 8 : 7)), t < 1 || !m[0])
566
- return m.length = 0, f ? (t -= e.e + 1, m[0] = Me(10, ($ - t % $) % $), e.e = -t || 0) : m[0] = e.e = 0, e;
567
- if (o == 0 ? (m.length = h, l = 1, h--) : (m.length = h + 1, l = Me(10, $ - o), m[h] = i > 0 ? (g / Me(10, a - i) % Me(10, i) | 0) * l : 0), f)
568
- for (; ; )
569
- if (h == 0) {
570
- for (o = 1, i = m[0]; i >= 10; i /= 10) o++;
571
- for (i = m[0] += l, l = 1; i >= 10; i /= 10) l++;
572
- o != l && (e.e++, m[0] == ot && (m[0] = 1));
573
- break;
574
- } else {
575
- if (m[h] += l, m[h] != ot) break;
576
- m[h--] = 0, l = 1;
577
- }
578
- for (o = m.length; m[--o] === 0; ) m.pop();
579
- }
580
- return X && (e.e > x.maxE ? (e.d = null, e.e = NaN) : e.e < x.minE && (e.e = 0, e.d = [0])), e;
581
- }
582
- function gt(e, t, r) {
583
- if (!e.isFinite()) return js(e);
584
- var n, a = e.e, o = Fe(e.d), i = o.length;
585
- return t ? (r && (n = r - i) > 0 ? o = o.charAt(0) + "." + o.slice(1) + St(n) : i > 1 && (o = o.charAt(0) + "." + o.slice(1)), o = o + (e.e < 0 ? "e" : "e+") + e.e) : a < 0 ? (o = "0." + St(-a - 1) + o, r && (n = r - i) > 0 && (o += St(n))) : a >= i ? (o += St(a + 1 - i), r && (n = r - a - 1) > 0 && (o = o + "." + St(n))) : ((n = a + 1) < i && (o = o.slice(0, n) + "." + o.slice(n)), r && (n = r - i) > 0 && (a + 1 === i && (o += "."), o += St(n))), o;
586
- }
587
- function dn(e, t) {
588
- var r = e[0];
589
- for (t *= $; r >= 10; r /= 10) t++;
590
- return t;
591
- }
592
- function pn(e, t, r) {
593
- if (t > Fi)
594
- throw X = !0, r && (e.precision = r), Error(Hs);
595
- return _(new e(un), t, 1, !0);
596
- }
597
- function pt(e, t, r) {
598
- if (t > is) throw Error(Hs);
599
- return _(new e(fn), t, r, !0);
600
- }
601
- function Ws(e) {
602
- var t = e.length - 1, r = t * $ + 1;
603
- if (t = e[t], t) {
604
- for (; t % 10 == 0; t /= 10) r--;
605
- for (t = e[0]; t >= 10; t /= 10) r++;
606
- }
607
- return r;
608
- }
609
- function St(e) {
610
- for (var t = ""; e--; ) t += "0";
611
- return t;
612
- }
613
- function Xs(e, t, r, n) {
614
- var a, o = new e(1), i = Math.ceil(n / $ + 4);
615
- for (X = !1; ; ) {
616
- if (r % 2 && (o = o.times(t), Bs(o.d, i) && (a = !0)), r = Ke(r / 2), r === 0) {
617
- r = o.d.length - 1, a && o.d[r] === 0 && ++o.d[r];
618
- break;
619
- }
620
- t = t.times(t), Bs(t.d, i);
621
- }
622
- return X = !0, o;
623
- }
624
- function Fs(e) {
625
- return e.d[e.d.length - 1] & 1;
626
- }
627
- function Qs(e, t, r) {
628
- for (var n, a, o = new e(t[0]), i = 0; ++i < t.length; ) {
629
- if (a = new e(t[i]), !a.s) {
630
- o = a;
631
- break;
632
- }
633
- n = o.cmp(a), (n === r || n === 0 && o.s === r) && (o = a);
634
- }
635
- return o;
636
- }
637
- function as(e, t) {
638
- var r, n, a, o, i, l, p, f = 0, g = 0, m = 0, h = e.constructor, x = h.rounding, N = h.precision;
639
- if (!e.d || !e.d[0] || e.e > 17)
640
- return new h(e.d ? e.d[0] ? e.s < 0 ? 0 : 1 / 0 : 1 : e.s ? e.s < 0 ? 0 : e : NaN);
641
- for (t == null ? (X = !1, p = N) : p = t, l = new h(0.03125); e.e > -2; )
642
- e = e.times(l), m += 5;
643
- for (n = Math.log(Me(2, m)) / Math.LN10 * 2 + 5 | 0, p += n, r = o = i = new h(1), h.precision = p; ; ) {
644
- if (o = _(o.times(e), p, 1), r = r.times(++g), l = i.plus(ge(o, r, p, 1)), Fe(l.d).slice(0, p) === Fe(i.d).slice(0, p)) {
645
- for (a = m; a--; ) i = _(i.times(i), p, 1);
646
- if (t == null)
647
- if (f < 3 && Tr(i.d, p - n, x, f))
648
- h.precision = p += 10, r = o = l = new h(1), g = 0, f++;
649
- else
650
- return _(i, h.precision = N, x, X = !0);
651
- else
652
- return h.precision = N, i;
653
- }
654
- i = l;
655
- }
656
- }
657
- function Ot(e, t) {
658
- var r, n, a, o, i, l, p, f, g, m, h, x = 1, N = 10, w = e, U = w.d, Q = w.constructor, ee = Q.rounding, G = Q.precision;
659
- if (w.s < 0 || !U || !U[0] || !w.e && U[0] == 1 && U.length == 1)
660
- return new Q(U && !U[0] ? -1 / 0 : w.s != 1 ? NaN : U ? 0 : w);
661
- if (t == null ? (X = !1, g = G) : g = t, Q.precision = g += N, r = Fe(U), n = r.charAt(0), Math.abs(o = w.e) < 15e14) {
662
- for (; n < 7 && n != 1 || n == 1 && r.charAt(1) > 3; )
663
- w = w.times(e), r = Fe(w.d), n = r.charAt(0), x++;
664
- o = w.e, n > 1 ? (w = new Q("0." + r), o++) : w = new Q(n + "." + r.slice(1));
665
- } else
666
- return f = pn(Q, g + 2, G).times(o + ""), w = Ot(new Q(n + "." + r.slice(1)), g - N).plus(f), Q.precision = G, t == null ? _(w, G, ee, X = !0) : w;
667
- for (m = w, p = i = w = ge(w.minus(1), w.plus(1), g, 1), h = _(w.times(w), g, 1), a = 3; ; ) {
668
- if (i = _(i.times(h), g, 1), f = p.plus(ge(i, new Q(a), g, 1)), Fe(f.d).slice(0, g) === Fe(p.d).slice(0, g))
669
- if (p = p.times(2), o !== 0 && (p = p.plus(pn(Q, g + 2, G).times(o + ""))), p = ge(p, new Q(x), g, 1), t == null)
670
- if (Tr(p.d, g - N, ee, l))
671
- Q.precision = g += N, f = i = w = ge(m.minus(1), m.plus(1), g, 1), h = _(w.times(w), g, 1), a = l = 1;
672
- else
673
- return _(p, Q.precision = G, ee, X = !0);
674
- else
675
- return Q.precision = G, p;
676
- p = f, a += 2;
677
- }
678
- }
679
- function js(e) {
680
- return String(e.s * e.s / 0);
681
- }
682
- function ln(e, t) {
683
- var r, n, a;
684
- for ((r = t.indexOf(".")) > -1 && (t = t.replace(".", "")), (n = t.search(/e/i)) > 0 ? (r < 0 && (r = n), r += +t.slice(n + 1), t = t.substring(0, n)) : r < 0 && (r = t.length), n = 0; t.charCodeAt(n) === 48; n++) ;
685
- for (a = t.length; t.charCodeAt(a - 1) === 48; --a) ;
686
- if (t = t.slice(n, a), t) {
687
- if (a -= n, e.e = r = r - n - 1, e.d = [], n = (r + 1) % $, r < 0 && (n += $), n < a) {
688
- for (n && e.d.push(+t.slice(0, n)), a -= $; n < a; ) e.d.push(+t.slice(n, n += $));
689
- t = t.slice(n), n = $ - t.length;
690
- } else
691
- n -= a;
692
- for (; n--; ) t += "0";
693
- e.d.push(+t), X && (e.e > e.constructor.maxE ? (e.d = null, e.e = NaN) : e.e < e.constructor.minE && (e.e = 0, e.d = [0]));
694
- } else
695
- e.e = 0, e.d = [0];
696
- return e;
697
- }
698
- function _i(e, t) {
699
- var r, n, a, o, i, l, p, f, g;
700
- if (t.indexOf("_") > -1) {
701
- if (t = t.replace(/(\d)_(?=\d)/g, "$1"), qs.test(t)) return ln(e, t);
702
- } else if (t === "Infinity" || t === "NaN")
703
- return +t || (e.s = NaN), e.e = NaN, e.d = null, e;
704
- if (vi.test(t))
705
- r = 16, t = t.toLowerCase();
706
- else if (Pi.test(t))
707
- r = 2;
708
- else if (ki.test(t))
709
- r = 8;
710
- else
711
- throw Error(wt + t);
712
- for (o = t.search(/p/i), o > 0 ? (p = +t.slice(o + 1), t = t.substring(2, o)) : t = t.slice(2), o = t.indexOf("."), i = o >= 0, n = e.constructor, i && (t = t.replace(".", ""), l = t.length, o = l - o, a = Xs(n, new n(r), o, o * 2)), f = cn(t, r, ot), g = f.length - 1, o = g; f[o] === 0; --o) f.pop();
713
- return o < 0 ? new n(e.s * 0) : (e.e = dn(f, g), e.d = f, X = !1, i && (e = ge(e, a, l * 4)), p && (e = e.times(Math.abs(p) < 54 ? Me(2, p) : ue.pow(2, p))), X = !0, e);
714
- }
715
- function Ui(e, t) {
716
- var r, n = t.d.length;
717
- if (n < 3)
718
- return t.isZero() ? t : Kt(e, 2, t, t);
719
- r = 1.4 * Math.sqrt(n), r = r > 16 ? 16 : r | 0, t = t.times(1 / mn(5, r)), t = Kt(e, 2, t, t);
720
- for (var a, o = new e(5), i = new e(16), l = new e(20); r--; )
721
- a = t.times(t), t = t.times(o.plus(a.times(i.times(a).minus(l))));
722
- return t;
723
- }
724
- function Kt(e, t, r, n, a) {
725
- var o, i, l, p, f = e.precision, g = Math.ceil(f / $);
726
- for (X = !1, p = r.times(r), l = new e(n); ; ) {
727
- if (i = ge(l.times(p), new e(t++ * t++), f, 1), l = a ? n.plus(i) : n.minus(i), n = ge(i.times(p), new e(t++ * t++), f, 1), i = l.plus(n), i.d[g] !== void 0) {
728
- for (o = g; i.d[o] === l.d[o] && o--; ) ;
729
- if (o == -1) break;
730
- }
731
- o = l, l = n, n = i, i = o;
732
- }
733
- return X = !0, i.d.length = g + 1, i;
734
- }
735
- function mn(e, t) {
736
- for (var r = e; --t; ) r *= e;
737
- return r;
738
- }
739
- function Zs(e, t) {
740
- var r, n = t.s < 0, a = pt(e, e.precision, 1), o = a.times(0.5);
741
- if (t = t.abs(), t.lte(o))
742
- return Tt = n ? 4 : 1, t;
743
- if (r = t.divToInt(a), r.isZero())
744
- Tt = n ? 3 : 2;
745
- else {
746
- if (t = t.minus(r.times(a)), t.lte(o))
747
- return Tt = Fs(r) ? n ? 2 : 3 : n ? 4 : 1, t;
748
- Tt = Fs(r) ? n ? 1 : 4 : n ? 3 : 2;
749
- }
750
- return t.minus(a).abs();
751
- }
752
- function cs(e, t, r, n) {
753
- var a, o, i, l, p, f, g, m, h, x = e.constructor, N = r !== void 0;
754
- if (N ? (Ze(r, 1, bt), n === void 0 ? n = x.rounding : Ze(n, 0, 8)) : (r = x.precision, n = x.rounding), !e.isFinite())
755
- g = js(e);
756
- else {
757
- for (g = gt(e), i = g.indexOf("."), N ? (a = 2, t == 16 ? r = r * 4 - 3 : t == 8 && (r = r * 3 - 2)) : a = t, i >= 0 && (g = g.replace(".", ""), h = new x(1), h.e = g.length - i, h.d = cn(gt(h), 10, a), h.e = h.d.length), m = cn(g, 10, a), o = p = m.length; m[--p] == 0; ) m.pop();
758
- if (!m[0])
759
- g = N ? "0p+0" : "0";
760
- else {
761
- if (i < 0 ? o-- : (e = new x(e), e.d = m, e.e = o, e = ge(e, h, r, n, 0, a), m = e.d, o = e.e, f = Vs), i = m[r], l = a / 2, f = f || m[r + 1] !== void 0, f = n < 4 ? (i !== void 0 || f) && (n === 0 || n === (e.s < 0 ? 3 : 2)) : i > l || i === l && (n === 4 || f || n === 6 && m[r - 1] & 1 || n === (e.s < 0 ? 8 : 7)), m.length = r, f)
762
- for (; ++m[--r] > a - 1; )
763
- m[r] = 0, r || (++o, m.unshift(1));
764
- for (p = m.length; !m[p - 1]; --p) ;
765
- for (i = 0, g = ""; i < p; i++) g += ns.charAt(m[i]);
766
- if (N) {
767
- if (p > 1)
768
- if (t == 16 || t == 8) {
769
- for (i = t == 16 ? 4 : 3, --p; p % i; p++) g += "0";
770
- for (m = cn(g, a, t), p = m.length; !m[p - 1]; --p) ;
771
- for (i = 1, g = "1."; i < p; i++) g += ns.charAt(m[i]);
772
- } else
773
- g = g.charAt(0) + "." + g.slice(1);
774
- g = g + (o < 0 ? "p" : "p+") + o;
775
- } else if (o < 0) {
776
- for (; ++o; ) g = "0" + g;
777
- g = "0." + g;
778
- } else if (++o > p) for (o -= p; o--; ) g += "0";
779
- else o < p && (g = g.slice(0, o) + "." + g.slice(o));
780
- }
781
- g = (t == 16 ? "0x" : t == 2 ? "0b" : t == 8 ? "0o" : "") + g;
782
- }
783
- return e.s < 0 ? "-" + g : g;
784
- }
785
- function Bs(e, t) {
786
- if (e.length > t)
787
- return e.length = t, !0;
788
- }
789
- function $i(e) {
790
- return new this(e).abs();
791
- }
792
- function Vi(e) {
793
- return new this(e).acos();
794
- }
795
- function Hi(e) {
796
- return new this(e).acosh();
797
- }
798
- function Ki(e, t) {
799
- return new this(e).plus(t);
800
- }
801
- function Gi(e) {
802
- return new this(e).asin();
803
- }
804
- function qi(e) {
805
- return new this(e).asinh();
806
- }
807
- function Wi(e) {
808
- return new this(e).atan();
809
- }
810
- function Xi(e) {
811
- return new this(e).atanh();
812
- }
813
- function Qi(e, t) {
814
- e = new this(e), t = new this(t);
815
- var r, n = this.precision, a = this.rounding, o = n + 4;
816
- return !e.s || !t.s ? r = new this(NaN) : !e.d && !t.d ? (r = pt(this, o, 1).times(t.s > 0 ? 0.25 : 0.75), r.s = e.s) : !t.d || e.isZero() ? (r = t.s < 0 ? pt(this, n, a) : new this(0), r.s = e.s) : !e.d || t.isZero() ? (r = pt(this, o, 1).times(0.5), r.s = e.s) : t.s < 0 ? (this.precision = o, this.rounding = 1, r = this.atan(ge(e, t, o, 1)), t = pt(this, o, 1), this.precision = n, this.rounding = a, r = e.s < 0 ? r.minus(t) : r.plus(t)) : r = this.atan(ge(e, t, o, 1)), r;
817
- }
818
- function ji(e) {
819
- return new this(e).cbrt();
820
- }
821
- function Zi(e) {
822
- return _(e = new this(e), e.e + 1, 2);
823
- }
824
- function zi(e, t, r) {
825
- return new this(e).clamp(t, r);
826
- }
827
- function Ji(e) {
828
- if (!e || typeof e != "object") throw Error(hn + "Object expected");
829
- var t, r, n, a = e.defaults === !0, o = [
830
- "precision",
831
- 1,
832
- bt,
833
- "rounding",
834
- 0,
835
- 8,
836
- "toExpNeg",
837
- -Ht,
838
- 0,
839
- "toExpPos",
840
- 0,
841
- Ht,
842
- "maxE",
843
- 0,
844
- Ht,
845
- "minE",
846
- -Ht,
847
- 0,
848
- "modulo",
849
- 0,
850
- 9
851
- ];
852
- for (t = 0; t < o.length; t += 3)
853
- if (r = o[t], a && (this[r] = ss[r]), (n = e[r]) !== void 0)
854
- if (Ke(n) === n && n >= o[t + 1] && n <= o[t + 2]) this[r] = n;
855
- else throw Error(wt + r + ": " + n);
856
- if (r = "crypto", a && (this[r] = ss[r]), (n = e[r]) !== void 0)
857
- if (n === !0 || n === !1 || n === 0 || n === 1)
858
- if (n)
859
- if (typeof crypto < "u" && crypto && (crypto.getRandomValues || crypto.randomBytes))
860
- this[r] = !0;
861
- else
862
- throw Error(Ks);
863
- else
864
- this[r] = !1;
865
- else
866
- throw Error(wt + r + ": " + n);
867
- return this;
868
- }
869
- function Yi(e) {
870
- return new this(e).cos();
871
- }
872
- function ea(e) {
873
- return new this(e).cosh();
874
- }
875
- function zs(e) {
876
- var t, r, n;
877
- function a(o) {
878
- var i, l, p, f = this;
879
- if (!(f instanceof a)) return new a(o);
880
- if (f.constructor = a, _s(o)) {
881
- f.s = o.s, X ? !o.d || o.e > a.maxE ? (f.e = NaN, f.d = null) : o.e < a.minE ? (f.e = 0, f.d = [0]) : (f.e = o.e, f.d = o.d.slice()) : (f.e = o.e, f.d = o.d ? o.d.slice() : o.d);
882
- return;
883
- }
884
- if (p = typeof o, p === "number") {
885
- if (o === 0) {
886
- f.s = 1 / o < 0 ? -1 : 1, f.e = 0, f.d = [0];
887
- return;
888
- }
889
- if (o < 0 ? (o = -o, f.s = -1) : f.s = 1, o === ~~o && o < 1e7) {
890
- for (i = 0, l = o; l >= 10; l /= 10) i++;
891
- X ? i > a.maxE ? (f.e = NaN, f.d = null) : i < a.minE ? (f.e = 0, f.d = [0]) : (f.e = i, f.d = [o]) : (f.e = i, f.d = [o]);
892
- return;
893
- }
894
- if (o * 0 !== 0) {
895
- o || (f.s = NaN), f.e = NaN, f.d = null;
896
- return;
897
- }
898
- return ln(f, o.toString());
899
- }
900
- if (p === "string")
901
- return (l = o.charCodeAt(0)) === 45 ? (o = o.slice(1), f.s = -1) : (l === 43 && (o = o.slice(1)), f.s = 1), qs.test(o) ? ln(f, o) : _i(f, o);
902
- if (p === "bigint")
903
- return o < 0 ? (o = -o, f.s = -1) : f.s = 1, ln(f, o.toString());
904
- throw Error(wt + o);
905
- }
906
- if (a.prototype = O, a.ROUND_UP = 0, a.ROUND_DOWN = 1, a.ROUND_CEIL = 2, a.ROUND_FLOOR = 3, a.ROUND_HALF_UP = 4, a.ROUND_HALF_DOWN = 5, a.ROUND_HALF_EVEN = 6, a.ROUND_HALF_CEIL = 7, a.ROUND_HALF_FLOOR = 8, a.EUCLID = 9, a.config = a.set = Ji, a.clone = zs, a.isDecimal = _s, a.abs = $i, a.acos = Vi, a.acosh = Hi, a.add = Ki, a.asin = Gi, a.asinh = qi, a.atan = Wi, a.atanh = Xi, a.atan2 = Qi, a.cbrt = ji, a.ceil = Zi, a.clamp = zi, a.cos = Yi, a.cosh = ea, a.div = ta, a.exp = ra, a.floor = na, a.hypot = sa, a.ln = ia, a.log = aa, a.log10 = ca, a.log2 = oa, a.max = la, a.min = ua, a.mod = fa, a.mul = pa, a.pow = ga, a.random = ha, a.round = da, a.sign = ma, a.sin = Ca, a.sinh = xa, a.sqrt = Aa, a.sub = Ta, a.sum = Ea, a.tan = Ra, a.tanh = Na, a.trunc = Sa, e === void 0 && (e = {}), e && e.defaults !== !0)
907
- for (n = ["precision", "rounding", "toExpNeg", "toExpPos", "maxE", "minE", "modulo", "crypto"], t = 0; t < n.length; ) e.hasOwnProperty(r = n[t++]) || (e[r] = this[r]);
908
- return a.config(e), a;
909
- }
910
- function ta(e, t) {
911
- return new this(e).div(t);
912
- }
913
- function ra(e) {
914
- return new this(e).exp();
915
- }
916
- function na(e) {
917
- return _(e = new this(e), e.e + 1, 3);
918
- }
919
- function sa() {
920
- var e, t, r = new this(0);
921
- for (X = !1, e = 0; e < arguments.length; )
922
- if (t = new this(arguments[e++]), t.d)
923
- r.d && (r = r.plus(t.times(t)));
924
- else {
925
- if (t.s)
926
- return X = !0, new this(1 / 0);
927
- r = t;
928
- }
929
- return X = !0, r.sqrt();
930
- }
931
- function _s(e) {
932
- return e instanceof ue || e && e.toStringTag === Gs || !1;
933
- }
934
- function ia(e) {
935
- return new this(e).ln();
936
- }
937
- function aa(e, t) {
938
- return new this(e).log(t);
939
- }
940
- function oa(e) {
941
- return new this(e).log(2);
942
- }
943
- function ca(e) {
944
- return new this(e).log(10);
945
- }
946
- function la() {
947
- return Qs(this, arguments, -1);
948
- }
949
- function ua() {
950
- return Qs(this, arguments, 1);
951
- }
952
- function fa(e, t) {
953
- return new this(e).mod(t);
954
- }
955
- function pa(e, t) {
956
- return new this(e).mul(t);
957
- }
958
- function ga(e, t) {
959
- return new this(e).pow(t);
960
- }
961
- function ha(e) {
962
- var t, r, n, a, o = 0, i = new this(1), l = [];
963
- if (e === void 0 ? e = this.precision : Ze(e, 1, bt), n = Math.ceil(e / $), this.crypto)
964
- if (crypto.getRandomValues)
965
- for (t = crypto.getRandomValues(new Uint32Array(n)); o < n; )
966
- a = t[o], a >= 429e7 ? t[o] = crypto.getRandomValues(new Uint32Array(1))[0] : l[o++] = a % 1e7;
967
- else if (crypto.randomBytes) {
968
- for (t = crypto.randomBytes(n *= 4); o < n; )
969
- a = t[o] + (t[o + 1] << 8) + (t[o + 2] << 16) + ((t[o + 3] & 127) << 24), a >= 214e7 ? crypto.randomBytes(4).copy(t, o) : (l.push(a % 1e7), o += 4);
970
- o = n / 4;
971
- } else
972
- throw Error(Ks);
973
- else for (; o < n; ) l[o++] = Math.random() * 1e7 | 0;
974
- for (n = l[--o], e %= $, n && e && (a = Me(10, $ - e), l[o] = (n / a | 0) * a); l[o] === 0; o--) l.pop();
975
- if (o < 0)
976
- r = 0, l = [0];
977
- else {
978
- for (r = -1; l[0] === 0; r -= $) l.shift();
979
- for (n = 1, a = l[0]; a >= 10; a /= 10) n++;
980
- n < $ && (r -= $ - n);
981
- }
982
- return i.e = r, i.d = l, i;
983
- }
984
- function da(e) {
985
- return _(e = new this(e), e.e + 1, this.rounding);
986
- }
987
- function ma(e) {
988
- return e = new this(e), e.d ? e.d[0] ? e.s : 0 * e.s : e.s || NaN;
989
- }
990
- function Ca(e) {
991
- return new this(e).sin();
992
- }
993
- function xa(e) {
994
- return new this(e).sinh();
995
- }
996
- function Aa(e) {
997
- return new this(e).sqrt();
998
- }
999
- function Ta(e, t) {
1000
- return new this(e).sub(t);
1001
- }
1002
- function Ea() {
1003
- var e = 0, t = arguments, r = new this(t[e]);
1004
- for (X = !1; r.s && ++e < t.length; ) r = r.plus(t[e]);
1005
- return X = !0, _(r, this.precision, this.rounding);
1006
- }
1007
- function Ra(e) {
1008
- return new this(e).tan();
1009
- }
1010
- function Na(e) {
1011
- return new this(e).tanh();
1012
- }
1013
- function Sa(e) {
1014
- return _(e = new this(e), e.e + 1, 1);
1015
- }
1016
- O[Symbol.for("nodejs.util.inspect.custom")] = O.toString;
1017
- O[Symbol.toStringTag] = "Decimal";
1018
- var ue = O.constructor = zs(ss);
1019
- un = new ue(un);
1020
- fn = new ue(fn);
1021
- const K = (e, t, r) => {
1022
- if (t === void 0 && (t = "failed!"), !e) {
1023
- const n = new Error(t);
1024
- throw n.location = r || re.location, n;
1025
- }
1026
- }, Oa = (e, t) => {
1027
- let r = re.messages[e];
1028
- return t && t.forEach((n, a) => {
1029
- r = r.replace(`%${a + 1}`, n);
1030
- }), `${e}: ${r}`;
1031
- }, wa = (e, t, r) => {
1032
- K(e <= t, "Invalid code range");
1033
- const n = re.reservedCodes.every((a) => t < a.first || e > a.last);
1034
- K(n, "Conflicting request for error code range"), re.reservedCodes.push({ first: e, last: t, name: r });
1035
- }, ba = (e) => {
1036
- re.location = e;
1037
- }, Ia = () => {
1038
- re.location = null;
1039
- }, Ma = (e, t) => {
1040
- e !== void 0 && (re.timeout = e ? Date.now() + e : 0, re.timeoutMessage = t || "ERROR timeout exceeded");
1041
- }, La = () => {
1042
- K(!re.timeout || re.timeout > Date.now(), re.timeoutMessage);
1043
- }, ya = (e, t) => {
1044
- re.count = e, re.countMessage = t || "ERROR count exceeded";
1045
- }, Pa = () => {
1046
- const { count: e } = re;
1047
- if (typeof e != "number" || Number.isNaN(e)) {
1048
- K(!1, "ERROR counter not set");
1049
- return;
1050
- }
1051
- K(re.count--, re.countMessage);
1052
- }, re = {
1053
- assert: K,
1054
- message: Oa,
1055
- messages: {},
1056
- reserveCodeRange: wa,
1057
- reservedCodes: [],
1058
- setLocation: ba,
1059
- clearLocation: Ia,
1060
- checkTimeout: La,
1061
- setTimeout: Ma,
1062
- setCounter: ya,
1063
- checkCounter: Pa
1064
- }, Js = (() => {
1065
- function e() {
1066
- this.nodePool = ["unused"], this.nodeMap = {};
1067
- }
1068
- e.prototype.arg = function(n) {
1069
- if (!t(this))
1070
- throw new Error("Malformed node");
1071
- return this.args.push(n), this;
1072
- }, e.prototype.argN = function(n, a) {
1073
- if (!t(this))
1074
- throw new Error("Malformed node");
1075
- return a === void 0 ? this.args[n] : (this.args[n] = a, this);
1076
- }, e.prototype.args = function(n) {
1077
- if (!t(this))
1078
- throw new Error("Malformed node");
1079
- return n === void 0 ? this.args : (this.args = n, this);
1080
- }, e.prototype.isNode = t;
1081
- function t(r) {
1082
- return r === void 0 && (r = this), r.op && r.args;
1083
- }
1084
- return e.prototype.intern = function(n) {
1085
- this instanceof e && n === void 0 && t(this) && (n = this), K(typeof n == "object", "node not an object");
1086
- const { op: a } = n, o = n.args.length;
1087
- let i = "";
1088
- const l = [];
1089
- for (let h = 0; h < o; h++)
1090
- i += " ", typeof n.args[h] == "string" ? i += l[h] = n.args[h] : i += l[h] = this.intern(n.args[h]);
1091
- n.lbrk && n.lbrk !== 123 && n.lbrk !== 371 && (i += String.fromCharCode(n.lbrk), i += String.fromCharCode(n.rbrk));
1092
- const g = a + o + i;
1093
- let m = this.nodeMap[g];
1094
- return m === void 0 && (this.nodePool.push({
1095
- op: a,
1096
- args: l
1097
- }), m = this.nodePool.length - 1, this.nodeMap[g] = m), m;
1098
- }, e.prototype.node = function(n) {
1099
- const a = JSON.parse(JSON.stringify(this.nodePool[n]));
1100
- for (let o = 0; o < a.args.length; o++)
1101
- typeof a.args[o] != "string" && (a.args[o] = this.node(a.args[o]));
1102
- return a;
1103
- }, e.prototype.dumpAll = function() {
1104
- let n = "";
1105
- return this.nodePool.forEach((a, o) => {
1106
- n += `
1107
- ${o}: ${e.dump(a)}`;
1108
- }), n;
1109
- }, e.dump = e.prototype.dump = function r(n) {
1110
- let a;
1111
- if (typeof n == "string")
1112
- a = `"${n}"`;
1113
- else if (typeof n == "number")
1114
- a = n;
1115
- else {
1116
- a = `{ op: "${n.op}", args: [ `;
1117
- for (let o = 0; o < n.args.length; o++)
1118
- o > 0 && (a += " , "), a += r(n.args[o]);
1119
- a += " ] }";
1120
- }
1121
- return a;
1122
- }, e;
1123
- })(), va = (() => {
1124
- function e() {
1125
- }
1126
- const t = [];
1127
- let r = {};
1128
- e.fn = {}, e.env = r, e.pushEnv = (H) => {
1129
- t.push(r), e.env = r = H;
1130
- }, e.popEnv = () => {
1131
- K(t.length > 0, "1000: Empty envStack"), e.env = r = t.pop();
1132
- }, e.option = (H, y) => H[y];
1133
- function n() {
1134
- return !!e.env.Au;
1135
- }
1136
- const a = e.prototype = new Js();
1137
- re.reserveCodeRange(1e3, 1999, "model"), re.messages[1e3] = "Internal error. %1.", re.messages[1001] = 'Invalid syntax. "%1" expected, "%2" found.', re.messages[1002] = "Only one decimal separator can be specified.", re.messages[1003] = "Extra characters in input at position: %1, lexeme: %2, prefix: %3.", re.messages[1004] = 'Invalid character "%1" (%2) in input.', re.messages[1005] = "Misplaced thousands separator.", re.messages[1006] = "Invalid syntax. Expression expected, %1 found.", re.messages[1007] = 'Unexpected character: "%1" in "%2".', re.messages[1008] = 'The same character "%1" is being used as a thousands and decimal separators.', re.messages[1009] = 'Missing argument for "%1" command.', re.messages[1010] = "Expecting an operator between numbers.", re.messages[1011] = "Invalid grouping bracket. %1", re.messages[1012] = 'Misplaced subscript in "%1"', re.messages[1013] = 'Mismatched thousands separators: "%1" and "%2".', re.messages[1014] = 'Missing integration variable in "%1".';
1138
- const { message: o } = re;
1139
- e.create = a.create = function H(y, P, V) {
1140
- if (K(P instanceof Array || typeof P == "object" && (P.op || P instanceof e) || typeof P == "string", JSON.stringify(P)), K(P !== void 0, "1000: Internal error. Node undefined."), P instanceof e)
1141
- return V && (P.location = V), P;
1142
- let J;
1143
- return P instanceof Array ? (J = [], P.forEach((ne) => {
1144
- J.push(H(y, ne, V));
1145
- }), J) : this instanceof e ? (J = H(y, this), J.location = V, typeof P == "string" ? P = fi(y, P, e.env).expr() : P = JSON.parse(JSON.stringify(P)), Object.keys(e.fn).forEach((ne) => {
1146
- a[ne] || (a[ne] = function(...Pe) {
1147
- const tn = e.fn[ne];
1148
- if (Pe.length > 1 && Pe[1] instanceof e)
1149
- return tn.apply(this, Pe);
1150
- const mt = [this];
1151
- for (let Oe = 0; Oe < Pe.length; Oe++)
1152
- mt.push(Pe[Oe]);
1153
- return tn.apply(this, mt);
1154
- });
1155
- }), Object.keys(P).forEach((ne) => {
1156
- J[ne] = P[ne];
1157
- }), J) : new e().create(y, P, V);
1158
- }, e.fromLaTeX = a.fromLaTeX = function(y, P) {
1159
- return K(typeof P == "string", "1000: Model.prototype.fromLaTex"), this ? this.create(y, P) : e.create(y, P);
1160
- }, e.toLaTeX = a.toLaTeX = function(y) {
1161
- return N(y);
1162
- };
1163
- const i = {
1164
- ADD: "+",
1165
- SUB: "-",
1166
- MUL: "mul",
1167
- TIMES: "\\times",
1168
- // Special case for '*' and '\times' in literals.
1169
- DIV: "\\div",
1170
- FRAC: "\\frac",
1171
- EQL: "=",
1172
- ATAN2: "atan2",
1173
- SQRT: "sqrt",
1174
- VEC: "vec",
1175
- PM: "pm",
1176
- NOT: "not",
1177
- SIN: "sin",
1178
- COS: "cos",
1179
- TAN: "tan",
1180
- SEC: "sec",
1181
- COT: "cot",
1182
- CSC: "csc",
1183
- ARCSIN: "arcsin",
1184
- ARCCOS: "arccos",
1185
- ARCTAN: "arctan",
1186
- ARCSEC: "arcsec",
1187
- ARCCOT: "arccot",
1188
- ARCCSC: "arccsc",
1189
- SINH: "sinh",
1190
- COSH: "cosh",
1191
- TANH: "tanh",
1192
- SECH: "sech",
1193
- COTH: "coth",
1194
- CSCH: "csch",
1195
- ARCSINH: "arcsinh",
1196
- ARCCOSH: "arccosh",
1197
- ARCTANH: "arctanh",
1198
- ARCSECH: "arcsech",
1199
- ARCCSCH: "arccsch",
1200
- ARCCOTH: "arccoth",
1201
- LOG: "log",
1202
- LN: "ln",
1203
- LG: "lg",
1204
- VAR: "var",
1205
- TEXT: "text",
1206
- NUM: "num",
1207
- COMMA: ",",
1208
- POW: "^",
1209
- SUBSCRIPT: "_",
1210
- ABS: "abs",
1211
- PAREN: "()",
1212
- BRACE: "{}",
1213
- BRACKET: "[]",
1214
- ANGLEBRACKET: "anglebracket",
1215
- HIGHLIGHT: "hi",
1216
- LT: "lt",
1217
- LE: "le",
1218
- GT: "gt",
1219
- GE: "ge",
1220
- NE: "ne",
1221
- NGTR: "ngtr",
1222
- NLESS: "nless",
1223
- NI: "ni",
1224
- SUBSETEQ: "subseteq",
1225
- SUPSETEQ: "supseteq",
1226
- SUBSET: "subset",
1227
- SUPSET: "supset",
1228
- NNI: "nni",
1229
- NSUBSETEQ: "nsubseteq",
1230
- NSUPSETEQ: "nsupseteq",
1231
- NSUBSET: "nsubset",
1232
- NSUPSET: "nsupset",
1233
- APPROX: "approx",
1234
- IMPLIES: "implies",
1235
- CAPRIGHTARROW: "caprightarrow",
1236
- RIGHTARROW: "rightarrow",
1237
- LEFTARROW: "leftarrrow",
1238
- LONGRIGHTARROW: "longrightarrow",
1239
- LONGLEFTARROW: "longleftarrow",
1240
- OVERRIGHTARROW: "overrightarrow",
1241
- OVERLEFTARROW: "overleftarrow",
1242
- CAPLEFTRIGHTARROW: "capleftrightarrow",
1243
- LEFTRIGHTARROW: "leftrightarrow",
1244
- LONGLEFTRIGHTARROW: "longleftrightarrow",
1245
- OVERLEFTRIGHTARROW: "overleftrightarrow",
1246
- PERP: "perp",
1247
- PROPTO: "propto",
1248
- PARALLEL: "parallel",
1249
- NPARALLEL: "nparallel",
1250
- SIM: "sim",
1251
- CONG: "cong",
1252
- INTERVAL: "interval",
1253
- INTERVALOPEN: "intervalopen",
1254
- INTERVALLEFTOPEN: "intervalleftopen",
1255
- INTERVALRIGHTOPEN: "intervalrightopen",
1256
- EVALAT: "eval-at",
1257
- LIST: "list",
1258
- SET: "set",
1259
- EXISTS: "exists",
1260
- IN: "in",
1261
- FORALL: "forall",
1262
- LIM: "lim",
1263
- EXP: "exp",
1264
- TO: "to",
1265
- SUM: "sum",
1266
- DERIV: "deriv",
1267
- PIPE: "pipe",
1268
- INTEGRAL: "integral",
1269
- PROD: "prod",
1270
- CUP: "cup",
1271
- BIGCUP: "bigcup",
1272
- CAP: "cap",
1273
- BIGCAP: "bigcap",
1274
- PERCENT: "%",
1275
- QMARK: "?",
1276
- M: "M",
1277
- FACT: "fact",
1278
- BINOM: "binom",
1279
- ROW: "row",
1280
- COL: "col",
1281
- COLON: "colon",
1282
- MATRIX: "matrix",
1283
- TYPE: "type",
1284
- FORMAT: "format",
1285
- OVERSET: "overset",
1286
- UNDERSET: "underset",
1287
- OVERLINE: "overline",
1288
- DEGREE: "degree",
1289
- BACKSLASH: "backslash",
1290
- MATHBF: "mathbf",
1291
- CDOT: "\\cdot",
1292
- MATHFIELD: "mathfield",
1293
- DELTA: "delta",
1294
- OPERATORNAME: "operatorname",
1295
- DOT: "dot",
1296
- NONE: "none"
1297
- };
1298
- Object.keys(i).forEach((H) => {
1299
- e[H] = i[H];
1300
- });
1301
- const l = {};
1302
- l[i.ADD] = "+", l[i.SUB] = "-", l[i.MUL] = "\\times", l[i.TIMES] = "\\times", l[i.DIV] = "\\div", l[i.FRAC] = "\\frac", l[i.EQL] = "=", l[i.ATAN2] = "\\atan2", l[i.POW] = "^", l[i.SUBSCRIPT] = "_", l[i.PM] = "\\pm", l[i.NOT] = "\\not", l[i.SIN] = "\\sin", l[i.COS] = "\\cos", l[i.TAN] = "\\tan", l[i.SEC] = "\\sec", l[i.COT] = "\\cot", l[i.CSC] = "\\csc", l[i.ARCSIN] = "\\arcsin", l[i.ARCCOS] = "\\arccos", l[i.ARCTAN] = "\\arctan", l[i.ARCSEC] = "\\arcsec", l[i.ARCCOT] = "\\arccot", l[i.ARCCSC] = "\\arccsc", l[i.SEC] = "\\sec", l[i.COT] = "\\cot", l[i.CSC] = "\\csc", l[i.SINH] = "\\sinh", l[i.COSH] = "\\cosh", l[i.TANH] = "\\tanh", l[i.ARCSINH] = "\\arcsinh", l[i.ARCCOSH] = "\\arccosh", l[i.ARCTANH] = "\\arctanh", l[i.ARCSECH] = "\\arcsech", l[i.ARCCSCH] = "\\arccsch", l[i.ARCCOTH] = "\\arccoth", l[i.SECH] = "\\sech", l[i.COTH] = "\\coth", l[i.CSCH] = "\\csch", l[i.LN] = "\\ln", l[i.COMMA] = ",", l[i.M] = "\\M", l[i.BINOM] = "\\binom", l[i.COLON] = "\\colon", l[i.INT] = "\\int", e.fold = function H(y, P) {
1303
- const V = [];
1304
- let J;
1305
- switch (y.args.forEach((ne) => {
1306
- V.push(H(ne, P));
1307
- }), y.args = V, y.op) {
1308
- case i.VAR:
1309
- (J = P[y.args[0]]) && (y = J);
1310
- break;
1311
- }
1312
- return y;
1313
- };
1314
- function p(H) {
1315
- return H >= 1 && H <= 31 && H !== 9 || H >= 127 && H <= 159;
1316
- }
1317
- function f(H) {
1318
- return H === Ge || H === Ye || H === Le || H === ut || H === kt || H === Dt || H === Lr || H === z;
1319
- }
1320
- function g(H) {
1321
- let y = "", P, V, J = 0;
1322
- for (; J < H.length; ) {
1323
- for (; J < H.length && m(P = H.charCodeAt(J++)); )
1324
- V !== 32 && (P = 9, V = P);
1325
- P === 92 && (y += String.fromCharCode(P), J < H.length && (P = H.charCodeAt(J++))), y += String.fromCharCode(P);
1326
- }
1327
- return y;
1328
- }
1329
- function m(H) {
1330
- return p(H);
1331
- }
1332
- function h(H) {
1333
- return H === 32 || H === 9 || H === 10 || H === 13;
1334
- }
1335
- function x(H) {
1336
- return H >= 48 && H <= 57;
1337
- }
1338
- const N = function H(y) {
1339
- let P = "";
1340
- if (typeof y == "string")
1341
- P = y;
1342
- else if (typeof y == "number")
1343
- P = y;
1344
- else if (typeof y == "object") {
1345
- const V = [];
1346
- switch (y.args.forEach((J) => {
1347
- V.push(H(J));
1348
- }), y.op) {
1349
- case i.NUM:
1350
- case i.VAR:
1351
- P = `${y.args[0]}`;
1352
- break;
1353
- case i.TEXT:
1354
- P = `\\text{${V[0]}}`;
1355
- break;
1356
- case i.SUBSCRIPT:
1357
- V.reverse().forEach((J, ne) => {
1358
- ne === V.length - 1 ? P = `${J}${P}` : P = `${l[y.op]}{${J}${P}}`;
1359
- });
1360
- break;
1361
- case i.SUB:
1362
- y.args.length === 1 ? P = `${l[y.op]}${V[0]}` : P = `${V[0]} ${l[y.op]} ${V[1]}`;
1363
- break;
1364
- case i.DIV:
1365
- case i.PM:
1366
- case i.EQL:
1367
- P = `${V[0]} ${l[y.op]} ${V[1]}`;
1368
- break;
1369
- case i.POW: {
1370
- const J = y.args[0], ne = y.args[1];
1371
- (J.args && J.args.length === 2 || ne.args && ne.args.length === 2) && (J.op === i.ADD || J.op === i.SUB || J.op === i.MUL || J.op === i.DIV || J.op === i.SQRT) && (V[0] = ` (${V[0]}) `), P = `{${V[0]}^{${V[1]}}}`;
1372
- break;
1373
- }
1374
- case i.SIN:
1375
- case i.COS:
1376
- case i.TAN:
1377
- case i.ARCSIN:
1378
- case i.ARCCOS:
1379
- case i.ARCTAN:
1380
- case i.ARCSEC:
1381
- case i.ARCCSC:
1382
- case i.ARCCOT:
1383
- case i.SEC:
1384
- case i.COT:
1385
- case i.CSC:
1386
- case i.SINH:
1387
- case i.COSH:
1388
- case i.TANH:
1389
- case i.ARCSINH:
1390
- case i.ARCCOSH:
1391
- case i.ARCTANH:
1392
- case i.ARCSECH:
1393
- case i.ARCCSCH:
1394
- case i.ARCCOTH:
1395
- case i.SECH:
1396
- case i.COTH:
1397
- case i.CSCH:
1398
- case i.LN:
1399
- case i.M:
1400
- P = `{${l[y.op]}{${V[0]}}}`;
1401
- break;
1402
- case i.FRAC:
1403
- P = `\\frac{${V[0]}}{${V[1]}}`;
1404
- break;
1405
- case i.BINOM:
1406
- P = `\\binom{${V[0]}}{${V[1]}}`;
1407
- break;
1408
- case i.SQRT:
1409
- switch (V.length) {
1410
- case 1:
1411
- P = `\\sqrt{${V[0]}}`;
1412
- break;
1413
- case 2:
1414
- P = `\\sqrt[${V[0]}]{${V[1]}}`;
1415
- break;
1416
- }
1417
- break;
1418
- case i.INTEGRAL:
1419
- V.length === 4 ? P = `\\int_{${V[0]}}^{${V[1]}} ${V[2]} d${V[3]}` : P = `\\int ${V[0]} d${V[1]}`;
1420
- break;
1421
- case i.VEC:
1422
- P = `\\vec{${V[0]}}`;
1423
- break;
1424
- case i.MUL: {
1425
- let J;
1426
- P = "", y.args.forEach((ne, Pe) => {
1427
- ne.args && ne.args.length >= 2 ? ((ne.op === i.ADD || ne.op === i.SUB) && (V[Pe] = `(${V[Pe]})`), Pe !== 0 && typeof ne == "number" ? P += `${l[y.op]} ` : y.isMixedNumber || y.isScientific && (P += "\\times "), P += V[Pe]) : (ne.op === i.PAREN || ne.op === i.VAR || typeof J == "number" && typeof ne != "number" || Pe !== 0 && (P += ` ${l[y.op]} `), P += V[Pe]), J = ne;
1428
- });
1429
- break;
1430
- }
1431
- case i.TIMES:
1432
- case i.CDOT:
1433
- case i.ADD:
1434
- case i.COMMA:
1435
- V.forEach((J, ne) => {
1436
- ne === 0 ? P = J : P = `${P}${l[y.op]} ${J}`;
1437
- });
1438
- break;
1439
- case i.NONE:
1440
- P = "";
1441
- break;
1442
- default:
1443
- K(!1, `1000: Unimplemented operator translating to LaTeX: ${y.op}`);
1444
- break;
1445
- }
1446
- } else
1447
- K(!1, "1000: Invalid expression type");
1448
- return P;
1449
- }, w = 32, U = 33, Q = 36, ee = 37, G = 40, Y = 42, ie = 43, Ce = 44, xe = 45, ve = 41, de = 46, Be = 47, Ae = 48, rt = 58, ct = 59, _e = 61, T = 63, C = 65, L = 91, B = 93, k = 94, j = 95, M = 97, Z = 123, q = 124, le = 125, he = 39, z = 0, fe = ie, we = k, Ue = j, Je = de, Pt = 261, Gt = 264, $e = 265, Xe = 256, vt = Be, us = _e, Er = 263, be = Z, Se = q, pe = L, Ve = G, fs = Y, ht = Ae, qt = 258, Ye = le, Le = B, Ge = ve, Rr = 262, Nr = 259, Cn = 257, et = xe, Sr = 260, nt = M, li = C, Wt = Ce, ps = ee, ui = T, gs = U, Xt = rt, Or = ct, wr = 267, br = 268, st = 269, Qt = 270, jt = 271, Ir = 272, Zt = 273, xn = 274, An = 275, Tn = 276, Mr = 277, En = 278, Rn = 279, Nn = 280, zt = 281, Sn = 282, hs = 283, It = 284, On = 285, kt = 286, Dt = 287, ds = 288, Lr = 289, wn = 290, Jt = 291, Yt = 292, er = 293, yr = 294, tr = 295, bn = 296, In = 297, Mn = 298, Pr = 299, vr = 300, rr = 301, Ln = 302, ms = 303, nr = 304, yn = 305, Pn = 306, kr = 307, Dr = 308, Fr = 309, Br = 310, _r = 311, Ur = 312, $r = 313, Vr = 314, Hr = 315, Cs = 332, vn = 333, Kr = 334, Gr = 335, qr = 336, sr = 337, ir = 338, ar = 339, kn = 340, or = 341, Dn = 342, cr = 343, Fn = 344, Bn = 345, _n = 346, Un = 347, $n = 348, Vn = 349, Hn = 350, lr = 351, Kn = 352, Gn = 353, qn = 354, Wn = 355, Wr = 356, Xr = 357, Qr = 358, jr = 359, Zr = 360, zr = 361, Jr = 362, Xn = 363, Yr = 364, en = 365, ur = 366, Qn = 367, fr = 368, ye = 369, He = 370, Ie = 371, lt = 372, Ft = 373, xs = 374, pr = 375, ut = 376, gr = 377, Bt = 378, Mt = 379, E = {};
1450
- E[vt] = i.FRAC, E[Xe] = i.FRAC, E[Cn] = i.SQRT, E[wn] = i.VEC, E[fe] = i.ADD, E[et] = i.SUB, E[qt] = i.PM, E[lr] = i.NOT, E[we] = i.POW, E[Ue] = i.SUBSCRIPT, E[fs] = i.MUL, E[nr] = i.CDOT, E[Ft] = i.TIMES, E[yr] = i.DIV, E[Nr] = i.SIN, E[Pt] = i.COS, E[Sr] = i.TAN, E[Jt] = i.ARCSIN, E[Yt] = i.ARCCOS, E[er] = i.ARCTAN, E[sr] = i.ARCSEC, E[ir] = i.ARCCSC, E[ar] = i.ARCCOT, E[Rr] = i.SEC, E[Gt] = i.COT, E[$e] = i.CSC, E[kr] = i.SINH, E[Dr] = i.COSH, E[Fr] = i.TANH, E[$r] = i.ARCSINH, E[Vr] = i.ARCCOSH, E[Hr] = i.ARCTANH, E[Kr] = i.ARCSECH, E[Gr] = i.ARCCSCH, E[qr] = i.ARCCOTH, E[Br] = i.SECH, E[_r] = i.COTH, E[Ur] = i.CSCH, E[Er] = i.LN, E[wr] = i.LG, E[br] = i.LOG, E[us] = i.EQL, E[Wt] = i.COMMA, E[st] = i.TEXT, E[fr] = i.OPERATORNAME, E[Qt] = i.LT, E[jt] = i.LE, E[Ir] = i.GT, E[Zt] = i.GE, E[rr] = i.NE, E[yn] = i.NGTR, E[Pn] = i.NLESS, E[vn] = i.NI, E[Un] = i.SUBSETEQ, E[$n] = i.SUPSETEQ, E[Vn] = i.SUBSET, E[Hn] = i.SUPSET, E[Ln] = i.APPROX, E[Bn] = i.PERP, E[_n] = i.PROPTO, E[Kn] = i.PARALLEL, E[Gn] = i.NPARALLEL, E[qn] = i.SIM, E[Wn] = i.CONG, E[xn] = i.EXISTS, E[An] = i.IN, E[Tn] = i.FORALL, E[Mr] = i.LIM, E[En] = i.EXP, E[Rn] = i.TO, E[Se] = i.PIPE, E[Nn] = i.SUM, E[zt] = i.INTEGRAL, E[Sn] = i.PROD, E[or] = i.CUP, E[Dn] = i.BIGCUP, E[cr] = i.CAP, E[Fn] = i.BIGCAP, E[hs] = i.M, E[Xn] = i.IMPLIES, E[ur] = i.CAPRIGHTARROW, E[It] = i.RIGHTARROW, E[Wr] = i.LEFTARROW, E[Xr] = i.LONGRIGHTARROW, E[Qr] = i.LONGLEFTARROW, E[jr] = i.OVERRIGHTARROW, E[Zr] = i.OVERLEFTARROW, E[Yr] = i.LEFTRIGHTARROW, E[en] = i.CAPLEFTRIGHTARROW, E[zr] = i.LONGLEFTRIGHTARROW, E[Jr] = i.OVERLEFTRIGHTARROW, E[gs] = i.FACT, E[On] = i.BINOM, E[kt] = i.ROW, E[Dt] = i.COL, E[Xt] = i.COLON, E[Or] = i.SEMICOLON, E[tr] = i.TYPE, E[bn] = i.OVERLINE, E[gr] = i.DOT, E[In] = i.OVERSET, E[Mn] = i.UNDERSET, E[Pr] = i.BACKSLASH, E[vr] = i.MATHBF, E[kn] = i.MATHFIELD, E[Qn] = i.DELTA;
1451
- function b(H, y) {
1452
- return {
1453
- op: H,
1454
- args: y
1455
- };
1456
- }
1457
- const dt = b(e.NONE, [b(e.VAR, ["None"])]), fi = function(y, P, V) {
1458
- const J = Object.keys(V);
1459
- J.push("to"), P = g(P);
1460
- function ne(s, c) {
1461
- let u = "";
1462
- if (e.option(y, "allowThousandsSeparator") || e.option(y, "setThousandsSeparator")) {
1463
- let R = e.option(y, "setThousandsSeparator");
1464
- R = [].concat(R !== void 0 ? R : ","), R.indexOf(s) >= 0 && (K(!c || s === c, o(1013, [c, s])), u = s);
1465
- }
1466
- return u;
1467
- }
1468
- function Pe(s) {
1469
- const c = e.option(y, "setDecimalSeparator"), u = e.option(y, "setThousandsSeparator");
1470
- if (typeof c == "string") {
1471
- K(c.length === 1, o(1002));
1472
- const R = c;
1473
- return u instanceof Array && u.indexOf(R) >= 0 && K(!1, o(1008, [R])), s === R;
1474
- }
1475
- return c instanceof Array ? (c.forEach((R) => {
1476
- u instanceof Array && u.indexOf(R) >= 0 && K(!1, o(1008, [R]));
1477
- }), c.indexOf(s) >= 0) : u instanceof Array && u.indexOf(".") >= 0 || u === "." ? (K(c === void 0, o(1008, ["."])), s === ",") : s === ".";
1478
- }
1479
- const tn = b(e.NUM, ["Infinity"]);
1480
- function mt(s, c, u, R) {
1481
- if (c === "\\infty")
1482
- return tn;
1483
- let A = "", S, D, te, Te = 0, ce = "integer";
1484
- for (c === "." && K(!1, o(1004, [c, c.charCodeAt(0)])), S = 0; S < c.length; S++)
1485
- ne(D = c.charAt(S)) ? ((Te && te !== S - 4 || !Te && S > 4) && K(!1, o(1005)), te = S, Te++) : (Pe(D) && (ce === "decimal" && K(!1, o(1007, [D, A + D])), D = ".", ce = "decimal", Te && te !== S - 4 && K(!1, o(1005)), te = S, Te++), A += D);
1486
- ce !== "decimal" && te && te !== S - 4 && K(!1, o(1005)), A = String(A);
1487
- const se = e.option(s, "strict") && c || A;
1488
- return {
1489
- op: e.NUM,
1490
- args: [se],
1491
- separatorCount: Te,
1492
- lastSeparatorIndex: te,
1493
- numberFormat: ce
1494
- };
1495
- }
1496
- function Oe(s, c) {
1497
- return s.length === 0 && (s = [_t]), Re(e.MUL, s, c);
1498
- }
1499
- function ft(s, c) {
1500
- return K(c.length === 1, "1000: Wrong number of arguments for unary node"), b(s, c);
1501
- }
1502
- function Re(s, c, u) {
1503
- if (K(c.length > 0, "1000: Too few argument for binary node"), c.length < 2)
1504
- return c[0];
1505
- let R = [];
1506
- return c.forEach((A) => {
1507
- u && A.op === s && A.args.length > 1 ? R = R.concat(A.args) : R.push(A);
1508
- }), b(s, R);
1509
- }
1510
- const _t = mt(y, "1"), As = mt(y, "-1");
1511
- let hr = z, Lt = z, dr, jn;
1512
- const Ct = Mi(P);
1513
- function pi(s) {
1514
- hr = Ct.start(s), dr = Ct.lexeme();
1515
- }
1516
- function I() {
1517
- return hr;
1518
- }
1519
- function ke() {
1520
- return K(dr !== void 0, `1000: Lexeme for token T0=${hr} is missing.`), dr;
1521
- }
1522
- function v(s) {
1523
- Lt === z ? (hr = Ct.start(s), dr = Ct.lexeme()) : (K(jn !== void 0, `1000: Lexeme for token=${Lt} is missing.`), hr = Lt, dr = jn, Lt = z);
1524
- }
1525
- function me(s) {
1526
- return Lt === z && (Lt = Ct.start(s), jn = Ct.lexeme()), Lt;
1527
- }
1528
- function ae(s, c) {
1529
- const u = I();
1530
- if (u !== s) {
1531
- const R = String.fromCharCode(s), A = u ? String.fromCharCode(u) : "EOS";
1532
- K(!1, o(1001, [`${R}[${s}]`, `${A}[${u}]`]));
1533
- }
1534
- v(c);
1535
- }
1536
- function Ts(s) {
1537
- if (s.op === e.FRAC && (s.args[0].op === e.NUM || s.args[1].op === e.NUM)) {
1538
- const c = (s.args[0].op === e.SUB || s.args[0].op === e.ADD) && s.args[0].args.length === 1 && s.args[0].args[0] || s.args[0], u = (s.args[1].op === e.SUB || s.args[1].op === e.ADD) && s.args[1].args.length === 1 && s.args[1].args[0] || s.args[1];
1539
- return c.op === e.NUM && c.numberFormat === "integer" && u.op === e.NUM && u.numberFormat === "integer" && +u.args[0] != 0;
1540
- }
1541
- return !1;
1542
- }
1543
- function gi(s) {
1544
- if (s.op === e.FRAC) {
1545
- const c = s.args[0], u = s.args[1];
1546
- return c.op === e.NUM && c.numberFormat === "integer" && u.op === e.NUM && u.numberFormat === "integer" && +c.args[0] < u.args[0];
1547
- }
1548
- return !1;
1549
- }
1550
- const hi = ["K", "C", "F"], di = ["g", "L", "m", "s"];
1551
- function xt() {
1552
- let s, c, u, R, A, S = [], D, te, Te, ce;
1553
- switch (u = I()) {
1554
- case li:
1555
- case nt:
1556
- if (S = [ke()], v(), I() === ht) {
1557
- const se = S[0].toUpperCase() + ke(), Qe = J.some((F) => F.indexOf(se) === 0);
1558
- c = b(e.VAR, S), Qe && (c = Oe([c, mt(y, ke())]), v());
1559
- } else
1560
- S[0] === "\\emptyset" ? S[0] = "\\varnothing" : S[0] === "\\mu" && I() === st && di.includes(ke()) ? (S[0] = `\\mu${ke()}`, v()) : S[0] === "\\degree" && I() === st && hi.includes(ke()) && (S[0] = `\\degree ${ke()}`, v()), c = b(e.VAR, S), n() && I() === be && me() === Ye && (ae(be), ae(Ye));
1561
- break;
1562
- case st:
1563
- S = [ke()], v(), c = b(e.TEXT, [b(e.VAR, S)]);
1564
- break;
1565
- case ht:
1566
- c = mt(y, ke()), v();
1567
- break;
1568
- case ye:
1569
- me() === be || me() === Ie ? c = oe(u) : me() === Se ? c = it(u) : c = ze(u);
1570
- break;
1571
- case tr:
1572
- c = b(e.TYPE, [b(e.VAR, [ke()])]), v();
1573
- break;
1574
- case pe:
1575
- case Ve:
1576
- case pr:
1577
- c = ze(u);
1578
- break;
1579
- case Le:
1580
- zn ? c = dt : c = ze(u);
1581
- break;
1582
- case be:
1583
- case Ie:
1584
- c = oe(u);
1585
- break;
1586
- case ds: {
1587
- v();
1588
- const se = oe();
1589
- if (se.op === e.VAR) {
1590
- if (se.args[0].indexOf("array") === 0) {
1591
- if (I() === be) {
1592
- for (; I() !== Ye; )
1593
- v();
1594
- v();
1595
- }
1596
- } else if (se.args[0].indexOf("matrix") >= 0 && I() === pe) {
1597
- for (; I() !== Le; )
1598
- v();
1599
- v();
1600
- }
1601
- }
1602
- const Qe = mi();
1603
- ae(Lr), oe(), se.op === e.VAR && (se.args[0].indexOf("matrix") >= 0 || se.args[0].indexOf("array") === 0 ? c = b(e.MATRIX, [Qe]) : K(!1, "1000: Unrecognized LaTeX name"));
1604
- break;
1605
- }
1606
- case Se:
1607
- c = it();
1608
- break;
1609
- case ms:
1610
- v(), c = ft(e.ABS, [oe()]);
1611
- break;
1612
- case Xe:
1613
- v(), te = oe(), Te = oe(), te = te.args.length === 0 ? b(e.COMMA, [dt]) : te, Te = te.args.length === 0 ? b(e.COMMA, [dt]) : Te, c = b(e.FRAC, [te, Te]), c.isFraction = Ts(c);
1614
- break;
1615
- case On: {
1616
- v();
1617
- const se = oe(), Qe = oe();
1618
- c = Re(e.BINOM, [se, Qe]);
1619
- break;
1620
- }
1621
- case Cn:
1622
- switch (v(), I()) {
1623
- case pe: {
1624
- const se = Ci(), Qe = oe();
1625
- c = b(e.SQRT, [Qe, se]);
1626
- break;
1627
- }
1628
- case be:
1629
- A = oe(), c = b(e.SQRT, [A, b(e.NUM, ["2"])]);
1630
- break;
1631
- default:
1632
- K(!1, o(1001, ["{ or (", String.fromCharCode(I())]));
1633
- break;
1634
- }
1635
- break;
1636
- case wn:
1637
- v(), c = b(e.VEC, [oe()]);
1638
- break;
1639
- case fr: {
1640
- const se = ke();
1641
- v(), c = b(e.OPERATORNAME, [b(e.VAR, [se]), xt()]);
1642
- break;
1643
- }
1644
- case Nr:
1645
- case Pt:
1646
- case Sr:
1647
- case Rr:
1648
- case Gt:
1649
- case $e:
1650
- case kr:
1651
- case Dr:
1652
- case Fr:
1653
- case Br:
1654
- case _r:
1655
- case Ur:
1656
- for (v(); I() === we; )
1657
- v({ oneCharToken: !0 }), S.push(At());
1658
- return S.length === 1 && ws(S[0]) ? (R = `arc${E[u]}`, S.pop()) : R = E[u], (s = I()) === ye ? (me() === be || me() === Ie ? c = oe(s) : me() === Se ? c = it(s) : c = ze(s), S.unshift(b(R, [c]))) : (s = I()) === be || s === Ie ? S.unshift(b(R, [oe(s)])) : (s = I()) === Ve || s === pe ? S.unshift(b(R, [ze(s)])) : (D = tt(De(!0)), ce = qe(y, D), D = ce && at(D) || D, S.unshift(b(R, [D]))), S.length > 1 ? c = b(e.POW, S) : c = S[0], ce && (c = Oe([c, b(e.VAR, ["d"]), ce])), c;
1659
- case Jt:
1660
- case Yt:
1661
- case er:
1662
- case sr:
1663
- case ir:
1664
- case ar:
1665
- case $r:
1666
- case Vr:
1667
- case Hr:
1668
- case Kr:
1669
- case Gr:
1670
- case qr:
1671
- for (v(); (s = I()) === we; )
1672
- v({ oneCharToken: !0 }), S.push(At());
1673
- return (s = I()) === ye ? (me() === be || me() === Ie ? c = oe(s) : me() === Se ? c = it(s) : c = ze(s), S.unshift(b(E[u], [c]))) : (s = I()) === be || s === Ie ? S.unshift(b(E[u], [oe(s)])) : (s = I()) === Ve || s === pe ? S.unshift(b(E[u], [ze(s)])) : (s = I()) === Se ? S.unshift(b(E[u], [it(s)])) : (D = tt(De(!0)), ce = qe(y, D), D = ce && at(D) || D, S.unshift(b(E[u], [D]))), S.length > 1 ? c = b(e.POW, S) : c = S[0], ce && (c = Oe([c, b(e.VAR, ["d"]), ce])), c;
1674
- case Er:
1675
- return v(), (s = I()) === ye ? (me() === be || me() === Ie ? c = oe(s) : me() === Se ? c = it(s) : c = ze(s), S.push(c)) : (s = I()) === be || s === Ie ? S.push(oe(s)) : (s = I()) === Ve || s === pe ? S.push(ze(s)) : (s = I()) === Se ? S.push(it(s)) : (D = tt(De(!0)), ce = qe(y, D), D = ce && at(D) || D, S.push(D)), c = b(e.LOG, [b(e.VAR, ["e"])].concat(S)), ce && (c = Oe([c, b(e.VAR, ["d"]), ce])), c;
1676
- case wr:
1677
- return v(), (s = I()) === ye ? (me() === be || me() === Ie ? c = oe(s) : me() === Se ? c = it(s) : c = ze(s), S.push(c)) : (s = I()) === be || s === Ie ? S.push(oe(s)) : (s = I()) === Ve || s === pe ? S.push(ze(s)) : (s = I()) === Se ? S.push(it(s)) : (D = tt(De(!0)), ce = qe(y, D), D = ce && at(D) || D, S.push(D)), c = b(e.LOG, [b(e.NUM, ["10"])].concat(S)), ce && (c = Oe([c, b(e.VAR, ["d"]), ce])), c;
1678
- case br:
1679
- return v(), (s = I()) === Ue ? (v({ oneCharToken: !0 }), S.push(xt())) : S.push(b(e.NUM, ["10"])), (s = I()) === ye ? (me() === be || me() === Ie ? c = oe(s) : me() === Se ? c = it(s) : c = ze(s), S.push(c)) : (s = I()) === be || s === Ie ? S.push(oe(s)) : (s = I()) === Ve || s === pe ? S.push(ze(s)) : (s = I()) === Se ? S.push(it(s)) : (D = tt(De(!0)), ce = qe(y, D), D = ce && at(D) || D, S.push(D)), c = b(e.LOG, S), ce && (c = Oe([c, b(e.VAR, ["d"]), ce])), c;
1680
- case Mr:
1681
- return wi();
1682
- case zt:
1683
- case Bt:
1684
- case Mt:
1685
- return on();
1686
- case Nn:
1687
- case Sn:
1688
- case or:
1689
- case Dn:
1690
- case cr:
1691
- case Fn:
1692
- return v(), I() === Ue && (v({ oneCharToken: !0 }), S.push(xt()), I() === we && (ae(we, { oneCharToken: !0 }), S.push(xt()))), S.push(De()), b(E[u], S);
1693
- case xn:
1694
- return v(), b(e.EXISTS, [Ar()]);
1695
- case Tn:
1696
- case ur:
1697
- case It:
1698
- case Wr:
1699
- case Xr:
1700
- case Qr:
1701
- case jr:
1702
- case Zr:
1703
- case en:
1704
- case Yr:
1705
- case zr:
1706
- case Jr:
1707
- return v(), b(E[u], [$t()]);
1708
- case En:
1709
- return v(), b(e.EXP, [an()]);
1710
- case hs:
1711
- return v(), b(e.M, [De()]);
1712
- case Cs:
1713
- return v(), b(e.FORMAT, [oe()]);
1714
- case bn:
1715
- return v(), b(e.OVERLINE, [oe()]);
1716
- case gr:
1717
- v();
1718
- {
1719
- let se, Qe = "";
1720
- se = oe(), K(se.op === e.NUM), Qe += se.args[0], I() === ht && me() === gr && (se = xt(), K(se.op === e.NUM), Qe += se.args[0]), I() === gr && (v(), se = oe(), K(se.op === e.NUM), Qe += se.args[0]), D = b(e.OVERLINE, [mt(y, Qe)]);
1721
- }
1722
- return D;
1723
- case kn:
1724
- return v(), b(E[u], [oe()]);
1725
- case In:
1726
- case Mn:
1727
- return v(), te = oe(), Te = oe(), Te.args.push(b(E[u], [te])), Te;
1728
- case vr:
1729
- return v(), te = oe(), b(e.MATHBF, [te]);
1730
- case ui:
1731
- return v(), b(e.VAR, ["?"]);
1732
- case Qn: {
1733
- v();
1734
- let se;
1735
- return I() === nt ? (se = ke(), v()) : se = "", b(e.VAR, [`Delta_${se}`]);
1736
- }
1737
- case Je:
1738
- return v(), dt;
1739
- default:
1740
- K(!e.option(y, "strict"), o(1006, [u])), c = dt;
1741
- break;
1742
- }
1743
- return c;
1744
- }
1745
- function mi() {
1746
- const s = [];
1747
- for (s.push(Es()); I() === kt; )
1748
- v(), s.push(Es());
1749
- return b(E[kt], s);
1750
- }
1751
- function Es() {
1752
- const s = [];
1753
- for (s.push($t()); I() === Dt; )
1754
- v(), s.push(Ar());
1755
- return b(E[Dt], s);
1756
- }
1757
- let Zn = 0;
1758
- function it(s) {
1759
- s = s || Se, Zn++, ae(s);
1760
- let c, u;
1761
- s === ye ? ae(c = I()) : c = s;
1762
- const R = an();
1763
- return ae(u = s === ye && He || c), u === He && ae(u = c), Zn--, ft(e.ABS, [R]);
1764
- }
1765
- function oe(s) {
1766
- s = s || be, ae(s);
1767
- let c, u;
1768
- s === ye ? ae(c = I() === Ie && Ie || be) : c = s;
1769
- let R;
1770
- return I() === He || I() === Ye || I() === lt ? (ae(u = I()), u === He && ae(u = I() === Je && Je || I() === lt && lt || Ye), R = b(e.COMMA, [])) : (R = $t(), ae(u = s === ye && He || s === Ie && lt || Ye), u === He && ae(u = I() === Je && Je || I() === lt && lt || Ye), R.op === dt.op && R.args[0] === dt.args[0] && (R = b(e.COMMA, []))), R.lbrk = c, R.rbrk = u, R;
1771
- }
1772
- let mr = 0;
1773
- function Ci(s) {
1774
- s = s || pe, K(s === ye || s === pe, "1000: Internal error"), mr++, ae(s);
1775
- let c;
1776
- s === ye && ae(pe);
1777
- const u = $t();
1778
- return ae(c = s === ye && ye || Le), c === He && ae(c = Le), mr--, u;
1779
- }
1780
- let zn;
1781
- function ze(s) {
1782
- mr++, ae(s);
1783
- let c, u, R;
1784
- s === ye ? (ae(c = I()), R = !0) : c = s;
1785
- let A;
1786
- if (I() === He || I() === Ge || I() === Le ? (ae(u = R && He || I()), u === He && ae(u = c === Ve && Ge || c === pe && Le || c === pr && ut), A = b(e.COMMA, [])) : (zn = !0, A = $t(!0), ae(u = R && He || I() === Ge && Ge || I() === ut && ut || s === ye && He || I() === pe && pe || Le), u === He && ae(u = I() === Ge && Ge || I() === ut && ut || I() === pe && pe || Le)), c = c === Le ? Ve : c, u = u === pe ? Ge : u, (c === Ve || c === pe || c === Le) && (u === Ge || u === Le || u === pe)) {
1787
- const S = A.op === e.COMMA && A.args.length === 2 && (c === Ve && u === Ge && e.INTERVALOPEN || c === pe && u === Le && e.INTERVAL) || c === Ve && u === Ge && e.PAREN || c === pe && u === Le && e.BRACKET || c === Ve && u === Le && e.INTERVALLEFTOPEN || c === pe && u === Ge && e.INTERVALRIGHTOPEN;
1788
- A = b(S, [A]);
1789
- } else if (A.lbrk === Je && A.rbrk === Se)
1790
- A = b(e.EVALAT, [A]);
1791
- else if (c === pr && u === ut)
1792
- A = b(e.ANGLEBRACKET, [A]);
1793
- else if (A.op === e.COMMA || c === Ve || c === pe) {
1794
- K(c === Ve && u === Ge || c === pe && u === Le || c === u, o(1011, [`tk1=${c} tk2=${u}`]));
1795
- const S = c === pe && e.BRACKET || e.PAREN;
1796
- A = b(S, [A]);
1797
- }
1798
- return mr--, zn = !1, A.lbrk = c, A.rbrk = u, A;
1799
- }
1800
- function Rs() {
1801
- const s = [xt()];
1802
- for (; I() === we; ) {
1803
- v({ oneCharToken: !0 });
1804
- let u;
1805
- if ((Ai(s[0]) || n()) && ((u = I()) === fe || u === et))
1806
- v(), s.push(ft(E[u], [_t]));
1807
- else {
1808
- let R = At();
1809
- R.op === e.VAR && R.args[0] === "\\circ" && (I() === st && (ke() === "K" || ke() === "C" || ke() === "F") ? (R = Oe([
1810
- s.pop(),
1811
- ft(e.VAR, [`\\degree ${ke()}`])
1812
- ]), v()) : R = Oe([
1813
- s.pop(),
1814
- ft(e.VAR, ["\\degree"])
1815
- ])), s.push(R);
1816
- }
1817
- }
1818
- if (s.length > 1) {
1819
- let u = s.pop();
1820
- return s.reverse().forEach((R) => {
1821
- u = b(e.POW, [R, u]);
1822
- }), u.isPolynomial = Ut(u), u;
1823
- }
1824
- const c = s[0];
1825
- return c.isPolynomial = Ut(c), c;
1826
- }
1827
- function Ns() {
1828
- let s, c = Rs();
1829
- switch (s = I()) {
1830
- case ps:
1831
- v(), c = b(e.PERCENT, [c]);
1832
- break;
1833
- case gs:
1834
- v(), c = b(e.FACT, [c]);
1835
- break;
1836
- default:
1837
- if (s === Se && me() === Ue) {
1838
- v();
1839
- const u = [c];
1840
- v({ oneCharToken: !0 }), u.push(b(e.SUBSCRIPT, [Ar()])), c = b(e.PIPE, u);
1841
- } else n() && (s === fe || s === et) && me() === Ye && (v(), c = ft(E[s], [c]));
1842
- break;
1843
- }
1844
- return c;
1845
- }
1846
- function xi(s) {
1847
- return s === fe || s === et || s === Wt || s === Ye || s === Ge || s === Le || s === ut || s === He || s === z;
1848
- }
1849
- function At() {
1850
- let s, c, u;
1851
- switch (s = I()) {
1852
- case fe:
1853
- case lr:
1854
- case et:
1855
- v(), c = b(E[s], [At()]);
1856
- break;
1857
- case qt:
1858
- v(), c = De(!0), c = b(E[s], [c]);
1859
- break;
1860
- case Ue:
1861
- if (u = E[s], v({ oneCharToken: !0 }), (s = I()) === fe || s === et ? (v(), c = _t) : c = At(), c = b(u, [c]), (s = I()) === we) {
1862
- const R = [c];
1863
- u = E[s], v({ oneCharToken: !0 }), (s = I()) === fe || s === et ? (v(), c = _t) : c = At(), R.push(c), c = b(u, R);
1864
- }
1865
- break;
1866
- case we:
1867
- u = E[s], v({ oneCharToken: !0 }), (s = I()) === fe || s === et ? (v(), c = _t) : c = At(), c = b(u, [c]);
1868
- break;
1869
- default:
1870
- s === nt && ke() === "$" ? (v(), xi(I()) ? c = b(e.VAR, ["$"]) : (c = Oe([b(e.VAR, ["$"]), Ns()]), c.args[1].isPolynomialTerm = !0)) : c = Ns();
1871
- break;
1872
- }
1873
- return c;
1874
- }
1875
- function Ss() {
1876
- const s = [At()];
1877
- for (; I() === Ue; )
1878
- v({ oneCharToken: !0 }), s.push(Rs()), n() && I() === be && (ae(be), ae(Ye));
1879
- let c;
1880
- return s.length === 1 ? (c = s[0], K(c.op !== e.SUBSCRIPT || c.args.length !== 1, o(1012, [P]))) : c = u(s), c;
1881
- function u(R) {
1882
- let A, S;
1883
- return R.forEach((D) => {
1884
- D.op === e.SUBSCRIPT && (D = u(D.args));
1885
- let te, Te;
1886
- D.op === e.POW && !D.lbrk ? (A = D.args[1], te = S && S.op === e.SUBSCRIPT && S.args || S && [S] || [], Te = D.args[0].op === e.SUBSCRIPT && D.args[0].args || [D.args[0]]) : S && S.op === e.POW ? (A = S.args[1], te = S.args[0].op === e.SUBSCRIPT && S.args[0].args || [S.args[0]], Te = D.op === e.SUBSCRIPT && D.args || [D]) : (te = S && S.op === e.SUBSCRIPT && S.args || S && [S] || [], Te = D.op === e.SUBSCRIPT && D.args || [D]);
1887
- const ce = te.concat(Te);
1888
- S = ce.length > 1 && b(e.SUBSCRIPT, ce) || ce[0];
1889
- }), A && Re(e.POW, [S, A]) || S;
1890
- }
1891
- }
1892
- function Jn() {
1893
- let s, c = Ss();
1894
- if (Is(c))
1895
- return Ms(c);
1896
- if (Cr(c) && (I() === Xe || I() === ht && me() === vt)) {
1897
- let u = Jn();
1898
- if (Is(u))
1899
- return Ms(u);
1900
- if (Ls(c, u)) {
1901
- let R;
1902
- u.op === e.PERCENT && (u = u.args[0], R = !0);
1903
- let A;
1904
- es(c) && (A = !0, c = sn(c)), c = Re(e.ADD, [c, u]), c.isMixedNumber = !0, A && (c = sn(c)), R === !0 && (c = b(e.PERCENT, [c]));
1905
- } else
1906
- c = Re(e.MUL, [c, u]), u.isImplicit = !0;
1907
- }
1908
- for (; (s === void 0 || s === I()) && (s = I()) === vt; )
1909
- v(), c = b(E[s], [c, Ss()]), c.isFraction = Ts(c), c.isSlash = s === vt;
1910
- return c.op === e.FRAC && c.args[1].op === e.PERCENT && (c = b(e.PERCENT, [
1911
- b(e.FRAC, [c.args[0], c.args[1].args[0]])
1912
- ])), c;
1913
- }
1914
- function Ai(s) {
1915
- if (s.op !== e.VAR)
1916
- return !1;
1917
- const c = e.env[s.args[0]];
1918
- return !!(c && c.name);
1919
- }
1920
- function Os(s, c) {
1921
- return K(typeof c > "u" || typeof c == "string", "1000: Invalid id"), s.op === e.VAR ? c === void 0 ? !0 : s.args[0] === c : s.op === e.POW && Os(s.args[0]) && rn(s.args[1]) ? c === void 0 ? !0 : s.args[0].args[0] === c : !1;
1922
- }
1923
- function Ti(s) {
1924
- return s.op === e.NUM && (s.args[0] === "1" || s.args[0] === "1.");
1925
- }
1926
- function ws(s) {
1927
- return s.op === e.SUB && s.args.length === 1 && Ti(s.args[0]);
1928
- }
1929
- function bs(s) {
1930
- return s === fs || s === yr || s === vt || s === Ft || s === nr;
1931
- }
1932
- function Ei(s) {
1933
- return s === Nr || s === Pt || s === Sr || s === Rr || s === Gt || s === $e || s === kr || s === Dr || s === Fr || s === Br || s === _r || s === Ur || s === Jt || s === Yt || s === er || s === sr || s === ar || s === ir || s === $r || s === Vr || s === Hr || s === Kr || s === qr || s === Gr || s === Er || s === br || s === wr;
1934
- }
1935
- function Is(s) {
1936
- if (s.op !== e.FRAC)
1937
- return !1;
1938
- const c = s.args[0], u = c.op === e.MUL && c.args[0].op === e.VAR && c.args[0].args[0] || c.op === e.VAR && c.args[0] || c.op === e.POW && c.args[0].op === e.VAR && c.args[0].args[0], R = s.args[1], A = R.op === e.MUL && R.args[0].op === e.VAR && R.args[0].args[0];
1939
- return u === "d" && A === "d" && (R.args[1] && R.args[1].op === e.VAR || R.args[1] && R.args[1].op === e.POW && R.args[1].args[0] && R.args[1].args[0].op === e.VAR);
1940
- }
1941
- function Ms(s) {
1942
- if (s.op !== e.FRAC)
1943
- return null;
1944
- const c = s.args[0], u = s.args[1], R = c.op === e.MUL && Oe(c.args.slice(1)) || De();
1945
- K(u.args.length === 2);
1946
- const A = u.args[1], S = A.op === e.POW && A.args[0] || A, D = A.op === e.POW && A.args[1] || _t;
1947
- return s = b(e.DERIV, [R, S, D]), s;
1948
- }
1949
- function De(s = !1) {
1950
- let c, u, R = !1, A = [], S;
1951
- u = Jn(), A = [u];
1952
- let D = 0;
1953
- for (; (c = I()) && !ts(c) && !Ps(c) && !ks(c) && c !== Wt && c !== Or && c !== Xt && !vs(c) && c !== Ye && c !== lt && c !== Ge && c !== He && c !== ut && !((c === pe || c === Le) && mr > 0) && c !== It && c !== ur && c !== Qt && !(c === Se && Zn > 0) && c !== kt && c !== Dt && c !== Lr && !(s && (bs(c) || Ei(c) || c === Ve || c === ye || c === pe || c === pr || c === vr) || qe(y, tt(u))); ) {
1954
- if (R = !1, bs(c) && (v(), R = !0), u = Jn(), (c === nr || c === Ft || c === yr) && (u = Re(E[c], [A.pop(), u], !0)), R || A.length === 0 || u.lbrk || A[A.length - 1].op !== e.NUM || !(A[A.length - 1].numberFormat === "decimal" && A[A.length - 1].lastSeparatorIndex === A[A.length - 1].args[0].length - 1) || A[A.length - 1].lastSeparatorIndex === A[A.length - 1].args[0].length || A[A.length - 1].lbrk || Yn([A[A.length - 1], u]) || u.op !== e.NUM || K(!1, "Shouldn't get here"), K(R || A.length === 0 || u.lbrk || A[A.length - 1].op !== e.NUM || A[A.length - 1].lbrk || Yn([A[A.length - 1], u]) || u.op !== e.NUM, o(1010)), n() && c === Ve && Os(A[A.length - 1], "M"))
1955
- A.pop(), u = ft(e.M, [u]);
1956
- else if (!R && A.length > 0)
1957
- if (A.length > 0 && Ls(A[A.length - 1], u))
1958
- c = A.pop(), es(c) && (u = Re(e.MUL, [As, u])), u = Re(e.ADD, [c, u]), u.isMixedNumber = !0;
1959
- else if (A.length > 0 && A[A.length - 1].op === e.VAR && u.op === e.VAR && u.args[0].indexOf("'") === 0)
1960
- u = Re(e.POW, [A.pop(), u]), u.isImplicit = u.args[0].isImplicit;
1961
- else if (A.length > 0 && (A[A.length - 1].op === e.MUL || A[A.length - 1].op === e.DOT) && // 2x', 2*x', 2\cdot x'
1962
- A[A.length - 1].args[A[A.length - 1].args.length - 1].op === e.VAR && u.op === e.VAR && u.args[0].indexOf("'") === 0)
1963
- c = A.pop(), u = Oe(c.args.concat(Re(e.POW, [c.args.pop(), u]))), u.isImplicit = u.args[0].isImplicit;
1964
- else if (A.length > 0 && A[A.length - 1].op === e.VAR && u.op === e.POW && u.args[0].op === e.VAR && u.args[0].args[0].indexOf("'") === 0)
1965
- u = b(e.POW, [Re(e.POW, [A.pop(), u.args[0]])].concat(u.args.slice(1)));
1966
- else if (A.length > 0 && (S = Yn([A[A.length - 1], u])))
1967
- A.pop(), u = S;
1968
- else if (Oi(A, u)) {
1969
- const Te = A.pop();
1970
- u = Re(e.POW, [mt(y, "10"), At()]), u = Re(e.TIMES, [Te, u]), ys(u.args) && (u.isScientific = !0);
1971
- } else u.op === e.VAR && u.args[0] === "\\degree" && A.length === 1 && A[0].op === e.SUB && A[0].args.length === 1 ? (u = ft(e.SUB, [Oe([A[0].args[0], u])]), A.pop()) : u = Oe([A.pop(), u], !0);
1972
- else (c === Ft || c === nr) && ys(u.args) && (u.isScientific = !0);
1973
- A.push(u), K(D++ < 1e3, "1000: Stuck in loop in multiplicativeExpr()");
1974
- }
1975
- const te = A[0];
1976
- return te.op === e.MUL && te.args.length > 1 ? Ri(te) : te;
1977
- }
1978
- function Ri(s) {
1979
- K(s.op === e.MUL, "1000: Internal error");
1980
- let { args: c } = s, u = c[0];
1981
- return u.op === e.COMMA && u.args.length === 0 && (c = c.slice(1, c.length), c[0].isImplicit = !1), u = c[c.length - 1], u.op === e.COMMA && u.args.length === 0 && (c = c.slice(0, c.length - 1)), b(s.op, c);
1982
- }
1983
- function Cr(s) {
1984
- return (s.op === e.SUB || s.op === e.ADD) && s.args.length === 1 && (s = s.args[0]), s.op === e.NUM ? s : !1;
1985
- }
1986
- function Ls(s, c) {
1987
- return (s.op === e.SUB || s.op === e.ADD) && s.args.length === 1 && (s = s.args[0]), c.op === e.PERCENT && (c = c.args[0]), !!(s.op === e.NUM && gi(c));
1988
- }
1989
- function rn(s) {
1990
- let c;
1991
- return s ? ((s.op === e.SUB || s.op === e.ADD) && s.args.length === 1 && (s = s.args[0]), s.op === e.NUM && (c = new ue(s.args[0])) && rn(c) ? !0 : s instanceof ue ? s.modulo(Si).cmp(Ni) === 0 : !1) : !1;
1992
- }
1993
- const Ni = new ue("0"), Si = new ue("1");
1994
- function Ut(s) {
1995
- let c = 0;
1996
- if (s.op === e.POW) {
1997
- const u = s.args[0], R = s.args[1];
1998
- (u.op === e.VAR || u.isPolynomial || u.op === e.PAREN && Ut(u.args[0])) && rn(R) && (c = parseInt(R.args[0], 10));
1999
- } else s.op === e.VAR ? c = 1 : s.op === e.ADD || s.op === e.SUB ? s.args.forEach((u) => {
2000
- const R = Ut(u);
2001
- c = R > c && R || c;
2002
- }) : s.op === e.MUL && s.args.forEach((u) => {
2003
- const R = Ut(u);
2004
- c = R > c && R || c;
2005
- });
2006
- return c;
2007
- }
2008
- function nn(s) {
2009
- return s.op === e.MUL || s.op === e.TIMES || s.op === e.CDOT;
2010
- }
2011
- function Yn(s) {
2012
- if (!Cr(s[0]))
2013
- return null;
2014
- let c, u = !1;
2015
- s[0].op === e.SUB && s[0].args[0].op === e.NUM && (s[0] = s[0].args[0], u = !0), nn(s[0]) && s[0].args[s[0].args.length - 1].numberFormat === "decimal" && (c = s[0].args.slice(0, s[0].args.length - 1), s = s[0].args.slice(s[0].args.length - 1).concat(s[1]));
2016
- let R, A, S;
2017
- if (!s[0].lbrk && (s[0].op === e.NUM && s[0].numberFormat === "decimal" || s[0].op === e.VAR && s[0].args[0] === "?" || s[0].op === e.TYPE && s[0].args[0].op === e.VAR && s[0].args[0].args[0] === "decimal")) {
2018
- if (!s[1].lbrk && s[1].op === e.OVERLINE)
2019
- A = s[0], S = s[1].args[0];
2020
- else
2021
- return null;
2022
- A.isRepeating = !0, S.isRepeating = !0, R = Re(e.ADD, [A, S]), R.numberFormat = "decimal", R.isRepeating = !0, c && (R = Oe(c.concat(R)));
2023
- } else
2024
- R = null;
2025
- return R = R !== null && u && ft(e.SUB, [R]) || R, R;
2026
- }
2027
- function Oi(s, c) {
2028
- return !!(s.length > 0 && Cr(s[s.length - 1]) && c.op === e.TEXT && (c.args[0].args[0] === "E" || c.args[0].args[0] === "e") && (I() === ht || (I() === 45 || I() === 43) && me() === ht));
2029
- }
2030
- function ys(s) {
2031
- let c;
2032
- if (s.length === 2) {
2033
- const u = s[0], R = s[1];
2034
- return !!((c = Cr(u)) && +c.args[0] >= 1 && +c.args[0] < 10 && R.op === e.POW && (c = Cr(R.args[0])) && c.args[0] === "10" && rn(R.args[1]));
2035
- }
2036
- return !1;
2037
- }
2038
- function es(s) {
2039
- return typeof s == "number" ? s < 0 : s.args.length === 1 ? s.op === i.SUB && s.args[0].args[0] > 0 || // Is unary minus.
2040
- s.op === e.NUM && +s.args[0] < 0 : s.args.length === 2 ? s.op === i.MUL && es(s.args[0]) : !1;
2041
- }
2042
- function sn(s) {
2043
- if (typeof s == "number")
2044
- return -s;
2045
- if (s.op === e.SUB && s.args.length === 1)
2046
- return s.args[0];
2047
- if (s.op === e.MUL) {
2048
- const c = s.args.slice(0);
2049
- return Oe([sn(c.shift())].concat(c));
2050
- }
2051
- return s.op === e.POW && ws(s.args[1]) ? Re(e.POW, [sn(s.args[0]), As]) : ft(e.SUB, [s]);
2052
- }
2053
- function ts(s) {
2054
- return s === fe || s === et || s === qt || s === Pr || s === or || s === cr;
2055
- }
2056
- function an() {
2057
- let s = De(), c;
2058
- for (; ts(c = I()); ) {
2059
- v();
2060
- let u = De();
2061
- switch (c) {
2062
- case Pr:
2063
- case or:
2064
- case cr:
2065
- s.lbrk === Ie && s.rbrk === lt && (s = b(e.SET, [s])), u.lbrk === Ie && u.rbrk === lt && (u = b(e.SET, [u])), s = Re(E[c], [s, u]);
2066
- break;
2067
- case qt:
2068
- s = Re(e.PM, [s, u]);
2069
- break;
2070
- case et:
2071
- s = Re(e.SUB, [s, u]);
2072
- break;
2073
- default: {
2074
- const R = !e.option(y, "compareGrouping") && !(s.isMixedNumber || u.isMixedNumber);
2075
- s = Re(e.ADD, [s, u], R);
2076
- break;
2077
- }
2078
- }
2079
- }
2080
- return s.isPolynomial = Ut(s), s;
2081
- }
2082
- function xr(s) {
2083
- return s.op === e.SIN || s.op === e.COS || s.op === e.TAN || s.op === e.SEC || s.op === e.COT || s.op === e.CSC || s.op === e.SINH || s.op === e.COSH || s.op === e.TANH || s.op === e.SECH || s.op === e.COTH || s.op === e.CSCH || s.op === e.ARCSIN || s.op === e.ARCCOS || s.op === e.ARCTAN || s.op === e.ARCSEC || s.op === e.ARCCOT || s.op === e.ARCCSC || s.op === e.ARCSINH || s.op === e.ARCCOSH || s.op === e.ARCTANH || s.op === e.ARCSECH || s.op === e.ARCCOTH || s.op === e.ARCCSCH || s.op === e.LN || s.op === e.LOG || s.op === e.LG;
2084
- }
2085
- function tt(s) {
2086
- let c = [], u = s.op;
2087
- if (u === e.NUM || u === e.VAR)
2088
- return s;
2089
- (u === e.CDOT || u === e.TIMES) && (u = e.MUL), s.args.forEach((A) => {
2090
- A = tt(A), u !== e.INTEGRAL && A.op === u && A.args.length > 1 ? c = c.concat(A.args) : c.push(A);
2091
- });
2092
- const { isMixedNumber: R } = s;
2093
- return s = b(u, c), s.isMixedNumber = R, s;
2094
- }
2095
- function qe(s, c) {
2096
- if (!e.option(s, "parsingIntegralExpr"))
2097
- return null;
2098
- const u = c.args.length;
2099
- if (c.op === e.MUL && c.args[u - 1].op === e.FRAC || nn(c) && xr(c.args[u - 1]))
2100
- return qe(s, c.args[u - 1]);
2101
- if (c.op === e.FRAC)
2102
- return qe(s, c.args[0]);
2103
- if (xr(c))
2104
- return qe(s, c.args[u - 1]);
2105
- const R = c.args[u - 2], A = c.args[u - 1];
2106
- return c && c.op === e.MUL && R.op === e.VAR && R.args[0] === "d" && A.op === e.VAR && A || null;
2107
- }
2108
- function at(s) {
2109
- K(nn(s) || s.op === e.FRAC || xr(s));
2110
- let c = s.args[s.args.length - 1];
2111
- return s.op === e.MUL && c.op === e.FRAC ? (c = at(c), s = Oe(s.args.slice(0, s.args.length - 1).concat(c))) : nn(s) && xr(c) ? (c = at(c), s = b(s.op, s.args.slice(0, s.args.length - 1).concat(c))) : s.op === e.FRAC ? s = b(e.FRAC, [
2112
- at(s.args[0]),
2113
- s.args[1]
2114
- ]) : xr(s) ? s = b(s.op, [at(s.args[s.args.length - 1])]) : s = Oe(s.args.slice(0, s.args.length - 2)), s;
2115
- }
2116
- function on(s) {
2117
- let c, u;
2118
- const R = e.option(y, "parsingIntegralExpr", !0), A = [];
2119
- if (I() === Mt)
2120
- ae(Mt), c = on(Mt), u = qe(y, tt(De()));
2121
- else if (I() === Bt || s === Mt)
2122
- s !== Mt && ae(Bt), c = on(Bt), u = qe(y, tt(De()));
2123
- else if (s !== Bt && ae(zt), I() === Ue && (v({ oneCharToken: !0 }), A.push(xt()), I() === we && (ae(we, { oneCharToken: !0 }), A.push(xt()))), I() === zt)
2124
- c = on(), u = qe(y, tt(De()));
2125
- else {
2126
- c = tt(De());
2127
- let S;
2128
- for (u = qe(y, c), c = u && at(c) || c; ts(S = I()) && !u; ) {
2129
- v();
2130
- let D = tt(De());
2131
- switch (u = qe(y, D), D = u && at(D) || D, S) {
2132
- case et:
2133
- c = Re(e.SUB, [c, D]);
2134
- break;
2135
- default:
2136
- c = Re(
2137
- e.ADD,
2138
- [c, D],
2139
- !0
2140
- /* flatten */
2141
- );
2142
- break;
2143
- }
2144
- }
2145
- }
2146
- return A.push(c), A.push(u || dt), e.option(y, "parsingIntegralExpr", R), K(u, o(1014, [P.replace(/\\\\/g, "\\")])), b(e.INTEGRAL, A);
2147
- }
2148
- function wi() {
2149
- ae(Mr);
2150
- const s = [];
2151
- return I() === Ue && (v({ oneCharToken: !0 }), s.push(xt())), s.push(De()), b(e.LIM, s);
2152
- }
2153
- function rs() {
2154
- let s = an();
2155
- for (; I() === Xt; ) {
2156
- v();
2157
- const c = an();
2158
- s = Re(e.COLON, [s, c], !0);
2159
- }
2160
- return s;
2161
- }
2162
- function Ps(s) {
2163
- return s === Qt || s === jt || s === Ir || s === Zt || s === yn || s === Pn || s === An || s === Rn || s === Bn || s === _n || s === vn || s === lr || s === Un || s === $n || s === Vn || s === Hn || s === Kn || s === Gn || s === qn || s === Wn;
2164
- }
2165
- function bi() {
2166
- let s = I(), c = rs();
2167
- const u = [];
2168
- let R = !1;
2169
- for (; Ps(s = I()); ) {
2170
- if (v(), s === lr) {
2171
- R = !0;
2172
- continue;
2173
- }
2174
- const A = rs();
2175
- c = b(E[s], [c, A]), R && (c.op = `n${c.op}`, R = !1), u.push(c), c = e.create(y, A);
2176
- }
2177
- return u.length === 0 ? c : u.length === 1 ? u[0] : b(e.COMMA, u);
2178
- }
2179
- function vs(s) {
2180
- return s === us || s === rr || s === Ln;
2181
- }
2182
- function Ar() {
2183
- let s = bi(), c;
2184
- const u = [];
2185
- for (; vs(c = I()) || c === It; ) {
2186
- v();
2187
- const R = rs();
2188
- s = b(E[c], [s, R]), u.push(s), s = e.create(y, R);
2189
- }
2190
- return u.length === 0 ? s : u.length === 1 ? u[0] : b(e.COMMA, u);
2191
- }
2192
- function ks(s) {
2193
- return s === Xn || s === It || s === ur || s === Wr || s === Xr || s === Qr || s === jr || s === Zr || s === en || s === Yr || s === zr || s === Jr;
2194
- }
2195
- function Ds() {
2196
- let s = Ar(), c;
2197
- for (; ks(c = I()); ) {
2198
- v();
2199
- const u = Ar();
2200
- s = b(E[c], [s, u]);
2201
- }
2202
- return s;
2203
- }
2204
- function $t(s) {
2205
- const c = Ds(), u = [c];
2206
- let R;
2207
- for (; (R = I()) === Wt || s && R === Or; )
2208
- v(), f(I()) || u.push(Ds());
2209
- return u.length > 1 ? b(E[Wt], u) : c;
2210
- }
2211
- function Ii() {
2212
- try {
2213
- if (pi(), I()) {
2214
- let s = $t();
2215
- return K(!I(), o(1003, [
2216
- Ct.pos(),
2217
- Ct.lexeme(),
2218
- `"${P.substring(Ct.pos() - 1)}"`
2219
- ])), s.lbrk === Ie && (s = b(e.SET, [s])), s;
2220
- }
2221
- } catch (s) {
2222
- throw console.log(`SYNTAX ERROR in: ${P}
2223
- ${s.stack}`), s;
2224
- }
2225
- return dt;
2226
- }
2227
- return {
2228
- expr: Ii
2229
- };
2230
- function Mi(s) {
2231
- let c = 0, u = "";
2232
- const R = {
2233
- "\\Delta": Qn,
2234
- "\\cdot": nr,
2235
- "\\times": Ft,
2236
- "\\div": yr,
2237
- "\\dfrac": Xe,
2238
- "\\frac": Xe,
2239
- "\\sqrt": Cn,
2240
- "\\vec": wn,
2241
- "\\pm": qt,
2242
- "\\not": lr,
2243
- "\\sin": Nr,
2244
- "\\cos": Pt,
2245
- "\\tan": Sr,
2246
- "\\sec": Rr,
2247
- "\\cot": Gt,
2248
- "\\csc": $e,
2249
- "\\arcsin": Jt,
2250
- "\\arccos": Yt,
2251
- "\\arctan": er,
2252
- "\\arcsec": sr,
2253
- "\\arccsc": ir,
2254
- "\\arccot": ar,
2255
- "\\asin": Jt,
2256
- // \operatorname{asin}
2257
- "\\acos": Yt,
2258
- "\\atan": er,
2259
- "\\asec": sr,
2260
- "\\acsc": ir,
2261
- "\\acot": ar,
2262
- "\\sinh": kr,
2263
- "\\cosh": Dr,
2264
- "\\tanh": Fr,
2265
- "\\sech": Br,
2266
- "\\coth": _r,
2267
- "\\csch": Ur,
2268
- "\\arcsinh": $r,
2269
- "\\arccosh": Vr,
2270
- "\\arctanh": Hr,
2271
- "\\arcsech": Kr,
2272
- "\\arccsch": Gr,
2273
- "\\arccoth": qr,
2274
- "\\ln": Er,
2275
- "\\lg": wr,
2276
- "\\log": br,
2277
- "\\left": ye,
2278
- "\\right": He,
2279
- "\\big": null,
2280
- // whitespace
2281
- "\\Big": null,
2282
- "\\bigg": null,
2283
- "\\Bigg": null,
2284
- "\\ ": null,
2285
- "\\quad": null,
2286
- "\\qquad": null,
2287
- "\\text": st,
2288
- "\\textrm": st,
2289
- "\\textit": st,
2290
- "\\textbf": st,
2291
- "\\operatorname": fr,
2292
- "\\lt": Qt,
2293
- "\\le": jt,
2294
- "\\leq": jt,
2295
- "\\gt": Ir,
2296
- "\\ge": Zt,
2297
- "\\geq": Zt,
2298
- "\\ne": rr,
2299
- "\\neq": rr,
2300
- "\\ngtr": yn,
2301
- "\\nless": Pn,
2302
- "\\ni": vn,
2303
- "\\subseteq": Un,
2304
- "\\supseteq": $n,
2305
- "\\subset": Vn,
2306
- "\\supset": Hn,
2307
- "\\approx": Ln,
2308
- "\\implies": Xn,
2309
- "\\Rightarrow": ur,
2310
- "\\rightarrow": It,
2311
- "\\leftarrow": Wr,
2312
- "\\longrightarrow": Xr,
2313
- "\\longleftarrow": Qr,
2314
- "\\overrightarrow": jr,
2315
- "\\overleftarrow": Zr,
2316
- "\\Leftrightarrow": en,
2317
- "\\leftrightarrow": Yr,
2318
- "\\longleftrightarrow": zr,
2319
- "\\overleftrightarrow": Jr,
2320
- "\\perp": Bn,
2321
- "\\propto": _n,
2322
- "\\parallel": Kn,
2323
- "\\nparallel": Gn,
2324
- "\\sim": qn,
2325
- "\\cong": Wn,
2326
- "\\exists": xn,
2327
- "\\in": An,
2328
- "\\forall": Tn,
2329
- "\\lim": Mr,
2330
- "\\exp": En,
2331
- "\\to": Rn,
2332
- "\\sum": Nn,
2333
- "\\int": zt,
2334
- "\\iint": Bt,
2335
- "\\iiint": Mt,
2336
- "\\prod": Sn,
2337
- "\\cup": or,
2338
- "\\bigcup": Dn,
2339
- "\\cap": cr,
2340
- "\\bigcap": Fn,
2341
- "\\%": ps,
2342
- "\\binom": On,
2343
- "\\begin": ds,
2344
- "\\end": Lr,
2345
- "\\colon": Xt,
2346
- "\\vert": Se,
2347
- "\\lvert": Se,
2348
- "\\rvert": Se,
2349
- "\\mid": Se,
2350
- "\\type": tr,
2351
- "\\format": Cs,
2352
- "\\overline": bn,
2353
- "\\dot": gr,
2354
- "\\overset": In,
2355
- "\\underset": Mn,
2356
- "\\backslash": Pr,
2357
- "\\mathbf": vr,
2358
- "\\abs": ms,
2359
- "\\MathQuillMathField": kn,
2360
- "\\ldots": nt,
2361
- // ... and var are close syntactic alternatives
2362
- "\\vdots": nt,
2363
- "\\ddots": nt,
2364
- "\\infty": xs,
2365
- "\\langle": pr,
2366
- "\\rangle": ut
2367
- }, A = {
2368
- 162: "\\cent",
2369
- 176: "\\degree",
2370
- 8592: "\\leftarrow",
2371
- 8594: "\\rightarrow",
2372
- 8652: "\\rightleftharpoons",
2373
- 8704: "\\forall",
2374
- 8705: "\\complement",
2375
- 8706: "\\partial",
2376
- 8707: "\\exists",
2377
- 8708: "\\nexists",
2378
- 8709: "\\varnothing",
2379
- 8710: "\\triangle",
2380
- 8711: "\\nabla",
2381
- 8712: "\\in",
2382
- 8713: "\\notin",
2383
- 8714: "\\in",
2384
- 8715: "\\ni",
2385
- 8716: "\\notni",
2386
- 8717: "\\ni",
2387
- 8718: "\\blacksquare",
2388
- 8719: "\\sqcap",
2389
- 8720: "\\amalg",
2390
- 8721: "\\sigma",
2391
- 8722: "-",
2392
- 8723: "\\mp",
2393
- 8724: "\\dotplus",
2394
- 8725: "/",
2395
- 8726: "\\setminus",
2396
- 8727: "*",
2397
- 8728: "\\circ",
2398
- 8729: "\\bullet",
2399
- 8730: "\\sqrt",
2400
- 8731: null,
2401
- 8732: null,
2402
- 8733: "\\propto",
2403
- 8734: "\\infty",
2404
- 8735: "\\llcorner",
2405
- 8736: "\\angle",
2406
- 8737: "\\measuredangle",
2407
- 8738: "\\sphericalangle",
2408
- 8739: "\\divides",
2409
- 8740: "\\notdivides",
2410
- 8741: "\\parallel",
2411
- 8742: "\\nparallel",
2412
- 8743: "\\wedge",
2413
- 8744: "\\vee",
2414
- 8745: "\\cap",
2415
- 8746: "\\cup",
2416
- 8747: "\\int",
2417
- 8748: "\\iint",
2418
- 8749: "\\iiint",
2419
- 8750: "\\oint",
2420
- 8751: "\\oiint",
2421
- 8752: "\\oiiint",
2422
- 8753: null,
2423
- 8754: null,
2424
- 8755: null,
2425
- 8756: "\\therefore",
2426
- 8757: "\\because",
2427
- 8758: "\\colon",
2428
- 8759: null,
2429
- 8760: null,
2430
- 8761: null,
2431
- 8762: null,
2432
- 8763: null,
2433
- 8764: "\\sim",
2434
- 8765: "\\backsim",
2435
- 8766: null,
2436
- 8767: null,
2437
- 8768: "\\wr",
2438
- 8769: "\\nsim",
2439
- 8770: "\\eqsim",
2440
- 8771: "\\simeq",
2441
- 8772: null,
2442
- 8773: "\\cong",
2443
- 8774: null,
2444
- 8775: "\\ncong",
2445
- 8776: "\\approx",
2446
- 8777: null,
2447
- 8778: "\\approxeq",
2448
- 8779: null,
2449
- 8780: null,
2450
- 8781: "\\asymp",
2451
- 8782: "\\Bumpeq",
2452
- 8783: "\\bumpeq",
2453
- 8784: "\\doteq",
2454
- 8785: "\\doteqdot",
2455
- 8786: "\\fallingdotseq",
2456
- 8787: "\\risingdotseq",
2457
- 8788: null,
2458
- 8789: null,
2459
- 8790: "\\eqcirc",
2460
- 8791: "\\circeq",
2461
- 8792: null,
2462
- 8793: null,
2463
- 8794: null,
2464
- 8795: null,
2465
- 8796: "\\triangleq",
2466
- 8797: null,
2467
- 8798: null,
2468
- 8799: null,
2469
- 8800: "\\ne",
2470
- 8801: "\\equiv",
2471
- 8802: null,
2472
- 8803: null,
2473
- 8804: "\\le",
2474
- 8805: "\\ge",
2475
- 8806: "\\leqq",
2476
- 8807: "\\geqq",
2477
- 8808: "\\lneqq",
2478
- 8809: "\\gneqq",
2479
- 8810: "\\ll",
2480
- 8811: "\\gg",
2481
- 8812: "\\between",
2482
- 8813: null,
2483
- 8814: "\\nless",
2484
- 8815: "\\ngtr",
2485
- 8816: "\\nleq",
2486
- 8817: "\\ngeq",
2487
- 8818: "\\lessim",
2488
- 8819: "\\gtrsim",
2489
- 8820: null,
2490
- 8821: null,
2491
- 8822: "\\lessgtr",
2492
- 8823: "\\gtrless",
2493
- 8824: null,
2494
- 8825: null,
2495
- 8826: "\\prec",
2496
- 8827: "\\succ",
2497
- 8828: "\\preccurlyeq",
2498
- 8829: "\\succcurlyeq",
2499
- 8830: "\\precsim",
2500
- 8831: "\\succsim",
2501
- 8832: "\\nprec",
2502
- 8833: "\\nsucc",
2503
- 8834: "\\subset",
2504
- 8835: "\\supset",
2505
- 8836: null,
2506
- 8837: null,
2507
- 8838: "\\subseteq",
2508
- 8839: "\\supseteq",
2509
- 8840: "\\nsubseteq",
2510
- 8841: "\\nsupseteq",
2511
- 8842: "\\subsetneq",
2512
- 8843: "\\supsetneq",
2513
- 8844: null,
2514
- 8845: null,
2515
- 8846: null,
2516
- 8847: "\\sqsubset",
2517
- 8848: "\\sqsupset",
2518
- 8849: null,
2519
- 8850: null,
2520
- 8851: "\\sqcap",
2521
- 8852: "\\sqcup",
2522
- 8853: "\\oplus",
2523
- 8854: "\\ominus",
2524
- 8855: "\\otimes",
2525
- 8856: "\\oslash",
2526
- 8857: "\\odot",
2527
- 8858: "\\circledcirc",
2528
- 8859: "\\circledast",
2529
- 8860: null,
2530
- 8861: "\\circleddash",
2531
- 8862: "\\boxplus",
2532
- 8863: "\\boxminus",
2533
- 8864: "\\boxtimes",
2534
- 8865: "\\boxdot",
2535
- 8866: "\\vdash",
2536
- 8867: "\\dashv",
2537
- 8868: "\\top",
2538
- 8869: "\\bot",
2539
- 8870: null,
2540
- 8871: "\\models",
2541
- 8872: "\\vDash",
2542
- 8873: "\\Vdash",
2543
- 8874: "\\Vvdash",
2544
- 8875: "\\VDash*",
2545
- 8876: "\\nvdash",
2546
- 8877: "\\nvDash",
2547
- 8878: "\\nVdash",
2548
- 8879: "\\nVDash",
2549
- 8880: null,
2550
- 8881: null,
2551
- 8882: "\\vartriangleleft",
2552
- 8883: "\\vartriangleright",
2553
- 8884: "\\trianglelefteq",
2554
- 8885: "\\trianglerighteq",
2555
- 8886: null,
2556
- 8887: null,
2557
- 8888: "\\multimap",
2558
- 8889: null,
2559
- 8890: "\\intercal",
2560
- 8891: "\\veebar",
2561
- 8892: "\\barwedge",
2562
- 8893: null,
2563
- 8894: null,
2564
- 8895: null,
2565
- 8896: "\\wedge",
2566
- 8897: "\\vee",
2567
- 8898: "\\cap",
2568
- 8899: "\\cup",
2569
- 8900: "\\diamond",
2570
- 8901: "\\cdot",
2571
- 8902: "\\star",
2572
- 8903: null,
2573
- 8904: "\\bowtie",
2574
- 8905: "\\ltimes",
2575
- 8906: "\\rtimes",
2576
- 8907: "\\leftthreetimes",
2577
- 8908: "\\rightthreetimes",
2578
- 8909: "\\backsimeq",
2579
- 8910: "\\curlyvee",
2580
- 8911: "\\curlywedge",
2581
- 8912: "\\Subset",
2582
- 8913: "\\Supset",
2583
- 8914: "\\Cap",
2584
- 8915: "\\Cup",
2585
- 8916: "\\pitchfork",
2586
- 8917: "\\lessdot",
2587
- 8918: "\\gtrdot",
2588
- 8919: null,
2589
- 8920: "\\lll",
2590
- 8921: "\\ggg",
2591
- 8922: "\\lesseqgtr",
2592
- 8923: "\\gtreqless",
2593
- 8924: null,
2594
- 8925: null,
2595
- 8926: "\\curlyeqprec",
2596
- 8927: "\\curlyeqsucc",
2597
- 8928: null,
2598
- 8929: null,
2599
- 8930: null,
2600
- 8931: null,
2601
- 8932: null,
2602
- 8933: null,
2603
- 8934: "\\lnsim",
2604
- 8935: "\\gnsim",
2605
- 8936: "\\precnsim",
2606
- 8937: "\\succnsim",
2607
- 8938: "\\ntriangleleft",
2608
- 8939: "\\ntriangleright",
2609
- 8940: "\\ntrianglelefteq",
2610
- 8941: "\\ntrianglerighteq",
2611
- 8942: "\\vdots",
2612
- 8943: "\\cdots",
2613
- 8944: null,
2614
- 8945: "\\ddots",
2615
- 8946: null,
2616
- 8947: null,
2617
- 8948: null,
2618
- 8949: null,
2619
- 8950: null,
2620
- 8951: null,
2621
- 8952: null,
2622
- 8953: null,
2623
- 8954: null,
2624
- 8955: null,
2625
- 8956: null,
2626
- 8957: null,
2627
- 8958: null,
2628
- 8959: null,
2629
- 10231: "\\longleftrightarrow",
2630
- 945: "\\alpha",
2631
- 946: "\\beta",
2632
- 947: "\\gamma",
2633
- 948: "\\delta",
2634
- 949: "\\epsilon",
2635
- 950: "\\zeta",
2636
- 951: "\\eta",
2637
- 952: "\\theta",
2638
- 953: "\\iota",
2639
- 954: "\\kappa",
2640
- 955: "\\lambda",
2641
- 956: "\\mu",
2642
- 957: "\\nu",
2643
- 958: "\\xi",
2644
- 959: "o",
2645
- 960: "\\pi",
2646
- 961: "\\rho",
2647
- 962: "\\varsigma",
2648
- 963: "\\sigma",
2649
- 964: "\\tau",
2650
- 965: "\\upsilon",
2651
- 966: "\\varphi",
2652
- 967: "\\chi",
2653
- 968: "\\psi",
2654
- 969: "\\omega",
2655
- 977: "\\vartheta",
2656
- 981: "\\phi",
2657
- 982: "\\varpi",
2658
- 1009: "\\varrho",
2659
- 1013: "\\epsilon",
2660
- 913: "A",
2661
- 914: "B",
2662
- 915: "\\Gamma",
2663
- 916: "\\Delta",
2664
- 917: "E",
2665
- 918: "Z",
2666
- 919: "H",
2667
- 920: "\\Theta",
2668
- 921: "I",
2669
- 922: "K",
2670
- 923: "\\Lambda",
2671
- 924: "M",
2672
- 925: "N",
2673
- 926: "\\Xi",
2674
- 927: "O",
2675
- 928: "\\Pi",
2676
- 929: "P",
2677
- 930: null,
2678
- 931: "\\Sigma",
2679
- 932: "T",
2680
- 933: "\\Upsilon",
2681
- 934: "\\Phi",
2682
- 935: "X",
2683
- 936: "\\Psi",
2684
- 937: "\\Omega",
2685
- 1013: "\\epsilon"
2686
- };
2687
- function S(F) {
2688
- return F >= 65 && F <= 90 || F >= 97 && F <= 122;
2689
- }
2690
- function D(F) {
2691
- F || (F = {});
2692
- let W;
2693
- u = "";
2694
- let We;
2695
- for (; c < s.length; ) {
2696
- let je;
2697
- switch (W = s.charCodeAt(c++), W === 55349 && (s.charCodeAt(c++) === 57030 ? W = 949 : K(!1, o(1004, [String.fromCharCode(W), W]))), W) {
2698
- case 32:
2699
- case 9:
2700
- case 10:
2701
- case 13:
2702
- case 160:
2703
- case 8203:
2704
- continue;
2705
- case 38:
2706
- if (s.substring(c).indexOf("nbsp;") === 0) {
2707
- c += 5;
2708
- continue;
2709
- }
2710
- return Dt;
2711
- case 92:
2712
- switch (u += String.fromCharCode(W), s.charCodeAt(c)) {
2713
- case 92:
2714
- return c++, kt;
2715
- case 123:
2716
- return c++, Ie;
2717
- case 124:
2718
- return c++, Se;
2719
- case 125:
2720
- return c++, lt;
2721
- }
2722
- if (je = se(), je !== null)
2723
- return je;
2724
- u = "";
2725
- continue;
2726
- case 42:
2727
- case 8727:
2728
- return s.charCodeAt(c) === 42 ? (c++, we) : Ft;
2729
- case 45:
2730
- case 8722:
2731
- return s.charCodeAt(c) === 62 ? (c++, It) : et;
2732
- case 47:
2733
- case 8725:
2734
- return vt;
2735
- case 33:
2736
- return s.charCodeAt(c) === 61 ? (c++, rr) : W;
2737
- case 58:
2738
- case 8758:
2739
- return Xt;
2740
- case 59:
2741
- return Or;
2742
- case 37:
2743
- case 40:
2744
- case 41:
2745
- case 43:
2746
- case 44:
2747
- case 61:
2748
- case 63:
2749
- case 91:
2750
- case 93:
2751
- case 94:
2752
- case 95:
2753
- case 123:
2754
- case 124:
2755
- case 125:
2756
- return u += String.fromCharCode(W), W;
2757
- case 36:
2758
- return u += String.fromCharCode(W), nt;
2759
- case 39:
2760
- return Qe(W);
2761
- case 60:
2762
- return s.charCodeAt(c) === 61 ? (c++, jt) : Qt;
2763
- case 62:
2764
- return s.charCodeAt(c) === 61 ? (c++, Zt) : Ir;
2765
- default:
2766
- return S(W) || W === he ? ce(W) : (We = A[W]) ? (u = We, je = R[u], je === void 0 && (je = nt), je) : Pe(String.fromCharCode(W)) || x(W) ? F.oneCharToken ? (u += String.fromCharCode(W), ht) : Te(W) : (K(!1, o(1004, [String.fromCharCode(W), W])), 0);
2767
- }
2768
- }
2769
- return 0;
2770
- }
2771
- let te;
2772
- function Te(F) {
2773
- let W;
2774
- for (; x(F) || Pe(String.fromCharCode(F)) || (W = ne(String.fromCharCode(F), te)); ) {
2775
- if (te = W || te, u += String.fromCharCode(F), F = s.charCodeAt(c++), F === 92 && s.charCodeAt(c) === 32 && (F = 32, c++), Pe(String.fromCharCode(F)) || (W = ne(String.fromCharCode(F), te)))
2776
- for (te = W || te, u += String.fromCharCode(F), F = s.charCodeAt(c++); F === 92 && (F = s.charCodeAt(c)) === 32 && c++ || h(F); )
2777
- F = s.charCodeAt(c++);
2778
- F === 92 && s.charCodeAt(c) === 32 && (F = 32, c++);
2779
- }
2780
- return u === "." && (s.substring(c).indexOf("overline") === 0 || s.substring(c).indexOf("dot") === 0) && (u = "0."), c--, ht;
2781
- }
2782
- function ce(F) {
2783
- let W = String.fromCharCode(F);
2784
- u += W;
2785
- let We = u;
2786
- const je = c + 1;
2787
- for (; (S(F) || F === he) && (F = s.charCodeAt(c++), !(!S(F) || (W = String.fromCharCode(F), !J.some((Li) => {
2788
- const yi = We + W;
2789
- return Li.indexOf(yi) === 0;
2790
- })))); )
2791
- We += W;
2792
- for (J.indexOf(We) >= 0 ? u = We : c = je; u.lastIndexOf("'") === u.length - 1 && F === he; )
2793
- u += String.fromCharCode(F), F = s.charCodeAt(c++);
2794
- return c--, nt;
2795
- }
2796
- function se() {
2797
- let F = s.charCodeAt(c++);
2798
- if (F === Q)
2799
- u = String.fromCharCode(F);
2800
- else if (F === ee)
2801
- u += String.fromCharCode(F);
2802
- else if ([
2803
- w,
2804
- rt,
2805
- ct,
2806
- Ce,
2807
- U
2808
- ].indexOf(F) >= 0)
2809
- u = "\\ ";
2810
- else {
2811
- for (; S(F); )
2812
- u += String.fromCharCode(F), F = s.charCodeAt(c++);
2813
- u = u === "\\varepsilon" && "\\epsilon" || u, c--;
2814
- }
2815
- let W = R[u];
2816
- if (W === void 0)
2817
- u === "\\emptyset" && (u = "\\varnothing"), W = nt;
2818
- else if (W === fr) {
2819
- for (F = s.charCodeAt(c++); F && F !== Z; )
2820
- F = s.charCodeAt(c++);
2821
- for (u = "", F = s.charCodeAt(c++); F && F !== le; ) {
2822
- const We = String.fromCharCode(F);
2823
- We === "&" && s.substring(c).indexOf("nbsp;") === 0 ? c += 5 : We === " " || We === " " || (u += We), F = s.charCodeAt(c++);
2824
- }
2825
- W = R[`\\${u}`], W === void 0 && (W = fr);
2826
- } else if (W === st || W === tr) {
2827
- for (F = s.charCodeAt(c++); F && F !== Z; )
2828
- F = s.charCodeAt(c++);
2829
- u = "", F = s.charCodeAt(c++);
2830
- const We = e.option(y, "keepTextWhitespace");
2831
- for (; F && F !== le; ) {
2832
- const je = String.fromCharCode(F);
2833
- !We && je === "&" && s.substring(c).indexOf("nbsp;") === 0 ? c += 5 : !We && (je === " " || je === " ") || (u += je), F = s.charCodeAt(c++);
2834
- }
2835
- W !== tr && (!u || e.option(y, "ignoreText") ? W = null : W = st);
2836
- } else W === xs && (W = ht);
2837
- return W;
2838
- }
2839
- function Qe(F) {
2840
- for (K(F === 39), u = "'"; s.charCodeAt(c) === 39; )
2841
- c++, u += "'";
2842
- return nt;
2843
- }
2844
- return {
2845
- start: D,
2846
- lexeme() {
2847
- return u;
2848
- },
2849
- pos() {
2850
- return c;
2851
- }
2852
- };
2853
- }
2854
- };
2855
- return e;
2856
- })(), ka = Js, d = va, Ne = (e, t, r) => {
2857
- if (t === void 0 && (t = "failed!"), !e) {
2858
- const n = new Error(t);
2859
- throw n.location = r || Ee.location, n;
2860
- }
2861
- }, Ys = (e, t) => {
2862
- let r = Ee.messages[e];
2863
- return t && t.forEach((n, a) => {
2864
- r = r.replace(`%${a + 1}`, n);
2865
- }), `${e}: ${r}`;
2866
- }, Da = (e, t, r) => {
2867
- Ne(e <= t, "Invalid code range");
2868
- const n = Ee.reservedCodes.every((a) => t < a.first || e > a.last);
2869
- Ne(n, "Conflicting request for error code range"), Ee.reservedCodes.push({ first: e, last: t, name: r });
2870
- }, Fa = (e) => {
2871
- Ee.location = e;
2872
- }, Ba = () => {
2873
- Ee.location = null;
2874
- }, _a = (e, t) => {
2875
- e !== void 0 && (Ee.timeout = e ? Date.now() + e : 0, Ee.timeoutMessage = t || "ERROR timeout exceeded");
2876
- }, Ua = () => {
2877
- Ne(!Ee.timeout || Ee.timeout > Date.now(), Ee.timeoutMessage);
2878
- }, $a = (e, t) => {
2879
- Ee.count = e, Ee.countMessage = t || "ERROR count exceeded";
2880
- }, Va = () => {
2881
- const { count: e } = Ee;
2882
- if (typeof e != "number" || Number.isNaN(e)) {
2883
- Ne(!1, "ERROR counter not set");
2884
- return;
2885
- }
2886
- Ne(Ee.count--, Ee.countMessage);
2887
- }, Ee = {
2888
- assert: Ne,
2889
- message: Ys,
2890
- messages: {},
2891
- reserveCodeRange: Da,
2892
- reservedCodes: [],
2893
- setLocation: Fa,
2894
- clearLocation: Ba,
2895
- checkTimeout: Ua,
2896
- setTimeout: _a,
2897
- setCounter: $a,
2898
- checkCounter: Va
2899
- }, Vt = { words: { "\\alpha": "\\alpha", "\\beta": "\\beta", "\\gamma": "\\gamma", "\\delta": "\\delta", "\\epsilon": "\\epsilon", "\\zeta": "\\zeta", "\\eta": "\\eta", "\\theta": "\\theta", "\\iota": "\\iota", "\\kappa": "\\kappa", "\\lambda": "\\lambda", "\\mu": "\\mu", "\\nu": "\\nu", "\\xi": "\\xi", "\\omicron": "\\omicron", "\\pi": "\\pi", "\\rho": "\\rho", "\\sigma": "\\simga", "\\tau": "\\tau", "\\upsilon": "\\upsilon", "\\phi": "\\phi", "\\chi": "\\chi", "\\psi": "\\psi", "\\omega": "\\omega", "\\Alpha": "\\Alpha", "\\Beta": "\\Beta", "\\Gamma": "\\Gamma", "\\Delta": "\\Delta", "\\Epsilon": "\\Epsilon", "\\Zeta": "\\Zeta", "\\Eta": "\\Eta", "\\Theta": "\\Theta", "\\Iota": "\\Iota", "\\Kappa": "\\Kappa", "\\Lambda": "\\Lambda", "\\Mu": "\\Mu", "\\Nu": "\\Nu", "\\Xi": "\\Xi", "\\Omicron": "\\Omicron", "\\Pi": "\\Pi", "\\Rho": "\\Rho", "\\Sigma": "\\Simga", "\\Tau": "\\Tau", "\\Upsilon": "\\Upsilon", "\\Phi": "\\Phi", "\\Chi": "\\Chi", "\\Psi": "\\Psi", "\\Omega": "\\Omega", "\\emptyset": "\\emptyset" }, types: { numberPosNeg: ["(\\type{numberPosNeg})", "\\type{number}", "-\\type{number}"] }, rules: { "\\left(?\\right]": ["\\left(%1\\right]"], "\\left[?\\right)": ["\\left[%1\\right)"], "\\left[?\\right]": ["\\left[%1\\right]"], "\\left\\{?\\right\\}": ["\\left\\{%1\\right\\}"], "?\\cup?": ["%1\\cup %2"], "?\\cap?": ["%1\\cap %2"], "?\\backslash?": ["%1\\backslash %2"], "\\mathbb{?}": ["\\mathbb{%2}"], "\\ln{?}": ["\\ln{%2}"], "\\log{?}": ["\\log{%2}"], "\\log_{?}{?}": ["\\log_{%1}{%2}"], "\\type{matrix}": [{ "\\begin{bmatrix}%1\\end{bmatrix}": { "\\type{row}": "%*\\\\", "\\type{column}": "%*&" } }], "\\frac{d}{d?}?": ["\\frac{d}{d%2}{%1}"], "\\frac{d^?}{d?^?}?": ["\\frac{d^%3}{d%2^%3}{%1}"], "\\int_?^? ? d?": ["\\int_{%1}^{%2} %3 d%4"], "\\int ? d?": ["\\int %1 d%2"], "\\lim_? ?": [{ "\\lim_{%1}{%2}": { "? \\rightarrow ?": "%1 \\rightarrow %2", "? \\to ?": "%1 \\to %2", "\\left(?,?\\right)": "\\left(%1, %2\\right)" } }], "\\sum_?^? ?": ["\\sum_{%1}^{%2}{%3}"], "\\sin{?}": ["\\sin{%1}"], "\\cos{?}": ["\\cos{%1}"], "\\tan{?}": ["\\tan{%1}"], "\\cot{?}": ["\\cot{%1}"], "\\sec{?}": ["\\sec{%1}"], "\\csc{?}": ["\\csc{%1}"], "\\sin^{-1}?": ["\\sin^{-1}{%1}"], "\\cos^{-1}{?}": ["\\cos^{-1}{%1}"], "\\tan^{-1}{?}": ["\\tan^{-1}{%1}"], "\\cot^{-1}{?}": ["\\cot^{-1}{%1}"], "\\sec^{-1}{?}": ["\\sec^{-1}{%1}"], "\\csc^{-1}{?}": ["\\csc^{-1}{%1}"], "\\sinh{?}": ["\\sinh{%1}"], "\\cosh{?}": ["\\cosh{%1}"], "\\tanh{?}": ["\\tanh{%1}"], "\\coth{?}": ["\\coth{%1}"], "\\sech{?}": ["\\sech{%1}"], "\\csch{?}": ["\\csch{%1}"], "\\sinh^{-1}{?}": ["\\sinh^{-1}{%1}"], "\\cosh^{-1}{?}": ["\\cosh^{-1}{%1}"], "\\tanh^{-1}{?}": ["\\tanh^{-1}{%1}"], "\\coth^{-1}{?}": ["\\coth^{-1}{%1}"], "\\sech^{-1}{?}": ["\\sech^{-1}{%1}"], "\\csch^{-1}{?}": ["\\csch^{-1}{%1}"], "?<?": ["%1<%2"], "?\\nless?": ["%1\\nless %2"], "?\\le?": ["%1\\le %2"], "?>?": ["%1>%2"], "?\\ge?": ["%1\\ge %2"], "?\\ngtr?": ["%1\\ngtr %2"], "?=?": ["%1=%2"], "?\\ne?": ["%1\\ne %2"], "?\\approx?": ["%1\\approx %2"], "\\infty": ["\\infty"], "\\type{mixedNumber}": ["%1%2"], "?%": ["{%1}%"], "?!": ["{%1}!"], "\\frac{?}{?}": ["\\frac{%1}{%2}"], "\\abs{?}": ["\\abs{%1}"], "?\\degree": ["{%1}\\degree"], "\\type{fraction}^?": ["\\left(%1\\right)^{%2}"], "{-?}^?": ["\\left(%1\\right)^{%2}"], "?^?": ["{%1}^{%2}"], "\\sqrt{?}": ["\\sqrt{%1}"], "\\sqrt[?]{?}": ["\\sqrt[%2]{%1}"], "-?": ["-%1"], "?+{-?}": ["%1+\\left(%2\\right)"], "?+?": ["%1+%2"], "?-{-?}": ["%1-\\left(%2\\right)"], "?-?": ["%1-%2"], "?*{-?}": ["%1\\times\\left(%2\\right)"], "?*?": ["%1\\times %2"], "?\\cdot{-?}": ["%1\\cdot\\left(%2\\right)"], "?\\cdot?": ["%1\\cdot %2"], "?\\div?": ["%1\\div %2"], "?:?": ["%1:%2"], "?_?": ["%1_{%2}"], "\\left(?\\right)": ["\\left(%1\\right)"], "{\\type{numberPosNeg}}{\\type{numberPosNeg}}": ["(%1)(%2)"], "? ?": ["%1 %2"], "?,?": ["%1,%2"], "?": ["%1"] } };
2900
- (function(e) {
2901
- function t(h, x) {
2902
- return {
2903
- op: h,
2904
- args: x
2905
- };
2906
- }
2907
- function r(h, x) {
2908
- return x.length > 1 ? { op: h, args: x } : x[0];
2909
- }
2910
- const n = (h, x) => {
2911
- const N = h.indexOf("{"), w = (N > 0 && h.slice(0, N) || h).trim();
2912
- Ne(x && x[w]);
2913
- const U = N > 0 && h.slice(N);
2914
- return w === "$fmt" ? { rawConfig: U } : U && JSON.parse(U) || {};
2915
- };
2916
- function a(h) {
2917
- function x(T, C, L, B) {
2918
- switch (Ne(C.op && C.args, `Visitor.visit() op=${C.op} args = ${C.args}`), C.op) {
2919
- case d.NUM:
2920
- C = L.numeric(C, B);
2921
- break;
2922
- case d.ADD:
2923
- case d.SUB:
2924
- case d.PM:
2925
- case d.BACKSLASH:
2926
- case d.DIV:
2927
- case d.FRAC:
2928
- case d.BINOM:
2929
- case d.LOG:
2930
- case d.COLON:
2931
- case d.FUNC:
2932
- case d.TYPE:
2933
- case d.SUBSCRIPT:
2934
- C.args.length === 1 ? C = L.unary(C, B) : C = L.binary(C, B);
2935
- break;
2936
- case d.MUL:
2937
- case d.TIMES:
2938
- case d.COEFF:
2939
- case d.CDOT:
2940
- C = L.multiplicative(C, B);
2941
- break;
2942
- case d.POW:
2943
- C = L.exponential(C, B);
2944
- break;
2945
- case d.VAR:
2946
- C = L.variable(C, B);
2947
- break;
2948
- case d.SQRT:
2949
- case d.SIN:
2950
- case d.COS:
2951
- case d.TAN:
2952
- case d.SEC:
2953
- case d.CSC:
2954
- case d.COT:
2955
- case d.ARCSIN:
2956
- case d.ARCCOS:
2957
- case d.ARCTAN:
2958
- case d.ARCSEC:
2959
- case d.ARCCSC:
2960
- case d.ARCCOT:
2961
- case d.SINH:
2962
- case d.COSH:
2963
- case d.TANH:
2964
- case d.ARCSINH:
2965
- case d.ARCCOSH:
2966
- case d.ARCTANH:
2967
- case d.ARCSECH:
2968
- case d.ARCCSCH:
2969
- case d.ARCCOTH:
2970
- case d.SECH:
2971
- case d.CSCH:
2972
- case d.COTH:
2973
- case d.PERCENT:
2974
- case d.M:
2975
- case d.ABS:
2976
- case d.FACT:
2977
- case d.FORALL:
2978
- case d.EXISTS:
2979
- case d.IN:
2980
- case d.SUM:
2981
- case d.LIM:
2982
- case d.EXP:
2983
- case d.TO:
2984
- case d.DERIV:
2985
- case d.INTEGRAL:
2986
- case d.PROD:
2987
- case d.CUP:
2988
- case d.BIGCUP:
2989
- case d.CAP:
2990
- case d.BIGCAP:
2991
- case d.PIPE:
2992
- case d.ION:
2993
- case d.OVERLINE:
2994
- case d.OVERSET:
2995
- case d.UNDERSET:
2996
- case d.MATHBF:
2997
- case d.TEXT:
2998
- case d.NONE:
2999
- case d.DEGREE:
3000
- case d.DOT:
3001
- case d.MATHFIELD:
3002
- case d.SET:
3003
- case d.NOT:
3004
- case d.OPERATORNAME:
3005
- C = L.unary(C, B);
3006
- break;
3007
- case d.COMMA:
3008
- case d.MATRIX:
3009
- case d.VEC:
3010
- case d.ROW:
3011
- case d.COL:
3012
- case d.LIST:
3013
- case d.ANGLEBRACKET:
3014
- C = L.comma(C, B);
3015
- break;
3016
- case d.EQL:
3017
- case d.LT:
3018
- case d.LE:
3019
- case d.GT:
3020
- case d.GE:
3021
- case d.NE:
3022
- case d.NGTR:
3023
- case d.NLESS:
3024
- case d.NI:
3025
- case d.SUBSETEQ:
3026
- case d.SUPSETEQ:
3027
- case d.SUBSET:
3028
- case d.SUPSET:
3029
- case d.NNI:
3030
- case d.NSUBSETEQ:
3031
- case d.NSUPSETEQ:
3032
- case d.NSUBSET:
3033
- case d.NSUPSET:
3034
- case d.APPROX:
3035
- case d.IMPLIES:
3036
- case d.PERP:
3037
- case d.PROPTO:
3038
- case d.PARALLEL:
3039
- case d.NPARALLEL:
3040
- case d.SIM:
3041
- case d.CONG:
3042
- case d.CAPRIGHTARROW:
3043
- case d.RIGHTARROW:
3044
- case d.LEFTARROW:
3045
- case d.LONGRIGHTARROW:
3046
- case d.LONGLEFTARROW:
3047
- case d.OVERRIGHTARROW:
3048
- case d.OVERLEFTARROW:
3049
- case d.CAPLEFTRIGHTARROW:
3050
- case d.LEFTRIGHTARROW:
3051
- case d.LONGLEFTRIGHTARROW:
3052
- case d.OVERLEFTRIGHTARROW:
3053
- C = L.equals(C, B);
3054
- break;
3055
- case d.PAREN:
3056
- case d.BRACKET:
3057
- case d.BRACE:
3058
- case d.INTERVAL:
3059
- case d.INTERVALOPEN:
3060
- case d.INTERVALLEFTOPEN:
3061
- case d.INTERVALRIGHTOPEN:
3062
- C = L.paren(C);
3063
- break;
3064
- default:
3065
- L.name !== "normalizeLiteral" && L.name !== "sort" && (C = t(d.VAR, [`INTERNAL ERROR Should not get here. Unhandled node operator ${C.op}`]));
3066
- break;
3067
- }
3068
- return C;
3069
- }
3070
- function N(T, C) {
3071
- if (!C)
3072
- return "";
3073
- const L = d.option(T, "words");
3074
- let B;
3075
- return L && (B = L[C.toLowerCase()]), B || (B = C, B.charAt(0) === "\\" && (B = B.substring(1))), B;
3076
- }
3077
- function w(T) {
3078
- let C = [];
3079
- switch (T.op) {
3080
- case d.VAR:
3081
- C.push({
3082
- code: T.args[0]
3083
- });
3084
- break;
3085
- case d.MUL:
3086
- {
3087
- let L = "", B;
3088
- T.args.forEach((k) => {
3089
- k.op === d.VAR ? L += k.args[0] : k.op === d.NUM && (B = +k.args[0]);
3090
- }), C.push({
3091
- code: L,
3092
- length: B
3093
- });
3094
- }
3095
- break;
3096
- case d.COMMA:
3097
- T.args.forEach((L) => {
3098
- C = C.concat(w(L));
3099
- });
3100
- break;
3101
- }
3102
- return C;
3103
- }
3104
- function U(T) {
3105
- const [C, L] = T.split("[");
3106
- return {
3107
- name: C,
3108
- arg: L && L.substring(0, L.indexOf("]")) || void 0
3109
- };
3110
- }
3111
- function Q(T, C) {
3112
- return w(T).some((B) => {
3113
- const k = B.code, j = B.length;
3114
- switch (k) {
3115
- case "integer":
3116
- if (C.numberFormat === "integer" && (j === void 0 || j === C.args[0].length))
3117
- return !0;
3118
- break;
3119
- case "decimal":
3120
- if (C.numberFormat === "decimal" && C.isRepeating)
3121
- return j === void 0;
3122
- if (C.numberFormat === "decimal" && (j === void 0 || j === 0 && C.args[0].indexOf(".") === -1 || j === C.args[0].substring(C.args[0].indexOf(".") + 1).length))
3123
- return !0;
3124
- break;
3125
- case "repeatingDecimal":
3126
- return C.numberFormat === "decimal" && C.isRepeating ? (Ne(!j, "The repeatingDecimal pattern does not take a length"), !0) : !1;
3127
- case "number":
3128
- if (C.numberFormat === "decimal" && C.isRepeating)
3129
- return j === void 0;
3130
- if (C.numberFormat === "integer" || C.numberFormat === "decimal") {
3131
- const M = C.args[0].indexOf(".");
3132
- if (j === void 0 || j === 0 && M === -1 || M >= 0 && j === C.args[0].substring(M + 1).length)
3133
- return !0;
3134
- }
3135
- break;
3136
- case "scientific":
3137
- if (C.isScientific) {
3138
- const M = C.args[0].args[0];
3139
- if (j === void 0 || j === 0 && M.indexOf(".") === -1 || j === M.substring(M.indexOf(".") + 1).length)
3140
- return !0;
3141
- }
3142
- break;
3143
- case "fraction":
3144
- if (C.isFraction || C.isMixedNumber)
3145
- return !0;
3146
- break;
3147
- case "simpleFraction":
3148
- case "nonMixedFraction":
3149
- if (C.isFraction)
3150
- return !0;
3151
- break;
3152
- case "mixedFraction":
3153
- case "mixedNumber":
3154
- if (C.isMixedNumber)
3155
- return !0;
3156
- break;
3157
- case "fractionOrDecimal":
3158
- if (C.isFraction || C.isMixedNumber || C.numberFormat === "decimal")
3159
- return !0;
3160
- break;
3161
- default:
3162
- Ne(!1, Ys(2015, [k]));
3163
- break;
3164
- }
3165
- return !1;
3166
- });
3167
- }
3168
- function ee(T, C) {
3169
- return w(T).some((B) => {
3170
- switch (B.code) {
3171
- case "simpleSmallRowMatrix":
3172
- case "smallRowMatrix":
3173
- return C.op === d.MATRIX && C.m === 1 && C.n < 4;
3174
- case "simpleSmallColumnMatrix":
3175
- case "smallColumnMatrix":
3176
- return C.op === d.MATRIX && C.m < 4 && C.n === 1;
3177
- case "simpleSmallMatrix":
3178
- case "smallMatrix":
3179
- return C.op === d.MATRIX && C.m < 4 && C.n < 4;
3180
- case "matrix":
3181
- return C.op === d.MATRIX;
3182
- case "row":
3183
- return C.op === d.ROW;
3184
- case "column":
3185
- return C.op === d.COL;
3186
- default:
3187
- return !1;
3188
- }
3189
- });
3190
- }
3191
- function G(T, C) {
3192
- const L = U(T), B = L.name, k = L.arg;
3193
- switch (B) {
3194
- case "polynomial":
3195
- if (k) {
3196
- if (k.indexOf(">") === 0) {
3197
- const M = parseInt(k.substring(1), 10);
3198
- return C.isPolynomial > M;
3199
- }
3200
- const j = parseInt(k, 10);
3201
- return C.isPolynomial > j;
3202
- }
3203
- return C.isPolynomial;
3204
- default:
3205
- return !1;
3206
- }
3207
- }
3208
- function Y(T) {
3209
- return T.op === d.NUM || T.op === d.VAR || typeof T == "string";
3210
- }
3211
- function ie(T) {
3212
- return Ne(T.op === d.MATRIX || T.op === d.ROW || T.op === d.COL), T.args.every((C) => C.op === d.MATRIX || C.op === d.ROW || C.op === d.COL ? ie(C) : Y(C));
3213
- }
3214
- function Ce(T, C, L) {
3215
- if (C.op === d.TYPE && C.args[0].op === d.VAR) {
3216
- let B = C.args[0].args[0];
3217
- switch (B = B.indexOf("[") > 0 && B.slice(0, B.indexOf("[")) || B, B) {
3218
- case "number":
3219
- case "integer":
3220
- case "decimal":
3221
- case "scientific":
3222
- case "fraction":
3223
- case "simpleFraction":
3224
- case "mixedFraction":
3225
- case "mixedNumber":
3226
- case "fractionOrDecimal":
3227
- case "repeatingDecimal":
3228
- return Q(C.args[0], L);
3229
- case "variable":
3230
- return L.op === d.VAR;
3231
- case "simpleSmallRowMatrix":
3232
- case "simpleSmallColumnMatrix":
3233
- case "simpleSmallMatrix":
3234
- return ee(C.args[0], L) && ie(L);
3235
- case "smallRowMatrix":
3236
- case "smallColumnMatrix":
3237
- case "smallMatrix":
3238
- case "matrix":
3239
- case "row":
3240
- case "column":
3241
- return ee(C.args[0], L);
3242
- case "polynomial":
3243
- return G(C.args[0].args[0], L);
3244
- default: {
3245
- const j = d.option(T, "types")[B];
3246
- if (j)
3247
- return Ne(j instanceof Array), j.some((M) => xe(T, [d.create(T, M)], L).length > 0);
3248
- }
3249
- }
3250
- return !1;
3251
- }
3252
- if (C.op === d.COLON && C.args[0].op === d.VAR && C.args[0].args[0] === "?") {
3253
- switch (Ne(C.args[1].op === d.VAR), C.args[1].args[0]) {
3254
- case "N":
3255
- return L.op === d.NUM;
3256
- case "V":
3257
- return L.op === d.VAR;
3258
- }
3259
- return !1;
3260
- }
3261
- return C.op === d.VAR && C.args[0] === "?" || C.op === d.MATRIX && L.op === d.MATRIX;
3262
- }
3263
- function xe(T, C, L) {
3264
- return C.size === 0 || L === void 0 ? !1 : C.filter((k) => {
3265
- if (k.op === void 0 || L.op === void 0)
3266
- return !1;
3267
- if (h.intern(k) === h.intern(L) || Ce(T, k, L))
3268
- return !0;
3269
- if (k.op === L.op) {
3270
- if (k.args.length === L.args.length)
3271
- return k.args.every((j, M) => k.op === d.VAR ? j.toLowerCase() === L.args[M].toLowerCase() : xe(T, [j], L.args[M]).length === 1);
3272
- if (k.args.length < L.args.length) {
3273
- const j = L.args.slice(1);
3274
- if (k.args.length === 2)
3275
- return xe(T, [k.args[0]], L.args[0]).length > 0 && xe(T, [k.args[1]], t(L.op, j)).length > 0;
3276
- }
3277
- }
3278
- return !1;
3279
- });
3280
- }
3281
- function ve(T, C, L) {
3282
- const B = T;
3283
- return C.forEach((k, j) => {
3284
- T = T.replace(new RegExp(`%${j + 1}`, "g"), k.args[0]);
3285
- }), C.length > 2 ? ve(B, [t(d.VAR, [T])].concat(C.slice(2))) : T;
3286
- }
3287
- function de(T, C, L, B) {
3288
- L = L || {}, B = B || {};
3289
- let k = T.template;
3290
- if (C.length === 0 && C.push(t(d.VAR, [""])), k && k.indexOf("%OP") >= 0 && L.op && (k = k.replace(new RegExp("%OP", "g"), L.op)), k && C) {
3291
- k.indexOf("%%") >= 0 && (k = k.replace(new RegExp("%%", "g"), C[0].args[0]));
3292
- const j = k.indexOf("{"), M = (j > 0 && k.slice(0, j) || k).trim();
3293
- if (B[M]) {
3294
- const Z = B[M].fn, q = n(k, B), le = Z({ config: q, env: L }), he = [];
3295
- C.forEach((z) => {
3296
- he.push(z.args[0]);
3297
- }), k = le(he);
3298
- }
3299
- if (k.indexOf("%*") >= 0) {
3300
- let Z = "";
3301
- C.forEach((q, le) => {
3302
- Z !== "" && (Z += " "), le === C.length - 1 && (k = k.slice(0, 2 * k.indexOf("%*") + 2)), Z += k.replace("%*", q.args[0]).replace("%M", q.m).replace("%N", q.n);
3303
- }), k = Z;
3304
- }
3305
- return k.indexOf("%IP") >= 0 && (k = k.replace(new RegExp("%IP", "g"), L.ip)), k.indexOf("%FP0") >= 0 && (k = k.replace(new RegExp("%FP0", "g"), L.fp)), k.indexOf("%FP") >= 0 && (k = k.replace(new RegExp("%FP", "g"), L.fp.split("").join(" "))), k.indexOf("%M") >= 0 && (Ne(L.m), k = k.replace(new RegExp("%M", "g"), L.m)), k.indexOf("%N") >= 0 && (Ne(L.n), k = k.replace(new RegExp("%N", "g"), L.n)), T.isBinary && C.length > 2 ? k = ve(k, C) : C.forEach((Z, q) => {
3306
- k = k.replace(new RegExp(`%${q + 1}`, "g"), Z ? Z.args[0] : "");
3307
- }), {
3308
- op: d.VAR,
3309
- args: [k]
3310
- };
3311
- }
3312
- return C[0];
3313
- }
3314
- function Be(T, C, L) {
3315
- let B = [];
3316
- return L.forEach((k) => {
3317
- B = B.concat(C[JSON.stringify(k)]);
3318
- }), B.length === 0 && B.push({ template: "" }), B[0];
3319
- }
3320
- function Ae(T, C) {
3321
- return Ne(typeof C.template == "string"), C.template.indexOf("%%") >= 0 ? [T] : T.args;
3322
- }
3323
- function rt(T) {
3324
- if (T.args.length <= 2)
3325
- return T;
3326
- const C = T.args.pop();
3327
- return r(T.op, [
3328
- rt(T),
3329
- C
3330
- ]);
3331
- }
3332
- function ct(T) {
3333
- if (T.args.length <= 2)
3334
- return T;
3335
- const C = T.args.shift();
3336
- return r(T.op, [
3337
- C,
3338
- ct(T)
3339
- ]);
3340
- }
3341
- function _e(T, C, L) {
3342
- L instanceof Array && (L.length === 1 ? L = L[0] : L = i(T, L[1], L[0]));
3343
- const B = L, k = Object.keys(L), j = [];
3344
- return k.forEach((M) => {
3345
- j.push(JSON.parse(M));
3346
- }), !C || !C.args ? (Ne(!1, "Should not get here. Illformed node."), 0) : x(T, C, {
3347
- name: "translate",
3348
- numeric(M) {
3349
- const Z = [{
3350
- op: d.VAR,
3351
- args: [N(T, M.args[0])]
3352
- }], q = T.env || {};
3353
- if (M.numberFormat === "decimal") {
3354
- const z = M.args[0].split(".");
3355
- q.ip = z[0], q.fp = z[1] || "0";
3356
- }
3357
- const le = xe(T, j, M);
3358
- if (le.length === 0)
3359
- return M;
3360
- const he = Be(T, L, le);
3361
- return de(he, Z, q, T.expanderBuilders);
3362
- },
3363
- binary(M) {
3364
- M.op === d.SUBSCRIPT ? M = ct(M) : M = rt(M);
3365
- const Z = xe(T, j, M);
3366
- if (Z.length === 0)
3367
- return M;
3368
- const q = Be(T, L, Z, M.args.length), le = o(q), he = Ae(M, q);
3369
- let z = [];
3370
- return he.forEach((fe, we) => {
3371
- const Ue = d.option(T, "RHS", we > 0);
3372
- z = z.concat(_e(T, fe, [B, le])), d.option(T, "RHS", Ue);
3373
- }), q.isBinary = !0, de(q, z, { ...T.env, op: M.op }, T.expanderBuilders);
3374
- },
3375
- multiplicative(M) {
3376
- M = rt(M);
3377
- const Z = xe(T, j, M);
3378
- if (Z.length === 0)
3379
- return M;
3380
- const q = Be(T, L, Z, M.args.length), le = o(q), he = Ae(M, q);
3381
- let z = [];
3382
- return he.forEach((fe, we) => {
3383
- const Ue = d.option(T, "RHS", we > 0);
3384
- z = z.concat(_e(T, fe, [B, le])), d.option(T, "RHS", Ue);
3385
- }), q.isBinary = !0, de(q, z, { ...T.env, op: M.op }, T.expanderBuilders);
3386
- },
3387
- unary(M) {
3388
- const Z = xe(T, j, M);
3389
- if (Z.length === 0)
3390
- return M;
3391
- const q = Be(T, L, Z, M.args.length), le = o(q), he = Ae(M, q);
3392
- let z = [];
3393
- return he.forEach((fe) => {
3394
- z = z.concat(_e(T, fe, [B, le]));
3395
- }), de(q, z, { ...T.env, op: M.op }, T.expanderBuilders);
3396
- },
3397
- exponential(M) {
3398
- const Z = xe(T, j, M);
3399
- if (Z.length === 0)
3400
- return M;
3401
- const q = Be(T, L, Z, M.args.length), le = o(q), he = Ae(M, q);
3402
- let z = [];
3403
- return he.forEach((fe) => {
3404
- z = z.concat(_e(T, fe, [B, le]));
3405
- }), de(q, z, T.env, T.expanderBuilders);
3406
- },
3407
- variable(M) {
3408
- const Z = xe(T, j, M);
3409
- if (Z.length === 0)
3410
- return M;
3411
- const q = Be(T, L, Z, M.args.length), le = o(q), he = Ae(M, q);
3412
- let z = [];
3413
- return z.push(t(d.VAR, [N(T, he.shift())])), he.forEach((fe) => {
3414
- z = z.concat(_e(T, fe, [B, le]));
3415
- }), de(q, z, T.env, T.expanderBuilders);
3416
- },
3417
- comma(M) {
3418
- const Z = T.env || {};
3419
- if (M.op === d.MATRIX || M.op === d.ROW || M.op === d.COL) {
3420
- M.op === d.MATRIX ? (Ne(M.args[0].op === d.ROW), Ne(M.args[0].args[0].op === d.COL), M.m = Z.m = M.args[0].args.length, M.n = Z.n = M.args[0].args[0].args.length, M.args.forEach(($e, Xe) => {
3421
- $e.m = Xe + 1;
3422
- })) : M.op === d.ROW ? M.args.forEach(($e, Xe) => {
3423
- $e.m = Xe + 1, $e.n = void 0;
3424
- }) : M.args.forEach(($e, Xe) => {
3425
- $e.m = M.m, $e.n = Xe + 1;
3426
- });
3427
- const we = xe(T, j, M);
3428
- if (we.length === 0)
3429
- return M;
3430
- const Ue = Be(T, L, we, M.args.length);
3431
- let Je = [];
3432
- const Pt = o(Ue);
3433
- return Ae(M, Ue).forEach(($e, Xe) => {
3434
- Je = Je.concat(_e(T, $e, [B, Pt])), Je[Xe].m = $e.m, Je[Xe].n = $e.n;
3435
- }), de(Ue, Je, Z, T.expanderBuilders);
3436
- }
3437
- const q = xe(T, j, M);
3438
- if (q.length === 0)
3439
- return M;
3440
- const le = Be(T, L, q, M.args.length), he = o(le), z = Ae(M, le);
3441
- let fe = [];
3442
- return z.forEach((we) => {
3443
- fe = fe.concat(_e(T, we, [B, he]));
3444
- }), le.isBinary = !0, de(le, fe, Z, T.expanderBuilders);
3445
- },
3446
- equals(M) {
3447
- const Z = xe(T, j, M);
3448
- if (Z.length === 0)
3449
- return M;
3450
- const q = Be(T, L, Z, M.args.length), le = o(q), he = Ae(M, q);
3451
- let z = [];
3452
- return he.forEach((fe) => {
3453
- z = z.concat(_e(T, fe, [B, le]));
3454
- }), q.isBinary = !0, de(q, z, T.env, T.expanderBuilders);
3455
- },
3456
- paren(M) {
3457
- const Z = xe(T, j, M);
3458
- if (Z.length === 0)
3459
- return M;
3460
- const q = Be(T, L, Z), le = o(q), he = Ae(M, q), z = [];
3461
- return he.forEach((fe) => {
3462
- z.push(_e(T, fe, [B, le]));
3463
- }), de(q, z, T.env, T.expanderBuilders);
3464
- }
3465
- });
3466
- }
3467
- this.translate = _e;
3468
- }
3469
- function o(h) {
3470
- return h.rules;
3471
- }
3472
- function i(h, x, N) {
3473
- const w = {};
3474
- if (x) {
3475
- if (x instanceof Array) {
3476
- let G = {};
3477
- x.some((Y) => Y.context ? (Y.context && Y.context.split(" ") || []).some((Ce) => h[Ce] ? (G = Y.value, !0) : !1) : (G = Y, !0)), x = G;
3478
- }
3479
- Object.keys(x).forEach((G) => {
3480
- w[G] = x[G];
3481
- });
3482
- }
3483
- const U = Object.keys(N);
3484
- let Q;
3485
- return U.forEach((ee) => {
3486
- Number.isNaN(parseInt(ee, 10)) ? Q = N : (Q = N[ee], ee = Object.keys(Q)[0]), w[ee] || (w[ee] = Q[ee]);
3487
- }), w;
3488
- }
3489
- function l(h) {
3490
- let x;
3491
- const N = h.indexOf("\\context");
3492
- if (N >= 0) {
3493
- h = h.slice(N + 8);
3494
- const w = h.indexOf("}");
3495
- x = h.slice(1, w), h = h.slice(w + 1);
3496
- }
3497
- return {
3498
- context: x,
3499
- template: h
3500
- };
3501
- }
3502
- function p(h, x) {
3503
- let N;
3504
- if (x instanceof Array)
3505
- Ne(x.length === 1), N = p(h, x[0]);
3506
- else if (typeof x == "string")
3507
- N = l(x);
3508
- else {
3509
- let w = "";
3510
- const U = Object.keys(x);
3511
- Ne(U.length === 1);
3512
- const Q = U[0], ee = x[Q];
3513
- let G;
3514
- ee instanceof Array ? (G = [], ee.forEach((Y) => {
3515
- Y.options ? (w += Y.options.RHS ? " RHS" : "", w += Y.options.EndRoot ? " EndRoot" : "", w += Y.options.NoParens ? " NoParens" : "", G.push({
3516
- context: w,
3517
- value: f(h, Y.value)
3518
- })) : G.push(f(h, Y));
3519
- })) : G = f(h, ee), N = {
3520
- template: Q,
3521
- rules: G
3522
- };
3523
- }
3524
- return N;
3525
- }
3526
- function f(h, x) {
3527
- const N = {};
3528
- return Object.keys(x).forEach((U) => {
3529
- const Q = JSON.stringify(d.create(h, U)), ee = p(h, x[U]);
3530
- N[Q] ? N[Q].push(ee) : N[Q] = [ee];
3531
- }), N;
3532
- }
3533
- function g(h, x, N) {
3534
- const w = new a(e), U = f(h, N);
3535
- return w.translate(h, x, U);
3536
- }
3537
- function m(h) {
3538
- let x = 0, N = "";
3539
- for (; x < h.length; x++)
3540
- switch (h.charAt(x)) {
3541
- case " ":
3542
- case " ":
3543
- case `
3544
- `:
3545
- if (N.length === 0 || N.charAt(N.length - 1) === " ")
3546
- continue;
3547
- N += " ";
3548
- break;
3549
- default:
3550
- N += h.charAt(x);
3551
- break;
3552
- }
3553
- for (; N.charAt(N.length - 1) === " "; )
3554
- N = N.substring(0, N.length - 1);
3555
- for (; N.lastIndexOf("baseline") !== -1 && N.lastIndexOf(" baseline") === N.length - 9; )
3556
- N = N.substring(0, N.length - 9);
3557
- return N;
3558
- }
3559
- d.fn.translate = function(h, x) {
3560
- const N = d.option(x, "rules");
3561
- let w = g(x, h, N);
3562
- return (!w || w.op !== d.VAR) && (w = t(d.VAR, [""])), m(w.args[0]);
3563
- }, d.option = function(x, N, w) {
3564
- Ne(x);
3565
- let U = x && x[N];
3566
- if (w !== void 0 && (d.options = x = x || {}, x[N] = w), U === void 0)
3567
- switch (N) {
3568
- case "field":
3569
- U = "integer";
3570
- break;
3571
- case "decimalPlaces":
3572
- U = 10;
3573
- break;
3574
- case "toleranceAbsolute":
3575
- case "tolerancePercent":
3576
- case "toleranceRange":
3577
- case "setThousandsSeparator":
3578
- case "setDecimalSeparator":
3579
- case "dontExpandPowers":
3580
- case "dontFactorDenominators":
3581
- case "dontFactorTerms":
3582
- case "dontConvertDecimalToFraction":
3583
- case "strict":
3584
- case "antiderivative":
3585
- U = void 0;
3586
- break;
3587
- case "types":
3588
- U = {};
3589
- break;
3590
- default:
3591
- U = !1;
3592
- break;
3593
- }
3594
- return U;
3595
- };
3596
- })(new ka());
3597
- const ei = function() {
3598
- Ee.reserveCodeRange(4e3, 4999, "core");
3599
- const e = Ee.messages, t = Ee.message, r = Ee.assert;
3600
- e[4001] = "No Math Core spec provided.", e[4002] = "No Math Core solution provided.", e[4003] = "No Math Core spec value provided.", e[4004] = "Invalid Math Core spec method '%1'.", e[4005] = "Operation taking too long.", e[4006] = "Invalid option name '%1'.", e[4007] = "Invalid option value '%2' for option '%1'.", e[4008] = "Internal error: %1";
3601
- const n = 10 ** -6, a = {
3602
- ROUND: {},
3603
- SUM: {},
3604
- MUL: {},
3605
- IF: {},
3606
- matrix: {},
3607
- pmatrix: {},
3608
- bmatrix: {},
3609
- Bmatrix: {},
3610
- vmatrix: {},
3611
- Vmatrix: {},
3612
- array: {},
3613
- "\\alpha": { type: "var" },
3614
- "\\beta": { type: "var" },
3615
- "\\gamma": { type: "var" },
3616
- "\\delta": { type: "var" },
3617
- "\\epsilon": { type: "var" },
3618
- "\\zeta": { type: "var" },
3619
- "\\eta": { type: "var" },
3620
- "\\theta": { type: "var" },
3621
- "\\iota": { type: "var" },
3622
- "\\kappa": { type: "var" },
3623
- "\\lambda": { type: "var" },
3624
- "\\mu": { type: "const", value: n },
3625
- "\\nu": { type: "var" },
3626
- "\\xi": { type: "var" },
3627
- "\\pi": { type: "const", value: Math.PI },
3628
- "\\rho": { type: "var" },
3629
- "\\sigma": { type: "var" },
3630
- "\\tau": { type: "var" },
3631
- "\\upsilon": { type: "var" },
3632
- "\\phi": { type: "var" },
3633
- "\\chi": { type: "var" },
3634
- "\\psi": { type: "var" },
3635
- "\\omega": { type: "var" },
3636
- "\\sin": { type: "var" },
3637
- "\\cos": { type: "var" },
3638
- "\\tan": { type: "var" },
3639
- "\\sec": { type: "var" },
3640
- "\\csc": { type: "var" },
3641
- "\\cot": { type: "var" },
3642
- "\\arcsin": { type: "var" },
3643
- "\\arccos": { type: "var" },
3644
- "\\arctan": { type: "var" },
3645
- "\\arcsec": { type: "var" },
3646
- "\\arccsc": { type: "var" },
3647
- "\\arccot": { type: "var" },
3648
- "\\sinh": { type: "var" },
3649
- "\\cosh": { type: "var" },
3650
- "\\tanh": { type: "var" },
3651
- "\\sech": { type: "var" },
3652
- "\\csch": { type: "var" },
3653
- "\\coth": { type: "var" },
3654
- "\\log": { type: "var" },
3655
- "\\ln": { type: "var" },
3656
- "\\lg": { type: "var" }
3657
- };
3658
- function o(g, m) {
3659
- switch (g) {
3660
- case "field":
3661
- switch (m) {
3662
- case void 0:
3663
- case "integer":
3664
- case "real":
3665
- case "complex":
3666
- break;
3667
- default:
3668
- r(!1, t(4007, [g, m]));
3669
- break;
3670
- }
3671
- break;
3672
- case "decimalPlaces":
3673
- if (m === void 0 || +m >= 0 && +m <= 20)
3674
- break;
3675
- r(!1, t(4007, [g, m]));
3676
- break;
3677
- case "toleranceAbsolute":
3678
- if (m === void 0 || +m >= 0 || typeof m == "string")
3679
- break;
3680
- r(!1, t(4007, [g, m]));
3681
- break;
3682
- case "tolerancePercent":
3683
- if (m === void 0 || +m >= 0)
3684
- break;
3685
- r(!1, t(4007, [g, m]));
3686
- break;
3687
- case "toleranceRange":
3688
- if (m === void 0 || m instanceof Array && m.length === 2)
3689
- break;
3690
- r(!1, t(4007, [g, m]));
3691
- break;
3692
- case "antiderivative":
3693
- if (typeof m > "u" || typeof m == "string")
3694
- break;
3695
- r(!1, t(4007, [g, m]));
3696
- break;
3697
- case "RHS":
3698
- case "NoParens":
3699
- case "EndRoot":
3700
- case "allowDecimal":
3701
- case "allowInterval":
3702
- case "dontExpandPowers":
3703
- case "dontFactorDenominators":
3704
- case "dontFactorTerms":
3705
- case "dontConvertDecimalToFraction":
3706
- case "dontSimplifyImaginary":
3707
- case "ignoreOrder":
3708
- case "inverseResult":
3709
- case "requireThousandsSeparator":
3710
- case "ignoreText":
3711
- case "ignoreTrailingZeros":
3712
- case "allowThousandsSeparator":
3713
- case "compareSides":
3714
- case "ignoreCoefficientOne":
3715
- case "strict":
3716
- case "integrationConstant":
3717
- case "absoluteValue":
3718
- case "parsingIntegralExpr":
3719
- case "keepTextWhitespace":
3720
- if (typeof m > "u" || typeof m == "boolean")
3721
- break;
3722
- r(!1, t(4007, [g, m]));
3723
- break;
3724
- case "setThousandsSeparator":
3725
- if (typeof m > "u" || typeof m == "string" && m.length === 1 || m instanceof Array)
3726
- break;
3727
- r(!1, t(4007, [g, m]));
3728
- break;
3729
- case "setDecimalSeparator":
3730
- if (typeof m > "u" || typeof m == "string" && m.length === 1 || m instanceof Array && m.length > 0 && m[0].length === 1)
3731
- break;
3732
- r(!1, t(4007, [g, JSON.stringify(m)]));
3733
- break;
3734
- case "words":
3735
- case "rules":
3736
- case "types":
3737
- case "data":
3738
- case "env":
3739
- case "expanderBuilders":
3740
- if (typeof m > "u" || typeof m == "object")
3741
- break;
3742
- r(!1, t(4007, [g, m]));
3743
- break;
3744
- default:
3745
- r(!1, t(4006, [g]));
3746
- break;
3747
- }
3748
- }
3749
- function i(g) {
3750
- g && Object.keys(g).forEach((m) => {
3751
- o(m, g[m]);
3752
- });
3753
- }
3754
- function l(g, m, h) {
3755
- g || (g = {}), g.rules || (g.words = Vt.words, g.rules = Vt.rules, g.types = Vt.types);
3756
- const x = {
3757
- method: "translate",
3758
- options: g
3759
- };
3760
- g.allowInterval = !0, f(x, h).evaluate(m, (w, U) => {
3761
- h(w, U);
3762
- });
3763
- }
3764
- function p(g, m) {
3765
- return g || (g = {}), g.rules || (g.words = Vt.words, g.rules = Vt.rules, g.types = Vt.types), g.expanderBuilders = m || {}, g.allowInterval = !0, function(x, N) {
3766
- f({
3767
- method: "translate",
3768
- options: g
3769
- }, N).evaluate(x, (Q, ee) => {
3770
- N(Q, ee);
3771
- });
3772
- };
3773
- }
3774
- function f(g, m) {
3775
- let h;
3776
- const x = g.method, N = g.value, w = d.options = g.options, U = w.words ? Object.fromEntries(
3777
- Object.keys(w.words).flatMap((ie) => [
3778
- [ie.toLowerCase(), { type: "var" }],
3779
- [ie.toUpperCase(), { type: "var" }]
3780
- ])
3781
- ) : {};
3782
- let Q;
3783
- try {
3784
- Ee.setLocation("spec"), i(w), d.pushEnv({
3785
- ...a,
3786
- ...U,
3787
- ...w.env
3788
- }), h = N !== void 0 ? d.create(w, N, "spec") : void 0, d.popEnv();
3789
- } catch (ie) {
3790
- Q = ie, m([{
3791
- result: null,
3792
- errorCode: G(ie.message),
3793
- message: Y(ie.message),
3794
- stack: ie.stack,
3795
- location: ie.location,
3796
- model: null,
3797
- // Unused, for now.
3798
- toString() {
3799
- return `${this.errorCode}: (${this.location}) ${this.message}
3800
- ${this.stack}`;
3801
- }
3802
- }], "");
3803
- }
3804
- return {
3805
- evaluate: function(Ce, xe) {
3806
- try {
3807
- if (Q)
3808
- throw Q;
3809
- Ee.setLocation("user"), r(Ce !== void 0, t(4002)), d.pushEnv({
3810
- ...a,
3811
- ...U,
3812
- ...w.env
3813
- });
3814
- const ve = d.create(w, Ce, "user");
3815
- r(ve, t(4008, ["invalid input"])), Ee.setLocation("spec");
3816
- let de;
3817
- switch (x) {
3818
- case "translate":
3819
- de = ve.translate(w);
3820
- break;
3821
- default:
3822
- r(!1, t(4004, [x]));
3823
- break;
3824
- }
3825
- d.popEnv(), xe([], de);
3826
- } catch (ve) {
3827
- console.log(`ERROR evaluate() ${ve.stack}`);
3828
- const de = ve.message;
3829
- xe([{
3830
- result: null,
3831
- errorCode: G(de),
3832
- message: Y(de),
3833
- stack: ve.stack,
3834
- location: ve.location,
3835
- toString() {
3836
- return `${this.errorCode}: (${this.location}) ${this.message}
3837
- ${this.stack}`;
3838
- }
3839
- }], "");
3840
- }
3841
- },
3842
- model: h
3843
- };
3844
- function G(ie) {
3845
- ie = typeof ie == "string" && ie || "";
3846
- const Ce = +ie.slice(0, ie.indexOf(":"));
3847
- return Number.isNaN(Ce) ? 0 : Ce;
3848
- }
3849
- function Y(ie) {
3850
- return G(ie) ? ie.slice(ie.indexOf(":") + 2) : ie;
3851
- }
3852
- }
3853
- return {
3854
- translate: l,
3855
- buildTranslator: p
3856
- };
3857
- }();
3858
- typeof window < "u" && (window.Core = ei);
3859
- const Ha = (e, t) => Array.from({ length: t.charCodeAt(0) - e.charCodeAt(0) + 1 }, (r, n) => String.fromCharCode(e.charCodeAt(0) + n)), Ka = (e, t) => {
3860
- const r = +e, n = +t;
3861
- return Array.from({ length: n - r + 1 }, (a, o) => String(r + o));
3862
- }, yt = (e) => {
3863
- try {
3864
- return new ue(e) !== null;
3865
- } catch {
3866
- return !1;
3867
- }
3868
- }, os = (e) => [e.slice(0, 1), e.slice(1)], Ga = (e) => e.toUpperCase() >= "A" && e.toUpperCase() <= "Z", qa = (e) => /^-?\d+$/.test(e), Wa = (e) => os(e).reduce((t, r, n) => n === 0 && Ga(r) || qa(r), !1), Xa = () => (e = {}, t, r) => {
3869
- if (r === 0)
3870
- return {
3871
- start: os(t)
3872
- };
3873
- const n = e.start, a = os(t), o = Ha(n[0], a[0]), i = Ka(n[1], a[1]);
3874
- return o.flatMap((p) => i.map((f) => p.toUpperCase() + f)).filter((p) => p !== void 0).join(",");
3875
- }, Qa = (e) => e, ja = () => (e = [], t) => [
3876
- ...e,
3877
- t.toUpperCase()
3878
- ], Za = (e) => {
3879
- const t = {
3880
- currency: "",
3881
- thousandsSeparator: ",",
3882
- decimalSeparator: ".",
3883
- decimalPlaces: 0,
3884
- prefix: "",
3885
- suffix: "",
3886
- showThousands: !1,
3887
- accountingStyle: !1
3888
- };
3889
- e.startsWith("(") && e.endsWith(")") && (t.accountingStyle = !0, e = e.slice(1, -1));
3890
- const r = ["$", "€", "¥", "£", "₹", "₽", "¢"];
3891
- let n = e;
3892
- r.some((o) => n.startsWith(o) ? (t.currency = o, t.prefix = o, n = n.slice(1), !0) : !1), t.currency || r.some((o) => n.includes(`_${o}`) ? (t.currency = o, t.suffix = o, n = n.replace(`_${o}`, ""), !0) : !1), (n.includes("#,##0") || n.includes("#.##0") || n.includes("# ##0")) && (t.showThousands = !0, n.includes("#,##0.") ? (t.thousandsSeparator = ",", t.decimalSeparator = ".") : n.includes("#.##0,") ? (t.thousandsSeparator = ".", t.decimalSeparator = ",") : n.includes("# ##0,") ? (t.thousandsSeparator = " ", t.decimalSeparator = ",") : n.includes("# ##0.") || n.includes("# ##0") ? (t.thousandsSeparator = " ", t.decimalSeparator = ".") : n.includes("#.##0") && (t.thousandsSeparator = ".", t.decimalSeparator = ","));
3893
- const a = n.match(/[.,]0+$/);
3894
- return a && (t.decimalPlaces = a[0].length - 1), t;
3895
- }, ti = (e, t) => {
3896
- const r = Number(e);
3897
- if (Number.isNaN(r))
3898
- return e;
3899
- const {
3900
- thousandsSeparator: n,
3901
- decimalSeparator: a,
3902
- decimalPlaces: o,
3903
- prefix: i,
3904
- suffix: l,
3905
- showThousands: p,
3906
- accountingStyle: f
3907
- } = t, g = r < 0;
3908
- let h = Math.abs(r).toFixed(o);
3909
- if (a !== "." && (h = h.replace(".", a)), p) {
3910
- const x = h.split(a), N = x[0], w = x[1] || "", U = N.replace(/\B(?=(\d{3})+(?!\d))/g, n);
3911
- h = w ? `${U}${a}${w}` : U;
3912
- }
3913
- return h = `${i}${h}${l}`, f && g ? `(${h})` : g ? `-${h}` : h;
3914
- }, za = (e, t = 2) => ti(e, {
3915
- thousandsSeparator: ",",
3916
- decimalSeparator: ".",
3917
- decimalPlaces: t,
3918
- prefix: "$",
3919
- suffix: "",
3920
- showThousands: !0
3921
- }), Ja = (e) => {
3922
- const t = ["m/", "d/", "y", "mmm", "mmmm", "ddd", "dddd"], r = e.toLowerCase();
3923
- return t.some((n) => r.includes(n));
3924
- }, Ya = (e) => {
3925
- if (e instanceof Date)
3926
- return Number.isNaN(e.getTime()) ? null : e;
3927
- const t = Number(e);
3928
- if (!Number.isNaN(t)) {
3929
- if (t >= 0 && t < 2957004) {
3930
- const n = Math.floor(t), a = new Date(Date.UTC(1904, 0, 1));
3931
- return new Date(a.getTime() + n * 24 * 60 * 60 * 1e3);
3932
- }
3933
- if (t > 2957004)
3934
- return new Date(t);
3935
- }
3936
- const r = new Date(e);
3937
- return Number.isNaN(r.getTime()) ? null : r;
3938
- }, eo = (e, t) => {
3939
- if (!e || !(e instanceof Date) || Number.isNaN(e.getTime()))
3940
- return String(e || "");
3941
- const r = (p, f = 2) => String(p).padStart(f, "0"), n = ["Jan", "Feb", "Mar", "Apr", "May", "Jun", "Jul", "Aug", "Sep", "Oct", "Nov", "Dec"], a = ["January", "February", "March", "April", "May", "June", "July", "August", "September", "October", "November", "December"], o = {
3942
- yyyy: String(e.getFullYear()),
3943
- yy: r(e.getFullYear() % 100),
3944
- mmmm: a[e.getMonth()],
3945
- mmm: n[e.getMonth()],
3946
- mm: r(e.getMonth() + 1),
3947
- m: String(e.getMonth() + 1),
3948
- dd: r(e.getDate()),
3949
- d: String(e.getDate())
3950
- };
3951
- let i = "", l = 0;
3952
- for (; l < t.length; ) {
3953
- let p = !1;
3954
- Object.keys(o).sort((g, m) => m.length - g.length).some((g) => t.substring(l, l + g.length).toLowerCase() === g ? (i += o[g], l += g.length, p = !0, !0) : !1), p || (i += t[l], l++);
3955
- }
3956
- return i;
3957
- }, to = ({ env: e, args: t }) => {
3958
- const r = t[1] || e.format || "";
3959
- let n;
3960
- if (r.toLowerCase() === "currency")
3961
- n = za(t[0]);
3962
- else if (r.includes("#") || r.includes("0")) {
3963
- const a = Za(r);
3964
- n = ti(t[0], a);
3965
- } else if (Ja(r)) {
3966
- const a = Ya(t[0]);
3967
- n = a ? eo(a, r) : t[0];
3968
- } else
3969
- n = t[0];
3970
- return n;
3971
- }, Et = ({ env: e, str: t }) => {
3972
- var r;
3973
- return Wa(t) && ((r = e[t.toUpperCase()]) == null ? void 0 : r.val) || t;
3974
- }, ro = (e) => {
3975
- if (e == null || e === "")
3976
- return !1;
3977
- if (typeof e == "string") {
3978
- const t = e.trim();
3979
- if (t === "" || t === "0" || t.toUpperCase() === "FALSE")
3980
- return !1;
3981
- }
3982
- return typeof e == "number" || e instanceof ue ? +e != 0 : !0;
3983
- }, Rt = {
3984
- round: (e) => (t = "", r, n) => {
3985
- const a = Et({ env: e, str: r });
3986
- if (yt(a)) {
3987
- if (n === 0)
3988
- return new ue(a);
3989
- if (n === 1)
3990
- return new ue(t).toDecimalPlaces(+a, ue.ROUND_HALF_UP);
3991
- }
3992
- return t;
3993
- },
3994
- sum: (e) => (t = 0, r) => {
3995
- const n = Et({ env: e, str: r });
3996
- return yt(n) ? new ue(t).plus(new ue(n)) : t;
3997
- },
3998
- minus: (e) => (t = "", r, n) => {
3999
- const a = Et({ env: e, str: r });
4000
- return yt(a) ? n === 0 ? new ue(a) : new ue(t).minus(new ue(a)) : t;
4001
- },
4002
- multiply: (e) => (t = 1, r) => {
4003
- const n = Et({ env: e, str: r });
4004
- return yt(n) ? new ue(t).times(new ue(n)) : t;
4005
- },
4006
- mul: (e) => (t = 1, r) => {
4007
- const n = Et({ env: e, str: r });
4008
- return yt(n) ? new ue(t).times(new ue(n)) : t;
4009
- },
4010
- divide: (e) => (t = "", r, n) => {
4011
- const a = Et({ env: e, str: r });
4012
- return yt(a) ? n === 0 ? new ue(a) : new ue(t).dividedBy(new ue(a)) : t;
4013
- },
4014
- normalize: ja,
4015
- range: Xa,
4016
- if: (e) => (t = null, r, n) => (r = Et({ env: e, str: r }), n === 0 ? { condition: ro(r), trueValue: null, falseValue: null } : n === 1 ? { ...t, trueValue: r } : n === 2 ? t.condition ? t.trueValue : r : t),
4017
- average: (e) => {
4018
- let t = new ue(0), r = 0;
4019
- return (n, a) => (a = Et({ env: e, str: a }), yt(a) && (t = t.plus(new ue(a)), r++), r > 0 ? t.dividedBy(r) : new ue(0));
4020
- }
4021
- }, ri = {
4022
- $cell: {
4023
- type: "fn",
4024
- fn: ({ env: e }) => (t) => {
4025
- var r;
4026
- return ((r = e[t[1].toUpperCase()]) == null ? void 0 : r.val) || "0";
4027
- }
4028
- },
4029
- $fmt: {
4030
- type: "fn",
4031
- fn: ({ config: e, env: t }) => (r) => {
4032
- var n, a, o;
4033
- if (e.rawConfig) {
4034
- const i = e.rawConfig.slice(1, -1);
4035
- if (i.includes("isNegative:true")) {
4036
- const l = ((n = t.format) == null ? void 0 : n.formatString) || t.format || "";
4037
- r = [`-${r[0]}`, l];
4038
- } else if (i.includes("isNegative:false")) {
4039
- const l = ((a = t.format) == null ? void 0 : a.formatString) || t.format || "";
4040
- r = [r[0], l];
4041
- } else {
4042
- const l = i.indexOf(",");
4043
- if (l >= 0) {
4044
- let p = i.slice(0, l);
4045
- const f = i.slice(l + 1);
4046
- p = p.replace("%1", r[0]), r = [p, f];
4047
- }
4048
- }
4049
- } else if (r.length === 1) {
4050
- const i = ((o = t.format) == null ? void 0 : o.formatString) || t.format || "";
4051
- r = [r[0], i];
4052
- }
4053
- return to({ env: t, args: r });
4054
- }
4055
- },
4056
- $range: {
4057
- type: "fn",
4058
- fn: () => (e) => e.reduce(Rt.range(), void 0)
4059
- },
4060
- $add: {
4061
- type: "fn",
4062
- fn: ({ env: e }) => (t) => `${t.reduce(Rt.sum(e), void 0)}`
4063
- },
4064
- $minus: {
4065
- type: "fn",
4066
- fn: ({ env: e }) => (t) => (t.length === 1 && t.unshift("0"), `${t.reduce(Rt.minus(e), void 0)}`)
4067
- },
4068
- $multiply: {
4069
- type: "fn",
4070
- fn: ({ env: e }) => (t) => `${t.reduce(Rt.multiply(e), void 0)}`
4071
- },
4072
- $percent: {
4073
- type: "fn",
4074
- fn: ({ env: e }) => (t) => (t.push("0.01"), `${t.reduce(Rt.multiply(e), void 0)}`)
4075
- },
4076
- $divide: {
4077
- type: "fn",
4078
- fn: ({ env: e }) => (t) => `${t.reduce(Rt.divide(e), void 0)}`
4079
- },
4080
- $fn: {
4081
- type: "fn",
4082
- fn: ({ env: e }) => (t) => `${t[1].split(",").reduce(Rt[t[0].toLowerCase()](e), void 0)}`
4083
- },
4084
- $normalize: {
4085
- type: "fn",
4086
- fn: ({ config: e, env: t }) => (r) => `${r.reduce(Qa(Rt.normalize(t)), e == null ? void 0 : e.acc)}`
4087
- }
4088
- }, ni = ei, no = {
4089
- words: {
4090
- average: "average",
4091
- if: "if",
4092
- mul: "mul",
4093
- round: "round",
4094
- sum: "sum"
4095
- },
4096
- types: {
4097
- args: [
4098
- "\\type{cellName}:\\type{cellName}",
4099
- "?,?"
4100
- ],
4101
- cellName: [
4102
- "\\type{variable}\\type{integer}"
4103
- ],
4104
- cellRange: [
4105
- "\\type{cellName}:\\type{cellName}"
4106
- ],
4107
- fn: [
4108
- "average",
4109
- "if",
4110
- "mul",
4111
- "round",
4112
- "sum"
4113
- ]
4114
- },
4115
- rules: {
4116
- "=\\type{cellName}": [
4117
- "$cell"
4118
- ],
4119
- "=?": [
4120
- {
4121
- "%2": {
4122
- "\\type{fn}(\\type{args})": "$fn",
4123
- "\\type{fn}(?,?)": "$fn",
4124
- "\\type{fn}(?)": "$fn",
4125
- "?+?": "$add",
4126
- "?-?": "$minus",
4127
- "?*?": "$multiply",
4128
- "?/?": "$divide",
4129
- "?%": "$percent",
4130
- "-?": "$minus"
4131
- }
4132
- }
4133
- ],
4134
- "-?": [
4135
- "-%1"
4136
- ],
4137
- "\\type{cellRange}": [
4138
- "$range"
4139
- ],
4140
- "\\type{args}": [
4141
- "%1,%2"
4142
- ],
4143
- "\\type{cellName}": [
4144
- "%1%2"
4145
- ],
4146
- "\\type{fn}(\\type{cellRange})": [
4147
- "%1(%2)"
4148
- ],
4149
- "??": [
4150
- "%1%2"
4151
- ],
4152
- "{{var:\\type{cellName}}}": [
4153
- "{{var:%2}}"
4154
- ],
4155
- "?": [
4156
- "%1"
4157
- ]
4158
- }
4159
- }, So = {
4160
- rules: {
4161
- "??": [
4162
- "%1%2"
4163
- ],
4164
- "-\\type{number}": [
4165
- {
4166
- "%1": {
4167
- "\\type{number}": "$fmt{isNegative:true}"
4168
- }
4169
- }
4170
- ],
4171
- "\\type{number}": [
4172
- "$fmt{isNegative:false}"
4173
- ],
4174
- "?": [
4175
- "%1"
4176
- ]
4177
- }
4178
- }, so = {
4179
- types: {
4180
- cellName: [
4181
- "\\type{variable}\\type{integer}"
4182
- ],
4183
- cellRange: [
4184
- "\\type{cellName}:\\type{cellName}"
4185
- ],
4186
- fn: [
4187
- "average",
4188
- "if",
4189
- "mul",
4190
- "round",
4191
- "sum"
4192
- ]
4193
- },
4194
- rules: {
4195
- "=\\type{cellName}": [
4196
- "$cell"
4197
- ],
4198
- "=?": [
4199
- {
4200
- "%2": {
4201
- "\\type{cellRange}": "%1:%2",
4202
- "\\type{fn}(\\type{cellRange})": "$normalize",
4203
- "?+?": '$normalize {"acc": ["SUM"]}',
4204
- "?-?": '$normalize {"acc": ["SUB"]}',
4205
- "?*?": '$normalize {"acc": ["MUL"]}',
4206
- "?/?": '$normalize {"acc": ["DIV"]}',
4207
- "?%": "$percent",
4208
- "-?": "$minus"
4209
- }
4210
- }
4211
- ],
4212
- "\\type{cellRange}": [
4213
- "$range"
4214
- ],
4215
- "\\type{cellName}": [
4216
- "%1%2"
4217
- ],
4218
- "\\type{fn}(\\type{cellRange})": [
4219
- "%1(%2)"
4220
- ],
4221
- "??": [
4222
- "%1%2"
4223
- ],
4224
- "?": [
4225
- "%1"
4226
- ]
4227
- }
4228
- }, io = (e) => ['"', "'", "`"].includes(e), si = (e) => (typeof e != "string" && (e = e == null ? "" : String(e)), e && e.split("").reduce((t, r) => ({
4229
- inString: io(r) ? !t.inString : t.inString,
4230
- text: t.text + (t.inString && r || r.toUpperCase())
4231
- }), { inString: !1, text: "" }).text || e), ii = (e) => {
4232
- if (!e || typeof e != "string") return !1;
4233
- const t = e.trim();
4234
- return !isNaN(Number(t)) && !isNaN(parseFloat(t));
4235
- }, ao = (e) => {
4236
- if (!e || typeof e != "string") return !1;
4237
- const t = e.trim();
4238
- return [
4239
- /^\d{1,2}\/\d{1,2}\/\d{2,4}$/,
4240
- // MM/DD/YYYY or M/D/YY
4241
- /^\d{1,2}-\d{1,2}-\d{2,4}$/,
4242
- // MM-DD-YYYY or M-D-YY
4243
- /^\d{4}-\d{1,2}-\d{1,2}$/,
4244
- // YYYY-MM-DD
4245
- /^\d{1,2}\/\d{1,2}$/,
4246
- // MM/DD
4247
- /^\d{1,2}-\d{1,2}$/
4248
- // MM-DD
4249
- ].some((n) => n.test(t)) && !isNaN(Date.parse(t));
4250
- }, oo = (e) => (typeof e != "string" && (e = e == null ? "" : String(e)), !e || e.length === 0 || e.indexOf("=") === 0 || e.trim().startsWith("\\text{") && e.trim().endsWith("}") || e.includes("\\") || ii(e) || ao(e) ? e : `\\text{${e}}`), co = (e) => {
4251
- if (!e || typeof e != "string")
4252
- return null;
4253
- let t = e.trim();
4254
- if (!t || /%\s+\S/.test(t) || /^[\d,.$€£¥₹₽-]+\s+[a-zA-Z]{4,}/.test(t))
4255
- return null;
4256
- const n = t;
4257
- ["$", "€", "£", "¥", "₹", "₽", "R$", "C$", "A$", "NZ$", "HK$", "S$"].forEach((w) => {
4258
- const U = w.replace(/[.*+?^${}()|[\]\\]/g, "\\$&");
4259
- t = t.replace(new RegExp(U, "g"), "");
4260
- });
4261
- const o = t.includes("%");
4262
- t = t.replace(/%/g, "");
4263
- const i = /^\s*\([^)]+\)\s*$/.test(n) && /\d/.test(n);
4264
- i && (t = t.replace(/[()]/g, "")), t = t.replace(/\s/g, "");
4265
- const l = t.startsWith("-");
4266
- l && (t = t.substring(1));
4267
- const p = (t.match(/,/g) || []).length, f = (t.match(/\./g) || []).length, g = t.lastIndexOf(","), m = t.lastIndexOf(".");
4268
- let h;
4269
- if (p === 0 && f === 0 || p === 0 && f === 1 ? h = t : p === 1 && f === 0 ? t.substring(g + 1).length === 3 && t.length > 4 ? h = t.replace(/,/g, "") : h = t.replace(",", ".") : g > m ? h = t.replace(/\./g, "").replace(",", ".") : h = t.replace(/,/g, ""), !ii(h))
4270
- return null;
4271
- let N = parseFloat(h);
4272
- return (l || i) && (N = -Math.abs(N)), o && (N = N / 100), N;
4273
- }, Nt = (e) => {
4274
- const t = new Date(1904, 0, 1), r = 24 * 60 * 60 * 1e3;
4275
- return Math.floor((e.getTime() - t.getTime()) / r) + 1;
4276
- }, lo = (e) => {
4277
- if (!e || typeof e != "string")
4278
- return null;
4279
- const t = e.trim();
4280
- if (!t)
4281
- return null;
4282
- const r = /* @__PURE__ */ new Date(), n = t.toLowerCase();
4283
- if (n === "today")
4284
- return Nt(new Date(r.getFullYear(), r.getMonth(), r.getDate()));
4285
- if (n === "tomorrow") {
4286
- const x = new Date(r);
4287
- return x.setDate(r.getDate() + 1), Nt(new Date(x.getFullYear(), x.getMonth(), x.getDate()));
4288
- }
4289
- if (n === "yesterday") {
4290
- const x = new Date(r);
4291
- return x.setDate(r.getDate() - 1), Nt(new Date(x.getFullYear(), x.getMonth(), x.getDate()));
4292
- }
4293
- if (/^-?\d+(\.\d+)?$/.test(t) || /^[$€£¥₹₽]?\s*-?\d{1,3}([,.]?\d{3})*([,.]\d+)?$|^-?\d{1,3}([,.]?\d{3})*([,.]\d+)?\s*[$€£¥₹₽%]?$/.test(t))
4294
- return null;
4295
- if (/^[\dA-Za-z\s/\-.,:T]+$/.test(t)) {
4296
- const x = Date.parse(t);
4297
- if (!isNaN(x))
4298
- return Nt(new Date(x));
4299
- }
4300
- const o = /^(\d{1,2})[/\-.](\d{1,2})[/\-.](\d{4})$/, i = t.match(o);
4301
- if (i) {
4302
- const x = parseInt(i[1], 10), N = parseInt(i[2], 10), w = parseInt(i[3], 10);
4303
- if (x >= 1 && x <= 12 && N >= 1 && N <= 31)
4304
- return Nt(new Date(w, x - 1, N));
4305
- }
4306
- const l = /^(\d{1,2})[/\-.](\d{1,2})[/\-.](\d{4})$/, p = t.match(l);
4307
- if (p) {
4308
- const x = parseInt(p[1], 10), N = parseInt(p[2], 10), w = parseInt(p[3], 10);
4309
- if (N >= 1 && N <= 12 && x >= 1 && x <= 31 && x > 12)
4310
- return Nt(new Date(w, N - 1, x));
4311
- }
4312
- const f = /^(\d{1,2})[/-](\d{1,2})$/, g = t.match(f);
4313
- if (g) {
4314
- const x = parseInt(g[1], 10), N = parseInt(g[2], 10);
4315
- if (x >= 1 && x <= 12 && N >= 1 && N <= 31)
4316
- return Nt(new Date(r.getFullYear(), x - 1, N));
4317
- }
4318
- const m = /^(\d{4})-(\d{1,2})-(\d{1,2})$/, h = t.match(m);
4319
- if (h) {
4320
- const x = parseInt(h[1], 10), N = parseInt(h[2], 10), w = parseInt(h[3], 10);
4321
- if (N >= 1 && N <= 12 && w >= 1 && w <= 31)
4322
- return Nt(new Date(x, N - 1, w));
4323
- }
4324
- return null;
4325
- };
4326
- function ai(e) {
4327
- const t = e.indexOf("!");
4328
- return t < 0 ? [void 0, e] : [e.slice(0, t), e.slice(t + 1)];
4329
- }
4330
- const uo = (e, t) => `${e}!${t}`;
4331
- function oi(e, t) {
4332
- return Object.keys(t || {}).reduce((r, n) => (r[uo(e, n)] = t[n], r), {});
4333
- }
4334
- function Oo(e, t) {
4335
- const r = {};
4336
- for (const n of Object.keys(e || {})) {
4337
- const [a, o] = ai(n);
4338
- a === t && (r[o] = e[n]);
4339
- }
4340
- return r;
4341
- }
4342
- function ls(e, t) {
4343
- const r = {};
4344
- for (const n of t) r[n] = {};
4345
- for (const n of Object.keys(e || {})) {
4346
- const [a, o] = ai(n), i = a ?? t[0];
4347
- r[i] || (r[i] = {}), r[i][o] = e[n];
4348
- }
4349
- return r;
4350
- }
4351
- const Us = (e) => {
4352
- if (typeof e == "number")
4353
- return [e];
4354
- if (e == null)
4355
- return [e];
4356
- const t = String(e);
4357
- let r = [t];
4358
- try {
4359
- const n = {
4360
- // allowThousandsSeparator: true,
4361
- keepTextWhitespace: !0,
4362
- ...so
4363
- };
4364
- if (t && t.length > 0) {
4365
- const a = t.indexOf("=") === 0 ? si(t) : oo(t);
4366
- ni.buildTranslator(n, ri)(a, (i, l) => {
4367
- i && i.length && console.error(i), r = t.indexOf("=") === 0 ? l.split(",") : [l];
4368
- });
4369
- }
4370
- } catch (n) {
4371
- console.log("parse error: " + n.stack);
4372
- }
4373
- return r;
4374
- }, fo = (e, t) => {
4375
- const r = Us(e), n = Us(t);
4376
- return r.length !== n.length ? !1 : r.every((a, o) => {
4377
- const i = n[o];
4378
- return a === i;
4379
- });
4380
- }, po = (e, t, r, n) => r && n && r !== n ? !1 : e !== void 0 && e === t, go = (e, t) => {
4381
- if (!e || !e.startsWith("=") || !t)
4382
- return e;
4383
- const r = {};
4384
- for (const [l, p] of Object.entries(t))
4385
- r[l] = { ...p, val: p.val || p.text };
4386
- const n = {
4387
- keepTextWhitespace: !0,
4388
- env: r,
4389
- ...no
4390
- }, a = si(e), o = ni.buildTranslator(n, ri);
4391
- let i = e;
4392
- return o(a, (l, p) => {
4393
- (!l || !l.length) && (i = String(p));
4394
- }), i;
4395
- }, ho = ({ method: e, expected: t, points: r = 1 }, { val: n, formula: a, type: o } = { val: void 0, formula: void 0, type: void 0 }, i = void 0) => {
4396
- if (e === "value") {
4397
- let l = t;
4398
- typeof t == "string" && t.startsWith("=") && (l = go(t, i));
4399
- let p = "text", f = l;
4400
- if (l != null) {
4401
- const g = String(l), m = lo(g);
4402
- if (m)
4403
- p = "date", f = String(m);
4404
- else {
4405
- const h = co(g);
4406
- h !== null && (p = "number", f = String(h));
4407
- }
4408
- }
4409
- if (po(n, f, o, p))
4410
- return { points: r, isValid: !0 };
4411
- } else if (e === "formula" && fo(a, t))
4412
- return { points: r, isValid: !0 };
4413
- return { points: 0, isValid: !1 };
4414
- }, mo = (e) => e.text || e.val, Co = (e) => {
4415
- var t, r;
4416
- return (e == null ? void 0 : e.text) || ((r = (t = e == null ? void 0 : e.attrs) == null ? void 0 : t.assess) == null ? void 0 : r.expected);
4417
- }, xo = ({ cells: e, primaryColumn: t }) => {
4418
- const n = Object.keys(e).sort((o, i) => +o.slice(1) - +i.slice(1)).map((o) => o.slice(0, 1) === t && o || null).filter((o) => o !== null).map(
4419
- (o) => mo(e[o]) || null
4420
- ), a = /* @__PURE__ */ new Set();
4421
- return n.map((o) => a.has(o) ? null : (a.add(o), o)).filter((o) => o !== null);
4422
- }, Ao = ({ cells: e, region: t }) => {
4423
- const { primaryColumn: r, rows: n } = t, a = xo({ cells: e, primaryColumn: r }), o = new Map(
4424
- n.map((l) => [Co(l[r]), l])
4425
- );
4426
- return a.map((l) => l !== null && o.get(l) || null);
4427
- }, To = ({ cells: e, region: t }) => {
4428
- const r = (t == null ? void 0 : t.order) === "actual" && Ao({ cells: e, region: t }) || (t == null ? void 0 : t.rows) || [];
4429
- if (!t)
4430
- throw new Error("getCellsValidationFromRegionValidation() missing region value");
4431
- return r.reduce((a, o, i) => (
4432
- // TODO mark holes as errors.
4433
- (i = (o == null ? void 0 : o.id) || i + 1, o && Object.keys(o).forEach((l) => {
4434
- var p;
4435
- return ((p = o[l]) == null ? void 0 : p.assess) && (a[l + i] = o[l]);
4436
- }), a)
4437
- ), {}) || {};
4438
- }, Eo = ({ cells: e, validation: t }) => {
4439
- const r = t.regions || t.ranges, n = Object.keys(r).find((a) => a);
4440
- return [{
4441
- region: r[n] || {},
4442
- cells: e
4443
- }];
4444
- }, gn = ({ cells: e, validation: t }) => Eo({ cells: e, validation: t }).map((a) => To(a))[0], ci = (e) => {
4445
- const t = e != null && e.sheets ? Object.keys(e.sheets) : null;
4446
- return t && t.length ? t : null;
4447
- }, Ro = (e, t, r) => {
4448
- if (!e) return;
4449
- const n = ls(e, r);
4450
- return Object.keys(n[t] || {}).length ? n[t] : e;
4451
- }, wo = ({ cells: e, validation: t }) => {
4452
- const r = ci(t);
4453
- if (!r) return gn({ cells: e, validation: t });
4454
- const n = ls(e || {}, r);
4455
- return r.reduce((a, o) => Object.assign(
4456
- a,
4457
- oi(o, gn({ cells: n[o], validation: t.sheets[o] }))
4458
- ), {});
4459
- }, bo = ({ cells: e, validation: t, interactionCells: r = void 0 }) => {
4460
- const n = ci(t);
4461
- if (!n) {
4462
- const o = gn({ cells: e, validation: t });
4463
- return $s(e, o, r);
4464
- }
4465
- const a = ls(e || {}, n);
4466
- return n.reduce((o, i) => {
4467
- const l = gn({ cells: a[i], validation: t.sheets[i] }), p = $s(a[i], l, Ro(r, i, n));
4468
- return Object.assign(o, oi(i, p));
4469
- }, {});
4470
- };
4471
- function $s(e, t, r) {
4472
- return Object.keys(t).reduce((n, a) => ({
4473
- ...n,
4474
- [a]: n[a] && {
4475
- ...n[a],
4476
- score: ho(t[a].assess, n[a], r)
4477
- } || void 0
4478
- }), e);
4479
- }
4480
- export {
4481
- ni as T,
4482
- co as a,
4483
- ri as b,
4484
- go as c,
4485
- ao as d,
4486
- no as e,
4487
- So as f,
4488
- wo as g,
4489
- uo as h,
4490
- ii as i,
4491
- ho as j,
4492
- ls as k,
4493
- ai as l,
4494
- lo as n,
4495
- oi as q,
4496
- Oo as r,
4497
- bo as s,
4498
- si as t,
4499
- oo as w
4500
- };
4501
- //# sourceMappingURL=index-3_WJgYM5.js.map