@soonspacejs/plugin-fds 2.15.1 → 2.15.3

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (4) hide show
  1. package/dist/index.esm.js +21 -22
  2. package/package.json +3 -3
  3. package/dist/assets/read-simulate.worker-DoU45WSm.js.map +0 -1
  4. package/dist/index.esm.js.map +0 -1
package/dist/index.esm.js CHANGED
@@ -186,7 +186,7 @@ class Ze extends Re {
186
186
  this.texture.dispose(), this.material.dispose(), this.geometry.dispose();
187
187
  }
188
188
  }
189
- const Me = '(function(){"use strict";function br(e){return e&&e.__esModule&&Object.prototype.hasOwnProperty.call(e,"default")?e.default:e}var R,K;function mr(){if(K)return R;K=1;function e(r){for(var t=new Array(r),o=0;o<r;++o)t[o]=o;return t}return R=e,R}var L,Q;function Ar(){if(Q)return L;Q=1,L=function(t){return t!=null&&(e(t)||r(t)||!!t._isBuffer)};function e(t){return!!t.constructor&&typeof t.constructor.isBuffer=="function"&&t.constructor.isBuffer(t)}function r(t){return typeof t.readFloatLE=="function"&&typeof t.slice=="function"&&e(t.slice(0,0))}return L}var P,Y;function jr(){if(Y)return P;Y=1;var e=mr(),r=Ar(),t=typeof Float64Array<"u";function o(h,s){return h[0]-s[0]}function a(){var h=this.stride,s=new Array(h.length),n;for(n=0;n<s.length;++n)s[n]=[Math.abs(h[n]),n];s.sort(o);var f=new Array(s.length);for(n=0;n<f.length;++n)f[n]=s[n][1];return f}function u(h,s){var n=["View",s,"d",h].join("");s<0&&(n="View_Nil"+h);var f=h==="generic";if(s===-1){var i="function "+n+"(a){this.data=a;}; var proto="+n+".prototype; proto.dtype=\'"+h+"\'; proto.index=function(){return -1}; proto.size=0; proto.dimension=-1; proto.shape=proto.stride=proto.order=[]; proto.lo=proto.hi=proto.transpose=proto.step= function(){return new "+n+"(this.data);}; proto.get=proto.set=function(){}; proto.pick=function(){return null}; return function construct_"+n+"(a){return new "+n+"(a);}",S=new Function(i);return S()}else if(s===0){var i="function "+n+"(a,d) { this.data = a; this.offset = d }; var proto="+n+".prototype; proto.dtype=\'"+h+"\'; proto.index=function(){return this.offset}; proto.dimension=0; proto.size=1; proto.shape= proto.stride= proto.order=[]; proto.lo= proto.hi= proto.transpose= proto.step=function "+n+"_copy() { return new "+n+"(this.data,this.offset) }; proto.pick=function "+n+"_pick(){ return TrivialArray(this.data); }; proto.valueOf=proto.get=function "+n+"_get(){ return "+(f?"this.data.get(this.offset)":"this.data[this.offset]")+"}; proto.set=function "+n+"_set(v){ return "+(f?"this.data.set(this.offset,v)":"this.data[this.offset]=v")+" }; return function construct_"+n+"(a,b,c,d){return new "+n+"(a,d)}",S=new Function("TrivialArray",i);return S(l[h][0])}var i=["\'use strict\'"],p=e(s),g=p.map(function(c){return"i"+c}),b="this.offset+"+p.map(function(c){return"this.stride["+c+"]*i"+c}).join("+"),j=p.map(function(c){return"b"+c}).join(","),_=p.map(function(c){return"c"+c}).join(",");i.push("function "+n+"(a,"+j+","+_+",d){this.data=a","this.shape=["+j+"]","this.stride=["+_+"]","this.offset=d|0}","var proto="+n+".prototype","proto.dtype=\'"+h+"\'","proto.dimension="+s),i.push("Object.defineProperty(proto,\'size\',{get:function "+n+"_size(){ return "+p.map(function(c){return"this.shape["+c+"]"}).join("*"),"}})"),s===1?i.push("proto.order=[0]"):(i.push("Object.defineProperty(proto,\'order\',{get:"),s<4?(i.push("function "+n+"_order(){"),s===2?i.push("return (Math.abs(this.stride[0])>Math.abs(this.stride[1]))?[1,0]:[0,1]}})"):s===3&&i.push("var s0=Math.abs(this.stride[0]),s1=Math.abs(this.stride[1]),s2=Math.abs(this.stride[2]); if(s0>s1){ if(s1>s2){ return [2,1,0]; }else if(s0>s2){ return [1,2,0]; }else{ return [1,0,2]; } }else if(s0>s2){ return [2,0,1]; }else if(s2>s1){ return [0,1,2]; }else{ return [0,2,1]; }}})")):i.push("ORDER})")),i.push("proto.set=function "+n+"_set("+g.join(",")+",v){"),f?i.push("return this.data.set("+b+",v)}"):i.push("return this.data["+b+"]=v}"),i.push("proto.get=function "+n+"_get("+g.join(",")+"){"),f?i.push("return this.data.get("+b+")}"):i.push("return this.data["+b+"]}"),i.push("proto.index=function "+n+"_index(",g.join(),"){return "+b+"}"),i.push("proto.hi=function "+n+"_hi("+g.join(",")+"){return new "+n+"(this.data,"+p.map(function(c){return["(typeof i",c,"!==\'number\'||i",c,"<0)?this.shape[",c,"]:i",c,"|0"].join("")}).join(",")+","+p.map(function(c){return"this.stride["+c+"]"}).join(",")+",this.offset)}");var m=p.map(function(c){return"a"+c+"=this.shape["+c+"]"}),k=p.map(function(c){return"c"+c+"=this.stride["+c+"]"});i.push("proto.lo=function "+n+"_lo("+g.join(",")+"){var b=this.offset,d=0,"+m.join(",")+","+k.join(","));for(var v=0;v<s;++v)i.push("if(typeof i"+v+"===\'number\'&&i"+v+">=0){ d=i"+v+"|0; b+=c"+v+"*d; a"+v+"-=d}");i.push("return new "+n+"(this.data,"+p.map(function(c){return"a"+c}).join(",")+","+p.map(function(c){return"c"+c}).join(",")+",b)}"),i.push("proto.step=function "+n+"_step("+g.join(",")+"){var "+p.map(function(c){return"a"+c+"=this.shape["+c+"]"}).join(",")+","+p.map(function(c){return"b"+c+"=this.stride["+c+"]"}).join(",")+",c=this.offset,d=0,ceil=Math.ceil");for(var v=0;v<s;++v)i.push("if(typeof i"+v+"===\'number\'){ d=i"+v+"|0; if(d<0){ c+=b"+v+"*(a"+v+"-1); a"+v+"=ceil(-a"+v+"/d) }else{ a"+v+"=ceil(a"+v+"/d) } b"+v+"*=d }");i.push("return new "+n+"(this.data,"+p.map(function(c){return"a"+c}).join(",")+","+p.map(function(c){return"b"+c}).join(",")+",c)}");for(var T=new Array(s),z=new Array(s),v=0;v<s;++v)T[v]="a[i"+v+"]",z[v]="b[i"+v+"]";i.push("proto.transpose=function "+n+"_transpose("+g+"){"+g.map(function(c,I){return c+"=("+c+"===undefined?"+I+":"+c+"|0)"}).join(";"),"var a=this.shape,b=this.stride;return new "+n+"(this.data,"+T.join(",")+","+z.join(",")+",this.offset)}"),i.push("proto.pick=function "+n+"_pick("+g+"){var a=[],b=[],c=this.offset");for(var v=0;v<s;++v)i.push("if(typeof i"+v+"===\'number\'&&i"+v+">=0){c=(c+this.stride["+v+"]*i"+v+")|0}else{a.push(this.shape["+v+"]);b.push(this.stride["+v+"])}");i.push("var ctor=CTOR_LIST[a.length+1];return ctor(this.data,a,b,c)}"),i.push("return function construct_"+n+"(data,shape,stride,offset){return new "+n+"(data,"+p.map(function(c){return"shape["+c+"]"}).join(",")+","+p.map(function(c){return"stride["+c+"]"}).join(",")+",offset)}");var S=new Function("CTOR_LIST","ORDER",i.join(`\n`));return S(l[h],a)}function d(h){if(r(h))return"buffer";if(t)switch(Object.prototype.toString.call(h)){case"[object Float64Array]":return"float64";case"[object Float32Array]":return"float32";case"[object Int8Array]":return"int8";case"[object Int16Array]":return"int16";case"[object Int32Array]":return"int32";case"[object Uint8Array]":return"uint8";case"[object Uint16Array]":return"uint16";case"[object Uint32Array]":return"uint32";case"[object Uint8ClampedArray]":return"uint8_clamped";case"[object BigInt64Array]":return"bigint64";case"[object BigUint64Array]":return"biguint64"}return Array.isArray(h)?"array":"generic"}var l={float32:[],float64:[],int8:[],int16:[],int32:[],uint8:[],uint16:[],uint32:[],array:[],uint8_clamped:[],bigint64:[],biguint64:[],buffer:[],generic:[]};function w(h,s,n,f){if(h===void 0){var _=l.array[0];return _([])}else typeof h=="number"&&(h=[h]);s===void 0&&(s=[h.length]);var i=s.length;if(n===void 0){n=new Array(i);for(var p=i-1,g=1;p>=0;--p)n[p]=g,g*=s[p]}if(f===void 0){f=0;for(var p=0;p<i;++p)n[p]<0&&(f-=(s[p]-1)*n[p])}for(var b=d(h),j=l[b];j.length<=i+1;)j.push(u(b,j.length-1));var _=j[i+1];return _(h,s,n,f)}return P=w,P}var _r=jr(),Er=br(_r),A=Uint8Array,O=Uint16Array,Fr=Int32Array,Z=new A([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]),rr=new A([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]),Nr=new A([16,17,18,0,8,7,9,6,10,5,11,4,12,3,13,2,14,1,15]),er=function(e,r){for(var t=new O(31),o=0;o<31;++o)t[o]=r+=1<<e[o-1];for(var a=new Fr(t[30]),o=1;o<30;++o)for(var u=t[o];u<t[o+1];++u)a[u]=u-t[o]<<5|o;return{b:t,r:a}},tr=er(Z,2),nr=tr.b,kr=tr.r;nr[28]=258,kr[258]=28;for(var xr=er(rr,0),Sr=xr.b,q=new O(32768),y=0;y<32768;++y){var x=(y&43690)>>1|(y&21845)<<1;x=(x&52428)>>2|(x&13107)<<2,x=(x&61680)>>4|(x&3855)<<4,q[y]=((x&65280)>>8|(x&255)<<8)>>1}for(var M=(function(e,r,t){for(var o=e.length,a=0,u=new O(r);a<o;++a)e[a]&&++u[e[a]-1];var d=new O(r);for(a=1;a<r;++a)d[a]=d[a-1]+u[a-1]<<1;var l;if(t){l=new O(1<<r);var w=15-r;for(a=0;a<o;++a)if(e[a])for(var h=a<<4|e[a],s=r-e[a],n=d[e[a]-1]++<<s,f=n|(1<<s)-1;n<=f;++n)l[q[n]>>w]=h}else for(l=new O(o),a=0;a<o;++a)e[a]&&(l[a]=q[d[e[a]-1]++]>>15-e[a]);return l}),$=new A(288),y=0;y<144;++y)$[y]=8;for(var y=144;y<256;++y)$[y]=9;for(var y=256;y<280;++y)$[y]=7;for(var y=280;y<288;++y)$[y]=8;for(var ar=new A(32),y=0;y<32;++y)ar[y]=5;var Dr=M($,9,1),Or=M(ar,5,1),H=function(e){for(var r=e[0],t=1;t<e.length;++t)e[t]>r&&(r=e[t]);return r},F=function(e,r,t){var o=r/8|0;return(e[o]|e[o+1]<<8)>>(r&7)&t},W=function(e,r){var t=r/8|0;return(e[t]|e[t+1]<<8|e[t+2]<<16)>>(r&7)},Tr=function(e){return(e+7)/8|0},Br=function(e,r,t){return(t==null||t>e.length)&&(t=e.length),new A(e.subarray(r,t))},Cr=["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"],N=function(e,r,t){var o=new Error(r||Cr[e]);if(o.code=e,Error.captureStackTrace&&Error.captureStackTrace(o,N),!t)throw o;return o},Mr=function(e,r,t,o){var a=e.length,u=0;if(!a||r.f&&!r.l)return t||new A(0);var d=!t,l=d||r.i!=2,w=r.i;d&&(t=new A(a*3));var h=function(wr){var yr=t.length;if(wr>yr){var gr=new A(Math.max(yr*2,wr));gr.set(t),t=gr}},s=r.f||0,n=r.p||0,f=r.b||0,i=r.l,p=r.d,g=r.m,b=r.n,j=a*8;do{if(!i){s=F(e,n,1);var _=F(e,n+1,3);if(n+=3,_)if(_==1)i=Dr,p=Or,g=9,b=5;else if(_==2){var T=F(e,n,31)+257,z=F(e,n+10,15)+4,S=T+F(e,n+5,31)+1;n+=14;for(var c=new A(S),I=new A(19),E=0;E<z;++E)I[Nr[E]]=F(e,n+E*3,7);n+=z*3;for(var cr=H(I),Zr=(1<<cr)-1,re=M(I,cr,1),E=0;E<S;){var hr=re[F(e,n,Zr)];n+=hr&15;var m=hr>>4;if(m<16)c[E++]=m;else{var B=0,V=0;for(m==16?(V=3+F(e,n,3),n+=2,B=c[E-1]):m==17?(V=3+F(e,n,7),n+=3):m==18&&(V=11+F(e,n,127),n+=7);V--;)c[E++]=B}}var pr=c.subarray(0,T),D=c.subarray(T);g=H(pr),b=H(D),i=M(pr,g,1),p=M(D,b,1)}else N(1);else{var m=Tr(n)+4,k=e[m-4]|e[m-3]<<8,v=m+k;if(v>a){w&&N(0);break}l&&h(f+k),t.set(e.subarray(m,v),f),r.b=f+=k,r.p=n=v*8,r.f=s;continue}if(n>j){w&&N(0);break}}l&&h(f+131072);for(var ee=(1<<g)-1,te=(1<<b)-1,G=n;;G=n){var B=i[W(e,n)&ee],C=B>>4;if(n+=B&15,n>j){w&&N(0);break}if(B||N(2),C<256)t[f++]=C;else if(C==256){G=n,i=null;break}else{var lr=C-254;if(C>264){var E=C-257,U=Z[E];lr=F(e,n,(1<<U)-1)+nr[E],n+=U}var J=p[W(e,n)&te],X=J>>4;J||N(3),n+=J&15;var D=Sr[X];if(X>3){var U=rr[X];D+=W(e,n)&(1<<U)-1,n+=U}if(n>j){w&&N(0);break}l&&h(f+131072);var dr=f+lr;if(f<D){var vr=u-D,ne=Math.min(D,dr);for(vr+f<0&&N(3);f<ne;++f)t[f]=o[vr+f]}for(;f<dr;++f)t[f]=t[f-D]}}r.l=i,r.p=G,r.b=f,r.f=s,i&&(s=1,r.m=g,r.d=p,r.n=b)}while(!s);return f!=t.length&&d?Br(t,0,f):t.subarray(0,f)},$r=new A(0),zr=function(e){(e[0]!=31||e[1]!=139||e[2]!=8)&&N(6,"invalid gzip data");var r=e[3],t=10;r&4&&(t+=(e[10]|e[11]<<8)+2);for(var o=(r>>3&1)+(r>>4&1);o>0;o-=!e[t++]);return t+(r&2)},Ir=function(e){var r=e.length;return(e[r-4]|e[r-3]<<8|e[r-2]<<16|e[r-1]<<24)>>>0};function or(e,r){var t=zr(e);return t+8>e.length&&N(6,"invalid gzip data"),Mr(e.subarray(t,-8),{i:2},new A(Ir(e)),r)}var Ur=typeof TextDecoder<"u"&&new TextDecoder,Vr=0;try{Ur.decode($r,{stream:!0}),Vr=1}catch{}function Rr(e){return e.length>=2&&e[0]===31&&e[1]===139}function Lr(e){try{return or(new Uint8Array(e))}catch(r){throw new Error(`gunzip: ${r instanceof Error?r.message:String(r)}`)}}const Pr=new TextEncoder().encode("NDAV2");function qr(e){if(e.length<5)return!1;for(let r=0;r<5;r++)if(e[r]!==Pr[r])return!1;return!0}function ir(e){let r=new Uint8Array(e);const t=8;for(let o=0;o<t;o++){if(qr(r))return r;if(Rr(r))try{r=or(r);continue}catch(u){throw new Error(`prepareNdav2ChunkPayload: gunzip layer ${o}: ${u instanceof Error?u.message:String(u)}`)}const a=r.length?[...r.subarray(0,Math.min(16,r.length))].map(u=>u.toString(16).padStart(2,"0")).join(" "):"empty";throw new Error(`prepareNdav2ChunkPayload: expected gzip or NDAV2, got bytes: ${a}`)}throw new Error("prepareNdav2ChunkPayload: too many gzip layers")}async function Hr(e){let r=e;return e[0]===31&&e[1]===139&&(r=Lr(new Uint8Array(e).buffer)),Wr(r)}async function Wr(e){const r=new TextDecoder;if(!r.decode(e.slice(0,8)).startsWith("NDA"))return;const o=[];let a,u;for(let i=8;i<1024;i++){if(u=e[i],u===10){a=i+1;break}o.push(u)}if(a===void 0)return;const d=r.decode(new Uint8Array(o)),l=JSON.parse(d),w=l.shape;let h=1;for(const i of w)h*=i;const s=new DataView(e.buffer,e.byteOffset+a),n=l.endian!=="little";let f=new Float32Array;switch(l.dataType){case"float32":{f=new Float32Array(h);for(let i=0;i<h;i++)f[i]=s.getFloat32(i*4,!n);break}}return Er(f,w)}function Gr(e){const r=Math.min(e.length,128);let t="";for(let o=0;o<r;o++)t+=String.fromCharCode(e[o]);return/^\\s*</.test(t)}async function sr(e){let r;try{r=await fetch(e,{credentials:"omit",mode:"cors",cache:"no-store",headers:{Accept:"*/*","Accept-Encoding":"identity"}})}catch(a){const u=/myhuaweicloud|amazonaws|aliyuncs|qcloud|obs\\./i.test(e)||e.includes(".obs."),d=a instanceof Error?a.message:String(a);throw u||/failed to fetch|networkerror|aborted|canceled/i.test(d)?new Error(d):a}if(!r.ok)throw new Error(`HTTP ${r.status} ${r.statusText}: ${e}`);const t=await r.arrayBuffer(),o=new Uint8Array(t);if(Gr(o)){const a=new TextDecoder("utf-8",{fatal:!1}).decode(o.subarray(0,256));throw new Error(`fetch chunk: expected binary, got HTML/XML: ${a.slice(0,120)}`)}return t}function fr(e,r){const t=r||self.location.origin;return new URL(e,t+"/").href}self.onmessage=async e=>{const r=e.data;try{if(r.mode==="single"){const{shape:u,frames:d,transfers:l}=await Kr(r.url,r.pageOrigin);self.postMessage({uuid:r.uuid,shape:u,frames:d,startFrameIndex:0},{transfer:l});return}if(r.mode==="chunkBytes"){const{shape:u,frames:d,transfers:l}=ur(r.arrayBuffer,r.grids,r.chunkFrameCount,r.xs,r.ys,r.zs);self.postMessage({uuid:r.uuid,shape:u,frames:d,startFrameIndex:r.startFrameIndex},{transfer:l});return}if(r.mode==="chunkFrameBytes"){const{shape:u,frame:d,transfers:l}=Qr(r.arrayBuffer,r.grids,r.chunkFrameCount,r.xs,r.ys,r.zs,r.localFrameIndex);self.postMessage({uuid:r.uuid,shape:u,frame:d,startFrameIndex:r.startFrameIndex},{transfer:l});return}const{shape:t,frames:o,transfers:a}=await Yr(r.chunkUrl,r.grids,r.chunkFrameCount,r.xs,r.ys,r.zs,r.pageOrigin);self.postMessage({uuid:r.uuid,shape:t,frames:o,startFrameIndex:r.startFrameIndex},{transfer:a})}catch(t){self.postMessage({uuid:r.uuid,error:t instanceof Error?t.message:String(t)})}};function Jr(e,r,t,o,a){const u={width:e,height:r,depth:t},d=[],l=[],w=e*r*t;for(let h=0;h<o;h++){const s=new Uint8ClampedArray(w);let n=0;for(let f=0;f<t;f++)for(let i=0;i<r;i++)for(let p=0;p<e;p++)s[n++]=a(p,i,f,h);l.push(s.buffer),d.push(s)}return{shape:u,frames:d,transfers:l}}function Xr(e,r,t,o){const a={width:e,height:r,depth:t},u=new Uint8ClampedArray(e*r*t),d=[u.buffer];let l=0;for(let w=0;w<t;w++)for(let h=0;h<r;h++)for(let s=0;s<e;s++)u[l++]=o(s,h,w);return{shape:a,frame:u,transfers:d}}async function Kr(e,r){const t=fr(e,r),o=new Uint8Array(await sr(t)),a=await Hr(o);if(!a)throw new Error("readNdaSingle: not a valid NDA v1 (after optional gunzip)");const[u,d,l,w]=a.shape;return Jr(u,d,l,w,(h,s,n,f)=>a.get(h,s,n,f))}function ur(e,r,t,o,a,u){const d=ir(e);if(r!==t*o*a*u)throw new Error(`chunk: grids ${r} !== frames*nx*ny*nz ${t*o*a*u}`);const l=new TextDecoder().decode(d.subarray(0,8));if(!l.startsWith("NDAV2"))throw new Error(`NDAV2: bad magic ${JSON.stringify(l)}`);const w=8+r*4;if(d.byteLength!==w)throw new Error(`NDAV2: size mismatch need ${w} bytes, got ${d.byteLength}`);const h={width:o,height:a,depth:u},s=o*a*u,n=Array.from({length:t},()=>new Uint8ClampedArray(s)),f=n.map(p=>p.buffer),i=new DataView(d.buffer,d.byteOffset,d.byteLength);for(let p=0;p<o;p++)for(let g=0;g<a;g++)for(let b=0;b<u;b++){const j=b+u*(g+a*p),_=p+o*(g+a*b),m=8+t*j*4;for(let k=0;k<t;k++)n[k][_]=i.getFloat32(m+k*4,!1)}return{shape:h,frames:n,transfers:f}}function Qr(e,r,t,o,a,u,d){const l=ir(e);if(r!==t*o*a*u)throw new Error(`chunk: grids ${r} !== frames*nx*ny*nz ${t*o*a*u}`);if(d<0||d>=t)throw new Error(`chunk: localFrameIndex ${d} out of [0, ${t})`);const w=new TextDecoder().decode(l.subarray(0,8));if(!w.startsWith("NDAV2"))throw new Error(`NDAV2: bad magic ${JSON.stringify(w)}`);const h=8+r*4;if(l.byteLength!==h)throw new Error(`NDAV2: size mismatch need ${h} bytes, got ${l.byteLength}`);const s=new DataView(l.buffer,l.byteOffset,l.byteLength),n=(f,i,p)=>p+u*(i+a*f);return Xr(o,a,u,(f,i,p)=>{const g=d+t*n(f,i,p);return s.getFloat32(8+g*4,!1)})}async function Yr(e,r,t,o,a,u,d){const l=fr(e,d),w=await sr(l);return ur(w,r,t,o,a,u)}})();\n//# sourceMappingURL=read-simulate.worker-DoU45WSm.js.map\n', be = typeof self < "u" && self.Blob && new Blob(["(self.URL || self.webkitURL).revokeObjectURL(self.location.href);", Me], { type: "text/javascript;charset=utf-8" });
189
+ const Ee = '(function(){"use strict";function br(e){return e&&e.__esModule&&Object.prototype.hasOwnProperty.call(e,"default")?e.default:e}var R,K;function mr(){if(K)return R;K=1;function e(r){for(var t=new Array(r),o=0;o<r;++o)t[o]=o;return t}return R=e,R}var L,Q;function Ar(){if(Q)return L;Q=1,L=function(t){return t!=null&&(e(t)||r(t)||!!t._isBuffer)};function e(t){return!!t.constructor&&typeof t.constructor.isBuffer=="function"&&t.constructor.isBuffer(t)}function r(t){return typeof t.readFloatLE=="function"&&typeof t.slice=="function"&&e(t.slice(0,0))}return L}var P,Y;function jr(){if(Y)return P;Y=1;var e=mr(),r=Ar(),t=typeof Float64Array<"u";function o(h,s){return h[0]-s[0]}function a(){var h=this.stride,s=new Array(h.length),n;for(n=0;n<s.length;++n)s[n]=[Math.abs(h[n]),n];s.sort(o);var f=new Array(s.length);for(n=0;n<f.length;++n)f[n]=s[n][1];return f}function u(h,s){var n=["View",s,"d",h].join("");s<0&&(n="View_Nil"+h);var f=h==="generic";if(s===-1){var i="function "+n+"(a){this.data=a;}; var proto="+n+".prototype; proto.dtype=\'"+h+"\'; proto.index=function(){return -1}; proto.size=0; proto.dimension=-1; proto.shape=proto.stride=proto.order=[]; proto.lo=proto.hi=proto.transpose=proto.step= function(){return new "+n+"(this.data);}; proto.get=proto.set=function(){}; proto.pick=function(){return null}; return function construct_"+n+"(a){return new "+n+"(a);}",S=new Function(i);return S()}else if(s===0){var i="function "+n+"(a,d) { this.data = a; this.offset = d }; var proto="+n+".prototype; proto.dtype=\'"+h+"\'; proto.index=function(){return this.offset}; proto.dimension=0; proto.size=1; proto.shape= proto.stride= proto.order=[]; proto.lo= proto.hi= proto.transpose= proto.step=function "+n+"_copy() { return new "+n+"(this.data,this.offset) }; proto.pick=function "+n+"_pick(){ return TrivialArray(this.data); }; proto.valueOf=proto.get=function "+n+"_get(){ return "+(f?"this.data.get(this.offset)":"this.data[this.offset]")+"}; proto.set=function "+n+"_set(v){ return "+(f?"this.data.set(this.offset,v)":"this.data[this.offset]=v")+" }; return function construct_"+n+"(a,b,c,d){return new "+n+"(a,d)}",S=new Function("TrivialArray",i);return S(l[h][0])}var i=["\'use strict\'"],p=e(s),g=p.map(function(c){return"i"+c}),b="this.offset+"+p.map(function(c){return"this.stride["+c+"]*i"+c}).join("+"),j=p.map(function(c){return"b"+c}).join(","),_=p.map(function(c){return"c"+c}).join(",");i.push("function "+n+"(a,"+j+","+_+",d){this.data=a","this.shape=["+j+"]","this.stride=["+_+"]","this.offset=d|0}","var proto="+n+".prototype","proto.dtype=\'"+h+"\'","proto.dimension="+s),i.push("Object.defineProperty(proto,\'size\',{get:function "+n+"_size(){ return "+p.map(function(c){return"this.shape["+c+"]"}).join("*"),"}})"),s===1?i.push("proto.order=[0]"):(i.push("Object.defineProperty(proto,\'order\',{get:"),s<4?(i.push("function "+n+"_order(){"),s===2?i.push("return (Math.abs(this.stride[0])>Math.abs(this.stride[1]))?[1,0]:[0,1]}})"):s===3&&i.push("var s0=Math.abs(this.stride[0]),s1=Math.abs(this.stride[1]),s2=Math.abs(this.stride[2]); if(s0>s1){ if(s1>s2){ return [2,1,0]; }else if(s0>s2){ return [1,2,0]; }else{ return [1,0,2]; } }else if(s0>s2){ return [2,0,1]; }else if(s2>s1){ return [0,1,2]; }else{ return [0,2,1]; }}})")):i.push("ORDER})")),i.push("proto.set=function "+n+"_set("+g.join(",")+",v){"),f?i.push("return this.data.set("+b+",v)}"):i.push("return this.data["+b+"]=v}"),i.push("proto.get=function "+n+"_get("+g.join(",")+"){"),f?i.push("return this.data.get("+b+")}"):i.push("return this.data["+b+"]}"),i.push("proto.index=function "+n+"_index(",g.join(),"){return "+b+"}"),i.push("proto.hi=function "+n+"_hi("+g.join(",")+"){return new "+n+"(this.data,"+p.map(function(c){return["(typeof i",c,"!==\'number\'||i",c,"<0)?this.shape[",c,"]:i",c,"|0"].join("")}).join(",")+","+p.map(function(c){return"this.stride["+c+"]"}).join(",")+",this.offset)}");var m=p.map(function(c){return"a"+c+"=this.shape["+c+"]"}),k=p.map(function(c){return"c"+c+"=this.stride["+c+"]"});i.push("proto.lo=function "+n+"_lo("+g.join(",")+"){var b=this.offset,d=0,"+m.join(",")+","+k.join(","));for(var v=0;v<s;++v)i.push("if(typeof i"+v+"===\'number\'&&i"+v+">=0){ d=i"+v+"|0; b+=c"+v+"*d; a"+v+"-=d}");i.push("return new "+n+"(this.data,"+p.map(function(c){return"a"+c}).join(",")+","+p.map(function(c){return"c"+c}).join(",")+",b)}"),i.push("proto.step=function "+n+"_step("+g.join(",")+"){var "+p.map(function(c){return"a"+c+"=this.shape["+c+"]"}).join(",")+","+p.map(function(c){return"b"+c+"=this.stride["+c+"]"}).join(",")+",c=this.offset,d=0,ceil=Math.ceil");for(var v=0;v<s;++v)i.push("if(typeof i"+v+"===\'number\'){ d=i"+v+"|0; if(d<0){ c+=b"+v+"*(a"+v+"-1); a"+v+"=ceil(-a"+v+"/d) }else{ a"+v+"=ceil(a"+v+"/d) } b"+v+"*=d }");i.push("return new "+n+"(this.data,"+p.map(function(c){return"a"+c}).join(",")+","+p.map(function(c){return"b"+c}).join(",")+",c)}");for(var T=new Array(s),z=new Array(s),v=0;v<s;++v)T[v]="a[i"+v+"]",z[v]="b[i"+v+"]";i.push("proto.transpose=function "+n+"_transpose("+g+"){"+g.map(function(c,I){return c+"=("+c+"===undefined?"+I+":"+c+"|0)"}).join(";"),"var a=this.shape,b=this.stride;return new "+n+"(this.data,"+T.join(",")+","+z.join(",")+",this.offset)}"),i.push("proto.pick=function "+n+"_pick("+g+"){var a=[],b=[],c=this.offset");for(var v=0;v<s;++v)i.push("if(typeof i"+v+"===\'number\'&&i"+v+">=0){c=(c+this.stride["+v+"]*i"+v+")|0}else{a.push(this.shape["+v+"]);b.push(this.stride["+v+"])}");i.push("var ctor=CTOR_LIST[a.length+1];return ctor(this.data,a,b,c)}"),i.push("return function construct_"+n+"(data,shape,stride,offset){return new "+n+"(data,"+p.map(function(c){return"shape["+c+"]"}).join(",")+","+p.map(function(c){return"stride["+c+"]"}).join(",")+",offset)}");var S=new Function("CTOR_LIST","ORDER",i.join(`\n`));return S(l[h],a)}function d(h){if(r(h))return"buffer";if(t)switch(Object.prototype.toString.call(h)){case"[object Float64Array]":return"float64";case"[object Float32Array]":return"float32";case"[object Int8Array]":return"int8";case"[object Int16Array]":return"int16";case"[object Int32Array]":return"int32";case"[object Uint8Array]":return"uint8";case"[object Uint16Array]":return"uint16";case"[object Uint32Array]":return"uint32";case"[object Uint8ClampedArray]":return"uint8_clamped";case"[object BigInt64Array]":return"bigint64";case"[object BigUint64Array]":return"biguint64"}return Array.isArray(h)?"array":"generic"}var l={float32:[],float64:[],int8:[],int16:[],int32:[],uint8:[],uint16:[],uint32:[],array:[],uint8_clamped:[],bigint64:[],biguint64:[],buffer:[],generic:[]};function w(h,s,n,f){if(h===void 0){var _=l.array[0];return _([])}else typeof h=="number"&&(h=[h]);s===void 0&&(s=[h.length]);var i=s.length;if(n===void 0){n=new Array(i);for(var p=i-1,g=1;p>=0;--p)n[p]=g,g*=s[p]}if(f===void 0){f=0;for(var p=0;p<i;++p)n[p]<0&&(f-=(s[p]-1)*n[p])}for(var b=d(h),j=l[b];j.length<=i+1;)j.push(u(b,j.length-1));var _=j[i+1];return _(h,s,n,f)}return P=w,P}var _r=jr(),Er=br(_r),A=Uint8Array,O=Uint16Array,Fr=Int32Array,Z=new A([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]),rr=new A([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]),Nr=new A([16,17,18,0,8,7,9,6,10,5,11,4,12,3,13,2,14,1,15]),er=function(e,r){for(var t=new O(31),o=0;o<31;++o)t[o]=r+=1<<e[o-1];for(var a=new Fr(t[30]),o=1;o<30;++o)for(var u=t[o];u<t[o+1];++u)a[u]=u-t[o]<<5|o;return{b:t,r:a}},tr=er(Z,2),nr=tr.b,kr=tr.r;nr[28]=258,kr[258]=28;for(var xr=er(rr,0),Sr=xr.b,q=new O(32768),y=0;y<32768;++y){var x=(y&43690)>>1|(y&21845)<<1;x=(x&52428)>>2|(x&13107)<<2,x=(x&61680)>>4|(x&3855)<<4,q[y]=((x&65280)>>8|(x&255)<<8)>>1}for(var M=(function(e,r,t){for(var o=e.length,a=0,u=new O(r);a<o;++a)e[a]&&++u[e[a]-1];var d=new O(r);for(a=1;a<r;++a)d[a]=d[a-1]+u[a-1]<<1;var l;if(t){l=new O(1<<r);var w=15-r;for(a=0;a<o;++a)if(e[a])for(var h=a<<4|e[a],s=r-e[a],n=d[e[a]-1]++<<s,f=n|(1<<s)-1;n<=f;++n)l[q[n]>>w]=h}else for(l=new O(o),a=0;a<o;++a)e[a]&&(l[a]=q[d[e[a]-1]++]>>15-e[a]);return l}),$=new A(288),y=0;y<144;++y)$[y]=8;for(var y=144;y<256;++y)$[y]=9;for(var y=256;y<280;++y)$[y]=7;for(var y=280;y<288;++y)$[y]=8;for(var ar=new A(32),y=0;y<32;++y)ar[y]=5;var Dr=M($,9,1),Or=M(ar,5,1),H=function(e){for(var r=e[0],t=1;t<e.length;++t)e[t]>r&&(r=e[t]);return r},F=function(e,r,t){var o=r/8|0;return(e[o]|e[o+1]<<8)>>(r&7)&t},W=function(e,r){var t=r/8|0;return(e[t]|e[t+1]<<8|e[t+2]<<16)>>(r&7)},Tr=function(e){return(e+7)/8|0},Br=function(e,r,t){return(t==null||t>e.length)&&(t=e.length),new A(e.subarray(r,t))},Cr=["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"],N=function(e,r,t){var o=new Error(r||Cr[e]);if(o.code=e,Error.captureStackTrace&&Error.captureStackTrace(o,N),!t)throw o;return o},Mr=function(e,r,t,o){var a=e.length,u=0;if(!a||r.f&&!r.l)return t||new A(0);var d=!t,l=d||r.i!=2,w=r.i;d&&(t=new A(a*3));var h=function(wr){var yr=t.length;if(wr>yr){var gr=new A(Math.max(yr*2,wr));gr.set(t),t=gr}},s=r.f||0,n=r.p||0,f=r.b||0,i=r.l,p=r.d,g=r.m,b=r.n,j=a*8;do{if(!i){s=F(e,n,1);var _=F(e,n+1,3);if(n+=3,_)if(_==1)i=Dr,p=Or,g=9,b=5;else if(_==2){var T=F(e,n,31)+257,z=F(e,n+10,15)+4,S=T+F(e,n+5,31)+1;n+=14;for(var c=new A(S),I=new A(19),E=0;E<z;++E)I[Nr[E]]=F(e,n+E*3,7);n+=z*3;for(var cr=H(I),Zr=(1<<cr)-1,re=M(I,cr,1),E=0;E<S;){var hr=re[F(e,n,Zr)];n+=hr&15;var m=hr>>4;if(m<16)c[E++]=m;else{var B=0,V=0;for(m==16?(V=3+F(e,n,3),n+=2,B=c[E-1]):m==17?(V=3+F(e,n,7),n+=3):m==18&&(V=11+F(e,n,127),n+=7);V--;)c[E++]=B}}var pr=c.subarray(0,T),D=c.subarray(T);g=H(pr),b=H(D),i=M(pr,g,1),p=M(D,b,1)}else N(1);else{var m=Tr(n)+4,k=e[m-4]|e[m-3]<<8,v=m+k;if(v>a){w&&N(0);break}l&&h(f+k),t.set(e.subarray(m,v),f),r.b=f+=k,r.p=n=v*8,r.f=s;continue}if(n>j){w&&N(0);break}}l&&h(f+131072);for(var ee=(1<<g)-1,te=(1<<b)-1,G=n;;G=n){var B=i[W(e,n)&ee],C=B>>4;if(n+=B&15,n>j){w&&N(0);break}if(B||N(2),C<256)t[f++]=C;else if(C==256){G=n,i=null;break}else{var lr=C-254;if(C>264){var E=C-257,U=Z[E];lr=F(e,n,(1<<U)-1)+nr[E],n+=U}var J=p[W(e,n)&te],X=J>>4;J||N(3),n+=J&15;var D=Sr[X];if(X>3){var U=rr[X];D+=W(e,n)&(1<<U)-1,n+=U}if(n>j){w&&N(0);break}l&&h(f+131072);var dr=f+lr;if(f<D){var vr=u-D,ne=Math.min(D,dr);for(vr+f<0&&N(3);f<ne;++f)t[f]=o[vr+f]}for(;f<dr;++f)t[f]=t[f-D]}}r.l=i,r.p=G,r.b=f,r.f=s,i&&(s=1,r.m=g,r.d=p,r.n=b)}while(!s);return f!=t.length&&d?Br(t,0,f):t.subarray(0,f)},$r=new A(0),zr=function(e){(e[0]!=31||e[1]!=139||e[2]!=8)&&N(6,"invalid gzip data");var r=e[3],t=10;r&4&&(t+=(e[10]|e[11]<<8)+2);for(var o=(r>>3&1)+(r>>4&1);o>0;o-=!e[t++]);return t+(r&2)},Ir=function(e){var r=e.length;return(e[r-4]|e[r-3]<<8|e[r-2]<<16|e[r-1]<<24)>>>0};function or(e,r){var t=zr(e);return t+8>e.length&&N(6,"invalid gzip data"),Mr(e.subarray(t,-8),{i:2},new A(Ir(e)),r)}var Ur=typeof TextDecoder<"u"&&new TextDecoder,Vr=0;try{Ur.decode($r,{stream:!0}),Vr=1}catch{}function Rr(e){return e.length>=2&&e[0]===31&&e[1]===139}function Lr(e){try{return or(new Uint8Array(e))}catch(r){throw new Error(`gunzip: ${r instanceof Error?r.message:String(r)}`)}}const Pr=new TextEncoder().encode("NDAV2");function qr(e){if(e.length<5)return!1;for(let r=0;r<5;r++)if(e[r]!==Pr[r])return!1;return!0}function ir(e){let r=new Uint8Array(e);const t=8;for(let o=0;o<t;o++){if(qr(r))return r;if(Rr(r))try{r=or(r);continue}catch(u){throw new Error(`prepareNdav2ChunkPayload: gunzip layer ${o}: ${u instanceof Error?u.message:String(u)}`)}const a=r.length?[...r.subarray(0,Math.min(16,r.length))].map(u=>u.toString(16).padStart(2,"0")).join(" "):"empty";throw new Error(`prepareNdav2ChunkPayload: expected gzip or NDAV2, got bytes: ${a}`)}throw new Error("prepareNdav2ChunkPayload: too many gzip layers")}async function Hr(e){let r=e;return e[0]===31&&e[1]===139&&(r=Lr(new Uint8Array(e).buffer)),Wr(r)}async function Wr(e){const r=new TextDecoder;if(!r.decode(e.slice(0,8)).startsWith("NDA"))return;const o=[];let a,u;for(let i=8;i<1024;i++){if(u=e[i],u===10){a=i+1;break}o.push(u)}if(a===void 0)return;const d=r.decode(new Uint8Array(o)),l=JSON.parse(d),w=l.shape;let h=1;for(const i of w)h*=i;const s=new DataView(e.buffer,e.byteOffset+a),n=l.endian!=="little";let f=new Float32Array;switch(l.dataType){case"float32":{f=new Float32Array(h);for(let i=0;i<h;i++)f[i]=s.getFloat32(i*4,!n);break}}return Er(f,w)}function Gr(e){const r=Math.min(e.length,128);let t="";for(let o=0;o<r;o++)t+=String.fromCharCode(e[o]);return/^\\s*</.test(t)}async function sr(e){let r;try{r=await fetch(e,{credentials:"omit",mode:"cors",cache:"no-store",headers:{Accept:"*/*","Accept-Encoding":"identity"}})}catch(a){const u=/myhuaweicloud|amazonaws|aliyuncs|qcloud|obs\\./i.test(e)||e.includes(".obs."),d=a instanceof Error?a.message:String(a);throw u||/failed to fetch|networkerror|aborted|canceled/i.test(d)?new Error(d):a}if(!r.ok)throw new Error(`HTTP ${r.status} ${r.statusText}: ${e}`);const t=await r.arrayBuffer(),o=new Uint8Array(t);if(Gr(o)){const a=new TextDecoder("utf-8",{fatal:!1}).decode(o.subarray(0,256));throw new Error(`fetch chunk: expected binary, got HTML/XML: ${a.slice(0,120)}`)}return t}function fr(e,r){const t=r||self.location.origin;return new URL(e,t+"/").href}self.onmessage=async e=>{const r=e.data;try{if(r.mode==="single"){const{shape:u,frames:d,transfers:l}=await Kr(r.url,r.pageOrigin);self.postMessage({uuid:r.uuid,shape:u,frames:d,startFrameIndex:0},{transfer:l});return}if(r.mode==="chunkBytes"){const{shape:u,frames:d,transfers:l}=ur(r.arrayBuffer,r.grids,r.chunkFrameCount,r.xs,r.ys,r.zs);self.postMessage({uuid:r.uuid,shape:u,frames:d,startFrameIndex:r.startFrameIndex},{transfer:l});return}if(r.mode==="chunkFrameBytes"){const{shape:u,frame:d,transfers:l}=Qr(r.arrayBuffer,r.grids,r.chunkFrameCount,r.xs,r.ys,r.zs,r.localFrameIndex);self.postMessage({uuid:r.uuid,shape:u,frame:d,startFrameIndex:r.startFrameIndex},{transfer:l});return}const{shape:t,frames:o,transfers:a}=await Yr(r.chunkUrl,r.grids,r.chunkFrameCount,r.xs,r.ys,r.zs,r.pageOrigin);self.postMessage({uuid:r.uuid,shape:t,frames:o,startFrameIndex:r.startFrameIndex},{transfer:a})}catch(t){self.postMessage({uuid:r.uuid,error:t instanceof Error?t.message:String(t)})}};function Jr(e,r,t,o,a){const u={width:e,height:r,depth:t},d=[],l=[],w=e*r*t;for(let h=0;h<o;h++){const s=new Uint8ClampedArray(w);let n=0;for(let f=0;f<t;f++)for(let i=0;i<r;i++)for(let p=0;p<e;p++)s[n++]=a(p,i,f,h);l.push(s.buffer),d.push(s)}return{shape:u,frames:d,transfers:l}}function Xr(e,r,t,o){const a={width:e,height:r,depth:t},u=new Uint8ClampedArray(e*r*t),d=[u.buffer];let l=0;for(let w=0;w<t;w++)for(let h=0;h<r;h++)for(let s=0;s<e;s++)u[l++]=o(s,h,w);return{shape:a,frame:u,transfers:d}}async function Kr(e,r){const t=fr(e,r),o=new Uint8Array(await sr(t)),a=await Hr(o);if(!a)throw new Error("readNdaSingle: not a valid NDA v1 (after optional gunzip)");const[u,d,l,w]=a.shape;return Jr(u,d,l,w,(h,s,n,f)=>a.get(h,s,n,f))}function ur(e,r,t,o,a,u){const d=ir(e);if(r!==t*o*a*u)throw new Error(`chunk: grids ${r} !== frames*nx*ny*nz ${t*o*a*u}`);const l=new TextDecoder().decode(d.subarray(0,8));if(!l.startsWith("NDAV2"))throw new Error(`NDAV2: bad magic ${JSON.stringify(l)}`);const w=8+r*4;if(d.byteLength!==w)throw new Error(`NDAV2: size mismatch need ${w} bytes, got ${d.byteLength}`);const h={width:o,height:a,depth:u},s=o*a*u,n=Array.from({length:t},()=>new Uint8ClampedArray(s)),f=n.map(p=>p.buffer),i=new DataView(d.buffer,d.byteOffset,d.byteLength);for(let p=0;p<o;p++)for(let g=0;g<a;g++)for(let b=0;b<u;b++){const j=b+u*(g+a*p),_=p+o*(g+a*b),m=8+t*j*4;for(let k=0;k<t;k++)n[k][_]=i.getFloat32(m+k*4,!1)}return{shape:h,frames:n,transfers:f}}function Qr(e,r,t,o,a,u,d){const l=ir(e);if(r!==t*o*a*u)throw new Error(`chunk: grids ${r} !== frames*nx*ny*nz ${t*o*a*u}`);if(d<0||d>=t)throw new Error(`chunk: localFrameIndex ${d} out of [0, ${t})`);const w=new TextDecoder().decode(l.subarray(0,8));if(!w.startsWith("NDAV2"))throw new Error(`NDAV2: bad magic ${JSON.stringify(w)}`);const h=8+r*4;if(l.byteLength!==h)throw new Error(`NDAV2: size mismatch need ${h} bytes, got ${l.byteLength}`);const s=new DataView(l.buffer,l.byteOffset,l.byteLength),n=(f,i,p)=>p+u*(i+a*f);return Xr(o,a,u,(f,i,p)=>{const g=d+t*n(f,i,p);return s.getFloat32(8+g*4,!1)})}async function Yr(e,r,t,o,a,u,d){const l=fr(e,d),w=await sr(l);return ur(w,r,t,o,a,u)}})();\n', be = typeof self < "u" && self.Blob && new Blob(["(self.URL || self.webkitURL).revokeObjectURL(self.location.href);", Ee], { type: "text/javascript;charset=utf-8" });
190
190
  function Ge(n) {
191
191
  let e;
192
192
  try {
@@ -199,7 +199,7 @@ function Ge(n) {
199
199
  }), r;
200
200
  } catch {
201
201
  return new Worker(
202
- "data:text/javascript;charset=utf-8," + encodeURIComponent(Me),
202
+ "data:text/javascript;charset=utf-8," + encodeURIComponent(Ee),
203
203
  {
204
204
  name: n?.name
205
205
  }
@@ -210,7 +210,7 @@ const Ke = 4.07, Qe = 282, ie = 1;
210
210
  function er(n) {
211
211
  return n.replaceAll("\\", "/").replace(/^\.?\//, "");
212
212
  }
213
- function Ee(n) {
213
+ function Me(n) {
214
214
  return [...n.items].sort((e, r) => e.seq - r.seq);
215
215
  }
216
216
  function xe(n, e) {
@@ -219,7 +219,7 @@ function xe(n, e) {
219
219
  throw new Error(
220
220
  `globalFrameIndex ${e} out of [0, ${r})`
221
221
  );
222
- const t = Ee(n);
222
+ const t = Me(n);
223
223
  let a = 0;
224
224
  for (const i of t) {
225
225
  if (e < a + i.frames)
@@ -236,7 +236,7 @@ function rr(n, e, r) {
236
236
  function tr(n, e, r) {
237
237
  const t = n.headers.shape[3];
238
238
  if (t <= 0) return [];
239
- const a = Math.max(0, Math.min(Math.min(e, r), t - 1)), i = Math.max(0, Math.min(Math.max(e, r), t - 1)), s = [], d = Ee(n);
239
+ const a = Math.max(0, Math.min(Math.min(e, r), t - 1)), i = Math.max(0, Math.min(Math.max(e, r), t - 1)), s = [], d = Me(n);
240
240
  let f = 0;
241
241
  for (const c of d) {
242
242
  const h = f + c.frames - 1;
@@ -562,14 +562,14 @@ var mr = /* @__PURE__ */ Z(K, 9, 1), pr = /* @__PURE__ */ Z(Oe, 5, 1), oe = func
562
562
  var we = new S(Math.max(ge * 2, ve));
563
563
  we.set(r), r = we;
564
564
  }
565
- }, h = e.f || 0, o = e.p || 0, l = e.b || 0, g = e.l, k = e.d, _ = e.m, M = e.n, L = a * 8;
565
+ }, h = e.f || 0, o = e.p || 0, l = e.b || 0, g = e.l, k = e.d, _ = e.m, E = e.n, L = a * 8;
566
566
  do {
567
567
  if (!g) {
568
568
  h = T(n, o, 1);
569
569
  var D = T(n, o + 1, 3);
570
570
  if (o += 3, D)
571
571
  if (D == 1)
572
- g = mr, k = pr, _ = 9, M = 5;
572
+ g = mr, k = pr, _ = 9, E = 5;
573
573
  else if (D == 2) {
574
574
  var P = T(n, o, 31) + 257, B = T(n, o + 10, 15) + 4, $ = P + T(n, o + 5, 31) + 1;
575
575
  o += 14;
@@ -589,16 +589,16 @@ var mr = /* @__PURE__ */ Z(K, 9, 1), pr = /* @__PURE__ */ Z(Oe, 5, 1), oe = func
589
589
  }
590
590
  }
591
591
  var O = I.subarray(0, P), F = I.subarray(P);
592
- _ = oe(O), M = oe(F), g = Z(O, _, 1), k = Z(F, M, 1);
592
+ _ = oe(O), E = oe(F), g = Z(O, _, 1), k = Z(F, E, 1);
593
593
  } else
594
594
  A(1);
595
595
  else {
596
- var u = vr(o) + 4, E = n[u - 4] | n[u - 3] << 8, V = u + E;
596
+ var u = vr(o) + 4, M = n[u - 4] | n[u - 3] << 8, V = u + M;
597
597
  if (V > a) {
598
598
  f && A(0);
599
599
  break;
600
600
  }
601
- d && c(l + E), r.set(n.subarray(u, V), l), e.b = l += E, e.p = o = V * 8, e.f = h;
601
+ d && c(l + M), r.set(n.subarray(u, V), l), e.b = l += M, e.p = o = V * 8, e.f = h;
602
602
  continue;
603
603
  }
604
604
  if (o > L) {
@@ -607,7 +607,7 @@ var mr = /* @__PURE__ */ Z(K, 9, 1), pr = /* @__PURE__ */ Z(Oe, 5, 1), oe = func
607
607
  }
608
608
  }
609
609
  d && c(l + 131072);
610
- for (var te = (1 << _) - 1, ne = (1 << M) - 1, W = o; ; W = o) {
610
+ for (var te = (1 << _) - 1, ne = (1 << E) - 1, W = o; ; W = o) {
611
611
  var m = g[ue(n, o) & te], j = m >> 4;
612
612
  if (o += m & 15, o > L) {
613
613
  f && A(0);
@@ -646,7 +646,7 @@ var mr = /* @__PURE__ */ Z(K, 9, 1), pr = /* @__PURE__ */ Z(Oe, 5, 1), oe = func
646
646
  r[l] = r[l - F];
647
647
  }
648
648
  }
649
- e.l = g, e.p = W, e.b = l, e.f = h, g && (h = 1, e.m = _, e.d = k, e.n = M);
649
+ e.l = g, e.p = W, e.b = l, e.f = h, g && (h = 1, e.m = _, e.d = k, e.n = E);
650
650
  } while (!h);
651
651
  return l != r.length && s ? gr(r, 0, l) : r.subarray(0, l);
652
652
  }, br = /* @__PURE__ */ new S(0);
@@ -761,9 +761,9 @@ async function Tr(n, e, r, t = {}) {
761
761
  o,
762
762
  c
763
763
  ), _ = Array.from({ length: o }, () => {
764
- }), M = /* @__PURE__ */ new Map(), L = sr(h);
764
+ }), E = /* @__PURE__ */ new Map(), L = sr(h);
765
765
  let D = !1, u = null;
766
- const E = () => {
766
+ const M = () => {
767
767
  if (D || !u) return u;
768
768
  const p = Math.min(
769
769
  Math.max(Number(u.userData.fdsCurrentTimeSec ?? g), 0),
@@ -790,7 +790,7 @@ async function Tr(n, e, r, t = {}) {
790
790
  );
791
791
  if (rr(_, x, m.frames))
792
792
  return Promise.resolve();
793
- const O = M.get(x);
793
+ const O = E.get(x);
794
794
  if (O) return O;
795
795
  const F = (async () => {
796
796
  try {
@@ -806,12 +806,12 @@ async function Tr(n, e, r, t = {}) {
806
806
  );
807
807
  for (let C = 0; C < U; C++)
808
808
  _[H + C] = W[C];
809
- E();
809
+ M();
810
810
  } finally {
811
- M.delete(x);
811
+ E.delete(x);
812
812
  }
813
813
  })();
814
- return M.set(x, F), F;
814
+ return E.set(x, F), F;
815
815
  }, P = (p) => {
816
816
  const w = R(p, o), { chunkStartFrame: m } = xe(
817
817
  f,
@@ -865,7 +865,7 @@ async function Tr(n, e, r, t = {}) {
865
865
  u.updateCamera(m.position);
866
866
  };
867
867
  const ee = () => {
868
- D || (D = !0, M.clear(), L.dispose());
868
+ D || (D = !0, E.clear(), L.dispose());
869
869
  };
870
870
  return u.addEventListener("removed", ee), u.userData.fdsDispose = ee, u.userData.fdsSetFrame = async (p) => {
871
871
  if (D) return u;
@@ -875,7 +875,7 @@ async function Tr(n, e, r, t = {}) {
875
875
  o,
876
876
  c
877
877
  );
878
- return u.userData.fdsCurrentTimeSec = m, $(m), E(), await P(w), E(), n.render(), u;
878
+ return u.userData.fdsCurrentTimeSec = m, $(m), M(), await P(w), M(), n.render(), u;
879
879
  }, u.userData.fdsSetTime = async (p) => {
880
880
  const w = Math.min(
881
881
  Math.max(Number.isFinite(p) ? p : 0, 0),
@@ -886,7 +886,7 @@ async function Tr(n, e, r, t = {}) {
886
886
  o,
887
887
  c
888
888
  );
889
- return u.userData.fdsCurrentTimeSec = w, $(w), E(), await P(m), E(), n.render(), u;
889
+ return u.userData.fdsCurrentTimeSec = w, $(w), M(), await P(m), M(), n.render(), u;
890
890
  }, $(g), n.attachObject(u, r), n.render(), u;
891
891
  }
892
892
  let kr = 0;
@@ -1227,4 +1227,3 @@ export {
1227
1227
  ke as sootCanvasTexture,
1228
1228
  De as threeToFdsSpaceMatrix
1229
1229
  };
1230
- //# sourceMappingURL=index.esm.js.map
package/package.json CHANGED
@@ -1,7 +1,7 @@
1
1
  {
2
2
  "name": "@soonspacejs/plugin-fds",
3
3
  "pluginName": "FdsPlugin",
4
- "version": "2.15.1",
4
+ "version": "2.15.3",
5
5
  "description": "FDS plugin for SoonSpace.js",
6
6
  "main": "dist/index.esm.js",
7
7
  "module": "dist/index.esm.js",
@@ -15,9 +15,9 @@
15
15
  "license": "UNLICENSED",
16
16
  "gitHead": "4a87dd85050651088e11c3da777c49fab3db7e5d",
17
17
  "peerDependencies": {
18
- "soonspacejs": "2.15.1",
18
+ "soonspacejs": "2.15.3",
19
19
  "fflate": "^0.8.2",
20
20
  "ndarray": "^1.0.19",
21
21
  "three": "^0.183.0"
22
22
  }
23
- }
23
+ }
package/dist/assets/read-simulate.worker-DoU45WSm.js.map DELETED
@@ -1 +0,0 @@
1
- {"version":3,"file":"read-simulate.worker-DoU45WSm.js","sources":["../node_modules/.pnpm/iota-array@1.0.0/node_modules/iota-array/iota.js","../node_modules/.pnpm/is-buffer@1.1.6/node_modules/is-buffer/index.js","../node_modules/.pnpm/ndarray@1.0.19/node_modules/ndarray/ndarray.js","../node_modules/.pnpm/fflate@0.8.2/node_modules/fflate/esm/browser.js","../packages/@soonspacejs/plugin-fds/src/utils/gzip.ts","../packages/@soonspacejs/plugin-fds/src/utils/nda.ts","../packages/@soonspacejs/plugin-fds/src/utils/read-simulate.worker.ts"],"sourcesContent":["\"use strict\"\n\nfunction iota(n) {\n var result = new Array(n)\n for(var i=0; i<n; ++i) {\n result[i] = i\n }\n return result\n}\n\nmodule.exports = iota","/*!\n * Determine if an object is a Buffer\n *\n * @author Feross Aboukhadijeh <https://feross.org>\n * @license MIT\n */\n\n// The _isBuffer check is for Safari 5-7 support, because it's missing\n// Object.prototype.constructor. Remove this eventually\nmodule.exports = function (obj) {\n return obj != null && (isBuffer(obj) || isSlowBuffer(obj) || !!obj._isBuffer)\n}\n\nfunction isBuffer (obj) {\n return !!obj.constructor && typeof obj.constructor.isBuffer === 'function' && obj.constructor.isBuffer(obj)\n}\n\n// For Node v0.10 support. Remove this eventually.\nfunction isSlowBuffer (obj) {\n return typeof obj.readFloatLE === 'function' && typeof obj.slice === 'function' && isBuffer(obj.slice(0, 0))\n}\n","var iota = require(\"iota-array\")\nvar isBuffer = require(\"is-buffer\")\n\nvar hasTypedArrays = ((typeof Float64Array) !== \"undefined\")\n\nfunction compare1st(a, b) {\n return a[0] - b[0]\n}\n\nfunction order() {\n var stride = this.stride\n var terms = new Array(stride.length)\n var i\n for(i=0; i<terms.length; ++i) {\n terms[i] = [Math.abs(stride[i]), i]\n }\n terms.sort(compare1st)\n var result = new Array(terms.length)\n for(i=0; i<result.length; ++i) {\n result[i] = terms[i][1]\n }\n return result\n}\n\nfunction compileConstructor(dtype, dimension) {\n var className = [\"View\", dimension, \"d\", dtype].join(\"\")\n if(dimension < 0) {\n className = \"View_Nil\" + dtype\n }\n var useGetters = (dtype === \"generic\")\n\n if(dimension === -1) {\n //Special case for trivial arrays\n var code =\n \"function \"+className+\"(a){this.data=a;};\\\nvar proto=\"+className+\".prototype;\\\nproto.dtype='\"+dtype+\"';\\\nproto.index=function(){return -1};\\\nproto.size=0;\\\nproto.dimension=-1;\\\nproto.shape=proto.stride=proto.order=[];\\\nproto.lo=proto.hi=proto.transpose=proto.step=\\\nfunction(){return new \"+className+\"(this.data);};\\\nproto.get=proto.set=function(){};\\\nproto.pick=function(){return null};\\\nreturn function construct_\"+className+\"(a){return new \"+className+\"(a);}\"\n var procedure = new Function(code)\n return procedure()\n } else if(dimension === 0) {\n //Special case for 0d arrays\n var code =\n \"function \"+className+\"(a,d) {\\\nthis.data = a;\\\nthis.offset = d\\\n};\\\nvar proto=\"+className+\".prototype;\\\nproto.dtype='\"+dtype+\"';\\\nproto.index=function(){return this.offset};\\\nproto.dimension=0;\\\nproto.size=1;\\\nproto.shape=\\\nproto.stride=\\\nproto.order=[];\\\nproto.lo=\\\nproto.hi=\\\nproto.transpose=\\\nproto.step=function \"+className+\"_copy() {\\\nreturn new \"+className+\"(this.data,this.offset)\\\n};\\\nproto.pick=function \"+className+\"_pick(){\\\nreturn TrivialArray(this.data);\\\n};\\\nproto.valueOf=proto.get=function \"+className+\"_get(){\\\nreturn \"+(useGetters ? \"this.data.get(this.offset)\" : \"this.data[this.offset]\")+\n\"};\\\nproto.set=function \"+className+\"_set(v){\\\nreturn \"+(useGetters ? \"this.data.set(this.offset,v)\" : \"this.data[this.offset]=v\")+\"\\\n};\\\nreturn function construct_\"+className+\"(a,b,c,d){return new \"+className+\"(a,d)}\"\n var procedure = new Function(\"TrivialArray\", code)\n return procedure(CACHED_CONSTRUCTORS[dtype][0])\n }\n\n var code = [\"'use strict'\"]\n\n //Create constructor for view\n var indices = iota(dimension)\n var args = indices.map(function(i) { return \"i\"+i })\n var index_str = \"this.offset+\" + indices.map(function(i) {\n return \"this.stride[\" + i + \"]*i\" + i\n }).join(\"+\")\n var shapeArg = indices.map(function(i) {\n return \"b\"+i\n }).join(\",\")\n var strideArg = indices.map(function(i) {\n return \"c\"+i\n }).join(\",\")\n code.push(\n \"function \"+className+\"(a,\" + shapeArg + \",\" + strideArg + \",d){this.data=a\",\n \"this.shape=[\" + shapeArg + \"]\",\n \"this.stride=[\" + strideArg + \"]\",\n \"this.offset=d|0}\",\n \"var proto=\"+className+\".prototype\",\n \"proto.dtype='\"+dtype+\"'\",\n \"proto.dimension=\"+dimension)\n\n //view.size:\n code.push(\"Object.defineProperty(proto,'size',{get:function \"+className+\"_size(){\\\nreturn \"+indices.map(function(i) { return \"this.shape[\"+i+\"]\" }).join(\"*\"),\n\"}})\")\n\n //view.order:\n if(dimension === 1) {\n code.push(\"proto.order=[0]\")\n } else {\n code.push(\"Object.defineProperty(proto,'order',{get:\")\n if(dimension < 4) {\n code.push(\"function \"+className+\"_order(){\")\n if(dimension === 2) {\n code.push(\"return (Math.abs(this.stride[0])>Math.abs(this.stride[1]))?[1,0]:[0,1]}})\")\n } else if(dimension === 3) {\n code.push(\n\"var s0=Math.abs(this.stride[0]),s1=Math.abs(this.stride[1]),s2=Math.abs(this.stride[2]);\\\nif(s0>s1){\\\nif(s1>s2){\\\nreturn [2,1,0];\\\n}else if(s0>s2){\\\nreturn [1,2,0];\\\n}else{\\\nreturn [1,0,2];\\\n}\\\n}else if(s0>s2){\\\nreturn [2,0,1];\\\n}else if(s2>s1){\\\nreturn [0,1,2];\\\n}else{\\\nreturn [0,2,1];\\\n}}})\")\n }\n } else {\n code.push(\"ORDER})\")\n }\n }\n\n //view.set(i0, ..., v):\n code.push(\n\"proto.set=function \"+className+\"_set(\"+args.join(\",\")+\",v){\")\n if(useGetters) {\n code.push(\"return this.data.set(\"+index_str+\",v)}\")\n } else {\n code.push(\"return this.data[\"+index_str+\"]=v}\")\n }\n\n //view.get(i0, ...):\n code.push(\"proto.get=function \"+className+\"_get(\"+args.join(\",\")+\"){\")\n if(useGetters) {\n code.push(\"return this.data.get(\"+index_str+\")}\")\n } else {\n code.push(\"return this.data[\"+index_str+\"]}\")\n }\n\n //view.index:\n code.push(\n \"proto.index=function \"+className+\"_index(\", args.join(), \"){return \"+index_str+\"}\")\n\n //view.hi():\n code.push(\"proto.hi=function \"+className+\"_hi(\"+args.join(\",\")+\"){return new \"+className+\"(this.data,\"+\n indices.map(function(i) {\n return [\"(typeof i\",i,\"!=='number'||i\",i,\"<0)?this.shape[\", i, \"]:i\", i,\"|0\"].join(\"\")\n }).join(\",\")+\",\"+\n indices.map(function(i) {\n return \"this.stride[\"+i + \"]\"\n }).join(\",\")+\",this.offset)}\")\n\n //view.lo():\n var a_vars = indices.map(function(i) { return \"a\"+i+\"=this.shape[\"+i+\"]\" })\n var c_vars = indices.map(function(i) { return \"c\"+i+\"=this.stride[\"+i+\"]\" })\n code.push(\"proto.lo=function \"+className+\"_lo(\"+args.join(\",\")+\"){var b=this.offset,d=0,\"+a_vars.join(\",\")+\",\"+c_vars.join(\",\"))\n for(var i=0; i<dimension; ++i) {\n code.push(\n\"if(typeof i\"+i+\"==='number'&&i\"+i+\">=0){\\\nd=i\"+i+\"|0;\\\nb+=c\"+i+\"*d;\\\na\"+i+\"-=d}\")\n }\n code.push(\"return new \"+className+\"(this.data,\"+\n indices.map(function(i) {\n return \"a\"+i\n }).join(\",\")+\",\"+\n indices.map(function(i) {\n return \"c\"+i\n }).join(\",\")+\",b)}\")\n\n //view.step():\n code.push(\"proto.step=function \"+className+\"_step(\"+args.join(\",\")+\"){var \"+\n indices.map(function(i) {\n return \"a\"+i+\"=this.shape[\"+i+\"]\"\n }).join(\",\")+\",\"+\n indices.map(function(i) {\n return \"b\"+i+\"=this.stride[\"+i+\"]\"\n }).join(\",\")+\",c=this.offset,d=0,ceil=Math.ceil\")\n for(var i=0; i<dimension; ++i) {\n code.push(\n\"if(typeof i\"+i+\"==='number'){\\\nd=i\"+i+\"|0;\\\nif(d<0){\\\nc+=b\"+i+\"*(a\"+i+\"-1);\\\na\"+i+\"=ceil(-a\"+i+\"/d)\\\n}else{\\\na\"+i+\"=ceil(a\"+i+\"/d)\\\n}\\\nb\"+i+\"*=d\\\n}\")\n }\n code.push(\"return new \"+className+\"(this.data,\"+\n indices.map(function(i) {\n return \"a\" + i\n }).join(\",\")+\",\"+\n indices.map(function(i) {\n return \"b\" + i\n }).join(\",\")+\",c)}\")\n\n //view.transpose():\n var tShape = new Array(dimension)\n var tStride = new Array(dimension)\n for(var i=0; i<dimension; ++i) {\n tShape[i] = \"a[i\"+i+\"]\"\n tStride[i] = \"b[i\"+i+\"]\"\n }\n code.push(\"proto.transpose=function \"+className+\"_transpose(\"+args+\"){\"+\n args.map(function(n,idx) { return n + \"=(\" + n + \"===undefined?\" + idx + \":\" + n + \"|0)\"}).join(\";\"),\n \"var a=this.shape,b=this.stride;return new \"+className+\"(this.data,\"+tShape.join(\",\")+\",\"+tStride.join(\",\")+\",this.offset)}\")\n\n //view.pick():\n code.push(\"proto.pick=function \"+className+\"_pick(\"+args+\"){var a=[],b=[],c=this.offset\")\n for(var i=0; i<dimension; ++i) {\n code.push(\"if(typeof i\"+i+\"==='number'&&i\"+i+\">=0){c=(c+this.stride[\"+i+\"]*i\"+i+\")|0}else{a.push(this.shape[\"+i+\"]);b.push(this.stride[\"+i+\"])}\")\n }\n code.push(\"var ctor=CTOR_LIST[a.length+1];return ctor(this.data,a,b,c)}\")\n\n //Add return statement\n code.push(\"return function construct_\"+className+\"(data,shape,stride,offset){return new \"+className+\"(data,\"+\n indices.map(function(i) {\n return \"shape[\"+i+\"]\"\n }).join(\",\")+\",\"+\n indices.map(function(i) {\n return \"stride[\"+i+\"]\"\n }).join(\",\")+\",offset)}\")\n\n //Compile procedure\n var procedure = new Function(\"CTOR_LIST\", \"ORDER\", code.join(\"\\n\"))\n return procedure(CACHED_CONSTRUCTORS[dtype], order)\n}\n\nfunction arrayDType(data) {\n if(isBuffer(data)) {\n return \"buffer\"\n }\n if(hasTypedArrays) {\n switch(Object.prototype.toString.call(data)) {\n case \"[object Float64Array]\":\n return \"float64\"\n case \"[object Float32Array]\":\n return \"float32\"\n case \"[object Int8Array]\":\n return \"int8\"\n case \"[object Int16Array]\":\n return \"int16\"\n case \"[object Int32Array]\":\n return \"int32\"\n case \"[object Uint8Array]\":\n return \"uint8\"\n case \"[object Uint16Array]\":\n return \"uint16\"\n case \"[object Uint32Array]\":\n return \"uint32\"\n case \"[object Uint8ClampedArray]\":\n return \"uint8_clamped\"\n case \"[object BigInt64Array]\":\n return \"bigint64\"\n case \"[object BigUint64Array]\":\n return \"biguint64\"\n }\n }\n if(Array.isArray(data)) {\n return \"array\"\n }\n return \"generic\"\n}\n\nvar CACHED_CONSTRUCTORS = {\n \"float32\":[],\n \"float64\":[],\n \"int8\":[],\n \"int16\":[],\n \"int32\":[],\n \"uint8\":[],\n \"uint16\":[],\n \"uint32\":[],\n \"array\":[],\n \"uint8_clamped\":[],\n \"bigint64\": [],\n \"biguint64\": [],\n \"buffer\":[],\n \"generic\":[]\n}\n\n;(function() {\n for(var id in CACHED_CONSTRUCTORS) {\n CACHED_CONSTRUCTORS[id].push(compileConstructor(id, -1))\n }\n});\n\nfunction wrappedNDArrayCtor(data, shape, stride, offset) {\n if(data === undefined) {\n var ctor = CACHED_CONSTRUCTORS.array[0]\n return ctor([])\n } else if(typeof data === \"number\") {\n data = [data]\n }\n if(shape === undefined) {\n shape = [ data.length ]\n }\n var d = shape.length\n if(stride === undefined) {\n stride = new Array(d)\n for(var i=d-1, sz=1; i>=0; --i) {\n stride[i] = sz\n sz *= shape[i]\n }\n }\n if(offset === undefined) {\n offset = 0\n for(var i=0; i<d; ++i) {\n if(stride[i] < 0) {\n offset -= (shape[i]-1)*stride[i]\n }\n }\n }\n var dtype = arrayDType(data)\n var ctor_list = CACHED_CONSTRUCTORS[dtype]\n while(ctor_list.length <= d+1) {\n ctor_list.push(compileConstructor(dtype, ctor_list.length-1))\n }\n var ctor = ctor_list[d+1]\n return ctor(data, shape, stride, offset)\n}\n\nmodule.exports = wrappedNDArrayCtor\n","// 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","import { gunzipSync, } from 'fflate'\n\n/** 判断字节流是否以 gzip 头开始。 */\nfunction isGzipPayload ( u8: Uint8Array ): boolean {\n\n return u8.length >= 2 && u8[ 0 ] === 0x1f && u8[ 1 ] === 0x8b\n\n}\n\n/** 严格按 gzip 解压，调用方应确保输入本身就是 gzip。 */\nexport function gunzipArrayBuffer ( buf: ArrayBufferLike ): Uint8Array {\n\n try {\n\n return gunzipSync( new Uint8Array( buf ) )\n \n } catch ( e ) {\n\n throw new Error( `gunzip: ${e instanceof Error ? e.message : String( e )}` )\n \n }\n\n}\n\n/** 如果是 gzip 则解压，否则保持原样返回。 */\nexport function gunzipArrayBufferIfNeeded ( buf: ArrayBufferLike ): Uint8Array {\n\n const u8 = new Uint8Array( buf )\n\n if ( !isGzipPayload( u8 ) ) {\n\n return u8\n \n }\n try {\n\n return gunzipSync( u8 )\n \n } catch ( e ) {\n\n throw new Error( `gunzip: ${e instanceof Error ? e.message : String( e )}` )\n \n }\n\n}\n\nconst ndav2Magic = new TextEncoder().encode( 'NDAV2' )\n\n/** 判断字节流是否已经是 NDAV2 有效负载。 */\nfunction startsWithNdav2 ( u8: Uint8Array ): boolean {\n\n if ( u8.length < 5 ) return false\n for ( let i = 0; i < 5; i++ ) {\n\n if ( u8[ i ] !== ndav2Magic[ i ] ) return false\n \n }\n return true\n\n}\n\n/**\n * 循环剥离可能叠加的 gzip 包装，直到拿到真正的 NDAV2 负载。\n * 这样可以兼容对象存储、代理层或构建产物里多层 gzip 的情况。\n */\nexport function prepareNdav2ChunkPayload ( buf: ArrayBufferLike ): Uint8Array {\n\n let u8 = new Uint8Array( buf )\n const maxLayers = 8\n\n for ( let layer = 0; layer < maxLayers; layer++ ) {\n\n if ( startsWithNdav2( u8 ) ) {\n\n return u8\n \n }\n if ( isGzipPayload( u8 ) ) {\n\n try {\n\n u8 = gunzipSync( u8 )\n continue\n \n } catch ( e ) {\n\n throw new Error(\n `prepareNdav2ChunkPayload: gunzip layer ${layer}: ${\n e instanceof Error ? e.message : String( e )\n }`\n )\n \n }\n \n }\n const head = u8.length ?\n [ ...u8.subarray( 0, Math.min( 16, u8.length ) ) ]\n .map( ( b ) => b.toString( 16 ).padStart( 2, '0' ) )\n .join( ' ' ) :\n 'empty'\n\n throw new Error(\n `prepareNdav2ChunkPayload: expected gzip or NDAV2, got bytes: ${head}`\n )\n \n }\n throw new Error( 'prepareNdav2ChunkPayload: too many gzip layers' )\n\n}\n","import ndarray from 'ndarray'\n\nimport { gunzipArrayBuffer, } from './gzip'\n\n/**\n * 读取 NDAV2 浮点体素数据。\n * 文件头为 `NDAV2`，后面紧跟 `gridFloats` 个 float32 数据。\n */\nexport function readNdav2Floats (\n buf: Uint8Array,\n gridFloats: number\n): Float32Array {\n\n const magic = new TextDecoder().decode( buf.subarray( 0, 8 ) )\n\n if ( !magic.startsWith( 'NDAV2' ) ) {\n\n throw new Error( `NDAV2: bad magic ${JSON.stringify( magic )}` )\n \n }\n const need = 8 + gridFloats * 4\n\n if ( buf.byteLength !== need ) {\n\n throw new Error(\n `NDAV2: size mismatch need ${need} bytes, got ${buf.byteLength}`\n )\n \n }\n const out = new Float32Array( gridFloats )\n const dv = new DataView( buf.buffer, buf.byteOffset, buf.byteLength )\n\n for ( let i = 0; i < gridFloats; i++ ) {\n\n out[ i ] = dv.getFloat32( 8 + i * 4, false )\n \n }\n return out\n\n}\n\n/** 如果输入是 gzip 包装，则先解压再按 NDA 解析。 */\nexport async function readAsNdArrayMaybeGzip ( buf: Uint8Array ) {\n\n let b = buf\n\n if ( buf[ 0 ] === 0x1f && buf[ 1 ] === 0x8b ) {\n\n /**\n * 拷贝成独立的 ArrayBuffer，避免 TypeScript 在某些环境下把\n * `slice()` 推断成 `ArrayBuffer | SharedArrayBuffer`。\n */\n b = gunzipArrayBuffer( new Uint8Array( buf ).buffer )\n \n }\n return readAsNdArray( b )\n\n}\n\n/** 读取 NDA 数据并解析成 `ndarray` 结构。 */\nexport async function readAsNdArray ( buf: Uint8Array ) {\n\n const textDecoder = new TextDecoder()\n\n const magicCode = textDecoder.decode( buf.slice( 0, 8 ) )\n\n if ( !magicCode.startsWith( 'NDA' ) ) {\n\n return undefined\n \n }\n\n const headerBytes = []\n let bodyOffset: number | undefined\n let v\n\n for ( let i = 8; i < 1024; i++ ) {\n\n v = buf[ i ]\n if ( v === 0x0a ) {\n\n bodyOffset = i + 1\n break\n \n }\n headerBytes.push( v )\n \n }\n\n if ( bodyOffset === undefined ) return undefined\n\n const headerStr = textDecoder.decode( new Uint8Array( headerBytes ) )\n const header = JSON.parse( headerStr )\n\n const shape = header.shape as number[]\n let size = 1\n\n for ( const v of shape ) {\n\n size *= v\n \n }\n\n const dataView = new DataView( buf.buffer, buf.byteOffset + bodyOffset )\n const isBigEndian = header.endian !== 'little'\n\n let body = new Float32Array()\n\n switch ( header.dataType ) {\n\n case 'float32': {\n\n body = new Float32Array( size )\n for ( let i = 0; i < size; i++ ) {\n\n body[ i ] = dataView.getFloat32( i * 4, !isBigEndian )\n \n }\n break\n \n }\n \n }\n\n return ndarray( body, shape )\n\n}\n","import { readAsNdArrayMaybeGzip, } from './nda'\nimport { prepareNdav2ChunkPayload, } from './gzip'\n\n/** 返回给主线程的体素尺寸描述。 */\ntype TVolumePointsShape = {\n width: number\n height: number\n depth: number\n}\n\n/** 提前识别 HTML/XML 错误页，避免被误当成二进制分片解码。 */\nfunction looksLikeHtmlResponse ( u8: Uint8Array ): boolean {\n\n const n = Math.min( u8.length, 128 )\n let head = ''\n\n for ( let i = 0; i < n; i++ ) head += String.fromCharCode( u8[ i ] )\n return /^\\s*</.test( head )\n\n}\n\n/**\n * 拉取分片原始字节。\n * 某些对象存储网关会自动处理响应，这里尽量保持原始二进制内容不被改写。\n */\nasync function fetchArrayBufferOk ( url: string ): Promise<ArrayBuffer> {\n\n let r: Response\n\n try {\n\n r = await fetch( url, {\n credentials: 'omit',\n mode: 'cors',\n cache: 'no-store',\n headers: {\n Accept: '*/*',\n 'Accept-Encoding': 'identity',\n },\n } )\n \n } catch ( e ) {\n\n const isObs =\n /myhuaweicloud|amazonaws|aliyuncs|qcloud|obs\\./i.test( url ) ||\n url.includes( '.obs.' )\n const msg = e instanceof Error ? e.message : String( e )\n\n if ( isObs || /failed to fetch|networkerror|aborted|canceled/i.test( msg ) ) {\n\n throw new Error( msg )\n \n }\n throw e\n \n }\n if ( !r.ok ) {\n\n throw new Error( `HTTP ${r.status} ${r.statusText}: ${url}` )\n \n }\n const buf = await r.arrayBuffer()\n const u8 = new Uint8Array( buf )\n\n if ( looksLikeHtmlResponse( u8 ) ) {\n\n const snippet = new TextDecoder( 'utf-8', { fatal: false, } ).decode(\n u8.subarray( 0, 256 )\n )\n\n throw new Error(\n `fetch chunk: expected binary, got HTML/XML: ${snippet.slice( 0, 120 )}`\n )\n \n }\n return buf\n\n}\n\n/** 把相对路径解析成调用页面所在域名下的绝对地址。 */\nfunction resolveAgainstOrigin ( href: string, pageOrigin?: string ): string {\n\n const origin = pageOrigin || self.location.origin\n\n return new URL( href, origin + '/' ).href\n\n}\n\n/**\n * Worker 主入口。\n * 同时兼容旧版单文件 NDA 和新的 NDAV2 分片数据。\n */\nself.onmessage = async ( ev: MessageEvent ) => {\n\n const data = ev.data as { uuid: string; pageOrigin?: string } & (\n | { mode: 'single'; url: string }\n | {\n mode: 'chunkBytes'\n arrayBuffer: ArrayBuffer\n grids: number\n chunkFrameCount: number\n xs: number\n ys: number\n zs: number\n startFrameIndex: number\n }\n | {\n mode: 'chunk'\n chunkUrl: string\n grids: number\n chunkFrameCount: number\n xs: number\n ys: number\n zs: number\n startFrameIndex: number\n }\n | {\n mode: 'chunkFrameBytes'\n arrayBuffer: ArrayBuffer\n grids: number\n chunkFrameCount: number\n xs: number\n ys: number\n zs: number\n startFrameIndex: number\n localFrameIndex: number\n }\n )\n\n try {\n\n if ( data.mode === 'single' ) {\n\n const { shape, frames, transfers, } = await readNdaSingle(\n data.url,\n data.pageOrigin\n )\n\n self.postMessage(\n { uuid: data.uuid, shape, frames, startFrameIndex: 0, },\n { transfer: transfers, }\n )\n return\n \n }\n\n if ( data.mode === 'chunkBytes' ) {\n\n const { shape, frames, transfers, } = decodeNdav2ChunkFromArrayBuffer(\n data.arrayBuffer,\n data.grids,\n data.chunkFrameCount,\n data.xs,\n data.ys,\n data.zs\n )\n\n self.postMessage(\n {\n uuid: data.uuid,\n shape,\n frames,\n startFrameIndex: data.startFrameIndex,\n },\n { transfer: transfers, }\n )\n return\n \n }\n\n if ( data.mode === 'chunkFrameBytes' ) {\n\n const { shape, frame, transfers, } = decodeNdav2ChunkFrameFromArrayBuffer(\n data.arrayBuffer,\n data.grids,\n data.chunkFrameCount,\n data.xs,\n data.ys,\n data.zs,\n data.localFrameIndex\n )\n\n self.postMessage(\n {\n uuid: data.uuid,\n shape,\n frame,\n startFrameIndex: data.startFrameIndex,\n },\n { transfer: transfers, }\n )\n return\n \n }\n\n const { shape, frames, transfers, } = await readNdav2ChunkOnly(\n data.chunkUrl,\n data.grids,\n data.chunkFrameCount,\n data.xs,\n data.ys,\n data.zs,\n data.pageOrigin\n )\n\n self.postMessage(\n {\n uuid: data.uuid,\n shape,\n frames,\n startFrameIndex: data.startFrameIndex,\n },\n { transfer: transfers, }\n )\n \n } catch ( e ) {\n\n self.postMessage( {\n uuid: data.uuid,\n error: e instanceof Error ? e.message : String( e ),\n } )\n \n }\n\n}\n\n/** 根据 4 维标量场访问器重建整段帧数据。 */\nfunction buildFramesFrom4d (\n xs: number,\n ys: number,\n zs: number,\n fs: number,\n getV: ( x: number, y: number, z: number, f: number ) => number\n) {\n\n const shape: TVolumePointsShape = { width: xs, height: ys, depth: zs, }\n const frames: Uint8ClampedArray[] = []\n const transfers: ArrayBuffer[] = []\n const frameSize = xs * ys * zs\n\n for ( let f = 0; f < fs; f++ ) {\n\n const colors = new Uint8ClampedArray( frameSize )\n let offset = 0\n\n for ( let z = 0; z < zs; z++ ) {\n\n for ( let y = 0; y < ys; y++ ) {\n\n for ( let x = 0; x < xs; x++ ) {\n\n colors[ offset++ ] = getV( x, y, z, f )\n \n }\n \n }\n \n }\n transfers.push( colors.buffer )\n frames.push( colors )\n \n }\n\n return { shape, frames, transfers, }\n\n}\n\n/** 根据 3 维标量场访问器只重建单帧数据。 */\nfunction buildFrameFrom4d (\n xs: number,\n ys: number,\n zs: number,\n getV: ( x: number, y: number, z: number ) => number\n) {\n\n const shape: TVolumePointsShape = { width: xs, height: ys, depth: zs, }\n const frame = new Uint8ClampedArray( xs * ys * zs )\n const transfers = [ frame.buffer ]\n\n let offset = 0\n\n for ( let z = 0; z < zs; z++ ) {\n\n for ( let y = 0; y < ys; y++ ) {\n\n for ( let x = 0; x < xs; x++ ) {\n\n frame[ offset++ ] = getV( x, y, z )\n \n }\n \n }\n \n }\n\n return { shape, frame, transfers, }\n\n}\n\n/** 读取旧版 NDA v1 文件，同时兼容 gzip 包装。 */\nexport async function readNdaSingle ( url: string, pageOrigin?: string ) {\n\n const abs = resolveAgainstOrigin( url, pageOrigin )\n const buf = new Uint8Array( await fetchArrayBufferOk( abs ) )\n const nda = await readAsNdArrayMaybeGzip( buf )\n\n if ( !nda ) {\n\n throw new Error( 'readNdaSingle: not a valid NDA v1 (after optional gunzip)' )\n \n }\n\n const [ xs, ys, zs, fs ] = nda.shape\n\n return buildFramesFrom4d( xs, ys, zs, fs, ( x, y, z, f ) => nda.get( x, y, z, f ) )\n\n}\n\n/**\n * 解码已经在内存中的 NDAV2 分片。\n * 构建端输出里，时间维度是每个体素点上最内层的连续存储，这里要重新整理成\n * `VolumePoints` 直接可用的“逐帧缓冲区”布局。\n */\nfunction decodeNdav2ChunkFromArrayBuffer (\n raw: ArrayBuffer,\n grids: number,\n chunkFrameCount: number,\n xs: number,\n ys: number,\n zs: number\n) {\n\n const buf = prepareNdav2ChunkPayload( raw )\n\n if ( grids !== chunkFrameCount * xs * ys * zs ) {\n\n throw new Error(\n `chunk: grids ${grids} !== frames*nx*ny*nz ${\n chunkFrameCount * xs * ys * zs\n }`\n )\n \n }\n const magic = new TextDecoder().decode( buf.subarray( 0, 8 ) )\n\n if ( !magic.startsWith( 'NDAV2' ) ) {\n\n throw new Error( `NDAV2: bad magic ${JSON.stringify( magic )}` )\n \n }\n\n const need = 8 + grids * 4\n\n if ( buf.byteLength !== need ) {\n\n throw new Error(\n `NDAV2: size mismatch need ${need} bytes, got ${buf.byteLength}`\n )\n \n }\n\n const shape: TVolumePointsShape = { width: xs, height: ys, depth: zs, }\n const frameSize = xs * ys * zs\n const frames = Array.from(\n { length: chunkFrameCount, },\n () => new Uint8ClampedArray( frameSize )\n )\n const transfers = frames.map( frame => frame.buffer )\n const dataView = new DataView( buf.buffer, buf.byteOffset, buf.byteLength )\n\n for ( let x = 0; x < xs; x++ ) {\n\n for ( let y = 0; y < ys; y++ ) {\n\n for ( let z = 0; z < zs; z++ ) {\n\n const spatialIndex = z + zs * ( y + ys * x )\n const outputIndex = x + xs * ( y + ys * z )\n const inputBase = 8 + chunkFrameCount * spatialIndex * 4\n\n for ( let lf = 0; lf < chunkFrameCount; lf++ ) {\n\n frames[ lf ][ outputIndex ] = dataView.getFloat32( inputBase + lf * 4, false )\n \n }\n \n }\n \n }\n \n }\n\n return { shape, frames, transfers, }\n\n}\n\n/** 只从 NDAV2 分片里提取某一帧。 */\nfunction decodeNdav2ChunkFrameFromArrayBuffer (\n raw: ArrayBuffer,\n grids: number,\n chunkFrameCount: number,\n xs: number,\n ys: number,\n zs: number,\n localFrameIndex: number\n) {\n\n const buf = prepareNdav2ChunkPayload( raw )\n\n if ( grids !== chunkFrameCount * xs * ys * zs ) {\n\n throw new Error(\n `chunk: grids ${grids} !== frames*nx*ny*nz ${\n chunkFrameCount * xs * ys * zs\n }`\n )\n \n }\n if ( localFrameIndex < 0 || localFrameIndex >= chunkFrameCount ) {\n\n throw new Error(\n `chunk: localFrameIndex ${localFrameIndex} out of [0, ${chunkFrameCount})`\n )\n \n }\n\n const magic = new TextDecoder().decode( buf.subarray( 0, 8 ) )\n\n if ( !magic.startsWith( 'NDAV2' ) ) {\n\n throw new Error( `NDAV2: bad magic ${JSON.stringify( magic )}` )\n \n }\n\n const need = 8 + grids * 4\n\n if ( buf.byteLength !== need ) {\n\n throw new Error(\n `NDAV2: size mismatch need ${need} bytes, got ${buf.byteLength}`\n )\n \n }\n\n const dataView = new DataView( buf.buffer, buf.byteOffset, buf.byteLength )\n const spatialIndex = ( x: number, y: number, z: number ) =>\n z + zs * ( y + ys * x )\n\n return buildFrameFrom4d( xs, ys, zs, ( x, y, z ) => {\n\n const index = localFrameIndex + chunkFrameCount * spatialIndex( x, y, z )\n\n return dataView.getFloat32( 8 + index * 4, false )\n \n } )\n\n}\n\n/** 拉取并解码一个 NDAV2 分片。 */\nexport async function readNdav2ChunkOnly (\n chunkUrl: string,\n grids: number,\n chunkFrameCount: number,\n xs: number,\n ys: number,\n zs: number,\n pageOrigin?: string\n) {\n\n const abs = resolveAgainstOrigin( chunkUrl, pageOrigin )\n const raw = await fetchArrayBufferOk( abs )\n\n return decodeNdav2ChunkFromArrayBuffer(\n raw,\n grids,\n chunkFrameCount,\n xs,\n ys,\n zs\n )\n\n}\n"],"names":["iota","n","result","i","iota_1","isBuffer_1","obj","isBuffer","isSlowBuffer","require$$0","require$$1","hasTypedArrays","compare1st","a","b","order","stride","terms","compileConstructor","dtype","dimension","className","useGetters","code","procedure","CACHED_CONSTRUCTORS","indices","args","index_str","shapeArg","strideArg","a_vars","c_vars","tShape","tStride","idx","arrayDType","data","wrappedNDArrayCtor","shape","offset","ctor","d","sz","ctor_list","ndarray","u8","u16","i32","fleb","fdeb","clim","freb","eb","start","r","j","_a","fl","revfl","_b","fd","rev","hMap","cd","mb","s","l","le","co","rvb","sv","r_1","v","m","flt","fdt","flrm","fdrm","max","bits","p","bits16","o","shft","slc","e","ec","err","ind","msg","nt","inflt","dat","st","buf","dict","sl","dl","noBuf","resize","noSt","cbuf","bl","nbuf","final","pos","bt","lm","dm","lbt","dbt","tbts","type","hLit","hcLen","tl","ldt","clt","clb","clbmsk","clm","c","lt","dt","t","lms","dms","lpos","sym","add","dsym","end","shift","dend","et","gzs","flg","zs","gzl","gunzipSync","opts","td","tds","isGzipPayload","gunzipArrayBuffer","ndav2Magic","startsWithNdav2","prepareNdav2ChunkPayload","maxLayers","layer","head","readAsNdArrayMaybeGzip","readAsNdArray","textDecoder","headerBytes","bodyOffset","headerStr","header","size","dataView","isBigEndian","body","looksLikeHtmlResponse","fetchArrayBufferOk","url","isObs","snippet","resolveAgainstOrigin","href","pageOrigin","origin","ev","frames","transfers","readNdaSingle","decodeNdav2ChunkFromArrayBuffer","frame","decodeNdav2ChunkFrameFromArrayBuffer","readNdav2ChunkOnly","buildFramesFrom4d","xs","ys","fs","getV","frameSize","f","colors","z","y","x","buildFrameFrom4d","abs","nda","raw","grids","chunkFrameCount","magic","need","spatialIndex","outputIndex","inputBase","lf","localFrameIndex","index","chunkUrl"],"mappings":"sKAEA,SAASA,EAAKC,EAAG,CAEf,QADIC,EAAS,IAAI,MAAMD,CAAC,EAChBE,EAAE,EAAGA,EAAEF,EAAG,EAAEE,EAClBD,EAAOC,CAAC,EAAIA,EAEd,OAAOD,CACT,CAEA,OAAAE,EAAiBJ,4CCDjBK,EAAiB,SAAUC,EAAK,CAC9B,OAAOA,GAAO,OAASC,EAASD,CAAG,GAAKE,EAAaF,CAAG,GAAK,CAAC,CAACA,EAAI,UACrE,EAEA,SAASC,EAAUD,EAAK,CACtB,MAAO,CAAC,CAACA,EAAI,aAAe,OAAOA,EAAI,YAAY,UAAa,YAAcA,EAAI,YAAY,SAASA,CAAG,CAC5G,CAGA,SAASE,EAAcF,EAAK,CAC1B,OAAO,OAAOA,EAAI,aAAgB,YAAc,OAAOA,EAAI,OAAU,YAAcC,EAASD,EAAI,MAAM,EAAG,CAAC,CAAC,CAC7G,kDCpBA,IAAIN,EAAOS,GAAA,EACPF,EAAWG,GAAA,EAEXC,EAAoB,OAAO,aAAkB,IAEjD,SAASC,EAAWC,EAAGC,EAAG,CACxB,OAAOD,EAAE,CAAC,EAAIC,EAAE,CAAC,CACnB,CAEA,SAASC,GAAQ,CACf,IAAIC,EAAS,KAAK,OACdC,EAAQ,IAAI,MAAMD,EAAO,MAAM,EAC/Bb,EACJ,IAAIA,EAAE,EAAGA,EAAEc,EAAM,OAAQ,EAAEd,EACzBc,EAAMd,CAAC,EAAI,CAAC,KAAK,IAAIa,EAAOb,CAAC,CAAC,EAAGA,CAAC,EAEpCc,EAAM,KAAKL,CAAU,EACrB,IAAIV,EAAS,IAAI,MAAMe,EAAM,MAAM,EACnC,IAAId,EAAE,EAAGA,EAAED,EAAO,OAAQ,EAAEC,EAC1BD,EAAOC,CAAC,EAAIc,EAAMd,CAAC,EAAE,CAAC,EAExB,OAAOD,CACT,CAEA,SAASgB,EAAmBC,EAAOC,EAAW,CAC5C,IAAIC,EAAY,CAAC,OAAQD,EAAW,IAAKD,CAAK,EAAE,KAAK,EAAE,EACpDC,EAAY,IACbC,EAAY,WAAaF,GAE3B,IAAIG,EAAcH,IAAU,UAE5B,GAAGC,IAAc,GAAI,CAEnB,IAAIG,EACF,YAAYF,EAAU,gCAChBA,EAAU,4BACPF,EAAM,wLAMGE,EAAU,kHAGNA,EAAU,kBAAkBA,EAAU,QAC1DG,EAAY,IAAI,SAASD,CAAI,EACjC,OAAOC,EAAS,CACpB,SAAYJ,IAAc,EAAG,CAEzB,IAAIG,EACF,YAAYF,EAAU,uDAIhBA,EAAU,4BACPF,EAAM,uLAUCE,EAAU,wBACnBA,EAAU,kDAEDA,EAAU,gFAGGA,EAAU,mBACnCC,EAAa,6BAA+B,0BACtD,yBACqBD,EAAU,oBACrBC,EAAa,+BAAiC,4BAA4B,iCAExDD,EAAU,wBAAwBA,EAAU,SAChEG,EAAY,IAAI,SAAS,eAAgBD,CAAI,EACjD,OAAOC,EAAUC,EAAoBN,CAAK,EAAE,CAAC,CAAC,CAClD,CAEE,IAAII,EAAO,CAAC,cAAc,EAGtBG,EAAU1B,EAAKoB,CAAS,EACxBO,EAAOD,EAAQ,IAAI,SAASvB,EAAG,CAAE,MAAO,IAAIA,CAAC,CAAE,EAC/CyB,EAAY,eAAiBF,EAAQ,IAAI,SAASvB,EAAG,CACnD,MAAO,eAAiBA,EAAI,MAAQA,CAC5C,CAAO,EAAE,KAAK,GAAG,EACX0B,EAAWH,EAAQ,IAAI,SAASvB,EAAG,CACnC,MAAO,IAAIA,CACjB,CAAK,EAAE,KAAK,GAAG,EACT2B,EAAYJ,EAAQ,IAAI,SAASvB,EAAG,CACpC,MAAO,IAAIA,CACjB,CAAK,EAAE,KAAK,GAAG,EACboB,EAAK,KACH,YAAYF,EAAU,MAAQQ,EAAW,IAAMC,EAAY,kBACzD,eAAiBD,EAAW,IAC5B,gBAAkBC,EAAY,IAC9B,mBACF,aAAaT,EAAU,aACvB,gBAAgBF,EAAM,IACtB,mBAAmBC,CAAS,EAG9BG,EAAK,KAAK,oDAAoDF,EAAU,mBACjEK,EAAQ,IAAI,SAASvB,EAAG,CAAE,MAAO,cAAcA,EAAE,GAAG,CAAE,EAAE,KAAK,GAAG,EACzE,KAAK,EAGAiB,IAAc,EACfG,EAAK,KAAK,iBAAiB,GAE3BA,EAAK,KAAK,2CAA2C,EAClDH,EAAY,GACbG,EAAK,KAAK,YAAYF,EAAU,WAAW,EACxCD,IAAc,EACfG,EAAK,KAAK,2EAA2E,EAC7EH,IAAc,GACtBG,EAAK,KACb,wRAeK,GAGCA,EAAK,KAAK,SAAS,GAKvBA,EAAK,KACP,sBAAsBF,EAAU,QAAQM,EAAK,KAAK,GAAG,EAAE,MAAM,EACxDL,EACDC,EAAK,KAAK,wBAAwBK,EAAU,MAAM,EAElDL,EAAK,KAAK,oBAAoBK,EAAU,MAAM,EAIhDL,EAAK,KAAK,sBAAsBF,EAAU,QAAQM,EAAK,KAAK,GAAG,EAAE,IAAI,EAClEL,EACDC,EAAK,KAAK,wBAAwBK,EAAU,IAAI,EAEhDL,EAAK,KAAK,oBAAoBK,EAAU,IAAI,EAI9CL,EAAK,KACH,wBAAwBF,EAAU,UAAWM,EAAK,OAAQ,YAAYC,EAAU,GAAG,EAGrFL,EAAK,KAAK,qBAAqBF,EAAU,OAAOM,EAAK,KAAK,GAAG,EAAE,gBAAgBN,EAAU,cACvFK,EAAQ,IAAI,SAASvB,EAAG,CACtB,MAAO,CAAC,YAAYA,EAAE,iBAAiBA,EAAE,kBAAmBA,EAAG,MAAOA,EAAE,IAAI,EAAE,KAAK,EAAE,CAC3F,CAAK,EAAE,KAAK,GAAG,EAAE,IACbuB,EAAQ,IAAI,SAASvB,EAAG,CACtB,MAAO,eAAeA,EAAI,GAChC,CAAK,EAAE,KAAK,GAAG,EAAE,gBAAgB,EAG/B,IAAI4B,EAASL,EAAQ,IAAI,SAASvB,EAAG,CAAE,MAAO,IAAIA,EAAE,eAAeA,EAAE,GAAG,CAAE,EACtE6B,EAASN,EAAQ,IAAI,SAASvB,EAAG,CAAE,MAAO,IAAIA,EAAE,gBAAgBA,EAAE,GAAG,CAAE,EAC3EoB,EAAK,KAAK,qBAAqBF,EAAU,OAAOM,EAAK,KAAK,GAAG,EAAE,2BAA2BI,EAAO,KAAK,GAAG,EAAE,IAAIC,EAAO,KAAK,GAAG,CAAC,EAC/H,QAAQ7B,EAAE,EAAGA,EAAEiB,EAAW,EAAEjB,EAC1BoB,EAAK,KACT,cAAcpB,EAAE,iBAAiBA,EAAE,YAC9BA,EAAE,WACDA,EAAE,QACLA,EAAE,MAAM,EAEToB,EAAK,KAAK,cAAcF,EAAU,cAChCK,EAAQ,IAAI,SAASvB,EAAG,CACtB,MAAO,IAAIA,CACjB,CAAK,EAAE,KAAK,GAAG,EAAE,IACbuB,EAAQ,IAAI,SAASvB,EAAG,CACtB,MAAO,IAAIA,CACjB,CAAK,EAAE,KAAK,GAAG,EAAE,MAAM,EAGrBoB,EAAK,KAAK,uBAAuBF,EAAU,SAASM,EAAK,KAAK,GAAG,EAAE,SACjED,EAAQ,IAAI,SAASvB,EAAG,CACtB,MAAO,IAAIA,EAAE,eAAeA,EAAE,GACpC,CAAK,EAAE,KAAK,GAAG,EAAE,IACbuB,EAAQ,IAAI,SAASvB,EAAG,CACtB,MAAO,IAAIA,EAAE,gBAAgBA,EAAE,GACrC,CAAK,EAAE,KAAK,GAAG,EAAE,mCAAmC,EAClD,QAAQA,EAAE,EAAGA,EAAEiB,EAAW,EAAEjB,EAC1BoB,EAAK,KACT,cAAcpB,EAAE,oBACXA,EAAE,oBAEDA,EAAE,MAAMA,EAAE,SACbA,EAAE,WAAWA,EAAE,eAEfA,EAAE,UAAUA,EAAE,UAEdA,EAAE,OACH,EAEAoB,EAAK,KAAK,cAAcF,EAAU,cAChCK,EAAQ,IAAI,SAASvB,EAAG,CACtB,MAAO,IAAMA,CACnB,CAAK,EAAE,KAAK,GAAG,EAAE,IACbuB,EAAQ,IAAI,SAASvB,EAAG,CACtB,MAAO,IAAMA,CACnB,CAAK,EAAE,KAAK,GAAG,EAAE,MAAM,EAKrB,QAFI8B,EAAS,IAAI,MAAMb,CAAS,EAC5Bc,EAAU,IAAI,MAAMd,CAAS,EACzBjB,EAAE,EAAGA,EAAEiB,EAAW,EAAEjB,EAC1B8B,EAAO9B,CAAC,EAAI,MAAMA,EAAE,IACpB+B,EAAQ/B,CAAC,EAAI,MAAMA,EAAE,IAEvBoB,EAAK,KAAK,4BAA4BF,EAAU,cAAcM,EAAK,KACjEA,EAAK,IAAI,SAAS1B,EAAEkC,EAAK,CAAE,OAAOlC,EAAI,KAAOA,EAAI,gBAAkBkC,EAAM,IAAMlC,EAAI,KAAK,CAAC,EAAE,KAAK,GAAG,EACnG,6CAA6CoB,EAAU,cAAcY,EAAO,KAAK,GAAG,EAAE,IAAIC,EAAQ,KAAK,GAAG,EAAE,gBAAgB,EAG9HX,EAAK,KAAK,uBAAuBF,EAAU,SAASM,EAAK,+BAA+B,EACxF,QAAQxB,EAAE,EAAGA,EAAEiB,EAAW,EAAEjB,EAC1BoB,EAAK,KAAK,cAAcpB,EAAE,iBAAiBA,EAAE,yBAAyBA,EAAE,MAAMA,EAAE,8BAA8BA,EAAE,yBAAyBA,EAAE,KAAK,EAElJoB,EAAK,KAAK,8DAA8D,EAGxEA,EAAK,KAAK,6BAA6BF,EAAU,yCAAyCA,EAAU,SAClGK,EAAQ,IAAI,SAASvB,EAAG,CACtB,MAAO,SAASA,EAAE,GACxB,CAAK,EAAE,KAAK,GAAG,EAAE,IACbuB,EAAQ,IAAI,SAASvB,EAAG,CACtB,MAAO,UAAUA,EAAE,GACzB,CAAK,EAAE,KAAK,GAAG,EAAE,WAAW,EAG1B,IAAIqB,EAAY,IAAI,SAAS,YAAa,QAASD,EAAK,KAAK;AAAA,CAAI,CAAC,EAClE,OAAOC,EAAUC,EAAoBN,CAAK,EAAGJ,CAAK,CACpD,CAEA,SAASqB,EAAWC,EAAM,CACxB,GAAG9B,EAAS8B,CAAI,EACd,MAAO,SAET,GAAG1B,EACD,OAAO,OAAO,UAAU,SAAS,KAAK0B,CAAI,EAAC,CACzC,IAAK,wBACH,MAAO,UACT,IAAK,wBACH,MAAO,UACT,IAAK,qBACH,MAAO,OACT,IAAK,sBACH,MAAO,QACT,IAAK,sBACH,MAAO,QACT,IAAK,sBACH,MAAO,QACT,IAAK,uBACH,MAAO,SACT,IAAK,uBACH,MAAO,SACT,IAAK,6BACH,MAAO,gBACT,IAAK,yBACH,MAAO,WACT,IAAK,0BACH,MAAO,WACf,CAEE,OAAG,MAAM,QAAQA,CAAI,EACZ,QAEF,SACT,CAEA,IAAIZ,EAAsB,CACxB,QAAU,CAAA,EACV,QAAU,CAAA,EACV,KAAO,CAAA,EACP,MAAQ,CAAA,EACR,MAAQ,CAAA,EACR,MAAQ,CAAA,EACR,OAAS,CAAA,EACT,OAAS,CAAA,EACT,MAAQ,CAAA,EACR,cAAgB,CAAA,EAChB,SAAY,CAAA,EACZ,UAAa,CAAA,EACb,OAAS,CAAA,EACT,QAAU,CAAA,CACZ,EAQA,SAASa,EAAmBD,EAAME,EAAOvB,EAAQwB,EAAQ,CACvD,GAAGH,IAAS,OAAW,CACrB,IAAII,EAAOhB,EAAoB,MAAM,CAAC,EACtC,OAAOgB,EAAK,CAAA,CAAE,CAClB,MAAY,OAAOJ,GAAS,WACxBA,EAAO,CAACA,CAAI,GAEXE,IAAU,SACXA,EAAQ,CAAEF,EAAK,MAAM,GAEvB,IAAIK,EAAIH,EAAM,OACd,GAAGvB,IAAW,OAAW,CACvBA,EAAS,IAAI,MAAM0B,CAAC,EACpB,QAAQvC,EAAEuC,EAAE,EAAGC,EAAG,EAAGxC,GAAG,EAAG,EAAEA,EAC3Ba,EAAOb,CAAC,EAAIwC,EACZA,GAAMJ,EAAMpC,CAAC,CAEnB,CACE,GAAGqC,IAAW,OAAW,CACvBA,EAAS,EACT,QAAQrC,EAAE,EAAGA,EAAEuC,EAAG,EAAEvC,EACfa,EAAOb,CAAC,EAAI,IACbqC,IAAWD,EAAMpC,CAAC,EAAE,GAAGa,EAAOb,CAAC,EAGvC,CAGE,QAFIgB,EAAQiB,EAAWC,CAAI,EACvBO,EAAYnB,EAAoBN,CAAK,EACnCyB,EAAU,QAAUF,EAAE,GAC1BE,EAAU,KAAK1B,EAAmBC,EAAOyB,EAAU,OAAO,CAAC,CAAC,EAE9D,IAAIH,EAAOG,EAAUF,EAAE,CAAC,EACxB,OAAOD,EAAKJ,EAAME,EAAOvB,EAAQwB,CAAM,CACzC,CAEAK,OAAAA,EAAiBP,0BC9TbQ,EAAK,WAAYC,EAAM,YAAaC,GAAM,WAE1CC,EAAO,IAAIH,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,CAAC,CAAC,EAE5II,GAAO,IAAIJ,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,CAAC,CAAC,EAEnIK,GAAO,IAAIL,EAAG,CAAC,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,EAAE,CAAC,EAEhFM,GAAO,SAAUC,EAAIC,EAAO,CAE5B,QADIxC,EAAI,IAAIiC,EAAI,EAAE,EACT5C,EAAI,EAAGA,EAAI,GAAI,EAAEA,EACtBW,EAAEX,CAAC,EAAImD,GAAS,GAAKD,EAAGlD,EAAI,CAAC,EAIjC,QADIoD,EAAI,IAAIP,GAAIlC,EAAE,EAAE,CAAC,EACZX,EAAI,EAAGA,EAAI,GAAI,EAAEA,EACtB,QAASqD,EAAI1C,EAAEX,CAAC,EAAGqD,EAAI1C,EAAEX,EAAI,CAAC,EAAG,EAAEqD,EAC/BD,EAAEC,CAAC,EAAMA,EAAI1C,EAAEX,CAAC,GAAM,EAAKA,EAGnC,MAAO,CAAE,EAAGW,EAAG,EAAGyC,CAAC,CACvB,EACIE,GAAKL,GAAKH,EAAM,CAAC,EAAGS,GAAKD,GAAG,EAAGE,GAAQF,GAAG,EAE9CC,GAAG,EAAE,EAAI,IAAKC,GAAM,GAAG,EAAI,GAI3B,QAHIC,GAAKR,GAAKF,GAAM,CAAC,EAAGW,GAAKD,GAAG,EAE5BE,EAAM,IAAIf,EAAI,KAAK,EACd5C,EAAI,EAAGA,EAAI,MAAO,EAAEA,EAAG,CAE5B,IAAI,GAAMA,EAAI,QAAW,GAAOA,EAAI,QAAW,EAC/C,GAAM,EAAI,QAAW,GAAO,EAAI,QAAW,EAC3C,GAAM,EAAI,QAAW,GAAO,EAAI,OAAW,EAC3C2D,EAAI3D,CAAC,IAAO,EAAI,QAAW,GAAO,EAAI,MAAW,IAAO,CAC5D,CAuDA,QAnDI4D,GAAQ,SAAUC,EAAIC,EAAIV,EAAG,CAO7B,QANIW,EAAIF,EAAG,OAEP7D,EAAI,EAEJgE,EAAI,IAAIpB,EAAIkB,CAAE,EAEX9D,EAAI+D,EAAG,EAAE/D,EACR6D,EAAG7D,CAAC,GACJ,EAAEgE,EAAEH,EAAG7D,CAAC,EAAI,CAAC,EAGrB,IAAIiE,EAAK,IAAIrB,EAAIkB,CAAE,EACnB,IAAK9D,EAAI,EAAGA,EAAI8D,EAAI,EAAE9D,EAClBiE,EAAGjE,CAAC,EAAKiE,EAAGjE,EAAI,CAAC,EAAIgE,EAAEhE,EAAI,CAAC,GAAM,EAEtC,IAAIkE,EACJ,GAAId,EAAG,CAEHc,EAAK,IAAItB,EAAI,GAAKkB,CAAE,EAEpB,IAAIK,EAAM,GAAKL,EACf,IAAK9D,EAAI,EAAGA,EAAI+D,EAAG,EAAE/D,EAEjB,GAAI6D,EAAG7D,CAAC,EAQJ,QANIoE,EAAMpE,GAAK,EAAK6D,EAAG7D,CAAC,EAEpBqE,EAAMP,EAAKD,EAAG7D,CAAC,EAEfsE,EAAIL,EAAGJ,EAAG7D,CAAC,EAAI,CAAC,KAAOqE,EAElBE,EAAID,GAAM,GAAKD,GAAO,EAAIC,GAAKC,EAAG,EAAED,EAEzCJ,EAAGP,EAAIW,CAAC,GAAKH,CAAG,EAAIC,CAIpC,KAGI,KADAF,EAAK,IAAItB,EAAImB,CAAC,EACT/D,EAAI,EAAGA,EAAI+D,EAAG,EAAE/D,EACb6D,EAAG7D,CAAC,IACJkE,EAAGlE,CAAC,EAAI2D,EAAIM,EAAGJ,EAAG7D,CAAC,EAAI,CAAC,GAAG,GAAM,GAAK6D,EAAG7D,CAAC,GAItD,OAAOkE,CACX,GAEIM,EAAM,IAAI7B,EAAG,GAAG,EACX3C,EAAI,EAAGA,EAAI,IAAK,EAAEA,EACvBwE,EAAIxE,CAAC,EAAI,EACb,QAASA,EAAI,IAAKA,EAAI,IAAK,EAAEA,EACzBwE,EAAIxE,CAAC,EAAI,EACb,QAASA,EAAI,IAAKA,EAAI,IAAK,EAAEA,EACzBwE,EAAIxE,CAAC,EAAI,EACb,QAASA,EAAI,IAAKA,EAAI,IAAK,EAAEA,EACzBwE,EAAIxE,CAAC,EAAI,EAGb,QADIyE,GAAM,IAAI9B,EAAG,EAAE,EACV3C,EAAI,EAAGA,EAAI,GAAI,EAAEA,EACtByE,GAAIzE,CAAC,EAAI,EAEV,IAAsC0E,GAAqBd,EAAKY,EAAK,EAAG,CAAC,EAEnCG,GAAqBf,EAAKa,GAAK,EAAG,CAAC,EAExEG,EAAM,SAAUlE,EAAG,CAEnB,QADI6D,EAAI7D,EAAE,CAAC,EACFV,EAAI,EAAGA,EAAIU,EAAE,OAAQ,EAAEV,EACxBU,EAAEV,CAAC,EAAIuE,IACPA,EAAI7D,EAAEV,CAAC,GAEf,OAAOuE,CACX,EAEIM,EAAO,SAAUtC,EAAGuC,EAAGP,EAAG,CAC1B,IAAI,EAAKO,EAAI,EAAK,EAClB,OAASvC,EAAE,CAAC,EAAKA,EAAE,EAAI,CAAC,GAAK,KAAQuC,EAAI,GAAMP,CACnD,EAEIQ,EAAS,SAAUxC,EAAGuC,EAAG,CACzB,IAAIE,EAAKF,EAAI,EAAK,EAClB,OAASvC,EAAEyC,CAAC,EAAKzC,EAAEyC,EAAI,CAAC,GAAK,EAAMzC,EAAEyC,EAAI,CAAC,GAAK,MAASF,EAAI,EAChE,EAEIG,GAAO,SAAUH,EAAG,CAAE,OAASA,EAAI,GAAK,EAAK,CAAG,EAGhDI,GAAM,SAAUZ,EAAGP,EAAGoB,EAAG,CAGzB,OAAIA,GAAK,MAAQA,EAAIb,EAAE,UACnBa,EAAIb,EAAE,QAEH,IAAI3B,EAAG2B,EAAE,SAASP,EAAGoB,CAAC,CAAC,CAClC,EAsBIC,GAAK,CACL,iBACA,qBACA,yBACA,mBACA,kBACA,oBACJ,CACI,cACA,qBACA,uBACA,8BACA,oBACA,mBACA,kBAEJ,EAEIC,EAAM,SAAUC,EAAKC,EAAKC,EAAI,CAC9B,IAAIL,EAAI,IAAI,MAAMI,GAAOH,GAAGE,CAAG,CAAC,EAIhC,GAHAH,EAAE,KAAOG,EACL,MAAM,mBACN,MAAM,kBAAkBH,EAAGE,CAAG,EAC9B,CAACG,EACD,MAAML,EACV,OAAOA,CACX,EAEIM,GAAQ,SAAUC,EAAKC,EAAIC,EAAKC,EAAM,CAEtC,IAAIC,EAAKJ,EAAI,OAAQK,EAA0B,EAC/C,GAAI,CAACD,GAAMH,EAAG,GAAK,CAACA,EAAG,EACnB,OAAOC,GAAO,IAAIjD,EAAG,CAAC,EAC1B,IAAIqD,EAAQ,CAACJ,EAETK,EAASD,GAASL,EAAG,GAAK,EAE1BO,EAAOP,EAAG,EAEVK,IACAJ,EAAM,IAAIjD,EAAGmD,EAAK,CAAC,GAEvB,IAAIK,EAAO,SAAUnC,GAAG,CACpB,IAAIoC,GAAKR,EAAI,OAEb,GAAI5B,GAAIoC,GAAI,CAER,IAAIC,GAAO,IAAI1D,EAAG,KAAK,IAAIyD,GAAK,EAAGpC,EAAC,CAAC,EACrCqC,GAAK,IAAIT,CAAG,EACZA,EAAMS,EACV,CACJ,EAEIC,EAAQX,EAAG,GAAK,EAAGY,EAAMZ,EAAG,GAAK,EAAGa,EAAKb,EAAG,GAAK,EAAGc,EAAKd,EAAG,EAAGe,EAAKf,EAAG,EAAGgB,EAAMhB,EAAG,EAAGiB,EAAMjB,EAAG,EAE/FkB,EAAOf,EAAK,EAChB,EAAG,CACC,GAAI,CAACW,EAAI,CAELH,EAAQzB,EAAKa,EAAKa,EAAK,CAAC,EAExB,IAAIO,EAAOjC,EAAKa,EAAKa,EAAM,EAAG,CAAC,EAE/B,GADAA,GAAO,EACFO,EAiBA,GAAIA,GAAQ,EACbL,EAAK/B,GAAMgC,EAAK/B,GAAMgC,EAAM,EAAGC,EAAM,UAChCE,GAAQ,EAAG,CAEhB,IAAIC,EAAOlC,EAAKa,EAAKa,EAAK,EAAE,EAAI,IAAKS,EAAQnC,EAAKa,EAAKa,EAAM,GAAI,EAAE,EAAI,EACnEU,EAAKF,EAAOlC,EAAKa,EAAKa,EAAM,EAAG,EAAE,EAAI,EACzCA,GAAO,GAKP,QAHIW,EAAM,IAAIvE,EAAGsE,CAAE,EAEfE,EAAM,IAAIxE,EAAG,EAAE,EACV3C,EAAI,EAAGA,EAAIgH,EAAO,EAAEhH,EAEzBmH,EAAInE,GAAKhD,CAAC,CAAC,EAAI6E,EAAKa,EAAKa,EAAMvG,EAAI,EAAG,CAAC,EAE3CuG,GAAOS,EAAQ,EAKf,QAHII,GAAMxC,EAAIuC,CAAG,EAAGE,IAAU,GAAKD,IAAO,EAEtCE,GAAM1D,EAAKuD,EAAKC,GAAK,CAAC,EACjBpH,EAAI,EAAGA,EAAIiH,GAAK,CACrB,IAAI7D,GAAIkE,GAAIzC,EAAKa,EAAKa,EAAKc,EAAM,CAAC,EAElCd,GAAOnD,GAAI,GAEX,IAAIW,EAAIX,IAAK,EAEb,GAAIW,EAAI,GACJmD,EAAIlH,GAAG,EAAI+D,MAEV,CAED,IAAIwD,EAAI,EAAGzH,EAAI,EAOf,IANIiE,GAAK,IACLjE,EAAI,EAAI+E,EAAKa,EAAKa,EAAK,CAAC,EAAGA,GAAO,EAAGgB,EAAIL,EAAIlH,EAAI,CAAC,GAC7C+D,GAAK,IACVjE,EAAI,EAAI+E,EAAKa,EAAKa,EAAK,CAAC,EAAGA,GAAO,GAC7BxC,GAAK,KACVjE,EAAI,GAAK+E,EAAKa,EAAKa,EAAK,GAAG,EAAGA,GAAO,GAClCzG,KACHoH,EAAIlH,GAAG,EAAIuH,CACnB,CACJ,CAEA,IAAIC,GAAKN,EAAI,SAAS,EAAGH,CAAI,EAAGU,EAAKP,EAAI,SAASH,CAAI,EAEtDJ,EAAM/B,EAAI4C,EAAE,EAEZZ,EAAMhC,EAAI6C,CAAE,EACZhB,EAAK7C,EAAK4D,GAAIb,EAAK,CAAC,EACpBD,EAAK9C,EAAK6D,EAAIb,EAAK,CAAC,CACxB,MAEIvB,EAAI,CAAC,MAtEE,CAEP,IAAItB,EAAIkB,GAAKsB,CAAG,EAAI,EAAGvC,EAAI0B,EAAI3B,EAAI,CAAC,EAAK2B,EAAI3B,EAAI,CAAC,GAAK,EAAI2D,EAAI3D,EAAIC,EACnE,GAAI0D,EAAI5B,EAAI,CACJI,GACAb,EAAI,CAAC,EACT,KACJ,CAEIY,GACAE,EAAKK,EAAKxC,CAAC,EAEf4B,EAAI,IAAIF,EAAI,SAAS3B,EAAG2D,CAAC,EAAGlB,CAAE,EAE9Bb,EAAG,EAAIa,GAAMxC,EAAG2B,EAAG,EAAIY,EAAMmB,EAAI,EAAG/B,EAAG,EAAIW,EAC3C,QACJ,CAuDA,GAAIC,EAAMM,EAAM,CACRX,GACAb,EAAI,CAAC,EACT,KACJ,CACJ,CAGIY,GACAE,EAAKK,EAAK,MAAM,EAGpB,QAFImB,IAAO,GAAKhB,GAAO,EAAGiB,IAAO,GAAKhB,GAAO,EACzCiB,EAAOtB,GACHsB,EAAOtB,EAAK,CAEhB,IAAIgB,EAAId,EAAG1B,EAAOW,EAAKa,CAAG,EAAIoB,EAAG,EAAGG,EAAMP,GAAK,EAE/C,GADAhB,GAAOgB,EAAI,GACPhB,EAAMM,EAAM,CACRX,GACAb,EAAI,CAAC,EACT,KACJ,CAGA,GAFKkC,GACDlC,EAAI,CAAC,EACLyC,EAAM,IACNlC,EAAIY,GAAI,EAAIsB,UACPA,GAAO,IAAK,CACjBD,EAAOtB,EAAKE,EAAK,KACjB,KACJ,KACK,CACD,IAAIsB,GAAMD,EAAM,IAEhB,GAAIA,EAAM,IAAK,CAEX,IAAI9H,EAAI8H,EAAM,IAAKnH,EAAImC,EAAK9C,CAAC,EAC7B+H,GAAMlD,EAAKa,EAAKa,GAAM,GAAK5F,GAAK,CAAC,EAAI4C,GAAGvD,CAAC,EACzCuG,GAAO5F,CACX,CAEA,IAAI4B,EAAImE,EAAG3B,EAAOW,EAAKa,CAAG,EAAIqB,EAAG,EAAGI,EAAOzF,GAAK,EAC3CA,GACD8C,EAAI,CAAC,EACTkB,GAAOhE,EAAI,GACX,IAAIkF,EAAK/D,GAAGsE,CAAI,EAChB,GAAIA,EAAO,EAAG,CACV,IAAIrH,EAAIoC,GAAKiF,CAAI,EACjBP,GAAM1C,EAAOW,EAAKa,CAAG,GAAK,GAAK5F,GAAK,EAAG4F,GAAO5F,CAClD,CACA,GAAI4F,EAAMM,EAAM,CACRX,GACAb,EAAI,CAAC,EACT,KACJ,CACIY,GACAE,EAAKK,EAAK,MAAM,EACpB,IAAIyB,GAAMzB,EAAKuB,GACf,GAAIvB,EAAKiB,EAAI,CACT,IAAIS,GAAQnC,EAAK0B,EAAIU,GAAO,KAAK,IAAIV,EAAIQ,EAAG,EAG5C,IAFIC,GAAQ1B,EAAK,GACbnB,EAAI,CAAC,EACFmB,EAAK2B,GAAM,EAAE3B,EAChBZ,EAAIY,CAAE,EAAIX,EAAKqC,GAAQ1B,CAAE,CACjC,CACA,KAAOA,EAAKyB,GAAK,EAAEzB,EACfZ,EAAIY,CAAE,EAAIZ,EAAIY,EAAKiB,CAAE,CAC7B,CACJ,CACA9B,EAAG,EAAIc,EAAId,EAAG,EAAIkC,EAAMlC,EAAG,EAAIa,EAAIb,EAAG,EAAIW,EACtCG,IACAH,EAAQ,EAAGX,EAAG,EAAIgB,EAAKhB,EAAG,EAAIe,EAAIf,EAAG,EAAIiB,EACjD,OAAS,CAACN,GAEV,OAAOE,GAAMZ,EAAI,QAAUI,EAAQd,GAAIU,EAAK,EAAGY,CAAE,EAAIZ,EAAI,SAAS,EAAGY,CAAE,CAC3E,EAoOI4B,GAAmB,IAAIzF,EAAG,CAAC,EAmW3B0F,GAAM,SAAU9F,EAAG,EACfA,EAAE,CAAC,GAAK,IAAMA,EAAE,CAAC,GAAK,KAAOA,EAAE,CAAC,GAAK,IACrC8C,EAAI,EAAG,mBAAmB,EAC9B,IAAIiD,EAAM/F,EAAE,CAAC,EACToD,EAAK,GACL2C,EAAM,IACN3C,IAAOpD,EAAE,EAAE,EAAIA,EAAE,EAAE,GAAK,GAAK,GACjC,QAASgG,GAAMD,GAAO,EAAI,IAAMA,GAAO,EAAI,GAAIC,EAAK,EAAGA,GAAM,CAAChG,EAAEoD,GAAI,EAChE,CACJ,OAAOA,GAAM2C,EAAM,EACvB,EAEIE,GAAM,SAAUjG,EAAG,CACnB,IAAIyB,EAAIzB,EAAE,OACV,OAAQA,EAAEyB,EAAI,CAAC,EAAIzB,EAAEyB,EAAI,CAAC,GAAK,EAAIzB,EAAEyB,EAAI,CAAC,GAAK,GAAKzB,EAAEyB,EAAI,CAAC,GAAK,MAAQ,CAC5E,EAwXO,SAASyE,GAAWvG,EAAMwG,EAAM,CACnC,IAAI/C,EAAK0C,GAAInG,CAAI,EACjB,OAAIyD,EAAK,EAAIzD,EAAK,QACdmD,EAAI,EAAG,mBAAmB,EACvBI,GAAMvD,EAAK,SAASyD,EAAI,EAAE,EAAG,CAAE,EAAG,CAAC,EAAwB,IAAIhD,EAAG6F,GAAItG,CAAI,CAAC,EAAGwG,CAAuB,CAChH,CAoRA,IAAIC,GAAK,OAAO,YAAe,KAA6B,IAAI,YAE5DC,GAAM,EACV,GAAI,CACAD,GAAG,OAAOP,GAAI,CAAE,OAAQ,EAAI,CAAE,EAC9BQ,GAAM,CACV,MACU,CAAE,CCrnDZ,SAASC,GAAgBlG,EAA0B,CAEjD,OAAOA,EAAG,QAAU,GAAKA,EAAI,CAAE,IAAM,IAAQA,EAAI,CAAE,IAAM,GAE3D,CAGO,SAASmG,GAAoBlD,EAAmC,CAErE,GAAI,CAEF,OAAO6C,GAAY,IAAI,WAAY7C,CAAI,CAAE,CAE3C,OAAUT,EAAI,CAEZ,MAAM,IAAI,MAAO,WAAWA,aAAa,MAAQA,EAAE,QAAU,OAAQA,CAAE,CAAC,EAAG,CAE7E,CAEF,CAwBA,MAAM4D,GAAa,IAAI,cAAc,OAAQ,OAAQ,EAGrD,SAASC,GAAkBrG,EAA0B,CAEnD,GAAKA,EAAG,OAAS,EAAI,MAAO,GAC5B,QAAU3C,EAAI,EAAGA,EAAI,EAAGA,IAEtB,GAAK2C,EAAI3C,CAAE,IAAM+I,GAAY/I,CAAE,EAAI,MAAO,GAG5C,MAAO,EAET,CAMO,SAASiJ,GAA2BrD,EAAmC,CAE5E,IAAIjD,EAAK,IAAI,WAAYiD,CAAI,EAC7B,MAAMsD,EAAY,EAElB,QAAUC,EAAQ,EAAGA,EAAQD,EAAWC,IAAU,CAEhD,GAAKH,GAAiBrG,CAAG,EAEvB,OAAOA,EAGT,GAAKkG,GAAelG,CAAG,EAErB,GAAI,CAEFA,EAAK8F,GAAY9F,CAAG,EACpB,QAEF,OAAUwC,EAAI,CAEZ,MAAM,IAAI,MACR,0CAA0CgE,CAAK,KAC7ChE,aAAa,MAAQA,EAAE,QAAU,OAAQA,CAAE,CAC7C,EAAA,CAGJ,CAGF,MAAMiE,EAAOzG,EAAG,OACd,CAAE,GAAGA,EAAG,SAAU,EAAG,KAAK,IAAK,GAAIA,EAAG,MAAO,CAAE,CAAE,EAC9C,IAAOhC,GAAOA,EAAE,SAAU,EAAG,EAAE,SAAU,EAAG,GAAI,CAAE,EAClD,KAAM,GAAI,EACb,QAEF,MAAM,IAAI,MACR,gEAAgEyI,CAAI,EAAA,CAGxE,CACA,MAAM,IAAI,MAAO,gDAAiD,CAEpE,CClEA,eAAsBC,GAAyBzD,EAAkB,CAE/D,IAAIjF,EAAIiF,EAER,OAAKA,EAAK,CAAE,IAAM,IAAQA,EAAK,CAAE,IAAM,MAMrCjF,EAAImI,GAAmB,IAAI,WAAYlD,CAAI,EAAE,MAAO,GAG/C0D,GAAe3I,CAAE,CAE1B,CAGA,eAAsB2I,GAAgB1D,EAAkB,CAEtD,MAAM2D,EAAc,IAAI,YAIxB,GAAK,CAFaA,EAAY,OAAQ3D,EAAI,MAAO,EAAG,CAAE,CAAE,EAExC,WAAY,KAAM,EAEhC,OAIF,MAAM4D,EAAc,CAAA,EACpB,IAAIC,EACAnF,EAEJ,QAAU,EAAI,EAAG,EAAI,KAAM,IAAM,CAG/B,GADAA,EAAIsB,EAAK,CAAE,EACNtB,IAAM,GAAO,CAEhBmF,EAAa,EAAI,EACjB,KAEF,CACAD,EAAY,KAAMlF,CAAE,CAEtB,CAEA,GAAKmF,IAAe,OAAY,OAEhC,MAAMC,EAAYH,EAAY,OAAQ,IAAI,WAAYC,CAAY,CAAE,EAC9DG,EAAS,KAAK,MAAOD,CAAU,EAE/BtH,EAAQuH,EAAO,MACrB,IAAIC,EAAO,EAEX,UAAYtF,KAAKlC,EAEfwH,GAAQtF,EAIV,MAAMuF,EAAW,IAAI,SAAUjE,EAAI,OAAQA,EAAI,WAAa6D,CAAW,EACjEK,EAAcH,EAAO,SAAW,SAEtC,IAAII,EAAO,IAAI,aAEf,OAASJ,EAAO,SAAA,CAEhB,IAAK,UAAW,CAEdI,EAAO,IAAI,aAAcH,CAAK,EAC9B,QAAU,EAAI,EAAG,EAAIA,EAAM,IAEzBG,EAAM,CAAE,EAAIF,EAAS,WAAY,EAAI,EAAG,CAACC,CAAY,EAGvD,KAEF,CAAA,CAIA,OAAOpH,GAASqH,EAAM3H,CAAM,CAE9B,CCnHA,SAAS4H,GAAwBrH,EAA0B,CAEzD,MAAM7C,EAAI,KAAK,IAAK6C,EAAG,OAAQ,GAAI,EACnC,IAAIyG,EAAO,GAEX,QAAUpJ,EAAI,EAAGA,EAAIF,EAAGE,OAAc,OAAO,aAAc2C,EAAI3C,CAAE,CAAE,EACnE,MAAO,QAAQ,KAAMoJ,CAAK,CAE5B,CAMA,eAAea,GAAqBC,EAAoC,CAEtE,IAAI,EAEJ,GAAI,CAEF,EAAI,MAAM,MAAOA,EAAK,CACpB,YAAa,OACb,KAAM,OACN,MAAO,WACP,QAAS,CACP,OAAQ,MACR,kBAAmB,UAAA,CACrB,CACA,CAEJ,OAAU/E,EAAI,CAEZ,MAAMgF,EACJ,iDAAiD,KAAMD,CAAI,GAC3DA,EAAI,SAAU,OAAQ,EAClB3E,EAAMJ,aAAa,MAAQA,EAAE,QAAU,OAAQA,CAAE,EAEvD,MAAKgF,GAAS,iDAAiD,KAAM5E,CAAI,EAEjE,IAAI,MAAOA,CAAI,EAGjBJ,CAER,CACA,GAAK,CAAC,EAAE,GAEN,MAAM,IAAI,MAAO,QAAQ,EAAE,MAAM,IAAI,EAAE,UAAU,KAAK+E,CAAG,EAAG,EAG9D,MAAMtE,EAAM,MAAM,EAAE,YAAA,EACdjD,EAAK,IAAI,WAAYiD,CAAI,EAE/B,GAAKoE,GAAuBrH,CAAG,EAAI,CAEjC,MAAMyH,EAAU,IAAI,YAAa,QAAS,CAAE,MAAO,EAAA,CAAS,EAAE,OAC5DzH,EAAG,SAAU,EAAG,GAAI,CAAA,EAGtB,MAAM,IAAI,MACR,+CAA+CyH,EAAQ,MAAO,EAAG,GAAI,CAAC,EAAA,CAG1E,CACA,OAAOxE,CAET,CAGA,SAASyE,GAAuBC,EAAcC,EAA8B,CAE1E,MAAMC,EAASD,GAAc,KAAK,SAAS,OAE3C,OAAO,IAAI,IAAKD,EAAME,EAAS,GAAI,EAAE,IAEvC,CAMA,KAAK,UAAY,MAAQC,GAAsB,CAE7C,MAAMvI,EAAOuI,EAAG,KAmChB,GAAI,CAEF,GAAKvI,EAAK,OAAS,SAAW,CAE5B,KAAM,CAAE,MAAAE,EAAO,OAAAsI,EAAQ,UAAAC,CAAAA,EAAe,MAAMC,GAC1C1I,EAAK,IACLA,EAAK,UAAA,EAGP,KAAK,YACH,CAAE,KAAMA,EAAK,KAAM,MAAAE,EAAO,OAAAsI,EAAQ,gBAAiB,CAAA,EACnD,CAAE,SAAUC,CAAAA,CAAW,EAEzB,MAEF,CAEA,GAAKzI,EAAK,OAAS,aAAe,CAEhC,KAAM,CAAE,MAAAE,EAAO,OAAAsI,EAAQ,UAAAC,GAAeE,GACpC3I,EAAK,YACLA,EAAK,MACLA,EAAK,gBACLA,EAAK,GACLA,EAAK,GACLA,EAAK,EAAA,EAGP,KAAK,YACH,CACE,KAAMA,EAAK,KACX,MAAAE,EACA,OAAAsI,EACA,gBAAiBxI,EAAK,eAAA,EAExB,CAAE,SAAUyI,CAAAA,CAAW,EAEzB,MAEF,CAEA,GAAKzI,EAAK,OAAS,kBAAoB,CAErC,KAAM,CAAE,MAAAE,EAAO,MAAA0I,EAAO,UAAAH,GAAeI,GACnC7I,EAAK,YACLA,EAAK,MACLA,EAAK,gBACLA,EAAK,GACLA,EAAK,GACLA,EAAK,GACLA,EAAK,eAAA,EAGP,KAAK,YACH,CACE,KAAMA,EAAK,KACX,MAAAE,EACA,MAAA0I,EACA,gBAAiB5I,EAAK,eAAA,EAExB,CAAE,SAAUyI,CAAAA,CAAW,EAEzB,MAEF,CAEA,KAAM,CAAE,MAAAvI,EAAO,OAAAsI,EAAQ,UAAAC,CAAA,EAAe,MAAMK,GAC1C9I,EAAK,SACLA,EAAK,MACLA,EAAK,gBACLA,EAAK,GACLA,EAAK,GACLA,EAAK,GACLA,EAAK,UAAA,EAGP,KAAK,YACH,CACE,KAAMA,EAAK,KACX,MAAAE,EACA,OAAAsI,EACA,gBAAiBxI,EAAK,eAAA,EAExB,CAAE,SAAUyI,CAAA,CAAW,CAG3B,OAAUxF,EAAI,CAEZ,KAAK,YAAa,CAChB,KAAMjD,EAAK,KACX,MAAOiD,aAAa,MAAQA,EAAE,QAAU,OAAQA,CAAE,CAAA,CAClD,CAEJ,CAEF,EAGA,SAAS8F,GACPC,EACAC,EACA5C,EACA6C,EACAC,EACA,CAEA,MAAMjJ,EAA4B,CAAE,MAAO8I,EAAI,OAAQC,EAAI,MAAO5C,CAAA,EAC5DmC,EAA8B,CAAA,EAC9BC,EAA2B,CAAA,EAC3BW,EAAYJ,EAAKC,EAAK5C,EAE5B,QAAUgD,EAAI,EAAGA,EAAIH,EAAIG,IAAM,CAE7B,MAAMC,EAAS,IAAI,kBAAmBF,CAAU,EAChD,IAAIjJ,EAAS,EAEb,QAAUoJ,EAAI,EAAGA,EAAIlD,EAAIkD,IAEvB,QAAUC,EAAI,EAAGA,EAAIP,EAAIO,IAEvB,QAAUC,EAAI,EAAGA,EAAIT,EAAIS,IAEvBH,EAAQnJ,GAAS,EAAIgJ,EAAMM,EAAGD,EAAGD,EAAGF,CAAE,EAO5CZ,EAAU,KAAMa,EAAO,MAAO,EAC9Bd,EAAO,KAAMc,CAAO,CAEtB,CAEA,MAAO,CAAE,MAAApJ,EAAO,OAAAsI,EAAQ,UAAAC,CAAA,CAE1B,CAGA,SAASiB,GACPV,EACAC,EACA5C,EACA8C,EACA,CAEA,MAAMjJ,EAA4B,CAAE,MAAO8I,EAAI,OAAQC,EAAI,MAAO5C,CAAA,EAC5DuC,EAAQ,IAAI,kBAAmBI,EAAKC,EAAK5C,CAAG,EAC5CoC,EAAY,CAAEG,EAAM,MAAO,EAEjC,IAAIzI,EAAS,EAEb,QAAUoJ,EAAI,EAAGA,EAAIlD,EAAIkD,IAEvB,QAAUC,EAAI,EAAGA,EAAIP,EAAIO,IAEvB,QAAUC,EAAI,EAAGA,EAAIT,EAAIS,IAEvBb,EAAOzI,GAAS,EAAIgJ,EAAMM,EAAGD,EAAGD,CAAE,EAQxC,MAAO,CAAE,MAAArJ,EAAO,MAAA0I,EAAO,UAAAH,CAAA,CAEzB,CAGA,eAAsBC,GAAgBV,EAAaK,EAAsB,CAEvE,MAAMsB,EAAMxB,GAAsBH,EAAKK,CAAW,EAC5C3E,EAAM,IAAI,WAAY,MAAMqE,GAAoB4B,CAAI,CAAE,EACtDC,EAAM,MAAMzC,GAAwBzD,CAAI,EAE9C,GAAK,CAACkG,EAEJ,MAAM,IAAI,MAAO,2DAA4D,EAI/E,KAAM,CAAEZ,EAAIC,EAAI5C,EAAI6C,CAAG,EAAIU,EAAI,MAE/B,OAAOb,GAAmBC,EAAIC,EAAI5C,EAAI6C,EAAI,CAAEO,EAAGD,EAAGD,EAAG,IAAOK,EAAI,IAAKH,EAAGD,EAAGD,EAAG,CAAE,CAAE,CAEpF,CAOA,SAASZ,GACPkB,EACAC,EACAC,EACAf,EACAC,EACA5C,EACA,CAEA,MAAM3C,EAAMqD,GAA0B8C,CAAI,EAE1C,GAAKC,IAAUC,EAAkBf,EAAKC,EAAK5C,EAEzC,MAAM,IAAI,MACR,gBAAgByD,CAAK,wBACnBC,EAAkBf,EAAKC,EAAK5C,CAC9B,EAAA,EAIJ,MAAM2D,EAAQ,IAAI,cAAc,OAAQtG,EAAI,SAAU,EAAG,CAAE,CAAE,EAE7D,GAAK,CAACsG,EAAM,WAAY,OAAQ,EAE9B,MAAM,IAAI,MAAO,oBAAoB,KAAK,UAAWA,CAAM,CAAC,EAAG,EAIjE,MAAMC,EAAO,EAAIH,EAAQ,EAEzB,GAAKpG,EAAI,aAAeuG,EAEtB,MAAM,IAAI,MACR,6BAA6BA,CAAI,eAAevG,EAAI,UAAU,EAAA,EAKlE,MAAMxD,EAA4B,CAAE,MAAO8I,EAAI,OAAQC,EAAI,MAAO5C,CAAA,EAC5D+C,EAAYJ,EAAKC,EAAK5C,EACtBmC,EAAS,MAAM,KACnB,CAAE,OAAQuB,CAAA,EACV,IAAM,IAAI,kBAAmBX,CAAU,CAAA,EAEnCX,EAAYD,EAAO,IAAKI,GAASA,EAAM,MAAO,EAC9CjB,EAAW,IAAI,SAAUjE,EAAI,OAAQA,EAAI,WAAYA,EAAI,UAAW,EAE1E,QAAU+F,EAAI,EAAGA,EAAIT,EAAIS,IAEvB,QAAUD,EAAI,EAAGA,EAAIP,EAAIO,IAEvB,QAAUD,EAAI,EAAGA,EAAIlD,EAAIkD,IAAM,CAE7B,MAAMW,EAAeX,EAAIlD,GAAOmD,EAAIP,EAAKQ,GACnCU,EAAcV,EAAIT,GAAOQ,EAAIP,EAAKM,GAClCa,EAAY,EAAIL,EAAkBG,EAAe,EAEvD,QAAUG,EAAK,EAAGA,EAAKN,EAAiBM,IAEtC7B,EAAQ6B,CAAG,EAAGF,CAAY,EAAIxC,EAAS,WAAYyC,EAAYC,EAAK,EAAG,EAAM,CAIjF,CAMJ,MAAO,CAAE,MAAAnK,EAAO,OAAAsI,EAAQ,UAAAC,CAAA,CAE1B,CAGA,SAASI,GACPgB,EACAC,EACAC,EACAf,EACAC,EACA5C,EACAiE,EACA,CAEA,MAAM5G,EAAMqD,GAA0B8C,CAAI,EAE1C,GAAKC,IAAUC,EAAkBf,EAAKC,EAAK5C,EAEzC,MAAM,IAAI,MACR,gBAAgByD,CAAK,wBACnBC,EAAkBf,EAAKC,EAAK5C,CAC9B,EAAA,EAIJ,GAAKiE,EAAkB,GAAKA,GAAmBP,EAE7C,MAAM,IAAI,MACR,0BAA0BO,CAAe,eAAeP,CAAe,GAAA,EAK3E,MAAMC,EAAQ,IAAI,cAAc,OAAQtG,EAAI,SAAU,EAAG,CAAE,CAAE,EAE7D,GAAK,CAACsG,EAAM,WAAY,OAAQ,EAE9B,MAAM,IAAI,MAAO,oBAAoB,KAAK,UAAWA,CAAM,CAAC,EAAG,EAIjE,MAAMC,EAAO,EAAIH,EAAQ,EAEzB,GAAKpG,EAAI,aAAeuG,EAEtB,MAAM,IAAI,MACR,6BAA6BA,CAAI,eAAevG,EAAI,UAAU,EAAA,EAKlE,MAAMiE,EAAW,IAAI,SAAUjE,EAAI,OAAQA,EAAI,WAAYA,EAAI,UAAW,EACpEwG,EAAe,CAAET,EAAWD,EAAWD,IAC3CA,EAAIlD,GAAOmD,EAAIP,EAAKQ,GAEtB,OAAOC,GAAkBV,EAAIC,EAAI5C,EAAI,CAAEoD,EAAGD,EAAGD,IAAO,CAElD,MAAMgB,EAAQD,EAAkBP,EAAkBG,EAAcT,EAAGD,EAAGD,CAAE,EAExE,OAAO5B,EAAS,WAAY,EAAI4C,EAAQ,EAAG,EAAM,CAEnD,CAAE,CAEJ,CAGA,eAAsBzB,GACpB0B,EACAV,EACAC,EACAf,EACAC,EACA5C,EACAgC,EACA,CAEA,MAAMsB,EAAMxB,GAAsBqC,EAAUnC,CAAW,EACjDwB,EAAM,MAAM9B,GAAoB4B,CAAI,EAE1C,OAAOhB,GACLkB,EACAC,EACAC,EACAf,EACAC,EACA5C,CAAA,CAGJ","x_google_ignoreList":[0,1,2,3]}
package/dist/index.esm.js.map DELETED
@@ -1 +0,0 @@
1
- {"version":3,"file":"index.esm.js","sources":["../src/utils/fds-utils.ts","../src/class/FdsMesh.ts","../src/shaders/VolumePointsShader.ts","../src/class/VolumePoints.ts","../src/utils/fds-cache.utils.ts","../src/utils/fds-mesh.utils.ts","../../../../node_modules/.pnpm/fflate@0.8.2/node_modules/fflate/esm/browser.js","../src/utils/zip.ts","../src/utils/load-fds.ts","../src/manager/FdsManager.ts"],"sourcesContent":["import { Matrix4, Vector3, } from 'three'\n\nexport const fdsSpaceMatrix = new Matrix4()\nfdsSpaceMatrix.makeBasis(\n new Vector3( 1, 0, 0 ),\n new Vector3( 0, 0, -1 ),\n new Vector3( 0, 1, 0 )\n)\n\nexport const threeToFdsSpaceMatrix = fdsSpaceMatrix.clone().invert()\n","import { Box3, Vector3, } from 'three'\n\nimport { fdsSpaceMatrix, threeToFdsSpaceMatrix, } from '../utils/fds-utils'\n\nexport interface IVector3 {\n x: number\n y: number\n z: number\n}\n\nexport interface Xb {\n minX: number\n minY: number\n minZ: number\n maxX: number\n maxY: number\n maxZ: number\n}\n\nexport type SpaceType = 'fds' | 'threejs'\n\nclass FdsMesh {\n\n ijk: Vector3\n xb: Box3\n origin: Vector3\n size: Vector3\n cellSize: Vector3\n\n constructor ( ijk: IVector3, xb: Xb ) {\n\n this.ijk = new Vector3( ijk.x, ijk.y, ijk.z )\n\n this.xb = new Box3(\n new Vector3( xb.minX, xb.minY, xb.minZ ),\n new Vector3( xb.maxX, xb.maxY, xb.maxZ )\n )\n\n this.origin = this.xb.min.clone()\n this.size = this.xb.getSize( new Vector3() )\n\n this.cellSize = new Vector3(\n this.size.x / this.ijk.x,\n this.size.y / this.ijk.y,\n this.size.z / this.ijk.z\n )\n \n }\n\n getPositionByCell ( cell: IVector3, outputSpace: SpaceType = 'threejs' ) {\n\n const cellVector = new Vector3( cell.x, cell.y, cell.z )\n const position = cellVector.multiply( this.cellSize ).add( this.origin )\n\n if ( outputSpace === 'threejs' ) {\n\n position.applyMatrix4( fdsSpaceMatrix )\n \n }\n\n return position\n \n }\n\n getCellByPosition ( position: IVector3, inputSpace: SpaceType = 'threejs' ) {\n\n const positionVector = new Vector3( position.x, position.y, position.z )\n\n if ( inputSpace === 'threejs' ) {\n\n positionVector.applyMatrix4( threeToFdsSpaceMatrix )\n \n }\n\n const cell = positionVector.sub( this.origin ).divide( this.cellSize ).round()\n\n return cell\n \n }\n\n}\n\nexport { FdsMesh, }\n","export const vertexShader = /* glsl */ `\n #include <common>\n #include <logdepthbuf_pars_vertex>\n\n uniform vec3 cameraPos;\n\n out vec3 vOrigin;\n out vec3 vDirection;\n\n void main() {\n vec4 mvPosition = modelViewMatrix * vec4( position, 1.0 );\n\n vOrigin = vec3( inverse( modelMatrix ) * vec4( cameraPos, 1.0 ) ).xyz;\n vDirection = position - vOrigin;\n\n gl_Position = projectionMatrix * mvPosition;\n\n #include <logdepthbuf_vertex>\n }\n`\n\nexport const fragmentShader = /* glsl */ `\n precision highp float;\n precision highp sampler3D;\n\n #include <common>\n #include <logdepthbuf_pars_fragment>\n\n in vec3 vOrigin;\n in vec3 vDirection;\n\n vec4 color;\n\n uniform sampler3D map;\n uniform sampler2D lutMap;\n uniform float isSoot;\n uniform float threshold;\n uniform float steps;\n\n vec2 hitBox( vec3 orig, vec3 dir ) {\n const vec3 box_min = vec3( - 0.5 );\n const vec3 box_max = vec3( 0.5 );\n vec3 inv_dir = 1.0 / dir;\n vec3 tmin_tmp = ( box_min - orig ) * inv_dir;\n vec3 tmax_tmp = ( box_max - orig ) * inv_dir;\n vec3 tmin = min( tmin_tmp, tmax_tmp );\n vec3 tmax = max( tmin_tmp, tmax_tmp );\n float t0 = max( tmin.x, max( tmin.y, tmin.z ) );\n float t1 = min( tmax.x, min( tmax.y, tmax.z ) );\n return vec2( t0, t1 );\n }\n\n vec4 sample2( vec3 p ) {\n float v = texture( map, p ).r;\n v = v > 0.5 ? 1.0 : v;\n vec4 lutColor = texture( lutMap, vec2( 0.5, v ) );\n\n if(isSoot == 1.0) lutColor.a = v;\n if(isSoot == 0.0) lutColor.a = v > 0.01 ? 1.0 : 0.0;\n\n return lutColor;\n }\n\n vec4 BlendUnder(vec4 color, vec4 newColor)\n {\n color.rgb += (1.0 - color.a) * newColor.a * newColor.rgb;\n color.a += (1.0 - color.a) * newColor.a;\n return color;\n }\n\n void main(){\n vec3 rayDir = normalize( vDirection );\n vec2 bounds = hitBox( vOrigin, rayDir );\n\n if ( bounds.x > bounds.y ) discard;\n\n bounds.x = max( bounds.x, 0.0 );\n\n vec3 p = vOrigin + bounds.x * rayDir;\n vec3 inc = 1.0 / abs( rayDir );\n float delta = min( inc.x, min( inc.y, inc.z ) );\n delta /= steps;\n\n for ( float t = bounds.x; t < bounds.y; t += delta ) {\n vec4 samplerColor = sample2( p + 0.5 );\n samplerColor.a *= .06;\n color = BlendUnder(color, samplerColor);\n\n p += rayDir * delta;\n }\n\n if ( color.a == 0.0 ) discard;\n\n gl_FragColor = color;\n\n #include <logdepthbuf_fragment>\n }\n`\n","import {\n BackSide,\n BoxGeometry,\n CanvasTexture,\n Data3DTexture,\n LinearFilter,\n Mesh,\n RedFormat,\n ShaderMaterial,\n UnsignedByteType,\n Vector3,\n} from 'three'\nimport { Lut, } from 'three/examples/jsm/math/Lut.js'\n\nimport { fragmentShader, vertexShader, } from '../shaders/VolumePointsShader'\n\ntype TVolumePointsShape = {\n width: number\n height: number\n depth: number\n}\n\nconst volumeLut = new Lut()\n\nvolumeLut.addColorMap( 'soot', [\n [ 0, 0x444444 ],\n [ 0.2, 0x333333 ],\n [ 0.4, 0x222222 ],\n [ 0.8, 0x111111 ],\n [ 1.0, 0x000000 ]\n] )\nvolumeLut.setColorMap( 'soot', 256 )\nexport const sootCanvasTexture = new CanvasTexture( volumeLut.createCanvas() )\n\nvolumeLut.setColorMap( 'rainbow', 256 )\nexport const rainbowCanvasTexture = new CanvasTexture( volumeLut.createCanvas() )\n\nclass VolumePoints extends Mesh<BoxGeometry, ShaderMaterial> {\n\n texture: Data3DTexture\n\n constructor ( props: TVolumePointsShape ) {\n\n super()\n\n const texture = new Data3DTexture(\n null,\n props.width,\n props.height,\n props.depth\n )\n\n texture.format = RedFormat\n texture.type = UnsignedByteType\n texture.minFilter = LinearFilter\n texture.magFilter = LinearFilter\n texture.unpackAlignment = 1\n texture.needsUpdate = true\n\n this.texture = texture\n\n const material = new ShaderMaterial( {\n uniforms: {\n map: { value: texture, },\n lutMap: { value: sootCanvasTexture, },\n isSoot: { value: 1.0, },\n cameraPos: { value: new Vector3(), },\n steps: { value: 100, },\n threshold: { value: 0.0, },\n },\n vertexShader,\n fragmentShader,\n side: BackSide,\n transparent: true,\n depthTest: false,\n } )\n\n this.material = material\n\n const geometry = new BoxGeometry( 1, 1, 1 )\n\n this.geometry = geometry\n\n this.renderOrder = 1\n \n }\n\n updateData ( data: Uint8ClampedArray ) {\n\n const { image, } = this.texture\n\n if ( image.data ) {\n\n ( image.data as Uint8ClampedArray ).set( data )\n \n } else {\n\n ( image as { data: Uint8ClampedArray } ).data = data\n \n }\n this.texture.needsUpdate = true\n \n }\n\n updateCamera ( cameraPos: Vector3 ) {\n\n this.material.uniforms.cameraPos.value.copy( cameraPos )\n \n }\n\n dispose () {\n\n this.texture.dispose()\n this.material.dispose()\n this.geometry.dispose()\n \n }\n\n}\n\nexport { VolumePoints, }\n","import { MathUtils, } from 'three'\n\nimport ReadSimulateWorker from './read-simulate.worker?worker&inline'\nimport type {\n TSimulatesManifest,\n TSliceData,\n TVolumePointsShape,\n} from './fds.types'\n\n/** 导出数据缺少时长信息时使用的兜底参考值。 */\nconst FDS_REF_DURATION_SEC = 4.07\nconst FDS_REF_TOTAL_FRAMES = 282\n/** 播放时预取的前瞻秒数。 */\nconst PLAYBACK_CHUNK_LOOKAHEAD_SEC = 1\n\n/** 统一路径格式，避免 zip 内路径和运行时路径分隔符不一致。 */\nfunction normalizeFdsPath ( path: string ) {\n\n return path.replaceAll( '\\\\', '/' ).replace( /^\\.?\\//, '' )\n\n}\n\n/** 清单通常已按顺序导出，这里再做一次防御性排序。 */\nfunction sortedSimulateItems ( manifest: TSimulatesManifest ) {\n\n return [ ...manifest.items ].sort( ( a, b ) => a.seq - b.seq )\n\n}\n\n/** 根据全局帧索引定位它所在的数据分片。 */\nfunction findItemForGlobalFrame (\n manifest: TSimulatesManifest,\n globalFrameIndex: number\n) {\n\n const totalFrames = manifest.headers.shape[ 3 ]\n\n if (\n globalFrameIndex < 0 ||\n globalFrameIndex >= totalFrames ||\n !Number.isInteger( globalFrameIndex )\n ) {\n\n throw new Error(\n `globalFrameIndex ${globalFrameIndex} out of [0, ${totalFrames})`\n )\n\n }\n\n const items = sortedSimulateItems( manifest )\n let chunkStartFrame = 0\n\n for ( const item of items ) {\n\n if ( globalFrameIndex < chunkStartFrame + item.frames ) {\n\n return { item, chunkStartFrame, }\n\n }\n\n chunkStartFrame += item.frames\n\n }\n\n throw new Error( `no chunk for globalFrameIndex ${globalFrameIndex}` )\n\n}\n\n/** 判断一个分片的所有帧是否都已经进入内存缓存。 */\nfunction isChunkFramesLoaded (\n frames: ( Uint8ClampedArray | undefined )[],\n chunkStartFrame: number,\n chunkFrameCount: number\n) {\n\n for ( let i = 0; i < chunkFrameCount; i++ ) {\n\n if ( frames[ chunkStartFrame + i ] === undefined ) return false\n\n }\n\n return true\n\n}\n\n/** 找出和目标帧区间有交集的所有分片起始帧。 */\nfunction chunkStartFramesOverlappingFrameRange (\n manifest: TSimulatesManifest,\n fMin: number,\n fMax: number\n) {\n\n const totalFrames = manifest.headers.shape[ 3 ]\n\n if ( totalFrames <= 0 ) return []\n\n const start = Math.max( 0, Math.min( Math.min( fMin, fMax ), totalFrames - 1 ) )\n const end = Math.max( 0, Math.min( Math.max( fMin, fMax ), totalFrames - 1 ) )\n const chunkStarts: number[] = []\n const items = sortedSimulateItems( manifest )\n let offset = 0\n\n for ( const item of items ) {\n\n const chunkLastFrame = offset + item.frames - 1\n\n if ( end >= offset && start <= chunkLastFrame ) {\n\n chunkStarts.push( offset )\n\n }\n\n offset += item.frames\n\n }\n\n return chunkStarts\n\n}\n\n/**\n * 优先返回目标帧；如果该帧尚未解码，就退而求其次取最近的已解码帧。\n * 这样时间轴可以继续推进，不必硬等精确帧解码完成。\n */\nfunction findBestRenderableFrame (\n frames: ( Uint8ClampedArray | undefined )[],\n preferredFrameIndex: number\n) {\n\n const clampedFrameIndex = Math.min(\n Math.max( preferredFrameIndex, 0 ),\n Math.max( 0, frames.length - 1 )\n )\n\n for ( let i = clampedFrameIndex; i >= 0; i-- ) {\n\n if ( frames[ i ] !== undefined ) return i\n\n }\n\n for ( let i = clampedFrameIndex + 1; i < frames.length; i++ ) {\n\n if ( frames[ i ] !== undefined ) return i\n\n }\n\n return -1\n\n}\n\n/** slice 元数据可能无序，使用前先按帧序号整理。 */\nfunction getSortedSliceFrames ( slice: TSliceData ) {\n\n return [ ...( slice.frames ?? [] ) ]\n .sort( ( a, b ) => a.seq - b.seq )\n\n}\n\n/** 推断整段模拟时长，优先使用导出时携带的真实秒数。 */\nfunction inferSimulationDurationSec (\n manifest: TSimulatesManifest,\n slice: TSliceData,\n totalFrames: number,\n preferredDurationSec?: number\n) {\n\n if (\n typeof preferredDurationSec === 'number' &&\n preferredDurationSec > 0 &&\n Number.isFinite( preferredDurationSec )\n ) {\n\n return preferredDurationSec\n\n }\n\n const fromJson = manifest.simulationDurationSec\n\n if (\n typeof fromJson === 'number' &&\n fromJson > 0 &&\n Number.isFinite( fromJson )\n ) {\n\n return fromJson\n\n }\n\n if ( totalFrames <= 1 ) return 0\n\n const sliceFrames = getSortedSliceFrames( slice )\n const lastSliceFrame = sliceFrames[ sliceFrames.length - 1 ]\n\n if (\n lastSliceFrame &&\n typeof lastSliceFrame.time === 'number' &&\n lastSliceFrame.time > 0 &&\n Number.isFinite( lastSliceFrame.time )\n ) {\n\n return lastSliceFrame.time\n\n }\n\n return (\n ( ( totalFrames - 1 ) * FDS_REF_DURATION_SEC ) /\n Math.max( 1, FDS_REF_TOTAL_FRAMES - 1 )\n )\n\n}\n\n/** 把外部传入的帧索引收敛到合法范围内。 */\nfunction clampFrameIndex ( frameIndex: number, totalFrames: number ) {\n\n return Math.min(\n Math.max( Number.isFinite( frameIndex ) ? Math.floor( frameIndex ) : 0, 0 ),\n Math.max( 0, totalFrames - 1 )\n )\n\n}\n\n/** 把帧索引换算成物理秒数。 */\nfunction frameIndexToTime (\n frameIndex: number,\n maxTime: number,\n totalFrames: number,\n slice?: TSliceData\n) {\n\n if ( totalFrames <= 1 ) return 0\n\n const normalizedFrameIndex = clampFrameIndex( frameIndex, totalFrames )\n const sliceFrame = getSortedSliceFrames( slice ?? {} )\n .find( item => item.seq === normalizedFrameIndex )\n\n if (\n sliceFrame &&\n typeof sliceFrame.time === 'number' &&\n sliceFrame.time >= 0 &&\n Number.isFinite( sliceFrame.time )\n ) {\n\n return sliceFrame.time\n\n }\n\n return MathUtils.mapLinear( normalizedFrameIndex, 0, totalFrames - 1, 0, maxTime )\n\n}\n\n/** 把物理秒数换算成最接近的帧索引。 */\nfunction timeToFrameIndex (\n timeSec: number,\n maxTime: number,\n totalFrames: number,\n slice?: TSliceData\n) {\n\n if ( totalFrames <= 1 ) return 0\n\n const clampedTime = Math.min(\n Math.max( Number.isFinite( timeSec ) ? timeSec : 0, 0 ),\n Math.max( 0, maxTime )\n )\n const sliceFrames = getSortedSliceFrames( slice ?? {} )\n\n if ( sliceFrames.length ) {\n\n let nearestFrameIndex = clampFrameIndex( sliceFrames[ 0 ].seq, totalFrames )\n let nearestDistance = Math.abs( ( sliceFrames[ 0 ].time ?? 0 ) - clampedTime )\n\n for ( const sliceFrame of sliceFrames ) {\n\n if (\n typeof sliceFrame.time !== 'number' ||\n !Number.isFinite( sliceFrame.time )\n ) continue\n\n const distance = Math.abs( sliceFrame.time - clampedTime )\n\n if ( distance <= nearestDistance ) {\n\n nearestDistance = distance\n nearestFrameIndex = clampFrameIndex( sliceFrame.seq, totalFrames )\n\n }\n\n if ( sliceFrame.time > clampedTime && distance > nearestDistance ) break\n\n }\n\n return nearestFrameIndex\n\n }\n\n return Math.min(\n Math.max( Math.floor( MathUtils.mapLinear( clampedTime, 0, maxTime, 0, totalFrames - 1 ) ), 0 ),\n totalFrames - 1\n )\n\n}\n\n/** 保证传给 worker 的是可安全转移所有权的独立 ArrayBuffer。 */\nfunction toTransferableArrayBuffer ( bytes: Uint8Array ) {\n\n if (\n bytes.buffer instanceof ArrayBuffer &&\n bytes.byteOffset === 0 &&\n bytes.byteLength === bytes.buffer.byteLength\n ) {\n\n return bytes.buffer\n\n }\n\n const buffer = new ArrayBuffer( bytes.byteLength )\n\n new Uint8Array( buffer ).set( bytes )\n\n return buffer\n\n}\n\n/**\n * 对解码 worker 做一层包装，把消息分发、Promise 生命周期和销毁逻辑\n * 集中在这里，主加载流程只关心“请求一个分片并拿到帧数组”。\n */\nfunction createChunkFramesReader (\n shape: TVolumePointsShape\n) {\n\n const worker = new ReadSimulateWorker()\n const pending = new Map<string, {\n resolve: ( data: { frames: Uint8ClampedArray[]; startFrameIndex: number } ) => void\n reject: ( error: Error ) => void\n }>()\n let disposed = false\n\n const rejectAll = ( error: Error ) => {\n\n pending.forEach( item => item.reject( error ) )\n pending.clear()\n\n }\n\n const onMessage = ( event: MessageEvent ) => {\n\n const data = event.data as {\n uuid?: string\n error?: string\n startFrameIndex?: number\n frames?: Uint8ClampedArray[]\n }\n\n if ( !data.uuid ) return\n\n const current = pending.get( data.uuid )\n\n if ( !current ) return\n\n pending.delete( data.uuid )\n\n if ( data.error ) {\n\n current.reject( new Error( data.error ) )\n return\n\n }\n\n if ( !data.frames || data.startFrameIndex === undefined ) {\n\n current.reject( new Error( 'fds worker: invalid response' ) )\n return\n\n }\n\n current.resolve( {\n frames: data.frames,\n startFrameIndex: data.startFrameIndex,\n } )\n\n }\n\n const onError = ( event: ErrorEvent ) => {\n\n rejectAll(\n event.error instanceof Error ?\n event.error :\n new Error(\n [\n event.message || 'fds worker: unknown error',\n event.filename,\n event.lineno,\n event.colno\n ].filter( Boolean ).join( ' @ ' )\n )\n )\n\n }\n\n const onMessageError = () => {\n\n rejectAll( new Error( 'fds worker: messageerror' ) )\n\n }\n\n worker.addEventListener( 'message', onMessage )\n worker.addEventListener( 'error', onError )\n worker.addEventListener( 'messageerror', onMessageError )\n\n return {\n /** 解码已经从 zip 中读出的分片字节。 */\n readChunk (\n arrayBuffer: ArrayBuffer,\n item: TSimulatesManifest[ 'items' ][ number ],\n startFrameIndex: number\n ) {\n\n if ( disposed ) {\n\n return Promise.reject( new Error( 'fds worker: disposed' ) )\n\n }\n\n return new Promise<{\n frames: Uint8ClampedArray[]\n startFrameIndex: number\n }>( ( resolve, reject ) => {\n\n const uuid = MathUtils.generateUUID()\n\n pending.set( uuid, { resolve, reject, } )\n\n worker.postMessage(\n {\n uuid,\n mode: 'chunkBytes',\n arrayBuffer,\n grids: item.grids,\n chunkFrameCount: item.frames,\n xs: shape.width,\n ys: shape.height,\n zs: shape.depth,\n startFrameIndex,\n },\n [ arrayBuffer ]\n )\n\n } )\n\n },\n /** 终止 worker，并让所有挂起请求立刻失败。 */\n dispose () {\n\n if ( disposed ) return\n\n disposed = true\n rejectAll( new Error( 'fds worker: disposed' ) )\n worker.removeEventListener( 'message', onMessage )\n worker.removeEventListener( 'error', onError )\n worker.removeEventListener( 'messageerror', onMessageError )\n worker.terminate()\n\n },\n }\n\n}\n\nexport {\n PLAYBACK_CHUNK_LOOKAHEAD_SEC,\n chunkStartFramesOverlappingFrameRange,\n clampFrameIndex,\n createChunkFramesReader,\n findBestRenderableFrame,\n findItemForGlobalFrame,\n frameIndexToTime,\n inferSimulationDurationSec,\n isChunkFramesLoaded,\n normalizeFdsPath,\n timeToFrameIndex,\n toTransferableArrayBuffer,\n}\n","import SoonSpace from 'soonspacejs'\nimport {\n Box3,\n Object3D,\n Vector3,\n} from 'three'\n\nimport { FdsMesh, } from '../class/FdsMesh'\nimport { threeToFdsSpaceMatrix, } from './fds-utils'\n\nimport type { TVolumePointsShape, } from './fds.types'\n\n/**\n * 统计场景里可见、可渲染对象的包围盒。\n * 已经存在的 FDS 对象会被跳过，避免重复加载时把旧体渲染结果算进去。\n */\nfunction getRenderableSceneBox (\n ssp: SoonSpace,\n root: Object3D = ssp.viewport.scene\n) {\n\n const box = new Box3()\n const objectBox = new Box3()\n const scene = ssp.viewport.scene\n\n root.updateWorldMatrix( true, true )\n root.traverseVisible( ( object: Object3D ) => {\n\n if ( root === scene && object === scene ) return\n\n let current: Object3D | null = object\n\n while ( current ) {\n\n if ( current.userData?.renderType === 'FDS' ) return\n current = current.parent\n\n }\n\n const renderable = object as Object3D & {\n isMesh?: boolean\n isPoints?: boolean\n isLine?: boolean\n }\n\n if ( !renderable.isMesh && !renderable.isPoints && !renderable.isLine ) return\n\n objectBox.makeEmpty()\n objectBox.setFromObject( object )\n\n if ( !objectBox.isEmpty() ) {\n\n box.union( objectBox )\n\n }\n\n } )\n\n return box\n\n}\n\n/**\n * 根据场景包围盒创建 FDS 网格。\n * 如果场景里暂时没有可用几何，则退回到一个以原点为中心的默认盒子。\n */\nfunction createFdsMeshBySceneBox (\n ssp: SoonSpace,\n shape: TVolumePointsShape,\n root: Object3D = ssp.viewport.scene\n) {\n\n const scene = ssp.viewport.scene\n const sceneBox = getRenderableSceneBox( ssp, root )\n const useRootOriginAsCenter = root !== scene\n const anchorWorldCenter = new Vector3()\n\n root.updateWorldMatrix( true, true )\n\n if ( useRootOriginAsCenter ) {\n\n root.getWorldPosition( anchorWorldCenter )\n\n }\n\n // 缺少真实 meshXb 时，退回为：\n // 1. 位置跟随挂载节点（或场景中心/原点）；\n // 2. 尺寸直接采用 shape 的 x/y/z 体素尺寸。\n // 这样至少不会把体渲染盒子错误拟合成整栋楼/整场景的包围盒。\n const worldCenter = useRootOriginAsCenter ?\n anchorWorldCenter.clone() :\n (\n sceneBox.isEmpty() ?\n new Vector3() :\n sceneBox.getCenter( new Vector3() )\n )\n const fdsSize = new Vector3(\n shape.width,\n shape.height,\n shape.depth\n )\n const fdsCenter = worldCenter.applyMatrix4( threeToFdsSpaceMatrix )\n const half = fdsSize.clone().multiplyScalar( 0.5 )\n\n return new FdsMesh(\n { x: shape.width, y: shape.height, z: shape.depth, },\n {\n minX: fdsCenter.x - half.x,\n minY: fdsCenter.y - half.y,\n minZ: fdsCenter.z - half.z,\n maxX: fdsCenter.x + half.x,\n maxY: fdsCenter.y + half.y,\n maxZ: fdsCenter.z + half.z,\n }\n )\n\n}\n\nexport {\n createFdsMeshBySceneBox,\n getRenderableSceneBox,\n}\n","// 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","import { inflateSync, } from 'fflate'\n\n/** zip 中单个文件条目的索引信息。 */\ntype TZipEntry = {\n name: string\n compressionMethod: number\n compressedSize: number\n localHeaderOffset: number\n}\n\nconst textDecoder = new TextDecoder()\n\n/** 统一 zip 内部路径格式，避免分隔符差异导致查找失败。 */\nfunction normalizeEntryName ( name: string ) {\n\n return name.replaceAll( '\\\\', '/' ).replace( /^\\.?\\//, '' )\n\n}\n\n/** 读取 zip 结构里的 little-endian uint16。 */\nfunction readUint16 ( view: DataView, offset: number ) {\n\n return view.getUint16( offset, true )\n\n}\n\n/** 读取 zip 结构里的 little-endian uint32。 */\nfunction readUint32 ( view: DataView, offset: number ) {\n\n return view.getUint32( offset, true )\n\n}\n\n/** 从 zip 末尾向前查找中央目录结束记录。 */\nfunction findEndOfCentralDirectoryOffset ( bytes: Uint8Array ) {\n\n const minOffset = Math.max( 0, bytes.length - 0xffff - 22 )\n\n for ( let offset = bytes.length - 22; offset >= minOffset; offset-- ) {\n\n if (\n bytes[ offset ] === 0x50 &&\n bytes[ offset + 1 ] === 0x4b &&\n bytes[ offset + 2 ] === 0x05 &&\n bytes[ offset + 3 ] === 0x06\n ) {\n\n return offset\n\n }\n\n }\n\n throw new Error( 'zip: end of central directory not found' )\n\n}\n\n/** 轻量 zip 读取器，只实现当前 FDS 压缩包所需的读取能力。 */\nclass ZipArchive {\n\n #bytes: Uint8Array\n\n #view: DataView\n\n #entries = new Map<string, TZipEntry>()\n\n constructor ( bytes: ArrayBuffer | Uint8Array ) {\n\n this.#bytes = bytes instanceof Uint8Array ? bytes : new Uint8Array( bytes )\n this.#view = new DataView(\n this.#bytes.buffer,\n this.#bytes.byteOffset,\n this.#bytes.byteLength\n )\n\n this.#readEntries()\n\n }\n\n /** 判断指定文件是否存在于 zip 包中。 */\n has ( name: string ) {\n\n return this.#entries.has( normalizeEntryName( name ) )\n\n }\n\n /** 读取并按压缩方式解出指定文件的原始字节。 */\n read ( name: string ) {\n\n const entryName = normalizeEntryName( name )\n const entry = this.#entries.get( entryName )\n\n if ( !entry ) {\n\n throw new Error( `zip: entry not found: ${entryName}` )\n\n }\n\n const localOffset = entry.localHeaderOffset\n const signature = readUint32( this.#view, localOffset )\n\n if ( signature !== 0x04034b50 ) {\n\n throw new Error( `zip: invalid local header for ${entryName}` )\n\n }\n\n const fileNameLength = readUint16( this.#view, localOffset + 26 )\n const extraFieldLength = readUint16( this.#view, localOffset + 28 )\n const dataStart = localOffset + 30 + fileNameLength + extraFieldLength\n const dataEnd = dataStart + entry.compressedSize\n const compressedData = this.#bytes.slice( dataStart, dataEnd )\n\n if ( entry.compressionMethod === 0 ) {\n\n return compressedData\n\n }\n\n if ( entry.compressionMethod === 8 ) {\n\n return inflateSync( compressedData )\n\n }\n\n throw new Error(\n `zip: unsupported compression method ${entry.compressionMethod} for ${entryName}`\n )\n\n }\n\n /** 读取文本文件。 */\n readText ( name: string ) {\n\n return textDecoder.decode( this.read( name ) )\n\n }\n\n /** 读取 JSON 文件并直接反序列化。 */\n readJson<T> ( name: string ) {\n\n return JSON.parse( this.readText( name ) ) as T\n\n }\n\n /** 扫描中央目录并建立文件名到条目的索引。 */\n #readEntries () {\n\n const endOffset = findEndOfCentralDirectoryOffset( this.#bytes )\n const totalEntries = readUint16( this.#view, endOffset + 10 )\n const centralDirectoryOffset = readUint32( this.#view, endOffset + 16 )\n\n let offset = centralDirectoryOffset\n\n for ( let index = 0; index < totalEntries; index++ ) {\n\n const signature = readUint32( this.#view, offset )\n\n if ( signature !== 0x02014b50 ) {\n\n throw new Error( 'zip: invalid central directory entry' )\n\n }\n\n const compressionMethod = readUint16( this.#view, offset + 10 )\n const compressedSize = readUint32( this.#view, offset + 20 )\n const fileNameLength = readUint16( this.#view, offset + 28 )\n const extraFieldLength = readUint16( this.#view, offset + 30 )\n const commentLength = readUint16( this.#view, offset + 32 )\n const localHeaderOffset = readUint32( this.#view, offset + 42 )\n const fileNameStart = offset + 46\n const fileNameEnd = fileNameStart + fileNameLength\n const name = normalizeEntryName(\n textDecoder.decode( this.#bytes.slice( fileNameStart, fileNameEnd ) )\n )\n\n this.#entries.set( name, {\n name,\n compressionMethod,\n compressedSize,\n localHeaderOffset,\n } )\n\n offset = fileNameEnd + extraFieldLength + commentLength\n\n }\n\n }\n\n}\n\nexport {\n ZipArchive,\n}\n","import SoonSpace from 'soonspacejs'\nimport {\n Object3D,\n Vector3,\n} from 'three'\n\nimport {\n rainbowCanvasTexture,\n sootCanvasTexture,\n VolumePoints,\n} from '../class/VolumePoints'\nimport { FdsMesh, } from '../class/FdsMesh'\nimport { fdsSpaceMatrix, } from './fds-utils'\n\nimport {\n PLAYBACK_CHUNK_LOOKAHEAD_SEC,\n clampFrameIndex,\n createChunkFramesReader,\n findBestRenderableFrame,\n findItemForGlobalFrame,\n frameIndexToTime,\n inferSimulationDurationSec,\n isChunkFramesLoaded,\n normalizeFdsPath,\n timeToFrameIndex,\n toTransferableArrayBuffer,\n chunkStartFramesOverlappingFrameRange,\n} from './fds-cache.utils'\nimport { createFdsMeshBySceneBox, } from './fds-mesh.utils'\nimport type {\n TFdsLoadOptions,\n TSimulatesManifest,\n TSliceData,\n TVolumePointsShape,\n} from './fds.types'\nimport { ZipArchive, } from './zip'\n\n/**\n * 加载 FDS 压缩包，按需解码分片数据，并挂载成 `VolumePoints`。\n * 对外暴露的是“按秒播放”的能力，内部仍然按帧和分片做缓存。\n */\nasync function loadFDS (\n ssp: SoonSpace,\n url: string,\n parent?: Object3D | null,\n options: TFdsLoadOptions = {}\n) {\n\n const supportedFields = [ 'temperature', 'soot_density', 'hrrpuv' ] as const\n\n const response = await fetch( url )\n\n if ( !response.ok ) {\n\n throw new Error( `HTTP ${response.status} ${response.statusText}: ${url}` )\n\n }\n\n const archive = new ZipArchive( await response.arrayBuffer() )\n const field = options.field ?\n (\n archive.has( `${options.field}/simulates.json` ) ?\n options.field :\n undefined\n ) :\n supportedFields.find( item => archive.has( `${item}/simulates.json` ) )\n\n if ( !field ) {\n\n throw new Error(\n options.field ?\n `fds zip: field not found: ${options.field}` :\n 'fds zip: no supported field found'\n )\n\n }\n\n const manifest = archive.readJson<TSimulatesManifest>( `${field}/simulates.json` )\n const slice = archive.readJson<TSliceData>( `${field}/slice.json` )\n const shape: TVolumePointsShape = {\n width: manifest.headers.shape[ 0 ],\n height: manifest.headers.shape[ 1 ],\n depth: manifest.headers.shape[ 2 ],\n }\n const totalFrames = manifest.headers.shape[ 3 ]\n const simulationDurationSec = inferSimulationDurationSec(\n manifest,\n slice,\n totalFrames,\n options.simulationDurationSec\n )\n const initialTimeSec = Math.min(\n Math.max( options.initialTimeSec ?? 0, 0 ),\n Math.max( 0, simulationDurationSec )\n )\n const preferredFrameIndex = timeToFrameIndex(\n initialTimeSec,\n simulationDurationSec,\n totalFrames,\n slice\n )\n const frames = Array.from( { length: totalFrames, }, () => undefined as Uint8ClampedArray | undefined )\n const inflightChunkMap = new Map<number, Promise<void>>()\n const chunkReader = createChunkFramesReader( shape )\n let disposed = false\n let volumePoints: VolumePoints | null = null\n\n /**\n * 根据当前秒数尝试渲染一帧。\n * 如果目标帧尚未准备好，会回退到最近的已缓存帧，避免画面长时间不更新。\n */\n const renderCurrentTime = () => {\n\n if ( disposed || !volumePoints ) return volumePoints\n\n const currentTimeSec = Math.min(\n Math.max( Number( volumePoints.userData.fdsCurrentTimeSec ?? initialTimeSec ), 0 ),\n simulationDurationSec\n )\n const currentFrameIndex = timeToFrameIndex(\n currentTimeSec,\n simulationDurationSec,\n totalFrames,\n slice\n )\n const renderFrameIndex = findBestRenderableFrame( frames, currentFrameIndex )\n\n if ( renderFrameIndex < 0 ) return volumePoints\n\n const nextFrame = frames[ renderFrameIndex ]\n\n if ( !nextFrame ) return volumePoints\n\n volumePoints.userData.fdsRenderedTimeSec = frameIndexToTime(\n renderFrameIndex,\n simulationDurationSec,\n totalFrames,\n slice\n )\n volumePoints.userData.fdsRenderedFrameIndex = renderFrameIndex\n\n if ( volumePoints.userData.frameIndex !== renderFrameIndex ) {\n\n volumePoints.userData.frameIndex = renderFrameIndex\n volumePoints.updateData( nextFrame )\n void ssp.render()\n\n }\n\n return volumePoints\n\n }\n\n /** 按分片起始帧发起解码请求；已缓存或已在请求中的分片会被直接复用。 */\n const requestChunkForStartFrame = ( chunkStartFrame: number ) => {\n\n if ( disposed ) return Promise.resolve()\n\n const normalizedFrameIndex = clampFrameIndex( chunkStartFrame, totalFrames )\n const { item, chunkStartFrame: resolvedChunkStartFrame, } = findItemForGlobalFrame(\n manifest,\n normalizedFrameIndex\n )\n\n if ( isChunkFramesLoaded( frames, resolvedChunkStartFrame, item.frames ) ) {\n\n return Promise.resolve()\n\n }\n\n const inflight = inflightChunkMap.get( resolvedChunkStartFrame )\n\n if ( inflight ) return inflight\n\n const task = ( async () => {\n\n try {\n\n const chunkPath = normalizeFdsPath( `${field}/${item.url}` )\n const chunkBytes = archive.read( chunkPath )\n const { frames: chunkFrames, startFrameIndex, } = await chunkReader.readChunk(\n toTransferableArrayBuffer( chunkBytes ),\n item,\n resolvedChunkStartFrame\n )\n\n if ( disposed ) return\n\n const safeStartFrameIndex = clampFrameIndex( startFrameIndex, totalFrames )\n const writableCount = Math.min(\n chunkFrames.length,\n totalFrames - safeStartFrameIndex\n )\n\n for ( let i = 0; i < writableCount; i++ ) {\n\n frames[ safeStartFrameIndex + i ] = chunkFrames[ i ]\n\n }\n\n renderCurrentTime()\n\n } finally {\n\n inflightChunkMap.delete( resolvedChunkStartFrame )\n\n }\n\n } )()\n\n inflightChunkMap.set( resolvedChunkStartFrame, task )\n\n return task\n\n }\n\n /** 根据任意帧索引转发到对应分片的加载逻辑。 */\n const requestChunkForFrame = ( frameIndex: number ) => {\n\n const normalizedFrameIndex = clampFrameIndex( frameIndex, totalFrames )\n const { chunkStartFrame, } = findItemForGlobalFrame(\n manifest,\n normalizedFrameIndex\n )\n\n return requestChunkForStartFrame( chunkStartFrame )\n\n }\n\n /** 预热某个时间窗口内会用到的全部分片。 */\n const ensureTimeWindowCached = ( fromTimeSec: number, toTimeSec: number ) => {\n\n if ( disposed ) return Promise.resolve()\n\n const frameIndex = timeToFrameIndex(\n fromTimeSec,\n simulationDurationSec,\n totalFrames,\n slice\n )\n const aheadFrameIndex = timeToFrameIndex(\n toTimeSec,\n simulationDurationSec,\n totalFrames,\n slice\n )\n const chunkStartFrames = chunkStartFramesOverlappingFrameRange(\n manifest,\n frameIndex,\n aheadFrameIndex\n )\n\n return Promise.all(\n chunkStartFrames.map( startFrameIndex => requestChunkForStartFrame( startFrameIndex ) )\n ).then( () => undefined )\n\n }\n\n /** 在当前播放秒数之后继续预取一小段时间窗口。 */\n const prefetchTimeWindow = ( currentTimeSec: number ) => {\n\n const nextTimeSec = Math.min(\n currentTimeSec + PLAYBACK_CHUNK_LOOKAHEAD_SEC,\n simulationDurationSec\n )\n\n void ensureTimeWindowCached( currentTimeSec, nextTimeSec )\n .catch( error => console.error( '[loadFDS] prefetch failed', error ) )\n\n }\n\n // 初始时间窗口解码完成后，再把体渲染对象真正暴露给外部时间轴使用。\n await ensureTimeWindowCached(\n initialTimeSec,\n Math.min(\n initialTimeSec + PLAYBACK_CHUNK_LOOKAHEAD_SEC,\n simulationDurationSec\n )\n )\n\n const frame = frames[ preferredFrameIndex ]\n const initialFrameIndex = preferredFrameIndex\n\n if ( !frame ) {\n\n throw new Error( 'fds: no renderable frame found' )\n\n }\n\n const fdsMesh = options.meshIjk && options.meshXb ?\n new FdsMesh( options.meshIjk, options.meshXb ) :\n createFdsMeshBySceneBox(\n ssp,\n shape,\n parent ?? ssp.viewport.scene\n )\n const center = fdsMesh.xb.getCenter( new Vector3() )\n\n volumePoints = new VolumePoints( shape )\n\n // 通过 userData 暴露给示例页和插件调用链的播放能力。\n volumePoints.name = `fds/${field}`\n volumePoints.userData.renderType = 'FDS'\n volumePoints.userData.stype = 'FDS'\n volumePoints.userData.fdsField = field\n volumePoints.userData.fdsUrl = url\n volumePoints.userData.frameIndex = initialFrameIndex\n volumePoints.userData.fdsCurrentTimeSec = initialTimeSec\n volumePoints.userData.fdsRenderedFrameIndex = initialFrameIndex\n volumePoints.userData.fdsRenderedTimeSec = initialTimeSec\n volumePoints.userData.fdsTotalFrames = totalFrames\n volumePoints.userData.fdsSimulationDurationSec = simulationDurationSec\n volumePoints.userData.fdsInitialTimeSec = initialTimeSec\n volumePoints.userData.fdsFrameToTime = ( frameIndex: number ) =>\n frameIndexToTime( frameIndex, simulationDurationSec, totalFrames, slice )\n volumePoints.userData.fdsTimeToFrame = ( timeSec: number ) =>\n timeToFrameIndex( timeSec, simulationDurationSec, totalFrames, slice )\n volumePoints.userData.fdsPrefetchTimeWindow = (\n fromTimeSec: number,\n toTimeSec = fromTimeSec + PLAYBACK_CHUNK_LOOKAHEAD_SEC\n ) => ensureTimeWindowCached( fromTimeSec, toTimeSec )\n volumePoints.updateData( frame )\n volumePoints.scale.copy( fdsMesh.size )\n volumePoints.position.copy( center )\n volumePoints.applyMatrix4( fdsSpaceMatrix )\n volumePoints.material.uniforms.lutMap.value = (\n field === 'soot_density' ? sootCanvasTexture : rainbowCanvasTexture\n )\n volumePoints.material.uniforms.isSoot.value = field === 'soot_density' ? 1.0 : 0.0\n volumePoints.onBeforeRender = ( _renderer, _scene, camera ) => {\n\n volumePoints.updateCamera( camera.position )\n\n }\n\n /** 当对象从场景中移除时，同时释放分片解码相关资源。 */\n const disposeFdsResources = () => {\n\n if ( disposed ) return\n\n disposed = true\n inflightChunkMap.clear()\n chunkReader.dispose()\n\n }\n\n volumePoints.addEventListener( 'removed', disposeFdsResources )\n volumePoints.userData.fdsDispose = disposeFdsResources\n\n /** 按帧跳转，但仍同步维护秒级播放状态。 */\n volumePoints.userData.fdsSetFrame = async ( frameIndex: number ) => {\n\n if ( disposed ) return volumePoints\n\n const normalizedFrameIndex = clampFrameIndex( frameIndex, totalFrames )\n const nextTimeSec = frameIndexToTime(\n normalizedFrameIndex,\n simulationDurationSec,\n totalFrames,\n slice\n )\n\n volumePoints.userData.fdsCurrentTimeSec = nextTimeSec\n prefetchTimeWindow( nextTimeSec )\n renderCurrentTime()\n await requestChunkForFrame( normalizedFrameIndex )\n renderCurrentTime()\n void ssp.render()\n\n return volumePoints\n\n }\n\n /** 外部主要调用的按秒跳转方法。 */\n volumePoints.userData.fdsSetTime = async ( timeSec: number ) => {\n\n const clampedTimeSec = Math.min(\n Math.max( Number.isFinite( timeSec ) ? timeSec : 0, 0 ),\n simulationDurationSec\n )\n const nextFrameIndex = timeToFrameIndex(\n clampedTimeSec,\n simulationDurationSec,\n totalFrames,\n slice\n )\n\n volumePoints.userData.fdsCurrentTimeSec = clampedTimeSec\n prefetchTimeWindow( clampedTimeSec )\n renderCurrentTime()\n await requestChunkForFrame( nextFrameIndex )\n renderCurrentTime()\n void ssp.render()\n\n return volumePoints\n\n }\n\n prefetchTimeWindow( initialTimeSec )\n ssp.attachObject( volumePoints, parent )\n void ssp.render()\n\n return volumePoints\n\n}\n\nexport {\n loadFDS,\n}\n","import SoonSpace from 'soonspacejs'\nimport {\n EventDispatcher,\n Object3D,\n} from 'three'\n\nimport { VolumePoints, } from '../class/VolumePoints'\nimport { loadFDS, } from '../utils/load-fds'\nimport type {\n TFdsLoadOptions,\n TFdsMeshIjk,\n TFdsMeshXb,\n} from '../utils/fds.types'\n\nconst FDS_FIELDS = [ 'temperature', 'soot_density', 'hrrpuv' ] as const\n\ntype TFdsField = ( typeof FDS_FIELDS )[ number ]\n\nexport interface IFdsManagerSource {\n id?: string\n sid?: string\n nodeId?: string\n name?: string\n visible?: boolean\n order?: number\n path?: string\n url?: string\n parent?: Object3D | null\n meshIjk?: TFdsMeshIjk\n meshXb?: TFdsMeshXb\n simulationTime?: number | string\n initialTimeSec?: number\n}\n\nexport type TFdsManagerLoadInput =\n | string\n | IFdsManagerSource\n | Array<string | IFdsManagerSource>\n\nexport interface IFdsManagerOptions {\n resolveUrl?: ( path: string, source?: IFdsManagerSource ) => string\n resolveParent?: ( source?: IFdsManagerSource ) => Object3D | null | undefined\n getSources?: () => Promise<IFdsManagerSource[] | null | undefined>\n fallbackUrl?: string\n}\n\nexport interface IFdsManagerLoadOptions {\n field?: TFdsField\n clearBeforeLoad?: boolean\n activeIndex?: number\n initialTimeSec?: number\n simulationDurationSec?: number\n}\n\nexport interface IFdsManagerState {\n activeVolume: VolumePoints | null\n activeIndex: number\n volumes: VolumePoints[]\n count: number\n playing: boolean\n field?: TFdsField\n source: IFdsManagerSource | null\n currentTimeSec: number\n renderedTimeSec: number\n durationSec: number\n totalFrames: number\n renderedFrameIndex: number\n}\n\nexport interface IFdsManagerLoadedEvent {\n type: 'loaded'\n sources: IFdsManagerSource[]\n volumes: VolumePoints[]\n state: IFdsManagerState\n}\n\nexport interface IFdsManagerStateChangeEvent {\n type: 'statechange'\n state: IFdsManagerState\n}\n\nexport interface IFdsManagerActiveChangeEvent {\n type: 'activechange'\n volume: VolumePoints | null\n state: IFdsManagerState\n}\n\nexport interface IFdsManagerClearEvent {\n type: 'clear'\n count: number\n state: IFdsManagerState\n}\n\nexport interface IFdsManagerErrorEvent {\n type: 'error'\n error: unknown\n}\n\nexport interface IFdsManagerEventMap {\n loaded: IFdsManagerLoadedEvent\n statechange: IFdsManagerStateChangeEvent\n activechange: IFdsManagerActiveChangeEvent\n clear: IFdsManagerClearEvent\n error: IFdsManagerErrorEvent\n}\n\nlet managerSeed = 0\n\nfunction toFiniteNumber ( value: unknown ) {\n\n const numericValue = Number( value )\n\n return Number.isFinite( numericValue ) ?\n numericValue :\n undefined\n\n}\n\nexport class FdsManager extends EventDispatcher<IFdsManagerEventMap> {\n\n private _options: IFdsManagerOptions\n private _volumes: VolumePoints[] = []\n private _activeVolume: VolumePoints | null = null\n private _playing = false\n private _rafId = 0\n private _playStartedAt = 0\n private _playStartedTime = 0\n private _lastRequestedFrameIndex = -1\n private _lastRenderedFrameIndex = -1\n private _readonlyId = `fds-manager-${++managerSeed}`\n\n constructor ( readonly ssp: SoonSpace, options: IFdsManagerOptions = {} ) {\n\n super()\n this._options = { ...options, }\n\n }\n\n get id () {\n\n return this._readonlyId\n\n }\n\n get volumes () {\n\n return [ ...this._volumes ]\n\n }\n\n get activeVolume () {\n\n return this._activeVolume\n\n }\n\n get isPlaying () {\n\n return this._playing\n\n }\n\n setOptions ( options: Partial<IFdsManagerOptions> ) {\n\n this._options = {\n ...this._options,\n ...options,\n }\n\n return this\n\n }\n\n getState (): IFdsManagerState {\n\n const activeVolume = this._activeVolume\n const renderedTimeSec = this._getRenderedTime(\n activeVolume,\n this._getCurrentTime( activeVolume )\n )\n\n return {\n activeVolume,\n activeIndex: activeVolume ? this._volumes.indexOf( activeVolume ) : -1,\n volumes: [ ...this._volumes ],\n count: this._volumes.length,\n playing: this._playing,\n field: activeVolume?.userData?.fdsField as TFdsField | undefined,\n source: ( activeVolume?.userData?.fdsSource as IFdsManagerSource | null | undefined ) ?? null,\n currentTimeSec: this._getCurrentTime( activeVolume, renderedTimeSec ),\n renderedTimeSec,\n durationSec: this._getDuration( activeVolume ),\n totalFrames: Number( activeVolume?.userData?.fdsTotalFrames || 0 ),\n renderedFrameIndex: this._getRenderedFrameIndex( activeVolume ),\n }\n\n }\n\n async load (\n input?: TFdsManagerLoadInput,\n options: IFdsManagerLoadOptions = {}\n ) {\n\n const sources = await this._resolveLoadSources( input )\n\n this.pause()\n\n if ( options.clearBeforeLoad !== false ) {\n\n this._clear( false )\n\n }\n\n const volumes = await Promise.all(\n sources.map( source => this._loadOne( source, options ) )\n )\n const activeIndex = Math.min(\n Math.max( options.activeIndex ?? 0, 0 ),\n Math.max( volumes.length - 1, 0 )\n )\n\n this._setActiveVolume( volumes[ activeIndex ] ?? this._volumes[ 0 ] ?? null, false )\n\n const state = this.getState()\n\n this.dispatchEvent( {\n type: 'loaded',\n sources,\n volumes,\n state,\n } )\n this.dispatchEvent( {\n type: 'statechange',\n state,\n } )\n\n return volumes\n\n }\n\n clear () {\n\n return this._clear( true )\n\n }\n\n setActiveVolume ( target: number | string | VolumePoints | null ) {\n\n const volume = this._resolveVolume( target )\n\n return this._setActiveVolume( volume )\n\n }\n\n async setTime (\n timeSec: number,\n options: {\n wait?: boolean\n volume?: number | string | VolumePoints | null\n } = {}\n ) {\n\n const volume = this._resolveVolume( options.volume )\n const setTime = volume?.userData?.fdsSetTime as\n | ( ( timeSec: number ) => Promise<VolumePoints> )\n | undefined\n\n if ( !volume || typeof setTime !== 'function' ) return volume ?? null\n\n const nextTimeSec = Math.min(\n Math.max( Number( timeSec || 0 ), 0 ),\n this._getDuration( volume )\n )\n\n try {\n\n const task = setTime( nextTimeSec )\n\n if ( options.wait === false ) {\n\n Promise.resolve( task )\n .then( async () => {\n\n await this.ssp.render()\n this.dispatchEvent( {\n type: 'statechange',\n state: this.getState(),\n } )\n\n } )\n .catch( error => {\n\n this.pause()\n this.dispatchEvent( {\n type: 'error',\n error,\n } )\n\n } )\n\n } else {\n\n await task\n await this.ssp.render()\n this.dispatchEvent( {\n type: 'statechange',\n state: this.getState(),\n } )\n\n }\n\n return volume\n\n } catch ( error ) {\n\n this.pause()\n this.dispatchEvent( {\n type: 'error',\n error,\n } )\n throw error\n\n }\n\n }\n\n play ( target?: number | string | VolumePoints | null ) {\n\n const volume = this._resolveVolume( target )\n\n if ( !volume ) return false\n\n const durationSec = this._getDuration( volume )\n\n if ( durationSec <= 0 ) {\n\n this.pause()\n return false\n\n }\n\n this._setActiveVolume( volume, false )\n\n if ( this._playing ) {\n\n this.pause()\n\n }\n\n const renderedTimeSec = this._getRenderedTime(\n volume,\n this._getCurrentTime( volume )\n )\n\n this._playing = true\n this._playStartedAt = performance.now()\n this._playStartedTime = renderedTimeSec >= durationSec ? 0 : renderedTimeSec\n this._lastRequestedFrameIndex = -1\n this._lastRenderedFrameIndex = this._getRenderedFrameIndex( volume )\n\n if ( renderedTimeSec >= durationSec ) {\n\n void this.setTime( 0 )\n\n }\n\n this.dispatchEvent( {\n type: 'statechange',\n state: this.getState(),\n } )\n\n const tick = () => {\n\n const activeVolume = this._activeVolume\n\n if ( !this._playing || !activeVolume ) return\n\n const currentDurationSec = this._getDuration( activeVolume )\n\n if ( currentDurationSec <= 0 ) {\n\n this.pause()\n return\n\n }\n\n const elapsedSec = ( performance.now() - this._playStartedAt ) / 1000\n const desiredTimeSec = Math.min(\n currentDurationSec,\n this._playStartedTime + elapsedSec\n )\n const desiredFrameIndex = this._getTimeFrameIndex(\n activeVolume,\n desiredTimeSec\n )\n\n if ( desiredFrameIndex !== this._lastRequestedFrameIndex ) {\n\n this._lastRequestedFrameIndex = desiredFrameIndex\n void this.setTime( desiredTimeSec, {\n wait: false,\n volume: activeVolume,\n } )\n\n }\n\n const renderedFrameIndex = this._getRenderedFrameIndex( activeVolume )\n const renderedTimeSec = this._getRenderedTime(\n activeVolume,\n desiredTimeSec\n )\n\n if ( renderedFrameIndex !== this._lastRenderedFrameIndex ) {\n\n this._lastRenderedFrameIndex = renderedFrameIndex\n this.dispatchEvent( {\n type: 'statechange',\n state: this.getState(),\n } )\n void this.ssp.render()\n\n }\n\n if (\n desiredTimeSec >= currentDurationSec &&\n renderedTimeSec >= currentDurationSec - 0.001\n ) {\n\n this.pause()\n return\n\n }\n\n this._rafId = globalThis.requestAnimationFrame( tick )\n\n }\n\n this._rafId = globalThis.requestAnimationFrame( tick )\n\n return true\n\n }\n\n pause () {\n\n if ( !this._playing && !this._rafId ) return false\n\n this._playing = false\n\n if ( this._rafId ) {\n\n globalThis.cancelAnimationFrame( this._rafId )\n this._rafId = 0\n\n }\n\n this.dispatchEvent( {\n type: 'statechange',\n state: this.getState(),\n } )\n\n return true\n\n }\n\n togglePlay ( target?: number | string | VolumePoints | null ) {\n\n return this._playing ?\n !this.pause() :\n this.play( target )\n\n }\n\n dispose () {\n\n this.pause()\n this._clear( false )\n\n }\n\n private async _loadOne (\n source: IFdsManagerSource,\n options: IFdsManagerLoadOptions\n ) {\n\n const rawPath = this._getSourcePath( source )\n\n if ( !rawPath ) {\n\n throw new Error( 'fds: source path is required' )\n\n }\n\n const resolvedUrl = this._resolveUrl( rawPath, source )\n\n this._removeDuplicates( resolvedUrl, source )\n\n const volumePoints = await loadFDS(\n this.ssp,\n resolvedUrl,\n this._resolveParent( source ),\n {\n field: options.field,\n meshIjk: source.meshIjk,\n meshXb: source.meshXb,\n simulationDurationSec:\n toFiniteNumber( source.simulationTime ) ??\n options.simulationDurationSec,\n initialTimeSec:\n toFiniteNumber( source.initialTimeSec ) ??\n options.initialTimeSec ??\n 0,\n } satisfies TFdsLoadOptions\n )\n\n volumePoints.name = source.name || volumePoints.name\n volumePoints.visible = source.visible !== false\n volumePoints.userData.fdsManagerId = this.id\n volumePoints.userData.fdsSource = source\n volumePoints.userData.fdsNodeId = source.nodeId\n volumePoints.userData.id = source.id\n volumePoints.userData.sid = source.sid\n\n const onRemoved = () => {\n\n volumePoints.removeEventListener( 'removed', onRemoved )\n Reflect.deleteProperty( volumePoints.userData, 'fdsManagerOnRemoved' )\n this._untrackVolume( volumePoints )\n\n }\n\n volumePoints.userData.fdsManagerOnRemoved = onRemoved\n volumePoints.addEventListener( 'removed', onRemoved )\n this._trackVolume( volumePoints )\n\n return volumePoints\n\n }\n\n private _resolveUrl ( path: string, source?: IFdsManagerSource ) {\n\n return this._options.resolveUrl?.( path, source ) ?? path\n\n }\n\n private _resolveParent ( source?: IFdsManagerSource ) {\n\n if ( source && Reflect.has( source, 'parent' ) ) {\n\n return source.parent\n\n }\n\n return this._options.resolveParent?.( source ) ?? null\n\n }\n\n private async _resolveLoadSources ( input?: TFdsManagerLoadInput ) {\n\n if ( input != null ) {\n\n return this._normalizeSources( input )\n\n }\n\n let sources: IFdsManagerSource[] = []\n\n try {\n\n const loadedSources = await this._options.getSources?.()\n\n sources = ( loadedSources ?? [] )\n .filter( source => source.visible !== false && !!this._getSourcePath( source ) )\n .sort( ( a, b ) => ( a.order ?? 0 ) - ( b.order ?? 0 ) )\n\n } catch ( error ) {\n\n if ( !this._options.fallbackUrl ) {\n\n throw error\n\n }\n\n }\n\n if ( sources.length ) return sources\n\n if ( this._options.fallbackUrl ) {\n\n return [ { path: this._options.fallbackUrl, } ]\n\n }\n\n return []\n\n }\n\n private _normalizeSources ( input: TFdsManagerLoadInput ) {\n\n const sourceList = Array.isArray( input ) ? input : [ input ]\n\n return sourceList\n .map( item =>\n typeof item === 'string' ?\n { path: item, } :\n item\n )\n .filter( source => !!this._getSourcePath( source ) )\n\n }\n\n private _getSourcePath ( source?: IFdsManagerSource | null ) {\n\n return source?.url || source?.path || ''\n\n }\n\n private _trackVolume ( volume: VolumePoints ) {\n\n if ( this._volumes.includes( volume ) ) return\n\n this._volumes.push( volume )\n\n }\n\n private _untrackVolume ( volume: VolumePoints ) {\n\n const index = this._volumes.indexOf( volume )\n\n if ( index >= 0 ) {\n\n this._volumes.splice( index, 1 )\n\n }\n\n if ( this._activeVolume === volume ) {\n\n this.pause()\n this._activeVolume = this._volumes[ 0 ] ?? null\n\n const state = this.getState()\n\n this.dispatchEvent( {\n type: 'activechange',\n volume: this._activeVolume,\n state,\n } )\n this.dispatchEvent( {\n type: 'statechange',\n state,\n } )\n\n }\n\n }\n\n private _setActiveVolume ( volume: VolumePoints | null, emit = true ) {\n\n if ( this._activeVolume === volume ) return volume\n\n if ( this._playing ) {\n\n this.pause()\n\n }\n\n this._activeVolume = volume\n\n if ( emit ) {\n\n const state = this.getState()\n\n this.dispatchEvent( {\n type: 'activechange',\n volume,\n state,\n } )\n this.dispatchEvent( {\n type: 'statechange',\n state,\n } )\n\n }\n\n return volume\n\n }\n\n private _resolveVolume (\n target?: number | string | VolumePoints | null\n ) {\n\n if ( target == null ) return this._activeVolume\n\n if ( typeof target === 'number' ) {\n\n return this._volumes[ target ] ?? null\n\n }\n\n if ( typeof target === 'string' ) {\n\n return this._volumes.find( volume =>\n volume.userData?.id === target ||\n volume.userData?.sid === target ||\n volume.userData?.fdsUrl === target ||\n volume.name === target\n ) ?? null\n\n }\n\n return target\n\n }\n\n private _removeDuplicates (\n resolvedUrl: string,\n source: IFdsManagerSource\n ) {\n\n const duplicatedFds = new Set<Object3D>()\n const addVolumes = ( objects: Object3D[] ) => {\n\n objects\n .filter( object => object.userData?.renderType === 'FDS' )\n .forEach( object => duplicatedFds.add( object ) )\n\n }\n\n addVolumes(\n this.ssp.getObjectByUserDataProperty<Object3D>( 'fdsUrl', resolvedUrl )\n )\n\n if ( source.id ) {\n\n addVolumes(\n this.ssp.getObjectByUserDataProperty<Object3D>( 'id', source.id )\n )\n\n }\n\n if ( source.sid ) {\n\n addVolumes(\n this.ssp.getObjectByUserDataProperty<Object3D>( 'sid', source.sid )\n )\n\n }\n\n duplicatedFds.forEach( object => this.ssp.removeObject( object ) )\n\n }\n\n private _clear ( emit: boolean ) {\n\n this.pause()\n\n const volumes = [ ...this._volumes ]\n\n this._volumes = []\n this._activeVolume = null\n\n volumes.forEach( volume => {\n\n const onRemoved = volume.userData?.fdsManagerOnRemoved as\n | ( () => void )\n | undefined\n\n if ( onRemoved ) {\n\n volume.removeEventListener( 'removed', onRemoved )\n Reflect.deleteProperty( volume.userData, 'fdsManagerOnRemoved' )\n\n }\n\n if ( volume.parent ) {\n\n this.ssp.removeObject( volume )\n\n }\n\n } )\n\n void this.ssp.render()\n\n if ( emit ) {\n\n const state = this.getState()\n\n this.dispatchEvent( {\n type: 'clear',\n count: volumes.length,\n state,\n } )\n this.dispatchEvent( {\n type: 'statechange',\n state,\n } )\n\n }\n\n return volumes.length\n\n }\n\n private _getDuration ( volume: VolumePoints | null | undefined ) {\n\n return Math.max(\n 0,\n Number( volume?.userData?.fdsSimulationDurationSec || 0 )\n )\n\n }\n\n private _getCurrentTime (\n volume: VolumePoints | null | undefined,\n fallbackTimeSec = 0\n ) {\n\n const timeSec = Number( volume?.userData?.fdsCurrentTimeSec )\n\n return Number.isFinite( timeSec ) ?\n timeSec :\n fallbackTimeSec\n\n }\n\n private _getRenderedTime (\n volume: VolumePoints | null | undefined,\n fallbackTimeSec = 0\n ) {\n\n const renderedTimeSec = Number( volume?.userData?.fdsRenderedTimeSec )\n\n if ( Number.isFinite( renderedTimeSec ) ) {\n\n return renderedTimeSec\n\n }\n\n const frameIndex = Number( volume?.userData?.frameIndex || 0 )\n const frameToTime = volume?.userData?.fdsFrameToTime as\n | ( ( frameIndex: number ) => number )\n | undefined\n\n return typeof frameToTime === 'function' ?\n Number( frameToTime( frameIndex ) || 0 ) :\n fallbackTimeSec\n\n }\n\n private _getRenderedFrameIndex ( volume: VolumePoints | null | undefined ) {\n\n const frameIndex = Number(\n volume?.userData?.fdsRenderedFrameIndex ?? volume?.userData?.frameIndex\n )\n\n return Number.isFinite( frameIndex ) ?\n frameIndex :\n -1\n\n }\n\n private _getTimeFrameIndex (\n volume: VolumePoints | null | undefined,\n timeSec: number\n ) {\n\n const timeToFrame = volume?.userData?.fdsTimeToFrame as\n | ( ( timeSec: number ) => number )\n | undefined\n\n if ( typeof timeToFrame === 'function' ) {\n\n const frameIndex = Number( timeToFrame( timeSec ) )\n\n if ( Number.isFinite( frameIndex ) ) {\n\n return frameIndex\n\n }\n\n }\n\n return Math.floor( Number( timeSec || 0 ) * 10 )\n\n }\n\n}\n"],"names":["fdsSpaceMatrix","Matrix4","Vector3","threeToFdsSpaceMatrix","FdsMesh","ijk","xb","Box3","cell","outputSpace","position","inputSpace","positionVector","vertexShader","fragmentShader","volumeLut","Lut","sootCanvasTexture","CanvasTexture","rainbowCanvasTexture","VolumePoints","Mesh","props","texture","Data3DTexture","RedFormat","UnsignedByteType","LinearFilter","material","ShaderMaterial","BackSide","geometry","BoxGeometry","data","image","cameraPos","FDS_REF_DURATION_SEC","FDS_REF_TOTAL_FRAMES","PLAYBACK_CHUNK_LOOKAHEAD_SEC","normalizeFdsPath","path","sortedSimulateItems","manifest","a","b","findItemForGlobalFrame","globalFrameIndex","totalFrames","items","chunkStartFrame","item","isChunkFramesLoaded","frames","chunkFrameCount","i","chunkStartFramesOverlappingFrameRange","fMin","fMax","start","end","chunkStarts","offset","chunkLastFrame","findBestRenderableFrame","preferredFrameIndex","clampedFrameIndex","getSortedSliceFrames","slice","inferSimulationDurationSec","preferredDurationSec","fromJson","sliceFrames","lastSliceFrame","clampFrameIndex","frameIndex","frameIndexToTime","maxTime","normalizedFrameIndex","sliceFrame","MathUtils","timeToFrameIndex","timeSec","clampedTime","nearestFrameIndex","nearestDistance","distance","toTransferableArrayBuffer","bytes","buffer","createChunkFramesReader","shape","worker","ReadSimulateWorker","pending","disposed","rejectAll","error","onMessage","event","current","onError","onMessageError","arrayBuffer","startFrameIndex","resolve","reject","uuid","getRenderableSceneBox","ssp","root","box","objectBox","scene","object","renderable","createFdsMeshBySceneBox","sceneBox","useRootOriginAsCenter","anchorWorldCenter","worldCenter","fdsSize","fdsCenter","half","u8","u16","i32","fleb","fdeb","clim","freb","eb","r","j","_a","fl","revfl","_b","fd","rev","x","hMap","cd","mb","s","l","le","co","rvb","sv","r_1","v","m","flt","fdt","flrm","fdrm","max","bits","d","p","o","bits16","shft","slc","e","ec","err","ind","msg","nt","inflt","dat","st","buf","dict","sl","dl","noBuf","resize","noSt","cbuf","bl","nbuf","final","pos","bt","lm","dm","lbt","dbt","tbts","type","hLit","hcLen","tl","ldt","clt","clb","clbmsk","clm","c","n","lt","dt","t","lms","dms","lpos","sym","add","dsym","shift","dend","et","inflateSync","opts","td","tds","textDecoder","normalizeEntryName","name","readUint16","view","readUint32","findEndOfCentralDirectoryOffset","minOffset","ZipArchive","#bytes","#view","#entries","#readEntries","entryName","entry","localOffset","fileNameLength","extraFieldLength","dataStart","dataEnd","compressedData","endOffset","totalEntries","index","compressionMethod","compressedSize","commentLength","localHeaderOffset","fileNameStart","fileNameEnd","loadFDS","url","parent","options","supportedFields","response","archive","field","simulationDurationSec","initialTimeSec","inflightChunkMap","chunkReader","volumePoints","renderCurrentTime","currentTimeSec","currentFrameIndex","renderFrameIndex","nextFrame","requestChunkForStartFrame","resolvedChunkStartFrame","inflight","task","chunkPath","chunkBytes","chunkFrames","safeStartFrameIndex","writableCount","requestChunkForFrame","ensureTimeWindowCached","fromTimeSec","toTimeSec","aheadFrameIndex","chunkStartFrames","prefetchTimeWindow","nextTimeSec","frame","initialFrameIndex","fdsMesh","center","_renderer","_scene","camera","disposeFdsResources","clampedTimeSec","nextFrameIndex","managerSeed","toFiniteNumber","value","numericValue","FdsManager","EventDispatcher","activeVolume","renderedTimeSec","input","sources","volumes","source","activeIndex","state","target","volume","setTime","durationSec","tick","currentDurationSec","elapsedSec","desiredTimeSec","desiredFrameIndex","renderedFrameIndex","rawPath","resolvedUrl","onRemoved","emit","duplicatedFds","addVolumes","objects","fallbackTimeSec","frameToTime","timeToFrame"],"mappings":";;AAEO,MAAMA,KAAiB,IAAIC,GAAA;AAClCD,GAAe;AAAA,EACb,IAAIE,EAAS,GAAG,GAAG,CAAE;AAAA,EACrB,IAAIA,EAAS,GAAG,GAAG,EAAG;AAAA,EACtB,IAAIA,EAAS,GAAG,GAAG,CAAE;AACvB;AAEO,MAAMC,KAAwBH,GAAe,MAAA,EAAQ,OAAA;ACY5D,MAAMI,GAAQ;AAAA,EAEZ;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EAEA,YAAcC,GAAeC,GAAS;AAEpC,SAAK,MAAM,IAAIJ,EAASG,EAAI,GAAGA,EAAI,GAAGA,EAAI,CAAE,GAE5C,KAAK,KAAK,IAAIE;AAAA,MACZ,IAAIL,EAASI,EAAG,MAAMA,EAAG,MAAMA,EAAG,IAAK;AAAA,MACvC,IAAIJ,EAASI,EAAG,MAAMA,EAAG,MAAMA,EAAG,IAAK;AAAA,IAAA,GAGzC,KAAK,SAAS,KAAK,GAAG,IAAI,MAAA,GAC1B,KAAK,OAAO,KAAK,GAAG,QAAS,IAAIJ,GAAU,GAE3C,KAAK,WAAW,IAAIA;AAAA,MAClB,KAAK,KAAK,IAAI,KAAK,IAAI;AAAA,MACvB,KAAK,KAAK,IAAI,KAAK,IAAI;AAAA,MACvB,KAAK,KAAK,IAAI,KAAK,IAAI;AAAA,IAAA;AAAA,EAG3B;AAAA,EAEA,kBAAoBM,GAAgBC,IAAyB,WAAY;AAGvE,UAAMC,IADa,IAAIR,EAASM,EAAK,GAAGA,EAAK,GAAGA,EAAK,CAAE,EAC3B,SAAU,KAAK,QAAS,EAAE,IAAK,KAAK,MAAO;AAEvE,WAAKC,MAAgB,aAEnBC,EAAS,aAAcV,EAAe,GAIjCU;AAAA,EAET;AAAA,EAEA,kBAAoBA,GAAoBC,IAAwB,WAAY;AAE1E,UAAMC,IAAiB,IAAIV,EAASQ,EAAS,GAAGA,EAAS,GAAGA,EAAS,CAAE;AAEvE,WAAKC,MAAe,aAElBC,EAAe,aAAcT,EAAsB,GAIxCS,EAAe,IAAK,KAAK,MAAO,EAAE,OAAQ,KAAK,QAAS,EAAE,MAAA;AAAA,EAIzE;AAEF;AChFO,MAAMC;AAAA;AAAA,EAA0B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,GAqB1BC;AAAA;AAAA,EAA4B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,GCCnCC,IAAY,IAAIC,GAAA;AAEtBD,EAAU,YAAa,QAAQ;AAAA,EAC7B,CAAE,GAAG,OAAS;AAAA,EACd,CAAE,KAAK,OAAS;AAAA,EAChB,CAAE,KAAK,OAAS;AAAA,EAChB,CAAE,KAAK,OAAS;AAAA,EAChB,CAAE,GAAK,CAAS;AAClB,CAAE;AACFA,EAAU,YAAa,QAAQ,GAAI;AAC5B,MAAME,KAAoB,IAAIC,GAAeH,EAAU,cAAe;AAE7EA,EAAU,YAAa,WAAW,GAAI;AAC/B,MAAMI,KAAuB,IAAID,GAAeH,EAAU,cAAe;AAEhF,MAAMK,WAAqBC,GAAkC;AAAA,EAE3D;AAAA,EAEA,YAAcC,GAA4B;AAExC,UAAA;AAEA,UAAMC,IAAU,IAAIC;AAAA,MAClB;AAAA,MACAF,EAAM;AAAA,MACNA,EAAM;AAAA,MACNA,EAAM;AAAA,IAAA;AAGR,IAAAC,EAAQ,SAASE,IACjBF,EAAQ,OAAOG,IACfH,EAAQ,YAAYI,IACpBJ,EAAQ,YAAYI,IACpBJ,EAAQ,kBAAkB,GAC1BA,EAAQ,cAAc,IAEtB,KAAK,UAAUA;AAEf,UAAMK,IAAW,IAAIC,GAAgB;AAAA,MACnC,UAAU;AAAA,QACR,KAAK,EAAE,OAAON,EAAA;AAAA,QACd,QAAQ,EAAE,OAAON,GAAA;AAAA,QACjB,QAAQ,EAAE,OAAO,EAAA;AAAA,QACjB,WAAW,EAAE,OAAO,IAAIf,IAAQ;AAAA,QAChC,OAAO,EAAE,OAAO,IAAA;AAAA,QAChB,WAAW,EAAE,OAAO,EAAA;AAAA,MAAK;AAAA,MAE3B,cAAAW;AAAA,MACA,gBAAAC;AAAA,MACA,MAAMgB;AAAA,MACN,aAAa;AAAA,MACb,WAAW;AAAA,IAAA,CACX;AAEF,SAAK,WAAWF;AAEhB,UAAMG,IAAW,IAAIC,GAAa,GAAG,GAAG,CAAE;AAE1C,SAAK,WAAWD,GAEhB,KAAK,cAAc;AAAA,EAErB;AAAA,EAEA,WAAaE,GAA0B;AAErC,UAAM,EAAE,OAAAC,MAAW,KAAK;AAExB,IAAKA,EAAM,OAEPA,EAAM,KAA4B,IAAKD,CAAK,IAI5CC,EAAuC,OAAOD,GAGlD,KAAK,QAAQ,cAAc;AAAA,EAE7B;AAAA,EAEA,aAAeE,GAAqB;AAElC,SAAK,SAAS,SAAS,UAAU,MAAM,KAAMA,CAAU;AAAA,EAEzD;AAAA,EAEA,UAAW;AAET,SAAK,QAAQ,QAAA,GACb,KAAK,SAAS,QAAA,GACd,KAAK,SAAS,QAAA;AAAA,EAEhB;AAEF;;;;;;;;;;;;;;;;;;;;;AC5GA,MAAMC,KAAuB,MACvBC,KAAuB,KAEvBC,KAA+B;AAGrC,SAASC,GAAmBC,GAAe;AAEzC,SAAOA,EAAK,WAAY,MAAM,GAAI,EAAE,QAAS,UAAU,EAAG;AAE5D;AAGA,SAASC,GAAsBC,GAA+B;AAE5D,SAAO,CAAE,GAAGA,EAAS,KAAM,EAAE,KAAM,CAAEC,GAAGC,MAAOD,EAAE,MAAMC,EAAE,GAAI;AAE/D;AAGA,SAASC,GACPH,GACAI,GACA;AAEA,QAAMC,IAAcL,EAAS,QAAQ,MAAO,CAAE;AAE9C,MACEI,IAAmB,KACnBA,KAAoBC,KACpB,CAAC,OAAO,UAAWD,CAAiB;AAGpC,UAAM,IAAI;AAAA,MACR,oBAAoBA,CAAgB,eAAeC,CAAW;AAAA,IAAA;AAKlE,QAAMC,IAAQP,GAAqBC,CAAS;AAC5C,MAAIO,IAAkB;AAEtB,aAAYC,KAAQF,GAAQ;AAE1B,QAAKF,IAAmBG,IAAkBC,EAAK;AAE7C,aAAO,EAAE,MAAAA,GAAM,iBAAAD,EAAA;AAIjB,IAAAA,KAAmBC,EAAK;AAAA,EAE1B;AAEA,QAAM,IAAI,MAAO,iCAAiCJ,CAAgB,EAAG;AAEvE;AAGA,SAASK,GACPC,GACAH,GACAI,GACA;AAEA,WAAUC,IAAI,GAAGA,IAAID,GAAiBC;AAEpC,QAAKF,EAAQH,IAAkBK,CAAE,MAAM,OAAY,QAAO;AAI5D,SAAO;AAET;AAGA,SAASC,GACPb,GACAc,GACAC,GACA;AAEA,QAAMV,IAAcL,EAAS,QAAQ,MAAO,CAAE;AAE9C,MAAKK,KAAe,EAAI,QAAO,CAAA;AAE/B,QAAMW,IAAQ,KAAK,IAAK,GAAG,KAAK,IAAK,KAAK,IAAKF,GAAMC,CAAK,GAAGV,IAAc,CAAE,CAAE,GACzEY,IAAM,KAAK,IAAK,GAAG,KAAK,IAAK,KAAK,IAAKH,GAAMC,CAAK,GAAGV,IAAc,CAAE,CAAE,GACvEa,IAAwB,CAAA,GACxBZ,IAAQP,GAAqBC,CAAS;AAC5C,MAAImB,IAAS;AAEb,aAAYX,KAAQF,GAAQ;AAE1B,UAAMc,IAAiBD,IAASX,EAAK,SAAS;AAE9C,IAAKS,KAAOE,KAAUH,KAASI,KAE7BF,EAAY,KAAMC,CAAO,GAI3BA,KAAUX,EAAK;AAAA,EAEjB;AAEA,SAAOU;AAET;AAMA,SAASG,GACPX,GACAY,GACA;AAEA,QAAMC,IAAoB,KAAK;AAAA,IAC7B,KAAK,IAAKD,GAAqB,CAAE;AAAA,IACjC,KAAK,IAAK,GAAGZ,EAAO,SAAS,CAAE;AAAA,EAAA;AAGjC,WAAUE,IAAIW,GAAmBX,KAAK,GAAGA;AAEvC,QAAKF,EAAQE,CAAE,MAAM,OAAY,QAAOA;AAI1C,WAAUA,IAAIW,IAAoB,GAAGX,IAAIF,EAAO,QAAQE;AAEtD,QAAKF,EAAQE,CAAE,MAAM,OAAY,QAAOA;AAI1C,SAAO;AAET;AAGA,SAASY,GAAuBC,GAAoB;AAElD,SAAO,CAAE,GAAKA,EAAM,UAAU,CAAA,CAAK,EAChC,KAAM,CAAExB,GAAGC,MAAOD,EAAE,MAAMC,EAAE,GAAI;AAErC;AAGA,SAASwB,GACP1B,GACAyB,GACApB,GACAsB,GACA;AAEA,MACE,OAAOA,KAAyB,YAChCA,IAAuB,KACvB,OAAO,SAAUA,CAAqB;AAGtC,WAAOA;AAIT,QAAMC,IAAW5B,EAAS;AAE1B,MACE,OAAO4B,KAAa,YACpBA,IAAW,KACX,OAAO,SAAUA,CAAS;AAG1B,WAAOA;AAIT,MAAKvB,KAAe,EAAI,QAAO;AAE/B,QAAMwB,IAAcL,GAAsBC,CAAM,GAC1CK,IAAiBD,EAAaA,EAAY,SAAS,CAAE;AAE3D,SACEC,KACA,OAAOA,EAAe,QAAS,YAC/BA,EAAe,OAAO,KACtB,OAAO,SAAUA,EAAe,IAAK,IAG9BA,EAAe,QAKlBzB,IAAc,KAAMX,KACxB,KAAK,IAAK,GAAGC,KAAuB,CAAE;AAG1C;AAGA,SAASoC,EAAkBC,GAAoB3B,GAAsB;AAEnE,SAAO,KAAK;AAAA,IACV,KAAK,IAAK,OAAO,SAAU2B,CAAW,IAAI,KAAK,MAAOA,CAAW,IAAI,GAAG,CAAE;AAAA,IAC1E,KAAK,IAAK,GAAG3B,IAAc,CAAE;AAAA,EAAA;AAGjC;AAGA,SAAS4B,GACPD,GACAE,GACA7B,GACAoB,GACA;AAEA,MAAKpB,KAAe,EAAI,QAAO;AAE/B,QAAM8B,IAAuBJ,EAAiBC,GAAY3B,CAAY,GAChE+B,IAAaZ,GAAsBC,KAAS,EAAG,EAClD,KAAM,CAAAjB,MAAQA,EAAK,QAAQ2B,CAAqB;AAEnD,SACEC,KACA,OAAOA,EAAW,QAAS,YAC3BA,EAAW,QAAQ,KACnB,OAAO,SAAUA,EAAW,IAAK,IAG1BA,EAAW,OAIbC,GAAU,UAAWF,GAAsB,GAAG9B,IAAc,GAAG,GAAG6B,CAAQ;AAEnF;AAGA,SAASI,EACPC,GACAL,GACA7B,GACAoB,GACA;AAEA,MAAKpB,KAAe,EAAI,QAAO;AAE/B,QAAMmC,IAAc,KAAK;AAAA,IACvB,KAAK,IAAK,OAAO,SAAUD,CAAQ,IAAIA,IAAU,GAAG,CAAE;AAAA,IACtD,KAAK,IAAK,GAAGL,CAAQ;AAAA,EAAA,GAEjBL,IAAcL,GAAsBC,KAAS,EAAG;AAEtD,MAAKI,EAAY,QAAS;AAExB,QAAIY,IAAoBV,EAAiBF,EAAa,CAAE,EAAE,KAAKxB,CAAY,GACvEqC,IAAkB,KAAK,KAAOb,EAAa,CAAE,EAAE,QAAQ,KAAMW,CAAY;AAE7E,eAAYJ,KAAcP,GAAc;AAEtC,UACE,OAAOO,EAAW,QAAS,YAC3B,CAAC,OAAO,SAAUA,EAAW,IAAK,EAClC;AAEF,YAAMO,IAAW,KAAK,IAAKP,EAAW,OAAOI,CAAY;AASzD,UAPKG,KAAYD,MAEfA,IAAkBC,GAClBF,IAAoBV,EAAiBK,EAAW,KAAK/B,CAAY,IAI9D+B,EAAW,OAAOI,KAAeG,IAAWD,EAAkB;AAAA,IAErE;AAEA,WAAOD;AAAA,EAET;AAEA,SAAO,KAAK;AAAA,IACV,KAAK,IAAK,KAAK,MAAOJ,GAAU,UAAWG,GAAa,GAAGN,GAAS,GAAG7B,IAAc,CAAE,CAAE,GAAG,CAAE;AAAA,IAC9FA,IAAc;AAAA,EAAA;AAGlB;AAGA,SAASuC,GAA4BC,GAAoB;AAEvD,MACEA,EAAM,kBAAkB,eACxBA,EAAM,eAAe,KACrBA,EAAM,eAAeA,EAAM,OAAO;AAGlC,WAAOA,EAAM;AAIf,QAAMC,IAAS,IAAI,YAAaD,EAAM,UAAW;AAEjD,aAAI,WAAYC,CAAO,EAAE,IAAKD,CAAM,GAE7BC;AAET;AAMA,SAASC,GACPC,GACA;AAEA,QAAMC,IAAS,IAAIC,GAAA,GACbC,wBAAc,IAAA;AAIpB,MAAIC,IAAW;AAEf,QAAMC,IAAY,CAAEC,MAAkB;AAEpC,IAAAH,EAAQ,QAAS,CAAA3C,MAAQA,EAAK,OAAQ8C,CAAM,CAAE,GAC9CH,EAAQ,MAAA;AAAA,EAEV,GAEMI,IAAY,CAAEC,MAAyB;AAE3C,UAAMjE,IAAOiE,EAAM;AAOnB,QAAK,CAACjE,EAAK,KAAO;AAElB,UAAMkE,IAAUN,EAAQ,IAAK5D,EAAK,IAAK;AAEvC,QAAMkE,GAIN;AAAA,UAFAN,EAAQ,OAAQ5D,EAAK,IAAK,GAErBA,EAAK,OAAQ;AAEhB,QAAAkE,EAAQ,OAAQ,IAAI,MAAOlE,EAAK,KAAM,CAAE;AACxC;AAAA,MAEF;AAEA,UAAK,CAACA,EAAK,UAAUA,EAAK,oBAAoB,QAAY;AAExD,QAAAkE,EAAQ,OAAQ,IAAI,MAAO,8BAA+B,CAAE;AAC5D;AAAA,MAEF;AAEA,MAAAA,EAAQ,QAAS;AAAA,QACf,QAAQlE,EAAK;AAAA,QACb,iBAAiBA,EAAK;AAAA,MAAA,CACtB;AAAA;AAAA,EAEJ,GAEMmE,IAAU,CAAEF,MAAuB;AAEvC,IAAAH;AAAA,MACEG,EAAM,iBAAiB,QACrBA,EAAM,QACN,IAAI;AAAA,QACF;AAAA,UACEA,EAAM,WAAW;AAAA,UACjBA,EAAM;AAAA,UACNA,EAAM;AAAA,UACNA,EAAM;AAAA,QAAA,EACN,OAAQ,OAAQ,EAAE,KAAM,KAAM;AAAA,MAAA;AAAA,IAClC;AAAA,EAGN,GAEMG,IAAiB,MAAM;AAE3B,IAAAN,EAAW,IAAI,MAAO,0BAA2B,CAAE;AAAA,EAErD;AAEA,SAAAJ,EAAO,iBAAkB,WAAWM,CAAU,GAC9CN,EAAO,iBAAkB,SAASS,CAAQ,GAC1CT,EAAO,iBAAkB,gBAAgBU,CAAe,GAEjD;AAAA;AAAA,IAEL,UACEC,GACApD,GACAqD,GACA;AAEA,aAAKT,IAEI,QAAQ,OAAQ,IAAI,MAAO,sBAAuB,CAAE,IAItD,IAAI,QAGP,CAAEU,GAASC,MAAY;AAEzB,cAAMC,IAAO3B,GAAU,aAAA;AAEvB,QAAAc,EAAQ,IAAKa,GAAM,EAAE,SAAAF,GAAS,QAAAC,GAAU,GAExCd,EAAO;AAAA,UACL;AAAA,YACE,MAAAe;AAAA,YACA,MAAM;AAAA,YACN,aAAAJ;AAAA,YACA,OAAOpD,EAAK;AAAA,YACZ,iBAAiBA,EAAK;AAAA,YACtB,IAAIwC,EAAM;AAAA,YACV,IAAIA,EAAM;AAAA,YACV,IAAIA,EAAM;AAAA,YACV,iBAAAa;AAAA,UAAA;AAAA,UAEF,CAAED,CAAY;AAAA,QAAA;AAAA,MAGlB,CAAE;AAAA,IAEJ;AAAA;AAAA,IAEA,UAAW;AAET,MAAKR,MAELA,IAAW,IACXC,EAAW,IAAI,MAAO,sBAAuB,CAAE,GAC/CJ,EAAO,oBAAqB,WAAWM,CAAU,GACjDN,EAAO,oBAAqB,SAASS,CAAQ,GAC7CT,EAAO,oBAAqB,gBAAgBU,CAAe,GAC3DV,EAAO,UAAA;AAAA,IAET;AAAA,EAAA;AAGJ;AClcA,SAASgB,GACPC,GACAC,IAAiBD,EAAI,SAAS,OAC9B;AAEA,QAAME,IAAM,IAAIvG,GAAA,GACVwG,IAAY,IAAIxG,GAAA,GAChByG,IAAQJ,EAAI,SAAS;AAE3B,SAAAC,EAAK,kBAAmB,IAAM,EAAK,GACnCA,EAAK,gBAAiB,CAAEI,MAAsB;AAE5C,QAAKJ,MAASG,KAASC,MAAWD,EAAQ;AAE1C,QAAIb,IAA2Bc;AAE/B,WAAQd,KAAU;AAEhB,UAAKA,EAAQ,UAAU,eAAe,MAAQ;AAC9C,MAAAA,IAAUA,EAAQ;AAAA,IAEpB;AAEA,UAAMe,IAAaD;AAMnB,IAAK,CAACC,EAAW,UAAU,CAACA,EAAW,YAAY,CAACA,EAAW,WAE/DH,EAAU,UAAA,GACVA,EAAU,cAAeE,CAAO,GAE1BF,EAAU,aAEdD,EAAI,MAAOC,CAAU;AAAA,EAIzB,CAAE,GAEKD;AAET;AAMA,SAASK,GACPP,GACAlB,GACAmB,IAAiBD,EAAI,SAAS,OAC9B;AAEA,QAAMI,IAAQJ,EAAI,SAAS,OACrBQ,IAAWT,GAAuBC,GAAKC,CAAK,GAC5CQ,IAAwBR,MAASG,GACjCM,IAAoB,IAAIpH,EAAA;AAE9B,EAAA2G,EAAK,kBAAmB,IAAM,EAAK,GAE9BQ,KAEHR,EAAK,iBAAkBS,CAAkB;AAQ3C,QAAMC,IAAcF,IAClBC,EAAkB,MAAA,IAEhBF,EAAS,YACP,IAAIlH,MACJkH,EAAS,UAAW,IAAIlH,GAAU,GAElCsH,IAAU,IAAItH;AAAA,IAClBwF,EAAM;AAAA,IACNA,EAAM;AAAA,IACNA,EAAM;AAAA,EAAA,GAEF+B,IAAYF,EAAY,aAAcpH,EAAsB,GAC5DuH,IAAOF,EAAQ,MAAA,EAAQ,eAAgB,GAAI;AAEjD,SAAO,IAAIpH;AAAA,IACT,EAAE,GAAGsF,EAAM,OAAO,GAAGA,EAAM,QAAQ,GAAGA,EAAM,MAAA;AAAA,IAC5C;AAAA,MACE,MAAM+B,EAAU,IAAIC,EAAK;AAAA,MACzB,MAAMD,EAAU,IAAIC,EAAK;AAAA,MACzB,MAAMD,EAAU,IAAIC,EAAK;AAAA,MACzB,MAAMD,EAAU,IAAIC,EAAK;AAAA,MACzB,MAAMD,EAAU,IAAIC,EAAK;AAAA,MACzB,MAAMD,EAAU,IAAIC,EAAK;AAAA,IAAA;AAAA,EAC3B;AAGJ;ACtFA,IAAIC,IAAK,YAAYC,IAAM,aAAaC,KAAM,YAE1CC,KAAO,IAAIH,EAAG;AAAA,EAAC;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA;AAAA,EAAgB;AAAA,EAAG;AAAA;AAAA,EAAoB;AAAC,CAAC,GAE5II,KAAO,IAAIJ,EAAG;AAAA,EAAC;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAG;AAAA,EAAI;AAAA,EAAI;AAAA,EAAI;AAAA,EAAI;AAAA,EAAI;AAAA,EAAI;AAAA,EAAI;AAAA;AAAA,EAAiB;AAAA,EAAG;AAAC,CAAC,GAEnIK,KAAO,IAAIL,EAAG,CAAC,IAAI,IAAI,IAAI,GAAG,GAAG,GAAG,GAAG,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,EAAE,CAAC,GAEhFM,KAAO,SAAUC,GAAIxE,GAAO;AAE5B,WADId,IAAI,IAAIgF,EAAI,EAAE,GACTtE,IAAI,GAAGA,IAAI,IAAI,EAAEA;AACtB,IAAAV,EAAEU,CAAC,IAAII,KAAS,KAAKwE,EAAG5E,IAAI,CAAC;AAIjC,WADI6E,IAAI,IAAIN,GAAIjF,EAAE,EAAE,CAAC,GACZU,IAAI,GAAGA,IAAI,IAAI,EAAEA;AACtB,aAAS8E,IAAIxF,EAAEU,CAAC,GAAG8E,IAAIxF,EAAEU,IAAI,CAAC,GAAG,EAAE8E;AAC/B,MAAAD,EAAEC,CAAC,IAAMA,IAAIxF,EAAEU,CAAC,KAAM,IAAKA;AAGnC,SAAO,EAAE,GAAGV,GAAG,GAAGuF,EAAC;AACvB,GACIE,KAAKJ,GAAKH,IAAM,CAAC,GAAGQ,KAAKD,GAAG,GAAGE,KAAQF,GAAG;AAE9CC,GAAG,EAAE,IAAI,KAAKC,GAAM,GAAG,IAAI;AACxB,IAACC,KAAKP,GAAKF,IAAM,CAAC,GAAGU,KAAKD,GAAG,GAE5BE,KAAM,IAAId,EAAI,KAAK;AACvB,SAAStE,IAAI,GAAGA,IAAI,OAAO,EAAEA,GAAG;AAE5B,MAAIqF,KAAMrF,IAAI,UAAW,KAAOA,IAAI,UAAW;AAC/C,EAAAqF,KAAMA,IAAI,UAAW,KAAOA,IAAI,UAAW,GAC3CA,KAAMA,IAAI,UAAW,KAAOA,IAAI,SAAW,GAC3CD,GAAIpF,CAAC,MAAOqF,IAAI,UAAW,KAAOA,IAAI,QAAW,MAAO;AAC5D;AAIA,IAAIC,KAAQ,SAAUC,GAAIC,GAAI,GAAG;AAO7B,WANIC,IAAIF,EAAG,QAEPvF,IAAI,GAEJ0F,IAAI,IAAIpB,EAAIkB,CAAE,GAEXxF,IAAIyF,GAAG,EAAEzF;AACZ,IAAIuF,EAAGvF,CAAC,KACJ,EAAE0F,EAAEH,EAAGvF,CAAC,IAAI,CAAC;AAGrB,MAAI2F,IAAK,IAAIrB,EAAIkB,CAAE;AACnB,OAAKxF,IAAI,GAAGA,IAAIwF,GAAI,EAAExF;AAClB,IAAA2F,EAAG3F,CAAC,IAAK2F,EAAG3F,IAAI,CAAC,IAAI0F,EAAE1F,IAAI,CAAC,KAAM;AAEtC,MAAI4F;AACJ,MAAI,GAAG;AAEH,IAAAA,IAAK,IAAItB,EAAI,KAAKkB,CAAE;AAEpB,QAAIK,IAAM,KAAKL;AACf,SAAKxF,IAAI,GAAGA,IAAIyF,GAAG,EAAEzF;AAEjB,UAAIuF,EAAGvF,CAAC;AAQJ,iBANI8F,IAAM9F,KAAK,IAAKuF,EAAGvF,CAAC,GAEpB+F,IAAMP,IAAKD,EAAGvF,CAAC,GAEfgG,IAAIL,EAAGJ,EAAGvF,CAAC,IAAI,CAAC,OAAO+F,GAElBE,IAAID,KAAM,KAAKD,KAAO,GAAIC,KAAKC,GAAG,EAAED;AAEzC,UAAAJ,EAAGR,GAAIY,CAAC,KAAKH,CAAG,IAAIC;AAAA,EAIpC;AAGI,SADAF,IAAK,IAAItB,EAAImB,CAAC,GACTzF,IAAI,GAAGA,IAAIyF,GAAG,EAAEzF;AACjB,MAAIuF,EAAGvF,CAAC,MACJ4F,EAAG5F,CAAC,IAAIoF,GAAIO,EAAGJ,EAAGvF,CAAC,IAAI,CAAC,GAAG,KAAM,KAAKuF,EAAGvF,CAAC;AAItD,SAAO4F;AACX,IAEIM,IAAM,IAAI7B,EAAG,GAAG;AACpB,SAASrE,IAAI,GAAGA,IAAI,KAAK,EAAEA;AACvB,EAAAkG,EAAIlG,CAAC,IAAI;AACb,SAASA,IAAI,KAAKA,IAAI,KAAK,EAAEA;AACzB,EAAAkG,EAAIlG,CAAC,IAAI;AACb,SAASA,IAAI,KAAKA,IAAI,KAAK,EAAEA;AACzB,EAAAkG,EAAIlG,CAAC,IAAI;AACb,SAASA,IAAI,KAAKA,IAAI,KAAK,EAAEA;AACzB,EAAAkG,EAAIlG,CAAC,IAAI;AAEb,IAAImG,KAAM,IAAI9B,EAAG,EAAE;AACnB,SAASrE,IAAI,GAAGA,IAAI,IAAI,EAAEA;AACtB,EAAAmG,GAAInG,CAAC,IAAI;AAEV,IAAsCoG,KAAqB,gBAAAd,EAAKY,GAAK,GAAG,CAAC,GAEnCG,KAAqB,gBAAAf,EAAKa,IAAK,GAAG,CAAC,GAExEG,KAAM,SAAUjH,GAAG;AAEnB,WADI4G,IAAI5G,EAAE,CAAC,GACFW,IAAI,GAAGA,IAAIX,EAAE,QAAQ,EAAEW;AAC5B,IAAIX,EAAEW,CAAC,IAAIiG,MACPA,IAAI5G,EAAEW,CAAC;AAEf,SAAOiG;AACX,GAEIM,IAAO,SAAUC,GAAGC,GAAGR,GAAG;AAC1B,MAAIS,IAAKD,IAAI,IAAK;AAClB,UAASD,EAAEE,CAAC,IAAKF,EAAEE,IAAI,CAAC,KAAK,OAAQD,IAAI,KAAMR;AACnD,GAEIU,KAAS,SAAUH,GAAGC,GAAG;AACzB,MAAIC,IAAKD,IAAI,IAAK;AAClB,UAASD,EAAEE,CAAC,IAAKF,EAAEE,IAAI,CAAC,KAAK,IAAMF,EAAEE,IAAI,CAAC,KAAK,QAASD,IAAI;AAChE,GAEIG,KAAO,SAAUH,GAAG;AAAE,UAASA,IAAI,KAAK,IAAK;AAAG,GAGhDI,KAAM,SAAUb,GAAGP,GAAGqB,GAAG;AAGzB,UAAIA,KAAK,QAAQA,IAAId,EAAE,YACnBc,IAAId,EAAE,SAEH,IAAI3B,EAAG2B,EAAE,SAASP,GAAGqB,CAAC,CAAC;AAClC,GAsBIC,KAAK;AAAA,EACL;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACJ;AAAA,EACI;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA;AAEJ,GAEIC,IAAM,SAAUC,GAAKC,GAAKC,GAAI;AAC9B,MAAIL,IAAI,IAAI,MAAMI,KAAOH,GAAGE,CAAG,CAAC;AAIhC,MAHAH,EAAE,OAAOG,GACL,MAAM,qBACN,MAAM,kBAAkBH,GAAGE,CAAG,GAC9B,CAACG;AACD,UAAML;AACV,SAAOA;AACX,GAEIM,KAAQ,SAAUC,GAAKC,GAAIC,GAAKC,GAAM;AAEtC,MAAIC,IAAKJ,EAAI,QAAQK,IAA0B;AAC/C,MAAI,CAACD,KAAMH,EAAG,KAAK,CAACA,EAAG;AACnB,WAAOC,KAAO,IAAIlD,EAAG,CAAC;AAC1B,MAAIsD,IAAQ,CAACJ,GAETK,IAASD,KAASL,EAAG,KAAK,GAE1BO,IAAOP,EAAG;AAEd,EAAIK,MACAJ,IAAM,IAAIlD,EAAGoD,IAAK,CAAC;AAEvB,MAAIK,IAAO,SAAUpC,IAAG;AACpB,QAAIqC,KAAKR,EAAI;AAEb,QAAI7B,KAAIqC,IAAI;AAER,UAAIC,KAAO,IAAI3D,EAAG,KAAK,IAAI0D,KAAK,GAAGrC,EAAC,CAAC;AACrC,MAAAsC,GAAK,IAAIT,CAAG,GACZA,IAAMS;AAAA,IACV;AAAA,EACJ,GAEIC,IAAQX,EAAG,KAAK,GAAGY,IAAMZ,EAAG,KAAK,GAAGa,IAAKb,EAAG,KAAK,GAAGc,IAAKd,EAAG,GAAGe,IAAKf,EAAG,GAAGgB,IAAMhB,EAAG,GAAGiB,IAAMjB,EAAG,GAE/FkB,IAAOf,IAAK;AAChB,KAAG;AACC,QAAI,CAACW,GAAI;AAEL,MAAAH,IAAQ1B,EAAKc,GAAKa,GAAK,CAAC;AAExB,UAAIO,IAAOlC,EAAKc,GAAKa,IAAM,GAAG,CAAC;AAE/B,UADAA,KAAO,GACFO;AAiBA,YAAIA,KAAQ;AACb,UAAAL,IAAKhC,IAAMiC,IAAKhC,IAAMiC,IAAM,GAAGC,IAAM;AAAA,iBAChCE,KAAQ,GAAG;AAEhB,cAAIC,IAAOnC,EAAKc,GAAKa,GAAK,EAAE,IAAI,KAAKS,IAAQpC,EAAKc,GAAKa,IAAM,IAAI,EAAE,IAAI,GACnEU,IAAKF,IAAOnC,EAAKc,GAAKa,IAAM,GAAG,EAAE,IAAI;AACzC,UAAAA,KAAO;AAKP,mBAHIW,IAAM,IAAIxE,EAAGuE,CAAE,GAEfE,IAAM,IAAIzE,EAAG,EAAE,GACVrE,IAAI,GAAGA,IAAI2I,GAAO,EAAE3I;AAEzB,YAAA8I,EAAIpE,GAAK1E,CAAC,CAAC,IAAIuG,EAAKc,GAAKa,IAAMlI,IAAI,GAAG,CAAC;AAE3C,UAAAkI,KAAOS,IAAQ;AAKf,mBAHII,IAAMzC,GAAIwC,CAAG,GAAGE,MAAU,KAAKD,KAAO,GAEtCE,IAAM3D,EAAKwD,GAAKC,GAAK,CAAC,GACjB/I,IAAI,GAAGA,IAAI4I,KAAK;AACrB,gBAAI/D,IAAIoE,EAAI1C,EAAKc,GAAKa,GAAKc,EAAM,CAAC;AAElC,YAAAd,KAAOrD,IAAI;AAEX,gBAAIY,IAAIZ,KAAK;AAEb,gBAAIY,IAAI;AACJ,cAAAoD,EAAI7I,GAAG,IAAIyF;AAAA,iBAEV;AAED,kBAAIyD,IAAI,GAAGC,IAAI;AAOf,mBANI1D,KAAK,MACL0D,IAAI,IAAI5C,EAAKc,GAAKa,GAAK,CAAC,GAAGA,KAAO,GAAGgB,IAAIL,EAAI7I,IAAI,CAAC,KAC7CyF,KAAK,MACV0D,IAAI,IAAI5C,EAAKc,GAAKa,GAAK,CAAC,GAAGA,KAAO,KAC7BzC,KAAK,OACV0D,IAAI,KAAK5C,EAAKc,GAAKa,GAAK,GAAG,GAAGA,KAAO,IAClCiB;AACH,gBAAAN,EAAI7I,GAAG,IAAIkJ;AAAA,YACnB;AAAA,UACJ;AAEA,cAAIE,IAAKP,EAAI,SAAS,GAAGH,CAAI,GAAGW,IAAKR,EAAI,SAASH,CAAI;AAEtD,UAAAJ,IAAMhC,GAAI8C,CAAE,GAEZb,IAAMjC,GAAI+C,CAAE,GACZjB,IAAK9C,EAAK8D,GAAId,GAAK,CAAC,GACpBD,IAAK/C,EAAK+D,GAAId,GAAK,CAAC;AAAA,QACxB;AAEI,UAAAvB,EAAI,CAAC;AAAA,WAtEE;AAEP,YAAIvB,IAAImB,GAAKsB,CAAG,IAAI,GAAGxC,IAAI2B,EAAI5B,IAAI,CAAC,IAAK4B,EAAI5B,IAAI,CAAC,KAAK,GAAI6D,IAAI7D,IAAIC;AACnE,YAAI4D,IAAI7B,GAAI;AACR,UAAII,KACAb,EAAI,CAAC;AACT;AAAA,QACJ;AAEA,QAAIY,KACAE,EAAKK,IAAKzC,CAAC,GAEf6B,EAAI,IAAIF,EAAI,SAAS5B,GAAG6D,CAAC,GAAGnB,CAAE,GAE9Bb,EAAG,IAAIa,KAAMzC,GAAG4B,EAAG,IAAIY,IAAMoB,IAAI,GAAGhC,EAAG,IAAIW;AAC3C;AAAA,MACJ;AAuDA,UAAIC,IAAMM,GAAM;AACZ,QAAIX,KACAb,EAAI,CAAC;AACT;AAAA,MACJ;AAAA,IACJ;AAGA,IAAIY,KACAE,EAAKK,IAAK,MAAM;AAGpB,aAFIoB,MAAO,KAAKjB,KAAO,GAAGkB,MAAO,KAAKjB,KAAO,GACzCkB,IAAOvB,KACHuB,IAAOvB,GAAK;AAEhB,UAAIgB,IAAId,EAAGzB,GAAOU,GAAKa,CAAG,IAAIqB,EAAG,GAAGG,IAAMR,KAAK;AAE/C,UADAhB,KAAOgB,IAAI,IACPhB,IAAMM,GAAM;AACZ,QAAIX,KACAb,EAAI,CAAC;AACT;AAAA,MACJ;AAGA,UAFKkC,KACDlC,EAAI,CAAC,GACL0C,IAAM;AACN,QAAAnC,EAAIY,GAAI,IAAIuB;AAAA,eACPA,KAAO,KAAK;AACjB,QAAAD,IAAOvB,GAAKE,IAAK;AACjB;AAAA,MACJ,OACK;AACD,YAAIuB,IAAMD,IAAM;AAEhB,YAAIA,IAAM,KAAK;AAEX,cAAI1J,IAAI0J,IAAM,KAAKpK,IAAIkF,GAAKxE,CAAC;AAC7B,UAAA2J,IAAMpD,EAAKc,GAAKa,IAAM,KAAK5I,KAAK,CAAC,IAAI0F,GAAGhF,CAAC,GACzCkI,KAAO5I;AAAA,QACX;AAEA,YAAIkH,IAAI6B,EAAG1B,GAAOU,GAAKa,CAAG,IAAIsB,EAAG,GAAGI,KAAOpD,KAAK;AAChD,QAAKA,KACDQ,EAAI,CAAC,GACTkB,KAAO1B,IAAI;AACX,YAAI6C,IAAKlE,GAAGyE,EAAI;AAChB,YAAIA,KAAO,GAAG;AACV,cAAItK,IAAImF,GAAKmF,EAAI;AACjB,UAAAP,KAAM1C,GAAOU,GAAKa,CAAG,KAAK,KAAK5I,KAAK,GAAG4I,KAAO5I;AAAA,QAClD;AACA,YAAI4I,IAAMM,GAAM;AACZ,UAAIX,KACAb,EAAI,CAAC;AACT;AAAA,QACJ;AACA,QAAIY,KACAE,EAAKK,IAAK,MAAM;AACpB,YAAI9H,KAAM8H,IAAKwB;AACf,YAAIxB,IAAKkB,GAAI;AACT,cAAIQ,KAAQnC,IAAK2B,GAAIS,KAAO,KAAK,IAAIT,GAAIhJ,EAAG;AAG5C,eAFIwJ,KAAQ1B,IAAK,KACbnB,EAAI,CAAC,GACFmB,IAAK2B,IAAM,EAAE3B;AAChB,YAAAZ,EAAIY,CAAE,IAAIX,EAAKqC,KAAQ1B,CAAE;AAAA,QACjC;AACA,eAAOA,IAAK9H,IAAK,EAAE8H;AACf,UAAAZ,EAAIY,CAAE,IAAIZ,EAAIY,IAAKkB,CAAE;AAAA,MAC7B;AAAA,IACJ;AACA,IAAA/B,EAAG,IAAIc,GAAId,EAAG,IAAImC,GAAMnC,EAAG,IAAIa,GAAIb,EAAG,IAAIW,GACtCG,MACAH,IAAQ,GAAGX,EAAG,IAAIgB,GAAKhB,EAAG,IAAIe,GAAIf,EAAG,IAAIiB;AAAA,EACjD,SAAS,CAACN;AAEV,SAAOE,KAAMZ,EAAI,UAAUI,IAAQd,GAAIU,GAAK,GAAGY,CAAE,IAAIZ,EAAI,SAAS,GAAGY,CAAE;AAC3E,GAoOI4B,KAAmB,oBAAI1F,EAAG,CAAC;AAukBxB,SAAS2F,GAAYrL,GAAMsL,GAAM;AACpC,SAAO7C,GAAMzI,GAAM,EAAE,GAAG,EAAC,GAAIsL,GAAkBA,CAAuB;AAC1E;AA0bA,IAAIC,KAAK,OAAO,cAAe,OAA6B,oBAAI,YAAW,GAEvEC,KAAM;AACV,IAAI;AACA,EAAAD,GAAG,OAAOH,IAAI,EAAE,QAAQ,GAAI,CAAE,GAC9BI,KAAM;AACV,QACU;AAAE;AC9mDZ,MAAMC,KAAc,IAAI,YAAA;AAGxB,SAASC,GAAqBC,GAAe;AAE3C,SAAOA,EAAK,WAAY,MAAM,GAAI,EAAE,QAAS,UAAU,EAAG;AAE5D;AAGA,SAASC,EAAaC,GAAgBjK,GAAiB;AAErD,SAAOiK,EAAK,UAAWjK,GAAQ,EAAK;AAEtC;AAGA,SAASkK,EAAaD,GAAgBjK,GAAiB;AAErD,SAAOiK,EAAK,UAAWjK,GAAQ,EAAK;AAEtC;AAGA,SAASmK,GAAkCzI,GAAoB;AAE7D,QAAM0I,IAAY,KAAK,IAAK,GAAG1I,EAAM,SAAS,QAAS,EAAG;AAE1D,WAAU1B,IAAS0B,EAAM,SAAS,IAAI1B,KAAUoK,GAAWpK;AAEzD,QACE0B,EAAO1B,CAAO,MAAM,MACpB0B,EAAO1B,IAAS,CAAE,MAAM,MACxB0B,EAAO1B,IAAS,CAAE,MAAM,KACxB0B,EAAO1B,IAAS,CAAE,MAAM;AAGxB,aAAOA;AAMX,QAAM,IAAI,MAAO,yCAA0C;AAE7D;AAGA,MAAMqK,GAAW;AAAA,EAEfC;AAAA,EAEAC;AAAA,EAEAC,yBAAe,IAAA;AAAA,EAEf,YAAc9I,GAAkC;AAE9C,SAAK4I,KAAS5I,aAAiB,aAAaA,IAAQ,IAAI,WAAYA,CAAM,GAC1E,KAAK6I,KAAQ,IAAI;AAAA,MACf,KAAKD,GAAO;AAAA,MACZ,KAAKA,GAAO;AAAA,MACZ,KAAKA,GAAO;AAAA,IAAA,GAGd,KAAKG,GAAA;AAAA,EAEP;AAAA;AAAA,EAGA,IAAMV,GAAe;AAEnB,WAAO,KAAKS,GAAS,IAAKV,GAAoBC,CAAK,CAAE;AAAA,EAEvD;AAAA;AAAA,EAGA,KAAOA,GAAe;AAEpB,UAAMW,IAAYZ,GAAoBC,CAAK,GACrCY,IAAQ,KAAKH,GAAS,IAAKE,CAAU;AAE3C,QAAK,CAACC;AAEJ,YAAM,IAAI,MAAO,yBAAyBD,CAAS,EAAG;AAIxD,UAAME,IAAcD,EAAM;AAG1B,QAFkBT,EAAY,KAAKK,IAAOK,CAAY,MAEnC;AAEjB,YAAM,IAAI,MAAO,iCAAiCF,CAAS,EAAG;AAIhE,UAAMG,IAAiBb,EAAY,KAAKO,IAAOK,IAAc,EAAG,GAC1DE,IAAmBd,EAAY,KAAKO,IAAOK,IAAc,EAAG,GAC5DG,IAAYH,IAAc,KAAKC,IAAiBC,GAChDE,IAAUD,IAAYJ,EAAM,gBAC5BM,IAAiB,KAAKX,GAAO,MAAOS,GAAWC,CAAQ;AAE7D,QAAKL,EAAM,sBAAsB;AAE/B,aAAOM;AAIT,QAAKN,EAAM,sBAAsB;AAE/B,aAAOlB,GAAawB,CAAe;AAIrC,UAAM,IAAI;AAAA,MACR,uCAAuCN,EAAM,iBAAiB,QAAQD,CAAS;AAAA,IAAA;AAAA,EAGnF;AAAA;AAAA,EAGA,SAAWX,GAAe;AAExB,WAAOF,GAAY,OAAQ,KAAK,KAAME,CAAK,CAAE;AAAA,EAE/C;AAAA;AAAA,EAGA,SAAcA,GAAe;AAE3B,WAAO,KAAK,MAAO,KAAK,SAAUA,CAAK,CAAE;AAAA,EAE3C;AAAA;AAAA,EAGAU,KAAgB;AAEd,UAAMS,IAAYf,GAAiC,KAAKG,EAAO,GACzDa,IAAenB,EAAY,KAAKO,IAAOW,IAAY,EAAG;AAG5D,QAAIlL,IAF2BkK,EAAY,KAAKK,IAAOW,IAAY,EAAG;AAItE,aAAUE,IAAQ,GAAGA,IAAQD,GAAcC,KAAU;AAInD,UAFkBlB,EAAY,KAAKK,IAAOvK,CAAO,MAE9B;AAEjB,cAAM,IAAI,MAAO,sCAAuC;AAI1D,YAAMqL,IAAoBrB,EAAY,KAAKO,IAAOvK,IAAS,EAAG,GACxDsL,IAAiBpB,EAAY,KAAKK,IAAOvK,IAAS,EAAG,GACrD6K,IAAiBb,EAAY,KAAKO,IAAOvK,IAAS,EAAG,GACrD8K,IAAmBd,EAAY,KAAKO,IAAOvK,IAAS,EAAG,GACvDuL,IAAgBvB,EAAY,KAAKO,IAAOvK,IAAS,EAAG,GACpDwL,IAAoBtB,EAAY,KAAKK,IAAOvK,IAAS,EAAG,GACxDyL,IAAgBzL,IAAS,IACzB0L,IAAcD,IAAgBZ,GAC9Bd,IAAOD;AAAA,QACXD,GAAY,OAAQ,KAAKS,GAAO,MAAOmB,GAAeC,CAAY,CAAE;AAAA,MAAA;AAGtE,WAAKlB,GAAS,IAAKT,GAAM;AAAA,QACvB,MAAAA;AAAA,QACA,mBAAAsB;AAAA,QACA,gBAAAC;AAAA,QACA,mBAAAE;AAAA,MAAA,CACA,GAEFxL,IAAS0L,IAAcZ,IAAmBS;AAAA,IAE5C;AAAA,EAEF;AAEF;ACpJA,eAAeI,GACb5I,GACA6I,GACAC,GACAC,IAA2B,CAAA,GAC3B;AAEA,QAAMC,IAAkB,CAAE,eAAe,gBAAgB,QAAS,GAE5DC,IAAW,MAAM,MAAOJ,CAAI;AAElC,MAAK,CAACI,EAAS;AAEb,UAAM,IAAI,MAAO,QAAQA,EAAS,MAAM,IAAIA,EAAS,UAAU,KAAKJ,CAAG,EAAG;AAI5E,QAAMK,IAAU,IAAI5B,GAAY,MAAM2B,EAAS,aAAc,GACvDE,IAAQJ,EAAQ,QAElBG,EAAQ,IAAK,GAAGH,EAAQ,KAAK,iBAAkB,IAC7CA,EAAQ,QACR,SAEJC,EAAgB,KAAM,CAAA1M,MAAQ4M,EAAQ,IAAK,GAAG5M,CAAI,iBAAkB,CAAE;AAExE,MAAK,CAAC6M;AAEJ,UAAM,IAAI;AAAA,MACRJ,EAAQ,QACN,6BAA6BA,EAAQ,KAAK,KAC1C;AAAA,IAAA;AAKN,QAAMjN,IAAWoN,EAAQ,SAA8B,GAAGC,CAAK,iBAAkB,GAC3E5L,IAAQ2L,EAAQ,SAAsB,GAAGC,CAAK,aAAc,GAC5DrK,IAA4B;AAAA,IAChC,OAAOhD,EAAS,QAAQ,MAAO,CAAE;AAAA,IACjC,QAAQA,EAAS,QAAQ,MAAO,CAAE;AAAA,IAClC,OAAOA,EAAS,QAAQ,MAAO,CAAE;AAAA,EAAA,GAE7BK,IAAcL,EAAS,QAAQ,MAAO,CAAE,GACxCsN,IAAwB5L;AAAA,IAC5B1B;AAAA,IACAyB;AAAA,IACApB;AAAA,IACA4M,EAAQ;AAAA,EAAA,GAEJM,IAAiB,KAAK;AAAA,IAC1B,KAAK,IAAKN,EAAQ,kBAAkB,GAAG,CAAE;AAAA,IACzC,KAAK,IAAK,GAAGK,CAAsB;AAAA,EAAA,GAE/BhM,IAAsBgB;AAAA,IAC1BiL;AAAA,IACAD;AAAA,IACAjN;AAAA,IACAoB;AAAA,EAAA,GAEIf,IAAS,MAAM,KAAM,EAAE,QAAQL,EAAA,GAAgB,MAAA;AAAA,GAAiD,GAChGmN,wBAAuB,IAAA,GACvBC,IAAc1K,GAAyBC,CAAM;AACnD,MAAII,IAAW,IACXsK,IAAoC;AAMxC,QAAMC,IAAoB,MAAM;AAE9B,QAAKvK,KAAY,CAACsK,EAAe,QAAOA;AAExC,UAAME,IAAiB,KAAK;AAAA,MAC1B,KAAK,IAAK,OAAQF,EAAa,SAAS,qBAAqBH,CAAe,GAAG,CAAE;AAAA,MACjFD;AAAA,IAAA,GAEIO,IAAoBvL;AAAA,MACxBsL;AAAA,MACAN;AAAA,MACAjN;AAAA,MACAoB;AAAA,IAAA,GAEIqM,IAAmBzM,GAAyBX,GAAQmN,CAAkB;AAE5E,QAAKC,IAAmB,EAAI,QAAOJ;AAEnC,UAAMK,IAAYrN,EAAQoN,CAAiB;AAE3C,WAAMC,MAENL,EAAa,SAAS,qBAAqBzL;AAAA,MACzC6L;AAAA,MACAR;AAAA,MACAjN;AAAA,MACAoB;AAAA,IAAA,GAEFiM,EAAa,SAAS,wBAAwBI,GAEzCJ,EAAa,SAAS,eAAeI,MAExCJ,EAAa,SAAS,aAAaI,GACnCJ,EAAa,WAAYK,CAAU,GAC9B7J,EAAI,OAAA,KAIJwJ;AAAA,EAET,GAGMM,IAA4B,CAAEzN,MAA6B;AAE/D,QAAK6C,EAAW,QAAO,QAAQ,QAAA;AAE/B,UAAMjB,IAAuBJ,EAAiBxB,GAAiBF,CAAY,GACrE,EAAE,MAAAG,GAAM,iBAAiByN,EAAA,IAA6B9N;AAAA,MAC1DH;AAAA,MACAmC;AAAA,IAAA;AAGF,QAAK1B,GAAqBC,GAAQuN,GAAyBzN,EAAK,MAAO;AAErE,aAAO,QAAQ,QAAA;AAIjB,UAAM0N,IAAWV,EAAiB,IAAKS,CAAwB;AAE/D,QAAKC,EAAW,QAAOA;AAEvB,UAAMC,KAAS,YAAY;AAEzB,UAAI;AAEF,cAAMC,KAAYvO,GAAkB,GAAGwN,CAAK,IAAI7M,EAAK,GAAG,EAAG,GACrD6N,KAAajB,EAAQ,KAAMgB,EAAU,GACrC,EAAE,QAAQE,GAAa,iBAAAzK,EAAA,IAAqB,MAAM4J,EAAY;AAAA,UAClE7K,GAA2ByL,EAAW;AAAA,UACtC7N;AAAA,UACAyN;AAAA,QAAA;AAGF,YAAK7K,EAAW;AAEhB,cAAMmL,IAAsBxM,EAAiB8B,GAAiBxD,CAAY,GACpEmO,IAAgB,KAAK;AAAA,UACzBF,EAAY;AAAA,UACZjO,IAAckO;AAAA,QAAA;AAGhB,iBAAU3N,IAAI,GAAGA,IAAI4N,GAAe5N;AAElC,UAAAF,EAAQ6N,IAAsB3N,CAAE,IAAI0N,EAAa1N,CAAE;AAIrD,QAAA+M,EAAA;AAAA,MAEF,UAAA;AAEE,QAAAH,EAAiB,OAAQS,CAAwB;AAAA,MAEnD;AAAA,IAEF,GAAA;AAEA,WAAAT,EAAiB,IAAKS,GAAyBE,CAAK,GAE7CA;AAAA,EAET,GAGMM,IAAuB,CAAEzM,MAAwB;AAErD,UAAMG,IAAuBJ,EAAiBC,GAAY3B,CAAY,GAChE,EAAE,iBAAAE,MAAqBJ;AAAA,MAC3BH;AAAA,MACAmC;AAAA,IAAA;AAGF,WAAO6L,EAA2BzN,CAAgB;AAAA,EAEpD,GAGMmO,IAAyB,CAAEC,GAAqBC,MAAuB;AAE3E,QAAKxL,EAAW,QAAO,QAAQ,QAAA;AAE/B,UAAMpB,IAAaM;AAAA,MACjBqM;AAAA,MACArB;AAAA,MACAjN;AAAA,MACAoB;AAAA,IAAA,GAEIoN,IAAkBvM;AAAA,MACtBsM;AAAA,MACAtB;AAAA,MACAjN;AAAA,MACAoB;AAAA,IAAA,GAEIqN,IAAmBjO;AAAA,MACvBb;AAAA,MACAgC;AAAA,MACA6M;AAAA,IAAA;AAGF,WAAO,QAAQ;AAAA,MACbC,EAAiB,IAAK,CAAAjL,MAAmBmK,EAA2BnK,CAAgB,CAAE;AAAA,IAAA,EACtF,KAAM,MAAA;AAAA,KAAgB;AAAA,EAE1B,GAGMkL,IAAqB,CAAEnB,MAA4B;AAEvD,UAAMoB,IAAc,KAAK;AAAA,MACvBpB,IAAiBhO;AAAA,MACjB0N;AAAA,IAAA;AAGF,IAAKoB,EAAwBd,GAAgBoB,CAAY,EACtD,MAAO,OAAS,QAAQ,MAAO,6BAA6B1L,CAAM,CAAE;AAAA,EAEzE;AAGA,QAAMoL;AAAA,IACJnB;AAAA,IACA,KAAK;AAAA,MACHA,IAAiB3N;AAAA,MACjB0N;AAAA,IAAA;AAAA,EACF;AAGF,QAAM2B,IAAQvO,EAAQY,CAAoB,GACpC4N,IAAoB5N;AAE1B,MAAK,CAAC2N;AAEJ,UAAM,IAAI,MAAO,gCAAiC;AAIpD,QAAME,IAAUlC,EAAQ,WAAWA,EAAQ,SACzC,IAAIvP,GAASuP,EAAQ,SAASA,EAAQ,MAAO,IAC7CxI;AAAA,IACEP;AAAA,IACAlB;AAAA,IACAgK,KAAU9I,EAAI,SAAS;AAAA,EAAA,GAErBkL,IAASD,EAAQ,GAAG,UAAW,IAAI3R,GAAU;AAEnD,EAAAkQ,IAAe,IAAIhP,GAAcsE,CAAM,GAGvC0K,EAAa,OAAO,OAAOL,CAAK,IAChCK,EAAa,SAAS,aAAa,OACnCA,EAAa,SAAS,QAAQ,OAC9BA,EAAa,SAAS,WAAWL,GACjCK,EAAa,SAAS,SAASX,GAC/BW,EAAa,SAAS,aAAawB,GACnCxB,EAAa,SAAS,oBAAoBH,GAC1CG,EAAa,SAAS,wBAAwBwB,GAC9CxB,EAAa,SAAS,qBAAqBH,GAC3CG,EAAa,SAAS,iBAAiBrN,GACvCqN,EAAa,SAAS,2BAA2BJ,GACjDI,EAAa,SAAS,oBAAoBH,GAC1CG,EAAa,SAAS,iBAAiB,CAAE1L,MACvCC,GAAkBD,GAAYsL,GAAuBjN,GAAaoB,CAAM,GAC1EiM,EAAa,SAAS,iBAAiB,CAAEnL,MACvCD,EAAkBC,GAAS+K,GAAuBjN,GAAaoB,CAAM,GACvEiM,EAAa,SAAS,wBAAwB,CAC5CiB,GACAC,IAAYD,IAAc/O,OACvB8O,EAAwBC,GAAaC,CAAU,GACpDlB,EAAa,WAAYuB,CAAM,GAC/BvB,EAAa,MAAM,KAAMyB,EAAQ,IAAK,GACtCzB,EAAa,SAAS,KAAM0B,CAAO,GACnC1B,EAAa,aAAcpQ,EAAe,GAC1CoQ,EAAa,SAAS,SAAS,OAAO,QACpCL,MAAU,iBAAiB9O,KAAoBE,IAEjDiP,EAAa,SAAS,SAAS,OAAO,QAAQL,MAAU,iBAAiB,IAAM,GAC/EK,EAAa,iBAAiB,CAAE2B,GAAWC,GAAQC,MAAY;AAE7D,IAAA7B,EAAa,aAAc6B,EAAO,QAAS;AAAA,EAE7C;AAGA,QAAMC,KAAsB,MAAM;AAEhC,IAAKpM,MAELA,IAAW,IACXoK,EAAiB,MAAA,GACjBC,EAAY,QAAA;AAAA,EAEd;AAEA,SAAAC,EAAa,iBAAkB,WAAW8B,EAAoB,GAC9D9B,EAAa,SAAS,aAAa8B,IAGnC9B,EAAa,SAAS,cAAc,OAAQ1L,MAAwB;AAElE,QAAKoB,EAAW,QAAOsK;AAEvB,UAAMvL,IAAuBJ,EAAiBC,GAAY3B,CAAY,GAChE2O,IAAc/M;AAAA,MAClBE;AAAA,MACAmL;AAAA,MACAjN;AAAA,MACAoB;AAAA,IAAA;AAGF,WAAAiM,EAAa,SAAS,oBAAoBsB,GAC1CD,EAAoBC,CAAY,GAChCrB,EAAA,GACA,MAAMc,EAAsBtM,CAAqB,GACjDwL,EAAA,GACKzJ,EAAI,OAAA,GAEFwJ;AAAA,EAET,GAGAA,EAAa,SAAS,aAAa,OAAQnL,MAAqB;AAE9D,UAAMkN,IAAiB,KAAK;AAAA,MAC1B,KAAK,IAAK,OAAO,SAAUlN,CAAQ,IAAIA,IAAU,GAAG,CAAE;AAAA,MACtD+K;AAAA,IAAA,GAEIoC,IAAiBpN;AAAA,MACrBmN;AAAA,MACAnC;AAAA,MACAjN;AAAA,MACAoB;AAAA,IAAA;AAGF,WAAAiM,EAAa,SAAS,oBAAoB+B,GAC1CV,EAAoBU,CAAe,GACnC9B,EAAA,GACA,MAAMc,EAAsBiB,CAAe,GAC3C/B,EAAA,GACKzJ,EAAI,OAAA,GAEFwJ;AAAA,EAET,GAEAqB,EAAoBxB,CAAe,GACnCrJ,EAAI,aAAcwJ,GAAcV,CAAO,GAClC9I,EAAI,OAAA,GAEFwJ;AAET;AC1SA,IAAIiC,KAAc;AAElB,SAASC,GAAiBC,GAAiB;AAEzC,QAAMC,IAAe,OAAQD,CAAM;AAEnC,SAAO,OAAO,SAAUC,CAAa,IACnCA,IACA;AAEJ;AAEO,MAAMC,WAAmBC,GAAqC;AAAA,EAanE,YAAuB9L,GAAgB+I,IAA8B,IAAK;AAExE,UAAA,GAFqB,KAAA,MAAA/I,GAGrB,KAAK,WAAW,EAAE,GAAG+I,EAAA;AAAA,EAEvB;AAAA,EAhBQ;AAAA,EACA,WAA2B,CAAA;AAAA,EAC3B,gBAAqC;AAAA,EACrC,WAAW;AAAA,EACX,SAAS;AAAA,EACT,iBAAiB;AAAA,EACjB,mBAAmB;AAAA,EACnB,2BAA2B;AAAA,EAC3B,0BAA0B;AAAA,EAC1B,cAAc,eAAe,EAAE0C,EAAW;AAAA,EASlD,IAAI,KAAM;AAER,WAAO,KAAK;AAAA,EAEd;AAAA,EAEA,IAAI,UAAW;AAEb,WAAO,CAAE,GAAG,KAAK,QAAS;AAAA,EAE5B;AAAA,EAEA,IAAI,eAAgB;AAElB,WAAO,KAAK;AAAA,EAEd;AAAA,EAEA,IAAI,YAAa;AAEf,WAAO,KAAK;AAAA,EAEd;AAAA,EAEA,WAAa1C,GAAuC;AAElD,gBAAK,WAAW;AAAA,MACd,GAAG,KAAK;AAAA,MACR,GAAGA;AAAA,IAAA,GAGE;AAAA,EAET;AAAA,EAEA,WAA8B;AAE5B,UAAMgD,IAAe,KAAK,eACpBC,IAAkB,KAAK;AAAA,MAC3BD;AAAA,MACA,KAAK,gBAAiBA,CAAa;AAAA,IAAA;AAGrC,WAAO;AAAA,MACL,cAAAA;AAAA,MACA,aAAaA,IAAe,KAAK,SAAS,QAASA,CAAa,IAAI;AAAA,MACpE,SAAS,CAAE,GAAG,KAAK,QAAS;AAAA,MAC5B,OAAO,KAAK,SAAS;AAAA,MACrB,SAAS,KAAK;AAAA,MACd,OAAOA,GAAc,UAAU;AAAA,MAC/B,QAAUA,GAAc,UAAU,aAAuD;AAAA,MACzF,gBAAgB,KAAK,gBAAiBA,GAAcC,CAAgB;AAAA,MACpE,iBAAAA;AAAA,MACA,aAAa,KAAK,aAAcD,CAAa;AAAA,MAC7C,aAAa,OAAQA,GAAc,UAAU,kBAAkB,CAAE;AAAA,MACjE,oBAAoB,KAAK,uBAAwBA,CAAa;AAAA,IAAA;AAAA,EAGlE;AAAA,EAEA,MAAM,KACJE,GACAlD,IAAkC,IAClC;AAEA,UAAMmD,IAAU,MAAM,KAAK,oBAAqBD,CAAM;AAEtD,SAAK,MAAA,GAEAlD,EAAQ,oBAAoB,MAE/B,KAAK,OAAQ,EAAM;AAIrB,UAAMoD,IAAU,MAAM,QAAQ;AAAA,MAC5BD,EAAQ,IAAK,CAAAE,MAAU,KAAK,SAAUA,GAAQrD,CAAQ,CAAE;AAAA,IAAA,GAEpDsD,IAAc,KAAK;AAAA,MACvB,KAAK,IAAKtD,EAAQ,eAAe,GAAG,CAAE;AAAA,MACtC,KAAK,IAAKoD,EAAQ,SAAS,GAAG,CAAE;AAAA,IAAA;AAGlC,SAAK,iBAAkBA,EAASE,CAAY,KAAK,KAAK,SAAU,CAAE,KAAK,MAAM,EAAM;AAEnF,UAAMC,IAAQ,KAAK,SAAA;AAEnB,gBAAK,cAAe;AAAA,MAClB,MAAM;AAAA,MACN,SAAAJ;AAAA,MACA,SAAAC;AAAA,MACA,OAAAG;AAAA,IAAA,CACA,GACF,KAAK,cAAe;AAAA,MAClB,MAAM;AAAA,MACN,OAAAA;AAAA,IAAA,CACA,GAEKH;AAAA,EAET;AAAA,EAEA,QAAS;AAEP,WAAO,KAAK,OAAQ,EAAK;AAAA,EAE3B;AAAA,EAEA,gBAAkBI,GAAgD;AAEhE,UAAMC,IAAS,KAAK,eAAgBD,CAAO;AAE3C,WAAO,KAAK,iBAAkBC,CAAO;AAAA,EAEvC;AAAA,EAEA,MAAM,QACJnO,GACA0K,IAGI,IACJ;AAEA,UAAMyD,IAAS,KAAK,eAAgBzD,EAAQ,MAAO,GAC7C0D,IAAUD,GAAQ,UAAU;AAIlC,QAAK,CAACA,KAAU,OAAOC,KAAY,mBAAoBD,KAAU;AAEjE,UAAM1B,IAAc,KAAK;AAAA,MACvB,KAAK,IAAK,OAAQzM,KAAW,CAAE,GAAG,CAAE;AAAA,MACpC,KAAK,aAAcmO,CAAO;AAAA,IAAA;AAG5B,QAAI;AAEF,YAAMvC,IAAOwC,EAAS3B,CAAY;AAElC,aAAK/B,EAAQ,SAAS,KAEpB,QAAQ,QAASkB,CAAK,EACnB,KAAM,YAAY;AAEjB,cAAM,KAAK,IAAI,OAAA,GACf,KAAK,cAAe;AAAA,UAClB,MAAM;AAAA,UACN,OAAO,KAAK,SAAA;AAAA,QAAS,CACrB;AAAA,MAEJ,CAAE,EACD,MAAO,CAAA7K,MAAS;AAEf,aAAK,MAAA,GACL,KAAK,cAAe;AAAA,UAClB,MAAM;AAAA,UACN,OAAAA;AAAA,QAAA,CACA;AAAA,MAEJ,CAAE,KAIJ,MAAM6K,GACN,MAAM,KAAK,IAAI,OAAA,GACf,KAAK,cAAe;AAAA,QAClB,MAAM;AAAA,QACN,OAAO,KAAK,SAAA;AAAA,MAAS,CACrB,IAIGuC;AAAA,IAET,SAAUpN,GAAQ;AAEhB,iBAAK,MAAA,GACL,KAAK,cAAe;AAAA,QAClB,MAAM;AAAA,QACN,OAAAA;AAAA,MAAA,CACA,GACIA;AAAA,IAER;AAAA,EAEF;AAAA,EAEA,KAAOmN,GAAiD;AAEtD,UAAMC,IAAS,KAAK,eAAgBD,CAAO;AAE3C,QAAK,CAACC,EAAS,QAAO;AAEtB,UAAME,IAAc,KAAK,aAAcF,CAAO;AAE9C,QAAKE,KAAe;AAElB,kBAAK,MAAA,GACE;AAIT,SAAK,iBAAkBF,GAAQ,EAAM,GAEhC,KAAK,YAER,KAAK,MAAA;AAIP,UAAMR,IAAkB,KAAK;AAAA,MAC3BQ;AAAA,MACA,KAAK,gBAAiBA,CAAO;AAAA,IAAA;AAG/B,SAAK,WAAW,IAChB,KAAK,iBAAiB,YAAY,IAAA,GAClC,KAAK,mBAAmBR,KAAmBU,IAAc,IAAIV,GAC7D,KAAK,2BAA2B,IAChC,KAAK,0BAA0B,KAAK,uBAAwBQ,CAAO,GAE9DR,KAAmBU,KAEjB,KAAK,QAAS,CAAE,GAIvB,KAAK,cAAe;AAAA,MAClB,MAAM;AAAA,MACN,OAAO,KAAK,SAAA;AAAA,IAAS,CACrB;AAEF,UAAMC,IAAO,MAAM;AAEjB,YAAMZ,IAAe,KAAK;AAE1B,UAAK,CAAC,KAAK,YAAY,CAACA,EAAe;AAEvC,YAAMa,IAAqB,KAAK,aAAcb,CAAa;AAE3D,UAAKa,KAAsB,GAAI;AAE7B,aAAK,MAAA;AACL;AAAA,MAEF;AAEA,YAAMC,KAAe,YAAY,IAAA,IAAQ,KAAK,kBAAmB,KAC3DC,IAAiB,KAAK;AAAA,QAC1BF;AAAA,QACA,KAAK,mBAAmBC;AAAA,MAAA,GAEpBE,IAAoB,KAAK;AAAA,QAC7BhB;AAAA,QACAe;AAAA,MAAA;AAGF,MAAKC,MAAsB,KAAK,6BAE9B,KAAK,2BAA2BA,GAC3B,KAAK,QAASD,GAAgB;AAAA,QACjC,MAAM;AAAA,QACN,QAAQf;AAAA,MAAA,CACR;AAIJ,YAAMiB,IAAqB,KAAK,uBAAwBjB,CAAa,GAC/DC,IAAkB,KAAK;AAAA,QAC3BD;AAAA,QACAe;AAAA,MAAA;AAcF,UAXKE,MAAuB,KAAK,4BAE/B,KAAK,0BAA0BA,GAC/B,KAAK,cAAe;AAAA,QAClB,MAAM;AAAA,QACN,OAAO,KAAK,SAAA;AAAA,MAAS,CACrB,GACG,KAAK,IAAI,OAAA,IAKdF,KAAkBF,KAClBZ,KAAmBY,IAAqB,MACxC;AAEA,aAAK,MAAA;AACL;AAAA,MAEF;AAEA,WAAK,SAAS,WAAW,sBAAuBD,CAAK;AAAA,IAEvD;AAEA,gBAAK,SAAS,WAAW,sBAAuBA,CAAK,GAE9C;AAAA,EAET;AAAA,EAEA,QAAS;AAEP,WAAK,CAAC,KAAK,YAAY,CAAC,KAAK,SAAgB,MAE7C,KAAK,WAAW,IAEX,KAAK,WAER,WAAW,qBAAsB,KAAK,MAAO,GAC7C,KAAK,SAAS,IAIhB,KAAK,cAAe;AAAA,MAClB,MAAM;AAAA,MACN,OAAO,KAAK,SAAA;AAAA,IAAS,CACrB,GAEK;AAAA,EAET;AAAA,EAEA,WAAaJ,GAAiD;AAE5D,WAAO,KAAK,WACV,CAAC,KAAK,UACN,KAAK,KAAMA,CAAO;AAAA,EAEtB;AAAA,EAEA,UAAW;AAET,SAAK,MAAA,GACL,KAAK,OAAQ,EAAM;AAAA,EAErB;AAAA,EAEA,MAAc,SACZH,GACArD,GACA;AAEA,UAAMkE,IAAU,KAAK,eAAgBb,CAAO;AAE5C,QAAK,CAACa;AAEJ,YAAM,IAAI,MAAO,8BAA+B;AAIlD,UAAMC,IAAc,KAAK,YAAaD,GAASb,CAAO;AAEtD,SAAK,kBAAmBc,GAAad,CAAO;AAE5C,UAAM5C,IAAe,MAAMZ;AAAA,MACzB,KAAK;AAAA,MACLsE;AAAA,MACA,KAAK,eAAgBd,CAAO;AAAA,MAC5B;AAAA,QACE,OAAOrD,EAAQ;AAAA,QACf,SAASqD,EAAO;AAAA,QAChB,QAAQA,EAAO;AAAA,QACf,uBACEV,GAAgBU,EAAO,cAAe,KACtCrD,EAAQ;AAAA,QACV,gBACE2C,GAAgBU,EAAO,cAAe,KACtCrD,EAAQ,kBACR;AAAA,MAAA;AAAA,IACJ;AAGF,IAAAS,EAAa,OAAO4C,EAAO,QAAQ5C,EAAa,MAChDA,EAAa,UAAU4C,EAAO,YAAY,IAC1C5C,EAAa,SAAS,eAAe,KAAK,IAC1CA,EAAa,SAAS,YAAY4C,GAClC5C,EAAa,SAAS,YAAY4C,EAAO,QACzC5C,EAAa,SAAS,KAAK4C,EAAO,IAClC5C,EAAa,SAAS,MAAM4C,EAAO;AAEnC,UAAMe,IAAY,MAAM;AAEtB,MAAA3D,EAAa,oBAAqB,WAAW2D,CAAU,GACvD,QAAQ,eAAgB3D,EAAa,UAAU,qBAAsB,GACrE,KAAK,eAAgBA,CAAa;AAAA,IAEpC;AAEA,WAAAA,EAAa,SAAS,sBAAsB2D,GAC5C3D,EAAa,iBAAkB,WAAW2D,CAAU,GACpD,KAAK,aAAc3D,CAAa,GAEzBA;AAAA,EAET;AAAA,EAEQ,YAAc5N,GAAcwQ,GAA6B;AAE/D,WAAO,KAAK,SAAS,aAAcxQ,GAAMwQ,CAAO,KAAKxQ;AAAA,EAEvD;AAAA,EAEQ,eAAiBwQ,GAA6B;AAEpD,WAAKA,KAAU,QAAQ,IAAKA,GAAQ,QAAS,IAEpCA,EAAO,SAIT,KAAK,SAAS,gBAAiBA,CAAO,KAAK;AAAA,EAEpD;AAAA,EAEA,MAAc,oBAAsBH,GAA+B;AAEjE,QAAKA,KAAS;AAEZ,aAAO,KAAK,kBAAmBA,CAAM;AAIvC,QAAIC,IAA+B,CAAA;AAEnC,QAAI;AAIF,MAAAA,KAFsB,MAAM,KAAK,SAAS,aAAA,KAEb,CAAA,GAC1B,OAAQ,CAAAE,MAAUA,EAAO,YAAY,MAAS,CAAC,CAAC,KAAK,eAAgBA,CAAO,CAAE,EAC9E,KAAM,CAAE,GAAGpQ,OAAS,EAAE,SAAS,MAAQA,EAAE,SAAS,EAAI;AAAA,IAE3D,SAAUoD,GAAQ;AAEhB,UAAK,CAAC,KAAK,SAAS;AAElB,cAAMA;AAAA,IAIV;AAEA,WAAK8M,EAAQ,SAAgBA,IAExB,KAAK,SAAS,cAEV,CAAE,EAAE,MAAM,KAAK,SAAS,aAAe,IAIzC,CAAA;AAAA,EAET;AAAA,EAEQ,kBAAoBD,GAA8B;AAIxD,YAFmB,MAAM,QAASA,CAAM,IAAIA,IAAQ,CAAEA,CAAM,GAGzD;AAAA,MAAK,OACJ,OAAO3P,KAAS,WACd,EAAE,MAAMA,MACRA;AAAA,IAAA,EAEH,OAAQ,CAAA8P,MAAU,CAAC,CAAC,KAAK,eAAgBA,CAAO,CAAE;AAAA,EAEvD;AAAA,EAEQ,eAAiBA,GAAoC;AAE3D,WAAOA,GAAQ,OAAOA,GAAQ,QAAQ;AAAA,EAExC;AAAA,EAEQ,aAAeI,GAAuB;AAE5C,IAAK,KAAK,SAAS,SAAUA,CAAO,KAEpC,KAAK,SAAS,KAAMA,CAAO;AAAA,EAE7B;AAAA,EAEQ,eAAiBA,GAAuB;AAE9C,UAAMnE,IAAQ,KAAK,SAAS,QAASmE,CAAO;AAQ5C,QANKnE,KAAS,KAEZ,KAAK,SAAS,OAAQA,GAAO,CAAE,GAI5B,KAAK,kBAAkBmE,GAAS;AAEnC,WAAK,MAAA,GACL,KAAK,gBAAgB,KAAK,SAAU,CAAE,KAAK;AAE3C,YAAMF,IAAQ,KAAK,SAAA;AAEnB,WAAK,cAAe;AAAA,QAClB,MAAM;AAAA,QACN,QAAQ,KAAK;AAAA,QACb,OAAAA;AAAA,MAAA,CACA,GACF,KAAK,cAAe;AAAA,QAClB,MAAM;AAAA,QACN,OAAAA;AAAA,MAAA,CACA;AAAA,IAEJ;AAAA,EAEF;AAAA,EAEQ,iBAAmBE,GAA6BY,IAAO,IAAO;AAEpE,QAAK,KAAK,kBAAkBZ,EAAS,QAAOA;AAU5C,QARK,KAAK,YAER,KAAK,MAAA,GAIP,KAAK,gBAAgBA,GAEhBY,GAAO;AAEV,YAAMd,IAAQ,KAAK,SAAA;AAEnB,WAAK,cAAe;AAAA,QAClB,MAAM;AAAA,QACN,QAAAE;AAAA,QACA,OAAAF;AAAA,MAAA,CACA,GACF,KAAK,cAAe;AAAA,QAClB,MAAM;AAAA,QACN,OAAAA;AAAA,MAAA,CACA;AAAA,IAEJ;AAEA,WAAOE;AAAA,EAET;AAAA,EAEQ,eACND,GACA;AAEA,WAAKA,KAAU,OAAc,KAAK,gBAE7B,OAAOA,KAAW,WAEd,KAAK,SAAUA,CAAO,KAAK,OAI/B,OAAOA,KAAW,WAEd,KAAK,SAAS;AAAA,MAAM,CAAAC,MACzBA,EAAO,UAAU,OAAOD,KACxBC,EAAO,UAAU,QAAQD,KACzBC,EAAO,UAAU,WAAWD,KAC5BC,EAAO,SAASD;AAAA,IAAA,KACb,OAIAA;AAAA,EAET;AAAA,EAEQ,kBACNW,GACAd,GACA;AAEA,UAAMiB,wBAAoB,IAAA,GACpBC,IAAa,CAAEC,MAAyB;AAE5C,MAAAA,EACG,OAAQ,CAAAlN,MAAUA,EAAO,UAAU,eAAe,KAAM,EACxD,QAAS,CAAAA,MAAUgN,EAAc,IAAKhN,CAAO,CAAE;AAAA,IAEpD;AAEA,IAAAiN;AAAA,MACE,KAAK,IAAI,4BAAuC,UAAUJ,CAAY;AAAA,IAAA,GAGnEd,EAAO,MAEVkB;AAAA,MACE,KAAK,IAAI,4BAAuC,MAAMlB,EAAO,EAAG;AAAA,IAAA,GAK/DA,EAAO,OAEVkB;AAAA,MACE,KAAK,IAAI,4BAAuC,OAAOlB,EAAO,GAAI;AAAA,IAAA,GAKtEiB,EAAc,QAAS,CAAAhN,MAAU,KAAK,IAAI,aAAcA,CAAO,CAAE;AAAA,EAEnE;AAAA,EAEQ,OAAS+M,GAAgB;AAE/B,SAAK,MAAA;AAEL,UAAMjB,IAAU,CAAE,GAAG,KAAK,QAAS;AA4BnC,QA1BA,KAAK,WAAW,CAAA,GAChB,KAAK,gBAAgB,MAErBA,EAAQ,QAAS,CAAAK,MAAU;AAEzB,YAAMW,IAAYX,EAAO,UAAU;AAInC,MAAKW,MAEHX,EAAO,oBAAqB,WAAWW,CAAU,GACjD,QAAQ,eAAgBX,EAAO,UAAU,qBAAsB,IAI5DA,EAAO,UAEV,KAAK,IAAI,aAAcA,CAAO;AAAA,IAIlC,CAAE,GAEG,KAAK,IAAI,OAAA,GAETY,GAAO;AAEV,YAAMd,IAAQ,KAAK,SAAA;AAEnB,WAAK,cAAe;AAAA,QAClB,MAAM;AAAA,QACN,OAAOH,EAAQ;AAAA,QACf,OAAAG;AAAA,MAAA,CACA,GACF,KAAK,cAAe;AAAA,QAClB,MAAM;AAAA,QACN,OAAAA;AAAA,MAAA,CACA;AAAA,IAEJ;AAEA,WAAOH,EAAQ;AAAA,EAEjB;AAAA,EAEQ,aAAeK,GAA0C;AAE/D,WAAO,KAAK;AAAA,MACV;AAAA,MACA,OAAQA,GAAQ,UAAU,4BAA4B,CAAE;AAAA,IAAA;AAAA,EAG5D;AAAA,EAEQ,gBACNA,GACAgB,IAAkB,GAClB;AAEA,UAAMnP,IAAU,OAAQmO,GAAQ,UAAU,iBAAkB;AAE5D,WAAO,OAAO,SAAUnO,CAAQ,IAC9BA,IACAmP;AAAA,EAEJ;AAAA,EAEQ,iBACNhB,GACAgB,IAAkB,GAClB;AAEA,UAAMxB,IAAkB,OAAQQ,GAAQ,UAAU,kBAAmB;AAErE,QAAK,OAAO,SAAUR,CAAgB;AAEpC,aAAOA;AAIT,UAAMlO,IAAa,OAAQ0O,GAAQ,UAAU,cAAc,CAAE,GACvDiB,IAAcjB,GAAQ,UAAU;AAItC,WAAO,OAAOiB,KAAgB,aAC5B,OAAQA,EAAa3P,CAAW,KAAK,CAAE,IACvC0P;AAAA,EAEJ;AAAA,EAEQ,uBAAyBhB,GAA0C;AAEzE,UAAM1O,IAAa;AAAA,MACjB0O,GAAQ,UAAU,yBAAyBA,GAAQ,UAAU;AAAA,IAAA;AAG/D,WAAO,OAAO,SAAU1O,CAAW,IACjCA,IACA;AAAA,EAEJ;AAAA,EAEQ,mBACN0O,GACAnO,GACA;AAEA,UAAMqP,IAAclB,GAAQ,UAAU;AAItC,QAAK,OAAOkB,KAAgB,YAAa;AAEvC,YAAM5P,IAAa,OAAQ4P,EAAarP,CAAQ,CAAE;AAElD,UAAK,OAAO,SAAUP,CAAW;AAE/B,eAAOA;AAAA,IAIX;AAEA,WAAO,KAAK,MAAO,OAAQO,KAAW,CAAE,IAAI,EAAG;AAAA,EAEjD;AAEF;","x_google_ignoreList":[6]}