jszip.js 471 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465146614671468146914701471147214731474147514761477147814791480148114821483148414851486148714881489149014911492149314941495149614971498149915001501150215031504150515061507150815091510151115121513151415151516151715181519152015211522152315241525152615271528152915301531153215331534153515361537153815391540154115421543154415451546154715481549155015511552155315541555155615571558155915601561156215631564156515661567156815691570157115721573157415751576157715781579158015811582158315841585158615871588158915901591159215931594159515961597159815991600160116021603160416051606160716081609161016111612161316141615161616171618161916201621162216231624162516261627162816291630163116321633163416351636163716381639164016411642164316441645164616471648164916501651165216531654165516561657165816591660166116621663166416651666166716681669167016711672167316741675167616771678167916801681168216831684168516861687168816891690169116921693169416951696169716981699170017011702170317041705170617071708170917101711171217131714171517161717171817191720172117221723172417251726172717281729173017311732173317341735173617371738173917401741174217431744174517461747174817491750175117521753175417551756175717581759176017611762176317641765176617671768176917701771177217731774177517761777177817791780178117821783178417851786178717881789179017911792179317941795179617971798179918001801180218031804180518061807180818091810181118121813181418151816181718181819182018211822182318241825182618271828182918301831183218331834183518361837183818391840184118421843184418451846184718481849185018511852185318541855185618571858185918601861186218631864186518661867186818691870187118721873187418751876187718781879188018811882188318841885188618871888188918901891189218931894189518961897189818991900190119021903190419051906190719081909191019111912191319141915191619171918191919201921192219231924192519261927192819291930193119321933193419351936193719381939194019411942194319441945194619471948194919501951195219531954195519561957195819591960196119621963196419651966196719681969197019711972197319741975197619771978197919801981198219831984198519861987198819891990199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202420252026202720282029203020312032203320342035203620372038203920402041204220432044204520462047204820492050205120522053205420552056205720582059206020612062206320642065206620672068206920702071207220732074207520762077207820792080208120822083208420852086208720882089209020912092209320942095209620972098209921002101210221032104210521062107210821092110211121122113211421152116211721182119212021212122212321242125212621272128212921302131213221332134213521362137213821392140214121422143214421452146214721482149215021512152215321542155215621572158215921602161216221632164216521662167216821692170217121722173217421752176217721782179218021812182218321842185218621872188218921902191219221932194219521962197219821992200220122022203220422052206220722082209221022112212221322142215221622172218221922202221222222232224222522262227222822292230223122322233223422352236223722382239224022412242224322442245224622472248224922502251225222532254225522562257225822592260226122622263226422652266226722682269227022712272227322742275227622772278227922802281228222832284228522862287228822892290229122922293229422952296229722982299230023012302230323042305230623072308230923102311231223132314231523162317231823192320232123222323232423252326232723282329233023312332233323342335233623372338233923402341234223432344234523462347234823492350235123522353235423552356235723582359236023612362236323642365236623672368236923702371237223732374237523762377237823792380238123822383238423852386238723882389239023912392239323942395239623972398239924002401240224032404240524062407240824092410241124122413241424152416241724182419242024212422242324242425242624272428242924302431243224332434243524362437243824392440244124422443244424452446244724482449245024512452245324542455245624572458245924602461246224632464246524662467246824692470247124722473247424752476247724782479248024812482248324842485248624872488248924902491249224932494249524962497249824992500250125022503250425052506250725082509251025112512251325142515251625172518251925202521252225232524252525262527252825292530253125322533253425352536253725382539254025412542254325442545254625472548254925502551255225532554255525562557255825592560256125622563256425652566256725682569257025712572257325742575257625772578257925802581258225832584258525862587258825892590259125922593259425952596259725982599260026012602260326042605260626072608260926102611261226132614261526162617261826192620262126222623262426252626262726282629263026312632263326342635263626372638263926402641264226432644264526462647264826492650265126522653265426552656265726582659266026612662266326642665266626672668266926702671267226732674267526762677267826792680268126822683268426852686268726882689269026912692269326942695269626972698269927002701270227032704270527062707270827092710271127122713271427152716271727182719272027212722272327242725272627272728272927302731273227332734273527362737273827392740274127422743274427452746274727482749275027512752275327542755275627572758275927602761276227632764276527662767276827692770277127722773277427752776277727782779278027812782278327842785278627872788278927902791279227932794279527962797279827992800280128022803280428052806280728082809281028112812281328142815281628172818281928202821282228232824282528262827282828292830283128322833283428352836283728382839284028412842284328442845284628472848284928502851285228532854285528562857285828592860286128622863286428652866286728682869287028712872287328742875287628772878287928802881288228832884288528862887288828892890289128922893289428952896289728982899290029012902290329042905290629072908290929102911291229132914291529162917291829192920292129222923292429252926292729282929293029312932293329342935293629372938293929402941294229432944294529462947294829492950295129522953295429552956295729582959296029612962296329642965296629672968296929702971297229732974297529762977297829792980298129822983298429852986298729882989299029912992299329942995299629972998299930003001300230033004300530063007300830093010301130123013301430153016301730183019302030213022302330243025302630273028302930303031303230333034303530363037303830393040304130423043304430453046304730483049305030513052305330543055305630573058305930603061306230633064306530663067306830693070307130723073307430753076307730783079308030813082308330843085308630873088308930903091309230933094309530963097309830993100310131023103310431053106310731083109311031113112311331143115311631173118311931203121312231233124312531263127312831293130313131323133313431353136313731383139314031413142314331443145314631473148314931503151315231533154315531563157315831593160316131623163316431653166316731683169317031713172317331743175317631773178317931803181318231833184318531863187318831893190319131923193319431953196319731983199320032013202320332043205320632073208320932103211321232133214321532163217321832193220322132223223322432253226322732283229323032313232323332343235323632373238323932403241324232433244324532463247324832493250325132523253325432553256325732583259326032613262326332643265326632673268326932703271327232733274327532763277327832793280328132823283328432853286328732883289329032913292329332943295329632973298329933003301330233033304330533063307330833093310331133123313331433153316331733183319332033213322332333243325332633273328332933303331333233333334333533363337333833393340334133423343334433453346334733483349335033513352335333543355335633573358335933603361336233633364336533663367336833693370337133723373337433753376337733783379338033813382338333843385338633873388338933903391339233933394339533963397339833993400340134023403340434053406340734083409341034113412341334143415341634173418341934203421342234233424342534263427342834293430343134323433343434353436343734383439344034413442344334443445344634473448344934503451345234533454345534563457345834593460346134623463346434653466346734683469347034713472347334743475347634773478347934803481348234833484348534863487348834893490349134923493349434953496349734983499350035013502350335043505350635073508350935103511351235133514351535163517351835193520352135223523352435253526352735283529353035313532353335343535353635373538353935403541354235433544354535463547354835493550355135523553355435553556355735583559356035613562356335643565356635673568356935703571357235733574357535763577357835793580358135823583358435853586358735883589359035913592359335943595359635973598359936003601360236033604360536063607360836093610361136123613361436153616361736183619362036213622362336243625362636273628362936303631363236333634363536363637363836393640364136423643364436453646364736483649365036513652365336543655365636573658365936603661366236633664366536663667366836693670367136723673367436753676367736783679368036813682368336843685368636873688368936903691369236933694369536963697369836993700370137023703370437053706370737083709371037113712371337143715371637173718371937203721372237233724372537263727372837293730373137323733373437353736373737383739374037413742374337443745374637473748374937503751375237533754375537563757375837593760376137623763376437653766376737683769377037713772377337743775377637773778377937803781378237833784378537863787378837893790379137923793379437953796379737983799380038013802380338043805380638073808380938103811381238133814381538163817381838193820382138223823382438253826382738283829383038313832383338343835383638373838383938403841384238433844384538463847384838493850385138523853385438553856385738583859386038613862386338643865386638673868386938703871387238733874387538763877387838793880388138823883388438853886388738883889389038913892389338943895389638973898389939003901390239033904390539063907390839093910391139123913391439153916391739183919392039213922392339243925392639273928392939303931393239333934393539363937393839393940394139423943394439453946394739483949395039513952395339543955395639573958395939603961396239633964396539663967396839693970397139723973397439753976397739783979398039813982398339843985398639873988398939903991399239933994399539963997399839994000400140024003400440054006400740084009401040114012401340144015401640174018401940204021402240234024402540264027402840294030403140324033403440354036403740384039404040414042404340444045404640474048404940504051405240534054405540564057405840594060406140624063406440654066406740684069407040714072407340744075407640774078407940804081408240834084408540864087408840894090409140924093409440954096409740984099410041014102410341044105410641074108410941104111411241134114411541164117411841194120412141224123412441254126412741284129413041314132413341344135413641374138413941404141414241434144414541464147414841494150415141524153415441554156415741584159416041614162416341644165416641674168416941704171417241734174417541764177417841794180418141824183418441854186418741884189419041914192419341944195419641974198419942004201420242034204420542064207420842094210421142124213421442154216421742184219422042214222422342244225422642274228422942304231423242334234423542364237423842394240424142424243424442454246424742484249425042514252425342544255425642574258425942604261426242634264426542664267426842694270427142724273427442754276427742784279428042814282428342844285428642874288428942904291429242934294429542964297429842994300430143024303430443054306430743084309431043114312431343144315431643174318431943204321432243234324432543264327432843294330433143324333433443354336433743384339434043414342434343444345434643474348434943504351435243534354435543564357435843594360436143624363436443654366436743684369437043714372437343744375437643774378437943804381438243834384438543864387438843894390439143924393439443954396439743984399440044014402440344044405440644074408440944104411441244134414441544164417441844194420442144224423442444254426442744284429443044314432443344344435443644374438443944404441444244434444444544464447444844494450445144524453445444554456445744584459446044614462446344644465446644674468446944704471447244734474447544764477447844794480448144824483448444854486448744884489449044914492449344944495449644974498449945004501450245034504450545064507450845094510451145124513451445154516451745184519452045214522452345244525452645274528452945304531453245334534453545364537453845394540454145424543454445454546454745484549455045514552455345544555455645574558455945604561456245634564456545664567456845694570457145724573457445754576457745784579458045814582458345844585458645874588458945904591459245934594459545964597459845994600460146024603460446054606460746084609461046114612461346144615461646174618461946204621462246234624462546264627462846294630463146324633463446354636463746384639464046414642464346444645464646474648464946504651465246534654465546564657465846594660466146624663466446654666466746684669467046714672467346744675467646774678467946804681468246834684468546864687468846894690469146924693469446954696469746984699470047014702470347044705470647074708470947104711471247134714471547164717471847194720472147224723472447254726472747284729473047314732473347344735473647374738473947404741474247434744474547464747474847494750475147524753475447554756475747584759476047614762476347644765476647674768476947704771477247734774477547764777477847794780478147824783478447854786478747884789479047914792479347944795479647974798479948004801480248034804480548064807480848094810481148124813481448154816481748184819482048214822482348244825482648274828482948304831483248334834483548364837483848394840484148424843484448454846484748484849485048514852485348544855485648574858485948604861486248634864486548664867486848694870487148724873487448754876487748784879488048814882488348844885488648874888488948904891489248934894489548964897489848994900490149024903490449054906490749084909491049114912491349144915491649174918491949204921492249234924492549264927492849294930493149324933493449354936493749384939494049414942494349444945
  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(
  41. l.exports,
  42. function (e) {
  43. var n = t[o][1][e];
  44. return s(n ? n : e);
  45. },
  46. l,
  47. l.exports,
  48. e,
  49. t,
  50. n,
  51. r
  52. );
  53. }
  54. return n[o].exports;
  55. }
  56. var i = typeof require == "function" && require;
  57. for (var o = 0; o < r.length; o++) s(r[o]);
  58. return s;
  59. })(
  60. {
  61. 1: [
  62. function (require, module, exports) {
  63. (function (global) {
  64. /*!
  65. JSZip v3.5.0 - A JavaScript class for generating and reading zip files
  66. <http://stuartk.com/jszip>
  67. (c) 2009-2016 Stuart Knightley <stuart [at] stuartk.com>
  68. Dual licenced under the MIT license or GPLv3. See https://raw.github.com/Stuk/jszip/master/LICENSE.markdown.
  69. JSZip uses the library pako released under the MIT license :
  70. https://github.com/nodeca/pako/blob/master/LICENSE
  71. */
  72. !(function (e) {
  73. if ("object" == typeof exports && "undefined" != typeof module) module.exports = e();
  74. else if ("function" == typeof define && define.amd) define([], e);
  75. else {
  76. ("undefined" != typeof window ? window : "undefined" != typeof global ? global : "undefined" != typeof self ? self : this).JSZip = e();
  77. }
  78. })(function () {
  79. return (function s(a, o, u) {
  80. function h(r, e) {
  81. if (!o[r]) {
  82. if (!a[r]) {
  83. var t = "function" == typeof require && require;
  84. if (!e && t) return t(r, !0);
  85. if (f) return f(r, !0);
  86. var n = new Error("Cannot find module '" + r + "'");
  87. throw ((n.code = "MODULE_NOT_FOUND"), n);
  88. }
  89. var i = (o[r] = { exports: {} });
  90. a[r][0].call(
  91. i.exports,
  92. function (e) {
  93. var t = a[r][1][e];
  94. return h(t || e);
  95. },
  96. i,
  97. i.exports,
  98. s,
  99. a,
  100. o,
  101. u
  102. );
  103. }
  104. return o[r].exports;
  105. }
  106. for (var f = "function" == typeof require && require, e = 0; e < u.length; e++) h(u[e]);
  107. return h;
  108. })(
  109. {
  110. 1: [
  111. function (l, t, n) {
  112. (function (r) {
  113. !(function (e) {
  114. "object" == typeof n && void 0 !== t
  115. ? (t.exports = e())
  116. : (("undefined" != typeof window ? window : void 0 !== r ? r : "undefined" != typeof self ? self : this).JSZip = e());
  117. })(function () {
  118. return (function s(a, o, u) {
  119. function h(t, e) {
  120. if (!o[t]) {
  121. if (!a[t]) {
  122. var r = "function" == typeof l && l;
  123. if (!e && r) return r(t, !0);
  124. if (f) return f(t, !0);
  125. var n = new Error("Cannot find module '" + t + "'");
  126. throw ((n.code = "MODULE_NOT_FOUND"), n);
  127. }
  128. var i = (o[t] = { exports: {} });
  129. a[t][0].call(
  130. i.exports,
  131. function (e) {
  132. return h(a[t][1][e] || e);
  133. },
  134. i,
  135. i.exports,
  136. s,
  137. a,
  138. o,
  139. u
  140. );
  141. }
  142. return o[t].exports;
  143. }
  144. for (var f = "function" == typeof l && l, e = 0; e < u.length; e++) h(u[e]);
  145. return h;
  146. })(
  147. {
  148. 1: [
  149. function (l, t, n) {
  150. (function (r) {
  151. !(function (e) {
  152. "object" == typeof n && void 0 !== t
  153. ? (t.exports = e())
  154. : (("undefined" != typeof window ? window : void 0 !== r ? r : "undefined" != typeof self ? self : this).JSZip = e());
  155. })(function () {
  156. return (function s(a, o, u) {
  157. function h(t, e) {
  158. if (!o[t]) {
  159. if (!a[t]) {
  160. var r = "function" == typeof l && l;
  161. if (!e && r) return r(t, !0);
  162. if (f) return f(t, !0);
  163. var n = new Error("Cannot find module '" + t + "'");
  164. throw ((n.code = "MODULE_NOT_FOUND"), n);
  165. }
  166. var i = (o[t] = { exports: {} });
  167. a[t][0].call(
  168. i.exports,
  169. function (e) {
  170. return h(a[t][1][e] || e);
  171. },
  172. i,
  173. i.exports,
  174. s,
  175. a,
  176. o,
  177. u
  178. );
  179. }
  180. return o[t].exports;
  181. }
  182. for (var f = "function" == typeof l && l, e = 0; e < u.length; e++) h(u[e]);
  183. return h;
  184. })(
  185. {
  186. 1: [
  187. function (l, t, n) {
  188. (function (r) {
  189. !(function (e) {
  190. "object" == typeof n && void 0 !== t
  191. ? (t.exports = e())
  192. : (("undefined" != typeof window ? window : void 0 !== r ? r : "undefined" != typeof self ? self : this).JSZip = e());
  193. })(function () {
  194. return (function s(a, o, u) {
  195. function h(t, e) {
  196. if (!o[t]) {
  197. if (!a[t]) {
  198. var r = "function" == typeof l && l;
  199. if (!e && r) return r(t, !0);
  200. if (f) return f(t, !0);
  201. var n = new Error("Cannot find module '" + t + "'");
  202. throw ((n.code = "MODULE_NOT_FOUND"), n);
  203. }
  204. var i = (o[t] = { exports: {} });
  205. a[t][0].call(
  206. i.exports,
  207. function (e) {
  208. return h(a[t][1][e] || e);
  209. },
  210. i,
  211. i.exports,
  212. s,
  213. a,
  214. o,
  215. u
  216. );
  217. }
  218. return o[t].exports;
  219. }
  220. for (var f = "function" == typeof l && l, e = 0; e < u.length; e++) h(u[e]);
  221. return h;
  222. })(
  223. {
  224. 1: [
  225. function (l, t, n) {
  226. (function (r) {
  227. !(function (e) {
  228. "object" == typeof n && void 0 !== t
  229. ? (t.exports = e())
  230. : (("undefined" != typeof window ? window : void 0 !== r ? r : "undefined" != typeof self ? self : this).JSZip = e());
  231. })(function () {
  232. return (function s(a, o, u) {
  233. function h(t, e) {
  234. if (!o[t]) {
  235. if (!a[t]) {
  236. var r = "function" == typeof l && l;
  237. if (!e && r) return r(t, !0);
  238. if (f) return f(t, !0);
  239. var n = new Error("Cannot find module '" + t + "'");
  240. throw ((n.code = "MODULE_NOT_FOUND"), n);
  241. }
  242. var i = (o[t] = { exports: {} });
  243. a[t][0].call(
  244. i.exports,
  245. function (e) {
  246. return h(a[t][1][e] || e);
  247. },
  248. i,
  249. i.exports,
  250. s,
  251. a,
  252. o,
  253. u
  254. );
  255. }
  256. return o[t].exports;
  257. }
  258. for (var f = "function" == typeof l && l, e = 0; e < u.length; e++) h(u[e]);
  259. return h;
  260. })(
  261. {
  262. 1: [
  263. function (e, t, r) {
  264. "use strict";
  265. var c = e("./utils"),
  266. l = e("./support"),
  267. p = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/=";
  268. (r.encode = function (e) {
  269. 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; )
  270. (l = f - h),
  271. (n = d
  272. ? ((t = e[h++]), (r = h < f ? e[h++] : 0), h < f ? e[h++] : 0)
  273. : ((t = e.charCodeAt(h++)), (r = h < f ? e.charCodeAt(h++) : 0), h < f ? e.charCodeAt(h++) : 0)),
  274. (i = t >> 2),
  275. (s = ((3 & t) << 4) | (r >> 4)),
  276. (a = 1 < l ? ((15 & r) << 2) | (n >> 6) : 64),
  277. (o = 2 < l ? 63 & n : 64),
  278. u.push(p.charAt(i) + p.charAt(s) + p.charAt(a) + p.charAt(o));
  279. return u.join("");
  280. }),
  281. (r.decode = function (e) {
  282. var t,
  283. r,
  284. n,
  285. i,
  286. s,
  287. a,
  288. o = 0,
  289. u = 0;
  290. if ("data:" === e.substr(0, "data:".length)) throw new Error("Invalid base64 input, it looks like a data url.");
  291. var h,
  292. f = (3 * (e = e.replace(/[^A-Za-z0-9\+\/\=]/g, "")).length) / 4;
  293. if ((e.charAt(e.length - 1) === p.charAt(64) && f--, e.charAt(e.length - 2) === p.charAt(64) && f--, f % 1 != 0))
  294. throw new Error("Invalid base64 input, bad content length.");
  295. for (h = l.uint8array ? new Uint8Array(0 | f) : new Array(0 | f); o < e.length; )
  296. (t = (p.indexOf(e.charAt(o++)) << 2) | ((i = p.indexOf(e.charAt(o++))) >> 4)),
  297. (r = ((15 & i) << 4) | ((s = p.indexOf(e.charAt(o++))) >> 2)),
  298. (n = ((3 & s) << 6) | (a = p.indexOf(e.charAt(o++)))),
  299. (h[u++] = t),
  300. 64 !== s && (h[u++] = r),
  301. 64 !== a && (h[u++] = n);
  302. return h;
  303. });
  304. },
  305. { "./support": 30, "./utils": 32 },
  306. ],
  307. 2: [
  308. function (e, t, r) {
  309. "use strict";
  310. var n = e("./external"),
  311. i = e("./stream/DataWorker"),
  312. s = e("./stream/Crc32Probe"),
  313. a = e("./stream/DataLengthProbe");
  314. function o(e, t, r, n, i) {
  315. (this.compressedSize = e), (this.uncompressedSize = t), (this.crc32 = r), (this.compression = n), (this.compressedContent = i);
  316. }
  317. (o.prototype = {
  318. getContentWorker: function () {
  319. var e = new i(n.Promise.resolve(this.compressedContent)).pipe(this.compression.uncompressWorker()).pipe(new a("data_length")),
  320. t = this;
  321. return (
  322. e.on("end", function () {
  323. if (this.streamInfo.data_length !== t.uncompressedSize) throw new Error("Bug : uncompressed data size mismatch");
  324. }),
  325. e
  326. );
  327. },
  328. getCompressedWorker: function () {
  329. return new i(n.Promise.resolve(this.compressedContent))
  330. .withStreamInfo("compressedSize", this.compressedSize)
  331. .withStreamInfo("uncompressedSize", this.uncompressedSize)
  332. .withStreamInfo("crc32", this.crc32)
  333. .withStreamInfo("compression", this.compression);
  334. },
  335. }),
  336. (o.createWorkerFrom = function (e, t, r) {
  337. return e
  338. .pipe(new s())
  339. .pipe(new a("uncompressedSize"))
  340. .pipe(t.compressWorker(r))
  341. .pipe(new a("compressedSize"))
  342. .withStreamInfo("compression", t);
  343. }),
  344. (t.exports = o);
  345. },
  346. { "./external": 6, "./stream/Crc32Probe": 25, "./stream/DataLengthProbe": 26, "./stream/DataWorker": 27 },
  347. ],
  348. 3: [
  349. function (e, t, r) {
  350. "use strict";
  351. var n = e("./stream/GenericWorker");
  352. (r.STORE = {
  353. magic: "\0\0",
  354. compressWorker: function (e) {
  355. return new n("STORE compression");
  356. },
  357. uncompressWorker: function () {
  358. return new n("STORE decompression");
  359. },
  360. }),
  361. (r.DEFLATE = e("./flate"));
  362. },
  363. { "./flate": 7, "./stream/GenericWorker": 28 },
  364. ],
  365. 4: [
  366. function (e, t, r) {
  367. "use strict";
  368. var n = e("./utils"),
  369. a = (function () {
  370. for (var e, t = [], r = 0; r < 256; r++) {
  371. e = r;
  372. for (var n = 0; n < 8; n++) e = 1 & e ? 3988292384 ^ (e >>> 1) : e >>> 1;
  373. t[r] = e;
  374. }
  375. return t;
  376. })();
  377. t.exports = function (e, t) {
  378. return void 0 !== e && e.length
  379. ? "string" !== n.getTypeOf(e)
  380. ? (function (e, t, r) {
  381. var n = a,
  382. i = 0 + r;
  383. e ^= -1;
  384. for (var s = 0; s < i; s++) e = (e >>> 8) ^ n[255 & (e ^ t[s])];
  385. return -1 ^ e;
  386. })(0 | t, e, e.length)
  387. : (function (e, t, r) {
  388. var n = a,
  389. i = 0 + r;
  390. e ^= -1;
  391. for (var s = 0; s < i; s++) e = (e >>> 8) ^ n[255 & (e ^ t.charCodeAt(s))];
  392. return -1 ^ e;
  393. })(0 | t, e, e.length)
  394. : 0;
  395. };
  396. },
  397. { "./utils": 32 },
  398. ],
  399. 5: [
  400. function (e, t, r) {
  401. "use strict";
  402. (r.base64 = !1),
  403. (r.binary = !1),
  404. (r.dir = !1),
  405. (r.createFolders = !0),
  406. (r.date = null),
  407. (r.compression = null),
  408. (r.compressionOptions = null),
  409. (r.comment = null),
  410. (r.unixPermissions = null),
  411. (r.dosPermissions = null);
  412. },
  413. {},
  414. ],
  415. 6: [
  416. function (e, t, r) {
  417. "use strict";
  418. var n;
  419. (n = "undefined" != typeof Promise ? Promise : e("lie")), (t.exports = { Promise: n });
  420. },
  421. { lie: 37 },
  422. ],
  423. 7: [
  424. function (e, t, r) {
  425. "use strict";
  426. var n = "undefined" != typeof Uint8Array && "undefined" != typeof Uint16Array && "undefined" != typeof Uint32Array,
  427. i = e("pako"),
  428. s = e("./utils"),
  429. a = e("./stream/GenericWorker"),
  430. o = n ? "uint8array" : "array";
  431. function u(e, t) {
  432. a.call(this, "FlateWorker/" + e), (this._pako = null), (this._pakoAction = e), (this._pakoOptions = t), (this.meta = {});
  433. }
  434. (r.magic = "\b\0"),
  435. s.inherits(u, a),
  436. (u.prototype.processChunk = function (e) {
  437. (this.meta = e.meta), null === this._pako && this._createPako(), this._pako.push(s.transformTo(o, e.data), !1);
  438. }),
  439. (u.prototype.flush = function () {
  440. a.prototype.flush.call(this), null === this._pako && this._createPako(), this._pako.push([], !0);
  441. }),
  442. (u.prototype.cleanUp = function () {
  443. a.prototype.cleanUp.call(this), (this._pako = null);
  444. }),
  445. (u.prototype._createPako = function () {
  446. this._pako = new i[this._pakoAction]({ raw: !0, level: this._pakoOptions.level || -1 });
  447. var t = this;
  448. this._pako.onData = function (e) {
  449. t.push({ data: e, meta: t.meta });
  450. };
  451. }),
  452. (r.compressWorker = function (e) {
  453. return new u("Deflate", e);
  454. }),
  455. (r.uncompressWorker = function () {
  456. return new u("Inflate", {});
  457. });
  458. },
  459. { "./stream/GenericWorker": 28, "./utils": 32, pako: 38 },
  460. ],
  461. 8: [
  462. function (e, t, r) {
  463. "use strict";
  464. function I(e, t) {
  465. var r,
  466. n = "";
  467. for (r = 0; r < t; r++) (n += String.fromCharCode(255 & e)), (e >>>= 8);
  468. return n;
  469. }
  470. function i(e, t, r, n, i, s) {
  471. var a,
  472. o,
  473. u = e.file,
  474. h = e.compression,
  475. f = s !== B.utf8encode,
  476. l = O.transformTo("string", s(u.name)),
  477. d = O.transformTo("string", B.utf8encode(u.name)),
  478. c = u.comment,
  479. p = O.transformTo("string", s(c)),
  480. m = O.transformTo("string", B.utf8encode(c)),
  481. _ = d.length !== u.name.length,
  482. g = m.length !== c.length,
  483. v = "",
  484. b = "",
  485. w = "",
  486. y = u.dir,
  487. k = u.date,
  488. x = { crc32: 0, compressedSize: 0, uncompressedSize: 0 };
  489. (t && !r) || ((x.crc32 = e.crc32), (x.compressedSize = e.compressedSize), (x.uncompressedSize = e.uncompressedSize));
  490. var S = 0;
  491. t && (S |= 8), f || (!_ && !g) || (S |= 2048);
  492. var z,
  493. C = 0,
  494. E = 0;
  495. y && (C |= 16),
  496. "UNIX" === i
  497. ? ((E = 798), (C |= ((z = u.unixPermissions) || (z = y ? 16893 : 33204), (65535 & z) << 16)))
  498. : ((E = 20), (C |= 63 & (u.dosPermissions || 0))),
  499. (a = k.getUTCHours()),
  500. (a <<= 6),
  501. (a |= k.getUTCMinutes()),
  502. (a <<= 5),
  503. (a |= k.getUTCSeconds() / 2),
  504. (o = k.getUTCFullYear() - 1980),
  505. (o <<= 4),
  506. (o |= k.getUTCMonth() + 1),
  507. (o <<= 5),
  508. (o |= k.getUTCDate()),
  509. _ && (v += "up" + I((b = I(1, 1) + I(R(l), 4) + d).length, 2) + b),
  510. g && (v += "uc" + I((w = I(1, 1) + I(R(p), 4) + m).length, 2) + w);
  511. var A = "";
  512. return (
  513. (A += "\n\0"),
  514. (A += I(S, 2)),
  515. (A += h.magic),
  516. (A += I(a, 2)),
  517. (A += I(o, 2)),
  518. (A += I(x.crc32, 4)),
  519. (A += I(x.compressedSize, 4)),
  520. (A += I(x.uncompressedSize, 4)),
  521. (A += I(l.length, 2)),
  522. (A += I(v.length, 2)),
  523. {
  524. fileRecord: T.LOCAL_FILE_HEADER + A + l + v,
  525. 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,
  526. }
  527. );
  528. }
  529. var O = e("../utils"),
  530. s = e("../stream/GenericWorker"),
  531. B = e("../utf8"),
  532. R = e("../crc32"),
  533. T = e("../signature");
  534. function n(e, t, r, n) {
  535. s.call(this, "ZipFileWorker"),
  536. (this.bytesWritten = 0),
  537. (this.zipComment = t),
  538. (this.zipPlatform = r),
  539. (this.encodeFileName = n),
  540. (this.streamFiles = e),
  541. (this.accumulate = !1),
  542. (this.contentBuffer = []),
  543. (this.dirRecords = []),
  544. (this.currentSourceOffset = 0),
  545. (this.entriesCount = 0),
  546. (this.currentFile = null),
  547. (this._sources = []);
  548. }
  549. O.inherits(n, s),
  550. (n.prototype.push = function (e) {
  551. var t = e.meta.percent || 0,
  552. r = this.entriesCount,
  553. n = this._sources.length;
  554. this.accumulate
  555. ? this.contentBuffer.push(e)
  556. : ((this.bytesWritten += e.data.length),
  557. s.prototype.push.call(this, {
  558. data: e.data,
  559. meta: { currentFile: this.currentFile, percent: r ? (t + 100 * (r - n - 1)) / r : 100 },
  560. }));
  561. }),
  562. (n.prototype.openedSource = function (e) {
  563. (this.currentSourceOffset = this.bytesWritten), (this.currentFile = e.file.name);
  564. var t = this.streamFiles && !e.file.dir;
  565. if (t) {
  566. var r = i(e, t, !1, this.currentSourceOffset, this.zipPlatform, this.encodeFileName);
  567. this.push({ data: r.fileRecord, meta: { percent: 0 } });
  568. } else this.accumulate = !0;
  569. }),
  570. (n.prototype.closedSource = function (e) {
  571. this.accumulate = !1;
  572. var t,
  573. r = this.streamFiles && !e.file.dir,
  574. n = i(e, r, !0, this.currentSourceOffset, this.zipPlatform, this.encodeFileName);
  575. if ((this.dirRecords.push(n.dirRecord), r))
  576. this.push({
  577. data: ((t = e), T.DATA_DESCRIPTOR + I(t.crc32, 4) + I(t.compressedSize, 4) + I(t.uncompressedSize, 4)),
  578. meta: { percent: 100 },
  579. });
  580. else
  581. for (this.push({ data: n.fileRecord, meta: { percent: 0 } }); this.contentBuffer.length; )
  582. this.push(this.contentBuffer.shift());
  583. this.currentFile = null;
  584. }),
  585. (n.prototype.flush = function () {
  586. for (var e = this.bytesWritten, t = 0; t < this.dirRecords.length; t++)
  587. this.push({ data: this.dirRecords[t], meta: { percent: 100 } });
  588. var r,
  589. n,
  590. i,
  591. s,
  592. a,
  593. o,
  594. u = this.bytesWritten - e,
  595. h =
  596. ((r = this.dirRecords.length),
  597. (n = u),
  598. (i = e),
  599. (s = this.zipComment),
  600. (a = this.encodeFileName),
  601. (o = O.transformTo("string", a(s))),
  602. 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);
  603. this.push({ data: h, meta: { percent: 100 } });
  604. }),
  605. (n.prototype.prepareNextSource = function () {
  606. (this.previous = this._sources.shift()),
  607. this.openedSource(this.previous.streamInfo),
  608. this.isPaused ? this.previous.pause() : this.previous.resume();
  609. }),
  610. (n.prototype.registerPrevious = function (e) {
  611. this._sources.push(e);
  612. var t = this;
  613. return (
  614. e.on("data", function (e) {
  615. t.processChunk(e);
  616. }),
  617. e.on("end", function () {
  618. t.closedSource(t.previous.streamInfo), t._sources.length ? t.prepareNextSource() : t.end();
  619. }),
  620. e.on("error", function (e) {
  621. t.error(e);
  622. }),
  623. this
  624. );
  625. }),
  626. (n.prototype.resume = function () {
  627. return (
  628. !!s.prototype.resume.call(this) &&
  629. (!this.previous && this._sources.length
  630. ? (this.prepareNextSource(), !0)
  631. : this.previous || this._sources.length || this.generatedError
  632. ? void 0
  633. : (this.end(), !0))
  634. );
  635. }),
  636. (n.prototype.error = function (e) {
  637. var t = this._sources;
  638. if (!s.prototype.error.call(this, e)) return !1;
  639. for (var r = 0; r < t.length; r++)
  640. try {
  641. t[r].error(e);
  642. } catch (e) {}
  643. return !0;
  644. }),
  645. (n.prototype.lock = function () {
  646. s.prototype.lock.call(this);
  647. for (var e = this._sources, t = 0; t < e.length; t++) e[t].lock();
  648. }),
  649. (t.exports = n);
  650. },
  651. { "../crc32": 4, "../signature": 23, "../stream/GenericWorker": 28, "../utf8": 31, "../utils": 32 },
  652. ],
  653. 9: [
  654. function (e, t, r) {
  655. "use strict";
  656. var h = e("../compressions"),
  657. n = e("./ZipFileWorker");
  658. r.generateWorker = function (e, a, t) {
  659. var o = new n(a.streamFiles, t, a.platform, a.encodeFileName),
  660. u = 0;
  661. try {
  662. e.forEach(function (e, t) {
  663. u++;
  664. var r = (function (e, t) {
  665. var r = e || t,
  666. n = h[r];
  667. if (!n) throw new Error(r + " is not a valid compression method !");
  668. return n;
  669. })(t.options.compression, a.compression),
  670. n = t.options.compressionOptions || a.compressionOptions || {},
  671. i = t.dir,
  672. s = t.date;
  673. t._compressWorker(r, n)
  674. .withStreamInfo("file", {
  675. name: e,
  676. dir: i,
  677. date: s,
  678. comment: t.comment || "",
  679. unixPermissions: t.unixPermissions,
  680. dosPermissions: t.dosPermissions,
  681. })
  682. .pipe(o);
  683. }),
  684. (o.entriesCount = u);
  685. } catch (e) {
  686. o.error(e);
  687. }
  688. return o;
  689. };
  690. },
  691. { "../compressions": 3, "./ZipFileWorker": 8 },
  692. ],
  693. 10: [
  694. function (e, t, r) {
  695. "use strict";
  696. function n() {
  697. if (!(this instanceof n)) return new n();
  698. if (arguments.length)
  699. throw new Error("The constructor with parameters has been removed in JSZip 3.0, please check the upgrade guide.");
  700. (this.files = {}),
  701. (this.comment = null),
  702. (this.root = ""),
  703. (this.clone = function () {
  704. var e = new n();
  705. for (var t in this) "function" != typeof this[t] && (e[t] = this[t]);
  706. return e;
  707. });
  708. }
  709. ((n.prototype = e("./object")).loadAsync = e("./load")),
  710. (n.support = e("./support")),
  711. (n.defaults = e("./defaults")),
  712. (n.version = "3.5.0"),
  713. (n.loadAsync = function (e, t) {
  714. return new n().loadAsync(e, t);
  715. }),
  716. (n.external = e("./external")),
  717. (t.exports = n);
  718. },
  719. { "./defaults": 5, "./external": 6, "./load": 11, "./object": 15, "./support": 30 },
  720. ],
  721. 11: [
  722. function (e, t, r) {
  723. "use strict";
  724. var n = e("./utils"),
  725. i = e("./external"),
  726. o = e("./utf8"),
  727. u = e("./zipEntries"),
  728. s = e("./stream/Crc32Probe"),
  729. h = e("./nodejsUtils");
  730. function f(n) {
  731. return new i.Promise(function (e, t) {
  732. var r = n.decompressed.getContentWorker().pipe(new s());
  733. r.on("error", function (e) {
  734. t(e);
  735. })
  736. .on("end", function () {
  737. r.streamInfo.crc32 !== n.decompressed.crc32 ? t(new Error("Corrupted zip : CRC32 mismatch")) : e();
  738. })
  739. .resume();
  740. });
  741. }
  742. t.exports = function (e, s) {
  743. var a = this;
  744. return (
  745. (s = n.extend(s || {}, {
  746. base64: !1,
  747. checkCRC32: !1,
  748. optimizedBinaryString: !1,
  749. createFolders: !1,
  750. decodeFileName: o.utf8decode,
  751. })),
  752. h.isNode && h.isStream(e)
  753. ? i.Promise.reject(new Error("JSZip can't accept a stream when loading a zip file."))
  754. : n
  755. .prepareContent("the loaded zip file", e, !0, s.optimizedBinaryString, s.base64)
  756. .then(function (e) {
  757. var t = new u(s);
  758. return t.load(e), t;
  759. })
  760. .then(function (e) {
  761. var t = [i.Promise.resolve(e)],
  762. r = e.files;
  763. if (s.checkCRC32) for (var n = 0; n < r.length; n++) t.push(f(r[n]));
  764. return i.Promise.all(t);
  765. })
  766. .then(function (e) {
  767. for (var t = e.shift(), r = t.files, n = 0; n < r.length; n++) {
  768. var i = r[n];
  769. a.file(i.fileNameStr, i.decompressed, {
  770. binary: !0,
  771. optimizedBinaryString: !0,
  772. date: i.date,
  773. dir: i.dir,
  774. comment: i.fileCommentStr.length ? i.fileCommentStr : null,
  775. unixPermissions: i.unixPermissions,
  776. dosPermissions: i.dosPermissions,
  777. createFolders: s.createFolders,
  778. });
  779. }
  780. return t.zipComment.length && (a.comment = t.zipComment), a;
  781. })
  782. );
  783. };
  784. },
  785. { "./external": 6, "./nodejsUtils": 14, "./stream/Crc32Probe": 25, "./utf8": 31, "./utils": 32, "./zipEntries": 33 },
  786. ],
  787. 12: [
  788. function (e, t, r) {
  789. "use strict";
  790. var n = e("../utils"),
  791. i = e("../stream/GenericWorker");
  792. function s(e, t) {
  793. i.call(this, "Nodejs stream input adapter for " + e), (this._upstreamEnded = !1), this._bindStream(t);
  794. }
  795. n.inherits(s, i),
  796. (s.prototype._bindStream = function (e) {
  797. var t = this;
  798. (this._stream = e).pause(),
  799. e
  800. .on("data", function (e) {
  801. t.push({ data: e, meta: { percent: 0 } });
  802. })
  803. .on("error", function (e) {
  804. t.isPaused ? (this.generatedError = e) : t.error(e);
  805. })
  806. .on("end", function () {
  807. t.isPaused ? (t._upstreamEnded = !0) : t.end();
  808. });
  809. }),
  810. (s.prototype.pause = function () {
  811. return !!i.prototype.pause.call(this) && (this._stream.pause(), !0);
  812. }),
  813. (s.prototype.resume = function () {
  814. return !!i.prototype.resume.call(this) && (this._upstreamEnded ? this.end() : this._stream.resume(), !0);
  815. }),
  816. (t.exports = s);
  817. },
  818. { "../stream/GenericWorker": 28, "../utils": 32 },
  819. ],
  820. 13: [
  821. function (e, t, r) {
  822. "use strict";
  823. var i = e("readable-stream").Readable;
  824. function n(e, t, r) {
  825. i.call(this, t), (this._helper = e);
  826. var n = this;
  827. e.on("data", function (e, t) {
  828. n.push(e) || n._helper.pause(), r && r(t);
  829. })
  830. .on("error", function (e) {
  831. n.emit("error", e);
  832. })
  833. .on("end", function () {
  834. n.push(null);
  835. });
  836. }
  837. e("../utils").inherits(n, i),
  838. (n.prototype._read = function () {
  839. this._helper.resume();
  840. }),
  841. (t.exports = n);
  842. },
  843. { "../utils": 32, "readable-stream": 16 },
  844. ],
  845. 14: [
  846. function (e, t, r) {
  847. "use strict";
  848. t.exports = {
  849. isNode: "undefined" != typeof Buffer,
  850. newBufferFrom: function (e, t) {
  851. if (Buffer.from && Buffer.from !== Uint8Array.from) return Buffer.from(e, t);
  852. if ("number" == typeof e) throw new Error('The "data" argument must not be a number');
  853. return new Buffer(e, t);
  854. },
  855. allocBuffer: function (e) {
  856. if (Buffer.alloc) return Buffer.alloc(e);
  857. var t = new Buffer(e);
  858. return t.fill(0), t;
  859. },
  860. isBuffer: function (e) {
  861. return Buffer.isBuffer(e);
  862. },
  863. isStream: function (e) {
  864. return e && "function" == typeof e.on && "function" == typeof e.pause && "function" == typeof e.resume;
  865. },
  866. };
  867. },
  868. {},
  869. ],
  870. 15: [
  871. function (e, t, r) {
  872. "use strict";
  873. function s(e, t, r) {
  874. var n,
  875. i = f.getTypeOf(t),
  876. s = f.extend(r || {}, d);
  877. (s.date = s.date || new Date()),
  878. null !== s.compression && (s.compression = s.compression.toUpperCase()),
  879. "string" == typeof s.unixPermissions && (s.unixPermissions = parseInt(s.unixPermissions, 8)),
  880. s.unixPermissions && 16384 & s.unixPermissions && (s.dir = !0),
  881. s.dosPermissions && 16 & s.dosPermissions && (s.dir = !0),
  882. s.dir && (e = h(e)),
  883. s.createFolders &&
  884. (n = (function (e) {
  885. "/" === e.slice(-1) && (e = e.substring(0, e.length - 1));
  886. var t = e.lastIndexOf("/");
  887. return 0 < t ? e.substring(0, t) : "";
  888. })(e)) &&
  889. g.call(this, n, !0);
  890. var a,
  891. o = "string" === i && !1 === s.binary && !1 === s.base64;
  892. (r && void 0 !== r.binary) || (s.binary = !o),
  893. ((t instanceof c && 0 === t.uncompressedSize) || s.dir || !t || 0 === t.length) &&
  894. ((s.base64 = !1), (s.binary = !0), (t = ""), (s.compression = "STORE"), (i = "string")),
  895. (a =
  896. t instanceof c || t instanceof l
  897. ? t
  898. : m.isNode && m.isStream(t)
  899. ? new _(e, t)
  900. : f.prepareContent(e, t, s.binary, s.optimizedBinaryString, s.base64));
  901. var u = new p(e, a, s);
  902. this.files[e] = u;
  903. }
  904. function h(e) {
  905. return "/" !== e.slice(-1) && (e += "/"), e;
  906. }
  907. var i = e("./utf8"),
  908. f = e("./utils"),
  909. l = e("./stream/GenericWorker"),
  910. a = e("./stream/StreamHelper"),
  911. d = e("./defaults"),
  912. c = e("./compressedObject"),
  913. p = e("./zipObject"),
  914. o = e("./generate"),
  915. m = e("./nodejsUtils"),
  916. _ = e("./nodejs/NodejsStreamInputAdapter"),
  917. g = function (e, t) {
  918. return (
  919. (t = void 0 !== t ? t : d.createFolders),
  920. (e = h(e)),
  921. this.files[e] || s.call(this, e, null, { dir: !0, createFolders: t }),
  922. this.files[e]
  923. );
  924. };
  925. function u(e) {
  926. return "[object RegExp]" === Object.prototype.toString.call(e);
  927. }
  928. var n = {
  929. load: function () {
  930. throw new Error("This method has been removed in JSZip 3.0, please check the upgrade guide.");
  931. },
  932. forEach: function (e) {
  933. var t, r, n;
  934. for (t in this.files)
  935. this.files.hasOwnProperty(t) &&
  936. ((n = this.files[t]), (r = t.slice(this.root.length, t.length)) && t.slice(0, this.root.length) === this.root && e(r, n));
  937. },
  938. filter: function (r) {
  939. var n = [];
  940. return (
  941. this.forEach(function (e, t) {
  942. r(e, t) && n.push(t);
  943. }),
  944. n
  945. );
  946. },
  947. file: function (e, t, r) {
  948. if (1 !== arguments.length) return (e = this.root + e), s.call(this, e, t, r), this;
  949. if (u(e)) {
  950. var n = e;
  951. return this.filter(function (e, t) {
  952. return !t.dir && n.test(e);
  953. });
  954. }
  955. var i = this.files[this.root + e];
  956. return i && !i.dir ? i : null;
  957. },
  958. folder: function (r) {
  959. if (!r) return this;
  960. if (u(r))
  961. return this.filter(function (e, t) {
  962. return t.dir && r.test(e);
  963. });
  964. var e = this.root + r,
  965. t = g.call(this, e),
  966. n = this.clone();
  967. return (n.root = t.name), n;
  968. },
  969. remove: function (r) {
  970. r = this.root + r;
  971. var e = this.files[r];
  972. if ((e || ("/" !== r.slice(-1) && (r += "/"), (e = this.files[r])), e && !e.dir)) delete this.files[r];
  973. else
  974. for (
  975. var t = this.filter(function (e, t) {
  976. return t.name.slice(0, r.length) === r;
  977. }),
  978. n = 0;
  979. n < t.length;
  980. n++
  981. )
  982. delete this.files[t[n].name];
  983. return this;
  984. },
  985. generate: function (e) {
  986. throw new Error("This method has been removed in JSZip 3.0, please check the upgrade guide.");
  987. },
  988. generateInternalStream: function (e) {
  989. var t,
  990. r = {};
  991. try {
  992. if (
  993. (((r = f.extend(e || {}, {
  994. streamFiles: !1,
  995. compression: "STORE",
  996. compressionOptions: null,
  997. type: "",
  998. platform: "DOS",
  999. comment: null,
  1000. mimeType: "application/zip",
  1001. encodeFileName: i.utf8encode,
  1002. })).type = r.type.toLowerCase()),
  1003. (r.compression = r.compression.toUpperCase()),
  1004. "binarystring" === r.type && (r.type = "string"),
  1005. !r.type)
  1006. )
  1007. throw new Error("No output type specified.");
  1008. f.checkSupport(r.type),
  1009. ("darwin" !== r.platform && "freebsd" !== r.platform && "linux" !== r.platform && "sunos" !== r.platform) ||
  1010. (r.platform = "UNIX"),
  1011. "win32" === r.platform && (r.platform = "DOS");
  1012. var n = r.comment || this.comment || "";
  1013. t = o.generateWorker(this, r, n);
  1014. } catch (e) {
  1015. (t = new l("error")).error(e);
  1016. }
  1017. return new a(t, r.type || "string", r.mimeType);
  1018. },
  1019. generateAsync: function (e, t) {
  1020. return this.generateInternalStream(e).accumulate(t);
  1021. },
  1022. generateNodeStream: function (e, t) {
  1023. return (e = e || {}).type || (e.type = "nodebuffer"), this.generateInternalStream(e).toNodejsStream(t);
  1024. },
  1025. };
  1026. t.exports = n;
  1027. },
  1028. {
  1029. "./compressedObject": 2,
  1030. "./defaults": 5,
  1031. "./generate": 9,
  1032. "./nodejs/NodejsStreamInputAdapter": 12,
  1033. "./nodejsUtils": 14,
  1034. "./stream/GenericWorker": 28,
  1035. "./stream/StreamHelper": 29,
  1036. "./utf8": 31,
  1037. "./utils": 32,
  1038. "./zipObject": 35,
  1039. },
  1040. ],
  1041. 16: [
  1042. function (e, t, r) {
  1043. t.exports = e("stream");
  1044. },
  1045. { stream: void 0 },
  1046. ],
  1047. 17: [
  1048. function (e, t, r) {
  1049. "use strict";
  1050. var n = e("./DataReader");
  1051. function i(e) {
  1052. n.call(this, e);
  1053. for (var t = 0; t < this.data.length; t++) e[t] = 255 & e[t];
  1054. }
  1055. e("../utils").inherits(i, n),
  1056. (i.prototype.byteAt = function (e) {
  1057. return this.data[this.zero + e];
  1058. }),
  1059. (i.prototype.lastIndexOfSignature = function (e) {
  1060. 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)
  1061. if (this.data[s] === t && this.data[s + 1] === r && this.data[s + 2] === n && this.data[s + 3] === i) return s - this.zero;
  1062. return -1;
  1063. }),
  1064. (i.prototype.readAndCheckSignature = function (e) {
  1065. var t = e.charCodeAt(0),
  1066. r = e.charCodeAt(1),
  1067. n = e.charCodeAt(2),
  1068. i = e.charCodeAt(3),
  1069. s = this.readData(4);
  1070. return t === s[0] && r === s[1] && n === s[2] && i === s[3];
  1071. }),
  1072. (i.prototype.readData = function (e) {
  1073. if ((this.checkOffset(e), 0 === e)) return [];
  1074. var t = this.data.slice(this.zero + this.index, this.zero + this.index + e);
  1075. return (this.index += e), t;
  1076. }),
  1077. (t.exports = i);
  1078. },
  1079. { "../utils": 32, "./DataReader": 18 },
  1080. ],
  1081. 18: [
  1082. function (e, t, r) {
  1083. "use strict";
  1084. var n = e("../utils");
  1085. function i(e) {
  1086. (this.data = e), (this.length = e.length), (this.index = 0), (this.zero = 0);
  1087. }
  1088. (i.prototype = {
  1089. checkOffset: function (e) {
  1090. this.checkIndex(this.index + e);
  1091. },
  1092. checkIndex: function (e) {
  1093. if (this.length < this.zero + e || e < 0)
  1094. throw new Error("End of data reached (data length = " + this.length + ", asked index = " + e + "). Corrupted zip ?");
  1095. },
  1096. setIndex: function (e) {
  1097. this.checkIndex(e), (this.index = e);
  1098. },
  1099. skip: function (e) {
  1100. this.setIndex(this.index + e);
  1101. },
  1102. byteAt: function (e) {},
  1103. readInt: function (e) {
  1104. var t,
  1105. r = 0;
  1106. for (this.checkOffset(e), t = this.index + e - 1; t >= this.index; t--) r = (r << 8) + this.byteAt(t);
  1107. return (this.index += e), r;
  1108. },
  1109. readString: function (e) {
  1110. return n.transformTo("string", this.readData(e));
  1111. },
  1112. readData: function (e) {},
  1113. lastIndexOfSignature: function (e) {},
  1114. readAndCheckSignature: function (e) {},
  1115. readDate: function () {
  1116. var e = this.readInt(4);
  1117. return new Date(
  1118. Date.UTC(1980 + ((e >> 25) & 127), ((e >> 21) & 15) - 1, (e >> 16) & 31, (e >> 11) & 31, (e >> 5) & 63, (31 & e) << 1)
  1119. );
  1120. },
  1121. }),
  1122. (t.exports = i);
  1123. },
  1124. { "../utils": 32 },
  1125. ],
  1126. 19: [
  1127. function (e, t, r) {
  1128. "use strict";
  1129. var n = e("./Uint8ArrayReader");
  1130. function i(e) {
  1131. n.call(this, e);
  1132. }
  1133. e("../utils").inherits(i, n),
  1134. (i.prototype.readData = function (e) {
  1135. this.checkOffset(e);
  1136. var t = this.data.slice(this.zero + this.index, this.zero + this.index + e);
  1137. return (this.index += e), t;
  1138. }),
  1139. (t.exports = i);
  1140. },
  1141. { "../utils": 32, "./Uint8ArrayReader": 21 },
  1142. ],
  1143. 20: [
  1144. function (e, t, r) {
  1145. "use strict";
  1146. var n = e("./DataReader");
  1147. function i(e) {
  1148. n.call(this, e);
  1149. }
  1150. e("../utils").inherits(i, n),
  1151. (i.prototype.byteAt = function (e) {
  1152. return this.data.charCodeAt(this.zero + e);
  1153. }),
  1154. (i.prototype.lastIndexOfSignature = function (e) {
  1155. return this.data.lastIndexOf(e) - this.zero;
  1156. }),
  1157. (i.prototype.readAndCheckSignature = function (e) {
  1158. return e === this.readData(4);
  1159. }),
  1160. (i.prototype.readData = function (e) {
  1161. this.checkOffset(e);
  1162. var t = this.data.slice(this.zero + this.index, this.zero + this.index + e);
  1163. return (this.index += e), t;
  1164. }),
  1165. (t.exports = i);
  1166. },
  1167. { "../utils": 32, "./DataReader": 18 },
  1168. ],
  1169. 21: [
  1170. function (e, t, r) {
  1171. "use strict";
  1172. var n = e("./ArrayReader");
  1173. function i(e) {
  1174. n.call(this, e);
  1175. }
  1176. e("../utils").inherits(i, n),
  1177. (i.prototype.readData = function (e) {
  1178. if ((this.checkOffset(e), 0 === e)) return new Uint8Array(0);
  1179. var t = this.data.subarray(this.zero + this.index, this.zero + this.index + e);
  1180. return (this.index += e), t;
  1181. }),
  1182. (t.exports = i);
  1183. },
  1184. { "../utils": 32, "./ArrayReader": 17 },
  1185. ],
  1186. 22: [
  1187. function (e, t, r) {
  1188. "use strict";
  1189. var n = e("../utils"),
  1190. i = e("../support"),
  1191. s = e("./ArrayReader"),
  1192. a = e("./StringReader"),
  1193. o = e("./NodeBufferReader"),
  1194. u = e("./Uint8ArrayReader");
  1195. t.exports = function (e) {
  1196. var t = n.getTypeOf(e);
  1197. return (
  1198. n.checkSupport(t),
  1199. "string" !== t || i.uint8array
  1200. ? "nodebuffer" === t
  1201. ? new o(e)
  1202. : i.uint8array
  1203. ? new u(n.transformTo("uint8array", e))
  1204. : new s(n.transformTo("array", e))
  1205. : new a(e)
  1206. );
  1207. };
  1208. },
  1209. { "../support": 30, "../utils": 32, "./ArrayReader": 17, "./NodeBufferReader": 19, "./StringReader": 20, "./Uint8ArrayReader": 21 },
  1210. ],
  1211. 23: [
  1212. function (e, t, r) {
  1213. "use strict";
  1214. (r.LOCAL_FILE_HEADER = "PK"),
  1215. (r.CENTRAL_FILE_HEADER = "PK"),
  1216. (r.CENTRAL_DIRECTORY_END = "PK"),
  1217. (r.ZIP64_CENTRAL_DIRECTORY_LOCATOR = "PK"),
  1218. (r.ZIP64_CENTRAL_DIRECTORY_END = "PK"),
  1219. (r.DATA_DESCRIPTOR = "PK\b");
  1220. },
  1221. {},
  1222. ],
  1223. 24: [
  1224. function (e, t, r) {
  1225. "use strict";
  1226. var n = e("./GenericWorker"),
  1227. i = e("../utils");
  1228. function s(e) {
  1229. n.call(this, "ConvertWorker to " + e), (this.destType = e);
  1230. }
  1231. i.inherits(s, n),
  1232. (s.prototype.processChunk = function (e) {
  1233. this.push({ data: i.transformTo(this.destType, e.data), meta: e.meta });
  1234. }),
  1235. (t.exports = s);
  1236. },
  1237. { "../utils": 32, "./GenericWorker": 28 },
  1238. ],
  1239. 25: [
  1240. function (e, t, r) {
  1241. "use strict";
  1242. var n = e("./GenericWorker"),
  1243. i = e("../crc32");
  1244. function s() {
  1245. n.call(this, "Crc32Probe"), this.withStreamInfo("crc32", 0);
  1246. }
  1247. e("../utils").inherits(s, n),
  1248. (s.prototype.processChunk = function (e) {
  1249. (this.streamInfo.crc32 = i(e.data, this.streamInfo.crc32 || 0)), this.push(e);
  1250. }),
  1251. (t.exports = s);
  1252. },
  1253. { "../crc32": 4, "../utils": 32, "./GenericWorker": 28 },
  1254. ],
  1255. 26: [
  1256. function (e, t, r) {
  1257. "use strict";
  1258. var n = e("../utils"),
  1259. i = e("./GenericWorker");
  1260. function s(e) {
  1261. i.call(this, "DataLengthProbe for " + e), (this.propName = e), this.withStreamInfo(e, 0);
  1262. }
  1263. n.inherits(s, i),
  1264. (s.prototype.processChunk = function (e) {
  1265. if (e) {
  1266. var t = this.streamInfo[this.propName] || 0;
  1267. this.streamInfo[this.propName] = t + e.data.length;
  1268. }
  1269. i.prototype.processChunk.call(this, e);
  1270. }),
  1271. (t.exports = s);
  1272. },
  1273. { "../utils": 32, "./GenericWorker": 28 },
  1274. ],
  1275. 27: [
  1276. function (e, t, r) {
  1277. "use strict";
  1278. var n = e("../utils"),
  1279. i = e("./GenericWorker");
  1280. function s(e) {
  1281. i.call(this, "DataWorker");
  1282. var t = this;
  1283. (this.dataIsReady = !1),
  1284. (this.index = 0),
  1285. (this.max = 0),
  1286. (this.data = null),
  1287. (this.type = ""),
  1288. (this._tickScheduled = !1),
  1289. e.then(
  1290. function (e) {
  1291. (t.dataIsReady = !0),
  1292. (t.data = e),
  1293. (t.max = (e && e.length) || 0),
  1294. (t.type = n.getTypeOf(e)),
  1295. t.isPaused || t._tickAndRepeat();
  1296. },
  1297. function (e) {
  1298. t.error(e);
  1299. }
  1300. );
  1301. }
  1302. n.inherits(s, i),
  1303. (s.prototype.cleanUp = function () {
  1304. i.prototype.cleanUp.call(this), (this.data = null);
  1305. }),
  1306. (s.prototype.resume = function () {
  1307. return (
  1308. !!i.prototype.resume.call(this) &&
  1309. (!this._tickScheduled && this.dataIsReady && ((this._tickScheduled = !0), n.delay(this._tickAndRepeat, [], this)), !0)
  1310. );
  1311. }),
  1312. (s.prototype._tickAndRepeat = function () {
  1313. (this._tickScheduled = !1),
  1314. this.isPaused ||
  1315. this.isFinished ||
  1316. (this._tick(), this.isFinished || (n.delay(this._tickAndRepeat, [], this), (this._tickScheduled = !0)));
  1317. }),
  1318. (s.prototype._tick = function () {
  1319. if (this.isPaused || this.isFinished) return !1;
  1320. var e = null,
  1321. t = Math.min(this.max, this.index + 16384);
  1322. if (this.index >= this.max) return this.end();
  1323. switch (this.type) {
  1324. case "string":
  1325. e = this.data.substring(this.index, t);
  1326. break;
  1327. case "uint8array":
  1328. e = this.data.subarray(this.index, t);
  1329. break;
  1330. case "array":
  1331. case "nodebuffer":
  1332. e = this.data.slice(this.index, t);
  1333. }
  1334. return (this.index = t), this.push({ data: e, meta: { percent: this.max ? (this.index / this.max) * 100 : 0 } });
  1335. }),
  1336. (t.exports = s);
  1337. },
  1338. { "../utils": 32, "./GenericWorker": 28 },
  1339. ],
  1340. 28: [
  1341. function (e, t, r) {
  1342. "use strict";
  1343. function n(e) {
  1344. (this.name = e || "default"),
  1345. (this.streamInfo = {}),
  1346. (this.generatedError = null),
  1347. (this.extraStreamInfo = {}),
  1348. (this.isPaused = !0),
  1349. (this.isFinished = !1),
  1350. (this.isLocked = !1),
  1351. (this._listeners = { data: [], end: [], error: [] }),
  1352. (this.previous = null);
  1353. }
  1354. (n.prototype = {
  1355. push: function (e) {
  1356. this.emit("data", e);
  1357. },
  1358. end: function () {
  1359. if (this.isFinished) return !1;
  1360. this.flush();
  1361. try {
  1362. this.emit("end"), this.cleanUp(), (this.isFinished = !0);
  1363. } catch (e) {
  1364. this.emit("error", e);
  1365. }
  1366. return !0;
  1367. },
  1368. error: function (e) {
  1369. return (
  1370. !this.isFinished &&
  1371. (this.isPaused
  1372. ? (this.generatedError = e)
  1373. : ((this.isFinished = !0), this.emit("error", e), this.previous && this.previous.error(e), this.cleanUp()),
  1374. !0)
  1375. );
  1376. },
  1377. on: function (e, t) {
  1378. return this._listeners[e].push(t), this;
  1379. },
  1380. cleanUp: function () {
  1381. (this.streamInfo = this.generatedError = this.extraStreamInfo = null), (this._listeners = []);
  1382. },
  1383. emit: function (e, t) {
  1384. if (this._listeners[e]) for (var r = 0; r < this._listeners[e].length; r++) this._listeners[e][r].call(this, t);
  1385. },
  1386. pipe: function (e) {
  1387. return e.registerPrevious(this);
  1388. },
  1389. registerPrevious: function (e) {
  1390. if (this.isLocked) throw new Error("The stream '" + this + "' has already been used.");
  1391. (this.streamInfo = e.streamInfo), this.mergeStreamInfo(), (this.previous = e);
  1392. var t = this;
  1393. return (
  1394. e.on("data", function (e) {
  1395. t.processChunk(e);
  1396. }),
  1397. e.on("end", function () {
  1398. t.end();
  1399. }),
  1400. e.on("error", function (e) {
  1401. t.error(e);
  1402. }),
  1403. this
  1404. );
  1405. },
  1406. pause: function () {
  1407. return !this.isPaused && !this.isFinished && ((this.isPaused = !0), this.previous && this.previous.pause(), !0);
  1408. },
  1409. resume: function () {
  1410. if (!this.isPaused || this.isFinished) return !1;
  1411. var e = (this.isPaused = !1);
  1412. return this.generatedError && (this.error(this.generatedError), (e = !0)), this.previous && this.previous.resume(), !e;
  1413. },
  1414. flush: function () {},
  1415. processChunk: function (e) {
  1416. this.push(e);
  1417. },
  1418. withStreamInfo: function (e, t) {
  1419. return (this.extraStreamInfo[e] = t), this.mergeStreamInfo(), this;
  1420. },
  1421. mergeStreamInfo: function () {
  1422. for (var e in this.extraStreamInfo) this.extraStreamInfo.hasOwnProperty(e) && (this.streamInfo[e] = this.extraStreamInfo[e]);
  1423. },
  1424. lock: function () {
  1425. if (this.isLocked) throw new Error("The stream '" + this + "' has already been used.");
  1426. (this.isLocked = !0), this.previous && this.previous.lock();
  1427. },
  1428. toString: function () {
  1429. var e = "Worker " + this.name;
  1430. return this.previous ? this.previous + " -> " + e : e;
  1431. },
  1432. }),
  1433. (t.exports = n);
  1434. },
  1435. {},
  1436. ],
  1437. 29: [
  1438. function (e, t, r) {
  1439. "use strict";
  1440. var h = e("../utils"),
  1441. i = e("./ConvertWorker"),
  1442. s = e("./GenericWorker"),
  1443. f = e("../base64"),
  1444. n = e("../support"),
  1445. a = e("../external"),
  1446. o = null;
  1447. if (n.nodestream)
  1448. try {
  1449. o = e("../nodejs/NodejsStreamOutputAdapter");
  1450. } catch (e) {}
  1451. function u(e, t, r) {
  1452. var n = t;
  1453. switch (t) {
  1454. case "blob":
  1455. case "arraybuffer":
  1456. n = "uint8array";
  1457. break;
  1458. case "base64":
  1459. n = "string";
  1460. }
  1461. try {
  1462. (this._internalType = n),
  1463. (this._outputType = t),
  1464. (this._mimeType = r),
  1465. h.checkSupport(n),
  1466. (this._worker = e.pipe(new i(n))),
  1467. e.lock();
  1468. } catch (e) {
  1469. (this._worker = new s("error")), this._worker.error(e);
  1470. }
  1471. }
  1472. (u.prototype = {
  1473. accumulate: function (e) {
  1474. return (
  1475. (o = this),
  1476. (u = e),
  1477. new a.Promise(function (t, r) {
  1478. var n = [],
  1479. i = o._internalType,
  1480. s = o._outputType,
  1481. a = o._mimeType;
  1482. o.on("data", function (e, t) {
  1483. n.push(e), u && u(t);
  1484. })
  1485. .on("error", function (e) {
  1486. (n = []), r(e);
  1487. })
  1488. .on("end", function () {
  1489. try {
  1490. var e = (function (e, t, r) {
  1491. switch (e) {
  1492. case "blob":
  1493. return h.newBlob(h.transformTo("arraybuffer", t), r);
  1494. case "base64":
  1495. return f.encode(t);
  1496. default:
  1497. return h.transformTo(e, t);
  1498. }
  1499. })(
  1500. s,
  1501. (function (e, t) {
  1502. var r,
  1503. n = 0,
  1504. i = null,
  1505. s = 0;
  1506. for (r = 0; r < t.length; r++) s += t[r].length;
  1507. switch (e) {
  1508. case "string":
  1509. return t.join("");
  1510. case "array":
  1511. return Array.prototype.concat.apply([], t);
  1512. case "uint8array":
  1513. for (i = new Uint8Array(s), r = 0; r < t.length; r++) i.set(t[r], n), (n += t[r].length);
  1514. return i;
  1515. case "nodebuffer":
  1516. return Buffer.concat(t);
  1517. default:
  1518. throw new Error("concat : unsupported type '" + e + "'");
  1519. }
  1520. })(i, n),
  1521. a
  1522. );
  1523. t(e);
  1524. } catch (e) {
  1525. r(e);
  1526. }
  1527. n = [];
  1528. })
  1529. .resume();
  1530. })
  1531. );
  1532. var o, u;
  1533. },
  1534. on: function (e, t) {
  1535. var r = this;
  1536. return (
  1537. "data" === e
  1538. ? this._worker.on(e, function (e) {
  1539. t.call(r, e.data, e.meta);
  1540. })
  1541. : this._worker.on(e, function () {
  1542. h.delay(t, arguments, r);
  1543. }),
  1544. this
  1545. );
  1546. },
  1547. resume: function () {
  1548. return h.delay(this._worker.resume, [], this._worker), this;
  1549. },
  1550. pause: function () {
  1551. return this._worker.pause(), this;
  1552. },
  1553. toNodejsStream: function (e) {
  1554. if ((h.checkSupport("nodestream"), "nodebuffer" !== this._outputType))
  1555. throw new Error(this._outputType + " is not supported by this method");
  1556. return new o(this, { objectMode: "nodebuffer" !== this._outputType }, e);
  1557. },
  1558. }),
  1559. (t.exports = u);
  1560. },
  1561. {
  1562. "../base64": 1,
  1563. "../external": 6,
  1564. "../nodejs/NodejsStreamOutputAdapter": 13,
  1565. "../support": 30,
  1566. "../utils": 32,
  1567. "./ConvertWorker": 24,
  1568. "./GenericWorker": 28,
  1569. },
  1570. ],
  1571. 30: [
  1572. function (e, t, r) {
  1573. "use strict";
  1574. if (
  1575. ((r.base64 = !0),
  1576. (r.array = !0),
  1577. (r.string = !0),
  1578. (r.arraybuffer = "undefined" != typeof ArrayBuffer && "undefined" != typeof Uint8Array),
  1579. (r.nodebuffer = "undefined" != typeof Buffer),
  1580. (r.uint8array = "undefined" != typeof Uint8Array),
  1581. "undefined" == typeof ArrayBuffer)
  1582. )
  1583. r.blob = !1;
  1584. else {
  1585. var n = new ArrayBuffer(0);
  1586. try {
  1587. r.blob = 0 === new Blob([n], { type: "application/zip" }).size;
  1588. } catch (e) {
  1589. try {
  1590. var i = new (self.BlobBuilder || self.WebKitBlobBuilder || self.MozBlobBuilder || self.MSBlobBuilder)();
  1591. i.append(n), (r.blob = 0 === i.getBlob("application/zip").size);
  1592. } catch (e) {
  1593. r.blob = !1;
  1594. }
  1595. }
  1596. }
  1597. try {
  1598. r.nodestream = !!e("readable-stream").Readable;
  1599. } catch (e) {
  1600. r.nodestream = !1;
  1601. }
  1602. },
  1603. { "readable-stream": 16 },
  1604. ],
  1605. 31: [
  1606. function (e, t, s) {
  1607. "use strict";
  1608. for (
  1609. var o = e("./utils"), u = e("./support"), r = e("./nodejsUtils"), n = e("./stream/GenericWorker"), h = new Array(256), i = 0;
  1610. i < 256;
  1611. i++
  1612. )
  1613. h[i] = 252 <= i ? 6 : 248 <= i ? 5 : 240 <= i ? 4 : 224 <= i ? 3 : 192 <= i ? 2 : 1;
  1614. function a() {
  1615. n.call(this, "utf-8 decode"), (this.leftOver = null);
  1616. }
  1617. function f() {
  1618. n.call(this, "utf-8 encode");
  1619. }
  1620. (h[254] = h[254] = 1),
  1621. (s.utf8encode = function (e) {
  1622. return u.nodebuffer
  1623. ? r.newBufferFrom(e, "utf-8")
  1624. : (function (e) {
  1625. var t,
  1626. r,
  1627. n,
  1628. i,
  1629. s,
  1630. a = e.length,
  1631. o = 0;
  1632. for (i = 0; i < a; i++)
  1633. 55296 == (64512 & (r = e.charCodeAt(i))) &&
  1634. i + 1 < a &&
  1635. 56320 == (64512 & (n = e.charCodeAt(i + 1))) &&
  1636. ((r = 65536 + ((r - 55296) << 10) + (n - 56320)), i++),
  1637. (o += r < 128 ? 1 : r < 2048 ? 2 : r < 65536 ? 3 : 4);
  1638. for (t = u.uint8array ? new Uint8Array(o) : new Array(o), i = s = 0; s < o; i++)
  1639. 55296 == (64512 & (r = e.charCodeAt(i))) &&
  1640. i + 1 < a &&
  1641. 56320 == (64512 & (n = e.charCodeAt(i + 1))) &&
  1642. ((r = 65536 + ((r - 55296) << 10) + (n - 56320)), i++),
  1643. r < 128
  1644. ? (t[s++] = r)
  1645. : (r < 2048
  1646. ? (t[s++] = 192 | (r >>> 6))
  1647. : (r < 65536
  1648. ? (t[s++] = 224 | (r >>> 12))
  1649. : ((t[s++] = 240 | (r >>> 18)), (t[s++] = 128 | ((r >>> 12) & 63))),
  1650. (t[s++] = 128 | ((r >>> 6) & 63))),
  1651. (t[s++] = 128 | (63 & r)));
  1652. return t;
  1653. })(e);
  1654. }),
  1655. (s.utf8decode = function (e) {
  1656. return u.nodebuffer
  1657. ? o.transformTo("nodebuffer", e).toString("utf-8")
  1658. : (function (e) {
  1659. var t,
  1660. r,
  1661. n,
  1662. i,
  1663. s = e.length,
  1664. a = new Array(2 * s);
  1665. for (t = r = 0; t < s; )
  1666. if ((n = e[t++]) < 128) a[r++] = n;
  1667. else if (4 < (i = h[n])) (a[r++] = 65533), (t += i - 1);
  1668. else {
  1669. for (n &= 2 === i ? 31 : 3 === i ? 15 : 7; 1 < i && t < s; ) (n = (n << 6) | (63 & e[t++])), i--;
  1670. 1 < i
  1671. ? (a[r++] = 65533)
  1672. : n < 65536
  1673. ? (a[r++] = n)
  1674. : ((n -= 65536), (a[r++] = 55296 | ((n >> 10) & 1023)), (a[r++] = 56320 | (1023 & n)));
  1675. }
  1676. return a.length !== r && (a.subarray ? (a = a.subarray(0, r)) : (a.length = r)), o.applyFromCharCode(a);
  1677. })((e = o.transformTo(u.uint8array ? "uint8array" : "array", e)));
  1678. }),
  1679. o.inherits(a, n),
  1680. (a.prototype.processChunk = function (e) {
  1681. var t = o.transformTo(u.uint8array ? "uint8array" : "array", e.data);
  1682. if (this.leftOver && this.leftOver.length) {
  1683. if (u.uint8array) {
  1684. var r = t;
  1685. (t = new Uint8Array(r.length + this.leftOver.length)).set(this.leftOver, 0), t.set(r, this.leftOver.length);
  1686. } else t = this.leftOver.concat(t);
  1687. this.leftOver = null;
  1688. }
  1689. var n = (function (e, t) {
  1690. var r;
  1691. for ((t = t || e.length) > e.length && (t = e.length), r = t - 1; 0 <= r && 128 == (192 & e[r]); ) r--;
  1692. return r < 0 ? t : 0 === r ? t : r + h[e[r]] > t ? r : t;
  1693. })(t),
  1694. i = t;
  1695. n !== t.length &&
  1696. (u.uint8array
  1697. ? ((i = t.subarray(0, n)), (this.leftOver = t.subarray(n, t.length)))
  1698. : ((i = t.slice(0, n)), (this.leftOver = t.slice(n, t.length)))),
  1699. this.push({ data: s.utf8decode(i), meta: e.meta });
  1700. }),
  1701. (a.prototype.flush = function () {
  1702. this.leftOver && this.leftOver.length && (this.push({ data: s.utf8decode(this.leftOver), meta: {} }), (this.leftOver = null));
  1703. }),
  1704. (s.Utf8DecodeWorker = a),
  1705. o.inherits(f, n),
  1706. (f.prototype.processChunk = function (e) {
  1707. this.push({ data: s.utf8encode(e.data), meta: e.meta });
  1708. }),
  1709. (s.Utf8EncodeWorker = f);
  1710. },
  1711. { "./nodejsUtils": 14, "./stream/GenericWorker": 28, "./support": 30, "./utils": 32 },
  1712. ],
  1713. 32: [
  1714. function (e, t, o) {
  1715. "use strict";
  1716. var u = e("./support"),
  1717. h = e("./base64"),
  1718. r = e("./nodejsUtils"),
  1719. n = e("set-immediate-shim"),
  1720. f = e("./external");
  1721. function i(e) {
  1722. return e;
  1723. }
  1724. function l(e, t) {
  1725. for (var r = 0; r < e.length; ++r) t[r] = 255 & e.charCodeAt(r);
  1726. return t;
  1727. }
  1728. o.newBlob = function (t, r) {
  1729. o.checkSupport("blob");
  1730. try {
  1731. return new Blob([t], { type: r });
  1732. } catch (e) {
  1733. try {
  1734. var n = new (self.BlobBuilder || self.WebKitBlobBuilder || self.MozBlobBuilder || self.MSBlobBuilder)();
  1735. return n.append(t), n.getBlob(r);
  1736. } catch (e) {
  1737. throw new Error("Bug : can't construct the Blob.");
  1738. }
  1739. }
  1740. };
  1741. var s = {
  1742. stringifyByChunk: function (e, t, r) {
  1743. var n = [],
  1744. i = 0,
  1745. s = e.length;
  1746. if (s <= r) return String.fromCharCode.apply(null, e);
  1747. for (; i < s; )
  1748. "array" === t || "nodebuffer" === t
  1749. ? n.push(String.fromCharCode.apply(null, e.slice(i, Math.min(i + r, s))))
  1750. : n.push(String.fromCharCode.apply(null, e.subarray(i, Math.min(i + r, s)))),
  1751. (i += r);
  1752. return n.join("");
  1753. },
  1754. stringifyByChar: function (e) {
  1755. for (var t = "", r = 0; r < e.length; r++) t += String.fromCharCode(e[r]);
  1756. return t;
  1757. },
  1758. applyCanBeUsed: {
  1759. uint8array: (function () {
  1760. try {
  1761. return u.uint8array && 1 === String.fromCharCode.apply(null, new Uint8Array(1)).length;
  1762. } catch (e) {
  1763. return !1;
  1764. }
  1765. })(),
  1766. nodebuffer: (function () {
  1767. try {
  1768. return u.nodebuffer && 1 === String.fromCharCode.apply(null, r.allocBuffer(1)).length;
  1769. } catch (e) {
  1770. return !1;
  1771. }
  1772. })(),
  1773. },
  1774. };
  1775. function a(e) {
  1776. var t = 65536,
  1777. r = o.getTypeOf(e),
  1778. n = !0;
  1779. if (("uint8array" === r ? (n = s.applyCanBeUsed.uint8array) : "nodebuffer" === r && (n = s.applyCanBeUsed.nodebuffer), n))
  1780. for (; 1 < t; )
  1781. try {
  1782. return s.stringifyByChunk(e, r, t);
  1783. } catch (e) {
  1784. t = Math.floor(t / 2);
  1785. }
  1786. return s.stringifyByChar(e);
  1787. }
  1788. function d(e, t) {
  1789. for (var r = 0; r < e.length; r++) t[r] = e[r];
  1790. return t;
  1791. }
  1792. o.applyFromCharCode = a;
  1793. var c = {};
  1794. (c.string = {
  1795. string: i,
  1796. array: function (e) {
  1797. return l(e, new Array(e.length));
  1798. },
  1799. arraybuffer: function (e) {
  1800. return c.string.uint8array(e).buffer;
  1801. },
  1802. uint8array: function (e) {
  1803. return l(e, new Uint8Array(e.length));
  1804. },
  1805. nodebuffer: function (e) {
  1806. return l(e, r.allocBuffer(e.length));
  1807. },
  1808. }),
  1809. (c.array = {
  1810. string: a,
  1811. array: i,
  1812. arraybuffer: function (e) {
  1813. return new Uint8Array(e).buffer;
  1814. },
  1815. uint8array: function (e) {
  1816. return new Uint8Array(e);
  1817. },
  1818. nodebuffer: function (e) {
  1819. return r.newBufferFrom(e);
  1820. },
  1821. }),
  1822. (c.arraybuffer = {
  1823. string: function (e) {
  1824. return a(new Uint8Array(e));
  1825. },
  1826. array: function (e) {
  1827. return d(new Uint8Array(e), new Array(e.byteLength));
  1828. },
  1829. arraybuffer: i,
  1830. uint8array: function (e) {
  1831. return new Uint8Array(e);
  1832. },
  1833. nodebuffer: function (e) {
  1834. return r.newBufferFrom(new Uint8Array(e));
  1835. },
  1836. }),
  1837. (c.uint8array = {
  1838. string: a,
  1839. array: function (e) {
  1840. return d(e, new Array(e.length));
  1841. },
  1842. arraybuffer: function (e) {
  1843. return e.buffer;
  1844. },
  1845. uint8array: i,
  1846. nodebuffer: function (e) {
  1847. return r.newBufferFrom(e);
  1848. },
  1849. }),
  1850. (c.nodebuffer = {
  1851. string: a,
  1852. array: function (e) {
  1853. return d(e, new Array(e.length));
  1854. },
  1855. arraybuffer: function (e) {
  1856. return c.nodebuffer.uint8array(e).buffer;
  1857. },
  1858. uint8array: function (e) {
  1859. return d(e, new Uint8Array(e.length));
  1860. },
  1861. nodebuffer: i,
  1862. }),
  1863. (o.transformTo = function (e, t) {
  1864. if (((t = t || ""), !e)) return t;
  1865. o.checkSupport(e);
  1866. var r = o.getTypeOf(t);
  1867. return c[r][e](t);
  1868. }),
  1869. (o.getTypeOf = function (e) {
  1870. return "string" == typeof e
  1871. ? "string"
  1872. : "[object Array]" === Object.prototype.toString.call(e)
  1873. ? "array"
  1874. : u.nodebuffer && r.isBuffer(e)
  1875. ? "nodebuffer"
  1876. : u.uint8array && e instanceof Uint8Array
  1877. ? "uint8array"
  1878. : u.arraybuffer && e instanceof ArrayBuffer
  1879. ? "arraybuffer"
  1880. : void 0;
  1881. }),
  1882. (o.checkSupport = function (e) {
  1883. if (!u[e.toLowerCase()]) throw new Error(e + " is not supported by this platform");
  1884. }),
  1885. (o.MAX_VALUE_16BITS = 65535),
  1886. (o.MAX_VALUE_32BITS = -1),
  1887. (o.pretty = function (e) {
  1888. var t,
  1889. r,
  1890. n = "";
  1891. for (r = 0; r < (e || "").length; r++) n += "\\x" + ((t = e.charCodeAt(r)) < 16 ? "0" : "") + t.toString(16).toUpperCase();
  1892. return n;
  1893. }),
  1894. (o.delay = function (e, t, r) {
  1895. n(function () {
  1896. e.apply(r || null, t || []);
  1897. });
  1898. }),
  1899. (o.inherits = function (e, t) {
  1900. function r() {}
  1901. (r.prototype = t.prototype), (e.prototype = new r());
  1902. }),
  1903. (o.extend = function () {
  1904. var e,
  1905. t,
  1906. r = {};
  1907. for (e = 0; e < arguments.length; e++)
  1908. for (t in arguments[e]) arguments[e].hasOwnProperty(t) && void 0 === r[t] && (r[t] = arguments[e][t]);
  1909. return r;
  1910. }),
  1911. (o.prepareContent = function (n, e, i, s, a) {
  1912. return f.Promise.resolve(e)
  1913. .then(function (n) {
  1914. return u.blob &&
  1915. (n instanceof Blob || -1 !== ["[object File]", "[object Blob]"].indexOf(Object.prototype.toString.call(n))) &&
  1916. "undefined" != typeof FileReader
  1917. ? new f.Promise(function (t, r) {
  1918. var e = new FileReader();
  1919. (e.onload = function (e) {
  1920. t(e.target.result);
  1921. }),
  1922. (e.onerror = function (e) {
  1923. r(e.target.error);
  1924. }),
  1925. e.readAsArrayBuffer(n);
  1926. })
  1927. : n;
  1928. })
  1929. .then(function (e) {
  1930. var t,
  1931. r = o.getTypeOf(e);
  1932. return r
  1933. ? ("arraybuffer" === r
  1934. ? (e = o.transformTo("uint8array", e))
  1935. : "string" === r &&
  1936. (a
  1937. ? (e = h.decode(e))
  1938. : i && !0 !== s && (e = l((t = e), u.uint8array ? new Uint8Array(t.length) : new Array(t.length)))),
  1939. e)
  1940. : f.Promise.reject(
  1941. new Error(
  1942. "Can't read the data of '" + n + "'. Is it in a supported JavaScript type (String, Blob, ArrayBuffer, etc) ?"
  1943. )
  1944. );
  1945. });
  1946. });
  1947. },
  1948. { "./base64": 1, "./external": 6, "./nodejsUtils": 14, "./support": 30, "set-immediate-shim": 54 },
  1949. ],
  1950. 33: [
  1951. function (e, t, r) {
  1952. "use strict";
  1953. var n = e("./reader/readerFor"),
  1954. i = e("./utils"),
  1955. s = e("./signature"),
  1956. a = e("./zipEntry"),
  1957. o = (e("./utf8"), e("./support"));
  1958. function u(e) {
  1959. (this.files = []), (this.loadOptions = e);
  1960. }
  1961. (u.prototype = {
  1962. checkSignature: function (e) {
  1963. if (!this.reader.readAndCheckSignature(e)) {
  1964. this.reader.index -= 4;
  1965. var t = this.reader.readString(4);
  1966. throw new Error("Corrupted zip or bug: unexpected signature (" + i.pretty(t) + ", expected " + i.pretty(e) + ")");
  1967. }
  1968. },
  1969. isSignature: function (e, t) {
  1970. var r = this.reader.index;
  1971. this.reader.setIndex(e);
  1972. var n = this.reader.readString(4) === t;
  1973. return this.reader.setIndex(r), n;
  1974. },
  1975. readBlockEndOfCentral: function () {
  1976. (this.diskNumber = this.reader.readInt(2)),
  1977. (this.diskWithCentralDirStart = this.reader.readInt(2)),
  1978. (this.centralDirRecordsOnThisDisk = this.reader.readInt(2)),
  1979. (this.centralDirRecords = this.reader.readInt(2)),
  1980. (this.centralDirSize = this.reader.readInt(4)),
  1981. (this.centralDirOffset = this.reader.readInt(4)),
  1982. (this.zipCommentLength = this.reader.readInt(2));
  1983. var e = this.reader.readData(this.zipCommentLength),
  1984. t = o.uint8array ? "uint8array" : "array",
  1985. r = i.transformTo(t, e);
  1986. this.zipComment = this.loadOptions.decodeFileName(r);
  1987. },
  1988. readBlockZip64EndOfCentral: function () {
  1989. (this.zip64EndOfCentralSize = this.reader.readInt(8)),
  1990. this.reader.skip(4),
  1991. (this.diskNumber = this.reader.readInt(4)),
  1992. (this.diskWithCentralDirStart = this.reader.readInt(4)),
  1993. (this.centralDirRecordsOnThisDisk = this.reader.readInt(8)),
  1994. (this.centralDirRecords = this.reader.readInt(8)),
  1995. (this.centralDirSize = this.reader.readInt(8)),
  1996. (this.centralDirOffset = this.reader.readInt(8)),
  1997. (this.zip64ExtensibleData = {});
  1998. for (var e, t, r, n = this.zip64EndOfCentralSize - 44; 0 < n; )
  1999. (e = this.reader.readInt(2)),
  2000. (t = this.reader.readInt(4)),
  2001. (r = this.reader.readData(t)),
  2002. (this.zip64ExtensibleData[e] = { id: e, length: t, value: r });
  2003. },
  2004. readBlockZip64EndOfCentralLocator: function () {
  2005. if (
  2006. ((this.diskWithZip64CentralDirStart = this.reader.readInt(4)),
  2007. (this.relativeOffsetEndOfZip64CentralDir = this.reader.readInt(8)),
  2008. (this.disksCount = this.reader.readInt(4)),
  2009. 1 < this.disksCount)
  2010. )
  2011. throw new Error("Multi-volumes zip are not supported");
  2012. },
  2013. readLocalFiles: function () {
  2014. var e, t;
  2015. for (e = 0; e < this.files.length; e++)
  2016. (t = this.files[e]),
  2017. this.reader.setIndex(t.localHeaderOffset),
  2018. this.checkSignature(s.LOCAL_FILE_HEADER),
  2019. t.readLocalPart(this.reader),
  2020. t.handleUTF8(),
  2021. t.processAttributes();
  2022. },
  2023. readCentralDir: function () {
  2024. var e;
  2025. for (this.reader.setIndex(this.centralDirOffset); this.reader.readAndCheckSignature(s.CENTRAL_FILE_HEADER); )
  2026. (e = new a({ zip64: this.zip64 }, this.loadOptions)).readCentralPart(this.reader), this.files.push(e);
  2027. if (this.centralDirRecords !== this.files.length && 0 !== this.centralDirRecords && 0 === this.files.length)
  2028. throw new Error(
  2029. "Corrupted zip or bug: expected " + this.centralDirRecords + " records in central dir, got " + this.files.length
  2030. );
  2031. },
  2032. readEndOfCentral: function () {
  2033. var e = this.reader.lastIndexOfSignature(s.CENTRAL_DIRECTORY_END);
  2034. if (e < 0)
  2035. throw this.isSignature(0, s.LOCAL_FILE_HEADER)
  2036. ? new Error("Corrupted zip: can't find end of central directory")
  2037. : new Error(
  2038. "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"
  2039. );
  2040. this.reader.setIndex(e);
  2041. var t = e;
  2042. if (
  2043. (this.checkSignature(s.CENTRAL_DIRECTORY_END),
  2044. this.readBlockEndOfCentral(),
  2045. this.diskNumber === i.MAX_VALUE_16BITS ||
  2046. this.diskWithCentralDirStart === i.MAX_VALUE_16BITS ||
  2047. this.centralDirRecordsOnThisDisk === i.MAX_VALUE_16BITS ||
  2048. this.centralDirRecords === i.MAX_VALUE_16BITS ||
  2049. this.centralDirSize === i.MAX_VALUE_32BITS ||
  2050. this.centralDirOffset === i.MAX_VALUE_32BITS)
  2051. ) {
  2052. if (((this.zip64 = !0), (e = this.reader.lastIndexOfSignature(s.ZIP64_CENTRAL_DIRECTORY_LOCATOR)) < 0))
  2053. throw new Error("Corrupted zip: can't find the ZIP64 end of central directory locator");
  2054. if (
  2055. (this.reader.setIndex(e),
  2056. this.checkSignature(s.ZIP64_CENTRAL_DIRECTORY_LOCATOR),
  2057. this.readBlockZip64EndOfCentralLocator(),
  2058. !this.isSignature(this.relativeOffsetEndOfZip64CentralDir, s.ZIP64_CENTRAL_DIRECTORY_END) &&
  2059. ((this.relativeOffsetEndOfZip64CentralDir = this.reader.lastIndexOfSignature(s.ZIP64_CENTRAL_DIRECTORY_END)),
  2060. this.relativeOffsetEndOfZip64CentralDir < 0))
  2061. )
  2062. throw new Error("Corrupted zip: can't find the ZIP64 end of central directory");
  2063. this.reader.setIndex(this.relativeOffsetEndOfZip64CentralDir),
  2064. this.checkSignature(s.ZIP64_CENTRAL_DIRECTORY_END),
  2065. this.readBlockZip64EndOfCentral();
  2066. }
  2067. var r = this.centralDirOffset + this.centralDirSize;
  2068. this.zip64 && ((r += 20), (r += 12 + this.zip64EndOfCentralSize));
  2069. var n = t - r;
  2070. if (0 < n) this.isSignature(t, s.CENTRAL_FILE_HEADER) || (this.reader.zero = n);
  2071. else if (n < 0) throw new Error("Corrupted zip: missing " + Math.abs(n) + " bytes.");
  2072. },
  2073. prepareReader: function (e) {
  2074. this.reader = n(e);
  2075. },
  2076. load: function (e) {
  2077. this.prepareReader(e), this.readEndOfCentral(), this.readCentralDir(), this.readLocalFiles();
  2078. },
  2079. }),
  2080. (t.exports = u);
  2081. },
  2082. { "./reader/readerFor": 22, "./signature": 23, "./support": 30, "./utf8": 31, "./utils": 32, "./zipEntry": 34 },
  2083. ],
  2084. 34: [
  2085. function (e, t, r) {
  2086. "use strict";
  2087. var n = e("./reader/readerFor"),
  2088. s = e("./utils"),
  2089. i = e("./compressedObject"),
  2090. a = e("./crc32"),
  2091. o = e("./utf8"),
  2092. u = e("./compressions"),
  2093. h = e("./support");
  2094. function f(e, t) {
  2095. (this.options = e), (this.loadOptions = t);
  2096. }
  2097. (f.prototype = {
  2098. isEncrypted: function () {
  2099. return 1 == (1 & this.bitFlag);
  2100. },
  2101. useUTF8: function () {
  2102. return 2048 == (2048 & this.bitFlag);
  2103. },
  2104. readLocalPart: function (e) {
  2105. var t, r;
  2106. if (
  2107. (e.skip(22),
  2108. (this.fileNameLength = e.readInt(2)),
  2109. (r = e.readInt(2)),
  2110. (this.fileName = e.readData(this.fileNameLength)),
  2111. e.skip(r),
  2112. -1 === this.compressedSize || -1 === this.uncompressedSize)
  2113. )
  2114. throw new Error(
  2115. "Bug or corrupted zip : didn't get enough information from the central directory (compressedSize === -1 || uncompressedSize === -1)"
  2116. );
  2117. if (
  2118. null ===
  2119. (t = (function (e) {
  2120. for (var t in u) if (u.hasOwnProperty(t) && u[t].magic === e) return u[t];
  2121. return null;
  2122. })(this.compressionMethod))
  2123. )
  2124. throw new Error(
  2125. "Corrupted zip : compression " +
  2126. s.pretty(this.compressionMethod) +
  2127. " unknown (inner file : " +
  2128. s.transformTo("string", this.fileName) +
  2129. ")"
  2130. );
  2131. this.decompressed = new i(this.compressedSize, this.uncompressedSize, this.crc32, t, e.readData(this.compressedSize));
  2132. },
  2133. readCentralPart: function (e) {
  2134. (this.versionMadeBy = e.readInt(2)),
  2135. e.skip(2),
  2136. (this.bitFlag = e.readInt(2)),
  2137. (this.compressionMethod = e.readString(2)),
  2138. (this.date = e.readDate()),
  2139. (this.crc32 = e.readInt(4)),
  2140. (this.compressedSize = e.readInt(4)),
  2141. (this.uncompressedSize = e.readInt(4));
  2142. var t = e.readInt(2);
  2143. if (
  2144. ((this.extraFieldsLength = e.readInt(2)),
  2145. (this.fileCommentLength = e.readInt(2)),
  2146. (this.diskNumberStart = e.readInt(2)),
  2147. (this.internalFileAttributes = e.readInt(2)),
  2148. (this.externalFileAttributes = e.readInt(4)),
  2149. (this.localHeaderOffset = e.readInt(4)),
  2150. this.isEncrypted())
  2151. )
  2152. throw new Error("Encrypted zip are not supported");
  2153. e.skip(t), this.readExtraFields(e), this.parseZIP64ExtraField(e), (this.fileComment = e.readData(this.fileCommentLength));
  2154. },
  2155. processAttributes: function () {
  2156. (this.unixPermissions = null), (this.dosPermissions = null);
  2157. var e = this.versionMadeBy >> 8;
  2158. (this.dir = !!(16 & this.externalFileAttributes)),
  2159. 0 == e && (this.dosPermissions = 63 & this.externalFileAttributes),
  2160. 3 == e && (this.unixPermissions = (this.externalFileAttributes >> 16) & 65535),
  2161. this.dir || "/" !== this.fileNameStr.slice(-1) || (this.dir = !0);
  2162. },
  2163. parseZIP64ExtraField: function (e) {
  2164. if (this.extraFields[1]) {
  2165. var t = n(this.extraFields[1].value);
  2166. this.uncompressedSize === s.MAX_VALUE_32BITS && (this.uncompressedSize = t.readInt(8)),
  2167. this.compressedSize === s.MAX_VALUE_32BITS && (this.compressedSize = t.readInt(8)),
  2168. this.localHeaderOffset === s.MAX_VALUE_32BITS && (this.localHeaderOffset = t.readInt(8)),
  2169. this.diskNumberStart === s.MAX_VALUE_32BITS && (this.diskNumberStart = t.readInt(4));
  2170. }
  2171. },
  2172. readExtraFields: function (e) {
  2173. var t,
  2174. r,
  2175. n,
  2176. i = e.index + this.extraFieldsLength;
  2177. for (this.extraFields || (this.extraFields = {}); e.index + 4 < i; )
  2178. (t = e.readInt(2)), (r = e.readInt(2)), (n = e.readData(r)), (this.extraFields[t] = { id: t, length: r, value: n });
  2179. e.setIndex(i);
  2180. },
  2181. handleUTF8: function () {
  2182. var e = h.uint8array ? "uint8array" : "array";
  2183. if (this.useUTF8()) (this.fileNameStr = o.utf8decode(this.fileName)), (this.fileCommentStr = o.utf8decode(this.fileComment));
  2184. else {
  2185. var t = this.findExtraFieldUnicodePath();
  2186. if (null !== t) this.fileNameStr = t;
  2187. else {
  2188. var r = s.transformTo(e, this.fileName);
  2189. this.fileNameStr = this.loadOptions.decodeFileName(r);
  2190. }
  2191. var n = this.findExtraFieldUnicodeComment();
  2192. if (null !== n) this.fileCommentStr = n;
  2193. else {
  2194. var i = s.transformTo(e, this.fileComment);
  2195. this.fileCommentStr = this.loadOptions.decodeFileName(i);
  2196. }
  2197. }
  2198. },
  2199. findExtraFieldUnicodePath: function () {
  2200. var e = this.extraFields[28789];
  2201. if (e) {
  2202. var t = n(e.value);
  2203. return 1 !== t.readInt(1) ? null : a(this.fileName) !== t.readInt(4) ? null : o.utf8decode(t.readData(e.length - 5));
  2204. }
  2205. return null;
  2206. },
  2207. findExtraFieldUnicodeComment: function () {
  2208. var e = this.extraFields[25461];
  2209. if (e) {
  2210. var t = n(e.value);
  2211. return 1 !== t.readInt(1) ? null : a(this.fileComment) !== t.readInt(4) ? null : o.utf8decode(t.readData(e.length - 5));
  2212. }
  2213. return null;
  2214. },
  2215. }),
  2216. (t.exports = f);
  2217. },
  2218. {
  2219. "./compressedObject": 2,
  2220. "./compressions": 3,
  2221. "./crc32": 4,
  2222. "./reader/readerFor": 22,
  2223. "./support": 30,
  2224. "./utf8": 31,
  2225. "./utils": 32,
  2226. },
  2227. ],
  2228. 35: [
  2229. function (e, t, r) {
  2230. "use strict";
  2231. function n(e, t, r) {
  2232. (this.name = e),
  2233. (this.dir = r.dir),
  2234. (this.date = r.date),
  2235. (this.comment = r.comment),
  2236. (this.unixPermissions = r.unixPermissions),
  2237. (this.dosPermissions = r.dosPermissions),
  2238. (this._data = t),
  2239. (this._dataBinary = r.binary),
  2240. (this.options = { compression: r.compression, compressionOptions: r.compressionOptions });
  2241. }
  2242. var s = e("./stream/StreamHelper"),
  2243. i = e("./stream/DataWorker"),
  2244. a = e("./utf8"),
  2245. o = e("./compressedObject"),
  2246. u = e("./stream/GenericWorker");
  2247. n.prototype = {
  2248. internalStream: function (e) {
  2249. var t = null,
  2250. r = "string";
  2251. try {
  2252. if (!e) throw new Error("No output type specified.");
  2253. var n = "string" === (r = e.toLowerCase()) || "text" === r;
  2254. ("binarystring" !== r && "text" !== r) || (r = "string"), (t = this._decompressWorker());
  2255. var i = !this._dataBinary;
  2256. i && !n && (t = t.pipe(new a.Utf8EncodeWorker())), !i && n && (t = t.pipe(new a.Utf8DecodeWorker()));
  2257. } catch (e) {
  2258. (t = new u("error")).error(e);
  2259. }
  2260. return new s(t, r, "");
  2261. },
  2262. async: function (e, t) {
  2263. return this.internalStream(e).accumulate(t);
  2264. },
  2265. nodeStream: function (e, t) {
  2266. return this.internalStream(e || "nodebuffer").toNodejsStream(t);
  2267. },
  2268. _compressWorker: function (e, t) {
  2269. if (this._data instanceof o && this._data.compression.magic === e.magic) return this._data.getCompressedWorker();
  2270. var r = this._decompressWorker();
  2271. return this._dataBinary || (r = r.pipe(new a.Utf8EncodeWorker())), o.createWorkerFrom(r, e, t);
  2272. },
  2273. _decompressWorker: function () {
  2274. return this._data instanceof o ? this._data.getContentWorker() : this._data instanceof u ? this._data : new i(this._data);
  2275. },
  2276. };
  2277. for (
  2278. var h = ["asText", "asBinary", "asNodeBuffer", "asUint8Array", "asArrayBuffer"],
  2279. f = function () {
  2280. throw new Error("This method has been removed in JSZip 3.0, please check the upgrade guide.");
  2281. },
  2282. l = 0;
  2283. l < h.length;
  2284. l++
  2285. )
  2286. n.prototype[h[l]] = f;
  2287. t.exports = n;
  2288. },
  2289. { "./compressedObject": 2, "./stream/DataWorker": 27, "./stream/GenericWorker": 28, "./stream/StreamHelper": 29, "./utf8": 31 },
  2290. ],
  2291. 36: [
  2292. function (e, f, t) {
  2293. (function (t) {
  2294. "use strict";
  2295. var r,
  2296. n,
  2297. e = t.MutationObserver || t.WebKitMutationObserver;
  2298. if (e) {
  2299. var i = 0,
  2300. s = new e(h),
  2301. a = t.document.createTextNode("");
  2302. s.observe(a, { characterData: !0 }),
  2303. (r = function () {
  2304. a.data = i = ++i % 2;
  2305. });
  2306. } else if (t.setImmediate || void 0 === t.MessageChannel)
  2307. r =
  2308. "document" in t && "onreadystatechange" in t.document.createElement("script")
  2309. ? function () {
  2310. var e = t.document.createElement("script");
  2311. (e.onreadystatechange = function () {
  2312. h(), (e.onreadystatechange = null), e.parentNode.removeChild(e), (e = null);
  2313. }),
  2314. t.document.documentElement.appendChild(e);
  2315. }
  2316. : function () {
  2317. setTimeout(h, 0);
  2318. };
  2319. else {
  2320. var o = new t.MessageChannel();
  2321. (o.port1.onmessage = h),
  2322. (r = function () {
  2323. o.port2.postMessage(0);
  2324. });
  2325. }
  2326. var u = [];
  2327. function h() {
  2328. var e, t;
  2329. n = !0;
  2330. for (var r = u.length; r; ) {
  2331. for (t = u, u = [], e = -1; ++e < r; ) t[e]();
  2332. r = u.length;
  2333. }
  2334. n = !1;
  2335. }
  2336. f.exports = function (e) {
  2337. 1 !== u.push(e) || n || r();
  2338. };
  2339. }.call(this, void 0 !== r ? r : "undefined" != typeof self ? self : "undefined" != typeof window ? window : {}));
  2340. },
  2341. {},
  2342. ],
  2343. 37: [
  2344. function (e, t, r) {
  2345. "use strict";
  2346. var i = e("immediate");
  2347. function h() {}
  2348. var f = {},
  2349. s = ["REJECTED"],
  2350. a = ["FULFILLED"],
  2351. n = ["PENDING"];
  2352. function o(e) {
  2353. if ("function" != typeof e) throw new TypeError("resolver must be a function");
  2354. (this.state = n), (this.queue = []), (this.outcome = void 0), e !== h && c(this, e);
  2355. }
  2356. function u(e, t, r) {
  2357. (this.promise = e),
  2358. "function" == typeof t && ((this.onFulfilled = t), (this.callFulfilled = this.otherCallFulfilled)),
  2359. "function" == typeof r && ((this.onRejected = r), (this.callRejected = this.otherCallRejected));
  2360. }
  2361. function l(t, r, n) {
  2362. i(function () {
  2363. var e;
  2364. try {
  2365. e = r(n);
  2366. } catch (e) {
  2367. return f.reject(t, e);
  2368. }
  2369. e === t ? f.reject(t, new TypeError("Cannot resolve promise with itself")) : f.resolve(t, e);
  2370. });
  2371. }
  2372. function d(e) {
  2373. var t = e && e.then;
  2374. if (e && ("object" == typeof e || "function" == typeof e) && "function" == typeof t)
  2375. return function () {
  2376. t.apply(e, arguments);
  2377. };
  2378. }
  2379. function c(t, e) {
  2380. var r = !1;
  2381. function n(e) {
  2382. r || ((r = !0), f.reject(t, e));
  2383. }
  2384. function i(e) {
  2385. r || ((r = !0), f.resolve(t, e));
  2386. }
  2387. var s = p(function () {
  2388. e(i, n);
  2389. });
  2390. "error" === s.status && n(s.value);
  2391. }
  2392. function p(e, t) {
  2393. var r = {};
  2394. try {
  2395. (r.value = e(t)), (r.status = "success");
  2396. } catch (e) {
  2397. (r.status = "error"), (r.value = e);
  2398. }
  2399. return r;
  2400. }
  2401. ((t.exports = o).prototype.finally = function (t) {
  2402. if ("function" != typeof t) return this;
  2403. var r = this.constructor;
  2404. return this.then(
  2405. function (e) {
  2406. return r.resolve(t()).then(function () {
  2407. return e;
  2408. });
  2409. },
  2410. function (e) {
  2411. return r.resolve(t()).then(function () {
  2412. throw e;
  2413. });
  2414. }
  2415. );
  2416. }),
  2417. (o.prototype.catch = function (e) {
  2418. return this.then(null, e);
  2419. }),
  2420. (o.prototype.then = function (e, t) {
  2421. if (("function" != typeof e && this.state === a) || ("function" != typeof t && this.state === s)) return this;
  2422. var r = new this.constructor(h);
  2423. return this.state !== n ? l(r, this.state === a ? e : t, this.outcome) : this.queue.push(new u(r, e, t)), r;
  2424. }),
  2425. (u.prototype.callFulfilled = function (e) {
  2426. f.resolve(this.promise, e);
  2427. }),
  2428. (u.prototype.otherCallFulfilled = function (e) {
  2429. l(this.promise, this.onFulfilled, e);
  2430. }),
  2431. (u.prototype.callRejected = function (e) {
  2432. f.reject(this.promise, e);
  2433. }),
  2434. (u.prototype.otherCallRejected = function (e) {
  2435. l(this.promise, this.onRejected, e);
  2436. }),
  2437. (f.resolve = function (e, t) {
  2438. var r = p(d, t);
  2439. if ("error" === r.status) return f.reject(e, r.value);
  2440. var n = r.value;
  2441. if (n) c(e, n);
  2442. else {
  2443. (e.state = a), (e.outcome = t);
  2444. for (var i = -1, s = e.queue.length; ++i < s; ) e.queue[i].callFulfilled(t);
  2445. }
  2446. return e;
  2447. }),
  2448. (f.reject = function (e, t) {
  2449. (e.state = s), (e.outcome = t);
  2450. for (var r = -1, n = e.queue.length; ++r < n; ) e.queue[r].callRejected(t);
  2451. return e;
  2452. }),
  2453. (o.resolve = function (e) {
  2454. return e instanceof this ? e : f.resolve(new this(h), e);
  2455. }),
  2456. (o.reject = function (e) {
  2457. var t = new this(h);
  2458. return f.reject(t, e);
  2459. }),
  2460. (o.all = function (e) {
  2461. var r = this;
  2462. if ("[object Array]" !== Object.prototype.toString.call(e)) return this.reject(new TypeError("must be an array"));
  2463. var n = e.length,
  2464. i = !1;
  2465. if (!n) return this.resolve([]);
  2466. for (var s = new Array(n), a = 0, t = -1, o = new this(h); ++t < n; ) u(e[t], t);
  2467. return o;
  2468. function u(e, t) {
  2469. r.resolve(e).then(
  2470. function (e) {
  2471. (s[t] = e), ++a !== n || i || ((i = !0), f.resolve(o, s));
  2472. },
  2473. function (e) {
  2474. i || ((i = !0), f.reject(o, e));
  2475. }
  2476. );
  2477. }
  2478. }),
  2479. (o.race = function (e) {
  2480. if ("[object Array]" !== Object.prototype.toString.call(e)) return this.reject(new TypeError("must be an array"));
  2481. var t = e.length,
  2482. r = !1;
  2483. if (!t) return this.resolve([]);
  2484. for (var n, i = -1, s = new this(h); ++i < t; )
  2485. (n = e[i]),
  2486. this.resolve(n).then(
  2487. function (e) {
  2488. r || ((r = !0), f.resolve(s, e));
  2489. },
  2490. function (e) {
  2491. r || ((r = !0), f.reject(s, e));
  2492. }
  2493. );
  2494. return s;
  2495. });
  2496. },
  2497. { immediate: 36 },
  2498. ],
  2499. 38: [
  2500. function (e, t, r) {
  2501. "use strict";
  2502. var n = {};
  2503. (0, e("./lib/utils/common").assign)(n, e("./lib/deflate"), e("./lib/inflate"), e("./lib/zlib/constants")), (t.exports = n);
  2504. },
  2505. { "./lib/deflate": 39, "./lib/inflate": 40, "./lib/utils/common": 41, "./lib/zlib/constants": 44 },
  2506. ],
  2507. 39: [
  2508. function (e, t, r) {
  2509. "use strict";
  2510. var a = e("./zlib/deflate"),
  2511. o = e("./utils/common"),
  2512. u = e("./utils/strings"),
  2513. i = e("./zlib/messages"),
  2514. s = e("./zlib/zstream"),
  2515. h = Object.prototype.toString,
  2516. f = 0,
  2517. l = -1,
  2518. d = 0,
  2519. c = 8;
  2520. function p(e) {
  2521. if (!(this instanceof p)) return new p(e);
  2522. this.options = o.assign({ level: l, method: c, chunkSize: 16384, windowBits: 15, memLevel: 8, strategy: d, to: "" }, e || {});
  2523. var t = this.options;
  2524. t.raw && 0 < t.windowBits
  2525. ? (t.windowBits = -t.windowBits)
  2526. : t.gzip && 0 < t.windowBits && t.windowBits < 16 && (t.windowBits += 16),
  2527. (this.err = 0),
  2528. (this.msg = ""),
  2529. (this.ended = !1),
  2530. (this.chunks = []),
  2531. (this.strm = new s()),
  2532. (this.strm.avail_out = 0);
  2533. var r = a.deflateInit2(this.strm, t.level, t.method, t.windowBits, t.memLevel, t.strategy);
  2534. if (r !== f) throw new Error(i[r]);
  2535. if ((t.header && a.deflateSetHeader(this.strm, t.header), t.dictionary)) {
  2536. var n;
  2537. if (
  2538. ((n =
  2539. "string" == typeof t.dictionary
  2540. ? u.string2buf(t.dictionary)
  2541. : "[object ArrayBuffer]" === h.call(t.dictionary)
  2542. ? new Uint8Array(t.dictionary)
  2543. : t.dictionary),
  2544. (r = a.deflateSetDictionary(this.strm, n)) !== f)
  2545. )
  2546. throw new Error(i[r]);
  2547. this._dict_set = !0;
  2548. }
  2549. }
  2550. function n(e, t) {
  2551. var r = new p(t);
  2552. if ((r.push(e, !0), r.err)) throw r.msg || i[r.err];
  2553. return r.result;
  2554. }
  2555. (p.prototype.push = function (e, t) {
  2556. var r,
  2557. n,
  2558. i = this.strm,
  2559. s = this.options.chunkSize;
  2560. if (this.ended) return !1;
  2561. (n = t === ~~t ? t : !0 === t ? 4 : 0),
  2562. "string" == typeof e
  2563. ? (i.input = u.string2buf(e))
  2564. : "[object ArrayBuffer]" === h.call(e)
  2565. ? (i.input = new Uint8Array(e))
  2566. : (i.input = e),
  2567. (i.next_in = 0),
  2568. (i.avail_in = i.input.length);
  2569. do {
  2570. if (
  2571. (0 === i.avail_out && ((i.output = new o.Buf8(s)), (i.next_out = 0), (i.avail_out = s)),
  2572. 1 !== (r = a.deflate(i, n)) && r !== f)
  2573. )
  2574. return this.onEnd(r), !(this.ended = !0);
  2575. (0 !== i.avail_out && (0 !== i.avail_in || (4 !== n && 2 !== n))) ||
  2576. ("string" === this.options.to
  2577. ? this.onData(u.buf2binstring(o.shrinkBuf(i.output, i.next_out)))
  2578. : this.onData(o.shrinkBuf(i.output, i.next_out)));
  2579. } while ((0 < i.avail_in || 0 === i.avail_out) && 1 !== r);
  2580. return 4 === n
  2581. ? ((r = a.deflateEnd(this.strm)), this.onEnd(r), (this.ended = !0), r === f)
  2582. : 2 !== n || (this.onEnd(f), !(i.avail_out = 0));
  2583. }),
  2584. (p.prototype.onData = function (e) {
  2585. this.chunks.push(e);
  2586. }),
  2587. (p.prototype.onEnd = function (e) {
  2588. e === f &&
  2589. ("string" === this.options.to ? (this.result = this.chunks.join("")) : (this.result = o.flattenChunks(this.chunks))),
  2590. (this.chunks = []),
  2591. (this.err = e),
  2592. (this.msg = this.strm.msg);
  2593. }),
  2594. (r.Deflate = p),
  2595. (r.deflate = n),
  2596. (r.deflateRaw = function (e, t) {
  2597. return ((t = t || {}).raw = !0), n(e, t);
  2598. }),
  2599. (r.gzip = function (e, t) {
  2600. return ((t = t || {}).gzip = !0), n(e, t);
  2601. });
  2602. },
  2603. { "./utils/common": 41, "./utils/strings": 42, "./zlib/deflate": 46, "./zlib/messages": 51, "./zlib/zstream": 53 },
  2604. ],
  2605. 40: [
  2606. function (e, t, r) {
  2607. "use strict";
  2608. var d = e("./zlib/inflate"),
  2609. c = e("./utils/common"),
  2610. p = e("./utils/strings"),
  2611. m = e("./zlib/constants"),
  2612. n = e("./zlib/messages"),
  2613. i = e("./zlib/zstream"),
  2614. s = e("./zlib/gzheader"),
  2615. _ = Object.prototype.toString;
  2616. function a(e) {
  2617. if (!(this instanceof a)) return new a(e);
  2618. this.options = c.assign({ chunkSize: 16384, windowBits: 0, to: "" }, e || {});
  2619. var t = this.options;
  2620. t.raw && 0 <= t.windowBits && t.windowBits < 16 && ((t.windowBits = -t.windowBits), 0 === t.windowBits && (t.windowBits = -15)),
  2621. !(0 <= t.windowBits && t.windowBits < 16) || (e && e.windowBits) || (t.windowBits += 32),
  2622. 15 < t.windowBits && t.windowBits < 48 && 0 == (15 & t.windowBits) && (t.windowBits |= 15),
  2623. (this.err = 0),
  2624. (this.msg = ""),
  2625. (this.ended = !1),
  2626. (this.chunks = []),
  2627. (this.strm = new i()),
  2628. (this.strm.avail_out = 0);
  2629. var r = d.inflateInit2(this.strm, t.windowBits);
  2630. if (r !== m.Z_OK) throw new Error(n[r]);
  2631. (this.header = new s()), d.inflateGetHeader(this.strm, this.header);
  2632. }
  2633. function o(e, t) {
  2634. var r = new a(t);
  2635. if ((r.push(e, !0), r.err)) throw r.msg || n[r.err];
  2636. return r.result;
  2637. }
  2638. (a.prototype.push = function (e, t) {
  2639. var r,
  2640. n,
  2641. i,
  2642. s,
  2643. a,
  2644. o,
  2645. u = this.strm,
  2646. h = this.options.chunkSize,
  2647. f = this.options.dictionary,
  2648. l = !1;
  2649. if (this.ended) return !1;
  2650. (n = t === ~~t ? t : !0 === t ? m.Z_FINISH : m.Z_NO_FLUSH),
  2651. "string" == typeof e
  2652. ? (u.input = p.binstring2buf(e))
  2653. : "[object ArrayBuffer]" === _.call(e)
  2654. ? (u.input = new Uint8Array(e))
  2655. : (u.input = e),
  2656. (u.next_in = 0),
  2657. (u.avail_in = u.input.length);
  2658. do {
  2659. if (
  2660. (0 === u.avail_out && ((u.output = new c.Buf8(h)), (u.next_out = 0), (u.avail_out = h)),
  2661. (r = d.inflate(u, m.Z_NO_FLUSH)) === m.Z_NEED_DICT &&
  2662. f &&
  2663. ((o = "string" == typeof f ? p.string2buf(f) : "[object ArrayBuffer]" === _.call(f) ? new Uint8Array(f) : f),
  2664. (r = d.inflateSetDictionary(this.strm, o))),
  2665. r === m.Z_BUF_ERROR && !0 === l && ((r = m.Z_OK), (l = !1)),
  2666. r !== m.Z_STREAM_END && r !== m.Z_OK)
  2667. )
  2668. return this.onEnd(r), !(this.ended = !0);
  2669. u.next_out &&
  2670. ((0 !== u.avail_out && r !== m.Z_STREAM_END && (0 !== u.avail_in || (n !== m.Z_FINISH && n !== m.Z_SYNC_FLUSH))) ||
  2671. ("string" === this.options.to
  2672. ? ((i = p.utf8border(u.output, u.next_out)),
  2673. (s = u.next_out - i),
  2674. (a = p.buf2string(u.output, i)),
  2675. (u.next_out = s),
  2676. (u.avail_out = h - s),
  2677. s && c.arraySet(u.output, u.output, i, s, 0),
  2678. this.onData(a))
  2679. : this.onData(c.shrinkBuf(u.output, u.next_out)))),
  2680. 0 === u.avail_in && 0 === u.avail_out && (l = !0);
  2681. } while ((0 < u.avail_in || 0 === u.avail_out) && r !== m.Z_STREAM_END);
  2682. return (
  2683. r === m.Z_STREAM_END && (n = m.Z_FINISH),
  2684. n === m.Z_FINISH
  2685. ? ((r = d.inflateEnd(this.strm)), this.onEnd(r), (this.ended = !0), r === m.Z_OK)
  2686. : n !== m.Z_SYNC_FLUSH || (this.onEnd(m.Z_OK), !(u.avail_out = 0))
  2687. );
  2688. }),
  2689. (a.prototype.onData = function (e) {
  2690. this.chunks.push(e);
  2691. }),
  2692. (a.prototype.onEnd = function (e) {
  2693. e === m.Z_OK &&
  2694. ("string" === this.options.to ? (this.result = this.chunks.join("")) : (this.result = c.flattenChunks(this.chunks))),
  2695. (this.chunks = []),
  2696. (this.err = e),
  2697. (this.msg = this.strm.msg);
  2698. }),
  2699. (r.Inflate = a),
  2700. (r.inflate = o),
  2701. (r.inflateRaw = function (e, t) {
  2702. return ((t = t || {}).raw = !0), o(e, t);
  2703. }),
  2704. (r.ungzip = o);
  2705. },
  2706. {
  2707. "./utils/common": 41,
  2708. "./utils/strings": 42,
  2709. "./zlib/constants": 44,
  2710. "./zlib/gzheader": 47,
  2711. "./zlib/inflate": 49,
  2712. "./zlib/messages": 51,
  2713. "./zlib/zstream": 53,
  2714. },
  2715. ],
  2716. 41: [
  2717. function (e, t, r) {
  2718. "use strict";
  2719. var n = "undefined" != typeof Uint8Array && "undefined" != typeof Uint16Array && "undefined" != typeof Int32Array;
  2720. (r.assign = function (e) {
  2721. for (var t = Array.prototype.slice.call(arguments, 1); t.length; ) {
  2722. var r = t.shift();
  2723. if (r) {
  2724. if ("object" != typeof r) throw new TypeError(r + "must be non-object");
  2725. for (var n in r) r.hasOwnProperty(n) && (e[n] = r[n]);
  2726. }
  2727. }
  2728. return e;
  2729. }),
  2730. (r.shrinkBuf = function (e, t) {
  2731. return e.length === t ? e : e.subarray ? e.subarray(0, t) : ((e.length = t), e);
  2732. });
  2733. var i = {
  2734. arraySet: function (e, t, r, n, i) {
  2735. if (t.subarray && e.subarray) e.set(t.subarray(r, r + n), i);
  2736. else for (var s = 0; s < n; s++) e[i + s] = t[r + s];
  2737. },
  2738. flattenChunks: function (e) {
  2739. var t, r, n, i, s, a;
  2740. for (t = n = 0, r = e.length; t < r; t++) n += e[t].length;
  2741. for (a = new Uint8Array(n), t = i = 0, r = e.length; t < r; t++) (s = e[t]), a.set(s, i), (i += s.length);
  2742. return a;
  2743. },
  2744. },
  2745. s = {
  2746. arraySet: function (e, t, r, n, i) {
  2747. for (var s = 0; s < n; s++) e[i + s] = t[r + s];
  2748. },
  2749. flattenChunks: function (e) {
  2750. return [].concat.apply([], e);
  2751. },
  2752. };
  2753. (r.setTyped = function (e) {
  2754. e
  2755. ? ((r.Buf8 = Uint8Array), (r.Buf16 = Uint16Array), (r.Buf32 = Int32Array), r.assign(r, i))
  2756. : ((r.Buf8 = Array), (r.Buf16 = Array), (r.Buf32 = Array), r.assign(r, s));
  2757. }),
  2758. r.setTyped(n);
  2759. },
  2760. {},
  2761. ],
  2762. 42: [
  2763. function (e, t, r) {
  2764. "use strict";
  2765. var u = e("./common"),
  2766. i = !0,
  2767. s = !0;
  2768. try {
  2769. String.fromCharCode.apply(null, [0]);
  2770. } catch (e) {
  2771. i = !1;
  2772. }
  2773. try {
  2774. String.fromCharCode.apply(null, new Uint8Array(1));
  2775. } catch (e) {
  2776. s = !1;
  2777. }
  2778. for (var h = new u.Buf8(256), n = 0; n < 256; n++)
  2779. h[n] = 252 <= n ? 6 : 248 <= n ? 5 : 240 <= n ? 4 : 224 <= n ? 3 : 192 <= n ? 2 : 1;
  2780. function f(e, t) {
  2781. if (t < 65537 && ((e.subarray && s) || (!e.subarray && i))) return String.fromCharCode.apply(null, u.shrinkBuf(e, t));
  2782. for (var r = "", n = 0; n < t; n++) r += String.fromCharCode(e[n]);
  2783. return r;
  2784. }
  2785. (h[254] = h[254] = 1),
  2786. (r.string2buf = function (e) {
  2787. var t,
  2788. r,
  2789. n,
  2790. i,
  2791. s,
  2792. a = e.length,
  2793. o = 0;
  2794. for (i = 0; i < a; i++)
  2795. 55296 == (64512 & (r = e.charCodeAt(i))) &&
  2796. i + 1 < a &&
  2797. 56320 == (64512 & (n = e.charCodeAt(i + 1))) &&
  2798. ((r = 65536 + ((r - 55296) << 10) + (n - 56320)), i++),
  2799. (o += r < 128 ? 1 : r < 2048 ? 2 : r < 65536 ? 3 : 4);
  2800. for (t = new u.Buf8(o), i = s = 0; s < o; i++)
  2801. 55296 == (64512 & (r = e.charCodeAt(i))) &&
  2802. i + 1 < a &&
  2803. 56320 == (64512 & (n = e.charCodeAt(i + 1))) &&
  2804. ((r = 65536 + ((r - 55296) << 10) + (n - 56320)), i++),
  2805. r < 128
  2806. ? (t[s++] = r)
  2807. : (r < 2048
  2808. ? (t[s++] = 192 | (r >>> 6))
  2809. : (r < 65536 ? (t[s++] = 224 | (r >>> 12)) : ((t[s++] = 240 | (r >>> 18)), (t[s++] = 128 | ((r >>> 12) & 63))),
  2810. (t[s++] = 128 | ((r >>> 6) & 63))),
  2811. (t[s++] = 128 | (63 & r)));
  2812. return t;
  2813. }),
  2814. (r.buf2binstring = function (e) {
  2815. return f(e, e.length);
  2816. }),
  2817. (r.binstring2buf = function (e) {
  2818. for (var t = new u.Buf8(e.length), r = 0, n = t.length; r < n; r++) t[r] = e.charCodeAt(r);
  2819. return t;
  2820. }),
  2821. (r.buf2string = function (e, t) {
  2822. var r,
  2823. n,
  2824. i,
  2825. s,
  2826. a = t || e.length,
  2827. o = new Array(2 * a);
  2828. for (r = n = 0; r < a; )
  2829. if ((i = e[r++]) < 128) o[n++] = i;
  2830. else if (4 < (s = h[i])) (o[n++] = 65533), (r += s - 1);
  2831. else {
  2832. for (i &= 2 === s ? 31 : 3 === s ? 15 : 7; 1 < s && r < a; ) (i = (i << 6) | (63 & e[r++])), s--;
  2833. 1 < s
  2834. ? (o[n++] = 65533)
  2835. : i < 65536
  2836. ? (o[n++] = i)
  2837. : ((i -= 65536), (o[n++] = 55296 | ((i >> 10) & 1023)), (o[n++] = 56320 | (1023 & i)));
  2838. }
  2839. return f(o, n);
  2840. }),
  2841. (r.utf8border = function (e, t) {
  2842. var r;
  2843. for ((t = t || e.length) > e.length && (t = e.length), r = t - 1; 0 <= r && 128 == (192 & e[r]); ) r--;
  2844. return r < 0 ? t : 0 === r ? t : r + h[e[r]] > t ? r : t;
  2845. });
  2846. },
  2847. { "./common": 41 },
  2848. ],
  2849. 43: [
  2850. function (e, t, r) {
  2851. "use strict";
  2852. t.exports = function (e, t, r, n) {
  2853. for (var i = (65535 & e) | 0, s = ((e >>> 16) & 65535) | 0, a = 0; 0 !== r; ) {
  2854. for (r -= a = 2e3 < r ? 2e3 : r; (s = (s + (i = (i + t[n++]) | 0)) | 0), --a; );
  2855. (i %= 65521), (s %= 65521);
  2856. }
  2857. return i | (s << 16) | 0;
  2858. };
  2859. },
  2860. {},
  2861. ],
  2862. 44: [
  2863. function (e, t, r) {
  2864. "use strict";
  2865. t.exports = {
  2866. Z_NO_FLUSH: 0,
  2867. Z_PARTIAL_FLUSH: 1,
  2868. Z_SYNC_FLUSH: 2,
  2869. Z_FULL_FLUSH: 3,
  2870. Z_FINISH: 4,
  2871. Z_BLOCK: 5,
  2872. Z_TREES: 6,
  2873. Z_OK: 0,
  2874. Z_STREAM_END: 1,
  2875. Z_NEED_DICT: 2,
  2876. Z_ERRNO: -1,
  2877. Z_STREAM_ERROR: -2,
  2878. Z_DATA_ERROR: -3,
  2879. Z_BUF_ERROR: -5,
  2880. Z_NO_COMPRESSION: 0,
  2881. Z_BEST_SPEED: 1,
  2882. Z_BEST_COMPRESSION: 9,
  2883. Z_DEFAULT_COMPRESSION: -1,
  2884. Z_FILTERED: 1,
  2885. Z_HUFFMAN_ONLY: 2,
  2886. Z_RLE: 3,
  2887. Z_FIXED: 4,
  2888. Z_DEFAULT_STRATEGY: 0,
  2889. Z_BINARY: 0,
  2890. Z_TEXT: 1,
  2891. Z_UNKNOWN: 2,
  2892. Z_DEFLATED: 8,
  2893. };
  2894. },
  2895. {},
  2896. ],
  2897. 45: [
  2898. function (e, t, r) {
  2899. "use strict";
  2900. var o = (function () {
  2901. for (var e, t = [], r = 0; r < 256; r++) {
  2902. e = r;
  2903. for (var n = 0; n < 8; n++) e = 1 & e ? 3988292384 ^ (e >>> 1) : e >>> 1;
  2904. t[r] = e;
  2905. }
  2906. return t;
  2907. })();
  2908. t.exports = function (e, t, r, n) {
  2909. var i = o,
  2910. s = n + r;
  2911. e ^= -1;
  2912. for (var a = n; a < s; a++) e = (e >>> 8) ^ i[255 & (e ^ t[a])];
  2913. return -1 ^ e;
  2914. };
  2915. },
  2916. {},
  2917. ],
  2918. 46: [
  2919. function (e, t, r) {
  2920. "use strict";
  2921. var u,
  2922. d = e("../utils/common"),
  2923. h = e("./trees"),
  2924. c = e("./adler32"),
  2925. p = e("./crc32"),
  2926. n = e("./messages"),
  2927. f = 0,
  2928. l = 0,
  2929. m = -2,
  2930. i = 2,
  2931. _ = 8,
  2932. s = 286,
  2933. a = 30,
  2934. o = 19,
  2935. g = 2 * s + 1,
  2936. v = 15,
  2937. b = 3,
  2938. w = 258,
  2939. y = w + b + 1,
  2940. k = 42,
  2941. x = 113;
  2942. function S(e, t) {
  2943. return (e.msg = n[t]), t;
  2944. }
  2945. function z(e) {
  2946. return (e << 1) - (4 < e ? 9 : 0);
  2947. }
  2948. function C(e) {
  2949. for (var t = e.length; 0 <= --t; ) e[t] = 0;
  2950. }
  2951. function E(e) {
  2952. var t = e.state,
  2953. r = t.pending;
  2954. r > e.avail_out && (r = e.avail_out),
  2955. 0 !== r &&
  2956. (d.arraySet(e.output, t.pending_buf, t.pending_out, r, e.next_out),
  2957. (e.next_out += r),
  2958. (t.pending_out += r),
  2959. (e.total_out += r),
  2960. (e.avail_out -= r),
  2961. (t.pending -= r),
  2962. 0 === t.pending && (t.pending_out = 0));
  2963. }
  2964. function A(e, t) {
  2965. h._tr_flush_block(e, 0 <= e.block_start ? e.block_start : -1, e.strstart - e.block_start, t),
  2966. (e.block_start = e.strstart),
  2967. E(e.strm);
  2968. }
  2969. function I(e, t) {
  2970. e.pending_buf[e.pending++] = t;
  2971. }
  2972. function O(e, t) {
  2973. (e.pending_buf[e.pending++] = (t >>> 8) & 255), (e.pending_buf[e.pending++] = 255 & t);
  2974. }
  2975. function B(e, t) {
  2976. var r,
  2977. n,
  2978. i = e.max_chain_length,
  2979. s = e.strstart,
  2980. a = e.prev_length,
  2981. o = e.nice_match,
  2982. u = e.strstart > e.w_size - y ? e.strstart - (e.w_size - y) : 0,
  2983. h = e.window,
  2984. f = e.w_mask,
  2985. l = e.prev,
  2986. d = e.strstart + w,
  2987. c = h[s + a - 1],
  2988. p = h[s + a];
  2989. e.prev_length >= e.good_match && (i >>= 2), o > e.lookahead && (o = e.lookahead);
  2990. do {
  2991. if (h[(r = t) + a] === p && h[r + a - 1] === c && h[r] === h[s] && h[++r] === h[s + 1]) {
  2992. (s += 2), r++;
  2993. do {} while (
  2994. h[++s] === h[++r] &&
  2995. h[++s] === h[++r] &&
  2996. h[++s] === h[++r] &&
  2997. h[++s] === h[++r] &&
  2998. h[++s] === h[++r] &&
  2999. h[++s] === h[++r] &&
  3000. h[++s] === h[++r] &&
  3001. h[++s] === h[++r] &&
  3002. s < d
  3003. );
  3004. if (((n = w - (d - s)), (s = d - w), a < n)) {
  3005. if (((e.match_start = t), o <= (a = n))) break;
  3006. (c = h[s + a - 1]), (p = h[s + a]);
  3007. }
  3008. }
  3009. } while ((t = l[t & f]) > u && 0 != --i);
  3010. return a <= e.lookahead ? a : e.lookahead;
  3011. }
  3012. function R(e) {
  3013. var t,
  3014. r,
  3015. n,
  3016. i,
  3017. s,
  3018. a,
  3019. o,
  3020. u,
  3021. h,
  3022. f,
  3023. l = e.w_size;
  3024. do {
  3025. if (((i = e.window_size - e.lookahead - e.strstart), e.strstart >= l + (l - y))) {
  3026. for (
  3027. 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;
  3028. (n = e.head[--t]), (e.head[t] = l <= n ? n - l : 0), --r;
  3029. );
  3030. for (t = r = l; (n = e.prev[--t]), (e.prev[t] = l <= n ? n - l : 0), --r; );
  3031. i += l;
  3032. }
  3033. if (0 === e.strm.avail_in) break;
  3034. if (
  3035. ((a = e.strm),
  3036. (o = e.window),
  3037. (u = e.strstart + e.lookahead),
  3038. (f = void 0),
  3039. (h = i) < (f = a.avail_in) && (f = h),
  3040. (r =
  3041. 0 === f
  3042. ? 0
  3043. : ((a.avail_in -= f),
  3044. d.arraySet(o, a.input, a.next_in, f, u),
  3045. 1 === a.state.wrap ? (a.adler = c(a.adler, o, f, u)) : 2 === a.state.wrap && (a.adler = p(a.adler, o, f, u)),
  3046. (a.next_in += f),
  3047. (a.total_in += f),
  3048. f)),
  3049. (e.lookahead += r),
  3050. e.lookahead + e.insert >= b)
  3051. )
  3052. for (
  3053. 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;
  3054. e.insert &&
  3055. ((e.ins_h = ((e.ins_h << e.hash_shift) ^ e.window[s + b - 1]) & e.hash_mask),
  3056. (e.prev[s & e.w_mask] = e.head[e.ins_h]),
  3057. (e.head[e.ins_h] = s),
  3058. s++,
  3059. e.insert--,
  3060. !(e.lookahead + e.insert < b));
  3061. );
  3062. } while (e.lookahead < y && 0 !== e.strm.avail_in);
  3063. }
  3064. function T(e, t) {
  3065. for (var r, n; ; ) {
  3066. if (e.lookahead < y) {
  3067. if ((R(e), e.lookahead < y && t === f)) return 1;
  3068. if (0 === e.lookahead) break;
  3069. }
  3070. if (
  3071. ((r = 0),
  3072. e.lookahead >= b &&
  3073. ((e.ins_h = ((e.ins_h << e.hash_shift) ^ e.window[e.strstart + b - 1]) & e.hash_mask),
  3074. (r = e.prev[e.strstart & e.w_mask] = e.head[e.ins_h]),
  3075. (e.head[e.ins_h] = e.strstart)),
  3076. 0 !== r && e.strstart - r <= e.w_size - y && (e.match_length = B(e, r)),
  3077. e.match_length >= b)
  3078. )
  3079. if (
  3080. ((n = h._tr_tally(e, e.strstart - e.match_start, e.match_length - b)),
  3081. (e.lookahead -= e.match_length),
  3082. e.match_length <= e.max_lazy_match && e.lookahead >= b)
  3083. ) {
  3084. for (
  3085. e.match_length--;
  3086. e.strstart++,
  3087. (e.ins_h = ((e.ins_h << e.hash_shift) ^ e.window[e.strstart + b - 1]) & e.hash_mask),
  3088. (r = e.prev[e.strstart & e.w_mask] = e.head[e.ins_h]),
  3089. (e.head[e.ins_h] = e.strstart),
  3090. 0 != --e.match_length;
  3091. );
  3092. e.strstart++;
  3093. } else
  3094. (e.strstart += e.match_length),
  3095. (e.match_length = 0),
  3096. (e.ins_h = e.window[e.strstart]),
  3097. (e.ins_h = ((e.ins_h << e.hash_shift) ^ e.window[e.strstart + 1]) & e.hash_mask);
  3098. else (n = h._tr_tally(e, 0, e.window[e.strstart])), e.lookahead--, e.strstart++;
  3099. if (n && (A(e, !1), 0 === e.strm.avail_out)) return 1;
  3100. }
  3101. return (
  3102. (e.insert = e.strstart < b - 1 ? e.strstart : b - 1),
  3103. 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
  3104. );
  3105. }
  3106. function D(e, t) {
  3107. for (var r, n, i; ; ) {
  3108. if (e.lookahead < y) {
  3109. if ((R(e), e.lookahead < y && t === f)) return 1;
  3110. if (0 === e.lookahead) break;
  3111. }
  3112. if (
  3113. ((r = 0),
  3114. e.lookahead >= b &&
  3115. ((e.ins_h = ((e.ins_h << e.hash_shift) ^ e.window[e.strstart + b - 1]) & e.hash_mask),
  3116. (r = e.prev[e.strstart & e.w_mask] = e.head[e.ins_h]),
  3117. (e.head[e.ins_h] = e.strstart)),
  3118. (e.prev_length = e.match_length),
  3119. (e.prev_match = e.match_start),
  3120. (e.match_length = b - 1),
  3121. 0 !== r &&
  3122. e.prev_length < e.max_lazy_match &&
  3123. e.strstart - r <= e.w_size - y &&
  3124. ((e.match_length = B(e, r)),
  3125. e.match_length <= 5 &&
  3126. (1 === e.strategy || (e.match_length === b && 4096 < e.strstart - e.match_start)) &&
  3127. (e.match_length = b - 1)),
  3128. e.prev_length >= b && e.match_length <= e.prev_length)
  3129. ) {
  3130. for (
  3131. i = e.strstart + e.lookahead - b,
  3132. n = h._tr_tally(e, e.strstart - 1 - e.prev_match, e.prev_length - b),
  3133. e.lookahead -= e.prev_length - 1,
  3134. e.prev_length -= 2;
  3135. ++e.strstart <= i &&
  3136. ((e.ins_h = ((e.ins_h << e.hash_shift) ^ e.window[e.strstart + b - 1]) & e.hash_mask),
  3137. (r = e.prev[e.strstart & e.w_mask] = e.head[e.ins_h]),
  3138. (e.head[e.ins_h] = e.strstart)),
  3139. 0 != --e.prev_length;
  3140. );
  3141. if (((e.match_available = 0), (e.match_length = b - 1), e.strstart++, n && (A(e, !1), 0 === e.strm.avail_out))) return 1;
  3142. } else if (e.match_available) {
  3143. if (((n = h._tr_tally(e, 0, e.window[e.strstart - 1])) && A(e, !1), e.strstart++, e.lookahead--, 0 === e.strm.avail_out))
  3144. return 1;
  3145. } else (e.match_available = 1), e.strstart++, e.lookahead--;
  3146. }
  3147. return (
  3148. e.match_available && ((n = h._tr_tally(e, 0, e.window[e.strstart - 1])), (e.match_available = 0)),
  3149. (e.insert = e.strstart < b - 1 ? e.strstart : b - 1),
  3150. 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
  3151. );
  3152. }
  3153. function F(e, t, r, n, i) {
  3154. (this.good_length = e), (this.max_lazy = t), (this.nice_length = r), (this.max_chain = n), (this.func = i);
  3155. }
  3156. function N() {
  3157. (this.strm = null),
  3158. (this.status = 0),
  3159. (this.pending_buf = null),
  3160. (this.pending_buf_size = 0),
  3161. (this.pending_out = 0),
  3162. (this.pending = 0),
  3163. (this.wrap = 0),
  3164. (this.gzhead = null),
  3165. (this.gzindex = 0),
  3166. (this.method = _),
  3167. (this.last_flush = -1),
  3168. (this.w_size = 0),
  3169. (this.w_bits = 0),
  3170. (this.w_mask = 0),
  3171. (this.window = null),
  3172. (this.window_size = 0),
  3173. (this.prev = null),
  3174. (this.head = null),
  3175. (this.ins_h = 0),
  3176. (this.hash_size = 0),
  3177. (this.hash_bits = 0),
  3178. (this.hash_mask = 0),
  3179. (this.hash_shift = 0),
  3180. (this.block_start = 0),
  3181. (this.match_length = 0),
  3182. (this.prev_match = 0),
  3183. (this.match_available = 0),
  3184. (this.strstart = 0),
  3185. (this.match_start = 0),
  3186. (this.lookahead = 0),
  3187. (this.prev_length = 0),
  3188. (this.max_chain_length = 0),
  3189. (this.max_lazy_match = 0),
  3190. (this.level = 0),
  3191. (this.strategy = 0),
  3192. (this.good_match = 0),
  3193. (this.nice_match = 0),
  3194. (this.dyn_ltree = new d.Buf16(2 * g)),
  3195. (this.dyn_dtree = new d.Buf16(2 * (2 * a + 1))),
  3196. (this.bl_tree = new d.Buf16(2 * (2 * o + 1))),
  3197. C(this.dyn_ltree),
  3198. C(this.dyn_dtree),
  3199. C(this.bl_tree),
  3200. (this.l_desc = null),
  3201. (this.d_desc = null),
  3202. (this.bl_desc = null),
  3203. (this.bl_count = new d.Buf16(v + 1)),
  3204. (this.heap = new d.Buf16(2 * s + 1)),
  3205. C(this.heap),
  3206. (this.heap_len = 0),
  3207. (this.heap_max = 0),
  3208. (this.depth = new d.Buf16(2 * s + 1)),
  3209. C(this.depth),
  3210. (this.l_buf = 0),
  3211. (this.lit_bufsize = 0),
  3212. (this.last_lit = 0),
  3213. (this.d_buf = 0),
  3214. (this.opt_len = 0),
  3215. (this.static_len = 0),
  3216. (this.matches = 0),
  3217. (this.insert = 0),
  3218. (this.bi_buf = 0),
  3219. (this.bi_valid = 0);
  3220. }
  3221. function U(e) {
  3222. var t;
  3223. return e && e.state
  3224. ? ((e.total_in = e.total_out = 0),
  3225. (e.data_type = i),
  3226. ((t = e.state).pending = 0),
  3227. (t.pending_out = 0),
  3228. t.wrap < 0 && (t.wrap = -t.wrap),
  3229. (t.status = t.wrap ? k : x),
  3230. (e.adler = 2 === t.wrap ? 0 : 1),
  3231. (t.last_flush = f),
  3232. h._tr_init(t),
  3233. l)
  3234. : S(e, m);
  3235. }
  3236. function P(e) {
  3237. var t,
  3238. r = U(e);
  3239. return (
  3240. r === l &&
  3241. (((t = e.state).window_size = 2 * t.w_size),
  3242. C(t.head),
  3243. (t.max_lazy_match = u[t.level].max_lazy),
  3244. (t.good_match = u[t.level].good_length),
  3245. (t.nice_match = u[t.level].nice_length),
  3246. (t.max_chain_length = u[t.level].max_chain),
  3247. (t.strstart = 0),
  3248. (t.block_start = 0),
  3249. (t.lookahead = 0),
  3250. (t.insert = 0),
  3251. (t.match_length = t.prev_length = b - 1),
  3252. (t.match_available = 0),
  3253. (t.ins_h = 0)),
  3254. r
  3255. );
  3256. }
  3257. function L(e, t, r, n, i, s) {
  3258. if (!e) return m;
  3259. var a = 1;
  3260. if (
  3261. (-1 === t && (t = 6),
  3262. n < 0 ? ((a = 0), (n = -n)) : 15 < n && ((a = 2), (n -= 16)),
  3263. i < 1 || 9 < i || r !== _ || n < 8 || 15 < n || t < 0 || 9 < t || s < 0 || 4 < s)
  3264. )
  3265. return S(e, m);
  3266. 8 === n && (n = 9);
  3267. var o = new N();
  3268. return (
  3269. ((e.state = o).strm = e),
  3270. (o.wrap = a),
  3271. (o.gzhead = null),
  3272. (o.w_bits = n),
  3273. (o.w_size = 1 << o.w_bits),
  3274. (o.w_mask = o.w_size - 1),
  3275. (o.hash_bits = i + 7),
  3276. (o.hash_size = 1 << o.hash_bits),
  3277. (o.hash_mask = o.hash_size - 1),
  3278. (o.hash_shift = ~~((o.hash_bits + b - 1) / b)),
  3279. (o.window = new d.Buf8(2 * o.w_size)),
  3280. (o.head = new d.Buf16(o.hash_size)),
  3281. (o.prev = new d.Buf16(o.w_size)),
  3282. (o.lit_bufsize = 1 << (i + 6)),
  3283. (o.pending_buf_size = 4 * o.lit_bufsize),
  3284. (o.pending_buf = new d.Buf8(o.pending_buf_size)),
  3285. (o.d_buf = 1 * o.lit_bufsize),
  3286. (o.l_buf = 3 * o.lit_bufsize),
  3287. (o.level = t),
  3288. (o.strategy = s),
  3289. (o.method = r),
  3290. P(e)
  3291. );
  3292. }
  3293. (u = [
  3294. new F(0, 0, 0, 0, function (e, t) {
  3295. var r = 65535;
  3296. for (r > e.pending_buf_size - 5 && (r = e.pending_buf_size - 5); ; ) {
  3297. if (e.lookahead <= 1) {
  3298. if ((R(e), 0 === e.lookahead && t === f)) return 1;
  3299. if (0 === e.lookahead) break;
  3300. }
  3301. (e.strstart += e.lookahead), (e.lookahead = 0);
  3302. var n = e.block_start + r;
  3303. if (
  3304. (0 === e.strstart || e.strstart >= n) &&
  3305. ((e.lookahead = e.strstart - n), (e.strstart = n), A(e, !1), 0 === e.strm.avail_out)
  3306. )
  3307. return 1;
  3308. if (e.strstart - e.block_start >= e.w_size - y && (A(e, !1), 0 === e.strm.avail_out)) return 1;
  3309. }
  3310. return (
  3311. (e.insert = 0),
  3312. 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)
  3313. );
  3314. }),
  3315. new F(4, 4, 8, 4, T),
  3316. new F(4, 5, 16, 8, T),
  3317. new F(4, 6, 32, 32, T),
  3318. new F(4, 4, 16, 16, D),
  3319. new F(8, 16, 32, 32, D),
  3320. new F(8, 16, 128, 128, D),
  3321. new F(8, 32, 128, 256, D),
  3322. new F(32, 128, 258, 1024, D),
  3323. new F(32, 258, 258, 4096, D),
  3324. ]),
  3325. (r.deflateInit = function (e, t) {
  3326. return L(e, t, _, 15, 8, 0);
  3327. }),
  3328. (r.deflateInit2 = L),
  3329. (r.deflateReset = P),
  3330. (r.deflateResetKeep = U),
  3331. (r.deflateSetHeader = function (e, t) {
  3332. return e && e.state ? (2 !== e.state.wrap ? m : ((e.state.gzhead = t), l)) : m;
  3333. }),
  3334. (r.deflate = function (e, t) {
  3335. var r, n, i, s;
  3336. if (!e || !e.state || 5 < t || t < 0) return e ? S(e, m) : m;
  3337. if (((n = e.state), !e.output || (!e.input && 0 !== e.avail_in) || (666 === n.status && 4 !== t)))
  3338. return S(e, 0 === e.avail_out ? -5 : m);
  3339. if (((n.strm = e), (r = n.last_flush), (n.last_flush = t), n.status === k))
  3340. if (2 === n.wrap)
  3341. (e.adler = 0),
  3342. I(n, 31),
  3343. I(n, 139),
  3344. I(n, 8),
  3345. n.gzhead
  3346. ? (I(
  3347. n,
  3348. (n.gzhead.text ? 1 : 0) +
  3349. (n.gzhead.hcrc ? 2 : 0) +
  3350. (n.gzhead.extra ? 4 : 0) +
  3351. (n.gzhead.name ? 8 : 0) +
  3352. (n.gzhead.comment ? 16 : 0)
  3353. ),
  3354. I(n, 255 & n.gzhead.time),
  3355. I(n, (n.gzhead.time >> 8) & 255),
  3356. I(n, (n.gzhead.time >> 16) & 255),
  3357. I(n, (n.gzhead.time >> 24) & 255),
  3358. I(n, 9 === n.level ? 2 : 2 <= n.strategy || n.level < 2 ? 4 : 0),
  3359. I(n, 255 & n.gzhead.os),
  3360. n.gzhead.extra &&
  3361. n.gzhead.extra.length &&
  3362. (I(n, 255 & n.gzhead.extra.length), I(n, (n.gzhead.extra.length >> 8) & 255)),
  3363. n.gzhead.hcrc && (e.adler = p(e.adler, n.pending_buf, n.pending, 0)),
  3364. (n.gzindex = 0),
  3365. (n.status = 69))
  3366. : (I(n, 0),
  3367. I(n, 0),
  3368. I(n, 0),
  3369. I(n, 0),
  3370. I(n, 0),
  3371. I(n, 9 === n.level ? 2 : 2 <= n.strategy || n.level < 2 ? 4 : 0),
  3372. I(n, 3),
  3373. (n.status = x));
  3374. else {
  3375. var a = (_ + ((n.w_bits - 8) << 4)) << 8;
  3376. (a |= (2 <= n.strategy || n.level < 2 ? 0 : n.level < 6 ? 1 : 6 === n.level ? 2 : 3) << 6),
  3377. 0 !== n.strstart && (a |= 32),
  3378. (a += 31 - (a % 31)),
  3379. (n.status = x),
  3380. O(n, a),
  3381. 0 !== n.strstart && (O(n, e.adler >>> 16), O(n, 65535 & e.adler)),
  3382. (e.adler = 1);
  3383. }
  3384. if (69 === n.status)
  3385. if (n.gzhead.extra) {
  3386. for (
  3387. i = n.pending;
  3388. n.gzindex < (65535 & n.gzhead.extra.length) &&
  3389. (n.pending !== n.pending_buf_size ||
  3390. (n.gzhead.hcrc && n.pending > i && (e.adler = p(e.adler, n.pending_buf, n.pending - i, i)),
  3391. E(e),
  3392. (i = n.pending),
  3393. n.pending !== n.pending_buf_size));
  3394. )
  3395. I(n, 255 & n.gzhead.extra[n.gzindex]), n.gzindex++;
  3396. n.gzhead.hcrc && n.pending > i && (e.adler = p(e.adler, n.pending_buf, n.pending - i, i)),
  3397. n.gzindex === n.gzhead.extra.length && ((n.gzindex = 0), (n.status = 73));
  3398. } else n.status = 73;
  3399. if (73 === n.status)
  3400. if (n.gzhead.name) {
  3401. i = n.pending;
  3402. do {
  3403. if (
  3404. n.pending === n.pending_buf_size &&
  3405. (n.gzhead.hcrc && n.pending > i && (e.adler = p(e.adler, n.pending_buf, n.pending - i, i)),
  3406. E(e),
  3407. (i = n.pending),
  3408. n.pending === n.pending_buf_size)
  3409. ) {
  3410. s = 1;
  3411. break;
  3412. }
  3413. (s = n.gzindex < n.gzhead.name.length ? 255 & n.gzhead.name.charCodeAt(n.gzindex++) : 0), I(n, s);
  3414. } while (0 !== s);
  3415. n.gzhead.hcrc && n.pending > i && (e.adler = p(e.adler, n.pending_buf, n.pending - i, i)),
  3416. 0 === s && ((n.gzindex = 0), (n.status = 91));
  3417. } else n.status = 91;
  3418. if (91 === n.status)
  3419. if (n.gzhead.comment) {
  3420. i = n.pending;
  3421. do {
  3422. if (
  3423. n.pending === n.pending_buf_size &&
  3424. (n.gzhead.hcrc && n.pending > i && (e.adler = p(e.adler, n.pending_buf, n.pending - i, i)),
  3425. E(e),
  3426. (i = n.pending),
  3427. n.pending === n.pending_buf_size)
  3428. ) {
  3429. s = 1;
  3430. break;
  3431. }
  3432. (s = n.gzindex < n.gzhead.comment.length ? 255 & n.gzhead.comment.charCodeAt(n.gzindex++) : 0), I(n, s);
  3433. } while (0 !== s);
  3434. n.gzhead.hcrc && n.pending > i && (e.adler = p(e.adler, n.pending_buf, n.pending - i, i)), 0 === s && (n.status = 103);
  3435. } else n.status = 103;
  3436. if (
  3437. (103 === n.status &&
  3438. (n.gzhead.hcrc
  3439. ? (n.pending + 2 > n.pending_buf_size && E(e),
  3440. n.pending + 2 <= n.pending_buf_size &&
  3441. (I(n, 255 & e.adler), I(n, (e.adler >> 8) & 255), (e.adler = 0), (n.status = x)))
  3442. : (n.status = x)),
  3443. 0 !== n.pending)
  3444. ) {
  3445. if ((E(e), 0 === e.avail_out)) return (n.last_flush = -1), l;
  3446. } else if (0 === e.avail_in && z(t) <= z(r) && 4 !== t) return S(e, -5);
  3447. if (666 === n.status && 0 !== e.avail_in) return S(e, -5);
  3448. if (0 !== e.avail_in || 0 !== n.lookahead || (t !== f && 666 !== n.status)) {
  3449. var o =
  3450. 2 === n.strategy
  3451. ? (function (e, t) {
  3452. for (var r; ; ) {
  3453. if (0 === e.lookahead && (R(e), 0 === e.lookahead)) {
  3454. if (t === f) return 1;
  3455. break;
  3456. }
  3457. if (
  3458. ((e.match_length = 0),
  3459. (r = h._tr_tally(e, 0, e.window[e.strstart])),
  3460. e.lookahead--,
  3461. e.strstart++,
  3462. r && (A(e, !1), 0 === e.strm.avail_out))
  3463. )
  3464. return 1;
  3465. }
  3466. return (
  3467. (e.insert = 0),
  3468. 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
  3469. );
  3470. })(n, t)
  3471. : 3 === n.strategy
  3472. ? (function (e, t) {
  3473. for (var r, n, i, s, a = e.window; ; ) {
  3474. if (e.lookahead <= w) {
  3475. if ((R(e), e.lookahead <= w && t === f)) return 1;
  3476. if (0 === e.lookahead) break;
  3477. }
  3478. if (
  3479. ((e.match_length = 0),
  3480. e.lookahead >= b && 0 < e.strstart && (n = a[(i = e.strstart - 1)]) === a[++i] && n === a[++i] && n === a[++i])
  3481. ) {
  3482. s = e.strstart + w;
  3483. do {} while (
  3484. n === a[++i] &&
  3485. n === a[++i] &&
  3486. n === a[++i] &&
  3487. n === a[++i] &&
  3488. n === a[++i] &&
  3489. n === a[++i] &&
  3490. n === a[++i] &&
  3491. n === a[++i] &&
  3492. i < s
  3493. );
  3494. (e.match_length = w - (s - i)), e.match_length > e.lookahead && (e.match_length = e.lookahead);
  3495. }
  3496. if (
  3497. (e.match_length >= b
  3498. ? ((r = h._tr_tally(e, 1, e.match_length - b)),
  3499. (e.lookahead -= e.match_length),
  3500. (e.strstart += e.match_length),
  3501. (e.match_length = 0))
  3502. : ((r = h._tr_tally(e, 0, e.window[e.strstart])), e.lookahead--, e.strstart++),
  3503. r && (A(e, !1), 0 === e.strm.avail_out))
  3504. )
  3505. return 1;
  3506. }
  3507. return (
  3508. (e.insert = 0),
  3509. 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
  3510. );
  3511. })(n, t)
  3512. : u[n.level].func(n, t);
  3513. if (((3 !== o && 4 !== o) || (n.status = 666), 1 === o || 3 === o)) return 0 === e.avail_out && (n.last_flush = -1), l;
  3514. if (
  3515. 2 === o &&
  3516. (1 === t
  3517. ? h._tr_align(n)
  3518. : 5 !== t &&
  3519. (h._tr_stored_block(n, 0, 0, !1),
  3520. 3 === t && (C(n.head), 0 === n.lookahead && ((n.strstart = 0), (n.block_start = 0), (n.insert = 0)))),
  3521. E(e),
  3522. 0 === e.avail_out)
  3523. )
  3524. return (n.last_flush = -1), l;
  3525. }
  3526. return 4 !== t
  3527. ? l
  3528. : n.wrap <= 0
  3529. ? 1
  3530. : (2 === n.wrap
  3531. ? (I(n, 255 & e.adler),
  3532. I(n, (e.adler >> 8) & 255),
  3533. I(n, (e.adler >> 16) & 255),
  3534. I(n, (e.adler >> 24) & 255),
  3535. I(n, 255 & e.total_in),
  3536. I(n, (e.total_in >> 8) & 255),
  3537. I(n, (e.total_in >> 16) & 255),
  3538. I(n, (e.total_in >> 24) & 255))
  3539. : (O(n, e.adler >>> 16), O(n, 65535 & e.adler)),
  3540. E(e),
  3541. 0 < n.wrap && (n.wrap = -n.wrap),
  3542. 0 !== n.pending ? l : 1);
  3543. }),
  3544. (r.deflateEnd = function (e) {
  3545. var t;
  3546. return e && e.state
  3547. ? (t = e.state.status) !== k && 69 !== t && 73 !== t && 91 !== t && 103 !== t && t !== x && 666 !== t
  3548. ? S(e, m)
  3549. : ((e.state = null), t === x ? S(e, -3) : l)
  3550. : m;
  3551. }),
  3552. (r.deflateSetDictionary = function (e, t) {
  3553. var r,
  3554. n,
  3555. i,
  3556. s,
  3557. a,
  3558. o,
  3559. u,
  3560. h,
  3561. f = t.length;
  3562. if (!e || !e.state) return m;
  3563. if (2 === (s = (r = e.state).wrap) || (1 === s && r.status !== k) || r.lookahead) return m;
  3564. for (
  3565. 1 === s && (e.adler = c(e.adler, t, f, 0)),
  3566. r.wrap = 0,
  3567. f >= r.w_size &&
  3568. (0 === s && (C(r.head), (r.strstart = 0), (r.block_start = 0), (r.insert = 0)),
  3569. (h = new d.Buf8(r.w_size)),
  3570. d.arraySet(h, t, f - r.w_size, r.w_size, 0),
  3571. (t = h),
  3572. (f = r.w_size)),
  3573. a = e.avail_in,
  3574. o = e.next_in,
  3575. u = e.input,
  3576. e.avail_in = f,
  3577. e.next_in = 0,
  3578. e.input = t,
  3579. R(r);
  3580. r.lookahead >= b;
  3581. ) {
  3582. for (
  3583. n = r.strstart, i = r.lookahead - (b - 1);
  3584. (r.ins_h = ((r.ins_h << r.hash_shift) ^ r.window[n + b - 1]) & r.hash_mask),
  3585. (r.prev[n & r.w_mask] = r.head[r.ins_h]),
  3586. (r.head[r.ins_h] = n),
  3587. n++,
  3588. --i;
  3589. );
  3590. (r.strstart = n), (r.lookahead = b - 1), R(r);
  3591. }
  3592. return (
  3593. (r.strstart += r.lookahead),
  3594. (r.block_start = r.strstart),
  3595. (r.insert = r.lookahead),
  3596. (r.lookahead = 0),
  3597. (r.match_length = r.prev_length = b - 1),
  3598. (r.match_available = 0),
  3599. (e.next_in = o),
  3600. (e.input = u),
  3601. (e.avail_in = a),
  3602. (r.wrap = s),
  3603. l
  3604. );
  3605. }),
  3606. (r.deflateInfo = "pako deflate (from Nodeca project)");
  3607. },
  3608. { "../utils/common": 41, "./adler32": 43, "./crc32": 45, "./messages": 51, "./trees": 52 },
  3609. ],
  3610. 47: [
  3611. function (e, t, r) {
  3612. "use strict";
  3613. t.exports = function () {
  3614. (this.text = 0),
  3615. (this.time = 0),
  3616. (this.xflags = 0),
  3617. (this.os = 0),
  3618. (this.extra = null),
  3619. (this.extra_len = 0),
  3620. (this.name = ""),
  3621. (this.comment = ""),
  3622. (this.hcrc = 0),
  3623. (this.done = !1);
  3624. };
  3625. },
  3626. {},
  3627. ],
  3628. 48: [
  3629. function (e, t, r) {
  3630. "use strict";
  3631. t.exports = function (e, t) {
  3632. var r, n, i, s, a, o, u, h, f, l, d, c, p, m, _, g, v, b, w, y, k, x, S, z, C;
  3633. (r = e.state),
  3634. (n = e.next_in),
  3635. (z = e.input),
  3636. (i = n + (e.avail_in - 5)),
  3637. (s = e.next_out),
  3638. (C = e.output),
  3639. (a = s - (t - e.avail_out)),
  3640. (o = s + (e.avail_out - 257)),
  3641. (u = r.dmax),
  3642. (h = r.wsize),
  3643. (f = r.whave),
  3644. (l = r.wnext),
  3645. (d = r.window),
  3646. (c = r.hold),
  3647. (p = r.bits),
  3648. (m = r.lencode),
  3649. (_ = r.distcode),
  3650. (g = (1 << r.lenbits) - 1),
  3651. (v = (1 << r.distbits) - 1);
  3652. e: do {
  3653. p < 15 && ((c += z[n++] << p), (p += 8), (c += z[n++] << p), (p += 8)), (b = m[c & g]);
  3654. t: for (;;) {
  3655. if (((c >>>= w = b >>> 24), (p -= w), 0 == (w = (b >>> 16) & 255))) C[s++] = 65535 & b;
  3656. else {
  3657. if (!(16 & w)) {
  3658. if (0 == (64 & w)) {
  3659. b = m[(65535 & b) + (c & ((1 << w) - 1))];
  3660. continue t;
  3661. }
  3662. if (32 & w) {
  3663. r.mode = 12;
  3664. break e;
  3665. }
  3666. (e.msg = "invalid literal/length code"), (r.mode = 30);
  3667. break e;
  3668. }
  3669. (y = 65535 & b),
  3670. (w &= 15) && (p < w && ((c += z[n++] << p), (p += 8)), (y += c & ((1 << w) - 1)), (c >>>= w), (p -= w)),
  3671. p < 15 && ((c += z[n++] << p), (p += 8), (c += z[n++] << p), (p += 8)),
  3672. (b = _[c & v]);
  3673. r: for (;;) {
  3674. if (((c >>>= w = b >>> 24), (p -= w), !(16 & (w = (b >>> 16) & 255)))) {
  3675. if (0 == (64 & w)) {
  3676. b = _[(65535 & b) + (c & ((1 << w) - 1))];
  3677. continue r;
  3678. }
  3679. (e.msg = "invalid distance code"), (r.mode = 30);
  3680. break e;
  3681. }
  3682. if (
  3683. ((k = 65535 & b),
  3684. p < (w &= 15) && ((c += z[n++] << p), (p += 8) < w && ((c += z[n++] << p), (p += 8))),
  3685. u < (k += c & ((1 << w) - 1)))
  3686. ) {
  3687. (e.msg = "invalid distance too far back"), (r.mode = 30);
  3688. break e;
  3689. }
  3690. if (((c >>>= w), (p -= w), (w = s - a) < k)) {
  3691. if (f < (w = k - w) && r.sane) {
  3692. (e.msg = "invalid distance too far back"), (r.mode = 30);
  3693. break e;
  3694. }
  3695. if (((S = d), (x = 0) === l)) {
  3696. if (((x += h - w), w < y)) {
  3697. for (y -= w; (C[s++] = d[x++]), --w; );
  3698. (x = s - k), (S = C);
  3699. }
  3700. } else if (l < w) {
  3701. if (((x += h + l - w), (w -= l) < y)) {
  3702. for (y -= w; (C[s++] = d[x++]), --w; );
  3703. if (((x = 0), l < y)) {
  3704. for (y -= w = l; (C[s++] = d[x++]), --w; );
  3705. (x = s - k), (S = C);
  3706. }
  3707. }
  3708. } else if (((x += l - w), w < y)) {
  3709. for (y -= w; (C[s++] = d[x++]), --w; );
  3710. (x = s - k), (S = C);
  3711. }
  3712. for (; 2 < y; ) (C[s++] = S[x++]), (C[s++] = S[x++]), (C[s++] = S[x++]), (y -= 3);
  3713. y && ((C[s++] = S[x++]), 1 < y && (C[s++] = S[x++]));
  3714. } else {
  3715. for (x = s - k; (C[s++] = C[x++]), (C[s++] = C[x++]), (C[s++] = C[x++]), 2 < (y -= 3); );
  3716. y && ((C[s++] = C[x++]), 1 < y && (C[s++] = C[x++]));
  3717. }
  3718. break;
  3719. }
  3720. }
  3721. break;
  3722. }
  3723. } while (n < i && s < o);
  3724. (n -= y = p >> 3),
  3725. (c &= (1 << (p -= y << 3)) - 1),
  3726. (e.next_in = n),
  3727. (e.next_out = s),
  3728. (e.avail_in = n < i ? i - n + 5 : 5 - (n - i)),
  3729. (e.avail_out = s < o ? o - s + 257 : 257 - (s - o)),
  3730. (r.hold = c),
  3731. (r.bits = p);
  3732. };
  3733. },
  3734. {},
  3735. ],
  3736. 49: [
  3737. function (e, t, r) {
  3738. "use strict";
  3739. var I = e("../utils/common"),
  3740. O = e("./adler32"),
  3741. B = e("./crc32"),
  3742. R = e("./inffast"),
  3743. T = e("./inftrees"),
  3744. D = 1,
  3745. F = 2,
  3746. N = 0,
  3747. U = -2,
  3748. P = 1,
  3749. n = 852,
  3750. i = 592;
  3751. function L(e) {
  3752. return ((e >>> 24) & 255) + ((e >>> 8) & 65280) + ((65280 & e) << 8) + ((255 & e) << 24);
  3753. }
  3754. function s() {
  3755. (this.mode = 0),
  3756. (this.last = !1),
  3757. (this.wrap = 0),
  3758. (this.havedict = !1),
  3759. (this.flags = 0),
  3760. (this.dmax = 0),
  3761. (this.check = 0),
  3762. (this.total = 0),
  3763. (this.head = null),
  3764. (this.wbits = 0),
  3765. (this.wsize = 0),
  3766. (this.whave = 0),
  3767. (this.wnext = 0),
  3768. (this.window = null),
  3769. (this.hold = 0),
  3770. (this.bits = 0),
  3771. (this.length = 0),
  3772. (this.offset = 0),
  3773. (this.extra = 0),
  3774. (this.lencode = null),
  3775. (this.distcode = null),
  3776. (this.lenbits = 0),
  3777. (this.distbits = 0),
  3778. (this.ncode = 0),
  3779. (this.nlen = 0),
  3780. (this.ndist = 0),
  3781. (this.have = 0),
  3782. (this.next = null),
  3783. (this.lens = new I.Buf16(320)),
  3784. (this.work = new I.Buf16(288)),
  3785. (this.lendyn = null),
  3786. (this.distdyn = null),
  3787. (this.sane = 0),
  3788. (this.back = 0),
  3789. (this.was = 0);
  3790. }
  3791. function a(e) {
  3792. var t;
  3793. return e && e.state
  3794. ? ((t = e.state),
  3795. (e.total_in = e.total_out = t.total = 0),
  3796. (e.msg = ""),
  3797. t.wrap && (e.adler = 1 & t.wrap),
  3798. (t.mode = P),
  3799. (t.last = 0),
  3800. (t.havedict = 0),
  3801. (t.dmax = 32768),
  3802. (t.head = null),
  3803. (t.hold = 0),
  3804. (t.bits = 0),
  3805. (t.lencode = t.lendyn = new I.Buf32(n)),
  3806. (t.distcode = t.distdyn = new I.Buf32(i)),
  3807. (t.sane = 1),
  3808. (t.back = -1),
  3809. N)
  3810. : U;
  3811. }
  3812. function o(e) {
  3813. var t;
  3814. return e && e.state ? (((t = e.state).wsize = 0), (t.whave = 0), (t.wnext = 0), a(e)) : U;
  3815. }
  3816. function u(e, t) {
  3817. var r, n;
  3818. return e && e.state
  3819. ? ((n = e.state),
  3820. t < 0 ? ((r = 0), (t = -t)) : ((r = 1 + (t >> 4)), t < 48 && (t &= 15)),
  3821. t && (t < 8 || 15 < t) ? U : (null !== n.window && n.wbits !== t && (n.window = null), (n.wrap = r), (n.wbits = t), o(e)))
  3822. : U;
  3823. }
  3824. function h(e, t) {
  3825. var r, n;
  3826. return e ? ((n = new s()), ((e.state = n).window = null), (r = u(e, t)) !== N && (e.state = null), r) : U;
  3827. }
  3828. var f,
  3829. l,
  3830. d = !0;
  3831. function j(e) {
  3832. if (d) {
  3833. var t;
  3834. for (f = new I.Buf32(512), l = new I.Buf32(32), t = 0; t < 144; ) e.lens[t++] = 8;
  3835. for (; t < 256; ) e.lens[t++] = 9;
  3836. for (; t < 280; ) e.lens[t++] = 7;
  3837. for (; t < 288; ) e.lens[t++] = 8;
  3838. for (T(D, e.lens, 0, 288, f, 0, e.work, { bits: 9 }), t = 0; t < 32; ) e.lens[t++] = 5;
  3839. T(F, e.lens, 0, 32, l, 0, e.work, { bits: 5 }), (d = !1);
  3840. }
  3841. (e.lencode = f), (e.lenbits = 9), (e.distcode = l), (e.distbits = 5);
  3842. }
  3843. function Z(e, t, r, n) {
  3844. var i,
  3845. s = e.state;
  3846. return (
  3847. null === s.window && ((s.wsize = 1 << s.wbits), (s.wnext = 0), (s.whave = 0), (s.window = new I.Buf8(s.wsize))),
  3848. n >= s.wsize
  3849. ? (I.arraySet(s.window, t, r - s.wsize, s.wsize, 0), (s.wnext = 0), (s.whave = s.wsize))
  3850. : (n < (i = s.wsize - s.wnext) && (i = n),
  3851. I.arraySet(s.window, t, r - n, i, s.wnext),
  3852. (n -= i)
  3853. ? (I.arraySet(s.window, t, r - n, n, 0), (s.wnext = n), (s.whave = s.wsize))
  3854. : ((s.wnext += i), s.wnext === s.wsize && (s.wnext = 0), s.whave < s.wsize && (s.whave += i))),
  3855. 0
  3856. );
  3857. }
  3858. (r.inflateReset = o),
  3859. (r.inflateReset2 = u),
  3860. (r.inflateResetKeep = a),
  3861. (r.inflateInit = function (e) {
  3862. return h(e, 15);
  3863. }),
  3864. (r.inflateInit2 = h),
  3865. (r.inflate = function (e, t) {
  3866. var r,
  3867. n,
  3868. i,
  3869. s,
  3870. a,
  3871. o,
  3872. u,
  3873. h,
  3874. f,
  3875. l,
  3876. d,
  3877. c,
  3878. p,
  3879. m,
  3880. _,
  3881. g,
  3882. v,
  3883. b,
  3884. w,
  3885. y,
  3886. k,
  3887. x,
  3888. S,
  3889. z,
  3890. C = 0,
  3891. E = new I.Buf8(4),
  3892. A = [16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15];
  3893. if (!e || !e.state || !e.output || (!e.input && 0 !== e.avail_in)) return U;
  3894. 12 === (r = e.state).mode && (r.mode = 13),
  3895. (a = e.next_out),
  3896. (i = e.output),
  3897. (u = e.avail_out),
  3898. (s = e.next_in),
  3899. (n = e.input),
  3900. (o = e.avail_in),
  3901. (h = r.hold),
  3902. (f = r.bits),
  3903. (l = o),
  3904. (d = u),
  3905. (x = N);
  3906. e: for (;;)
  3907. switch (r.mode) {
  3908. case P:
  3909. if (0 === r.wrap) {
  3910. r.mode = 13;
  3911. break;
  3912. }
  3913. for (; f < 16; ) {
  3914. if (0 === o) break e;
  3915. o--, (h += n[s++] << f), (f += 8);
  3916. }
  3917. if (2 & r.wrap && 35615 === h) {
  3918. (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);
  3919. break;
  3920. }
  3921. if (((r.flags = 0), r.head && (r.head.done = !1), !(1 & r.wrap) || (((255 & h) << 8) + (h >> 8)) % 31)) {
  3922. (e.msg = "incorrect header check"), (r.mode = 30);
  3923. break;
  3924. }
  3925. if (8 != (15 & h)) {
  3926. (e.msg = "unknown compression method"), (r.mode = 30);
  3927. break;
  3928. }
  3929. if (((f -= 4), (k = 8 + (15 & (h >>>= 4))), 0 === r.wbits)) r.wbits = k;
  3930. else if (k > r.wbits) {
  3931. (e.msg = "invalid window size"), (r.mode = 30);
  3932. break;
  3933. }
  3934. (r.dmax = 1 << k), (e.adler = r.check = 1), (r.mode = 512 & h ? 10 : 12), (f = h = 0);
  3935. break;
  3936. case 2:
  3937. for (; f < 16; ) {
  3938. if (0 === o) break e;
  3939. o--, (h += n[s++] << f), (f += 8);
  3940. }
  3941. if (((r.flags = h), 8 != (255 & r.flags))) {
  3942. (e.msg = "unknown compression method"), (r.mode = 30);
  3943. break;
  3944. }
  3945. if (57344 & r.flags) {
  3946. (e.msg = "unknown header flags set"), (r.mode = 30);
  3947. break;
  3948. }
  3949. r.head && (r.head.text = (h >> 8) & 1),
  3950. 512 & r.flags && ((E[0] = 255 & h), (E[1] = (h >>> 8) & 255), (r.check = B(r.check, E, 2, 0))),
  3951. (f = h = 0),
  3952. (r.mode = 3);
  3953. case 3:
  3954. for (; f < 32; ) {
  3955. if (0 === o) break e;
  3956. o--, (h += n[s++] << f), (f += 8);
  3957. }
  3958. r.head && (r.head.time = h),
  3959. 512 & r.flags &&
  3960. ((E[0] = 255 & h),
  3961. (E[1] = (h >>> 8) & 255),
  3962. (E[2] = (h >>> 16) & 255),
  3963. (E[3] = (h >>> 24) & 255),
  3964. (r.check = B(r.check, E, 4, 0))),
  3965. (f = h = 0),
  3966. (r.mode = 4);
  3967. case 4:
  3968. for (; f < 16; ) {
  3969. if (0 === o) break e;
  3970. o--, (h += n[s++] << f), (f += 8);
  3971. }
  3972. r.head && ((r.head.xflags = 255 & h), (r.head.os = h >> 8)),
  3973. 512 & r.flags && ((E[0] = 255 & h), (E[1] = (h >>> 8) & 255), (r.check = B(r.check, E, 2, 0))),
  3974. (f = h = 0),
  3975. (r.mode = 5);
  3976. case 5:
  3977. if (1024 & r.flags) {
  3978. for (; f < 16; ) {
  3979. if (0 === o) break e;
  3980. o--, (h += n[s++] << f), (f += 8);
  3981. }
  3982. (r.length = h),
  3983. r.head && (r.head.extra_len = h),
  3984. 512 & r.flags && ((E[0] = 255 & h), (E[1] = (h >>> 8) & 255), (r.check = B(r.check, E, 2, 0))),
  3985. (f = h = 0);
  3986. } else r.head && (r.head.extra = null);
  3987. r.mode = 6;
  3988. case 6:
  3989. if (
  3990. 1024 & r.flags &&
  3991. (o < (c = r.length) && (c = o),
  3992. c &&
  3993. (r.head &&
  3994. ((k = r.head.extra_len - r.length),
  3995. r.head.extra || (r.head.extra = new Array(r.head.extra_len)),
  3996. I.arraySet(r.head.extra, n, s, c, k)),
  3997. 512 & r.flags && (r.check = B(r.check, n, c, s)),
  3998. (o -= c),
  3999. (s += c),
  4000. (r.length -= c)),
  4001. r.length)
  4002. )
  4003. break e;
  4004. (r.length = 0), (r.mode = 7);
  4005. case 7:
  4006. if (2048 & r.flags) {
  4007. if (0 === o) break e;
  4008. for (
  4009. c = 0;
  4010. (k = n[s + c++]), r.head && k && r.length < 65536 && (r.head.name += String.fromCharCode(k)), k && c < o;
  4011. );
  4012. if ((512 & r.flags && (r.check = B(r.check, n, c, s)), (o -= c), (s += c), k)) break e;
  4013. } else r.head && (r.head.name = null);
  4014. (r.length = 0), (r.mode = 8);
  4015. case 8:
  4016. if (4096 & r.flags) {
  4017. if (0 === o) break e;
  4018. for (
  4019. c = 0;
  4020. (k = n[s + c++]), r.head && k && r.length < 65536 && (r.head.comment += String.fromCharCode(k)), k && c < o;
  4021. );
  4022. if ((512 & r.flags && (r.check = B(r.check, n, c, s)), (o -= c), (s += c), k)) break e;
  4023. } else r.head && (r.head.comment = null);
  4024. r.mode = 9;
  4025. case 9:
  4026. if (512 & r.flags) {
  4027. for (; f < 16; ) {
  4028. if (0 === o) break e;
  4029. o--, (h += n[s++] << f), (f += 8);
  4030. }
  4031. if (h !== (65535 & r.check)) {
  4032. (e.msg = "header crc mismatch"), (r.mode = 30);
  4033. break;
  4034. }
  4035. f = h = 0;
  4036. }
  4037. r.head && ((r.head.hcrc = (r.flags >> 9) & 1), (r.head.done = !0)), (e.adler = r.check = 0), (r.mode = 12);
  4038. break;
  4039. case 10:
  4040. for (; f < 32; ) {
  4041. if (0 === o) break e;
  4042. o--, (h += n[s++] << f), (f += 8);
  4043. }
  4044. (e.adler = r.check = L(h)), (f = h = 0), (r.mode = 11);
  4045. case 11:
  4046. if (0 === r.havedict)
  4047. return (e.next_out = a), (e.avail_out = u), (e.next_in = s), (e.avail_in = o), (r.hold = h), (r.bits = f), 2;
  4048. (e.adler = r.check = 1), (r.mode = 12);
  4049. case 12:
  4050. if (5 === t || 6 === t) break e;
  4051. case 13:
  4052. if (r.last) {
  4053. (h >>>= 7 & f), (f -= 7 & f), (r.mode = 27);
  4054. break;
  4055. }
  4056. for (; f < 3; ) {
  4057. if (0 === o) break e;
  4058. o--, (h += n[s++] << f), (f += 8);
  4059. }
  4060. switch (((r.last = 1 & h), (f -= 1), 3 & (h >>>= 1))) {
  4061. case 0:
  4062. r.mode = 14;
  4063. break;
  4064. case 1:
  4065. if ((j(r), (r.mode = 20), 6 !== t)) break;
  4066. (h >>>= 2), (f -= 2);
  4067. break e;
  4068. case 2:
  4069. r.mode = 17;
  4070. break;
  4071. case 3:
  4072. (e.msg = "invalid block type"), (r.mode = 30);
  4073. }
  4074. (h >>>= 2), (f -= 2);
  4075. break;
  4076. case 14:
  4077. for (h >>>= 7 & f, f -= 7 & f; f < 32; ) {
  4078. if (0 === o) break e;
  4079. o--, (h += n[s++] << f), (f += 8);
  4080. }
  4081. if ((65535 & h) != ((h >>> 16) ^ 65535)) {
  4082. (e.msg = "invalid stored block lengths"), (r.mode = 30);
  4083. break;
  4084. }
  4085. if (((r.length = 65535 & h), (f = h = 0), (r.mode = 15), 6 === t)) break e;
  4086. case 15:
  4087. r.mode = 16;
  4088. case 16:
  4089. if ((c = r.length)) {
  4090. if ((o < c && (c = o), u < c && (c = u), 0 === c)) break e;
  4091. I.arraySet(i, n, s, c, a), (o -= c), (s += c), (u -= c), (a += c), (r.length -= c);
  4092. break;
  4093. }
  4094. r.mode = 12;
  4095. break;
  4096. case 17:
  4097. for (; f < 14; ) {
  4098. if (0 === o) break e;
  4099. o--, (h += n[s++] << f), (f += 8);
  4100. }
  4101. if (
  4102. ((r.nlen = 257 + (31 & h)),
  4103. (h >>>= 5),
  4104. (f -= 5),
  4105. (r.ndist = 1 + (31 & h)),
  4106. (h >>>= 5),
  4107. (f -= 5),
  4108. (r.ncode = 4 + (15 & h)),
  4109. (h >>>= 4),
  4110. (f -= 4),
  4111. 286 < r.nlen || 30 < r.ndist)
  4112. ) {
  4113. (e.msg = "too many length or distance symbols"), (r.mode = 30);
  4114. break;
  4115. }
  4116. (r.have = 0), (r.mode = 18);
  4117. case 18:
  4118. for (; r.have < r.ncode; ) {
  4119. for (; f < 3; ) {
  4120. if (0 === o) break e;
  4121. o--, (h += n[s++] << f), (f += 8);
  4122. }
  4123. (r.lens[A[r.have++]] = 7 & h), (h >>>= 3), (f -= 3);
  4124. }
  4125. for (; r.have < 19; ) r.lens[A[r.have++]] = 0;
  4126. if (
  4127. ((r.lencode = r.lendyn),
  4128. (r.lenbits = 7),
  4129. (S = { bits: r.lenbits }),
  4130. (x = T(0, r.lens, 0, 19, r.lencode, 0, r.work, S)),
  4131. (r.lenbits = S.bits),
  4132. x)
  4133. ) {
  4134. (e.msg = "invalid code lengths set"), (r.mode = 30);
  4135. break;
  4136. }
  4137. (r.have = 0), (r.mode = 19);
  4138. case 19:
  4139. for (; r.have < r.nlen + r.ndist; ) {
  4140. for (; (g = ((C = r.lencode[h & ((1 << r.lenbits) - 1)]) >>> 16) & 255), (v = 65535 & C), !((_ = C >>> 24) <= f); ) {
  4141. if (0 === o) break e;
  4142. o--, (h += n[s++] << f), (f += 8);
  4143. }
  4144. if (v < 16) (h >>>= _), (f -= _), (r.lens[r.have++] = v);
  4145. else {
  4146. if (16 === v) {
  4147. for (z = _ + 2; f < z; ) {
  4148. if (0 === o) break e;
  4149. o--, (h += n[s++] << f), (f += 8);
  4150. }
  4151. if (((h >>>= _), (f -= _), 0 === r.have)) {
  4152. (e.msg = "invalid bit length repeat"), (r.mode = 30);
  4153. break;
  4154. }
  4155. (k = r.lens[r.have - 1]), (c = 3 + (3 & h)), (h >>>= 2), (f -= 2);
  4156. } else if (17 === v) {
  4157. for (z = _ + 3; f < z; ) {
  4158. if (0 === o) break e;
  4159. o--, (h += n[s++] << f), (f += 8);
  4160. }
  4161. (f -= _), (k = 0), (c = 3 + (7 & (h >>>= _))), (h >>>= 3), (f -= 3);
  4162. } else {
  4163. for (z = _ + 7; f < z; ) {
  4164. if (0 === o) break e;
  4165. o--, (h += n[s++] << f), (f += 8);
  4166. }
  4167. (f -= _), (k = 0), (c = 11 + (127 & (h >>>= _))), (h >>>= 7), (f -= 7);
  4168. }
  4169. if (r.have + c > r.nlen + r.ndist) {
  4170. (e.msg = "invalid bit length repeat"), (r.mode = 30);
  4171. break;
  4172. }
  4173. for (; c--; ) r.lens[r.have++] = k;
  4174. }
  4175. }
  4176. if (30 === r.mode) break;
  4177. if (0 === r.lens[256]) {
  4178. (e.msg = "invalid code -- missing end-of-block"), (r.mode = 30);
  4179. break;
  4180. }
  4181. if (
  4182. ((r.lenbits = 9),
  4183. (S = { bits: r.lenbits }),
  4184. (x = T(D, r.lens, 0, r.nlen, r.lencode, 0, r.work, S)),
  4185. (r.lenbits = S.bits),
  4186. x)
  4187. ) {
  4188. (e.msg = "invalid literal/lengths set"), (r.mode = 30);
  4189. break;
  4190. }
  4191. if (
  4192. ((r.distbits = 6),
  4193. (r.distcode = r.distdyn),
  4194. (S = { bits: r.distbits }),
  4195. (x = T(F, r.lens, r.nlen, r.ndist, r.distcode, 0, r.work, S)),
  4196. (r.distbits = S.bits),
  4197. x)
  4198. ) {
  4199. (e.msg = "invalid distances set"), (r.mode = 30);
  4200. break;
  4201. }
  4202. if (((r.mode = 20), 6 === t)) break e;
  4203. case 20:
  4204. r.mode = 21;
  4205. case 21:
  4206. if (6 <= o && 258 <= u) {
  4207. (e.next_out = a),
  4208. (e.avail_out = u),
  4209. (e.next_in = s),
  4210. (e.avail_in = o),
  4211. (r.hold = h),
  4212. (r.bits = f),
  4213. R(e, d),
  4214. (a = e.next_out),
  4215. (i = e.output),
  4216. (u = e.avail_out),
  4217. (s = e.next_in),
  4218. (n = e.input),
  4219. (o = e.avail_in),
  4220. (h = r.hold),
  4221. (f = r.bits),
  4222. 12 === r.mode && (r.back = -1);
  4223. break;
  4224. }
  4225. for (
  4226. r.back = 0;
  4227. (g = ((C = r.lencode[h & ((1 << r.lenbits) - 1)]) >>> 16) & 255), (v = 65535 & C), !((_ = C >>> 24) <= f);
  4228. ) {
  4229. if (0 === o) break e;
  4230. o--, (h += n[s++] << f), (f += 8);
  4231. }
  4232. if (g && 0 == (240 & g)) {
  4233. for (
  4234. b = _, w = g, y = v;
  4235. (g = ((C = r.lencode[y + ((h & ((1 << (b + w)) - 1)) >> b)]) >>> 16) & 255),
  4236. (v = 65535 & C),
  4237. !(b + (_ = C >>> 24) <= f);
  4238. ) {
  4239. if (0 === o) break e;
  4240. o--, (h += n[s++] << f), (f += 8);
  4241. }
  4242. (h >>>= b), (f -= b), (r.back += b);
  4243. }
  4244. if (((h >>>= _), (f -= _), (r.back += _), (r.length = v), 0 === g)) {
  4245. r.mode = 26;
  4246. break;
  4247. }
  4248. if (32 & g) {
  4249. (r.back = -1), (r.mode = 12);
  4250. break;
  4251. }
  4252. if (64 & g) {
  4253. (e.msg = "invalid literal/length code"), (r.mode = 30);
  4254. break;
  4255. }
  4256. (r.extra = 15 & g), (r.mode = 22);
  4257. case 22:
  4258. if (r.extra) {
  4259. for (z = r.extra; f < z; ) {
  4260. if (0 === o) break e;
  4261. o--, (h += n[s++] << f), (f += 8);
  4262. }
  4263. (r.length += h & ((1 << r.extra) - 1)), (h >>>= r.extra), (f -= r.extra), (r.back += r.extra);
  4264. }
  4265. (r.was = r.length), (r.mode = 23);
  4266. case 23:
  4267. for (; (g = ((C = r.distcode[h & ((1 << r.distbits) - 1)]) >>> 16) & 255), (v = 65535 & C), !((_ = C >>> 24) <= f); ) {
  4268. if (0 === o) break e;
  4269. o--, (h += n[s++] << f), (f += 8);
  4270. }
  4271. if (0 == (240 & g)) {
  4272. for (
  4273. b = _, w = g, y = v;
  4274. (g = ((C = r.distcode[y + ((h & ((1 << (b + w)) - 1)) >> b)]) >>> 16) & 255),
  4275. (v = 65535 & C),
  4276. !(b + (_ = C >>> 24) <= f);
  4277. ) {
  4278. if (0 === o) break e;
  4279. o--, (h += n[s++] << f), (f += 8);
  4280. }
  4281. (h >>>= b), (f -= b), (r.back += b);
  4282. }
  4283. if (((h >>>= _), (f -= _), (r.back += _), 64 & g)) {
  4284. (e.msg = "invalid distance code"), (r.mode = 30);
  4285. break;
  4286. }
  4287. (r.offset = v), (r.extra = 15 & g), (r.mode = 24);
  4288. case 24:
  4289. if (r.extra) {
  4290. for (z = r.extra; f < z; ) {
  4291. if (0 === o) break e;
  4292. o--, (h += n[s++] << f), (f += 8);
  4293. }
  4294. (r.offset += h & ((1 << r.extra) - 1)), (h >>>= r.extra), (f -= r.extra), (r.back += r.extra);
  4295. }
  4296. if (r.offset > r.dmax) {
  4297. (e.msg = "invalid distance too far back"), (r.mode = 30);
  4298. break;
  4299. }
  4300. r.mode = 25;
  4301. case 25:
  4302. if (0 === u) break e;
  4303. if (((c = d - u), r.offset > c)) {
  4304. if ((c = r.offset - c) > r.whave && r.sane) {
  4305. (e.msg = "invalid distance too far back"), (r.mode = 30);
  4306. break;
  4307. }
  4308. (p = c > r.wnext ? ((c -= r.wnext), r.wsize - c) : r.wnext - c), c > r.length && (c = r.length), (m = r.window);
  4309. } else (m = i), (p = a - r.offset), (c = r.length);
  4310. for (u < c && (c = u), u -= c, r.length -= c; (i[a++] = m[p++]), --c; );
  4311. 0 === r.length && (r.mode = 21);
  4312. break;
  4313. case 26:
  4314. if (0 === u) break e;
  4315. (i[a++] = r.length), u--, (r.mode = 21);
  4316. break;
  4317. case 27:
  4318. if (r.wrap) {
  4319. for (; f < 32; ) {
  4320. if (0 === o) break e;
  4321. o--, (h |= n[s++] << f), (f += 8);
  4322. }
  4323. if (
  4324. ((d -= u),
  4325. (e.total_out += d),
  4326. (r.total += d),
  4327. d && (e.adler = r.check = r.flags ? B(r.check, i, d, a - d) : O(r.check, i, d, a - d)),
  4328. (d = u),
  4329. (r.flags ? h : L(h)) !== r.check)
  4330. ) {
  4331. (e.msg = "incorrect data check"), (r.mode = 30);
  4332. break;
  4333. }
  4334. f = h = 0;
  4335. }
  4336. r.mode = 28;
  4337. case 28:
  4338. if (r.wrap && r.flags) {
  4339. for (; f < 32; ) {
  4340. if (0 === o) break e;
  4341. o--, (h += n[s++] << f), (f += 8);
  4342. }
  4343. if (h !== (4294967295 & r.total)) {
  4344. (e.msg = "incorrect length check"), (r.mode = 30);
  4345. break;
  4346. }
  4347. f = h = 0;
  4348. }
  4349. r.mode = 29;
  4350. case 29:
  4351. x = 1;
  4352. break e;
  4353. case 30:
  4354. x = -3;
  4355. break e;
  4356. case 31:
  4357. return -4;
  4358. case 32:
  4359. default:
  4360. return U;
  4361. }
  4362. return (
  4363. (e.next_out = a),
  4364. (e.avail_out = u),
  4365. (e.next_in = s),
  4366. (e.avail_in = o),
  4367. (r.hold = h),
  4368. (r.bits = f),
  4369. (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)
  4370. ? ((r.mode = 31), -4)
  4371. : ((l -= e.avail_in),
  4372. (d -= e.avail_out),
  4373. (e.total_in += l),
  4374. (e.total_out += d),
  4375. (r.total += d),
  4376. 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)),
  4377. (e.data_type = r.bits + (r.last ? 64 : 0) + (12 === r.mode ? 128 : 0) + (20 === r.mode || 15 === r.mode ? 256 : 0)),
  4378. ((0 == l && 0 === d) || 4 === t) && x === N && (x = -5),
  4379. x)
  4380. );
  4381. }),
  4382. (r.inflateEnd = function (e) {
  4383. if (!e || !e.state) return U;
  4384. var t = e.state;
  4385. return t.window && (t.window = null), (e.state = null), N;
  4386. }),
  4387. (r.inflateGetHeader = function (e, t) {
  4388. var r;
  4389. return e && e.state ? (0 == (2 & (r = e.state).wrap) ? U : (((r.head = t).done = !1), N)) : U;
  4390. }),
  4391. (r.inflateSetDictionary = function (e, t) {
  4392. var r,
  4393. n = t.length;
  4394. return e && e.state
  4395. ? 0 !== (r = e.state).wrap && 11 !== r.mode
  4396. ? U
  4397. : 11 === r.mode && O(1, t, n, 0) !== r.check
  4398. ? -3
  4399. : Z(e, t, n, n)
  4400. ? ((r.mode = 31), -4)
  4401. : ((r.havedict = 1), N)
  4402. : U;
  4403. }),
  4404. (r.inflateInfo = "pako inflate (from Nodeca project)");
  4405. },
  4406. { "../utils/common": 41, "./adler32": 43, "./crc32": 45, "./inffast": 48, "./inftrees": 50 },
  4407. ],
  4408. 50: [
  4409. function (e, t, r) {
  4410. "use strict";
  4411. var D = e("../utils/common"),
  4412. 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],
  4413. N = [
  4414. 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,
  4415. ],
  4416. U = [
  4417. 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,
  4418. 12289, 16385, 24577, 0, 0,
  4419. ],
  4420. P = [
  4421. 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,
  4422. 64,
  4423. ];
  4424. t.exports = function (e, t, r, n, i, s, a, o) {
  4425. var u,
  4426. h,
  4427. f,
  4428. l,
  4429. d,
  4430. c,
  4431. p,
  4432. m,
  4433. _,
  4434. g = o.bits,
  4435. v = 0,
  4436. b = 0,
  4437. w = 0,
  4438. y = 0,
  4439. k = 0,
  4440. x = 0,
  4441. S = 0,
  4442. z = 0,
  4443. C = 0,
  4444. E = 0,
  4445. A = null,
  4446. I = 0,
  4447. O = new D.Buf16(16),
  4448. B = new D.Buf16(16),
  4449. R = null,
  4450. T = 0;
  4451. for (v = 0; v <= 15; v++) O[v] = 0;
  4452. for (b = 0; b < n; b++) O[t[r + b]]++;
  4453. for (k = g, y = 15; 1 <= y && 0 === O[y]; y--);
  4454. if ((y < k && (k = y), 0 === y)) return (i[s++] = 20971520), (i[s++] = 20971520), (o.bits = 1), 0;
  4455. for (w = 1; w < y && 0 === O[w]; w++);
  4456. for (k < w && (k = w), v = z = 1; v <= 15; v++) if (((z <<= 1), (z -= O[v]) < 0)) return -1;
  4457. if (0 < z && (0 === e || 1 !== y)) return -1;
  4458. for (B[1] = 0, v = 1; v < 15; v++) B[v + 1] = B[v] + O[v];
  4459. for (b = 0; b < n; b++) 0 !== t[r + b] && (a[B[t[r + b]]++] = b);
  4460. if (
  4461. ((c = 0 === e ? ((A = R = a), 19) : 1 === e ? ((A = F), (I -= 257), (R = N), (T -= 257), 256) : ((A = U), (R = P), -1)),
  4462. (v = w),
  4463. (d = s),
  4464. (S = b = E = 0),
  4465. (f = -1),
  4466. (l = (C = 1 << (x = k)) - 1),
  4467. (1 === e && 852 < C) || (2 === e && 592 < C))
  4468. )
  4469. return 1;
  4470. for (;;) {
  4471. for (
  4472. p = v - S,
  4473. _ = a[b] < c ? ((m = 0), a[b]) : a[b] > c ? ((m = R[T + a[b]]), A[I + a[b]]) : ((m = 96), 0),
  4474. u = 1 << (v - S),
  4475. w = h = 1 << x;
  4476. (i[d + (E >> S) + (h -= u)] = (p << 24) | (m << 16) | _ | 0), 0 !== h;
  4477. );
  4478. for (u = 1 << (v - 1); E & u; ) u >>= 1;
  4479. if ((0 !== u ? ((E &= u - 1), (E += u)) : (E = 0), b++, 0 == --O[v])) {
  4480. if (v === y) break;
  4481. v = t[r + a[b]];
  4482. }
  4483. if (k < v && (E & l) !== f) {
  4484. for (0 === S && (S = k), d += w, z = 1 << (x = v - S); x + S < y && !((z -= O[x + S]) <= 0); ) x++, (z <<= 1);
  4485. if (((C += 1 << x), (1 === e && 852 < C) || (2 === e && 592 < C))) return 1;
  4486. i[(f = E & l)] = (k << 24) | (x << 16) | (d - s) | 0;
  4487. }
  4488. }
  4489. return 0 !== E && (i[d + E] = ((v - S) << 24) | (64 << 16) | 0), (o.bits = k), 0;
  4490. };
  4491. },
  4492. { "../utils/common": 41 },
  4493. ],
  4494. 51: [
  4495. function (e, t, r) {
  4496. "use strict";
  4497. t.exports = {
  4498. 2: "need dictionary",
  4499. 1: "stream end",
  4500. 0: "",
  4501. "-1": "file error",
  4502. "-2": "stream error",
  4503. "-3": "data error",
  4504. "-4": "insufficient memory",
  4505. "-5": "buffer error",
  4506. "-6": "incompatible version",
  4507. };
  4508. },
  4509. {},
  4510. ],
  4511. 52: [
  4512. function (e, t, r) {
  4513. "use strict";
  4514. var o = e("../utils/common");
  4515. function n(e) {
  4516. for (var t = e.length; 0 <= --t; ) e[t] = 0;
  4517. }
  4518. var _ = 15,
  4519. i = 16,
  4520. 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],
  4521. 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],
  4522. a = [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 3, 7],
  4523. f = [16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15],
  4524. l = new Array(576);
  4525. n(l);
  4526. var d = new Array(60);
  4527. n(d);
  4528. var c = new Array(512);
  4529. n(c);
  4530. var p = new Array(256);
  4531. n(p);
  4532. var m = new Array(29);
  4533. n(m);
  4534. var g,
  4535. v,
  4536. b,
  4537. w = new Array(30);
  4538. function y(e, t, r, n, i) {
  4539. (this.static_tree = e),
  4540. (this.extra_bits = t),
  4541. (this.extra_base = r),
  4542. (this.elems = n),
  4543. (this.max_length = i),
  4544. (this.has_stree = e && e.length);
  4545. }
  4546. function s(e, t) {
  4547. (this.dyn_tree = e), (this.max_code = 0), (this.stat_desc = t);
  4548. }
  4549. function k(e) {
  4550. return e < 256 ? c[e] : c[256 + (e >>> 7)];
  4551. }
  4552. function x(e, t) {
  4553. (e.pending_buf[e.pending++] = 255 & t), (e.pending_buf[e.pending++] = (t >>> 8) & 255);
  4554. }
  4555. function S(e, t, r) {
  4556. e.bi_valid > i - r
  4557. ? ((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))
  4558. : ((e.bi_buf |= (t << e.bi_valid) & 65535), (e.bi_valid += r));
  4559. }
  4560. function z(e, t, r) {
  4561. S(e, r[2 * t], r[2 * t + 1]);
  4562. }
  4563. function C(e, t) {
  4564. for (var r = 0; (r |= 1 & e), (e >>>= 1), (r <<= 1), 0 < --t; );
  4565. return r >>> 1;
  4566. }
  4567. function E(e, t, r) {
  4568. var n,
  4569. i,
  4570. s = new Array(_ + 1),
  4571. a = 0;
  4572. for (n = 1; n <= _; n++) s[n] = a = (a + r[n - 1]) << 1;
  4573. for (i = 0; i <= t; i++) {
  4574. var o = e[2 * i + 1];
  4575. 0 !== o && (e[2 * i] = C(s[o]++, o));
  4576. }
  4577. }
  4578. function A(e) {
  4579. var t;
  4580. for (t = 0; t < 286; t++) e.dyn_ltree[2 * t] = 0;
  4581. for (t = 0; t < 30; t++) e.dyn_dtree[2 * t] = 0;
  4582. for (t = 0; t < 19; t++) e.bl_tree[2 * t] = 0;
  4583. (e.dyn_ltree[512] = 1), (e.opt_len = e.static_len = 0), (e.last_lit = e.matches = 0);
  4584. }
  4585. function I(e) {
  4586. 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);
  4587. }
  4588. function O(e, t, r, n) {
  4589. var i = 2 * t,
  4590. s = 2 * r;
  4591. return e[i] < e[s] || (e[i] === e[s] && n[t] <= n[r]);
  4592. }
  4593. function B(e, t, r) {
  4594. for (
  4595. var n = e.heap[r], i = r << 1;
  4596. 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));
  4597. )
  4598. (e.heap[r] = e.heap[i]), (r = i), (i <<= 1);
  4599. e.heap[r] = n;
  4600. }
  4601. function R(e, t, r) {
  4602. var n,
  4603. i,
  4604. s,
  4605. a,
  4606. o = 0;
  4607. if (0 !== e.last_lit)
  4608. for (
  4609. ;
  4610. (n = (e.pending_buf[e.d_buf + 2 * o] << 8) | e.pending_buf[e.d_buf + 2 * o + 1]),
  4611. (i = e.pending_buf[e.l_buf + o]),
  4612. o++,
  4613. 0 === n
  4614. ? z(e, i, t)
  4615. : (z(e, (s = p[i]) + 256 + 1, t),
  4616. 0 !== (a = u[s]) && S(e, (i -= m[s]), a),
  4617. z(e, (s = k(--n)), r),
  4618. 0 !== (a = h[s]) && S(e, (n -= w[s]), a)),
  4619. o < e.last_lit;
  4620. );
  4621. z(e, 256, t);
  4622. }
  4623. function T(e, t) {
  4624. var r,
  4625. n,
  4626. i,
  4627. s = t.dyn_tree,
  4628. a = t.stat_desc.static_tree,
  4629. o = t.stat_desc.has_stree,
  4630. u = t.stat_desc.elems,
  4631. h = -1;
  4632. for (e.heap_len = 0, e.heap_max = 573, r = 0; r < u; r++)
  4633. 0 !== s[2 * r] ? ((e.heap[++e.heap_len] = h = r), (e.depth[r] = 0)) : (s[2 * r + 1] = 0);
  4634. for (; e.heap_len < 2; )
  4635. (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]);
  4636. for (t.max_code = h, r = e.heap_len >> 1; 1 <= r; r--) B(e, s, r);
  4637. for (
  4638. i = u;
  4639. (r = e.heap[1]),
  4640. (e.heap[1] = e.heap[e.heap_len--]),
  4641. B(e, s, 1),
  4642. (n = e.heap[1]),
  4643. (e.heap[--e.heap_max] = r),
  4644. (e.heap[--e.heap_max] = n),
  4645. (s[2 * i] = s[2 * r] + s[2 * n]),
  4646. (e.depth[i] = (e.depth[r] >= e.depth[n] ? e.depth[r] : e.depth[n]) + 1),
  4647. (s[2 * r + 1] = s[2 * n + 1] = i),
  4648. (e.heap[1] = i++),
  4649. B(e, s, 1),
  4650. 2 <= e.heap_len;
  4651. );
  4652. (e.heap[--e.heap_max] = e.heap[1]),
  4653. (function (e, t) {
  4654. var r,
  4655. n,
  4656. i,
  4657. s,
  4658. a,
  4659. o,
  4660. u = t.dyn_tree,
  4661. h = t.max_code,
  4662. f = t.stat_desc.static_tree,
  4663. l = t.stat_desc.has_stree,
  4664. d = t.stat_desc.extra_bits,
  4665. c = t.stat_desc.extra_base,
  4666. p = t.stat_desc.max_length,
  4667. m = 0;
  4668. for (s = 0; s <= _; s++) e.bl_count[s] = 0;
  4669. for (u[2 * e.heap[e.heap_max] + 1] = 0, r = e.heap_max + 1; r < 573; r++)
  4670. p < (s = u[2 * u[2 * (n = e.heap[r]) + 1] + 1] + 1) && ((s = p), m++),
  4671. (u[2 * n + 1] = s),
  4672. h < n ||
  4673. (e.bl_count[s]++,
  4674. (a = 0),
  4675. c <= n && (a = d[n - c]),
  4676. (o = u[2 * n]),
  4677. (e.opt_len += o * (s + a)),
  4678. l && (e.static_len += o * (f[2 * n + 1] + a)));
  4679. if (0 !== m) {
  4680. do {
  4681. for (s = p - 1; 0 === e.bl_count[s]; ) s--;
  4682. e.bl_count[s]--, (e.bl_count[s + 1] += 2), e.bl_count[p]--, (m -= 2);
  4683. } while (0 < m);
  4684. for (s = p; 0 !== s; s--)
  4685. for (n = e.bl_count[s]; 0 !== n; )
  4686. h < (i = e.heap[--r]) ||
  4687. (u[2 * i + 1] !== s && ((e.opt_len += (s - u[2 * i + 1]) * u[2 * i]), (u[2 * i + 1] = s)), n--);
  4688. }
  4689. })(e, t),
  4690. E(s, h, e.bl_count);
  4691. }
  4692. function D(e, t, r) {
  4693. var n,
  4694. i,
  4695. s = -1,
  4696. a = t[1],
  4697. o = 0,
  4698. u = 7,
  4699. h = 4;
  4700. for (0 === a && ((u = 138), (h = 3)), t[2 * (r + 1) + 1] = 65535, n = 0; n <= r; n++)
  4701. (i = a),
  4702. (a = t[2 * (n + 1) + 1]),
  4703. (++o < u && i === a) ||
  4704. (o < h
  4705. ? (e.bl_tree[2 * i] += o)
  4706. : 0 !== i
  4707. ? (i !== s && e.bl_tree[2 * i]++, e.bl_tree[32]++)
  4708. : o <= 10
  4709. ? e.bl_tree[34]++
  4710. : e.bl_tree[36]++,
  4711. (s = i),
  4712. (h = (o = 0) === a ? ((u = 138), 3) : i === a ? ((u = 6), 3) : ((u = 7), 4)));
  4713. }
  4714. function F(e, t, r) {
  4715. var n,
  4716. i,
  4717. s = -1,
  4718. a = t[1],
  4719. o = 0,
  4720. u = 7,
  4721. h = 4;
  4722. for (0 === a && ((u = 138), (h = 3)), n = 0; n <= r; n++)
  4723. if (((i = a), (a = t[2 * (n + 1) + 1]), !(++o < u && i === a))) {
  4724. if (o < h) for (; z(e, i, e.bl_tree), 0 != --o; );
  4725. else
  4726. 0 !== i
  4727. ? (i !== s && (z(e, i, e.bl_tree), o--), z(e, 16, e.bl_tree), S(e, o - 3, 2))
  4728. : o <= 10
  4729. ? (z(e, 17, e.bl_tree), S(e, o - 3, 3))
  4730. : (z(e, 18, e.bl_tree), S(e, o - 11, 7));
  4731. (s = i), (h = (o = 0) === a ? ((u = 138), 3) : i === a ? ((u = 6), 3) : ((u = 7), 4));
  4732. }
  4733. }
  4734. n(w);
  4735. var N = !1;
  4736. function U(e, t, r, n) {
  4737. var i, s, a;
  4738. S(e, 0 + (n ? 1 : 0), 3),
  4739. (s = t),
  4740. (a = r),
  4741. I((i = e)),
  4742. x(i, a),
  4743. x(i, ~a),
  4744. o.arraySet(i.pending_buf, i.window, s, a, i.pending),
  4745. (i.pending += a);
  4746. }
  4747. (r._tr_init = function (e) {
  4748. N ||
  4749. ((function () {
  4750. var e,
  4751. t,
  4752. r,
  4753. n,
  4754. i,
  4755. s = new Array(_ + 1);
  4756. for (n = r = 0; n < 28; n++) for (m[n] = r, e = 0; e < 1 << u[n]; e++) p[r++] = n;
  4757. 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;
  4758. for (i >>= 7; n < 30; n++) for (w[n] = i << 7, e = 0; e < 1 << (h[n] - 7); e++) c[256 + i++] = n;
  4759. for (t = 0; t <= _; t++) s[t] = 0;
  4760. for (e = 0; e <= 143; ) (l[2 * e + 1] = 8), e++, s[8]++;
  4761. for (; e <= 255; ) (l[2 * e + 1] = 9), e++, s[9]++;
  4762. for (; e <= 279; ) (l[2 * e + 1] = 7), e++, s[7]++;
  4763. for (; e <= 287; ) (l[2 * e + 1] = 8), e++, s[8]++;
  4764. for (E(l, 287, s), e = 0; e < 30; e++) (d[2 * e + 1] = 5), (d[2 * e] = C(e, 5));
  4765. (g = new y(l, u, 257, 286, _)), (v = new y(d, h, 0, 30, _)), (b = new y(new Array(0), a, 0, 19, 7));
  4766. })(),
  4767. (N = !0)),
  4768. (e.l_desc = new s(e.dyn_ltree, g)),
  4769. (e.d_desc = new s(e.dyn_dtree, v)),
  4770. (e.bl_desc = new s(e.bl_tree, b)),
  4771. (e.bi_buf = 0),
  4772. (e.bi_valid = 0),
  4773. A(e);
  4774. }),
  4775. (r._tr_stored_block = U),
  4776. (r._tr_flush_block = function (e, t, r, n) {
  4777. var i,
  4778. s,
  4779. a = 0;
  4780. 0 < e.level
  4781. ? (2 === e.strm.data_type &&
  4782. (e.strm.data_type = (function (e) {
  4783. var t,
  4784. r = 4093624447;
  4785. for (t = 0; t <= 31; t++, r >>>= 1) if (1 & r && 0 !== e.dyn_ltree[2 * t]) return 0;
  4786. if (0 !== e.dyn_ltree[18] || 0 !== e.dyn_ltree[20] || 0 !== e.dyn_ltree[26]) return 1;
  4787. for (t = 32; t < 256; t++) if (0 !== e.dyn_ltree[2 * t]) return 1;
  4788. return 0;
  4789. })(e)),
  4790. T(e, e.l_desc),
  4791. T(e, e.d_desc),
  4792. (a = (function (e) {
  4793. var t;
  4794. for (
  4795. 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;
  4796. 3 <= t && 0 === e.bl_tree[2 * f[t] + 1];
  4797. t--
  4798. );
  4799. return (e.opt_len += 3 * (t + 1) + 5 + 5 + 4), t;
  4800. })(e)),
  4801. (i = (e.opt_len + 3 + 7) >>> 3),
  4802. (s = (e.static_len + 3 + 7) >>> 3) <= i && (i = s))
  4803. : (i = s = r + 5),
  4804. r + 4 <= i && -1 !== t
  4805. ? U(e, t, r, n)
  4806. : 4 === e.strategy || s === i
  4807. ? (S(e, 2 + (n ? 1 : 0), 3), R(e, l, d))
  4808. : (S(e, 4 + (n ? 1 : 0), 3),
  4809. (function (e, t, r, n) {
  4810. var i;
  4811. 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);
  4812. F(e, e.dyn_ltree, t - 1), F(e, e.dyn_dtree, r - 1);
  4813. })(e, e.l_desc.max_code + 1, e.d_desc.max_code + 1, a + 1),
  4814. R(e, e.dyn_ltree, e.dyn_dtree)),
  4815. A(e),
  4816. n && I(e);
  4817. }),
  4818. (r._tr_tally = function (e, t, r) {
  4819. return (
  4820. (e.pending_buf[e.d_buf + 2 * e.last_lit] = (t >>> 8) & 255),
  4821. (e.pending_buf[e.d_buf + 2 * e.last_lit + 1] = 255 & t),
  4822. (e.pending_buf[e.l_buf + e.last_lit] = 255 & r),
  4823. e.last_lit++,
  4824. 0 === t ? e.dyn_ltree[2 * r]++ : (e.matches++, t--, e.dyn_ltree[2 * (p[r] + 256 + 1)]++, e.dyn_dtree[2 * k(t)]++),
  4825. e.last_lit === e.lit_bufsize - 1
  4826. );
  4827. }),
  4828. (r._tr_align = function (e) {
  4829. var t;
  4830. S(e, 2, 3),
  4831. z(e, 256, l),
  4832. 16 === (t = e).bi_valid
  4833. ? (x(t, t.bi_buf), (t.bi_buf = 0), (t.bi_valid = 0))
  4834. : 8 <= t.bi_valid && ((t.pending_buf[t.pending++] = 255 & t.bi_buf), (t.bi_buf >>= 8), (t.bi_valid -= 8));
  4835. });
  4836. },
  4837. { "../utils/common": 41 },
  4838. ],
  4839. 53: [
  4840. function (e, t, r) {
  4841. "use strict";
  4842. t.exports = function () {
  4843. (this.input = null),
  4844. (this.next_in = 0),
  4845. (this.avail_in = 0),
  4846. (this.total_in = 0),
  4847. (this.output = null),
  4848. (this.next_out = 0),
  4849. (this.avail_out = 0),
  4850. (this.total_out = 0),
  4851. (this.msg = ""),
  4852. (this.state = null),
  4853. (this.data_type = 2),
  4854. (this.adler = 0);
  4855. };
  4856. },
  4857. {},
  4858. ],
  4859. 54: [
  4860. function (e, t, r) {
  4861. "use strict";
  4862. t.exports =
  4863. "function" == typeof setImmediate
  4864. ? setImmediate
  4865. : function () {
  4866. var e = [].slice.apply(arguments);
  4867. e.splice(1, 0, 0), setTimeout.apply(null, e);
  4868. };
  4869. },
  4870. {},
  4871. ],
  4872. },
  4873. {},
  4874. [10]
  4875. )(10);
  4876. });
  4877. }.call(this, void 0 !== r ? r : "undefined" != typeof self ? self : "undefined" != typeof window ? window : {}));
  4878. },
  4879. {},
  4880. ],
  4881. },
  4882. {},
  4883. [1]
  4884. )(1);
  4885. });
  4886. }.call(this, void 0 !== r ? r : "undefined" != typeof self ? self : "undefined" != typeof window ? window : {}));
  4887. },
  4888. {},
  4889. ],
  4890. },
  4891. {},
  4892. [1]
  4893. )(1);
  4894. });
  4895. }.call(this, void 0 !== r ? r : "undefined" != typeof self ? self : "undefined" != typeof window ? window : {}));
  4896. },
  4897. {},
  4898. ],
  4899. },
  4900. {},
  4901. [1]
  4902. )(1);
  4903. });
  4904. }.call(this, "undefined" != typeof global ? global : "undefined" != typeof self ? self : "undefined" != typeof window ? window : {}));
  4905. },
  4906. {},
  4907. ],
  4908. },
  4909. {},
  4910. [1]
  4911. )(1);
  4912. });
  4913. }.call(this, typeof global !== "undefined" ? global : typeof self !== "undefined" ? self : typeof window !== "undefined" ? window : {}));
  4914. },
  4915. {},
  4916. ],
  4917. },
  4918. {},
  4919. [1]
  4920. )(1);
  4921. });