infinity-forge 9.7.8 → 9.8.0

package/dist/node_modules/.pnpm/node-stdlib-browser@1.3.1/node_modules/node-stdlib-browser/cjs/proxy/process.js

@@ -1,2 +0,0 @@
-"use strict";Object.defineProperties(exports,{__esModule:{value:!0},[Symbol.toStringTag]:{value:"Module"}});const W=require("../../../../../../../_virtual/_commonjsHelpers.js"),h=require("../../../../../../../_virtual/process.js");(function($,r){Object.defineProperty(r,"__esModule",{value:!0});var e={exports:{}},n=e.exports={},i,o;function p(){throw new Error("setTimeout has not been defined")}function f(){throw new Error("clearTimeout has not been defined")}(function(){try{typeof setTimeout=="function"?i=setTimeout:i=p}catch{i=p}try{typeof clearTimeout=="function"?o=clearTimeout:o=f}catch{o=f}})();function g(t){if(i===setTimeout)return setTimeout(t,0);if((i===p||!i)&&setTimeout)return i=setTimeout,setTimeout(t,0);try{return i(t,0)}catch{try{return i.call(null,t,0)}catch{return i.call(this,t,0)}}}function I(t){if(o===clearTimeout)return clearTimeout(t);if((o===f||!o)&&clearTimeout)return o=clearTimeout,clearTimeout(t);try{return o(t)}catch{try{return o.call(null,t)}catch{return o.call(this,t)}}}var u=[],v=!1,c,m=-1;function Q(){!v||!c||(v=!1,c.length?u=c.concat(u):m=-1,u.length&&T())}function T(){if(!v){var t=g(Q);v=!0;for(var s=u.length;s;){for(c=u,u=[];++m<s;)c&&c[m].run();m=-1,s=u.length}c=null,v=!1,I(t)}}n.nextTick=function(t){var s=new Array(arguments.length-1);if(arguments.length>1)for(var d=1;d<arguments.length;d++)s[d-1]=arguments[d];u.push(new w(t,s)),u.length===1&&!v&&g(T)};function w(t,s){this.fun=t,this.array=s}w.prototype.run=function(){this.fun.apply(null,this.array)},n.title="browser",n.browser=!0,n.env={},n.argv=[],n.version="",n.versions={};function a(){}n.on=a,n.addListener=a,n.once=a,n.off=a,n.removeListener=a,n.removeAllListeners=a,n.emit=a,n.prependListener=a,n.prependOnceListener=a,n.listeners=function(t){return[]},n.binding=function(t){throw new Error("process.binding is not supported")},n.cwd=function(){return"/"},n.chdir=function(t){throw new Error("process.chdir is not supported")},n.umask=function(){return 0};function l(){}var L=e.exports.browser,x=l,b=e.exports.binding,y=l,_=1,k={},A=l,O=l,C=l,E=l,j=l,q="browser",P="browser",S="browser",M=[],U={nextTick:e.exports.nextTick,title:e.exports.title,browser:L,env:e.exports.env,argv:e.exports.argv,version:e.exports.version,versions:e.exports.versions,on:e.exports.on,addListener:e.exports.addListener,once:e.exports.once,off:e.exports.off,removeListener:e.exports.removeListener,removeAllListeners:e.exports.removeAllListeners,emit:e.exports.emit,emitWarning:x,prependListener:e.exports.prependListener,prependOnceListener:e.exports.prependOnceListener,listeners:e.exports.listeners,binding:b,cwd:e.exports.cwd,chdir:e.exports.chdir,umask:e.exports.umask,exit:y,pid:_,features:k,kill:A,dlopen:O,uptime:C,memoryUsage:E,uvCounters:j,platform:q,arch:P,execPath:S,execArgv:M};r.addListener=e.exports.addListener,r.arch=P,r.argv=e.exports.argv,r.binding=b,r.browser=L,r.chdir=e.exports.chdir,r.cwd=e.exports.cwd,r.default=U,r.dlopen=O,r.emit=e.exports.emit,r.emitWarning=x,r.env=e.exports.env,r.execArgv=M,r.execPath=S,r.exit=y,r.features=k,r.kill=A,r.listeners=e.exports.listeners,r.memoryUsage=E,r.nextTick=e.exports.nextTick,r.off=e.exports.off,r.on=e.exports.on,r.once=e.exports.once,r.pid=_,r.platform=q,r.prependListener=e.exports.prependListener,r.prependOnceListener=e.exports.prependOnceListener,r.removeAllListeners=e.exports.removeAllListeners,r.removeListener=e.exports.removeListener,r.title=e.exports.title,r.umask=e.exports.umask,r.uptime=C,r.uvCounters=j,r.version=e.exports.version,r.versions=e.exports.versions,r=$.exports=U})(h.__module,h.__module.exports);var D=h.__module.exports;const F=W.getDefaultExportFromCjs(D);exports.default=F;
-//# sourceMappingURL=process.js.map

package/dist/node_modules/.pnpm/node-stdlib-browser@1.3.1/node_modules/node-stdlib-browser/cjs/proxy/process.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"process.js","sources":["../../../../../../../../node_modules/.pnpm/node-stdlib-browser@1.3.1/node_modules/node-stdlib-browser/cjs/proxy/process.js"],"sourcesContent":["'use strict';\n\nObject.defineProperty(exports, '__esModule', { value: true });\n\nvar browser$1 = {exports: {}};\n\n// shim for using process in browser\nvar process = browser$1.exports = {};\n\n// cached from whatever global is present so that test runners that stub it\n// don't break things.  But we need to wrap it in a try catch in case it is\n// wrapped in strict mode code which doesn't define any globals.  It's inside a\n// function because try/catches deoptimize in certain engines.\n\nvar cachedSetTimeout;\nvar cachedClearTimeout;\n\nfunction defaultSetTimout() {\n    throw new Error('setTimeout has not been defined');\n}\nfunction defaultClearTimeout () {\n    throw new Error('clearTimeout has not been defined');\n}\n(function () {\n    try {\n        if (typeof setTimeout === 'function') {\n            cachedSetTimeout = setTimeout;\n        } else {\n            cachedSetTimeout = defaultSetTimout;\n        }\n    } catch (e) {\n        cachedSetTimeout = defaultSetTimout;\n    }\n    try {\n        if (typeof clearTimeout === 'function') {\n            cachedClearTimeout = clearTimeout;\n        } else {\n            cachedClearTimeout = defaultClearTimeout;\n        }\n    } catch (e) {\n        cachedClearTimeout = defaultClearTimeout;\n    }\n} ());\nfunction runTimeout(fun) {\n    if (cachedSetTimeout === setTimeout) {\n        //normal enviroments in sane situations\n        return setTimeout(fun, 0);\n    }\n    // if setTimeout wasn't available but was latter defined\n    if ((cachedSetTimeout === defaultSetTimout || !cachedSetTimeout) && setTimeout) {\n        cachedSetTimeout = setTimeout;\n        return setTimeout(fun, 0);\n    }\n    try {\n        // when when somebody has screwed with setTimeout but no I.E. maddness\n        return cachedSetTimeout(fun, 0);\n    } catch(e){\n        try {\n            // When we are in I.E. but the script has been evaled so I.E. doesn't trust the global object when called normally\n            return cachedSetTimeout.call(null, fun, 0);\n        } catch(e){\n            // same as above but when it's a version of I.E. that must have the global object for 'this', hopfully our context correct otherwise it will throw a global error\n            return cachedSetTimeout.call(this, fun, 0);\n        }\n    }\n\n\n}\nfunction runClearTimeout(marker) {\n    if (cachedClearTimeout === clearTimeout) {\n        //normal enviroments in sane situations\n        return clearTimeout(marker);\n    }\n    // if clearTimeout wasn't available but was latter defined\n    if ((cachedClearTimeout === defaultClearTimeout || !cachedClearTimeout) && clearTimeout) {\n        cachedClearTimeout = clearTimeout;\n        return clearTimeout(marker);\n    }\n    try {\n        // when when somebody has screwed with setTimeout but no I.E. maddness\n        return cachedClearTimeout(marker);\n    } catch (e){\n        try {\n            // When we are in I.E. but the script has been evaled so I.E. doesn't  trust the global object when called normally\n            return cachedClearTimeout.call(null, marker);\n        } catch (e){\n            // same as above but when it's a version of I.E. that must have the global object for 'this', hopfully our context correct otherwise it will throw a global error.\n            // Some versions of I.E. have different rules for clearTimeout vs setTimeout\n            return cachedClearTimeout.call(this, marker);\n        }\n    }\n\n\n\n}\nvar queue = [];\nvar draining = false;\nvar currentQueue;\nvar queueIndex = -1;\n\nfunction cleanUpNextTick() {\n    if (!draining || !currentQueue) {\n        return;\n    }\n    draining = false;\n    if (currentQueue.length) {\n        queue = currentQueue.concat(queue);\n    } else {\n        queueIndex = -1;\n    }\n    if (queue.length) {\n        drainQueue();\n    }\n}\n\nfunction drainQueue() {\n    if (draining) {\n        return;\n    }\n    var timeout = runTimeout(cleanUpNextTick);\n    draining = true;\n\n    var len = queue.length;\n    while(len) {\n        currentQueue = queue;\n        queue = [];\n        while (++queueIndex < len) {\n            if (currentQueue) {\n                currentQueue[queueIndex].run();\n            }\n        }\n        queueIndex = -1;\n        len = queue.length;\n    }\n    currentQueue = null;\n    draining = false;\n    runClearTimeout(timeout);\n}\n\nprocess.nextTick = function (fun) {\n    var args = new Array(arguments.length - 1);\n    if (arguments.length > 1) {\n        for (var i = 1; i < arguments.length; i++) {\n            args[i - 1] = arguments[i];\n        }\n    }\n    queue.push(new Item(fun, args));\n    if (queue.length === 1 && !draining) {\n        runTimeout(drainQueue);\n    }\n};\n\n// v8 likes predictible objects\nfunction Item(fun, array) {\n    this.fun = fun;\n    this.array = array;\n}\nItem.prototype.run = function () {\n    this.fun.apply(null, this.array);\n};\nprocess.title = 'browser';\nprocess.browser = true;\nprocess.env = {};\nprocess.argv = [];\nprocess.version = ''; // empty string to avoid regexp issues\nprocess.versions = {};\n\nfunction noop$1() {}\n\nprocess.on = noop$1;\nprocess.addListener = noop$1;\nprocess.once = noop$1;\nprocess.off = noop$1;\nprocess.removeListener = noop$1;\nprocess.removeAllListeners = noop$1;\nprocess.emit = noop$1;\nprocess.prependListener = noop$1;\nprocess.prependOnceListener = noop$1;\n\nprocess.listeners = function (name) { return [] };\n\nprocess.binding = function (name) {\n    throw new Error('process.binding is not supported');\n};\n\nprocess.cwd = function () { return '/' };\nprocess.chdir = function (dir) {\n    throw new Error('process.chdir is not supported');\n};\nprocess.umask = function() { return 0; };\n\nfunction noop() {}\nvar browser = /** @type {boolean} */browser$1.exports.browser;\nvar emitWarning = noop;\nvar binding = /** @type {Function} */browser$1.exports.binding;\nvar exit = noop;\nvar pid = 1;\nvar features = {};\nvar kill = noop;\nvar dlopen = noop;\nvar uptime = noop;\nvar memoryUsage = noop;\nvar uvCounters = noop;\nvar platform = 'browser';\nvar arch = 'browser';\nvar execPath = 'browser';\nvar execArgv = /** @type {string[]} */[];\nvar api = {\n  nextTick: browser$1.exports.nextTick,\n  title: browser$1.exports.title,\n  browser: browser,\n  env: browser$1.exports.env,\n  argv: browser$1.exports.argv,\n  version: browser$1.exports.version,\n  versions: browser$1.exports.versions,\n  on: browser$1.exports.on,\n  addListener: browser$1.exports.addListener,\n  once: browser$1.exports.once,\n  off: browser$1.exports.off,\n  removeListener: browser$1.exports.removeListener,\n  removeAllListeners: browser$1.exports.removeAllListeners,\n  emit: browser$1.exports.emit,\n  emitWarning: emitWarning,\n  prependListener: browser$1.exports.prependListener,\n  prependOnceListener: browser$1.exports.prependOnceListener,\n  listeners: browser$1.exports.listeners,\n  binding: binding,\n  cwd: browser$1.exports.cwd,\n  chdir: browser$1.exports.chdir,\n  umask: browser$1.exports.umask,\n  exit: exit,\n  pid: pid,\n  features: features,\n  kill: kill,\n  dlopen: dlopen,\n  uptime: uptime,\n  memoryUsage: memoryUsage,\n  uvCounters: uvCounters,\n  platform: platform,\n  arch: arch,\n  execPath: execPath,\n  execArgv: execArgv\n};\n\nexports.addListener = browser$1.exports.addListener;\nexports.arch = arch;\nexports.argv = browser$1.exports.argv;\nexports.binding = binding;\nexports.browser = browser;\nexports.chdir = browser$1.exports.chdir;\nexports.cwd = browser$1.exports.cwd;\nexports[\"default\"] = api;\nexports.dlopen = dlopen;\nexports.emit = browser$1.exports.emit;\nexports.emitWarning = emitWarning;\nexports.env = browser$1.exports.env;\nexports.execArgv = execArgv;\nexports.execPath = execPath;\nexports.exit = exit;\nexports.features = features;\nexports.kill = kill;\nexports.listeners = browser$1.exports.listeners;\nexports.memoryUsage = memoryUsage;\nexports.nextTick = browser$1.exports.nextTick;\nexports.off = browser$1.exports.off;\nexports.on = browser$1.exports.on;\nexports.once = browser$1.exports.once;\nexports.pid = pid;\nexports.platform = platform;\nexports.prependListener = browser$1.exports.prependListener;\nexports.prependOnceListener = browser$1.exports.prependOnceListener;\nexports.removeAllListeners = browser$1.exports.removeAllListeners;\nexports.removeListener = browser$1.exports.removeListener;\nexports.title = browser$1.exports.title;\nexports.umask = browser$1.exports.umask;\nexports.uptime = uptime;\nexports.uvCounters = uvCounters;\nexports.version = browser$1.exports.version;\nexports.versions = browser$1.exports.versions;\n\nexports = module.exports = api;\n//# sourceMappingURL=process.js.map\n"],"names":["browser$1","process","cachedSetTimeout","cachedClearTimeout","defaultSetTimout","defaultClearTimeout","runTimeout","fun","runClearTimeout","marker","queue","draining","currentQueue","queueIndex","cleanUpNextTick","drainQueue","timeout","len","args","i","Item","array","noop$1","name","dir","noop","browser","emitWarning","binding","exit","pid","features","kill","dlopen","uptime","memoryUsage","uvCounters","platform","arch","execPath","execArgv","api","exports","module"],"mappings":"sPAEA,OAAO,iBAAwB,aAAc,CAAE,MAAO,GAAM,EAE5D,IAAIA,EAAY,CAAC,QAAS,EAAE,EAGxBC,EAAUD,EAAU,QAAU,CAAC,EAO/BE,EACAC,EAEJ,SAASC,GAAmB,CAClB,MAAA,IAAI,MAAM,iCAAiC,EAErD,SAASC,GAAuB,CACtB,MAAA,IAAI,MAAM,mCAAmC,GAEtD,UAAY,CACL,GAAA,CACI,OAAO,YAAe,WACHH,EAAA,WAEAA,EAAAE,OAEf,CACWF,EAAAE,EAEnB,GAAA,CACI,OAAO,cAAiB,WACHD,EAAA,aAEAA,EAAAE,OAEjB,CACaF,EAAAE,EAE7B,GAAG,EACH,SAASC,EAAWC,EAAK,CACrB,GAAIL,IAAqB,WAEd,OAAA,WAAWK,EAAK,CAAC,EAG5B,IAAKL,IAAqBE,GAAoB,CAACF,IAAqB,WAC7C,OAAAA,EAAA,WACZ,WAAWK,EAAK,CAAC,EAExB,GAAA,CAEO,OAAAL,EAAiBK,EAAK,CAAC,OACxB,CACF,GAAA,CAEA,OAAOL,EAAiB,KAAK,KAAMK,EAAK,CAAC,OACnC,CAEN,OAAOL,EAAiB,KAAK,KAAMK,EAAK,CAAC,IAMrD,SAASC,EAAgBC,EAAQ,CAC7B,GAAIN,IAAuB,aAEvB,OAAO,aAAaM,CAAM,EAG9B,IAAKN,IAAuBE,GAAuB,CAACF,IAAuB,aAClD,OAAAA,EAAA,aACd,aAAaM,CAAM,EAE1B,GAAA,CAEA,OAAON,EAAmBM,CAAM,OACzB,CACH,GAAA,CAEO,OAAAN,EAAmB,KAAK,KAAMM,CAAM,OACpC,CAGA,OAAAN,EAAmB,KAAK,KAAMM,CAAM,IAOvD,IAAIC,EAAQ,CAAC,EACTC,EAAW,GACXC,EACAC,EAAa,GAEjB,SAASC,GAAkB,CACnB,CAACH,GAAY,CAACC,IAGPD,EAAA,GACPC,EAAa,OACLF,EAAAE,EAAa,OAAOF,CAAK,EAEpBG,EAAA,GAEbH,EAAM,QACKK,EAAA,GAInB,SAASA,GAAa,CAClB,GAAI,CAAAJ,EAGA,KAAAK,EAAUV,EAAWQ,CAAe,EAC7BH,EAAA,GAGX,QADIM,EAAMP,EAAM,OACVO,GAAK,CAGA,IAFQL,EAAAF,EACfA,EAAQ,CAAC,EACF,EAAEG,EAAaI,GACdL,GACaA,EAAAC,CAAU,EAAE,IAAI,EAGxBA,EAAA,GACbI,EAAMP,EAAM,OAEDE,EAAA,KACJD,EAAA,GACXH,EAAgBQ,CAAO,GAG3Bf,EAAQ,SAAW,SAAUM,EAAK,CAC9B,IAAIW,EAAO,IAAI,MAAM,UAAU,OAAS,CAAC,EACrC,GAAA,UAAU,OAAS,EACnB,QAASC,EAAI,EAAGA,EAAI,UAAU,OAAQA,IAClCD,EAAKC,EAAI,CAAC,EAAI,UAAUA,CAAC,EAGjCT,EAAM,KAAK,IAAIU,EAAKb,EAAKW,CAAI,CAAC,EAC1BR,EAAM,SAAW,GAAK,CAACC,GACvBL,EAAWS,CAAU,CAE7B,EAGA,SAASK,EAAKb,EAAKc,EAAO,CACtB,KAAK,IAAMd,EACX,KAAK,MAAQc,EAEjBD,EAAK,UAAU,IAAM,UAAY,CAC7B,KAAK,IAAI,MAAM,KAAM,KAAK,KAAK,CACnC,EACAnB,EAAQ,MAAQ,UAChBA,EAAQ,QAAU,GAClBA,EAAQ,IAAM,CAAC,EACfA,EAAQ,KAAO,CAAC,EAChBA,EAAQ,QAAU,GAClBA,EAAQ,SAAW,CAAC,EAEpB,SAASqB,GAAS,EAElBrB,EAAQ,GAAKqB,EACbrB,EAAQ,YAAcqB,EACtBrB,EAAQ,KAAOqB,EACfrB,EAAQ,IAAMqB,EACdrB,EAAQ,eAAiBqB,EACzBrB,EAAQ,mBAAqBqB,EAC7BrB,EAAQ,KAAOqB,EACfrB,EAAQ,gBAAkBqB,EAC1BrB,EAAQ,oBAAsBqB,EAE9BrB,EAAQ,UAAY,SAAUsB,EAAM,CAAE,MAAO,CAAC,CAAE,EAEhDtB,EAAQ,QAAU,SAAUsB,EAAM,CACxB,MAAA,IAAI,MAAM,kCAAkC,CACtD,EAEAtB,EAAQ,IAAM,UAAY,CAAS,MAAA,GAAI,EACvCA,EAAQ,MAAQ,SAAUuB,EAAK,CACrB,MAAA,IAAI,MAAM,gCAAgC,CACpD,EACAvB,EAAQ,MAAQ,UAAW,CAAS,MAAA,EAAG,EAEvC,SAASwB,GAAO,EAChB,IAAIC,EAAgC1B,EAAU,QAAQ,QAClD2B,EAAcF,EACdG,EAAiC5B,EAAU,QAAQ,QACnD6B,EAAOJ,EACPK,EAAM,EACNC,EAAW,CAAC,EACZC,EAAOP,EACPQ,EAASR,EACTS,EAAST,EACTU,EAAcV,EACdW,EAAaX,EACbY,EAAW,UACXC,EAAO,UACPC,EAAW,UACXC,EAAkC,CAAA,EAClCC,EAAM,CACR,SAAUzC,EAAU,QAAQ,SAC5B,MAAOA,EAAU,QAAQ,MACzB,QAAA0B,EACA,IAAK1B,EAAU,QAAQ,IACvB,KAAMA,EAAU,QAAQ,KACxB,QAASA,EAAU,QAAQ,QAC3B,SAAUA,EAAU,QAAQ,SAC5B,GAAIA,EAAU,QAAQ,GACtB,YAAaA,EAAU,QAAQ,YAC/B,KAAMA,EAAU,QAAQ,KACxB,IAAKA,EAAU,QAAQ,IACvB,eAAgBA,EAAU,QAAQ,eAClC,mBAAoBA,EAAU,QAAQ,mBACtC,KAAMA,EAAU,QAAQ,KACxB,YAAA2B,EACA,gBAAiB3B,EAAU,QAAQ,gBACnC,oBAAqBA,EAAU,QAAQ,oBACvC,UAAWA,EAAU,QAAQ,UAC7B,QAAA4B,EACA,IAAK5B,EAAU,QAAQ,IACvB,MAAOA,EAAU,QAAQ,MACzB,MAAOA,EAAU,QAAQ,MACzB,KAAA6B,EACA,IAAAC,EACA,SAAAC,EACA,KAAAC,EACA,OAAAC,EACA,OAAAC,EACA,YAAAC,EACA,WAAAC,EACA,SAAAC,EACA,KAAAC,EACA,SAAAC,EACA,SAAAC,CACF,EAEAE,EAAA,YAAsB1C,EAAU,QAAQ,YACxC0C,EAAA,KAAeJ,EACfI,EAAA,KAAe1C,EAAU,QAAQ,KACjC0C,EAAA,QAAkBd,EAClBc,EAAA,QAAkBhB,EAClBgB,EAAA,MAAgB1C,EAAU,QAAQ,MAClC0C,EAAA,IAAc1C,EAAU,QAAQ,IAChC0C,EAAQ,QAAaD,EACrBC,EAAA,OAAiBT,EACjBS,EAAA,KAAe1C,EAAU,QAAQ,KACjC0C,EAAA,YAAsBf,EACtBe,EAAA,IAAc1C,EAAU,QAAQ,IAChC0C,EAAA,SAAmBF,EACnBE,EAAA,SAAmBH,EACnBG,EAAA,KAAeb,EACfa,EAAA,SAAmBX,EACnBW,EAAA,KAAeV,EACfU,EAAA,UAAoB1C,EAAU,QAAQ,UACtC0C,EAAA,YAAsBP,EACtBO,EAAA,SAAmB1C,EAAU,QAAQ,SACrC0C,EAAA,IAAc1C,EAAU,QAAQ,IAChC0C,EAAA,GAAa1C,EAAU,QAAQ,GAC/B0C,EAAA,KAAe1C,EAAU,QAAQ,KACjC0C,EAAA,IAAcZ,EACdY,EAAA,SAAmBL,EACnBK,EAAA,gBAA0B1C,EAAU,QAAQ,gBAC5C0C,EAAA,oBAA8B1C,EAAU,QAAQ,oBAChD0C,EAAA,mBAA6B1C,EAAU,QAAQ,mBAC/C0C,EAAA,eAAyB1C,EAAU,QAAQ,eAC3C0C,EAAA,MAAgB1C,EAAU,QAAQ,MAClC0C,EAAA,MAAgB1C,EAAU,QAAQ,MAClC0C,EAAA,OAAiBR,EACjBQ,EAAA,WAAqBN,EACrBM,EAAA,QAAkB1C,EAAU,QAAQ,QACpC0C,EAAA,SAAmB1C,EAAU,QAAQ,SAErC0C,EAAUC,UAAiBF","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/node-stdlib-browser@1.3.1/node_modules/node-stdlib-browser/helpers/esbuild/shim.js

@@ -1,2 +0,0 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});require("../../../../../buffer@5.7.1/node_modules/buffer/index.js");const i=require("../../cjs/proxy/process.js");(function(e){function r(){var o=this||self;return delete e.prototype.__magic__,o}if(typeof globalThis=="object")return globalThis;if(this)return r();e.defineProperty(e.prototype,"__magic__",{configurable:!0,get:r});var t=__magic__;return t})(Object);exports.process=i.default;exports.Buffer=buffer.Buffer;
-//# sourceMappingURL=shim.js.map

package/dist/node_modules/.pnpm/node-stdlib-browser@1.3.1/node_modules/node-stdlib-browser/helpers/esbuild/shim.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"shim.js","sources":["../../../../../../../../node_modules/.pnpm/node-stdlib-browser@1.3.1/node_modules/node-stdlib-browser/helpers/esbuild/shim.js"],"sourcesContent":["var _globalThis = function (Object) {\n  function get() {\n    var _global = this || self;\n    delete Object.prototype.__magic__;\n    return _global;\n  }\n  if (typeof globalThis === \"object\") {\n    return globalThis;\n  }\n  if (this) {\n    return get();\n  } else {\n    Object.defineProperty(Object.prototype, \"__magic__\", {\n      configurable: true,\n      get: get\n    });\n    var _global = __magic__;\n    return _global;\n  }\n}(Object);\nimport { Buffer } from 'buffer';\nimport process from 'process';\nvar _global = _globalThis;\nexport { Buffer, process, _global as global };\n"],"names":["Object","get","_global"],"mappings":"mMAAkB,SAAUA,EAAQ,CAClC,SAASC,GAAM,CACb,IAAIC,EAAU,MAAQ,KACtB,cAAOF,EAAO,UAAU,UACjBE,CAAA,CAEL,GAAA,OAAO,YAAe,SACjB,OAAA,WAET,GAAI,KACF,OAAOD,EAAI,EAEXD,EAAO,eAAeA,EAAO,UAAW,YAAa,CACnD,aAAc,GACd,IAAAC,CAAA,CACD,EACD,IAAIC,EAAU,UACPA,OAAAA,CAEX,GAAE,MAAM","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/object-is@1.1.6/node_modules/object-is/implementation.js

@@ -1,2 +0,0 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});var n,u;function o(){if(u)return n;u=1;var i=function(t){return t!==t};return n=function(e,r){return e===0&&r===0?1/e===1/r:!!(e===r||i(e)&&i(r))},n}exports.__require=o;
-//# sourceMappingURL=implementation.js.map

package/dist/node_modules/.pnpm/object-is@1.1.6/node_modules/object-is/implementation.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"implementation.js","sources":["../../../../../../node_modules/.pnpm/object-is@1.1.6/node_modules/object-is/implementation.js"],"sourcesContent":["'use strict';\n\nvar numberIsNaN = function (value) {\n\treturn value !== value;\n};\n\nmodule.exports = function is(a, b) {\n\tif (a === 0 && b === 0) {\n\t\treturn 1 / a === 1 / b;\n\t}\n\tif (a === b) {\n\t\treturn true;\n\t}\n\tif (numberIsNaN(a) && numberIsNaN(b)) {\n\t\treturn true;\n\t}\n\treturn false;\n};\n\n"],"names":["numberIsNaN","value","implementation","a","b"],"mappings":"uHAEA,IAAIA,EAAc,SAAUC,EAAO,CAClC,OAAOA,IAAUA,CACjB,EAED,OAAAC,EAAiB,SAAYC,EAAGC,EAAG,CAClC,OAAID,IAAM,GAAKC,IAAM,EACb,EAAID,IAAM,EAAIC,EAElB,GAAAD,IAAMC,GAGNJ,EAAYG,CAAC,GAAKH,EAAYI,CAAC,EAInC","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/object-is@1.1.6/node_modules/object-is/index.js

@@ -1,2 +0,0 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const a=require("../../../define-properties@1.2.1/node_modules/define-properties/index.js"),s=require("../../../call-bind@1.0.8/node_modules/call-bind/index.js"),c=require("./implementation.js"),q=require("./polyfill.js"),_=require("./shim.js");var e,t;function m(){if(t)return e;t=1;var n=a.__require(),l=s.__require(),u=c.__require(),r=q.__require(),o=_.__require(),i=l(r(),Object);return n(i,{getPolyfill:r,implementation:u,shim:o}),e=i,e}exports.__require=m;
-//# sourceMappingURL=index.js.map

package/dist/node_modules/.pnpm/object-is@1.1.6/node_modules/object-is/index.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sources":["../../../../../../node_modules/.pnpm/object-is@1.1.6/node_modules/object-is/index.js"],"sourcesContent":["'use strict';\n\nvar define = require('define-properties');\nvar callBind = require('call-bind');\n\nvar implementation = require('./implementation');\nvar getPolyfill = require('./polyfill');\nvar shim = require('./shim');\n\nvar polyfill = callBind(getPolyfill(), Object);\n\ndefine(polyfill, {\n\tgetPolyfill: getPolyfill,\n\timplementation: implementation,\n\tshim: shim\n});\n\nmodule.exports = polyfill;\n"],"names":["define","require$$0","callBind","require$$1","implementation","require$$2","getPolyfill","require$$3","shim","require$$4","polyfill","objectIs"],"mappings":"4WAEA,IAAIA,EAASC,EAAAA,UAA4B,EACrCC,EAAWC,EAAAA,UAAoB,EAE/BC,EAAiBC,EAAAA,UAA2B,EAC5CC,EAAcC,EAAAA,UAAqB,EACnCC,EAAOC,EAAAA,UAAiB,EAExBC,EAAWR,EAASI,EAAW,EAAI,MAAM,EAE7C,OAAAN,EAAOU,EAAU,CAChB,YAAaJ,EACb,eAAgBF,EAChB,KAAMI,CACP,CAAC,EAEDG,EAAiBD","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/object-is@1.1.6/node_modules/object-is/polyfill.js

@@ -1,2 +0,0 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const t=require("./implementation.js");var e,i;function l(){if(i)return e;i=1;var r=t.__require();return e=function(){return typeof Object.is=="function"?Object.is:r},e}exports.__require=l;
-//# sourceMappingURL=polyfill.js.map

package/dist/node_modules/.pnpm/object-is@1.1.6/node_modules/object-is/polyfill.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"polyfill.js","sources":["../../../../../../node_modules/.pnpm/object-is@1.1.6/node_modules/object-is/polyfill.js"],"sourcesContent":["'use strict';\n\nvar implementation = require('./implementation');\n\nmodule.exports = function getPolyfill() {\n\treturn typeof Object.is === 'function' ? Object.is : implementation;\n};\n"],"names":["implementation","require$$0","polyfill"],"mappings":"8JAEA,IAAIA,EAAiBC,EAAAA,UAA2B,EAElC,OAAAC,EAAG,UAAuB,CACvC,OAAO,OAAO,OAAO,IAAO,WAAa,OAAO,GAAKF,CACrD","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/object-is@1.1.6/node_modules/object-is/shim.js

@@ -1,2 +0,0 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const n=require("./polyfill.js"),s=require("../../../define-properties@1.2.1/node_modules/define-properties/index.js");var r,i;function l(){if(i)return r;i=1;var t=n.__require(),u=s.__require();return r=function(){var e=t();return u(Object,{is:e},{is:function(){return Object.is!==e}}),e},r}exports.__require=l;
-//# sourceMappingURL=shim.js.map

package/dist/node_modules/.pnpm/object-is@1.1.6/node_modules/object-is/shim.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"shim.js","sources":["../../../../../../node_modules/.pnpm/object-is@1.1.6/node_modules/object-is/shim.js"],"sourcesContent":["'use strict';\n\nvar getPolyfill = require('./polyfill');\nvar define = require('define-properties');\n\nmodule.exports = function shimObjectIs() {\n\tvar polyfill = getPolyfill();\n\tdefine(Object, { is: polyfill }, {\n\t\tis: function testObjectIs() {\n\t\t\treturn Object.is !== polyfill;\n\t\t}\n\t});\n\treturn polyfill;\n};\n"],"names":["getPolyfill","require$$0","define","require$$1","shim","polyfill"],"mappings":"8OAEA,IAAIA,EAAcC,EAAAA,UAAqB,EACnCC,EAASC,EAAAA,UAA4B,EAE3B,OAAAC,EAAG,UAAwB,CACxC,IAAIC,EAAWL,EAAa,EAC5B,OAAAE,EAAO,OAAQ,CAAE,GAAIG,CAAQ,EAAI,CAChC,GAAI,UAAwB,CAC3B,OAAO,OAAO,KAAOA,EAExB,CAAE,EACMA,CACP","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/object-keys@1.1.1/node_modules/object-keys/implementation.js

@@ -1,2 +0,0 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const P=require("./isArguments.js");var c,w;function T(){if(w)return c;w=1;var p;if(!Object.keys){var i=Object.prototype.hasOwnProperty,s=Object.prototype.toString,h=P.__require(),v=Object.prototype.propertyIsEnumerable,d=!v.call({toString:null},"toString"),O=v.call(function(){},"prototype"),o=["toString","toLocaleString","valueOf","hasOwnProperty","isPrototypeOf","propertyIsEnumerable","constructor"],u=function(e){var r=e.constructor;return r&&r.prototype===e},S={$applicationCache:!0,$console:!0,$external:!0,$frame:!0,$frameElement:!0,$frames:!0,$innerHeight:!0,$innerWidth:!0,$onmozfullscreenchange:!0,$onmozfullscreenerror:!0,$outerHeight:!0,$outerWidth:!0,$pageXOffset:!0,$pageYOffset:!0,$parent:!0,$scrollLeft:!0,$scrollTop:!0,$scrollX:!0,$scrollY:!0,$self:!0,$webkitIndexedDB:!0,$webkitStorageInfo:!0,$window:!0},m=function(){if(typeof window>"u")return!1;for(var e in window)try{if(!S["$"+e]&&i.call(window,e)&&window[e]!==null&&typeof window[e]=="object")try{u(window[e])}catch{return!0}}catch{return!0}return!1}(),I=function(e){if(typeof window>"u"||!m)return u(e);try{return u(e)}catch{return!1}};p=function(r){var g=r!==null&&typeof r=="object",y=s.call(r)==="[object Function]",$=h(r),_=g&&s.call(r)==="[object String]",t=[];if(!g&&!y&&!$)throw new TypeError("Object.keys called on a non-object");var b=O&&y;if(_&&r.length>0&&!i.call(r,0))for(var a=0;a<r.length;++a)t.push(String(a));if($&&r.length>0)for(var l=0;l<r.length;++l)t.push(String(l));else for(var f in r)!(b&&f==="prototype")&&i.call(r,f)&&t.push(String(f));if(d)for(var q=I(r),n=0;n<o.length;++n)!(q&&o[n]==="constructor")&&i.call(r,o[n])&&t.push(o[n]);return t}}return c=p,c}exports.__require=T;
-//# sourceMappingURL=implementation.js.map

package/dist/node_modules/.pnpm/object-keys@1.1.1/node_modules/object-keys/implementation.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"implementation.js","sources":["../../../../../../node_modules/.pnpm/object-keys@1.1.1/node_modules/object-keys/implementation.js"],"sourcesContent":["'use strict';\n\nvar keysShim;\nif (!Object.keys) {\n\t// modified from https://github.com/es-shims/es5-shim\n\tvar has = Object.prototype.hasOwnProperty;\n\tvar toStr = Object.prototype.toString;\n\tvar isArgs = require('./isArguments'); // eslint-disable-line global-require\n\tvar isEnumerable = Object.prototype.propertyIsEnumerable;\n\tvar hasDontEnumBug = !isEnumerable.call({ toString: null }, 'toString');\n\tvar hasProtoEnumBug = isEnumerable.call(function () {}, 'prototype');\n\tvar dontEnums = [\n\t\t'toString',\n\t\t'toLocaleString',\n\t\t'valueOf',\n\t\t'hasOwnProperty',\n\t\t'isPrototypeOf',\n\t\t'propertyIsEnumerable',\n\t\t'constructor'\n\t];\n\tvar equalsConstructorPrototype = function (o) {\n\t\tvar ctor = o.constructor;\n\t\treturn ctor && ctor.prototype === o;\n\t};\n\tvar excludedKeys = {\n\t\t$applicationCache: true,\n\t\t$console: true,\n\t\t$external: true,\n\t\t$frame: true,\n\t\t$frameElement: true,\n\t\t$frames: true,\n\t\t$innerHeight: true,\n\t\t$innerWidth: true,\n\t\t$onmozfullscreenchange: true,\n\t\t$onmozfullscreenerror: true,\n\t\t$outerHeight: true,\n\t\t$outerWidth: true,\n\t\t$pageXOffset: true,\n\t\t$pageYOffset: true,\n\t\t$parent: true,\n\t\t$scrollLeft: true,\n\t\t$scrollTop: true,\n\t\t$scrollX: true,\n\t\t$scrollY: true,\n\t\t$self: true,\n\t\t$webkitIndexedDB: true,\n\t\t$webkitStorageInfo: true,\n\t\t$window: true\n\t};\n\tvar hasAutomationEqualityBug = (function () {\n\t\t/* global window */\n\t\tif (typeof window === 'undefined') { return false; }\n\t\tfor (var k in window) {\n\t\t\ttry {\n\t\t\t\tif (!excludedKeys['$' + k] && has.call(window, k) && window[k] !== null && typeof window[k] === 'object') {\n\t\t\t\t\ttry {\n\t\t\t\t\t\tequalsConstructorPrototype(window[k]);\n\t\t\t\t\t} catch (e) {\n\t\t\t\t\t\treturn true;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t} catch (e) {\n\t\t\t\treturn true;\n\t\t\t}\n\t\t}\n\t\treturn false;\n\t}());\n\tvar equalsConstructorPrototypeIfNotBuggy = function (o) {\n\t\t/* global window */\n\t\tif (typeof window === 'undefined' || !hasAutomationEqualityBug) {\n\t\t\treturn equalsConstructorPrototype(o);\n\t\t}\n\t\ttry {\n\t\t\treturn equalsConstructorPrototype(o);\n\t\t} catch (e) {\n\t\t\treturn false;\n\t\t}\n\t};\n\n\tkeysShim = function keys(object) {\n\t\tvar isObject = object !== null && typeof object === 'object';\n\t\tvar isFunction = toStr.call(object) === '[object Function]';\n\t\tvar isArguments = isArgs(object);\n\t\tvar isString = isObject && toStr.call(object) === '[object String]';\n\t\tvar theKeys = [];\n\n\t\tif (!isObject && !isFunction && !isArguments) {\n\t\t\tthrow new TypeError('Object.keys called on a non-object');\n\t\t}\n\n\t\tvar skipProto = hasProtoEnumBug && isFunction;\n\t\tif (isString && object.length > 0 && !has.call(object, 0)) {\n\t\t\tfor (var i = 0; i < object.length; ++i) {\n\t\t\t\ttheKeys.push(String(i));\n\t\t\t}\n\t\t}\n\n\t\tif (isArguments && object.length > 0) {\n\t\t\tfor (var j = 0; j < object.length; ++j) {\n\t\t\t\ttheKeys.push(String(j));\n\t\t\t}\n\t\t} else {\n\t\t\tfor (var name in object) {\n\t\t\t\tif (!(skipProto && name === 'prototype') && has.call(object, name)) {\n\t\t\t\t\ttheKeys.push(String(name));\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tif (hasDontEnumBug) {\n\t\t\tvar skipConstructor = equalsConstructorPrototypeIfNotBuggy(object);\n\n\t\t\tfor (var k = 0; k < dontEnums.length; ++k) {\n\t\t\t\tif (!(skipConstructor && dontEnums[k] === 'constructor') && has.call(object, dontEnums[k])) {\n\t\t\t\t\ttheKeys.push(dontEnums[k]);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn theKeys;\n\t};\n}\nmodule.exports = keysShim;\n"],"names":["keysShim","has","toStr","isArgs","require$$0","isEnumerable","hasDontEnumBug","hasProtoEnumBug","dontEnums","equalsConstructorPrototype","o","ctor","excludedKeys","hasAutomationEqualityBug","k","equalsConstructorPrototypeIfNotBuggy","object","isObject","isFunction","isArguments","isString","theKeys","skipProto","i","j","name","skipConstructor","implementation"],"mappings":"2JAEA,IAAIA,EACJ,GAAI,CAAC,OAAO,KAAM,CAEb,IAAAC,EAAM,OAAO,UAAU,eACvBC,EAAQ,OAAO,UAAU,SACzBC,EAASC,EAAAA,UAAuB,EAChCC,EAAe,OAAO,UAAU,qBAChCC,EAAiB,CAACD,EAAa,KAAK,CAAE,SAAU,MAAQ,UAAU,EAClEE,EAAkBF,EAAa,KAAK,UAAY,GAAI,WAAW,EAC/DG,EAAY,CACf,WACA,iBACA,UACA,iBACA,gBACA,uBACA,aACD,EACIC,EAA6B,SAAUC,EAAG,CAC7C,IAAIC,EAAOD,EAAE,YACN,OAAAC,GAAQA,EAAK,YAAcD,CACnC,EACIE,EAAe,CAClB,kBAAmB,GACnB,SAAU,GACV,UAAW,GACX,OAAQ,GACR,cAAe,GACf,QAAS,GACT,aAAc,GACd,YAAa,GACb,uBAAwB,GACxB,sBAAuB,GACvB,aAAc,GACd,YAAa,GACb,aAAc,GACd,aAAc,GACd,QAAS,GACT,YAAa,GACb,WAAY,GACZ,SAAU,GACV,SAAU,GACV,MAAO,GACP,iBAAkB,GAClB,mBAAoB,GACpB,QAAS,EACV,EACIC,EAA4B,UAAY,CAEvC,GAAA,OAAO,OAAW,IAAsB,MAAA,GAC5C,QAASC,KAAK,OACT,GAAA,CACH,GAAI,CAACF,EAAa,IAAME,CAAC,GAAKb,EAAI,KAAK,OAAQa,CAAC,GAAK,OAAOA,CAAC,IAAM,MAAQ,OAAO,OAAOA,CAAC,GAAM,SAC3F,GAAA,CACwBL,EAAA,OAAOK,CAAC,CAAC,OACzB,CACJ,MAAA,SAGE,CACJ,MAAA,GAGF,MAAA,EAAA,EACN,EACEC,EAAuC,SAAUL,EAAG,CAEvD,GAAI,OAAO,OAAW,KAAe,CAACG,EACrC,OAAOJ,EAA2BC,CAAC,EAEhC,GAAA,CACH,OAAOD,EAA2BC,CAAC,OACxB,CACJ,MAAA,GAET,EAEWV,EAAA,SAAcgB,EAAQ,CAChC,IAAIC,EAAWD,IAAW,MAAQ,OAAOA,GAAW,SAChDE,EAAahB,EAAM,KAAKc,CAAM,IAAM,oBACpCG,EAAchB,EAAOa,CAAM,EAC3BI,EAAWH,GAAYf,EAAM,KAAKc,CAAM,IAAM,kBAC9CK,EAAU,CAAC,EAEf,GAAI,CAACJ,GAAY,CAACC,GAAc,CAACC,EAC1B,MAAA,IAAI,UAAU,oCAAoC,EAGzD,IAAIG,EAAYf,GAAmBW,EAC/B,GAAAE,GAAYJ,EAAO,OAAS,GAAK,CAACf,EAAI,KAAKe,EAAQ,CAAC,EACvD,QAASO,EAAI,EAAGA,EAAIP,EAAO,OAAQ,EAAEO,EAC5BF,EAAA,KAAK,OAAOE,CAAC,CAAC,EAIpB,GAAAJ,GAAeH,EAAO,OAAS,EAClC,QAASQ,EAAI,EAAGA,EAAIR,EAAO,OAAQ,EAAEQ,EAC5BH,EAAA,KAAK,OAAOG,CAAC,CAAC,MAGvB,SAASC,KAAQT,EACZ,EAAEM,GAAaG,IAAS,cAAgBxB,EAAI,KAAKe,EAAQS,CAAI,GACxDJ,EAAA,KAAK,OAAOI,CAAI,CAAC,EAK5B,GAAInB,EAGH,QAFIoB,EAAkBX,EAAqCC,CAAM,EAExDF,EAAI,EAAGA,EAAIN,EAAU,OAAQ,EAAEM,EACnC,EAAEY,GAAmBlB,EAAUM,CAAC,IAAM,gBAAkBb,EAAI,KAAKe,EAAQR,EAAUM,CAAC,CAAC,GAChFO,EAAA,KAAKb,EAAUM,CAAC,CAAC,EAIrB,OAAAO,CACR,EAED,OAAAM,EAAiB3B","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/object-keys@1.1.1/node_modules/object-keys/index.js

@@ -1,2 +0,0 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const l=require("./isArguments.js"),b=require("./implementation.js");var i,c;function g(){if(c)return i;c=1;var y=Array.prototype.slice,a=l.__require(),n=Object.keys,e=n?function(r){return n(r)}:b.__require(),u=Object.keys;return e.shim=function(){if(Object.keys){var r=function(){var t=Object.keys(arguments);return t&&t.length===arguments.length}(1,2);r||(Object.keys=function(s){return a(s)?u(y.call(s)):u(s)})}else Object.keys=e;return Object.keys||e},i=e,i}exports.__require=g;
-//# sourceMappingURL=index.js.map

package/dist/node_modules/.pnpm/object-keys@1.1.1/node_modules/object-keys/index.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sources":["../../../../../../node_modules/.pnpm/object-keys@1.1.1/node_modules/object-keys/index.js"],"sourcesContent":["'use strict';\n\nvar slice = Array.prototype.slice;\nvar isArgs = require('./isArguments');\n\nvar origKeys = Object.keys;\nvar keysShim = origKeys ? function keys(o) { return origKeys(o); } : require('./implementation');\n\nvar originalKeys = Object.keys;\n\nkeysShim.shim = function shimObjectKeys() {\n\tif (Object.keys) {\n\t\tvar keysWorksWithArguments = (function () {\n\t\t\t// Safari 5.0 bug\n\t\t\tvar args = Object.keys(arguments);\n\t\t\treturn args && args.length === arguments.length;\n\t\t}(1, 2));\n\t\tif (!keysWorksWithArguments) {\n\t\t\tObject.keys = function keys(object) { // eslint-disable-line func-name-matching\n\t\t\t\tif (isArgs(object)) {\n\t\t\t\t\treturn originalKeys(slice.call(object));\n\t\t\t\t}\n\t\t\t\treturn originalKeys(object);\n\t\t\t};\n\t\t}\n\t} else {\n\t\tObject.keys = keysShim;\n\t}\n\treturn Object.keys || keysShim;\n};\n\nmodule.exports = keysShim;\n"],"names":["slice","isArgs","require$$0","origKeys","keysShim","o","require$$1","originalKeys","keysWorksWithArguments","args","object","objectKeys"],"mappings":"4LAEA,IAAIA,EAAQ,MAAM,UAAU,MACxBC,EAASC,EAAAA,UAAwB,EAEjCC,EAAW,OAAO,KAClBC,EAAWD,EAAW,SAAcE,EAAG,CAAE,OAAOF,EAASE,CAAC,CAAI,EAAGC,YAA2B,EAE5FC,EAAe,OAAO,KAE1B,OAAAH,EAAS,KAAO,UAA0B,CACzC,GAAI,OAAO,KAAM,CAChB,IAAII,EAA0B,UAAY,CAEzC,IAAIC,EAAO,OAAO,KAAK,SAAS,EAChC,OAAOA,GAAQA,EAAK,SAAW,UAAU,MAC5C,EAAI,EAAG,CAAC,EACDD,IACJ,OAAO,KAAO,SAAcE,EAAQ,CACnC,OAAIT,EAAOS,CAAM,EACTH,EAAaP,EAAM,KAAKU,CAAM,CAAC,EAEhCH,EAAaG,CAAM,CAC1B,EAEJ,MACE,OAAO,KAAON,EAEf,OAAO,OAAO,MAAQA,CACtB,EAEDO,EAAiBP","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/object-keys@1.1.1/node_modules/object-keys/isArguments.js

@@ -1,2 +0,0 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});var e,i;function s(){if(i)return e;i=1;var n=Object.prototype.toString;return e=function(r){var o=n.call(r),t=o==="[object Arguments]";return t||(t=o!=="[object Array]"&&r!==null&&typeof r=="object"&&typeof r.length=="number"&&r.length>=0&&n.call(r.callee)==="[object Function]"),t},e}exports.__require=s;
-//# sourceMappingURL=isArguments.js.map

package/dist/node_modules/.pnpm/object-keys@1.1.1/node_modules/object-keys/isArguments.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"isArguments.js","sources":["../../../../../../node_modules/.pnpm/object-keys@1.1.1/node_modules/object-keys/isArguments.js"],"sourcesContent":["'use strict';\n\nvar toStr = Object.prototype.toString;\n\nmodule.exports = function isArguments(value) {\n\tvar str = toStr.call(value);\n\tvar isArgs = str === '[object Arguments]';\n\tif (!isArgs) {\n\t\tisArgs = str !== '[object Array]' &&\n\t\t\tvalue !== null &&\n\t\t\ttypeof value === 'object' &&\n\t\t\ttypeof value.length === 'number' &&\n\t\t\tvalue.length >= 0 &&\n\t\t\ttoStr.call(value.callee) === '[object Function]';\n\t}\n\treturn isArgs;\n};\n"],"names":["toStr","isArguments","value","str","isArgs"],"mappings":"uHAEA,IAAIA,EAAQ,OAAO,UAAU,SAE7B,OAAAC,EAAiB,SAAqBC,EAAO,CAC5C,IAAIC,EAAMH,EAAM,KAAKE,CAAK,EACtBE,EAASD,IAAQ,qBACrB,OAAKC,IACJA,EAASD,IAAQ,kBAChBD,IAAU,MACV,OAAOA,GAAU,UACjB,OAAOA,EAAM,QAAW,UACxBA,EAAM,QAAU,GAChBF,EAAM,KAAKE,EAAM,MAAM,IAAM,qBAExBE,CACP","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/object.assign@4.1.7/node_modules/object.assign/implementation.js

@@ -1,2 +0,0 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const y=require("../../../object-keys@1.1.1/node_modules/object-keys/index.js"),O=require("../../../has-symbols@1.1.0/node_modules/has-symbols/shams.js"),S=require("../../../call-bound@1.0.4/node_modules/call-bound/index.js"),$=require("../../../es-object-atoms@1.1.1/node_modules/es-object-atoms/index.js");var l,q;function w(){if(q)return l;q=1;var h=y.__require(),v=O.__require()(),s=S.__require(),e=$.__require(),_=s("Array.prototype.push"),p=s("Object.prototype.propertyIsEnumerable"),f=v?e.getOwnPropertySymbols:null;return l=function(c,j){if(c==null)throw new TypeError("target must be an object");var t=e(c);if(arguments.length===1)return t;for(var n=1;n<arguments.length;++n){var r=e(arguments[n]),a=h(r),b=v&&(e.getOwnPropertySymbols||f);if(b)for(var g=b(r),u=0;u<g.length;++u){var m=g[u];p(r,m)&&_(a,m)}for(var o=0;o<a.length;++o){var i=a[o];if(p(r,i)){var d=r[i];t[i]=d}}}return t},l}exports.__require=w;
-//# sourceMappingURL=implementation.js.map

package/dist/node_modules/.pnpm/object.assign@4.1.7/node_modules/object.assign/implementation.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"implementation.js","sources":["../../../../../../node_modules/.pnpm/object.assign@4.1.7/node_modules/object.assign/implementation.js"],"sourcesContent":["'use strict';\n\n// modified from https://github.com/es-shims/es6-shim\nvar objectKeys = require('object-keys');\nvar hasSymbols = require('has-symbols/shams')();\nvar callBound = require('call-bound');\nvar $Object = require('es-object-atoms');\nvar $push = callBound('Array.prototype.push');\nvar $propIsEnumerable = callBound('Object.prototype.propertyIsEnumerable');\nvar originalGetSymbols = hasSymbols ? $Object.getOwnPropertySymbols : null;\n\n// eslint-disable-next-line no-unused-vars\nmodule.exports = function assign(target, source1) {\n\tif (target == null) { throw new TypeError('target must be an object'); }\n\tvar to = $Object(target); // step 1\n\tif (arguments.length === 1) {\n\t\treturn to; // step 2\n\t}\n\tfor (var s = 1; s < arguments.length; ++s) {\n\t\tvar from = $Object(arguments[s]); // step 3.a.i\n\n\t\t// step 3.a.ii:\n\t\tvar keys = objectKeys(from);\n\t\tvar getSymbols = hasSymbols && ($Object.getOwnPropertySymbols || originalGetSymbols);\n\t\tif (getSymbols) {\n\t\t\tvar syms = getSymbols(from);\n\t\t\tfor (var j = 0; j < syms.length; ++j) {\n\t\t\t\tvar key = syms[j];\n\t\t\t\tif ($propIsEnumerable(from, key)) {\n\t\t\t\t\t$push(keys, key);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\t// step 3.a.iii:\n\t\tfor (var i = 0; i < keys.length; ++i) {\n\t\t\tvar nextKey = keys[i];\n\t\t\tif ($propIsEnumerable(from, nextKey)) { // step 3.a.iii.2\n\t\t\t\tvar propValue = from[nextKey]; // step 3.a.iii.2.a\n\t\t\t\tto[nextKey] = propValue; // step 3.a.iii.2.b\n\t\t\t}\n\t\t}\n\t}\n\n\treturn to; // step 4\n};\n"],"names":["objectKeys","require$$0","hasSymbols","require$$1","callBound","require$$2","$Object","require$$3","$push","$propIsEnumerable","originalGetSymbols","implementation","target","source1","to","s","from","keys","getSymbols","syms","j","key","i","nextKey","propValue"],"mappings":"2aAGA,IAAIA,EAAaC,EAAAA,UAAsB,EACnCC,EAAaC,EAAAA,YAA8B,EAC3CC,EAAYC,EAAAA,UAAqB,EACjCC,EAAUC,EAAAA,UAA0B,EACpCC,EAAQJ,EAAU,sBAAsB,EACxCK,EAAoBL,EAAU,uCAAuC,EACrEM,EAAqBR,EAAaI,EAAQ,sBAAwB,KAGtE,OAAAK,EAAiB,SAAgBC,EAAQC,EAAS,CACjD,GAAID,GAAU,KAAQ,MAAM,IAAI,UAAU,0BAA0B,EACpE,IAAIE,EAAKR,EAAQM,CAAM,EACvB,GAAI,UAAU,SAAW,EACxB,OAAOE,EAER,QAASC,EAAI,EAAGA,EAAI,UAAU,OAAQ,EAAEA,EAAG,CAC1C,IAAIC,EAAOV,EAAQ,UAAUS,CAAC,CAAC,EAG3BE,EAAOjB,EAAWgB,CAAI,EACtBE,EAAahB,IAAeI,EAAQ,uBAAyBI,GACjE,GAAIQ,EAEH,QADIC,EAAOD,EAAWF,CAAI,EACjBI,EAAI,EAAGA,EAAID,EAAK,OAAQ,EAAEC,EAAG,CACrC,IAAIC,EAAMF,EAAKC,CAAC,EACZX,EAAkBO,EAAMK,CAAG,GAC9Bb,EAAMS,EAAMI,CAAG,EAMlB,QAASC,EAAI,EAAGA,EAAIL,EAAK,OAAQ,EAAEK,EAAG,CACrC,IAAIC,EAAUN,EAAKK,CAAC,EACpB,GAAIb,EAAkBO,EAAMO,CAAO,EAAG,CACrC,IAAIC,EAAYR,EAAKO,CAAO,EAC5BT,EAAGS,CAAO,EAAIC,IAKjB,OAAOV,CACP","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/object.assign@4.1.7/node_modules/object.assign/polyfill.js

@@ -1,2 +0,0 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const v=require("./implementation.js");var i,l;function g(){if(l)return i;l=1;var n=v.__require(),o=function(){if(!Object.assign)return!1;for(var r="abcdefghijklmnopqrst",e=r.split(""),a={},t=0;t<e.length;++t)a[e[t]]=e[t];var c=Object.assign({},a),s="";for(var f in c)s+=f;return r!==s},u=function(){if(!Object.assign||!Object.preventExtensions)return!1;var r=Object.preventExtensions({1:2});try{Object.assign(r,"xy")}catch{return r[1]==="y"}return!1};return i=function(){return!Object.assign||o()||u()?n:Object.assign},i}exports.__require=g;
-//# sourceMappingURL=polyfill.js.map

package/dist/node_modules/.pnpm/object.assign@4.1.7/node_modules/object.assign/polyfill.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"polyfill.js","sources":["../../../../../../node_modules/.pnpm/object.assign@4.1.7/node_modules/object.assign/polyfill.js"],"sourcesContent":["'use strict';\n\nvar implementation = require('./implementation');\n\nvar lacksProperEnumerationOrder = function () {\n\tif (!Object.assign) {\n\t\treturn false;\n\t}\n\t/*\n\t * v8, specifically in node 4.x, has a bug with incorrect property enumeration order\n\t * note: this does not detect the bug unless there's 20 characters\n\t */\n\tvar str = 'abcdefghijklmnopqrst';\n\tvar letters = str.split('');\n\tvar map = {};\n\tfor (var i = 0; i < letters.length; ++i) {\n\t\tmap[letters[i]] = letters[i];\n\t}\n\tvar obj = Object.assign({}, map);\n\tvar actual = '';\n\tfor (var k in obj) {\n\t\tactual += k;\n\t}\n\treturn str !== actual;\n};\n\nvar assignHasPendingExceptions = function () {\n\tif (!Object.assign || !Object.preventExtensions) {\n\t\treturn false;\n\t}\n\t/*\n\t * Firefox 37 still has \"pending exception\" logic in its Object.assign implementation,\n\t * which is 72% slower than our shim, and Firefox 40's native implementation.\n\t */\n\tvar thrower = Object.preventExtensions({ 1: 2 });\n\ttry {\n\t\tObject.assign(thrower, 'xy');\n\t} catch (e) {\n\t\treturn thrower[1] === 'y';\n\t}\n\treturn false;\n};\n\nmodule.exports = function getPolyfill() {\n\tif (!Object.assign) {\n\t\treturn implementation;\n\t}\n\tif (lacksProperEnumerationOrder()) {\n\t\treturn implementation;\n\t}\n\tif (assignHasPendingExceptions()) {\n\t\treturn implementation;\n\t}\n\treturn Object.assign;\n};\n"],"names":["implementation","require$$0","lacksProperEnumerationOrder","str","letters","map","i","obj","actual","k","assignHasPendingExceptions","thrower","polyfill"],"mappings":"8JAEA,IAAIA,EAAiBC,EAAAA,UAA2B,EAE5CC,EAA8B,UAAY,CAC7C,GAAI,CAAC,OAAO,OACX,MAAO,GASR,QAHIC,EAAM,uBACNC,EAAUD,EAAI,MAAM,EAAE,EACtBE,EAAM,CAAE,EACHC,EAAI,EAAGA,EAAIF,EAAQ,OAAQ,EAAEE,EACrCD,EAAID,EAAQE,CAAC,CAAC,EAAIF,EAAQE,CAAC,EAE5B,IAAIC,EAAM,OAAO,OAAO,CAAA,EAAIF,CAAG,EAC3BG,EAAS,GACb,QAASC,KAAKF,EACbC,GAAUC,EAEX,OAAON,IAAQK,CACf,EAEGE,EAA6B,UAAY,CAC5C,GAAI,CAAC,OAAO,QAAU,CAAC,OAAO,kBAC7B,MAAO,GAMR,IAAIC,EAAU,OAAO,kBAAkB,CAAE,EAAG,CAAC,CAAE,EAC/C,GAAI,CACH,OAAO,OAAOA,EAAS,IAAI,CAC3B,MAAW,CACX,OAAOA,EAAQ,CAAC,IAAM,IAEvB,MAAO,EACP,EAEa,OAAAC,EAAG,UAAuB,CAOvC,MANI,CAAC,OAAO,QAGRV,EAA2B,GAG3BQ,EAA0B,EACtBV,EAED,OAAO,MACd","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/pako@1.0.11/node_modules/pako/lib/utils/common.js

@@ -1,2 +0,0 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const f=require("../../../../../../../_virtual/common.js");var o;function v(){return o||(o=1,function(e){var l=typeof Uint8Array<"u"&&typeof Uint16Array<"u"&&typeof Int32Array<"u";function h(n,r){return Object.prototype.hasOwnProperty.call(n,r)}e.assign=function(n){for(var r=Array.prototype.slice.call(arguments,1);r.length;){var t=r.shift();if(t){if(typeof t!="object")throw new TypeError(t+"must be non-object");for(var u in t)h(t,u)&&(n[u]=t[u])}}return n},e.shrinkBuf=function(n,r){return n.length===r?n:n.subarray?n.subarray(0,r):(n.length=r,n)};var c={arraySet:function(n,r,t,u,i){if(r.subarray&&n.subarray){n.set(r.subarray(t,t+u),i);return}for(var a=0;a<u;a++)n[i+a]=r[t+a]},flattenChunks:function(n){var r,t,u,i,a,y;for(u=0,r=0,t=n.length;r<t;r++)u+=n[r].length;for(y=new Uint8Array(u),i=0,r=0,t=n.length;r<t;r++)a=n[r],y.set(a,i),i+=a.length;return y}},g={arraySet:function(n,r,t,u,i){for(var a=0;a<u;a++)n[i+a]=r[t+a]},flattenChunks:function(n){return[].concat.apply([],n)}};e.setTyped=function(n){n?(e.Buf8=Uint8Array,e.Buf16=Uint16Array,e.Buf32=Int32Array,e.assign(e,c)):(e.Buf8=Array,e.Buf16=Array,e.Buf32=Array,e.assign(e,g))},e.setTyped(l)}(f.__exports)),f.__exports}exports.__require=v;
-//# sourceMappingURL=common.js.map

package/dist/node_modules/.pnpm/pako@1.0.11/node_modules/pako/lib/utils/common.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"common.js","sources":["../../../../../../../../node_modules/.pnpm/pako@1.0.11/node_modules/pako/lib/utils/common.js"],"sourcesContent":["'use strict';\n\n\nvar TYPED_OK =  (typeof Uint8Array !== 'undefined') &&\n                (typeof Uint16Array !== 'undefined') &&\n                (typeof Int32Array !== 'undefined');\n\nfunction _has(obj, key) {\n  return Object.prototype.hasOwnProperty.call(obj, key);\n}\n\nexports.assign = function (obj /*from1, from2, from3, ...*/) {\n  var sources = Array.prototype.slice.call(arguments, 1);\n  while (sources.length) {\n    var source = sources.shift();\n    if (!source) { continue; }\n\n    if (typeof source !== 'object') {\n      throw new TypeError(source + 'must be non-object');\n    }\n\n    for (var p in source) {\n      if (_has(source, p)) {\n        obj[p] = source[p];\n      }\n    }\n  }\n\n  return obj;\n};\n\n\n// reduce buffer size, avoiding mem copy\nexports.shrinkBuf = function (buf, size) {\n  if (buf.length === size) { return buf; }\n  if (buf.subarray) { return buf.subarray(0, size); }\n  buf.length = size;\n  return buf;\n};\n\n\nvar fnTyped = {\n  arraySet: function (dest, src, src_offs, len, dest_offs) {\n    if (src.subarray && dest.subarray) {\n      dest.set(src.subarray(src_offs, src_offs + len), dest_offs);\n      return;\n    }\n    // Fallback to ordinary array\n    for (var i = 0; i < len; i++) {\n      dest[dest_offs + i] = src[src_offs + i];\n    }\n  },\n  // Join array of chunks to single array.\n  flattenChunks: function (chunks) {\n    var i, l, len, pos, chunk, result;\n\n    // calculate data length\n    len = 0;\n    for (i = 0, l = chunks.length; i < l; i++) {\n      len += chunks[i].length;\n    }\n\n    // join chunks\n    result = new Uint8Array(len);\n    pos = 0;\n    for (i = 0, l = chunks.length; i < l; i++) {\n      chunk = chunks[i];\n      result.set(chunk, pos);\n      pos += chunk.length;\n    }\n\n    return result;\n  }\n};\n\nvar fnUntyped = {\n  arraySet: function (dest, src, src_offs, len, dest_offs) {\n    for (var i = 0; i < len; i++) {\n      dest[dest_offs + i] = src[src_offs + i];\n    }\n  },\n  // Join array of chunks to single array.\n  flattenChunks: function (chunks) {\n    return [].concat.apply([], chunks);\n  }\n};\n\n\n// Enable/Disable typed arrays use, for testing\n//\nexports.setTyped = function (on) {\n  if (on) {\n    exports.Buf8  = Uint8Array;\n    exports.Buf16 = Uint16Array;\n    exports.Buf32 = Int32Array;\n    exports.assign(exports, fnTyped);\n  } else {\n    exports.Buf8  = Array;\n    exports.Buf16 = Array;\n    exports.Buf32 = Array;\n    exports.assign(exports, fnUntyped);\n  }\n};\n\nexports.setTyped(TYPED_OK);\n"],"names":["TYPED_OK","_has","obj","key","exports","sources","source","p","buf","size","fnTyped","dest","src","src_offs","len","dest_offs","i","chunks","l","pos","chunk","result","fnUntyped","on"],"mappings":"yLAGA,IAAIA,EAAa,OAAO,WAAe,KACtB,OAAO,YAAgB,KACvB,OAAO,WAAe,IAEvC,SAASC,EAAKC,EAAKC,EAAK,CACtB,OAAO,OAAO,UAAU,eAAe,KAAKD,EAAKC,CAAG,EAGtDC,EAAiB,OAAA,SAAUF,EAAkC,CAE3D,QADIG,EAAU,MAAM,UAAU,MAAM,KAAK,UAAW,CAAC,EAC9CA,EAAQ,QAAQ,CACrB,IAAIC,EAASD,EAAQ,MAAO,EAC5B,GAAKC,EAEL,IAAI,OAAOA,GAAW,SACpB,MAAM,IAAI,UAAUA,EAAS,oBAAoB,EAGnD,QAASC,KAAKD,EACRL,EAAKK,EAAQC,CAAC,IAChBL,EAAIK,CAAC,EAAID,EAAOC,CAAC,IAKvB,OAAOL,CACR,EAIDE,EAAA,UAAoB,SAAUI,EAAKC,EAAM,CACvC,OAAID,EAAI,SAAWC,EAAeD,EAC9BA,EAAI,SAAmBA,EAAI,SAAS,EAAGC,CAAI,GAC/CD,EAAI,OAASC,EACND,EACR,EAGD,IAAIE,EAAU,CACZ,SAAU,SAAUC,EAAMC,EAAKC,EAAUC,EAAKC,EAAW,CACvD,GAAIH,EAAI,UAAYD,EAAK,SAAU,CACjCA,EAAK,IAAIC,EAAI,SAASC,EAAUA,EAAWC,CAAG,EAAGC,CAAS,EAC1D,OAGF,QAASC,EAAI,EAAGA,EAAIF,EAAKE,IACvBL,EAAKI,EAAYC,CAAC,EAAIJ,EAAIC,EAAWG,CAAC,CAEzC,EAED,cAAe,SAAUC,EAAQ,CAC/B,IAAID,EAAGE,EAAGJ,EAAKK,EAAKC,EAAOC,EAI3B,IADAP,EAAM,EACDE,EAAI,EAAGE,EAAID,EAAO,OAAQD,EAAIE,EAAGF,IACpCF,GAAOG,EAAOD,CAAC,EAAE,OAMnB,IAFAK,EAAS,IAAI,WAAWP,CAAG,EAC3BK,EAAM,EACDH,EAAI,EAAGE,EAAID,EAAO,OAAQD,EAAIE,EAAGF,IACpCI,EAAQH,EAAOD,CAAC,EAChBK,EAAO,IAAID,EAAOD,CAAG,EACrBA,GAAOC,EAAM,OAGf,OAAOC,EAEV,EAEGC,EAAY,CACd,SAAU,SAAUX,EAAMC,EAAKC,EAAUC,EAAKC,EAAW,CACvD,QAASC,EAAI,EAAGA,EAAIF,EAAKE,IACvBL,EAAKI,EAAYC,CAAC,EAAIJ,EAAIC,EAAWG,CAAC,CAEzC,EAED,cAAe,SAAUC,EAAQ,CAC/B,MAAO,CAAE,EAAC,OAAO,MAAM,CAAA,EAAIA,CAAM,EAEpC,EAKDb,EAAmB,SAAA,SAAUmB,EAAI,CAC3BA,GACFnB,EAAA,KAAgB,WAChBA,EAAA,MAAgB,YAChBA,EAAA,MAAgB,WAChBA,EAAQ,OAAOA,EAASM,CAAO,IAE/BN,EAAA,KAAgB,MAChBA,EAAA,MAAgB,MAChBA,EAAA,MAAgB,MAChBA,EAAQ,OAAOA,EAASkB,CAAS,EAEpC,EAEDlB,EAAQ,SAASJ,CAAQ","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/pako@1.0.11/node_modules/pako/lib/zlib/adler32.js

@@ -1,2 +0,0 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});var t,a;function l(){if(a)return t;a=1;function d(u,n,e,o){for(var r=u&65535|0,f=u>>>16&65535|0,i=0;e!==0;){i=e>2e3?2e3:e,e-=i;do r=r+n[o++]|0,f=f+r|0;while(--i);r%=65521,f%=65521}return r|f<<16|0}return t=d,t}exports.__require=l;
-//# sourceMappingURL=adler32.js.map

package/dist/node_modules/.pnpm/pako@1.0.11/node_modules/pako/lib/zlib/adler32.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"adler32.js","sources":["../../../../../../../../node_modules/.pnpm/pako@1.0.11/node_modules/pako/lib/zlib/adler32.js"],"sourcesContent":["'use strict';\n\n// Note: adler32 takes 12% for level 0 and 2% for level 6.\n// It isn't worth it to make additional optimizations as in original.\n// Small size is preferable.\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n//   claim that you wrote the original software. If you use this software\n//   in a product, an acknowledgment in the product documentation would be\n//   appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n//   misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nfunction adler32(adler, buf, len, pos) {\n  var s1 = (adler & 0xffff) |0,\n      s2 = ((adler >>> 16) & 0xffff) |0,\n      n = 0;\n\n  while (len !== 0) {\n    // Set limit ~ twice less than 5552, to keep\n    // s2 in 31-bits, because we force signed ints.\n    // in other case %= will fail.\n    n = len > 2000 ? 2000 : len;\n    len -= n;\n\n    do {\n      s1 = (s1 + buf[pos++]) |0;\n      s2 = (s2 + s1) |0;\n    } while (--n);\n\n    s1 %= 65521;\n    s2 %= 65521;\n  }\n\n  return (s1 | (s2 << 16)) |0;\n}\n\n\nmodule.exports = adler32;\n"],"names":["adler32","adler","buf","len","pos","s1","s2","n","adler32_1"],"mappings":"uHAyBA,SAASA,EAAQC,EAAOC,EAAKC,EAAKC,EAAK,CAKrC,QAJIC,EAAMJ,EAAQ,MAAS,EACvBK,EAAOL,IAAU,GAAM,MAAS,EAChCM,EAAI,EAEDJ,IAAQ,GAAG,CAIhBI,EAAIJ,EAAM,IAAO,IAAOA,EACxBA,GAAOI,EAEP,GACEF,EAAMA,EAAKH,EAAIE,GAAK,EAAI,EACxBE,EAAMA,EAAKD,EAAK,QACT,EAAEE,GAEXF,GAAM,MACNC,GAAM,MAGR,OAAQD,EAAMC,GAAM,GAAM,EAI5B,OAAAE,EAAiBR","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/pako@1.0.11/node_modules/pako/lib/zlib/constants.js

@@ -1,2 +0,0 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});var _,E;function Z(){return E||(E=1,_={Z_NO_FLUSH:0,Z_PARTIAL_FLUSH:1,Z_SYNC_FLUSH:2,Z_FULL_FLUSH:3,Z_FINISH:4,Z_BLOCK:5,Z_TREES:6,Z_OK:0,Z_STREAM_END:1,Z_NEED_DICT:2,Z_ERRNO:-1,Z_STREAM_ERROR:-2,Z_DATA_ERROR:-3,Z_BUF_ERROR:-5,Z_NO_COMPRESSION:0,Z_BEST_SPEED:1,Z_BEST_COMPRESSION:9,Z_DEFAULT_COMPRESSION:-1,Z_FILTERED:1,Z_HUFFMAN_ONLY:2,Z_RLE:3,Z_FIXED:4,Z_DEFAULT_STRATEGY:0,Z_BINARY:0,Z_TEXT:1,Z_UNKNOWN:2,Z_DEFLATED:8}),_}exports.__require=Z;
-//# sourceMappingURL=constants.js.map

package/dist/node_modules/.pnpm/pako@1.0.11/node_modules/pako/lib/zlib/constants.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"constants.js","sources":["../../../../../../../../node_modules/.pnpm/pako@1.0.11/node_modules/pako/lib/zlib/constants.js"],"sourcesContent":["'use strict';\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n//   claim that you wrote the original software. If you use this software\n//   in a product, an acknowledgment in the product documentation would be\n//   appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n//   misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nmodule.exports = {\n\n  /* Allowed flush values; see deflate() and inflate() below for details */\n  Z_NO_FLUSH:         0,\n  Z_PARTIAL_FLUSH:    1,\n  Z_SYNC_FLUSH:       2,\n  Z_FULL_FLUSH:       3,\n  Z_FINISH:           4,\n  Z_BLOCK:            5,\n  Z_TREES:            6,\n\n  /* Return codes for the compression/decompression functions. Negative values\n  * are errors, positive values are used for special but normal events.\n  */\n  Z_OK:               0,\n  Z_STREAM_END:       1,\n  Z_NEED_DICT:        2,\n  Z_ERRNO:           -1,\n  Z_STREAM_ERROR:    -2,\n  Z_DATA_ERROR:      -3,\n  //Z_MEM_ERROR:     -4,\n  Z_BUF_ERROR:       -5,\n  //Z_VERSION_ERROR: -6,\n\n  /* compression levels */\n  Z_NO_COMPRESSION:         0,\n  Z_BEST_SPEED:             1,\n  Z_BEST_COMPRESSION:       9,\n  Z_DEFAULT_COMPRESSION:   -1,\n\n\n  Z_FILTERED:               1,\n  Z_HUFFMAN_ONLY:           2,\n  Z_RLE:                    3,\n  Z_FIXED:                  4,\n  Z_DEFAULT_STRATEGY:       0,\n\n  /* Possible values of the data_type field (though see inflate()) */\n  Z_BINARY:                 0,\n  Z_TEXT:                   1,\n  //Z_ASCII:                1, // = Z_TEXT (deprecated)\n  Z_UNKNOWN:                2,\n\n  /* The deflate compression method */\n  Z_DEFLATED:               8\n  //Z_NULL:                 null // Use -1 or null inline, depending on var type\n};\n"],"names":["constants"],"mappings":"oHAqBAA,EAAiB,CAGf,WAAoB,EACpB,gBAAoB,EACpB,aAAoB,EACpB,aAAoB,EACpB,SAAoB,EACpB,QAAoB,EACpB,QAAoB,EAKpB,KAAoB,EACpB,aAAoB,EACpB,YAAoB,EACpB,QAAmB,GACnB,eAAmB,GACnB,aAAmB,GAEnB,YAAmB,GAInB,iBAA0B,EAC1B,aAA0B,EAC1B,mBAA0B,EAC1B,sBAAyB,GAGzB,WAA0B,EAC1B,eAA0B,EAC1B,MAA0B,EAC1B,QAA0B,EAC1B,mBAA0B,EAG1B,SAA0B,EAC1B,OAA0B,EAE1B,UAA0B,EAG1B,WAA0B,CAE3B","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/pako@1.0.11/node_modules/pako/lib/zlib/crc32.js

@@ -1,2 +0,0 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});var n,o;function b(){if(o)return n;o=1;function v(){for(var r,t=[],e=0;e<256;e++){r=e;for(var a=0;a<8;a++)r=r&1?3988292384^r>>>1:r>>>1;t[e]=r}return t}var f=v();function i(r,t,e,a){var c=f,l=a+e;r^=-1;for(var u=a;u<l;u++)r=r>>>8^c[(r^t[u])&255];return r^-1}return n=i,n}exports.__require=b;
-//# sourceMappingURL=crc32.js.map

package/dist/node_modules/.pnpm/pako@1.0.11/node_modules/pako/lib/zlib/crc32.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"crc32.js","sources":["../../../../../../../../node_modules/.pnpm/pako@1.0.11/node_modules/pako/lib/zlib/crc32.js"],"sourcesContent":["'use strict';\n\n// Note: we can't get significant speed boost here.\n// So write code to minimize size - no pregenerated tables\n// and array tools dependencies.\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n//   claim that you wrote the original software. If you use this software\n//   in a product, an acknowledgment in the product documentation would be\n//   appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n//   misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\n// Use ordinary array, since untyped makes no boost here\nfunction makeTable() {\n  var c, table = [];\n\n  for (var n = 0; n < 256; n++) {\n    c = n;\n    for (var k = 0; k < 8; k++) {\n      c = ((c & 1) ? (0xEDB88320 ^ (c >>> 1)) : (c >>> 1));\n    }\n    table[n] = c;\n  }\n\n  return table;\n}\n\n// Create table on load. Just 255 signed longs. Not a problem.\nvar crcTable = makeTable();\n\n\nfunction crc32(crc, buf, len, pos) {\n  var t = crcTable,\n      end = pos + len;\n\n  crc ^= -1;\n\n  for (var i = pos; i < end; i++) {\n    crc = (crc >>> 8) ^ t[(crc ^ buf[i]) & 0xFF];\n  }\n\n  return (crc ^ (-1)); // >>> 0;\n}\n\n\nmodule.exports = crc32;\n"],"names":["makeTable","c","table","n","k","crcTable","crc32","crc","buf","len","pos","t","end","i","crc32_1"],"mappings":"uHA0BA,SAASA,GAAY,CAGnB,QAFIC,EAAGC,EAAQ,CAAE,EAERC,EAAI,EAAGA,EAAI,IAAKA,IAAK,CAC5BF,EAAIE,EACJ,QAASC,EAAI,EAAGA,EAAI,EAAGA,IACrBH,EAAMA,EAAI,EAAM,WAAcA,IAAM,EAAOA,IAAM,EAEnDC,EAAMC,CAAC,EAAIF,EAGb,OAAOC,EAIT,IAAIG,EAAWL,EAAW,EAG1B,SAASM,EAAMC,EAAKC,EAAKC,EAAKC,EAAK,CACjC,IAAIC,EAAIN,EACJO,EAAMF,EAAMD,EAEhBF,GAAO,GAEP,QAASM,EAAIH,EAAKG,EAAID,EAAKC,IACzBN,EAAOA,IAAQ,EAAKI,GAAGJ,EAAMC,EAAIK,CAAC,GAAK,GAAI,EAG7C,OAAQN,EAAO,GAIjB,OAAAO,EAAiBR","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/pako@1.0.11/node_modules/pako/lib/zlib/deflate.js

@@ -1,2 +0,0 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const w=require("../../../../../../../_virtual/deflate.js"),Ha=require("../utils/common.js"),qa=require("./trees.js"),Ba=require("./adler32.js"),Ua=require("./crc32.js"),Ka=require("./messages.js");var ra;function Xa(){if(ra)return w.__exports;ra=1;var g=Ha.__require(),v=qa.__require(),G=Ba.__require(),b=Ua.__require(),_a=Ka.__require(),y=0,ha=1,la=3,x=4,V=5,s=0,W=1,c=-2,fa=-3,X=-5,da=-1,oa=1,C=2,ua=3,ga=4,va=0,ca=2,H=8,pa=9,wa=15,sa=8,ka=29,za=256,P=za+1+ka,ba=30,xa=19,Ea=2*P+1,Sa=15,h=3,E=258,p=E+h+1,Ta=32,q=42,$=69,B=73,U=91,K=103,m=113,M=666,o=1,N=2,D=3,I=4,Aa=3;function S(a,e){return a.msg=_a[e],e}function J(a){return(a<<1)-(a>4?9:0)}function T(a){for(var e=a.length;--e>=0;)a[e]=0}function A(a){var e=a.state,n=e.pending;n>a.avail_out&&(n=a.avail_out),n!==0&&(g.arraySet(a.output,e.pending_buf,e.pending_out,n,a.next_out),a.next_out+=n,e.pending_out+=n,a.total_out+=n,a.avail_out-=n,e.pending-=n,e.pending===0&&(e.pending_out=0))}function u(a,e){v._tr_flush_block(a,a.block_start>=0?a.block_start:-1,a.strstart-a.block_start,e),a.block_start=a.strstart,A(a.strm)}function l(a,e){a.pending_buf[a.pending++]=e}function Z(a,e){a.pending_buf[a.pending++]=e>>>8&255,a.pending_buf[a.pending++]=e&255}function ya(a,e,n,t){var i=a.avail_in;return i>t&&(i=t),i===0?0:(a.avail_in-=i,g.arraySet(e,a.input,a.next_in,i,n),a.state.wrap===1?a.adler=G(a.adler,e,i,n):a.state.wrap===2&&(a.adler=b(a.adler,e,i,n)),a.next_in+=i,a.total_in+=i,i)}function Q(a,e){var n=a.max_chain_length,t=a.strstart,i,f,r=a.prev_length,_=a.nice_match,z=a.strstart>a.w_size-p?a.strstart-(a.w_size-p):0,d=a.window,F=a.w_mask,Ca=a.prev,j=a.strstart+E,ia=d[t+r-1],na=d[t+r];a.prev_length>=a.good_match&&(n>>=2),_>a.lookahead&&(_=a.lookahead);do if(i=e,!(d[i+r]!==na||d[i+r-1]!==ia||d[i]!==d[t]||d[++i]!==d[t+1])){t+=2,i++;do;while(d[++t]===d[++i]&&d[++t]===d[++i]&&d[++t]===d[++i]&&d[++t]===d[++i]&&d[++t]===d[++i]&&d[++t]===d[++i]&&d[++t]===d[++i]&&d[++t]===d[++i]&&t<j);if(f=E-(j-t),t=j-E,f>r){if(a.match_start=e,r=f,f>=_)break;ia=d[t+r-1],na=d[t+r]}}while((e=Ca[e&F])>z&&--n!==0);return r<=a.lookahead?r:a.lookahead}function R(a){var e=a.w_size,n,t,i,f,r;do{if(f=a.window_size-a.lookahead-a.strstart,a.strstart>=e+(e-p)){g.arraySet(a.window,a.window,e,e,0),a.match_start-=e,a.strstart-=e,a.block_start-=e,t=a.hash_size,n=t;do i=a.head[--n],a.head[n]=i>=e?i-e:0;while(--t);t=e,n=t;do i=a.prev[--n],a.prev[n]=i>=e?i-e:0;while(--t);f+=e}if(a.strm.avail_in===0)break;if(t=ya(a.strm,a.window,a.strstart+a.lookahead,f),a.lookahead+=t,a.lookahead+a.insert>=h)for(r=a.strstart-a.insert,a.ins_h=a.window[r],a.ins_h=(a.ins_h<<a.hash_shift^a.window[r+1])&a.hash_mask;a.insert&&(a.ins_h=(a.ins_h<<a.hash_shift^a.window[r+h-1])&a.hash_mask,a.prev[r&a.w_mask]=a.head[a.ins_h],a.head[a.ins_h]=r,r++,a.insert--,!(a.lookahead+a.insert<h)););}while(a.lookahead<p&&a.strm.avail_in!==0)}function ma(a,e){var n=65535;for(n>a.pending_buf_size-5&&(n=a.pending_buf_size-5);;){if(a.lookahead<=1){if(R(a),a.lookahead===0&&e===y)return o;if(a.lookahead===0)break}a.strstart+=a.lookahead,a.lookahead=0;var t=a.block_start+n;if((a.strstart===0||a.strstart>=t)&&(a.lookahead=a.strstart-t,a.strstart=t,u(a,!1),a.strm.avail_out===0)||a.strstart-a.block_start>=a.w_size-p&&(u(a,!1),a.strm.avail_out===0))return o}return a.insert=0,e===x?(u(a,!0),a.strm.avail_out===0?D:I):(a.strstart>a.block_start&&(u(a,!1),a.strm.avail_out===0),o)}function Y(a,e){for(var n,t;;){if(a.lookahead<p){if(R(a),a.lookahead<p&&e===y)return o;if(a.lookahead===0)break}if(n=0,a.lookahead>=h&&(a.ins_h=(a.ins_h<<a.hash_shift^a.window[a.strstart+h-1])&a.hash_mask,n=a.prev[a.strstart&a.w_mask]=a.head[a.ins_h],a.head[a.ins_h]=a.strstart),n!==0&&a.strstart-n<=a.w_size-p&&(a.match_length=Q(a,n)),a.match_length>=h)if(t=v._tr_tally(a,a.strstart-a.match_start,a.match_length-h),a.lookahead-=a.match_length,a.match_length<=a.max_lazy_match&&a.lookahead>=h){a.match_length--;do a.strstart++,a.ins_h=(a.ins_h<<a.hash_shift^a.window[a.strstart+h-1])&a.hash_mask,n=a.prev[a.strstart&a.w_mask]=a.head[a.ins_h],a.head[a.ins_h]=a.strstart;while(--a.match_length!==0);a.strstart++}else a.strstart+=a.match_length,a.match_length=0,a.ins_h=a.window[a.strstart],a.ins_h=(a.ins_h<<a.hash_shift^a.window[a.strstart+1])&a.hash_mask;else t=v._tr_tally(a,0,a.window[a.strstart]),a.lookahead--,a.strstart++;if(t&&(u(a,!1),a.strm.avail_out===0))return o}return a.insert=a.strstart<h-1?a.strstart:h-1,e===x?(u(a,!0),a.strm.avail_out===0?D:I):a.last_lit&&(u(a,!1),a.strm.avail_out===0)?o:N}function O(a,e){for(var n,t,i;;){if(a.lookahead<p){if(R(a),a.lookahead<p&&e===y)return o;if(a.lookahead===0)break}if(n=0,a.lookahead>=h&&(a.ins_h=(a.ins_h<<a.hash_shift^a.window[a.strstart+h-1])&a.hash_mask,n=a.prev[a.strstart&a.w_mask]=a.head[a.ins_h],a.head[a.ins_h]=a.strstart),a.prev_length=a.match_length,a.prev_match=a.match_start,a.match_length=h-1,n!==0&&a.prev_length<a.max_lazy_match&&a.strstart-n<=a.w_size-p&&(a.match_length=Q(a,n),a.match_length<=5&&(a.strategy===oa||a.match_length===h&&a.strstart-a.match_start>4096)&&(a.match_length=h-1)),a.prev_length>=h&&a.match_length<=a.prev_length){i=a.strstart+a.lookahead-h,t=v._tr_tally(a,a.strstart-1-a.prev_match,a.prev_length-h),a.lookahead-=a.prev_length-1,a.prev_length-=2;do++a.strstart<=i&&(a.ins_h=(a.ins_h<<a.hash_shift^a.window[a.strstart+h-1])&a.hash_mask,n=a.prev[a.strstart&a.w_mask]=a.head[a.ins_h],a.head[a.ins_h]=a.strstart);while(--a.prev_length!==0);if(a.match_available=0,a.match_length=h-1,a.strstart++,t&&(u(a,!1),a.strm.avail_out===0))return o}else if(a.match_available){if(t=v._tr_tally(a,0,a.window[a.strstart-1]),t&&u(a,!1),a.strstart++,a.lookahead--,a.strm.avail_out===0)return o}else a.match_available=1,a.strstart++,a.lookahead--}return a.match_available&&(t=v._tr_tally(a,0,a.window[a.strstart-1]),a.match_available=0),a.insert=a.strstart<h-1?a.strstart:h-1,e===x?(u(a,!0),a.strm.avail_out===0?D:I):a.last_lit&&(u(a,!1),a.strm.avail_out===0)?o:N}function Da(a,e){for(var n,t,i,f,r=a.window;;){if(a.lookahead<=E){if(R(a),a.lookahead<=E&&e===y)return o;if(a.lookahead===0)break}if(a.match_length=0,a.lookahead>=h&&a.strstart>0&&(i=a.strstart-1,t=r[i],t===r[++i]&&t===r[++i]&&t===r[++i])){f=a.strstart+E;do;while(t===r[++i]&&t===r[++i]&&t===r[++i]&&t===r[++i]&&t===r[++i]&&t===r[++i]&&t===r[++i]&&t===r[++i]&&i<f);a.match_length=E-(f-i),a.match_length>a.lookahead&&(a.match_length=a.lookahead)}if(a.match_length>=h?(n=v._tr_tally(a,1,a.match_length-h),a.lookahead-=a.match_length,a.strstart+=a.match_length,a.match_length=0):(n=v._tr_tally(a,0,a.window[a.strstart]),a.lookahead--,a.strstart++),n&&(u(a,!1),a.strm.avail_out===0))return o}return a.insert=0,e===x?(u(a,!0),a.strm.avail_out===0?D:I):a.last_lit&&(u(a,!1),a.strm.avail_out===0)?o:N}function Ra(a,e){for(var n;;){if(a.lookahead===0&&(R(a),a.lookahead===0)){if(e===y)return o;break}if(a.match_length=0,n=v._tr_tally(a,0,a.window[a.strstart]),a.lookahead--,a.strstart++,n&&(u(a,!1),a.strm.avail_out===0))return o}return a.insert=0,e===x?(u(a,!0),a.strm.avail_out===0?D:I):a.last_lit&&(u(a,!1),a.strm.avail_out===0)?o:N}function k(a,e,n,t,i){this.good_length=a,this.max_lazy=e,this.nice_length=n,this.max_chain=t,this.func=i}var L;L=[new k(0,0,0,0,ma),new k(4,4,8,4,Y),new k(4,5,16,8,Y),new k(4,6,32,32,Y),new k(4,4,16,16,O),new k(8,16,32,32,O),new k(8,16,128,128,O),new k(8,32,128,256,O),new k(32,128,258,1024,O),new k(32,258,258,4096,O)];function Ia(a){a.window_size=2*a.w_size,T(a.head),a.max_lazy_match=L[a.level].max_lazy,a.good_match=L[a.level].good_length,a.nice_match=L[a.level].nice_length,a.max_chain_length=L[a.level].max_chain,a.strstart=0,a.block_start=0,a.lookahead=0,a.insert=0,a.match_length=a.prev_length=h-1,a.match_available=0,a.ins_h=0}function Oa(){this.strm=null,this.status=0,this.pending_buf=null,this.pending_buf_size=0,this.pending_out=0,this.pending=0,this.wrap=0,this.gzhead=null,this.gzindex=0,this.method=H,this.last_flush=-1,this.w_size=0,this.w_bits=0,this.w_mask=0,this.window=null,this.window_size=0,this.prev=null,this.head=null,this.ins_h=0,this.hash_size=0,this.hash_bits=0,this.hash_mask=0,this.hash_shift=0,this.block_start=0,this.match_length=0,this.prev_match=0,this.match_available=0,this.strstart=0,this.match_start=0,this.lookahead=0,this.prev_length=0,this.max_chain_length=0,this.max_lazy_match=0,this.level=0,this.strategy=0,this.good_match=0,this.nice_match=0,this.dyn_ltree=new g.Buf16(Ea*2),this.dyn_dtree=new g.Buf16((2*ba+1)*2),this.bl_tree=new g.Buf16((2*xa+1)*2),T(this.dyn_ltree),T(this.dyn_dtree),T(this.bl_tree),this.l_desc=null,this.d_desc=null,this.bl_desc=null,this.bl_count=new g.Buf16(Sa+1),this.heap=new g.Buf16(2*P+1),T(this.heap),this.heap_len=0,this.heap_max=0,this.depth=new g.Buf16(2*P+1),T(this.depth),this.l_buf=0,this.lit_bufsize=0,this.last_lit=0,this.d_buf=0,this.opt_len=0,this.static_len=0,this.matches=0,this.insert=0,this.bi_buf=0,this.bi_valid=0}function aa(a){var e;return!a||!a.state?S(a,c):(a.total_in=a.total_out=0,a.data_type=ca,e=a.state,e.pending=0,e.pending_out=0,e.wrap<0&&(e.wrap=-e.wrap),e.status=e.wrap?q:m,a.adler=e.wrap===2?0:1,e.last_flush=y,v._tr_init(e),s)}function ta(a){var e=aa(a);return e===s&&Ia(a.state),e}function La(a,e){return!a||!a.state||a.state.wrap!==2?c:(a.state.gzhead=e,s)}function ea(a,e,n,t,i,f){if(!a)return c;var r=1;if(e===da&&(e=6),t<0?(r=0,t=-t):t>15&&(r=2,t-=16),i<1||i>pa||n!==H||t<8||t>15||e<0||e>9||f<0||f>ga)return S(a,c);t===8&&(t=9);var _=new Oa;return a.state=_,_.strm=a,_.wrap=r,_.gzhead=null,_.w_bits=t,_.w_size=1<<_.w_bits,_.w_mask=_.w_size-1,_.hash_bits=i+7,_.hash_size=1<<_.hash_bits,_.hash_mask=_.hash_size-1,_.hash_shift=~~((_.hash_bits+h-1)/h),_.window=new g.Buf8(_.w_size*2),_.head=new g.Buf16(_.hash_size),_.prev=new g.Buf16(_.w_size),_.lit_bufsize=1<<i+6,_.pending_buf_size=_.lit_bufsize*4,_.pending_buf=new g.Buf8(_.pending_buf_size),_.d_buf=1*_.lit_bufsize,_.l_buf=3*_.lit_bufsize,_.level=e,_.strategy=f,_.method=n,ta(a)}function Ma(a,e){return ea(a,e,H,wa,sa,va)}function Na(a,e){var n,t,i,f;if(!a||!a.state||e>V||e<0)return a?S(a,c):c;if(t=a.state,!a.output||!a.input&&a.avail_in!==0||t.status===M&&e!==x)return S(a,a.avail_out===0?X:c);if(t.strm=a,n=t.last_flush,t.last_flush=e,t.status===q)if(t.wrap===2)a.adler=0,l(t,31),l(t,139),l(t,8),t.gzhead?(l(t,(t.gzhead.text?1:0)+(t.gzhead.hcrc?2:0)+(t.gzhead.extra?4:0)+(t.gzhead.name?8:0)+(t.gzhead.comment?16:0)),l(t,t.gzhead.time&255),l(t,t.gzhead.time>>8&255),l(t,t.gzhead.time>>16&255),l(t,t.gzhead.time>>24&255),l(t,t.level===9?2:t.strategy>=C||t.level<2?4:0),l(t,t.gzhead.os&255),t.gzhead.extra&&t.gzhead.extra.length&&(l(t,t.gzhead.extra.length&255),l(t,t.gzhead.extra.length>>8&255)),t.gzhead.hcrc&&(a.adler=b(a.adler,t.pending_buf,t.pending,0)),t.gzindex=0,t.status=$):(l(t,0),l(t,0),l(t,0),l(t,0),l(t,0),l(t,t.level===9?2:t.strategy>=C||t.level<2?4:0),l(t,Aa),t.status=m);else{var r=H+(t.w_bits-8<<4)<<8,_=-1;t.strategy>=C||t.level<2?_=0:t.level<6?_=1:t.level===6?_=2:_=3,r|=_<<6,t.strstart!==0&&(r|=Ta),r+=31-r%31,t.status=m,Z(t,r),t.strstart!==0&&(Z(t,a.adler>>>16),Z(t,a.adler&65535)),a.adler=1}if(t.status===$)if(t.gzhead.extra){for(i=t.pending;t.gzindex<(t.gzhead.extra.length&65535)&&!(t.pending===t.pending_buf_size&&(t.gzhead.hcrc&&t.pending>i&&(a.adler=b(a.adler,t.pending_buf,t.pending-i,i)),A(a),i=t.pending,t.pending===t.pending_buf_size));)l(t,t.gzhead.extra[t.gzindex]&255),t.gzindex++;t.gzhead.hcrc&&t.pending>i&&(a.adler=b(a.adler,t.pending_buf,t.pending-i,i)),t.gzindex===t.gzhead.extra.length&&(t.gzindex=0,t.status=B)}else t.status=B;if(t.status===B)if(t.gzhead.name){i=t.pending;do{if(t.pending===t.pending_buf_size&&(t.gzhead.hcrc&&t.pending>i&&(a.adler=b(a.adler,t.pending_buf,t.pending-i,i)),A(a),i=t.pending,t.pending===t.pending_buf_size)){f=1;break}t.gzindex<t.gzhead.name.length?f=t.gzhead.name.charCodeAt(t.gzindex++)&255:f=0,l(t,f)}while(f!==0);t.gzhead.hcrc&&t.pending>i&&(a.adler=b(a.adler,t.pending_buf,t.pending-i,i)),f===0&&(t.gzindex=0,t.status=U)}else t.status=U;if(t.status===U)if(t.gzhead.comment){i=t.pending;do{if(t.pending===t.pending_buf_size&&(t.gzhead.hcrc&&t.pending>i&&(a.adler=b(a.adler,t.pending_buf,t.pending-i,i)),A(a),i=t.pending,t.pending===t.pending_buf_size)){f=1;break}t.gzindex<t.gzhead.comment.length?f=t.gzhead.comment.charCodeAt(t.gzindex++)&255:f=0,l(t,f)}while(f!==0);t.gzhead.hcrc&&t.pending>i&&(a.adler=b(a.adler,t.pending_buf,t.pending-i,i)),f===0&&(t.status=K)}else t.status=K;if(t.status===K&&(t.gzhead.hcrc?(t.pending+2>t.pending_buf_size&&A(a),t.pending+2<=t.pending_buf_size&&(l(t,a.adler&255),l(t,a.adler>>8&255),a.adler=0,t.status=m)):t.status=m),t.pending!==0){if(A(a),a.avail_out===0)return t.last_flush=-1,s}else if(a.avail_in===0&&J(e)<=J(n)&&e!==x)return S(a,X);if(t.status===M&&a.avail_in!==0)return S(a,X);if(a.avail_in!==0||t.lookahead!==0||e!==y&&t.status!==M){var z=t.strategy===C?Ra(t,e):t.strategy===ua?Da(t,e):L[t.level].func(t,e);if((z===D||z===I)&&(t.status=M),z===o||z===D)return a.avail_out===0&&(t.last_flush=-1),s;if(z===N&&(e===ha?v._tr_align(t):e!==V&&(v._tr_stored_block(t,0,0,!1),e===la&&(T(t.head),t.lookahead===0&&(t.strstart=0,t.block_start=0,t.insert=0))),A(a),a.avail_out===0))return t.last_flush=-1,s}return e!==x?s:t.wrap<=0?W:(t.wrap===2?(l(t,a.adler&255),l(t,a.adler>>8&255),l(t,a.adler>>16&255),l(t,a.adler>>24&255),l(t,a.total_in&255),l(t,a.total_in>>8&255),l(t,a.total_in>>16&255),l(t,a.total_in>>24&255)):(Z(t,a.adler>>>16),Z(t,a.adler&65535)),A(a),t.wrap>0&&(t.wrap=-t.wrap),t.pending!==0?s:W)}function Za(a){var e;return!a||!a.state?c:(e=a.state.status,e!==q&&e!==$&&e!==B&&e!==U&&e!==K&&e!==m&&e!==M?S(a,c):(a.state=null,e===m?S(a,fa):s))}function Fa(a,e){var n=e.length,t,i,f,r,_,z,d,F;if(!a||!a.state||(t=a.state,r=t.wrap,r===2||r===1&&t.status!==q||t.lookahead))return c;for(r===1&&(a.adler=G(a.adler,e,n,0)),t.wrap=0,n>=t.w_size&&(r===0&&(T(t.head),t.strstart=0,t.block_start=0,t.insert=0),F=new g.Buf8(t.w_size),g.arraySet(F,e,n-t.w_size,t.w_size,0),e=F,n=t.w_size),_=a.avail_in,z=a.next_in,d=a.input,a.avail_in=n,a.next_in=0,a.input=e,R(t);t.lookahead>=h;){i=t.strstart,f=t.lookahead-(h-1);do t.ins_h=(t.ins_h<<t.hash_shift^t.window[i+h-1])&t.hash_mask,t.prev[i&t.w_mask]=t.head[t.ins_h],t.head[t.ins_h]=i,i++;while(--f);t.strstart=i,t.lookahead=h-1,R(t)}return t.strstart+=t.lookahead,t.block_start=t.strstart,t.insert=t.lookahead,t.lookahead=0,t.match_length=t.prev_length=h-1,t.match_available=0,a.next_in=z,a.input=d,a.avail_in=_,t.wrap=r,s}return w.__exports.deflateInit=Ma,w.__exports.deflateInit2=ea,w.__exports.deflateReset=ta,w.__exports.deflateResetKeep=aa,w.__exports.deflateSetHeader=La,w.__exports.deflate=Na,w.__exports.deflateEnd=Za,w.__exports.deflateSetDictionary=Fa,w.__exports.deflateInfo="pako deflate (from Nodeca project)",w.__exports}exports.__require=Xa;
-//# sourceMappingURL=deflate.js.map

package/dist/node_modules/.pnpm/pako@1.0.11/node_modules/pako/lib/zlib/deflate.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"deflate.js","sources":["../../../../../../../../node_modules/.pnpm/pako@1.0.11/node_modules/pako/lib/zlib/deflate.js"],"sourcesContent":["'use strict';\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n//   claim that you wrote the original software. If you use this software\n//   in a product, an acknowledgment in the product documentation would be\n//   appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n//   misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nvar utils   = require('../utils/common');\nvar trees   = require('./trees');\nvar adler32 = require('./adler32');\nvar crc32   = require('./crc32');\nvar msg     = require('./messages');\n\n/* Public constants ==========================================================*/\n/* ===========================================================================*/\n\n\n/* Allowed flush values; see deflate() and inflate() below for details */\nvar Z_NO_FLUSH      = 0;\nvar Z_PARTIAL_FLUSH = 1;\n//var Z_SYNC_FLUSH    = 2;\nvar Z_FULL_FLUSH    = 3;\nvar Z_FINISH        = 4;\nvar Z_BLOCK         = 5;\n//var Z_TREES         = 6;\n\n\n/* Return codes for the compression/decompression functions. Negative values\n * are errors, positive values are used for special but normal events.\n */\nvar Z_OK            = 0;\nvar Z_STREAM_END    = 1;\n//var Z_NEED_DICT     = 2;\n//var Z_ERRNO         = -1;\nvar Z_STREAM_ERROR  = -2;\nvar Z_DATA_ERROR    = -3;\n//var Z_MEM_ERROR     = -4;\nvar Z_BUF_ERROR     = -5;\n//var Z_VERSION_ERROR = -6;\n\n\n/* compression levels */\n//var Z_NO_COMPRESSION      = 0;\n//var Z_BEST_SPEED          = 1;\n//var Z_BEST_COMPRESSION    = 9;\nvar Z_DEFAULT_COMPRESSION = -1;\n\n\nvar Z_FILTERED            = 1;\nvar Z_HUFFMAN_ONLY        = 2;\nvar Z_RLE                 = 3;\nvar Z_FIXED               = 4;\nvar Z_DEFAULT_STRATEGY    = 0;\n\n/* Possible values of the data_type field (though see inflate()) */\n//var Z_BINARY              = 0;\n//var Z_TEXT                = 1;\n//var Z_ASCII               = 1; // = Z_TEXT\nvar Z_UNKNOWN             = 2;\n\n\n/* The deflate compression method */\nvar Z_DEFLATED  = 8;\n\n/*============================================================================*/\n\n\nvar MAX_MEM_LEVEL = 9;\n/* Maximum value for memLevel in deflateInit2 */\nvar MAX_WBITS = 15;\n/* 32K LZ77 window */\nvar DEF_MEM_LEVEL = 8;\n\n\nvar LENGTH_CODES  = 29;\n/* number of length codes, not counting the special END_BLOCK code */\nvar LITERALS      = 256;\n/* number of literal bytes 0..255 */\nvar L_CODES       = LITERALS + 1 + LENGTH_CODES;\n/* number of Literal or Length codes, including the END_BLOCK code */\nvar D_CODES       = 30;\n/* number of distance codes */\nvar BL_CODES      = 19;\n/* number of codes used to transfer the bit lengths */\nvar HEAP_SIZE     = 2 * L_CODES + 1;\n/* maximum heap size */\nvar MAX_BITS  = 15;\n/* All codes must not exceed MAX_BITS bits */\n\nvar MIN_MATCH = 3;\nvar MAX_MATCH = 258;\nvar MIN_LOOKAHEAD = (MAX_MATCH + MIN_MATCH + 1);\n\nvar PRESET_DICT = 0x20;\n\nvar INIT_STATE = 42;\nvar EXTRA_STATE = 69;\nvar NAME_STATE = 73;\nvar COMMENT_STATE = 91;\nvar HCRC_STATE = 103;\nvar BUSY_STATE = 113;\nvar FINISH_STATE = 666;\n\nvar BS_NEED_MORE      = 1; /* block not completed, need more input or more output */\nvar BS_BLOCK_DONE     = 2; /* block flush performed */\nvar BS_FINISH_STARTED = 3; /* finish started, need only more output at next deflate */\nvar BS_FINISH_DONE    = 4; /* finish done, accept no more input or output */\n\nvar OS_CODE = 0x03; // Unix :) . Don't detect, use this default.\n\nfunction err(strm, errorCode) {\n  strm.msg = msg[errorCode];\n  return errorCode;\n}\n\nfunction rank(f) {\n  return ((f) << 1) - ((f) > 4 ? 9 : 0);\n}\n\nfunction zero(buf) { var len = buf.length; while (--len >= 0) { buf[len] = 0; } }\n\n\n/* =========================================================================\n * Flush as much pending output as possible. All deflate() output goes\n * through this function so some applications may wish to modify it\n * to avoid allocating a large strm->output buffer and copying into it.\n * (See also read_buf()).\n */\nfunction flush_pending(strm) {\n  var s = strm.state;\n\n  //_tr_flush_bits(s);\n  var len = s.pending;\n  if (len > strm.avail_out) {\n    len = strm.avail_out;\n  }\n  if (len === 0) { return; }\n\n  utils.arraySet(strm.output, s.pending_buf, s.pending_out, len, strm.next_out);\n  strm.next_out += len;\n  s.pending_out += len;\n  strm.total_out += len;\n  strm.avail_out -= len;\n  s.pending -= len;\n  if (s.pending === 0) {\n    s.pending_out = 0;\n  }\n}\n\n\nfunction flush_block_only(s, last) {\n  trees._tr_flush_block(s, (s.block_start >= 0 ? s.block_start : -1), s.strstart - s.block_start, last);\n  s.block_start = s.strstart;\n  flush_pending(s.strm);\n}\n\n\nfunction put_byte(s, b) {\n  s.pending_buf[s.pending++] = b;\n}\n\n\n/* =========================================================================\n * Put a short in the pending buffer. The 16-bit value is put in MSB order.\n * IN assertion: the stream state is correct and there is enough room in\n * pending_buf.\n */\nfunction putShortMSB(s, b) {\n//  put_byte(s, (Byte)(b >> 8));\n//  put_byte(s, (Byte)(b & 0xff));\n  s.pending_buf[s.pending++] = (b >>> 8) & 0xff;\n  s.pending_buf[s.pending++] = b & 0xff;\n}\n\n\n/* ===========================================================================\n * Read a new buffer from the current input stream, update the adler32\n * and total number of bytes read.  All deflate() input goes through\n * this function so some applications may wish to modify it to avoid\n * allocating a large strm->input buffer and copying from it.\n * (See also flush_pending()).\n */\nfunction read_buf(strm, buf, start, size) {\n  var len = strm.avail_in;\n\n  if (len > size) { len = size; }\n  if (len === 0) { return 0; }\n\n  strm.avail_in -= len;\n\n  // zmemcpy(buf, strm->next_in, len);\n  utils.arraySet(buf, strm.input, strm.next_in, len, start);\n  if (strm.state.wrap === 1) {\n    strm.adler = adler32(strm.adler, buf, len, start);\n  }\n\n  else if (strm.state.wrap === 2) {\n    strm.adler = crc32(strm.adler, buf, len, start);\n  }\n\n  strm.next_in += len;\n  strm.total_in += len;\n\n  return len;\n}\n\n\n/* ===========================================================================\n * Set match_start to the longest match starting at the given string and\n * return its length. Matches shorter or equal to prev_length are discarded,\n * in which case the result is equal to prev_length and match_start is\n * garbage.\n * IN assertions: cur_match is the head of the hash chain for the current\n *   string (strstart) and its distance is <= MAX_DIST, and prev_length >= 1\n * OUT assertion: the match length is not greater than s->lookahead.\n */\nfunction longest_match(s, cur_match) {\n  var chain_length = s.max_chain_length;      /* max hash chain length */\n  var scan = s.strstart; /* current string */\n  var match;                       /* matched string */\n  var len;                           /* length of current match */\n  var best_len = s.prev_length;              /* best match length so far */\n  var nice_match = s.nice_match;             /* stop if match long enough */\n  var limit = (s.strstart > (s.w_size - MIN_LOOKAHEAD)) ?\n      s.strstart - (s.w_size - MIN_LOOKAHEAD) : 0/*NIL*/;\n\n  var _win = s.window; // shortcut\n\n  var wmask = s.w_mask;\n  var prev  = s.prev;\n\n  /* Stop when cur_match becomes <= limit. To simplify the code,\n   * we prevent matches with the string of window index 0.\n   */\n\n  var strend = s.strstart + MAX_MATCH;\n  var scan_end1  = _win[scan + best_len - 1];\n  var scan_end   = _win[scan + best_len];\n\n  /* The code is optimized for HASH_BITS >= 8 and MAX_MATCH-2 multiple of 16.\n   * It is easy to get rid of this optimization if necessary.\n   */\n  // Assert(s->hash_bits >= 8 && MAX_MATCH == 258, \"Code too clever\");\n\n  /* Do not waste too much time if we already have a good match: */\n  if (s.prev_length >= s.good_match) {\n    chain_length >>= 2;\n  }\n  /* Do not look for matches beyond the end of the input. This is necessary\n   * to make deflate deterministic.\n   */\n  if (nice_match > s.lookahead) { nice_match = s.lookahead; }\n\n  // Assert((ulg)s->strstart <= s->window_size-MIN_LOOKAHEAD, \"need lookahead\");\n\n  do {\n    // Assert(cur_match < s->strstart, \"no future\");\n    match = cur_match;\n\n    /* Skip to next match if the match length cannot increase\n     * or if the match length is less than 2.  Note that the checks below\n     * for insufficient lookahead only occur occasionally for performance\n     * reasons.  Therefore uninitialized memory will be accessed, and\n     * conditional jumps will be made that depend on those values.\n     * However the length of the match is limited to the lookahead, so\n     * the output of deflate is not affected by the uninitialized values.\n     */\n\n    if (_win[match + best_len]     !== scan_end  ||\n        _win[match + best_len - 1] !== scan_end1 ||\n        _win[match]                !== _win[scan] ||\n        _win[++match]              !== _win[scan + 1]) {\n      continue;\n    }\n\n    /* The check at best_len-1 can be removed because it will be made\n     * again later. (This heuristic is not always a win.)\n     * It is not necessary to compare scan[2] and match[2] since they\n     * are always equal when the other bytes match, given that\n     * the hash keys are equal and that HASH_BITS >= 8.\n     */\n    scan += 2;\n    match++;\n    // Assert(*scan == *match, \"match[2]?\");\n\n    /* We check for insufficient lookahead only every 8th comparison;\n     * the 256th check will be made at strstart+258.\n     */\n    do {\n      /*jshint noempty:false*/\n    } while (_win[++scan] === _win[++match] && _win[++scan] === _win[++match] &&\n             _win[++scan] === _win[++match] && _win[++scan] === _win[++match] &&\n             _win[++scan] === _win[++match] && _win[++scan] === _win[++match] &&\n             _win[++scan] === _win[++match] && _win[++scan] === _win[++match] &&\n             scan < strend);\n\n    // Assert(scan <= s->window+(unsigned)(s->window_size-1), \"wild scan\");\n\n    len = MAX_MATCH - (strend - scan);\n    scan = strend - MAX_MATCH;\n\n    if (len > best_len) {\n      s.match_start = cur_match;\n      best_len = len;\n      if (len >= nice_match) {\n        break;\n      }\n      scan_end1  = _win[scan + best_len - 1];\n      scan_end   = _win[scan + best_len];\n    }\n  } while ((cur_match = prev[cur_match & wmask]) > limit && --chain_length !== 0);\n\n  if (best_len <= s.lookahead) {\n    return best_len;\n  }\n  return s.lookahead;\n}\n\n\n/* ===========================================================================\n * Fill the window when the lookahead becomes insufficient.\n * Updates strstart and lookahead.\n *\n * IN assertion: lookahead < MIN_LOOKAHEAD\n * OUT assertions: strstart <= window_size-MIN_LOOKAHEAD\n *    At least one byte has been read, or avail_in == 0; reads are\n *    performed for at least two bytes (required for the zip translate_eol\n *    option -- not supported here).\n */\nfunction fill_window(s) {\n  var _w_size = s.w_size;\n  var p, n, m, more, str;\n\n  //Assert(s->lookahead < MIN_LOOKAHEAD, \"already enough lookahead\");\n\n  do {\n    more = s.window_size - s.lookahead - s.strstart;\n\n    // JS ints have 32 bit, block below not needed\n    /* Deal with !@#$% 64K limit: */\n    //if (sizeof(int) <= 2) {\n    //    if (more == 0 && s->strstart == 0 && s->lookahead == 0) {\n    //        more = wsize;\n    //\n    //  } else if (more == (unsigned)(-1)) {\n    //        /* Very unlikely, but possible on 16 bit machine if\n    //         * strstart == 0 && lookahead == 1 (input done a byte at time)\n    //         */\n    //        more--;\n    //    }\n    //}\n\n\n    /* If the window is almost full and there is insufficient lookahead,\n     * move the upper half to the lower one to make room in the upper half.\n     */\n    if (s.strstart >= _w_size + (_w_size - MIN_LOOKAHEAD)) {\n\n      utils.arraySet(s.window, s.window, _w_size, _w_size, 0);\n      s.match_start -= _w_size;\n      s.strstart -= _w_size;\n      /* we now have strstart >= MAX_DIST */\n      s.block_start -= _w_size;\n\n      /* Slide the hash table (could be avoided with 32 bit values\n       at the expense of memory usage). We slide even when level == 0\n       to keep the hash table consistent if we switch back to level > 0\n       later. (Using level 0 permanently is not an optimal usage of\n       zlib, so we don't care about this pathological case.)\n       */\n\n      n = s.hash_size;\n      p = n;\n      do {\n        m = s.head[--p];\n        s.head[p] = (m >= _w_size ? m - _w_size : 0);\n      } while (--n);\n\n      n = _w_size;\n      p = n;\n      do {\n        m = s.prev[--p];\n        s.prev[p] = (m >= _w_size ? m - _w_size : 0);\n        /* If n is not on any hash chain, prev[n] is garbage but\n         * its value will never be used.\n         */\n      } while (--n);\n\n      more += _w_size;\n    }\n    if (s.strm.avail_in === 0) {\n      break;\n    }\n\n    /* If there was no sliding:\n     *    strstart <= WSIZE+MAX_DIST-1 && lookahead <= MIN_LOOKAHEAD - 1 &&\n     *    more == window_size - lookahead - strstart\n     * => more >= window_size - (MIN_LOOKAHEAD-1 + WSIZE + MAX_DIST-1)\n     * => more >= window_size - 2*WSIZE + 2\n     * In the BIG_MEM or MMAP case (not yet supported),\n     *   window_size == input_size + MIN_LOOKAHEAD  &&\n     *   strstart + s->lookahead <= input_size => more >= MIN_LOOKAHEAD.\n     * Otherwise, window_size == 2*WSIZE so more >= 2.\n     * If there was sliding, more >= WSIZE. So in all cases, more >= 2.\n     */\n    //Assert(more >= 2, \"more < 2\");\n    n = read_buf(s.strm, s.window, s.strstart + s.lookahead, more);\n    s.lookahead += n;\n\n    /* Initialize the hash value now that we have some input: */\n    if (s.lookahead + s.insert >= MIN_MATCH) {\n      str = s.strstart - s.insert;\n      s.ins_h = s.window[str];\n\n      /* UPDATE_HASH(s, s->ins_h, s->window[str + 1]); */\n      s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[str + 1]) & s.hash_mask;\n//#if MIN_MATCH != 3\n//        Call update_hash() MIN_MATCH-3 more times\n//#endif\n      while (s.insert) {\n        /* UPDATE_HASH(s, s->ins_h, s->window[str + MIN_MATCH-1]); */\n        s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[str + MIN_MATCH - 1]) & s.hash_mask;\n\n        s.prev[str & s.w_mask] = s.head[s.ins_h];\n        s.head[s.ins_h] = str;\n        str++;\n        s.insert--;\n        if (s.lookahead + s.insert < MIN_MATCH) {\n          break;\n        }\n      }\n    }\n    /* If the whole input has less than MIN_MATCH bytes, ins_h is garbage,\n     * but this is not important since only literal bytes will be emitted.\n     */\n\n  } while (s.lookahead < MIN_LOOKAHEAD && s.strm.avail_in !== 0);\n\n  /* If the WIN_INIT bytes after the end of the current data have never been\n   * written, then zero those bytes in order to avoid memory check reports of\n   * the use of uninitialized (or uninitialised as Julian writes) bytes by\n   * the longest match routines.  Update the high water mark for the next\n   * time through here.  WIN_INIT is set to MAX_MATCH since the longest match\n   * routines allow scanning to strstart + MAX_MATCH, ignoring lookahead.\n   */\n//  if (s.high_water < s.window_size) {\n//    var curr = s.strstart + s.lookahead;\n//    var init = 0;\n//\n//    if (s.high_water < curr) {\n//      /* Previous high water mark below current data -- zero WIN_INIT\n//       * bytes or up to end of window, whichever is less.\n//       */\n//      init = s.window_size - curr;\n//      if (init > WIN_INIT)\n//        init = WIN_INIT;\n//      zmemzero(s->window + curr, (unsigned)init);\n//      s->high_water = curr + init;\n//    }\n//    else if (s->high_water < (ulg)curr + WIN_INIT) {\n//      /* High water mark at or above current data, but below current data\n//       * plus WIN_INIT -- zero out to current data plus WIN_INIT, or up\n//       * to end of window, whichever is less.\n//       */\n//      init = (ulg)curr + WIN_INIT - s->high_water;\n//      if (init > s->window_size - s->high_water)\n//        init = s->window_size - s->high_water;\n//      zmemzero(s->window + s->high_water, (unsigned)init);\n//      s->high_water += init;\n//    }\n//  }\n//\n//  Assert((ulg)s->strstart <= s->window_size - MIN_LOOKAHEAD,\n//    \"not enough room for search\");\n}\n\n/* ===========================================================================\n * Copy without compression as much as possible from the input stream, return\n * the current block state.\n * This function does not insert new strings in the dictionary since\n * uncompressible data is probably not useful. This function is used\n * only for the level=0 compression option.\n * NOTE: this function should be optimized to avoid extra copying from\n * window to pending_buf.\n */\nfunction deflate_stored(s, flush) {\n  /* Stored blocks are limited to 0xffff bytes, pending_buf is limited\n   * to pending_buf_size, and each stored block has a 5 byte header:\n   */\n  var max_block_size = 0xffff;\n\n  if (max_block_size > s.pending_buf_size - 5) {\n    max_block_size = s.pending_buf_size - 5;\n  }\n\n  /* Copy as much as possible from input to output: */\n  for (;;) {\n    /* Fill the window as much as possible: */\n    if (s.lookahead <= 1) {\n\n      //Assert(s->strstart < s->w_size+MAX_DIST(s) ||\n      //  s->block_start >= (long)s->w_size, \"slide too late\");\n//      if (!(s.strstart < s.w_size + (s.w_size - MIN_LOOKAHEAD) ||\n//        s.block_start >= s.w_size)) {\n//        throw  new Error(\"slide too late\");\n//      }\n\n      fill_window(s);\n      if (s.lookahead === 0 && flush === Z_NO_FLUSH) {\n        return BS_NEED_MORE;\n      }\n\n      if (s.lookahead === 0) {\n        break;\n      }\n      /* flush the current block */\n    }\n    //Assert(s->block_start >= 0L, \"block gone\");\n//    if (s.block_start < 0) throw new Error(\"block gone\");\n\n    s.strstart += s.lookahead;\n    s.lookahead = 0;\n\n    /* Emit a stored block if pending_buf will be full: */\n    var max_start = s.block_start + max_block_size;\n\n    if (s.strstart === 0 || s.strstart >= max_start) {\n      /* strstart == 0 is possible when wraparound on 16-bit machine */\n      s.lookahead = s.strstart - max_start;\n      s.strstart = max_start;\n      /*** FLUSH_BLOCK(s, 0); ***/\n      flush_block_only(s, false);\n      if (s.strm.avail_out === 0) {\n        return BS_NEED_MORE;\n      }\n      /***/\n\n\n    }\n    /* Flush if we may have to slide, otherwise block_start may become\n     * negative and the data will be gone:\n     */\n    if (s.strstart - s.block_start >= (s.w_size - MIN_LOOKAHEAD)) {\n      /*** FLUSH_BLOCK(s, 0); ***/\n      flush_block_only(s, false);\n      if (s.strm.avail_out === 0) {\n        return BS_NEED_MORE;\n      }\n      /***/\n    }\n  }\n\n  s.insert = 0;\n\n  if (flush === Z_FINISH) {\n    /*** FLUSH_BLOCK(s, 1); ***/\n    flush_block_only(s, true);\n    if (s.strm.avail_out === 0) {\n      return BS_FINISH_STARTED;\n    }\n    /***/\n    return BS_FINISH_DONE;\n  }\n\n  if (s.strstart > s.block_start) {\n    /*** FLUSH_BLOCK(s, 0); ***/\n    flush_block_only(s, false);\n    if (s.strm.avail_out === 0) {\n      return BS_NEED_MORE;\n    }\n    /***/\n  }\n\n  return BS_NEED_MORE;\n}\n\n/* ===========================================================================\n * Compress as much as possible from the input stream, return the current\n * block state.\n * This function does not perform lazy evaluation of matches and inserts\n * new strings in the dictionary only for unmatched strings or for short\n * matches. It is used only for the fast compression options.\n */\nfunction deflate_fast(s, flush) {\n  var hash_head;        /* head of the hash chain */\n  var bflush;           /* set if current block must be flushed */\n\n  for (;;) {\n    /* Make sure that we always have enough lookahead, except\n     * at the end of the input file. We need MAX_MATCH bytes\n     * for the next match, plus MIN_MATCH bytes to insert the\n     * string following the next match.\n     */\n    if (s.lookahead < MIN_LOOKAHEAD) {\n      fill_window(s);\n      if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\n        return BS_NEED_MORE;\n      }\n      if (s.lookahead === 0) {\n        break; /* flush the current block */\n      }\n    }\n\n    /* Insert the string window[strstart .. strstart+2] in the\n     * dictionary, and set hash_head to the head of the hash chain:\n     */\n    hash_head = 0/*NIL*/;\n    if (s.lookahead >= MIN_MATCH) {\n      /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n      s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n      hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n      s.head[s.ins_h] = s.strstart;\n      /***/\n    }\n\n    /* Find the longest match, discarding those <= prev_length.\n     * At this point we have always match_length < MIN_MATCH\n     */\n    if (hash_head !== 0/*NIL*/ && ((s.strstart - hash_head) <= (s.w_size - MIN_LOOKAHEAD))) {\n      /* To simplify the code, we prevent matches with the string\n       * of window index 0 (in particular we have to avoid a match\n       * of the string with itself at the start of the input file).\n       */\n      s.match_length = longest_match(s, hash_head);\n      /* longest_match() sets match_start */\n    }\n    if (s.match_length >= MIN_MATCH) {\n      // check_match(s, s.strstart, s.match_start, s.match_length); // for debug only\n\n      /*** _tr_tally_dist(s, s.strstart - s.match_start,\n                     s.match_length - MIN_MATCH, bflush); ***/\n      bflush = trees._tr_tally(s, s.strstart - s.match_start, s.match_length - MIN_MATCH);\n\n      s.lookahead -= s.match_length;\n\n      /* Insert new strings in the hash table only if the match length\n       * is not too large. This saves time but degrades compression.\n       */\n      if (s.match_length <= s.max_lazy_match/*max_insert_length*/ && s.lookahead >= MIN_MATCH) {\n        s.match_length--; /* string at strstart already in table */\n        do {\n          s.strstart++;\n          /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n          s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n          hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n          s.head[s.ins_h] = s.strstart;\n          /***/\n          /* strstart never exceeds WSIZE-MAX_MATCH, so there are\n           * always MIN_MATCH bytes ahead.\n           */\n        } while (--s.match_length !== 0);\n        s.strstart++;\n      } else\n      {\n        s.strstart += s.match_length;\n        s.match_length = 0;\n        s.ins_h = s.window[s.strstart];\n        /* UPDATE_HASH(s, s.ins_h, s.window[s.strstart+1]); */\n        s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + 1]) & s.hash_mask;\n\n//#if MIN_MATCH != 3\n//                Call UPDATE_HASH() MIN_MATCH-3 more times\n//#endif\n        /* If lookahead < MIN_MATCH, ins_h is garbage, but it does not\n         * matter since it will be recomputed at next deflate call.\n         */\n      }\n    } else {\n      /* No match, output a literal byte */\n      //Tracevv((stderr,\"%c\", s.window[s.strstart]));\n      /*** _tr_tally_lit(s, s.window[s.strstart], bflush); ***/\n      bflush = trees._tr_tally(s, 0, s.window[s.strstart]);\n\n      s.lookahead--;\n      s.strstart++;\n    }\n    if (bflush) {\n      /*** FLUSH_BLOCK(s, 0); ***/\n      flush_block_only(s, false);\n      if (s.strm.avail_out === 0) {\n        return BS_NEED_MORE;\n      }\n      /***/\n    }\n  }\n  s.insert = ((s.strstart < (MIN_MATCH - 1)) ? s.strstart : MIN_MATCH - 1);\n  if (flush === Z_FINISH) {\n    /*** FLUSH_BLOCK(s, 1); ***/\n    flush_block_only(s, true);\n    if (s.strm.avail_out === 0) {\n      return BS_FINISH_STARTED;\n    }\n    /***/\n    return BS_FINISH_DONE;\n  }\n  if (s.last_lit) {\n    /*** FLUSH_BLOCK(s, 0); ***/\n    flush_block_only(s, false);\n    if (s.strm.avail_out === 0) {\n      return BS_NEED_MORE;\n    }\n    /***/\n  }\n  return BS_BLOCK_DONE;\n}\n\n/* ===========================================================================\n * Same as above, but achieves better compression. We use a lazy\n * evaluation for matches: a match is finally adopted only if there is\n * no better match at the next window position.\n */\nfunction deflate_slow(s, flush) {\n  var hash_head;          /* head of hash chain */\n  var bflush;              /* set if current block must be flushed */\n\n  var max_insert;\n\n  /* Process the input block. */\n  for (;;) {\n    /* Make sure that we always have enough lookahead, except\n     * at the end of the input file. We need MAX_MATCH bytes\n     * for the next match, plus MIN_MATCH bytes to insert the\n     * string following the next match.\n     */\n    if (s.lookahead < MIN_LOOKAHEAD) {\n      fill_window(s);\n      if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\n        return BS_NEED_MORE;\n      }\n      if (s.lookahead === 0) { break; } /* flush the current block */\n    }\n\n    /* Insert the string window[strstart .. strstart+2] in the\n     * dictionary, and set hash_head to the head of the hash chain:\n     */\n    hash_head = 0/*NIL*/;\n    if (s.lookahead >= MIN_MATCH) {\n      /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n      s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n      hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n      s.head[s.ins_h] = s.strstart;\n      /***/\n    }\n\n    /* Find the longest match, discarding those <= prev_length.\n     */\n    s.prev_length = s.match_length;\n    s.prev_match = s.match_start;\n    s.match_length = MIN_MATCH - 1;\n\n    if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\n        s.strstart - hash_head <= (s.w_size - MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\n      /* To simplify the code, we prevent matches with the string\n       * of window index 0 (in particular we have to avoid a match\n       * of the string with itself at the start of the input file).\n       */\n      s.match_length = longest_match(s, hash_head);\n      /* longest_match() sets match_start */\n\n      if (s.match_length <= 5 &&\n         (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\n\n        /* If prev_match is also MIN_MATCH, match_start is garbage\n         * but we will ignore the current match anyway.\n         */\n        s.match_length = MIN_MATCH - 1;\n      }\n    }\n    /* If there was a match at the previous step and the current\n     * match is not better, output the previous match:\n     */\n    if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\n      max_insert = s.strstart + s.lookahead - MIN_MATCH;\n      /* Do not insert strings in hash table beyond this. */\n\n      //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\n\n      /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\n                     s.prev_length - MIN_MATCH, bflush);***/\n      bflush = trees._tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH);\n      /* Insert in hash table all strings up to the end of the match.\n       * strstart-1 and strstart are already inserted. If there is not\n       * enough lookahead, the last two strings are not inserted in\n       * the hash table.\n       */\n      s.lookahead -= s.prev_length - 1;\n      s.prev_length -= 2;\n      do {\n        if (++s.strstart <= max_insert) {\n          /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n          s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n          hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n          s.head[s.ins_h] = s.strstart;\n          /***/\n        }\n      } while (--s.prev_length !== 0);\n      s.match_available = 0;\n      s.match_length = MIN_MATCH - 1;\n      s.strstart++;\n\n      if (bflush) {\n        /*** FLUSH_BLOCK(s, 0); ***/\n        flush_block_only(s, false);\n        if (s.strm.avail_out === 0) {\n          return BS_NEED_MORE;\n        }\n        /***/\n      }\n\n    } else if (s.match_available) {\n      /* If there was no match at the previous position, output a\n       * single literal. If there was a match but the current match\n       * is longer, truncate the previous match to a single literal.\n       */\n      //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n      /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n      bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\n\n      if (bflush) {\n        /*** FLUSH_BLOCK_ONLY(s, 0) ***/\n        flush_block_only(s, false);\n        /***/\n      }\n      s.strstart++;\n      s.lookahead--;\n      if (s.strm.avail_out === 0) {\n        return BS_NEED_MORE;\n      }\n    } else {\n      /* There is no previous match to compare with, wait for\n       * the next step to decide.\n       */\n      s.match_available = 1;\n      s.strstart++;\n      s.lookahead--;\n    }\n  }\n  //Assert (flush != Z_NO_FLUSH, \"no flush?\");\n  if (s.match_available) {\n    //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n    /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n    bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\n\n    s.match_available = 0;\n  }\n  s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;\n  if (flush === Z_FINISH) {\n    /*** FLUSH_BLOCK(s, 1); ***/\n    flush_block_only(s, true);\n    if (s.strm.avail_out === 0) {\n      return BS_FINISH_STARTED;\n    }\n    /***/\n    return BS_FINISH_DONE;\n  }\n  if (s.last_lit) {\n    /*** FLUSH_BLOCK(s, 0); ***/\n    flush_block_only(s, false);\n    if (s.strm.avail_out === 0) {\n      return BS_NEED_MORE;\n    }\n    /***/\n  }\n\n  return BS_BLOCK_DONE;\n}\n\n\n/* ===========================================================================\n * For Z_RLE, simply look for runs of bytes, generate matches only of distance\n * one.  Do not maintain a hash table.  (It will be regenerated if this run of\n * deflate switches away from Z_RLE.)\n */\nfunction deflate_rle(s, flush) {\n  var bflush;            /* set if current block must be flushed */\n  var prev;              /* byte at distance one to match */\n  var scan, strend;      /* scan goes up to strend for length of run */\n\n  var _win = s.window;\n\n  for (;;) {\n    /* Make sure that we always have enough lookahead, except\n     * at the end of the input file. We need MAX_MATCH bytes\n     * for the longest run, plus one for the unrolled loop.\n     */\n    if (s.lookahead <= MAX_MATCH) {\n      fill_window(s);\n      if (s.lookahead <= MAX_MATCH && flush === Z_NO_FLUSH) {\n        return BS_NEED_MORE;\n      }\n      if (s.lookahead === 0) { break; } /* flush the current block */\n    }\n\n    /* See how many times the previous byte repeats */\n    s.match_length = 0;\n    if (s.lookahead >= MIN_MATCH && s.strstart > 0) {\n      scan = s.strstart - 1;\n      prev = _win[scan];\n      if (prev === _win[++scan] && prev === _win[++scan] && prev === _win[++scan]) {\n        strend = s.strstart + MAX_MATCH;\n        do {\n          /*jshint noempty:false*/\n        } while (prev === _win[++scan] && prev === _win[++scan] &&\n                 prev === _win[++scan] && prev === _win[++scan] &&\n                 prev === _win[++scan] && prev === _win[++scan] &&\n                 prev === _win[++scan] && prev === _win[++scan] &&\n                 scan < strend);\n        s.match_length = MAX_MATCH - (strend - scan);\n        if (s.match_length > s.lookahead) {\n          s.match_length = s.lookahead;\n        }\n      }\n      //Assert(scan <= s->window+(uInt)(s->window_size-1), \"wild scan\");\n    }\n\n    /* Emit match if have run of MIN_MATCH or longer, else emit literal */\n    if (s.match_length >= MIN_MATCH) {\n      //check_match(s, s.strstart, s.strstart - 1, s.match_length);\n\n      /*** _tr_tally_dist(s, 1, s.match_length - MIN_MATCH, bflush); ***/\n      bflush = trees._tr_tally(s, 1, s.match_length - MIN_MATCH);\n\n      s.lookahead -= s.match_length;\n      s.strstart += s.match_length;\n      s.match_length = 0;\n    } else {\n      /* No match, output a literal byte */\n      //Tracevv((stderr,\"%c\", s->window[s->strstart]));\n      /*** _tr_tally_lit(s, s.window[s.strstart], bflush); ***/\n      bflush = trees._tr_tally(s, 0, s.window[s.strstart]);\n\n      s.lookahead--;\n      s.strstart++;\n    }\n    if (bflush) {\n      /*** FLUSH_BLOCK(s, 0); ***/\n      flush_block_only(s, false);\n      if (s.strm.avail_out === 0) {\n        return BS_NEED_MORE;\n      }\n      /***/\n    }\n  }\n  s.insert = 0;\n  if (flush === Z_FINISH) {\n    /*** FLUSH_BLOCK(s, 1); ***/\n    flush_block_only(s, true);\n    if (s.strm.avail_out === 0) {\n      return BS_FINISH_STARTED;\n    }\n    /***/\n    return BS_FINISH_DONE;\n  }\n  if (s.last_lit) {\n    /*** FLUSH_BLOCK(s, 0); ***/\n    flush_block_only(s, false);\n    if (s.strm.avail_out === 0) {\n      return BS_NEED_MORE;\n    }\n    /***/\n  }\n  return BS_BLOCK_DONE;\n}\n\n/* ===========================================================================\n * For Z_HUFFMAN_ONLY, do not look for matches.  Do not maintain a hash table.\n * (It will be regenerated if this run of deflate switches away from Huffman.)\n */\nfunction deflate_huff(s, flush) {\n  var bflush;             /* set if current block must be flushed */\n\n  for (;;) {\n    /* Make sure that we have a literal to write. */\n    if (s.lookahead === 0) {\n      fill_window(s);\n      if (s.lookahead === 0) {\n        if (flush === Z_NO_FLUSH) {\n          return BS_NEED_MORE;\n        }\n        break;      /* flush the current block */\n      }\n    }\n\n    /* Output a literal byte */\n    s.match_length = 0;\n    //Tracevv((stderr,\"%c\", s->window[s->strstart]));\n    /*** _tr_tally_lit(s, s.window[s.strstart], bflush); ***/\n    bflush = trees._tr_tally(s, 0, s.window[s.strstart]);\n    s.lookahead--;\n    s.strstart++;\n    if (bflush) {\n      /*** FLUSH_BLOCK(s, 0); ***/\n      flush_block_only(s, false);\n      if (s.strm.avail_out === 0) {\n        return BS_NEED_MORE;\n      }\n      /***/\n    }\n  }\n  s.insert = 0;\n  if (flush === Z_FINISH) {\n    /*** FLUSH_BLOCK(s, 1); ***/\n    flush_block_only(s, true);\n    if (s.strm.avail_out === 0) {\n      return BS_FINISH_STARTED;\n    }\n    /***/\n    return BS_FINISH_DONE;\n  }\n  if (s.last_lit) {\n    /*** FLUSH_BLOCK(s, 0); ***/\n    flush_block_only(s, false);\n    if (s.strm.avail_out === 0) {\n      return BS_NEED_MORE;\n    }\n    /***/\n  }\n  return BS_BLOCK_DONE;\n}\n\n/* Values for max_lazy_match, good_match and max_chain_length, depending on\n * the desired pack level (0..9). The values given below have been tuned to\n * exclude worst case performance for pathological files. Better values may be\n * found for specific files.\n */\nfunction Config(good_length, max_lazy, nice_length, max_chain, func) {\n  this.good_length = good_length;\n  this.max_lazy = max_lazy;\n  this.nice_length = nice_length;\n  this.max_chain = max_chain;\n  this.func = func;\n}\n\nvar configuration_table;\n\nconfiguration_table = [\n  /*      good lazy nice chain */\n  new Config(0, 0, 0, 0, deflate_stored),          /* 0 store only */\n  new Config(4, 4, 8, 4, deflate_fast),            /* 1 max speed, no lazy matches */\n  new Config(4, 5, 16, 8, deflate_fast),           /* 2 */\n  new Config(4, 6, 32, 32, deflate_fast),          /* 3 */\n\n  new Config(4, 4, 16, 16, deflate_slow),          /* 4 lazy matches */\n  new Config(8, 16, 32, 32, deflate_slow),         /* 5 */\n  new Config(8, 16, 128, 128, deflate_slow),       /* 6 */\n  new Config(8, 32, 128, 256, deflate_slow),       /* 7 */\n  new Config(32, 128, 258, 1024, deflate_slow),    /* 8 */\n  new Config(32, 258, 258, 4096, deflate_slow)     /* 9 max compression */\n];\n\n\n/* ===========================================================================\n * Initialize the \"longest match\" routines for a new zlib stream\n */\nfunction lm_init(s) {\n  s.window_size = 2 * s.w_size;\n\n  /*** CLEAR_HASH(s); ***/\n  zero(s.head); // Fill with NIL (= 0);\n\n  /* Set the default configuration parameters:\n   */\n  s.max_lazy_match = configuration_table[s.level].max_lazy;\n  s.good_match = configuration_table[s.level].good_length;\n  s.nice_match = configuration_table[s.level].nice_length;\n  s.max_chain_length = configuration_table[s.level].max_chain;\n\n  s.strstart = 0;\n  s.block_start = 0;\n  s.lookahead = 0;\n  s.insert = 0;\n  s.match_length = s.prev_length = MIN_MATCH - 1;\n  s.match_available = 0;\n  s.ins_h = 0;\n}\n\n\nfunction DeflateState() {\n  this.strm = null;            /* pointer back to this zlib stream */\n  this.status = 0;            /* as the name implies */\n  this.pending_buf = null;      /* output still pending */\n  this.pending_buf_size = 0;  /* size of pending_buf */\n  this.pending_out = 0;       /* next pending byte to output to the stream */\n  this.pending = 0;           /* nb of bytes in the pending buffer */\n  this.wrap = 0;              /* bit 0 true for zlib, bit 1 true for gzip */\n  this.gzhead = null;         /* gzip header information to write */\n  this.gzindex = 0;           /* where in extra, name, or comment */\n  this.method = Z_DEFLATED; /* can only be DEFLATED */\n  this.last_flush = -1;   /* value of flush param for previous deflate call */\n\n  this.w_size = 0;  /* LZ77 window size (32K by default) */\n  this.w_bits = 0;  /* log2(w_size)  (8..16) */\n  this.w_mask = 0;  /* w_size - 1 */\n\n  this.window = null;\n  /* Sliding window. Input bytes are read into the second half of the window,\n   * and move to the first half later to keep a dictionary of at least wSize\n   * bytes. With this organization, matches are limited to a distance of\n   * wSize-MAX_MATCH bytes, but this ensures that IO is always\n   * performed with a length multiple of the block size.\n   */\n\n  this.window_size = 0;\n  /* Actual size of window: 2*wSize, except when the user input buffer\n   * is directly used as sliding window.\n   */\n\n  this.prev = null;\n  /* Link to older string with same hash index. To limit the size of this\n   * array to 64K, this link is maintained only for the last 32K strings.\n   * An index in this array is thus a window index modulo 32K.\n   */\n\n  this.head = null;   /* Heads of the hash chains or NIL. */\n\n  this.ins_h = 0;       /* hash index of string to be inserted */\n  this.hash_size = 0;   /* number of elements in hash table */\n  this.hash_bits = 0;   /* log2(hash_size) */\n  this.hash_mask = 0;   /* hash_size-1 */\n\n  this.hash_shift = 0;\n  /* Number of bits by which ins_h must be shifted at each input\n   * step. It must be such that after MIN_MATCH steps, the oldest\n   * byte no longer takes part in the hash key, that is:\n   *   hash_shift * MIN_MATCH >= hash_bits\n   */\n\n  this.block_start = 0;\n  /* Window position at the beginning of the current output block. Gets\n   * negative when the window is moved backwards.\n   */\n\n  this.match_length = 0;      /* length of best match */\n  this.prev_match = 0;        /* previous match */\n  this.match_available = 0;   /* set if previous match exists */\n  this.strstart = 0;          /* start of string to insert */\n  this.match_start = 0;       /* start of matching string */\n  this.lookahead = 0;         /* number of valid bytes ahead in window */\n\n  this.prev_length = 0;\n  /* Length of the best match at previous step. Matches not greater than this\n   * are discarded. This is used in the lazy match evaluation.\n   */\n\n  this.max_chain_length = 0;\n  /* To speed up deflation, hash chains are never searched beyond this\n   * length.  A higher limit improves compression ratio but degrades the\n   * speed.\n   */\n\n  this.max_lazy_match = 0;\n  /* Attempt to find a better match only when the current match is strictly\n   * smaller than this value. This mechanism is used only for compression\n   * levels >= 4.\n   */\n  // That's alias to max_lazy_match, don't use directly\n  //this.max_insert_length = 0;\n  /* Insert new strings in the hash table only if the match length is not\n   * greater than this length. This saves time but degrades compression.\n   * max_insert_length is used only for compression levels <= 3.\n   */\n\n  this.level = 0;     /* compression level (1..9) */\n  this.strategy = 0;  /* favor or force Huffman coding*/\n\n  this.good_match = 0;\n  /* Use a faster search when the previous match is longer than this */\n\n  this.nice_match = 0; /* Stop searching when current match exceeds this */\n\n              /* used by trees.c: */\n\n  /* Didn't use ct_data typedef below to suppress compiler warning */\n\n  // struct ct_data_s dyn_ltree[HEAP_SIZE];   /* literal and length tree */\n  // struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */\n  // struct ct_data_s bl_tree[2*BL_CODES+1];  /* Huffman tree for bit lengths */\n\n  // Use flat array of DOUBLE size, with interleaved fata,\n  // because JS does not support effective\n  this.dyn_ltree  = new utils.Buf16(HEAP_SIZE * 2);\n  this.dyn_dtree  = new utils.Buf16((2 * D_CODES + 1) * 2);\n  this.bl_tree    = new utils.Buf16((2 * BL_CODES + 1) * 2);\n  zero(this.dyn_ltree);\n  zero(this.dyn_dtree);\n  zero(this.bl_tree);\n\n  this.l_desc   = null;         /* desc. for literal tree */\n  this.d_desc   = null;         /* desc. for distance tree */\n  this.bl_desc  = null;         /* desc. for bit length tree */\n\n  //ush bl_count[MAX_BITS+1];\n  this.bl_count = new utils.Buf16(MAX_BITS + 1);\n  /* number of codes at each bit length for an optimal tree */\n\n  //int heap[2*L_CODES+1];      /* heap used to build the Huffman trees */\n  this.heap = new utils.Buf16(2 * L_CODES + 1);  /* heap used to build the Huffman trees */\n  zero(this.heap);\n\n  this.heap_len = 0;               /* number of elements in the heap */\n  this.heap_max = 0;               /* element of largest frequency */\n  /* The sons of heap[n] are heap[2*n] and heap[2*n+1]. heap[0] is not used.\n   * The same heap array is used to build all trees.\n   */\n\n  this.depth = new utils.Buf16(2 * L_CODES + 1); //uch depth[2*L_CODES+1];\n  zero(this.depth);\n  /* Depth of each subtree used as tie breaker for trees of equal frequency\n   */\n\n  this.l_buf = 0;          /* buffer index for literals or lengths */\n\n  this.lit_bufsize = 0;\n  /* Size of match buffer for literals/lengths.  There are 4 reasons for\n   * limiting lit_bufsize to 64K:\n   *   - frequencies can be kept in 16 bit counters\n   *   - if compression is not successful for the first block, all input\n   *     data is still in the window so we can still emit a stored block even\n   *     when input comes from standard input.  (This can also be done for\n   *     all blocks if lit_bufsize is not greater than 32K.)\n   *   - if compression is not successful for a file smaller than 64K, we can\n   *     even emit a stored file instead of a stored block (saving 5 bytes).\n   *     This is applicable only for zip (not gzip or zlib).\n   *   - creating new Huffman trees less frequently may not provide fast\n   *     adaptation to changes in the input data statistics. (Take for\n   *     example a binary file with poorly compressible code followed by\n   *     a highly compressible string table.) Smaller buffer sizes give\n   *     fast adaptation but have of course the overhead of transmitting\n   *     trees more frequently.\n   *   - I can't count above 4\n   */\n\n  this.last_lit = 0;      /* running index in l_buf */\n\n  this.d_buf = 0;\n  /* Buffer index for distances. To simplify the code, d_buf and l_buf have\n   * the same number of elements. To use different lengths, an extra flag\n   * array would be necessary.\n   */\n\n  this.opt_len = 0;       /* bit length of current block with optimal trees */\n  this.static_len = 0;    /* bit length of current block with static trees */\n  this.matches = 0;       /* number of string matches in current block */\n  this.insert = 0;        /* bytes at end of window left to insert */\n\n\n  this.bi_buf = 0;\n  /* Output buffer. bits are inserted starting at the bottom (least\n   * significant bits).\n   */\n  this.bi_valid = 0;\n  /* Number of valid bits in bi_buf.  All bits above the last valid bit\n   * are always zero.\n   */\n\n  // Used for window memory init. We safely ignore it for JS. That makes\n  // sense only for pointers and memory check tools.\n  //this.high_water = 0;\n  /* High water mark offset in window for initialized bytes -- bytes above\n   * this are set to zero in order to avoid memory check warnings when\n   * longest match routines access bytes past the input.  This is then\n   * updated to the new high water mark.\n   */\n}\n\n\nfunction deflateResetKeep(strm) {\n  var s;\n\n  if (!strm || !strm.state) {\n    return err(strm, Z_STREAM_ERROR);\n  }\n\n  strm.total_in = strm.total_out = 0;\n  strm.data_type = Z_UNKNOWN;\n\n  s = strm.state;\n  s.pending = 0;\n  s.pending_out = 0;\n\n  if (s.wrap < 0) {\n    s.wrap = -s.wrap;\n    /* was made negative by deflate(..., Z_FINISH); */\n  }\n  s.status = (s.wrap ? INIT_STATE : BUSY_STATE);\n  strm.adler = (s.wrap === 2) ?\n    0  // crc32(0, Z_NULL, 0)\n  :\n    1; // adler32(0, Z_NULL, 0)\n  s.last_flush = Z_NO_FLUSH;\n  trees._tr_init(s);\n  return Z_OK;\n}\n\n\nfunction deflateReset(strm) {\n  var ret = deflateResetKeep(strm);\n  if (ret === Z_OK) {\n    lm_init(strm.state);\n  }\n  return ret;\n}\n\n\nfunction deflateSetHeader(strm, head) {\n  if (!strm || !strm.state) { return Z_STREAM_ERROR; }\n  if (strm.state.wrap !== 2) { return Z_STREAM_ERROR; }\n  strm.state.gzhead = head;\n  return Z_OK;\n}\n\n\nfunction deflateInit2(strm, level, method, windowBits, memLevel, strategy) {\n  if (!strm) { // === Z_NULL\n    return Z_STREAM_ERROR;\n  }\n  var wrap = 1;\n\n  if (level === Z_DEFAULT_COMPRESSION) {\n    level = 6;\n  }\n\n  if (windowBits < 0) { /* suppress zlib wrapper */\n    wrap = 0;\n    windowBits = -windowBits;\n  }\n\n  else if (windowBits > 15) {\n    wrap = 2;           /* write gzip wrapper instead */\n    windowBits -= 16;\n  }\n\n\n  if (memLevel < 1 || memLevel > MAX_MEM_LEVEL || method !== Z_DEFLATED ||\n    windowBits < 8 || windowBits > 15 || level < 0 || level > 9 ||\n    strategy < 0 || strategy > Z_FIXED) {\n    return err(strm, Z_STREAM_ERROR);\n  }\n\n\n  if (windowBits === 8) {\n    windowBits = 9;\n  }\n  /* until 256-byte window bug fixed */\n\n  var s = new DeflateState();\n\n  strm.state = s;\n  s.strm = strm;\n\n  s.wrap = wrap;\n  s.gzhead = null;\n  s.w_bits = windowBits;\n  s.w_size = 1 << s.w_bits;\n  s.w_mask = s.w_size - 1;\n\n  s.hash_bits = memLevel + 7;\n  s.hash_size = 1 << s.hash_bits;\n  s.hash_mask = s.hash_size - 1;\n  s.hash_shift = ~~((s.hash_bits + MIN_MATCH - 1) / MIN_MATCH);\n\n  s.window = new utils.Buf8(s.w_size * 2);\n  s.head = new utils.Buf16(s.hash_size);\n  s.prev = new utils.Buf16(s.w_size);\n\n  // Don't need mem init magic for JS.\n  //s.high_water = 0;  /* nothing written to s->window yet */\n\n  s.lit_bufsize = 1 << (memLevel + 6); /* 16K elements by default */\n\n  s.pending_buf_size = s.lit_bufsize * 4;\n\n  //overlay = (ushf *) ZALLOC(strm, s->lit_bufsize, sizeof(ush)+2);\n  //s->pending_buf = (uchf *) overlay;\n  s.pending_buf = new utils.Buf8(s.pending_buf_size);\n\n  // It is offset from `s.pending_buf` (size is `s.lit_bufsize * 2`)\n  //s->d_buf = overlay + s->lit_bufsize/sizeof(ush);\n  s.d_buf = 1 * s.lit_bufsize;\n\n  //s->l_buf = s->pending_buf + (1+sizeof(ush))*s->lit_bufsize;\n  s.l_buf = (1 + 2) * s.lit_bufsize;\n\n  s.level = level;\n  s.strategy = strategy;\n  s.method = method;\n\n  return deflateReset(strm);\n}\n\nfunction deflateInit(strm, level) {\n  return deflateInit2(strm, level, Z_DEFLATED, MAX_WBITS, DEF_MEM_LEVEL, Z_DEFAULT_STRATEGY);\n}\n\n\nfunction deflate(strm, flush) {\n  var old_flush, s;\n  var beg, val; // for gzip header write only\n\n  if (!strm || !strm.state ||\n    flush > Z_BLOCK || flush < 0) {\n    return strm ? err(strm, Z_STREAM_ERROR) : Z_STREAM_ERROR;\n  }\n\n  s = strm.state;\n\n  if (!strm.output ||\n      (!strm.input && strm.avail_in !== 0) ||\n      (s.status === FINISH_STATE && flush !== Z_FINISH)) {\n    return err(strm, (strm.avail_out === 0) ? Z_BUF_ERROR : Z_STREAM_ERROR);\n  }\n\n  s.strm = strm; /* just in case */\n  old_flush = s.last_flush;\n  s.last_flush = flush;\n\n  /* Write the header */\n  if (s.status === INIT_STATE) {\n\n    if (s.wrap === 2) { // GZIP header\n      strm.adler = 0;  //crc32(0L, Z_NULL, 0);\n      put_byte(s, 31);\n      put_byte(s, 139);\n      put_byte(s, 8);\n      if (!s.gzhead) { // s->gzhead == Z_NULL\n        put_byte(s, 0);\n        put_byte(s, 0);\n        put_byte(s, 0);\n        put_byte(s, 0);\n        put_byte(s, 0);\n        put_byte(s, s.level === 9 ? 2 :\n                    (s.strategy >= Z_HUFFMAN_ONLY || s.level < 2 ?\n                     4 : 0));\n        put_byte(s, OS_CODE);\n        s.status = BUSY_STATE;\n      }\n      else {\n        put_byte(s, (s.gzhead.text ? 1 : 0) +\n                    (s.gzhead.hcrc ? 2 : 0) +\n                    (!s.gzhead.extra ? 0 : 4) +\n                    (!s.gzhead.name ? 0 : 8) +\n                    (!s.gzhead.comment ? 0 : 16)\n        );\n        put_byte(s, s.gzhead.time & 0xff);\n        put_byte(s, (s.gzhead.time >> 8) & 0xff);\n        put_byte(s, (s.gzhead.time >> 16) & 0xff);\n        put_byte(s, (s.gzhead.time >> 24) & 0xff);\n        put_byte(s, s.level === 9 ? 2 :\n                    (s.strategy >= Z_HUFFMAN_ONLY || s.level < 2 ?\n                     4 : 0));\n        put_byte(s, s.gzhead.os & 0xff);\n        if (s.gzhead.extra && s.gzhead.extra.length) {\n          put_byte(s, s.gzhead.extra.length & 0xff);\n          put_byte(s, (s.gzhead.extra.length >> 8) & 0xff);\n        }\n        if (s.gzhead.hcrc) {\n          strm.adler = crc32(strm.adler, s.pending_buf, s.pending, 0);\n        }\n        s.gzindex = 0;\n        s.status = EXTRA_STATE;\n      }\n    }\n    else // DEFLATE header\n    {\n      var header = (Z_DEFLATED + ((s.w_bits - 8) << 4)) << 8;\n      var level_flags = -1;\n\n      if (s.strategy >= Z_HUFFMAN_ONLY || s.level < 2) {\n        level_flags = 0;\n      } else if (s.level < 6) {\n        level_flags = 1;\n      } else if (s.level === 6) {\n        level_flags = 2;\n      } else {\n        level_flags = 3;\n      }\n      header |= (level_flags << 6);\n      if (s.strstart !== 0) { header |= PRESET_DICT; }\n      header += 31 - (header % 31);\n\n      s.status = BUSY_STATE;\n      putShortMSB(s, header);\n\n      /* Save the adler32 of the preset dictionary: */\n      if (s.strstart !== 0) {\n        putShortMSB(s, strm.adler >>> 16);\n        putShortMSB(s, strm.adler & 0xffff);\n      }\n      strm.adler = 1; // adler32(0L, Z_NULL, 0);\n    }\n  }\n\n//#ifdef GZIP\n  if (s.status === EXTRA_STATE) {\n    if (s.gzhead.extra/* != Z_NULL*/) {\n      beg = s.pending;  /* start of bytes to update crc */\n\n      while (s.gzindex < (s.gzhead.extra.length & 0xffff)) {\n        if (s.pending === s.pending_buf_size) {\n          if (s.gzhead.hcrc && s.pending > beg) {\n            strm.adler = crc32(strm.adler, s.pending_buf, s.pending - beg, beg);\n          }\n          flush_pending(strm);\n          beg = s.pending;\n          if (s.pending === s.pending_buf_size) {\n            break;\n          }\n        }\n        put_byte(s, s.gzhead.extra[s.gzindex] & 0xff);\n        s.gzindex++;\n      }\n      if (s.gzhead.hcrc && s.pending > beg) {\n        strm.adler = crc32(strm.adler, s.pending_buf, s.pending - beg, beg);\n      }\n      if (s.gzindex === s.gzhead.extra.length) {\n        s.gzindex = 0;\n        s.status = NAME_STATE;\n      }\n    }\n    else {\n      s.status = NAME_STATE;\n    }\n  }\n  if (s.status === NAME_STATE) {\n    if (s.gzhead.name/* != Z_NULL*/) {\n      beg = s.pending;  /* start of bytes to update crc */\n      //int val;\n\n      do {\n        if (s.pending === s.pending_buf_size) {\n          if (s.gzhead.hcrc && s.pending > beg) {\n            strm.adler = crc32(strm.adler, s.pending_buf, s.pending - beg, beg);\n          }\n          flush_pending(strm);\n          beg = s.pending;\n          if (s.pending === s.pending_buf_size) {\n            val = 1;\n            break;\n          }\n        }\n        // JS specific: little magic to add zero terminator to end of string\n        if (s.gzindex < s.gzhead.name.length) {\n          val = s.gzhead.name.charCodeAt(s.gzindex++) & 0xff;\n        } else {\n          val = 0;\n        }\n        put_byte(s, val);\n      } while (val !== 0);\n\n      if (s.gzhead.hcrc && s.pending > beg) {\n        strm.adler = crc32(strm.adler, s.pending_buf, s.pending - beg, beg);\n      }\n      if (val === 0) {\n        s.gzindex = 0;\n        s.status = COMMENT_STATE;\n      }\n    }\n    else {\n      s.status = COMMENT_STATE;\n    }\n  }\n  if (s.status === COMMENT_STATE) {\n    if (s.gzhead.comment/* != Z_NULL*/) {\n      beg = s.pending;  /* start of bytes to update crc */\n      //int val;\n\n      do {\n        if (s.pending === s.pending_buf_size) {\n          if (s.gzhead.hcrc && s.pending > beg) {\n            strm.adler = crc32(strm.adler, s.pending_buf, s.pending - beg, beg);\n          }\n          flush_pending(strm);\n          beg = s.pending;\n          if (s.pending === s.pending_buf_size) {\n            val = 1;\n            break;\n          }\n        }\n        // JS specific: little magic to add zero terminator to end of string\n        if (s.gzindex < s.gzhead.comment.length) {\n          val = s.gzhead.comment.charCodeAt(s.gzindex++) & 0xff;\n        } else {\n          val = 0;\n        }\n        put_byte(s, val);\n      } while (val !== 0);\n\n      if (s.gzhead.hcrc && s.pending > beg) {\n        strm.adler = crc32(strm.adler, s.pending_buf, s.pending - beg, beg);\n      }\n      if (val === 0) {\n        s.status = HCRC_STATE;\n      }\n    }\n    else {\n      s.status = HCRC_STATE;\n    }\n  }\n  if (s.status === HCRC_STATE) {\n    if (s.gzhead.hcrc) {\n      if (s.pending + 2 > s.pending_buf_size) {\n        flush_pending(strm);\n      }\n      if (s.pending + 2 <= s.pending_buf_size) {\n        put_byte(s, strm.adler & 0xff);\n        put_byte(s, (strm.adler >> 8) & 0xff);\n        strm.adler = 0; //crc32(0L, Z_NULL, 0);\n        s.status = BUSY_STATE;\n      }\n    }\n    else {\n      s.status = BUSY_STATE;\n    }\n  }\n//#endif\n\n  /* Flush as much pending output as possible */\n  if (s.pending !== 0) {\n    flush_pending(strm);\n    if (strm.avail_out === 0) {\n      /* Since avail_out is 0, deflate will be called again with\n       * more output space, but possibly with both pending and\n       * avail_in equal to zero. There won't be anything to do,\n       * but this is not an error situation so make sure we\n       * return OK instead of BUF_ERROR at next call of deflate:\n       */\n      s.last_flush = -1;\n      return Z_OK;\n    }\n\n    /* Make sure there is something to do and avoid duplicate consecutive\n     * flushes. For repeated and useless calls with Z_FINISH, we keep\n     * returning Z_STREAM_END instead of Z_BUF_ERROR.\n     */\n  } else if (strm.avail_in === 0 && rank(flush) <= rank(old_flush) &&\n    flush !== Z_FINISH) {\n    return err(strm, Z_BUF_ERROR);\n  }\n\n  /* User must not provide more input after the first FINISH: */\n  if (s.status === FINISH_STATE && strm.avail_in !== 0) {\n    return err(strm, Z_BUF_ERROR);\n  }\n\n  /* Start a new block or continue the current one.\n   */\n  if (strm.avail_in !== 0 || s.lookahead !== 0 ||\n    (flush !== Z_NO_FLUSH && s.status !== FINISH_STATE)) {\n    var bstate = (s.strategy === Z_HUFFMAN_ONLY) ? deflate_huff(s, flush) :\n      (s.strategy === Z_RLE ? deflate_rle(s, flush) :\n        configuration_table[s.level].func(s, flush));\n\n    if (bstate === BS_FINISH_STARTED || bstate === BS_FINISH_DONE) {\n      s.status = FINISH_STATE;\n    }\n    if (bstate === BS_NEED_MORE || bstate === BS_FINISH_STARTED) {\n      if (strm.avail_out === 0) {\n        s.last_flush = -1;\n        /* avoid BUF_ERROR next call, see above */\n      }\n      return Z_OK;\n      /* If flush != Z_NO_FLUSH && avail_out == 0, the next call\n       * of deflate should use the same flush parameter to make sure\n       * that the flush is complete. So we don't have to output an\n       * empty block here, this will be done at next call. This also\n       * ensures that for a very small output buffer, we emit at most\n       * one empty block.\n       */\n    }\n    if (bstate === BS_BLOCK_DONE) {\n      if (flush === Z_PARTIAL_FLUSH) {\n        trees._tr_align(s);\n      }\n      else if (flush !== Z_BLOCK) { /* FULL_FLUSH or SYNC_FLUSH */\n\n        trees._tr_stored_block(s, 0, 0, false);\n        /* For a full flush, this empty block will be recognized\n         * as a special marker by inflate_sync().\n         */\n        if (flush === Z_FULL_FLUSH) {\n          /*** CLEAR_HASH(s); ***/             /* forget history */\n          zero(s.head); // Fill with NIL (= 0);\n\n          if (s.lookahead === 0) {\n            s.strstart = 0;\n            s.block_start = 0;\n            s.insert = 0;\n          }\n        }\n      }\n      flush_pending(strm);\n      if (strm.avail_out === 0) {\n        s.last_flush = -1; /* avoid BUF_ERROR at next call, see above */\n        return Z_OK;\n      }\n    }\n  }\n  //Assert(strm->avail_out > 0, \"bug2\");\n  //if (strm.avail_out <= 0) { throw new Error(\"bug2\");}\n\n  if (flush !== Z_FINISH) { return Z_OK; }\n  if (s.wrap <= 0) { return Z_STREAM_END; }\n\n  /* Write the trailer */\n  if (s.wrap === 2) {\n    put_byte(s, strm.adler & 0xff);\n    put_byte(s, (strm.adler >> 8) & 0xff);\n    put_byte(s, (strm.adler >> 16) & 0xff);\n    put_byte(s, (strm.adler >> 24) & 0xff);\n    put_byte(s, strm.total_in & 0xff);\n    put_byte(s, (strm.total_in >> 8) & 0xff);\n    put_byte(s, (strm.total_in >> 16) & 0xff);\n    put_byte(s, (strm.total_in >> 24) & 0xff);\n  }\n  else\n  {\n    putShortMSB(s, strm.adler >>> 16);\n    putShortMSB(s, strm.adler & 0xffff);\n  }\n\n  flush_pending(strm);\n  /* If avail_out is zero, the application will call deflate again\n   * to flush the rest.\n   */\n  if (s.wrap > 0) { s.wrap = -s.wrap; }\n  /* write the trailer only once! */\n  return s.pending !== 0 ? Z_OK : Z_STREAM_END;\n}\n\nfunction deflateEnd(strm) {\n  var status;\n\n  if (!strm/*== Z_NULL*/ || !strm.state/*== Z_NULL*/) {\n    return Z_STREAM_ERROR;\n  }\n\n  status = strm.state.status;\n  if (status !== INIT_STATE &&\n    status !== EXTRA_STATE &&\n    status !== NAME_STATE &&\n    status !== COMMENT_STATE &&\n    status !== HCRC_STATE &&\n    status !== BUSY_STATE &&\n    status !== FINISH_STATE\n  ) {\n    return err(strm, Z_STREAM_ERROR);\n  }\n\n  strm.state = null;\n\n  return status === BUSY_STATE ? err(strm, Z_DATA_ERROR) : Z_OK;\n}\n\n\n/* =========================================================================\n * Initializes the compression dictionary from the given byte\n * sequence without producing any compressed output.\n */\nfunction deflateSetDictionary(strm, dictionary) {\n  var dictLength = dictionary.length;\n\n  var s;\n  var str, n;\n  var wrap;\n  var avail;\n  var next;\n  var input;\n  var tmpDict;\n\n  if (!strm/*== Z_NULL*/ || !strm.state/*== Z_NULL*/) {\n    return Z_STREAM_ERROR;\n  }\n\n  s = strm.state;\n  wrap = s.wrap;\n\n  if (wrap === 2 || (wrap === 1 && s.status !== INIT_STATE) || s.lookahead) {\n    return Z_STREAM_ERROR;\n  }\n\n  /* when using zlib wrappers, compute Adler-32 for provided dictionary */\n  if (wrap === 1) {\n    /* adler32(strm->adler, dictionary, dictLength); */\n    strm.adler = adler32(strm.adler, dictionary, dictLength, 0);\n  }\n\n  s.wrap = 0;   /* avoid computing Adler-32 in read_buf */\n\n  /* if dictionary would fill window, just replace the history */\n  if (dictLength >= s.w_size) {\n    if (wrap === 0) {            /* already empty otherwise */\n      /*** CLEAR_HASH(s); ***/\n      zero(s.head); // Fill with NIL (= 0);\n      s.strstart = 0;\n      s.block_start = 0;\n      s.insert = 0;\n    }\n    /* use the tail */\n    // dictionary = dictionary.slice(dictLength - s.w_size);\n    tmpDict = new utils.Buf8(s.w_size);\n    utils.arraySet(tmpDict, dictionary, dictLength - s.w_size, s.w_size, 0);\n    dictionary = tmpDict;\n    dictLength = s.w_size;\n  }\n  /* insert dictionary into window and hash */\n  avail = strm.avail_in;\n  next = strm.next_in;\n  input = strm.input;\n  strm.avail_in = dictLength;\n  strm.next_in = 0;\n  strm.input = dictionary;\n  fill_window(s);\n  while (s.lookahead >= MIN_MATCH) {\n    str = s.strstart;\n    n = s.lookahead - (MIN_MATCH - 1);\n    do {\n      /* UPDATE_HASH(s, s->ins_h, s->window[str + MIN_MATCH-1]); */\n      s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[str + MIN_MATCH - 1]) & s.hash_mask;\n\n      s.prev[str & s.w_mask] = s.head[s.ins_h];\n\n      s.head[s.ins_h] = str;\n      str++;\n    } while (--n);\n    s.strstart = str;\n    s.lookahead = MIN_MATCH - 1;\n    fill_window(s);\n  }\n  s.strstart += s.lookahead;\n  s.block_start = s.strstart;\n  s.insert = s.lookahead;\n  s.lookahead = 0;\n  s.match_length = s.prev_length = MIN_MATCH - 1;\n  s.match_available = 0;\n  strm.next_in = next;\n  strm.input = input;\n  strm.avail_in = avail;\n  s.wrap = wrap;\n  return Z_OK;\n}\n\n\nexports.deflateInit = deflateInit;\nexports.deflateInit2 = deflateInit2;\nexports.deflateReset = deflateReset;\nexports.deflateResetKeep = deflateResetKeep;\nexports.deflateSetHeader = deflateSetHeader;\nexports.deflate = deflate;\nexports.deflateEnd = deflateEnd;\nexports.deflateSetDictionary = deflateSetDictionary;\nexports.deflateInfo = 'pako deflate (from Nodeca project)';\n\n/* Not implemented\nexports.deflateBound = deflateBound;\nexports.deflateCopy = deflateCopy;\nexports.deflateParams = deflateParams;\nexports.deflatePending = deflatePending;\nexports.deflatePrime = deflatePrime;\nexports.deflateTune = deflateTune;\n*/\n"],"names":["utils","require$$0","trees","require$$1","adler32","require$$2","crc32","require$$3","msg","require$$4","Z_NO_FLUSH","Z_PARTIAL_FLUSH","Z_FULL_FLUSH","Z_FINISH","Z_BLOCK","Z_OK","Z_STREAM_END","Z_STREAM_ERROR","Z_DATA_ERROR","Z_BUF_ERROR","Z_DEFAULT_COMPRESSION","Z_FILTERED","Z_HUFFMAN_ONLY","Z_RLE","Z_FIXED","Z_DEFAULT_STRATEGY","Z_UNKNOWN","Z_DEFLATED","MAX_MEM_LEVEL","MAX_WBITS","DEF_MEM_LEVEL","LENGTH_CODES","LITERALS","L_CODES","D_CODES","BL_CODES","HEAP_SIZE","MAX_BITS","MIN_MATCH","MAX_MATCH","MIN_LOOKAHEAD","PRESET_DICT","INIT_STATE","EXTRA_STATE","NAME_STATE","COMMENT_STATE","HCRC_STATE","BUSY_STATE","FINISH_STATE","BS_NEED_MORE","BS_BLOCK_DONE","BS_FINISH_STARTED","BS_FINISH_DONE","OS_CODE","err","strm","errorCode","rank","f","zero","buf","len","flush_pending","s","flush_block_only","last","put_byte","b","putShortMSB","read_buf","start","size","longest_match","cur_match","chain_length","scan","match","best_len","nice_match","limit","_win","wmask","prev","strend","scan_end1","scan_end","fill_window","_w_size","p","n","m","more","str","deflate_stored","flush","max_block_size","max_start","deflate_fast","hash_head","bflush","deflate_slow","max_insert","deflate_rle","deflate_huff","Config","good_length","max_lazy","nice_length","max_chain","func","configuration_table","lm_init","DeflateState","deflateResetKeep","deflateReset","ret","deflateSetHeader","head","deflateInit2","level","method","windowBits","memLevel","strategy","wrap","deflateInit","deflate","old_flush","beg","val","header","level_flags","bstate","deflateEnd","status","deflateSetDictionary","dictionary","dictLength","avail","next","input","tmpDict","deflate_1"],"mappings":"yUAqBA,IAAIA,EAAUC,GAAAA,UAA0B,EACpCC,EAAUC,GAAAA,UAAkB,EAC5BC,EAAUC,GAAAA,UAAoB,EAC9BC,EAAUC,GAAAA,UAAkB,EAC5BC,GAAUC,GAAAA,UAAqB,EAO/BC,EAAkB,EAClBC,GAAkB,EAElBC,GAAkB,EAClBC,EAAkB,EAClBC,EAAkB,EAOlBC,EAAkB,EAClBC,EAAkB,EAGlBC,EAAkB,GAClBC,GAAkB,GAElBC,EAAkB,GAQlBC,GAAwB,GAGxBC,GAAwB,EACxBC,EAAwB,EACxBC,GAAwB,EACxBC,GAAwB,EACxBC,GAAwB,EAMxBC,GAAwB,EAIxBC,EAAc,EAKdC,GAAgB,EAEhBC,GAAY,GAEZC,GAAgB,EAGhBC,GAAgB,GAEhBC,GAAgB,IAEhBC,EAAgBD,GAAW,EAAID,GAE/BG,GAAgB,GAEhBC,GAAgB,GAEhBC,GAAgB,EAAIH,EAAU,EAE9BI,GAAY,GAGZC,EAAY,EACZC,EAAY,IACZC,EAAiBD,EAAYD,EAAY,EAEzCG,GAAc,GAEdC,EAAa,GACbC,EAAc,GACdC,EAAa,GACbC,EAAgB,GAChBC,EAAa,IACbC,EAAa,IACbC,EAAe,IAEfC,EAAoB,EACpBC,EAAoB,EACpBC,EAAoB,EACpBC,EAAoB,EAEpBC,GAAU,EAEd,SAASC,EAAIC,EAAMC,EAAW,CAC5B,OAAAD,EAAK,IAAM/C,GAAIgD,CAAS,EACjBA,EAGT,SAASC,EAAKC,EAAG,CACf,OAASA,GAAM,IAAOA,EAAK,EAAI,EAAI,GAGrC,SAASC,EAAKC,EAAK,CAAwB,QAAlBC,EAAMD,EAAI,OAAe,EAAEC,GAAO,GAAKD,EAAIC,CAAG,EAAI,CAAI,CAS/E,SAASC,EAAcP,EAAM,CAC3B,IAAIQ,EAAIR,EAAK,MAGTM,EAAME,EAAE,QACRF,EAAMN,EAAK,YACbM,EAAMN,EAAK,WAETM,IAAQ,IAEZ7D,EAAM,SAASuD,EAAK,OAAQQ,EAAE,YAAaA,EAAE,YAAaF,EAAKN,EAAK,QAAQ,EAC5EA,EAAK,UAAYM,EACjBE,EAAE,aAAeF,EACjBN,EAAK,WAAaM,EAClBN,EAAK,WAAaM,EAClBE,EAAE,SAAWF,EACTE,EAAE,UAAY,IAChBA,EAAE,YAAc,IAKpB,SAASC,EAAiBD,EAAGE,EAAM,CACjC/D,EAAM,gBAAgB6D,EAAIA,EAAE,aAAe,EAAIA,EAAE,YAAc,GAAKA,EAAE,SAAWA,EAAE,YAAaE,CAAI,EACpGF,EAAE,YAAcA,EAAE,SAClBD,EAAcC,EAAE,IAAI,EAItB,SAASG,EAASH,EAAGI,EAAG,CACtBJ,EAAE,YAAYA,EAAE,SAAS,EAAII,EAS/B,SAASC,EAAYL,EAAGI,EAAG,CAGzBJ,EAAE,YAAYA,EAAE,SAAS,EAAKI,IAAM,EAAK,IACzCJ,EAAE,YAAYA,EAAE,SAAS,EAAII,EAAI,IAWnC,SAASE,GAASd,EAAMK,EAAKU,EAAOC,EAAM,CACxC,IAAIV,EAAMN,EAAK,SAGf,OADIM,EAAMU,IAAQV,EAAMU,GACpBV,IAAQ,EAAY,GAExBN,EAAK,UAAYM,EAGjB7D,EAAM,SAAS4D,EAAKL,EAAK,MAAOA,EAAK,QAASM,EAAKS,CAAK,EACpDf,EAAK,MAAM,OAAS,EACtBA,EAAK,MAAQnD,EAAQmD,EAAK,MAAOK,EAAKC,EAAKS,CAAK,EAGzCf,EAAK,MAAM,OAAS,IAC3BA,EAAK,MAAQjD,EAAMiD,EAAK,MAAOK,EAAKC,EAAKS,CAAK,GAGhDf,EAAK,SAAWM,EAChBN,EAAK,UAAYM,EAEVA,GAaT,SAASW,EAAcT,EAAGU,EAAW,CACnC,IAAIC,EAAeX,EAAE,iBACjBY,EAAOZ,EAAE,SACTa,EACAf,EACAgB,EAAWd,EAAE,YACbe,EAAaf,EAAE,WACfgB,EAAShB,EAAE,SAAYA,EAAE,OAASvB,EAClCuB,EAAE,UAAYA,EAAE,OAASvB,GAAiB,EAE1CwC,EAAOjB,EAAE,OAETkB,EAAQlB,EAAE,OACVmB,GAAQnB,EAAE,KAMVoB,EAASpB,EAAE,SAAWxB,EACtB6C,GAAaJ,EAAKL,EAAOE,EAAW,CAAC,EACrCQ,GAAaL,EAAKL,EAAOE,CAAQ,EAQjCd,EAAE,aAAeA,EAAE,aACrBW,IAAiB,GAKfI,EAAaf,EAAE,YAAae,EAAaf,EAAE,WAI/C,EAaE,IAXAa,EAAQH,EAWJ,EAAAO,EAAKJ,EAAQC,CAAQ,IAAUQ,IAC/BL,EAAKJ,EAAQC,EAAW,CAAC,IAAMO,IAC/BJ,EAAKJ,CAAK,IAAqBI,EAAKL,CAAI,GACxCK,EAAK,EAAEJ,CAAK,IAAmBI,EAAKL,EAAO,CAAC,GAUhD,CAAAA,GAAQ,EACRC,IAMA,EAAG,OAEMI,EAAK,EAAEL,CAAI,IAAMK,EAAK,EAAEJ,CAAK,GAAKI,EAAK,EAAEL,CAAI,IAAMK,EAAK,EAAEJ,CAAK,GAC/DI,EAAK,EAAEL,CAAI,IAAMK,EAAK,EAAEJ,CAAK,GAAKI,EAAK,EAAEL,CAAI,IAAMK,EAAK,EAAEJ,CAAK,GAC/DI,EAAK,EAAEL,CAAI,IAAMK,EAAK,EAAEJ,CAAK,GAAKI,EAAK,EAAEL,CAAI,IAAMK,EAAK,EAAEJ,CAAK,GAC/DI,EAAK,EAAEL,CAAI,IAAMK,EAAK,EAAEJ,CAAK,GAAKI,EAAK,EAAEL,CAAI,IAAMK,EAAK,EAAEJ,CAAK,GAC/DD,EAAOQ,GAOhB,GAHAtB,EAAMtB,GAAa4C,EAASR,GAC5BA,EAAOQ,EAAS5C,EAEZsB,EAAMgB,EAAU,CAGlB,GAFAd,EAAE,YAAcU,EAChBI,EAAWhB,EACPA,GAAOiB,EACT,MAEFM,GAAaJ,EAAKL,EAAOE,EAAW,CAAC,EACrCQ,GAAaL,EAAKL,EAAOE,CAAQ,UAE3BJ,EAAYS,GAAKT,EAAYQ,CAAK,GAAKF,GAAS,EAAEL,IAAiB,GAE7E,OAAIG,GAAYd,EAAE,UACTc,EAEFd,EAAE,UAcX,SAASuB,EAAYvB,EAAG,CACtB,IAAIwB,EAAUxB,EAAE,OACZyB,EAAGC,EAAGC,EAAGC,EAAMC,EAInB,EAAG,CAqBD,GApBAD,EAAO5B,EAAE,YAAcA,EAAE,UAAYA,EAAE,SAoBnCA,EAAE,UAAYwB,GAAWA,EAAU/C,GAAgB,CAErDxC,EAAM,SAAS+D,EAAE,OAAQA,EAAE,OAAQwB,EAASA,EAAS,CAAC,EACtDxB,EAAE,aAAewB,EACjBxB,EAAE,UAAYwB,EAEdxB,EAAE,aAAewB,EASjBE,EAAI1B,EAAE,UACNyB,EAAIC,EACJ,GACEC,EAAI3B,EAAE,KAAK,EAAEyB,CAAC,EACdzB,EAAE,KAAKyB,CAAC,EAAKE,GAAKH,EAAUG,EAAIH,EAAU,QACnC,EAAEE,GAEXA,EAAIF,EACJC,EAAIC,EACJ,GACEC,EAAI3B,EAAE,KAAK,EAAEyB,CAAC,EACdzB,EAAE,KAAKyB,CAAC,EAAKE,GAAKH,EAAUG,EAAIH,EAAU,QAInC,EAAEE,GAEXE,GAAQJ,EAEV,GAAIxB,EAAE,KAAK,WAAa,EACtB,MAmBF,GAJA0B,EAAIpB,GAASN,EAAE,KAAMA,EAAE,OAAQA,EAAE,SAAWA,EAAE,UAAW4B,CAAI,EAC7D5B,EAAE,WAAa0B,EAGX1B,EAAE,UAAYA,EAAE,QAAUzB,EAS5B,IARAsD,EAAM7B,EAAE,SAAWA,EAAE,OACrBA,EAAE,MAAQA,EAAE,OAAO6B,CAAG,EAGtB7B,EAAE,OAAUA,EAAE,OAASA,EAAE,WAAcA,EAAE,OAAO6B,EAAM,CAAC,GAAK7B,EAAE,UAIvDA,EAAE,SAEPA,EAAE,OAAUA,EAAE,OAASA,EAAE,WAAcA,EAAE,OAAO6B,EAAMtD,EAAY,CAAC,GAAKyB,EAAE,UAE1EA,EAAE,KAAK6B,EAAM7B,EAAE,MAAM,EAAIA,EAAE,KAAKA,EAAE,KAAK,EACvCA,EAAE,KAAKA,EAAE,KAAK,EAAI6B,EAClBA,IACA7B,EAAE,SACE,EAAAA,EAAE,UAAYA,EAAE,OAASzB,KAA7B,CASR,OAAWyB,EAAE,UAAYvB,GAAiBuB,EAAE,KAAK,WAAa,GAiD9D,SAAS8B,GAAe9B,EAAG+B,EAAO,CAIhC,IAAIC,EAAiB,MAOrB,IALIA,EAAiBhC,EAAE,iBAAmB,IACxCgC,EAAiBhC,EAAE,iBAAmB,KAI/B,CAEP,GAAIA,EAAE,WAAa,EAAG,CAUpB,GADAuB,EAAYvB,CAAC,EACTA,EAAE,YAAc,GAAK+B,IAAUpF,EACjC,OAAOuC,EAGT,GAAIc,EAAE,YAAc,EAClB,MAOJA,EAAE,UAAYA,EAAE,UAChBA,EAAE,UAAY,EAGd,IAAIiC,EAAYjC,EAAE,YAAcgC,EAkBhC,IAhBIhC,EAAE,WAAa,GAAKA,EAAE,UAAYiC,KAEpCjC,EAAE,UAAYA,EAAE,SAAWiC,EAC3BjC,EAAE,SAAWiC,EAEbhC,EAAiBD,EAAG,EAAK,EACrBA,EAAE,KAAK,YAAc,IAUvBA,EAAE,SAAWA,EAAE,aAAgBA,EAAE,OAASvB,IAE5CwB,EAAiBD,EAAG,EAAK,EACrBA,EAAE,KAAK,YAAc,GACvB,OAAOd,EAQb,OAFAc,EAAE,OAAS,EAEP+B,IAAUjF,GAEZmD,EAAiBD,EAAG,EAAI,EACpBA,EAAE,KAAK,YAAc,EAChBZ,EAGFC,IAGLW,EAAE,SAAWA,EAAE,cAEjBC,EAAiBD,EAAG,EAAK,EACrBA,EAAE,KAAK,YAAc,GAChBd,GAeb,SAASgD,EAAalC,EAAG+B,EAAO,CAI9B,QAHII,EACAC,IAEK,CAMP,GAAIpC,EAAE,UAAYvB,EAAe,CAE/B,GADA8C,EAAYvB,CAAC,EACTA,EAAE,UAAYvB,GAAiBsD,IAAUpF,EAC3C,OAAOuC,EAET,GAAIc,EAAE,YAAc,EAClB,MA2BJ,GApBAmC,EAAY,EACRnC,EAAE,WAAazB,IAEjByB,EAAE,OAAUA,EAAE,OAASA,EAAE,WAAcA,EAAE,OAAOA,EAAE,SAAWzB,EAAY,CAAC,GAAKyB,EAAE,UACjFmC,EAAYnC,EAAE,KAAKA,EAAE,SAAWA,EAAE,MAAM,EAAIA,EAAE,KAAKA,EAAE,KAAK,EAC1DA,EAAE,KAAKA,EAAE,KAAK,EAAIA,EAAE,UAOlBmC,IAAc,GAAcnC,EAAE,SAAWmC,GAAenC,EAAE,OAASvB,IAKrEuB,EAAE,aAAeS,EAAcT,EAAGmC,CAAS,GAGzCnC,EAAE,cAAgBzB,EAYpB,GAPA6D,EAASjG,EAAM,UAAU6D,EAAGA,EAAE,SAAWA,EAAE,YAAaA,EAAE,aAAezB,CAAS,EAElFyB,EAAE,WAAaA,EAAE,aAKbA,EAAE,cAAgBA,EAAE,gBAAuCA,EAAE,WAAazB,EAAW,CACvFyB,EAAE,eACF,GACEA,EAAE,WAEFA,EAAE,OAAUA,EAAE,OAASA,EAAE,WAAcA,EAAE,OAAOA,EAAE,SAAWzB,EAAY,CAAC,GAAKyB,EAAE,UACjFmC,EAAYnC,EAAE,KAAKA,EAAE,SAAWA,EAAE,MAAM,EAAIA,EAAE,KAAKA,EAAE,KAAK,EAC1DA,EAAE,KAAKA,EAAE,KAAK,EAAIA,EAAE,eAKb,EAAEA,EAAE,eAAiB,GAC9BA,EAAE,UACH,MAECA,EAAE,UAAYA,EAAE,aAChBA,EAAE,aAAe,EACjBA,EAAE,MAAQA,EAAE,OAAOA,EAAE,QAAQ,EAE7BA,EAAE,OAAUA,EAAE,OAASA,EAAE,WAAcA,EAAE,OAAOA,EAAE,SAAW,CAAC,GAAKA,EAAE,eAavEoC,EAASjG,EAAM,UAAU6D,EAAG,EAAGA,EAAE,OAAOA,EAAE,QAAQ,CAAC,EAEnDA,EAAE,YACFA,EAAE,WAEJ,GAAIoC,IAEFnC,EAAiBD,EAAG,EAAK,EACrBA,EAAE,KAAK,YAAc,GACvB,OAAOd,EAMb,OADAc,EAAE,OAAWA,EAAE,SAAYzB,EAAY,EAAMyB,EAAE,SAAWzB,EAAY,EAClEwD,IAAUjF,GAEZmD,EAAiBD,EAAG,EAAI,EACpBA,EAAE,KAAK,YAAc,EAChBZ,EAGFC,GAELW,EAAE,WAEJC,EAAiBD,EAAG,EAAK,EACrBA,EAAE,KAAK,YAAc,GAChBd,EAIJC,EAQT,SAASkD,EAAarC,EAAG+B,EAAO,CAO9B,QANII,EACAC,EAEAE,IAGK,CAMP,GAAItC,EAAE,UAAYvB,EAAe,CAE/B,GADA8C,EAAYvB,CAAC,EACTA,EAAE,UAAYvB,GAAiBsD,IAAUpF,EAC3C,OAAOuC,EAET,GAAIc,EAAE,YAAc,EAAK,MA0C3B,GApCAmC,EAAY,EACRnC,EAAE,WAAazB,IAEjByB,EAAE,OAAUA,EAAE,OAASA,EAAE,WAAcA,EAAE,OAAOA,EAAE,SAAWzB,EAAY,CAAC,GAAKyB,EAAE,UACjFmC,EAAYnC,EAAE,KAAKA,EAAE,SAAWA,EAAE,MAAM,EAAIA,EAAE,KAAKA,EAAE,KAAK,EAC1DA,EAAE,KAAKA,EAAE,KAAK,EAAIA,EAAE,UAMtBA,EAAE,YAAcA,EAAE,aAClBA,EAAE,WAAaA,EAAE,YACjBA,EAAE,aAAezB,EAAY,EAEzB4D,IAAc,GAAYnC,EAAE,YAAcA,EAAE,gBAC5CA,EAAE,SAAWmC,GAAcnC,EAAE,OAASvB,IAKxCuB,EAAE,aAAeS,EAAcT,EAAGmC,CAAS,EAGvCnC,EAAE,cAAgB,IAClBA,EAAE,WAAa1C,IAAe0C,EAAE,eAAiBzB,GAAayB,EAAE,SAAWA,EAAE,YAAc,QAK7FA,EAAE,aAAezB,EAAY,IAM7ByB,EAAE,aAAezB,GAAayB,EAAE,cAAgBA,EAAE,YAAa,CACjEsC,EAAatC,EAAE,SAAWA,EAAE,UAAYzB,EAOxC6D,EAASjG,EAAM,UAAU6D,EAAGA,EAAE,SAAW,EAAIA,EAAE,WAAYA,EAAE,YAAczB,CAAS,EAMpFyB,EAAE,WAAaA,EAAE,YAAc,EAC/BA,EAAE,aAAe,EACjB,EACM,EAAEA,EAAE,UAAYsC,IAElBtC,EAAE,OAAUA,EAAE,OAASA,EAAE,WAAcA,EAAE,OAAOA,EAAE,SAAWzB,EAAY,CAAC,GAAKyB,EAAE,UACjFmC,EAAYnC,EAAE,KAAKA,EAAE,SAAWA,EAAE,MAAM,EAAIA,EAAE,KAAKA,EAAE,KAAK,EAC1DA,EAAE,KAAKA,EAAE,KAAK,EAAIA,EAAE,gBAGf,EAAEA,EAAE,cAAgB,GAK7B,GAJAA,EAAE,gBAAkB,EACpBA,EAAE,aAAezB,EAAY,EAC7ByB,EAAE,WAEEoC,IAEFnC,EAAiBD,EAAG,EAAK,EACrBA,EAAE,KAAK,YAAc,GACvB,OAAOd,CAKjB,SAAec,EAAE,iBAgBX,GATAoC,EAASjG,EAAM,UAAU6D,EAAG,EAAGA,EAAE,OAAOA,EAAE,SAAW,CAAC,CAAC,EAEnDoC,GAEFnC,EAAiBD,EAAG,EAAK,EAG3BA,EAAE,WACFA,EAAE,YACEA,EAAE,KAAK,YAAc,EACvB,OAAOd,OAMTc,EAAE,gBAAkB,EACpBA,EAAE,WACFA,EAAE,YAYN,OARIA,EAAE,kBAGJoC,EAASjG,EAAM,UAAU6D,EAAG,EAAGA,EAAE,OAAOA,EAAE,SAAW,CAAC,CAAC,EAEvDA,EAAE,gBAAkB,GAEtBA,EAAE,OAASA,EAAE,SAAWzB,EAAY,EAAIyB,EAAE,SAAWzB,EAAY,EAC7DwD,IAAUjF,GAEZmD,EAAiBD,EAAG,EAAI,EACpBA,EAAE,KAAK,YAAc,EAChBZ,EAGFC,GAELW,EAAE,WAEJC,EAAiBD,EAAG,EAAK,EACrBA,EAAE,KAAK,YAAc,GAChBd,EAKJC,EAST,SAASoD,GAAYvC,EAAG+B,EAAO,CAO7B,QANIK,EACAjB,EACAP,EAAMQ,EAENH,EAAOjB,EAAE,SAEJ,CAKP,GAAIA,EAAE,WAAaxB,EAAW,CAE5B,GADA+C,EAAYvB,CAAC,EACTA,EAAE,WAAaxB,GAAauD,IAAUpF,EACxC,OAAOuC,EAET,GAAIc,EAAE,YAAc,EAAK,MAK3B,GADAA,EAAE,aAAe,EACbA,EAAE,WAAazB,GAAayB,EAAE,SAAW,IAC3CY,EAAOZ,EAAE,SAAW,EACpBmB,EAAOF,EAAKL,CAAI,EACZO,IAASF,EAAK,EAAEL,CAAI,GAAKO,IAASF,EAAK,EAAEL,CAAI,GAAKO,IAASF,EAAK,EAAEL,CAAI,GAAG,CAC3EQ,EAASpB,EAAE,SAAWxB,EACtB,EAAG,OAEM2C,IAASF,EAAK,EAAEL,CAAI,GAAKO,IAASF,EAAK,EAAEL,CAAI,GAC7CO,IAASF,EAAK,EAAEL,CAAI,GAAKO,IAASF,EAAK,EAAEL,CAAI,GAC7CO,IAASF,EAAK,EAAEL,CAAI,GAAKO,IAASF,EAAK,EAAEL,CAAI,GAC7CO,IAASF,EAAK,EAAEL,CAAI,GAAKO,IAASF,EAAK,EAAEL,CAAI,GAC7CA,EAAOQ,GAChBpB,EAAE,aAAexB,GAAa4C,EAASR,GACnCZ,EAAE,aAAeA,EAAE,YACrBA,EAAE,aAAeA,EAAE,WAyBzB,GAlBIA,EAAE,cAAgBzB,GAIpB6D,EAASjG,EAAM,UAAU6D,EAAG,EAAGA,EAAE,aAAezB,CAAS,EAEzDyB,EAAE,WAAaA,EAAE,aACjBA,EAAE,UAAYA,EAAE,aAChBA,EAAE,aAAe,IAKjBoC,EAASjG,EAAM,UAAU6D,EAAG,EAAGA,EAAE,OAAOA,EAAE,QAAQ,CAAC,EAEnDA,EAAE,YACFA,EAAE,YAEAoC,IAEFnC,EAAiBD,EAAG,EAAK,EACrBA,EAAE,KAAK,YAAc,GACvB,OAAOd,EAMb,OADAc,EAAE,OAAS,EACP+B,IAAUjF,GAEZmD,EAAiBD,EAAG,EAAI,EACpBA,EAAE,KAAK,YAAc,EAChBZ,EAGFC,GAELW,EAAE,WAEJC,EAAiBD,EAAG,EAAK,EACrBA,EAAE,KAAK,YAAc,GAChBd,EAIJC,EAOT,SAASqD,GAAaxC,EAAG+B,EAAO,CAG9B,QAFIK,IAEK,CAEP,GAAIpC,EAAE,YAAc,IAClBuB,EAAYvB,CAAC,EACTA,EAAE,YAAc,GAAG,CACrB,GAAI+B,IAAUpF,EACZ,OAAOuC,EAET,MAWJ,GANAc,EAAE,aAAe,EAGjBoC,EAASjG,EAAM,UAAU6D,EAAG,EAAGA,EAAE,OAAOA,EAAE,QAAQ,CAAC,EACnDA,EAAE,YACFA,EAAE,WACEoC,IAEFnC,EAAiBD,EAAG,EAAK,EACrBA,EAAE,KAAK,YAAc,GACvB,OAAOd,EAMb,OADAc,EAAE,OAAS,EACP+B,IAAUjF,GAEZmD,EAAiBD,EAAG,EAAI,EACpBA,EAAE,KAAK,YAAc,EAChBZ,EAGFC,GAELW,EAAE,WAEJC,EAAiBD,EAAG,EAAK,EACrBA,EAAE,KAAK,YAAc,GAChBd,EAIJC,EAQT,SAASsD,EAAOC,EAAaC,EAAUC,EAAaC,EAAWC,EAAM,CACnE,KAAK,YAAcJ,EACnB,KAAK,SAAWC,EAChB,KAAK,YAAcC,EACnB,KAAK,UAAYC,EACjB,KAAK,KAAOC,EAGd,IAAIC,EAEJA,EAAsB,CAEpB,IAAIN,EAAO,EAAG,EAAG,EAAG,EAAGX,EAAc,EACrC,IAAIW,EAAO,EAAG,EAAG,EAAG,EAAGP,CAAY,EACnC,IAAIO,EAAO,EAAG,EAAG,GAAI,EAAGP,CAAY,EACpC,IAAIO,EAAO,EAAG,EAAG,GAAI,GAAIP,CAAY,EAErC,IAAIO,EAAO,EAAG,EAAG,GAAI,GAAIJ,CAAY,EACrC,IAAII,EAAO,EAAG,GAAI,GAAI,GAAIJ,CAAY,EACtC,IAAII,EAAO,EAAG,GAAI,IAAK,IAAKJ,CAAY,EACxC,IAAII,EAAO,EAAG,GAAI,IAAK,IAAKJ,CAAY,EACxC,IAAII,EAAO,GAAI,IAAK,IAAK,KAAMJ,CAAY,EAC3C,IAAII,EAAO,GAAI,IAAK,IAAK,KAAMJ,CAAY,CAC5C,EAMD,SAASW,GAAQhD,EAAG,CAClBA,EAAE,YAAc,EAAIA,EAAE,OAGtBJ,EAAKI,EAAE,IAAI,EAIXA,EAAE,eAAiB+C,EAAoB/C,EAAE,KAAK,EAAE,SAChDA,EAAE,WAAa+C,EAAoB/C,EAAE,KAAK,EAAE,YAC5CA,EAAE,WAAa+C,EAAoB/C,EAAE,KAAK,EAAE,YAC5CA,EAAE,iBAAmB+C,EAAoB/C,EAAE,KAAK,EAAE,UAElDA,EAAE,SAAW,EACbA,EAAE,YAAc,EAChBA,EAAE,UAAY,EACdA,EAAE,OAAS,EACXA,EAAE,aAAeA,EAAE,YAAczB,EAAY,EAC7CyB,EAAE,gBAAkB,EACpBA,EAAE,MAAQ,EAIZ,SAASiD,IAAe,CACtB,KAAK,KAAO,KACZ,KAAK,OAAS,EACd,KAAK,YAAc,KACnB,KAAK,iBAAmB,EACxB,KAAK,YAAc,EACnB,KAAK,QAAU,EACf,KAAK,KAAO,EACZ,KAAK,OAAS,KACd,KAAK,QAAU,EACf,KAAK,OAASrF,EACd,KAAK,WAAa,GAElB,KAAK,OAAS,EACd,KAAK,OAAS,EACd,KAAK,OAAS,EAEd,KAAK,OAAS,KAQd,KAAK,YAAc,EAKnB,KAAK,KAAO,KAMZ,KAAK,KAAO,KAEZ,KAAK,MAAQ,EACb,KAAK,UAAY,EACjB,KAAK,UAAY,EACjB,KAAK,UAAY,EAEjB,KAAK,WAAa,EAOlB,KAAK,YAAc,EAKnB,KAAK,aAAe,EACpB,KAAK,WAAa,EAClB,KAAK,gBAAkB,EACvB,KAAK,SAAW,EAChB,KAAK,YAAc,EACnB,KAAK,UAAY,EAEjB,KAAK,YAAc,EAKnB,KAAK,iBAAmB,EAMxB,KAAK,eAAiB,EAYtB,KAAK,MAAQ,EACb,KAAK,SAAW,EAEhB,KAAK,WAAa,EAGlB,KAAK,WAAa,EAYlB,KAAK,UAAa,IAAI3B,EAAM,MAAMoC,GAAY,CAAC,EAC/C,KAAK,UAAa,IAAIpC,EAAM,OAAO,EAAIkC,GAAU,GAAK,CAAC,EACvD,KAAK,QAAa,IAAIlC,EAAM,OAAO,EAAImC,GAAW,GAAK,CAAC,EACxDwB,EAAK,KAAK,SAAS,EACnBA,EAAK,KAAK,SAAS,EACnBA,EAAK,KAAK,OAAO,EAEjB,KAAK,OAAW,KAChB,KAAK,OAAW,KAChB,KAAK,QAAW,KAGhB,KAAK,SAAW,IAAI3D,EAAM,MAAMqC,GAAW,CAAC,EAI5C,KAAK,KAAO,IAAIrC,EAAM,MAAM,EAAIiC,EAAU,CAAC,EAC3C0B,EAAK,KAAK,IAAI,EAEd,KAAK,SAAW,EAChB,KAAK,SAAW,EAKhB,KAAK,MAAQ,IAAI3D,EAAM,MAAM,EAAIiC,EAAU,CAAC,EAC5C0B,EAAK,KAAK,KAAK,EAIf,KAAK,MAAQ,EAEb,KAAK,YAAc,EAoBnB,KAAK,SAAW,EAEhB,KAAK,MAAQ,EAMb,KAAK,QAAU,EACf,KAAK,WAAa,EAClB,KAAK,QAAU,EACf,KAAK,OAAS,EAGd,KAAK,OAAS,EAId,KAAK,SAAW,EAgBlB,SAASsD,GAAiB1D,EAAM,CAC9B,IAAIQ,EAEJ,MAAI,CAACR,GAAQ,CAACA,EAAK,MACVD,EAAIC,EAAMtC,CAAc,GAGjCsC,EAAK,SAAWA,EAAK,UAAY,EACjCA,EAAK,UAAY7B,GAEjBqC,EAAIR,EAAK,MACTQ,EAAE,QAAU,EACZA,EAAE,YAAc,EAEZA,EAAE,KAAO,IACXA,EAAE,KAAO,CAACA,EAAE,MAGdA,EAAE,OAAUA,EAAE,KAAOrB,EAAaK,EAClCQ,EAAK,MAASQ,EAAE,OAAS,EACvB,EAEA,EACFA,EAAE,WAAarD,EACfR,EAAM,SAAS6D,CAAC,EACThD,GAIT,SAASmG,GAAa3D,EAAM,CAC1B,IAAI4D,EAAMF,GAAiB1D,CAAI,EAC/B,OAAI4D,IAAQpG,GACVgG,GAAQxD,EAAK,KAAK,EAEb4D,EAIT,SAASC,GAAiB7D,EAAM8D,EAAM,CAEpC,MADI,CAAC9D,GAAQ,CAACA,EAAK,OACfA,EAAK,MAAM,OAAS,EAAYtC,GACpCsC,EAAK,MAAM,OAAS8D,EACbtG,GAIT,SAASuG,GAAa/D,EAAMgE,EAAOC,EAAQC,EAAYC,EAAUC,EAAU,CACzE,GAAI,CAACpE,EACH,OAAOtC,EAET,IAAI2G,EAAO,EAiBX,GAfIL,IAAUnG,KACZmG,EAAQ,GAGNE,EAAa,GACfG,EAAO,EACPH,EAAa,CAACA,GAGPA,EAAa,KACpBG,EAAO,EACPH,GAAc,IAIZC,EAAW,GAAKA,EAAW9F,IAAiB4F,IAAW7F,GACzD8F,EAAa,GAAKA,EAAa,IAAMF,EAAQ,GAAKA,EAAQ,GAC1DI,EAAW,GAAKA,EAAWnG,GAC3B,OAAO8B,EAAIC,EAAMtC,CAAc,EAI7BwG,IAAe,IACjBA,EAAa,GAIf,IAAI1D,EAAI,IAAIiD,GAEZ,OAAAzD,EAAK,MAAQQ,EACbA,EAAE,KAAOR,EAETQ,EAAE,KAAO6D,EACT7D,EAAE,OAAS,KACXA,EAAE,OAAS0D,EACX1D,EAAE,OAAS,GAAKA,EAAE,OAClBA,EAAE,OAASA,EAAE,OAAS,EAEtBA,EAAE,UAAY2D,EAAW,EACzB3D,EAAE,UAAY,GAAKA,EAAE,UACrBA,EAAE,UAAYA,EAAE,UAAY,EAC5BA,EAAE,WAAa,CAAC,GAAGA,EAAE,UAAYzB,EAAY,GAAKA,GAElDyB,EAAE,OAAS,IAAI/D,EAAM,KAAK+D,EAAE,OAAS,CAAC,EACtCA,EAAE,KAAO,IAAI/D,EAAM,MAAM+D,EAAE,SAAS,EACpCA,EAAE,KAAO,IAAI/D,EAAM,MAAM+D,EAAE,MAAM,EAKjCA,EAAE,YAAc,GAAM2D,EAAW,EAEjC3D,EAAE,iBAAmBA,EAAE,YAAc,EAIrCA,EAAE,YAAc,IAAI/D,EAAM,KAAK+D,EAAE,gBAAgB,EAIjDA,EAAE,MAAQ,EAAIA,EAAE,YAGhBA,EAAE,MAAS,EAASA,EAAE,YAEtBA,EAAE,MAAQwD,EACVxD,EAAE,SAAW4D,EACb5D,EAAE,OAASyD,EAEJN,GAAa3D,CAAI,EAG1B,SAASsE,GAAYtE,EAAMgE,EAAO,CAChC,OAAOD,GAAa/D,EAAMgE,EAAO5F,EAAYE,GAAWC,GAAeL,EAAkB,EAI3F,SAASqG,GAAQvE,EAAMuC,EAAO,CAC5B,IAAIiC,EAAWhE,EACXiE,EAAKC,EAET,GAAI,CAAC1E,GAAQ,CAACA,EAAK,OACjBuC,EAAQhF,GAAWgF,EAAQ,EAC3B,OAAOvC,EAAOD,EAAIC,EAAMtC,CAAc,EAAIA,EAK5C,GAFA8C,EAAIR,EAAK,MAEL,CAACA,EAAK,QACL,CAACA,EAAK,OAASA,EAAK,WAAa,GACjCQ,EAAE,SAAWf,GAAgB8C,IAAUjF,EAC1C,OAAOyC,EAAIC,EAAOA,EAAK,YAAc,EAAKpC,EAAcF,CAAc,EAQxE,GALA8C,EAAE,KAAOR,EACTwE,EAAYhE,EAAE,WACdA,EAAE,WAAa+B,EAGX/B,EAAE,SAAWrB,EAEf,GAAIqB,EAAE,OAAS,EACbR,EAAK,MAAQ,EACbW,EAASH,EAAG,EAAE,EACdG,EAASH,EAAG,GAAG,EACfG,EAASH,EAAG,CAAC,EACRA,EAAE,QAaLG,EAASH,GAAIA,EAAE,OAAO,KAAO,EAAI,IACpBA,EAAE,OAAO,KAAO,EAAI,IACnBA,EAAE,OAAO,MAAY,EAAJ,IACjBA,EAAE,OAAO,KAAW,EAAJ,IAChBA,EAAE,OAAO,QAAc,GAAJ,EAChC,EACDG,EAASH,EAAGA,EAAE,OAAO,KAAO,GAAI,EAChCG,EAASH,EAAIA,EAAE,OAAO,MAAQ,EAAK,GAAI,EACvCG,EAASH,EAAIA,EAAE,OAAO,MAAQ,GAAM,GAAI,EACxCG,EAASH,EAAIA,EAAE,OAAO,MAAQ,GAAM,GAAI,EACxCG,EAASH,EAAGA,EAAE,QAAU,EAAI,EACfA,EAAE,UAAYzC,GAAkByC,EAAE,MAAQ,EAC1C,EAAI,CAAE,EACnBG,EAASH,EAAGA,EAAE,OAAO,GAAK,GAAI,EAC1BA,EAAE,OAAO,OAASA,EAAE,OAAO,MAAM,SACnCG,EAASH,EAAGA,EAAE,OAAO,MAAM,OAAS,GAAI,EACxCG,EAASH,EAAIA,EAAE,OAAO,MAAM,QAAU,EAAK,GAAI,GAE7CA,EAAE,OAAO,OACXR,EAAK,MAAQjD,EAAMiD,EAAK,MAAOQ,EAAE,YAAaA,EAAE,QAAS,CAAC,GAE5DA,EAAE,QAAU,EACZA,EAAE,OAASpB,IAlCXuB,EAASH,EAAG,CAAC,EACbG,EAASH,EAAG,CAAC,EACbG,EAASH,EAAG,CAAC,EACbG,EAASH,EAAG,CAAC,EACbG,EAASH,EAAG,CAAC,EACbG,EAASH,EAAGA,EAAE,QAAU,EAAI,EACfA,EAAE,UAAYzC,GAAkByC,EAAE,MAAQ,EAC1C,EAAI,CAAE,EACnBG,EAASH,EAAGV,EAAO,EACnBU,EAAE,OAAShB,OA6Bf,CACE,IAAImF,EAAUvG,GAAeoC,EAAE,OAAS,GAAM,IAAO,EACjDoE,EAAc,GAEdpE,EAAE,UAAYzC,GAAkByC,EAAE,MAAQ,EAC5CoE,EAAc,EACLpE,EAAE,MAAQ,EACnBoE,EAAc,EACLpE,EAAE,QAAU,EACrBoE,EAAc,EAEdA,EAAc,EAEhBD,GAAWC,GAAe,EACtBpE,EAAE,WAAa,IAAKmE,GAAUzF,IAClCyF,GAAU,GAAMA,EAAS,GAEzBnE,EAAE,OAAShB,EACXqB,EAAYL,EAAGmE,CAAM,EAGjBnE,EAAE,WAAa,IACjBK,EAAYL,EAAGR,EAAK,QAAU,EAAE,EAChCa,EAAYL,EAAGR,EAAK,MAAQ,KAAM,GAEpCA,EAAK,MAAQ,EAKjB,GAAIQ,EAAE,SAAWpB,EACf,GAAIoB,EAAE,OAAO,MAAqB,CAGhC,IAFAiE,EAAMjE,EAAE,QAEDA,EAAE,SAAWA,EAAE,OAAO,MAAM,OAAS,QACtC,EAAAA,EAAE,UAAYA,EAAE,mBACdA,EAAE,OAAO,MAAQA,EAAE,QAAUiE,IAC/BzE,EAAK,MAAQjD,EAAMiD,EAAK,MAAOQ,EAAE,YAAaA,EAAE,QAAUiE,EAAKA,CAAG,GAEpElE,EAAcP,CAAI,EAClByE,EAAMjE,EAAE,QACJA,EAAE,UAAYA,EAAE,oBAItBG,EAASH,EAAGA,EAAE,OAAO,MAAMA,EAAE,OAAO,EAAI,GAAI,EAC5CA,EAAE,UAEAA,EAAE,OAAO,MAAQA,EAAE,QAAUiE,IAC/BzE,EAAK,MAAQjD,EAAMiD,EAAK,MAAOQ,EAAE,YAAaA,EAAE,QAAUiE,EAAKA,CAAG,GAEhEjE,EAAE,UAAYA,EAAE,OAAO,MAAM,SAC/BA,EAAE,QAAU,EACZA,EAAE,OAASnB,QAIbmB,EAAE,OAASnB,EAGf,GAAImB,EAAE,SAAWnB,EACf,GAAImB,EAAE,OAAO,KAAoB,CAC/BiE,EAAMjE,EAAE,QAGR,EAAG,CACD,GAAIA,EAAE,UAAYA,EAAE,mBACdA,EAAE,OAAO,MAAQA,EAAE,QAAUiE,IAC/BzE,EAAK,MAAQjD,EAAMiD,EAAK,MAAOQ,EAAE,YAAaA,EAAE,QAAUiE,EAAKA,CAAG,GAEpElE,EAAcP,CAAI,EAClByE,EAAMjE,EAAE,QACJA,EAAE,UAAYA,EAAE,kBAAkB,CACpCkE,EAAM,EACN,MAIAlE,EAAE,QAAUA,EAAE,OAAO,KAAK,OAC5BkE,EAAMlE,EAAE,OAAO,KAAK,WAAWA,EAAE,SAAS,EAAI,IAE9CkE,EAAM,EAER/D,EAASH,EAAGkE,CAAG,CAChB,OAAQA,IAAQ,GAEblE,EAAE,OAAO,MAAQA,EAAE,QAAUiE,IAC/BzE,EAAK,MAAQjD,EAAMiD,EAAK,MAAOQ,EAAE,YAAaA,EAAE,QAAUiE,EAAKA,CAAG,GAEhEC,IAAQ,IACVlE,EAAE,QAAU,EACZA,EAAE,OAASlB,QAIbkB,EAAE,OAASlB,EAGf,GAAIkB,EAAE,SAAWlB,EACf,GAAIkB,EAAE,OAAO,QAAuB,CAClCiE,EAAMjE,EAAE,QAGR,EAAG,CACD,GAAIA,EAAE,UAAYA,EAAE,mBACdA,EAAE,OAAO,MAAQA,EAAE,QAAUiE,IAC/BzE,EAAK,MAAQjD,EAAMiD,EAAK,MAAOQ,EAAE,YAAaA,EAAE,QAAUiE,EAAKA,CAAG,GAEpElE,EAAcP,CAAI,EAClByE,EAAMjE,EAAE,QACJA,EAAE,UAAYA,EAAE,kBAAkB,CACpCkE,EAAM,EACN,MAIAlE,EAAE,QAAUA,EAAE,OAAO,QAAQ,OAC/BkE,EAAMlE,EAAE,OAAO,QAAQ,WAAWA,EAAE,SAAS,EAAI,IAEjDkE,EAAM,EAER/D,EAASH,EAAGkE,CAAG,CAChB,OAAQA,IAAQ,GAEblE,EAAE,OAAO,MAAQA,EAAE,QAAUiE,IAC/BzE,EAAK,MAAQjD,EAAMiD,EAAK,MAAOQ,EAAE,YAAaA,EAAE,QAAUiE,EAAKA,CAAG,GAEhEC,IAAQ,IACVlE,EAAE,OAASjB,QAIbiB,EAAE,OAASjB,EAsBf,GAnBIiB,EAAE,SAAWjB,IACXiB,EAAE,OAAO,MACPA,EAAE,QAAU,EAAIA,EAAE,kBACpBD,EAAcP,CAAI,EAEhBQ,EAAE,QAAU,GAAKA,EAAE,mBACrBG,EAASH,EAAGR,EAAK,MAAQ,GAAI,EAC7BW,EAASH,EAAIR,EAAK,OAAS,EAAK,GAAI,EACpCA,EAAK,MAAQ,EACbQ,EAAE,OAAShB,IAIbgB,EAAE,OAAShB,GAMXgB,EAAE,UAAY,GAEhB,GADAD,EAAcP,CAAI,EACdA,EAAK,YAAc,EAOrB,OAAAQ,EAAE,WAAa,GACRhD,UAOAwC,EAAK,WAAa,GAAKE,EAAKqC,CAAK,GAAKrC,EAAKsE,CAAS,GAC7DjC,IAAUjF,EACV,OAAOyC,EAAIC,EAAMpC,CAAW,EAI9B,GAAI4C,EAAE,SAAWf,GAAgBO,EAAK,WAAa,EACjD,OAAOD,EAAIC,EAAMpC,CAAW,EAK9B,GAAIoC,EAAK,WAAa,GAAKQ,EAAE,YAAc,GACxC+B,IAAUpF,GAAcqD,EAAE,SAAWf,EAAe,CACrD,IAAIoF,EAAUrE,EAAE,WAAazC,EAAkBiF,GAAaxC,EAAG+B,CAAK,EACjE/B,EAAE,WAAaxC,GAAQ+E,GAAYvC,EAAG+B,CAAK,EAC1CgB,EAAoB/C,EAAE,KAAK,EAAE,KAAKA,EAAG+B,CAAK,EAK9C,IAHIsC,IAAWjF,GAAqBiF,IAAWhF,KAC7CW,EAAE,OAASf,GAEToF,IAAWnF,GAAgBmF,IAAWjF,EACxC,OAAII,EAAK,YAAc,IACrBQ,EAAE,WAAa,IAGVhD,EAST,GAAIqH,IAAWlF,IACT4C,IAAUnF,GACZT,EAAM,UAAU6D,CAAC,EAEV+B,IAAUhF,IAEjBZ,EAAM,iBAAiB6D,EAAG,EAAG,EAAG,EAAK,EAIjC+B,IAAUlF,KAEZ+C,EAAKI,EAAE,IAAI,EAEPA,EAAE,YAAc,IAClBA,EAAE,SAAW,EACbA,EAAE,YAAc,EAChBA,EAAE,OAAS,KAIjBD,EAAcP,CAAI,EACdA,EAAK,YAAc,GACrB,OAAAQ,EAAE,WAAa,GACRhD,EAOb,OAAI+E,IAAUjF,EAAmBE,EAC7BgD,EAAE,MAAQ,EAAY/C,GAGtB+C,EAAE,OAAS,GACbG,EAASH,EAAGR,EAAK,MAAQ,GAAI,EAC7BW,EAASH,EAAIR,EAAK,OAAS,EAAK,GAAI,EACpCW,EAASH,EAAIR,EAAK,OAAS,GAAM,GAAI,EACrCW,EAASH,EAAIR,EAAK,OAAS,GAAM,GAAI,EACrCW,EAASH,EAAGR,EAAK,SAAW,GAAI,EAChCW,EAASH,EAAIR,EAAK,UAAY,EAAK,GAAI,EACvCW,EAASH,EAAIR,EAAK,UAAY,GAAM,GAAI,EACxCW,EAASH,EAAIR,EAAK,UAAY,GAAM,GAAI,IAIxCa,EAAYL,EAAGR,EAAK,QAAU,EAAE,EAChCa,EAAYL,EAAGR,EAAK,MAAQ,KAAM,GAGpCO,EAAcP,CAAI,EAIdQ,EAAE,KAAO,IAAKA,EAAE,KAAO,CAACA,EAAE,MAEvBA,EAAE,UAAY,EAAIhD,EAAOC,GAGlC,SAASqH,GAAW9E,EAAM,CACxB,IAAI+E,EAEJ,MAAI,CAAC/E,GAAqB,CAACA,EAAK,MACvBtC,GAGTqH,EAAS/E,EAAK,MAAM,OAChB+E,IAAW5F,GACb4F,IAAW3F,GACX2F,IAAW1F,GACX0F,IAAWzF,GACXyF,IAAWxF,GACXwF,IAAWvF,GACXuF,IAAWtF,EAEJM,EAAIC,EAAMtC,CAAc,GAGjCsC,EAAK,MAAQ,KAEN+E,IAAWvF,EAAaO,EAAIC,EAAMrC,EAAY,EAAIH,IAQ3D,SAASwH,GAAqBhF,EAAMiF,EAAY,CAC9C,IAAIC,EAAaD,EAAW,OAExBzE,EACA6B,EAAKH,EACLmC,EACAc,EACAC,EACAC,EACAC,EASJ,GAPI,CAACtF,GAAqB,CAACA,EAAK,QAIhCQ,EAAIR,EAAK,MACTqE,EAAO7D,EAAE,KAEL6D,IAAS,GAAMA,IAAS,GAAK7D,EAAE,SAAWrB,GAAeqB,EAAE,WAC7D,OAAO9C,EAmCT,IA/BI2G,IAAS,IAEXrE,EAAK,MAAQnD,EAAQmD,EAAK,MAAOiF,EAAYC,EAAY,CAAC,GAG5D1E,EAAE,KAAO,EAGL0E,GAAc1E,EAAE,SACd6D,IAAS,IAEXjE,EAAKI,EAAE,IAAI,EACXA,EAAE,SAAW,EACbA,EAAE,YAAc,EAChBA,EAAE,OAAS,GAIb8E,EAAU,IAAI7I,EAAM,KAAK+D,EAAE,MAAM,EACjC/D,EAAM,SAAS6I,EAASL,EAAYC,EAAa1E,EAAE,OAAQA,EAAE,OAAQ,CAAC,EACtEyE,EAAaK,EACbJ,EAAa1E,EAAE,QAGjB2E,EAAQnF,EAAK,SACboF,EAAOpF,EAAK,QACZqF,EAAQrF,EAAK,MACbA,EAAK,SAAWkF,EAChBlF,EAAK,QAAU,EACfA,EAAK,MAAQiF,EACblD,EAAYvB,CAAC,EACNA,EAAE,WAAazB,GAAW,CAC/BsD,EAAM7B,EAAE,SACR0B,EAAI1B,EAAE,WAAazB,EAAY,GAC/B,GAEEyB,EAAE,OAAUA,EAAE,OAASA,EAAE,WAAcA,EAAE,OAAO6B,EAAMtD,EAAY,CAAC,GAAKyB,EAAE,UAE1EA,EAAE,KAAK6B,EAAM7B,EAAE,MAAM,EAAIA,EAAE,KAAKA,EAAE,KAAK,EAEvCA,EAAE,KAAKA,EAAE,KAAK,EAAI6B,EAClBA,UACO,EAAEH,GACX1B,EAAE,SAAW6B,EACb7B,EAAE,UAAYzB,EAAY,EAC1BgD,EAAYvB,CAAC,EAEf,OAAAA,EAAE,UAAYA,EAAE,UAChBA,EAAE,YAAcA,EAAE,SAClBA,EAAE,OAASA,EAAE,UACbA,EAAE,UAAY,EACdA,EAAE,aAAeA,EAAE,YAAczB,EAAY,EAC7CyB,EAAE,gBAAkB,EACpBR,EAAK,QAAUoF,EACfpF,EAAK,MAAQqF,EACbrF,EAAK,SAAWmF,EAChB3E,EAAE,KAAO6D,EACF7G,EAIU+H,OAAAA,EAAA,UAAA,YAAGjB,GACFiB,EAAA,UAAA,aAAGxB,GACHwB,EAAA,UAAA,aAAG5B,GACC4B,EAAA,UAAA,iBAAG7B,GACH6B,EAAA,UAAA,iBAAG1B,GACZ0B,EAAA,UAAA,QAAGhB,GACAgB,EAAA,UAAA,WAAGT,GACOS,EAAA,UAAA,qBAAGP,GACZO,EAAA,UAAA,YAAG","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/pako@1.0.11/node_modules/pako/lib/zlib/inffast.js

@@ -1,2 +0,0 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});var q,T;function A(){if(T)return q;T=1;var x=30,j=12;return q=function(t,m){var r,d,_,i,y,h,z,k,I,c,w,l,a,g,p,P,S,v,e,n,s,o,u,b,f;r=t.state,d=t.next_in,b=t.input,_=d+(t.avail_in-5),i=t.next_out,f=t.output,y=i-(m-t.avail_out),h=i+(t.avail_out-257),z=r.dmax,k=r.wsize,I=r.whave,c=r.wnext,w=r.window,l=r.hold,a=r.bits,g=r.lencode,p=r.distcode,P=(1<<r.lenbits)-1,S=(1<<r.distbits)-1;e:do{a<15&&(l+=b[d++]<<a,a+=8,l+=b[d++]<<a,a+=8),v=g[l&P];i:for(;;){if(e=v>>>24,l>>>=e,a-=e,e=v>>>16&255,e===0)f[i++]=v&65535;else if(e&16){n=v&65535,e&=15,e&&(a<e&&(l+=b[d++]<<a,a+=8),n+=l&(1<<e)-1,l>>>=e,a-=e),a<15&&(l+=b[d++]<<a,a+=8,l+=b[d++]<<a,a+=8),v=p[l&S];a:for(;;){if(e=v>>>24,l>>>=e,a-=e,e=v>>>16&255,e&16){if(s=v&65535,e&=15,a<e&&(l+=b[d++]<<a,a+=8,a<e&&(l+=b[d++]<<a,a+=8)),s+=l&(1<<e)-1,s>z){t.msg="invalid distance too far back",r.mode=x;break e}if(l>>>=e,a-=e,e=i-y,s>e){if(e=s-e,e>I&&r.sane){t.msg="invalid distance too far back",r.mode=x;break e}if(o=0,u=w,c===0){if(o+=k-e,e<n){n-=e;do f[i++]=w[o++];while(--e);o=i-s,u=f}}else if(c<e){if(o+=k+c-e,e-=c,e<n){n-=e;do f[i++]=w[o++];while(--e);if(o=0,c<n){e=c,n-=e;do f[i++]=w[o++];while(--e);o=i-s,u=f}}}else if(o+=c-e,e<n){n-=e;do f[i++]=w[o++];while(--e);o=i-s,u=f}for(;n>2;)f[i++]=u[o++],f[i++]=u[o++],f[i++]=u[o++],n-=3;n&&(f[i++]=u[o++],n>1&&(f[i++]=u[o++]))}else{o=i-s;do f[i++]=f[o++],f[i++]=f[o++],f[i++]=f[o++],n-=3;while(n>2);n&&(f[i++]=f[o++],n>1&&(f[i++]=f[o++]))}}else if(e&64){t.msg="invalid distance code",r.mode=x;break e}else{v=p[(v&65535)+(l&(1<<e)-1)];continue a}break}}else if(e&64)if(e&32){r.mode=j;break e}else{t.msg="invalid literal/length code",r.mode=x;break e}else{v=g[(v&65535)+(l&(1<<e)-1)];continue i}break}}while(d<_&&i<h);n=a>>3,d-=n,a-=n<<3,l&=(1<<a)-1,t.next_in=d,t.next_out=i,t.avail_in=d<_?5+(_-d):5-(d-_),t.avail_out=i<h?257+(h-i):257-(i-h),r.hold=l,r.bits=a},q}exports.__require=A;
-//# sourceMappingURL=inffast.js.map

package/dist/node_modules/.pnpm/pako@1.0.11/node_modules/pako/lib/zlib/inffast.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"inffast.js","sources":["../../../../../../../../node_modules/.pnpm/pako@1.0.11/node_modules/pako/lib/zlib/inffast.js"],"sourcesContent":["'use strict';\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n//   claim that you wrote the original software. If you use this software\n//   in a product, an acknowledgment in the product documentation would be\n//   appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n//   misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\n// See state defs from inflate.js\nvar BAD = 30;       /* got a data error -- remain here until reset */\nvar TYPE = 12;      /* i: waiting for type bits, including last-flag bit */\n\n/*\n   Decode literal, length, and distance codes and write out the resulting\n   literal and match bytes until either not enough input or output is\n   available, an end-of-block is encountered, or a data error is encountered.\n   When large enough input and output buffers are supplied to inflate(), for\n   example, a 16K input buffer and a 64K output buffer, more than 95% of the\n   inflate execution time is spent in this routine.\n\n   Entry assumptions:\n\n        state.mode === LEN\n        strm.avail_in >= 6\n        strm.avail_out >= 258\n        start >= strm.avail_out\n        state.bits < 8\n\n   On return, state.mode is one of:\n\n        LEN -- ran out of enough output space or enough available input\n        TYPE -- reached end of block code, inflate() to interpret next block\n        BAD -- error in block data\n\n   Notes:\n\n    - The maximum input bits used by a length/distance pair is 15 bits for the\n      length code, 5 bits for the length extra, 15 bits for the distance code,\n      and 13 bits for the distance extra.  This totals 48 bits, or six bytes.\n      Therefore if strm.avail_in >= 6, then there is enough input to avoid\n      checking for available input while decoding.\n\n    - The maximum bytes that a single length/distance pair can output is 258\n      bytes, which is the maximum length that can be coded.  inflate_fast()\n      requires strm.avail_out >= 258 for each loop to avoid checking for\n      output space.\n */\nmodule.exports = function inflate_fast(strm, start) {\n  var state;\n  var _in;                    /* local strm.input */\n  var last;                   /* have enough input while in < last */\n  var _out;                   /* local strm.output */\n  var beg;                    /* inflate()'s initial strm.output */\n  var end;                    /* while out < end, enough space available */\n//#ifdef INFLATE_STRICT\n  var dmax;                   /* maximum distance from zlib header */\n//#endif\n  var wsize;                  /* window size or zero if not using window */\n  var whave;                  /* valid bytes in the window */\n  var wnext;                  /* window write index */\n  // Use `s_window` instead `window`, avoid conflict with instrumentation tools\n  var s_window;               /* allocated sliding window, if wsize != 0 */\n  var hold;                   /* local strm.hold */\n  var bits;                   /* local strm.bits */\n  var lcode;                  /* local strm.lencode */\n  var dcode;                  /* local strm.distcode */\n  var lmask;                  /* mask for first level of length codes */\n  var dmask;                  /* mask for first level of distance codes */\n  var here;                   /* retrieved table entry */\n  var op;                     /* code bits, operation, extra bits, or */\n                              /*  window position, window bytes to copy */\n  var len;                    /* match length, unused bytes */\n  var dist;                   /* match distance */\n  var from;                   /* where to copy match from */\n  var from_source;\n\n\n  var input, output; // JS specific, because we have no pointers\n\n  /* copy state to local variables */\n  state = strm.state;\n  //here = state.here;\n  _in = strm.next_in;\n  input = strm.input;\n  last = _in + (strm.avail_in - 5);\n  _out = strm.next_out;\n  output = strm.output;\n  beg = _out - (start - strm.avail_out);\n  end = _out + (strm.avail_out - 257);\n//#ifdef INFLATE_STRICT\n  dmax = state.dmax;\n//#endif\n  wsize = state.wsize;\n  whave = state.whave;\n  wnext = state.wnext;\n  s_window = state.window;\n  hold = state.hold;\n  bits = state.bits;\n  lcode = state.lencode;\n  dcode = state.distcode;\n  lmask = (1 << state.lenbits) - 1;\n  dmask = (1 << state.distbits) - 1;\n\n\n  /* decode literals and length/distances until end-of-block or not enough\n     input data or output space */\n\n  top:\n  do {\n    if (bits < 15) {\n      hold += input[_in++] << bits;\n      bits += 8;\n      hold += input[_in++] << bits;\n      bits += 8;\n    }\n\n    here = lcode[hold & lmask];\n\n    dolen:\n    for (;;) { // Goto emulation\n      op = here >>> 24/*here.bits*/;\n      hold >>>= op;\n      bits -= op;\n      op = (here >>> 16) & 0xff/*here.op*/;\n      if (op === 0) {                          /* literal */\n        //Tracevv((stderr, here.val >= 0x20 && here.val < 0x7f ?\n        //        \"inflate:         literal '%c'\\n\" :\n        //        \"inflate:         literal 0x%02x\\n\", here.val));\n        output[_out++] = here & 0xffff/*here.val*/;\n      }\n      else if (op & 16) {                     /* length base */\n        len = here & 0xffff/*here.val*/;\n        op &= 15;                           /* number of extra bits */\n        if (op) {\n          if (bits < op) {\n            hold += input[_in++] << bits;\n            bits += 8;\n          }\n          len += hold & ((1 << op) - 1);\n          hold >>>= op;\n          bits -= op;\n        }\n        //Tracevv((stderr, \"inflate:         length %u\\n\", len));\n        if (bits < 15) {\n          hold += input[_in++] << bits;\n          bits += 8;\n          hold += input[_in++] << bits;\n          bits += 8;\n        }\n        here = dcode[hold & dmask];\n\n        dodist:\n        for (;;) { // goto emulation\n          op = here >>> 24/*here.bits*/;\n          hold >>>= op;\n          bits -= op;\n          op = (here >>> 16) & 0xff/*here.op*/;\n\n          if (op & 16) {                      /* distance base */\n            dist = here & 0xffff/*here.val*/;\n            op &= 15;                       /* number of extra bits */\n            if (bits < op) {\n              hold += input[_in++] << bits;\n              bits += 8;\n              if (bits < op) {\n                hold += input[_in++] << bits;\n                bits += 8;\n              }\n            }\n            dist += hold & ((1 << op) - 1);\n//#ifdef INFLATE_STRICT\n            if (dist > dmax) {\n              strm.msg = 'invalid distance too far back';\n              state.mode = BAD;\n              break top;\n            }\n//#endif\n            hold >>>= op;\n            bits -= op;\n            //Tracevv((stderr, \"inflate:         distance %u\\n\", dist));\n            op = _out - beg;                /* max distance in output */\n            if (dist > op) {                /* see if copy from window */\n              op = dist - op;               /* distance back in window */\n              if (op > whave) {\n                if (state.sane) {\n                  strm.msg = 'invalid distance too far back';\n                  state.mode = BAD;\n                  break top;\n                }\n\n// (!) This block is disabled in zlib defaults,\n// don't enable it for binary compatibility\n//#ifdef INFLATE_ALLOW_INVALID_DISTANCE_TOOFAR_ARRR\n//                if (len <= op - whave) {\n//                  do {\n//                    output[_out++] = 0;\n//                  } while (--len);\n//                  continue top;\n//                }\n//                len -= op - whave;\n//                do {\n//                  output[_out++] = 0;\n//                } while (--op > whave);\n//                if (op === 0) {\n//                  from = _out - dist;\n//                  do {\n//                    output[_out++] = output[from++];\n//                  } while (--len);\n//                  continue top;\n//                }\n//#endif\n              }\n              from = 0; // window index\n              from_source = s_window;\n              if (wnext === 0) {           /* very common case */\n                from += wsize - op;\n                if (op < len) {         /* some from window */\n                  len -= op;\n                  do {\n                    output[_out++] = s_window[from++];\n                  } while (--op);\n                  from = _out - dist;  /* rest from output */\n                  from_source = output;\n                }\n              }\n              else if (wnext < op) {      /* wrap around window */\n                from += wsize + wnext - op;\n                op -= wnext;\n                if (op < len) {         /* some from end of window */\n                  len -= op;\n                  do {\n                    output[_out++] = s_window[from++];\n                  } while (--op);\n                  from = 0;\n                  if (wnext < len) {  /* some from start of window */\n                    op = wnext;\n                    len -= op;\n                    do {\n                      output[_out++] = s_window[from++];\n                    } while (--op);\n                    from = _out - dist;      /* rest from output */\n                    from_source = output;\n                  }\n                }\n              }\n              else {                      /* contiguous in window */\n                from += wnext - op;\n                if (op < len) {         /* some from window */\n                  len -= op;\n                  do {\n                    output[_out++] = s_window[from++];\n                  } while (--op);\n                  from = _out - dist;  /* rest from output */\n                  from_source = output;\n                }\n              }\n              while (len > 2) {\n                output[_out++] = from_source[from++];\n                output[_out++] = from_source[from++];\n                output[_out++] = from_source[from++];\n                len -= 3;\n              }\n              if (len) {\n                output[_out++] = from_source[from++];\n                if (len > 1) {\n                  output[_out++] = from_source[from++];\n                }\n              }\n            }\n            else {\n              from = _out - dist;          /* copy direct from output */\n              do {                        /* minimum length is three */\n                output[_out++] = output[from++];\n                output[_out++] = output[from++];\n                output[_out++] = output[from++];\n                len -= 3;\n              } while (len > 2);\n              if (len) {\n                output[_out++] = output[from++];\n                if (len > 1) {\n                  output[_out++] = output[from++];\n                }\n              }\n            }\n          }\n          else if ((op & 64) === 0) {          /* 2nd level distance code */\n            here = dcode[(here & 0xffff)/*here.val*/ + (hold & ((1 << op) - 1))];\n            continue dodist;\n          }\n          else {\n            strm.msg = 'invalid distance code';\n            state.mode = BAD;\n            break top;\n          }\n\n          break; // need to emulate goto via \"continue\"\n        }\n      }\n      else if ((op & 64) === 0) {              /* 2nd level length code */\n        here = lcode[(here & 0xffff)/*here.val*/ + (hold & ((1 << op) - 1))];\n        continue dolen;\n      }\n      else if (op & 32) {                     /* end-of-block */\n        //Tracevv((stderr, \"inflate:         end of block\\n\"));\n        state.mode = TYPE;\n        break top;\n      }\n      else {\n        strm.msg = 'invalid literal/length code';\n        state.mode = BAD;\n        break top;\n      }\n\n      break; // need to emulate goto via \"continue\"\n    }\n  } while (_in < last && _out < end);\n\n  /* return unused bytes (on entry, bits < 8, so in won't go too far back) */\n  len = bits >> 3;\n  _in -= len;\n  bits -= len << 3;\n  hold &= (1 << bits) - 1;\n\n  /* update state and return */\n  strm.next_in = _in;\n  strm.next_out = _out;\n  strm.avail_in = (_in < last ? 5 + (last - _in) : 5 - (_in - last));\n  strm.avail_out = (_out < end ? 257 + (end - _out) : 257 - (_out - end));\n  state.hold = hold;\n  state.bits = bits;\n  return;\n};\n"],"names":["BAD","TYPE","inffast","strm","start","state","_in","last","_out","beg","end","dmax","wsize","whave","wnext","s_window","hold","bits","lcode","dcode","lmask","dmask","here","op","len","dist","from","from_source","input","output","top","dolen","dodist"],"mappings":"uHAsBA,IAAIA,EAAM,GACNC,EAAO,GAqCX,OAAAC,EAAiB,SAAsBC,EAAMC,EAAO,CAClD,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EAEAC,EAEAC,EACAC,EACAC,EAEAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAEAC,EACAC,EACAC,EACAC,EAGAC,EAAOC,EAGXxB,EAAQF,EAAK,MAEbG,EAAMH,EAAK,QACXyB,EAAQzB,EAAK,MACbI,EAAOD,GAAOH,EAAK,SAAW,GAC9BK,EAAOL,EAAK,SACZ0B,EAAS1B,EAAK,OACdM,EAAMD,GAAQJ,EAAQD,EAAK,WAC3BO,EAAMF,GAAQL,EAAK,UAAY,KAE/BQ,EAAON,EAAM,KAEbO,EAAQP,EAAM,MACdQ,EAAQR,EAAM,MACdS,EAAQT,EAAM,MACdU,EAAWV,EAAM,OACjBW,EAAOX,EAAM,KACbY,EAAOZ,EAAM,KACba,EAAQb,EAAM,QACdc,EAAQd,EAAM,SACde,GAAS,GAAKf,EAAM,SAAW,EAC/BgB,GAAS,GAAKhB,EAAM,UAAY,EAMhCyB,EACA,EAAG,CACGb,EAAO,KACTD,GAAQY,EAAMtB,GAAK,GAAKW,EACxBA,GAAQ,EACRD,GAAQY,EAAMtB,GAAK,GAAKW,EACxBA,GAAQ,GAGVK,EAAOJ,EAAMF,EAAOI,CAAK,EAEzBW,EACA,OAAS,CAKP,GAJAR,EAAKD,IAAS,GACdN,KAAUO,EACVN,GAAQM,EACRA,EAAMD,IAAS,GAAM,IACjBC,IAAO,EAITM,EAAOrB,GAAM,EAAIc,EAAO,cAEjBC,EAAK,GAAI,CAChBC,EAAMF,EAAO,MACbC,GAAM,GACFA,IACEN,EAAOM,IACTP,GAAQY,EAAMtB,GAAK,GAAKW,EACxBA,GAAQ,GAEVO,GAAOR,GAAS,GAAKO,GAAM,EAC3BP,KAAUO,EACVN,GAAQM,GAGNN,EAAO,KACTD,GAAQY,EAAMtB,GAAK,GAAKW,EACxBA,GAAQ,EACRD,GAAQY,EAAMtB,GAAK,GAAKW,EACxBA,GAAQ,GAEVK,EAAOH,EAAMH,EAAOK,CAAK,EAEzBW,EACA,OAAS,CAMP,GALAT,EAAKD,IAAS,GACdN,KAAUO,EACVN,GAAQM,EACRA,EAAMD,IAAS,GAAM,IAEjBC,EAAK,GAAI,CAaX,GAZAE,EAAOH,EAAO,MACdC,GAAM,GACFN,EAAOM,IACTP,GAAQY,EAAMtB,GAAK,GAAKW,EACxBA,GAAQ,EACJA,EAAOM,IACTP,GAAQY,EAAMtB,GAAK,GAAKW,EACxBA,GAAQ,IAGZQ,GAAQT,GAAS,GAAKO,GAAM,EAExBE,EAAOd,EAAM,CACfR,EAAK,IAAM,gCACXE,EAAM,KAAOL,EACb,MAAM8B,EAOR,GAJAd,KAAUO,EACVN,GAAQM,EAERA,EAAKf,EAAOC,EACRgB,EAAOF,EAAI,CAEb,GADAA,EAAKE,EAAOF,EACRA,EAAKV,GACHR,EAAM,KAAM,CACdF,EAAK,IAAM,gCACXE,EAAM,KAAOL,EACb,MAAM8B,EA2BV,GAFAJ,EAAO,EACPC,EAAcZ,EACVD,IAAU,GAEZ,GADAY,GAAQd,EAAQW,EACZA,EAAKC,EAAK,CACZA,GAAOD,EACP,GACEM,EAAOrB,GAAM,EAAIO,EAASW,GAAM,QACzB,EAAEH,GACXG,EAAOlB,EAAOiB,EACdE,EAAcE,WAGTf,EAAQS,GAGf,GAFAG,GAAQd,EAAQE,EAAQS,EACxBA,GAAMT,EACFS,EAAKC,EAAK,CACZA,GAAOD,EACP,GACEM,EAAOrB,GAAM,EAAIO,EAASW,GAAM,QACzB,EAAEH,GAEX,GADAG,EAAO,EACHZ,EAAQU,EAAK,CACfD,EAAKT,EACLU,GAAOD,EACP,GACEM,EAAOrB,GAAM,EAAIO,EAASW,GAAM,QACzB,EAAEH,GACXG,EAAOlB,EAAOiB,EACdE,EAAcE,YAKlBH,GAAQZ,EAAQS,EACZA,EAAKC,EAAK,CACZA,GAAOD,EACP,GACEM,EAAOrB,GAAM,EAAIO,EAASW,GAAM,QACzB,EAAEH,GACXG,EAAOlB,EAAOiB,EACdE,EAAcE,EAGlB,KAAOL,EAAM,GACXK,EAAOrB,GAAM,EAAImB,EAAYD,GAAM,EACnCG,EAAOrB,GAAM,EAAImB,EAAYD,GAAM,EACnCG,EAAOrB,GAAM,EAAImB,EAAYD,GAAM,EACnCF,GAAO,EAELA,IACFK,EAAOrB,GAAM,EAAImB,EAAYD,GAAM,EAC/BF,EAAM,IACRK,EAAOrB,GAAM,EAAImB,EAAYD,GAAM,QAIpC,CACHA,EAAOlB,EAAOiB,EACd,GACEI,EAAOrB,GAAM,EAAIqB,EAAOH,GAAM,EAC9BG,EAAOrB,GAAM,EAAIqB,EAAOH,GAAM,EAC9BG,EAAOrB,GAAM,EAAIqB,EAAOH,GAAM,EAC9BF,GAAO,QACAA,EAAM,GACXA,IACFK,EAAOrB,GAAM,EAAIqB,EAAOH,GAAM,EAC1BF,EAAM,IACRK,EAAOrB,GAAM,EAAIqB,EAAOH,GAAM,aAK5BH,EAAK,GAIV,CACHpB,EAAK,IAAM,wBACXE,EAAM,KAAOL,EACb,MAAM8B,MAPkB,CACxBR,EAAOH,GAAOG,EAAO,QAAuBN,GAAS,GAAKO,GAAM,EAAG,EACnE,SAASS,EAQX,eAGMT,EAAK,GAIV,GAAIA,EAAK,GAAI,CAEhBlB,EAAM,KAAOJ,EACb,MAAM6B,MAEH,CACH3B,EAAK,IAAM,8BACXE,EAAM,KAAOL,EACb,MAAM8B,MAZkB,CACxBR,EAAOJ,GAAOI,EAAO,QAAuBN,GAAS,GAAKO,GAAM,EAAG,EACnE,SAASQ,EAaX,aAEKzB,EAAMC,GAAQC,EAAOE,GAG9Bc,EAAMP,GAAQ,EACdX,GAAOkB,EACPP,GAAQO,GAAO,EACfR,IAAS,GAAKC,GAAQ,EAGtBd,EAAK,QAAUG,EACfH,EAAK,SAAWK,EAChBL,EAAK,SAAYG,EAAMC,EAAO,GAAKA,EAAOD,GAAO,GAAKA,EAAMC,GAC5DJ,EAAK,UAAaK,EAAOE,EAAM,KAAOA,EAAMF,GAAQ,KAAOA,EAAOE,GAClEL,EAAM,KAAOW,EACbX,EAAM,KAAOY,CAEd","x_google_ignoreList":[0]}