@netlify/spark-ui 1.26.0-alpha.1 → 1.26.0-alpha.2

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (11) hide show
  1. package/dist/chunks/{AskNetlify.B3RnU2w-.js → AskNetlify.bx0blyGV.js} +1 -1
  2. package/dist/chunks/_commonjsHelpers.C6fGbg64.js +6 -0
  3. package/dist/chunks/browser.D58rdxmc.js +444 -0
  4. package/dist/components/preact/AskNetlify/AskNetlify.js +1 -1
  5. package/dist/components/preact/DropZone/drop-core/readFiles.js +276 -275
  6. package/dist/components/preact/SearchModal/components/SearchModal/SearchModal.js +1 -1
  7. package/dist/components/preact/index.js +1 -1
  8. package/package.json +2 -2
  9. package/packages/components/preact/DropZone/drop-core/readFiles.ts +12 -9
  10. package/dist/chunks/_commonjsHelpers.DaMA6jEr.js +0 -8
  11. package/dist/chunks/jszip.min.DGG1sjYa.js +0 -2327
package/dist/chunks/jszip.min.DGG1sjYa.js DELETED
@@ -1,2327 +0,0 @@
1
- import { c as bt, g as It } from "./_commonjsHelpers.DaMA6jEr.js";
2
- function vt(yt) {
3
- throw new Error('Could not dynamically require "' + yt + '". Please configure the dynamicRequireTargets or/and ignoreDynamicRequires option of @rollup/plugin-commonjs appropriately for this require call to work.');
4
- }
5
- var kt = { exports: {} };
6
- /*!
7
-
8
- JSZip v3.10.1 - A JavaScript class for generating and reading zip files
9
- <http://stuartk.com/jszip>
10
-
11
- (c) 2009-2016 Stuart Knightley <stuart [at] stuartk.com>
12
- Dual licenced under the MIT license or GPLv3. See https://raw.github.com/Stuk/jszip/main/LICENSE.markdown.
13
-
14
- JSZip uses the library pako released under the MIT license :
15
- https://github.com/nodeca/pako/blob/main/LICENSE
16
- */
17
- var zt;
18
- function Ot() {
19
- return zt || (zt = 1, function(yt, Tt) {
20
- (function(b) {
21
- yt.exports = b();
22
- })(function() {
23
- return function b(U, k, l) {
24
- function o(_, y) {
25
- if (!k[_]) {
26
- if (!U[_]) {
27
- var p = typeof vt == "function" && vt;
28
- if (!y && p) return p(_, !0);
29
- if (n) return n(_, !0);
30
- var g = new Error("Cannot find module '" + _ + "'");
31
- throw g.code = "MODULE_NOT_FOUND", g;
32
- }
33
- var i = k[_] = { exports: {} };
34
- U[_][0].call(i.exports, function(d) {
35
- var r = U[_][1][d];
36
- return o(r || d);
37
- }, i, i.exports, b, U, k, l);
38
- }
39
- return k[_].exports;
40
- }
41
- for (var n = typeof vt == "function" && vt, u = 0; u < l.length; u++) o(l[u]);
42
- return o;
43
- }({ 1: [function(b, U, k) {
44
- var l = b("./utils"), o = b("./support"), n = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/=";
45
- k.encode = function(u) {
46
- for (var _, y, p, g, i, d, r, h = [], a = 0, c = u.length, v = c, S = l.getTypeOf(u) !== "string"; a < u.length; ) v = c - a, p = S ? (_ = u[a++], y = a < c ? u[a++] : 0, a < c ? u[a++] : 0) : (_ = u.charCodeAt(a++), y = a < c ? u.charCodeAt(a++) : 0, a < c ? u.charCodeAt(a++) : 0), g = _ >> 2, i = (3 & _) << 4 | y >> 4, d = 1 < v ? (15 & y) << 2 | p >> 6 : 64, r = 2 < v ? 63 & p : 64, h.push(n.charAt(g) + n.charAt(i) + n.charAt(d) + n.charAt(r));
47
- return h.join("");
48
- }, k.decode = function(u) {
49
- var _, y, p, g, i, d, r = 0, h = 0, a = "data:";
50
- if (u.substr(0, a.length) === a) throw new Error("Invalid base64 input, it looks like a data url.");
51
- var c, v = 3 * (u = u.replace(/[^A-Za-z0-9+/=]/g, "")).length / 4;
52
- if (u.charAt(u.length - 1) === n.charAt(64) && v--, u.charAt(u.length - 2) === n.charAt(64) && v--, v % 1 != 0) throw new Error("Invalid base64 input, bad content length.");
53
- for (c = o.uint8array ? new Uint8Array(0 | v) : new Array(0 | v); r < u.length; ) _ = n.indexOf(u.charAt(r++)) << 2 | (g = n.indexOf(u.charAt(r++))) >> 4, y = (15 & g) << 4 | (i = n.indexOf(u.charAt(r++))) >> 2, p = (3 & i) << 6 | (d = n.indexOf(u.charAt(r++))), c[h++] = _, i !== 64 && (c[h++] = y), d !== 64 && (c[h++] = p);
54
- return c;
55
- };
56
- }, { "./support": 30, "./utils": 32 }], 2: [function(b, U, k) {
57
- var l = b("./external"), o = b("./stream/DataWorker"), n = b("./stream/Crc32Probe"), u = b("./stream/DataLengthProbe");
58
- function _(y, p, g, i, d) {
59
- this.compressedSize = y, this.uncompressedSize = p, this.crc32 = g, this.compression = i, this.compressedContent = d;
60
- }
61
- _.prototype = { getContentWorker: function() {
62
- var y = new o(l.Promise.resolve(this.compressedContent)).pipe(this.compression.uncompressWorker()).pipe(new u("data_length")), p = this;
63
- return y.on("end", function() {
64
- if (this.streamInfo.data_length !== p.uncompressedSize) throw new Error("Bug : uncompressed data size mismatch");
65
- }), y;
66
- }, getCompressedWorker: function() {
67
- return new o(l.Promise.resolve(this.compressedContent)).withStreamInfo("compressedSize", this.compressedSize).withStreamInfo("uncompressedSize", this.uncompressedSize).withStreamInfo("crc32", this.crc32).withStreamInfo("compression", this.compression);
68
- } }, _.createWorkerFrom = function(y, p, g) {
69
- return y.pipe(new n()).pipe(new u("uncompressedSize")).pipe(p.compressWorker(g)).pipe(new u("compressedSize")).withStreamInfo("compression", p);
70
- }, U.exports = _;
71
- }, { "./external": 6, "./stream/Crc32Probe": 25, "./stream/DataLengthProbe": 26, "./stream/DataWorker": 27 }], 3: [function(b, U, k) {
72
- var l = b("./stream/GenericWorker");
73
- k.STORE = { magic: "\0\0", compressWorker: function() {
74
- return new l("STORE compression");
75
- }, uncompressWorker: function() {
76
- return new l("STORE decompression");
77
- } }, k.DEFLATE = b("./flate");
78
- }, { "./flate": 7, "./stream/GenericWorker": 28 }], 4: [function(b, U, k) {
79
- var l = b("./utils"), o = function() {
80
- for (var n, u = [], _ = 0; _ < 256; _++) {
81
- n = _;
82
- for (var y = 0; y < 8; y++) n = 1 & n ? 3988292384 ^ n >>> 1 : n >>> 1;
83
- u[_] = n;
84
- }
85
- return u;
86
- }();
87
- U.exports = function(n, u) {
88
- return n !== void 0 && n.length ? l.getTypeOf(n) !== "string" ? function(_, y, p, g) {
89
- var i = o, d = g + p;
90
- _ ^= -1;
91
- for (var r = g; r < d; r++) _ = _ >>> 8 ^ i[255 & (_ ^ y[r])];
92
- return -1 ^ _;
93
- }(0 | u, n, n.length, 0) : function(_, y, p, g) {
94
- var i = o, d = g + p;
95
- _ ^= -1;
96
- for (var r = g; r < d; r++) _ = _ >>> 8 ^ i[255 & (_ ^ y.charCodeAt(r))];
97
- return -1 ^ _;
98
- }(0 | u, n, n.length, 0) : 0;
99
- };
100
- }, { "./utils": 32 }], 5: [function(b, U, k) {
101
- k.base64 = !1, k.binary = !1, k.dir = !1, k.createFolders = !0, k.date = null, k.compression = null, k.compressionOptions = null, k.comment = null, k.unixPermissions = null, k.dosPermissions = null;
102
- }, {}], 6: [function(b, U, k) {
103
- var l = null;
104
- l = typeof Promise < "u" ? Promise : b("lie"), U.exports = { Promise: l };
105
- }, { lie: 37 }], 7: [function(b, U, k) {
106
- var l = typeof Uint8Array < "u" && typeof Uint16Array < "u" && typeof Uint32Array < "u", o = b("pako"), n = b("./utils"), u = b("./stream/GenericWorker"), _ = l ? "uint8array" : "array";
107
- function y(p, g) {
108
- u.call(this, "FlateWorker/" + p), this._pako = null, this._pakoAction = p, this._pakoOptions = g, this.meta = {};
109
- }
110
- k.magic = "\b\0", n.inherits(y, u), y.prototype.processChunk = function(p) {
111
- this.meta = p.meta, this._pako === null && this._createPako(), this._pako.push(n.transformTo(_, p.data), !1);
112
- }, y.prototype.flush = function() {
113
- u.prototype.flush.call(this), this._pako === null && this._createPako(), this._pako.push([], !0);
114
- }, y.prototype.cleanUp = function() {
115
- u.prototype.cleanUp.call(this), this._pako = null;
116
- }, y.prototype._createPako = function() {
117
- this._pako = new o[this._pakoAction]({ raw: !0, level: this._pakoOptions.level || -1 });
118
- var p = this;
119
- this._pako.onData = function(g) {
120
- p.push({ data: g, meta: p.meta });
121
- };
122
- }, k.compressWorker = function(p) {
123
- return new y("Deflate", p);
124
- }, k.uncompressWorker = function() {
125
- return new y("Inflate", {});
126
- };
127
- }, { "./stream/GenericWorker": 28, "./utils": 32, pako: 38 }], 8: [function(b, U, k) {
128
- function l(i, d) {
129
- var r, h = "";
130
- for (r = 0; r < d; r++) h += String.fromCharCode(255 & i), i >>>= 8;
131
- return h;
132
- }
133
- function o(i, d, r, h, a, c) {
134
- var v, S, x = i.file, D = i.compression, O = c !== _.utf8encode, j = n.transformTo("string", c(x.name)), I = n.transformTo("string", _.utf8encode(x.name)), W = x.comment, q = n.transformTo("string", c(W)), m = n.transformTo("string", _.utf8encode(W)), B = I.length !== x.name.length, e = m.length !== W.length, T = "", J = "", P = "", $ = x.dir, L = x.date, V = { crc32: 0, compressedSize: 0, uncompressedSize: 0 };
135
- d && !r || (V.crc32 = i.crc32, V.compressedSize = i.compressedSize, V.uncompressedSize = i.uncompressedSize);
136
- var E = 0;
137
- d && (E |= 8), O || !B && !e || (E |= 2048);
138
- var C = 0, X = 0;
139
- $ && (C |= 16), a === "UNIX" ? (X = 798, C |= function(H, nt) {
140
- var ot = H;
141
- return H || (ot = nt ? 16893 : 33204), (65535 & ot) << 16;
142
- }(x.unixPermissions, $)) : (X = 20, C |= function(H) {
143
- return 63 & (H || 0);
144
- }(x.dosPermissions)), v = L.getUTCHours(), v <<= 6, v |= L.getUTCMinutes(), v <<= 5, v |= L.getUTCSeconds() / 2, S = L.getUTCFullYear() - 1980, S <<= 4, S |= L.getUTCMonth() + 1, S <<= 5, S |= L.getUTCDate(), B && (J = l(1, 1) + l(y(j), 4) + I, T += "up" + l(J.length, 2) + J), e && (P = l(1, 1) + l(y(q), 4) + m, T += "uc" + l(P.length, 2) + P);
145
- var G = "";
146
- return G += `
147
- \0`, G += l(E, 2), G += D.magic, G += l(v, 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(T.length, 2), { fileRecord: p.LOCAL_FILE_HEADER + G + j + T, dirRecord: p.CENTRAL_FILE_HEADER + l(X, 2) + G + l(q.length, 2) + "\0\0\0\0" + l(C, 4) + l(h, 4) + j + T + q };
148
- }
149
- var n = b("../utils"), u = b("../stream/GenericWorker"), _ = b("../utf8"), y = b("../crc32"), p = b("../signature");
150
- function g(i, d, r, h) {
151
- u.call(this, "ZipFileWorker"), this.bytesWritten = 0, this.zipComment = d, this.zipPlatform = r, this.encodeFileName = h, this.streamFiles = i, this.accumulate = !1, this.contentBuffer = [], this.dirRecords = [], this.currentSourceOffset = 0, this.entriesCount = 0, this.currentFile = null, this._sources = [];
152
- }
153
- n.inherits(g, u), g.prototype.push = function(i) {
154
- var d = i.meta.percent || 0, r = this.entriesCount, h = this._sources.length;
155
- this.accumulate ? this.contentBuffer.push(i) : (this.bytesWritten += i.data.length, u.prototype.push.call(this, { data: i.data, meta: { currentFile: this.currentFile, percent: r ? (d + 100 * (r - h - 1)) / r : 100 } }));
156
- }, g.prototype.openedSource = function(i) {
157
- this.currentSourceOffset = this.bytesWritten, this.currentFile = i.file.name;
158
- var d = this.streamFiles && !i.file.dir;
159
- if (d) {
160
- var r = o(i, d, !1, this.currentSourceOffset, this.zipPlatform, this.encodeFileName);
161
- this.push({ data: r.fileRecord, meta: { percent: 0 } });
162
- } else this.accumulate = !0;
163
- }, g.prototype.closedSource = function(i) {
164
- this.accumulate = !1;
165
- var d = this.streamFiles && !i.file.dir, r = o(i, d, !0, this.currentSourceOffset, this.zipPlatform, this.encodeFileName);
166
- if (this.dirRecords.push(r.dirRecord), d) this.push({ data: function(h) {
167
- return p.DATA_DESCRIPTOR + l(h.crc32, 4) + l(h.compressedSize, 4) + l(h.uncompressedSize, 4);
168
- }(i), meta: { percent: 100 } });
169
- else for (this.push({ data: r.fileRecord, meta: { percent: 0 } }); this.contentBuffer.length; ) this.push(this.contentBuffer.shift());
170
- this.currentFile = null;
171
- }, g.prototype.flush = function() {
172
- for (var i = this.bytesWritten, d = 0; d < this.dirRecords.length; d++) this.push({ data: this.dirRecords[d], meta: { percent: 100 } });
173
- var r = this.bytesWritten - i, h = function(a, c, v, S, x) {
174
- var D = n.transformTo("string", x(S));
175
- return p.CENTRAL_DIRECTORY_END + "\0\0\0\0" + l(a, 2) + l(a, 2) + l(c, 4) + l(v, 4) + l(D.length, 2) + D;
176
- }(this.dirRecords.length, r, i, this.zipComment, this.encodeFileName);
177
- this.push({ data: h, meta: { percent: 100 } });
178
- }, g.prototype.prepareNextSource = function() {
179
- this.previous = this._sources.shift(), this.openedSource(this.previous.streamInfo), this.isPaused ? this.previous.pause() : this.previous.resume();
180
- }, g.prototype.registerPrevious = function(i) {
181
- this._sources.push(i);
182
- var d = this;
183
- return i.on("data", function(r) {
184
- d.processChunk(r);
185
- }), i.on("end", function() {
186
- d.closedSource(d.previous.streamInfo), d._sources.length ? d.prepareNextSource() : d.end();
187
- }), i.on("error", function(r) {
188
- d.error(r);
189
- }), this;
190
- }, g.prototype.resume = function() {
191
- return !!u.prototype.resume.call(this) && (!this.previous && this._sources.length ? (this.prepareNextSource(), !0) : this.previous || this._sources.length || this.generatedError ? void 0 : (this.end(), !0));
192
- }, g.prototype.error = function(i) {
193
- var d = this._sources;
194
- if (!u.prototype.error.call(this, i)) return !1;
195
- for (var r = 0; r < d.length; r++) try {
196
- d[r].error(i);
197
- } catch {
198
- }
199
- return !0;
200
- }, g.prototype.lock = function() {
201
- u.prototype.lock.call(this);
202
- for (var i = this._sources, d = 0; d < i.length; d++) i[d].lock();
203
- }, U.exports = g;
204
- }, { "../crc32": 4, "../signature": 23, "../stream/GenericWorker": 28, "../utf8": 31, "../utils": 32 }], 9: [function(b, U, k) {
205
- var l = b("../compressions"), o = b("./ZipFileWorker");
206
- k.generateWorker = function(n, u, _) {
207
- var y = new o(u.streamFiles, _, u.platform, u.encodeFileName), p = 0;
208
- try {
209
- n.forEach(function(g, i) {
210
- p++;
211
- var d = function(c, v) {
212
- var S = c || v, x = l[S];
213
- if (!x) throw new Error(S + " is not a valid compression method !");
214
- return x;
215
- }(i.options.compression, u.compression), r = i.options.compressionOptions || u.compressionOptions || {}, h = i.dir, a = i.date;
216
- i._compressWorker(d, r).withStreamInfo("file", { name: g, dir: h, date: a, comment: i.comment || "", unixPermissions: i.unixPermissions, dosPermissions: i.dosPermissions }).pipe(y);
217
- }), y.entriesCount = p;
218
- } catch (g) {
219
- y.error(g);
220
- }
221
- return y;
222
- };
223
- }, { "../compressions": 3, "./ZipFileWorker": 8 }], 10: [function(b, U, k) {
224
- function l() {
225
- if (!(this instanceof l)) return new l();
226
- if (arguments.length) throw new Error("The constructor with parameters has been removed in JSZip 3.0, please check the upgrade guide.");
227
- this.files = /* @__PURE__ */ Object.create(null), this.comment = null, this.root = "", this.clone = function() {
228
- var o = new l();
229
- for (var n in this) typeof this[n] != "function" && (o[n] = this[n]);
230
- return o;
231
- };
232
- }
233
- (l.prototype = b("./object")).loadAsync = b("./load"), l.support = b("./support"), l.defaults = b("./defaults"), l.version = "3.10.1", l.loadAsync = function(o, n) {
234
- return new l().loadAsync(o, n);
235
- }, l.external = b("./external"), U.exports = l;
236
- }, { "./defaults": 5, "./external": 6, "./load": 11, "./object": 15, "./support": 30 }], 11: [function(b, U, k) {
237
- var l = b("./utils"), o = b("./external"), n = b("./utf8"), u = b("./zipEntries"), _ = b("./stream/Crc32Probe"), y = b("./nodejsUtils");
238
- function p(g) {
239
- return new o.Promise(function(i, d) {
240
- var r = g.decompressed.getContentWorker().pipe(new _());
241
- r.on("error", function(h) {
242
- d(h);
243
- }).on("end", function() {
244
- r.streamInfo.crc32 !== g.decompressed.crc32 ? d(new Error("Corrupted zip : CRC32 mismatch")) : i();
245
- }).resume();
246
- });
247
- }
248
- U.exports = function(g, i) {
249
- var d = this;
250
- return i = l.extend(i || {}, { base64: !1, checkCRC32: !1, optimizedBinaryString: !1, createFolders: !1, decodeFileName: n.utf8decode }), y.isNode && y.isStream(g) ? o.Promise.reject(new Error("JSZip can't accept a stream when loading a zip file.")) : l.prepareContent("the loaded zip file", g, !0, i.optimizedBinaryString, i.base64).then(function(r) {
251
- var h = new u(i);
252
- return h.load(r), h;
253
- }).then(function(r) {
254
- var h = [o.Promise.resolve(r)], a = r.files;
255
- if (i.checkCRC32) for (var c = 0; c < a.length; c++) h.push(p(a[c]));
256
- return o.Promise.all(h);
257
- }).then(function(r) {
258
- for (var h = r.shift(), a = h.files, c = 0; c < a.length; c++) {
259
- var v = a[c], S = v.fileNameStr, x = l.resolve(v.fileNameStr);
260
- d.file(x, v.decompressed, { binary: !0, optimizedBinaryString: !0, date: v.date, dir: v.dir, comment: v.fileCommentStr.length ? v.fileCommentStr : null, unixPermissions: v.unixPermissions, dosPermissions: v.dosPermissions, createFolders: i.createFolders }), v.dir || (d.file(x).unsafeOriginalName = S);
261
- }
262
- return h.zipComment.length && (d.comment = h.zipComment), d;
263
- });
264
- };
265
- }, { "./external": 6, "./nodejsUtils": 14, "./stream/Crc32Probe": 25, "./utf8": 31, "./utils": 32, "./zipEntries": 33 }], 12: [function(b, U, k) {
266
- var l = b("../utils"), o = b("../stream/GenericWorker");
267
- function n(u, _) {
268
- o.call(this, "Nodejs stream input adapter for " + u), this._upstreamEnded = !1, this._bindStream(_);
269
- }
270
- l.inherits(n, o), n.prototype._bindStream = function(u) {
271
- var _ = this;
272
- (this._stream = u).pause(), u.on("data", function(y) {
273
- _.push({ data: y, meta: { percent: 0 } });
274
- }).on("error", function(y) {
275
- _.isPaused ? this.generatedError = y : _.error(y);
276
- }).on("end", function() {
277
- _.isPaused ? _._upstreamEnded = !0 : _.end();
278
- });
279
- }, n.prototype.pause = function() {
280
- return !!o.prototype.pause.call(this) && (this._stream.pause(), !0);
281
- }, n.prototype.resume = function() {
282
- return !!o.prototype.resume.call(this) && (this._upstreamEnded ? this.end() : this._stream.resume(), !0);
283
- }, U.exports = n;
284
- }, { "../stream/GenericWorker": 28, "../utils": 32 }], 13: [function(b, U, k) {
285
- var l = b("readable-stream").Readable;
286
- function o(n, u, _) {
287
- l.call(this, u), this._helper = n;
288
- var y = this;
289
- n.on("data", function(p, g) {
290
- y.push(p) || y._helper.pause(), _ && _(g);
291
- }).on("error", function(p) {
292
- y.emit("error", p);
293
- }).on("end", function() {
294
- y.push(null);
295
- });
296
- }
297
- b("../utils").inherits(o, l), o.prototype._read = function() {
298
- this._helper.resume();
299
- }, U.exports = o;
300
- }, { "../utils": 32, "readable-stream": 16 }], 14: [function(b, U, k) {
301
- U.exports = { isNode: typeof Buffer < "u", newBufferFrom: function(l, o) {
302
- if (Buffer.from && Buffer.from !== Uint8Array.from) return Buffer.from(l, o);
303
- if (typeof l == "number") throw new Error('The "data" argument must not be a number');
304
- return new Buffer(l, o);
305
- }, allocBuffer: function(l) {
306
- if (Buffer.alloc) return Buffer.alloc(l);
307
- var o = new Buffer(l);
308
- return o.fill(0), o;
309
- }, isBuffer: function(l) {
310
- return Buffer.isBuffer(l);
311
- }, isStream: function(l) {
312
- return l && typeof l.on == "function" && typeof l.pause == "function" && typeof l.resume == "function";
313
- } };
314
- }, {}], 15: [function(b, U, k) {
315
- function l(x, D, O) {
316
- var j, I = n.getTypeOf(D), W = n.extend(O || {}, y);
317
- 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 = a(x)), W.createFolders && (j = h(x)) && c.call(this, j, !0);
318
- var q = I === "string" && W.binary === !1 && W.base64 === !1;
319
- O && O.binary !== void 0 || (W.binary = !q), (D instanceof p && D.uncompressedSize === 0 || W.dir || !D || D.length === 0) && (W.base64 = !1, W.binary = !0, D = "", W.compression = "STORE", I = "string");
320
- var m = null;
321
- m = D instanceof p || D instanceof u ? D : d.isNode && d.isStream(D) ? new r(x, D) : n.prepareContent(x, D, W.binary, W.optimizedBinaryString, W.base64);
322
- var B = new g(x, m, W);
323
- this.files[x] = B;
324
- }
325
- var o = b("./utf8"), n = b("./utils"), u = b("./stream/GenericWorker"), _ = b("./stream/StreamHelper"), y = b("./defaults"), p = b("./compressedObject"), g = b("./zipObject"), i = b("./generate"), d = b("./nodejsUtils"), r = b("./nodejs/NodejsStreamInputAdapter"), h = function(x) {
326
- x.slice(-1) === "/" && (x = x.substring(0, x.length - 1));
327
- var D = x.lastIndexOf("/");
328
- return 0 < D ? x.substring(0, D) : "";
329
- }, a = function(x) {
330
- return x.slice(-1) !== "/" && (x += "/"), x;
331
- }, c = function(x, D) {
332
- return D = D !== void 0 ? D : y.createFolders, x = a(x), this.files[x] || l.call(this, x, null, { dir: !0, createFolders: D }), this.files[x];
333
- };
334
- function v(x) {
335
- return Object.prototype.toString.call(x) === "[object RegExp]";
336
- }
337
- var S = { load: function() {
338
- throw new Error("This method has been removed in JSZip 3.0, please check the upgrade guide.");
339
- }, forEach: function(x) {
340
- var D, O, j;
341
- for (D in this.files) j = this.files[D], (O = D.slice(this.root.length, D.length)) && D.slice(0, this.root.length) === this.root && x(O, j);
342
- }, filter: function(x) {
343
- var D = [];
344
- return this.forEach(function(O, j) {
345
- x(O, j) && D.push(j);
346
- }), D;
347
- }, file: function(x, D, O) {
348
- if (arguments.length !== 1) return x = this.root + x, l.call(this, x, D, O), this;
349
- if (v(x)) {
350
- var j = x;
351
- return this.filter(function(W, q) {
352
- return !q.dir && j.test(W);
353
- });
354
- }
355
- var I = this.files[this.root + x];
356
- return I && !I.dir ? I : null;
357
- }, folder: function(x) {
358
- if (!x) return this;
359
- if (v(x)) return this.filter(function(I, W) {
360
- return W.dir && x.test(I);
361
- });
362
- var D = this.root + x, O = c.call(this, D), j = this.clone();
363
- return j.root = O.name, j;
364
- }, remove: function(x) {
365
- x = this.root + x;
366
- var D = this.files[x];
367
- if (D || (x.slice(-1) !== "/" && (x += "/"), D = this.files[x]), D && !D.dir) delete this.files[x];
368
- else for (var O = this.filter(function(I, W) {
369
- return W.name.slice(0, x.length) === x;
370
- }), j = 0; j < O.length; j++) delete this.files[O[j].name];
371
- return this;
372
- }, generate: function() {
373
- throw new Error("This method has been removed in JSZip 3.0, please check the upgrade guide.");
374
- }, generateInternalStream: function(x) {
375
- var D, O = {};
376
- try {
377
- if ((O = n.extend(x || {}, { streamFiles: !1, compression: "STORE", compressionOptions: null, type: "", platform: "DOS", comment: null, mimeType: "application/zip", encodeFileName: o.utf8encode })).type = O.type.toLowerCase(), O.compression = O.compression.toUpperCase(), O.type === "binarystring" && (O.type = "string"), !O.type) throw new Error("No output type specified.");
378
- n.checkSupport(O.type), O.platform !== "darwin" && O.platform !== "freebsd" && O.platform !== "linux" && O.platform !== "sunos" || (O.platform = "UNIX"), O.platform === "win32" && (O.platform = "DOS");
379
- var j = O.comment || this.comment || "";
380
- D = i.generateWorker(this, O, j);
381
- } catch (I) {
382
- (D = new u("error")).error(I);
383
- }
384
- return new _(D, O.type || "string", O.mimeType);
385
- }, generateAsync: function(x, D) {
386
- return this.generateInternalStream(x).accumulate(D);
387
- }, generateNodeStream: function(x, D) {
388
- return (x = x || {}).type || (x.type = "nodebuffer"), this.generateInternalStream(x).toNodejsStream(D);
389
- } };
390
- U.exports = S;
391
- }, { "./compressedObject": 2, "./defaults": 5, "./generate": 9, "./nodejs/NodejsStreamInputAdapter": 12, "./nodejsUtils": 14, "./stream/GenericWorker": 28, "./stream/StreamHelper": 29, "./utf8": 31, "./utils": 32, "./zipObject": 35 }], 16: [function(b, U, k) {
392
- U.exports = b("stream");
393
- }, { stream: void 0 }], 17: [function(b, U, k) {
394
- var l = b("./DataReader");
395
- function o(n) {
396
- l.call(this, n);
397
- for (var u = 0; u < this.data.length; u++) n[u] = 255 & n[u];
398
- }
399
- b("../utils").inherits(o, l), o.prototype.byteAt = function(n) {
400
- return this.data[this.zero + n];
401
- }, o.prototype.lastIndexOfSignature = function(n) {
402
- for (var u = n.charCodeAt(0), _ = n.charCodeAt(1), y = n.charCodeAt(2), p = n.charCodeAt(3), g = this.length - 4; 0 <= g; --g) if (this.data[g] === u && this.data[g + 1] === _ && this.data[g + 2] === y && this.data[g + 3] === p) return g - this.zero;
403
- return -1;
404
- }, o.prototype.readAndCheckSignature = function(n) {
405
- var u = n.charCodeAt(0), _ = n.charCodeAt(1), y = n.charCodeAt(2), p = n.charCodeAt(3), g = this.readData(4);
406
- return u === g[0] && _ === g[1] && y === g[2] && p === g[3];
407
- }, o.prototype.readData = function(n) {
408
- if (this.checkOffset(n), n === 0) return [];
409
- var u = this.data.slice(this.zero + this.index, this.zero + this.index + n);
410
- return this.index += n, u;
411
- }, U.exports = o;
412
- }, { "../utils": 32, "./DataReader": 18 }], 18: [function(b, U, k) {
413
- var l = b("../utils");
414
- function o(n) {
415
- this.data = n, this.length = n.length, this.index = 0, this.zero = 0;
416
- }
417
- o.prototype = { checkOffset: function(n) {
418
- this.checkIndex(this.index + n);
419
- }, checkIndex: function(n) {
420
- if (this.length < this.zero + n || n < 0) throw new Error("End of data reached (data length = " + this.length + ", asked index = " + n + "). Corrupted zip ?");
421
- }, setIndex: function(n) {
422
- this.checkIndex(n), this.index = n;
423
- }, skip: function(n) {
424
- this.setIndex(this.index + n);
425
- }, byteAt: function() {
426
- }, readInt: function(n) {
427
- var u, _ = 0;
428
- for (this.checkOffset(n), u = this.index + n - 1; u >= this.index; u--) _ = (_ << 8) + this.byteAt(u);
429
- return this.index += n, _;
430
- }, readString: function(n) {
431
- return l.transformTo("string", this.readData(n));
432
- }, readData: function() {
433
- }, lastIndexOfSignature: function() {
434
- }, readAndCheckSignature: function() {
435
- }, readDate: function() {
436
- var n = this.readInt(4);
437
- return new Date(Date.UTC(1980 + (n >> 25 & 127), (n >> 21 & 15) - 1, n >> 16 & 31, n >> 11 & 31, n >> 5 & 63, (31 & n) << 1));
438
- } }, U.exports = o;
439
- }, { "../utils": 32 }], 19: [function(b, U, k) {
440
- var l = b("./Uint8ArrayReader");
441
- function o(n) {
442
- l.call(this, n);
443
- }
444
- b("../utils").inherits(o, l), o.prototype.readData = function(n) {
445
- this.checkOffset(n);
446
- var u = this.data.slice(this.zero + this.index, this.zero + this.index + n);
447
- return this.index += n, u;
448
- }, U.exports = o;
449
- }, { "../utils": 32, "./Uint8ArrayReader": 21 }], 20: [function(b, U, k) {
450
- var l = b("./DataReader");
451
- function o(n) {
452
- l.call(this, n);
453
- }
454
- b("../utils").inherits(o, l), o.prototype.byteAt = function(n) {
455
- return this.data.charCodeAt(this.zero + n);
456
- }, o.prototype.lastIndexOfSignature = function(n) {
457
- return this.data.lastIndexOf(n) - this.zero;
458
- }, o.prototype.readAndCheckSignature = function(n) {
459
- return n === this.readData(4);
460
- }, o.prototype.readData = function(n) {
461
- this.checkOffset(n);
462
- var u = this.data.slice(this.zero + this.index, this.zero + this.index + n);
463
- return this.index += n, u;
464
- }, U.exports = o;
465
- }, { "../utils": 32, "./DataReader": 18 }], 21: [function(b, U, k) {
466
- var l = b("./ArrayReader");
467
- function o(n) {
468
- l.call(this, n);
469
- }
470
- b("../utils").inherits(o, l), o.prototype.readData = function(n) {
471
- if (this.checkOffset(n), n === 0) return new Uint8Array(0);
472
- var u = this.data.subarray(this.zero + this.index, this.zero + this.index + n);
473
- return this.index += n, u;
474
- }, U.exports = o;
475
- }, { "../utils": 32, "./ArrayReader": 17 }], 22: [function(b, U, k) {
476
- var l = b("../utils"), o = b("../support"), n = b("./ArrayReader"), u = b("./StringReader"), _ = b("./NodeBufferReader"), y = b("./Uint8ArrayReader");
477
- U.exports = function(p) {
478
- var g = l.getTypeOf(p);
479
- return l.checkSupport(g), g !== "string" || o.uint8array ? g === "nodebuffer" ? new _(p) : o.uint8array ? new y(l.transformTo("uint8array", p)) : new n(l.transformTo("array", p)) : new u(p);
480
- };
481
- }, { "../support": 30, "../utils": 32, "./ArrayReader": 17, "./NodeBufferReader": 19, "./StringReader": 20, "./Uint8ArrayReader": 21 }], 23: [function(b, U, k) {
482
- k.LOCAL_FILE_HEADER = "PK", k.CENTRAL_FILE_HEADER = "PK", k.CENTRAL_DIRECTORY_END = "PK", k.ZIP64_CENTRAL_DIRECTORY_LOCATOR = "PK\x07", k.ZIP64_CENTRAL_DIRECTORY_END = "PK", k.DATA_DESCRIPTOR = "PK\x07\b";
483
- }, {}], 24: [function(b, U, k) {
484
- var l = b("./GenericWorker"), o = b("../utils");
485
- function n(u) {
486
- l.call(this, "ConvertWorker to " + u), this.destType = u;
487
- }
488
- o.inherits(n, l), n.prototype.processChunk = function(u) {
489
- this.push({ data: o.transformTo(this.destType, u.data), meta: u.meta });
490
- }, U.exports = n;
491
- }, { "../utils": 32, "./GenericWorker": 28 }], 25: [function(b, U, k) {
492
- var l = b("./GenericWorker"), o = b("../crc32");
493
- function n() {
494
- l.call(this, "Crc32Probe"), this.withStreamInfo("crc32", 0);
495
- }
496
- b("../utils").inherits(n, l), n.prototype.processChunk = function(u) {
497
- this.streamInfo.crc32 = o(u.data, this.streamInfo.crc32 || 0), this.push(u);
498
- }, U.exports = n;
499
- }, { "../crc32": 4, "../utils": 32, "./GenericWorker": 28 }], 26: [function(b, U, k) {
500
- var l = b("../utils"), o = b("./GenericWorker");
501
- function n(u) {
502
- o.call(this, "DataLengthProbe for " + u), this.propName = u, this.withStreamInfo(u, 0);
503
- }
504
- l.inherits(n, o), n.prototype.processChunk = function(u) {
505
- if (u) {
506
- var _ = this.streamInfo[this.propName] || 0;
507
- this.streamInfo[this.propName] = _ + u.data.length;
508
- }
509
- o.prototype.processChunk.call(this, u);
510
- }, U.exports = n;
511
- }, { "../utils": 32, "./GenericWorker": 28 }], 27: [function(b, U, k) {
512
- var l = b("../utils"), o = b("./GenericWorker");
513
- function n(u) {
514
- o.call(this, "DataWorker");
515
- var _ = this;
516
- this.dataIsReady = !1, this.index = 0, this.max = 0, this.data = null, this.type = "", this._tickScheduled = !1, u.then(function(y) {
517
- _.dataIsReady = !0, _.data = y, _.max = y && y.length || 0, _.type = l.getTypeOf(y), _.isPaused || _._tickAndRepeat();
518
- }, function(y) {
519
- _.error(y);
520
- });
521
- }
522
- l.inherits(n, o), n.prototype.cleanUp = function() {
523
- o.prototype.cleanUp.call(this), this.data = null;
524
- }, n.prototype.resume = function() {
525
- return !!o.prototype.resume.call(this) && (!this._tickScheduled && this.dataIsReady && (this._tickScheduled = !0, l.delay(this._tickAndRepeat, [], this)), !0);
526
- }, n.prototype._tickAndRepeat = function() {
527
- this._tickScheduled = !1, this.isPaused || this.isFinished || (this._tick(), this.isFinished || (l.delay(this._tickAndRepeat, [], this), this._tickScheduled = !0));
528
- }, n.prototype._tick = function() {
529
- if (this.isPaused || this.isFinished) return !1;
530
- var u = null, _ = Math.min(this.max, this.index + 16384);
531
- if (this.index >= this.max) return this.end();
532
- switch (this.type) {
533
- case "string":
534
- u = this.data.substring(this.index, _);
535
- break;
536
- case "uint8array":
537
- u = this.data.subarray(this.index, _);
538
- break;
539
- case "array":
540
- case "nodebuffer":
541
- u = this.data.slice(this.index, _);
542
- }
543
- return this.index = _, this.push({ data: u, meta: { percent: this.max ? this.index / this.max * 100 : 0 } });
544
- }, U.exports = n;
545
- }, { "../utils": 32, "./GenericWorker": 28 }], 28: [function(b, U, k) {
546
- function l(o) {
547
- this.name = o || "default", this.streamInfo = {}, this.generatedError = null, this.extraStreamInfo = {}, this.isPaused = !0, this.isFinished = !1, this.isLocked = !1, this._listeners = { data: [], end: [], error: [] }, this.previous = null;
548
- }
549
- l.prototype = { push: function(o) {
550
- this.emit("data", o);
551
- }, end: function() {
552
- if (this.isFinished) return !1;
553
- this.flush();
554
- try {
555
- this.emit("end"), this.cleanUp(), this.isFinished = !0;
556
- } catch (o) {
557
- this.emit("error", o);
558
- }
559
- return !0;
560
- }, error: function(o) {
561
- return !this.isFinished && (this.isPaused ? this.generatedError = o : (this.isFinished = !0, this.emit("error", o), this.previous && this.previous.error(o), this.cleanUp()), !0);
562
- }, on: function(o, n) {
563
- return this._listeners[o].push(n), this;
564
- }, cleanUp: function() {
565
- this.streamInfo = this.generatedError = this.extraStreamInfo = null, this._listeners = [];
566
- }, emit: function(o, n) {
567
- if (this._listeners[o]) for (var u = 0; u < this._listeners[o].length; u++) this._listeners[o][u].call(this, n);
568
- }, pipe: function(o) {
569
- return o.registerPrevious(this);
570
- }, registerPrevious: function(o) {
571
- if (this.isLocked) throw new Error("The stream '" + this + "' has already been used.");
572
- this.streamInfo = o.streamInfo, this.mergeStreamInfo(), this.previous = o;
573
- var n = this;
574
- return o.on("data", function(u) {
575
- n.processChunk(u);
576
- }), o.on("end", function() {
577
- n.end();
578
- }), o.on("error", function(u) {
579
- n.error(u);
580
- }), this;
581
- }, pause: function() {
582
- return !this.isPaused && !this.isFinished && (this.isPaused = !0, this.previous && this.previous.pause(), !0);
583
- }, resume: function() {
584
- if (!this.isPaused || this.isFinished) return !1;
585
- var o = this.isPaused = !1;
586
- return this.generatedError && (this.error(this.generatedError), o = !0), this.previous && this.previous.resume(), !o;
587
- }, flush: function() {
588
- }, processChunk: function(o) {
589
- this.push(o);
590
- }, withStreamInfo: function(o, n) {
591
- return this.extraStreamInfo[o] = n, this.mergeStreamInfo(), this;
592
- }, mergeStreamInfo: function() {
593
- for (var o in this.extraStreamInfo) Object.prototype.hasOwnProperty.call(this.extraStreamInfo, o) && (this.streamInfo[o] = this.extraStreamInfo[o]);
594
- }, lock: function() {
595
- if (this.isLocked) throw new Error("The stream '" + this + "' has already been used.");
596
- this.isLocked = !0, this.previous && this.previous.lock();
597
- }, toString: function() {
598
- var o = "Worker " + this.name;
599
- return this.previous ? this.previous + " -> " + o : o;
600
- } }, U.exports = l;
601
- }, {}], 29: [function(b, U, k) {
602
- var l = b("../utils"), o = b("./ConvertWorker"), n = b("./GenericWorker"), u = b("../base64"), _ = b("../support"), y = b("../external"), p = null;
603
- if (_.nodestream) try {
604
- p = b("../nodejs/NodejsStreamOutputAdapter");
605
- } catch {
606
- }
607
- function g(d, r) {
608
- return new y.Promise(function(h, a) {
609
- var c = [], v = d._internalType, S = d._outputType, x = d._mimeType;
610
- d.on("data", function(D, O) {
611
- c.push(D), r && r(O);
612
- }).on("error", function(D) {
613
- c = [], a(D);
614
- }).on("end", function() {
615
- try {
616
- var D = function(O, j, I) {
617
- switch (O) {
618
- case "blob":
619
- return l.newBlob(l.transformTo("arraybuffer", j), I);
620
- case "base64":
621
- return u.encode(j);
622
- default:
623
- return l.transformTo(O, j);
624
- }
625
- }(S, function(O, j) {
626
- var I, W = 0, q = null, m = 0;
627
- for (I = 0; I < j.length; I++) m += j[I].length;
628
- switch (O) {
629
- case "string":
630
- return j.join("");
631
- case "array":
632
- return Array.prototype.concat.apply([], j);
633
- case "uint8array":
634
- for (q = new Uint8Array(m), I = 0; I < j.length; I++) q.set(j[I], W), W += j[I].length;
635
- return q;
636
- case "nodebuffer":
637
- return Buffer.concat(j);
638
- default:
639
- throw new Error("concat : unsupported type '" + O + "'");
640
- }
641
- }(v, c), x);
642
- h(D);
643
- } catch (O) {
644
- a(O);
645
- }
646
- c = [];
647
- }).resume();
648
- });
649
- }
650
- function i(d, r, h) {
651
- var a = r;
652
- switch (r) {
653
- case "blob":
654
- case "arraybuffer":
655
- a = "uint8array";
656
- break;
657
- case "base64":
658
- a = "string";
659
- }
660
- try {
661
- this._internalType = a, this._outputType = r, this._mimeType = h, l.checkSupport(a), this._worker = d.pipe(new o(a)), d.lock();
662
- } catch (c) {
663
- this._worker = new n("error"), this._worker.error(c);
664
- }
665
- }
666
- i.prototype = { accumulate: function(d) {
667
- return g(this, d);
668
- }, on: function(d, r) {
669
- var h = this;
670
- return d === "data" ? this._worker.on(d, function(a) {
671
- r.call(h, a.data, a.meta);
672
- }) : this._worker.on(d, function() {
673
- l.delay(r, arguments, h);
674
- }), this;
675
- }, resume: function() {
676
- return l.delay(this._worker.resume, [], this._worker), this;
677
- }, pause: function() {
678
- return this._worker.pause(), this;
679
- }, toNodejsStream: function(d) {
680
- if (l.checkSupport("nodestream"), this._outputType !== "nodebuffer") throw new Error(this._outputType + " is not supported by this method");
681
- return new p(this, { objectMode: this._outputType !== "nodebuffer" }, d);
682
- } }, U.exports = i;
683
- }, { "../base64": 1, "../external": 6, "../nodejs/NodejsStreamOutputAdapter": 13, "../support": 30, "../utils": 32, "./ConvertWorker": 24, "./GenericWorker": 28 }], 30: [function(b, U, k) {
684
- if (k.base64 = !0, k.array = !0, k.string = !0, k.arraybuffer = typeof ArrayBuffer < "u" && typeof Uint8Array < "u", k.nodebuffer = typeof Buffer < "u", k.uint8array = typeof Uint8Array < "u", typeof ArrayBuffer > "u") k.blob = !1;
685
- else {
686
- var l = new ArrayBuffer(0);
687
- try {
688
- k.blob = new Blob([l], { type: "application/zip" }).size === 0;
689
- } catch {
690
- try {
691
- var o = new (self.BlobBuilder || self.WebKitBlobBuilder || self.MozBlobBuilder || self.MSBlobBuilder)();
692
- o.append(l), k.blob = o.getBlob("application/zip").size === 0;
693
- } catch {
694
- k.blob = !1;
695
- }
696
- }
697
- }
698
- try {
699
- k.nodestream = !!b("readable-stream").Readable;
700
- } catch {
701
- k.nodestream = !1;
702
- }
703
- }, { "readable-stream": 16 }], 31: [function(b, U, k) {
704
- for (var l = b("./utils"), o = b("./support"), n = b("./nodejsUtils"), u = b("./stream/GenericWorker"), _ = new Array(256), y = 0; y < 256; y++) _[y] = 252 <= y ? 6 : 248 <= y ? 5 : 240 <= y ? 4 : 224 <= y ? 3 : 192 <= y ? 2 : 1;
705
- _[254] = _[254] = 1;
706
- function p() {
707
- u.call(this, "utf-8 decode"), this.leftOver = null;
708
- }
709
- function g() {
710
- u.call(this, "utf-8 encode");
711
- }
712
- k.utf8encode = function(i) {
713
- return o.nodebuffer ? n.newBufferFrom(i, "utf-8") : function(d) {
714
- var r, h, a, c, v, S = d.length, x = 0;
715
- for (c = 0; c < S; c++) (64512 & (h = d.charCodeAt(c))) == 55296 && c + 1 < S && (64512 & (a = d.charCodeAt(c + 1))) == 56320 && (h = 65536 + (h - 55296 << 10) + (a - 56320), c++), x += h < 128 ? 1 : h < 2048 ? 2 : h < 65536 ? 3 : 4;
716
- for (r = o.uint8array ? new Uint8Array(x) : new Array(x), c = v = 0; v < x; c++) (64512 & (h = d.charCodeAt(c))) == 55296 && c + 1 < S && (64512 & (a = d.charCodeAt(c + 1))) == 56320 && (h = 65536 + (h - 55296 << 10) + (a - 56320), c++), h < 128 ? r[v++] = h : (h < 2048 ? r[v++] = 192 | h >>> 6 : (h < 65536 ? r[v++] = 224 | h >>> 12 : (r[v++] = 240 | h >>> 18, r[v++] = 128 | h >>> 12 & 63), r[v++] = 128 | h >>> 6 & 63), r[v++] = 128 | 63 & h);
717
- return r;
718
- }(i);
719
- }, k.utf8decode = function(i) {
720
- return o.nodebuffer ? l.transformTo("nodebuffer", i).toString("utf-8") : function(d) {
721
- var r, h, a, c, v = d.length, S = new Array(2 * v);
722
- for (r = h = 0; r < v; ) if ((a = d[r++]) < 128) S[h++] = a;
723
- else if (4 < (c = _[a])) S[h++] = 65533, r += c - 1;
724
- else {
725
- for (a &= c === 2 ? 31 : c === 3 ? 15 : 7; 1 < c && r < v; ) a = a << 6 | 63 & d[r++], c--;
726
- 1 < c ? S[h++] = 65533 : a < 65536 ? S[h++] = a : (a -= 65536, S[h++] = 55296 | a >> 10 & 1023, S[h++] = 56320 | 1023 & a);
727
- }
728
- return S.length !== h && (S.subarray ? S = S.subarray(0, h) : S.length = h), l.applyFromCharCode(S);
729
- }(i = l.transformTo(o.uint8array ? "uint8array" : "array", i));
730
- }, l.inherits(p, u), p.prototype.processChunk = function(i) {
731
- var d = l.transformTo(o.uint8array ? "uint8array" : "array", i.data);
732
- if (this.leftOver && this.leftOver.length) {
733
- if (o.uint8array) {
734
- var r = d;
735
- (d = new Uint8Array(r.length + this.leftOver.length)).set(this.leftOver, 0), d.set(r, this.leftOver.length);
736
- } else d = this.leftOver.concat(d);
737
- this.leftOver = null;
738
- }
739
- var h = function(c, v) {
740
- var S;
741
- for ((v = v || c.length) > c.length && (v = c.length), S = v - 1; 0 <= S && (192 & c[S]) == 128; ) S--;
742
- return S < 0 || S === 0 ? v : S + _[c[S]] > v ? S : v;
743
- }(d), a = d;
744
- h !== d.length && (o.uint8array ? (a = d.subarray(0, h), this.leftOver = d.subarray(h, d.length)) : (a = d.slice(0, h), this.leftOver = d.slice(h, d.length))), this.push({ data: k.utf8decode(a), meta: i.meta });
745
- }, p.prototype.flush = function() {
746
- this.leftOver && this.leftOver.length && (this.push({ data: k.utf8decode(this.leftOver), meta: {} }), this.leftOver = null);
747
- }, k.Utf8DecodeWorker = p, l.inherits(g, u), g.prototype.processChunk = function(i) {
748
- this.push({ data: k.utf8encode(i.data), meta: i.meta });
749
- }, k.Utf8EncodeWorker = g;
750
- }, { "./nodejsUtils": 14, "./stream/GenericWorker": 28, "./support": 30, "./utils": 32 }], 32: [function(b, U, k) {
751
- var l = b("./support"), o = b("./base64"), n = b("./nodejsUtils"), u = b("./external");
752
- function _(r) {
753
- return r;
754
- }
755
- function y(r, h) {
756
- for (var a = 0; a < r.length; ++a) h[a] = 255 & r.charCodeAt(a);
757
- return h;
758
- }
759
- b("setimmediate"), k.newBlob = function(r, h) {
760
- k.checkSupport("blob");
761
- try {
762
- return new Blob([r], { type: h });
763
- } catch {
764
- try {
765
- var a = new (self.BlobBuilder || self.WebKitBlobBuilder || self.MozBlobBuilder || self.MSBlobBuilder)();
766
- return a.append(r), a.getBlob(h);
767
- } catch {
768
- throw new Error("Bug : can't construct the Blob.");
769
- }
770
- }
771
- };
772
- var p = { stringifyByChunk: function(r, h, a) {
773
- var c = [], v = 0, S = r.length;
774
- if (S <= a) return String.fromCharCode.apply(null, r);
775
- for (; v < S; ) h === "array" || h === "nodebuffer" ? c.push(String.fromCharCode.apply(null, r.slice(v, Math.min(v + a, S)))) : c.push(String.fromCharCode.apply(null, r.subarray(v, Math.min(v + a, S)))), v += a;
776
- return c.join("");
777
- }, stringifyByChar: function(r) {
778
- for (var h = "", a = 0; a < r.length; a++) h += String.fromCharCode(r[a]);
779
- return h;
780
- }, applyCanBeUsed: { uint8array: function() {
781
- try {
782
- return l.uint8array && String.fromCharCode.apply(null, new Uint8Array(1)).length === 1;
783
- } catch {
784
- return !1;
785
- }
786
- }(), nodebuffer: function() {
787
- try {
788
- return l.nodebuffer && String.fromCharCode.apply(null, n.allocBuffer(1)).length === 1;
789
- } catch {
790
- return !1;
791
- }
792
- }() } };
793
- function g(r) {
794
- var h = 65536, a = k.getTypeOf(r), c = !0;
795
- if (a === "uint8array" ? c = p.applyCanBeUsed.uint8array : a === "nodebuffer" && (c = p.applyCanBeUsed.nodebuffer), c) for (; 1 < h; ) try {
796
- return p.stringifyByChunk(r, a, h);
797
- } catch {
798
- h = Math.floor(h / 2);
799
- }
800
- return p.stringifyByChar(r);
801
- }
802
- function i(r, h) {
803
- for (var a = 0; a < r.length; a++) h[a] = r[a];
804
- return h;
805
- }
806
- k.applyFromCharCode = g;
807
- var d = {};
808
- d.string = { string: _, array: function(r) {
809
- return y(r, new Array(r.length));
810
- }, arraybuffer: function(r) {
811
- return d.string.uint8array(r).buffer;
812
- }, uint8array: function(r) {
813
- return y(r, new Uint8Array(r.length));
814
- }, nodebuffer: function(r) {
815
- return y(r, n.allocBuffer(r.length));
816
- } }, d.array = { string: g, array: _, arraybuffer: function(r) {
817
- return new Uint8Array(r).buffer;
818
- }, uint8array: function(r) {
819
- return new Uint8Array(r);
820
- }, nodebuffer: function(r) {
821
- return n.newBufferFrom(r);
822
- } }, d.arraybuffer = { string: function(r) {
823
- return g(new Uint8Array(r));
824
- }, array: function(r) {
825
- return i(new Uint8Array(r), new Array(r.byteLength));
826
- }, arraybuffer: _, uint8array: function(r) {
827
- return new Uint8Array(r);
828
- }, nodebuffer: function(r) {
829
- return n.newBufferFrom(new Uint8Array(r));
830
- } }, d.uint8array = { string: g, array: function(r) {
831
- return i(r, new Array(r.length));
832
- }, arraybuffer: function(r) {
833
- return r.buffer;
834
- }, uint8array: _, nodebuffer: function(r) {
835
- return n.newBufferFrom(r);
836
- } }, d.nodebuffer = { string: g, array: function(r) {
837
- return i(r, new Array(r.length));
838
- }, arraybuffer: function(r) {
839
- return d.nodebuffer.uint8array(r).buffer;
840
- }, uint8array: function(r) {
841
- return i(r, new Uint8Array(r.length));
842
- }, nodebuffer: _ }, k.transformTo = function(r, h) {
843
- if (h = h || "", !r) return h;
844
- k.checkSupport(r);
845
- var a = k.getTypeOf(h);
846
- return d[a][r](h);
847
- }, k.resolve = function(r) {
848
- for (var h = r.split("/"), a = [], c = 0; c < h.length; c++) {
849
- var v = h[c];
850
- v === "." || v === "" && c !== 0 && c !== h.length - 1 || (v === ".." ? a.pop() : a.push(v));
851
- }
852
- return a.join("/");
853
- }, k.getTypeOf = function(r) {
854
- return typeof r == "string" ? "string" : Object.prototype.toString.call(r) === "[object Array]" ? "array" : l.nodebuffer && n.isBuffer(r) ? "nodebuffer" : l.uint8array && r instanceof Uint8Array ? "uint8array" : l.arraybuffer && r instanceof ArrayBuffer ? "arraybuffer" : void 0;
855
- }, k.checkSupport = function(r) {
856
- if (!l[r.toLowerCase()]) throw new Error(r + " is not supported by this platform");
857
- }, k.MAX_VALUE_16BITS = 65535, k.MAX_VALUE_32BITS = -1, k.pretty = function(r) {
858
- var h, a, c = "";
859
- for (a = 0; a < (r || "").length; a++) c += "\\x" + ((h = r.charCodeAt(a)) < 16 ? "0" : "") + h.toString(16).toUpperCase();
860
- return c;
861
- }, k.delay = function(r, h, a) {
862
- setImmediate(function() {
863
- r.apply(a || null, h || []);
864
- });
865
- }, k.inherits = function(r, h) {
866
- function a() {
867
- }
868
- a.prototype = h.prototype, r.prototype = new a();
869
- }, k.extend = function() {
870
- var r, h, a = {};
871
- for (r = 0; r < arguments.length; r++) for (h in arguments[r]) Object.prototype.hasOwnProperty.call(arguments[r], h) && a[h] === void 0 && (a[h] = arguments[r][h]);
872
- return a;
873
- }, k.prepareContent = function(r, h, a, c, v) {
874
- return u.Promise.resolve(h).then(function(S) {
875
- return l.blob && (S instanceof Blob || ["[object File]", "[object Blob]"].indexOf(Object.prototype.toString.call(S)) !== -1) && typeof FileReader < "u" ? new u.Promise(function(x, D) {
876
- var O = new FileReader();
877
- O.onload = function(j) {
878
- x(j.target.result);
879
- }, O.onerror = function(j) {
880
- D(j.target.error);
881
- }, O.readAsArrayBuffer(S);
882
- }) : S;
883
- }).then(function(S) {
884
- var x = k.getTypeOf(S);
885
- return x ? (x === "arraybuffer" ? S = k.transformTo("uint8array", S) : x === "string" && (v ? S = o.decode(S) : a && c !== !0 && (S = function(D) {
886
- return y(D, l.uint8array ? new Uint8Array(D.length) : new Array(D.length));
887
- }(S))), S) : u.Promise.reject(new Error("Can't read the data of '" + r + "'. Is it in a supported JavaScript type (String, Blob, ArrayBuffer, etc) ?"));
888
- });
889
- };
890
- }, { "./base64": 1, "./external": 6, "./nodejsUtils": 14, "./support": 30, setimmediate: 54 }], 33: [function(b, U, k) {
891
- var l = b("./reader/readerFor"), o = b("./utils"), n = b("./signature"), u = b("./zipEntry"), _ = b("./support");
892
- function y(p) {
893
- this.files = [], this.loadOptions = p;
894
- }
895
- y.prototype = { checkSignature: function(p) {
896
- if (!this.reader.readAndCheckSignature(p)) {
897
- this.reader.index -= 4;
898
- var g = this.reader.readString(4);
899
- throw new Error("Corrupted zip or bug: unexpected signature (" + o.pretty(g) + ", expected " + o.pretty(p) + ")");
900
- }
901
- }, isSignature: function(p, g) {
902
- var i = this.reader.index;
903
- this.reader.setIndex(p);
904
- var d = this.reader.readString(4) === g;
905
- return this.reader.setIndex(i), d;
906
- }, readBlockEndOfCentral: function() {
907
- 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);
908
- var p = this.reader.readData(this.zipCommentLength), g = _.uint8array ? "uint8array" : "array", i = o.transformTo(g, p);
909
- this.zipComment = this.loadOptions.decodeFileName(i);
910
- }, readBlockZip64EndOfCentral: function() {
911
- 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 = {};
912
- for (var p, g, i, d = this.zip64EndOfCentralSize - 44; 0 < d; ) p = this.reader.readInt(2), g = this.reader.readInt(4), i = this.reader.readData(g), this.zip64ExtensibleData[p] = { id: p, length: g, value: i };
913
- }, readBlockZip64EndOfCentralLocator: function() {
914
- 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");
915
- }, readLocalFiles: function() {
916
- var p, g;
917
- for (p = 0; p < this.files.length; p++) g = this.files[p], this.reader.setIndex(g.localHeaderOffset), this.checkSignature(n.LOCAL_FILE_HEADER), g.readLocalPart(this.reader), g.handleUTF8(), g.processAttributes();
918
- }, readCentralDir: function() {
919
- var p;
920
- for (this.reader.setIndex(this.centralDirOffset); this.reader.readAndCheckSignature(n.CENTRAL_FILE_HEADER); ) (p = new u({ zip64: this.zip64 }, this.loadOptions)).readCentralPart(this.reader), this.files.push(p);
921
- 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);
922
- }, readEndOfCentral: function() {
923
- var p = this.reader.lastIndexOfSignature(n.CENTRAL_DIRECTORY_END);
924
- if (p < 0) throw this.isSignature(0, n.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");
925
- this.reader.setIndex(p);
926
- var g = p;
927
- if (this.checkSignature(n.CENTRAL_DIRECTORY_END), this.readBlockEndOfCentral(), this.diskNumber === o.MAX_VALUE_16BITS || this.diskWithCentralDirStart === o.MAX_VALUE_16BITS || this.centralDirRecordsOnThisDisk === o.MAX_VALUE_16BITS || this.centralDirRecords === o.MAX_VALUE_16BITS || this.centralDirSize === o.MAX_VALUE_32BITS || this.centralDirOffset === o.MAX_VALUE_32BITS) {
928
- if (this.zip64 = !0, (p = this.reader.lastIndexOfSignature(n.ZIP64_CENTRAL_DIRECTORY_LOCATOR)) < 0) throw new Error("Corrupted zip: can't find the ZIP64 end of central directory locator");
929
- if (this.reader.setIndex(p), this.checkSignature(n.ZIP64_CENTRAL_DIRECTORY_LOCATOR), this.readBlockZip64EndOfCentralLocator(), !this.isSignature(this.relativeOffsetEndOfZip64CentralDir, n.ZIP64_CENTRAL_DIRECTORY_END) && (this.relativeOffsetEndOfZip64CentralDir = this.reader.lastIndexOfSignature(n.ZIP64_CENTRAL_DIRECTORY_END), this.relativeOffsetEndOfZip64CentralDir < 0)) throw new Error("Corrupted zip: can't find the ZIP64 end of central directory");
930
- this.reader.setIndex(this.relativeOffsetEndOfZip64CentralDir), this.checkSignature(n.ZIP64_CENTRAL_DIRECTORY_END), this.readBlockZip64EndOfCentral();
931
- }
932
- var i = this.centralDirOffset + this.centralDirSize;
933
- this.zip64 && (i += 20, i += 12 + this.zip64EndOfCentralSize);
934
- var d = g - i;
935
- if (0 < d) this.isSignature(g, n.CENTRAL_FILE_HEADER) || (this.reader.zero = d);
936
- else if (d < 0) throw new Error("Corrupted zip: missing " + Math.abs(d) + " bytes.");
937
- }, prepareReader: function(p) {
938
- this.reader = l(p);
939
- }, load: function(p) {
940
- this.prepareReader(p), this.readEndOfCentral(), this.readCentralDir(), this.readLocalFiles();
941
- } }, U.exports = y;
942
- }, { "./reader/readerFor": 22, "./signature": 23, "./support": 30, "./utils": 32, "./zipEntry": 34 }], 34: [function(b, U, k) {
943
- var l = b("./reader/readerFor"), o = b("./utils"), n = b("./compressedObject"), u = b("./crc32"), _ = b("./utf8"), y = b("./compressions"), p = b("./support");
944
- function g(i, d) {
945
- this.options = i, this.loadOptions = d;
946
- }
947
- g.prototype = { isEncrypted: function() {
948
- return (1 & this.bitFlag) == 1;
949
- }, useUTF8: function() {
950
- return (2048 & this.bitFlag) == 2048;
951
- }, readLocalPart: function(i) {
952
- var d, r;
953
- if (i.skip(22), this.fileNameLength = i.readInt(2), r = i.readInt(2), this.fileName = i.readData(this.fileNameLength), i.skip(r), 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)");
954
- if ((d = function(h) {
955
- for (var a in y) if (Object.prototype.hasOwnProperty.call(y, a) && y[a].magic === h) return y[a];
956
- return null;
957
- }(this.compressionMethod)) === null) throw new Error("Corrupted zip : compression " + o.pretty(this.compressionMethod) + " unknown (inner file : " + o.transformTo("string", this.fileName) + ")");
958
- this.decompressed = new n(this.compressedSize, this.uncompressedSize, this.crc32, d, i.readData(this.compressedSize));
959
- }, readCentralPart: function(i) {
960
- this.versionMadeBy = i.readInt(2), i.skip(2), this.bitFlag = i.readInt(2), this.compressionMethod = i.readString(2), this.date = i.readDate(), this.crc32 = i.readInt(4), this.compressedSize = i.readInt(4), this.uncompressedSize = i.readInt(4);
961
- var d = i.readInt(2);
962
- if (this.extraFieldsLength = i.readInt(2), this.fileCommentLength = i.readInt(2), this.diskNumberStart = i.readInt(2), this.internalFileAttributes = i.readInt(2), this.externalFileAttributes = i.readInt(4), this.localHeaderOffset = i.readInt(4), this.isEncrypted()) throw new Error("Encrypted zip are not supported");
963
- i.skip(d), this.readExtraFields(i), this.parseZIP64ExtraField(i), this.fileComment = i.readData(this.fileCommentLength);
964
- }, processAttributes: function() {
965
- this.unixPermissions = null, this.dosPermissions = null;
966
- var i = this.versionMadeBy >> 8;
967
- this.dir = !!(16 & this.externalFileAttributes), i == 0 && (this.dosPermissions = 63 & this.externalFileAttributes), i == 3 && (this.unixPermissions = this.externalFileAttributes >> 16 & 65535), this.dir || this.fileNameStr.slice(-1) !== "/" || (this.dir = !0);
968
- }, parseZIP64ExtraField: function() {
969
- if (this.extraFields[1]) {
970
- var i = l(this.extraFields[1].value);
971
- this.uncompressedSize === o.MAX_VALUE_32BITS && (this.uncompressedSize = i.readInt(8)), this.compressedSize === o.MAX_VALUE_32BITS && (this.compressedSize = i.readInt(8)), this.localHeaderOffset === o.MAX_VALUE_32BITS && (this.localHeaderOffset = i.readInt(8)), this.diskNumberStart === o.MAX_VALUE_32BITS && (this.diskNumberStart = i.readInt(4));
972
- }
973
- }, readExtraFields: function(i) {
974
- var d, r, h, a = i.index + this.extraFieldsLength;
975
- for (this.extraFields || (this.extraFields = {}); i.index + 4 < a; ) d = i.readInt(2), r = i.readInt(2), h = i.readData(r), this.extraFields[d] = { id: d, length: r, value: h };
976
- i.setIndex(a);
977
- }, handleUTF8: function() {
978
- var i = p.uint8array ? "uint8array" : "array";
979
- if (this.useUTF8()) this.fileNameStr = _.utf8decode(this.fileName), this.fileCommentStr = _.utf8decode(this.fileComment);
980
- else {
981
- var d = this.findExtraFieldUnicodePath();
982
- if (d !== null) this.fileNameStr = d;
983
- else {
984
- var r = o.transformTo(i, this.fileName);
985
- this.fileNameStr = this.loadOptions.decodeFileName(r);
986
- }
987
- var h = this.findExtraFieldUnicodeComment();
988
- if (h !== null) this.fileCommentStr = h;
989
- else {
990
- var a = o.transformTo(i, this.fileComment);
991
- this.fileCommentStr = this.loadOptions.decodeFileName(a);
992
- }
993
- }
994
- }, findExtraFieldUnicodePath: function() {
995
- var i = this.extraFields[28789];
996
- if (i) {
997
- var d = l(i.value);
998
- return d.readInt(1) !== 1 || u(this.fileName) !== d.readInt(4) ? null : _.utf8decode(d.readData(i.length - 5));
999
- }
1000
- return null;
1001
- }, findExtraFieldUnicodeComment: function() {
1002
- var i = this.extraFields[25461];
1003
- if (i) {
1004
- var d = l(i.value);
1005
- return d.readInt(1) !== 1 || u(this.fileComment) !== d.readInt(4) ? null : _.utf8decode(d.readData(i.length - 5));
1006
- }
1007
- return null;
1008
- } }, U.exports = g;
1009
- }, { "./compressedObject": 2, "./compressions": 3, "./crc32": 4, "./reader/readerFor": 22, "./support": 30, "./utf8": 31, "./utils": 32 }], 35: [function(b, U, k) {
1010
- function l(d, r, h) {
1011
- this.name = d, this.dir = h.dir, this.date = h.date, this.comment = h.comment, this.unixPermissions = h.unixPermissions, this.dosPermissions = h.dosPermissions, this._data = r, this._dataBinary = h.binary, this.options = { compression: h.compression, compressionOptions: h.compressionOptions };
1012
- }
1013
- var o = b("./stream/StreamHelper"), n = b("./stream/DataWorker"), u = b("./utf8"), _ = b("./compressedObject"), y = b("./stream/GenericWorker");
1014
- l.prototype = { internalStream: function(d) {
1015
- var r = null, h = "string";
1016
- try {
1017
- if (!d) throw new Error("No output type specified.");
1018
- var a = (h = d.toLowerCase()) === "string" || h === "text";
1019
- h !== "binarystring" && h !== "text" || (h = "string"), r = this._decompressWorker();
1020
- var c = !this._dataBinary;
1021
- c && !a && (r = r.pipe(new u.Utf8EncodeWorker())), !c && a && (r = r.pipe(new u.Utf8DecodeWorker()));
1022
- } catch (v) {
1023
- (r = new y("error")).error(v);
1024
- }
1025
- return new o(r, h, "");
1026
- }, async: function(d, r) {
1027
- return this.internalStream(d).accumulate(r);
1028
- }, nodeStream: function(d, r) {
1029
- return this.internalStream(d || "nodebuffer").toNodejsStream(r);
1030
- }, _compressWorker: function(d, r) {
1031
- if (this._data instanceof _ && this._data.compression.magic === d.magic) return this._data.getCompressedWorker();
1032
- var h = this._decompressWorker();
1033
- return this._dataBinary || (h = h.pipe(new u.Utf8EncodeWorker())), _.createWorkerFrom(h, d, r);
1034
- }, _decompressWorker: function() {
1035
- return this._data instanceof _ ? this._data.getContentWorker() : this._data instanceof y ? this._data : new n(this._data);
1036
- } };
1037
- for (var p = ["asText", "asBinary", "asNodeBuffer", "asUint8Array", "asArrayBuffer"], g = function() {
1038
- throw new Error("This method has been removed in JSZip 3.0, please check the upgrade guide.");
1039
- }, i = 0; i < p.length; i++) l.prototype[p[i]] = g;
1040
- U.exports = l;
1041
- }, { "./compressedObject": 2, "./stream/DataWorker": 27, "./stream/GenericWorker": 28, "./stream/StreamHelper": 29, "./utf8": 31 }], 36: [function(b, U, k) {
1042
- (function(l) {
1043
- var o, n, u = l.MutationObserver || l.WebKitMutationObserver;
1044
- if (u) {
1045
- var _ = 0, y = new u(d), p = l.document.createTextNode("");
1046
- y.observe(p, { characterData: !0 }), o = function() {
1047
- p.data = _ = ++_ % 2;
1048
- };
1049
- } else if (l.setImmediate || l.MessageChannel === void 0) o = "document" in l && "onreadystatechange" in l.document.createElement("script") ? function() {
1050
- var r = l.document.createElement("script");
1051
- r.onreadystatechange = function() {
1052
- d(), r.onreadystatechange = null, r.parentNode.removeChild(r), r = null;
1053
- }, l.document.documentElement.appendChild(r);
1054
- } : function() {
1055
- setTimeout(d, 0);
1056
- };
1057
- else {
1058
- var g = new l.MessageChannel();
1059
- g.port1.onmessage = d, o = function() {
1060
- g.port2.postMessage(0);
1061
- };
1062
- }
1063
- var i = [];
1064
- function d() {
1065
- var r, h;
1066
- n = !0;
1067
- for (var a = i.length; a; ) {
1068
- for (h = i, i = [], r = -1; ++r < a; ) h[r]();
1069
- a = i.length;
1070
- }
1071
- n = !1;
1072
- }
1073
- U.exports = function(r) {
1074
- i.push(r) !== 1 || n || o();
1075
- };
1076
- }).call(this, typeof bt < "u" ? bt : typeof self < "u" ? self : typeof window < "u" ? window : {});
1077
- }, {}], 37: [function(b, U, k) {
1078
- var l = b("immediate");
1079
- function o() {
1080
- }
1081
- var n = {}, u = ["REJECTED"], _ = ["FULFILLED"], y = ["PENDING"];
1082
- function p(a) {
1083
- if (typeof a != "function") throw new TypeError("resolver must be a function");
1084
- this.state = y, this.queue = [], this.outcome = void 0, a !== o && r(this, a);
1085
- }
1086
- function g(a, c, v) {
1087
- this.promise = a, typeof c == "function" && (this.onFulfilled = c, this.callFulfilled = this.otherCallFulfilled), typeof v == "function" && (this.onRejected = v, this.callRejected = this.otherCallRejected);
1088
- }
1089
- function i(a, c, v) {
1090
- l(function() {
1091
- var S;
1092
- try {
1093
- S = c(v);
1094
- } catch (x) {
1095
- return n.reject(a, x);
1096
- }
1097
- S === a ? n.reject(a, new TypeError("Cannot resolve promise with itself")) : n.resolve(a, S);
1098
- });
1099
- }
1100
- function d(a) {
1101
- var c = a && a.then;
1102
- if (a && (typeof a == "object" || typeof a == "function") && typeof c == "function") return function() {
1103
- c.apply(a, arguments);
1104
- };
1105
- }
1106
- function r(a, c) {
1107
- var v = !1;
1108
- function S(O) {
1109
- v || (v = !0, n.reject(a, O));
1110
- }
1111
- function x(O) {
1112
- v || (v = !0, n.resolve(a, O));
1113
- }
1114
- var D = h(function() {
1115
- c(x, S);
1116
- });
1117
- D.status === "error" && S(D.value);
1118
- }
1119
- function h(a, c) {
1120
- var v = {};
1121
- try {
1122
- v.value = a(c), v.status = "success";
1123
- } catch (S) {
1124
- v.status = "error", v.value = S;
1125
- }
1126
- return v;
1127
- }
1128
- (U.exports = p).prototype.finally = function(a) {
1129
- if (typeof a != "function") return this;
1130
- var c = this.constructor;
1131
- return this.then(function(v) {
1132
- return c.resolve(a()).then(function() {
1133
- return v;
1134
- });
1135
- }, function(v) {
1136
- return c.resolve(a()).then(function() {
1137
- throw v;
1138
- });
1139
- });
1140
- }, p.prototype.catch = function(a) {
1141
- return this.then(null, a);
1142
- }, p.prototype.then = function(a, c) {
1143
- if (typeof a != "function" && this.state === _ || typeof c != "function" && this.state === u) return this;
1144
- var v = new this.constructor(o);
1145
- return this.state !== y ? i(v, this.state === _ ? a : c, this.outcome) : this.queue.push(new g(v, a, c)), v;
1146
- }, g.prototype.callFulfilled = function(a) {
1147
- n.resolve(this.promise, a);
1148
- }, g.prototype.otherCallFulfilled = function(a) {
1149
- i(this.promise, this.onFulfilled, a);
1150
- }, g.prototype.callRejected = function(a) {
1151
- n.reject(this.promise, a);
1152
- }, g.prototype.otherCallRejected = function(a) {
1153
- i(this.promise, this.onRejected, a);
1154
- }, n.resolve = function(a, c) {
1155
- var v = h(d, c);
1156
- if (v.status === "error") return n.reject(a, v.value);
1157
- var S = v.value;
1158
- if (S) r(a, S);
1159
- else {
1160
- a.state = _, a.outcome = c;
1161
- for (var x = -1, D = a.queue.length; ++x < D; ) a.queue[x].callFulfilled(c);
1162
- }
1163
- return a;
1164
- }, n.reject = function(a, c) {
1165
- a.state = u, a.outcome = c;
1166
- for (var v = -1, S = a.queue.length; ++v < S; ) a.queue[v].callRejected(c);
1167
- return a;
1168
- }, p.resolve = function(a) {
1169
- return a instanceof this ? a : n.resolve(new this(o), a);
1170
- }, p.reject = function(a) {
1171
- var c = new this(o);
1172
- return n.reject(c, a);
1173
- }, p.all = function(a) {
1174
- var c = this;
1175
- if (Object.prototype.toString.call(a) !== "[object Array]") return this.reject(new TypeError("must be an array"));
1176
- var v = a.length, S = !1;
1177
- if (!v) return this.resolve([]);
1178
- for (var x = new Array(v), D = 0, O = -1, j = new this(o); ++O < v; ) I(a[O], O);
1179
- return j;
1180
- function I(W, q) {
1181
- c.resolve(W).then(function(m) {
1182
- x[q] = m, ++D !== v || S || (S = !0, n.resolve(j, x));
1183
- }, function(m) {
1184
- S || (S = !0, n.reject(j, m));
1185
- });
1186
- }
1187
- }, p.race = function(a) {
1188
- var c = this;
1189
- if (Object.prototype.toString.call(a) !== "[object Array]") return this.reject(new TypeError("must be an array"));
1190
- var v = a.length, S = !1;
1191
- if (!v) return this.resolve([]);
1192
- for (var x = -1, D = new this(o); ++x < v; ) O = a[x], c.resolve(O).then(function(j) {
1193
- S || (S = !0, n.resolve(D, j));
1194
- }, function(j) {
1195
- S || (S = !0, n.reject(D, j));
1196
- });
1197
- var O;
1198
- return D;
1199
- };
1200
- }, { immediate: 36 }], 38: [function(b, U, k) {
1201
- var l = {};
1202
- (0, b("./lib/utils/common").assign)(l, b("./lib/deflate"), b("./lib/inflate"), b("./lib/zlib/constants")), U.exports = l;
1203
- }, { "./lib/deflate": 39, "./lib/inflate": 40, "./lib/utils/common": 41, "./lib/zlib/constants": 44 }], 39: [function(b, U, k) {
1204
- var l = b("./zlib/deflate"), o = b("./utils/common"), n = b("./utils/strings"), u = b("./zlib/messages"), _ = b("./zlib/zstream"), y = Object.prototype.toString, p = 0, g = -1, i = 0, d = 8;
1205
- function r(a) {
1206
- if (!(this instanceof r)) return new r(a);
1207
- this.options = o.assign({ level: g, method: d, chunkSize: 16384, windowBits: 15, memLevel: 8, strategy: i, to: "" }, a || {});
1208
- var c = this.options;
1209
- c.raw && 0 < c.windowBits ? c.windowBits = -c.windowBits : c.gzip && 0 < c.windowBits && c.windowBits < 16 && (c.windowBits += 16), this.err = 0, this.msg = "", this.ended = !1, this.chunks = [], this.strm = new _(), this.strm.avail_out = 0;
1210
- var v = l.deflateInit2(this.strm, c.level, c.method, c.windowBits, c.memLevel, c.strategy);
1211
- if (v !== p) throw new Error(u[v]);
1212
- if (c.header && l.deflateSetHeader(this.strm, c.header), c.dictionary) {
1213
- var S;
1214
- if (S = typeof c.dictionary == "string" ? n.string2buf(c.dictionary) : y.call(c.dictionary) === "[object ArrayBuffer]" ? new Uint8Array(c.dictionary) : c.dictionary, (v = l.deflateSetDictionary(this.strm, S)) !== p) throw new Error(u[v]);
1215
- this._dict_set = !0;
1216
- }
1217
- }
1218
- function h(a, c) {
1219
- var v = new r(c);
1220
- if (v.push(a, !0), v.err) throw v.msg || u[v.err];
1221
- return v.result;
1222
- }
1223
- r.prototype.push = function(a, c) {
1224
- var v, S, x = this.strm, D = this.options.chunkSize;
1225
- if (this.ended) return !1;
1226
- S = c === ~~c ? c : c === !0 ? 4 : 0, typeof a == "string" ? x.input = n.string2buf(a) : y.call(a) === "[object ArrayBuffer]" ? x.input = new Uint8Array(a) : x.input = a, x.next_in = 0, x.avail_in = x.input.length;
1227
- do {
1228
- if (x.avail_out === 0 && (x.output = new o.Buf8(D), x.next_out = 0, x.avail_out = D), (v = l.deflate(x, S)) !== 1 && v !== p) return this.onEnd(v), !(this.ended = !0);
1229
- x.avail_out !== 0 && (x.avail_in !== 0 || S !== 4 && S !== 2) || (this.options.to === "string" ? this.onData(n.buf2binstring(o.shrinkBuf(x.output, x.next_out))) : this.onData(o.shrinkBuf(x.output, x.next_out)));
1230
- } while ((0 < x.avail_in || x.avail_out === 0) && v !== 1);
1231
- return S === 4 ? (v = l.deflateEnd(this.strm), this.onEnd(v), this.ended = !0, v === p) : S !== 2 || (this.onEnd(p), !(x.avail_out = 0));
1232
- }, r.prototype.onData = function(a) {
1233
- this.chunks.push(a);
1234
- }, r.prototype.onEnd = function(a) {
1235
- a === p && (this.options.to === "string" ? this.result = this.chunks.join("") : this.result = o.flattenChunks(this.chunks)), this.chunks = [], this.err = a, this.msg = this.strm.msg;
1236
- }, k.Deflate = r, k.deflate = h, k.deflateRaw = function(a, c) {
1237
- return (c = c || {}).raw = !0, h(a, c);
1238
- }, k.gzip = function(a, c) {
1239
- return (c = c || {}).gzip = !0, h(a, c);
1240
- };
1241
- }, { "./utils/common": 41, "./utils/strings": 42, "./zlib/deflate": 46, "./zlib/messages": 51, "./zlib/zstream": 53 }], 40: [function(b, U, k) {
1242
- var l = b("./zlib/inflate"), o = b("./utils/common"), n = b("./utils/strings"), u = b("./zlib/constants"), _ = b("./zlib/messages"), y = b("./zlib/zstream"), p = b("./zlib/gzheader"), g = Object.prototype.toString;
1243
- function i(r) {
1244
- if (!(this instanceof i)) return new i(r);
1245
- this.options = o.assign({ chunkSize: 16384, windowBits: 0, to: "" }, r || {});
1246
- var h = this.options;
1247
- h.raw && 0 <= h.windowBits && h.windowBits < 16 && (h.windowBits = -h.windowBits, h.windowBits === 0 && (h.windowBits = -15)), !(0 <= h.windowBits && h.windowBits < 16) || r && r.windowBits || (h.windowBits += 32), 15 < h.windowBits && h.windowBits < 48 && (15 & h.windowBits) == 0 && (h.windowBits |= 15), this.err = 0, this.msg = "", this.ended = !1, this.chunks = [], this.strm = new y(), this.strm.avail_out = 0;
1248
- var a = l.inflateInit2(this.strm, h.windowBits);
1249
- if (a !== u.Z_OK) throw new Error(_[a]);
1250
- this.header = new p(), l.inflateGetHeader(this.strm, this.header);
1251
- }
1252
- function d(r, h) {
1253
- var a = new i(h);
1254
- if (a.push(r, !0), a.err) throw a.msg || _[a.err];
1255
- return a.result;
1256
- }
1257
- i.prototype.push = function(r, h) {
1258
- var a, c, v, S, x, D, O = this.strm, j = this.options.chunkSize, I = this.options.dictionary, W = !1;
1259
- if (this.ended) return !1;
1260
- c = h === ~~h ? h : h === !0 ? u.Z_FINISH : u.Z_NO_FLUSH, typeof r == "string" ? O.input = n.binstring2buf(r) : g.call(r) === "[object ArrayBuffer]" ? O.input = new Uint8Array(r) : O.input = r, O.next_in = 0, O.avail_in = O.input.length;
1261
- do {
1262
- if (O.avail_out === 0 && (O.output = new o.Buf8(j), O.next_out = 0, O.avail_out = j), (a = l.inflate(O, u.Z_NO_FLUSH)) === u.Z_NEED_DICT && I && (D = typeof I == "string" ? n.string2buf(I) : g.call(I) === "[object ArrayBuffer]" ? new Uint8Array(I) : I, a = l.inflateSetDictionary(this.strm, D)), a === u.Z_BUF_ERROR && W === !0 && (a = u.Z_OK, W = !1), a !== u.Z_STREAM_END && a !== u.Z_OK) return this.onEnd(a), !(this.ended = !0);
1263
- O.next_out && (O.avail_out !== 0 && a !== u.Z_STREAM_END && (O.avail_in !== 0 || c !== u.Z_FINISH && c !== u.Z_SYNC_FLUSH) || (this.options.to === "string" ? (v = n.utf8border(O.output, O.next_out), S = O.next_out - v, x = n.buf2string(O.output, v), O.next_out = S, O.avail_out = j - S, S && o.arraySet(O.output, O.output, v, S, 0), this.onData(x)) : this.onData(o.shrinkBuf(O.output, O.next_out)))), O.avail_in === 0 && O.avail_out === 0 && (W = !0);
1264
- } while ((0 < O.avail_in || O.avail_out === 0) && a !== u.Z_STREAM_END);
1265
- return a === u.Z_STREAM_END && (c = u.Z_FINISH), c === u.Z_FINISH ? (a = l.inflateEnd(this.strm), this.onEnd(a), this.ended = !0, a === u.Z_OK) : c !== u.Z_SYNC_FLUSH || (this.onEnd(u.Z_OK), !(O.avail_out = 0));
1266
- }, i.prototype.onData = function(r) {
1267
- this.chunks.push(r);
1268
- }, i.prototype.onEnd = function(r) {
1269
- r === u.Z_OK && (this.options.to === "string" ? this.result = this.chunks.join("") : this.result = o.flattenChunks(this.chunks)), this.chunks = [], this.err = r, this.msg = this.strm.msg;
1270
- }, k.Inflate = i, k.inflate = d, k.inflateRaw = function(r, h) {
1271
- return (h = h || {}).raw = !0, d(r, h);
1272
- }, k.ungzip = d;
1273
- }, { "./utils/common": 41, "./utils/strings": 42, "./zlib/constants": 44, "./zlib/gzheader": 47, "./zlib/inflate": 49, "./zlib/messages": 51, "./zlib/zstream": 53 }], 41: [function(b, U, k) {
1274
- var l = typeof Uint8Array < "u" && typeof Uint16Array < "u" && typeof Int32Array < "u";
1275
- k.assign = function(u) {
1276
- for (var _ = Array.prototype.slice.call(arguments, 1); _.length; ) {
1277
- var y = _.shift();
1278
- if (y) {
1279
- if (typeof y != "object") throw new TypeError(y + "must be non-object");
1280
- for (var p in y) y.hasOwnProperty(p) && (u[p] = y[p]);
1281
- }
1282
- }
1283
- return u;
1284
- }, k.shrinkBuf = function(u, _) {
1285
- return u.length === _ ? u : u.subarray ? u.subarray(0, _) : (u.length = _, u);
1286
- };
1287
- var o = { arraySet: function(u, _, y, p, g) {
1288
- if (_.subarray && u.subarray) u.set(_.subarray(y, y + p), g);
1289
- else for (var i = 0; i < p; i++) u[g + i] = _[y + i];
1290
- }, flattenChunks: function(u) {
1291
- var _, y, p, g, i, d;
1292
- for (_ = p = 0, y = u.length; _ < y; _++) p += u[_].length;
1293
- for (d = new Uint8Array(p), _ = g = 0, y = u.length; _ < y; _++) i = u[_], d.set(i, g), g += i.length;
1294
- return d;
1295
- } }, n = { arraySet: function(u, _, y, p, g) {
1296
- for (var i = 0; i < p; i++) u[g + i] = _[y + i];
1297
- }, flattenChunks: function(u) {
1298
- return [].concat.apply([], u);
1299
- } };
1300
- k.setTyped = function(u) {
1301
- u ? (k.Buf8 = Uint8Array, k.Buf16 = Uint16Array, k.Buf32 = Int32Array, k.assign(k, o)) : (k.Buf8 = Array, k.Buf16 = Array, k.Buf32 = Array, k.assign(k, n));
1302
- }, k.setTyped(l);
1303
- }, {}], 42: [function(b, U, k) {
1304
- var l = b("./common"), o = !0, n = !0;
1305
- try {
1306
- String.fromCharCode.apply(null, [0]);
1307
- } catch {
1308
- o = !1;
1309
- }
1310
- try {
1311
- String.fromCharCode.apply(null, new Uint8Array(1));
1312
- } catch {
1313
- n = !1;
1314
- }
1315
- for (var u = new l.Buf8(256), _ = 0; _ < 256; _++) u[_] = 252 <= _ ? 6 : 248 <= _ ? 5 : 240 <= _ ? 4 : 224 <= _ ? 3 : 192 <= _ ? 2 : 1;
1316
- function y(p, g) {
1317
- if (g < 65537 && (p.subarray && n || !p.subarray && o)) return String.fromCharCode.apply(null, l.shrinkBuf(p, g));
1318
- for (var i = "", d = 0; d < g; d++) i += String.fromCharCode(p[d]);
1319
- return i;
1320
- }
1321
- u[254] = u[254] = 1, k.string2buf = function(p) {
1322
- var g, i, d, r, h, a = p.length, c = 0;
1323
- for (r = 0; r < a; r++) (64512 & (i = p.charCodeAt(r))) == 55296 && r + 1 < a && (64512 & (d = p.charCodeAt(r + 1))) == 56320 && (i = 65536 + (i - 55296 << 10) + (d - 56320), r++), c += i < 128 ? 1 : i < 2048 ? 2 : i < 65536 ? 3 : 4;
1324
- for (g = new l.Buf8(c), r = h = 0; h < c; r++) (64512 & (i = p.charCodeAt(r))) == 55296 && r + 1 < a && (64512 & (d = p.charCodeAt(r + 1))) == 56320 && (i = 65536 + (i - 55296 << 10) + (d - 56320), r++), i < 128 ? g[h++] = i : (i < 2048 ? g[h++] = 192 | i >>> 6 : (i < 65536 ? g[h++] = 224 | i >>> 12 : (g[h++] = 240 | i >>> 18, g[h++] = 128 | i >>> 12 & 63), g[h++] = 128 | i >>> 6 & 63), g[h++] = 128 | 63 & i);
1325
- return g;
1326
- }, k.buf2binstring = function(p) {
1327
- return y(p, p.length);
1328
- }, k.binstring2buf = function(p) {
1329
- for (var g = new l.Buf8(p.length), i = 0, d = g.length; i < d; i++) g[i] = p.charCodeAt(i);
1330
- return g;
1331
- }, k.buf2string = function(p, g) {
1332
- var i, d, r, h, a = g || p.length, c = new Array(2 * a);
1333
- for (i = d = 0; i < a; ) if ((r = p[i++]) < 128) c[d++] = r;
1334
- else if (4 < (h = u[r])) c[d++] = 65533, i += h - 1;
1335
- else {
1336
- for (r &= h === 2 ? 31 : h === 3 ? 15 : 7; 1 < h && i < a; ) r = r << 6 | 63 & p[i++], h--;
1337
- 1 < h ? c[d++] = 65533 : r < 65536 ? c[d++] = r : (r -= 65536, c[d++] = 55296 | r >> 10 & 1023, c[d++] = 56320 | 1023 & r);
1338
- }
1339
- return y(c, d);
1340
- }, k.utf8border = function(p, g) {
1341
- var i;
1342
- for ((g = g || p.length) > p.length && (g = p.length), i = g - 1; 0 <= i && (192 & p[i]) == 128; ) i--;
1343
- return i < 0 || i === 0 ? g : i + u[p[i]] > g ? i : g;
1344
- };
1345
- }, { "./common": 41 }], 43: [function(b, U, k) {
1346
- U.exports = function(l, o, n, u) {
1347
- for (var _ = 65535 & l | 0, y = l >>> 16 & 65535 | 0, p = 0; n !== 0; ) {
1348
- for (n -= p = 2e3 < n ? 2e3 : n; y = y + (_ = _ + o[u++] | 0) | 0, --p; ) ;
1349
- _ %= 65521, y %= 65521;
1350
- }
1351
- return _ | y << 16 | 0;
1352
- };
1353
- }, {}], 44: [function(b, U, k) {
1354
- U.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 };
1355
- }, {}], 45: [function(b, U, k) {
1356
- var l = function() {
1357
- for (var o, n = [], u = 0; u < 256; u++) {
1358
- o = u;
1359
- for (var _ = 0; _ < 8; _++) o = 1 & o ? 3988292384 ^ o >>> 1 : o >>> 1;
1360
- n[u] = o;
1361
- }
1362
- return n;
1363
- }();
1364
- U.exports = function(o, n, u, _) {
1365
- var y = l, p = _ + u;
1366
- o ^= -1;
1367
- for (var g = _; g < p; g++) o = o >>> 8 ^ y[255 & (o ^ n[g])];
1368
- return -1 ^ o;
1369
- };
1370
- }, {}], 46: [function(b, U, k) {
1371
- var l, o = b("../utils/common"), n = b("./trees"), u = b("./adler32"), _ = b("./crc32"), y = b("./messages"), p = 0, g = 4, i = 0, d = -2, r = -1, h = 4, a = 2, c = 8, v = 9, S = 286, x = 30, D = 19, O = 2 * S + 1, j = 15, I = 3, W = 258, q = W + I + 1, m = 42, B = 113, e = 1, T = 2, J = 3, P = 4;
1372
- function $(t, R) {
1373
- return t.msg = y[R], R;
1374
- }
1375
- function L(t) {
1376
- return (t << 1) - (4 < t ? 9 : 0);
1377
- }
1378
- function V(t) {
1379
- for (var R = t.length; 0 <= --R; ) t[R] = 0;
1380
- }
1381
- function E(t) {
1382
- var R = t.state, A = R.pending;
1383
- A > t.avail_out && (A = t.avail_out), A !== 0 && (o.arraySet(t.output, R.pending_buf, R.pending_out, A, t.next_out), t.next_out += A, R.pending_out += A, t.total_out += A, t.avail_out -= A, R.pending -= A, R.pending === 0 && (R.pending_out = 0));
1384
- }
1385
- function C(t, R) {
1386
- n._tr_flush_block(t, 0 <= t.block_start ? t.block_start : -1, t.strstart - t.block_start, R), t.block_start = t.strstart, E(t.strm);
1387
- }
1388
- function X(t, R) {
1389
- t.pending_buf[t.pending++] = R;
1390
- }
1391
- function G(t, R) {
1392
- t.pending_buf[t.pending++] = R >>> 8 & 255, t.pending_buf[t.pending++] = 255 & R;
1393
- }
1394
- function H(t, R) {
1395
- var A, f, s = t.max_chain_length, w = t.strstart, F = t.prev_length, N = t.nice_match, z = t.strstart > t.w_size - q ? t.strstart - (t.w_size - q) : 0, Z = t.window, K = t.w_mask, M = t.prev, Y = t.strstart + W, rt = Z[w + F - 1], tt = Z[w + F];
1396
- t.prev_length >= t.good_match && (s >>= 2), N > t.lookahead && (N = t.lookahead);
1397
- do
1398
- if (Z[(A = R) + F] === tt && Z[A + F - 1] === rt && Z[A] === Z[w] && Z[++A] === Z[w + 1]) {
1399
- w += 2, A++;
1400
- do
1401
- ;
1402
- while (Z[++w] === Z[++A] && Z[++w] === Z[++A] && Z[++w] === Z[++A] && Z[++w] === Z[++A] && Z[++w] === Z[++A] && Z[++w] === Z[++A] && Z[++w] === Z[++A] && Z[++w] === Z[++A] && w < Y);
1403
- if (f = W - (Y - w), w = Y - W, F < f) {
1404
- if (t.match_start = R, N <= (F = f)) break;
1405
- rt = Z[w + F - 1], tt = Z[w + F];
1406
- }
1407
- }
1408
- while ((R = M[R & K]) > z && --s != 0);
1409
- return F <= t.lookahead ? F : t.lookahead;
1410
- }
1411
- function nt(t) {
1412
- var R, A, f, s, w, F, N, z, Z, K, M = t.w_size;
1413
- do {
1414
- if (s = t.window_size - t.lookahead - t.strstart, t.strstart >= M + (M - q)) {
1415
- for (o.arraySet(t.window, t.window, M, M, 0), t.match_start -= M, t.strstart -= M, t.block_start -= M, R = A = t.hash_size; f = t.head[--R], t.head[R] = M <= f ? f - M : 0, --A; ) ;
1416
- for (R = A = M; f = t.prev[--R], t.prev[R] = M <= f ? f - M : 0, --A; ) ;
1417
- s += M;
1418
- }
1419
- if (t.strm.avail_in === 0) break;
1420
- if (F = t.strm, N = t.window, z = t.strstart + t.lookahead, Z = s, K = void 0, K = F.avail_in, Z < K && (K = Z), A = K === 0 ? 0 : (F.avail_in -= K, o.arraySet(N, F.input, F.next_in, K, z), F.state.wrap === 1 ? F.adler = u(F.adler, N, K, z) : F.state.wrap === 2 && (F.adler = _(F.adler, N, K, z)), F.next_in += K, F.total_in += K, K), t.lookahead += A, t.lookahead + t.insert >= I) for (w = t.strstart - t.insert, t.ins_h = t.window[w], t.ins_h = (t.ins_h << t.hash_shift ^ t.window[w + 1]) & t.hash_mask; t.insert && (t.ins_h = (t.ins_h << t.hash_shift ^ t.window[w + I - 1]) & t.hash_mask, t.prev[w & t.w_mask] = t.head[t.ins_h], t.head[t.ins_h] = w, w++, t.insert--, !(t.lookahead + t.insert < I)); ) ;
1421
- } while (t.lookahead < q && t.strm.avail_in !== 0);
1422
- }
1423
- function ot(t, R) {
1424
- for (var A, f; ; ) {
1425
- if (t.lookahead < q) {
1426
- if (nt(t), t.lookahead < q && R === p) return e;
1427
- if (t.lookahead === 0) break;
1428
- }
1429
- if (A = 0, t.lookahead >= I && (t.ins_h = (t.ins_h << t.hash_shift ^ t.window[t.strstart + I - 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 - q && (t.match_length = H(t, A)), t.match_length >= I) if (f = n._tr_tally(t, t.strstart - t.match_start, t.match_length - I), t.lookahead -= t.match_length, t.match_length <= t.max_lazy_match && t.lookahead >= I) {
1430
- for (t.match_length--; t.strstart++, t.ins_h = (t.ins_h << t.hash_shift ^ t.window[t.strstart + I - 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; ) ;
1431
- t.strstart++;
1432
- } 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;
1433
- else f = n._tr_tally(t, 0, t.window[t.strstart]), t.lookahead--, t.strstart++;
1434
- if (f && (C(t, !1), t.strm.avail_out === 0)) return e;
1435
- }
1436
- return t.insert = t.strstart < I - 1 ? t.strstart : I - 1, R === g ? (C(t, !0), t.strm.avail_out === 0 ? J : P) : t.last_lit && (C(t, !1), t.strm.avail_out === 0) ? e : T;
1437
- }
1438
- function Q(t, R) {
1439
- for (var A, f, s; ; ) {
1440
- if (t.lookahead < q) {
1441
- if (nt(t), t.lookahead < q && R === p) return e;
1442
- if (t.lookahead === 0) break;
1443
- }
1444
- if (A = 0, t.lookahead >= I && (t.ins_h = (t.ins_h << t.hash_shift ^ t.window[t.strstart + I - 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 = I - 1, A !== 0 && t.prev_length < t.max_lazy_match && t.strstart - A <= t.w_size - q && (t.match_length = H(t, A), t.match_length <= 5 && (t.strategy === 1 || t.match_length === I && 4096 < t.strstart - t.match_start) && (t.match_length = I - 1)), t.prev_length >= I && t.match_length <= t.prev_length) {
1445
- for (s = t.strstart + t.lookahead - I, f = n._tr_tally(t, t.strstart - 1 - t.prev_match, t.prev_length - I), t.lookahead -= t.prev_length - 1, t.prev_length -= 2; ++t.strstart <= s && (t.ins_h = (t.ins_h << t.hash_shift ^ t.window[t.strstart + I - 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; ) ;
1446
- if (t.match_available = 0, t.match_length = I - 1, t.strstart++, f && (C(t, !1), t.strm.avail_out === 0)) return e;
1447
- } else if (t.match_available) {
1448
- if ((f = n._tr_tally(t, 0, t.window[t.strstart - 1])) && C(t, !1), t.strstart++, t.lookahead--, t.strm.avail_out === 0) return e;
1449
- } else t.match_available = 1, t.strstart++, t.lookahead--;
1450
- }
1451
- return t.match_available && (f = n._tr_tally(t, 0, t.window[t.strstart - 1]), t.match_available = 0), t.insert = t.strstart < I - 1 ? t.strstart : I - 1, R === g ? (C(t, !0), t.strm.avail_out === 0 ? J : P) : t.last_lit && (C(t, !1), t.strm.avail_out === 0) ? e : T;
1452
- }
1453
- function et(t, R, A, f, s) {
1454
- this.good_length = t, this.max_lazy = R, this.nice_length = A, this.max_chain = f, this.func = s;
1455
- }
1456
- function st() {
1457
- 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 = c, 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 o.Buf16(2 * O), this.dyn_dtree = new o.Buf16(2 * (2 * x + 1)), this.bl_tree = new o.Buf16(2 * (2 * D + 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 o.Buf16(j + 1), this.heap = new o.Buf16(2 * S + 1), V(this.heap), this.heap_len = 0, this.heap_max = 0, this.depth = new o.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;
1458
- }
1459
- function it(t) {
1460
- var R;
1461
- return t && t.state ? (t.total_in = t.total_out = 0, t.data_type = a, (R = t.state).pending = 0, R.pending_out = 0, R.wrap < 0 && (R.wrap = -R.wrap), R.status = R.wrap ? m : B, t.adler = R.wrap === 2 ? 0 : 1, R.last_flush = p, n._tr_init(R), i) : $(t, d);
1462
- }
1463
- function lt(t) {
1464
- var R = it(t);
1465
- return R === i && function(A) {
1466
- 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 = I - 1, A.match_available = 0, A.ins_h = 0;
1467
- }(t.state), R;
1468
- }
1469
- function ht(t, R, A, f, s, w) {
1470
- if (!t) return d;
1471
- var F = 1;
1472
- if (R === r && (R = 6), f < 0 ? (F = 0, f = -f) : 15 < f && (F = 2, f -= 16), s < 1 || v < s || A !== c || f < 8 || 15 < f || R < 0 || 9 < R || w < 0 || h < w) return $(t, d);
1473
- f === 8 && (f = 9);
1474
- var N = new st();
1475
- return (t.state = N).strm = t, N.wrap = F, N.gzhead = null, N.w_bits = f, N.w_size = 1 << N.w_bits, N.w_mask = N.w_size - 1, N.hash_bits = s + 7, N.hash_size = 1 << N.hash_bits, N.hash_mask = N.hash_size - 1, N.hash_shift = ~~((N.hash_bits + I - 1) / I), N.window = new o.Buf8(2 * N.w_size), N.head = new o.Buf16(N.hash_size), N.prev = new o.Buf16(N.w_size), N.lit_bufsize = 1 << s + 6, N.pending_buf_size = 4 * N.lit_bufsize, N.pending_buf = new o.Buf8(N.pending_buf_size), N.d_buf = 1 * N.lit_bufsize, N.l_buf = 3 * N.lit_bufsize, N.level = R, N.strategy = w, N.method = A, lt(t);
1476
- }
1477
- l = [new et(0, 0, 0, 0, function(t, R) {
1478
- var A = 65535;
1479
- for (A > t.pending_buf_size - 5 && (A = t.pending_buf_size - 5); ; ) {
1480
- if (t.lookahead <= 1) {
1481
- if (nt(t), t.lookahead === 0 && R === p) return e;
1482
- if (t.lookahead === 0) break;
1483
- }
1484
- t.strstart += t.lookahead, t.lookahead = 0;
1485
- var f = t.block_start + A;
1486
- if ((t.strstart === 0 || t.strstart >= f) && (t.lookahead = t.strstart - f, t.strstart = f, C(t, !1), t.strm.avail_out === 0) || t.strstart - t.block_start >= t.w_size - q && (C(t, !1), t.strm.avail_out === 0)) return e;
1487
- }
1488
- return t.insert = 0, R === g ? (C(t, !0), t.strm.avail_out === 0 ? J : P) : (t.strstart > t.block_start && (C(t, !1), t.strm.avail_out), e);
1489
- }), new et(4, 4, 8, 4, ot), new et(4, 5, 16, 8, ot), new et(4, 6, 32, 32, ot), 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)], k.deflateInit = function(t, R) {
1490
- return ht(t, R, c, 15, 8, 0);
1491
- }, k.deflateInit2 = ht, k.deflateReset = lt, k.deflateResetKeep = it, k.deflateSetHeader = function(t, R) {
1492
- return t && t.state ? t.state.wrap !== 2 ? d : (t.state.gzhead = R, i) : d;
1493
- }, k.deflate = function(t, R) {
1494
- var A, f, s, w;
1495
- if (!t || !t.state || 5 < R || R < 0) return t ? $(t, d) : d;
1496
- if (f = t.state, !t.output || !t.input && t.avail_in !== 0 || f.status === 666 && R !== g) return $(t, t.avail_out === 0 ? -5 : d);
1497
- if (f.strm = t, A = f.last_flush, f.last_flush = R, f.status === m) if (f.wrap === 2) t.adler = 0, X(f, 31), X(f, 139), X(f, 8), f.gzhead ? (X(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)), X(f, 255 & f.gzhead.time), X(f, f.gzhead.time >> 8 & 255), X(f, f.gzhead.time >> 16 & 255), X(f, f.gzhead.time >> 24 & 255), X(f, f.level === 9 ? 2 : 2 <= f.strategy || f.level < 2 ? 4 : 0), X(f, 255 & f.gzhead.os), f.gzhead.extra && f.gzhead.extra.length && (X(f, 255 & f.gzhead.extra.length), X(f, f.gzhead.extra.length >> 8 & 255)), f.gzhead.hcrc && (t.adler = _(t.adler, f.pending_buf, f.pending, 0)), f.gzindex = 0, f.status = 69) : (X(f, 0), X(f, 0), X(f, 0), X(f, 0), X(f, 0), X(f, f.level === 9 ? 2 : 2 <= f.strategy || f.level < 2 ? 4 : 0), X(f, 3), f.status = B);
1498
- else {
1499
- var F = c + (f.w_bits - 8 << 4) << 8;
1500
- F |= (2 <= f.strategy || f.level < 2 ? 0 : f.level < 6 ? 1 : f.level === 6 ? 2 : 3) << 6, f.strstart !== 0 && (F |= 32), F += 31 - F % 31, f.status = B, G(f, F), f.strstart !== 0 && (G(f, t.adler >>> 16), G(f, 65535 & t.adler)), t.adler = 1;
1501
- }
1502
- if (f.status === 69) if (f.gzhead.extra) {
1503
- for (s = f.pending; f.gzindex < (65535 & f.gzhead.extra.length) && (f.pending !== f.pending_buf_size || (f.gzhead.hcrc && f.pending > s && (t.adler = _(t.adler, f.pending_buf, f.pending - s, s)), E(t), s = f.pending, f.pending !== f.pending_buf_size)); ) X(f, 255 & f.gzhead.extra[f.gzindex]), f.gzindex++;
1504
- f.gzhead.hcrc && f.pending > s && (t.adler = _(t.adler, f.pending_buf, f.pending - s, s)), f.gzindex === f.gzhead.extra.length && (f.gzindex = 0, f.status = 73);
1505
- } else f.status = 73;
1506
- if (f.status === 73) if (f.gzhead.name) {
1507
- s = f.pending;
1508
- do {
1509
- if (f.pending === f.pending_buf_size && (f.gzhead.hcrc && f.pending > s && (t.adler = _(t.adler, f.pending_buf, f.pending - s, s)), E(t), s = f.pending, f.pending === f.pending_buf_size)) {
1510
- w = 1;
1511
- break;
1512
- }
1513
- w = f.gzindex < f.gzhead.name.length ? 255 & f.gzhead.name.charCodeAt(f.gzindex++) : 0, X(f, w);
1514
- } while (w !== 0);
1515
- f.gzhead.hcrc && f.pending > s && (t.adler = _(t.adler, f.pending_buf, f.pending - s, s)), w === 0 && (f.gzindex = 0, f.status = 91);
1516
- } else f.status = 91;
1517
- if (f.status === 91) if (f.gzhead.comment) {
1518
- s = f.pending;
1519
- do {
1520
- if (f.pending === f.pending_buf_size && (f.gzhead.hcrc && f.pending > s && (t.adler = _(t.adler, f.pending_buf, f.pending - s, s)), E(t), s = f.pending, f.pending === f.pending_buf_size)) {
1521
- w = 1;
1522
- break;
1523
- }
1524
- w = f.gzindex < f.gzhead.comment.length ? 255 & f.gzhead.comment.charCodeAt(f.gzindex++) : 0, X(f, w);
1525
- } while (w !== 0);
1526
- f.gzhead.hcrc && f.pending > s && (t.adler = _(t.adler, f.pending_buf, f.pending - s, s)), w === 0 && (f.status = 103);
1527
- } else f.status = 103;
1528
- if (f.status === 103 && (f.gzhead.hcrc ? (f.pending + 2 > f.pending_buf_size && E(t), f.pending + 2 <= f.pending_buf_size && (X(f, 255 & t.adler), X(f, t.adler >> 8 & 255), t.adler = 0, f.status = B)) : f.status = B), f.pending !== 0) {
1529
- if (E(t), t.avail_out === 0) return f.last_flush = -1, i;
1530
- } else if (t.avail_in === 0 && L(R) <= L(A) && R !== g) return $(t, -5);
1531
- if (f.status === 666 && t.avail_in !== 0) return $(t, -5);
1532
- if (t.avail_in !== 0 || f.lookahead !== 0 || R !== p && f.status !== 666) {
1533
- var N = f.strategy === 2 ? function(z, Z) {
1534
- for (var K; ; ) {
1535
- if (z.lookahead === 0 && (nt(z), z.lookahead === 0)) {
1536
- if (Z === p) return e;
1537
- break;
1538
- }
1539
- if (z.match_length = 0, K = n._tr_tally(z, 0, z.window[z.strstart]), z.lookahead--, z.strstart++, K && (C(z, !1), z.strm.avail_out === 0)) return e;
1540
- }
1541
- return z.insert = 0, Z === g ? (C(z, !0), z.strm.avail_out === 0 ? J : P) : z.last_lit && (C(z, !1), z.strm.avail_out === 0) ? e : T;
1542
- }(f, R) : f.strategy === 3 ? function(z, Z) {
1543
- for (var K, M, Y, rt, tt = z.window; ; ) {
1544
- if (z.lookahead <= W) {
1545
- if (nt(z), z.lookahead <= W && Z === p) return e;
1546
- if (z.lookahead === 0) break;
1547
- }
1548
- if (z.match_length = 0, z.lookahead >= I && 0 < z.strstart && (M = tt[Y = z.strstart - 1]) === tt[++Y] && M === tt[++Y] && M === tt[++Y]) {
1549
- rt = z.strstart + W;
1550
- do
1551
- ;
1552
- while (M === tt[++Y] && M === tt[++Y] && M === tt[++Y] && M === tt[++Y] && M === tt[++Y] && M === tt[++Y] && M === tt[++Y] && M === tt[++Y] && Y < rt);
1553
- z.match_length = W - (rt - Y), z.match_length > z.lookahead && (z.match_length = z.lookahead);
1554
- }
1555
- if (z.match_length >= I ? (K = n._tr_tally(z, 1, z.match_length - I), z.lookahead -= z.match_length, z.strstart += z.match_length, z.match_length = 0) : (K = n._tr_tally(z, 0, z.window[z.strstart]), z.lookahead--, z.strstart++), K && (C(z, !1), z.strm.avail_out === 0)) return e;
1556
- }
1557
- return z.insert = 0, Z === g ? (C(z, !0), z.strm.avail_out === 0 ? J : P) : z.last_lit && (C(z, !1), z.strm.avail_out === 0) ? e : T;
1558
- }(f, R) : l[f.level].func(f, R);
1559
- if (N !== J && N !== P || (f.status = 666), N === e || N === J) return t.avail_out === 0 && (f.last_flush = -1), i;
1560
- if (N === T && (R === 1 ? n._tr_align(f) : R !== 5 && (n._tr_stored_block(f, 0, 0, !1), R === 3 && (V(f.head), f.lookahead === 0 && (f.strstart = 0, f.block_start = 0, f.insert = 0))), E(t), t.avail_out === 0)) return f.last_flush = -1, i;
1561
- }
1562
- return R !== g ? i : f.wrap <= 0 ? 1 : (f.wrap === 2 ? (X(f, 255 & t.adler), X(f, t.adler >> 8 & 255), X(f, t.adler >> 16 & 255), X(f, t.adler >> 24 & 255), X(f, 255 & t.total_in), X(f, t.total_in >> 8 & 255), X(f, t.total_in >> 16 & 255), X(f, t.total_in >> 24 & 255)) : (G(f, t.adler >>> 16), G(f, 65535 & t.adler)), E(t), 0 < f.wrap && (f.wrap = -f.wrap), f.pending !== 0 ? i : 1);
1563
- }, k.deflateEnd = function(t) {
1564
- var R;
1565
- return t && t.state ? (R = t.state.status) !== m && R !== 69 && R !== 73 && R !== 91 && R !== 103 && R !== B && R !== 666 ? $(t, d) : (t.state = null, R === B ? $(t, -3) : i) : d;
1566
- }, k.deflateSetDictionary = function(t, R) {
1567
- var A, f, s, w, F, N, z, Z, K = R.length;
1568
- if (!t || !t.state || (w = (A = t.state).wrap) === 2 || w === 1 && A.status !== m || A.lookahead) return d;
1569
- for (w === 1 && (t.adler = u(t.adler, R, K, 0)), A.wrap = 0, K >= A.w_size && (w === 0 && (V(A.head), A.strstart = 0, A.block_start = 0, A.insert = 0), Z = new o.Buf8(A.w_size), o.arraySet(Z, R, K - A.w_size, A.w_size, 0), R = Z, K = A.w_size), F = t.avail_in, N = t.next_in, z = t.input, t.avail_in = K, t.next_in = 0, t.input = R, nt(A); A.lookahead >= I; ) {
1570
- for (f = A.strstart, s = A.lookahead - (I - 1); A.ins_h = (A.ins_h << A.hash_shift ^ A.window[f + I - 1]) & A.hash_mask, A.prev[f & A.w_mask] = A.head[A.ins_h], A.head[A.ins_h] = f, f++, --s; ) ;
1571
- A.strstart = f, A.lookahead = I - 1, nt(A);
1572
- }
1573
- return A.strstart += A.lookahead, A.block_start = A.strstart, A.insert = A.lookahead, A.lookahead = 0, A.match_length = A.prev_length = I - 1, A.match_available = 0, t.next_in = N, t.input = z, t.avail_in = F, A.wrap = w, i;
1574
- }, k.deflateInfo = "pako deflate (from Nodeca project)";
1575
- }, { "../utils/common": 41, "./adler32": 43, "./crc32": 45, "./messages": 51, "./trees": 52 }], 47: [function(b, U, k) {
1576
- U.exports = function() {
1577
- this.text = 0, this.time = 0, this.xflags = 0, this.os = 0, this.extra = null, this.extra_len = 0, this.name = "", this.comment = "", this.hcrc = 0, this.done = !1;
1578
- };
1579
- }, {}], 48: [function(b, U, k) {
1580
- U.exports = function(l, o) {
1581
- var n, u, _, y, p, g, i, d, r, h, a, c, v, S, x, D, O, j, I, W, q, m, B, e, T;
1582
- n = l.state, u = l.next_in, e = l.input, _ = u + (l.avail_in - 5), y = l.next_out, T = l.output, p = y - (o - l.avail_out), g = y + (l.avail_out - 257), i = n.dmax, d = n.wsize, r = n.whave, h = n.wnext, a = n.window, c = n.hold, v = n.bits, S = n.lencode, x = n.distcode, D = (1 << n.lenbits) - 1, O = (1 << n.distbits) - 1;
1583
- t: do {
1584
- v < 15 && (c += e[u++] << v, v += 8, c += e[u++] << v, v += 8), j = S[c & D];
1585
- e: for (; ; ) {
1586
- if (c >>>= I = j >>> 24, v -= I, (I = j >>> 16 & 255) === 0) T[y++] = 65535 & j;
1587
- else {
1588
- if (!(16 & I)) {
1589
- if ((64 & I) == 0) {
1590
- j = S[(65535 & j) + (c & (1 << I) - 1)];
1591
- continue e;
1592
- }
1593
- if (32 & I) {
1594
- n.mode = 12;
1595
- break t;
1596
- }
1597
- l.msg = "invalid literal/length code", n.mode = 30;
1598
- break t;
1599
- }
1600
- W = 65535 & j, (I &= 15) && (v < I && (c += e[u++] << v, v += 8), W += c & (1 << I) - 1, c >>>= I, v -= I), v < 15 && (c += e[u++] << v, v += 8, c += e[u++] << v, v += 8), j = x[c & O];
1601
- r: for (; ; ) {
1602
- if (c >>>= I = j >>> 24, v -= I, !(16 & (I = j >>> 16 & 255))) {
1603
- if ((64 & I) == 0) {
1604
- j = x[(65535 & j) + (c & (1 << I) - 1)];
1605
- continue r;
1606
- }
1607
- l.msg = "invalid distance code", n.mode = 30;
1608
- break t;
1609
- }
1610
- if (q = 65535 & j, v < (I &= 15) && (c += e[u++] << v, (v += 8) < I && (c += e[u++] << v, v += 8)), i < (q += c & (1 << I) - 1)) {
1611
- l.msg = "invalid distance too far back", n.mode = 30;
1612
- break t;
1613
- }
1614
- if (c >>>= I, v -= I, (I = y - p) < q) {
1615
- if (r < (I = q - I) && n.sane) {
1616
- l.msg = "invalid distance too far back", n.mode = 30;
1617
- break t;
1618
- }
1619
- if (B = a, (m = 0) === h) {
1620
- if (m += d - I, I < W) {
1621
- for (W -= I; T[y++] = a[m++], --I; ) ;
1622
- m = y - q, B = T;
1623
- }
1624
- } else if (h < I) {
1625
- if (m += d + h - I, (I -= h) < W) {
1626
- for (W -= I; T[y++] = a[m++], --I; ) ;
1627
- if (m = 0, h < W) {
1628
- for (W -= I = h; T[y++] = a[m++], --I; ) ;
1629
- m = y - q, B = T;
1630
- }
1631
- }
1632
- } else if (m += h - I, I < W) {
1633
- for (W -= I; T[y++] = a[m++], --I; ) ;
1634
- m = y - q, B = T;
1635
- }
1636
- for (; 2 < W; ) T[y++] = B[m++], T[y++] = B[m++], T[y++] = B[m++], W -= 3;
1637
- W && (T[y++] = B[m++], 1 < W && (T[y++] = B[m++]));
1638
- } else {
1639
- for (m = y - q; T[y++] = T[m++], T[y++] = T[m++], T[y++] = T[m++], 2 < (W -= 3); ) ;
1640
- W && (T[y++] = T[m++], 1 < W && (T[y++] = T[m++]));
1641
- }
1642
- break;
1643
- }
1644
- }
1645
- break;
1646
- }
1647
- } while (u < _ && y < g);
1648
- u -= W = v >> 3, c &= (1 << (v -= W << 3)) - 1, l.next_in = u, l.next_out = y, l.avail_in = u < _ ? _ - u + 5 : 5 - (u - _), l.avail_out = y < g ? g - y + 257 : 257 - (y - g), n.hold = c, n.bits = v;
1649
- };
1650
- }, {}], 49: [function(b, U, k) {
1651
- var l = b("../utils/common"), o = b("./adler32"), n = b("./crc32"), u = b("./inffast"), _ = b("./inftrees"), y = 1, p = 2, g = 0, i = -2, d = 1, r = 852, h = 592;
1652
- function a(m) {
1653
- return (m >>> 24 & 255) + (m >>> 8 & 65280) + ((65280 & m) << 8) + ((255 & m) << 24);
1654
- }
1655
- function c() {
1656
- 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;
1657
- }
1658
- function v(m) {
1659
- var B;
1660
- return m && m.state ? (B = m.state, m.total_in = m.total_out = B.total = 0, m.msg = "", B.wrap && (m.adler = 1 & B.wrap), B.mode = d, B.last = 0, B.havedict = 0, B.dmax = 32768, B.head = null, B.hold = 0, B.bits = 0, B.lencode = B.lendyn = new l.Buf32(r), B.distcode = B.distdyn = new l.Buf32(h), B.sane = 1, B.back = -1, g) : i;
1661
- }
1662
- function S(m) {
1663
- var B;
1664
- return m && m.state ? ((B = m.state).wsize = 0, B.whave = 0, B.wnext = 0, v(m)) : i;
1665
- }
1666
- function x(m, B) {
1667
- var e, T;
1668
- return m && m.state ? (T = m.state, B < 0 ? (e = 0, B = -B) : (e = 1 + (B >> 4), B < 48 && (B &= 15)), B && (B < 8 || 15 < B) ? i : (T.window !== null && T.wbits !== B && (T.window = null), T.wrap = e, T.wbits = B, S(m))) : i;
1669
- }
1670
- function D(m, B) {
1671
- var e, T;
1672
- return m ? (T = new c(), (m.state = T).window = null, (e = x(m, B)) !== g && (m.state = null), e) : i;
1673
- }
1674
- var O, j, I = !0;
1675
- function W(m) {
1676
- if (I) {
1677
- var B;
1678
- for (O = new l.Buf32(512), j = new l.Buf32(32), B = 0; B < 144; ) m.lens[B++] = 8;
1679
- for (; B < 256; ) m.lens[B++] = 9;
1680
- for (; B < 280; ) m.lens[B++] = 7;
1681
- for (; B < 288; ) m.lens[B++] = 8;
1682
- for (_(y, m.lens, 0, 288, O, 0, m.work, { bits: 9 }), B = 0; B < 32; ) m.lens[B++] = 5;
1683
- _(p, m.lens, 0, 32, j, 0, m.work, { bits: 5 }), I = !1;
1684
- }
1685
- m.lencode = O, m.lenbits = 9, m.distcode = j, m.distbits = 5;
1686
- }
1687
- function q(m, B, e, T) {
1688
- var J, P = m.state;
1689
- return P.window === null && (P.wsize = 1 << P.wbits, P.wnext = 0, P.whave = 0, P.window = new l.Buf8(P.wsize)), T >= P.wsize ? (l.arraySet(P.window, B, e - P.wsize, P.wsize, 0), P.wnext = 0, P.whave = P.wsize) : (T < (J = P.wsize - P.wnext) && (J = T), l.arraySet(P.window, B, e - T, J, P.wnext), (T -= J) ? (l.arraySet(P.window, B, e - T, T, 0), P.wnext = T, P.whave = P.wsize) : (P.wnext += J, P.wnext === P.wsize && (P.wnext = 0), P.whave < P.wsize && (P.whave += J))), 0;
1690
- }
1691
- k.inflateReset = S, k.inflateReset2 = x, k.inflateResetKeep = v, k.inflateInit = function(m) {
1692
- return D(m, 15);
1693
- }, k.inflateInit2 = D, k.inflate = function(m, B) {
1694
- var e, T, J, P, $, L, V, E, C, X, G, H, nt, ot, Q, et, st, it, lt, ht, t, R, A, f, s = 0, w = new l.Buf8(4), F = [16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15];
1695
- if (!m || !m.state || !m.output || !m.input && m.avail_in !== 0) return i;
1696
- (e = m.state).mode === 12 && (e.mode = 13), $ = m.next_out, J = m.output, V = m.avail_out, P = m.next_in, T = m.input, L = m.avail_in, E = e.hold, C = e.bits, X = L, G = V, R = g;
1697
- t: for (; ; ) switch (e.mode) {
1698
- case d:
1699
- if (e.wrap === 0) {
1700
- e.mode = 13;
1701
- break;
1702
- }
1703
- for (; C < 16; ) {
1704
- if (L === 0) break t;
1705
- L--, E += T[P++] << C, C += 8;
1706
- }
1707
- if (2 & e.wrap && E === 35615) {
1708
- w[e.check = 0] = 255 & E, w[1] = E >>> 8 & 255, e.check = n(e.check, w, 2, 0), C = E = 0, e.mode = 2;
1709
- break;
1710
- }
1711
- if (e.flags = 0, e.head && (e.head.done = !1), !(1 & e.wrap) || (((255 & E) << 8) + (E >> 8)) % 31) {
1712
- m.msg = "incorrect header check", e.mode = 30;
1713
- break;
1714
- }
1715
- if ((15 & E) != 8) {
1716
- m.msg = "unknown compression method", e.mode = 30;
1717
- break;
1718
- }
1719
- if (C -= 4, t = 8 + (15 & (E >>>= 4)), e.wbits === 0) e.wbits = t;
1720
- else if (t > e.wbits) {
1721
- m.msg = "invalid window size", e.mode = 30;
1722
- break;
1723
- }
1724
- e.dmax = 1 << t, m.adler = e.check = 1, e.mode = 512 & E ? 10 : 12, C = E = 0;
1725
- break;
1726
- case 2:
1727
- for (; C < 16; ) {
1728
- if (L === 0) break t;
1729
- L--, E += T[P++] << C, C += 8;
1730
- }
1731
- if (e.flags = E, (255 & e.flags) != 8) {
1732
- m.msg = "unknown compression method", e.mode = 30;
1733
- break;
1734
- }
1735
- if (57344 & e.flags) {
1736
- m.msg = "unknown header flags set", e.mode = 30;
1737
- break;
1738
- }
1739
- e.head && (e.head.text = E >> 8 & 1), 512 & e.flags && (w[0] = 255 & E, w[1] = E >>> 8 & 255, e.check = n(e.check, w, 2, 0)), C = E = 0, e.mode = 3;
1740
- case 3:
1741
- for (; C < 32; ) {
1742
- if (L === 0) break t;
1743
- L--, E += T[P++] << C, C += 8;
1744
- }
1745
- e.head && (e.head.time = E), 512 & e.flags && (w[0] = 255 & E, w[1] = E >>> 8 & 255, w[2] = E >>> 16 & 255, w[3] = E >>> 24 & 255, e.check = n(e.check, w, 4, 0)), C = E = 0, e.mode = 4;
1746
- case 4:
1747
- for (; C < 16; ) {
1748
- if (L === 0) break t;
1749
- L--, E += T[P++] << C, C += 8;
1750
- }
1751
- e.head && (e.head.xflags = 255 & E, e.head.os = E >> 8), 512 & e.flags && (w[0] = 255 & E, w[1] = E >>> 8 & 255, e.check = n(e.check, w, 2, 0)), C = E = 0, e.mode = 5;
1752
- case 5:
1753
- if (1024 & e.flags) {
1754
- for (; C < 16; ) {
1755
- if (L === 0) break t;
1756
- L--, E += T[P++] << C, C += 8;
1757
- }
1758
- e.length = E, e.head && (e.head.extra_len = E), 512 & e.flags && (w[0] = 255 & E, w[1] = E >>> 8 & 255, e.check = n(e.check, w, 2, 0)), C = E = 0;
1759
- } else e.head && (e.head.extra = null);
1760
- e.mode = 6;
1761
- case 6:
1762
- if (1024 & e.flags && (L < (H = e.length) && (H = L), H && (e.head && (t = e.head.extra_len - e.length, e.head.extra || (e.head.extra = new Array(e.head.extra_len)), l.arraySet(e.head.extra, T, P, H, t)), 512 & e.flags && (e.check = n(e.check, T, H, P)), L -= H, P += H, e.length -= H), e.length)) break t;
1763
- e.length = 0, e.mode = 7;
1764
- case 7:
1765
- if (2048 & e.flags) {
1766
- if (L === 0) break t;
1767
- for (H = 0; t = T[P + H++], e.head && t && e.length < 65536 && (e.head.name += String.fromCharCode(t)), t && H < L; ) ;
1768
- if (512 & e.flags && (e.check = n(e.check, T, H, P)), L -= H, P += H, t) break t;
1769
- } else e.head && (e.head.name = null);
1770
- e.length = 0, e.mode = 8;
1771
- case 8:
1772
- if (4096 & e.flags) {
1773
- if (L === 0) break t;
1774
- for (H = 0; t = T[P + H++], e.head && t && e.length < 65536 && (e.head.comment += String.fromCharCode(t)), t && H < L; ) ;
1775
- if (512 & e.flags && (e.check = n(e.check, T, H, P)), L -= H, P += H, t) break t;
1776
- } else e.head && (e.head.comment = null);
1777
- e.mode = 9;
1778
- case 9:
1779
- if (512 & e.flags) {
1780
- for (; C < 16; ) {
1781
- if (L === 0) break t;
1782
- L--, E += T[P++] << C, C += 8;
1783
- }
1784
- if (E !== (65535 & e.check)) {
1785
- m.msg = "header crc mismatch", e.mode = 30;
1786
- break;
1787
- }
1788
- C = E = 0;
1789
- }
1790
- e.head && (e.head.hcrc = e.flags >> 9 & 1, e.head.done = !0), m.adler = e.check = 0, e.mode = 12;
1791
- break;
1792
- case 10:
1793
- for (; C < 32; ) {
1794
- if (L === 0) break t;
1795
- L--, E += T[P++] << C, C += 8;
1796
- }
1797
- m.adler = e.check = a(E), C = E = 0, e.mode = 11;
1798
- case 11:
1799
- if (e.havedict === 0) return m.next_out = $, m.avail_out = V, m.next_in = P, m.avail_in = L, e.hold = E, e.bits = C, 2;
1800
- m.adler = e.check = 1, e.mode = 12;
1801
- case 12:
1802
- if (B === 5 || B === 6) break t;
1803
- case 13:
1804
- if (e.last) {
1805
- E >>>= 7 & C, C -= 7 & C, e.mode = 27;
1806
- break;
1807
- }
1808
- for (; C < 3; ) {
1809
- if (L === 0) break t;
1810
- L--, E += T[P++] << C, C += 8;
1811
- }
1812
- switch (e.last = 1 & E, C -= 1, 3 & (E >>>= 1)) {
1813
- case 0:
1814
- e.mode = 14;
1815
- break;
1816
- case 1:
1817
- if (W(e), e.mode = 20, B !== 6) break;
1818
- E >>>= 2, C -= 2;
1819
- break t;
1820
- case 2:
1821
- e.mode = 17;
1822
- break;
1823
- case 3:
1824
- m.msg = "invalid block type", e.mode = 30;
1825
- }
1826
- E >>>= 2, C -= 2;
1827
- break;
1828
- case 14:
1829
- for (E >>>= 7 & C, C -= 7 & C; C < 32; ) {
1830
- if (L === 0) break t;
1831
- L--, E += T[P++] << C, C += 8;
1832
- }
1833
- if ((65535 & E) != (E >>> 16 ^ 65535)) {
1834
- m.msg = "invalid stored block lengths", e.mode = 30;
1835
- break;
1836
- }
1837
- if (e.length = 65535 & E, C = E = 0, e.mode = 15, B === 6) break t;
1838
- case 15:
1839
- e.mode = 16;
1840
- case 16:
1841
- if (H = e.length) {
1842
- if (L < H && (H = L), V < H && (H = V), H === 0) break t;
1843
- l.arraySet(J, T, P, H, $), L -= H, P += H, V -= H, $ += H, e.length -= H;
1844
- break;
1845
- }
1846
- e.mode = 12;
1847
- break;
1848
- case 17:
1849
- for (; C < 14; ) {
1850
- if (L === 0) break t;
1851
- L--, E += T[P++] << C, C += 8;
1852
- }
1853
- if (e.nlen = 257 + (31 & E), E >>>= 5, C -= 5, e.ndist = 1 + (31 & E), E >>>= 5, C -= 5, e.ncode = 4 + (15 & E), E >>>= 4, C -= 4, 286 < e.nlen || 30 < e.ndist) {
1854
- m.msg = "too many length or distance symbols", e.mode = 30;
1855
- break;
1856
- }
1857
- e.have = 0, e.mode = 18;
1858
- case 18:
1859
- for (; e.have < e.ncode; ) {
1860
- for (; C < 3; ) {
1861
- if (L === 0) break t;
1862
- L--, E += T[P++] << C, C += 8;
1863
- }
1864
- e.lens[F[e.have++]] = 7 & E, E >>>= 3, C -= 3;
1865
- }
1866
- for (; e.have < 19; ) e.lens[F[e.have++]] = 0;
1867
- if (e.lencode = e.lendyn, e.lenbits = 7, A = { bits: e.lenbits }, R = _(0, e.lens, 0, 19, e.lencode, 0, e.work, A), e.lenbits = A.bits, R) {
1868
- m.msg = "invalid code lengths set", e.mode = 30;
1869
- break;
1870
- }
1871
- e.have = 0, e.mode = 19;
1872
- case 19:
1873
- for (; e.have < e.nlen + e.ndist; ) {
1874
- for (; et = (s = e.lencode[E & (1 << e.lenbits) - 1]) >>> 16 & 255, st = 65535 & s, !((Q = s >>> 24) <= C); ) {
1875
- if (L === 0) break t;
1876
- L--, E += T[P++] << C, C += 8;
1877
- }
1878
- if (st < 16) E >>>= Q, C -= Q, e.lens[e.have++] = st;
1879
- else {
1880
- if (st === 16) {
1881
- for (f = Q + 2; C < f; ) {
1882
- if (L === 0) break t;
1883
- L--, E += T[P++] << C, C += 8;
1884
- }
1885
- if (E >>>= Q, C -= Q, e.have === 0) {
1886
- m.msg = "invalid bit length repeat", e.mode = 30;
1887
- break;
1888
- }
1889
- t = e.lens[e.have - 1], H = 3 + (3 & E), E >>>= 2, C -= 2;
1890
- } else if (st === 17) {
1891
- for (f = Q + 3; C < f; ) {
1892
- if (L === 0) break t;
1893
- L--, E += T[P++] << C, C += 8;
1894
- }
1895
- C -= Q, t = 0, H = 3 + (7 & (E >>>= Q)), E >>>= 3, C -= 3;
1896
- } else {
1897
- for (f = Q + 7; C < f; ) {
1898
- if (L === 0) break t;
1899
- L--, E += T[P++] << C, C += 8;
1900
- }
1901
- C -= Q, t = 0, H = 11 + (127 & (E >>>= Q)), E >>>= 7, C -= 7;
1902
- }
1903
- if (e.have + H > e.nlen + e.ndist) {
1904
- m.msg = "invalid bit length repeat", e.mode = 30;
1905
- break;
1906
- }
1907
- for (; H--; ) e.lens[e.have++] = t;
1908
- }
1909
- }
1910
- if (e.mode === 30) break;
1911
- if (e.lens[256] === 0) {
1912
- m.msg = "invalid code -- missing end-of-block", e.mode = 30;
1913
- break;
1914
- }
1915
- if (e.lenbits = 9, A = { bits: e.lenbits }, R = _(y, e.lens, 0, e.nlen, e.lencode, 0, e.work, A), e.lenbits = A.bits, R) {
1916
- m.msg = "invalid literal/lengths set", e.mode = 30;
1917
- break;
1918
- }
1919
- if (e.distbits = 6, e.distcode = e.distdyn, A = { bits: e.distbits }, R = _(p, e.lens, e.nlen, e.ndist, e.distcode, 0, e.work, A), e.distbits = A.bits, R) {
1920
- m.msg = "invalid distances set", e.mode = 30;
1921
- break;
1922
- }
1923
- if (e.mode = 20, B === 6) break t;
1924
- case 20:
1925
- e.mode = 21;
1926
- case 21:
1927
- if (6 <= L && 258 <= V) {
1928
- m.next_out = $, m.avail_out = V, m.next_in = P, m.avail_in = L, e.hold = E, e.bits = C, u(m, G), $ = m.next_out, J = m.output, V = m.avail_out, P = m.next_in, T = m.input, L = m.avail_in, E = e.hold, C = e.bits, e.mode === 12 && (e.back = -1);
1929
- break;
1930
- }
1931
- for (e.back = 0; et = (s = e.lencode[E & (1 << e.lenbits) - 1]) >>> 16 & 255, st = 65535 & s, !((Q = s >>> 24) <= C); ) {
1932
- if (L === 0) break t;
1933
- L--, E += T[P++] << C, C += 8;
1934
- }
1935
- if (et && (240 & et) == 0) {
1936
- for (it = Q, lt = et, ht = st; et = (s = e.lencode[ht + ((E & (1 << it + lt) - 1) >> it)]) >>> 16 & 255, st = 65535 & s, !(it + (Q = s >>> 24) <= C); ) {
1937
- if (L === 0) break t;
1938
- L--, E += T[P++] << C, C += 8;
1939
- }
1940
- E >>>= it, C -= it, e.back += it;
1941
- }
1942
- if (E >>>= Q, C -= Q, e.back += Q, e.length = st, et === 0) {
1943
- e.mode = 26;
1944
- break;
1945
- }
1946
- if (32 & et) {
1947
- e.back = -1, e.mode = 12;
1948
- break;
1949
- }
1950
- if (64 & et) {
1951
- m.msg = "invalid literal/length code", e.mode = 30;
1952
- break;
1953
- }
1954
- e.extra = 15 & et, e.mode = 22;
1955
- case 22:
1956
- if (e.extra) {
1957
- for (f = e.extra; C < f; ) {
1958
- if (L === 0) break t;
1959
- L--, E += T[P++] << C, C += 8;
1960
- }
1961
- e.length += E & (1 << e.extra) - 1, E >>>= e.extra, C -= e.extra, e.back += e.extra;
1962
- }
1963
- e.was = e.length, e.mode = 23;
1964
- case 23:
1965
- for (; et = (s = e.distcode[E & (1 << e.distbits) - 1]) >>> 16 & 255, st = 65535 & s, !((Q = s >>> 24) <= C); ) {
1966
- if (L === 0) break t;
1967
- L--, E += T[P++] << C, C += 8;
1968
- }
1969
- if ((240 & et) == 0) {
1970
- for (it = Q, lt = et, ht = st; et = (s = e.distcode[ht + ((E & (1 << it + lt) - 1) >> it)]) >>> 16 & 255, st = 65535 & s, !(it + (Q = s >>> 24) <= C); ) {
1971
- if (L === 0) break t;
1972
- L--, E += T[P++] << C, C += 8;
1973
- }
1974
- E >>>= it, C -= it, e.back += it;
1975
- }
1976
- if (E >>>= Q, C -= Q, e.back += Q, 64 & et) {
1977
- m.msg = "invalid distance code", e.mode = 30;
1978
- break;
1979
- }
1980
- e.offset = st, e.extra = 15 & et, e.mode = 24;
1981
- case 24:
1982
- if (e.extra) {
1983
- for (f = e.extra; C < f; ) {
1984
- if (L === 0) break t;
1985
- L--, E += T[P++] << C, C += 8;
1986
- }
1987
- e.offset += E & (1 << e.extra) - 1, E >>>= e.extra, C -= e.extra, e.back += e.extra;
1988
- }
1989
- if (e.offset > e.dmax) {
1990
- m.msg = "invalid distance too far back", e.mode = 30;
1991
- break;
1992
- }
1993
- e.mode = 25;
1994
- case 25:
1995
- if (V === 0) break t;
1996
- if (H = G - V, e.offset > H) {
1997
- if ((H = e.offset - H) > e.whave && e.sane) {
1998
- m.msg = "invalid distance too far back", e.mode = 30;
1999
- break;
2000
- }
2001
- nt = H > e.wnext ? (H -= e.wnext, e.wsize - H) : e.wnext - H, H > e.length && (H = e.length), ot = e.window;
2002
- } else ot = J, nt = $ - e.offset, H = e.length;
2003
- for (V < H && (H = V), V -= H, e.length -= H; J[$++] = ot[nt++], --H; ) ;
2004
- e.length === 0 && (e.mode = 21);
2005
- break;
2006
- case 26:
2007
- if (V === 0) break t;
2008
- J[$++] = e.length, V--, e.mode = 21;
2009
- break;
2010
- case 27:
2011
- if (e.wrap) {
2012
- for (; C < 32; ) {
2013
- if (L === 0) break t;
2014
- L--, E |= T[P++] << C, C += 8;
2015
- }
2016
- if (G -= V, m.total_out += G, e.total += G, G && (m.adler = e.check = e.flags ? n(e.check, J, G, $ - G) : o(e.check, J, G, $ - G)), G = V, (e.flags ? E : a(E)) !== e.check) {
2017
- m.msg = "incorrect data check", e.mode = 30;
2018
- break;
2019
- }
2020
- C = E = 0;
2021
- }
2022
- e.mode = 28;
2023
- case 28:
2024
- if (e.wrap && e.flags) {
2025
- for (; C < 32; ) {
2026
- if (L === 0) break t;
2027
- L--, E += T[P++] << C, C += 8;
2028
- }
2029
- if (E !== (4294967295 & e.total)) {
2030
- m.msg = "incorrect length check", e.mode = 30;
2031
- break;
2032
- }
2033
- C = E = 0;
2034
- }
2035
- e.mode = 29;
2036
- case 29:
2037
- R = 1;
2038
- break t;
2039
- case 30:
2040
- R = -3;
2041
- break t;
2042
- case 31:
2043
- return -4;
2044
- case 32:
2045
- default:
2046
- return i;
2047
- }
2048
- return m.next_out = $, m.avail_out = V, m.next_in = P, m.avail_in = L, e.hold = E, e.bits = C, (e.wsize || G !== m.avail_out && e.mode < 30 && (e.mode < 27 || B !== 4)) && q(m, m.output, m.next_out, G - m.avail_out) ? (e.mode = 31, -4) : (X -= m.avail_in, G -= m.avail_out, m.total_in += X, m.total_out += G, e.total += G, e.wrap && G && (m.adler = e.check = e.flags ? n(e.check, J, G, m.next_out - G) : o(e.check, J, G, m.next_out - G)), m.data_type = e.bits + (e.last ? 64 : 0) + (e.mode === 12 ? 128 : 0) + (e.mode === 20 || e.mode === 15 ? 256 : 0), (X == 0 && G === 0 || B === 4) && R === g && (R = -5), R);
2049
- }, k.inflateEnd = function(m) {
2050
- if (!m || !m.state) return i;
2051
- var B = m.state;
2052
- return B.window && (B.window = null), m.state = null, g;
2053
- }, k.inflateGetHeader = function(m, B) {
2054
- var e;
2055
- return m && m.state ? (2 & (e = m.state).wrap) == 0 ? i : ((e.head = B).done = !1, g) : i;
2056
- }, k.inflateSetDictionary = function(m, B) {
2057
- var e, T = B.length;
2058
- return m && m.state ? (e = m.state).wrap !== 0 && e.mode !== 11 ? i : e.mode === 11 && o(1, B, T, 0) !== e.check ? -3 : q(m, B, T, T) ? (e.mode = 31, -4) : (e.havedict = 1, g) : i;
2059
- }, k.inflateInfo = "pako inflate (from Nodeca project)";
2060
- }, { "../utils/common": 41, "./adler32": 43, "./crc32": 45, "./inffast": 48, "./inftrees": 50 }], 50: [function(b, U, k) {
2061
- var l = b("../utils/common"), o = [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], n = [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], u = [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], _ = [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];
2062
- U.exports = function(y, p, g, i, d, r, h, a) {
2063
- var c, v, S, x, D, O, j, I, W, q = a.bits, m = 0, B = 0, e = 0, T = 0, J = 0, P = 0, $ = 0, L = 0, V = 0, E = 0, C = null, X = 0, G = new l.Buf16(16), H = new l.Buf16(16), nt = null, ot = 0;
2064
- for (m = 0; m <= 15; m++) G[m] = 0;
2065
- for (B = 0; B < i; B++) G[p[g + B]]++;
2066
- for (J = q, T = 15; 1 <= T && G[T] === 0; T--) ;
2067
- if (T < J && (J = T), T === 0) return d[r++] = 20971520, d[r++] = 20971520, a.bits = 1, 0;
2068
- for (e = 1; e < T && G[e] === 0; e++) ;
2069
- for (J < e && (J = e), m = L = 1; m <= 15; m++) if (L <<= 1, (L -= G[m]) < 0) return -1;
2070
- if (0 < L && (y === 0 || T !== 1)) return -1;
2071
- for (H[1] = 0, m = 1; m < 15; m++) H[m + 1] = H[m] + G[m];
2072
- for (B = 0; B < i; B++) p[g + B] !== 0 && (h[H[p[g + B]]++] = B);
2073
- if (O = y === 0 ? (C = nt = h, 19) : y === 1 ? (C = o, X -= 257, nt = n, ot -= 257, 256) : (C = u, nt = _, -1), m = e, D = r, $ = B = E = 0, S = -1, x = (V = 1 << (P = J)) - 1, y === 1 && 852 < V || y === 2 && 592 < V) return 1;
2074
- for (; ; ) {
2075
- for (j = m - $, W = h[B] < O ? (I = 0, h[B]) : h[B] > O ? (I = nt[ot + h[B]], C[X + h[B]]) : (I = 96, 0), c = 1 << m - $, e = v = 1 << P; d[D + (E >> $) + (v -= c)] = j << 24 | I << 16 | W | 0, v !== 0; ) ;
2076
- for (c = 1 << m - 1; E & c; ) c >>= 1;
2077
- if (c !== 0 ? (E &= c - 1, E += c) : E = 0, B++, --G[m] == 0) {
2078
- if (m === T) break;
2079
- m = p[g + h[B]];
2080
- }
2081
- if (J < m && (E & x) !== S) {
2082
- for ($ === 0 && ($ = J), D += e, L = 1 << (P = m - $); P + $ < T && !((L -= G[P + $]) <= 0); ) P++, L <<= 1;
2083
- if (V += 1 << P, y === 1 && 852 < V || y === 2 && 592 < V) return 1;
2084
- d[S = E & x] = J << 24 | P << 16 | D - r | 0;
2085
- }
2086
- }
2087
- return E !== 0 && (d[D + E] = m - $ << 24 | 64 << 16 | 0), a.bits = J, 0;
2088
- };
2089
- }, { "../utils/common": 41 }], 51: [function(b, U, k) {
2090
- U.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" };
2091
- }, {}], 52: [function(b, U, k) {
2092
- var l = b("../utils/common"), o = 0, n = 1;
2093
- function u(s) {
2094
- for (var w = s.length; 0 <= --w; ) s[w] = 0;
2095
- }
2096
- var _ = 0, y = 29, p = 256, g = p + 1 + y, i = 30, d = 19, r = 2 * g + 1, h = 15, a = 16, c = 7, v = 256, S = 16, x = 17, D = 18, O = [0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 5, 5, 5, 5, 0], 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], I = [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], q = new Array(2 * (g + 2));
2097
- u(q);
2098
- var m = new Array(2 * i);
2099
- u(m);
2100
- var B = new Array(512);
2101
- u(B);
2102
- var e = new Array(256);
2103
- u(e);
2104
- var T = new Array(y);
2105
- u(T);
2106
- var J, P, $, L = new Array(i);
2107
- function V(s, w, F, N, z) {
2108
- this.static_tree = s, this.extra_bits = w, this.extra_base = F, this.elems = N, this.max_length = z, this.has_stree = s && s.length;
2109
- }
2110
- function E(s, w) {
2111
- this.dyn_tree = s, this.max_code = 0, this.stat_desc = w;
2112
- }
2113
- function C(s) {
2114
- return s < 256 ? B[s] : B[256 + (s >>> 7)];
2115
- }
2116
- function X(s, w) {
2117
- s.pending_buf[s.pending++] = 255 & w, s.pending_buf[s.pending++] = w >>> 8 & 255;
2118
- }
2119
- function G(s, w, F) {
2120
- s.bi_valid > a - F ? (s.bi_buf |= w << s.bi_valid & 65535, X(s, s.bi_buf), s.bi_buf = w >> a - s.bi_valid, s.bi_valid += F - a) : (s.bi_buf |= w << s.bi_valid & 65535, s.bi_valid += F);
2121
- }
2122
- function H(s, w, F) {
2123
- G(s, F[2 * w], F[2 * w + 1]);
2124
- }
2125
- function nt(s, w) {
2126
- for (var F = 0; F |= 1 & s, s >>>= 1, F <<= 1, 0 < --w; ) ;
2127
- return F >>> 1;
2128
- }
2129
- function ot(s, w, F) {
2130
- var N, z, Z = new Array(h + 1), K = 0;
2131
- for (N = 1; N <= h; N++) Z[N] = K = K + F[N - 1] << 1;
2132
- for (z = 0; z <= w; z++) {
2133
- var M = s[2 * z + 1];
2134
- M !== 0 && (s[2 * z] = nt(Z[M]++, M));
2135
- }
2136
- }
2137
- function Q(s) {
2138
- var w;
2139
- for (w = 0; w < g; w++) s.dyn_ltree[2 * w] = 0;
2140
- for (w = 0; w < i; w++) s.dyn_dtree[2 * w] = 0;
2141
- for (w = 0; w < d; w++) s.bl_tree[2 * w] = 0;
2142
- s.dyn_ltree[2 * v] = 1, s.opt_len = s.static_len = 0, s.last_lit = s.matches = 0;
2143
- }
2144
- function et(s) {
2145
- 8 < s.bi_valid ? X(s, s.bi_buf) : 0 < s.bi_valid && (s.pending_buf[s.pending++] = s.bi_buf), s.bi_buf = 0, s.bi_valid = 0;
2146
- }
2147
- function st(s, w, F, N) {
2148
- var z = 2 * w, Z = 2 * F;
2149
- return s[z] < s[Z] || s[z] === s[Z] && N[w] <= N[F];
2150
- }
2151
- function it(s, w, F) {
2152
- for (var N = s.heap[F], z = F << 1; z <= s.heap_len && (z < s.heap_len && st(w, s.heap[z + 1], s.heap[z], s.depth) && z++, !st(w, N, s.heap[z], s.depth)); ) s.heap[F] = s.heap[z], F = z, z <<= 1;
2153
- s.heap[F] = N;
2154
- }
2155
- function lt(s, w, F) {
2156
- var N, z, Z, K, M = 0;
2157
- if (s.last_lit !== 0) for (; N = s.pending_buf[s.d_buf + 2 * M] << 8 | s.pending_buf[s.d_buf + 2 * M + 1], z = s.pending_buf[s.l_buf + M], M++, N === 0 ? H(s, z, w) : (H(s, (Z = e[z]) + p + 1, w), (K = O[Z]) !== 0 && G(s, z -= T[Z], K), H(s, Z = C(--N), F), (K = j[Z]) !== 0 && G(s, N -= L[Z], K)), M < s.last_lit; ) ;
2158
- H(s, v, w);
2159
- }
2160
- function ht(s, w) {
2161
- var F, N, z, Z = w.dyn_tree, K = w.stat_desc.static_tree, M = w.stat_desc.has_stree, Y = w.stat_desc.elems, rt = -1;
2162
- for (s.heap_len = 0, s.heap_max = r, F = 0; F < Y; F++) Z[2 * F] !== 0 ? (s.heap[++s.heap_len] = rt = F, s.depth[F] = 0) : Z[2 * F + 1] = 0;
2163
- for (; s.heap_len < 2; ) Z[2 * (z = s.heap[++s.heap_len] = rt < 2 ? ++rt : 0)] = 1, s.depth[z] = 0, s.opt_len--, M && (s.static_len -= K[2 * z + 1]);
2164
- for (w.max_code = rt, F = s.heap_len >> 1; 1 <= F; F--) it(s, Z, F);
2165
- for (z = Y; F = s.heap[1], s.heap[1] = s.heap[s.heap_len--], it(s, Z, 1), N = s.heap[1], s.heap[--s.heap_max] = F, s.heap[--s.heap_max] = N, Z[2 * z] = Z[2 * F] + Z[2 * N], s.depth[z] = (s.depth[F] >= s.depth[N] ? s.depth[F] : s.depth[N]) + 1, Z[2 * F + 1] = Z[2 * N + 1] = z, s.heap[1] = z++, it(s, Z, 1), 2 <= s.heap_len; ) ;
2166
- s.heap[--s.heap_max] = s.heap[1], function(tt, ut) {
2167
- var ct, ft, pt, at, _t, wt, dt = ut.dyn_tree, xt = ut.max_code, Ct = ut.stat_desc.static_tree, Et = ut.stat_desc.has_stree, At = ut.stat_desc.extra_bits, St = ut.stat_desc.extra_base, mt = ut.stat_desc.max_length, gt = 0;
2168
- for (at = 0; at <= h; at++) tt.bl_count[at] = 0;
2169
- for (dt[2 * tt.heap[tt.heap_max] + 1] = 0, ct = tt.heap_max + 1; ct < r; ct++) mt < (at = dt[2 * dt[2 * (ft = tt.heap[ct]) + 1] + 1] + 1) && (at = mt, gt++), dt[2 * ft + 1] = at, xt < ft || (tt.bl_count[at]++, _t = 0, St <= ft && (_t = At[ft - St]), wt = dt[2 * ft], tt.opt_len += wt * (at + _t), Et && (tt.static_len += wt * (Ct[2 * ft + 1] + _t)));
2170
- if (gt !== 0) {
2171
- do {
2172
- for (at = mt - 1; tt.bl_count[at] === 0; ) at--;
2173
- tt.bl_count[at]--, tt.bl_count[at + 1] += 2, tt.bl_count[mt]--, gt -= 2;
2174
- } while (0 < gt);
2175
- for (at = mt; at !== 0; at--) for (ft = tt.bl_count[at]; ft !== 0; ) xt < (pt = tt.heap[--ct]) || (dt[2 * pt + 1] !== at && (tt.opt_len += (at - dt[2 * pt + 1]) * dt[2 * pt], dt[2 * pt + 1] = at), ft--);
2176
- }
2177
- }(s, w), ot(Z, rt, s.bl_count);
2178
- }
2179
- function t(s, w, F) {
2180
- var N, z, Z = -1, K = w[1], M = 0, Y = 7, rt = 4;
2181
- for (K === 0 && (Y = 138, rt = 3), w[2 * (F + 1) + 1] = 65535, N = 0; N <= F; N++) z = K, K = w[2 * (N + 1) + 1], ++M < Y && z === K || (M < rt ? s.bl_tree[2 * z] += M : z !== 0 ? (z !== Z && s.bl_tree[2 * z]++, s.bl_tree[2 * S]++) : M <= 10 ? s.bl_tree[2 * x]++ : s.bl_tree[2 * D]++, Z = z, rt = (M = 0) === K ? (Y = 138, 3) : z === K ? (Y = 6, 3) : (Y = 7, 4));
2182
- }
2183
- function R(s, w, F) {
2184
- var N, z, Z = -1, K = w[1], M = 0, Y = 7, rt = 4;
2185
- for (K === 0 && (Y = 138, rt = 3), N = 0; N <= F; N++) if (z = K, K = w[2 * (N + 1) + 1], !(++M < Y && z === K)) {
2186
- if (M < rt) for (; H(s, z, s.bl_tree), --M != 0; ) ;
2187
- else z !== 0 ? (z !== Z && (H(s, z, s.bl_tree), M--), H(s, S, s.bl_tree), G(s, M - 3, 2)) : M <= 10 ? (H(s, x, s.bl_tree), G(s, M - 3, 3)) : (H(s, D, s.bl_tree), G(s, M - 11, 7));
2188
- Z = z, rt = (M = 0) === K ? (Y = 138, 3) : z === K ? (Y = 6, 3) : (Y = 7, 4);
2189
- }
2190
- }
2191
- u(L);
2192
- var A = !1;
2193
- function f(s, w, F, N) {
2194
- G(s, (_ << 1) + (N ? 1 : 0), 3), function(z, Z, K, M) {
2195
- et(z), X(z, K), X(z, ~K), l.arraySet(z.pending_buf, z.window, Z, K, z.pending), z.pending += K;
2196
- }(s, w, F);
2197
- }
2198
- k._tr_init = function(s) {
2199
- A || (function() {
2200
- var w, F, N, z, Z, K = new Array(h + 1);
2201
- for (z = N = 0; z < y - 1; z++) for (T[z] = N, w = 0; w < 1 << O[z]; w++) e[N++] = z;
2202
- for (e[N - 1] = z, z = Z = 0; z < 16; z++) for (L[z] = Z, w = 0; w < 1 << j[z]; w++) B[Z++] = z;
2203
- for (Z >>= 7; z < i; z++) for (L[z] = Z << 7, w = 0; w < 1 << j[z] - 7; w++) B[256 + Z++] = z;
2204
- for (F = 0; F <= h; F++) K[F] = 0;
2205
- for (w = 0; w <= 143; ) q[2 * w + 1] = 8, w++, K[8]++;
2206
- for (; w <= 255; ) q[2 * w + 1] = 9, w++, K[9]++;
2207
- for (; w <= 279; ) q[2 * w + 1] = 7, w++, K[7]++;
2208
- for (; w <= 287; ) q[2 * w + 1] = 8, w++, K[8]++;
2209
- for (ot(q, g + 1, K), w = 0; w < i; w++) m[2 * w + 1] = 5, m[2 * w] = nt(w, 5);
2210
- J = new V(q, O, p + 1, g, h), P = new V(m, j, 0, i, h), $ = new V(new Array(0), I, 0, d, c);
2211
- }(), A = !0), s.l_desc = new E(s.dyn_ltree, J), s.d_desc = new E(s.dyn_dtree, P), s.bl_desc = new E(s.bl_tree, $), s.bi_buf = 0, s.bi_valid = 0, Q(s);
2212
- }, k._tr_stored_block = f, k._tr_flush_block = function(s, w, F, N) {
2213
- var z, Z, K = 0;
2214
- 0 < s.level ? (s.strm.data_type === 2 && (s.strm.data_type = function(M) {
2215
- var Y, rt = 4093624447;
2216
- for (Y = 0; Y <= 31; Y++, rt >>>= 1) if (1 & rt && M.dyn_ltree[2 * Y] !== 0) return o;
2217
- if (M.dyn_ltree[18] !== 0 || M.dyn_ltree[20] !== 0 || M.dyn_ltree[26] !== 0) return n;
2218
- for (Y = 32; Y < p; Y++) if (M.dyn_ltree[2 * Y] !== 0) return n;
2219
- return o;
2220
- }(s)), ht(s, s.l_desc), ht(s, s.d_desc), K = function(M) {
2221
- var Y;
2222
- for (t(M, M.dyn_ltree, M.l_desc.max_code), t(M, M.dyn_dtree, M.d_desc.max_code), ht(M, M.bl_desc), Y = d - 1; 3 <= Y && M.bl_tree[2 * W[Y] + 1] === 0; Y--) ;
2223
- return M.opt_len += 3 * (Y + 1) + 5 + 5 + 4, Y;
2224
- }(s), z = s.opt_len + 3 + 7 >>> 3, (Z = s.static_len + 3 + 7 >>> 3) <= z && (z = Z)) : z = Z = F + 5, F + 4 <= z && w !== -1 ? f(s, w, F, N) : s.strategy === 4 || Z === z ? (G(s, 2 + (N ? 1 : 0), 3), lt(s, q, m)) : (G(s, 4 + (N ? 1 : 0), 3), function(M, Y, rt, tt) {
2225
- var ut;
2226
- for (G(M, Y - 257, 5), G(M, rt - 1, 5), G(M, tt - 4, 4), ut = 0; ut < tt; ut++) G(M, M.bl_tree[2 * W[ut] + 1], 3);
2227
- R(M, M.dyn_ltree, Y - 1), R(M, M.dyn_dtree, rt - 1);
2228
- }(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, K + 1), lt(s, s.dyn_ltree, s.dyn_dtree)), Q(s), N && et(s);
2229
- }, k._tr_tally = function(s, w, F) {
2230
- return s.pending_buf[s.d_buf + 2 * s.last_lit] = w >>> 8 & 255, s.pending_buf[s.d_buf + 2 * s.last_lit + 1] = 255 & w, s.pending_buf[s.l_buf + s.last_lit] = 255 & F, s.last_lit++, w === 0 ? s.dyn_ltree[2 * F]++ : (s.matches++, w--, s.dyn_ltree[2 * (e[F] + p + 1)]++, s.dyn_dtree[2 * C(w)]++), s.last_lit === s.lit_bufsize - 1;
2231
- }, k._tr_align = function(s) {
2232
- G(s, 2, 3), H(s, v, q), function(w) {
2233
- w.bi_valid === 16 ? (X(w, w.bi_buf), w.bi_buf = 0, w.bi_valid = 0) : 8 <= w.bi_valid && (w.pending_buf[w.pending++] = 255 & w.bi_buf, w.bi_buf >>= 8, w.bi_valid -= 8);
2234
- }(s);
2235
- };
2236
- }, { "../utils/common": 41 }], 53: [function(b, U, k) {
2237
- U.exports = function() {
2238
- this.input = null, this.next_in = 0, this.avail_in = 0, this.total_in = 0, this.output = null, this.next_out = 0, this.avail_out = 0, this.total_out = 0, this.msg = "", this.state = null, this.data_type = 2, this.adler = 0;
2239
- };
2240
- }, {}], 54: [function(b, U, k) {
2241
- (function(l) {
2242
- (function(o, n) {
2243
- if (!o.setImmediate) {
2244
- var u, _, y, p, g = 1, i = {}, d = !1, r = o.document, h = Object.getPrototypeOf && Object.getPrototypeOf(o);
2245
- h = h && h.setTimeout ? h : o, u = {}.toString.call(o.process) === "[object process]" ? function(S) {
2246
- process.nextTick(function() {
2247
- c(S);
2248
- });
2249
- } : function() {
2250
- if (o.postMessage && !o.importScripts) {
2251
- var S = !0, x = o.onmessage;
2252
- return o.onmessage = function() {
2253
- S = !1;
2254
- }, o.postMessage("", "*"), o.onmessage = x, S;
2255
- }
2256
- }() ? (p = "setImmediate$" + Math.random() + "$", o.addEventListener ? o.addEventListener("message", v, !1) : o.attachEvent("onmessage", v), function(S) {
2257
- o.postMessage(p + S, "*");
2258
- }) : o.MessageChannel ? ((y = new MessageChannel()).port1.onmessage = function(S) {
2259
- c(S.data);
2260
- }, function(S) {
2261
- y.port2.postMessage(S);
2262
- }) : r && "onreadystatechange" in r.createElement("script") ? (_ = r.documentElement, function(S) {
2263
- var x = r.createElement("script");
2264
- x.onreadystatechange = function() {
2265
- c(S), x.onreadystatechange = null, _.removeChild(x), x = null;
2266
- }, _.appendChild(x);
2267
- }) : function(S) {
2268
- setTimeout(c, 0, S);
2269
- }, h.setImmediate = function(S) {
2270
- typeof S != "function" && (S = new Function("" + S));
2271
- for (var x = new Array(arguments.length - 1), D = 0; D < x.length; D++) x[D] = arguments[D + 1];
2272
- var O = { callback: S, args: x };
2273
- return i[g] = O, u(g), g++;
2274
- }, h.clearImmediate = a;
2275
- }
2276
- function a(S) {
2277
- delete i[S];
2278
- }
2279
- function c(S) {
2280
- if (d) setTimeout(c, 0, S);
2281
- else {
2282
- var x = i[S];
2283
- if (x) {
2284
- d = !0;
2285
- try {
2286
- (function(D) {
2287
- var O = D.callback, j = D.args;
2288
- switch (j.length) {
2289
- case 0:
2290
- O();
2291
- break;
2292
- case 1:
2293
- O(j[0]);
2294
- break;
2295
- case 2:
2296
- O(j[0], j[1]);
2297
- break;
2298
- case 3:
2299
- O(j[0], j[1], j[2]);
2300
- break;
2301
- default:
2302
- O.apply(n, j);
2303
- }
2304
- })(x);
2305
- } finally {
2306
- a(S), d = !1;
2307
- }
2308
- }
2309
- }
2310
- }
2311
- function v(S) {
2312
- S.source === o && typeof S.data == "string" && S.data.indexOf(p) === 0 && c(+S.data.slice(p.length));
2313
- }
2314
- })(typeof self > "u" ? l === void 0 ? this : l : self);
2315
- }).call(this, typeof bt < "u" ? bt : typeof self < "u" ? self : typeof window < "u" ? window : {});
2316
- }, {}] }, {}, [10])(10);
2317
- });
2318
- }(kt)), kt.exports;
2319
- }
2320
- var Bt = Ot();
2321
- const Rt = /* @__PURE__ */ It(Bt), Ft = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
2322
- __proto__: null,
2323
- default: Rt
2324
- }, Symbol.toStringTag, { value: "Module" }));
2325
- export {
2326
- Ft as j
2327
- };