@instincthub/react-ui 0.0.1

package/dist/node_modules/fflate/esm/browser.js

@@ -0,0 +1,2 @@
+var r=Uint8Array,n=Uint16Array,a=Int32Array,e=new r([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]),t=new r([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]),f=new r([16,17,18,0,8,7,9,6,10,5,11,4,12,3,13,2,14,1,15]),i=function(r,e){for(var t=new n(31),f=0;f<31;++f)t[f]=e+=1<<r[f-1];var i=new a(t[30]);for(f=1;f<30;++f)for(var o=t[f];o<t[f+1];++o)i[o]=o-t[f]<<5|f;return{b:t,r:i}},o=i(e,2),v=o.b,l=o.r;v[28]=258,l[258]=28;for(var u=i(t,0),c=u.b,s=u.r,h=new n(32768),d=0;d<32768;++d){var w=(43690&d)>>1|(21845&d)<<1;w=(61680&(w=(52428&w)>>2|(13107&w)<<2))>>4|(3855&w)<<4,h[d]=((65280&w)>>8|(255&w)<<8)>>1}var g=function(r,a,e){for(var t=r.length,f=0,i=new n(a);f<t;++f)r[f]&&++i[r[f]-1];var o,v=new n(a);for(f=1;f<a;++f)v[f]=v[f-1]+i[f-1]<<1;if(e){o=new n(1<<a);var l=15-a;for(f=0;f<t;++f)if(r[f])for(var u=f<<4|r[f],c=a-r[f],s=v[r[f]-1]++<<c,d=s|(1<<c)-1;s<=d;++s)o[h[s]>>l]=u}else for(o=new n(t),f=0;f<t;++f)r[f]&&(o[f]=h[v[r[f]-1]++]>>15-r[f]);return o},b=new r(288);for(d=0;d<144;++d)b[d]=8;for(d=144;d<256;++d)b[d]=9;for(d=256;d<280;++d)b[d]=7;for(d=280;d<288;++d)b[d]=8;var y=new r(32);for(d=0;d<32;++d)y[d]=5;var m=g(b,9,0),p=g(b,9,1),M=g(y,5,0),k=g(y,5,1),x=function(r){for(var n=r[0],a=1;a<r.length;++a)r[a]>n&&(n=r[a]);return n},T=function(r,n,a){var e=n/8|0;return(r[e]|r[e+1]<<8)>>(7&n)&a},z=function(r,n){var a=n/8|0;return(r[a]|r[a+1]<<8|r[a+2]<<16)>>(7&n)},E=function(r){return(r+7)/8|0},A=function(n,a,e){return(null==a||a<0)&&(a=0),(null==e||e>n.length)&&(e=n.length),new r(n.subarray(a,e))},U=["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"],D=function(r,n,a){var e=new Error(n||U[r]);if(e.code=r,Error.captureStackTrace&&Error.captureStackTrace(e,D),!a)throw e;return e},F=function(r,n,a){a<<=7&n;var e=n/8|0;r[e]|=a,r[e+1]|=a>>8},S=function(r,n,a){a<<=7&n;var e=n/8|0;r[e]|=a,r[e+1]|=a>>8,r[e+2]|=a>>16},I=function(a,e){for(var t=[],f=0;f<a.length;++f)a[f]&&t.push({s:f,f:a[f]});var i=t.length,o=t.slice();if(!i)return{t:H,l:0};if(1==i){var v=new r(t[0].s+1);return v[t[0].s]=1,{t:v,l:1}}t.sort((function(r,n){return r.f-n.f})),t.push({s:-1,f:25001});var l=t[0],u=t[1],c=0,s=1,h=2;for(t[0]={s:-1,f:l.f+u.f,l:l,r:u};s!=i-1;)l=t[t[c].f<t[h].f?c++:h++],u=t[c!=s&&t[c].f<t[h].f?c++:h++],t[s++]={s:-1,f:l.f+u.f,l:l,r:u};var d=o[0].s;for(f=1;f<i;++f)o[f].s>d&&(d=o[f].s);var w=new n(d+1),g=O(t[s-1],w,0);if(g>e){f=0;var b=0,y=g-e,m=1<<y;for(o.sort((function(r,n){return w[n.s]-w[r.s]||r.f-n.f}));f<i;++f){var p=o[f].s;if(!(w[p]>e))break;b+=m-(1<<g-w[p]),w[p]=e}for(b>>=y;b>0;){var M=o[f].s;w[M]<e?b-=1<<e-w[M]++-1:++f}for(;f>=0&&b;--f){var k=o[f].s;w[k]==e&&(--w[k],++b)}g=e}return{t:new r(w),l:g}},O=function(r,n,a){return-1==r.s?Math.max(O(r.l,n,a+1),O(r.r,n,a+1)):n[r.s]=a},j=function(r){for(var a=r.length;a&&!r[--a];);for(var e=new n(++a),t=0,f=r[0],i=1,o=function(r){e[t++]=r},v=1;v<=a;++v)if(r[v]==f&&v!=a)++i;else{if(!f&&i>2){for(;i>138;i-=138)o(32754);i>2&&(o(i>10?i-11<<5|28690:i-3<<5|12305),i=0)}else if(i>3){for(o(f),--i;i>6;i-=6)o(8304);i>2&&(o(i-3<<5|8208),i=0)}for(;i--;)o(f);i=1,f=r[v]}return{c:e.subarray(0,t),n:a}},q=function(r,n){for(var a=0,e=0;e<n.length;++e)a+=r[e]*n[e];return a},B=function(r,n,a){var e=a.length,t=E(n+2);r[t]=255&e,r[t+1]=e>>8,r[t+2]=255^r[t],r[t+3]=255^r[t+1];for(var f=0;f<e;++f)r[t+f+4]=a[f];return 8*(t+4+e)},C=function(r,a,i,o,v,l,u,c,s,h,d){F(a,d++,i),++v[256];for(var w=I(v,15),p=w.t,k=w.l,x=I(l,15),T=x.t,z=x.l,E=j(p),A=E.c,U=E.n,D=j(T),O=D.c,C=D.n,G=new n(19),H=0;H<A.length;++H)++G[31&A[H]];for(H=0;H<O.length;++H)++G[31&O[H]];for(var J=I(G,7),K=J.t,L=J.l,N=19;N>4&&!K[f[N-1]];--N);var P,Q,R,V,W=h+5<<3,X=q(v,b)+q(l,y)+u,Y=q(v,p)+q(l,T)+u+14+3*N+q(G,K)+2*G[16]+3*G[17]+7*G[18];if(s>=0&&W<=X&&W<=Y)return B(a,d,r.subarray(s,s+h));if(F(a,d,1+(Y<X)),d+=2,Y<X){P=g(p,k,0),Q=p,R=g(T,z,0),V=T;var Z=g(K,L,0);F(a,d,U-257),F(a,d+5,C-1),F(a,d+10,N-4),d+=14;for(H=0;H<N;++H)F(a,d+3*H,K[f[H]]);d+=3*N;for(var $=[A,O],_=0;_<2;++_){var rr=$[_];for(H=0;H<rr.length;++H){var nr=31&rr[H];F(a,d,Z[nr]),d+=K[nr],nr>15&&(F(a,d,rr[H]>>5&127),d+=rr[H]>>12)}}}else P=m,Q=b,R=M,V=y;for(H=0;H<c;++H){var ar=o[H];if(ar>255){S(a,d,P[(nr=ar>>18&31)+257]),d+=Q[nr+257],nr>7&&(F(a,d,ar>>23&31),d+=e[nr]);var er=31&ar;S(a,d,R[er]),d+=V[er],er>3&&(S(a,d,ar>>5&8191),d+=t[er])}else S(a,d,P[ar]),d+=Q[ar]}return S(a,d,P[256]),d+Q[256]},G=new a([65540,131080,131088,131104,262176,1048704,1048832,2114560,2117632]),H=new r(0),J=function(){var r=1,n=0;return{p:function(a){for(var e=r,t=n,f=0|a.length,i=0;i!=f;){for(var o=Math.min(i+2655,f);i<o;++i)t+=e+=a[i];e=(65535&e)+15*(e>>16),t=(65535&t)+15*(t>>16)}r=e,n=t},d:function(){return(255&(r%=65521))<<24|(65280&r)<<8|(255&(n%=65521))<<8|n>>8}}},K=function(f,i,o,v,u){if(!u&&(u={l:1},i.dictionary)){var c=i.dictionary.subarray(-32768),h=new r(c.length+f.length);h.set(c),h.set(f,c.length),f=h,u.w=c.length}return function(f,i,o,v,u,c){var h=c.z||f.length,d=new r(v+h+5*(1+Math.ceil(h/7e3))+u),w=d.subarray(v,d.length-u),g=c.l,b=7&(c.r||0);if(i){b&&(w[0]=c.r>>3);for(var y=G[i-1],m=y>>13,p=8191&y,M=(1<<o)-1,k=c.p||new n(32768),x=c.h||new n(M+1),T=Math.ceil(o/3),z=2*T,U=function(r){return(f[r]^f[r+1]<<T^f[r+2]<<z)&M},D=new a(25e3),F=new n(288),S=new n(32),I=0,O=0,j=c.i||0,q=0,H=c.w||0,J=0;j+2<h;++j){var K=U(j),L=32767&j,N=x[K];if(k[L]=N,x[K]=L,H<=j){var P=h-j;if((I>7e3||q>24576)&&(P>423||!g)){b=C(f,w,0,D,F,S,O,q,J,j-J,b),q=I=O=0,J=j;for(var Q=0;Q<286;++Q)F[Q]=0;for(Q=0;Q<30;++Q)S[Q]=0}var R=2,V=0,W=p,X=L-N&32767;if(P>2&&K==U(j-X))for(var Y=Math.min(m,P)-1,Z=Math.min(32767,j),$=Math.min(258,P);X<=Z&&--W&&L!=N;){if(f[j+R]==f[j+R-X]){for(var _=0;_<$&&f[j+_]==f[j+_-X];++_);if(_>R){if(R=_,V=X,_>Y)break;var rr=Math.min(X,_-2),nr=0;for(Q=0;Q<rr;++Q){var ar=j-X+Q&32767,er=ar-k[ar]&32767;er>nr&&(nr=er,N=ar)}}}X+=(L=N)-(N=k[L])&32767}if(V){D[q++]=268435456|l[R]<<18|s[V];var tr=31&l[R],fr=31&s[V];O+=e[tr]+t[fr],++F[257+tr],++S[fr],H=j+R,++I}else D[q++]=f[j],++F[f[j]]}}for(j=Math.max(j,H);j<h;++j)D[q++]=f[j],++F[f[j]];b=C(f,w,g,D,F,S,O,q,J,j-J,b),g||(c.r=7&b|w[b/8|0]<<3,b-=7,c.h=x,c.p=k,c.i=j,c.w=H)}else{for(j=c.w||0;j<h+g;j+=65535){var ir=j+65535;ir>=h&&(w[b/8|0]=g,ir=h),b=B(w,b+1,f.subarray(j,ir))}c.i=h}return A(d,0,v+E(b)+u)}(f,null==i.level?6:i.level,null==i.mem?u.l?Math.ceil(1.5*Math.max(8,Math.min(13,Math.log(f.length)))):20:12+i.mem,o,v,u)},L=function(r,n,a){for(;a;++n)r[n]=a,a>>>=8};function N(r,n){n||(n={});var a=J();a.p(r);var e=K(r,n,n.dictionary?6:2,4);return function(r,n){var a=n.level,e=0==a?0:a<6?1:9==a?3:2;if(r[0]=120,r[1]=e<<6|(n.dictionary&&32),r[1]|=31-(r[0]<<8|r[1])%31,n.dictionary){var t=J();t.p(n.dictionary),L(r,2,t.d())}}(e,n),L(e,e.length-4,a.d()),e}function P(n,a){return function(n,a,i,o){var l=n.length,u=o?o.length:0;if(!l||a.f&&!a.l)return i||new r(0);var s=!i,h=s||2!=a.i,d=a.i;s&&(i=new r(3*l));var w=function(n){var a=i.length;if(n>a){var e=new r(Math.max(2*a,n));e.set(i),i=e}},b=a.f||0,y=a.p||0,m=a.b||0,M=a.l,U=a.d,F=a.m,S=a.n,I=8*l;do{if(!M){b=T(n,y,1);var O=T(n,y+1,3);if(y+=3,!O){var j=n[(Q=E(y)+4)-4]|n[Q-3]<<8,q=Q+j;if(q>l){d&&D(0);break}h&&w(m+j),i.set(n.subarray(Q,q),m),a.b=m+=j,a.p=y=8*q,a.f=b;continue}if(1==O)M=p,U=k,F=9,S=5;else if(2==O){var B=T(n,y,31)+257,C=T(n,y+10,15)+4,G=B+T(n,y+5,31)+1;y+=14;for(var H=new r(G),J=new r(19),K=0;K<C;++K)J[f[K]]=T(n,y+3*K,7);y+=3*C;var L=x(J),N=(1<<L)-1,P=g(J,L,1);for(K=0;K<G;){var Q,R=P[T(n,y,N)];if(y+=15&R,(Q=R>>4)<16)H[K++]=Q;else{var V=0,W=0;for(16==Q?(W=3+T(n,y,3),y+=2,V=H[K-1]):17==Q?(W=3+T(n,y,7),y+=3):18==Q&&(W=11+T(n,y,127),y+=7);W--;)H[K++]=V}}var X=H.subarray(0,B),Y=H.subarray(B);F=x(X),S=x(Y),M=g(X,F,1),U=g(Y,S,1)}else D(1);if(y>I){d&&D(0);break}}h&&w(m+131072);for(var Z=(1<<F)-1,$=(1<<S)-1,_=y;;_=y){var rr=(V=M[z(n,y)&Z])>>4;if((y+=15&V)>I){d&&D(0);break}if(V||D(2),rr<256)i[m++]=rr;else{if(256==rr){_=y,M=null;break}var nr=rr-254;if(rr>264){var ar=e[K=rr-257];nr=T(n,y,(1<<ar)-1)+v[K],y+=ar}var er=U[z(n,y)&$],tr=er>>4;if(er||D(3),y+=15&er,Y=c[tr],tr>3&&(ar=t[tr],Y+=z(n,y)&(1<<ar)-1,y+=ar),y>I){d&&D(0);break}h&&w(m+131072);var fr=m+nr;if(m<Y){var ir=u-Y,or=Math.min(Y,fr);for(ir+m<0&&D(3);m<or;++m)i[m]=o[ir+m]}for(;m<fr;++m)i[m]=i[m-Y]}}a.l=M,a.p=_,a.b=m,a.f=b,M&&(b=1,a.m=F,a.d=U,a.n=S)}while(!b);return m!=i.length&&s?A(i,0,m):i.subarray(0,m)}(n.subarray((i=n,o=a&&a.dictionary,(8!=(15&i[0])||i[0]>>4>7||(i[0]<<8|i[1])%31)&&D(6,"invalid zlib data"),(i[1]>>5&1)==+!o&&D(6,"invalid zlib data: "+(32&i[1]?"need":"unexpected")+" dictionary"),2+(i[1]>>3&4)),-4),{i:2},a&&a.out,a&&a.dictionary);var i,o}var Q="undefined"!=typeof TextDecoder&&new TextDecoder;try{Q.decode(H,{stream:!0})}catch(r){}export{P as unzlibSync,N as zlibSync};
+//# sourceMappingURL=browser.js.map

package/dist/node_modules/fflate/esm/browser.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"browser.js","sources":["../../../../node_modules/fflate/esm/browser.js"],"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    return new u8(v.subarray(s, e));\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    var noBuf = !buf;\n    // have to estimate size\n    var resize = noBuf || st.i != 2;\n    // no state\n    var noSt = st.i;\n    // Assumes roughly 33% compression ratio average\n    if (noBuf)\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 (resize)\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 (resize)\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 (resize)\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)\n                    buf[bt] = buf[bt - dt];\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    // don't reallocate for streams or user buffers\n    return bt != buf.length && noBuf ? slc(buf, 0, bt) : buf.subarray(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 ? (st.l ? Math.ceil(Math.max(8, Math.min(13, Math.log(dat.length))) * 1.5) : 20) : (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) {\n        if (ev.data.length) {\n            strm.push(ev.data[0], ev.data[1]);\n            postMessage([ev.data[0].length]);\n        }\n        else\n            strm.flush();\n    };\n};\n// async stream attach\nvar astrmify = function (fns, strm, opts, init, id, flush, 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 if (dat.length == 1) {\n            strm.queuedSize -= dat[0];\n            if (strm.ondrain)\n                strm.ondrain(dat[0]);\n        }\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.queuedSize = 0;\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        strm.queuedSize += d.length;\n        w.postMessage([d, t = f], [d.buffer]);\n    };\n    strm.terminate = function () { w.terminate(); };\n    if (flush) {\n        strm.flush = function () { w.postMessage([]); };\n    }\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            this.b.set(chunk.subarray(0, split), this.s.z);\n            this.s.z = this.b.length;\n            this.p(this.b, false);\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    /**\n     * Flushes buffered uncompressed data. Useful to immediately retrieve the\n     * deflated output for small inputs.\n     */\n    Deflate.prototype.flush = function () {\n        if (!this.ondata)\n            err(5);\n        if (this.s.l)\n            err(4);\n        this.p(this.b, false);\n        this.s.w = this.s.i, this.s.i -= 2;\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, 1);\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, 0);\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    /**\n     * Flushes buffered uncompressed data. Useful to immediately retrieve the\n     * GZIPped output for small inputs.\n     */\n    Gzip.prototype.flush = function () {\n        Deflate.prototype.flush.call(this);\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, 1);\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 && !final) {\n            this.v = shft(this.s.p) + 9;\n            this.s = { i: 0 };\n            this.o = new u8(0);\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 = 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, 0, function (offset) { return _this.onmember && _this.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    /**\n     * Flushes buffered uncompressed data. Useful to immediately retrieve the\n     * zlibbed output for small inputs.\n     */\n    Zlib.prototype.flush = function () {\n        Deflate.prototype.flush.call(this);\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, 1);\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, 0);\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.o = StrmOpt.call(this, opts, cb) || {};\n        this.G = Gunzip;\n        this.I = Inflate;\n        this.Z = Unzlib;\n    }\n    // init substream\n    // overriden by AsyncDecompress\n    Decompress.prototype.i = function () {\n        var _this = this;\n        this.s.ondata = function (dat, final) {\n            _this.ondata(dat, final);\n        };\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                this.s = (this.p[0] == 31 && this.p[1] == 139 && this.p[2] == 8)\n                    ? new this.G(this.o)\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)\n                        : new this.Z(this.o);\n                this.i();\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        Decompress.call(this, opts, cb);\n        this.queuedSize = 0;\n        this.G = AsyncGunzip;\n        this.I = AsyncInflate;\n        this.Z = AsyncUnzlib;\n    }\n    AsyncDecompress.prototype.i = function () {\n        var _this = this;\n        this.s.ondata = function (err, dat, final) {\n            _this.ondata(err, dat, final);\n        };\n        this.s.ondrain = function (size) {\n            _this.queuedSize -= size;\n            if (_this.ondrain)\n                _this.ondrain(size);\n        };\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        this.queuedSize += chunk.length;\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 = this;\n        if (!opts)\n            opts = {};\n        ZipPassThrough.call(this, filename);\n        this.d = new Deflate(opts, function (dat, final) {\n            _this.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 = this;\n        if (!opts)\n            opts = {};\n        ZipPassThrough.call(this, filename);\n        this.d = new AsyncDeflate(opts, function (err, dat, final) {\n            _this.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 = 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.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.u[ind_1 + 1];\n                        if (nxt)\n                            nxt.r();\n                        else\n                            _this.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.ondata(err, dat, final);\n                    _this.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 = 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.d & 1))\n                        return;\n                    _this.u.splice(-1, 1);\n                    _this.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 = this;\n        this.i = new Inflate(function (dat, final) {\n            _this.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 = this;\n        if (sz < 320000) {\n            this.i = new Inflate(function (dat, final) {\n                _this.ondata(null, dat, final);\n            });\n        }\n        else {\n            this.i = new AsyncInflate(function (err, dat, final) {\n                _this.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 = 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.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.k[0] == chks_3 && _this.c)\n                                        _this.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                    // Synchronously decompress under 512KB, or barely-compressed data\n                    if (su < 524288 || sc > 0.8 * su) {\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"],"names":["u8","Uint8Array","u16","Uint16Array","i32","Int32Array","fleb","fdeb","clim","freb","eb","start","b","i","r","j","_a","fl","revfl","_b","fd","revfd","rev","x","hMap","cd","mb","s","length","l","co","le","rvb","sv","r_1","v","m","flt","fdt","flm","flrm","fdm","fdrm","max","a","bits","d","p","o","bits16","shft","slc","e","subarray","ec","err","ind","msg","nt","Error","code","captureStackTrace","wbits","wbits16","hTree","t","push","f","t2","slice","et","sort","i0","i1","i2","maxSym","tr","mbt","ln","dt","lft","cst","i2_1","i2_2","i2_3","n","Math","lc","c","cl","cli","cln","cls","w","clen","cf","wfblk","out","pos","dat","wblk","final","syms","lf","df","li","bs","bl","dlt","mlb","ddt","mdb","_c","lclt","nlc","_d","lcdt","ndc","lcfreq","_e","lct","mlcb","nlcc","lm","ll","dm","dl","flen","ftlen","dtlen","llm","lcts","it","clct","len","sym","dst","deo","adler","min","dopt","opt","pre","post","st","dictionary","dict","newDat","set","lvl","plvl","z","ceil","lst","msk_1","prev","head","h","bs1_1","bs2_1","hsh","lc_1","wi","hv","imod","pimod","rem","ch_1","dif","maxn","maxd","ml","nl","mmd","md","ti","lin","din","dflt","level","mem","log","wbytes","zlibSync","data","opts","lv","zlh","unzlibSync","buf","sl","noBuf","resize","noSt","cbuf","nbuf","bt","lbt","dbt","tbts","type","hLit","hcLen","tl","ldt","clt","clb","clbmsk","clm","lt","lms","dms","lpos","add","dsym","end","shift","dend","inflt","td","TextDecoder","decode","stream"],"mappings":"AA8BA,IAAIA,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,IAHA,IAAIC,EAAKV,EAAKF,EAAM,GAAIa,EAAKD,EAAGP,EAAGS,EAAQF,EAAGL,EAE1CQ,EAAM,IAAIpB,EAAI,OACTW,EAAI,EAAGA,EAAI,QAASA,EAAG,CAE5B,IAAIU,GAAU,MAAJV,IAAe,GAAW,MAAJA,IAAe,EAE/CU,GAAU,OADVA,GAAU,MAAJA,IAAe,GAAW,MAAJA,IAAe,KACtB,GAAW,KAAJA,IAAe,EAC3CD,EAAIT,KAAY,MAAJU,IAAe,GAAW,IAAJA,IAAe,IAAO,CAC5D,CAIA,IAAIC,WAAkBC,EAAIC,EAAIZ,GAO1B,IANA,IAAIa,EAAIF,EAAGG,OAEPf,EAAI,EAEJgB,EAAI,IAAI3B,EAAIwB,GAETb,EAAIc,IAAKd,EACRY,EAAGZ,MACDgB,EAAEJ,EAAGZ,GAAK,GAGpB,IAIIiB,EAJAC,EAAK,IAAI7B,EAAIwB,GACjB,IAAKb,EAAI,EAAGA,EAAIa,IAAMb,EAClBkB,EAAGlB,GAAMkB,EAAGlB,EAAI,GAAKgB,EAAEhB,EAAI,IAAO,EAGtC,GAAIC,EAAG,CAEHgB,EAAK,IAAI5B,EAAI,GAAKwB,GAElB,IAAIM,EAAM,GAAKN,EACf,IAAKb,EAAI,EAAGA,EAAIc,IAAKd,EAEjB,GAAIY,EAAGZ,GAQH,IANA,IAAIoB,EAAMpB,GAAK,EAAKY,EAAGZ,GAEnBqB,EAAMR,EAAKD,EAAGZ,GAEdsB,EAAIJ,EAAGN,EAAGZ,GAAK,MAAQqB,EAElBE,EAAID,GAAM,GAAKD,GAAO,EAAIC,GAAKC,IAAKD,EAEzCL,EAAGR,EAAIa,IAAMH,GAAOC,CAInC,MAGG,IADAH,EAAK,IAAI5B,EAAIyB,GACRd,EAAI,EAAGA,EAAIc,IAAKd,EACbY,EAAGZ,KACHiB,EAAGjB,GAAKS,EAAIS,EAAGN,EAAGZ,GAAK,OAAU,GAAKY,EAAGZ,IAIrD,OAAOiB,CACV,EAEGO,EAAM,IAAIrC,EAAG,KACjB,IAASa,EAAI,EAAGA,EAAI,MAAOA,EACvBwB,EAAIxB,GAAK,EACb,IAASA,EAAI,IAAKA,EAAI,MAAOA,EACzBwB,EAAIxB,GAAK,EACb,IAASA,EAAI,IAAKA,EAAI,MAAOA,EACzBwB,EAAIxB,GAAK,EACb,IAASA,EAAI,IAAKA,EAAI,MAAOA,EACzBwB,EAAIxB,GAAK,EAEb,IAAIyB,EAAM,IAAItC,EAAG,IACjB,IAASa,EAAI,EAAGA,EAAI,KAAMA,EACtByB,EAAIzB,GAAK,EAEb,IAAI0B,EAAoBf,EAAKa,EAAK,EAAG,GAAIG,EAAqBhB,EAAKa,EAAK,EAAG,GAEvEI,EAAoBjB,EAAKc,EAAK,EAAG,GAAII,EAAqBlB,EAAKc,EAAK,EAAG,GAEvEK,EAAM,SAAUC,GAEhB,IADA,IAAIR,EAAIQ,EAAE,GACD/B,EAAI,EAAGA,EAAI+B,EAAEhB,SAAUf,EACxB+B,EAAE/B,GAAKuB,IACPA,EAAIQ,EAAE/B,IAEd,OAAOuB,CACX,EAEIS,EAAO,SAAUC,EAAGC,EAAGX,GACvB,IAAIY,EAAKD,EAAI,EAAK,EAClB,OAASD,EAAEE,GAAMF,EAAEE,EAAI,IAAM,KAAY,EAAJD,GAAUX,CACnD,EAEIa,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,SAAUhB,EAAGR,EAAGyB,GAMtB,OALS,MAALzB,GAAaA,EAAI,KACjBA,EAAI,IACC,MAALyB,GAAaA,EAAIjB,EAAEP,UACnBwB,EAAIjB,EAAEP,QAEH,IAAI5B,EAAGmC,EAAEkB,SAAS1B,EAAGyB,GAChC,EAsBIE,EAAK,CACL,iBACA,qBACA,yBACA,mBACA,kBACA,oBACJ,CACI,cACA,qBACA,uBACA,8BACA,oBACA,mBACA,oBAIAC,EAAM,SAAUC,EAAKC,EAAKC,GAC1B,IAAIN,EAAI,IAAIO,MAAMF,GAAOH,EAAGE,IAI5B,GAHAJ,EAAEQ,KAAOJ,EACLG,MAAME,mBACNF,MAAME,kBAAkBT,EAAGG,IAC1BG,EACD,MAAMN,EACV,OAAOA,CACX,EAuLIU,EAAQ,SAAUhB,EAAGC,EAAGZ,GACxBA,IAAU,EAAJY,EACN,IAAIC,EAAKD,EAAI,EAAK,EAClBD,EAAEE,IAAMb,EACRW,EAAEE,EAAI,IAAMb,GAAK,CACrB,EAEI4B,EAAU,SAAUjB,EAAGC,EAAGZ,GAC1BA,IAAU,EAAJY,EACN,IAAIC,EAAKD,EAAI,EAAK,EAClBD,EAAEE,IAAMb,EACRW,EAAEE,EAAI,IAAMb,GAAK,EACjBW,EAAEE,EAAI,IAAMb,GAAK,EACrB,EAEI6B,EAAQ,SAAUlB,EAAGpB,GAGrB,IADA,IAAIuC,EAAI,GACCpD,EAAI,EAAGA,EAAIiC,EAAElB,SAAUf,EACxBiC,EAAEjC,IACFoD,EAAEC,KAAK,CAAEvC,EAAGd,EAAGsD,EAAGrB,EAAEjC,KAE5B,IAAIc,EAAIsC,EAAErC,OACNwC,EAAKH,EAAEI,QACX,IAAK1C,EACD,MAAO,CAAEsC,EAAGK,EAAIzC,EAAG,GACvB,GAAS,GAALF,EAAQ,CACR,IAAIQ,EAAI,IAAInC,EAAGiE,EAAE,GAAGtC,EAAI,GAExB,OADAQ,EAAE8B,EAAE,GAAGtC,GAAK,EACL,CAAEsC,EAAG9B,EAAGN,EAAG,EACrB,CACDoC,EAAEM,MAAK,SAAU3B,EAAGhC,GAAK,OAAOgC,EAAEuB,EAAIvD,EAAEuD,CAAI,IAG5CF,EAAEC,KAAK,CAAEvC,GAAI,EAAGwC,EAAG,QACnB,IAAItC,EAAIoC,EAAE,GAAInD,EAAImD,EAAE,GAAIO,EAAK,EAAGC,EAAK,EAAGC,EAAK,EAO7C,IANAT,EAAE,GAAK,CAAEtC,GAAI,EAAGwC,EAAGtC,EAAEsC,EAAIrD,EAAEqD,EAAGtC,EAAGA,EAAGf,EAAGA,GAMhC2D,GAAM9C,EAAI,GACbE,EAAIoC,EAAEA,EAAEO,GAAIL,EAAIF,EAAES,GAAIP,EAAIK,IAAOE,KACjC5D,EAAImD,EAAEO,GAAMC,GAAMR,EAAEO,GAAIL,EAAIF,EAAES,GAAIP,EAAIK,IAAOE,KAC7CT,EAAEQ,KAAQ,CAAE9C,GAAI,EAAGwC,EAAGtC,EAAEsC,EAAIrD,EAAEqD,EAAGtC,EAAGA,EAAGf,EAAGA,GAE9C,IAAI6D,EAASP,EAAG,GAAGzC,EACnB,IAASd,EAAI,EAAGA,EAAIc,IAAKd,EACjBuD,EAAGvD,GAAGc,EAAIgD,IACVA,EAASP,EAAGvD,GAAGc,GAGvB,IAAIiD,EAAK,IAAI1E,EAAIyE,EAAS,GAEtBE,EAAMC,EAAGb,EAAEQ,EAAK,GAAIG,EAAI,GAC5B,GAAIC,EAAMnD,EAAI,CAINb,EAAI,EAAR,IAAWkE,EAAK,EAEZC,EAAMH,EAAMnD,EAAIuD,EAAM,GAAKD,EAE/B,IADAZ,EAAGG,MAAK,SAAU3B,EAAGhC,GAAK,OAAOgE,EAAGhE,EAAEe,GAAKiD,EAAGhC,EAAEjB,IAAMiB,EAAEuB,EAAIvD,EAAEuD,CAAE,IACzDtD,EAAIc,IAAKd,EAAG,CACf,IAAIqE,EAAOd,EAAGvD,GAAGc,EACjB,KAAIiD,EAAGM,GAAQxD,GAKX,MAJAqD,GAAME,GAAO,GAAMJ,EAAMD,EAAGM,IAC5BN,EAAGM,GAAQxD,CAIlB,CAED,IADAqD,IAAOC,EACAD,EAAK,GAAG,CACX,IAAII,EAAOf,EAAGvD,GAAGc,EACbiD,EAAGO,GAAQzD,EACXqD,GAAM,GAAMrD,EAAKkD,EAAGO,KAAU,IAE5BtE,CACT,CACD,KAAOA,GAAK,GAAKkE,IAAMlE,EAAG,CACtB,IAAIuE,EAAOhB,EAAGvD,GAAGc,EACbiD,EAAGQ,IAAS1D,MACVkD,EAAGQ,KACHL,EAET,CACDF,EAAMnD,CACT,CACD,MAAO,CAAEuC,EAAG,IAAIjE,EAAG4E,GAAK/C,EAAGgD,EAC/B,EAEIC,EAAK,SAAUO,EAAGxD,EAAGiB,GACrB,OAAe,GAARuC,EAAE1D,EACH2D,KAAK3C,IAAImC,EAAGO,EAAExD,EAAGA,EAAGiB,EAAI,GAAIgC,EAAGO,EAAEvE,EAAGe,EAAGiB,EAAI,IAC1CjB,EAAEwD,EAAE1D,GAAKmB,CACpB,EAEIyC,EAAK,SAAUC,GAGf,IAFA,IAAI7D,EAAI6D,EAAE5D,OAEHD,IAAM6D,IAAI7D,KAMjB,IAJA,IAAI8D,EAAK,IAAIvF,IAAMyB,GAEf+D,EAAM,EAAGC,EAAMH,EAAE,GAAII,EAAM,EAC3BC,EAAI,SAAU1D,GAAKsD,EAAGC,KAASvD,GAC1BtB,EAAI,EAAGA,GAAKc,IAAKd,EACtB,GAAI2E,EAAE3E,IAAM8E,GAAO9E,GAAKc,IAClBiE,MACD,CACD,IAAKD,GAAOC,EAAM,EAAG,CACjB,KAAOA,EAAM,IAAKA,GAAO,IACrBC,EAAE,OACFD,EAAM,IACNC,EAAED,EAAM,GAAOA,EAAM,IAAO,EAAK,MAAUA,EAAM,GAAM,EAAK,OAC5DA,EAAM,EAEb,MACI,GAAIA,EAAM,EAAG,CAEd,IADAC,EAAEF,KAAQC,EACHA,EAAM,EAAGA,GAAO,EACnBC,EAAE,MACFD,EAAM,IACNC,EAAID,EAAM,GAAM,EAAK,MAAOA,EAAM,EACzC,CACD,KAAOA,KACHC,EAAEF,GACNC,EAAM,EACND,EAAMH,EAAE3E,EACX,CAEL,MAAO,CAAE2E,EAAGC,EAAGpC,SAAS,EAAGqC,GAAML,EAAG1D,EACxC,EAEImE,EAAO,SAAUC,EAAIN,GAErB,IADA,IAAI5D,EAAI,EACChB,EAAI,EAAGA,EAAI4E,EAAG7D,SAAUf,EAC7BgB,GAAKkE,EAAGlF,GAAK4E,EAAG5E,GACpB,OAAOgB,CACX,EAGImE,EAAQ,SAAUC,EAAKC,EAAKC,GAE5B,IAAIxE,EAAIwE,EAAIvE,OACRoB,EAAIE,EAAKgD,EAAM,GACnBD,EAAIjD,GAAS,IAAJrB,EACTsE,EAAIjD,EAAI,GAAKrB,GAAK,EAClBsE,EAAIjD,EAAI,GAAc,IAATiD,EAAIjD,GACjBiD,EAAIjD,EAAI,GAAkB,IAAbiD,EAAIjD,EAAI,GACrB,IAAK,IAAInC,EAAI,EAAGA,EAAIc,IAAKd,EACrBoF,EAAIjD,EAAInC,EAAI,GAAKsF,EAAItF,GACzB,OAAqB,GAAbmC,EAAI,EAAIrB,EACpB,EAEIyE,EAAO,SAAUD,EAAKF,EAAKI,EAAOC,EAAMC,EAAIC,EAAI9F,EAAI+F,EAAIC,EAAIC,EAAI5D,GAChEe,EAAMmC,EAAKlD,IAAKsD,KACdE,EAAG,KAML,IALA,IAAIvF,EAAKgD,EAAMuC,EAAI,IAAKK,EAAM5F,EAAGiD,EAAG4C,EAAM7F,EAAGa,EACzCV,EAAK6C,EAAMwC,EAAI,IAAKM,EAAM3F,EAAG8C,EAAG8C,EAAM5F,EAAGU,EACzCmF,EAAKzB,EAAGqB,GAAMK,EAAOD,EAAGxB,EAAG0B,EAAMF,EAAG3B,EACpC8B,EAAK5B,EAAGuB,GAAMM,EAAOD,EAAG3B,EAAG6B,EAAMF,EAAG9B,EACpCiC,EAAS,IAAIpH,EAAI,IACZW,EAAI,EAAGA,EAAIoG,EAAKrF,SAAUf,IAC7ByG,EAAiB,GAAVL,EAAKpG,IAClB,IAASA,EAAI,EAAGA,EAAIuG,EAAKxF,SAAUf,IAC7ByG,EAAiB,GAAVF,EAAKvG,IAGlB,IAFA,IAAI0G,EAAKvD,EAAMsD,EAAQ,GAAIE,EAAMD,EAAGtD,EAAGwD,EAAOF,EAAG1F,EAC7C6F,EAAO,GACJA,EAAO,IAAMF,EAAIhH,EAAKkH,EAAO,MAAOA,GAE3C,IAKIC,EAAIC,EAAIC,EAAIC,EALZC,EAAQpB,EAAK,GAAM,EACnBqB,EAAQlC,EAAKS,EAAIlE,GAAOyD,EAAKU,EAAIlE,GAAO5B,EACxCuH,EAAQnC,EAAKS,EAAIK,GAAOd,EAAKU,EAAIM,GAAOpG,EAAK,GAAK,EAAIgH,EAAO5B,EAAKwB,EAAQE,GAAO,EAAIF,EAAO,IAAM,EAAIA,EAAO,IAAM,EAAIA,EAAO,IAClI,GAAIZ,GAAM,GAAKqB,GAAQC,GAASD,GAAQE,EACpC,OAAOjC,EAAMC,EAAKlD,EAAGoD,EAAI9C,SAASqD,EAAIA,EAAKC,IAG/C,GADA7C,EAAMmC,EAAKlD,EAAG,GAAKkF,EAAQD,IAASjF,GAAK,EACrCkF,EAAQD,EAAO,CACfL,EAAKnG,EAAKoF,EAAKC,EAAK,GAAIe,EAAKhB,EAAKiB,EAAKrG,EAAKsF,EAAKC,EAAK,GAAIe,EAAKhB,EAC/D,IAAIoB,EAAM1G,EAAKgG,EAAKC,EAAM,GAC1B3D,EAAMmC,EAAKlD,EAAGmE,EAAM,KACpBpD,EAAMmC,EAAKlD,EAAI,EAAGsE,EAAM,GACxBvD,EAAMmC,EAAKlD,EAAI,GAAI2E,EAAO,GAC1B3E,GAAK,GACL,IAASlC,EAAI,EAAGA,EAAI6G,IAAQ7G,EACxBiD,EAAMmC,EAAKlD,EAAI,EAAIlC,EAAG2G,EAAIhH,EAAKK,KACnCkC,GAAK,EAAI2E,EAET,IADA,IAAIS,EAAO,CAAClB,EAAMG,GACTgB,EAAK,EAAGA,EAAK,IAAKA,EACvB,KAAIC,GAAOF,EAAKC,GAChB,IAASvH,EAAI,EAAGA,EAAIwH,GAAKzG,SAAUf,EAAG,CAClC,IAAIyH,GAAgB,GAAVD,GAAKxH,GACfiD,EAAMmC,EAAKlD,EAAGmF,EAAII,KAAOvF,GAAKyE,EAAIc,IAC9BA,GAAM,KACNxE,EAAMmC,EAAKlD,EAAIsF,GAAKxH,IAAM,EAAK,KAAMkC,GAAKsF,GAAKxH,IAAM,GAC5D,CANkB,CAQ1B,MAEG8G,EAAKpF,EAAKqF,EAAKvF,EAAKwF,EAAKpF,EAAKqF,EAAKxF,EAEvC,IAASzB,EAAI,EAAGA,EAAI4F,IAAM5F,EAAG,CACzB,IAAI0H,GAAMjC,EAAKzF,GACf,GAAI0H,GAAM,IAAK,CAEXxE,EAAQkC,EAAKlD,EAAG4E,GADZW,GAAOC,IAAO,GAAM,IACC,MAAOxF,GAAK6E,EAAGU,GAAM,KAC1CA,GAAM,IACNxE,EAAMmC,EAAKlD,EAAIwF,IAAO,GAAM,IAAKxF,GAAKzC,EAAKgI,KAC/C,IAAIE,GAAY,GAAND,GACVxE,EAAQkC,EAAKlD,EAAG8E,EAAGW,KAAOzF,GAAK+E,EAAGU,IAC9BA,GAAM,IACNzE,EAAQkC,EAAKlD,EAAIwF,IAAO,EAAK,MAAOxF,GAAKxC,EAAKiI,IACrD,MAEGzE,EAAQkC,EAAKlD,EAAG4E,EAAGY,KAAOxF,GAAK6E,EAAGW,GAEzC,CAED,OADAxE,EAAQkC,EAAKlD,EAAG4E,EAAG,MACZ5E,EAAI6E,EAAG,IAClB,EAEIa,EAAoB,IAAIrI,EAAI,CAAC,MAAO,OAAQ,OAAQ,OAAQ,OAAQ,QAAS,QAAS,QAAS,UAE/FkE,EAAmB,IAAItE,EAAG,GA0J1B0I,EAAQ,WACR,IAAI9F,EAAI,EAAGhC,EAAI,EACf,MAAO,CACHmC,EAAG,SAAUD,GAIT,IAFA,IAAIuC,EAAIzC,EAAGR,EAAIxB,EACXiB,EAAe,EAAXiB,EAAElB,OACDf,EAAI,EAAGA,GAAKgB,GAAI,CAErB,IADA,IAAIuB,EAAIkC,KAAKqD,IAAI9H,EAAI,KAAMgB,GACpBhB,EAAIuC,IAAKvC,EACZuB,GAAKiD,GAAKvC,EAAEjC,GAChBwE,GAAS,MAAJA,GAAa,IAAMA,GAAK,IAAKjD,GAAS,MAAJA,GAAa,IAAMA,GAAK,GAClE,CACDQ,EAAIyC,EAAGzE,EAAIwB,CACd,EACDU,EAAG,WAEC,OAAY,KADZF,GAAK,SACe,IAAU,MAAJA,IAAe,GAAS,KADtChC,GAAK,SACyC,EAAKA,GAAK,CACvE,EAET,EAGIgI,EAAO,SAAUzC,EAAK0C,EAAKC,EAAKC,EAAMC,GACtC,IAAKA,IACDA,EAAK,CAAEnH,EAAG,GACNgH,EAAII,YAAY,CAChB,IAAIC,EAAOL,EAAII,WAAW5F,UAAU,OAChC8F,EAAS,IAAInJ,EAAGkJ,EAAKtH,OAASuE,EAAIvE,QACtCuH,EAAOC,IAAIF,GACXC,EAAOC,IAAIjD,EAAK+C,EAAKtH,QACrBuE,EAAMgD,EACNH,EAAGnD,EAAIqD,EAAKtH,MACf,CAEL,OA3LO,SAAUuE,EAAKkD,EAAKC,EAAMR,EAAKC,EAAMC,GAC5C,IAAIrH,EAAIqH,EAAGO,GAAKpD,EAAIvE,OAChBoB,EAAI,IAAIhD,EAAG8I,EAAMnH,EAAI,GAAK,EAAI2D,KAAKkE,KAAK7H,EAAI,MAASoH,GAErDlD,EAAI7C,EAAEK,SAASyF,EAAK9F,EAAEpB,OAASmH,GAC/BU,EAAMT,EAAGnH,EACTqE,EAAoB,GAAb8C,EAAGlI,GAAK,GACnB,GAAIuI,EAAK,CACDnD,IACAL,EAAE,GAAKmD,EAAGlI,GAAK,GAenB,IAdA,IAAI+H,EAAMJ,EAAIY,EAAM,GAChBhE,EAAIwD,GAAO,GAAIrD,EAAU,KAANqD,EACnBa,GAAS,GAAKJ,GAAQ,EAEtBK,EAAOX,EAAGjG,GAAK,IAAI7C,EAAI,OAAQ0J,EAAOZ,EAAGa,GAAK,IAAI3J,EAAIwJ,EAAQ,GAC9DI,EAAQxE,KAAKkE,KAAKF,EAAO,GAAIS,EAAQ,EAAID,EACzCE,EAAM,SAAUnJ,GAAK,OAAQsF,EAAItF,GAAMsF,EAAItF,EAAI,IAAMiJ,EAAU3D,EAAItF,EAAI,IAAMkJ,GAAUL,GAGvFpD,EAAO,IAAIlG,EAAI,MAEfmG,EAAK,IAAIrG,EAAI,KAAMsG,EAAK,IAAItG,EAAI,IAEhC+J,EAAO,EAAGvJ,EAAK,EAAGG,EAAImI,EAAGnI,GAAK,EAAG4F,EAAK,EAAGyD,EAAKlB,EAAGnD,GAAK,EAAGa,EAAK,EAC3D7F,EAAI,EAAIc,IAAKd,EAAG,CAEnB,IAAIsJ,EAAKH,EAAInJ,GAETuJ,EAAW,MAAJvJ,EAAWwJ,EAAQT,EAAKO,GAKnC,GAJAR,EAAKS,GAAQC,EACbT,EAAKO,GAAMC,EAGPF,GAAMrJ,EAAG,CAET,IAAIyJ,EAAM3I,EAAId,EACd,IAAKoJ,EAAO,KAAQxD,EAAK,SAAW6D,EAAM,MAAQb,GAAM,CACpDvD,EAAME,EAAKD,EAAKN,EAAG,EAAGS,EAAMC,EAAIC,EAAI9F,EAAI+F,EAAIC,EAAI7F,EAAI6F,EAAIR,GACxDO,EAAKwD,EAAOvJ,EAAK,EAAGgG,EAAK7F,EACzB,IAAK,IAAIE,EAAI,EAAGA,EAAI,MAAOA,EACvBwF,EAAGxF,GAAK,EACZ,IAASA,EAAI,EAAGA,EAAI,KAAMA,EACtByF,EAAGzF,GAAK,CACf,CAED,IAAIc,EAAI,EAAGiB,EAAI,EAAGyH,EAAO/E,EAAGgF,EAAMJ,EAAOC,EAAQ,MACjD,GAAIC,EAAM,GAAKH,GAAMH,EAAInJ,EAAI2J,GAMzB,IALA,IAAIC,EAAOnF,KAAKqD,IAAItD,EAAGiF,GAAO,EAC1BI,EAAOpF,KAAKqD,IAAI,MAAO9H,GAGvB8J,EAAKrF,KAAKqD,IAAI,IAAK2B,GAChBE,GAAOE,KAAUH,GAAQH,GAAQC,GAAO,CAC3C,GAAIlE,EAAItF,EAAIgB,IAAMsE,EAAItF,EAAIgB,EAAI2I,GAAM,CAEhC,IADA,IAAII,EAAK,EACFA,EAAKD,GAAMxE,EAAItF,EAAI+J,IAAOzE,EAAItF,EAAI+J,EAAKJ,KAAQI,GAEtD,GAAIA,EAAK/I,EAAG,CAGR,GAFAA,EAAI+I,EAAI9H,EAAI0H,EAERI,EAAKH,EACL,MAIJ,IAAII,GAAMvF,KAAKqD,IAAI6B,EAAKI,EAAK,GACzBE,GAAK,EACT,IAAS/J,EAAI,EAAGA,EAAI8J,KAAO9J,EAAG,CAC1B,IAAIgK,GAAKlK,EAAI2J,EAAMzJ,EAAI,MAEnBU,GAAKsJ,GADCpB,EAAKoB,IACK,MAChBtJ,GAAKqJ,KACLA,GAAKrJ,GAAI4I,EAAQU,GACxB,CACJ,CACJ,CAGDP,IADAJ,EAAOC,IAAOA,EAAQV,EAAKS,IACL,KACzB,CAGL,GAAItH,EAAG,CAGHwD,EAAKG,KAAQ,UAAavF,EAAMW,IAAM,GAAMR,EAAMyB,GAClD,IAAIkI,GAAiB,GAAX9J,EAAMW,GAASoJ,GAAiB,GAAX5J,EAAMyB,GACrCpC,GAAMJ,EAAK0K,IAAOzK,EAAK0K,MACrB1E,EAAG,IAAMyE,MACTxE,EAAGyE,IACLf,EAAKrJ,EAAIgB,IACPoI,CACL,MAEG3D,EAAKG,KAAQN,EAAItF,KACf0F,EAAGJ,EAAItF,GAEhB,CACJ,CACD,IAAKA,EAAIyE,KAAK3C,IAAI9B,EAAGqJ,GAAKrJ,EAAIc,IAAKd,EAC/ByF,EAAKG,KAAQN,EAAItF,KACf0F,EAAGJ,EAAItF,IAEbqF,EAAME,EAAKD,EAAKN,EAAG4D,EAAKnD,EAAMC,EAAIC,EAAI9F,EAAI+F,EAAIC,EAAI7F,EAAI6F,EAAIR,GACrDuD,IACDT,EAAGlI,EAAW,EAANoF,EAAWL,EAAGK,EAAM,EAAK,IAAM,EAEvCA,GAAO,EACP8C,EAAGa,EAAID,EAAMZ,EAAGjG,EAAI4G,EAAMX,EAAGnI,EAAIA,EAAGmI,EAAGnD,EAAIqE,EAElD,KACI,CACD,IAASrJ,EAAImI,EAAGnD,GAAK,EAAGhF,EAAIc,EAAI8H,EAAK5I,GAAK,MAAO,CAE7C,IAAIuC,GAAIvC,EAAI,MACRuC,IAAKzB,IAELkE,EAAGK,EAAM,EAAK,GAAKuD,EACnBrG,GAAIzB,GAERuE,EAAMF,EAAMH,EAAGK,EAAM,EAAGC,EAAI9C,SAASxC,EAAGuC,IAC3C,CACD4F,EAAGnI,EAAIc,CACV,CACD,OAAOwB,EAAIH,EAAG,EAAG8F,EAAM5F,EAAKgD,GAAO6C,EACvC,CA8DWmC,CAAK/E,EAAkB,MAAb0C,EAAIsC,MAAgB,EAAItC,EAAIsC,MAAkB,MAAXtC,EAAIuC,IAAepC,EAAGnH,EAAIyD,KAAKkE,KAAuD,IAAlDlE,KAAK3C,IAAI,EAAG2C,KAAKqD,IAAI,GAAIrD,KAAK+F,IAAIlF,EAAIvE,WAAmB,GAAO,GAAKiH,EAAIuC,IAAMtC,EAAKC,EAAMC,EACtL,EAmJIsC,EAAS,SAAUxI,EAAGlC,EAAGuB,GACzB,KAAOA,IAAKvB,EACRkC,EAAElC,GAAKuB,EAAGA,KAAO,CACzB,EAkeO,SAASoJ,EAASC,EAAMC,GACtBA,IACDA,EAAO,CAAA,GACX,IAAI7I,EAAI8F,IACR9F,EAAEG,EAAEyI,GACJ,IAAI1I,EAAI8F,EAAK4C,EAAMC,EAAMA,EAAKxC,WAAa,EAAI,EAAG,GAClD,OAtcM,SAAUzD,EAAGxC,GACnB,IAAI0I,EAAK1I,EAAEmI,MAAOlK,EAAW,GAANyK,EAAU,EAAIA,EAAK,EAAI,EAAU,GAANA,EAAU,EAAI,EAGhE,GAFAlG,EAAE,GAAK,IAAKA,EAAE,GAAMvE,GAAM,GAAM+B,EAAEiG,YAAc,IAChDzD,EAAE,IAAM,IAAOA,EAAE,IAAM,EAAKA,EAAE,IAAM,GAChCxC,EAAEiG,WAAY,CACd,IAAIY,EAAInB,IACRmB,EAAE9G,EAAEC,EAAEiG,YACNqC,EAAO9F,EAAG,EAAGqE,EAAE/G,IAClB,CACL,CA6bW6I,CAAI7I,EAAG2I,GAAOH,EAAOxI,EAAGA,EAAElB,OAAS,EAAGgB,EAAEE,KAAMA,CACzD,CAmEO,SAAS8I,EAAWJ,EAAMC,GAC7B,OAxxCQ,SAAUtF,EAAK6C,EAAI6C,EAAK3C,GAEhC,IAAI4C,EAAK3F,EAAIvE,OAAQkG,EAAKoB,EAAOA,EAAKtH,OAAS,EAC/C,IAAKkK,GAAM9C,EAAG7E,IAAM6E,EAAGnH,EACnB,OAAOgK,GAAO,IAAI7L,EAAG,GACzB,IAAI+L,GAASF,EAETG,EAASD,GAAiB,GAAR/C,EAAGnI,EAErBoL,EAAOjD,EAAGnI,EAEVkL,IACAF,EAAM,IAAI7L,EAAQ,EAAL8L,IAEjB,IAAII,EAAO,SAAUrK,GACjB,IAAI8E,EAAKkF,EAAIjK,OAEb,GAAIC,EAAI8E,EAAI,CAER,IAAIwF,EAAO,IAAInM,EAAGsF,KAAK3C,IAAS,EAALgE,EAAQ9E,IACnCsK,EAAK/C,IAAIyC,GACTA,EAAMM,CACT,CACT,EAEQ9F,EAAQ2C,EAAG7E,GAAK,EAAG+B,EAAM8C,EAAGjG,GAAK,EAAGqJ,EAAKpD,EAAGpI,GAAK,EAAG+G,EAAKqB,EAAGnH,EAAGgG,EAAKmB,EAAGlG,EAAGuJ,EAAMrD,EAAG5G,EAAGkK,EAAMtD,EAAG3D,EAE/FkH,EAAY,EAALT,EACX,EAAG,CACC,IAAKnE,EAAI,CAELtB,EAAQxD,EAAKsD,EAAKD,EAAK,GAEvB,IAAIsG,EAAO3J,EAAKsD,EAAKD,EAAM,EAAG,GAE9B,GADAA,GAAO,GACFsG,EAAM,CAEP,IAAuB3K,EAAIsE,GAAvBxE,EAAIuB,EAAKgD,GAAO,GAAe,GAAMC,EAAIxE,EAAI,IAAM,EAAIsC,EAAItC,EAAIE,EACnE,GAAIoC,EAAI6H,EAAI,CACJG,GACA1I,EAAI,GACR,KACH,CAEGyI,GACAE,EAAKE,EAAKvK,GAEdgK,EAAIzC,IAAIjD,EAAI9C,SAAS1B,EAAGsC,GAAImI,GAE5BpD,EAAGpI,EAAIwL,GAAMvK,EAAGmH,EAAGjG,EAAImD,EAAU,EAAJjC,EAAO+E,EAAG7E,EAAIkC,EAC3C,QACH,CACI,GAAY,GAARmG,EACL7E,EAAKnF,EAAMqF,EAAKnF,EAAM2J,EAAM,EAAGC,EAAM,OACpC,GAAY,GAARE,EAAW,CAEhB,IAAIC,EAAO5J,EAAKsD,EAAKD,EAAK,IAAM,IAAKwG,EAAQ7J,EAAKsD,EAAKD,EAAM,GAAI,IAAM,EACnEyG,EAAKF,EAAO5J,EAAKsD,EAAKD,EAAM,EAAG,IAAM,EACzCA,GAAO,GAKP,IAHA,IAAI0G,EAAM,IAAI5M,EAAG2M,GAEbE,EAAM,IAAI7M,EAAG,IACRa,EAAI,EAAGA,EAAI6L,IAAS7L,EAEzBgM,EAAIrM,EAAKK,IAAMgC,EAAKsD,EAAKD,EAAU,EAAJrF,EAAO,GAE1CqF,GAAe,EAARwG,EAEP,IAAII,EAAMnK,EAAIkK,GAAME,GAAU,GAAKD,GAAO,EAEtCE,EAAMxL,EAAKqL,EAAKC,EAAK,GACzB,IAASjM,EAAI,EAAGA,EAAI8L,GAAK,CACrB,IAIIhL,EAJAb,EAAIkM,EAAInK,EAAKsD,EAAKD,EAAK6G,IAM3B,GAJA7G,GAAW,GAAJpF,GAEHa,EAAIb,GAAK,GAEL,GACJ8L,EAAI/L,KAAOc,MAEV,CAED,IAAI6D,EAAI,EAAGH,EAAI,EAOf,IANS,IAAL1D,GACA0D,EAAI,EAAIxC,EAAKsD,EAAKD,EAAK,GAAIA,GAAO,EAAGV,EAAIoH,EAAI/L,EAAI,IACvC,IAALc,GACL0D,EAAI,EAAIxC,EAAKsD,EAAKD,EAAK,GAAIA,GAAO,GACxB,IAALvE,IACL0D,EAAI,GAAKxC,EAAKsD,EAAKD,EAAK,KAAMA,GAAO,GAClCb,KACHuH,EAAI/L,KAAO2E,CAClB,CACJ,CAED,IAAIyH,EAAKL,EAAIvJ,SAAS,EAAGoJ,GAAO1H,EAAK6H,EAAIvJ,SAASoJ,GAElDJ,EAAM1J,EAAIsK,GAEVX,EAAM3J,EAAIoC,GACV4C,EAAKnG,EAAKyL,EAAIZ,EAAK,GACnBxE,EAAKrG,EAAKuD,EAAIuH,EAAK,EACtB,MAEG/I,EAAI,GACR,GAAI2C,EAAMqG,EAAM,CACRN,GACA1I,EAAI,GACR,KACH,CACJ,CAGGyI,GACAE,EAAKE,EAAK,QAGd,IAFA,IAAIc,GAAO,GAAKb,GAAO,EAAGc,GAAO,GAAKb,GAAO,EACzCc,EAAOlH,GACHkH,EAAOlH,EAAK,CAEhB,IAAoCqC,IAAhC/C,EAAImC,EAAG1E,EAAOkD,EAAKD,GAAOgH,KAAiB,EAE/C,IADAhH,GAAW,GAAJV,GACG+G,EAAM,CACRN,GACA1I,EAAI,GACR,KACH,CAGD,GAFKiC,GACDjC,EAAI,GACJgF,GAAM,IACNsD,EAAIO,KAAQ7D,OACX,IAAW,KAAPA,GAAY,CACjB6E,EAAOlH,EAAKyB,EAAK,KACjB,KACH,CAEG,IAAI0F,GAAM9E,GAAM,IAEhB,GAAIA,GAAM,IAAK,CAEX,IAAmB3H,GAAIN,EAAnBO,EAAI0H,GAAM,KACd8E,GAAMxK,EAAKsD,EAAKD,GAAM,GAAKtF,IAAK,GAAKK,EAAGJ,GACxCqF,GAAOtF,EACV,CAED,IAAIkC,GAAI+E,EAAG5E,EAAOkD,EAAKD,GAAOiH,GAAMG,GAAOxK,IAAK,EAShD,GARKA,IACDS,EAAI,GACR2C,GAAW,GAAJpD,GACHiC,EAAK3D,EAAGkM,IACRA,GAAO,IACH1M,GAAIL,EAAK+M,IACbvI,GAAM9B,EAAOkD,EAAKD,IAAQ,GAAKtF,IAAK,EAAGsF,GAAOtF,IAE9CsF,EAAMqG,EAAM,CACRN,GACA1I,EAAI,GACR,KACH,CACGyI,GACAE,EAAKE,EAAK,QACd,IAAImB,GAAMnB,EAAKiB,GACf,GAAIjB,EAAKrH,EAAI,CACT,IAAIyI,GAAQ1F,EAAK/C,EAAI0I,GAAOnI,KAAKqD,IAAI5D,EAAIwI,IAGzC,IAFIC,GAAQpB,EAAK,GACb7I,EAAI,GACD6I,EAAKqB,KAAQrB,EAChBP,EAAIO,GAAMlD,EAAKsE,GAAQpB,EAC9B,CACD,KAAOA,EAAKmB,KAAOnB,EACfP,EAAIO,GAAMP,EAAIO,EAAKrH,EAC1B,CACJ,CACDiE,EAAGnH,EAAI8F,EAAIqB,EAAGjG,EAAIqK,EAAMpE,EAAGpI,EAAIwL,EAAIpD,EAAG7E,EAAIkC,EACtCsB,IACAtB,EAAQ,EAAG2C,EAAG5G,EAAIiK,EAAKrD,EAAGlG,EAAI+E,EAAImB,EAAG3D,EAAIiH,EAChD,QAASjG,GAEV,OAAO+F,GAAMP,EAAIjK,QAAUmK,EAAQ5I,EAAI0I,EAAK,EAAGO,GAAMP,EAAIxI,SAAS,EAAG+I,EACzE,CAqmCWsB,CAAMlC,EAAKnI,UAhgBFP,EAggBe0I,EAhgBZtC,EAggBkBuC,GAAQA,EAAKxC,YA/f/B,IAAP,GAAPnG,EAAE,KAAkBA,EAAE,IAAM,EAAK,IAAOA,EAAE,IAAM,EAAIA,EAAE,IAAM,KAC7DS,EAAI,EAAG,sBACNT,EAAE,IAAM,EAAI,MAAQoG,GACrB3F,EAAI,EAAG,uBAAgC,GAAPT,EAAE,GAAU,OAAS,cAAgB,eAChD,GAAjBA,EAAE,IAAM,EAAI,KA2f4C,GAAI,CAAEjC,EAAG,GAAK4K,GAAQA,EAAKxF,IAAKwF,GAAQA,EAAKxC,YAhgBvG,IAAUnG,EAAGoG,CAigBvB,CAiIA,IAAIyE,EAA2B,oBAAfC,aAA4C,IAAIA,YAGhE,IACID,EAAGE,OAAOvJ,EAAI,CAAEwJ,QAAQ,GAE5B,CACA,MAAO1K,GAAG"}

package/dist/node_modules/format/format.js

@@ -0,0 +1,2 @@
+import{f as e}from"../../_virtual/format.js";var r;r=e,function(){var e;function t(e){for(var r,t,n,a,o=1,s=[].slice.call(arguments),c=0,i=e.length,f="",l=!1,p=!1,u=function(){return s[o++]},g=function(){for(var t="";/\d/.test(e[c]);)t+=e[c++],r=e[c];return t.length>0?parseInt(t):null};c<i;++c)if(r=e[c],l)switch(l=!1,"."==r?(p=!1,r=e[++c]):"0"==r&&"."==e[c+1]?(p=!0,r=e[c+=2]):p=!0,a=g(),r){case"b":f+=parseInt(u(),10).toString(2);break;case"c":f+="string"==typeof(t=u())||t instanceof String?t:String.fromCharCode(parseInt(t,10));break;case"d":f+=parseInt(u(),10);break;case"f":n=String(parseFloat(u()).toFixed(a||6)),f+=p?n:n.replace(/^0/,"");break;case"j":f+=JSON.stringify(u());break;case"o":f+="0"+parseInt(u(),10).toString(8);break;case"s":f+=u();break;case"x":f+="0x"+parseInt(u(),10).toString(16);break;case"X":f+="0x"+parseInt(u(),10).toString(16).toUpperCase();break;default:f+=r}else"%"===r?l=!0:f+=r;return f}(e=r.exports=t).format=t,e.vsprintf=function(e,r){return t.apply(null,[e].concat(r))},"undefined"!=typeof console&&"function"==typeof console.log&&(e.printf=function(){console.log(t.apply(null,arguments))})}();
+//# sourceMappingURL=format.js.map

package/dist/node_modules/format/format.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"format.js","sources":["../../../node_modules/format/format.js"],"sourcesContent":["//\n// format - printf-like string formatting for JavaScript\n// github.com/samsonjs/format\n// @_sjs\n//\n// Copyright 2010 - 2013 Sami Samhuri <sami@samhuri.net>\n//\n// MIT License\n// http://sjs.mit-license.org\n//\n\n;(function() {\n\n  //// Export the API\n  var namespace;\n\n  // CommonJS / Node module\n  if (typeof module !== 'undefined') {\n    namespace = module.exports = format;\n  }\n\n  // Browsers and other environments\n  else {\n    // Get the global object. Works in ES3, ES5, and ES5 strict mode.\n    namespace = (function(){ return this || (1,eval)('this') }());\n  }\n\n  namespace.format = format;\n  namespace.vsprintf = vsprintf;\n\n  if (typeof console !== 'undefined' && typeof console.log === 'function') {\n    namespace.printf = printf;\n  }\n\n  function printf(/* ... */) {\n    console.log(format.apply(null, arguments));\n  }\n\n  function vsprintf(fmt, replacements) {\n    return format.apply(null, [fmt].concat(replacements));\n  }\n\n  function format(fmt) {\n    var argIndex = 1 // skip initial format argument\n      , args = [].slice.call(arguments)\n      , i = 0\n      , n = fmt.length\n      , result = ''\n      , c\n      , escaped = false\n      , arg\n      , tmp\n      , leadingZero = false\n      , precision\n      , nextArg = function() { return args[argIndex++]; }\n      , slurpNumber = function() {\n          var digits = '';\n          while (/\\d/.test(fmt[i])) {\n            digits += fmt[i++];\n            c = fmt[i];\n          }\n          return digits.length > 0 ? parseInt(digits) : null;\n        }\n      ;\n    for (; i < n; ++i) {\n      c = fmt[i];\n      if (escaped) {\n        escaped = false;\n        if (c == '.') {\n          leadingZero = false;\n          c = fmt[++i];\n        }\n        else if (c == '0' && fmt[i + 1] == '.') {\n          leadingZero = true;\n          i += 2;\n          c = fmt[i];\n        }\n        else {\n          leadingZero = true;\n        }\n        precision = slurpNumber();\n        switch (c) {\n        case 'b': // number in binary\n          result += parseInt(nextArg(), 10).toString(2);\n          break;\n        case 'c': // character\n          arg = nextArg();\n          if (typeof arg === 'string' || arg instanceof String)\n            result += arg;\n          else\n            result += String.fromCharCode(parseInt(arg, 10));\n          break;\n        case 'd': // number in decimal\n          result += parseInt(nextArg(), 10);\n          break;\n        case 'f': // floating point number\n          tmp = String(parseFloat(nextArg()).toFixed(precision || 6));\n          result += leadingZero ? tmp : tmp.replace(/^0/, '');\n          break;\n        case 'j': // JSON\n          result += JSON.stringify(nextArg());\n          break;\n        case 'o': // number in octal\n          result += '0' + parseInt(nextArg(), 10).toString(8);\n          break;\n        case 's': // string\n          result += nextArg();\n          break;\n        case 'x': // lowercase hexadecimal\n          result += '0x' + parseInt(nextArg(), 10).toString(16);\n          break;\n        case 'X': // uppercase hexadecimal\n          result += '0x' + parseInt(nextArg(), 10).toString(16).toUpperCase();\n          break;\n        default:\n          result += c;\n          break;\n        }\n      } else if (c === '%') {\n        escaped = true;\n      } else {\n        result += c;\n      }\n    }\n    return result;\n  }\n\n}());\n"],"names":["namespace","format","fmt","c","arg","tmp","precision","argIndex","args","slice","call","arguments","i","n","length","result","escaped","leadingZero","nextArg","slurpNumber","digits","test","parseInt","toString","String","fromCharCode","parseFloat","toFixed","replace","JSON","stringify","toUpperCase","module","exports","vsprintf","replacements","apply","concat","console","log","printf"],"mappings":"uDAWE,WAGA,IAAIA,EA4BJ,SAASC,EAAOC,GAsBd,IArBA,IAKIC,EAEAC,EACAC,EAEAC,EAVAC,EAAW,EACXC,EAAO,GAAGC,MAAMC,KAAKC,WACrBC,EAAI,EACJC,EAAIX,EAAIY,OACRC,EAAS,GAETC,GAAU,EAGVC,GAAc,EAEdC,EAAU,WAAa,OAAOV,EAAKD,IAAc,EACjDY,EAAc,WAEZ,IADA,IAAIC,EAAS,GACN,KAAKC,KAAKnB,EAAIU,KACnBQ,GAAUlB,EAAIU,KACdT,EAAID,EAAIU,GAEV,OAAOQ,EAAON,OAAS,EAAIQ,SAASF,GAAU,IAC/C,EAEER,EAAIC,IAAKD,EAEd,GADAT,EAAID,EAAIU,GACJI,EAeF,OAdAA,GAAU,EACD,KAALb,GACFc,GAAc,EACdd,EAAID,IAAMU,IAEE,KAALT,GAA0B,KAAdD,EAAIU,EAAI,IAC3BK,GAAc,EAEdd,EAAID,EADJU,GAAK,IAILK,GAAc,EAEhBX,EAAYa,IACJhB,GACR,IAAK,IACHY,GAAUO,SAASJ,IAAW,IAAIK,SAAS,GAC3C,MACF,IAAK,IAGDR,GADiB,iBADnBX,EAAMc,MACyBd,aAAeoB,OAClCpB,EAEAoB,OAAOC,aAAaH,SAASlB,EAAK,KAC9C,MACF,IAAK,IACHW,GAAUO,SAASJ,IAAW,IAC9B,MACF,IAAK,IACHb,EAAMmB,OAAOE,WAAWR,KAAWS,QAAQrB,GAAa,IACxDS,GAAUE,EAAcZ,EAAMA,EAAIuB,QAAQ,KAAM,IAChD,MACF,IAAK,IACHb,GAAUc,KAAKC,UAAUZ,KACzB,MACF,IAAK,IACHH,GAAU,IAAMO,SAASJ,IAAW,IAAIK,SAAS,GACjD,MACF,IAAK,IACHR,GAAUG,IACV,MACF,IAAK,IACHH,GAAU,KAAOO,SAASJ,IAAW,IAAIK,SAAS,IAClD,MACF,IAAK,IACHR,GAAU,KAAOO,SAASJ,IAAW,IAAIK,SAAS,IAAIQ,cACtD,MACF,QACEhB,GAAUZ,MAGG,MAANA,EACTa,GAAU,EAEVD,GAAUZ,EAGd,OAAOY,CACR,EA3GCf,EAAYgC,EAAiBC,QAAAhC,GASrBA,OAASA,EACnBD,EAAUkC,SAUV,SAAkBhC,EAAKiC,GACrB,OAAOlC,EAAOmC,MAAM,KAAM,CAAClC,GAAKmC,OAAOF,GACxC,EAVsB,oBAAZG,SAAkD,mBAAhBA,QAAQC,MACnDvC,EAAUwC,OAGZ,WACEF,QAAQC,IAAItC,EAAOmC,MAAM,KAAMzB,WAChC,EA2FH,CApHC"}

package/dist/node_modules/hast-util-parse-selector/index.js

@@ -0,0 +1,2 @@
+var e=function(e,t){var l,s,n,r=e||"",c=t||"div",i={},d=0;for(;d<r.length;)a.lastIndex=d,n=a.exec(r),(l=r.slice(d,n?n.index:r.length))&&(s?"#"===s?i.id=l:i.className?i.className.push(l):i.className=[l]:c=l,d+=l.length),n&&(s=n[0],d++);return{type:"element",tagName:c,properties:i,children:[]}},a=/[#.]/g;export{e as default};
+//# sourceMappingURL=index.js.map

package/dist/node_modules/hast-util-parse-selector/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sources":["../../../node_modules/hast-util-parse-selector/index.js"],"sourcesContent":["'use strict'\n\nmodule.exports = parse\n\nvar search = /[#.]/g\n\n// Create a hast element from a simple CSS selector.\nfunction parse(selector, defaultTagName) {\n  var value = selector || ''\n  var name = defaultTagName || 'div'\n  var props = {}\n  var start = 0\n  var subvalue\n  var previous\n  var match\n\n  while (start < value.length) {\n    search.lastIndex = start\n    match = search.exec(value)\n    subvalue = value.slice(start, match ? match.index : value.length)\n\n    if (subvalue) {\n      if (!previous) {\n        name = subvalue\n      } else if (previous === '#') {\n        props.id = subvalue\n      } else if (props.className) {\n        props.className.push(subvalue)\n      } else {\n        props.className = [subvalue]\n      }\n\n      start += subvalue.length\n    }\n\n    if (match) {\n      previous = match[0]\n      start++\n    }\n  }\n\n  return {type: 'element', tagName: name, properties: props, children: []}\n}\n"],"names":["hastUtilParseSelector","selector","defaultTagName","subvalue","previous","match","value","name","props","start","length","search","lastIndex","exec","slice","index","id","className","push","type","tagName","properties","children"],"mappings":"AAEA,IAAAA,EAKA,SAAeC,EAAUC,GACvB,IAIIC,EACAC,EACAC,EANAC,EAAQL,GAAY,GACpBM,EAAOL,GAAkB,MACzBM,EAAQ,CAAE,EACVC,EAAQ,EAKZ,KAAOA,EAAQH,EAAMI,QACnBC,EAAOC,UAAYH,EACnBJ,EAAQM,EAAOE,KAAKP,IACpBH,EAAWG,EAAMQ,MAAML,EAAOJ,EAAQA,EAAMU,MAAQT,EAAMI,WAGnDN,EAEmB,MAAbA,EACTI,EAAMQ,GAAKb,EACFK,EAAMS,UACfT,EAAMS,UAAUC,KAAKf,GAErBK,EAAMS,UAAY,CAACd,GANnBI,EAAOJ,EASTM,GAASN,EAASO,QAGhBL,IACFD,EAAWC,EAAM,GACjBI,KAIJ,MAAO,CAACU,KAAM,UAAWC,QAASb,EAAMc,WAAYb,EAAOc,SAAU,GACvE,EAtCIX,EAAS"}

package/dist/node_modules/hastscript/factory.js

@@ -0,0 +1,2 @@
+import e from"../property-information/find.js";import t from"../property-information/normalize.js";import r from"../hast-util-parse-selector/index.js";import"../space-separated-tokens/index.js";import"../comma-separated-tokens/index.js";import{__exports as n}from"../../_virtual/index2.js";import{__exports as o}from"../../_virtual/index3.js";var i=e,a=t,p=r,s=n.parse,f=o.parse,u=function(e,t,r){var n=r?function(e){var t,r=e.length,n=-1,o={};for(;++n<r;)o[(t=e[n]).toLowerCase()]=t;return o}(r):null;return function(e,r){var i,a=p(e,t),s=Array.prototype.slice.call(arguments,2),f=a.tagName.toLowerCase();a.tagName=n&&l.call(n,f)?n[f]:f,r&&function(e,t){return"string"==typeof e||"length"in e||function(e,t){var r=t.type;if("input"===e||!r||"string"!=typeof r)return!1;if("object"==typeof t.children&&"length"in t.children)return!0;if(r=r.toLowerCase(),"button"===e)return"menu"!==r&&"submit"!==r&&"reset"!==r&&"button"!==r;return"value"in t}(t.tagName,e)}(r,a)&&(s.unshift(r),r=null);if(r)for(i in r)o(a.properties,i,r[i]);c(a.children,s),"template"===a.tagName&&(a.content={type:"root",children:a.children},a.children=[]);return a};function o(t,r,n){var o,a,p;null!=n&&n==n&&(a=(o=i(e,r)).property,"string"==typeof(p=n)&&(o.spaceSeparated?p=s(p):o.commaSeparated?p=f(p):o.commaOrSpaceSeparated&&(p=s(f(p).join(" ")))),"style"===a&&"string"!=typeof n&&(p=function(e){var t,r=[];for(t in e)r.push([t,e[t]].join(": "));return r.join("; ")}(p)),"className"===a&&t.className&&(p=t.className.concat(p)),t[a]=function(e,t,r){var n,o,i;if("object"!=typeof r||!("length"in r))return m(e,t,r);o=r.length,n=-1,i=[];for(;++n<o;)i[n]=m(e,t,r[n]);return i}(o,a,p))}},l={}.hasOwnProperty;function c(e,t){var r,n;if("string"!=typeof t&&"number"!=typeof t)if("object"==typeof t&&"length"in t)for(r=-1,n=t.length;++r<n;)c(e,t[r]);else{if("object"!=typeof t||!("type"in t))throw new Error("Expected node, nodes, or string, got `"+t+"`");e.push(t)}else e.push({type:"text",value:String(t)})}function m(e,t,r){var n=r;return e.number||e.positiveNumber?isNaN(n)||""===n||(n=Number(n)):(e.boolean||e.overloadedBoolean)&&("string"!=typeof n||""!==n&&a(r)!==a(t)||(n=!0)),n}export{u as default};
+//# sourceMappingURL=factory.js.map

package/dist/node_modules/hastscript/factory.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"factory.js","sources":["../../../node_modules/hastscript/factory.js"],"sourcesContent":["'use strict'\n\nvar find = require('property-information/find')\nvar normalize = require('property-information/normalize')\nvar parseSelector = require('hast-util-parse-selector')\nvar spaces = require('space-separated-tokens').parse\nvar commas = require('comma-separated-tokens').parse\n\nmodule.exports = factory\n\nvar own = {}.hasOwnProperty\n\nfunction factory(schema, defaultTagName, caseSensitive) {\n  var adjust = caseSensitive ? createAdjustMap(caseSensitive) : null\n\n  return h\n\n  // Hyperscript compatible DSL for creating virtual hast trees.\n  function h(selector, properties) {\n    var node = parseSelector(selector, defaultTagName)\n    var children = Array.prototype.slice.call(arguments, 2)\n    var name = node.tagName.toLowerCase()\n    var property\n\n    node.tagName = adjust && own.call(adjust, name) ? adjust[name] : name\n\n    if (properties && isChildren(properties, node)) {\n      children.unshift(properties)\n      properties = null\n    }\n\n    if (properties) {\n      for (property in properties) {\n        addProperty(node.properties, property, properties[property])\n      }\n    }\n\n    addChild(node.children, children)\n\n    if (node.tagName === 'template') {\n      node.content = {type: 'root', children: node.children}\n      node.children = []\n    }\n\n    return node\n  }\n\n  function addProperty(properties, key, value) {\n    var info\n    var property\n    var result\n\n    // Ignore nullish and NaN values.\n    if (value === null || value === undefined || value !== value) {\n      return\n    }\n\n    info = find(schema, key)\n    property = info.property\n    result = value\n\n    // Handle list values.\n    if (typeof result === 'string') {\n      if (info.spaceSeparated) {\n        result = spaces(result)\n      } else if (info.commaSeparated) {\n        result = commas(result)\n      } else if (info.commaOrSpaceSeparated) {\n        result = spaces(commas(result).join(' '))\n      }\n    }\n\n    // Accept `object` on style.\n    if (property === 'style' && typeof value !== 'string') {\n      result = style(result)\n    }\n\n    // Class-names (which can be added both on the `selector` and here).\n    if (property === 'className' && properties.className) {\n      result = properties.className.concat(result)\n    }\n\n    properties[property] = parsePrimitives(info, property, result)\n  }\n}\n\nfunction isChildren(value, node) {\n  return (\n    typeof value === 'string' ||\n    'length' in value ||\n    isNode(node.tagName, value)\n  )\n}\n\nfunction isNode(tagName, value) {\n  var type = value.type\n\n  if (tagName === 'input' || !type || typeof type !== 'string') {\n    return false\n  }\n\n  if (typeof value.children === 'object' && 'length' in value.children) {\n    return true\n  }\n\n  type = type.toLowerCase()\n\n  if (tagName === 'button') {\n    return (\n      type !== 'menu' &&\n      type !== 'submit' &&\n      type !== 'reset' &&\n      type !== 'button'\n    )\n  }\n\n  return 'value' in value\n}\n\nfunction addChild(nodes, value) {\n  var index\n  var length\n\n  if (typeof value === 'string' || typeof value === 'number') {\n    nodes.push({type: 'text', value: String(value)})\n    return\n  }\n\n  if (typeof value === 'object' && 'length' in value) {\n    index = -1\n    length = value.length\n\n    while (++index < length) {\n      addChild(nodes, value[index])\n    }\n\n    return\n  }\n\n  if (typeof value !== 'object' || !('type' in value)) {\n    throw new Error('Expected node, nodes, or string, got `' + value + '`')\n  }\n\n  nodes.push(value)\n}\n\n// Parse a (list of) primitives.\nfunction parsePrimitives(info, name, value) {\n  var index\n  var length\n  var result\n\n  if (typeof value !== 'object' || !('length' in value)) {\n    return parsePrimitive(info, name, value)\n  }\n\n  length = value.length\n  index = -1\n  result = []\n\n  while (++index < length) {\n    result[index] = parsePrimitive(info, name, value[index])\n  }\n\n  return result\n}\n\n// Parse a single primitives.\nfunction parsePrimitive(info, name, value) {\n  var result = value\n\n  if (info.number || info.positiveNumber) {\n    if (!isNaN(result) && result !== '') {\n      result = Number(result)\n    }\n  } else if (info.boolean || info.overloadedBoolean) {\n    // Accept `boolean` and `string`.\n    if (\n      typeof result === 'string' &&\n      (result === '' || normalize(value) === normalize(name))\n    ) {\n      result = true\n    }\n  }\n\n  return result\n}\n\nfunction style(value) {\n  var result = []\n  var key\n\n  for (key in value) {\n    result.push([key, value[key]].join(': '))\n  }\n\n  return result.join('; ')\n}\n\nfunction createAdjustMap(values) {\n  var length = values.length\n  var index = -1\n  var result = {}\n  var value\n\n  while (++index < length) {\n    value = values[index]\n    result[value.toLowerCase()] = value\n  }\n\n  return result\n}\n"],"names":["find","require$$0","normalize","require$$1","parseSelector","require$$2","spaces","require$$3","parse","commas","require$$4","factory_1","schema","defaultTagName","caseSensitive","adjust","values","value","length","index","result","toLowerCase","createAdjustMap","selector","properties","property","node","children","Array","prototype","slice","call","arguments","name","tagName","own","type","isNode","isChildren","unshift","addProperty","addChild","content","key","info","spaceSeparated","commaSeparated","commaOrSpaceSeparated","join","push","style","className","concat","parsePrimitive","parsePrimitives","hasOwnProperty","nodes","Error","String","number","positiveNumber","isNaN","Number","boolean","overloadedBoolean"],"mappings":"uVAEA,IAAIA,EAAOC,EACPC,EAAYC,EACZC,EAAgBC,EAChBC,EAASC,EAAkCC,MAC3CC,EAASC,EAAkCF,MAE/CG,EAIA,SAAiBC,EAAQC,EAAgBC,GACvC,IAAIC,EAASD,EA0Lf,SAAyBE,GACvB,IAGIC,EAHAC,EAASF,EAAOE,OAChBC,GAAS,EACTC,EAAS,CAAE,EAGf,OAASD,EAAQD,GAEfE,GADAH,EAAQD,EAAOG,IACFE,eAAiBJ,EAGhC,OAAOG,CACT,CAtM+BE,CAAgBR,GAAiB,KAE9D,OAGA,SAAWS,EAAUC,GACnB,IAGIC,EAHAC,EAAOtB,EAAcmB,EAAUV,GAC/Bc,EAAWC,MAAMC,UAAUC,MAAMC,KAAKC,UAAW,GACjDC,EAAOP,EAAKQ,QAAQb,cAGxBK,EAAKQ,QAAUnB,GAAUoB,EAAIJ,KAAKhB,EAAQkB,GAAQlB,EAAOkB,GAAQA,EAE7DT,GA4DR,SAAoBP,EAAOS,GACzB,MACmB,iBAAVT,GACP,WAAYA,GAKhB,SAAgBiB,EAASjB,GACvB,IAAImB,EAAOnB,EAAMmB,KAEjB,GAAgB,UAAZF,IAAwBE,GAAwB,iBAATA,EACzC,OAAO,EAGT,GAA8B,iBAAnBnB,EAAMU,UAAyB,WAAYV,EAAMU,SAC1D,OAAO,EAKT,GAFAS,EAAOA,EAAKf,cAEI,WAAZa,EACF,MACW,SAATE,GACS,WAATA,GACS,UAATA,GACS,WAATA,EAIJ,MAAO,UAAWnB,CACpB,CA3BIoB,CAAOX,EAAKQ,QAASjB,EAEzB,CAlEsBqB,CAAWd,EAAYE,KACvCC,EAASY,QAAQf,GACjBA,EAAa,MAGf,GAAIA,EACF,IAAKC,KAAYD,EACfgB,EAAYd,EAAKF,WAAYC,EAAUD,EAAWC,IAItDgB,EAASf,EAAKC,SAAUA,GAEH,aAAjBD,EAAKQ,UACPR,EAAKgB,QAAU,CAACN,KAAM,OAAQT,SAAUD,EAAKC,UAC7CD,EAAKC,SAAW,IAGlB,OAAOD,CACR,EAED,SAASc,EAAYhB,EAAYmB,EAAK1B,GACpC,IAAI2B,EACAnB,EACAL,EAGAH,SAAyCA,GAAUA,IAKvDQ,GADAmB,EAAO5C,EAAKY,EAAQ+B,IACJlB,SAIM,iBAHtBL,EAASH,KAIH2B,EAAKC,eACPzB,EAASd,EAAOc,GACPwB,EAAKE,eACd1B,EAASX,EAAOW,GACPwB,EAAKG,wBACd3B,EAASd,EAAOG,EAAOW,GAAQ4B,KAAK,QAKvB,UAAbvB,GAAyC,iBAAVR,IACjCG,EAkHN,SAAeH,GACb,IACI0B,EADAvB,EAAS,GAGb,IAAKuB,KAAO1B,EACVG,EAAO6B,KAAK,CAACN,EAAK1B,EAAM0B,IAAMK,KAAK,OAGrC,OAAO5B,EAAO4B,KAAK,KACrB,CA3HeE,CAAM9B,IAIA,cAAbK,GAA4BD,EAAW2B,YACzC/B,EAASI,EAAW2B,UAAUC,OAAOhC,IAGvCI,EAAWC,GAiEf,SAAyBmB,EAAMX,EAAMhB,GACnC,IAAIE,EACAD,EACAE,EAEJ,GAAqB,iBAAVH,KAAwB,WAAYA,GAC7C,OAAOoC,EAAeT,EAAMX,EAAMhB,GAGpCC,EAASD,EAAMC,OACfC,GAAS,EACTC,EAAS,GAET,OAASD,EAAQD,GACfE,EAAOD,GAASkC,EAAeT,EAAMX,EAAMhB,EAAME,IAGnD,OAAOC,CACT,CAnF2BkC,CAAgBV,EAAMnB,EAAUL,GACxD,CACH,EA1EIe,EAAM,CAAE,EAACoB,eA6Gb,SAASd,EAASe,EAAOvC,GACvB,IAAIE,EACAD,EAEJ,GAAqB,iBAAVD,GAAuC,iBAAVA,EAKxC,GAAqB,iBAAVA,GAAsB,WAAYA,EAI3C,IAHAE,GAAS,EACTD,EAASD,EAAMC,SAENC,EAAQD,GACfuB,EAASe,EAAOvC,EAAME,QAL1B,CAWA,GAAqB,iBAAVF,KAAwB,SAAUA,GAC3C,MAAM,IAAIwC,MAAM,yCAA2CxC,EAAQ,KAGrEuC,EAAMP,KAAKhC,EANV,MAbCuC,EAAMP,KAAK,CAACb,KAAM,OAAQnB,MAAOyC,OAAOzC,IAoB5C,CAwBA,SAASoC,EAAeT,EAAMX,EAAMhB,GAClC,IAAIG,EAASH,EAgBb,OAdI2B,EAAKe,QAAUf,EAAKgB,eACjBC,MAAMzC,IAAsB,KAAXA,IACpBA,EAAS0C,OAAO1C,KAETwB,EAAKmB,SAAWnB,EAAKoB,qBAGV,iBAAX5C,GACK,KAAXA,GAAiBlB,EAAUe,KAAWf,EAAU+B,KAEjDb,GAAS,IAINA,CACT"}

package/dist/node_modules/hastscript/html.js

@@ -0,0 +1,2 @@
+import r from"../property-information/html.js";import o from"./factory.js";var t=o(r,"div");t.displayName="html";var a=t;export{a as default};
+//# sourceMappingURL=html.js.map

package/dist/node_modules/hastscript/html.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"html.js","sources":["../../../node_modules/hastscript/html.js"],"sourcesContent":["'use strict'\n\nvar schema = require('property-information/html')\nvar factory = require('./factory')\n\nvar html = factory(schema, 'div')\nhtml.displayName = 'html'\n\nmodule.exports = html\n"],"names":["html","require$$1","require$$0","displayName","html_1"],"mappings":"2EAEA,IAGIA,EAFUC,EADDC,EAGc,OAC3BF,EAAKG,YAAc,OAEnB,IAAAC,EAAiBJ"}

package/dist/node_modules/hastscript/index.js

@@ -0,0 +1,2 @@
+import{h as r}from"../../_virtual/index.js";import m from"./html.js";r.exports=m;
+//# sourceMappingURL=index.js.map

package/dist/node_modules/hastscript/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sources":["../../../node_modules/hastscript/index.js"],"sourcesContent":["'use strict'\n\nmodule.exports = require('./html')\n"],"names":["exports","require$$0"],"mappings":"uEAEiBA,QAAAC"}

package/dist/node_modules/highlight.js/lib/core.js

@@ -0,0 +1,2 @@
+function e(t){return t instanceof Map?t.clear=t.delete=t.set=function(){throw new Error("map is read-only")}:t instanceof Set&&(t.add=t.clear=t.delete=function(){throw new Error("set is read-only")}),Object.freeze(t),Object.getOwnPropertyNames(t).forEach((function(n){var i=t[n];"object"!=typeof i||Object.isFrozen(i)||e(i)})),t}var t=e,n=e;t.default=n;class i{constructor(e){void 0===e.data&&(e.data={}),this.data=e.data,this.isMatchIgnored=!1}ignoreMatch(){this.isMatchIgnored=!0}}function r(e){return e.replace(/&/g,"&amp;").replace(/</g,"&lt;").replace(/>/g,"&gt;").replace(/"/g,"&quot;").replace(/'/g,"&#x27;")}function s(e,...t){const n=Object.create(null);for(const t in e)n[t]=e[t];return t.forEach((function(e){for(const t in e)n[t]=e[t]})),n}const a=e=>!!e.kind;class o{constructor(e,t){this.buffer="",this.classPrefix=t.classPrefix,e.walk(this)}addText(e){this.buffer+=r(e)}openNode(e){if(!a(e))return;let t=e.kind;e.sublanguage||(t=`${this.classPrefix}${t}`),this.span(t)}closeNode(e){a(e)&&(this.buffer+="</span>")}value(){return this.buffer}span(e){this.buffer+=`<span class="${e}">`}}class l{constructor(){this.rootNode={children:[]},this.stack=[this.rootNode]}get top(){return this.stack[this.stack.length-1]}get root(){return this.rootNode}add(e){this.top.children.push(e)}openNode(e){const t={kind:e,children:[]};this.add(t),this.stack.push(t)}closeNode(){if(this.stack.length>1)return this.stack.pop()}closeAllNodes(){for(;this.closeNode(););}toJSON(){return JSON.stringify(this.rootNode,null,4)}walk(e){return this.constructor._walk(e,this.rootNode)}static _walk(e,t){return"string"==typeof t?e.addText(t):t.children&&(e.openNode(t),t.children.forEach((t=>this._walk(e,t))),e.closeNode(t)),e}static _collapse(e){"string"!=typeof e&&e.children&&(e.children.every((e=>"string"==typeof e))?e.children=[e.children.join("")]:e.children.forEach((e=>{l._collapse(e)})))}}class c extends l{constructor(e){super(),this.options=e}addKeyword(e,t){""!==e&&(this.openNode(t),this.addText(e),this.closeNode())}addText(e){""!==e&&this.add(e)}addSublanguage(e,t){const n=e.root;n.kind=t,n.sublanguage=!0,this.add(n)}toHTML(){return new o(this,this.options).value()}finalize(){return!0}}function u(e){return e?"string"==typeof e?e:e.source:null}const g=/\[(?:[^\\\]]|\\.)*\]|\(\??|\\([1-9][0-9]*)|\\./;const h="[a-zA-Z]\\w*",d="[a-zA-Z_]\\w*",f="\\b\\d+(\\.\\d+)?",p="(-?)(\\b0[xX][a-fA-F0-9]+|(\\b\\d+(\\.\\d*)?|\\.\\d+)([eE][-+]?\\d+)?)",m="\\b(0b[01]+)",b={begin:"\\\\[\\s\\S]",relevance:0},E={className:"string",begin:"'",end:"'",illegal:"\\n",contains:[b]},x={className:"string",begin:'"',end:'"',illegal:"\\n",contains:[b]},w={begin:/\b(a|an|the|are|I'm|isn't|don't|doesn't|won't|but|just|should|pretty|simply|enough|gonna|going|wtf|so|such|will|you|your|they|like|more)\b/},v=function(e,t,n={}){const i=s({className:"comment",begin:e,end:t,contains:[]},n);return i.contains.push(w),i.contains.push({className:"doctag",begin:"(?:TODO|FIXME|NOTE|BUG|OPTIMIZE|HACK|XXX):",relevance:0}),i},y=v("//","$"),N=v("/\\*","\\*/"),R=v("#","$"),_={className:"number",begin:f,relevance:0},k={className:"number",begin:p,relevance:0},M={className:"number",begin:m,relevance:0},O={className:"number",begin:f+"(%|em|ex|ch|rem|vw|vh|vmin|vmax|cm|mm|in|pt|pc|px|deg|grad|rad|turn|s|ms|Hz|kHz|dpi|dpcm|dppx)?",relevance:0},A={begin:/(?=\/[^/\n]*\/)/,contains:[{className:"regexp",begin:/\//,end:/\/[gimuy]*/,illegal:/\n/,contains:[b,{begin:/\[/,end:/\]/,relevance:0,contains:[b]}]}]},L={className:"title",begin:h,relevance:0},I={className:"title",begin:d,relevance:0},j={begin:"\\.\\s*"+d,relevance:0};var B=Object.freeze({__proto__:null,MATCH_NOTHING_RE:/\b\B/,IDENT_RE:h,UNDERSCORE_IDENT_RE:d,NUMBER_RE:f,C_NUMBER_RE:p,BINARY_NUMBER_RE:m,RE_STARTERS_RE:"!|!=|!==|%|%=|&|&&|&=|\\*|\\*=|\\+|\\+=|,|-|-=|/=|/|:|;|<<|<<=|<=|<|===|==|=|>>>=|>>=|>=|>>>|>>|>|\\?|\\[|\\{|\\(|\\^|\\^=|\\||\\|=|\\|\\||~",SHEBANG:(e={})=>{const t=/^#![ ]*\//;return e.binary&&(e.begin=function(...e){return e.map((e=>u(e))).join("")}(t,/.*\b/,e.binary,/\b.*/)),s({className:"meta",begin:t,end:/$/,relevance:0,"on:begin":(e,t)=>{0!==e.index&&t.ignoreMatch()}},e)},BACKSLASH_ESCAPE:b,APOS_STRING_MODE:E,QUOTE_STRING_MODE:x,PHRASAL_WORDS_MODE:w,COMMENT:v,C_LINE_COMMENT_MODE:y,C_BLOCK_COMMENT_MODE:N,HASH_COMMENT_MODE:R,NUMBER_MODE:_,C_NUMBER_MODE:k,BINARY_NUMBER_MODE:M,CSS_NUMBER_MODE:O,REGEXP_MODE:A,TITLE_MODE:L,UNDERSCORE_TITLE_MODE:I,METHOD_GUARD:j,END_SAME_AS_BEGIN:function(e){return Object.assign(e,{"on:begin":(e,t)=>{t.data._beginMatch=e[1]},"on:end":(e,t)=>{t.data._beginMatch!==e[1]&&t.ignoreMatch()}})}});function T(e,t){"."===e.input[e.index-1]&&t.ignoreMatch()}function S(e,t){t&&e.beginKeywords&&(e.begin="\\b("+e.beginKeywords.split(" ").join("|")+")(?!\\.)(?=\\b|\\s)",e.__beforeBegin=T,e.keywords=e.keywords||e.beginKeywords,delete e.beginKeywords,void 0===e.relevance&&(e.relevance=0))}function P(e,t){Array.isArray(e.illegal)&&(e.illegal=function(...e){return"("+e.map((e=>u(e))).join("|")+")"}(...e.illegal))}function D(e,t){if(e.match){if(e.begin||e.end)throw new Error("begin & end are not supported with match");e.begin=e.match,delete e.match}}function C(e,t){void 0===e.relevance&&(e.relevance=1)}const H=["of","and","for","in","not","or","if","then","parent","list","value"];function $(e,t,n="keyword"){const i={};return"string"==typeof e?r(n,e.split(" ")):Array.isArray(e)?r(n,e):Object.keys(e).forEach((function(n){Object.assign(i,$(e[n],t,n))})),i;function r(e,n){t&&(n=n.map((e=>e.toLowerCase()))),n.forEach((function(t){const n=t.split("|");i[n[0]]=[e,U(n[0],n[1])]}))}}function U(e,t){return t?Number(t):function(e){return H.includes(e.toLowerCase())}(e)?0:1}function z(e,{plugins:t}){function n(t,n){return new RegExp(u(t),"m"+(e.case_insensitive?"i":"")+(n?"g":""))}class i{constructor(){this.matchIndexes={},this.regexes=[],this.matchAt=1,this.position=0}addRule(e,t){t.position=this.position++,this.matchIndexes[this.matchAt]=t,this.regexes.push([t,e]),this.matchAt+=function(e){return new RegExp(e.toString()+"|").exec("").length-1}(e)+1}compile(){0===this.regexes.length&&(this.exec=()=>null);const e=this.regexes.map((e=>e[1]));this.matcherRe=n(function(e,t="|"){let n=0;return e.map((e=>{n+=1;const t=n;let i=u(e),r="";for(;i.length>0;){const e=g.exec(i);if(!e){r+=i;break}r+=i.substring(0,e.index),i=i.substring(e.index+e[0].length),"\\"===e[0][0]&&e[1]?r+="\\"+String(Number(e[1])+t):(r+=e[0],"("===e[0]&&n++)}return r})).map((e=>`(${e})`)).join(t)}(e),!0),this.lastIndex=0}exec(e){this.matcherRe.lastIndex=this.lastIndex;const t=this.matcherRe.exec(e);if(!t)return null;const n=t.findIndex(((e,t)=>t>0&&void 0!==e)),i=this.matchIndexes[n];return t.splice(0,n),Object.assign(t,i)}}class r{constructor(){this.rules=[],this.multiRegexes=[],this.count=0,this.lastIndex=0,this.regexIndex=0}getMatcher(e){if(this.multiRegexes[e])return this.multiRegexes[e];const t=new i;return this.rules.slice(e).forEach((([e,n])=>t.addRule(e,n))),t.compile(),this.multiRegexes[e]=t,t}resumingScanAtSamePosition(){return 0!==this.regexIndex}considerAll(){this.regexIndex=0}addRule(e,t){this.rules.push([e,t]),"begin"===t.type&&this.count++}exec(e){const t=this.getMatcher(this.regexIndex);t.lastIndex=this.lastIndex;let n=t.exec(e);if(this.resumingScanAtSamePosition())if(n&&n.index===this.lastIndex);else{const t=this.getMatcher(0);t.lastIndex=this.lastIndex+1,n=t.exec(e)}return n&&(this.regexIndex+=n.position+1,this.regexIndex===this.count&&this.considerAll()),n}}if(e.compilerExtensions||(e.compilerExtensions=[]),e.contains&&e.contains.includes("self"))throw new Error("ERR: contains `self` is not supported at the top-level of a language.  See documentation.");return e.classNameAliases=s(e.classNameAliases||{}),function t(i,a){const o=i;if(i.isCompiled)return o;[D].forEach((e=>e(i,a))),e.compilerExtensions.forEach((e=>e(i,a))),i.__beforeBegin=null,[S,P,C].forEach((e=>e(i,a))),i.isCompiled=!0;let l=null;if("object"==typeof i.keywords&&(l=i.keywords.$pattern,delete i.keywords.$pattern),i.keywords&&(i.keywords=$(i.keywords,e.case_insensitive)),i.lexemes&&l)throw new Error("ERR: Prefer `keywords.$pattern` to `mode.lexemes`, BOTH are not allowed. (see mode reference) ");return l=l||i.lexemes||/\w+/,o.keywordPatternRe=n(l,!0),a&&(i.begin||(i.begin=/\B|\b/),o.beginRe=n(i.begin),i.endSameAsBegin&&(i.end=i.begin),i.end||i.endsWithParent||(i.end=/\B|\b/),i.end&&(o.endRe=n(i.end)),o.terminatorEnd=u(i.end)||"",i.endsWithParent&&a.terminatorEnd&&(o.terminatorEnd+=(i.end?"|":"")+a.terminatorEnd)),i.illegal&&(o.illegalRe=n(i.illegal)),i.contains||(i.contains=[]),i.contains=[].concat(...i.contains.map((function(e){return function(e){e.variants&&!e.cachedVariants&&(e.cachedVariants=e.variants.map((function(t){return s(e,{variants:null},t)})));if(e.cachedVariants)return e.cachedVariants;if(K(e))return s(e,{starts:e.starts?s(e.starts):null});if(Object.isFrozen(e))return s(e);return e}("self"===e?i:e)}))),i.contains.forEach((function(e){t(e,o)})),i.starts&&t(i.starts,a),o.matcher=function(e){const t=new r;return e.contains.forEach((e=>t.addRule(e.begin,{rule:e,type:"begin"}))),e.terminatorEnd&&t.addRule(e.terminatorEnd,{type:"end"}),e.illegal&&t.addRule(e.illegal,{type:"illegal"}),t}(o),o}(e)}function K(e){return!!e&&(e.endsWithParent||K(e.starts))}function G(e){const t={props:["language","code","autodetect"],data:function(){return{detectedLanguage:"",unknownLanguage:!1}},computed:{className(){return this.unknownLanguage?"":"hljs "+this.detectedLanguage},highlighted(){if(!this.autoDetect&&!e.getLanguage(this.language))return console.warn(`The language "${this.language}" you specified could not be found.`),this.unknownLanguage=!0,r(this.code);let t={};return this.autoDetect?(t=e.highlightAuto(this.code),this.detectedLanguage=t.language):(t=e.highlight(this.language,this.code,this.ignoreIllegals),this.detectedLanguage=this.language),t.value},autoDetect(){return!this.language||(e=this.autodetect,Boolean(e||""===e));var e},ignoreIllegals:()=>!0},render(e){return e("pre",{},[e("code",{class:this.className,domProps:{innerHTML:this.highlighted}})])}};return{Component:t,VuePlugin:{install(e){e.component("highlightjs",t)}}}}const V={"after:highlightElement":({el:e,result:t,text:n})=>{const i=q(e);if(!i.length)return;const s=document.createElement("div");s.innerHTML=t.value,t.value=function(e,t,n){let i=0,s="";const a=[];function o(){return e.length&&t.length?e[0].offset!==t[0].offset?e[0].offset<t[0].offset?e:t:"start"===t[0].event?e:t:e.length?e:t}function l(e){function t(e){return" "+e.nodeName+'="'+r(e.value)+'"'}s+="<"+W(e)+[].map.call(e.attributes,t).join("")+">"}function c(e){s+="</"+W(e)+">"}function u(e){("start"===e.event?l:c)(e.node)}for(;e.length||t.length;){let t=o();if(s+=r(n.substring(i,t[0].offset)),i=t[0].offset,t===e){a.reverse().forEach(c);do{u(t.splice(0,1)[0]),t=o()}while(t===e&&t.length&&t[0].offset===i);a.reverse().forEach(l)}else"start"===t[0].event?a.push(t[0].node):a.pop(),u(t.splice(0,1)[0])}return s+r(n.substr(i))}(i,q(s),n)}};function W(e){return e.nodeName.toLowerCase()}function q(e){const t=[];return function e(n,i){for(let r=n.firstChild;r;r=r.nextSibling)3===r.nodeType?i+=r.nodeValue.length:1===r.nodeType&&(t.push({event:"start",offset:i,node:r}),i=e(r,i),W(r).match(/br|hr|img|input/)||t.push({event:"stop",offset:i,node:r}));return i}(e,0),t}const X={},F=e=>{console.error(e)},Z=(e,...t)=>{console.log(`WARN: ${e}`,...t)},J=(e,t)=>{X[`${e}/${t}`]||(console.log(`Deprecated as of ${e}. ${t}`),X[`${e}/${t}`]=!0)},Y=r,Q=s,ee=Symbol("nomatch");var te=function(e){const n=Object.create(null),r=Object.create(null),s=[];let a=!0;const o=/(^(<[^>]+>|\t|)+|\n)/gm,l="Could not find the language '{}', did you forget to load/include a language module?",u={disableAutodetect:!0,name:"Plain text",contains:[]};let g={noHighlightRe:/^(no-?highlight)$/i,languageDetectRe:/\blang(?:uage)?-([\w-]+)\b/i,classPrefix:"hljs-",tabReplace:null,useBR:!1,languages:null,__emitter:c};function h(e){return g.noHighlightRe.test(e)}function d(e,t,n,i){let r="",s="";"object"==typeof t?(r=e,n=t.ignoreIllegals,s=t.language,i=void 0):(J("10.7.0","highlight(lang, code, ...args) has been deprecated."),J("10.7.0","Please use highlight(code, options) instead.\nhttps://github.com/highlightjs/highlight.js/issues/2277"),s=e,r=t);const a={code:r,language:s};k("before:highlight",a);const o=a.result?a.result:f(a.language,a.code,n,i);return o.code=a.code,k("after:highlight",o),o}function f(e,t,r,o){function c(e,t){const n=v.case_insensitive?t[0].toLowerCase():t[0];return Object.prototype.hasOwnProperty.call(e.keywords,n)&&e.keywords[n]}function u(){null!=_.subLanguage?function(){if(""===O)return;let e=null;if("string"==typeof _.subLanguage){if(!n[_.subLanguage])return void M.addText(O);e=f(_.subLanguage,O,!0,k[_.subLanguage]),k[_.subLanguage]=e.top}else e=p(O,_.subLanguage.length?_.subLanguage:null);_.relevance>0&&(A+=e.relevance),M.addSublanguage(e.emitter,e.language)}():function(){if(!_.keywords)return void M.addText(O);let e=0;_.keywordPatternRe.lastIndex=0;let t=_.keywordPatternRe.exec(O),n="";for(;t;){n+=O.substring(e,t.index);const i=c(_,t);if(i){const[e,r]=i;if(M.addText(n),n="",A+=r,e.startsWith("_"))n+=t[0];else{const n=v.classNameAliases[e]||e;M.addKeyword(t[0],n)}}else n+=t[0];e=_.keywordPatternRe.lastIndex,t=_.keywordPatternRe.exec(O)}n+=O.substr(e),M.addText(n)}(),O=""}function h(e){return e.className&&M.openNode(v.classNameAliases[e.className]||e.className),_=Object.create(e,{parent:{value:_}}),_}function d(e,t,n){let r=function(e,t){const n=e&&e.exec(t);return n&&0===n.index}(e.endRe,n);if(r){if(e["on:end"]){const n=new i(e);e["on:end"](t,n),n.isMatchIgnored&&(r=!1)}if(r){for(;e.endsParent&&e.parent;)e=e.parent;return e}}if(e.endsWithParent)return d(e.parent,t,n)}function m(e){return 0===_.matcher.regexIndex?(O+=e[0],1):(j=!0,0)}function b(e){const t=e[0],n=e.rule,r=new i(n),s=[n.__beforeBegin,n["on:begin"]];for(const n of s)if(n&&(n(e,r),r.isMatchIgnored))return m(t);return n&&n.endSameAsBegin&&(n.endRe=new RegExp(t.replace(/[-/\\^$*+?.()|[\]{}]/g,"\\$&"),"m")),n.skip?O+=t:(n.excludeBegin&&(O+=t),u(),n.returnBegin||n.excludeBegin||(O=t)),h(n),n.returnBegin?0:t.length}function E(e){const n=e[0],i=t.substr(e.index),r=d(_,e,i);if(!r)return ee;const s=_;s.skip?O+=n:(s.returnEnd||s.excludeEnd||(O+=n),u(),s.excludeEnd&&(O=n));do{_.className&&M.closeNode(),_.skip||_.subLanguage||(A+=_.relevance),_=_.parent}while(_!==r.parent);return r.starts&&(r.endSameAsBegin&&(r.starts.endRe=r.endRe),h(r.starts)),s.returnEnd?0:n.length}let x={};function w(n,i){const s=i&&i[0];if(O+=n,null==s)return u(),0;if("begin"===x.type&&"end"===i.type&&x.index===i.index&&""===s){if(O+=t.slice(i.index,i.index+1),!a){const t=new Error("0 width match regex");throw t.languageName=e,t.badRule=x.rule,t}return 1}if(x=i,"begin"===i.type)return b(i);if("illegal"===i.type&&!r){const e=new Error('Illegal lexeme "'+s+'" for mode "'+(_.className||"<unnamed>")+'"');throw e.mode=_,e}if("end"===i.type){const e=E(i);if(e!==ee)return e}if("illegal"===i.type&&""===s)return 1;if(I>1e5&&I>3*i.index){throw new Error("potential infinite loop, way more iterations than matches")}return O+=s,s.length}const v=N(e);if(!v)throw F(l.replace("{}",e)),new Error('Unknown language: "'+e+'"');const y=z(v,{plugins:s});let R="",_=o||y;const k={},M=new g.__emitter(g);!function(){const e=[];for(let t=_;t!==v;t=t.parent)t.className&&e.unshift(t.className);e.forEach((e=>M.openNode(e)))}();let O="",A=0,L=0,I=0,j=!1;try{for(_.matcher.considerAll();;){I++,j?j=!1:_.matcher.considerAll(),_.matcher.lastIndex=L;const e=_.matcher.exec(t);if(!e)break;const n=w(t.substring(L,e.index),e);L=e.index+n}return w(t.substr(L)),M.closeAllNodes(),M.finalize(),R=M.toHTML(),{relevance:Math.floor(A),value:R,language:e,illegal:!1,emitter:M,top:_}}catch(n){if(n.message&&n.message.includes("Illegal"))return{illegal:!0,illegalBy:{msg:n.message,context:t.slice(L-100,L+100),mode:n.mode},sofar:R,relevance:0,value:Y(t),emitter:M};if(a)return{illegal:!1,relevance:0,value:Y(t),emitter:M,language:e,top:_,errorRaised:n};throw n}}function p(e,t){t=t||g.languages||Object.keys(n);const i=function(e){const t={relevance:0,emitter:new g.__emitter(g),value:Y(e),illegal:!1,top:u};return t.emitter.addText(e),t}(e),r=t.filter(N).filter(_).map((t=>f(t,e,!1)));r.unshift(i);const s=r.sort(((e,t)=>{if(e.relevance!==t.relevance)return t.relevance-e.relevance;if(e.language&&t.language){if(N(e.language).supersetOf===t.language)return 1;if(N(t.language).supersetOf===e.language)return-1}return 0})),[a,o]=s,l=a;return l.second_best=o,l}const m={"before:highlightElement":({el:e})=>{g.useBR&&(e.innerHTML=e.innerHTML.replace(/\n/g,"").replace(/<br[ /]*>/g,"\n"))},"after:highlightElement":({result:e})=>{g.useBR&&(e.value=e.value.replace(/\n/g,"<br>"))}},b=/^(<[^>]+>|\t)+/gm,E={"after:highlightElement":({result:e})=>{g.tabReplace&&(e.value=e.value.replace(b,(e=>e.replace(/\t/g,g.tabReplace))))}};function x(e){let t=null;const n=function(e){let t=e.className+" ";t+=e.parentNode?e.parentNode.className:"";const n=g.languageDetectRe.exec(t);if(n){const t=N(n[1]);return t||(Z(l.replace("{}",n[1])),Z("Falling back to no-highlight mode for this block.",e)),t?n[1]:"no-highlight"}return t.split(/\s+/).find((e=>h(e)||N(e)))}(e);if(h(n))return;k("before:highlightElement",{el:e,language:n}),t=e;const i=t.textContent,s=n?d(i,{language:n,ignoreIllegals:!0}):p(i);k("after:highlightElement",{el:e,result:s,text:i}),e.innerHTML=s.value,function(e,t,n){const i=t?r[t]:n;e.classList.add("hljs"),i&&e.classList.add(i)}(e,n,s.language),e.result={language:s.language,re:s.relevance,relavance:s.relevance},s.second_best&&(e.second_best={language:s.second_best.language,re:s.second_best.relevance,relavance:s.second_best.relevance})}const w=()=>{if(w.called)return;w.called=!0,J("10.6.0","initHighlighting() is deprecated.  Use highlightAll() instead.");document.querySelectorAll("pre code").forEach(x)};let v=!1;function y(){if("loading"===document.readyState)return void(v=!0);document.querySelectorAll("pre code").forEach(x)}function N(e){return e=(e||"").toLowerCase(),n[e]||n[r[e]]}function R(e,{languageName:t}){"string"==typeof e&&(e=[e]),e.forEach((e=>{r[e.toLowerCase()]=t}))}function _(e){const t=N(e);return t&&!t.disableAutodetect}function k(e,t){const n=e;s.forEach((function(e){e[n]&&e[n](t)}))}"undefined"!=typeof window&&window.addEventListener&&window.addEventListener("DOMContentLoaded",(function(){v&&y()}),!1),Object.assign(e,{highlight:d,highlightAuto:p,highlightAll:y,fixMarkup:function(e){return J("10.2.0","fixMarkup will be removed entirely in v11.0"),J("10.2.0","Please see https://github.com/highlightjs/highlight.js/issues/2534"),t=e,g.tabReplace||g.useBR?t.replace(o,(e=>"\n"===e?g.useBR?"<br>":e:g.tabReplace?e.replace(/\t/g,g.tabReplace):e)):t;var t},highlightElement:x,highlightBlock:function(e){return J("10.7.0","highlightBlock will be removed entirely in v12.0"),J("10.7.0","Please use highlightElement now."),x(e)},configure:function(e){e.useBR&&(J("10.3.0","'useBR' will be removed entirely in v11.0"),J("10.3.0","Please see https://github.com/highlightjs/highlight.js/issues/2559")),g=Q(g,e)},initHighlighting:w,initHighlightingOnLoad:function(){J("10.6.0","initHighlightingOnLoad() is deprecated.  Use highlightAll() instead."),v=!0},registerLanguage:function(t,i){let r=null;try{r=i(e)}catch(e){if(F("Language definition for '{}' could not be registered.".replace("{}",t)),!a)throw e;F(e),r=u}r.name||(r.name=t),n[t]=r,r.rawDefinition=i.bind(null,e),r.aliases&&R(r.aliases,{languageName:t})},unregisterLanguage:function(e){delete n[e];for(const t of Object.keys(r))r[t]===e&&delete r[t]},listLanguages:function(){return Object.keys(n)},getLanguage:N,registerAliases:R,requireLanguage:function(e){J("10.4.0","requireLanguage will be removed entirely in v11."),J("10.4.0","Please see https://github.com/highlightjs/highlight.js/pull/2844");const t=N(e);if(t)return t;throw new Error("The '{}' language is required, but not loaded.".replace("{}",e))},autoDetection:_,inherit:Q,addPlugin:function(e){!function(e){e["before:highlightBlock"]&&!e["before:highlightElement"]&&(e["before:highlightElement"]=t=>{e["before:highlightBlock"](Object.assign({block:t.el},t))}),e["after:highlightBlock"]&&!e["after:highlightElement"]&&(e["after:highlightElement"]=t=>{e["after:highlightBlock"](Object.assign({block:t.el},t))})}(e),s.push(e)},vuePlugin:G(e).VuePlugin}),e.debugMode=function(){a=!1},e.safeMode=function(){a=!0},e.versionString="10.7.3";for(const e in B)"object"==typeof B[e]&&t(B[e]);return Object.assign(e,B),e.addPlugin(m),e.addPlugin(V),e.addPlugin(E),e}({});export{te as default};
+//# sourceMappingURL=core.js.map