Nevar pievienot vairāk kā 25 tēmas Tēmai ir jāsākas ar burtu vai ciparu, tā var saturēt domu zīmes ('-') un var būt līdz 35 simboliem gara.

jszip.js 408KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287128812891290129112921293129412951296129712981299130013011302130313041305130613071308130913101311131213131314131513161317131813191320132113221323132413251326132713281329133013311332133313341335133613371338133913401341134213431344134513461347134813491350135113521353135413551356135713581359136013611362136313641365136613671368136913701371137213731374137513761377137813791380138113821383138413851386138713881389139013911392139313941395139613971398139914001401140214031404140514061407140814091410141114121413141414151416141714181419142014211422142314241425142614271428142914301431143214331434143514361437143814391440144114421443144414451446144714481449145014511452145314541455145614571458145914601461146214631464146514661467146814691470147114721473147414751476147714781479148014811482148314841485148614871488148914901491149214931494149514961497149814991500150115021503150415051506150715081509151015111512151315141515151615171518151915201521152215231524152515261527152815291530153115321533153415351536153715381539154015411542154315441545154615471548154915501551155215531554155515561557155815591560156115621563156415651566156715681569157015711572157315741575157615771578157915801581158215831584158515861587158815891590159115921593159415951596159715981599160016011602160316041605160616071608160916101611161216131614161516161617161816191620162116221623162416251626162716281629163016311632163316341635163616371638163916401641164216431644164516461647164816491650165116521653165416551656165716581659166016611662166316641665166616671668166916701671167216731674167516761677167816791680168116821683168416851686168716881689169016911692169316941695169616971698169917001701170217031704170517061707170817091710171117121713171417151716171717181719172017211722172317241725172617271728172917301731173217331734173517361737173817391740174117421743174417451746174717481749175017511752175317541755175617571758175917601761176217631764176517661767176817691770177117721773177417751776177717781779178017811782178317841785178617871788178917901791179217931794179517961797179817991800180118021803180418051806180718081809181018111812181318141815181618171818181918201821182218231824182518261827182818291830183118321833183418351836183718381839184018411842184318441845184618471848184918501851185218531854185518561857185818591860186118621863186418651866186718681869187018711872187318741875187618771878187918801881188218831884188518861887188818891890189118921893189418951896189718981899190019011902190319041905190619071908190919101911191219131914191519161917191819191920192119221923192419251926192719281929193019311932193319341935193619371938193919401941194219431944194519461947194819491950195119521953195419551956195719581959196019611962196319641965196619671968196919701971197219731974197519761977197819791980198119821983198419851986198719881989199019911992199319941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202320242025202620272028202920302031203220332034203520362037203820392040204120422043204420452046204720482049205020512052205320542055205620572058205920602061206220632064206520662067206820692070207120722073207420752076207720782079208020812082208320842085208620872088208920902091209220932094209520962097209820992100210121022103210421052106210721082109211021112112211321142115211621172118211921202121212221232124212521262127212821292130213121322133213421352136213721382139214021412142214321442145214621472148214921502151215221532154215521562157215821592160216121622163216421652166216721682169217021712172217321742175217621772178217921802181218221832184218521862187218821892190219121922193219421952196219721982199220022012202220322042205220622072208220922102211221222132214221522162217221822192220222122222223222422252226222722282229223022312232223322342235223622372238223922402241224222432244224522462247224822492250225122522253225422552256225722582259226022612262226322642265226622672268226922702271227222732274227522762277227822792280228122822283228422852286228722882289229022912292229322942295229622972298229923002301230223032304230523062307230823092310231123122313231423152316231723182319232023212322232323242325232623272328232923302331233223332334233523362337233823392340234123422343234423452346234723482349235023512352235323542355235623572358235923602361236223632364236523662367236823692370237123722373237423752376237723782379238023812382238323842385238623872388238923902391239223932394239523962397239823992400240124022403240424052406240724082409241024112412241324142415241624172418241924202421242224232424242524262427242824292430243124322433243424352436243724382439244024412442244324442445244624472448244924502451245224532454245524562457245824592460246124622463246424652466246724682469247024712472247324742475247624772478247924802481248224832484248524862487248824892490249124922493249424952496249724982499250025012502250325042505250625072508250925102511251225132514251525162517251825192520252125222523252425252526252725282529253025312532253325342535253625372538253925402541254225432544254525462547254825492550255125522553255425552556255725582559256025612562256325642565256625672568256925702571257225732574257525762577257825792580258125822583258425852586258725882589259025912592259325942595259625972598259926002601260226032604260526062607260826092610261126122613261426152616261726182619262026212622262326242625262626272628262926302631263226332634263526362637263826392640264126422643264426452646264726482649265026512652265326542655265626572658265926602661266226632664266526662667266826692670267126722673267426752676267726782679268026812682268326842685268626872688268926902691269226932694269526962697269826992700270127022703270427052706270727082709271027112712271327142715271627172718271927202721272227232724272527262727272827292730273127322733273427352736273727382739274027412742274327442745274627472748274927502751275227532754275527562757275827592760276127622763276427652766276727682769277027712772277327742775277627772778277927802781278227832784278527862787278827892790279127922793279427952796279727982799280028012802280328042805280628072808280928102811281228132814281528162817281828192820282128222823282428252826282728282829283028312832283328342835283628372838283928402841284228432844284528462847284828492850285128522853285428552856285728582859286028612862286328642865286628672868286928702871287228732874287528762877287828792880288128822883288428852886288728882889289028912892289328942895289628972898289929002901290229032904290529062907290829092910291129122913291429152916291729182919292029212922292329242925292629272928292929302931293229332934293529362937293829392940294129422943294429452946294729482949295029512952295329542955295629572958295929602961296229632964296529662967296829692970297129722973297429752976297729782979298029812982298329842985298629872988298929902991299229932994299529962997299829993000300130023003300430053006300730083009301030113012301330143015301630173018301930203021302230233024302530263027302830293030303130323033303430353036303730383039304030413042304330443045304630473048304930503051305230533054305530563057305830593060306130623063306430653066306730683069307030713072307330743075307630773078307930803081308230833084308530863087308830893090309130923093309430953096309730983099310031013102310331043105310631073108310931103111311231133114311531163117311831193120312131223123312431253126312731283129313031313132313331343135313631373138313931403141314231433144314531463147314831493150315131523153315431553156315731583159316031613162316331643165316631673168316931703171317231733174317531763177317831793180318131823183318431853186318731883189319031913192319331943195319631973198319932003201320232033204320532063207320832093210321132123213321432153216321732183219322032213222322332243225322632273228322932303231323232333234323532363237323832393240324132423243324432453246324732483249325032513252325332543255325632573258325932603261326232633264326532663267326832693270327132723273327432753276327732783279328032813282328332843285328632873288
  1. /*!
  2. JSZip v3.6.0 - A JavaScript class for generating and reading zip files
  3. <http://stuartk.com/jszip>
  4. (c) 2009-2016 Stuart Knightley <stuart [at] stuartk.com>
  5. Dual licenced under the MIT license or GPLv3. See https://raw.github.com/Stuk/jszip/master/LICENSE.markdown.
  6. JSZip uses the library pako released under the MIT license :
  7. https://github.com/nodeca/pako/blob/master/LICENSE
  8. */
  9. (function (f) {
  10. if (typeof exports === "object" && typeof module !== "undefined") {
  11. module.exports = f()
  12. } else if (typeof define === "function" && define.amd) {
  13. define([], f)
  14. } else {
  15. var g;
  16. if (typeof window !== "undefined") {
  17. g = window
  18. } else if (typeof global !== "undefined") {
  19. g = global
  20. } else if (typeof self !== "undefined") {
  21. g = self
  22. } else {
  23. g = this
  24. }
  25. g.JSZip = f()
  26. }
  27. })(function () {
  28. var define, module, exports;
  29. return (function e(t, n, r) {
  30. function s(o, u) {
  31. if (!n[o]) {
  32. if (!t[o]) {
  33. var a = typeof require == "function" && require;
  34. if (!u && a) return a(o, !0);
  35. if (i) return i(o, !0);
  36. var f = new Error("Cannot find module '" + o + "'");
  37. throw f.code = "MODULE_NOT_FOUND", f
  38. }
  39. var l = n[o] = {exports: {}};
  40. t[o][0].call(l.exports, function (e) {
  41. var n = t[o][1][e];
  42. return s(n ? n : e)
  43. }, l, l.exports, e, t, n, r)
  44. }
  45. return n[o].exports
  46. }
  47. var i = typeof require == "function" && require;
  48. for (var o = 0; o < r.length; o++) s(r[o]);
  49. return s
  50. })({
  51. 1: [function (require, module, exports) {
  52. (function (global) {
  53. /*!
  54. JSZip v3.5.0 - A JavaScript class for generating and reading zip files
  55. <http://stuartk.com/jszip>
  56. (c) 2009-2016 Stuart Knightley <stuart [at] stuartk.com>
  57. Dual licenced under the MIT license or GPLv3. See https://raw.github.com/Stuk/jszip/master/LICENSE.markdown.
  58. JSZip uses the library pako released under the MIT license :
  59. https://github.com/nodeca/pako/blob/master/LICENSE
  60. */
  61. !function (e) {
  62. if ("object" == typeof exports && "undefined" != typeof module) module.exports = e(); else if ("function" == typeof define && define.amd) define([], e); else {
  63. ("undefined" != typeof window ? window : "undefined" != typeof global ? global : "undefined" != typeof self ? self : this).JSZip = e()
  64. }
  65. }(function () {
  66. return function s(a, o, u) {
  67. function h(r, e) {
  68. if (!o[r]) {
  69. if (!a[r]) {
  70. var t = "function" == typeof require && require;
  71. if (!e && t) return t(r, !0);
  72. if (f) return f(r, !0);
  73. var n = new Error("Cannot find module '" + r + "'");
  74. throw n.code = "MODULE_NOT_FOUND", n
  75. }
  76. var i = o[r] = {exports: {}};
  77. a[r][0].call(i.exports, function (e) {
  78. var t = a[r][1][e];
  79. return h(t || e)
  80. }, i, i.exports, s, a, o, u)
  81. }
  82. return o[r].exports
  83. }
  84. for (var f = "function" == typeof require && require, e = 0; e < u.length; e++) h(u[e]);
  85. return h
  86. }({
  87. 1: [function (l, t, n) {
  88. (function (r) {
  89. !function (e) {
  90. "object" == typeof n && void 0 !== t ? t.exports = e() : ("undefined" != typeof window ? window : void 0 !== r ? r : "undefined" != typeof self ? self : this).JSZip = e()
  91. }(function () {
  92. return function s(a, o, u) {
  93. function h(t, e) {
  94. if (!o[t]) {
  95. if (!a[t]) {
  96. var r = "function" == typeof l && l;
  97. if (!e && r) return r(t, !0);
  98. if (f) return f(t, !0);
  99. var n = new Error("Cannot find module '" + t + "'");
  100. throw n.code = "MODULE_NOT_FOUND", n
  101. }
  102. var i = o[t] = {exports: {}};
  103. a[t][0].call(i.exports, function (e) {
  104. return h(a[t][1][e] || e)
  105. }, i, i.exports, s, a, o, u)
  106. }
  107. return o[t].exports
  108. }
  109. for (var f = "function" == typeof l && l, e = 0; e < u.length; e++) h(u[e]);
  110. return h
  111. }({
  112. 1: [function (l, t, n) {
  113. (function (r) {
  114. !function (e) {
  115. "object" == typeof n && void 0 !== t ? t.exports = e() : ("undefined" != typeof window ? window : void 0 !== r ? r : "undefined" != typeof self ? self : this).JSZip = e()
  116. }(function () {
  117. return function s(a, o, u) {
  118. function h(t, e) {
  119. if (!o[t]) {
  120. if (!a[t]) {
  121. var r = "function" == typeof l && l;
  122. if (!e && r) return r(t, !0);
  123. if (f) return f(t, !0);
  124. var n = new Error("Cannot find module '" + t + "'");
  125. throw n.code = "MODULE_NOT_FOUND", n
  126. }
  127. var i = o[t] = {exports: {}};
  128. a[t][0].call(i.exports, function (e) {
  129. return h(a[t][1][e] || e)
  130. }, i, i.exports, s, a, o, u)
  131. }
  132. return o[t].exports
  133. }
  134. for (var f = "function" == typeof l && l, e = 0; e < u.length; e++) h(u[e]);
  135. return h
  136. }({
  137. 1: [function (l, t, n) {
  138. (function (r) {
  139. !function (e) {
  140. "object" == typeof n && void 0 !== t ? t.exports = e() : ("undefined" != typeof window ? window : void 0 !== r ? r : "undefined" != typeof self ? self : this).JSZip = e()
  141. }(function () {
  142. return function s(a, o, u) {
  143. function h(t, e) {
  144. if (!o[t]) {
  145. if (!a[t]) {
  146. var r = "function" == typeof l && l;
  147. if (!e && r) return r(t, !0);
  148. if (f) return f(t, !0);
  149. var n = new Error("Cannot find module '" + t + "'");
  150. throw n.code = "MODULE_NOT_FOUND", n
  151. }
  152. var i = o[t] = {exports: {}};
  153. a[t][0].call(i.exports, function (e) {
  154. return h(a[t][1][e] || e)
  155. }, i, i.exports, s, a, o, u)
  156. }
  157. return o[t].exports
  158. }
  159. for (var f = "function" == typeof l && l, e = 0; e < u.length; e++) h(u[e]);
  160. return h
  161. }({
  162. 1: [function (l, t, n) {
  163. (function (r) {
  164. !function (e) {
  165. "object" == typeof n && void 0 !== t ? t.exports = e() : ("undefined" != typeof window ? window : void 0 !== r ? r : "undefined" != typeof self ? self : this).JSZip = e()
  166. }(function () {
  167. return function s(a, o, u) {
  168. function h(t, e) {
  169. if (!o[t]) {
  170. if (!a[t]) {
  171. var r = "function" == typeof l && l;
  172. if (!e && r) return r(t, !0);
  173. if (f) return f(t, !0);
  174. var n = new Error("Cannot find module '" + t + "'");
  175. throw n.code = "MODULE_NOT_FOUND", n
  176. }
  177. var i = o[t] = {exports: {}};
  178. a[t][0].call(i.exports, function (e) {
  179. return h(a[t][1][e] || e)
  180. }, i, i.exports, s, a, o, u)
  181. }
  182. return o[t].exports
  183. }
  184. for (var f = "function" == typeof l && l, e = 0; e < u.length; e++) h(u[e]);
  185. return h
  186. }({
  187. 1: [function (e, t, r) {
  188. "use strict";
  189. var c = e("./utils"),
  190. l = e("./support"),
  191. p = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/=";
  192. r.encode = function (e) {
  193. for (var t, r, n, i, s, a, o, u = [], h = 0, f = e.length, l = f, d = "string" !== c.getTypeOf(e); h < e.length;) l = f - h, n = d ? (t = e[h++], r = h < f ? e[h++] : 0, h < f ? e[h++] : 0) : (t = e.charCodeAt(h++), r = h < f ? e.charCodeAt(h++) : 0, h < f ? e.charCodeAt(h++) : 0), i = t >> 2, s = (3 & t) << 4 | r >> 4, a = 1 < l ? (15 & r) << 2 | n >> 6 : 64, o = 2 < l ? 63 & n : 64, u.push(p.charAt(i) + p.charAt(s) + p.charAt(a) + p.charAt(o));
  194. return u.join("")
  195. }, r.decode = function (e) {
  196. var t, r, n, i, s, a,
  197. o = 0, u = 0;
  198. if ("data:" === e.substr(0, "data:".length)) throw new Error("Invalid base64 input, it looks like a data url.");
  199. var h,
  200. f = 3 * (e = e.replace(/[^A-Za-z0-9\+\/\=]/g, "")).length / 4;
  201. if (e.charAt(e.length - 1) === p.charAt(64) && f--, e.charAt(e.length - 2) === p.charAt(64) && f--, f % 1 != 0) throw new Error("Invalid base64 input, bad content length.");
  202. for (h = l.uint8array ? new Uint8Array(0 | f) : new Array(0 | f); o < e.length;) t = p.indexOf(e.charAt(o++)) << 2 | (i = p.indexOf(e.charAt(o++))) >> 4, r = (15 & i) << 4 | (s = p.indexOf(e.charAt(o++))) >> 2, n = (3 & s) << 6 | (a = p.indexOf(e.charAt(o++))), h[u++] = t, 64 !== s && (h[u++] = r), 64 !== a && (h[u++] = n);
  203. return h
  204. }
  205. }, {
  206. "./support": 30,
  207. "./utils": 32
  208. }],
  209. 2: [function (e, t, r) {
  210. "use strict";
  211. var n = e("./external"),
  212. i = e("./stream/DataWorker"),
  213. s = e("./stream/Crc32Probe"),
  214. a = e("./stream/DataLengthProbe");
  215. function o(e, t, r, n, i) {
  216. this.compressedSize = e, this.uncompressedSize = t, this.crc32 = r, this.compression = n, this.compressedContent = i
  217. }
  218. o.prototype = {
  219. getContentWorker: function () {
  220. var e = new i(n.Promise.resolve(this.compressedContent)).pipe(this.compression.uncompressWorker()).pipe(new a("data_length")),
  221. t = this;
  222. return e.on("end", function () {
  223. if (this.streamInfo.data_length !== t.uncompressedSize) throw new Error("Bug : uncompressed data size mismatch")
  224. }), e
  225. },
  226. getCompressedWorker: function () {
  227. return new i(n.Promise.resolve(this.compressedContent)).withStreamInfo("compressedSize", this.compressedSize).withStreamInfo("uncompressedSize", this.uncompressedSize).withStreamInfo("crc32", this.crc32).withStreamInfo("compression", this.compression)
  228. }
  229. }, o.createWorkerFrom = function (e, t, r) {
  230. return e.pipe(new s).pipe(new a("uncompressedSize")).pipe(t.compressWorker(r)).pipe(new a("compressedSize")).withStreamInfo("compression", t)
  231. }, t.exports = o
  232. }, {
  233. "./external": 6,
  234. "./stream/Crc32Probe": 25,
  235. "./stream/DataLengthProbe": 26,
  236. "./stream/DataWorker": 27
  237. }],
  238. 3: [function (e, t, r) {
  239. "use strict";
  240. var n = e("./stream/GenericWorker");
  241. r.STORE = {
  242. magic: "\0\0",
  243. compressWorker: function (e) {
  244. return new n("STORE compression")
  245. },
  246. uncompressWorker: function () {
  247. return new n("STORE decompression")
  248. }
  249. }, r.DEFLATE = e("./flate")
  250. }, {
  251. "./flate": 7,
  252. "./stream/GenericWorker": 28
  253. }],
  254. 4: [function (e, t, r) {
  255. "use strict";
  256. var n = e("./utils"),
  257. a = function () {
  258. for (var e, t = [], r = 0; r < 256; r++) {
  259. e = r;
  260. for (var n = 0; n < 8; n++) e = 1 & e ? 3988292384 ^ e >>> 1 : e >>> 1;
  261. t[r] = e
  262. }
  263. return t
  264. }();
  265. t.exports = function (e, t) {
  266. return void 0 !== e && e.length ? "string" !== n.getTypeOf(e) ? function (e, t, r) {
  267. var n = a,
  268. i = 0 + r;
  269. e ^= -1;
  270. for (var s = 0; s < i; s++) e = e >>> 8 ^ n[255 & (e ^ t[s])];
  271. return -1 ^ e
  272. }(0 | t, e, e.length) : function (e, t, r) {
  273. var n = a,
  274. i = 0 + r;
  275. e ^= -1;
  276. for (var s = 0; s < i; s++) e = e >>> 8 ^ n[255 & (e ^ t.charCodeAt(s))];
  277. return -1 ^ e
  278. }(0 | t, e, e.length) : 0
  279. }
  280. }, {"./utils": 32}],
  281. 5: [function (e, t, r) {
  282. "use strict";
  283. r.base64 = !1, r.binary = !1, r.dir = !1, r.createFolders = !0, r.date = null, r.compression = null, r.compressionOptions = null, r.comment = null, r.unixPermissions = null, r.dosPermissions = null
  284. }, {}],
  285. 6: [function (e, t, r) {
  286. "use strict";
  287. var n;
  288. n = "undefined" != typeof Promise ? Promise : e("lie"), t.exports = {Promise: n}
  289. }, {lie: 37}],
  290. 7: [function (e, t, r) {
  291. "use strict";
  292. var n = "undefined" != typeof Uint8Array && "undefined" != typeof Uint16Array && "undefined" != typeof Uint32Array,
  293. i = e("pako"),
  294. s = e("./utils"),
  295. a = e("./stream/GenericWorker"),
  296. o = n ? "uint8array" : "array";
  297. function u(e, t) {
  298. a.call(this, "FlateWorker/" + e), this._pako = null, this._pakoAction = e, this._pakoOptions = t, this.meta = {}
  299. }
  300. r.magic = "\b\0", s.inherits(u, a), u.prototype.processChunk = function (e) {
  301. this.meta = e.meta, null === this._pako && this._createPako(), this._pako.push(s.transformTo(o, e.data), !1)
  302. }, u.prototype.flush = function () {
  303. a.prototype.flush.call(this), null === this._pako && this._createPako(), this._pako.push([], !0)
  304. }, u.prototype.cleanUp = function () {
  305. a.prototype.cleanUp.call(this), this._pako = null
  306. }, u.prototype._createPako = function () {
  307. this._pako = new i[this._pakoAction]({
  308. raw: !0,
  309. level: this._pakoOptions.level || -1
  310. });
  311. var t = this;
  312. this._pako.onData = function (e) {
  313. t.push({
  314. data: e,
  315. meta: t.meta
  316. })
  317. }
  318. }, r.compressWorker = function (e) {
  319. return new u("Deflate", e)
  320. }, r.uncompressWorker = function () {
  321. return new u("Inflate", {})
  322. }
  323. }, {
  324. "./stream/GenericWorker": 28,
  325. "./utils": 32,
  326. pako: 38
  327. }],
  328. 8: [function (e, t, r) {
  329. "use strict";
  330. function I(e, t) {
  331. var r, n = "";
  332. for (r = 0; r < t; r++) n += String.fromCharCode(255 & e), e >>>= 8;
  333. return n
  334. }
  335. function i(e, t, r, n, i, s) {
  336. var a, o, u = e.file,
  337. h = e.compression,
  338. f = s !== B.utf8encode,
  339. l = O.transformTo("string", s(u.name)),
  340. d = O.transformTo("string", B.utf8encode(u.name)),
  341. c = u.comment,
  342. p = O.transformTo("string", s(c)),
  343. m = O.transformTo("string", B.utf8encode(c)),
  344. _ = d.length !== u.name.length,
  345. g = m.length !== c.length,
  346. v = "", b = "",
  347. w = "", y = u.dir,
  348. k = u.date, x = {
  349. crc32: 0,
  350. compressedSize: 0,
  351. uncompressedSize: 0
  352. };
  353. t && !r || (x.crc32 = e.crc32, x.compressedSize = e.compressedSize, x.uncompressedSize = e.uncompressedSize);
  354. var S = 0;
  355. t && (S |= 8), f || !_ && !g || (S |= 2048);
  356. var z, C = 0, E = 0;
  357. y && (C |= 16), "UNIX" === i ? (E = 798, C |= ((z = u.unixPermissions) || (z = y ? 16893 : 33204), (65535 & z) << 16)) : (E = 20, C |= 63 & (u.dosPermissions || 0)), a = k.getUTCHours(), a <<= 6, a |= k.getUTCMinutes(), a <<= 5, a |= k.getUTCSeconds() / 2, o = k.getUTCFullYear() - 1980, o <<= 4, o |= k.getUTCMonth() + 1, o <<= 5, o |= k.getUTCDate(), _ && (v += "up" + I((b = I(1, 1) + I(R(l), 4) + d).length, 2) + b), g && (v += "uc" + I((w = I(1, 1) + I(R(p), 4) + m).length, 2) + w);
  358. var A = "";
  359. return A += "\n\0", A += I(S, 2), A += h.magic, A += I(a, 2), A += I(o, 2), A += I(x.crc32, 4), A += I(x.compressedSize, 4), A += I(x.uncompressedSize, 4), A += I(l.length, 2), A += I(v.length, 2), {
  360. fileRecord: T.LOCAL_FILE_HEADER + A + l + v,
  361. dirRecord: T.CENTRAL_FILE_HEADER + I(E, 2) + A + I(p.length, 2) + "\0\0\0\0" + I(C, 4) + I(n, 4) + l + v + p
  362. }
  363. }
  364. var O = e("../utils"),
  365. s = e("../stream/GenericWorker"),
  366. B = e("../utf8"),
  367. R = e("../crc32"),
  368. T = e("../signature");
  369. function n(e, t, r, n) {
  370. s.call(this, "ZipFileWorker"), this.bytesWritten = 0, this.zipComment = t, this.zipPlatform = r, this.encodeFileName = n, this.streamFiles = e, this.accumulate = !1, this.contentBuffer = [], this.dirRecords = [], this.currentSourceOffset = 0, this.entriesCount = 0, this.currentFile = null, this._sources = []
  371. }
  372. O.inherits(n, s), n.prototype.push = function (e) {
  373. var t = e.meta.percent || 0,
  374. r = this.entriesCount,
  375. n = this._sources.length;
  376. this.accumulate ? this.contentBuffer.push(e) : (this.bytesWritten += e.data.length, s.prototype.push.call(this, {
  377. data: e.data,
  378. meta: {
  379. currentFile: this.currentFile,
  380. percent: r ? (t + 100 * (r - n - 1)) / r : 100
  381. }
  382. }))
  383. }, n.prototype.openedSource = function (e) {
  384. this.currentSourceOffset = this.bytesWritten, this.currentFile = e.file.name;
  385. var t = this.streamFiles && !e.file.dir;
  386. if (t) {
  387. var r = i(e, t, !1, this.currentSourceOffset, this.zipPlatform, this.encodeFileName);
  388. this.push({
  389. data: r.fileRecord,
  390. meta: {percent: 0}
  391. })
  392. } else this.accumulate = !0
  393. }, n.prototype.closedSource = function (e) {
  394. this.accumulate = !1;
  395. var t,
  396. r = this.streamFiles && !e.file.dir,
  397. n = i(e, r, !0, this.currentSourceOffset, this.zipPlatform, this.encodeFileName);
  398. if (this.dirRecords.push(n.dirRecord), r) this.push({
  399. data: (t = e, T.DATA_DESCRIPTOR + I(t.crc32, 4) + I(t.compressedSize, 4) + I(t.uncompressedSize, 4)),
  400. meta: {percent: 100}
  401. }); else for (this.push({
  402. data: n.fileRecord,
  403. meta: {percent: 0}
  404. }); this.contentBuffer.length;) this.push(this.contentBuffer.shift());
  405. this.currentFile = null
  406. }, n.prototype.flush = function () {
  407. for (var e = this.bytesWritten, t = 0; t < this.dirRecords.length; t++) this.push({
  408. data: this.dirRecords[t],
  409. meta: {percent: 100}
  410. });
  411. var r, n, i, s, a, o,
  412. u = this.bytesWritten - e,
  413. h = (r = this.dirRecords.length, n = u, i = e, s = this.zipComment, a = this.encodeFileName, o = O.transformTo("string", a(s)), T.CENTRAL_DIRECTORY_END + "\0\0\0\0" + I(r, 2) + I(r, 2) + I(n, 4) + I(i, 4) + I(o.length, 2) + o);
  414. this.push({
  415. data: h,
  416. meta: {percent: 100}
  417. })
  418. }, n.prototype.prepareNextSource = function () {
  419. this.previous = this._sources.shift(), this.openedSource(this.previous.streamInfo), this.isPaused ? this.previous.pause() : this.previous.resume()
  420. }, n.prototype.registerPrevious = function (e) {
  421. this._sources.push(e);
  422. var t = this;
  423. return e.on("data", function (e) {
  424. t.processChunk(e)
  425. }), e.on("end", function () {
  426. t.closedSource(t.previous.streamInfo), t._sources.length ? t.prepareNextSource() : t.end()
  427. }), e.on("error", function (e) {
  428. t.error(e)
  429. }), this
  430. }, n.prototype.resume = function () {
  431. return !!s.prototype.resume.call(this) && (!this.previous && this._sources.length ? (this.prepareNextSource(), !0) : this.previous || this._sources.length || this.generatedError ? void 0 : (this.end(), !0))
  432. }, n.prototype.error = function (e) {
  433. var t = this._sources;
  434. if (!s.prototype.error.call(this, e)) return !1;
  435. for (var r = 0; r < t.length; r++) try {
  436. t[r].error(e)
  437. } catch (e) {
  438. }
  439. return !0
  440. }, n.prototype.lock = function () {
  441. s.prototype.lock.call(this);
  442. for (var e = this._sources, t = 0; t < e.length; t++) e[t].lock()
  443. }, t.exports = n
  444. }, {
  445. "../crc32": 4,
  446. "../signature": 23,
  447. "../stream/GenericWorker": 28,
  448. "../utf8": 31,
  449. "../utils": 32
  450. }],
  451. 9: [function (e, t, r) {
  452. "use strict";
  453. var h = e("../compressions"),
  454. n = e("./ZipFileWorker");
  455. r.generateWorker = function (e, a, t) {
  456. var o = new n(a.streamFiles, t, a.platform, a.encodeFileName),
  457. u = 0;
  458. try {
  459. e.forEach(function (e, t) {
  460. u++;
  461. var r = function (e, t) {
  462. var r = e || t,
  463. n = h[r];
  464. if (!n) throw new Error(r + " is not a valid compression method !");
  465. return n
  466. }(t.options.compression, a.compression),
  467. n = t.options.compressionOptions || a.compressionOptions || {},
  468. i = t.dir,
  469. s = t.date;
  470. t._compressWorker(r, n).withStreamInfo("file", {
  471. name: e,
  472. dir: i,
  473. date: s,
  474. comment: t.comment || "",
  475. unixPermissions: t.unixPermissions,
  476. dosPermissions: t.dosPermissions
  477. }).pipe(o)
  478. }), o.entriesCount = u
  479. } catch (e) {
  480. o.error(e)
  481. }
  482. return o
  483. }
  484. }, {
  485. "../compressions": 3,
  486. "./ZipFileWorker": 8
  487. }],
  488. 10: [function (e, t, r) {
  489. "use strict";
  490. function n() {
  491. if (!(this instanceof n)) return new n;
  492. if (arguments.length) throw new Error("The constructor with parameters has been removed in JSZip 3.0, please check the upgrade guide.");
  493. this.files = {}, this.comment = null, this.root = "", this.clone = function () {
  494. var e = new n;
  495. for (var t in this) "function" != typeof this[t] && (e[t] = this[t]);
  496. return e
  497. }
  498. }
  499. (n.prototype = e("./object")).loadAsync = e("./load"), n.support = e("./support"), n.defaults = e("./defaults"), n.version = "3.5.0", n.loadAsync = function (e, t) {
  500. return (new n).loadAsync(e, t)
  501. }, n.external = e("./external"), t.exports = n
  502. }, {
  503. "./defaults": 5,
  504. "./external": 6,
  505. "./load": 11,
  506. "./object": 15,
  507. "./support": 30
  508. }],
  509. 11: [function (e, t, r) {
  510. "use strict";
  511. var n = e("./utils"),
  512. i = e("./external"),
  513. o = e("./utf8"),
  514. u = e("./zipEntries"),
  515. s = e("./stream/Crc32Probe"),
  516. h = e("./nodejsUtils");
  517. function f(n) {
  518. return new i.Promise(function (e, t) {
  519. var r = n.decompressed.getContentWorker().pipe(new s);
  520. r.on("error", function (e) {
  521. t(e)
  522. }).on("end", function () {
  523. r.streamInfo.crc32 !== n.decompressed.crc32 ? t(new Error("Corrupted zip : CRC32 mismatch")) : e()
  524. }).resume()
  525. })
  526. }
  527. t.exports = function (e, s) {
  528. var a = this;
  529. return s = n.extend(s || {}, {
  530. base64: !1,
  531. checkCRC32: !1,
  532. optimizedBinaryString: !1,
  533. createFolders: !1,
  534. decodeFileName: o.utf8decode
  535. }), h.isNode && h.isStream(e) ? i.Promise.reject(new Error("JSZip can't accept a stream when loading a zip file.")) : n.prepareContent("the loaded zip file", e, !0, s.optimizedBinaryString, s.base64).then(function (e) {
  536. var t = new u(s);
  537. return t.load(e), t
  538. }).then(function (e) {
  539. var t = [i.Promise.resolve(e)],
  540. r = e.files;
  541. if (s.checkCRC32) for (var n = 0; n < r.length; n++) t.push(f(r[n]));
  542. return i.Promise.all(t)
  543. }).then(function (e) {
  544. for (var t = e.shift(), r = t.files, n = 0; n < r.length; n++) {
  545. var i = r[n];
  546. a.file(i.fileNameStr, i.decompressed, {
  547. binary: !0,
  548. optimizedBinaryString: !0,
  549. date: i.date,
  550. dir: i.dir,
  551. comment: i.fileCommentStr.length ? i.fileCommentStr : null,
  552. unixPermissions: i.unixPermissions,
  553. dosPermissions: i.dosPermissions,
  554. createFolders: s.createFolders
  555. })
  556. }
  557. return t.zipComment.length && (a.comment = t.zipComment), a
  558. })
  559. }
  560. }, {
  561. "./external": 6,
  562. "./nodejsUtils": 14,
  563. "./stream/Crc32Probe": 25,
  564. "./utf8": 31,
  565. "./utils": 32,
  566. "./zipEntries": 33
  567. }],
  568. 12: [function (e, t, r) {
  569. "use strict";
  570. var n = e("../utils"),
  571. i = e("../stream/GenericWorker");
  572. function s(e, t) {
  573. i.call(this, "Nodejs stream input adapter for " + e), this._upstreamEnded = !1, this._bindStream(t)
  574. }
  575. n.inherits(s, i), s.prototype._bindStream = function (e) {
  576. var t = this;
  577. (this._stream = e).pause(), e.on("data", function (e) {
  578. t.push({
  579. data: e,
  580. meta: {percent: 0}
  581. })
  582. }).on("error", function (e) {
  583. t.isPaused ? this.generatedError = e : t.error(e)
  584. }).on("end", function () {
  585. t.isPaused ? t._upstreamEnded = !0 : t.end()
  586. })
  587. }, s.prototype.pause = function () {
  588. return !!i.prototype.pause.call(this) && (this._stream.pause(), !0)
  589. }, s.prototype.resume = function () {
  590. return !!i.prototype.resume.call(this) && (this._upstreamEnded ? this.end() : this._stream.resume(), !0)
  591. }, t.exports = s
  592. }, {
  593. "../stream/GenericWorker": 28,
  594. "../utils": 32
  595. }],
  596. 13: [function (e, t, r) {
  597. "use strict";
  598. var i = e("readable-stream").Readable;
  599. function n(e, t, r) {
  600. i.call(this, t), this._helper = e;
  601. var n = this;
  602. e.on("data", function (e, t) {
  603. n.push(e) || n._helper.pause(), r && r(t)
  604. }).on("error", function (e) {
  605. n.emit("error", e)
  606. }).on("end", function () {
  607. n.push(null)
  608. })
  609. }
  610. e("../utils").inherits(n, i), n.prototype._read = function () {
  611. this._helper.resume()
  612. }, t.exports = n
  613. }, {
  614. "../utils": 32,
  615. "readable-stream": 16
  616. }],
  617. 14: [function (e, t, r) {
  618. "use strict";
  619. t.exports = {
  620. isNode: "undefined" != typeof Buffer,
  621. newBufferFrom: function (e, t) {
  622. if (Buffer.from && Buffer.from !== Uint8Array.from) return Buffer.from(e, t);
  623. if ("number" == typeof e) throw new Error('The "data" argument must not be a number');
  624. return new Buffer(e, t)
  625. },
  626. allocBuffer: function (e) {
  627. if (Buffer.alloc) return Buffer.alloc(e);
  628. var t = new Buffer(e);
  629. return t.fill(0), t
  630. },
  631. isBuffer: function (e) {
  632. return Buffer.isBuffer(e)
  633. },
  634. isStream: function (e) {
  635. return e && "function" == typeof e.on && "function" == typeof e.pause && "function" == typeof e.resume
  636. }
  637. }
  638. }, {}],
  639. 15: [function (e, t, r) {
  640. "use strict";
  641. function s(e, t, r) {
  642. var n,
  643. i = f.getTypeOf(t),
  644. s = f.extend(r || {}, d);
  645. s.date = s.date || new Date, null !== s.compression && (s.compression = s.compression.toUpperCase()), "string" == typeof s.unixPermissions && (s.unixPermissions = parseInt(s.unixPermissions, 8)), s.unixPermissions && 16384 & s.unixPermissions && (s.dir = !0), s.dosPermissions && 16 & s.dosPermissions && (s.dir = !0), s.dir && (e = h(e)), s.createFolders && (n = function (e) {
  646. "/" === e.slice(-1) && (e = e.substring(0, e.length - 1));
  647. var t = e.lastIndexOf("/");
  648. return 0 < t ? e.substring(0, t) : ""
  649. }(e)) && g.call(this, n, !0);
  650. var a,
  651. o = "string" === i && !1 === s.binary && !1 === s.base64;
  652. r && void 0 !== r.binary || (s.binary = !o), (t instanceof c && 0 === t.uncompressedSize || s.dir || !t || 0 === t.length) && (s.base64 = !1, s.binary = !0, t = "", s.compression = "STORE", i = "string"), a = t instanceof c || t instanceof l ? t : m.isNode && m.isStream(t) ? new _(e, t) : f.prepareContent(e, t, s.binary, s.optimizedBinaryString, s.base64);
  653. var u = new p(e, a, s);
  654. this.files[e] = u
  655. }
  656. function h(e) {
  657. return "/" !== e.slice(-1) && (e += "/"), e
  658. }
  659. var i = e("./utf8"),
  660. f = e("./utils"),
  661. l = e("./stream/GenericWorker"),
  662. a = e("./stream/StreamHelper"),
  663. d = e("./defaults"),
  664. c = e("./compressedObject"),
  665. p = e("./zipObject"),
  666. o = e("./generate"),
  667. m = e("./nodejsUtils"),
  668. _ = e("./nodejs/NodejsStreamInputAdapter"),
  669. g = function (e, t) {
  670. return t = void 0 !== t ? t : d.createFolders, e = h(e), this.files[e] || s.call(this, e, null, {
  671. dir: !0,
  672. createFolders: t
  673. }), this.files[e]
  674. };
  675. function u(e) {
  676. return "[object RegExp]" === Object.prototype.toString.call(e)
  677. }
  678. var n = {
  679. load: function () {
  680. throw new Error("This method has been removed in JSZip 3.0, please check the upgrade guide.")
  681. },
  682. forEach: function (e) {
  683. var t, r, n;
  684. for (t in this.files) this.files.hasOwnProperty(t) && (n = this.files[t], (r = t.slice(this.root.length, t.length)) && t.slice(0, this.root.length) === this.root && e(r, n))
  685. },
  686. filter: function (r) {
  687. var n = [];
  688. return this.forEach(function (e, t) {
  689. r(e, t) && n.push(t)
  690. }), n
  691. },
  692. file: function (e, t, r) {
  693. if (1 !== arguments.length) return e = this.root + e, s.call(this, e, t, r), this;
  694. if (u(e)) {
  695. var n = e;
  696. return this.filter(function (e, t) {
  697. return !t.dir && n.test(e)
  698. })
  699. }
  700. var i = this.files[this.root + e];
  701. return i && !i.dir ? i : null
  702. },
  703. folder: function (r) {
  704. if (!r) return this;
  705. if (u(r)) return this.filter(function (e, t) {
  706. return t.dir && r.test(e)
  707. });
  708. var e = this.root + r,
  709. t = g.call(this, e),
  710. n = this.clone();
  711. return n.root = t.name, n
  712. },
  713. remove: function (r) {
  714. r = this.root + r;
  715. var e = this.files[r];
  716. if (e || ("/" !== r.slice(-1) && (r += "/"), e = this.files[r]), e && !e.dir) delete this.files[r]; else for (var t = this.filter(function (e, t) {
  717. return t.name.slice(0, r.length) === r
  718. }), n = 0; n < t.length; n++) delete this.files[t[n].name];
  719. return this
  720. },
  721. generate: function (e) {
  722. throw new Error("This method has been removed in JSZip 3.0, please check the upgrade guide.")
  723. },
  724. generateInternalStream: function (e) {
  725. var t, r = {};
  726. try {
  727. if ((r = f.extend(e || {}, {
  728. streamFiles: !1,
  729. compression: "STORE",
  730. compressionOptions: null,
  731. type: "",
  732. platform: "DOS",
  733. comment: null,
  734. mimeType: "application/zip",
  735. encodeFileName: i.utf8encode
  736. })).type = r.type.toLowerCase(), r.compression = r.compression.toUpperCase(), "binarystring" === r.type && (r.type = "string"), !r.type) throw new Error("No output type specified.");
  737. f.checkSupport(r.type), "darwin" !== r.platform && "freebsd" !== r.platform && "linux" !== r.platform && "sunos" !== r.platform || (r.platform = "UNIX"), "win32" === r.platform && (r.platform = "DOS");
  738. var n = r.comment || this.comment || "";
  739. t = o.generateWorker(this, r, n)
  740. } catch (e) {
  741. (t = new l("error")).error(e)
  742. }
  743. return new a(t, r.type || "string", r.mimeType)
  744. },
  745. generateAsync: function (e, t) {
  746. return this.generateInternalStream(e).accumulate(t)
  747. },
  748. generateNodeStream: function (e, t) {
  749. return (e = e || {}).type || (e.type = "nodebuffer"), this.generateInternalStream(e).toNodejsStream(t)
  750. }
  751. };
  752. t.exports = n
  753. }, {
  754. "./compressedObject": 2,
  755. "./defaults": 5,
  756. "./generate": 9,
  757. "./nodejs/NodejsStreamInputAdapter": 12,
  758. "./nodejsUtils": 14,
  759. "./stream/GenericWorker": 28,
  760. "./stream/StreamHelper": 29,
  761. "./utf8": 31,
  762. "./utils": 32,
  763. "./zipObject": 35
  764. }],
  765. 16: [function (e, t, r) {
  766. t.exports = e("stream")
  767. }, {stream: void 0}],
  768. 17: [function (e, t, r) {
  769. "use strict";
  770. var n = e("./DataReader");
  771. function i(e) {
  772. n.call(this, e);
  773. for (var t = 0; t < this.data.length; t++) e[t] = 255 & e[t]
  774. }
  775. e("../utils").inherits(i, n), i.prototype.byteAt = function (e) {
  776. return this.data[this.zero + e]
  777. }, i.prototype.lastIndexOfSignature = function (e) {
  778. for (var t = e.charCodeAt(0), r = e.charCodeAt(1), n = e.charCodeAt(2), i = e.charCodeAt(3), s = this.length - 4; 0 <= s; --s) if (this.data[s] === t && this.data[s + 1] === r && this.data[s + 2] === n && this.data[s + 3] === i) return s - this.zero;
  779. return -1
  780. }, i.prototype.readAndCheckSignature = function (e) {
  781. var t = e.charCodeAt(0),
  782. r = e.charCodeAt(1),
  783. n = e.charCodeAt(2),
  784. i = e.charCodeAt(3),
  785. s = this.readData(4);
  786. return t === s[0] && r === s[1] && n === s[2] && i === s[3]
  787. }, i.prototype.readData = function (e) {
  788. if (this.checkOffset(e), 0 === e) return [];
  789. var t = this.data.slice(this.zero + this.index, this.zero + this.index + e);
  790. return this.index += e, t
  791. }, t.exports = i
  792. }, {
  793. "../utils": 32,
  794. "./DataReader": 18
  795. }],
  796. 18: [function (e, t, r) {
  797. "use strict";
  798. var n = e("../utils");
  799. function i(e) {
  800. this.data = e, this.length = e.length, this.index = 0, this.zero = 0
  801. }
  802. i.prototype = {
  803. checkOffset: function (e) {
  804. this.checkIndex(this.index + e)
  805. },
  806. checkIndex: function (e) {
  807. if (this.length < this.zero + e || e < 0) throw new Error("End of data reached (data length = " + this.length + ", asked index = " + e + "). Corrupted zip ?")
  808. },
  809. setIndex: function (e) {
  810. this.checkIndex(e), this.index = e
  811. },
  812. skip: function (e) {
  813. this.setIndex(this.index + e)
  814. },
  815. byteAt: function (e) {
  816. },
  817. readInt: function (e) {
  818. var t, r = 0;
  819. for (this.checkOffset(e), t = this.index + e - 1; t >= this.index; t--) r = (r << 8) + this.byteAt(t);
  820. return this.index += e, r
  821. },
  822. readString: function (e) {
  823. return n.transformTo("string", this.readData(e))
  824. },
  825. readData: function (e) {
  826. },
  827. lastIndexOfSignature: function (e) {
  828. },
  829. readAndCheckSignature: function (e) {
  830. },
  831. readDate: function () {
  832. var e = this.readInt(4);
  833. return new Date(Date.UTC(1980 + (e >> 25 & 127), (e >> 21 & 15) - 1, e >> 16 & 31, e >> 11 & 31, e >> 5 & 63, (31 & e) << 1))
  834. }
  835. }, t.exports = i
  836. }, {"../utils": 32}],
  837. 19: [function (e, t, r) {
  838. "use strict";
  839. var n = e("./Uint8ArrayReader");
  840. function i(e) {
  841. n.call(this, e)
  842. }
  843. e("../utils").inherits(i, n), i.prototype.readData = function (e) {
  844. this.checkOffset(e);
  845. var t = this.data.slice(this.zero + this.index, this.zero + this.index + e);
  846. return this.index += e, t
  847. }, t.exports = i
  848. }, {
  849. "../utils": 32,
  850. "./Uint8ArrayReader": 21
  851. }],
  852. 20: [function (e, t, r) {
  853. "use strict";
  854. var n = e("./DataReader");
  855. function i(e) {
  856. n.call(this, e)
  857. }
  858. e("../utils").inherits(i, n), i.prototype.byteAt = function (e) {
  859. return this.data.charCodeAt(this.zero + e)
  860. }, i.prototype.lastIndexOfSignature = function (e) {
  861. return this.data.lastIndexOf(e) - this.zero
  862. }, i.prototype.readAndCheckSignature = function (e) {
  863. return e === this.readData(4)
  864. }, i.prototype.readData = function (e) {
  865. this.checkOffset(e);
  866. var t = this.data.slice(this.zero + this.index, this.zero + this.index + e);
  867. return this.index += e, t
  868. }, t.exports = i
  869. }, {
  870. "../utils": 32,
  871. "./DataReader": 18
  872. }],
  873. 21: [function (e, t, r) {
  874. "use strict";
  875. var n = e("./ArrayReader");
  876. function i(e) {
  877. n.call(this, e)
  878. }
  879. e("../utils").inherits(i, n), i.prototype.readData = function (e) {
  880. if (this.checkOffset(e), 0 === e) return new Uint8Array(0);
  881. var t = this.data.subarray(this.zero + this.index, this.zero + this.index + e);
  882. return this.index += e, t
  883. }, t.exports = i
  884. }, {
  885. "../utils": 32,
  886. "./ArrayReader": 17
  887. }],
  888. 22: [function (e, t, r) {
  889. "use strict";
  890. var n = e("../utils"),
  891. i = e("../support"),
  892. s = e("./ArrayReader"),
  893. a = e("./StringReader"),
  894. o = e("./NodeBufferReader"),
  895. u = e("./Uint8ArrayReader");
  896. t.exports = function (e) {
  897. var t = n.getTypeOf(e);
  898. return n.checkSupport(t), "string" !== t || i.uint8array ? "nodebuffer" === t ? new o(e) : i.uint8array ? new u(n.transformTo("uint8array", e)) : new s(n.transformTo("array", e)) : new a(e)
  899. }
  900. }, {
  901. "../support": 30,
  902. "../utils": 32,
  903. "./ArrayReader": 17,
  904. "./NodeBufferReader": 19,
  905. "./StringReader": 20,
  906. "./Uint8ArrayReader": 21
  907. }],
  908. 23: [function (e, t, r) {
  909. "use strict";
  910. r.LOCAL_FILE_HEADER = "PK", r.CENTRAL_FILE_HEADER = "PK", r.CENTRAL_DIRECTORY_END = "PK", r.ZIP64_CENTRAL_DIRECTORY_LOCATOR = "PK", r.ZIP64_CENTRAL_DIRECTORY_END = "PK", r.DATA_DESCRIPTOR = "PK\b"
  911. }, {}],
  912. 24: [function (e, t, r) {
  913. "use strict";
  914. var n = e("./GenericWorker"),
  915. i = e("../utils");
  916. function s(e) {
  917. n.call(this, "ConvertWorker to " + e), this.destType = e
  918. }
  919. i.inherits(s, n), s.prototype.processChunk = function (e) {
  920. this.push({
  921. data: i.transformTo(this.destType, e.data),
  922. meta: e.meta
  923. })
  924. }, t.exports = s
  925. }, {
  926. "../utils": 32,
  927. "./GenericWorker": 28
  928. }],
  929. 25: [function (e, t, r) {
  930. "use strict";
  931. var n = e("./GenericWorker"),
  932. i = e("../crc32");
  933. function s() {
  934. n.call(this, "Crc32Probe"), this.withStreamInfo("crc32", 0)
  935. }
  936. e("../utils").inherits(s, n), s.prototype.processChunk = function (e) {
  937. this.streamInfo.crc32 = i(e.data, this.streamInfo.crc32 || 0), this.push(e)
  938. }, t.exports = s
  939. }, {
  940. "../crc32": 4,
  941. "../utils": 32,
  942. "./GenericWorker": 28
  943. }],
  944. 26: [function (e, t, r) {
  945. "use strict";
  946. var n = e("../utils"),
  947. i = e("./GenericWorker");
  948. function s(e) {
  949. i.call(this, "DataLengthProbe for " + e), this.propName = e, this.withStreamInfo(e, 0)
  950. }
  951. n.inherits(s, i), s.prototype.processChunk = function (e) {
  952. if (e) {
  953. var t = this.streamInfo[this.propName] || 0;
  954. this.streamInfo[this.propName] = t + e.data.length
  955. }
  956. i.prototype.processChunk.call(this, e)
  957. }, t.exports = s
  958. }, {
  959. "../utils": 32,
  960. "./GenericWorker": 28
  961. }],
  962. 27: [function (e, t, r) {
  963. "use strict";
  964. var n = e("../utils"),
  965. i = e("./GenericWorker");
  966. function s(e) {
  967. i.call(this, "DataWorker");
  968. var t = this;
  969. this.dataIsReady = !1, this.index = 0, this.max = 0, this.data = null, this.type = "", this._tickScheduled = !1, e.then(function (e) {
  970. t.dataIsReady = !0, t.data = e, t.max = e && e.length || 0, t.type = n.getTypeOf(e), t.isPaused || t._tickAndRepeat()
  971. }, function (e) {
  972. t.error(e)
  973. })
  974. }
  975. n.inherits(s, i), s.prototype.cleanUp = function () {
  976. i.prototype.cleanUp.call(this), this.data = null
  977. }, s.prototype.resume = function () {
  978. return !!i.prototype.resume.call(this) && (!this._tickScheduled && this.dataIsReady && (this._tickScheduled = !0, n.delay(this._tickAndRepeat, [], this)), !0)
  979. }, s.prototype._tickAndRepeat = function () {
  980. this._tickScheduled = !1, this.isPaused || this.isFinished || (this._tick(), this.isFinished || (n.delay(this._tickAndRepeat, [], this), this._tickScheduled = !0))
  981. }, s.prototype._tick = function () {
  982. if (this.isPaused || this.isFinished) return !1;
  983. var e = null,
  984. t = Math.min(this.max, this.index + 16384);
  985. if (this.index >= this.max) return this.end();
  986. switch (this.type) {
  987. case"string":
  988. e = this.data.substring(this.index, t);
  989. break;
  990. case"uint8array":
  991. e = this.data.subarray(this.index, t);
  992. break;
  993. case"array":
  994. case"nodebuffer":
  995. e = this.data.slice(this.index, t)
  996. }
  997. return this.index = t, this.push({
  998. data: e,
  999. meta: {percent: this.max ? this.index / this.max * 100 : 0}
  1000. })
  1001. }, t.exports = s
  1002. }, {
  1003. "../utils": 32,
  1004. "./GenericWorker": 28
  1005. }],
  1006. 28: [function (e, t, r) {
  1007. "use strict";
  1008. function n(e) {
  1009. this.name = e || "default", this.streamInfo = {}, this.generatedError = null, this.extraStreamInfo = {}, this.isPaused = !0, this.isFinished = !1, this.isLocked = !1, this._listeners = {
  1010. data: [],
  1011. end: [],
  1012. error: []
  1013. }, this.previous = null
  1014. }
  1015. n.prototype = {
  1016. push: function (e) {
  1017. this.emit("data", e)
  1018. },
  1019. end: function () {
  1020. if (this.isFinished) return !1;
  1021. this.flush();
  1022. try {
  1023. this.emit("end"), this.cleanUp(), this.isFinished = !0
  1024. } catch (e) {
  1025. this.emit("error", e)
  1026. }
  1027. return !0
  1028. },
  1029. error: function (e) {
  1030. return !this.isFinished && (this.isPaused ? this.generatedError = e : (this.isFinished = !0, this.emit("error", e), this.previous && this.previous.error(e), this.cleanUp()), !0)
  1031. },
  1032. on: function (e, t) {
  1033. return this._listeners[e].push(t), this
  1034. },
  1035. cleanUp: function () {
  1036. this.streamInfo = this.generatedError = this.extraStreamInfo = null, this._listeners = []
  1037. },
  1038. emit: function (e, t) {
  1039. if (this._listeners[e]) for (var r = 0; r < this._listeners[e].length; r++) this._listeners[e][r].call(this, t)
  1040. },
  1041. pipe: function (e) {
  1042. return e.registerPrevious(this)
  1043. },
  1044. registerPrevious: function (e) {
  1045. if (this.isLocked) throw new Error("The stream '" + this + "' has already been used.");
  1046. this.streamInfo = e.streamInfo, this.mergeStreamInfo(), this.previous = e;
  1047. var t = this;
  1048. return e.on("data", function (e) {
  1049. t.processChunk(e)
  1050. }), e.on("end", function () {
  1051. t.end()
  1052. }), e.on("error", function (e) {
  1053. t.error(e)
  1054. }), this
  1055. },
  1056. pause: function () {
  1057. return !this.isPaused && !this.isFinished && (this.isPaused = !0, this.previous && this.previous.pause(), !0)
  1058. },
  1059. resume: function () {
  1060. if (!this.isPaused || this.isFinished) return !1;
  1061. var e = this.isPaused = !1;
  1062. return this.generatedError && (this.error(this.generatedError), e = !0), this.previous && this.previous.resume(), !e
  1063. },
  1064. flush: function () {
  1065. },
  1066. processChunk: function (e) {
  1067. this.push(e)
  1068. },
  1069. withStreamInfo: function (e, t) {
  1070. return this.extraStreamInfo[e] = t, this.mergeStreamInfo(), this
  1071. },
  1072. mergeStreamInfo: function () {
  1073. for (var e in this.extraStreamInfo) this.extraStreamInfo.hasOwnProperty(e) && (this.streamInfo[e] = this.extraStreamInfo[e])
  1074. },
  1075. lock: function () {
  1076. if (this.isLocked) throw new Error("The stream '" + this + "' has already been used.");
  1077. this.isLocked = !0, this.previous && this.previous.lock()
  1078. },
  1079. toString: function () {
  1080. var e = "Worker " + this.name;
  1081. return this.previous ? this.previous + " -> " + e : e
  1082. }
  1083. }, t.exports = n
  1084. }, {}],
  1085. 29: [function (e, t, r) {
  1086. "use strict";
  1087. var h = e("../utils"),
  1088. i = e("./ConvertWorker"),
  1089. s = e("./GenericWorker"),
  1090. f = e("../base64"),
  1091. n = e("../support"),
  1092. a = e("../external"),
  1093. o = null;
  1094. if (n.nodestream) try {
  1095. o = e("../nodejs/NodejsStreamOutputAdapter")
  1096. } catch (e) {
  1097. }
  1098. function u(e, t, r) {
  1099. var n = t;
  1100. switch (t) {
  1101. case"blob":
  1102. case"arraybuffer":
  1103. n = "uint8array";
  1104. break;
  1105. case"base64":
  1106. n = "string"
  1107. }
  1108. try {
  1109. this._internalType = n, this._outputType = t, this._mimeType = r, h.checkSupport(n), this._worker = e.pipe(new i(n)), e.lock()
  1110. } catch (e) {
  1111. this._worker = new s("error"), this._worker.error(e)
  1112. }
  1113. }
  1114. u.prototype = {
  1115. accumulate: function (e) {
  1116. return o = this, u = e, new a.Promise(function (t, r) {
  1117. var n = [],
  1118. i = o._internalType,
  1119. s = o._outputType,
  1120. a = o._mimeType;
  1121. o.on("data", function (e, t) {
  1122. n.push(e), u && u(t)
  1123. }).on("error", function (e) {
  1124. n = [], r(e)
  1125. }).on("end", function () {
  1126. try {
  1127. var e = function (e, t, r) {
  1128. switch (e) {
  1129. case"blob":
  1130. return h.newBlob(h.transformTo("arraybuffer", t), r);
  1131. case"base64":
  1132. return f.encode(t);
  1133. default:
  1134. return h.transformTo(e, t)
  1135. }
  1136. }(s, function (e, t) {
  1137. var r,
  1138. n = 0,
  1139. i = null,
  1140. s = 0;
  1141. for (r = 0; r < t.length; r++) s += t[r].length;
  1142. switch (e) {
  1143. case"string":
  1144. return t.join("");
  1145. case"array":
  1146. return Array.prototype.concat.apply([], t);
  1147. case"uint8array":
  1148. for (i = new Uint8Array(s), r = 0; r < t.length; r++) i.set(t[r], n), n += t[r].length;
  1149. return i;
  1150. case"nodebuffer":
  1151. return Buffer.concat(t);
  1152. default:
  1153. throw new Error("concat : unsupported type '" + e + "'")
  1154. }
  1155. }(i, n), a);
  1156. t(e)
  1157. } catch (e) {
  1158. r(e)
  1159. }
  1160. n = []
  1161. }).resume()
  1162. });
  1163. var o, u
  1164. },
  1165. on: function (e, t) {
  1166. var r = this;
  1167. return "data" === e ? this._worker.on(e, function (e) {
  1168. t.call(r, e.data, e.meta)
  1169. }) : this._worker.on(e, function () {
  1170. h.delay(t, arguments, r)
  1171. }), this
  1172. },
  1173. resume: function () {
  1174. return h.delay(this._worker.resume, [], this._worker), this
  1175. },
  1176. pause: function () {
  1177. return this._worker.pause(), this
  1178. },
  1179. toNodejsStream: function (e) {
  1180. if (h.checkSupport("nodestream"), "nodebuffer" !== this._outputType) throw new Error(this._outputType + " is not supported by this method");
  1181. return new o(this, {objectMode: "nodebuffer" !== this._outputType}, e)
  1182. }
  1183. }, t.exports = u
  1184. }, {
  1185. "../base64": 1,
  1186. "../external": 6,
  1187. "../nodejs/NodejsStreamOutputAdapter": 13,
  1188. "../support": 30,
  1189. "../utils": 32,
  1190. "./ConvertWorker": 24,
  1191. "./GenericWorker": 28
  1192. }],
  1193. 30: [function (e, t, r) {
  1194. "use strict";
  1195. if (r.base64 = !0, r.array = !0, r.string = !0, r.arraybuffer = "undefined" != typeof ArrayBuffer && "undefined" != typeof Uint8Array, r.nodebuffer = "undefined" != typeof Buffer, r.uint8array = "undefined" != typeof Uint8Array, "undefined" == typeof ArrayBuffer) r.blob = !1; else {
  1196. var n = new ArrayBuffer(0);
  1197. try {
  1198. r.blob = 0 === new Blob([n], {type: "application/zip"}).size
  1199. } catch (e) {
  1200. try {
  1201. var i = new (self.BlobBuilder || self.WebKitBlobBuilder || self.MozBlobBuilder || self.MSBlobBuilder);
  1202. i.append(n), r.blob = 0 === i.getBlob("application/zip").size
  1203. } catch (e) {
  1204. r.blob = !1
  1205. }
  1206. }
  1207. }
  1208. try {
  1209. r.nodestream = !!e("readable-stream").Readable
  1210. } catch (e) {
  1211. r.nodestream = !1
  1212. }
  1213. }, {"readable-stream": 16}],
  1214. 31: [function (e, t, s) {
  1215. "use strict";
  1216. for (var o = e("./utils"), u = e("./support"), r = e("./nodejsUtils"), n = e("./stream/GenericWorker"), h = new Array(256), i = 0; i < 256; i++) h[i] = 252 <= i ? 6 : 248 <= i ? 5 : 240 <= i ? 4 : 224 <= i ? 3 : 192 <= i ? 2 : 1;
  1217. function a() {
  1218. n.call(this, "utf-8 decode"), this.leftOver = null
  1219. }
  1220. function f() {
  1221. n.call(this, "utf-8 encode")
  1222. }
  1223. h[254] = h[254] = 1, s.utf8encode = function (e) {
  1224. return u.nodebuffer ? r.newBufferFrom(e, "utf-8") : function (e) {
  1225. var t, r, n, i, s,
  1226. a = e.length,
  1227. o = 0;
  1228. for (i = 0; i < a; i++) 55296 == (64512 & (r = e.charCodeAt(i))) && i + 1 < a && 56320 == (64512 & (n = e.charCodeAt(i + 1))) && (r = 65536 + (r - 55296 << 10) + (n - 56320), i++), o += r < 128 ? 1 : r < 2048 ? 2 : r < 65536 ? 3 : 4;
  1229. for (t = u.uint8array ? new Uint8Array(o) : new Array(o), i = s = 0; s < o; i++) 55296 == (64512 & (r = e.charCodeAt(i))) && i + 1 < a && 56320 == (64512 & (n = e.charCodeAt(i + 1))) && (r = 65536 + (r - 55296 << 10) + (n - 56320), i++), r < 128 ? t[s++] = r : (r < 2048 ? t[s++] = 192 | r >>> 6 : (r < 65536 ? t[s++] = 224 | r >>> 12 : (t[s++] = 240 | r >>> 18, t[s++] = 128 | r >>> 12 & 63), t[s++] = 128 | r >>> 6 & 63), t[s++] = 128 | 63 & r);
  1230. return t
  1231. }(e)
  1232. }, s.utf8decode = function (e) {
  1233. return u.nodebuffer ? o.transformTo("nodebuffer", e).toString("utf-8") : function (e) {
  1234. var t, r, n, i,
  1235. s = e.length,
  1236. a = new Array(2 * s);
  1237. for (t = r = 0; t < s;) if ((n = e[t++]) < 128) a[r++] = n; else if (4 < (i = h[n])) a[r++] = 65533, t += i - 1; else {
  1238. for (n &= 2 === i ? 31 : 3 === i ? 15 : 7; 1 < i && t < s;) n = n << 6 | 63 & e[t++], i--;
  1239. 1 < i ? a[r++] = 65533 : n < 65536 ? a[r++] = n : (n -= 65536, a[r++] = 55296 | n >> 10 & 1023, a[r++] = 56320 | 1023 & n)
  1240. }
  1241. return a.length !== r && (a.subarray ? a = a.subarray(0, r) : a.length = r), o.applyFromCharCode(a)
  1242. }(e = o.transformTo(u.uint8array ? "uint8array" : "array", e))
  1243. }, o.inherits(a, n), a.prototype.processChunk = function (e) {
  1244. var t = o.transformTo(u.uint8array ? "uint8array" : "array", e.data);
  1245. if (this.leftOver && this.leftOver.length) {
  1246. if (u.uint8array) {
  1247. var r = t;
  1248. (t = new Uint8Array(r.length + this.leftOver.length)).set(this.leftOver, 0), t.set(r, this.leftOver.length)
  1249. } else t = this.leftOver.concat(t);
  1250. this.leftOver = null
  1251. }
  1252. var n = function (e, t) {
  1253. var r;
  1254. for ((t = t || e.length) > e.length && (t = e.length), r = t - 1; 0 <= r && 128 == (192 & e[r]);) r--;
  1255. return r < 0 ? t : 0 === r ? t : r + h[e[r]] > t ? r : t
  1256. }(t), i = t;
  1257. n !== t.length && (u.uint8array ? (i = t.subarray(0, n), this.leftOver = t.subarray(n, t.length)) : (i = t.slice(0, n), this.leftOver = t.slice(n, t.length))), this.push({
  1258. data: s.utf8decode(i),
  1259. meta: e.meta
  1260. })
  1261. }, a.prototype.flush = function () {
  1262. this.leftOver && this.leftOver.length && (this.push({
  1263. data: s.utf8decode(this.leftOver),
  1264. meta: {}
  1265. }), this.leftOver = null)
  1266. }, s.Utf8DecodeWorker = a, o.inherits(f, n), f.prototype.processChunk = function (e) {
  1267. this.push({
  1268. data: s.utf8encode(e.data),
  1269. meta: e.meta
  1270. })
  1271. }, s.Utf8EncodeWorker = f
  1272. }, {
  1273. "./nodejsUtils": 14,
  1274. "./stream/GenericWorker": 28,
  1275. "./support": 30,
  1276. "./utils": 32
  1277. }],
  1278. 32: [function (e, t, o) {
  1279. "use strict";
  1280. var u = e("./support"),
  1281. h = e("./base64"),
  1282. r = e("./nodejsUtils"),
  1283. n = e("set-immediate-shim"),
  1284. f = e("./external");
  1285. function i(e) {
  1286. return e
  1287. }
  1288. function l(e, t) {
  1289. for (var r = 0; r < e.length; ++r) t[r] = 255 & e.charCodeAt(r);
  1290. return t
  1291. }
  1292. o.newBlob = function (t, r) {
  1293. o.checkSupport("blob");
  1294. try {
  1295. return new Blob([t], {type: r})
  1296. } catch (e) {
  1297. try {
  1298. var n = new (self.BlobBuilder || self.WebKitBlobBuilder || self.MozBlobBuilder || self.MSBlobBuilder);
  1299. return n.append(t), n.getBlob(r)
  1300. } catch (e) {
  1301. throw new Error("Bug : can't construct the Blob.")
  1302. }
  1303. }
  1304. };
  1305. var s = {
  1306. stringifyByChunk: function (e, t, r) {
  1307. var n = [], i = 0,
  1308. s = e.length;
  1309. if (s <= r) return String.fromCharCode.apply(null, e);
  1310. for (; i < s;) "array" === t || "nodebuffer" === t ? n.push(String.fromCharCode.apply(null, e.slice(i, Math.min(i + r, s)))) : n.push(String.fromCharCode.apply(null, e.subarray(i, Math.min(i + r, s)))), i += r;
  1311. return n.join("")
  1312. },
  1313. stringifyByChar: function (e) {
  1314. for (var t = "", r = 0; r < e.length; r++) t += String.fromCharCode(e[r]);
  1315. return t
  1316. },
  1317. applyCanBeUsed: {
  1318. uint8array: function () {
  1319. try {
  1320. return u.uint8array && 1 === String.fromCharCode.apply(null, new Uint8Array(1)).length
  1321. } catch (e) {
  1322. return !1
  1323. }
  1324. }(),
  1325. nodebuffer: function () {
  1326. try {
  1327. return u.nodebuffer && 1 === String.fromCharCode.apply(null, r.allocBuffer(1)).length
  1328. } catch (e) {
  1329. return !1
  1330. }
  1331. }()
  1332. }
  1333. };
  1334. function a(e) {
  1335. var t = 65536,
  1336. r = o.getTypeOf(e),
  1337. n = !0;
  1338. if ("uint8array" === r ? n = s.applyCanBeUsed.uint8array : "nodebuffer" === r && (n = s.applyCanBeUsed.nodebuffer), n) for (; 1 < t;) try {
  1339. return s.stringifyByChunk(e, r, t)
  1340. } catch (e) {
  1341. t = Math.floor(t / 2)
  1342. }
  1343. return s.stringifyByChar(e)
  1344. }
  1345. function d(e, t) {
  1346. for (var r = 0; r < e.length; r++) t[r] = e[r];
  1347. return t
  1348. }
  1349. o.applyFromCharCode = a;
  1350. var c = {};
  1351. c.string = {
  1352. string: i,
  1353. array: function (e) {
  1354. return l(e, new Array(e.length))
  1355. },
  1356. arraybuffer: function (e) {
  1357. return c.string.uint8array(e).buffer
  1358. },
  1359. uint8array: function (e) {
  1360. return l(e, new Uint8Array(e.length))
  1361. },
  1362. nodebuffer: function (e) {
  1363. return l(e, r.allocBuffer(e.length))
  1364. }
  1365. }, c.array = {
  1366. string: a,
  1367. array: i,
  1368. arraybuffer: function (e) {
  1369. return new Uint8Array(e).buffer
  1370. },
  1371. uint8array: function (e) {
  1372. return new Uint8Array(e)
  1373. },
  1374. nodebuffer: function (e) {
  1375. return r.newBufferFrom(e)
  1376. }
  1377. }, c.arraybuffer = {
  1378. string: function (e) {
  1379. return a(new Uint8Array(e))
  1380. },
  1381. array: function (e) {
  1382. return d(new Uint8Array(e), new Array(e.byteLength))
  1383. },
  1384. arraybuffer: i,
  1385. uint8array: function (e) {
  1386. return new Uint8Array(e)
  1387. },
  1388. nodebuffer: function (e) {
  1389. return r.newBufferFrom(new Uint8Array(e))
  1390. }
  1391. }, c.uint8array = {
  1392. string: a,
  1393. array: function (e) {
  1394. return d(e, new Array(e.length))
  1395. },
  1396. arraybuffer: function (e) {
  1397. return e.buffer
  1398. },
  1399. uint8array: i,
  1400. nodebuffer: function (e) {
  1401. return r.newBufferFrom(e)
  1402. }
  1403. }, c.nodebuffer = {
  1404. string: a,
  1405. array: function (e) {
  1406. return d(e, new Array(e.length))
  1407. },
  1408. arraybuffer: function (e) {
  1409. return c.nodebuffer.uint8array(e).buffer
  1410. },
  1411. uint8array: function (e) {
  1412. return d(e, new Uint8Array(e.length))
  1413. },
  1414. nodebuffer: i
  1415. }, o.transformTo = function (e, t) {
  1416. if (t = t || "", !e) return t;
  1417. o.checkSupport(e);
  1418. var r = o.getTypeOf(t);
  1419. return c[r][e](t)
  1420. }, o.getTypeOf = function (e) {
  1421. return "string" == typeof e ? "string" : "[object Array]" === Object.prototype.toString.call(e) ? "array" : u.nodebuffer && r.isBuffer(e) ? "nodebuffer" : u.uint8array && e instanceof Uint8Array ? "uint8array" : u.arraybuffer && e instanceof ArrayBuffer ? "arraybuffer" : void 0
  1422. }, o.checkSupport = function (e) {
  1423. if (!u[e.toLowerCase()]) throw new Error(e + " is not supported by this platform")
  1424. }, o.MAX_VALUE_16BITS = 65535, o.MAX_VALUE_32BITS = -1, o.pretty = function (e) {
  1425. var t, r, n = "";
  1426. for (r = 0; r < (e || "").length; r++) n += "\\x" + ((t = e.charCodeAt(r)) < 16 ? "0" : "") + t.toString(16).toUpperCase();
  1427. return n
  1428. }, o.delay = function (e, t, r) {
  1429. n(function () {
  1430. e.apply(r || null, t || [])
  1431. })
  1432. }, o.inherits = function (e, t) {
  1433. function r() {
  1434. }
  1435. r.prototype = t.prototype, e.prototype = new r
  1436. }, o.extend = function () {
  1437. var e, t, r = {};
  1438. for (e = 0; e < arguments.length; e++) for (t in arguments[e]) arguments[e].hasOwnProperty(t) && void 0 === r[t] && (r[t] = arguments[e][t]);
  1439. return r
  1440. }, o.prepareContent = function (n, e, i, s, a) {
  1441. return f.Promise.resolve(e).then(function (n) {
  1442. return u.blob && (n instanceof Blob || -1 !== ["[object File]", "[object Blob]"].indexOf(Object.prototype.toString.call(n))) && "undefined" != typeof FileReader ? new f.Promise(function (t, r) {
  1443. var e = new FileReader;
  1444. e.onload = function (e) {
  1445. t(e.target.result)
  1446. }, e.onerror = function (e) {
  1447. r(e.target.error)
  1448. }, e.readAsArrayBuffer(n)
  1449. }) : n
  1450. }).then(function (e) {
  1451. var t,
  1452. r = o.getTypeOf(e);
  1453. return r ? ("arraybuffer" === r ? e = o.transformTo("uint8array", e) : "string" === r && (a ? e = h.decode(e) : i && !0 !== s && (e = l(t = e, u.uint8array ? new Uint8Array(t.length) : new Array(t.length)))), e) : f.Promise.reject(new Error("Can't read the data of '" + n + "'. Is it in a supported JavaScript type (String, Blob, ArrayBuffer, etc) ?"))
  1454. })
  1455. }
  1456. }, {
  1457. "./base64": 1,
  1458. "./external": 6,
  1459. "./nodejsUtils": 14,
  1460. "./support": 30,
  1461. "set-immediate-shim": 54
  1462. }],
  1463. 33: [function (e, t, r) {
  1464. "use strict";
  1465. var n = e("./reader/readerFor"),
  1466. i = e("./utils"),
  1467. s = e("./signature"),
  1468. a = e("./zipEntry"),
  1469. o = (e("./utf8"), e("./support"));
  1470. function u(e) {
  1471. this.files = [], this.loadOptions = e
  1472. }
  1473. u.prototype = {
  1474. checkSignature: function (e) {
  1475. if (!this.reader.readAndCheckSignature(e)) {
  1476. this.reader.index -= 4;
  1477. var t = this.reader.readString(4);
  1478. throw new Error("Corrupted zip or bug: unexpected signature (" + i.pretty(t) + ", expected " + i.pretty(e) + ")")
  1479. }
  1480. },
  1481. isSignature: function (e, t) {
  1482. var r = this.reader.index;
  1483. this.reader.setIndex(e);
  1484. var n = this.reader.readString(4) === t;
  1485. return this.reader.setIndex(r), n
  1486. },
  1487. readBlockEndOfCentral: function () {
  1488. 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);
  1489. var e = this.reader.readData(this.zipCommentLength),
  1490. t = o.uint8array ? "uint8array" : "array",
  1491. r = i.transformTo(t, e);
  1492. this.zipComment = this.loadOptions.decodeFileName(r)
  1493. },
  1494. readBlockZip64EndOfCentral: function () {
  1495. this.zip64EndOfCentralSize = this.reader.readInt(8), this.reader.skip(4), this.diskNumber = this.reader.readInt(4), this.diskWithCentralDirStart = this.reader.readInt(4), this.centralDirRecordsOnThisDisk = this.reader.readInt(8), this.centralDirRecords = this.reader.readInt(8), this.centralDirSize = this.reader.readInt(8), this.centralDirOffset = this.reader.readInt(8), this.zip64ExtensibleData = {};
  1496. for (var e, t, r, n = this.zip64EndOfCentralSize - 44; 0 < n;) e = this.reader.readInt(2), t = this.reader.readInt(4), r = this.reader.readData(t), this.zip64ExtensibleData[e] = {
  1497. id: e,
  1498. length: t,
  1499. value: r
  1500. }
  1501. },
  1502. readBlockZip64EndOfCentralLocator: function () {
  1503. if (this.diskWithZip64CentralDirStart = this.reader.readInt(4), this.relativeOffsetEndOfZip64CentralDir = this.reader.readInt(8), this.disksCount = this.reader.readInt(4), 1 < this.disksCount) throw new Error("Multi-volumes zip are not supported")
  1504. },
  1505. readLocalFiles: function () {
  1506. var e, t;
  1507. for (e = 0; e < this.files.length; e++) t = this.files[e], this.reader.setIndex(t.localHeaderOffset), this.checkSignature(s.LOCAL_FILE_HEADER), t.readLocalPart(this.reader), t.handleUTF8(), t.processAttributes()
  1508. },
  1509. readCentralDir: function () {
  1510. var e;
  1511. for (this.reader.setIndex(this.centralDirOffset); this.reader.readAndCheckSignature(s.CENTRAL_FILE_HEADER);) (e = new a({zip64: this.zip64}, this.loadOptions)).readCentralPart(this.reader), this.files.push(e);
  1512. 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)
  1513. },
  1514. readEndOfCentral: function () {
  1515. var e = this.reader.lastIndexOfSignature(s.CENTRAL_DIRECTORY_END);
  1516. if (e < 0) throw this.isSignature(0, s.LOCAL_FILE_HEADER) ? new Error("Corrupted zip: can't find end of central directory") : new Error("Can't find end of central directory : is this a zip file ? If it is, see https://stuk.github.io/jszip/documentation/howto/read_zip.html");
  1517. this.reader.setIndex(e);
  1518. var t = e;
  1519. if (this.checkSignature(s.CENTRAL_DIRECTORY_END), this.readBlockEndOfCentral(), this.diskNumber === i.MAX_VALUE_16BITS || this.diskWithCentralDirStart === i.MAX_VALUE_16BITS || this.centralDirRecordsOnThisDisk === i.MAX_VALUE_16BITS || this.centralDirRecords === i.MAX_VALUE_16BITS || this.centralDirSize === i.MAX_VALUE_32BITS || this.centralDirOffset === i.MAX_VALUE_32BITS) {
  1520. if (this.zip64 = !0, (e = this.reader.lastIndexOfSignature(s.ZIP64_CENTRAL_DIRECTORY_LOCATOR)) < 0) throw new Error("Corrupted zip: can't find the ZIP64 end of central directory locator");
  1521. if (this.reader.setIndex(e), this.checkSignature(s.ZIP64_CENTRAL_DIRECTORY_LOCATOR), this.readBlockZip64EndOfCentralLocator(), !this.isSignature(this.relativeOffsetEndOfZip64CentralDir, s.ZIP64_CENTRAL_DIRECTORY_END) && (this.relativeOffsetEndOfZip64CentralDir = this.reader.lastIndexOfSignature(s.ZIP64_CENTRAL_DIRECTORY_END), this.relativeOffsetEndOfZip64CentralDir < 0)) throw new Error("Corrupted zip: can't find the ZIP64 end of central directory");
  1522. this.reader.setIndex(this.relativeOffsetEndOfZip64CentralDir), this.checkSignature(s.ZIP64_CENTRAL_DIRECTORY_END), this.readBlockZip64EndOfCentral()
  1523. }
  1524. var r = this.centralDirOffset + this.centralDirSize;
  1525. this.zip64 && (r += 20, r += 12 + this.zip64EndOfCentralSize);
  1526. var n = t - r;
  1527. if (0 < n) this.isSignature(t, s.CENTRAL_FILE_HEADER) || (this.reader.zero = n); else if (n < 0) throw new Error("Corrupted zip: missing " + Math.abs(n) + " bytes.")
  1528. },
  1529. prepareReader: function (e) {
  1530. this.reader = n(e)
  1531. },
  1532. load: function (e) {
  1533. this.prepareReader(e), this.readEndOfCentral(), this.readCentralDir(), this.readLocalFiles()
  1534. }
  1535. }, t.exports = u
  1536. }, {
  1537. "./reader/readerFor": 22,
  1538. "./signature": 23,
  1539. "./support": 30,
  1540. "./utf8": 31,
  1541. "./utils": 32,
  1542. "./zipEntry": 34
  1543. }],
  1544. 34: [function (e, t, r) {
  1545. "use strict";
  1546. var n = e("./reader/readerFor"),
  1547. s = e("./utils"),
  1548. i = e("./compressedObject"),
  1549. a = e("./crc32"),
  1550. o = e("./utf8"),
  1551. u = e("./compressions"),
  1552. h = e("./support");
  1553. function f(e, t) {
  1554. this.options = e, this.loadOptions = t
  1555. }
  1556. f.prototype = {
  1557. isEncrypted: function () {
  1558. return 1 == (1 & this.bitFlag)
  1559. },
  1560. useUTF8: function () {
  1561. return 2048 == (2048 & this.bitFlag)
  1562. },
  1563. readLocalPart: function (e) {
  1564. var t, r;
  1565. if (e.skip(22), this.fileNameLength = e.readInt(2), r = e.readInt(2), this.fileName = e.readData(this.fileNameLength), e.skip(r), -1 === this.compressedSize || -1 === this.uncompressedSize) throw new Error("Bug or corrupted zip : didn't get enough information from the central directory (compressedSize === -1 || uncompressedSize === -1)");
  1566. if (null === (t = function (e) {
  1567. for (var t in u) if (u.hasOwnProperty(t) && u[t].magic === e) return u[t];
  1568. return null
  1569. }(this.compressionMethod))) throw new Error("Corrupted zip : compression " + s.pretty(this.compressionMethod) + " unknown (inner file : " + s.transformTo("string", this.fileName) + ")");
  1570. this.decompressed = new i(this.compressedSize, this.uncompressedSize, this.crc32, t, e.readData(this.compressedSize))
  1571. },
  1572. readCentralPart: function (e) {
  1573. this.versionMadeBy = e.readInt(2), e.skip(2), this.bitFlag = e.readInt(2), this.compressionMethod = e.readString(2), this.date = e.readDate(), this.crc32 = e.readInt(4), this.compressedSize = e.readInt(4), this.uncompressedSize = e.readInt(4);
  1574. var t = e.readInt(2);
  1575. if (this.extraFieldsLength = e.readInt(2), this.fileCommentLength = e.readInt(2), this.diskNumberStart = e.readInt(2), this.internalFileAttributes = e.readInt(2), this.externalFileAttributes = e.readInt(4), this.localHeaderOffset = e.readInt(4), this.isEncrypted()) throw new Error("Encrypted zip are not supported");
  1576. e.skip(t), this.readExtraFields(e), this.parseZIP64ExtraField(e), this.fileComment = e.readData(this.fileCommentLength)
  1577. },
  1578. processAttributes: function () {
  1579. this.unixPermissions = null, this.dosPermissions = null;
  1580. var e = this.versionMadeBy >> 8;
  1581. this.dir = !!(16 & this.externalFileAttributes), 0 == e && (this.dosPermissions = 63 & this.externalFileAttributes), 3 == e && (this.unixPermissions = this.externalFileAttributes >> 16 & 65535), this.dir || "/" !== this.fileNameStr.slice(-1) || (this.dir = !0)
  1582. },
  1583. parseZIP64ExtraField: function (e) {
  1584. if (this.extraFields[1]) {
  1585. var t = n(this.extraFields[1].value);
  1586. this.uncompressedSize === s.MAX_VALUE_32BITS && (this.uncompressedSize = t.readInt(8)), this.compressedSize === s.MAX_VALUE_32BITS && (this.compressedSize = t.readInt(8)), this.localHeaderOffset === s.MAX_VALUE_32BITS && (this.localHeaderOffset = t.readInt(8)), this.diskNumberStart === s.MAX_VALUE_32BITS && (this.diskNumberStart = t.readInt(4))
  1587. }
  1588. },
  1589. readExtraFields: function (e) {
  1590. var t, r, n,
  1591. i = e.index + this.extraFieldsLength;
  1592. for (this.extraFields || (this.extraFields = {}); e.index + 4 < i;) t = e.readInt(2), r = e.readInt(2), n = e.readData(r), this.extraFields[t] = {
  1593. id: t,
  1594. length: r,
  1595. value: n
  1596. };
  1597. e.setIndex(i)
  1598. },
  1599. handleUTF8: function () {
  1600. var e = h.uint8array ? "uint8array" : "array";
  1601. if (this.useUTF8()) this.fileNameStr = o.utf8decode(this.fileName), this.fileCommentStr = o.utf8decode(this.fileComment); else {
  1602. var t = this.findExtraFieldUnicodePath();
  1603. if (null !== t) this.fileNameStr = t; else {
  1604. var r = s.transformTo(e, this.fileName);
  1605. this.fileNameStr = this.loadOptions.decodeFileName(r)
  1606. }
  1607. var n = this.findExtraFieldUnicodeComment();
  1608. if (null !== n) this.fileCommentStr = n; else {
  1609. var i = s.transformTo(e, this.fileComment);
  1610. this.fileCommentStr = this.loadOptions.decodeFileName(i)
  1611. }
  1612. }
  1613. },
  1614. findExtraFieldUnicodePath: function () {
  1615. var e = this.extraFields[28789];
  1616. if (e) {
  1617. var t = n(e.value);
  1618. return 1 !== t.readInt(1) ? null : a(this.fileName) !== t.readInt(4) ? null : o.utf8decode(t.readData(e.length - 5))
  1619. }
  1620. return null
  1621. },
  1622. findExtraFieldUnicodeComment: function () {
  1623. var e = this.extraFields[25461];
  1624. if (e) {
  1625. var t = n(e.value);
  1626. return 1 !== t.readInt(1) ? null : a(this.fileComment) !== t.readInt(4) ? null : o.utf8decode(t.readData(e.length - 5))
  1627. }
  1628. return null
  1629. }
  1630. }, t.exports = f
  1631. }, {
  1632. "./compressedObject": 2,
  1633. "./compressions": 3,
  1634. "./crc32": 4,
  1635. "./reader/readerFor": 22,
  1636. "./support": 30,
  1637. "./utf8": 31,
  1638. "./utils": 32
  1639. }],
  1640. 35: [function (e, t, r) {
  1641. "use strict";
  1642. function n(e, t, r) {
  1643. this.name = e, this.dir = r.dir, this.date = r.date, this.comment = r.comment, this.unixPermissions = r.unixPermissions, this.dosPermissions = r.dosPermissions, this._data = t, this._dataBinary = r.binary, this.options = {
  1644. compression: r.compression,
  1645. compressionOptions: r.compressionOptions
  1646. }
  1647. }
  1648. var s = e("./stream/StreamHelper"),
  1649. i = e("./stream/DataWorker"),
  1650. a = e("./utf8"),
  1651. o = e("./compressedObject"),
  1652. u = e("./stream/GenericWorker");
  1653. n.prototype = {
  1654. internalStream: function (e) {
  1655. var t = null,
  1656. r = "string";
  1657. try {
  1658. if (!e) throw new Error("No output type specified.");
  1659. var n = "string" === (r = e.toLowerCase()) || "text" === r;
  1660. "binarystring" !== r && "text" !== r || (r = "string"), t = this._decompressWorker();
  1661. var i = !this._dataBinary;
  1662. i && !n && (t = t.pipe(new a.Utf8EncodeWorker)), !i && n && (t = t.pipe(new a.Utf8DecodeWorker))
  1663. } catch (e) {
  1664. (t = new u("error")).error(e)
  1665. }
  1666. return new s(t, r, "")
  1667. },
  1668. async: function (e, t) {
  1669. return this.internalStream(e).accumulate(t)
  1670. },
  1671. nodeStream: function (e, t) {
  1672. return this.internalStream(e || "nodebuffer").toNodejsStream(t)
  1673. },
  1674. _compressWorker: function (e, t) {
  1675. if (this._data instanceof o && this._data.compression.magic === e.magic) return this._data.getCompressedWorker();
  1676. var r = this._decompressWorker();
  1677. return this._dataBinary || (r = r.pipe(new a.Utf8EncodeWorker)), o.createWorkerFrom(r, e, t)
  1678. },
  1679. _decompressWorker: function () {
  1680. return this._data instanceof o ? this._data.getContentWorker() : this._data instanceof u ? this._data : new i(this._data)
  1681. }
  1682. };
  1683. for (var h = ["asText", "asBinary", "asNodeBuffer", "asUint8Array", "asArrayBuffer"], f = function () {
  1684. throw new Error("This method has been removed in JSZip 3.0, please check the upgrade guide.")
  1685. }, l = 0; l < h.length; l++) n.prototype[h[l]] = f;
  1686. t.exports = n
  1687. }, {
  1688. "./compressedObject": 2,
  1689. "./stream/DataWorker": 27,
  1690. "./stream/GenericWorker": 28,
  1691. "./stream/StreamHelper": 29,
  1692. "./utf8": 31
  1693. }],
  1694. 36: [function (e, f, t) {
  1695. (function (t) {
  1696. "use strict";
  1697. var r, n,
  1698. e = t.MutationObserver || t.WebKitMutationObserver;
  1699. if (e) {
  1700. var i = 0,
  1701. s = new e(h),
  1702. a = t.document.createTextNode("");
  1703. s.observe(a, {characterData: !0}), r = function () {
  1704. a.data = i = ++i % 2
  1705. }
  1706. } else if (t.setImmediate || void 0 === t.MessageChannel) r = "document" in t && "onreadystatechange" in t.document.createElement("script") ? function () {
  1707. var e = t.document.createElement("script");
  1708. e.onreadystatechange = function () {
  1709. h(), e.onreadystatechange = null, e.parentNode.removeChild(e), e = null
  1710. }, t.document.documentElement.appendChild(e)
  1711. } : function () {
  1712. setTimeout(h, 0)
  1713. }; else {
  1714. var o = new t.MessageChannel;
  1715. o.port1.onmessage = h, r = function () {
  1716. o.port2.postMessage(0)
  1717. }
  1718. }
  1719. var u = [];
  1720. function h() {
  1721. var e, t;
  1722. n = !0;
  1723. for (var r = u.length; r;) {
  1724. for (t = u, u = [], e = -1; ++e < r;) t[e]();
  1725. r = u.length
  1726. }
  1727. n = !1
  1728. }
  1729. f.exports = function (e) {
  1730. 1 !== u.push(e) || n || r()
  1731. }
  1732. }).call(this, void 0 !== r ? r : "undefined" != typeof self ? self : "undefined" != typeof window ? window : {})
  1733. }, {}],
  1734. 37: [function (e, t, r) {
  1735. "use strict";
  1736. var i = e("immediate");
  1737. function h() {
  1738. }
  1739. var f = {},
  1740. s = ["REJECTED"],
  1741. a = ["FULFILLED"],
  1742. n = ["PENDING"];
  1743. function o(e) {
  1744. if ("function" != typeof e) throw new TypeError("resolver must be a function");
  1745. this.state = n, this.queue = [], this.outcome = void 0, e !== h && c(this, e)
  1746. }
  1747. function u(e, t, r) {
  1748. this.promise = e, "function" == typeof t && (this.onFulfilled = t, this.callFulfilled = this.otherCallFulfilled), "function" == typeof r && (this.onRejected = r, this.callRejected = this.otherCallRejected)
  1749. }
  1750. function l(t, r, n) {
  1751. i(function () {
  1752. var e;
  1753. try {
  1754. e = r(n)
  1755. } catch (e) {
  1756. return f.reject(t, e)
  1757. }
  1758. e === t ? f.reject(t, new TypeError("Cannot resolve promise with itself")) : f.resolve(t, e)
  1759. })
  1760. }
  1761. function d(e) {
  1762. var t = e && e.then;
  1763. if (e && ("object" == typeof e || "function" == typeof e) && "function" == typeof t) return function () {
  1764. t.apply(e, arguments)
  1765. }
  1766. }
  1767. function c(t, e) {
  1768. var r = !1;
  1769. function n(e) {
  1770. r || (r = !0, f.reject(t, e))
  1771. }
  1772. function i(e) {
  1773. r || (r = !0, f.resolve(t, e))
  1774. }
  1775. var s = p(function () {
  1776. e(i, n)
  1777. });
  1778. "error" === s.status && n(s.value)
  1779. }
  1780. function p(e, t) {
  1781. var r = {};
  1782. try {
  1783. r.value = e(t), r.status = "success"
  1784. } catch (e) {
  1785. r.status = "error", r.value = e
  1786. }
  1787. return r
  1788. }
  1789. (t.exports = o).prototype.finally = function (t) {
  1790. if ("function" != typeof t) return this;
  1791. var r = this.constructor;
  1792. return this.then(function (e) {
  1793. return r.resolve(t()).then(function () {
  1794. return e
  1795. })
  1796. }, function (e) {
  1797. return r.resolve(t()).then(function () {
  1798. throw e
  1799. })
  1800. })
  1801. }, o.prototype.catch = function (e) {
  1802. return this.then(null, e)
  1803. }, o.prototype.then = function (e, t) {
  1804. if ("function" != typeof e && this.state === a || "function" != typeof t && this.state === s) return this;
  1805. var r = new this.constructor(h);
  1806. return this.state !== n ? l(r, this.state === a ? e : t, this.outcome) : this.queue.push(new u(r, e, t)), r
  1807. }, u.prototype.callFulfilled = function (e) {
  1808. f.resolve(this.promise, e)
  1809. }, u.prototype.otherCallFulfilled = function (e) {
  1810. l(this.promise, this.onFulfilled, e)
  1811. }, u.prototype.callRejected = function (e) {
  1812. f.reject(this.promise, e)
  1813. }, u.prototype.otherCallRejected = function (e) {
  1814. l(this.promise, this.onRejected, e)
  1815. }, f.resolve = function (e, t) {
  1816. var r = p(d, t);
  1817. if ("error" === r.status) return f.reject(e, r.value);
  1818. var n = r.value;
  1819. if (n) c(e, n); else {
  1820. e.state = a, e.outcome = t;
  1821. for (var i = -1, s = e.queue.length; ++i < s;) e.queue[i].callFulfilled(t)
  1822. }
  1823. return e
  1824. }, f.reject = function (e, t) {
  1825. e.state = s, e.outcome = t;
  1826. for (var r = -1, n = e.queue.length; ++r < n;) e.queue[r].callRejected(t);
  1827. return e
  1828. }, o.resolve = function (e) {
  1829. return e instanceof this ? e : f.resolve(new this(h), e)
  1830. }, o.reject = function (e) {
  1831. var t = new this(h);
  1832. return f.reject(t, e)
  1833. }, o.all = function (e) {
  1834. var r = this;
  1835. if ("[object Array]" !== Object.prototype.toString.call(e)) return this.reject(new TypeError("must be an array"));
  1836. var n = e.length,
  1837. i = !1;
  1838. if (!n) return this.resolve([]);
  1839. for (var s = new Array(n), a = 0, t = -1, o = new this(h); ++t < n;) u(e[t], t);
  1840. return o;
  1841. function u(e, t) {
  1842. r.resolve(e).then(function (e) {
  1843. s[t] = e, ++a !== n || i || (i = !0, f.resolve(o, s))
  1844. }, function (e) {
  1845. i || (i = !0, f.reject(o, e))
  1846. })
  1847. }
  1848. }, o.race = function (e) {
  1849. if ("[object Array]" !== Object.prototype.toString.call(e)) return this.reject(new TypeError("must be an array"));
  1850. var t = e.length,
  1851. r = !1;
  1852. if (!t) return this.resolve([]);
  1853. for (var n, i = -1, s = new this(h); ++i < t;) n = e[i], this.resolve(n).then(function (e) {
  1854. r || (r = !0, f.resolve(s, e))
  1855. }, function (e) {
  1856. r || (r = !0, f.reject(s, e))
  1857. });
  1858. return s
  1859. }
  1860. }, {immediate: 36}],
  1861. 38: [function (e, t, r) {
  1862. "use strict";
  1863. var n = {};
  1864. (0, e("./lib/utils/common").assign)(n, e("./lib/deflate"), e("./lib/inflate"), e("./lib/zlib/constants")), t.exports = n
  1865. }, {
  1866. "./lib/deflate": 39,
  1867. "./lib/inflate": 40,
  1868. "./lib/utils/common": 41,
  1869. "./lib/zlib/constants": 44
  1870. }],
  1871. 39: [function (e, t, r) {
  1872. "use strict";
  1873. var a = e("./zlib/deflate"),
  1874. o = e("./utils/common"),
  1875. u = e("./utils/strings"),
  1876. i = e("./zlib/messages"),
  1877. s = e("./zlib/zstream"),
  1878. h = Object.prototype.toString,
  1879. f = 0, l = -1, d = 0,
  1880. c = 8;
  1881. function p(e) {
  1882. if (!(this instanceof p)) return new p(e);
  1883. this.options = o.assign({
  1884. level: l,
  1885. method: c,
  1886. chunkSize: 16384,
  1887. windowBits: 15,
  1888. memLevel: 8,
  1889. strategy: d,
  1890. to: ""
  1891. }, e || {});
  1892. var t = this.options;
  1893. t.raw && 0 < t.windowBits ? t.windowBits = -t.windowBits : t.gzip && 0 < t.windowBits && t.windowBits < 16 && (t.windowBits += 16), this.err = 0, this.msg = "", this.ended = !1, this.chunks = [], this.strm = new s, this.strm.avail_out = 0;
  1894. var r = a.deflateInit2(this.strm, t.level, t.method, t.windowBits, t.memLevel, t.strategy);
  1895. if (r !== f) throw new Error(i[r]);
  1896. if (t.header && a.deflateSetHeader(this.strm, t.header), t.dictionary) {
  1897. var n;
  1898. if (n = "string" == typeof t.dictionary ? u.string2buf(t.dictionary) : "[object ArrayBuffer]" === h.call(t.dictionary) ? new Uint8Array(t.dictionary) : t.dictionary, (r = a.deflateSetDictionary(this.strm, n)) !== f) throw new Error(i[r]);
  1899. this._dict_set = !0
  1900. }
  1901. }
  1902. function n(e, t) {
  1903. var r = new p(t);
  1904. if (r.push(e, !0), r.err) throw r.msg || i[r.err];
  1905. return r.result
  1906. }
  1907. p.prototype.push = function (e, t) {
  1908. var r, n, i = this.strm,
  1909. s = this.options.chunkSize;
  1910. if (this.ended) return !1;
  1911. n = t === ~~t ? t : !0 === t ? 4 : 0, "string" == typeof e ? i.input = u.string2buf(e) : "[object ArrayBuffer]" === h.call(e) ? i.input = new Uint8Array(e) : i.input = e, i.next_in = 0, i.avail_in = i.input.length;
  1912. do {
  1913. if (0 === i.avail_out && (i.output = new o.Buf8(s), i.next_out = 0, i.avail_out = s), 1 !== (r = a.deflate(i, n)) && r !== f) return this.onEnd(r), !(this.ended = !0);
  1914. 0 !== i.avail_out && (0 !== i.avail_in || 4 !== n && 2 !== n) || ("string" === this.options.to ? this.onData(u.buf2binstring(o.shrinkBuf(i.output, i.next_out))) : this.onData(o.shrinkBuf(i.output, i.next_out)))
  1915. } while ((0 < i.avail_in || 0 === i.avail_out) && 1 !== r);
  1916. return 4 === n ? (r = a.deflateEnd(this.strm), this.onEnd(r), this.ended = !0, r === f) : 2 !== n || (this.onEnd(f), !(i.avail_out = 0))
  1917. }, p.prototype.onData = function (e) {
  1918. this.chunks.push(e)
  1919. }, p.prototype.onEnd = function (e) {
  1920. e === f && ("string" === this.options.to ? this.result = this.chunks.join("") : this.result = o.flattenChunks(this.chunks)), this.chunks = [], this.err = e, this.msg = this.strm.msg
  1921. }, r.Deflate = p, r.deflate = n, r.deflateRaw = function (e, t) {
  1922. return (t = t || {}).raw = !0, n(e, t)
  1923. }, r.gzip = function (e, t) {
  1924. return (t = t || {}).gzip = !0, n(e, t)
  1925. }
  1926. }, {
  1927. "./utils/common": 41,
  1928. "./utils/strings": 42,
  1929. "./zlib/deflate": 46,
  1930. "./zlib/messages": 51,
  1931. "./zlib/zstream": 53
  1932. }],
  1933. 40: [function (e, t, r) {
  1934. "use strict";
  1935. var d = e("./zlib/inflate"),
  1936. c = e("./utils/common"),
  1937. p = e("./utils/strings"),
  1938. m = e("./zlib/constants"),
  1939. n = e("./zlib/messages"),
  1940. i = e("./zlib/zstream"),
  1941. s = e("./zlib/gzheader"),
  1942. _ = Object.prototype.toString;
  1943. function a(e) {
  1944. if (!(this instanceof a)) return new a(e);
  1945. this.options = c.assign({
  1946. chunkSize: 16384,
  1947. windowBits: 0,
  1948. to: ""
  1949. }, e || {});
  1950. var t = this.options;
  1951. t.raw && 0 <= t.windowBits && t.windowBits < 16 && (t.windowBits = -t.windowBits, 0 === t.windowBits && (t.windowBits = -15)), !(0 <= t.windowBits && t.windowBits < 16) || e && e.windowBits || (t.windowBits += 32), 15 < t.windowBits && t.windowBits < 48 && 0 == (15 & t.windowBits) && (t.windowBits |= 15), this.err = 0, this.msg = "", this.ended = !1, this.chunks = [], this.strm = new i, this.strm.avail_out = 0;
  1952. var r = d.inflateInit2(this.strm, t.windowBits);
  1953. if (r !== m.Z_OK) throw new Error(n[r]);
  1954. this.header = new s, d.inflateGetHeader(this.strm, this.header)
  1955. }
  1956. function o(e, t) {
  1957. var r = new a(t);
  1958. if (r.push(e, !0), r.err) throw r.msg || n[r.err];
  1959. return r.result
  1960. }
  1961. a.prototype.push = function (e, t) {
  1962. var r, n, i, s, a, o,
  1963. u = this.strm,
  1964. h = this.options.chunkSize,
  1965. f = this.options.dictionary,
  1966. l = !1;
  1967. if (this.ended) return !1;
  1968. n = t === ~~t ? t : !0 === t ? m.Z_FINISH : m.Z_NO_FLUSH, "string" == typeof e ? u.input = p.binstring2buf(e) : "[object ArrayBuffer]" === _.call(e) ? u.input = new Uint8Array(e) : u.input = e, u.next_in = 0, u.avail_in = u.input.length;
  1969. do {
  1970. if (0 === u.avail_out && (u.output = new c.Buf8(h), u.next_out = 0, u.avail_out = h), (r = d.inflate(u, m.Z_NO_FLUSH)) === m.Z_NEED_DICT && f && (o = "string" == typeof f ? p.string2buf(f) : "[object ArrayBuffer]" === _.call(f) ? new Uint8Array(f) : f, r = d.inflateSetDictionary(this.strm, o)), r === m.Z_BUF_ERROR && !0 === l && (r = m.Z_OK, l = !1), r !== m.Z_STREAM_END && r !== m.Z_OK) return this.onEnd(r), !(this.ended = !0);
  1971. u.next_out && (0 !== u.avail_out && r !== m.Z_STREAM_END && (0 !== u.avail_in || n !== m.Z_FINISH && n !== m.Z_SYNC_FLUSH) || ("string" === this.options.to ? (i = p.utf8border(u.output, u.next_out), s = u.next_out - i, a = p.buf2string(u.output, i), u.next_out = s, u.avail_out = h - s, s && c.arraySet(u.output, u.output, i, s, 0), this.onData(a)) : this.onData(c.shrinkBuf(u.output, u.next_out)))), 0 === u.avail_in && 0 === u.avail_out && (l = !0)
  1972. } while ((0 < u.avail_in || 0 === u.avail_out) && r !== m.Z_STREAM_END);
  1973. return r === m.Z_STREAM_END && (n = m.Z_FINISH), n === m.Z_FINISH ? (r = d.inflateEnd(this.strm), this.onEnd(r), this.ended = !0, r === m.Z_OK) : n !== m.Z_SYNC_FLUSH || (this.onEnd(m.Z_OK), !(u.avail_out = 0))
  1974. }, a.prototype.onData = function (e) {
  1975. this.chunks.push(e)
  1976. }, a.prototype.onEnd = function (e) {
  1977. e === m.Z_OK && ("string" === this.options.to ? this.result = this.chunks.join("") : this.result = c.flattenChunks(this.chunks)), this.chunks = [], this.err = e, this.msg = this.strm.msg
  1978. }, r.Inflate = a, r.inflate = o, r.inflateRaw = function (e, t) {
  1979. return (t = t || {}).raw = !0, o(e, t)
  1980. }, r.ungzip = o
  1981. }, {
  1982. "./utils/common": 41,
  1983. "./utils/strings": 42,
  1984. "./zlib/constants": 44,
  1985. "./zlib/gzheader": 47,
  1986. "./zlib/inflate": 49,
  1987. "./zlib/messages": 51,
  1988. "./zlib/zstream": 53
  1989. }],
  1990. 41: [function (e, t, r) {
  1991. "use strict";
  1992. var n = "undefined" != typeof Uint8Array && "undefined" != typeof Uint16Array && "undefined" != typeof Int32Array;
  1993. r.assign = function (e) {
  1994. for (var t = Array.prototype.slice.call(arguments, 1); t.length;) {
  1995. var r = t.shift();
  1996. if (r) {
  1997. if ("object" != typeof r) throw new TypeError(r + "must be non-object");
  1998. for (var n in r) r.hasOwnProperty(n) && (e[n] = r[n])
  1999. }
  2000. }
  2001. return e
  2002. }, r.shrinkBuf = function (e, t) {
  2003. return e.length === t ? e : e.subarray ? e.subarray(0, t) : (e.length = t, e)
  2004. };
  2005. var i = {
  2006. arraySet: function (e, t, r, n, i) {
  2007. if (t.subarray && e.subarray) e.set(t.subarray(r, r + n), i); else for (var s = 0; s < n; s++) e[i + s] = t[r + s]
  2008. },
  2009. flattenChunks: function (e) {
  2010. var t, r, n, i, s,
  2011. a;
  2012. for (t = n = 0, r = e.length; t < r; t++) n += e[t].length;
  2013. for (a = new Uint8Array(n), t = i = 0, r = e.length; t < r; t++) s = e[t], a.set(s, i), i += s.length;
  2014. return a
  2015. }
  2016. }, s = {
  2017. arraySet: function (e, t, r, n, i) {
  2018. for (var s = 0; s < n; s++) e[i + s] = t[r + s]
  2019. },
  2020. flattenChunks: function (e) {
  2021. return [].concat.apply([], e)
  2022. }
  2023. };
  2024. r.setTyped = function (e) {
  2025. e ? (r.Buf8 = Uint8Array, r.Buf16 = Uint16Array, r.Buf32 = Int32Array, r.assign(r, i)) : (r.Buf8 = Array, r.Buf16 = Array, r.Buf32 = Array, r.assign(r, s))
  2026. }, r.setTyped(n)
  2027. }, {}],
  2028. 42: [function (e, t, r) {
  2029. "use strict";
  2030. var u = e("./common"),
  2031. i = !0, s = !0;
  2032. try {
  2033. String.fromCharCode.apply(null, [0])
  2034. } catch (e) {
  2035. i = !1
  2036. }
  2037. try {
  2038. String.fromCharCode.apply(null, new Uint8Array(1))
  2039. } catch (e) {
  2040. s = !1
  2041. }
  2042. for (var h = new u.Buf8(256), n = 0; n < 256; n++) h[n] = 252 <= n ? 6 : 248 <= n ? 5 : 240 <= n ? 4 : 224 <= n ? 3 : 192 <= n ? 2 : 1;
  2043. function f(e, t) {
  2044. if (t < 65537 && (e.subarray && s || !e.subarray && i)) return String.fromCharCode.apply(null, u.shrinkBuf(e, t));
  2045. for (var r = "", n = 0; n < t; n++) r += String.fromCharCode(e[n]);
  2046. return r
  2047. }
  2048. h[254] = h[254] = 1, r.string2buf = function (e) {
  2049. var t, r, n, i, s,
  2050. a = e.length, o = 0;
  2051. for (i = 0; i < a; i++) 55296 == (64512 & (r = e.charCodeAt(i))) && i + 1 < a && 56320 == (64512 & (n = e.charCodeAt(i + 1))) && (r = 65536 + (r - 55296 << 10) + (n - 56320), i++), o += r < 128 ? 1 : r < 2048 ? 2 : r < 65536 ? 3 : 4;
  2052. for (t = new u.Buf8(o), i = s = 0; s < o; i++) 55296 == (64512 & (r = e.charCodeAt(i))) && i + 1 < a && 56320 == (64512 & (n = e.charCodeAt(i + 1))) && (r = 65536 + (r - 55296 << 10) + (n - 56320), i++), r < 128 ? t[s++] = r : (r < 2048 ? t[s++] = 192 | r >>> 6 : (r < 65536 ? t[s++] = 224 | r >>> 12 : (t[s++] = 240 | r >>> 18, t[s++] = 128 | r >>> 12 & 63), t[s++] = 128 | r >>> 6 & 63), t[s++] = 128 | 63 & r);
  2053. return t
  2054. }, r.buf2binstring = function (e) {
  2055. return f(e, e.length)
  2056. }, r.binstring2buf = function (e) {
  2057. for (var t = new u.Buf8(e.length), r = 0, n = t.length; r < n; r++) t[r] = e.charCodeAt(r);
  2058. return t
  2059. }, r.buf2string = function (e, t) {
  2060. var r, n, i, s,
  2061. a = t || e.length,
  2062. o = new Array(2 * a);
  2063. for (r = n = 0; r < a;) if ((i = e[r++]) < 128) o[n++] = i; else if (4 < (s = h[i])) o[n++] = 65533, r += s - 1; else {
  2064. for (i &= 2 === s ? 31 : 3 === s ? 15 : 7; 1 < s && r < a;) i = i << 6 | 63 & e[r++], s--;
  2065. 1 < s ? o[n++] = 65533 : i < 65536 ? o[n++] = i : (i -= 65536, o[n++] = 55296 | i >> 10 & 1023, o[n++] = 56320 | 1023 & i)
  2066. }
  2067. return f(o, n)
  2068. }, r.utf8border = function (e, t) {
  2069. var r;
  2070. for ((t = t || e.length) > e.length && (t = e.length), r = t - 1; 0 <= r && 128 == (192 & e[r]);) r--;
  2071. return r < 0 ? t : 0 === r ? t : r + h[e[r]] > t ? r : t
  2072. }
  2073. }, {"./common": 41}],
  2074. 43: [function (e, t, r) {
  2075. "use strict";
  2076. t.exports = function (e, t, r, n) {
  2077. for (var i = 65535 & e | 0, s = e >>> 16 & 65535 | 0, a = 0; 0 !== r;) {
  2078. for (r -= a = 2e3 < r ? 2e3 : r; s = s + (i = i + t[n++] | 0) | 0, --a;) ;
  2079. i %= 65521, s %= 65521
  2080. }
  2081. return i | s << 16 | 0
  2082. }
  2083. }, {}],
  2084. 44: [function (e, t, r) {
  2085. "use strict";
  2086. t.exports = {
  2087. Z_NO_FLUSH: 0,
  2088. Z_PARTIAL_FLUSH: 1,
  2089. Z_SYNC_FLUSH: 2,
  2090. Z_FULL_FLUSH: 3,
  2091. Z_FINISH: 4,
  2092. Z_BLOCK: 5,
  2093. Z_TREES: 6,
  2094. Z_OK: 0,
  2095. Z_STREAM_END: 1,
  2096. Z_NEED_DICT: 2,
  2097. Z_ERRNO: -1,
  2098. Z_STREAM_ERROR: -2,
  2099. Z_DATA_ERROR: -3,
  2100. Z_BUF_ERROR: -5,
  2101. Z_NO_COMPRESSION: 0,
  2102. Z_BEST_SPEED: 1,
  2103. Z_BEST_COMPRESSION: 9,
  2104. Z_DEFAULT_COMPRESSION: -1,
  2105. Z_FILTERED: 1,
  2106. Z_HUFFMAN_ONLY: 2,
  2107. Z_RLE: 3,
  2108. Z_FIXED: 4,
  2109. Z_DEFAULT_STRATEGY: 0,
  2110. Z_BINARY: 0,
  2111. Z_TEXT: 1,
  2112. Z_UNKNOWN: 2,
  2113. Z_DEFLATED: 8
  2114. }
  2115. }, {}],
  2116. 45: [function (e, t, r) {
  2117. "use strict";
  2118. var o = function () {
  2119. for (var e, t = [], r = 0; r < 256; r++) {
  2120. e = r;
  2121. for (var n = 0; n < 8; n++) e = 1 & e ? 3988292384 ^ e >>> 1 : e >>> 1;
  2122. t[r] = e
  2123. }
  2124. return t
  2125. }();
  2126. t.exports = function (e, t, r, n) {
  2127. var i = o, s = n + r;
  2128. e ^= -1;
  2129. for (var a = n; a < s; a++) e = e >>> 8 ^ i[255 & (e ^ t[a])];
  2130. return -1 ^ e
  2131. }
  2132. }, {}],
  2133. 46: [function (e, t, r) {
  2134. "use strict";
  2135. var u,
  2136. d = e("../utils/common"),
  2137. h = e("./trees"),
  2138. c = e("./adler32"),
  2139. p = e("./crc32"),
  2140. n = e("./messages"),
  2141. f = 0, l = 0, m = -2,
  2142. i = 2, _ = 8, s = 286,
  2143. a = 30, o = 19,
  2144. g = 2 * s + 1, v = 15,
  2145. b = 3, w = 258,
  2146. y = w + b + 1, k = 42,
  2147. x = 113;
  2148. function S(e, t) {
  2149. return e.msg = n[t], t
  2150. }
  2151. function z(e) {
  2152. return (e << 1) - (4 < e ? 9 : 0)
  2153. }
  2154. function C(e) {
  2155. for (var t = e.length; 0 <= --t;) e[t] = 0
  2156. }
  2157. function E(e) {
  2158. var t = e.state,
  2159. r = t.pending;
  2160. r > e.avail_out && (r = e.avail_out), 0 !== r && (d.arraySet(e.output, t.pending_buf, t.pending_out, r, e.next_out), e.next_out += r, t.pending_out += r, e.total_out += r, e.avail_out -= r, t.pending -= r, 0 === t.pending && (t.pending_out = 0))
  2161. }
  2162. function A(e, t) {
  2163. h._tr_flush_block(e, 0 <= e.block_start ? e.block_start : -1, e.strstart - e.block_start, t), e.block_start = e.strstart, E(e.strm)
  2164. }
  2165. function I(e, t) {
  2166. e.pending_buf[e.pending++] = t
  2167. }
  2168. function O(e, t) {
  2169. e.pending_buf[e.pending++] = t >>> 8 & 255, e.pending_buf[e.pending++] = 255 & t
  2170. }
  2171. function B(e, t) {
  2172. var r, n,
  2173. i = e.max_chain_length,
  2174. s = e.strstart,
  2175. a = e.prev_length,
  2176. o = e.nice_match,
  2177. u = e.strstart > e.w_size - y ? e.strstart - (e.w_size - y) : 0,
  2178. h = e.window,
  2179. f = e.w_mask,
  2180. l = e.prev,
  2181. d = e.strstart + w,
  2182. c = h[s + a - 1],
  2183. p = h[s + a];
  2184. e.prev_length >= e.good_match && (i >>= 2), o > e.lookahead && (o = e.lookahead);
  2185. do {
  2186. if (h[(r = t) + a] === p && h[r + a - 1] === c && h[r] === h[s] && h[++r] === h[s + 1]) {
  2187. s += 2, r++;
  2188. do {
  2189. } while (h[++s] === h[++r] && h[++s] === h[++r] && h[++s] === h[++r] && h[++s] === h[++r] && h[++s] === h[++r] && h[++s] === h[++r] && h[++s] === h[++r] && h[++s] === h[++r] && s < d);
  2190. if (n = w - (d - s), s = d - w, a < n) {
  2191. if (e.match_start = t, o <= (a = n)) break;
  2192. c = h[s + a - 1], p = h[s + a]
  2193. }
  2194. }
  2195. } while ((t = l[t & f]) > u && 0 != --i);
  2196. return a <= e.lookahead ? a : e.lookahead
  2197. }
  2198. function R(e) {
  2199. var t, r, n, i, s, a, o,
  2200. u, h, f,
  2201. l = e.w_size;
  2202. do {
  2203. if (i = e.window_size - e.lookahead - e.strstart, e.strstart >= l + (l - y)) {
  2204. for (d.arraySet(e.window, e.window, l, l, 0), e.match_start -= l, e.strstart -= l, e.block_start -= l, t = r = e.hash_size; n = e.head[--t], e.head[t] = l <= n ? n - l : 0, --r;) ;
  2205. for (t = r = l; n = e.prev[--t], e.prev[t] = l <= n ? n - l : 0, --r;) ;
  2206. i += l
  2207. }
  2208. if (0 === e.strm.avail_in) break;
  2209. if (a = e.strm, o = e.window, u = e.strstart + e.lookahead, f = void 0, (h = i) < (f = a.avail_in) && (f = h), r = 0 === f ? 0 : (a.avail_in -= f, d.arraySet(o, a.input, a.next_in, f, u), 1 === a.state.wrap ? a.adler = c(a.adler, o, f, u) : 2 === a.state.wrap && (a.adler = p(a.adler, o, f, u)), a.next_in += f, a.total_in += f, f), e.lookahead += r, e.lookahead + e.insert >= b) for (s = e.strstart - e.insert, e.ins_h = e.window[s], e.ins_h = (e.ins_h << e.hash_shift ^ e.window[s + 1]) & e.hash_mask; e.insert && (e.ins_h = (e.ins_h << e.hash_shift ^ e.window[s + b - 1]) & e.hash_mask, e.prev[s & e.w_mask] = e.head[e.ins_h], e.head[e.ins_h] = s, s++, e.insert--, !(e.lookahead + e.insert < b));) ;
  2210. } while (e.lookahead < y && 0 !== e.strm.avail_in)
  2211. }
  2212. function T(e, t) {
  2213. for (var r, n; ;) {
  2214. if (e.lookahead < y) {
  2215. if (R(e), e.lookahead < y && t === f) return 1;
  2216. if (0 === e.lookahead) break
  2217. }
  2218. if (r = 0, e.lookahead >= b && (e.ins_h = (e.ins_h << e.hash_shift ^ e.window[e.strstart + b - 1]) & e.hash_mask, r = e.prev[e.strstart & e.w_mask] = e.head[e.ins_h], e.head[e.ins_h] = e.strstart), 0 !== r && e.strstart - r <= e.w_size - y && (e.match_length = B(e, r)), e.match_length >= b) if (n = h._tr_tally(e, e.strstart - e.match_start, e.match_length - b), e.lookahead -= e.match_length, e.match_length <= e.max_lazy_match && e.lookahead >= b) {
  2219. for (e.match_length--; e.strstart++, e.ins_h = (e.ins_h << e.hash_shift ^ e.window[e.strstart + b - 1]) & e.hash_mask, r = e.prev[e.strstart & e.w_mask] = e.head[e.ins_h], e.head[e.ins_h] = e.strstart, 0 != --e.match_length;) ;
  2220. e.strstart++
  2221. } else e.strstart += e.match_length, e.match_length = 0, e.ins_h = e.window[e.strstart], e.ins_h = (e.ins_h << e.hash_shift ^ e.window[e.strstart + 1]) & e.hash_mask; else n = h._tr_tally(e, 0, e.window[e.strstart]), e.lookahead--, e.strstart++;
  2222. if (n && (A(e, !1), 0 === e.strm.avail_out)) return 1
  2223. }
  2224. return e.insert = e.strstart < b - 1 ? e.strstart : b - 1, 4 === t ? (A(e, !0), 0 === e.strm.avail_out ? 3 : 4) : e.last_lit && (A(e, !1), 0 === e.strm.avail_out) ? 1 : 2
  2225. }
  2226. function D(e, t) {
  2227. for (var r, n, i; ;) {
  2228. if (e.lookahead < y) {
  2229. if (R(e), e.lookahead < y && t === f) return 1;
  2230. if (0 === e.lookahead) break
  2231. }
  2232. if (r = 0, e.lookahead >= b && (e.ins_h = (e.ins_h << e.hash_shift ^ e.window[e.strstart + b - 1]) & e.hash_mask, r = e.prev[e.strstart & e.w_mask] = e.head[e.ins_h], e.head[e.ins_h] = e.strstart), e.prev_length = e.match_length, e.prev_match = e.match_start, e.match_length = b - 1, 0 !== r && e.prev_length < e.max_lazy_match && e.strstart - r <= e.w_size - y && (e.match_length = B(e, r), e.match_length <= 5 && (1 === e.strategy || e.match_length === b && 4096 < e.strstart - e.match_start) && (e.match_length = b - 1)), e.prev_length >= b && e.match_length <= e.prev_length) {
  2233. for (i = e.strstart + e.lookahead - b, n = h._tr_tally(e, e.strstart - 1 - e.prev_match, e.prev_length - b), e.lookahead -= e.prev_length - 1, e.prev_length -= 2; ++e.strstart <= i && (e.ins_h = (e.ins_h << e.hash_shift ^ e.window[e.strstart + b - 1]) & e.hash_mask, r = e.prev[e.strstart & e.w_mask] = e.head[e.ins_h], e.head[e.ins_h] = e.strstart), 0 != --e.prev_length;) ;
  2234. if (e.match_available = 0, e.match_length = b - 1, e.strstart++, n && (A(e, !1), 0 === e.strm.avail_out)) return 1
  2235. } else if (e.match_available) {
  2236. if ((n = h._tr_tally(e, 0, e.window[e.strstart - 1])) && A(e, !1), e.strstart++, e.lookahead--, 0 === e.strm.avail_out) return 1
  2237. } else e.match_available = 1, e.strstart++, e.lookahead--
  2238. }
  2239. return e.match_available && (n = h._tr_tally(e, 0, e.window[e.strstart - 1]), e.match_available = 0), e.insert = e.strstart < b - 1 ? e.strstart : b - 1, 4 === t ? (A(e, !0), 0 === e.strm.avail_out ? 3 : 4) : e.last_lit && (A(e, !1), 0 === e.strm.avail_out) ? 1 : 2
  2240. }
  2241. function F(e, t, r, n, i) {
  2242. this.good_length = e, this.max_lazy = t, this.nice_length = r, this.max_chain = n, this.func = i
  2243. }
  2244. function N() {
  2245. 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 d.Buf16(2 * g), this.dyn_dtree = new d.Buf16(2 * (2 * a + 1)), this.bl_tree = new d.Buf16(2 * (2 * o + 1)), C(this.dyn_ltree), C(this.dyn_dtree), C(this.bl_tree), this.l_desc = null, this.d_desc = null, this.bl_desc = null, this.bl_count = new d.Buf16(v + 1), this.heap = new d.Buf16(2 * s + 1), C(this.heap), this.heap_len = 0, this.heap_max = 0, this.depth = new d.Buf16(2 * s + 1), C(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
  2246. }
  2247. function U(e) {
  2248. var t;
  2249. return e && e.state ? (e.total_in = e.total_out = 0, e.data_type = i, (t = e.state).pending = 0, t.pending_out = 0, t.wrap < 0 && (t.wrap = -t.wrap), t.status = t.wrap ? k : x, e.adler = 2 === t.wrap ? 0 : 1, t.last_flush = f, h._tr_init(t), l) : S(e, m)
  2250. }
  2251. function P(e) {
  2252. var t, r = U(e);
  2253. return r === l && ((t = e.state).window_size = 2 * t.w_size, C(t.head), t.max_lazy_match = u[t.level].max_lazy, t.good_match = u[t.level].good_length, t.nice_match = u[t.level].nice_length, t.max_chain_length = u[t.level].max_chain, t.strstart = 0, t.block_start = 0, t.lookahead = 0, t.insert = 0, t.match_length = t.prev_length = b - 1, t.match_available = 0, t.ins_h = 0), r
  2254. }
  2255. function L(e, t, r, n, i, s) {
  2256. if (!e) return m;
  2257. var a = 1;
  2258. if (-1 === t && (t = 6), n < 0 ? (a = 0, n = -n) : 15 < n && (a = 2, n -= 16), i < 1 || 9 < i || r !== _ || n < 8 || 15 < n || t < 0 || 9 < t || s < 0 || 4 < s) return S(e, m);
  2259. 8 === n && (n = 9);
  2260. var o = new N;
  2261. return (e.state = o).strm = e, o.wrap = a, o.gzhead = null, o.w_bits = n, o.w_size = 1 << o.w_bits, o.w_mask = o.w_size - 1, o.hash_bits = i + 7, o.hash_size = 1 << o.hash_bits, o.hash_mask = o.hash_size - 1, o.hash_shift = ~~((o.hash_bits + b - 1) / b), o.window = new d.Buf8(2 * o.w_size), o.head = new d.Buf16(o.hash_size), o.prev = new d.Buf16(o.w_size), o.lit_bufsize = 1 << i + 6, o.pending_buf_size = 4 * o.lit_bufsize, o.pending_buf = new d.Buf8(o.pending_buf_size), o.d_buf = 1 * o.lit_bufsize, o.l_buf = 3 * o.lit_bufsize, o.level = t, o.strategy = s, o.method = r, P(e)
  2262. }
  2263. u = [new F(0, 0, 0, 0, function (e, t) {
  2264. var r = 65535;
  2265. for (r > e.pending_buf_size - 5 && (r = e.pending_buf_size - 5); ;) {
  2266. if (e.lookahead <= 1) {
  2267. if (R(e), 0 === e.lookahead && t === f) return 1;
  2268. if (0 === e.lookahead) break
  2269. }
  2270. e.strstart += e.lookahead, e.lookahead = 0;
  2271. var n = e.block_start + r;
  2272. if ((0 === e.strstart || e.strstart >= n) && (e.lookahead = e.strstart - n, e.strstart = n, A(e, !1), 0 === e.strm.avail_out)) return 1;
  2273. if (e.strstart - e.block_start >= e.w_size - y && (A(e, !1), 0 === e.strm.avail_out)) return 1
  2274. }
  2275. return e.insert = 0, 4 === t ? (A(e, !0), 0 === e.strm.avail_out ? 3 : 4) : (e.strstart > e.block_start && (A(e, !1), e.strm.avail_out), 1)
  2276. }), new F(4, 4, 8, 4, T), new F(4, 5, 16, 8, T), new F(4, 6, 32, 32, T), new F(4, 4, 16, 16, D), new F(8, 16, 32, 32, D), new F(8, 16, 128, 128, D), new F(8, 32, 128, 256, D), new F(32, 128, 258, 1024, D), new F(32, 258, 258, 4096, D)], r.deflateInit = function (e, t) {
  2277. return L(e, t, _, 15, 8, 0)
  2278. }, r.deflateInit2 = L, r.deflateReset = P, r.deflateResetKeep = U, r.deflateSetHeader = function (e, t) {
  2279. return e && e.state ? 2 !== e.state.wrap ? m : (e.state.gzhead = t, l) : m
  2280. }, r.deflate = function (e, t) {
  2281. var r, n, i, s;
  2282. if (!e || !e.state || 5 < t || t < 0) return e ? S(e, m) : m;
  2283. if (n = e.state, !e.output || !e.input && 0 !== e.avail_in || 666 === n.status && 4 !== t) return S(e, 0 === e.avail_out ? -5 : m);
  2284. if (n.strm = e, r = n.last_flush, n.last_flush = t, n.status === k) if (2 === n.wrap) e.adler = 0, I(n, 31), I(n, 139), I(n, 8), n.gzhead ? (I(n, (n.gzhead.text ? 1 : 0) + (n.gzhead.hcrc ? 2 : 0) + (n.gzhead.extra ? 4 : 0) + (n.gzhead.name ? 8 : 0) + (n.gzhead.comment ? 16 : 0)), I(n, 255 & n.gzhead.time), I(n, n.gzhead.time >> 8 & 255), I(n, n.gzhead.time >> 16 & 255), I(n, n.gzhead.time >> 24 & 255), I(n, 9 === n.level ? 2 : 2 <= n.strategy || n.level < 2 ? 4 : 0), I(n, 255 & n.gzhead.os), n.gzhead.extra && n.gzhead.extra.length && (I(n, 255 & n.gzhead.extra.length), I(n, n.gzhead.extra.length >> 8 & 255)), n.gzhead.hcrc && (e.adler = p(e.adler, n.pending_buf, n.pending, 0)), n.gzindex = 0, n.status = 69) : (I(n, 0), I(n, 0), I(n, 0), I(n, 0), I(n, 0), I(n, 9 === n.level ? 2 : 2 <= n.strategy || n.level < 2 ? 4 : 0), I(n, 3), n.status = x); else {
  2285. var a = _ + (n.w_bits - 8 << 4) << 8;
  2286. a |= (2 <= n.strategy || n.level < 2 ? 0 : n.level < 6 ? 1 : 6 === n.level ? 2 : 3) << 6, 0 !== n.strstart && (a |= 32), a += 31 - a % 31, n.status = x, O(n, a), 0 !== n.strstart && (O(n, e.adler >>> 16), O(n, 65535 & e.adler)), e.adler = 1
  2287. }
  2288. if (69 === n.status) if (n.gzhead.extra) {
  2289. for (i = n.pending; n.gzindex < (65535 & n.gzhead.extra.length) && (n.pending !== n.pending_buf_size || (n.gzhead.hcrc && n.pending > i && (e.adler = p(e.adler, n.pending_buf, n.pending - i, i)), E(e), i = n.pending, n.pending !== n.pending_buf_size));) I(n, 255 & n.gzhead.extra[n.gzindex]), n.gzindex++;
  2290. n.gzhead.hcrc && n.pending > i && (e.adler = p(e.adler, n.pending_buf, n.pending - i, i)), n.gzindex === n.gzhead.extra.length && (n.gzindex = 0, n.status = 73)
  2291. } else n.status = 73;
  2292. if (73 === n.status) if (n.gzhead.name) {
  2293. i = n.pending;
  2294. do {
  2295. if (n.pending === n.pending_buf_size && (n.gzhead.hcrc && n.pending > i && (e.adler = p(e.adler, n.pending_buf, n.pending - i, i)), E(e), i = n.pending, n.pending === n.pending_buf_size)) {
  2296. s = 1;
  2297. break
  2298. }
  2299. s = n.gzindex < n.gzhead.name.length ? 255 & n.gzhead.name.charCodeAt(n.gzindex++) : 0, I(n, s)
  2300. } while (0 !== s);
  2301. n.gzhead.hcrc && n.pending > i && (e.adler = p(e.adler, n.pending_buf, n.pending - i, i)), 0 === s && (n.gzindex = 0, n.status = 91)
  2302. } else n.status = 91;
  2303. if (91 === n.status) if (n.gzhead.comment) {
  2304. i = n.pending;
  2305. do {
  2306. if (n.pending === n.pending_buf_size && (n.gzhead.hcrc && n.pending > i && (e.adler = p(e.adler, n.pending_buf, n.pending - i, i)), E(e), i = n.pending, n.pending === n.pending_buf_size)) {
  2307. s = 1;
  2308. break
  2309. }
  2310. s = n.gzindex < n.gzhead.comment.length ? 255 & n.gzhead.comment.charCodeAt(n.gzindex++) : 0, I(n, s)
  2311. } while (0 !== s);
  2312. n.gzhead.hcrc && n.pending > i && (e.adler = p(e.adler, n.pending_buf, n.pending - i, i)), 0 === s && (n.status = 103)
  2313. } else n.status = 103;
  2314. if (103 === n.status && (n.gzhead.hcrc ? (n.pending + 2 > n.pending_buf_size && E(e), n.pending + 2 <= n.pending_buf_size && (I(n, 255 & e.adler), I(n, e.adler >> 8 & 255), e.adler = 0, n.status = x)) : n.status = x), 0 !== n.pending) {
  2315. if (E(e), 0 === e.avail_out) return n.last_flush = -1, l
  2316. } else if (0 === e.avail_in && z(t) <= z(r) && 4 !== t) return S(e, -5);
  2317. if (666 === n.status && 0 !== e.avail_in) return S(e, -5);
  2318. if (0 !== e.avail_in || 0 !== n.lookahead || t !== f && 666 !== n.status) {
  2319. var o = 2 === n.strategy ? function (e, t) {
  2320. for (var r; ;) {
  2321. if (0 === e.lookahead && (R(e), 0 === e.lookahead)) {
  2322. if (t === f) return 1;
  2323. break
  2324. }
  2325. if (e.match_length = 0, r = h._tr_tally(e, 0, e.window[e.strstart]), e.lookahead--, e.strstart++, r && (A(e, !1), 0 === e.strm.avail_out)) return 1
  2326. }
  2327. return e.insert = 0, 4 === t ? (A(e, !0), 0 === e.strm.avail_out ? 3 : 4) : e.last_lit && (A(e, !1), 0 === e.strm.avail_out) ? 1 : 2
  2328. }(n, t) : 3 === n.strategy ? function (e, t) {
  2329. for (var r, n, i, s, a = e.window; ;) {
  2330. if (e.lookahead <= w) {
  2331. if (R(e), e.lookahead <= w && t === f) return 1;
  2332. if (0 === e.lookahead) break
  2333. }
  2334. if (e.match_length = 0, e.lookahead >= b && 0 < e.strstart && (n = a[i = e.strstart - 1]) === a[++i] && n === a[++i] && n === a[++i]) {
  2335. s = e.strstart + w;
  2336. do {
  2337. } while (n === a[++i] && n === a[++i] && n === a[++i] && n === a[++i] && n === a[++i] && n === a[++i] && n === a[++i] && n === a[++i] && i < s);
  2338. e.match_length = w - (s - i), e.match_length > e.lookahead && (e.match_length = e.lookahead)
  2339. }
  2340. if (e.match_length >= b ? (r = h._tr_tally(e, 1, e.match_length - b), e.lookahead -= e.match_length, e.strstart += e.match_length, e.match_length = 0) : (r = h._tr_tally(e, 0, e.window[e.strstart]), e.lookahead--, e.strstart++), r && (A(e, !1), 0 === e.strm.avail_out)) return 1
  2341. }
  2342. return e.insert = 0, 4 === t ? (A(e, !0), 0 === e.strm.avail_out ? 3 : 4) : e.last_lit && (A(e, !1), 0 === e.strm.avail_out) ? 1 : 2
  2343. }(n, t) : u[n.level].func(n, t);
  2344. if (3 !== o && 4 !== o || (n.status = 666), 1 === o || 3 === o) return 0 === e.avail_out && (n.last_flush = -1), l;
  2345. if (2 === o && (1 === t ? h._tr_align(n) : 5 !== t && (h._tr_stored_block(n, 0, 0, !1), 3 === t && (C(n.head), 0 === n.lookahead && (n.strstart = 0, n.block_start = 0, n.insert = 0))), E(e), 0 === e.avail_out)) return n.last_flush = -1, l
  2346. }
  2347. return 4 !== t ? l : n.wrap <= 0 ? 1 : (2 === n.wrap ? (I(n, 255 & e.adler), I(n, e.adler >> 8 & 255), I(n, e.adler >> 16 & 255), I(n, e.adler >> 24 & 255), I(n, 255 & e.total_in), I(n, e.total_in >> 8 & 255), I(n, e.total_in >> 16 & 255), I(n, e.total_in >> 24 & 255)) : (O(n, e.adler >>> 16), O(n, 65535 & e.adler)), E(e), 0 < n.wrap && (n.wrap = -n.wrap), 0 !== n.pending ? l : 1)
  2348. }, r.deflateEnd = function (e) {
  2349. var t;
  2350. return e && e.state ? (t = e.state.status) !== k && 69 !== t && 73 !== t && 91 !== t && 103 !== t && t !== x && 666 !== t ? S(e, m) : (e.state = null, t === x ? S(e, -3) : l) : m
  2351. }, r.deflateSetDictionary = function (e, t) {
  2352. var r, n, i, s, a, o, u,
  2353. h, f = t.length;
  2354. if (!e || !e.state) return m;
  2355. if (2 === (s = (r = e.state).wrap) || 1 === s && r.status !== k || r.lookahead) return m;
  2356. for (1 === s && (e.adler = c(e.adler, t, f, 0)), r.wrap = 0, f >= r.w_size && (0 === s && (C(r.head), r.strstart = 0, r.block_start = 0, r.insert = 0), h = new d.Buf8(r.w_size), d.arraySet(h, t, f - r.w_size, r.w_size, 0), t = h, f = r.w_size), a = e.avail_in, o = e.next_in, u = e.input, e.avail_in = f, e.next_in = 0, e.input = t, R(r); r.lookahead >= b;) {
  2357. for (n = r.strstart, i = r.lookahead - (b - 1); r.ins_h = (r.ins_h << r.hash_shift ^ r.window[n + b - 1]) & r.hash_mask, r.prev[n & r.w_mask] = r.head[r.ins_h], r.head[r.ins_h] = n, n++, --i;) ;
  2358. r.strstart = n, r.lookahead = b - 1, R(r)
  2359. }
  2360. return r.strstart += r.lookahead, r.block_start = r.strstart, r.insert = r.lookahead, r.lookahead = 0, r.match_length = r.prev_length = b - 1, r.match_available = 0, e.next_in = o, e.input = u, e.avail_in = a, r.wrap = s, l
  2361. }, r.deflateInfo = "pako deflate (from Nodeca project)"
  2362. }, {
  2363. "../utils/common": 41,
  2364. "./adler32": 43,
  2365. "./crc32": 45,
  2366. "./messages": 51,
  2367. "./trees": 52
  2368. }],
  2369. 47: [function (e, t, r) {
  2370. "use strict";
  2371. t.exports = function () {
  2372. 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
  2373. }
  2374. }, {}],
  2375. 48: [function (e, t, r) {
  2376. "use strict";
  2377. t.exports = function (e, t) {
  2378. var r, n, i, s, a, o, u,
  2379. h, f, l, d, c, p, m,
  2380. _, g, v, b, w, y, k,
  2381. x, S, z, C;
  2382. r = e.state, n = e.next_in, z = e.input, i = n + (e.avail_in - 5), s = e.next_out, C = e.output, a = s - (t - e.avail_out), o = s + (e.avail_out - 257), u = r.dmax, h = r.wsize, f = r.whave, l = r.wnext, d = r.window, c = r.hold, p = r.bits, m = r.lencode, _ = r.distcode, g = (1 << r.lenbits) - 1, v = (1 << r.distbits) - 1;
  2383. e:do {
  2384. p < 15 && (c += z[n++] << p, p += 8, c += z[n++] << p, p += 8), b = m[c & g];
  2385. for (; ;) {
  2386. if (c >>>= w = b >>> 24, p -= w, 0 == (w = b >>> 16 & 255)) C[s++] = 65535 & b; else {
  2387. if (!(16 & w)) {
  2388. if (0 == (64 & w)) {
  2389. b = m[(65535 & b) + (c & (1 << w) - 1)];
  2390. continue;
  2391. }
  2392. if (32 & w) {
  2393. r.mode = 12;
  2394. break e
  2395. }
  2396. e.msg = "invalid literal/length code", r.mode = 30;
  2397. break e
  2398. }
  2399. y = 65535 & b, (w &= 15) && (p < w && (c += z[n++] << p, p += 8), y += c & (1 << w) - 1, c >>>= w, p -= w), p < 15 && (c += z[n++] << p, p += 8, c += z[n++] << p, p += 8), b = _[c & v];
  2400. for (; ;) {
  2401. if (c >>>= w = b >>> 24, p -= w, !(16 & (w = b >>> 16 & 255))) {
  2402. if (0 == (64 & w)) {
  2403. b = _[(65535 & b) + (c & (1 << w) - 1)];
  2404. continue;
  2405. }
  2406. e.msg = "invalid distance code", r.mode = 30;
  2407. break e
  2408. }
  2409. if (k = 65535 & b, p < (w &= 15) && (c += z[n++] << p, (p += 8) < w && (c += z[n++] << p, p += 8)), u < (k += c & (1 << w) - 1)) {
  2410. e.msg = "invalid distance too far back", r.mode = 30;
  2411. break e
  2412. }
  2413. if (c >>>= w, p -= w, (w = s - a) < k) {
  2414. if (f < (w = k - w) && r.sane) {
  2415. e.msg = "invalid distance too far back", r.mode = 30;
  2416. break e
  2417. }
  2418. if (S = d, (x = 0) === l) {
  2419. if (x += h - w, w < y) {
  2420. for (y -= w; C[s++] = d[x++], --w;) ;
  2421. x = s - k, S = C
  2422. }
  2423. } else if (l < w) {
  2424. if (x += h + l - w, (w -= l) < y) {
  2425. for (y -= w; C[s++] = d[x++], --w;) ;
  2426. if (x = 0, l < y) {
  2427. for (y -= w = l; C[s++] = d[x++], --w;) ;
  2428. x = s - k, S = C
  2429. }
  2430. }
  2431. } else if (x += l - w, w < y) {
  2432. for (y -= w; C[s++] = d[x++], --w;) ;
  2433. x = s - k, S = C
  2434. }
  2435. for (; 2 < y;) C[s++] = S[x++], C[s++] = S[x++], C[s++] = S[x++], y -= 3;
  2436. y && (C[s++] = S[x++], 1 < y && (C[s++] = S[x++]))
  2437. } else {
  2438. for (x = s - k; C[s++] = C[x++], C[s++] = C[x++], C[s++] = C[x++], 2 < (y -= 3);) ;
  2439. y && (C[s++] = C[x++], 1 < y && (C[s++] = C[x++]))
  2440. }
  2441. break
  2442. }
  2443. }
  2444. break
  2445. }
  2446. } while (n < i && s < o);
  2447. n -= y = p >> 3, c &= (1 << (p -= y << 3)) - 1, e.next_in = n, e.next_out = s, e.avail_in = n < i ? i - n + 5 : 5 - (n - i), e.avail_out = s < o ? o - s + 257 : 257 - (s - o), r.hold = c, r.bits = p
  2448. }
  2449. }, {}],
  2450. 49: [function (e, t, r) {
  2451. "use strict";
  2452. var I = e("../utils/common"),
  2453. O = e("./adler32"),
  2454. B = e("./crc32"),
  2455. R = e("./inffast"),
  2456. T = e("./inftrees"),
  2457. D = 1, F = 2, N = 0,
  2458. U = -2, P = 1, n = 852,
  2459. i = 592;
  2460. function L(e) {
  2461. return (e >>> 24 & 255) + (e >>> 8 & 65280) + ((65280 & e) << 8) + ((255 & e) << 24)
  2462. }
  2463. function s() {
  2464. this.mode = 0, this.last = !1, this.wrap = 0, this.havedict = !1, this.flags = 0, this.dmax = 0, this.check = 0, this.total = 0, this.head = null, this.wbits = 0, this.wsize = 0, this.whave = 0, this.wnext = 0, this.window = null, this.hold = 0, this.bits = 0, this.length = 0, this.offset = 0, this.extra = 0, this.lencode = null, this.distcode = null, this.lenbits = 0, this.distbits = 0, this.ncode = 0, this.nlen = 0, this.ndist = 0, this.have = 0, this.next = null, this.lens = new I.Buf16(320), this.work = new I.Buf16(288), this.lendyn = null, this.distdyn = null, this.sane = 0, this.back = 0, this.was = 0
  2465. }
  2466. function a(e) {
  2467. var t;
  2468. return e && e.state ? (t = e.state, e.total_in = e.total_out = t.total = 0, e.msg = "", t.wrap && (e.adler = 1 & t.wrap), t.mode = P, t.last = 0, t.havedict = 0, t.dmax = 32768, t.head = null, t.hold = 0, t.bits = 0, t.lencode = t.lendyn = new I.Buf32(n), t.distcode = t.distdyn = new I.Buf32(i), t.sane = 1, t.back = -1, N) : U
  2469. }
  2470. function o(e) {
  2471. var t;
  2472. return e && e.state ? ((t = e.state).wsize = 0, t.whave = 0, t.wnext = 0, a(e)) : U
  2473. }
  2474. function u(e, t) {
  2475. var r, n;
  2476. return e && e.state ? (n = e.state, t < 0 ? (r = 0, t = -t) : (r = 1 + (t >> 4), t < 48 && (t &= 15)), t && (t < 8 || 15 < t) ? U : (null !== n.window && n.wbits !== t && (n.window = null), n.wrap = r, n.wbits = t, o(e))) : U
  2477. }
  2478. function h(e, t) {
  2479. var r, n;
  2480. return e ? (n = new s, (e.state = n).window = null, (r = u(e, t)) !== N && (e.state = null), r) : U
  2481. }
  2482. var f, l, d = !0;
  2483. function j(e) {
  2484. if (d) {
  2485. var t;
  2486. for (f = new I.Buf32(512), l = new I.Buf32(32), t = 0; t < 144;) e.lens[t++] = 8;
  2487. for (; t < 256;) e.lens[t++] = 9;
  2488. for (; t < 280;) e.lens[t++] = 7;
  2489. for (; t < 288;) e.lens[t++] = 8;
  2490. for (T(D, e.lens, 0, 288, f, 0, e.work, {bits: 9}), t = 0; t < 32;) e.lens[t++] = 5;
  2491. T(F, e.lens, 0, 32, l, 0, e.work, {bits: 5}), d = !1
  2492. }
  2493. e.lencode = f, e.lenbits = 9, e.distcode = l, e.distbits = 5
  2494. }
  2495. function Z(e, t, r, n) {
  2496. var i, s = e.state;
  2497. return null === s.window && (s.wsize = 1 << s.wbits, s.wnext = 0, s.whave = 0, s.window = new I.Buf8(s.wsize)), n >= s.wsize ? (I.arraySet(s.window, t, r - s.wsize, s.wsize, 0), s.wnext = 0, s.whave = s.wsize) : (n < (i = s.wsize - s.wnext) && (i = n), I.arraySet(s.window, t, r - n, i, s.wnext), (n -= i) ? (I.arraySet(s.window, t, r - n, n, 0), s.wnext = n, s.whave = s.wsize) : (s.wnext += i, s.wnext === s.wsize && (s.wnext = 0), s.whave < s.wsize && (s.whave += i))), 0
  2498. }
  2499. r.inflateReset = o, r.inflateReset2 = u, r.inflateResetKeep = a, r.inflateInit = function (e) {
  2500. return h(e, 15)
  2501. }, r.inflateInit2 = h, r.inflate = function (e, t) {
  2502. var r, n, i, s, a, o, u,
  2503. h, f, l, d, c, p, m,
  2504. _, g, v, b, w, y, k,
  2505. x, S, z, C = 0,
  2506. E = new I.Buf8(4),
  2507. A = [16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15];
  2508. if (!e || !e.state || !e.output || !e.input && 0 !== e.avail_in) return U;
  2509. 12 === (r = e.state).mode && (r.mode = 13), a = e.next_out, i = e.output, u = e.avail_out, s = e.next_in, n = e.input, o = e.avail_in, h = r.hold, f = r.bits, l = o, d = u, x = N;
  2510. e:for (; ;) switch (r.mode) {
  2511. case P:
  2512. if (0 === r.wrap) {
  2513. r.mode = 13;
  2514. break
  2515. }
  2516. for (; f < 16;) {
  2517. if (0 === o) break e;
  2518. o--, h += n[s++] << f, f += 8
  2519. }
  2520. if (2 & r.wrap && 35615 === h) {
  2521. E[r.check = 0] = 255 & h, E[1] = h >>> 8 & 255, r.check = B(r.check, E, 2, 0), f = h = 0, r.mode = 2;
  2522. break
  2523. }
  2524. if (r.flags = 0, r.head && (r.head.done = !1), !(1 & r.wrap) || (((255 & h) << 8) + (h >> 8)) % 31) {
  2525. e.msg = "incorrect header check", r.mode = 30;
  2526. break
  2527. }
  2528. if (8 != (15 & h)) {
  2529. e.msg = "unknown compression method", r.mode = 30;
  2530. break
  2531. }
  2532. if (f -= 4, k = 8 + (15 & (h >>>= 4)), 0 === r.wbits) r.wbits = k; else if (k > r.wbits) {
  2533. e.msg = "invalid window size", r.mode = 30;
  2534. break
  2535. }
  2536. r.dmax = 1 << k, e.adler = r.check = 1, r.mode = 512 & h ? 10 : 12, f = h = 0;
  2537. break;
  2538. case 2:
  2539. for (; f < 16;) {
  2540. if (0 === o) break e;
  2541. o--, h += n[s++] << f, f += 8
  2542. }
  2543. if (r.flags = h, 8 != (255 & r.flags)) {
  2544. e.msg = "unknown compression method", r.mode = 30;
  2545. break
  2546. }
  2547. if (57344 & r.flags) {
  2548. e.msg = "unknown header flags set", r.mode = 30;
  2549. break
  2550. }
  2551. r.head && (r.head.text = h >> 8 & 1), 512 & r.flags && (E[0] = 255 & h, E[1] = h >>> 8 & 255, r.check = B(r.check, E, 2, 0)), f = h = 0, r.mode = 3;
  2552. case 3:
  2553. for (; f < 32;) {
  2554. if (0 === o) break e;
  2555. o--, h += n[s++] << f, f += 8
  2556. }
  2557. r.head && (r.head.time = h), 512 & r.flags && (E[0] = 255 & h, E[1] = h >>> 8 & 255, E[2] = h >>> 16 & 255, E[3] = h >>> 24 & 255, r.check = B(r.check, E, 4, 0)), f = h = 0, r.mode = 4;
  2558. case 4:
  2559. for (; f < 16;) {
  2560. if (0 === o) break e;
  2561. o--, h += n[s++] << f, f += 8
  2562. }
  2563. r.head && (r.head.xflags = 255 & h, r.head.os = h >> 8), 512 & r.flags && (E[0] = 255 & h, E[1] = h >>> 8 & 255, r.check = B(r.check, E, 2, 0)), f = h = 0, r.mode = 5;
  2564. case 5:
  2565. if (1024 & r.flags) {
  2566. for (; f < 16;) {
  2567. if (0 === o) break e;
  2568. o--, h += n[s++] << f, f += 8
  2569. }
  2570. r.length = h, r.head && (r.head.extra_len = h), 512 & r.flags && (E[0] = 255 & h, E[1] = h >>> 8 & 255, r.check = B(r.check, E, 2, 0)), f = h = 0
  2571. } else r.head && (r.head.extra = null);
  2572. r.mode = 6;
  2573. case 6:
  2574. if (1024 & r.flags && (o < (c = r.length) && (c = o), c && (r.head && (k = r.head.extra_len - r.length, r.head.extra || (r.head.extra = new Array(r.head.extra_len)), I.arraySet(r.head.extra, n, s, c, k)), 512 & r.flags && (r.check = B(r.check, n, c, s)), o -= c, s += c, r.length -= c), r.length)) break e;
  2575. r.length = 0, r.mode = 7;
  2576. case 7:
  2577. if (2048 & r.flags) {
  2578. if (0 === o) break e;
  2579. for (c = 0; k = n[s + c++], r.head && k && r.length < 65536 && (r.head.name += String.fromCharCode(k)), k && c < o;) ;
  2580. if (512 & r.flags && (r.check = B(r.check, n, c, s)), o -= c, s += c, k) break e
  2581. } else r.head && (r.head.name = null);
  2582. r.length = 0, r.mode = 8;
  2583. case 8:
  2584. if (4096 & r.flags) {
  2585. if (0 === o) break e;
  2586. for (c = 0; k = n[s + c++], r.head && k && r.length < 65536 && (r.head.comment += String.fromCharCode(k)), k && c < o;) ;
  2587. if (512 & r.flags && (r.check = B(r.check, n, c, s)), o -= c, s += c, k) break e
  2588. } else r.head && (r.head.comment = null);
  2589. r.mode = 9;
  2590. case 9:
  2591. if (512 & r.flags) {
  2592. for (; f < 16;) {
  2593. if (0 === o) break e;
  2594. o--, h += n[s++] << f, f += 8
  2595. }
  2596. if (h !== (65535 & r.check)) {
  2597. e.msg = "header crc mismatch", r.mode = 30;
  2598. break
  2599. }
  2600. f = h = 0
  2601. }
  2602. r.head && (r.head.hcrc = r.flags >> 9 & 1, r.head.done = !0), e.adler = r.check = 0, r.mode = 12;
  2603. break;
  2604. case 10:
  2605. for (; f < 32;) {
  2606. if (0 === o) break e;
  2607. o--, h += n[s++] << f, f += 8
  2608. }
  2609. e.adler = r.check = L(h), f = h = 0, r.mode = 11;
  2610. case 11:
  2611. if (0 === r.havedict) return e.next_out = a, e.avail_out = u, e.next_in = s, e.avail_in = o, r.hold = h, r.bits = f, 2;
  2612. e.adler = r.check = 1, r.mode = 12;
  2613. case 12:
  2614. if (5 === t || 6 === t) break e;
  2615. case 13:
  2616. if (r.last) {
  2617. h >>>= 7 & f, f -= 7 & f, r.mode = 27;
  2618. break
  2619. }
  2620. for (; f < 3;) {
  2621. if (0 === o) break e;
  2622. o--, h += n[s++] << f, f += 8
  2623. }
  2624. switch (r.last = 1 & h, f -= 1, 3 & (h >>>= 1)) {
  2625. case 0:
  2626. r.mode = 14;
  2627. break;
  2628. case 1:
  2629. if (j(r), r.mode = 20, 6 !== t) break;
  2630. h >>>= 2, f -= 2;
  2631. break e;
  2632. case 2:
  2633. r.mode = 17;
  2634. break;
  2635. case 3:
  2636. e.msg = "invalid block type", r.mode = 30
  2637. }
  2638. h >>>= 2, f -= 2;
  2639. break;
  2640. case 14:
  2641. for (h >>>= 7 & f, f -= 7 & f; f < 32;) {
  2642. if (0 === o) break e;
  2643. o--, h += n[s++] << f, f += 8
  2644. }
  2645. if ((65535 & h) != (h >>> 16 ^ 65535)) {
  2646. e.msg = "invalid stored block lengths", r.mode = 30;
  2647. break
  2648. }
  2649. if (r.length = 65535 & h, f = h = 0, r.mode = 15, 6 === t) break e;
  2650. case 15:
  2651. r.mode = 16;
  2652. case 16:
  2653. if (c = r.length) {
  2654. if (o < c && (c = o), u < c && (c = u), 0 === c) break e;
  2655. I.arraySet(i, n, s, c, a), o -= c, s += c, u -= c, a += c, r.length -= c;
  2656. break
  2657. }
  2658. r.mode = 12;
  2659. break;
  2660. case 17:
  2661. for (; f < 14;) {
  2662. if (0 === o) break e;
  2663. o--, h += n[s++] << f, f += 8
  2664. }
  2665. if (r.nlen = 257 + (31 & h), h >>>= 5, f -= 5, r.ndist = 1 + (31 & h), h >>>= 5, f -= 5, r.ncode = 4 + (15 & h), h >>>= 4, f -= 4, 286 < r.nlen || 30 < r.ndist) {
  2666. e.msg = "too many length or distance symbols", r.mode = 30;
  2667. break
  2668. }
  2669. r.have = 0, r.mode = 18;
  2670. case 18:
  2671. for (; r.have < r.ncode;) {
  2672. for (; f < 3;) {
  2673. if (0 === o) break e;
  2674. o--, h += n[s++] << f, f += 8
  2675. }
  2676. r.lens[A[r.have++]] = 7 & h, h >>>= 3, f -= 3
  2677. }
  2678. for (; r.have < 19;) r.lens[A[r.have++]] = 0;
  2679. if (r.lencode = r.lendyn, r.lenbits = 7, S = {bits: r.lenbits}, x = T(0, r.lens, 0, 19, r.lencode, 0, r.work, S), r.lenbits = S.bits, x) {
  2680. e.msg = "invalid code lengths set", r.mode = 30;
  2681. break
  2682. }
  2683. r.have = 0, r.mode = 19;
  2684. case 19:
  2685. for (; r.have < r.nlen + r.ndist;) {
  2686. for (; g = (C = r.lencode[h & (1 << r.lenbits) - 1]) >>> 16 & 255, v = 65535 & C, !((_ = C >>> 24) <= f);) {
  2687. if (0 === o) break e;
  2688. o--, h += n[s++] << f, f += 8
  2689. }
  2690. if (v < 16) h >>>= _, f -= _, r.lens[r.have++] = v; else {
  2691. if (16 === v) {
  2692. for (z = _ + 2; f < z;) {
  2693. if (0 === o) break e;
  2694. o--, h += n[s++] << f, f += 8
  2695. }
  2696. if (h >>>= _, f -= _, 0 === r.have) {
  2697. e.msg = "invalid bit length repeat", r.mode = 30;
  2698. break
  2699. }
  2700. k = r.lens[r.have - 1], c = 3 + (3 & h), h >>>= 2, f -= 2
  2701. } else if (17 === v) {
  2702. for (z = _ + 3; f < z;) {
  2703. if (0 === o) break e;
  2704. o--, h += n[s++] << f, f += 8
  2705. }
  2706. f -= _, k = 0, c = 3 + (7 & (h >>>= _)), h >>>= 3, f -= 3
  2707. } else {
  2708. for (z = _ + 7; f < z;) {
  2709. if (0 === o) break e;
  2710. o--, h += n[s++] << f, f += 8
  2711. }
  2712. f -= _, k = 0, c = 11 + (127 & (h >>>= _)), h >>>= 7, f -= 7
  2713. }
  2714. if (r.have + c > r.nlen + r.ndist) {
  2715. e.msg = "invalid bit length repeat", r.mode = 30;
  2716. break
  2717. }
  2718. for (; c--;) r.lens[r.have++] = k
  2719. }
  2720. }
  2721. if (30 === r.mode) break;
  2722. if (0 === r.lens[256]) {
  2723. e.msg = "invalid code -- missing end-of-block", r.mode = 30;
  2724. break
  2725. }
  2726. if (r.lenbits = 9, S = {bits: r.lenbits}, x = T(D, r.lens, 0, r.nlen, r.lencode, 0, r.work, S), r.lenbits = S.bits, x) {
  2727. e.msg = "invalid literal/lengths set", r.mode = 30;
  2728. break
  2729. }
  2730. if (r.distbits = 6, r.distcode = r.distdyn, S = {bits: r.distbits}, x = T(F, r.lens, r.nlen, r.ndist, r.distcode, 0, r.work, S), r.distbits = S.bits, x) {
  2731. e.msg = "invalid distances set", r.mode = 30;
  2732. break
  2733. }
  2734. if (r.mode = 20, 6 === t) break e;
  2735. case 20:
  2736. r.mode = 21;
  2737. case 21:
  2738. if (6 <= o && 258 <= u) {
  2739. e.next_out = a, e.avail_out = u, e.next_in = s, e.avail_in = o, r.hold = h, r.bits = f, R(e, d), a = e.next_out, i = e.output, u = e.avail_out, s = e.next_in, n = e.input, o = e.avail_in, h = r.hold, f = r.bits, 12 === r.mode && (r.back = -1);
  2740. break
  2741. }
  2742. for (r.back = 0; g = (C = r.lencode[h & (1 << r.lenbits) - 1]) >>> 16 & 255, v = 65535 & C, !((_ = C >>> 24) <= f);) {
  2743. if (0 === o) break e;
  2744. o--, h += n[s++] << f, f += 8
  2745. }
  2746. if (g && 0 == (240 & g)) {
  2747. for (b = _, w = g, y = v; g = (C = r.lencode[y + ((h & (1 << b + w) - 1) >> b)]) >>> 16 & 255, v = 65535 & C, !(b + (_ = C >>> 24) <= f);) {
  2748. if (0 === o) break e;
  2749. o--, h += n[s++] << f, f += 8
  2750. }
  2751. h >>>= b, f -= b, r.back += b
  2752. }
  2753. if (h >>>= _, f -= _, r.back += _, r.length = v, 0 === g) {
  2754. r.mode = 26;
  2755. break
  2756. }
  2757. if (32 & g) {
  2758. r.back = -1, r.mode = 12;
  2759. break
  2760. }
  2761. if (64 & g) {
  2762. e.msg = "invalid literal/length code", r.mode = 30;
  2763. break
  2764. }
  2765. r.extra = 15 & g, r.mode = 22;
  2766. case 22:
  2767. if (r.extra) {
  2768. for (z = r.extra; f < z;) {
  2769. if (0 === o) break e;
  2770. o--, h += n[s++] << f, f += 8
  2771. }
  2772. r.length += h & (1 << r.extra) - 1, h >>>= r.extra, f -= r.extra, r.back += r.extra
  2773. }
  2774. r.was = r.length, r.mode = 23;
  2775. case 23:
  2776. for (; g = (C = r.distcode[h & (1 << r.distbits) - 1]) >>> 16 & 255, v = 65535 & C, !((_ = C >>> 24) <= f);) {
  2777. if (0 === o) break e;
  2778. o--, h += n[s++] << f, f += 8
  2779. }
  2780. if (0 == (240 & g)) {
  2781. for (b = _, w = g, y = v; g = (C = r.distcode[y + ((h & (1 << b + w) - 1) >> b)]) >>> 16 & 255, v = 65535 & C, !(b + (_ = C >>> 24) <= f);) {
  2782. if (0 === o) break e;
  2783. o--, h += n[s++] << f, f += 8
  2784. }
  2785. h >>>= b, f -= b, r.back += b
  2786. }
  2787. if (h >>>= _, f -= _, r.back += _, 64 & g) {
  2788. e.msg = "invalid distance code", r.mode = 30;
  2789. break
  2790. }
  2791. r.offset = v, r.extra = 15 & g, r.mode = 24;
  2792. case 24:
  2793. if (r.extra) {
  2794. for (z = r.extra; f < z;) {
  2795. if (0 === o) break e;
  2796. o--, h += n[s++] << f, f += 8
  2797. }
  2798. r.offset += h & (1 << r.extra) - 1, h >>>= r.extra, f -= r.extra, r.back += r.extra
  2799. }
  2800. if (r.offset > r.dmax) {
  2801. e.msg = "invalid distance too far back", r.mode = 30;
  2802. break
  2803. }
  2804. r.mode = 25;
  2805. case 25:
  2806. if (0 === u) break e;
  2807. if (c = d - u, r.offset > c) {
  2808. if ((c = r.offset - c) > r.whave && r.sane) {
  2809. e.msg = "invalid distance too far back", r.mode = 30;
  2810. break
  2811. }
  2812. p = c > r.wnext ? (c -= r.wnext, r.wsize - c) : r.wnext - c, c > r.length && (c = r.length), m = r.window
  2813. } else m = i, p = a - r.offset, c = r.length;
  2814. for (u < c && (c = u), u -= c, r.length -= c; i[a++] = m[p++], --c;) ;
  2815. 0 === r.length && (r.mode = 21);
  2816. break;
  2817. case 26:
  2818. if (0 === u) break e;
  2819. i[a++] = r.length, u--, r.mode = 21;
  2820. break;
  2821. case 27:
  2822. if (r.wrap) {
  2823. for (; f < 32;) {
  2824. if (0 === o) break e;
  2825. o--, h |= n[s++] << f, f += 8
  2826. }
  2827. if (d -= u, e.total_out += d, r.total += d, d && (e.adler = r.check = r.flags ? B(r.check, i, d, a - d) : O(r.check, i, d, a - d)), d = u, (r.flags ? h : L(h)) !== r.check) {
  2828. e.msg = "incorrect data check", r.mode = 30;
  2829. break
  2830. }
  2831. f = h = 0
  2832. }
  2833. r.mode = 28;
  2834. case 28:
  2835. if (r.wrap && r.flags) {
  2836. for (; f < 32;) {
  2837. if (0 === o) break e;
  2838. o--, h += n[s++] << f, f += 8
  2839. }
  2840. if (h !== (4294967295 & r.total)) {
  2841. e.msg = "incorrect length check", r.mode = 30;
  2842. break
  2843. }
  2844. f = h = 0
  2845. }
  2846. r.mode = 29;
  2847. case 29:
  2848. x = 1;
  2849. break e;
  2850. case 30:
  2851. x = -3;
  2852. break e;
  2853. case 31:
  2854. return -4;
  2855. case 32:
  2856. default:
  2857. return U
  2858. }
  2859. return e.next_out = a, e.avail_out = u, e.next_in = s, e.avail_in = o, r.hold = h, r.bits = f, (r.wsize || d !== e.avail_out && r.mode < 30 && (r.mode < 27 || 4 !== t)) && Z(e, e.output, e.next_out, d - e.avail_out) ? (r.mode = 31, -4) : (l -= e.avail_in, d -= e.avail_out, e.total_in += l, e.total_out += d, r.total += d, r.wrap && d && (e.adler = r.check = r.flags ? B(r.check, i, d, e.next_out - d) : O(r.check, i, d, e.next_out - d)), e.data_type = r.bits + (r.last ? 64 : 0) + (12 === r.mode ? 128 : 0) + (20 === r.mode || 15 === r.mode ? 256 : 0), (0 == l && 0 === d || 4 === t) && x === N && (x = -5), x)
  2860. }, r.inflateEnd = function (e) {
  2861. if (!e || !e.state) return U;
  2862. var t = e.state;
  2863. return t.window && (t.window = null), e.state = null, N
  2864. }, r.inflateGetHeader = function (e, t) {
  2865. var r;
  2866. return e && e.state ? 0 == (2 & (r = e.state).wrap) ? U : ((r.head = t).done = !1, N) : U
  2867. }, r.inflateSetDictionary = function (e, t) {
  2868. var r, n = t.length;
  2869. return e && e.state ? 0 !== (r = e.state).wrap && 11 !== r.mode ? U : 11 === r.mode && O(1, t, n, 0) !== r.check ? -3 : Z(e, t, n, n) ? (r.mode = 31, -4) : (r.havedict = 1, N) : U
  2870. }, r.inflateInfo = "pako inflate (from Nodeca project)"
  2871. }, {
  2872. "../utils/common": 41,
  2873. "./adler32": 43,
  2874. "./crc32": 45,
  2875. "./inffast": 48,
  2876. "./inftrees": 50
  2877. }],
  2878. 50: [function (e, t, r) {
  2879. "use strict";
  2880. var D = e("../utils/common"),
  2881. F = [3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 15, 17, 19, 23, 27, 31, 35, 43, 51, 59, 67, 83, 99, 115, 131, 163, 195, 227, 258, 0, 0],
  2882. N = [16, 16, 16, 16, 16, 16, 16, 16, 17, 17, 17, 17, 18, 18, 18, 18, 19, 19, 19, 19, 20, 20, 20, 20, 21, 21, 21, 21, 16, 72, 78],
  2883. U = [1, 2, 3, 4, 5, 7, 9, 13, 17, 25, 33, 49, 65, 97, 129, 193, 257, 385, 513, 769, 1025, 1537, 2049, 3073, 4097, 6145, 8193, 12289, 16385, 24577, 0, 0],
  2884. P = [16, 16, 16, 16, 17, 17, 18, 18, 19, 19, 20, 20, 21, 21, 22, 22, 23, 23, 24, 24, 25, 25, 26, 26, 27, 27, 28, 28, 29, 29, 64, 64];
  2885. t.exports = function (e, t, r, n, i, s, a, o) {
  2886. var u, h, f, l, d, c, p,
  2887. m, _, g = o.bits,
  2888. v = 0, b = 0, w = 0,
  2889. y = 0, k = 0, x = 0,
  2890. S = 0, z = 0, C = 0,
  2891. E = 0, A = null,
  2892. I = 0,
  2893. O = new D.Buf16(16),
  2894. B = new D.Buf16(16),
  2895. R = null, T = 0;
  2896. for (v = 0; v <= 15; v++) O[v] = 0;
  2897. for (b = 0; b < n; b++) O[t[r + b]]++;
  2898. for (k = g, y = 15; 1 <= y && 0 === O[y]; y--) ;
  2899. if (y < k && (k = y), 0 === y) return i[s++] = 20971520, i[s++] = 20971520, o.bits = 1, 0;
  2900. for (w = 1; w < y && 0 === O[w]; w++) ;
  2901. for (k < w && (k = w), v = z = 1; v <= 15; v++) if (z <<= 1, (z -= O[v]) < 0) return -1;
  2902. if (0 < z && (0 === e || 1 !== y)) return -1;
  2903. for (B[1] = 0, v = 1; v < 15; v++) B[v + 1] = B[v] + O[v];
  2904. for (b = 0; b < n; b++) 0 !== t[r + b] && (a[B[t[r + b]]++] = b);
  2905. if (c = 0 === e ? (A = R = a, 19) : 1 === e ? (A = F, I -= 257, R = N, T -= 257, 256) : (A = U, R = P, -1), v = w, d = s, S = b = E = 0, f = -1, l = (C = 1 << (x = k)) - 1, 1 === e && 852 < C || 2 === e && 592 < C) return 1;
  2906. for (; ;) {
  2907. for (p = v - S, _ = a[b] < c ? (m = 0, a[b]) : a[b] > c ? (m = R[T + a[b]], A[I + a[b]]) : (m = 96, 0), u = 1 << v - S, w = h = 1 << x; i[d + (E >> S) + (h -= u)] = p << 24 | m << 16 | _ | 0, 0 !== h;) ;
  2908. for (u = 1 << v - 1; E & u;) u >>= 1;
  2909. if (0 !== u ? (E &= u - 1, E += u) : E = 0, b++, 0 == --O[v]) {
  2910. if (v === y) break;
  2911. v = t[r + a[b]]
  2912. }
  2913. if (k < v && (E & l) !== f) {
  2914. for (0 === S && (S = k), d += w, z = 1 << (x = v - S); x + S < y && !((z -= O[x + S]) <= 0);) x++, z <<= 1;
  2915. if (C += 1 << x, 1 === e && 852 < C || 2 === e && 592 < C) return 1;
  2916. i[f = E & l] = k << 24 | x << 16 | d - s | 0
  2917. }
  2918. }
  2919. return 0 !== E && (i[d + E] = v - S << 24 | 64 << 16 | 0), o.bits = k, 0
  2920. }
  2921. }, {"../utils/common": 41}],
  2922. 51: [function (e, t, r) {
  2923. "use strict";
  2924. t.exports = {
  2925. 2: "need dictionary",
  2926. 1: "stream end",
  2927. 0: "",
  2928. "-1": "file error",
  2929. "-2": "stream error",
  2930. "-3": "data error",
  2931. "-4": "insufficient memory",
  2932. "-5": "buffer error",
  2933. "-6": "incompatible version"
  2934. }
  2935. }, {}],
  2936. 52: [function (e, t, r) {
  2937. "use strict";
  2938. var o = e("../utils/common");
  2939. function n(e) {
  2940. for (var t = e.length; 0 <= --t;) e[t] = 0
  2941. }
  2942. var _ = 15, i = 16,
  2943. u = [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],
  2944. h = [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],
  2945. a = [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 3, 7],
  2946. f = [16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15],
  2947. l = new Array(576);
  2948. n(l);
  2949. var d = new Array(60);
  2950. n(d);
  2951. var c = new Array(512);
  2952. n(c);
  2953. var p = new Array(256);
  2954. n(p);
  2955. var m = new Array(29);
  2956. n(m);
  2957. var g, v, b,
  2958. w = new Array(30);
  2959. function y(e, t, r, n, i) {
  2960. this.static_tree = e, this.extra_bits = t, this.extra_base = r, this.elems = n, this.max_length = i, this.has_stree = e && e.length
  2961. }
  2962. function s(e, t) {
  2963. this.dyn_tree = e, this.max_code = 0, this.stat_desc = t
  2964. }
  2965. function k(e) {
  2966. return e < 256 ? c[e] : c[256 + (e >>> 7)]
  2967. }
  2968. function x(e, t) {
  2969. e.pending_buf[e.pending++] = 255 & t, e.pending_buf[e.pending++] = t >>> 8 & 255
  2970. }
  2971. function S(e, t, r) {
  2972. e.bi_valid > i - r ? (e.bi_buf |= t << e.bi_valid & 65535, x(e, e.bi_buf), e.bi_buf = t >> i - e.bi_valid, e.bi_valid += r - i) : (e.bi_buf |= t << e.bi_valid & 65535, e.bi_valid += r)
  2973. }
  2974. function z(e, t, r) {
  2975. S(e, r[2 * t], r[2 * t + 1])
  2976. }
  2977. function C(e, t) {
  2978. for (var r = 0; r |= 1 & e, e >>>= 1, r <<= 1, 0 < --t;) ;
  2979. return r >>> 1
  2980. }
  2981. function E(e, t, r) {
  2982. var n, i,
  2983. s = new Array(_ + 1),
  2984. a = 0;
  2985. for (n = 1; n <= _; n++) s[n] = a = a + r[n - 1] << 1;
  2986. for (i = 0; i <= t; i++) {
  2987. var o = e[2 * i + 1];
  2988. 0 !== o && (e[2 * i] = C(s[o]++, o))
  2989. }
  2990. }
  2991. function A(e) {
  2992. var t;
  2993. for (t = 0; t < 286; t++) e.dyn_ltree[2 * t] = 0;
  2994. for (t = 0; t < 30; t++) e.dyn_dtree[2 * t] = 0;
  2995. for (t = 0; t < 19; t++) e.bl_tree[2 * t] = 0;
  2996. e.dyn_ltree[512] = 1, e.opt_len = e.static_len = 0, e.last_lit = e.matches = 0
  2997. }
  2998. function I(e) {
  2999. 8 < e.bi_valid ? x(e, e.bi_buf) : 0 < e.bi_valid && (e.pending_buf[e.pending++] = e.bi_buf), e.bi_buf = 0, e.bi_valid = 0
  3000. }
  3001. function O(e, t, r, n) {
  3002. var i = 2 * t,
  3003. s = 2 * r;
  3004. return e[i] < e[s] || e[i] === e[s] && n[t] <= n[r]
  3005. }
  3006. function B(e, t, r) {
  3007. for (var n = e.heap[r], i = r << 1; i <= e.heap_len && (i < e.heap_len && O(t, e.heap[i + 1], e.heap[i], e.depth) && i++, !O(t, n, e.heap[i], e.depth));) e.heap[r] = e.heap[i], r = i, i <<= 1;
  3008. e.heap[r] = n
  3009. }
  3010. function R(e, t, r) {
  3011. var n, i, s, a, o = 0;
  3012. if (0 !== e.last_lit) for (; n = e.pending_buf[e.d_buf + 2 * o] << 8 | e.pending_buf[e.d_buf + 2 * o + 1], i = e.pending_buf[e.l_buf + o], o++, 0 === n ? z(e, i, t) : (z(e, (s = p[i]) + 256 + 1, t), 0 !== (a = u[s]) && S(e, i -= m[s], a), z(e, s = k(--n), r), 0 !== (a = h[s]) && S(e, n -= w[s], a)), o < e.last_lit;) ;
  3013. z(e, 256, t)
  3014. }
  3015. function T(e, t) {
  3016. var r, n, i,
  3017. s = t.dyn_tree,
  3018. a = t.stat_desc.static_tree,
  3019. o = t.stat_desc.has_stree,
  3020. u = t.stat_desc.elems,
  3021. h = -1;
  3022. for (e.heap_len = 0, e.heap_max = 573, r = 0; r < u; r++) 0 !== s[2 * r] ? (e.heap[++e.heap_len] = h = r, e.depth[r] = 0) : s[2 * r + 1] = 0;
  3023. for (; e.heap_len < 2;) s[2 * (i = e.heap[++e.heap_len] = h < 2 ? ++h : 0)] = 1, e.depth[i] = 0, e.opt_len--, o && (e.static_len -= a[2 * i + 1]);
  3024. for (t.max_code = h, r = e.heap_len >> 1; 1 <= r; r--) B(e, s, r);
  3025. for (i = u; r = e.heap[1], e.heap[1] = e.heap[e.heap_len--], B(e, s, 1), n = e.heap[1], e.heap[--e.heap_max] = r, e.heap[--e.heap_max] = n, s[2 * i] = s[2 * r] + s[2 * n], e.depth[i] = (e.depth[r] >= e.depth[n] ? e.depth[r] : e.depth[n]) + 1, s[2 * r + 1] = s[2 * n + 1] = i, e.heap[1] = i++, B(e, s, 1), 2 <= e.heap_len;) ;
  3026. e.heap[--e.heap_max] = e.heap[1], function (e, t) {
  3027. var r, n, i, s, a,
  3028. o,
  3029. u = t.dyn_tree,
  3030. h = t.max_code,
  3031. f = t.stat_desc.static_tree,
  3032. l = t.stat_desc.has_stree,
  3033. d = t.stat_desc.extra_bits,
  3034. c = t.stat_desc.extra_base,
  3035. p = t.stat_desc.max_length,
  3036. m = 0;
  3037. for (s = 0; s <= _; s++) e.bl_count[s] = 0;
  3038. for (u[2 * e.heap[e.heap_max] + 1] = 0, r = e.heap_max + 1; r < 573; r++) p < (s = u[2 * u[2 * (n = e.heap[r]) + 1] + 1] + 1) && (s = p, m++), u[2 * n + 1] = s, h < n || (e.bl_count[s]++, a = 0, c <= n && (a = d[n - c]), o = u[2 * n], e.opt_len += o * (s + a), l && (e.static_len += o * (f[2 * n + 1] + a)));
  3039. if (0 !== m) {
  3040. do {
  3041. for (s = p - 1; 0 === e.bl_count[s];) s--;
  3042. e.bl_count[s]--, e.bl_count[s + 1] += 2, e.bl_count[p]--, m -= 2
  3043. } while (0 < m);
  3044. for (s = p; 0 !== s; s--) for (n = e.bl_count[s]; 0 !== n;) h < (i = e.heap[--r]) || (u[2 * i + 1] !== s && (e.opt_len += (s - u[2 * i + 1]) * u[2 * i], u[2 * i + 1] = s), n--)
  3045. }
  3046. }(e, t), E(s, h, e.bl_count)
  3047. }
  3048. function D(e, t, r) {
  3049. var n, i, s = -1,
  3050. a = t[1], o = 0,
  3051. u = 7, h = 4;
  3052. for (0 === a && (u = 138, h = 3), t[2 * (r + 1) + 1] = 65535, n = 0; n <= r; n++) i = a, a = t[2 * (n + 1) + 1], ++o < u && i === a || (o < h ? e.bl_tree[2 * i] += o : 0 !== i ? (i !== s && e.bl_tree[2 * i]++, e.bl_tree[32]++) : o <= 10 ? e.bl_tree[34]++ : e.bl_tree[36]++, s = i, h = (o = 0) === a ? (u = 138, 3) : i === a ? (u = 6, 3) : (u = 7, 4))
  3053. }
  3054. function F(e, t, r) {
  3055. var n, i, s = -1,
  3056. a = t[1], o = 0,
  3057. u = 7, h = 4;
  3058. for (0 === a && (u = 138, h = 3), n = 0; n <= r; n++) if (i = a, a = t[2 * (n + 1) + 1], !(++o < u && i === a)) {
  3059. if (o < h) for (; z(e, i, e.bl_tree), 0 != --o;) ; else 0 !== i ? (i !== s && (z(e, i, e.bl_tree), o--), z(e, 16, e.bl_tree), S(e, o - 3, 2)) : o <= 10 ? (z(e, 17, e.bl_tree), S(e, o - 3, 3)) : (z(e, 18, e.bl_tree), S(e, o - 11, 7));
  3060. s = i, h = (o = 0) === a ? (u = 138, 3) : i === a ? (u = 6, 3) : (u = 7, 4)
  3061. }
  3062. }
  3063. n(w);
  3064. var N = !1;
  3065. function U(e, t, r, n) {
  3066. var i, s, a;
  3067. S(e, 0 + (n ? 1 : 0), 3), s = t, a = r, I(i = e), x(i, a), x(i, ~a), o.arraySet(i.pending_buf, i.window, s, a, i.pending), i.pending += a
  3068. }
  3069. r._tr_init = function (e) {
  3070. N || (function () {
  3071. var e, t, r, n, i,
  3072. s = new Array(_ + 1);
  3073. for (n = r = 0; n < 28; n++) for (m[n] = r, e = 0; e < 1 << u[n]; e++) p[r++] = n;
  3074. for (p[r - 1] = n, n = i = 0; n < 16; n++) for (w[n] = i, e = 0; e < 1 << h[n]; e++) c[i++] = n;
  3075. for (i >>= 7; n < 30; n++) for (w[n] = i << 7, e = 0; e < 1 << h[n] - 7; e++) c[256 + i++] = n;
  3076. for (t = 0; t <= _; t++) s[t] = 0;
  3077. for (e = 0; e <= 143;) l[2 * e + 1] = 8, e++, s[8]++;
  3078. for (; e <= 255;) l[2 * e + 1] = 9, e++, s[9]++;
  3079. for (; e <= 279;) l[2 * e + 1] = 7, e++, s[7]++;
  3080. for (; e <= 287;) l[2 * e + 1] = 8, e++, s[8]++;
  3081. for (E(l, 287, s), e = 0; e < 30; e++) d[2 * e + 1] = 5, d[2 * e] = C(e, 5);
  3082. g = new y(l, u, 257, 286, _), v = new y(d, h, 0, 30, _), b = new y(new Array(0), a, 0, 19, 7)
  3083. }(), N = !0), e.l_desc = new s(e.dyn_ltree, g), e.d_desc = new s(e.dyn_dtree, v), e.bl_desc = new s(e.bl_tree, b), e.bi_buf = 0, e.bi_valid = 0, A(e)
  3084. }, r._tr_stored_block = U, r._tr_flush_block = function (e, t, r, n) {
  3085. var i, s, a = 0;
  3086. 0 < e.level ? (2 === e.strm.data_type && (e.strm.data_type = function (e) {
  3087. var t,
  3088. r = 4093624447;
  3089. for (t = 0; t <= 31; t++, r >>>= 1) if (1 & r && 0 !== e.dyn_ltree[2 * t]) return 0;
  3090. if (0 !== e.dyn_ltree[18] || 0 !== e.dyn_ltree[20] || 0 !== e.dyn_ltree[26]) return 1;
  3091. for (t = 32; t < 256; t++) if (0 !== e.dyn_ltree[2 * t]) return 1;
  3092. return 0
  3093. }(e)), T(e, e.l_desc), T(e, e.d_desc), a = function (e) {
  3094. var t;
  3095. for (D(e, e.dyn_ltree, e.l_desc.max_code), D(e, e.dyn_dtree, e.d_desc.max_code), T(e, e.bl_desc), t = 18; 3 <= t && 0 === e.bl_tree[2 * f[t] + 1]; t--) ;
  3096. return e.opt_len += 3 * (t + 1) + 5 + 5 + 4, t
  3097. }(e), i = e.opt_len + 3 + 7 >>> 3, (s = e.static_len + 3 + 7 >>> 3) <= i && (i = s)) : i = s = r + 5, r + 4 <= i && -1 !== t ? U(e, t, r, n) : 4 === e.strategy || s === i ? (S(e, 2 + (n ? 1 : 0), 3), R(e, l, d)) : (S(e, 4 + (n ? 1 : 0), 3), function (e, t, r, n) {
  3098. var i;
  3099. for (S(e, t - 257, 5), S(e, r - 1, 5), S(e, n - 4, 4), i = 0; i < n; i++) S(e, e.bl_tree[2 * f[i] + 1], 3);
  3100. F(e, e.dyn_ltree, t - 1), F(e, e.dyn_dtree, r - 1)
  3101. }(e, e.l_desc.max_code + 1, e.d_desc.max_code + 1, a + 1), R(e, e.dyn_ltree, e.dyn_dtree)), A(e), n && I(e)
  3102. }, r._tr_tally = function (e, t, r) {
  3103. return e.pending_buf[e.d_buf + 2 * e.last_lit] = t >>> 8 & 255, e.pending_buf[e.d_buf + 2 * e.last_lit + 1] = 255 & t, e.pending_buf[e.l_buf + e.last_lit] = 255 & r, e.last_lit++, 0 === t ? e.dyn_ltree[2 * r]++ : (e.matches++, t--, e.dyn_ltree[2 * (p[r] + 256 + 1)]++, e.dyn_dtree[2 * k(t)]++), e.last_lit === e.lit_bufsize - 1
  3104. }, r._tr_align = function (e) {
  3105. var t;
  3106. S(e, 2, 3), z(e, 256, l), 16 === (t = e).bi_valid ? (x(t, t.bi_buf), t.bi_buf = 0, t.bi_valid = 0) : 8 <= t.bi_valid && (t.pending_buf[t.pending++] = 255 & t.bi_buf, t.bi_buf >>= 8, t.bi_valid -= 8)
  3107. }
  3108. }, {"../utils/common": 41}],
  3109. 53: [function (e, t, r) {
  3110. "use strict";
  3111. t.exports = function () {
  3112. 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
  3113. }
  3114. }, {}],
  3115. 54: [function (e, t, r) {
  3116. "use strict";
  3117. t.exports = "function" == typeof setImmediate ? setImmediate : function () {
  3118. var e = [].slice.apply(arguments);
  3119. e.splice(1, 0, 0), setTimeout.apply(null, e)
  3120. }
  3121. }, {}]
  3122. }, {}, [10])(10)
  3123. })
  3124. }).call(this, void 0 !== r ? r : "undefined" != typeof self ? self : "undefined" != typeof window ? window : {})
  3125. }, {}]
  3126. }, {}, [1])(1)
  3127. })
  3128. }).call(this, void 0 !== r ? r : "undefined" != typeof self ? self : "undefined" != typeof window ? window : {})
  3129. }, {}]
  3130. }, {}, [1])(1)
  3131. })
  3132. }).call(this, void 0 !== r ? r : "undefined" != typeof self ? self : "undefined" != typeof window ? window : {})
  3133. }, {}]
  3134. }, {}, [1])(1)
  3135. })
  3136. }).call(this, "undefined" != typeof global ? global : "undefined" != typeof self ? self : "undefined" != typeof window ? window : {})
  3137. }, {}]
  3138. }, {}, [1])(1)
  3139. });
  3140. }).call(this, typeof global !== "undefined" ? global : typeof self !== "undefined" ? self : typeof window !== "undefined" ? window : {})
  3141. }, {}]
  3142. }, {}, [1])(1)
  3143. });