1/*! 2 3JSZip - A Javascript class for generating and reading zip files 4<http://stuartk.com/jszip> 5 6(c) 2009-2014 Stuart Knightley <stuart [at] stuartk.com> 7Dual licenced under the MIT license or GPLv3. See https://raw.github.com/Stuk/jszip/master/LICENSE.markdown. 8 9JSZip uses the library pako released under the MIT license : 10https://github.com/nodeca/pako/blob/master/LICENSE 11*/ 12!function (a) { if ("object" == typeof exports && "undefined" != typeof module) module.exports = a(); else if ("function" == typeof define && define.amd) define([], a); else { var b; b = "undefined" != typeof window ? window : "undefined" != typeof global ? global : "undefined" != typeof self ? self : this, b.JSZip = a() } }(function () { 13 return function a(b, c, d) { function e(g, h) { if (!c[g]) { if (!b[g]) { var i = "function" == typeof require && require; if (!h && i) return i(g, !0); if (f) return f(g, !0); var j = new Error("Cannot find module '" + g + "'"); throw j.code = "MODULE_NOT_FOUND", j } var k = c[g] = { exports: {} }; b[g][0].call(k.exports, function (a) { var c = b[g][1][a]; return e(c ? c : a) }, k, k.exports, a, b, c, d) } return c[g].exports } for (var f = "function" == typeof require && require, g = 0; g < d.length; g++)e(d[g]); return e }({ 14 1: [function (a, b, c) { "use strict"; function d(a) { if (a) { this.data = a, this.length = this.data.length, this.index = 0, this.zero = 0; for (var b = 0; b < this.data.length; b++)a[b] = 255 & a[b] } } var e = a("./dataReader"); d.prototype = new e, d.prototype.byteAt = function (a) { return this.data[this.zero + a] }, d.prototype.lastIndexOfSignature = function (a) { for (var b = a.charCodeAt(0), c = a.charCodeAt(1), d = a.charCodeAt(2), e = a.charCodeAt(3), f = this.length - 4; f >= 0; --f)if (this.data[f] === b && this.data[f + 1] === c && this.data[f + 2] === d && this.data[f + 3] === e) return f - this.zero; return -1 }, d.prototype.readData = function (a) { if (this.checkOffset(a), 0 === a) return []; var b = this.data.slice(this.zero + this.index, this.zero + this.index + a); return this.index += a, b }, b.exports = d }, { "./dataReader": 6 }], 2: [function (a, b, c) { "use strict"; var d = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/="; c.encode = function (a, b) { for (var c, e, f, g, h, i, j, k = "", l = 0; l < a.length;)c = a.charCodeAt(l++), e = a.charCodeAt(l++), f = a.charCodeAt(l++), g = c >> 2, h = (3 & c) << 4 | e >> 4, i = (15 & e) << 2 | f >> 6, j = 63 & f, isNaN(e) ? i = j = 64 : isNaN(f) && (j = 64), k = k + d.charAt(g) + d.charAt(h) + d.charAt(i) + d.charAt(j); return k }, c.decode = function (a, b) { var c, e, f, g, h, i, j, k = "", l = 0; for (a = a.replace(/[^A-Za-z0-9\+\/\=]/g, ""); l < a.length;)g = d.indexOf(a.charAt(l++)), h = d.indexOf(a.charAt(l++)), i = d.indexOf(a.charAt(l++)), j = d.indexOf(a.charAt(l++)), c = g << 2 | h >> 4, e = (15 & h) << 4 | i >> 2, f = (3 & i) << 6 | j, k += String.fromCharCode(c), 64 != i && (k += String.fromCharCode(e)), 64 != j && (k += String.fromCharCode(f)); return k } }, {}], 3: [function (a, b, c) { "use strict"; function d() { this.compressedSize = 0, this.uncompressedSize = 0, this.crc32 = 0, this.compressionMethod = null, this.compressedContent = null } d.prototype = { getContent: function () { return null }, getCompressedContent: function () { return null } }, b.exports = d }, {}], 4: [function (a, b, c) { "use strict"; c.STORE = { magic: "\0\0", compress: function (a, b) { return a }, uncompress: function (a) { return a }, compressInputType: null, uncompressInputType: null }, c.DEFLATE = a("./flate") }, { "./flate": 9 }
14], 5: [function (a, b, c) { "use strict"; var d = a("./utils"), e = [0, 1996959894, 3993919788, 2567524794, 124634137, 1886057615, 3915621685, 2657392035, 249268274, 2044508324, 3772115230, 2547177864, 162941995, 2125561021, 3887607047, 2428444049, 498536548, 1789927666, 4089016648, 2227061214, 450548861, 1843258603, 4107580753, 2211677639, 325883990, 1684777152, 4251122042, 2321926636, 335633487, 1661365465, 4195302755, 2366115317, 997073096, 1281953886, 3579855332, 2724688242, 1006888145, 1258607687, 3524101629, 2768942443, 901097722, 1119000684, 3686517206, 2898065728, 853044451, 1172266101, 3705015759, 2882616665, 651767980, 1373503546, 3369554304, 3218104598, 565507253, 1454621731, 3485111705, 3099436303, 671266974, 1594198024, 3322730930, 2970347812, 795835527, 1483230225, 3244367275, 3060149565, 1994146192, 31158534, 2563907772, 4023717930, 1907459465, 112637215, 2680153253, 3904427059, 2013776290, 251722036, 2517215374, 3775830040, 2137656763, 141376813, 2439277719, 3865271297, 1802195444, 476864866, 2238001368, 4066508878, 1812370925, 453092731, 2181625025, 4111451223, 1706088902, 314042704, 2344532202, 4240017532, 1658658271, 366619977, 2362670323, 4224994405, 1303535960, 984961486, 2747007092, 3569037538, 1256170817, 1037604311, 2765210733, 3554079995, 1131014506, 879679996, 2909243462, 3663771856, 1141124467, 855842277, 2852801631, 3708648649, 1342533948, 654459306, 3188396048, 3373015174, 1466479909, 544179635, 3110523913, 3462522015, 1591671054, 702138776, 2966460450, 3352799412, 1504918807, 783551873, 3082640443, 3233442989, 3988292384, 2596254646, 62317068, 1957810842, 3939845945, 2647816111, 81470997, 1943803523, 3814918930, 2489596804, 225274430, 2053790376, 3826175755, 2466906013, 167816743, 2097651377, 4027552580, 2265490386, 503444072, 1762050814, 4150417245, 2154129355, 426522225, 1852507879, 4275313526, 2312317920, 282753626, 1742555852, 4189708143, 2394877945, 397917763, 1622183637, 3604390888, 2714866558, 953729732, 1340076626, 3518719985, 2797360999, 1068828381, 1219638859, 3624741850, 2936675148, 906185462, 1090812512, 3747672003, 2825379669, 829329135, 1181335161, 3412177804, 3160834842, 628085408, 1382605366, 3423369109, 3138078467, 570562233, 1426400815, 3317316542, 2998733608, 733239954, 1555261956, 3268935591, 3050360625, 752459403, 1541320221, 2607071920, 3965973030, 1969922972, 40735498, 2617837225, 3943577151, 1913087877, 83908371, 2512341634, 3803740692, 2075208622, 213261112, 2463272603, 3855990285, 2094854071, 198958881, 2262029012, 4057260610, 1759359992, 534414190, 2176718541, 4139329115, 1873836001, 414664567, 2282248934, 4279200368, 1711684554, 285281116, 2405801727, 4167216745, 1634467795, 376229701, 2685067896, 3608007406, 1308918612, 956543938, 2808555105, 3495958263, 1231636301, 1047427035, 2932959818, 3654703836, 1088359270, 936918e3, 2847714899, 3736837829, 1202900863, 817233897, 3183342108, 3401237130, 1404277552, 615818150, 3134207493, 3453421203, 1423857449, 601450431, 3009837614, 3294710456, 1567103746, 711928724, 3020668471, 3272380065, 1510334235, 755167117]; b.exports = function (a, b) { if ("undefined" == typeof a || !a.length) return 0; var c = "string" !== d.getTypeOf(a); "undefined" == typeof b && (b = 0); var f = 0, g = 0, h = 0; b ^= -1; for (var i = 0, j = a.length; i < j; i++)h = c ? a[i] : a.charCodeAt(i), g = 255 & (b ^ h), f = e[g], b = b >>> 8 ^ f; return b ^ -1 } }, { "./utils": 22 }], 6: [function (a, b, c) { "use strict"; function d(a) { this.data = null, this.length = 0, this.index = 0, this.zero = 0 } var e = a("./utils"); d.prototype = { checkOffset: function (a) { this.checkIndex(this.index + a) }, checkIndex: function (a) { if (this.length < this.zero + a || a < 0) throw new Error("End of data reached (data length = " + this.length + ", asked index = " + a + "). Corrupted zip ?") }, setIndex: function (a) { this.checkIndex(a), this.index = a }, skip: function (a) { this.setIndex(this.index + a) }, byteAt: function (a) { }, readInt: function (a) { var b, c = 0; for (this.checkOffset(a), b = this.index + a - 1; b >= this.index; b--)c = (c << 8) + this.byteAt(b); return this.index += a, c }, readString: function (a) { return e.transformTo("string", this.readData(a)) }, readData: function (a) { }, lastIndexOfSignature: function (a) { }, readDate: function () { var a = this.readInt(4); return new Date((a >> 25 & 127) + 1980, (a >> 21 & 15) - 1, a >> 16 & 31, a >> 11 & 31, a >> 5 & 63, (31 & a) << 1) } }, b.exports = d }, { "./utils": 22 }], 7: [function (a, b, c) { "use strict"; c.base64 = !1, c.binary = !1, c.dir = !1, c.createFolders = !1, c.date = null, c.compression = null, c.compressionOptions = null, c.comment = null, c.unixPermissions = null, c.dosPermissions = null }, {}], 8: [function (a, b, c) { "use strict"; var d = a("./utils"); c.string2binary = function (a) { return d.string2binary(a) }, c.string2Uint8Array = function (a) { return d.transformTo("uint8array", a) }, c.uint8Array2String = function (a) { return d.transformTo("string", a) }, c.string2Blob = function (a) { var b = d.transformTo("arraybuffer", a); return d.arrayBuffer2Blob(b) }, c.arrayBuffer2Blob = function (a) { return d.arrayBuffer2Blob(a) }, c.transformTo = function (a, b) { return d.transformTo(a, b) }, c.getTypeOf = function (a) { return d.getTypeOf(a) }, c.checkSupport = function (a) { return d.checkSupport(a) }, c.MAX_VALUE_16BITS = d.MAX_VALUE_16BITS, c.MAX_VALUE_32BITS = d.MAX_VALUE_32BITS, c.pretty = function (a) { return d.pretty(a) }, c.findCompression = function (a) { return d.findCompression(a) }, c.isRegExp = function (a) { return d.isRegExp(a) } }, { "./utils": 22 }], 9: [function (a, b, c) { "use strict"; var d = "undefined" != typeof Uint8Array && "undefined" != typeof Uint16Array && "undefined" != typeof Uint32Array, e = a("pako"); c.uncompressInputType = d ? "uint8array" : "array", c.compressInputType = d ? "uint8array" : "array", c.magic = "\b\0", c.compress = function (a, b) { return e.deflateRaw(a, { level: b.level || -1 }) }, c.uncompress = function (a) { return e.inflateRaw(a) } }, { pako: 25 }], 10: [function (a, b, c) { "use strict"; function d(a, b) { return this instanceof d ? (this.files = {}, this.comment = null, this.root = "", a && this.load(a, b), void (this.clone = function () { var a = new d; for (var b in this) "function" != typeof this[b] && (a[b] = this[b]); return a })) : new d(a, b) } var e = a("./base64"); d.prototype = a("./object"), d.prototype.load = a("./load"), d.support = a("./support"), d.defaults = a("./defaults"), d.utils = a("./deprecatedPublicUtils"), d.base64 = { encode: function (a) { return e.encode(a) }, decode: function (a) { return e.decode(a) } }, d.compressions = a("./compressions"), b.exports = d }, { "./base64": 2, "./compressions": 4, "./defaults": 7, "./deprecatedPublicUtils": 8, "./load": 11, "./object": 14, "./support": 18 }], 11: [function (a, b, c) { "use strict"; var d = a("./base64"), e = a("./utf8"), f = a("./utils"), g = a("./zipEntries"); b.exports = function (a, b) { var c, h, i, j; for (b = f.extend(b || {}, { base64: !1, checkCRC32: !1, optimizedBinaryString: !1, createFolders: !1, decodeFileName: e.utf8decode }), b.base64 && (a = d.decode(a)), h = new g(a, b), c = h.files, i = 0; i < c.length; i++)j = c[i], this.file(j.fileNameStr, j.decompressed, { binary: !0, optimizedBinaryString: !0, date: j.date, dir: j.dir, comment: j.fileCommentStr.length ? j.fileCommentStr : null, unixPermissions: j.unixPermissions, dosPermissions: j.dosPermissions, createFolders: b.createFolders }); return h.zipComment.length && (this.comment = h.zipComment), this } }, { "./base64": 2, "./utf8": 21, "./utils": 22, "./zipEntries": 23 }], 12: [function (a, b, c) { (function (a) { "use strict"; b.exports = function (b, c) { return new a(b, c) }, b.exports.test = function (b) { return a.isBuffer(b) } }).call(this, "undefined" != typeof Buffer ? Buffer : void 0) }, {}], 13: [function (a, b, c) { "use strict"; function d(a) { this.data = a, this.length = this.data.length, this.index = 0, this.zero = 0 } var e = a("./uint8ArrayReader"); d.prototype = new e, d.prototype.readData = function (a) { this.checkOffset(a
14); var b = this.data.slice(this.zero + this.index, this.zero + this.index + a); return this.index += a, b }, b.exports = d }, { "./uint8ArrayReader": 19 }], 14: [function (a, b, c) { "use strict"; var d = a("./support"), e = a("./utils"), f = a("./crc32"), g = a("./signature"), h = a("./defaults"), i = a("./base64"), j = a("./compressions"), k = a("./compressedObject"), l = a("./nodeBuffer"), m = a("./utf8"), n = a("./stringWriter"), o = a("./uint8ArrayWriter"), p = function (a) { if (a._data instanceof k && (a._data = a._data.getContent(), a.options.binary = !0, a.options.base64 = !1, "uint8array" === e.getTypeOf(a._data))) { var b = a._data; a._data = new Uint8Array(b.length), 0 !== b.length && a._data.set(b, 0) } return a._data }, q = function (a) { var b = p(a), c = e.getTypeOf(b); return "string" === c ? !a.options.binary && d.nodebuffer ? l(b, "utf-8") : a.asBinary() : b }, r = function (a) { var b = p(this); return null === b || "undefined" == typeof b ? "" : (this.options.base64 && (b = i.decode(b)), b = a && this.options.binary ? D.utf8decode(b) : e.transformTo("string", b), a || this.options.binary || (b = e.transformTo("string", D.utf8encode(b))), b) }, s = function (a, b, c) { this.name = a, this.dir = c.dir, this.date = c.date, this.comment = c.comment, this.unixPermissions = c.unixPermissions, this.dosPermissions = c.dosPermissions, this._data = b, this.options = c, this._initialMetadata = { dir: c.dir, date: c.date } }; s.prototype = { asText: function () { return r.call(this, !0) }, asBinary: function () { return r.call(this, !1) }, asNodeBuffer: function () { var a = q(this); return e.transformTo("nodebuffer", a) }, asUint8Array: function () { var a = q(this); return e.transformTo("uint8array", a) }, asArrayBuffer: function () { return this.asUint8Array().buffer } }; var t = function (a, b) { var c, d = ""; for (c = 0; c < b; c++)d += String.fromCharCode(255 & a), a >>>= 8; return d }, u = function (a) { return a = a || {}, a.base64 !== !0 || null !== a.binary && void 0 !== a.binary || (a.binary = !0), a = e.extend(a, h), a.date = a.date || new Date, null !== a.compression && (a.compression = a.compression.toUpperCase()), a }, v = function (a, b, c) { var d, f = e.getTypeOf(b); if (c = u(c), "string" == typeof c.unixPermissions && (c.unixPermissions = parseInt(c.unixPermissions, 8)), c.unixPermissions && 16384 & c.unixPermissions && (c.dir = !0), c.dosPermissions && 16 & c.dosPermissions && (c.dir = !0), c.dir && (a = x(a)), c.createFolders && (d = w(a)) && y.call(this, d, !0), c.dir || null === b || "undefined" == typeof b) c.base64 = !1, c.binary = !1, b = null, f = null; else if ("string" === f) c.binary && !c.base64 && c.optimizedBinaryString !== !0 && (b = e.string2binary(b)); else { if (c.base64 = !1, c.binary = !0, !(f || b instanceof k)) throw new Error("The data of '" + a + "' is in an unsupported format !"); "arraybuffer" === f && (b = e.transformTo("uint8array", b)) } var g = new s(a, b, c); return this.files[a] = g, g }, w = function (a) { "/" == a.slice(-1) && (a = a.substring(0, a.length - 1)); var b = a.lastIndexOf("/"); return b > 0 ? a.substring(0, b) : "" }, x = function (a) { return "/" != a.slice(-1) && (a += "/"), a }, y = function (a, b) { return b = "undefined" != typeof b && b, a = x(a), this.files[a] || v.call(this, a, null, { dir: !0, createFolders: b }), this.files[a] }, z = function (a, b, c) { var d, g = new k; return a._data instanceof k ? (g.uncompressedSize = a._data.uncompressedSize, g.crc32 = a._data.crc32, 0 === g.uncompressedSize || a.dir ? (b = j.STORE, g.compressedContent = "", g.crc32 = 0) : a._data.compressionMethod === b.magic ? g.compressedContent = a._data.getCompressedContent() : (d = a._data.getContent(), g.compressedContent = b.compress(e.transformTo(b.compressInputType, d), c))) : (d = q(a), d && 0 !== d.length && !a.dir || (b = j.STORE, d = ""), g.uncompressedSize = d.length, g.crc32 = f(d), g.compressedContent = b.compress(e.transformTo(b.compressInputType, d), c)), g.compressedSize = g.compressedContent.length, g.compressionMethod = b.magic, g }, A = function (a, b) { var c = a; return a || (c = b ? 16893 : 33204), (65535 & c) << 16 }, B = function (a, b) { return 63 & (a || 0) }
14, C = function (a, b, c, d, h, i) { var j, k, l, n, o = (c.compressedContent, i !== m.utf8encode), p = e.transformTo("string", i(b.name)), q = e.transformTo("string", m.utf8encode(b.name)), r = b.comment || "", s = e.transformTo("string", i(r)), u = e.transformTo("string", m.utf8encode(r)), v = q.length !== b.name.length, w = u.length !== r.length, x = b.options, y = "", z = "", C = ""; l = b._initialMetadata.dir !== b.dir ? b.dir : x.dir, n = b._initialMetadata.date !== b.date ? b.date : x.date; var D = 0, E = 0; l && (D |= 16), "UNIX" === h ? (E = 798, D |= A(b.unixPermissions, l)) : (E = 20, D |= B(b.dosPermissions, l)), j = n.getHours(), j <<= 6, j |= n.getMinutes(), j <<= 5, j |= n.getSeconds() / 2, k = n.getFullYear() - 1980, k <<= 4, k |= n.getMonth() + 1, k <<= 5, k |= n.getDate(), v && (z = t(1, 1) + t(f(p), 4) + q, y += "up" + t(z.length, 2) + z), w && (C = t(1, 1) + t(this.crc32(s), 4) + u, y += "uc" + t(C.length, 2) + C); var F = ""; F += "\n\0", F += o || !v && !w ? "\0\0" : "\0\b", F += c.compressionMethod, F += t(j, 2), F += t(k, 2), F += t(c.crc32, 4), F += t(c.compressedSize, 4), F += t(c.uncompressedSize, 4), F += t(p.length, 2), F += t(y.length, 2); var G = g.LOCAL_FILE_HEADER + F + p + y, H = g.CENTRAL_FILE_HEADER + t(E, 2) + F + t(s.length, 2) + "\0\0\0\0" + t(D, 4) + t(d, 4) + p + y + s; return { fileRecord: G, dirRecord: H, compressedObject: c } }, D = { load: function (a, b) { throw new Error("Load method is not defined. Is the file jszip-load.js included ?") }, filter: function (a) { var b, c, d, f, g = []; for (b in this.files) this.files.hasOwnProperty(b) && (d = this.files[b], f = new s(d.name, d._data, e.extend(d.options)), c = b.slice(this.root.length, b.length), b.slice(0, this.root.length) === this.root && a(c, f) && g.push(f)); return g }, file: function (a, b, c) { if (1 === arguments.length) { if (e.isRegExp(a)) { var d = a; return this.filter(function (a, b) { return !b.dir && d.test(a) }) } return this.filter(function (b, c) { return !c.dir && b === a })[0] || null } return a = this.root + a, v.call(this, a, b, c), this }, folder: function (a) { if (!a) return this; if (e.isRegExp(a)) return this.filter(function (b, c) { return c.dir && a.test(b) }); var b = this.root + a, c = y.call(this, b), d = this.clone(); return d.root = c.name, d }, remove: function (a) { a = this.root + a; var b = this.files[a]; if (b || ("/" != a.slice(-1) && (a += "/"), b = this.files[a]), b && !b.dir) delete this.files[a]; else for (var c = this.filter(function (b, c) { return c.name.slice(0, a.length) === a }), d = 0; d < c.length; d++)delete this.files[c[d].name]; return this }, generate: function (a) { a = e.extend(a || {}, { base64: !0, compression: "STORE", compressionOptions: null, type: "base64", platform: "DOS", comment: null, mimeType: "application/zip", encodeFileName: m.utf8encode }), e.checkSupport(a.type), "darwin" !== a.platform && "freebsd" !== a.platform && "linux" !== a.platform && "sunos" !== a.platform || (a.platform = "UNIX"), "win32" === a.platform && (a.platform = "DOS"); var b, c, d = [], f = 0, h = 0, k = e.transformTo("string", a.encodeFileName(a.comment || this.comment || "")); for (var l in this.files) if (this.files.hasOwnProperty(l)) { var p = this.files[l], q = p.options.compression || a.compression.toUpperCase(), r = j[q]; if (!r) throw new Error(q + " is not a valid compression method !"); var s = p.options.compressionOptions || a.compressionOptions || {}, u = z.call(this, p, r, s), v = C.call(this, l, p, u, f, a.platform, a.encodeFileName); f += v.fileRecord.length + u.compressedSize, h += v.dirRecord.length, d.push(v) } var w = ""; w = g.CENTRAL_DIRECTORY_END + "\0\0\0\0" + t(d.length, 2) + t(d.length, 2) + t(h, 4) + t(f, 4) + t(k.length, 2) + k; var x = a.type.toLowerCase(); for (b = "uint8array" === x || "arraybuffer" === x || "blob" === x || "nodebuffer" === x ? new o(f + h + w.length) : new n(f + h + w.length), c = 0; c < d.length; c++)b.append(d[c].fileRecord), b.append(d[c].compressedObject.compressedContent); for (c = 0; c < d.length; c++)b.append(d[c].dirRecord); b.append(w); var y = b.finalize(); switch (a.type.toLowerCase()) { case "uint8array": case "arraybuffer": case "nodebuffer": return e.transformTo(a.type.toLowerCase(), y); case "blob": return e.arrayBuffer2Blob(e.transformTo("arraybuffer", y), a.mimeType); case "base64": return a.base64 ? i.encode(y) : y; default: return y } }, crc32: function (a, b) { return f(a, b) }, utf8encode: function (a) { return e.transformTo("string", m.utf8encode(a)) }, utf8decode: function (a) { return m.utf8decode(a) } }; b.exports = D }, { "./base64": 2, "./compressedObject": 3, "./compressions": 4, "./crc32": 5, "./defaults": 7, "./nodeBuffer": 12, "./signature": 15, "./stringWriter"
14: 17, "./support": 18, "./uint8ArrayWriter": 20, "./utf8": 21, "./utils": 22 }], 15: [function (a, b, c) { "use strict"; c.LOCAL_FILE_HEADER = "PK��", c.CENTRAL_FILE_HEADER = "PK��", c.CENTRAL_DIRECTORY_END = "PK��", c.ZIP64_CENTRAL_DIRECTORY_LOCATOR = "PK��", c.ZIP64_CENTRAL_DIRECTORY_END = "PK��", c.DATA_DESCRIPTOR = "PK�\b" }, {}], 16: [function (a, b, c) { "use strict"; function d(a, b) { this.data = a, b || (this.data = f.string2binary(this.data)), this.length = this.data.length, this.index = 0, this.zero = 0 } var e = a("./dataReader"), f = a("./utils"); d.prototype = new e, d.prototype.byteAt = function (a) { return this.data.charCodeAt(this.zero + a) }, d.prototype.lastIndexOfSignature = function (a) { return this.data.lastIndexOf(a) - this.zero }, d.prototype.readData = function (a) { this.checkOffset(a); var b = this.data.slice(this.zero + this.index, this.zero + this.index + a); return this.index += a, b }, b.exports = d }, { "./dataReader": 6, "./utils": 22 }], 17: [function (a, b, c) { "use strict"; var d = a("./utils"), e = function () { this.data = [] }; e.prototype = { append: function (a) { a = d.transformTo("string", a), this.data.push(a) }, finalize: function () { return this.data.join("") } }, b.exports = e }, { "./utils": 22 }], 18: [function (a, b, c) { (function (a) { "use strict"; if (c.base64 = !0, c.array = !0, c.string = !0, c.arraybuffer = "undefined" != typeof ArrayBuffer && "undefined" != typeof Uint8Array, c.nodebuffer = "undefined" != typeof a, c.uint8array = "undefined" != typeof Uint8Array, "undefined" == typeof ArrayBuffer) c.blob = !1; else { var b = new ArrayBuffer(0); try { c.blob = 0 === new Blob([b], { type: "application/zip" }).size } catch (d) { try { var e = window.BlobBuilder || window.WebKitBlobBuilder || window.MozBlobBuilder || window.MSBlobBuilder, f = new e; f.append(b), c.blob = 0 === f.getBlob("application/zip").size } catch (d) { c.blob = !1 } } } }).call(this, "undefined" != typeof Buffer ? Buffer : void 0) }, {}], 19: [function (a, b, c) { "use strict"; function d(a) { a && (this.data = a, this.length = this.data.length, this.index = 0, this.zero = 0) } var e = a("./arrayReader"); d.prototype = new e, d.prototype.readData = function (a) { if (this.checkOffset(a), 0 === a) return new Uint8Array(0); var b = this.data.subarray(this.zero + this.index, this.zero + this.index + a); return this.index += a, b }, b.exports = d }, { "./arrayReader": 1 }], 20: [function (a, b, c) { "use strict"; var d = a("./utils"), e = function (a) { this.data = new Uint8Array(a), this.index = 0 }; e.prototype = { append: function (a) { 0 !== a.length && (a = d.transformTo("uint8array", a), this.data.set(a, this.index), this.index += a.length) }, finalize: function () { return this.data } }, b.exports = e }, { "./utils": 22 }], 21: [function (a, b, c) { "use strict"; for (var d = a("./utils"), e = a("./support"), f = a("./nodeBuffer"), g = new Array(256), h = 0; h < 256; h++)g[h] = h >= 252 ? 6 : h >= 248 ? 5 : h >= 240 ? 4 : h >= 224 ? 3 : h >= 192 ? 2 : 1; g[254] = g[254] = 1; var i = function (a) { var b, c, d, f, g, h = a.length, i = 0; for (f = 0; f < h; f++)c = a.charCodeAt(f), 55296 === (64512 & c) && f + 1 < h && (d = a.charCodeAt(f + 1), 56320 === (64512 & d) && (c = 65536 + (c - 55296 << 10) + (d - 56320), f++)), i += c < 128 ? 1 : c < 2048 ? 2 : c < 65536 ? 3 : 4; for (b = e.uint8array ? new Uint8Array(i) : new Array(i), g = 0, f = 0; g < i; f++)c = a.charCodeAt(f), 55296 === (64512 & c) && f + 1 < h && (d = a.charCodeAt(f + 1), 56320 === (64512 & d) && (c = 65536 + (c - 55296 << 10) + (d - 56320), f++)), c < 128 ? b[g++] = c : c < 2048 ? (b[g++] = 192 | c >>> 6, b[g++] = 128 | 63 & c) : c < 65536 ? (b[g++] = 224 | c >>> 12, b[g++] = 128 | c >>> 6 & 63, b[g++] = 128 | 63 & c) : (b[g++] = 240 | c >>> 18, b[g++] = 128 | c >>> 12 & 63, b[g++] = 128 | c >>> 6 & 63, b[g++] = 128 | 63 & c); return b }, j = function (a, b) { var c; for (b = b || a.length, b > a.length && (b = a.length), c = b - 1; c >= 0 && 128 === (192 & a[c]);)c--; return c < 0 ? b : 0 === c ? b : c + g[a[c]] > b ? c : b }, k = function (a) { var b, c, e, f, h = a.length, i = new Array(2 * h); for (c = 0, b = 0; b < h;)if (e = a[b++], e < 128) i[c++] = e; else if (f = g[e], f > 4) i[c++] = 65533, b += f - 1; else { for (e &= 2 === f ? 31 : 3 === f ? 15 : 7; f > 1 && b < h;)e = e << 6 | 63 & a[b++], f--; f > 1 ? i[c++] = 65533 : e < 65536 ? i[c++] = e : (e -= 65536, i[c++] = 55296 | e >> 10 & 1023, i[c++] = 56320 | 1023 & e) } return i.length !== c && (i.subarray ? i = i.subarray(0, c) : i.length = c), d.applyFromCharCode(i) };
14 c.utf8encode = function (a) { return e.nodebuffer ? f(a, "utf-8") : i(a) }, c.utf8decode = function (a) { if (e.nodebuffer) return d.transformTo("nodebuffer", a).toString("utf-8"); a = d.transformTo(e.uint8array ? "uint8array" : "array", a); for (var b = [], c = 0, f = a.length, g = 65536; c < f;) { var h = j(a, Math.min(c + g, f)); e.uint8array ? b.push(k(a.subarray(c, h))) : b.push(k(a.slice(c, h))), c = h } return b.join("") } }, { "./nodeBuffer": 12, "./support": 18, "./utils": 22 }], 22: [function (a, b, c) { "use strict"; function d(a) { return a } function e(a, b) { for (var c = 0; c < a.length; ++c)b[c] = 255 & a.charCodeAt(c); return b } function f(a) { var b = 65536, d = [], e = a.length, f = c.getTypeOf(a), g = 0, h = !0; try { switch (f) { case "uint8array": String.fromCharCode.apply(null, new Uint8Array(0)); break; case "nodebuffer": String.fromCharCode.apply(null, j(0)) } } catch (i) { h = !1 } if (!h) { for (var k = "", l = 0; l < a.length; l++)k += String.fromCharCode(a[l]); return k } for (; g < e && b > 1;)try { "array" === f || "nodebuffer" === f ? d.push(String.fromCharCode.apply(null, a.slice(g, Math.min(g + b, e)))) : d.push(String.fromCharCode.apply(null, a.subarray(g, Math.min(g + b, e)))), g += b } catch (i) { b = Math.floor(b / 2) } return d.join("") } function g(a, b) { for (var c = 0; c < a.length; c++)b[c] = a[c]; return b } var h = a("./support"), i = a("./compressions"), j = a("./nodeBuffer"); c.string2binary = function (a) { for (var b = "", c = 0; c < a.length; c++)b += String.fromCharCode(255 & a.charCodeAt(c)); return b }, c.arrayBuffer2Blob = function (a, b) { c.checkSupport("blob"), b = b || "application/zip"; try { return new Blob([a], { type: b }) } catch (d) { try { var e = window.BlobBuilder || window.WebKitBlobBuilder || window.MozBlobBuilder || window.MSBlobBuilder, f = new e; return f.append(a), f.getBlob(b) } catch (d) { throw new Error("Bug : can't construct the Blob.") } } }, c.applyFromCharCode = f; var k = {}; k.string = { string: d, array: function (a) { return e(a, new Array(a.length)) }, arraybuffer: function (a) { return k.string.uint8array(a).buffer }, uint8array: function (a) { return e(a, new Uint8Array(a.length)) }, nodebuffer: function (a) { return e(a, j(a.length)) } }, k.array = { string: f, array: d, arraybuffer: function (a) { return new Uint8Array(a).buffer }, uint8array: function (a) { return new Uint8Array(a) }, nodebuffer: function (a) { return j(a) } }, k.arraybuffer = { string: function (a) { return f(new Uint8Array(a)) }, array: function (a) { return g(new Uint8Array(a), new Array(a.byteLength)) }, arraybuffer: d, uint8array: function (a) { return new Uint8Array(a) }, nodebuffer: function (a) { return j(new Uint8Array(a)) } }, k.uint8array = { string: f, array: function (a) { return g(a, new Array(a.length)) }, arraybuffer: function (a) { return a.buffer }, uint8array: d, nodebuffer: function (a) { return j(a) } }, k.nodebuffer = { string: f, array: function (a) { return g(a, new Array(a.length)) }, arraybuffer: function (a) { return k.nodebuffer.uint8array(a).buffer }, uint8array: function (a) { return g(a, new Uint8Array(a.length)) }, nodebuffer: d }, c.transformTo = function (a, b) { if (b || (b = ""), !a) return b; c.checkSupport(a); var d = c.getTypeOf(b), e = k[d][a](b); return e }, c.getTypeOf = function (a) { return "string" == typeof a ? "string" : "[object Array]" === Object.prototype.toString.call(a) ? "array" : h.nodebuffer && j.test(a) ? "nodebuffer" : h.uint8array && a instanceof Uint8Array ? "uint8array" : h.arraybuffer && a instanceof ArrayBuffer ? "arraybuffer" : void 0 }, c.checkSupport = function (a) { var b = h[a.toLowerCase()]; if (!b) throw new Error(a + " is not supported by this browser") }, c.MAX_VALUE_16BITS = 65535, c.MAX_VALUE_32BITS = -1, c.pretty = function (a) { var b, c, d = ""; for (c = 0; c < (a || "").length; c++)b = a.charCodeAt(c), d += "\\x" + (b < 16 ? "0" : "") + b.toString(16).toUpperCase(); return d }, c.findCompression = function (a) { for (var b in i) if (i.hasOwnProperty(b) && i[b].magic === a) return i[b]; return null }, c.isRegExp = function (a) { return "[object RegExp]" === Object.prototype.toString.call(a) }, c.extend = function () { var a, b, c = {}; for (a = 0; a < arguments.length; a++)for (b in arguments[a]) arguments[a].hasOwnProperty(b) && "undefined" == typeof c[b] && (c[b] = arguments[a][b]); return c } }, { "./compressions": 4, "./nodeBuffer": 12, "./support": 18 }], 23: [function (a, b, c) { "use strict"; function d(a, b) { this.files = [], this.loadOptions = b, a && this.load(a) } var e = a("./stringReader"), f = a("./nodeBufferReader"), g = a("./uint8ArrayReader"), h = a("./arrayReader"), i = a("./utils"), j = a("./signature"), k = a("./zipEntry"), l = a("./support"); a("./object"); d.prototype = { checkSignature: function (a) { var b = this.reader.readString(4); if (b !== a) throw new Error("Corrupted zip or bug : unexpected signature (" + i.pretty(b) + ", expected " + i.pretty(a) + ")") }, isSignature: function (a, b) { var c = this.reader.index; this.reader.setIndex(a); var d = this.reader.readString(4), e = d === b; return this.reader.setIndex(c), e }, 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 a = this.reader.readData(this.zipCommentLength), b = l.uint8array ? "uint8array" : "array", c = i.transformTo(b, a); this.zipComment = this.loadOptions.decodeFileName(c) }, readBlockZip64EndOfCentral: function () { this.zip64EndOfCentralSize = this.reader.readInt(8), this.versionMadeBy = this.reader.readString(2), this.versionNeeded = this.reader.readInt(2), 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 a, b, c, d = this.zip64EndOfCentralSize - 44, e = 0; e < d;)a = this.reader.readInt(2), b = this.reader.readInt(4), c = this.reader.readString(b), this.zip64ExtensibleData[a] = { id: a, length: b, value: c } }, readBlockZip64EndOfCentralLocator: function () { if (this.diskWithZip64CentralDirStart = this.reader.readInt(4), this.relativeOffsetEndOfZip64CentralDir = this.reader.readInt(8), this.disksCount = this.reader.readInt(4), this.disksCount > 1) throw new Error("Multi-volumes zip are not supported") }, readLocalFiles: function () { var a, b; for (a = 0; a < this.files.length; a++)b = this.files[a], this.reader.setIndex(b.localHeaderOffset), this.checkSignature(j.LOCAL_FILE_HEADER), b.readLocalPart(this.reader), b.handleUTF8(), b.processAttributes() }, readCentralDir: function () { var a; for (this.reader.setIndex(this.centralDirOffset); this.reader.readString(4) === j.CENTRAL_FILE_HEADER;)a = new k({ zip64: this.zip64 }, this.loadOptions), a.readCentralPart(this.reader), this.files.push(a); if (this.centralDirRecords !== this.files.length && 0 !== this.centralDirRecords && 0 === this.files.length) throw new Error("Corrupted zip or bug: expected " + this.centralDirRecords + " records in central dir, got " + this.files.length) }, readEndOfCentral: function () { var a = this.reader.lastIndexOfSignature(j.CENTRAL_DIRECTORY_END); if (a < 0) { var b = !this.isSignature(0, j.LOCAL_FILE_HEADER); throw b ? new Error("Can't find end of central directory : is this a zip f
14ile ? If it is, see http://stuk.github.io/jszip/documentation/howto/read_zip.html") : new Error("Corrupted zip : can't find end of central directory") } this.reader.setIndex(a); var c = a; if (this.checkSignature(j.CENTRAL_DIRECTORY_END), this.readBlockEndOfCentral(), this.diskNumber === i.MAX_VALUE_16BITS || this.diskWithCentralDirStart === i.MAX_VALUE_16BITS || this.centralDirRecordsOnThisDisk === i.MAX_VALUE_16BITS || this.centralDirRecords === i.MAX_VALUE_16BITS || this.centralDirSize === i.MAX_VALUE_32BITS || this.centralDirOffset === i.MAX_VALUE_32BITS) { if (this.zip64 = !0, a = this.reader.lastIndexOfSignature(j.ZIP64_CENTRAL_DIRECTORY_LOCATOR), a < 0) throw new Error("Corrupted zip : can't find the ZIP64 end of central directory locator"); if (this.reader.setIndex(a), this.checkSignature(j.ZIP64_CENTRAL_DIRECTORY_LOCATOR), this.readBlockZip64EndOfCentralLocator(), !this.isSignature(this.relativeOffsetEndOfZip64CentralDir, j.ZIP64_CENTRAL_DIRECTORY_END) && (this.relativeOffsetEndOfZip64CentralDir = this.reader.lastIndexOfSignature(j.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(j.ZIP64_CENTRAL_DIRECTORY_END), this.readBlockZip64EndOfCentral() } var d = this.centralDirOffset + this.centralDirSize; this.zip64 && (d += 20, d += 12 + this.zip64EndOfCentralSize); var e = c - d; if (e > 0) this.isSignature(c, j.CENTRAL_FILE_HEADER) || (this.reader.zero = e); else if (e < 0) throw new Error("Corrupted zip: missing " + Math.abs(e) + " bytes.") }, prepareReader: function (a) { var b = i.getTypeOf(a); if (i.checkSupport(b), "string" !== b || l.uint8array) if ("nodebuffer" === b) this.reader = new f(a); else if (l.uint8array) this.reader = new g(i.transformTo("uint8array", a)); else { if (!l.array) throw new Error("Unexpected error: unsupported type '" + b + "'"); this.reader = new h(i.transformTo("array", a)) } else this.reader = new e(a, this.loadOptions.optimizedBinaryString) }, load: function (a) { this.prepareReader(a), this.readEndOfCentral(), this.readCentralDir(), this.readLocalFiles() } }, b.exports = d }, { "./arrayReader": 1, "./nodeBufferReader": 13, "./object": 14, "./signature": 15, "./stringReader": 16, "./support": 18, "./uint8ArrayReader": 19, "./utils": 22, "./zipEntry": 24 }], 24: [function (a, b, c) { 15 "use strict"; function d(a, b) { this.options = a, this.loadOptions = b } var e = a("./stringReader"), f = a("./utils"), g = a("./compressedObject"), h = a("./object"), i = a("./support"), j = 0, k = 3; d.prototype = { 16 isEncrypted: function () { return 1 === (1 & this.bitFlag) }, useUTF8: function () { return 2048 === (2048 & this.bitFlag) }, prepareCompressedContent: function (a, b, c) { return function () { var d = a.index; a.setIndex(b); var e = a.readData(c); return a.setIndex(d), e } }, prepareContent: function (a, b, c, d, e) { return function () { var a = f.transformTo(d.uncompressInputType, this.getCompressedContent()), b = d.uncompress(a); if (b.length !== e) throw new Error("Bug : uncompressed data size mismatch"); return b } }, readLocalPart: function (a) { 17 var b, c; if (a.skip(22), this.fileNameLength = a.readInt(2), c = a.readInt(2), this.fileName = a.readData(this.fileNameLength), a.skip(c), this.compressedSize == -1 || this.uncompressedSize == -1) throw new Error("Bug or corrupted zip : didn't get enough informations from the central directory (compressedSize == -1 || uncompressedSize == -1)"); if (b = f.findCompression(this.compressionMethod), null === b) throw new Error("Corrupted zip : compression " + f.pretty(this.compressionMethod) + " unknown (inner file : " + f.transformTo("string", this.fileName) + ")"); if (this.decompressed = new g, this.decompressed.compressedSize = this.compressedSize, this.decompressed.uncompressedSize = this.uncompressedSize, this.decompressed.crc32 = this.crc32, this.decompressed.compressionMethod = this.compressionMethod, this.decompressed.getCompressedContent = this.prepareCompressedContent(a, a.index, this.compressedSize, b), this.decompressed.getContent = this.prepareContent(a, a.index, this.compressedSize, b, this.uncompressedSize), this.loadOptions.checkCRC32 && (this.decompressed = f.transformTo("string", this.decompressed.getContent()), h.crc32(this.decompressed) !== this.crc32)) throw new Error("Corrupted zip : CRC32 mismatch"); 18 }, readCentralPart: function (a) { if (this.versionMadeBy = a.readInt(2), this.versionNeeded = a.readInt(2), this.bitFlag = a.readInt(2), this.compressionMethod = a.readString(2), this.date = a.readDate(), this.crc32 = a.readInt(4), this.compressedSize = a.readInt(4), this.uncompressedSize = a.readInt(4), this.fileNameLength = a.readInt(2), this.extraFieldsLength = a.readInt(2), this.fileCommentLength = a.readInt(2), this.diskNumberStart = a.readInt(2), this.internalFileAttributes = a.readInt(2), this.externalFileAttributes = a.readInt(4), this.localHeaderOffset = a.readInt(4), this.isEncrypted()) throw new Error("Encrypted zip are not supported"); this.fileName = a.readData(this.fileNameLength), this.readExtraFields(a), this.parseZIP64ExtraField(a), this.fileComment = a.readData(this.fileCommentLength) }, processAttributes: function () { this.unixPermissions = null, this.dosPermissions = null; var a = this.versionMadeBy >> 8; this.dir = !!(16 & this.externalFileAttributes), a === j && (this.dosPermissions = 63 & this.externalFileAttributes), a === k && (this.unixPermissions = this.externalFileAttributes >> 16 & 65535), this.dir || "/" !== this.fileNameStr.slice(-1) || (this.dir = !0) }, parseZIP64ExtraField: function (a) { if (this.extraFields[1]) { var b = new e(this.extraFields[1].value); this.uncompressedSize === f.MAX_VALUE_32BITS && (this.uncompressedSize = b.readInt(8)), this.compressedSize === f.MAX_VALUE_32BITS && (this.compressedSize = b.readInt(8)), this.localHeaderOffset === f.MAX_VALUE_32BITS && (this.localHeaderOffset = b.readInt(8)), this.diskNumberStart === f.MAX_VALUE_32BITS && (this.diskNumberStart = b.readInt(4)) } }, readExtraFields: function (a) { var b, c, d, e = a.index; for (this.extraFields = this.extraFields || {}; a.index < e + this.extraFieldsLength;)b = a.readInt(2), c = a.readInt(2), d = a.readString(c), this.extraFields[b] = { id: b, length: c, value: d } }, handleUTF8: function () { var a = i.uint8array ? "uint8array" : "array"; if (this.useUTF8()) this.fileNameStr = h.utf8decode(this.fileName), this.fileCommentStr = h.utf8decode(this.fileComment); else { var b = this.findExtraFieldUnicodePath(); if (null !== b) this.fileNameStr = b; else { var c = f.transformTo(a, this.fileName); this.fileNameStr = this.loadOptions.decodeFileName(c) } var d = this.findExtraFieldUnicodeComment(); if (null !== d) this.fileCommentStr = d; else { var e = f.transformTo(a, this.fileComment); this.fileCommentStr = this.loadOptions.decodeFileName(e) } } }, findExtraFieldUnicodePath: function () { var a = this.extraFields[28789]; if (a) { var b = new e(a.value); return 1 !== b.readInt(1) ? null : h.crc32(this.fileName) !== b.readInt(4) ? null : h.utf8decode(b.readString(a.length - 5)) } return null }, findExtraFieldUnicodeComment: function () { var a = this.extraFields[25461]; if (a) { var b = new e(a.value); return 1 !== b.readInt(1) ? null : h.crc32(this.fileComment) !== b.readInt(4) ? null : h.utf8decode(b.readString(a.length - 5)) } return null } 19 }, b.exports = d 20 }, { "./compressedObject": 3, "./object": 14, "./stringReader": 16, "./support": 18, "./utils": 22 }], 25: [function (a, b, c) { "use strict"; var d = a("./lib/utils/common").assign, e = a("./lib/deflate"), f = a("./lib/inflate"), g = a("./lib/zlib/constants"), h = {}; d(h, e, f, g), b.exports = h }, { "./lib/deflate": 26, "./lib/inflate": 27, "./lib/utils/common": 28, "./lib/zlib/constants": 31 }], 26: [function (a, b, c) { "use strict"; function d(a) { if (!(this instanceof d)) return new d(a); this.options = i.assign({ level: s, method: u, chunkSize: 16384, windowBits: 15, memLevel: 8, strategy: t, to: "" }, a || {}); var b = this.options; b.raw && b.windowBits > 0 ? b.windowBits = -b.windowBits : b.gzip && b.windowBits > 0 && b.windowBits < 16 && (b.windowBits += 16), this.err = 0, this.msg = "", this.ended = !1, this.chunks = [], this.strm = new l, this.strm.avail_out = 0; var c = h.deflateInit2(this.strm, b.level, b.method, b.windowBits, b.memLevel, b.strategy); if (c !== p) throw new Error(k[c]); if (b.header && h.deflateSetHeader(this.strm, b.header), b.dictionary) { var e; if (e = "string" == typeof b.dictionary ? j.string2buf(b.dictionary) : "[object ArrayBuffer]" === m.call(b.dictionary) ? new Uint8Array(b.dictionary) : b.dictionary, c = h.deflateSetDictionary(this.strm, e), c !== p) throw new Error(k[c]); this._dict_set = !0 } } function e(a, b) { var c = new d(b); if (c.push(a, !0), c.err) throw c.msg; return c.result } function f(a, b) { return b = b || {}, b.raw = !0, e(a, b) } function g(a, b) { return b = b || {}, b.gzip = !0, e(a, b) } var h = a("./zlib/deflate"), i = a("./utils/common"), j = a("./utils/strings"), k = a("./zlib/messages"), l = a("./zlib/zstream"), m = Object.prototype.toString, n = 0, o = 4, p = 0, q = 1, r = 2, s = -1, t = 0, u = 8; d.prototype.push = function (a, b) { var c, d, e = this.strm, f = this.options.chunkSize; if (this.ended) return !1; d = b === ~~b ? b : b === !0 ? o : n, "string" == typeof a ? e.input = j.string2buf(a) : "[object ArrayBuffer]" === m.call(a) ? e.input = new Uint8Array(a) : e.input = a, e.next_in = 0, e.avail_in = e.input.length; do { if (0 === e.avail_out && (e.output = new i.Buf8(f), e.next_out = 0, e.avail_out = f), c = h.deflate(e, d), c !== q && c !== p) return this.onEnd(c), this.ended = !0, !1; 0 !== e.avail_out && (0 !== e.avail_in || d !== o && d !== r) || ("string" === this.options.to ? this.onData(j.buf2binstring(i.shrinkBuf(e.output, e.next_out))) : this.onData(i.shrinkBuf(e.output, e.next_out))) } while ((e.avail_in > 0 || 0 === e.avail_out) && c !== q); return d === o ? (c = h.deflateEnd(this.strm), this.onEnd(c), this.ended = !0, c === p) : d !== r || (this.onEnd(p), e.avail_out = 0, !0) }, d.prototype.onData = function (a) { this.chunks.push(a) }, d.prototype.onEnd = function (a) { a === p && ("string" === this.options.to ? this.result = this.chunks.join("") : this.result = i.flattenChunks(this.chunks)), this.chunks = [], this.err = a, this.msg = this.strm.msg }, c.Deflate = d, c.deflate = e, c.deflateRaw = f, c.gzip = g }, { "./utils/common": 28, "./utils/strings": 29, "./zlib/deflate": 33, "./zlib/messages": 38, "./zlib/zstream": 40 }], 27: [function (a, b, c) { "use strict"; function d(a) { if (!(this instanceof d)) return new d(a); this.options = h.assign({ chunkSize: 16384, windowBits: 0, to: "" }, a || {}); var b = this.options; b.raw && b.windowBits >= 0 && b.windowBits < 16 && (b.windowBits = -b.windowBits, 0 === b.windowBits && (b.windowBits = -15
20)), !(b.windowBits >= 0 && b.windowBits < 16) || a && a.windowBits || (b.windowBits += 32), b.windowBits > 15 && b.windowBits < 48 && 0 === (15 & b.windowBits) && (b.windowBits |= 15), this.err = 0, this.msg = "", this.ended = !1, this.chunks = [], this.strm = new l, this.strm.avail_out = 0; var c = g.inflateInit2(this.strm, b.windowBits); if (c !== j.Z_OK) throw new Error(k[c]); this.header = new m, g.inflateGetHeader(this.strm, this.header) } function e(a, b) { var c = new d(b); if (c.push(a, !0), c.err) throw c.msg; return c.result } function f(a, b) { return b = b || {}, b.raw = !0, e(a, b) } var g = a("./zlib/inflate"), h = a("./utils/common"), i = a("./utils/strings"), j = a("./zlib/constants"), k = a("./zlib/messages"), l = a("./zlib/zstream"), m = a("./zlib/gzheader"), n = Object.prototype.toString; d.prototype.push = function (a, b) { var c, d, e, f, k, l, m = this.strm, o = this.options.chunkSize, p = this.options.dictionary, q = !1; if (this.ended) return !1; d = b === ~~b ? b : b === !0 ? j.Z_FINISH : j.Z_NO_FLUSH, "string" == typeof a ? m.input = i.binstring2buf(a) : "[object ArrayBuffer]" === n.call(a) ? m.input = new Uint8Array(a) : m.input = a, m.next_in = 0, m.avail_in = m.input.length; do { if (0 === m.avail_out && (m.output = new h.Buf8(o), m.next_out = 0, m.avail_out = o), c = g.inflate(m, j.Z_NO_FLUSH), c === j.Z_NEED_DICT && p && (l = "string" == typeof p ? i.string2buf(p) : "[object ArrayBuffer]" === n.call(p) ? new Uint8Array(p) : p, c = g.inflateSetDictionary(this.strm, l)), c === j.Z_BUF_ERROR && q === !0 && (c = j.Z_OK, q = !1), c !== j.Z_STREAM_END && c !== j.Z_OK) return this.onEnd(c), this.ended = !0, !1; m.next_out && (0 !== m.avail_out && c !== j.Z_STREAM_END && (0 !== m.avail_in || d !== j.Z_FINISH && d !== j.Z_SYNC_FLUSH) || ("string" === this.options.to ? (e = i.utf8border(m.output, m.next_out), f = m.next_out - e, k = i.buf2string(m.output, e), m.next_out = f, m.avail_out = o - f, f && h.arraySet(m.output, m.output, e, f, 0), this.onData(k)) : this.onData(h.shrinkBuf(m.output, m.next_out)))), 0 === m.avail_in && 0 === m.avail_out && (q = !0) } while ((m.avail_in > 0 || 0 === m.avail_out) && c !== j.Z_STREAM_END); return c === j.Z_STREAM_END && (d = j.Z_FINISH), d === j.Z_FINISH ? (c = g.inflateEnd(this.strm), this.onEnd(c), this.ended = !0, c === j.Z_OK) : d !== j.Z_SYNC_FLUSH || (this.onEnd(j.Z_OK), m.avail_out = 0, !0) }, d.prototype.onData = function (a) { this.chunks.push(a) }, d.prototype.onEnd = function (a) { a === j.Z_OK && ("string" === this.options.to ? this.result = this.chunks.join("") : this.result = h.flattenChunks(this.chunks)), this.chunks = [], this.err = a, this.msg = this.strm.msg }, c.Inflate = d, c.inflate = e, c.inflateRaw = f, c.ungzip = e }, { "./utils/common": 28, "./utils/strings": 29, "./zlib/constants": 31, "./zlib/gzheader": 34, "./zlib/inflate": 36, "./zlib/messages": 38, "./zlib/zstream": 40 }], 28: [function (a, b, c) { "use strict"; var d = "undefined" != typeof Uint8Array && "undefined" != typeof Uint16Array && "undefined" != typeof Int32Array; c.assign = function (a) { for (var b = Array.prototype.slice.call(arguments, 1); b.length;) { var c = b.shift(); if (c) { if ("object" != typeof c) throw new TypeError(c + "must be non-object"); for (var d in c) c.hasOwnProperty(d) && (a[d] = c[d]) } } return a }, c.shrinkBuf = function (a, b) { return a.length === b ? a : a.subarray ? a.subarray(0, b) : (a.length = b, a) }; var e = { arraySet: function (a, b, c, d, e) { if (b.subarray && a.subarray) return void a.set(b.subarray(c, c + d), e); for (var f = 0; f < d; f++)a[e + f] = b[c + f] }, flattenChunks: function (a) { var b, c, d, e, f, g; for (d = 0, b = 0, c = a.length; b < c; b++)d += a[b].length; for (g = new Uint8Array(d), e = 0, b = 0, c = a.length; b < c; b++)f = a[b], g.set(f, e), e += f.length; return g } }, f = { arraySet: function (a, b, c, d, e) { for (var f = 0; f < d; f++)a[e + f] = b[c + f] }, flattenChunks: function (a) { return [].concat.apply([], a) } }; c.setTyped = function (a) { a ? (c.Buf8 = Uint8Array, c.Buf16 = Uint16Array, c.Buf32 = Int32Array, c.assign(c, e)) : (c.Buf8 = Array, c.Buf16 = Array, c.Buf32 = Array, c.assign(c, f)) }, c.setTyped(d) }, {}], 29: [function (a, b, c) { "use strict"; function d(a, b) { if (b < 65537 && (a.subarray && g || !a.subarray && f)) return String.fromCharCode.apply(null, e.shrinkBuf(a, b)); for (var c = "", d = 0; d < b; d++)c += String.fromCharCode(a[d]); return c } var e = a("./common"), f = !0, g = !0; try { String.fromCharCode.apply(null, [0]) } catch (h) { f = !1 } try { String.fromCharCode.apply(null, new Uint8Array(1)) } catch (h) { g = !1 } for (var i = new e.Buf8(256), j = 0; j < 256; j++)i[j] = j >= 252 ? 6 : j >= 248 ? 5 : j >= 240 ? 4 : j >= 224 ? 3 : j >= 192 ? 2 : 1; i[254] = i[254] = 1, c.string2buf = function (a) { var b, c, d, f, g, h = a.length, i = 0; for (f = 0; f < h; f++)c = a.charCodeAt(f), 55296 === (64512 & c) && f + 1 < h && (d = a.charCodeAt(f + 1), 56320 === (64512 & d) && (c = 65536 + (c - 55296 << 10) + (d - 56320), f++)), i += c < 128 ? 1 : c < 2048 ? 2 : c < 65536 ? 3 : 4; for (b = new e.Buf8(i), g = 0, f = 0; g < i; f++)c = a.charCodeAt(f), 55296 === (64512 & c) && f + 1 < h && (d = a.charCodeAt(f + 1), 56320 === (64512 & d) && (c = 65536 + (c - 55296 << 10) + (d - 56320), f++)), c < 128 ? b[g++] = c : c < 2048 ? (b[g++] = 192 | c >>> 6, b[g++] = 128 | 63 & c) : c < 65536 ? (b[g++] = 224 | c >>> 12, b[g++] = 128 | c >>> 6 & 63, b[g++] = 128 | 63 & c) : (b[g++] = 240 | c >>> 18, b[g++] = 128 | c >>> 12 & 63, b[g++] = 128 | c >>> 6 & 63, b[g++] = 128 | 63 & c); return b }, c.buf2binstring = function (a) { return d(a, a.length) }, c.binstring2buf = function (a) { for (var b = new e.Buf8(a.length), c = 0, d = b.length; c < d; c++)b[c] = a.charCodeAt(c); return b }, c.buf2string = function (a, b) { var c, e, f, g, h = b || a.length, j = new Array(2 * h); for (e = 0, c = 0; c < h;)if (f = a[c++], f < 128) j[e++] = f; else if (g = i[f], g > 4) j[e++] = 65533, c += g - 1; else { for (f &= 2 === g ? 31 : 3 === g ? 15 : 7; g > 1 && c < h;)f = f << 6 | 63 & a[c++], g--; g > 1 ? j[e++] = 65533 : f < 65536 ? j[e++] = f : (f -= 65536, j[e++] = 55296 | f >> 10 & 1023, j[e++] = 56320 | 1023 & f) } return d(j, e) }, c.utf8border = function (a, b) { var c; for (b = b || a.length, b > a.length && (b = a.length), c = b - 1; c >= 0 && 128 === (192 & a[c]);)c--; return c < 0 ? b : 0 === c ? b : c + i[a[c]] > b ? c : b } }, { "./common": 28 }], 30: [function (a, b, c) { "use strict"; function d(a, b, c, d) { for (var e = 65535 & a | 0, f = a >>> 16 & 65535 | 0, g = 0; 0 !== c;) { g = c > 2e3 ? 2e3 : c, c -= g; do e = e + b[d++] | 0, f = f + e | 0; while (--g); e %= 65521, f %= 65521 } return e | f << 16 | 0 } b.exports = d }, {}], 31: [function (a, b, c) { "use strict"; b.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_ER
20ROR: -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 } }, {}], 32: [function (a, b, c) { "use strict"; function d() { for (var a, b = [], c = 0; c < 256; c++) { a = c; for (var d = 0; d < 8; d++)a = 1 & a ? 3988292384 ^ a >>> 1 : a >>> 1; b[c] = a } return b } function e(a, b, c, d) { var e = f, g = d + c; a ^= -1; for (var h = d; h < g; h++)a = a >>> 8 ^ e[255 & (a ^ b[h])]; return a ^ -1 } var f = d(); b.exports = e }, {}], 33: [function (a, b, c) { "use strict"; function d(a, b) { return a.msg = I[b], b } function e(a) { return (a << 1) - (a > 4 ? 9 : 0) } function f(a) { for (var b = a.length; --b >= 0;)a[b] = 0 } function g(a) { var b = a.state, c = b.pending; c > a.avail_out && (c = a.avail_out), 0 !== c && (E.arraySet(a.output, b.pending_buf, b.pending_out, c, a.next_out), a.next_out += c, b.pending_out += c, a.total_out += c, a.avail_out -= c, b.pending -= c, 0 === b.pending && (b.pending_out = 0)) } function h(a, b) { F._tr_flush_block(a, a.block_start >= 0 ? a.block_start : -1, a.strstart - a.block_start, b), a.block_start = a.strstart, g(a.strm) } function i(a, b) { a.pending_buf[a.pending++] = b } function j(a, b) { a.pending_buf[a.pending++] = b >>> 8 & 255, a.pending_buf[a.pending++] = 255 & b } function k(a, b, c, d) { var e = a.avail_in; return e > d && (e = d), 0 === e ? 0 : (a.avail_in -= e, E.arraySet(b, a.input, a.next_in, e, c), 1 === a.state.wrap ? a.adler = G(a.adler, b, e, c) : 2 === a.state.wrap && (a.adler = H(a.adler, b, e, c)), a.next_in += e, a.total_in += e, e) } function l(a, b) { var c, d, e = a.max_chain_length, f = a.strstart, g = a.prev_length, h = a.nice_match, i = a.strstart > a.w_size - la ? a.strstart - (a.w_size - la) : 0, j = a.window, k = a.w_mask, l = a.prev, m = a.strstart + ka, n = j[f + g - 1], o = j[f + g]; a.prev_length >= a.good_match && (e >>= 2), h > a.lookahead && (h = a.lookahead); do if (c = b, j[c + g] === o && j[c + g - 1] === n && j[c] === j[f] && j[++c] === j[f + 1]) { f += 2, c++; do; while (j[++f] === j[++c] && j[++f] === j[++c] && j[++f] === j[++c] && j[++f] === j[++c] && j[++f] === j[++c] && j[++f] === j[++c] && j[++f] === j[++c] && j[++f] === j[++c] && f < m); if (d = ka - (m - f), f = m - ka, d > g) { if (a.match_start = b, g = d, d >= h) break; n = j[f + g - 1], o = j[f + g] } } while ((b = l[b & k]) > i && 0 !== --e); return g <= a.lookahead ? g : a.lookahead } function m(a) { var b, c, d, e, f, g = a.w_size; do { if (e = a.window_size - a.lookahead - a.strstart, a.strstart >= g + (g - la)) { E.arraySet(a.window, a.window, g, g, 0), a.match_start -= g, a.strstart -= g, a.block_start -= g, c = a.hash_size, b = c; do d = a.head[--b], a.head[b] = d >= g ? d - g : 0; while (--c); c = g, b = c; do d = a.prev[--b], a.prev[b] = d >= g ? d - g : 0; while (--c); e += g } if (0 === a.strm.avail_in) break; if (c = k(a.strm, a.window, a.strstart + a.lookahead, e), a.lookahead += c, a.lookahead + a.insert >= ja) for (f = a.strstart - a.insert, a.ins_h = a.window[f], a.ins_h = (a.ins_h << a.hash_shift ^ a.window[f + 1]) & a.hash_mask; a.insert && (a.ins_h = (a.ins_h << a.hash_shift ^ a.window[f + ja - 1]) & a.hash_mask, a.prev[f & a.w_mask] = a.head[a.ins_h], a.head[a.ins_h] = f, f++ , a.insert-- , !(a.lookahead + a.insert < ja));); } while (a.lookahead < la && 0 !== a.strm.avail_in) } function n(a, b) { var c = 65535; for (c > a.pending_buf_size - 5 && (c = a.pending_buf_size - 5); ;) { if (a.lookahead <= 1) { if (m(a), 0 === a.lookahead && b === J) return ua; if (0 === a.lookahead) break } a.strstart += a.lookahead, a.lookahead = 0; var d = a.block_start + c; if ((0 === a.strstart || a.strstart >= d) && (a.lookahead = a.strstart - d, a.strstart = d, h(a, !1), 0 === a.strm.avail_out)) return ua; if (a.strstart - a.block_start >= a.w_size - la && (h(a, !1), 0 === a.strm.avail_out)) return ua } return a.insert = 0, b === M ? (h(a, !0), 0 === a.strm.avail_out ? wa : xa) : a.strstart > a.block_start && (h(a, !1), 0 === a.strm.avail_out) ? ua : ua } function o(a, b) { for (var c, d; ;) { if (a.lookahead < la) { if (m(a), a.lookahead < la && b === J) return ua; if (0 === a.lookahead) break } if (c = 0, a.lookahead >= ja && (a.ins_h = (a.ins_h << a.hash_shift ^ a.window[a.strstart + ja - 1]) & a.hash_mask, c = a.prev[a.strstart & a.w_mask] = a.head[a.ins_h], a.head[a.ins_h] = a.strstart), 0 !== c && a.strstart - c <= a.w_size - la && (a.match_length = l(a, c)), a.match_length >= ja) if (d = F._tr_tally(a, a.strstart - a.match_start, a.match_length - ja), a.lookahead -= a.match_length, a.match_length <= a.max_lazy_match && a.lookahead >= ja) { a.match_length--; do a.strstart++ , a.ins_h = (a.ins_h << a.hash_shift ^ a.window[a.strstart + ja - 1]) & a.hash_mask, c = a.prev[a.strstart & a.w_mask] = a.head[a.ins_h], a.head[a.ins_h] = a.strstart; while (0 !== --a.match_length); a.strstart++ } else a.strstart += a.match_length, a.match_length = 0, a.ins_h = a.window[a.strstart], a.ins_h = (a.ins_h << a.hash_shift ^ a.window[a.strstart + 1]) & a.hash_mask; else d = F._tr_tally(a, 0, a.window[a.strstart]), a.lookahead-- , a.strstart++; if (d && (h(a, !1), 0 === a.strm.avail_out)) return ua } return a.insert = a.strstart < ja - 1 ? a.strstart : ja - 1, b === M ? (h(a, !0), 0 === a.strm.avail_out ? wa : xa) : a.last_lit && (h(a, !1), 0 === a.strm.avail_out) ? ua : va } function p(a, b) { for (var c, d, e; ;) { if (a.lookahead < la) { if (m(a), a.lookahead < la && b === J) return ua; if (0 === a.lookahead) break } if (c = 0, a.lookahead >= ja && (a.ins_h = (a.ins_h << a.hash_shift ^ a.window[a.strstart + ja - 1]) & a.hash_mask, c = a.prev[a.strstart & a.w_mask] = a.head[a.ins_h], a.head[a.ins_h] = a.strstart), a.prev_length = a.match_length, a.prev_match = a.match_start, a.match_length = ja - 1, 0 !== c && a.prev_length < a.max_lazy_match && a.strstart - c <= a.w_size - la && (a.match_length = l(a, c), a.match_length <= 5 && (a.strategy === U || a.match_length === ja && a.strstart - a.match_start > 4096) && (a.match_length = ja - 1)), a.prev_length >= ja && a.match_length <= a.prev_length) { e = a.strstart + a.lookahead - ja, d = F._tr_tally(a, a.strstart - 1 - a.prev_match, a.prev_length - ja), a.lookahead -= a.prev_length - 1, a.prev_length -= 2; do ++a.strstart <= e && (a.ins_h = (a.ins_h << a.hash_shift ^ a.window[a.strstart + ja - 1]) & a.hash_mask, c = a.prev[a.strstart & a.w_mask] = a.head[a.ins_h], a.head[a.ins_h] = a.strstart); while (0 !== --a.prev_length); if (a.match_available = 0, a.match_length = ja - 1, a.strstart++ , d && (h(a, !1), 0 === a.strm.avail_out)) return ua } else if (a.match_available) { if (d = F._tr_tally(a, 0, a.window[a.strstart - 1]), d && h(a, !1), a.strstart++ , a.lookahead-- , 0 === a.strm.avail_out) return ua } else a.match_available = 1, a.strstart++ , a.lookahead-- } return a.match_available && (d = F._tr_tally(a, 0, a.window[a.strstart - 1]), a.match_available = 0), a.insert = a.strstart < ja - 1 ? a.strstart : ja - 1, b === M ? (h(a, !0), 0 === a.strm.avail_out ? wa : xa) : a.last_lit && (h(a, !1), 0 === a.strm.avail_out) ? ua : va } function q(a, b) { for (var c, d, e, f, g = a.window; ;) { if (a.lookahead <= ka) { if (m(a), a.lookahead <= ka && b === J) return ua; if (0 === a.lookahead) break } if (a.match_length = 0, a.lookahead >= ja && a.strstart > 0 && (e = a.strstart - 1, d = g[e], d === g[++e] && d === g[++e] && d === g[++e])) { f = a.strstart + ka; do; while (d === g[++e] && d === g[++e] && d === g[++e] && d === g[++e] && d === g[++e] && d === g[++e] && d === g[++e] && d === g[++e] && e < f); a.match_length = ka - (f - e), a.match_length > a.lookahead && (a.match_length = a.lookahead) } if (a.match_length >= ja ? (c = F._tr_tally(a, 1, a.match_length - ja), a.lookahead -= a.match_length, a.strstart += a.match_length, a.match_length = 0) : (c = F._tr_tally(a, 0, a.window[a.strstart]), a.lookahead-- , a.strstart++), c && (h(a, !1), 0 === a.strm.avail_out)) return ua } return a.insert = 0, b === M ? (h(a, !0), 0 === a.strm.avail_out ? wa : xa) : a.last_lit && (h(a, !1), 0 === a.strm.avail_out) ? ua : va } function r(a, b) { for (var c; ;) { if (0 === a.lookahead && (m(a), 0 === a.lookahead)) { if (b === J) return ua; break } if (a.match_length = 0, c = F._tr_tally(a, 0, a.window[a.strstart]), a.lookahead-- , a.strstart++ , c && (h(a, !1), 0 === a.strm.avail_out)) return ua } return a.insert = 0, b === M ? (h(a, !0), 0 === a.strm.avail_out ? wa : xa) : a.last_lit && (h(a, !1), 0 === a.strm.avail_out) ? ua : va } function s(a, b, c, d, e) { this.good_length = a, this.max_lazy = b, this.nice_length = c, this.max_chain = d, this.func = e } function t(a) { a.window_size = 2 * a.w_size, f(a.head), a.max_lazy_match = D[a.level].max_lazy, a.good_match = D[a.level].good_length, a.nice_match = D[a.level].nice_length, a.max_chain_length = D[a.level].max_chain, a.strstart = 0, a.block_start = 0, a.lookahead = 0, a.insert = 0, a.match_length = a.prev_length = ja - 1, a.match_available = 0, a.ins_h = 0 } function u() { this.strm = null, this.status = 0, this.pending_buf = null, this.pending_buf_size = 0, this.pending_out = 0, this.pending = 0, this.wrap = 0, this.gzhead = null, this.gzindex = 0, this.method = $, this.last_flush = -1, this.w_size = 0, this.w_bits = 0, this.w_mask = 0, this.window = null, this.window_size = 0, this.prev = null, this.head = null, this.ins_h = 0, this.hash_size = 0, this.hash_bits = 0, this.hash_mask = 0, this.hash_shift = 0, this.block_start = 0, this.match_length = 0, this.prev_match = 0, this.match_available = 0, this.strstart = 0, this.match_start = 0, this.lookahead = 0, this.prev_length = 0, this.max_chain_length = 0, this.max_lazy_match = 0, this.level = 0, this.strategy = 0, this.good_match = 0, this.nice_match = 0, this.dyn_ltree = new E.Buf16(2 * ha), this.dyn_dtree = new E.Buf16(2 * (2 * fa + 1)), this.bl_tree = new E.Buf16(2 * (2 * ga + 1)), f(this.dyn_ltree), f(this.dyn_dtree), f(this.bl_tree), this.l_desc = null, this.d_desc
20= null, this.bl_desc = null, this.bl_count = new E.Buf16(ia + 1), this.heap = new E.Buf16(2 * ea + 1), f(this.heap), this.heap_len = 0, this.heap_max = 0, this.depth = new E.Buf16(2 * ea + 1), f(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 v(a) { var b; return a && a.state ? (a.total_in = a.total_out = 0, a.data_type = Z, b = a.state, b.pending = 0, b.pending_out = 0, b.wrap < 0 && (b.wrap = -b.wrap), b.status = b.wrap ? na : sa, a.adler = 2 === b.wrap ? 0 : 1, b.last_flush = J, F._tr_init(b), O) : d(a, Q) } function w(a) { var b = v(a); return b === O && t(a.state), b } function x(a, b) { return a && a.state ? 2 !== a.state.wrap ? Q : (a.state.gzhead = b, O) : Q } function y(a, b, c, e, f, g) { if (!a) return Q; var h = 1; if (b === T && (b = 6), e < 0 ? (h = 0, e = -e) : e > 15 && (h = 2, e -= 16), f < 1 || f > _ || c !== $ || e < 8 || e > 15 || b < 0 || b > 9 || g < 0 || g > X) return d(a, Q); 8 === e && (e = 9); var i = new u; return a.state = i, i.strm = a, i.wrap = h, i.gzhead = null, i.w_bits = e, i.w_size = 1 << i.w_bits, i.w_mask = i.w_size - 1, i.hash_bits = f + 7, i.hash_size = 1 << i.hash_bits, i.hash_mask = i.hash_size - 1, i.hash_shift = ~~((i.hash_bits + ja - 1) / ja), i.window = new E.Buf8(2 * i.w_size), i.head = new E.Buf16(i.hash_size), i.prev = new E.Buf16(i.w_size), i.lit_bufsize = 1 << f + 6, i.pending_buf_size = 4 * i.lit_bufsize, i.pending_buf = new E.Buf8(i.pending_buf_size), i.d_buf = 1 * i.lit_bufsize, i.l_buf = 3 * i.lit_bufsize, i.level = b, i.strategy = g, i.method = c, w(a) } function z(a, b) { return y(a, b, $, aa, ba, Y) } function A(a, b) { var c, h, k, l; if (!a || !a.state || b > N || b < 0) return a ? d(a, Q) : Q; if (h = a.state, !a.output || !a.input && 0 !== a.avail_in || h.status === ta && b !== M) return d(a, 0 === a.avail_out ? S : Q); if (h.strm = a, c = h.last_flush, h.last_flush = b, h.status === na) if (2 === h.wrap) a.adler = 0, i(h, 31), i(h, 139), i(h, 8), h.gzhead ? (i(h, (h.gzhead.text ? 1 : 0) + (h.gzhead.hcrc ? 2 : 0) + (h.gzhead.extra ? 4 : 0) + (h.gzhead.name ? 8 : 0) + (h.gzhead.comment ? 16 : 0)), i(h, 255 & h.gzhead.time), i(h, h.gzhead.time >> 8 & 255), i(h, h.gzhead.time >> 16 & 255), i(h, h.gzhead.time >> 24 & 255), i(h, 9 === h.level ? 2 : h.strategy >= V || h.level < 2 ? 4 : 0), i(h, 255 & h.gzhead.os), h.gzhead.extra && h.gzhead.extra.length && (i(h, 255 & h.gzhead.extra.length), i(h, h.gzhead.extra.length >> 8 & 255)), h.gzhead.hcrc && (a.adler = H(a.adler, h.pending_buf, h.pending, 0)), h.gzindex = 0, h.status = oa) : (i(h, 0), i(h, 0), i(h, 0), i(h, 0), i(h, 0), i(h, 9 === h.level ? 2 : h.strategy >= V || h.level < 2 ? 4 : 0), i(h, ya), h.status = sa); else { var m = $ + (h.w_bits - 8 << 4) << 8, n = -1; n = h.strategy >= V || h.level < 2 ? 0 : h.level < 6 ? 1 : 6 === h.level ? 2 : 3, m |= n << 6, 0 !== h.strstart && (m |= ma), m += 31 - m % 31, h.status = sa, j(h, m), 0 !== h.strstart && (j(h, a.adler >>> 16), j(h, 65535 & a.adler)), a.adler = 1 } if (h.status === oa) if (h.gzhead.extra) { for (k = h.pending; h.gzindex < (65535 & h.gzhead.extra.length) && (h.pending !== h.pending_buf_size || (h.gzhead.hcrc && h.pending > k && (a.adler = H(a.adler, h.pending_buf, h.pending - k, k)), g(a), k = h.pending, h.pending !== h.pending_buf_size));)i(h, 255 & h.gzhead.extra[h.gzindex]), h.gzindex++; h.gzhead.hcrc && h.pending > k && (a.adler = H(a.adler, h.pending_buf, h.pending - k, k)), h.gzindex === h.gzhead.extra.length && (h.gzindex = 0, h.status = pa) } else h.status = pa; if (h.status === pa) if (h.gzhead.name) { k = h.pending; do { if (h.pending === h.pending_buf_size && (h.gzhead.hcrc && h.pending > k && (a.adler = H(a.adler, h.pending_buf, h.pending - k, k)), g(a), k = h.pending, h.pending === h.pending_buf_size)) { l = 1; break } l = h.gzindex < h.gzhead.name.length ? 255 & h.gzhead.name.charCodeAt(h.gzindex++) : 0, i(h, l) } while (0 !== l); h.gzhead.hcrc && h.pending > k && (a.adler = H(a.adler, h.pending_buf, h.pending - k, k)), 0 === l && (h.gzindex = 0, h.status = qa) } else h.status = qa; if (h.status === qa) if (h.gzhead.comment) { k = h.pending; do { if (h.pending === h.pending_buf_size && (h.gzhead.hcrc && h.pending > k && (a.adler = H(a.adler, h.pending_buf, h.pending - k, k)), g(a), k = h.pending, h.pending === h.pending_buf_size)) { l = 1; break } l = h.gzindex < h.gzhead.comment.length ? 255 & h.gzhead.comment.charCodeAt(h.gzindex++) : 0, i(h, l) } while (0 !== l); h.gzhead.hcrc && h.pending > k && (a.adler = H(a.adler, h.pending_buf, h.pending - k, k)), 0 === l && (h.status = ra) } else h.status = ra; if (h.status === ra && (h.gzhead.hcrc ? (h.pending + 2 > h.pending_buf_size && g(a), h.pending + 2 <= h.pending_buf_size && (i(h, 255 & a.adler), i(h, a.adler >> 8 & 255), a.adler = 0, h.status = sa)) : h.status = sa), 0 !== h.pending) { if (g(a), 0 === a.avail_out) return h.last_flush = -1, O } else if (0 === a.avail_in && e(b) <= e(c) && b !== M) return d(a, S); if (h.status === ta && 0 !== a.avail_in) return d(a, S); if (0 !== a.avail_in || 0 !== h.lookahead || b !== J && h.status !== ta) { var o = h.strategy === V ? r(h, b) : h.strategy === W ? q(h, b) : D[h.level].func(h, b); if (o !== wa && o !== xa || (h.status = ta), o === ua || o === wa) return 0 === a.avail_out && (h.last_flush = -1), O; if (o === va && (b === K ? F._tr_align(h) : b !== N && (F._tr_stored_block(h, 0, 0, !1), b === L && (f(h.head), 0 === h.lookahead && (h.strstart = 0, h.block_start = 0, h.insert = 0))), g(a), 0 === a.avail_out)) return h.last_flush = -1, O } return b !== M ? O : h.wrap <= 0 ? P : (2 === h.wrap ? (i(h, 255 & a.adler), i(h, a.adler >> 8 & 255), i(h, a.adler >> 16 & 255), i(h, a.adler >> 24 & 255), i(h, 255 & a.total_in), i(h, a.total_in >> 8 & 255), i(h, a.total_in >> 16 & 255), i(h, a.total_in >> 24 & 255)) : (j(h, a.adler >>> 16), j(h, 65535 & a.adler)), g(a), h.wrap > 0 && (h.wrap = -h.wrap), 0 !== h.pending ? O : P) } function B(a) { var b; return a && a.state ? (b = a.state.status, b !== na && b !== oa && b !== pa && b !== qa && b !== ra && b !== sa && b !== ta ? d(a, Q) : (a.state = null, b === sa ? d(a, R) : O)) : Q } function C(a, b) { var c, d, e, g, h, i, j, k, l = b.length; if (!a || !a.state) return Q; if (c = a.state, g = c.wrap, 2 === g || 1 === g && c.status !== na || c.lookahead) return Q; for (1 === g && (a.adler = G(a.adler, b, l, 0)), c.wrap = 0, l >= c.w_size && (0 === g && (f(c.head), c.strstart = 0, c.block_start = 0, c.insert = 0), k = new E.Buf8(c.w_size), E.arraySet(k, b, l - c.w_size, c.w_size, 0), b = k, l = c.w_size), h = a.avail_in, i = a.next_in, j = a.input, a.avail_in = l, a.next_in = 0, a.input = b, m(c); c.lookahead >= ja;) { d = c.strstart, e = c.lookahead - (ja - 1); do c.ins_h = (c.ins_h << c.hash_shift ^ c.window[d + ja - 1]) & c.hash_mask, c.prev[d & c.w_mask] = c.head[c.ins_h], c.head[c.ins_h] = d, d++; while (--e); c.strstart = d, c.lookahead = ja - 1, m(c) } return c.strstart += c.lookahead, c.block_start = c.strstart, c.insert = c.lookahead, c.lookahead = 0, c.match_length = c.prev_length = ja - 1, c.match_available = 0, a.next_in = i, a.input = j, a.avail_in = h, c.wrap = g, O }
20 var D, E = a("../utils/common"), F = a("./trees"), G = a("./adler32"), H = a("./crc32"), I = a("./messages"), J = 0, K = 1, L = 3, M = 4, N = 5, O = 0, P = 1, Q = -2, R = -3, S = -5, T = -1, U = 1, V = 2, W = 3, X = 4, Y = 0, Z = 2, $ = 8, _ = 9, aa = 15, ba = 8, ca = 29, da = 256, ea = da + 1 + ca, fa = 30, ga = 19, ha = 2 * ea + 1, ia = 15, ja = 3, ka = 258, la = ka + ja + 1, ma = 32, na = 42, oa = 69, pa = 73, qa = 91, ra = 103, sa = 113, ta = 666, ua = 1, va = 2, wa = 3, xa = 4, ya = 3; D = [new s(0, 0, 0, 0, n), new s(4, 4, 8, 4, o), new s(4, 5, 16, 8, o), new s(4, 6, 32, 32, o), new s(4, 4, 16, 16, p), new s(8, 16, 32, 32, p), new s(8, 16, 128, 128, p), new s(8, 32, 128, 256, p), new s(32, 128, 258, 1024, p), new s(32, 258, 258, 4096, p)], c.deflateInit = z, c.deflateInit2 = y, c.deflateReset = w, c.deflateResetKeep = v, c.deflateSetHeader = x, c.deflate = A, c.deflateEnd = B, c.deflateSetDictionary = C, c.deflateInfo = "pako deflate (from Nodeca project)" }, { "../utils/common": 28, "./adler32": 30, "./crc32": 32, "./messages": 38, "./trees": 39 }], 34: [function (a, b, c) { "use strict"; function d() { this.text = 0, this.time = 0, this.xflags = 0, this.os = 0, this.extra = null, this.extra_len = 0, this.name = "", this.comment = "", this.hcrc = 0, this.done = !1 } b.exports = d }, {}], 35: [function (a, b, c) { "use strict"; var d = 30, e = 12; b.exports = function (a, b) { var c, f, g, h, i, j, k, l, m, n, o, p, q, r, s, t, u, v, w, x, y, z, A, B, C; c = a.state, f = a.next_in, B = a.input, g = f + (a.avail_in - 5), h = a.next_out, C = a.output, i = h - (b - a.avail_out), j = h + (a.avail_out - 257), k = c.dmax, l = c.wsize, m = c.whave, n = c.wnext, o = c.window, p = c.hold, q = c.bits, r = c.lencode, s = c.distcode, t = (1 << c.lenbits) - 1, u = (1 << c.distbits) - 1; a: do { q < 15 && (p += B[f++] << q, q += 8, p += B[f++] << q, q += 8), v = r[p & t]; b: for (; ;) { if (w = v >>> 24, p >>>= w, q -= w, w = v >>> 16 & 255, 0 === w) C[h++] = 65535 & v; else { if (!(16 & w)) { if (0 === (64 & w)) { v = r[(65535 & v) + (p & (1 << w) - 1)]; continue b } if (32 & w) { c.mode = e; break a } a.msg = "invalid literal/length code", c.mode = d; break a } x = 65535 & v, w &= 15, w && (q < w && (p += B[f++] << q, q += 8), x += p & (1 << w) - 1, p >>>= w, q -= w), q < 15 && (p += B[f++] << q, q += 8, p += B[f++] << q, q += 8), v = s[p & u]; c: for (; ;) { if (w = v >>> 24, p >>>= w, q -= w, w = v >>> 16 & 255, !(16 & w)) { if (0 === (64 & w)) { v = s[(65535 & v) + (p & (1 << w) - 1)]; continue c } a.msg = "invalid distance code", c.mode = d; break a } if (y = 65535 & v, w &= 15, q < w && (p += B[f++] << q, q += 8, q < w && (p += B[f++] << q, q += 8)), y += p & (1 << w) - 1, y > k) { a.msg = "invalid distance too far back", c.mode = d; break a } if (p >>>= w, q -= w, w = h - i, y > w) { if (w = y - w, w > m && c.sane) { a.msg = "invalid distance too far back", c.mode = d; break a } if (z = 0, A = o, 0 === n) { if (z += l - w, w < x) { x -= w; do C[h++] = o[z++]; while (--w); z = h - y, A = C } } else if (n < w) { if (z += l + n - w, w -= n, w < x) { x -= w; do C[h++] = o[z++]; while (--w); if (z = 0, n < x) { w = n, x -= w; do C[h++] = o[z++]; while (--w); z = h - y, A = C } } } else if (z += n - w, w < x) { x -= w; do C[h++] = o[z++]; while (--w); z = h - y, A = C } for (; x > 2;)C[h++] = A[z++], C[h++] = A[z++], C[h++] = A[z++], x -= 3; x && (C[h++] = A[z++], x > 1 && (C[h++] = A[z++])) } else { z = h - y; do C[h++] = C[z++], C[h++] = C[z++], C[h++] = C[z++], x -= 3; while (x > 2); x && (C[h++] = C[z++], x > 1 && (C[h++] = C[z++])) } break } } break } } while (f < g && h < j); x = q >> 3, f -= x, q -= x << 3, p &= (1 << q) - 1, a.next_in = f, a.next_out = h, a.avail_in = f < g ? 5 + (g - f) : 5 - (f - g), a.avail_out = h < j ? 257 + (j - h) : 257 - (h - j), c.hold = p, c.bits = q } }, {}], 36: [function (a, b, c) { 21 "use strict"; function d(a) { return (a >>> 24 & 255) + (a >>> 8 & 65280) + ((65280 & a) << 8) + ((255 & a) << 24) } function e() { this.mode = 0, this.last = !1, this.wrap = 0, this.havedict = !1, this.flags = 0, this.dmax = 0, this.check = 0, this.total = 0, this.head = null, this.wbits = 0, this.wsize = 0, this.whave = 0, this.wnext = 0, this.window = null, this.hold = 0, this.bits = 0, this.length = 0, this.offset = 0, this.extra = 0, this.lencode = null, this.distcode = null, this.lenbits = 0, this.distbits = 0, this.ncode = 0, this.nlen = 0, this.ndist = 0, this.have = 0, this.next = null, this.lens = new s.Buf16(320), this.work = new s.Buf16(288), this.lendyn = null, this.distdyn = null, this.sane = 0, this.back = 0, this.was = 0 } function f(a) { var b; return a && a.state ? (b = a.state, a.total_in = a.total_out = b.total = 0, a.msg = "", b.wrap && (a.adler = 1 & b.wrap), b.mode = L, b.last = 0, b.havedict = 0, b.dmax = 32768, b.head = null, b.hold = 0, b.bits = 0, b.lencode = b.lendyn = new s.Buf32(pa), b.distcode = b.distdyn = new s.Buf32(qa), b.sane = 1, b.back = -1, D) : G }
21 function g(a) { var b; return a && a.state ? (b = a.state, b.wsize = 0, b.whave = 0, b.wnext = 0, f(a)) : G } function h(a, b) { var c, d; return a && a.state ? (d = a.state, b < 0 ? (c = 0, b = -b) : (c = (b >> 4) + 1, b < 48 && (b &= 15)), b && (b < 8 || b > 15) ? G : (null !== d.window && d.wbits !== b && (d.window = null), d.wrap = c, d.wbits = b, g(a))) : G } function i(a, b) { var c, d; return a ? (d = new e, a.state = d, d.window = null, c = h(a, b), c !== D && (a.state = null), c) : G } function j(a) { return i(a, sa) } function k(a) { if (ta) { var b; for (q = new s.Buf32(512), r = new s.Buf32(32), b = 0; b < 144;)a.lens[b++] = 8; for (; b < 256;)a.lens[b++] = 9; for (; b < 280;)a.lens[b++] = 7; for (; b < 288;)a.lens[b++] = 8; for (w(y, a.lens, 0, 288, q, 0, a.work, { bits: 9 }), b = 0; b < 32;)a.lens[b++] = 5; w(z, a.lens, 0, 32, r, 0, a.work, { bits: 5 }), ta = !1 } a.lencode = q, a.lenbits = 9, a.distcode = r, a.distbits = 5 } function l(a, b, c, d) { var e, f = a.state; return null === f.window && (f.wsize = 1 << f.wbits, f.wnext = 0, f.whave = 0, f.window = new s.Buf8(f.wsize)), d >= f.wsize ? (s.arraySet(f.window, b, c - f.wsize, f.wsize, 0), f.wnext = 0, f.whave = f.wsize) : (e = f.wsize - f.wnext, e > d && (e = d), s.arraySet(f.window, b, c - d, e, f.wnext), d -= e, d ? (s.arraySet(f.window, b, c - d, d, 0), f.wnext = d, f.whave = f.wsize) : (f.wnext += e, f.wnext === f.wsize && (f.wnext = 0), f.whave < f.wsize && (f.whave += e))), 0 } function m(a, b) { 22 var c, e, f, g, h, i, j, m, n, o, p, q, r, pa, qa, ra, sa, ta, ua, va, wa, xa, ya, za, Aa = 0, Ba = new s.Buf8(4), Ca = [16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15]; if (!a || !a.state || !a.output || !a.input && 0 !== a.avail_in) return G; c = a.state, c.mode === W && (c.mode = X), h = a.next_out, f = a.output, j = a.avail_out, g = a.next_in, e = a.input, i = a.avail_in, m = c.hold, n = c.bits, o = i, p = j, xa = D; a: for (; ;)switch (c.mode) { 23 case L: if (0 === c.wrap) { c.mode = X; break } for (; n < 16;) { if (0 === i) break a; i-- , m += e[g++] << n, n += 8 } if (2 & c.wrap && 35615 === m) { c.check = 0, Ba[0] = 255 & m, Ba[1] = m >>> 8 & 255, c.check = u(c.check, Ba, 2, 0), m = 0, n = 0, c.mode = M; break } if (c.flags = 0, c.head && (c.head.done = !1), !(1 & c.wrap) || (((255 & m) << 8) + (m >> 8)) % 31) { a.msg = "incorrect header check", c.mode = ma; break } if ((15 & m) !== K) { a.msg = "unknown compression method", c.mode = ma; break } if (m >>>= 4, n -= 4, wa = (15 & m) + 8, 0 === c.wbits) c.wbits = wa; else if (wa > c.wbits) { a.msg = "invalid window size", c.mode = ma; break } c.dmax = 1 << wa, a.adler = c.check = 1, c.mode = 512 & m ? U : W, m = 0, n = 0; break; case M: for (; n < 16;) { if (0 === i) break a; i-- , m += e[g++] << n, n += 8 } if (c.flags = m, (255 & c.flags) !== K) { a.msg = "unknown compression method", c.mode = ma; break } if (57344 & c.flags) { a.msg = "unknown header flags set", c.mode = ma; break } c.head && (c.head.text = m >> 8 & 1), 512 & c.flags && (Ba[0] = 255 & m, Ba[1] = m >>> 8 & 255, c.check = u(c.check, Ba, 2, 0)), m = 0, n = 0, c.mode = N; case N: for (; n < 32;) { if (0 === i) break a; i-- , m += e[g++] << n, n += 8 } c.head && (c.head.time = m), 512 & c.flags && (Ba[0] = 255 & m, Ba[1] = m >>> 8 & 255, Ba[2] = m >>> 16 & 255, Ba[3] = m >>> 24 & 255, c.check = u(c.check, Ba, 4, 0)), m = 0, n = 0, c.mode = O; case O: for (; n < 16;) { 24 if (0 === i) break a; i-- , m += e[g++] << n, 25 n += 8 26 } c.head && (c.head.xflags = 255 & m, c.head.os = m >> 8), 512 & c.flags && (Ba[0] = 255 & m, Ba[1] = m >>> 8 & 255, c.check = u(c.check, Ba, 2, 0)), m = 0, n = 0, c.mode = P; case P: if (1024 & c.flags) { for (; n < 16;) { if (0 === i) break a; i-- , m += e[g++] << n, n += 8 } c.length = m, c.head && (c.head.extra_len = m), 512 & c.flags && (Ba[0] = 255 & m, Ba[1] = m >>> 8 & 255, c.check = u(c.check, Ba, 2, 0)), m = 0, n = 0 } else c.head && (c.head.extra = null); c.mode = Q; case Q: if (1024 & c.flags && (q = c.length, q >
vendor: 1,749 bytes, line 26
26 i && (q = i), q && (c.head && (wa = c.head.extra_len - c.length, c.head.extra || (c.head.extra = new Array(c.head.extra_len)), s.arraySet(c.head.extra, e, g, q, wa)), 512 & c.flags && (c.check = u(c.check, e, q, g)), i -= q, g += q, c.length -= q), c.length)) break a; c.length = 0, c.mode = R; case R: if (2048 & c.flags) { if (0 === i) break a; q = 0; do wa = e[g + q++], c.head && wa && c.length < 65536 && (c.head.name += String.fromCharCode(wa)); while (wa && q < i); if (512 & c.flags && (c.check = u(c.check, e, q, g)), i -= q, g += q, wa) break a } else c.head && (c.head.name = null); c.length = 0, c.mode = S; case S: if (4096 & c.flags) { if (0 === i) break a; q = 0; do wa = e[g + q++], c.head && wa && c.length < 65536 && (c.head.comment += String.fromCharCode(wa)); while (wa && q < i); if (512 & c.flags && (c.check = u(c.check, e, q, g)), i -= q, g += q, wa) break a } else c.head && (c.head.comment = null); c.mode = T; case T: if (512 & c.flags) { for (; n < 16;) { if (0 === i) break a; i-- , m += e[g++] << n, n += 8 } if (m !== (65535 & c.check)) { a.msg = "header crc mismatch", c.mode = ma; break } m = 0, n = 0 } c.head && (c.head.hcrc = c.flags >> 9 & 1, c.head.done = !0), a.adler = c.check = 0, c.mode = W; break; case U: for (; n < 32;) { if (0 === i) break a; i-- , m += e[g++] << n, n += 8 } a.adler = c.check = d(m), m = 0, n = 0, c.mode = V; case V: if (0 === c.havedict) return a.next_out = h, a.avail_out = j, a.next_in = g, a.avail_in = i, c.hold = m, c.bits = n, F; a.adler = c.check = 1, c.mode = W; case W: if (b === B || b === C) break a; case X: if (c.last) { m >>>= 7 & n, n -= 7 & n, c.mode = ja; break } for (; n < 3;) { if (0 === i) break a; i-- , m += e[g++] << n, n += 8 } switch (c.last = 1 & m, m >>>
26= 1, n -= 1, 3 & m) { case 0: c.mode = Y; break; case 1: if (k(c), c.mode = ca, b === C) { m >>>= 2, n -= 2; break a } break; case 2: c.mode = _; break; case 3: a.msg = "invalid block type", c.mode = ma }m >>>= 2, n -= 2; break; case Y: for (m >>>= 7 & n, n -= 7 & n; n < 32;) { if (0 === i) break a; i-- , m += e[g++] << n, n += 8 } if ((65535 & m) !== (m >>> 16 ^ 65535)) { a.msg = "invalid stored block lengths", c.mode = ma; break } if (c.length = 65535 & m, m = 0, n = 0, c.mode = Z, b === C) break a; case Z: c.mode = $; case $: if (q = c.length) { if (q > i && (q = i), q > j && (q = j), 0 === q) break a; s.arraySet(f, e, g, q, h), i -= q, g += q, j -= q, h += q, c.length -= q; break } c.mode = W; break; case _: for (; n < 14;) { if (0 === i) break a; i-- , m += e[g++] << n, n += 8 } if (c.nlen = (31 & m) + 257, m >>>= 5, n -= 5, c.ndist = (31 & m) + 1, m >>>= 5, n -= 5, c.ncode = (15 & m) + 4, m >>>= 4, n -= 4, c.nlen > 286 || c.ndist > 30) { a.msg = "too many length or distance symbols", c.mode = ma; break } c.have = 0, c.mode = aa; case aa: for (; c.have < c.ncode;) { for (; n < 3;) { if (0 === i) break a; i-- , m += e[g++] << n, n += 8 } c.lens[Ca[c.have++]] = 7 & m, m >>>= 3, n -= 3 } for (; c.have < 19;)c.lens[Ca[c.have++]] = 0; if (c.lencode = c.lendyn, c.lenbits = 7, ya = { bits: c.lenbits }, xa = w(x, c.lens, 0, 19, c.lencode, 0, c.work, ya), c.lenbits = ya.bits, xa) { a.msg = "invalid code lengths set", c.mode = ma; break } c.have = 0, c.mode = ba; case ba: for (; c.have < c.nlen + c.ndist;) { for (; Aa = c.lencode[m & (1 << c.lenbits) - 1], qa = Aa >>> 24, ra = Aa >>> 16 & 255, sa = 65535 & Aa, !(qa <= n);) { if (0 === i) break a; i-- , m += e[g++] << n, n += 8 } if (sa < 16) m >>>= qa, n -= qa, c.lens[c.have++] = sa; else { if (16 === sa) { for (za = qa + 2; n < za;) { if (0 === i) break a; i-- , m += e[g++] << n, n += 8 } if (m >>>= qa, n -= qa, 0 === c.have) { a.msg = "invalid bit length repeat", c.mode = ma; break } wa = c.lens[c.have - 1], q = 3 + (3 & m), m >>>= 2, n -= 2 } else if (17 === sa) { for (za = qa + 3; n < za;) { if (0 === i) break a; i-- , m += e[g++] << n, n += 8 } m >>>= qa, n -= qa, wa = 0, q = 3 + (7 & m), m >>>= 3, n -= 3 } else { for (za = qa + 7; n < za;) { if (0 === i) break a; i-- , m += e[g++] << n, n += 8 } m >>>= qa, n -= qa, wa = 0, q = 11 + (127 & m), m >>
26>= 7, n -= 7 } if (c.have + q > c.nlen + c.ndist) { a.msg = "invalid bit length repeat", c.mode = ma; break } for (; q--;)c.lens[c.have++] = wa } } if (c.mode === ma) break; if (0 === c.lens[256]) { a.msg = "invalid code -- missing end-of-block", c.mode = ma; break } if (c.lenbits = 9, ya = { bits: c.lenbits }, xa = w(y, c.lens, 0, c.nlen, c.lencode, 0, c.work, ya), c.lenbits = ya.bits, xa) { a.msg = "invalid literal/lengths set", c.mode = ma; break } if (c.distbits = 6, c.distcode = c.distdyn, ya = { bits: c.distbits }, xa = w(z, c.lens, c.nlen, c.ndist, c.distcode, 0, c.work, ya), c.distbits = ya.bits, xa) { a.msg = "invalid distances set", c.mode = ma; break } if (c.mode = ca, b === C) break a; case ca: c.mode = da; case da: if (i >= 6 && j >= 258) { a.next_out = h, a.avail_out = j, a.next_in = g, a.avail_in = i, c.hold = m, c.bits = n, v(a, p), h = a.next_out, f = a.output, j = a.avail_out, g = a.next_in, e = a.input, i = a.avail_in, m = c.hold, n = c.bits, c.mode === W && (c.back = -1); break } for (c.back = 0; Aa = c.lencode[m & (1 << c.lenbits) - 1], qa = Aa >>> 24, ra = Aa >>> 16 & 255, sa = 65535 & Aa, !(qa <= n);) { if (0 === i) break a; i-- , m += e[g++] << n, n += 8 } if (ra && 0 === (240 & ra)) { for (ta = qa, ua = ra, va = sa; Aa = c.lencode[va + ((m & (1 << ta + ua) - 1) >> ta)], qa = Aa >>> 24, ra = Aa >>> 16 & 255, sa = 65535 & Aa, !(ta + qa <= n);) { if (0 === i) break a; i-- , m += e[g++] << n, n += 8 } m >>>= ta, n -= ta, c.back += ta } if (m >>>= qa, n -= qa, c.back += qa, c.length = sa, 0 === ra) { c.mode = ia; break } if (32 & ra) { c.back = -1, c.mode = W; break } if (64 & ra) { a.msg = "invalid literal/length code", c.mode = ma; break } c.extra = 15 & ra, c.mode = ea; case ea: if (c.extra) { for (za = c.extra; n < za;) { if (0 === i) break a; i-- , m += e[g++] << n, n += 8 } c.length += m & (1 << c.extra) - 1, m >>>= c.extra, n -= c.extra, c.back += c.extra } c.was = c.length, c.mode = fa; case fa: for (; Aa = c.distcode[m & (1 << c.distbits) - 1], qa = Aa >>> 24, ra = Aa >>> 16 & 255, sa = 65535 & Aa, !(qa <= n);) { if (0 === i) break a; i-- , m += e[g++] << n, n += 8 } if (0 === (240 & ra)) { for (ta = qa, ua = ra, va = sa; Aa = c.distcode[va + ((m & (1 << ta + ua) - 1) >> ta)], qa = Aa >>> 24, ra = Aa >>> 16 & 255, sa = 65535 & Aa, !(ta + qa <= n);) { if (0 === i) break a; i-- , m += e[g++] << n, n += 8 } m >>>= ta, n -= ta, c.back += ta } if (m >>>= qa, n -= qa, c.back += qa, 64 & ra) { a.msg = "invalid distance code", c.mode = ma; break } c.offset = sa, c.extra = 15 & ra, c.mode = ga; case ga: if (c.extra) { for (za = c.extra; n < za;) { if (0 === i) break a; i-- , m += e[g++] << n, n += 8 } c.offset += m & (1 << c.extra) - 1, m >>>= c.extra, n -= c.extra, c.back += c.extra } if (c.offset > c.dmax) { a.msg = "invalid distance too far back", c.mode = ma; break } c.mode = ha; case ha: if (0 === j) break a; if (q = p - j, c.offset > q) { if (q = c.offset - q, q > c.whave && c.sane) { a.msg = "invalid distance too far back", c.mode = ma; break } q > c.wnext ? (q -= c.wnext, r = c.wsize - q) : r = c.wnext - q, q > c.length && (q = c.length), pa = c.window } else pa = f, r = h - c.offset, q = c.length; q > j && (q = j), j -= q, c.length -= q; do f[h++] = pa[r++]; while (--q); 0 === c.length && (c.mode = da); break; case ia: if (0 === j) break a; f[h++] = c.length, j-- , c.mode = da; break; case ja: if (c.wrap) { for (; n < 32;) { if (0 === i) break a; i-- , m |= e[g++] << n, n += 8 } if (p -= j, a.total_out += p, c.total += p, p && (a.adler = c.check = c.flags ? u(c.check, f, p, h - p) : t(c.check, f, p, h - p)), p = j, (c.flags ? m : d(m)) !== c.check) { a.msg = "incorrect data check", c.mode = ma; break } m = 0, n = 0 } c.mode = ka; case ka: if (c.wrap && c.flags) { for (; n < 32;) { if (0 === i) break a; i-- , m += e[g++] << n, n += 8 } if (m !== (4294967295 & c.total)) { a.msg = "incorrect length check", c.mode = ma; break } m = 0, n = 0 } c.mode = la; case la: xa = E; break a; case ma: xa = H; break a; case na: return I; case oa: default: return G 27 }return a.next_out = h, a.avail_out = j, a.next_in = g, a.avail_in = i, c.hold = m, c.bits = n, (c.wsize || p !== a.avail_out && c.mode < ma && (c.mode < ja || b !== A)) && l(a, a.output, a.next_out, p - a.avail_out) ? (c.mode = na, I) : (o -= a.avail_in, p -= a.avail_out, a.total_in += o, a.total_out += p, c.total += p, c.wrap && p && (a.adler = c.check = c.flags ? u(c.check, f, p, a.next_out - p) : t(c.check, f, p, a.next_out - p)), a.data_type = c.bits + (c.last ? 64 : 0) + (c.mode === W ? 128 : 0) + (c.mode === ca || c.mode === Z ? 256 : 0), (0 === o && 0 === p || b === A) && xa === D && (xa = J), xa) 28 } function n(a) { if (!a || !a.state) return G; var b = a.state; return b.window && (b.window = null), a.state = null, D } function o(a, b) { var c; return a && a.state ? (c = a.state, 0 === (2 & c.wrap) ? G : (c.head = b, b.done = !1, D)) : G } function p(a, b) { var c, d, e, f = b.length; return a && a.state ? (c = a.state, 0 !== c.wrap && c.mode !== V ? G : c.mode === V && (d = 1, d = t(d, b, f,
280), d !== c.check) ? H : (e = l(a, b, f, f)) ? (c.mode = na, I) : (c.havedict = 1, D)) : G } var q, r, s = a("../utils/common"), t = a("./adler32"), u = a("./crc32"), v = a("./inffast"), w = a("./inftrees"), x = 0, y = 1, z = 2, A = 4, B = 5, C = 6, D = 0, E = 1, F = 2, G = -2, H = -3, I = -4, J = -5, K = 8, L = 1, M = 2, N = 3, O = 4, P = 5, Q = 6, R = 7, S = 8, T = 9, U = 10, V = 11, W = 12, X = 13, Y = 14, Z = 15, $ = 16, _ = 17, aa = 18, ba = 19, ca = 20, da = 21, ea = 22, fa = 23, ga = 24, ha = 25, ia = 26, ja = 27, ka = 28, la = 29, ma = 30, na = 31, oa = 32, pa = 852, qa = 592, ra = 15, sa = ra, ta = !0; c.inflateReset = g, c.inflateReset2 = h, c.inflateResetKeep = f, c.inflateInit = j, c.inflateInit2 = i, c.inflate = m, c.inflateEnd = n, c.inflateGetHeader = o, c.inflateSetDictionary = p, c.inflateInfo = "pako inflate (from Nodeca project)" 29 }, { "../utils/common": 28, "./adler32": 30, "./crc32": 32, "./inffast": 35, "./inftrees": 37 }], 37: [function (a, b, c) { "use strict"; var d = a("../utils/common"), e = 15, f = 852, g = 592, h = 0, i = 1, j = 2, k = [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], l = [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], m = [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], n = [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]; b.exports = function (a, b, c, o, p, q, r, s) { var t, u, v, w, x, y, z, A, B, C = s.bits, D = 0, E = 0, F = 0, G = 0, H = 0, I = 0, J = 0, K = 0, L = 0, M = 0, N = null, O = 0, P = new d.Buf16(e + 1), Q = new d.Buf16(e + 1), R = null, S = 0; for (D = 0; D <= e; D++)P[D] = 0; for (E = 0; E < o; E++)P[b[c + E]]++; for (H = C, G = e; G >= 1 && 0 === P[G]; G--); if (H > G && (H = G), 0 === G) return p[q++] = 20971520, p[q++] = 20971520, s.bits = 1, 0; for (F = 1; F < G && 0 === P[F]; F++); for (H < F && (H = F), K = 1, D = 1; D <= e; D++)if (K <<= 1, K -= P[D], K < 0) return -1; if (K > 0 && (a === h || 1 !== G)) return -1; for (Q[1] = 0, D = 1; D < e; D++)Q[D + 1] = Q[D] + P[D]; for (E = 0; E < o; E++)0 !== b[c + E] && (r[Q[b[c + E]]++] = E); if (a === h ? (N = R = r, y = 19) : a === i ? (N = k, O -= 257, R = l, S -= 257, y = 256) : (N = m, R = n, y = -1), M = 0, E = 0, D = F, x = q, I = H, J = 0, v = -1, L = 1 << H, w = L - 1, a === i && L > f || a === j && L > g) return 1; for (var T = 0; ;) { T++ , z = D - J, r[E] < y ? (A = 0, B = r[E]) : r[E] > y ? (A = R[S + r[E]], B = N[O + r[E]]) : (A = 96, B = 0), t = 1 << D - J, u = 1 << I, F = u; do u -= t, p[x + (M >> J) + u] = z << 24 | A << 16 | B | 0; while (0 !== u); for (t = 1 << D - 1; M & t;)t >>= 1; if (0 !== t ? (M &= t - 1, M += t) : M = 0, E++ , 0 === --P[D]) { if (D === G) break; D = b[c + r[E]] } if (D > H && (M & w) !== v) { for (0 === J && (J = H), x += F, I = D - J, K = 1 << I; I + J < G && (K -= P[I + J], !(K <= 0));)I++ , K <<= 1; if (L += 1 << I, a === i && L > f || a === j && L > g) return 1; v = M & w, p[v] = H << 24 | I << 16 | x - q | 0 } } return 0 !== M && (p[x + M] = D - J << 24 | 64 << 16 | 0), s.bits = H, 0 } }, { "../utils/common": 28 }], 38: [function (a, b, c) { "use strict"; b.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" } }, {}], 39: [function (a, b, c) { "use strict"; function d(a) { for (var b = a.length; --b >= 0;)a[b] = 0 } function e(a, b, c, d, e) { this.static_tree = a, this.extra_bits = b, this.extra_base = c, this.elems = d, this.max_length = e, this.has_stree = a && a.length } function f(a, b) { this.dyn_tree = a, this.max_code = 0, this.stat_desc = b } function g(a) { return a < 256 ? ia[a] : ia[256 + (a >>> 7)] } function h(a, b) { a.pending_buf[a.pending++] = 255 & b, a.pending_buf[a.pending++] = b >>> 8 & 255 } function i(a, b, c) { a.bi_valid >
29 X - c ? (a.bi_buf |= b << a.bi_valid & 65535, h(a, a.bi_buf), a.bi_buf = b >> X - a.bi_valid, a.bi_valid += c - X) : (a.bi_buf |= b << a.bi_valid & 65535, a.bi_valid += c) } function j(a, b, c) { i(a, c[2 * b], c[2 * b + 1]) } function k(a, b) { var c = 0; do c |= 1 & a, a >>>= 1, c <<= 1; while (--b > 0); return c >>> 1 } function l(a) { 16 === a.bi_valid ? (h(a, a.bi_buf), a.bi_buf = 0, a.bi_valid = 0) : a.bi_valid >= 8 && (a.pending_buf[a.pending++] = 255 & a.bi_buf, a.bi_buf >>= 8, a.bi_valid -= 8) } function m(a, b) { var c, d, e, f, g, h, i = b.dyn_tree, j = b.max_code, k = b.stat_desc.static_tree, l = b.stat_desc.has_stree, m = b.stat_desc.extra_bits, n = b.stat_desc.extra_base, o = b.stat_desc.max_length, p = 0; for (f = 0; f <= W; f++)a.bl_count[f] = 0; for (i[2 * a.heap[a.heap_max] + 1] = 0, c = a.heap_max + 1; c < V; c++)d = a.heap[c], f = i[2 * i[2 * d + 1] + 1] + 1, f > o && (f = o, p++), i[2 * d + 1] = f, d > j || (a.bl_count[f]++ , g = 0, d >= n && (g = m[d - n]), h = i[2 * d], a.opt_len += h * (f + g), l && (a.static_len += h * (k[2 * d + 1] + g))); if (0 !== p) { do { for (f = o - 1; 0 === a.bl_count[f];)f--; a.bl_count[f]-- , a.bl_count[f + 1] += 2, a.bl_count[o]-- , p -= 2 } while (p > 0); for (f = o; 0 !== f; f--)for (d = a.bl_count[f]; 0 !== d;)e = a.heap[--c], e > j || (i[2 * e + 1] !== f && (a.opt_len += (f - i[2 * e + 1]) * i[2 * e], i[2 * e + 1] = f), d--) } } function n(a, b, c) { var d, e, f = new Array(W + 1), g = 0; for (d = 1; d <= W; d++)f[d] = g = g + c[d - 1] << 1; for (e = 0; e <= b; e++) { var h = a[2 * e + 1]; 0 !== h && (a[2 * e] = k(f[h]++, h)) } } function o() { var a, b, c, d, f, g = new Array(W + 1); for (c = 0, d = 0; d < Q - 1; d++)for (ka[d] = c, a = 0; a < 1 << ba[d]; a++)ja[c++] = d; for (ja[c - 1] = d, f = 0, d = 0; d < 16; d++)for (la[d] = f, a = 0; a < 1 << ca[d]; a++)ia[f++] = d; for (f >>= 7; d < T; d++)for (la[d] = f << 7, a = 0; a < 1 << ca[d] - 7; a++)ia[256 + f++] = d; for (b = 0; b <= W; b++)g[b] = 0; for (a = 0; a <= 143;)ga[2 * a + 1] = 8, a++ , g[8]++; for (; a <= 255;)ga[2 * a + 1] = 9, a++ , g[9]++; for (; a <= 279;)ga[2 * a + 1] = 7, a++ , g[7]++; for (; a <= 287;)ga[2 * a + 1] = 8, a++ , g[8]++; for (n(ga, S + 1, g), a = 0; a < T; a++)ha[2 * a + 1] = 5, ha[2 * a] = k(a, 5); ma = new e(ga, ba, R + 1, S, W), na = new e(ha, ca, 0, T, W), oa = new e(new Array(0), da, 0, U, Y) } function p(a) { var b; for (b = 0; b < S; b++)a.dyn_ltree[2 * b] = 0; for (b = 0; b < T; b++)a.dyn_dtree[2 * b] = 0; for (b = 0; b < U; b++)a.bl_tree[2 * b] = 0; a.dyn_ltree[2 * Z] = 1, a.opt_len = a.static_len = 0, a.last_lit = a.matches = 0 } function q(a) { a.bi_valid > 8 ? h(a, a.bi_buf) : a.bi_valid > 0 && (a.pending_buf[a.pending++] = a.bi_buf), a.bi_buf = 0, a.bi_valid = 0 } function r(a, b, c, d) { q(a), d && (h(a, c), h(a, ~c)), G.arraySet(a.pending_buf, a.window, b, c, a.pending), a.pending += c } function s(a, b, c, d) { var e = 2 * b, f = 2 * c; return a[e] < a[f] || a[e] === a[f] && d[b] <= d[c] } function t(a, b, c) { for (var d = a.heap[c], e = c << 1; e <= a.heap_len && (e < a.heap_len && s(b, a.heap[e + 1], a.heap[e], a.depth) && e++ , !s(b, d, a.heap[e], a.depth));)a.heap[c] = a.heap[e], c = e, e <<= 1; a.heap[c] = d } function u(a, b, c) { var d, e, f, h, k = 0; if (0 !== a.last_lit) do d = a.pending_buf[a.d_buf + 2 * k] << 8 | a.pending_buf[a.d_buf + 2 * k + 1], e = a.pending_buf[a.l_buf + k], k++ , 0 === d ? j(a, e, b) : (f = ja[e], j(a, f + R + 1, b), h = ba[f], 0 !== h && (e -= ka[f], i(a, e, h)), d-- , f = g(d), j(a, f, c), h = ca[f], 0 !== h && (d -= la[f], i(a, d, h))); while (k < a.last_lit); j(a, Z, b) } function v(a, b) { var c, d, e, f = b.dyn_tree, g = b.stat_desc.static_tree, h = b.stat_desc.has_stree, i = b.stat_desc.elems, j = -1; for (a.heap_len = 0, a.heap_max = V, c = 0; c < i; c++)0 !== f[2 * c] ? (a.heap[++a.heap_len] = j = c, a.depth[c] = 0) : f[2 * c + 1] = 0; for (; a.heap_len < 2;)e = a.heap[++a.heap_len] = j < 2 ? ++j : 0, f[2 * e] = 1, a.depth[e] = 0, a.opt_len-- , h && (a.static_len -= g[2 * e + 1]); for (b.max_code = j, c = a.heap_len >> 1; c >= 1; c--)t(a, f, c); e = i; do c = a.heap[1], a.heap[1] = a.heap[a.heap_len--], t(a, f, 1), d = a.heap[1], a.heap[--a.heap_max] = c, a.heap[--a.heap_max] = d, f[2 * e] = f[2 * c] + f[2 * d], a.depth[e] = (a.depth[c] >= a.depth[d] ? a.depth[c] : a.depth[d]) + 1, f[2 * c + 1] = f[2 * d + 1] = e, a.heap[1] = e++ , t(a, f, 1); while (a.heap_len >= 2);
29 a.heap[--a.heap_max] = a.heap[1], m(a, b), n(f, j, a.bl_count) } function w(a, b, c) { var d, e, f = -1, g = b[1], h = 0, i = 7, j = 4; for (0 === g && (i = 138, j = 3), b[2 * (c + 1) + 1] = 65535, d = 0; d <= c; d++)e = g, g = b[2 * (d + 1) + 1], ++h < i && e === g || (h < j ? a.bl_tree[2 * e] += h : 0 !== e ? (e !== f && a.bl_tree[2 * e]++ , a.bl_tree[2 * $]++) : h <= 10 ? a.bl_tree[2 * _]++ : a.bl_tree[2 * aa]++ , h = 0, f = e, 0 === g ? (i = 138, j = 3) : e === g ? (i = 6, j = 3) : (i = 7, j = 4)) } function x(a, b, c) { var d, e, f = -1, g = b[1], h = 0, k = 7, l = 4; for (0 === g && (k = 138, l = 3), d = 0; d <= c; d++)if (e = g, g = b[2 * (d + 1) + 1], !(++h < k && e === g)) { if (h < l) { do j(a, e, a.bl_tree); while (0 !== --h) } else 0 !== e ? (e !== f && (j(a, e, a.bl_tree), h--), j(a, $, a.bl_tree), i(a, h - 3, 2)) : h <= 10 ? (j(a, _, a.bl_tree), i(a, h - 3, 3)) : (j(a, aa, a.bl_tree), i(a, h - 11, 7)); h = 0, f = e, 0 === g ? (k = 138, l = 3) : e === g ? (k = 6, l = 3) : (k = 7, l = 4) } } function y(a) { var b; for (w(a, a.dyn_ltree, a.l_desc.max_code), w(a, a.dyn_dtree, a.d_desc.max_code), v(a, a.bl_desc), b = U - 1; b >= 3 && 0 === a.bl_tree[2 * ea[b] + 1]; b--); return a.opt_len += 3 * (b + 1) + 5 + 5 + 4, b } function z(a, b, c, d) { var e; for (i(a, b - 257, 5), i(a, c - 1, 5), i(a, d - 4, 4), e = 0; e < d; e++)i(a, a.bl_tree[2 * ea[e] + 1], 3); x(a, a.dyn_ltree, b - 1), x(a, a.dyn_dtree, c - 1) } function A(a) { var b, c = 4093624447; for (b = 0; b <= 31; b++ , c >>>= 1)if (1 & c && 0 !== a.dyn_ltree[2 * b]) return I; if (0 !== a.dyn_ltree[18] || 0 !== a.dyn_ltree[20] || 0 !== a.dyn_ltree[26]) return J; for (b = 32; b < R; b++)if (0 !== a.dyn_ltree[2 * b]) return J; return I } function B(a) { pa || (o(), pa = !0), a.l_desc = new f(a.dyn_ltree, ma), a.d_desc = new f(a.dyn_dtree, na), a.bl_desc = new f(a.bl_tree, oa), a.bi_buf = 0, a.bi_valid = 0, p(a) } function C(a, b, c, d) { i(a, (L << 1) + (d ? 1 : 0), 3), r(a, b, c, !0) } function D(a) { i(a, M << 1, 3), j(a, Z, ga), l(a) } function E(a, b, c, d) { var e, f, g = 0; a.level > 0 ? (a.strm.data_type === K && (a.strm.data_type = A(a)), v(a, a.l_desc), v(a, a.d_desc), g = y(a), e = a.opt_len + 3 + 7 >>> 3, f = a.static_len + 3 + 7 >>> 3, f <= e && (e = f)) : e = f = c + 5, c + 4 <= e && b !== -1 ? C(a, b, c, d) : a.strategy === H || f === e ? (i(a, (M << 1) + (d ? 1 : 0), 3), u(a, ga, ha)) : (i(a, (N << 1) + (d ? 1 : 0), 3), z(a, a.l_desc.max_code + 1, a.d_desc.max_code + 1, g + 1), u(a, a.dyn_ltree, a.dyn_dtree)), p(a), d && q(a) } function F(a, b, c) { return a.pending_buf[a.d_buf + 2 * a.last_lit] = b >>> 8 & 255, a.pending_buf[a.d_buf + 2 * a.last_lit + 1] = 255 & b, a.pending_buf[a.l_buf + a.last_lit] = 255 & c, a.last_lit++ , 0 === b ? a.dyn_ltree[2 * c]++ : (a.matches++ , b-- , a.dyn_ltree[2 * (ja[c] + R + 1)]++ , a.dyn_dtree[2 * g(b)]++), a.last_lit === a.lit_bufsize - 1 } var G = a("../utils/common"), H = 4, I = 0, J = 1, K = 2, L = 0, M = 1, N = 2, O = 3, P = 258, Q = 29, R = 256, S = R + 1 + Q, T = 30, U = 19, V = 2 * S + 1, W = 15, X = 16, Y = 7, Z = 256, $ = 16, _ = 17, aa = 18, ba = [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], ca = [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], da = [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 3, 7], ea = [16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15], fa = 512, ga = new Array(2 * (S + 2)); d(ga); var ha = new Array(2 * T); d(ha); var ia = new Array(fa); d(ia); var ja = new Array(P - O + 1); d(ja); var ka = new Array(Q); d(ka); var la = new Array(T); d(la); var ma, na, oa, pa = !1; c._tr_init = B, c._tr_stored_block = C, c._tr_flush_block = E, c._tr_tally = F, c._tr_align = D }, { "../utils/common": 28 }], 40: [function (a, b, c) { "use strict"; function d() { 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 } b.exports = d }, {}] 30 }, {}, [10])(10) 31});
Line numbers count LF bytes from the start of the resource, as the search results do. Vendor segments are library code the classifier recognised; they are stored but not indexed. Bytes are shown as Latin1 characters, one per byte.