@fileverse-dev/dsheet 2.0.36-shortcut-1 → 2.0.36-shortcut-3
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/dist/{constants-CnhOvijG.js → constants-yStXQJiK.js} +35 -14
- package/dist/constants.d.ts +4 -0
- package/dist/constants.js +6 -3
- package/dist/editor/components/collab-status-chip.d.ts +8 -0
- package/dist/editor/contexts/editor-context.d.ts +15 -5
- package/dist/editor/dsheet-editor.d.ts +1 -1
- package/dist/editor/hooks/use-collab-awareness.d.ts +17 -0
- package/dist/editor/hooks/use-editor-data.d.ts +2 -1
- package/dist/editor/hooks/use-editor-sync.d.ts +9 -6
- package/dist/editor/types.d.ts +2 -2
- package/dist/editor/utils/after-update-cell.d.ts +12 -0
- package/dist/editor/utils/formula-ui-sync.d.ts +3 -1
- package/dist/editor/utils/remote-apply-guard.d.ts +19 -0
- package/dist/{executeStringFunction-6r6Tl4Z6.js → executeStringFunction-tdvZ0KTi.js} +4646 -4612
- package/dist/formula.js +1 -1
- package/dist/index-D_IxoHMJ.js +52167 -0
- package/dist/index.d.ts +3 -1
- package/dist/index.es.js +46 -41
- package/dist/sheet-engine/core/api/cell.d.ts +21 -0
- package/dist/sheet-engine/core/events/index.d.ts +1 -0
- package/dist/sheet-engine/core/events/keyboard-shortcut-utils.d.ts +61 -0
- package/dist/sheet-engine/core/index.d.ts +2 -2
- package/dist/sheet-engine/core/modules/filter.d.ts +13 -0
- package/dist/sheet-engine/core/modules/index.d.ts +2 -2
- package/dist/sheet-engine/core/modules/selection.d.ts +1 -0
- package/dist/sheet-engine/core/modules/zoom.d.ts +0 -1
- package/dist/sheet-engine/core/settings.d.ts +3 -0
- package/dist/sheet-engine/core/types.d.ts +1 -0
- package/dist/sheet-engine/react/components/Workbook/api.d.ts +23 -0
- package/dist/sheet-engine/react/components/Workbook/index.d.ts +15 -0
- package/dist/style.css +1 -1
- package/dist/sync-local/SyncManager.d.ts +69 -0
- package/dist/sync-local/collabStateMachine.d.ts +23 -0
- package/dist/sync-local/crypto/index.d.ts +6 -0
- package/dist/sync-local/index.d.ts +3 -0
- package/dist/sync-local/socketClient.d.ts +68 -0
- package/dist/sync-local/types/index.d.ts +212 -0
- package/dist/sync-local/useSyncManager.d.ts +12 -0
- package/dist/sync-local/utils/createAwarenessUpdateHandler.d.ts +8 -0
- package/dist/sync-local/utils/objectToFile.d.ts +1 -0
- package/dist/{use-xlsx-import-impl-ehiopPNr.js → use-xlsx-import-impl-AI2QDZt1.js} +2 -2
- package/dist/{xlsx-export-impl-BLKOiPKJ.js → xlsx-export-impl-Buly1jC6.js} +293 -295
- package/package.json +13 -9
- package/dist/editor/hooks/use-editor-collaboration.d.ts +0 -9
- package/dist/index-D-9Q_hz4.js +0 -40345
|
@@ -2,7 +2,8 @@ import { utils as dt, write as Nt } from "xlsx-js-style";
|
|
|
2
2
|
import { Workbook as Pt } from "exceljs";
|
|
3
3
|
import { toast as Ut } from "@fileverse/ui";
|
|
4
4
|
import { addFortuneImagesToWorksheet as Lt } from "./xlsx-image-utils-Cvg0qxRA.js";
|
|
5
|
-
import { g as jt, c as xt } from "./executeStringFunction-
|
|
5
|
+
import { g as jt, c as xt } from "./executeStringFunction-tdvZ0KTi.js";
|
|
6
|
+
import { c as Ct } from "./index-D_IxoHMJ.js";
|
|
6
7
|
import { c as zt, g as Wt } from "./xlsx-hyperlink-inline-DzewAypN.js";
|
|
7
8
|
const Mt = {
|
|
8
9
|
1: "thin",
|
|
@@ -18,33 +19,33 @@ const Mt = {
|
|
|
18
19
|
11: "mediumDashDotDot",
|
|
19
20
|
12: "slantDashDot",
|
|
20
21
|
13: "thick"
|
|
21
|
-
}, Zt = (
|
|
22
|
-
if (typeof
|
|
23
|
-
const
|
|
24
|
-
return
|
|
25
|
-
}, vt = (
|
|
26
|
-
const s = Number(
|
|
22
|
+
}, Zt = (j) => {
|
|
23
|
+
if (typeof j != "string") return "000000";
|
|
24
|
+
const q = j.replace("#", "").toUpperCase();
|
|
25
|
+
return q.length === 3 ? q.replace(/(.)/g, "$1$1") : q.length === 6 ? q : "000000";
|
|
26
|
+
}, vt = (j, q) => {
|
|
27
|
+
const s = Number(j);
|
|
27
28
|
if (s)
|
|
28
29
|
return {
|
|
29
30
|
style: Mt[s] ?? "thin",
|
|
30
|
-
color: { rgb: Zt(
|
|
31
|
+
color: { rgb: Zt(q) }
|
|
31
32
|
};
|
|
32
|
-
}, _t = (
|
|
33
|
+
}, _t = (j, q, s, C, c) => {
|
|
33
34
|
if (!c || !C.l && !C.r && !C.t && !C.b) return;
|
|
34
|
-
const o = dt.encode_cell({ r:
|
|
35
|
-
...
|
|
35
|
+
const o = dt.encode_cell({ r: q, c: s }), a = {
|
|
36
|
+
...j[o] || { t: "z" }
|
|
36
37
|
}, r = { ...a.s || {} }, l = { ...r.border || {} };
|
|
37
|
-
C.l && (l.left = c), C.r && (l.right = c), C.t && (l.top = c), C.b && (l.bottom = c), r.border = l, a.s = r,
|
|
38
|
-
}, $t = (
|
|
39
|
-
|
|
38
|
+
C.l && (l.left = c), C.r && (l.right = c), C.t && (l.top = c), C.b && (l.bottom = c), r.border = l, a.s = r, j[o] = a;
|
|
39
|
+
}, $t = (j, q) => {
|
|
40
|
+
q.forEach((s) => {
|
|
40
41
|
if (s.rangeType === "cell") {
|
|
41
42
|
if (!s.value) return;
|
|
42
43
|
const { row_index: C, col_index: c } = s.value;
|
|
43
44
|
if (C == null || c == null) return;
|
|
44
45
|
const o = s.value, a = dt.encode_cell({ r: C, c }), r = {
|
|
45
|
-
...
|
|
46
|
+
...j[a] || { t: "z" }
|
|
46
47
|
}, l = { ...r.s || {} }, d = { ...l.border || {} };
|
|
47
|
-
o.l && (d.left = vt(o.l.style, o.l.color)), o.r && (d.right = vt(o.r.style, o.r.color)), o.t && (d.top = vt(o.t.style, o.t.color)), o.b && (d.bottom = vt(o.b.style, o.b.color)), l.border = d, r.s = l,
|
|
48
|
+
o.l && (d.left = vt(o.l.style, o.l.color)), o.r && (d.right = vt(o.r.style, o.r.color)), o.t && (d.top = vt(o.t.style, o.t.color)), o.b && (d.bottom = vt(o.b.style, o.b.color)), l.border = d, r.s = l, j[a] = r;
|
|
48
49
|
} else if (s.rangeType === "range") {
|
|
49
50
|
const { borderType: C, style: c, color: o, range: a } = s;
|
|
50
51
|
if (C === "border-none" || !Array.isArray(a) || !c)
|
|
@@ -58,7 +59,7 @@ const Mt = {
|
|
|
58
59
|
switch (C) {
|
|
59
60
|
case "border-all":
|
|
60
61
|
_t(
|
|
61
|
-
|
|
62
|
+
j,
|
|
62
63
|
n,
|
|
63
64
|
p,
|
|
64
65
|
{ l: !0, r: !0, t: !0, b: !0 },
|
|
@@ -67,7 +68,7 @@ const Mt = {
|
|
|
67
68
|
break;
|
|
68
69
|
case "border-outside":
|
|
69
70
|
_t(
|
|
70
|
-
|
|
71
|
+
j,
|
|
71
72
|
n,
|
|
72
73
|
p,
|
|
73
74
|
{ l: p === g, r: p === y, t: n === d, b: n === v },
|
|
@@ -76,7 +77,7 @@ const Mt = {
|
|
|
76
77
|
break;
|
|
77
78
|
case "border-inside":
|
|
78
79
|
_t(
|
|
79
|
-
|
|
80
|
+
j,
|
|
80
81
|
n,
|
|
81
82
|
p,
|
|
82
83
|
{ r: p < y, b: n < v },
|
|
@@ -84,64 +85,64 @@ const Mt = {
|
|
|
84
85
|
);
|
|
85
86
|
break;
|
|
86
87
|
case "border-horizontal":
|
|
87
|
-
_t(
|
|
88
|
+
_t(j, n, p, { b: n < v }, r);
|
|
88
89
|
break;
|
|
89
90
|
case "border-vertical":
|
|
90
|
-
_t(
|
|
91
|
+
_t(j, n, p, { r: p < y }, r);
|
|
91
92
|
break;
|
|
92
93
|
case "border-left":
|
|
93
|
-
p === g && _t(
|
|
94
|
+
p === g && _t(j, n, p, { l: !0 }, r);
|
|
94
95
|
break;
|
|
95
96
|
case "border-right":
|
|
96
|
-
p === y && _t(
|
|
97
|
+
p === y && _t(j, n, p, { r: !0 }, r);
|
|
97
98
|
break;
|
|
98
99
|
case "border-top":
|
|
99
|
-
n === d && _t(
|
|
100
|
+
n === d && _t(j, n, p, { t: !0 }, r);
|
|
100
101
|
break;
|
|
101
102
|
case "border-bottom":
|
|
102
|
-
n === v && _t(
|
|
103
|
+
n === v && _t(j, n, p, { b: !0 }, r);
|
|
103
104
|
break;
|
|
104
105
|
}
|
|
105
106
|
});
|
|
106
107
|
}
|
|
107
108
|
});
|
|
108
109
|
};
|
|
109
|
-
function Et(
|
|
110
|
-
if (!
|
|
111
|
-
const
|
|
112
|
-
if (
|
|
113
|
-
const C =
|
|
110
|
+
function Et(j) {
|
|
111
|
+
if (!j || typeof j != "string") return null;
|
|
112
|
+
const q = j.trim();
|
|
113
|
+
if (q.startsWith("#")) {
|
|
114
|
+
const C = q.replace("#", "").toUpperCase();
|
|
114
115
|
return C.length === 3 ? "FF" + C.split("").map((c) => c + c).join("") : C.length === 6 ? "FF" + C : null;
|
|
115
116
|
}
|
|
116
|
-
const s =
|
|
117
|
+
const s = q.match(/rgba?\s*\(\s*([\d.]+)[,\s]+([\d.]+)[,\s]+([\d.]+)/i);
|
|
117
118
|
if (s) {
|
|
118
119
|
const C = (c) => Math.min(255, Math.max(0, Math.round(c))).toString(16).padStart(2, "0").toUpperCase();
|
|
119
120
|
return "FF" + C(parseFloat(s[1])) + C(parseFloat(s[2])) + C(parseFloat(s[3]));
|
|
120
121
|
}
|
|
121
122
|
return null;
|
|
122
123
|
}
|
|
123
|
-
function Ht(
|
|
124
|
-
const
|
|
125
|
-
if (
|
|
126
|
-
const c = Et(
|
|
124
|
+
function Ht(j) {
|
|
125
|
+
const q = {}, s = {};
|
|
126
|
+
if (j.textColor && j.textColor.toLowerCase() !== "#000000") {
|
|
127
|
+
const c = Et(j.textColor);
|
|
127
128
|
c && (s.color = { argb: c });
|
|
128
129
|
}
|
|
129
|
-
|
|
130
|
-
const C =
|
|
130
|
+
j.bold && (s.bold = !0), j.italic && (s.italic = !0), j.underline && (s.underline = !0), j.strikethrough && (s.strike = !0), Object.keys(s).length > 0 && (q.font = s);
|
|
131
|
+
const C = j.cellColor;
|
|
131
132
|
if (C && C.toLowerCase() !== "#ffffff") {
|
|
132
133
|
const c = Et(C);
|
|
133
|
-
c && (
|
|
134
|
+
c && (q.fill = { type: "pattern", pattern: "solid", fgColor: { argb: c } });
|
|
134
135
|
}
|
|
135
|
-
return
|
|
136
|
+
return q;
|
|
136
137
|
}
|
|
137
|
-
function Vt(
|
|
138
|
-
return !Array.isArray(
|
|
138
|
+
function Vt(j) {
|
|
139
|
+
return !Array.isArray(j) || j.length === 0 ? "" : j.map((s) => {
|
|
139
140
|
const [C, c] = s.row, [o, a] = s.column, r = dt.encode_cell({ r: C, c: o }), l = dt.encode_cell({ r: c, c: a });
|
|
140
141
|
return r === l ? r : `${r}:${l}`;
|
|
141
142
|
}).filter(Boolean).join(" ");
|
|
142
143
|
}
|
|
143
|
-
function Gt(
|
|
144
|
-
const { conditionName: C, conditionValue: c = [], format: o = {} } =
|
|
144
|
+
function Gt(j, q, s) {
|
|
145
|
+
const { conditionName: C, conditionValue: c = [], format: o = {} } = j, a = Ht(o), r = (d) => d.replace(/"/g, '""'), l = q.split(/[\s:]/)[0];
|
|
145
146
|
switch (C) {
|
|
146
147
|
case "greaterThan":
|
|
147
148
|
case "greaterThanOrEqual":
|
|
@@ -387,9 +388,9 @@ function Gt(L, K, s) {
|
|
|
387
388
|
return null;
|
|
388
389
|
}
|
|
389
390
|
}
|
|
390
|
-
function
|
|
391
|
+
function Yt(j, q, s) {
|
|
391
392
|
var a;
|
|
392
|
-
const C =
|
|
393
|
+
const C = q.luckysheet_conditionformat_save, c = [];
|
|
393
394
|
if (!Array.isArray(C) || C.length === 0)
|
|
394
395
|
return { nextPriority: s, pendingDuplicateValues: c };
|
|
395
396
|
let o = s;
|
|
@@ -408,13 +409,10 @@ function qt(L, K, s) {
|
|
|
408
409
|
continue;
|
|
409
410
|
}
|
|
410
411
|
const d = Gt(r, l, o);
|
|
411
|
-
d && (
|
|
412
|
+
d && (j.addConditionalFormatting({ ref: l, rules: [d] }), o++);
|
|
412
413
|
}
|
|
413
414
|
return { nextPriority: o, pendingDuplicateValues: c };
|
|
414
415
|
}
|
|
415
|
-
function Ct(L) {
|
|
416
|
-
throw new Error('Could not dynamically require "' + L + '". Please configure the dynamicRequireTargets or/and ignoreDynamicRequires option of @rollup/plugin-commonjs appropriately for this require call to work.');
|
|
417
|
-
}
|
|
418
416
|
var Ot = { exports: {} };
|
|
419
417
|
/*!
|
|
420
418
|
|
|
@@ -427,9 +425,9 @@ Dual licenced under the MIT license or GPLv3. See https://raw.github.com/Stuk/js
|
|
|
427
425
|
JSZip uses the library pako released under the MIT license :
|
|
428
426
|
https://github.com/nodeca/pako/blob/main/LICENSE
|
|
429
427
|
*/
|
|
430
|
-
(function(
|
|
428
|
+
(function(j, q) {
|
|
431
429
|
(function(s) {
|
|
432
|
-
|
|
430
|
+
j.exports = s();
|
|
433
431
|
})(function() {
|
|
434
432
|
return function s(C, c, o) {
|
|
435
433
|
function a(d, v) {
|
|
@@ -542,8 +540,8 @@ https://github.com/nodeca/pako/blob/main/LICENSE
|
|
|
542
540
|
return h;
|
|
543
541
|
}
|
|
544
542
|
function a(n, p, i, h, u, _) {
|
|
545
|
-
var k, A, S = n.file,
|
|
546
|
-
p && !i || (
|
|
543
|
+
var k, A, S = n.file, L = n.compression, O = _ !== d.utf8encode, D = r.transformTo("string", _(S.name)), I = r.transformTo("string", d.utf8encode(S.name)), H = S.comment, Y = r.transformTo("string", _(H)), b = r.transformTo("string", d.utf8encode(H)), R = I.length !== S.name.length, e = b.length !== H.length, F = "", Q = "", M = "", et = S.dir, U = S.date, K = { crc32: 0, compressedSize: 0, uncompressedSize: 0 };
|
|
544
|
+
p && !i || (K.crc32 = n.crc32, K.compressedSize = n.compressedSize, K.uncompressedSize = n.uncompressedSize);
|
|
547
545
|
var E = 0;
|
|
548
546
|
p && (E |= 8), O || !R && !e || (E |= 2048);
|
|
549
547
|
var w = 0, N = 0;
|
|
@@ -552,10 +550,10 @@ https://github.com/nodeca/pako/blob/main/LICENSE
|
|
|
552
550
|
return B || (rt = it ? 16893 : 33204), (65535 & rt) << 16;
|
|
553
551
|
}(S.unixPermissions, et)) : (N = 20, w |= function(B) {
|
|
554
552
|
return 63 & (B || 0);
|
|
555
|
-
}(S.dosPermissions)), k = U.getUTCHours(), k <<= 6, k |= U.getUTCMinutes(), k <<= 5, k |= U.getUTCSeconds() / 2, A = U.getUTCFullYear() - 1980, A <<= 4, A |= U.getUTCMonth() + 1, A <<= 5, A |= U.getUTCDate(), R && (Q = o(1, 1) + o(v(D), 4) + I, F += "up" + o(Q.length, 2) + Q), e && (M = o(1, 1) + o(v(
|
|
553
|
+
}(S.dosPermissions)), k = U.getUTCHours(), k <<= 6, k |= U.getUTCMinutes(), k <<= 5, k |= U.getUTCSeconds() / 2, A = U.getUTCFullYear() - 1980, A <<= 4, A |= U.getUTCMonth() + 1, A <<= 5, A |= U.getUTCDate(), R && (Q = o(1, 1) + o(v(D), 4) + I, F += "up" + o(Q.length, 2) + Q), e && (M = o(1, 1) + o(v(Y), 4) + b, F += "uc" + o(M.length, 2) + M);
|
|
556
554
|
var $ = "";
|
|
557
555
|
return $ += `
|
|
558
|
-
\0`, $ += o(E, 2), $ +=
|
|
556
|
+
\0`, $ += o(E, 2), $ += L.magic, $ += o(k, 2), $ += o(A, 2), $ += o(K.crc32, 4), $ += o(K.compressedSize, 4), $ += o(K.uncompressedSize, 4), $ += o(D.length, 2), $ += o(F.length, 2), { fileRecord: g.LOCAL_FILE_HEADER + $ + D + F, dirRecord: g.CENTRAL_FILE_HEADER + o(N, 2) + $ + o(Y.length, 2) + "\0\0\0\0" + o(w, 4) + o(h, 4) + D + F + Y };
|
|
559
557
|
}
|
|
560
558
|
var r = s("../utils"), l = s("../stream/GenericWorker"), d = s("../utf8"), v = s("../crc32"), g = s("../signature");
|
|
561
559
|
function y(n, p, i, h) {
|
|
@@ -582,8 +580,8 @@ https://github.com/nodeca/pako/blob/main/LICENSE
|
|
|
582
580
|
}, y.prototype.flush = function() {
|
|
583
581
|
for (var n = this.bytesWritten, p = 0; p < this.dirRecords.length; p++) this.push({ data: this.dirRecords[p], meta: { percent: 100 } });
|
|
584
582
|
var i = this.bytesWritten - n, h = function(u, _, k, A, S) {
|
|
585
|
-
var
|
|
586
|
-
return g.CENTRAL_DIRECTORY_END + "\0\0\0\0" + o(u, 2) + o(u, 2) + o(_, 4) + o(k, 4) + o(
|
|
583
|
+
var L = r.transformTo("string", S(A));
|
|
584
|
+
return g.CENTRAL_DIRECTORY_END + "\0\0\0\0" + o(u, 2) + o(u, 2) + o(_, 4) + o(k, 4) + o(L.length, 2) + L;
|
|
587
585
|
}(this.dirRecords.length, i, n, this.zipComment, this.encodeFileName);
|
|
588
586
|
this.push({ data: h, meta: { percent: 100 } });
|
|
589
587
|
}, y.prototype.prepareNextSource = function() {
|
|
@@ -723,24 +721,24 @@ https://github.com/nodeca/pako/blob/main/LICENSE
|
|
|
723
721
|
return o && typeof o.on == "function" && typeof o.pause == "function" && typeof o.resume == "function";
|
|
724
722
|
} };
|
|
725
723
|
}, {}], 15: [function(s, C, c) {
|
|
726
|
-
function o(S,
|
|
727
|
-
var D, I = r.getTypeOf(
|
|
724
|
+
function o(S, L, O) {
|
|
725
|
+
var D, I = r.getTypeOf(L), H = r.extend(O || {}, v);
|
|
728
726
|
H.date = H.date || /* @__PURE__ */ new Date(), H.compression !== null && (H.compression = H.compression.toUpperCase()), typeof H.unixPermissions == "string" && (H.unixPermissions = parseInt(H.unixPermissions, 8)), H.unixPermissions && 16384 & H.unixPermissions && (H.dir = !0), H.dosPermissions && 16 & H.dosPermissions && (H.dir = !0), H.dir && (S = u(S)), H.createFolders && (D = h(S)) && _.call(this, D, !0);
|
|
729
|
-
var
|
|
730
|
-
O && O.binary !== void 0 || (H.binary = !
|
|
727
|
+
var Y = I === "string" && H.binary === !1 && H.base64 === !1;
|
|
728
|
+
O && O.binary !== void 0 || (H.binary = !Y), (L instanceof g && L.uncompressedSize === 0 || H.dir || !L || L.length === 0) && (H.base64 = !1, H.binary = !0, L = "", H.compression = "STORE", I = "string");
|
|
731
729
|
var b = null;
|
|
732
|
-
b =
|
|
730
|
+
b = L instanceof g || L instanceof l ? L : p.isNode && p.isStream(L) ? new i(S, L) : r.prepareContent(S, L, H.binary, H.optimizedBinaryString, H.base64);
|
|
733
731
|
var R = new y(S, b, H);
|
|
734
732
|
this.files[S] = R;
|
|
735
733
|
}
|
|
736
734
|
var a = s("./utf8"), r = s("./utils"), l = s("./stream/GenericWorker"), d = s("./stream/StreamHelper"), v = s("./defaults"), g = s("./compressedObject"), y = s("./zipObject"), n = s("./generate"), p = s("./nodejsUtils"), i = s("./nodejs/NodejsStreamInputAdapter"), h = function(S) {
|
|
737
735
|
S.slice(-1) === "/" && (S = S.substring(0, S.length - 1));
|
|
738
|
-
var
|
|
739
|
-
return 0 <
|
|
736
|
+
var L = S.lastIndexOf("/");
|
|
737
|
+
return 0 < L ? S.substring(0, L) : "";
|
|
740
738
|
}, u = function(S) {
|
|
741
739
|
return S.slice(-1) !== "/" && (S += "/"), S;
|
|
742
|
-
}, _ = function(S,
|
|
743
|
-
return
|
|
740
|
+
}, _ = function(S, L) {
|
|
741
|
+
return L = L !== void 0 ? L : v.createFolders, S = u(S), this.files[S] || o.call(this, S, null, { dir: !0, createFolders: L }), this.files[S];
|
|
744
742
|
};
|
|
745
743
|
function k(S) {
|
|
746
744
|
return Object.prototype.toString.call(S) === "[object RegExp]";
|
|
@@ -748,19 +746,19 @@ https://github.com/nodeca/pako/blob/main/LICENSE
|
|
|
748
746
|
var A = { load: function() {
|
|
749
747
|
throw new Error("This method has been removed in JSZip 3.0, please check the upgrade guide.");
|
|
750
748
|
}, forEach: function(S) {
|
|
751
|
-
var
|
|
752
|
-
for (
|
|
749
|
+
var L, O, D;
|
|
750
|
+
for (L in this.files) D = this.files[L], (O = L.slice(this.root.length, L.length)) && L.slice(0, this.root.length) === this.root && S(O, D);
|
|
753
751
|
}, filter: function(S) {
|
|
754
|
-
var
|
|
752
|
+
var L = [];
|
|
755
753
|
return this.forEach(function(O, D) {
|
|
756
|
-
S(O, D) &&
|
|
757
|
-
}),
|
|
758
|
-
}, file: function(S,
|
|
759
|
-
if (arguments.length !== 1) return S = this.root + S, o.call(this, S,
|
|
754
|
+
S(O, D) && L.push(D);
|
|
755
|
+
}), L;
|
|
756
|
+
}, file: function(S, L, O) {
|
|
757
|
+
if (arguments.length !== 1) return S = this.root + S, o.call(this, S, L, O), this;
|
|
760
758
|
if (k(S)) {
|
|
761
759
|
var D = S;
|
|
762
|
-
return this.filter(function(H,
|
|
763
|
-
return !
|
|
760
|
+
return this.filter(function(H, Y) {
|
|
761
|
+
return !Y.dir && D.test(H);
|
|
764
762
|
});
|
|
765
763
|
}
|
|
766
764
|
var I = this.files[this.root + S];
|
|
@@ -770,12 +768,12 @@ https://github.com/nodeca/pako/blob/main/LICENSE
|
|
|
770
768
|
if (k(S)) return this.filter(function(I, H) {
|
|
771
769
|
return H.dir && S.test(I);
|
|
772
770
|
});
|
|
773
|
-
var
|
|
771
|
+
var L = this.root + S, O = _.call(this, L), D = this.clone();
|
|
774
772
|
return D.root = O.name, D;
|
|
775
773
|
}, remove: function(S) {
|
|
776
774
|
S = this.root + S;
|
|
777
|
-
var
|
|
778
|
-
if (
|
|
775
|
+
var L = this.files[S];
|
|
776
|
+
if (L || (S.slice(-1) !== "/" && (S += "/"), L = this.files[S]), L && !L.dir) delete this.files[S];
|
|
779
777
|
else for (var O = this.filter(function(I, H) {
|
|
780
778
|
return H.name.slice(0, S.length) === S;
|
|
781
779
|
}), D = 0; D < O.length; D++) delete this.files[O[D].name];
|
|
@@ -783,20 +781,20 @@ https://github.com/nodeca/pako/blob/main/LICENSE
|
|
|
783
781
|
}, generate: function() {
|
|
784
782
|
throw new Error("This method has been removed in JSZip 3.0, please check the upgrade guide.");
|
|
785
783
|
}, generateInternalStream: function(S) {
|
|
786
|
-
var
|
|
784
|
+
var L, O = {};
|
|
787
785
|
try {
|
|
788
786
|
if ((O = r.extend(S || {}, { streamFiles: !1, compression: "STORE", compressionOptions: null, type: "", platform: "DOS", comment: null, mimeType: "application/zip", encodeFileName: a.utf8encode })).type = O.type.toLowerCase(), O.compression = O.compression.toUpperCase(), O.type === "binarystring" && (O.type = "string"), !O.type) throw new Error("No output type specified.");
|
|
789
787
|
r.checkSupport(O.type), O.platform !== "darwin" && O.platform !== "freebsd" && O.platform !== "linux" && O.platform !== "sunos" || (O.platform = "UNIX"), O.platform === "win32" && (O.platform = "DOS");
|
|
790
788
|
var D = O.comment || this.comment || "";
|
|
791
|
-
|
|
789
|
+
L = n.generateWorker(this, O, D);
|
|
792
790
|
} catch (I) {
|
|
793
|
-
(
|
|
791
|
+
(L = new l("error")).error(I);
|
|
794
792
|
}
|
|
795
|
-
return new d(
|
|
796
|
-
}, generateAsync: function(S,
|
|
797
|
-
return this.generateInternalStream(S).accumulate(
|
|
798
|
-
}, generateNodeStream: function(S,
|
|
799
|
-
return (S = S || {}).type || (S.type = "nodebuffer"), this.generateInternalStream(S).toNodejsStream(
|
|
793
|
+
return new d(L, O.type || "string", O.mimeType);
|
|
794
|
+
}, generateAsync: function(S, L) {
|
|
795
|
+
return this.generateInternalStream(S).accumulate(L);
|
|
796
|
+
}, generateNodeStream: function(S, L) {
|
|
797
|
+
return (S = S || {}).type || (S.type = "nodebuffer"), this.generateInternalStream(S).toNodejsStream(L);
|
|
800
798
|
} };
|
|
801
799
|
C.exports = A;
|
|
802
800
|
}, { "./compressedObject": 2, "./defaults": 5, "./generate": 9, "./nodejs/NodejsStreamInputAdapter": 12, "./nodejsUtils": 14, "./stream/GenericWorker": 28, "./stream/StreamHelper": 29, "./utf8": 31, "./utils": 32, "./zipObject": 35 }], 16: [function(s, C, c) {
|
|
@@ -1018,13 +1016,13 @@ https://github.com/nodeca/pako/blob/main/LICENSE
|
|
|
1018
1016
|
function y(p, i) {
|
|
1019
1017
|
return new v.Promise(function(h, u) {
|
|
1020
1018
|
var _ = [], k = p._internalType, A = p._outputType, S = p._mimeType;
|
|
1021
|
-
p.on("data", function(
|
|
1022
|
-
_.push(
|
|
1023
|
-
}).on("error", function(
|
|
1024
|
-
_ = [], u(
|
|
1019
|
+
p.on("data", function(L, O) {
|
|
1020
|
+
_.push(L), i && i(O);
|
|
1021
|
+
}).on("error", function(L) {
|
|
1022
|
+
_ = [], u(L);
|
|
1025
1023
|
}).on("end", function() {
|
|
1026
1024
|
try {
|
|
1027
|
-
var
|
|
1025
|
+
var L = function(O, D, I) {
|
|
1028
1026
|
switch (O) {
|
|
1029
1027
|
case "blob":
|
|
1030
1028
|
return o.newBlob(o.transformTo("arraybuffer", D), I);
|
|
@@ -1034,7 +1032,7 @@ https://github.com/nodeca/pako/blob/main/LICENSE
|
|
|
1034
1032
|
return o.transformTo(O, D);
|
|
1035
1033
|
}
|
|
1036
1034
|
}(A, function(O, D) {
|
|
1037
|
-
var I, H = 0,
|
|
1035
|
+
var I, H = 0, Y = null, b = 0;
|
|
1038
1036
|
for (I = 0; I < D.length; I++) b += D[I].length;
|
|
1039
1037
|
switch (O) {
|
|
1040
1038
|
case "string":
|
|
@@ -1042,15 +1040,15 @@ https://github.com/nodeca/pako/blob/main/LICENSE
|
|
|
1042
1040
|
case "array":
|
|
1043
1041
|
return Array.prototype.concat.apply([], D);
|
|
1044
1042
|
case "uint8array":
|
|
1045
|
-
for (
|
|
1046
|
-
return
|
|
1043
|
+
for (Y = new Uint8Array(b), I = 0; I < D.length; I++) Y.set(D[I], H), H += D[I].length;
|
|
1044
|
+
return Y;
|
|
1047
1045
|
case "nodebuffer":
|
|
1048
1046
|
return Buffer.concat(D);
|
|
1049
1047
|
default:
|
|
1050
1048
|
throw new Error("concat : unsupported type '" + O + "'");
|
|
1051
1049
|
}
|
|
1052
1050
|
}(k, _), S);
|
|
1053
|
-
h(
|
|
1051
|
+
h(L);
|
|
1054
1052
|
} catch (O) {
|
|
1055
1053
|
u(O);
|
|
1056
1054
|
}
|
|
@@ -1283,18 +1281,18 @@ https://github.com/nodeca/pako/blob/main/LICENSE
|
|
|
1283
1281
|
return u;
|
|
1284
1282
|
}, c.prepareContent = function(i, h, u, _, k) {
|
|
1285
1283
|
return l.Promise.resolve(h).then(function(A) {
|
|
1286
|
-
return o.blob && (A instanceof Blob || ["[object File]", "[object Blob]"].indexOf(Object.prototype.toString.call(A)) !== -1) && typeof FileReader < "u" ? new l.Promise(function(S,
|
|
1284
|
+
return o.blob && (A instanceof Blob || ["[object File]", "[object Blob]"].indexOf(Object.prototype.toString.call(A)) !== -1) && typeof FileReader < "u" ? new l.Promise(function(S, L) {
|
|
1287
1285
|
var O = new FileReader();
|
|
1288
1286
|
O.onload = function(D) {
|
|
1289
1287
|
S(D.target.result);
|
|
1290
1288
|
}, O.onerror = function(D) {
|
|
1291
|
-
|
|
1289
|
+
L(D.target.error);
|
|
1292
1290
|
}, O.readAsArrayBuffer(A);
|
|
1293
1291
|
}) : A;
|
|
1294
1292
|
}).then(function(A) {
|
|
1295
1293
|
var S = c.getTypeOf(A);
|
|
1296
|
-
return S ? (S === "arraybuffer" ? A = c.transformTo("uint8array", A) : S === "string" && (k ? A = a.decode(A) : u && _ !== !0 && (A = function(
|
|
1297
|
-
return v(
|
|
1294
|
+
return S ? (S === "arraybuffer" ? A = c.transformTo("uint8array", A) : S === "string" && (k ? A = a.decode(A) : u && _ !== !0 && (A = function(L) {
|
|
1295
|
+
return v(L, o.uint8array ? new Uint8Array(L.length) : new Array(L.length));
|
|
1298
1296
|
}(A))), A) : l.Promise.reject(new Error("Can't read the data of '" + i + "'. Is it in a supported JavaScript type (String, Blob, ArrayBuffer, etc) ?"));
|
|
1299
1297
|
});
|
|
1300
1298
|
};
|
|
@@ -1522,10 +1520,10 @@ https://github.com/nodeca/pako/blob/main/LICENSE
|
|
|
1522
1520
|
function S(O) {
|
|
1523
1521
|
k || (k = !0, r.resolve(u, O));
|
|
1524
1522
|
}
|
|
1525
|
-
var
|
|
1523
|
+
var L = h(function() {
|
|
1526
1524
|
_(S, A);
|
|
1527
1525
|
});
|
|
1528
|
-
|
|
1526
|
+
L.status === "error" && A(L.value);
|
|
1529
1527
|
}
|
|
1530
1528
|
function h(u, _) {
|
|
1531
1529
|
var k = {};
|
|
@@ -1569,7 +1567,7 @@ https://github.com/nodeca/pako/blob/main/LICENSE
|
|
|
1569
1567
|
if (A) i(u, A);
|
|
1570
1568
|
else {
|
|
1571
1569
|
u.state = d, u.outcome = _;
|
|
1572
|
-
for (var S = -1,
|
|
1570
|
+
for (var S = -1, L = u.queue.length; ++S < L; ) u.queue[S].callFulfilled(_);
|
|
1573
1571
|
}
|
|
1574
1572
|
return u;
|
|
1575
1573
|
}, r.reject = function(u, _) {
|
|
@@ -1586,11 +1584,11 @@ https://github.com/nodeca/pako/blob/main/LICENSE
|
|
|
1586
1584
|
if (Object.prototype.toString.call(u) !== "[object Array]") return this.reject(new TypeError("must be an array"));
|
|
1587
1585
|
var k = u.length, A = !1;
|
|
1588
1586
|
if (!k) return this.resolve([]);
|
|
1589
|
-
for (var S = new Array(k),
|
|
1587
|
+
for (var S = new Array(k), L = 0, O = -1, D = new this(a); ++O < k; ) I(u[O], O);
|
|
1590
1588
|
return D;
|
|
1591
|
-
function I(H,
|
|
1589
|
+
function I(H, Y) {
|
|
1592
1590
|
_.resolve(H).then(function(b) {
|
|
1593
|
-
S[
|
|
1591
|
+
S[Y] = b, ++L !== k || A || (A = !0, r.resolve(D, S));
|
|
1594
1592
|
}, function(b) {
|
|
1595
1593
|
A || (A = !0, r.reject(D, b));
|
|
1596
1594
|
});
|
|
@@ -1600,13 +1598,13 @@ https://github.com/nodeca/pako/blob/main/LICENSE
|
|
|
1600
1598
|
if (Object.prototype.toString.call(u) !== "[object Array]") return this.reject(new TypeError("must be an array"));
|
|
1601
1599
|
var k = u.length, A = !1;
|
|
1602
1600
|
if (!k) return this.resolve([]);
|
|
1603
|
-
for (var S = -1,
|
|
1604
|
-
A || (A = !0, r.resolve(
|
|
1601
|
+
for (var S = -1, L = new this(a); ++S < k; ) O = u[S], _.resolve(O).then(function(D) {
|
|
1602
|
+
A || (A = !0, r.resolve(L, D));
|
|
1605
1603
|
}, function(D) {
|
|
1606
|
-
A || (A = !0, r.reject(
|
|
1604
|
+
A || (A = !0, r.reject(L, D));
|
|
1607
1605
|
});
|
|
1608
1606
|
var O;
|
|
1609
|
-
return
|
|
1607
|
+
return L;
|
|
1610
1608
|
};
|
|
1611
1609
|
}, { immediate: 36 }], 38: [function(s, C, c) {
|
|
1612
1610
|
var o = {};
|
|
@@ -1632,11 +1630,11 @@ https://github.com/nodeca/pako/blob/main/LICENSE
|
|
|
1632
1630
|
return k.result;
|
|
1633
1631
|
}
|
|
1634
1632
|
i.prototype.push = function(u, _) {
|
|
1635
|
-
var k, A, S = this.strm,
|
|
1633
|
+
var k, A, S = this.strm, L = this.options.chunkSize;
|
|
1636
1634
|
if (this.ended) return !1;
|
|
1637
1635
|
A = _ === ~~_ ? _ : _ === !0 ? 4 : 0, typeof u == "string" ? S.input = r.string2buf(u) : v.call(u) === "[object ArrayBuffer]" ? S.input = new Uint8Array(u) : S.input = u, S.next_in = 0, S.avail_in = S.input.length;
|
|
1638
1636
|
do {
|
|
1639
|
-
if (S.avail_out === 0 && (S.output = new a.Buf8(
|
|
1637
|
+
if (S.avail_out === 0 && (S.output = new a.Buf8(L), S.next_out = 0, S.avail_out = L), (k = o.deflate(S, A)) !== 1 && k !== g) return this.onEnd(k), !(this.ended = !0);
|
|
1640
1638
|
S.avail_out !== 0 && (S.avail_in !== 0 || A !== 4 && A !== 2) || (this.options.to === "string" ? this.onData(r.buf2binstring(a.shrinkBuf(S.output, S.next_out))) : this.onData(a.shrinkBuf(S.output, S.next_out)));
|
|
1641
1639
|
} while ((0 < S.avail_in || S.avail_out === 0) && k !== 1);
|
|
1642
1640
|
return A === 4 ? (k = o.deflateEnd(this.strm), this.onEnd(k), this.ended = !0, k === g) : A !== 2 || (this.onEnd(g), !(S.avail_out = 0));
|
|
@@ -1666,11 +1664,11 @@ https://github.com/nodeca/pako/blob/main/LICENSE
|
|
|
1666
1664
|
return u.result;
|
|
1667
1665
|
}
|
|
1668
1666
|
n.prototype.push = function(i, h) {
|
|
1669
|
-
var u, _, k, A, S,
|
|
1667
|
+
var u, _, k, A, S, L, O = this.strm, D = this.options.chunkSize, I = this.options.dictionary, H = !1;
|
|
1670
1668
|
if (this.ended) return !1;
|
|
1671
1669
|
_ = h === ~~h ? h : h === !0 ? l.Z_FINISH : l.Z_NO_FLUSH, typeof i == "string" ? O.input = r.binstring2buf(i) : y.call(i) === "[object ArrayBuffer]" ? O.input = new Uint8Array(i) : O.input = i, O.next_in = 0, O.avail_in = O.input.length;
|
|
1672
1670
|
do {
|
|
1673
|
-
if (O.avail_out === 0 && (O.output = new a.Buf8(D), O.next_out = 0, O.avail_out = D), (u = o.inflate(O, l.Z_NO_FLUSH)) === l.Z_NEED_DICT && I && (
|
|
1671
|
+
if (O.avail_out === 0 && (O.output = new a.Buf8(D), O.next_out = 0, O.avail_out = D), (u = o.inflate(O, l.Z_NO_FLUSH)) === l.Z_NEED_DICT && I && (L = typeof I == "string" ? r.string2buf(I) : y.call(I) === "[object ArrayBuffer]" ? new Uint8Array(I) : I, u = o.inflateSetDictionary(this.strm, L)), u === l.Z_BUF_ERROR && H === !0 && (u = l.Z_OK, H = !1), u !== l.Z_STREAM_END && u !== l.Z_OK) return this.onEnd(u), !(this.ended = !0);
|
|
1674
1672
|
O.next_out && (O.avail_out !== 0 && u !== l.Z_STREAM_END && (O.avail_in !== 0 || _ !== l.Z_FINISH && _ !== l.Z_SYNC_FLUSH) || (this.options.to === "string" ? (k = r.utf8border(O.output, O.next_out), A = O.next_out - k, S = r.buf2string(O.output, k), O.next_out = A, O.avail_out = D - A, A && a.arraySet(O.output, O.output, k, A, 0), this.onData(S)) : this.onData(a.shrinkBuf(O.output, O.next_out)))), O.avail_in === 0 && O.avail_out === 0 && (H = !0);
|
|
1675
1673
|
} while ((0 < O.avail_in || O.avail_out === 0) && u !== l.Z_STREAM_END);
|
|
1676
1674
|
return u === l.Z_STREAM_END && (_ = l.Z_FINISH), _ === l.Z_FINISH ? (u = o.inflateEnd(this.strm), this.onEnd(u), this.ended = !0, u === l.Z_OK) : _ !== l.Z_SYNC_FLUSH || (this.onEnd(l.Z_OK), !(O.avail_out = 0));
|
|
@@ -1779,14 +1777,14 @@ https://github.com/nodeca/pako/blob/main/LICENSE
|
|
|
1779
1777
|
return -1 ^ a;
|
|
1780
1778
|
};
|
|
1781
1779
|
}, {}], 46: [function(s, C, c) {
|
|
1782
|
-
var o, a = s("../utils/common"), r = s("./trees"), l = s("./adler32"), d = s("./crc32"), v = s("./messages"), g = 0, y = 4, n = 0, p = -2, i = -1, h = 4, u = 2, _ = 8, k = 9, A = 286, S = 30,
|
|
1780
|
+
var o, a = s("../utils/common"), r = s("./trees"), l = s("./adler32"), d = s("./crc32"), v = s("./messages"), g = 0, y = 4, n = 0, p = -2, i = -1, h = 4, u = 2, _ = 8, k = 9, A = 286, S = 30, L = 19, O = 2 * A + 1, D = 15, I = 3, H = 258, Y = H + I + 1, b = 42, R = 113, e = 1, F = 2, Q = 3, M = 4;
|
|
1783
1781
|
function et(t, P) {
|
|
1784
1782
|
return t.msg = v[P], P;
|
|
1785
1783
|
}
|
|
1786
1784
|
function U(t) {
|
|
1787
1785
|
return (t << 1) - (4 < t ? 9 : 0);
|
|
1788
1786
|
}
|
|
1789
|
-
function
|
|
1787
|
+
function K(t) {
|
|
1790
1788
|
for (var P = t.length; 0 <= --P; ) t[P] = 0;
|
|
1791
1789
|
}
|
|
1792
1790
|
function E(t) {
|
|
@@ -1803,7 +1801,7 @@ https://github.com/nodeca/pako/blob/main/LICENSE
|
|
|
1803
1801
|
t.pending_buf[t.pending++] = P >>> 8 & 255, t.pending_buf[t.pending++] = 255 & P;
|
|
1804
1802
|
}
|
|
1805
1803
|
function B(t, P) {
|
|
1806
|
-
var T, m, f = t.max_chain_length, x = t.strstart, W = t.prev_length, Z = t.nice_match, z = t.strstart > t.w_size -
|
|
1804
|
+
var T, m, f = t.max_chain_length, x = t.strstart, W = t.prev_length, Z = t.nice_match, z = t.strstart > t.w_size - Y ? t.strstart - (t.w_size - Y) : 0, V = t.window, X = t.w_mask, G = t.prev, J = t.strstart + H, lt = V[x + W - 1], at = V[x + W];
|
|
1807
1805
|
t.prev_length >= t.good_match && (f >>= 2), Z > t.lookahead && (Z = t.lookahead);
|
|
1808
1806
|
do
|
|
1809
1807
|
if (V[(T = P) + W] === at && V[T + W - 1] === lt && V[T] === V[x] && V[++T] === V[x + 1]) {
|
|
@@ -1822,22 +1820,22 @@ https://github.com/nodeca/pako/blob/main/LICENSE
|
|
|
1822
1820
|
function it(t) {
|
|
1823
1821
|
var P, T, m, f, x, W, Z, z, V, X, G = t.w_size;
|
|
1824
1822
|
do {
|
|
1825
|
-
if (f = t.window_size - t.lookahead - t.strstart, t.strstart >= G + (G -
|
|
1823
|
+
if (f = t.window_size - t.lookahead - t.strstart, t.strstart >= G + (G - Y)) {
|
|
1826
1824
|
for (a.arraySet(t.window, t.window, G, G, 0), t.match_start -= G, t.strstart -= G, t.block_start -= G, P = T = t.hash_size; m = t.head[--P], t.head[P] = G <= m ? m - G : 0, --T; ) ;
|
|
1827
1825
|
for (P = T = G; m = t.prev[--P], t.prev[P] = G <= m ? m - G : 0, --T; ) ;
|
|
1828
1826
|
f += G;
|
|
1829
1827
|
}
|
|
1830
1828
|
if (t.strm.avail_in === 0) break;
|
|
1831
1829
|
if (W = t.strm, Z = t.window, z = t.strstart + t.lookahead, V = f, X = void 0, X = W.avail_in, V < X && (X = V), T = X === 0 ? 0 : (W.avail_in -= X, a.arraySet(Z, W.input, W.next_in, X, z), W.state.wrap === 1 ? W.adler = l(W.adler, Z, X, z) : W.state.wrap === 2 && (W.adler = d(W.adler, Z, X, z)), W.next_in += X, W.total_in += X, X), t.lookahead += T, t.lookahead + t.insert >= I) for (x = t.strstart - t.insert, t.ins_h = t.window[x], t.ins_h = (t.ins_h << t.hash_shift ^ t.window[x + 1]) & t.hash_mask; t.insert && (t.ins_h = (t.ins_h << t.hash_shift ^ t.window[x + I - 1]) & t.hash_mask, t.prev[x & t.w_mask] = t.head[t.ins_h], t.head[t.ins_h] = x, x++, t.insert--, !(t.lookahead + t.insert < I)); ) ;
|
|
1832
|
-
} while (t.lookahead <
|
|
1830
|
+
} while (t.lookahead < Y && t.strm.avail_in !== 0);
|
|
1833
1831
|
}
|
|
1834
1832
|
function rt(t, P) {
|
|
1835
1833
|
for (var T, m; ; ) {
|
|
1836
|
-
if (t.lookahead <
|
|
1837
|
-
if (it(t), t.lookahead <
|
|
1834
|
+
if (t.lookahead < Y) {
|
|
1835
|
+
if (it(t), t.lookahead < Y && P === g) return e;
|
|
1838
1836
|
if (t.lookahead === 0) break;
|
|
1839
1837
|
}
|
|
1840
|
-
if (T = 0, t.lookahead >= I && (t.ins_h = (t.ins_h << t.hash_shift ^ t.window[t.strstart + I - 1]) & t.hash_mask, T = t.prev[t.strstart & t.w_mask] = t.head[t.ins_h], t.head[t.ins_h] = t.strstart), T !== 0 && t.strstart - T <= t.w_size -
|
|
1838
|
+
if (T = 0, t.lookahead >= I && (t.ins_h = (t.ins_h << t.hash_shift ^ t.window[t.strstart + I - 1]) & t.hash_mask, T = t.prev[t.strstart & t.w_mask] = t.head[t.ins_h], t.head[t.ins_h] = t.strstart), T !== 0 && t.strstart - T <= t.w_size - Y && (t.match_length = B(t, T)), t.match_length >= I) if (m = r._tr_tally(t, t.strstart - t.match_start, t.match_length - I), t.lookahead -= t.match_length, t.match_length <= t.max_lazy_match && t.lookahead >= I) {
|
|
1841
1839
|
for (t.match_length--; t.strstart++, t.ins_h = (t.ins_h << t.hash_shift ^ t.window[t.strstart + I - 1]) & t.hash_mask, T = t.prev[t.strstart & t.w_mask] = t.head[t.ins_h], t.head[t.ins_h] = t.strstart, --t.match_length != 0; ) ;
|
|
1842
1840
|
t.strstart++;
|
|
1843
1841
|
} else t.strstart += t.match_length, t.match_length = 0, t.ins_h = t.window[t.strstart], t.ins_h = (t.ins_h << t.hash_shift ^ t.window[t.strstart + 1]) & t.hash_mask;
|
|
@@ -1848,11 +1846,11 @@ https://github.com/nodeca/pako/blob/main/LICENSE
|
|
|
1848
1846
|
}
|
|
1849
1847
|
function tt(t, P) {
|
|
1850
1848
|
for (var T, m, f; ; ) {
|
|
1851
|
-
if (t.lookahead <
|
|
1852
|
-
if (it(t), t.lookahead <
|
|
1849
|
+
if (t.lookahead < Y) {
|
|
1850
|
+
if (it(t), t.lookahead < Y && P === g) return e;
|
|
1853
1851
|
if (t.lookahead === 0) break;
|
|
1854
1852
|
}
|
|
1855
|
-
if (T = 0, t.lookahead >= I && (t.ins_h = (t.ins_h << t.hash_shift ^ t.window[t.strstart + I - 1]) & t.hash_mask, T = t.prev[t.strstart & t.w_mask] = t.head[t.ins_h], t.head[t.ins_h] = t.strstart), t.prev_length = t.match_length, t.prev_match = t.match_start, t.match_length = I - 1, T !== 0 && t.prev_length < t.max_lazy_match && t.strstart - T <= t.w_size -
|
|
1853
|
+
if (T = 0, t.lookahead >= I && (t.ins_h = (t.ins_h << t.hash_shift ^ t.window[t.strstart + I - 1]) & t.hash_mask, T = t.prev[t.strstart & t.w_mask] = t.head[t.ins_h], t.head[t.ins_h] = t.strstart), t.prev_length = t.match_length, t.prev_match = t.match_start, t.match_length = I - 1, T !== 0 && t.prev_length < t.max_lazy_match && t.strstart - T <= t.w_size - Y && (t.match_length = B(t, T), t.match_length <= 5 && (t.strategy === 1 || t.match_length === I && 4096 < t.strstart - t.match_start) && (t.match_length = I - 1)), t.prev_length >= I && t.match_length <= t.prev_length) {
|
|
1856
1854
|
for (f = t.strstart + t.lookahead - I, m = r._tr_tally(t, t.strstart - 1 - t.prev_match, t.prev_length - I), t.lookahead -= t.prev_length - 1, t.prev_length -= 2; ++t.strstart <= f && (t.ins_h = (t.ins_h << t.hash_shift ^ t.window[t.strstart + I - 1]) & t.hash_mask, T = t.prev[t.strstart & t.w_mask] = t.head[t.ins_h], t.head[t.ins_h] = t.strstart), --t.prev_length != 0; ) ;
|
|
1857
1855
|
if (t.match_available = 0, t.match_length = I - 1, t.strstart++, m && (w(t, !1), t.strm.avail_out === 0)) return e;
|
|
1858
1856
|
} else if (t.match_available) {
|
|
@@ -1865,7 +1863,7 @@ https://github.com/nodeca/pako/blob/main/LICENSE
|
|
|
1865
1863
|
this.good_length = t, this.max_lazy = P, this.nice_length = T, this.max_chain = m, this.func = f;
|
|
1866
1864
|
}
|
|
1867
1865
|
function st() {
|
|
1868
|
-
this.strm = null, this.status = 0, this.pending_buf = null, this.pending_buf_size = 0, this.pending_out = 0, this.pending = 0, this.wrap = 0, this.gzhead = null, this.gzindex = 0, this.method = _, this.last_flush = -1, this.w_size = 0, this.w_bits = 0, this.w_mask = 0, this.window = null, this.window_size = 0, this.prev = null, this.head = null, this.ins_h = 0, this.hash_size = 0, this.hash_bits = 0, this.hash_mask = 0, this.hash_shift = 0, this.block_start = 0, this.match_length = 0, this.prev_match = 0, this.match_available = 0, this.strstart = 0, this.match_start = 0, this.lookahead = 0, this.prev_length = 0, this.max_chain_length = 0, this.max_lazy_match = 0, this.level = 0, this.strategy = 0, this.good_match = 0, this.nice_match = 0, this.dyn_ltree = new a.Buf16(2 * O), this.dyn_dtree = new a.Buf16(2 * (2 * S + 1)), this.bl_tree = new a.Buf16(2 * (2 *
|
|
1866
|
+
this.strm = null, this.status = 0, this.pending_buf = null, this.pending_buf_size = 0, this.pending_out = 0, this.pending = 0, this.wrap = 0, this.gzhead = null, this.gzindex = 0, this.method = _, this.last_flush = -1, this.w_size = 0, this.w_bits = 0, this.w_mask = 0, this.window = null, this.window_size = 0, this.prev = null, this.head = null, this.ins_h = 0, this.hash_size = 0, this.hash_bits = 0, this.hash_mask = 0, this.hash_shift = 0, this.block_start = 0, this.match_length = 0, this.prev_match = 0, this.match_available = 0, this.strstart = 0, this.match_start = 0, this.lookahead = 0, this.prev_length = 0, this.max_chain_length = 0, this.max_lazy_match = 0, this.level = 0, this.strategy = 0, this.good_match = 0, this.nice_match = 0, this.dyn_ltree = new a.Buf16(2 * O), this.dyn_dtree = new a.Buf16(2 * (2 * S + 1)), this.bl_tree = new a.Buf16(2 * (2 * L + 1)), K(this.dyn_ltree), K(this.dyn_dtree), K(this.bl_tree), this.l_desc = null, this.d_desc = null, this.bl_desc = null, this.bl_count = new a.Buf16(D + 1), this.heap = new a.Buf16(2 * A + 1), K(this.heap), this.heap_len = 0, this.heap_max = 0, this.depth = new a.Buf16(2 * A + 1), K(this.depth), this.l_buf = 0, this.lit_bufsize = 0, this.last_lit = 0, this.d_buf = 0, this.opt_len = 0, this.static_len = 0, this.matches = 0, this.insert = 0, this.bi_buf = 0, this.bi_valid = 0;
|
|
1869
1867
|
}
|
|
1870
1868
|
function ot(t) {
|
|
1871
1869
|
var P;
|
|
@@ -1874,7 +1872,7 @@ https://github.com/nodeca/pako/blob/main/LICENSE
|
|
|
1874
1872
|
function ft(t) {
|
|
1875
1873
|
var P = ot(t);
|
|
1876
1874
|
return P === n && function(T) {
|
|
1877
|
-
T.window_size = 2 * T.w_size,
|
|
1875
|
+
T.window_size = 2 * T.w_size, K(T.head), T.max_lazy_match = o[T.level].max_lazy, T.good_match = o[T.level].good_length, T.nice_match = o[T.level].nice_length, T.max_chain_length = o[T.level].max_chain, T.strstart = 0, T.block_start = 0, T.lookahead = 0, T.insert = 0, T.match_length = T.prev_length = I - 1, T.match_available = 0, T.ins_h = 0;
|
|
1878
1876
|
}(t.state), P;
|
|
1879
1877
|
}
|
|
1880
1878
|
function ct(t, P, T, m, f, x) {
|
|
@@ -1894,7 +1892,7 @@ https://github.com/nodeca/pako/blob/main/LICENSE
|
|
|
1894
1892
|
}
|
|
1895
1893
|
t.strstart += t.lookahead, t.lookahead = 0;
|
|
1896
1894
|
var m = t.block_start + T;
|
|
1897
|
-
if ((t.strstart === 0 || t.strstart >= m) && (t.lookahead = t.strstart - m, t.strstart = m, w(t, !1), t.strm.avail_out === 0) || t.strstart - t.block_start >= t.w_size -
|
|
1895
|
+
if ((t.strstart === 0 || t.strstart >= m) && (t.lookahead = t.strstart - m, t.strstart = m, w(t, !1), t.strm.avail_out === 0) || t.strstart - t.block_start >= t.w_size - Y && (w(t, !1), t.strm.avail_out === 0)) return e;
|
|
1898
1896
|
}
|
|
1899
1897
|
return t.insert = 0, P === y ? (w(t, !0), t.strm.avail_out === 0 ? Q : M) : (t.strstart > t.block_start && (w(t, !1), t.strm.avail_out), e);
|
|
1900
1898
|
}), new nt(4, 4, 8, 4, rt), new nt(4, 5, 16, 8, rt), new nt(4, 6, 32, 32, rt), new nt(4, 4, 16, 16, tt), new nt(8, 16, 32, 32, tt), new nt(8, 16, 128, 128, tt), new nt(8, 32, 128, 256, tt), new nt(32, 128, 258, 1024, tt), new nt(32, 258, 258, 4096, tt)], c.deflateInit = function(t, P) {
|
|
@@ -1968,7 +1966,7 @@ https://github.com/nodeca/pako/blob/main/LICENSE
|
|
|
1968
1966
|
return z.insert = 0, V === y ? (w(z, !0), z.strm.avail_out === 0 ? Q : M) : z.last_lit && (w(z, !1), z.strm.avail_out === 0) ? e : F;
|
|
1969
1967
|
}(m, P) : o[m.level].func(m, P);
|
|
1970
1968
|
if (Z !== Q && Z !== M || (m.status = 666), Z === e || Z === Q) return t.avail_out === 0 && (m.last_flush = -1), n;
|
|
1971
|
-
if (Z === F && (P === 1 ? r._tr_align(m) : P !== 5 && (r._tr_stored_block(m, 0, 0, !1), P === 3 && (
|
|
1969
|
+
if (Z === F && (P === 1 ? r._tr_align(m) : P !== 5 && (r._tr_stored_block(m, 0, 0, !1), P === 3 && (K(m.head), m.lookahead === 0 && (m.strstart = 0, m.block_start = 0, m.insert = 0))), E(t), t.avail_out === 0)) return m.last_flush = -1, n;
|
|
1972
1970
|
}
|
|
1973
1971
|
return P !== y ? n : m.wrap <= 0 ? 1 : (m.wrap === 2 ? (N(m, 255 & t.adler), N(m, t.adler >> 8 & 255), N(m, t.adler >> 16 & 255), N(m, t.adler >> 24 & 255), N(m, 255 & t.total_in), N(m, t.total_in >> 8 & 255), N(m, t.total_in >> 16 & 255), N(m, t.total_in >> 24 & 255)) : ($(m, t.adler >>> 16), $(m, 65535 & t.adler)), E(t), 0 < m.wrap && (m.wrap = -m.wrap), m.pending !== 0 ? n : 1);
|
|
1974
1972
|
}, c.deflateEnd = function(t) {
|
|
@@ -1977,7 +1975,7 @@ https://github.com/nodeca/pako/blob/main/LICENSE
|
|
|
1977
1975
|
}, c.deflateSetDictionary = function(t, P) {
|
|
1978
1976
|
var T, m, f, x, W, Z, z, V, X = P.length;
|
|
1979
1977
|
if (!t || !t.state || (x = (T = t.state).wrap) === 2 || x === 1 && T.status !== b || T.lookahead) return p;
|
|
1980
|
-
for (x === 1 && (t.adler = l(t.adler, P, X, 0)), T.wrap = 0, X >= T.w_size && (x === 0 && (
|
|
1978
|
+
for (x === 1 && (t.adler = l(t.adler, P, X, 0)), T.wrap = 0, X >= T.w_size && (x === 0 && (K(T.head), T.strstart = 0, T.block_start = 0, T.insert = 0), V = new a.Buf8(T.w_size), a.arraySet(V, P, X - T.w_size, T.w_size, 0), P = V, X = T.w_size), W = t.avail_in, Z = t.next_in, z = t.input, t.avail_in = X, t.next_in = 0, t.input = P, it(T); T.lookahead >= I; ) {
|
|
1981
1979
|
for (m = T.strstart, f = T.lookahead - (I - 1); T.ins_h = (T.ins_h << T.hash_shift ^ T.window[m + I - 1]) & T.hash_mask, T.prev[m & T.w_mask] = T.head[T.ins_h], T.head[T.ins_h] = m, m++, --f; ) ;
|
|
1982
1980
|
T.strstart = m, T.lookahead = I - 1, it(T);
|
|
1983
1981
|
}
|
|
@@ -1989,10 +1987,10 @@ https://github.com/nodeca/pako/blob/main/LICENSE
|
|
|
1989
1987
|
};
|
|
1990
1988
|
}, {}], 48: [function(s, C, c) {
|
|
1991
1989
|
C.exports = function(o, a) {
|
|
1992
|
-
var r, l, d, v, g, y, n, p, i, h, u, _, k, A, S,
|
|
1993
|
-
r = o.state, l = o.next_in, e = o.input, d = l + (o.avail_in - 5), v = o.next_out, F = o.output, g = v - (a - o.avail_out), y = v + (o.avail_out - 257), n = r.dmax, p = r.wsize, i = r.whave, h = r.wnext, u = r.window, _ = r.hold, k = r.bits, A = r.lencode, S = r.distcode,
|
|
1990
|
+
var r, l, d, v, g, y, n, p, i, h, u, _, k, A, S, L, O, D, I, H, Y, b, R, e, F;
|
|
1991
|
+
r = o.state, l = o.next_in, e = o.input, d = l + (o.avail_in - 5), v = o.next_out, F = o.output, g = v - (a - o.avail_out), y = v + (o.avail_out - 257), n = r.dmax, p = r.wsize, i = r.whave, h = r.wnext, u = r.window, _ = r.hold, k = r.bits, A = r.lencode, S = r.distcode, L = (1 << r.lenbits) - 1, O = (1 << r.distbits) - 1;
|
|
1994
1992
|
t: do {
|
|
1995
|
-
k < 15 && (_ += e[l++] << k, k += 8, _ += e[l++] << k, k += 8), D = A[_ &
|
|
1993
|
+
k < 15 && (_ += e[l++] << k, k += 8, _ += e[l++] << k, k += 8), D = A[_ & L];
|
|
1996
1994
|
e: for (; ; ) {
|
|
1997
1995
|
if (_ >>>= I = D >>> 24, k -= I, (I = D >>> 16 & 255) === 0) F[v++] = 65535 & D;
|
|
1998
1996
|
else {
|
|
@@ -2018,36 +2016,36 @@ https://github.com/nodeca/pako/blob/main/LICENSE
|
|
|
2018
2016
|
o.msg = "invalid distance code", r.mode = 30;
|
|
2019
2017
|
break t;
|
|
2020
2018
|
}
|
|
2021
|
-
if (
|
|
2019
|
+
if (Y = 65535 & D, k < (I &= 15) && (_ += e[l++] << k, (k += 8) < I && (_ += e[l++] << k, k += 8)), n < (Y += _ & (1 << I) - 1)) {
|
|
2022
2020
|
o.msg = "invalid distance too far back", r.mode = 30;
|
|
2023
2021
|
break t;
|
|
2024
2022
|
}
|
|
2025
|
-
if (_ >>>= I, k -= I, (I = v - g) <
|
|
2026
|
-
if (i < (I =
|
|
2023
|
+
if (_ >>>= I, k -= I, (I = v - g) < Y) {
|
|
2024
|
+
if (i < (I = Y - I) && r.sane) {
|
|
2027
2025
|
o.msg = "invalid distance too far back", r.mode = 30;
|
|
2028
2026
|
break t;
|
|
2029
2027
|
}
|
|
2030
2028
|
if (R = u, (b = 0) === h) {
|
|
2031
2029
|
if (b += p - I, I < H) {
|
|
2032
2030
|
for (H -= I; F[v++] = u[b++], --I; ) ;
|
|
2033
|
-
b = v -
|
|
2031
|
+
b = v - Y, R = F;
|
|
2034
2032
|
}
|
|
2035
2033
|
} else if (h < I) {
|
|
2036
2034
|
if (b += p + h - I, (I -= h) < H) {
|
|
2037
2035
|
for (H -= I; F[v++] = u[b++], --I; ) ;
|
|
2038
2036
|
if (b = 0, h < H) {
|
|
2039
2037
|
for (H -= I = h; F[v++] = u[b++], --I; ) ;
|
|
2040
|
-
b = v -
|
|
2038
|
+
b = v - Y, R = F;
|
|
2041
2039
|
}
|
|
2042
2040
|
}
|
|
2043
2041
|
} else if (b += h - I, I < H) {
|
|
2044
2042
|
for (H -= I; F[v++] = u[b++], --I; ) ;
|
|
2045
|
-
b = v -
|
|
2043
|
+
b = v - Y, R = F;
|
|
2046
2044
|
}
|
|
2047
2045
|
for (; 2 < H; ) F[v++] = R[b++], F[v++] = R[b++], F[v++] = R[b++], H -= 3;
|
|
2048
2046
|
H && (F[v++] = R[b++], 1 < H && (F[v++] = R[b++]));
|
|
2049
2047
|
} else {
|
|
2050
|
-
for (b = v -
|
|
2048
|
+
for (b = v - Y; F[v++] = F[b++], F[v++] = F[b++], F[v++] = F[b++], 2 < (H -= 3); ) ;
|
|
2051
2049
|
H && (F[v++] = F[b++], 1 < H && (F[v++] = F[b++]));
|
|
2052
2050
|
}
|
|
2053
2051
|
break;
|
|
@@ -2078,7 +2076,7 @@ https://github.com/nodeca/pako/blob/main/LICENSE
|
|
|
2078
2076
|
var e, F;
|
|
2079
2077
|
return b && b.state ? (F = b.state, R < 0 ? (e = 0, R = -R) : (e = 1 + (R >> 4), R < 48 && (R &= 15)), R && (R < 8 || 15 < R) ? n : (F.window !== null && F.wbits !== R && (F.window = null), F.wrap = e, F.wbits = R, A(b))) : n;
|
|
2080
2078
|
}
|
|
2081
|
-
function
|
|
2079
|
+
function L(b, R) {
|
|
2082
2080
|
var e, F;
|
|
2083
2081
|
return b ? (F = new _(), (b.state = F).window = null, (e = S(b, R)) !== y && (b.state = null), e) : n;
|
|
2084
2082
|
}
|
|
@@ -2095,16 +2093,16 @@ https://github.com/nodeca/pako/blob/main/LICENSE
|
|
|
2095
2093
|
}
|
|
2096
2094
|
b.lencode = O, b.lenbits = 9, b.distcode = D, b.distbits = 5;
|
|
2097
2095
|
}
|
|
2098
|
-
function
|
|
2096
|
+
function Y(b, R, e, F) {
|
|
2099
2097
|
var Q, M = b.state;
|
|
2100
2098
|
return M.window === null && (M.wsize = 1 << M.wbits, M.wnext = 0, M.whave = 0, M.window = new o.Buf8(M.wsize)), F >= M.wsize ? (o.arraySet(M.window, R, e - M.wsize, M.wsize, 0), M.wnext = 0, M.whave = M.wsize) : (F < (Q = M.wsize - M.wnext) && (Q = F), o.arraySet(M.window, R, e - F, Q, M.wnext), (F -= Q) ? (o.arraySet(M.window, R, e - F, F, 0), M.wnext = F, M.whave = M.wsize) : (M.wnext += Q, M.wnext === M.wsize && (M.wnext = 0), M.whave < M.wsize && (M.whave += Q))), 0;
|
|
2101
2099
|
}
|
|
2102
2100
|
c.inflateReset = A, c.inflateReset2 = S, c.inflateResetKeep = k, c.inflateInit = function(b) {
|
|
2103
|
-
return
|
|
2104
|
-
}, c.inflateInit2 =
|
|
2105
|
-
var e, F, Q, M, et, U,
|
|
2101
|
+
return L(b, 15);
|
|
2102
|
+
}, c.inflateInit2 = L, c.inflate = function(b, R) {
|
|
2103
|
+
var e, F, Q, M, et, U, K, E, w, N, $, B, it, rt, tt, nt, st, ot, ft, ct, t, P, T, m, f = 0, x = new o.Buf8(4), W = [16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15];
|
|
2106
2104
|
if (!b || !b.state || !b.output || !b.input && b.avail_in !== 0) return n;
|
|
2107
|
-
(e = b.state).mode === 12 && (e.mode = 13), et = b.next_out, Q = b.output,
|
|
2105
|
+
(e = b.state).mode === 12 && (e.mode = 13), et = b.next_out, Q = b.output, K = b.avail_out, M = b.next_in, F = b.input, U = b.avail_in, E = e.hold, w = e.bits, N = U, $ = K, P = y;
|
|
2108
2106
|
t: for (; ; ) switch (e.mode) {
|
|
2109
2107
|
case p:
|
|
2110
2108
|
if (e.wrap === 0) {
|
|
@@ -2207,7 +2205,7 @@ https://github.com/nodeca/pako/blob/main/LICENSE
|
|
|
2207
2205
|
}
|
|
2208
2206
|
b.adler = e.check = u(E), w = E = 0, e.mode = 11;
|
|
2209
2207
|
case 11:
|
|
2210
|
-
if (e.havedict === 0) return b.next_out = et, b.avail_out =
|
|
2208
|
+
if (e.havedict === 0) return b.next_out = et, b.avail_out = K, b.next_in = M, b.avail_in = U, e.hold = E, e.bits = w, 2;
|
|
2211
2209
|
b.adler = e.check = 1, e.mode = 12;
|
|
2212
2210
|
case 12:
|
|
2213
2211
|
if (R === 5 || R === 6) break t;
|
|
@@ -2250,8 +2248,8 @@ https://github.com/nodeca/pako/blob/main/LICENSE
|
|
|
2250
2248
|
e.mode = 16;
|
|
2251
2249
|
case 16:
|
|
2252
2250
|
if (B = e.length) {
|
|
2253
|
-
if (U < B && (B = U),
|
|
2254
|
-
o.arraySet(Q, F, M, B, et), U -= B, M += B,
|
|
2251
|
+
if (U < B && (B = U), K < B && (B = K), B === 0) break t;
|
|
2252
|
+
o.arraySet(Q, F, M, B, et), U -= B, M += B, K -= B, et += B, e.length -= B;
|
|
2255
2253
|
break;
|
|
2256
2254
|
}
|
|
2257
2255
|
e.mode = 12;
|
|
@@ -2335,8 +2333,8 @@ https://github.com/nodeca/pako/blob/main/LICENSE
|
|
|
2335
2333
|
case 20:
|
|
2336
2334
|
e.mode = 21;
|
|
2337
2335
|
case 21:
|
|
2338
|
-
if (6 <= U && 258 <=
|
|
2339
|
-
b.next_out = et, b.avail_out =
|
|
2336
|
+
if (6 <= U && 258 <= K) {
|
|
2337
|
+
b.next_out = et, b.avail_out = K, b.next_in = M, b.avail_in = U, e.hold = E, e.bits = w, l(b, $), et = b.next_out, Q = b.output, K = b.avail_out, M = b.next_in, F = b.input, U = b.avail_in, E = e.hold, w = e.bits, e.mode === 12 && (e.back = -1);
|
|
2340
2338
|
break;
|
|
2341
2339
|
}
|
|
2342
2340
|
for (e.back = 0; nt = (f = e.lencode[E & (1 << e.lenbits) - 1]) >>> 16 & 255, st = 65535 & f, !((tt = f >>> 24) <= w); ) {
|
|
@@ -2403,20 +2401,20 @@ https://github.com/nodeca/pako/blob/main/LICENSE
|
|
|
2403
2401
|
}
|
|
2404
2402
|
e.mode = 25;
|
|
2405
2403
|
case 25:
|
|
2406
|
-
if (
|
|
2407
|
-
if (B = $ -
|
|
2404
|
+
if (K === 0) break t;
|
|
2405
|
+
if (B = $ - K, e.offset > B) {
|
|
2408
2406
|
if ((B = e.offset - B) > e.whave && e.sane) {
|
|
2409
2407
|
b.msg = "invalid distance too far back", e.mode = 30;
|
|
2410
2408
|
break;
|
|
2411
2409
|
}
|
|
2412
2410
|
it = B > e.wnext ? (B -= e.wnext, e.wsize - B) : e.wnext - B, B > e.length && (B = e.length), rt = e.window;
|
|
2413
2411
|
} else rt = Q, it = et - e.offset, B = e.length;
|
|
2414
|
-
for (
|
|
2412
|
+
for (K < B && (B = K), K -= B, e.length -= B; Q[et++] = rt[it++], --B; ) ;
|
|
2415
2413
|
e.length === 0 && (e.mode = 21);
|
|
2416
2414
|
break;
|
|
2417
2415
|
case 26:
|
|
2418
|
-
if (
|
|
2419
|
-
Q[et++] = e.length,
|
|
2416
|
+
if (K === 0) break t;
|
|
2417
|
+
Q[et++] = e.length, K--, e.mode = 21;
|
|
2420
2418
|
break;
|
|
2421
2419
|
case 27:
|
|
2422
2420
|
if (e.wrap) {
|
|
@@ -2424,7 +2422,7 @@ https://github.com/nodeca/pako/blob/main/LICENSE
|
|
|
2424
2422
|
if (U === 0) break t;
|
|
2425
2423
|
U--, E |= F[M++] << w, w += 8;
|
|
2426
2424
|
}
|
|
2427
|
-
if ($ -=
|
|
2425
|
+
if ($ -= K, b.total_out += $, e.total += $, $ && (b.adler = e.check = e.flags ? r(e.check, Q, $, et - $) : a(e.check, Q, $, et - $)), $ = K, (e.flags ? E : u(E)) !== e.check) {
|
|
2428
2426
|
b.msg = "incorrect data check", e.mode = 30;
|
|
2429
2427
|
break;
|
|
2430
2428
|
}
|
|
@@ -2456,7 +2454,7 @@ https://github.com/nodeca/pako/blob/main/LICENSE
|
|
|
2456
2454
|
default:
|
|
2457
2455
|
return n;
|
|
2458
2456
|
}
|
|
2459
|
-
return b.next_out = et, b.avail_out =
|
|
2457
|
+
return b.next_out = et, b.avail_out = K, b.next_in = M, b.avail_in = U, e.hold = E, e.bits = w, (e.wsize || $ !== b.avail_out && e.mode < 30 && (e.mode < 27 || R !== 4)) && Y(b, b.output, b.next_out, $ - b.avail_out) ? (e.mode = 31, -4) : (N -= b.avail_in, $ -= b.avail_out, b.total_in += N, b.total_out += $, e.total += $, e.wrap && $ && (b.adler = e.check = e.flags ? r(e.check, Q, $, b.next_out - $) : a(e.check, Q, $, b.next_out - $)), b.data_type = e.bits + (e.last ? 64 : 0) + (e.mode === 12 ? 128 : 0) + (e.mode === 20 || e.mode === 15 ? 256 : 0), (N == 0 && $ === 0 || R === 4) && P === y && (P = -5), P);
|
|
2460
2458
|
}, c.inflateEnd = function(b) {
|
|
2461
2459
|
if (!b || !b.state) return n;
|
|
2462
2460
|
var R = b.state;
|
|
@@ -2466,36 +2464,36 @@ https://github.com/nodeca/pako/blob/main/LICENSE
|
|
|
2466
2464
|
return b && b.state && 2 & (e = b.state).wrap ? ((e.head = R).done = !1, y) : n;
|
|
2467
2465
|
}, c.inflateSetDictionary = function(b, R) {
|
|
2468
2466
|
var e, F = R.length;
|
|
2469
|
-
return b && b.state ? (e = b.state).wrap !== 0 && e.mode !== 11 ? n : e.mode === 11 && a(1, R, F, 0) !== e.check ? -3 :
|
|
2467
|
+
return b && b.state ? (e = b.state).wrap !== 0 && e.mode !== 11 ? n : e.mode === 11 && a(1, R, F, 0) !== e.check ? -3 : Y(b, R, F, F) ? (e.mode = 31, -4) : (e.havedict = 1, y) : n;
|
|
2470
2468
|
}, c.inflateInfo = "pako inflate (from Nodeca project)";
|
|
2471
2469
|
}, { "../utils/common": 41, "./adler32": 43, "./crc32": 45, "./inffast": 48, "./inftrees": 50 }], 50: [function(s, C, c) {
|
|
2472
2470
|
var o = s("../utils/common"), a = [3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 15, 17, 19, 23, 27, 31, 35, 43, 51, 59, 67, 83, 99, 115, 131, 163, 195, 227, 258, 0, 0], r = [16, 16, 16, 16, 16, 16, 16, 16, 17, 17, 17, 17, 18, 18, 18, 18, 19, 19, 19, 19, 20, 20, 20, 20, 21, 21, 21, 21, 16, 72, 78], l = [1, 2, 3, 4, 5, 7, 9, 13, 17, 25, 33, 49, 65, 97, 129, 193, 257, 385, 513, 769, 1025, 1537, 2049, 3073, 4097, 6145, 8193, 12289, 16385, 24577, 0, 0], d = [16, 16, 16, 16, 17, 17, 18, 18, 19, 19, 20, 20, 21, 21, 22, 22, 23, 23, 24, 24, 25, 25, 26, 26, 27, 27, 28, 28, 29, 29, 64, 64];
|
|
2473
2471
|
C.exports = function(v, g, y, n, p, i, h, u) {
|
|
2474
|
-
var _, k, A, S,
|
|
2472
|
+
var _, k, A, S, L, O, D, I, H, Y = u.bits, b = 0, R = 0, e = 0, F = 0, Q = 0, M = 0, et = 0, U = 0, K = 0, E = 0, w = null, N = 0, $ = new o.Buf16(16), B = new o.Buf16(16), it = null, rt = 0;
|
|
2475
2473
|
for (b = 0; b <= 15; b++) $[b] = 0;
|
|
2476
2474
|
for (R = 0; R < n; R++) $[g[y + R]]++;
|
|
2477
|
-
for (Q =
|
|
2475
|
+
for (Q = Y, F = 15; 1 <= F && $[F] === 0; F--) ;
|
|
2478
2476
|
if (F < Q && (Q = F), F === 0) return p[i++] = 20971520, p[i++] = 20971520, u.bits = 1, 0;
|
|
2479
2477
|
for (e = 1; e < F && $[e] === 0; e++) ;
|
|
2480
2478
|
for (Q < e && (Q = e), b = U = 1; b <= 15; b++) if (U <<= 1, (U -= $[b]) < 0) return -1;
|
|
2481
2479
|
if (0 < U && (v === 0 || F !== 1)) return -1;
|
|
2482
2480
|
for (B[1] = 0, b = 1; b < 15; b++) B[b + 1] = B[b] + $[b];
|
|
2483
2481
|
for (R = 0; R < n; R++) g[y + R] !== 0 && (h[B[g[y + R]]++] = R);
|
|
2484
|
-
if (O = v === 0 ? (w = it = h, 19) : v === 1 ? (w = a, N -= 257, it = r, rt -= 257, 256) : (w = l, it = d, -1), b = e,
|
|
2482
|
+
if (O = v === 0 ? (w = it = h, 19) : v === 1 ? (w = a, N -= 257, it = r, rt -= 257, 256) : (w = l, it = d, -1), b = e, L = i, et = R = E = 0, A = -1, S = (K = 1 << (M = Q)) - 1, v === 1 && 852 < K || v === 2 && 592 < K) return 1;
|
|
2485
2483
|
for (; ; ) {
|
|
2486
|
-
for (D = b - et, H = h[R] < O ? (I = 0, h[R]) : h[R] > O ? (I = it[rt + h[R]], w[N + h[R]]) : (I = 96, 0), _ = 1 << b - et, e = k = 1 << M; p[
|
|
2484
|
+
for (D = b - et, H = h[R] < O ? (I = 0, h[R]) : h[R] > O ? (I = it[rt + h[R]], w[N + h[R]]) : (I = 96, 0), _ = 1 << b - et, e = k = 1 << M; p[L + (E >> et) + (k -= _)] = D << 24 | I << 16 | H | 0, k !== 0; ) ;
|
|
2487
2485
|
for (_ = 1 << b - 1; E & _; ) _ >>= 1;
|
|
2488
2486
|
if (_ !== 0 ? (E &= _ - 1, E += _) : E = 0, R++, --$[b] == 0) {
|
|
2489
2487
|
if (b === F) break;
|
|
2490
2488
|
b = g[y + h[R]];
|
|
2491
2489
|
}
|
|
2492
2490
|
if (Q < b && (E & S) !== A) {
|
|
2493
|
-
for (et === 0 && (et = Q),
|
|
2494
|
-
if (
|
|
2495
|
-
p[A = E & S] = Q << 24 | M << 16 |
|
|
2491
|
+
for (et === 0 && (et = Q), L += e, U = 1 << (M = b - et); M + et < F && !((U -= $[M + et]) <= 0); ) M++, U <<= 1;
|
|
2492
|
+
if (K += 1 << M, v === 1 && 852 < K || v === 2 && 592 < K) return 1;
|
|
2493
|
+
p[A = E & S] = Q << 24 | M << 16 | L - i | 0;
|
|
2496
2494
|
}
|
|
2497
2495
|
}
|
|
2498
|
-
return E !== 0 && (p[
|
|
2496
|
+
return E !== 0 && (p[L + E] = b - et << 24 | 64 << 16 | 0), u.bits = Q, 0;
|
|
2499
2497
|
};
|
|
2500
2498
|
}, { "../utils/common": 41 }], 51: [function(s, C, c) {
|
|
2501
2499
|
C.exports = { 2: "need dictionary", 1: "stream end", 0: "", "-1": "file error", "-2": "stream error", "-3": "data error", "-4": "insufficient memory", "-5": "buffer error", "-6": "incompatible version" };
|
|
@@ -2504,8 +2502,8 @@ https://github.com/nodeca/pako/blob/main/LICENSE
|
|
|
2504
2502
|
function l(f) {
|
|
2505
2503
|
for (var x = f.length; 0 <= --x; ) f[x] = 0;
|
|
2506
2504
|
}
|
|
2507
|
-
var d = 0, v = 29, g = 256, y = g + 1 + v, n = 30, p = 19, i = 2 * y + 1, h = 15, u = 16, _ = 7, k = 256, A = 16, S = 17,
|
|
2508
|
-
l(
|
|
2505
|
+
var d = 0, v = 29, g = 256, y = g + 1 + v, n = 30, p = 19, i = 2 * y + 1, h = 15, u = 16, _ = 7, k = 256, A = 16, S = 17, L = 18, O = [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], D = [0, 0, 0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7, 7, 8, 8, 9, 9, 10, 10, 11, 11, 12, 12, 13, 13], I = [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 3, 7], H = [16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15], Y = new Array(2 * (y + 2));
|
|
2506
|
+
l(Y);
|
|
2509
2507
|
var b = new Array(2 * n);
|
|
2510
2508
|
l(b);
|
|
2511
2509
|
var R = new Array(512);
|
|
@@ -2515,7 +2513,7 @@ https://github.com/nodeca/pako/blob/main/LICENSE
|
|
|
2515
2513
|
var F = new Array(v);
|
|
2516
2514
|
l(F);
|
|
2517
2515
|
var Q, M, et, U = new Array(n);
|
|
2518
|
-
function
|
|
2516
|
+
function K(f, x, W, Z, z) {
|
|
2519
2517
|
this.static_tree = f, this.extra_bits = x, this.extra_base = W, this.elems = Z, this.max_length = z, this.has_stree = f && f.length;
|
|
2520
2518
|
}
|
|
2521
2519
|
function E(f, x) {
|
|
@@ -2589,13 +2587,13 @@ https://github.com/nodeca/pako/blob/main/LICENSE
|
|
|
2589
2587
|
}
|
|
2590
2588
|
function t(f, x, W) {
|
|
2591
2589
|
var Z, z, V = -1, X = x[1], G = 0, J = 7, lt = 4;
|
|
2592
|
-
for (X === 0 && (J = 138, lt = 3), x[2 * (W + 1) + 1] = 65535, Z = 0; Z <= W; Z++) z = X, X = x[2 * (Z + 1) + 1], ++G < J && z === X || (G < lt ? f.bl_tree[2 * z] += G : z !== 0 ? (z !== V && f.bl_tree[2 * z]++, f.bl_tree[2 * A]++) : G <= 10 ? f.bl_tree[2 * S]++ : f.bl_tree[2 *
|
|
2590
|
+
for (X === 0 && (J = 138, lt = 3), x[2 * (W + 1) + 1] = 65535, Z = 0; Z <= W; Z++) z = X, X = x[2 * (Z + 1) + 1], ++G < J && z === X || (G < lt ? f.bl_tree[2 * z] += G : z !== 0 ? (z !== V && f.bl_tree[2 * z]++, f.bl_tree[2 * A]++) : G <= 10 ? f.bl_tree[2 * S]++ : f.bl_tree[2 * L]++, V = z, lt = (G = 0) === X ? (J = 138, 3) : z === X ? (J = 6, 3) : (J = 7, 4));
|
|
2593
2591
|
}
|
|
2594
2592
|
function P(f, x, W) {
|
|
2595
2593
|
var Z, z, V = -1, X = x[1], G = 0, J = 7, lt = 4;
|
|
2596
2594
|
for (X === 0 && (J = 138, lt = 3), Z = 0; Z <= W; Z++) if (z = X, X = x[2 * (Z + 1) + 1], !(++G < J && z === X)) {
|
|
2597
2595
|
if (G < lt) for (; B(f, z, f.bl_tree), --G != 0; ) ;
|
|
2598
|
-
else z !== 0 ? (z !== V && (B(f, z, f.bl_tree), G--), B(f, A, f.bl_tree), $(f, G - 3, 2)) : G <= 10 ? (B(f, S, f.bl_tree), $(f, G - 3, 3)) : (B(f,
|
|
2596
|
+
else z !== 0 ? (z !== V && (B(f, z, f.bl_tree), G--), B(f, A, f.bl_tree), $(f, G - 3, 2)) : G <= 10 ? (B(f, S, f.bl_tree), $(f, G - 3, 3)) : (B(f, L, f.bl_tree), $(f, G - 11, 7));
|
|
2599
2597
|
V = z, lt = (G = 0) === X ? (J = 138, 3) : z === X ? (J = 6, 3) : (J = 7, 4);
|
|
2600
2598
|
}
|
|
2601
2599
|
}
|
|
@@ -2613,12 +2611,12 @@ https://github.com/nodeca/pako/blob/main/LICENSE
|
|
|
2613
2611
|
for (e[Z - 1] = z, z = V = 0; z < 16; z++) for (U[z] = V, x = 0; x < 1 << D[z]; x++) R[V++] = z;
|
|
2614
2612
|
for (V >>= 7; z < n; z++) for (U[z] = V << 7, x = 0; x < 1 << D[z] - 7; x++) R[256 + V++] = z;
|
|
2615
2613
|
for (W = 0; W <= h; W++) X[W] = 0;
|
|
2616
|
-
for (x = 0; x <= 143; )
|
|
2617
|
-
for (; x <= 255; )
|
|
2618
|
-
for (; x <= 279; )
|
|
2619
|
-
for (; x <= 287; )
|
|
2620
|
-
for (rt(
|
|
2621
|
-
Q = new Y
|
|
2614
|
+
for (x = 0; x <= 143; ) Y[2 * x + 1] = 8, x++, X[8]++;
|
|
2615
|
+
for (; x <= 255; ) Y[2 * x + 1] = 9, x++, X[9]++;
|
|
2616
|
+
for (; x <= 279; ) Y[2 * x + 1] = 7, x++, X[7]++;
|
|
2617
|
+
for (; x <= 287; ) Y[2 * x + 1] = 8, x++, X[8]++;
|
|
2618
|
+
for (rt(Y, y + 1, X), x = 0; x < n; x++) b[2 * x + 1] = 5, b[2 * x] = it(x, 5);
|
|
2619
|
+
Q = new K(Y, O, g + 1, y, h), M = new K(b, D, 0, n, h), et = new K(new Array(0), I, 0, p, _);
|
|
2622
2620
|
}(), T = !0), f.l_desc = new E(f.dyn_ltree, Q), f.d_desc = new E(f.dyn_dtree, M), f.bl_desc = new E(f.bl_tree, et), f.bi_buf = 0, f.bi_valid = 0, tt(f);
|
|
2623
2621
|
}, c._tr_stored_block = m, c._tr_flush_block = function(f, x, W, Z) {
|
|
2624
2622
|
var z, V, X = 0;
|
|
@@ -2632,7 +2630,7 @@ https://github.com/nodeca/pako/blob/main/LICENSE
|
|
|
2632
2630
|
var J;
|
|
2633
2631
|
for (t(G, G.dyn_ltree, G.l_desc.max_code), t(G, G.dyn_dtree, G.d_desc.max_code), ct(G, G.bl_desc), J = p - 1; 3 <= J && G.bl_tree[2 * H[J] + 1] === 0; J--) ;
|
|
2634
2632
|
return G.opt_len += 3 * (J + 1) + 5 + 5 + 4, J;
|
|
2635
|
-
}(f), z = f.opt_len + 3 + 7 >>> 3, (V = f.static_len + 3 + 7 >>> 3) <= z && (z = V)) : z = V = W + 5, W + 4 <= z && x !== -1 ? m(f, x, W, Z) : f.strategy === 4 || V === z ? ($(f, 2 + (Z ? 1 : 0), 3), ft(f,
|
|
2633
|
+
}(f), z = f.opt_len + 3 + 7 >>> 3, (V = f.static_len + 3 + 7 >>> 3) <= z && (z = V)) : z = V = W + 5, W + 4 <= z && x !== -1 ? m(f, x, W, Z) : f.strategy === 4 || V === z ? ($(f, 2 + (Z ? 1 : 0), 3), ft(f, Y, b)) : ($(f, 4 + (Z ? 1 : 0), 3), function(G, J, lt, at) {
|
|
2636
2634
|
var ht;
|
|
2637
2635
|
for ($(G, J - 257, 5), $(G, lt - 1, 5), $(G, at - 4, 4), ht = 0; ht < at; ht++) $(G, G.bl_tree[2 * H[ht] + 1], 3);
|
|
2638
2636
|
P(G, G.dyn_ltree, J - 1), P(G, G.dyn_dtree, lt - 1);
|
|
@@ -2640,7 +2638,7 @@ https://github.com/nodeca/pako/blob/main/LICENSE
|
|
|
2640
2638
|
}, c._tr_tally = function(f, x, W) {
|
|
2641
2639
|
return f.pending_buf[f.d_buf + 2 * f.last_lit] = x >>> 8 & 255, f.pending_buf[f.d_buf + 2 * f.last_lit + 1] = 255 & x, f.pending_buf[f.l_buf + f.last_lit] = 255 & W, f.last_lit++, x === 0 ? f.dyn_ltree[2 * W]++ : (f.matches++, x--, f.dyn_ltree[2 * (e[W] + g + 1)]++, f.dyn_dtree[2 * w(x)]++), f.last_lit === f.lit_bufsize - 1;
|
|
2642
2640
|
}, c._tr_align = function(f) {
|
|
2643
|
-
$(f, 2, 3), B(f, k,
|
|
2641
|
+
$(f, 2, 3), B(f, k, Y), function(x) {
|
|
2644
2642
|
x.bi_valid === 16 ? (N(x, x.bi_buf), x.bi_buf = 0, x.bi_valid = 0) : 8 <= x.bi_valid && (x.pending_buf[x.pending++] = 255 & x.bi_buf, x.bi_buf >>= 8, x.bi_valid -= 8);
|
|
2645
2643
|
}(f);
|
|
2646
2644
|
};
|
|
@@ -2679,7 +2677,7 @@ https://github.com/nodeca/pako/blob/main/LICENSE
|
|
|
2679
2677
|
setTimeout(_, 0, A);
|
|
2680
2678
|
}, h.setImmediate = function(A) {
|
|
2681
2679
|
typeof A != "function" && (A = new Function("" + A));
|
|
2682
|
-
for (var S = new Array(arguments.length - 1),
|
|
2680
|
+
for (var S = new Array(arguments.length - 1), L = 0; L < S.length; L++) S[L] = arguments[L + 1];
|
|
2683
2681
|
var O = { callback: A, args: S };
|
|
2684
2682
|
return n[y] = O, l(y), y++;
|
|
2685
2683
|
}, h.clearImmediate = u;
|
|
@@ -2694,8 +2692,8 @@ https://github.com/nodeca/pako/blob/main/LICENSE
|
|
|
2694
2692
|
if (S) {
|
|
2695
2693
|
p = !0;
|
|
2696
2694
|
try {
|
|
2697
|
-
(function(
|
|
2698
|
-
var O =
|
|
2695
|
+
(function(L) {
|
|
2696
|
+
var O = L.callback, D = L.args;
|
|
2699
2697
|
switch (D.length) {
|
|
2700
2698
|
case 0:
|
|
2701
2699
|
O();
|
|
@@ -2727,53 +2725,53 @@ https://github.com/nodeca/pako/blob/main/LICENSE
|
|
|
2727
2725
|
}, {}] }, {}, [10])(10);
|
|
2728
2726
|
});
|
|
2729
2727
|
})(Ot);
|
|
2730
|
-
var
|
|
2731
|
-
const
|
|
2732
|
-
function Xt(
|
|
2733
|
-
let
|
|
2728
|
+
var Kt = Ot.exports;
|
|
2729
|
+
const qt = /* @__PURE__ */ jt(Kt);
|
|
2730
|
+
function Xt(j) {
|
|
2731
|
+
let q = "";
|
|
2734
2732
|
const s = [];
|
|
2735
|
-
if (
|
|
2736
|
-
const c = Et(
|
|
2733
|
+
if (j.bold && s.push("<b/>"), j.italic && s.push("<i/>"), j.underline && s.push("<u/>"), j.strikethrough && s.push("<strike/>"), j.textColor && j.textColor.toLowerCase() !== "#000000") {
|
|
2734
|
+
const c = Et(j.textColor);
|
|
2737
2735
|
c && s.push(`<color rgb="${c}"/>`);
|
|
2738
2736
|
}
|
|
2739
|
-
s.length > 0 && (
|
|
2740
|
-
const C =
|
|
2737
|
+
s.length > 0 && (q += `<font>${s.join("")}</font>`);
|
|
2738
|
+
const C = j.cellColor;
|
|
2741
2739
|
if (C && C.toLowerCase() !== "#ffffff") {
|
|
2742
2740
|
const c = Et(C);
|
|
2743
|
-
c && (
|
|
2741
|
+
c && (q += `<fill><patternFill patternType="solid"><fgColor rgb="${c}"/></patternFill></fill>`);
|
|
2744
2742
|
}
|
|
2745
|
-
return `<dxf>${
|
|
2743
|
+
return `<dxf>${q}</dxf>`;
|
|
2746
2744
|
}
|
|
2747
|
-
function Jt(
|
|
2748
|
-
const s =
|
|
2745
|
+
function Jt(j, q) {
|
|
2746
|
+
const s = j.match(/<dxfs count="(\d+)"/);
|
|
2749
2747
|
if (s) {
|
|
2750
2748
|
const C = parseInt(s[1], 10);
|
|
2751
2749
|
return {
|
|
2752
|
-
xml:
|
|
2750
|
+
xml: j.replace(/<dxfs count="\d+"/, `<dxfs count="${C + 1}"`).replace("</dxfs>", q + "</dxfs>"),
|
|
2753
2751
|
dxfId: C
|
|
2754
2752
|
};
|
|
2755
2753
|
}
|
|
2756
|
-
return
|
|
2757
|
-
xml:
|
|
2754
|
+
return j.includes("<dxfs/>") ? {
|
|
2755
|
+
xml: j.replace("<dxfs/>", `<dxfs count="1">${q}</dxfs>`),
|
|
2758
2756
|
dxfId: 0
|
|
2759
2757
|
} : {
|
|
2760
|
-
xml:
|
|
2758
|
+
xml: j.replace(
|
|
2761
2759
|
"</styleSheet>",
|
|
2762
|
-
`<dxfs count="1">${
|
|
2760
|
+
`<dxfs count="1">${q}</dxfs></styleSheet>`
|
|
2763
2761
|
),
|
|
2764
2762
|
dxfId: 0
|
|
2765
2763
|
};
|
|
2766
2764
|
}
|
|
2767
|
-
function Qt(
|
|
2768
|
-
return
|
|
2765
|
+
function Qt(j) {
|
|
2766
|
+
return j.replace(/[.*+?^${}()|[\]\\]/g, "\\$&");
|
|
2769
2767
|
}
|
|
2770
|
-
function te(
|
|
2768
|
+
function te(j, q, s) {
|
|
2771
2769
|
const C = new RegExp(
|
|
2772
|
-
`(<conditionalFormatting[^>]*\\bsqref="${Qt(
|
|
2770
|
+
`(<conditionalFormatting[^>]*\\bsqref="${Qt(q)}"[^>]*>)`
|
|
2773
2771
|
);
|
|
2774
|
-
if (C.test(
|
|
2775
|
-
return
|
|
2776
|
-
const c = `<conditionalFormatting sqref="${
|
|
2772
|
+
if (C.test(j))
|
|
2773
|
+
return j.replace(C, `$1${s}`);
|
|
2774
|
+
const c = `<conditionalFormatting sqref="${q}">${s}</conditionalFormatting>`;
|
|
2777
2775
|
for (const o of [
|
|
2778
2776
|
"<pageMargins",
|
|
2779
2777
|
"<pageSetup",
|
|
@@ -2781,27 +2779,27 @@ function te(L, K, s) {
|
|
|
2781
2779
|
"<drawing",
|
|
2782
2780
|
"</worksheet>"
|
|
2783
2781
|
])
|
|
2784
|
-
if (
|
|
2785
|
-
return
|
|
2786
|
-
return
|
|
2782
|
+
if (j.includes(o))
|
|
2783
|
+
return j.replace(o, c + o);
|
|
2784
|
+
return j + c;
|
|
2787
2785
|
}
|
|
2788
|
-
function ee(
|
|
2789
|
-
return
|
|
2786
|
+
function ee(j) {
|
|
2787
|
+
return j.replace(
|
|
2790
2788
|
/<cfRule([^>]*)type="containsText"([^>]*?)>([\s\S]*?)<\/cfRule>/g,
|
|
2791
|
-
(
|
|
2792
|
-
if (/\btext=/.test(s) || /\btext=/.test(C)) return
|
|
2789
|
+
(q, s, C, c) => {
|
|
2790
|
+
if (/\btext=/.test(s) || /\btext=/.test(C)) return q;
|
|
2793
2791
|
const o = c.match(/<formula[^>]*>([\s\S]*?)<\/formula>/);
|
|
2794
|
-
if (!o) return
|
|
2792
|
+
if (!o) return q;
|
|
2795
2793
|
const r = o[1].replace(/"/g, '"').replace(/&/g, "&").replace(/</g, "<").replace(/>/g, ">").match(/SEARCH\s*\(\s*"([^"]*)"/i);
|
|
2796
|
-
if (!r) return
|
|
2794
|
+
if (!r) return q;
|
|
2797
2795
|
const l = r[1].replace(/&/g, "&").replace(/"/g, """).replace(/</g, "<").replace(/>/g, ">");
|
|
2798
2796
|
return `<cfRule${s}type="containsText"${C} text="${l}">${c}</cfRule>`;
|
|
2799
2797
|
}
|
|
2800
2798
|
);
|
|
2801
2799
|
}
|
|
2802
|
-
async function re(
|
|
2800
|
+
async function re(j, q) {
|
|
2803
2801
|
var a;
|
|
2804
|
-
const s = await
|
|
2802
|
+
const s = await qt.loadAsync(j), C = s.file("xl/styles.xml");
|
|
2805
2803
|
let c = C ? await C.async("text") : "", o = !1;
|
|
2806
2804
|
for (const [r, l] of Object.entries(s.files)) {
|
|
2807
2805
|
if (l.dir) continue;
|
|
@@ -2811,7 +2809,7 @@ async function re(L, K) {
|
|
|
2811
2809
|
let g = await l.async("text"), y = !1;
|
|
2812
2810
|
const n = ee(g);
|
|
2813
2811
|
n !== g && (g = n, y = !0);
|
|
2814
|
-
const p = ((a =
|
|
2812
|
+
const p = ((a = q[v]) == null ? void 0 : a.duplicateValues) ?? [];
|
|
2815
2813
|
for (const i of p) {
|
|
2816
2814
|
const h = Xt(i.format), { xml: u, dxfId: _ } = Jt(c, h);
|
|
2817
2815
|
c = u, o = !0;
|
|
@@ -2822,90 +2820,90 @@ async function re(L, K) {
|
|
|
2822
2820
|
}
|
|
2823
2821
|
return o && C && s.file("xl/styles.xml", c), s.generateAsync({ type: "arraybuffer", compression: "DEFLATE" });
|
|
2824
2822
|
}
|
|
2825
|
-
const ne = (
|
|
2826
|
-
if (!
|
|
2827
|
-
const
|
|
2828
|
-
if (
|
|
2829
|
-
const c =
|
|
2823
|
+
const ne = (j) => {
|
|
2824
|
+
if (!j || typeof j != "string") return null;
|
|
2825
|
+
const q = j.trim().toLowerCase();
|
|
2826
|
+
if (q.startsWith("#")) {
|
|
2827
|
+
const c = q.replace("#", "").toUpperCase();
|
|
2830
2828
|
return c.length === 3 ? c.split("").map((o) => o + o).join("").toUpperCase() : c.length === 6 ? c : null;
|
|
2831
2829
|
}
|
|
2832
|
-
const s = /rgba?\s*\(\s*([\d.]+)[,\s]+([\d.]+)[,\s]+([\d.]+)(?:[,\s/]+[\d.]+)?\s*\)/i, C =
|
|
2830
|
+
const s = /rgba?\s*\(\s*([\d.]+)[,\s]+([\d.]+)[,\s]+([\d.]+)(?:[,\s/]+[\d.]+)?\s*\)/i, C = q.match(s);
|
|
2833
2831
|
if (C) {
|
|
2834
2832
|
const c = Math.min(255, Math.max(0, parseFloat(C[1]))), o = Math.min(255, Math.max(0, parseFloat(C[2]))), a = Math.min(255, Math.max(0, parseFloat(C[3])));
|
|
2835
2833
|
return ((1 << 24) + (c << 16) + (o << 8) + a).toString(16).slice(1).toUpperCase();
|
|
2836
2834
|
}
|
|
2837
2835
|
return null;
|
|
2838
2836
|
};
|
|
2839
|
-
function ie(
|
|
2840
|
-
const
|
|
2841
|
-
if (
|
|
2842
|
-
const s = ne(
|
|
2843
|
-
s && (
|
|
2837
|
+
function ie(j) {
|
|
2838
|
+
const q = {};
|
|
2839
|
+
if (j.bl === 1 && (q.bold = !0), j.it === 1 && (q.italic = !0), j.un === 1 && (q.underline = !0), j.cl === 1 && (q.strike = !0), j.fs && (q.size = Number(j.fs)), typeof j.ff == "string" && j.ff && (q.name = j.ff), j.fc) {
|
|
2840
|
+
const s = ne(j.fc);
|
|
2841
|
+
s && (q.color = { argb: `FF${s}` });
|
|
2844
2842
|
}
|
|
2845
|
-
return Object.keys(
|
|
2843
|
+
return Object.keys(q).length > 0 ? q : void 0;
|
|
2846
2844
|
}
|
|
2847
|
-
function Rt(
|
|
2848
|
-
if (!Array.isArray(
|
|
2849
|
-
const
|
|
2850
|
-
for (const s of
|
|
2845
|
+
function Rt(j) {
|
|
2846
|
+
if (!Array.isArray(j) || j.length === 0) return null;
|
|
2847
|
+
const q = [];
|
|
2848
|
+
for (const s of j) {
|
|
2851
2849
|
const C = String(s.v ?? "");
|
|
2852
2850
|
if (C === "" && !s.bl && !s.it && !s.un && !s.cl) continue;
|
|
2853
2851
|
const c = ie(s), o = { text: C };
|
|
2854
|
-
c && (o.font = c),
|
|
2852
|
+
c && (o.font = c), q.push(o);
|
|
2855
2853
|
}
|
|
2856
|
-
return
|
|
2854
|
+
return q.length === 0 || !q.some((s) => s.text !== "") ? null : { richText: q };
|
|
2857
2855
|
}
|
|
2858
|
-
function ae(
|
|
2859
|
-
|
|
2860
|
-
const c =
|
|
2856
|
+
function ae(j, q) {
|
|
2857
|
+
q.forEach((s, C) => {
|
|
2858
|
+
const c = j.getCell(C);
|
|
2861
2859
|
c.value = s;
|
|
2862
2860
|
});
|
|
2863
2861
|
}
|
|
2864
|
-
function se(
|
|
2865
|
-
const
|
|
2862
|
+
function se(j) {
|
|
2863
|
+
const q = j == null ? void 0 : j.filter, s = j == null ? void 0 : j.filter_select, C = !!(q && Object.keys(q).length > 0), c = !!s && (Array.isArray(s.row) || Array.isArray(s.column));
|
|
2866
2864
|
return C || c;
|
|
2867
2865
|
}
|
|
2868
|
-
const St = (
|
|
2869
|
-
if (!
|
|
2870
|
-
const
|
|
2871
|
-
if (
|
|
2872
|
-
const c =
|
|
2866
|
+
const St = (j) => {
|
|
2867
|
+
if (!j || typeof j != "string") return null;
|
|
2868
|
+
const q = j.trim().toLowerCase();
|
|
2869
|
+
if (q.startsWith("#")) {
|
|
2870
|
+
const c = q.replace("#", "").toUpperCase();
|
|
2873
2871
|
return c.length === 3 ? c.split("").map((o) => o + o).join("").toUpperCase() : c.length === 6 ? c : null;
|
|
2874
2872
|
}
|
|
2875
|
-
const s = /rgba?\s*\(\s*([\d.]+)[,\s]+([\d.]+)[,\s]+([\d.]+)(?:[,\s/]+[\d.]+)?\s*\)/i, C =
|
|
2873
|
+
const s = /rgba?\s*\(\s*([\d.]+)[,\s]+([\d.]+)[,\s]+([\d.]+)(?:[,\s/]+[\d.]+)?\s*\)/i, C = q.match(s);
|
|
2876
2874
|
if (C) {
|
|
2877
2875
|
const c = Math.min(255, Math.max(0, parseFloat(C[1]))), o = Math.min(255, Math.max(0, parseFloat(C[2]))), a = Math.min(255, Math.max(0, parseFloat(C[3])));
|
|
2878
2876
|
return ((1 << 24) + (c << 16) + (o << 8) + a).toString(16).slice(1).toUpperCase();
|
|
2879
2877
|
}
|
|
2880
2878
|
return null;
|
|
2881
|
-
},
|
|
2879
|
+
}, pe = async (j, q, s, C) => {
|
|
2882
2880
|
var c, o, a, r;
|
|
2883
|
-
if (!(!
|
|
2881
|
+
if (!(!j.current || !q.current))
|
|
2884
2882
|
try {
|
|
2885
|
-
const l = (o = (c =
|
|
2883
|
+
const l = (o = (c = j.current).getWorkbookContext) == null ? void 0 : o.call(c), d = l == null ? void 0 : l.luckysheetfile;
|
|
2886
2884
|
Array.isArray(d) && d.some(se) && Ut({
|
|
2887
2885
|
title: "Filters are not supported in Export",
|
|
2888
2886
|
variant: "warning",
|
|
2889
2887
|
showCloseButton: !0,
|
|
2890
2888
|
duration: 30 * 1e3
|
|
2891
|
-
}),
|
|
2892
|
-
const g =
|
|
2889
|
+
}), q.current.getArray(s);
|
|
2890
|
+
const g = j.current.getAllSheets(), y = dt.book_new(), n = g.map(() => /* @__PURE__ */ new Map());
|
|
2893
2891
|
g.forEach((D, I) => {
|
|
2894
2892
|
var e, F, Q, M, et, U;
|
|
2895
|
-
const H = ((e = g[I]) == null ? void 0 : e.data) || [],
|
|
2896
|
-
Object.keys(
|
|
2897
|
-
if (
|
|
2898
|
-
const E =
|
|
2899
|
-
E && (E.t === "s" || E.t === void 0) && E.v !== "" && !isNaN(Number(E.v)) && (
|
|
2900
|
-
}),
|
|
2901
|
-
|
|
2902
|
-
s: { r:
|
|
2903
|
-
e: { r:
|
|
2893
|
+
const H = ((e = g[I]) == null ? void 0 : e.data) || [], Y = dt.aoa_to_sheet(H);
|
|
2894
|
+
Object.keys(Y).forEach((K) => {
|
|
2895
|
+
if (K.startsWith("!")) return;
|
|
2896
|
+
const E = Y[K];
|
|
2897
|
+
E && (E.t === "s" || E.t === void 0) && E.v !== "" && !isNaN(Number(E.v)) && (Y[K] = { ...E, v: Number(E.v), t: "n" });
|
|
2898
|
+
}), Y["!merges"] = [], (F = D.config) != null && F.merge && Object.values(D.config.merge).forEach((K) => {
|
|
2899
|
+
Y["!merges"].push({
|
|
2900
|
+
s: { r: K.r, c: K.c },
|
|
2901
|
+
e: { r: K.r + K.rs - 1, c: K.c + K.cs - 1 }
|
|
2904
2902
|
});
|
|
2905
2903
|
});
|
|
2906
2904
|
{
|
|
2907
2905
|
const E = Math.round(3437.714285714286) / 256, w = D.column || 36;
|
|
2908
|
-
|
|
2906
|
+
Y["!cols"] = [];
|
|
2909
2907
|
for (let N = 0; N < w; N++) {
|
|
2910
2908
|
const $ = (M = (Q = D.config) == null ? void 0 : Q.columnlen) == null ? void 0 : M[N];
|
|
2911
2909
|
if ($ !== void 0) {
|
|
@@ -2913,26 +2911,26 @@ const St = (L) => {
|
|
|
2913
2911
|
0,
|
|
2914
2912
|
Math.round((Number($) - 5) / 7 * 256) / 256
|
|
2915
2913
|
);
|
|
2916
|
-
|
|
2914
|
+
Y["!cols"][N] = { wch: B };
|
|
2917
2915
|
} else
|
|
2918
|
-
|
|
2916
|
+
Y["!cols"][N] = { wch: E };
|
|
2919
2917
|
}
|
|
2920
2918
|
}
|
|
2921
2919
|
{
|
|
2922
|
-
const
|
|
2923
|
-
|
|
2924
|
-
...
|
|
2925
|
-
defaultRowHeight: String(
|
|
2926
|
-
}, (et = D.config) != null && et.rowlen && (
|
|
2920
|
+
const K = Math.round(60.48) / 4;
|
|
2921
|
+
Y.sheetFormat = {
|
|
2922
|
+
...Y.sheetFormat || {},
|
|
2923
|
+
defaultRowHeight: String(K)
|
|
2924
|
+
}, (et = D.config) != null && et.rowlen && (Y["!rows"] = [], Object.entries(D.config.rowlen).forEach(([E, w]) => {
|
|
2927
2925
|
const N = Math.round(Number(w) * 0.72 * 4) / 4;
|
|
2928
|
-
|
|
2926
|
+
Y["!rows"][Number(E)] = { hpt: N };
|
|
2929
2927
|
}));
|
|
2930
2928
|
}
|
|
2931
2929
|
const b = /* @__PURE__ */ new Set();
|
|
2932
|
-
(D.celldata ?? []).forEach((
|
|
2930
|
+
(D.celldata ?? []).forEach((K) => {
|
|
2933
2931
|
var tt, nt, st, ot, ft;
|
|
2934
|
-
const E =
|
|
2935
|
-
let B =
|
|
2932
|
+
const E = K.r, w = K.c, N = K.v || {}, $ = dt.encode_cell({ r: E, c: w });
|
|
2933
|
+
let B = Y[$] || {};
|
|
2936
2934
|
if (B = { ...B }, N.f && (B.f = N.f.replace(/^=/, "")), !N.f && ((tt = N.ct) == null ? void 0 : tt.t) === "inlineStr" && Array.isArray(N.ct.s) ? (B.v = zt(N.ct.s), B.t = "s") : B.v = N.v ?? ((ot = (st = (nt = N == null ? void 0 : N.ct) == null ? void 0 : nt.s) == null ? void 0 : st[0]) == null ? void 0 : ot.v), N.m && (B.w = N.m), !N.f && ((ft = N.ct) == null ? void 0 : ft.t) === "inlineStr" && Array.isArray(N.ct.s)) {
|
|
2937
2935
|
const ct = Rt(N.ct.s);
|
|
2938
2936
|
ct && n[I].set($, ct);
|
|
@@ -2962,15 +2960,15 @@ const St = (L) => {
|
|
|
2962
2960
|
...B.s.alignment || {},
|
|
2963
2961
|
wrapText: N.tb === "1" || N.tb === "2" ? !0 : void 0,
|
|
2964
2962
|
textRotation: N.tr !== void 0 ? N.tr : void 0
|
|
2965
|
-
}, B.s.alignment.horizontal = it[N.ht] || void 0, B.s.alignment.vertical = rt[N.vt] || void 0, N.tb !== void 0 && (B.s.alignment = B.s.alignment || {}, N.tb === "1" ? B.s.alignment.wrapText = !0 : N.tb === "2" && (B.s.alignment.shrinkToFit = !0)), b.add($),
|
|
2966
|
-
}), (D.data ?? []).forEach((
|
|
2967
|
-
Array.isArray(
|
|
2963
|
+
}, B.s.alignment.horizontal = it[N.ht] || void 0, B.s.alignment.vertical = rt[N.vt] || void 0, N.tb !== void 0 && (B.s.alignment = B.s.alignment || {}, N.tb === "1" ? B.s.alignment.wrapText = !0 : N.tb === "2" && (B.s.alignment.shrinkToFit = !0)), b.add($), Y[$] = B;
|
|
2964
|
+
}), (D.data ?? []).forEach((K, E) => {
|
|
2965
|
+
Array.isArray(K) && K.forEach((w, N) => {
|
|
2968
2966
|
if (!w || typeof w != "object") return;
|
|
2969
2967
|
const $ = dt.encode_cell({ r: E, c: N });
|
|
2970
2968
|
if (b.has($)) return;
|
|
2971
2969
|
const B = !!w.f, it = w.bg || w.bl || w.it || w.cl || w.un || w.fs || w.ff || w.fc || w.ht !== void 0 || w.vt !== void 0 || w.tb !== void 0 || w.tr !== void 0;
|
|
2972
2970
|
if (!B && !it) return;
|
|
2973
|
-
const rt = { ...
|
|
2971
|
+
const rt = { ...Y[$] || {} };
|
|
2974
2972
|
if (rt.s = rt.s || {}, B && (rt.f = w.f.replace(/^=/, "")), w.bg) {
|
|
2975
2973
|
const st = St(w.bg);
|
|
2976
2974
|
st && (rt.s.fill = { patternType: "solid", fgColor: { rgb: st } });
|
|
@@ -2994,24 +2992,24 @@ const St = (L) => {
|
|
|
2994
2992
|
horizontal: tt[w.ht] || void 0,
|
|
2995
2993
|
vertical: nt[w.vt] || void 0,
|
|
2996
2994
|
textRotation: w.tr !== void 0 ? w.tr : void 0
|
|
2997
|
-
}, w.tb === "1" ? rt.s.alignment.wrapText = !0 : w.tb === "2" && (rt.s.alignment.shrinkToFit = !0),
|
|
2995
|
+
}, w.tb === "1" ? rt.s.alignment.wrapText = !0 : w.tb === "2" && (rt.s.alignment.shrinkToFit = !0), Y[$] = rt;
|
|
2998
2996
|
});
|
|
2999
|
-
}), (D.data ?? []).forEach((
|
|
3000
|
-
Array.isArray(
|
|
2997
|
+
}), (D.data ?? []).forEach((K, E) => {
|
|
2998
|
+
Array.isArray(K) && K.forEach((w, N) => {
|
|
3001
2999
|
var rt;
|
|
3002
3000
|
if (!w || ((rt = w.ct) == null ? void 0 : rt.t) !== "inlineStr" || !Array.isArray(w.ct.s)) return;
|
|
3003
3001
|
const $ = dt.encode_cell({ r: E, c: N }), B = zt(w.ct.s);
|
|
3004
|
-
|
|
3005
|
-
...
|
|
3002
|
+
Y[$] = {
|
|
3003
|
+
...Y[$] || {},
|
|
3006
3004
|
v: B,
|
|
3007
3005
|
t: "s"
|
|
3008
3006
|
};
|
|
3009
3007
|
const it = Rt(w.ct.s);
|
|
3010
3008
|
it && n[I].set($, it);
|
|
3011
3009
|
});
|
|
3012
|
-
}), (U = D.config) != null && U.borderInfo && $t(
|
|
3010
|
+
}), (U = D.config) != null && U.borderInfo && $t(Y, D.config.borderInfo);
|
|
3013
3011
|
const R = D.name.length > 30 ? D.name.slice(0, 30) : D.name;
|
|
3014
|
-
dt.book_append_sheet(y,
|
|
3012
|
+
dt.book_append_sheet(y, Y, R);
|
|
3015
3013
|
});
|
|
3016
3014
|
const p = await (C == null ? void 0 : C(s)) || "Untitled", i = Nt(y, {
|
|
3017
3015
|
bookType: "xlsx",
|
|
@@ -3028,14 +3026,14 @@ const St = (L) => {
|
|
|
3028
3026
|
const H = h.worksheets[I];
|
|
3029
3027
|
if (!H) return;
|
|
3030
3028
|
ae(H, n[I]);
|
|
3031
|
-
const
|
|
3029
|
+
const Y = D.data;
|
|
3032
3030
|
Object.entries(D.hyperlink || {}).forEach(([M, et]) => {
|
|
3033
3031
|
var rt, tt, nt, st;
|
|
3034
3032
|
const U = Wt(et);
|
|
3035
3033
|
if (!(U != null && U.linkAddress)) return;
|
|
3036
|
-
const [
|
|
3037
|
-
if (Number.isNaN(
|
|
3038
|
-
const w = dt.encode_cell({ r:
|
|
3034
|
+
const [K, E] = M.split("_").map(Number);
|
|
3035
|
+
if (Number.isNaN(K) || Number.isNaN(E)) return;
|
|
3036
|
+
const w = dt.encode_cell({ r: K, c: E }), N = H.getCell(w), $ = (rt = Y == null ? void 0 : Y[K]) == null ? void 0 : rt[E];
|
|
3039
3037
|
let B = "";
|
|
3040
3038
|
$ && typeof $ == "object" && ((tt = $.ct) == null ? void 0 : tt.t) === "inlineStr" && Array.isArray($.ct.s) && (B = zt($.ct.s));
|
|
3041
3039
|
const it = B || (typeof N.text == "string" && N.text.length > 0 ? N.text : ((nt = N.value) == null ? void 0 : nt.text) || (Array.isArray((st = N.value) == null ? void 0 : st.richText) ? N.value.richText.map((ot) => ot.text || "").join("") : "") || "");
|
|
@@ -3044,7 +3042,7 @@ const St = (L) => {
|
|
|
3044
3042
|
hyperlink: U.linkAddress
|
|
3045
3043
|
};
|
|
3046
3044
|
});
|
|
3047
|
-
const { nextPriority: b, pendingDuplicateValues: R } =
|
|
3045
|
+
const { nextPriority: b, pendingDuplicateValues: R } = Yt(H, D, 1);
|
|
3048
3046
|
_[I] = { duplicateValues: R };
|
|
3049
3047
|
let e = b;
|
|
3050
3048
|
if (!D.dataVerification) return;
|
|
@@ -3054,7 +3052,7 @@ const St = (L) => {
|
|
|
3054
3052
|
Object.entries(D.dataVerification).forEach(([M, et]) => {
|
|
3055
3053
|
const U = et;
|
|
3056
3054
|
if (U.type !== "dropdown" && U.type !== "checkbox") return;
|
|
3057
|
-
const [
|
|
3055
|
+
const [K, E] = M.split("_").map(Number), w = dt.encode_cell({ r: K, c: E });
|
|
3058
3056
|
if (U.type === "checkbox") {
|
|
3059
3057
|
const $ = (U.value1 || "TRUE").trim(), B = (U.value2 || "FALSE").trim(), it = [$, B].filter(Boolean);
|
|
3060
3058
|
Q[w] = {
|
|
@@ -3105,24 +3103,24 @@ const St = (L) => {
|
|
|
3105
3103
|
if (!((R = D.images) != null && R.length)) return;
|
|
3106
3104
|
const H = h.worksheets[I];
|
|
3107
3105
|
if (!H) return;
|
|
3108
|
-
const
|
|
3106
|
+
const Y = Number(D.defaultColWidth) || 99, b = Number(D.defaultRowHeight) || 21;
|
|
3109
3107
|
Lt(
|
|
3110
3108
|
H,
|
|
3111
3109
|
h,
|
|
3112
3110
|
D.images,
|
|
3113
3111
|
D,
|
|
3114
|
-
|
|
3112
|
+
Y,
|
|
3115
3113
|
b
|
|
3116
3114
|
);
|
|
3117
3115
|
});
|
|
3118
3116
|
const k = await h.xlsx.writeBuffer(), A = await re(k, _), S = new Blob([A], {
|
|
3119
3117
|
type: "application/vnd.openxmlformats-officedocument.spreadsheetml.sheet"
|
|
3120
|
-
}),
|
|
3121
|
-
O.href =
|
|
3118
|
+
}), L = URL.createObjectURL(S), O = document.createElement("a");
|
|
3119
|
+
O.href = L, O.download = `${p}.xlsx`, O.click(), URL.revokeObjectURL(L);
|
|
3122
3120
|
} catch (l) {
|
|
3123
3121
|
console.error("Export failed:", l);
|
|
3124
3122
|
}
|
|
3125
3123
|
};
|
|
3126
3124
|
export {
|
|
3127
|
-
|
|
3125
|
+
pe as handleExportToXLSX
|
|
3128
3126
|
};
|