@harbour-enterprises/superdoc 0.12.0-RC2 → 0.12.0-RC3
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/chunks/{index-BTkgQgI7.es.js → index-27P7yLl7.es.js} +1 -1
- package/dist/chunks/{index-kWwSELc2.es.js → index-2fgTY0gr.es.js} +2 -2
- package/dist/chunks/{index-CbUTRvRk.cjs → index-C-M7zT_5.cjs} +1 -1
- package/dist/chunks/{index-C6SLw2ph.cjs → index-UCzTj2iK.cjs} +1 -1
- package/dist/chunks/{super-editor.es-jrBL9mdr.es.js → super-editor.es-Co0MUfbd.es.js} +5499 -5391
- package/dist/chunks/{super-editor.es-VeFFgSyB.cjs → super-editor.es-DPkbZzNG.cjs} +70 -64
- package/dist/chunks/{url-DRGmEUtI.cjs → url-Bd_xvDLH.cjs} +1 -1
- package/dist/chunks/{url-C29KYeaj.es.js → url-CEWFyxj1.es.js} +1 -1
- package/dist/chunks/xml-js-BBSyOdPv.cjs +10 -0
- package/dist/chunks/{xml-js-CgHhGhcJ.es.js → xml-js-BH5W8vwP.es.js} +744 -762
- package/dist/super-editor/ai-writer.es.js +2 -2
- package/dist/super-editor/chunks/{converter-D1a6grDV.js → converter-Vjysuk1c.js} +1888 -1824
- package/dist/super-editor/chunks/{docx-zipper-L7BeJRax.js → docx-zipper-BFgGqpdr.js} +749 -763
- package/dist/super-editor/chunks/{editor-BY7pz5xQ.js → editor-CvkW6Gqh.js} +262 -203
- package/dist/super-editor/chunks/{toolbar-DEvjPuNj.js → toolbar-C1jMelI-.js} +2 -2
- package/dist/super-editor/converter.es.js +1 -1
- package/dist/super-editor/core/DocxZipper.d.ts.map +1 -1
- package/dist/super-editor/core/super-converter/SuperConverter.d.ts.map +1 -1
- package/dist/super-editor/core/super-converter/constants.d.ts +2 -0
- package/dist/super-editor/core/super-converter/constants.d.ts.map +1 -0
- package/dist/super-editor/core/super-converter/exporter.d.ts.map +1 -1
- package/dist/super-editor/core/super-converter/v2/importer/docxImporter.d.ts.map +1 -1
- package/dist/super-editor/core/super-converter/v2/importer/paragraphNodeImporter.d.ts.map +1 -1
- package/dist/super-editor/core/super-converter/v2/importer/structuredDocumentNodeImporter.d.ts +9 -0
- package/dist/super-editor/core/super-converter/v2/importer/structuredDocumentNodeImporter.d.ts.map +1 -0
- package/dist/super-editor/docx-zipper.es.js +2 -2
- package/dist/super-editor/editor.es.js +3 -3
- package/dist/super-editor/extensions/field-annotation/field-annotation.d.ts.map +1 -1
- package/dist/super-editor/extensions/index.d.ts +2 -1
- package/dist/super-editor/extensions/index.d.ts.map +1 -1
- package/dist/super-editor/extensions/list-item/ListItemNodeView.d.ts.map +1 -1
- package/dist/super-editor/extensions/structured-content/index.d.ts +2 -0
- package/dist/super-editor/extensions/structured-content/index.d.ts.map +1 -0
- package/dist/super-editor/extensions/structured-content/structured-content.d.ts +2 -0
- package/dist/super-editor/extensions/structured-content/structured-content.d.ts.map +1 -0
- package/dist/super-editor/file-zipper.es.js +1 -1
- package/dist/super-editor/super-editor.es.js +6 -6
- package/dist/super-editor/tests/import/sdt-nodes/structuredDocumentNodeTests.test.d.ts +2 -0
- package/dist/super-editor/tests/import/sdt-nodes/structuredDocumentNodeTests.test.d.ts.map +1 -0
- package/dist/super-editor/toolbar.es.js +2 -2
- package/dist/super-editor.cjs +1 -1
- package/dist/super-editor.es.js +2 -2
- package/dist/superdoc.cjs +5 -5
- package/dist/superdoc.es.js +6 -6
- package/dist/superdoc.umd.js +3098 -2990
- package/dist/superdoc.umd.js.map +1 -1
- package/package.json +2 -1
- package/dist/chunks/xml-js-CMQ3QRee.cjs +0 -10
|
@@ -1,4 +1,4 @@
|
|
|
1
|
-
import { x as Tt, a5 as wt, B as ut, a6 as Bt, a7 as Rt } from "./converter-
|
|
1
|
+
import { x as Tt, a5 as wt, B as ut, a6 as Bt, a7 as Rt, a8 as Dt } from "./converter-Vjysuk1c.js";
|
|
2
2
|
function kt(bt) {
|
|
3
3
|
throw new Error('Could not dynamically require "' + bt + '". Please configure the dynamicRequireTargets or/and ignoreDynamicRequires option of @rollup/plugin-commonjs appropriately for this require call to work.');
|
|
4
4
|
}
|
|
@@ -8,53 +8,53 @@ var Ct = { exports: {} };
|
|
|
8
8
|
bt.exports = _();
|
|
9
9
|
})(function() {
|
|
10
10
|
return function _(R, y, l) {
|
|
11
|
-
function a(
|
|
12
|
-
if (!y[
|
|
13
|
-
if (!R[
|
|
14
|
-
var
|
|
15
|
-
if (!v &&
|
|
16
|
-
if (r) return r(
|
|
17
|
-
var b = new Error("Cannot find module '" +
|
|
11
|
+
function a(p, v) {
|
|
12
|
+
if (!y[p]) {
|
|
13
|
+
if (!R[p]) {
|
|
14
|
+
var m = typeof kt == "function" && kt;
|
|
15
|
+
if (!v && m) return m(p, !0);
|
|
16
|
+
if (r) return r(p, !0);
|
|
17
|
+
var b = new Error("Cannot find module '" + p + "'");
|
|
18
18
|
throw b.code = "MODULE_NOT_FOUND", b;
|
|
19
19
|
}
|
|
20
|
-
var
|
|
21
|
-
R[
|
|
22
|
-
var n = R[
|
|
23
|
-
return a(n ||
|
|
24
|
-
},
|
|
20
|
+
var s = y[p] = { exports: {} };
|
|
21
|
+
R[p][0].call(s.exports, function(c) {
|
|
22
|
+
var n = R[p][1][c];
|
|
23
|
+
return a(n || c);
|
|
24
|
+
}, s, s.exports, _, R, y, l);
|
|
25
25
|
}
|
|
26
|
-
return y[
|
|
26
|
+
return y[p].exports;
|
|
27
27
|
}
|
|
28
28
|
for (var r = typeof kt == "function" && kt, h = 0; h < l.length; h++) a(l[h]);
|
|
29
29
|
return a;
|
|
30
30
|
}({ 1: [function(_, R, y) {
|
|
31
31
|
var l = _("./utils"), a = _("./support"), r = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/=";
|
|
32
32
|
y.encode = function(h) {
|
|
33
|
-
for (var
|
|
33
|
+
for (var p, v, m, b, s, c, n, u = [], i = 0, d = h.length, w = d, S = l.getTypeOf(h) !== "string"; i < h.length; ) w = d - i, m = S ? (p = h[i++], v = i < d ? h[i++] : 0, i < d ? h[i++] : 0) : (p = h.charCodeAt(i++), v = i < d ? h.charCodeAt(i++) : 0, i < d ? h.charCodeAt(i++) : 0), b = p >> 2, s = (3 & p) << 4 | v >> 4, c = 1 < w ? (15 & v) << 2 | m >> 6 : 64, n = 2 < w ? 63 & m : 64, u.push(r.charAt(b) + r.charAt(s) + r.charAt(c) + r.charAt(n));
|
|
34
34
|
return u.join("");
|
|
35
35
|
}, y.decode = function(h) {
|
|
36
|
-
var
|
|
37
|
-
if (h.substr(0,
|
|
38
|
-
var
|
|
36
|
+
var p, v, m, b, s, c, n = 0, u = 0, i = "data:";
|
|
37
|
+
if (h.substr(0, i.length) === i) throw new Error("Invalid base64 input, it looks like a data url.");
|
|
38
|
+
var d, w = 3 * (h = h.replace(/[^A-Za-z0-9+/=]/g, "")).length / 4;
|
|
39
39
|
if (h.charAt(h.length - 1) === r.charAt(64) && w--, h.charAt(h.length - 2) === r.charAt(64) && w--, w % 1 != 0) throw new Error("Invalid base64 input, bad content length.");
|
|
40
|
-
for (
|
|
41
|
-
return
|
|
40
|
+
for (d = a.uint8array ? new Uint8Array(0 | w) : new Array(0 | w); n < h.length; ) p = r.indexOf(h.charAt(n++)) << 2 | (b = r.indexOf(h.charAt(n++))) >> 4, v = (15 & b) << 4 | (s = r.indexOf(h.charAt(n++))) >> 2, m = (3 & s) << 6 | (c = r.indexOf(h.charAt(n++))), d[u++] = p, s !== 64 && (d[u++] = v), c !== 64 && (d[u++] = m);
|
|
41
|
+
return d;
|
|
42
42
|
};
|
|
43
43
|
}, { "./support": 30, "./utils": 32 }], 2: [function(_, R, y) {
|
|
44
44
|
var l = _("./external"), a = _("./stream/DataWorker"), r = _("./stream/Crc32Probe"), h = _("./stream/DataLengthProbe");
|
|
45
|
-
function
|
|
46
|
-
this.compressedSize = v, this.uncompressedSize =
|
|
45
|
+
function p(v, m, b, s, c) {
|
|
46
|
+
this.compressedSize = v, this.uncompressedSize = m, this.crc32 = b, this.compression = s, this.compressedContent = c;
|
|
47
47
|
}
|
|
48
|
-
|
|
49
|
-
var v = new a(l.Promise.resolve(this.compressedContent)).pipe(this.compression.uncompressWorker()).pipe(new h("data_length")),
|
|
48
|
+
p.prototype = { getContentWorker: function() {
|
|
49
|
+
var v = new a(l.Promise.resolve(this.compressedContent)).pipe(this.compression.uncompressWorker()).pipe(new h("data_length")), m = this;
|
|
50
50
|
return v.on("end", function() {
|
|
51
|
-
if (this.streamInfo.data_length !==
|
|
51
|
+
if (this.streamInfo.data_length !== m.uncompressedSize) throw new Error("Bug : uncompressed data size mismatch");
|
|
52
52
|
}), v;
|
|
53
53
|
}, getCompressedWorker: function() {
|
|
54
54
|
return new a(l.Promise.resolve(this.compressedContent)).withStreamInfo("compressedSize", this.compressedSize).withStreamInfo("uncompressedSize", this.uncompressedSize).withStreamInfo("crc32", this.crc32).withStreamInfo("compression", this.compression);
|
|
55
|
-
} },
|
|
56
|
-
return v.pipe(new r()).pipe(new h("uncompressedSize")).pipe(
|
|
57
|
-
}, R.exports =
|
|
55
|
+
} }, p.createWorkerFrom = function(v, m, b) {
|
|
56
|
+
return v.pipe(new r()).pipe(new h("uncompressedSize")).pipe(m.compressWorker(b)).pipe(new h("compressedSize")).withStreamInfo("compression", m);
|
|
57
|
+
}, R.exports = p;
|
|
58
58
|
}, { "./external": 6, "./stream/Crc32Probe": 25, "./stream/DataLengthProbe": 26, "./stream/DataWorker": 27 }], 3: [function(_, R, y) {
|
|
59
59
|
var l = _("./stream/GenericWorker");
|
|
60
60
|
y.STORE = { magic: "\0\0", compressWorker: function() {
|
|
@@ -64,24 +64,24 @@ var Ct = { exports: {} };
|
|
|
64
64
|
} }, y.DEFLATE = _("./flate");
|
|
65
65
|
}, { "./flate": 7, "./stream/GenericWorker": 28 }], 4: [function(_, R, y) {
|
|
66
66
|
var l = _("./utils"), a = function() {
|
|
67
|
-
for (var r, h = [],
|
|
68
|
-
r =
|
|
67
|
+
for (var r, h = [], p = 0; p < 256; p++) {
|
|
68
|
+
r = p;
|
|
69
69
|
for (var v = 0; v < 8; v++) r = 1 & r ? 3988292384 ^ r >>> 1 : r >>> 1;
|
|
70
|
-
h[
|
|
70
|
+
h[p] = r;
|
|
71
71
|
}
|
|
72
72
|
return h;
|
|
73
73
|
}();
|
|
74
74
|
R.exports = function(r, h) {
|
|
75
|
-
return r !== void 0 && r.length ? l.getTypeOf(r) !== "string" ? function(
|
|
76
|
-
var
|
|
77
|
-
|
|
78
|
-
for (var n = b; n <
|
|
79
|
-
return -1 ^
|
|
80
|
-
}(0 | h, r, r.length, 0) : function(
|
|
81
|
-
var
|
|
82
|
-
|
|
83
|
-
for (var n = b; n <
|
|
84
|
-
return -1 ^
|
|
75
|
+
return r !== void 0 && r.length ? l.getTypeOf(r) !== "string" ? function(p, v, m, b) {
|
|
76
|
+
var s = a, c = b + m;
|
|
77
|
+
p ^= -1;
|
|
78
|
+
for (var n = b; n < c; n++) p = p >>> 8 ^ s[255 & (p ^ v[n])];
|
|
79
|
+
return -1 ^ p;
|
|
80
|
+
}(0 | h, r, r.length, 0) : function(p, v, m, b) {
|
|
81
|
+
var s = a, c = b + m;
|
|
82
|
+
p ^= -1;
|
|
83
|
+
for (var n = b; n < c; n++) p = p >>> 8 ^ s[255 & (p ^ v.charCodeAt(n))];
|
|
84
|
+
return -1 ^ p;
|
|
85
85
|
}(0 | h, r, r.length, 0) : 0;
|
|
86
86
|
};
|
|
87
87
|
}, { "./utils": 32 }], 5: [function(_, R, y) {
|
|
@@ -90,118 +90,118 @@ var Ct = { exports: {} };
|
|
|
90
90
|
var l = null;
|
|
91
91
|
l = typeof Promise < "u" ? Promise : _("lie"), R.exports = { Promise: l };
|
|
92
92
|
}, { lie: 37 }], 7: [function(_, R, y) {
|
|
93
|
-
var l = typeof Uint8Array < "u" && typeof Uint16Array < "u" && typeof Uint32Array < "u", a = _("pako"), r = _("./utils"), h = _("./stream/GenericWorker"),
|
|
94
|
-
function v(
|
|
95
|
-
h.call(this, "FlateWorker/" +
|
|
93
|
+
var l = typeof Uint8Array < "u" && typeof Uint16Array < "u" && typeof Uint32Array < "u", a = _("pako"), r = _("./utils"), h = _("./stream/GenericWorker"), p = l ? "uint8array" : "array";
|
|
94
|
+
function v(m, b) {
|
|
95
|
+
h.call(this, "FlateWorker/" + m), this._pako = null, this._pakoAction = m, this._pakoOptions = b, this.meta = {};
|
|
96
96
|
}
|
|
97
|
-
y.magic = "\b\0", r.inherits(v, h), v.prototype.processChunk = function(
|
|
98
|
-
this.meta =
|
|
97
|
+
y.magic = "\b\0", r.inherits(v, h), v.prototype.processChunk = function(m) {
|
|
98
|
+
this.meta = m.meta, this._pako === null && this._createPako(), this._pako.push(r.transformTo(p, m.data), !1);
|
|
99
99
|
}, v.prototype.flush = function() {
|
|
100
100
|
h.prototype.flush.call(this), this._pako === null && this._createPako(), this._pako.push([], !0);
|
|
101
101
|
}, v.prototype.cleanUp = function() {
|
|
102
102
|
h.prototype.cleanUp.call(this), this._pako = null;
|
|
103
103
|
}, v.prototype._createPako = function() {
|
|
104
104
|
this._pako = new a[this._pakoAction]({ raw: !0, level: this._pakoOptions.level || -1 });
|
|
105
|
-
var
|
|
105
|
+
var m = this;
|
|
106
106
|
this._pako.onData = function(b) {
|
|
107
|
-
|
|
107
|
+
m.push({ data: b, meta: m.meta });
|
|
108
108
|
};
|
|
109
|
-
}, y.compressWorker = function(
|
|
110
|
-
return new v("Deflate",
|
|
109
|
+
}, y.compressWorker = function(m) {
|
|
110
|
+
return new v("Deflate", m);
|
|
111
111
|
}, y.uncompressWorker = function() {
|
|
112
112
|
return new v("Inflate", {});
|
|
113
113
|
};
|
|
114
114
|
}, { "./stream/GenericWorker": 28, "./utils": 32, pako: 38 }], 8: [function(_, R, y) {
|
|
115
|
-
function l(
|
|
115
|
+
function l(s, c) {
|
|
116
116
|
var n, u = "";
|
|
117
|
-
for (n = 0; n <
|
|
117
|
+
for (n = 0; n < c; n++) u += String.fromCharCode(255 & s), s >>>= 8;
|
|
118
118
|
return u;
|
|
119
119
|
}
|
|
120
|
-
function a(
|
|
121
|
-
var w, S, x =
|
|
122
|
-
|
|
120
|
+
function a(s, c, n, u, i, d) {
|
|
121
|
+
var w, S, x = s.file, F = s.compression, I = d !== p.utf8encode, j = r.transformTo("string", d(x.name)), O = r.transformTo("string", p.utf8encode(x.name)), W = x.comment, J = r.transformTo("string", d(W)), g = r.transformTo("string", p.utf8encode(W)), T = O.length !== x.name.length, e = g.length !== W.length, D = "", q = "", U = "", $ = x.dir, L = x.date, V = { crc32: 0, compressedSize: 0, uncompressedSize: 0 };
|
|
122
|
+
c && !n || (V.crc32 = s.crc32, V.compressedSize = s.compressedSize, V.uncompressedSize = s.uncompressedSize);
|
|
123
123
|
var C = 0;
|
|
124
|
-
|
|
124
|
+
c && (C |= 8), I || !T && !e || (C |= 2048);
|
|
125
125
|
var E = 0, Y = 0;
|
|
126
|
-
$ && (E |= 16),
|
|
126
|
+
$ && (E |= 16), i === "UNIX" ? (Y = 798, E |= function(H, it) {
|
|
127
127
|
var lt = H;
|
|
128
128
|
return H || (lt = it ? 16893 : 33204), (65535 & lt) << 16;
|
|
129
129
|
}(x.unixPermissions, $)) : (Y = 20, E |= function(H) {
|
|
130
130
|
return 63 & (H || 0);
|
|
131
|
-
}(x.dosPermissions)), w = L.getUTCHours(), w <<= 6, w |= L.getUTCMinutes(), w <<= 5, w |= L.getUTCSeconds() / 2, S = L.getUTCFullYear() - 1980, S <<= 4, S |= L.getUTCMonth() + 1, S <<= 5, S |= L.getUTCDate(), T && (
|
|
131
|
+
}(x.dosPermissions)), w = L.getUTCHours(), w <<= 6, w |= L.getUTCMinutes(), w <<= 5, w |= L.getUTCSeconds() / 2, S = L.getUTCFullYear() - 1980, S <<= 4, S |= L.getUTCMonth() + 1, S <<= 5, S |= L.getUTCDate(), T && (q = l(1, 1) + l(v(j), 4) + O, D += "up" + l(q.length, 2) + q), e && (U = l(1, 1) + l(v(J), 4) + g, D += "uc" + l(U.length, 2) + U);
|
|
132
132
|
var G = "";
|
|
133
133
|
return G += `
|
|
134
|
-
\0`, G += l(C, 2), G += F.magic, G += l(w, 2), G += l(S, 2), G += l(
|
|
135
|
-
}
|
|
136
|
-
var r = _("../utils"), h = _("../stream/GenericWorker"),
|
|
137
|
-
function b(
|
|
138
|
-
h.call(this, "ZipFileWorker"), this.bytesWritten = 0, this.zipComment =
|
|
139
|
-
}
|
|
140
|
-
r.inherits(b, h), b.prototype.push = function(
|
|
141
|
-
var
|
|
142
|
-
this.accumulate ? this.contentBuffer.push(
|
|
143
|
-
}, b.prototype.openedSource = function(
|
|
144
|
-
this.currentSourceOffset = this.bytesWritten, this.currentFile =
|
|
145
|
-
var
|
|
146
|
-
if (
|
|
147
|
-
var n = a(
|
|
134
|
+
\0`, G += l(C, 2), G += F.magic, G += l(w, 2), G += l(S, 2), G += l(V.crc32, 4), G += l(V.compressedSize, 4), G += l(V.uncompressedSize, 4), G += l(j.length, 2), G += l(D.length, 2), { fileRecord: m.LOCAL_FILE_HEADER + G + j + D, dirRecord: m.CENTRAL_FILE_HEADER + l(Y, 2) + G + l(J.length, 2) + "\0\0\0\0" + l(E, 4) + l(u, 4) + j + D + J };
|
|
135
|
+
}
|
|
136
|
+
var r = _("../utils"), h = _("../stream/GenericWorker"), p = _("../utf8"), v = _("../crc32"), m = _("../signature");
|
|
137
|
+
function b(s, c, n, u) {
|
|
138
|
+
h.call(this, "ZipFileWorker"), this.bytesWritten = 0, this.zipComment = c, this.zipPlatform = n, this.encodeFileName = u, this.streamFiles = s, this.accumulate = !1, this.contentBuffer = [], this.dirRecords = [], this.currentSourceOffset = 0, this.entriesCount = 0, this.currentFile = null, this._sources = [];
|
|
139
|
+
}
|
|
140
|
+
r.inherits(b, h), b.prototype.push = function(s) {
|
|
141
|
+
var c = s.meta.percent || 0, n = this.entriesCount, u = this._sources.length;
|
|
142
|
+
this.accumulate ? this.contentBuffer.push(s) : (this.bytesWritten += s.data.length, h.prototype.push.call(this, { data: s.data, meta: { currentFile: this.currentFile, percent: n ? (c + 100 * (n - u - 1)) / n : 100 } }));
|
|
143
|
+
}, b.prototype.openedSource = function(s) {
|
|
144
|
+
this.currentSourceOffset = this.bytesWritten, this.currentFile = s.file.name;
|
|
145
|
+
var c = this.streamFiles && !s.file.dir;
|
|
146
|
+
if (c) {
|
|
147
|
+
var n = a(s, c, !1, this.currentSourceOffset, this.zipPlatform, this.encodeFileName);
|
|
148
148
|
this.push({ data: n.fileRecord, meta: { percent: 0 } });
|
|
149
149
|
} else this.accumulate = !0;
|
|
150
|
-
}, b.prototype.closedSource = function(
|
|
150
|
+
}, b.prototype.closedSource = function(s) {
|
|
151
151
|
this.accumulate = !1;
|
|
152
|
-
var
|
|
153
|
-
if (this.dirRecords.push(n.dirRecord),
|
|
154
|
-
return
|
|
155
|
-
}(
|
|
152
|
+
var c = this.streamFiles && !s.file.dir, n = a(s, c, !0, this.currentSourceOffset, this.zipPlatform, this.encodeFileName);
|
|
153
|
+
if (this.dirRecords.push(n.dirRecord), c) this.push({ data: function(u) {
|
|
154
|
+
return m.DATA_DESCRIPTOR + l(u.crc32, 4) + l(u.compressedSize, 4) + l(u.uncompressedSize, 4);
|
|
155
|
+
}(s), meta: { percent: 100 } });
|
|
156
156
|
else for (this.push({ data: n.fileRecord, meta: { percent: 0 } }); this.contentBuffer.length; ) this.push(this.contentBuffer.shift());
|
|
157
157
|
this.currentFile = null;
|
|
158
158
|
}, b.prototype.flush = function() {
|
|
159
|
-
for (var
|
|
160
|
-
var n = this.bytesWritten -
|
|
159
|
+
for (var s = this.bytesWritten, c = 0; c < this.dirRecords.length; c++) this.push({ data: this.dirRecords[c], meta: { percent: 100 } });
|
|
160
|
+
var n = this.bytesWritten - s, u = function(i, d, w, S, x) {
|
|
161
161
|
var F = r.transformTo("string", x(S));
|
|
162
|
-
return
|
|
163
|
-
}(this.dirRecords.length, n,
|
|
162
|
+
return m.CENTRAL_DIRECTORY_END + "\0\0\0\0" + l(i, 2) + l(i, 2) + l(d, 4) + l(w, 4) + l(F.length, 2) + F;
|
|
163
|
+
}(this.dirRecords.length, n, s, this.zipComment, this.encodeFileName);
|
|
164
164
|
this.push({ data: u, meta: { percent: 100 } });
|
|
165
165
|
}, b.prototype.prepareNextSource = function() {
|
|
166
166
|
this.previous = this._sources.shift(), this.openedSource(this.previous.streamInfo), this.isPaused ? this.previous.pause() : this.previous.resume();
|
|
167
|
-
}, b.prototype.registerPrevious = function(
|
|
168
|
-
this._sources.push(
|
|
169
|
-
var
|
|
170
|
-
return
|
|
171
|
-
|
|
172
|
-
}),
|
|
173
|
-
|
|
174
|
-
}),
|
|
175
|
-
|
|
167
|
+
}, b.prototype.registerPrevious = function(s) {
|
|
168
|
+
this._sources.push(s);
|
|
169
|
+
var c = this;
|
|
170
|
+
return s.on("data", function(n) {
|
|
171
|
+
c.processChunk(n);
|
|
172
|
+
}), s.on("end", function() {
|
|
173
|
+
c.closedSource(c.previous.streamInfo), c._sources.length ? c.prepareNextSource() : c.end();
|
|
174
|
+
}), s.on("error", function(n) {
|
|
175
|
+
c.error(n);
|
|
176
176
|
}), this;
|
|
177
177
|
}, b.prototype.resume = function() {
|
|
178
178
|
return !!h.prototype.resume.call(this) && (!this.previous && this._sources.length ? (this.prepareNextSource(), !0) : this.previous || this._sources.length || this.generatedError ? void 0 : (this.end(), !0));
|
|
179
|
-
}, b.prototype.error = function(
|
|
180
|
-
var
|
|
181
|
-
if (!h.prototype.error.call(this,
|
|
182
|
-
for (var n = 0; n <
|
|
183
|
-
|
|
179
|
+
}, b.prototype.error = function(s) {
|
|
180
|
+
var c = this._sources;
|
|
181
|
+
if (!h.prototype.error.call(this, s)) return !1;
|
|
182
|
+
for (var n = 0; n < c.length; n++) try {
|
|
183
|
+
c[n].error(s);
|
|
184
184
|
} catch {
|
|
185
185
|
}
|
|
186
186
|
return !0;
|
|
187
187
|
}, b.prototype.lock = function() {
|
|
188
188
|
h.prototype.lock.call(this);
|
|
189
|
-
for (var
|
|
189
|
+
for (var s = this._sources, c = 0; c < s.length; c++) s[c].lock();
|
|
190
190
|
}, R.exports = b;
|
|
191
191
|
}, { "../crc32": 4, "../signature": 23, "../stream/GenericWorker": 28, "../utf8": 31, "../utils": 32 }], 9: [function(_, R, y) {
|
|
192
192
|
var l = _("../compressions"), a = _("./ZipFileWorker");
|
|
193
|
-
y.generateWorker = function(r, h,
|
|
194
|
-
var v = new a(h.streamFiles,
|
|
193
|
+
y.generateWorker = function(r, h, p) {
|
|
194
|
+
var v = new a(h.streamFiles, p, h.platform, h.encodeFileName), m = 0;
|
|
195
195
|
try {
|
|
196
|
-
r.forEach(function(b,
|
|
197
|
-
|
|
198
|
-
var
|
|
199
|
-
var S =
|
|
196
|
+
r.forEach(function(b, s) {
|
|
197
|
+
m++;
|
|
198
|
+
var c = function(d, w) {
|
|
199
|
+
var S = d || w, x = l[S];
|
|
200
200
|
if (!x) throw new Error(S + " is not a valid compression method !");
|
|
201
201
|
return x;
|
|
202
|
-
}(
|
|
203
|
-
|
|
204
|
-
}), v.entriesCount =
|
|
202
|
+
}(s.options.compression, h.compression), n = s.options.compressionOptions || h.compressionOptions || {}, u = s.dir, i = s.date;
|
|
203
|
+
s._compressWorker(c, n).withStreamInfo("file", { name: b, dir: u, date: i, comment: s.comment || "", unixPermissions: s.unixPermissions, dosPermissions: s.dosPermissions }).pipe(v);
|
|
204
|
+
}), v.entriesCount = m;
|
|
205
205
|
} catch (b) {
|
|
206
206
|
v.error(b);
|
|
207
207
|
}
|
|
@@ -221,47 +221,47 @@ var Ct = { exports: {} };
|
|
|
221
221
|
return new l().loadAsync(a, r);
|
|
222
222
|
}, l.external = _("./external"), R.exports = l;
|
|
223
223
|
}, { "./defaults": 5, "./external": 6, "./load": 11, "./object": 15, "./support": 30 }], 11: [function(_, R, y) {
|
|
224
|
-
var l = _("./utils"), a = _("./external"), r = _("./utf8"), h = _("./zipEntries"),
|
|
225
|
-
function
|
|
226
|
-
return new a.Promise(function(
|
|
227
|
-
var n = b.decompressed.getContentWorker().pipe(new
|
|
224
|
+
var l = _("./utils"), a = _("./external"), r = _("./utf8"), h = _("./zipEntries"), p = _("./stream/Crc32Probe"), v = _("./nodejsUtils");
|
|
225
|
+
function m(b) {
|
|
226
|
+
return new a.Promise(function(s, c) {
|
|
227
|
+
var n = b.decompressed.getContentWorker().pipe(new p());
|
|
228
228
|
n.on("error", function(u) {
|
|
229
|
-
|
|
229
|
+
c(u);
|
|
230
230
|
}).on("end", function() {
|
|
231
|
-
n.streamInfo.crc32 !== b.decompressed.crc32 ?
|
|
231
|
+
n.streamInfo.crc32 !== b.decompressed.crc32 ? c(new Error("Corrupted zip : CRC32 mismatch")) : s();
|
|
232
232
|
}).resume();
|
|
233
233
|
});
|
|
234
234
|
}
|
|
235
|
-
R.exports = function(b,
|
|
236
|
-
var
|
|
237
|
-
return
|
|
238
|
-
var u = new h(
|
|
235
|
+
R.exports = function(b, s) {
|
|
236
|
+
var c = this;
|
|
237
|
+
return s = l.extend(s || {}, { base64: !1, checkCRC32: !1, optimizedBinaryString: !1, createFolders: !1, decodeFileName: r.utf8decode }), v.isNode && v.isStream(b) ? a.Promise.reject(new Error("JSZip can't accept a stream when loading a zip file.")) : l.prepareContent("the loaded zip file", b, !0, s.optimizedBinaryString, s.base64).then(function(n) {
|
|
238
|
+
var u = new h(s);
|
|
239
239
|
return u.load(n), u;
|
|
240
240
|
}).then(function(n) {
|
|
241
|
-
var u = [a.Promise.resolve(n)],
|
|
242
|
-
if (
|
|
241
|
+
var u = [a.Promise.resolve(n)], i = n.files;
|
|
242
|
+
if (s.checkCRC32) for (var d = 0; d < i.length; d++) u.push(m(i[d]));
|
|
243
243
|
return a.Promise.all(u);
|
|
244
244
|
}).then(function(n) {
|
|
245
|
-
for (var u = n.shift(),
|
|
246
|
-
var w =
|
|
247
|
-
|
|
245
|
+
for (var u = n.shift(), i = u.files, d = 0; d < i.length; d++) {
|
|
246
|
+
var w = i[d], S = w.fileNameStr, x = l.resolve(w.fileNameStr);
|
|
247
|
+
c.file(x, w.decompressed, { binary: !0, optimizedBinaryString: !0, date: w.date, dir: w.dir, comment: w.fileCommentStr.length ? w.fileCommentStr : null, unixPermissions: w.unixPermissions, dosPermissions: w.dosPermissions, createFolders: s.createFolders }), w.dir || (c.file(x).unsafeOriginalName = S);
|
|
248
248
|
}
|
|
249
|
-
return u.zipComment.length && (
|
|
249
|
+
return u.zipComment.length && (c.comment = u.zipComment), c;
|
|
250
250
|
});
|
|
251
251
|
};
|
|
252
252
|
}, { "./external": 6, "./nodejsUtils": 14, "./stream/Crc32Probe": 25, "./utf8": 31, "./utils": 32, "./zipEntries": 33 }], 12: [function(_, R, y) {
|
|
253
253
|
var l = _("../utils"), a = _("../stream/GenericWorker");
|
|
254
|
-
function r(h,
|
|
255
|
-
a.call(this, "Nodejs stream input adapter for " + h), this._upstreamEnded = !1, this._bindStream(
|
|
254
|
+
function r(h, p) {
|
|
255
|
+
a.call(this, "Nodejs stream input adapter for " + h), this._upstreamEnded = !1, this._bindStream(p);
|
|
256
256
|
}
|
|
257
257
|
l.inherits(r, a), r.prototype._bindStream = function(h) {
|
|
258
|
-
var
|
|
258
|
+
var p = this;
|
|
259
259
|
(this._stream = h).pause(), h.on("data", function(v) {
|
|
260
|
-
|
|
260
|
+
p.push({ data: v, meta: { percent: 0 } });
|
|
261
261
|
}).on("error", function(v) {
|
|
262
|
-
|
|
262
|
+
p.isPaused ? this.generatedError = v : p.error(v);
|
|
263
263
|
}).on("end", function() {
|
|
264
|
-
|
|
264
|
+
p.isPaused ? p._upstreamEnded = !0 : p.end();
|
|
265
265
|
});
|
|
266
266
|
}, r.prototype.pause = function() {
|
|
267
267
|
return !!a.prototype.pause.call(this) && (this._stream.pause(), !0);
|
|
@@ -270,13 +270,13 @@ var Ct = { exports: {} };
|
|
|
270
270
|
}, R.exports = r;
|
|
271
271
|
}, { "../stream/GenericWorker": 28, "../utils": 32 }], 13: [function(_, R, y) {
|
|
272
272
|
var l = _("readable-stream").Readable;
|
|
273
|
-
function a(r, h,
|
|
273
|
+
function a(r, h, p) {
|
|
274
274
|
l.call(this, h), this._helper = r;
|
|
275
275
|
var v = this;
|
|
276
|
-
r.on("data", function(
|
|
277
|
-
v.push(
|
|
278
|
-
}).on("error", function(
|
|
279
|
-
v.emit("error",
|
|
276
|
+
r.on("data", function(m, b) {
|
|
277
|
+
v.push(m) || v._helper.pause(), p && p(b);
|
|
278
|
+
}).on("error", function(m) {
|
|
279
|
+
v.emit("error", m);
|
|
280
280
|
}).on("end", function() {
|
|
281
281
|
v.push(null);
|
|
282
282
|
});
|
|
@@ -301,22 +301,22 @@ var Ct = { exports: {} };
|
|
|
301
301
|
}, {}], 15: [function(_, R, y) {
|
|
302
302
|
function l(x, F, I) {
|
|
303
303
|
var j, O = r.getTypeOf(F), W = r.extend(I || {}, v);
|
|
304
|
-
W.date = W.date || /* @__PURE__ */ new Date(), W.compression !== null && (W.compression = W.compression.toUpperCase()), typeof W.unixPermissions == "string" && (W.unixPermissions = parseInt(W.unixPermissions, 8)), W.unixPermissions && 16384 & W.unixPermissions && (W.dir = !0), W.dosPermissions && 16 & W.dosPermissions && (W.dir = !0), W.dir && (x =
|
|
305
|
-
var
|
|
306
|
-
I && I.binary !== void 0 || (W.binary = !
|
|
304
|
+
W.date = W.date || /* @__PURE__ */ new Date(), W.compression !== null && (W.compression = W.compression.toUpperCase()), typeof W.unixPermissions == "string" && (W.unixPermissions = parseInt(W.unixPermissions, 8)), W.unixPermissions && 16384 & W.unixPermissions && (W.dir = !0), W.dosPermissions && 16 & W.dosPermissions && (W.dir = !0), W.dir && (x = i(x)), W.createFolders && (j = u(x)) && d.call(this, j, !0);
|
|
305
|
+
var J = O === "string" && W.binary === !1 && W.base64 === !1;
|
|
306
|
+
I && I.binary !== void 0 || (W.binary = !J), (F instanceof m && F.uncompressedSize === 0 || W.dir || !F || F.length === 0) && (W.base64 = !1, W.binary = !0, F = "", W.compression = "STORE", O = "string");
|
|
307
307
|
var g = null;
|
|
308
|
-
g = F instanceof
|
|
308
|
+
g = F instanceof m || F instanceof h ? F : c.isNode && c.isStream(F) ? new n(x, F) : r.prepareContent(x, F, W.binary, W.optimizedBinaryString, W.base64);
|
|
309
309
|
var T = new b(x, g, W);
|
|
310
310
|
this.files[x] = T;
|
|
311
311
|
}
|
|
312
|
-
var a = _("./utf8"), r = _("./utils"), h = _("./stream/GenericWorker"),
|
|
312
|
+
var a = _("./utf8"), r = _("./utils"), h = _("./stream/GenericWorker"), p = _("./stream/StreamHelper"), v = _("./defaults"), m = _("./compressedObject"), b = _("./zipObject"), s = _("./generate"), c = _("./nodejsUtils"), n = _("./nodejs/NodejsStreamInputAdapter"), u = function(x) {
|
|
313
313
|
x.slice(-1) === "/" && (x = x.substring(0, x.length - 1));
|
|
314
314
|
var F = x.lastIndexOf("/");
|
|
315
315
|
return 0 < F ? x.substring(0, F) : "";
|
|
316
|
-
},
|
|
316
|
+
}, i = function(x) {
|
|
317
317
|
return x.slice(-1) !== "/" && (x += "/"), x;
|
|
318
|
-
},
|
|
319
|
-
return F = F !== void 0 ? F : v.createFolders, x =
|
|
318
|
+
}, d = function(x, F) {
|
|
319
|
+
return F = F !== void 0 ? F : v.createFolders, x = i(x), this.files[x] || l.call(this, x, null, { dir: !0, createFolders: F }), this.files[x];
|
|
320
320
|
};
|
|
321
321
|
function w(x) {
|
|
322
322
|
return Object.prototype.toString.call(x) === "[object RegExp]";
|
|
@@ -335,8 +335,8 @@ var Ct = { exports: {} };
|
|
|
335
335
|
if (arguments.length !== 1) return x = this.root + x, l.call(this, x, F, I), this;
|
|
336
336
|
if (w(x)) {
|
|
337
337
|
var j = x;
|
|
338
|
-
return this.filter(function(W,
|
|
339
|
-
return !
|
|
338
|
+
return this.filter(function(W, J) {
|
|
339
|
+
return !J.dir && j.test(W);
|
|
340
340
|
});
|
|
341
341
|
}
|
|
342
342
|
var O = this.files[this.root + x];
|
|
@@ -346,7 +346,7 @@ var Ct = { exports: {} };
|
|
|
346
346
|
if (w(x)) return this.filter(function(O, W) {
|
|
347
347
|
return W.dir && x.test(O);
|
|
348
348
|
});
|
|
349
|
-
var F = this.root + x, I =
|
|
349
|
+
var F = this.root + x, I = d.call(this, F), j = this.clone();
|
|
350
350
|
return j.root = I.name, j;
|
|
351
351
|
}, remove: function(x) {
|
|
352
352
|
x = this.root + x;
|
|
@@ -364,11 +364,11 @@ var Ct = { exports: {} };
|
|
|
364
364
|
if ((I = r.extend(x || {}, { streamFiles: !1, compression: "STORE", compressionOptions: null, type: "", platform: "DOS", comment: null, mimeType: "application/zip", encodeFileName: a.utf8encode })).type = I.type.toLowerCase(), I.compression = I.compression.toUpperCase(), I.type === "binarystring" && (I.type = "string"), !I.type) throw new Error("No output type specified.");
|
|
365
365
|
r.checkSupport(I.type), I.platform !== "darwin" && I.platform !== "freebsd" && I.platform !== "linux" && I.platform !== "sunos" || (I.platform = "UNIX"), I.platform === "win32" && (I.platform = "DOS");
|
|
366
366
|
var j = I.comment || this.comment || "";
|
|
367
|
-
F =
|
|
367
|
+
F = s.generateWorker(this, I, j);
|
|
368
368
|
} catch (O) {
|
|
369
369
|
(F = new h("error")).error(O);
|
|
370
370
|
}
|
|
371
|
-
return new
|
|
371
|
+
return new p(F, I.type || "string", I.mimeType);
|
|
372
372
|
}, generateAsync: function(x, F) {
|
|
373
373
|
return this.generateInternalStream(x).accumulate(F);
|
|
374
374
|
}, generateNodeStream: function(x, F) {
|
|
@@ -386,11 +386,11 @@ var Ct = { exports: {} };
|
|
|
386
386
|
_("../utils").inherits(a, l), a.prototype.byteAt = function(r) {
|
|
387
387
|
return this.data[this.zero + r];
|
|
388
388
|
}, a.prototype.lastIndexOfSignature = function(r) {
|
|
389
|
-
for (var h = r.charCodeAt(0),
|
|
389
|
+
for (var h = r.charCodeAt(0), p = r.charCodeAt(1), v = r.charCodeAt(2), m = r.charCodeAt(3), b = this.length - 4; 0 <= b; --b) if (this.data[b] === h && this.data[b + 1] === p && this.data[b + 2] === v && this.data[b + 3] === m) return b - this.zero;
|
|
390
390
|
return -1;
|
|
391
391
|
}, a.prototype.readAndCheckSignature = function(r) {
|
|
392
|
-
var h = r.charCodeAt(0),
|
|
393
|
-
return h === b[0] &&
|
|
392
|
+
var h = r.charCodeAt(0), p = r.charCodeAt(1), v = r.charCodeAt(2), m = r.charCodeAt(3), b = this.readData(4);
|
|
393
|
+
return h === b[0] && p === b[1] && v === b[2] && m === b[3];
|
|
394
394
|
}, a.prototype.readData = function(r) {
|
|
395
395
|
if (this.checkOffset(r), r === 0) return [];
|
|
396
396
|
var h = this.data.slice(this.zero + this.index, this.zero + this.index + r);
|
|
@@ -411,9 +411,9 @@ var Ct = { exports: {} };
|
|
|
411
411
|
this.setIndex(this.index + r);
|
|
412
412
|
}, byteAt: function() {
|
|
413
413
|
}, readInt: function(r) {
|
|
414
|
-
var h,
|
|
415
|
-
for (this.checkOffset(r), h = this.index + r - 1; h >= this.index; h--)
|
|
416
|
-
return this.index += r,
|
|
414
|
+
var h, p = 0;
|
|
415
|
+
for (this.checkOffset(r), h = this.index + r - 1; h >= this.index; h--) p = (p << 8) + this.byteAt(h);
|
|
416
|
+
return this.index += r, p;
|
|
417
417
|
}, readString: function(r) {
|
|
418
418
|
return l.transformTo("string", this.readData(r));
|
|
419
419
|
}, readData: function() {
|
|
@@ -460,10 +460,10 @@ var Ct = { exports: {} };
|
|
|
460
460
|
return this.index += r, h;
|
|
461
461
|
}, R.exports = a;
|
|
462
462
|
}, { "../utils": 32, "./ArrayReader": 17 }], 22: [function(_, R, y) {
|
|
463
|
-
var l = _("../utils"), a = _("../support"), r = _("./ArrayReader"), h = _("./StringReader"),
|
|
464
|
-
R.exports = function(
|
|
465
|
-
var b = l.getTypeOf(
|
|
466
|
-
return l.checkSupport(b), b !== "string" || a.uint8array ? b === "nodebuffer" ? new m
|
|
463
|
+
var l = _("../utils"), a = _("../support"), r = _("./ArrayReader"), h = _("./StringReader"), p = _("./NodeBufferReader"), v = _("./Uint8ArrayReader");
|
|
464
|
+
R.exports = function(m) {
|
|
465
|
+
var b = l.getTypeOf(m);
|
|
466
|
+
return l.checkSupport(b), b !== "string" || a.uint8array ? b === "nodebuffer" ? new p(m) : a.uint8array ? new v(l.transformTo("uint8array", m)) : new r(l.transformTo("array", m)) : new h(m);
|
|
467
467
|
};
|
|
468
468
|
}, { "../support": 30, "../utils": 32, "./ArrayReader": 17, "./NodeBufferReader": 19, "./StringReader": 20, "./Uint8ArrayReader": 21 }], 23: [function(_, R, y) {
|
|
469
469
|
y.LOCAL_FILE_HEADER = "PK", y.CENTRAL_FILE_HEADER = "PK", y.CENTRAL_DIRECTORY_END = "PK", y.ZIP64_CENTRAL_DIRECTORY_LOCATOR = "PK\x07", y.ZIP64_CENTRAL_DIRECTORY_END = "PK", y.DATA_DESCRIPTOR = "PK\x07\b";
|
|
@@ -490,8 +490,8 @@ var Ct = { exports: {} };
|
|
|
490
490
|
}
|
|
491
491
|
l.inherits(r, a), r.prototype.processChunk = function(h) {
|
|
492
492
|
if (h) {
|
|
493
|
-
var
|
|
494
|
-
this.streamInfo[this.propName] =
|
|
493
|
+
var p = this.streamInfo[this.propName] || 0;
|
|
494
|
+
this.streamInfo[this.propName] = p + h.data.length;
|
|
495
495
|
}
|
|
496
496
|
a.prototype.processChunk.call(this, h);
|
|
497
497
|
}, R.exports = r;
|
|
@@ -499,11 +499,11 @@ var Ct = { exports: {} };
|
|
|
499
499
|
var l = _("../utils"), a = _("./GenericWorker");
|
|
500
500
|
function r(h) {
|
|
501
501
|
a.call(this, "DataWorker");
|
|
502
|
-
var
|
|
502
|
+
var p = this;
|
|
503
503
|
this.dataIsReady = !1, this.index = 0, this.max = 0, this.data = null, this.type = "", this._tickScheduled = !1, h.then(function(v) {
|
|
504
|
-
|
|
504
|
+
p.dataIsReady = !0, p.data = v, p.max = v && v.length || 0, p.type = l.getTypeOf(v), p.isPaused || p._tickAndRepeat();
|
|
505
505
|
}, function(v) {
|
|
506
|
-
|
|
506
|
+
p.error(v);
|
|
507
507
|
});
|
|
508
508
|
}
|
|
509
509
|
l.inherits(r, a), r.prototype.cleanUp = function() {
|
|
@@ -514,20 +514,20 @@ var Ct = { exports: {} };
|
|
|
514
514
|
this._tickScheduled = !1, this.isPaused || this.isFinished || (this._tick(), this.isFinished || (l.delay(this._tickAndRepeat, [], this), this._tickScheduled = !0));
|
|
515
515
|
}, r.prototype._tick = function() {
|
|
516
516
|
if (this.isPaused || this.isFinished) return !1;
|
|
517
|
-
var h = null,
|
|
517
|
+
var h = null, p = Math.min(this.max, this.index + 16384);
|
|
518
518
|
if (this.index >= this.max) return this.end();
|
|
519
519
|
switch (this.type) {
|
|
520
520
|
case "string":
|
|
521
|
-
h = this.data.substring(this.index,
|
|
521
|
+
h = this.data.substring(this.index, p);
|
|
522
522
|
break;
|
|
523
523
|
case "uint8array":
|
|
524
|
-
h = this.data.subarray(this.index,
|
|
524
|
+
h = this.data.subarray(this.index, p);
|
|
525
525
|
break;
|
|
526
526
|
case "array":
|
|
527
527
|
case "nodebuffer":
|
|
528
|
-
h = this.data.slice(this.index,
|
|
528
|
+
h = this.data.slice(this.index, p);
|
|
529
529
|
}
|
|
530
|
-
return this.index =
|
|
530
|
+
return this.index = p, this.push({ data: h, meta: { percent: this.max ? this.index / this.max * 100 : 0 } });
|
|
531
531
|
}, R.exports = r;
|
|
532
532
|
}, { "../utils": 32, "./GenericWorker": 28 }], 28: [function(_, R, y) {
|
|
533
533
|
function l(a) {
|
|
@@ -586,18 +586,18 @@ var Ct = { exports: {} };
|
|
|
586
586
|
return this.previous ? this.previous + " -> " + a : a;
|
|
587
587
|
} }, R.exports = l;
|
|
588
588
|
}, {}], 29: [function(_, R, y) {
|
|
589
|
-
var l = _("../utils"), a = _("./ConvertWorker"), r = _("./GenericWorker"), h = _("../base64"),
|
|
590
|
-
if (
|
|
591
|
-
|
|
589
|
+
var l = _("../utils"), a = _("./ConvertWorker"), r = _("./GenericWorker"), h = _("../base64"), p = _("../support"), v = _("../external"), m = null;
|
|
590
|
+
if (p.nodestream) try {
|
|
591
|
+
m = _("../nodejs/NodejsStreamOutputAdapter");
|
|
592
592
|
} catch {
|
|
593
593
|
}
|
|
594
|
-
function b(
|
|
595
|
-
return new v.Promise(function(u,
|
|
596
|
-
var
|
|
597
|
-
|
|
598
|
-
|
|
594
|
+
function b(c, n) {
|
|
595
|
+
return new v.Promise(function(u, i) {
|
|
596
|
+
var d = [], w = c._internalType, S = c._outputType, x = c._mimeType;
|
|
597
|
+
c.on("data", function(F, I) {
|
|
598
|
+
d.push(F), n && n(I);
|
|
599
599
|
}).on("error", function(F) {
|
|
600
|
-
|
|
600
|
+
d = [], i(F);
|
|
601
601
|
}).on("end", function() {
|
|
602
602
|
try {
|
|
603
603
|
var F = function(I, j, O) {
|
|
@@ -610,7 +610,7 @@ var Ct = { exports: {} };
|
|
|
610
610
|
return l.transformTo(I, j);
|
|
611
611
|
}
|
|
612
612
|
}(S, function(I, j) {
|
|
613
|
-
var O, W = 0,
|
|
613
|
+
var O, W = 0, J = null, g = 0;
|
|
614
614
|
for (O = 0; O < j.length; O++) g += j[O].length;
|
|
615
615
|
switch (I) {
|
|
616
616
|
case "string":
|
|
@@ -618,55 +618,55 @@ var Ct = { exports: {} };
|
|
|
618
618
|
case "array":
|
|
619
619
|
return Array.prototype.concat.apply([], j);
|
|
620
620
|
case "uint8array":
|
|
621
|
-
for (
|
|
622
|
-
return
|
|
621
|
+
for (J = new Uint8Array(g), O = 0; O < j.length; O++) J.set(j[O], W), W += j[O].length;
|
|
622
|
+
return J;
|
|
623
623
|
case "nodebuffer":
|
|
624
624
|
return ut.concat(j);
|
|
625
625
|
default:
|
|
626
626
|
throw new Error("concat : unsupported type '" + I + "'");
|
|
627
627
|
}
|
|
628
|
-
}(w,
|
|
628
|
+
}(w, d), x);
|
|
629
629
|
u(F);
|
|
630
630
|
} catch (I) {
|
|
631
|
-
|
|
631
|
+
i(I);
|
|
632
632
|
}
|
|
633
|
-
|
|
633
|
+
d = [];
|
|
634
634
|
}).resume();
|
|
635
635
|
});
|
|
636
636
|
}
|
|
637
|
-
function
|
|
638
|
-
var
|
|
637
|
+
function s(c, n, u) {
|
|
638
|
+
var i = n;
|
|
639
639
|
switch (n) {
|
|
640
640
|
case "blob":
|
|
641
641
|
case "arraybuffer":
|
|
642
|
-
|
|
642
|
+
i = "uint8array";
|
|
643
643
|
break;
|
|
644
644
|
case "base64":
|
|
645
|
-
|
|
645
|
+
i = "string";
|
|
646
646
|
}
|
|
647
647
|
try {
|
|
648
|
-
this._internalType =
|
|
649
|
-
} catch (
|
|
650
|
-
this._worker = new r("error"), this._worker.error(
|
|
648
|
+
this._internalType = i, this._outputType = n, this._mimeType = u, l.checkSupport(i), this._worker = c.pipe(new a(i)), c.lock();
|
|
649
|
+
} catch (d) {
|
|
650
|
+
this._worker = new r("error"), this._worker.error(d);
|
|
651
651
|
}
|
|
652
652
|
}
|
|
653
|
-
|
|
654
|
-
return b(this,
|
|
655
|
-
}, on: function(
|
|
653
|
+
s.prototype = { accumulate: function(c) {
|
|
654
|
+
return b(this, c);
|
|
655
|
+
}, on: function(c, n) {
|
|
656
656
|
var u = this;
|
|
657
|
-
return
|
|
658
|
-
n.call(u,
|
|
659
|
-
}) : this._worker.on(
|
|
657
|
+
return c === "data" ? this._worker.on(c, function(i) {
|
|
658
|
+
n.call(u, i.data, i.meta);
|
|
659
|
+
}) : this._worker.on(c, function() {
|
|
660
660
|
l.delay(n, arguments, u);
|
|
661
661
|
}), this;
|
|
662
662
|
}, resume: function() {
|
|
663
663
|
return l.delay(this._worker.resume, [], this._worker), this;
|
|
664
664
|
}, pause: function() {
|
|
665
665
|
return this._worker.pause(), this;
|
|
666
|
-
}, toNodejsStream: function(
|
|
666
|
+
}, toNodejsStream: function(c) {
|
|
667
667
|
if (l.checkSupport("nodestream"), this._outputType !== "nodebuffer") throw new Error(this._outputType + " is not supported by this method");
|
|
668
|
-
return new
|
|
669
|
-
} }, R.exports =
|
|
668
|
+
return new m(this, { objectMode: this._outputType !== "nodebuffer" }, c);
|
|
669
|
+
} }, R.exports = s;
|
|
670
670
|
}, { "../base64": 1, "../external": 6, "../nodejs/NodejsStreamOutputAdapter": 13, "../support": 30, "../utils": 32, "./ConvertWorker": 24, "./GenericWorker": 28 }], 30: [function(_, R, y) {
|
|
671
671
|
if (y.base64 = !0, y.array = !0, y.string = !0, y.arraybuffer = typeof ArrayBuffer < "u" && typeof Uint8Array < "u", y.nodebuffer = typeof ut < "u", y.uint8array = typeof Uint8Array < "u", typeof ArrayBuffer > "u") y.blob = !1;
|
|
672
672
|
else {
|
|
@@ -688,59 +688,59 @@ var Ct = { exports: {} };
|
|
|
688
688
|
y.nodestream = !1;
|
|
689
689
|
}
|
|
690
690
|
}, { "readable-stream": 16 }], 31: [function(_, R, y) {
|
|
691
|
-
for (var l = _("./utils"), a = _("./support"), r = _("./nodejsUtils"), h = _("./stream/GenericWorker"),
|
|
692
|
-
|
|
693
|
-
function
|
|
691
|
+
for (var l = _("./utils"), a = _("./support"), r = _("./nodejsUtils"), h = _("./stream/GenericWorker"), p = new Array(256), v = 0; v < 256; v++) p[v] = 252 <= v ? 6 : 248 <= v ? 5 : 240 <= v ? 4 : 224 <= v ? 3 : 192 <= v ? 2 : 1;
|
|
692
|
+
p[254] = p[254] = 1;
|
|
693
|
+
function m() {
|
|
694
694
|
h.call(this, "utf-8 decode"), this.leftOver = null;
|
|
695
695
|
}
|
|
696
696
|
function b() {
|
|
697
697
|
h.call(this, "utf-8 encode");
|
|
698
698
|
}
|
|
699
|
-
y.utf8encode = function(
|
|
700
|
-
return a.nodebuffer ? r.newBufferFrom(
|
|
701
|
-
var n, u,
|
|
702
|
-
for (
|
|
703
|
-
for (n = a.uint8array ? new Uint8Array(x) : new Array(x),
|
|
699
|
+
y.utf8encode = function(s) {
|
|
700
|
+
return a.nodebuffer ? r.newBufferFrom(s, "utf-8") : function(c) {
|
|
701
|
+
var n, u, i, d, w, S = c.length, x = 0;
|
|
702
|
+
for (d = 0; d < S; d++) (64512 & (u = c.charCodeAt(d))) == 55296 && d + 1 < S && (64512 & (i = c.charCodeAt(d + 1))) == 56320 && (u = 65536 + (u - 55296 << 10) + (i - 56320), d++), x += u < 128 ? 1 : u < 2048 ? 2 : u < 65536 ? 3 : 4;
|
|
703
|
+
for (n = a.uint8array ? new Uint8Array(x) : new Array(x), d = w = 0; w < x; d++) (64512 & (u = c.charCodeAt(d))) == 55296 && d + 1 < S && (64512 & (i = c.charCodeAt(d + 1))) == 56320 && (u = 65536 + (u - 55296 << 10) + (i - 56320), d++), u < 128 ? n[w++] = u : (u < 2048 ? n[w++] = 192 | u >>> 6 : (u < 65536 ? n[w++] = 224 | u >>> 12 : (n[w++] = 240 | u >>> 18, n[w++] = 128 | u >>> 12 & 63), n[w++] = 128 | u >>> 6 & 63), n[w++] = 128 | 63 & u);
|
|
704
704
|
return n;
|
|
705
|
-
}(
|
|
706
|
-
}, y.utf8decode = function(
|
|
707
|
-
return a.nodebuffer ? l.transformTo("nodebuffer",
|
|
708
|
-
var n, u,
|
|
709
|
-
for (n = u = 0; n < w; ) if ((
|
|
710
|
-
else if (4 < (
|
|
705
|
+
}(s);
|
|
706
|
+
}, y.utf8decode = function(s) {
|
|
707
|
+
return a.nodebuffer ? l.transformTo("nodebuffer", s).toString("utf-8") : function(c) {
|
|
708
|
+
var n, u, i, d, w = c.length, S = new Array(2 * w);
|
|
709
|
+
for (n = u = 0; n < w; ) if ((i = c[n++]) < 128) S[u++] = i;
|
|
710
|
+
else if (4 < (d = p[i])) S[u++] = 65533, n += d - 1;
|
|
711
711
|
else {
|
|
712
|
-
for (
|
|
713
|
-
1 <
|
|
712
|
+
for (i &= d === 2 ? 31 : d === 3 ? 15 : 7; 1 < d && n < w; ) i = i << 6 | 63 & c[n++], d--;
|
|
713
|
+
1 < d ? S[u++] = 65533 : i < 65536 ? S[u++] = i : (i -= 65536, S[u++] = 55296 | i >> 10 & 1023, S[u++] = 56320 | 1023 & i);
|
|
714
714
|
}
|
|
715
715
|
return S.length !== u && (S.subarray ? S = S.subarray(0, u) : S.length = u), l.applyFromCharCode(S);
|
|
716
|
-
}(
|
|
717
|
-
}, l.inherits(
|
|
718
|
-
var
|
|
716
|
+
}(s = l.transformTo(a.uint8array ? "uint8array" : "array", s));
|
|
717
|
+
}, l.inherits(m, h), m.prototype.processChunk = function(s) {
|
|
718
|
+
var c = l.transformTo(a.uint8array ? "uint8array" : "array", s.data);
|
|
719
719
|
if (this.leftOver && this.leftOver.length) {
|
|
720
720
|
if (a.uint8array) {
|
|
721
|
-
var n =
|
|
722
|
-
(
|
|
723
|
-
} else
|
|
721
|
+
var n = c;
|
|
722
|
+
(c = new Uint8Array(n.length + this.leftOver.length)).set(this.leftOver, 0), c.set(n, this.leftOver.length);
|
|
723
|
+
} else c = this.leftOver.concat(c);
|
|
724
724
|
this.leftOver = null;
|
|
725
725
|
}
|
|
726
|
-
var u = function(
|
|
726
|
+
var u = function(d, w) {
|
|
727
727
|
var S;
|
|
728
|
-
for ((w = w ||
|
|
729
|
-
return S < 0 || S === 0 ? w : S +
|
|
730
|
-
}(
|
|
731
|
-
u !==
|
|
732
|
-
},
|
|
728
|
+
for ((w = w || d.length) > d.length && (w = d.length), S = w - 1; 0 <= S && (192 & d[S]) == 128; ) S--;
|
|
729
|
+
return S < 0 || S === 0 ? w : S + p[d[S]] > w ? S : w;
|
|
730
|
+
}(c), i = c;
|
|
731
|
+
u !== c.length && (a.uint8array ? (i = c.subarray(0, u), this.leftOver = c.subarray(u, c.length)) : (i = c.slice(0, u), this.leftOver = c.slice(u, c.length))), this.push({ data: y.utf8decode(i), meta: s.meta });
|
|
732
|
+
}, m.prototype.flush = function() {
|
|
733
733
|
this.leftOver && this.leftOver.length && (this.push({ data: y.utf8decode(this.leftOver), meta: {} }), this.leftOver = null);
|
|
734
|
-
}, y.Utf8DecodeWorker =
|
|
735
|
-
this.push({ data: y.utf8encode(
|
|
734
|
+
}, y.Utf8DecodeWorker = m, l.inherits(b, h), b.prototype.processChunk = function(s) {
|
|
735
|
+
this.push({ data: y.utf8encode(s.data), meta: s.meta });
|
|
736
736
|
}, y.Utf8EncodeWorker = b;
|
|
737
737
|
}, { "./nodejsUtils": 14, "./stream/GenericWorker": 28, "./support": 30, "./utils": 32 }], 32: [function(_, R, y) {
|
|
738
738
|
var l = _("./support"), a = _("./base64"), r = _("./nodejsUtils"), h = _("./external");
|
|
739
|
-
function
|
|
739
|
+
function p(n) {
|
|
740
740
|
return n;
|
|
741
741
|
}
|
|
742
742
|
function v(n, u) {
|
|
743
|
-
for (var
|
|
743
|
+
for (var i = 0; i < n.length; ++i) u[i] = 255 & n.charCodeAt(i);
|
|
744
744
|
return u;
|
|
745
745
|
}
|
|
746
746
|
_("setimmediate"), y.newBlob = function(n, u) {
|
|
@@ -749,20 +749,20 @@ var Ct = { exports: {} };
|
|
|
749
749
|
return new Blob([n], { type: u });
|
|
750
750
|
} catch {
|
|
751
751
|
try {
|
|
752
|
-
var
|
|
753
|
-
return
|
|
752
|
+
var i = new (self.BlobBuilder || self.WebKitBlobBuilder || self.MozBlobBuilder || self.MSBlobBuilder)();
|
|
753
|
+
return i.append(n), i.getBlob(u);
|
|
754
754
|
} catch {
|
|
755
755
|
throw new Error("Bug : can't construct the Blob.");
|
|
756
756
|
}
|
|
757
757
|
}
|
|
758
758
|
};
|
|
759
|
-
var
|
|
760
|
-
var
|
|
761
|
-
if (S <=
|
|
762
|
-
for (; w < S; ) u === "array" || u === "nodebuffer" ?
|
|
763
|
-
return
|
|
759
|
+
var m = { stringifyByChunk: function(n, u, i) {
|
|
760
|
+
var d = [], w = 0, S = n.length;
|
|
761
|
+
if (S <= i) return String.fromCharCode.apply(null, n);
|
|
762
|
+
for (; w < S; ) u === "array" || u === "nodebuffer" ? d.push(String.fromCharCode.apply(null, n.slice(w, Math.min(w + i, S)))) : d.push(String.fromCharCode.apply(null, n.subarray(w, Math.min(w + i, S)))), w += i;
|
|
763
|
+
return d.join("");
|
|
764
764
|
}, stringifyByChar: function(n) {
|
|
765
|
-
for (var u = "",
|
|
765
|
+
for (var u = "", i = 0; i < n.length; i++) u += String.fromCharCode(n[i]);
|
|
766
766
|
return u;
|
|
767
767
|
}, applyCanBeUsed: { uint8array: function() {
|
|
768
768
|
try {
|
|
@@ -778,86 +778,86 @@ var Ct = { exports: {} };
|
|
|
778
778
|
}
|
|
779
779
|
}() } };
|
|
780
780
|
function b(n) {
|
|
781
|
-
var u = 65536,
|
|
782
|
-
if (
|
|
783
|
-
return
|
|
781
|
+
var u = 65536, i = y.getTypeOf(n), d = !0;
|
|
782
|
+
if (i === "uint8array" ? d = m.applyCanBeUsed.uint8array : i === "nodebuffer" && (d = m.applyCanBeUsed.nodebuffer), d) for (; 1 < u; ) try {
|
|
783
|
+
return m.stringifyByChunk(n, i, u);
|
|
784
784
|
} catch {
|
|
785
785
|
u = Math.floor(u / 2);
|
|
786
786
|
}
|
|
787
|
-
return
|
|
787
|
+
return m.stringifyByChar(n);
|
|
788
788
|
}
|
|
789
|
-
function
|
|
790
|
-
for (var
|
|
789
|
+
function s(n, u) {
|
|
790
|
+
for (var i = 0; i < n.length; i++) u[i] = n[i];
|
|
791
791
|
return u;
|
|
792
792
|
}
|
|
793
793
|
y.applyFromCharCode = b;
|
|
794
|
-
var
|
|
795
|
-
|
|
794
|
+
var c = {};
|
|
795
|
+
c.string = { string: p, array: function(n) {
|
|
796
796
|
return v(n, new Array(n.length));
|
|
797
797
|
}, arraybuffer: function(n) {
|
|
798
|
-
return
|
|
798
|
+
return c.string.uint8array(n).buffer;
|
|
799
799
|
}, uint8array: function(n) {
|
|
800
800
|
return v(n, new Uint8Array(n.length));
|
|
801
801
|
}, nodebuffer: function(n) {
|
|
802
802
|
return v(n, r.allocBuffer(n.length));
|
|
803
|
-
} },
|
|
803
|
+
} }, c.array = { string: b, array: p, arraybuffer: function(n) {
|
|
804
804
|
return new Uint8Array(n).buffer;
|
|
805
805
|
}, uint8array: function(n) {
|
|
806
806
|
return new Uint8Array(n);
|
|
807
807
|
}, nodebuffer: function(n) {
|
|
808
808
|
return r.newBufferFrom(n);
|
|
809
|
-
} },
|
|
809
|
+
} }, c.arraybuffer = { string: function(n) {
|
|
810
810
|
return b(new Uint8Array(n));
|
|
811
811
|
}, array: function(n) {
|
|
812
|
-
return
|
|
813
|
-
}, arraybuffer:
|
|
812
|
+
return s(new Uint8Array(n), new Array(n.byteLength));
|
|
813
|
+
}, arraybuffer: p, uint8array: function(n) {
|
|
814
814
|
return new Uint8Array(n);
|
|
815
815
|
}, nodebuffer: function(n) {
|
|
816
816
|
return r.newBufferFrom(new Uint8Array(n));
|
|
817
|
-
} },
|
|
818
|
-
return
|
|
817
|
+
} }, c.uint8array = { string: b, array: function(n) {
|
|
818
|
+
return s(n, new Array(n.length));
|
|
819
819
|
}, arraybuffer: function(n) {
|
|
820
820
|
return n.buffer;
|
|
821
|
-
}, uint8array:
|
|
821
|
+
}, uint8array: p, nodebuffer: function(n) {
|
|
822
822
|
return r.newBufferFrom(n);
|
|
823
|
-
} },
|
|
824
|
-
return
|
|
823
|
+
} }, c.nodebuffer = { string: b, array: function(n) {
|
|
824
|
+
return s(n, new Array(n.length));
|
|
825
825
|
}, arraybuffer: function(n) {
|
|
826
|
-
return
|
|
826
|
+
return c.nodebuffer.uint8array(n).buffer;
|
|
827
827
|
}, uint8array: function(n) {
|
|
828
|
-
return
|
|
829
|
-
}, nodebuffer:
|
|
828
|
+
return s(n, new Uint8Array(n.length));
|
|
829
|
+
}, nodebuffer: p }, y.transformTo = function(n, u) {
|
|
830
830
|
if (u = u || "", !n) return u;
|
|
831
831
|
y.checkSupport(n);
|
|
832
|
-
var
|
|
833
|
-
return
|
|
832
|
+
var i = y.getTypeOf(u);
|
|
833
|
+
return c[i][n](u);
|
|
834
834
|
}, y.resolve = function(n) {
|
|
835
|
-
for (var u = n.split("/"),
|
|
836
|
-
var w = u[
|
|
837
|
-
w === "." || w === "" &&
|
|
835
|
+
for (var u = n.split("/"), i = [], d = 0; d < u.length; d++) {
|
|
836
|
+
var w = u[d];
|
|
837
|
+
w === "." || w === "" && d !== 0 && d !== u.length - 1 || (w === ".." ? i.pop() : i.push(w));
|
|
838
838
|
}
|
|
839
|
-
return
|
|
839
|
+
return i.join("/");
|
|
840
840
|
}, y.getTypeOf = function(n) {
|
|
841
841
|
return typeof n == "string" ? "string" : Object.prototype.toString.call(n) === "[object Array]" ? "array" : l.nodebuffer && r.isBuffer(n) ? "nodebuffer" : l.uint8array && n instanceof Uint8Array ? "uint8array" : l.arraybuffer && n instanceof ArrayBuffer ? "arraybuffer" : void 0;
|
|
842
842
|
}, y.checkSupport = function(n) {
|
|
843
843
|
if (!l[n.toLowerCase()]) throw new Error(n + " is not supported by this platform");
|
|
844
844
|
}, y.MAX_VALUE_16BITS = 65535, y.MAX_VALUE_32BITS = -1, y.pretty = function(n) {
|
|
845
|
-
var u,
|
|
846
|
-
for (
|
|
847
|
-
return
|
|
848
|
-
}, y.delay = function(n, u,
|
|
845
|
+
var u, i, d = "";
|
|
846
|
+
for (i = 0; i < (n || "").length; i++) d += "\\x" + ((u = n.charCodeAt(i)) < 16 ? "0" : "") + u.toString(16).toUpperCase();
|
|
847
|
+
return d;
|
|
848
|
+
}, y.delay = function(n, u, i) {
|
|
849
849
|
setImmediate(function() {
|
|
850
|
-
n.apply(
|
|
850
|
+
n.apply(i || null, u || []);
|
|
851
851
|
});
|
|
852
852
|
}, y.inherits = function(n, u) {
|
|
853
|
-
function
|
|
853
|
+
function i() {
|
|
854
854
|
}
|
|
855
|
-
|
|
855
|
+
i.prototype = u.prototype, n.prototype = new i();
|
|
856
856
|
}, y.extend = function() {
|
|
857
|
-
var n, u,
|
|
858
|
-
for (n = 0; n < arguments.length; n++) for (u in arguments[n]) Object.prototype.hasOwnProperty.call(arguments[n], u) &&
|
|
859
|
-
return
|
|
860
|
-
}, y.prepareContent = function(n, u,
|
|
857
|
+
var n, u, i = {};
|
|
858
|
+
for (n = 0; n < arguments.length; n++) for (u in arguments[n]) Object.prototype.hasOwnProperty.call(arguments[n], u) && i[u] === void 0 && (i[u] = arguments[n][u]);
|
|
859
|
+
return i;
|
|
860
|
+
}, y.prepareContent = function(n, u, i, d, w) {
|
|
861
861
|
return h.Promise.resolve(u).then(function(S) {
|
|
862
862
|
return l.blob && (S instanceof Blob || ["[object File]", "[object Blob]"].indexOf(Object.prototype.toString.call(S)) !== -1) && typeof FileReader < "u" ? new h.Promise(function(x, F) {
|
|
863
863
|
var I = new FileReader();
|
|
@@ -869,314 +869,314 @@ var Ct = { exports: {} };
|
|
|
869
869
|
}) : S;
|
|
870
870
|
}).then(function(S) {
|
|
871
871
|
var x = y.getTypeOf(S);
|
|
872
|
-
return x ? (x === "arraybuffer" ? S = y.transformTo("uint8array", S) : x === "string" && (w ? S = a.decode(S) :
|
|
872
|
+
return x ? (x === "arraybuffer" ? S = y.transformTo("uint8array", S) : x === "string" && (w ? S = a.decode(S) : i && d !== !0 && (S = function(F) {
|
|
873
873
|
return v(F, l.uint8array ? new Uint8Array(F.length) : new Array(F.length));
|
|
874
874
|
}(S))), S) : h.Promise.reject(new Error("Can't read the data of '" + n + "'. Is it in a supported JavaScript type (String, Blob, ArrayBuffer, etc) ?"));
|
|
875
875
|
});
|
|
876
876
|
};
|
|
877
877
|
}, { "./base64": 1, "./external": 6, "./nodejsUtils": 14, "./support": 30, setimmediate: 54 }], 33: [function(_, R, y) {
|
|
878
|
-
var l = _("./reader/readerFor"), a = _("./utils"), r = _("./signature"), h = _("./zipEntry"),
|
|
879
|
-
function v(
|
|
880
|
-
this.files = [], this.loadOptions =
|
|
878
|
+
var l = _("./reader/readerFor"), a = _("./utils"), r = _("./signature"), h = _("./zipEntry"), p = _("./support");
|
|
879
|
+
function v(m) {
|
|
880
|
+
this.files = [], this.loadOptions = m;
|
|
881
881
|
}
|
|
882
|
-
v.prototype = { checkSignature: function(
|
|
883
|
-
if (!this.reader.readAndCheckSignature(
|
|
882
|
+
v.prototype = { checkSignature: function(m) {
|
|
883
|
+
if (!this.reader.readAndCheckSignature(m)) {
|
|
884
884
|
this.reader.index -= 4;
|
|
885
885
|
var b = this.reader.readString(4);
|
|
886
|
-
throw new Error("Corrupted zip or bug: unexpected signature (" + a.pretty(b) + ", expected " + a.pretty(
|
|
886
|
+
throw new Error("Corrupted zip or bug: unexpected signature (" + a.pretty(b) + ", expected " + a.pretty(m) + ")");
|
|
887
887
|
}
|
|
888
|
-
}, isSignature: function(
|
|
889
|
-
var
|
|
890
|
-
this.reader.setIndex(
|
|
891
|
-
var
|
|
892
|
-
return this.reader.setIndex(
|
|
888
|
+
}, isSignature: function(m, b) {
|
|
889
|
+
var s = this.reader.index;
|
|
890
|
+
this.reader.setIndex(m);
|
|
891
|
+
var c = this.reader.readString(4) === b;
|
|
892
|
+
return this.reader.setIndex(s), c;
|
|
893
893
|
}, readBlockEndOfCentral: function() {
|
|
894
894
|
this.diskNumber = this.reader.readInt(2), this.diskWithCentralDirStart = this.reader.readInt(2), this.centralDirRecordsOnThisDisk = this.reader.readInt(2), this.centralDirRecords = this.reader.readInt(2), this.centralDirSize = this.reader.readInt(4), this.centralDirOffset = this.reader.readInt(4), this.zipCommentLength = this.reader.readInt(2);
|
|
895
|
-
var
|
|
896
|
-
this.zipComment = this.loadOptions.decodeFileName(
|
|
895
|
+
var m = this.reader.readData(this.zipCommentLength), b = p.uint8array ? "uint8array" : "array", s = a.transformTo(b, m);
|
|
896
|
+
this.zipComment = this.loadOptions.decodeFileName(s);
|
|
897
897
|
}, readBlockZip64EndOfCentral: function() {
|
|
898
898
|
this.zip64EndOfCentralSize = this.reader.readInt(8), this.reader.skip(4), this.diskNumber = this.reader.readInt(4), this.diskWithCentralDirStart = this.reader.readInt(4), this.centralDirRecordsOnThisDisk = this.reader.readInt(8), this.centralDirRecords = this.reader.readInt(8), this.centralDirSize = this.reader.readInt(8), this.centralDirOffset = this.reader.readInt(8), this.zip64ExtensibleData = {};
|
|
899
|
-
for (var
|
|
899
|
+
for (var m, b, s, c = this.zip64EndOfCentralSize - 44; 0 < c; ) m = this.reader.readInt(2), b = this.reader.readInt(4), s = this.reader.readData(b), this.zip64ExtensibleData[m] = { id: m, length: b, value: s };
|
|
900
900
|
}, readBlockZip64EndOfCentralLocator: function() {
|
|
901
901
|
if (this.diskWithZip64CentralDirStart = this.reader.readInt(4), this.relativeOffsetEndOfZip64CentralDir = this.reader.readInt(8), this.disksCount = this.reader.readInt(4), 1 < this.disksCount) throw new Error("Multi-volumes zip are not supported");
|
|
902
902
|
}, readLocalFiles: function() {
|
|
903
|
-
var
|
|
904
|
-
for (
|
|
903
|
+
var m, b;
|
|
904
|
+
for (m = 0; m < this.files.length; m++) b = this.files[m], this.reader.setIndex(b.localHeaderOffset), this.checkSignature(r.LOCAL_FILE_HEADER), b.readLocalPart(this.reader), b.handleUTF8(), b.processAttributes();
|
|
905
905
|
}, readCentralDir: function() {
|
|
906
|
-
var
|
|
907
|
-
for (this.reader.setIndex(this.centralDirOffset); this.reader.readAndCheckSignature(r.CENTRAL_FILE_HEADER); ) (
|
|
906
|
+
var m;
|
|
907
|
+
for (this.reader.setIndex(this.centralDirOffset); this.reader.readAndCheckSignature(r.CENTRAL_FILE_HEADER); ) (m = new h({ zip64: this.zip64 }, this.loadOptions)).readCentralPart(this.reader), this.files.push(m);
|
|
908
908
|
if (this.centralDirRecords !== this.files.length && this.centralDirRecords !== 0 && this.files.length === 0) throw new Error("Corrupted zip or bug: expected " + this.centralDirRecords + " records in central dir, got " + this.files.length);
|
|
909
909
|
}, readEndOfCentral: function() {
|
|
910
|
-
var
|
|
911
|
-
if (
|
|
912
|
-
this.reader.setIndex(
|
|
913
|
-
var b =
|
|
910
|
+
var m = this.reader.lastIndexOfSignature(r.CENTRAL_DIRECTORY_END);
|
|
911
|
+
if (m < 0) throw this.isSignature(0, r.LOCAL_FILE_HEADER) ? new Error("Corrupted zip: can't find end of central directory") : new Error("Can't find end of central directory : is this a zip file ? If it is, see https://stuk.github.io/jszip/documentation/howto/read_zip.html");
|
|
912
|
+
this.reader.setIndex(m);
|
|
913
|
+
var b = m;
|
|
914
914
|
if (this.checkSignature(r.CENTRAL_DIRECTORY_END), this.readBlockEndOfCentral(), this.diskNumber === a.MAX_VALUE_16BITS || this.diskWithCentralDirStart === a.MAX_VALUE_16BITS || this.centralDirRecordsOnThisDisk === a.MAX_VALUE_16BITS || this.centralDirRecords === a.MAX_VALUE_16BITS || this.centralDirSize === a.MAX_VALUE_32BITS || this.centralDirOffset === a.MAX_VALUE_32BITS) {
|
|
915
|
-
if (this.zip64 = !0, (
|
|
916
|
-
if (this.reader.setIndex(
|
|
915
|
+
if (this.zip64 = !0, (m = this.reader.lastIndexOfSignature(r.ZIP64_CENTRAL_DIRECTORY_LOCATOR)) < 0) throw new Error("Corrupted zip: can't find the ZIP64 end of central directory locator");
|
|
916
|
+
if (this.reader.setIndex(m), this.checkSignature(r.ZIP64_CENTRAL_DIRECTORY_LOCATOR), this.readBlockZip64EndOfCentralLocator(), !this.isSignature(this.relativeOffsetEndOfZip64CentralDir, r.ZIP64_CENTRAL_DIRECTORY_END) && (this.relativeOffsetEndOfZip64CentralDir = this.reader.lastIndexOfSignature(r.ZIP64_CENTRAL_DIRECTORY_END), this.relativeOffsetEndOfZip64CentralDir < 0)) throw new Error("Corrupted zip: can't find the ZIP64 end of central directory");
|
|
917
917
|
this.reader.setIndex(this.relativeOffsetEndOfZip64CentralDir), this.checkSignature(r.ZIP64_CENTRAL_DIRECTORY_END), this.readBlockZip64EndOfCentral();
|
|
918
918
|
}
|
|
919
|
-
var
|
|
920
|
-
this.zip64 && (
|
|
921
|
-
var
|
|
922
|
-
if (0 <
|
|
923
|
-
else if (
|
|
924
|
-
}, prepareReader: function(
|
|
925
|
-
this.reader = l(
|
|
926
|
-
}, load: function(
|
|
927
|
-
this.prepareReader(
|
|
919
|
+
var s = this.centralDirOffset + this.centralDirSize;
|
|
920
|
+
this.zip64 && (s += 20, s += 12 + this.zip64EndOfCentralSize);
|
|
921
|
+
var c = b - s;
|
|
922
|
+
if (0 < c) this.isSignature(b, r.CENTRAL_FILE_HEADER) || (this.reader.zero = c);
|
|
923
|
+
else if (c < 0) throw new Error("Corrupted zip: missing " + Math.abs(c) + " bytes.");
|
|
924
|
+
}, prepareReader: function(m) {
|
|
925
|
+
this.reader = l(m);
|
|
926
|
+
}, load: function(m) {
|
|
927
|
+
this.prepareReader(m), this.readEndOfCentral(), this.readCentralDir(), this.readLocalFiles();
|
|
928
928
|
} }, R.exports = v;
|
|
929
929
|
}, { "./reader/readerFor": 22, "./signature": 23, "./support": 30, "./utils": 32, "./zipEntry": 34 }], 34: [function(_, R, y) {
|
|
930
|
-
var l = _("./reader/readerFor"), a = _("./utils"), r = _("./compressedObject"), h = _("./crc32"),
|
|
931
|
-
function b(
|
|
932
|
-
this.options =
|
|
930
|
+
var l = _("./reader/readerFor"), a = _("./utils"), r = _("./compressedObject"), h = _("./crc32"), p = _("./utf8"), v = _("./compressions"), m = _("./support");
|
|
931
|
+
function b(s, c) {
|
|
932
|
+
this.options = s, this.loadOptions = c;
|
|
933
933
|
}
|
|
934
934
|
b.prototype = { isEncrypted: function() {
|
|
935
935
|
return (1 & this.bitFlag) == 1;
|
|
936
936
|
}, useUTF8: function() {
|
|
937
937
|
return (2048 & this.bitFlag) == 2048;
|
|
938
|
-
}, readLocalPart: function(
|
|
939
|
-
var
|
|
940
|
-
if (
|
|
941
|
-
if ((
|
|
942
|
-
for (var
|
|
938
|
+
}, readLocalPart: function(s) {
|
|
939
|
+
var c, n;
|
|
940
|
+
if (s.skip(22), this.fileNameLength = s.readInt(2), n = s.readInt(2), this.fileName = s.readData(this.fileNameLength), s.skip(n), this.compressedSize === -1 || this.uncompressedSize === -1) throw new Error("Bug or corrupted zip : didn't get enough information from the central directory (compressedSize === -1 || uncompressedSize === -1)");
|
|
941
|
+
if ((c = function(u) {
|
|
942
|
+
for (var i in v) if (Object.prototype.hasOwnProperty.call(v, i) && v[i].magic === u) return v[i];
|
|
943
943
|
return null;
|
|
944
944
|
}(this.compressionMethod)) === null) throw new Error("Corrupted zip : compression " + a.pretty(this.compressionMethod) + " unknown (inner file : " + a.transformTo("string", this.fileName) + ")");
|
|
945
|
-
this.decompressed = new r(this.compressedSize, this.uncompressedSize, this.crc32,
|
|
946
|
-
}, readCentralPart: function(
|
|
947
|
-
this.versionMadeBy =
|
|
948
|
-
var
|
|
949
|
-
if (this.extraFieldsLength =
|
|
950
|
-
|
|
945
|
+
this.decompressed = new r(this.compressedSize, this.uncompressedSize, this.crc32, c, s.readData(this.compressedSize));
|
|
946
|
+
}, readCentralPart: function(s) {
|
|
947
|
+
this.versionMadeBy = s.readInt(2), s.skip(2), this.bitFlag = s.readInt(2), this.compressionMethod = s.readString(2), this.date = s.readDate(), this.crc32 = s.readInt(4), this.compressedSize = s.readInt(4), this.uncompressedSize = s.readInt(4);
|
|
948
|
+
var c = s.readInt(2);
|
|
949
|
+
if (this.extraFieldsLength = s.readInt(2), this.fileCommentLength = s.readInt(2), this.diskNumberStart = s.readInt(2), this.internalFileAttributes = s.readInt(2), this.externalFileAttributes = s.readInt(4), this.localHeaderOffset = s.readInt(4), this.isEncrypted()) throw new Error("Encrypted zip are not supported");
|
|
950
|
+
s.skip(c), this.readExtraFields(s), this.parseZIP64ExtraField(s), this.fileComment = s.readData(this.fileCommentLength);
|
|
951
951
|
}, processAttributes: function() {
|
|
952
952
|
this.unixPermissions = null, this.dosPermissions = null;
|
|
953
|
-
var
|
|
954
|
-
this.dir = !!(16 & this.externalFileAttributes),
|
|
953
|
+
var s = this.versionMadeBy >> 8;
|
|
954
|
+
this.dir = !!(16 & this.externalFileAttributes), s == 0 && (this.dosPermissions = 63 & this.externalFileAttributes), s == 3 && (this.unixPermissions = this.externalFileAttributes >> 16 & 65535), this.dir || this.fileNameStr.slice(-1) !== "/" || (this.dir = !0);
|
|
955
955
|
}, parseZIP64ExtraField: function() {
|
|
956
956
|
if (this.extraFields[1]) {
|
|
957
|
-
var
|
|
958
|
-
this.uncompressedSize === a.MAX_VALUE_32BITS && (this.uncompressedSize =
|
|
957
|
+
var s = l(this.extraFields[1].value);
|
|
958
|
+
this.uncompressedSize === a.MAX_VALUE_32BITS && (this.uncompressedSize = s.readInt(8)), this.compressedSize === a.MAX_VALUE_32BITS && (this.compressedSize = s.readInt(8)), this.localHeaderOffset === a.MAX_VALUE_32BITS && (this.localHeaderOffset = s.readInt(8)), this.diskNumberStart === a.MAX_VALUE_32BITS && (this.diskNumberStart = s.readInt(4));
|
|
959
959
|
}
|
|
960
|
-
}, readExtraFields: function(
|
|
961
|
-
var
|
|
962
|
-
for (this.extraFields || (this.extraFields = {});
|
|
963
|
-
|
|
960
|
+
}, readExtraFields: function(s) {
|
|
961
|
+
var c, n, u, i = s.index + this.extraFieldsLength;
|
|
962
|
+
for (this.extraFields || (this.extraFields = {}); s.index + 4 < i; ) c = s.readInt(2), n = s.readInt(2), u = s.readData(n), this.extraFields[c] = { id: c, length: n, value: u };
|
|
963
|
+
s.setIndex(i);
|
|
964
964
|
}, handleUTF8: function() {
|
|
965
|
-
var
|
|
966
|
-
if (this.useUTF8()) this.fileNameStr =
|
|
965
|
+
var s = m.uint8array ? "uint8array" : "array";
|
|
966
|
+
if (this.useUTF8()) this.fileNameStr = p.utf8decode(this.fileName), this.fileCommentStr = p.utf8decode(this.fileComment);
|
|
967
967
|
else {
|
|
968
|
-
var
|
|
969
|
-
if (
|
|
968
|
+
var c = this.findExtraFieldUnicodePath();
|
|
969
|
+
if (c !== null) this.fileNameStr = c;
|
|
970
970
|
else {
|
|
971
|
-
var n = a.transformTo(
|
|
971
|
+
var n = a.transformTo(s, this.fileName);
|
|
972
972
|
this.fileNameStr = this.loadOptions.decodeFileName(n);
|
|
973
973
|
}
|
|
974
974
|
var u = this.findExtraFieldUnicodeComment();
|
|
975
975
|
if (u !== null) this.fileCommentStr = u;
|
|
976
976
|
else {
|
|
977
|
-
var
|
|
978
|
-
this.fileCommentStr = this.loadOptions.decodeFileName(
|
|
977
|
+
var i = a.transformTo(s, this.fileComment);
|
|
978
|
+
this.fileCommentStr = this.loadOptions.decodeFileName(i);
|
|
979
979
|
}
|
|
980
980
|
}
|
|
981
981
|
}, findExtraFieldUnicodePath: function() {
|
|
982
|
-
var
|
|
983
|
-
if (
|
|
984
|
-
var
|
|
985
|
-
return
|
|
982
|
+
var s = this.extraFields[28789];
|
|
983
|
+
if (s) {
|
|
984
|
+
var c = l(s.value);
|
|
985
|
+
return c.readInt(1) !== 1 || h(this.fileName) !== c.readInt(4) ? null : p.utf8decode(c.readData(s.length - 5));
|
|
986
986
|
}
|
|
987
987
|
return null;
|
|
988
988
|
}, findExtraFieldUnicodeComment: function() {
|
|
989
|
-
var
|
|
990
|
-
if (
|
|
991
|
-
var
|
|
992
|
-
return
|
|
989
|
+
var s = this.extraFields[25461];
|
|
990
|
+
if (s) {
|
|
991
|
+
var c = l(s.value);
|
|
992
|
+
return c.readInt(1) !== 1 || h(this.fileComment) !== c.readInt(4) ? null : p.utf8decode(c.readData(s.length - 5));
|
|
993
993
|
}
|
|
994
994
|
return null;
|
|
995
995
|
} }, R.exports = b;
|
|
996
996
|
}, { "./compressedObject": 2, "./compressions": 3, "./crc32": 4, "./reader/readerFor": 22, "./support": 30, "./utf8": 31, "./utils": 32 }], 35: [function(_, R, y) {
|
|
997
|
-
function l(
|
|
998
|
-
this.name =
|
|
997
|
+
function l(c, n, u) {
|
|
998
|
+
this.name = c, this.dir = u.dir, this.date = u.date, this.comment = u.comment, this.unixPermissions = u.unixPermissions, this.dosPermissions = u.dosPermissions, this._data = n, this._dataBinary = u.binary, this.options = { compression: u.compression, compressionOptions: u.compressionOptions };
|
|
999
999
|
}
|
|
1000
|
-
var a = _("./stream/StreamHelper"), r = _("./stream/DataWorker"), h = _("./utf8"),
|
|
1001
|
-
l.prototype = { internalStream: function(
|
|
1000
|
+
var a = _("./stream/StreamHelper"), r = _("./stream/DataWorker"), h = _("./utf8"), p = _("./compressedObject"), v = _("./stream/GenericWorker");
|
|
1001
|
+
l.prototype = { internalStream: function(c) {
|
|
1002
1002
|
var n = null, u = "string";
|
|
1003
1003
|
try {
|
|
1004
|
-
if (!
|
|
1005
|
-
var
|
|
1004
|
+
if (!c) throw new Error("No output type specified.");
|
|
1005
|
+
var i = (u = c.toLowerCase()) === "string" || u === "text";
|
|
1006
1006
|
u !== "binarystring" && u !== "text" || (u = "string"), n = this._decompressWorker();
|
|
1007
|
-
var
|
|
1008
|
-
|
|
1007
|
+
var d = !this._dataBinary;
|
|
1008
|
+
d && !i && (n = n.pipe(new h.Utf8EncodeWorker())), !d && i && (n = n.pipe(new h.Utf8DecodeWorker()));
|
|
1009
1009
|
} catch (w) {
|
|
1010
1010
|
(n = new v("error")).error(w);
|
|
1011
1011
|
}
|
|
1012
1012
|
return new a(n, u, "");
|
|
1013
|
-
}, async: function(
|
|
1014
|
-
return this.internalStream(
|
|
1015
|
-
}, nodeStream: function(
|
|
1016
|
-
return this.internalStream(
|
|
1017
|
-
}, _compressWorker: function(
|
|
1018
|
-
if (this._data instanceof
|
|
1013
|
+
}, async: function(c, n) {
|
|
1014
|
+
return this.internalStream(c).accumulate(n);
|
|
1015
|
+
}, nodeStream: function(c, n) {
|
|
1016
|
+
return this.internalStream(c || "nodebuffer").toNodejsStream(n);
|
|
1017
|
+
}, _compressWorker: function(c, n) {
|
|
1018
|
+
if (this._data instanceof p && this._data.compression.magic === c.magic) return this._data.getCompressedWorker();
|
|
1019
1019
|
var u = this._decompressWorker();
|
|
1020
|
-
return this._dataBinary || (u = u.pipe(new h.Utf8EncodeWorker())),
|
|
1020
|
+
return this._dataBinary || (u = u.pipe(new h.Utf8EncodeWorker())), p.createWorkerFrom(u, c, n);
|
|
1021
1021
|
}, _decompressWorker: function() {
|
|
1022
|
-
return this._data instanceof
|
|
1022
|
+
return this._data instanceof p ? this._data.getContentWorker() : this._data instanceof v ? this._data : new r(this._data);
|
|
1023
1023
|
} };
|
|
1024
|
-
for (var
|
|
1024
|
+
for (var m = ["asText", "asBinary", "asNodeBuffer", "asUint8Array", "asArrayBuffer"], b = function() {
|
|
1025
1025
|
throw new Error("This method has been removed in JSZip 3.0, please check the upgrade guide.");
|
|
1026
|
-
},
|
|
1026
|
+
}, s = 0; s < m.length; s++) l.prototype[m[s]] = b;
|
|
1027
1027
|
R.exports = l;
|
|
1028
1028
|
}, { "./compressedObject": 2, "./stream/DataWorker": 27, "./stream/GenericWorker": 28, "./stream/StreamHelper": 29, "./utf8": 31 }], 36: [function(_, R, y) {
|
|
1029
1029
|
(function(l) {
|
|
1030
1030
|
var a, r, h = l.MutationObserver || l.WebKitMutationObserver;
|
|
1031
1031
|
if (h) {
|
|
1032
|
-
var
|
|
1033
|
-
v.observe(
|
|
1034
|
-
|
|
1032
|
+
var p = 0, v = new h(c), m = l.document.createTextNode("");
|
|
1033
|
+
v.observe(m, { characterData: !0 }), a = function() {
|
|
1034
|
+
m.data = p = ++p % 2;
|
|
1035
1035
|
};
|
|
1036
1036
|
} else if (l.setImmediate || l.MessageChannel === void 0) a = "document" in l && "onreadystatechange" in l.document.createElement("script") ? function() {
|
|
1037
1037
|
var n = l.document.createElement("script");
|
|
1038
1038
|
n.onreadystatechange = function() {
|
|
1039
|
-
|
|
1039
|
+
c(), n.onreadystatechange = null, n.parentNode.removeChild(n), n = null;
|
|
1040
1040
|
}, l.document.documentElement.appendChild(n);
|
|
1041
1041
|
} : function() {
|
|
1042
|
-
setTimeout(
|
|
1042
|
+
setTimeout(c, 0);
|
|
1043
1043
|
};
|
|
1044
1044
|
else {
|
|
1045
1045
|
var b = new l.MessageChannel();
|
|
1046
|
-
b.port1.onmessage =
|
|
1046
|
+
b.port1.onmessage = c, a = function() {
|
|
1047
1047
|
b.port2.postMessage(0);
|
|
1048
1048
|
};
|
|
1049
1049
|
}
|
|
1050
|
-
var
|
|
1051
|
-
function
|
|
1050
|
+
var s = [];
|
|
1051
|
+
function c() {
|
|
1052
1052
|
var n, u;
|
|
1053
1053
|
r = !0;
|
|
1054
|
-
for (var
|
|
1055
|
-
for (u =
|
|
1056
|
-
|
|
1054
|
+
for (var i = s.length; i; ) {
|
|
1055
|
+
for (u = s, s = [], n = -1; ++n < i; ) u[n]();
|
|
1056
|
+
i = s.length;
|
|
1057
1057
|
}
|
|
1058
1058
|
r = !1;
|
|
1059
1059
|
}
|
|
1060
1060
|
R.exports = function(n) {
|
|
1061
|
-
|
|
1061
|
+
s.push(n) !== 1 || r || a();
|
|
1062
1062
|
};
|
|
1063
1063
|
}).call(this, typeof wt < "u" ? wt : typeof self < "u" ? self : typeof window < "u" ? window : {});
|
|
1064
1064
|
}, {}], 37: [function(_, R, y) {
|
|
1065
1065
|
var l = _("immediate");
|
|
1066
1066
|
function a() {
|
|
1067
1067
|
}
|
|
1068
|
-
var r = {}, h = ["REJECTED"],
|
|
1069
|
-
function
|
|
1070
|
-
if (typeof
|
|
1071
|
-
this.state = v, this.queue = [], this.outcome = void 0,
|
|
1068
|
+
var r = {}, h = ["REJECTED"], p = ["FULFILLED"], v = ["PENDING"];
|
|
1069
|
+
function m(i) {
|
|
1070
|
+
if (typeof i != "function") throw new TypeError("resolver must be a function");
|
|
1071
|
+
this.state = v, this.queue = [], this.outcome = void 0, i !== a && n(this, i);
|
|
1072
1072
|
}
|
|
1073
|
-
function b(
|
|
1074
|
-
this.promise =
|
|
1073
|
+
function b(i, d, w) {
|
|
1074
|
+
this.promise = i, typeof d == "function" && (this.onFulfilled = d, this.callFulfilled = this.otherCallFulfilled), typeof w == "function" && (this.onRejected = w, this.callRejected = this.otherCallRejected);
|
|
1075
1075
|
}
|
|
1076
|
-
function i
|
|
1076
|
+
function s(i, d, w) {
|
|
1077
1077
|
l(function() {
|
|
1078
1078
|
var S;
|
|
1079
1079
|
try {
|
|
1080
|
-
S =
|
|
1080
|
+
S = d(w);
|
|
1081
1081
|
} catch (x) {
|
|
1082
|
-
return r.reject(
|
|
1082
|
+
return r.reject(i, x);
|
|
1083
1083
|
}
|
|
1084
|
-
S ===
|
|
1084
|
+
S === i ? r.reject(i, new TypeError("Cannot resolve promise with itself")) : r.resolve(i, S);
|
|
1085
1085
|
});
|
|
1086
1086
|
}
|
|
1087
|
-
function
|
|
1088
|
-
var
|
|
1089
|
-
if (
|
|
1090
|
-
|
|
1087
|
+
function c(i) {
|
|
1088
|
+
var d = i && i.then;
|
|
1089
|
+
if (i && (typeof i == "object" || typeof i == "function") && typeof d == "function") return function() {
|
|
1090
|
+
d.apply(i, arguments);
|
|
1091
1091
|
};
|
|
1092
1092
|
}
|
|
1093
|
-
function n(
|
|
1093
|
+
function n(i, d) {
|
|
1094
1094
|
var w = !1;
|
|
1095
1095
|
function S(I) {
|
|
1096
|
-
w || (w = !0, r.reject(
|
|
1096
|
+
w || (w = !0, r.reject(i, I));
|
|
1097
1097
|
}
|
|
1098
1098
|
function x(I) {
|
|
1099
|
-
w || (w = !0, r.resolve(
|
|
1099
|
+
w || (w = !0, r.resolve(i, I));
|
|
1100
1100
|
}
|
|
1101
1101
|
var F = u(function() {
|
|
1102
|
-
|
|
1102
|
+
d(x, S);
|
|
1103
1103
|
});
|
|
1104
1104
|
F.status === "error" && S(F.value);
|
|
1105
1105
|
}
|
|
1106
|
-
function u(
|
|
1106
|
+
function u(i, d) {
|
|
1107
1107
|
var w = {};
|
|
1108
1108
|
try {
|
|
1109
|
-
w.value =
|
|
1109
|
+
w.value = i(d), w.status = "success";
|
|
1110
1110
|
} catch (S) {
|
|
1111
1111
|
w.status = "error", w.value = S;
|
|
1112
1112
|
}
|
|
1113
1113
|
return w;
|
|
1114
1114
|
}
|
|
1115
|
-
(R.exports =
|
|
1116
|
-
if (typeof
|
|
1117
|
-
var
|
|
1115
|
+
(R.exports = m).prototype.finally = function(i) {
|
|
1116
|
+
if (typeof i != "function") return this;
|
|
1117
|
+
var d = this.constructor;
|
|
1118
1118
|
return this.then(function(w) {
|
|
1119
|
-
return
|
|
1119
|
+
return d.resolve(i()).then(function() {
|
|
1120
1120
|
return w;
|
|
1121
1121
|
});
|
|
1122
1122
|
}, function(w) {
|
|
1123
|
-
return
|
|
1123
|
+
return d.resolve(i()).then(function() {
|
|
1124
1124
|
throw w;
|
|
1125
1125
|
});
|
|
1126
1126
|
});
|
|
1127
|
-
},
|
|
1128
|
-
return this.then(null,
|
|
1129
|
-
},
|
|
1130
|
-
if (typeof
|
|
1127
|
+
}, m.prototype.catch = function(i) {
|
|
1128
|
+
return this.then(null, i);
|
|
1129
|
+
}, m.prototype.then = function(i, d) {
|
|
1130
|
+
if (typeof i != "function" && this.state === p || typeof d != "function" && this.state === h) return this;
|
|
1131
1131
|
var w = new this.constructor(a);
|
|
1132
|
-
return this.state !== v ?
|
|
1133
|
-
}, b.prototype.callFulfilled = function(
|
|
1134
|
-
r.resolve(this.promise,
|
|
1135
|
-
}, b.prototype.otherCallFulfilled = function(
|
|
1136
|
-
|
|
1137
|
-
}, b.prototype.callRejected = function(
|
|
1138
|
-
r.reject(this.promise,
|
|
1139
|
-
}, b.prototype.otherCallRejected = function(
|
|
1140
|
-
|
|
1141
|
-
}, r.resolve = function(
|
|
1142
|
-
var w = u(
|
|
1143
|
-
if (w.status === "error") return r.reject(
|
|
1132
|
+
return this.state !== v ? s(w, this.state === p ? i : d, this.outcome) : this.queue.push(new b(w, i, d)), w;
|
|
1133
|
+
}, b.prototype.callFulfilled = function(i) {
|
|
1134
|
+
r.resolve(this.promise, i);
|
|
1135
|
+
}, b.prototype.otherCallFulfilled = function(i) {
|
|
1136
|
+
s(this.promise, this.onFulfilled, i);
|
|
1137
|
+
}, b.prototype.callRejected = function(i) {
|
|
1138
|
+
r.reject(this.promise, i);
|
|
1139
|
+
}, b.prototype.otherCallRejected = function(i) {
|
|
1140
|
+
s(this.promise, this.onRejected, i);
|
|
1141
|
+
}, r.resolve = function(i, d) {
|
|
1142
|
+
var w = u(c, d);
|
|
1143
|
+
if (w.status === "error") return r.reject(i, w.value);
|
|
1144
1144
|
var S = w.value;
|
|
1145
|
-
if (S) n(
|
|
1145
|
+
if (S) n(i, S);
|
|
1146
1146
|
else {
|
|
1147
|
-
|
|
1148
|
-
for (var x = -1, F =
|
|
1147
|
+
i.state = p, i.outcome = d;
|
|
1148
|
+
for (var x = -1, F = i.queue.length; ++x < F; ) i.queue[x].callFulfilled(d);
|
|
1149
1149
|
}
|
|
1150
|
-
return
|
|
1151
|
-
}, r.reject = function(
|
|
1152
|
-
|
|
1153
|
-
for (var w = -1, S =
|
|
1154
|
-
return
|
|
1155
|
-
},
|
|
1156
|
-
return
|
|
1157
|
-
},
|
|
1158
|
-
var
|
|
1159
|
-
return r.reject(
|
|
1160
|
-
},
|
|
1161
|
-
var
|
|
1162
|
-
if (Object.prototype.toString.call(
|
|
1163
|
-
var w =
|
|
1150
|
+
return i;
|
|
1151
|
+
}, r.reject = function(i, d) {
|
|
1152
|
+
i.state = h, i.outcome = d;
|
|
1153
|
+
for (var w = -1, S = i.queue.length; ++w < S; ) i.queue[w].callRejected(d);
|
|
1154
|
+
return i;
|
|
1155
|
+
}, m.resolve = function(i) {
|
|
1156
|
+
return i instanceof this ? i : r.resolve(new this(a), i);
|
|
1157
|
+
}, m.reject = function(i) {
|
|
1158
|
+
var d = new this(a);
|
|
1159
|
+
return r.reject(d, i);
|
|
1160
|
+
}, m.all = function(i) {
|
|
1161
|
+
var d = this;
|
|
1162
|
+
if (Object.prototype.toString.call(i) !== "[object Array]") return this.reject(new TypeError("must be an array"));
|
|
1163
|
+
var w = i.length, S = !1;
|
|
1164
1164
|
if (!w) return this.resolve([]);
|
|
1165
|
-
for (var x = new Array(w), F = 0, I = -1, j = new this(a); ++I < w; ) O(
|
|
1165
|
+
for (var x = new Array(w), F = 0, I = -1, j = new this(a); ++I < w; ) O(i[I], I);
|
|
1166
1166
|
return j;
|
|
1167
|
-
function O(W,
|
|
1168
|
-
|
|
1169
|
-
x[
|
|
1167
|
+
function O(W, J) {
|
|
1168
|
+
d.resolve(W).then(function(g) {
|
|
1169
|
+
x[J] = g, ++F !== w || S || (S = !0, r.resolve(j, x));
|
|
1170
1170
|
}, function(g) {
|
|
1171
1171
|
S || (S = !0, r.reject(j, g));
|
|
1172
1172
|
});
|
|
1173
1173
|
}
|
|
1174
|
-
},
|
|
1175
|
-
var
|
|
1176
|
-
if (Object.prototype.toString.call(
|
|
1177
|
-
var w =
|
|
1174
|
+
}, m.race = function(i) {
|
|
1175
|
+
var d = this;
|
|
1176
|
+
if (Object.prototype.toString.call(i) !== "[object Array]") return this.reject(new TypeError("must be an array"));
|
|
1177
|
+
var w = i.length, S = !1;
|
|
1178
1178
|
if (!w) return this.resolve([]);
|
|
1179
|
-
for (var x = -1, F = new this(a); ++x < w; ) I =
|
|
1179
|
+
for (var x = -1, F = new this(a); ++x < w; ) I = i[x], d.resolve(I).then(function(j) {
|
|
1180
1180
|
S || (S = !0, r.resolve(F, j));
|
|
1181
1181
|
}, function(j) {
|
|
1182
1182
|
S || (S = !0, r.reject(F, j));
|
|
@@ -1188,99 +1188,99 @@ var Ct = { exports: {} };
|
|
|
1188
1188
|
var l = {};
|
|
1189
1189
|
(0, _("./lib/utils/common").assign)(l, _("./lib/deflate"), _("./lib/inflate"), _("./lib/zlib/constants")), R.exports = l;
|
|
1190
1190
|
}, { "./lib/deflate": 39, "./lib/inflate": 40, "./lib/utils/common": 41, "./lib/zlib/constants": 44 }], 39: [function(_, R, y) {
|
|
1191
|
-
var l = _("./zlib/deflate"), a = _("./utils/common"), r = _("./utils/strings"), h = _("./zlib/messages"),
|
|
1192
|
-
function n(
|
|
1193
|
-
if (!(this instanceof n)) return new n(
|
|
1194
|
-
this.options = a.assign({ level: b, method:
|
|
1195
|
-
var
|
|
1196
|
-
|
|
1197
|
-
var w = l.deflateInit2(this.strm,
|
|
1198
|
-
if (w !==
|
|
1199
|
-
if (
|
|
1191
|
+
var l = _("./zlib/deflate"), a = _("./utils/common"), r = _("./utils/strings"), h = _("./zlib/messages"), p = _("./zlib/zstream"), v = Object.prototype.toString, m = 0, b = -1, s = 0, c = 8;
|
|
1192
|
+
function n(i) {
|
|
1193
|
+
if (!(this instanceof n)) return new n(i);
|
|
1194
|
+
this.options = a.assign({ level: b, method: c, chunkSize: 16384, windowBits: 15, memLevel: 8, strategy: s, to: "" }, i || {});
|
|
1195
|
+
var d = this.options;
|
|
1196
|
+
d.raw && 0 < d.windowBits ? d.windowBits = -d.windowBits : d.gzip && 0 < d.windowBits && d.windowBits < 16 && (d.windowBits += 16), this.err = 0, this.msg = "", this.ended = !1, this.chunks = [], this.strm = new p(), this.strm.avail_out = 0;
|
|
1197
|
+
var w = l.deflateInit2(this.strm, d.level, d.method, d.windowBits, d.memLevel, d.strategy);
|
|
1198
|
+
if (w !== m) throw new Error(h[w]);
|
|
1199
|
+
if (d.header && l.deflateSetHeader(this.strm, d.header), d.dictionary) {
|
|
1200
1200
|
var S;
|
|
1201
|
-
if (S = typeof
|
|
1201
|
+
if (S = typeof d.dictionary == "string" ? r.string2buf(d.dictionary) : v.call(d.dictionary) === "[object ArrayBuffer]" ? new Uint8Array(d.dictionary) : d.dictionary, (w = l.deflateSetDictionary(this.strm, S)) !== m) throw new Error(h[w]);
|
|
1202
1202
|
this._dict_set = !0;
|
|
1203
1203
|
}
|
|
1204
1204
|
}
|
|
1205
|
-
function u(
|
|
1206
|
-
var w = new n(
|
|
1207
|
-
if (w.push(
|
|
1205
|
+
function u(i, d) {
|
|
1206
|
+
var w = new n(d);
|
|
1207
|
+
if (w.push(i, !0), w.err) throw w.msg || h[w.err];
|
|
1208
1208
|
return w.result;
|
|
1209
1209
|
}
|
|
1210
|
-
n.prototype.push = function(
|
|
1210
|
+
n.prototype.push = function(i, d) {
|
|
1211
1211
|
var w, S, x = this.strm, F = this.options.chunkSize;
|
|
1212
1212
|
if (this.ended) return !1;
|
|
1213
|
-
S =
|
|
1213
|
+
S = d === ~~d ? d : d === !0 ? 4 : 0, typeof i == "string" ? x.input = r.string2buf(i) : v.call(i) === "[object ArrayBuffer]" ? x.input = new Uint8Array(i) : x.input = i, x.next_in = 0, x.avail_in = x.input.length;
|
|
1214
1214
|
do {
|
|
1215
|
-
if (x.avail_out === 0 && (x.output = new a.Buf8(F), x.next_out = 0, x.avail_out = F), (w = l.deflate(x, S)) !== 1 && w !==
|
|
1215
|
+
if (x.avail_out === 0 && (x.output = new a.Buf8(F), x.next_out = 0, x.avail_out = F), (w = l.deflate(x, S)) !== 1 && w !== m) return this.onEnd(w), !(this.ended = !0);
|
|
1216
1216
|
x.avail_out !== 0 && (x.avail_in !== 0 || S !== 4 && S !== 2) || (this.options.to === "string" ? this.onData(r.buf2binstring(a.shrinkBuf(x.output, x.next_out))) : this.onData(a.shrinkBuf(x.output, x.next_out)));
|
|
1217
1217
|
} while ((0 < x.avail_in || x.avail_out === 0) && w !== 1);
|
|
1218
|
-
return S === 4 ? (w = l.deflateEnd(this.strm), this.onEnd(w), this.ended = !0, w ===
|
|
1219
|
-
}, n.prototype.onData = function(
|
|
1220
|
-
this.chunks.push(
|
|
1221
|
-
}, n.prototype.onEnd = function(
|
|
1222
|
-
|
|
1223
|
-
}, y.Deflate = n, y.deflate = u, y.deflateRaw = function(
|
|
1224
|
-
return (
|
|
1225
|
-
}, y.gzip = function(
|
|
1226
|
-
return (
|
|
1218
|
+
return S === 4 ? (w = l.deflateEnd(this.strm), this.onEnd(w), this.ended = !0, w === m) : S !== 2 || (this.onEnd(m), !(x.avail_out = 0));
|
|
1219
|
+
}, n.prototype.onData = function(i) {
|
|
1220
|
+
this.chunks.push(i);
|
|
1221
|
+
}, n.prototype.onEnd = function(i) {
|
|
1222
|
+
i === m && (this.options.to === "string" ? this.result = this.chunks.join("") : this.result = a.flattenChunks(this.chunks)), this.chunks = [], this.err = i, this.msg = this.strm.msg;
|
|
1223
|
+
}, y.Deflate = n, y.deflate = u, y.deflateRaw = function(i, d) {
|
|
1224
|
+
return (d = d || {}).raw = !0, u(i, d);
|
|
1225
|
+
}, y.gzip = function(i, d) {
|
|
1226
|
+
return (d = d || {}).gzip = !0, u(i, d);
|
|
1227
1227
|
};
|
|
1228
1228
|
}, { "./utils/common": 41, "./utils/strings": 42, "./zlib/deflate": 46, "./zlib/messages": 51, "./zlib/zstream": 53 }], 40: [function(_, R, y) {
|
|
1229
|
-
var l = _("./zlib/inflate"), a = _("./utils/common"), r = _("./utils/strings"), h = _("./zlib/constants"),
|
|
1230
|
-
function
|
|
1231
|
-
if (!(this instanceof
|
|
1229
|
+
var l = _("./zlib/inflate"), a = _("./utils/common"), r = _("./utils/strings"), h = _("./zlib/constants"), p = _("./zlib/messages"), v = _("./zlib/zstream"), m = _("./zlib/gzheader"), b = Object.prototype.toString;
|
|
1230
|
+
function s(n) {
|
|
1231
|
+
if (!(this instanceof s)) return new s(n);
|
|
1232
1232
|
this.options = a.assign({ chunkSize: 16384, windowBits: 0, to: "" }, n || {});
|
|
1233
1233
|
var u = this.options;
|
|
1234
1234
|
u.raw && 0 <= u.windowBits && u.windowBits < 16 && (u.windowBits = -u.windowBits, u.windowBits === 0 && (u.windowBits = -15)), !(0 <= u.windowBits && u.windowBits < 16) || n && n.windowBits || (u.windowBits += 32), 15 < u.windowBits && u.windowBits < 48 && !(15 & u.windowBits) && (u.windowBits |= 15), this.err = 0, this.msg = "", this.ended = !1, this.chunks = [], this.strm = new v(), this.strm.avail_out = 0;
|
|
1235
|
-
var
|
|
1236
|
-
if (
|
|
1237
|
-
this.header = new
|
|
1235
|
+
var i = l.inflateInit2(this.strm, u.windowBits);
|
|
1236
|
+
if (i !== h.Z_OK) throw new Error(p[i]);
|
|
1237
|
+
this.header = new m(), l.inflateGetHeader(this.strm, this.header);
|
|
1238
1238
|
}
|
|
1239
|
-
function
|
|
1240
|
-
var
|
|
1241
|
-
if (
|
|
1242
|
-
return
|
|
1239
|
+
function c(n, u) {
|
|
1240
|
+
var i = new s(u);
|
|
1241
|
+
if (i.push(n, !0), i.err) throw i.msg || p[i.err];
|
|
1242
|
+
return i.result;
|
|
1243
1243
|
}
|
|
1244
|
-
|
|
1245
|
-
var
|
|
1244
|
+
s.prototype.push = function(n, u) {
|
|
1245
|
+
var i, d, w, S, x, F, I = this.strm, j = this.options.chunkSize, O = this.options.dictionary, W = !1;
|
|
1246
1246
|
if (this.ended) return !1;
|
|
1247
|
-
|
|
1247
|
+
d = u === ~~u ? u : u === !0 ? h.Z_FINISH : h.Z_NO_FLUSH, typeof n == "string" ? I.input = r.binstring2buf(n) : b.call(n) === "[object ArrayBuffer]" ? I.input = new Uint8Array(n) : I.input = n, I.next_in = 0, I.avail_in = I.input.length;
|
|
1248
1248
|
do {
|
|
1249
|
-
if (I.avail_out === 0 && (I.output = new a.Buf8(j), I.next_out = 0, I.avail_out = j), (
|
|
1250
|
-
I.next_out && (I.avail_out !== 0 &&
|
|
1251
|
-
} while ((0 < I.avail_in || I.avail_out === 0) &&
|
|
1252
|
-
return
|
|
1253
|
-
},
|
|
1249
|
+
if (I.avail_out === 0 && (I.output = new a.Buf8(j), I.next_out = 0, I.avail_out = j), (i = l.inflate(I, h.Z_NO_FLUSH)) === h.Z_NEED_DICT && O && (F = typeof O == "string" ? r.string2buf(O) : b.call(O) === "[object ArrayBuffer]" ? new Uint8Array(O) : O, i = l.inflateSetDictionary(this.strm, F)), i === h.Z_BUF_ERROR && W === !0 && (i = h.Z_OK, W = !1), i !== h.Z_STREAM_END && i !== h.Z_OK) return this.onEnd(i), !(this.ended = !0);
|
|
1250
|
+
I.next_out && (I.avail_out !== 0 && i !== h.Z_STREAM_END && (I.avail_in !== 0 || d !== h.Z_FINISH && d !== h.Z_SYNC_FLUSH) || (this.options.to === "string" ? (w = r.utf8border(I.output, I.next_out), S = I.next_out - w, x = r.buf2string(I.output, w), I.next_out = S, I.avail_out = j - S, S && a.arraySet(I.output, I.output, w, S, 0), this.onData(x)) : this.onData(a.shrinkBuf(I.output, I.next_out)))), I.avail_in === 0 && I.avail_out === 0 && (W = !0);
|
|
1251
|
+
} while ((0 < I.avail_in || I.avail_out === 0) && i !== h.Z_STREAM_END);
|
|
1252
|
+
return i === h.Z_STREAM_END && (d = h.Z_FINISH), d === h.Z_FINISH ? (i = l.inflateEnd(this.strm), this.onEnd(i), this.ended = !0, i === h.Z_OK) : d !== h.Z_SYNC_FLUSH || (this.onEnd(h.Z_OK), !(I.avail_out = 0));
|
|
1253
|
+
}, s.prototype.onData = function(n) {
|
|
1254
1254
|
this.chunks.push(n);
|
|
1255
|
-
},
|
|
1255
|
+
}, s.prototype.onEnd = function(n) {
|
|
1256
1256
|
n === h.Z_OK && (this.options.to === "string" ? this.result = this.chunks.join("") : this.result = a.flattenChunks(this.chunks)), this.chunks = [], this.err = n, this.msg = this.strm.msg;
|
|
1257
|
-
}, y.Inflate =
|
|
1258
|
-
return (u = u || {}).raw = !0,
|
|
1259
|
-
}, y.ungzip =
|
|
1257
|
+
}, y.Inflate = s, y.inflate = c, y.inflateRaw = function(n, u) {
|
|
1258
|
+
return (u = u || {}).raw = !0, c(n, u);
|
|
1259
|
+
}, y.ungzip = c;
|
|
1260
1260
|
}, { "./utils/common": 41, "./utils/strings": 42, "./zlib/constants": 44, "./zlib/gzheader": 47, "./zlib/inflate": 49, "./zlib/messages": 51, "./zlib/zstream": 53 }], 41: [function(_, R, y) {
|
|
1261
1261
|
var l = typeof Uint8Array < "u" && typeof Uint16Array < "u" && typeof Int32Array < "u";
|
|
1262
1262
|
y.assign = function(h) {
|
|
1263
|
-
for (var
|
|
1264
|
-
var v =
|
|
1263
|
+
for (var p = Array.prototype.slice.call(arguments, 1); p.length; ) {
|
|
1264
|
+
var v = p.shift();
|
|
1265
1265
|
if (v) {
|
|
1266
1266
|
if (typeof v != "object") throw new TypeError(v + "must be non-object");
|
|
1267
|
-
for (var
|
|
1267
|
+
for (var m in v) v.hasOwnProperty(m) && (h[m] = v[m]);
|
|
1268
1268
|
}
|
|
1269
1269
|
}
|
|
1270
1270
|
return h;
|
|
1271
|
-
}, y.shrinkBuf = function(h,
|
|
1272
|
-
return h.length ===
|
|
1271
|
+
}, y.shrinkBuf = function(h, p) {
|
|
1272
|
+
return h.length === p ? h : h.subarray ? h.subarray(0, p) : (h.length = p, h);
|
|
1273
1273
|
};
|
|
1274
|
-
var a = { arraySet: function(h,
|
|
1275
|
-
if (
|
|
1276
|
-
else for (var
|
|
1274
|
+
var a = { arraySet: function(h, p, v, m, b) {
|
|
1275
|
+
if (p.subarray && h.subarray) h.set(p.subarray(v, v + m), b);
|
|
1276
|
+
else for (var s = 0; s < m; s++) h[b + s] = p[v + s];
|
|
1277
1277
|
}, flattenChunks: function(h) {
|
|
1278
|
-
var
|
|
1279
|
-
for (
|
|
1280
|
-
for (
|
|
1281
|
-
return
|
|
1282
|
-
} }, r = { arraySet: function(h,
|
|
1283
|
-
for (var
|
|
1278
|
+
var p, v, m, b, s, c;
|
|
1279
|
+
for (p = m = 0, v = h.length; p < v; p++) m += h[p].length;
|
|
1280
|
+
for (c = new Uint8Array(m), p = b = 0, v = h.length; p < v; p++) s = h[p], c.set(s, b), b += s.length;
|
|
1281
|
+
return c;
|
|
1282
|
+
} }, r = { arraySet: function(h, p, v, m, b) {
|
|
1283
|
+
for (var s = 0; s < m; s++) h[b + s] = p[v + s];
|
|
1284
1284
|
}, flattenChunks: function(h) {
|
|
1285
1285
|
return [].concat.apply([], h);
|
|
1286
1286
|
} };
|
|
@@ -1299,43 +1299,43 @@ var Ct = { exports: {} };
|
|
|
1299
1299
|
} catch {
|
|
1300
1300
|
r = !1;
|
|
1301
1301
|
}
|
|
1302
|
-
for (var h = new l.Buf8(256),
|
|
1303
|
-
function v(
|
|
1304
|
-
if (b < 65537 && (
|
|
1305
|
-
for (var
|
|
1306
|
-
return
|
|
1302
|
+
for (var h = new l.Buf8(256), p = 0; p < 256; p++) h[p] = 252 <= p ? 6 : 248 <= p ? 5 : 240 <= p ? 4 : 224 <= p ? 3 : 192 <= p ? 2 : 1;
|
|
1303
|
+
function v(m, b) {
|
|
1304
|
+
if (b < 65537 && (m.subarray && r || !m.subarray && a)) return String.fromCharCode.apply(null, l.shrinkBuf(m, b));
|
|
1305
|
+
for (var s = "", c = 0; c < b; c++) s += String.fromCharCode(m[c]);
|
|
1306
|
+
return s;
|
|
1307
1307
|
}
|
|
1308
|
-
h[254] = h[254] = 1, y.string2buf = function(
|
|
1309
|
-
var b,
|
|
1310
|
-
for (n = 0; n <
|
|
1311
|
-
for (b = new l.Buf8(
|
|
1308
|
+
h[254] = h[254] = 1, y.string2buf = function(m) {
|
|
1309
|
+
var b, s, c, n, u, i = m.length, d = 0;
|
|
1310
|
+
for (n = 0; n < i; n++) (64512 & (s = m.charCodeAt(n))) == 55296 && n + 1 < i && (64512 & (c = m.charCodeAt(n + 1))) == 56320 && (s = 65536 + (s - 55296 << 10) + (c - 56320), n++), d += s < 128 ? 1 : s < 2048 ? 2 : s < 65536 ? 3 : 4;
|
|
1311
|
+
for (b = new l.Buf8(d), n = u = 0; u < d; n++) (64512 & (s = m.charCodeAt(n))) == 55296 && n + 1 < i && (64512 & (c = m.charCodeAt(n + 1))) == 56320 && (s = 65536 + (s - 55296 << 10) + (c - 56320), n++), s < 128 ? b[u++] = s : (s < 2048 ? b[u++] = 192 | s >>> 6 : (s < 65536 ? b[u++] = 224 | s >>> 12 : (b[u++] = 240 | s >>> 18, b[u++] = 128 | s >>> 12 & 63), b[u++] = 128 | s >>> 6 & 63), b[u++] = 128 | 63 & s);
|
|
1312
1312
|
return b;
|
|
1313
|
-
}, y.buf2binstring = function(
|
|
1314
|
-
return v(
|
|
1315
|
-
}, y.binstring2buf = function(
|
|
1316
|
-
for (var b = new l.Buf8(
|
|
1313
|
+
}, y.buf2binstring = function(m) {
|
|
1314
|
+
return v(m, m.length);
|
|
1315
|
+
}, y.binstring2buf = function(m) {
|
|
1316
|
+
for (var b = new l.Buf8(m.length), s = 0, c = b.length; s < c; s++) b[s] = m.charCodeAt(s);
|
|
1317
1317
|
return b;
|
|
1318
|
-
}, y.buf2string = function(
|
|
1319
|
-
var
|
|
1320
|
-
for (
|
|
1321
|
-
else if (4 < (u = h[n]))
|
|
1318
|
+
}, y.buf2string = function(m, b) {
|
|
1319
|
+
var s, c, n, u, i = b || m.length, d = new Array(2 * i);
|
|
1320
|
+
for (s = c = 0; s < i; ) if ((n = m[s++]) < 128) d[c++] = n;
|
|
1321
|
+
else if (4 < (u = h[n])) d[c++] = 65533, s += u - 1;
|
|
1322
1322
|
else {
|
|
1323
|
-
for (n &= u === 2 ? 31 : u === 3 ? 15 : 7; 1 < u &&
|
|
1324
|
-
1 < u ?
|
|
1323
|
+
for (n &= u === 2 ? 31 : u === 3 ? 15 : 7; 1 < u && s < i; ) n = n << 6 | 63 & m[s++], u--;
|
|
1324
|
+
1 < u ? d[c++] = 65533 : n < 65536 ? d[c++] = n : (n -= 65536, d[c++] = 55296 | n >> 10 & 1023, d[c++] = 56320 | 1023 & n);
|
|
1325
1325
|
}
|
|
1326
|
-
return v(
|
|
1327
|
-
}, y.utf8border = function(
|
|
1328
|
-
var
|
|
1329
|
-
for ((b = b ||
|
|
1330
|
-
return
|
|
1326
|
+
return v(d, c);
|
|
1327
|
+
}, y.utf8border = function(m, b) {
|
|
1328
|
+
var s;
|
|
1329
|
+
for ((b = b || m.length) > m.length && (b = m.length), s = b - 1; 0 <= s && (192 & m[s]) == 128; ) s--;
|
|
1330
|
+
return s < 0 || s === 0 ? b : s + h[m[s]] > b ? s : b;
|
|
1331
1331
|
};
|
|
1332
1332
|
}, { "./common": 41 }], 43: [function(_, R, y) {
|
|
1333
1333
|
R.exports = function(l, a, r, h) {
|
|
1334
|
-
for (var
|
|
1335
|
-
for (r -=
|
|
1336
|
-
|
|
1334
|
+
for (var p = 65535 & l | 0, v = l >>> 16 & 65535 | 0, m = 0; r !== 0; ) {
|
|
1335
|
+
for (r -= m = 2e3 < r ? 2e3 : r; v = v + (p = p + a[h++] | 0) | 0, --m; ) ;
|
|
1336
|
+
p %= 65521, v %= 65521;
|
|
1337
1337
|
}
|
|
1338
|
-
return
|
|
1338
|
+
return p | v << 16 | 0;
|
|
1339
1339
|
};
|
|
1340
1340
|
}, {}], 44: [function(_, R, y) {
|
|
1341
1341
|
R.exports = { Z_NO_FLUSH: 0, Z_PARTIAL_FLUSH: 1, Z_SYNC_FLUSH: 2, Z_FULL_FLUSH: 3, Z_FINISH: 4, Z_BLOCK: 5, Z_TREES: 6, Z_OK: 0, Z_STREAM_END: 1, Z_NEED_DICT: 2, Z_ERRNO: -1, Z_STREAM_ERROR: -2, Z_DATA_ERROR: -3, Z_BUF_ERROR: -5, Z_NO_COMPRESSION: 0, Z_BEST_SPEED: 1, Z_BEST_COMPRESSION: 9, Z_DEFAULT_COMPRESSION: -1, Z_FILTERED: 1, Z_HUFFMAN_ONLY: 2, Z_RLE: 3, Z_FIXED: 4, Z_DEFAULT_STRATEGY: 0, Z_BINARY: 0, Z_TEXT: 1, Z_UNKNOWN: 2, Z_DEFLATED: 8 };
|
|
@@ -1343,26 +1343,26 @@ var Ct = { exports: {} };
|
|
|
1343
1343
|
var l = function() {
|
|
1344
1344
|
for (var a, r = [], h = 0; h < 256; h++) {
|
|
1345
1345
|
a = h;
|
|
1346
|
-
for (var
|
|
1346
|
+
for (var p = 0; p < 8; p++) a = 1 & a ? 3988292384 ^ a >>> 1 : a >>> 1;
|
|
1347
1347
|
r[h] = a;
|
|
1348
1348
|
}
|
|
1349
1349
|
return r;
|
|
1350
1350
|
}();
|
|
1351
|
-
R.exports = function(a, r, h,
|
|
1352
|
-
var v = l,
|
|
1351
|
+
R.exports = function(a, r, h, p) {
|
|
1352
|
+
var v = l, m = p + h;
|
|
1353
1353
|
a ^= -1;
|
|
1354
|
-
for (var b =
|
|
1354
|
+
for (var b = p; b < m; b++) a = a >>> 8 ^ v[255 & (a ^ r[b])];
|
|
1355
1355
|
return -1 ^ a;
|
|
1356
1356
|
};
|
|
1357
1357
|
}, {}], 46: [function(_, R, y) {
|
|
1358
|
-
var l, a = _("../utils/common"), r = _("./trees"), h = _("./adler32"),
|
|
1358
|
+
var l, a = _("../utils/common"), r = _("./trees"), h = _("./adler32"), p = _("./crc32"), v = _("./messages"), m = 0, b = 4, s = 0, c = -2, n = -1, u = 4, i = 2, d = 8, w = 9, S = 286, x = 30, F = 19, I = 2 * S + 1, j = 15, O = 3, W = 258, J = W + O + 1, g = 42, T = 113, e = 1, D = 2, q = 3, U = 4;
|
|
1359
1359
|
function $(t, B) {
|
|
1360
1360
|
return t.msg = v[B], B;
|
|
1361
1361
|
}
|
|
1362
1362
|
function L(t) {
|
|
1363
1363
|
return (t << 1) - (4 < t ? 9 : 0);
|
|
1364
1364
|
}
|
|
1365
|
-
function
|
|
1365
|
+
function V(t) {
|
|
1366
1366
|
for (var B = t.length; 0 <= --B; ) t[B] = 0;
|
|
1367
1367
|
}
|
|
1368
1368
|
function C(t) {
|
|
@@ -1379,7 +1379,7 @@ var Ct = { exports: {} };
|
|
|
1379
1379
|
t.pending_buf[t.pending++] = B >>> 8 & 255, t.pending_buf[t.pending++] = 255 & B;
|
|
1380
1380
|
}
|
|
1381
1381
|
function H(t, B) {
|
|
1382
|
-
var A, f, o = t.max_chain_length, k = t.strstart, N = t.prev_length, P = t.nice_match, z = t.strstart > t.w_size -
|
|
1382
|
+
var A, f, o = t.max_chain_length, k = t.strstart, N = t.prev_length, P = t.nice_match, z = t.strstart > t.w_size - J ? t.strstart - (t.w_size - J) : 0, Z = t.window, K = t.w_mask, M = t.prev, X = t.strstart + W, rt = Z[k + N - 1], tt = Z[k + N];
|
|
1383
1383
|
t.prev_length >= t.good_match && (o >>= 2), P > t.lookahead && (P = t.lookahead);
|
|
1384
1384
|
do
|
|
1385
1385
|
if (Z[(A = B) + N] === tt && Z[A + N - 1] === rt && Z[A] === Z[k] && Z[++A] === Z[k + 1]) {
|
|
@@ -1398,65 +1398,65 @@ var Ct = { exports: {} };
|
|
|
1398
1398
|
function it(t) {
|
|
1399
1399
|
var B, A, f, o, k, N, P, z, Z, K, M = t.w_size;
|
|
1400
1400
|
do {
|
|
1401
|
-
if (o = t.window_size - t.lookahead - t.strstart, t.strstart >= M + (M -
|
|
1401
|
+
if (o = t.window_size - t.lookahead - t.strstart, t.strstart >= M + (M - J)) {
|
|
1402
1402
|
for (a.arraySet(t.window, t.window, M, M, 0), t.match_start -= M, t.strstart -= M, t.block_start -= M, B = A = t.hash_size; f = t.head[--B], t.head[B] = M <= f ? f - M : 0, --A; ) ;
|
|
1403
1403
|
for (B = A = M; f = t.prev[--B], t.prev[B] = M <= f ? f - M : 0, --A; ) ;
|
|
1404
1404
|
o += M;
|
|
1405
1405
|
}
|
|
1406
1406
|
if (t.strm.avail_in === 0) break;
|
|
1407
|
-
if (N = t.strm, P = t.window, z = t.strstart + t.lookahead, Z = o, K = void 0, K = N.avail_in, Z < K && (K = Z), A = K === 0 ? 0 : (N.avail_in -= K, a.arraySet(P, N.input, N.next_in, K, z), N.state.wrap === 1 ? N.adler = h(N.adler, P, K, z) : N.state.wrap === 2 && (N.adler =
|
|
1408
|
-
} while (t.lookahead <
|
|
1407
|
+
if (N = t.strm, P = t.window, z = t.strstart + t.lookahead, Z = o, K = void 0, K = N.avail_in, Z < K && (K = Z), A = K === 0 ? 0 : (N.avail_in -= K, a.arraySet(P, N.input, N.next_in, K, z), N.state.wrap === 1 ? N.adler = h(N.adler, P, K, z) : N.state.wrap === 2 && (N.adler = p(N.adler, P, K, z)), N.next_in += K, N.total_in += K, K), t.lookahead += A, t.lookahead + t.insert >= O) for (k = t.strstart - t.insert, t.ins_h = t.window[k], t.ins_h = (t.ins_h << t.hash_shift ^ t.window[k + 1]) & t.hash_mask; t.insert && (t.ins_h = (t.ins_h << t.hash_shift ^ t.window[k + O - 1]) & t.hash_mask, t.prev[k & t.w_mask] = t.head[t.ins_h], t.head[t.ins_h] = k, k++, t.insert--, !(t.lookahead + t.insert < O)); ) ;
|
|
1408
|
+
} while (t.lookahead < J && t.strm.avail_in !== 0);
|
|
1409
1409
|
}
|
|
1410
1410
|
function lt(t, B) {
|
|
1411
1411
|
for (var A, f; ; ) {
|
|
1412
|
-
if (t.lookahead <
|
|
1413
|
-
if (it(t), t.lookahead <
|
|
1412
|
+
if (t.lookahead < J) {
|
|
1413
|
+
if (it(t), t.lookahead < J && B === m) return e;
|
|
1414
1414
|
if (t.lookahead === 0) break;
|
|
1415
1415
|
}
|
|
1416
|
-
if (A = 0, t.lookahead >= O && (t.ins_h = (t.ins_h << t.hash_shift ^ t.window[t.strstart + O - 1]) & t.hash_mask, A = t.prev[t.strstart & t.w_mask] = t.head[t.ins_h], t.head[t.ins_h] = t.strstart), A !== 0 && t.strstart - A <= t.w_size -
|
|
1416
|
+
if (A = 0, t.lookahead >= O && (t.ins_h = (t.ins_h << t.hash_shift ^ t.window[t.strstart + O - 1]) & t.hash_mask, A = t.prev[t.strstart & t.w_mask] = t.head[t.ins_h], t.head[t.ins_h] = t.strstart), A !== 0 && t.strstart - A <= t.w_size - J && (t.match_length = H(t, A)), t.match_length >= O) if (f = r._tr_tally(t, t.strstart - t.match_start, t.match_length - O), t.lookahead -= t.match_length, t.match_length <= t.max_lazy_match && t.lookahead >= O) {
|
|
1417
1417
|
for (t.match_length--; t.strstart++, t.ins_h = (t.ins_h << t.hash_shift ^ t.window[t.strstart + O - 1]) & t.hash_mask, A = t.prev[t.strstart & t.w_mask] = t.head[t.ins_h], t.head[t.ins_h] = t.strstart, --t.match_length != 0; ) ;
|
|
1418
1418
|
t.strstart++;
|
|
1419
1419
|
} 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;
|
|
1420
1420
|
else f = r._tr_tally(t, 0, t.window[t.strstart]), t.lookahead--, t.strstart++;
|
|
1421
1421
|
if (f && (E(t, !1), t.strm.avail_out === 0)) return e;
|
|
1422
1422
|
}
|
|
1423
|
-
return t.insert = t.strstart < O - 1 ? t.strstart : O - 1, B === b ? (E(t, !0), t.strm.avail_out === 0 ?
|
|
1423
|
+
return t.insert = t.strstart < O - 1 ? t.strstart : O - 1, B === b ? (E(t, !0), t.strm.avail_out === 0 ? q : U) : t.last_lit && (E(t, !1), t.strm.avail_out === 0) ? e : D;
|
|
1424
1424
|
}
|
|
1425
1425
|
function Q(t, B) {
|
|
1426
1426
|
for (var A, f, o; ; ) {
|
|
1427
|
-
if (t.lookahead <
|
|
1428
|
-
if (it(t), t.lookahead <
|
|
1427
|
+
if (t.lookahead < J) {
|
|
1428
|
+
if (it(t), t.lookahead < J && B === m) return e;
|
|
1429
1429
|
if (t.lookahead === 0) break;
|
|
1430
1430
|
}
|
|
1431
|
-
if (A = 0, t.lookahead >= O && (t.ins_h = (t.ins_h << t.hash_shift ^ t.window[t.strstart + O - 1]) & t.hash_mask, A = 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 = O - 1, A !== 0 && t.prev_length < t.max_lazy_match && t.strstart - A <= t.w_size -
|
|
1431
|
+
if (A = 0, t.lookahead >= O && (t.ins_h = (t.ins_h << t.hash_shift ^ t.window[t.strstart + O - 1]) & t.hash_mask, A = 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 = O - 1, A !== 0 && t.prev_length < t.max_lazy_match && t.strstart - A <= t.w_size - J && (t.match_length = H(t, A), t.match_length <= 5 && (t.strategy === 1 || t.match_length === O && 4096 < t.strstart - t.match_start) && (t.match_length = O - 1)), t.prev_length >= O && t.match_length <= t.prev_length) {
|
|
1432
1432
|
for (o = t.strstart + t.lookahead - O, f = r._tr_tally(t, t.strstart - 1 - t.prev_match, t.prev_length - O), t.lookahead -= t.prev_length - 1, t.prev_length -= 2; ++t.strstart <= o && (t.ins_h = (t.ins_h << t.hash_shift ^ t.window[t.strstart + O - 1]) & t.hash_mask, A = t.prev[t.strstart & t.w_mask] = t.head[t.ins_h], t.head[t.ins_h] = t.strstart), --t.prev_length != 0; ) ;
|
|
1433
1433
|
if (t.match_available = 0, t.match_length = O - 1, t.strstart++, f && (E(t, !1), t.strm.avail_out === 0)) return e;
|
|
1434
1434
|
} else if (t.match_available) {
|
|
1435
1435
|
if ((f = r._tr_tally(t, 0, t.window[t.strstart - 1])) && E(t, !1), t.strstart++, t.lookahead--, t.strm.avail_out === 0) return e;
|
|
1436
1436
|
} else t.match_available = 1, t.strstart++, t.lookahead--;
|
|
1437
1437
|
}
|
|
1438
|
-
return t.match_available && (f = r._tr_tally(t, 0, t.window[t.strstart - 1]), t.match_available = 0), t.insert = t.strstart < O - 1 ? t.strstart : O - 1, B === b ? (E(t, !0), t.strm.avail_out === 0 ?
|
|
1438
|
+
return t.match_available && (f = r._tr_tally(t, 0, t.window[t.strstart - 1]), t.match_available = 0), t.insert = t.strstart < O - 1 ? t.strstart : O - 1, B === b ? (E(t, !0), t.strm.avail_out === 0 ? q : U) : t.last_lit && (E(t, !1), t.strm.avail_out === 0) ? e : D;
|
|
1439
1439
|
}
|
|
1440
1440
|
function et(t, B, A, f, o) {
|
|
1441
1441
|
this.good_length = t, this.max_lazy = B, this.nice_length = A, this.max_chain = f, this.func = o;
|
|
1442
1442
|
}
|
|
1443
1443
|
function ot() {
|
|
1444
|
-
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 =
|
|
1444
|
+
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 = d, 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 * I), this.dyn_dtree = new a.Buf16(2 * (2 * x + 1)), this.bl_tree = new a.Buf16(2 * (2 * F + 1)), V(this.dyn_ltree), V(this.dyn_dtree), V(this.bl_tree), this.l_desc = null, this.d_desc = null, this.bl_desc = null, this.bl_count = new a.Buf16(j + 1), this.heap = new a.Buf16(2 * S + 1), V(this.heap), this.heap_len = 0, this.heap_max = 0, this.depth = new a.Buf16(2 * S + 1), V(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;
|
|
1445
1445
|
}
|
|
1446
|
-
function
|
|
1446
|
+
function st(t) {
|
|
1447
1447
|
var B;
|
|
1448
|
-
return t && t.state ? (t.total_in = t.total_out = 0, t.data_type =
|
|
1448
|
+
return t && t.state ? (t.total_in = t.total_out = 0, t.data_type = i, (B = t.state).pending = 0, B.pending_out = 0, B.wrap < 0 && (B.wrap = -B.wrap), B.status = B.wrap ? g : T, t.adler = B.wrap === 2 ? 0 : 1, B.last_flush = m, r._tr_init(B), s) : $(t, c);
|
|
1449
1449
|
}
|
|
1450
1450
|
function ct(t) {
|
|
1451
|
-
var B =
|
|
1452
|
-
return B ===
|
|
1453
|
-
A.window_size = 2 * A.w_size,
|
|
1451
|
+
var B = st(t);
|
|
1452
|
+
return B === s && function(A) {
|
|
1453
|
+
A.window_size = 2 * A.w_size, V(A.head), A.max_lazy_match = l[A.level].max_lazy, A.good_match = l[A.level].good_length, A.nice_match = l[A.level].nice_length, A.max_chain_length = l[A.level].max_chain, A.strstart = 0, A.block_start = 0, A.lookahead = 0, A.insert = 0, A.match_length = A.prev_length = O - 1, A.match_available = 0, A.ins_h = 0;
|
|
1454
1454
|
}(t.state), B;
|
|
1455
1455
|
}
|
|
1456
1456
|
function ft(t, B, A, f, o, k) {
|
|
1457
|
-
if (!t) return
|
|
1457
|
+
if (!t) return c;
|
|
1458
1458
|
var N = 1;
|
|
1459
|
-
if (B === n && (B = 6), f < 0 ? (N = 0, f = -f) : 15 < f && (N = 2, f -= 16), o < 1 || w < o || A !==
|
|
1459
|
+
if (B === n && (B = 6), f < 0 ? (N = 0, f = -f) : 15 < f && (N = 2, f -= 16), o < 1 || w < o || A !== d || f < 8 || 15 < f || B < 0 || 9 < B || k < 0 || u < k) return $(t, c);
|
|
1460
1460
|
f === 8 && (f = 9);
|
|
1461
1461
|
var P = new ot();
|
|
1462
1462
|
return (t.state = P).strm = t, P.wrap = N, P.gzhead = null, P.w_bits = f, P.w_size = 1 << P.w_bits, P.w_mask = P.w_size - 1, P.hash_bits = o + 7, P.hash_size = 1 << P.hash_bits, P.hash_mask = P.hash_size - 1, P.hash_shift = ~~((P.hash_bits + O - 1) / O), P.window = new a.Buf8(2 * P.w_size), P.head = new a.Buf16(P.hash_size), P.prev = new a.Buf16(P.w_size), P.lit_bufsize = 1 << o + 6, P.pending_buf_size = 4 * P.lit_bufsize, P.pending_buf = new a.Buf8(P.pending_buf_size), P.d_buf = 1 * P.lit_bufsize, P.l_buf = 3 * P.lit_bufsize, P.level = B, P.strategy = k, P.method = A, ct(t);
|
|
@@ -1465,71 +1465,71 @@ var Ct = { exports: {} };
|
|
|
1465
1465
|
var A = 65535;
|
|
1466
1466
|
for (A > t.pending_buf_size - 5 && (A = t.pending_buf_size - 5); ; ) {
|
|
1467
1467
|
if (t.lookahead <= 1) {
|
|
1468
|
-
if (it(t), t.lookahead === 0 && B ===
|
|
1468
|
+
if (it(t), t.lookahead === 0 && B === m) return e;
|
|
1469
1469
|
if (t.lookahead === 0) break;
|
|
1470
1470
|
}
|
|
1471
1471
|
t.strstart += t.lookahead, t.lookahead = 0;
|
|
1472
1472
|
var f = t.block_start + A;
|
|
1473
|
-
if ((t.strstart === 0 || t.strstart >= f) && (t.lookahead = t.strstart - f, t.strstart = f, E(t, !1), t.strm.avail_out === 0) || t.strstart - t.block_start >= t.w_size -
|
|
1473
|
+
if ((t.strstart === 0 || t.strstart >= f) && (t.lookahead = t.strstart - f, t.strstart = f, E(t, !1), t.strm.avail_out === 0) || t.strstart - t.block_start >= t.w_size - J && (E(t, !1), t.strm.avail_out === 0)) return e;
|
|
1474
1474
|
}
|
|
1475
|
-
return t.insert = 0, B === b ? (E(t, !0), t.strm.avail_out === 0 ?
|
|
1475
|
+
return t.insert = 0, B === b ? (E(t, !0), t.strm.avail_out === 0 ? q : U) : (t.strstart > t.block_start && (E(t, !1), t.strm.avail_out), e);
|
|
1476
1476
|
}), new et(4, 4, 8, 4, lt), new et(4, 5, 16, 8, lt), new et(4, 6, 32, 32, lt), new et(4, 4, 16, 16, Q), new et(8, 16, 32, 32, Q), new et(8, 16, 128, 128, Q), new et(8, 32, 128, 256, Q), new et(32, 128, 258, 1024, Q), new et(32, 258, 258, 4096, Q)], y.deflateInit = function(t, B) {
|
|
1477
|
-
return ft(t, B,
|
|
1478
|
-
}, y.deflateInit2 = ft, y.deflateReset = ct, y.deflateResetKeep =
|
|
1479
|
-
return t && t.state ? t.state.wrap !== 2 ?
|
|
1477
|
+
return ft(t, B, d, 15, 8, 0);
|
|
1478
|
+
}, y.deflateInit2 = ft, y.deflateReset = ct, y.deflateResetKeep = st, y.deflateSetHeader = function(t, B) {
|
|
1479
|
+
return t && t.state ? t.state.wrap !== 2 ? c : (t.state.gzhead = B, s) : c;
|
|
1480
1480
|
}, y.deflate = function(t, B) {
|
|
1481
1481
|
var A, f, o, k;
|
|
1482
|
-
if (!t || !t.state || 5 < B || B < 0) return t ? $(t,
|
|
1483
|
-
if (f = t.state, !t.output || !t.input && t.avail_in !== 0 || f.status === 666 && B !== b) return $(t, t.avail_out === 0 ? -5 :
|
|
1484
|
-
if (f.strm = t, A = f.last_flush, f.last_flush = B, f.status === g) if (f.wrap === 2) t.adler = 0, Y(f, 31), Y(f, 139), Y(f, 8), f.gzhead ? (Y(f, (f.gzhead.text ? 1 : 0) + (f.gzhead.hcrc ? 2 : 0) + (f.gzhead.extra ? 4 : 0) + (f.gzhead.name ? 8 : 0) + (f.gzhead.comment ? 16 : 0)), Y(f, 255 & f.gzhead.time), Y(f, f.gzhead.time >> 8 & 255), Y(f, f.gzhead.time >> 16 & 255), Y(f, f.gzhead.time >> 24 & 255), Y(f, f.level === 9 ? 2 : 2 <= f.strategy || f.level < 2 ? 4 : 0), Y(f, 255 & f.gzhead.os), f.gzhead.extra && f.gzhead.extra.length && (Y(f, 255 & f.gzhead.extra.length), Y(f, f.gzhead.extra.length >> 8 & 255)), f.gzhead.hcrc && (t.adler =
|
|
1482
|
+
if (!t || !t.state || 5 < B || B < 0) return t ? $(t, c) : c;
|
|
1483
|
+
if (f = t.state, !t.output || !t.input && t.avail_in !== 0 || f.status === 666 && B !== b) return $(t, t.avail_out === 0 ? -5 : c);
|
|
1484
|
+
if (f.strm = t, A = f.last_flush, f.last_flush = B, f.status === g) if (f.wrap === 2) t.adler = 0, Y(f, 31), Y(f, 139), Y(f, 8), f.gzhead ? (Y(f, (f.gzhead.text ? 1 : 0) + (f.gzhead.hcrc ? 2 : 0) + (f.gzhead.extra ? 4 : 0) + (f.gzhead.name ? 8 : 0) + (f.gzhead.comment ? 16 : 0)), Y(f, 255 & f.gzhead.time), Y(f, f.gzhead.time >> 8 & 255), Y(f, f.gzhead.time >> 16 & 255), Y(f, f.gzhead.time >> 24 & 255), Y(f, f.level === 9 ? 2 : 2 <= f.strategy || f.level < 2 ? 4 : 0), Y(f, 255 & f.gzhead.os), f.gzhead.extra && f.gzhead.extra.length && (Y(f, 255 & f.gzhead.extra.length), Y(f, f.gzhead.extra.length >> 8 & 255)), f.gzhead.hcrc && (t.adler = p(t.adler, f.pending_buf, f.pending, 0)), f.gzindex = 0, f.status = 69) : (Y(f, 0), Y(f, 0), Y(f, 0), Y(f, 0), Y(f, 0), Y(f, f.level === 9 ? 2 : 2 <= f.strategy || f.level < 2 ? 4 : 0), Y(f, 3), f.status = T);
|
|
1485
1485
|
else {
|
|
1486
|
-
var N =
|
|
1486
|
+
var N = d + (f.w_bits - 8 << 4) << 8;
|
|
1487
1487
|
N |= (2 <= f.strategy || f.level < 2 ? 0 : f.level < 6 ? 1 : f.level === 6 ? 2 : 3) << 6, f.strstart !== 0 && (N |= 32), N += 31 - N % 31, f.status = T, G(f, N), f.strstart !== 0 && (G(f, t.adler >>> 16), G(f, 65535 & t.adler)), t.adler = 1;
|
|
1488
1488
|
}
|
|
1489
1489
|
if (f.status === 69) if (f.gzhead.extra) {
|
|
1490
|
-
for (o = f.pending; f.gzindex < (65535 & f.gzhead.extra.length) && (f.pending !== f.pending_buf_size || (f.gzhead.hcrc && f.pending > o && (t.adler =
|
|
1491
|
-
f.gzhead.hcrc && f.pending > o && (t.adler =
|
|
1490
|
+
for (o = f.pending; f.gzindex < (65535 & f.gzhead.extra.length) && (f.pending !== f.pending_buf_size || (f.gzhead.hcrc && f.pending > o && (t.adler = p(t.adler, f.pending_buf, f.pending - o, o)), C(t), o = f.pending, f.pending !== f.pending_buf_size)); ) Y(f, 255 & f.gzhead.extra[f.gzindex]), f.gzindex++;
|
|
1491
|
+
f.gzhead.hcrc && f.pending > o && (t.adler = p(t.adler, f.pending_buf, f.pending - o, o)), f.gzindex === f.gzhead.extra.length && (f.gzindex = 0, f.status = 73);
|
|
1492
1492
|
} else f.status = 73;
|
|
1493
1493
|
if (f.status === 73) if (f.gzhead.name) {
|
|
1494
1494
|
o = f.pending;
|
|
1495
1495
|
do {
|
|
1496
|
-
if (f.pending === f.pending_buf_size && (f.gzhead.hcrc && f.pending > o && (t.adler =
|
|
1496
|
+
if (f.pending === f.pending_buf_size && (f.gzhead.hcrc && f.pending > o && (t.adler = p(t.adler, f.pending_buf, f.pending - o, o)), C(t), o = f.pending, f.pending === f.pending_buf_size)) {
|
|
1497
1497
|
k = 1;
|
|
1498
1498
|
break;
|
|
1499
1499
|
}
|
|
1500
1500
|
k = f.gzindex < f.gzhead.name.length ? 255 & f.gzhead.name.charCodeAt(f.gzindex++) : 0, Y(f, k);
|
|
1501
1501
|
} while (k !== 0);
|
|
1502
|
-
f.gzhead.hcrc && f.pending > o && (t.adler =
|
|
1502
|
+
f.gzhead.hcrc && f.pending > o && (t.adler = p(t.adler, f.pending_buf, f.pending - o, o)), k === 0 && (f.gzindex = 0, f.status = 91);
|
|
1503
1503
|
} else f.status = 91;
|
|
1504
1504
|
if (f.status === 91) if (f.gzhead.comment) {
|
|
1505
1505
|
o = f.pending;
|
|
1506
1506
|
do {
|
|
1507
|
-
if (f.pending === f.pending_buf_size && (f.gzhead.hcrc && f.pending > o && (t.adler =
|
|
1507
|
+
if (f.pending === f.pending_buf_size && (f.gzhead.hcrc && f.pending > o && (t.adler = p(t.adler, f.pending_buf, f.pending - o, o)), C(t), o = f.pending, f.pending === f.pending_buf_size)) {
|
|
1508
1508
|
k = 1;
|
|
1509
1509
|
break;
|
|
1510
1510
|
}
|
|
1511
1511
|
k = f.gzindex < f.gzhead.comment.length ? 255 & f.gzhead.comment.charCodeAt(f.gzindex++) : 0, Y(f, k);
|
|
1512
1512
|
} while (k !== 0);
|
|
1513
|
-
f.gzhead.hcrc && f.pending > o && (t.adler =
|
|
1513
|
+
f.gzhead.hcrc && f.pending > o && (t.adler = p(t.adler, f.pending_buf, f.pending - o, o)), k === 0 && (f.status = 103);
|
|
1514
1514
|
} else f.status = 103;
|
|
1515
1515
|
if (f.status === 103 && (f.gzhead.hcrc ? (f.pending + 2 > f.pending_buf_size && C(t), f.pending + 2 <= f.pending_buf_size && (Y(f, 255 & t.adler), Y(f, t.adler >> 8 & 255), t.adler = 0, f.status = T)) : f.status = T), f.pending !== 0) {
|
|
1516
|
-
if (C(t), t.avail_out === 0) return f.last_flush = -1,
|
|
1516
|
+
if (C(t), t.avail_out === 0) return f.last_flush = -1, s;
|
|
1517
1517
|
} else if (t.avail_in === 0 && L(B) <= L(A) && B !== b) return $(t, -5);
|
|
1518
1518
|
if (f.status === 666 && t.avail_in !== 0) return $(t, -5);
|
|
1519
|
-
if (t.avail_in !== 0 || f.lookahead !== 0 || B !==
|
|
1519
|
+
if (t.avail_in !== 0 || f.lookahead !== 0 || B !== m && f.status !== 666) {
|
|
1520
1520
|
var P = f.strategy === 2 ? function(z, Z) {
|
|
1521
1521
|
for (var K; ; ) {
|
|
1522
1522
|
if (z.lookahead === 0 && (it(z), z.lookahead === 0)) {
|
|
1523
|
-
if (Z ===
|
|
1523
|
+
if (Z === m) return e;
|
|
1524
1524
|
break;
|
|
1525
1525
|
}
|
|
1526
1526
|
if (z.match_length = 0, K = r._tr_tally(z, 0, z.window[z.strstart]), z.lookahead--, z.strstart++, K && (E(z, !1), z.strm.avail_out === 0)) return e;
|
|
1527
1527
|
}
|
|
1528
|
-
return z.insert = 0, Z === b ? (E(z, !0), z.strm.avail_out === 0 ?
|
|
1528
|
+
return z.insert = 0, Z === b ? (E(z, !0), z.strm.avail_out === 0 ? q : U) : z.last_lit && (E(z, !1), z.strm.avail_out === 0) ? e : D;
|
|
1529
1529
|
}(f, B) : f.strategy === 3 ? function(z, Z) {
|
|
1530
1530
|
for (var K, M, X, rt, tt = z.window; ; ) {
|
|
1531
1531
|
if (z.lookahead <= W) {
|
|
1532
|
-
if (it(z), z.lookahead <= W && Z ===
|
|
1532
|
+
if (it(z), z.lookahead <= W && Z === m) return e;
|
|
1533
1533
|
if (z.lookahead === 0) break;
|
|
1534
1534
|
}
|
|
1535
1535
|
if (z.match_length = 0, z.lookahead >= O && 0 < z.strstart && (M = tt[X = z.strstart - 1]) === tt[++X] && M === tt[++X] && M === tt[++X]) {
|
|
@@ -1541,23 +1541,23 @@ var Ct = { exports: {} };
|
|
|
1541
1541
|
}
|
|
1542
1542
|
if (z.match_length >= O ? (K = r._tr_tally(z, 1, z.match_length - O), z.lookahead -= z.match_length, z.strstart += z.match_length, z.match_length = 0) : (K = r._tr_tally(z, 0, z.window[z.strstart]), z.lookahead--, z.strstart++), K && (E(z, !1), z.strm.avail_out === 0)) return e;
|
|
1543
1543
|
}
|
|
1544
|
-
return z.insert = 0, Z === b ? (E(z, !0), z.strm.avail_out === 0 ?
|
|
1544
|
+
return z.insert = 0, Z === b ? (E(z, !0), z.strm.avail_out === 0 ? q : U) : z.last_lit && (E(z, !1), z.strm.avail_out === 0) ? e : D;
|
|
1545
1545
|
}(f, B) : l[f.level].func(f, B);
|
|
1546
|
-
if (P !==
|
|
1547
|
-
if (P === D && (B === 1 ? r._tr_align(f) : B !== 5 && (r._tr_stored_block(f, 0, 0, !1), B === 3 && (
|
|
1546
|
+
if (P !== q && P !== U || (f.status = 666), P === e || P === q) return t.avail_out === 0 && (f.last_flush = -1), s;
|
|
1547
|
+
if (P === D && (B === 1 ? r._tr_align(f) : B !== 5 && (r._tr_stored_block(f, 0, 0, !1), B === 3 && (V(f.head), f.lookahead === 0 && (f.strstart = 0, f.block_start = 0, f.insert = 0))), C(t), t.avail_out === 0)) return f.last_flush = -1, s;
|
|
1548
1548
|
}
|
|
1549
|
-
return B !== b ?
|
|
1549
|
+
return B !== b ? s : f.wrap <= 0 ? 1 : (f.wrap === 2 ? (Y(f, 255 & t.adler), Y(f, t.adler >> 8 & 255), Y(f, t.adler >> 16 & 255), Y(f, t.adler >> 24 & 255), Y(f, 255 & t.total_in), Y(f, t.total_in >> 8 & 255), Y(f, t.total_in >> 16 & 255), Y(f, t.total_in >> 24 & 255)) : (G(f, t.adler >>> 16), G(f, 65535 & t.adler)), C(t), 0 < f.wrap && (f.wrap = -f.wrap), f.pending !== 0 ? s : 1);
|
|
1550
1550
|
}, y.deflateEnd = function(t) {
|
|
1551
1551
|
var B;
|
|
1552
|
-
return t && t.state ? (B = t.state.status) !== g && B !== 69 && B !== 73 && B !== 91 && B !== 103 && B !== T && B !== 666 ? $(t,
|
|
1552
|
+
return t && t.state ? (B = t.state.status) !== g && B !== 69 && B !== 73 && B !== 91 && B !== 103 && B !== T && B !== 666 ? $(t, c) : (t.state = null, B === T ? $(t, -3) : s) : c;
|
|
1553
1553
|
}, y.deflateSetDictionary = function(t, B) {
|
|
1554
1554
|
var A, f, o, k, N, P, z, Z, K = B.length;
|
|
1555
|
-
if (!t || !t.state || (k = (A = t.state).wrap) === 2 || k === 1 && A.status !== g || A.lookahead) return
|
|
1556
|
-
for (k === 1 && (t.adler = h(t.adler, B, K, 0)), A.wrap = 0, K >= A.w_size && (k === 0 && (
|
|
1555
|
+
if (!t || !t.state || (k = (A = t.state).wrap) === 2 || k === 1 && A.status !== g || A.lookahead) return c;
|
|
1556
|
+
for (k === 1 && (t.adler = h(t.adler, B, K, 0)), A.wrap = 0, K >= A.w_size && (k === 0 && (V(A.head), A.strstart = 0, A.block_start = 0, A.insert = 0), Z = new a.Buf8(A.w_size), a.arraySet(Z, B, K - A.w_size, A.w_size, 0), B = Z, K = A.w_size), N = t.avail_in, P = t.next_in, z = t.input, t.avail_in = K, t.next_in = 0, t.input = B, it(A); A.lookahead >= O; ) {
|
|
1557
1557
|
for (f = A.strstart, o = A.lookahead - (O - 1); A.ins_h = (A.ins_h << A.hash_shift ^ A.window[f + O - 1]) & A.hash_mask, A.prev[f & A.w_mask] = A.head[A.ins_h], A.head[A.ins_h] = f, f++, --o; ) ;
|
|
1558
1558
|
A.strstart = f, A.lookahead = O - 1, it(A);
|
|
1559
1559
|
}
|
|
1560
|
-
return A.strstart += A.lookahead, A.block_start = A.strstart, A.insert = A.lookahead, A.lookahead = 0, A.match_length = A.prev_length = O - 1, A.match_available = 0, t.next_in = P, t.input = z, t.avail_in = N, A.wrap = k,
|
|
1560
|
+
return A.strstart += A.lookahead, A.block_start = A.strstart, A.insert = A.lookahead, A.lookahead = 0, A.match_length = A.prev_length = O - 1, A.match_available = 0, t.next_in = P, t.input = z, t.avail_in = N, A.wrap = k, s;
|
|
1561
1561
|
}, y.deflateInfo = "pako deflate (from Nodeca project)";
|
|
1562
1562
|
}, { "../utils/common": 41, "./adler32": 43, "./crc32": 45, "./messages": 51, "./trees": 52 }], 47: [function(_, R, y) {
|
|
1563
1563
|
R.exports = function() {
|
|
@@ -1565,16 +1565,16 @@ var Ct = { exports: {} };
|
|
|
1565
1565
|
};
|
|
1566
1566
|
}, {}], 48: [function(_, R, y) {
|
|
1567
1567
|
R.exports = function(l, a) {
|
|
1568
|
-
var r, h,
|
|
1569
|
-
r = l.state, h = l.next_in, e = l.input,
|
|
1568
|
+
var r, h, p, v, m, b, s, c, n, u, i, d, w, S, x, F, I, j, O, W, J, g, T, e, D;
|
|
1569
|
+
r = l.state, h = l.next_in, e = l.input, p = h + (l.avail_in - 5), v = l.next_out, D = l.output, m = v - (a - l.avail_out), b = v + (l.avail_out - 257), s = r.dmax, c = r.wsize, n = r.whave, u = r.wnext, i = r.window, d = r.hold, w = r.bits, S = r.lencode, x = r.distcode, F = (1 << r.lenbits) - 1, I = (1 << r.distbits) - 1;
|
|
1570
1570
|
t: do {
|
|
1571
|
-
w < 15 && (
|
|
1571
|
+
w < 15 && (d += e[h++] << w, w += 8, d += e[h++] << w, w += 8), j = S[d & F];
|
|
1572
1572
|
e: for (; ; ) {
|
|
1573
|
-
if (
|
|
1573
|
+
if (d >>>= O = j >>> 24, w -= O, (O = j >>> 16 & 255) === 0) D[v++] = 65535 & j;
|
|
1574
1574
|
else {
|
|
1575
1575
|
if (!(16 & O)) {
|
|
1576
1576
|
if (!(64 & O)) {
|
|
1577
|
-
j = S[(65535 & j) + (
|
|
1577
|
+
j = S[(65535 & j) + (d & (1 << O) - 1)];
|
|
1578
1578
|
continue e;
|
|
1579
1579
|
}
|
|
1580
1580
|
if (32 & O) {
|
|
@@ -1584,46 +1584,46 @@ var Ct = { exports: {} };
|
|
|
1584
1584
|
l.msg = "invalid literal/length code", r.mode = 30;
|
|
1585
1585
|
break t;
|
|
1586
1586
|
}
|
|
1587
|
-
W = 65535 & j, (O &= 15) && (w < O && (
|
|
1587
|
+
W = 65535 & j, (O &= 15) && (w < O && (d += e[h++] << w, w += 8), W += d & (1 << O) - 1, d >>>= O, w -= O), w < 15 && (d += e[h++] << w, w += 8, d += e[h++] << w, w += 8), j = x[d & I];
|
|
1588
1588
|
r: for (; ; ) {
|
|
1589
|
-
if (
|
|
1589
|
+
if (d >>>= O = j >>> 24, w -= O, !(16 & (O = j >>> 16 & 255))) {
|
|
1590
1590
|
if (!(64 & O)) {
|
|
1591
|
-
j = x[(65535 & j) + (
|
|
1591
|
+
j = x[(65535 & j) + (d & (1 << O) - 1)];
|
|
1592
1592
|
continue r;
|
|
1593
1593
|
}
|
|
1594
1594
|
l.msg = "invalid distance code", r.mode = 30;
|
|
1595
1595
|
break t;
|
|
1596
1596
|
}
|
|
1597
|
-
if (
|
|
1597
|
+
if (J = 65535 & j, w < (O &= 15) && (d += e[h++] << w, (w += 8) < O && (d += e[h++] << w, w += 8)), s < (J += d & (1 << O) - 1)) {
|
|
1598
1598
|
l.msg = "invalid distance too far back", r.mode = 30;
|
|
1599
1599
|
break t;
|
|
1600
1600
|
}
|
|
1601
|
-
if (
|
|
1602
|
-
if (n < (O =
|
|
1601
|
+
if (d >>>= O, w -= O, (O = v - m) < J) {
|
|
1602
|
+
if (n < (O = J - O) && r.sane) {
|
|
1603
1603
|
l.msg = "invalid distance too far back", r.mode = 30;
|
|
1604
1604
|
break t;
|
|
1605
1605
|
}
|
|
1606
|
-
if (T =
|
|
1607
|
-
if (g +=
|
|
1608
|
-
for (W -= O; D[v++] =
|
|
1609
|
-
g = v -
|
|
1606
|
+
if (T = i, (g = 0) === u) {
|
|
1607
|
+
if (g += c - O, O < W) {
|
|
1608
|
+
for (W -= O; D[v++] = i[g++], --O; ) ;
|
|
1609
|
+
g = v - J, T = D;
|
|
1610
1610
|
}
|
|
1611
1611
|
} else if (u < O) {
|
|
1612
|
-
if (g +=
|
|
1613
|
-
for (W -= O; D[v++] =
|
|
1612
|
+
if (g += c + u - O, (O -= u) < W) {
|
|
1613
|
+
for (W -= O; D[v++] = i[g++], --O; ) ;
|
|
1614
1614
|
if (g = 0, u < W) {
|
|
1615
|
-
for (W -= O = u; D[v++] =
|
|
1616
|
-
g = v -
|
|
1615
|
+
for (W -= O = u; D[v++] = i[g++], --O; ) ;
|
|
1616
|
+
g = v - J, T = D;
|
|
1617
1617
|
}
|
|
1618
1618
|
}
|
|
1619
1619
|
} else if (g += u - O, O < W) {
|
|
1620
|
-
for (W -= O; D[v++] =
|
|
1621
|
-
g = v -
|
|
1620
|
+
for (W -= O; D[v++] = i[g++], --O; ) ;
|
|
1621
|
+
g = v - J, T = D;
|
|
1622
1622
|
}
|
|
1623
1623
|
for (; 2 < W; ) D[v++] = T[g++], D[v++] = T[g++], D[v++] = T[g++], W -= 3;
|
|
1624
1624
|
W && (D[v++] = T[g++], 1 < W && (D[v++] = T[g++]));
|
|
1625
1625
|
} else {
|
|
1626
|
-
for (g = v -
|
|
1626
|
+
for (g = v - J; D[v++] = D[g++], D[v++] = D[g++], D[v++] = D[g++], 2 < (W -= 3); ) ;
|
|
1627
1627
|
W && (D[v++] = D[g++], 1 < W && (D[v++] = D[g++]));
|
|
1628
1628
|
}
|
|
1629
1629
|
break;
|
|
@@ -1631,32 +1631,32 @@ var Ct = { exports: {} };
|
|
|
1631
1631
|
}
|
|
1632
1632
|
break;
|
|
1633
1633
|
}
|
|
1634
|
-
} while (h <
|
|
1635
|
-
h -= W = w >> 3,
|
|
1634
|
+
} while (h < p && v < b);
|
|
1635
|
+
h -= W = w >> 3, d &= (1 << (w -= W << 3)) - 1, l.next_in = h, l.next_out = v, l.avail_in = h < p ? p - h + 5 : 5 - (h - p), l.avail_out = v < b ? b - v + 257 : 257 - (v - b), r.hold = d, r.bits = w;
|
|
1636
1636
|
};
|
|
1637
1637
|
}, {}], 49: [function(_, R, y) {
|
|
1638
|
-
var l = _("../utils/common"), a = _("./adler32"), r = _("./crc32"), h = _("./inffast"),
|
|
1639
|
-
function
|
|
1638
|
+
var l = _("../utils/common"), a = _("./adler32"), r = _("./crc32"), h = _("./inffast"), p = _("./inftrees"), v = 1, m = 2, b = 0, s = -2, c = 1, n = 852, u = 592;
|
|
1639
|
+
function i(g) {
|
|
1640
1640
|
return (g >>> 24 & 255) + (g >>> 8 & 65280) + ((65280 & g) << 8) + ((255 & g) << 24);
|
|
1641
1641
|
}
|
|
1642
|
-
function
|
|
1642
|
+
function d() {
|
|
1643
1643
|
this.mode = 0, this.last = !1, this.wrap = 0, this.havedict = !1, this.flags = 0, this.dmax = 0, this.check = 0, this.total = 0, this.head = null, this.wbits = 0, this.wsize = 0, this.whave = 0, this.wnext = 0, this.window = null, this.hold = 0, this.bits = 0, this.length = 0, this.offset = 0, this.extra = 0, this.lencode = null, this.distcode = null, this.lenbits = 0, this.distbits = 0, this.ncode = 0, this.nlen = 0, this.ndist = 0, this.have = 0, this.next = null, this.lens = new l.Buf16(320), this.work = new l.Buf16(288), this.lendyn = null, this.distdyn = null, this.sane = 0, this.back = 0, this.was = 0;
|
|
1644
1644
|
}
|
|
1645
1645
|
function w(g) {
|
|
1646
1646
|
var T;
|
|
1647
|
-
return g && g.state ? (T = g.state, g.total_in = g.total_out = T.total = 0, g.msg = "", T.wrap && (g.adler = 1 & T.wrap), T.mode =
|
|
1647
|
+
return g && g.state ? (T = g.state, g.total_in = g.total_out = T.total = 0, g.msg = "", T.wrap && (g.adler = 1 & T.wrap), T.mode = c, T.last = 0, T.havedict = 0, T.dmax = 32768, T.head = null, T.hold = 0, T.bits = 0, T.lencode = T.lendyn = new l.Buf32(n), T.distcode = T.distdyn = new l.Buf32(u), T.sane = 1, T.back = -1, b) : s;
|
|
1648
1648
|
}
|
|
1649
1649
|
function S(g) {
|
|
1650
1650
|
var T;
|
|
1651
|
-
return g && g.state ? ((T = g.state).wsize = 0, T.whave = 0, T.wnext = 0, w(g)) :
|
|
1651
|
+
return g && g.state ? ((T = g.state).wsize = 0, T.whave = 0, T.wnext = 0, w(g)) : s;
|
|
1652
1652
|
}
|
|
1653
1653
|
function x(g, T) {
|
|
1654
1654
|
var e, D;
|
|
1655
|
-
return g && g.state ? (D = g.state, T < 0 ? (e = 0, T = -T) : (e = 1 + (T >> 4), T < 48 && (T &= 15)), T && (T < 8 || 15 < T) ?
|
|
1655
|
+
return g && g.state ? (D = g.state, T < 0 ? (e = 0, T = -T) : (e = 1 + (T >> 4), T < 48 && (T &= 15)), T && (T < 8 || 15 < T) ? s : (D.window !== null && D.wbits !== T && (D.window = null), D.wrap = e, D.wbits = T, S(g))) : s;
|
|
1656
1656
|
}
|
|
1657
1657
|
function F(g, T) {
|
|
1658
1658
|
var e, D;
|
|
1659
|
-
return g ? (D = new
|
|
1659
|
+
return g ? (D = new d(), (g.state = D).window = null, (e = x(g, T)) !== b && (g.state = null), e) : s;
|
|
1660
1660
|
}
|
|
1661
1661
|
var I, j, O = !0;
|
|
1662
1662
|
function W(g) {
|
|
@@ -1666,23 +1666,23 @@ var Ct = { exports: {} };
|
|
|
1666
1666
|
for (; T < 256; ) g.lens[T++] = 9;
|
|
1667
1667
|
for (; T < 280; ) g.lens[T++] = 7;
|
|
1668
1668
|
for (; T < 288; ) g.lens[T++] = 8;
|
|
1669
|
-
for (
|
|
1670
|
-
m
|
|
1669
|
+
for (p(v, g.lens, 0, 288, I, 0, g.work, { bits: 9 }), T = 0; T < 32; ) g.lens[T++] = 5;
|
|
1670
|
+
p(m, g.lens, 0, 32, j, 0, g.work, { bits: 5 }), O = !1;
|
|
1671
1671
|
}
|
|
1672
1672
|
g.lencode = I, g.lenbits = 9, g.distcode = j, g.distbits = 5;
|
|
1673
1673
|
}
|
|
1674
|
-
function
|
|
1675
|
-
var
|
|
1676
|
-
return U.window === null && (U.wsize = 1 << U.wbits, U.wnext = 0, U.whave = 0, U.window = new l.Buf8(U.wsize)), D >= U.wsize ? (l.arraySet(U.window, T, e - U.wsize, U.wsize, 0), U.wnext = 0, U.whave = U.wsize) : (D < (
|
|
1674
|
+
function J(g, T, e, D) {
|
|
1675
|
+
var q, U = g.state;
|
|
1676
|
+
return U.window === null && (U.wsize = 1 << U.wbits, U.wnext = 0, U.whave = 0, U.window = new l.Buf8(U.wsize)), D >= U.wsize ? (l.arraySet(U.window, T, e - U.wsize, U.wsize, 0), U.wnext = 0, U.whave = U.wsize) : (D < (q = U.wsize - U.wnext) && (q = D), l.arraySet(U.window, T, e - D, q, U.wnext), (D -= q) ? (l.arraySet(U.window, T, e - D, D, 0), U.wnext = D, U.whave = U.wsize) : (U.wnext += q, U.wnext === U.wsize && (U.wnext = 0), U.whave < U.wsize && (U.whave += q))), 0;
|
|
1677
1677
|
}
|
|
1678
1678
|
y.inflateReset = S, y.inflateReset2 = x, y.inflateResetKeep = w, y.inflateInit = function(g) {
|
|
1679
1679
|
return F(g, 15);
|
|
1680
1680
|
}, y.inflateInit2 = F, y.inflate = function(g, T) {
|
|
1681
|
-
var e, D,
|
|
1682
|
-
if (!g || !g.state || !g.output || !g.input && g.avail_in !== 0) return
|
|
1683
|
-
(e = g.state).mode === 12 && (e.mode = 13), $ = g.next_out,
|
|
1681
|
+
var e, D, q, U, $, L, V, C, E, Y, G, H, it, lt, Q, et, ot, st, ct, ft, t, B, A, f, o = 0, k = new l.Buf8(4), N = [16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15];
|
|
1682
|
+
if (!g || !g.state || !g.output || !g.input && g.avail_in !== 0) return s;
|
|
1683
|
+
(e = g.state).mode === 12 && (e.mode = 13), $ = g.next_out, q = g.output, V = g.avail_out, U = g.next_in, D = g.input, L = g.avail_in, C = e.hold, E = e.bits, Y = L, G = V, B = b;
|
|
1684
1684
|
t: for (; ; ) switch (e.mode) {
|
|
1685
|
-
case
|
|
1685
|
+
case c:
|
|
1686
1686
|
if (e.wrap === 0) {
|
|
1687
1687
|
e.mode = 13;
|
|
1688
1688
|
break;
|
|
@@ -1781,9 +1781,9 @@ var Ct = { exports: {} };
|
|
|
1781
1781
|
if (L === 0) break t;
|
|
1782
1782
|
L--, C += D[U++] << E, E += 8;
|
|
1783
1783
|
}
|
|
1784
|
-
g.adler = e.check =
|
|
1784
|
+
g.adler = e.check = i(C), E = C = 0, e.mode = 11;
|
|
1785
1785
|
case 11:
|
|
1786
|
-
if (e.havedict === 0) return g.next_out = $, g.avail_out =
|
|
1786
|
+
if (e.havedict === 0) return g.next_out = $, g.avail_out = V, g.next_in = U, g.avail_in = L, e.hold = C, e.bits = E, 2;
|
|
1787
1787
|
g.adler = e.check = 1, e.mode = 12;
|
|
1788
1788
|
case 12:
|
|
1789
1789
|
if (T === 5 || T === 6) break t;
|
|
@@ -1826,8 +1826,8 @@ var Ct = { exports: {} };
|
|
|
1826
1826
|
e.mode = 16;
|
|
1827
1827
|
case 16:
|
|
1828
1828
|
if (H = e.length) {
|
|
1829
|
-
if (L < H && (H = L),
|
|
1830
|
-
l.arraySet(
|
|
1829
|
+
if (L < H && (H = L), V < H && (H = V), H === 0) break t;
|
|
1830
|
+
l.arraySet(q, D, U, H, $), L -= H, U += H, V -= H, $ += H, e.length -= H;
|
|
1831
1831
|
break;
|
|
1832
1832
|
}
|
|
1833
1833
|
e.mode = 12;
|
|
@@ -1851,7 +1851,7 @@ var Ct = { exports: {} };
|
|
|
1851
1851
|
e.lens[N[e.have++]] = 7 & C, C >>>= 3, E -= 3;
|
|
1852
1852
|
}
|
|
1853
1853
|
for (; e.have < 19; ) e.lens[N[e.have++]] = 0;
|
|
1854
|
-
if (e.lencode = e.lendyn, e.lenbits = 7, A = { bits: e.lenbits }, B =
|
|
1854
|
+
if (e.lencode = e.lendyn, e.lenbits = 7, A = { bits: e.lenbits }, B = p(0, e.lens, 0, 19, e.lencode, 0, e.work, A), e.lenbits = A.bits, B) {
|
|
1855
1855
|
g.msg = "invalid code lengths set", e.mode = 30;
|
|
1856
1856
|
break;
|
|
1857
1857
|
}
|
|
@@ -1899,11 +1899,11 @@ var Ct = { exports: {} };
|
|
|
1899
1899
|
g.msg = "invalid code -- missing end-of-block", e.mode = 30;
|
|
1900
1900
|
break;
|
|
1901
1901
|
}
|
|
1902
|
-
if (e.lenbits = 9, A = { bits: e.lenbits }, B =
|
|
1902
|
+
if (e.lenbits = 9, A = { bits: e.lenbits }, B = p(v, e.lens, 0, e.nlen, e.lencode, 0, e.work, A), e.lenbits = A.bits, B) {
|
|
1903
1903
|
g.msg = "invalid literal/lengths set", e.mode = 30;
|
|
1904
1904
|
break;
|
|
1905
1905
|
}
|
|
1906
|
-
if (e.distbits = 6, e.distcode = e.distdyn, A = { bits: e.distbits }, B = m
|
|
1906
|
+
if (e.distbits = 6, e.distcode = e.distdyn, A = { bits: e.distbits }, B = p(m, e.lens, e.nlen, e.ndist, e.distcode, 0, e.work, A), e.distbits = A.bits, B) {
|
|
1907
1907
|
g.msg = "invalid distances set", e.mode = 30;
|
|
1908
1908
|
break;
|
|
1909
1909
|
}
|
|
@@ -1911,8 +1911,8 @@ var Ct = { exports: {} };
|
|
|
1911
1911
|
case 20:
|
|
1912
1912
|
e.mode = 21;
|
|
1913
1913
|
case 21:
|
|
1914
|
-
if (6 <= L && 258 <=
|
|
1915
|
-
g.next_out = $, g.avail_out =
|
|
1914
|
+
if (6 <= L && 258 <= V) {
|
|
1915
|
+
g.next_out = $, g.avail_out = V, g.next_in = U, g.avail_in = L, e.hold = C, e.bits = E, h(g, G), $ = g.next_out, q = g.output, V = g.avail_out, U = g.next_in, D = g.input, L = g.avail_in, C = e.hold, E = e.bits, e.mode === 12 && (e.back = -1);
|
|
1916
1916
|
break;
|
|
1917
1917
|
}
|
|
1918
1918
|
for (e.back = 0; et = (o = e.lencode[C & (1 << e.lenbits) - 1]) >>> 16 & 255, ot = 65535 & o, !((Q = o >>> 24) <= E); ) {
|
|
@@ -1920,11 +1920,11 @@ var Ct = { exports: {} };
|
|
|
1920
1920
|
L--, C += D[U++] << E, E += 8;
|
|
1921
1921
|
}
|
|
1922
1922
|
if (et && !(240 & et)) {
|
|
1923
|
-
for (
|
|
1923
|
+
for (st = Q, ct = et, ft = ot; et = (o = e.lencode[ft + ((C & (1 << st + ct) - 1) >> st)]) >>> 16 & 255, ot = 65535 & o, !(st + (Q = o >>> 24) <= E); ) {
|
|
1924
1924
|
if (L === 0) break t;
|
|
1925
1925
|
L--, C += D[U++] << E, E += 8;
|
|
1926
1926
|
}
|
|
1927
|
-
C >>>=
|
|
1927
|
+
C >>>= st, E -= st, e.back += st;
|
|
1928
1928
|
}
|
|
1929
1929
|
if (C >>>= Q, E -= Q, e.back += Q, e.length = ot, et === 0) {
|
|
1930
1930
|
e.mode = 26;
|
|
@@ -1954,11 +1954,11 @@ var Ct = { exports: {} };
|
|
|
1954
1954
|
L--, C += D[U++] << E, E += 8;
|
|
1955
1955
|
}
|
|
1956
1956
|
if (!(240 & et)) {
|
|
1957
|
-
for (
|
|
1957
|
+
for (st = Q, ct = et, ft = ot; et = (o = e.distcode[ft + ((C & (1 << st + ct) - 1) >> st)]) >>> 16 & 255, ot = 65535 & o, !(st + (Q = o >>> 24) <= E); ) {
|
|
1958
1958
|
if (L === 0) break t;
|
|
1959
1959
|
L--, C += D[U++] << E, E += 8;
|
|
1960
1960
|
}
|
|
1961
|
-
C >>>=
|
|
1961
|
+
C >>>= st, E -= st, e.back += st;
|
|
1962
1962
|
}
|
|
1963
1963
|
if (C >>>= Q, E -= Q, e.back += Q, 64 & et) {
|
|
1964
1964
|
g.msg = "invalid distance code", e.mode = 30;
|
|
@@ -1979,20 +1979,20 @@ var Ct = { exports: {} };
|
|
|
1979
1979
|
}
|
|
1980
1980
|
e.mode = 25;
|
|
1981
1981
|
case 25:
|
|
1982
|
-
if (
|
|
1983
|
-
if (H = G -
|
|
1982
|
+
if (V === 0) break t;
|
|
1983
|
+
if (H = G - V, e.offset > H) {
|
|
1984
1984
|
if ((H = e.offset - H) > e.whave && e.sane) {
|
|
1985
1985
|
g.msg = "invalid distance too far back", e.mode = 30;
|
|
1986
1986
|
break;
|
|
1987
1987
|
}
|
|
1988
1988
|
it = H > e.wnext ? (H -= e.wnext, e.wsize - H) : e.wnext - H, H > e.length && (H = e.length), lt = e.window;
|
|
1989
|
-
} else lt =
|
|
1990
|
-
for (
|
|
1989
|
+
} else lt = q, it = $ - e.offset, H = e.length;
|
|
1990
|
+
for (V < H && (H = V), V -= H, e.length -= H; q[$++] = lt[it++], --H; ) ;
|
|
1991
1991
|
e.length === 0 && (e.mode = 21);
|
|
1992
1992
|
break;
|
|
1993
1993
|
case 26:
|
|
1994
|
-
if (
|
|
1995
|
-
|
|
1994
|
+
if (V === 0) break t;
|
|
1995
|
+
q[$++] = e.length, V--, e.mode = 21;
|
|
1996
1996
|
break;
|
|
1997
1997
|
case 27:
|
|
1998
1998
|
if (e.wrap) {
|
|
@@ -2000,7 +2000,7 @@ var Ct = { exports: {} };
|
|
|
2000
2000
|
if (L === 0) break t;
|
|
2001
2001
|
L--, C |= D[U++] << E, E += 8;
|
|
2002
2002
|
}
|
|
2003
|
-
if (G -=
|
|
2003
|
+
if (G -= V, g.total_out += G, e.total += G, G && (g.adler = e.check = e.flags ? r(e.check, q, G, $ - G) : a(e.check, q, G, $ - G)), G = V, (e.flags ? C : i(C)) !== e.check) {
|
|
2004
2004
|
g.msg = "incorrect data check", e.mode = 30;
|
|
2005
2005
|
break;
|
|
2006
2006
|
}
|
|
@@ -2030,48 +2030,48 @@ var Ct = { exports: {} };
|
|
|
2030
2030
|
return -4;
|
|
2031
2031
|
case 32:
|
|
2032
2032
|
default:
|
|
2033
|
-
return
|
|
2033
|
+
return s;
|
|
2034
2034
|
}
|
|
2035
|
-
return g.next_out = $, g.avail_out =
|
|
2035
|
+
return g.next_out = $, g.avail_out = V, g.next_in = U, g.avail_in = L, e.hold = C, e.bits = E, (e.wsize || G !== g.avail_out && e.mode < 30 && (e.mode < 27 || T !== 4)) && J(g, g.output, g.next_out, G - g.avail_out) ? (e.mode = 31, -4) : (Y -= g.avail_in, G -= g.avail_out, g.total_in += Y, g.total_out += G, e.total += G, e.wrap && G && (g.adler = e.check = e.flags ? r(e.check, q, G, g.next_out - G) : a(e.check, q, G, g.next_out - G)), g.data_type = e.bits + (e.last ? 64 : 0) + (e.mode === 12 ? 128 : 0) + (e.mode === 20 || e.mode === 15 ? 256 : 0), (Y == 0 && G === 0 || T === 4) && B === b && (B = -5), B);
|
|
2036
2036
|
}, y.inflateEnd = function(g) {
|
|
2037
|
-
if (!g || !g.state) return
|
|
2037
|
+
if (!g || !g.state) return s;
|
|
2038
2038
|
var T = g.state;
|
|
2039
2039
|
return T.window && (T.window = null), g.state = null, b;
|
|
2040
2040
|
}, y.inflateGetHeader = function(g, T) {
|
|
2041
2041
|
var e;
|
|
2042
|
-
return g && g.state && 2 & (e = g.state).wrap ? ((e.head = T).done = !1, b) :
|
|
2042
|
+
return g && g.state && 2 & (e = g.state).wrap ? ((e.head = T).done = !1, b) : s;
|
|
2043
2043
|
}, y.inflateSetDictionary = function(g, T) {
|
|
2044
2044
|
var e, D = T.length;
|
|
2045
|
-
return g && g.state ? (e = g.state).wrap !== 0 && e.mode !== 11 ?
|
|
2045
|
+
return g && g.state ? (e = g.state).wrap !== 0 && e.mode !== 11 ? s : e.mode === 11 && a(1, T, D, 0) !== e.check ? -3 : J(g, T, D, D) ? (e.mode = 31, -4) : (e.havedict = 1, b) : s;
|
|
2046
2046
|
}, y.inflateInfo = "pako inflate (from Nodeca project)";
|
|
2047
2047
|
}, { "../utils/common": 41, "./adler32": 43, "./crc32": 45, "./inffast": 48, "./inftrees": 50 }], 50: [function(_, R, y) {
|
|
2048
|
-
var l = _("../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], h = [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],
|
|
2049
|
-
R.exports = function(v,
|
|
2050
|
-
var
|
|
2048
|
+
var l = _("../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], h = [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], p = [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];
|
|
2049
|
+
R.exports = function(v, m, b, s, c, n, u, i) {
|
|
2050
|
+
var d, w, S, x, F, I, j, O, W, J = i.bits, g = 0, T = 0, e = 0, D = 0, q = 0, U = 0, $ = 0, L = 0, V = 0, C = 0, E = null, Y = 0, G = new l.Buf16(16), H = new l.Buf16(16), it = null, lt = 0;
|
|
2051
2051
|
for (g = 0; g <= 15; g++) G[g] = 0;
|
|
2052
|
-
for (T = 0; T <
|
|
2053
|
-
for (
|
|
2054
|
-
if (D <
|
|
2052
|
+
for (T = 0; T < s; T++) G[m[b + T]]++;
|
|
2053
|
+
for (q = J, D = 15; 1 <= D && G[D] === 0; D--) ;
|
|
2054
|
+
if (D < q && (q = D), D === 0) return c[n++] = 20971520, c[n++] = 20971520, i.bits = 1, 0;
|
|
2055
2055
|
for (e = 1; e < D && G[e] === 0; e++) ;
|
|
2056
|
-
for (
|
|
2056
|
+
for (q < e && (q = e), g = L = 1; g <= 15; g++) if (L <<= 1, (L -= G[g]) < 0) return -1;
|
|
2057
2057
|
if (0 < L && (v === 0 || D !== 1)) return -1;
|
|
2058
2058
|
for (H[1] = 0, g = 1; g < 15; g++) H[g + 1] = H[g] + G[g];
|
|
2059
|
-
for (T = 0; T <
|
|
2060
|
-
if (I = v === 0 ? (E = it = u, 19) : v === 1 ? (E = a, Y -= 257, it = r, lt -= 257, 256) : (E = h, it =
|
|
2059
|
+
for (T = 0; T < s; T++) m[b + T] !== 0 && (u[H[m[b + T]]++] = T);
|
|
2060
|
+
if (I = v === 0 ? (E = it = u, 19) : v === 1 ? (E = a, Y -= 257, it = r, lt -= 257, 256) : (E = h, it = p, -1), g = e, F = n, $ = T = C = 0, S = -1, x = (V = 1 << (U = q)) - 1, v === 1 && 852 < V || v === 2 && 592 < V) return 1;
|
|
2061
2061
|
for (; ; ) {
|
|
2062
|
-
for (j = g - $, W = u[T] < I ? (O = 0, u[T]) : u[T] > I ? (O = it[lt + u[T]], E[Y + u[T]]) : (O = 96, 0),
|
|
2063
|
-
for (
|
|
2064
|
-
if (
|
|
2062
|
+
for (j = g - $, W = u[T] < I ? (O = 0, u[T]) : u[T] > I ? (O = it[lt + u[T]], E[Y + u[T]]) : (O = 96, 0), d = 1 << g - $, e = w = 1 << U; c[F + (C >> $) + (w -= d)] = j << 24 | O << 16 | W | 0, w !== 0; ) ;
|
|
2063
|
+
for (d = 1 << g - 1; C & d; ) d >>= 1;
|
|
2064
|
+
if (d !== 0 ? (C &= d - 1, C += d) : C = 0, T++, --G[g] == 0) {
|
|
2065
2065
|
if (g === D) break;
|
|
2066
|
-
g =
|
|
2066
|
+
g = m[b + u[T]];
|
|
2067
2067
|
}
|
|
2068
|
-
if (
|
|
2069
|
-
for ($ === 0 && ($ =
|
|
2070
|
-
if (
|
|
2071
|
-
|
|
2068
|
+
if (q < g && (C & x) !== S) {
|
|
2069
|
+
for ($ === 0 && ($ = q), F += e, L = 1 << (U = g - $); U + $ < D && !((L -= G[U + $]) <= 0); ) U++, L <<= 1;
|
|
2070
|
+
if (V += 1 << U, v === 1 && 852 < V || v === 2 && 592 < V) return 1;
|
|
2071
|
+
c[S = C & x] = q << 24 | U << 16 | F - n | 0;
|
|
2072
2072
|
}
|
|
2073
2073
|
}
|
|
2074
|
-
return C !== 0 && (
|
|
2074
|
+
return C !== 0 && (c[F + C] = g - $ << 24 | 64 << 16 | 0), i.bits = q, 0;
|
|
2075
2075
|
};
|
|
2076
2076
|
}, { "../utils/common": 41 }], 51: [function(_, R, y) {
|
|
2077
2077
|
R.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" };
|
|
@@ -2080,9 +2080,9 @@ var Ct = { exports: {} };
|
|
|
2080
2080
|
function h(o) {
|
|
2081
2081
|
for (var k = o.length; 0 <= --k; ) o[k] = 0;
|
|
2082
2082
|
}
|
|
2083
|
-
var
|
|
2084
|
-
h(
|
|
2085
|
-
var g = new Array(2 *
|
|
2083
|
+
var p = 0, v = 29, m = 256, b = m + 1 + v, s = 30, c = 19, n = 2 * b + 1, u = 15, i = 16, d = 7, w = 256, S = 16, x = 17, F = 18, I = [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], j = [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], O = [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 3, 7], W = [16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15], J = new Array(2 * (b + 2));
|
|
2084
|
+
h(J);
|
|
2085
|
+
var g = new Array(2 * s);
|
|
2086
2086
|
h(g);
|
|
2087
2087
|
var T = new Array(512);
|
|
2088
2088
|
h(T);
|
|
@@ -2090,8 +2090,8 @@ var Ct = { exports: {} };
|
|
|
2090
2090
|
h(e);
|
|
2091
2091
|
var D = new Array(v);
|
|
2092
2092
|
h(D);
|
|
2093
|
-
var
|
|
2094
|
-
function
|
|
2093
|
+
var q, U, $, L = new Array(s);
|
|
2094
|
+
function V(o, k, N, P, z) {
|
|
2095
2095
|
this.static_tree = o, this.extra_bits = k, this.extra_base = N, this.elems = P, this.max_length = z, this.has_stree = o && o.length;
|
|
2096
2096
|
}
|
|
2097
2097
|
function C(o, k) {
|
|
@@ -2104,7 +2104,7 @@ var Ct = { exports: {} };
|
|
|
2104
2104
|
o.pending_buf[o.pending++] = 255 & k, o.pending_buf[o.pending++] = k >>> 8 & 255;
|
|
2105
2105
|
}
|
|
2106
2106
|
function G(o, k, N) {
|
|
2107
|
-
o.bi_valid >
|
|
2107
|
+
o.bi_valid > i - N ? (o.bi_buf |= k << o.bi_valid & 65535, Y(o, o.bi_buf), o.bi_buf = k >> i - o.bi_valid, o.bi_valid += N - i) : (o.bi_buf |= k << o.bi_valid & 65535, o.bi_valid += N);
|
|
2108
2108
|
}
|
|
2109
2109
|
function H(o, k, N) {
|
|
2110
2110
|
G(o, N[2 * k], N[2 * k + 1]);
|
|
@@ -2124,8 +2124,8 @@ var Ct = { exports: {} };
|
|
|
2124
2124
|
function Q(o) {
|
|
2125
2125
|
var k;
|
|
2126
2126
|
for (k = 0; k < b; k++) o.dyn_ltree[2 * k] = 0;
|
|
2127
|
-
for (k = 0; k <
|
|
2128
|
-
for (k = 0; k <
|
|
2127
|
+
for (k = 0; k < s; k++) o.dyn_dtree[2 * k] = 0;
|
|
2128
|
+
for (k = 0; k < c; k++) o.bl_tree[2 * k] = 0;
|
|
2129
2129
|
o.dyn_ltree[2 * w] = 1, o.opt_len = o.static_len = 0, o.last_lit = o.matches = 0;
|
|
2130
2130
|
}
|
|
2131
2131
|
function et(o) {
|
|
@@ -2135,31 +2135,31 @@ var Ct = { exports: {} };
|
|
|
2135
2135
|
var z = 2 * k, Z = 2 * N;
|
|
2136
2136
|
return o[z] < o[Z] || o[z] === o[Z] && P[k] <= P[N];
|
|
2137
2137
|
}
|
|
2138
|
-
function
|
|
2138
|
+
function st(o, k, N) {
|
|
2139
2139
|
for (var P = o.heap[N], z = N << 1; z <= o.heap_len && (z < o.heap_len && ot(k, o.heap[z + 1], o.heap[z], o.depth) && z++, !ot(k, P, o.heap[z], o.depth)); ) o.heap[N] = o.heap[z], N = z, z <<= 1;
|
|
2140
2140
|
o.heap[N] = P;
|
|
2141
2141
|
}
|
|
2142
2142
|
function ct(o, k, N) {
|
|
2143
2143
|
var P, z, Z, K, M = 0;
|
|
2144
|
-
if (o.last_lit !== 0) for (; P = o.pending_buf[o.d_buf + 2 * M] << 8 | o.pending_buf[o.d_buf + 2 * M + 1], z = o.pending_buf[o.l_buf + M], M++, P === 0 ? H(o, z, k) : (H(o, (Z = e[z]) +
|
|
2144
|
+
if (o.last_lit !== 0) for (; P = o.pending_buf[o.d_buf + 2 * M] << 8 | o.pending_buf[o.d_buf + 2 * M + 1], z = o.pending_buf[o.l_buf + M], M++, P === 0 ? H(o, z, k) : (H(o, (Z = e[z]) + m + 1, k), (K = I[Z]) !== 0 && G(o, z -= D[Z], K), H(o, Z = E(--P), N), (K = j[Z]) !== 0 && G(o, P -= L[Z], K)), M < o.last_lit; ) ;
|
|
2145
2145
|
H(o, w, k);
|
|
2146
2146
|
}
|
|
2147
2147
|
function ft(o, k) {
|
|
2148
2148
|
var N, P, z, Z = k.dyn_tree, K = k.stat_desc.static_tree, M = k.stat_desc.has_stree, X = k.stat_desc.elems, rt = -1;
|
|
2149
2149
|
for (o.heap_len = 0, o.heap_max = n, N = 0; N < X; N++) Z[2 * N] !== 0 ? (o.heap[++o.heap_len] = rt = N, o.depth[N] = 0) : Z[2 * N + 1] = 0;
|
|
2150
2150
|
for (; o.heap_len < 2; ) Z[2 * (z = o.heap[++o.heap_len] = rt < 2 ? ++rt : 0)] = 1, o.depth[z] = 0, o.opt_len--, M && (o.static_len -= K[2 * z + 1]);
|
|
2151
|
-
for (k.max_code = rt, N = o.heap_len >> 1; 1 <= N; N--)
|
|
2152
|
-
for (z = X; N = o.heap[1], o.heap[1] = o.heap[o.heap_len--],
|
|
2151
|
+
for (k.max_code = rt, N = o.heap_len >> 1; 1 <= N; N--) st(o, Z, N);
|
|
2152
|
+
for (z = X; N = o.heap[1], o.heap[1] = o.heap[o.heap_len--], st(o, Z, 1), P = o.heap[1], o.heap[--o.heap_max] = N, o.heap[--o.heap_max] = P, Z[2 * z] = Z[2 * N] + Z[2 * P], o.depth[z] = (o.depth[N] >= o.depth[P] ? o.depth[N] : o.depth[P]) + 1, Z[2 * N + 1] = Z[2 * P + 1] = z, o.heap[1] = z++, st(o, Z, 1), 2 <= o.heap_len; ) ;
|
|
2153
2153
|
o.heap[--o.heap_max] = o.heap[1], function(tt, ht) {
|
|
2154
|
-
var mt, dt, _t,
|
|
2155
|
-
for (
|
|
2156
|
-
for (pt[2 * tt.heap[tt.heap_max] + 1] = 0, mt = tt.heap_max + 1; mt < n; mt++) gt < (
|
|
2154
|
+
var mt, dt, _t, at, vt, xt, pt = ht.dyn_tree, St = ht.max_code, At = ht.stat_desc.static_tree, Ot = ht.stat_desc.has_stree, It = ht.stat_desc.extra_bits, zt = ht.stat_desc.extra_base, gt = ht.stat_desc.max_length, yt = 0;
|
|
2155
|
+
for (at = 0; at <= u; at++) tt.bl_count[at] = 0;
|
|
2156
|
+
for (pt[2 * tt.heap[tt.heap_max] + 1] = 0, mt = tt.heap_max + 1; mt < n; mt++) gt < (at = pt[2 * pt[2 * (dt = tt.heap[mt]) + 1] + 1] + 1) && (at = gt, yt++), pt[2 * dt + 1] = at, St < dt || (tt.bl_count[at]++, vt = 0, zt <= dt && (vt = It[dt - zt]), xt = pt[2 * dt], tt.opt_len += xt * (at + vt), Ot && (tt.static_len += xt * (At[2 * dt + 1] + vt)));
|
|
2157
2157
|
if (yt !== 0) {
|
|
2158
2158
|
do {
|
|
2159
|
-
for (
|
|
2160
|
-
tt.bl_count[
|
|
2159
|
+
for (at = gt - 1; tt.bl_count[at] === 0; ) at--;
|
|
2160
|
+
tt.bl_count[at]--, tt.bl_count[at + 1] += 2, tt.bl_count[gt]--, yt -= 2;
|
|
2161
2161
|
} while (0 < yt);
|
|
2162
|
-
for (
|
|
2162
|
+
for (at = gt; at !== 0; at--) for (dt = tt.bl_count[at]; dt !== 0; ) St < (_t = tt.heap[--mt]) || (pt[2 * _t + 1] !== at && (tt.opt_len += (at - pt[2 * _t + 1]) * pt[2 * _t], pt[2 * _t + 1] = at), dt--);
|
|
2163
2163
|
}
|
|
2164
2164
|
}(o, k), lt(Z, rt, o.bl_count);
|
|
2165
2165
|
}
|
|
@@ -2178,7 +2178,7 @@ var Ct = { exports: {} };
|
|
|
2178
2178
|
h(L);
|
|
2179
2179
|
var A = !1;
|
|
2180
2180
|
function f(o, k, N, P) {
|
|
2181
|
-
G(o, (
|
|
2181
|
+
G(o, (p << 1) + (P ? 1 : 0), 3), function(z, Z, K, M) {
|
|
2182
2182
|
et(z), Y(z, K), Y(z, ~K), l.arraySet(z.pending_buf, z.window, Z, K, z.pending), z.pending += K;
|
|
2183
2183
|
}(o, k, N);
|
|
2184
2184
|
}
|
|
@@ -2187,36 +2187,36 @@ var Ct = { exports: {} };
|
|
|
2187
2187
|
var k, N, P, z, Z, K = new Array(u + 1);
|
|
2188
2188
|
for (z = P = 0; z < v - 1; z++) for (D[z] = P, k = 0; k < 1 << I[z]; k++) e[P++] = z;
|
|
2189
2189
|
for (e[P - 1] = z, z = Z = 0; z < 16; z++) for (L[z] = Z, k = 0; k < 1 << j[z]; k++) T[Z++] = z;
|
|
2190
|
-
for (Z >>= 7; z <
|
|
2190
|
+
for (Z >>= 7; z < s; z++) for (L[z] = Z << 7, k = 0; k < 1 << j[z] - 7; k++) T[256 + Z++] = z;
|
|
2191
2191
|
for (N = 0; N <= u; N++) K[N] = 0;
|
|
2192
|
-
for (k = 0; k <= 143; )
|
|
2193
|
-
for (; k <= 255; )
|
|
2194
|
-
for (; k <= 279; )
|
|
2195
|
-
for (; k <= 287; )
|
|
2196
|
-
for (lt(
|
|
2197
|
-
|
|
2198
|
-
}(), A = !0), o.l_desc = new C(o.dyn_ltree,
|
|
2192
|
+
for (k = 0; k <= 143; ) J[2 * k + 1] = 8, k++, K[8]++;
|
|
2193
|
+
for (; k <= 255; ) J[2 * k + 1] = 9, k++, K[9]++;
|
|
2194
|
+
for (; k <= 279; ) J[2 * k + 1] = 7, k++, K[7]++;
|
|
2195
|
+
for (; k <= 287; ) J[2 * k + 1] = 8, k++, K[8]++;
|
|
2196
|
+
for (lt(J, b + 1, K), k = 0; k < s; k++) g[2 * k + 1] = 5, g[2 * k] = it(k, 5);
|
|
2197
|
+
q = new V(J, I, m + 1, b, u), U = new V(g, j, 0, s, u), $ = new V(new Array(0), O, 0, c, d);
|
|
2198
|
+
}(), A = !0), o.l_desc = new C(o.dyn_ltree, q), o.d_desc = new C(o.dyn_dtree, U), o.bl_desc = new C(o.bl_tree, $), o.bi_buf = 0, o.bi_valid = 0, Q(o);
|
|
2199
2199
|
}, y._tr_stored_block = f, y._tr_flush_block = function(o, k, N, P) {
|
|
2200
2200
|
var z, Z, K = 0;
|
|
2201
2201
|
0 < o.level ? (o.strm.data_type === 2 && (o.strm.data_type = function(M) {
|
|
2202
2202
|
var X, rt = 4093624447;
|
|
2203
2203
|
for (X = 0; X <= 31; X++, rt >>>= 1) if (1 & rt && M.dyn_ltree[2 * X] !== 0) return a;
|
|
2204
2204
|
if (M.dyn_ltree[18] !== 0 || M.dyn_ltree[20] !== 0 || M.dyn_ltree[26] !== 0) return r;
|
|
2205
|
-
for (X = 32; X <
|
|
2205
|
+
for (X = 32; X < m; X++) if (M.dyn_ltree[2 * X] !== 0) return r;
|
|
2206
2206
|
return a;
|
|
2207
2207
|
}(o)), ft(o, o.l_desc), ft(o, o.d_desc), K = function(M) {
|
|
2208
2208
|
var X;
|
|
2209
|
-
for (t(M, M.dyn_ltree, M.l_desc.max_code), t(M, M.dyn_dtree, M.d_desc.max_code), ft(M, M.bl_desc), X =
|
|
2209
|
+
for (t(M, M.dyn_ltree, M.l_desc.max_code), t(M, M.dyn_dtree, M.d_desc.max_code), ft(M, M.bl_desc), X = c - 1; 3 <= X && M.bl_tree[2 * W[X] + 1] === 0; X--) ;
|
|
2210
2210
|
return M.opt_len += 3 * (X + 1) + 5 + 5 + 4, X;
|
|
2211
|
-
}(o), z = o.opt_len + 3 + 7 >>> 3, (Z = o.static_len + 3 + 7 >>> 3) <= z && (z = Z)) : z = Z = N + 5, N + 4 <= z && k !== -1 ? f(o, k, N, P) : o.strategy === 4 || Z === z ? (G(o, 2 + (P ? 1 : 0), 3), ct(o,
|
|
2211
|
+
}(o), z = o.opt_len + 3 + 7 >>> 3, (Z = o.static_len + 3 + 7 >>> 3) <= z && (z = Z)) : z = Z = N + 5, N + 4 <= z && k !== -1 ? f(o, k, N, P) : o.strategy === 4 || Z === z ? (G(o, 2 + (P ? 1 : 0), 3), ct(o, J, g)) : (G(o, 4 + (P ? 1 : 0), 3), function(M, X, rt, tt) {
|
|
2212
2212
|
var ht;
|
|
2213
2213
|
for (G(M, X - 257, 5), G(M, rt - 1, 5), G(M, tt - 4, 4), ht = 0; ht < tt; ht++) G(M, M.bl_tree[2 * W[ht] + 1], 3);
|
|
2214
2214
|
B(M, M.dyn_ltree, X - 1), B(M, M.dyn_dtree, rt - 1);
|
|
2215
2215
|
}(o, o.l_desc.max_code + 1, o.d_desc.max_code + 1, K + 1), ct(o, o.dyn_ltree, o.dyn_dtree)), Q(o), P && et(o);
|
|
2216
2216
|
}, y._tr_tally = function(o, k, N) {
|
|
2217
|
-
return o.pending_buf[o.d_buf + 2 * o.last_lit] = k >>> 8 & 255, o.pending_buf[o.d_buf + 2 * o.last_lit + 1] = 255 & k, o.pending_buf[o.l_buf + o.last_lit] = 255 & N, o.last_lit++, k === 0 ? o.dyn_ltree[2 * N]++ : (o.matches++, k--, o.dyn_ltree[2 * (e[N] +
|
|
2217
|
+
return o.pending_buf[o.d_buf + 2 * o.last_lit] = k >>> 8 & 255, o.pending_buf[o.d_buf + 2 * o.last_lit + 1] = 255 & k, o.pending_buf[o.l_buf + o.last_lit] = 255 & N, o.last_lit++, k === 0 ? o.dyn_ltree[2 * N]++ : (o.matches++, k--, o.dyn_ltree[2 * (e[N] + m + 1)]++, o.dyn_dtree[2 * E(k)]++), o.last_lit === o.lit_bufsize - 1;
|
|
2218
2218
|
}, y._tr_align = function(o) {
|
|
2219
|
-
G(o, 2, 3), H(o, w,
|
|
2219
|
+
G(o, 2, 3), H(o, w, J), function(k) {
|
|
2220
2220
|
k.bi_valid === 16 ? (Y(k, k.bi_buf), k.bi_buf = 0, k.bi_valid = 0) : 8 <= k.bi_valid && (k.pending_buf[k.pending++] = 255 & k.bi_buf, k.bi_buf >>= 8, k.bi_valid -= 8);
|
|
2221
2221
|
}(o);
|
|
2222
2222
|
};
|
|
@@ -2228,10 +2228,10 @@ var Ct = { exports: {} };
|
|
|
2228
2228
|
(function(l) {
|
|
2229
2229
|
(function(a, r) {
|
|
2230
2230
|
if (!a.setImmediate) {
|
|
2231
|
-
var h,
|
|
2231
|
+
var h, p, v, m, b = 1, s = {}, c = !1, n = a.document, u = Object.getPrototypeOf && Object.getPrototypeOf(a);
|
|
2232
2232
|
u = u && u.setTimeout ? u : a, h = {}.toString.call(a.process) === "[object process]" ? function(S) {
|
|
2233
2233
|
Tt.nextTick(function() {
|
|
2234
|
-
|
|
2234
|
+
d(S);
|
|
2235
2235
|
});
|
|
2236
2236
|
} : function() {
|
|
2237
2237
|
if (a.postMessage && !a.importScripts) {
|
|
@@ -2240,35 +2240,35 @@ var Ct = { exports: {} };
|
|
|
2240
2240
|
S = !1;
|
|
2241
2241
|
}, a.postMessage("", "*"), a.onmessage = x, S;
|
|
2242
2242
|
}
|
|
2243
|
-
}() ? (
|
|
2244
|
-
a.postMessage(
|
|
2243
|
+
}() ? (m = "setImmediate$" + Math.random() + "$", a.addEventListener ? a.addEventListener("message", w, !1) : a.attachEvent("onmessage", w), function(S) {
|
|
2244
|
+
a.postMessage(m + S, "*");
|
|
2245
2245
|
}) : a.MessageChannel ? ((v = new MessageChannel()).port1.onmessage = function(S) {
|
|
2246
|
-
|
|
2246
|
+
d(S.data);
|
|
2247
2247
|
}, function(S) {
|
|
2248
2248
|
v.port2.postMessage(S);
|
|
2249
|
-
}) : n && "onreadystatechange" in n.createElement("script") ? (
|
|
2249
|
+
}) : n && "onreadystatechange" in n.createElement("script") ? (p = n.documentElement, function(S) {
|
|
2250
2250
|
var x = n.createElement("script");
|
|
2251
2251
|
x.onreadystatechange = function() {
|
|
2252
|
-
|
|
2253
|
-
},
|
|
2252
|
+
d(S), x.onreadystatechange = null, p.removeChild(x), x = null;
|
|
2253
|
+
}, p.appendChild(x);
|
|
2254
2254
|
}) : function(S) {
|
|
2255
|
-
setTimeout(
|
|
2255
|
+
setTimeout(d, 0, S);
|
|
2256
2256
|
}, u.setImmediate = function(S) {
|
|
2257
2257
|
typeof S != "function" && (S = new Function("" + S));
|
|
2258
2258
|
for (var x = new Array(arguments.length - 1), F = 0; F < x.length; F++) x[F] = arguments[F + 1];
|
|
2259
2259
|
var I = { callback: S, args: x };
|
|
2260
|
-
return
|
|
2261
|
-
}, u.clearImmediate =
|
|
2260
|
+
return s[b] = I, h(b), b++;
|
|
2261
|
+
}, u.clearImmediate = i;
|
|
2262
2262
|
}
|
|
2263
|
-
function
|
|
2264
|
-
delete
|
|
2263
|
+
function i(S) {
|
|
2264
|
+
delete s[S];
|
|
2265
2265
|
}
|
|
2266
|
-
function
|
|
2267
|
-
if (
|
|
2266
|
+
function d(S) {
|
|
2267
|
+
if (c) setTimeout(d, 0, S);
|
|
2268
2268
|
else {
|
|
2269
|
-
var x =
|
|
2269
|
+
var x = s[S];
|
|
2270
2270
|
if (x) {
|
|
2271
|
-
|
|
2271
|
+
c = !0;
|
|
2272
2272
|
try {
|
|
2273
2273
|
(function(F) {
|
|
2274
2274
|
var I = F.callback, j = F.args;
|
|
@@ -2290,22 +2290,22 @@ var Ct = { exports: {} };
|
|
|
2290
2290
|
}
|
|
2291
2291
|
})(x);
|
|
2292
2292
|
} finally {
|
|
2293
|
-
|
|
2293
|
+
i(S), c = !1;
|
|
2294
2294
|
}
|
|
2295
2295
|
}
|
|
2296
2296
|
}
|
|
2297
2297
|
}
|
|
2298
2298
|
function w(S) {
|
|
2299
|
-
S.source === a && typeof S.data == "string" && S.data.indexOf(
|
|
2299
|
+
S.source === a && typeof S.data == "string" && S.data.indexOf(m) === 0 && d(+S.data.slice(m.length));
|
|
2300
2300
|
}
|
|
2301
2301
|
})(typeof self > "u" ? l === void 0 ? this : l : self);
|
|
2302
2302
|
}).call(this, typeof wt < "u" ? wt : typeof self < "u" ? self : typeof window < "u" ? window : {});
|
|
2303
2303
|
}, {}] }, {}, [10])(10);
|
|
2304
2304
|
});
|
|
2305
2305
|
})(Ct);
|
|
2306
|
-
var
|
|
2307
|
-
const Et = /* @__PURE__ */ Bt(
|
|
2308
|
-
class
|
|
2306
|
+
var Ft = Ct.exports;
|
|
2307
|
+
const Et = /* @__PURE__ */ Bt(Ft);
|
|
2308
|
+
class Pt {
|
|
2309
2309
|
constructor(nt = {}) {
|
|
2310
2310
|
this.debug = nt.debug || !1, this.zip = new Et(), this.files = [], this.media = {}, this.mediaFiles = {}, this.fonts = {};
|
|
2311
2311
|
}
|
|
@@ -2330,26 +2330,26 @@ class Nt {
|
|
|
2330
2330
|
async getDocxData(nt, _ = !1) {
|
|
2331
2331
|
const R = await this.unzip(nt), y = Object.entries(R.files), l = {}, a = ["xml", "rels"];
|
|
2332
2332
|
for (const r of y) {
|
|
2333
|
-
const [h,
|
|
2334
|
-
if (a.some((v) =>
|
|
2335
|
-
const v = await
|
|
2333
|
+
const [h, p] = r;
|
|
2334
|
+
if (a.some((v) => p.name.endsWith(v))) {
|
|
2335
|
+
const v = await p.async("string");
|
|
2336
2336
|
this.files.push({
|
|
2337
|
-
name:
|
|
2337
|
+
name: p.name,
|
|
2338
2338
|
content: v
|
|
2339
2339
|
});
|
|
2340
|
-
} else if (
|
|
2340
|
+
} else if (p.name.startsWith("word/media") && p.name !== "word/media/")
|
|
2341
2341
|
if (_) {
|
|
2342
|
-
const
|
|
2343
|
-
l[
|
|
2342
|
+
const m = (await p.async("nodebuffer")).toString("base64");
|
|
2343
|
+
l[p.name] = m;
|
|
2344
2344
|
} else {
|
|
2345
|
-
const v = await
|
|
2346
|
-
this.mediaFiles[
|
|
2347
|
-
const
|
|
2348
|
-
this.media[
|
|
2345
|
+
const v = await p.async("blob"), m = this.getFileExtension(p.name), b = await p.async("base64");
|
|
2346
|
+
this.mediaFiles[p.name] = `data:image/${m};base64,${b}`;
|
|
2347
|
+
const s = new File([v], p.name, { type: v.type }), c = URL.createObjectURL(s);
|
|
2348
|
+
this.media[p.name] = c;
|
|
2349
2349
|
}
|
|
2350
|
-
else if (
|
|
2351
|
-
const v = await
|
|
2352
|
-
this.fonts[
|
|
2350
|
+
else if (p.name.startsWith("word/fonts") && p.name !== "word/fonts/") {
|
|
2351
|
+
const v = await p.async("uint8array");
|
|
2352
|
+
this.fonts[p.name] = v;
|
|
2353
2353
|
}
|
|
2354
2354
|
}
|
|
2355
2355
|
return this.files;
|
|
@@ -2361,32 +2361,18 @@ class Nt {
|
|
|
2361
2361
|
* Update [Content_Types].xml with extensions of new Image annotations
|
|
2362
2362
|
*/
|
|
2363
2363
|
async updateContentTypes(nt, _) {
|
|
2364
|
-
const R = Object.keys(_).map((
|
|
2364
|
+
const R = Object.keys(_).map((i) => this.getFileExtension(i)), y = "[Content_Types].xml", l = await nt.file(y).async("string");
|
|
2365
2365
|
let a = "";
|
|
2366
2366
|
const r = Rt(l), h = /* @__PURE__ */ new Set();
|
|
2367
|
-
for (let
|
|
2368
|
-
if (r.includes(
|
|
2369
|
-
const
|
|
2370
|
-
a +=
|
|
2371
|
-
}
|
|
2372
|
-
if (nt.files["word/comments.xml"]) {
|
|
2373
|
-
const c = '<Override PartName="/word/comments.xml" ContentType="application/vnd.openxmlformats-officedocument.wordprocessingml.comments+xml" />';
|
|
2374
|
-
l.includes(c) || (a += c);
|
|
2375
|
-
}
|
|
2376
|
-
if (nt.files["word/commentsExtended.xml"]) {
|
|
2377
|
-
const c = '<Override PartName="/word/commentsExtended.xml" ContentType="application/vnd.openxmlformats-officedocument.wordprocessingml.commentsExtended+xml" />';
|
|
2378
|
-
l.includes(c) || (a += c);
|
|
2379
|
-
}
|
|
2380
|
-
if (nt.files["word/commentsIds.xml"]) {
|
|
2381
|
-
const c = '<Override PartName="/word/commentsIds.xml" ContentType="application/vnd.openxmlformats-officedocument.wordprocessingml.commentsIds+xml" />';
|
|
2382
|
-
l.includes(c) || (a += c);
|
|
2383
|
-
}
|
|
2384
|
-
if (nt.files["word/commentsExtensible.xml"]) {
|
|
2385
|
-
const c = '<Override PartName="/word/commentsExtensible.xml" ContentType="application/vnd.openxmlformats-officedocument.wordprocessingml.commentsExtensible+xml" />';
|
|
2386
|
-
l.includes(c) || (a += c);
|
|
2367
|
+
for (let i of R) {
|
|
2368
|
+
if (r.includes(i) || h.has(i)) continue;
|
|
2369
|
+
const d = `<Default Extension="${i}" ContentType="image/${i}"/>`;
|
|
2370
|
+
a += d, h.add(i);
|
|
2387
2371
|
}
|
|
2388
|
-
const
|
|
2389
|
-
nt.
|
|
2372
|
+
const v = JSON.parse(Dt.xml2json(l, null, 2)).elements?.find((i) => i.name === "Types") || {}, m = v.elements?.some((i) => i.name === "Override" && i.attributes.PartName === "/word/comments.xml"), b = v.elements?.some((i) => i.name === "Override" && i.attributes.PartName === "/word/commentsExtended.xml"), s = v.elements?.some((i) => i.name === "Override" && i.attributes.PartName === "/word/commentsIds.xml"), c = v.elements?.some((i) => i.name === "Override" && i.attributes.PartName === "/word/commentsExtensible.xml");
|
|
2373
|
+
nt.files["word/comments.xml"] && (m || (a += '<Override PartName="/word/comments.xml" ContentType="application/vnd.openxmlformats-officedocument.wordprocessingml.comments+xml" />')), nt.files["word/commentsExtended.xml"] && (b || (a += '<Override PartName="/word/commentsExtended.xml" ContentType="application/vnd.openxmlformats-officedocument.wordprocessingml.commentsExtended+xml" />')), nt.files["word/commentsIds.xml"] && (s || (a += '<Override PartName="/word/commentsIds.xml" ContentType="application/vnd.openxmlformats-officedocument.wordprocessingml.commentsIds+xml" />')), nt.files["word/commentsExtensible.xml"] && (c || (a += '<Override PartName="/word/commentsExtensible.xml" ContentType="application/vnd.openxmlformats-officedocument.wordprocessingml.commentsExtensible+xml" />'));
|
|
2374
|
+
const n = '<Types xmlns="http://schemas.openxmlformats.org/package/2006/content-types">', u = l.replace(n, `${n}${a}`);
|
|
2375
|
+
nt.file(y, u);
|
|
2390
2376
|
}
|
|
2391
2377
|
async unzip(nt) {
|
|
2392
2378
|
return await this.zip.loadAsync(nt);
|
|
@@ -2430,8 +2416,8 @@ class Nt {
|
|
|
2430
2416
|
async exportFromOriginalFile(nt, _, R) {
|
|
2431
2417
|
const y = await this.unzip(nt), l = [];
|
|
2432
2418
|
return y.forEach((a, r) => {
|
|
2433
|
-
const h = r.async("string").then((
|
|
2434
|
-
y.file(r.name,
|
|
2419
|
+
const h = r.async("string").then((p) => {
|
|
2420
|
+
y.file(r.name, p);
|
|
2435
2421
|
});
|
|
2436
2422
|
l.push(h);
|
|
2437
2423
|
}), await Promise.all(l), Object.keys(_).forEach((a) => {
|
|
@@ -2442,6 +2428,6 @@ class Nt {
|
|
|
2442
2428
|
}
|
|
2443
2429
|
}
|
|
2444
2430
|
export {
|
|
2445
|
-
|
|
2431
|
+
Pt as D,
|
|
2446
2432
|
Et as J
|
|
2447
2433
|
};
|