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