3061 lines
143 KiB
JavaScript
3061 lines
143 KiB
JavaScript
import { __commonJS, __require } from "./chunk-BWFcvgca.js";
|
||
|
||
//#region node_modules/.pnpm/jszip@3.10.1/node_modules/jszip/dist/jszip.min.js
|
||
var require_jszip_min = /* @__PURE__ */ __commonJS({ "node_modules/.pnpm/jszip@3.10.1/node_modules/jszip/dist/jszip.min.js": ((exports, module) => {
|
||
/*!
|
||
|
||
JSZip v3.10.1 - A JavaScript class for generating and reading zip files
|
||
<http://stuartk.com/jszip>
|
||
|
||
(c) 2009-2016 Stuart Knightley <stuart [at] stuartk.com>
|
||
Dual licenced under the MIT license or GPLv3. See https://raw.github.com/Stuk/jszip/main/LICENSE.markdown.
|
||
|
||
JSZip uses the library pako released under the MIT license :
|
||
https://github.com/nodeca/pako/blob/main/LICENSE
|
||
*/
|
||
(function(e) {
|
||
if ("object" == typeof exports && "undefined" != typeof module) module.exports = e();
|
||
else if ("function" == typeof define && define.amd) define([], e);
|
||
else ("undefined" != typeof window ? window : "undefined" != typeof global ? global : "undefined" != typeof self ? self : this).JSZip = e();
|
||
})(function() {
|
||
return function s(a, o, h) {
|
||
function u(r, e$1) {
|
||
if (!o[r]) {
|
||
if (!a[r]) {
|
||
var t = "function" == typeof __require && __require;
|
||
if (!e$1 && t) return t(r, !0);
|
||
if (l) return l(r, !0);
|
||
var n = /* @__PURE__ */ new Error("Cannot find module '" + r + "'");
|
||
throw n.code = "MODULE_NOT_FOUND", n;
|
||
}
|
||
var i = o[r] = { exports: {} };
|
||
a[r][0].call(i.exports, function(e$2) {
|
||
var t$1 = a[r][1][e$2];
|
||
return u(t$1 || e$2);
|
||
}, i, i.exports, s, a, o, h);
|
||
}
|
||
return o[r].exports;
|
||
}
|
||
for (var l = "function" == typeof __require && __require, e = 0; e < h.length; e++) u(h[e]);
|
||
return u;
|
||
}({
|
||
1: [function(e, t, r) {
|
||
var d = e("./utils"), c = e("./support"), p = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/=";
|
||
r.encode = function(e$1) {
|
||
for (var t$1, r$1, n, i, s, a, o, h = [], u = 0, l = e$1.length, f = l, c$1 = "string" !== d.getTypeOf(e$1); u < e$1.length;) f = l - u, n = c$1 ? (t$1 = e$1[u++], r$1 = u < l ? e$1[u++] : 0, u < l ? e$1[u++] : 0) : (t$1 = e$1.charCodeAt(u++), r$1 = u < l ? e$1.charCodeAt(u++) : 0, u < l ? e$1.charCodeAt(u++) : 0), i = t$1 >> 2, s = (3 & t$1) << 4 | r$1 >> 4, a = 1 < f ? (15 & r$1) << 2 | n >> 6 : 64, o = 2 < f ? 63 & n : 64, h.push(p.charAt(i) + p.charAt(s) + p.charAt(a) + p.charAt(o));
|
||
return h.join("");
|
||
}, r.decode = function(e$1) {
|
||
var t$1, r$1, n, i, s, a, o = 0, h = 0, u = "data:";
|
||
if (e$1.substr(0, u.length) === u) throw new Error("Invalid base64 input, it looks like a data url.");
|
||
var l, f = 3 * (e$1 = e$1.replace(/[^A-Za-z0-9+/=]/g, "")).length / 4;
|
||
if (e$1.charAt(e$1.length - 1) === p.charAt(64) && f--, e$1.charAt(e$1.length - 2) === p.charAt(64) && f--, f % 1 != 0) throw new Error("Invalid base64 input, bad content length.");
|
||
for (l = c.uint8array ? new Uint8Array(0 | f) : new Array(0 | f); o < e$1.length;) t$1 = p.indexOf(e$1.charAt(o++)) << 2 | (i = p.indexOf(e$1.charAt(o++))) >> 4, r$1 = (15 & i) << 4 | (s = p.indexOf(e$1.charAt(o++))) >> 2, n = (3 & s) << 6 | (a = p.indexOf(e$1.charAt(o++))), l[h++] = t$1, 64 !== s && (l[h++] = r$1), 64 !== a && (l[h++] = n);
|
||
return l;
|
||
};
|
||
}, {
|
||
"./support": 30,
|
||
"./utils": 32
|
||
}],
|
||
2: [function(e, t, r) {
|
||
var n = e("./external"), i = e("./stream/DataWorker"), s = e("./stream/Crc32Probe"), a = e("./stream/DataLengthProbe");
|
||
function o(e$1, t$1, r$1, n$1, i$1) {
|
||
this.compressedSize = e$1, this.uncompressedSize = t$1, this.crc32 = r$1, this.compression = n$1, this.compressedContent = i$1;
|
||
}
|
||
o.prototype = {
|
||
getContentWorker: function() {
|
||
var e$1 = new i(n.Promise.resolve(this.compressedContent)).pipe(this.compression.uncompressWorker()).pipe(new a("data_length")), t$1 = this;
|
||
return e$1.on("end", function() {
|
||
if (this.streamInfo.data_length !== t$1.uncompressedSize) throw new Error("Bug : uncompressed data size mismatch");
|
||
}), e$1;
|
||
},
|
||
getCompressedWorker: function() {
|
||
return new i(n.Promise.resolve(this.compressedContent)).withStreamInfo("compressedSize", this.compressedSize).withStreamInfo("uncompressedSize", this.uncompressedSize).withStreamInfo("crc32", this.crc32).withStreamInfo("compression", this.compression);
|
||
}
|
||
}, o.createWorkerFrom = function(e$1, t$1, r$1) {
|
||
return e$1.pipe(new s()).pipe(new a("uncompressedSize")).pipe(t$1.compressWorker(r$1)).pipe(new a("compressedSize")).withStreamInfo("compression", t$1);
|
||
}, t.exports = o;
|
||
}, {
|
||
"./external": 6,
|
||
"./stream/Crc32Probe": 25,
|
||
"./stream/DataLengthProbe": 26,
|
||
"./stream/DataWorker": 27
|
||
}],
|
||
3: [function(e, t, r) {
|
||
var n = e("./stream/GenericWorker");
|
||
r.STORE = {
|
||
magic: "\0\0",
|
||
compressWorker: function() {
|
||
return new n("STORE compression");
|
||
},
|
||
uncompressWorker: function() {
|
||
return new n("STORE decompression");
|
||
}
|
||
}, r.DEFLATE = e("./flate");
|
||
}, {
|
||
"./flate": 7,
|
||
"./stream/GenericWorker": 28
|
||
}],
|
||
4: [function(e, t, r) {
|
||
var n = e("./utils");
|
||
var o = function() {
|
||
for (var e$1, t$1 = [], r$1 = 0; r$1 < 256; r$1++) {
|
||
e$1 = r$1;
|
||
for (var n$1 = 0; n$1 < 8; n$1++) e$1 = 1 & e$1 ? 3988292384 ^ e$1 >>> 1 : e$1 >>> 1;
|
||
t$1[r$1] = e$1;
|
||
}
|
||
return t$1;
|
||
}();
|
||
t.exports = function(e$1, t$1) {
|
||
return void 0 !== e$1 && e$1.length ? "string" !== n.getTypeOf(e$1) ? function(e$2, t$2, r$1, n$1) {
|
||
var i = o, s = n$1 + r$1;
|
||
e$2 ^= -1;
|
||
for (var a = n$1; a < s; a++) e$2 = e$2 >>> 8 ^ i[255 & (e$2 ^ t$2[a])];
|
||
return -1 ^ e$2;
|
||
}(0 | t$1, e$1, e$1.length, 0) : function(e$2, t$2, r$1, n$1) {
|
||
var i = o, s = n$1 + r$1;
|
||
e$2 ^= -1;
|
||
for (var a = n$1; a < s; a++) e$2 = e$2 >>> 8 ^ i[255 & (e$2 ^ t$2.charCodeAt(a))];
|
||
return -1 ^ e$2;
|
||
}(0 | t$1, e$1, e$1.length, 0) : 0;
|
||
};
|
||
}, { "./utils": 32 }],
|
||
5: [function(e, t, r) {
|
||
r.base64 = !1, r.binary = !1, r.dir = !1, r.createFolders = !0, r.date = null, r.compression = null, r.compressionOptions = null, r.comment = null, r.unixPermissions = null, r.dosPermissions = null;
|
||
}, {}],
|
||
6: [function(e, t, r) {
|
||
var n = null;
|
||
n = "undefined" != typeof Promise ? Promise : e("lie"), t.exports = { Promise: n };
|
||
}, { lie: 37 }],
|
||
7: [function(e, t, r) {
|
||
var n = "undefined" != typeof Uint8Array && "undefined" != typeof Uint16Array && "undefined" != typeof Uint32Array, i = e("pako"), s = e("./utils"), a = e("./stream/GenericWorker"), o = n ? "uint8array" : "array";
|
||
function h(e$1, t$1) {
|
||
a.call(this, "FlateWorker/" + e$1), this._pako = null, this._pakoAction = e$1, this._pakoOptions = t$1, this.meta = {};
|
||
}
|
||
r.magic = "\b\0", s.inherits(h, a), h.prototype.processChunk = function(e$1) {
|
||
this.meta = e$1.meta, null === this._pako && this._createPako(), this._pako.push(s.transformTo(o, e$1.data), !1);
|
||
}, h.prototype.flush = function() {
|
||
a.prototype.flush.call(this), null === this._pako && this._createPako(), this._pako.push([], !0);
|
||
}, h.prototype.cleanUp = function() {
|
||
a.prototype.cleanUp.call(this), this._pako = null;
|
||
}, h.prototype._createPako = function() {
|
||
this._pako = new i[this._pakoAction]({
|
||
raw: !0,
|
||
level: this._pakoOptions.level || -1
|
||
});
|
||
var t$1 = this;
|
||
this._pako.onData = function(e$1) {
|
||
t$1.push({
|
||
data: e$1,
|
||
meta: t$1.meta
|
||
});
|
||
};
|
||
}, r.compressWorker = function(e$1) {
|
||
return new h("Deflate", e$1);
|
||
}, r.uncompressWorker = function() {
|
||
return new h("Inflate", {});
|
||
};
|
||
}, {
|
||
"./stream/GenericWorker": 28,
|
||
"./utils": 32,
|
||
pako: 38
|
||
}],
|
||
8: [function(e, t, r) {
|
||
function A(e$1, t$1) {
|
||
var r$1, n$1 = "";
|
||
for (r$1 = 0; r$1 < t$1; r$1++) n$1 += String.fromCharCode(255 & e$1), e$1 >>>= 8;
|
||
return n$1;
|
||
}
|
||
function n(e$1, t$1, r$1, n$1, i$1, s$1) {
|
||
var a, o, h = e$1.file, u = e$1.compression, l = s$1 !== O.utf8encode, f = I.transformTo("string", s$1(h.name)), c = I.transformTo("string", O.utf8encode(h.name)), d = h.comment, p = I.transformTo("string", s$1(d)), m = I.transformTo("string", O.utf8encode(d)), _ = c.length !== h.name.length, g = m.length !== d.length, b = "", v = "", y = "", w = h.dir, k = h.date, x = {
|
||
crc32: 0,
|
||
compressedSize: 0,
|
||
uncompressedSize: 0
|
||
};
|
||
t$1 && !r$1 || (x.crc32 = e$1.crc32, x.compressedSize = e$1.compressedSize, x.uncompressedSize = e$1.uncompressedSize);
|
||
var S = 0;
|
||
t$1 && (S |= 8), l || !_ && !g || (S |= 2048);
|
||
var z = 0, C = 0;
|
||
w && (z |= 16), "UNIX" === i$1 ? (C = 798, z |= function(e$2, t$2) {
|
||
var r$2 = e$2;
|
||
return e$2 || (r$2 = t$2 ? 16893 : 33204), (65535 & r$2) << 16;
|
||
}(h.unixPermissions, w)) : (C = 20, z |= function(e$2) {
|
||
return 63 & (e$2 || 0);
|
||
}(h.dosPermissions)), a = k.getUTCHours(), a <<= 6, a |= k.getUTCMinutes(), a <<= 5, a |= k.getUTCSeconds() / 2, o = k.getUTCFullYear() - 1980, o <<= 4, o |= k.getUTCMonth() + 1, o <<= 5, o |= k.getUTCDate(), _ && (v = A(1, 1) + A(B(f), 4) + c, b += "up" + A(v.length, 2) + v), g && (y = A(1, 1) + A(B(p), 4) + m, b += "uc" + A(y.length, 2) + y);
|
||
var E = "";
|
||
return E += "\n\0", E += A(S, 2), E += u.magic, E += A(a, 2), E += A(o, 2), E += A(x.crc32, 4), E += A(x.compressedSize, 4), E += A(x.uncompressedSize, 4), E += A(f.length, 2), E += A(b.length, 2), {
|
||
fileRecord: R.LOCAL_FILE_HEADER + E + f + b,
|
||
dirRecord: R.CENTRAL_FILE_HEADER + A(C, 2) + E + A(p.length, 2) + "\0\0\0\0" + A(z, 4) + A(n$1, 4) + f + b + p
|
||
};
|
||
}
|
||
var I = e("../utils"), i = e("../stream/GenericWorker"), O = e("../utf8"), B = e("../crc32"), R = e("../signature");
|
||
function s(e$1, t$1, r$1, n$1) {
|
||
i.call(this, "ZipFileWorker"), this.bytesWritten = 0, this.zipComment = t$1, this.zipPlatform = r$1, this.encodeFileName = n$1, this.streamFiles = e$1, this.accumulate = !1, this.contentBuffer = [], this.dirRecords = [], this.currentSourceOffset = 0, this.entriesCount = 0, this.currentFile = null, this._sources = [];
|
||
}
|
||
I.inherits(s, i), s.prototype.push = function(e$1) {
|
||
var t$1 = e$1.meta.percent || 0, r$1 = this.entriesCount, n$1 = this._sources.length;
|
||
this.accumulate ? this.contentBuffer.push(e$1) : (this.bytesWritten += e$1.data.length, i.prototype.push.call(this, {
|
||
data: e$1.data,
|
||
meta: {
|
||
currentFile: this.currentFile,
|
||
percent: r$1 ? (t$1 + 100 * (r$1 - n$1 - 1)) / r$1 : 100
|
||
}
|
||
}));
|
||
}, s.prototype.openedSource = function(e$1) {
|
||
this.currentSourceOffset = this.bytesWritten, this.currentFile = e$1.file.name;
|
||
var t$1 = this.streamFiles && !e$1.file.dir;
|
||
if (t$1) {
|
||
var r$1 = n(e$1, t$1, !1, this.currentSourceOffset, this.zipPlatform, this.encodeFileName);
|
||
this.push({
|
||
data: r$1.fileRecord,
|
||
meta: { percent: 0 }
|
||
});
|
||
} else this.accumulate = !0;
|
||
}, s.prototype.closedSource = function(e$1) {
|
||
this.accumulate = !1;
|
||
var t$1 = this.streamFiles && !e$1.file.dir, r$1 = n(e$1, t$1, !0, this.currentSourceOffset, this.zipPlatform, this.encodeFileName);
|
||
if (this.dirRecords.push(r$1.dirRecord), t$1) this.push({
|
||
data: function(e$2) {
|
||
return R.DATA_DESCRIPTOR + A(e$2.crc32, 4) + A(e$2.compressedSize, 4) + A(e$2.uncompressedSize, 4);
|
||
}(e$1),
|
||
meta: { percent: 100 }
|
||
});
|
||
else for (this.push({
|
||
data: r$1.fileRecord,
|
||
meta: { percent: 0 }
|
||
}); this.contentBuffer.length;) this.push(this.contentBuffer.shift());
|
||
this.currentFile = null;
|
||
}, s.prototype.flush = function() {
|
||
for (var e$1 = this.bytesWritten, t$1 = 0; t$1 < this.dirRecords.length; t$1++) this.push({
|
||
data: this.dirRecords[t$1],
|
||
meta: { percent: 100 }
|
||
});
|
||
var r$1 = this.bytesWritten - e$1, n$1 = function(e$2, t$2, r$2, n$2, i$1) {
|
||
var s$1 = I.transformTo("string", i$1(n$2));
|
||
return R.CENTRAL_DIRECTORY_END + "\0\0\0\0" + A(e$2, 2) + A(e$2, 2) + A(t$2, 4) + A(r$2, 4) + A(s$1.length, 2) + s$1;
|
||
}(this.dirRecords.length, r$1, e$1, this.zipComment, this.encodeFileName);
|
||
this.push({
|
||
data: n$1,
|
||
meta: { percent: 100 }
|
||
});
|
||
}, s.prototype.prepareNextSource = function() {
|
||
this.previous = this._sources.shift(), this.openedSource(this.previous.streamInfo), this.isPaused ? this.previous.pause() : this.previous.resume();
|
||
}, s.prototype.registerPrevious = function(e$1) {
|
||
this._sources.push(e$1);
|
||
var t$1 = this;
|
||
return e$1.on("data", function(e$2) {
|
||
t$1.processChunk(e$2);
|
||
}), e$1.on("end", function() {
|
||
t$1.closedSource(t$1.previous.streamInfo), t$1._sources.length ? t$1.prepareNextSource() : t$1.end();
|
||
}), e$1.on("error", function(e$2) {
|
||
t$1.error(e$2);
|
||
}), this;
|
||
}, s.prototype.resume = function() {
|
||
return !!i.prototype.resume.call(this) && (!this.previous && this._sources.length ? (this.prepareNextSource(), !0) : this.previous || this._sources.length || this.generatedError ? void 0 : (this.end(), !0));
|
||
}, s.prototype.error = function(e$1) {
|
||
var t$1 = this._sources;
|
||
if (!i.prototype.error.call(this, e$1)) return !1;
|
||
for (var r$1 = 0; r$1 < t$1.length; r$1++) try {
|
||
t$1[r$1].error(e$1);
|
||
} catch (e$2) {}
|
||
return !0;
|
||
}, s.prototype.lock = function() {
|
||
i.prototype.lock.call(this);
|
||
for (var e$1 = this._sources, t$1 = 0; t$1 < e$1.length; t$1++) e$1[t$1].lock();
|
||
}, t.exports = s;
|
||
}, {
|
||
"../crc32": 4,
|
||
"../signature": 23,
|
||
"../stream/GenericWorker": 28,
|
||
"../utf8": 31,
|
||
"../utils": 32
|
||
}],
|
||
9: [function(e, t, r) {
|
||
var u = e("../compressions"), n = e("./ZipFileWorker");
|
||
r.generateWorker = function(e$1, a, t$1) {
|
||
var o = new n(a.streamFiles, t$1, a.platform, a.encodeFileName), h = 0;
|
||
try {
|
||
e$1.forEach(function(e$2, t$2) {
|
||
h++;
|
||
var r$1 = function(e$3, t$3) {
|
||
var r$2 = e$3 || t$3, n$2 = u[r$2];
|
||
if (!n$2) throw new Error(r$2 + " is not a valid compression method !");
|
||
return n$2;
|
||
}(t$2.options.compression, a.compression), n$1 = t$2.options.compressionOptions || a.compressionOptions || {}, i = t$2.dir, s = t$2.date;
|
||
t$2._compressWorker(r$1, n$1).withStreamInfo("file", {
|
||
name: e$2,
|
||
dir: i,
|
||
date: s,
|
||
comment: t$2.comment || "",
|
||
unixPermissions: t$2.unixPermissions,
|
||
dosPermissions: t$2.dosPermissions
|
||
}).pipe(o);
|
||
}), o.entriesCount = h;
|
||
} catch (e$2) {
|
||
o.error(e$2);
|
||
}
|
||
return o;
|
||
};
|
||
}, {
|
||
"../compressions": 3,
|
||
"./ZipFileWorker": 8
|
||
}],
|
||
10: [function(e, t, r) {
|
||
function n() {
|
||
if (!(this instanceof n)) return new n();
|
||
if (arguments.length) throw new Error("The constructor with parameters has been removed in JSZip 3.0, please check the upgrade guide.");
|
||
this.files = Object.create(null), this.comment = null, this.root = "", this.clone = function() {
|
||
var e$1 = new n();
|
||
for (var t$1 in this) "function" != typeof this[t$1] && (e$1[t$1] = this[t$1]);
|
||
return e$1;
|
||
};
|
||
}
|
||
(n.prototype = e("./object")).loadAsync = e("./load"), n.support = e("./support"), n.defaults = e("./defaults"), n.version = "3.10.1", n.loadAsync = function(e$1, t$1) {
|
||
return new n().loadAsync(e$1, t$1);
|
||
}, n.external = e("./external"), t.exports = n;
|
||
}, {
|
||
"./defaults": 5,
|
||
"./external": 6,
|
||
"./load": 11,
|
||
"./object": 15,
|
||
"./support": 30
|
||
}],
|
||
11: [function(e, t, r) {
|
||
var u = e("./utils"), i = e("./external"), n = e("./utf8"), s = e("./zipEntries"), a = e("./stream/Crc32Probe"), l = e("./nodejsUtils");
|
||
function f(n$1) {
|
||
return new i.Promise(function(e$1, t$1) {
|
||
var r$1 = n$1.decompressed.getContentWorker().pipe(new a());
|
||
r$1.on("error", function(e$2) {
|
||
t$1(e$2);
|
||
}).on("end", function() {
|
||
r$1.streamInfo.crc32 !== n$1.decompressed.crc32 ? t$1(/* @__PURE__ */ new Error("Corrupted zip : CRC32 mismatch")) : e$1();
|
||
}).resume();
|
||
});
|
||
}
|
||
t.exports = function(e$1, o) {
|
||
var h = this;
|
||
return o = u.extend(o || {}, {
|
||
base64: !1,
|
||
checkCRC32: !1,
|
||
optimizedBinaryString: !1,
|
||
createFolders: !1,
|
||
decodeFileName: n.utf8decode
|
||
}), l.isNode && l.isStream(e$1) ? i.Promise.reject(/* @__PURE__ */ new Error("JSZip can't accept a stream when loading a zip file.")) : u.prepareContent("the loaded zip file", e$1, !0, o.optimizedBinaryString, o.base64).then(function(e$2) {
|
||
var t$1 = new s(o);
|
||
return t$1.load(e$2), t$1;
|
||
}).then(function(e$2) {
|
||
var t$1 = [i.Promise.resolve(e$2)], r$1 = e$2.files;
|
||
if (o.checkCRC32) for (var n$1 = 0; n$1 < r$1.length; n$1++) t$1.push(f(r$1[n$1]));
|
||
return i.Promise.all(t$1);
|
||
}).then(function(e$2) {
|
||
for (var t$1 = e$2.shift(), r$1 = t$1.files, n$1 = 0; n$1 < r$1.length; n$1++) {
|
||
var i$1 = r$1[n$1], s$1 = i$1.fileNameStr, a$1 = u.resolve(i$1.fileNameStr);
|
||
h.file(a$1, i$1.decompressed, {
|
||
binary: !0,
|
||
optimizedBinaryString: !0,
|
||
date: i$1.date,
|
||
dir: i$1.dir,
|
||
comment: i$1.fileCommentStr.length ? i$1.fileCommentStr : null,
|
||
unixPermissions: i$1.unixPermissions,
|
||
dosPermissions: i$1.dosPermissions,
|
||
createFolders: o.createFolders
|
||
}), i$1.dir || (h.file(a$1).unsafeOriginalName = s$1);
|
||
}
|
||
return t$1.zipComment.length && (h.comment = t$1.zipComment), h;
|
||
});
|
||
};
|
||
}, {
|
||
"./external": 6,
|
||
"./nodejsUtils": 14,
|
||
"./stream/Crc32Probe": 25,
|
||
"./utf8": 31,
|
||
"./utils": 32,
|
||
"./zipEntries": 33
|
||
}],
|
||
12: [function(e, t, r) {
|
||
var n = e("../utils"), i = e("../stream/GenericWorker");
|
||
function s(e$1, t$1) {
|
||
i.call(this, "Nodejs stream input adapter for " + e$1), this._upstreamEnded = !1, this._bindStream(t$1);
|
||
}
|
||
n.inherits(s, i), s.prototype._bindStream = function(e$1) {
|
||
var t$1 = this;
|
||
(this._stream = e$1).pause(), e$1.on("data", function(e$2) {
|
||
t$1.push({
|
||
data: e$2,
|
||
meta: { percent: 0 }
|
||
});
|
||
}).on("error", function(e$2) {
|
||
t$1.isPaused ? this.generatedError = e$2 : t$1.error(e$2);
|
||
}).on("end", function() {
|
||
t$1.isPaused ? t$1._upstreamEnded = !0 : t$1.end();
|
||
});
|
||
}, s.prototype.pause = function() {
|
||
return !!i.prototype.pause.call(this) && (this._stream.pause(), !0);
|
||
}, s.prototype.resume = function() {
|
||
return !!i.prototype.resume.call(this) && (this._upstreamEnded ? this.end() : this._stream.resume(), !0);
|
||
}, t.exports = s;
|
||
}, {
|
||
"../stream/GenericWorker": 28,
|
||
"../utils": 32
|
||
}],
|
||
13: [function(e, t, r) {
|
||
var i = e("readable-stream").Readable;
|
||
function n(e$1, t$1, r$1) {
|
||
i.call(this, t$1), this._helper = e$1;
|
||
var n$1 = this;
|
||
e$1.on("data", function(e$2, t$2) {
|
||
n$1.push(e$2) || n$1._helper.pause(), r$1 && r$1(t$2);
|
||
}).on("error", function(e$2) {
|
||
n$1.emit("error", e$2);
|
||
}).on("end", function() {
|
||
n$1.push(null);
|
||
});
|
||
}
|
||
e("../utils").inherits(n, i), n.prototype._read = function() {
|
||
this._helper.resume();
|
||
}, t.exports = n;
|
||
}, {
|
||
"../utils": 32,
|
||
"readable-stream": 16
|
||
}],
|
||
14: [function(e, t, r) {
|
||
t.exports = {
|
||
isNode: "undefined" != typeof Buffer,
|
||
newBufferFrom: function(e$1, t$1) {
|
||
if (Buffer.from && Buffer.from !== Uint8Array.from) return Buffer.from(e$1, t$1);
|
||
if ("number" == typeof e$1) throw new Error("The \"data\" argument must not be a number");
|
||
return new Buffer(e$1, t$1);
|
||
},
|
||
allocBuffer: function(e$1) {
|
||
if (Buffer.alloc) return Buffer.alloc(e$1);
|
||
var t$1 = new Buffer(e$1);
|
||
return t$1.fill(0), t$1;
|
||
},
|
||
isBuffer: function(e$1) {
|
||
return Buffer.isBuffer(e$1);
|
||
},
|
||
isStream: function(e$1) {
|
||
return e$1 && "function" == typeof e$1.on && "function" == typeof e$1.pause && "function" == typeof e$1.resume;
|
||
}
|
||
};
|
||
}, {}],
|
||
15: [function(e, t, r) {
|
||
function s(e$1, t$1, r$1) {
|
||
var n, i$1 = u.getTypeOf(t$1), s$1 = u.extend(r$1 || {}, f);
|
||
s$1.date = s$1.date || /* @__PURE__ */ new Date(), null !== s$1.compression && (s$1.compression = s$1.compression.toUpperCase()), "string" == typeof s$1.unixPermissions && (s$1.unixPermissions = parseInt(s$1.unixPermissions, 8)), s$1.unixPermissions && 16384 & s$1.unixPermissions && (s$1.dir = !0), s$1.dosPermissions && 16 & s$1.dosPermissions && (s$1.dir = !0), s$1.dir && (e$1 = g(e$1)), s$1.createFolders && (n = _(e$1)) && b.call(this, n, !0);
|
||
var a$1 = "string" === i$1 && !1 === s$1.binary && !1 === s$1.base64;
|
||
r$1 && void 0 !== r$1.binary || (s$1.binary = !a$1), (t$1 instanceof c && 0 === t$1.uncompressedSize || s$1.dir || !t$1 || 0 === t$1.length) && (s$1.base64 = !1, s$1.binary = !0, t$1 = "", s$1.compression = "STORE", i$1 = "string");
|
||
var o$1 = null;
|
||
o$1 = t$1 instanceof c || t$1 instanceof l ? t$1 : p.isNode && p.isStream(t$1) ? new m(e$1, t$1) : u.prepareContent(e$1, t$1, s$1.binary, s$1.optimizedBinaryString, s$1.base64);
|
||
var h$1 = new d(e$1, o$1, s$1);
|
||
this.files[e$1] = h$1;
|
||
}
|
||
var i = e("./utf8"), u = e("./utils"), l = e("./stream/GenericWorker"), a = e("./stream/StreamHelper"), f = e("./defaults"), c = e("./compressedObject"), d = e("./zipObject"), o = e("./generate"), p = e("./nodejsUtils"), m = e("./nodejs/NodejsStreamInputAdapter"), _ = function(e$1) {
|
||
"/" === e$1.slice(-1) && (e$1 = e$1.substring(0, e$1.length - 1));
|
||
var t$1 = e$1.lastIndexOf("/");
|
||
return 0 < t$1 ? e$1.substring(0, t$1) : "";
|
||
}, g = function(e$1) {
|
||
return "/" !== e$1.slice(-1) && (e$1 += "/"), e$1;
|
||
}, b = function(e$1, t$1) {
|
||
return t$1 = void 0 !== t$1 ? t$1 : f.createFolders, e$1 = g(e$1), this.files[e$1] || s.call(this, e$1, null, {
|
||
dir: !0,
|
||
createFolders: t$1
|
||
}), this.files[e$1];
|
||
};
|
||
function h(e$1) {
|
||
return "[object RegExp]" === Object.prototype.toString.call(e$1);
|
||
}
|
||
t.exports = {
|
||
load: function() {
|
||
throw new Error("This method has been removed in JSZip 3.0, please check the upgrade guide.");
|
||
},
|
||
forEach: function(e$1) {
|
||
var t$1, r$1, n;
|
||
for (t$1 in this.files) n = this.files[t$1], (r$1 = t$1.slice(this.root.length, t$1.length)) && t$1.slice(0, this.root.length) === this.root && e$1(r$1, n);
|
||
},
|
||
filter: function(r$1) {
|
||
var n = [];
|
||
return this.forEach(function(e$1, t$1) {
|
||
r$1(e$1, t$1) && n.push(t$1);
|
||
}), n;
|
||
},
|
||
file: function(e$1, t$1, r$1) {
|
||
if (1 !== arguments.length) return e$1 = this.root + e$1, s.call(this, e$1, t$1, r$1), this;
|
||
if (h(e$1)) {
|
||
var n = e$1;
|
||
return this.filter(function(e$2, t$2) {
|
||
return !t$2.dir && n.test(e$2);
|
||
});
|
||
}
|
||
var i$1 = this.files[this.root + e$1];
|
||
return i$1 && !i$1.dir ? i$1 : null;
|
||
},
|
||
folder: function(r$1) {
|
||
if (!r$1) return this;
|
||
if (h(r$1)) return this.filter(function(e$2, t$2) {
|
||
return t$2.dir && r$1.test(e$2);
|
||
});
|
||
var e$1 = this.root + r$1, t$1 = b.call(this, e$1), n = this.clone();
|
||
return n.root = t$1.name, n;
|
||
},
|
||
remove: function(r$1) {
|
||
r$1 = this.root + r$1;
|
||
var e$1 = this.files[r$1];
|
||
if (e$1 || ("/" !== r$1.slice(-1) && (r$1 += "/"), e$1 = this.files[r$1]), e$1 && !e$1.dir) delete this.files[r$1];
|
||
else for (var t$1 = this.filter(function(e$2, t$2) {
|
||
return t$2.name.slice(0, r$1.length) === r$1;
|
||
}), n = 0; n < t$1.length; n++) delete this.files[t$1[n].name];
|
||
return this;
|
||
},
|
||
generate: function() {
|
||
throw new Error("This method has been removed in JSZip 3.0, please check the upgrade guide.");
|
||
},
|
||
generateInternalStream: function(e$1) {
|
||
var t$1, r$1 = {};
|
||
try {
|
||
if ((r$1 = u.extend(e$1 || {}, {
|
||
streamFiles: !1,
|
||
compression: "STORE",
|
||
compressionOptions: null,
|
||
type: "",
|
||
platform: "DOS",
|
||
comment: null,
|
||
mimeType: "application/zip",
|
||
encodeFileName: i.utf8encode
|
||
})).type = r$1.type.toLowerCase(), r$1.compression = r$1.compression.toUpperCase(), "binarystring" === r$1.type && (r$1.type = "string"), !r$1.type) throw new Error("No output type specified.");
|
||
u.checkSupport(r$1.type), "darwin" !== r$1.platform && "freebsd" !== r$1.platform && "linux" !== r$1.platform && "sunos" !== r$1.platform || (r$1.platform = "UNIX"), "win32" === r$1.platform && (r$1.platform = "DOS");
|
||
var n = r$1.comment || this.comment || "";
|
||
t$1 = o.generateWorker(this, r$1, n);
|
||
} catch (e$2) {
|
||
(t$1 = new l("error")).error(e$2);
|
||
}
|
||
return new a(t$1, r$1.type || "string", r$1.mimeType);
|
||
},
|
||
generateAsync: function(e$1, t$1) {
|
||
return this.generateInternalStream(e$1).accumulate(t$1);
|
||
},
|
||
generateNodeStream: function(e$1, t$1) {
|
||
return (e$1 = e$1 || {}).type || (e$1.type = "nodebuffer"), this.generateInternalStream(e$1).toNodejsStream(t$1);
|
||
}
|
||
};
|
||
}, {
|
||
"./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(e, t, r) {
|
||
t.exports = e("stream");
|
||
}, { stream: void 0 }],
|
||
17: [function(e, t, r) {
|
||
var n = e("./DataReader");
|
||
function i(e$1) {
|
||
n.call(this, e$1);
|
||
for (var t$1 = 0; t$1 < this.data.length; t$1++) e$1[t$1] = 255 & e$1[t$1];
|
||
}
|
||
e("../utils").inherits(i, n), i.prototype.byteAt = function(e$1) {
|
||
return this.data[this.zero + e$1];
|
||
}, i.prototype.lastIndexOfSignature = function(e$1) {
|
||
for (var t$1 = e$1.charCodeAt(0), r$1 = e$1.charCodeAt(1), n$1 = e$1.charCodeAt(2), i$1 = e$1.charCodeAt(3), s = this.length - 4; 0 <= s; --s) if (this.data[s] === t$1 && this.data[s + 1] === r$1 && this.data[s + 2] === n$1 && this.data[s + 3] === i$1) return s - this.zero;
|
||
return -1;
|
||
}, i.prototype.readAndCheckSignature = function(e$1) {
|
||
var t$1 = e$1.charCodeAt(0), r$1 = e$1.charCodeAt(1), n$1 = e$1.charCodeAt(2), i$1 = e$1.charCodeAt(3), s = this.readData(4);
|
||
return t$1 === s[0] && r$1 === s[1] && n$1 === s[2] && i$1 === s[3];
|
||
}, i.prototype.readData = function(e$1) {
|
||
if (this.checkOffset(e$1), 0 === e$1) return [];
|
||
var t$1 = this.data.slice(this.zero + this.index, this.zero + this.index + e$1);
|
||
return this.index += e$1, t$1;
|
||
}, t.exports = i;
|
||
}, {
|
||
"../utils": 32,
|
||
"./DataReader": 18
|
||
}],
|
||
18: [function(e, t, r) {
|
||
var n = e("../utils");
|
||
function i(e$1) {
|
||
this.data = e$1, this.length = e$1.length, this.index = 0, this.zero = 0;
|
||
}
|
||
i.prototype = {
|
||
checkOffset: function(e$1) {
|
||
this.checkIndex(this.index + e$1);
|
||
},
|
||
checkIndex: function(e$1) {
|
||
if (this.length < this.zero + e$1 || e$1 < 0) throw new Error("End of data reached (data length = " + this.length + ", asked index = " + e$1 + "). Corrupted zip ?");
|
||
},
|
||
setIndex: function(e$1) {
|
||
this.checkIndex(e$1), this.index = e$1;
|
||
},
|
||
skip: function(e$1) {
|
||
this.setIndex(this.index + e$1);
|
||
},
|
||
byteAt: function() {},
|
||
readInt: function(e$1) {
|
||
var t$1, r$1 = 0;
|
||
for (this.checkOffset(e$1), t$1 = this.index + e$1 - 1; t$1 >= this.index; t$1--) r$1 = (r$1 << 8) + this.byteAt(t$1);
|
||
return this.index += e$1, r$1;
|
||
},
|
||
readString: function(e$1) {
|
||
return n.transformTo("string", this.readData(e$1));
|
||
},
|
||
readData: function() {},
|
||
lastIndexOfSignature: function() {},
|
||
readAndCheckSignature: function() {},
|
||
readDate: function() {
|
||
var e$1 = this.readInt(4);
|
||
return new Date(Date.UTC(1980 + (e$1 >> 25 & 127), (e$1 >> 21 & 15) - 1, e$1 >> 16 & 31, e$1 >> 11 & 31, e$1 >> 5 & 63, (31 & e$1) << 1));
|
||
}
|
||
}, t.exports = i;
|
||
}, { "../utils": 32 }],
|
||
19: [function(e, t, r) {
|
||
var n = e("./Uint8ArrayReader");
|
||
function i(e$1) {
|
||
n.call(this, e$1);
|
||
}
|
||
e("../utils").inherits(i, n), i.prototype.readData = function(e$1) {
|
||
this.checkOffset(e$1);
|
||
var t$1 = this.data.slice(this.zero + this.index, this.zero + this.index + e$1);
|
||
return this.index += e$1, t$1;
|
||
}, t.exports = i;
|
||
}, {
|
||
"../utils": 32,
|
||
"./Uint8ArrayReader": 21
|
||
}],
|
||
20: [function(e, t, r) {
|
||
var n = e("./DataReader");
|
||
function i(e$1) {
|
||
n.call(this, e$1);
|
||
}
|
||
e("../utils").inherits(i, n), i.prototype.byteAt = function(e$1) {
|
||
return this.data.charCodeAt(this.zero + e$1);
|
||
}, i.prototype.lastIndexOfSignature = function(e$1) {
|
||
return this.data.lastIndexOf(e$1) - this.zero;
|
||
}, i.prototype.readAndCheckSignature = function(e$1) {
|
||
return e$1 === this.readData(4);
|
||
}, i.prototype.readData = function(e$1) {
|
||
this.checkOffset(e$1);
|
||
var t$1 = this.data.slice(this.zero + this.index, this.zero + this.index + e$1);
|
||
return this.index += e$1, t$1;
|
||
}, t.exports = i;
|
||
}, {
|
||
"../utils": 32,
|
||
"./DataReader": 18
|
||
}],
|
||
21: [function(e, t, r) {
|
||
var n = e("./ArrayReader");
|
||
function i(e$1) {
|
||
n.call(this, e$1);
|
||
}
|
||
e("../utils").inherits(i, n), i.prototype.readData = function(e$1) {
|
||
if (this.checkOffset(e$1), 0 === e$1) return new Uint8Array(0);
|
||
var t$1 = this.data.subarray(this.zero + this.index, this.zero + this.index + e$1);
|
||
return this.index += e$1, t$1;
|
||
}, t.exports = i;
|
||
}, {
|
||
"../utils": 32,
|
||
"./ArrayReader": 17
|
||
}],
|
||
22: [function(e, t, r) {
|
||
var n = e("../utils"), i = e("../support"), s = e("./ArrayReader"), a = e("./StringReader"), o = e("./NodeBufferReader"), h = e("./Uint8ArrayReader");
|
||
t.exports = function(e$1) {
|
||
var t$1 = n.getTypeOf(e$1);
|
||
return n.checkSupport(t$1), "string" !== t$1 || i.uint8array ? "nodebuffer" === t$1 ? new o(e$1) : i.uint8array ? new h(n.transformTo("uint8array", e$1)) : new s(n.transformTo("array", e$1)) : new a(e$1);
|
||
};
|
||
}, {
|
||
"../support": 30,
|
||
"../utils": 32,
|
||
"./ArrayReader": 17,
|
||
"./NodeBufferReader": 19,
|
||
"./StringReader": 20,
|
||
"./Uint8ArrayReader": 21
|
||
}],
|
||
23: [function(e, t, r) {
|
||
r.LOCAL_FILE_HEADER = "PK", r.CENTRAL_FILE_HEADER = "PK", r.CENTRAL_DIRECTORY_END = "PK", r.ZIP64_CENTRAL_DIRECTORY_LOCATOR = "PK\x07", r.ZIP64_CENTRAL_DIRECTORY_END = "PK", r.DATA_DESCRIPTOR = "PK\x07\b";
|
||
}, {}],
|
||
24: [function(e, t, r) {
|
||
var n = e("./GenericWorker"), i = e("../utils");
|
||
function s(e$1) {
|
||
n.call(this, "ConvertWorker to " + e$1), this.destType = e$1;
|
||
}
|
||
i.inherits(s, n), s.prototype.processChunk = function(e$1) {
|
||
this.push({
|
||
data: i.transformTo(this.destType, e$1.data),
|
||
meta: e$1.meta
|
||
});
|
||
}, t.exports = s;
|
||
}, {
|
||
"../utils": 32,
|
||
"./GenericWorker": 28
|
||
}],
|
||
25: [function(e, t, r) {
|
||
var n = e("./GenericWorker"), i = e("../crc32");
|
||
function s() {
|
||
n.call(this, "Crc32Probe"), this.withStreamInfo("crc32", 0);
|
||
}
|
||
e("../utils").inherits(s, n), s.prototype.processChunk = function(e$1) {
|
||
this.streamInfo.crc32 = i(e$1.data, this.streamInfo.crc32 || 0), this.push(e$1);
|
||
}, t.exports = s;
|
||
}, {
|
||
"../crc32": 4,
|
||
"../utils": 32,
|
||
"./GenericWorker": 28
|
||
}],
|
||
26: [function(e, t, r) {
|
||
var n = e("../utils"), i = e("./GenericWorker");
|
||
function s(e$1) {
|
||
i.call(this, "DataLengthProbe for " + e$1), this.propName = e$1, this.withStreamInfo(e$1, 0);
|
||
}
|
||
n.inherits(s, i), s.prototype.processChunk = function(e$1) {
|
||
if (e$1) {
|
||
var t$1 = this.streamInfo[this.propName] || 0;
|
||
this.streamInfo[this.propName] = t$1 + e$1.data.length;
|
||
}
|
||
i.prototype.processChunk.call(this, e$1);
|
||
}, t.exports = s;
|
||
}, {
|
||
"../utils": 32,
|
||
"./GenericWorker": 28
|
||
}],
|
||
27: [function(e, t, r) {
|
||
var n = e("../utils"), i = e("./GenericWorker");
|
||
function s(e$1) {
|
||
i.call(this, "DataWorker");
|
||
var t$1 = this;
|
||
this.dataIsReady = !1, this.index = 0, this.max = 0, this.data = null, this.type = "", this._tickScheduled = !1, e$1.then(function(e$2) {
|
||
t$1.dataIsReady = !0, t$1.data = e$2, t$1.max = e$2 && e$2.length || 0, t$1.type = n.getTypeOf(e$2), t$1.isPaused || t$1._tickAndRepeat();
|
||
}, function(e$2) {
|
||
t$1.error(e$2);
|
||
});
|
||
}
|
||
n.inherits(s, i), s.prototype.cleanUp = function() {
|
||
i.prototype.cleanUp.call(this), this.data = null;
|
||
}, s.prototype.resume = function() {
|
||
return !!i.prototype.resume.call(this) && (!this._tickScheduled && this.dataIsReady && (this._tickScheduled = !0, n.delay(this._tickAndRepeat, [], this)), !0);
|
||
}, s.prototype._tickAndRepeat = function() {
|
||
this._tickScheduled = !1, this.isPaused || this.isFinished || (this._tick(), this.isFinished || (n.delay(this._tickAndRepeat, [], this), this._tickScheduled = !0));
|
||
}, s.prototype._tick = function() {
|
||
if (this.isPaused || this.isFinished) return !1;
|
||
var e$1 = null, t$1 = Math.min(this.max, this.index + 16384);
|
||
if (this.index >= this.max) return this.end();
|
||
switch (this.type) {
|
||
case "string":
|
||
e$1 = this.data.substring(this.index, t$1);
|
||
break;
|
||
case "uint8array":
|
||
e$1 = this.data.subarray(this.index, t$1);
|
||
break;
|
||
case "array":
|
||
case "nodebuffer": e$1 = this.data.slice(this.index, t$1);
|
||
}
|
||
return this.index = t$1, this.push({
|
||
data: e$1,
|
||
meta: { percent: this.max ? this.index / this.max * 100 : 0 }
|
||
});
|
||
}, t.exports = s;
|
||
}, {
|
||
"../utils": 32,
|
||
"./GenericWorker": 28
|
||
}],
|
||
28: [function(e, t, r) {
|
||
function n(e$1) {
|
||
this.name = e$1 || "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;
|
||
}
|
||
n.prototype = {
|
||
push: function(e$1) {
|
||
this.emit("data", e$1);
|
||
},
|
||
end: function() {
|
||
if (this.isFinished) return !1;
|
||
this.flush();
|
||
try {
|
||
this.emit("end"), this.cleanUp(), this.isFinished = !0;
|
||
} catch (e$1) {
|
||
this.emit("error", e$1);
|
||
}
|
||
return !0;
|
||
},
|
||
error: function(e$1) {
|
||
return !this.isFinished && (this.isPaused ? this.generatedError = e$1 : (this.isFinished = !0, this.emit("error", e$1), this.previous && this.previous.error(e$1), this.cleanUp()), !0);
|
||
},
|
||
on: function(e$1, t$1) {
|
||
return this._listeners[e$1].push(t$1), this;
|
||
},
|
||
cleanUp: function() {
|
||
this.streamInfo = this.generatedError = this.extraStreamInfo = null, this._listeners = [];
|
||
},
|
||
emit: function(e$1, t$1) {
|
||
if (this._listeners[e$1]) for (var r$1 = 0; r$1 < this._listeners[e$1].length; r$1++) this._listeners[e$1][r$1].call(this, t$1);
|
||
},
|
||
pipe: function(e$1) {
|
||
return e$1.registerPrevious(this);
|
||
},
|
||
registerPrevious: function(e$1) {
|
||
if (this.isLocked) throw new Error("The stream '" + this + "' has already been used.");
|
||
this.streamInfo = e$1.streamInfo, this.mergeStreamInfo(), this.previous = e$1;
|
||
var t$1 = this;
|
||
return e$1.on("data", function(e$2) {
|
||
t$1.processChunk(e$2);
|
||
}), e$1.on("end", function() {
|
||
t$1.end();
|
||
}), e$1.on("error", function(e$2) {
|
||
t$1.error(e$2);
|
||
}), this;
|
||
},
|
||
pause: function() {
|
||
return !this.isPaused && !this.isFinished && (this.isPaused = !0, this.previous && this.previous.pause(), !0);
|
||
},
|
||
resume: function() {
|
||
if (!this.isPaused || this.isFinished) return !1;
|
||
var e$1 = this.isPaused = !1;
|
||
return this.generatedError && (this.error(this.generatedError), e$1 = !0), this.previous && this.previous.resume(), !e$1;
|
||
},
|
||
flush: function() {},
|
||
processChunk: function(e$1) {
|
||
this.push(e$1);
|
||
},
|
||
withStreamInfo: function(e$1, t$1) {
|
||
return this.extraStreamInfo[e$1] = t$1, this.mergeStreamInfo(), this;
|
||
},
|
||
mergeStreamInfo: function() {
|
||
for (var e$1 in this.extraStreamInfo) Object.prototype.hasOwnProperty.call(this.extraStreamInfo, e$1) && (this.streamInfo[e$1] = this.extraStreamInfo[e$1]);
|
||
},
|
||
lock: function() {
|
||
if (this.isLocked) throw new Error("The stream '" + this + "' has already been used.");
|
||
this.isLocked = !0, this.previous && this.previous.lock();
|
||
},
|
||
toString: function() {
|
||
var e$1 = "Worker " + this.name;
|
||
return this.previous ? this.previous + " -> " + e$1 : e$1;
|
||
}
|
||
}, t.exports = n;
|
||
}, {}],
|
||
29: [function(e, t, r) {
|
||
var h = e("../utils"), i = e("./ConvertWorker"), s = e("./GenericWorker"), u = e("../base64"), n = e("../support"), a = e("../external"), o = null;
|
||
if (n.nodestream) try {
|
||
o = e("../nodejs/NodejsStreamOutputAdapter");
|
||
} catch (e$1) {}
|
||
function l(e$1, o$1) {
|
||
return new a.Promise(function(t$1, r$1) {
|
||
var n$1 = [], i$1 = e$1._internalType, s$1 = e$1._outputType, a$1 = e$1._mimeType;
|
||
e$1.on("data", function(e$2, t$2) {
|
||
n$1.push(e$2), o$1 && o$1(t$2);
|
||
}).on("error", function(e$2) {
|
||
n$1 = [], r$1(e$2);
|
||
}).on("end", function() {
|
||
try {
|
||
var e$2 = function(e$3, t$2, r$2) {
|
||
switch (e$3) {
|
||
case "blob": return h.newBlob(h.transformTo("arraybuffer", t$2), r$2);
|
||
case "base64": return u.encode(t$2);
|
||
default: return h.transformTo(e$3, t$2);
|
||
}
|
||
}(s$1, function(e$3, t$2) {
|
||
var r$2, n$2 = 0, i$2 = null, s$2 = 0;
|
||
for (r$2 = 0; r$2 < t$2.length; r$2++) s$2 += t$2[r$2].length;
|
||
switch (e$3) {
|
||
case "string": return t$2.join("");
|
||
case "array": return Array.prototype.concat.apply([], t$2);
|
||
case "uint8array":
|
||
for (i$2 = new Uint8Array(s$2), r$2 = 0; r$2 < t$2.length; r$2++) i$2.set(t$2[r$2], n$2), n$2 += t$2[r$2].length;
|
||
return i$2;
|
||
case "nodebuffer": return Buffer.concat(t$2);
|
||
default: throw new Error("concat : unsupported type '" + e$3 + "'");
|
||
}
|
||
}(i$1, n$1), a$1);
|
||
t$1(e$2);
|
||
} catch (e$3) {
|
||
r$1(e$3);
|
||
}
|
||
n$1 = [];
|
||
}).resume();
|
||
});
|
||
}
|
||
function f(e$1, t$1, r$1) {
|
||
var n$1 = t$1;
|
||
switch (t$1) {
|
||
case "blob":
|
||
case "arraybuffer":
|
||
n$1 = "uint8array";
|
||
break;
|
||
case "base64": n$1 = "string";
|
||
}
|
||
try {
|
||
this._internalType = n$1, this._outputType = t$1, this._mimeType = r$1, h.checkSupport(n$1), this._worker = e$1.pipe(new i(n$1)), e$1.lock();
|
||
} catch (e$2) {
|
||
this._worker = new s("error"), this._worker.error(e$2);
|
||
}
|
||
}
|
||
f.prototype = {
|
||
accumulate: function(e$1) {
|
||
return l(this, e$1);
|
||
},
|
||
on: function(e$1, t$1) {
|
||
var r$1 = this;
|
||
return "data" === e$1 ? this._worker.on(e$1, function(e$2) {
|
||
t$1.call(r$1, e$2.data, e$2.meta);
|
||
}) : this._worker.on(e$1, function() {
|
||
h.delay(t$1, arguments, r$1);
|
||
}), this;
|
||
},
|
||
resume: function() {
|
||
return h.delay(this._worker.resume, [], this._worker), this;
|
||
},
|
||
pause: function() {
|
||
return this._worker.pause(), this;
|
||
},
|
||
toNodejsStream: function(e$1) {
|
||
if (h.checkSupport("nodestream"), "nodebuffer" !== this._outputType) throw new Error(this._outputType + " is not supported by this method");
|
||
return new o(this, { objectMode: "nodebuffer" !== this._outputType }, e$1);
|
||
}
|
||
}, t.exports = f;
|
||
}, {
|
||
"../base64": 1,
|
||
"../external": 6,
|
||
"../nodejs/NodejsStreamOutputAdapter": 13,
|
||
"../support": 30,
|
||
"../utils": 32,
|
||
"./ConvertWorker": 24,
|
||
"./GenericWorker": 28
|
||
}],
|
||
30: [function(e, t, r) {
|
||
if (r.base64 = !0, r.array = !0, r.string = !0, r.arraybuffer = "undefined" != typeof ArrayBuffer && "undefined" != typeof Uint8Array, r.nodebuffer = "undefined" != typeof Buffer, r.uint8array = "undefined" != typeof Uint8Array, "undefined" == typeof ArrayBuffer) r.blob = !1;
|
||
else {
|
||
var n = /* @__PURE__ */ new ArrayBuffer(0);
|
||
try {
|
||
r.blob = 0 === new Blob([n], { type: "application/zip" }).size;
|
||
} catch (e$1) {
|
||
try {
|
||
var i = new (self.BlobBuilder || self.WebKitBlobBuilder || self.MozBlobBuilder || self.MSBlobBuilder)();
|
||
i.append(n), r.blob = 0 === i.getBlob("application/zip").size;
|
||
} catch (e$2) {
|
||
r.blob = !1;
|
||
}
|
||
}
|
||
}
|
||
try {
|
||
r.nodestream = !!e("readable-stream").Readable;
|
||
} catch (e$1) {
|
||
r.nodestream = !1;
|
||
}
|
||
}, { "readable-stream": 16 }],
|
||
31: [function(e, t, s) {
|
||
for (var o = e("./utils"), h = e("./support"), r = e("./nodejsUtils"), n = e("./stream/GenericWorker"), u = new Array(256), i = 0; i < 256; i++) u[i] = 252 <= i ? 6 : 248 <= i ? 5 : 240 <= i ? 4 : 224 <= i ? 3 : 192 <= i ? 2 : 1;
|
||
u[254] = u[254] = 1;
|
||
function a() {
|
||
n.call(this, "utf-8 decode"), this.leftOver = null;
|
||
}
|
||
function l() {
|
||
n.call(this, "utf-8 encode");
|
||
}
|
||
s.utf8encode = function(e$1) {
|
||
return h.nodebuffer ? r.newBufferFrom(e$1, "utf-8") : function(e$2) {
|
||
var t$1, r$1, n$1, i$1, s$1, a$1 = e$2.length, o$1 = 0;
|
||
for (i$1 = 0; i$1 < a$1; i$1++) 55296 == (64512 & (r$1 = e$2.charCodeAt(i$1))) && i$1 + 1 < a$1 && 56320 == (64512 & (n$1 = e$2.charCodeAt(i$1 + 1))) && (r$1 = 65536 + (r$1 - 55296 << 10) + (n$1 - 56320), i$1++), o$1 += r$1 < 128 ? 1 : r$1 < 2048 ? 2 : r$1 < 65536 ? 3 : 4;
|
||
for (t$1 = h.uint8array ? new Uint8Array(o$1) : new Array(o$1), i$1 = s$1 = 0; s$1 < o$1; i$1++) 55296 == (64512 & (r$1 = e$2.charCodeAt(i$1))) && i$1 + 1 < a$1 && 56320 == (64512 & (n$1 = e$2.charCodeAt(i$1 + 1))) && (r$1 = 65536 + (r$1 - 55296 << 10) + (n$1 - 56320), i$1++), r$1 < 128 ? t$1[s$1++] = r$1 : (r$1 < 2048 ? t$1[s$1++] = 192 | r$1 >>> 6 : (r$1 < 65536 ? t$1[s$1++] = 224 | r$1 >>> 12 : (t$1[s$1++] = 240 | r$1 >>> 18, t$1[s$1++] = 128 | r$1 >>> 12 & 63), t$1[s$1++] = 128 | r$1 >>> 6 & 63), t$1[s$1++] = 128 | 63 & r$1);
|
||
return t$1;
|
||
}(e$1);
|
||
}, s.utf8decode = function(e$1) {
|
||
return h.nodebuffer ? o.transformTo("nodebuffer", e$1).toString("utf-8") : function(e$2) {
|
||
var t$1, r$1, n$1, i$1, s$1 = e$2.length, a$1 = new Array(2 * s$1);
|
||
for (t$1 = r$1 = 0; t$1 < s$1;) if ((n$1 = e$2[t$1++]) < 128) a$1[r$1++] = n$1;
|
||
else if (4 < (i$1 = u[n$1])) a$1[r$1++] = 65533, t$1 += i$1 - 1;
|
||
else {
|
||
for (n$1 &= 2 === i$1 ? 31 : 3 === i$1 ? 15 : 7; 1 < i$1 && t$1 < s$1;) n$1 = n$1 << 6 | 63 & e$2[t$1++], i$1--;
|
||
1 < i$1 ? a$1[r$1++] = 65533 : n$1 < 65536 ? a$1[r$1++] = n$1 : (n$1 -= 65536, a$1[r$1++] = 55296 | n$1 >> 10 & 1023, a$1[r$1++] = 56320 | 1023 & n$1);
|
||
}
|
||
return a$1.length !== r$1 && (a$1.subarray ? a$1 = a$1.subarray(0, r$1) : a$1.length = r$1), o.applyFromCharCode(a$1);
|
||
}(e$1 = o.transformTo(h.uint8array ? "uint8array" : "array", e$1));
|
||
}, o.inherits(a, n), a.prototype.processChunk = function(e$1) {
|
||
var t$1 = o.transformTo(h.uint8array ? "uint8array" : "array", e$1.data);
|
||
if (this.leftOver && this.leftOver.length) {
|
||
if (h.uint8array) {
|
||
var r$1 = t$1;
|
||
(t$1 = new Uint8Array(r$1.length + this.leftOver.length)).set(this.leftOver, 0), t$1.set(r$1, this.leftOver.length);
|
||
} else t$1 = this.leftOver.concat(t$1);
|
||
this.leftOver = null;
|
||
}
|
||
var n$1 = function(e$2, t$2) {
|
||
var r$2;
|
||
for ((t$2 = t$2 || e$2.length) > e$2.length && (t$2 = e$2.length), r$2 = t$2 - 1; 0 <= r$2 && 128 == (192 & e$2[r$2]);) r$2--;
|
||
return r$2 < 0 ? t$2 : 0 === r$2 ? t$2 : r$2 + u[e$2[r$2]] > t$2 ? r$2 : t$2;
|
||
}(t$1), i$1 = t$1;
|
||
n$1 !== t$1.length && (h.uint8array ? (i$1 = t$1.subarray(0, n$1), this.leftOver = t$1.subarray(n$1, t$1.length)) : (i$1 = t$1.slice(0, n$1), this.leftOver = t$1.slice(n$1, t$1.length))), this.push({
|
||
data: s.utf8decode(i$1),
|
||
meta: e$1.meta
|
||
});
|
||
}, a.prototype.flush = function() {
|
||
this.leftOver && this.leftOver.length && (this.push({
|
||
data: s.utf8decode(this.leftOver),
|
||
meta: {}
|
||
}), this.leftOver = null);
|
||
}, s.Utf8DecodeWorker = a, o.inherits(l, n), l.prototype.processChunk = function(e$1) {
|
||
this.push({
|
||
data: s.utf8encode(e$1.data),
|
||
meta: e$1.meta
|
||
});
|
||
}, s.Utf8EncodeWorker = l;
|
||
}, {
|
||
"./nodejsUtils": 14,
|
||
"./stream/GenericWorker": 28,
|
||
"./support": 30,
|
||
"./utils": 32
|
||
}],
|
||
32: [function(e, t, a) {
|
||
var o = e("./support"), h = e("./base64"), r = e("./nodejsUtils"), u = e("./external");
|
||
function n(e$1) {
|
||
return e$1;
|
||
}
|
||
function l(e$1, t$1) {
|
||
for (var r$1 = 0; r$1 < e$1.length; ++r$1) t$1[r$1] = 255 & e$1.charCodeAt(r$1);
|
||
return t$1;
|
||
}
|
||
e("setimmediate"), a.newBlob = function(t$1, r$1) {
|
||
a.checkSupport("blob");
|
||
try {
|
||
return new Blob([t$1], { type: r$1 });
|
||
} catch (e$1) {
|
||
try {
|
||
var n$1 = new (self.BlobBuilder || self.WebKitBlobBuilder || self.MozBlobBuilder || self.MSBlobBuilder)();
|
||
return n$1.append(t$1), n$1.getBlob(r$1);
|
||
} catch (e$2) {
|
||
throw new Error("Bug : can't construct the Blob.");
|
||
}
|
||
}
|
||
};
|
||
var i = {
|
||
stringifyByChunk: function(e$1, t$1, r$1) {
|
||
var n$1 = [], i$1 = 0, s$1 = e$1.length;
|
||
if (s$1 <= r$1) return String.fromCharCode.apply(null, e$1);
|
||
for (; i$1 < s$1;) "array" === t$1 || "nodebuffer" === t$1 ? n$1.push(String.fromCharCode.apply(null, e$1.slice(i$1, Math.min(i$1 + r$1, s$1)))) : n$1.push(String.fromCharCode.apply(null, e$1.subarray(i$1, Math.min(i$1 + r$1, s$1)))), i$1 += r$1;
|
||
return n$1.join("");
|
||
},
|
||
stringifyByChar: function(e$1) {
|
||
for (var t$1 = "", r$1 = 0; r$1 < e$1.length; r$1++) t$1 += String.fromCharCode(e$1[r$1]);
|
||
return t$1;
|
||
},
|
||
applyCanBeUsed: {
|
||
uint8array: function() {
|
||
try {
|
||
return o.uint8array && 1 === String.fromCharCode.apply(null, new Uint8Array(1)).length;
|
||
} catch (e$1) {
|
||
return !1;
|
||
}
|
||
}(),
|
||
nodebuffer: function() {
|
||
try {
|
||
return o.nodebuffer && 1 === String.fromCharCode.apply(null, r.allocBuffer(1)).length;
|
||
} catch (e$1) {
|
||
return !1;
|
||
}
|
||
}()
|
||
}
|
||
};
|
||
function s(e$1) {
|
||
var t$1 = 65536, r$1 = a.getTypeOf(e$1), n$1 = !0;
|
||
if ("uint8array" === r$1 ? n$1 = i.applyCanBeUsed.uint8array : "nodebuffer" === r$1 && (n$1 = i.applyCanBeUsed.nodebuffer), n$1) for (; 1 < t$1;) try {
|
||
return i.stringifyByChunk(e$1, r$1, t$1);
|
||
} catch (e$2) {
|
||
t$1 = Math.floor(t$1 / 2);
|
||
}
|
||
return i.stringifyByChar(e$1);
|
||
}
|
||
function f(e$1, t$1) {
|
||
for (var r$1 = 0; r$1 < e$1.length; r$1++) t$1[r$1] = e$1[r$1];
|
||
return t$1;
|
||
}
|
||
a.applyFromCharCode = s;
|
||
var c = {};
|
||
c.string = {
|
||
string: n,
|
||
array: function(e$1) {
|
||
return l(e$1, new Array(e$1.length));
|
||
},
|
||
arraybuffer: function(e$1) {
|
||
return c.string.uint8array(e$1).buffer;
|
||
},
|
||
uint8array: function(e$1) {
|
||
return l(e$1, new Uint8Array(e$1.length));
|
||
},
|
||
nodebuffer: function(e$1) {
|
||
return l(e$1, r.allocBuffer(e$1.length));
|
||
}
|
||
}, c.array = {
|
||
string: s,
|
||
array: n,
|
||
arraybuffer: function(e$1) {
|
||
return new Uint8Array(e$1).buffer;
|
||
},
|
||
uint8array: function(e$1) {
|
||
return new Uint8Array(e$1);
|
||
},
|
||
nodebuffer: function(e$1) {
|
||
return r.newBufferFrom(e$1);
|
||
}
|
||
}, c.arraybuffer = {
|
||
string: function(e$1) {
|
||
return s(new Uint8Array(e$1));
|
||
},
|
||
array: function(e$1) {
|
||
return f(new Uint8Array(e$1), new Array(e$1.byteLength));
|
||
},
|
||
arraybuffer: n,
|
||
uint8array: function(e$1) {
|
||
return new Uint8Array(e$1);
|
||
},
|
||
nodebuffer: function(e$1) {
|
||
return r.newBufferFrom(new Uint8Array(e$1));
|
||
}
|
||
}, c.uint8array = {
|
||
string: s,
|
||
array: function(e$1) {
|
||
return f(e$1, new Array(e$1.length));
|
||
},
|
||
arraybuffer: function(e$1) {
|
||
return e$1.buffer;
|
||
},
|
||
uint8array: n,
|
||
nodebuffer: function(e$1) {
|
||
return r.newBufferFrom(e$1);
|
||
}
|
||
}, c.nodebuffer = {
|
||
string: s,
|
||
array: function(e$1) {
|
||
return f(e$1, new Array(e$1.length));
|
||
},
|
||
arraybuffer: function(e$1) {
|
||
return c.nodebuffer.uint8array(e$1).buffer;
|
||
},
|
||
uint8array: function(e$1) {
|
||
return f(e$1, new Uint8Array(e$1.length));
|
||
},
|
||
nodebuffer: n
|
||
}, a.transformTo = function(e$1, t$1) {
|
||
if (t$1 = t$1 || "", !e$1) return t$1;
|
||
a.checkSupport(e$1);
|
||
var r$1 = a.getTypeOf(t$1);
|
||
return c[r$1][e$1](t$1);
|
||
}, a.resolve = function(e$1) {
|
||
for (var t$1 = e$1.split("/"), r$1 = [], n$1 = 0; n$1 < t$1.length; n$1++) {
|
||
var i$1 = t$1[n$1];
|
||
"." === i$1 || "" === i$1 && 0 !== n$1 && n$1 !== t$1.length - 1 || (".." === i$1 ? r$1.pop() : r$1.push(i$1));
|
||
}
|
||
return r$1.join("/");
|
||
}, a.getTypeOf = function(e$1) {
|
||
return "string" == typeof e$1 ? "string" : "[object Array]" === Object.prototype.toString.call(e$1) ? "array" : o.nodebuffer && r.isBuffer(e$1) ? "nodebuffer" : o.uint8array && e$1 instanceof Uint8Array ? "uint8array" : o.arraybuffer && e$1 instanceof ArrayBuffer ? "arraybuffer" : void 0;
|
||
}, a.checkSupport = function(e$1) {
|
||
if (!o[e$1.toLowerCase()]) throw new Error(e$1 + " is not supported by this platform");
|
||
}, a.MAX_VALUE_16BITS = 65535, a.MAX_VALUE_32BITS = -1, a.pretty = function(e$1) {
|
||
var t$1, r$1, n$1 = "";
|
||
for (r$1 = 0; r$1 < (e$1 || "").length; r$1++) n$1 += "\\x" + ((t$1 = e$1.charCodeAt(r$1)) < 16 ? "0" : "") + t$1.toString(16).toUpperCase();
|
||
return n$1;
|
||
}, a.delay = function(e$1, t$1, r$1) {
|
||
setImmediate(function() {
|
||
e$1.apply(r$1 || null, t$1 || []);
|
||
});
|
||
}, a.inherits = function(e$1, t$1) {
|
||
function r$1() {}
|
||
r$1.prototype = t$1.prototype, e$1.prototype = new r$1();
|
||
}, a.extend = function() {
|
||
var e$1, t$1, r$1 = {};
|
||
for (e$1 = 0; e$1 < arguments.length; e$1++) for (t$1 in arguments[e$1]) Object.prototype.hasOwnProperty.call(arguments[e$1], t$1) && void 0 === r$1[t$1] && (r$1[t$1] = arguments[e$1][t$1]);
|
||
return r$1;
|
||
}, a.prepareContent = function(r$1, e$1, n$1, i$1, s$1) {
|
||
return u.Promise.resolve(e$1).then(function(n$2) {
|
||
return o.blob && (n$2 instanceof Blob || -1 !== ["[object File]", "[object Blob]"].indexOf(Object.prototype.toString.call(n$2))) && "undefined" != typeof FileReader ? new u.Promise(function(t$1, r$2) {
|
||
var e$2 = new FileReader();
|
||
e$2.onload = function(e$3) {
|
||
t$1(e$3.target.result);
|
||
}, e$2.onerror = function(e$3) {
|
||
r$2(e$3.target.error);
|
||
}, e$2.readAsArrayBuffer(n$2);
|
||
}) : n$2;
|
||
}).then(function(e$2) {
|
||
var t$1 = a.getTypeOf(e$2);
|
||
return t$1 ? ("arraybuffer" === t$1 ? e$2 = a.transformTo("uint8array", e$2) : "string" === t$1 && (s$1 ? e$2 = h.decode(e$2) : n$1 && !0 !== i$1 && (e$2 = function(e$3) {
|
||
return l(e$3, o.uint8array ? new Uint8Array(e$3.length) : new Array(e$3.length));
|
||
}(e$2))), e$2) : u.Promise.reject(/* @__PURE__ */ new Error("Can't read the data of '" + r$1 + "'. Is it in a supported JavaScript type (String, Blob, ArrayBuffer, etc) ?"));
|
||
});
|
||
};
|
||
}, {
|
||
"./base64": 1,
|
||
"./external": 6,
|
||
"./nodejsUtils": 14,
|
||
"./support": 30,
|
||
setimmediate: 54
|
||
}],
|
||
33: [function(e, t, r) {
|
||
var n = e("./reader/readerFor"), i = e("./utils"), s = e("./signature"), a = e("./zipEntry"), o = e("./support");
|
||
function h(e$1) {
|
||
this.files = [], this.loadOptions = e$1;
|
||
}
|
||
h.prototype = {
|
||
checkSignature: function(e$1) {
|
||
if (!this.reader.readAndCheckSignature(e$1)) {
|
||
this.reader.index -= 4;
|
||
var t$1 = this.reader.readString(4);
|
||
throw new Error("Corrupted zip or bug: unexpected signature (" + i.pretty(t$1) + ", expected " + i.pretty(e$1) + ")");
|
||
}
|
||
},
|
||
isSignature: function(e$1, t$1) {
|
||
var r$1 = this.reader.index;
|
||
this.reader.setIndex(e$1);
|
||
var n$1 = this.reader.readString(4) === t$1;
|
||
return this.reader.setIndex(r$1), n$1;
|
||
},
|
||
readBlockEndOfCentral: function() {
|
||
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);
|
||
var e$1 = this.reader.readData(this.zipCommentLength), t$1 = o.uint8array ? "uint8array" : "array", r$1 = i.transformTo(t$1, e$1);
|
||
this.zipComment = this.loadOptions.decodeFileName(r$1);
|
||
},
|
||
readBlockZip64EndOfCentral: function() {
|
||
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 = {};
|
||
for (var e$1, t$1, r$1, n$1 = this.zip64EndOfCentralSize - 44; 0 < n$1;) e$1 = this.reader.readInt(2), t$1 = this.reader.readInt(4), r$1 = this.reader.readData(t$1), this.zip64ExtensibleData[e$1] = {
|
||
id: e$1,
|
||
length: t$1,
|
||
value: r$1
|
||
};
|
||
},
|
||
readBlockZip64EndOfCentralLocator: function() {
|
||
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");
|
||
},
|
||
readLocalFiles: function() {
|
||
var e$1, t$1;
|
||
for (e$1 = 0; e$1 < this.files.length; e$1++) t$1 = this.files[e$1], this.reader.setIndex(t$1.localHeaderOffset), this.checkSignature(s.LOCAL_FILE_HEADER), t$1.readLocalPart(this.reader), t$1.handleUTF8(), t$1.processAttributes();
|
||
},
|
||
readCentralDir: function() {
|
||
var e$1;
|
||
for (this.reader.setIndex(this.centralDirOffset); this.reader.readAndCheckSignature(s.CENTRAL_FILE_HEADER);) (e$1 = new a({ zip64: this.zip64 }, this.loadOptions)).readCentralPart(this.reader), this.files.push(e$1);
|
||
if (this.centralDirRecords !== this.files.length && 0 !== this.centralDirRecords && 0 === this.files.length) throw new Error("Corrupted zip or bug: expected " + this.centralDirRecords + " records in central dir, got " + this.files.length);
|
||
},
|
||
readEndOfCentral: function() {
|
||
var e$1 = this.reader.lastIndexOfSignature(s.CENTRAL_DIRECTORY_END);
|
||
if (e$1 < 0) throw !this.isSignature(0, s.LOCAL_FILE_HEADER) ? /* @__PURE__ */ 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") : /* @__PURE__ */ new Error("Corrupted zip: can't find end of central directory");
|
||
this.reader.setIndex(e$1);
|
||
var t$1 = e$1;
|
||
if (this.checkSignature(s.CENTRAL_DIRECTORY_END), this.readBlockEndOfCentral(), this.diskNumber === i.MAX_VALUE_16BITS || this.diskWithCentralDirStart === i.MAX_VALUE_16BITS || this.centralDirRecordsOnThisDisk === i.MAX_VALUE_16BITS || this.centralDirRecords === i.MAX_VALUE_16BITS || this.centralDirSize === i.MAX_VALUE_32BITS || this.centralDirOffset === i.MAX_VALUE_32BITS) {
|
||
if (this.zip64 = !0, (e$1 = this.reader.lastIndexOfSignature(s.ZIP64_CENTRAL_DIRECTORY_LOCATOR)) < 0) throw new Error("Corrupted zip: can't find the ZIP64 end of central directory locator");
|
||
if (this.reader.setIndex(e$1), this.checkSignature(s.ZIP64_CENTRAL_DIRECTORY_LOCATOR), this.readBlockZip64EndOfCentralLocator(), !this.isSignature(this.relativeOffsetEndOfZip64CentralDir, s.ZIP64_CENTRAL_DIRECTORY_END) && (this.relativeOffsetEndOfZip64CentralDir = this.reader.lastIndexOfSignature(s.ZIP64_CENTRAL_DIRECTORY_END), this.relativeOffsetEndOfZip64CentralDir < 0)) throw new Error("Corrupted zip: can't find the ZIP64 end of central directory");
|
||
this.reader.setIndex(this.relativeOffsetEndOfZip64CentralDir), this.checkSignature(s.ZIP64_CENTRAL_DIRECTORY_END), this.readBlockZip64EndOfCentral();
|
||
}
|
||
var r$1 = this.centralDirOffset + this.centralDirSize;
|
||
this.zip64 && (r$1 += 20, r$1 += 12 + this.zip64EndOfCentralSize);
|
||
var n$1 = t$1 - r$1;
|
||
if (0 < n$1) this.isSignature(t$1, s.CENTRAL_FILE_HEADER) || (this.reader.zero = n$1);
|
||
else if (n$1 < 0) throw new Error("Corrupted zip: missing " + Math.abs(n$1) + " bytes.");
|
||
},
|
||
prepareReader: function(e$1) {
|
||
this.reader = n(e$1);
|
||
},
|
||
load: function(e$1) {
|
||
this.prepareReader(e$1), this.readEndOfCentral(), this.readCentralDir(), this.readLocalFiles();
|
||
}
|
||
}, t.exports = h;
|
||
}, {
|
||
"./reader/readerFor": 22,
|
||
"./signature": 23,
|
||
"./support": 30,
|
||
"./utils": 32,
|
||
"./zipEntry": 34
|
||
}],
|
||
34: [function(e, t, r) {
|
||
var n = e("./reader/readerFor"), s = e("./utils"), i = e("./compressedObject"), a = e("./crc32"), o = e("./utf8"), h = e("./compressions"), u = e("./support");
|
||
function l(e$1, t$1) {
|
||
this.options = e$1, this.loadOptions = t$1;
|
||
}
|
||
l.prototype = {
|
||
isEncrypted: function() {
|
||
return 1 == (1 & this.bitFlag);
|
||
},
|
||
useUTF8: function() {
|
||
return 2048 == (2048 & this.bitFlag);
|
||
},
|
||
readLocalPart: function(e$1) {
|
||
var t$1, r$1;
|
||
if (e$1.skip(22), this.fileNameLength = e$1.readInt(2), r$1 = e$1.readInt(2), this.fileName = e$1.readData(this.fileNameLength), e$1.skip(r$1), -1 === this.compressedSize || -1 === this.uncompressedSize) throw new Error("Bug or corrupted zip : didn't get enough information from the central directory (compressedSize === -1 || uncompressedSize === -1)");
|
||
if (null === (t$1 = function(e$2) {
|
||
for (var t$2 in h) if (Object.prototype.hasOwnProperty.call(h, t$2) && h[t$2].magic === e$2) return h[t$2];
|
||
return null;
|
||
}(this.compressionMethod))) throw new Error("Corrupted zip : compression " + s.pretty(this.compressionMethod) + " unknown (inner file : " + s.transformTo("string", this.fileName) + ")");
|
||
this.decompressed = new i(this.compressedSize, this.uncompressedSize, this.crc32, t$1, e$1.readData(this.compressedSize));
|
||
},
|
||
readCentralPart: function(e$1) {
|
||
this.versionMadeBy = e$1.readInt(2), e$1.skip(2), this.bitFlag = e$1.readInt(2), this.compressionMethod = e$1.readString(2), this.date = e$1.readDate(), this.crc32 = e$1.readInt(4), this.compressedSize = e$1.readInt(4), this.uncompressedSize = e$1.readInt(4);
|
||
var t$1 = e$1.readInt(2);
|
||
if (this.extraFieldsLength = e$1.readInt(2), this.fileCommentLength = e$1.readInt(2), this.diskNumberStart = e$1.readInt(2), this.internalFileAttributes = e$1.readInt(2), this.externalFileAttributes = e$1.readInt(4), this.localHeaderOffset = e$1.readInt(4), this.isEncrypted()) throw new Error("Encrypted zip are not supported");
|
||
e$1.skip(t$1), this.readExtraFields(e$1), this.parseZIP64ExtraField(e$1), this.fileComment = e$1.readData(this.fileCommentLength);
|
||
},
|
||
processAttributes: function() {
|
||
this.unixPermissions = null, this.dosPermissions = null;
|
||
var e$1 = this.versionMadeBy >> 8;
|
||
this.dir = !!(16 & this.externalFileAttributes), 0 == e$1 && (this.dosPermissions = 63 & this.externalFileAttributes), 3 == e$1 && (this.unixPermissions = this.externalFileAttributes >> 16 & 65535), this.dir || "/" !== this.fileNameStr.slice(-1) || (this.dir = !0);
|
||
},
|
||
parseZIP64ExtraField: function() {
|
||
if (this.extraFields[1]) {
|
||
var e$1 = n(this.extraFields[1].value);
|
||
this.uncompressedSize === s.MAX_VALUE_32BITS && (this.uncompressedSize = e$1.readInt(8)), this.compressedSize === s.MAX_VALUE_32BITS && (this.compressedSize = e$1.readInt(8)), this.localHeaderOffset === s.MAX_VALUE_32BITS && (this.localHeaderOffset = e$1.readInt(8)), this.diskNumberStart === s.MAX_VALUE_32BITS && (this.diskNumberStart = e$1.readInt(4));
|
||
}
|
||
},
|
||
readExtraFields: function(e$1) {
|
||
var t$1, r$1, n$1, i$1 = e$1.index + this.extraFieldsLength;
|
||
for (this.extraFields || (this.extraFields = {}); e$1.index + 4 < i$1;) t$1 = e$1.readInt(2), r$1 = e$1.readInt(2), n$1 = e$1.readData(r$1), this.extraFields[t$1] = {
|
||
id: t$1,
|
||
length: r$1,
|
||
value: n$1
|
||
};
|
||
e$1.setIndex(i$1);
|
||
},
|
||
handleUTF8: function() {
|
||
var e$1 = u.uint8array ? "uint8array" : "array";
|
||
if (this.useUTF8()) this.fileNameStr = o.utf8decode(this.fileName), this.fileCommentStr = o.utf8decode(this.fileComment);
|
||
else {
|
||
var t$1 = this.findExtraFieldUnicodePath();
|
||
if (null !== t$1) this.fileNameStr = t$1;
|
||
else {
|
||
var r$1 = s.transformTo(e$1, this.fileName);
|
||
this.fileNameStr = this.loadOptions.decodeFileName(r$1);
|
||
}
|
||
var n$1 = this.findExtraFieldUnicodeComment();
|
||
if (null !== n$1) this.fileCommentStr = n$1;
|
||
else {
|
||
var i$1 = s.transformTo(e$1, this.fileComment);
|
||
this.fileCommentStr = this.loadOptions.decodeFileName(i$1);
|
||
}
|
||
}
|
||
},
|
||
findExtraFieldUnicodePath: function() {
|
||
var e$1 = this.extraFields[28789];
|
||
if (e$1) {
|
||
var t$1 = n(e$1.value);
|
||
return 1 !== t$1.readInt(1) ? null : a(this.fileName) !== t$1.readInt(4) ? null : o.utf8decode(t$1.readData(e$1.length - 5));
|
||
}
|
||
return null;
|
||
},
|
||
findExtraFieldUnicodeComment: function() {
|
||
var e$1 = this.extraFields[25461];
|
||
if (e$1) {
|
||
var t$1 = n(e$1.value);
|
||
return 1 !== t$1.readInt(1) ? null : a(this.fileComment) !== t$1.readInt(4) ? null : o.utf8decode(t$1.readData(e$1.length - 5));
|
||
}
|
||
return null;
|
||
}
|
||
}, t.exports = l;
|
||
}, {
|
||
"./compressedObject": 2,
|
||
"./compressions": 3,
|
||
"./crc32": 4,
|
||
"./reader/readerFor": 22,
|
||
"./support": 30,
|
||
"./utf8": 31,
|
||
"./utils": 32
|
||
}],
|
||
35: [function(e, t, r) {
|
||
function n(e$1, t$1, r$1) {
|
||
this.name = e$1, this.dir = r$1.dir, this.date = r$1.date, this.comment = r$1.comment, this.unixPermissions = r$1.unixPermissions, this.dosPermissions = r$1.dosPermissions, this._data = t$1, this._dataBinary = r$1.binary, this.options = {
|
||
compression: r$1.compression,
|
||
compressionOptions: r$1.compressionOptions
|
||
};
|
||
}
|
||
var s = e("./stream/StreamHelper"), i = e("./stream/DataWorker"), a = e("./utf8"), o = e("./compressedObject"), h = e("./stream/GenericWorker");
|
||
n.prototype = {
|
||
internalStream: function(e$1) {
|
||
var t$1 = null, r$1 = "string";
|
||
try {
|
||
if (!e$1) throw new Error("No output type specified.");
|
||
var n$1 = "string" === (r$1 = e$1.toLowerCase()) || "text" === r$1;
|
||
"binarystring" !== r$1 && "text" !== r$1 || (r$1 = "string"), t$1 = this._decompressWorker();
|
||
var i$1 = !this._dataBinary;
|
||
i$1 && !n$1 && (t$1 = t$1.pipe(new a.Utf8EncodeWorker())), !i$1 && n$1 && (t$1 = t$1.pipe(new a.Utf8DecodeWorker()));
|
||
} catch (e$2) {
|
||
(t$1 = new h("error")).error(e$2);
|
||
}
|
||
return new s(t$1, r$1, "");
|
||
},
|
||
async: function(e$1, t$1) {
|
||
return this.internalStream(e$1).accumulate(t$1);
|
||
},
|
||
nodeStream: function(e$1, t$1) {
|
||
return this.internalStream(e$1 || "nodebuffer").toNodejsStream(t$1);
|
||
},
|
||
_compressWorker: function(e$1, t$1) {
|
||
if (this._data instanceof o && this._data.compression.magic === e$1.magic) return this._data.getCompressedWorker();
|
||
var r$1 = this._decompressWorker();
|
||
return this._dataBinary || (r$1 = r$1.pipe(new a.Utf8EncodeWorker())), o.createWorkerFrom(r$1, e$1, t$1);
|
||
},
|
||
_decompressWorker: function() {
|
||
return this._data instanceof o ? this._data.getContentWorker() : this._data instanceof h ? this._data : new i(this._data);
|
||
}
|
||
};
|
||
for (var u = [
|
||
"asText",
|
||
"asBinary",
|
||
"asNodeBuffer",
|
||
"asUint8Array",
|
||
"asArrayBuffer"
|
||
], l = function() {
|
||
throw new Error("This method has been removed in JSZip 3.0, please check the upgrade guide.");
|
||
}, f = 0; f < u.length; f++) n.prototype[u[f]] = l;
|
||
t.exports = n;
|
||
}, {
|
||
"./compressedObject": 2,
|
||
"./stream/DataWorker": 27,
|
||
"./stream/GenericWorker": 28,
|
||
"./stream/StreamHelper": 29,
|
||
"./utf8": 31
|
||
}],
|
||
36: [function(e, l, t) {
|
||
(function(t$1) {
|
||
var r, n, e$1 = t$1.MutationObserver || t$1.WebKitMutationObserver;
|
||
if (e$1) {
|
||
var i = 0, s = new e$1(u), a = t$1.document.createTextNode("");
|
||
s.observe(a, { characterData: !0 }), r = function() {
|
||
a.data = i = ++i % 2;
|
||
};
|
||
} else if (t$1.setImmediate || void 0 === t$1.MessageChannel) r = "document" in t$1 && "onreadystatechange" in t$1.document.createElement("script") ? function() {
|
||
var e$2 = t$1.document.createElement("script");
|
||
e$2.onreadystatechange = function() {
|
||
u(), e$2.onreadystatechange = null, e$2.parentNode.removeChild(e$2), e$2 = null;
|
||
}, t$1.document.documentElement.appendChild(e$2);
|
||
} : function() {
|
||
setTimeout(u, 0);
|
||
};
|
||
else {
|
||
var o = new t$1.MessageChannel();
|
||
o.port1.onmessage = u, r = function() {
|
||
o.port2.postMessage(0);
|
||
};
|
||
}
|
||
var h = [];
|
||
function u() {
|
||
var e$2, t$2;
|
||
n = !0;
|
||
for (var r$1 = h.length; r$1;) {
|
||
for (t$2 = h, h = [], e$2 = -1; ++e$2 < r$1;) t$2[e$2]();
|
||
r$1 = h.length;
|
||
}
|
||
n = !1;
|
||
}
|
||
l.exports = function(e$2) {
|
||
1 !== h.push(e$2) || n || r();
|
||
};
|
||
}).call(this, "undefined" != typeof global ? global : "undefined" != typeof self ? self : "undefined" != typeof window ? window : {});
|
||
}, {}],
|
||
37: [function(e, t, r) {
|
||
var i = e("immediate");
|
||
function u() {}
|
||
var l = {}, s = ["REJECTED"], a = ["FULFILLED"], n = ["PENDING"];
|
||
function o(e$1) {
|
||
if ("function" != typeof e$1) throw new TypeError("resolver must be a function");
|
||
this.state = n, this.queue = [], this.outcome = void 0, e$1 !== u && d(this, e$1);
|
||
}
|
||
function h(e$1, t$1, r$1) {
|
||
this.promise = e$1, "function" == typeof t$1 && (this.onFulfilled = t$1, this.callFulfilled = this.otherCallFulfilled), "function" == typeof r$1 && (this.onRejected = r$1, this.callRejected = this.otherCallRejected);
|
||
}
|
||
function f(t$1, r$1, n$1) {
|
||
i(function() {
|
||
var e$1;
|
||
try {
|
||
e$1 = r$1(n$1);
|
||
} catch (e$2) {
|
||
return l.reject(t$1, e$2);
|
||
}
|
||
e$1 === t$1 ? l.reject(t$1, /* @__PURE__ */ new TypeError("Cannot resolve promise with itself")) : l.resolve(t$1, e$1);
|
||
});
|
||
}
|
||
function c(e$1) {
|
||
var t$1 = e$1 && e$1.then;
|
||
if (e$1 && ("object" == typeof e$1 || "function" == typeof e$1) && "function" == typeof t$1) return function() {
|
||
t$1.apply(e$1, arguments);
|
||
};
|
||
}
|
||
function d(t$1, e$1) {
|
||
var r$1 = !1;
|
||
function n$1(e$2) {
|
||
r$1 || (r$1 = !0, l.reject(t$1, e$2));
|
||
}
|
||
function i$1(e$2) {
|
||
r$1 || (r$1 = !0, l.resolve(t$1, e$2));
|
||
}
|
||
var s$1 = p(function() {
|
||
e$1(i$1, n$1);
|
||
});
|
||
"error" === s$1.status && n$1(s$1.value);
|
||
}
|
||
function p(e$1, t$1) {
|
||
var r$1 = {};
|
||
try {
|
||
r$1.value = e$1(t$1), r$1.status = "success";
|
||
} catch (e$2) {
|
||
r$1.status = "error", r$1.value = e$2;
|
||
}
|
||
return r$1;
|
||
}
|
||
(t.exports = o).prototype.finally = function(t$1) {
|
||
if ("function" != typeof t$1) return this;
|
||
var r$1 = this.constructor;
|
||
return this.then(function(e$1) {
|
||
return r$1.resolve(t$1()).then(function() {
|
||
return e$1;
|
||
});
|
||
}, function(e$1) {
|
||
return r$1.resolve(t$1()).then(function() {
|
||
throw e$1;
|
||
});
|
||
});
|
||
}, o.prototype.catch = function(e$1) {
|
||
return this.then(null, e$1);
|
||
}, o.prototype.then = function(e$1, t$1) {
|
||
if ("function" != typeof e$1 && this.state === a || "function" != typeof t$1 && this.state === s) return this;
|
||
var r$1 = new this.constructor(u);
|
||
this.state !== n ? f(r$1, this.state === a ? e$1 : t$1, this.outcome) : this.queue.push(new h(r$1, e$1, t$1));
|
||
return r$1;
|
||
}, h.prototype.callFulfilled = function(e$1) {
|
||
l.resolve(this.promise, e$1);
|
||
}, h.prototype.otherCallFulfilled = function(e$1) {
|
||
f(this.promise, this.onFulfilled, e$1);
|
||
}, h.prototype.callRejected = function(e$1) {
|
||
l.reject(this.promise, e$1);
|
||
}, h.prototype.otherCallRejected = function(e$1) {
|
||
f(this.promise, this.onRejected, e$1);
|
||
}, l.resolve = function(e$1, t$1) {
|
||
var r$1 = p(c, t$1);
|
||
if ("error" === r$1.status) return l.reject(e$1, r$1.value);
|
||
var n$1 = r$1.value;
|
||
if (n$1) d(e$1, n$1);
|
||
else {
|
||
e$1.state = a, e$1.outcome = t$1;
|
||
for (var i$1 = -1, s$1 = e$1.queue.length; ++i$1 < s$1;) e$1.queue[i$1].callFulfilled(t$1);
|
||
}
|
||
return e$1;
|
||
}, l.reject = function(e$1, t$1) {
|
||
e$1.state = s, e$1.outcome = t$1;
|
||
for (var r$1 = -1, n$1 = e$1.queue.length; ++r$1 < n$1;) e$1.queue[r$1].callRejected(t$1);
|
||
return e$1;
|
||
}, o.resolve = function(e$1) {
|
||
if (e$1 instanceof this) return e$1;
|
||
return l.resolve(new this(u), e$1);
|
||
}, o.reject = function(e$1) {
|
||
var t$1 = new this(u);
|
||
return l.reject(t$1, e$1);
|
||
}, o.all = function(e$1) {
|
||
var r$1 = this;
|
||
if ("[object Array]" !== Object.prototype.toString.call(e$1)) return this.reject(/* @__PURE__ */ new TypeError("must be an array"));
|
||
var n$1 = e$1.length, i$1 = !1;
|
||
if (!n$1) return this.resolve([]);
|
||
var s$1 = new Array(n$1), a$1 = 0, t$1 = -1, o$1 = new this(u);
|
||
for (; ++t$1 < n$1;) h$1(e$1[t$1], t$1);
|
||
return o$1;
|
||
function h$1(e$2, t$2) {
|
||
r$1.resolve(e$2).then(function(e$3) {
|
||
s$1[t$2] = e$3, ++a$1 !== n$1 || i$1 || (i$1 = !0, l.resolve(o$1, s$1));
|
||
}, function(e$3) {
|
||
i$1 || (i$1 = !0, l.reject(o$1, e$3));
|
||
});
|
||
}
|
||
}, o.race = function(e$1) {
|
||
var t$1 = this;
|
||
if ("[object Array]" !== Object.prototype.toString.call(e$1)) return this.reject(/* @__PURE__ */ new TypeError("must be an array"));
|
||
var r$1 = e$1.length, n$1 = !1;
|
||
if (!r$1) return this.resolve([]);
|
||
var i$1 = -1, s$1 = new this(u);
|
||
for (; ++i$1 < r$1;) a$1 = e$1[i$1], t$1.resolve(a$1).then(function(e$2) {
|
||
n$1 || (n$1 = !0, l.resolve(s$1, e$2));
|
||
}, function(e$2) {
|
||
n$1 || (n$1 = !0, l.reject(s$1, e$2));
|
||
});
|
||
var a$1;
|
||
return s$1;
|
||
};
|
||
}, { immediate: 36 }],
|
||
38: [function(e, t, r) {
|
||
var n = {};
|
||
(0, e("./lib/utils/common").assign)(n, e("./lib/deflate"), e("./lib/inflate"), e("./lib/zlib/constants")), t.exports = n;
|
||
}, {
|
||
"./lib/deflate": 39,
|
||
"./lib/inflate": 40,
|
||
"./lib/utils/common": 41,
|
||
"./lib/zlib/constants": 44
|
||
}],
|
||
39: [function(e, t, r) {
|
||
var a = e("./zlib/deflate"), o = e("./utils/common"), h = e("./utils/strings"), i = e("./zlib/messages"), s = e("./zlib/zstream"), u = Object.prototype.toString, l = 0, f = -1, c = 0, d = 8;
|
||
function p(e$1) {
|
||
if (!(this instanceof p)) return new p(e$1);
|
||
this.options = o.assign({
|
||
level: f,
|
||
method: d,
|
||
chunkSize: 16384,
|
||
windowBits: 15,
|
||
memLevel: 8,
|
||
strategy: c,
|
||
to: ""
|
||
}, e$1 || {});
|
||
var t$1 = this.options;
|
||
t$1.raw && 0 < t$1.windowBits ? t$1.windowBits = -t$1.windowBits : t$1.gzip && 0 < t$1.windowBits && t$1.windowBits < 16 && (t$1.windowBits += 16), this.err = 0, this.msg = "", this.ended = !1, this.chunks = [], this.strm = new s(), this.strm.avail_out = 0;
|
||
var r$1 = a.deflateInit2(this.strm, t$1.level, t$1.method, t$1.windowBits, t$1.memLevel, t$1.strategy);
|
||
if (r$1 !== l) throw new Error(i[r$1]);
|
||
if (t$1.header && a.deflateSetHeader(this.strm, t$1.header), t$1.dictionary) {
|
||
var n$1;
|
||
if (n$1 = "string" == typeof t$1.dictionary ? h.string2buf(t$1.dictionary) : "[object ArrayBuffer]" === u.call(t$1.dictionary) ? new Uint8Array(t$1.dictionary) : t$1.dictionary, (r$1 = a.deflateSetDictionary(this.strm, n$1)) !== l) throw new Error(i[r$1]);
|
||
this._dict_set = !0;
|
||
}
|
||
}
|
||
function n(e$1, t$1) {
|
||
var r$1 = new p(t$1);
|
||
if (r$1.push(e$1, !0), r$1.err) throw r$1.msg || i[r$1.err];
|
||
return r$1.result;
|
||
}
|
||
p.prototype.push = function(e$1, t$1) {
|
||
var r$1, n$1, i$1 = this.strm, s$1 = this.options.chunkSize;
|
||
if (this.ended) return !1;
|
||
n$1 = t$1 === ~~t$1 ? t$1 : !0 === t$1 ? 4 : 0, "string" == typeof e$1 ? i$1.input = h.string2buf(e$1) : "[object ArrayBuffer]" === u.call(e$1) ? i$1.input = new Uint8Array(e$1) : i$1.input = e$1, i$1.next_in = 0, i$1.avail_in = i$1.input.length;
|
||
do {
|
||
if (0 === i$1.avail_out && (i$1.output = new o.Buf8(s$1), i$1.next_out = 0, i$1.avail_out = s$1), 1 !== (r$1 = a.deflate(i$1, n$1)) && r$1 !== l) return this.onEnd(r$1), !(this.ended = !0);
|
||
0 !== i$1.avail_out && (0 !== i$1.avail_in || 4 !== n$1 && 2 !== n$1) || ("string" === this.options.to ? this.onData(h.buf2binstring(o.shrinkBuf(i$1.output, i$1.next_out))) : this.onData(o.shrinkBuf(i$1.output, i$1.next_out)));
|
||
} while ((0 < i$1.avail_in || 0 === i$1.avail_out) && 1 !== r$1);
|
||
return 4 === n$1 ? (r$1 = a.deflateEnd(this.strm), this.onEnd(r$1), this.ended = !0, r$1 === l) : 2 !== n$1 || (this.onEnd(l), !(i$1.avail_out = 0));
|
||
}, p.prototype.onData = function(e$1) {
|
||
this.chunks.push(e$1);
|
||
}, p.prototype.onEnd = function(e$1) {
|
||
e$1 === l && ("string" === this.options.to ? this.result = this.chunks.join("") : this.result = o.flattenChunks(this.chunks)), this.chunks = [], this.err = e$1, this.msg = this.strm.msg;
|
||
}, r.Deflate = p, r.deflate = n, r.deflateRaw = function(e$1, t$1) {
|
||
return (t$1 = t$1 || {}).raw = !0, n(e$1, t$1);
|
||
}, r.gzip = function(e$1, t$1) {
|
||
return (t$1 = t$1 || {}).gzip = !0, n(e$1, t$1);
|
||
};
|
||
}, {
|
||
"./utils/common": 41,
|
||
"./utils/strings": 42,
|
||
"./zlib/deflate": 46,
|
||
"./zlib/messages": 51,
|
||
"./zlib/zstream": 53
|
||
}],
|
||
40: [function(e, t, r) {
|
||
var c = e("./zlib/inflate"), d = e("./utils/common"), p = e("./utils/strings"), m = e("./zlib/constants"), n = e("./zlib/messages"), i = e("./zlib/zstream"), s = e("./zlib/gzheader"), _ = Object.prototype.toString;
|
||
function a(e$1) {
|
||
if (!(this instanceof a)) return new a(e$1);
|
||
this.options = d.assign({
|
||
chunkSize: 16384,
|
||
windowBits: 0,
|
||
to: ""
|
||
}, e$1 || {});
|
||
var t$1 = this.options;
|
||
t$1.raw && 0 <= t$1.windowBits && t$1.windowBits < 16 && (t$1.windowBits = -t$1.windowBits, 0 === t$1.windowBits && (t$1.windowBits = -15)), !(0 <= t$1.windowBits && t$1.windowBits < 16) || e$1 && e$1.windowBits || (t$1.windowBits += 32), 15 < t$1.windowBits && t$1.windowBits < 48 && 0 == (15 & t$1.windowBits) && (t$1.windowBits |= 15), this.err = 0, this.msg = "", this.ended = !1, this.chunks = [], this.strm = new i(), this.strm.avail_out = 0;
|
||
var r$1 = c.inflateInit2(this.strm, t$1.windowBits);
|
||
if (r$1 !== m.Z_OK) throw new Error(n[r$1]);
|
||
this.header = new s(), c.inflateGetHeader(this.strm, this.header);
|
||
}
|
||
function o(e$1, t$1) {
|
||
var r$1 = new a(t$1);
|
||
if (r$1.push(e$1, !0), r$1.err) throw r$1.msg || n[r$1.err];
|
||
return r$1.result;
|
||
}
|
||
a.prototype.push = function(e$1, t$1) {
|
||
var r$1, n$1, i$1, s$1, a$1, o$1, h = this.strm, u = this.options.chunkSize, l = this.options.dictionary, f = !1;
|
||
if (this.ended) return !1;
|
||
n$1 = t$1 === ~~t$1 ? t$1 : !0 === t$1 ? m.Z_FINISH : m.Z_NO_FLUSH, "string" == typeof e$1 ? h.input = p.binstring2buf(e$1) : "[object ArrayBuffer]" === _.call(e$1) ? h.input = new Uint8Array(e$1) : h.input = e$1, h.next_in = 0, h.avail_in = h.input.length;
|
||
do {
|
||
if (0 === h.avail_out && (h.output = new d.Buf8(u), h.next_out = 0, h.avail_out = u), (r$1 = c.inflate(h, m.Z_NO_FLUSH)) === m.Z_NEED_DICT && l && (o$1 = "string" == typeof l ? p.string2buf(l) : "[object ArrayBuffer]" === _.call(l) ? new Uint8Array(l) : l, r$1 = c.inflateSetDictionary(this.strm, o$1)), r$1 === m.Z_BUF_ERROR && !0 === f && (r$1 = m.Z_OK, f = !1), r$1 !== m.Z_STREAM_END && r$1 !== m.Z_OK) return this.onEnd(r$1), !(this.ended = !0);
|
||
h.next_out && (0 !== h.avail_out && r$1 !== m.Z_STREAM_END && (0 !== h.avail_in || n$1 !== m.Z_FINISH && n$1 !== m.Z_SYNC_FLUSH) || ("string" === this.options.to ? (i$1 = p.utf8border(h.output, h.next_out), s$1 = h.next_out - i$1, a$1 = p.buf2string(h.output, i$1), h.next_out = s$1, h.avail_out = u - s$1, s$1 && d.arraySet(h.output, h.output, i$1, s$1, 0), this.onData(a$1)) : this.onData(d.shrinkBuf(h.output, h.next_out)))), 0 === h.avail_in && 0 === h.avail_out && (f = !0);
|
||
} while ((0 < h.avail_in || 0 === h.avail_out) && r$1 !== m.Z_STREAM_END);
|
||
return r$1 === m.Z_STREAM_END && (n$1 = m.Z_FINISH), n$1 === m.Z_FINISH ? (r$1 = c.inflateEnd(this.strm), this.onEnd(r$1), this.ended = !0, r$1 === m.Z_OK) : n$1 !== m.Z_SYNC_FLUSH || (this.onEnd(m.Z_OK), !(h.avail_out = 0));
|
||
}, a.prototype.onData = function(e$1) {
|
||
this.chunks.push(e$1);
|
||
}, a.prototype.onEnd = function(e$1) {
|
||
e$1 === m.Z_OK && ("string" === this.options.to ? this.result = this.chunks.join("") : this.result = d.flattenChunks(this.chunks)), this.chunks = [], this.err = e$1, this.msg = this.strm.msg;
|
||
}, r.Inflate = a, r.inflate = o, r.inflateRaw = function(e$1, t$1) {
|
||
return (t$1 = t$1 || {}).raw = !0, o(e$1, t$1);
|
||
}, r.ungzip = o;
|
||
}, {
|
||
"./utils/common": 41,
|
||
"./utils/strings": 42,
|
||
"./zlib/constants": 44,
|
||
"./zlib/gzheader": 47,
|
||
"./zlib/inflate": 49,
|
||
"./zlib/messages": 51,
|
||
"./zlib/zstream": 53
|
||
}],
|
||
41: [function(e, t, r) {
|
||
var n = "undefined" != typeof Uint8Array && "undefined" != typeof Uint16Array && "undefined" != typeof Int32Array;
|
||
r.assign = function(e$1) {
|
||
for (var t$1 = Array.prototype.slice.call(arguments, 1); t$1.length;) {
|
||
var r$1 = t$1.shift();
|
||
if (r$1) {
|
||
if ("object" != typeof r$1) throw new TypeError(r$1 + "must be non-object");
|
||
for (var n$1 in r$1) r$1.hasOwnProperty(n$1) && (e$1[n$1] = r$1[n$1]);
|
||
}
|
||
}
|
||
return e$1;
|
||
}, r.shrinkBuf = function(e$1, t$1) {
|
||
return e$1.length === t$1 ? e$1 : e$1.subarray ? e$1.subarray(0, t$1) : (e$1.length = t$1, e$1);
|
||
};
|
||
var i = {
|
||
arraySet: function(e$1, t$1, r$1, n$1, i$1) {
|
||
if (t$1.subarray && e$1.subarray) e$1.set(t$1.subarray(r$1, r$1 + n$1), i$1);
|
||
else for (var s$1 = 0; s$1 < n$1; s$1++) e$1[i$1 + s$1] = t$1[r$1 + s$1];
|
||
},
|
||
flattenChunks: function(e$1) {
|
||
var t$1, r$1, n$1, i$1, s$1, a;
|
||
for (t$1 = n$1 = 0, r$1 = e$1.length; t$1 < r$1; t$1++) n$1 += e$1[t$1].length;
|
||
for (a = new Uint8Array(n$1), t$1 = i$1 = 0, r$1 = e$1.length; t$1 < r$1; t$1++) s$1 = e$1[t$1], a.set(s$1, i$1), i$1 += s$1.length;
|
||
return a;
|
||
}
|
||
}, s = {
|
||
arraySet: function(e$1, t$1, r$1, n$1, i$1) {
|
||
for (var s$1 = 0; s$1 < n$1; s$1++) e$1[i$1 + s$1] = t$1[r$1 + s$1];
|
||
},
|
||
flattenChunks: function(e$1) {
|
||
return [].concat.apply([], e$1);
|
||
}
|
||
};
|
||
r.setTyped = function(e$1) {
|
||
e$1 ? (r.Buf8 = Uint8Array, r.Buf16 = Uint16Array, r.Buf32 = Int32Array, r.assign(r, i)) : (r.Buf8 = Array, r.Buf16 = Array, r.Buf32 = Array, r.assign(r, s));
|
||
}, r.setTyped(n);
|
||
}, {}],
|
||
42: [function(e, t, r) {
|
||
var h = e("./common"), i = !0, s = !0;
|
||
try {
|
||
String.fromCharCode.apply(null, [0]);
|
||
} catch (e$1) {
|
||
i = !1;
|
||
}
|
||
try {
|
||
String.fromCharCode.apply(null, new Uint8Array(1));
|
||
} catch (e$1) {
|
||
s = !1;
|
||
}
|
||
for (var u = new h.Buf8(256), n = 0; n < 256; n++) u[n] = 252 <= n ? 6 : 248 <= n ? 5 : 240 <= n ? 4 : 224 <= n ? 3 : 192 <= n ? 2 : 1;
|
||
function l(e$1, t$1) {
|
||
if (t$1 < 65537 && (e$1.subarray && s || !e$1.subarray && i)) return String.fromCharCode.apply(null, h.shrinkBuf(e$1, t$1));
|
||
for (var r$1 = "", n$1 = 0; n$1 < t$1; n$1++) r$1 += String.fromCharCode(e$1[n$1]);
|
||
return r$1;
|
||
}
|
||
u[254] = u[254] = 1, r.string2buf = function(e$1) {
|
||
var t$1, r$1, n$1, i$1, s$1, a = e$1.length, o = 0;
|
||
for (i$1 = 0; i$1 < a; i$1++) 55296 == (64512 & (r$1 = e$1.charCodeAt(i$1))) && i$1 + 1 < a && 56320 == (64512 & (n$1 = e$1.charCodeAt(i$1 + 1))) && (r$1 = 65536 + (r$1 - 55296 << 10) + (n$1 - 56320), i$1++), o += r$1 < 128 ? 1 : r$1 < 2048 ? 2 : r$1 < 65536 ? 3 : 4;
|
||
for (t$1 = new h.Buf8(o), i$1 = s$1 = 0; s$1 < o; i$1++) 55296 == (64512 & (r$1 = e$1.charCodeAt(i$1))) && i$1 + 1 < a && 56320 == (64512 & (n$1 = e$1.charCodeAt(i$1 + 1))) && (r$1 = 65536 + (r$1 - 55296 << 10) + (n$1 - 56320), i$1++), r$1 < 128 ? t$1[s$1++] = r$1 : (r$1 < 2048 ? t$1[s$1++] = 192 | r$1 >>> 6 : (r$1 < 65536 ? t$1[s$1++] = 224 | r$1 >>> 12 : (t$1[s$1++] = 240 | r$1 >>> 18, t$1[s$1++] = 128 | r$1 >>> 12 & 63), t$1[s$1++] = 128 | r$1 >>> 6 & 63), t$1[s$1++] = 128 | 63 & r$1);
|
||
return t$1;
|
||
}, r.buf2binstring = function(e$1) {
|
||
return l(e$1, e$1.length);
|
||
}, r.binstring2buf = function(e$1) {
|
||
for (var t$1 = new h.Buf8(e$1.length), r$1 = 0, n$1 = t$1.length; r$1 < n$1; r$1++) t$1[r$1] = e$1.charCodeAt(r$1);
|
||
return t$1;
|
||
}, r.buf2string = function(e$1, t$1) {
|
||
var r$1, n$1, i$1, s$1, a = t$1 || e$1.length, o = new Array(2 * a);
|
||
for (r$1 = n$1 = 0; r$1 < a;) if ((i$1 = e$1[r$1++]) < 128) o[n$1++] = i$1;
|
||
else if (4 < (s$1 = u[i$1])) o[n$1++] = 65533, r$1 += s$1 - 1;
|
||
else {
|
||
for (i$1 &= 2 === s$1 ? 31 : 3 === s$1 ? 15 : 7; 1 < s$1 && r$1 < a;) i$1 = i$1 << 6 | 63 & e$1[r$1++], s$1--;
|
||
1 < s$1 ? o[n$1++] = 65533 : i$1 < 65536 ? o[n$1++] = i$1 : (i$1 -= 65536, o[n$1++] = 55296 | i$1 >> 10 & 1023, o[n$1++] = 56320 | 1023 & i$1);
|
||
}
|
||
return l(o, n$1);
|
||
}, r.utf8border = function(e$1, t$1) {
|
||
var r$1;
|
||
for ((t$1 = t$1 || e$1.length) > e$1.length && (t$1 = e$1.length), r$1 = t$1 - 1; 0 <= r$1 && 128 == (192 & e$1[r$1]);) r$1--;
|
||
return r$1 < 0 ? t$1 : 0 === r$1 ? t$1 : r$1 + u[e$1[r$1]] > t$1 ? r$1 : t$1;
|
||
};
|
||
}, { "./common": 41 }],
|
||
43: [function(e, t, r) {
|
||
t.exports = function(e$1, t$1, r$1, n) {
|
||
for (var i = 65535 & e$1 | 0, s = e$1 >>> 16 & 65535 | 0, a = 0; 0 !== r$1;) {
|
||
for (r$1 -= a = 2e3 < r$1 ? 2e3 : r$1; s = s + (i = i + t$1[n++] | 0) | 0, --a;);
|
||
i %= 65521, s %= 65521;
|
||
}
|
||
return i | s << 16 | 0;
|
||
};
|
||
}, {}],
|
||
44: [function(e, t, r) {
|
||
t.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
|
||
};
|
||
}, {}],
|
||
45: [function(e, t, r) {
|
||
var o = function() {
|
||
for (var e$1, t$1 = [], r$1 = 0; r$1 < 256; r$1++) {
|
||
e$1 = r$1;
|
||
for (var n = 0; n < 8; n++) e$1 = 1 & e$1 ? 3988292384 ^ e$1 >>> 1 : e$1 >>> 1;
|
||
t$1[r$1] = e$1;
|
||
}
|
||
return t$1;
|
||
}();
|
||
t.exports = function(e$1, t$1, r$1, n) {
|
||
var i = o, s = n + r$1;
|
||
e$1 ^= -1;
|
||
for (var a = n; a < s; a++) e$1 = e$1 >>> 8 ^ i[255 & (e$1 ^ t$1[a])];
|
||
return -1 ^ e$1;
|
||
};
|
||
}, {}],
|
||
46: [function(e, t, r) {
|
||
var h, c = e("../utils/common"), u = e("./trees"), d = e("./adler32"), p = e("./crc32"), n = e("./messages"), l = 0, f = 4, m = 0, _ = -2, g = -1, b = 4, i = 2, v = 8, y = 9, s = 286, a = 30, o = 19, w = 2 * s + 1, k = 15, x = 3, S = 258, z = S + x + 1, C = 42, E = 113, A = 1, I = 2, O = 3, B = 4;
|
||
function R(e$1, t$1) {
|
||
return e$1.msg = n[t$1], t$1;
|
||
}
|
||
function T(e$1) {
|
||
return (e$1 << 1) - (4 < e$1 ? 9 : 0);
|
||
}
|
||
function D(e$1) {
|
||
for (var t$1 = e$1.length; 0 <= --t$1;) e$1[t$1] = 0;
|
||
}
|
||
function F(e$1) {
|
||
var t$1 = e$1.state, r$1 = t$1.pending;
|
||
r$1 > e$1.avail_out && (r$1 = e$1.avail_out), 0 !== r$1 && (c.arraySet(e$1.output, t$1.pending_buf, t$1.pending_out, r$1, e$1.next_out), e$1.next_out += r$1, t$1.pending_out += r$1, e$1.total_out += r$1, e$1.avail_out -= r$1, t$1.pending -= r$1, 0 === t$1.pending && (t$1.pending_out = 0));
|
||
}
|
||
function N(e$1, t$1) {
|
||
u._tr_flush_block(e$1, 0 <= e$1.block_start ? e$1.block_start : -1, e$1.strstart - e$1.block_start, t$1), e$1.block_start = e$1.strstart, F(e$1.strm);
|
||
}
|
||
function U(e$1, t$1) {
|
||
e$1.pending_buf[e$1.pending++] = t$1;
|
||
}
|
||
function P(e$1, t$1) {
|
||
e$1.pending_buf[e$1.pending++] = t$1 >>> 8 & 255, e$1.pending_buf[e$1.pending++] = 255 & t$1;
|
||
}
|
||
function L(e$1, t$1) {
|
||
var r$1, n$1, i$1 = e$1.max_chain_length, s$1 = e$1.strstart, a$1 = e$1.prev_length, o$1 = e$1.nice_match, h$1 = e$1.strstart > e$1.w_size - z ? e$1.strstart - (e$1.w_size - z) : 0, u$1 = e$1.window, l$1 = e$1.w_mask, f$1 = e$1.prev, c$1 = e$1.strstart + S, d$1 = u$1[s$1 + a$1 - 1], p$1 = u$1[s$1 + a$1];
|
||
e$1.prev_length >= e$1.good_match && (i$1 >>= 2), o$1 > e$1.lookahead && (o$1 = e$1.lookahead);
|
||
do
|
||
if (u$1[(r$1 = t$1) + a$1] === p$1 && u$1[r$1 + a$1 - 1] === d$1 && u$1[r$1] === u$1[s$1] && u$1[++r$1] === u$1[s$1 + 1]) {
|
||
s$1 += 2, r$1++;
|
||
do ;
|
||
while (u$1[++s$1] === u$1[++r$1] && u$1[++s$1] === u$1[++r$1] && u$1[++s$1] === u$1[++r$1] && u$1[++s$1] === u$1[++r$1] && u$1[++s$1] === u$1[++r$1] && u$1[++s$1] === u$1[++r$1] && u$1[++s$1] === u$1[++r$1] && u$1[++s$1] === u$1[++r$1] && s$1 < c$1);
|
||
if (n$1 = S - (c$1 - s$1), s$1 = c$1 - S, a$1 < n$1) {
|
||
if (e$1.match_start = t$1, o$1 <= (a$1 = n$1)) break;
|
||
d$1 = u$1[s$1 + a$1 - 1], p$1 = u$1[s$1 + a$1];
|
||
}
|
||
}
|
||
while ((t$1 = f$1[t$1 & l$1]) > h$1 && 0 != --i$1);
|
||
return a$1 <= e$1.lookahead ? a$1 : e$1.lookahead;
|
||
}
|
||
function j(e$1) {
|
||
var t$1, r$1, n$1, i$1, s$1, a$1, o$1, h$1, u$1, l$1, f$1 = e$1.w_size;
|
||
do {
|
||
if (i$1 = e$1.window_size - e$1.lookahead - e$1.strstart, e$1.strstart >= f$1 + (f$1 - z)) {
|
||
for (c.arraySet(e$1.window, e$1.window, f$1, f$1, 0), e$1.match_start -= f$1, e$1.strstart -= f$1, e$1.block_start -= f$1, t$1 = r$1 = e$1.hash_size; n$1 = e$1.head[--t$1], e$1.head[t$1] = f$1 <= n$1 ? n$1 - f$1 : 0, --r$1;);
|
||
for (t$1 = r$1 = f$1; n$1 = e$1.prev[--t$1], e$1.prev[t$1] = f$1 <= n$1 ? n$1 - f$1 : 0, --r$1;);
|
||
i$1 += f$1;
|
||
}
|
||
if (0 === e$1.strm.avail_in) break;
|
||
if (a$1 = e$1.strm, o$1 = e$1.window, h$1 = e$1.strstart + e$1.lookahead, u$1 = i$1, l$1 = void 0, l$1 = a$1.avail_in, u$1 < l$1 && (l$1 = u$1), r$1 = 0 === l$1 ? 0 : (a$1.avail_in -= l$1, c.arraySet(o$1, a$1.input, a$1.next_in, l$1, h$1), 1 === a$1.state.wrap ? a$1.adler = d(a$1.adler, o$1, l$1, h$1) : 2 === a$1.state.wrap && (a$1.adler = p(a$1.adler, o$1, l$1, h$1)), a$1.next_in += l$1, a$1.total_in += l$1, l$1), e$1.lookahead += r$1, e$1.lookahead + e$1.insert >= x) for (s$1 = e$1.strstart - e$1.insert, e$1.ins_h = e$1.window[s$1], e$1.ins_h = (e$1.ins_h << e$1.hash_shift ^ e$1.window[s$1 + 1]) & e$1.hash_mask; e$1.insert && (e$1.ins_h = (e$1.ins_h << e$1.hash_shift ^ e$1.window[s$1 + x - 1]) & e$1.hash_mask, e$1.prev[s$1 & e$1.w_mask] = e$1.head[e$1.ins_h], e$1.head[e$1.ins_h] = s$1, s$1++, e$1.insert--, !(e$1.lookahead + e$1.insert < x)););
|
||
} while (e$1.lookahead < z && 0 !== e$1.strm.avail_in);
|
||
}
|
||
function Z(e$1, t$1) {
|
||
for (var r$1, n$1;;) {
|
||
if (e$1.lookahead < z) {
|
||
if (j(e$1), e$1.lookahead < z && t$1 === l) return A;
|
||
if (0 === e$1.lookahead) break;
|
||
}
|
||
if (r$1 = 0, e$1.lookahead >= x && (e$1.ins_h = (e$1.ins_h << e$1.hash_shift ^ e$1.window[e$1.strstart + x - 1]) & e$1.hash_mask, r$1 = e$1.prev[e$1.strstart & e$1.w_mask] = e$1.head[e$1.ins_h], e$1.head[e$1.ins_h] = e$1.strstart), 0 !== r$1 && e$1.strstart - r$1 <= e$1.w_size - z && (e$1.match_length = L(e$1, r$1)), e$1.match_length >= x) if (n$1 = u._tr_tally(e$1, e$1.strstart - e$1.match_start, e$1.match_length - x), e$1.lookahead -= e$1.match_length, e$1.match_length <= e$1.max_lazy_match && e$1.lookahead >= x) {
|
||
for (e$1.match_length--; e$1.strstart++, e$1.ins_h = (e$1.ins_h << e$1.hash_shift ^ e$1.window[e$1.strstart + x - 1]) & e$1.hash_mask, r$1 = e$1.prev[e$1.strstart & e$1.w_mask] = e$1.head[e$1.ins_h], e$1.head[e$1.ins_h] = e$1.strstart, 0 != --e$1.match_length;);
|
||
e$1.strstart++;
|
||
} else e$1.strstart += e$1.match_length, e$1.match_length = 0, e$1.ins_h = e$1.window[e$1.strstart], e$1.ins_h = (e$1.ins_h << e$1.hash_shift ^ e$1.window[e$1.strstart + 1]) & e$1.hash_mask;
|
||
else n$1 = u._tr_tally(e$1, 0, e$1.window[e$1.strstart]), e$1.lookahead--, e$1.strstart++;
|
||
if (n$1 && (N(e$1, !1), 0 === e$1.strm.avail_out)) return A;
|
||
}
|
||
return e$1.insert = e$1.strstart < x - 1 ? e$1.strstart : x - 1, t$1 === f ? (N(e$1, !0), 0 === e$1.strm.avail_out ? O : B) : e$1.last_lit && (N(e$1, !1), 0 === e$1.strm.avail_out) ? A : I;
|
||
}
|
||
function W(e$1, t$1) {
|
||
for (var r$1, n$1, i$1;;) {
|
||
if (e$1.lookahead < z) {
|
||
if (j(e$1), e$1.lookahead < z && t$1 === l) return A;
|
||
if (0 === e$1.lookahead) break;
|
||
}
|
||
if (r$1 = 0, e$1.lookahead >= x && (e$1.ins_h = (e$1.ins_h << e$1.hash_shift ^ e$1.window[e$1.strstart + x - 1]) & e$1.hash_mask, r$1 = e$1.prev[e$1.strstart & e$1.w_mask] = e$1.head[e$1.ins_h], e$1.head[e$1.ins_h] = e$1.strstart), e$1.prev_length = e$1.match_length, e$1.prev_match = e$1.match_start, e$1.match_length = x - 1, 0 !== r$1 && e$1.prev_length < e$1.max_lazy_match && e$1.strstart - r$1 <= e$1.w_size - z && (e$1.match_length = L(e$1, r$1), e$1.match_length <= 5 && (1 === e$1.strategy || e$1.match_length === x && 4096 < e$1.strstart - e$1.match_start) && (e$1.match_length = x - 1)), e$1.prev_length >= x && e$1.match_length <= e$1.prev_length) {
|
||
for (i$1 = e$1.strstart + e$1.lookahead - x, n$1 = u._tr_tally(e$1, e$1.strstart - 1 - e$1.prev_match, e$1.prev_length - x), e$1.lookahead -= e$1.prev_length - 1, e$1.prev_length -= 2; ++e$1.strstart <= i$1 && (e$1.ins_h = (e$1.ins_h << e$1.hash_shift ^ e$1.window[e$1.strstart + x - 1]) & e$1.hash_mask, r$1 = e$1.prev[e$1.strstart & e$1.w_mask] = e$1.head[e$1.ins_h], e$1.head[e$1.ins_h] = e$1.strstart), 0 != --e$1.prev_length;);
|
||
if (e$1.match_available = 0, e$1.match_length = x - 1, e$1.strstart++, n$1 && (N(e$1, !1), 0 === e$1.strm.avail_out)) return A;
|
||
} else if (e$1.match_available) {
|
||
if ((n$1 = u._tr_tally(e$1, 0, e$1.window[e$1.strstart - 1])) && N(e$1, !1), e$1.strstart++, e$1.lookahead--, 0 === e$1.strm.avail_out) return A;
|
||
} else e$1.match_available = 1, e$1.strstart++, e$1.lookahead--;
|
||
}
|
||
return e$1.match_available && (n$1 = u._tr_tally(e$1, 0, e$1.window[e$1.strstart - 1]), e$1.match_available = 0), e$1.insert = e$1.strstart < x - 1 ? e$1.strstart : x - 1, t$1 === f ? (N(e$1, !0), 0 === e$1.strm.avail_out ? O : B) : e$1.last_lit && (N(e$1, !1), 0 === e$1.strm.avail_out) ? A : I;
|
||
}
|
||
function M(e$1, t$1, r$1, n$1, i$1) {
|
||
this.good_length = e$1, this.max_lazy = t$1, this.nice_length = r$1, this.max_chain = n$1, this.func = i$1;
|
||
}
|
||
function H() {
|
||
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 = v, 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 c.Buf16(2 * w), this.dyn_dtree = new c.Buf16(2 * (2 * a + 1)), this.bl_tree = new c.Buf16(2 * (2 * o + 1)), D(this.dyn_ltree), D(this.dyn_dtree), D(this.bl_tree), this.l_desc = null, this.d_desc = null, this.bl_desc = null, this.bl_count = new c.Buf16(k + 1), this.heap = new c.Buf16(2 * s + 1), D(this.heap), this.heap_len = 0, this.heap_max = 0, this.depth = new c.Buf16(2 * s + 1), D(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;
|
||
}
|
||
function G(e$1) {
|
||
var t$1;
|
||
return e$1 && e$1.state ? (e$1.total_in = e$1.total_out = 0, e$1.data_type = i, (t$1 = e$1.state).pending = 0, t$1.pending_out = 0, t$1.wrap < 0 && (t$1.wrap = -t$1.wrap), t$1.status = t$1.wrap ? C : E, e$1.adler = 2 === t$1.wrap ? 0 : 1, t$1.last_flush = l, u._tr_init(t$1), m) : R(e$1, _);
|
||
}
|
||
function K(e$1) {
|
||
var t$1 = G(e$1);
|
||
return t$1 === m && function(e$2) {
|
||
e$2.window_size = 2 * e$2.w_size, D(e$2.head), e$2.max_lazy_match = h[e$2.level].max_lazy, e$2.good_match = h[e$2.level].good_length, e$2.nice_match = h[e$2.level].nice_length, e$2.max_chain_length = h[e$2.level].max_chain, e$2.strstart = 0, e$2.block_start = 0, e$2.lookahead = 0, e$2.insert = 0, e$2.match_length = e$2.prev_length = x - 1, e$2.match_available = 0, e$2.ins_h = 0;
|
||
}(e$1.state), t$1;
|
||
}
|
||
function Y(e$1, t$1, r$1, n$1, i$1, s$1) {
|
||
if (!e$1) return _;
|
||
var a$1 = 1;
|
||
if (t$1 === g && (t$1 = 6), n$1 < 0 ? (a$1 = 0, n$1 = -n$1) : 15 < n$1 && (a$1 = 2, n$1 -= 16), i$1 < 1 || y < i$1 || r$1 !== v || n$1 < 8 || 15 < n$1 || t$1 < 0 || 9 < t$1 || s$1 < 0 || b < s$1) return R(e$1, _);
|
||
8 === n$1 && (n$1 = 9);
|
||
var o$1 = new H();
|
||
return (e$1.state = o$1).strm = e$1, o$1.wrap = a$1, o$1.gzhead = null, o$1.w_bits = n$1, o$1.w_size = 1 << o$1.w_bits, o$1.w_mask = o$1.w_size - 1, o$1.hash_bits = i$1 + 7, o$1.hash_size = 1 << o$1.hash_bits, o$1.hash_mask = o$1.hash_size - 1, o$1.hash_shift = ~~((o$1.hash_bits + x - 1) / x), o$1.window = new c.Buf8(2 * o$1.w_size), o$1.head = new c.Buf16(o$1.hash_size), o$1.prev = new c.Buf16(o$1.w_size), o$1.lit_bufsize = 1 << i$1 + 6, o$1.pending_buf_size = 4 * o$1.lit_bufsize, o$1.pending_buf = new c.Buf8(o$1.pending_buf_size), o$1.d_buf = 1 * o$1.lit_bufsize, o$1.l_buf = 3 * o$1.lit_bufsize, o$1.level = t$1, o$1.strategy = s$1, o$1.method = r$1, K(e$1);
|
||
}
|
||
h = [
|
||
new M(0, 0, 0, 0, function(e$1, t$1) {
|
||
var r$1 = 65535;
|
||
for (r$1 > e$1.pending_buf_size - 5 && (r$1 = e$1.pending_buf_size - 5);;) {
|
||
if (e$1.lookahead <= 1) {
|
||
if (j(e$1), 0 === e$1.lookahead && t$1 === l) return A;
|
||
if (0 === e$1.lookahead) break;
|
||
}
|
||
e$1.strstart += e$1.lookahead, e$1.lookahead = 0;
|
||
var n$1 = e$1.block_start + r$1;
|
||
if ((0 === e$1.strstart || e$1.strstart >= n$1) && (e$1.lookahead = e$1.strstart - n$1, e$1.strstart = n$1, N(e$1, !1), 0 === e$1.strm.avail_out)) return A;
|
||
if (e$1.strstart - e$1.block_start >= e$1.w_size - z && (N(e$1, !1), 0 === e$1.strm.avail_out)) return A;
|
||
}
|
||
return e$1.insert = 0, t$1 === f ? (N(e$1, !0), 0 === e$1.strm.avail_out ? O : B) : (e$1.strstart > e$1.block_start && (N(e$1, !1), e$1.strm.avail_out), A);
|
||
}),
|
||
new M(4, 4, 8, 4, Z),
|
||
new M(4, 5, 16, 8, Z),
|
||
new M(4, 6, 32, 32, Z),
|
||
new M(4, 4, 16, 16, W),
|
||
new M(8, 16, 32, 32, W),
|
||
new M(8, 16, 128, 128, W),
|
||
new M(8, 32, 128, 256, W),
|
||
new M(32, 128, 258, 1024, W),
|
||
new M(32, 258, 258, 4096, W)
|
||
], r.deflateInit = function(e$1, t$1) {
|
||
return Y(e$1, t$1, v, 15, 8, 0);
|
||
}, r.deflateInit2 = Y, r.deflateReset = K, r.deflateResetKeep = G, r.deflateSetHeader = function(e$1, t$1) {
|
||
return e$1 && e$1.state ? 2 !== e$1.state.wrap ? _ : (e$1.state.gzhead = t$1, m) : _;
|
||
}, r.deflate = function(e$1, t$1) {
|
||
var r$1, n$1, i$1, s$1;
|
||
if (!e$1 || !e$1.state || 5 < t$1 || t$1 < 0) return e$1 ? R(e$1, _) : _;
|
||
if (n$1 = e$1.state, !e$1.output || !e$1.input && 0 !== e$1.avail_in || 666 === n$1.status && t$1 !== f) return R(e$1, 0 === e$1.avail_out ? -5 : _);
|
||
if (n$1.strm = e$1, r$1 = n$1.last_flush, n$1.last_flush = t$1, n$1.status === C) if (2 === n$1.wrap) e$1.adler = 0, U(n$1, 31), U(n$1, 139), U(n$1, 8), n$1.gzhead ? (U(n$1, (n$1.gzhead.text ? 1 : 0) + (n$1.gzhead.hcrc ? 2 : 0) + (n$1.gzhead.extra ? 4 : 0) + (n$1.gzhead.name ? 8 : 0) + (n$1.gzhead.comment ? 16 : 0)), U(n$1, 255 & n$1.gzhead.time), U(n$1, n$1.gzhead.time >> 8 & 255), U(n$1, n$1.gzhead.time >> 16 & 255), U(n$1, n$1.gzhead.time >> 24 & 255), U(n$1, 9 === n$1.level ? 2 : 2 <= n$1.strategy || n$1.level < 2 ? 4 : 0), U(n$1, 255 & n$1.gzhead.os), n$1.gzhead.extra && n$1.gzhead.extra.length && (U(n$1, 255 & n$1.gzhead.extra.length), U(n$1, n$1.gzhead.extra.length >> 8 & 255)), n$1.gzhead.hcrc && (e$1.adler = p(e$1.adler, n$1.pending_buf, n$1.pending, 0)), n$1.gzindex = 0, n$1.status = 69) : (U(n$1, 0), U(n$1, 0), U(n$1, 0), U(n$1, 0), U(n$1, 0), U(n$1, 9 === n$1.level ? 2 : 2 <= n$1.strategy || n$1.level < 2 ? 4 : 0), U(n$1, 3), n$1.status = E);
|
||
else {
|
||
var a$1 = v + (n$1.w_bits - 8 << 4) << 8;
|
||
a$1 |= (2 <= n$1.strategy || n$1.level < 2 ? 0 : n$1.level < 6 ? 1 : 6 === n$1.level ? 2 : 3) << 6, 0 !== n$1.strstart && (a$1 |= 32), a$1 += 31 - a$1 % 31, n$1.status = E, P(n$1, a$1), 0 !== n$1.strstart && (P(n$1, e$1.adler >>> 16), P(n$1, 65535 & e$1.adler)), e$1.adler = 1;
|
||
}
|
||
if (69 === n$1.status) if (n$1.gzhead.extra) {
|
||
for (i$1 = n$1.pending; n$1.gzindex < (65535 & n$1.gzhead.extra.length) && (n$1.pending !== n$1.pending_buf_size || (n$1.gzhead.hcrc && n$1.pending > i$1 && (e$1.adler = p(e$1.adler, n$1.pending_buf, n$1.pending - i$1, i$1)), F(e$1), i$1 = n$1.pending, n$1.pending !== n$1.pending_buf_size));) U(n$1, 255 & n$1.gzhead.extra[n$1.gzindex]), n$1.gzindex++;
|
||
n$1.gzhead.hcrc && n$1.pending > i$1 && (e$1.adler = p(e$1.adler, n$1.pending_buf, n$1.pending - i$1, i$1)), n$1.gzindex === n$1.gzhead.extra.length && (n$1.gzindex = 0, n$1.status = 73);
|
||
} else n$1.status = 73;
|
||
if (73 === n$1.status) if (n$1.gzhead.name) {
|
||
i$1 = n$1.pending;
|
||
do {
|
||
if (n$1.pending === n$1.pending_buf_size && (n$1.gzhead.hcrc && n$1.pending > i$1 && (e$1.adler = p(e$1.adler, n$1.pending_buf, n$1.pending - i$1, i$1)), F(e$1), i$1 = n$1.pending, n$1.pending === n$1.pending_buf_size)) {
|
||
s$1 = 1;
|
||
break;
|
||
}
|
||
s$1 = n$1.gzindex < n$1.gzhead.name.length ? 255 & n$1.gzhead.name.charCodeAt(n$1.gzindex++) : 0, U(n$1, s$1);
|
||
} while (0 !== s$1);
|
||
n$1.gzhead.hcrc && n$1.pending > i$1 && (e$1.adler = p(e$1.adler, n$1.pending_buf, n$1.pending - i$1, i$1)), 0 === s$1 && (n$1.gzindex = 0, n$1.status = 91);
|
||
} else n$1.status = 91;
|
||
if (91 === n$1.status) if (n$1.gzhead.comment) {
|
||
i$1 = n$1.pending;
|
||
do {
|
||
if (n$1.pending === n$1.pending_buf_size && (n$1.gzhead.hcrc && n$1.pending > i$1 && (e$1.adler = p(e$1.adler, n$1.pending_buf, n$1.pending - i$1, i$1)), F(e$1), i$1 = n$1.pending, n$1.pending === n$1.pending_buf_size)) {
|
||
s$1 = 1;
|
||
break;
|
||
}
|
||
s$1 = n$1.gzindex < n$1.gzhead.comment.length ? 255 & n$1.gzhead.comment.charCodeAt(n$1.gzindex++) : 0, U(n$1, s$1);
|
||
} while (0 !== s$1);
|
||
n$1.gzhead.hcrc && n$1.pending > i$1 && (e$1.adler = p(e$1.adler, n$1.pending_buf, n$1.pending - i$1, i$1)), 0 === s$1 && (n$1.status = 103);
|
||
} else n$1.status = 103;
|
||
if (103 === n$1.status && (n$1.gzhead.hcrc ? (n$1.pending + 2 > n$1.pending_buf_size && F(e$1), n$1.pending + 2 <= n$1.pending_buf_size && (U(n$1, 255 & e$1.adler), U(n$1, e$1.adler >> 8 & 255), e$1.adler = 0, n$1.status = E)) : n$1.status = E), 0 !== n$1.pending) {
|
||
if (F(e$1), 0 === e$1.avail_out) return n$1.last_flush = -1, m;
|
||
} else if (0 === e$1.avail_in && T(t$1) <= T(r$1) && t$1 !== f) return R(e$1, -5);
|
||
if (666 === n$1.status && 0 !== e$1.avail_in) return R(e$1, -5);
|
||
if (0 !== e$1.avail_in || 0 !== n$1.lookahead || t$1 !== l && 666 !== n$1.status) {
|
||
var o$1 = 2 === n$1.strategy ? function(e$2, t$2) {
|
||
for (var r$2;;) {
|
||
if (0 === e$2.lookahead && (j(e$2), 0 === e$2.lookahead)) {
|
||
if (t$2 === l) return A;
|
||
break;
|
||
}
|
||
if (e$2.match_length = 0, r$2 = u._tr_tally(e$2, 0, e$2.window[e$2.strstart]), e$2.lookahead--, e$2.strstart++, r$2 && (N(e$2, !1), 0 === e$2.strm.avail_out)) return A;
|
||
}
|
||
return e$2.insert = 0, t$2 === f ? (N(e$2, !0), 0 === e$2.strm.avail_out ? O : B) : e$2.last_lit && (N(e$2, !1), 0 === e$2.strm.avail_out) ? A : I;
|
||
}(n$1, t$1) : 3 === n$1.strategy ? function(e$2, t$2) {
|
||
for (var r$2, n$2, i$2, s$2, a$2 = e$2.window;;) {
|
||
if (e$2.lookahead <= S) {
|
||
if (j(e$2), e$2.lookahead <= S && t$2 === l) return A;
|
||
if (0 === e$2.lookahead) break;
|
||
}
|
||
if (e$2.match_length = 0, e$2.lookahead >= x && 0 < e$2.strstart && (n$2 = a$2[i$2 = e$2.strstart - 1]) === a$2[++i$2] && n$2 === a$2[++i$2] && n$2 === a$2[++i$2]) {
|
||
s$2 = e$2.strstart + S;
|
||
do ;
|
||
while (n$2 === a$2[++i$2] && n$2 === a$2[++i$2] && n$2 === a$2[++i$2] && n$2 === a$2[++i$2] && n$2 === a$2[++i$2] && n$2 === a$2[++i$2] && n$2 === a$2[++i$2] && n$2 === a$2[++i$2] && i$2 < s$2);
|
||
e$2.match_length = S - (s$2 - i$2), e$2.match_length > e$2.lookahead && (e$2.match_length = e$2.lookahead);
|
||
}
|
||
if (e$2.match_length >= x ? (r$2 = u._tr_tally(e$2, 1, e$2.match_length - x), e$2.lookahead -= e$2.match_length, e$2.strstart += e$2.match_length, e$2.match_length = 0) : (r$2 = u._tr_tally(e$2, 0, e$2.window[e$2.strstart]), e$2.lookahead--, e$2.strstart++), r$2 && (N(e$2, !1), 0 === e$2.strm.avail_out)) return A;
|
||
}
|
||
return e$2.insert = 0, t$2 === f ? (N(e$2, !0), 0 === e$2.strm.avail_out ? O : B) : e$2.last_lit && (N(e$2, !1), 0 === e$2.strm.avail_out) ? A : I;
|
||
}(n$1, t$1) : h[n$1.level].func(n$1, t$1);
|
||
if (o$1 !== O && o$1 !== B || (n$1.status = 666), o$1 === A || o$1 === O) return 0 === e$1.avail_out && (n$1.last_flush = -1), m;
|
||
if (o$1 === I && (1 === t$1 ? u._tr_align(n$1) : 5 !== t$1 && (u._tr_stored_block(n$1, 0, 0, !1), 3 === t$1 && (D(n$1.head), 0 === n$1.lookahead && (n$1.strstart = 0, n$1.block_start = 0, n$1.insert = 0))), F(e$1), 0 === e$1.avail_out)) return n$1.last_flush = -1, m;
|
||
}
|
||
return t$1 !== f ? m : n$1.wrap <= 0 ? 1 : (2 === n$1.wrap ? (U(n$1, 255 & e$1.adler), U(n$1, e$1.adler >> 8 & 255), U(n$1, e$1.adler >> 16 & 255), U(n$1, e$1.adler >> 24 & 255), U(n$1, 255 & e$1.total_in), U(n$1, e$1.total_in >> 8 & 255), U(n$1, e$1.total_in >> 16 & 255), U(n$1, e$1.total_in >> 24 & 255)) : (P(n$1, e$1.adler >>> 16), P(n$1, 65535 & e$1.adler)), F(e$1), 0 < n$1.wrap && (n$1.wrap = -n$1.wrap), 0 !== n$1.pending ? m : 1);
|
||
}, r.deflateEnd = function(e$1) {
|
||
var t$1;
|
||
return e$1 && e$1.state ? (t$1 = e$1.state.status) !== C && 69 !== t$1 && 73 !== t$1 && 91 !== t$1 && 103 !== t$1 && t$1 !== E && 666 !== t$1 ? R(e$1, _) : (e$1.state = null, t$1 === E ? R(e$1, -3) : m) : _;
|
||
}, r.deflateSetDictionary = function(e$1, t$1) {
|
||
var r$1, n$1, i$1, s$1, a$1, o$1, h$1, u$1, l$1 = t$1.length;
|
||
if (!e$1 || !e$1.state) return _;
|
||
if (2 === (s$1 = (r$1 = e$1.state).wrap) || 1 === s$1 && r$1.status !== C || r$1.lookahead) return _;
|
||
for (1 === s$1 && (e$1.adler = d(e$1.adler, t$1, l$1, 0)), r$1.wrap = 0, l$1 >= r$1.w_size && (0 === s$1 && (D(r$1.head), r$1.strstart = 0, r$1.block_start = 0, r$1.insert = 0), u$1 = new c.Buf8(r$1.w_size), c.arraySet(u$1, t$1, l$1 - r$1.w_size, r$1.w_size, 0), t$1 = u$1, l$1 = r$1.w_size), a$1 = e$1.avail_in, o$1 = e$1.next_in, h$1 = e$1.input, e$1.avail_in = l$1, e$1.next_in = 0, e$1.input = t$1, j(r$1); r$1.lookahead >= x;) {
|
||
for (n$1 = r$1.strstart, i$1 = r$1.lookahead - (x - 1); r$1.ins_h = (r$1.ins_h << r$1.hash_shift ^ r$1.window[n$1 + x - 1]) & r$1.hash_mask, r$1.prev[n$1 & r$1.w_mask] = r$1.head[r$1.ins_h], r$1.head[r$1.ins_h] = n$1, n$1++, --i$1;);
|
||
r$1.strstart = n$1, r$1.lookahead = x - 1, j(r$1);
|
||
}
|
||
return r$1.strstart += r$1.lookahead, r$1.block_start = r$1.strstart, r$1.insert = r$1.lookahead, r$1.lookahead = 0, r$1.match_length = r$1.prev_length = x - 1, r$1.match_available = 0, e$1.next_in = o$1, e$1.input = h$1, e$1.avail_in = a$1, r$1.wrap = s$1, m;
|
||
}, r.deflateInfo = "pako deflate (from Nodeca project)";
|
||
}, {
|
||
"../utils/common": 41,
|
||
"./adler32": 43,
|
||
"./crc32": 45,
|
||
"./messages": 51,
|
||
"./trees": 52
|
||
}],
|
||
47: [function(e, t, r) {
|
||
t.exports = function() {
|
||
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;
|
||
};
|
||
}, {}],
|
||
48: [function(e, t, r) {
|
||
t.exports = function(e$1, t$1) {
|
||
var r$1 = e$1.state, n = e$1.next_in, i, s, a, o, h, u, l, f, c, d, p, m, _, g, b, v, y, w, k, x, S, z = e$1.input, C;
|
||
i = n + (e$1.avail_in - 5), s = e$1.next_out, C = e$1.output, a = s - (t$1 - e$1.avail_out), o = s + (e$1.avail_out - 257), h = r$1.dmax, u = r$1.wsize, l = r$1.whave, f = r$1.wnext, c = r$1.window, d = r$1.hold, p = r$1.bits, m = r$1.lencode, _ = r$1.distcode, g = (1 << r$1.lenbits) - 1, b = (1 << r$1.distbits) - 1;
|
||
e: do {
|
||
p < 15 && (d += z[n++] << p, p += 8, d += z[n++] << p, p += 8), v = m[d & g];
|
||
t: for (;;) {
|
||
if (d >>>= y = v >>> 24, p -= y, 0 === (y = v >>> 16 & 255)) C[s++] = 65535 & v;
|
||
else {
|
||
if (!(16 & y)) {
|
||
if (0 == (64 & y)) {
|
||
v = m[(65535 & v) + (d & (1 << y) - 1)];
|
||
continue t;
|
||
}
|
||
if (32 & y) {
|
||
r$1.mode = 12;
|
||
break e;
|
||
}
|
||
e$1.msg = "invalid literal/length code", r$1.mode = 30;
|
||
break e;
|
||
}
|
||
w = 65535 & v, (y &= 15) && (p < y && (d += z[n++] << p, p += 8), w += d & (1 << y) - 1, d >>>= y, p -= y), p < 15 && (d += z[n++] << p, p += 8, d += z[n++] << p, p += 8), v = _[d & b];
|
||
r: for (;;) {
|
||
if (d >>>= y = v >>> 24, p -= y, !(16 & (y = v >>> 16 & 255))) {
|
||
if (0 == (64 & y)) {
|
||
v = _[(65535 & v) + (d & (1 << y) - 1)];
|
||
continue r;
|
||
}
|
||
e$1.msg = "invalid distance code", r$1.mode = 30;
|
||
break e;
|
||
}
|
||
if (k = 65535 & v, p < (y &= 15) && (d += z[n++] << p, (p += 8) < y && (d += z[n++] << p, p += 8)), h < (k += d & (1 << y) - 1)) {
|
||
e$1.msg = "invalid distance too far back", r$1.mode = 30;
|
||
break e;
|
||
}
|
||
if (d >>>= y, p -= y, (y = s - a) < k) {
|
||
if (l < (y = k - y) && r$1.sane) {
|
||
e$1.msg = "invalid distance too far back", r$1.mode = 30;
|
||
break e;
|
||
}
|
||
if (S = c, (x = 0) === f) {
|
||
if (x += u - y, y < w) {
|
||
for (w -= y; C[s++] = c[x++], --y;);
|
||
x = s - k, S = C;
|
||
}
|
||
} else if (f < y) {
|
||
if (x += u + f - y, (y -= f) < w) {
|
||
for (w -= y; C[s++] = c[x++], --y;);
|
||
if (x = 0, f < w) {
|
||
for (w -= y = f; C[s++] = c[x++], --y;);
|
||
x = s - k, S = C;
|
||
}
|
||
}
|
||
} else if (x += f - y, y < w) {
|
||
for (w -= y; C[s++] = c[x++], --y;);
|
||
x = s - k, S = C;
|
||
}
|
||
for (; 2 < w;) C[s++] = S[x++], C[s++] = S[x++], C[s++] = S[x++], w -= 3;
|
||
w && (C[s++] = S[x++], 1 < w && (C[s++] = S[x++]));
|
||
} else {
|
||
for (x = s - k; C[s++] = C[x++], C[s++] = C[x++], C[s++] = C[x++], 2 < (w -= 3););
|
||
w && (C[s++] = C[x++], 1 < w && (C[s++] = C[x++]));
|
||
}
|
||
break;
|
||
}
|
||
}
|
||
break;
|
||
}
|
||
} while (n < i && s < o);
|
||
n -= w = p >> 3, d &= (1 << (p -= w << 3)) - 1, e$1.next_in = n, e$1.next_out = s, e$1.avail_in = n < i ? i - n + 5 : 5 - (n - i), e$1.avail_out = s < o ? o - s + 257 : 257 - (s - o), r$1.hold = d, r$1.bits = p;
|
||
};
|
||
}, {}],
|
||
49: [function(e, t, r) {
|
||
var I = e("../utils/common"), O = e("./adler32"), B = e("./crc32"), R = e("./inffast"), T = e("./inftrees"), D = 1, F = 2, N = 0, U = -2, P = 1, n = 852, i = 592;
|
||
function L(e$1) {
|
||
return (e$1 >>> 24 & 255) + (e$1 >>> 8 & 65280) + ((65280 & e$1) << 8) + ((255 & e$1) << 24);
|
||
}
|
||
function s() {
|
||
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 I.Buf16(320), this.work = new I.Buf16(288), this.lendyn = null, this.distdyn = null, this.sane = 0, this.back = 0, this.was = 0;
|
||
}
|
||
function a(e$1) {
|
||
var t$1;
|
||
return e$1 && e$1.state ? (t$1 = e$1.state, e$1.total_in = e$1.total_out = t$1.total = 0, e$1.msg = "", t$1.wrap && (e$1.adler = 1 & t$1.wrap), t$1.mode = P, t$1.last = 0, t$1.havedict = 0, t$1.dmax = 32768, t$1.head = null, t$1.hold = 0, t$1.bits = 0, t$1.lencode = t$1.lendyn = new I.Buf32(n), t$1.distcode = t$1.distdyn = new I.Buf32(i), t$1.sane = 1, t$1.back = -1, N) : U;
|
||
}
|
||
function o(e$1) {
|
||
var t$1;
|
||
return e$1 && e$1.state ? ((t$1 = e$1.state).wsize = 0, t$1.whave = 0, t$1.wnext = 0, a(e$1)) : U;
|
||
}
|
||
function h(e$1, t$1) {
|
||
var r$1, n$1;
|
||
return e$1 && e$1.state ? (n$1 = e$1.state, t$1 < 0 ? (r$1 = 0, t$1 = -t$1) : (r$1 = 1 + (t$1 >> 4), t$1 < 48 && (t$1 &= 15)), t$1 && (t$1 < 8 || 15 < t$1) ? U : (null !== n$1.window && n$1.wbits !== t$1 && (n$1.window = null), n$1.wrap = r$1, n$1.wbits = t$1, o(e$1))) : U;
|
||
}
|
||
function u(e$1, t$1) {
|
||
var r$1, n$1;
|
||
return e$1 ? (n$1 = new s(), (e$1.state = n$1).window = null, (r$1 = h(e$1, t$1)) !== N && (e$1.state = null), r$1) : U;
|
||
}
|
||
var l, f, c = !0;
|
||
function j(e$1) {
|
||
if (c) {
|
||
var t$1;
|
||
for (l = new I.Buf32(512), f = new I.Buf32(32), t$1 = 0; t$1 < 144;) e$1.lens[t$1++] = 8;
|
||
for (; t$1 < 256;) e$1.lens[t$1++] = 9;
|
||
for (; t$1 < 280;) e$1.lens[t$1++] = 7;
|
||
for (; t$1 < 288;) e$1.lens[t$1++] = 8;
|
||
for (T(D, e$1.lens, 0, 288, l, 0, e$1.work, { bits: 9 }), t$1 = 0; t$1 < 32;) e$1.lens[t$1++] = 5;
|
||
T(F, e$1.lens, 0, 32, f, 0, e$1.work, { bits: 5 }), c = !1;
|
||
}
|
||
e$1.lencode = l, e$1.lenbits = 9, e$1.distcode = f, e$1.distbits = 5;
|
||
}
|
||
function Z(e$1, t$1, r$1, n$1) {
|
||
var i$1, s$1 = e$1.state;
|
||
return null === s$1.window && (s$1.wsize = 1 << s$1.wbits, s$1.wnext = 0, s$1.whave = 0, s$1.window = new I.Buf8(s$1.wsize)), n$1 >= s$1.wsize ? (I.arraySet(s$1.window, t$1, r$1 - s$1.wsize, s$1.wsize, 0), s$1.wnext = 0, s$1.whave = s$1.wsize) : (n$1 < (i$1 = s$1.wsize - s$1.wnext) && (i$1 = n$1), I.arraySet(s$1.window, t$1, r$1 - n$1, i$1, s$1.wnext), (n$1 -= i$1) ? (I.arraySet(s$1.window, t$1, r$1 - n$1, n$1, 0), s$1.wnext = n$1, s$1.whave = s$1.wsize) : (s$1.wnext += i$1, s$1.wnext === s$1.wsize && (s$1.wnext = 0), s$1.whave < s$1.wsize && (s$1.whave += i$1))), 0;
|
||
}
|
||
r.inflateReset = o, r.inflateReset2 = h, r.inflateResetKeep = a, r.inflateInit = function(e$1) {
|
||
return u(e$1, 15);
|
||
}, r.inflateInit2 = u, r.inflate = function(e$1, t$1) {
|
||
var r$1, n$1, i$1, s$1, a$1, o$1, h$1, u$1, l$1, f$1, c$1, d, p, m, _, g, b, v, y, w, k, x, S, z, C = 0, E = new I.Buf8(4), A = [
|
||
16,
|
||
17,
|
||
18,
|
||
0,
|
||
8,
|
||
7,
|
||
9,
|
||
6,
|
||
10,
|
||
5,
|
||
11,
|
||
4,
|
||
12,
|
||
3,
|
||
13,
|
||
2,
|
||
14,
|
||
1,
|
||
15
|
||
];
|
||
if (!e$1 || !e$1.state || !e$1.output || !e$1.input && 0 !== e$1.avail_in) return U;
|
||
12 === (r$1 = e$1.state).mode && (r$1.mode = 13), a$1 = e$1.next_out, i$1 = e$1.output, h$1 = e$1.avail_out, s$1 = e$1.next_in, n$1 = e$1.input, o$1 = e$1.avail_in, u$1 = r$1.hold, l$1 = r$1.bits, f$1 = o$1, c$1 = h$1, x = N;
|
||
e: for (;;) switch (r$1.mode) {
|
||
case P:
|
||
if (0 === r$1.wrap) {
|
||
r$1.mode = 13;
|
||
break;
|
||
}
|
||
for (; l$1 < 16;) {
|
||
if (0 === o$1) break e;
|
||
o$1--, u$1 += n$1[s$1++] << l$1, l$1 += 8;
|
||
}
|
||
if (2 & r$1.wrap && 35615 === u$1) {
|
||
E[r$1.check = 0] = 255 & u$1, E[1] = u$1 >>> 8 & 255, r$1.check = B(r$1.check, E, 2, 0), l$1 = u$1 = 0, r$1.mode = 2;
|
||
break;
|
||
}
|
||
if (r$1.flags = 0, r$1.head && (r$1.head.done = !1), !(1 & r$1.wrap) || (((255 & u$1) << 8) + (u$1 >> 8)) % 31) {
|
||
e$1.msg = "incorrect header check", r$1.mode = 30;
|
||
break;
|
||
}
|
||
if (8 != (15 & u$1)) {
|
||
e$1.msg = "unknown compression method", r$1.mode = 30;
|
||
break;
|
||
}
|
||
if (l$1 -= 4, k = 8 + (15 & (u$1 >>>= 4)), 0 === r$1.wbits) r$1.wbits = k;
|
||
else if (k > r$1.wbits) {
|
||
e$1.msg = "invalid window size", r$1.mode = 30;
|
||
break;
|
||
}
|
||
r$1.dmax = 1 << k, e$1.adler = r$1.check = 1, r$1.mode = 512 & u$1 ? 10 : 12, l$1 = u$1 = 0;
|
||
break;
|
||
case 2:
|
||
for (; l$1 < 16;) {
|
||
if (0 === o$1) break e;
|
||
o$1--, u$1 += n$1[s$1++] << l$1, l$1 += 8;
|
||
}
|
||
if (r$1.flags = u$1, 8 != (255 & r$1.flags)) {
|
||
e$1.msg = "unknown compression method", r$1.mode = 30;
|
||
break;
|
||
}
|
||
if (57344 & r$1.flags) {
|
||
e$1.msg = "unknown header flags set", r$1.mode = 30;
|
||
break;
|
||
}
|
||
r$1.head && (r$1.head.text = u$1 >> 8 & 1), 512 & r$1.flags && (E[0] = 255 & u$1, E[1] = u$1 >>> 8 & 255, r$1.check = B(r$1.check, E, 2, 0)), l$1 = u$1 = 0, r$1.mode = 3;
|
||
case 3:
|
||
for (; l$1 < 32;) {
|
||
if (0 === o$1) break e;
|
||
o$1--, u$1 += n$1[s$1++] << l$1, l$1 += 8;
|
||
}
|
||
r$1.head && (r$1.head.time = u$1), 512 & r$1.flags && (E[0] = 255 & u$1, E[1] = u$1 >>> 8 & 255, E[2] = u$1 >>> 16 & 255, E[3] = u$1 >>> 24 & 255, r$1.check = B(r$1.check, E, 4, 0)), l$1 = u$1 = 0, r$1.mode = 4;
|
||
case 4:
|
||
for (; l$1 < 16;) {
|
||
if (0 === o$1) break e;
|
||
o$1--, u$1 += n$1[s$1++] << l$1, l$1 += 8;
|
||
}
|
||
r$1.head && (r$1.head.xflags = 255 & u$1, r$1.head.os = u$1 >> 8), 512 & r$1.flags && (E[0] = 255 & u$1, E[1] = u$1 >>> 8 & 255, r$1.check = B(r$1.check, E, 2, 0)), l$1 = u$1 = 0, r$1.mode = 5;
|
||
case 5:
|
||
if (1024 & r$1.flags) {
|
||
for (; l$1 < 16;) {
|
||
if (0 === o$1) break e;
|
||
o$1--, u$1 += n$1[s$1++] << l$1, l$1 += 8;
|
||
}
|
||
r$1.length = u$1, r$1.head && (r$1.head.extra_len = u$1), 512 & r$1.flags && (E[0] = 255 & u$1, E[1] = u$1 >>> 8 & 255, r$1.check = B(r$1.check, E, 2, 0)), l$1 = u$1 = 0;
|
||
} else r$1.head && (r$1.head.extra = null);
|
||
r$1.mode = 6;
|
||
case 6:
|
||
if (1024 & r$1.flags && (o$1 < (d = r$1.length) && (d = o$1), d && (r$1.head && (k = r$1.head.extra_len - r$1.length, r$1.head.extra || (r$1.head.extra = new Array(r$1.head.extra_len)), I.arraySet(r$1.head.extra, n$1, s$1, d, k)), 512 & r$1.flags && (r$1.check = B(r$1.check, n$1, d, s$1)), o$1 -= d, s$1 += d, r$1.length -= d), r$1.length)) break e;
|
||
r$1.length = 0, r$1.mode = 7;
|
||
case 7:
|
||
if (2048 & r$1.flags) {
|
||
if (0 === o$1) break e;
|
||
for (d = 0; k = n$1[s$1 + d++], r$1.head && k && r$1.length < 65536 && (r$1.head.name += String.fromCharCode(k)), k && d < o$1;);
|
||
if (512 & r$1.flags && (r$1.check = B(r$1.check, n$1, d, s$1)), o$1 -= d, s$1 += d, k) break e;
|
||
} else r$1.head && (r$1.head.name = null);
|
||
r$1.length = 0, r$1.mode = 8;
|
||
case 8:
|
||
if (4096 & r$1.flags) {
|
||
if (0 === o$1) break e;
|
||
for (d = 0; k = n$1[s$1 + d++], r$1.head && k && r$1.length < 65536 && (r$1.head.comment += String.fromCharCode(k)), k && d < o$1;);
|
||
if (512 & r$1.flags && (r$1.check = B(r$1.check, n$1, d, s$1)), o$1 -= d, s$1 += d, k) break e;
|
||
} else r$1.head && (r$1.head.comment = null);
|
||
r$1.mode = 9;
|
||
case 9:
|
||
if (512 & r$1.flags) {
|
||
for (; l$1 < 16;) {
|
||
if (0 === o$1) break e;
|
||
o$1--, u$1 += n$1[s$1++] << l$1, l$1 += 8;
|
||
}
|
||
if (u$1 !== (65535 & r$1.check)) {
|
||
e$1.msg = "header crc mismatch", r$1.mode = 30;
|
||
break;
|
||
}
|
||
l$1 = u$1 = 0;
|
||
}
|
||
r$1.head && (r$1.head.hcrc = r$1.flags >> 9 & 1, r$1.head.done = !0), e$1.adler = r$1.check = 0, r$1.mode = 12;
|
||
break;
|
||
case 10:
|
||
for (; l$1 < 32;) {
|
||
if (0 === o$1) break e;
|
||
o$1--, u$1 += n$1[s$1++] << l$1, l$1 += 8;
|
||
}
|
||
e$1.adler = r$1.check = L(u$1), l$1 = u$1 = 0, r$1.mode = 11;
|
||
case 11:
|
||
if (0 === r$1.havedict) return e$1.next_out = a$1, e$1.avail_out = h$1, e$1.next_in = s$1, e$1.avail_in = o$1, r$1.hold = u$1, r$1.bits = l$1, 2;
|
||
e$1.adler = r$1.check = 1, r$1.mode = 12;
|
||
case 12: if (5 === t$1 || 6 === t$1) break e;
|
||
case 13:
|
||
if (r$1.last) {
|
||
u$1 >>>= 7 & l$1, l$1 -= 7 & l$1, r$1.mode = 27;
|
||
break;
|
||
}
|
||
for (; l$1 < 3;) {
|
||
if (0 === o$1) break e;
|
||
o$1--, u$1 += n$1[s$1++] << l$1, l$1 += 8;
|
||
}
|
||
switch (r$1.last = 1 & u$1, l$1 -= 1, 3 & (u$1 >>>= 1)) {
|
||
case 0:
|
||
r$1.mode = 14;
|
||
break;
|
||
case 1:
|
||
if (j(r$1), r$1.mode = 20, 6 !== t$1) break;
|
||
u$1 >>>= 2, l$1 -= 2;
|
||
break e;
|
||
case 2:
|
||
r$1.mode = 17;
|
||
break;
|
||
case 3: e$1.msg = "invalid block type", r$1.mode = 30;
|
||
}
|
||
u$1 >>>= 2, l$1 -= 2;
|
||
break;
|
||
case 14:
|
||
for (u$1 >>>= 7 & l$1, l$1 -= 7 & l$1; l$1 < 32;) {
|
||
if (0 === o$1) break e;
|
||
o$1--, u$1 += n$1[s$1++] << l$1, l$1 += 8;
|
||
}
|
||
if ((65535 & u$1) != (u$1 >>> 16 ^ 65535)) {
|
||
e$1.msg = "invalid stored block lengths", r$1.mode = 30;
|
||
break;
|
||
}
|
||
if (r$1.length = 65535 & u$1, l$1 = u$1 = 0, r$1.mode = 15, 6 === t$1) break e;
|
||
case 15: r$1.mode = 16;
|
||
case 16:
|
||
if (d = r$1.length) {
|
||
if (o$1 < d && (d = o$1), h$1 < d && (d = h$1), 0 === d) break e;
|
||
I.arraySet(i$1, n$1, s$1, d, a$1), o$1 -= d, s$1 += d, h$1 -= d, a$1 += d, r$1.length -= d;
|
||
break;
|
||
}
|
||
r$1.mode = 12;
|
||
break;
|
||
case 17:
|
||
for (; l$1 < 14;) {
|
||
if (0 === o$1) break e;
|
||
o$1--, u$1 += n$1[s$1++] << l$1, l$1 += 8;
|
||
}
|
||
if (r$1.nlen = 257 + (31 & u$1), u$1 >>>= 5, l$1 -= 5, r$1.ndist = 1 + (31 & u$1), u$1 >>>= 5, l$1 -= 5, r$1.ncode = 4 + (15 & u$1), u$1 >>>= 4, l$1 -= 4, 286 < r$1.nlen || 30 < r$1.ndist) {
|
||
e$1.msg = "too many length or distance symbols", r$1.mode = 30;
|
||
break;
|
||
}
|
||
r$1.have = 0, r$1.mode = 18;
|
||
case 18:
|
||
for (; r$1.have < r$1.ncode;) {
|
||
for (; l$1 < 3;) {
|
||
if (0 === o$1) break e;
|
||
o$1--, u$1 += n$1[s$1++] << l$1, l$1 += 8;
|
||
}
|
||
r$1.lens[A[r$1.have++]] = 7 & u$1, u$1 >>>= 3, l$1 -= 3;
|
||
}
|
||
for (; r$1.have < 19;) r$1.lens[A[r$1.have++]] = 0;
|
||
if (r$1.lencode = r$1.lendyn, r$1.lenbits = 7, S = { bits: r$1.lenbits }, x = T(0, r$1.lens, 0, 19, r$1.lencode, 0, r$1.work, S), r$1.lenbits = S.bits, x) {
|
||
e$1.msg = "invalid code lengths set", r$1.mode = 30;
|
||
break;
|
||
}
|
||
r$1.have = 0, r$1.mode = 19;
|
||
case 19:
|
||
for (; r$1.have < r$1.nlen + r$1.ndist;) {
|
||
for (; g = (C = r$1.lencode[u$1 & (1 << r$1.lenbits) - 1]) >>> 16 & 255, b = 65535 & C, !((_ = C >>> 24) <= l$1);) {
|
||
if (0 === o$1) break e;
|
||
o$1--, u$1 += n$1[s$1++] << l$1, l$1 += 8;
|
||
}
|
||
if (b < 16) u$1 >>>= _, l$1 -= _, r$1.lens[r$1.have++] = b;
|
||
else {
|
||
if (16 === b) {
|
||
for (z = _ + 2; l$1 < z;) {
|
||
if (0 === o$1) break e;
|
||
o$1--, u$1 += n$1[s$1++] << l$1, l$1 += 8;
|
||
}
|
||
if (u$1 >>>= _, l$1 -= _, 0 === r$1.have) {
|
||
e$1.msg = "invalid bit length repeat", r$1.mode = 30;
|
||
break;
|
||
}
|
||
k = r$1.lens[r$1.have - 1], d = 3 + (3 & u$1), u$1 >>>= 2, l$1 -= 2;
|
||
} else if (17 === b) {
|
||
for (z = _ + 3; l$1 < z;) {
|
||
if (0 === o$1) break e;
|
||
o$1--, u$1 += n$1[s$1++] << l$1, l$1 += 8;
|
||
}
|
||
l$1 -= _, k = 0, d = 3 + (7 & (u$1 >>>= _)), u$1 >>>= 3, l$1 -= 3;
|
||
} else {
|
||
for (z = _ + 7; l$1 < z;) {
|
||
if (0 === o$1) break e;
|
||
o$1--, u$1 += n$1[s$1++] << l$1, l$1 += 8;
|
||
}
|
||
l$1 -= _, k = 0, d = 11 + (127 & (u$1 >>>= _)), u$1 >>>= 7, l$1 -= 7;
|
||
}
|
||
if (r$1.have + d > r$1.nlen + r$1.ndist) {
|
||
e$1.msg = "invalid bit length repeat", r$1.mode = 30;
|
||
break;
|
||
}
|
||
for (; d--;) r$1.lens[r$1.have++] = k;
|
||
}
|
||
}
|
||
if (30 === r$1.mode) break;
|
||
if (0 === r$1.lens[256]) {
|
||
e$1.msg = "invalid code -- missing end-of-block", r$1.mode = 30;
|
||
break;
|
||
}
|
||
if (r$1.lenbits = 9, S = { bits: r$1.lenbits }, x = T(D, r$1.lens, 0, r$1.nlen, r$1.lencode, 0, r$1.work, S), r$1.lenbits = S.bits, x) {
|
||
e$1.msg = "invalid literal/lengths set", r$1.mode = 30;
|
||
break;
|
||
}
|
||
if (r$1.distbits = 6, r$1.distcode = r$1.distdyn, S = { bits: r$1.distbits }, x = T(F, r$1.lens, r$1.nlen, r$1.ndist, r$1.distcode, 0, r$1.work, S), r$1.distbits = S.bits, x) {
|
||
e$1.msg = "invalid distances set", r$1.mode = 30;
|
||
break;
|
||
}
|
||
if (r$1.mode = 20, 6 === t$1) break e;
|
||
case 20: r$1.mode = 21;
|
||
case 21:
|
||
if (6 <= o$1 && 258 <= h$1) {
|
||
e$1.next_out = a$1, e$1.avail_out = h$1, e$1.next_in = s$1, e$1.avail_in = o$1, r$1.hold = u$1, r$1.bits = l$1, R(e$1, c$1), a$1 = e$1.next_out, i$1 = e$1.output, h$1 = e$1.avail_out, s$1 = e$1.next_in, n$1 = e$1.input, o$1 = e$1.avail_in, u$1 = r$1.hold, l$1 = r$1.bits, 12 === r$1.mode && (r$1.back = -1);
|
||
break;
|
||
}
|
||
for (r$1.back = 0; g = (C = r$1.lencode[u$1 & (1 << r$1.lenbits) - 1]) >>> 16 & 255, b = 65535 & C, !((_ = C >>> 24) <= l$1);) {
|
||
if (0 === o$1) break e;
|
||
o$1--, u$1 += n$1[s$1++] << l$1, l$1 += 8;
|
||
}
|
||
if (g && 0 == (240 & g)) {
|
||
for (v = _, y = g, w = b; g = (C = r$1.lencode[w + ((u$1 & (1 << v + y) - 1) >> v)]) >>> 16 & 255, b = 65535 & C, !(v + (_ = C >>> 24) <= l$1);) {
|
||
if (0 === o$1) break e;
|
||
o$1--, u$1 += n$1[s$1++] << l$1, l$1 += 8;
|
||
}
|
||
u$1 >>>= v, l$1 -= v, r$1.back += v;
|
||
}
|
||
if (u$1 >>>= _, l$1 -= _, r$1.back += _, r$1.length = b, 0 === g) {
|
||
r$1.mode = 26;
|
||
break;
|
||
}
|
||
if (32 & g) {
|
||
r$1.back = -1, r$1.mode = 12;
|
||
break;
|
||
}
|
||
if (64 & g) {
|
||
e$1.msg = "invalid literal/length code", r$1.mode = 30;
|
||
break;
|
||
}
|
||
r$1.extra = 15 & g, r$1.mode = 22;
|
||
case 22:
|
||
if (r$1.extra) {
|
||
for (z = r$1.extra; l$1 < z;) {
|
||
if (0 === o$1) break e;
|
||
o$1--, u$1 += n$1[s$1++] << l$1, l$1 += 8;
|
||
}
|
||
r$1.length += u$1 & (1 << r$1.extra) - 1, u$1 >>>= r$1.extra, l$1 -= r$1.extra, r$1.back += r$1.extra;
|
||
}
|
||
r$1.was = r$1.length, r$1.mode = 23;
|
||
case 23:
|
||
for (; g = (C = r$1.distcode[u$1 & (1 << r$1.distbits) - 1]) >>> 16 & 255, b = 65535 & C, !((_ = C >>> 24) <= l$1);) {
|
||
if (0 === o$1) break e;
|
||
o$1--, u$1 += n$1[s$1++] << l$1, l$1 += 8;
|
||
}
|
||
if (0 == (240 & g)) {
|
||
for (v = _, y = g, w = b; g = (C = r$1.distcode[w + ((u$1 & (1 << v + y) - 1) >> v)]) >>> 16 & 255, b = 65535 & C, !(v + (_ = C >>> 24) <= l$1);) {
|
||
if (0 === o$1) break e;
|
||
o$1--, u$1 += n$1[s$1++] << l$1, l$1 += 8;
|
||
}
|
||
u$1 >>>= v, l$1 -= v, r$1.back += v;
|
||
}
|
||
if (u$1 >>>= _, l$1 -= _, r$1.back += _, 64 & g) {
|
||
e$1.msg = "invalid distance code", r$1.mode = 30;
|
||
break;
|
||
}
|
||
r$1.offset = b, r$1.extra = 15 & g, r$1.mode = 24;
|
||
case 24:
|
||
if (r$1.extra) {
|
||
for (z = r$1.extra; l$1 < z;) {
|
||
if (0 === o$1) break e;
|
||
o$1--, u$1 += n$1[s$1++] << l$1, l$1 += 8;
|
||
}
|
||
r$1.offset += u$1 & (1 << r$1.extra) - 1, u$1 >>>= r$1.extra, l$1 -= r$1.extra, r$1.back += r$1.extra;
|
||
}
|
||
if (r$1.offset > r$1.dmax) {
|
||
e$1.msg = "invalid distance too far back", r$1.mode = 30;
|
||
break;
|
||
}
|
||
r$1.mode = 25;
|
||
case 25:
|
||
if (0 === h$1) break e;
|
||
if (d = c$1 - h$1, r$1.offset > d) {
|
||
if ((d = r$1.offset - d) > r$1.whave && r$1.sane) {
|
||
e$1.msg = "invalid distance too far back", r$1.mode = 30;
|
||
break;
|
||
}
|
||
p = d > r$1.wnext ? (d -= r$1.wnext, r$1.wsize - d) : r$1.wnext - d, d > r$1.length && (d = r$1.length), m = r$1.window;
|
||
} else m = i$1, p = a$1 - r$1.offset, d = r$1.length;
|
||
for (h$1 < d && (d = h$1), h$1 -= d, r$1.length -= d; i$1[a$1++] = m[p++], --d;);
|
||
0 === r$1.length && (r$1.mode = 21);
|
||
break;
|
||
case 26:
|
||
if (0 === h$1) break e;
|
||
i$1[a$1++] = r$1.length, h$1--, r$1.mode = 21;
|
||
break;
|
||
case 27:
|
||
if (r$1.wrap) {
|
||
for (; l$1 < 32;) {
|
||
if (0 === o$1) break e;
|
||
o$1--, u$1 |= n$1[s$1++] << l$1, l$1 += 8;
|
||
}
|
||
if (c$1 -= h$1, e$1.total_out += c$1, r$1.total += c$1, c$1 && (e$1.adler = r$1.check = r$1.flags ? B(r$1.check, i$1, c$1, a$1 - c$1) : O(r$1.check, i$1, c$1, a$1 - c$1)), c$1 = h$1, (r$1.flags ? u$1 : L(u$1)) !== r$1.check) {
|
||
e$1.msg = "incorrect data check", r$1.mode = 30;
|
||
break;
|
||
}
|
||
l$1 = u$1 = 0;
|
||
}
|
||
r$1.mode = 28;
|
||
case 28:
|
||
if (r$1.wrap && r$1.flags) {
|
||
for (; l$1 < 32;) {
|
||
if (0 === o$1) break e;
|
||
o$1--, u$1 += n$1[s$1++] << l$1, l$1 += 8;
|
||
}
|
||
if (u$1 !== (4294967295 & r$1.total)) {
|
||
e$1.msg = "incorrect length check", r$1.mode = 30;
|
||
break;
|
||
}
|
||
l$1 = u$1 = 0;
|
||
}
|
||
r$1.mode = 29;
|
||
case 29:
|
||
x = 1;
|
||
break e;
|
||
case 30:
|
||
x = -3;
|
||
break e;
|
||
case 31: return -4;
|
||
case 32:
|
||
default: return U;
|
||
}
|
||
return e$1.next_out = a$1, e$1.avail_out = h$1, e$1.next_in = s$1, e$1.avail_in = o$1, r$1.hold = u$1, r$1.bits = l$1, (r$1.wsize || c$1 !== e$1.avail_out && r$1.mode < 30 && (r$1.mode < 27 || 4 !== t$1)) && Z(e$1, e$1.output, e$1.next_out, c$1 - e$1.avail_out) ? (r$1.mode = 31, -4) : (f$1 -= e$1.avail_in, c$1 -= e$1.avail_out, e$1.total_in += f$1, e$1.total_out += c$1, r$1.total += c$1, r$1.wrap && c$1 && (e$1.adler = r$1.check = r$1.flags ? B(r$1.check, i$1, c$1, e$1.next_out - c$1) : O(r$1.check, i$1, c$1, e$1.next_out - c$1)), e$1.data_type = r$1.bits + (r$1.last ? 64 : 0) + (12 === r$1.mode ? 128 : 0) + (20 === r$1.mode || 15 === r$1.mode ? 256 : 0), (0 == f$1 && 0 === c$1 || 4 === t$1) && x === N && (x = -5), x);
|
||
}, r.inflateEnd = function(e$1) {
|
||
if (!e$1 || !e$1.state) return U;
|
||
var t$1 = e$1.state;
|
||
return t$1.window && (t$1.window = null), e$1.state = null, N;
|
||
}, r.inflateGetHeader = function(e$1, t$1) {
|
||
var r$1;
|
||
return e$1 && e$1.state ? 0 == (2 & (r$1 = e$1.state).wrap) ? U : ((r$1.head = t$1).done = !1, N) : U;
|
||
}, r.inflateSetDictionary = function(e$1, t$1) {
|
||
var r$1, n$1 = t$1.length;
|
||
return e$1 && e$1.state ? 0 !== (r$1 = e$1.state).wrap && 11 !== r$1.mode ? U : 11 === r$1.mode && O(1, t$1, n$1, 0) !== r$1.check ? -3 : Z(e$1, t$1, n$1, n$1) ? (r$1.mode = 31, -4) : (r$1.havedict = 1, N) : U;
|
||
}, r.inflateInfo = "pako inflate (from Nodeca project)";
|
||
}, {
|
||
"../utils/common": 41,
|
||
"./adler32": 43,
|
||
"./crc32": 45,
|
||
"./inffast": 48,
|
||
"./inftrees": 50
|
||
}],
|
||
50: [function(e, t, r) {
|
||
var D = e("../utils/common"), F = [
|
||
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
|
||
], P = [
|
||
16,
|
||
16,
|
||
16,
|
||
16,
|
||
17,
|
||
17,
|
||
18,
|
||
18,
|
||
19,
|
||
19,
|
||
20,
|
||
20,
|
||
21,
|
||
21,
|
||
22,
|
||
22,
|
||
23,
|
||
23,
|
||
24,
|
||
24,
|
||
25,
|
||
25,
|
||
26,
|
||
26,
|
||
27,
|
||
27,
|
||
28,
|
||
28,
|
||
29,
|
||
29,
|
||
64,
|
||
64
|
||
];
|
||
t.exports = function(e$1, t$1, r$1, n, i, s, a, o) {
|
||
var h, u, l, f, c, d, p, m, _, g = o.bits, b = 0, v = 0, y = 0, w = 0, k = 0, x = 0, S = 0, z = 0, C = 0, E = 0, A = null, I = 0, O = new D.Buf16(16), B = new D.Buf16(16), R = null, T = 0;
|
||
for (b = 0; b <= 15; b++) O[b] = 0;
|
||
for (v = 0; v < n; v++) O[t$1[r$1 + v]]++;
|
||
for (k = g, w = 15; 1 <= w && 0 === O[w]; w--);
|
||
if (w < k && (k = w), 0 === w) return i[s++] = 20971520, i[s++] = 20971520, o.bits = 1, 0;
|
||
for (y = 1; y < w && 0 === O[y]; y++);
|
||
for (k < y && (k = y), b = z = 1; b <= 15; b++) if (z <<= 1, (z -= O[b]) < 0) return -1;
|
||
if (0 < z && (0 === e$1 || 1 !== w)) return -1;
|
||
for (B[1] = 0, b = 1; b < 15; b++) B[b + 1] = B[b] + O[b];
|
||
for (v = 0; v < n; v++) 0 !== t$1[r$1 + v] && (a[B[t$1[r$1 + v]]++] = v);
|
||
if (d = 0 === e$1 ? (A = R = a, 19) : 1 === e$1 ? (A = F, I -= 257, R = N, T -= 257, 256) : (A = U, R = P, -1), b = y, c = s, S = v = E = 0, l = -1, f = (C = 1 << (x = k)) - 1, 1 === e$1 && 852 < C || 2 === e$1 && 592 < C) return 1;
|
||
for (;;) {
|
||
for (p = b - S, _ = a[v] < d ? (m = 0, a[v]) : a[v] > d ? (m = R[T + a[v]], A[I + a[v]]) : (m = 96, 0), h = 1 << b - S, y = u = 1 << x; i[c + (E >> S) + (u -= h)] = p << 24 | m << 16 | _ | 0, 0 !== u;);
|
||
for (h = 1 << b - 1; E & h;) h >>= 1;
|
||
if (0 !== h ? (E &= h - 1, E += h) : E = 0, v++, 0 == --O[b]) {
|
||
if (b === w) break;
|
||
b = t$1[r$1 + a[v]];
|
||
}
|
||
if (k < b && (E & f) !== l) {
|
||
for (0 === S && (S = k), c += y, z = 1 << (x = b - S); x + S < w && !((z -= O[x + S]) <= 0);) x++, z <<= 1;
|
||
if (C += 1 << x, 1 === e$1 && 852 < C || 2 === e$1 && 592 < C) return 1;
|
||
i[l = E & f] = k << 24 | x << 16 | c - s | 0;
|
||
}
|
||
}
|
||
return 0 !== E && (i[c + E] = b - S << 24 | 4194304), o.bits = k, 0;
|
||
};
|
||
}, { "../utils/common": 41 }],
|
||
51: [function(e, t, r) {
|
||
t.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"
|
||
};
|
||
}, {}],
|
||
52: [function(e, t, r) {
|
||
var i = e("../utils/common"), o = 0, h = 1;
|
||
function n(e$1) {
|
||
for (var t$1 = e$1.length; 0 <= --t$1;) e$1[t$1] = 0;
|
||
}
|
||
var s = 0, a = 29, u = 256, l = u + 1 + a, f = 30, c = 19, _ = 2 * l + 1, g = 15, d = 16, p = 7, m = 256, b = 16, v = 17, y = 18, w = [
|
||
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
|
||
], k = [
|
||
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
|
||
], x = [
|
||
0,
|
||
0,
|
||
0,
|
||
0,
|
||
0,
|
||
0,
|
||
0,
|
||
0,
|
||
0,
|
||
0,
|
||
0,
|
||
0,
|
||
0,
|
||
0,
|
||
0,
|
||
0,
|
||
2,
|
||
3,
|
||
7
|
||
], S = [
|
||
16,
|
||
17,
|
||
18,
|
||
0,
|
||
8,
|
||
7,
|
||
9,
|
||
6,
|
||
10,
|
||
5,
|
||
11,
|
||
4,
|
||
12,
|
||
3,
|
||
13,
|
||
2,
|
||
14,
|
||
1,
|
||
15
|
||
], z = new Array(2 * (l + 2));
|
||
n(z);
|
||
var C = new Array(2 * f);
|
||
n(C);
|
||
var E = new Array(512);
|
||
n(E);
|
||
var A = new Array(256);
|
||
n(A);
|
||
var I = new Array(a);
|
||
n(I);
|
||
var O, B, R, T = new Array(f);
|
||
function D(e$1, t$1, r$1, n$1, i$1) {
|
||
this.static_tree = e$1, this.extra_bits = t$1, this.extra_base = r$1, this.elems = n$1, this.max_length = i$1, this.has_stree = e$1 && e$1.length;
|
||
}
|
||
function F(e$1, t$1) {
|
||
this.dyn_tree = e$1, this.max_code = 0, this.stat_desc = t$1;
|
||
}
|
||
function N(e$1) {
|
||
return e$1 < 256 ? E[e$1] : E[256 + (e$1 >>> 7)];
|
||
}
|
||
function U(e$1, t$1) {
|
||
e$1.pending_buf[e$1.pending++] = 255 & t$1, e$1.pending_buf[e$1.pending++] = t$1 >>> 8 & 255;
|
||
}
|
||
function P(e$1, t$1, r$1) {
|
||
e$1.bi_valid > d - r$1 ? (e$1.bi_buf |= t$1 << e$1.bi_valid & 65535, U(e$1, e$1.bi_buf), e$1.bi_buf = t$1 >> d - e$1.bi_valid, e$1.bi_valid += r$1 - d) : (e$1.bi_buf |= t$1 << e$1.bi_valid & 65535, e$1.bi_valid += r$1);
|
||
}
|
||
function L(e$1, t$1, r$1) {
|
||
P(e$1, r$1[2 * t$1], r$1[2 * t$1 + 1]);
|
||
}
|
||
function j(e$1, t$1) {
|
||
for (var r$1 = 0; r$1 |= 1 & e$1, e$1 >>>= 1, r$1 <<= 1, 0 < --t$1;);
|
||
return r$1 >>> 1;
|
||
}
|
||
function Z(e$1, t$1, r$1) {
|
||
var n$1, i$1, s$1 = new Array(g + 1), a$1 = 0;
|
||
for (n$1 = 1; n$1 <= g; n$1++) s$1[n$1] = a$1 = a$1 + r$1[n$1 - 1] << 1;
|
||
for (i$1 = 0; i$1 <= t$1; i$1++) {
|
||
var o$1 = e$1[2 * i$1 + 1];
|
||
0 !== o$1 && (e$1[2 * i$1] = j(s$1[o$1]++, o$1));
|
||
}
|
||
}
|
||
function W(e$1) {
|
||
var t$1;
|
||
for (t$1 = 0; t$1 < l; t$1++) e$1.dyn_ltree[2 * t$1] = 0;
|
||
for (t$1 = 0; t$1 < f; t$1++) e$1.dyn_dtree[2 * t$1] = 0;
|
||
for (t$1 = 0; t$1 < c; t$1++) e$1.bl_tree[2 * t$1] = 0;
|
||
e$1.dyn_ltree[2 * m] = 1, e$1.opt_len = e$1.static_len = 0, e$1.last_lit = e$1.matches = 0;
|
||
}
|
||
function M(e$1) {
|
||
8 < e$1.bi_valid ? U(e$1, e$1.bi_buf) : 0 < e$1.bi_valid && (e$1.pending_buf[e$1.pending++] = e$1.bi_buf), e$1.bi_buf = 0, e$1.bi_valid = 0;
|
||
}
|
||
function H(e$1, t$1, r$1, n$1) {
|
||
var i$1 = 2 * t$1, s$1 = 2 * r$1;
|
||
return e$1[i$1] < e$1[s$1] || e$1[i$1] === e$1[s$1] && n$1[t$1] <= n$1[r$1];
|
||
}
|
||
function G(e$1, t$1, r$1) {
|
||
for (var n$1 = e$1.heap[r$1], i$1 = r$1 << 1; i$1 <= e$1.heap_len && (i$1 < e$1.heap_len && H(t$1, e$1.heap[i$1 + 1], e$1.heap[i$1], e$1.depth) && i$1++, !H(t$1, n$1, e$1.heap[i$1], e$1.depth));) e$1.heap[r$1] = e$1.heap[i$1], r$1 = i$1, i$1 <<= 1;
|
||
e$1.heap[r$1] = n$1;
|
||
}
|
||
function K(e$1, t$1, r$1) {
|
||
var n$1, i$1, s$1, a$1, o$1 = 0;
|
||
if (0 !== e$1.last_lit) for (; n$1 = e$1.pending_buf[e$1.d_buf + 2 * o$1] << 8 | e$1.pending_buf[e$1.d_buf + 2 * o$1 + 1], i$1 = e$1.pending_buf[e$1.l_buf + o$1], o$1++, 0 === n$1 ? L(e$1, i$1, t$1) : (L(e$1, (s$1 = A[i$1]) + u + 1, t$1), 0 !== (a$1 = w[s$1]) && P(e$1, i$1 -= I[s$1], a$1), L(e$1, s$1 = N(--n$1), r$1), 0 !== (a$1 = k[s$1]) && P(e$1, n$1 -= T[s$1], a$1)), o$1 < e$1.last_lit;);
|
||
L(e$1, m, t$1);
|
||
}
|
||
function Y(e$1, t$1) {
|
||
var r$1, n$1, i$1, s$1 = t$1.dyn_tree, a$1 = t$1.stat_desc.static_tree, o$1 = t$1.stat_desc.has_stree, h$1 = t$1.stat_desc.elems, u$1 = -1;
|
||
for (e$1.heap_len = 0, e$1.heap_max = _, r$1 = 0; r$1 < h$1; r$1++) 0 !== s$1[2 * r$1] ? (e$1.heap[++e$1.heap_len] = u$1 = r$1, e$1.depth[r$1] = 0) : s$1[2 * r$1 + 1] = 0;
|
||
for (; e$1.heap_len < 2;) s$1[2 * (i$1 = e$1.heap[++e$1.heap_len] = u$1 < 2 ? ++u$1 : 0)] = 1, e$1.depth[i$1] = 0, e$1.opt_len--, o$1 && (e$1.static_len -= a$1[2 * i$1 + 1]);
|
||
for (t$1.max_code = u$1, r$1 = e$1.heap_len >> 1; 1 <= r$1; r$1--) G(e$1, s$1, r$1);
|
||
for (i$1 = h$1; r$1 = e$1.heap[1], e$1.heap[1] = e$1.heap[e$1.heap_len--], G(e$1, s$1, 1), n$1 = e$1.heap[1], e$1.heap[--e$1.heap_max] = r$1, e$1.heap[--e$1.heap_max] = n$1, s$1[2 * i$1] = s$1[2 * r$1] + s$1[2 * n$1], e$1.depth[i$1] = (e$1.depth[r$1] >= e$1.depth[n$1] ? e$1.depth[r$1] : e$1.depth[n$1]) + 1, s$1[2 * r$1 + 1] = s$1[2 * n$1 + 1] = i$1, e$1.heap[1] = i$1++, G(e$1, s$1, 1), 2 <= e$1.heap_len;);
|
||
e$1.heap[--e$1.heap_max] = e$1.heap[1], function(e$2, t$2) {
|
||
var r$2, n$2, i$2, s$2, a$2, o$2, h$2 = t$2.dyn_tree, u$2 = t$2.max_code, l$1 = t$2.stat_desc.static_tree, f$1 = t$2.stat_desc.has_stree, c$1 = t$2.stat_desc.extra_bits, d$1 = t$2.stat_desc.extra_base, p$1 = t$2.stat_desc.max_length, m$1 = 0;
|
||
for (s$2 = 0; s$2 <= g; s$2++) e$2.bl_count[s$2] = 0;
|
||
for (h$2[2 * e$2.heap[e$2.heap_max] + 1] = 0, r$2 = e$2.heap_max + 1; r$2 < _; r$2++) p$1 < (s$2 = h$2[2 * h$2[2 * (n$2 = e$2.heap[r$2]) + 1] + 1] + 1) && (s$2 = p$1, m$1++), h$2[2 * n$2 + 1] = s$2, u$2 < n$2 || (e$2.bl_count[s$2]++, a$2 = 0, d$1 <= n$2 && (a$2 = c$1[n$2 - d$1]), o$2 = h$2[2 * n$2], e$2.opt_len += o$2 * (s$2 + a$2), f$1 && (e$2.static_len += o$2 * (l$1[2 * n$2 + 1] + a$2)));
|
||
if (0 !== m$1) {
|
||
do {
|
||
for (s$2 = p$1 - 1; 0 === e$2.bl_count[s$2];) s$2--;
|
||
e$2.bl_count[s$2]--, e$2.bl_count[s$2 + 1] += 2, e$2.bl_count[p$1]--, m$1 -= 2;
|
||
} while (0 < m$1);
|
||
for (s$2 = p$1; 0 !== s$2; s$2--) for (n$2 = e$2.bl_count[s$2]; 0 !== n$2;) u$2 < (i$2 = e$2.heap[--r$2]) || (h$2[2 * i$2 + 1] !== s$2 && (e$2.opt_len += (s$2 - h$2[2 * i$2 + 1]) * h$2[2 * i$2], h$2[2 * i$2 + 1] = s$2), n$2--);
|
||
}
|
||
}(e$1, t$1), Z(s$1, u$1, e$1.bl_count);
|
||
}
|
||
function X(e$1, t$1, r$1) {
|
||
var n$1, i$1, s$1 = -1, a$1 = t$1[1], o$1 = 0, h$1 = 7, u$1 = 4;
|
||
for (0 === a$1 && (h$1 = 138, u$1 = 3), t$1[2 * (r$1 + 1) + 1] = 65535, n$1 = 0; n$1 <= r$1; n$1++) i$1 = a$1, a$1 = t$1[2 * (n$1 + 1) + 1], ++o$1 < h$1 && i$1 === a$1 || (o$1 < u$1 ? e$1.bl_tree[2 * i$1] += o$1 : 0 !== i$1 ? (i$1 !== s$1 && e$1.bl_tree[2 * i$1]++, e$1.bl_tree[2 * b]++) : o$1 <= 10 ? e$1.bl_tree[2 * v]++ : e$1.bl_tree[2 * y]++, s$1 = i$1, u$1 = (o$1 = 0) === a$1 ? (h$1 = 138, 3) : i$1 === a$1 ? (h$1 = 6, 3) : (h$1 = 7, 4));
|
||
}
|
||
function V(e$1, t$1, r$1) {
|
||
var n$1, i$1, s$1 = -1, a$1 = t$1[1], o$1 = 0, h$1 = 7, u$1 = 4;
|
||
for (0 === a$1 && (h$1 = 138, u$1 = 3), n$1 = 0; n$1 <= r$1; n$1++) if (i$1 = a$1, a$1 = t$1[2 * (n$1 + 1) + 1], !(++o$1 < h$1 && i$1 === a$1)) {
|
||
if (o$1 < u$1) for (; L(e$1, i$1, e$1.bl_tree), 0 != --o$1;);
|
||
else 0 !== i$1 ? (i$1 !== s$1 && (L(e$1, i$1, e$1.bl_tree), o$1--), L(e$1, b, e$1.bl_tree), P(e$1, o$1 - 3, 2)) : o$1 <= 10 ? (L(e$1, v, e$1.bl_tree), P(e$1, o$1 - 3, 3)) : (L(e$1, y, e$1.bl_tree), P(e$1, o$1 - 11, 7));
|
||
s$1 = i$1, u$1 = (o$1 = 0) === a$1 ? (h$1 = 138, 3) : i$1 === a$1 ? (h$1 = 6, 3) : (h$1 = 7, 4);
|
||
}
|
||
}
|
||
n(T);
|
||
var q = !1;
|
||
function J(e$1, t$1, r$1, n$1) {
|
||
P(e$1, (s << 1) + (n$1 ? 1 : 0), 3), function(e$2, t$2, r$2, n$2) {
|
||
M(e$2), n$2 && (U(e$2, r$2), U(e$2, ~r$2)), i.arraySet(e$2.pending_buf, e$2.window, t$2, r$2, e$2.pending), e$2.pending += r$2;
|
||
}(e$1, t$1, r$1, !0);
|
||
}
|
||
r._tr_init = function(e$1) {
|
||
q || (function() {
|
||
var e$2, t$1, r$1, n$1, i$1, s$1 = new Array(g + 1);
|
||
for (n$1 = r$1 = 0; n$1 < a - 1; n$1++) for (I[n$1] = r$1, e$2 = 0; e$2 < 1 << w[n$1]; e$2++) A[r$1++] = n$1;
|
||
for (A[r$1 - 1] = n$1, n$1 = i$1 = 0; n$1 < 16; n$1++) for (T[n$1] = i$1, e$2 = 0; e$2 < 1 << k[n$1]; e$2++) E[i$1++] = n$1;
|
||
for (i$1 >>= 7; n$1 < f; n$1++) for (T[n$1] = i$1 << 7, e$2 = 0; e$2 < 1 << k[n$1] - 7; e$2++) E[256 + i$1++] = n$1;
|
||
for (t$1 = 0; t$1 <= g; t$1++) s$1[t$1] = 0;
|
||
for (e$2 = 0; e$2 <= 143;) z[2 * e$2 + 1] = 8, e$2++, s$1[8]++;
|
||
for (; e$2 <= 255;) z[2 * e$2 + 1] = 9, e$2++, s$1[9]++;
|
||
for (; e$2 <= 279;) z[2 * e$2 + 1] = 7, e$2++, s$1[7]++;
|
||
for (; e$2 <= 287;) z[2 * e$2 + 1] = 8, e$2++, s$1[8]++;
|
||
for (Z(z, l + 1, s$1), e$2 = 0; e$2 < f; e$2++) C[2 * e$2 + 1] = 5, C[2 * e$2] = j(e$2, 5);
|
||
O = new D(z, w, u + 1, l, g), B = new D(C, k, 0, f, g), R = new D(new Array(0), x, 0, c, p);
|
||
}(), q = !0), e$1.l_desc = new F(e$1.dyn_ltree, O), e$1.d_desc = new F(e$1.dyn_dtree, B), e$1.bl_desc = new F(e$1.bl_tree, R), e$1.bi_buf = 0, e$1.bi_valid = 0, W(e$1);
|
||
}, r._tr_stored_block = J, r._tr_flush_block = function(e$1, t$1, r$1, n$1) {
|
||
var i$1, s$1, a$1 = 0;
|
||
0 < e$1.level ? (2 === e$1.strm.data_type && (e$1.strm.data_type = function(e$2) {
|
||
var t$2, r$2 = 4093624447;
|
||
for (t$2 = 0; t$2 <= 31; t$2++, r$2 >>>= 1) if (1 & r$2 && 0 !== e$2.dyn_ltree[2 * t$2]) return o;
|
||
if (0 !== e$2.dyn_ltree[18] || 0 !== e$2.dyn_ltree[20] || 0 !== e$2.dyn_ltree[26]) return h;
|
||
for (t$2 = 32; t$2 < u; t$2++) if (0 !== e$2.dyn_ltree[2 * t$2]) return h;
|
||
return o;
|
||
}(e$1)), Y(e$1, e$1.l_desc), Y(e$1, e$1.d_desc), a$1 = function(e$2) {
|
||
var t$2;
|
||
for (X(e$2, e$2.dyn_ltree, e$2.l_desc.max_code), X(e$2, e$2.dyn_dtree, e$2.d_desc.max_code), Y(e$2, e$2.bl_desc), t$2 = c - 1; 3 <= t$2 && 0 === e$2.bl_tree[2 * S[t$2] + 1]; t$2--);
|
||
return e$2.opt_len += 3 * (t$2 + 1) + 5 + 5 + 4, t$2;
|
||
}(e$1), i$1 = e$1.opt_len + 3 + 7 >>> 3, (s$1 = e$1.static_len + 3 + 7 >>> 3) <= i$1 && (i$1 = s$1)) : i$1 = s$1 = r$1 + 5, r$1 + 4 <= i$1 && -1 !== t$1 ? J(e$1, t$1, r$1, n$1) : 4 === e$1.strategy || s$1 === i$1 ? (P(e$1, 2 + (n$1 ? 1 : 0), 3), K(e$1, z, C)) : (P(e$1, 4 + (n$1 ? 1 : 0), 3), function(e$2, t$2, r$2, n$2) {
|
||
var i$2;
|
||
for (P(e$2, t$2 - 257, 5), P(e$2, r$2 - 1, 5), P(e$2, n$2 - 4, 4), i$2 = 0; i$2 < n$2; i$2++) P(e$2, e$2.bl_tree[2 * S[i$2] + 1], 3);
|
||
V(e$2, e$2.dyn_ltree, t$2 - 1), V(e$2, e$2.dyn_dtree, r$2 - 1);
|
||
}(e$1, e$1.l_desc.max_code + 1, e$1.d_desc.max_code + 1, a$1 + 1), K(e$1, e$1.dyn_ltree, e$1.dyn_dtree)), W(e$1), n$1 && M(e$1);
|
||
}, r._tr_tally = function(e$1, t$1, r$1) {
|
||
return e$1.pending_buf[e$1.d_buf + 2 * e$1.last_lit] = t$1 >>> 8 & 255, e$1.pending_buf[e$1.d_buf + 2 * e$1.last_lit + 1] = 255 & t$1, e$1.pending_buf[e$1.l_buf + e$1.last_lit] = 255 & r$1, e$1.last_lit++, 0 === t$1 ? e$1.dyn_ltree[2 * r$1]++ : (e$1.matches++, t$1--, e$1.dyn_ltree[2 * (A[r$1] + u + 1)]++, e$1.dyn_dtree[2 * N(t$1)]++), e$1.last_lit === e$1.lit_bufsize - 1;
|
||
}, r._tr_align = function(e$1) {
|
||
P(e$1, 2, 3), L(e$1, m, z), function(e$2) {
|
||
16 === e$2.bi_valid ? (U(e$2, e$2.bi_buf), e$2.bi_buf = 0, e$2.bi_valid = 0) : 8 <= e$2.bi_valid && (e$2.pending_buf[e$2.pending++] = 255 & e$2.bi_buf, e$2.bi_buf >>= 8, e$2.bi_valid -= 8);
|
||
}(e$1);
|
||
};
|
||
}, { "../utils/common": 41 }],
|
||
53: [function(e, t, r) {
|
||
t.exports = function() {
|
||
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;
|
||
};
|
||
}, {}],
|
||
54: [function(e, t, r) {
|
||
(function(e$1) {
|
||
(function(r$1, n) {
|
||
if (!r$1.setImmediate) {
|
||
var i, s, t$1, a, o = 1, h = {}, u = !1, l = r$1.document, e$2 = Object.getPrototypeOf && Object.getPrototypeOf(r$1);
|
||
e$2 = e$2 && e$2.setTimeout ? e$2 : r$1, i = "[object process]" === {}.toString.call(r$1.process) ? function(e$3) {
|
||
process.nextTick(function() {
|
||
c(e$3);
|
||
});
|
||
} : function() {
|
||
if (r$1.postMessage && !r$1.importScripts) {
|
||
var e$3 = !0, t$2 = r$1.onmessage;
|
||
return r$1.onmessage = function() {
|
||
e$3 = !1;
|
||
}, r$1.postMessage("", "*"), r$1.onmessage = t$2, e$3;
|
||
}
|
||
}() ? (a = "setImmediate$" + Math.random() + "$", r$1.addEventListener ? r$1.addEventListener("message", d, !1) : r$1.attachEvent("onmessage", d), function(e$3) {
|
||
r$1.postMessage(a + e$3, "*");
|
||
}) : r$1.MessageChannel ? ((t$1 = new MessageChannel()).port1.onmessage = function(e$3) {
|
||
c(e$3.data);
|
||
}, function(e$3) {
|
||
t$1.port2.postMessage(e$3);
|
||
}) : l && "onreadystatechange" in l.createElement("script") ? (s = l.documentElement, function(e$3) {
|
||
var t$2 = l.createElement("script");
|
||
t$2.onreadystatechange = function() {
|
||
c(e$3), t$2.onreadystatechange = null, s.removeChild(t$2), t$2 = null;
|
||
}, s.appendChild(t$2);
|
||
}) : function(e$3) {
|
||
setTimeout(c, 0, e$3);
|
||
}, e$2.setImmediate = function(e$3) {
|
||
"function" != typeof e$3 && (e$3 = new Function("" + e$3));
|
||
for (var t$2 = new Array(arguments.length - 1), r$2 = 0; r$2 < t$2.length; r$2++) t$2[r$2] = arguments[r$2 + 1];
|
||
return h[o] = {
|
||
callback: e$3,
|
||
args: t$2
|
||
}, i(o), o++;
|
||
}, e$2.clearImmediate = f;
|
||
}
|
||
function f(e$3) {
|
||
delete h[e$3];
|
||
}
|
||
function c(e$3) {
|
||
if (u) setTimeout(c, 0, e$3);
|
||
else {
|
||
var t$2 = h[e$3];
|
||
if (t$2) {
|
||
u = !0;
|
||
try {
|
||
(function(e$4) {
|
||
var t$3 = e$4.callback, r$2 = e$4.args;
|
||
switch (r$2.length) {
|
||
case 0:
|
||
t$3();
|
||
break;
|
||
case 1:
|
||
t$3(r$2[0]);
|
||
break;
|
||
case 2:
|
||
t$3(r$2[0], r$2[1]);
|
||
break;
|
||
case 3:
|
||
t$3(r$2[0], r$2[1], r$2[2]);
|
||
break;
|
||
default: t$3.apply(n, r$2);
|
||
}
|
||
})(t$2);
|
||
} finally {
|
||
f(e$3), u = !1;
|
||
}
|
||
}
|
||
}
|
||
}
|
||
function d(e$3) {
|
||
e$3.source === r$1 && "string" == typeof e$3.data && 0 === e$3.data.indexOf(a) && c(+e$3.data.slice(a.length));
|
||
}
|
||
})("undefined" == typeof self ? void 0 === e$1 ? this : e$1 : self);
|
||
}).call(this, "undefined" != typeof global ? global : "undefined" != typeof self ? self : "undefined" != typeof window ? window : {});
|
||
}, {}]
|
||
}, {}, [10])(10);
|
||
});
|
||
}) });
|
||
|
||
//#endregion
|
||
export default require_jszip_min();
|
||
|
||
//# sourceMappingURL=jszip.js.map
|