mayu-live 0.0.2 → 0.0.3

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: 9add14e6de091f001addcef847fe528f6074ead0ec207cd36959d0251f5fa453
-  data.tar.gz: 60af6a07203791d14bced62ce0d212c2f2dbb313663595810df448221bf0ab93
+  metadata.gz: 913188c20ab0304da5f9bf5c9dd0f82e3fbfc26a1f4b9207dc19e7e87fb01932
+  data.tar.gz: beef66574a2f14c57a4b5a8f14d76818a3a41e8ffa6bf6fa7cf2d064cd834dbc
 SHA512:
-  metadata.gz: 837dbdb254beb7de53ff050231355ff3139ff3c736a202b5b1a5407ea766ae7f1d514100df76e4b5815c2780cea2cda675c7d4f1272c0657f95584c1d9a493c8
-  data.tar.gz: '002926db6f93a1fa8629cac2c7e7fabcb7638ad2cb107fea7acea807cdf057939fe12a670849674eb65a3b7074ef9d750fd9eec1316dab2568c871589e67d426'
+  metadata.gz: e0d5bd062fcf1ed0058c49c3da133a4859ceb6a0c6711b5429b737b0dfa496d3ccbad3390e406eae1721744f2df48cb6194cfecbc0dacab7f1ee2c91c8c643cf
+  data.tar.gz: 8529908ec520dd9c2e27b8f0216a5025c94b01d224656f1b049ccceaf92a7b916122a3442ed54283bc619825242668a8176d8d6488c7669c74bd4002677d744d

data/README.md

@@ -38,7 +38,7 @@ having to configure anything!
 - Hot-reloading in dev
 - Automatic asset handling
 - Built-in metrics
-- File-system routing inspired by [Next.js](https://nextjs.org/docs/routing/introduction)
+- File-system based routing inspired by [Next.js](https://nextjs.org/docs/routing/introduction)
 - Designed for edge deployments
 - Powerful and compact templating using [Haml](https://haml.info/)
 - One component per file
@@ -279,7 +279,7 @@ you can create a `.css`-file right next to your component.
 
 This does the same thing as the previous example:
 
-#### `app/components/Example.haml`
+#### `app/components/Example.css`
 
 ```css
 .box {

data/lib/mayu/client/dist/DecompressionStreamPolyfill-0710fe09.js

@@ -0,0 +1 @@
+var r={},t=Uint8Array,e=Uint16Array,n=Int32Array,a=new t([0,0,0,0,0,0,0,0,1,1,1,1,2,2,2,2,3,3,3,3,4,4,4,4,5,5,5,5,0,0,0,0]),i=new t([0,0,0,0,1,1,2,2,3,3,4,4,5,5,6,6,7,7,8,8,9,9,10,10,11,11,12,12,13,13,0,0]),o=new t([16,17,18,0,8,7,9,6,10,5,11,4,12,3,13,2,14,1,15]),f=function(r,t){for(var a=new e(31),i=0;i<31;++i)a[i]=t+=1<<r[i-1];var o=new n(a[30]);for(i=1;i<30;++i)for(var f=a[i];f<a[i+1];++f)o[f]=f-a[i]<<5|i;return{b:a,r:o}},s=f(a,2),u=s.b,c=s.r;u[28]=258,c[258]=28;for(var l=f(i,0).b,h=new e(32768),v=0;v<32768;++v){var d=(43690&v)>>1|(21845&v)<<1;d=(61680&(d=(52428&d)>>2|(13107&d)<<2))>>4|(3855&d)<<4,h[v]=((65280&d)>>8|(255&d)<<8)>>1}var p=function(r,t,n){for(var a=r.length,i=0,o=new e(t);i<a;++i)r[i]&&++o[r[i]-1];var f,s=new e(t);for(i=1;i<t;++i)s[i]=s[i-1]+o[i-1]<<1;if(n){f=new e(1<<t);var u=15-t;for(i=0;i<a;++i)if(r[i])for(var c=i<<4|r[i],l=t-r[i],v=s[r[i]-1]++<<l,d=v|(1<<l)-1;v<=d;++v)f[h[v]>>u]=c}else for(f=new e(a),i=0;i<a;++i)r[i]&&(f[i]=h[s[r[i]-1]++]>>15-r[i]);return f},g=new t(288);for(v=0;v<144;++v)g[v]=8;for(v=144;v<256;++v)g[v]=9;for(v=256;v<280;++v)g[v]=7;for(v=280;v<288;++v)g[v]=8;var w=new t(32);for(v=0;v<32;++v)w[v]=5;var y=p(g,9,1),b=p(w,5,1),m=function(r){for(var t=r[0],e=1;e<r.length;++e)r[e]>t&&(t=r[e]);return t},k=function(r,t,e){var n=t/8|0;return(r[n]|r[n+1]<<8)>>(7&t)&e},x=function(r,t){var e=t/8|0;return(r[e]|r[e+1]<<8|r[e+2]<<16)>>(7&t)},M=function(r){return(r+7)/8|0},S=function(r,e,n){(null==e||e<0)&&(e=0),(null==n||n>r.length)&&(n=r.length);var a=new t(n-e);return a.set(r.subarray(e,n)),a},E=["unexpected EOF","invalid block type","invalid length/literal","invalid distance","stream finished","no stream handler",,"no callback","invalid UTF-8 data","extra field too long","date not in range 1980-2099","filename too long","stream finishing","invalid zip data"],O=function(r,t,e){var n=new Error(t||E[r]);if(n.code=r,Error.captureStackTrace&&Error.captureStackTrace(n,O),!e)throw n;return n},A=function(r,e,n,f){var s=r.length,c=f?f.length:0;if(!s||e.f&&!e.l)return n||new t(0);var h=!n||2!=e.i,v=e.i;n||(n=new t(3*s));var d=function(r){var e=n.length;if(r>e){var a=new t(Math.max(2*e,r));a.set(n),n=a}},g=e.f||0,w=e.p||0,E=e.b||0,A=e.l,T=e.d,U=e.m,$=e.n,z=8*s;do{if(!A){g=k(r,w,1);var D=k(r,w+1,3);if(w+=3,!D){var L=r[(H=M(w)+4)-4]|r[H-3]<<8,j=H+L;if(j>s){v&&O(0);break}h&&d(E+L),n.set(r.subarray(H,j),E),e.b=E+=L,e.p=w=8*j,e.f=g;continue}if(1==D)A=y,T=b,U=9,$=5;else if(2==D){var F=k(r,w,31)+257,I=k(r,w+10,15)+4,R=F+k(r,w+5,31)+1;w+=14;for(var q=new t(R),B=new t(19),P=0;P<I;++P)B[o[P]]=k(r,w+3*P,7);w+=3*I;var W=m(B),C=(1<<W)-1,G=p(B,W,1);for(P=0;P<R;){var H,J=G[k(r,w,C)];if(w+=15&J,(H=J>>4)<16)q[P++]=H;else{var K=0,N=0;for(16==H?(N=3+k(r,w,3),w+=2,K=q[P-1]):17==H?(N=3+k(r,w,7),w+=3):18==H&&(N=11+k(r,w,127),w+=7);N--;)q[P++]=K}}var Q=q.subarray(0,F),V=q.subarray(F);U=m(Q),$=m(V),A=p(Q,U,1),T=p(V,$,1)}else O(1);if(w>z){v&&O(0);break}}h&&d(E+131072);for(var X=(1<<U)-1,Y=(1<<$)-1,Z=w;;Z=w){var _=(K=A[x(r,w)&X])>>4;if((w+=15&K)>z){v&&O(0);break}if(K||O(2),_<256)n[E++]=_;else{if(256==_){Z=w,A=null;break}var rr=_-254;if(_>264){var tr=a[P=_-257];rr=k(r,w,(1<<tr)-1)+u[P],w+=tr}var er=T[x(r,w)&Y],nr=er>>4;er||O(3),w+=15&er;V=l[nr];if(nr>3){tr=i[nr];V+=x(r,w)&(1<<tr)-1,w+=tr}if(w>z){v&&O(0);break}h&&d(E+131072);var ar=E+rr;if(E<V){var ir=c-V,or=Math.min(V,ar);for(ir+E<0&&O(3);E<or;++E)n[E]=f[ir+E]}for(;E<ar;E+=4)n[E]=n[E-V],n[E+1]=n[E+1-V],n[E+2]=n[E+2-V],n[E+3]=n[E+3-V];E=ar}}e.l=A,e.p=Z,e.b=E,e.f=g,A&&(g=1,e.m=U,e.d=T,e.n=$)}while(!g);return E==n.length?n:S(n,0,E)},T=new t(0),U=function(r,t,e){for(var n=r(),a=r.toString(),i=a.slice(a.indexOf("[")+1,a.lastIndexOf("]")).replace(/\s+/g,"").split(","),o=0;o<n.length;++o){var f=n[o],s=i[o];if("function"==typeof f){t+=";"+s+"=";var u=f.toString();if(f.prototype)if(-1!=u.indexOf("[native code]")){var c=u.indexOf(" ",8)+1;t+=u.slice(c,u.indexOf("(",c))}else for(var l in t+=u,f.prototype)t+=";"+s+".prototype."+l+"="+f.prototype[l].toString();else t+=u}else e[s]=f}return t},$=[],z=function(t,e,n,a){if(!$[n]){for(var i="",o={},f=t.length-1,s=0;s<f;++s)i=U(t[s],i,o);$[n]={c:U(t[f],i,o),e:o}}var u=function(r,t){var e={};for(var n in r)e[n]=r[n];for(var n in t)e[n]=t[n];return e}({},$[n].e);return function(t,e,n,a,i){var o=new Worker(r[e]||(r[e]=URL.createObjectURL(new Blob([t+';addEventListener("error",function(e){e=e.error;postMessage({$e$:[e.message,e.code,e.stack]})})'],{type:"text/javascript"}))));return o.onmessage=function(r){var t=r.data,e=t.$e$;if(e){var n=new Error(e[0]);n.code=e[1],n.stack=e[2],i(n,null)}else i(null,t)},o.postMessage(n,a),o}($[n].c+";onmessage=function(e){for(var k in e.data)self[k]=e.data[k];onmessage="+e.toString()+"}",n,u,function(r){var t=[];for(var e in r)r[e].buffer&&t.push((r[e]=new r[e].constructor(r[e])).buffer);return t}(u),a)},D=function(){return[t,e,n,a,i,o,u,l,y,b,h,E,p,m,k,x,M,S,O,A,B,L,j]},L=function(r){return postMessage(r,[r.buffer])},j=function(r){return r&&{out:r.size&&new t(r.size),dictionary:r.dictionary}},F=function(r){return r.ondata=function(r,t){return postMessage([r,t],[r.buffer])},function(t){return r.push(t.data[0],t.data[1])}};function I(r,t){return"function"==typeof r&&(t=r,r={}),this.ondata=t,r}var R=function(){function r(r,e){"function"==typeof r&&(e=r,r={}),this.ondata=e;var n=r&&r.dictionary&&r.dictionary.subarray(-32768);this.s={i:0,b:n?n.length:0},this.o=new t(32768),this.p=new t(0),n&&this.o.set(n)}return r.prototype.e=function(r){if(this.ondata||O(5),this.d&&O(4),this.p.length){if(r.length){var e=new t(this.p.length+r.length);e.set(this.p),e.set(r,this.p.length),this.p=e}}else this.p=r},r.prototype.c=function(r){this.s.i=+(this.d=r||!1);var t=this.s.b,e=A(this.p,this.s,this.o);this.ondata(S(e,t,this.s.b),this.d),this.o=S(e,this.s.b-32768),this.s.b=this.o.length,this.p=S(this.p,this.s.p/8|0),this.s.p&=7},r.prototype.push=function(r,t){this.e(r),this.c(t)},r}(),q=function(){return function(r,t){!function(r,t,e,n,a,i){var o,f=z(r,n,a,(function(r,e){r?(f.terminate(),t.ondata.call(t,r)):Array.isArray(e)?(e[1]&&f.terminate(),t.ondata.call(t,r,e[0],e[1])):i(e)}));f.postMessage(e),t.push=function(r,e){t.ondata||O(5),o&&t.ondata(O(4,0,1),null,!!e),f.postMessage([r,o=e],[r.buffer])},t.terminate=function(){f.terminate()}}([D,function(){return[F,R]}],this,I.call(this,r,t),(function(r){var t=new R(r.data);onmessage=F(t)}),7)}}();function B(r,t){return A(r,{i:2},t&&t.out,t&&t.dictionary)}var P="undefined"!=typeof TextDecoder&&new TextDecoder;try{P.decode(T,{stream:!0}),1}catch(r){}class W extends TransformStream{constructor(r){let t;super({start(r){t=new q,t.ondata=(t,e,n)=>{t?r.error(t):n?r.terminate():r.enqueue(e)}},transform(r,e){try{t.push(r,!1)}catch(r){e.error(new Error(`DecompressionStreamPolyfill inflation failure: ${r}`))}},flush(){t.push(new Uint8Array,!0)}})}}export{W as default};//# sourceMappingURL=DecompressionStreamPolyfill-0710fe09.js.map

data/lib/mayu/client/dist/DecompressionStreamPolyfill-0710fe09.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"DecompressionStreamPolyfill-0710fe09.js","sources":["../../../../node_modules/fflate/esm/browser.js","../src/DecompressionStreamPolyfill.ts"],"sourcesContent":["// DEFLATE is a complex format; to read this code, you should probably check the RFC first:\n// https://tools.ietf.org/html/rfc1951\n// You may also wish to take a look at the guide I made about this program:\n// https://gist.github.com/101arrowz/253f31eb5abc3d9275ab943003ffecad\n// Some of the following code is similar to that of UZIP.js:\n// https://github.com/photopea/UZIP.js\n// However, the vast majority of the codebase has diverged from UZIP.js to increase performance and reduce bundle size.\n// Sometimes 0 will appear where -1 would be more appropriate. This is because using a uint\n// is better for memory in most engines (I *think*).\nvar ch2 = {};\nvar wk = (function (c, id, msg, transfer, cb) {\n    var w = new Worker(ch2[id] || (ch2[id] = URL.createObjectURL(new Blob([\n        c + ';addEventListener(\"error\",function(e){e=e.error;postMessage({$e$:[e.message,e.code,e.stack]})})'\n    ], { type: 'text/javascript' }))));\n    w.onmessage = function (e) {\n        var d = e.data, ed = d.$e$;\n        if (ed) {\n            var err = new Error(ed[0]);\n            err['code'] = ed[1];\n            err.stack = ed[2];\n            cb(err, null);\n        }\n        else\n            cb(null, d);\n    };\n    w.postMessage(msg, transfer);\n    return w;\n});\n\n// aliases for shorter compressed code (most minifers don't do this)\nvar u8 = Uint8Array, u16 = Uint16Array, i32 = Int32Array;\n// fixed length extra bits\nvar fleb = new u8([0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 5, 5, 5, 5, 0, /* unused */ 0, 0, /* impossible */ 0]);\n// fixed distance extra bits\nvar fdeb = new u8([0, 0, 0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7, 7, 8, 8, 9, 9, 10, 10, 11, 11, 12, 12, 13, 13, /* unused */ 0, 0]);\n// code length index map\nvar clim = new u8([16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15]);\n// get base, reverse index map from extra bits\nvar freb = function (eb, start) {\n    var b = new u16(31);\n    for (var i = 0; i < 31; ++i) {\n        b[i] = start += 1 << eb[i - 1];\n    }\n    // numbers here are at max 18 bits\n    var r = new i32(b[30]);\n    for (var i = 1; i < 30; ++i) {\n        for (var j = b[i]; j < b[i + 1]; ++j) {\n            r[j] = ((j - b[i]) << 5) | i;\n        }\n    }\n    return { b: b, r: r };\n};\nvar _a = freb(fleb, 2), fl = _a.b, revfl = _a.r;\n// we can ignore the fact that the other numbers are wrong; they never happen anyway\nfl[28] = 258, revfl[258] = 28;\nvar _b = freb(fdeb, 0), fd = _b.b, revfd = _b.r;\n// map of value to reverse (assuming 16 bits)\nvar rev = new u16(32768);\nfor (var i = 0; i < 32768; ++i) {\n    // reverse table algorithm from SO\n    var x = ((i & 0xAAAA) >> 1) | ((i & 0x5555) << 1);\n    x = ((x & 0xCCCC) >> 2) | ((x & 0x3333) << 2);\n    x = ((x & 0xF0F0) >> 4) | ((x & 0x0F0F) << 4);\n    rev[i] = (((x & 0xFF00) >> 8) | ((x & 0x00FF) << 8)) >> 1;\n}\n// create huffman tree from u8 \"map\": index -> code length for code index\n// mb (max bits) must be at most 15\n// TODO: optimize/split up?\nvar hMap = (function (cd, mb, r) {\n    var s = cd.length;\n    // index\n    var i = 0;\n    // u16 \"map\": index -> # of codes with bit length = index\n    var l = new u16(mb);\n    // length of cd must be 288 (total # of codes)\n    for (; i < s; ++i) {\n        if (cd[i])\n            ++l[cd[i] - 1];\n    }\n    // u16 \"map\": index -> minimum code for bit length = index\n    var le = new u16(mb);\n    for (i = 1; i < mb; ++i) {\n        le[i] = (le[i - 1] + l[i - 1]) << 1;\n    }\n    var co;\n    if (r) {\n        // u16 \"map\": index -> number of actual bits, symbol for code\n        co = new u16(1 << mb);\n        // bits to remove for reverser\n        var rvb = 15 - mb;\n        for (i = 0; i < s; ++i) {\n            // ignore 0 lengths\n            if (cd[i]) {\n                // num encoding both symbol and bits read\n                var sv = (i << 4) | cd[i];\n                // free bits\n                var r_1 = mb - cd[i];\n                // start value\n                var v = le[cd[i] - 1]++ << r_1;\n                // m is end value\n                for (var m = v | ((1 << r_1) - 1); v <= m; ++v) {\n                    // every 16 bit value starting with the code yields the same result\n                    co[rev[v] >> rvb] = sv;\n                }\n            }\n        }\n    }\n    else {\n        co = new u16(s);\n        for (i = 0; i < s; ++i) {\n            if (cd[i]) {\n                co[i] = rev[le[cd[i] - 1]++] >> (15 - cd[i]);\n            }\n        }\n    }\n    return co;\n});\n// fixed length tree\nvar flt = new u8(288);\nfor (var i = 0; i < 144; ++i)\n    flt[i] = 8;\nfor (var i = 144; i < 256; ++i)\n    flt[i] = 9;\nfor (var i = 256; i < 280; ++i)\n    flt[i] = 7;\nfor (var i = 280; i < 288; ++i)\n    flt[i] = 8;\n// fixed distance tree\nvar fdt = new u8(32);\nfor (var i = 0; i < 32; ++i)\n    fdt[i] = 5;\n// fixed length map\nvar flm = /*#__PURE__*/ hMap(flt, 9, 0), flrm = /*#__PURE__*/ hMap(flt, 9, 1);\n// fixed distance map\nvar fdm = /*#__PURE__*/ hMap(fdt, 5, 0), fdrm = /*#__PURE__*/ hMap(fdt, 5, 1);\n// find max of array\nvar max = function (a) {\n    var m = a[0];\n    for (var i = 1; i < a.length; ++i) {\n        if (a[i] > m)\n            m = a[i];\n    }\n    return m;\n};\n// read d, starting at bit p and mask with m\nvar bits = function (d, p, m) {\n    var o = (p / 8) | 0;\n    return ((d[o] | (d[o + 1] << 8)) >> (p & 7)) & m;\n};\n// read d, starting at bit p continuing for at least 16 bits\nvar bits16 = function (d, p) {\n    var o = (p / 8) | 0;\n    return ((d[o] | (d[o + 1] << 8) | (d[o + 2] << 16)) >> (p & 7));\n};\n// get end of byte\nvar shft = function (p) { return ((p + 7) / 8) | 0; };\n// typed array slice - allows garbage collector to free original reference,\n// while being more compatible than .slice\nvar slc = function (v, s, e) {\n    if (s == null || s < 0)\n        s = 0;\n    if (e == null || e > v.length)\n        e = v.length;\n    // can't use .constructor in case user-supplied\n    var n = new u8(e - s);\n    n.set(v.subarray(s, e));\n    return n;\n};\n/**\n * Codes for errors generated within this library\n */\nexport var FlateErrorCode = {\n    UnexpectedEOF: 0,\n    InvalidBlockType: 1,\n    InvalidLengthLiteral: 2,\n    InvalidDistance: 3,\n    StreamFinished: 4,\n    NoStreamHandler: 5,\n    InvalidHeader: 6,\n    NoCallback: 7,\n    InvalidUTF8: 8,\n    ExtraFieldTooLong: 9,\n    InvalidDate: 10,\n    FilenameTooLong: 11,\n    StreamFinishing: 12,\n    InvalidZipData: 13,\n    UnknownCompressionMethod: 14\n};\n// error codes\nvar ec = [\n    'unexpected EOF',\n    'invalid block type',\n    'invalid length/literal',\n    'invalid distance',\n    'stream finished',\n    'no stream handler',\n    ,\n    'no callback',\n    'invalid UTF-8 data',\n    'extra field too long',\n    'date not in range 1980-2099',\n    'filename too long',\n    'stream finishing',\n    'invalid zip data'\n    // determined by unknown compression method\n];\n;\nvar err = function (ind, msg, nt) {\n    var e = new Error(msg || ec[ind]);\n    e.code = ind;\n    if (Error.captureStackTrace)\n        Error.captureStackTrace(e, err);\n    if (!nt)\n        throw e;\n    return e;\n};\n// expands raw DEFLATE data\nvar inflt = function (dat, st, buf, dict) {\n    // source length       dict length\n    var sl = dat.length, dl = dict ? dict.length : 0;\n    if (!sl || st.f && !st.l)\n        return buf || new u8(0);\n    // have to estimate size\n    var noBuf = !buf || st.i != 2;\n    // no state\n    var noSt = st.i;\n    // Assumes roughly 33% compression ratio average\n    if (!buf)\n        buf = new u8(sl * 3);\n    // ensure buffer can fit at least l elements\n    var cbuf = function (l) {\n        var bl = buf.length;\n        // need to increase size to fit\n        if (l > bl) {\n            // Double or set to necessary, whichever is greater\n            var nbuf = new u8(Math.max(bl * 2, l));\n            nbuf.set(buf);\n            buf = nbuf;\n        }\n    };\n    //  last chunk         bitpos           bytes\n    var final = st.f || 0, pos = st.p || 0, bt = st.b || 0, lm = st.l, dm = st.d, lbt = st.m, dbt = st.n;\n    // total bits\n    var tbts = sl * 8;\n    do {\n        if (!lm) {\n            // BFINAL - this is only 1 when last chunk is next\n            final = bits(dat, pos, 1);\n            // type: 0 = no compression, 1 = fixed huffman, 2 = dynamic huffman\n            var type = bits(dat, pos + 1, 3);\n            pos += 3;\n            if (!type) {\n                // go to end of byte boundary\n                var s = shft(pos) + 4, l = dat[s - 4] | (dat[s - 3] << 8), t = s + l;\n                if (t > sl) {\n                    if (noSt)\n                        err(0);\n                    break;\n                }\n                // ensure size\n                if (noBuf)\n                    cbuf(bt + l);\n                // Copy over uncompressed data\n                buf.set(dat.subarray(s, t), bt);\n                // Get new bitpos, update byte count\n                st.b = bt += l, st.p = pos = t * 8, st.f = final;\n                continue;\n            }\n            else if (type == 1)\n                lm = flrm, dm = fdrm, lbt = 9, dbt = 5;\n            else if (type == 2) {\n                //  literal                            lengths\n                var hLit = bits(dat, pos, 31) + 257, hcLen = bits(dat, pos + 10, 15) + 4;\n                var tl = hLit + bits(dat, pos + 5, 31) + 1;\n                pos += 14;\n                // length+distance tree\n                var ldt = new u8(tl);\n                // code length tree\n                var clt = new u8(19);\n                for (var i = 0; i < hcLen; ++i) {\n                    // use index map to get real code\n                    clt[clim[i]] = bits(dat, pos + i * 3, 7);\n                }\n                pos += hcLen * 3;\n                // code lengths bits\n                var clb = max(clt), clbmsk = (1 << clb) - 1;\n                // code lengths map\n                var clm = hMap(clt, clb, 1);\n                for (var i = 0; i < tl;) {\n                    var r = clm[bits(dat, pos, clbmsk)];\n                    // bits read\n                    pos += r & 15;\n                    // symbol\n                    var s = r >> 4;\n                    // code length to copy\n                    if (s < 16) {\n                        ldt[i++] = s;\n                    }\n                    else {\n                        //  copy   count\n                        var c = 0, n = 0;\n                        if (s == 16)\n                            n = 3 + bits(dat, pos, 3), pos += 2, c = ldt[i - 1];\n                        else if (s == 17)\n                            n = 3 + bits(dat, pos, 7), pos += 3;\n                        else if (s == 18)\n                            n = 11 + bits(dat, pos, 127), pos += 7;\n                        while (n--)\n                            ldt[i++] = c;\n                    }\n                }\n                //    length tree                 distance tree\n                var lt = ldt.subarray(0, hLit), dt = ldt.subarray(hLit);\n                // max length bits\n                lbt = max(lt);\n                // max dist bits\n                dbt = max(dt);\n                lm = hMap(lt, lbt, 1);\n                dm = hMap(dt, dbt, 1);\n            }\n            else\n                err(1);\n            if (pos > tbts) {\n                if (noSt)\n                    err(0);\n                break;\n            }\n        }\n        // Make sure the buffer can hold this + the largest possible addition\n        // Maximum chunk size (practically, theoretically infinite) is 2^17\n        if (noBuf)\n            cbuf(bt + 131072);\n        var lms = (1 << lbt) - 1, dms = (1 << dbt) - 1;\n        var lpos = pos;\n        for (;; lpos = pos) {\n            // bits read, code\n            var c = lm[bits16(dat, pos) & lms], sym = c >> 4;\n            pos += c & 15;\n            if (pos > tbts) {\n                if (noSt)\n                    err(0);\n                break;\n            }\n            if (!c)\n                err(2);\n            if (sym < 256)\n                buf[bt++] = sym;\n            else if (sym == 256) {\n                lpos = pos, lm = null;\n                break;\n            }\n            else {\n                var add = sym - 254;\n                // no extra bits needed if less\n                if (sym > 264) {\n                    // index\n                    var i = sym - 257, b = fleb[i];\n                    add = bits(dat, pos, (1 << b) - 1) + fl[i];\n                    pos += b;\n                }\n                // dist\n                var d = dm[bits16(dat, pos) & dms], dsym = d >> 4;\n                if (!d)\n                    err(3);\n                pos += d & 15;\n                var dt = fd[dsym];\n                if (dsym > 3) {\n                    var b = fdeb[dsym];\n                    dt += bits16(dat, pos) & (1 << b) - 1, pos += b;\n                }\n                if (pos > tbts) {\n                    if (noSt)\n                        err(0);\n                    break;\n                }\n                if (noBuf)\n                    cbuf(bt + 131072);\n                var end = bt + add;\n                if (bt < dt) {\n                    var shift = dl - dt, dend = Math.min(dt, end);\n                    if (shift + bt < 0)\n                        err(3);\n                    for (; bt < dend; ++bt)\n                        buf[bt] = dict[shift + bt];\n                }\n                for (; bt < end; bt += 4) {\n                    buf[bt] = buf[bt - dt];\n                    buf[bt + 1] = buf[bt + 1 - dt];\n                    buf[bt + 2] = buf[bt + 2 - dt];\n                    buf[bt + 3] = buf[bt + 3 - dt];\n                }\n                bt = end;\n            }\n        }\n        st.l = lm, st.p = lpos, st.b = bt, st.f = final;\n        if (lm)\n            final = 1, st.m = lbt, st.d = dm, st.n = dbt;\n    } while (!final);\n    return bt == buf.length ? buf : slc(buf, 0, bt);\n};\n// starting at p, write the minimum number of bits that can hold v to d\nvar wbits = function (d, p, v) {\n    v <<= p & 7;\n    var o = (p / 8) | 0;\n    d[o] |= v;\n    d[o + 1] |= v >> 8;\n};\n// starting at p, write the minimum number of bits (>8) that can hold v to d\nvar wbits16 = function (d, p, v) {\n    v <<= p & 7;\n    var o = (p / 8) | 0;\n    d[o] |= v;\n    d[o + 1] |= v >> 8;\n    d[o + 2] |= v >> 16;\n};\n// creates code lengths from a frequency table\nvar hTree = function (d, mb) {\n    // Need extra info to make a tree\n    var t = [];\n    for (var i = 0; i < d.length; ++i) {\n        if (d[i])\n            t.push({ s: i, f: d[i] });\n    }\n    var s = t.length;\n    var t2 = t.slice();\n    if (!s)\n        return { t: et, l: 0 };\n    if (s == 1) {\n        var v = new u8(t[0].s + 1);\n        v[t[0].s] = 1;\n        return { t: v, l: 1 };\n    }\n    t.sort(function (a, b) { return a.f - b.f; });\n    // after i2 reaches last ind, will be stopped\n    // freq must be greater than largest possible number of symbols\n    t.push({ s: -1, f: 25001 });\n    var l = t[0], r = t[1], i0 = 0, i1 = 1, i2 = 2;\n    t[0] = { s: -1, f: l.f + r.f, l: l, r: r };\n    // efficient algorithm from UZIP.js\n    // i0 is lookbehind, i2 is lookahead - after processing two low-freq\n    // symbols that combined have high freq, will start processing i2 (high-freq,\n    // non-composite) symbols instead\n    // see https://reddit.com/r/photopea/comments/ikekht/uzipjs_questions/\n    while (i1 != s - 1) {\n        l = t[t[i0].f < t[i2].f ? i0++ : i2++];\n        r = t[i0 != i1 && t[i0].f < t[i2].f ? i0++ : i2++];\n        t[i1++] = { s: -1, f: l.f + r.f, l: l, r: r };\n    }\n    var maxSym = t2[0].s;\n    for (var i = 1; i < s; ++i) {\n        if (t2[i].s > maxSym)\n            maxSym = t2[i].s;\n    }\n    // code lengths\n    var tr = new u16(maxSym + 1);\n    // max bits in tree\n    var mbt = ln(t[i1 - 1], tr, 0);\n    if (mbt > mb) {\n        // more algorithms from UZIP.js\n        // TODO: find out how this code works (debt)\n        //  ind    debt\n        var i = 0, dt = 0;\n        //    left            cost\n        var lft = mbt - mb, cst = 1 << lft;\n        t2.sort(function (a, b) { return tr[b.s] - tr[a.s] || a.f - b.f; });\n        for (; i < s; ++i) {\n            var i2_1 = t2[i].s;\n            if (tr[i2_1] > mb) {\n                dt += cst - (1 << (mbt - tr[i2_1]));\n                tr[i2_1] = mb;\n            }\n            else\n                break;\n        }\n        dt >>= lft;\n        while (dt > 0) {\n            var i2_2 = t2[i].s;\n            if (tr[i2_2] < mb)\n                dt -= 1 << (mb - tr[i2_2]++ - 1);\n            else\n                ++i;\n        }\n        for (; i >= 0 && dt; --i) {\n            var i2_3 = t2[i].s;\n            if (tr[i2_3] == mb) {\n                --tr[i2_3];\n                ++dt;\n            }\n        }\n        mbt = mb;\n    }\n    return { t: new u8(tr), l: mbt };\n};\n// get the max length and assign length codes\nvar ln = function (n, l, d) {\n    return n.s == -1\n        ? Math.max(ln(n.l, l, d + 1), ln(n.r, l, d + 1))\n        : (l[n.s] = d);\n};\n// length codes generation\nvar lc = function (c) {\n    var s = c.length;\n    // Note that the semicolon was intentional\n    while (s && !c[--s])\n        ;\n    var cl = new u16(++s);\n    //  ind      num         streak\n    var cli = 0, cln = c[0], cls = 1;\n    var w = function (v) { cl[cli++] = v; };\n    for (var i = 1; i <= s; ++i) {\n        if (c[i] == cln && i != s)\n            ++cls;\n        else {\n            if (!cln && cls > 2) {\n                for (; cls > 138; cls -= 138)\n                    w(32754);\n                if (cls > 2) {\n                    w(cls > 10 ? ((cls - 11) << 5) | 28690 : ((cls - 3) << 5) | 12305);\n                    cls = 0;\n                }\n            }\n            else if (cls > 3) {\n                w(cln), --cls;\n                for (; cls > 6; cls -= 6)\n                    w(8304);\n                if (cls > 2)\n                    w(((cls - 3) << 5) | 8208), cls = 0;\n            }\n            while (cls--)\n                w(cln);\n            cls = 1;\n            cln = c[i];\n        }\n    }\n    return { c: cl.subarray(0, cli), n: s };\n};\n// calculate the length of output from tree, code lengths\nvar clen = function (cf, cl) {\n    var l = 0;\n    for (var i = 0; i < cl.length; ++i)\n        l += cf[i] * cl[i];\n    return l;\n};\n// writes a fixed block\n// returns the new bit pos\nvar wfblk = function (out, pos, dat) {\n    // no need to write 00 as type: TypedArray defaults to 0\n    var s = dat.length;\n    var o = shft(pos + 2);\n    out[o] = s & 255;\n    out[o + 1] = s >> 8;\n    out[o + 2] = out[o] ^ 255;\n    out[o + 3] = out[o + 1] ^ 255;\n    for (var i = 0; i < s; ++i)\n        out[o + i + 4] = dat[i];\n    return (o + 4 + s) * 8;\n};\n// writes a block\nvar wblk = function (dat, out, final, syms, lf, df, eb, li, bs, bl, p) {\n    wbits(out, p++, final);\n    ++lf[256];\n    var _a = hTree(lf, 15), dlt = _a.t, mlb = _a.l;\n    var _b = hTree(df, 15), ddt = _b.t, mdb = _b.l;\n    var _c = lc(dlt), lclt = _c.c, nlc = _c.n;\n    var _d = lc(ddt), lcdt = _d.c, ndc = _d.n;\n    var lcfreq = new u16(19);\n    for (var i = 0; i < lclt.length; ++i)\n        ++lcfreq[lclt[i] & 31];\n    for (var i = 0; i < lcdt.length; ++i)\n        ++lcfreq[lcdt[i] & 31];\n    var _e = hTree(lcfreq, 7), lct = _e.t, mlcb = _e.l;\n    var nlcc = 19;\n    for (; nlcc > 4 && !lct[clim[nlcc - 1]]; --nlcc)\n        ;\n    var flen = (bl + 5) << 3;\n    var ftlen = clen(lf, flt) + clen(df, fdt) + eb;\n    var dtlen = clen(lf, dlt) + clen(df, ddt) + eb + 14 + 3 * nlcc + clen(lcfreq, lct) + 2 * lcfreq[16] + 3 * lcfreq[17] + 7 * lcfreq[18];\n    if (bs >= 0 && flen <= ftlen && flen <= dtlen)\n        return wfblk(out, p, dat.subarray(bs, bs + bl));\n    var lm, ll, dm, dl;\n    wbits(out, p, 1 + (dtlen < ftlen)), p += 2;\n    if (dtlen < ftlen) {\n        lm = hMap(dlt, mlb, 0), ll = dlt, dm = hMap(ddt, mdb, 0), dl = ddt;\n        var llm = hMap(lct, mlcb, 0);\n        wbits(out, p, nlc - 257);\n        wbits(out, p + 5, ndc - 1);\n        wbits(out, p + 10, nlcc - 4);\n        p += 14;\n        for (var i = 0; i < nlcc; ++i)\n            wbits(out, p + 3 * i, lct[clim[i]]);\n        p += 3 * nlcc;\n        var lcts = [lclt, lcdt];\n        for (var it = 0; it < 2; ++it) {\n            var clct = lcts[it];\n            for (var i = 0; i < clct.length; ++i) {\n                var len = clct[i] & 31;\n                wbits(out, p, llm[len]), p += lct[len];\n                if (len > 15)\n                    wbits(out, p, (clct[i] >> 5) & 127), p += clct[i] >> 12;\n            }\n        }\n    }\n    else {\n        lm = flm, ll = flt, dm = fdm, dl = fdt;\n    }\n    for (var i = 0; i < li; ++i) {\n        var sym = syms[i];\n        if (sym > 255) {\n            var len = (sym >> 18) & 31;\n            wbits16(out, p, lm[len + 257]), p += ll[len + 257];\n            if (len > 7)\n                wbits(out, p, (sym >> 23) & 31), p += fleb[len];\n            var dst = sym & 31;\n            wbits16(out, p, dm[dst]), p += dl[dst];\n            if (dst > 3)\n                wbits16(out, p, (sym >> 5) & 8191), p += fdeb[dst];\n        }\n        else {\n            wbits16(out, p, lm[sym]), p += ll[sym];\n        }\n    }\n    wbits16(out, p, lm[256]);\n    return p + ll[256];\n};\n// deflate options (nice << 13) | chain\nvar deo = /*#__PURE__*/ new i32([65540, 131080, 131088, 131104, 262176, 1048704, 1048832, 2114560, 2117632]);\n// empty\nvar et = /*#__PURE__*/ new u8(0);\n// compresses data into a raw DEFLATE buffer\nvar dflt = function (dat, lvl, plvl, pre, post, st) {\n    var s = st.z || dat.length;\n    var o = new u8(pre + s + 5 * (1 + Math.ceil(s / 7000)) + post);\n    // writing to this writes to the output buffer\n    var w = o.subarray(pre, o.length - post);\n    var lst = st.l;\n    var pos = (st.r || 0) & 7;\n    if (lvl) {\n        if (pos)\n            w[0] = st.r >> 3;\n        var opt = deo[lvl - 1];\n        var n = opt >> 13, c = opt & 8191;\n        var msk_1 = (1 << plvl) - 1;\n        //    prev 2-byte val map    curr 2-byte val map\n        var prev = st.p || new u16(32768), head = st.h || new u16(msk_1 + 1);\n        var bs1_1 = Math.ceil(plvl / 3), bs2_1 = 2 * bs1_1;\n        var hsh = function (i) { return (dat[i] ^ (dat[i + 1] << bs1_1) ^ (dat[i + 2] << bs2_1)) & msk_1; };\n        // 24576 is an arbitrary number of maximum symbols per block\n        // 424 buffer for last block\n        var syms = new i32(25000);\n        // length/literal freq   distance freq\n        var lf = new u16(288), df = new u16(32);\n        //  l/lcnt  exbits  index          l/lind  waitdx          blkpos\n        var lc_1 = 0, eb = 0, i = st.i || 0, li = 0, wi = st.w || 0, bs = 0;\n        for (; i + 2 < s; ++i) {\n            // hash value\n            var hv = hsh(i);\n            // index mod 32768    previous index mod\n            var imod = i & 32767, pimod = head[hv];\n            prev[imod] = pimod;\n            head[hv] = imod;\n            // We always should modify head and prev, but only add symbols if\n            // this data is not yet processed (\"wait\" for wait index)\n            if (wi <= i) {\n                // bytes remaining\n                var rem = s - i;\n                if ((lc_1 > 7000 || li > 24576) && (rem > 423 || !lst)) {\n                    pos = wblk(dat, w, 0, syms, lf, df, eb, li, bs, i - bs, pos);\n                    li = lc_1 = eb = 0, bs = i;\n                    for (var j = 0; j < 286; ++j)\n                        lf[j] = 0;\n                    for (var j = 0; j < 30; ++j)\n                        df[j] = 0;\n                }\n                //  len    dist   chain\n                var l = 2, d = 0, ch_1 = c, dif = imod - pimod & 32767;\n                if (rem > 2 && hv == hsh(i - dif)) {\n                    var maxn = Math.min(n, rem) - 1;\n                    var maxd = Math.min(32767, i);\n                    // max possible length\n                    // not capped at dif because decompressors implement \"rolling\" index population\n                    var ml = Math.min(258, rem);\n                    while (dif <= maxd && --ch_1 && imod != pimod) {\n                        if (dat[i + l] == dat[i + l - dif]) {\n                            var nl = 0;\n                            for (; nl < ml && dat[i + nl] == dat[i + nl - dif]; ++nl)\n                                ;\n                            if (nl > l) {\n                                l = nl, d = dif;\n                                // break out early when we reach \"nice\" (we are satisfied enough)\n                                if (nl > maxn)\n                                    break;\n                                // now, find the rarest 2-byte sequence within this\n                                // length of literals and search for that instead.\n                                // Much faster than just using the start\n                                var mmd = Math.min(dif, nl - 2);\n                                var md = 0;\n                                for (var j = 0; j < mmd; ++j) {\n                                    var ti = i - dif + j & 32767;\n                                    var pti = prev[ti];\n                                    var cd = ti - pti & 32767;\n                                    if (cd > md)\n                                        md = cd, pimod = ti;\n                                }\n                            }\n                        }\n                        // check the previous match\n                        imod = pimod, pimod = prev[imod];\n                        dif += imod - pimod & 32767;\n                    }\n                }\n                // d will be nonzero only when a match was found\n                if (d) {\n                    // store both dist and len data in one int32\n                    // Make sure this is recognized as a len/dist with 28th bit (2^28)\n                    syms[li++] = 268435456 | (revfl[l] << 18) | revfd[d];\n                    var lin = revfl[l] & 31, din = revfd[d] & 31;\n                    eb += fleb[lin] + fdeb[din];\n                    ++lf[257 + lin];\n                    ++df[din];\n                    wi = i + l;\n                    ++lc_1;\n                }\n                else {\n                    syms[li++] = dat[i];\n                    ++lf[dat[i]];\n                }\n            }\n        }\n        for (i = Math.max(i, wi); i < s; ++i) {\n            syms[li++] = dat[i];\n            ++lf[dat[i]];\n        }\n        pos = wblk(dat, w, lst, syms, lf, df, eb, li, bs, i - bs, pos);\n        if (!lst) {\n            st.r = (pos & 7) | w[(pos / 8) | 0] << 3;\n            // shft(pos) now 1 less if pos & 7 != 0\n            pos -= 7;\n            st.h = head, st.p = prev, st.i = i, st.w = wi;\n        }\n    }\n    else {\n        for (var i = st.w || 0; i < s + lst; i += 65535) {\n            // end\n            var e = i + 65535;\n            if (e >= s) {\n                // write final block\n                w[(pos / 8) | 0] = lst;\n                e = s;\n            }\n            pos = wfblk(w, pos + 1, dat.subarray(i, e));\n        }\n        st.i = s;\n    }\n    return slc(o, 0, pre + shft(pos) + post);\n};\n// CRC32 table\nvar crct = /*#__PURE__*/ (function () {\n    var t = new Int32Array(256);\n    for (var i = 0; i < 256; ++i) {\n        var c = i, k = 9;\n        while (--k)\n            c = ((c & 1) && -306674912) ^ (c >>> 1);\n        t[i] = c;\n    }\n    return t;\n})();\n// CRC32\nvar crc = function () {\n    var c = -1;\n    return {\n        p: function (d) {\n            // closures have awful performance\n            var cr = c;\n            for (var i = 0; i < d.length; ++i)\n                cr = crct[(cr & 255) ^ d[i]] ^ (cr >>> 8);\n            c = cr;\n        },\n        d: function () { return ~c; }\n    };\n};\n// Adler32\nvar adler = function () {\n    var a = 1, b = 0;\n    return {\n        p: function (d) {\n            // closures have awful performance\n            var n = a, m = b;\n            var l = d.length | 0;\n            for (var i = 0; i != l;) {\n                var e = Math.min(i + 2655, l);\n                for (; i < e; ++i)\n                    m += n += d[i];\n                n = (n & 65535) + 15 * (n >> 16), m = (m & 65535) + 15 * (m >> 16);\n            }\n            a = n, b = m;\n        },\n        d: function () {\n            a %= 65521, b %= 65521;\n            return (a & 255) << 24 | (a & 0xFF00) << 8 | (b & 255) << 8 | (b >> 8);\n        }\n    };\n};\n;\n// deflate with opts\nvar dopt = function (dat, opt, pre, post, st) {\n    if (!st) {\n        st = { l: 1 };\n        if (opt.dictionary) {\n            var dict = opt.dictionary.subarray(-32768);\n            var newDat = new u8(dict.length + dat.length);\n            newDat.set(dict);\n            newDat.set(dat, dict.length);\n            dat = newDat;\n            st.w = dict.length;\n        }\n    }\n    return dflt(dat, opt.level == null ? 6 : opt.level, opt.mem == null ? Math.ceil(Math.max(8, Math.min(13, Math.log(dat.length))) * 1.5) : (12 + opt.mem), pre, post, st);\n};\n// Walmart object spread\nvar mrg = function (a, b) {\n    var o = {};\n    for (var k in a)\n        o[k] = a[k];\n    for (var k in b)\n        o[k] = b[k];\n    return o;\n};\n// worker clone\n// This is possibly the craziest part of the entire codebase, despite how simple it may seem.\n// The only parameter to this function is a closure that returns an array of variables outside of the function scope.\n// We're going to try to figure out the variable names used in the closure as strings because that is crucial for workerization.\n// We will return an object mapping of true variable name to value (basically, the current scope as a JS object).\n// The reason we can't just use the original variable names is minifiers mangling the toplevel scope.\n// This took me three weeks to figure out how to do.\nvar wcln = function (fn, fnStr, td) {\n    var dt = fn();\n    var st = fn.toString();\n    var ks = st.slice(st.indexOf('[') + 1, st.lastIndexOf(']')).replace(/\\s+/g, '').split(',');\n    for (var i = 0; i < dt.length; ++i) {\n        var v = dt[i], k = ks[i];\n        if (typeof v == 'function') {\n            fnStr += ';' + k + '=';\n            var st_1 = v.toString();\n            if (v.prototype) {\n                // for global objects\n                if (st_1.indexOf('[native code]') != -1) {\n                    var spInd = st_1.indexOf(' ', 8) + 1;\n                    fnStr += st_1.slice(spInd, st_1.indexOf('(', spInd));\n                }\n                else {\n                    fnStr += st_1;\n                    for (var t in v.prototype)\n                        fnStr += ';' + k + '.prototype.' + t + '=' + v.prototype[t].toString();\n                }\n            }\n            else\n                fnStr += st_1;\n        }\n        else\n            td[k] = v;\n    }\n    return fnStr;\n};\nvar ch = [];\n// clone bufs\nvar cbfs = function (v) {\n    var tl = [];\n    for (var k in v) {\n        if (v[k].buffer) {\n            tl.push((v[k] = new v[k].constructor(v[k])).buffer);\n        }\n    }\n    return tl;\n};\n// use a worker to execute code\nvar wrkr = function (fns, init, id, cb) {\n    if (!ch[id]) {\n        var fnStr = '', td_1 = {}, m = fns.length - 1;\n        for (var i = 0; i < m; ++i)\n            fnStr = wcln(fns[i], fnStr, td_1);\n        ch[id] = { c: wcln(fns[m], fnStr, td_1), e: td_1 };\n    }\n    var td = mrg({}, ch[id].e);\n    return wk(ch[id].c + ';onmessage=function(e){for(var k in e.data)self[k]=e.data[k];onmessage=' + init.toString() + '}', id, td, cbfs(td), cb);\n};\n// base async inflate fn\nvar bInflt = function () { return [u8, u16, i32, fleb, fdeb, clim, fl, fd, flrm, fdrm, rev, ec, hMap, max, bits, bits16, shft, slc, err, inflt, inflateSync, pbf, gopt]; };\nvar bDflt = function () { return [u8, u16, i32, fleb, fdeb, clim, revfl, revfd, flm, flt, fdm, fdt, rev, deo, et, hMap, wbits, wbits16, hTree, ln, lc, clen, wfblk, wblk, shft, slc, dflt, dopt, deflateSync, pbf]; };\n// gzip extra\nvar gze = function () { return [gzh, gzhl, wbytes, crc, crct]; };\n// gunzip extra\nvar guze = function () { return [gzs, gzl]; };\n// zlib extra\nvar zle = function () { return [zlh, wbytes, adler]; };\n// unzlib extra\nvar zule = function () { return [zls]; };\n// post buf\nvar pbf = function (msg) { return postMessage(msg, [msg.buffer]); };\n// get opts\nvar gopt = function (o) { return o && {\n    out: o.size && new u8(o.size),\n    dictionary: o.dictionary\n}; };\n// async helper\nvar cbify = function (dat, opts, fns, init, id, cb) {\n    var w = wrkr(fns, init, id, function (err, dat) {\n        w.terminate();\n        cb(err, dat);\n    });\n    w.postMessage([dat, opts], opts.consume ? [dat.buffer] : []);\n    return function () { w.terminate(); };\n};\n// auto stream\nvar astrm = function (strm) {\n    strm.ondata = function (dat, final) { return postMessage([dat, final], [dat.buffer]); };\n    return function (ev) { return strm.push(ev.data[0], ev.data[1]); };\n};\n// async stream attach\nvar astrmify = function (fns, strm, opts, init, id, ext) {\n    var t;\n    var w = wrkr(fns, init, id, function (err, dat) {\n        if (err)\n            w.terminate(), strm.ondata.call(strm, err);\n        else if (!Array.isArray(dat))\n            ext(dat);\n        else {\n            if (dat[1])\n                w.terminate();\n            strm.ondata.call(strm, err, dat[0], dat[1]);\n        }\n    });\n    w.postMessage(opts);\n    strm.push = function (d, f) {\n        if (!strm.ondata)\n            err(5);\n        if (t)\n            strm.ondata(err(4, 0, 1), null, !!f);\n        w.postMessage([d, t = f], [d.buffer]);\n    };\n    strm.terminate = function () { w.terminate(); };\n};\n// read 2 bytes\nvar b2 = function (d, b) { return d[b] | (d[b + 1] << 8); };\n// read 4 bytes\nvar b4 = function (d, b) { return (d[b] | (d[b + 1] << 8) | (d[b + 2] << 16) | (d[b + 3] << 24)) >>> 0; };\nvar b8 = function (d, b) { return b4(d, b) + (b4(d, b + 4) * 4294967296); };\n// write bytes\nvar wbytes = function (d, b, v) {\n    for (; v; ++b)\n        d[b] = v, v >>>= 8;\n};\n// gzip header\nvar gzh = function (c, o) {\n    var fn = o.filename;\n    c[0] = 31, c[1] = 139, c[2] = 8, c[8] = o.level < 2 ? 4 : o.level == 9 ? 2 : 0, c[9] = 3; // assume Unix\n    if (o.mtime != 0)\n        wbytes(c, 4, Math.floor(new Date(o.mtime || Date.now()) / 1000));\n    if (fn) {\n        c[3] = 8;\n        for (var i = 0; i <= fn.length; ++i)\n            c[i + 10] = fn.charCodeAt(i);\n    }\n};\n// gzip footer: -8 to -4 = CRC, -4 to -0 is length\n// gzip start\nvar gzs = function (d) {\n    if (d[0] != 31 || d[1] != 139 || d[2] != 8)\n        err(6, 'invalid gzip data');\n    var flg = d[3];\n    var st = 10;\n    if (flg & 4)\n        st += (d[10] | d[11] << 8) + 2;\n    for (var zs = (flg >> 3 & 1) + (flg >> 4 & 1); zs > 0; zs -= !d[st++])\n        ;\n    return st + (flg & 2);\n};\n// gzip length\nvar gzl = function (d) {\n    var l = d.length;\n    return (d[l - 4] | d[l - 3] << 8 | d[l - 2] << 16 | d[l - 1] << 24) >>> 0;\n};\n// gzip header length\nvar gzhl = function (o) { return 10 + (o.filename ? o.filename.length + 1 : 0); };\n// zlib header\nvar zlh = function (c, o) {\n    var lv = o.level, fl = lv == 0 ? 0 : lv < 6 ? 1 : lv == 9 ? 3 : 2;\n    c[0] = 120, c[1] = (fl << 6) | (o.dictionary && 32);\n    c[1] |= 31 - ((c[0] << 8) | c[1]) % 31;\n    if (o.dictionary) {\n        var h = adler();\n        h.p(o.dictionary);\n        wbytes(c, 2, h.d());\n    }\n};\n// zlib start\nvar zls = function (d, dict) {\n    if ((d[0] & 15) != 8 || (d[0] >> 4) > 7 || ((d[0] << 8 | d[1]) % 31))\n        err(6, 'invalid zlib data');\n    if ((d[1] >> 5 & 1) == +!dict)\n        err(6, 'invalid zlib data: ' + (d[1] & 32 ? 'need' : 'unexpected') + ' dictionary');\n    return (d[1] >> 3 & 4) + 2;\n};\nfunction StrmOpt(opts, cb) {\n    if (typeof opts == 'function')\n        cb = opts, opts = {};\n    this.ondata = cb;\n    return opts;\n}\n/**\n * Streaming DEFLATE compression\n */\nvar Deflate = /*#__PURE__*/ (function () {\n    function Deflate(opts, cb) {\n        if (typeof opts == 'function')\n            cb = opts, opts = {};\n        this.ondata = cb;\n        this.o = opts || {};\n        this.s = { l: 0, i: 32768, w: 32768, z: 32768 };\n        // Buffer length must always be 0 mod 32768 for index calculations to be correct when modifying head and prev\n        // 98304 = 32768 (lookback) + 65536 (common chunk size)\n        this.b = new u8(98304);\n        if (this.o.dictionary) {\n            var dict = this.o.dictionary.subarray(-32768);\n            this.b.set(dict, 32768 - dict.length);\n            this.s.i = 32768 - dict.length;\n        }\n    }\n    Deflate.prototype.p = function (c, f) {\n        this.ondata(dopt(c, this.o, 0, 0, this.s), f);\n    };\n    /**\n     * Pushes a chunk to be deflated\n     * @param chunk The chunk to push\n     * @param final Whether this is the last chunk\n     */\n    Deflate.prototype.push = function (chunk, final) {\n        if (!this.ondata)\n            err(5);\n        if (this.s.l)\n            err(4);\n        var endLen = chunk.length + this.s.z;\n        if (endLen > this.b.length) {\n            if (endLen > 2 * this.b.length - 32768) {\n                var newBuf = new u8(endLen & -32768);\n                newBuf.set(this.b.subarray(0, this.s.z));\n                this.b = newBuf;\n            }\n            var split = this.b.length - this.s.z;\n            if (split) {\n                this.b.set(chunk.subarray(0, split), this.s.z);\n                this.s.z = this.b.length;\n                this.p(this.b, false);\n            }\n            this.b.set(this.b.subarray(-32768));\n            this.b.set(chunk.subarray(split), 32768);\n            this.s.z = chunk.length - split + 32768;\n            this.s.i = 32766, this.s.w = 32768;\n        }\n        else {\n            this.b.set(chunk, this.s.z);\n            this.s.z += chunk.length;\n        }\n        this.s.l = final & 1;\n        if (this.s.z > this.s.w + 8191 || final) {\n            this.p(this.b, final || false);\n            this.s.w = this.s.i, this.s.i -= 2;\n        }\n    };\n    return Deflate;\n}());\nexport { Deflate };\n/**\n * Asynchronous streaming DEFLATE compression\n */\nvar AsyncDeflate = /*#__PURE__*/ (function () {\n    function AsyncDeflate(opts, cb) {\n        astrmify([\n            bDflt,\n            function () { return [astrm, Deflate]; }\n        ], this, StrmOpt.call(this, opts, cb), function (ev) {\n            var strm = new Deflate(ev.data);\n            onmessage = astrm(strm);\n        }, 6);\n    }\n    return AsyncDeflate;\n}());\nexport { AsyncDeflate };\nexport function deflate(data, opts, cb) {\n    if (!cb)\n        cb = opts, opts = {};\n    if (typeof cb != 'function')\n        err(7);\n    return cbify(data, opts, [\n        bDflt,\n    ], function (ev) { return pbf(deflateSync(ev.data[0], ev.data[1])); }, 0, cb);\n}\n/**\n * Compresses data with DEFLATE without any wrapper\n * @param data The data to compress\n * @param opts The compression options\n * @returns The deflated version of the data\n */\nexport function deflateSync(data, opts) {\n    return dopt(data, opts || {}, 0, 0);\n}\n/**\n * Streaming DEFLATE decompression\n */\nvar Inflate = /*#__PURE__*/ (function () {\n    function Inflate(opts, cb) {\n        // no StrmOpt here to avoid adding to workerizer\n        if (typeof opts == 'function')\n            cb = opts, opts = {};\n        this.ondata = cb;\n        var dict = opts && opts.dictionary && opts.dictionary.subarray(-32768);\n        this.s = { i: 0, b: dict ? dict.length : 0 };\n        this.o = new u8(32768);\n        this.p = new u8(0);\n        if (dict)\n            this.o.set(dict);\n    }\n    Inflate.prototype.e = function (c) {\n        if (!this.ondata)\n            err(5);\n        if (this.d)\n            err(4);\n        if (!this.p.length)\n            this.p = c;\n        else if (c.length) {\n            var n = new u8(this.p.length + c.length);\n            n.set(this.p), n.set(c, this.p.length), this.p = n;\n        }\n    };\n    Inflate.prototype.c = function (final) {\n        this.s.i = +(this.d = final || false);\n        var bts = this.s.b;\n        var dt = inflt(this.p, this.s, this.o);\n        this.ondata(slc(dt, bts, this.s.b), this.d);\n        this.o = slc(dt, this.s.b - 32768), this.s.b = this.o.length;\n        this.p = slc(this.p, (this.s.p / 8) | 0), this.s.p &= 7;\n    };\n    /**\n     * Pushes a chunk to be inflated\n     * @param chunk The chunk to push\n     * @param final Whether this is the final chunk\n     */\n    Inflate.prototype.push = function (chunk, final) {\n        this.e(chunk), this.c(final);\n    };\n    return Inflate;\n}());\nexport { Inflate };\n/**\n * Asynchronous streaming DEFLATE decompression\n */\nvar AsyncInflate = /*#__PURE__*/ (function () {\n    function AsyncInflate(opts, cb) {\n        astrmify([\n            bInflt,\n            function () { return [astrm, Inflate]; }\n        ], this, StrmOpt.call(this, opts, cb), function (ev) {\n            var strm = new Inflate(ev.data);\n            onmessage = astrm(strm);\n        }, 7);\n    }\n    return AsyncInflate;\n}());\nexport { AsyncInflate };\nexport function inflate(data, opts, cb) {\n    if (!cb)\n        cb = opts, opts = {};\n    if (typeof cb != 'function')\n        err(7);\n    return cbify(data, opts, [\n        bInflt\n    ], function (ev) { return pbf(inflateSync(ev.data[0], gopt(ev.data[1]))); }, 1, cb);\n}\n/**\n * Expands DEFLATE data with no wrapper\n * @param data The data to decompress\n * @param opts The decompression options\n * @returns The decompressed version of the data\n */\nexport function inflateSync(data, opts) {\n    return inflt(data, { i: 2 }, opts && opts.out, opts && opts.dictionary);\n}\n// before you yell at me for not just using extends, my reason is that TS inheritance is hard to workerize.\n/**\n * Streaming GZIP compression\n */\nvar Gzip = /*#__PURE__*/ (function () {\n    function Gzip(opts, cb) {\n        this.c = crc();\n        this.l = 0;\n        this.v = 1;\n        Deflate.call(this, opts, cb);\n    }\n    /**\n     * Pushes a chunk to be GZIPped\n     * @param chunk The chunk to push\n     * @param final Whether this is the last chunk\n     */\n    Gzip.prototype.push = function (chunk, final) {\n        this.c.p(chunk);\n        this.l += chunk.length;\n        Deflate.prototype.push.call(this, chunk, final);\n    };\n    Gzip.prototype.p = function (c, f) {\n        var raw = dopt(c, this.o, this.v && gzhl(this.o), f && 8, this.s);\n        if (this.v)\n            gzh(raw, this.o), this.v = 0;\n        if (f)\n            wbytes(raw, raw.length - 8, this.c.d()), wbytes(raw, raw.length - 4, this.l);\n        this.ondata(raw, f);\n    };\n    return Gzip;\n}());\nexport { Gzip };\n/**\n * Asynchronous streaming GZIP compression\n */\nvar AsyncGzip = /*#__PURE__*/ (function () {\n    function AsyncGzip(opts, cb) {\n        astrmify([\n            bDflt,\n            gze,\n            function () { return [astrm, Deflate, Gzip]; }\n        ], this, StrmOpt.call(this, opts, cb), function (ev) {\n            var strm = new Gzip(ev.data);\n            onmessage = astrm(strm);\n        }, 8);\n    }\n    return AsyncGzip;\n}());\nexport { AsyncGzip };\nexport function gzip(data, opts, cb) {\n    if (!cb)\n        cb = opts, opts = {};\n    if (typeof cb != 'function')\n        err(7);\n    return cbify(data, opts, [\n        bDflt,\n        gze,\n        function () { return [gzipSync]; }\n    ], function (ev) { return pbf(gzipSync(ev.data[0], ev.data[1])); }, 2, cb);\n}\n/**\n * Compresses data with GZIP\n * @param data The data to compress\n * @param opts The compression options\n * @returns The gzipped version of the data\n */\nexport function gzipSync(data, opts) {\n    if (!opts)\n        opts = {};\n    var c = crc(), l = data.length;\n    c.p(data);\n    var d = dopt(data, opts, gzhl(opts), 8), s = d.length;\n    return gzh(d, opts), wbytes(d, s - 8, c.d()), wbytes(d, s - 4, l), d;\n}\n/**\n * Streaming single or multi-member GZIP decompression\n */\nvar Gunzip = /*#__PURE__*/ (function () {\n    function Gunzip(opts, cb) {\n        this.v = 1;\n        this.r = 0;\n        Inflate.call(this, opts, cb);\n    }\n    /**\n     * Pushes a chunk to be GUNZIPped\n     * @param chunk The chunk to push\n     * @param final Whether this is the last chunk\n     */\n    Gunzip.prototype.push = function (chunk, final) {\n        Inflate.prototype.e.call(this, chunk);\n        this.r += chunk.length;\n        if (this.v) {\n            var p = this.p.subarray(this.v - 1);\n            var s = p.length > 3 ? gzs(p) : 4;\n            if (s > p.length) {\n                if (!final)\n                    return;\n            }\n            else if (this.v > 1 && this.onmember) {\n                this.onmember(this.r - p.length);\n            }\n            this.p = p.subarray(s), this.v = 0;\n        }\n        // necessary to prevent TS from using the closure value\n        // This allows for workerization to function correctly\n        Inflate.prototype.c.call(this, final);\n        // process concatenated GZIP\n        if (this.s.f && !this.s.l) {\n            this.v = shft(this.s.p) + 9;\n            this.s = { i: 0 };\n            this.o = new u8(0);\n            if (this.p.length)\n                this.push(new u8(0), final);\n        }\n    };\n    return Gunzip;\n}());\nexport { Gunzip };\n/**\n * Asynchronous streaming single or multi-member GZIP decompression\n */\nvar AsyncGunzip = /*#__PURE__*/ (function () {\n    function AsyncGunzip(opts, cb) {\n        var _this_1 = this;\n        astrmify([\n            bInflt,\n            guze,\n            function () { return [astrm, Inflate, Gunzip]; }\n        ], this, StrmOpt.call(this, opts, cb), function (ev) {\n            var strm = new Gunzip(ev.data);\n            strm.onmember = function (offset) { return postMessage(offset); };\n            onmessage = astrm(strm);\n        }, 9, function (offset) { return _this_1.onmember && _this_1.onmember(offset); });\n    }\n    return AsyncGunzip;\n}());\nexport { AsyncGunzip };\nexport function gunzip(data, opts, cb) {\n    if (!cb)\n        cb = opts, opts = {};\n    if (typeof cb != 'function')\n        err(7);\n    return cbify(data, opts, [\n        bInflt,\n        guze,\n        function () { return [gunzipSync]; }\n    ], function (ev) { return pbf(gunzipSync(ev.data[0], ev.data[1])); }, 3, cb);\n}\n/**\n * Expands GZIP data\n * @param data The data to decompress\n * @param opts The decompression options\n * @returns The decompressed version of the data\n */\nexport function gunzipSync(data, opts) {\n    var st = gzs(data);\n    if (st + 8 > data.length)\n        err(6, 'invalid gzip data');\n    return inflt(data.subarray(st, -8), { i: 2 }, opts && opts.out || new u8(gzl(data)), opts && opts.dictionary);\n}\n/**\n * Streaming Zlib compression\n */\nvar Zlib = /*#__PURE__*/ (function () {\n    function Zlib(opts, cb) {\n        this.c = adler();\n        this.v = 1;\n        Deflate.call(this, opts, cb);\n    }\n    /**\n     * Pushes a chunk to be zlibbed\n     * @param chunk The chunk to push\n     * @param final Whether this is the last chunk\n     */\n    Zlib.prototype.push = function (chunk, final) {\n        this.c.p(chunk);\n        Deflate.prototype.push.call(this, chunk, final);\n    };\n    Zlib.prototype.p = function (c, f) {\n        var raw = dopt(c, this.o, this.v && (this.o.dictionary ? 6 : 2), f && 4, this.s);\n        if (this.v)\n            zlh(raw, this.o), this.v = 0;\n        if (f)\n            wbytes(raw, raw.length - 4, this.c.d());\n        this.ondata(raw, f);\n    };\n    return Zlib;\n}());\nexport { Zlib };\n/**\n * Asynchronous streaming Zlib compression\n */\nvar AsyncZlib = /*#__PURE__*/ (function () {\n    function AsyncZlib(opts, cb) {\n        astrmify([\n            bDflt,\n            zle,\n            function () { return [astrm, Deflate, Zlib]; }\n        ], this, StrmOpt.call(this, opts, cb), function (ev) {\n            var strm = new Zlib(ev.data);\n            onmessage = astrm(strm);\n        }, 10);\n    }\n    return AsyncZlib;\n}());\nexport { AsyncZlib };\nexport function zlib(data, opts, cb) {\n    if (!cb)\n        cb = opts, opts = {};\n    if (typeof cb != 'function')\n        err(7);\n    return cbify(data, opts, [\n        bDflt,\n        zle,\n        function () { return [zlibSync]; }\n    ], function (ev) { return pbf(zlibSync(ev.data[0], ev.data[1])); }, 4, cb);\n}\n/**\n * Compress data with Zlib\n * @param data The data to compress\n * @param opts The compression options\n * @returns The zlib-compressed version of the data\n */\nexport function zlibSync(data, opts) {\n    if (!opts)\n        opts = {};\n    var a = adler();\n    a.p(data);\n    var d = dopt(data, opts, opts.dictionary ? 6 : 2, 4);\n    return zlh(d, opts), wbytes(d, d.length - 4, a.d()), d;\n}\n/**\n * Streaming Zlib decompression\n */\nvar Unzlib = /*#__PURE__*/ (function () {\n    function Unzlib(opts, cb) {\n        Inflate.call(this, opts, cb);\n        this.v = opts && opts.dictionary ? 2 : 1;\n    }\n    /**\n     * Pushes a chunk to be unzlibbed\n     * @param chunk The chunk to push\n     * @param final Whether this is the last chunk\n     */\n    Unzlib.prototype.push = function (chunk, final) {\n        Inflate.prototype.e.call(this, chunk);\n        if (this.v) {\n            if (this.p.length < 6 && !final)\n                return;\n            this.p = this.p.subarray(zls(this.p, this.v - 1)), this.v = 0;\n        }\n        if (final) {\n            if (this.p.length < 4)\n                err(6, 'invalid zlib data');\n            this.p = this.p.subarray(0, -4);\n        }\n        // necessary to prevent TS from using the closure value\n        // This allows for workerization to function correctly\n        Inflate.prototype.c.call(this, final);\n    };\n    return Unzlib;\n}());\nexport { Unzlib };\n/**\n * Asynchronous streaming Zlib decompression\n */\nvar AsyncUnzlib = /*#__PURE__*/ (function () {\n    function AsyncUnzlib(opts, cb) {\n        astrmify([\n            bInflt,\n            zule,\n            function () { return [astrm, Inflate, Unzlib]; }\n        ], this, StrmOpt.call(this, opts, cb), function (ev) {\n            var strm = new Unzlib(ev.data);\n            onmessage = astrm(strm);\n        }, 11);\n    }\n    return AsyncUnzlib;\n}());\nexport { AsyncUnzlib };\nexport function unzlib(data, opts, cb) {\n    if (!cb)\n        cb = opts, opts = {};\n    if (typeof cb != 'function')\n        err(7);\n    return cbify(data, opts, [\n        bInflt,\n        zule,\n        function () { return [unzlibSync]; }\n    ], function (ev) { return pbf(unzlibSync(ev.data[0], gopt(ev.data[1]))); }, 5, cb);\n}\n/**\n * Expands Zlib data\n * @param data The data to decompress\n * @param opts The decompression options\n * @returns The decompressed version of the data\n */\nexport function unzlibSync(data, opts) {\n    return inflt(data.subarray(zls(data, opts && opts.dictionary), -4), { i: 2 }, opts && opts.out, opts && opts.dictionary);\n}\n// Default algorithm for compression (used because having a known output size allows faster decompression)\nexport { gzip as compress, AsyncGzip as AsyncCompress };\nexport { gzipSync as compressSync, Gzip as Compress };\n/**\n * Streaming GZIP, Zlib, or raw DEFLATE decompression\n */\nvar Decompress = /*#__PURE__*/ (function () {\n    function Decompress(opts, cb) {\n        this.G = Gunzip;\n        this.I = Inflate;\n        this.Z = Unzlib;\n        this.o = StrmOpt.call(this, opts, cb) || {};\n    }\n    /**\n     * Pushes a chunk to be decompressed\n     * @param chunk The chunk to push\n     * @param final Whether this is the last chunk\n     */\n    Decompress.prototype.push = function (chunk, final) {\n        if (!this.ondata)\n            err(5);\n        if (!this.s) {\n            if (this.p && this.p.length) {\n                var n = new u8(this.p.length + chunk.length);\n                n.set(this.p), n.set(chunk, this.p.length);\n            }\n            else\n                this.p = chunk;\n            if (this.p.length > 2) {\n                var _this_2 = this;\n                // enables reuse of this method by AsyncDecompress\n                var cb = function () { _this_2.ondata.apply(_this_2, arguments); };\n                this.s = (this.p[0] == 31 && this.p[1] == 139 && this.p[2] == 8)\n                    ? new this.G(this.o, cb)\n                    : ((this.p[0] & 15) != 8 || (this.p[0] >> 4) > 7 || ((this.p[0] << 8 | this.p[1]) % 31))\n                        ? new this.I(this.o, cb)\n                        : new this.Z(this.o, cb);\n                this.s.push(this.p, final);\n                this.p = null;\n            }\n        }\n        else\n            this.s.push(chunk, final);\n    };\n    return Decompress;\n}());\nexport { Decompress };\n/**\n * Asynchronous streaming GZIP, Zlib, or raw DEFLATE decompression\n */\nvar AsyncDecompress = /*#__PURE__*/ (function () {\n    function AsyncDecompress(opts, cb) {\n        this.G = AsyncGunzip;\n        this.I = AsyncInflate;\n        this.Z = AsyncUnzlib;\n        Decompress.call(this, opts, cb);\n    }\n    /**\n     * Pushes a chunk to be decompressed\n     * @param chunk The chunk to push\n     * @param final Whether this is the last chunk\n     */\n    AsyncDecompress.prototype.push = function (chunk, final) {\n        Decompress.prototype.push.call(this, chunk, final);\n    };\n    return AsyncDecompress;\n}());\nexport { AsyncDecompress };\nexport function decompress(data, opts, cb) {\n    if (!cb)\n        cb = opts, opts = {};\n    if (typeof cb != 'function')\n        err(7);\n    return (data[0] == 31 && data[1] == 139 && data[2] == 8)\n        ? gunzip(data, opts, cb)\n        : ((data[0] & 15) != 8 || (data[0] >> 4) > 7 || ((data[0] << 8 | data[1]) % 31))\n            ? inflate(data, opts, cb)\n            : unzlib(data, opts, cb);\n}\n/**\n * Expands compressed GZIP, Zlib, or raw DEFLATE data, automatically detecting the format\n * @param data The data to decompress\n * @param opts The decompression options\n * @returns The decompressed version of the data\n */\nexport function decompressSync(data, opts) {\n    return (data[0] == 31 && data[1] == 139 && data[2] == 8)\n        ? gunzipSync(data, opts)\n        : ((data[0] & 15) != 8 || (data[0] >> 4) > 7 || ((data[0] << 8 | data[1]) % 31))\n            ? inflateSync(data, opts)\n            : unzlibSync(data, opts);\n}\n// flatten a directory structure\nvar fltn = function (d, p, t, o) {\n    for (var k in d) {\n        var val = d[k], n = p + k, op = o;\n        if (Array.isArray(val))\n            op = mrg(o, val[1]), val = val[0];\n        if (val instanceof u8)\n            t[n] = [val, op];\n        else {\n            t[n += '/'] = [new u8(0), op];\n            fltn(val, n, t, o);\n        }\n    }\n};\n// text encoder\nvar te = typeof TextEncoder != 'undefined' && /*#__PURE__*/ new TextEncoder();\n// text decoder\nvar td = typeof TextDecoder != 'undefined' && /*#__PURE__*/ new TextDecoder();\n// text decoder stream\nvar tds = 0;\ntry {\n    td.decode(et, { stream: true });\n    tds = 1;\n}\ncatch (e) { }\n// decode UTF8\nvar dutf8 = function (d) {\n    for (var r = '', i = 0;;) {\n        var c = d[i++];\n        var eb = (c > 127) + (c > 223) + (c > 239);\n        if (i + eb > d.length)\n            return { s: r, r: slc(d, i - 1) };\n        if (!eb)\n            r += String.fromCharCode(c);\n        else if (eb == 3) {\n            c = ((c & 15) << 18 | (d[i++] & 63) << 12 | (d[i++] & 63) << 6 | (d[i++] & 63)) - 65536,\n                r += String.fromCharCode(55296 | (c >> 10), 56320 | (c & 1023));\n        }\n        else if (eb & 1)\n            r += String.fromCharCode((c & 31) << 6 | (d[i++] & 63));\n        else\n            r += String.fromCharCode((c & 15) << 12 | (d[i++] & 63) << 6 | (d[i++] & 63));\n    }\n};\n/**\n * Streaming UTF-8 decoding\n */\nvar DecodeUTF8 = /*#__PURE__*/ (function () {\n    /**\n     * Creates a UTF-8 decoding stream\n     * @param cb The callback to call whenever data is decoded\n     */\n    function DecodeUTF8(cb) {\n        this.ondata = cb;\n        if (tds)\n            this.t = new TextDecoder();\n        else\n            this.p = et;\n    }\n    /**\n     * Pushes a chunk to be decoded from UTF-8 binary\n     * @param chunk The chunk to push\n     * @param final Whether this is the last chunk\n     */\n    DecodeUTF8.prototype.push = function (chunk, final) {\n        if (!this.ondata)\n            err(5);\n        final = !!final;\n        if (this.t) {\n            this.ondata(this.t.decode(chunk, { stream: true }), final);\n            if (final) {\n                if (this.t.decode().length)\n                    err(8);\n                this.t = null;\n            }\n            return;\n        }\n        if (!this.p)\n            err(4);\n        var dat = new u8(this.p.length + chunk.length);\n        dat.set(this.p);\n        dat.set(chunk, this.p.length);\n        var _a = dutf8(dat), s = _a.s, r = _a.r;\n        if (final) {\n            if (r.length)\n                err(8);\n            this.p = null;\n        }\n        else\n            this.p = r;\n        this.ondata(s, final);\n    };\n    return DecodeUTF8;\n}());\nexport { DecodeUTF8 };\n/**\n * Streaming UTF-8 encoding\n */\nvar EncodeUTF8 = /*#__PURE__*/ (function () {\n    /**\n     * Creates a UTF-8 decoding stream\n     * @param cb The callback to call whenever data is encoded\n     */\n    function EncodeUTF8(cb) {\n        this.ondata = cb;\n    }\n    /**\n     * Pushes a chunk to be encoded to UTF-8\n     * @param chunk The string data to push\n     * @param final Whether this is the last chunk\n     */\n    EncodeUTF8.prototype.push = function (chunk, final) {\n        if (!this.ondata)\n            err(5);\n        if (this.d)\n            err(4);\n        this.ondata(strToU8(chunk), this.d = final || false);\n    };\n    return EncodeUTF8;\n}());\nexport { EncodeUTF8 };\n/**\n * Converts a string into a Uint8Array for use with compression/decompression methods\n * @param str The string to encode\n * @param latin1 Whether or not to interpret the data as Latin-1. This should\n *               not need to be true unless decoding a binary string.\n * @returns The string encoded in UTF-8/Latin-1 binary\n */\nexport function strToU8(str, latin1) {\n    if (latin1) {\n        var ar_1 = new u8(str.length);\n        for (var i = 0; i < str.length; ++i)\n            ar_1[i] = str.charCodeAt(i);\n        return ar_1;\n    }\n    if (te)\n        return te.encode(str);\n    var l = str.length;\n    var ar = new u8(str.length + (str.length >> 1));\n    var ai = 0;\n    var w = function (v) { ar[ai++] = v; };\n    for (var i = 0; i < l; ++i) {\n        if (ai + 5 > ar.length) {\n            var n = new u8(ai + 8 + ((l - i) << 1));\n            n.set(ar);\n            ar = n;\n        }\n        var c = str.charCodeAt(i);\n        if (c < 128 || latin1)\n            w(c);\n        else if (c < 2048)\n            w(192 | (c >> 6)), w(128 | (c & 63));\n        else if (c > 55295 && c < 57344)\n            c = 65536 + (c & 1023 << 10) | (str.charCodeAt(++i) & 1023),\n                w(240 | (c >> 18)), w(128 | ((c >> 12) & 63)), w(128 | ((c >> 6) & 63)), w(128 | (c & 63));\n        else\n            w(224 | (c >> 12)), w(128 | ((c >> 6) & 63)), w(128 | (c & 63));\n    }\n    return slc(ar, 0, ai);\n}\n/**\n * Converts a Uint8Array to a string\n * @param dat The data to decode to string\n * @param latin1 Whether or not to interpret the data as Latin-1. This should\n *               not need to be true unless encoding to binary string.\n * @returns The original UTF-8/Latin-1 string\n */\nexport function strFromU8(dat, latin1) {\n    if (latin1) {\n        var r = '';\n        for (var i = 0; i < dat.length; i += 16384)\n            r += String.fromCharCode.apply(null, dat.subarray(i, i + 16384));\n        return r;\n    }\n    else if (td) {\n        return td.decode(dat);\n    }\n    else {\n        var _a = dutf8(dat), s = _a.s, r = _a.r;\n        if (r.length)\n            err(8);\n        return s;\n    }\n}\n;\n// deflate bit flag\nvar dbf = function (l) { return l == 1 ? 3 : l < 6 ? 2 : l == 9 ? 1 : 0; };\n// skip local zip header\nvar slzh = function (d, b) { return b + 30 + b2(d, b + 26) + b2(d, b + 28); };\n// read zip header\nvar zh = function (d, b, z) {\n    var fnl = b2(d, b + 28), fn = strFromU8(d.subarray(b + 46, b + 46 + fnl), !(b2(d, b + 8) & 2048)), es = b + 46 + fnl, bs = b4(d, b + 20);\n    var _a = z && bs == 4294967295 ? z64e(d, es) : [bs, b4(d, b + 24), b4(d, b + 42)], sc = _a[0], su = _a[1], off = _a[2];\n    return [b2(d, b + 10), sc, su, fn, es + b2(d, b + 30) + b2(d, b + 32), off];\n};\n// read zip64 extra field\nvar z64e = function (d, b) {\n    for (; b2(d, b) != 1; b += 4 + b2(d, b + 2))\n        ;\n    return [b8(d, b + 12), b8(d, b + 4), b8(d, b + 20)];\n};\n// extra field length\nvar exfl = function (ex) {\n    var le = 0;\n    if (ex) {\n        for (var k in ex) {\n            var l = ex[k].length;\n            if (l > 65535)\n                err(9);\n            le += l + 4;\n        }\n    }\n    return le;\n};\n// write zip header\nvar wzh = function (d, b, f, fn, u, c, ce, co) {\n    var fl = fn.length, ex = f.extra, col = co && co.length;\n    var exl = exfl(ex);\n    wbytes(d, b, ce != null ? 0x2014B50 : 0x4034B50), b += 4;\n    if (ce != null)\n        d[b++] = 20, d[b++] = f.os;\n    d[b] = 20, b += 2; // spec compliance? what's that?\n    d[b++] = (f.flag << 1) | (c < 0 && 8), d[b++] = u && 8;\n    d[b++] = f.compression & 255, d[b++] = f.compression >> 8;\n    var dt = new Date(f.mtime == null ? Date.now() : f.mtime), y = dt.getFullYear() - 1980;\n    if (y < 0 || y > 119)\n        err(10);\n    wbytes(d, b, (y << 25) | ((dt.getMonth() + 1) << 21) | (dt.getDate() << 16) | (dt.getHours() << 11) | (dt.getMinutes() << 5) | (dt.getSeconds() >> 1)), b += 4;\n    if (c != -1) {\n        wbytes(d, b, f.crc);\n        wbytes(d, b + 4, c < 0 ? -c - 2 : c);\n        wbytes(d, b + 8, f.size);\n    }\n    wbytes(d, b + 12, fl);\n    wbytes(d, b + 14, exl), b += 16;\n    if (ce != null) {\n        wbytes(d, b, col);\n        wbytes(d, b + 6, f.attrs);\n        wbytes(d, b + 10, ce), b += 14;\n    }\n    d.set(fn, b);\n    b += fl;\n    if (exl) {\n        for (var k in ex) {\n            var exf = ex[k], l = exf.length;\n            wbytes(d, b, +k);\n            wbytes(d, b + 2, l);\n            d.set(exf, b + 4), b += 4 + l;\n        }\n    }\n    if (col)\n        d.set(co, b), b += col;\n    return b;\n};\n// write zip footer (end of central directory)\nvar wzf = function (o, b, c, d, e) {\n    wbytes(o, b, 0x6054B50); // skip disk\n    wbytes(o, b + 8, c);\n    wbytes(o, b + 10, c);\n    wbytes(o, b + 12, d);\n    wbytes(o, b + 16, e);\n};\n/**\n * A pass-through stream to keep data uncompressed in a ZIP archive.\n */\nvar ZipPassThrough = /*#__PURE__*/ (function () {\n    /**\n     * Creates a pass-through stream that can be added to ZIP archives\n     * @param filename The filename to associate with this data stream\n     */\n    function ZipPassThrough(filename) {\n        this.filename = filename;\n        this.c = crc();\n        this.size = 0;\n        this.compression = 0;\n    }\n    /**\n     * Processes a chunk and pushes to the output stream. You can override this\n     * method in a subclass for custom behavior, but by default this passes\n     * the data through. You must call this.ondata(err, chunk, final) at some\n     * point in this method.\n     * @param chunk The chunk to process\n     * @param final Whether this is the last chunk\n     */\n    ZipPassThrough.prototype.process = function (chunk, final) {\n        this.ondata(null, chunk, final);\n    };\n    /**\n     * Pushes a chunk to be added. If you are subclassing this with a custom\n     * compression algorithm, note that you must push data from the source\n     * file only, pre-compression.\n     * @param chunk The chunk to push\n     * @param final Whether this is the last chunk\n     */\n    ZipPassThrough.prototype.push = function (chunk, final) {\n        if (!this.ondata)\n            err(5);\n        this.c.p(chunk);\n        this.size += chunk.length;\n        if (final)\n            this.crc = this.c.d();\n        this.process(chunk, final || false);\n    };\n    return ZipPassThrough;\n}());\nexport { ZipPassThrough };\n// I don't extend because TypeScript extension adds 1kB of runtime bloat\n/**\n * Streaming DEFLATE compression for ZIP archives. Prefer using AsyncZipDeflate\n * for better performance\n */\nvar ZipDeflate = /*#__PURE__*/ (function () {\n    /**\n     * Creates a DEFLATE stream that can be added to ZIP archives\n     * @param filename The filename to associate with this data stream\n     * @param opts The compression options\n     */\n    function ZipDeflate(filename, opts) {\n        var _this_1 = this;\n        if (!opts)\n            opts = {};\n        ZipPassThrough.call(this, filename);\n        this.d = new Deflate(opts, function (dat, final) {\n            _this_1.ondata(null, dat, final);\n        });\n        this.compression = 8;\n        this.flag = dbf(opts.level);\n    }\n    ZipDeflate.prototype.process = function (chunk, final) {\n        try {\n            this.d.push(chunk, final);\n        }\n        catch (e) {\n            this.ondata(e, null, final);\n        }\n    };\n    /**\n     * Pushes a chunk to be deflated\n     * @param chunk The chunk to push\n     * @param final Whether this is the last chunk\n     */\n    ZipDeflate.prototype.push = function (chunk, final) {\n        ZipPassThrough.prototype.push.call(this, chunk, final);\n    };\n    return ZipDeflate;\n}());\nexport { ZipDeflate };\n/**\n * Asynchronous streaming DEFLATE compression for ZIP archives\n */\nvar AsyncZipDeflate = /*#__PURE__*/ (function () {\n    /**\n     * Creates an asynchronous DEFLATE stream that can be added to ZIP archives\n     * @param filename The filename to associate with this data stream\n     * @param opts The compression options\n     */\n    function AsyncZipDeflate(filename, opts) {\n        var _this_1 = this;\n        if (!opts)\n            opts = {};\n        ZipPassThrough.call(this, filename);\n        this.d = new AsyncDeflate(opts, function (err, dat, final) {\n            _this_1.ondata(err, dat, final);\n        });\n        this.compression = 8;\n        this.flag = dbf(opts.level);\n        this.terminate = this.d.terminate;\n    }\n    AsyncZipDeflate.prototype.process = function (chunk, final) {\n        this.d.push(chunk, final);\n    };\n    /**\n     * Pushes a chunk to be deflated\n     * @param chunk The chunk to push\n     * @param final Whether this is the last chunk\n     */\n    AsyncZipDeflate.prototype.push = function (chunk, final) {\n        ZipPassThrough.prototype.push.call(this, chunk, final);\n    };\n    return AsyncZipDeflate;\n}());\nexport { AsyncZipDeflate };\n// TODO: Better tree shaking\n/**\n * A zippable archive to which files can incrementally be added\n */\nvar Zip = /*#__PURE__*/ (function () {\n    /**\n     * Creates an empty ZIP archive to which files can be added\n     * @param cb The callback to call whenever data for the generated ZIP archive\n     *           is available\n     */\n    function Zip(cb) {\n        this.ondata = cb;\n        this.u = [];\n        this.d = 1;\n    }\n    /**\n     * Adds a file to the ZIP archive\n     * @param file The file stream to add\n     */\n    Zip.prototype.add = function (file) {\n        var _this_1 = this;\n        if (!this.ondata)\n            err(5);\n        // finishing or finished\n        if (this.d & 2)\n            this.ondata(err(4 + (this.d & 1) * 8, 0, 1), null, false);\n        else {\n            var f = strToU8(file.filename), fl_1 = f.length;\n            var com = file.comment, o = com && strToU8(com);\n            var u = fl_1 != file.filename.length || (o && (com.length != o.length));\n            var hl_1 = fl_1 + exfl(file.extra) + 30;\n            if (fl_1 > 65535)\n                this.ondata(err(11, 0, 1), null, false);\n            var header = new u8(hl_1);\n            wzh(header, 0, file, f, u, -1);\n            var chks_1 = [header];\n            var pAll_1 = function () {\n                for (var _i = 0, chks_2 = chks_1; _i < chks_2.length; _i++) {\n                    var chk = chks_2[_i];\n                    _this_1.ondata(null, chk, false);\n                }\n                chks_1 = [];\n            };\n            var tr_1 = this.d;\n            this.d = 0;\n            var ind_1 = this.u.length;\n            var uf_1 = mrg(file, {\n                f: f,\n                u: u,\n                o: o,\n                t: function () {\n                    if (file.terminate)\n                        file.terminate();\n                },\n                r: function () {\n                    pAll_1();\n                    if (tr_1) {\n                        var nxt = _this_1.u[ind_1 + 1];\n                        if (nxt)\n                            nxt.r();\n                        else\n                            _this_1.d = 1;\n                    }\n                    tr_1 = 1;\n                }\n            });\n            var cl_1 = 0;\n            file.ondata = function (err, dat, final) {\n                if (err) {\n                    _this_1.ondata(err, dat, final);\n                    _this_1.terminate();\n                }\n                else {\n                    cl_1 += dat.length;\n                    chks_1.push(dat);\n                    if (final) {\n                        var dd = new u8(16);\n                        wbytes(dd, 0, 0x8074B50);\n                        wbytes(dd, 4, file.crc);\n                        wbytes(dd, 8, cl_1);\n                        wbytes(dd, 12, file.size);\n                        chks_1.push(dd);\n                        uf_1.c = cl_1, uf_1.b = hl_1 + cl_1 + 16, uf_1.crc = file.crc, uf_1.size = file.size;\n                        if (tr_1)\n                            uf_1.r();\n                        tr_1 = 1;\n                    }\n                    else if (tr_1)\n                        pAll_1();\n                }\n            };\n            this.u.push(uf_1);\n        }\n    };\n    /**\n     * Ends the process of adding files and prepares to emit the final chunks.\n     * This *must* be called after adding all desired files for the resulting\n     * ZIP file to work properly.\n     */\n    Zip.prototype.end = function () {\n        var _this_1 = this;\n        if (this.d & 2) {\n            this.ondata(err(4 + (this.d & 1) * 8, 0, 1), null, true);\n            return;\n        }\n        if (this.d)\n            this.e();\n        else\n            this.u.push({\n                r: function () {\n                    if (!(_this_1.d & 1))\n                        return;\n                    _this_1.u.splice(-1, 1);\n                    _this_1.e();\n                },\n                t: function () { }\n            });\n        this.d = 3;\n    };\n    Zip.prototype.e = function () {\n        var bt = 0, l = 0, tl = 0;\n        for (var _i = 0, _a = this.u; _i < _a.length; _i++) {\n            var f = _a[_i];\n            tl += 46 + f.f.length + exfl(f.extra) + (f.o ? f.o.length : 0);\n        }\n        var out = new u8(tl + 22);\n        for (var _b = 0, _c = this.u; _b < _c.length; _b++) {\n            var f = _c[_b];\n            wzh(out, bt, f, f.f, f.u, -f.c - 2, l, f.o);\n            bt += 46 + f.f.length + exfl(f.extra) + (f.o ? f.o.length : 0), l += f.b;\n        }\n        wzf(out, bt, this.u.length, tl, l);\n        this.ondata(null, out, true);\n        this.d = 2;\n    };\n    /**\n     * A method to terminate any internal workers used by the stream. Subsequent\n     * calls to add() will fail.\n     */\n    Zip.prototype.terminate = function () {\n        for (var _i = 0, _a = this.u; _i < _a.length; _i++) {\n            var f = _a[_i];\n            f.t();\n        }\n        this.d = 2;\n    };\n    return Zip;\n}());\nexport { Zip };\nexport function zip(data, opts, cb) {\n    if (!cb)\n        cb = opts, opts = {};\n    if (typeof cb != 'function')\n        err(7);\n    var r = {};\n    fltn(data, '', r, opts);\n    var k = Object.keys(r);\n    var lft = k.length, o = 0, tot = 0;\n    var slft = lft, files = new Array(lft);\n    var term = [];\n    var tAll = function () {\n        for (var i = 0; i < term.length; ++i)\n            term[i]();\n    };\n    var cbd = function (a, b) {\n        mt(function () { cb(a, b); });\n    };\n    mt(function () { cbd = cb; });\n    var cbf = function () {\n        var out = new u8(tot + 22), oe = o, cdl = tot - o;\n        tot = 0;\n        for (var i = 0; i < slft; ++i) {\n            var f = files[i];\n            try {\n                var l = f.c.length;\n                wzh(out, tot, f, f.f, f.u, l);\n                var badd = 30 + f.f.length + exfl(f.extra);\n                var loc = tot + badd;\n                out.set(f.c, loc);\n                wzh(out, o, f, f.f, f.u, l, tot, f.m), o += 16 + badd + (f.m ? f.m.length : 0), tot = loc + l;\n            }\n            catch (e) {\n                return cbd(e, null);\n            }\n        }\n        wzf(out, o, files.length, cdl, oe);\n        cbd(null, out);\n    };\n    if (!lft)\n        cbf();\n    var _loop_1 = function (i) {\n        var fn = k[i];\n        var _a = r[fn], file = _a[0], p = _a[1];\n        var c = crc(), size = file.length;\n        c.p(file);\n        var f = strToU8(fn), s = f.length;\n        var com = p.comment, m = com && strToU8(com), ms = m && m.length;\n        var exl = exfl(p.extra);\n        var compression = p.level == 0 ? 0 : 8;\n        var cbl = function (e, d) {\n            if (e) {\n                tAll();\n                cbd(e, null);\n            }\n            else {\n                var l = d.length;\n                files[i] = mrg(p, {\n                    size: size,\n                    crc: c.d(),\n                    c: d,\n                    f: f,\n                    m: m,\n                    u: s != fn.length || (m && (com.length != ms)),\n                    compression: compression\n                });\n                o += 30 + s + exl + l;\n                tot += 76 + 2 * (s + exl) + (ms || 0) + l;\n                if (!--lft)\n                    cbf();\n            }\n        };\n        if (s > 65535)\n            cbl(err(11, 0, 1), null);\n        if (!compression)\n            cbl(null, file);\n        else if (size < 160000) {\n            try {\n                cbl(null, deflateSync(file, p));\n            }\n            catch (e) {\n                cbl(e, null);\n            }\n        }\n        else\n            term.push(deflate(file, p, cbl));\n    };\n    // Cannot use lft because it can decrease\n    for (var i = 0; i < slft; ++i) {\n        _loop_1(i);\n    }\n    return tAll;\n}\n/**\n * Synchronously creates a ZIP file. Prefer using `zip` for better performance\n * with more than one file.\n * @param data The directory structure for the ZIP archive\n * @param opts The main options, merged with per-file options\n * @returns The generated ZIP archive\n */\nexport function zipSync(data, opts) {\n    if (!opts)\n        opts = {};\n    var r = {};\n    var files = [];\n    fltn(data, '', r, opts);\n    var o = 0;\n    var tot = 0;\n    for (var fn in r) {\n        var _a = r[fn], file = _a[0], p = _a[1];\n        var compression = p.level == 0 ? 0 : 8;\n        var f = strToU8(fn), s = f.length;\n        var com = p.comment, m = com && strToU8(com), ms = m && m.length;\n        var exl = exfl(p.extra);\n        if (s > 65535)\n            err(11);\n        var d = compression ? deflateSync(file, p) : file, l = d.length;\n        var c = crc();\n        c.p(file);\n        files.push(mrg(p, {\n            size: file.length,\n            crc: c.d(),\n            c: d,\n            f: f,\n            m: m,\n            u: s != fn.length || (m && (com.length != ms)),\n            o: o,\n            compression: compression\n        }));\n        o += 30 + s + exl + l;\n        tot += 76 + 2 * (s + exl) + (ms || 0) + l;\n    }\n    var out = new u8(tot + 22), oe = o, cdl = tot - o;\n    for (var i = 0; i < files.length; ++i) {\n        var f = files[i];\n        wzh(out, f.o, f, f.f, f.u, f.c.length);\n        var badd = 30 + f.f.length + exfl(f.extra);\n        out.set(f.c, f.o + badd);\n        wzh(out, o, f, f.f, f.u, f.c.length, f.o, f.m), o += 16 + badd + (f.m ? f.m.length : 0);\n    }\n    wzf(out, o, files.length, cdl, oe);\n    return out;\n}\n/**\n * Streaming pass-through decompression for ZIP archives\n */\nvar UnzipPassThrough = /*#__PURE__*/ (function () {\n    function UnzipPassThrough() {\n    }\n    UnzipPassThrough.prototype.push = function (data, final) {\n        this.ondata(null, data, final);\n    };\n    UnzipPassThrough.compression = 0;\n    return UnzipPassThrough;\n}());\nexport { UnzipPassThrough };\n/**\n * Streaming DEFLATE decompression for ZIP archives. Prefer AsyncZipInflate for\n * better performance.\n */\nvar UnzipInflate = /*#__PURE__*/ (function () {\n    /**\n     * Creates a DEFLATE decompression that can be used in ZIP archives\n     */\n    function UnzipInflate() {\n        var _this_1 = this;\n        this.i = new Inflate(function (dat, final) {\n            _this_1.ondata(null, dat, final);\n        });\n    }\n    UnzipInflate.prototype.push = function (data, final) {\n        try {\n            this.i.push(data, final);\n        }\n        catch (e) {\n            this.ondata(e, null, final);\n        }\n    };\n    UnzipInflate.compression = 8;\n    return UnzipInflate;\n}());\nexport { UnzipInflate };\n/**\n * Asynchronous streaming DEFLATE decompression for ZIP archives\n */\nvar AsyncUnzipInflate = /*#__PURE__*/ (function () {\n    /**\n     * Creates a DEFLATE decompression that can be used in ZIP archives\n     */\n    function AsyncUnzipInflate(_, sz) {\n        var _this_1 = this;\n        if (sz < 320000) {\n            this.i = new Inflate(function (dat, final) {\n                _this_1.ondata(null, dat, final);\n            });\n        }\n        else {\n            this.i = new AsyncInflate(function (err, dat, final) {\n                _this_1.ondata(err, dat, final);\n            });\n            this.terminate = this.i.terminate;\n        }\n    }\n    AsyncUnzipInflate.prototype.push = function (data, final) {\n        if (this.i.terminate)\n            data = slc(data, 0);\n        this.i.push(data, final);\n    };\n    AsyncUnzipInflate.compression = 8;\n    return AsyncUnzipInflate;\n}());\nexport { AsyncUnzipInflate };\n/**\n * A ZIP archive decompression stream that emits files as they are discovered\n */\nvar Unzip = /*#__PURE__*/ (function () {\n    /**\n     * Creates a ZIP decompression stream\n     * @param cb The callback to call whenever a file in the ZIP archive is found\n     */\n    function Unzip(cb) {\n        this.onfile = cb;\n        this.k = [];\n        this.o = {\n            0: UnzipPassThrough\n        };\n        this.p = et;\n    }\n    /**\n     * Pushes a chunk to be unzipped\n     * @param chunk The chunk to push\n     * @param final Whether this is the last chunk\n     */\n    Unzip.prototype.push = function (chunk, final) {\n        var _this_1 = this;\n        if (!this.onfile)\n            err(5);\n        if (!this.p)\n            err(4);\n        if (this.c > 0) {\n            var len = Math.min(this.c, chunk.length);\n            var toAdd = chunk.subarray(0, len);\n            this.c -= len;\n            if (this.d)\n                this.d.push(toAdd, !this.c);\n            else\n                this.k[0].push(toAdd);\n            chunk = chunk.subarray(len);\n            if (chunk.length)\n                return this.push(chunk, final);\n        }\n        else {\n            var f = 0, i = 0, is = void 0, buf = void 0;\n            if (!this.p.length)\n                buf = chunk;\n            else if (!chunk.length)\n                buf = this.p;\n            else {\n                buf = new u8(this.p.length + chunk.length);\n                buf.set(this.p), buf.set(chunk, this.p.length);\n            }\n            var l = buf.length, oc = this.c, add = oc && this.d;\n            var _loop_2 = function () {\n                var _a;\n                var sig = b4(buf, i);\n                if (sig == 0x4034B50) {\n                    f = 1, is = i;\n                    this_1.d = null;\n                    this_1.c = 0;\n                    var bf = b2(buf, i + 6), cmp_1 = b2(buf, i + 8), u = bf & 2048, dd = bf & 8, fnl = b2(buf, i + 26), es = b2(buf, i + 28);\n                    if (l > i + 30 + fnl + es) {\n                        var chks_3 = [];\n                        this_1.k.unshift(chks_3);\n                        f = 2;\n                        var sc_1 = b4(buf, i + 18), su_1 = b4(buf, i + 22);\n                        var fn_1 = strFromU8(buf.subarray(i + 30, i += 30 + fnl), !u);\n                        if (sc_1 == 4294967295) {\n                            _a = dd ? [-2] : z64e(buf, i), sc_1 = _a[0], su_1 = _a[1];\n                        }\n                        else if (dd)\n                            sc_1 = -1;\n                        i += es;\n                        this_1.c = sc_1;\n                        var d_1;\n                        var file_1 = {\n                            name: fn_1,\n                            compression: cmp_1,\n                            start: function () {\n                                if (!file_1.ondata)\n                                    err(5);\n                                if (!sc_1)\n                                    file_1.ondata(null, et, true);\n                                else {\n                                    var ctr = _this_1.o[cmp_1];\n                                    if (!ctr)\n                                        file_1.ondata(err(14, 'unknown compression type ' + cmp_1, 1), null, false);\n                                    d_1 = sc_1 < 0 ? new ctr(fn_1) : new ctr(fn_1, sc_1, su_1);\n                                    d_1.ondata = function (err, dat, final) { file_1.ondata(err, dat, final); };\n                                    for (var _i = 0, chks_4 = chks_3; _i < chks_4.length; _i++) {\n                                        var dat = chks_4[_i];\n                                        d_1.push(dat, false);\n                                    }\n                                    if (_this_1.k[0] == chks_3 && _this_1.c)\n                                        _this_1.d = d_1;\n                                    else\n                                        d_1.push(et, true);\n                                }\n                            },\n                            terminate: function () {\n                                if (d_1 && d_1.terminate)\n                                    d_1.terminate();\n                            }\n                        };\n                        if (sc_1 >= 0)\n                            file_1.size = sc_1, file_1.originalSize = su_1;\n                        this_1.onfile(file_1);\n                    }\n                    return \"break\";\n                }\n                else if (oc) {\n                    if (sig == 0x8074B50) {\n                        is = i += 12 + (oc == -2 && 8), f = 3, this_1.c = 0;\n                        return \"break\";\n                    }\n                    else if (sig == 0x2014B50) {\n                        is = i -= 4, f = 3, this_1.c = 0;\n                        return \"break\";\n                    }\n                }\n            };\n            var this_1 = this;\n            for (; i < l - 4; ++i) {\n                var state_1 = _loop_2();\n                if (state_1 === \"break\")\n                    break;\n            }\n            this.p = et;\n            if (oc < 0) {\n                var dat = f ? buf.subarray(0, is - 12 - (oc == -2 && 8) - (b4(buf, is - 16) == 0x8074B50 && 4)) : buf.subarray(0, i);\n                if (add)\n                    add.push(dat, !!f);\n                else\n                    this.k[+(f == 2)].push(dat);\n            }\n            if (f & 2)\n                return this.push(buf.subarray(i), final);\n            this.p = buf.subarray(i);\n        }\n        if (final) {\n            if (this.c)\n                err(13);\n            this.p = null;\n        }\n    };\n    /**\n     * Registers a decoder with the stream, allowing for files compressed with\n     * the compression type provided to be expanded correctly\n     * @param decoder The decoder constructor\n     */\n    Unzip.prototype.register = function (decoder) {\n        this.o[decoder.compression] = decoder;\n    };\n    return Unzip;\n}());\nexport { Unzip };\nvar mt = typeof queueMicrotask == 'function' ? queueMicrotask : typeof setTimeout == 'function' ? setTimeout : function (fn) { fn(); };\nexport function unzip(data, opts, cb) {\n    if (!cb)\n        cb = opts, opts = {};\n    if (typeof cb != 'function')\n        err(7);\n    var term = [];\n    var tAll = function () {\n        for (var i = 0; i < term.length; ++i)\n            term[i]();\n    };\n    var files = {};\n    var cbd = function (a, b) {\n        mt(function () { cb(a, b); });\n    };\n    mt(function () { cbd = cb; });\n    var e = data.length - 22;\n    for (; b4(data, e) != 0x6054B50; --e) {\n        if (!e || data.length - e > 65558) {\n            cbd(err(13, 0, 1), null);\n            return tAll;\n        }\n    }\n    ;\n    var lft = b2(data, e + 8);\n    if (lft) {\n        var c = lft;\n        var o = b4(data, e + 16);\n        var z = o == 4294967295 || c == 65535;\n        if (z) {\n            var ze = b4(data, e - 12);\n            z = b4(data, ze) == 0x6064B50;\n            if (z) {\n                c = lft = b4(data, ze + 32);\n                o = b4(data, ze + 48);\n            }\n        }\n        var fltr = opts && opts.filter;\n        var _loop_3 = function (i) {\n            var _a = zh(data, o, z), c_1 = _a[0], sc = _a[1], su = _a[2], fn = _a[3], no = _a[4], off = _a[5], b = slzh(data, off);\n            o = no;\n            var cbl = function (e, d) {\n                if (e) {\n                    tAll();\n                    cbd(e, null);\n                }\n                else {\n                    if (d)\n                        files[fn] = d;\n                    if (!--lft)\n                        cbd(null, files);\n                }\n            };\n            if (!fltr || fltr({\n                name: fn,\n                size: sc,\n                originalSize: su,\n                compression: c_1\n            })) {\n                if (!c_1)\n                    cbl(null, slc(data, b, b + sc));\n                else if (c_1 == 8) {\n                    var infl = data.subarray(b, b + sc);\n                    if (sc < 320000) {\n                        try {\n                            cbl(null, inflateSync(infl, { out: new u8(su) }));\n                        }\n                        catch (e) {\n                            cbl(e, null);\n                        }\n                    }\n                    else\n                        term.push(inflate(infl, { size: su }, cbl));\n                }\n                else\n                    cbl(err(14, 'unknown compression type ' + c_1, 1), null);\n            }\n            else\n                cbl(null, null);\n        };\n        for (var i = 0; i < c; ++i) {\n            _loop_3(i);\n        }\n    }\n    else\n        cbd(null, {});\n    return tAll;\n}\n/**\n * Synchronously decompresses a ZIP archive. Prefer using `unzip` for better\n * performance with more than one file.\n * @param data The raw compressed ZIP file\n * @param opts The ZIP extraction options\n * @returns The decompressed files\n */\nexport function unzipSync(data, opts) {\n    var files = {};\n    var e = data.length - 22;\n    for (; b4(data, e) != 0x6054B50; --e) {\n        if (!e || data.length - e > 65558)\n            err(13);\n    }\n    ;\n    var c = b2(data, e + 8);\n    if (!c)\n        return {};\n    var o = b4(data, e + 16);\n    var z = o == 4294967295 || c == 65535;\n    if (z) {\n        var ze = b4(data, e - 12);\n        z = b4(data, ze) == 0x6064B50;\n        if (z) {\n            c = b4(data, ze + 32);\n            o = b4(data, ze + 48);\n        }\n    }\n    var fltr = opts && opts.filter;\n    for (var i = 0; i < c; ++i) {\n        var _a = zh(data, o, z), c_2 = _a[0], sc = _a[1], su = _a[2], fn = _a[3], no = _a[4], off = _a[5], b = slzh(data, off);\n        o = no;\n        if (!fltr || fltr({\n            name: fn,\n            size: sc,\n            originalSize: su,\n            compression: c_2\n        })) {\n            if (!c_2)\n                files[fn] = slc(data, b, b + sc);\n            else if (c_2 == 8)\n                files[fn] = inflateSync(data.subarray(b, b + sc), { out: new u8(su) });\n            else\n                err(14, 'unknown compression type ' + c_2);\n        }\n    }\n    return files;\n}\n","import { AsyncInflate } from \"fflate\";\n\nclass DecompressionStreamPolyfill extends TransformStream<\n  Uint8Array,\n  Uint8Array\n> {\n  constructor(_format: \"deflate-raw\") {\n    let decompressor: AsyncInflate;\n\n    super({\n      start(controller) {\n        decompressor = new AsyncInflate();\n\n        decompressor.ondata = (err, chunk: Uint8Array, final: boolean) => {\n          if (err) {\n            controller.error(err);\n            return;\n          }\n\n          if (final) {\n            controller.terminate();\n          } else {\n            controller.enqueue(chunk);\n          }\n        };\n      },\n      transform(chunk, controller) {\n        try {\n          decompressor.push(chunk, false);\n        } catch (e) {\n          controller.error(\n            new Error(`DecompressionStreamPolyfill inflation failure: ${e}`)\n          );\n        }\n      },\n      flush() {\n        decompressor.push(new Uint8Array(), true);\n      },\n    });\n  }\n}\n\nexport default DecompressionStreamPolyfill as typeof DecompressionStream;\n"],"names":["ch2","u8","Uint8Array","u16","Uint16Array","i32","Int32Array","fleb","fdeb","clim","freb","eb","start","b","i","r","j","_a","fl","revfl","fd","rev","x","hMap","cd","mb","s","length","l","co","le","rvb","sv","r_1","v","m","flt","fdt","flrm","fdrm","max","a","bits","d","p","o","bits16","shft","slc","e","n","set","subarray","ec","err","ind","msg","nt","Error","code","captureStackTrace","inflt","dat","st","buf","dict","sl","dl","f","noBuf","noSt","cbuf","bl","nbuf","Math","final","pos","bt","lm","dm","lbt","dbt","tbts","type","t","hLit","hcLen","tl","ldt","clt","clb","clbmsk","clm","c","lt","dt","lms","dms","lpos","sym","add","dsym","end","shift","dend","min","et","wcln","fn","fnStr","td","toString","ks","slice","indexOf","lastIndexOf","replace","split","k","st_1","prototype","spInd","ch","wrkr","fns","init","id","cb","td_1","mrg","transfer","w","Worker","URL","createObjectURL","Blob","onmessage","data","ed","$e$","stack","postMessage","wk","buffer","push","constructor","cbfs","bInflt","inflateSync","pbf","gopt","out","size","dictionary","astrm","strm","ondata","ev","StrmOpt","opts","this","Inflate","bts","chunk","AsyncInflate","ext","terminate","call","Array","isArray","astrmify","TextDecoder","decode","stream","DecompressionStreamPolyfill","TransformStream","_format","decompressor","super","controller","error","enqueue","transform","flush"],"mappings":"AASA,IAAIA,EAAM,CAAA,EAqBNC,EAAKC,WAAYC,EAAMC,YAAaC,EAAMC,WAE1CC,EAAO,IAAIN,EAAG,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAgB,EAAG,EAAoB,IAE1IO,EAAO,IAAIP,EAAG,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAiB,EAAG,IAEjIQ,EAAO,IAAIR,EAAG,CAAC,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,KAE7ES,EAAO,SAAUC,EAAIC,GAErB,IADA,IAAIC,EAAI,IAAIV,EAAI,IACPW,EAAI,EAAGA,EAAI,KAAMA,EACtBD,EAAEC,GAAKF,GAAS,GAAKD,EAAGG,EAAI,GAGhC,IAAIC,EAAI,IAAIV,EAAIQ,EAAE,KAClB,IAASC,EAAI,EAAGA,EAAI,KAAMA,EACtB,IAAK,IAAIE,EAAIH,EAAEC,GAAIE,EAAIH,EAAEC,EAAI,KAAME,EAC/BD,EAAEC,GAAOA,EAAIH,EAAEC,IAAO,EAAKA,EAGnC,MAAO,CAAED,EAAGA,EAAGE,EAAGA,EACtB,EACIE,EAAKP,EAAKH,EAAM,GAAIW,EAAKD,EAAGJ,EAAGM,EAAQF,EAAGF,EAE9CG,EAAG,IAAM,IAAKC,EAAM,KAAO,GAI3B,IAHG,IAAqBC,EAAfV,EAAKF,EAAM,GAAYK,EAE5BQ,EAAM,IAAIlB,EAAI,OACTW,EAAI,EAAGA,EAAI,QAASA,EAAG,CAE5B,IAAIQ,GAAU,MAAJR,IAAe,GAAW,MAAJA,IAAe,EAE/CQ,GAAU,OADVA,GAAU,MAAJA,IAAe,GAAW,MAAJA,IAAe,KACtB,GAAW,KAAJA,IAAe,EAC3CD,EAAIP,KAAY,MAAJQ,IAAe,GAAW,IAAJA,IAAe,IAAO,CAC5D,CAIA,IAAIC,WAAkBC,EAAIC,EAAIV,GAO1B,IANA,IAAIW,EAAIF,EAAGG,OAEPb,EAAI,EAEJc,EAAI,IAAIzB,EAAIsB,GAETX,EAAIY,IAAKZ,EACRU,EAAGV,MACDc,EAAEJ,EAAGV,GAAK,GAGpB,IAIIe,EAJAC,EAAK,IAAI3B,EAAIsB,GACjB,IAAKX,EAAI,EAAGA,EAAIW,IAAMX,EAClBgB,EAAGhB,GAAMgB,EAAGhB,EAAI,GAAKc,EAAEd,EAAI,IAAO,EAGtC,GAAIC,EAAG,CAEHc,EAAK,IAAI1B,EAAI,GAAKsB,GAElB,IAAIM,EAAM,GAAKN,EACf,IAAKX,EAAI,EAAGA,EAAIY,IAAKZ,EAEjB,GAAIU,EAAGV,GAQH,IANA,IAAIkB,EAAMlB,GAAK,EAAKU,EAAGV,GAEnBmB,EAAMR,EAAKD,EAAGV,GAEdoB,EAAIJ,EAAGN,EAAGV,GAAK,MAAQmB,EAElBE,EAAID,GAAM,GAAKD,GAAO,EAAIC,GAAKC,IAAKD,EAEzCL,EAAGR,EAAIa,IAAMH,GAAOC,CAInC,MAGG,IADAH,EAAK,IAAI1B,EAAIuB,GACRZ,EAAI,EAAGA,EAAIY,IAAKZ,EACbU,EAAGV,KACHe,EAAGf,GAAKO,EAAIS,EAAGN,EAAGV,GAAK,OAAU,GAAKU,EAAGV,IAIrD,OAAOe,CACV,EAEGO,EAAM,IAAInC,EAAG,KACjB,IAASa,EAAI,EAAGA,EAAI,MAAOA,EACvBsB,EAAItB,GAAK,EACb,IAASA,EAAI,IAAKA,EAAI,MAAOA,EACzBsB,EAAItB,GAAK,EACb,IAASA,EAAI,IAAKA,EAAI,MAAOA,EACzBsB,EAAItB,GAAK,EACb,IAASA,EAAI,IAAKA,EAAI,MAAOA,EACzBsB,EAAItB,GAAK,EAEb,IAAIuB,EAAM,IAAIpC,EAAG,IACjB,IAASa,EAAI,EAAGA,EAAI,KAAMA,EACtBuB,EAAIvB,GAAK,EAEV,IAAsCwB,EAAqBf,EAAKa,EAAK,EAAG,GAElCG,EAAqBhB,EAAKc,EAAK,EAAG,GAEvEG,EAAM,SAAUC,GAEhB,IADA,IAAIN,EAAIM,EAAE,GACD3B,EAAI,EAAGA,EAAI2B,EAAEd,SAAUb,EACxB2B,EAAE3B,GAAKqB,IACPA,EAAIM,EAAE3B,IAEd,OAAOqB,CACX,EAEIO,EAAO,SAAUC,EAAGC,EAAGT,GACvB,IAAIU,EAAKD,EAAI,EAAK,EAClB,OAASD,EAAEE,GAAMF,EAAEE,EAAI,IAAM,KAAY,EAAJD,GAAUT,CACnD,EAEIW,EAAS,SAAUH,EAAGC,GACtB,IAAIC,EAAKD,EAAI,EAAK,EAClB,OAASD,EAAEE,GAAMF,EAAEE,EAAI,IAAM,EAAMF,EAAEE,EAAI,IAAM,MAAa,EAAJD,EAC5D,EAEIG,EAAO,SAAUH,GAAK,OAASA,EAAI,GAAK,EAAK,GAG7CI,EAAM,SAAUd,EAAGR,EAAGuB,IACb,MAALvB,GAAaA,EAAI,KACjBA,EAAI,IACC,MAALuB,GAAaA,EAAIf,EAAEP,UACnBsB,EAAIf,EAAEP,QAEV,IAAIuB,EAAI,IAAIjD,EAAGgD,EAAIvB,GAEnB,OADAwB,EAAEC,IAAIjB,EAAEkB,SAAS1B,EAAGuB,IACbC,CACX,EAsBIG,EAAK,CACL,iBACA,qBACA,yBACA,mBACA,kBACA,oBACJ,CACI,cACA,qBACA,uBACA,8BACA,oBACA,mBACA,oBAIAC,EAAM,SAAUC,EAAKC,EAAKC,GAC1B,IAAIR,EAAI,IAAIS,MAAMF,GAAOH,EAAGE,IAI5B,GAHAN,EAAEU,KAAOJ,EACLG,MAAME,mBACNF,MAAME,kBAAkBX,EAAGK,IAC1BG,EACD,MAAMR,EACV,OAAOA,CACX,EAEIY,EAAQ,SAAUC,EAAKC,EAAIC,EAAKC,GAEhC,IAAIC,EAAKJ,EAAInC,OAAQwC,EAAKF,EAAOA,EAAKtC,OAAS,EAC/C,IAAKuC,GAAMH,EAAGK,IAAML,EAAGnC,EACnB,OAAOoC,GAAO,IAAI/D,EAAG,GAEzB,IAAIoE,GAASL,GAAe,GAARD,EAAGjD,EAEnBwD,EAAOP,EAAGjD,EAETkD,IACDA,EAAM,IAAI/D,EAAQ,EAALiE,IAEjB,IAAIK,EAAO,SAAU3C,GACjB,IAAI4C,EAAKR,EAAIrC,OAEb,GAAIC,EAAI4C,EAAI,CAER,IAAIC,EAAO,IAAIxE,EAAGyE,KAAKlC,IAAS,EAALgC,EAAQ5C,IACnC6C,EAAKtB,IAAIa,GACTA,EAAMS,CACT,CACT,EAEQE,EAAQZ,EAAGK,GAAK,EAAGQ,EAAMb,EAAGnB,GAAK,EAAGiC,EAAKd,EAAGlD,GAAK,EAAGiE,EAAKf,EAAGnC,EAAGmD,EAAKhB,EAAGpB,EAAGqC,EAAMjB,EAAG5B,EAAG8C,EAAMlB,EAAGb,EAE/FgC,EAAY,EAALhB,EACX,EAAG,CACC,IAAKY,EAAI,CAELH,EAAQjC,EAAKoB,EAAKc,EAAK,GAEvB,IAAIO,EAAOzC,EAAKoB,EAAKc,EAAM,EAAG,GAE9B,GADAA,GAAO,GACFO,EAAM,CAEP,IAAuBvD,EAAIkC,GAAvBpC,EAAIqB,EAAK6B,GAAO,GAAe,GAAMd,EAAIpC,EAAI,IAAM,EAAI0D,EAAI1D,EAAIE,EACnE,GAAIwD,EAAIlB,EAAI,CACJI,GACAhB,EAAI,GACR,KACH,CAEGe,GACAE,EAAKM,EAAKjD,GAEdoC,EAAIb,IAAIW,EAAIV,SAAS1B,EAAG0D,GAAIP,GAE5Bd,EAAGlD,EAAIgE,GAAMjD,EAAGmC,EAAGnB,EAAIgC,EAAU,EAAJQ,EAAOrB,EAAGK,EAAIO,EAC3C,QACH,CACI,GAAY,GAARQ,EACLL,EAAKxC,EAAMyC,EAAKxC,EAAMyC,EAAM,EAAGC,EAAM,OACpC,GAAY,GAARE,EAAW,CAEhB,IAAIE,EAAO3C,EAAKoB,EAAKc,EAAK,IAAM,IAAKU,EAAQ5C,EAAKoB,EAAKc,EAAM,GAAI,IAAM,EACnEW,EAAKF,EAAO3C,EAAKoB,EAAKc,EAAM,EAAG,IAAM,EACzCA,GAAO,GAKP,IAHA,IAAIY,EAAM,IAAIvF,EAAGsF,GAEbE,EAAM,IAAIxF,EAAG,IACRa,EAAI,EAAGA,EAAIwE,IAASxE,EAEzB2E,EAAIhF,EAAKK,IAAM4B,EAAKoB,EAAKc,EAAU,EAAJ9D,EAAO,GAE1C8D,GAAe,EAARU,EAEP,IAAII,EAAMlD,EAAIiD,GAAME,GAAU,GAAKD,GAAO,EAEtCE,EAAMrE,EAAKkE,EAAKC,EAAK,GACzB,IAAS5E,EAAI,EAAGA,EAAIyE,GAAK,CACrB,IAII7D,EAJAX,EAAI6E,EAAIlD,EAAKoB,EAAKc,EAAKe,IAM3B,GAJAf,GAAW,GAAJ7D,GAEHW,EAAIX,GAAK,GAEL,GACJyE,EAAI1E,KAAOY,MAEV,CAED,IAAImE,EAAI,EAAG3C,EAAI,EAOf,IANS,IAALxB,GACAwB,EAAI,EAAIR,EAAKoB,EAAKc,EAAK,GAAIA,GAAO,EAAGiB,EAAIL,EAAI1E,EAAI,IACvC,IAALY,GACLwB,EAAI,EAAIR,EAAKoB,EAAKc,EAAK,GAAIA,GAAO,GACxB,IAALlD,IACLwB,EAAI,GAAKR,EAAKoB,EAAKc,EAAK,KAAMA,GAAO,GAClC1B,KACHsC,EAAI1E,KAAO+E,CAClB,CACJ,CAED,IAAIC,EAAKN,EAAIpC,SAAS,EAAGiC,GAAOU,EAAKP,EAAIpC,SAASiC,GAElDL,EAAMxC,EAAIsD,GAEVb,EAAMzC,EAAIuD,GACVjB,EAAKvD,EAAKuE,EAAId,EAAK,GACnBD,EAAKxD,EAAKwE,EAAId,EAAK,EACtB,MAEG3B,EAAI,GACR,GAAIsB,EAAMM,EAAM,CACRZ,GACAhB,EAAI,GACR,KACH,CACJ,CAGGe,GACAE,EAAKM,EAAK,QAGd,IAFA,IAAImB,GAAO,GAAKhB,GAAO,EAAGiB,GAAO,GAAKhB,GAAO,EACzCiB,EAAOtB,GACHsB,EAAOtB,EAAK,CAEhB,IAAoCuB,GAAhCN,EAAIf,EAAGhC,EAAOgB,EAAKc,GAAOoB,KAAiB,EAE/C,IADApB,GAAW,GAAJiB,GACGX,EAAM,CACRZ,GACAhB,EAAI,GACR,KACH,CAGD,GAFKuC,GACDvC,EAAI,GACJ6C,EAAM,IACNnC,EAAIa,KAAQsB,MACX,IAAW,KAAPA,EAAY,CACjBD,EAAOtB,EAAKE,EAAK,KACjB,KACH,CAEG,IAAIsB,GAAMD,EAAM,IAEhB,GAAIA,EAAM,IAAK,CAEX,IAAmBtF,GAAIN,EAAnBO,EAAIqF,EAAM,KACdC,GAAM1D,EAAKoB,EAAKc,GAAM,GAAK/D,IAAK,GAAKK,EAAGJ,GACxC8D,GAAO/D,EACV,CAED,IAAI8B,GAAIoC,EAAGjC,EAAOgB,EAAKc,GAAOqB,GAAMI,GAAO1D,IAAK,EAC3CA,IACDW,EAAI,GACRsB,GAAW,GAAJjC,GACHoD,EAAK3E,EAAGiF,IACZ,GAAIA,GAAO,EAAG,CACNxF,GAAIL,EAAK6F,IACbN,GAAMjD,EAAOgB,EAAKc,IAAQ,GAAK/D,IAAK,EAAG+D,GAAO/D,EACjD,CACD,GAAI+D,EAAMM,EAAM,CACRZ,GACAhB,EAAI,GACR,KACH,CACGe,GACAE,EAAKM,EAAK,QACd,IAAIyB,GAAMzB,EAAKuB,GACf,GAAIvB,EAAKkB,EAAI,CACT,IAAIQ,GAAQpC,EAAK4B,EAAIS,GAAO9B,KAAK+B,IAAIV,EAAIO,IAGzC,IAFIC,GAAQ1B,EAAK,GACbvB,EAAI,GACDuB,EAAK2B,KAAQ3B,EAChBb,EAAIa,GAAMZ,EAAKsC,GAAQ1B,EAC9B,CACD,KAAOA,EAAKyB,GAAKzB,GAAM,EACnBb,EAAIa,GAAMb,EAAIa,EAAKkB,GACnB/B,EAAIa,EAAK,GAAKb,EAAIa,EAAK,EAAIkB,GAC3B/B,EAAIa,EAAK,GAAKb,EAAIa,EAAK,EAAIkB,GAC3B/B,EAAIa,EAAK,GAAKb,EAAIa,EAAK,EAAIkB,GAE/BlB,EAAKyB,EACR,CACJ,CACDvC,EAAGnC,EAAIkD,EAAIf,EAAGnB,EAAIsD,EAAMnC,EAAGlD,EAAIgE,EAAId,EAAGK,EAAIO,EACtCG,IACAH,EAAQ,EAAGZ,EAAG5B,EAAI6C,EAAKjB,EAAGpB,EAAIoC,EAAIhB,EAAGb,EAAI+B,EAChD,QAASN,GACV,OAAOE,GAAMb,EAAIrC,OAASqC,EAAMhB,EAAIgB,EAAK,EAAGa,EAChD,EAoOI6B,EAAmB,IAAIzG,EAAG,GA+M1B0G,EAAO,SAAUC,EAAIC,EAAOC,GAI5B,IAHA,IAAIf,EAAKa,IACL7C,EAAK6C,EAAGG,WACRC,EAAKjD,EAAGkD,MAAMlD,EAAGmD,QAAQ,KAAO,EAAGnD,EAAGoD,YAAY,MAAMC,QAAQ,OAAQ,IAAIC,MAAM,KAC7EvG,EAAI,EAAGA,EAAIiF,EAAGpE,SAAUb,EAAG,CAChC,IAAIoB,EAAI6D,EAAGjF,GAAIwG,EAAIN,EAAGlG,GACtB,GAAgB,mBAALoB,EAAiB,CACxB2E,GAAS,IAAMS,EAAI,IACnB,IAAIC,EAAOrF,EAAE6E,WACb,GAAI7E,EAAEsF,UAEF,IAAsC,GAAlCD,EAAKL,QAAQ,iBAAwB,CACrC,IAAIO,EAAQF,EAAKL,QAAQ,IAAK,GAAK,EACnCL,GAASU,EAAKN,MAAMQ,EAAOF,EAAKL,QAAQ,IAAKO,GAChD,MAGG,IAAK,IAAIrC,KADTyB,GAASU,EACKrF,EAAEsF,UACZX,GAAS,IAAMS,EAAI,cAAgBlC,EAAI,IAAMlD,EAAEsF,UAAUpC,GAAG2B,gBAIpEF,GAASU,CAChB,MAEGT,EAAGQ,GAAKpF,CACf,CACD,OAAO2E,CACX,EACIa,EAAK,GAYLC,EAAO,SAAUC,EAAKC,EAAMC,EAAIC,GAChC,IAAKL,EAAGI,GAAK,CAET,IADA,IAAIjB,EAAQ,GAAImB,EAAO,CAAA,EAAI7F,EAAIyF,EAAIjG,OAAS,EACnCb,EAAI,EAAGA,EAAIqB,IAAKrB,EACrB+F,EAAQF,EAAKiB,EAAI9G,GAAI+F,EAAOmB,GAChCN,EAAGI,GAAM,CAAEjC,EAAGc,EAAKiB,EAAIzF,GAAI0E,EAAOmB,GAAO/E,EAAG+E,EAC/C,CACD,IAAIlB,EA/DE,SAAUrE,EAAG5B,GACnB,IAAIgC,EAAI,CAAA,EACR,IAAK,IAAIyE,KAAK7E,EACVI,EAAEyE,GAAK7E,EAAE6E,GACb,IAAK,IAAIA,KAAKzG,EACVgC,EAAEyE,GAAKzG,EAAEyG,GACb,OAAOzE,CACX,CAwDaoF,CAAI,CAAE,EAAEP,EAAGI,GAAI7E,GACxB,OAz2BE,SAAc4C,EAAGiC,EAAItE,EAAK0E,EAAUH,GACtC,IAAII,EAAI,IAAIC,OAAOpI,EAAI8H,KAAQ9H,EAAI8H,GAAMO,IAAIC,gBAAgB,IAAIC,KAAK,CAClE1C,EAAI,mGACL,CAAEV,KAAM,uBAaX,OAZAgD,EAAEK,UAAY,SAAUvF,GACpB,IAAIN,EAAIM,EAAEwF,KAAMC,EAAK/F,EAAEgG,IACvB,GAAID,EAAI,CACJ,IAAIpF,EAAM,IAAII,MAAMgF,EAAG,IACvBpF,EAAU,KAAIoF,EAAG,GACjBpF,EAAIsF,MAAQF,EAAG,GACfX,EAAGzE,EAAK,KACX,MAEGyE,EAAG,KAAMpF,EACrB,EACIwF,EAAEU,YAAYrF,EAAK0E,GACZC,CACV,CAw1BUW,CAAGpB,EAAGI,GAAIjC,EAAI,0EAA4EgC,EAAKd,WAAa,IAAKe,EAAIhB,EAlBrH,SAAU5E,GACjB,IAAIqD,EAAK,GACT,IAAK,IAAI+B,KAAKpF,EACNA,EAAEoF,GAAGyB,QACLxD,EAAGyD,MAAM9G,EAAEoF,GAAK,IAAIpF,EAAEoF,GAAG2B,YAAY/G,EAAEoF,KAAKyB,QAGpD,OAAOxD,CACX,CAUoI2D,CAAKpC,GAAKiB,EAC9I,EAEIoB,EAAS,WAAc,MAAO,CAAClJ,EAAIE,EAAKE,EAAKE,EAAMC,EAAMC,EAAMS,EAAIE,EAAIkB,EAAMC,EAAMlB,EAAKgC,EAAI9B,EAAMiB,EAAKE,EAAMI,EAAQC,EAAMC,EAAKM,EAAKO,EAAOuF,EAAaC,EAAKC,EAAM,EAWpKD,EAAM,SAAU7F,GAAO,OAAOqF,YAAYrF,EAAK,CAACA,EAAIuF,UAEpDO,EAAO,SAAUzG,GAAK,OAAOA,GAAK,CAClC0G,IAAK1G,EAAE2G,MAAQ,IAAIvJ,EAAG4C,EAAE2G,MACxBC,WAAY5G,EAAE4G,aAYdC,EAAQ,SAAUC,GAElB,OADAA,EAAKC,OAAS,SAAU9F,EAAKa,GAAS,OAAOkE,YAAY,CAAC/E,EAAKa,GAAQ,CAACb,EAAIiF,QAAS,EAC9E,SAAUc,GAAM,OAAOF,EAAKX,KAAKa,EAAGpB,KAAK,GAAIoB,EAAGpB,KAAK,GAAI,CACpE,EAsFA,SAASqB,EAAQC,EAAMhC,GAInB,MAHmB,mBAARgC,IACPhC,EAAKgC,EAAMA,EAAO,IACtBC,KAAKJ,OAAS7B,EACPgC,CACX,CAqGA,IAAIE,EAAyB,WACzB,SAASA,EAAQF,EAAMhC,GAEA,mBAARgC,IACPhC,EAAKgC,EAAMA,EAAO,IACtBC,KAAKJ,OAAS7B,EACd,IAAI9D,EAAO8F,GAAQA,EAAKN,YAAcM,EAAKN,WAAWrG,UAAU,OAChE4G,KAAKtI,EAAI,CAAEZ,EAAG,EAAGD,EAAGoD,EAAOA,EAAKtC,OAAS,GACzCqI,KAAKnH,EAAI,IAAI5C,EAAG,OAChB+J,KAAKpH,EAAI,IAAI3C,EAAG,GACZgE,GACA+F,KAAKnH,EAAEM,IAAIc,EAClB,CA6BD,OA5BAgG,EAAQzC,UAAUvE,EAAI,SAAU4C,GAK5B,GAJKmE,KAAKJ,QACNtG,EAAI,GACJ0G,KAAKrH,GACLW,EAAI,GACH0G,KAAKpH,EAAEjB,QAEP,GAAIkE,EAAElE,OAAQ,CACf,IAAIuB,EAAI,IAAIjD,EAAG+J,KAAKpH,EAAEjB,OAASkE,EAAElE,QACjCuB,EAAEC,IAAI6G,KAAKpH,GAAIM,EAAEC,IAAI0C,EAAGmE,KAAKpH,EAAEjB,QAASqI,KAAKpH,EAAIM,CACpD,OAJG8G,KAAKpH,EAAIiD,CAKrB,EACIoE,EAAQzC,UAAU3B,EAAI,SAAUlB,GAC5BqF,KAAKtI,EAAEZ,IAAMkJ,KAAKrH,EAAIgC,IAAS,GAC/B,IAAIuF,EAAMF,KAAKtI,EAAEb,EACbkF,EAAKlC,EAAMmG,KAAKpH,EAAGoH,KAAKtI,EAAGsI,KAAKnH,GACpCmH,KAAKJ,OAAO5G,EAAI+C,EAAImE,EAAKF,KAAKtI,EAAEb,GAAImJ,KAAKrH,GACzCqH,KAAKnH,EAAIG,EAAI+C,EAAIiE,KAAKtI,EAAEb,EAAI,OAAQmJ,KAAKtI,EAAEb,EAAImJ,KAAKnH,EAAElB,OACtDqI,KAAKpH,EAAII,EAAIgH,KAAKpH,EAAIoH,KAAKtI,EAAEkB,EAAI,EAAK,GAAIoH,KAAKtI,EAAEkB,GAAK,CAC9D,EAMIqH,EAAQzC,UAAUwB,KAAO,SAAUmB,EAAOxF,GACtCqF,KAAK/G,EAAEkH,GAAQH,KAAKnE,EAAElB,EAC9B,EACWsF,CACX,IAKIG,EAA8B,WAU9B,OATA,SAAsBL,EAAMhC,IA9OjB,SAAUH,EAAK+B,EAAMI,EAAMlC,EAAMC,EAAIuC,GAChD,IAAIjF,EACA+C,EAAIR,EAAKC,EAAKC,EAAMC,GAAI,SAAUxE,EAAKQ,GACnCR,GACA6E,EAAEmC,YAAaX,EAAKC,OAAOW,KAAKZ,EAAMrG,IAChCkH,MAAMC,QAAQ3G,IAGhBA,EAAI,IACJqE,EAAEmC,YACNX,EAAKC,OAAOW,KAAKZ,EAAMrG,EAAKQ,EAAI,GAAIA,EAAI,KAJxCuG,EAAIvG,EAMhB,IACIqE,EAAEU,YAAYkB,GACdJ,EAAKX,KAAO,SAAUrG,EAAGyB,GAChBuF,EAAKC,QACNtG,EAAI,GACJ8B,GACAuE,EAAKC,OAAOtG,EAAI,EAAG,EAAG,GAAI,OAAQc,GACtC+D,EAAEU,YAAY,CAAClG,EAAGyC,EAAIhB,GAAI,CAACzB,EAAEoG,QACrC,EACIY,EAAKW,UAAY,WAAcnC,EAAEmC,WAAY,CACjD,CAyNQI,CAAS,CACLvB,EACA,WAAc,MAAO,CAACO,EAAOO,EAAW,GACzCD,KAAMF,EAAQS,KAAKP,KAAMD,EAAMhC,IAAK,SAAU8B,GAC7C,IAAIF,EAAO,IAAIM,EAAQJ,EAAGpB,MAC1BD,UAAYkB,EAAMC,EACrB,GAAE,EACN,CAEL,IAiBO,SAASP,EAAYX,EAAMsB,GAC9B,OAAOlG,EAAM4E,EAAM,CAAE3H,EAAG,GAAKiJ,GAAQA,EAAKR,IAAKQ,GAAQA,EAAKN,WAChE,CA0ZA,IAAI3C,EAA2B,oBAAf6D,aAA4C,IAAIA,YAGhE,IACI7D,EAAG8D,OAAOlE,EAAI,CAAEmE,QAAQ,IAClB,CACV,CACA,MAAO5H,GAAG,CChkDV,MAAM6H,UAAoCC,gBAIxC9B,YAAY+B,GACV,IAAIC,EAEJC,MAAM,CACJtK,MAAMuK,GACJF,EAAe,IAAIb,EAEnBa,EAAarB,OAAS,CAACtG,EAAK6G,EAAmBxF,KACzCrB,EACF6H,EAAWC,MAAM9H,GAIfqB,EACFwG,EAAWb,YAEXa,EAAWE,QAAQlB,EACpB,CAEJ,EACDmB,UAAUnB,EAAOgB,GACf,IACEF,EAAajC,KAAKmB,GAAO,EAC1B,CAAC,MAAOlH,GACPkI,EAAWC,MACT,IAAI1H,MAAM,kDAAkDT,KAE/D,CACF,EACDsI,QACEN,EAAajC,KAAK,IAAI9I,YAAc,EACrC,GAEJ,SACF4K","x_google_ignoreList":[0]}

data/lib/mayu/client/dist/custom-elements/mayu-alert-cd7ad2a4.js.map

@@ -1 +1 @@
-{"version":3,"file":"mayu-alert-cd7ad2a4.js","sources":[],"sourcesContent":[],"names":[],"mappings":""}
+{"version":3,"file":"mayu-alert-cd7ad2a4.js","sources":["../../src/custom-elements/mayu-alert.ts"],"sourcesContent":["import html from \"./mayu-alert.html\";\n\nconst template = document.createElement(\"template\");\ntemplate.innerHTML = html;\n\nclass MayuAlert extends HTMLElement {\n  #dialog: HTMLDialogElement;\n  #message: HTMLParagraphElement;\n  #button: HTMLButtonElement;\n\n  static observedAttributes = [\"message\"];\n\n  constructor() {\n    super();\n\n    if (!this.shadowRoot) {\n      this.attachShadow({ mode: \"open\" });\n    }\n\n    this.shadowRoot!.appendChild(\n      template.content.cloneNode(true)\n    ) as DocumentFragment;\n\n    this.#dialog = this.shadowRoot!.querySelector(\n      \"dialog\"\n    ) as HTMLDialogElement;\n\n    this.#button = this.shadowRoot!.querySelector(\n      \"button\"\n    ) as HTMLButtonElement;\n\n    this.#message = this.shadowRoot!.getElementById(\n      \"message\"\n    ) as HTMLParagraphElement;\n\n    this.#dialog.addEventListener(\"close\", () => this.remove());\n  }\n\n  connectedCallback() {\n    this.#dialog.showModal();\n    this.#message.textContent = this.getAttribute(\"message\");\n    this.#button.focus();\n  }\n\n  attributeChangedCallback(name: string, oldValue: string, newValue: string) {\n    switch (name) {\n      case \"message\":\n        this.#message.textContent = String(newValue);\n        break;\n      default:\n        break;\n    }\n  }\n\n  disconnectedCallback() {\n    this.#dialog.close();\n  }\n}\n\nwindow.customElements.define(\"mayu-alert\", MayuAlert);\n\nexport default MayuAlert;\n"],"names":["template","document","createElement","innerHTML","MayuAlert","HTMLElement","dialog","message","button","static","constructor","super","this","shadowRoot","attachShadow","mode","appendChild","content","cloneNode","querySelector","getElementById","addEventListener","remove","connectedCallback","showModal","textContent","getAttribute","focus","attributeChangedCallback","name","oldValue","newValue","String","disconnectedCallback","close","window","customElements","define"],"mappings":"AAEA,MAAMA,EAAWC,SAASC,cAAc,YACxCF,EAASG,k2DAET,MAAMC,UAAkBC,YACtBC,GACAC,GACAC,GAEAC,0BAA4B,CAAC,WAE7BC,cACEC,QAEKC,KAAKC,YACRD,KAAKE,aAAa,CAAEC,KAAM,SAG5BH,KAAKC,WAAYG,YACfhB,EAASiB,QAAQC,WAAU,IAG7BN,MAAKN,EAAUM,KAAKC,WAAYM,cAC9B,UAGFP,MAAKJ,EAAUI,KAAKC,WAAYM,cAC9B,UAGFP,MAAKL,EAAWK,KAAKC,WAAYO,eAC/B,WAGFR,MAAKN,EAAQe,iBAAiB,SAAS,IAAMT,KAAKU,UACnD,CAEDC,oBACEX,MAAKN,EAAQkB,YACbZ,MAAKL,EAASkB,YAAcb,KAAKc,aAAa,WAC9Cd,MAAKJ,EAAQmB,OACd,CAEDC,yBAAyBC,EAAcC,EAAkBC,GACvD,GACO,YADCF,EAEJjB,MAAKL,EAASkB,YAAcO,OAAOD,EAKxC,CAEDE,uBACErB,MAAKN,EAAQ4B,OACd,EAGHC,OAAOC,eAAeC,OAAO,aAAcjC,UAAUA"}

data/lib/mayu/client/dist/custom-elements/mayu-disconnected-9f349f46.js.map

@@ -1 +1 @@
-{"version":3,"file":"mayu-disconnected-9f349f46.js","sources":[],"sourcesContent":[],"names":[],"mappings":""}
+{"version":3,"file":"mayu-disconnected-9f349f46.js","sources":["../../src/custom-elements/mayu-disconnected.ts"],"sourcesContent":["import html from \"./mayu-disconnected.html\";\n\nconst template = document.createElement(\"template\");\ntemplate.innerHTML = html;\n\nclass MayuDisconnected extends HTMLElement {\n  dialog?: HTMLDialogElement;\n  reason?: HTMLParagraphElement;\n\n  static observedAttributes = [\"reason\"];\n\n  constructor() {\n    super();\n\n    if (!this.shadowRoot) {\n      this.attachShadow({ mode: \"open\" });\n    }\n\n    this.shadowRoot!.appendChild(\n      template.content.cloneNode(true)\n    ) as DocumentFragment;\n\n    this.dialog = this.shadowRoot!.querySelector(\"dialog\") as HTMLDialogElement;\n    this.reason = this.shadowRoot!.getElementById(\n      \"reason\"\n    ) as HTMLParagraphElement;\n  }\n\n  connectedCallback() {\n    this.dialog!.showModal();\n  }\n\n  attributeChangedCallback(name: string, oldValue: string, newValue: string) {\n    switch (name) {\n      case \"reason\":\n        if (!this.reason) break;\n        this.reason.textContent = String(newValue);\n        break;\n      default:\n        break;\n    }\n  }\n\n  disconnectedCallback() {\n    this.dialog?.close();\n  }\n}\n\nwindow.customElements.define(\"mayu-disconnected\", MayuDisconnected);\n\nexport default MayuDisconnected;\n"],"names":["template","document","createElement","innerHTML","MayuDisconnected","HTMLElement","dialog","reason","static","constructor","super","this","shadowRoot","attachShadow","mode","appendChild","content","cloneNode","querySelector","getElementById","connectedCallback","showModal","attributeChangedCallback","name","oldValue","newValue","textContent","String","disconnectedCallback","close","window","customElements","define"],"mappings":"AAEA,MAAMA,EAAWC,SAASC,cAAc,YACxCF,EAASG,ivDAET,MAAMC,UAAyBC,YAC7BC,OACAC,OAEAC,0BAA4B,CAAC,UAE7BC,cACEC,QAEKC,KAAKC,YACRD,KAAKE,aAAa,CAAEC,KAAM,SAG5BH,KAAKC,WAAYG,YACff,EAASgB,QAAQC,WAAU,IAG7BN,KAAKL,OAASK,KAAKC,WAAYM,cAAc,UAC7CP,KAAKJ,OAASI,KAAKC,WAAYO,eAC7B,SAEH,CAEDC,oBACET,KAAKL,OAAQe,WACd,CAEDC,yBAAyBC,EAAcC,EAAkBC,GACvD,OAAQF,GACN,IAAK,SACH,IAAKZ,KAAKJ,OAAQ,MAClBI,KAAKJ,OAAOmB,YAAcC,OAAOF,GAKtC,CAEDG,uBACEjB,KAAKL,QAAQuB,OACd,EAGHC,OAAOC,eAAeC,OAAO,oBAAqB5B,UAAiBA"}

data/lib/mayu/client/dist/custom-elements/mayu-exception-63df4e8c.js.map

@@ -1 +1 @@
-{"version":3,"file":"mayu-exception-63df4e8c.js","sources":[],"sourcesContent":[],"names":[],"mappings":""}
+{"version":3,"file":"mayu-exception-63df4e8c.js","sources":["../../src/custom-elements/mayu-exception.ts"],"sourcesContent":["import html from \"./mayu-exception.html\";\n\nconst template = document.createElement(\"template\");\ntemplate.innerHTML = html;\n\nclass MayuException extends HTMLElement {\n  dialog?: HTMLDialogElement;\n\n  connectedCallback() {\n    if (!this.shadowRoot) {\n      this.attachShadow({ mode: \"open\" });\n    }\n\n    this.shadowRoot!.appendChild(template.content.cloneNode(true));\n\n    this.dialog = this.shadowRoot!.querySelector(\"dialog\") as HTMLDialogElement;\n\n    this.dialog!.showModal();\n  }\n\n  disconnectedCallback() {\n    this.dialog?.close();\n  }\n}\n\nwindow.customElements.define(\"mayu-exception\", MayuException);\n\nexport default MayuException;\n"],"names":["template","document","createElement","innerHTML","MayuException","HTMLElement","dialog","connectedCallback","this","shadowRoot","attachShadow","mode","appendChild","content","cloneNode","querySelector","showModal","disconnectedCallback","close","window","customElements","define"],"mappings":"AAEA,MAAMA,EAAWC,SAASC,cAAc,YACxCF,EAASG,4hCAET,MAAMC,UAAsBC,YAC1BC,OAEAC,oBACOC,KAAKC,YACRD,KAAKE,aAAa,CAAEC,KAAM,SAG5BH,KAAKC,WAAYG,YAAYZ,EAASa,QAAQC,WAAU,IAExDN,KAAKF,OAASE,KAAKC,WAAYM,cAAc,UAE7CP,KAAKF,OAAQU,WACd,CAEDC,uBACET,KAAKF,QAAQY,OACd,EAGHC,OAAOC,eAAeC,OAAO,iBAAkBjB,UAAcA"}

data/lib/mayu/client/dist/custom-elements/mayu-ping-f7c763db.js

@@ -0,0 +1 @@
+const a=document.createElement("template");a.innerHTML='<style>.mayu-ping{position:fixed;bottom:0;left:0;z-index:10000;background:#0003;border:0 solid #0003;border-width:1px 1px 0 0;font-size:.9em;padding:.2em .5em;border-top-right-radius:3px;text-shadow:0 0 2px #000,0 0 2px #000,0 0 2px #000,0 0 2px #000,0 0 2px #000,0 0 2px #000,0 0 2px #000,0 0 2px #000,0 0 2px #000,0 0 2px #000;color:#fff;font-weight:700;font-family:monospace;transition:background .5s 0s ease-in-out}.status-disconnected{background:#d0060699}.status-connected{background:#44f70899}.status-transferring{background:#0866f799}</style><div inert class="mayu-ping">Ping: <span class="ping">N/A</span> (<span class="instance">N/A</span> @ <span class="region">N/A</span>)</div>';const n={ams:"Amsterdam, Netherlands",arn:"Stockholm, Sweden",atl:"Atlanta, Georgia (US)",bog:"Bogotá, Colombia",bom:"Mumbai, India",bos:"Boston, Massachusetts (US)",cdg:"Paris, France",den:"Denver, Colorado (US)",dfw:"Dallas, Texas (US)",ewr:"Secaucus, NJ (US)",eze:"Ezeiza, Argentina",fra:"Frankfurt, Germany",gdl:"Guadalajara, Mexico",gig:"Rio de Janeiro, Brazil",gru:"Sao Paulo, Brazil",hkg:"Hong Kong, Hong Kong",iad:"Ashburn, Virginia (US)",jnb:"Johannesburg, South Africa",lax:"Los Angeles, California (US)",lhr:"London, United Kingdom",maa:"Chennai (Madras), India",mad:"Madrid, Spain",mia:"Miami, Florida (US)",nrt:"Tokyo, Japan",ord:"Chicago, Illinois (US)",otp:"Bucharest, Romania",phx:"Phoenix, Arizona (US)",qro:"Querétaro, Mexico",scl:"Santiago, Chile",sea:"Seattle, Washington (US)",sin:"Singapore, Singapore",sjc:"San Jose, California (US)",syd:"Sydney, Australia",waw:"Warsaw, Poland",yul:"Montreal, Canada",yyz:"Toronto, Canada"};class e extends HTMLElement{#a;#n;#e;#t;static observedAttributes=["ping","region","status"];connectedCallback(){this.shadowRoot||this.attachShadow({mode:"open"}),this.shadowRoot.appendChild(a.content.cloneNode(!0)),this.#a=this.shadowRoot.querySelector(".mayu-ping"),this.#n=this.shadowRoot.querySelector(".ping"),this.#e=this.shadowRoot.querySelector(".instance"),this.#t=this.shadowRoot.querySelector(".region")}attributeChangedCallback(a,e,t){switch(a){case"ping":this.#n.textContent=t;break;case"instance":this.#e.textContent=t;break;case"region":this.#t.textContent=n[t]||t;break;case"status":e&&e!==t&&this.#a.classList.remove(`status-${e}`),t&&this.#a.classList.add(`status-${t}`)}}}window.customElements.define("mayu-ping",e);export{e as default};//# sourceMappingURL=mayu-ping-f7c763db.js.map

data/lib/mayu/client/dist/custom-elements/mayu-ping-f7c763db.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"mayu-ping-f7c763db.js","sources":["../../src/custom-elements/mayu-ping.ts"],"sourcesContent":["import html from \"./mayu-ping.html\";\n\nconst template = document.createElement(\"template\");\ntemplate.innerHTML = html;\n\nconst REGION_NAMES: Record<string, string> = {\n  ams: \"Amsterdam, Netherlands\",\n  arn: \"Stockholm, Sweden\",\n  atl: \"Atlanta, Georgia (US)\",\n  bog: \"Bogotá, Colombia\",\n  bom: \"Mumbai, India\",\n  bos: \"Boston, Massachusetts (US)\",\n  cdg: \"Paris, France\",\n  den: \"Denver, Colorado (US)\",\n  dfw: \"Dallas, Texas (US)\",\n  ewr: \"Secaucus, NJ (US)\",\n  eze: \"Ezeiza, Argentina\",\n  fra: \"Frankfurt, Germany\",\n  gdl: \"Guadalajara, Mexico\",\n  gig: \"Rio de Janeiro, Brazil\",\n  gru: \"Sao Paulo, Brazil\",\n  hkg: \"Hong Kong, Hong Kong\",\n  iad: \"Ashburn, Virginia (US)\",\n  jnb: \"Johannesburg, South Africa\",\n  lax: \"Los Angeles, California (US)\",\n  lhr: \"London, United Kingdom\",\n  maa: \"Chennai (Madras), India\",\n  mad: \"Madrid, Spain\",\n  mia: \"Miami, Florida (US)\",\n  nrt: \"Tokyo, Japan\",\n  ord: \"Chicago, Illinois (US)\",\n  otp: \"Bucharest, Romania\",\n  phx: \"Phoenix, Arizona (US)\",\n  qro: \"Querétaro, Mexico\",\n  scl: \"Santiago, Chile\",\n  sea: \"Seattle, Washington (US)\",\n  sin: \"Singapore, Singapore\",\n  sjc: \"San Jose, California (US)\",\n  syd: \"Sydney, Australia\",\n  waw: \"Warsaw, Poland\",\n  yul: \"Montreal, Canada\",\n  yyz: \"Toronto, Canada\",\n};\n\nclass MayuPing extends HTMLElement {\n  #div?: HTMLDivElement;\n  #ping?: HTMLSpanElement;\n  #instance?: HTMLSpanElement;\n  #region?: HTMLSpanElement;\n\n  static observedAttributes = [\"ping\", \"region\", \"status\"];\n\n  connectedCallback() {\n    if (!this.shadowRoot) {\n      this.attachShadow({ mode: \"open\" });\n    }\n\n    this.shadowRoot!.appendChild(\n      template.content.cloneNode(true)\n    ) as DocumentFragment;\n\n    this.#div = this.shadowRoot!.querySelector(\".mayu-ping\") as HTMLDivElement;\n    this.#ping = this.shadowRoot!.querySelector(\".ping\") as HTMLSpanElement;\n    this.#instance = this.shadowRoot!.querySelector(\n      \".instance\"\n    ) as HTMLSpanElement;\n    this.#region = this.shadowRoot!.querySelector(\".region\") as HTMLSpanElement;\n  }\n\n  attributeChangedCallback(name: string, oldValue: string, newValue: string) {\n    switch (name) {\n      case \"ping\":\n        this.#ping!.textContent = newValue;\n        break;\n      case \"instance\":\n        this.#instance!.textContent = newValue;\n        break;\n      case \"region\":\n        this.#region!.textContent = REGION_NAMES[newValue] || newValue;\n        break;\n      case \"status\":\n        if (oldValue && oldValue !== newValue) {\n          this.#div!.classList.remove(`status-${oldValue}`);\n        }\n        if (newValue) {\n          this.#div!.classList.add(`status-${newValue}`);\n        }\n        break;\n    }\n  }\n}\n\nwindow.customElements.define(\"mayu-ping\", MayuPing);\n\nexport default MayuPing;\n"],"names":["template","document","createElement","innerHTML","REGION_NAMES","ams","arn","atl","bog","bom","bos","cdg","den","dfw","ewr","eze","fra","gdl","gig","gru","hkg","iad","jnb","lax","lhr","maa","mad","mia","nrt","ord","otp","phx","qro","scl","sea","sin","sjc","syd","waw","yul","yyz","MayuPing","HTMLElement","div","ping","instance","region","static","connectedCallback","this","shadowRoot","attachShadow","mode","appendChild","content","cloneNode","querySelector","attributeChangedCallback","name","oldValue","newValue","textContent","classList","remove","add","window","customElements","define"],"mappings":"AAEA,MAAMA,EAAWC,SAASC,cAAc,YACxCF,EAASG,+rBAET,MAAMC,EAAuC,CAC3CC,IAAK,yBACLC,IAAK,oBACLC,IAAK,wBACLC,IAAK,mBACLC,IAAK,gBACLC,IAAK,6BACLC,IAAK,gBACLC,IAAK,wBACLC,IAAK,qBACLC,IAAK,oBACLC,IAAK,oBACLC,IAAK,qBACLC,IAAK,sBACLC,IAAK,yBACLC,IAAK,oBACLC,IAAK,uBACLC,IAAK,yBACLC,IAAK,6BACLC,IAAK,+BACLC,IAAK,yBACLC,IAAK,0BACLC,IAAK,gBACLC,IAAK,sBACLC,IAAK,eACLC,IAAK,yBACLC,IAAK,qBACLC,IAAK,wBACLC,IAAK,oBACLC,IAAK,kBACLC,IAAK,2BACLC,IAAK,uBACLC,IAAK,4BACLC,IAAK,oBACLC,IAAK,iBACLC,IAAK,mBACLC,IAAK,mBAGP,MAAMC,UAAiBC,YACrBC,GACAC,GACAC,GACAC,GAEAC,0BAA4B,CAAC,OAAQ,SAAU,UAE/CC,oBACOC,KAAKC,YACRD,KAAKE,aAAa,CAAEC,KAAM,SAG5BH,KAAKC,WAAYG,YACfrD,EAASsD,QAAQC,WAAU,IAG7BN,MAAKN,EAAOM,KAAKC,WAAYM,cAAc,cAC3CP,MAAKL,EAAQK,KAAKC,WAAYM,cAAc,SAC5CP,MAAKJ,EAAYI,KAAKC,WAAYM,cAChC,aAEFP,MAAKH,EAAUG,KAAKC,WAAYM,cAAc,UAC/C,CAEDC,yBAAyBC,EAAcC,EAAkBC,GACvD,OAAQF,GACN,IAAK,OACHT,MAAKL,EAAOiB,YAAcD,EAC1B,MACF,IAAK,WACHX,MAAKJ,EAAWgB,YAAcD,EAC9B,MACF,IAAK,SACHX,MAAKH,EAASe,YAAczD,EAAawD,IAAaA,EACtD,MACF,IAAK,SACCD,GAAYA,IAAaC,GAC3BX,MAAKN,EAAMmB,UAAUC,OAAO,UAAUJ,KAEpCC,GACFX,MAAKN,EAAMmB,UAAUE,IAAI,UAAUJ,KAI1C,EAGHK,OAAOC,eAAeC,OAAO,YAAa1B,UAASA"}

data/lib/mayu/client/dist/custom-elements/mayu-progress-bar-eb3e1ac8.js.map

@@ -1 +1 @@
-{"version":3,"file":"mayu-progress-bar-eb3e1ac8.js","sources":[],"sourcesContent":[],"names":[],"mappings":""}
+{"version":3,"file":"mayu-progress-bar-eb3e1ac8.js","sources":["../../src/custom-elements/mayu-progress-bar.ts"],"sourcesContent":["import html from \"./mayu-progress-bar.html\";\n\nconst template = document.createElement(\"template\");\ntemplate.innerHTML = html;\n\nclass MayuProgressBar extends HTMLElement {\n  progress: HTMLDivElement | null = null;\n\n  static observedAttributes = [\"progress\"];\n\n  connectedCallback() {\n    const shadowRoot = this.attachShadow({ mode: \"open\" });\n\n    shadowRoot.appendChild(\n      template.content.cloneNode(true)\n    ) as DocumentFragment;\n\n    this.progress = shadowRoot.querySelector(\".progress\")!;\n  }\n\n  attributeChangedCallback(name: string, oldValue: string, newValue: string) {\n    if (name === \"progress\") {\n      switch (Number(newValue)) {\n        case 0:\n          this.progress!.removeAttribute(\"hidden\");\n          break;\n        case 100:\n          this.progress!.setAttribute(\"hidden\", \"\");\n          break;\n        default:\n          this.progress!.removeAttribute(\"hidden\");\n          break;\n      }\n    }\n  }\n}\n\nwindow.customElements.define(\"mayu-progress-bar\", MayuProgressBar);\n\nexport default MayuProgressBar;\n"],"names":["template","document","createElement","innerHTML","MayuProgressBar","HTMLElement","progress","static","connectedCallback","shadowRoot","this","attachShadow","mode","appendChild","content","cloneNode","querySelector","attributeChangedCallback","name","oldValue","newValue","Number","removeAttribute","setAttribute","window","customElements","define"],"mappings":"AAEA,MAAMA,EAAWC,SAASC,cAAc,YACxCF,EAASG,skBAET,MAAMC,UAAwBC,YAC5BC,SAAkC,KAElCC,0BAA4B,CAAC,YAE7BC,oBACE,MAAMC,EAAaC,KAAKC,aAAa,CAAEC,KAAM,SAE7CH,EAAWI,YACTb,EAASc,QAAQC,WAAU,IAG7BL,KAAKJ,SAAWG,EAAWO,cAAc,YAC1C,CAEDC,yBAAyBC,EAAcC,EAAkBC,GACvD,GAAa,aAATF,EACF,OAAQG,OAAOD,IACb,KAAK,EAML,QACEV,KAAKJ,SAAUgB,gBAAgB,UAC/B,MALF,KAAK,IACHZ,KAAKJ,SAAUiB,aAAa,SAAU,IAO7C,EAGHC,OAAOC,eAAeC,OAAO,oBAAqBtB,UAAgBA"}

data/lib/mayu/client/dist/entries.json

@@ -1,3 +1,3 @@
 {
-  "main": "main-8506b35d.js"
+  "main": "main-b7403aa1.js"
 }

data/lib/mayu/client/dist/main-b7403aa1.js

@@ -0,0 +1 @@
+var e,t,n,r=4294967295;function o(e,t){return 4294967296*e.getInt32(t)+e.getUint32(t+4)}var i=("undefined"==typeof process||"never"!==(null===(e=null===process||void 0===process?void 0:process.env)||void 0===e?void 0:e.TEXT_ENCODING))&&"undefined"!=typeof TextEncoder&&"undefined"!=typeof TextDecoder,s=i?new TextEncoder:void 0;i&&"undefined"!=typeof process&&(null===(t=null===process||void 0===process?void 0:process.env)||void 0===t||t.TEXT_ENCODING),null==s||s.encodeInto;function a(e,t,n){for(var r=t,o=r+n,i=[],s="";r<o;){var a=e[r++];if(0==(128&a))i.push(a);else if(192==(224&a)){var c=63&e[r++];i.push((31&a)<<6|c)}else if(224==(240&a)){c=63&e[r++];var u=63&e[r++];i.push((31&a)<<12|c<<6|u)}else if(240==(248&a)){var h=(7&a)<<18|(c=63&e[r++])<<12|(u=63&e[r++])<<6|63&e[r++];h>65535&&(h-=65536,i.push(h>>>10&1023|55296),h=56320|1023&h),i.push(h)}else i.push(a);i.length>=4096&&(s+=String.fromCharCode.apply(String,i),i.length=0)}return i.length>0&&(s+=String.fromCharCode.apply(String,i)),s}var c=i?new TextDecoder:null,u=i?"undefined"!=typeof process&&"force"!==(null===(n=null===process||void 0===process?void 0:process.env)||void 0===n?void 0:n.TEXT_DECODER)?200:0:r;var h,d=function(e,t){this.type=e,this.data=t},l=(h=function(e,t){return h=Object.setPrototypeOf||{__proto__:[]}instanceof Array&&function(e,t){e.__proto__=t}||function(e,t){for(var n in t)Object.prototype.hasOwnProperty.call(t,n)&&(e[n]=t[n])},h(e,t)},function(e,t){if("function"!=typeof t&&null!==t)throw new TypeError("Class extends value "+String(t)+" is not a constructor or null");function n(){this.constructor=e}h(e,t),e.prototype=null===t?Object.create(t):(n.prototype=t.prototype,new n)}),f=function(e){function t(n){var r=e.call(this,n)||this,o=Object.create(t.prototype);return Object.setPrototypeOf(r,o),Object.defineProperty(r,"name",{configurable:!0,enumerable:!1,value:t.name}),r}return l(t,e),t}(Error),p=4294967295,y=17179869183;function m(e){var t=e.sec,n=e.nsec;if(t>=0&&n>=0&&t<=y){if(0===n&&t<=p){var r=new Uint8Array(4);return(s=new DataView(r.buffer)).setUint32(0,t),r}var o=t/4294967296,i=4294967295&t;r=new Uint8Array(8);return(s=new DataView(r.buffer)).setUint32(0,n<<2|3&o),s.setUint32(4,i),r}var s;r=new Uint8Array(12);return(s=new DataView(r.buffer)).setUint32(0,n),function(e,t,n){var r=Math.floor(n/4294967296),o=n;e.setUint32(t,r),e.setUint32(t+4,o)}(s,4,t),r}var g={type:-1,encode:function(e){var t,n,r,o;return e instanceof Date?m((t=e.getTime(),n=Math.floor(t/1e3),r=1e6*(t-1e3*n),o=Math.floor(r/1e9),{sec:n+o,nsec:r-1e9*o})):null},decode:function(e){var t=function(e){var t=new DataView(e.buffer,e.byteOffset,e.byteLength);switch(e.byteLength){case 4:return{sec:t.getUint32(0),nsec:0};case 8:var n=t.getUint32(0);return{sec:4294967296*(3&n)+t.getUint32(4),nsec:n>>>2};case 12:return{sec:o(t,4),nsec:t.getUint32(0)};default:throw new f("Unrecognized data size for timestamp (expected 4, 8, or 12): ".concat(e.length))}}(e);return new Date(1e3*t.sec+t.nsec/1e6)}},v=function(){function e(){this.builtInEncoders=[],this.builtInDecoders=[],this.encoders=[],this.decoders=[],this.register(g)}return e.prototype.register=function(e){var t=e.type,n=e.encode,r=e.decode;if(t>=0)this.encoders[t]=n,this.decoders[t]=r;else{var o=1+t;this.builtInEncoders[o]=n,this.builtInDecoders[o]=r}},e.prototype.tryToEncode=function(e,t){for(var n=0;n<this.builtInEncoders.length;n++){if(null!=(r=this.builtInEncoders[n]))if(null!=(o=r(e,t)))return new d(-1-n,o)}for(n=0;n<this.encoders.length;n++){var r,o;if(null!=(r=this.encoders[n]))if(null!=(o=r(e,t)))return new d(n,o)}return e instanceof d?e:null},e.prototype.decode=function(e,t,n){var r=t<0?this.builtInDecoders[-1-t]:this.decoders[t];return r?r(e,t,n):new d(t,e)},e.defaultCodec=new e,e}();function b(e){return e instanceof Uint8Array?e:ArrayBuffer.isView(e)?new Uint8Array(e.buffer,e.byteOffset,e.byteLength):e instanceof ArrayBuffer?new Uint8Array(e):Uint8Array.from(e)}function w(e){return"".concat(e<0?"-":"","0x").concat(Math.abs(e).toString(16).padStart(2,"0"))}var x,E=function(){function e(e,t){void 0===e&&(e=16),void 0===t&&(t=16),this.maxKeyLength=e,this.maxLengthPerKey=t,this.hit=0,this.miss=0,this.caches=[];for(var n=0;n<this.maxKeyLength;n++)this.caches.push([])}return e.prototype.canBeCached=function(e){return e>0&&e<=this.maxKeyLength},e.prototype.find=function(e,t,n){e:for(var r=0,o=this.caches[n-1];r<o.length;r++){for(var i=o[r],s=i.bytes,a=0;a<n;a++)if(s[a]!==e[t+a])continue e;return i.str}return null},e.prototype.store=function(e,t){var n=this.caches[e.length-1],r={bytes:e,str:t};n.length>=this.maxLengthPerKey?n[Math.random()*n.length|0]=r:n.push(r)},e.prototype.decode=function(e,t,n){var r=this.find(e,t,n);if(null!=r)return this.hit++,r;this.miss++;var o=a(e,t,n),i=Uint8Array.prototype.slice.call(e,t,t+n);return this.store(i,o),o},e}(),S=function(e,t,n,r){return new(n||(n=Promise))((function(o,i){function s(e){try{c(r.next(e))}catch(e){i(e)}}function a(e){try{c(r.throw(e))}catch(e){i(e)}}function c(e){var t;e.done?o(e.value):(t=e.value,t instanceof n?t:new n((function(e){e(t)}))).then(s,a)}c((r=r.apply(e,t||[])).next())}))},U=function(e,t){var n,r,o,i,s={label:0,sent:function(){if(1&o[0])throw o[1];return o[1]},trys:[],ops:[]};return i={next:a(0),throw:a(1),return:a(2)},"function"==typeof Symbol&&(i[Symbol.iterator]=function(){return this}),i;function a(i){return function(a){return function(i){if(n)throw new TypeError("Generator is already executing.");for(;s;)try{if(n=1,r&&(o=2&i[0]?r.return:i[0]?r.throw||((o=r.return)&&o.call(r),0):r.next)&&!(o=o.call(r,i[1])).done)return o;switch(r=0,o&&(i=[2&i[0],o.value]),i[0]){case 0:case 1:o=i;break;case 4:return s.label++,{value:i[1],done:!1};case 5:s.label++,r=i[1],i=[0];continue;case 7:i=s.ops.pop(),s.trys.pop();continue;default:if(!(o=s.trys,(o=o.length>0&&o[o.length-1])||6!==i[0]&&2!==i[0])){s=0;continue}if(3===i[0]&&(!o||i[1]>o[0]&&i[1]<o[3])){s.label=i[1];break}if(6===i[0]&&s.label<o[1]){s.label=o[1],o=i;break}if(o&&s.label<o[2]){s.label=o[2],s.ops.push(i);break}o[2]&&s.ops.pop(),s.trys.pop();continue}i=t.call(e,s)}catch(e){i=[6,e],r=0}finally{n=o=0}if(5&i[0])throw i[1];return{value:i[0]?i[1]:void 0,done:!0}}([i,a])}}},k=function(e){if(!Symbol.asyncIterator)throw new TypeError("Symbol.asyncIterator is not defined.");var t,n=e[Symbol.asyncIterator];return n?n.call(e):(e="function"==typeof __values?__values(e):e[Symbol.iterator](),t={},r("next"),r("throw"),r("return"),t[Symbol.asyncIterator]=function(){return this},t);function r(n){t[n]=e[n]&&function(t){return new Promise((function(r,o){(function(e,t,n,r){Promise.resolve(r).then((function(t){e({value:t,done:n})}),t)})(r,o,(t=e[n](t)).done,t.value)}))}}},T=function(e){return this instanceof T?(this.v=e,this):new T(e)},A=function(e,t,n){if(!Symbol.asyncIterator)throw new TypeError("Symbol.asyncIterator is not defined.");var r,o=n.apply(e,t||[]),i=[];return r={},s("next"),s("throw"),s("return"),r[Symbol.asyncIterator]=function(){return this},r;function s(e){o[e]&&(r[e]=function(t){return new Promise((function(n,r){i.push([e,t,n,r])>1||a(e,t)}))})}function a(e,t){try{(n=o[e](t)).value instanceof T?Promise.resolve(n.value.v).then(c,u):h(i[0][2],n)}catch(e){h(i[0][3],e)}var n}function c(e){a("next",e)}function u(e){a("throw",e)}function h(e,t){e(t),i.shift(),i.length&&a(i[0][0],i[0][1])}},I=new DataView(new ArrayBuffer(0)),_=new Uint8Array(I.buffer),L=function(){try{I.getInt8(0)}catch(e){return e.constructor}throw new Error("never reached")}(),M=new L("Insufficient data"),C=new E,D=function(){function e(e,t,n,o,i,s,a,c){void 0===e&&(e=v.defaultCodec),void 0===t&&(t=void 0),void 0===n&&(n=r),void 0===o&&(o=r),void 0===i&&(i=r),void 0===s&&(s=r),void 0===a&&(a=r),void 0===c&&(c=C),this.extensionCodec=e,this.context=t,this.maxStrLength=n,this.maxBinLength=o,this.maxArrayLength=i,this.maxMapLength=s,this.maxExtLength=a,this.keyDecoder=c,this.totalPos=0,this.pos=0,this.view=I,this.bytes=_,this.headByte=-1,this.stack=[]}return e.prototype.reinitializeState=function(){this.totalPos=0,this.headByte=-1,this.stack.length=0},e.prototype.setBuffer=function(e){this.bytes=b(e),this.view=function(e){if(e instanceof ArrayBuffer)return new DataView(e);var t=b(e);return new DataView(t.buffer,t.byteOffset,t.byteLength)}(this.bytes),this.pos=0},e.prototype.appendBuffer=function(e){if(-1!==this.headByte||this.hasRemaining(1)){var t=this.bytes.subarray(this.pos),n=b(e),r=new Uint8Array(t.length+n.length);r.set(t),r.set(n,t.length),this.setBuffer(r)}else this.setBuffer(e)},e.prototype.hasRemaining=function(e){return this.view.byteLength-this.pos>=e},e.prototype.createExtraByteError=function(e){var t=this.view,n=this.pos;return new RangeError("Extra ".concat(t.byteLength-n," of ").concat(t.byteLength," byte(s) found at buffer[").concat(e,"]"))},e.prototype.decode=function(e){this.reinitializeState(),this.setBuffer(e);var t=this.doDecodeSync();if(this.hasRemaining(1))throw this.createExtraByteError(this.pos);return t},e.prototype.decodeMulti=function(e){return U(this,(function(t){switch(t.label){case 0:this.reinitializeState(),this.setBuffer(e),t.label=1;case 1:return this.hasRemaining(1)?[4,this.doDecodeSync()]:[3,3];case 2:return t.sent(),[3,1];case 3:return[2]}}))},e.prototype.decodeAsync=function(e){var t,n,r,o;return S(this,void 0,void 0,(function(){var i,s,a,c,u,h,d,l;return U(this,(function(f){switch(f.label){case 0:i=!1,f.label=1;case 1:f.trys.push([1,6,7,12]),t=k(e),f.label=2;case 2:return[4,t.next()];case 3:if((n=f.sent()).done)return[3,5];if(a=n.value,i)throw this.createExtraByteError(this.totalPos);this.appendBuffer(a);try{s=this.doDecodeSync(),i=!0}catch(e){if(!(e instanceof L))throw e}this.totalPos+=this.pos,f.label=4;case 4:return[3,2];case 5:return[3,12];case 6:return c=f.sent(),r={error:c},[3,12];case 7:return f.trys.push([7,,10,11]),n&&!n.done&&(o=t.return)?[4,o.call(t)]:[3,9];case 8:f.sent(),f.label=9;case 9:return[3,11];case 10:if(r)throw r.error;return[7];case 11:return[7];case 12:if(i){if(this.hasRemaining(1))throw this.createExtraByteError(this.totalPos);return[2,s]}throw h=(u=this).headByte,d=u.pos,l=u.totalPos,new RangeError("Insufficient data in parsing ".concat(w(h)," at ").concat(l," (").concat(d," in the current buffer)"))}}))}))},e.prototype.decodeArrayStream=function(e){return this.decodeMultiAsync(e,!0)},e.prototype.decodeStream=function(e){return this.decodeMultiAsync(e,!1)},e.prototype.decodeMultiAsync=function(e,t){return A(this,arguments,(function(){var n,r,o,i,s,a,c,u,h;return U(this,(function(d){switch(d.label){case 0:n=t,r=-1,d.label=1;case 1:d.trys.push([1,13,14,19]),o=k(e),d.label=2;case 2:return[4,T(o.next())];case 3:if((i=d.sent()).done)return[3,12];if(s=i.value,t&&0===r)throw this.createExtraByteError(this.totalPos);this.appendBuffer(s),n&&(r=this.readArraySize(),n=!1,this.complete()),d.label=4;case 4:d.trys.push([4,9,,10]),d.label=5;case 5:return[4,T(this.doDecodeSync())];case 6:return[4,d.sent()];case 7:return d.sent(),0==--r?[3,8]:[3,5];case 8:return[3,10];case 9:if(!((a=d.sent())instanceof L))throw a;return[3,10];case 10:this.totalPos+=this.pos,d.label=11;case 11:return[3,2];case 12:return[3,19];case 13:return c=d.sent(),u={error:c},[3,19];case 14:return d.trys.push([14,,17,18]),i&&!i.done&&(h=o.return)?[4,T(h.call(o))]:[3,16];case 15:d.sent(),d.label=16;case 16:return[3,18];case 17:if(u)throw u.error;return[7];case 18:return[7];case 19:return[2]}}))}))},e.prototype.doDecodeSync=function(){e:for(;;){var e=this.readHeadByte(),t=void 0;if(e>=224)t=e-256;else if(e<192)if(e<128)t=e;else if(e<144){if(0!==(r=e-128)){this.pushMapState(r),this.complete();continue e}t={}}else if(e<160){if(0!==(r=e-144)){this.pushArrayState(r),this.complete();continue e}t=[]}else{var n=e-160;t=this.decodeUtf8String(n,0)}else if(192===e)t=null;else if(194===e)t=!1;else if(195===e)t=!0;else if(202===e)t=this.readF32();else if(203===e)t=this.readF64();else if(204===e)t=this.readU8();else if(205===e)t=this.readU16();else if(206===e)t=this.readU32();else if(207===e)t=this.readU64();else if(208===e)t=this.readI8();else if(209===e)t=this.readI16();else if(210===e)t=this.readI32();else if(211===e)t=this.readI64();else if(217===e){n=this.lookU8();t=this.decodeUtf8String(n,1)}else if(218===e){n=this.lookU16();t=this.decodeUtf8String(n,2)}else if(219===e){n=this.lookU32();t=this.decodeUtf8String(n,4)}else if(220===e){if(0!==(r=this.readU16())){this.pushArrayState(r),this.complete();continue e}t=[]}else if(221===e){if(0!==(r=this.readU32())){this.pushArrayState(r),this.complete();continue e}t=[]}else if(222===e){if(0!==(r=this.readU16())){this.pushMapState(r),this.complete();continue e}t={}}else if(223===e){if(0!==(r=this.readU32())){this.pushMapState(r),this.complete();continue e}t={}}else if(196===e){var r=this.lookU8();t=this.decodeBinary(r,1)}else if(197===e){r=this.lookU16();t=this.decodeBinary(r,2)}else if(198===e){r=this.lookU32();t=this.decodeBinary(r,4)}else if(212===e)t=this.decodeExtension(1,0);else if(213===e)t=this.decodeExtension(2,0);else if(214===e)t=this.decodeExtension(4,0);else if(215===e)t=this.decodeExtension(8,0);else if(216===e)t=this.decodeExtension(16,0);else if(199===e){r=this.lookU8();t=this.decodeExtension(r,1)}else if(200===e){r=this.lookU16();t=this.decodeExtension(r,2)}else{if(201!==e)throw new f("Unrecognized type byte: ".concat(w(e)));r=this.lookU32();t=this.decodeExtension(r,4)}this.complete();for(var o=this.stack;o.length>0;){var i=o[o.length-1];if(0===i.type){if(i.array[i.position]=t,i.position++,i.position!==i.size)continue e;o.pop(),t=i.array}else{if(1===i.type){if(s=void 0,"string"!==(s=typeof t)&&"number"!==s)throw new f("The type of key must be string or number but "+typeof t);if("__proto__"===t)throw new f("The key __proto__ is not allowed");i.key=t,i.type=2;continue e}if(i.map[i.key]=t,i.readCount++,i.readCount!==i.size){i.key=null,i.type=1;continue e}o.pop(),t=i.map}}return t}var s},e.prototype.readHeadByte=function(){return-1===this.headByte&&(this.headByte=this.readU8()),this.headByte},e.prototype.complete=function(){this.headByte=-1},e.prototype.readArraySize=function(){var e=this.readHeadByte();switch(e){case 220:return this.readU16();case 221:return this.readU32();default:if(e<160)return e-144;throw new f("Unrecognized array type byte: ".concat(w(e)))}},e.prototype.pushMapState=function(e){if(e>this.maxMapLength)throw new f("Max length exceeded: map length (".concat(e,") > maxMapLengthLength (").concat(this.maxMapLength,")"));this.stack.push({type:1,size:e,key:null,readCount:0,map:{}})},e.prototype.pushArrayState=function(e){if(e>this.maxArrayLength)throw new f("Max length exceeded: array length (".concat(e,") > maxArrayLength (").concat(this.maxArrayLength,")"));this.stack.push({type:0,size:e,array:new Array(e),position:0})},e.prototype.decodeUtf8String=function(e,t){var n;if(e>this.maxStrLength)throw new f("Max length exceeded: UTF-8 byte length (".concat(e,") > maxStrLength (").concat(this.maxStrLength,")"));if(this.bytes.byteLength<this.pos+t+e)throw M;var r,o=this.pos+t;return r=this.stateIsMapKey()&&(null===(n=this.keyDecoder)||void 0===n?void 0:n.canBeCached(e))?this.keyDecoder.decode(this.bytes,o,e):e>u?function(e,t,n){var r=e.subarray(t,t+n);return c.decode(r)}(this.bytes,o,e):a(this.bytes,o,e),this.pos+=t+e,r},e.prototype.stateIsMapKey=function(){return this.stack.length>0&&1===this.stack[this.stack.length-1].type},e.prototype.decodeBinary=function(e,t){if(e>this.maxBinLength)throw new f("Max length exceeded: bin length (".concat(e,") > maxBinLength (").concat(this.maxBinLength,")"));if(!this.hasRemaining(e+t))throw M;var n=this.pos+t,r=this.bytes.subarray(n,n+e);return this.pos+=t+e,r},e.prototype.decodeExtension=function(e,t){if(e>this.maxExtLength)throw new f("Max length exceeded: ext length (".concat(e,") > maxExtLength (").concat(this.maxExtLength,")"));var n=this.view.getInt8(this.pos+t),r=this.decodeBinary(e,t+1);return this.extensionCodec.decode(r,n,this.context)},e.prototype.lookU8=function(){return this.view.getUint8(this.pos)},e.prototype.lookU16=function(){return this.view.getUint16(this.pos)},e.prototype.lookU32=function(){return this.view.getUint32(this.pos)},e.prototype.readU8=function(){var e=this.view.getUint8(this.pos);return this.pos++,e},e.prototype.readI8=function(){var e=this.view.getInt8(this.pos);return this.pos++,e},e.prototype.readU16=function(){var e=this.view.getUint16(this.pos);return this.pos+=2,e},e.prototype.readI16=function(){var e=this.view.getInt16(this.pos);return this.pos+=2,e},e.prototype.readU32=function(){var e=this.view.getUint32(this.pos);return this.pos+=4,e},e.prototype.readI32=function(){var e=this.view.getInt32(this.pos);return this.pos+=4,e},e.prototype.readU64=function(){var e,t,n=(e=this.view,t=this.pos,4294967296*e.getUint32(t)+e.getUint32(t+4));return this.pos+=8,n},e.prototype.readI64=function(){var e=o(this.view,this.pos);return this.pos+=8,e},e.prototype.readF32=function(){var e=this.view.getFloat32(this.pos);return this.pos+=4,e},e.prototype.readF64=function(){var e=this.view.getFloat64(this.pos);return this.pos+=8,e},e}(),N={},B=function(e,t){var n,r,o,i,s={label:0,sent:function(){if(1&o[0])throw o[1];return o[1]},trys:[],ops:[]};return i={next:a(0),throw:a(1),return:a(2)},"function"==typeof Symbol&&(i[Symbol.iterator]=function(){return this}),i;function a(i){return function(a){return function(i){if(n)throw new TypeError("Generator is already executing.");for(;s;)try{if(n=1,r&&(o=2&i[0]?r.return:i[0]?r.throw||((o=r.return)&&o.call(r),0):r.next)&&!(o=o.call(r,i[1])).done)return o;switch(r=0,o&&(i=[2&i[0],o.value]),i[0]){case 0:case 1:o=i;break;case 4:return s.label++,{value:i[1],done:!1};case 5:s.label++,r=i[1],i=[0];continue;case 7:i=s.ops.pop(),s.trys.pop();continue;default:if(!(o=s.trys,(o=o.length>0&&o[o.length-1])||6!==i[0]&&2!==i[0])){s=0;continue}if(3===i[0]&&(!o||i[1]>o[0]&&i[1]<o[3])){s.label=i[1];break}if(6===i[0]&&s.label<o[1]){s.label=o[1],o=i;break}if(o&&s.label<o[2]){s.label=o[2],s.ops.push(i);break}o[2]&&s.ops.pop(),s.trys.pop();continue}i=t.call(e,s)}catch(e){i=[6,e],r=0}finally{n=o=0}if(5&i[0])throw i[1];return{value:i[0]?i[1]:void 0,done:!0}}([i,a])}}},P=function(e){return this instanceof P?(this.v=e,this):new P(e)},O=function(e,t,n){if(!Symbol.asyncIterator)throw new TypeError("Symbol.asyncIterator is not defined.");var r,o=n.apply(e,t||[]),i=[];return r={},s("next"),s("throw"),s("return"),r[Symbol.asyncIterator]=function(){return this},r;function s(e){o[e]&&(r[e]=function(t){return new Promise((function(n,r){i.push([e,t,n,r])>1||a(e,t)}))})}function a(e,t){try{(n=o[e](t)).value instanceof P?Promise.resolve(n.value.v).then(c,u):h(i[0][2],n)}catch(e){h(i[0][3],e)}var n}function c(e){a("next",e)}function u(e){a("throw",e)}function h(e,t){e(t),i.shift(),i.length&&a(i[0][0],i[0][1])}};function $(e){return O(this,arguments,(function(){var t,n,r,o;return B(this,(function(i){switch(i.label){case 0:t=e.getReader(),i.label=1;case 1:i.trys.push([1,,9,10]),i.label=2;case 2:return[4,P(t.read())];case 3:return n=i.sent(),r=n.done,o=n.value,r?[4,P(void 0)]:[3,5];case 4:return[2,i.sent()];case 5:return function(e){if(null==e)throw new Error("Assertion Failure: value must not be null nor undefined")}(o),[4,P(o)];case 6:return[4,i.sent()];case 7:return i.sent(),[3,2];case 8:return[3,10];case 9:return t.releaseLock(),[7];case 10:return[2]}}))}))}function j(e){return null!=e[Symbol.asyncIterator]?e:$(e)}function R(e,t){void 0===t&&(t=N);var n=j(e);return new D(t.extensionCodec,t.context,t.maxStrLength,t.maxBinLength,t.maxArrayLength,t.maxMapLength,t.maxExtLength).decodeStream(n)}async function H(e=1e3){return new Promise((t=>{setTimeout(t,e)}))}class F extends Error{}async function z(e){let t=0;for(;;)try{return await e()}catch(e){if(e instanceof F)throw e;if(t>=10)throw console.error("Reached the maximum number of attempts!"),e;const n=t+Math.random();console.error(`Got error (attempts: ${t}, wait: ${n.toFixed(2)})`,e);const r=Math.ceil(n),o=n/r;for(let e=0;e<r;e++)console.warn(`Retrying in ${(n-e*o).toFixed(2)} seconds`),await H(1e3*o);t++}}function V(e){return[`background: ${e}`,"border: 1px solid rgba(0, 0, 0, 0.5)","border-radius: 2px","padding: 0 2px","color: #000","font-weight: bold"].join(";")}!function(e){e.MAYU_SESSION="application/vnd.mayu.session",e.MAYU_STREAM="application/vnd.mayu.eventstream"}(x||(x={}));var K=function(e="mayu/"){return{info:console.info.bind(console,`%c${e}info`,V("#35baf6")),log:console.info.bind(console,`%c${e}log`,V("#ccc")),error:console.error.bind(console,`%c${e}error`,V("#f6685e")),warn:console.warn.bind(console,`%c${e}warn`,V("#ffc107")),success:console.info.bind(console,`%c${e}success`,V("#a2cf6e")),group:console.group.bind(console),groupEnd:console.groupEnd.bind(console)}}();const q=new Promise((async e=>{if("undefined"!=typeof DecompressionStream)return K.success("Using standard DecompressionStream"),e(DecompressionStream);K.warn("Using DecompressionStream polyfill"),e((await import("./DecompressionStreamPolyfill-0710fe09.js")).default)}));var Y=await q;async function X(e,t){const n=await function(e,t){if(!t)return z((()=>fetch(`/__mayu/session/${e}/init`,{method:"POST"})));return z((()=>fetch(`/__mayu/session/${e}/resume`,{method:"POST",headers:{"content-type":x.MAYU_SESSION},body:t})))}(e,t);if(!n.ok){const e=await n.text();if(503==n.status)throw new Error(`${n.status}: ${e}`);throw new F(`${n.status}: ${e}`)}if(!n.body)throw new F("body is null");const r=new Y("deflate-raw");return n.body.pipeThrough(r)}function G(e){return e instanceof Error?e.message:"string"==typeof e?e:String(e)}async function*J(e){let t,n=!0,r=!1;const o=function(){const e=new v;return e.register({type:1,encode(){throw new Error("Not implemented")},decode:e=>new Blob([e],{type:"application/vnd.mayu.session"})}),e}();let i;for(;n;)try{const s=await z((()=>X(e,t)));try{for await(const n of R(s,{extensionCodec:o})){const[o,s,a]=n;r||(r=!0,yield["system.connected",{}]),t&&(K.info("Clearing encryptedState"),t=void 0);try{switch(s){case"session.transfer":yield["session.transfer",{}],t=a,K.info("Setting encryptedState",a);break;case"pong":yield["ping",{values:{client:performance.now()-Number(a.pong),server:a.server},region:a.region,instance:a.instance}];break;case"ping":Q(e,"ping",{pong:a,ping:performance.now()});break;default:yield[s,a]}}catch(e){i=G(e),K.error(e)}}}catch(e){i=G(e),K.error(e)}r=!1,n&&(i||="Stream ended unexpectedly"),yield["system.disconnected",{transferring:!!t,reason:i}]}catch(e){if(K.error(e),e instanceof F)return n=!1,r=!1,void(yield["system.disconnected",{reason:e.message}]);await H(1e3)}}async function Q(e,t,n){return fetch(`/__mayu/session/${e}/${t}`,{method:"POST",headers:{"content-type":"application/json"},body:(r=n,JSON.stringify(r,((e,t)=>"bigint"==typeof t?Number(t):t instanceof Blob?`Blob{type: ${t.type}, size: ${t.size}}`:t),o))});var r,o}const W=function(){const e=(...e)=>{};return{info:e,log:e,warn:e,error:e,success:e,group:e,groupEnd:e}}();function Z(e,t){if("SCRIPT"!==t.tagName)for(const e of t.childNodes)Z(t,e);else e.replaceChild(function(e){const t=document.createElement("script");t.text=e.innerHTML;for(const n of e.attributes)t.setAttribute(n.name,n.value);return t}(t),t)}function ee(e){if(e instanceof HTMLInputElement&&e.autofocus)e.focus();else for(const t of e.childNodes)ee(t)}class te{#e=new Map;constructor(e,t=document.documentElement){this.updateCache(t,e)}apply(e){for(const t of e)this.applyPatch(t)}applyPatch(e){switch(e.type){case"insert":return void this.insert(e);case"move":this.move(e);break;case"remove":this.remove(e.id);break;case"css":{const t=this.#t(e.id).node;e.value?t.style.setProperty(e.attr,e.value):t.style.removeProperty(e.attr)}case"text":"text"in e&&this.updateText(e.id,e.text),"append"in e&&this.appendText(e.id,e.append);break;case"attr":void 0!==e.value?this.setAttribute(e.id,e.name,e.value):this.removeAttribute(e.id,e.name);break;case"stylesheet":for(const t of e.paths){if(document.querySelector(`link[href="${t}"]`))continue;const e=document.createElement("link");e.setAttribute("rel","stylesheet"),e.setAttribute("href",t),document.head.insertAdjacentElement("beforeend",e)}break;default:console.error("Unknown patch",e)}}updateText(e,t){const n=this.#t(e).node;if(n.nodeType!==n.TEXT_NODE)throw new Error("Trying to update text on a non text node");n.textContent=t}appendText(e,t){const n=this.#t(e).node;if(n.nodeType!==n.TEXT_NODE)throw new Error("Trying to update text on a non text node");n.textContent+=t}setAttribute(e,t,n){const r=this.#t(e).node;"open"===t&&r instanceof HTMLDialogElement?r.showModal():r instanceof HTMLInputElement&&("value"===t&&(r.value=n),"checked"===t&&(r.checked=!0),"indeterminate"===t)?r.indeterminate=!0:(t="initial_value"===t?"value":t.replaceAll(/_/g,""),r.setAttribute(t,n))}removeAttribute(e,t){const n=this.#t(e).node;"open"===t&&n instanceof HTMLDialogElement&&(n.open=!1,n.close()),n instanceof HTMLInputElement&&("value"===t&&(n.value=""),"checked"===t&&(n.checked=!1),"indeterminate"===t)?n.indeterminate=!1:n.removeAttribute(t)}insert({parent:e,before:t,after:n,ids:r,html:o}){W.group("Trying to insert html into",e);const i=this.#t(e),s=t||n,a=s&&this.#e.get(s),c=document.createRange().createContextualFragment(`<template>${o}</template>`).firstElementChild.content,u=Array.from(c.childNodes).reverse();[r].flat().forEach(((e,t)=>{i.childIds.add(e.id);const r=this.#e.get(e.id),o=r?.node||u[t],s=a?n?a.node.nextSibling:a.node:null,c=i.node.insertBefore(o,s);r&&(r.node.outerHTML=o.outerHTML),requestIdleCallback((()=>{ee(c)})),requestIdleCallback((()=>{Z(i.node,c)})),this.updateCache(c,e)})),W.groupEnd()}#t(e){const t=this.#e.get(e);if(!t)throw W.error("Could not find",e,"in cache!"),W.error(Array.from(this.#e.keys())),new Error(`Could not find ${e} in cache!`);return t}remove(e){W.info("Trying to remove",e);try{const t=this.#t(e),n=t.node.parentNode;if(n){const r=n.__MAYU_ID,o=this.#e.get(r);W.log("Removing child",t.node.textContent),n.removeChild(t.node),o&&o.childIds.delete(e)}else W.warn("Node",t.node.__MAYU_ID,"has no parent??");this.#n(e,!1)}catch(e){W.warn(e)}}move({id:e,parent:t,before:n,after:r}){const o=this.#t(e),i=this.#t(t),s=n||r,a=s&&this.#e.get(s),c=a?a.node:null;W.log("Moving",o.node.textContent,n?"before":r?"after":"last",c?.textContent||i.node.__MAYU_ID),W.log({before:n,after:r}),W.log(c?.textContent),i.node.insertBefore(o.node,c)}#n(e,t=!1){const n=this.#e.get(e);if(n){if(W.group("Removing from cache",e),t){const t=this.#e.get(n.node.parentNode.__MAYU_ID);t?.childIds?.delete(e)}this.#e.delete(e),n.childIds.forEach((e=>{this.#n(e,!1)})),n.childIds.delete(e),W.groupEnd()}}isIgnoredNode(e){if(e.nodeType===e.TEXT_NODE)return!1;if(e.nodeType===e.COMMENT_NODE)return!1;if(e.nodeType===e.ELEMENT_NODE){if("string"==typeof e.dataset.mayuId)return!1}return!0}updateCache(e,t){if(!e)throw W.error(t),new Error("No node found for idTreeNode");const n=new Set((t.ch||[]).map((e=>e.id)));this.#n(t.id),this.#e.set(t.id,{node:e,childIds:n}),e.__MAYU_ID=t.id,W.group("Add to cache",t.id,"type",e.nodeName,t.type);let r=0;const o=t.ch||[];e.childNodes.forEach((e=>{if(this.isIgnoredNode(e))return void W.warn("Ignored:",e);const n=o[r++];n?this.updateCache(e,n):W.error("No childIdNode at index",r,"on node",null,"with parent id",t.id,"and child node",null)})),o.length,W.groupEnd()}}function ne(e,t=[],n={}){const r=document.createElement(e);for(const[e,t]of Object.entries(n))t&&(!0===t?r.setAttribute(e,e):r.setAttribute(e,t));return t.forEach((e=>{e instanceof Node?r.appendChild(e):e&&r.appendChild(document.createTextNode(String(e)))})),r}function re(e){if(e instanceof HTMLFormElement){const t=Object.fromEntries(new FormData(e).entries());return{tagName:e.tagName,id:e.id,method:e.method,target:e.target,name:e.name,formData:t}}return e instanceof HTMLSelectElement?{tagName:e.tagName,id:e.id,type:e.type,name:e.name,value:e.value}:e instanceof HTMLDetailsElement?{tagName:e.tagName,id:e.id,open:e.open}:e instanceof HTMLInputElement?{tagName:e.tagName,id:e.id,type:e.type,name:e.name,value:e.value,checked:e.checked}:e instanceof HTMLButtonElement?{tagName:e.tagName,id:e.id,type:e.type,name:e.name,value:e.value}:e instanceof HTMLElement?{tagName:e.tagName,id:e.id}:{}}const oe=new Promise((e=>{if("loading"!==document.readyState)return e();window.addEventListener("DOMContentLoaded",(()=>e()))}));async function ie({type:e,message:t,backtrace:n}){await import("./custom-elements/mayu-exception-63df4e8c.js");const r=n.filter((e=>!/\/vendor\/bundle\//.test(e))).join("\n"),o=ne("mayu-exception",[ne("span",[`${e}: ${t}`],{slot:"title"}),ne("span",[r],{slot:"backtrace"})]);document.body.appendChild(o)}class se{#r;constructor(e){this.#r=e,oe.then((()=>{window.addEventListener("popstate",(()=>ae(this.#r,location.pathname)))}))}async handle(e,t){(function(e){return!("undefined"!=typeof TouchEvent&&e instanceof TouchEvent)})(e)&&e.preventDefault();const n=function(e){const t={};return t.type=e.constructor.name,e.currentTarget&&(t.currentTarget=re(e.currentTarget)),e.target&&(t.target=re(e.target)),e instanceof MouseEvent&&(t.buttons=e.buttons),e instanceof SubmitEvent&&e.submitter instanceof HTMLElement&&(t.submitter=re(e.submitter)),t}(e);console.log(n),await function(e,t,n){return fetch(`/__mayu/session/${e}/callback/${t}`,{method:"POST",headers:new Headers({"content-type":"application/json","x-request-time":String(performance.now())}),body:JSON.stringify(n)}).then(ce)}(this.#r,t,n);const r=setTimeout((()=>{}),1);clearTimeout(r)}async navigate(e){if(e.metaKey||e.ctrlKey)return;e.preventDefault();const t=e.target.closest("a");if(!t)return void K.error("Could not find anchor element for",e.target);const n=new URL(t.href);return ae(this.#r,n.pathname+n.search)}}async function ae(e,t){return fetch(`/__mayu/session/${e}/navigate`,{method:"POST",headers:new Headers({"content-type":"text/plain; charset=utf-8","x-request-time":String(performance.now())}),body:t}).then(ce)}function ce(e){const t=e.headers.get("x-request-time");return t&&console.log("Pong:",performance.now()-Number(t),"ms"),e}var ue=async function(e){const t=function(e){const t=e.lastIndexOf("#");if(-1===t)throw new Error(`No # found in script url: ${e}`);return e.slice(t+1)}(e),n=new se(t);let r;window.Mayu=n;const o=document.createElement("mayu-disconnected"),i=document.createElement("mayu-ping");i.setAttribute("region","Connecting..."),i.setAttribute("status","connecting"),document.body.appendChild(i);for await(const[e,n]of J(t))switch(e){case"system.connected":import("./custom-elements/mayu-ping-f7c763db.js"),import("./custom-elements/mayu-disconnected-9f349f46.js"),import("./custom-elements/mayu-progress-bar-eb3e1ac8.js"),import("./custom-elements/mayu-exception-63df4e8c.js"),import("./custom-elements/mayu-alert-cd7ad2a4.js"),i.setAttribute("region","Connected!"),i.setAttribute("status","connected"),K.success("Connected!"),document.body.querySelectorAll("mayu-disconnected").forEach((e=>e.remove()));break;case"system.disconnected":if(n.transferring){i.setAttribute("region","Transferring…"),i.setAttribute("status","transferring");break}i.setAttribute("region","Disconnected"),i.setAttribute("status","disconnected"),K.error("Disconnected"),o.setAttribute("reason",n.reason),o.parentElement!==document.body&&document.body.appendChild(o);break;case"session.init":await oe,r=new te(n.ids);break;case"session.patch":r?.apply(n);break;case"session.navigate":const t=n.path;t!==location.pathname&&(K.info("Navigating to",t),history.pushState({},"",t));break;case"session.action":s(n.type,n.payload);break;case"session.keep_alive":break;case"session.transfer":i.setAttribute("region","Transferring"),i.setAttribute("status","transferring");break;case"session.exception":ie(n);break;case"ping":const a=Object.values(n.values),c=a.reduce(((e,t)=>e+t),0)/a.length;i.setAttribute("ping",`${c.toFixed(2)} ms`),i.setAttribute("instance",n.instance),i.setAttribute("region",n.region),i.setAttribute("status","ping");break;default:K.warn("Unhandled event:",e,n)}function s(e,t){switch(e){case"scroll_into_view":!function(e,t){const n=document.querySelector(e);n?n.scrollIntoView({block:"start",inline:"nearest",behavior:"smooth",...t}):console.error("Could not find element to scrollIntoView, selector:",e)}(t.selector,t.options||{});break;case"alert":!async function(e){await import("./custom-elements/mayu-alert-cd7ad2a4.js");const t=document.createElement("mayu-alert");t.setAttribute("message",e),document.body.appendChild(t)}(t);break;default:K.error("Unhandled action:",e,t)}}}(import.meta.url);export{ue as default};//# sourceMappingURL=main-b7403aa1.js.map