@agile-team/mach-report 2.10.0 → 2.11.0
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/README.md +6 -2
- package/dist/ExcelBindingWizard-CjIiVox-.cjs +1 -0
- package/dist/ExcelBindingWizard-Dxm-K5HL.js +1240 -0
- package/dist/ParamEditor-D-Hf5xfO.cjs +1 -0
- package/dist/ParamEditor-DRGxzxeO.js +381 -0
- package/dist/ReportBatchPanel-BYgg0EDB.cjs +1 -0
- package/dist/ReportBatchPanel-Bby5yLzU.js +287 -0
- package/dist/ReportPreview-DWXROHBP.cjs +6 -0
- package/dist/ReportPreview-DiNXhQI0.js +4138 -0
- package/dist/ReportTemplateLibrary-C6CO7YCT.cjs +1 -0
- package/dist/ReportTemplateLibrary-DfzDXRvr.js +260 -0
- package/dist/RuleEditor-C2QsOHOs.cjs +1 -0
- package/dist/RuleEditor-D9wQHrkf.js +2024 -0
- package/dist/TemplateReviewPanel-BKofGrV9.js +222 -0
- package/dist/TemplateReviewPanel-DwtOcLue.cjs +1 -0
- package/dist/analytics.cjs +1 -1
- package/dist/analytics.d.cts +2 -0
- package/dist/analytics.d.ts +2 -0
- package/dist/analytics.js +29 -29
- package/dist/batch-Bt3Fd27Z.cjs +1 -0
- package/dist/batch-mRqhhhjt.js +364 -0
- package/dist/computed-Bvk0W15F.js +521 -0
- package/dist/computed-CGV2a809.cjs +1 -0
- package/dist/config-B612mw0x.js +525 -0
- package/dist/config-BRoLo2oj.cjs +1 -0
- package/dist/designer.cjs +2 -2
- package/dist/designer.d.cts +659 -9
- package/dist/designer.d.ts +659 -9
- package/dist/designer.js +2030 -1824
- package/dist/index.cjs +8 -8
- package/dist/index.d.cts +147 -3
- package/dist/index.d.ts +147 -3
- package/dist/index.js +639 -592
- package/dist/injection-keys-Db_DyLkm.cjs +1 -0
- package/dist/injection-keys-e85udZCp.js +7 -0
- package/dist/list-cell-BuYn4tGF.cjs +1 -0
- package/dist/{list-cell-Dxyi7DOw.js → list-cell-ClFra1zS.js} +54 -40
- package/dist/matrix-DVyWiYsd.cjs +1 -0
- package/dist/matrix-yZsGnldA.js +227 -0
- package/dist/param-validation-BlHHXs6u.js +153 -0
- package/dist/param-validation-DCK039V1.cjs +1 -0
- package/dist/pdf.cjs +25 -25
- package/dist/pdf.d.cts +3 -0
- package/dist/pdf.d.ts +3 -0
- package/dist/pdf.js +677 -677
- package/dist/plugin-BDTU4D94.cjs +1 -0
- package/dist/plugin-Cd5G2QQn.js +22 -0
- package/dist/region-binding-workflow-CXDmt9Bs.js +977 -0
- package/dist/region-binding-workflow-DhQvu1co.cjs +3 -0
- package/dist/{report-params-B_VCihAh.js → report-params-B44imUd4.js} +1 -1
- package/dist/{report-params-CjWrjPl6.cjs → report-params-SJfhKgaX.cjs} +1 -1
- package/dist/server/node.d.cts +5 -2
- package/dist/server/node.d.ts +5 -2
- package/dist/server-node.cjs +1 -1
- package/dist/server-node.js +87 -87
- package/dist/server.cjs +1 -1
- package/dist/server.d.cts +201 -2
- package/dist/server.d.ts +201 -2
- package/dist/server.js +557 -658
- package/dist/style.css +1 -1
- package/dist/template-registry-WNXdkiET.js +506 -0
- package/dist/template-registry-ukBGlm8N.cjs +1 -0
- package/dist/template-review-BXp2oyqg.cjs +1 -0
- package/dist/template-review-BdcXSYbx.js +1616 -0
- package/dist/tree-BX380Rr7.cjs +1 -0
- package/dist/tree-CqcQ99NM.js +172 -0
- package/dist/{validate-UUy9yP4K.js → validate-7s0yn6ii.js} +44 -44
- package/dist/validate-DsRiNw8h.cjs +1 -0
- package/dist/vue/async.d.cts +93 -4
- package/dist/vue/async.d.ts +93 -4
- package/dist/vue/index.d.cts +145 -7
- package/dist/vue/index.d.ts +145 -7
- package/dist/vue-async.cjs +1 -1
- package/dist/vue-async.js +5 -5
- package/dist/vue.cjs +1 -1
- package/dist/vue.js +116 -113
- package/dist/{workbook-session-B-bW5_yR.js → workbook-session-BKOTwcoq.js} +1 -1
- package/dist/{workbook-session-D7RtdNo0.cjs → workbook-session-CLYLhZWu.cjs} +1 -1
- package/dist/worker.cjs +1 -1
- package/dist/worker.d.cts +5 -2
- package/dist/worker.d.ts +5 -2
- package/dist/worker.js +1 -1
- package/dist/xlsx.cjs +3 -3
- package/dist/xlsx.d.cts +129 -2
- package/dist/xlsx.d.ts +129 -2
- package/dist/xlsx.js +336 -242
- package/package.json +1 -1
- package/dist/ExcelBindingWizard-CF7RplWm.cjs +0 -1
- package/dist/ExcelBindingWizard-qhwEderR.js +0 -842
- package/dist/ReportPreview-BE1tCHqE.js +0 -4604
- package/dist/ReportPreview-QKRKQOe3.cjs +0 -6
- package/dist/RuleEditor-BA36yIV6.js +0 -1723
- package/dist/RuleEditor-CczJ6mJm.cjs +0 -1
- package/dist/TemplateReviewPanel-CHi4Alqa.cjs +0 -1
- package/dist/TemplateReviewPanel-Dz0G5o83.js +0 -217
- package/dist/binding-preview-BWsdf_z2.cjs +0 -2
- package/dist/binding-preview-DILq0-0f.js +0 -649
- package/dist/decimal-CI1OAczk.js +0 -87
- package/dist/decimal-CQA0xJex.cjs +0 -1
- package/dist/list-cell-CyM1ZlRN.cjs +0 -1
- package/dist/matrix-BbXarwyk.js +0 -661
- package/dist/matrix-Cm65WLLP.cjs +0 -1
- package/dist/param-validation-BWNjLcN0.js +0 -116
- package/dist/param-validation-CiTxFeZ8.cjs +0 -1
- package/dist/plugin-CThk42vJ.cjs +0 -1
- package/dist/plugin-tGn7-5oF.js +0 -25
- package/dist/template-registry-CGWTLtIA.cjs +0 -1
- package/dist/template-registry-DzlQs3OF.js +0 -434
- package/dist/template-review-D1RoNCPw.cjs +0 -1
- package/dist/template-review-fnteXRng.js +0 -1473
- package/dist/validate-Bf6ccFr2.cjs +0 -1
package/dist/pdf.js
CHANGED
|
@@ -69,7 +69,7 @@ function Tg() {
|
|
|
69
69
|
for (var te = C.length; --te >= 0; )
|
|
70
70
|
C[te] = 0;
|
|
71
71
|
}
|
|
72
|
-
var o = 0, s = 1, u = 2, f = 3, l = 258, h = 29, d = 256, v = d + 1 + h, p = 30,
|
|
72
|
+
var o = 0, s = 1, u = 2, f = 3, l = 258, h = 29, d = 256, v = d + 1 + h, p = 30, m = 19, w = 2 * v + 1, x = 15, P = 16, A = 7, M = 256, B = 16, k = 17, I = 18, j = (
|
|
73
73
|
/* extra bits for each length code */
|
|
74
74
|
[0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 5, 5, 5, 5, 0]
|
|
75
75
|
), H = (
|
|
@@ -173,7 +173,7 @@ function Tg() {
|
|
|
173
173
|
U[C * 2 + 1] = 8, C++, X[8]++;
|
|
174
174
|
for (Re(U, v + 1, X), C = 0; C < p; C++)
|
|
175
175
|
re[C * 2 + 1] = 5, re[C * 2] = ce(C, 5);
|
|
176
|
-
we = new pe(U, j, d + 1, v, x), me = new pe(re, H, 0, p, x), De = new pe(new Array(0), W, 0,
|
|
176
|
+
we = new pe(U, j, d + 1, v, x), me = new pe(re, H, 0, p, x), De = new pe(new Array(0), W, 0, m, A);
|
|
177
177
|
}
|
|
178
178
|
function Oe(C) {
|
|
179
179
|
var te;
|
|
@@ -181,7 +181,7 @@ function Tg() {
|
|
|
181
181
|
C.dyn_ltree[te * 2] = 0;
|
|
182
182
|
for (te = 0; te < p; te++)
|
|
183
183
|
C.dyn_dtree[te * 2] = 0;
|
|
184
|
-
for (te = 0; te <
|
|
184
|
+
for (te = 0; te < m; te++)
|
|
185
185
|
C.bl_tree[te * 2] = 0;
|
|
186
186
|
C.dyn_ltree[M * 2] = 1, C.opt_len = C.static_len = 0, C.last_lit = C.matches = 0;
|
|
187
187
|
}
|
|
@@ -195,7 +195,7 @@ function Tg() {
|
|
|
195
195
|
var L = te * 2, X = ae * 2;
|
|
196
196
|
return C[L] < C[X] || C[L] === C[X] && fe[te] <= fe[ae];
|
|
197
197
|
}
|
|
198
|
-
function
|
|
198
|
+
function b(C, te, ae) {
|
|
199
199
|
for (var fe = C.heap[ae], L = ae << 1; L <= C.heap_len && (L < C.heap_len && y(te, C.heap[L + 1], C.heap[L], C.depth) && L++, !y(te, fe, C.heap[L], C.depth)); )
|
|
200
200
|
C.heap[ae] = C.heap[L], ae = L, L <<= 1;
|
|
201
201
|
C.heap[ae] = fe;
|
|
@@ -215,7 +215,7 @@ function Tg() {
|
|
|
215
215
|
for (; C.heap_len < 2; )
|
|
216
216
|
g = C.heap[++C.heap_len] = Pe < 2 ? ++Pe : 0, ae[g * 2] = 1, C.depth[g] = 0, C.opt_len--, L && (C.static_len -= fe[g * 2 + 1]);
|
|
217
217
|
for (te.max_code = Pe, F = C.heap_len >> 1; F >= 1; F--)
|
|
218
|
-
|
|
218
|
+
b(C, ae, F);
|
|
219
219
|
g = X;
|
|
220
220
|
do
|
|
221
221
|
F = C.heap[
|
|
@@ -224,7 +224,7 @@ function Tg() {
|
|
|
224
224
|
], C.heap[
|
|
225
225
|
1
|
|
226
226
|
/*SMALLEST*/
|
|
227
|
-
] = C.heap[C.heap_len--],
|
|
227
|
+
] = C.heap[C.heap_len--], b(
|
|
228
228
|
C,
|
|
229
229
|
ae,
|
|
230
230
|
1
|
|
@@ -235,7 +235,7 @@ function Tg() {
|
|
|
235
235
|
], C.heap[--C.heap_max] = F, C.heap[--C.heap_max] = ne, ae[g * 2] = ae[F * 2] + ae[ne * 2], C.depth[g] = (C.depth[F] >= C.depth[ne] ? C.depth[F] : C.depth[ne]) + 1, ae[F * 2 + 1] = ae[ne * 2 + 1] = g, C.heap[
|
|
236
236
|
1
|
|
237
237
|
/*SMALLEST*/
|
|
238
|
-
] = g++,
|
|
238
|
+
] = g++, b(
|
|
239
239
|
C,
|
|
240
240
|
ae,
|
|
241
241
|
1
|
|
@@ -266,7 +266,7 @@ function Tg() {
|
|
|
266
266
|
}
|
|
267
267
|
function ye(C) {
|
|
268
268
|
var te;
|
|
269
|
-
for (ee(C, C.dyn_ltree, C.l_desc.max_code), ee(C, C.dyn_dtree, C.d_desc.max_code), N(C, C.bl_desc), te =
|
|
269
|
+
for (ee(C, C.dyn_ltree, C.l_desc.max_code), ee(C, C.dyn_dtree, C.d_desc.max_code), N(C, C.bl_desc), te = m - 1; te >= 3 && C.bl_tree[q[te] * 2 + 1] === 0; te--)
|
|
270
270
|
;
|
|
271
271
|
return C.opt_len += 3 * (te + 1) + 5 + 5 + 4, te;
|
|
272
272
|
}
|
|
@@ -373,7 +373,7 @@ var zl;
|
|
|
373
373
|
function Dg() {
|
|
374
374
|
if (zl) return Rr;
|
|
375
375
|
zl = 1;
|
|
376
|
-
var t = Jn(), e = Tg(), r = Qd(), n = _d(), i = yc(), a = 0, o = 1, s = 3, u = 4, f = 5, l = 0, h = 1, d = -2, v = -3, p = -5,
|
|
376
|
+
var t = Jn(), e = Tg(), r = Qd(), n = _d(), i = yc(), a = 0, o = 1, s = 3, u = 4, f = 5, l = 0, h = 1, d = -2, v = -3, p = -5, m = -1, w = 1, x = 2, P = 3, A = 4, M = 0, B = 2, k = 8, I = 9, j = 15, H = 8, W = 29, q = 256, Z = q + 1 + W, U = 30, re = 19, _ = 2 * Z + 1, $ = 15, Q = 3, de = 258, pe = de + Q + 1, we = 32, me = 42, De = 69, Le = 73, Ge = 91, Xe = 103, Fe = 113, Ne = 666, ce = 1, Te = 2, xe = 3, Re = 4, he = 3;
|
|
377
377
|
function Oe(g, G) {
|
|
378
378
|
return g.msg = i[G], G;
|
|
379
379
|
}
|
|
@@ -388,7 +388,7 @@ function Dg() {
|
|
|
388
388
|
var G = g.state, K = G.pending;
|
|
389
389
|
K > g.avail_out && (K = g.avail_out), K !== 0 && (t.arraySet(g.output, G.pending_buf, G.pending_out, K, g.next_out), g.next_out += K, G.pending_out += K, g.total_out += K, g.avail_out -= K, G.pending -= K, G.pending === 0 && (G.pending_out = 0));
|
|
390
390
|
}
|
|
391
|
-
function
|
|
391
|
+
function b(g, G) {
|
|
392
392
|
e._tr_flush_block(g, g.block_start >= 0 ? g.block_start : -1, g.strstart - g.block_start, G), g.block_start = g.strstart, y(g.strm);
|
|
393
393
|
}
|
|
394
394
|
function D(g, G) {
|
|
@@ -402,10 +402,10 @@ function Dg() {
|
|
|
402
402
|
return R > S && (R = S), R === 0 ? 0 : (g.avail_in -= R, t.arraySet(G, g.input, g.next_in, R, K), g.state.wrap === 1 ? g.adler = r(g.adler, G, R, K) : g.state.wrap === 2 && (g.adler = n(g.adler, G, R, K)), g.next_in += R, g.total_in += R, R);
|
|
403
403
|
}
|
|
404
404
|
function Y(g, G) {
|
|
405
|
-
var K = g.max_chain_length, S = g.strstart, R, V, Ae = g.prev_length, ve = g.nice_match, ge = g.strstart > g.w_size - pe ? g.strstart - (g.w_size - pe) : 0, ut = g.window, rn = g.w_mask, Dt = g.prev, lt = g.strstart + de,
|
|
405
|
+
var K = g.max_chain_length, S = g.strstart, R, V, Ae = g.prev_length, ve = g.nice_match, ge = g.strstart > g.w_size - pe ? g.strstart - (g.w_size - pe) : 0, ut = g.window, rn = g.w_mask, Dt = g.prev, lt = g.strstart + de, zt = ut[S + Ae - 1], Qt = ut[S + Ae];
|
|
406
406
|
g.prev_length >= g.good_match && (K >>= 2), ve > g.lookahead && (ve = g.lookahead);
|
|
407
407
|
do
|
|
408
|
-
if (R = G, !(ut[R + Ae] !== Qt || ut[R + Ae - 1] !==
|
|
408
|
+
if (R = G, !(ut[R + Ae] !== Qt || ut[R + Ae - 1] !== zt || ut[R] !== ut[S] || ut[++R] !== ut[S + 1])) {
|
|
409
409
|
S += 2, R++;
|
|
410
410
|
do
|
|
411
411
|
;
|
|
@@ -413,7 +413,7 @@ function Dg() {
|
|
|
413
413
|
if (V = de - (lt - S), S = lt - de, V > Ae) {
|
|
414
414
|
if (g.match_start = G, Ae = V, V >= ve)
|
|
415
415
|
break;
|
|
416
|
-
|
|
416
|
+
zt = ut[S + Ae - 1], Qt = ut[S + Ae];
|
|
417
417
|
}
|
|
418
418
|
}
|
|
419
419
|
while ((G = Dt[G & rn]) > ge && --K !== 0);
|
|
@@ -451,10 +451,10 @@ function Dg() {
|
|
|
451
451
|
}
|
|
452
452
|
g.strstart += g.lookahead, g.lookahead = 0;
|
|
453
453
|
var S = g.block_start + K;
|
|
454
|
-
if ((g.strstart === 0 || g.strstart >= S) && (g.lookahead = g.strstart - S, g.strstart = S,
|
|
454
|
+
if ((g.strstart === 0 || g.strstart >= S) && (g.lookahead = g.strstart - S, g.strstart = S, b(g, !1), g.strm.avail_out === 0) || g.strstart - g.block_start >= g.w_size - pe && (b(g, !1), g.strm.avail_out === 0))
|
|
455
455
|
return ce;
|
|
456
456
|
}
|
|
457
|
-
return g.insert = 0, G === u ? (
|
|
457
|
+
return g.insert = 0, G === u ? (b(g, !0), g.strm.avail_out === 0 ? xe : Re) : (g.strstart > g.block_start && (b(g, !1), g.strm.avail_out === 0), ce);
|
|
458
458
|
}
|
|
459
459
|
function He(g, G) {
|
|
460
460
|
for (var K, S; ; ) {
|
|
@@ -475,10 +475,10 @@ function Dg() {
|
|
|
475
475
|
g.strstart += g.match_length, g.match_length = 0, g.ins_h = g.window[g.strstart], g.ins_h = (g.ins_h << g.hash_shift ^ g.window[g.strstart + 1]) & g.hash_mask;
|
|
476
476
|
else
|
|
477
477
|
S = e._tr_tally(g, 0, g.window[g.strstart]), g.lookahead--, g.strstart++;
|
|
478
|
-
if (S && (
|
|
478
|
+
if (S && (b(g, !1), g.strm.avail_out === 0))
|
|
479
479
|
return ce;
|
|
480
480
|
}
|
|
481
|
-
return g.insert = g.strstart < Q - 1 ? g.strstart : Q - 1, G === u ? (
|
|
481
|
+
return g.insert = g.strstart < Q - 1 ? g.strstart : Q - 1, G === u ? (b(g, !0), g.strm.avail_out === 0 ? xe : Re) : g.last_lit && (b(g, !1), g.strm.avail_out === 0) ? ce : Te;
|
|
482
482
|
}
|
|
483
483
|
function _e(g, G) {
|
|
484
484
|
for (var K, S, R; ; ) {
|
|
@@ -493,15 +493,15 @@ function Dg() {
|
|
|
493
493
|
do
|
|
494
494
|
++g.strstart <= R && (g.ins_h = (g.ins_h << g.hash_shift ^ g.window[g.strstart + Q - 1]) & g.hash_mask, K = g.prev[g.strstart & g.w_mask] = g.head[g.ins_h], g.head[g.ins_h] = g.strstart);
|
|
495
495
|
while (--g.prev_length !== 0);
|
|
496
|
-
if (g.match_available = 0, g.match_length = Q - 1, g.strstart++, S && (
|
|
496
|
+
if (g.match_available = 0, g.match_length = Q - 1, g.strstart++, S && (b(g, !1), g.strm.avail_out === 0))
|
|
497
497
|
return ce;
|
|
498
498
|
} else if (g.match_available) {
|
|
499
|
-
if (S = e._tr_tally(g, 0, g.window[g.strstart - 1]), S &&
|
|
499
|
+
if (S = e._tr_tally(g, 0, g.window[g.strstart - 1]), S && b(g, !1), g.strstart++, g.lookahead--, g.strm.avail_out === 0)
|
|
500
500
|
return ce;
|
|
501
501
|
} else
|
|
502
502
|
g.match_available = 1, g.strstart++, g.lookahead--;
|
|
503
503
|
}
|
|
504
|
-
return g.match_available && (S = e._tr_tally(g, 0, g.window[g.strstart - 1]), g.match_available = 0), g.insert = g.strstart < Q - 1 ? g.strstart : Q - 1, G === u ? (
|
|
504
|
+
return g.match_available && (S = e._tr_tally(g, 0, g.window[g.strstart - 1]), g.match_available = 0), g.insert = g.strstart < Q - 1 ? g.strstart : Q - 1, G === u ? (b(g, !0), g.strm.avail_out === 0 ? xe : Re) : g.last_lit && (b(g, !1), g.strm.avail_out === 0) ? ce : Te;
|
|
505
505
|
}
|
|
506
506
|
function Qe(g, G) {
|
|
507
507
|
for (var K, S, R, V, Ae = g.window; ; ) {
|
|
@@ -518,10 +518,10 @@ function Dg() {
|
|
|
518
518
|
while (S === Ae[++R] && S === Ae[++R] && S === Ae[++R] && S === Ae[++R] && S === Ae[++R] && S === Ae[++R] && S === Ae[++R] && S === Ae[++R] && R < V);
|
|
519
519
|
g.match_length = de - (V - R), g.match_length > g.lookahead && (g.match_length = g.lookahead);
|
|
520
520
|
}
|
|
521
|
-
if (g.match_length >= Q ? (K = e._tr_tally(g, 1, g.match_length - Q), g.lookahead -= g.match_length, g.strstart += g.match_length, g.match_length = 0) : (K = e._tr_tally(g, 0, g.window[g.strstart]), g.lookahead--, g.strstart++), K && (
|
|
521
|
+
if (g.match_length >= Q ? (K = e._tr_tally(g, 1, g.match_length - Q), g.lookahead -= g.match_length, g.strstart += g.match_length, g.match_length = 0) : (K = e._tr_tally(g, 0, g.window[g.strstart]), g.lookahead--, g.strstart++), K && (b(g, !1), g.strm.avail_out === 0))
|
|
522
522
|
return ce;
|
|
523
523
|
}
|
|
524
|
-
return g.insert = 0, G === u ? (
|
|
524
|
+
return g.insert = 0, G === u ? (b(g, !0), g.strm.avail_out === 0 ? xe : Re) : g.last_lit && (b(g, !1), g.strm.avail_out === 0) ? ce : Te;
|
|
525
525
|
}
|
|
526
526
|
function Ct(g, G) {
|
|
527
527
|
for (var K; ; ) {
|
|
@@ -530,10 +530,10 @@ function Dg() {
|
|
|
530
530
|
return ce;
|
|
531
531
|
break;
|
|
532
532
|
}
|
|
533
|
-
if (g.match_length = 0, K = e._tr_tally(g, 0, g.window[g.strstart]), g.lookahead--, g.strstart++, K && (
|
|
533
|
+
if (g.match_length = 0, K = e._tr_tally(g, 0, g.window[g.strstart]), g.lookahead--, g.strstart++, K && (b(g, !1), g.strm.avail_out === 0))
|
|
534
534
|
return ce;
|
|
535
535
|
}
|
|
536
|
-
return g.insert = 0, G === u ? (
|
|
536
|
+
return g.insert = 0, G === u ? (b(g, !0), g.strm.avail_out === 0 ? xe : Re) : g.last_lit && (b(g, !1), g.strm.avail_out === 0) ? ce : Te;
|
|
537
537
|
}
|
|
538
538
|
function wt(g, G, K, S, R) {
|
|
539
539
|
this.good_length = g, this.max_lazy = G, this.nice_length = K, this.max_chain = S, this.func = R;
|
|
@@ -583,7 +583,7 @@ function Dg() {
|
|
|
583
583
|
if (!g)
|
|
584
584
|
return d;
|
|
585
585
|
var Ae = 1;
|
|
586
|
-
if (G ===
|
|
586
|
+
if (G === m && (G = 6), S < 0 ? (Ae = 0, S = -S) : S > 15 && (Ae = 2, S -= 16), R < 1 || R > I || K !== k || S < 8 || S > 15 || G < 0 || G > 9 || V < 0 || V > A)
|
|
587
587
|
return Oe(g, d);
|
|
588
588
|
S === 8 && (S = 9);
|
|
589
589
|
var ve = new C();
|
|
@@ -801,19 +801,19 @@ function Og() {
|
|
|
801
801
|
}, p.prototype.onEnd = function(P) {
|
|
802
802
|
P === u && (this.options.to === "string" ? this.result = this.chunks.join("") : this.result = e.flattenChunks(this.chunks)), this.chunks = [], this.err = P, this.msg = this.strm.msg;
|
|
803
803
|
};
|
|
804
|
-
function
|
|
804
|
+
function m(P, A) {
|
|
805
805
|
var M = new p(A);
|
|
806
806
|
if (M.push(P, !0), M.err)
|
|
807
807
|
throw M.msg || n[M.err];
|
|
808
808
|
return M.result;
|
|
809
809
|
}
|
|
810
810
|
function w(P, A) {
|
|
811
|
-
return A = A || {}, A.raw = !0,
|
|
811
|
+
return A = A || {}, A.raw = !0, m(P, A);
|
|
812
812
|
}
|
|
813
813
|
function x(P, A) {
|
|
814
|
-
return A = A || {}, A.gzip = !0,
|
|
814
|
+
return A = A || {}, A.gzip = !0, m(P, A);
|
|
815
815
|
}
|
|
816
|
-
return ki.Deflate = p, ki.deflate =
|
|
816
|
+
return ki.Deflate = p, ki.deflate = m, ki.deflateRaw = w, ki.gzip = x, ki;
|
|
817
817
|
}
|
|
818
818
|
var Ii = {}, mr = {}, Ru, Wl;
|
|
819
819
|
function Pg() {
|
|
@@ -821,8 +821,8 @@ function Pg() {
|
|
|
821
821
|
Wl = 1;
|
|
822
822
|
var t = 30, e = 12;
|
|
823
823
|
return Ru = function(n, i) {
|
|
824
|
-
var a, o, s, u, f, l, h, d, v, p,
|
|
825
|
-
a = n.state, o = n.next_in, Z = n.input, s = o + (n.avail_in - 5), u = n.next_out, U = n.output, f = u - (i - n.avail_out), l = u + (n.avail_out - 257), h = a.dmax, d = a.wsize, v = a.whave, p = a.wnext,
|
|
824
|
+
var a, o, s, u, f, l, h, d, v, p, m, w, x, P, A, M, B, k, I, j, H, W, q, Z, U;
|
|
825
|
+
a = n.state, o = n.next_in, Z = n.input, s = o + (n.avail_in - 5), u = n.next_out, U = n.output, f = u - (i - n.avail_out), l = u + (n.avail_out - 257), h = a.dmax, d = a.wsize, v = a.whave, p = a.wnext, m = a.window, w = a.hold, x = a.bits, P = a.lencode, A = a.distcode, M = (1 << a.lenbits) - 1, B = (1 << a.distbits) - 1;
|
|
826
826
|
e:
|
|
827
827
|
do {
|
|
828
828
|
x < 15 && (w += Z[o++] << x, x += 8, w += Z[o++] << x, x += 8), k = P[w & M];
|
|
@@ -844,11 +844,11 @@ function Pg() {
|
|
|
844
844
|
n.msg = "invalid distance too far back", a.mode = t;
|
|
845
845
|
break e;
|
|
846
846
|
}
|
|
847
|
-
if (W = 0, q =
|
|
847
|
+
if (W = 0, q = m, p === 0) {
|
|
848
848
|
if (W += d - I, I < j) {
|
|
849
849
|
j -= I;
|
|
850
850
|
do
|
|
851
|
-
U[u++] =
|
|
851
|
+
U[u++] = m[W++];
|
|
852
852
|
while (--I);
|
|
853
853
|
W = u - H, q = U;
|
|
854
854
|
}
|
|
@@ -856,12 +856,12 @@ function Pg() {
|
|
|
856
856
|
if (W += d + p - I, I -= p, I < j) {
|
|
857
857
|
j -= I;
|
|
858
858
|
do
|
|
859
|
-
U[u++] =
|
|
859
|
+
U[u++] = m[W++];
|
|
860
860
|
while (--I);
|
|
861
861
|
if (W = 0, p < j) {
|
|
862
862
|
I = p, j -= I;
|
|
863
863
|
do
|
|
864
|
-
U[u++] =
|
|
864
|
+
U[u++] = m[W++];
|
|
865
865
|
while (--I);
|
|
866
866
|
W = u - H, q = U;
|
|
867
867
|
}
|
|
@@ -869,7 +869,7 @@ function Pg() {
|
|
|
869
869
|
} else if (W += p - I, I < j) {
|
|
870
870
|
j -= I;
|
|
871
871
|
do
|
|
872
|
-
U[u++] =
|
|
872
|
+
U[u++] = m[W++];
|
|
873
873
|
while (--I);
|
|
874
874
|
W = u - H, q = U;
|
|
875
875
|
}
|
|
@@ -1047,11 +1047,11 @@ function kg() {
|
|
|
1047
1047
|
64,
|
|
1048
1048
|
64
|
|
1049
1049
|
];
|
|
1050
|
-
return Mu = function(d, v, p,
|
|
1050
|
+
return Mu = function(d, v, p, m, w, x, P, A) {
|
|
1051
1051
|
var M = A.bits, B = 0, k = 0, I = 0, j = 0, H = 0, W = 0, q = 0, Z = 0, U = 0, re = 0, _, $, Q, de, pe, we = null, me = 0, De, Le = new t.Buf16(e + 1), Ge = new t.Buf16(e + 1), Xe = null, Fe = 0, Ne, ce, Te;
|
|
1052
1052
|
for (B = 0; B <= e; B++)
|
|
1053
1053
|
Le[B] = 0;
|
|
1054
|
-
for (k = 0; k <
|
|
1054
|
+
for (k = 0; k < m; k++)
|
|
1055
1055
|
Le[v[p + k]]++;
|
|
1056
1056
|
for (H = M, j = e; j >= 1 && Le[j] === 0; j--)
|
|
1057
1057
|
;
|
|
@@ -1066,7 +1066,7 @@ function kg() {
|
|
|
1066
1066
|
return -1;
|
|
1067
1067
|
for (Ge[1] = 0, B = 1; B < e; B++)
|
|
1068
1068
|
Ge[B + 1] = Ge[B] + Le[B];
|
|
1069
|
-
for (k = 0; k <
|
|
1069
|
+
for (k = 0; k < m; k++)
|
|
1070
1070
|
v[p + k] !== 0 && (P[Ge[v[p + k]]++] = k);
|
|
1071
1071
|
if (d === i ? (we = Xe = P, De = 19) : d === a ? (we = s, me -= 257, Xe = u, Fe -= 257, De = 256) : (we = f, Xe = l, De = -1), re = 0, k = 0, B = I, pe = x, W = H, q = 0, Q = -1, U = 1 << H, de = U - 1, d === a && U > r || d === o && U > n)
|
|
1072
1072
|
return 1;
|
|
@@ -1097,7 +1097,7 @@ var Hl;
|
|
|
1097
1097
|
function Ig() {
|
|
1098
1098
|
if (Hl) return mr;
|
|
1099
1099
|
Hl = 1;
|
|
1100
|
-
var t = Jn(), e = Qd(), r = _d(), n = Pg(), i = kg(), a = 0, o = 1, s = 2, u = 4, f = 5, l = 6, h = 0, d = 1, v = 2, p = -2,
|
|
1100
|
+
var t = Jn(), e = Qd(), r = _d(), n = Pg(), i = kg(), a = 0, o = 1, s = 2, u = 4, f = 5, l = 6, h = 0, d = 1, v = 2, p = -2, m = -3, w = -4, x = -5, P = 8, A = 1, M = 2, B = 3, k = 4, I = 5, j = 6, H = 7, W = 8, q = 9, Z = 10, U = 11, re = 12, _ = 13, $ = 14, Q = 15, de = 16, pe = 17, we = 18, me = 19, De = 20, Le = 21, Ge = 22, Xe = 23, Fe = 24, Ne = 25, ce = 26, Te = 27, xe = 28, Re = 29, he = 30, Oe = 31, gt = 32, E = 852, y = 592, b = 15, D = b;
|
|
1101
1101
|
function N(L) {
|
|
1102
1102
|
return (L >>> 24 & 255) + (L >>> 8 & 65280) + ((L & 65280) << 8) + ((L & 255) << 24);
|
|
1103
1103
|
}
|
|
@@ -1146,7 +1146,7 @@ function Ig() {
|
|
|
1146
1146
|
return g.window === null && (g.wsize = 1 << g.wbits, g.wnext = 0, g.whave = 0, g.window = new t.Buf8(g.wsize)), ne >= g.wsize ? (t.arraySet(g.window, X, F - g.wsize, g.wsize, 0), g.wnext = 0, g.whave = g.wsize) : (Pe = g.wsize - g.wnext, Pe > ne && (Pe = ne), t.arraySet(g.window, X, F - ne, Pe, g.wnext), ne -= Pe, ne ? (t.arraySet(g.window, X, F - ne, ne, 0), g.wnext = ne, g.whave = g.wsize) : (g.wnext += Pe, g.wnext === g.wsize && (g.wnext = 0), g.whave < g.wsize && (g.whave += Pe))), 0;
|
|
1147
1147
|
}
|
|
1148
1148
|
function C(L, X) {
|
|
1149
|
-
var F, ne, Pe, g, G, K, S, R, V, Ae, ve, ge, ut, rn, Dt = 0, lt,
|
|
1149
|
+
var F, ne, Pe, g, G, K, S, R, V, Ae, ve, ge, ut, rn, Dt = 0, lt, zt, Qt, ir, ko, Io, It, yr, Kt = new t.Buf8(4), nn, zr, Bl = (
|
|
1150
1150
|
/* permutation of code lengths */
|
|
1151
1151
|
[16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15]
|
|
1152
1152
|
);
|
|
@@ -1386,7 +1386,7 @@ function Ig() {
|
|
|
1386
1386
|
/* falls through */
|
|
1387
1387
|
case me:
|
|
1388
1388
|
for (; F.have < F.nlen + F.ndist; ) {
|
|
1389
|
-
for (; Dt = F.lencode[R & (1 << F.lenbits) - 1], lt = Dt >>> 24,
|
|
1389
|
+
for (; Dt = F.lencode[R & (1 << F.lenbits) - 1], lt = Dt >>> 24, zt = Dt >>> 16 & 255, Qt = Dt & 65535, !(lt <= V); ) {
|
|
1390
1390
|
if (K === 0)
|
|
1391
1391
|
break e;
|
|
1392
1392
|
K--, R += ne[g++] << V, V += 8;
|
|
@@ -1453,32 +1453,32 @@ function Ig() {
|
|
|
1453
1453
|
L.next_out = G, L.avail_out = S, L.next_in = g, L.avail_in = K, F.hold = R, F.bits = V, n(L, ve), G = L.next_out, Pe = L.output, S = L.avail_out, g = L.next_in, ne = L.input, K = L.avail_in, R = F.hold, V = F.bits, F.mode === re && (F.back = -1);
|
|
1454
1454
|
break;
|
|
1455
1455
|
}
|
|
1456
|
-
for (F.back = 0; Dt = F.lencode[R & (1 << F.lenbits) - 1], lt = Dt >>> 24,
|
|
1456
|
+
for (F.back = 0; Dt = F.lencode[R & (1 << F.lenbits) - 1], lt = Dt >>> 24, zt = Dt >>> 16 & 255, Qt = Dt & 65535, !(lt <= V); ) {
|
|
1457
1457
|
if (K === 0)
|
|
1458
1458
|
break e;
|
|
1459
1459
|
K--, R += ne[g++] << V, V += 8;
|
|
1460
1460
|
}
|
|
1461
|
-
if (
|
|
1462
|
-
for (ir = lt, ko =
|
|
1461
|
+
if (zt && (zt & 240) === 0) {
|
|
1462
|
+
for (ir = lt, ko = zt, Io = Qt; Dt = F.lencode[Io + ((R & (1 << ir + ko) - 1) >> ir)], lt = Dt >>> 24, zt = Dt >>> 16 & 255, Qt = Dt & 65535, !(ir + lt <= V); ) {
|
|
1463
1463
|
if (K === 0)
|
|
1464
1464
|
break e;
|
|
1465
1465
|
K--, R += ne[g++] << V, V += 8;
|
|
1466
1466
|
}
|
|
1467
1467
|
R >>>= ir, V -= ir, F.back += ir;
|
|
1468
1468
|
}
|
|
1469
|
-
if (R >>>= lt, V -= lt, F.back += lt, F.length = Qt,
|
|
1469
|
+
if (R >>>= lt, V -= lt, F.back += lt, F.length = Qt, zt === 0) {
|
|
1470
1470
|
F.mode = ce;
|
|
1471
1471
|
break;
|
|
1472
1472
|
}
|
|
1473
|
-
if (
|
|
1473
|
+
if (zt & 32) {
|
|
1474
1474
|
F.back = -1, F.mode = re;
|
|
1475
1475
|
break;
|
|
1476
1476
|
}
|
|
1477
|
-
if (
|
|
1477
|
+
if (zt & 64) {
|
|
1478
1478
|
L.msg = "invalid literal/length code", F.mode = he;
|
|
1479
1479
|
break;
|
|
1480
1480
|
}
|
|
1481
|
-
F.extra =
|
|
1481
|
+
F.extra = zt & 15, F.mode = Ge;
|
|
1482
1482
|
/* falls through */
|
|
1483
1483
|
case Ge:
|
|
1484
1484
|
if (F.extra) {
|
|
@@ -1492,24 +1492,24 @@ function Ig() {
|
|
|
1492
1492
|
F.was = F.length, F.mode = Xe;
|
|
1493
1493
|
/* falls through */
|
|
1494
1494
|
case Xe:
|
|
1495
|
-
for (; Dt = F.distcode[R & (1 << F.distbits) - 1], lt = Dt >>> 24,
|
|
1495
|
+
for (; Dt = F.distcode[R & (1 << F.distbits) - 1], lt = Dt >>> 24, zt = Dt >>> 16 & 255, Qt = Dt & 65535, !(lt <= V); ) {
|
|
1496
1496
|
if (K === 0)
|
|
1497
1497
|
break e;
|
|
1498
1498
|
K--, R += ne[g++] << V, V += 8;
|
|
1499
1499
|
}
|
|
1500
|
-
if ((
|
|
1501
|
-
for (ir = lt, ko =
|
|
1500
|
+
if ((zt & 240) === 0) {
|
|
1501
|
+
for (ir = lt, ko = zt, Io = Qt; Dt = F.distcode[Io + ((R & (1 << ir + ko) - 1) >> ir)], lt = Dt >>> 24, zt = Dt >>> 16 & 255, Qt = Dt & 65535, !(ir + lt <= V); ) {
|
|
1502
1502
|
if (K === 0)
|
|
1503
1503
|
break e;
|
|
1504
1504
|
K--, R += ne[g++] << V, V += 8;
|
|
1505
1505
|
}
|
|
1506
1506
|
R >>>= ir, V -= ir, F.back += ir;
|
|
1507
1507
|
}
|
|
1508
|
-
if (R >>>= lt, V -= lt, F.back += lt,
|
|
1508
|
+
if (R >>>= lt, V -= lt, F.back += lt, zt & 64) {
|
|
1509
1509
|
L.msg = "invalid distance code", F.mode = he;
|
|
1510
1510
|
break;
|
|
1511
1511
|
}
|
|
1512
|
-
F.offset = Qt, F.extra =
|
|
1512
|
+
F.offset = Qt, F.extra = zt & 15, F.mode = Fe;
|
|
1513
1513
|
/* falls through */
|
|
1514
1514
|
case Fe:
|
|
1515
1515
|
if (F.extra) {
|
|
@@ -1583,7 +1583,7 @@ function Ig() {
|
|
|
1583
1583
|
yr = d;
|
|
1584
1584
|
break e;
|
|
1585
1585
|
case he:
|
|
1586
|
-
yr =
|
|
1586
|
+
yr = m;
|
|
1587
1587
|
break e;
|
|
1588
1588
|
case Oe:
|
|
1589
1589
|
return w;
|
|
@@ -1607,7 +1607,7 @@ function Ig() {
|
|
|
1607
1607
|
}
|
|
1608
1608
|
function fe(L, X) {
|
|
1609
1609
|
var F = X.length, ne, Pe, g;
|
|
1610
|
-
return !L || !L.state || (ne = L.state, ne.wrap !== 0 && ne.mode !== U) ? p : ne.mode === U && (Pe = 1, Pe = e(Pe, X, F, 0), Pe !== ne.check) ?
|
|
1610
|
+
return !L || !L.state || (ne = L.state, ne.wrap !== 0 && ne.mode !== U) ? p : ne.mode === U && (Pe = 1, Pe = e(Pe, X, F, 0), Pe !== ne.check) ? m : (g = er(L, X, F, F), g ? (ne.mode = Oe, w) : (ne.havedict = 1, h));
|
|
1611
1611
|
}
|
|
1612
1612
|
return mr.inflateReset = ye, mr.inflateReset2 = Ue, mr.inflateResetKeep = Y, mr.inflateInit = _e, mr.inflateInit2 = He, mr.inflate = C, mr.inflateEnd = te, mr.inflateGetHeader = ae, mr.inflateSetDictionary = fe, mr.inflateInfo = "pako inflate (from Nodeca project)", mr;
|
|
1613
1613
|
}
|
|
@@ -1687,12 +1687,12 @@ function Rg() {
|
|
|
1687
1687
|
throw new Error(i[v]);
|
|
1688
1688
|
}
|
|
1689
1689
|
u.prototype.push = function(h, d) {
|
|
1690
|
-
var v = this.strm, p = this.options.chunkSize,
|
|
1690
|
+
var v = this.strm, p = this.options.chunkSize, m = this.options.dictionary, w, x, P, A, M, B = !1;
|
|
1691
1691
|
if (this.ended)
|
|
1692
1692
|
return !1;
|
|
1693
1693
|
x = d === ~~d ? d : d === !0 ? n.Z_FINISH : n.Z_NO_FLUSH, typeof h == "string" ? v.input = r.binstring2buf(h) : s.call(h) === "[object ArrayBuffer]" ? v.input = new Uint8Array(h) : v.input = h, v.next_in = 0, v.avail_in = v.input.length;
|
|
1694
1694
|
do {
|
|
1695
|
-
if (v.avail_out === 0 && (v.output = new e.Buf8(p), v.next_out = 0, v.avail_out = p), w = t.inflate(v, n.Z_NO_FLUSH), w === n.Z_NEED_DICT &&
|
|
1695
|
+
if (v.avail_out === 0 && (v.output = new e.Buf8(p), v.next_out = 0, v.avail_out = p), w = t.inflate(v, n.Z_NO_FLUSH), w === n.Z_NEED_DICT && m && (w = t.inflateSetDictionary(this.strm, m)), w === n.Z_BUF_ERROR && B === !0 && (w = n.Z_OK, B = !1), w !== n.Z_STREAM_END && w !== n.Z_OK)
|
|
1696
1696
|
return this.onEnd(w), this.ended = !0, !1;
|
|
1697
1697
|
v.next_out && (v.avail_out === 0 || w === n.Z_STREAM_END || v.avail_in === 0 && (x === n.Z_FINISH || x === n.Z_SYNC_FLUSH)) && (this.options.to === "string" ? (P = r.utf8border(v.output, v.next_out), A = v.next_out - P, M = r.buf2string(v.output, P), v.next_out = A, v.avail_out = p - A, A && e.arraySet(v.output, v.output, P, A, 0), this.onData(M)) : this.onData(e.shrinkBuf(v.output, v.next_out))), v.avail_in === 0 && v.avail_out === 0 && (B = !0);
|
|
1698
1698
|
} while ((v.avail_in > 0 || v.avail_out === 0) && w !== n.Z_STREAM_END);
|
|
@@ -1788,12 +1788,12 @@ var ju = {
|
|
|
1788
1788
|
}
|
|
1789
1789
|
return (p ? -1 : 1) * s * Math.pow(2, o - i);
|
|
1790
1790
|
}, Yg = function(e, r, n, i, a, o) {
|
|
1791
|
-
var s, u, f, l = o * 8 - a - 1, h = (1 << l) - 1, d = h >> 1, v = a === 23 ? Math.pow(2, -24) - Math.pow(2, -77) : 0, p = i ? 0 : o - 1,
|
|
1792
|
-
for (r = Math.abs(r), isNaN(r) || r === 1 / 0 ? (u = isNaN(r) ? 1 : 0, s = h) : (s = Math.floor(Math.log(r) / Math.LN2), r * (f = Math.pow(2, -s)) < 1 && (s--, f *= 2), s + d >= 1 ? r += v / f : r += v * Math.pow(2, 1 - d), r * f >= 2 && (s++, f /= 2), s + d >= h ? (u = 0, s = h) : s + d >= 1 ? (u = (r * f - 1) * Math.pow(2, a), s = s + d) : (u = r * Math.pow(2, d - 1) * Math.pow(2, a), s = 0)); a >= 8; e[n + p] = u & 255, p +=
|
|
1791
|
+
var s, u, f, l = o * 8 - a - 1, h = (1 << l) - 1, d = h >> 1, v = a === 23 ? Math.pow(2, -24) - Math.pow(2, -77) : 0, p = i ? 0 : o - 1, m = i ? 1 : -1, w = r < 0 || r === 0 && 1 / r < 0 ? 1 : 0;
|
|
1792
|
+
for (r = Math.abs(r), isNaN(r) || r === 1 / 0 ? (u = isNaN(r) ? 1 : 0, s = h) : (s = Math.floor(Math.log(r) / Math.LN2), r * (f = Math.pow(2, -s)) < 1 && (s--, f *= 2), s + d >= 1 ? r += v / f : r += v * Math.pow(2, 1 - d), r * f >= 2 && (s++, f /= 2), s + d >= h ? (u = 0, s = h) : s + d >= 1 ? (u = (r * f - 1) * Math.pow(2, a), s = s + d) : (u = r * Math.pow(2, d - 1) * Math.pow(2, a), s = 0)); a >= 8; e[n + p] = u & 255, p += m, u /= 256, a -= 8)
|
|
1793
1793
|
;
|
|
1794
|
-
for (s = s << a | u, l += a; l > 0; e[n + p] = s & 255, p +=
|
|
1794
|
+
for (s = s << a | u, l += a; l > 0; e[n + p] = s & 255, p += m, s /= 256, l -= 8)
|
|
1795
1795
|
;
|
|
1796
|
-
e[n + p -
|
|
1796
|
+
e[n + p - m] |= w * 128;
|
|
1797
1797
|
}, Ri = {
|
|
1798
1798
|
read: Zg,
|
|
1799
1799
|
write: Yg
|
|
@@ -1833,16 +1833,16 @@ var ju = {
|
|
|
1833
1833
|
var y = new Uint8Array(E);
|
|
1834
1834
|
return Object.setPrototypeOf(y, o.prototype), y;
|
|
1835
1835
|
}
|
|
1836
|
-
function o(E, y,
|
|
1836
|
+
function o(E, y, b) {
|
|
1837
1837
|
if (typeof E == "number") {
|
|
1838
1838
|
if (typeof y == "string")
|
|
1839
1839
|
throw new TypeError('The "string" argument must be of type string. Received type number');
|
|
1840
1840
|
return l(E);
|
|
1841
1841
|
}
|
|
1842
|
-
return s(E, y,
|
|
1842
|
+
return s(E, y, b);
|
|
1843
1843
|
}
|
|
1844
1844
|
o.poolSize = 8192;
|
|
1845
|
-
function s(E, y,
|
|
1845
|
+
function s(E, y, b) {
|
|
1846
1846
|
if (typeof E == "string")
|
|
1847
1847
|
return h(E, y);
|
|
1848
1848
|
if (ArrayBuffer.isView(E))
|
|
@@ -1850,20 +1850,20 @@ var ju = {
|
|
|
1850
1850
|
if (E == null)
|
|
1851
1851
|
throw new TypeError("The first argument must be one of type string, Buffer, ArrayBuffer, Array, or Array-like Object. Received type " + typeof E);
|
|
1852
1852
|
if (he(E, ArrayBuffer) || E && he(E.buffer, ArrayBuffer) || typeof SharedArrayBuffer < "u" && (he(E, SharedArrayBuffer) || E && he(E.buffer, SharedArrayBuffer)))
|
|
1853
|
-
return v(E, y,
|
|
1853
|
+
return v(E, y, b);
|
|
1854
1854
|
if (typeof E == "number")
|
|
1855
1855
|
throw new TypeError('The "value" argument must not be of type number. Received type number');
|
|
1856
1856
|
var D = E.valueOf && E.valueOf();
|
|
1857
1857
|
if (D != null && D !== E)
|
|
1858
|
-
return o.from(D, y,
|
|
1858
|
+
return o.from(D, y, b);
|
|
1859
1859
|
var N = p(E);
|
|
1860
1860
|
if (N) return N;
|
|
1861
1861
|
if (typeof Symbol < "u" && Symbol.toPrimitive != null && typeof E[Symbol.toPrimitive] == "function")
|
|
1862
|
-
return o.from(E[Symbol.toPrimitive]("string"), y,
|
|
1862
|
+
return o.from(E[Symbol.toPrimitive]("string"), y, b);
|
|
1863
1863
|
throw new TypeError("The first argument must be one of type string, Buffer, ArrayBuffer, Array, or Array-like Object. Received type " + typeof E);
|
|
1864
1864
|
}
|
|
1865
|
-
o.from = function(E, y,
|
|
1866
|
-
return s(E, y,
|
|
1865
|
+
o.from = function(E, y, b) {
|
|
1866
|
+
return s(E, y, b);
|
|
1867
1867
|
}, Object.setPrototypeOf(o.prototype, Uint8Array.prototype), Object.setPrototypeOf(o, Uint8Array);
|
|
1868
1868
|
function u(E) {
|
|
1869
1869
|
if (typeof E != "number")
|
|
@@ -1871,14 +1871,14 @@ var ju = {
|
|
|
1871
1871
|
if (E < 0)
|
|
1872
1872
|
throw new RangeError('The value "' + E + '" is invalid for option "size"');
|
|
1873
1873
|
}
|
|
1874
|
-
function f(E, y,
|
|
1875
|
-
return u(E), E <= 0 ? a(E) : y !== void 0 ? typeof
|
|
1874
|
+
function f(E, y, b) {
|
|
1875
|
+
return u(E), E <= 0 ? a(E) : y !== void 0 ? typeof b == "string" ? a(E).fill(y, b) : a(E).fill(y) : a(E);
|
|
1876
1876
|
}
|
|
1877
|
-
o.alloc = function(E, y,
|
|
1878
|
-
return f(E, y,
|
|
1877
|
+
o.alloc = function(E, y, b) {
|
|
1878
|
+
return f(E, y, b);
|
|
1879
1879
|
};
|
|
1880
1880
|
function l(E) {
|
|
1881
|
-
return u(E), a(E < 0 ? 0 :
|
|
1881
|
+
return u(E), a(E < 0 ? 0 : m(E) | 0);
|
|
1882
1882
|
}
|
|
1883
1883
|
o.allocUnsafe = function(E) {
|
|
1884
1884
|
return l(E);
|
|
@@ -1888,33 +1888,33 @@ var ju = {
|
|
|
1888
1888
|
function h(E, y) {
|
|
1889
1889
|
if ((typeof y != "string" || y === "") && (y = "utf8"), !o.isEncoding(y))
|
|
1890
1890
|
throw new TypeError("Unknown encoding: " + y);
|
|
1891
|
-
var
|
|
1892
|
-
return N !==
|
|
1891
|
+
var b = x(E, y) | 0, D = a(b), N = D.write(E, y);
|
|
1892
|
+
return N !== b && (D = D.slice(0, N)), D;
|
|
1893
1893
|
}
|
|
1894
1894
|
function d(E) {
|
|
1895
|
-
for (var y = E.length < 0 ? 0 :
|
|
1896
|
-
|
|
1897
|
-
return
|
|
1895
|
+
for (var y = E.length < 0 ? 0 : m(E.length) | 0, b = a(y), D = 0; D < y; D += 1)
|
|
1896
|
+
b[D] = E[D] & 255;
|
|
1897
|
+
return b;
|
|
1898
1898
|
}
|
|
1899
|
-
function v(E, y,
|
|
1899
|
+
function v(E, y, b) {
|
|
1900
1900
|
if (y < 0 || E.byteLength < y)
|
|
1901
1901
|
throw new RangeError('"offset" is outside of buffer bounds');
|
|
1902
|
-
if (E.byteLength < y + (
|
|
1902
|
+
if (E.byteLength < y + (b || 0))
|
|
1903
1903
|
throw new RangeError('"length" is outside of buffer bounds');
|
|
1904
1904
|
var D;
|
|
1905
|
-
return y === void 0 &&
|
|
1905
|
+
return y === void 0 && b === void 0 ? D = new Uint8Array(E) : b === void 0 ? D = new Uint8Array(E, y) : D = new Uint8Array(E, y, b), Object.setPrototypeOf(D, o.prototype), D;
|
|
1906
1906
|
}
|
|
1907
1907
|
function p(E) {
|
|
1908
1908
|
if (o.isBuffer(E)) {
|
|
1909
|
-
var y =
|
|
1910
|
-
return
|
|
1909
|
+
var y = m(E.length) | 0, b = a(y);
|
|
1910
|
+
return b.length === 0 || E.copy(b, 0, 0, y), b;
|
|
1911
1911
|
}
|
|
1912
1912
|
if (E.length !== void 0)
|
|
1913
1913
|
return typeof E.length != "number" || Oe(E.length) ? a(0) : d(E);
|
|
1914
1914
|
if (E.type === "Buffer" && Array.isArray(E.data))
|
|
1915
1915
|
return d(E.data);
|
|
1916
1916
|
}
|
|
1917
|
-
function
|
|
1917
|
+
function m(E) {
|
|
1918
1918
|
if (E >= n)
|
|
1919
1919
|
throw new RangeError("Attempt to allocate Buffer larger than maximum size: 0x" + n.toString(16) + " bytes");
|
|
1920
1920
|
return E | 0;
|
|
@@ -1924,13 +1924,13 @@ var ju = {
|
|
|
1924
1924
|
}
|
|
1925
1925
|
o.isBuffer = function(y) {
|
|
1926
1926
|
return y != null && y._isBuffer === !0 && y !== o.prototype;
|
|
1927
|
-
}, o.compare = function(y,
|
|
1928
|
-
if (he(y, Uint8Array) && (y = o.from(y, y.offset, y.byteLength)), he(
|
|
1927
|
+
}, o.compare = function(y, b) {
|
|
1928
|
+
if (he(y, Uint8Array) && (y = o.from(y, y.offset, y.byteLength)), he(b, Uint8Array) && (b = o.from(b, b.offset, b.byteLength)), !o.isBuffer(y) || !o.isBuffer(b))
|
|
1929
1929
|
throw new TypeError('The "buf1", "buf2" arguments must be one of type Buffer or Uint8Array');
|
|
1930
|
-
if (y ===
|
|
1931
|
-
for (var D = y.length, N =
|
|
1932
|
-
if (y[ee] !==
|
|
1933
|
-
D = y[ee], N =
|
|
1930
|
+
if (y === b) return 0;
|
|
1931
|
+
for (var D = y.length, N = b.length, ee = 0, Y = Math.min(D, N); ee < Y; ++ee)
|
|
1932
|
+
if (y[ee] !== b[ee]) {
|
|
1933
|
+
D = y[ee], N = b[ee];
|
|
1934
1934
|
break;
|
|
1935
1935
|
}
|
|
1936
1936
|
return D < N ? -1 : N < D ? 1 : 0;
|
|
@@ -1951,16 +1951,16 @@ var ju = {
|
|
|
1951
1951
|
default:
|
|
1952
1952
|
return !1;
|
|
1953
1953
|
}
|
|
1954
|
-
}, o.concat = function(y,
|
|
1954
|
+
}, o.concat = function(y, b) {
|
|
1955
1955
|
if (!Array.isArray(y))
|
|
1956
1956
|
throw new TypeError('"list" argument must be an Array of Buffers');
|
|
1957
1957
|
if (y.length === 0)
|
|
1958
1958
|
return o.alloc(0);
|
|
1959
1959
|
var D;
|
|
1960
|
-
if (
|
|
1961
|
-
for (
|
|
1962
|
-
|
|
1963
|
-
var N = o.allocUnsafe(
|
|
1960
|
+
if (b === void 0)
|
|
1961
|
+
for (b = 0, D = 0; D < y.length; ++D)
|
|
1962
|
+
b += y[D].length;
|
|
1963
|
+
var N = o.allocUnsafe(b), ee = 0;
|
|
1964
1964
|
for (D = 0; D < y.length; ++D) {
|
|
1965
1965
|
var Y = y[D];
|
|
1966
1966
|
if (he(Y, Uint8Array) && (Y = o.from(Y)), !o.isBuffer(Y))
|
|
@@ -1976,14 +1976,14 @@ var ju = {
|
|
|
1976
1976
|
return E.byteLength;
|
|
1977
1977
|
if (typeof E != "string")
|
|
1978
1978
|
throw new TypeError('The "string" argument must be one of type string, Buffer, or ArrayBuffer. Received type ' + typeof E);
|
|
1979
|
-
var
|
|
1980
|
-
if (!D &&
|
|
1979
|
+
var b = E.length, D = arguments.length > 2 && arguments[2] === !0;
|
|
1980
|
+
if (!D && b === 0) return 0;
|
|
1981
1981
|
for (var N = !1; ; )
|
|
1982
1982
|
switch (y) {
|
|
1983
1983
|
case "ascii":
|
|
1984
1984
|
case "latin1":
|
|
1985
1985
|
case "binary":
|
|
1986
|
-
return
|
|
1986
|
+
return b;
|
|
1987
1987
|
case "utf8":
|
|
1988
1988
|
case "utf-8":
|
|
1989
1989
|
return Ne(E).length;
|
|
@@ -1991,9 +1991,9 @@ var ju = {
|
|
|
1991
1991
|
case "ucs-2":
|
|
1992
1992
|
case "utf16le":
|
|
1993
1993
|
case "utf-16le":
|
|
1994
|
-
return
|
|
1994
|
+
return b * 2;
|
|
1995
1995
|
case "hex":
|
|
1996
|
-
return
|
|
1996
|
+
return b >>> 1;
|
|
1997
1997
|
case "base64":
|
|
1998
1998
|
return xe(E).length;
|
|
1999
1999
|
default:
|
|
@@ -2003,59 +2003,59 @@ var ju = {
|
|
|
2003
2003
|
}
|
|
2004
2004
|
}
|
|
2005
2005
|
o.byteLength = x;
|
|
2006
|
-
function P(E, y,
|
|
2006
|
+
function P(E, y, b) {
|
|
2007
2007
|
var D = !1;
|
|
2008
|
-
if ((y === void 0 || y < 0) && (y = 0), y > this.length || ((
|
|
2008
|
+
if ((y === void 0 || y < 0) && (y = 0), y > this.length || ((b === void 0 || b > this.length) && (b = this.length), b <= 0) || (b >>>= 0, y >>>= 0, b <= y))
|
|
2009
2009
|
return "";
|
|
2010
2010
|
for (E || (E = "utf8"); ; )
|
|
2011
2011
|
switch (E) {
|
|
2012
2012
|
case "hex":
|
|
2013
|
-
return de(this, y,
|
|
2013
|
+
return de(this, y, b);
|
|
2014
2014
|
case "utf8":
|
|
2015
2015
|
case "utf-8":
|
|
2016
|
-
return U(this, y,
|
|
2016
|
+
return U(this, y, b);
|
|
2017
2017
|
case "ascii":
|
|
2018
|
-
return $(this, y,
|
|
2018
|
+
return $(this, y, b);
|
|
2019
2019
|
case "latin1":
|
|
2020
2020
|
case "binary":
|
|
2021
|
-
return Q(this, y,
|
|
2021
|
+
return Q(this, y, b);
|
|
2022
2022
|
case "base64":
|
|
2023
|
-
return Z(this, y,
|
|
2023
|
+
return Z(this, y, b);
|
|
2024
2024
|
case "ucs2":
|
|
2025
2025
|
case "ucs-2":
|
|
2026
2026
|
case "utf16le":
|
|
2027
2027
|
case "utf-16le":
|
|
2028
|
-
return pe(this, y,
|
|
2028
|
+
return pe(this, y, b);
|
|
2029
2029
|
default:
|
|
2030
2030
|
if (D) throw new TypeError("Unknown encoding: " + E);
|
|
2031
2031
|
E = (E + "").toLowerCase(), D = !0;
|
|
2032
2032
|
}
|
|
2033
2033
|
}
|
|
2034
2034
|
o.prototype._isBuffer = !0;
|
|
2035
|
-
function A(E, y,
|
|
2035
|
+
function A(E, y, b) {
|
|
2036
2036
|
var D = E[y];
|
|
2037
|
-
E[y] = E[
|
|
2037
|
+
E[y] = E[b], E[b] = D;
|
|
2038
2038
|
}
|
|
2039
2039
|
o.prototype.swap16 = function() {
|
|
2040
2040
|
var y = this.length;
|
|
2041
2041
|
if (y % 2 !== 0)
|
|
2042
2042
|
throw new RangeError("Buffer size must be a multiple of 16-bits");
|
|
2043
|
-
for (var
|
|
2044
|
-
A(this,
|
|
2043
|
+
for (var b = 0; b < y; b += 2)
|
|
2044
|
+
A(this, b, b + 1);
|
|
2045
2045
|
return this;
|
|
2046
2046
|
}, o.prototype.swap32 = function() {
|
|
2047
2047
|
var y = this.length;
|
|
2048
2048
|
if (y % 4 !== 0)
|
|
2049
2049
|
throw new RangeError("Buffer size must be a multiple of 32-bits");
|
|
2050
|
-
for (var
|
|
2051
|
-
A(this,
|
|
2050
|
+
for (var b = 0; b < y; b += 4)
|
|
2051
|
+
A(this, b, b + 3), A(this, b + 1, b + 2);
|
|
2052
2052
|
return this;
|
|
2053
2053
|
}, o.prototype.swap64 = function() {
|
|
2054
2054
|
var y = this.length;
|
|
2055
2055
|
if (y % 8 !== 0)
|
|
2056
2056
|
throw new RangeError("Buffer size must be a multiple of 64-bits");
|
|
2057
|
-
for (var
|
|
2058
|
-
A(this,
|
|
2057
|
+
for (var b = 0; b < y; b += 8)
|
|
2058
|
+
A(this, b, b + 7), A(this, b + 1, b + 6), A(this, b + 2, b + 5), A(this, b + 3, b + 4);
|
|
2059
2059
|
return this;
|
|
2060
2060
|
}, o.prototype.toString = function() {
|
|
2061
2061
|
var y = this.length;
|
|
@@ -2064,47 +2064,47 @@ var ju = {
|
|
|
2064
2064
|
if (!o.isBuffer(y)) throw new TypeError("Argument must be a Buffer");
|
|
2065
2065
|
return this === y ? !0 : o.compare(this, y) === 0;
|
|
2066
2066
|
}, o.prototype.inspect = function() {
|
|
2067
|
-
var y = "",
|
|
2068
|
-
return y = this.toString("hex", 0,
|
|
2069
|
-
}, r && (o.prototype[r] = o.prototype.inspect), o.prototype.compare = function(y,
|
|
2067
|
+
var y = "", b = e.INSPECT_MAX_BYTES;
|
|
2068
|
+
return y = this.toString("hex", 0, b).replace(/(.{2})/g, "$1 ").trim(), this.length > b && (y += " ... "), "<Buffer " + y + ">";
|
|
2069
|
+
}, r && (o.prototype[r] = o.prototype.inspect), o.prototype.compare = function(y, b, D, N, ee) {
|
|
2070
2070
|
if (he(y, Uint8Array) && (y = o.from(y, y.offset, y.byteLength)), !o.isBuffer(y))
|
|
2071
2071
|
throw new TypeError('The "target" argument must be one of type Buffer or Uint8Array. Received type ' + typeof y);
|
|
2072
|
-
if (
|
|
2072
|
+
if (b === void 0 && (b = 0), D === void 0 && (D = y ? y.length : 0), N === void 0 && (N = 0), ee === void 0 && (ee = this.length), b < 0 || D > y.length || N < 0 || ee > this.length)
|
|
2073
2073
|
throw new RangeError("out of range index");
|
|
2074
|
-
if (N >= ee &&
|
|
2074
|
+
if (N >= ee && b >= D)
|
|
2075
2075
|
return 0;
|
|
2076
2076
|
if (N >= ee)
|
|
2077
2077
|
return -1;
|
|
2078
|
-
if (
|
|
2078
|
+
if (b >= D)
|
|
2079
2079
|
return 1;
|
|
2080
|
-
if (
|
|
2081
|
-
for (var Y = ee - N, ye = D -
|
|
2080
|
+
if (b >>>= 0, D >>>= 0, N >>>= 0, ee >>>= 0, this === y) return 0;
|
|
2081
|
+
for (var Y = ee - N, ye = D - b, Ue = Math.min(Y, ye), He = this.slice(N, ee), _e = y.slice(b, D), Qe = 0; Qe < Ue; ++Qe)
|
|
2082
2082
|
if (He[Qe] !== _e[Qe]) {
|
|
2083
2083
|
Y = He[Qe], ye = _e[Qe];
|
|
2084
2084
|
break;
|
|
2085
2085
|
}
|
|
2086
2086
|
return Y < ye ? -1 : ye < Y ? 1 : 0;
|
|
2087
2087
|
};
|
|
2088
|
-
function M(E, y,
|
|
2088
|
+
function M(E, y, b, D, N) {
|
|
2089
2089
|
if (E.length === 0) return -1;
|
|
2090
|
-
if (typeof
|
|
2090
|
+
if (typeof b == "string" ? (D = b, b = 0) : b > 2147483647 ? b = 2147483647 : b < -2147483648 && (b = -2147483648), b = +b, Oe(b) && (b = N ? 0 : E.length - 1), b < 0 && (b = E.length + b), b >= E.length) {
|
|
2091
2091
|
if (N) return -1;
|
|
2092
|
-
|
|
2093
|
-
} else if (
|
|
2094
|
-
if (N)
|
|
2092
|
+
b = E.length - 1;
|
|
2093
|
+
} else if (b < 0)
|
|
2094
|
+
if (N) b = 0;
|
|
2095
2095
|
else return -1;
|
|
2096
2096
|
if (typeof y == "string" && (y = o.from(y, D)), o.isBuffer(y))
|
|
2097
|
-
return y.length === 0 ? -1 : B(E, y,
|
|
2097
|
+
return y.length === 0 ? -1 : B(E, y, b, D, N);
|
|
2098
2098
|
if (typeof y == "number")
|
|
2099
|
-
return y = y & 255, typeof Uint8Array.prototype.indexOf == "function" ? N ? Uint8Array.prototype.indexOf.call(E, y,
|
|
2099
|
+
return y = y & 255, typeof Uint8Array.prototype.indexOf == "function" ? N ? Uint8Array.prototype.indexOf.call(E, y, b) : Uint8Array.prototype.lastIndexOf.call(E, y, b) : B(E, [y], b, D, N);
|
|
2100
2100
|
throw new TypeError("val must be string, number or Buffer");
|
|
2101
2101
|
}
|
|
2102
|
-
function B(E, y,
|
|
2102
|
+
function B(E, y, b, D, N) {
|
|
2103
2103
|
var ee = 1, Y = E.length, ye = y.length;
|
|
2104
2104
|
if (D !== void 0 && (D = String(D).toLowerCase(), D === "ucs2" || D === "ucs-2" || D === "utf16le" || D === "utf-16le")) {
|
|
2105
2105
|
if (E.length < 2 || y.length < 2)
|
|
2106
2106
|
return -1;
|
|
2107
|
-
ee = 2, Y /= 2, ye /= 2,
|
|
2107
|
+
ee = 2, Y /= 2, ye /= 2, b /= 2;
|
|
2108
2108
|
}
|
|
2109
2109
|
function Ue(wt, St) {
|
|
2110
2110
|
return ee === 1 ? wt[St] : wt.readUInt16BE(St * ee);
|
|
@@ -2112,13 +2112,13 @@ var ju = {
|
|
|
2112
2112
|
var He;
|
|
2113
2113
|
if (N) {
|
|
2114
2114
|
var _e = -1;
|
|
2115
|
-
for (He =
|
|
2115
|
+
for (He = b; He < Y; He++)
|
|
2116
2116
|
if (Ue(E, He) === Ue(y, _e === -1 ? 0 : He - _e)) {
|
|
2117
2117
|
if (_e === -1 && (_e = He), He - _e + 1 === ye) return _e * ee;
|
|
2118
2118
|
} else
|
|
2119
2119
|
_e !== -1 && (He -= He - _e), _e = -1;
|
|
2120
2120
|
} else
|
|
2121
|
-
for (
|
|
2121
|
+
for (b + ye > Y && (b = Y - ye), He = b; He >= 0; He--) {
|
|
2122
2122
|
for (var Qe = !0, Ct = 0; Ct < ye; Ct++)
|
|
2123
2123
|
if (Ue(E, He + Ct) !== Ue(y, Ct)) {
|
|
2124
2124
|
Qe = !1;
|
|
@@ -2128,73 +2128,73 @@ var ju = {
|
|
|
2128
2128
|
}
|
|
2129
2129
|
return -1;
|
|
2130
2130
|
}
|
|
2131
|
-
o.prototype.includes = function(y,
|
|
2132
|
-
return this.indexOf(y,
|
|
2133
|
-
}, o.prototype.indexOf = function(y,
|
|
2134
|
-
return M(this, y,
|
|
2135
|
-
}, o.prototype.lastIndexOf = function(y,
|
|
2136
|
-
return M(this, y,
|
|
2131
|
+
o.prototype.includes = function(y, b, D) {
|
|
2132
|
+
return this.indexOf(y, b, D) !== -1;
|
|
2133
|
+
}, o.prototype.indexOf = function(y, b, D) {
|
|
2134
|
+
return M(this, y, b, D, !0);
|
|
2135
|
+
}, o.prototype.lastIndexOf = function(y, b, D) {
|
|
2136
|
+
return M(this, y, b, D, !1);
|
|
2137
2137
|
};
|
|
2138
|
-
function k(E, y,
|
|
2139
|
-
|
|
2140
|
-
var N = E.length -
|
|
2138
|
+
function k(E, y, b, D) {
|
|
2139
|
+
b = Number(b) || 0;
|
|
2140
|
+
var N = E.length - b;
|
|
2141
2141
|
D ? (D = Number(D), D > N && (D = N)) : D = N;
|
|
2142
2142
|
var ee = y.length;
|
|
2143
2143
|
D > ee / 2 && (D = ee / 2);
|
|
2144
2144
|
for (var Y = 0; Y < D; ++Y) {
|
|
2145
2145
|
var ye = parseInt(y.substr(Y * 2, 2), 16);
|
|
2146
2146
|
if (Oe(ye)) return Y;
|
|
2147
|
-
E[
|
|
2147
|
+
E[b + Y] = ye;
|
|
2148
2148
|
}
|
|
2149
2149
|
return Y;
|
|
2150
2150
|
}
|
|
2151
|
-
function I(E, y,
|
|
2152
|
-
return Re(Ne(y, E.length -
|
|
2151
|
+
function I(E, y, b, D) {
|
|
2152
|
+
return Re(Ne(y, E.length - b), E, b, D);
|
|
2153
2153
|
}
|
|
2154
|
-
function j(E, y,
|
|
2155
|
-
return Re(ce(y), E,
|
|
2154
|
+
function j(E, y, b, D) {
|
|
2155
|
+
return Re(ce(y), E, b, D);
|
|
2156
2156
|
}
|
|
2157
|
-
function H(E, y,
|
|
2158
|
-
return j(E, y,
|
|
2157
|
+
function H(E, y, b, D) {
|
|
2158
|
+
return j(E, y, b, D);
|
|
2159
2159
|
}
|
|
2160
|
-
function W(E, y,
|
|
2161
|
-
return Re(xe(y), E,
|
|
2160
|
+
function W(E, y, b, D) {
|
|
2161
|
+
return Re(xe(y), E, b, D);
|
|
2162
2162
|
}
|
|
2163
|
-
function q(E, y,
|
|
2164
|
-
return Re(Te(y, E.length -
|
|
2163
|
+
function q(E, y, b, D) {
|
|
2164
|
+
return Re(Te(y, E.length - b), E, b, D);
|
|
2165
2165
|
}
|
|
2166
|
-
o.prototype.write = function(y,
|
|
2167
|
-
if (
|
|
2168
|
-
N = "utf8", D = this.length,
|
|
2169
|
-
else if (D === void 0 && typeof
|
|
2170
|
-
N =
|
|
2171
|
-
else if (isFinite(
|
|
2172
|
-
|
|
2166
|
+
o.prototype.write = function(y, b, D, N) {
|
|
2167
|
+
if (b === void 0)
|
|
2168
|
+
N = "utf8", D = this.length, b = 0;
|
|
2169
|
+
else if (D === void 0 && typeof b == "string")
|
|
2170
|
+
N = b, D = this.length, b = 0;
|
|
2171
|
+
else if (isFinite(b))
|
|
2172
|
+
b = b >>> 0, isFinite(D) ? (D = D >>> 0, N === void 0 && (N = "utf8")) : (N = D, D = void 0);
|
|
2173
2173
|
else
|
|
2174
2174
|
throw new Error("Buffer.write(string, encoding, offset[, length]) is no longer supported");
|
|
2175
|
-
var ee = this.length -
|
|
2176
|
-
if ((D === void 0 || D > ee) && (D = ee), y.length > 0 && (D < 0 ||
|
|
2175
|
+
var ee = this.length - b;
|
|
2176
|
+
if ((D === void 0 || D > ee) && (D = ee), y.length > 0 && (D < 0 || b < 0) || b > this.length)
|
|
2177
2177
|
throw new RangeError("Attempt to write outside buffer bounds");
|
|
2178
2178
|
N || (N = "utf8");
|
|
2179
2179
|
for (var Y = !1; ; )
|
|
2180
2180
|
switch (N) {
|
|
2181
2181
|
case "hex":
|
|
2182
|
-
return k(this, y,
|
|
2182
|
+
return k(this, y, b, D);
|
|
2183
2183
|
case "utf8":
|
|
2184
2184
|
case "utf-8":
|
|
2185
|
-
return I(this, y,
|
|
2185
|
+
return I(this, y, b, D);
|
|
2186
2186
|
case "ascii":
|
|
2187
|
-
return j(this, y,
|
|
2187
|
+
return j(this, y, b, D);
|
|
2188
2188
|
case "latin1":
|
|
2189
2189
|
case "binary":
|
|
2190
|
-
return H(this, y,
|
|
2190
|
+
return H(this, y, b, D);
|
|
2191
2191
|
case "base64":
|
|
2192
|
-
return W(this, y,
|
|
2192
|
+
return W(this, y, b, D);
|
|
2193
2193
|
case "ucs2":
|
|
2194
2194
|
case "ucs-2":
|
|
2195
2195
|
case "utf16le":
|
|
2196
2196
|
case "utf-16le":
|
|
2197
|
-
return q(this, y,
|
|
2197
|
+
return q(this, y, b, D);
|
|
2198
2198
|
default:
|
|
2199
2199
|
if (Y) throw new TypeError("Unknown encoding: " + N);
|
|
2200
2200
|
N = ("" + N).toLowerCase(), Y = !0;
|
|
@@ -2205,14 +2205,14 @@ var ju = {
|
|
|
2205
2205
|
data: Array.prototype.slice.call(this._arr || this, 0)
|
|
2206
2206
|
};
|
|
2207
2207
|
};
|
|
2208
|
-
function Z(E, y,
|
|
2209
|
-
return y === 0 &&
|
|
2208
|
+
function Z(E, y, b) {
|
|
2209
|
+
return y === 0 && b === E.length ? ju.fromByteArray(E) : ju.fromByteArray(E.slice(y, b));
|
|
2210
2210
|
}
|
|
2211
|
-
function U(E, y,
|
|
2212
|
-
|
|
2213
|
-
for (var D = [], N = y; N <
|
|
2211
|
+
function U(E, y, b) {
|
|
2212
|
+
b = Math.min(E.length, b);
|
|
2213
|
+
for (var D = [], N = y; N < b; ) {
|
|
2214
2214
|
var ee = E[N], Y = null, ye = ee > 239 ? 4 : ee > 223 ? 3 : ee > 191 ? 2 : 1;
|
|
2215
|
-
if (N + ye <=
|
|
2215
|
+
if (N + ye <= b) {
|
|
2216
2216
|
var Ue, He, _e, Qe;
|
|
2217
2217
|
switch (ye) {
|
|
2218
2218
|
case 1:
|
|
@@ -2237,200 +2237,200 @@ var ju = {
|
|
|
2237
2237
|
var y = E.length;
|
|
2238
2238
|
if (y <= re)
|
|
2239
2239
|
return String.fromCharCode.apply(String, E);
|
|
2240
|
-
for (var
|
|
2241
|
-
|
|
2242
|
-
return
|
|
2240
|
+
for (var b = "", D = 0; D < y; )
|
|
2241
|
+
b += String.fromCharCode.apply(String, E.slice(D, D += re));
|
|
2242
|
+
return b;
|
|
2243
2243
|
}
|
|
2244
|
-
function $(E, y,
|
|
2244
|
+
function $(E, y, b) {
|
|
2245
2245
|
var D = "";
|
|
2246
|
-
|
|
2247
|
-
for (var N = y; N <
|
|
2246
|
+
b = Math.min(E.length, b);
|
|
2247
|
+
for (var N = y; N < b; ++N)
|
|
2248
2248
|
D += String.fromCharCode(E[N] & 127);
|
|
2249
2249
|
return D;
|
|
2250
2250
|
}
|
|
2251
|
-
function Q(E, y,
|
|
2251
|
+
function Q(E, y, b) {
|
|
2252
2252
|
var D = "";
|
|
2253
|
-
|
|
2254
|
-
for (var N = y; N <
|
|
2253
|
+
b = Math.min(E.length, b);
|
|
2254
|
+
for (var N = y; N < b; ++N)
|
|
2255
2255
|
D += String.fromCharCode(E[N]);
|
|
2256
2256
|
return D;
|
|
2257
2257
|
}
|
|
2258
|
-
function de(E, y,
|
|
2258
|
+
function de(E, y, b) {
|
|
2259
2259
|
var D = E.length;
|
|
2260
|
-
(!y || y < 0) && (y = 0), (!
|
|
2261
|
-
for (var N = "", ee = y; ee <
|
|
2260
|
+
(!y || y < 0) && (y = 0), (!b || b < 0 || b > D) && (b = D);
|
|
2261
|
+
for (var N = "", ee = y; ee < b; ++ee)
|
|
2262
2262
|
N += gt[E[ee]];
|
|
2263
2263
|
return N;
|
|
2264
2264
|
}
|
|
2265
|
-
function pe(E, y,
|
|
2266
|
-
for (var D = E.slice(y,
|
|
2265
|
+
function pe(E, y, b) {
|
|
2266
|
+
for (var D = E.slice(y, b), N = "", ee = 0; ee < D.length; ee += 2)
|
|
2267
2267
|
N += String.fromCharCode(D[ee] + D[ee + 1] * 256);
|
|
2268
2268
|
return N;
|
|
2269
2269
|
}
|
|
2270
|
-
o.prototype.slice = function(y,
|
|
2270
|
+
o.prototype.slice = function(y, b) {
|
|
2271
2271
|
var D = this.length;
|
|
2272
|
-
y = ~~y,
|
|
2273
|
-
var N = this.subarray(y,
|
|
2272
|
+
y = ~~y, b = b === void 0 ? D : ~~b, y < 0 ? (y += D, y < 0 && (y = 0)) : y > D && (y = D), b < 0 ? (b += D, b < 0 && (b = 0)) : b > D && (b = D), b < y && (b = y);
|
|
2273
|
+
var N = this.subarray(y, b);
|
|
2274
2274
|
return Object.setPrototypeOf(N, o.prototype), N;
|
|
2275
2275
|
};
|
|
2276
|
-
function we(E, y,
|
|
2276
|
+
function we(E, y, b) {
|
|
2277
2277
|
if (E % 1 !== 0 || E < 0) throw new RangeError("offset is not uint");
|
|
2278
|
-
if (E + y >
|
|
2278
|
+
if (E + y > b) throw new RangeError("Trying to access beyond buffer length");
|
|
2279
2279
|
}
|
|
2280
|
-
o.prototype.readUIntLE = function(y,
|
|
2281
|
-
y = y >>> 0,
|
|
2282
|
-
for (var N = this[y], ee = 1, Y = 0; ++Y <
|
|
2280
|
+
o.prototype.readUIntLE = function(y, b, D) {
|
|
2281
|
+
y = y >>> 0, b = b >>> 0, D || we(y, b, this.length);
|
|
2282
|
+
for (var N = this[y], ee = 1, Y = 0; ++Y < b && (ee *= 256); )
|
|
2283
2283
|
N += this[y + Y] * ee;
|
|
2284
2284
|
return N;
|
|
2285
|
-
}, o.prototype.readUIntBE = function(y,
|
|
2286
|
-
y = y >>> 0,
|
|
2287
|
-
for (var N = this[y + --
|
|
2288
|
-
N += this[y + --
|
|
2285
|
+
}, o.prototype.readUIntBE = function(y, b, D) {
|
|
2286
|
+
y = y >>> 0, b = b >>> 0, D || we(y, b, this.length);
|
|
2287
|
+
for (var N = this[y + --b], ee = 1; b > 0 && (ee *= 256); )
|
|
2288
|
+
N += this[y + --b] * ee;
|
|
2289
2289
|
return N;
|
|
2290
|
-
}, o.prototype.readUInt8 = function(y,
|
|
2291
|
-
return y = y >>> 0,
|
|
2292
|
-
}, o.prototype.readUInt16LE = function(y,
|
|
2293
|
-
return y = y >>> 0,
|
|
2294
|
-
}, o.prototype.readUInt16BE = function(y,
|
|
2295
|
-
return y = y >>> 0,
|
|
2296
|
-
}, o.prototype.readUInt32LE = function(y,
|
|
2297
|
-
return y = y >>> 0,
|
|
2298
|
-
}, o.prototype.readUInt32BE = function(y,
|
|
2299
|
-
return y = y >>> 0,
|
|
2300
|
-
}, o.prototype.readIntLE = function(y,
|
|
2301
|
-
y = y >>> 0,
|
|
2302
|
-
for (var N = this[y], ee = 1, Y = 0; ++Y <
|
|
2290
|
+
}, o.prototype.readUInt8 = function(y, b) {
|
|
2291
|
+
return y = y >>> 0, b || we(y, 1, this.length), this[y];
|
|
2292
|
+
}, o.prototype.readUInt16LE = function(y, b) {
|
|
2293
|
+
return y = y >>> 0, b || we(y, 2, this.length), this[y] | this[y + 1] << 8;
|
|
2294
|
+
}, o.prototype.readUInt16BE = function(y, b) {
|
|
2295
|
+
return y = y >>> 0, b || we(y, 2, this.length), this[y] << 8 | this[y + 1];
|
|
2296
|
+
}, o.prototype.readUInt32LE = function(y, b) {
|
|
2297
|
+
return y = y >>> 0, b || we(y, 4, this.length), (this[y] | this[y + 1] << 8 | this[y + 2] << 16) + this[y + 3] * 16777216;
|
|
2298
|
+
}, o.prototype.readUInt32BE = function(y, b) {
|
|
2299
|
+
return y = y >>> 0, b || we(y, 4, this.length), this[y] * 16777216 + (this[y + 1] << 16 | this[y + 2] << 8 | this[y + 3]);
|
|
2300
|
+
}, o.prototype.readIntLE = function(y, b, D) {
|
|
2301
|
+
y = y >>> 0, b = b >>> 0, D || we(y, b, this.length);
|
|
2302
|
+
for (var N = this[y], ee = 1, Y = 0; ++Y < b && (ee *= 256); )
|
|
2303
2303
|
N += this[y + Y] * ee;
|
|
2304
|
-
return ee *= 128, N >= ee && (N -= Math.pow(2, 8 *
|
|
2305
|
-
}, o.prototype.readIntBE = function(y,
|
|
2306
|
-
y = y >>> 0,
|
|
2307
|
-
for (var N =
|
|
2304
|
+
return ee *= 128, N >= ee && (N -= Math.pow(2, 8 * b)), N;
|
|
2305
|
+
}, o.prototype.readIntBE = function(y, b, D) {
|
|
2306
|
+
y = y >>> 0, b = b >>> 0, D || we(y, b, this.length);
|
|
2307
|
+
for (var N = b, ee = 1, Y = this[y + --N]; N > 0 && (ee *= 256); )
|
|
2308
2308
|
Y += this[y + --N] * ee;
|
|
2309
|
-
return ee *= 128, Y >= ee && (Y -= Math.pow(2, 8 *
|
|
2310
|
-
}, o.prototype.readInt8 = function(y,
|
|
2311
|
-
return y = y >>> 0,
|
|
2312
|
-
}, o.prototype.readInt16LE = function(y,
|
|
2313
|
-
y = y >>> 0,
|
|
2309
|
+
return ee *= 128, Y >= ee && (Y -= Math.pow(2, 8 * b)), Y;
|
|
2310
|
+
}, o.prototype.readInt8 = function(y, b) {
|
|
2311
|
+
return y = y >>> 0, b || we(y, 1, this.length), this[y] & 128 ? (255 - this[y] + 1) * -1 : this[y];
|
|
2312
|
+
}, o.prototype.readInt16LE = function(y, b) {
|
|
2313
|
+
y = y >>> 0, b || we(y, 2, this.length);
|
|
2314
2314
|
var D = this[y] | this[y + 1] << 8;
|
|
2315
2315
|
return D & 32768 ? D | 4294901760 : D;
|
|
2316
|
-
}, o.prototype.readInt16BE = function(y,
|
|
2317
|
-
y = y >>> 0,
|
|
2316
|
+
}, o.prototype.readInt16BE = function(y, b) {
|
|
2317
|
+
y = y >>> 0, b || we(y, 2, this.length);
|
|
2318
2318
|
var D = this[y + 1] | this[y] << 8;
|
|
2319
2319
|
return D & 32768 ? D | 4294901760 : D;
|
|
2320
|
-
}, o.prototype.readInt32LE = function(y,
|
|
2321
|
-
return y = y >>> 0,
|
|
2322
|
-
}, o.prototype.readInt32BE = function(y,
|
|
2323
|
-
return y = y >>> 0,
|
|
2324
|
-
}, o.prototype.readFloatLE = function(y,
|
|
2325
|
-
return y = y >>> 0,
|
|
2326
|
-
}, o.prototype.readFloatBE = function(y,
|
|
2327
|
-
return y = y >>> 0,
|
|
2328
|
-
}, o.prototype.readDoubleLE = function(y,
|
|
2329
|
-
return y = y >>> 0,
|
|
2330
|
-
}, o.prototype.readDoubleBE = function(y,
|
|
2331
|
-
return y = y >>> 0,
|
|
2320
|
+
}, o.prototype.readInt32LE = function(y, b) {
|
|
2321
|
+
return y = y >>> 0, b || we(y, 4, this.length), this[y] | this[y + 1] << 8 | this[y + 2] << 16 | this[y + 3] << 24;
|
|
2322
|
+
}, o.prototype.readInt32BE = function(y, b) {
|
|
2323
|
+
return y = y >>> 0, b || we(y, 4, this.length), this[y] << 24 | this[y + 1] << 16 | this[y + 2] << 8 | this[y + 3];
|
|
2324
|
+
}, o.prototype.readFloatLE = function(y, b) {
|
|
2325
|
+
return y = y >>> 0, b || we(y, 4, this.length), Ri.read(this, y, !0, 23, 4);
|
|
2326
|
+
}, o.prototype.readFloatBE = function(y, b) {
|
|
2327
|
+
return y = y >>> 0, b || we(y, 4, this.length), Ri.read(this, y, !1, 23, 4);
|
|
2328
|
+
}, o.prototype.readDoubleLE = function(y, b) {
|
|
2329
|
+
return y = y >>> 0, b || we(y, 8, this.length), Ri.read(this, y, !0, 52, 8);
|
|
2330
|
+
}, o.prototype.readDoubleBE = function(y, b) {
|
|
2331
|
+
return y = y >>> 0, b || we(y, 8, this.length), Ri.read(this, y, !1, 52, 8);
|
|
2332
2332
|
};
|
|
2333
|
-
function me(E, y,
|
|
2333
|
+
function me(E, y, b, D, N, ee) {
|
|
2334
2334
|
if (!o.isBuffer(E)) throw new TypeError('"buffer" argument must be a Buffer instance');
|
|
2335
2335
|
if (y > N || y < ee) throw new RangeError('"value" argument is out of bounds');
|
|
2336
|
-
if (
|
|
2336
|
+
if (b + D > E.length) throw new RangeError("Index out of range");
|
|
2337
2337
|
}
|
|
2338
|
-
o.prototype.writeUIntLE = function(y,
|
|
2339
|
-
if (y = +y,
|
|
2338
|
+
o.prototype.writeUIntLE = function(y, b, D, N) {
|
|
2339
|
+
if (y = +y, b = b >>> 0, D = D >>> 0, !N) {
|
|
2340
2340
|
var ee = Math.pow(2, 8 * D) - 1;
|
|
2341
|
-
me(this, y,
|
|
2341
|
+
me(this, y, b, D, ee, 0);
|
|
2342
2342
|
}
|
|
2343
2343
|
var Y = 1, ye = 0;
|
|
2344
|
-
for (this[
|
|
2345
|
-
this[
|
|
2346
|
-
return
|
|
2347
|
-
}, o.prototype.writeUIntBE = function(y,
|
|
2348
|
-
if (y = +y,
|
|
2344
|
+
for (this[b] = y & 255; ++ye < D && (Y *= 256); )
|
|
2345
|
+
this[b + ye] = y / Y & 255;
|
|
2346
|
+
return b + D;
|
|
2347
|
+
}, o.prototype.writeUIntBE = function(y, b, D, N) {
|
|
2348
|
+
if (y = +y, b = b >>> 0, D = D >>> 0, !N) {
|
|
2349
2349
|
var ee = Math.pow(2, 8 * D) - 1;
|
|
2350
|
-
me(this, y,
|
|
2350
|
+
me(this, y, b, D, ee, 0);
|
|
2351
2351
|
}
|
|
2352
2352
|
var Y = D - 1, ye = 1;
|
|
2353
|
-
for (this[
|
|
2354
|
-
this[
|
|
2355
|
-
return
|
|
2356
|
-
}, o.prototype.writeUInt8 = function(y,
|
|
2357
|
-
return y = +y,
|
|
2358
|
-
}, o.prototype.writeUInt16LE = function(y,
|
|
2359
|
-
return y = +y,
|
|
2360
|
-
}, o.prototype.writeUInt16BE = function(y,
|
|
2361
|
-
return y = +y,
|
|
2362
|
-
}, o.prototype.writeUInt32LE = function(y,
|
|
2363
|
-
return y = +y,
|
|
2364
|
-
}, o.prototype.writeUInt32BE = function(y,
|
|
2365
|
-
return y = +y,
|
|
2366
|
-
}, o.prototype.writeIntLE = function(y,
|
|
2367
|
-
if (y = +y,
|
|
2353
|
+
for (this[b + Y] = y & 255; --Y >= 0 && (ye *= 256); )
|
|
2354
|
+
this[b + Y] = y / ye & 255;
|
|
2355
|
+
return b + D;
|
|
2356
|
+
}, o.prototype.writeUInt8 = function(y, b, D) {
|
|
2357
|
+
return y = +y, b = b >>> 0, D || me(this, y, b, 1, 255, 0), this[b] = y & 255, b + 1;
|
|
2358
|
+
}, o.prototype.writeUInt16LE = function(y, b, D) {
|
|
2359
|
+
return y = +y, b = b >>> 0, D || me(this, y, b, 2, 65535, 0), this[b] = y & 255, this[b + 1] = y >>> 8, b + 2;
|
|
2360
|
+
}, o.prototype.writeUInt16BE = function(y, b, D) {
|
|
2361
|
+
return y = +y, b = b >>> 0, D || me(this, y, b, 2, 65535, 0), this[b] = y >>> 8, this[b + 1] = y & 255, b + 2;
|
|
2362
|
+
}, o.prototype.writeUInt32LE = function(y, b, D) {
|
|
2363
|
+
return y = +y, b = b >>> 0, D || me(this, y, b, 4, 4294967295, 0), this[b + 3] = y >>> 24, this[b + 2] = y >>> 16, this[b + 1] = y >>> 8, this[b] = y & 255, b + 4;
|
|
2364
|
+
}, o.prototype.writeUInt32BE = function(y, b, D) {
|
|
2365
|
+
return y = +y, b = b >>> 0, D || me(this, y, b, 4, 4294967295, 0), this[b] = y >>> 24, this[b + 1] = y >>> 16, this[b + 2] = y >>> 8, this[b + 3] = y & 255, b + 4;
|
|
2366
|
+
}, o.prototype.writeIntLE = function(y, b, D, N) {
|
|
2367
|
+
if (y = +y, b = b >>> 0, !N) {
|
|
2368
2368
|
var ee = Math.pow(2, 8 * D - 1);
|
|
2369
|
-
me(this, y,
|
|
2369
|
+
me(this, y, b, D, ee - 1, -ee);
|
|
2370
2370
|
}
|
|
2371
2371
|
var Y = 0, ye = 1, Ue = 0;
|
|
2372
|
-
for (this[
|
|
2373
|
-
y < 0 && Ue === 0 && this[
|
|
2374
|
-
return
|
|
2375
|
-
}, o.prototype.writeIntBE = function(y,
|
|
2376
|
-
if (y = +y,
|
|
2372
|
+
for (this[b] = y & 255; ++Y < D && (ye *= 256); )
|
|
2373
|
+
y < 0 && Ue === 0 && this[b + Y - 1] !== 0 && (Ue = 1), this[b + Y] = (y / ye >> 0) - Ue & 255;
|
|
2374
|
+
return b + D;
|
|
2375
|
+
}, o.prototype.writeIntBE = function(y, b, D, N) {
|
|
2376
|
+
if (y = +y, b = b >>> 0, !N) {
|
|
2377
2377
|
var ee = Math.pow(2, 8 * D - 1);
|
|
2378
|
-
me(this, y,
|
|
2378
|
+
me(this, y, b, D, ee - 1, -ee);
|
|
2379
2379
|
}
|
|
2380
2380
|
var Y = D - 1, ye = 1, Ue = 0;
|
|
2381
|
-
for (this[
|
|
2382
|
-
y < 0 && Ue === 0 && this[
|
|
2383
|
-
return
|
|
2384
|
-
}, o.prototype.writeInt8 = function(y,
|
|
2385
|
-
return y = +y,
|
|
2386
|
-
}, o.prototype.writeInt16LE = function(y,
|
|
2387
|
-
return y = +y,
|
|
2388
|
-
}, o.prototype.writeInt16BE = function(y,
|
|
2389
|
-
return y = +y,
|
|
2390
|
-
}, o.prototype.writeInt32LE = function(y,
|
|
2391
|
-
return y = +y,
|
|
2392
|
-
}, o.prototype.writeInt32BE = function(y,
|
|
2393
|
-
return y = +y,
|
|
2381
|
+
for (this[b + Y] = y & 255; --Y >= 0 && (ye *= 256); )
|
|
2382
|
+
y < 0 && Ue === 0 && this[b + Y + 1] !== 0 && (Ue = 1), this[b + Y] = (y / ye >> 0) - Ue & 255;
|
|
2383
|
+
return b + D;
|
|
2384
|
+
}, o.prototype.writeInt8 = function(y, b, D) {
|
|
2385
|
+
return y = +y, b = b >>> 0, D || me(this, y, b, 1, 127, -128), y < 0 && (y = 255 + y + 1), this[b] = y & 255, b + 1;
|
|
2386
|
+
}, o.prototype.writeInt16LE = function(y, b, D) {
|
|
2387
|
+
return y = +y, b = b >>> 0, D || me(this, y, b, 2, 32767, -32768), this[b] = y & 255, this[b + 1] = y >>> 8, b + 2;
|
|
2388
|
+
}, o.prototype.writeInt16BE = function(y, b, D) {
|
|
2389
|
+
return y = +y, b = b >>> 0, D || me(this, y, b, 2, 32767, -32768), this[b] = y >>> 8, this[b + 1] = y & 255, b + 2;
|
|
2390
|
+
}, o.prototype.writeInt32LE = function(y, b, D) {
|
|
2391
|
+
return y = +y, b = b >>> 0, D || me(this, y, b, 4, 2147483647, -2147483648), this[b] = y & 255, this[b + 1] = y >>> 8, this[b + 2] = y >>> 16, this[b + 3] = y >>> 24, b + 4;
|
|
2392
|
+
}, o.prototype.writeInt32BE = function(y, b, D) {
|
|
2393
|
+
return y = +y, b = b >>> 0, D || me(this, y, b, 4, 2147483647, -2147483648), y < 0 && (y = 4294967295 + y + 1), this[b] = y >>> 24, this[b + 1] = y >>> 16, this[b + 2] = y >>> 8, this[b + 3] = y & 255, b + 4;
|
|
2394
2394
|
};
|
|
2395
|
-
function De(E, y,
|
|
2396
|
-
if (
|
|
2397
|
-
if (
|
|
2395
|
+
function De(E, y, b, D, N, ee) {
|
|
2396
|
+
if (b + D > E.length) throw new RangeError("Index out of range");
|
|
2397
|
+
if (b < 0) throw new RangeError("Index out of range");
|
|
2398
2398
|
}
|
|
2399
|
-
function Le(E, y,
|
|
2400
|
-
return y = +y,
|
|
2399
|
+
function Le(E, y, b, D, N) {
|
|
2400
|
+
return y = +y, b = b >>> 0, N || De(E, y, b, 4), Ri.write(E, y, b, D, 23, 4), b + 4;
|
|
2401
2401
|
}
|
|
2402
|
-
o.prototype.writeFloatLE = function(y,
|
|
2403
|
-
return Le(this, y,
|
|
2404
|
-
}, o.prototype.writeFloatBE = function(y,
|
|
2405
|
-
return Le(this, y,
|
|
2402
|
+
o.prototype.writeFloatLE = function(y, b, D) {
|
|
2403
|
+
return Le(this, y, b, !0, D);
|
|
2404
|
+
}, o.prototype.writeFloatBE = function(y, b, D) {
|
|
2405
|
+
return Le(this, y, b, !1, D);
|
|
2406
2406
|
};
|
|
2407
|
-
function Ge(E, y,
|
|
2408
|
-
return y = +y,
|
|
2409
|
-
}
|
|
2410
|
-
o.prototype.writeDoubleLE = function(y,
|
|
2411
|
-
return Ge(this, y,
|
|
2412
|
-
}, o.prototype.writeDoubleBE = function(y,
|
|
2413
|
-
return Ge(this, y,
|
|
2414
|
-
}, o.prototype.copy = function(y,
|
|
2407
|
+
function Ge(E, y, b, D, N) {
|
|
2408
|
+
return y = +y, b = b >>> 0, N || De(E, y, b, 8), Ri.write(E, y, b, D, 52, 8), b + 8;
|
|
2409
|
+
}
|
|
2410
|
+
o.prototype.writeDoubleLE = function(y, b, D) {
|
|
2411
|
+
return Ge(this, y, b, !0, D);
|
|
2412
|
+
}, o.prototype.writeDoubleBE = function(y, b, D) {
|
|
2413
|
+
return Ge(this, y, b, !1, D);
|
|
2414
|
+
}, o.prototype.copy = function(y, b, D, N) {
|
|
2415
2415
|
if (!o.isBuffer(y)) throw new TypeError("argument should be a Buffer");
|
|
2416
|
-
if (D || (D = 0), !N && N !== 0 && (N = this.length),
|
|
2417
|
-
if (
|
|
2416
|
+
if (D || (D = 0), !N && N !== 0 && (N = this.length), b >= y.length && (b = y.length), b || (b = 0), N > 0 && N < D && (N = D), N === D || y.length === 0 || this.length === 0) return 0;
|
|
2417
|
+
if (b < 0)
|
|
2418
2418
|
throw new RangeError("targetStart out of bounds");
|
|
2419
2419
|
if (D < 0 || D >= this.length) throw new RangeError("Index out of range");
|
|
2420
2420
|
if (N < 0) throw new RangeError("sourceEnd out of bounds");
|
|
2421
|
-
N > this.length && (N = this.length), y.length -
|
|
2421
|
+
N > this.length && (N = this.length), y.length - b < N - D && (N = y.length - b + D);
|
|
2422
2422
|
var ee = N - D;
|
|
2423
2423
|
if (this === y && typeof Uint8Array.prototype.copyWithin == "function")
|
|
2424
|
-
this.copyWithin(
|
|
2425
|
-
else if (this === y && D <
|
|
2424
|
+
this.copyWithin(b, D, N);
|
|
2425
|
+
else if (this === y && D < b && b < N)
|
|
2426
2426
|
for (var Y = ee - 1; Y >= 0; --Y)
|
|
2427
|
-
y[Y +
|
|
2427
|
+
y[Y + b] = this[Y + D];
|
|
2428
2428
|
else
|
|
2429
|
-
Uint8Array.prototype.set.call(y, this.subarray(D, N),
|
|
2429
|
+
Uint8Array.prototype.set.call(y, this.subarray(D, N), b);
|
|
2430
2430
|
return ee;
|
|
2431
|
-
}, o.prototype.fill = function(y,
|
|
2431
|
+
}, o.prototype.fill = function(y, b, D, N) {
|
|
2432
2432
|
if (typeof y == "string") {
|
|
2433
|
-
if (typeof
|
|
2433
|
+
if (typeof b == "string" ? (N = b, b = 0, D = this.length) : typeof D == "string" && (N = D, D = this.length), N !== void 0 && typeof N != "string")
|
|
2434
2434
|
throw new TypeError("encoding must be a string");
|
|
2435
2435
|
if (typeof N == "string" && !o.isEncoding(N))
|
|
2436
2436
|
throw new TypeError("Unknown encoding: " + N);
|
|
@@ -2439,21 +2439,21 @@ var ju = {
|
|
|
2439
2439
|
(N === "utf8" && ee < 128 || N === "latin1") && (y = ee);
|
|
2440
2440
|
}
|
|
2441
2441
|
} else typeof y == "number" ? y = y & 255 : typeof y == "boolean" && (y = Number(y));
|
|
2442
|
-
if (
|
|
2442
|
+
if (b < 0 || this.length < b || this.length < D)
|
|
2443
2443
|
throw new RangeError("Out of range index");
|
|
2444
|
-
if (D <=
|
|
2444
|
+
if (D <= b)
|
|
2445
2445
|
return this;
|
|
2446
|
-
|
|
2446
|
+
b = b >>> 0, D = D === void 0 ? this.length : D >>> 0, y || (y = 0);
|
|
2447
2447
|
var Y;
|
|
2448
2448
|
if (typeof y == "number")
|
|
2449
|
-
for (Y =
|
|
2449
|
+
for (Y = b; Y < D; ++Y)
|
|
2450
2450
|
this[Y] = y;
|
|
2451
2451
|
else {
|
|
2452
2452
|
var ye = o.isBuffer(y) ? y : o.from(y, N), Ue = ye.length;
|
|
2453
2453
|
if (Ue === 0)
|
|
2454
2454
|
throw new TypeError('The value "' + y + '" is invalid for argument "value"');
|
|
2455
|
-
for (Y = 0; Y < D -
|
|
2456
|
-
this[Y +
|
|
2455
|
+
for (Y = 0; Y < D - b; ++Y)
|
|
2456
|
+
this[Y + b] = ye[Y % Ue];
|
|
2457
2457
|
}
|
|
2458
2458
|
return this;
|
|
2459
2459
|
};
|
|
@@ -2466,58 +2466,58 @@ var ju = {
|
|
|
2466
2466
|
}
|
|
2467
2467
|
function Ne(E, y) {
|
|
2468
2468
|
y = y || 1 / 0;
|
|
2469
|
-
for (var
|
|
2470
|
-
if (
|
|
2469
|
+
for (var b, D = E.length, N = null, ee = [], Y = 0; Y < D; ++Y) {
|
|
2470
|
+
if (b = E.charCodeAt(Y), b > 55295 && b < 57344) {
|
|
2471
2471
|
if (!N) {
|
|
2472
|
-
if (
|
|
2472
|
+
if (b > 56319) {
|
|
2473
2473
|
(y -= 3) > -1 && ee.push(239, 191, 189);
|
|
2474
2474
|
continue;
|
|
2475
2475
|
} else if (Y + 1 === D) {
|
|
2476
2476
|
(y -= 3) > -1 && ee.push(239, 191, 189);
|
|
2477
2477
|
continue;
|
|
2478
2478
|
}
|
|
2479
|
-
N =
|
|
2479
|
+
N = b;
|
|
2480
2480
|
continue;
|
|
2481
2481
|
}
|
|
2482
|
-
if (
|
|
2483
|
-
(y -= 3) > -1 && ee.push(239, 191, 189), N =
|
|
2482
|
+
if (b < 56320) {
|
|
2483
|
+
(y -= 3) > -1 && ee.push(239, 191, 189), N = b;
|
|
2484
2484
|
continue;
|
|
2485
2485
|
}
|
|
2486
|
-
|
|
2486
|
+
b = (N - 55296 << 10 | b - 56320) + 65536;
|
|
2487
2487
|
} else N && (y -= 3) > -1 && ee.push(239, 191, 189);
|
|
2488
|
-
if (N = null,
|
|
2488
|
+
if (N = null, b < 128) {
|
|
2489
2489
|
if ((y -= 1) < 0) break;
|
|
2490
|
-
ee.push(
|
|
2491
|
-
} else if (
|
|
2490
|
+
ee.push(b);
|
|
2491
|
+
} else if (b < 2048) {
|
|
2492
2492
|
if ((y -= 2) < 0) break;
|
|
2493
|
-
ee.push(
|
|
2494
|
-
} else if (
|
|
2493
|
+
ee.push(b >> 6 | 192, b & 63 | 128);
|
|
2494
|
+
} else if (b < 65536) {
|
|
2495
2495
|
if ((y -= 3) < 0) break;
|
|
2496
|
-
ee.push(
|
|
2497
|
-
} else if (
|
|
2496
|
+
ee.push(b >> 12 | 224, b >> 6 & 63 | 128, b & 63 | 128);
|
|
2497
|
+
} else if (b < 1114112) {
|
|
2498
2498
|
if ((y -= 4) < 0) break;
|
|
2499
|
-
ee.push(
|
|
2499
|
+
ee.push(b >> 18 | 240, b >> 12 & 63 | 128, b >> 6 & 63 | 128, b & 63 | 128);
|
|
2500
2500
|
} else
|
|
2501
2501
|
throw new Error("Invalid code point");
|
|
2502
2502
|
}
|
|
2503
2503
|
return ee;
|
|
2504
2504
|
}
|
|
2505
2505
|
function ce(E) {
|
|
2506
|
-
for (var y = [],
|
|
2507
|
-
y.push(E.charCodeAt(
|
|
2506
|
+
for (var y = [], b = 0; b < E.length; ++b)
|
|
2507
|
+
y.push(E.charCodeAt(b) & 255);
|
|
2508
2508
|
return y;
|
|
2509
2509
|
}
|
|
2510
2510
|
function Te(E, y) {
|
|
2511
|
-
for (var
|
|
2512
|
-
|
|
2511
|
+
for (var b, D, N, ee = [], Y = 0; Y < E.length && !((y -= 2) < 0); ++Y)
|
|
2512
|
+
b = E.charCodeAt(Y), D = b >> 8, N = b % 256, ee.push(N), ee.push(D);
|
|
2513
2513
|
return ee;
|
|
2514
2514
|
}
|
|
2515
2515
|
function xe(E) {
|
|
2516
2516
|
return ju.toByteArray(Fe(E));
|
|
2517
2517
|
}
|
|
2518
|
-
function Re(E, y,
|
|
2519
|
-
for (var N = 0; N < D && !(N +
|
|
2520
|
-
y[N +
|
|
2518
|
+
function Re(E, y, b, D) {
|
|
2519
|
+
for (var N = 0; N < D && !(N + b >= y.length || N >= E.length); ++N)
|
|
2520
|
+
y[N + b] = E[N];
|
|
2521
2521
|
return N;
|
|
2522
2522
|
}
|
|
2523
2523
|
function he(E, y) {
|
|
@@ -2527,9 +2527,9 @@ var ju = {
|
|
|
2527
2527
|
return E !== E;
|
|
2528
2528
|
}
|
|
2529
2529
|
var gt = (function() {
|
|
2530
|
-
for (var E = "0123456789abcdef", y = new Array(256),
|
|
2531
|
-
for (var D =
|
|
2532
|
-
y[D + N] = E[
|
|
2530
|
+
for (var E = "0123456789abcdef", y = new Array(256), b = 0; b < 16; ++b)
|
|
2531
|
+
for (var D = b * 16, N = 0; N < 16; ++N)
|
|
2532
|
+
y[D + N] = E[b] + E[N];
|
|
2533
2533
|
return y;
|
|
2534
2534
|
})();
|
|
2535
2535
|
}), mt = dr.Buffer;
|
|
@@ -3400,7 +3400,7 @@ Pt.prototype.pipe = function(t, e) {
|
|
|
3400
3400
|
t.on("drain", u);
|
|
3401
3401
|
var f = !1;
|
|
3402
3402
|
function l() {
|
|
3403
|
-
bt("cleanup"), t.removeListener("close", p), t.removeListener("finish",
|
|
3403
|
+
bt("cleanup"), t.removeListener("close", p), t.removeListener("finish", m), t.removeListener("drain", u), t.removeListener("error", v), t.removeListener("unpipe", o), r.removeListener("end", s), r.removeListener("end", l), r.removeListener("data", d), f = !0, n.awaitDrain && (!t._writableState || t._writableState.needDrain) && u();
|
|
3404
3404
|
}
|
|
3405
3405
|
var h = !1;
|
|
3406
3406
|
r.on("data", d);
|
|
@@ -3414,13 +3414,13 @@ Pt.prototype.pipe = function(t, e) {
|
|
|
3414
3414
|
}
|
|
3415
3415
|
Gy(t, "error", v);
|
|
3416
3416
|
function p() {
|
|
3417
|
-
t.removeListener("finish",
|
|
3417
|
+
t.removeListener("finish", m), w();
|
|
3418
3418
|
}
|
|
3419
3419
|
t.once("close", p);
|
|
3420
|
-
function
|
|
3420
|
+
function m() {
|
|
3421
3421
|
bt("onfinish"), t.removeListener("close", p), w();
|
|
3422
3422
|
}
|
|
3423
|
-
t.once("finish",
|
|
3423
|
+
t.once("finish", m);
|
|
3424
3424
|
function w() {
|
|
3425
3425
|
bt("unpipe"), r.unpipe(t);
|
|
3426
3426
|
}
|
|
@@ -4947,8 +4947,8 @@ Wc.prototype.write = function(t) {
|
|
|
4947
4947
|
} else throw new Error("iconv-lite internal error: invalid decoding table value " + o + " at " + r + "/" + f);
|
|
4948
4948
|
if (o > 65535) {
|
|
4949
4949
|
o -= 65536;
|
|
4950
|
-
var
|
|
4951
|
-
e[u++] =
|
|
4950
|
+
var m = 55296 + Math.floor(o / 1024);
|
|
4951
|
+
e[u++] = m & 255, e[u++] = m >> 8, o = 56320 + o % 1024;
|
|
4952
4952
|
}
|
|
4953
4953
|
e[u++] = o & 255, e[u++] = o >> 8, r = 0, a = s + 1;
|
|
4954
4954
|
}
|
|
@@ -13574,8 +13574,8 @@ var Ot = dr.Buffer, lb = function(e) {
|
|
|
13574
13574
|
}
|
|
13575
13575
|
if (l = String(l || "utf8").toLowerCase(), Ot.isNativeEncoding(l)) return r.BufferWrite.call(this, s, h, d, v);
|
|
13576
13576
|
u = +u || 0;
|
|
13577
|
-
var
|
|
13578
|
-
if (f ? (f = +f, f >
|
|
13577
|
+
var m = this.length - u;
|
|
13578
|
+
if (f ? (f = +f, f > m && (f = m)) : f = m, s.length > 0 && (f < 0 || u < 0)) throw new RangeError("attempt to write beyond buffer bounds");
|
|
13579
13579
|
var w = e.encode(s, l);
|
|
13580
13580
|
return w.length < f && (f = w.length), w.copy(this, u, 0, f), f;
|
|
13581
13581
|
}, e.supportsStreams) {
|
|
@@ -13751,7 +13751,7 @@ var Ot = dr.Buffer, lb = function(e) {
|
|
|
13751
13751
|
}, f.prototype.writeBuffer = function(l) {
|
|
13752
13752
|
return this.flush(), this.push(l), this.pos += l.length;
|
|
13753
13753
|
}, f.prototype.writeString = function(l, h) {
|
|
13754
|
-
var d, v, p,
|
|
13754
|
+
var d, v, p, m, w;
|
|
13755
13755
|
switch (h == null && (h = "ascii"), h) {
|
|
13756
13756
|
case "utf16le":
|
|
13757
13757
|
case "ucs2":
|
|
@@ -13759,7 +13759,7 @@ var Ot = dr.Buffer, lb = function(e) {
|
|
|
13759
13759
|
case "ascii":
|
|
13760
13760
|
return this.writeBuffer(new mt(l, h));
|
|
13761
13761
|
case "utf16be":
|
|
13762
|
-
for (d = new mt(l, "utf16le"), p =
|
|
13762
|
+
for (d = new mt(l, "utf16le"), p = m = 0, w = d.length - 1; m < w; p = m += 2)
|
|
13763
13763
|
v = d[p], d[p] = d[p + 1], d[p + 1] = v;
|
|
13764
13764
|
return this.writeBuffer(d);
|
|
13765
13765
|
default:
|
|
@@ -13936,13 +13936,13 @@ var mn = At(function(t, e) {
|
|
|
13936
13936
|
return l.__super__.constructor.apply(this, arguments);
|
|
13937
13937
|
}
|
|
13938
13938
|
return l.prototype.decode = function(h, d) {
|
|
13939
|
-
var v, p,
|
|
13939
|
+
var v, p, m;
|
|
13940
13940
|
return p = h.pos, v = o.resolveLength(this.length, h, d), this.length instanceof i && (d = {
|
|
13941
13941
|
parent: d,
|
|
13942
13942
|
_startOffset: p,
|
|
13943
13943
|
_currentOffset: 0,
|
|
13944
13944
|
_length: v
|
|
13945
|
-
}),
|
|
13945
|
+
}), m = new r(this.type, v, h, d), h.pos += v * this.type.size(null, d), m;
|
|
13946
13946
|
}, l.prototype.size = function(h, d) {
|
|
13947
13947
|
return h instanceof r && (h = h.toArray()), l.__super__.size.call(this, h, d);
|
|
13948
13948
|
}, l.prototype.encode = function(h, d, v) {
|
|
@@ -14194,7 +14194,7 @@ var mn = At(function(t, e) {
|
|
|
14194
14194
|
throw new Error("Unknown version " + h.version);
|
|
14195
14195
|
return l instanceof o ? l.decode(s, u) : (this._parseFields(s, h, l), (d = this.process) != null && d.call(h, s), h);
|
|
14196
14196
|
}, o.prototype.size = function(s, u, f) {
|
|
14197
|
-
var l, h, d, v, p,
|
|
14197
|
+
var l, h, d, v, p, m;
|
|
14198
14198
|
if (f == null && (f = !0), !s)
|
|
14199
14199
|
throw new Error("Not a fixed size");
|
|
14200
14200
|
if (l = {
|
|
@@ -14202,9 +14202,9 @@ var mn = At(function(t, e) {
|
|
|
14202
14202
|
val: s,
|
|
14203
14203
|
pointerSize: 0
|
|
14204
14204
|
}, v = 0, typeof this.type != "string" && (v += this.type.size(s.version, l)), this.versions.header) {
|
|
14205
|
-
|
|
14206
|
-
for (d in
|
|
14207
|
-
p =
|
|
14205
|
+
m = this.versions.header;
|
|
14206
|
+
for (d in m)
|
|
14207
|
+
p = m[d], p.size != null && (v += p.size(s[d], l));
|
|
14208
14208
|
}
|
|
14209
14209
|
if (h = this.versions[s.version], h == null)
|
|
14210
14210
|
throw new Error("Unknown version " + s.version);
|
|
@@ -14212,7 +14212,7 @@ var mn = At(function(t, e) {
|
|
|
14212
14212
|
p = h[d], p.size != null && (v += p.size(s[d], l));
|
|
14213
14213
|
return f && (v += l.pointerSize), v;
|
|
14214
14214
|
}, o.prototype.encode = function(s, u, f) {
|
|
14215
|
-
var l, h, d, v, p,
|
|
14215
|
+
var l, h, d, v, p, m, w, x;
|
|
14216
14216
|
if ((w = this.preEncode) != null && w.call(u, s), l = {
|
|
14217
14217
|
pointers: [],
|
|
14218
14218
|
startOffset: s.pos,
|
|
@@ -14222,11 +14222,11 @@ var mn = At(function(t, e) {
|
|
|
14222
14222
|
}, l.pointerOffset = s.pos + this.size(u, l, !1), typeof this.type != "string" && this.type.encode(s, u.version), this.versions.header) {
|
|
14223
14223
|
x = this.versions.header;
|
|
14224
14224
|
for (v in x)
|
|
14225
|
-
|
|
14225
|
+
m = x[v], m.encode != null && m.encode(s, u[v], l);
|
|
14226
14226
|
}
|
|
14227
14227
|
h = this.versions[u.version];
|
|
14228
14228
|
for (v in h)
|
|
14229
|
-
|
|
14229
|
+
m = h[v], m.encode != null && m.encode(s, u[v], l);
|
|
14230
14230
|
for (d = 0; d < l.pointers.length; )
|
|
14231
14231
|
p = l.pointers[d++], p.type.encode(s, p.val, p.parent);
|
|
14232
14232
|
}, o;
|
|
@@ -14261,8 +14261,8 @@ var mn = At(function(t, e) {
|
|
|
14261
14261
|
}
|
|
14262
14262
|
}).call(this), this.options.relativeTo && (d += this.relativeToGetter(s)), h = l + d, this.type != null ? (v = null, f = /* @__PURE__ */ (function(p) {
|
|
14263
14263
|
return function() {
|
|
14264
|
-
var
|
|
14265
|
-
return v != null || (
|
|
14264
|
+
var m;
|
|
14265
|
+
return v != null || (m = o.pos, o.pos = h, v = p.type.decode(o, s), o.pos = m), v;
|
|
14266
14266
|
};
|
|
14267
14267
|
})(this), this.options.lazy ? new i.PropertyDescriptor({
|
|
14268
14268
|
get: f
|
|
@@ -15395,8 +15395,8 @@ var Zr = /* @__PURE__ */ (function() {
|
|
|
15395
15395
|
else
|
|
15396
15396
|
throw new Error("Bad offset in CFFIndex");
|
|
15397
15397
|
n.writeUInt8(v.size()), u = 1, v.encode(n, u);
|
|
15398
|
-
for (var p = 0,
|
|
15399
|
-
var w =
|
|
15398
|
+
for (var p = 0, m = s; p < m.length; p++) {
|
|
15399
|
+
var w = m[p];
|
|
15400
15400
|
u += w, v.encode(n, u);
|
|
15401
15401
|
}
|
|
15402
15402
|
for (var x = ch(i), P; !(P = x()).done; ) {
|
|
@@ -16024,8 +16024,8 @@ var tu = /* @__PURE__ */ (function() {
|
|
|
16024
16024
|
var p = v.value;
|
|
16025
16025
|
s += of.size(p);
|
|
16026
16026
|
}
|
|
16027
|
-
var
|
|
16028
|
-
s +=
|
|
16027
|
+
var m = Array.isArray(f[0]) ? f[0] : [f[0]];
|
|
16028
|
+
s += m.length;
|
|
16029
16029
|
}
|
|
16030
16030
|
}
|
|
16031
16031
|
return a && (s += o.pointerSize), s;
|
|
@@ -16045,7 +16045,7 @@ var tu = /* @__PURE__ */ (function() {
|
|
|
16045
16045
|
var p = v.value;
|
|
16046
16046
|
of.encode(n, p);
|
|
16047
16047
|
}
|
|
16048
|
-
for (var
|
|
16048
|
+
for (var m = Array.isArray(f[0]) ? f[0] : [f[0]], w = Aa(m), x; !(x = w()).done; ) {
|
|
16049
16049
|
var P = x.value;
|
|
16050
16050
|
n.writeUInt8(P);
|
|
16051
16051
|
}
|
|
@@ -18129,12 +18129,12 @@ var V8 = (Sn = /* @__PURE__ */ (function() {
|
|
|
18129
18129
|
return u.glyphIndices.get(n - u.firstCode) || 0;
|
|
18130
18130
|
case 12:
|
|
18131
18131
|
case 13: {
|
|
18132
|
-
for (var
|
|
18133
|
-
var x =
|
|
18132
|
+
for (var m = 0, w = u.nGroups - 1; m <= w; ) {
|
|
18133
|
+
var x = m + w >> 1, P = u.groups.get(x);
|
|
18134
18134
|
if (n < P.startCharCode)
|
|
18135
18135
|
w = x - 1;
|
|
18136
18136
|
else if (n > P.endCharCode)
|
|
18137
|
-
|
|
18137
|
+
m = x + 1;
|
|
18138
18138
|
else
|
|
18139
18139
|
return u.version === 12 ? P.glyphID + (n - P.startCharCode) : P.glyphID;
|
|
18140
18140
|
}
|
|
@@ -18201,8 +18201,8 @@ var V8 = (Sn = /* @__PURE__ */ (function() {
|
|
|
18201
18201
|
if (h === 0)
|
|
18202
18202
|
p = v + d;
|
|
18203
18203
|
else {
|
|
18204
|
-
var
|
|
18205
|
-
p = i.glyphIndexArray.get(
|
|
18204
|
+
var m = h / 2 + (v - l) - (i.segCount - u);
|
|
18205
|
+
p = i.glyphIndexArray.get(m) || 0, p !== 0 && (p += d);
|
|
18206
18206
|
}
|
|
18207
18207
|
p === n && s.push(v);
|
|
18208
18208
|
}
|
|
@@ -18281,8 +18281,8 @@ var G8 = /* @__PURE__ */ (function() {
|
|
|
18281
18281
|
var f = 0, l = u.subtable;
|
|
18282
18282
|
switch (u.format) {
|
|
18283
18283
|
case 0:
|
|
18284
|
-
var h = us(l.pairs, function(
|
|
18285
|
-
return n -
|
|
18284
|
+
var h = us(l.pairs, function(m) {
|
|
18285
|
+
return n - m.left || i - m.right;
|
|
18286
18286
|
});
|
|
18287
18287
|
h >= 0 && (f = l.pairs[h].value);
|
|
18288
18288
|
break;
|
|
@@ -18453,8 +18453,8 @@ el[28] = 258;
|
|
|
18453
18453
|
var _8 = Q8, xp, Gf;
|
|
18454
18454
|
Gf = _8;
|
|
18455
18455
|
xp = (function() {
|
|
18456
|
-
var t, e, r, n, i, a, o, s, u, f, l, h, d, v, p,
|
|
18457
|
-
h = 11, v = 5, d = h - v, l = 65536 >> h, i = 1 << d, o = i - 1, s = 2, t = 1 << v, r = t - 1, f = 65536 >> v, u = 1024 >> v, a = f + u,
|
|
18456
|
+
var t, e, r, n, i, a, o, s, u, f, l, h, d, v, p, m;
|
|
18457
|
+
h = 11, v = 5, d = h - v, l = 65536 >> h, i = 1 << d, o = i - 1, s = 2, t = 1 << v, r = t - 1, f = 65536 >> v, u = 1024 >> v, a = f + u, m = a, p = 32, n = m + p, e = 1 << s;
|
|
18458
18458
|
function w(x) {
|
|
18459
18459
|
var P, A, M;
|
|
18460
18460
|
P = typeof x.readUInt32BE == "function" && typeof x.slice == "function", P || x instanceof Uint8Array ? (P ? (this.highStart = x.readUInt32BE(0), this.errorValue = x.readUInt32BE(4), A = x.readUInt32BE(8), x = x.slice(12)) : (M = new DataView(x.buffer), this.highStart = M.getUint32(0), this.errorValue = M.getUint32(4), A = M.getUint32(8), x = x.subarray(12)), x = Gf(x, new Uint8Array(A)), x = Gf(x, new Uint8Array(A)), this.data = new Uint32Array(x.buffer)) : (this.data = x.data, this.highStart = x.highStart, this.errorValue = x.errorValue);
|
|
@@ -18476,9 +18476,9 @@ var iu = xp, Fp = At(function(t, e) {
|
|
|
18476
18476
|
}, e.decode = function(a) {
|
|
18477
18477
|
var o = a.length * 0.75, s = a.length, u, f = 0, l, h, d, v;
|
|
18478
18478
|
a[a.length - 1] === "=" && (o--, a[a.length - 2] === "=" && o--);
|
|
18479
|
-
var p = new ArrayBuffer(o),
|
|
18479
|
+
var p = new ArrayBuffer(o), m = new Uint8Array(p);
|
|
18480
18480
|
for (u = 0; u < s; u += 4)
|
|
18481
|
-
l = n[a.charCodeAt(u)], h = n[a.charCodeAt(u + 1)], d = n[a.charCodeAt(u + 2)], v = n[a.charCodeAt(u + 3)],
|
|
18481
|
+
l = n[a.charCodeAt(u)], h = n[a.charCodeAt(u + 1)], d = n[a.charCodeAt(u + 2)], v = n[a.charCodeAt(u + 3)], m[f++] = l << 2 | h >> 4, m[f++] = (h & 15) << 4 | d >> 2, m[f++] = (d & 3) << 6 | v & 63;
|
|
18482
18482
|
return p;
|
|
18483
18483
|
};
|
|
18484
18484
|
})();
|
|
@@ -18573,25 +18573,25 @@ var _n = Fp.decode, $8 = "eJxtVtty4zYM/Rc/70Ni97LbN1tJ49SXeGI3O93OjgayGBERRXoo0h
|
|
|
18573
18573
|
var s = n[a], u = s.cbox.copy();
|
|
18574
18574
|
s.codePoints.length > 1 && (u.minX += (s.codePoints.length - 1) * u.width / s.codePoints.length);
|
|
18575
18575
|
for (var f = -i[a].xAdvance, l = 0, h = this.font.unitsPerEm / 16, d = a + 1; d <= o; d++) {
|
|
18576
|
-
var v = n[d], p = v.cbox,
|
|
18576
|
+
var v = n[d], p = v.cbox, m = i[d], w = this.getCombiningClass(v.codePoints[0]);
|
|
18577
18577
|
if (w !== "Not_Reordered") {
|
|
18578
|
-
switch (
|
|
18578
|
+
switch (m.xOffset = m.yOffset = 0, w) {
|
|
18579
18579
|
case "Double_Above":
|
|
18580
18580
|
case "Double_Below":
|
|
18581
|
-
|
|
18581
|
+
m.xOffset += u.minX - p.width / 2 - p.minX;
|
|
18582
18582
|
break;
|
|
18583
18583
|
case "Attached_Below_Left":
|
|
18584
18584
|
case "Below_Left":
|
|
18585
18585
|
case "Above_Left":
|
|
18586
|
-
|
|
18586
|
+
m.xOffset += u.minX - p.minX;
|
|
18587
18587
|
break;
|
|
18588
18588
|
case "Attached_Above_Right":
|
|
18589
18589
|
case "Below_Right":
|
|
18590
18590
|
case "Above_Right":
|
|
18591
|
-
|
|
18591
|
+
m.xOffset += u.maxX - p.width - p.minX;
|
|
18592
18592
|
break;
|
|
18593
18593
|
default:
|
|
18594
|
-
|
|
18594
|
+
m.xOffset += u.minX + (u.width - p.width) / 2 - p.minX;
|
|
18595
18595
|
}
|
|
18596
18596
|
switch (w) {
|
|
18597
18597
|
case "Double_Below":
|
|
@@ -18600,7 +18600,7 @@ var _n = Fp.decode, $8 = "eJxtVtty4zYM/Rc/70Ni97LbN1tJ49SXeGI3O93OjgayGBERRXoo0h
|
|
|
18600
18600
|
case "Below_Right":
|
|
18601
18601
|
case "Attached_Below_Left":
|
|
18602
18602
|
case "Attached_Below":
|
|
18603
|
-
(w === "Attached_Below_Left" || w === "Attached_Below") && (u.minY += h),
|
|
18603
|
+
(w === "Attached_Below_Left" || w === "Attached_Below") && (u.minY += h), m.yOffset = -u.minY - p.maxY, u.minY += p.height;
|
|
18604
18604
|
break;
|
|
18605
18605
|
case "Double_Above":
|
|
18606
18606
|
case "Above_Left":
|
|
@@ -18608,12 +18608,12 @@ var _n = Fp.decode, $8 = "eJxtVtty4zYM/Rc/70Ni97LbN1tJ49SXeGI3O93OjgayGBERRXoo0h
|
|
|
18608
18608
|
case "Above_Right":
|
|
18609
18609
|
case "Attached_Above":
|
|
18610
18610
|
case "Attached_Above_Right":
|
|
18611
|
-
(w === "Attached_Above" || w === "Attached_Above_Right") && (u.maxY += h),
|
|
18611
|
+
(w === "Attached_Above" || w === "Attached_Above_Right") && (u.maxY += h), m.yOffset = u.maxY - p.minY, u.maxY += p.height;
|
|
18612
18612
|
break;
|
|
18613
18613
|
}
|
|
18614
|
-
|
|
18614
|
+
m.xAdvance = m.yAdvance = 0, m.xOffset += f, m.yOffset += l;
|
|
18615
18615
|
} else
|
|
18616
|
-
f -=
|
|
18616
|
+
f -= m.xAdvance, l -= m.yAdvance;
|
|
18617
18617
|
}
|
|
18618
18618
|
}, e.getCombiningClass = function(n) {
|
|
18619
18619
|
var i = pn.getCombiningClass(n);
|
|
@@ -19743,8 +19743,8 @@ var ZF = 0, u0 = 0, f0 = 1, c0 = 2, YF = 16384, JF = /* @__PURE__ */ (function()
|
|
|
19743
19743
|
if (i === void 0 && (i = 0), a === void 0 && (a = /* @__PURE__ */ new Set()), !a.has(i)) {
|
|
19744
19744
|
a.add(i);
|
|
19745
19745
|
for (var o = this.stateTable, s = o.nClasses, u = o.stateArray, f = o.entryTable, l = u.getItem(i), h = 4; h < s; h++)
|
|
19746
|
-
for (var d = l[h], v = f.getItem(d), p = KF(this.lookupTable.glyphsForValue(h)),
|
|
19747
|
-
var w =
|
|
19746
|
+
for (var d = l[h], v = f.getItem(d), p = KF(this.lookupTable.glyphsForValue(h)), m; !(m = p()).done; ) {
|
|
19747
|
+
var w = m.value;
|
|
19748
19748
|
n.enter && n.enter(w, v), v.newState !== 0 && this.traverse(n, v.newState, a), n.exit && n.exit(w, v);
|
|
19749
19749
|
}
|
|
19750
19750
|
}
|
|
@@ -19796,8 +19796,8 @@ var $F = 32768, e6 = 8192, t6 = 15, h0 = 32768, r6 = 32768, n6 = 8192, i6 = 2147
|
|
|
19796
19796
|
(d = i[h.featureType]) && d[h.featureSetting] && (u &= h.disableFlags, u |= h.enableFlags);
|
|
19797
19797
|
}
|
|
19798
19798
|
for (var v = ai(s.subtables), p; !(p = v()).done; ) {
|
|
19799
|
-
var
|
|
19800
|
-
|
|
19799
|
+
var m = p.value;
|
|
19800
|
+
m.subFeatureFlags & u && this.processSubtable(m, n);
|
|
19801
19801
|
}
|
|
19802
19802
|
}
|
|
19803
19803
|
for (var w = n.length - 1; w >= 0; )
|
|
@@ -19848,8 +19848,8 @@ var $F = 32768, e6 = 8192, t6 = 15, h0 = 32768, r6 = 32768, n6 = 8192, i6 = 2147
|
|
|
19848
19848
|
}, e.processLigature = function(n, i, a) {
|
|
19849
19849
|
if (i.flags & r6 && this.ligatureStack.push(a), i.flags & n6) {
|
|
19850
19850
|
for (var o, s = this.subtable.table.ligatureActions, u = this.subtable.table.components, f = this.subtable.table.ligatureList, l = i.action, h = !1, d = 0, v = [], p = []; !h; ) {
|
|
19851
|
-
var
|
|
19852
|
-
(
|
|
19851
|
+
var m, w = this.ligatureStack.pop();
|
|
19852
|
+
(m = v).unshift.apply(m, this.glyphs[w].codePoints);
|
|
19853
19853
|
var x = s.getItem(l++);
|
|
19854
19854
|
h = !!(x & i6);
|
|
19855
19855
|
var P = !!(x & a6), A = (x & o6) << 2 >> 2;
|
|
@@ -19920,9 +19920,9 @@ var $F = 32768, e6 = 8192, t6 = 15, h0 = 32768, r6 = 32768, n6 = 8192, i6 = 2147
|
|
|
19920
19920
|
});
|
|
19921
19921
|
var p = i.font.getGlyph(h);
|
|
19922
19922
|
u.push(p), v.push(u[u.length - 1]), s(v[v.length - 1], d, v.length - 1);
|
|
19923
|
-
for (var
|
|
19924
|
-
v[x].id !== 65535 && (
|
|
19925
|
-
if (
|
|
19923
|
+
for (var m = 0, w = 0, x = 0; x < v.length && m <= 1; x++)
|
|
19924
|
+
v[x].id !== 65535 && (m++, w = v[x].id);
|
|
19925
|
+
if (m === 1) {
|
|
19926
19926
|
var P = u.map(function(M) {
|
|
19927
19927
|
return M.id;
|
|
19928
19928
|
}), A = i.inputCache[w];
|
|
@@ -20178,8 +20178,8 @@ var C6 = Ir.inflate(_n(S6)), E6 = new iu(C6), y0 = ["isol", "fina", "fin2", "fin
|
|
|
20178
20178
|
l = v[0], f = v[1], o = v[2], l !== ot && a !== -1 && (s[a] = l), s[u] = f, a = u;
|
|
20179
20179
|
}
|
|
20180
20180
|
for (var p = 0; p < i.length; p++) {
|
|
20181
|
-
var
|
|
20182
|
-
(
|
|
20181
|
+
var m = void 0, h = i[p];
|
|
20182
|
+
(m = s[p]) && (h.features[m] = !0);
|
|
20183
20183
|
}
|
|
20184
20184
|
}, e;
|
|
20185
20185
|
})(Gn);
|
|
@@ -20300,8 +20300,8 @@ var R6 = ["DFLT", "dflt", "latn"], As = /* @__PURE__ */ (function() {
|
|
|
20300
20300
|
}
|
|
20301
20301
|
if (o && (this.features = {}, this.language))
|
|
20302
20302
|
for (var h = Xt(this.language.featureIndexes), d; !(d = h()).done; ) {
|
|
20303
|
-
var v = d.value, p = this.table.featureList[v],
|
|
20304
|
-
this.features[p.tag] =
|
|
20303
|
+
var v = d.value, p = this.table.featureList[v], m = this.substituteFeatureForVariations(v);
|
|
20304
|
+
this.features[p.tag] = m || p.feature;
|
|
20305
20305
|
}
|
|
20306
20306
|
return this.scriptTag;
|
|
20307
20307
|
}, e.lookupsForFeatures = function(n, i) {
|
|
@@ -20630,10 +20630,10 @@ function nS(t, e, r) {
|
|
|
20630
20630
|
}
|
|
20631
20631
|
var p = h && h.codePoints[0] || bi;
|
|
20632
20632
|
if (u != null && (p === bi || _6(p))) {
|
|
20633
|
-
var
|
|
20634
|
-
if (r.hasGlyphForCodePoint(
|
|
20633
|
+
var m = u + (p - bi);
|
|
20634
|
+
if (r.hasGlyphForCodePoint(m)) {
|
|
20635
20635
|
var w = s === Es ? 3 : 2;
|
|
20636
|
-
return t.splice(e - w + 1, w, Xa(r,
|
|
20636
|
+
return t.splice(e - w + 1, w, Xa(r, m, n.features)), e - w + 1;
|
|
20637
20637
|
}
|
|
20638
20638
|
}
|
|
20639
20639
|
return f && (f.features.ljmo = !0), l && (l.features.vjmo = !0), h && (h.features.tjmo = !0), s === Ts ? (Dp(t, e - 1, r), e + 1) : e;
|
|
@@ -21006,18 +21006,18 @@ function SS(t, e, r) {
|
|
|
21006
21006
|
p++;
|
|
21007
21007
|
e.splice(p++, 0, v), l++;
|
|
21008
21008
|
}
|
|
21009
|
-
var
|
|
21009
|
+
var m = l, w = f, x = !1;
|
|
21010
21010
|
if (n.rephPos !== ke.Ra_To_Become_Reph && i.rphf && f + 3 <= l && (n.rephMode === "Implicit" && !Kr(e[f + 2]) || n.rephMode === "Explicit" && e[f + 2].shaperInfo.category === et.ZWJ)) {
|
|
21011
21011
|
var P = [e[f].copy(), e[f + 1].copy(), e[f + 2].copy()];
|
|
21012
21012
|
if (fn(P.slice(0, 2), "rphf") || n.rephMode === "Explicit" && fn(P, "rphf")) {
|
|
21013
21013
|
for (w += 2; w < l && Kr(e[w]); )
|
|
21014
21014
|
w++;
|
|
21015
|
-
|
|
21015
|
+
m = f, x = !0;
|
|
21016
21016
|
}
|
|
21017
21017
|
} else if (n.rephMode === "Log_Repha" && e[f].shaperInfo.category === et.Repha) {
|
|
21018
21018
|
for (w++; w < l && Kr(e[w]); )
|
|
21019
21019
|
w++;
|
|
21020
|
-
|
|
21020
|
+
m = f, x = !0;
|
|
21021
21021
|
}
|
|
21022
21022
|
switch (n.basePos) {
|
|
21023
21023
|
case "Last": {
|
|
@@ -21026,28 +21026,28 @@ function SS(t, e, r) {
|
|
|
21026
21026
|
var B = e[--A].shaperInfo;
|
|
21027
21027
|
if (ci(e[A])) {
|
|
21028
21028
|
if (B.position !== ke.Below_C && (B.position !== ke.Post_C || M)) {
|
|
21029
|
-
|
|
21029
|
+
m = A;
|
|
21030
21030
|
break;
|
|
21031
21031
|
}
|
|
21032
|
-
B.position === ke.Below_C && (M = !0),
|
|
21032
|
+
B.position === ke.Below_C && (M = !0), m = A;
|
|
21033
21033
|
} else if (f < A && B.category === et.ZWJ && e[A - 1].shaperInfo.category === et.H)
|
|
21034
21034
|
break;
|
|
21035
21035
|
} while (A > w);
|
|
21036
21036
|
break;
|
|
21037
21037
|
}
|
|
21038
21038
|
case "First": {
|
|
21039
|
-
|
|
21040
|
-
for (var k =
|
|
21039
|
+
m = f;
|
|
21040
|
+
for (var k = m + 1; k < l; k++)
|
|
21041
21041
|
ci(e[k]) && (e[k].shaperInfo.position = ke.Below_C);
|
|
21042
21042
|
}
|
|
21043
21043
|
}
|
|
21044
|
-
x &&
|
|
21045
|
-
for (var I = f; I <
|
|
21044
|
+
x && m === f && w - m <= 2 && (x = !1);
|
|
21045
|
+
for (var I = f; I < m; I++) {
|
|
21046
21046
|
var j = e[I].shaperInfo;
|
|
21047
21047
|
j.position = Math.min(ke.Pre_C, j.position);
|
|
21048
21048
|
}
|
|
21049
|
-
|
|
21050
|
-
for (var H =
|
|
21049
|
+
m < l && (e[m].shaperInfo.position = ke.Base_C);
|
|
21050
|
+
for (var H = m + 1; H < l; H++)
|
|
21051
21051
|
if (e[H].shaperInfo.category === et.M) {
|
|
21052
21052
|
for (var W = H + 1; W < l; W++)
|
|
21053
21053
|
if (ci(e[W])) {
|
|
@@ -21057,7 +21057,7 @@ function SS(t, e, r) {
|
|
|
21057
21057
|
break;
|
|
21058
21058
|
}
|
|
21059
21059
|
if (x && (e[f].shaperInfo.position = ke.Ra_To_Become_Reph), r.isOldSpec) {
|
|
21060
|
-
for (var q = r.unicodeScript !== "Malayalam", Z =
|
|
21060
|
+
for (var q = r.unicodeScript !== "Malayalam", Z = m + 1; Z < l; Z++)
|
|
21061
21061
|
if (e[Z].shaperInfo.category === et.H) {
|
|
21062
21062
|
var U = void 0;
|
|
21063
21063
|
for (U = l - 1; U > Z && !(ci(e[U]) || q && e[U].shaperInfo.category === et.H); U--)
|
|
@@ -21081,33 +21081,33 @@ function SS(t, e, r) {
|
|
|
21081
21081
|
}
|
|
21082
21082
|
} else Q.position !== ke.SMVD && (_ = Q.position);
|
|
21083
21083
|
}
|
|
21084
|
-
for (var pe =
|
|
21084
|
+
for (var pe = m, we = m + 1; we < l; we++)
|
|
21085
21085
|
if (ci(e[we])) {
|
|
21086
21086
|
for (var me = pe + 1; me < we; me++)
|
|
21087
21087
|
e[me].shaperInfo.position < ke.SMVD && (e[me].shaperInfo.position = e[we].shaperInfo.position);
|
|
21088
21088
|
pe = we;
|
|
21089
21089
|
} else e[we].shaperInfo.category === et.M && (pe = we);
|
|
21090
21090
|
var De = e.slice(f, l);
|
|
21091
|
-
De.sort(function(y,
|
|
21092
|
-
return y.shaperInfo.position -
|
|
21091
|
+
De.sort(function(y, b) {
|
|
21092
|
+
return y.shaperInfo.position - b.shaperInfo.position;
|
|
21093
21093
|
}), e.splice.apply(e, [f, De.length].concat(De));
|
|
21094
21094
|
for (var Le = f; Le < l; Le++)
|
|
21095
21095
|
if (e[Le].shaperInfo.position === ke.Base_C) {
|
|
21096
|
-
|
|
21096
|
+
m = Le;
|
|
21097
21097
|
break;
|
|
21098
21098
|
}
|
|
21099
21099
|
for (var Ge = f; Ge < l && e[Ge].shaperInfo.position === ke.Ra_To_Become_Reph; Ge++)
|
|
21100
21100
|
e[Ge].features.rphf = !0;
|
|
21101
|
-
for (var Xe = !r.isOldSpec && n.blwfMode === "Pre_And_Post", Fe = f; Fe <
|
|
21101
|
+
for (var Xe = !r.isOldSpec && n.blwfMode === "Pre_And_Post", Fe = f; Fe < m; Fe++)
|
|
21102
21102
|
e[Fe].features.half = !0, Xe && (e[Fe].features.blwf = !0);
|
|
21103
|
-
for (var Ne =
|
|
21103
|
+
for (var Ne = m + 1; Ne < l; Ne++)
|
|
21104
21104
|
e[Ne].features.abvf = !0, e[Ne].features.pstf = !0, e[Ne].features.blwf = !0;
|
|
21105
21105
|
if (r.isOldSpec && r.unicodeScript === "Devanagari")
|
|
21106
|
-
for (var ce = f; ce + 1 <
|
|
21107
|
-
e[ce].shaperInfo.category === et.Ra && e[ce + 1].shaperInfo.category === et.H && (ce + 1 ===
|
|
21106
|
+
for (var ce = f; ce + 1 < m; ce++)
|
|
21107
|
+
e[ce].shaperInfo.category === et.Ra && e[ce + 1].shaperInfo.category === et.H && (ce + 1 === m || e[ce + 2].shaperInfo.category === et.ZWJ) && (e[ce].features.blwf = !0, e[ce + 1].features.blwf = !0);
|
|
21108
21108
|
var Te = 2;
|
|
21109
|
-
if (i.pref &&
|
|
21110
|
-
for (var xe =
|
|
21109
|
+
if (i.pref && m + Te < l)
|
|
21110
|
+
for (var xe = m + 1; xe + Te - 1 < l; xe++) {
|
|
21111
21111
|
var Re = [e[xe].copy(), e[xe + 1].copy()];
|
|
21112
21112
|
if (fn(Re, "pref")) {
|
|
21113
21113
|
for (var he = 0; he < Te; he++)
|
|
@@ -21177,35 +21177,35 @@ function AS(t, e, r) {
|
|
|
21177
21177
|
}
|
|
21178
21178
|
}
|
|
21179
21179
|
if (a + 1 < o && e[a].shaperInfo.position === ke.Ra_To_Become_Reph && e[a].shaperInfo.category === et.Repha !== (e[a].isLigated && !e[a].isMultiplied)) {
|
|
21180
|
-
var
|
|
21180
|
+
var m = void 0, w = n.rephPos, x = !1;
|
|
21181
21181
|
if (w !== ke.After_Post) {
|
|
21182
|
-
for (
|
|
21183
|
-
|
|
21184
|
-
if (
|
|
21185
|
-
for (
|
|
21186
|
-
|
|
21187
|
-
x =
|
|
21182
|
+
for (m = a + 1; m < u && !an(e[m]); )
|
|
21183
|
+
m++;
|
|
21184
|
+
if (m < u && an(e[m]) && (m + 1 < u && Kr(e[m + 1]) && m++, x = !0), !x && w === ke.After_Main) {
|
|
21185
|
+
for (m = u; m + 1 < o && e[m + 1].shaperInfo.position <= ke.After_Main; )
|
|
21186
|
+
m++;
|
|
21187
|
+
x = m < o;
|
|
21188
21188
|
}
|
|
21189
21189
|
if (!x && w === ke.After_Sub) {
|
|
21190
|
-
for (
|
|
21191
|
-
|
|
21192
|
-
x =
|
|
21190
|
+
for (m = u; m + 1 < o && !(e[m + 1].shaperInfo.position & (ke.Post_C | ke.After_Post | ke.SMVD)); )
|
|
21191
|
+
m++;
|
|
21192
|
+
x = m < o;
|
|
21193
21193
|
}
|
|
21194
21194
|
}
|
|
21195
21195
|
if (!x) {
|
|
21196
|
-
for (
|
|
21197
|
-
|
|
21198
|
-
|
|
21196
|
+
for (m = a + 1; m < u && !an(e[m]); )
|
|
21197
|
+
m++;
|
|
21198
|
+
m < u && an(e[m]) && (m + 1 < u && Kr(e[m + 1]) && m++, x = !0);
|
|
21199
21199
|
}
|
|
21200
21200
|
if (!x) {
|
|
21201
|
-
for (
|
|
21202
|
-
|
|
21203
|
-
if (an(e[
|
|
21204
|
-
for (var P = u + 1; P <
|
|
21205
|
-
e[P].shaperInfo.category === et.M &&
|
|
21201
|
+
for (m = o - 1; m > a && e[m].shaperInfo.position === ke.SMVD; )
|
|
21202
|
+
m--;
|
|
21203
|
+
if (an(e[m]))
|
|
21204
|
+
for (var P = u + 1; P < m; P++)
|
|
21205
|
+
e[P].shaperInfo.category === et.M && m--;
|
|
21206
21206
|
}
|
|
21207
21207
|
var A = e[a];
|
|
21208
|
-
e.splice.apply(e, [a, 0].concat(e.splice(a + 1,
|
|
21208
|
+
e.splice.apply(e, [a, 0].concat(e.splice(a + 1, m - a))), e[m] = A, a < u && u <= m && u--;
|
|
21209
21209
|
}
|
|
21210
21210
|
if (s && u + 1 < o) {
|
|
21211
21211
|
for (var M = u + 1; M < o; M++)
|
|
@@ -21607,10 +21607,10 @@ var GS = /* @__PURE__ */ (function(t) {
|
|
|
21607
21607
|
return !1;
|
|
21608
21608
|
}
|
|
21609
21609
|
case 3: {
|
|
21610
|
-
var
|
|
21611
|
-
if (
|
|
21610
|
+
var m = this.coverageIndex(a.coverage);
|
|
21611
|
+
if (m !== -1) {
|
|
21612
21612
|
var w = 0;
|
|
21613
|
-
return this.glyphIterator.cur.id = a.alternateSet.get(
|
|
21613
|
+
return this.glyphIterator.cur.id = a.alternateSet.get(m)[w], !0;
|
|
21614
21614
|
}
|
|
21615
21615
|
return !1;
|
|
21616
21616
|
}
|
|
@@ -21738,8 +21738,8 @@ var ZS = /* @__PURE__ */ (function(t) {
|
|
|
21738
21738
|
var v = this.getClassID(this.glyphIterator.cur.id, a.classDef1), p = this.getClassID(s.id, a.classDef2);
|
|
21739
21739
|
if (v === -1 || p === -1)
|
|
21740
21740
|
return !1;
|
|
21741
|
-
var
|
|
21742
|
-
return this.applyPositionValue(0,
|
|
21741
|
+
var m = a.classRecords.get(v).get(p);
|
|
21742
|
+
return this.applyPositionValue(0, m.value1), this.applyPositionValue(1, m.value2), !0;
|
|
21743
21743
|
}
|
|
21744
21744
|
}
|
|
21745
21745
|
case 3: {
|
|
@@ -22104,7 +22104,7 @@ var t4 = {
|
|
|
22104
22104
|
case "quadraticCurveTo":
|
|
22105
22105
|
case "bezierCurveTo":
|
|
22106
22106
|
if (f.command === "quadraticCurveTo")
|
|
22107
|
-
var v = f.args, p = v[0],
|
|
22107
|
+
var v = f.args, p = v[0], m = v[1], w = v[2], x = v[3], P = i + 2 / 3 * (p - i), A = a + 2 / 3 * (m - a), M = w + 2 / 3 * (p - w), B = x + 2 / 3 * (m - x);
|
|
22108
22108
|
else
|
|
22109
22109
|
var k = f.args, P = k[0], A = k[1], M = k[2], B = k[3], w = k[4], x = k[5];
|
|
22110
22110
|
n.addPoint(w, x);
|
|
@@ -22368,9 +22368,9 @@ var L0 = new c.Struct({
|
|
|
22368
22368
|
var f = s[d];
|
|
22369
22369
|
i.points[d].x = p = this._parseGlyphCoord(a, p, f & f4, f & h4);
|
|
22370
22370
|
}
|
|
22371
|
-
for (var
|
|
22371
|
+
for (var m = 0, d = 0; d < s.length; d++) {
|
|
22372
22372
|
var f = s[d];
|
|
22373
|
-
i.points[d].y =
|
|
22373
|
+
i.points[d].y = m = this._parseGlyphCoord(a, m, f & c4, f & d4);
|
|
22374
22374
|
}
|
|
22375
22375
|
if (this._font._variationProcessor) {
|
|
22376
22376
|
var w = i.points.slice();
|
|
@@ -22389,8 +22389,8 @@ var L0 = new c.Struct({
|
|
|
22389
22389
|
v.pos = f, u & p4 ? v.scaleX = v.scaleY = (a.readUInt8() << 24 | a.readUInt8() << 16) / 1073741824 : u & g4 ? (v.scaleX = (a.readUInt8() << 24 | a.readUInt8() << 16) / 1073741824, v.scaleY = (a.readUInt8() << 24 | a.readUInt8() << 16) / 1073741824) : u & y4 && (v.scaleX = (a.readUInt8() << 24 | a.readUInt8() << 16) / 1073741824, v.scale01 = (a.readUInt8() << 24 | a.readUInt8() << 16) / 1073741824, v.scale10 = (a.readUInt8() << 24 | a.readUInt8() << 16) / 1073741824, v.scaleY = (a.readUInt8() << 24 | a.readUInt8() << 16) / 1073741824), i.components.push(v);
|
|
22390
22390
|
}
|
|
22391
22391
|
if (this._font._variationProcessor) {
|
|
22392
|
-
for (var p = [],
|
|
22393
|
-
var v = i.components[
|
|
22392
|
+
for (var p = [], m = 0; m < i.components.length; m++) {
|
|
22393
|
+
var v = i.components[m];
|
|
22394
22394
|
p.push(new sn(!0, !0, v.dx, v.dy));
|
|
22395
22395
|
}
|
|
22396
22396
|
p.push.apply(p, this._getPhantomPoints(i)), this._font._variationProcessor.transformPoints(this.id, p), i.phantomPoints = p.splice(-4, 4);
|
|
@@ -22414,8 +22414,8 @@ var L0 = new c.Struct({
|
|
|
22414
22414
|
for (var o = a4(i.components), s; !(s = o()).done; )
|
|
22415
22415
|
for (var u = s.value, f = this._font.getGlyph(u.glyphID)._getContours(), l = 0; l < f.length; l++)
|
|
22416
22416
|
for (var h = f[l], d = 0; d < h.length; d++) {
|
|
22417
|
-
var v = h[d], p = v.x * u.scaleX + v.y * u.scale01 + u.dx,
|
|
22418
|
-
a.push(new sn(v.onCurve, v.endContour, p,
|
|
22417
|
+
var v = h[d], p = v.x * u.scaleX + v.y * u.scale01 + u.dx, m = v.y * u.scaleY + v.x * u.scale10 + u.dy;
|
|
22418
|
+
a.push(new sn(v.onCurve, v.endContour, p, m));
|
|
22419
22419
|
}
|
|
22420
22420
|
else
|
|
22421
22421
|
a = i.points || [];
|
|
@@ -22448,8 +22448,8 @@ var L0 = new c.Struct({
|
|
|
22448
22448
|
else if (p.onCurve && !v.onCurve)
|
|
22449
22449
|
var h = v;
|
|
22450
22450
|
else if (!p.onCurve && !v.onCurve) {
|
|
22451
|
-
var
|
|
22452
|
-
a.quadraticCurveTo(p.x, p.y,
|
|
22451
|
+
var m = (p.x + v.x) / 2, w = (p.y + v.y) / 2;
|
|
22452
|
+
a.quadraticCurveTo(p.x, p.y, m, w);
|
|
22453
22453
|
var h = v;
|
|
22454
22454
|
} else if (!p.onCurve && v.onCurve) {
|
|
22455
22455
|
a.quadraticCurveTo(h.x, h.y, v.x, v.y);
|
|
@@ -22480,8 +22480,8 @@ var x4 = /* @__PURE__ */ (function(t) {
|
|
|
22480
22480
|
i.pos;
|
|
22481
22481
|
var a = this._font.CFF2 || this._font["CFF "], o = a.topDict.CharStrings[this.id], s = o.offset + o.length;
|
|
22482
22482
|
i.pos = o.offset;
|
|
22483
|
-
var u = new cu(), f = [], l = [], h = null, d = 0, v = 0, p = 0,
|
|
22484
|
-
this._usedGsubrs =
|
|
22483
|
+
var u = new cu(), f = [], l = [], h = null, d = 0, v = 0, p = 0, m, w, x = !1;
|
|
22484
|
+
this._usedGsubrs = m = {}, this._usedSubrs = w = {};
|
|
22485
22485
|
var P = a.globalSubrIndex || [], A = this.bias(P), M = a.privateDictForGlyph(this.id), B = M.Subrs || [], k = this.bias(B), I = a.topDict.vstore && a.topDict.vstore.itemVariationStore, j = M.vsindex, H = this._font._variationProcessor;
|
|
22486
22486
|
function W() {
|
|
22487
22487
|
h == null && (h = f.shift() + M.nominalWidthX);
|
|
@@ -22599,7 +22599,7 @@ var x4 = /* @__PURE__ */ (function(t) {
|
|
|
22599
22599
|
break;
|
|
22600
22600
|
case 29:
|
|
22601
22601
|
if (Q = f.pop() + A, de = P[Q], de) {
|
|
22602
|
-
|
|
22602
|
+
m[Q] = !0;
|
|
22603
22603
|
var pe = i.pos, we = s;
|
|
22604
22604
|
i.pos = de.offset, s = de.offset + de.length, re(), i.pos = pe, s = we;
|
|
22605
22605
|
}
|
|
@@ -22651,8 +22651,8 @@ var x4 = /* @__PURE__ */ (function(t) {
|
|
|
22651
22651
|
y = f.pop(), f.push(l[y] || 0);
|
|
22652
22652
|
break;
|
|
22653
22653
|
case 22:
|
|
22654
|
-
var
|
|
22655
|
-
f.push(N <= ee ?
|
|
22654
|
+
var b = f.pop(), D = f.pop(), N = f.pop(), ee = f.pop();
|
|
22655
|
+
f.push(N <= ee ? b : D);
|
|
22656
22656
|
break;
|
|
22657
22657
|
case 23:
|
|
22658
22658
|
f.push(Math.random());
|
|
@@ -22895,28 +22895,28 @@ var z0 = function(e, r) {
|
|
|
22895
22895
|
});
|
|
22896
22896
|
u &= I4;
|
|
22897
22897
|
for (var v = 0; v < u; v++) {
|
|
22898
|
-
var p = s.readUInt16BE(),
|
|
22899
|
-
if (
|
|
22898
|
+
var p = s.readUInt16BE(), m = s.readUInt16BE();
|
|
22899
|
+
if (m & B4)
|
|
22900
22900
|
for (var w = [], x = 0; x < a.axisCount; x++)
|
|
22901
22901
|
w.push(s.readInt16BE() / 16384);
|
|
22902
22902
|
else {
|
|
22903
|
-
if ((
|
|
22903
|
+
if ((m & V0) >= a.globalCoordCount)
|
|
22904
22904
|
throw new Error("Invalid gvar table");
|
|
22905
|
-
var w = a.globalCoords[
|
|
22905
|
+
var w = a.globalCoords[m & V0];
|
|
22906
22906
|
}
|
|
22907
|
-
if (
|
|
22907
|
+
if (m & j0) {
|
|
22908
22908
|
for (var P = [], A = 0; A < a.axisCount; A++)
|
|
22909
22909
|
P.push(s.readInt16BE() / 16384);
|
|
22910
22910
|
for (var M = [], B = 0; B < a.axisCount; B++)
|
|
22911
22911
|
M.push(s.readInt16BE() / 16384);
|
|
22912
22912
|
}
|
|
22913
|
-
var k = this.tupleFactor(
|
|
22913
|
+
var k = this.tupleFactor(m, w, P, M);
|
|
22914
22914
|
if (k === 0) {
|
|
22915
22915
|
f += p;
|
|
22916
22916
|
continue;
|
|
22917
22917
|
}
|
|
22918
22918
|
var l = s.pos;
|
|
22919
|
-
if (s.pos = f,
|
|
22919
|
+
if (s.pos = f, m & R4)
|
|
22920
22920
|
var I = this.decodePoints();
|
|
22921
22921
|
else
|
|
22922
22922
|
var I = h;
|
|
@@ -23005,11 +23005,11 @@ var z0 = function(e, r) {
|
|
|
23005
23005
|
var d = a;
|
|
23006
23006
|
a = o, o = d;
|
|
23007
23007
|
}
|
|
23008
|
-
var v = s[a][h], p = s[o][h],
|
|
23009
|
-
if (v !== p ||
|
|
23010
|
-
for (var x = v === p ? 0 : (w -
|
|
23008
|
+
var v = s[a][h], p = s[o][h], m = u[a][h], w = u[o][h];
|
|
23009
|
+
if (v !== p || m === w)
|
|
23010
|
+
for (var x = v === p ? 0 : (w - m) / (p - v), P = n; P <= i; P++) {
|
|
23011
23011
|
var A = s[P][h];
|
|
23012
|
-
A <= v ? A +=
|
|
23012
|
+
A <= v ? A += m - v : A >= p ? A += w - p : A = m + (A - v) * x, u[P][h] = A;
|
|
23013
23013
|
}
|
|
23014
23014
|
}
|
|
23015
23015
|
}, e.deltaShift = function(n, i, a, o, s) {
|
|
@@ -23055,7 +23055,7 @@ var z0 = function(e, r) {
|
|
|
23055
23055
|
typeof f == "object" && (l = f.depth, h = f.prototype, f.filter, f = f.circular);
|
|
23056
23056
|
var d = [], v = [], p = typeof mt < "u";
|
|
23057
23057
|
typeof f > "u" && (f = !0), typeof l > "u" && (l = 1 / 0);
|
|
23058
|
-
function
|
|
23058
|
+
function m(w, x) {
|
|
23059
23059
|
if (w === null) return null;
|
|
23060
23060
|
if (x == 0) return w;
|
|
23061
23061
|
var P, A;
|
|
@@ -23080,11 +23080,11 @@ var z0 = function(e, r) {
|
|
|
23080
23080
|
}
|
|
23081
23081
|
for (var B in w) {
|
|
23082
23082
|
var k;
|
|
23083
|
-
A && (k = Object.getOwnPropertyDescriptor(A, B)), !(k && k.set == null) && (P[B] =
|
|
23083
|
+
A && (k = Object.getOwnPropertyDescriptor(A, B)), !(k && k.set == null) && (P[B] = m(w[B], x - 1));
|
|
23084
23084
|
}
|
|
23085
23085
|
return P;
|
|
23086
23086
|
}
|
|
23087
|
-
return
|
|
23087
|
+
return m(u, l);
|
|
23088
23088
|
}
|
|
23089
23089
|
r.clonePrototype = function(f) {
|
|
23090
23090
|
if (f === null) return null;
|
|
@@ -23155,9 +23155,9 @@ var z0 = function(e, r) {
|
|
|
23155
23155
|
return e.encodeSimple = function(n, i) {
|
|
23156
23156
|
i === void 0 && (i = []);
|
|
23157
23157
|
for (var a = [], o = [], s = [], u = [], f = 0, l = 0, h = 0, d = 0, v = 0, p = 0; p < n.commands.length; p++) {
|
|
23158
|
-
for (var
|
|
23159
|
-
var x =
|
|
23160
|
-
if (
|
|
23158
|
+
for (var m = n.commands[p], w = 0; w < m.args.length; w += 2) {
|
|
23159
|
+
var x = m.args[w], P = m.args[w + 1], A = 0;
|
|
23160
|
+
if (m.command === "quadraticCurveTo" && w === 2) {
|
|
23161
23161
|
var M = n.commands[p + 1];
|
|
23162
23162
|
if (M && M.command === "quadraticCurveTo") {
|
|
23163
23163
|
var B = (l + M.args[0]) / 2, k = (h + M.args[1]) / 2;
|
|
@@ -23165,9 +23165,9 @@ var z0 = function(e, r) {
|
|
|
23165
23165
|
continue;
|
|
23166
23166
|
}
|
|
23167
23167
|
}
|
|
23168
|
-
|
|
23168
|
+
m.command === "quadraticCurveTo" && w === 0 || (A |= z4), A = this._encodePoint(x, l, o, A, j4, W4), A = this._encodePoint(P, h, s, A, V4, G4), A === d && f < 255 ? (u[u.length - 1] |= q4, f++) : (f > 0 && (u.push(f), f = 0), u.push(A), d = A), l = x, h = P, v++;
|
|
23169
23169
|
}
|
|
23170
|
-
|
|
23170
|
+
m.command === "closePath" && a.push(v - 1);
|
|
23171
23171
|
}
|
|
23172
23172
|
n.commands.length > 1 && n.commands[n.commands.length - 1].command !== "closePath" && a.push(v - 1);
|
|
23173
23173
|
var I = n.bbox, j = {
|
|
@@ -24118,24 +24118,24 @@ function M3(t, e, r) {
|
|
|
24118
24118
|
return e - r;
|
|
24119
24119
|
}
|
|
24120
24120
|
var L3 = function(e, r, n, i, a) {
|
|
24121
|
-
var o = r, s, u, f, l, h, d, v, p,
|
|
24121
|
+
var o = r, s, u, f, l, h, d, v, p, m, w, x, P = new Int32Array(Ki + 1), A = new Int32Array(Ki + 1);
|
|
24122
24122
|
for (x = new Int32Array(a), f = 0; f < a; f++)
|
|
24123
24123
|
P[i[f]]++;
|
|
24124
24124
|
for (A[1] = 0, u = 1; u < Ki; u++)
|
|
24125
24125
|
A[u + 1] = A[u] + P[u];
|
|
24126
24126
|
for (f = 0; f < a; f++)
|
|
24127
24127
|
i[f] !== 0 && (x[A[i[f]]++] = f);
|
|
24128
|
-
if (p = n,
|
|
24128
|
+
if (p = n, m = 1 << p, w = m, A[Ki] === 1) {
|
|
24129
24129
|
for (l = 0; l < w; ++l)
|
|
24130
24130
|
e[r + l] = new Zi(0, x[0] & 65535);
|
|
24131
24131
|
return w;
|
|
24132
24132
|
}
|
|
24133
24133
|
for (l = 0, f = 0, u = 1, h = 2; u <= n; ++u, h <<= 1)
|
|
24134
24134
|
for (; P[u] > 0; --P[u])
|
|
24135
|
-
s = new Zi(u & 255, x[f++] & 65535), td(e, r + l, h,
|
|
24135
|
+
s = new Zi(u & 255, x[f++] & 65535), td(e, r + l, h, m, s), l = ed(l, u);
|
|
24136
24136
|
for (v = w - 1, d = -1, u = n + 1, h = 2; u <= Ki; ++u, h <<= 1)
|
|
24137
24137
|
for (; P[u] > 0; --P[u])
|
|
24138
|
-
(l & v) !== d && (r +=
|
|
24138
|
+
(l & v) !== d && (r += m, p = M3(P, u, n), m = 1 << p, w += m, d = l & v, e[o + d] = new Zi(p + n & 255, r - o - d & 65535)), s = new Zi(u - n & 255, x[f++] & 65535), td(e, r + (l >> n), h, m, s), l = ed(l, u);
|
|
24139
24139
|
return w;
|
|
24140
24140
|
}, Yp = {
|
|
24141
24141
|
HuffmanCode: R3,
|
|
@@ -26000,8 +26000,8 @@ var oA = function(e, r, n, i, a) {
|
|
|
26000
26000
|
var p = nd(e, d);
|
|
26001
26001
|
d += p, i -= p;
|
|
26002
26002
|
}
|
|
26003
|
-
for (var
|
|
26004
|
-
e[r++] = s[
|
|
26003
|
+
for (var m = 0; m < s.length; )
|
|
26004
|
+
e[r++] = s[m++];
|
|
26005
26005
|
return r - h;
|
|
26006
26006
|
}, id = {
|
|
26007
26007
|
kTransforms: iA,
|
|
@@ -26054,12 +26054,12 @@ function mA(t, e, r, n) {
|
|
|
26054
26054
|
if (n.readMoreInput(), n.fillBitWindow(), h += n.val_ >>> n.bit_pos_ & 31, n.bit_pos_ += f[h].bits, d = f[h].value & 255, d < ad)
|
|
26055
26055
|
o = 0, r[i++] = d, d !== 0 && (a = d, u -= 32768 >> d);
|
|
26056
26056
|
else {
|
|
26057
|
-
var v = d - 14, p,
|
|
26058
|
-
if (d === ad && (w = a), s !== w && (o = 0, s = w), p = o, o > 0 && (o -= 2, o <<= v), o += n.readBits(v) + 3,
|
|
26057
|
+
var v = d - 14, p, m, w = 0;
|
|
26058
|
+
if (d === ad && (w = a), s !== w && (o = 0, s = w), p = o, o > 0 && (o -= 2, o <<= v), o += n.readBits(v) + 3, m = o - p, i + m > e)
|
|
26059
26059
|
throw new Error("[ReadHuffmanCodeLengths] symbol + repeat_delta > num_symbols");
|
|
26060
|
-
for (var x = 0; x <
|
|
26060
|
+
for (var x = 0; x < m; x++)
|
|
26061
26061
|
r[i + x] = s;
|
|
26062
|
-
i +=
|
|
26062
|
+
i += m, s !== 0 && (u -= m << 15 - s);
|
|
26063
26063
|
}
|
|
26064
26064
|
}
|
|
26065
26065
|
if (u !== 0)
|
|
@@ -26093,10 +26093,10 @@ function ks(t, e, r, n) {
|
|
|
26093
26093
|
break;
|
|
26094
26094
|
}
|
|
26095
26095
|
} else {
|
|
26096
|
-
var s, d = new Uint8Array(tc), v = 32, p = 0,
|
|
26096
|
+
var s, d = new Uint8Array(tc), v = 32, p = 0, m = [new Lt(2, 0), new Lt(2, 4), new Lt(2, 3), new Lt(3, 2), new Lt(2, 0), new Lt(2, 4), new Lt(2, 3), new Lt(4, 1), new Lt(2, 0), new Lt(2, 4), new Lt(2, 3), new Lt(3, 2), new Lt(2, 0), new Lt(2, 4), new Lt(2, 3), new Lt(4, 5)];
|
|
26097
26097
|
for (s = a; s < tc && v > 0; ++s) {
|
|
26098
26098
|
var w = dA[s], x = 0, P;
|
|
26099
|
-
n.fillBitWindow(), x += n.val_ >>> n.bit_pos_ & 15, n.bit_pos_ +=
|
|
26099
|
+
n.fillBitWindow(), x += n.val_ >>> n.bit_pos_ & 15, n.bit_pos_ += m[x].bits, P = m[x].value, d[w] = P, P !== 0 && (v -= 32 >> P, ++p);
|
|
26100
26100
|
}
|
|
26101
26101
|
if (!(p === 1 || v === 0)) throw new Error("[ReadHuffmanCode] invalid num_codes or space");
|
|
26102
26102
|
mA(d, t, o, n);
|
|
@@ -26215,7 +26215,7 @@ function r1(t, e) {
|
|
|
26215
26215
|
}
|
|
26216
26216
|
var CA = r1;
|
|
26217
26217
|
function EA(t, e) {
|
|
26218
|
-
var r, n = 0, i = 0, a = 0, o, s = 0, u, f, l, h, d = [16, 15, 11, 4], v = 0, p = 0,
|
|
26218
|
+
var r, n = 0, i = 0, a = 0, o, s = 0, u, f, l, h, d = [16, 15, 11, 4], v = 0, p = 0, m = 0, w = [new li(0, 0), new li(0, 0), new li(0, 0)], x, P, A, M = 128 + na.READ_SIZE;
|
|
26219
26219
|
A = new na(t), a = $p(A), o = (1 << a) - 16, u = 1 << a, f = u - 1, l = new Uint8Array(u + M + fr.maxDictionaryWordLength), h = u, x = [], P = [];
|
|
26220
26220
|
for (var B = 0; B < 3 * Pn; B++)
|
|
26221
26221
|
x[B] = new Lt(0, 0), P[B] = new Lt(0, 0);
|
|
@@ -26249,9 +26249,9 @@ function EA(t, e) {
|
|
|
26249
26249
|
for (me = E.num_htrees, we = E.context_map, w[0] = new li(fA, pe), w[1] = new li(cA, W[1]), w[2] = new li($, me), r = 0; r < 3; ++r)
|
|
26250
26250
|
w[r].decode(A);
|
|
26251
26251
|
for (Le = 0, Fe = 0, xe = de[H[0]], ce = zi.lookupOffsets[xe], Te = zi.lookupOffsets[xe + 1], Re = w[1].htrees[0]; k > 0; ) {
|
|
26252
|
-
var y,
|
|
26253
|
-
for (A.readMoreInput(), j[1] === 0 && (Ef(W[1], x, 1, H, q, Z, A), j[1] = Ho(P, Pn, A), Re = w[1].htrees[H[1]]), --j[1], y = ia(w[1].codes, Re, A),
|
|
26254
|
-
A.readMoreInput(), j[0] === 0 && (Ef(W[0], x, 0, H, q, Z, A), j[0] = Ho(P, 0, A), De = H[0] << od, Le = De, xe = de[H[0]], ce = zi.lookupOffsets[xe], Te = zi.lookupOffsets[xe + 1]), He = zi.lookup[ce + p] | zi.lookup[Te +
|
|
26252
|
+
var y, b, D, N, ee, Y, ye, Ue, He, _e, Qe;
|
|
26253
|
+
for (A.readMoreInput(), j[1] === 0 && (Ef(W[1], x, 1, H, q, Z, A), j[1] = Ho(P, Pn, A), Re = w[1].htrees[H[1]]), --j[1], y = ia(w[1].codes, Re, A), b = y >> 6, b >= 2 ? (b -= 2, ye = -1) : ye = 0, D = On.kInsertRangeLut[b] + (y >> 3 & 7), N = On.kCopyRangeLut[b] + (y & 7), ee = On.kInsertLengthPrefixCode[D].offset + A.readBits(On.kInsertLengthPrefixCode[D].nbits), Y = On.kCopyLengthPrefixCode[N].offset + A.readBits(On.kCopyLengthPrefixCode[N].nbits), p = l[n - 1 & f], m = l[n - 2 & f], _e = 0; _e < ee; ++_e)
|
|
26254
|
+
A.readMoreInput(), j[0] === 0 && (Ef(W[0], x, 0, H, q, Z, A), j[0] = Ho(P, 0, A), De = H[0] << od, Le = De, xe = de[H[0]], ce = zi.lookupOffsets[xe], Te = zi.lookupOffsets[xe + 1]), He = zi.lookup[ce + p] | zi.lookup[Te + m], Ge = Q[Le + He], --j[0], m = p, p = ia(w[0].codes, w[0].htrees[Ge], A), l[n & f] = p, (n & f) === f && e.write(l, u), ++n;
|
|
26255
26255
|
if (k -= ee, k <= 0) break;
|
|
26256
26256
|
if (ye < 0) {
|
|
26257
26257
|
var He;
|
|
@@ -26282,7 +26282,7 @@ function EA(t, e) {
|
|
|
26282
26282
|
for (_e = 0; _e < Y; ++_e)
|
|
26283
26283
|
l[n & f] = l[n - Ue & f], (n & f) === f && e.write(l, u), ++n, --k;
|
|
26284
26284
|
}
|
|
26285
|
-
p = l[n - 1 & f],
|
|
26285
|
+
p = l[n - 1 & f], m = l[n - 2 & f];
|
|
26286
26286
|
}
|
|
26287
26287
|
n &= 1073741823;
|
|
26288
26288
|
}
|
|
@@ -26884,7 +26884,7 @@ var r5 = function(t) {
|
|
|
26884
26884
|
}, h5 = /^D:(\d\d\d\d)(\d\d)?(\d\d)?(\d\d)?(\d\d)?(\d\d)?([+\-Z])?(\d\d)?'?(\d\d)?'?$/, u1 = function(t) {
|
|
26885
26885
|
var e = t.match(h5);
|
|
26886
26886
|
if (e) {
|
|
26887
|
-
var r = e[1], n = e[2], i = n === void 0 ? "01" : n, a = e[3], o = a === void 0 ? "01" : a, s = e[4], u = s === void 0 ? "00" : s, f = e[5], l = f === void 0 ? "00" : f, h = e[6], d = h === void 0 ? "00" : h, v = e[7], p = v === void 0 ? "Z" : v,
|
|
26887
|
+
var r = e[1], n = e[2], i = n === void 0 ? "01" : n, a = e[3], o = a === void 0 ? "01" : a, s = e[4], u = s === void 0 ? "00" : s, f = e[5], l = f === void 0 ? "00" : f, h = e[6], d = h === void 0 ? "00" : h, v = e[7], p = v === void 0 ? "Z" : v, m = e[8], w = m === void 0 ? "00" : m, x = e[9], P = x === void 0 ? "00" : x, A = p === "Z" ? "Z" : "" + p + w + ":" + P, M = /* @__PURE__ */ new Date(r + "-" + i + "-" + o + "T" + u + ":" + l + ":" + d + A);
|
|
26888
26888
|
return M;
|
|
26889
26889
|
}
|
|
26890
26890
|
}, sl = function(t, e) {
|
|
@@ -27149,20 +27149,20 @@ var X5 = g1(K5), Df = JSON.parse(X5), Of = (
|
|
|
27149
27149
|
return Z5.includes(t);
|
|
27150
27150
|
}, Yo = function(t, e) {
|
|
27151
27151
|
return t.x === e.x && t.y === e.y && t.width === e.width && t.height === e.height;
|
|
27152
|
-
},
|
|
27152
|
+
}, jt = function(t) {
|
|
27153
27153
|
return "`" + t + "`";
|
|
27154
27154
|
}, Y5 = function(t) {
|
|
27155
27155
|
return "'" + t + "'";
|
|
27156
27156
|
}, xd = function(t) {
|
|
27157
27157
|
var e = typeof t;
|
|
27158
|
-
return e === "string" ? Y5(t) : e === "undefined" ?
|
|
27158
|
+
return e === "string" ? Y5(t) : e === "undefined" ? jt(t) : t;
|
|
27159
27159
|
}, J5 = function(t, e, r) {
|
|
27160
27160
|
for (var n = new Array(r.length), i = 0, a = r.length; i < a; i++) {
|
|
27161
27161
|
var o = r[i];
|
|
27162
27162
|
n[i] = xd(o);
|
|
27163
27163
|
}
|
|
27164
27164
|
var s = n.join(" or ");
|
|
27165
|
-
return
|
|
27165
|
+
return jt(e) + " must be one of " + s + ", but was actually " + xd(t);
|
|
27166
27166
|
}, Rn = function(t, e, r) {
|
|
27167
27167
|
Array.isArray(r) || (r = du(r));
|
|
27168
27168
|
for (var n = 0, i = r.length; n < i; n++)
|
|
@@ -27182,10 +27182,10 @@ var X5 = g1(K5), Df = JSON.parse(X5), Of = (
|
|
|
27182
27182
|
}, eC = function(t, e, r) {
|
|
27183
27183
|
for (var n = new Array(r.length), i = 0, a = r.length; i < a; i++) {
|
|
27184
27184
|
var o = r[i];
|
|
27185
|
-
o === "null" && (n[i] =
|
|
27185
|
+
o === "null" && (n[i] = jt("null")), o === "undefined" && (n[i] = jt("undefined")), o === "string" ? n[i] = jt("string") : o === "number" ? n[i] = jt("number") : o === "boolean" ? n[i] = jt("boolean") : o === "symbol" ? n[i] = jt("symbol") : o === "bigint" ? n[i] = jt("bigint") : o === Array ? n[i] = jt("Array") : o === Uint8Array ? n[i] = jt("Uint8Array") : o === ArrayBuffer ? n[i] = jt("ArrayBuffer") : n[i] = jt(o[1]);
|
|
27186
27186
|
}
|
|
27187
27187
|
var s = n.join(" or ");
|
|
27188
|
-
return
|
|
27188
|
+
return jt(e) + " must be of type " + s + ", but was actually of type " + jt(_5(t));
|
|
27189
27189
|
}, z = function(t, e, r) {
|
|
27190
27190
|
for (var n = 0, i = r.length; n < i; n++)
|
|
27191
27191
|
if ($5(t, r[n]))
|
|
@@ -27198,18 +27198,18 @@ var X5 = g1(K5), Df = JSON.parse(X5), Of = (
|
|
|
27198
27198
|
z(t[n], e, r);
|
|
27199
27199
|
}, cr = function(t, e, r, n) {
|
|
27200
27200
|
if (z(t, e, ["number"]), z(r, "min", ["number"]), z(n, "max", ["number"]), n = Math.max(r, n), t < r || t > n)
|
|
27201
|
-
throw new Error(
|
|
27201
|
+
throw new Error(jt(e) + " must be at least " + r + " and at most " + n + ", but was actually " + t);
|
|
27202
27202
|
}, Mr = function(t, e, r, n) {
|
|
27203
27203
|
z(t, e, ["number", "undefined"]), typeof t == "number" && cr(t, e, r, n);
|
|
27204
27204
|
}, m1 = function(t, e, r) {
|
|
27205
27205
|
if (z(t, e, ["number"]), t % r !== 0)
|
|
27206
|
-
throw new Error(
|
|
27206
|
+
throw new Error(jt(e) + " must be a multiple of " + r + ", but was actually " + t);
|
|
27207
27207
|
}, tC = function(t, e) {
|
|
27208
27208
|
if (!Number.isInteger(t))
|
|
27209
|
-
throw new Error(
|
|
27209
|
+
throw new Error(jt(e) + " must be an integer, but was actually " + t);
|
|
27210
27210
|
}, vu = function(t, e) {
|
|
27211
27211
|
if (![1, 0].includes(Math.sign(t)))
|
|
27212
|
-
throw new Error(
|
|
27212
|
+
throw new Error(jt(e) + " must be a positive number or 0, but was actually " + t);
|
|
27213
27213
|
}, We = new Uint16Array(256);
|
|
27214
27214
|
for (var Jo = 0; Jo < 256; Jo++)
|
|
27215
27215
|
We[Jo] = Jo;
|
|
@@ -28515,7 +28515,7 @@ var hl = (
|
|
|
28515
28515
|
}
|
|
28516
28516
|
return t.prototype.serializeToBuffer = function() {
|
|
28517
28517
|
return Ze(this, void 0, void 0, function() {
|
|
28518
|
-
var e, r, n, i, a, o, s, u, f, l, h, d, v, p,
|
|
28518
|
+
var e, r, n, i, a, o, s, u, f, l, h, d, v, p, m, w, x;
|
|
28519
28519
|
return Ye(this, function(P) {
|
|
28520
28520
|
switch (P.label) {
|
|
28521
28521
|
case 0:
|
|
@@ -28523,7 +28523,7 @@ var hl = (
|
|
|
28523
28523
|
case 1:
|
|
28524
28524
|
e = P.sent(), r = e.size, n = e.header, i = e.indirectObjects, a = e.xref, o = e.trailerDict, s = e.trailer, u = 0, f = new Uint8Array(r), u += n.copyBytesInto(f, u), f[u++] = O.Newline, f[u++] = O.Newline, l = 0, h = i.length, P.label = 2;
|
|
28525
28525
|
case 2:
|
|
28526
|
-
return l < h ? (d = i[l], v = d[0], p = d[1],
|
|
28526
|
+
return l < h ? (d = i[l], v = d[0], p = d[1], m = String(v.objectNumber), u += Yt(m, f, u), f[u++] = O.Space, w = String(v.generationNumber), u += Yt(w, f, u), f[u++] = O.Space, f[u++] = O.o, f[u++] = O.b, f[u++] = O.j, f[u++] = O.Newline, u += p.copyBytesInto(f, u), f[u++] = O.Newline, f[u++] = O.e, f[u++] = O.n, f[u++] = O.d, f[u++] = O.o, f[u++] = O.b, f[u++] = O.j, f[u++] = O.Newline, f[u++] = O.Newline, x = p instanceof F1 ? p.getObjectsCount() : 1, this.shouldWaitForTick(x) ? [4, da()] : [3, 4]) : [3, 5];
|
|
28527
28527
|
case 3:
|
|
28528
28528
|
P.sent(), P.label = 4;
|
|
28529
28529
|
case 4:
|
|
@@ -28617,15 +28617,15 @@ var CC = (
|
|
|
28617
28617
|
o[s] = [l, v, d.generationNumber];
|
|
28618
28618
|
}
|
|
28619
28619
|
if (f.type === kn.Compressed) {
|
|
28620
|
-
var l = f.type, p = f.objectStreamRef,
|
|
28621
|
-
o[s] = [l, p.objectNumber,
|
|
28620
|
+
var l = f.type, p = f.objectStreamRef, m = f.index;
|
|
28621
|
+
o[s] = [l, p.objectNumber, m];
|
|
28622
28622
|
}
|
|
28623
28623
|
}
|
|
28624
28624
|
return o;
|
|
28625
28625
|
}, a.computeMaxEntryByteWidths = function() {
|
|
28626
28626
|
for (var o = a.entryTuplesCache.access(), s = [0, 0, 0], u = 0, f = o.length; u < f; u++) {
|
|
28627
|
-
var l = o[u], h = l[0], d = l[1], v = l[2], p = ls(h),
|
|
28628
|
-
p > s[0] && (s[0] = p),
|
|
28627
|
+
var l = o[u], h = l[0], d = l[1], v = l[2], p = ls(h), m = ls(d), w = ls(v);
|
|
28628
|
+
p > s[0] && (s[0] = p), m > s[1] && (s[1] = m), w > s[2] && (s[2] = w);
|
|
28629
28629
|
}
|
|
28630
28630
|
return s;
|
|
28631
28631
|
}, a.entries = n || [], a.entryTuplesCache = dn.populatedBy(a.computeEntryTuples), a.maxByteWidthsCache = dn.populatedBy(a.computeMaxEntryByteWidths), a.indexCache = dn.populatedBy(a.computeIndex), r.set(T.of("Type"), T.of("XRef")), a;
|
|
@@ -28654,12 +28654,12 @@ var CC = (
|
|
|
28654
28654
|
return i;
|
|
28655
28655
|
}, e.prototype.getUnencodedContents = function() {
|
|
28656
28656
|
for (var r = this.entryTuplesCache.access(), n = this.maxByteWidthsCache.access(), i = new Uint8Array(this.getUnencodedContentsSize()), a = 0, o = 0, s = r.length; o < s; o++) {
|
|
28657
|
-
for (var u = r[o], f = u[0], l = u[1], h = u[2], d = ji(Vi(f)), v = ji(Vi(l)), p = ji(Vi(h)),
|
|
28658
|
-
i[a++] = d[
|
|
28659
|
-
for (var
|
|
28660
|
-
i[a++] = v[
|
|
28661
|
-
for (var
|
|
28662
|
-
i[a++] = p[
|
|
28657
|
+
for (var u = r[o], f = u[0], l = u[1], h = u[2], d = ji(Vi(f)), v = ji(Vi(l)), p = ji(Vi(h)), m = n[0] - 1; m >= 0; m--)
|
|
28658
|
+
i[a++] = d[m] || 0;
|
|
28659
|
+
for (var m = n[1] - 1; m >= 0; m--)
|
|
28660
|
+
i[a++] = v[m] || 0;
|
|
28661
|
+
for (var m = n[2] - 1; m >= 0; m--)
|
|
28662
|
+
i[a++] = p[m] || 0;
|
|
28663
28663
|
}
|
|
28664
28664
|
return i;
|
|
28665
28665
|
}, e.prototype.getUnencodedContentsSize = function() {
|
|
@@ -28687,13 +28687,13 @@ var CC = (
|
|
|
28687
28687
|
}
|
|
28688
28688
|
return e.prototype.computeBufferSize = function() {
|
|
28689
28689
|
return Ze(this, void 0, void 0, function() {
|
|
28690
|
-
var r, n, i, a, o, s, u, f, p,
|
|
28690
|
+
var r, n, i, a, o, s, u, f, p, m, l, x, h, d, w, v, p, m, w, x, P, A, M, B;
|
|
28691
28691
|
return Ye(this, function(k) {
|
|
28692
28692
|
switch (k.label) {
|
|
28693
28693
|
case 0:
|
|
28694
|
-
r = this.context.largestObjectNumber + 1, n = pu.forVersion(1, 7), i = n.sizeInBytes() + 2, a = CC.create(this.createTrailerDict(), this.encodeStreams), o = [], s = [], u = [], f = this.context.enumerateIndirectObjects(), p = 0,
|
|
28694
|
+
r = this.context.largestObjectNumber + 1, n = pu.forVersion(1, 7), i = n.sizeInBytes() + 2, a = CC.create(this.createTrailerDict(), this.encodeStreams), o = [], s = [], u = [], f = this.context.enumerateIndirectObjects(), p = 0, m = f.length, k.label = 1;
|
|
28695
28695
|
case 1:
|
|
28696
|
-
return p <
|
|
28696
|
+
return p < m ? (l = f[p], x = l[0], h = l[1], d = x === this.context.trailerInfo.Encrypt || h instanceof vr || h instanceof A1 || x.generationNumber !== 0, d ? (o.push(l), a.addUncompressedEntry(x, i), i += this.computeIndirectObjectSize(l), this.shouldWaitForTick(1) ? [4, da()] : [3, 3]) : [3, 4]) : [3, 6];
|
|
28697
28697
|
case 2:
|
|
28698
28698
|
k.sent(), k.label = 3;
|
|
28699
28699
|
case 3:
|
|
@@ -28703,9 +28703,9 @@ var CC = (
|
|
|
28703
28703
|
case 5:
|
|
28704
28704
|
return p++, [3, 1];
|
|
28705
28705
|
case 6:
|
|
28706
|
-
p = 0,
|
|
28706
|
+
p = 0, m = s.length, k.label = 7;
|
|
28707
28707
|
case 7:
|
|
28708
|
-
return p <
|
|
28708
|
+
return p < m ? (w = s[p], x = u[p], P = F1.withContextAndObjects(this.context, w, this.encodeStreams), a.addUncompressedEntry(x, i), i += this.computeIndirectObjectSize([x, P]), o.push([x, P]), this.shouldWaitForTick(w.length) ? [4, da()] : [3, 9]) : [3, 10];
|
|
28709
28709
|
case 8:
|
|
28710
28710
|
k.sent(), k.label = 9;
|
|
28711
28711
|
case 9:
|
|
@@ -28995,13 +28995,13 @@ end`;
|
|
|
28995
28995
|
});
|
|
28996
28996
|
}, t.prototype.embedFontDescriptor = function(e) {
|
|
28997
28997
|
return Ze(this, void 0, void 0, function() {
|
|
28998
|
-
var r, n, i, a, o, s, u, f, l, h, d, v, p,
|
|
28998
|
+
var r, n, i, a, o, s, u, f, l, h, d, v, p, m, w;
|
|
28999
28999
|
return Ye(this, function(x) {
|
|
29000
29000
|
switch (x.label) {
|
|
29001
29001
|
case 0:
|
|
29002
29002
|
return [4, this.embedFontStream(e)];
|
|
29003
29003
|
case 1:
|
|
29004
|
-
return r = x.sent(), n = this.scale, i = this.font, a = i.italicAngle, o = i.ascent, s = i.descent, u = i.capHeight, f = i.xHeight, l = this.font.bbox, h = l.minX, d = l.minY, v = l.maxX, p = l.maxY,
|
|
29004
|
+
return r = x.sent(), n = this.scale, i = this.font, a = i.italicAngle, o = i.ascent, s = i.descent, u = i.capHeight, f = i.xHeight, l = this.font.bbox, h = l.minX, d = l.minY, v = l.maxX, p = l.maxY, m = e.obj((w = {
|
|
29005
29005
|
Type: "FontDescriptor",
|
|
29006
29006
|
FontName: this.baseFontName,
|
|
29007
29007
|
Flags: kC(this.font),
|
|
@@ -29014,7 +29014,7 @@ end`;
|
|
|
29014
29014
|
// Not sure how to compute/find this, nor is anybody else really:
|
|
29015
29015
|
// https://stackoverflow.com/questions/35485179/stemv-value-of-the-truetype-font
|
|
29016
29016
|
StemV: 0
|
|
29017
|
-
}, w[this.isCFF() ? "FontFile3" : "FontFile2"] = r, w)), [2, e.register(
|
|
29017
|
+
}, w[this.isCFF() ? "FontFile3" : "FontFile2"] = r, w)), [2, e.register(m)];
|
|
29018
29018
|
}
|
|
29019
29019
|
});
|
|
29020
29020
|
});
|
|
@@ -29212,10 +29212,10 @@ ie.toRGBA8 = function(t) {
|
|
|
29212
29212
|
t.frames[0].data == null && (t.frames[0].data = t.data);
|
|
29213
29213
|
for (var i = e * r * 4, a = new Uint8Array(i), o = new Uint8Array(i), s = new Uint8Array(i), u = 0; u < t.frames.length; u++) {
|
|
29214
29214
|
var f = t.frames[u], l = f.rect.x, h = f.rect.y, d = f.rect.width, v = f.rect.height, p = ie.toRGBA8.decodeImage(f.data, d, v, t);
|
|
29215
|
-
if (u != 0) for (var
|
|
29215
|
+
if (u != 0) for (var m = 0; m < i; m++) s[m] = a[m];
|
|
29216
29216
|
if (f.blend == 0 ? ie._copyTile(p, d, v, a, e, r, l, h, 0) : f.blend == 1 && ie._copyTile(p, d, v, a, e, r, l, h, 1), n.push(a.buffer.slice(0)), f.dispose != 0) {
|
|
29217
29217
|
if (f.dispose == 1) ie._copyTile(o, d, v, a, e, r, l, h, 0);
|
|
29218
|
-
else if (f.dispose == 2) for (var
|
|
29218
|
+
else if (f.dispose == 2) for (var m = 0; m < i; m++) a[m] = s[m];
|
|
29219
29219
|
}
|
|
29220
29220
|
}
|
|
29221
29221
|
return n;
|
|
@@ -29232,22 +29232,22 @@ ie.toRGBA8.decodeImage = function(t, e, r, n) {
|
|
|
29232
29232
|
var p = n.tabs.tRNS;
|
|
29233
29233
|
if (p == null) {
|
|
29234
29234
|
if (l == 8) for (var v = 0; v < i; v++) {
|
|
29235
|
-
var
|
|
29236
|
-
u[v] = 255 << 24 | t[
|
|
29235
|
+
var m = v * 3;
|
|
29236
|
+
u[v] = 255 << 24 | t[m + 2] << 16 | t[m + 1] << 8 | t[m];
|
|
29237
29237
|
}
|
|
29238
29238
|
if (l == 16) for (var v = 0; v < i; v++) {
|
|
29239
|
-
var
|
|
29240
|
-
u[v] = 255 << 24 | t[
|
|
29239
|
+
var m = v * 6;
|
|
29240
|
+
u[v] = 255 << 24 | t[m + 4] << 16 | t[m + 2] << 8 | t[m];
|
|
29241
29241
|
}
|
|
29242
29242
|
} else {
|
|
29243
29243
|
var w = p[0], x = p[1], P = p[2];
|
|
29244
29244
|
if (l == 8) for (var v = 0; v < i; v++) {
|
|
29245
|
-
var A = v << 2,
|
|
29246
|
-
u[v] = 255 << 24 | t[
|
|
29245
|
+
var A = v << 2, m = v * 3;
|
|
29246
|
+
u[v] = 255 << 24 | t[m + 2] << 16 | t[m + 1] << 8 | t[m], t[m] == w && t[m + 1] == x && t[m + 2] == P && (s[A + 3] = 0);
|
|
29247
29247
|
}
|
|
29248
29248
|
if (l == 16) for (var v = 0; v < i; v++) {
|
|
29249
|
-
var A = v << 2,
|
|
29250
|
-
u[v] = 255 << 24 | t[
|
|
29249
|
+
var A = v << 2, m = v * 6;
|
|
29250
|
+
u[v] = 255 << 24 | t[m + 4] << 16 | t[m + 2] << 8 | t[m], h(t, m) == w && h(t, m + 2) == x && h(t, m + 4) == P && (s[A + 3] = 0);
|
|
29251
29251
|
}
|
|
29252
29252
|
}
|
|
29253
29253
|
} else if (f == 3) {
|
|
@@ -29321,8 +29321,8 @@ ie.decode = function(t) {
|
|
|
29321
29321
|
o.tabs[p] = { num_frames: a(e, r), num_plays: a(e, r + 4) }, f = new Uint8Array(e.length);
|
|
29322
29322
|
else if (p == "fcTL") {
|
|
29323
29323
|
if (l != 0) {
|
|
29324
|
-
var
|
|
29325
|
-
|
|
29324
|
+
var m = o.frames[o.frames.length - 1];
|
|
29325
|
+
m.data = ie.decode._decompress(o, f.slice(0, l), m.rect.width, m.rect.height), l = 0;
|
|
29326
29326
|
}
|
|
29327
29327
|
var w = { x: a(e, r + 12), y: a(e, r + 16), width: a(e, r + 4), height: a(e, r + 8) }, x = i(e, r + 22);
|
|
29328
29328
|
x = i(e, r + 20) / (x == 0 ? 100 : x);
|
|
@@ -29365,8 +29365,8 @@ ie.decode = function(t) {
|
|
|
29365
29365
|
r += v, n.readUint(e, r), r += 4;
|
|
29366
29366
|
}
|
|
29367
29367
|
if (l != 0) {
|
|
29368
|
-
var
|
|
29369
|
-
|
|
29368
|
+
var m = o.frames[o.frames.length - 1];
|
|
29369
|
+
m.data = ie.decode._decompress(o, f.slice(0, l), m.rect.width, m.rect.height), l = 0;
|
|
29370
29370
|
}
|
|
29371
29371
|
return o.data = ie.decode._decompress(o, s, o.width, o.height), delete o.compress, delete o.interlace, delete o.filter, o;
|
|
29372
29372
|
};
|
|
@@ -29383,7 +29383,7 @@ ie.inflateRaw = (function() {
|
|
|
29383
29383
|
return t.H = {}, t.H.N = function(e, r) {
|
|
29384
29384
|
var n = Uint8Array, i = 0, a = 0, o = 0, s = 0, u = 0, f = 0, l = 0, h = 0, d = 0, v, p;
|
|
29385
29385
|
if (e[0] == 3 && e[1] == 0) return r || new n(0);
|
|
29386
|
-
var
|
|
29386
|
+
var m = t.H, w = m.b, x = m.e, P = m.R, A = m.n, M = m.A, B = m.Z, k = m.m, I = r == null;
|
|
29387
29387
|
for (I && (r = new n(e.length >>> 2 << 3)); i == 0; ) {
|
|
29388
29388
|
if (i = w(e, d, 1), a = w(e, d + 1, 2), d += 3, a == 0) {
|
|
29389
29389
|
(d & 7) != 0 && (d += 8 - (d & 7));
|
|
@@ -29400,9 +29400,9 @@ ie.inflateRaw = (function() {
|
|
|
29400
29400
|
k.Q[(k.X[q] << 1) + 1] = Z, Z > W && (W = Z);
|
|
29401
29401
|
}
|
|
29402
29402
|
d += 3 * u, A(k.Q, W), M(k.Q, W, k.u), v = k.w, p = k.d, d = P(k.u, (1 << W) - 1, o + s, e, d, k.v);
|
|
29403
|
-
var U =
|
|
29403
|
+
var U = m.V(k.v, 0, o, k.C);
|
|
29404
29404
|
f = (1 << U) - 1;
|
|
29405
|
-
var re =
|
|
29405
|
+
var re = m.V(k.v, o, s, k.D);
|
|
29406
29406
|
l = (1 << re) - 1, A(k.C, U), M(k.C, U, v), A(k.D, re), M(k.D, re, p);
|
|
29407
29407
|
}
|
|
29408
29408
|
for (; ; ) {
|
|
@@ -29510,10 +29510,10 @@ ie.inflateRaw = (function() {
|
|
|
29510
29510
|
})();
|
|
29511
29511
|
ie.decode._readInterlace = function(t, e) {
|
|
29512
29512
|
for (var r = e.width, n = e.height, i = ie.decode._getBPP(e), a = i >> 3, o = Math.ceil(r * i / 8), s = new Uint8Array(n * o), u = 0, f = [0, 0, 4, 0, 2, 0, 1], l = [0, 4, 0, 2, 0, 1, 0], h = [8, 8, 8, 4, 4, 2, 2], d = [8, 8, 4, 4, 2, 2, 1], v = 0; v < 7; ) {
|
|
29513
|
-
for (var p = h[v],
|
|
29513
|
+
for (var p = h[v], m = d[v], w = 0, x = 0, P = f[v]; P < n; )
|
|
29514
29514
|
P += p, x++;
|
|
29515
29515
|
for (var A = l[v]; A < r; )
|
|
29516
|
-
A +=
|
|
29516
|
+
A += m, w++;
|
|
29517
29517
|
var M = Math.ceil(w * i / 8);
|
|
29518
29518
|
ie.decode._filterZero(t, e, u, w, x);
|
|
29519
29519
|
for (var B = 0, k = f[v]; k < n; ) {
|
|
@@ -29532,7 +29532,7 @@ ie.decode._readInterlace = function(t, e) {
|
|
|
29532
29532
|
}
|
|
29533
29533
|
if (i >= 8)
|
|
29534
29534
|
for (var W = k * o + I * a, q = 0; q < a; q++) s[W + q] = t[(j >> 3) + q];
|
|
29535
|
-
j += i, I +=
|
|
29535
|
+
j += i, I += m;
|
|
29536
29536
|
}
|
|
29537
29537
|
B++, k += p;
|
|
29538
29538
|
}
|
|
@@ -29620,15 +29620,15 @@ ie._copyTile = function(t, e, r, n, i, a, o, s, u) {
|
|
|
29620
29620
|
if (o >= 0 && s >= 0 ? (h = v * e + p << 2, d = (s + v) * i + o + p << 2) : (h = (-s + v) * e - o + p << 2, d = v * i + p << 2), u == 0)
|
|
29621
29621
|
n[d] = t[h], n[d + 1] = t[h + 1], n[d + 2] = t[h + 2], n[d + 3] = t[h + 3];
|
|
29622
29622
|
else if (u == 1) {
|
|
29623
|
-
var
|
|
29623
|
+
var m = t[h + 3] * 0.00392156862745098, w = t[h] * m, x = t[h + 1] * m, P = t[h + 2] * m, A = n[d + 3] * (1 / 255), M = n[d] * A, B = n[d + 1] * A, k = n[d + 2] * A, I = 1 - m, j = m + A * I, H = j == 0 ? 0 : 1 / j;
|
|
29624
29624
|
n[d + 3] = 255 * j, n[d + 0] = (w + M * I) * H, n[d + 1] = (x + B * I) * H, n[d + 2] = (P + k * I) * H;
|
|
29625
29625
|
} else if (u == 2) {
|
|
29626
|
-
var
|
|
29627
|
-
|
|
29626
|
+
var m = t[h + 3], w = t[h], x = t[h + 1], P = t[h + 2], A = n[d + 3], M = n[d], B = n[d + 1], k = n[d + 2];
|
|
29627
|
+
m == A && w == M && x == B && P == k ? (n[d] = 0, n[d + 1] = 0, n[d + 2] = 0, n[d + 3] = 0) : (n[d] = w, n[d + 1] = x, n[d + 2] = P, n[d + 3] = m);
|
|
29628
29628
|
} else if (u == 3) {
|
|
29629
|
-
var
|
|
29630
|
-
if (
|
|
29631
|
-
if (
|
|
29629
|
+
var m = t[h + 3], w = t[h], x = t[h + 1], P = t[h + 2], A = n[d + 3], M = n[d], B = n[d + 1], k = n[d + 2];
|
|
29630
|
+
if (m == A && w == M && x == B && P == k) continue;
|
|
29631
|
+
if (m < 220 && A > 20) return !1;
|
|
29632
29632
|
}
|
|
29633
29633
|
return !0;
|
|
29634
29634
|
};
|
|
@@ -29651,9 +29651,9 @@ ie.encode._main = function(t, e, r, n, i) {
|
|
|
29651
29651
|
for (var v = t.plte.length, p = 0; p < v; p++) t.plte[p] >>> 24 != 255 && (h = !0);
|
|
29652
29652
|
d += 8 + v * 3 + 4 + (h ? 8 + v * 1 + 4 : 0);
|
|
29653
29653
|
}
|
|
29654
|
-
for (var
|
|
29655
|
-
var w = t.frames[
|
|
29656
|
-
l && (d += 38), d += w.cimg.length + 12,
|
|
29654
|
+
for (var m = 0; m < t.frames.length; m++) {
|
|
29655
|
+
var w = t.frames[m];
|
|
29656
|
+
l && (d += 38), d += w.cimg.length + 12, m != 0 && (d += 4);
|
|
29657
29657
|
}
|
|
29658
29658
|
d += 12;
|
|
29659
29659
|
for (var x = new Uint8Array(d), P = [137, 80, 78, 71, 13, 10, 26, 10], p = 0; p < 8; p++) x[p] = P[p];
|
|
@@ -29670,13 +29670,13 @@ ie.encode._main = function(t, e, r, n, i) {
|
|
|
29670
29670
|
f += v, o(x, f, a(x, f - v - 4, v + 4)), f += 4;
|
|
29671
29671
|
}
|
|
29672
29672
|
}
|
|
29673
|
-
for (var j = 0,
|
|
29674
|
-
var w = t.frames[
|
|
29675
|
-
l && (o(x, f, 26), f += 4, u(x, f, "fcTL"), f += 4, o(x, f, j++), f += 4, o(x, f, w.rect.width), f += 4, o(x, f, w.rect.height), f += 4, o(x, f, w.rect.x), f += 4, o(x, f, w.rect.y), f += 4, s(x, f, n[
|
|
29673
|
+
for (var j = 0, m = 0; m < t.frames.length; m++) {
|
|
29674
|
+
var w = t.frames[m];
|
|
29675
|
+
l && (o(x, f, 26), f += 4, u(x, f, "fcTL"), f += 4, o(x, f, j++), f += 4, o(x, f, w.rect.width), f += 4, o(x, f, w.rect.height), f += 4, o(x, f, w.rect.x), f += 4, o(x, f, w.rect.y), f += 4, s(x, f, n[m]), f += 2, s(x, f, 1e3), f += 2, x[f] = w.dispose, f++, x[f] = w.blend, f++, o(x, f, a(x, f - 30, 30)), f += 4);
|
|
29676
29676
|
var H = w.cimg, v = H.length;
|
|
29677
|
-
o(x, f, v + (
|
|
29677
|
+
o(x, f, v + (m == 0 ? 0 : 4)), f += 4;
|
|
29678
29678
|
var W = f;
|
|
29679
|
-
u(x, f,
|
|
29679
|
+
u(x, f, m == 0 ? "IDAT" : "fdAT"), f += 4, m != 0 && (o(x, f, j++), f += 4), x.set(H, f), f += v, o(x, f, a(x, W, f - W)), f += 4;
|
|
29680
29680
|
}
|
|
29681
29681
|
return o(x, f, 0), f += 4, u(x, f, "IEND"), f += 4, o(x, f, a(x, f - 4, 4)), f += 4, x.buffer;
|
|
29682
29682
|
};
|
|
@@ -29690,7 +29690,7 @@ ie.encode.compressPNG = function(t, e, r) {
|
|
|
29690
29690
|
};
|
|
29691
29691
|
ie.encode.compress = function(t, e, r, n, i) {
|
|
29692
29692
|
for (var a = i[0], o = i[1], s = i[2], u = i[3], f = i[4], l = 6, h = 8, d = 255, v = 0; v < t.length; v++)
|
|
29693
|
-
for (var p = new Uint8Array(t[v]),
|
|
29693
|
+
for (var p = new Uint8Array(t[v]), m = p.length, w = 0; w < m; w += 4) d &= p[w + 3];
|
|
29694
29694
|
var x = d != 255, P = ie.encode.framize(t, e, r, a, o, s), A = {}, M = [], B = [];
|
|
29695
29695
|
if (n != 0) {
|
|
29696
29696
|
for (var k = [], w = 0; w < P.length; w++) k.push(P[w].img.buffer);
|
|
@@ -29704,9 +29704,9 @@ ie.encode.compress = function(t, e, r, n, i) {
|
|
|
29704
29704
|
for (var w = 0; w < j.plte.length; w++) M.push(j.plte[w].est.rgba);
|
|
29705
29705
|
} else
|
|
29706
29706
|
for (var v = 0; v < P.length; v++) {
|
|
29707
|
-
var U = P[v], re = new Uint32Array(U.img.buffer), _ = U.rect.width,
|
|
29707
|
+
var U = P[v], re = new Uint32Array(U.img.buffer), _ = U.rect.width, m = re.length, $ = new Uint8Array(m);
|
|
29708
29708
|
B.push($);
|
|
29709
|
-
for (var w = 0; w <
|
|
29709
|
+
for (var w = 0; w < m; w++) {
|
|
29710
29710
|
var Q = re[w];
|
|
29711
29711
|
if (w != 0 && Q == re[w - 1]) $[w] = $[w - 1];
|
|
29712
29712
|
else if (w > _ && Q == re[w - _]) $[w] = $[w - _];
|
|
@@ -29749,7 +29749,7 @@ ie.encode.compress = function(t, e, r, n, i) {
|
|
|
29749
29749
|
};
|
|
29750
29750
|
ie.encode.framize = function(t, e, r, n, i, a) {
|
|
29751
29751
|
for (var o = [], s = 0; s < t.length; s++) {
|
|
29752
|
-
var u = new Uint8Array(t[s]), f = new Uint32Array(u.buffer), l, h = 0, d = 0, v = e, p = r,
|
|
29752
|
+
var u = new Uint8Array(t[s]), f = new Uint32Array(u.buffer), l, h = 0, d = 0, v = e, p = r, m = n ? 1 : 0;
|
|
29753
29753
|
if (s != 0) {
|
|
29754
29754
|
for (var w = a || n || s == 1 || o[s - 2].dispose != 0 ? 1 : 2, x = 0, P = 1e9, A = 0; A < w; A++) {
|
|
29755
29755
|
for (var U = new Uint8Array(t[s - 1 - A]), M = new Uint32Array(t[s - 1 - A]), B = e, k = r, I = -1, j = -1, H = 0; H < r; H++) for (var W = 0; W < e; W++) {
|
|
@@ -29761,9 +29761,9 @@ ie.encode.framize = function(t, e, r, n, i, a) {
|
|
|
29761
29761
|
Z < P && (P = Z, x = A, h = B, d = k, v = I - B + 1, p = j - k + 1);
|
|
29762
29762
|
}
|
|
29763
29763
|
var U = new Uint8Array(t[s - 1 - x]);
|
|
29764
|
-
x == 1 && (o[s - 1].dispose = 2), l = new Uint8Array(v * p * 4), ie._copyTile(U, e, r, l, v, p, -h, -d, 0),
|
|
29764
|
+
x == 1 && (o[s - 1].dispose = 2), l = new Uint8Array(v * p * 4), ie._copyTile(U, e, r, l, v, p, -h, -d, 0), m = ie._copyTile(u, e, r, l, v, p, -h, -d, 3) ? 1 : 0, m == 1 ? ie.encode._prepareDiff(u, e, r, l, { x: h, y: d, width: v, height: p }) : ie._copyTile(u, e, r, l, v, p, -h, -d, 0);
|
|
29765
29765
|
} else l = u.slice(0);
|
|
29766
|
-
o.push({ rect: { x: h, y: d, width: v, height: p }, img: l, blend:
|
|
29766
|
+
o.push({ rect: { x: h, y: d, width: v, height: p }, img: l, blend: m, dispose: 0 });
|
|
29767
29767
|
}
|
|
29768
29768
|
if (n) for (var s = 0; s < o.length; s++) {
|
|
29769
29769
|
var re = o[s];
|
|
@@ -29780,11 +29780,11 @@ ie.encode.framize = function(t, e, r, n, i, a) {
|
|
|
29780
29780
|
return o;
|
|
29781
29781
|
};
|
|
29782
29782
|
ie.encode._updateFrame = function(t, e, r, n, i, a, o) {
|
|
29783
|
-
for (var s = Uint8Array, u = Uint32Array, f = new s(t[i - 1]), l = new u(t[i - 1]), h = i + 1 < t.length ? new s(t[i + 1]) : null, d = new s(t[i]), v = new u(d.buffer), p = e,
|
|
29783
|
+
for (var s = Uint8Array, u = Uint32Array, f = new s(t[i - 1]), l = new u(t[i - 1]), h = i + 1 < t.length ? new s(t[i + 1]) : null, d = new s(t[i]), v = new u(d.buffer), p = e, m = r, w = -1, x = -1, P = 0; P < a.height; P++) for (var A = 0; A < a.width; A++) {
|
|
29784
29784
|
var M = a.x + A, B = a.y + P, k = B * e + M, I = v[k];
|
|
29785
|
-
I == 0 || n[i - 1].dispose == 0 && l[k] == I && (h == null || h[k * 4 + 3] != 0) || (M < p && (p = M), M > w && (w = M), B <
|
|
29785
|
+
I == 0 || n[i - 1].dispose == 0 && l[k] == I && (h == null || h[k * 4 + 3] != 0) || (M < p && (p = M), M > w && (w = M), B < m && (m = B), B > x && (x = B));
|
|
29786
29786
|
}
|
|
29787
|
-
w == -1 && (p =
|
|
29787
|
+
w == -1 && (p = m = w = x = 0), o && ((p & 1) == 1 && p--, (m & 1) == 1 && m--), a = { x: p, y: m, width: w - p + 1, height: x - m + 1 };
|
|
29788
29788
|
var j = n[i];
|
|
29789
29789
|
j.rect = a, j.blend = 1, j.img = new Uint8Array(a.width * a.height * 4), n[i - 1].dispose == 0 ? (ie._copyTile(f, e, r, j.img, a.width, a.height, -a.x, -a.y, 0), ie.encode._prepareDiff(d, e, r, j.img, a)) : ie._copyTile(d, e, r, j.img, a.width, a.height, -a.x, -a.y, 0);
|
|
29790
29790
|
};
|
|
@@ -29850,7 +29850,7 @@ ie.quantize = function(t, e) {
|
|
|
29850
29850
|
var r = new Uint8Array(t), n = r.slice(0), i = new Uint32Array(n.buffer), a = ie.quantize.getKDtree(n, e), o = a[0], s = a[1];
|
|
29851
29851
|
ie.quantize.planeDst;
|
|
29852
29852
|
for (var u = r, f = i, l = u.length, h = new Uint8Array(r.length >> 2), d = 0; d < l; d += 4) {
|
|
29853
|
-
var v = u[d] * 0.00392156862745098, p = u[d + 1] * (1 / 255),
|
|
29853
|
+
var v = u[d] * 0.00392156862745098, p = u[d + 1] * (1 / 255), m = u[d + 2] * (1 / 255), w = u[d + 3] * (1 / 255), x = ie.quantize.getNearest(o, v, p, m, w);
|
|
29854
29854
|
h[d >> 2] = x.ind, f[d >> 2] = x.est.rgba;
|
|
29855
29855
|
}
|
|
29856
29856
|
return { abuf: n.buffer, inds: h, plte: s };
|
|
@@ -29875,8 +29875,8 @@ ie.quantize.getKDtree = function(t, e, r) {
|
|
|
29875
29875
|
for (var u = 0; u < 4; u++) v.bst.m[u] = f.bst.m[u] - d.bst.m[u];
|
|
29876
29876
|
v.est = ie.quantize.estats(v.bst), f.left = d, f.right = v, a[s] = d, a.push(v);
|
|
29877
29877
|
}
|
|
29878
|
-
a.sort(function(p,
|
|
29879
|
-
return
|
|
29878
|
+
a.sort(function(p, m) {
|
|
29879
|
+
return m.bst.N - p.bst.N;
|
|
29880
29880
|
});
|
|
29881
29881
|
for (var u = 0; u < a.length; u++) a[u].ind = u;
|
|
29882
29882
|
return [i, a];
|
|
@@ -29941,7 +29941,7 @@ ie.quantize.estats = function(t) {
|
|
|
29941
29941
|
e[15] - s * s * u
|
|
29942
29942
|
], l = f, h = ie.M4, d = [0.5, 0.5, 0.5, 0.5], v = 0, p = 0;
|
|
29943
29943
|
if (n != 0)
|
|
29944
|
-
for (var
|
|
29944
|
+
for (var m = 0; m < 10 && (d = h.multVec(l, d), p = Math.sqrt(h.dot(d, d)), d = h.sml(1 / p, d), !(Math.abs(p - v) < 1e-9)); m++)
|
|
29945
29945
|
v = p;
|
|
29946
29946
|
var w = [i * u, a * u, o * u, s * u], x = h.dot(h.sml(255, w), d);
|
|
29947
29947
|
return {
|
|
@@ -30956,12 +30956,12 @@ var NC = (
|
|
|
30956
30956
|
if (a === 1)
|
|
30957
30957
|
d = WC, v = GC;
|
|
30958
30958
|
else if (a === 2) {
|
|
30959
|
-
var p = this.getBits(5) + 257,
|
|
30959
|
+
var p = this.getBits(5) + 257, m = this.getBits(5) + 1, w = this.getBits(4) + 4, x = new Uint8Array(Bd.length), P = void 0;
|
|
30960
30960
|
for (P = 0; P < w; ++P)
|
|
30961
30961
|
x[Bd[P]] = this.getBits(3);
|
|
30962
30962
|
var A = this.generateHuffmanTable(x);
|
|
30963
30963
|
n = 0, P = 0;
|
|
30964
|
-
for (var M = p +
|
|
30964
|
+
for (var M = p + m, B = new Uint8Array(M), k = void 0, I = void 0, j = void 0; P < M; ) {
|
|
30965
30965
|
var H = this.getCode(A);
|
|
30966
30966
|
if (H === 16)
|
|
30967
30967
|
k = 2, I = 3, j = n;
|
|
@@ -31054,7 +31054,7 @@ var NC = (
|
|
|
31054
31054
|
return e.prototype.readBlock = function() {
|
|
31055
31055
|
var r = 512, n = r * 2, i = r, a, o, s, u = this.lzwState;
|
|
31056
31056
|
if (u) {
|
|
31057
|
-
var f = u.earlyChange, l = u.nextCode, h = u.dictionaryValues, d = u.dictionaryLengths, v = u.dictionaryPrevCodes, p = u.codeLength,
|
|
31057
|
+
var f = u.earlyChange, l = u.nextCode, h = u.dictionaryValues, d = u.dictionaryLengths, v = u.dictionaryPrevCodes, p = u.codeLength, m = u.prevCode, w = u.currentSequence, x = u.currentSequenceLength, P = 0, A = this.bufferLength, M = this.ensureBuffer(this.bufferLength + n);
|
|
31058
31058
|
for (a = 0; a < r; a++) {
|
|
31059
31059
|
var B = this.readBits(p), k = x > 0;
|
|
31060
31060
|
if (!B || B < 256)
|
|
@@ -31072,7 +31072,7 @@ var NC = (
|
|
|
31072
31072
|
this.eof = !0, delete this.lzwState;
|
|
31073
31073
|
break;
|
|
31074
31074
|
}
|
|
31075
|
-
if (k && (v[l] =
|
|
31075
|
+
if (k && (v[l] = m, d[l] = d[m] + 1, h[l] = w[0], l++, p = l + f & l + f - 1 ? p : Math.min(Math.log(l + f) / 0.6931471805599453 + 1, 12) | 0), m = B, P += x, n < P) {
|
|
31076
31076
|
do
|
|
31077
31077
|
n += i;
|
|
31078
31078
|
while (n < P);
|
|
@@ -31081,7 +31081,7 @@ var NC = (
|
|
|
31081
31081
|
for (o = 0; o < x; o++)
|
|
31082
31082
|
M[A++] = w[o];
|
|
31083
31083
|
}
|
|
31084
|
-
u.nextCode = l, u.codeLength = p, u.prevCode =
|
|
31084
|
+
u.nextCode = l, u.codeLength = p, u.prevCode = m, u.currentSequenceLength = x, this.bufferLength = A;
|
|
31085
31085
|
}
|
|
31086
31086
|
}, e.prototype.readBits = function(r) {
|
|
31087
31087
|
for (var n = this.bitsCached, i = this.cachedData; n < r; ) {
|
|
@@ -31819,23 +31819,23 @@ var Md = (
|
|
|
31819
31819
|
return new e(n, i);
|
|
31820
31820
|
}, e;
|
|
31821
31821
|
})(pl)
|
|
31822
|
-
),
|
|
31822
|
+
), Ut = function(t) {
|
|
31823
31823
|
return 1 << t;
|
|
31824
31824
|
}, Lr;
|
|
31825
31825
|
(function(t) {
|
|
31826
|
-
t[t.ReadOnly =
|
|
31826
|
+
t[t.ReadOnly = Ut(0)] = "ReadOnly", t[t.Required = Ut(1)] = "Required", t[t.NoExport = Ut(2)] = "NoExport";
|
|
31827
31827
|
})(Lr || (Lr = {}));
|
|
31828
31828
|
var Ar;
|
|
31829
31829
|
(function(t) {
|
|
31830
|
-
t[t.NoToggleToOff =
|
|
31830
|
+
t[t.NoToggleToOff = Ut(14)] = "NoToggleToOff", t[t.Radio = Ut(15)] = "Radio", t[t.PushButton = Ut(16)] = "PushButton", t[t.RadiosInUnison = Ut(25)] = "RadiosInUnison";
|
|
31831
31831
|
})(Ar || (Ar = {}));
|
|
31832
31832
|
var Tt;
|
|
31833
31833
|
(function(t) {
|
|
31834
|
-
t[t.Multiline =
|
|
31834
|
+
t[t.Multiline = Ut(12)] = "Multiline", t[t.Password = Ut(13)] = "Password", t[t.FileSelect = Ut(20)] = "FileSelect", t[t.DoNotSpellCheck = Ut(22)] = "DoNotSpellCheck", t[t.DoNotScroll = Ut(23)] = "DoNotScroll", t[t.Comb = Ut(24)] = "Comb", t[t.RichText = Ut(25)] = "RichText";
|
|
31835
31835
|
})(Tt || (Tt = {}));
|
|
31836
31836
|
var dt;
|
|
31837
31837
|
(function(t) {
|
|
31838
|
-
t[t.Combo =
|
|
31838
|
+
t[t.Combo = Ut(17)] = "Combo", t[t.Edit = Ut(18)] = "Edit", t[t.Sort = Ut(19)] = "Sort", t[t.MultiSelect = Ut(21)] = "MultiSelect", t[t.DoNotSpellCheck = Ut(22)] = "DoNotSpellCheck", t[t.CommitOnSelChange = Ut(26)] = "CommitOnSelChange";
|
|
31839
31839
|
})(dt || (dt = {}));
|
|
31840
31840
|
var k1 = (
|
|
31841
31841
|
/** @class */
|
|
@@ -32680,14 +32680,14 @@ var Ld = O.Newline, Nd = O.CarriageReturn, nE = (
|
|
|
32680
32680
|
for (var u = this.subsections[o], f = u.firstObjectNumber, l = u.length, h = 0; h < l; h++) {
|
|
32681
32681
|
for (var d = 0, v = 0, p = n; v < p; v++)
|
|
32682
32682
|
d = d << 8 | this.bytes.next();
|
|
32683
|
-
for (var
|
|
32684
|
-
|
|
32683
|
+
for (var m = 0, v = 0, p = i; v < p; v++)
|
|
32684
|
+
m = m << 8 | this.bytes.next();
|
|
32685
32685
|
for (var w = 0, v = 0, p = a; v < p; v++)
|
|
32686
32686
|
w = w << 8 | this.bytes.next();
|
|
32687
32687
|
n === 0 && (d = 1);
|
|
32688
32688
|
var x = f + h, P = {
|
|
32689
32689
|
ref: pt.of(x, w),
|
|
32690
|
-
offset:
|
|
32690
|
+
offset: m,
|
|
32691
32691
|
deleted: d === 0,
|
|
32692
32692
|
inObjectStream: d === 2
|
|
32693
32693
|
};
|
|
@@ -33208,8 +33208,8 @@ var Y1 = function(t) {
|
|
|
33208
33208
|
}
|
|
33209
33209
|
}, Wd = function(t, e, r) {
|
|
33210
33210
|
for (var n = r[0], i = r[1], a = r[2], o = r[3], s = r[4], u = r[5], f = r[6], l = xE(u, f, n, i, o, s, a, t, e), h = [], d = 0, v = l; d < v.length; d++) {
|
|
33211
|
-
var p = v[d],
|
|
33212
|
-
h.push(lr.apply(void 0,
|
|
33211
|
+
var p = v[d], m = FE.apply(void 0, p);
|
|
33212
|
+
h.push(lr.apply(void 0, m));
|
|
33213
33213
|
}
|
|
33214
33214
|
return h;
|
|
33215
33215
|
}, xE = function(t, e, r, n, i, a, o, s, u) {
|
|
@@ -33217,7 +33217,7 @@ var Y1 = function(t) {
|
|
|
33217
33217
|
r = Math.abs(r), n = Math.abs(n), nt = h * (s - t) * 0.5 + l * (u - e) * 0.5, it = h * (u - e) * 0.5 - l * (s - t) * 0.5;
|
|
33218
33218
|
var d = nt * nt / (r * r) + it * it / (n * n);
|
|
33219
33219
|
d > 1 && (d = Math.sqrt(d), r *= d, n *= d);
|
|
33220
|
-
var v = h / r, p = l / r,
|
|
33220
|
+
var v = h / r, p = l / r, m = -l / n, w = h / n, x = v * s + p * u, P = m * s + w * u, A = v * t + p * e, M = m * t + w * e, B = (A - x) * (A - x) + (M - P) * (M - P), k = 1 / B - 0.25;
|
|
33221
33221
|
k < 0 && (k = 0);
|
|
33222
33222
|
var I = Math.sqrt(k);
|
|
33223
33223
|
a === i && (I = -I);
|
|
@@ -33229,9 +33229,9 @@ var Y1 = function(t) {
|
|
|
33229
33229
|
}
|
|
33230
33230
|
return re;
|
|
33231
33231
|
}, FE = function(t, e, r, n, i, a, o, s) {
|
|
33232
|
-
var u = s * i, f = -o * a, l = o * i, h = s * a, d = 0.5 * (n - r), v = 8 / 3 * Math.sin(d * 0.5) * Math.sin(d * 0.5) / Math.sin(d), p = t + Math.cos(r) - v * Math.sin(r),
|
|
33233
|
-
u * p + f *
|
|
33234
|
-
l * p + h *
|
|
33232
|
+
var u = s * i, f = -o * a, l = o * i, h = s * a, d = 0.5 * (n - r), v = 8 / 3 * Math.sin(d * 0.5) * Math.sin(d * 0.5) / Math.sin(d), p = t + Math.cos(r) - v * Math.sin(r), m = e + Math.sin(r) + v * Math.cos(r), w = t + Math.cos(n), x = e + Math.sin(n), P = w + v * Math.sin(n), A = x - v * Math.cos(n), M = [
|
|
33233
|
+
u * p + f * m,
|
|
33234
|
+
l * p + h * m,
|
|
33235
33235
|
u * P + f * A,
|
|
33236
33236
|
l * P + h * A,
|
|
33237
33237
|
u * w + f * x,
|
|
@@ -33542,8 +33542,8 @@ var Y1 = function(t) {
|
|
|
33542
33542
|
rotate: Me(0),
|
|
33543
33543
|
xSkew: Me(0),
|
|
33544
33544
|
ySkew: Me(0)
|
|
33545
|
-
}), p = [],
|
|
33546
|
-
var x = t.textLines[t.selectedLines[
|
|
33545
|
+
}), p = [], m = 0, w = t.selectedLines.length; m < w; m++) {
|
|
33546
|
+
var x = t.textLines[t.selectedLines[m]];
|
|
33547
33547
|
p.push.apply(p, pa({
|
|
33548
33548
|
x: x.x - s,
|
|
33549
33549
|
y: x.y - (a - x.height) / 2,
|
|
@@ -33724,8 +33724,8 @@ var eg = 4, tg = 500, rg = function(t, e, r, n) {
|
|
|
33724
33724
|
for (var a = 0, o = 0, s = t.length; o < s; o++) {
|
|
33725
33725
|
a += 1;
|
|
33726
33726
|
for (var u = t[o], f = u.split(" "), l = r.width, h = 0, d = f.length; h < d; h++) {
|
|
33727
|
-
var v = h === d - 1, p = v ? f[h] : f[h] + " ",
|
|
33728
|
-
l -=
|
|
33727
|
+
var v = h === d - 1, p = v ? f[h] : f[h] + " ", m = e.widthOfTextAtSize(p, i);
|
|
33728
|
+
l -= m, l <= 0 && (a += 1, l = r.width - m);
|
|
33729
33729
|
}
|
|
33730
33730
|
}
|
|
33731
33731
|
if (!n && a > t.length)
|
|
@@ -33771,8 +33771,8 @@ var eg = 4, tg = 500, rg = function(t, e, r, n) {
|
|
|
33771
33771
|
}, ng = function(t, e) {
|
|
33772
33772
|
var r = e.alignment, n = e.fontSize, i = e.font, a = e.bounds, o = a1(Co(t));
|
|
33773
33773
|
(n === void 0 || n === 0) && (n = rg(o, i, a, !0));
|
|
33774
|
-
for (var s = i.heightAtSize(n), u = s + s * 0.2, f = [], l = a.x, h = a.y, d = a.x + a.width, v = a.y + a.height, p = a.y + a.height,
|
|
33775
|
-
for (var x = o[
|
|
33774
|
+
for (var s = i.heightAtSize(n), u = s + s * 0.2, f = [], l = a.x, h = a.y, d = a.x + a.width, v = a.y + a.height, p = a.y + a.height, m = 0, w = o.length; m < w; m++)
|
|
33775
|
+
for (var x = o[m]; x !== void 0; ) {
|
|
33776
33776
|
var P = GE(x, a.width, i, n), A = P.line, M = P.encoded, B = P.width, k = P.remainder, I = r === Vt.Left ? a.x : r === Vt.Center ? a.x + a.width / 2 - B / 2 : r === Vt.Right ? a.x + a.width - B : a.x;
|
|
33777
33777
|
p -= u, I < l && (l = I), p < h && (h = p), I + B > d && (d = I + B), p + s > v && (v = p + s), f.push({ text: A, encoded: M, width: B, height: s, x: I, y: p }), x = k?.trim();
|
|
33778
33778
|
}
|
|
@@ -33792,9 +33792,9 @@ var eg = 4, tg = 500, rg = function(t, e, r, n) {
|
|
|
33792
33792
|
if (o.length > a)
|
|
33793
33793
|
throw new zE(o.length, a);
|
|
33794
33794
|
(r === void 0 || r === 0) && (r = qE(o, n, i, a));
|
|
33795
|
-
for (var s = i.width / a, u = n.heightAtSize(r, { descender: !1 }), f = i.y + (i.height / 2 - u / 2), l = [], h = i.x, d = i.y, v = i.x + i.width, p = i.y + i.height,
|
|
33796
|
-
var x = s1(o, w), P = x[0], A = x[1], M = n.encodeText(P), B = n.widthOfTextAtSize(P, r), k = i.x + (s *
|
|
33797
|
-
I < h && (h = I), f < d && (d = f), I + B > v && (v = I + B), f + u > p && (p = f + u), l.push({ text: o, encoded: M, width: B, height: u, x: I, y: f }),
|
|
33795
|
+
for (var s = i.width / a, u = n.heightAtSize(r, { descender: !1 }), f = i.y + (i.height / 2 - u / 2), l = [], h = i.x, d = i.y, v = i.x + i.width, p = i.y + i.height, m = 0, w = 0; m < a; ) {
|
|
33796
|
+
var x = s1(o, w), P = x[0], A = x[1], M = n.encodeText(P), B = n.widthOfTextAtSize(P, r), k = i.x + (s * m + s / 2), I = k - B / 2;
|
|
33797
|
+
I < h && (h = I), f < d && (d = f), I + B > v && (v = I + B), f + u > p && (p = f + u), l.push({ text: o, encoded: M, width: B, height: u, x: I, y: f }), m += 1, w += A;
|
|
33798
33798
|
}
|
|
33799
33799
|
return {
|
|
33800
33800
|
fontSize: r,
|
|
@@ -33838,7 +33838,7 @@ var eg = 4, tg = 500, rg = function(t, e, r, n) {
|
|
|
33838
33838
|
`);
|
|
33839
33839
|
t.setDefaultAppearance(a);
|
|
33840
33840
|
}, ZE = function(t, e) {
|
|
33841
|
-
var r, n, i, a = Pr(e), o = Pr(t.acroField), s = e.getRectangle(), u = e.getAppearanceCharacteristics(), f = e.getBorderStyle(), l = (r = f?.getWidth()) !== null && r !== void 0 ? r : 0, h = xn(u?.getRotation()), d = Ti(s, h), v = d.width, p = d.height,
|
|
33841
|
+
var r, n, i, a = Pr(e), o = Pr(t.acroField), s = e.getRectangle(), u = e.getAppearanceCharacteristics(), f = e.getBorderStyle(), l = (r = f?.getWidth()) !== null && r !== void 0 ? r : 0, h = xn(u?.getRotation()), d = Ti(s, h), v = d.width, p = d.height, m = ti(qe(qe({}, s), { rotation: h })), w = ft(0, 0, 0), x = (n = nr(u?.getBorderColor())) !== null && n !== void 0 ? n : w, P = nr(u?.getBackgroundColor()), A = nr(u?.getBackgroundColor(), 0.8), M = (i = a ?? o) !== null && i !== void 0 ? i : w;
|
|
33842
33842
|
kr(a ? e : t.acroField, M);
|
|
33843
33843
|
var B = {
|
|
33844
33844
|
x: 0 + l / 2,
|
|
@@ -33852,16 +33852,16 @@ var eg = 4, tg = 500, rg = function(t, e, r, n) {
|
|
|
33852
33852
|
};
|
|
33853
33853
|
return {
|
|
33854
33854
|
normal: {
|
|
33855
|
-
on: st(
|
|
33856
|
-
off: st(
|
|
33855
|
+
on: st(m, ts(qe(qe({}, B), { color: P, filled: !0 }))),
|
|
33856
|
+
off: st(m, ts(qe(qe({}, B), { color: P, filled: !1 })))
|
|
33857
33857
|
},
|
|
33858
33858
|
down: {
|
|
33859
|
-
on: st(
|
|
33860
|
-
off: st(
|
|
33859
|
+
on: st(m, ts(qe(qe({}, B), { color: A, filled: !0 }))),
|
|
33860
|
+
off: st(m, ts(qe(qe({}, B), { color: A, filled: !1 })))
|
|
33861
33861
|
}
|
|
33862
33862
|
};
|
|
33863
33863
|
}, YE = function(t, e) {
|
|
33864
|
-
var r, n, i, a = Pr(e), o = Pr(t.acroField), s = e.getRectangle(), u = e.getAppearanceCharacteristics(), f = e.getBorderStyle(), l = (r = f?.getWidth()) !== null && r !== void 0 ? r : 0, h = xn(u?.getRotation()), d = Ti(s, h), v = d.width, p = d.height,
|
|
33864
|
+
var r, n, i, a = Pr(e), o = Pr(t.acroField), s = e.getRectangle(), u = e.getAppearanceCharacteristics(), f = e.getBorderStyle(), l = (r = f?.getWidth()) !== null && r !== void 0 ? r : 0, h = xn(u?.getRotation()), d = Ti(s, h), v = d.width, p = d.height, m = ti(qe(qe({}, s), { rotation: h })), w = ft(0, 0, 0), x = (n = nr(u?.getBorderColor())) !== null && n !== void 0 ? n : w, P = nr(u?.getBackgroundColor()), A = nr(u?.getBackgroundColor(), 0.8), M = (i = a ?? o) !== null && i !== void 0 ? i : w;
|
|
33865
33865
|
kr(a ? e : t.acroField, M);
|
|
33866
33866
|
var B = {
|
|
33867
33867
|
x: v / 2,
|
|
@@ -33874,16 +33874,16 @@ var eg = 4, tg = 500, rg = function(t, e, r, n) {
|
|
|
33874
33874
|
};
|
|
33875
33875
|
return {
|
|
33876
33876
|
normal: {
|
|
33877
|
-
on: st(
|
|
33878
|
-
off: st(
|
|
33877
|
+
on: st(m, rs(qe(qe({}, B), { color: P, filled: !0 }))),
|
|
33878
|
+
off: st(m, rs(qe(qe({}, B), { color: P, filled: !1 })))
|
|
33879
33879
|
},
|
|
33880
33880
|
down: {
|
|
33881
|
-
on: st(
|
|
33882
|
-
off: st(
|
|
33881
|
+
on: st(m, rs(qe(qe({}, B), { color: A, filled: !0 }))),
|
|
33882
|
+
off: st(m, rs(qe(qe({}, B), { color: A, filled: !1 })))
|
|
33883
33883
|
}
|
|
33884
33884
|
};
|
|
33885
33885
|
}, JE = function(t, e, r) {
|
|
33886
|
-
var n, i, a, o, s, u = Pr(e), f = Pr(t.acroField), l = Xn(e), h = Xn(t.acroField), d = e.getRectangle(), v = e.getAppearanceCharacteristics(), p = e.getBorderStyle(),
|
|
33886
|
+
var n, i, a, o, s, u = Pr(e), f = Pr(t.acroField), l = Xn(e), h = Xn(t.acroField), d = e.getRectangle(), v = e.getAppearanceCharacteristics(), p = e.getBorderStyle(), m = v?.getCaptions(), w = (n = m?.normal) !== null && n !== void 0 ? n : "", x = (a = (i = m?.down) !== null && i !== void 0 ? i : w) !== null && a !== void 0 ? a : "", P = (o = p?.getWidth()) !== null && o !== void 0 ? o : 0, A = xn(v?.getRotation()), M = Ti(d, A), B = M.width, k = M.height, I = ti(qe(qe({}, d), { rotation: A })), j = ft(0, 0, 0), H = nr(v?.getBorderColor()), W = nr(v?.getBackgroundColor()), q = nr(v?.getBackgroundColor(), 0.8), Z = {
|
|
33887
33887
|
x: P,
|
|
33888
33888
|
y: P,
|
|
33889
33889
|
width: B - P * 2,
|
|
@@ -33916,11 +33916,11 @@ var eg = 4, tg = 500, rg = function(t, e, r, n) {
|
|
|
33916
33916
|
down: st(I, Gd(qe(qe({}, Q), { color: q, textLines: [re.line] })))
|
|
33917
33917
|
};
|
|
33918
33918
|
}, QE = function(t, e, r) {
|
|
33919
|
-
var n, i, a, o, s = Pr(e), u = Pr(t.acroField), f = Xn(e), l = Xn(t.acroField), h = e.getRectangle(), d = e.getAppearanceCharacteristics(), v = e.getBorderStyle(), p = (n = t.getText()) !== null && n !== void 0 ? n : "",
|
|
33920
|
-
x:
|
|
33921
|
-
y:
|
|
33922
|
-
width: P - (
|
|
33923
|
-
height: A - (
|
|
33919
|
+
var n, i, a, o, s = Pr(e), u = Pr(t.acroField), f = Xn(e), l = Xn(t.acroField), h = e.getRectangle(), d = e.getAppearanceCharacteristics(), v = e.getBorderStyle(), p = (n = t.getText()) !== null && n !== void 0 ? n : "", m = (i = v?.getWidth()) !== null && i !== void 0 ? i : 0, w = xn(d?.getRotation()), x = Ti(h, w), P = x.width, A = x.height, M = ti(qe(qe({}, h), { rotation: w })), B = ft(0, 0, 0), k = nr(d?.getBorderColor()), I = nr(d?.getBackgroundColor()), j, H, W = t.isCombed() ? 0 : 1, q = {
|
|
33920
|
+
x: m + W,
|
|
33921
|
+
y: m + W,
|
|
33922
|
+
width: P - (m + W) * 2,
|
|
33923
|
+
height: A - (m + W) * 2
|
|
33924
33924
|
};
|
|
33925
33925
|
if (t.isMultiline()) {
|
|
33926
33926
|
var Z = ng(p, {
|
|
@@ -33950,11 +33950,11 @@ var eg = 4, tg = 500, rg = function(t, e, r, n) {
|
|
|
33950
33950
|
var U = (o = s ?? u) !== null && o !== void 0 ? o : B;
|
|
33951
33951
|
kr(s || f !== void 0 ? e : t.acroField, U, r, H);
|
|
33952
33952
|
var re = {
|
|
33953
|
-
x: 0 +
|
|
33954
|
-
y: 0 +
|
|
33955
|
-
width: P -
|
|
33956
|
-
height: A -
|
|
33957
|
-
borderWidth:
|
|
33953
|
+
x: 0 + m / 2,
|
|
33954
|
+
y: 0 + m / 2,
|
|
33955
|
+
width: P - m,
|
|
33956
|
+
height: A - m,
|
|
33957
|
+
borderWidth: m ?? 0,
|
|
33958
33958
|
borderColor: k,
|
|
33959
33959
|
textColor: U,
|
|
33960
33960
|
font: r.name,
|
|
@@ -33965,7 +33965,7 @@ var eg = 4, tg = 500, rg = function(t, e, r, n) {
|
|
|
33965
33965
|
};
|
|
33966
33966
|
return st(M, _1(re));
|
|
33967
33967
|
}, _E = function(t, e, r) {
|
|
33968
|
-
var n, i, a, o = Pr(e), s = Pr(t.acroField), u = Xn(e), f = Xn(t.acroField), l = e.getRectangle(), h = e.getAppearanceCharacteristics(), d = e.getBorderStyle(), v = (n = t.getSelected()[0]) !== null && n !== void 0 ? n : "", p = (i = d?.getWidth()) !== null && i !== void 0 ? i : 0,
|
|
33968
|
+
var n, i, a, o = Pr(e), s = Pr(t.acroField), u = Xn(e), f = Xn(t.acroField), l = e.getRectangle(), h = e.getAppearanceCharacteristics(), d = e.getBorderStyle(), v = (n = t.getSelected()[0]) !== null && n !== void 0 ? n : "", p = (i = d?.getWidth()) !== null && i !== void 0 ? i : 0, m = xn(h?.getRotation()), w = Ti(l, m), x = w.width, P = w.height, A = ti(qe(qe({}, l), { rotation: m })), M = ft(0, 0, 0), B = nr(h?.getBorderColor()), k = nr(h?.getBackgroundColor()), I = 1, j = {
|
|
33969
33969
|
x: p + I,
|
|
33970
33970
|
y: p + I,
|
|
33971
33971
|
width: x - (p + I) * 2,
|
|
@@ -33993,7 +33993,7 @@ var eg = 4, tg = 500, rg = function(t, e, r, n) {
|
|
|
33993
33993
|
};
|
|
33994
33994
|
return st(A, _1(U));
|
|
33995
33995
|
}, $E = function(t, e, r) {
|
|
33996
|
-
var n, i, a = Pr(e), o = Pr(t.acroField), s = Xn(e), u = Xn(t.acroField), f = e.getRectangle(), l = e.getAppearanceCharacteristics(), h = e.getBorderStyle(), d = (n = h?.getWidth()) !== null && n !== void 0 ? n : 0, v = xn(l?.getRotation()), p = Ti(f, v),
|
|
33996
|
+
var n, i, a = Pr(e), o = Pr(t.acroField), s = Xn(e), u = Xn(t.acroField), f = e.getRectangle(), l = e.getAppearanceCharacteristics(), h = e.getBorderStyle(), d = (n = h?.getWidth()) !== null && n !== void 0 ? n : 0, v = xn(l?.getRotation()), p = Ti(f, v), m = p.width, w = p.height, x = ti(qe(qe({}, f), { rotation: v })), P = ft(0, 0, 0), A = nr(l?.getBorderColor()), M = nr(l?.getBackgroundColor()), B = t.getOptions(), k = t.getSelected();
|
|
33997
33997
|
t.isSorted() && B.sort();
|
|
33998
33998
|
for (var I = "", j = 0, H = B.length; j < H; j++)
|
|
33999
33999
|
I += B[j], j < H - 1 && (I += `
|
|
@@ -34001,7 +34001,7 @@ var eg = 4, tg = 500, rg = function(t, e, r, n) {
|
|
|
34001
34001
|
for (var W = 1, q = {
|
|
34002
34002
|
x: d + W,
|
|
34003
34003
|
y: d + W,
|
|
34004
|
-
width:
|
|
34004
|
+
width: m - (d + W) * 2,
|
|
34005
34005
|
height: w - (d + W) * 2
|
|
34006
34006
|
}, Z = ng(I, {
|
|
34007
34007
|
alignment: Vt.Left,
|
|
@@ -34016,7 +34016,7 @@ var eg = 4, tg = 500, rg = function(t, e, r, n) {
|
|
|
34016
34016
|
return kr(a || s !== void 0 ? e : t.acroField, pe, r, re), st(x, kE({
|
|
34017
34017
|
x: 0 + d / 2,
|
|
34018
34018
|
y: 0 + d / 2,
|
|
34019
|
-
width:
|
|
34019
|
+
width: m - d,
|
|
34020
34020
|
height: w - d,
|
|
34021
34021
|
borderWidth: d ?? 0,
|
|
34022
34022
|
borderColor: A,
|
|
@@ -34193,17 +34193,17 @@ var Fa = function(t) {
|
|
|
34193
34193
|
}, t.prototype.createWidget = function(e) {
|
|
34194
34194
|
var r, n = e.textColor, i = e.backgroundColor, a = e.borderColor, o = e.borderWidth, s = j1(e.rotate), u = e.caption, f = e.x, l = e.y, h = e.width + o, d = e.height + o, v = !!e.hidden, p = e.page;
|
|
34195
34195
|
m1(s, "degreesAngle", 90);
|
|
34196
|
-
var
|
|
34197
|
-
|
|
34198
|
-
var x =
|
|
34196
|
+
var m = sc.create(this.doc.context, this.ref), w = fE({ x: f, y: l, width: h, height: d }, o, s);
|
|
34197
|
+
m.setRectangle(w), p && m.setP(p);
|
|
34198
|
+
var x = m.getOrCreateAppearanceCharacteristics();
|
|
34199
34199
|
i && x.setBackgroundColor(jd(i)), x.setRotation(s), u && x.setCaptions({ normal: u }), a && x.setBorderColor(jd(a));
|
|
34200
|
-
var P =
|
|
34201
|
-
if (o !== void 0 && P.setWidth(o),
|
|
34200
|
+
var P = m.getOrCreateBorderStyle();
|
|
34201
|
+
if (o !== void 0 && P.setWidth(o), m.setFlagTo(eo.Print, !0), m.setFlagTo(eo.Hidden, v), m.setFlagTo(eo.Invisible, !1), n) {
|
|
34202
34202
|
var A = (r = this.acroField.getDefaultAppearance()) !== null && r !== void 0 ? r : "", M = A + `
|
|
34203
34203
|
` + Oi(n).toString();
|
|
34204
34204
|
this.acroField.setDefaultAppearance(M);
|
|
34205
34205
|
}
|
|
34206
|
-
return
|
|
34206
|
+
return m;
|
|
34207
34207
|
}, t.prototype.updateWidgetAppearanceWithFont = function(e, r, n) {
|
|
34208
34208
|
var i = n.normal, a = n.rollover, o = n.down;
|
|
34209
34209
|
this.updateWidgetAppearances(e, {
|
|
@@ -34229,7 +34229,7 @@ var Fa = function(t) {
|
|
|
34229
34229
|
}), h = a.register(l);
|
|
34230
34230
|
return h;
|
|
34231
34231
|
}, t.prototype.createImageAppearanceStream = function(e, r, n) {
|
|
34232
|
-
var i, a, o = this.acroField.dict.context, s = e.getRectangle(), u = e.getAppearanceCharacteristics(), f = e.getBorderStyle(), l = (a = f?.getWidth()) !== null && a !== void 0 ? a : 0, h = xn(u?.getRotation()), d = ti(qe(qe({}, s), { rotation: h })), v = Ti(s, h), p = r.scaleToFit(v.width - l * 2, v.height - l * 2),
|
|
34232
|
+
var i, a, o = this.acroField.dict.context, s = e.getRectangle(), u = e.getAppearanceCharacteristics(), f = e.getBorderStyle(), l = (a = f?.getWidth()) !== null && a !== void 0 ? a : 0, h = xn(u?.getRotation()), d = ti(qe(qe({}, s), { rotation: h })), v = Ti(s, h), p = r.scaleToFit(v.width - l * 2, v.height - l * 2), m = {
|
|
34233
34233
|
x: l,
|
|
34234
34234
|
y: l,
|
|
34235
34235
|
width: p.width,
|
|
@@ -34239,8 +34239,8 @@ var Fa = function(t) {
|
|
|
34239
34239
|
xSkew: Me(0),
|
|
34240
34240
|
ySkew: Me(0)
|
|
34241
34241
|
};
|
|
34242
|
-
n === Vn.Center ? (
|
|
34243
|
-
var w = this.doc.context.addRandomSuffix("Image", 10), x = st(d, Q1(w,
|
|
34242
|
+
n === Vn.Center ? (m.x += (v.width - l * 2) / 2 - p.width / 2, m.y += (v.height - l * 2) / 2 - p.height / 2) : n === Vn.Right && (m.x = v.width - l - p.width, m.y = v.height - l - p.height);
|
|
34243
|
+
var w = this.doc.context.addRandomSuffix("Image", 10), x = st(d, Q1(w, m)), P = { XObject: (i = {}, i[w] = r.ref, i) }, A = o.formXObject(x, {
|
|
34244
34244
|
Resources: P,
|
|
34245
34245
|
BBox: o.obj([0, 0, s.width, s.height]),
|
|
34246
34246
|
Matrix: o.obj([1, 0, 0, 1, 0, 0])
|
|
@@ -34611,8 +34611,8 @@ var Fa = function(t) {
|
|
|
34611
34611
|
rotate: (v = i?.rotate) !== null && v !== void 0 ? v : Me(0),
|
|
34612
34612
|
hidden: i?.hidden,
|
|
34613
34613
|
page: n.ref
|
|
34614
|
-
}),
|
|
34615
|
-
p.setAppearanceState(T.of("Off")), this.updateWidgetAppearance(p, w), n.node.addAnnot(
|
|
34614
|
+
}), m = this.doc.context.register(p.dict), w = this.acroField.addWidgetWithOpt(m, Ie.fromText(r), !this.isMutuallyExclusive());
|
|
34615
|
+
p.setAppearanceState(T.of("Off")), this.updateWidgetAppearance(p, w), n.node.addAnnot(m);
|
|
34616
34616
|
}, e.prototype.needsAppearancesUpdate = function() {
|
|
34617
34617
|
for (var r, n = this.acroField.getWidgets(), i = 0, a = n.length; i < a; i++) {
|
|
34618
34618
|
var o = n[i], s = o.getAppearanceState(), u = (r = o.getAppearances()) === null || r === void 0 ? void 0 : r.normal;
|
|
@@ -35119,12 +35119,12 @@ var nT = (
|
|
|
35119
35119
|
return t.load = function(e, r) {
|
|
35120
35120
|
return r === void 0 && (r = {}), Ze(this, void 0, void 0, function() {
|
|
35121
35121
|
var n, i, a, o, s, u, f, l, h, d, v, p;
|
|
35122
|
-
return Ye(this, function(
|
|
35123
|
-
switch (
|
|
35122
|
+
return Ye(this, function(m) {
|
|
35123
|
+
switch (m.label) {
|
|
35124
35124
|
case 0:
|
|
35125
35125
|
return n = r.ignoreEncryption, i = n === void 0 ? !1 : n, a = r.parseSpeed, o = a === void 0 ? hc.Slow : a, s = r.throwOnInvalidObject, u = s === void 0 ? !1 : s, f = r.updateMetadata, l = f === void 0 ? !0 : f, h = r.capNumbers, d = h === void 0 ? !1 : h, z(e, "pdf", ["string", Uint8Array, ArrayBuffer]), z(i, "ignoreEncryption", ["boolean"]), z(o, "parseSpeed", ["number"]), z(u, "throwOnInvalidObject", ["boolean"]), v = Pa(e), [4, sE.forBytesWithOptions(v, o, u, d).parseDocument()];
|
|
35126
35126
|
case 1:
|
|
35127
|
-
return p =
|
|
35127
|
+
return p = m.sent(), [2, new t(p, i, l)];
|
|
35128
35128
|
}
|
|
35129
35129
|
});
|
|
35130
35130
|
});
|
|
@@ -35370,7 +35370,7 @@ var nT = (
|
|
|
35370
35370
|
});
|
|
35371
35371
|
}, t.prototype.embedPages = function(e, r, n) {
|
|
35372
35372
|
return r === void 0 && (r = []), n === void 0 && (n = []), Ze(this, void 0, void 0, function() {
|
|
35373
|
-
var f, l, i, a, o, s, u, f, l, h, d, v, p,
|
|
35373
|
+
var f, l, i, a, o, s, u, f, l, h, d, v, p, m, w;
|
|
35374
35374
|
return Ye(this, function(x) {
|
|
35375
35375
|
switch (x.label) {
|
|
35376
35376
|
case 0:
|
|
@@ -35385,7 +35385,7 @@ var nT = (
|
|
|
35385
35385
|
case 1:
|
|
35386
35386
|
return f < l ? (h = s(e[f].node), d = r[f], v = n[f], [4, O1.for(h, d, v)]) : [3, 4];
|
|
35387
35387
|
case 2:
|
|
35388
|
-
p = x.sent(),
|
|
35388
|
+
p = x.sent(), m = this.context.nextRef(), u[f] = ig.of(m, this, p), x.label = 3;
|
|
35389
35389
|
case 3:
|
|
35390
35390
|
return f++, [3, 1];
|
|
35391
35391
|
case 4:
|
|
@@ -35607,9 +35607,9 @@ var Cr = (
|
|
|
35607
35607
|
}, t.prototype.drawText = function(e, r) {
|
|
35608
35608
|
var n, i, a, o, s, u, f;
|
|
35609
35609
|
r === void 0 && (r = {}), z(e, "text", ["string"]), oe(r.color, "options.color", [[Object, "Color"]]), Mr(r.opacity, "opacity.opacity", 0, 1), oe(r.font, "options.font", [[gr, "PDFFont"]]), oe(r.size, "options.size", ["number"]), oe(r.rotate, "options.rotate", [[Object, "Rotation"]]), oe(r.xSkew, "options.xSkew", [[Object, "Rotation"]]), oe(r.ySkew, "options.ySkew", [[Object, "Rotation"]]), oe(r.x, "options.x", ["number"]), oe(r.y, "options.y", ["number"]), oe(r.lineHeight, "options.lineHeight", ["number"]), oe(r.maxWidth, "options.maxWidth", ["number"]), oe(r.wordBreaks, "options.wordBreaks", [Array]), br(r.blendMode, "options.blendMode", un);
|
|
35610
|
-
for (var l = this.setOrEmbedFont(r.font), h = l.oldFont, d = l.newFont, v = l.newFontKey, p = r.size || this.fontSize,
|
|
35610
|
+
for (var l = this.setOrEmbedFont(r.font), h = l.oldFont, d = l.newFont, v = l.newFontKey, p = r.size || this.fontSize, m = r.wordBreaks || this.doc.defaultWordBreaks, w = function(I) {
|
|
35611
35611
|
return d.widthOfTextAtSize(I, p);
|
|
35612
|
-
}, x = r.maxWidth === void 0 ? a1(Co(e)) : l5(e,
|
|
35612
|
+
}, x = r.maxWidth === void 0 ? a1(Co(e)) : l5(e, m, r.maxWidth, w), P = new Array(x.length), A = 0, M = x.length; A < M; A++)
|
|
35613
35613
|
P[A] = d.encodeText(x[A]);
|
|
35614
35614
|
var B = this.maybeEmbedGraphicsState({
|
|
35615
35615
|
opacity: r.opacity,
|
|
@@ -35724,7 +35724,7 @@ var Cr = (
|
|
|
35724
35724
|
]), oe(e.borderDashPhase, "options.borderDashPhase", [
|
|
35725
35725
|
"number"
|
|
35726
35726
|
]), br(e.borderLineCap, "options.borderLineCap", Ji), Mr(e.borderOpacity, "options.borderOpacity", 0, 1), br(e.blendMode, "options.blendMode", un);
|
|
35727
|
-
var
|
|
35727
|
+
var m = this.maybeEmbedGraphicsState({
|
|
35728
35728
|
opacity: e.opacity,
|
|
35729
35729
|
borderOpacity: e.borderOpacity,
|
|
35730
35730
|
blendMode: e.blendMode
|
|
@@ -35744,7 +35744,7 @@ var Cr = (
|
|
|
35744
35744
|
borderColor: (h = e.borderColor) !== null && h !== void 0 ? h : void 0,
|
|
35745
35745
|
borderDashArray: (d = e.borderDashArray) !== null && d !== void 0 ? d : void 0,
|
|
35746
35746
|
borderDashPhase: (v = e.borderDashPhase) !== null && v !== void 0 ? v : void 0,
|
|
35747
|
-
graphicsState:
|
|
35747
|
+
graphicsState: m,
|
|
35748
35748
|
borderLineCap: (p = e.borderLineCap) !== null && p !== void 0 ? p : void 0
|
|
35749
35749
|
}));
|
|
35750
35750
|
}, t.prototype.drawSquare = function(e) {
|
|
@@ -35855,7 +35855,7 @@ var Cr = (
|
|
|
35855
35855
|
}, e.prototype.setFontSize = function(r) {
|
|
35856
35856
|
vu(r, "fontSize"), this.acroField.setFontSize(r), this.markAsDirty();
|
|
35857
35857
|
}, e.prototype.addToPage = function(r, n, i) {
|
|
35858
|
-
var a, o, s, u, f, l, h, d, v, p,
|
|
35858
|
+
var a, o, s, u, f, l, h, d, v, p, m;
|
|
35859
35859
|
oe(r, "text", ["string"]), oe(n, "page", [[Cr, "PDFPage"]]), Fa(i);
|
|
35860
35860
|
var w = this.createWidget({
|
|
35861
35861
|
x: ((a = i?.x) !== null && a !== void 0 ? a : 0) - ((o = i?.borderWidth) !== null && o !== void 0 ? o : 0) / 2,
|
|
@@ -35872,7 +35872,7 @@ var Cr = (
|
|
|
35872
35872
|
page: n.ref
|
|
35873
35873
|
}), x = this.doc.context.register(w.dict);
|
|
35874
35874
|
this.acroField.addWidget(x);
|
|
35875
|
-
var P = (
|
|
35875
|
+
var P = (m = i?.font) !== null && m !== void 0 ? m : this.doc.getForm().getDefaultFont();
|
|
35876
35876
|
this.updateWidgetAppearance(w, P), n.node.addAnnot(x);
|
|
35877
35877
|
}, e.prototype.needsAppearancesUpdate = function() {
|
|
35878
35878
|
var r;
|
|
@@ -35917,7 +35917,7 @@ async function uT(t) {
|
|
|
35917
35917
|
for (const [, e] of t.context.enumerateIndirectObjects())
|
|
35918
35918
|
e instanceof va && e.dict.get(T.of("Subtype")) === T.of("CIDFontType0C") && e.dict.set(T.of("Subtype"), T.of("OpenType"));
|
|
35919
35919
|
}
|
|
35920
|
-
function
|
|
35920
|
+
function Nt(t) {
|
|
35921
35921
|
return (t || 0) * oT;
|
|
35922
35922
|
}
|
|
35923
35923
|
function vo(t, e = [0, 0, 0]) {
|
|
@@ -35943,10 +35943,10 @@ function fT(t, e) {
|
|
|
35943
35943
|
}
|
|
35944
35944
|
function cT(t, e) {
|
|
35945
35945
|
return {
|
|
35946
|
-
x:
|
|
35947
|
-
yTop: e -
|
|
35948
|
-
width:
|
|
35949
|
-
height:
|
|
35946
|
+
x: Nt(t.leftMm),
|
|
35947
|
+
yTop: e - Nt(t.topMm),
|
|
35948
|
+
width: Nt(t.widthMm),
|
|
35949
|
+
height: Nt(t.heightMm)
|
|
35950
35950
|
};
|
|
35951
35951
|
}
|
|
35952
35952
|
function lT(t) {
|
|
@@ -35970,9 +35970,9 @@ function dT(t, e, r, n, i, a) {
|
|
|
35970
35970
|
n.align === "center" ? v += (i.width - d) / 2 : n.align === "right" && (v += i.width - d);
|
|
35971
35971
|
const p = vo(n.color);
|
|
35972
35972
|
if (h) {
|
|
35973
|
-
let
|
|
35973
|
+
let m = "";
|
|
35974
35974
|
l.forEach((w, x) => {
|
|
35975
|
-
e.drawText(w, { x: v + o.widthOfTextAtSize(
|
|
35975
|
+
e.drawText(w, { x: v + o.widthOfTextAtSize(m, f) + x * h, y: a, size: f, font: o, color: p }), m += w;
|
|
35976
35976
|
});
|
|
35977
35977
|
} else e.drawText(s, { x: v, y: a, size: f, font: o, color: p });
|
|
35978
35978
|
n.underline && e.drawLine({ start: { x: v, y: a - 1 }, end: { x: v + d, y: a - 1 }, thickness: Math.max(0.4, f / 20), color: p });
|
|
@@ -36038,32 +36038,32 @@ function yT(t, e, r, n) {
|
|
|
36038
36038
|
i.kind === "v" ? yi(
|
|
36039
36039
|
t,
|
|
36040
36040
|
a,
|
|
36041
|
-
{ x: r.x +
|
|
36042
|
-
{ x: r.x +
|
|
36041
|
+
{ x: r.x + Nt(i.pos), y: r.yTop - Nt(i.to) },
|
|
36042
|
+
{ x: r.x + Nt(i.pos), y: r.yTop - Nt(i.from) }
|
|
36043
36043
|
) : yi(
|
|
36044
36044
|
t,
|
|
36045
36045
|
a,
|
|
36046
|
-
{ x: r.x +
|
|
36047
|
-
{ x: r.x +
|
|
36046
|
+
{ x: r.x + Nt(i.from), y: r.yTop - Nt(i.pos) },
|
|
36047
|
+
{ x: r.x + Nt(i.to), y: r.yTop - Nt(i.pos) }
|
|
36048
36048
|
);
|
|
36049
36049
|
}
|
|
36050
36050
|
}
|
|
36051
36051
|
function mT(t, e, r, n, i, a) {
|
|
36052
36052
|
const o = Cg(r.style, n.cell.style), s = {
|
|
36053
|
-
x: i.x +
|
|
36054
|
-
yTop: i.yTop -
|
|
36055
|
-
width:
|
|
36056
|
-
height:
|
|
36053
|
+
x: i.x + Nt(n.xMm),
|
|
36054
|
+
yTop: i.yTop - Nt(n.yMm),
|
|
36055
|
+
width: Nt(n.widthMm),
|
|
36056
|
+
height: Nt(n.heightMm)
|
|
36057
36057
|
};
|
|
36058
36058
|
if (Ol(e, s, o.backgroundColor), n.cell.children?.length && t.fidelityWarnings.push(`${a}: 嵌套组件暂不支持 PDF 导出,已跳过;单元格文本保留`), !n.cell.text) return;
|
|
36059
36059
|
sg(t, o, a);
|
|
36060
|
-
const u = r.grid?.paddingMm ?? 0.5, f =
|
|
36061
|
-
x: s.x + f,
|
|
36060
|
+
const u = r.grid?.paddingMm ?? 0.5, f = Nt(u), l = n.cell.indentMm ?? 0, h = Nt(l), d = {
|
|
36061
|
+
x: s.x + f + h,
|
|
36062
36062
|
yTop: s.yTop - f,
|
|
36063
|
-
width: Math.max(0, s.width - 2 * f),
|
|
36063
|
+
width: Math.max(0, s.width - 2 * f - h),
|
|
36064
36064
|
height: Math.max(0, s.height - 2 * f)
|
|
36065
|
-
},
|
|
36066
|
-
|
|
36065
|
+
}, v = fg(t, n.cell.text, Math.max(0, n.widthMm - 2 * u - l), o), p = go(o).fontSizePt * gc(o), m = Math.floor((d.height + ag) / p), w = Math.max(1, m);
|
|
36066
|
+
v.length > m && t.fidelityWarnings.push(`${a}: 单元格文本超出可用高度,PDF 文本裁切;请增加行高或减少字号(${v.length} 行,可容纳 ${m} 行)`), ug(t, e, v.slice(0, w), { verticalAlign: "middle", ...o }, d);
|
|
36067
36067
|
}
|
|
36068
36068
|
function bT(t, e, r, n, i) {
|
|
36069
36069
|
const a = Ag(r.grid, r.widthMm, r.heightMm);
|
|
@@ -36143,14 +36143,14 @@ async function JT(t, e = {}) {
|
|
|
36143
36143
|
const a = await FT(i, e), o = [];
|
|
36144
36144
|
for (const [f, l] of t.pages.entries()) {
|
|
36145
36145
|
ns(e.signal);
|
|
36146
|
-
const h =
|
|
36146
|
+
const h = Nt(l.pageWidthMm), d = Nt(l.pageHeightMm);
|
|
36147
36147
|
(h > 14400 || d > 14400) && a.fidelityWarnings.push(`page ${f + 1}: PDF 页面超过常规阅读器的 200 英寸尺寸范围,阅读器可能裁切;建议选择标准纸型或分拆宽表`);
|
|
36148
36148
|
const v = i.addPage([h, d]);
|
|
36149
36149
|
for (const p of l.components) {
|
|
36150
36150
|
ns(e.signal);
|
|
36151
|
-
const
|
|
36151
|
+
const m = `page ${f + 1} ${p.nid ?? p.kind}`;
|
|
36152
36152
|
try {
|
|
36153
|
-
await xT(a, v, p, d,
|
|
36153
|
+
await xT(a, v, p, d, m);
|
|
36154
36154
|
} catch (w) {
|
|
36155
36155
|
o.push(`page ${f + 1} comp ${p.nid ?? p.kind}: ${String(w)}`);
|
|
36156
36156
|
}
|