diff --git a/404.html b/404.html
index 109675fb..5c0ed22c 100644
--- a/404.html
+++ b/404.html
@@ -29,7 +29,7 @@
BigInt64Array = function() { }
}
-
+
diff --git a/advancement/index.html b/advancement/index.html
index ff40edb1..18da5d9f 100644
--- a/advancement/index.html
+++ b/advancement/index.html
@@ -29,7 +29,7 @@
BigInt64Array = function() { }
}
-
+
diff --git a/assets/blockstate/index.html b/assets/blockstate/index.html
index 46aa22d1..1a0f6b49 100644
--- a/assets/blockstate/index.html
+++ b/assets/blockstate/index.html
@@ -29,7 +29,7 @@
BigInt64Array = function() { }
}
-
+
diff --git a/assets/deepslate.esm.a2c3a9f5.js b/assets/deepslate.esm.a2c3a9f5.js
new file mode 100644
index 00000000..54b63b1c
--- /dev/null
+++ b/assets/deepslate.esm.a2c3a9f5.js
@@ -0,0 +1,87 @@
+import{e as jn}from"./index.cecfddbb.js";/*! pako 2.0.4 https://github.com/nodeca/pako @license (MIT AND Zlib) */const Gs=4,Wi=0,Ki=1,$s=2;function Ze(e){let i=e.length;for(;--i>=0;)e[i]=0}const Xs=0,Vn=1,js=2,Vs=3,Js=258,Li=29,ut=256,it=ut+1+Li,Ce=30,zi=19,Jn=2*it+1,Se=15,ti=16,Ws=7,Ui=256,Wn=16,Kn=17,qn=18,xi=new Uint8Array([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]),kt=new Uint8Array([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]),Ks=new Uint8Array([0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,3,7]),Qn=new Uint8Array([16,17,18,0,8,7,9,6,10,5,11,4,12,3,13,2,14,1,15]),qs=512,le=new Array((it+2)*2);Ze(le);const We=new Array(Ce*2);Ze(We);const nt=new Array(qs);Ze(nt);const st=new Array(Js-Vs+1);Ze(st);const Zi=new Array(Li);Ze(Zi);const Ft=new Array(Ce);Ze(Ft);function ii(e,i,t,n,s){this.static_tree=e,this.extra_bits=i,this.extra_base=t,this.elems=n,this.max_length=s,this.has_stree=e&&e.length}let es,ts,is;function ni(e,i){this.dyn_tree=e,this.max_code=0,this.stat_desc=i}const ns=e=>e<256?nt[e]:nt[256+(e>>>7)],rt=(e,i)=>{e.pending_buf[e.pending++]=i&255,e.pending_buf[e.pending++]=i>>>8&255},K=(e,i,t)=>{e.bi_valid>ti-t?(e.bi_buf|=i<>ti-e.bi_valid,e.bi_valid+=t-ti):(e.bi_buf|=i<{K(e,t[i*2],t[i*2+1])},ss=(e,i)=>{let t=0;do t|=e&1,e>>>=1,t<<=1;while(--i>0);return t>>>1},Qs=e=>{e.bi_valid===16?(rt(e,e.bi_buf),e.bi_buf=0,e.bi_valid=0):e.bi_valid>=8&&(e.pending_buf[e.pending++]=e.bi_buf&255,e.bi_buf>>=8,e.bi_valid-=8)},er=(e,i)=>{const t=i.dyn_tree,n=i.max_code,s=i.stat_desc.static_tree,r=i.stat_desc.has_stree,a=i.stat_desc.extra_bits,o=i.stat_desc.extra_base,c=i.stat_desc.max_length;let l,h,d,u,f,g,v=0;for(u=0;u<=Se;u++)e.bl_count[u]=0;for(t[e.heap[e.heap_max]*2+1]=0,l=e.heap_max+1;lc&&(u=c,v++),t[h*2+1]=u,!(h>n)&&(e.bl_count[u]++,f=0,h>=o&&(f=a[h-o]),g=t[h*2],e.opt_len+=g*(u+f),r&&(e.static_len+=g*(s[h*2+1]+f)));if(v!==0){do{for(u=c-1;e.bl_count[u]===0;)u--;e.bl_count[u]--,e.bl_count[u+1]+=2,e.bl_count[c]--,v-=2}while(v>0);for(u=c;u!==0;u--)for(h=e.bl_count[u];h!==0;)d=e.heap[--l],!(d>n)&&(t[d*2+1]!==u&&(e.opt_len+=(u-t[d*2+1])*t[d*2],t[d*2+1]=u),h--)}},rs=(e,i,t)=>{const n=new Array(Se+1);let s=0,r,a;for(r=1;r<=Se;r++)n[r]=s=s+t[r-1]<<1;for(a=0;a<=i;a++){let o=e[a*2+1];o!==0&&(e[a*2]=ss(n[o]++,o))}},tr=()=>{let e,i,t,n,s;const r=new Array(Se+1);for(t=0,n=0;n>=7;n{let i;for(i=0;i{e.bi_valid>8?rt(e,e.bi_buf):e.bi_valid>0&&(e.pending_buf[e.pending++]=e.bi_buf),e.bi_buf=0,e.bi_valid=0},ir=(e,i,t,n)=>{os(e),n&&(rt(e,t),rt(e,~t)),e.pending_buf.set(e.window.subarray(i,i+t),e.pending),e.pending+=t},qi=(e,i,t,n)=>{const s=i*2,r=t*2;return e[s]{const n=e.heap[t];let s=t<<1;for(;s<=e.heap_len&&(s{let n,s,r=0,a,o;if(e.last_lit!==0)do n=e.pending_buf[e.d_buf+r*2]<<8|e.pending_buf[e.d_buf+r*2+1],s=e.pending_buf[e.l_buf+r],r++,n===0?ne(e,s,i):(a=st[s],ne(e,a+ut+1,i),o=xi[a],o!==0&&(s-=Zi[a],K(e,s,o)),n--,a=ns(n),ne(e,a,t),o=kt[a],o!==0&&(n-=Ft[a],K(e,n,o)));while(r{const t=i.dyn_tree,n=i.stat_desc.static_tree,s=i.stat_desc.has_stree,r=i.stat_desc.elems;let a,o,c=-1,l;for(e.heap_len=0,e.heap_max=Jn,a=0;a>1;a>=1;a--)si(e,t,a);l=r;do a=e.heap[1],e.heap[1]=e.heap[e.heap_len--],si(e,t,1),o=e.heap[1],e.heap[--e.heap_max]=a,e.heap[--e.heap_max]=o,t[l*2]=t[a*2]+t[o*2],e.depth[l]=(e.depth[a]>=e.depth[o]?e.depth[a]:e.depth[o])+1,t[a*2+1]=t[o*2+1]=l,e.heap[1]=l++,si(e,t,1);while(e.heap_len>=2);e.heap[--e.heap_max]=e.heap[1],er(e,i),rs(t,c,e.bl_count)},en=(e,i,t)=>{let n,s=-1,r,a=i[0*2+1],o=0,c=7,l=4;for(a===0&&(c=138,l=3),i[(t+1)*2+1]=65535,n=0;n<=t;n++)r=a,a=i[(n+1)*2+1],!(++o{let n,s=-1,r,a=i[0*2+1],o=0,c=7,l=4;for(a===0&&(c=138,l=3),n=0;n<=t;n++)if(r=a,a=i[(n+1)*2+1],!(++o{let i;for(en(e,e.dyn_ltree,e.l_desc.max_code),en(e,e.dyn_dtree,e.d_desc.max_code),Ei(e,e.bl_desc),i=zi-1;i>=3&&e.bl_tree[Qn[i]*2+1]===0;i--);return e.opt_len+=3*(i+1)+5+5+4,i},sr=(e,i,t,n)=>{let s;for(K(e,i-257,5),K(e,t-1,5),K(e,n-4,4),s=0;s{let i=4093624447,t;for(t=0;t<=31;t++,i>>>=1)if(i&1&&e.dyn_ltree[t*2]!==0)return Wi;if(e.dyn_ltree[9*2]!==0||e.dyn_ltree[10*2]!==0||e.dyn_ltree[13*2]!==0)return Ki;for(t=32;t{nn||(tr(),nn=!0),e.l_desc=new ni(e.dyn_ltree,es),e.d_desc=new ni(e.dyn_dtree,ts),e.bl_desc=new ni(e.bl_tree,is),e.bi_buf=0,e.bi_valid=0,as(e)},ls=(e,i,t,n)=>{K(e,(Xs<<1)+(n?1:0),3),ir(e,i,t,!0)},or=e=>{K(e,Vn<<1,3),ne(e,Ui,le),Qs(e)},lr=(e,i,t,n)=>{let s,r,a=0;e.level>0?(e.strm.data_type===$s&&(e.strm.data_type=rr(e)),Ei(e,e.l_desc),Ei(e,e.d_desc),a=nr(e),s=e.opt_len+3+7>>>3,r=e.static_len+3+7>>>3,r<=s&&(s=r)):s=r=t+5,t+4<=s&&i!==-1?ls(e,i,t,n):e.strategy===Gs||r===s?(K(e,(Vn<<1)+(n?1:0),3),Qi(e,le,We)):(K(e,(js<<1)+(n?1:0),3),sr(e,e.l_desc.max_code+1,e.d_desc.max_code+1,a+1),Qi(e,e.dyn_ltree,e.dyn_dtree)),as(e),n&&os(e)},hr=(e,i,t)=>(e.pending_buf[e.d_buf+e.last_lit*2]=i>>>8&255,e.pending_buf[e.d_buf+e.last_lit*2+1]=i&255,e.pending_buf[e.l_buf+e.last_lit]=t&255,e.last_lit++,i===0?e.dyn_ltree[t*2]++:(e.matches++,i--,e.dyn_ltree[(st[t]+ut+1)*2]++,e.dyn_dtree[ns(i)*2]++),e.last_lit===e.lit_bufsize-1);var cr=ar,fr=ls,dr=lr,ur=hr,gr=or,_r={_tr_init:cr,_tr_stored_block:fr,_tr_flush_block:dr,_tr_tally:ur,_tr_align:gr};const pr=(e,i,t,n)=>{let s=e&65535|0,r=e>>>16&65535|0,a=0;for(;t!==0;){a=t>2e3?2e3:t,t-=a;do s=s+i[n++]|0,r=r+s|0;while(--a);s%=65521,r%=65521}return s|r<<16|0};var at=pr;const vr=()=>{let e,i=[];for(var t=0;t<256;t++){e=t;for(var n=0;n<8;n++)e=e&1?3988292384^e>>>1:e>>>1;i[t]=e}return i},br=new Uint32Array(vr()),mr=(e,i,t,n)=>{const s=br,r=n+t;e^=-1;for(let a=n;a>>8^s[(e^i[a])&255];return e^-1};var j=mr,ye={2:"need dictionary",1:"stream end",0:"","-1":"file error","-2":"stream error","-3":"data error","-4":"insufficient memory","-5":"buffer error","-6":"incompatible version"},Ne={Z_NO_FLUSH:0,Z_PARTIAL_FLUSH:1,Z_SYNC_FLUSH:2,Z_FULL_FLUSH:3,Z_FINISH:4,Z_BLOCK:5,Z_TREES:6,Z_OK:0,Z_STREAM_END:1,Z_NEED_DICT:2,Z_ERRNO:-1,Z_STREAM_ERROR:-2,Z_DATA_ERROR:-3,Z_MEM_ERROR:-4,Z_BUF_ERROR:-5,Z_NO_COMPRESSION:0,Z_BEST_SPEED:1,Z_BEST_COMPRESSION:9,Z_DEFAULT_COMPRESSION:-1,Z_FILTERED:1,Z_HUFFMAN_ONLY:2,Z_RLE:3,Z_FIXED:4,Z_DEFAULT_STRATEGY:0,Z_BINARY:0,Z_TEXT:1,Z_UNKNOWN:2,Z_DEFLATED:8};const{_tr_init:wr,_tr_stored_block:xr,_tr_flush_block:Er,_tr_tally:me,_tr_align:Sr}=_r,{Z_NO_FLUSH:Te,Z_PARTIAL_FLUSH:kr,Z_FULL_FLUSH:yr,Z_FINISH:we,Z_BLOCK:sn,Z_OK:se,Z_STREAM_END:rn,Z_STREAM_ERROR:Q,Z_DATA_ERROR:Ar,Z_BUF_ERROR:ri,Z_DEFAULT_COMPRESSION:Ir,Z_FILTERED:Rr,Z_HUFFMAN_ONLY:bt,Z_RLE:Nr,Z_FIXED:Tr,Z_DEFAULT_STRATEGY:Fr,Z_UNKNOWN:Br,Z_DEFLATED:Mt}=Ne,Pr=9,Dr=15,Cr=8,Or=29,Mr=256,Si=Mr+1+Or,Lr=30,zr=19,Ur=2*Si+1,Zr=15,T=3,ve=258,te=ve+T+1,Hr=32,Lt=42,ki=69,yt=73,At=91,It=103,ke=113,Ve=666,X=1,gt=2,Ae=3,He=4,Yr=3,be=(e,i)=>(e.msg=ye[i],i),an=e=>(e<<1)-(e>4?9:0),_e=e=>{let i=e.length;for(;--i>=0;)e[i]=0};let Gr=(e,i,t)=>(i<{const i=e.state;let t=i.pending;t>e.avail_out&&(t=e.avail_out),t!==0&&(e.output.set(i.pending_buf.subarray(i.pending_out,i.pending_out+t),e.next_out),e.next_out+=t,i.pending_out+=t,e.total_out+=t,e.avail_out-=t,i.pending-=t,i.pending===0&&(i.pending_out=0))},J=(e,i)=>{Er(e,e.block_start>=0?e.block_start:-1,e.strstart-e.block_start,i),e.block_start=e.strstart,de(e.strm)},F=(e,i)=>{e.pending_buf[e.pending++]=i},Xe=(e,i)=>{e.pending_buf[e.pending++]=i>>>8&255,e.pending_buf[e.pending++]=i&255},$r=(e,i,t,n)=>{let s=e.avail_in;return s>n&&(s=n),s===0?0:(e.avail_in-=s,i.set(e.input.subarray(e.next_in,e.next_in+s),t),e.state.wrap===1?e.adler=at(e.adler,i,s,t):e.state.wrap===2&&(e.adler=j(e.adler,i,s,t)),e.next_in+=s,e.total_in+=s,s)},hs=(e,i)=>{let t=e.max_chain_length,n=e.strstart,s,r,a=e.prev_length,o=e.nice_match;const c=e.strstart>e.w_size-te?e.strstart-(e.w_size-te):0,l=e.window,h=e.w_mask,d=e.prev,u=e.strstart+ve;let f=l[n+a-1],g=l[n+a];e.prev_length>=e.good_match&&(t>>=2),o>e.lookahead&&(o=e.lookahead);do if(s=i,!(l[s+a]!==g||l[s+a-1]!==f||l[s]!==l[n]||l[++s]!==l[n+1])){n+=2,s++;do;while(l[++n]===l[++s]&&l[++n]===l[++s]&&l[++n]===l[++s]&&l[++n]===l[++s]&&l[++n]===l[++s]&&l[++n]===l[++s]&&l[++n]===l[++s]&&l[++n]===l[++s]&&na){if(e.match_start=i,a=r,r>=o)break;f=l[n+a-1],g=l[n+a]}}while((i=d[i&h])>c&&--t!==0);return a<=e.lookahead?a:e.lookahead},Ie=e=>{const i=e.w_size;let t,n,s,r,a;do{if(r=e.window_size-e.lookahead-e.strstart,e.strstart>=i+(i-te)){e.window.set(e.window.subarray(i,i+i),0),e.match_start-=i,e.strstart-=i,e.block_start-=i,n=e.hash_size,t=n;do s=e.head[--t],e.head[t]=s>=i?s-i:0;while(--n);n=i,t=n;do s=e.prev[--t],e.prev[t]=s>=i?s-i:0;while(--n);r+=i}if(e.strm.avail_in===0)break;if(n=$r(e.strm,e.window,e.strstart+e.lookahead,r),e.lookahead+=n,e.lookahead+e.insert>=T)for(a=e.strstart-e.insert,e.ins_h=e.window[a],e.ins_h=xe(e,e.ins_h,e.window[a+1]);e.insert&&(e.ins_h=xe(e,e.ins_h,e.window[a+T-1]),e.prev[a&e.w_mask]=e.head[e.ins_h],e.head[e.ins_h]=a,a++,e.insert--,!(e.lookahead+e.insert{let t=65535;for(t>e.pending_buf_size-5&&(t=e.pending_buf_size-5);;){if(e.lookahead<=1){if(Ie(e),e.lookahead===0&&i===Te)return X;if(e.lookahead===0)break}e.strstart+=e.lookahead,e.lookahead=0;const n=e.block_start+t;if((e.strstart===0||e.strstart>=n)&&(e.lookahead=e.strstart-n,e.strstart=n,J(e,!1),e.strm.avail_out===0)||e.strstart-e.block_start>=e.w_size-te&&(J(e,!1),e.strm.avail_out===0))return X}return e.insert=0,i===we?(J(e,!0),e.strm.avail_out===0?Ae:He):(e.strstart>e.block_start&&(J(e,!1),e.strm.avail_out===0),X)},ai=(e,i)=>{let t,n;for(;;){if(e.lookahead=T&&(e.ins_h=xe(e,e.ins_h,e.window[e.strstart+T-1]),t=e.prev[e.strstart&e.w_mask]=e.head[e.ins_h],e.head[e.ins_h]=e.strstart),t!==0&&e.strstart-t<=e.w_size-te&&(e.match_length=hs(e,t)),e.match_length>=T)if(n=me(e,e.strstart-e.match_start,e.match_length-T),e.lookahead-=e.match_length,e.match_length<=e.max_lazy_match&&e.lookahead>=T){e.match_length--;do e.strstart++,e.ins_h=xe(e,e.ins_h,e.window[e.strstart+T-1]),t=e.prev[e.strstart&e.w_mask]=e.head[e.ins_h],e.head[e.ins_h]=e.strstart;while(--e.match_length!==0);e.strstart++}else e.strstart+=e.match_length,e.match_length=0,e.ins_h=e.window[e.strstart],e.ins_h=xe(e,e.ins_h,e.window[e.strstart+1]);else n=me(e,0,e.window[e.strstart]),e.lookahead--,e.strstart++;if(n&&(J(e,!1),e.strm.avail_out===0))return X}return e.insert=e.strstart{let t,n,s;for(;;){if(e.lookahead=T&&(e.ins_h=xe(e,e.ins_h,e.window[e.strstart+T-1]),t=e.prev[e.strstart&e.w_mask]=e.head[e.ins_h],e.head[e.ins_h]=e.strstart),e.prev_length=e.match_length,e.prev_match=e.match_start,e.match_length=T-1,t!==0&&e.prev_length4096)&&(e.match_length=T-1)),e.prev_length>=T&&e.match_length<=e.prev_length){s=e.strstart+e.lookahead-T,n=me(e,e.strstart-1-e.prev_match,e.prev_length-T),e.lookahead-=e.prev_length-1,e.prev_length-=2;do++e.strstart<=s&&(e.ins_h=xe(e,e.ins_h,e.window[e.strstart+T-1]),t=e.prev[e.strstart&e.w_mask]=e.head[e.ins_h],e.head[e.ins_h]=e.strstart);while(--e.prev_length!==0);if(e.match_available=0,e.match_length=T-1,e.strstart++,n&&(J(e,!1),e.strm.avail_out===0))return X}else if(e.match_available){if(n=me(e,0,e.window[e.strstart-1]),n&&J(e,!1),e.strstart++,e.lookahead--,e.strm.avail_out===0)return X}else e.match_available=1,e.strstart++,e.lookahead--}return e.match_available&&(n=me(e,0,e.window[e.strstart-1]),e.match_available=0),e.insert=e.strstart{let t,n,s,r;const a=e.window;for(;;){if(e.lookahead<=ve){if(Ie(e),e.lookahead<=ve&&i===Te)return X;if(e.lookahead===0)break}if(e.match_length=0,e.lookahead>=T&&e.strstart>0&&(s=e.strstart-1,n=a[s],n===a[++s]&&n===a[++s]&&n===a[++s])){r=e.strstart+ve;do;while(n===a[++s]&&n===a[++s]&&n===a[++s]&&n===a[++s]&&n===a[++s]&&n===a[++s]&&n===a[++s]&&n===a[++s]&&se.lookahead&&(e.match_length=e.lookahead)}if(e.match_length>=T?(t=me(e,1,e.match_length-T),e.lookahead-=e.match_length,e.strstart+=e.match_length,e.match_length=0):(t=me(e,0,e.window[e.strstart]),e.lookahead--,e.strstart++),t&&(J(e,!1),e.strm.avail_out===0))return X}return e.insert=0,i===we?(J(e,!0),e.strm.avail_out===0?Ae:He):e.last_lit&&(J(e,!1),e.strm.avail_out===0)?X:gt},Vr=(e,i)=>{let t;for(;;){if(e.lookahead===0&&(Ie(e),e.lookahead===0)){if(i===Te)return X;break}if(e.match_length=0,t=me(e,0,e.window[e.strstart]),e.lookahead--,e.strstart++,t&&(J(e,!1),e.strm.avail_out===0))return X}return e.insert=0,i===we?(J(e,!0),e.strm.avail_out===0?Ae:He):e.last_lit&&(J(e,!1),e.strm.avail_out===0)?X:gt};function ie(e,i,t,n,s){this.good_length=e,this.max_lazy=i,this.nice_length=t,this.max_chain=n,this.func=s}const Je=[new ie(0,0,0,0,Xr),new ie(4,4,8,4,ai),new ie(4,5,16,8,ai),new ie(4,6,32,32,ai),new ie(4,4,16,16,Fe),new ie(8,16,32,32,Fe),new ie(8,16,128,128,Fe),new ie(8,32,128,256,Fe),new ie(32,128,258,1024,Fe),new ie(32,258,258,4096,Fe)],Jr=e=>{e.window_size=2*e.w_size,_e(e.head),e.max_lazy_match=Je[e.level].max_lazy,e.good_match=Je[e.level].good_length,e.nice_match=Je[e.level].nice_length,e.max_chain_length=Je[e.level].max_chain,e.strstart=0,e.block_start=0,e.lookahead=0,e.insert=0,e.match_length=e.prev_length=T-1,e.match_available=0,e.ins_h=0};function Wr(){this.strm=null,this.status=0,this.pending_buf=null,this.pending_buf_size=0,this.pending_out=0,this.pending=0,this.wrap=0,this.gzhead=null,this.gzindex=0,this.method=Mt,this.last_flush=-1,this.w_size=0,this.w_bits=0,this.w_mask=0,this.window=null,this.window_size=0,this.prev=null,this.head=null,this.ins_h=0,this.hash_size=0,this.hash_bits=0,this.hash_mask=0,this.hash_shift=0,this.block_start=0,this.match_length=0,this.prev_match=0,this.match_available=0,this.strstart=0,this.match_start=0,this.lookahead=0,this.prev_length=0,this.max_chain_length=0,this.max_lazy_match=0,this.level=0,this.strategy=0,this.good_match=0,this.nice_match=0,this.dyn_ltree=new Uint16Array(Ur*2),this.dyn_dtree=new Uint16Array((2*Lr+1)*2),this.bl_tree=new Uint16Array((2*zr+1)*2),_e(this.dyn_ltree),_e(this.dyn_dtree),_e(this.bl_tree),this.l_desc=null,this.d_desc=null,this.bl_desc=null,this.bl_count=new Uint16Array(Zr+1),this.heap=new Uint16Array(2*Si+1),_e(this.heap),this.heap_len=0,this.heap_max=0,this.depth=new Uint16Array(2*Si+1),_e(this.depth),this.l_buf=0,this.lit_bufsize=0,this.last_lit=0,this.d_buf=0,this.opt_len=0,this.static_len=0,this.matches=0,this.insert=0,this.bi_buf=0,this.bi_valid=0}const cs=e=>{if(!e||!e.state)return be(e,Q);e.total_in=e.total_out=0,e.data_type=Br;const i=e.state;return i.pending=0,i.pending_out=0,i.wrap<0&&(i.wrap=-i.wrap),i.status=i.wrap?Lt:ke,e.adler=i.wrap===2?0:1,i.last_flush=Te,wr(i),se},fs=e=>{const i=cs(e);return i===se&&Jr(e.state),i},Kr=(e,i)=>!e||!e.state||e.state.wrap!==2?Q:(e.state.gzhead=i,se),ds=(e,i,t,n,s,r)=>{if(!e)return Q;let a=1;if(i===Ir&&(i=6),n<0?(a=0,n=-n):n>15&&(a=2,n-=16),s<1||s>Pr||t!==Mt||n<8||n>15||i<0||i>9||r<0||r>Tr)return be(e,Q);n===8&&(n=9);const o=new Wr;return e.state=o,o.strm=e,o.wrap=a,o.gzhead=null,o.w_bits=n,o.w_size=1<ds(e,i,Mt,Dr,Cr,Fr),Qr=(e,i)=>{let t,n;if(!e||!e.state||i>sn||i<0)return e?be(e,Q):Q;const s=e.state;if(!e.output||!e.input&&e.avail_in!==0||s.status===Ve&&i!==we)return be(e,e.avail_out===0?ri:Q);s.strm=e;const r=s.last_flush;if(s.last_flush=i,s.status===Lt)if(s.wrap===2)e.adler=0,F(s,31),F(s,139),F(s,8),s.gzhead?(F(s,(s.gzhead.text?1:0)+(s.gzhead.hcrc?2:0)+(s.gzhead.extra?4:0)+(s.gzhead.name?8:0)+(s.gzhead.comment?16:0)),F(s,s.gzhead.time&255),F(s,s.gzhead.time>>8&255),F(s,s.gzhead.time>>16&255),F(s,s.gzhead.time>>24&255),F(s,s.level===9?2:s.strategy>=bt||s.level<2?4:0),F(s,s.gzhead.os&255),s.gzhead.extra&&s.gzhead.extra.length&&(F(s,s.gzhead.extra.length&255),F(s,s.gzhead.extra.length>>8&255)),s.gzhead.hcrc&&(e.adler=j(e.adler,s.pending_buf,s.pending,0)),s.gzindex=0,s.status=ki):(F(s,0),F(s,0),F(s,0),F(s,0),F(s,0),F(s,s.level===9?2:s.strategy>=bt||s.level<2?4:0),F(s,Yr),s.status=ke);else{let a=Mt+(s.w_bits-8<<4)<<8,o=-1;s.strategy>=bt||s.level<2?o=0:s.level<6?o=1:s.level===6?o=2:o=3,a|=o<<6,s.strstart!==0&&(a|=Hr),a+=31-a%31,s.status=ke,Xe(s,a),s.strstart!==0&&(Xe(s,e.adler>>>16),Xe(s,e.adler&65535)),e.adler=1}if(s.status===ki)if(s.gzhead.extra){for(t=s.pending;s.gzindex<(s.gzhead.extra.length&65535)&&!(s.pending===s.pending_buf_size&&(s.gzhead.hcrc&&s.pending>t&&(e.adler=j(e.adler,s.pending_buf,s.pending-t,t)),de(e),t=s.pending,s.pending===s.pending_buf_size));)F(s,s.gzhead.extra[s.gzindex]&255),s.gzindex++;s.gzhead.hcrc&&s.pending>t&&(e.adler=j(e.adler,s.pending_buf,s.pending-t,t)),s.gzindex===s.gzhead.extra.length&&(s.gzindex=0,s.status=yt)}else s.status=yt;if(s.status===yt)if(s.gzhead.name){t=s.pending;do{if(s.pending===s.pending_buf_size&&(s.gzhead.hcrc&&s.pending>t&&(e.adler=j(e.adler,s.pending_buf,s.pending-t,t)),de(e),t=s.pending,s.pending===s.pending_buf_size)){n=1;break}s.gzindext&&(e.adler=j(e.adler,s.pending_buf,s.pending-t,t)),n===0&&(s.gzindex=0,s.status=At)}else s.status=At;if(s.status===At)if(s.gzhead.comment){t=s.pending;do{if(s.pending===s.pending_buf_size&&(s.gzhead.hcrc&&s.pending>t&&(e.adler=j(e.adler,s.pending_buf,s.pending-t,t)),de(e),t=s.pending,s.pending===s.pending_buf_size)){n=1;break}s.gzindext&&(e.adler=j(e.adler,s.pending_buf,s.pending-t,t)),n===0&&(s.status=It)}else s.status=It;if(s.status===It&&(s.gzhead.hcrc?(s.pending+2>s.pending_buf_size&&de(e),s.pending+2<=s.pending_buf_size&&(F(s,e.adler&255),F(s,e.adler>>8&255),e.adler=0,s.status=ke)):s.status=ke),s.pending!==0){if(de(e),e.avail_out===0)return s.last_flush=-1,se}else if(e.avail_in===0&&an(i)<=an(r)&&i!==we)return be(e,ri);if(s.status===Ve&&e.avail_in!==0)return be(e,ri);if(e.avail_in!==0||s.lookahead!==0||i!==Te&&s.status!==Ve){let a=s.strategy===bt?Vr(s,i):s.strategy===Nr?jr(s,i):Je[s.level].func(s,i);if((a===Ae||a===He)&&(s.status=Ve),a===X||a===Ae)return e.avail_out===0&&(s.last_flush=-1),se;if(a===gt&&(i===kr?Sr(s):i!==sn&&(xr(s,0,0,!1),i===yr&&(_e(s.head),s.lookahead===0&&(s.strstart=0,s.block_start=0,s.insert=0))),de(e),e.avail_out===0))return s.last_flush=-1,se}return i!==we?se:s.wrap<=0?rn:(s.wrap===2?(F(s,e.adler&255),F(s,e.adler>>8&255),F(s,e.adler>>16&255),F(s,e.adler>>24&255),F(s,e.total_in&255),F(s,e.total_in>>8&255),F(s,e.total_in>>16&255),F(s,e.total_in>>24&255)):(Xe(s,e.adler>>>16),Xe(s,e.adler&65535)),de(e),s.wrap>0&&(s.wrap=-s.wrap),s.pending!==0?se:rn)},ea=e=>{if(!e||!e.state)return Q;const i=e.state.status;return i!==Lt&&i!==ki&&i!==yt&&i!==At&&i!==It&&i!==ke&&i!==Ve?be(e,Q):(e.state=null,i===ke?be(e,Ar):se)},ta=(e,i)=>{let t=i.length;if(!e||!e.state)return Q;const n=e.state,s=n.wrap;if(s===2||s===1&&n.status!==Lt||n.lookahead)return Q;if(s===1&&(e.adler=at(e.adler,i,t,0)),n.wrap=0,t>=n.w_size){s===0&&(_e(n.head),n.strstart=0,n.block_start=0,n.insert=0);let c=new Uint8Array(n.w_size);c.set(i.subarray(t-n.w_size,t),0),i=c,t=n.w_size}const r=e.avail_in,a=e.next_in,o=e.input;for(e.avail_in=t,e.next_in=0,e.input=i,Ie(n);n.lookahead>=T;){let c=n.strstart,l=n.lookahead-(T-1);do n.ins_h=xe(n,n.ins_h,n.window[c+T-1]),n.prev[c&n.w_mask]=n.head[n.ins_h],n.head[n.ins_h]=c,c++;while(--l);n.strstart=c,n.lookahead=T-1,Ie(n)}return n.strstart+=n.lookahead,n.block_start=n.strstart,n.insert=n.lookahead,n.lookahead=0,n.match_length=n.prev_length=T-1,n.match_available=0,e.next_in=a,e.input=o,e.avail_in=r,n.wrap=s,se};var ia=qr,na=ds,sa=fs,ra=cs,aa=Kr,oa=Qr,la=ea,ha=ta,ca="pako deflate (from Nodeca project)",Ke={deflateInit:ia,deflateInit2:na,deflateReset:sa,deflateResetKeep:ra,deflateSetHeader:aa,deflate:oa,deflateEnd:la,deflateSetDictionary:ha,deflateInfo:ca};const fa=(e,i)=>Object.prototype.hasOwnProperty.call(e,i);var da=function(e){const i=Array.prototype.slice.call(arguments,1);for(;i.length;){const t=i.shift();if(!!t){if(typeof t!="object")throw new TypeError(t+"must be non-object");for(const n in t)fa(t,n)&&(e[n]=t[n])}}return e},ua=e=>{let i=0;for(let n=0,s=e.length;n=252?6:e>=248?5:e>=240?4:e>=224?3:e>=192?2:1;ot[254]=ot[254]=1;var ga=e=>{if(typeof TextEncoder=="function"&&TextEncoder.prototype.encode)return new TextEncoder().encode(e);let i,t,n,s,r,a=e.length,o=0;for(s=0;s>>6,i[r++]=128|t&63):t<65536?(i[r++]=224|t>>>12,i[r++]=128|t>>>6&63,i[r++]=128|t&63):(i[r++]=240|t>>>18,i[r++]=128|t>>>12&63,i[r++]=128|t>>>6&63,i[r++]=128|t&63);return i};const _a=(e,i)=>{if(i<65534&&e.subarray&&us)return String.fromCharCode.apply(null,e.length===i?e:e.subarray(0,i));let t="";for(let n=0;n{const t=i||e.length;if(typeof TextDecoder=="function"&&TextDecoder.prototype.decode)return new TextDecoder().decode(e.subarray(0,i));let n,s;const r=new Array(t*2);for(s=0,n=0;n4){r[s++]=65533,n+=o-1;continue}for(a&=o===2?31:o===3?15:7;o>1&&n1){r[s++]=65533;continue}a<65536?r[s++]=a:(a-=65536,r[s++]=55296|a>>10&1023,r[s++]=56320|a&1023)}return _a(r,s)},va=(e,i)=>{i=i||e.length,i>e.length&&(i=e.length);let t=i-1;for(;t>=0&&(e[t]&192)===128;)t--;return t<0||t===0?i:t+ot[e[t]]>i?t:i},lt={string2buf:ga,buf2string:pa,utf8border:va};function ba(){this.input=null,this.next_in=0,this.avail_in=0,this.total_in=0,this.output=null,this.next_out=0,this.avail_out=0,this.total_out=0,this.msg="",this.state=null,this.data_type=2,this.adler=0}var gs=ba;const _s=Object.prototype.toString,{Z_NO_FLUSH:ma,Z_SYNC_FLUSH:wa,Z_FULL_FLUSH:xa,Z_FINISH:Ea,Z_OK:Bt,Z_STREAM_END:Sa,Z_DEFAULT_COMPRESSION:ka,Z_DEFAULT_STRATEGY:ya,Z_DEFLATED:Aa}=Ne;function _t(e){this.options=zt.assign({level:ka,method:Aa,chunkSize:16384,windowBits:15,memLevel:8,strategy:ya},e||{});let i=this.options;i.raw&&i.windowBits>0?i.windowBits=-i.windowBits:i.gzip&&i.windowBits>0&&i.windowBits<16&&(i.windowBits+=16),this.err=0,this.msg="",this.ended=!1,this.chunks=[],this.strm=new gs,this.strm.avail_out=0;let t=Ke.deflateInit2(this.strm,i.level,i.method,i.windowBits,i.memLevel,i.strategy);if(t!==Bt)throw new Error(ye[t]);if(i.header&&Ke.deflateSetHeader(this.strm,i.header),i.dictionary){let n;if(typeof i.dictionary=="string"?n=lt.string2buf(i.dictionary):_s.call(i.dictionary)==="[object ArrayBuffer]"?n=new Uint8Array(i.dictionary):n=i.dictionary,t=Ke.deflateSetDictionary(this.strm,n),t!==Bt)throw new Error(ye[t]);this._dict_set=!0}}_t.prototype.push=function(e,i){const t=this.strm,n=this.options.chunkSize;let s,r;if(this.ended)return!1;for(i===~~i?r=i:r=i===!0?Ea:ma,typeof e=="string"?t.input=lt.string2buf(e):_s.call(e)==="[object ArrayBuffer]"?t.input=new Uint8Array(e):t.input=e,t.next_in=0,t.avail_in=t.input.length;;){if(t.avail_out===0&&(t.output=new Uint8Array(n),t.next_out=0,t.avail_out=n),(r===wa||r===xa)&&t.avail_out<=6){this.onData(t.output.subarray(0,t.next_out)),t.avail_out=0;continue}if(s=Ke.deflate(t,r),s===Sa)return t.next_out>0&&this.onData(t.output.subarray(0,t.next_out)),s=Ke.deflateEnd(this.strm),this.onEnd(s),this.ended=!0,s===Bt;if(t.avail_out===0){this.onData(t.output);continue}if(r>0&&t.next_out>0){this.onData(t.output.subarray(0,t.next_out)),t.avail_out=0;continue}if(t.avail_in===0)break}return!0};_t.prototype.onData=function(e){this.chunks.push(e)};_t.prototype.onEnd=function(e){e===Bt&&(this.result=zt.flattenChunks(this.chunks)),this.chunks=[],this.err=e,this.msg=this.strm.msg};function Hi(e,i){const t=new _t(i);if(t.push(e,!0),t.err)throw t.msg||ye[t.err];return t.result}function Ia(e,i){return i=i||{},i.raw=!0,Hi(e,i)}function Ra(e,i){return i=i||{},i.gzip=!0,Hi(e,i)}var Na=_t,Ta=Hi,Fa=Ia,Ba=Ra,Pa=Ne,Da={Deflate:Na,deflate:Ta,deflateRaw:Fa,gzip:Ba,constants:Pa};const mt=30,Ca=12;var Oa=function(i,t){let n,s,r,a,o,c,l,h,d,u,f,g,v,p,m,S,E,_,b,I,x,R,N,y;const A=i.state;n=i.next_in,N=i.input,s=n+(i.avail_in-5),r=i.next_out,y=i.output,a=r-(t-i.avail_out),o=r+(i.avail_out-257),c=A.dmax,l=A.wsize,h=A.whave,d=A.wnext,u=A.window,f=A.hold,g=A.bits,v=A.lencode,p=A.distcode,m=(1<>>24,f>>>=_,g-=_,_=E>>>16&255,_===0)y[r++]=E&65535;else if(_&16){b=E&65535,_&=15,_&&(g<_&&(f+=N[n++]<>>=_,g-=_),g<15&&(f+=N[n++]<>>24,f>>>=_,g-=_,_=E>>>16&255,_&16){if(I=E&65535,_&=15,g<_&&(f+=N[n++]<c){i.msg="invalid distance too far back",A.mode=mt;break e}if(f>>>=_,g-=_,_=r-a,I>_){if(_=I-_,_>h&&A.sane){i.msg="invalid distance too far back",A.mode=mt;break e}if(x=0,R=u,d===0){if(x+=l-_,_2;)y[r++]=R[x++],y[r++]=R[x++],y[r++]=R[x++],b-=3;b&&(y[r++]=R[x++],b>1&&(y[r++]=R[x++]))}else{x=r-I;do y[r++]=y[x++],y[r++]=y[x++],y[r++]=y[x++],b-=3;while(b>2);b&&(y[r++]=y[x++],b>1&&(y[r++]=y[x++]))}}else if((_&64)===0){E=p[(E&65535)+(f&(1<<_)-1)];continue i}else{i.msg="invalid distance code",A.mode=mt;break e}break}}else if((_&64)===0){E=v[(E&65535)+(f&(1<<_)-1)];continue t}else if(_&32){A.mode=Ca;break e}else{i.msg="invalid literal/length code",A.mode=mt;break e}break}}while(n>3,n-=b,g-=b<<3,f&=(1<{const c=o.bits;let l=0,h=0,d=0,u=0,f=0,g=0,v=0,p=0,m=0,S=0,E,_,b,I,x,R=null,N=0,y;const A=new Uint16Array(Be+1),M=new Uint16Array(Be+1);let D=null,B=0,q,Y,L;for(l=0;l<=Be;l++)A[l]=0;for(h=0;h=1&&A[u]===0;u--);if(f>u&&(f=u),u===0)return s[r++]=1<<24|64<<16|0,s[r++]=1<<24|64<<16|0,o.bits=1,0;for(d=1;d0&&(e===hn||u!==1))return-1;for(M[1]=0,l=1;lon||e===cn&&m>ln)return 1;for(;;){q=l-v,a[h]y?(Y=D[B+a[h]],L=R[N+a[h]]):(Y=32+64,L=0),E=1<>v)+_]=q<<24|Y<<16|L|0;while(_!==0);for(E=1<>=1;if(E!==0?(S&=E-1,S+=E):S=0,h++,--A[l]===0){if(l===u)break;l=i[t+a[h]]}if(l>f&&(S&I)!==b){for(v===0&&(v=f),x+=d,g=l-v,p=1<on||e===cn&&m>ln)return 1;b=S&I,s[b]=f<<24|g<<16|x-r|0}}return S!==0&&(s[x+S]=l-v<<24|64<<16|0),o.bits=f,0};var qe=Za;const Ha=0,ps=1,vs=2,{Z_FINISH:fn,Z_BLOCK:Ya,Z_TREES:wt,Z_OK:Re,Z_STREAM_END:Ga,Z_NEED_DICT:$a,Z_STREAM_ERROR:ee,Z_DATA_ERROR:bs,Z_MEM_ERROR:ms,Z_BUF_ERROR:Xa,Z_DEFLATED:dn}=Ne,ws=1,un=2,gn=3,_n=4,pn=5,vn=6,bn=7,mn=8,wn=9,xn=10,Pt=11,ae=12,li=13,En=14,hi=15,Sn=16,kn=17,yn=18,An=19,xt=20,Et=21,In=22,Rn=23,Nn=24,Tn=25,Fn=26,ci=27,Bn=28,Pn=29,C=30,xs=31,ja=32,Va=852,Ja=592,Wa=15,Ka=Wa,Dn=e=>(e>>>24&255)+(e>>>8&65280)+((e&65280)<<8)+((e&255)<<24);function qa(){this.mode=0,this.last=!1,this.wrap=0,this.havedict=!1,this.flags=0,this.dmax=0,this.check=0,this.total=0,this.head=null,this.wbits=0,this.wsize=0,this.whave=0,this.wnext=0,this.window=null,this.hold=0,this.bits=0,this.length=0,this.offset=0,this.extra=0,this.lencode=null,this.distcode=null,this.lenbits=0,this.distbits=0,this.ncode=0,this.nlen=0,this.ndist=0,this.have=0,this.next=null,this.lens=new Uint16Array(320),this.work=new Uint16Array(288),this.lendyn=null,this.distdyn=null,this.sane=0,this.back=0,this.was=0}const Es=e=>{if(!e||!e.state)return ee;const i=e.state;return e.total_in=e.total_out=i.total=0,e.msg="",i.wrap&&(e.adler=i.wrap&1),i.mode=ws,i.last=0,i.havedict=0,i.dmax=32768,i.head=null,i.hold=0,i.bits=0,i.lencode=i.lendyn=new Int32Array(Va),i.distcode=i.distdyn=new Int32Array(Ja),i.sane=1,i.back=-1,Re},Ss=e=>{if(!e||!e.state)return ee;const i=e.state;return i.wsize=0,i.whave=0,i.wnext=0,Es(e)},ks=(e,i)=>{let t;if(!e||!e.state)return ee;const n=e.state;return i<0?(t=0,i=-i):(t=(i>>4)+1,i<48&&(i&=15)),i&&(i<8||i>15)?ee:(n.window!==null&&n.wbits!==i&&(n.window=null),n.wrap=t,n.wbits=i,Ss(e))},ys=(e,i)=>{if(!e)return ee;const t=new qa;e.state=t,t.window=null;const n=ks(e,i);return n!==Re&&(e.state=null),n},Qa=e=>ys(e,Ka);let Cn=!0,fi,di;const eo=e=>{if(Cn){fi=new Int32Array(512),di=new Int32Array(32);let i=0;for(;i<144;)e.lens[i++]=8;for(;i<256;)e.lens[i++]=9;for(;i<280;)e.lens[i++]=7;for(;i<288;)e.lens[i++]=8;for(qe(ps,e.lens,0,288,fi,0,e.work,{bits:9}),i=0;i<32;)e.lens[i++]=5;qe(vs,e.lens,0,32,di,0,e.work,{bits:5}),Cn=!1}e.lencode=fi,e.lenbits=9,e.distcode=di,e.distbits=5},As=(e,i,t,n)=>{let s;const r=e.state;return r.window===null&&(r.wsize=1<=r.wsize?(r.window.set(i.subarray(t-r.wsize,t),0),r.wnext=0,r.whave=r.wsize):(s=r.wsize-r.wnext,s>n&&(s=n),r.window.set(i.subarray(t-n,t-n+s),r.wnext),n-=s,n?(r.window.set(i.subarray(t-n,t),0),r.wnext=n,r.whave=r.wsize):(r.wnext+=s,r.wnext===r.wsize&&(r.wnext=0),r.whave{let t,n,s,r,a,o,c,l,h,d,u,f,g,v,p=0,m,S,E,_,b,I,x,R;const N=new Uint8Array(4);let y,A;const M=new Uint8Array([16,17,18,0,8,7,9,6,10,5,11,4,12,3,13,2,14,1,15]);if(!e||!e.state||!e.output||!e.input&&e.avail_in!==0)return ee;t=e.state,t.mode===ae&&(t.mode=li),a=e.next_out,s=e.output,c=e.avail_out,r=e.next_in,n=e.input,o=e.avail_in,l=t.hold,h=t.bits,d=o,u=c,R=Re;e:for(;;)switch(t.mode){case ws:if(t.wrap===0){t.mode=li;break}for(;h<16;){if(o===0)break e;o--,l+=n[r++]<>>8&255,t.check=j(t.check,N,2,0),l=0,h=0,t.mode=un;break}if(t.flags=0,t.head&&(t.head.done=!1),!(t.wrap&1)||(((l&255)<<8)+(l>>8))%31){e.msg="incorrect header check",t.mode=C;break}if((l&15)!==dn){e.msg="unknown compression method",t.mode=C;break}if(l>>>=4,h-=4,x=(l&15)+8,t.wbits===0)t.wbits=x;else if(x>t.wbits){e.msg="invalid window size",t.mode=C;break}t.dmax=1<>8&1),t.flags&512&&(N[0]=l&255,N[1]=l>>>8&255,t.check=j(t.check,N,2,0)),l=0,h=0,t.mode=gn;case gn:for(;h<32;){if(o===0)break e;o--,l+=n[r++]<>>8&255,N[2]=l>>>16&255,N[3]=l>>>24&255,t.check=j(t.check,N,4,0)),l=0,h=0,t.mode=_n;case _n:for(;h<16;){if(o===0)break e;o--,l+=n[r++]<>8),t.flags&512&&(N[0]=l&255,N[1]=l>>>8&255,t.check=j(t.check,N,2,0)),l=0,h=0,t.mode=pn;case pn:if(t.flags&1024){for(;h<16;){if(o===0)break e;o--,l+=n[r++]<>>8&255,t.check=j(t.check,N,2,0)),l=0,h=0}else t.head&&(t.head.extra=null);t.mode=vn;case vn:if(t.flags&1024&&(f=t.length,f>o&&(f=o),f&&(t.head&&(x=t.head.extra_len-t.length,t.head.extra||(t.head.extra=new Uint8Array(t.head.extra_len)),t.head.extra.set(n.subarray(r,r+f),x)),t.flags&512&&(t.check=j(t.check,n,f,r)),o-=f,r+=f,t.length-=f),t.length))break e;t.length=0,t.mode=bn;case bn:if(t.flags&2048){if(o===0)break e;f=0;do x=n[r+f++],t.head&&x&&t.length<65536&&(t.head.name+=String.fromCharCode(x));while(x&&f>9&1,t.head.done=!0),e.adler=t.check=0,t.mode=ae;break;case xn:for(;h<32;){if(o===0)break e;o--,l+=n[r++]<>>=h&7,h-=h&7,t.mode=ci;break}for(;h<3;){if(o===0)break e;o--,l+=n[r++]<>>=1,h-=1,l&3){case 0:t.mode=En;break;case 1:if(eo(t),t.mode=xt,i===wt){l>>>=2,h-=2;break e}break;case 2:t.mode=kn;break;case 3:e.msg="invalid block type",t.mode=C}l>>>=2,h-=2;break;case En:for(l>>>=h&7,h-=h&7;h<32;){if(o===0)break e;o--,l+=n[r++]<>>16^65535)){e.msg="invalid stored block lengths",t.mode=C;break}if(t.length=l&65535,l=0,h=0,t.mode=hi,i===wt)break e;case hi:t.mode=Sn;case Sn:if(f=t.length,f){if(f>o&&(f=o),f>c&&(f=c),f===0)break e;s.set(n.subarray(r,r+f),a),o-=f,r+=f,c-=f,a+=f,t.length-=f;break}t.mode=ae;break;case kn:for(;h<14;){if(o===0)break e;o--,l+=n[r++]<>>=5,h-=5,t.ndist=(l&31)+1,l>>>=5,h-=5,t.ncode=(l&15)+4,l>>>=4,h-=4,t.nlen>286||t.ndist>30){e.msg="too many length or distance symbols",t.mode=C;break}t.have=0,t.mode=yn;case yn:for(;t.have>>=3,h-=3}for(;t.have<19;)t.lens[M[t.have++]]=0;if(t.lencode=t.lendyn,t.lenbits=7,y={bits:t.lenbits},R=qe(Ha,t.lens,0,19,t.lencode,0,t.work,y),t.lenbits=y.bits,R){e.msg="invalid code lengths set",t.mode=C;break}t.have=0,t.mode=An;case An:for(;t.have>>24,S=p>>>16&255,E=p&65535,!(m<=h);){if(o===0)break e;o--,l+=n[r++]<>>=m,h-=m,t.lens[t.have++]=E;else{if(E===16){for(A=m+2;h>>=m,h-=m,t.have===0){e.msg="invalid bit length repeat",t.mode=C;break}x=t.lens[t.have-1],f=3+(l&3),l>>>=2,h-=2}else if(E===17){for(A=m+3;h>>=m,h-=m,x=0,f=3+(l&7),l>>>=3,h-=3}else{for(A=m+7;h>>=m,h-=m,x=0,f=11+(l&127),l>>>=7,h-=7}if(t.have+f>t.nlen+t.ndist){e.msg="invalid bit length repeat",t.mode=C;break}for(;f--;)t.lens[t.have++]=x}}if(t.mode===C)break;if(t.lens[256]===0){e.msg="invalid code -- missing end-of-block",t.mode=C;break}if(t.lenbits=9,y={bits:t.lenbits},R=qe(ps,t.lens,0,t.nlen,t.lencode,0,t.work,y),t.lenbits=y.bits,R){e.msg="invalid literal/lengths set",t.mode=C;break}if(t.distbits=6,t.distcode=t.distdyn,y={bits:t.distbits},R=qe(vs,t.lens,t.nlen,t.ndist,t.distcode,0,t.work,y),t.distbits=y.bits,R){e.msg="invalid distances set",t.mode=C;break}if(t.mode=xt,i===wt)break e;case xt:t.mode=Et;case Et:if(o>=6&&c>=258){e.next_out=a,e.avail_out=c,e.next_in=r,e.avail_in=o,t.hold=l,t.bits=h,Oa(e,u),a=e.next_out,s=e.output,c=e.avail_out,r=e.next_in,n=e.input,o=e.avail_in,l=t.hold,h=t.bits,t.mode===ae&&(t.back=-1);break}for(t.back=0;p=t.lencode[l&(1<>>24,S=p>>>16&255,E=p&65535,!(m<=h);){if(o===0)break e;o--,l+=n[r++]<>_)],m=p>>>24,S=p>>>16&255,E=p&65535,!(_+m<=h);){if(o===0)break e;o--,l+=n[r++]<>>=_,h-=_,t.back+=_}if(l>>>=m,h-=m,t.back+=m,t.length=E,S===0){t.mode=Fn;break}if(S&32){t.back=-1,t.mode=ae;break}if(S&64){e.msg="invalid literal/length code",t.mode=C;break}t.extra=S&15,t.mode=In;case In:if(t.extra){for(A=t.extra;h>>=t.extra,h-=t.extra,t.back+=t.extra}t.was=t.length,t.mode=Rn;case Rn:for(;p=t.distcode[l&(1<>>24,S=p>>>16&255,E=p&65535,!(m<=h);){if(o===0)break e;o--,l+=n[r++]<>_)],m=p>>>24,S=p>>>16&255,E=p&65535,!(_+m<=h);){if(o===0)break e;o--,l+=n[r++]<>>=_,h-=_,t.back+=_}if(l>>>=m,h-=m,t.back+=m,S&64){e.msg="invalid distance code",t.mode=C;break}t.offset=E,t.extra=S&15,t.mode=Nn;case Nn:if(t.extra){for(A=t.extra;h>>=t.extra,h-=t.extra,t.back+=t.extra}if(t.offset>t.dmax){e.msg="invalid distance too far back",t.mode=C;break}t.mode=Tn;case Tn:if(c===0)break e;if(f=u-c,t.offset>f){if(f=t.offset-f,f>t.whave&&t.sane){e.msg="invalid distance too far back",t.mode=C;break}f>t.wnext?(f-=t.wnext,g=t.wsize-f):g=t.wnext-f,f>t.length&&(f=t.length),v=t.window}else v=s,g=a-t.offset,f=t.length;f>c&&(f=c),c-=f,t.length-=f;do s[a++]=v[g++];while(--f);t.length===0&&(t.mode=Et);break;case Fn:if(c===0)break e;s[a++]=t.length,c--,t.mode=Et;break;case ci:if(t.wrap){for(;h<32;){if(o===0)break e;o--,l|=n[r++]<{if(!e||!e.state)return ee;let i=e.state;return i.window&&(i.window=null),e.state=null,Re},no=(e,i)=>{if(!e||!e.state)return ee;const t=e.state;return(t.wrap&2)===0?ee:(t.head=i,i.done=!1,Re)},so=(e,i)=>{const t=i.length;let n,s,r;return!e||!e.state||(n=e.state,n.wrap!==0&&n.mode!==Pt)?ee:n.mode===Pt&&(s=1,s=at(s,i,t,0),s!==n.check)?bs:(r=As(e,i,t,t),r?(n.mode=xs,ms):(n.havedict=1,Re))};var ro=Ss,ao=ks,oo=Es,lo=Qa,ho=ys,co=to,fo=io,uo=no,go=so,_o="pako inflate (from Nodeca project)",he={inflateReset:ro,inflateReset2:ao,inflateResetKeep:oo,inflateInit:lo,inflateInit2:ho,inflate:co,inflateEnd:fo,inflateGetHeader:uo,inflateSetDictionary:go,inflateInfo:_o};function po(){this.text=0,this.time=0,this.xflags=0,this.os=0,this.extra=null,this.extra_len=0,this.name="",this.comment="",this.hcrc=0,this.done=!1}var vo=po;const Is=Object.prototype.toString,{Z_NO_FLUSH:bo,Z_FINISH:mo,Z_OK:ht,Z_STREAM_END:ui,Z_NEED_DICT:gi,Z_STREAM_ERROR:wo,Z_DATA_ERROR:On,Z_MEM_ERROR:xo}=Ne;function pt(e){this.options=zt.assign({chunkSize:1024*64,windowBits:15,to:""},e||{});const i=this.options;i.raw&&i.windowBits>=0&&i.windowBits<16&&(i.windowBits=-i.windowBits,i.windowBits===0&&(i.windowBits=-15)),i.windowBits>=0&&i.windowBits<16&&!(e&&e.windowBits)&&(i.windowBits+=32),i.windowBits>15&&i.windowBits<48&&(i.windowBits&15)===0&&(i.windowBits|=15),this.err=0,this.msg="",this.ended=!1,this.chunks=[],this.strm=new gs,this.strm.avail_out=0;let t=he.inflateInit2(this.strm,i.windowBits);if(t!==ht)throw new Error(ye[t]);if(this.header=new vo,he.inflateGetHeader(this.strm,this.header),i.dictionary&&(typeof i.dictionary=="string"?i.dictionary=lt.string2buf(i.dictionary):Is.call(i.dictionary)==="[object ArrayBuffer]"&&(i.dictionary=new Uint8Array(i.dictionary)),i.raw&&(t=he.inflateSetDictionary(this.strm,i.dictionary),t!==ht)))throw new Error(ye[t])}pt.prototype.push=function(e,i){const t=this.strm,n=this.options.chunkSize,s=this.options.dictionary;let r,a,o;if(this.ended)return!1;for(i===~~i?a=i:a=i===!0?mo:bo,Is.call(e)==="[object ArrayBuffer]"?t.input=new Uint8Array(e):t.input=e,t.next_in=0,t.avail_in=t.input.length;;){for(t.avail_out===0&&(t.output=new Uint8Array(n),t.next_out=0,t.avail_out=n),r=he.inflate(t,a),r===gi&&s&&(r=he.inflateSetDictionary(t,s),r===ht?r=he.inflate(t,a):r===On&&(r=gi));t.avail_in>0&&r===ui&&t.state.wrap>0&&e[t.next_in]!==0;)he.inflateReset(t),r=he.inflate(t,a);switch(r){case wo:case On:case gi:case xo:return this.onEnd(r),this.ended=!0,!1}if(o=t.avail_out,t.next_out&&(t.avail_out===0||r===ui))if(this.options.to==="string"){let c=lt.utf8border(t.output,t.next_out),l=t.next_out-c,h=lt.buf2string(t.output,c);t.next_out=l,t.avail_out=n-l,l&&t.output.set(t.output.subarray(c,c+l),0),this.onData(h)}else this.onData(t.output.length===t.next_out?t.output:t.output.subarray(0,t.next_out));if(!(r===ht&&o===0)){if(r===ui)return r=he.inflateEnd(this.strm),this.onEnd(r),this.ended=!0,!0;if(t.avail_in===0)break}}return!0};pt.prototype.onData=function(e){this.chunks.push(e)};pt.prototype.onEnd=function(e){e===ht&&(this.options.to==="string"?this.result=this.chunks.join(""):this.result=zt.flattenChunks(this.chunks)),this.chunks=[],this.err=e,this.msg=this.strm.msg};function Yi(e,i){const t=new pt(i);if(t.push(e),t.err)throw t.msg||ye[t.err];return t.result}function Eo(e,i){return i=i||{},i.raw=!0,Yi(e,i)}var So=pt,ko=Yi,yo=Eo,Ao=Yi,Io=Ne,Ro={Inflate:So,inflate:ko,inflateRaw:yo,ungzip:Ao,constants:Io};const{Deflate:No,deflate:To,deflateRaw:Fo,gzip:Bo}=Da,{Inflate:Po,inflate:Do,inflateRaw:Co,ungzip:Oo}=Ro;var Mo=No,Lo=To,zo=Fo,Uo=Bo,Zo=Po,Ho=Do,Yo=Co,Go=Oo,$o=Ne,Rs={Deflate:Mo,deflate:Lo,deflateRaw:zo,gzip:Uo,Inflate:Zo,inflate:Ho,inflateRaw:Yo,ungzip:Go,constants:$o},Rt=1e-6,ct=typeof Float32Array!="undefined"?Float32Array:Array,Xo=Math.PI/180;function yi(e){return e*Xo}Math.hypot||(Math.hypot=function(){for(var e=0,i=arguments.length;i--;)e+=arguments[i]*arguments[i];return Math.sqrt(e)});function Oe(){var e=new ct(16);return ct!=Float32Array&&(e[1]=0,e[2]=0,e[3]=0,e[4]=0,e[6]=0,e[7]=0,e[8]=0,e[9]=0,e[11]=0,e[12]=0,e[13]=0,e[14]=0),e[0]=1,e[5]=1,e[10]=1,e[15]=1,e}function jo(e,i){return e[0]=i[0],e[1]=i[1],e[2]=i[2],e[3]=i[3],e[4]=i[4],e[5]=i[5],e[6]=i[6],e[7]=i[7],e[8]=i[8],e[9]=i[9],e[10]=i[10],e[11]=i[11],e[12]=i[12],e[13]=i[13],e[14]=i[14],e[15]=i[15],e}function Ai(e){return e[0]=1,e[1]=0,e[2]=0,e[3]=0,e[4]=0,e[5]=1,e[6]=0,e[7]=0,e[8]=0,e[9]=0,e[10]=1,e[11]=0,e[12]=0,e[13]=0,e[14]=0,e[15]=1,e}function ze(e,i,t){var n=t[0],s=t[1],r=t[2],a,o,c,l,h,d,u,f,g,v,p,m;return i===e?(e[12]=i[0]*n+i[4]*s+i[8]*r+i[12],e[13]=i[1]*n+i[5]*s+i[9]*r+i[13],e[14]=i[2]*n+i[6]*s+i[10]*r+i[14],e[15]=i[3]*n+i[7]*s+i[11]*r+i[15]):(a=i[0],o=i[1],c=i[2],l=i[3],h=i[4],d=i[5],u=i[6],f=i[7],g=i[8],v=i[9],p=i[10],m=i[11],e[0]=a,e[1]=o,e[2]=c,e[3]=l,e[4]=h,e[5]=d,e[6]=u,e[7]=f,e[8]=g,e[9]=v,e[10]=p,e[11]=m,e[12]=a*n+h*s+g*r+i[12],e[13]=o*n+d*s+v*r+i[13],e[14]=c*n+u*s+p*r+i[14],e[15]=l*n+f*s+m*r+i[15]),e}function Ns(e,i,t){var n=t[0],s=t[1],r=t[2];return e[0]=i[0]*n,e[1]=i[1]*n,e[2]=i[2]*n,e[3]=i[3]*n,e[4]=i[4]*s,e[5]=i[5]*s,e[6]=i[6]*s,e[7]=i[7]*s,e[8]=i[8]*r,e[9]=i[9]*r,e[10]=i[10]*r,e[11]=i[11]*r,e[12]=i[12],e[13]=i[13],e[14]=i[14],e[15]=i[15],e}function Vo(e,i,t,n){var s=n[0],r=n[1],a=n[2],o=Math.hypot(s,r,a),c,l,h,d,u,f,g,v,p,m,S,E,_,b,I,x,R,N,y,A,M,D,B,q;return o0&&(r=1/Math.sqrt(r)),e[0]=i[0]*r,e[1]=i[1]*r,e[2]=i[2]*r,e}function tl(e,i,t){var n=i[0],s=i[1],r=i[2],a=t[0],o=t[1],c=t[2];return e[0]=s*c-r*o,e[1]=r*a-n*c,e[2]=n*o-s*a,e}function il(e,i,t){var n=i[0],s=i[1],r=i[2],a=t[3]*n+t[7]*s+t[11]*r+t[15];return a=a||1,e[0]=(t[0]*n+t[4]*s+t[8]*r+t[12])/a,e[1]=(t[1]*n+t[5]*s+t[9]*r+t[13])/a,e[2]=(t[2]*n+t[6]*s+t[10]*r+t[14])/a,e}function nl(e,i){var t=e[0],n=e[1],s=e[2],r=i[0],a=i[1],o=i[2];return Math.abs(t-r)<=Rt*Math.max(1,Math.abs(t),Math.abs(r))&&Math.abs(n-a)<=Rt*Math.max(1,Math.abs(n),Math.abs(a))&&Math.abs(s-o)<=Rt*Math.max(1,Math.abs(s),Math.abs(o))}(function(){var e=Ts();return function(i,t,n,s,r,a){var o,c;for(t||(t=3),n||(n=0),s?c=Math.min(s*t+n,i.length):c=i.length,o=n;o=t)return;let n=this.buffer.byteLength;for(;nthis.buffer.byteLength&&r.fill(0,this.buffer.byteLength,this.offset),this.buffer=s,this.dataView=new DataView(s),this.arrayView=r}getData(){return this.accommodate(0),this.arrayView.slice(0,this.offset)}end(i){}writeNum(i,t,n){this.accommodate(t),this.dataView[i](this.offset,n,this.littleEndian),this.offset+=t}long(i){this.int(i[0]),this.int(i[1])}byteArray(i){this.int(i.length),this.accommodate(i.length),this.arrayView.set(i,this.offset),this.offset+=i.length}intArray(i){this.int(i.length);for(let t=0;t>6),a.push(128|63&r)):r<65536?(a.push(224|r>>12),a.push(128|r>>6&63),a.push(128|63&r)):(a.push(240|r>>18&7),a.push(128|r>>12&63),a.push(128|r>>6&63),a.push(128|63&r));return a}(i);this.short(t.length),this.accommodate(t.length),this.arrayView.set(t,this.offset),this.offset+=t.length}list(i){this.byte(Qe[i.type]),this.int(i.value.length),i.value;for(let t=0;t>16),n.setInt16(a+1,65535&s),n.setInt8(a+3,o),n.setInt32(a+4096,r.timestamp);const c=4096*s;n.setInt32(c,r.data.length+1),n.setInt8(c+4,r.compression),t.set(r.data,c+5),s+=o}return t}function Nl(e,i,t,n){const s=Bs(e,i,t);switch(s.compression){case 1:s.data=Ii(n);break;case 2:s.data=Ii(n,!1,!0);break;case 3:s.data=$i(n);break;default:throw new Error(`Invalid compression mode ${s.compression}`)}return s}function Bs(e,i,t){const n=e.find(s=>s.x===i&&s.z===t);if(n===void 0)throw new Error(`Cannot find chunk [${i}, ${t}]`);return n}function Me(e,i,t){if(!e[i])throw new Error(`Missing ${i} tag`);if(e[i].type!==t)throw new Error(`Expected ${i} to be of type ${t}, but found ${e[i].type}`);return e[i].value}function St(e,i,t,n){const s=Me(e,i,"list");if(s.type!==t)throw new Error(`Expected ${i} to be a list of ${t}s, but found ${s.type}s`);if(n&&s.value.length!==n)throw new Error(`Expected ${i} to be a list of length ${n}, but found length ${s.value.length}`);return s.value}function Ps(e,i){try{return e()}catch{return i}}var w,re,Ri,Le,et;(function(e){function i(t){return typeof t=="object"&&t!==null?t:void 0}e.readNumber=function(t){return typeof t=="number"?t:void 0},e.readInt=function(t){return typeof t=="number"?Math.floor(t):void 0},e.readString=function(t){return typeof t=="string"?t:void 0},e.readBoolean=function(t){return typeof t=="boolean"?t:void 0},e.readObject=i,e.readArray=function(t,n){if(Array.isArray(t))return t.map(s=>n(s))},e.readMap=function(t,n){var s;const r=(s=i(t))!==null&&s!==void 0?s:{};return Object.fromEntries(Object.entries(r).map(([a,o])=>[a,n(o)]))},e.compose=function(t,n,s){const r=n(t);return r?s(r):void 0}})(w||(w={}));class V{constructor(i,t={}){this.name=i,this.properties=t}getName(){return this.name}getProperties(){return this.properties}getProperty(i){return this.properties[i]}isFluid(){return this.name==="minecraft:water"||this.name==="minecraft:lava"}equals(i){return this.name===i.name&&Object.keys(this.properties).every(t=>i.properties[t]===this.properties[t])}toString(){return Object.keys(this.properties).length===0?this.name:`${this.name}[${Object.entries(this.properties).map(([i,t])=>i+"="+t).join(",")}]`}static fromNbt(i){const t=Me(i.value,"Name","string"),n=Ps(()=>Me(i.value,"Properties","compound"),{}),s=Object.keys(n).reduce((r,a)=>Object.assign(Object.assign({},r),{[a]:Me(n,a,"string")}),{});return new V(t,s)}static fromJson(i){var t,n;const s=(t=w.readObject(i))!==null&&t!==void 0?t:{},r=(n=w.readString(s.Name))!==null&&n!==void 0?n:"minecraft:stone",a=w.readMap(s.Properties,o=>{var c;return(c=w.readString(o))!==null&&c!==void 0?c:""});return new V(r,a)}}V.AIR=new V("minecraft:air");class pe{constructor(i){this.minY=i,this.storage=Array(pe.SIZE),this.palette=[V.AIR]}get minBlockY(){return this.minY<<4}index(i,t,n){return(i<<8)+(t<<4)+n}getBlockState(i,t,n){var s;const r=this.storage[this.index(i,t,n)];return(s=this.palette[r])!==null&&s!==void 0?s:V.AIR}setBlockState(i,t,n,s){let r=this.palette.findIndex(a=>a.equals(s));r===-1&&(r=this.palette.length,this.palette.push(s)),this.storage[this.index(i,t,n)]=r}}pe.WIDTH=16,pe.SIZE=pe.WIDTH*pe.WIDTH*pe.WIDTH;class Tl{constructor(i,t,n){this.minY=i,this.height=t,this.pos=n,this.sections=Array(this.sectionsCount).fill(null)}get maxY(){return this.minY+this.height}get minSection(){return this.minY>>4}get maxSection(){return 1+(this.maxY-1>>4)}get sectionsCount(){return this.maxSection-this.minSection}getSectionIndex(i){return(i>>4)-this.minSection}getBlockState(i){var t;const[n,s,r]=i,a=this.sections[this.getSectionIndex(s)];return(t=a==null?void 0:a.getBlockState(15&n,15&s,15&r))!==null&&t!==void 0?t:V.AIR}setBlockState(i,t){const[n,s,r]=i,a=this.getSectionIndex(s);let o=this.sections[a];if(o===null){if(t.equals(V.AIR))return;o=this.getOrCreateSection(a)}o.setBlockState(15&n,15&s,15&r,t)}getOrCreateSection(i){return this.sections[i]==null&&(this.sections[i]=new pe(this.minSection+i)),this.sections[i]}}(function(e){function i(t,n){return BigInt(4294967295&t)|BigInt(4294967295&n)<>4,t[2]>>4]},e.fromLong=function(t){return[4294967295&Number(t),Number(t>>BigInt(32))]},e.toLong=function(t){return i(t[0],t[1])},e.asLong=i,e.minBlockX=function(t){return t[0]<<4},e.minBlockZ=function(t){return t[1]<<4},e.maxBlockX=function(t){return 15+(t[0]<<4)},e.maxBlockZ=function(t){return 15+(t[1]<<4)}})(re||(re={}));class Ds{constructor(i,t=[],n=[]){this.size=i,this.palette=t,this.blocks=n,this.blocksMap=[],n.forEach(s=>{if(!this.isInside(s.pos))throw new Error(`Found block at ${s.pos} which is outside the structure bounds ${this.size}`);this.blocksMap[s.pos[0]*i[1]*i[2]+s.pos[1]*i[2]+s.pos[2]]=s})}getSize(){return this.size}addBlock(i,t,n,s){if(!this.isInside(i))throw new Error(`Cannot add block at ${i} outside the structure bounds ${this.size}`);const r=new V(t,n);let a=this.palette.findIndex(o=>o.equals(r));return a===-1&&(a=this.palette.length,this.palette.push(r)),this.blocks.push({pos:i,state:a,nbt:s}),this.blocksMap[i[0]*this.size[1]*this.size[2]+i[1]*this.size[2]+i[2]]={pos:i,state:a,nbt:s},this}getBlocks(){return this.blocks.map(i=>({pos:i.pos,state:this.palette[i.state],nbt:i.nbt}))}getBlock(i){if(!this.isInside(i))return null;const t=this.blocksMap[i[0]*this.size[1]*this.size[2]+i[1]*this.size[2]+i[2]];return t?{pos:t.pos,state:this.palette[t.state],nbt:t.nbt}:null}isInside(i){return i[0]>=0&&i[0]=0&&i[1]=0&&i[2]V.fromNbt({name:"",value:r})),s=St(i.value,"blocks","compound").map(r=>({pos:St(r,"pos","int",3),state:Me(r,"state","int"),nbt:Ps(()=>Me(r,"nbt","compound"),void 0)}));return new Ds(t,n,s)}}function _i(e){let i=null;return()=>(i==null&&(i=e()),i)}function Xi(e,i,t){const n=e.get(i);if(n)return n;const s=t(i);return e.set(i,s),s}function oe(e){return e*e}function ue(e,i,t){return Math.max(i,Math.min(t,e))}function $(e,i,t){return i+e*(t-i)}function Ni(e,i,t,n,s,r){return $(i,$(e,t,n),$(e,s,r))}function ol(e,i,t,n,s,r,a,o,c,l,h){return $(t,Ni(e,i,n,s,r,a),Ni(e,i,o,c,l,h))}function ft(e,i,t){return t<0?e:t>1?i:$(t,e,i)}function Cs(e,i,t){return(e-i)/(t-i)}function pi(e){return e*e*e*(e*(6*e-15)+10)}function ge(e,i,t,n,s){return $(Cs(e,i,t),n,s)}function ll(e,i,t,n,s){return ft(n,s,Cs(e,i,t))}function hl(e,i,t){let n=i-e;for(;n>0;){const s=Math.floor(n/2),r=e+s;t(r)?n=s:(e=r+1,n-=s+1)}return e}function Os(e,i,t){let n=BigInt(3129871*e)^BigInt(t)*BigInt(116129781)^BigInt(i);return n=n*n*BigInt(42317861)+n*BigInt(11),n>>BigInt(16)}function Ti(e,i,t,n,s,r,a,o){return BigInt(e)<>BigInt(z.MODULUS_BITS-i));return t>2147483647?t-4294967296:t}nextInt(i){if(i===void 0)return this.next(32);if((i&i-1)==0)return Number(BigInt(i)*BigInt(this.next(31))>>BigInt(31));let t,n;for(;(t=this.next(31))-(n=t%i)+(i-1)<0;);return n}nextLong(){return(BigInt(this.next(32))<>BigInt(30))*BigInt("-4658895280553007687")&BigInt("0xFFFFFFFFFFFFFFFF"))^i>>BigInt(27))*BigInt("-7723592293110705685")&BigInt("0xFFFFFFFFFFFFFFFF"))^i>>BigInt(31))&BigInt("0xFFFFFFFFFFFFFFFF")}static upgradeSeedTo128bit(i){i<0&&(i+=BigInt("0x10000000000000000"));const t=i^P.SILVER_RATIO_64,n=t+P.GOLDEN_RATIO_64&BigInt("0xFFFFFFFFFFFFFFFF");return[P.mixStafford13(t),P.mixStafford13(n)]}static rotateLeft(i,t){return i<>BigInt(64)-t}setSeed(i){this.seed=P.upgradeSeedTo128bit(i)}fork(){return new P([this.next(),this.next()])}forkPositional(){return new fl(this.next(),this.next())}next(){const i=this.seed[0];let t=this.seed[1];const n=P.rotateLeft(i+t&BigInt("0xFFFFFFFFFFFFFFFF"),BigInt(17))+i&BigInt("0xFFFFFFFFFFFFFFFF");return t^=i,this.seed=[P.rotateLeft(i,BigInt(49))^t^t<BigInt("0x8000000000000000")&&(i-=BigInt("0x10000000000000000")),i}consume(i){let t=this.seed[0],n=this.seed[1];for(let s=0;s>BigInt(64-i)}nextInt(i){let t=this.next()&BigInt(4294967295);if(i){const n=BigInt(i);let s=t*n,r=s&BigInt(4294967295);if(r>BigInt(32);return Number(a)}{let n=Number(t);return n>=2147483648&&(n-=4294967296),n}}nextFloat(){return Number(this.nextBits(24))*P.FLOAT_MULTIPLIER}nextDouble(){return Number(this.nextBits(53))*P.DOUBLE_MULTIPLIER}parityConfigString(){return"seedLo: "+this.seed[0]+", seedHi: "+this.seed[1]}}P.SILVER_RATIO_64=BigInt("7640891576956012809"),P.GOLDEN_RATIO_64=BigInt("-7046029254386353131"),P.FLOAT_MULTIPLIER=1/Math.pow(2,24),P.DOUBLE_MULTIPLIER=11102230246251565e-32;class fl{constructor(i,t){this.seedLo=i,this.seedHi=t}at(i,t,n){const s=Os(i,t,n)^this.seedLo;return new P([s,this.seedHi])}fromHashOf(i){const t=jn(i,{asBytes:!0}),n=Ti(t[0],t[1],t[2],t[3],t[4],t[5],t[6],t[7]),s=Ti(t[8],t[9],t[10],t[11],t[12],t[13],t[14],t[15]);return new P([n^this.seedLo,s^this.seedHi])}}class Z{constructor(i){this.xo=256*i.nextDouble(),this.yo=256*i.nextDouble(),this.zo=256*i.nextDouble(),this.p=Array(256);for(let t=0;t<256;t+=1)this.p[t]=t;for(let t=0;t<256;t+=1){const n=i.nextInt(256-t),s=this.p[t];this.p[t]=this.p[t+n],this.p[t+n]=s}}sample2D(i,t){let n,s,r;const a=(i+t)*Z.F2,o=Math.floor(i+a),c=i-(o-(n=(o+(s=Math.floor(t+a)))*Z.G2));let l,h;c>(r=t-(s-n))?(l=1,h=0):(l=0,h=1);const d=c-l+Z.G2,u=r-h+Z.G2,f=c-1+2*Z.G2,g=r-1+2*Z.G2,v=255&o,p=255&s,m=this.P(v+this.P(p))%12,S=this.P(v+l+this.P(p+h))%12,E=this.P(v+1+this.P(p+1))%12;return 70*(this.getCornerNoise3D(m,c,r,0,.5)+this.getCornerNoise3D(S,d,u,0,.5)+this.getCornerNoise3D(E,f,g,0,.5))}sample(i,t,n){const s=.3333333333333333*(i+t+n),r=Math.floor(i+s),a=Math.floor(t+s),o=Math.floor(n+s),c=.16666666666666666*(r+a+o),l=i-(r-c),h=t-(a-c),d=n-(o-c);let u,f,g,v,p,m;l>=h?h>=d?(u=1,f=0,g=0,v=1,p=1,m=0):l>=d?(u=1,f=0,g=0,v=1,p=0,m=1):(u=0,f=0,g=1,v=1,p=0,m=1):h127?t-256:t;for(let t=0;t<256;t+=1){const n=i.nextInt(256-t),s=this.p[t];this.p[t]=this.p[t+n],this.p[t+n]=s}}sample(i,t,n,s=0,r=0){const a=i+this.xo,o=t+this.yo,c=n+this.zo,l=Math.floor(a),h=Math.floor(o),d=Math.floor(c),u=a-l,f=o-h,g=c-d;let v=0;if(s!==0){const p=r>=0&&r=0;s-=1)s0&&(s=this.maxLimitNoise.getOctaveNoise(l))&&(c+=s.sample(u,f,g,d,t*d)/a),a/=2}return ft(o/512,c/512,r)/128}}(function(e){e.fromJson=function(i){var t,n,s,r,a;const o=(t=w.readObject(i))!==null&&t!==void 0?t:{};return{xzScale:(n=w.readNumber(o.xz_scale))!==null&&n!==void 0?n:1,yScale:(s=w.readNumber(o.y_scale))!==null&&s!==void 0?s:1,xzFactor:(r=w.readNumber(o.xz_factor))!==null&&r!==void 0?r:80,yFactor:(a=w.readNumber(o.y_factor))!==null&&a!==void 0?a:80}}})(Ri||(Ri={}));class ce{constructor(i,{firstOctave:t,amplitudes:n}){this.first=new W(i,t,n),this.second=new W(i,t,n);let s=1/0,r=-1/0;for(let o=0;o{var o;return(o=w.readNumber(a))!==null&&o!==void 0?o:0}))!==null&&s!==void 0?s:[]}}}(Le||(Le={}));class Fl{constructor(i,t){const n=t[t.length-1],s=-t[0]+n+1,r=new Set(t),a=new Z(i);this.noiseLevels=Array(s),n>=0&&n=0&&r.has(n-o)?this.noiseLevels[o]=new Z(i):i.consume(262);if(n>0)throw new Error("Positive octaves are not allowed");this.highestFreqInputFactor=Math.pow(2,n),this.highestFreqValueFactor=1/(Math.pow(2,s)-1)}sample(i,t,n){let s=0,r=this.highestFreqInputFactor,a=this.highestFreqValueFactor;for(let o=0;o{var d;return(d=w.readObject(h))!==null&&d!==void 0?d:{}}))!==null&&s!==void 0?s:[];if(l.length===0)return new Fi(0);for(const h of l){const d=(r=w.readNumber(h.location))!==null&&r!==void 0?r:0,u=e.fromJson(h.value,t),f=(a=w.readNumber(h.derivative))!==null&&a!==void 0?a:0;c.addPoint(d,u,f)}return c}})(et||(et={}));class Fi{constructor(i){this.value=i}apply(){return this.value}toJson(){return this.value}}class G{constructor(i,t=[],n=[],s=[]){this.coordinate=i,this.locations=t,this.values=n,this.derivatives=s}apply(i){const t=this.coordinate.apply(i),n=hl(0,this.locations.length,g=>t({location:i,value:this.values[t].toJson(),derivative:this.derivatives[t]}))}}}const Ye=e=>[(e>>16&255)/256,(e>>8&255)/256,(255&e)/256],Ee=[124/256,189/256,107/256],dl=Ye(6396257),ul=Ye(8431445),je=Ye(4764952),vi=Ye(4159204),Zn=Ye(8431445),gl=Ye(2129968),Hn=e=>[e/8,1-e/32,64*e],Yn={large_fern:()=>Ee,tall_grass:()=>Ee,grass_block:()=>Ee,fern:()=>Ee,grass:()=>Ee,potted_fern:()=>Ee,spruce_leaves:()=>dl,birch_leaves:()=>ul,oak_leaves:()=>je,jungle_leaves:()=>je,acacia_leaves:()=>je,dark_oak_leaves:()=>je,vine:()=>je,water:()=>vi,bubble_column:()=>vi,cauldron:()=>vi,redstone_wire:e=>{var i;return(t=>{const n=t/15;return[.6*n+(n>0?.4:.3),ue(n*n*.7-.5,0,1),ue(n*n*.6-.7,0,1)]})(parseInt((i=e.power)!==null&&i!==void 0?i:"0"))},sugar_cane:()=>Ee,attached_melon_stem:()=>Zn,attached_pumpkin_stem:()=>Zn,melon_stem:e=>{var i;return Hn(parseInt((i=e.age)!==null&&i!==void 0?i:"0"))},pumpkin_stem:e=>{var i;return Hn(parseInt((i=e.age)!==null&&i!==void 0?i:"0"))},lily_pad:()=>gl};var Bi;function Dt(...e){let i=0;for(const s of e)i+=s.length;const t=new Float32Array(i);let n=0;for(const s of e)t.set(s,n),n+=s.length;return t}function Ct(e,i){const t=Ts();for(let n=0;nthis.matchesVariant(s,i));if(t.length===0)return[];const n=this.variants[t[0]];return[Array.isArray(n)?n[0]:n]}return this.multipart?this.multipart.filter(t=>!t.when||this.matchesCase(t.when,i)).map(t=>Array.isArray(t.apply)?t.apply[0]:t.apply):[]}getBuffers(i,t,n,s,r,a){var o,c,l,h;const d=this.getModelVariants(t),u=[],f=[],g=[],v=[];for(const S of d){const E=Bi.rotate(a,(o=S.x)!==null&&o!==void 0?o:0,(c=S.y)!==null&&c!==void 0?c:0),_=s.getBlockModel(S.model).getBuffers(i,t,n,r,E);if(S.x||S.y){const b=Oe();Ai(b),ze(b,b,[8,8,8]),Wo(b,b,-yi((l=S.y)!==null&&l!==void 0?l:0)),Jo(b,b,-yi((h=S.x)!==null&&h!==void 0?h:0)),ze(b,b,[-8,-8,-8]),Ct(_.position,b)}u.push(_.position),f.push(..._.texCoord),g.push(..._.tintColor),v.push(..._.index),r+=_.texCoord.length/2}const p=Oe();Ai(p),Ns(p,p,[.0625,.0625,.0625]);const m=Dt(...u);return Ct(m,p),{position:m,texCoord:f,tintColor:g,index:v}}matchesVariant(i,t){return i.split(",").every(n=>{const[s,r]=n.split("=");return t[s]===r})}matchesCase(i,t){if(Array.isArray(i.OR))return i.OR.some(s=>this.matchesCase(s,t));const n=i;return Object.keys(n).every(s=>n[s].split("|").includes(t[s]))}static fromJson(i,t){return new ji(i,t.variants,t.multipart)}}const _l={0:[0,3,2,3,2,1,0,1],90:[2,3,2,1,0,1,0,3],180:[2,1,0,1,0,3,2,3],270:[0,1,0,3,2,3,2,1]},pl={x:[1,0,0],y:[0,1,0],z:[0,0,1]},Pe=1.41421356237,vl={x:[1,Pe,Pe],y:[Pe,1,Pe],z:[Pe,Pe,1]};class Ut{constructor(i,t,n,s){this.id=i,this.parent=t,this.textures=n,this.elements=s,this.flattened=!1}getBuffers(i,t,n,s,r){var a;const o=[],c=[],l=[],h=[];for(const d of(a=this.elements)!==null&&a!==void 0?a:[]){const u=this.getElementBuffers(i,t,d,s,n,r);o.push(u.position),c.push(...u.texCoord),l.push(...u.tintColor),h.push(...u.index),s+=u.texCoord.length/2}return{position:Dt(...o),texCoord:c,tintColor:l,index:h}}getElementBuffers(i,t,n,s,r,a){var o,c,l,h,d,u,f,g,v,p,m,S;const E=n.from[0],_=n.from[1],b=n.from[2],I=n.to[0],x=n.to[1],R=n.to[2],N=[],y=[],A=[],M=[],D=(Y,L,Zs)=>{var Zt,Ht,Yt,Gt,$t,Xt,jt,Vt,Jt,Wt,Kt,qt;const[Ge,$e,Hs,Ys]=r.getTextureUV(this.getTexture(Y.texture)),Qt=(Hs-Ge)/16,ei=(Ys-$e)/16,Vi=Qt/16,Ji=ei/16;L[0]=((Ht=(Zt=Y.uv)===null||Zt===void 0?void 0:Zt[0])!==null&&Ht!==void 0?Ht:L[0])*Qt+Vi,L[1]=((Gt=(Yt=Y.uv)===null||Yt===void 0?void 0:Yt[1])!==null&&Gt!==void 0?Gt:L[1])*ei+Ji,L[2]=((Xt=($t=Y.uv)===null||$t===void 0?void 0:$t[2])!==null&&Xt!==void 0?Xt:L[2])*Qt-Vi,L[3]=((Vt=(jt=Y.uv)===null||jt===void 0?void 0:jt[3])!==null&&Vt!==void 0?Vt:L[3])*ei-Ji;const fe=_l[(Jt=Y.rotation)!==null&&Jt!==void 0?Jt:0];y.push(Ge+L[fe[0]],$e+L[fe[1]],Ge+L[fe[2]],$e+L[fe[3]],Ge+L[fe[4]],$e+L[fe[5]],Ge+L[fe[6]],$e+L[fe[7]]);const vt=((Wt=Y.tintindex)!==null&&Wt!==void 0?Wt:-1)>=0&&(qt=(Kt=Yn[i.slice(10)])===null||Kt===void 0?void 0:Kt.call(Yn,t))!==null&&qt!==void 0?qt:[1,1,1];A.push(...vt,...vt,...vt,...vt),N.push(...Zs),M.push(s,s+1,s+2,s,s+2,s+3),s+=4};!(!((c=(o=n.faces)===null||o===void 0?void 0:o.up)===null||c===void 0)&&c.texture)||n.faces.up.cullface&&a[n.faces.up.cullface]||D(n.faces.up,[E,16-R,I,16-b],[E,x,R,I,x,R,I,x,b,E,x,b]),!(!((h=(l=n.faces)===null||l===void 0?void 0:l.down)===null||h===void 0)&&h.texture)||n.faces.down.cullface&&a[n.faces.down.cullface]||D(n.faces.down,[16-R,16-I,16-b,16-E],[E,_,b,I,_,b,I,_,R,E,_,R]),!(!((u=(d=n.faces)===null||d===void 0?void 0:d.south)===null||u===void 0)&&u.texture)||n.faces.south.cullface&&a[n.faces.south.cullface]||D(n.faces.south,[E,16-x,I,16-_],[E,_,R,I,_,R,I,x,R,E,x,R]),!(!((g=(f=n.faces)===null||f===void 0?void 0:f.north)===null||g===void 0)&&g.texture)||n.faces.north.cullface&&a[n.faces.north.cullface]||D(n.faces.north,[16-I,16-x,16-E,16-_],[I,_,b,E,_,b,E,x,b,I,x,b]),!(!((p=(v=n.faces)===null||v===void 0?void 0:v.east)===null||p===void 0)&&p.texture)||n.faces.east.cullface&&a[n.faces.east.cullface]||D(n.faces.east,[16-R,16-x,16-b,16-_],[I,_,R,I,_,b,I,x,b,I,x,R]),!(!((S=(m=n.faces)===null||m===void 0?void 0:m.west)===null||S===void 0)&&S.texture)||n.faces.west.cullface&&a[n.faces.west.cullface]||D(n.faces.west,[b,16-x,R,16-_],[E,_,b,E,_,R,E,x,R,E,x,b]);const B=Oe();if(Ai(B),n.rotation){const Y=Nt(...n.rotation.origin);ze(B,B,Y),Vo(B,B,yi(n.rotation.angle),pl[n.rotation.axis]),n.rotation.rescale&&Ns(B,B,vl[n.rotation.axis]),Qo(Y,Y),ze(B,B,Y)}const q=new Float32Array(N);return Ct(q,B),{position:q,texCoord:y,tintColor:A,index:M}}getTexture(i){for(var t,n;i.startsWith("#");)i=(n=(t=this.textures)===null||t===void 0?void 0:t[i.slice(1)])!==null&&n!==void 0?n:"";return i.startsWith("minecraft:")||(i="minecraft:"+i),i}flatten(i){var t;if(!this.flattened&&this.parent){const n=i.getBlockModel(this.parent);if(!n)return console.warn(`parent ${this.parent} does not exist!`),void(this.flattened=!0);n.flatten(i),this.elements||(this.elements=n.elements),this.textures||(this.textures={}),Object.keys((t=n.textures)!==null&&t!==void 0?t:{}).forEach(s=>{this.textures[s]||(this.textures[s]=n.textures[s])}),this.flattened=!0}}static fromJson(i,t){let n=t.parent;return n&&!n.startsWith("minecraft:")&&(n="minecraft:"+n),new Ut(i,n,t.textures,t.elements)}}class bi{constructor(i,t,n){this.gl=i,this.program=this.initShaderProgram(t,n)}getProgram(){return this.program}initShaderProgram(i,t){const n=this.loadShader(this.gl.VERTEX_SHADER,i),s=this.loadShader(this.gl.FRAGMENT_SHADER,t),r=this.gl.createProgram();if(this.gl.attachShader(r,n),this.gl.attachShader(r,s),this.gl.linkProgram(r),!this.gl.getProgramParameter(r,this.gl.LINK_STATUS))throw new Error(`Unable to link shader program: ${this.gl.getProgramInfoLog(r)}`);return r}loadShader(i,t){const n=this.gl.createShader(i);if(this.gl.shaderSource(n,t),this.gl.compileShader(n),!this.gl.getShaderParameter(n,this.gl.COMPILE_STATUS)){const s=new Error(`Compiling ${i===this.gl.VERTEX_SHADER?"vertex":"fragment"} shader: ${this.gl.getShaderInfoLog(n)}`);throw this.gl.deleteShader(n),s}return n}}function Ms(e,i,t,n,s){const r=new ji("",{"":{model:""}},void 0),a={getBlockModel:()=>s};return s.flatten(a),r.getBuffers(e,{},i,a,t,n)}function Gn(e,i,t,n,s,r){const a=s.up?16:[14.2,12.5,10.5,9,7,5.3,3.7,1.9,16,16,16,16,16,16,16,16][t];return Ms(`minecraft:${e}`,n,i,s,new Ut("","",{still:`minecraft:block/${e}_still`,flow:`minecraft:block/${e}_flow`},[{from:[0,0,0],to:[16,a,16],faces:{up:{texture:"#still",tintindex:r,cullface:O.UP},down:{texture:"#still",tintindex:r,cullface:O.DOWN},north:{texture:"#flow",tintindex:r,cullface:O.NORTH},east:{texture:"#flow",tintindex:r,cullface:O.EAST},south:{texture:"#flow",tintindex:r,cullface:O.SOUTH},west:{texture:"#flow",tintindex:r,cullface:O.WEST}}}]))}const Ls={"minecraft:water":(e,i,t,n)=>Gn("water",e,parseInt(i.level),t,n,0),"minecraft:lava":(e,i,t,n)=>Gn("lava",e,parseInt(i.level),t,n),"minecraft:chest":(e,i,t)=>function(n,s,r,a){return Ms("minecraft:chest",a,n,{},new Ut("","",{0:"minecraft:block/chest"},[{from:[1,0,1],to:[15,14,15],faces:{up:{texture:"#0"},down:{texture:"#0"},north:{texture:"#0"},east:{texture:"#0"},south:{texture:"#0"},west:{texture:"#0"}}}]))}(e,i.facing,i.type,t)},bl=new Set(Object.keys(Ls));class Bl{constructor(i,t,n,s){var r,a;this.gl=i,this.structure=t,this.resources=n,this.chunks=[],s!=null&&s.facesPerBuffer&&console.warn("webgl render warning: facesPerBuffer option has been removed in favor of chunkSize"),this.chunkSize=(r=s==null?void 0:s.chunkSize)!==null&&r!==void 0?r:16,this.useInvisibleBlockBuffer=(a=s==null?void 0:s.useInvisibleBlockBuffer)===null||a===void 0||a,this.shaderProgram=new bi(i,`
+ attribute vec4 vertPos;
+ attribute vec2 texCoord;
+ attribute vec3 tintColor;
+ attribute vec3 normal;
+
+ uniform mat4 mView;
+ uniform mat4 mProj;
+
+ varying highp vec2 vTexCoord;
+ varying highp vec3 vTintColor;
+ varying highp float vLighting;
+
+ void main(void) {
+ gl_Position = mProj * mView * vertPos;
+ vTexCoord = texCoord;
+ vTintColor = tintColor;
+ vLighting = normal.y * 0.2 + abs(normal.z) * 0.1 + 0.8;
+ }
+`,`
+ precision highp float;
+ varying highp vec2 vTexCoord;
+ varying highp vec3 vTintColor;
+ varying highp float vLighting;
+
+ uniform sampler2D sampler;
+
+ void main(void) {
+ vec4 texColor = texture2D(sampler, vTexCoord);
+ if(texColor.a < 0.01) discard;
+ gl_FragColor = vec4(texColor.xyz * vTintColor * vLighting, texColor.a);
+ }
+`).getProgram(),this.gridShaderProgram=new bi(i,`
+ attribute vec4 vertPos;
+ attribute vec3 vertColor;
+
+ uniform mat4 mView;
+ uniform mat4 mProj;
+
+ varying highp vec3 vColor;
+
+ void main(void) {
+ gl_Position = mProj * mView * vertPos;
+ vColor = vertColor;
+ }
+`,`
+ precision highp float;
+ varying highp vec3 vColor;
+
+ void main(void) {
+ gl_FragColor = vec4(vColor, 1.0);
+ }
+`).getProgram(),this.colorShaderProgram=new bi(i,`
+ attribute vec4 vertPos;
+ attribute vec3 blockPos;
+
+ uniform mat4 mView;
+ uniform mat4 mProj;
+
+ varying highp vec3 vColor;
+
+ void main(void) {
+ gl_Position = mProj * mView * vertPos;
+ vColor = blockPos / 256.0;
+ }
+`,`
+ precision highp float;
+ varying highp vec3 vColor;
+
+ void main(void) {
+ gl_FragColor = vec4(vColor, 1.0);
+ }
+`).getProgram(),this.updateStructureBuffers(),this.gridBuffers=this.getGridBuffers(),this.outlineBuffers=this.getOutlineBuffers(),this.invisibleBlockBuffers=this.getInvisibleBlockBuffers(),this.atlasTexture=this.getBlockTexture(),this.projMatrix=this.getPerspective(),this.activeShader=this.shaderProgram,this.initialize()}setStructure(i){this.structure=i,this.updateStructureBuffers(),this.gridBuffers=this.getGridBuffers(),this.invisibleBlockBuffers=this.getInvisibleBlockBuffers()}initialize(){this.gl.enable(this.gl.DEPTH_TEST),this.gl.depthFunc(this.gl.LEQUAL),this.gl.enable(this.gl.BLEND),this.gl.blendFunc(this.gl.SRC_ALPHA,this.gl.ONE_MINUS_SRC_ALPHA),this.gl.enable(this.gl.CULL_FACE),this.gl.cullFace(this.gl.BACK)}getBlockTexture(){const i=this.gl.createTexture();return this.gl.bindTexture(this.gl.TEXTURE_2D,i),this.gl.texImage2D(this.gl.TEXTURE_2D,0,this.gl.RGBA,this.gl.RGBA,this.gl.UNSIGNED_BYTE,this.resources.getTextureAtlas()),this.gl.generateMipmap(this.gl.TEXTURE_2D),this.gl.texParameteri(this.gl.TEXTURE_2D,this.gl.TEXTURE_MAG_FILTER,this.gl.NEAREST),i}getPerspective(){const i=70*Math.PI/180,t=this.gl.canvas.clientWidth/this.gl.canvas.clientHeight,n=Oe();return qo(n,i,t,.1,500),n}getChunk(i){const t=2*Math.abs(i[0])+(i[0]<0?1:0),n=2*Math.abs(i[1])+(i[1]<0?1:0),s=2*Math.abs(i[2])+(i[2]<0?1:0);return this.chunks[t]||(this.chunks[t]=[]),this.chunks[t][n]||(this.chunks[t][n]=[]),this.chunks[t][n][s]||(this.chunks[t][n][s]={positions:[],textureCoordinates:[],tintColors:[],blockPositions:[],normals:[],indices:[],indexOffset:0}),this.chunks[t][n][s]}updateStructureBuffers(i){var t;const n=(o,c,l)=>{const h=Oe();ze(h,h,c),Ct(o.position,h),l.positions.push(o.position),l.textureCoordinates.push(...o.texCoord),l.tintColors.push(...o.tintColor);for(let d=0;d{o.positions=[],o.textureCoordinates=[],o.tintColors=[],o.blockPositions=[],o.normals=[],o.indices=[],o.indexOffset=0},r=o=>{o.buffer?(this.updateBuffer(o.buffer.position,this.gl.ARRAY_BUFFER,Dt(...o.positions)),this.updateBuffer(o.buffer.texCoord,this.gl.ARRAY_BUFFER,new Float32Array(o.textureCoordinates)),this.updateBuffer(o.buffer.tintColor,this.gl.ARRAY_BUFFER,new Float32Array(o.tintColors)),this.updateBuffer(o.buffer.normal,this.gl.ARRAY_BUFFER,new Float32Array(o.normals)),this.updateBuffer(o.buffer.blockPos,this.gl.ARRAY_BUFFER,new Float32Array(o.blockPositions)),this.updateBuffer(o.buffer.index,this.gl.ELEMENT_ARRAY_BUFFER,new Uint16Array(o.indices)),o.buffer.length=o.indices.length):o.buffer={position:this.createBuffer(this.gl.ARRAY_BUFFER,Dt(...o.positions)),texCoord:this.createBuffer(this.gl.ARRAY_BUFFER,new Float32Array(o.textureCoordinates)),tintColor:this.createBuffer(this.gl.ARRAY_BUFFER,new Float32Array(o.tintColors)),blockPos:this.createBuffer(this.gl.ARRAY_BUFFER,new Float32Array(o.blockPositions)),normal:this.createBuffer(this.gl.ARRAY_BUFFER,new Float32Array(o.normals)),index:this.createBuffer(this.gl.ELEMENT_ARRAY_BUFFER,new Uint16Array(o.indices)),length:o.indices.length}};let a;i?i.forEach(o=>{const c=this.getChunk(o);s(c)}):this.chunks.forEach(o=>o.forEach(c=>c.forEach(l=>{s(l)})));for(const o of this.structure.getBlocks()){const c=o.state.getName(),l=o.state.getProperties(),h=(t=this.resources.getDefaultBlockProperties(c))!==null&&t!==void 0?t:{};Object.entries(h).forEach(([f,g])=>{l[f]||(l[f]=g)});const d=[Math.floor(o.pos[0]/this.chunkSize),Math.floor(o.pos[1]/this.chunkSize),Math.floor(o.pos[2]/this.chunkSize)];if(i&&!i.some(f=>nl(f,d)))continue;const u=this.getChunk(d);try{const f=this.resources.getBlockDefinition(c),g={up:this.needsCull(o,O.UP),down:this.needsCull(o,O.DOWN),west:this.needsCull(o,O.WEST),east:this.needsCull(o,O.EAST),north:this.needsCull(o,O.NORTH),south:this.needsCull(o,O.SOUTH)};f&&(a=f.getBuffers(c,l,this.resources,this.resources,u.indexOffset,g),n(a,o.pos,u)),bl.has(c)&&(a=Ls[c](u.indexOffset,l,this.resources,g),n(a,o.pos,u))}catch(f){console.error(`Error rendering block ${c}`,f)}}i?i.forEach(o=>{const c=this.getChunk(o);r(c)}):this.chunks.forEach(o=>o.forEach(c=>c.forEach(l=>{r(l)})))}needsCull(i,t){var n,s;const r=(n=this.structure.getBlock(Ue.towards(i.pos,t)))===null||n===void 0?void 0:n.state;return!!r&&(!((s=this.resources.getBlockFlags(r.getName()))===null||s===void 0)&&s.opaque?!(t===O.UP&&i.state.isFluid()):i.state.isFluid()&&r.isFluid())}getGridBuffers(){const[i,t,n]=this.structure.getSize(),s=[],r=[];s.push(0,0,0,i,0,0),r.push(1,0,0,1,0,0),s.push(0,0,0,0,0,n),r.push(0,0,1,0,0,1),s.push(0,0,0,0,t,0),s.push(i,0,0,i,t,0),s.push(0,0,n,0,t,n),s.push(i,0,n,i,t,n),s.push(0,t,0,0,t,n),s.push(i,t,0,i,t,n),s.push(0,t,0,i,t,0),s.push(0,t,n,i,t,n);for(let a=1;a<=i;a+=1)s.push(a,0,0,a,0,n);for(let a=1;a<=n;a+=1)s.push(0,0,a,i,0,a);for(let a=0;a<8+i+n;a+=1)r.push(.8,.8,.8,.8,.8,.8);return{position:this.createBuffer(this.gl.ARRAY_BUFFER,new Float32Array(s)),color:this.createBuffer(this.gl.ARRAY_BUFFER,new Float32Array(r)),length:s.length/3}}getOutlineBuffers(){const i=[],t=[];return this.addCube(i,t,[1,1,1],[0,0,0],[1,1,1]),{position:this.createBuffer(this.gl.ARRAY_BUFFER,new Float32Array(i)),color:this.createBuffer(this.gl.ARRAY_BUFFER,new Float32Array(t)),length:i.length/3}}getInvisibleBlockBuffers(){if(!this.useInvisibleBlockBuffer)return;const i=this.structure.getSize(),t=[],n=[];for(let s=0;s{t.forEach(n=>{n.forEach(s=>{s.buffer&&(this.setVertexAttr("vertPos",3,s.buffer.position),this.setVertexAttr("texCoord",2,s.buffer.texCoord),this.setVertexAttr("tintColor",3,s.buffer.tintColor),this.setVertexAttr("normal",3,s.buffer.normal),this.gl.bindBuffer(this.gl.ELEMENT_ARRAY_BUFFER,s.buffer.index),this.gl.drawElements(this.gl.TRIANGLES,s.buffer.length,this.gl.UNSIGNED_SHORT,0))})})})}drawColoredStructure(i){this.setShader(this.colorShaderProgram),this.setUniform("mView",i),this.setUniform("mProj",this.projMatrix),this.chunks.forEach(t=>{t.forEach(n=>{n.forEach(s=>{s.buffer&&(this.setVertexAttr("vertPos",3,s.buffer.position),this.setVertexAttr("blockPos",3,s.buffer.blockPos),this.gl.bindBuffer(this.gl.ELEMENT_ARRAY_BUFFER,s.buffer.index),this.gl.drawElements(this.gl.TRIANGLES,s.buffer.length,this.gl.UNSIGNED_SHORT,0))})})})}drawOutline(i,t){this.setShader(this.gridShaderProgram),this.setVertexAttr("vertPos",3,this.outlineBuffers.position),this.setVertexAttr("vertColor",3,this.outlineBuffers.color);const n=Oe();jo(n,i),ze(n,n,t),this.setUniform("mView",n),this.setUniform("mProj",this.projMatrix),this.gl.drawArrays(this.gl.LINES,0,this.outlineBuffers.length)}setViewport(i,t,n,s){this.gl.viewport(i,t,n,s),this.projMatrix=this.getPerspective()}setShader(i){this.gl.useProgram(i),this.activeShader=i}setVertexAttr(i,t,n){const s=this.gl.getAttribLocation(this.activeShader,i);this.gl.bindBuffer(this.gl.ARRAY_BUFFER,n),this.gl.vertexAttribPointer(s,t,this.gl.FLOAT,!1,0,0),this.gl.enableVertexAttribArray(s)}setUniform(i,t){const n=this.gl.getUniformLocation(this.activeShader,i);this.gl.uniformMatrix4fv(n,!1,t)}}/*! *****************************************************************************
+Copyright (c) Microsoft Corporation.
+
+Permission to use, copy, modify, and/or distribute this software for any
+purpose with or without fee is hereby granted.
+
+THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES WITH
+REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY
+AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT,
+INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM
+LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR
+OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR
+PERFORMANCE OF THIS SOFTWARE.
+***************************************************************************** */function $n(e,i,t,n){return new(t||(t=Promise))(function(s,r){function a(l){try{c(n.next(l))}catch(h){r(h)}}function o(l){try{c(n.throw(l))}catch(h){r(h)}}function c(l){var h;l.done?s(l.value):(h=l.value,h instanceof t?h:new t(function(d){d(h)})).then(a,o)}c((n=n.apply(e,i||[])).next())})}class Tt{constructor(i,t){this.img=i,this.idMap=t,this.part=16/i.width}getTextureAtlas(){return this.img}getTextureUV(i){var t;return(t=this.idMap[i])!==null&&t!==void 0?t:[0,0,this.part,this.part]}static fromBlobs(i){return $n(this,void 0,void 0,function*(){const t=Math.sqrt(Object.keys(i).length+1),n=Math.pow(2,Math.ceil(Math.log(t)/Math.log(2))),s=16*n,r=1/n,a=document.createElement("canvas");a.width=s,a.height=s;const o=a.getContext("2d");this.drawInvalidTexture(o);const c={};let l=1;return yield Promise.all(Object.keys(i).map(h=>$n(this,void 0,void 0,function*(){const d=l%n,u=Math.floor(l/n);l+=1,c[h]=[r*d,r*u,r*d+r,r*u+r];const f=yield createImageBitmap(i[h]);o.drawImage(f,0,0,16,16,16*d,16*u,16,16)}))),new Tt(o.getImageData(0,0,s,s),c)})}static empty(){const i=document.createElement("canvas");i.width=16,i.height=16;const t=i.getContext("2d");return Tt.drawInvalidTexture(t),new Tt(t.getImageData(0,0,16,16),{})}static drawInvalidTexture(i){i.fillStyle="black",i.fillRect(0,0,16,16),i.fillStyle="magenta",i.fillRect(0,0,8,8),i.fillRect(8,8,8,8)}}var dt,Pi,U,De,Di,k,Ci,tt,Oi,Mi,mi,Xn,wi;(function(e){function i(l,h){return typeof l=="number"?new t(l,h!=null?h:l):l}e.target=function(l,h,d,u,f,g){return new s(l,h,d,u,f,g)},e.parameters=function(l,h,d,u,f,g,v){return new n(i(l),i(h),i(d),i(u),i(f),i(g),v)},e.param=i;class t{constructor(h,d){this.min=h,this.max=d}distance(h){const d=(typeof h=="number"?h:h.min)-this.max,u=this.min-(typeof h=="number"?h:h.max);return d>0?d:Math.max(u,0)}union(h){return new t(Math.min(this.min,h.min),Math.max(this.max,h.max))}static fromJson(h){var d;if(typeof h=="number")return new t(h,h);const[u,f]=(d=w.readArray(h,g=>w.readNumber(g)))!==null&&d!==void 0?d:[];return new t(u!=null?u:0,f!=null?f:0)}}e.Param=t;class n{constructor(h,d,u,f,g,v,p){this.temperature=h,this.humidity=d,this.continentalness=u,this.erosion=f,this.depth=g,this.weirdness=v,this.offset=p}fittness(h){return oe(this.temperature.distance(h.temperature))+oe(this.humidity.distance(h.humidity))+oe(this.continentalness.distance(h.continentalness))+oe(this.erosion.distance(h.erosion))+oe(this.depth.distance(h.depth))+oe(this.weirdness.distance(h.weirdness))+oe(this.offset-h.offset)}space(){return[this.temperature,this.humidity,this.continentalness,this.erosion,this.depth,this.weirdness,new t(this.offset,this.offset)]}static fromJson(h){var d,u;const f=(d=w.readObject(h))!==null&&d!==void 0?d:{};return new n(t.fromJson(f.temperature),t.fromJson(f.humidity),t.fromJson(f.continentalness),t.fromJson(f.erosion),t.fromJson(f.depth),t.fromJson(f.weirdness),(u=w.readInt(f.offset))!==null&&u!==void 0?u:0)}}e.ParamPoint=n;class s{constructor(h,d,u,f,g,v){this.temperature=h,this.humidity=d,this.continentalness=u,this.erosion=f,this.depth=g,this.weirdness=v}get offset(){return 0}toArray(){return[this.temperature,this.humidity,this.continentalness,this.erosion,this.depth,this.weirdness,this.offset]}}e.TargetPoint=s,e.Parameters=class{constructor(l){this.things=l,this.index=new r(l)}find(l){return this.index.search(l,(h,d)=>h.distance(d))}};class r{constructor(h){this.root=r.build(h.map(([d,u])=>new c(d,u)))}static build(h){if(h.length===1)return h[0];if(h.length<=r.CHILDREN_PER_NODE){const g=h.map(v=>{let p=0;for(let m=0;m<7;m+=1){const S=v.space[m];p+=Math.abs((S.min+S.max)/2)}return{key:p,node:v}}).sort((v,p)=>v.key-p.key).map(({node:v})=>v);return new o(g)}let d=1/0,u=-1,f=[];for(let g=0;g<7;++g){h=r.sort(h,g,!1),f=r.bucketize(h);let v=0;for(const p of f)v+=r.area(p.space);d>v&&(d=v,u=g)}return h=r.sort(h,u,!1),f=r.bucketize(h),f=r.sort(f,u,!0),new o(f.map(g=>r.build(g.children)))}static sort(h,d,u){return h.map(f=>{const g=f.space[d],v=(g.min+g.max)/2;return{key:u?Math.abs(v):v,node:f}}).sort((f,g)=>f.key-g.key).map(({node:f})=>f)}static bucketize(h){const d=[];let u=[];const f=Math.pow(10,Math.floor(Math.log(h.length-.01)/Math.log(10)));for(const g of h)u.push(g),u.lengthnew t(1/0,-1/0));for(const u of h)d=[...Array(7)].map((f,g)=>d[g].union(u.space[g]));return d}search(h,d){let u=1/0,f=null;for(const g of this.children){const v=d(g,h);if(u<=v)continue;const p=g.search(h,d),m=g==p?v:d(p,h);u<=m||(u=m,f=p)}return f}}e.RSubTree=o;class c extends a{constructor(h,d){super(h.space()),this.thing=d}search(){return this}}e.RLeaf=c})(dt||(dt={}));class zs{constructor(i){this.biome=i}getBiome(){return this.biome}static fromJson(i){var t,n;const s=(t=w.readObject(i))!==null&&t!==void 0?t:{},r=(n=w.readString(s.biome))!==null&&n!==void 0?n:"minecraft:the_void";return new zs(r)}}class Us{constructor(i){this.parameters=i}getBiome(i,t,n,s){const r=s(i,t,n);return this.parameters.find(r)}static fromJson(i){var t,n;const s=(t=w.readObject(i))!==null&&t!==void 0?t:{},r=((n=w.readArray(s.biomes,a=>{var o;return(c=>{var l;return{biome:(l=w.readString(c.biome))!==null&&l!==void 0?l:"minecraft:the_void",parameters:dt.ParamPoint.fromJson(c.parameters)}})((o=w.readObject(a))!==null&&o!==void 0?o:{})}))!==null&&n!==void 0?n:[]).map(a=>[a.parameters,()=>a.biome]);return new Us(new dt.Parameters(r))}}class H{constructor(i,t,n){this.offsetSampler=i,this.factorSampler=t,this.jaggednessSampler=n}static extractor(i){return{apply:t=>t[i],toJson:()=>i}}static fromJson(i){var t;const n=(t=w.readObject(i))!==null&&t!==void 0?t:{};return new H(et.fromJson(n.offset,this.EXTRACTOR),et.fromJson(n.factor,this.EXTRACTOR),et.fromJson(n.jaggedness,this.EXTRACTOR))}toJson(){return{offset:this.offsetSampler.toJson(),factor:this.factorSampler.toJson(),jaggedness:this.jaggednessSampler.toJson()}}offset(i){return this.offsetSampler.apply(i)+H.GLOBAL_OFFSET}factor(i){return this.factorSampler.apply(i)}jaggedness(i){return this.jaggednessSampler.apply(i)}static point(i,t,n){return{continents:i,erosion:t,weirdness:n,ridges:this.peaksAndValleys(n)}}static peaksAndValleys(i){return 3*-(Math.abs(Math.abs(i)-.6666667)-.33333334)}static overworld(){const i=this.buildErosionOffsetSpline(-.05,0,0,.1,0,-.03,!1,!1),t=this.buildErosionOffsetSpline(-.1,.03,.1,.1,.01,-.03,!1,!1),n=this.buildErosionOffsetSpline(-.1,.03,.1,.7,.01,-.03,!0,!0),s=this.buildErosionOffsetSpline(.3,.03,.1,1,.01,.01,!0,!0),r=new G(this.CONTINENTS).addPoint(-1.1,.044).addPoint(-1.02,-.2222).addPoint(-.51,-.2222).addPoint(-.44,-.12).addPoint(-.18,-.12).addPoint(-.16,i).addPoint(-.15,i).addPoint(-.1,t).addPoint(.25,n).addPoint(1,s),a=new G(this.CONTINENTS).addPoint(-.19,3.95).addPoint(-.15,this.getErosionFactor(6.25,!0)).addPoint(-.1,this.getErosionFactor(5.47,!0)).addPoint(.03,this.getErosionFactor(5.08,!0)).addPoint(.06,this.getErosionFactor(4.69,!1)),o=new G(this.CONTINENTS).addPoint(.11,0).addPoint(.03,this.buildErosionJaggednessSpline(1,.5,0,0)).addPoint(.65,this.buildErosionJaggednessSpline(1,1,1,0));return new H(r,a,o)}static getErosionFactor(i,t){const n=new G(this.WEIRDNESS).addPoint(-.2,6.3).addPoint(.2,i),s=new G(this.EROSION).addPoint(-.6,n).addPoint(-.5,new G(this.WEIRDNESS).addPoint(-.05,6.3).addPoint(.05,2.67)).addPoint(-.35,n).addPoint(-.25,n).addPoint(-.1,new G(this.WEIRDNESS).addPoint(-.05,2.67).addPoint(.05,6.3)).addPoint(.03,n);if(t){const r=new G(this.WEIRDNESS).addPoint(0,i).addPoint(.1,.625),a=new G(this.RIDGES).addPoint(-.9,i).addPoint(-.69,r);s.addPoint(.35,i).addPoint(.45,a).addPoint(.55,a).addPoint(.62,i)}else{const r=new G(this.RIDGES).addPoint(-.7,n).addPoint(-.15,1.37),a=new G(this.RIDGES).addPoint(.45,n).addPoint(.7,1.56);s.addPoint(.05,a).addPoint(.4,a).addPoint(.45,r).addPoint(.55,r).addPoint(.58,i)}return s}static buildErosionOffsetSpline(i,t,n,s,r,a,o,c){const l=this.buildMountainRidgeSplineWithPoints($(s,.6,1.5),c),h=this.buildMountainRidgeSplineWithPoints($(s,.6,1),c),d=this.buildMountainRidgeSplineWithPoints(s,c),u=this.ridgeSpline(i-.15,.5*s,$(.5,.5,.5)*s,.5*s,.6*s,.5),f=this.ridgeSpline(i,r*s,t*s,.5*s,.6*s,.5),g=this.ridgeSpline(i,r,r,t,n,.5),v=this.ridgeSpline(i,r,r,t,n,.5),p=new G(this.RIDGES).addPoint(-1,i).addPoint(-.4,g).addPoint(0,n+.07),m=this.ridgeSpline(-.02,a,a,t,n,0),S=new G(this.EROSION).addPoint(-.85,l).addPoint(-.7,h).addPoint(-.4,d).addPoint(-.35,u).addPoint(-.1,f).addPoint(.2,g);return o&&S.addPoint(.4,v).addPoint(.45,p).addPoint(.55,p).addPoint(.58,v),S.addPoint(.7,m),S}static buildMountainRidgeSplineWithPoints(i,t){const n=new G(this.RIDGES),s=this.mountainContinentalness(-1,i,-.7),r=this.mountainContinentalness(1,i,-.7),a=this.calculateMountainRidgeZeroContinentalnessPoint(i);if(-.650?this.buildWeirdnessJaggednessSpline(t):0).addPoint(1,i>0?this.buildWeirdnessJaggednessSpline(i):0)}static buildWeirdnessJaggednessSpline(i){return new G(H.WEIRDNESS).addPoint(-.01,.63*i).addPoint(.01,.3*i)}}H.GLOBAL_OFFSET=-.50375,H.EXTRACTOR=e=>{var i;const t=(i=w.readString(e))!==null&&i!==void 0?i:"continents";return H.extractor(t)},H.CONTINENTS=H.extractor("continents"),H.EROSION=H.extractor("erosion"),H.WEIRDNESS=H.extractor("weirdness"),H.RIDGES=H.extractor("ridges"),function(e){e.fromList=function(i){return(t,n,s,r)=>{for(const a of i){const o=a(t,n,s,r);if(o)return o}return null}}}(Pi||(Pi={})),function(e){function i(t){return t.ySize<<2}e.fromJson=function(t){var n,s,r,a,o,c,l,h;const d=(n=w.readObject(t))!==null&&n!==void 0?n:{};return{minY:(s=w.readInt(d.min_y))!==null&&s!==void 0?s:0,height:(r=w.readInt(d.height))!==null&&r!==void 0?r:256,xzSize:(a=w.readInt(d.size_horizontal))!==null&&a!==void 0?a:1,ySize:(o=w.readInt(d.size_vertical))!==null&&o!==void 0?o:1,sampling:Ri.fromJson(d.sampling),topSlide:De.fromJson(d.top_slide),bottomSlide:De.fromJson(d.bottom_slide),terrainShaper:H.fromJson(d.terrain_shaper),islandNoiseOverride:(c=w.readBoolean(d.island_noise_override))!==null&&c!==void 0&&c,isAmplified:(l=w.readBoolean(d.amplified))!==null&&l!==void 0&&l,hasLargeBiomes:(h=w.readBoolean(d.large_biomes))!==null&&h!==void 0&&h}},e.cellHeight=i,e.cellWidth=function(t){return t.xzSize<<2},e.cellCountY=function(t){return t.height/i(t)},e.minCellY=function(t){return Math.floor(t.minY/i(t))}}(U||(U={})),function(e){e.fromJson=function(i){var t,n,s,r;const a=(t=w.readObject(i))!==null&&t!==void 0?t:{};return{target:(n=w.readNumber(a.target))!==null&&n!==void 0?n:0,size:(s=w.readInt(a.size))!==null&&s!==void 0?s:0,offset:(r=w.readInt(a.offset))!==null&&r!==void 0?r:0}},e.apply=function(i,t,n){if(i.size<=0)return t;const s=(n-i.offset)/i.size;return ft(i.target,t,s)}}(De||(De={}));class Ot{constructor(i,t){this.chunk=i,this.filler=t,this.noise000=0,this.noise001=0,this.noise100=0,this.noise101=0,this.noise010=0,this.noise011=0,this.noise110=0,this.noise111=0,this.valueXZ00=0,this.valueXZ10=0,this.valueXZ01=0,this.valueXZ11=0,this.valueZ0=0,this.valueZ1=0,this.value=0,this.slice0=Ot.allocateSlice(i.cellCountY,i.cellCountXZ),this.slice1=Ot.allocateSlice(i.cellCountY,i.cellCountXZ)}static allocateSlice(i,t){const n=Array(t+1);for(let s=0;s>2,this.firstNoiseZ=a>>2,this.interpolators=[];const h=i*l>>2;this.noiseData=Array(h+1);for(let d=0;d<=h;d+=1){const u=this.firstNoiseX+d;this.noiseData[d]=Array(h+1);for(let f=0;f<=h;f+=1){const g=this.firstNoiseZ+f;this.noiseData[d][f]=s.noiseData(u,g)}}this.preliminarySurfaceLevel=new Map,this.baseNoise=s.makeBaseNoiseFiller(this,o,c.noodleCavesEnabled)}getNoiseData(i,t){return this.noiseData[i-this.firstNoiseX][t-this.firstNoiseZ]}getPreliminarySurfaceLevel(i,t){return Xi(this.preliminarySurfaceLevel,re.asLong(i,t),()=>{const n=i-this.firstNoiseX,s=t-this.firstNoiseZ,r=this.noiseData.length,a=n>=0&&s>=0&&ni.initializeForFirstCellX())}advanceCellX(i){this.interpolators.forEach(t=>t.advanceCellX(i))}selectCellYZ(i,t){this.interpolators.forEach(n=>n.selectCellYZ(i,t))}updateForY(i){this.interpolators.forEach(t=>t.updateForY(i))}updateForX(i){this.interpolators.forEach(t=>t.updateForX(i))}updateForZ(i){this.interpolators.forEach(t=>t.updateForZ(i))}swapSlices(){this.interpolators.forEach(i=>i.swapSlices())}updateNoiseAndGenerateBaseState(i,t,n){return this.baseNoise(i,t,n)}}(function(e){e.create=function(i,t,n){return{offset:i,factor:t,jaggedness:n}}})(Di||(Di={})),function(e){const i=new Map;function t(n,s,r){const a=Object.assign({name:`minecraft:${n}`},Le.create(s,r));return i.set(n,a),a}e.TEMPERATURE=t("temperature",-10,[1.5,0,1,0,0,0]),e.VEGETATION=t("vegetation",-8,[1,1,0,0,0,0]),e.CONTINENTALNESS=t("continentalness",-9,[1,1,2,2,2,1,1,1,1]),e.EROSION=t("erosion",-9,[1,1,0,1,1]),e.TEMPERATURE_LARGE=t("temperature_large",-12,[1.5,0,1,0,0,0]),e.VEGETATION_LARGE=t("vegetation_large",-10,[1,1,0,0,0,0]),e.CONTINENTALNESS_LARGE=t("continentalness_large",-11,[1,1,2,2,2,1,1,1,1]),e.EROSION_LARGE=t("erosion_large",-11,[1,1,0,1,1]),e.RIDGE=t("ridge",-7,[1,2,1,0,0,0]),e.SHIFT=t("offset",-3,[1,1,1,0]),e.PILLAR=t("pillar",-7,[1,1]),e.PILLAR_RARENESS=t("pillar_rareness",-8,[1]),e.PILLAR_THICKNESS=t("pillar_thickness",-8,[1]),e.SPAGHETTI_2D=t("spaghetti_2d",-8,[1]),e.SPAGHETTI_2D_ELEVATION=t("spaghetti_2d_elevation",-8,[1]),e.SPAGHETTI_2D_MODULATOR=t("spaghetti_2d_modulator",-8,[1]),e.SPAGHETTI_2D_THICKNESS=t("spaghetti_2d_thickness",-8,[1]),e.SPAGHETTI_3D_1=t("spaghetti_3d_1",-8,[1]),e.SPAGHETTI_3D_2=t("spaghetti_3d_2",-8,[1]),e.SPAGHETTI_3D_RARITY=t("spaghetti_3d_rarity",-8,[1]),e.SPAGHETTI_3D_THICKNESS=t("spaghetti_3d_thickness",-8,[1]),e.SPAGHETTI_ROUGHNESS=t("spaghetti_roughness",-8,[1]),e.SPAGHETTI_ROUGHNESS_MODULATOR=t("spaghetti_roughness_modulator",-8,[1]),e.CAVE_ENTRANCE=t("cave_entrance",-7,[.4,.5,1]),e.CAVE_LAYER=t("cave_layer",-8,[1]),e.CAVE_CHEESE=t("cave_cheese",-8,[.5,1,2,1,2,1,0,2,0]),e.NOODLE=t("noodle",-8,[1]),e.NOODLE_THICKNESS=t("noodle_thickness",-8,[1]),e.NOODLE_RIDGE_A=t("noodle_ridge_a",-7,[1]),e.NOODLE_RIDGE_B=t("noodle_ridge_b",-7,[1]),e.JAGGED=t("jagged",-16,[1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1]),e.SURFACE=t("surface",-6,[1,1,1]),e.SURFACE_SECONDARY=t("surface_secondary",-6,[1,1,0,1]),e.instantiate=function(n,s){return new ce(n.fromHashOf(s.name),s)}}(k||(k={}));class wl{constructor(i,t,n,s=!1){this.settings=i,this.isNoiseCavesEnabled=t;const r=i.hasLargeBiomes,a=(s?new z(n):P.create(n)).forkPositional();s?(this.blendedNoise=new Un(new z(n),i.sampling,U.cellWidth(i),U.cellHeight(i)),this.temperatureNoise=new ce(new z(n),Le.create(-7,[1,1])),this.humidityNoise=new ce(new z(n+BigInt(1)),Le.create(-7,[1,1])),this.offsetNoise=new ce(new z(n+BigInt(5)),Le.create(0,[0]))):(this.blendedNoise=new Un(a.fromHashOf("minecraft:terrain"),i.sampling,U.cellWidth(i),U.cellHeight(i)),this.temperatureNoise=k.instantiate(a,r?k.TEMPERATURE_LARGE:k.TEMPERATURE),this.humidityNoise=k.instantiate(a,r?k.VEGETATION_LARGE:k.VEGETATION),this.offsetNoise=k.instantiate(a,k.SHIFT)),this.continentalnessNoise=k.instantiate(a,r?k.CONTINENTALNESS_LARGE:k.CONTINENTALNESS),this.erosionNoise=k.instantiate(a,r?k.EROSION_LARGE:k.EROSION),this.weirdnessNoise=k.instantiate(a,k.RIDGE),this.pillarNoise=k.instantiate(a,k.PILLAR),this.pillarRarenessModulator=k.instantiate(a,k.PILLAR_RARENESS),this.pillarThicknessModulator=k.instantiate(a,k.PILLAR_THICKNESS),this.spaghetti2DNoise=k.instantiate(a,k.SPAGHETTI_2D),this.spaghetti2DElevationModulator=k.instantiate(a,k.SPAGHETTI_2D_ELEVATION),this.spaghetti2DRarityModulator=k.instantiate(a,k.SPAGHETTI_2D_MODULATOR),this.spaghetti2DThicknessModulator=k.instantiate(a,k.SPAGHETTI_2D_THICKNESS),this.spaghetti3DNoise1=k.instantiate(a,k.SPAGHETTI_3D_1),this.spaghetti3DNoise2=k.instantiate(a,k.SPAGHETTI_3D_2),this.spaghetti3DRarityModulator=k.instantiate(a,k.SPAGHETTI_3D_RARITY),this.spaghetti3DThicknessModulator=k.instantiate(a,k.SPAGHETTI_3D_THICKNESS),this.spaghettiRoughnessNoise=k.instantiate(a,k.SPAGHETTI_ROUGHNESS),this.spaghettiRoughnessModulator=k.instantiate(a,k.SPAGHETTI_ROUGHNESS_MODULATOR),this.bigEntranceNoise=k.instantiate(a,k.CAVE_ENTRANCE),this.layerNoise=k.instantiate(a,k.CAVE_LAYER),this.cheeseNoise=k.instantiate(a,k.CAVE_CHEESE);const o=i.minY+4,c=o+i.height;this.noodleToggleNoise=this.yLimitedInterpolatable(k.instantiate(a,k.NOODLE),o,c,-1,1),this.noodleThicknessNoise=this.yLimitedInterpolatable(k.instantiate(a,k.NOODLE_THICKNESS),o,c,0,1),this.noodleRidgeANoise=this.yLimitedInterpolatable(k.instantiate(a,k.NOODLE_RIDGE_A),o,c,0,8/3),this.noodleRidgeBNoise=this.yLimitedInterpolatable(k.instantiate(a,k.NOODLE_RIDGE_B),o,c,0,8/3),this.jaggedNoise=k.instantiate(a,k.JAGGED),this.shaper=i.terrainShaper,this.baseNoise=l=>l.createNoiseInterpolator((h,d,u)=>this.calculateBlendedBaseNoise(h,d,u,l.getNoiseData(h>>2,u>>2).terrainInfo))}yLimitedInterpolatable(i,t,n,s,r){const a=(o,c,l)=>c>n||co.createNoiseInterpolator(a)}noiseData(i,t){const n=i+this.getOffset(i,0,t),s=t+this.getOffset(t,i,0),r=this.getContinentalness(n,s),a=this.getErosion(n,s),o=this.getWeirdness(n,s),c=this.terrainInfo(r,a,o);return Ci.create(n,s,r,a,o,c)}sample(i,t,n){return this.target(i,t,n,this.noiseData(i,n))}target(i,t,n,s){const r=s.shiftedX,a=t+this.getOffset(t,n,i),o=s.shiftedZ,c=this.getTemperature(r,a,o),l=this.getHumidity(r,a,o),h=this.computeDimensionDensity(t<<2,s.terrainInfo);return dt.target(c,l,s.continentalness,s.erosion,h,s.weirdness)}terrainInfo(i,t,n){const s=H.point(i,t,n),r=this.shaper.offset(s),a=this.shaper.factor(s),o=this.shaper.jaggedness(s);return Di.create(r,a,o)}getOffset(i,t,n){return 4*this.offsetNoise.sample(i,t,n)}getTemperature(i,t,n){return this.temperatureNoise.sample(i,t,n)}getHumidity(i,t,n){return this.humidityNoise.sample(i,t,n)}getContinentalness(i,t){return this.continentalnessNoise.sample(i,0,t)}getErosion(i,t){return this.erosionNoise.sample(i,0,t)}getWeirdness(i,t){return this.weirdnessNoise.sample(i,0,t)}makeBaseNoiseFiller(i,t,n){const s=this.baseNoise(i),r=n?this.noodleToggleNoise(i):()=>-1,a=n?this.noodleThicknessNoise(i):()=>0,o=n?this.noodleRidgeANoise(i):()=>0,c=n?this.noodleRidgeBNoise(i):()=>0;return(l,h,d)=>{let u=s();if(u=ue(.64*u,-1,1),u=u/2-u*u*u/24,r()>=0){const f=ll(a(),-1,1,.05,.1),g=Math.abs(1.5*o())-f,v=Math.abs(1.5*c())-f;u=Math.min(u,Math.max(g,v))}return u+=t(l,h,d),u>0?null:V.AIR}}calculateBlendedBaseNoise(i,t,n,s){const r=this.blendedNoise.sample(i,t,n);return this.calculateBaseNoise(i,t,n,s,r,!this.isNoiseCavesEnabled,!0)}calculateBaseNoise(i,t,n,s,r,a,o){if(!this.settings.islandNoiseOverride){const h=o?this.sampleJaggedNoise(s.jaggedness,i,n):0,d=this.computeDimensionDensity(t,s),u=s.factor*(h+d);r+=u>0?4*u:u}let c=-64,l=64;if(!a&&r>=-64){const h=r-1.5625,d=this.getBigEntrances(i,t,n),u=this.getSpaghettiRoughness(i,t,n),f=this.getSpaghetti3D(i,t,n),g=Math.min(d,f+u);if(h<0)l=g;else{const v=this.getLayerizedCaverns(i,t,n);v>64?r=64:r=this.getCheese(i,t,n)+v+ft(.5,0,1.28*h);const p=this.getSpaghetti2D(i,t,n);c=this.getPillars(i,t,n),l=Math.min(g,p+u)}}return r=ue(r,c,l),r=ue(r=this.applySlide(r,t/U.cellHeight(this.settings)),-64,64)}sampleJaggedNoise(i,t,n){if(i===0)return 0;const s=this.jaggedNoise.sample(1500*t,0,1500*n);return s>0?i*s:i/2*s}computeDimensionDensity(i,t){return 1-i/128+t.offset}getBigEntrances(i,t,n){return this.bigEntranceNoise.sample(.75*i,.5*t,.75*n)+.37+ft(.3,0,(t+10)/40)}getSpaghettiRoughness(i,t,n){const s=this.spaghettiRoughnessNoise.sample(i,t,n),r=ge(this.spaghettiRoughnessModulator.sample(i,t,n),-1,1,0,1);return(.4-Math.abs(s))*r}getSpaghetti2D(i,t,n){const s=this.quantizeSpaghettiRarity2D(this.spaghetti2DRarityModulator.sample(2*i,t,2*n)),r=ge(this.spaghetti2DThicknessModulator.sample(2*i,t,2*n),-1,1,.6,1.3),a=this.sampleWithRarity(this.spaghetti2DNoise,i,t,n,s),o=Math.abs(s*a)-.083*r,c=U.minCellY(this.settings),l=ge(this.spaghetti2DElevationModulator.sample(i,0,n),-1,1,c,8),h=Math.abs(l-t/8)-1*r;return ue(Math.max(h,o),-1,1)}getSpaghetti3D(i,t,n){const s=this.quantizeSpaghettiRarity3D(this.spaghetti3DRarityModulator.sample(2*i,t,2*n)),r=ge(this.spaghetti3DThicknessModulator.sample(i,t,n),-1,1,.065,.088),a=this.sampleWithRarity(this.spaghetti3DNoise1,i,t,n,s),o=Math.abs(s*a)-r,c=this.sampleWithRarity(this.spaghetti3DNoise2,i,t,n,s),l=Math.abs(s*c)-r;return ue(Math.max(o,l),-1,1)}quantizeSpaghettiRarity2D(i){return i<-.75?.5:i<-.5?.75:i<.5?1:i<.75?2:3}quantizeSpaghettiRarity3D(i){return i<-.5?.75:i<0?1:i<.5?1.5:2}sampleWithRarity(i,t,n,s,r){return i.sample(t/r,n/r,s/r)}getLayerizedCaverns(i,t,n){return 4*oe(this.layerNoise.sample(i,8*t,n))}getCheese(i,t,n){return ue(this.cheeseNoise.sample(i,t/1.5,n)+.27,-1,1)}getPillars(i,t,n){const s=ge(this.pillarRarenessModulator.sample(i,t,n),-1,1,0,2),r=ge(this.pillarThicknessModulator.sample(i,t,n),-1,1,0,1.1),a=this.pillarNoise.sample(25*i,.3*t,25*n),o=Math.pow(r,3)*(2*a-s);return o<=.03?Number.MIN_SAFE_INTEGER:o}applySlide(i,t){const n=t-U.minCellY(this.settings);return i=De.apply(this.settings.topSlide,i,U.cellCountY(this.settings)-n),i=De.apply(this.settings.bottomSlide,i,n)}getPreliminarySurfaceLevel(i,t,n){const s=U.minCellY(this.settings)+U.cellCountY(this.settings),r=U.minCellY(this.settings),a=U.cellHeight(this.settings);for(let o=s;o>=r;o-=1){const c=o*a;if(this.calculateBaseNoise(i,c,t,n,-.703125,!0,!1)>=.390625)return c}return Number.MAX_SAFE_INTEGER}}(function(e){e.create=function(i,t,n,s,r,a){return{shiftedX:i,shiftedZ:t,continentalness:n,weirdness:s,erosion:r,terrainInfo:a}}})(Ci||(Ci={})),function(e){e.fromJson=function(i){var t,n,s,r;const a=(t=w.readObject(i))!==null&&t!==void 0?t:{};return a.absolute!==void 0?(o=(n=w.readNumber(a.absolute))!==null&&n!==void 0?n:0,()=>o):a.above_bottom!==void 0?function(c){return l=>l.minY+c}((s=w.readNumber(a.above_bottom))!==null&&s!==void 0?s:0):a.below_top!==void 0?function(c){return l=>l.maxY-c}((r=w.readNumber(a.below_top))!==null&&r!==void 0?r:0):()=>0;var o}}(tt||(tt={})),function(e){e.create=function(i,t){return{minY:i,height:t,maxY:i+t-1}}}(Oi||(Oi={}));class xl{constructor(i,t,n){this.rule=i,this.defaultBlock=t,this.random=P.create(n).forkPositional(),this.surfaceNoise=k.instantiate(this.random,k.SURFACE),this.surfaceSecondaryNoise=k.instantiate(this.random,k.SURFACE_SECONDARY),this.positionalRandoms=new Map}buildSurface(i,t,n,s){const r=re.minBlockX(i.pos),a=re.minBlockZ(i.pos),o=new El(this,i,t,n,s),c=this.rule(o);for(let l=0;l<16;l+=1){const h=r+l;for(let d=0;d<1;d+=1){const u=a+d;o.updateXZ(h,u);let f=0,g=Number.MIN_SAFE_INTEGER,v=Number.MAX_SAFE_INTEGER;for(let p=i.maxY;p>=i.minY;p-=1){const m=Ue.create(h,p,u),S=i.getBlockState(m);if(S.equals(V.AIR)){f=0,g=Number.MIN_SAFE_INTEGER;continue}if(S.isFluid()){g===Number.MIN_SAFE_INTEGER&&(g=p+1);continue}if(v>=p){v=Number.MIN_SAFE_INTEGER;for(let b=p-1;b>=i.minY;b-=1){const I=i.getBlockState(Ue.create(h,b,u));if(I.equals(V.AIR)||I.isFluid()){v=b+1;break}}}f+=1;const E=p-v+1;if(!S.equals(this.defaultBlock))continue;o.updateY(f,E,g,p);const _=c(h,p,u);_&&i.setBlockState(m,_)}}}}getSurfaceDepth(i,t){return 2.75*this.surfaceNoise.sample(i,0,t)+3+.25*this.random.at(i,0,t).nextDouble()}getSurfaceSecondary(i,t){return this.surfaceSecondaryNoise.sample(i,0,t)}getRandom(i){return Xi(this.positionalRandoms,i,()=>this.random.fromHashOf(i))}}class El{constructor(i,t,n,s,r){this.system=i,this.chunk=t,this.noiseChunk=n,this.context=s,this.getBiome=r,this.blockX=0,this.blockY=0,this.blockZ=0,this.stoneDepthAbove=0,this.stoneDepthBelow=0,this.surfaceDepth=0,this.waterHeight=0,this.biome=()=>"",this.surfaceSecondary=()=>0,this.minSurfaceLevel=()=>0}updateXZ(i,t){this.blockX=i,this.blockZ=t,this.surfaceDepth=this.system.getSurfaceDepth(i,t),this.surfaceSecondary=_i(()=>this.system.getSurfaceSecondary(i,t)),this.minSurfaceLevel=_i(()=>this.calculateMinSurfaceLevel(i,t))}updateY(i,t,n,s){this.blockY=s,this.stoneDepthAbove=i,this.stoneDepthBelow=t,this.waterHeight=n,this.biome=_i(()=>this.getBiome(Ue.create(this.blockX,this.blockY,this.blockZ)))}calculateMinSurfaceLevel(i,t){const n=i>>4,s=t>>4,r=this.noiseChunk.getPreliminarySurfaceLevel(n<<4,s<<4),a=this.noiseChunk.getPreliminarySurfaceLevel(n+1<<4,s<<4),o=this.noiseChunk.getPreliminarySurfaceLevel(n<<4,s+1<<4),c=this.noiseChunk.getPreliminarySurfaceLevel(n+1<<4,s+1<<4);return Math.floor(Ni((15&i)/16,(15&t)/16,r,a,o,c))+this.surfaceDepth-8}}(function(e){function i(s){return()=>()=>s}function t(s){return r=>{const a=s.map(o=>o(r));return(o,c,l)=>{for(const h of a){const d=h(o,c,l);if(d)return d}}}}function n(s,r){return a=>(o,c,l)=>{if(s(a))return r(a)(o,c,l)}}e.NOOP=()=>()=>{},e.fromJson=function(s){var r,a,o;const c=(r=w.readObject(s))!==null&&r!==void 0?r:{};switch((a=w.readString(c.type))===null||a===void 0?void 0:a.replace(/^minecraft:/,"")){case"block":return i(V.fromJson(c.result_state));case"sequence":return t((o=w.readArray(c.sequence,e.fromJson))!==null&&o!==void 0?o:[]);case"condition":return n(mi.fromJson(c.if_true),e.fromJson(c.then_run))}return e.NOOP},e.block=i,e.sequence=t,e.condition=n})(Mi||(Mi={})),function(e){function i(){return c=>c.blockY>=c.minSurfaceLevel()}function t(c){const l=new Set(c);return h=>l.has(h.biome())}function n(c){return l=>!c(l)}function s(c,l,h,d){return u=>{const f=d?u.stoneDepthBelow:u.stoneDepthAbove,g=l?u.surfaceDepth:0,v=h===0?0:ge(u.surfaceSecondary(),-1,1,0,h);return f<=1+c+g+v}}function r(c,l,h){return d=>{const u=l(d.context),f=h(d.context);if(d.blockY<=u)return!0;if(d.blockY>=f)return!1;const g=d.system.getRandom(c),v=ge(d.blockY,u,f,1,0);return g.nextFloat(){if(d.waterHeight===Number.MIN_SAFE_INTEGER)return!0;const u=h?d.stoneDepthAbove:0;return d.blockY+u>=d.waterHeight+c+d.surfaceDepth*l}}function o(c,l,h){return d=>{const u=h?d.stoneDepthAbove:0;return d.blockY+u>=c(d.context)+d.surfaceDepth*l}}e.FALSE=()=>!1,e.TRUE=()=>!0,e.fromJson=function(c){var l,h,d,u,f,g,v,p,m,S,E,_;const b=(l=w.readObject(c))!==null&&l!==void 0?l:{};switch((h=w.readString(b.type))===null||h===void 0?void 0:h.replace(/^minecraft:/,"")){case"above_preliminary_surface":return I=>I.blockY>=I.minSurfaceLevel();case"biome":return t((d=w.readArray(b.biome_is,I=>{var x;return(x=w.readString(I))!==null&&x!==void 0?x:""}))!==null&&d!==void 0?d:[]);case"not":return n(e.fromJson(b.invert));case"stone_depth":return s((u=w.readInt(b.offset))!==null&&u!==void 0?u:0,(f=w.readBoolean(b.add_surface_depth))!==null&&f!==void 0&&f,(g=w.readInt(b.secondary_depth_range))!==null&&g!==void 0?g:0,w.readString(b.surface_type)==="ceiling");case"vertical_gradient":return r((v=w.readString(b.random_name))!==null&&v!==void 0?v:"",tt.fromJson(b.true_at_and_below),tt.fromJson(b.false_at_and_above));case"water":return a((p=w.readInt(b.offset))!==null&&p!==void 0?p:0,(m=w.readInt(b.surface_depth_multiplier))!==null&&m!==void 0?m:0,(S=w.readBoolean(b.add_surface_depth))!==null&&S!==void 0&&S);case"y_above":return o(tt.fromJson(b.anchor),(E=w.readInt(b.surface_depth_multiplier))!==null&&E!==void 0?E:0,(_=w.readBoolean(b.add_surface_depth))!==null&&_!==void 0&&_)}return e.FALSE},e.abovePreliminarySurface=i,e.biome=t,e.not=n,e.stoneDepth=s,e.verticalGradient=r,e.water=a,e.yAbove=o}(mi||(mi={}));class Pl{constructor(i,t,n){this.biomeSource=t,this.settings=n,this.sampler=new wl(n.noise,n.noiseCavesEnabled,i,n.legacyRandomSource),this.noiseChunkCache=new Map,this.materialRule=Pi.fromList([(s,r,a,o)=>s.updateNoiseAndGenerateBaseState(r,a,o)]),this.surfaceSystem=new xl(n.surfaceRule,n.defaultBlock,i)}fill(i){var t;const n=Math.max(i.minY,this.settings.noise.minY),s=Math.min(i.maxY,this.settings.noise.minY+this.settings.noise.height),r=U.cellWidth(this.settings.noise),a=U.cellHeight(this.settings.noise),o=Math.floor(16/r),c=Math.floor(n/a),l=Math.floor((s-n)/a),h=re.minBlockX(i.pos),d=re.minBlockZ(i.pos),u=this.getNoiseChunk(i);u.initializeForFirstCellX();for(let f=0;f=0;p-=1){u.selectCellYZ(p,g);for(let m=a-1;m>=0;m-=1){const S=(c+p)*a+m,E=15&S,_=i.getSectionIndex(S);i.getSectionIndex(v.minBlockY)!==_&&(v=i.getOrCreateSection(_));const b=m/a;u.updateForY(b);for(let I=0;It)}getNoiseChunk(i){return Xi(this.noiseChunkCache,re.toLong(i.pos),()=>{const t=Math.max(i.minY,this.settings.noise.minY),n=Math.min(i.maxY,this.settings.noise.minY+this.settings.noise.height),s=U.cellWidth(this.settings.noise),r=U.cellHeight(this.settings.noise),a=Math.floor(16/s),o=Math.floor(t/r),c=Math.floor((n-t)/r),l=re.minBlockX(i.pos),h=re.minBlockZ(i.pos);return new ml(a,c,o,this.sampler,l,h,()=>0,this.settings)})}}(function(e){e.fromJson=function(i){var t,n,s,r,a,o,c,l,h,d,u;const f=(t=w.readObject(i))!==null&&t!==void 0?t:{};return{structures:wi.fromJson(f.structures),surfaceRule:Mi.fromJson(f.surface_rule),noise:U.fromJson(f.noise),defaultBlock:V.fromJson(f.default_block),defaultFluid:V.fromJson(f.default_fluid),bedrockRoofPosition:(n=w.readInt(f.bedrock_roof_position))!==null&&n!==void 0?n:0,bedrockFloorPosition:(s=w.readInt(f.bedrock_floor_position))!==null&&s!==void 0?s:0,seaLevel:(r=w.readInt(f.sea_level))!==null&&r!==void 0?r:0,disableMobGeneration:(a=w.readBoolean(f.disable_mob_generation))!==null&&a!==void 0&&a,aquifersEnabled:(o=w.readBoolean(f.aquifers_enabled))!==null&&o!==void 0&&o,noiseCavesEnabled:(c=w.readBoolean(f.noise_caves_enabled))!==null&&c!==void 0&&c,deepslateEnabled:(l=w.readBoolean(f.deepslate_enabled))!==null&&l!==void 0&&l,oreVeinsEnabled:(h=w.readBoolean(f.ore_veins_enabled))!==null&&h!==void 0&&h,noodleCavesEnabled:(d=w.readBoolean(f.noodle_caves_enabled))!==null&&d!==void 0&&d,legacyRandomSource:(u=w.readBoolean(f.legacy_random_source))!==null&&u!==void 0&&u}}})(Xn||(Xn={})),function(e){e.fromJson=function(i){var t;const n=(t=w.readObject(i))!==null&&t!==void 0?t:{};return{stronghold:w.compose(n.stronghold,w.readObject,s=>{var r,a,o;return{distance:(r=w.readInt(s.distance))!==null&&r!==void 0?r:0,spread:(a=w.readInt(s.spread))!==null&&a!==void 0?a:0,count:(o=w.readInt(s.count))!==null&&o!==void 0?o:0}}),structures:w.readMap(n.structures,s=>{var r;return(a=>{var o,c,l;return{spacing:(o=w.readInt(a.spacing))!==null&&o!==void 0?o:0,separation:(c=w.readInt(a.separation))!==null&&c!==void 0?c:0,salt:(l=w.readInt(a.salt))!==null&&l!==void 0?l:0}})((r=w.readObject(s))!==null&&r!==void 0?r:{})})}}}(wi||(wi={}));export{Un as BlendedNoise,Yn as BlockColors,ji as BlockDefinition,Ut as BlockModel,Ue as BlockPos,V as BlockState,Tl as Chunk,re as ChunkPos,pe as ChunkSection,dt as Climate,Fi as ConstantProvider,O as Direction,zs as FixedBiome,Ci as FlatNoiseData,zn as ImprovedNoise,w as Json,cl as LegacyPositionalRandom,z as LegacyRandom,Pi as MaterialRule,Us as MultiNoise,rl as NbtReader,al as NbtWriter,ml as NoiseChunk,Pl as NoiseChunkGenerator,Xn as NoiseGeneratorSettings,Ot as NoiseInterpolator,Le as NoiseParameters,wl as NoiseSampler,Ri as NoiseSamplingSettings,U as NoiseSettings,De as NoiseSlideSettings,k as Noises,ce as NormalNoise,et as NumberProvider,W as PerlinNoise,Fl as PerlinSimplexNoise,Z as SimplexNoise,G as Spline,Ds as Structure,Bl as StructureRenderer,wi as StructureSettings,mi as SurfaceCondition,El as SurfaceContext,Mi as SurfaceRule,xl as SurfaceSystem,Di as TerrainInfo,H as TerrainShaper,Tt as TextureAtlas,tt as VerticalAnchor,Oi as WorldgenContext,fl as XoroshiroPositionalRandom,P as XoroshiroRandom,hl as binarySearch,ue as clamp,ft as clampedLerp,ll as clampedMap,Xi as computeIfAbsent,St as getListTag,Ps as getOptional,Os as getSeed,Me as getTag,Cs as inverseLerp,_i as lazy,$ as lerp,Ni as lerp2,ol as lerp3,Ti as longfromBytes,ge as map,kl as read,Al as readChunk,Fs as readCompressed,yl as readRegion,Gi as readUncompressed,pi as smoothstep,oe as square,Ln as tagNames,Qe as tagTypes,Il as write,Nl as writeChunk,Ii as writeCompressed,Rl as writeRegion,$i as writeUncompressed};
+//# sourceMappingURL=deepslate.esm.a2c3a9f5.js.map
diff --git a/assets/deepslate.esm.a2c3a9f5.js.map b/assets/deepslate.esm.a2c3a9f5.js.map
new file mode 100644
index 00000000..0ffd29af
--- /dev/null
+++ b/assets/deepslate.esm.a2c3a9f5.js.map
@@ -0,0 +1 @@
+{"version":3,"file":"deepslate.esm.a2c3a9f5.js","sources":["../../node_modules/pako/dist/pako.esm.mjs","../../node_modules/gl-matrix/esm/common.js","../../node_modules/gl-matrix/esm/mat4.js","../../node_modules/gl-matrix/esm/vec3.js","../../node_modules/deepslate-1.18/dist/deepslate.esm.js"],"sourcesContent":["\n/*! pako 2.0.4 https://github.com/nodeca/pako @license (MIT AND Zlib) */\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n// claim that you wrote the original software. If you use this software\n// in a product, an acknowledgment in the product documentation would be\n// appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n// misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\n/* eslint-disable space-unary-ops */\n\n/* Public constants ==========================================================*/\n/* ===========================================================================*/\n\n\n//const Z_FILTERED = 1;\n//const Z_HUFFMAN_ONLY = 2;\n//const Z_RLE = 3;\nconst Z_FIXED$1 = 4;\n//const Z_DEFAULT_STRATEGY = 0;\n\n/* Possible values of the data_type field (though see inflate()) */\nconst Z_BINARY = 0;\nconst Z_TEXT = 1;\n//const Z_ASCII = 1; // = Z_TEXT\nconst Z_UNKNOWN$1 = 2;\n\n/*============================================================================*/\n\n\nfunction zero$1(buf) { let len = buf.length; while (--len >= 0) { buf[len] = 0; } }\n\n// From zutil.h\n\nconst STORED_BLOCK = 0;\nconst STATIC_TREES = 1;\nconst DYN_TREES = 2;\n/* The three kinds of block type */\n\nconst MIN_MATCH$1 = 3;\nconst MAX_MATCH$1 = 258;\n/* The minimum and maximum match lengths */\n\n// From deflate.h\n/* ===========================================================================\n * Internal compression state.\n */\n\nconst LENGTH_CODES$1 = 29;\n/* number of length codes, not counting the special END_BLOCK code */\n\nconst LITERALS$1 = 256;\n/* number of literal bytes 0..255 */\n\nconst L_CODES$1 = LITERALS$1 + 1 + LENGTH_CODES$1;\n/* number of Literal or Length codes, including the END_BLOCK code */\n\nconst D_CODES$1 = 30;\n/* number of distance codes */\n\nconst BL_CODES$1 = 19;\n/* number of codes used to transfer the bit lengths */\n\nconst HEAP_SIZE$1 = 2 * L_CODES$1 + 1;\n/* maximum heap size */\n\nconst MAX_BITS$1 = 15;\n/* All codes must not exceed MAX_BITS bits */\n\nconst Buf_size = 16;\n/* size of bit buffer in bi_buf */\n\n\n/* ===========================================================================\n * Constants\n */\n\nconst MAX_BL_BITS = 7;\n/* Bit length codes must not exceed MAX_BL_BITS bits */\n\nconst END_BLOCK = 256;\n/* end of block literal code */\n\nconst REP_3_6 = 16;\n/* repeat previous bit length 3-6 times (2 bits of repeat count) */\n\nconst REPZ_3_10 = 17;\n/* repeat a zero length 3-10 times (3 bits of repeat count) */\n\nconst REPZ_11_138 = 18;\n/* repeat a zero length 11-138 times (7 bits of repeat count) */\n\n/* eslint-disable comma-spacing,array-bracket-spacing */\nconst extra_lbits = /* extra bits for each length code */\n new Uint8Array([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]);\n\nconst extra_dbits = /* extra bits for each distance code */\n new Uint8Array([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]);\n\nconst extra_blbits = /* extra bits for each bit length code */\n new Uint8Array([0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,3,7]);\n\nconst bl_order =\n new Uint8Array([16,17,18,0,8,7,9,6,10,5,11,4,12,3,13,2,14,1,15]);\n/* eslint-enable comma-spacing,array-bracket-spacing */\n\n/* The lengths of the bit length codes are sent in order of decreasing\n * probability, to avoid transmitting the lengths for unused bit length codes.\n */\n\n/* ===========================================================================\n * Local data. These are initialized only once.\n */\n\n// We pre-fill arrays with 0 to avoid uninitialized gaps\n\nconst DIST_CODE_LEN = 512; /* see definition of array dist_code below */\n\n// !!!! Use flat array instead of structure, Freq = i*2, Len = i*2+1\nconst static_ltree = new Array((L_CODES$1 + 2) * 2);\nzero$1(static_ltree);\n/* The static literal tree. Since the bit lengths are imposed, there is no\n * need for the L_CODES extra codes used during heap construction. However\n * The codes 286 and 287 are needed to build a canonical tree (see _tr_init\n * below).\n */\n\nconst static_dtree = new Array(D_CODES$1 * 2);\nzero$1(static_dtree);\n/* The static distance tree. (Actually a trivial tree since all codes use\n * 5 bits.)\n */\n\nconst _dist_code = new Array(DIST_CODE_LEN);\nzero$1(_dist_code);\n/* Distance codes. The first 256 values correspond to the distances\n * 3 .. 258, the last 256 values correspond to the top 8 bits of\n * the 15 bit distances.\n */\n\nconst _length_code = new Array(MAX_MATCH$1 - MIN_MATCH$1 + 1);\nzero$1(_length_code);\n/* length code for each normalized match length (0 == MIN_MATCH) */\n\nconst base_length = new Array(LENGTH_CODES$1);\nzero$1(base_length);\n/* First normalized length for each code (0 = MIN_MATCH) */\n\nconst base_dist = new Array(D_CODES$1);\nzero$1(base_dist);\n/* First normalized distance for each code (0 = distance of 1) */\n\n\nfunction StaticTreeDesc(static_tree, extra_bits, extra_base, elems, max_length) {\n\n this.static_tree = static_tree; /* static tree or NULL */\n this.extra_bits = extra_bits; /* extra bits for each code or NULL */\n this.extra_base = extra_base; /* base index for extra_bits */\n this.elems = elems; /* max number of elements in the tree */\n this.max_length = max_length; /* max bit length for the codes */\n\n // show if `static_tree` has data or dummy - needed for monomorphic objects\n this.has_stree = static_tree && static_tree.length;\n}\n\n\nlet static_l_desc;\nlet static_d_desc;\nlet static_bl_desc;\n\n\nfunction TreeDesc(dyn_tree, stat_desc) {\n this.dyn_tree = dyn_tree; /* the dynamic tree */\n this.max_code = 0; /* largest code with non zero frequency */\n this.stat_desc = stat_desc; /* the corresponding static tree */\n}\n\n\n\nconst d_code = (dist) => {\n\n return dist < 256 ? _dist_code[dist] : _dist_code[256 + (dist >>> 7)];\n};\n\n\n/* ===========================================================================\n * Output a short LSB first on the stream.\n * IN assertion: there is enough room in pendingBuf.\n */\nconst put_short = (s, w) => {\n// put_byte(s, (uch)((w) & 0xff));\n// put_byte(s, (uch)((ush)(w) >> 8));\n s.pending_buf[s.pending++] = (w) & 0xff;\n s.pending_buf[s.pending++] = (w >>> 8) & 0xff;\n};\n\n\n/* ===========================================================================\n * Send a value on a given number of bits.\n * IN assertion: length <= 16 and value fits in length bits.\n */\nconst send_bits = (s, value, length) => {\n\n if (s.bi_valid > (Buf_size - length)) {\n s.bi_buf |= (value << s.bi_valid) & 0xffff;\n put_short(s, s.bi_buf);\n s.bi_buf = value >> (Buf_size - s.bi_valid);\n s.bi_valid += length - Buf_size;\n } else {\n s.bi_buf |= (value << s.bi_valid) & 0xffff;\n s.bi_valid += length;\n }\n};\n\n\nconst send_code = (s, c, tree) => {\n\n send_bits(s, tree[c * 2]/*.Code*/, tree[c * 2 + 1]/*.Len*/);\n};\n\n\n/* ===========================================================================\n * Reverse the first len bits of a code, using straightforward code (a faster\n * method would use a table)\n * IN assertion: 1 <= len <= 15\n */\nconst bi_reverse = (code, len) => {\n\n let res = 0;\n do {\n res |= code & 1;\n code >>>= 1;\n res <<= 1;\n } while (--len > 0);\n return res >>> 1;\n};\n\n\n/* ===========================================================================\n * Flush the bit buffer, keeping at most 7 bits in it.\n */\nconst bi_flush = (s) => {\n\n if (s.bi_valid === 16) {\n put_short(s, s.bi_buf);\n s.bi_buf = 0;\n s.bi_valid = 0;\n\n } else if (s.bi_valid >= 8) {\n s.pending_buf[s.pending++] = s.bi_buf & 0xff;\n s.bi_buf >>= 8;\n s.bi_valid -= 8;\n }\n};\n\n\n/* ===========================================================================\n * Compute the optimal bit lengths for a tree and update the total bit length\n * for the current block.\n * IN assertion: the fields freq and dad are set, heap[heap_max] and\n * above are the tree nodes sorted by increasing frequency.\n * OUT assertions: the field len is set to the optimal bit length, the\n * array bl_count contains the frequencies for each bit length.\n * The length opt_len is updated; static_len is also updated if stree is\n * not null.\n */\nconst gen_bitlen = (s, desc) =>\n// deflate_state *s;\n// tree_desc *desc; /* the tree descriptor */\n{\n const tree = desc.dyn_tree;\n const max_code = desc.max_code;\n const stree = desc.stat_desc.static_tree;\n const has_stree = desc.stat_desc.has_stree;\n const extra = desc.stat_desc.extra_bits;\n const base = desc.stat_desc.extra_base;\n const max_length = desc.stat_desc.max_length;\n let h; /* heap index */\n let n, m; /* iterate over the tree elements */\n let bits; /* bit length */\n let xbits; /* extra bits */\n let f; /* frequency */\n let overflow = 0; /* number of elements with bit length too large */\n\n for (bits = 0; bits <= MAX_BITS$1; bits++) {\n s.bl_count[bits] = 0;\n }\n\n /* In a first pass, compute the optimal bit lengths (which may\n * overflow in the case of the bit length tree).\n */\n tree[s.heap[s.heap_max] * 2 + 1]/*.Len*/ = 0; /* root of the heap */\n\n for (h = s.heap_max + 1; h < HEAP_SIZE$1; h++) {\n n = s.heap[h];\n bits = tree[tree[n * 2 + 1]/*.Dad*/ * 2 + 1]/*.Len*/ + 1;\n if (bits > max_length) {\n bits = max_length;\n overflow++;\n }\n tree[n * 2 + 1]/*.Len*/ = bits;\n /* We overwrite tree[n].Dad which is no longer needed */\n\n if (n > max_code) { continue; } /* not a leaf node */\n\n s.bl_count[bits]++;\n xbits = 0;\n if (n >= base) {\n xbits = extra[n - base];\n }\n f = tree[n * 2]/*.Freq*/;\n s.opt_len += f * (bits + xbits);\n if (has_stree) {\n s.static_len += f * (stree[n * 2 + 1]/*.Len*/ + xbits);\n }\n }\n if (overflow === 0) { return; }\n\n // Trace((stderr,\"\\nbit length overflow\\n\"));\n /* This happens for example on obj2 and pic of the Calgary corpus */\n\n /* Find the first bit length which could increase: */\n do {\n bits = max_length - 1;\n while (s.bl_count[bits] === 0) { bits--; }\n s.bl_count[bits]--; /* move one leaf down the tree */\n s.bl_count[bits + 1] += 2; /* move one overflow item as its brother */\n s.bl_count[max_length]--;\n /* The brother of the overflow item also moves one step up,\n * but this does not affect bl_count[max_length]\n */\n overflow -= 2;\n } while (overflow > 0);\n\n /* Now recompute all bit lengths, scanning in increasing frequency.\n * h is still equal to HEAP_SIZE. (It is simpler to reconstruct all\n * lengths instead of fixing only the wrong ones. This idea is taken\n * from 'ar' written by Haruhiko Okumura.)\n */\n for (bits = max_length; bits !== 0; bits--) {\n n = s.bl_count[bits];\n while (n !== 0) {\n m = s.heap[--h];\n if (m > max_code) { continue; }\n if (tree[m * 2 + 1]/*.Len*/ !== bits) {\n // Trace((stderr,\"code %d bits %d->%d\\n\", m, tree[m].Len, bits));\n s.opt_len += (bits - tree[m * 2 + 1]/*.Len*/) * tree[m * 2]/*.Freq*/;\n tree[m * 2 + 1]/*.Len*/ = bits;\n }\n n--;\n }\n }\n};\n\n\n/* ===========================================================================\n * Generate the codes for a given tree and bit counts (which need not be\n * optimal).\n * IN assertion: the array bl_count contains the bit length statistics for\n * the given tree and the field len is set for all tree elements.\n * OUT assertion: the field code is set for all tree elements of non\n * zero code length.\n */\nconst gen_codes = (tree, max_code, bl_count) =>\n// ct_data *tree; /* the tree to decorate */\n// int max_code; /* largest code with non zero frequency */\n// ushf *bl_count; /* number of codes at each bit length */\n{\n const next_code = new Array(MAX_BITS$1 + 1); /* next code value for each bit length */\n let code = 0; /* running code value */\n let bits; /* bit index */\n let n; /* code index */\n\n /* The distribution counts are first used to generate the code values\n * without bit reversal.\n */\n for (bits = 1; bits <= MAX_BITS$1; bits++) {\n next_code[bits] = code = (code + bl_count[bits - 1]) << 1;\n }\n /* Check that the bit counts in bl_count are consistent. The last code\n * must be all ones.\n */\n //Assert (code + bl_count[MAX_BITS]-1 == (1< {\n\n let n; /* iterates over tree elements */\n let bits; /* bit counter */\n let length; /* length value */\n let code; /* code value */\n let dist; /* distance index */\n const bl_count = new Array(MAX_BITS$1 + 1);\n /* number of codes at each bit length for an optimal tree */\n\n // do check in _tr_init()\n //if (static_init_done) return;\n\n /* For some embedded targets, global variables are not initialized: */\n/*#ifdef NO_INIT_GLOBAL_POINTERS\n static_l_desc.static_tree = static_ltree;\n static_l_desc.extra_bits = extra_lbits;\n static_d_desc.static_tree = static_dtree;\n static_d_desc.extra_bits = extra_dbits;\n static_bl_desc.extra_bits = extra_blbits;\n#endif*/\n\n /* Initialize the mapping length (0..255) -> length code (0..28) */\n length = 0;\n for (code = 0; code < LENGTH_CODES$1 - 1; code++) {\n base_length[code] = length;\n for (n = 0; n < (1 << extra_lbits[code]); n++) {\n _length_code[length++] = code;\n }\n }\n //Assert (length == 256, \"tr_static_init: length != 256\");\n /* Note that the length 255 (match length 258) can be represented\n * in two different ways: code 284 + 5 bits or code 285, so we\n * overwrite length_code[255] to use the best encoding:\n */\n _length_code[length - 1] = code;\n\n /* Initialize the mapping dist (0..32K) -> dist code (0..29) */\n dist = 0;\n for (code = 0; code < 16; code++) {\n base_dist[code] = dist;\n for (n = 0; n < (1 << extra_dbits[code]); n++) {\n _dist_code[dist++] = code;\n }\n }\n //Assert (dist == 256, \"tr_static_init: dist != 256\");\n dist >>= 7; /* from now on, all distances are divided by 128 */\n for (; code < D_CODES$1; code++) {\n base_dist[code] = dist << 7;\n for (n = 0; n < (1 << (extra_dbits[code] - 7)); n++) {\n _dist_code[256 + dist++] = code;\n }\n }\n //Assert (dist == 256, \"tr_static_init: 256+dist != 512\");\n\n /* Construct the codes of the static literal tree */\n for (bits = 0; bits <= MAX_BITS$1; bits++) {\n bl_count[bits] = 0;\n }\n\n n = 0;\n while (n <= 143) {\n static_ltree[n * 2 + 1]/*.Len*/ = 8;\n n++;\n bl_count[8]++;\n }\n while (n <= 255) {\n static_ltree[n * 2 + 1]/*.Len*/ = 9;\n n++;\n bl_count[9]++;\n }\n while (n <= 279) {\n static_ltree[n * 2 + 1]/*.Len*/ = 7;\n n++;\n bl_count[7]++;\n }\n while (n <= 287) {\n static_ltree[n * 2 + 1]/*.Len*/ = 8;\n n++;\n bl_count[8]++;\n }\n /* Codes 286 and 287 do not exist, but we must include them in the\n * tree construction to get a canonical Huffman tree (longest code\n * all ones)\n */\n gen_codes(static_ltree, L_CODES$1 + 1, bl_count);\n\n /* The static distance tree is trivial: */\n for (n = 0; n < D_CODES$1; n++) {\n static_dtree[n * 2 + 1]/*.Len*/ = 5;\n static_dtree[n * 2]/*.Code*/ = bi_reverse(n, 5);\n }\n\n // Now data ready and we can init static trees\n static_l_desc = new StaticTreeDesc(static_ltree, extra_lbits, LITERALS$1 + 1, L_CODES$1, MAX_BITS$1);\n static_d_desc = new StaticTreeDesc(static_dtree, extra_dbits, 0, D_CODES$1, MAX_BITS$1);\n static_bl_desc = new StaticTreeDesc(new Array(0), extra_blbits, 0, BL_CODES$1, MAX_BL_BITS);\n\n //static_init_done = true;\n};\n\n\n/* ===========================================================================\n * Initialize a new block.\n */\nconst init_block = (s) => {\n\n let n; /* iterates over tree elements */\n\n /* Initialize the trees. */\n for (n = 0; n < L_CODES$1; n++) { s.dyn_ltree[n * 2]/*.Freq*/ = 0; }\n for (n = 0; n < D_CODES$1; n++) { s.dyn_dtree[n * 2]/*.Freq*/ = 0; }\n for (n = 0; n < BL_CODES$1; n++) { s.bl_tree[n * 2]/*.Freq*/ = 0; }\n\n s.dyn_ltree[END_BLOCK * 2]/*.Freq*/ = 1;\n s.opt_len = s.static_len = 0;\n s.last_lit = s.matches = 0;\n};\n\n\n/* ===========================================================================\n * Flush the bit buffer and align the output on a byte boundary\n */\nconst bi_windup = (s) =>\n{\n if (s.bi_valid > 8) {\n put_short(s, s.bi_buf);\n } else if (s.bi_valid > 0) {\n //put_byte(s, (Byte)s->bi_buf);\n s.pending_buf[s.pending++] = s.bi_buf;\n }\n s.bi_buf = 0;\n s.bi_valid = 0;\n};\n\n/* ===========================================================================\n * Copy a stored block, storing first the length and its\n * one's complement if requested.\n */\nconst copy_block = (s, buf, len, header) =>\n//DeflateState *s;\n//charf *buf; /* the input data */\n//unsigned len; /* its length */\n//int header; /* true if block header must be written */\n{\n bi_windup(s); /* align on byte boundary */\n\n if (header) {\n put_short(s, len);\n put_short(s, ~len);\n }\n// while (len--) {\n// put_byte(s, *buf++);\n// }\n s.pending_buf.set(s.window.subarray(buf, buf + len), s.pending);\n s.pending += len;\n};\n\n/* ===========================================================================\n * Compares to subtrees, using the tree depth as tie breaker when\n * the subtrees have equal frequency. This minimizes the worst case length.\n */\nconst smaller = (tree, n, m, depth) => {\n\n const _n2 = n * 2;\n const _m2 = m * 2;\n return (tree[_n2]/*.Freq*/ < tree[_m2]/*.Freq*/ ||\n (tree[_n2]/*.Freq*/ === tree[_m2]/*.Freq*/ && depth[n] <= depth[m]));\n};\n\n/* ===========================================================================\n * Restore the heap property by moving down the tree starting at node k,\n * exchanging a node with the smallest of its two sons if necessary, stopping\n * when the heap property is re-established (each father smaller than its\n * two sons).\n */\nconst pqdownheap = (s, tree, k) =>\n// deflate_state *s;\n// ct_data *tree; /* the tree to restore */\n// int k; /* node to move down */\n{\n const v = s.heap[k];\n let j = k << 1; /* left son of k */\n while (j <= s.heap_len) {\n /* Set j to the smallest of the two sons: */\n if (j < s.heap_len &&\n smaller(tree, s.heap[j + 1], s.heap[j], s.depth)) {\n j++;\n }\n /* Exit if v is smaller than both sons */\n if (smaller(tree, v, s.heap[j], s.depth)) { break; }\n\n /* Exchange v with the smallest son */\n s.heap[k] = s.heap[j];\n k = j;\n\n /* And continue down the tree, setting j to the left son of k */\n j <<= 1;\n }\n s.heap[k] = v;\n};\n\n\n// inlined manually\n// const SMALLEST = 1;\n\n/* ===========================================================================\n * Send the block data compressed using the given Huffman trees\n */\nconst compress_block = (s, ltree, dtree) =>\n// deflate_state *s;\n// const ct_data *ltree; /* literal tree */\n// const ct_data *dtree; /* distance tree */\n{\n let dist; /* distance of matched string */\n let lc; /* match length or unmatched char (if dist == 0) */\n let lx = 0; /* running index in l_buf */\n let code; /* the code to send */\n let extra; /* number of extra bits to send */\n\n if (s.last_lit !== 0) {\n do {\n dist = (s.pending_buf[s.d_buf + lx * 2] << 8) | (s.pending_buf[s.d_buf + lx * 2 + 1]);\n lc = s.pending_buf[s.l_buf + lx];\n lx++;\n\n if (dist === 0) {\n send_code(s, lc, ltree); /* send a literal byte */\n //Tracecv(isgraph(lc), (stderr,\" '%c' \", lc));\n } else {\n /* Here, lc is the match length - MIN_MATCH */\n code = _length_code[lc];\n send_code(s, code + LITERALS$1 + 1, ltree); /* send the length code */\n extra = extra_lbits[code];\n if (extra !== 0) {\n lc -= base_length[code];\n send_bits(s, lc, extra); /* send the extra length bits */\n }\n dist--; /* dist is now the match distance - 1 */\n code = d_code(dist);\n //Assert (code < D_CODES, \"bad d_code\");\n\n send_code(s, code, dtree); /* send the distance code */\n extra = extra_dbits[code];\n if (extra !== 0) {\n dist -= base_dist[code];\n send_bits(s, dist, extra); /* send the extra distance bits */\n }\n } /* literal or match pair ? */\n\n /* Check that the overlay between pending_buf and d_buf+l_buf is ok: */\n //Assert((uInt)(s->pending) < s->lit_bufsize + 2*lx,\n // \"pendingBuf overflow\");\n\n } while (lx < s.last_lit);\n }\n\n send_code(s, END_BLOCK, ltree);\n};\n\n\n/* ===========================================================================\n * Construct one Huffman tree and assigns the code bit strings and lengths.\n * Update the total bit length for the current block.\n * IN assertion: the field freq is set for all tree elements.\n * OUT assertions: the fields len and code are set to the optimal bit length\n * and corresponding code. The length opt_len is updated; static_len is\n * also updated if stree is not null. The field max_code is set.\n */\nconst build_tree = (s, desc) =>\n// deflate_state *s;\n// tree_desc *desc; /* the tree descriptor */\n{\n const tree = desc.dyn_tree;\n const stree = desc.stat_desc.static_tree;\n const has_stree = desc.stat_desc.has_stree;\n const elems = desc.stat_desc.elems;\n let n, m; /* iterate over heap elements */\n let max_code = -1; /* largest code with non zero frequency */\n let node; /* new node being created */\n\n /* Construct the initial heap, with least frequent element in\n * heap[SMALLEST]. The sons of heap[n] are heap[2*n] and heap[2*n+1].\n * heap[0] is not used.\n */\n s.heap_len = 0;\n s.heap_max = HEAP_SIZE$1;\n\n for (n = 0; n < elems; n++) {\n if (tree[n * 2]/*.Freq*/ !== 0) {\n s.heap[++s.heap_len] = max_code = n;\n s.depth[n] = 0;\n\n } else {\n tree[n * 2 + 1]/*.Len*/ = 0;\n }\n }\n\n /* The pkzip format requires that at least one distance code exists,\n * and that at least one bit should be sent even if there is only one\n * possible code. So to avoid special checks later on we force at least\n * two codes of non zero frequency.\n */\n while (s.heap_len < 2) {\n node = s.heap[++s.heap_len] = (max_code < 2 ? ++max_code : 0);\n tree[node * 2]/*.Freq*/ = 1;\n s.depth[node] = 0;\n s.opt_len--;\n\n if (has_stree) {\n s.static_len -= stree[node * 2 + 1]/*.Len*/;\n }\n /* node is 0 or 1 so it does not have extra bits */\n }\n desc.max_code = max_code;\n\n /* The elements heap[heap_len/2+1 .. heap_len] are leaves of the tree,\n * establish sub-heaps of increasing lengths:\n */\n for (n = (s.heap_len >> 1/*int /2*/); n >= 1; n--) { pqdownheap(s, tree, n); }\n\n /* Construct the Huffman tree by repeatedly combining the least two\n * frequent nodes.\n */\n node = elems; /* next internal node of the tree */\n do {\n //pqremove(s, tree, n); /* n = node of least frequency */\n /*** pqremove ***/\n n = s.heap[1/*SMALLEST*/];\n s.heap[1/*SMALLEST*/] = s.heap[s.heap_len--];\n pqdownheap(s, tree, 1/*SMALLEST*/);\n /***/\n\n m = s.heap[1/*SMALLEST*/]; /* m = node of next least frequency */\n\n s.heap[--s.heap_max] = n; /* keep the nodes sorted by frequency */\n s.heap[--s.heap_max] = m;\n\n /* Create a new node father of n and m */\n tree[node * 2]/*.Freq*/ = tree[n * 2]/*.Freq*/ + tree[m * 2]/*.Freq*/;\n s.depth[node] = (s.depth[n] >= s.depth[m] ? s.depth[n] : s.depth[m]) + 1;\n tree[n * 2 + 1]/*.Dad*/ = tree[m * 2 + 1]/*.Dad*/ = node;\n\n /* and insert the new node in the heap */\n s.heap[1/*SMALLEST*/] = node++;\n pqdownheap(s, tree, 1/*SMALLEST*/);\n\n } while (s.heap_len >= 2);\n\n s.heap[--s.heap_max] = s.heap[1/*SMALLEST*/];\n\n /* At this point, the fields freq and dad are set. We can now\n * generate the bit lengths.\n */\n gen_bitlen(s, desc);\n\n /* The field len is now set, we can generate the bit codes */\n gen_codes(tree, max_code, s.bl_count);\n};\n\n\n/* ===========================================================================\n * Scan a literal or distance tree to determine the frequencies of the codes\n * in the bit length tree.\n */\nconst scan_tree = (s, tree, max_code) =>\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n let n; /* iterates over all tree elements */\n let prevlen = -1; /* last emitted length */\n let curlen; /* length of current code */\n\n let nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n let count = 0; /* repeat count of the current code */\n let max_count = 7; /* max repeat count */\n let min_count = 4; /* min repeat count */\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n tree[(max_code + 1) * 2 + 1]/*.Len*/ = 0xffff; /* guard */\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n s.bl_tree[curlen * 2]/*.Freq*/ += count;\n\n } else if (curlen !== 0) {\n\n if (curlen !== prevlen) { s.bl_tree[curlen * 2]/*.Freq*/++; }\n s.bl_tree[REP_3_6 * 2]/*.Freq*/++;\n\n } else if (count <= 10) {\n s.bl_tree[REPZ_3_10 * 2]/*.Freq*/++;\n\n } else {\n s.bl_tree[REPZ_11_138 * 2]/*.Freq*/++;\n }\n\n count = 0;\n prevlen = curlen;\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n};\n\n\n/* ===========================================================================\n * Send a literal or distance tree in compressed form, using the codes in\n * bl_tree.\n */\nconst send_tree = (s, tree, max_code) =>\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n{\n let n; /* iterates over all tree elements */\n let prevlen = -1; /* last emitted length */\n let curlen; /* length of current code */\n\n let nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n let count = 0; /* repeat count of the current code */\n let max_count = 7; /* max repeat count */\n let min_count = 4; /* min repeat count */\n\n /* tree[max_code+1].Len = -1; */ /* guard already set */\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\n\n } else if (curlen !== 0) {\n if (curlen !== prevlen) {\n send_code(s, curlen, s.bl_tree);\n count--;\n }\n //Assert(count >= 3 && count <= 6, \" 3_6?\");\n send_code(s, REP_3_6, s.bl_tree);\n send_bits(s, count - 3, 2);\n\n } else if (count <= 10) {\n send_code(s, REPZ_3_10, s.bl_tree);\n send_bits(s, count - 3, 3);\n\n } else {\n send_code(s, REPZ_11_138, s.bl_tree);\n send_bits(s, count - 11, 7);\n }\n\n count = 0;\n prevlen = curlen;\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n};\n\n\n/* ===========================================================================\n * Construct the Huffman tree for the bit lengths and return the index in\n * bl_order of the last bit length code to send.\n */\nconst build_bl_tree = (s) => {\n\n let max_blindex; /* index of last bit length code of non zero freq */\n\n /* Determine the bit length frequencies for literal and distance trees */\n scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\n scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\n\n /* Build the bit length tree: */\n build_tree(s, s.bl_desc);\n /* opt_len now includes the length of the tree representations, except\n * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\n */\n\n /* Determine the number of bit length codes to send. The pkzip format\n * requires that at least 4 bit length codes be sent. (appnote.txt says\n * 3 but the actual value used is 4.)\n */\n for (max_blindex = BL_CODES$1 - 1; max_blindex >= 3; max_blindex--) {\n if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\n break;\n }\n }\n /* Update opt_len to include the bit length tree and counts */\n s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\n //Tracev((stderr, \"\\ndyn trees: dyn %ld, stat %ld\",\n // s->opt_len, s->static_len));\n\n return max_blindex;\n};\n\n\n/* ===========================================================================\n * Send the header for a block using dynamic Huffman trees: the counts, the\n * lengths of the bit length codes, the literal tree and the distance tree.\n * IN assertion: lcodes >= 257, dcodes >= 1, blcodes >= 4.\n */\nconst send_all_trees = (s, lcodes, dcodes, blcodes) =>\n// deflate_state *s;\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\n{\n let rank; /* index in bl_order */\n\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \"not enough codes\");\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\n // \"too many codes\");\n //Tracev((stderr, \"\\nbl counts: \"));\n send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */\n send_bits(s, dcodes - 1, 5);\n send_bits(s, blcodes - 4, 4); /* not -3 as stated in appnote.txt */\n for (rank = 0; rank < blcodes; rank++) {\n //Tracev((stderr, \"\\nbl code %2d \", bl_order[rank]));\n send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3);\n }\n //Tracev((stderr, \"\\nbl tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */\n //Tracev((stderr, \"\\nlit tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */\n //Tracev((stderr, \"\\ndist tree: sent %ld\", s->bits_sent));\n};\n\n\n/* ===========================================================================\n * Check if the data type is TEXT or BINARY, using the following algorithm:\n * - TEXT if the two conditions below are satisfied:\n * a) There are no non-portable control characters belonging to the\n * \"black list\" (0..6, 14..25, 28..31).\n * b) There is at least one printable character belonging to the\n * \"white list\" (9 {TAB}, 10 {LF}, 13 {CR}, 32..255).\n * - BINARY otherwise.\n * - The following partially-portable control characters form a\n * \"gray list\" that is ignored in this detection algorithm:\n * (7 {BEL}, 8 {BS}, 11 {VT}, 12 {FF}, 26 {SUB}, 27 {ESC}).\n * IN assertion: the fields Freq of dyn_ltree are set.\n */\nconst detect_data_type = (s) => {\n /* black_mask is the bit mask of black-listed bytes\n * set bits 0..6, 14..25, and 28..31\n * 0xf3ffc07f = binary 11110011111111111100000001111111\n */\n let black_mask = 0xf3ffc07f;\n let n;\n\n /* Check for non-textual (\"black-listed\") bytes. */\n for (n = 0; n <= 31; n++, black_mask >>>= 1) {\n if ((black_mask & 1) && (s.dyn_ltree[n * 2]/*.Freq*/ !== 0)) {\n return Z_BINARY;\n }\n }\n\n /* Check for textual (\"white-listed\") bytes. */\n if (s.dyn_ltree[9 * 2]/*.Freq*/ !== 0 || s.dyn_ltree[10 * 2]/*.Freq*/ !== 0 ||\n s.dyn_ltree[13 * 2]/*.Freq*/ !== 0) {\n return Z_TEXT;\n }\n for (n = 32; n < LITERALS$1; n++) {\n if (s.dyn_ltree[n * 2]/*.Freq*/ !== 0) {\n return Z_TEXT;\n }\n }\n\n /* There are no \"black-listed\" or \"white-listed\" bytes:\n * this stream either is empty or has tolerated (\"gray-listed\") bytes only.\n */\n return Z_BINARY;\n};\n\n\nlet static_init_done = false;\n\n/* ===========================================================================\n * Initialize the tree data structures for a new zlib stream.\n */\nconst _tr_init$1 = (s) =>\n{\n\n if (!static_init_done) {\n tr_static_init();\n static_init_done = true;\n }\n\n s.l_desc = new TreeDesc(s.dyn_ltree, static_l_desc);\n s.d_desc = new TreeDesc(s.dyn_dtree, static_d_desc);\n s.bl_desc = new TreeDesc(s.bl_tree, static_bl_desc);\n\n s.bi_buf = 0;\n s.bi_valid = 0;\n\n /* Initialize the first block of the first file: */\n init_block(s);\n};\n\n\n/* ===========================================================================\n * Send a stored block\n */\nconst _tr_stored_block$1 = (s, buf, stored_len, last) =>\n//DeflateState *s;\n//charf *buf; /* input block */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n send_bits(s, (STORED_BLOCK << 1) + (last ? 1 : 0), 3); /* send block type */\n copy_block(s, buf, stored_len, true); /* with header */\n};\n\n\n/* ===========================================================================\n * Send one empty static block to give enough lookahead for inflate.\n * This takes 10 bits, of which 7 may remain in the bit buffer.\n */\nconst _tr_align$1 = (s) => {\n send_bits(s, STATIC_TREES << 1, 3);\n send_code(s, END_BLOCK, static_ltree);\n bi_flush(s);\n};\n\n\n/* ===========================================================================\n * Determine the best encoding for the current block: dynamic trees, static\n * trees or store, and output the encoded block to the zip file.\n */\nconst _tr_flush_block$1 = (s, buf, stored_len, last) =>\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n{\n let opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n let max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN$1) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\n static_lenb = (s.static_len + 3 + 7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->last_lit));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block$1(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED$1 || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n};\n\n/* ===========================================================================\n * Save the match info and tally the frequency counts. Return true if\n * the current block must be flushed.\n */\nconst _tr_tally$1 = (s, dist, lc) =>\n// deflate_state *s;\n// unsigned dist; /* distance of matched string */\n// unsigned lc; /* match length-MIN_MATCH or unmatched char (if dist==0) */\n{\n //let out_length, in_length, dcode;\n\n s.pending_buf[s.d_buf + s.last_lit * 2] = (dist >>> 8) & 0xff;\n s.pending_buf[s.d_buf + s.last_lit * 2 + 1] = dist & 0xff;\n\n s.pending_buf[s.l_buf + s.last_lit] = lc & 0xff;\n s.last_lit++;\n\n if (dist === 0) {\n /* lc is the unmatched char */\n s.dyn_ltree[lc * 2]/*.Freq*/++;\n } else {\n s.matches++;\n /* Here, lc is the match length - MIN_MATCH */\n dist--; /* dist = match distance - 1 */\n //Assert((ush)dist < (ush)MAX_DIST(s) &&\n // (ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) &&\n // (ush)d_code(dist) < (ush)D_CODES, \"_tr_tally: bad match\");\n\n s.dyn_ltree[(_length_code[lc] + LITERALS$1 + 1) * 2]/*.Freq*/++;\n s.dyn_dtree[d_code(dist) * 2]/*.Freq*/++;\n }\n\n// (!) This block is disabled in zlib defaults,\n// don't enable it for binary compatibility\n\n//#ifdef TRUNCATE_BLOCK\n// /* Try to guess if it is profitable to stop the current block here */\n// if ((s.last_lit & 0x1fff) === 0 && s.level > 2) {\n// /* Compute an upper bound for the compressed length */\n// out_length = s.last_lit*8;\n// in_length = s.strstart - s.block_start;\n//\n// for (dcode = 0; dcode < D_CODES; dcode++) {\n// out_length += s.dyn_dtree[dcode*2]/*.Freq*/ * (5 + extra_dbits[dcode]);\n// }\n// out_length >>>= 3;\n// //Tracev((stderr,\"\\nlast_lit %u, in %ld, out ~%ld(%ld%%) \",\n// // s->last_lit, in_length, out_length,\n// // 100L - out_length*100L/in_length));\n// if (s.matches < (s.last_lit>>1)/*int /2*/ && out_length < (in_length>>1)/*int /2*/) {\n// return true;\n// }\n// }\n//#endif\n\n return (s.last_lit === s.lit_bufsize - 1);\n /* We avoid equality with lit_bufsize because of wraparound at 64K\n * on 16 bit machines and because stored blocks are restricted to\n * 64K-1 bytes.\n */\n};\n\nvar _tr_init_1 = _tr_init$1;\nvar _tr_stored_block_1 = _tr_stored_block$1;\nvar _tr_flush_block_1 = _tr_flush_block$1;\nvar _tr_tally_1 = _tr_tally$1;\nvar _tr_align_1 = _tr_align$1;\n\nvar trees = {\n\t_tr_init: _tr_init_1,\n\t_tr_stored_block: _tr_stored_block_1,\n\t_tr_flush_block: _tr_flush_block_1,\n\t_tr_tally: _tr_tally_1,\n\t_tr_align: _tr_align_1\n};\n\n// Note: adler32 takes 12% for level 0 and 2% for level 6.\n// It isn't worth it to make additional optimizations as in original.\n// Small size is preferable.\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n// claim that you wrote the original software. If you use this software\n// in a product, an acknowledgment in the product documentation would be\n// appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n// misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nconst adler32 = (adler, buf, len, pos) => {\n let s1 = (adler & 0xffff) |0,\n s2 = ((adler >>> 16) & 0xffff) |0,\n n = 0;\n\n while (len !== 0) {\n // Set limit ~ twice less than 5552, to keep\n // s2 in 31-bits, because we force signed ints.\n // in other case %= will fail.\n n = len > 2000 ? 2000 : len;\n len -= n;\n\n do {\n s1 = (s1 + buf[pos++]) |0;\n s2 = (s2 + s1) |0;\n } while (--n);\n\n s1 %= 65521;\n s2 %= 65521;\n }\n\n return (s1 | (s2 << 16)) |0;\n};\n\n\nvar adler32_1 = adler32;\n\n// Note: we can't get significant speed boost here.\n// So write code to minimize size - no pregenerated tables\n// and array tools dependencies.\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n// claim that you wrote the original software. If you use this software\n// in a product, an acknowledgment in the product documentation would be\n// appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n// misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\n// Use ordinary array, since untyped makes no boost here\nconst makeTable = () => {\n let c, table = [];\n\n for (var n = 0; n < 256; n++) {\n c = n;\n for (var k = 0; k < 8; k++) {\n c = ((c & 1) ? (0xEDB88320 ^ (c >>> 1)) : (c >>> 1));\n }\n table[n] = c;\n }\n\n return table;\n};\n\n// Create table on load. Just 255 signed longs. Not a problem.\nconst crcTable = new Uint32Array(makeTable());\n\n\nconst crc32 = (crc, buf, len, pos) => {\n const t = crcTable;\n const end = pos + len;\n\n crc ^= -1;\n\n for (let i = pos; i < end; i++) {\n crc = (crc >>> 8) ^ t[(crc ^ buf[i]) & 0xFF];\n }\n\n return (crc ^ (-1)); // >>> 0;\n};\n\n\nvar crc32_1 = crc32;\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n// claim that you wrote the original software. If you use this software\n// in a product, an acknowledgment in the product documentation would be\n// appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n// misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nvar messages = {\n 2: 'need dictionary', /* Z_NEED_DICT 2 */\n 1: 'stream end', /* Z_STREAM_END 1 */\n 0: '', /* Z_OK 0 */\n '-1': 'file error', /* Z_ERRNO (-1) */\n '-2': 'stream error', /* Z_STREAM_ERROR (-2) */\n '-3': 'data error', /* Z_DATA_ERROR (-3) */\n '-4': 'insufficient memory', /* Z_MEM_ERROR (-4) */\n '-5': 'buffer error', /* Z_BUF_ERROR (-5) */\n '-6': 'incompatible version' /* Z_VERSION_ERROR (-6) */\n};\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n// claim that you wrote the original software. If you use this software\n// in a product, an acknowledgment in the product documentation would be\n// appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n// misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nvar constants$2 = {\n\n /* Allowed flush values; see deflate() and inflate() below for details */\n Z_NO_FLUSH: 0,\n Z_PARTIAL_FLUSH: 1,\n Z_SYNC_FLUSH: 2,\n Z_FULL_FLUSH: 3,\n Z_FINISH: 4,\n Z_BLOCK: 5,\n Z_TREES: 6,\n\n /* Return codes for the compression/decompression functions. Negative values\n * are errors, positive values are used for special but normal events.\n */\n Z_OK: 0,\n Z_STREAM_END: 1,\n Z_NEED_DICT: 2,\n Z_ERRNO: -1,\n Z_STREAM_ERROR: -2,\n Z_DATA_ERROR: -3,\n Z_MEM_ERROR: -4,\n Z_BUF_ERROR: -5,\n //Z_VERSION_ERROR: -6,\n\n /* compression levels */\n Z_NO_COMPRESSION: 0,\n Z_BEST_SPEED: 1,\n Z_BEST_COMPRESSION: 9,\n Z_DEFAULT_COMPRESSION: -1,\n\n\n Z_FILTERED: 1,\n Z_HUFFMAN_ONLY: 2,\n Z_RLE: 3,\n Z_FIXED: 4,\n Z_DEFAULT_STRATEGY: 0,\n\n /* Possible values of the data_type field (though see inflate()) */\n Z_BINARY: 0,\n Z_TEXT: 1,\n //Z_ASCII: 1, // = Z_TEXT (deprecated)\n Z_UNKNOWN: 2,\n\n /* The deflate compression method */\n Z_DEFLATED: 8\n //Z_NULL: null // Use -1 or null inline, depending on var type\n};\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n// claim that you wrote the original software. If you use this software\n// in a product, an acknowledgment in the product documentation would be\n// appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n// misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nconst { _tr_init, _tr_stored_block, _tr_flush_block, _tr_tally, _tr_align } = trees;\n\n\n\n\n/* Public constants ==========================================================*/\n/* ===========================================================================*/\n\nconst {\n Z_NO_FLUSH: Z_NO_FLUSH$2, Z_PARTIAL_FLUSH, Z_FULL_FLUSH: Z_FULL_FLUSH$1, Z_FINISH: Z_FINISH$3, Z_BLOCK: Z_BLOCK$1,\n Z_OK: Z_OK$3, Z_STREAM_END: Z_STREAM_END$3, Z_STREAM_ERROR: Z_STREAM_ERROR$2, Z_DATA_ERROR: Z_DATA_ERROR$2, Z_BUF_ERROR: Z_BUF_ERROR$1,\n Z_DEFAULT_COMPRESSION: Z_DEFAULT_COMPRESSION$1,\n Z_FILTERED, Z_HUFFMAN_ONLY, Z_RLE, Z_FIXED, Z_DEFAULT_STRATEGY: Z_DEFAULT_STRATEGY$1,\n Z_UNKNOWN,\n Z_DEFLATED: Z_DEFLATED$2\n} = constants$2;\n\n/*============================================================================*/\n\n\nconst MAX_MEM_LEVEL = 9;\n/* Maximum value for memLevel in deflateInit2 */\nconst MAX_WBITS$1 = 15;\n/* 32K LZ77 window */\nconst DEF_MEM_LEVEL = 8;\n\n\nconst LENGTH_CODES = 29;\n/* number of length codes, not counting the special END_BLOCK code */\nconst LITERALS = 256;\n/* number of literal bytes 0..255 */\nconst L_CODES = LITERALS + 1 + LENGTH_CODES;\n/* number of Literal or Length codes, including the END_BLOCK code */\nconst D_CODES = 30;\n/* number of distance codes */\nconst BL_CODES = 19;\n/* number of codes used to transfer the bit lengths */\nconst HEAP_SIZE = 2 * L_CODES + 1;\n/* maximum heap size */\nconst MAX_BITS = 15;\n/* All codes must not exceed MAX_BITS bits */\n\nconst MIN_MATCH = 3;\nconst MAX_MATCH = 258;\nconst MIN_LOOKAHEAD = (MAX_MATCH + MIN_MATCH + 1);\n\nconst PRESET_DICT = 0x20;\n\nconst INIT_STATE = 42;\nconst EXTRA_STATE = 69;\nconst NAME_STATE = 73;\nconst COMMENT_STATE = 91;\nconst HCRC_STATE = 103;\nconst BUSY_STATE = 113;\nconst FINISH_STATE = 666;\n\nconst BS_NEED_MORE = 1; /* block not completed, need more input or more output */\nconst BS_BLOCK_DONE = 2; /* block flush performed */\nconst BS_FINISH_STARTED = 3; /* finish started, need only more output at next deflate */\nconst BS_FINISH_DONE = 4; /* finish done, accept no more input or output */\n\nconst OS_CODE = 0x03; // Unix :) . Don't detect, use this default.\n\nconst err = (strm, errorCode) => {\n strm.msg = messages[errorCode];\n return errorCode;\n};\n\nconst rank = (f) => {\n return ((f) << 1) - ((f) > 4 ? 9 : 0);\n};\n\nconst zero = (buf) => {\n let len = buf.length; while (--len >= 0) { buf[len] = 0; }\n};\n\n\n/* eslint-disable new-cap */\nlet HASH_ZLIB = (s, prev, data) => ((prev << s.hash_shift) ^ data) & s.hash_mask;\n// This hash causes less collisions, https://github.com/nodeca/pako/issues/135\n// But breaks binary compatibility\n//let HASH_FAST = (s, prev, data) => ((prev << 8) + (prev >> 8) + (data << 4)) & s.hash_mask;\nlet HASH = HASH_ZLIB;\n\n/* =========================================================================\n * Flush as much pending output as possible. All deflate() output goes\n * through this function so some applications may wish to modify it\n * to avoid allocating a large strm->output buffer and copying into it.\n * (See also read_buf()).\n */\nconst flush_pending = (strm) => {\n const s = strm.state;\n\n //_tr_flush_bits(s);\n let len = s.pending;\n if (len > strm.avail_out) {\n len = strm.avail_out;\n }\n if (len === 0) { return; }\n\n strm.output.set(s.pending_buf.subarray(s.pending_out, s.pending_out + len), strm.next_out);\n strm.next_out += len;\n s.pending_out += len;\n strm.total_out += len;\n strm.avail_out -= len;\n s.pending -= len;\n if (s.pending === 0) {\n s.pending_out = 0;\n }\n};\n\n\nconst flush_block_only = (s, last) => {\n _tr_flush_block(s, (s.block_start >= 0 ? s.block_start : -1), s.strstart - s.block_start, last);\n s.block_start = s.strstart;\n flush_pending(s.strm);\n};\n\n\nconst put_byte = (s, b) => {\n s.pending_buf[s.pending++] = b;\n};\n\n\n/* =========================================================================\n * Put a short in the pending buffer. The 16-bit value is put in MSB order.\n * IN assertion: the stream state is correct and there is enough room in\n * pending_buf.\n */\nconst putShortMSB = (s, b) => {\n\n // put_byte(s, (Byte)(b >> 8));\n// put_byte(s, (Byte)(b & 0xff));\n s.pending_buf[s.pending++] = (b >>> 8) & 0xff;\n s.pending_buf[s.pending++] = b & 0xff;\n};\n\n\n/* ===========================================================================\n * Read a new buffer from the current input stream, update the adler32\n * and total number of bytes read. All deflate() input goes through\n * this function so some applications may wish to modify it to avoid\n * allocating a large strm->input buffer and copying from it.\n * (See also flush_pending()).\n */\nconst read_buf = (strm, buf, start, size) => {\n\n let len = strm.avail_in;\n\n if (len > size) { len = size; }\n if (len === 0) { return 0; }\n\n strm.avail_in -= len;\n\n // zmemcpy(buf, strm->next_in, len);\n buf.set(strm.input.subarray(strm.next_in, strm.next_in + len), start);\n if (strm.state.wrap === 1) {\n strm.adler = adler32_1(strm.adler, buf, len, start);\n }\n\n else if (strm.state.wrap === 2) {\n strm.adler = crc32_1(strm.adler, buf, len, start);\n }\n\n strm.next_in += len;\n strm.total_in += len;\n\n return len;\n};\n\n\n/* ===========================================================================\n * Set match_start to the longest match starting at the given string and\n * return its length. Matches shorter or equal to prev_length are discarded,\n * in which case the result is equal to prev_length and match_start is\n * garbage.\n * IN assertions: cur_match is the head of the hash chain for the current\n * string (strstart) and its distance is <= MAX_DIST, and prev_length >= 1\n * OUT assertion: the match length is not greater than s->lookahead.\n */\nconst longest_match = (s, cur_match) => {\n\n let chain_length = s.max_chain_length; /* max hash chain length */\n let scan = s.strstart; /* current string */\n let match; /* matched string */\n let len; /* length of current match */\n let best_len = s.prev_length; /* best match length so far */\n let nice_match = s.nice_match; /* stop if match long enough */\n const limit = (s.strstart > (s.w_size - MIN_LOOKAHEAD)) ?\n s.strstart - (s.w_size - MIN_LOOKAHEAD) : 0/*NIL*/;\n\n const _win = s.window; // shortcut\n\n const wmask = s.w_mask;\n const prev = s.prev;\n\n /* Stop when cur_match becomes <= limit. To simplify the code,\n * we prevent matches with the string of window index 0.\n */\n\n const strend = s.strstart + MAX_MATCH;\n let scan_end1 = _win[scan + best_len - 1];\n let scan_end = _win[scan + best_len];\n\n /* The code is optimized for HASH_BITS >= 8 and MAX_MATCH-2 multiple of 16.\n * It is easy to get rid of this optimization if necessary.\n */\n // Assert(s->hash_bits >= 8 && MAX_MATCH == 258, \"Code too clever\");\n\n /* Do not waste too much time if we already have a good match: */\n if (s.prev_length >= s.good_match) {\n chain_length >>= 2;\n }\n /* Do not look for matches beyond the end of the input. This is necessary\n * to make deflate deterministic.\n */\n if (nice_match > s.lookahead) { nice_match = s.lookahead; }\n\n // Assert((ulg)s->strstart <= s->window_size-MIN_LOOKAHEAD, \"need lookahead\");\n\n do {\n // Assert(cur_match < s->strstart, \"no future\");\n match = cur_match;\n\n /* Skip to next match if the match length cannot increase\n * or if the match length is less than 2. Note that the checks below\n * for insufficient lookahead only occur occasionally for performance\n * reasons. Therefore uninitialized memory will be accessed, and\n * conditional jumps will be made that depend on those values.\n * However the length of the match is limited to the lookahead, so\n * the output of deflate is not affected by the uninitialized values.\n */\n\n if (_win[match + best_len] !== scan_end ||\n _win[match + best_len - 1] !== scan_end1 ||\n _win[match] !== _win[scan] ||\n _win[++match] !== _win[scan + 1]) {\n continue;\n }\n\n /* The check at best_len-1 can be removed because it will be made\n * again later. (This heuristic is not always a win.)\n * It is not necessary to compare scan[2] and match[2] since they\n * are always equal when the other bytes match, given that\n * the hash keys are equal and that HASH_BITS >= 8.\n */\n scan += 2;\n match++;\n // Assert(*scan == *match, \"match[2]?\");\n\n /* We check for insufficient lookahead only every 8th comparison;\n * the 256th check will be made at strstart+258.\n */\n do {\n /*jshint noempty:false*/\n } while (_win[++scan] === _win[++match] && _win[++scan] === _win[++match] &&\n _win[++scan] === _win[++match] && _win[++scan] === _win[++match] &&\n _win[++scan] === _win[++match] && _win[++scan] === _win[++match] &&\n _win[++scan] === _win[++match] && _win[++scan] === _win[++match] &&\n scan < strend);\n\n // Assert(scan <= s->window+(unsigned)(s->window_size-1), \"wild scan\");\n\n len = MAX_MATCH - (strend - scan);\n scan = strend - MAX_MATCH;\n\n if (len > best_len) {\n s.match_start = cur_match;\n best_len = len;\n if (len >= nice_match) {\n break;\n }\n scan_end1 = _win[scan + best_len - 1];\n scan_end = _win[scan + best_len];\n }\n } while ((cur_match = prev[cur_match & wmask]) > limit && --chain_length !== 0);\n\n if (best_len <= s.lookahead) {\n return best_len;\n }\n return s.lookahead;\n};\n\n\n/* ===========================================================================\n * Fill the window when the lookahead becomes insufficient.\n * Updates strstart and lookahead.\n *\n * IN assertion: lookahead < MIN_LOOKAHEAD\n * OUT assertions: strstart <= window_size-MIN_LOOKAHEAD\n * At least one byte has been read, or avail_in == 0; reads are\n * performed for at least two bytes (required for the zip translate_eol\n * option -- not supported here).\n */\nconst fill_window = (s) => {\n\n const _w_size = s.w_size;\n let p, n, m, more, str;\n\n //Assert(s->lookahead < MIN_LOOKAHEAD, \"already enough lookahead\");\n\n do {\n more = s.window_size - s.lookahead - s.strstart;\n\n // JS ints have 32 bit, block below not needed\n /* Deal with !@#$% 64K limit: */\n //if (sizeof(int) <= 2) {\n // if (more == 0 && s->strstart == 0 && s->lookahead == 0) {\n // more = wsize;\n //\n // } else if (more == (unsigned)(-1)) {\n // /* Very unlikely, but possible on 16 bit machine if\n // * strstart == 0 && lookahead == 1 (input done a byte at time)\n // */\n // more--;\n // }\n //}\n\n\n /* If the window is almost full and there is insufficient lookahead,\n * move the upper half to the lower one to make room in the upper half.\n */\n if (s.strstart >= _w_size + (_w_size - MIN_LOOKAHEAD)) {\n\n s.window.set(s.window.subarray(_w_size, _w_size + _w_size), 0);\n s.match_start -= _w_size;\n s.strstart -= _w_size;\n /* we now have strstart >= MAX_DIST */\n s.block_start -= _w_size;\n\n /* Slide the hash table (could be avoided with 32 bit values\n at the expense of memory usage). We slide even when level == 0\n to keep the hash table consistent if we switch back to level > 0\n later. (Using level 0 permanently is not an optimal usage of\n zlib, so we don't care about this pathological case.)\n */\n\n n = s.hash_size;\n p = n;\n\n do {\n m = s.head[--p];\n s.head[p] = (m >= _w_size ? m - _w_size : 0);\n } while (--n);\n\n n = _w_size;\n p = n;\n\n do {\n m = s.prev[--p];\n s.prev[p] = (m >= _w_size ? m - _w_size : 0);\n /* If n is not on any hash chain, prev[n] is garbage but\n * its value will never be used.\n */\n } while (--n);\n\n more += _w_size;\n }\n if (s.strm.avail_in === 0) {\n break;\n }\n\n /* If there was no sliding:\n * strstart <= WSIZE+MAX_DIST-1 && lookahead <= MIN_LOOKAHEAD - 1 &&\n * more == window_size - lookahead - strstart\n * => more >= window_size - (MIN_LOOKAHEAD-1 + WSIZE + MAX_DIST-1)\n * => more >= window_size - 2*WSIZE + 2\n * In the BIG_MEM or MMAP case (not yet supported),\n * window_size == input_size + MIN_LOOKAHEAD &&\n * strstart + s->lookahead <= input_size => more >= MIN_LOOKAHEAD.\n * Otherwise, window_size == 2*WSIZE so more >= 2.\n * If there was sliding, more >= WSIZE. So in all cases, more >= 2.\n */\n //Assert(more >= 2, \"more < 2\");\n n = read_buf(s.strm, s.window, s.strstart + s.lookahead, more);\n s.lookahead += n;\n\n /* Initialize the hash value now that we have some input: */\n if (s.lookahead + s.insert >= MIN_MATCH) {\n str = s.strstart - s.insert;\n s.ins_h = s.window[str];\n\n /* UPDATE_HASH(s, s->ins_h, s->window[str + 1]); */\n s.ins_h = HASH(s, s.ins_h, s.window[str + 1]);\n//#if MIN_MATCH != 3\n// Call update_hash() MIN_MATCH-3 more times\n//#endif\n while (s.insert) {\n /* UPDATE_HASH(s, s->ins_h, s->window[str + MIN_MATCH-1]); */\n s.ins_h = HASH(s, s.ins_h, s.window[str + MIN_MATCH - 1]);\n\n s.prev[str & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = str;\n str++;\n s.insert--;\n if (s.lookahead + s.insert < MIN_MATCH) {\n break;\n }\n }\n }\n /* If the whole input has less than MIN_MATCH bytes, ins_h is garbage,\n * but this is not important since only literal bytes will be emitted.\n */\n\n } while (s.lookahead < MIN_LOOKAHEAD && s.strm.avail_in !== 0);\n\n /* If the WIN_INIT bytes after the end of the current data have never been\n * written, then zero those bytes in order to avoid memory check reports of\n * the use of uninitialized (or uninitialised as Julian writes) bytes by\n * the longest match routines. Update the high water mark for the next\n * time through here. WIN_INIT is set to MAX_MATCH since the longest match\n * routines allow scanning to strstart + MAX_MATCH, ignoring lookahead.\n */\n// if (s.high_water < s.window_size) {\n// const curr = s.strstart + s.lookahead;\n// let init = 0;\n//\n// if (s.high_water < curr) {\n// /* Previous high water mark below current data -- zero WIN_INIT\n// * bytes or up to end of window, whichever is less.\n// */\n// init = s.window_size - curr;\n// if (init > WIN_INIT)\n// init = WIN_INIT;\n// zmemzero(s->window + curr, (unsigned)init);\n// s->high_water = curr + init;\n// }\n// else if (s->high_water < (ulg)curr + WIN_INIT) {\n// /* High water mark at or above current data, but below current data\n// * plus WIN_INIT -- zero out to current data plus WIN_INIT, or up\n// * to end of window, whichever is less.\n// */\n// init = (ulg)curr + WIN_INIT - s->high_water;\n// if (init > s->window_size - s->high_water)\n// init = s->window_size - s->high_water;\n// zmemzero(s->window + s->high_water, (unsigned)init);\n// s->high_water += init;\n// }\n// }\n//\n// Assert((ulg)s->strstart <= s->window_size - MIN_LOOKAHEAD,\n// \"not enough room for search\");\n};\n\n/* ===========================================================================\n * Copy without compression as much as possible from the input stream, return\n * the current block state.\n * This function does not insert new strings in the dictionary since\n * uncompressible data is probably not useful. This function is used\n * only for the level=0 compression option.\n * NOTE: this function should be optimized to avoid extra copying from\n * window to pending_buf.\n */\nconst deflate_stored = (s, flush) => {\n\n /* Stored blocks are limited to 0xffff bytes, pending_buf is limited\n * to pending_buf_size, and each stored block has a 5 byte header:\n */\n let max_block_size = 0xffff;\n\n if (max_block_size > s.pending_buf_size - 5) {\n max_block_size = s.pending_buf_size - 5;\n }\n\n /* Copy as much as possible from input to output: */\n for (;;) {\n /* Fill the window as much as possible: */\n if (s.lookahead <= 1) {\n\n //Assert(s->strstart < s->w_size+MAX_DIST(s) ||\n // s->block_start >= (long)s->w_size, \"slide too late\");\n// if (!(s.strstart < s.w_size + (s.w_size - MIN_LOOKAHEAD) ||\n// s.block_start >= s.w_size)) {\n// throw new Error(\"slide too late\");\n// }\n\n fill_window(s);\n if (s.lookahead === 0 && flush === Z_NO_FLUSH$2) {\n return BS_NEED_MORE;\n }\n\n if (s.lookahead === 0) {\n break;\n }\n /* flush the current block */\n }\n //Assert(s->block_start >= 0L, \"block gone\");\n// if (s.block_start < 0) throw new Error(\"block gone\");\n\n s.strstart += s.lookahead;\n s.lookahead = 0;\n\n /* Emit a stored block if pending_buf will be full: */\n const max_start = s.block_start + max_block_size;\n\n if (s.strstart === 0 || s.strstart >= max_start) {\n /* strstart == 0 is possible when wraparound on 16-bit machine */\n s.lookahead = s.strstart - max_start;\n s.strstart = max_start;\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n\n\n }\n /* Flush if we may have to slide, otherwise block_start may become\n * negative and the data will be gone:\n */\n if (s.strstart - s.block_start >= (s.w_size - MIN_LOOKAHEAD)) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n }\n\n s.insert = 0;\n\n if (flush === Z_FINISH$3) {\n /*** FLUSH_BLOCK(s, 1); ***/\n flush_block_only(s, true);\n if (s.strm.avail_out === 0) {\n return BS_FINISH_STARTED;\n }\n /***/\n return BS_FINISH_DONE;\n }\n\n if (s.strstart > s.block_start) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n return BS_NEED_MORE;\n};\n\n/* ===========================================================================\n * Compress as much as possible from the input stream, return the current\n * block state.\n * This function does not perform lazy evaluation of matches and inserts\n * new strings in the dictionary only for unmatched strings or for short\n * matches. It is used only for the fast compression options.\n */\nconst deflate_fast = (s, flush) => {\n\n let hash_head; /* head of the hash chain */\n let bflush; /* set if current block must be flushed */\n\n for (;;) {\n /* Make sure that we always have enough lookahead, except\n * at the end of the input file. We need MAX_MATCH bytes\n * for the next match, plus MIN_MATCH bytes to insert the\n * string following the next match.\n */\n if (s.lookahead < MIN_LOOKAHEAD) {\n fill_window(s);\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH$2) {\n return BS_NEED_MORE;\n }\n if (s.lookahead === 0) {\n break; /* flush the current block */\n }\n }\n\n /* Insert the string window[strstart .. strstart+2] in the\n * dictionary, and set hash_head to the head of the hash chain:\n */\n hash_head = 0/*NIL*/;\n if (s.lookahead >= MIN_MATCH) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = HASH(s, s.ins_h, s.window[s.strstart + MIN_MATCH - 1]);\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n\n /* Find the longest match, discarding those <= prev_length.\n * At this point we have always match_length < MIN_MATCH\n */\n if (hash_head !== 0/*NIL*/ && ((s.strstart - hash_head) <= (s.w_size - MIN_LOOKAHEAD))) {\n /* To simplify the code, we prevent matches with the string\n * of window index 0 (in particular we have to avoid a match\n * of the string with itself at the start of the input file).\n */\n s.match_length = longest_match(s, hash_head);\n /* longest_match() sets match_start */\n }\n if (s.match_length >= MIN_MATCH) {\n // check_match(s, s.strstart, s.match_start, s.match_length); // for debug only\n\n /*** _tr_tally_dist(s, s.strstart - s.match_start,\n s.match_length - MIN_MATCH, bflush); ***/\n bflush = _tr_tally(s, s.strstart - s.match_start, s.match_length - MIN_MATCH);\n\n s.lookahead -= s.match_length;\n\n /* Insert new strings in the hash table only if the match length\n * is not too large. This saves time but degrades compression.\n */\n if (s.match_length <= s.max_lazy_match/*max_insert_length*/ && s.lookahead >= MIN_MATCH) {\n s.match_length--; /* string at strstart already in table */\n do {\n s.strstart++;\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = HASH(s, s.ins_h, s.window[s.strstart + MIN_MATCH - 1]);\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n /* strstart never exceeds WSIZE-MAX_MATCH, so there are\n * always MIN_MATCH bytes ahead.\n */\n } while (--s.match_length !== 0);\n s.strstart++;\n } else\n {\n s.strstart += s.match_length;\n s.match_length = 0;\n s.ins_h = s.window[s.strstart];\n /* UPDATE_HASH(s, s.ins_h, s.window[s.strstart+1]); */\n s.ins_h = HASH(s, s.ins_h, s.window[s.strstart + 1]);\n\n//#if MIN_MATCH != 3\n// Call UPDATE_HASH() MIN_MATCH-3 more times\n//#endif\n /* If lookahead < MIN_MATCH, ins_h is garbage, but it does not\n * matter since it will be recomputed at next deflate call.\n */\n }\n } else {\n /* No match, output a literal byte */\n //Tracevv((stderr,\"%c\", s.window[s.strstart]));\n /*** _tr_tally_lit(s, s.window[s.strstart], bflush); ***/\n bflush = _tr_tally(s, 0, s.window[s.strstart]);\n\n s.lookahead--;\n s.strstart++;\n }\n if (bflush) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n }\n s.insert = ((s.strstart < (MIN_MATCH - 1)) ? s.strstart : MIN_MATCH - 1);\n if (flush === Z_FINISH$3) {\n /*** FLUSH_BLOCK(s, 1); ***/\n flush_block_only(s, true);\n if (s.strm.avail_out === 0) {\n return BS_FINISH_STARTED;\n }\n /***/\n return BS_FINISH_DONE;\n }\n if (s.last_lit) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n return BS_BLOCK_DONE;\n};\n\n/* ===========================================================================\n * Same as above, but achieves better compression. We use a lazy\n * evaluation for matches: a match is finally adopted only if there is\n * no better match at the next window position.\n */\nconst deflate_slow = (s, flush) => {\n\n let hash_head; /* head of hash chain */\n let bflush; /* set if current block must be flushed */\n\n let max_insert;\n\n /* Process the input block. */\n for (;;) {\n /* Make sure that we always have enough lookahead, except\n * at the end of the input file. We need MAX_MATCH bytes\n * for the next match, plus MIN_MATCH bytes to insert the\n * string following the next match.\n */\n if (s.lookahead < MIN_LOOKAHEAD) {\n fill_window(s);\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH$2) {\n return BS_NEED_MORE;\n }\n if (s.lookahead === 0) { break; } /* flush the current block */\n }\n\n /* Insert the string window[strstart .. strstart+2] in the\n * dictionary, and set hash_head to the head of the hash chain:\n */\n hash_head = 0/*NIL*/;\n if (s.lookahead >= MIN_MATCH) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = HASH(s, s.ins_h, s.window[s.strstart + MIN_MATCH - 1]);\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n\n /* Find the longest match, discarding those <= prev_length.\n */\n s.prev_length = s.match_length;\n s.prev_match = s.match_start;\n s.match_length = MIN_MATCH - 1;\n\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\n s.strstart - hash_head <= (s.w_size - MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\n /* To simplify the code, we prevent matches with the string\n * of window index 0 (in particular we have to avoid a match\n * of the string with itself at the start of the input file).\n */\n s.match_length = longest_match(s, hash_head);\n /* longest_match() sets match_start */\n\n if (s.match_length <= 5 &&\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\n\n /* If prev_match is also MIN_MATCH, match_start is garbage\n * but we will ignore the current match anyway.\n */\n s.match_length = MIN_MATCH - 1;\n }\n }\n /* If there was a match at the previous step and the current\n * match is not better, output the previous match:\n */\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\n /* Do not insert strings in hash table beyond this. */\n\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\n\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\n s.prev_length - MIN_MATCH, bflush);***/\n bflush = _tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH);\n /* Insert in hash table all strings up to the end of the match.\n * strstart-1 and strstart are already inserted. If there is not\n * enough lookahead, the last two strings are not inserted in\n * the hash table.\n */\n s.lookahead -= s.prev_length - 1;\n s.prev_length -= 2;\n do {\n if (++s.strstart <= max_insert) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = HASH(s, s.ins_h, s.window[s.strstart + MIN_MATCH - 1]);\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n } while (--s.prev_length !== 0);\n s.match_available = 0;\n s.match_length = MIN_MATCH - 1;\n s.strstart++;\n\n if (bflush) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n } else if (s.match_available) {\n /* If there was no match at the previous position, output a\n * single literal. If there was a match but the current match\n * is longer, truncate the previous match to a single literal.\n */\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = _tr_tally(s, 0, s.window[s.strstart - 1]);\n\n if (bflush) {\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\n flush_block_only(s, false);\n /***/\n }\n s.strstart++;\n s.lookahead--;\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n } else {\n /* There is no previous match to compare with, wait for\n * the next step to decide.\n */\n s.match_available = 1;\n s.strstart++;\n s.lookahead--;\n }\n }\n //Assert (flush != Z_NO_FLUSH, \"no flush?\");\n if (s.match_available) {\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = _tr_tally(s, 0, s.window[s.strstart - 1]);\n\n s.match_available = 0;\n }\n s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;\n if (flush === Z_FINISH$3) {\n /*** FLUSH_BLOCK(s, 1); ***/\n flush_block_only(s, true);\n if (s.strm.avail_out === 0) {\n return BS_FINISH_STARTED;\n }\n /***/\n return BS_FINISH_DONE;\n }\n if (s.last_lit) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n return BS_BLOCK_DONE;\n};\n\n\n/* ===========================================================================\n * For Z_RLE, simply look for runs of bytes, generate matches only of distance\n * one. Do not maintain a hash table. (It will be regenerated if this run of\n * deflate switches away from Z_RLE.)\n */\nconst deflate_rle = (s, flush) => {\n\n let bflush; /* set if current block must be flushed */\n let prev; /* byte at distance one to match */\n let scan, strend; /* scan goes up to strend for length of run */\n\n const _win = s.window;\n\n for (;;) {\n /* Make sure that we always have enough lookahead, except\n * at the end of the input file. We need MAX_MATCH bytes\n * for the longest run, plus one for the unrolled loop.\n */\n if (s.lookahead <= MAX_MATCH) {\n fill_window(s);\n if (s.lookahead <= MAX_MATCH && flush === Z_NO_FLUSH$2) {\n return BS_NEED_MORE;\n }\n if (s.lookahead === 0) { break; } /* flush the current block */\n }\n\n /* See how many times the previous byte repeats */\n s.match_length = 0;\n if (s.lookahead >= MIN_MATCH && s.strstart > 0) {\n scan = s.strstart - 1;\n prev = _win[scan];\n if (prev === _win[++scan] && prev === _win[++scan] && prev === _win[++scan]) {\n strend = s.strstart + MAX_MATCH;\n do {\n /*jshint noempty:false*/\n } while (prev === _win[++scan] && prev === _win[++scan] &&\n prev === _win[++scan] && prev === _win[++scan] &&\n prev === _win[++scan] && prev === _win[++scan] &&\n prev === _win[++scan] && prev === _win[++scan] &&\n scan < strend);\n s.match_length = MAX_MATCH - (strend - scan);\n if (s.match_length > s.lookahead) {\n s.match_length = s.lookahead;\n }\n }\n //Assert(scan <= s->window+(uInt)(s->window_size-1), \"wild scan\");\n }\n\n /* Emit match if have run of MIN_MATCH or longer, else emit literal */\n if (s.match_length >= MIN_MATCH) {\n //check_match(s, s.strstart, s.strstart - 1, s.match_length);\n\n /*** _tr_tally_dist(s, 1, s.match_length - MIN_MATCH, bflush); ***/\n bflush = _tr_tally(s, 1, s.match_length - MIN_MATCH);\n\n s.lookahead -= s.match_length;\n s.strstart += s.match_length;\n s.match_length = 0;\n } else {\n /* No match, output a literal byte */\n //Tracevv((stderr,\"%c\", s->window[s->strstart]));\n /*** _tr_tally_lit(s, s.window[s.strstart], bflush); ***/\n bflush = _tr_tally(s, 0, s.window[s.strstart]);\n\n s.lookahead--;\n s.strstart++;\n }\n if (bflush) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n }\n s.insert = 0;\n if (flush === Z_FINISH$3) {\n /*** FLUSH_BLOCK(s, 1); ***/\n flush_block_only(s, true);\n if (s.strm.avail_out === 0) {\n return BS_FINISH_STARTED;\n }\n /***/\n return BS_FINISH_DONE;\n }\n if (s.last_lit) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n return BS_BLOCK_DONE;\n};\n\n/* ===========================================================================\n * For Z_HUFFMAN_ONLY, do not look for matches. Do not maintain a hash table.\n * (It will be regenerated if this run of deflate switches away from Huffman.)\n */\nconst deflate_huff = (s, flush) => {\n\n let bflush; /* set if current block must be flushed */\n\n for (;;) {\n /* Make sure that we have a literal to write. */\n if (s.lookahead === 0) {\n fill_window(s);\n if (s.lookahead === 0) {\n if (flush === Z_NO_FLUSH$2) {\n return BS_NEED_MORE;\n }\n break; /* flush the current block */\n }\n }\n\n /* Output a literal byte */\n s.match_length = 0;\n //Tracevv((stderr,\"%c\", s->window[s->strstart]));\n /*** _tr_tally_lit(s, s.window[s.strstart], bflush); ***/\n bflush = _tr_tally(s, 0, s.window[s.strstart]);\n s.lookahead--;\n s.strstart++;\n if (bflush) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n }\n s.insert = 0;\n if (flush === Z_FINISH$3) {\n /*** FLUSH_BLOCK(s, 1); ***/\n flush_block_only(s, true);\n if (s.strm.avail_out === 0) {\n return BS_FINISH_STARTED;\n }\n /***/\n return BS_FINISH_DONE;\n }\n if (s.last_lit) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n return BS_BLOCK_DONE;\n};\n\n/* Values for max_lazy_match, good_match and max_chain_length, depending on\n * the desired pack level (0..9). The values given below have been tuned to\n * exclude worst case performance for pathological files. Better values may be\n * found for specific files.\n */\nfunction Config(good_length, max_lazy, nice_length, max_chain, func) {\n\n this.good_length = good_length;\n this.max_lazy = max_lazy;\n this.nice_length = nice_length;\n this.max_chain = max_chain;\n this.func = func;\n}\n\nconst configuration_table = [\n /* good lazy nice chain */\n new Config(0, 0, 0, 0, deflate_stored), /* 0 store only */\n new Config(4, 4, 8, 4, deflate_fast), /* 1 max speed, no lazy matches */\n new Config(4, 5, 16, 8, deflate_fast), /* 2 */\n new Config(4, 6, 32, 32, deflate_fast), /* 3 */\n\n new Config(4, 4, 16, 16, deflate_slow), /* 4 lazy matches */\n new Config(8, 16, 32, 32, deflate_slow), /* 5 */\n new Config(8, 16, 128, 128, deflate_slow), /* 6 */\n new Config(8, 32, 128, 256, deflate_slow), /* 7 */\n new Config(32, 128, 258, 1024, deflate_slow), /* 8 */\n new Config(32, 258, 258, 4096, deflate_slow) /* 9 max compression */\n];\n\n\n/* ===========================================================================\n * Initialize the \"longest match\" routines for a new zlib stream\n */\nconst lm_init = (s) => {\n\n s.window_size = 2 * s.w_size;\n\n /*** CLEAR_HASH(s); ***/\n zero(s.head); // Fill with NIL (= 0);\n\n /* Set the default configuration parameters:\n */\n s.max_lazy_match = configuration_table[s.level].max_lazy;\n s.good_match = configuration_table[s.level].good_length;\n s.nice_match = configuration_table[s.level].nice_length;\n s.max_chain_length = configuration_table[s.level].max_chain;\n\n s.strstart = 0;\n s.block_start = 0;\n s.lookahead = 0;\n s.insert = 0;\n s.match_length = s.prev_length = MIN_MATCH - 1;\n s.match_available = 0;\n s.ins_h = 0;\n};\n\n\nfunction DeflateState() {\n this.strm = null; /* pointer back to this zlib stream */\n this.status = 0; /* as the name implies */\n this.pending_buf = null; /* output still pending */\n this.pending_buf_size = 0; /* size of pending_buf */\n this.pending_out = 0; /* next pending byte to output to the stream */\n this.pending = 0; /* nb of bytes in the pending buffer */\n this.wrap = 0; /* bit 0 true for zlib, bit 1 true for gzip */\n this.gzhead = null; /* gzip header information to write */\n this.gzindex = 0; /* where in extra, name, or comment */\n this.method = Z_DEFLATED$2; /* can only be DEFLATED */\n this.last_flush = -1; /* value of flush param for previous deflate call */\n\n this.w_size = 0; /* LZ77 window size (32K by default) */\n this.w_bits = 0; /* log2(w_size) (8..16) */\n this.w_mask = 0; /* w_size - 1 */\n\n this.window = null;\n /* Sliding window. Input bytes are read into the second half of the window,\n * and move to the first half later to keep a dictionary of at least wSize\n * bytes. With this organization, matches are limited to a distance of\n * wSize-MAX_MATCH bytes, but this ensures that IO is always\n * performed with a length multiple of the block size.\n */\n\n this.window_size = 0;\n /* Actual size of window: 2*wSize, except when the user input buffer\n * is directly used as sliding window.\n */\n\n this.prev = null;\n /* Link to older string with same hash index. To limit the size of this\n * array to 64K, this link is maintained only for the last 32K strings.\n * An index in this array is thus a window index modulo 32K.\n */\n\n this.head = null; /* Heads of the hash chains or NIL. */\n\n this.ins_h = 0; /* hash index of string to be inserted */\n this.hash_size = 0; /* number of elements in hash table */\n this.hash_bits = 0; /* log2(hash_size) */\n this.hash_mask = 0; /* hash_size-1 */\n\n this.hash_shift = 0;\n /* Number of bits by which ins_h must be shifted at each input\n * step. It must be such that after MIN_MATCH steps, the oldest\n * byte no longer takes part in the hash key, that is:\n * hash_shift * MIN_MATCH >= hash_bits\n */\n\n this.block_start = 0;\n /* Window position at the beginning of the current output block. Gets\n * negative when the window is moved backwards.\n */\n\n this.match_length = 0; /* length of best match */\n this.prev_match = 0; /* previous match */\n this.match_available = 0; /* set if previous match exists */\n this.strstart = 0; /* start of string to insert */\n this.match_start = 0; /* start of matching string */\n this.lookahead = 0; /* number of valid bytes ahead in window */\n\n this.prev_length = 0;\n /* Length of the best match at previous step. Matches not greater than this\n * are discarded. This is used in the lazy match evaluation.\n */\n\n this.max_chain_length = 0;\n /* To speed up deflation, hash chains are never searched beyond this\n * length. A higher limit improves compression ratio but degrades the\n * speed.\n */\n\n this.max_lazy_match = 0;\n /* Attempt to find a better match only when the current match is strictly\n * smaller than this value. This mechanism is used only for compression\n * levels >= 4.\n */\n // That's alias to max_lazy_match, don't use directly\n //this.max_insert_length = 0;\n /* Insert new strings in the hash table only if the match length is not\n * greater than this length. This saves time but degrades compression.\n * max_insert_length is used only for compression levels <= 3.\n */\n\n this.level = 0; /* compression level (1..9) */\n this.strategy = 0; /* favor or force Huffman coding*/\n\n this.good_match = 0;\n /* Use a faster search when the previous match is longer than this */\n\n this.nice_match = 0; /* Stop searching when current match exceeds this */\n\n /* used by trees.c: */\n\n /* Didn't use ct_data typedef below to suppress compiler warning */\n\n // struct ct_data_s dyn_ltree[HEAP_SIZE]; /* literal and length tree */\n // struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */\n // struct ct_data_s bl_tree[2*BL_CODES+1]; /* Huffman tree for bit lengths */\n\n // Use flat array of DOUBLE size, with interleaved fata,\n // because JS does not support effective\n this.dyn_ltree = new Uint16Array(HEAP_SIZE * 2);\n this.dyn_dtree = new Uint16Array((2 * D_CODES + 1) * 2);\n this.bl_tree = new Uint16Array((2 * BL_CODES + 1) * 2);\n zero(this.dyn_ltree);\n zero(this.dyn_dtree);\n zero(this.bl_tree);\n\n this.l_desc = null; /* desc. for literal tree */\n this.d_desc = null; /* desc. for distance tree */\n this.bl_desc = null; /* desc. for bit length tree */\n\n //ush bl_count[MAX_BITS+1];\n this.bl_count = new Uint16Array(MAX_BITS + 1);\n /* number of codes at each bit length for an optimal tree */\n\n //int heap[2*L_CODES+1]; /* heap used to build the Huffman trees */\n this.heap = new Uint16Array(2 * L_CODES + 1); /* heap used to build the Huffman trees */\n zero(this.heap);\n\n this.heap_len = 0; /* number of elements in the heap */\n this.heap_max = 0; /* element of largest frequency */\n /* The sons of heap[n] are heap[2*n] and heap[2*n+1]. heap[0] is not used.\n * The same heap array is used to build all trees.\n */\n\n this.depth = new Uint16Array(2 * L_CODES + 1); //uch depth[2*L_CODES+1];\n zero(this.depth);\n /* Depth of each subtree used as tie breaker for trees of equal frequency\n */\n\n this.l_buf = 0; /* buffer index for literals or lengths */\n\n this.lit_bufsize = 0;\n /* Size of match buffer for literals/lengths. There are 4 reasons for\n * limiting lit_bufsize to 64K:\n * - frequencies can be kept in 16 bit counters\n * - if compression is not successful for the first block, all input\n * data is still in the window so we can still emit a stored block even\n * when input comes from standard input. (This can also be done for\n * all blocks if lit_bufsize is not greater than 32K.)\n * - if compression is not successful for a file smaller than 64K, we can\n * even emit a stored file instead of a stored block (saving 5 bytes).\n * This is applicable only for zip (not gzip or zlib).\n * - creating new Huffman trees less frequently may not provide fast\n * adaptation to changes in the input data statistics. (Take for\n * example a binary file with poorly compressible code followed by\n * a highly compressible string table.) Smaller buffer sizes give\n * fast adaptation but have of course the overhead of transmitting\n * trees more frequently.\n * - I can't count above 4\n */\n\n this.last_lit = 0; /* running index in l_buf */\n\n this.d_buf = 0;\n /* Buffer index for distances. To simplify the code, d_buf and l_buf have\n * the same number of elements. To use different lengths, an extra flag\n * array would be necessary.\n */\n\n this.opt_len = 0; /* bit length of current block with optimal trees */\n this.static_len = 0; /* bit length of current block with static trees */\n this.matches = 0; /* number of string matches in current block */\n this.insert = 0; /* bytes at end of window left to insert */\n\n\n this.bi_buf = 0;\n /* Output buffer. bits are inserted starting at the bottom (least\n * significant bits).\n */\n this.bi_valid = 0;\n /* Number of valid bits in bi_buf. All bits above the last valid bit\n * are always zero.\n */\n\n // Used for window memory init. We safely ignore it for JS. That makes\n // sense only for pointers and memory check tools.\n //this.high_water = 0;\n /* High water mark offset in window for initialized bytes -- bytes above\n * this are set to zero in order to avoid memory check warnings when\n * longest match routines access bytes past the input. This is then\n * updated to the new high water mark.\n */\n}\n\n\nconst deflateResetKeep = (strm) => {\n\n if (!strm || !strm.state) {\n return err(strm, Z_STREAM_ERROR$2);\n }\n\n strm.total_in = strm.total_out = 0;\n strm.data_type = Z_UNKNOWN;\n\n const s = strm.state;\n s.pending = 0;\n s.pending_out = 0;\n\n if (s.wrap < 0) {\n s.wrap = -s.wrap;\n /* was made negative by deflate(..., Z_FINISH); */\n }\n s.status = (s.wrap ? INIT_STATE : BUSY_STATE);\n strm.adler = (s.wrap === 2) ?\n 0 // crc32(0, Z_NULL, 0)\n :\n 1; // adler32(0, Z_NULL, 0)\n s.last_flush = Z_NO_FLUSH$2;\n _tr_init(s);\n return Z_OK$3;\n};\n\n\nconst deflateReset = (strm) => {\n\n const ret = deflateResetKeep(strm);\n if (ret === Z_OK$3) {\n lm_init(strm.state);\n }\n return ret;\n};\n\n\nconst deflateSetHeader = (strm, head) => {\n\n if (!strm || !strm.state) { return Z_STREAM_ERROR$2; }\n if (strm.state.wrap !== 2) { return Z_STREAM_ERROR$2; }\n strm.state.gzhead = head;\n return Z_OK$3;\n};\n\n\nconst deflateInit2 = (strm, level, method, windowBits, memLevel, strategy) => {\n\n if (!strm) { // === Z_NULL\n return Z_STREAM_ERROR$2;\n }\n let wrap = 1;\n\n if (level === Z_DEFAULT_COMPRESSION$1) {\n level = 6;\n }\n\n if (windowBits < 0) { /* suppress zlib wrapper */\n wrap = 0;\n windowBits = -windowBits;\n }\n\n else if (windowBits > 15) {\n wrap = 2; /* write gzip wrapper instead */\n windowBits -= 16;\n }\n\n\n if (memLevel < 1 || memLevel > MAX_MEM_LEVEL || method !== Z_DEFLATED$2 ||\n windowBits < 8 || windowBits > 15 || level < 0 || level > 9 ||\n strategy < 0 || strategy > Z_FIXED) {\n return err(strm, Z_STREAM_ERROR$2);\n }\n\n\n if (windowBits === 8) {\n windowBits = 9;\n }\n /* until 256-byte window bug fixed */\n\n const s = new DeflateState();\n\n strm.state = s;\n s.strm = strm;\n\n s.wrap = wrap;\n s.gzhead = null;\n s.w_bits = windowBits;\n s.w_size = 1 << s.w_bits;\n s.w_mask = s.w_size - 1;\n\n s.hash_bits = memLevel + 7;\n s.hash_size = 1 << s.hash_bits;\n s.hash_mask = s.hash_size - 1;\n s.hash_shift = ~~((s.hash_bits + MIN_MATCH - 1) / MIN_MATCH);\n\n s.window = new Uint8Array(s.w_size * 2);\n s.head = new Uint16Array(s.hash_size);\n s.prev = new Uint16Array(s.w_size);\n\n // Don't need mem init magic for JS.\n //s.high_water = 0; /* nothing written to s->window yet */\n\n s.lit_bufsize = 1 << (memLevel + 6); /* 16K elements by default */\n\n s.pending_buf_size = s.lit_bufsize * 4;\n\n //overlay = (ushf *) ZALLOC(strm, s->lit_bufsize, sizeof(ush)+2);\n //s->pending_buf = (uchf *) overlay;\n s.pending_buf = new Uint8Array(s.pending_buf_size);\n\n // It is offset from `s.pending_buf` (size is `s.lit_bufsize * 2`)\n //s->d_buf = overlay + s->lit_bufsize/sizeof(ush);\n s.d_buf = 1 * s.lit_bufsize;\n\n //s->l_buf = s->pending_buf + (1+sizeof(ush))*s->lit_bufsize;\n s.l_buf = (1 + 2) * s.lit_bufsize;\n\n s.level = level;\n s.strategy = strategy;\n s.method = method;\n\n return deflateReset(strm);\n};\n\nconst deflateInit = (strm, level) => {\n\n return deflateInit2(strm, level, Z_DEFLATED$2, MAX_WBITS$1, DEF_MEM_LEVEL, Z_DEFAULT_STRATEGY$1);\n};\n\n\nconst deflate$2 = (strm, flush) => {\n\n let beg, val; // for gzip header write only\n\n if (!strm || !strm.state ||\n flush > Z_BLOCK$1 || flush < 0) {\n return strm ? err(strm, Z_STREAM_ERROR$2) : Z_STREAM_ERROR$2;\n }\n\n const s = strm.state;\n\n if (!strm.output ||\n (!strm.input && strm.avail_in !== 0) ||\n (s.status === FINISH_STATE && flush !== Z_FINISH$3)) {\n return err(strm, (strm.avail_out === 0) ? Z_BUF_ERROR$1 : Z_STREAM_ERROR$2);\n }\n\n s.strm = strm; /* just in case */\n const old_flush = s.last_flush;\n s.last_flush = flush;\n\n /* Write the header */\n if (s.status === INIT_STATE) {\n\n if (s.wrap === 2) { // GZIP header\n strm.adler = 0; //crc32(0L, Z_NULL, 0);\n put_byte(s, 31);\n put_byte(s, 139);\n put_byte(s, 8);\n if (!s.gzhead) { // s->gzhead == Z_NULL\n put_byte(s, 0);\n put_byte(s, 0);\n put_byte(s, 0);\n put_byte(s, 0);\n put_byte(s, 0);\n put_byte(s, s.level === 9 ? 2 :\n (s.strategy >= Z_HUFFMAN_ONLY || s.level < 2 ?\n 4 : 0));\n put_byte(s, OS_CODE);\n s.status = BUSY_STATE;\n }\n else {\n put_byte(s, (s.gzhead.text ? 1 : 0) +\n (s.gzhead.hcrc ? 2 : 0) +\n (!s.gzhead.extra ? 0 : 4) +\n (!s.gzhead.name ? 0 : 8) +\n (!s.gzhead.comment ? 0 : 16)\n );\n put_byte(s, s.gzhead.time & 0xff);\n put_byte(s, (s.gzhead.time >> 8) & 0xff);\n put_byte(s, (s.gzhead.time >> 16) & 0xff);\n put_byte(s, (s.gzhead.time >> 24) & 0xff);\n put_byte(s, s.level === 9 ? 2 :\n (s.strategy >= Z_HUFFMAN_ONLY || s.level < 2 ?\n 4 : 0));\n put_byte(s, s.gzhead.os & 0xff);\n if (s.gzhead.extra && s.gzhead.extra.length) {\n put_byte(s, s.gzhead.extra.length & 0xff);\n put_byte(s, (s.gzhead.extra.length >> 8) & 0xff);\n }\n if (s.gzhead.hcrc) {\n strm.adler = crc32_1(strm.adler, s.pending_buf, s.pending, 0);\n }\n s.gzindex = 0;\n s.status = EXTRA_STATE;\n }\n }\n else // DEFLATE header\n {\n let header = (Z_DEFLATED$2 + ((s.w_bits - 8) << 4)) << 8;\n let level_flags = -1;\n\n if (s.strategy >= Z_HUFFMAN_ONLY || s.level < 2) {\n level_flags = 0;\n } else if (s.level < 6) {\n level_flags = 1;\n } else if (s.level === 6) {\n level_flags = 2;\n } else {\n level_flags = 3;\n }\n header |= (level_flags << 6);\n if (s.strstart !== 0) { header |= PRESET_DICT; }\n header += 31 - (header % 31);\n\n s.status = BUSY_STATE;\n putShortMSB(s, header);\n\n /* Save the adler32 of the preset dictionary: */\n if (s.strstart !== 0) {\n putShortMSB(s, strm.adler >>> 16);\n putShortMSB(s, strm.adler & 0xffff);\n }\n strm.adler = 1; // adler32(0L, Z_NULL, 0);\n }\n }\n\n//#ifdef GZIP\n if (s.status === EXTRA_STATE) {\n if (s.gzhead.extra/* != Z_NULL*/) {\n beg = s.pending; /* start of bytes to update crc */\n\n while (s.gzindex < (s.gzhead.extra.length & 0xffff)) {\n if (s.pending === s.pending_buf_size) {\n if (s.gzhead.hcrc && s.pending > beg) {\n strm.adler = crc32_1(strm.adler, s.pending_buf, s.pending - beg, beg);\n }\n flush_pending(strm);\n beg = s.pending;\n if (s.pending === s.pending_buf_size) {\n break;\n }\n }\n put_byte(s, s.gzhead.extra[s.gzindex] & 0xff);\n s.gzindex++;\n }\n if (s.gzhead.hcrc && s.pending > beg) {\n strm.adler = crc32_1(strm.adler, s.pending_buf, s.pending - beg, beg);\n }\n if (s.gzindex === s.gzhead.extra.length) {\n s.gzindex = 0;\n s.status = NAME_STATE;\n }\n }\n else {\n s.status = NAME_STATE;\n }\n }\n if (s.status === NAME_STATE) {\n if (s.gzhead.name/* != Z_NULL*/) {\n beg = s.pending; /* start of bytes to update crc */\n //int val;\n\n do {\n if (s.pending === s.pending_buf_size) {\n if (s.gzhead.hcrc && s.pending > beg) {\n strm.adler = crc32_1(strm.adler, s.pending_buf, s.pending - beg, beg);\n }\n flush_pending(strm);\n beg = s.pending;\n if (s.pending === s.pending_buf_size) {\n val = 1;\n break;\n }\n }\n // JS specific: little magic to add zero terminator to end of string\n if (s.gzindex < s.gzhead.name.length) {\n val = s.gzhead.name.charCodeAt(s.gzindex++) & 0xff;\n } else {\n val = 0;\n }\n put_byte(s, val);\n } while (val !== 0);\n\n if (s.gzhead.hcrc && s.pending > beg) {\n strm.adler = crc32_1(strm.adler, s.pending_buf, s.pending - beg, beg);\n }\n if (val === 0) {\n s.gzindex = 0;\n s.status = COMMENT_STATE;\n }\n }\n else {\n s.status = COMMENT_STATE;\n }\n }\n if (s.status === COMMENT_STATE) {\n if (s.gzhead.comment/* != Z_NULL*/) {\n beg = s.pending; /* start of bytes to update crc */\n //int val;\n\n do {\n if (s.pending === s.pending_buf_size) {\n if (s.gzhead.hcrc && s.pending > beg) {\n strm.adler = crc32_1(strm.adler, s.pending_buf, s.pending - beg, beg);\n }\n flush_pending(strm);\n beg = s.pending;\n if (s.pending === s.pending_buf_size) {\n val = 1;\n break;\n }\n }\n // JS specific: little magic to add zero terminator to end of string\n if (s.gzindex < s.gzhead.comment.length) {\n val = s.gzhead.comment.charCodeAt(s.gzindex++) & 0xff;\n } else {\n val = 0;\n }\n put_byte(s, val);\n } while (val !== 0);\n\n if (s.gzhead.hcrc && s.pending > beg) {\n strm.adler = crc32_1(strm.adler, s.pending_buf, s.pending - beg, beg);\n }\n if (val === 0) {\n s.status = HCRC_STATE;\n }\n }\n else {\n s.status = HCRC_STATE;\n }\n }\n if (s.status === HCRC_STATE) {\n if (s.gzhead.hcrc) {\n if (s.pending + 2 > s.pending_buf_size) {\n flush_pending(strm);\n }\n if (s.pending + 2 <= s.pending_buf_size) {\n put_byte(s, strm.adler & 0xff);\n put_byte(s, (strm.adler >> 8) & 0xff);\n strm.adler = 0; //crc32(0L, Z_NULL, 0);\n s.status = BUSY_STATE;\n }\n }\n else {\n s.status = BUSY_STATE;\n }\n }\n//#endif\n\n /* Flush as much pending output as possible */\n if (s.pending !== 0) {\n flush_pending(strm);\n if (strm.avail_out === 0) {\n /* Since avail_out is 0, deflate will be called again with\n * more output space, but possibly with both pending and\n * avail_in equal to zero. There won't be anything to do,\n * but this is not an error situation so make sure we\n * return OK instead of BUF_ERROR at next call of deflate:\n */\n s.last_flush = -1;\n return Z_OK$3;\n }\n\n /* Make sure there is something to do and avoid duplicate consecutive\n * flushes. For repeated and useless calls with Z_FINISH, we keep\n * returning Z_STREAM_END instead of Z_BUF_ERROR.\n */\n } else if (strm.avail_in === 0 && rank(flush) <= rank(old_flush) &&\n flush !== Z_FINISH$3) {\n return err(strm, Z_BUF_ERROR$1);\n }\n\n /* User must not provide more input after the first FINISH: */\n if (s.status === FINISH_STATE && strm.avail_in !== 0) {\n return err(strm, Z_BUF_ERROR$1);\n }\n\n /* Start a new block or continue the current one.\n */\n if (strm.avail_in !== 0 || s.lookahead !== 0 ||\n (flush !== Z_NO_FLUSH$2 && s.status !== FINISH_STATE)) {\n let bstate = (s.strategy === Z_HUFFMAN_ONLY) ? deflate_huff(s, flush) :\n (s.strategy === Z_RLE ? deflate_rle(s, flush) :\n configuration_table[s.level].func(s, flush));\n\n if (bstate === BS_FINISH_STARTED || bstate === BS_FINISH_DONE) {\n s.status = FINISH_STATE;\n }\n if (bstate === BS_NEED_MORE || bstate === BS_FINISH_STARTED) {\n if (strm.avail_out === 0) {\n s.last_flush = -1;\n /* avoid BUF_ERROR next call, see above */\n }\n return Z_OK$3;\n /* If flush != Z_NO_FLUSH && avail_out == 0, the next call\n * of deflate should use the same flush parameter to make sure\n * that the flush is complete. So we don't have to output an\n * empty block here, this will be done at next call. This also\n * ensures that for a very small output buffer, we emit at most\n * one empty block.\n */\n }\n if (bstate === BS_BLOCK_DONE) {\n if (flush === Z_PARTIAL_FLUSH) {\n _tr_align(s);\n }\n else if (flush !== Z_BLOCK$1) { /* FULL_FLUSH or SYNC_FLUSH */\n\n _tr_stored_block(s, 0, 0, false);\n /* For a full flush, this empty block will be recognized\n * as a special marker by inflate_sync().\n */\n if (flush === Z_FULL_FLUSH$1) {\n /*** CLEAR_HASH(s); ***/ /* forget history */\n zero(s.head); // Fill with NIL (= 0);\n\n if (s.lookahead === 0) {\n s.strstart = 0;\n s.block_start = 0;\n s.insert = 0;\n }\n }\n }\n flush_pending(strm);\n if (strm.avail_out === 0) {\n s.last_flush = -1; /* avoid BUF_ERROR at next call, see above */\n return Z_OK$3;\n }\n }\n }\n //Assert(strm->avail_out > 0, \"bug2\");\n //if (strm.avail_out <= 0) { throw new Error(\"bug2\");}\n\n if (flush !== Z_FINISH$3) { return Z_OK$3; }\n if (s.wrap <= 0) { return Z_STREAM_END$3; }\n\n /* Write the trailer */\n if (s.wrap === 2) {\n put_byte(s, strm.adler & 0xff);\n put_byte(s, (strm.adler >> 8) & 0xff);\n put_byte(s, (strm.adler >> 16) & 0xff);\n put_byte(s, (strm.adler >> 24) & 0xff);\n put_byte(s, strm.total_in & 0xff);\n put_byte(s, (strm.total_in >> 8) & 0xff);\n put_byte(s, (strm.total_in >> 16) & 0xff);\n put_byte(s, (strm.total_in >> 24) & 0xff);\n }\n else\n {\n putShortMSB(s, strm.adler >>> 16);\n putShortMSB(s, strm.adler & 0xffff);\n }\n\n flush_pending(strm);\n /* If avail_out is zero, the application will call deflate again\n * to flush the rest.\n */\n if (s.wrap > 0) { s.wrap = -s.wrap; }\n /* write the trailer only once! */\n return s.pending !== 0 ? Z_OK$3 : Z_STREAM_END$3;\n};\n\n\nconst deflateEnd = (strm) => {\n\n if (!strm/*== Z_NULL*/ || !strm.state/*== Z_NULL*/) {\n return Z_STREAM_ERROR$2;\n }\n\n const status = strm.state.status;\n if (status !== INIT_STATE &&\n status !== EXTRA_STATE &&\n status !== NAME_STATE &&\n status !== COMMENT_STATE &&\n status !== HCRC_STATE &&\n status !== BUSY_STATE &&\n status !== FINISH_STATE\n ) {\n return err(strm, Z_STREAM_ERROR$2);\n }\n\n strm.state = null;\n\n return status === BUSY_STATE ? err(strm, Z_DATA_ERROR$2) : Z_OK$3;\n};\n\n\n/* =========================================================================\n * Initializes the compression dictionary from the given byte\n * sequence without producing any compressed output.\n */\nconst deflateSetDictionary = (strm, dictionary) => {\n\n let dictLength = dictionary.length;\n\n if (!strm/*== Z_NULL*/ || !strm.state/*== Z_NULL*/) {\n return Z_STREAM_ERROR$2;\n }\n\n const s = strm.state;\n const wrap = s.wrap;\n\n if (wrap === 2 || (wrap === 1 && s.status !== INIT_STATE) || s.lookahead) {\n return Z_STREAM_ERROR$2;\n }\n\n /* when using zlib wrappers, compute Adler-32 for provided dictionary */\n if (wrap === 1) {\n /* adler32(strm->adler, dictionary, dictLength); */\n strm.adler = adler32_1(strm.adler, dictionary, dictLength, 0);\n }\n\n s.wrap = 0; /* avoid computing Adler-32 in read_buf */\n\n /* if dictionary would fill window, just replace the history */\n if (dictLength >= s.w_size) {\n if (wrap === 0) { /* already empty otherwise */\n /*** CLEAR_HASH(s); ***/\n zero(s.head); // Fill with NIL (= 0);\n s.strstart = 0;\n s.block_start = 0;\n s.insert = 0;\n }\n /* use the tail */\n // dictionary = dictionary.slice(dictLength - s.w_size);\n let tmpDict = new Uint8Array(s.w_size);\n tmpDict.set(dictionary.subarray(dictLength - s.w_size, dictLength), 0);\n dictionary = tmpDict;\n dictLength = s.w_size;\n }\n /* insert dictionary into window and hash */\n const avail = strm.avail_in;\n const next = strm.next_in;\n const input = strm.input;\n strm.avail_in = dictLength;\n strm.next_in = 0;\n strm.input = dictionary;\n fill_window(s);\n while (s.lookahead >= MIN_MATCH) {\n let str = s.strstart;\n let n = s.lookahead - (MIN_MATCH - 1);\n do {\n /* UPDATE_HASH(s, s->ins_h, s->window[str + MIN_MATCH-1]); */\n s.ins_h = HASH(s, s.ins_h, s.window[str + MIN_MATCH - 1]);\n\n s.prev[str & s.w_mask] = s.head[s.ins_h];\n\n s.head[s.ins_h] = str;\n str++;\n } while (--n);\n s.strstart = str;\n s.lookahead = MIN_MATCH - 1;\n fill_window(s);\n }\n s.strstart += s.lookahead;\n s.block_start = s.strstart;\n s.insert = s.lookahead;\n s.lookahead = 0;\n s.match_length = s.prev_length = MIN_MATCH - 1;\n s.match_available = 0;\n strm.next_in = next;\n strm.input = input;\n strm.avail_in = avail;\n s.wrap = wrap;\n return Z_OK$3;\n};\n\n\nvar deflateInit_1 = deflateInit;\nvar deflateInit2_1 = deflateInit2;\nvar deflateReset_1 = deflateReset;\nvar deflateResetKeep_1 = deflateResetKeep;\nvar deflateSetHeader_1 = deflateSetHeader;\nvar deflate_2$1 = deflate$2;\nvar deflateEnd_1 = deflateEnd;\nvar deflateSetDictionary_1 = deflateSetDictionary;\nvar deflateInfo = 'pako deflate (from Nodeca project)';\n\n/* Not implemented\nmodule.exports.deflateBound = deflateBound;\nmodule.exports.deflateCopy = deflateCopy;\nmodule.exports.deflateParams = deflateParams;\nmodule.exports.deflatePending = deflatePending;\nmodule.exports.deflatePrime = deflatePrime;\nmodule.exports.deflateTune = deflateTune;\n*/\n\nvar deflate_1$2 = {\n\tdeflateInit: deflateInit_1,\n\tdeflateInit2: deflateInit2_1,\n\tdeflateReset: deflateReset_1,\n\tdeflateResetKeep: deflateResetKeep_1,\n\tdeflateSetHeader: deflateSetHeader_1,\n\tdeflate: deflate_2$1,\n\tdeflateEnd: deflateEnd_1,\n\tdeflateSetDictionary: deflateSetDictionary_1,\n\tdeflateInfo: deflateInfo\n};\n\nconst _has = (obj, key) => {\n return Object.prototype.hasOwnProperty.call(obj, key);\n};\n\nvar assign = function (obj /*from1, from2, from3, ...*/) {\n const sources = Array.prototype.slice.call(arguments, 1);\n while (sources.length) {\n const source = sources.shift();\n if (!source) { continue; }\n\n if (typeof source !== 'object') {\n throw new TypeError(source + 'must be non-object');\n }\n\n for (const p in source) {\n if (_has(source, p)) {\n obj[p] = source[p];\n }\n }\n }\n\n return obj;\n};\n\n\n// Join array of chunks to single array.\nvar flattenChunks = (chunks) => {\n // calculate data length\n let len = 0;\n\n for (let i = 0, l = chunks.length; i < l; i++) {\n len += chunks[i].length;\n }\n\n // join chunks\n const result = new Uint8Array(len);\n\n for (let i = 0, pos = 0, l = chunks.length; i < l; i++) {\n let chunk = chunks[i];\n result.set(chunk, pos);\n pos += chunk.length;\n }\n\n return result;\n};\n\nvar common = {\n\tassign: assign,\n\tflattenChunks: flattenChunks\n};\n\n// String encode/decode helpers\n\n\n// Quick check if we can use fast array to bin string conversion\n//\n// - apply(Array) can fail on Android 2.2\n// - apply(Uint8Array) can fail on iOS 5.1 Safari\n//\nlet STR_APPLY_UIA_OK = true;\n\ntry { String.fromCharCode.apply(null, new Uint8Array(1)); } catch (__) { STR_APPLY_UIA_OK = false; }\n\n\n// Table with utf8 lengths (calculated by first byte of sequence)\n// Note, that 5 & 6-byte values and some 4-byte values can not be represented in JS,\n// because max possible codepoint is 0x10ffff\nconst _utf8len = new Uint8Array(256);\nfor (let q = 0; q < 256; q++) {\n _utf8len[q] = (q >= 252 ? 6 : q >= 248 ? 5 : q >= 240 ? 4 : q >= 224 ? 3 : q >= 192 ? 2 : 1);\n}\n_utf8len[254] = _utf8len[254] = 1; // Invalid sequence start\n\n\n// convert string to array (typed, when possible)\nvar string2buf = (str) => {\n if (typeof TextEncoder === 'function' && TextEncoder.prototype.encode) {\n return new TextEncoder().encode(str);\n }\n\n let buf, c, c2, m_pos, i, str_len = str.length, buf_len = 0;\n\n // count binary size\n for (m_pos = 0; m_pos < str_len; m_pos++) {\n c = str.charCodeAt(m_pos);\n if ((c & 0xfc00) === 0xd800 && (m_pos + 1 < str_len)) {\n c2 = str.charCodeAt(m_pos + 1);\n if ((c2 & 0xfc00) === 0xdc00) {\n c = 0x10000 + ((c - 0xd800) << 10) + (c2 - 0xdc00);\n m_pos++;\n }\n }\n buf_len += c < 0x80 ? 1 : c < 0x800 ? 2 : c < 0x10000 ? 3 : 4;\n }\n\n // allocate buffer\n buf = new Uint8Array(buf_len);\n\n // convert\n for (i = 0, m_pos = 0; i < buf_len; m_pos++) {\n c = str.charCodeAt(m_pos);\n if ((c & 0xfc00) === 0xd800 && (m_pos + 1 < str_len)) {\n c2 = str.charCodeAt(m_pos + 1);\n if ((c2 & 0xfc00) === 0xdc00) {\n c = 0x10000 + ((c - 0xd800) << 10) + (c2 - 0xdc00);\n m_pos++;\n }\n }\n if (c < 0x80) {\n /* one byte */\n buf[i++] = c;\n } else if (c < 0x800) {\n /* two bytes */\n buf[i++] = 0xC0 | (c >>> 6);\n buf[i++] = 0x80 | (c & 0x3f);\n } else if (c < 0x10000) {\n /* three bytes */\n buf[i++] = 0xE0 | (c >>> 12);\n buf[i++] = 0x80 | (c >>> 6 & 0x3f);\n buf[i++] = 0x80 | (c & 0x3f);\n } else {\n /* four bytes */\n buf[i++] = 0xf0 | (c >>> 18);\n buf[i++] = 0x80 | (c >>> 12 & 0x3f);\n buf[i++] = 0x80 | (c >>> 6 & 0x3f);\n buf[i++] = 0x80 | (c & 0x3f);\n }\n }\n\n return buf;\n};\n\n// Helper\nconst buf2binstring = (buf, len) => {\n // On Chrome, the arguments in a function call that are allowed is `65534`.\n // If the length of the buffer is smaller than that, we can use this optimization,\n // otherwise we will take a slower path.\n if (len < 65534) {\n if (buf.subarray && STR_APPLY_UIA_OK) {\n return String.fromCharCode.apply(null, buf.length === len ? buf : buf.subarray(0, len));\n }\n }\n\n let result = '';\n for (let i = 0; i < len; i++) {\n result += String.fromCharCode(buf[i]);\n }\n return result;\n};\n\n\n// convert array to string\nvar buf2string = (buf, max) => {\n const len = max || buf.length;\n\n if (typeof TextDecoder === 'function' && TextDecoder.prototype.decode) {\n return new TextDecoder().decode(buf.subarray(0, max));\n }\n\n let i, out;\n\n // Reserve max possible length (2 words per char)\n // NB: by unknown reasons, Array is significantly faster for\n // String.fromCharCode.apply than Uint16Array.\n const utf16buf = new Array(len * 2);\n\n for (out = 0, i = 0; i < len;) {\n let c = buf[i++];\n // quick process ascii\n if (c < 0x80) { utf16buf[out++] = c; continue; }\n\n let c_len = _utf8len[c];\n // skip 5 & 6 byte codes\n if (c_len > 4) { utf16buf[out++] = 0xfffd; i += c_len - 1; continue; }\n\n // apply mask on first byte\n c &= c_len === 2 ? 0x1f : c_len === 3 ? 0x0f : 0x07;\n // join the rest\n while (c_len > 1 && i < len) {\n c = (c << 6) | (buf[i++] & 0x3f);\n c_len--;\n }\n\n // terminated by end of string?\n if (c_len > 1) { utf16buf[out++] = 0xfffd; continue; }\n\n if (c < 0x10000) {\n utf16buf[out++] = c;\n } else {\n c -= 0x10000;\n utf16buf[out++] = 0xd800 | ((c >> 10) & 0x3ff);\n utf16buf[out++] = 0xdc00 | (c & 0x3ff);\n }\n }\n\n return buf2binstring(utf16buf, out);\n};\n\n\n// Calculate max possible position in utf8 buffer,\n// that will not break sequence. If that's not possible\n// - (very small limits) return max size as is.\n//\n// buf[] - utf8 bytes array\n// max - length limit (mandatory);\nvar utf8border = (buf, max) => {\n\n max = max || buf.length;\n if (max > buf.length) { max = buf.length; }\n\n // go back from last position, until start of sequence found\n let pos = max - 1;\n while (pos >= 0 && (buf[pos] & 0xC0) === 0x80) { pos--; }\n\n // Very small and broken sequence,\n // return max, because we should return something anyway.\n if (pos < 0) { return max; }\n\n // If we came to start of buffer - that means buffer is too small,\n // return max too.\n if (pos === 0) { return max; }\n\n return (pos + _utf8len[buf[pos]] > max) ? pos : max;\n};\n\nvar strings = {\n\tstring2buf: string2buf,\n\tbuf2string: buf2string,\n\tutf8border: utf8border\n};\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n// claim that you wrote the original software. If you use this software\n// in a product, an acknowledgment in the product documentation would be\n// appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n// misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nfunction ZStream() {\n /* next input byte */\n this.input = null; // JS specific, because we have no pointers\n this.next_in = 0;\n /* number of bytes available at input */\n this.avail_in = 0;\n /* total number of input bytes read so far */\n this.total_in = 0;\n /* next output byte should be put there */\n this.output = null; // JS specific, because we have no pointers\n this.next_out = 0;\n /* remaining free space at output */\n this.avail_out = 0;\n /* total number of bytes output so far */\n this.total_out = 0;\n /* last error message, NULL if no error */\n this.msg = ''/*Z_NULL*/;\n /* not visible by applications */\n this.state = null;\n /* best guess about the data type: binary or text */\n this.data_type = 2/*Z_UNKNOWN*/;\n /* adler32 value of the uncompressed data */\n this.adler = 0;\n}\n\nvar zstream = ZStream;\n\nconst toString$1 = Object.prototype.toString;\n\n/* Public constants ==========================================================*/\n/* ===========================================================================*/\n\nconst {\n Z_NO_FLUSH: Z_NO_FLUSH$1, Z_SYNC_FLUSH, Z_FULL_FLUSH, Z_FINISH: Z_FINISH$2,\n Z_OK: Z_OK$2, Z_STREAM_END: Z_STREAM_END$2,\n Z_DEFAULT_COMPRESSION,\n Z_DEFAULT_STRATEGY,\n Z_DEFLATED: Z_DEFLATED$1\n} = constants$2;\n\n/* ===========================================================================*/\n\n\n/**\n * class Deflate\n *\n * Generic JS-style wrapper for zlib calls. If you don't need\n * streaming behaviour - use more simple functions: [[deflate]],\n * [[deflateRaw]] and [[gzip]].\n **/\n\n/* internal\n * Deflate.chunks -> Array\n *\n * Chunks of output data, if [[Deflate#onData]] not overridden.\n **/\n\n/**\n * Deflate.result -> Uint8Array\n *\n * Compressed result, generated by default [[Deflate#onData]]\n * and [[Deflate#onEnd]] handlers. Filled after you push last chunk\n * (call [[Deflate#push]] with `Z_FINISH` / `true` param).\n **/\n\n/**\n * Deflate.err -> Number\n *\n * Error code after deflate finished. 0 (Z_OK) on success.\n * You will not need it in real life, because deflate errors\n * are possible only on wrong options or bad `onData` / `onEnd`\n * custom handlers.\n **/\n\n/**\n * Deflate.msg -> String\n *\n * Error message, if [[Deflate.err]] != 0\n **/\n\n\n/**\n * new Deflate(options)\n * - options (Object): zlib deflate options.\n *\n * Creates new deflator instance with specified params. Throws exception\n * on bad params. Supported options:\n *\n * - `level`\n * - `windowBits`\n * - `memLevel`\n * - `strategy`\n * - `dictionary`\n *\n * [http://zlib.net/manual.html#Advanced](http://zlib.net/manual.html#Advanced)\n * for more information on these.\n *\n * Additional options, for internal needs:\n *\n * - `chunkSize` - size of generated data chunks (16K by default)\n * - `raw` (Boolean) - do raw deflate\n * - `gzip` (Boolean) - create gzip wrapper\n * - `header` (Object) - custom header for gzip\n * - `text` (Boolean) - true if compressed data believed to be text\n * - `time` (Number) - modification time, unix timestamp\n * - `os` (Number) - operation system code\n * - `extra` (Array) - array of bytes with extra data (max 65536)\n * - `name` (String) - file name (binary string)\n * - `comment` (String) - comment (binary string)\n * - `hcrc` (Boolean) - true if header crc should be added\n *\n * ##### Example:\n *\n * ```javascript\n * const pako = require('pako')\n * , chunk1 = new Uint8Array([1,2,3,4,5,6,7,8,9])\n * , chunk2 = new Uint8Array([10,11,12,13,14,15,16,17,18,19]);\n *\n * const deflate = new pako.Deflate({ level: 3});\n *\n * deflate.push(chunk1, false);\n * deflate.push(chunk2, true); // true -> last chunk\n *\n * if (deflate.err) { throw new Error(deflate.err); }\n *\n * console.log(deflate.result);\n * ```\n **/\nfunction Deflate$1(options) {\n this.options = common.assign({\n level: Z_DEFAULT_COMPRESSION,\n method: Z_DEFLATED$1,\n chunkSize: 16384,\n windowBits: 15,\n memLevel: 8,\n strategy: Z_DEFAULT_STRATEGY\n }, options || {});\n\n let opt = this.options;\n\n if (opt.raw && (opt.windowBits > 0)) {\n opt.windowBits = -opt.windowBits;\n }\n\n else if (opt.gzip && (opt.windowBits > 0) && (opt.windowBits < 16)) {\n opt.windowBits += 16;\n }\n\n this.err = 0; // error code, if happens (0 = Z_OK)\n this.msg = ''; // error message\n this.ended = false; // used to avoid multiple onEnd() calls\n this.chunks = []; // chunks of compressed data\n\n this.strm = new zstream();\n this.strm.avail_out = 0;\n\n let status = deflate_1$2.deflateInit2(\n this.strm,\n opt.level,\n opt.method,\n opt.windowBits,\n opt.memLevel,\n opt.strategy\n );\n\n if (status !== Z_OK$2) {\n throw new Error(messages[status]);\n }\n\n if (opt.header) {\n deflate_1$2.deflateSetHeader(this.strm, opt.header);\n }\n\n if (opt.dictionary) {\n let dict;\n // Convert data if needed\n if (typeof opt.dictionary === 'string') {\n // If we need to compress text, change encoding to utf8.\n dict = strings.string2buf(opt.dictionary);\n } else if (toString$1.call(opt.dictionary) === '[object ArrayBuffer]') {\n dict = new Uint8Array(opt.dictionary);\n } else {\n dict = opt.dictionary;\n }\n\n status = deflate_1$2.deflateSetDictionary(this.strm, dict);\n\n if (status !== Z_OK$2) {\n throw new Error(messages[status]);\n }\n\n this._dict_set = true;\n }\n}\n\n/**\n * Deflate#push(data[, flush_mode]) -> Boolean\n * - data (Uint8Array|ArrayBuffer|String): input data. Strings will be\n * converted to utf8 byte sequence.\n * - flush_mode (Number|Boolean): 0..6 for corresponding Z_NO_FLUSH..Z_TREE modes.\n * See constants. Skipped or `false` means Z_NO_FLUSH, `true` means Z_FINISH.\n *\n * Sends input data to deflate pipe, generating [[Deflate#onData]] calls with\n * new compressed chunks. Returns `true` on success. The last data block must\n * have `flush_mode` Z_FINISH (or `true`). That will flush internal pending\n * buffers and call [[Deflate#onEnd]].\n *\n * On fail call [[Deflate#onEnd]] with error code and return false.\n *\n * ##### Example\n *\n * ```javascript\n * push(chunk, false); // push one of data chunks\n * ...\n * push(chunk, true); // push last chunk\n * ```\n **/\nDeflate$1.prototype.push = function (data, flush_mode) {\n const strm = this.strm;\n const chunkSize = this.options.chunkSize;\n let status, _flush_mode;\n\n if (this.ended) { return false; }\n\n if (flush_mode === ~~flush_mode) _flush_mode = flush_mode;\n else _flush_mode = flush_mode === true ? Z_FINISH$2 : Z_NO_FLUSH$1;\n\n // Convert data if needed\n if (typeof data === 'string') {\n // If we need to compress text, change encoding to utf8.\n strm.input = strings.string2buf(data);\n } else if (toString$1.call(data) === '[object ArrayBuffer]') {\n strm.input = new Uint8Array(data);\n } else {\n strm.input = data;\n }\n\n strm.next_in = 0;\n strm.avail_in = strm.input.length;\n\n for (;;) {\n if (strm.avail_out === 0) {\n strm.output = new Uint8Array(chunkSize);\n strm.next_out = 0;\n strm.avail_out = chunkSize;\n }\n\n // Make sure avail_out > 6 to avoid repeating markers\n if ((_flush_mode === Z_SYNC_FLUSH || _flush_mode === Z_FULL_FLUSH) && strm.avail_out <= 6) {\n this.onData(strm.output.subarray(0, strm.next_out));\n strm.avail_out = 0;\n continue;\n }\n\n status = deflate_1$2.deflate(strm, _flush_mode);\n\n // Ended => flush and finish\n if (status === Z_STREAM_END$2) {\n if (strm.next_out > 0) {\n this.onData(strm.output.subarray(0, strm.next_out));\n }\n status = deflate_1$2.deflateEnd(this.strm);\n this.onEnd(status);\n this.ended = true;\n return status === Z_OK$2;\n }\n\n // Flush if out buffer full\n if (strm.avail_out === 0) {\n this.onData(strm.output);\n continue;\n }\n\n // Flush if requested and has data\n if (_flush_mode > 0 && strm.next_out > 0) {\n this.onData(strm.output.subarray(0, strm.next_out));\n strm.avail_out = 0;\n continue;\n }\n\n if (strm.avail_in === 0) break;\n }\n\n return true;\n};\n\n\n/**\n * Deflate#onData(chunk) -> Void\n * - chunk (Uint8Array): output data.\n *\n * By default, stores data blocks in `chunks[]` property and glue\n * those in `onEnd`. Override this handler, if you need another behaviour.\n **/\nDeflate$1.prototype.onData = function (chunk) {\n this.chunks.push(chunk);\n};\n\n\n/**\n * Deflate#onEnd(status) -> Void\n * - status (Number): deflate status. 0 (Z_OK) on success,\n * other if not.\n *\n * Called once after you tell deflate that the input stream is\n * complete (Z_FINISH). By default - join collected chunks,\n * free memory and fill `results` / `err` properties.\n **/\nDeflate$1.prototype.onEnd = function (status) {\n // On success - join\n if (status === Z_OK$2) {\n this.result = common.flattenChunks(this.chunks);\n }\n this.chunks = [];\n this.err = status;\n this.msg = this.strm.msg;\n};\n\n\n/**\n * deflate(data[, options]) -> Uint8Array\n * - data (Uint8Array|String): input data to compress.\n * - options (Object): zlib deflate options.\n *\n * Compress `data` with deflate algorithm and `options`.\n *\n * Supported options are:\n *\n * - level\n * - windowBits\n * - memLevel\n * - strategy\n * - dictionary\n *\n * [http://zlib.net/manual.html#Advanced](http://zlib.net/manual.html#Advanced)\n * for more information on these.\n *\n * Sugar (options):\n *\n * - `raw` (Boolean) - say that we work with raw stream, if you don't wish to specify\n * negative windowBits implicitly.\n *\n * ##### Example:\n *\n * ```javascript\n * const pako = require('pako')\n * const data = new Uint8Array([1,2,3,4,5,6,7,8,9]);\n *\n * console.log(pako.deflate(data));\n * ```\n **/\nfunction deflate$1(input, options) {\n const deflator = new Deflate$1(options);\n\n deflator.push(input, true);\n\n // That will never happens, if you don't cheat with options :)\n if (deflator.err) { throw deflator.msg || messages[deflator.err]; }\n\n return deflator.result;\n}\n\n\n/**\n * deflateRaw(data[, options]) -> Uint8Array\n * - data (Uint8Array|String): input data to compress.\n * - options (Object): zlib deflate options.\n *\n * The same as [[deflate]], but creates raw data, without wrapper\n * (header and adler32 crc).\n **/\nfunction deflateRaw$1(input, options) {\n options = options || {};\n options.raw = true;\n return deflate$1(input, options);\n}\n\n\n/**\n * gzip(data[, options]) -> Uint8Array\n * - data (Uint8Array|String): input data to compress.\n * - options (Object): zlib deflate options.\n *\n * The same as [[deflate]], but create gzip wrapper instead of\n * deflate one.\n **/\nfunction gzip$1(input, options) {\n options = options || {};\n options.gzip = true;\n return deflate$1(input, options);\n}\n\n\nvar Deflate_1$1 = Deflate$1;\nvar deflate_2 = deflate$1;\nvar deflateRaw_1$1 = deflateRaw$1;\nvar gzip_1$1 = gzip$1;\nvar constants$1 = constants$2;\n\nvar deflate_1$1 = {\n\tDeflate: Deflate_1$1,\n\tdeflate: deflate_2,\n\tdeflateRaw: deflateRaw_1$1,\n\tgzip: gzip_1$1,\n\tconstants: constants$1\n};\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n// claim that you wrote the original software. If you use this software\n// in a product, an acknowledgment in the product documentation would be\n// appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n// misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\n// See state defs from inflate.js\nconst BAD$1 = 30; /* got a data error -- remain here until reset */\nconst TYPE$1 = 12; /* i: waiting for type bits, including last-flag bit */\n\n/*\n Decode literal, length, and distance codes and write out the resulting\n literal and match bytes until either not enough input or output is\n available, an end-of-block is encountered, or a data error is encountered.\n When large enough input and output buffers are supplied to inflate(), for\n example, a 16K input buffer and a 64K output buffer, more than 95% of the\n inflate execution time is spent in this routine.\n\n Entry assumptions:\n\n state.mode === LEN\n strm.avail_in >= 6\n strm.avail_out >= 258\n start >= strm.avail_out\n state.bits < 8\n\n On return, state.mode is one of:\n\n LEN -- ran out of enough output space or enough available input\n TYPE -- reached end of block code, inflate() to interpret next block\n BAD -- error in block data\n\n Notes:\n\n - The maximum input bits used by a length/distance pair is 15 bits for the\n length code, 5 bits for the length extra, 15 bits for the distance code,\n and 13 bits for the distance extra. This totals 48 bits, or six bytes.\n Therefore if strm.avail_in >= 6, then there is enough input to avoid\n checking for available input while decoding.\n\n - The maximum bytes that a single length/distance pair can output is 258\n bytes, which is the maximum length that can be coded. inflate_fast()\n requires strm.avail_out >= 258 for each loop to avoid checking for\n output space.\n */\nvar inffast = function inflate_fast(strm, start) {\n let _in; /* local strm.input */\n let last; /* have enough input while in < last */\n let _out; /* local strm.output */\n let beg; /* inflate()'s initial strm.output */\n let end; /* while out < end, enough space available */\n//#ifdef INFLATE_STRICT\n let dmax; /* maximum distance from zlib header */\n//#endif\n let wsize; /* window size or zero if not using window */\n let whave; /* valid bytes in the window */\n let wnext; /* window write index */\n // Use `s_window` instead `window`, avoid conflict with instrumentation tools\n let s_window; /* allocated sliding window, if wsize != 0 */\n let hold; /* local strm.hold */\n let bits; /* local strm.bits */\n let lcode; /* local strm.lencode */\n let dcode; /* local strm.distcode */\n let lmask; /* mask for first level of length codes */\n let dmask; /* mask for first level of distance codes */\n let here; /* retrieved table entry */\n let op; /* code bits, operation, extra bits, or */\n /* window position, window bytes to copy */\n let len; /* match length, unused bytes */\n let dist; /* match distance */\n let from; /* where to copy match from */\n let from_source;\n\n\n let input, output; // JS specific, because we have no pointers\n\n /* copy state to local variables */\n const state = strm.state;\n //here = state.here;\n _in = strm.next_in;\n input = strm.input;\n last = _in + (strm.avail_in - 5);\n _out = strm.next_out;\n output = strm.output;\n beg = _out - (start - strm.avail_out);\n end = _out + (strm.avail_out - 257);\n//#ifdef INFLATE_STRICT\n dmax = state.dmax;\n//#endif\n wsize = state.wsize;\n whave = state.whave;\n wnext = state.wnext;\n s_window = state.window;\n hold = state.hold;\n bits = state.bits;\n lcode = state.lencode;\n dcode = state.distcode;\n lmask = (1 << state.lenbits) - 1;\n dmask = (1 << state.distbits) - 1;\n\n\n /* decode literals and length/distances until end-of-block or not enough\n input data or output space */\n\n top:\n do {\n if (bits < 15) {\n hold += input[_in++] << bits;\n bits += 8;\n hold += input[_in++] << bits;\n bits += 8;\n }\n\n here = lcode[hold & lmask];\n\n dolen:\n for (;;) { // Goto emulation\n op = here >>> 24/*here.bits*/;\n hold >>>= op;\n bits -= op;\n op = (here >>> 16) & 0xff/*here.op*/;\n if (op === 0) { /* literal */\n //Tracevv((stderr, here.val >= 0x20 && here.val < 0x7f ?\n // \"inflate: literal '%c'\\n\" :\n // \"inflate: literal 0x%02x\\n\", here.val));\n output[_out++] = here & 0xffff/*here.val*/;\n }\n else if (op & 16) { /* length base */\n len = here & 0xffff/*here.val*/;\n op &= 15; /* number of extra bits */\n if (op) {\n if (bits < op) {\n hold += input[_in++] << bits;\n bits += 8;\n }\n len += hold & ((1 << op) - 1);\n hold >>>= op;\n bits -= op;\n }\n //Tracevv((stderr, \"inflate: length %u\\n\", len));\n if (bits < 15) {\n hold += input[_in++] << bits;\n bits += 8;\n hold += input[_in++] << bits;\n bits += 8;\n }\n here = dcode[hold & dmask];\n\n dodist:\n for (;;) { // goto emulation\n op = here >>> 24/*here.bits*/;\n hold >>>= op;\n bits -= op;\n op = (here >>> 16) & 0xff/*here.op*/;\n\n if (op & 16) { /* distance base */\n dist = here & 0xffff/*here.val*/;\n op &= 15; /* number of extra bits */\n if (bits < op) {\n hold += input[_in++] << bits;\n bits += 8;\n if (bits < op) {\n hold += input[_in++] << bits;\n bits += 8;\n }\n }\n dist += hold & ((1 << op) - 1);\n//#ifdef INFLATE_STRICT\n if (dist > dmax) {\n strm.msg = 'invalid distance too far back';\n state.mode = BAD$1;\n break top;\n }\n//#endif\n hold >>>= op;\n bits -= op;\n //Tracevv((stderr, \"inflate: distance %u\\n\", dist));\n op = _out - beg; /* max distance in output */\n if (dist > op) { /* see if copy from window */\n op = dist - op; /* distance back in window */\n if (op > whave) {\n if (state.sane) {\n strm.msg = 'invalid distance too far back';\n state.mode = BAD$1;\n break top;\n }\n\n// (!) This block is disabled in zlib defaults,\n// don't enable it for binary compatibility\n//#ifdef INFLATE_ALLOW_INVALID_DISTANCE_TOOFAR_ARRR\n// if (len <= op - whave) {\n// do {\n// output[_out++] = 0;\n// } while (--len);\n// continue top;\n// }\n// len -= op - whave;\n// do {\n// output[_out++] = 0;\n// } while (--op > whave);\n// if (op === 0) {\n// from = _out - dist;\n// do {\n// output[_out++] = output[from++];\n// } while (--len);\n// continue top;\n// }\n//#endif\n }\n from = 0; // window index\n from_source = s_window;\n if (wnext === 0) { /* very common case */\n from += wsize - op;\n if (op < len) { /* some from window */\n len -= op;\n do {\n output[_out++] = s_window[from++];\n } while (--op);\n from = _out - dist; /* rest from output */\n from_source = output;\n }\n }\n else if (wnext < op) { /* wrap around window */\n from += wsize + wnext - op;\n op -= wnext;\n if (op < len) { /* some from end of window */\n len -= op;\n do {\n output[_out++] = s_window[from++];\n } while (--op);\n from = 0;\n if (wnext < len) { /* some from start of window */\n op = wnext;\n len -= op;\n do {\n output[_out++] = s_window[from++];\n } while (--op);\n from = _out - dist; /* rest from output */\n from_source = output;\n }\n }\n }\n else { /* contiguous in window */\n from += wnext - op;\n if (op < len) { /* some from window */\n len -= op;\n do {\n output[_out++] = s_window[from++];\n } while (--op);\n from = _out - dist; /* rest from output */\n from_source = output;\n }\n }\n while (len > 2) {\n output[_out++] = from_source[from++];\n output[_out++] = from_source[from++];\n output[_out++] = from_source[from++];\n len -= 3;\n }\n if (len) {\n output[_out++] = from_source[from++];\n if (len > 1) {\n output[_out++] = from_source[from++];\n }\n }\n }\n else {\n from = _out - dist; /* copy direct from output */\n do { /* minimum length is three */\n output[_out++] = output[from++];\n output[_out++] = output[from++];\n output[_out++] = output[from++];\n len -= 3;\n } while (len > 2);\n if (len) {\n output[_out++] = output[from++];\n if (len > 1) {\n output[_out++] = output[from++];\n }\n }\n }\n }\n else if ((op & 64) === 0) { /* 2nd level distance code */\n here = dcode[(here & 0xffff)/*here.val*/ + (hold & ((1 << op) - 1))];\n continue dodist;\n }\n else {\n strm.msg = 'invalid distance code';\n state.mode = BAD$1;\n break top;\n }\n\n break; // need to emulate goto via \"continue\"\n }\n }\n else if ((op & 64) === 0) { /* 2nd level length code */\n here = lcode[(here & 0xffff)/*here.val*/ + (hold & ((1 << op) - 1))];\n continue dolen;\n }\n else if (op & 32) { /* end-of-block */\n //Tracevv((stderr, \"inflate: end of block\\n\"));\n state.mode = TYPE$1;\n break top;\n }\n else {\n strm.msg = 'invalid literal/length code';\n state.mode = BAD$1;\n break top;\n }\n\n break; // need to emulate goto via \"continue\"\n }\n } while (_in < last && _out < end);\n\n /* return unused bytes (on entry, bits < 8, so in won't go too far back) */\n len = bits >> 3;\n _in -= len;\n bits -= len << 3;\n hold &= (1 << bits) - 1;\n\n /* update state and return */\n strm.next_in = _in;\n strm.next_out = _out;\n strm.avail_in = (_in < last ? 5 + (last - _in) : 5 - (_in - last));\n strm.avail_out = (_out < end ? 257 + (end - _out) : 257 - (_out - end));\n state.hold = hold;\n state.bits = bits;\n return;\n};\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n// claim that you wrote the original software. If you use this software\n// in a product, an acknowledgment in the product documentation would be\n// appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n// misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nconst MAXBITS = 15;\nconst ENOUGH_LENS$1 = 852;\nconst ENOUGH_DISTS$1 = 592;\n//const ENOUGH = (ENOUGH_LENS+ENOUGH_DISTS);\n\nconst CODES$1 = 0;\nconst LENS$1 = 1;\nconst DISTS$1 = 2;\n\nconst lbase = new Uint16Array([ /* Length codes 257..285 base */\n 3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 15, 17, 19, 23, 27, 31,\n 35, 43, 51, 59, 67, 83, 99, 115, 131, 163, 195, 227, 258, 0, 0\n]);\n\nconst lext = new Uint8Array([ /* Length codes 257..285 extra */\n 16, 16, 16, 16, 16, 16, 16, 16, 17, 17, 17, 17, 18, 18, 18, 18,\n 19, 19, 19, 19, 20, 20, 20, 20, 21, 21, 21, 21, 16, 72, 78\n]);\n\nconst dbase = new Uint16Array([ /* Distance codes 0..29 base */\n 1, 2, 3, 4, 5, 7, 9, 13, 17, 25, 33, 49, 65, 97, 129, 193,\n 257, 385, 513, 769, 1025, 1537, 2049, 3073, 4097, 6145,\n 8193, 12289, 16385, 24577, 0, 0\n]);\n\nconst dext = new Uint8Array([ /* Distance codes 0..29 extra */\n 16, 16, 16, 16, 17, 17, 18, 18, 19, 19, 20, 20, 21, 21, 22, 22,\n 23, 23, 24, 24, 25, 25, 26, 26, 27, 27,\n 28, 28, 29, 29, 64, 64\n]);\n\nconst inflate_table = (type, lens, lens_index, codes, table, table_index, work, opts) =>\n{\n const bits = opts.bits;\n //here = opts.here; /* table entry for duplication */\n\n let len = 0; /* a code's length in bits */\n let sym = 0; /* index of code symbols */\n let min = 0, max = 0; /* minimum and maximum code lengths */\n let root = 0; /* number of index bits for root table */\n let curr = 0; /* number of index bits for current table */\n let drop = 0; /* code bits to drop for sub-table */\n let left = 0; /* number of prefix codes available */\n let used = 0; /* code entries in table used */\n let huff = 0; /* Huffman code */\n let incr; /* for incrementing code, index */\n let fill; /* index for replicating entries */\n let low; /* low bits for current root entry */\n let mask; /* mask for low root bits */\n let next; /* next available space in table */\n let base = null; /* base value table to use */\n let base_index = 0;\n// let shoextra; /* extra bits table to use */\n let end; /* use base and extra for symbol > end */\n const count = new Uint16Array(MAXBITS + 1); //[MAXBITS+1]; /* number of codes of each length */\n const offs = new Uint16Array(MAXBITS + 1); //[MAXBITS+1]; /* offsets in table for each length */\n let extra = null;\n let extra_index = 0;\n\n let here_bits, here_op, here_val;\n\n /*\n Process a set of code lengths to create a canonical Huffman code. The\n code lengths are lens[0..codes-1]. Each length corresponds to the\n symbols 0..codes-1. The Huffman code is generated by first sorting the\n symbols by length from short to long, and retaining the symbol order\n for codes with equal lengths. Then the code starts with all zero bits\n for the first code of the shortest length, and the codes are integer\n increments for the same length, and zeros are appended as the length\n increases. For the deflate format, these bits are stored backwards\n from their more natural integer increment ordering, and so when the\n decoding tables are built in the large loop below, the integer codes\n are incremented backwards.\n\n This routine assumes, but does not check, that all of the entries in\n lens[] are in the range 0..MAXBITS. The caller must assure this.\n 1..MAXBITS is interpreted as that code length. zero means that that\n symbol does not occur in this code.\n\n The codes are sorted by computing a count of codes for each length,\n creating from that a table of starting indices for each length in the\n sorted table, and then entering the symbols in order in the sorted\n table. The sorted table is work[], with that space being provided by\n the caller.\n\n The length counts are used for other purposes as well, i.e. finding\n the minimum and maximum length codes, determining if there are any\n codes at all, checking for a valid set of lengths, and looking ahead\n at length counts to determine sub-table sizes when building the\n decoding tables.\n */\n\n /* accumulate lengths for codes (assumes lens[] all in 0..MAXBITS) */\n for (len = 0; len <= MAXBITS; len++) {\n count[len] = 0;\n }\n for (sym = 0; sym < codes; sym++) {\n count[lens[lens_index + sym]]++;\n }\n\n /* bound code lengths, force root to be within code lengths */\n root = bits;\n for (max = MAXBITS; max >= 1; max--) {\n if (count[max] !== 0) { break; }\n }\n if (root > max) {\n root = max;\n }\n if (max === 0) { /* no symbols to code at all */\n //table.op[opts.table_index] = 64; //here.op = (var char)64; /* invalid code marker */\n //table.bits[opts.table_index] = 1; //here.bits = (var char)1;\n //table.val[opts.table_index++] = 0; //here.val = (var short)0;\n table[table_index++] = (1 << 24) | (64 << 16) | 0;\n\n\n //table.op[opts.table_index] = 64;\n //table.bits[opts.table_index] = 1;\n //table.val[opts.table_index++] = 0;\n table[table_index++] = (1 << 24) | (64 << 16) | 0;\n\n opts.bits = 1;\n return 0; /* no symbols, but wait for decoding to report error */\n }\n for (min = 1; min < max; min++) {\n if (count[min] !== 0) { break; }\n }\n if (root < min) {\n root = min;\n }\n\n /* check for an over-subscribed or incomplete set of lengths */\n left = 1;\n for (len = 1; len <= MAXBITS; len++) {\n left <<= 1;\n left -= count[len];\n if (left < 0) {\n return -1;\n } /* over-subscribed */\n }\n if (left > 0 && (type === CODES$1 || max !== 1)) {\n return -1; /* incomplete set */\n }\n\n /* generate offsets into symbol table for each length for sorting */\n offs[1] = 0;\n for (len = 1; len < MAXBITS; len++) {\n offs[len + 1] = offs[len] + count[len];\n }\n\n /* sort symbols by length, by symbol order within each length */\n for (sym = 0; sym < codes; sym++) {\n if (lens[lens_index + sym] !== 0) {\n work[offs[lens[lens_index + sym]]++] = sym;\n }\n }\n\n /*\n Create and fill in decoding tables. In this loop, the table being\n filled is at next and has curr index bits. The code being used is huff\n with length len. That code is converted to an index by dropping drop\n bits off of the bottom. For codes where len is less than drop + curr,\n those top drop + curr - len bits are incremented through all values to\n fill the table with replicated entries.\n\n root is the number of index bits for the root table. When len exceeds\n root, sub-tables are created pointed to by the root entry with an index\n of the low root bits of huff. This is saved in low to check for when a\n new sub-table should be started. drop is zero when the root table is\n being filled, and drop is root when sub-tables are being filled.\n\n When a new sub-table is needed, it is necessary to look ahead in the\n code lengths to determine what size sub-table is needed. The length\n counts are used for this, and so count[] is decremented as codes are\n entered in the tables.\n\n used keeps track of how many table entries have been allocated from the\n provided *table space. It is checked for LENS and DIST tables against\n the constants ENOUGH_LENS and ENOUGH_DISTS to guard against changes in\n the initial root table size constants. See the comments in inftrees.h\n for more information.\n\n sym increments through all symbols, and the loop terminates when\n all codes of length max, i.e. all codes, have been processed. This\n routine permits incomplete codes, so another loop after this one fills\n in the rest of the decoding tables with invalid code markers.\n */\n\n /* set up for code type */\n // poor man optimization - use if-else instead of switch,\n // to avoid deopts in old v8\n if (type === CODES$1) {\n base = extra = work; /* dummy value--not used */\n end = 19;\n\n } else if (type === LENS$1) {\n base = lbase;\n base_index -= 257;\n extra = lext;\n extra_index -= 257;\n end = 256;\n\n } else { /* DISTS */\n base = dbase;\n extra = dext;\n end = -1;\n }\n\n /* initialize opts for loop */\n huff = 0; /* starting code */\n sym = 0; /* starting code symbol */\n len = min; /* starting code length */\n next = table_index; /* current table to fill in */\n curr = root; /* current table index bits */\n drop = 0; /* current bits to drop from code for index */\n low = -1; /* trigger new sub-table when len > root */\n used = 1 << root; /* use root table entries */\n mask = used - 1; /* mask for comparing low */\n\n /* check available table space */\n if ((type === LENS$1 && used > ENOUGH_LENS$1) ||\n (type === DISTS$1 && used > ENOUGH_DISTS$1)) {\n return 1;\n }\n\n /* process all codes and make table entries */\n for (;;) {\n /* create table entry */\n here_bits = len - drop;\n if (work[sym] < end) {\n here_op = 0;\n here_val = work[sym];\n }\n else if (work[sym] > end) {\n here_op = extra[extra_index + work[sym]];\n here_val = base[base_index + work[sym]];\n }\n else {\n here_op = 32 + 64; /* end of block */\n here_val = 0;\n }\n\n /* replicate for those indices with low len bits equal to huff */\n incr = 1 << (len - drop);\n fill = 1 << curr;\n min = fill; /* save offset to next table */\n do {\n fill -= incr;\n table[next + (huff >> drop) + fill] = (here_bits << 24) | (here_op << 16) | here_val |0;\n } while (fill !== 0);\n\n /* backwards increment the len-bit code huff */\n incr = 1 << (len - 1);\n while (huff & incr) {\n incr >>= 1;\n }\n if (incr !== 0) {\n huff &= incr - 1;\n huff += incr;\n } else {\n huff = 0;\n }\n\n /* go to next symbol, update count, len */\n sym++;\n if (--count[len] === 0) {\n if (len === max) { break; }\n len = lens[lens_index + work[sym]];\n }\n\n /* create new sub-table if needed */\n if (len > root && (huff & mask) !== low) {\n /* if first time, transition to sub-tables */\n if (drop === 0) {\n drop = root;\n }\n\n /* increment past last table */\n next += min; /* here min is 1 << curr */\n\n /* determine length of next table */\n curr = len - drop;\n left = 1 << curr;\n while (curr + drop < max) {\n left -= count[curr + drop];\n if (left <= 0) { break; }\n curr++;\n left <<= 1;\n }\n\n /* check for enough space */\n used += 1 << curr;\n if ((type === LENS$1 && used > ENOUGH_LENS$1) ||\n (type === DISTS$1 && used > ENOUGH_DISTS$1)) {\n return 1;\n }\n\n /* point entry in root table to sub-table */\n low = huff & mask;\n /*table.op[low] = curr;\n table.bits[low] = root;\n table.val[low] = next - opts.table_index;*/\n table[low] = (root << 24) | (curr << 16) | (next - table_index) |0;\n }\n }\n\n /* fill in remaining table entry if code is incomplete (guaranteed to have\n at most one remaining entry, since if the code is incomplete, the\n maximum code length that was allowed to get this far is one bit) */\n if (huff !== 0) {\n //table.op[next + huff] = 64; /* invalid code marker */\n //table.bits[next + huff] = len - drop;\n //table.val[next + huff] = 0;\n table[next + huff] = ((len - drop) << 24) | (64 << 16) |0;\n }\n\n /* set return parameters */\n //opts.table_index += used;\n opts.bits = root;\n return 0;\n};\n\n\nvar inftrees = inflate_table;\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n// claim that you wrote the original software. If you use this software\n// in a product, an acknowledgment in the product documentation would be\n// appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n// misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\n\n\n\n\n\nconst CODES = 0;\nconst LENS = 1;\nconst DISTS = 2;\n\n/* Public constants ==========================================================*/\n/* ===========================================================================*/\n\nconst {\n Z_FINISH: Z_FINISH$1, Z_BLOCK, Z_TREES,\n Z_OK: Z_OK$1, Z_STREAM_END: Z_STREAM_END$1, Z_NEED_DICT: Z_NEED_DICT$1, Z_STREAM_ERROR: Z_STREAM_ERROR$1, Z_DATA_ERROR: Z_DATA_ERROR$1, Z_MEM_ERROR: Z_MEM_ERROR$1, Z_BUF_ERROR,\n Z_DEFLATED\n} = constants$2;\n\n\n/* STATES ====================================================================*/\n/* ===========================================================================*/\n\n\nconst HEAD = 1; /* i: waiting for magic header */\nconst FLAGS = 2; /* i: waiting for method and flags (gzip) */\nconst TIME = 3; /* i: waiting for modification time (gzip) */\nconst OS = 4; /* i: waiting for extra flags and operating system (gzip) */\nconst EXLEN = 5; /* i: waiting for extra length (gzip) */\nconst EXTRA = 6; /* i: waiting for extra bytes (gzip) */\nconst NAME = 7; /* i: waiting for end of file name (gzip) */\nconst COMMENT = 8; /* i: waiting for end of comment (gzip) */\nconst HCRC = 9; /* i: waiting for header crc (gzip) */\nconst DICTID = 10; /* i: waiting for dictionary check value */\nconst DICT = 11; /* waiting for inflateSetDictionary() call */\nconst TYPE = 12; /* i: waiting for type bits, including last-flag bit */\nconst TYPEDO = 13; /* i: same, but skip check to exit inflate on new block */\nconst STORED = 14; /* i: waiting for stored size (length and complement) */\nconst COPY_ = 15; /* i/o: same as COPY below, but only first time in */\nconst COPY = 16; /* i/o: waiting for input or output to copy stored block */\nconst TABLE = 17; /* i: waiting for dynamic block table lengths */\nconst LENLENS = 18; /* i: waiting for code length code lengths */\nconst CODELENS = 19; /* i: waiting for length/lit and distance code lengths */\nconst LEN_ = 20; /* i: same as LEN below, but only first time in */\nconst LEN = 21; /* i: waiting for length/lit/eob code */\nconst LENEXT = 22; /* i: waiting for length extra bits */\nconst DIST = 23; /* i: waiting for distance code */\nconst DISTEXT = 24; /* i: waiting for distance extra bits */\nconst MATCH = 25; /* o: waiting for output space to copy string */\nconst LIT = 26; /* o: waiting for output space to write literal */\nconst CHECK = 27; /* i: waiting for 32-bit check value */\nconst LENGTH = 28; /* i: waiting for 32-bit length (gzip) */\nconst DONE = 29; /* finished check, done -- remain here until reset */\nconst BAD = 30; /* got a data error -- remain here until reset */\nconst MEM = 31; /* got an inflate() memory error -- remain here until reset */\nconst SYNC = 32; /* looking for synchronization bytes to restart inflate() */\n\n/* ===========================================================================*/\n\n\n\nconst ENOUGH_LENS = 852;\nconst ENOUGH_DISTS = 592;\n//const ENOUGH = (ENOUGH_LENS+ENOUGH_DISTS);\n\nconst MAX_WBITS = 15;\n/* 32K LZ77 window */\nconst DEF_WBITS = MAX_WBITS;\n\n\nconst zswap32 = (q) => {\n\n return (((q >>> 24) & 0xff) +\n ((q >>> 8) & 0xff00) +\n ((q & 0xff00) << 8) +\n ((q & 0xff) << 24));\n};\n\n\nfunction InflateState() {\n this.mode = 0; /* current inflate mode */\n this.last = false; /* true if processing last block */\n this.wrap = 0; /* bit 0 true for zlib, bit 1 true for gzip */\n this.havedict = false; /* true if dictionary provided */\n this.flags = 0; /* gzip header method and flags (0 if zlib) */\n this.dmax = 0; /* zlib header max distance (INFLATE_STRICT) */\n this.check = 0; /* protected copy of check value */\n this.total = 0; /* protected copy of output count */\n // TODO: may be {}\n this.head = null; /* where to save gzip header information */\n\n /* sliding window */\n this.wbits = 0; /* log base 2 of requested window size */\n this.wsize = 0; /* window size or zero if not using window */\n this.whave = 0; /* valid bytes in the window */\n this.wnext = 0; /* window write index */\n this.window = null; /* allocated sliding window, if needed */\n\n /* bit accumulator */\n this.hold = 0; /* input bit accumulator */\n this.bits = 0; /* number of bits in \"in\" */\n\n /* for string and stored block copying */\n this.length = 0; /* literal or length of data to copy */\n this.offset = 0; /* distance back to copy string from */\n\n /* for table and code decoding */\n this.extra = 0; /* extra bits needed */\n\n /* fixed and dynamic code tables */\n this.lencode = null; /* starting table for length/literal codes */\n this.distcode = null; /* starting table for distance codes */\n this.lenbits = 0; /* index bits for lencode */\n this.distbits = 0; /* index bits for distcode */\n\n /* dynamic table building */\n this.ncode = 0; /* number of code length code lengths */\n this.nlen = 0; /* number of length code lengths */\n this.ndist = 0; /* number of distance code lengths */\n this.have = 0; /* number of code lengths in lens[] */\n this.next = null; /* next available space in codes[] */\n\n this.lens = new Uint16Array(320); /* temporary storage for code lengths */\n this.work = new Uint16Array(288); /* work area for code table building */\n\n /*\n because we don't have pointers in js, we use lencode and distcode directly\n as buffers so we don't need codes\n */\n //this.codes = new Int32Array(ENOUGH); /* space for code tables */\n this.lendyn = null; /* dynamic table for length/literal codes (JS specific) */\n this.distdyn = null; /* dynamic table for distance codes (JS specific) */\n this.sane = 0; /* if false, allow invalid distance too far */\n this.back = 0; /* bits back of last unprocessed length/lit */\n this.was = 0; /* initial length of match */\n}\n\n\nconst inflateResetKeep = (strm) => {\n\n if (!strm || !strm.state) { return Z_STREAM_ERROR$1; }\n const state = strm.state;\n strm.total_in = strm.total_out = state.total = 0;\n strm.msg = ''; /*Z_NULL*/\n if (state.wrap) { /* to support ill-conceived Java test suite */\n strm.adler = state.wrap & 1;\n }\n state.mode = HEAD;\n state.last = 0;\n state.havedict = 0;\n state.dmax = 32768;\n state.head = null/*Z_NULL*/;\n state.hold = 0;\n state.bits = 0;\n //state.lencode = state.distcode = state.next = state.codes;\n state.lencode = state.lendyn = new Int32Array(ENOUGH_LENS);\n state.distcode = state.distdyn = new Int32Array(ENOUGH_DISTS);\n\n state.sane = 1;\n state.back = -1;\n //Tracev((stderr, \"inflate: reset\\n\"));\n return Z_OK$1;\n};\n\n\nconst inflateReset = (strm) => {\n\n if (!strm || !strm.state) { return Z_STREAM_ERROR$1; }\n const state = strm.state;\n state.wsize = 0;\n state.whave = 0;\n state.wnext = 0;\n return inflateResetKeep(strm);\n\n};\n\n\nconst inflateReset2 = (strm, windowBits) => {\n let wrap;\n\n /* get the state */\n if (!strm || !strm.state) { return Z_STREAM_ERROR$1; }\n const state = strm.state;\n\n /* extract wrap request from windowBits parameter */\n if (windowBits < 0) {\n wrap = 0;\n windowBits = -windowBits;\n }\n else {\n wrap = (windowBits >> 4) + 1;\n if (windowBits < 48) {\n windowBits &= 15;\n }\n }\n\n /* set number of window bits, free window if different */\n if (windowBits && (windowBits < 8 || windowBits > 15)) {\n return Z_STREAM_ERROR$1;\n }\n if (state.window !== null && state.wbits !== windowBits) {\n state.window = null;\n }\n\n /* update state and reset the rest of it */\n state.wrap = wrap;\n state.wbits = windowBits;\n return inflateReset(strm);\n};\n\n\nconst inflateInit2 = (strm, windowBits) => {\n\n if (!strm) { return Z_STREAM_ERROR$1; }\n //strm.msg = Z_NULL; /* in case we return an error */\n\n const state = new InflateState();\n\n //if (state === Z_NULL) return Z_MEM_ERROR;\n //Tracev((stderr, \"inflate: allocated\\n\"));\n strm.state = state;\n state.window = null/*Z_NULL*/;\n const ret = inflateReset2(strm, windowBits);\n if (ret !== Z_OK$1) {\n strm.state = null/*Z_NULL*/;\n }\n return ret;\n};\n\n\nconst inflateInit = (strm) => {\n\n return inflateInit2(strm, DEF_WBITS);\n};\n\n\n/*\n Return state with length and distance decoding tables and index sizes set to\n fixed code decoding. Normally this returns fixed tables from inffixed.h.\n If BUILDFIXED is defined, then instead this routine builds the tables the\n first time it's called, and returns those tables the first time and\n thereafter. This reduces the size of the code by about 2K bytes, in\n exchange for a little execution time. However, BUILDFIXED should not be\n used for threaded applications, since the rewriting of the tables and virgin\n may not be thread-safe.\n */\nlet virgin = true;\n\nlet lenfix, distfix; // We have no pointers in JS, so keep tables separate\n\n\nconst fixedtables = (state) => {\n\n /* build fixed huffman tables if first call (may not be thread safe) */\n if (virgin) {\n lenfix = new Int32Array(512);\n distfix = new Int32Array(32);\n\n /* literal/length table */\n let sym = 0;\n while (sym < 144) { state.lens[sym++] = 8; }\n while (sym < 256) { state.lens[sym++] = 9; }\n while (sym < 280) { state.lens[sym++] = 7; }\n while (sym < 288) { state.lens[sym++] = 8; }\n\n inftrees(LENS, state.lens, 0, 288, lenfix, 0, state.work, { bits: 9 });\n\n /* distance table */\n sym = 0;\n while (sym < 32) { state.lens[sym++] = 5; }\n\n inftrees(DISTS, state.lens, 0, 32, distfix, 0, state.work, { bits: 5 });\n\n /* do this just once */\n virgin = false;\n }\n\n state.lencode = lenfix;\n state.lenbits = 9;\n state.distcode = distfix;\n state.distbits = 5;\n};\n\n\n/*\n Update the window with the last wsize (normally 32K) bytes written before\n returning. If window does not exist yet, create it. This is only called\n when a window is already in use, or when output has been written during this\n inflate call, but the end of the deflate stream has not been reached yet.\n It is also called to create a window for dictionary data when a dictionary\n is loaded.\n\n Providing output buffers larger than 32K to inflate() should provide a speed\n advantage, since only the last 32K of output is copied to the sliding window\n upon return from inflate(), and since all distances after the first 32K of\n output will fall in the output data, making match copies simpler and faster.\n The advantage may be dependent on the size of the processor's data caches.\n */\nconst updatewindow = (strm, src, end, copy) => {\n\n let dist;\n const state = strm.state;\n\n /* if it hasn't been done already, allocate space for the window */\n if (state.window === null) {\n state.wsize = 1 << state.wbits;\n state.wnext = 0;\n state.whave = 0;\n\n state.window = new Uint8Array(state.wsize);\n }\n\n /* copy state->wsize or less output bytes into the circular window */\n if (copy >= state.wsize) {\n state.window.set(src.subarray(end - state.wsize, end), 0);\n state.wnext = 0;\n state.whave = state.wsize;\n }\n else {\n dist = state.wsize - state.wnext;\n if (dist > copy) {\n dist = copy;\n }\n //zmemcpy(state->window + state->wnext, end - copy, dist);\n state.window.set(src.subarray(end - copy, end - copy + dist), state.wnext);\n copy -= dist;\n if (copy) {\n //zmemcpy(state->window, end - copy, copy);\n state.window.set(src.subarray(end - copy, end), 0);\n state.wnext = copy;\n state.whave = state.wsize;\n }\n else {\n state.wnext += dist;\n if (state.wnext === state.wsize) { state.wnext = 0; }\n if (state.whave < state.wsize) { state.whave += dist; }\n }\n }\n return 0;\n};\n\n\nconst inflate$2 = (strm, flush) => {\n\n let state;\n let input, output; // input/output buffers\n let next; /* next input INDEX */\n let put; /* next output INDEX */\n let have, left; /* available input and output */\n let hold; /* bit buffer */\n let bits; /* bits in bit buffer */\n let _in, _out; /* save starting available input and output */\n let copy; /* number of stored or match bytes to copy */\n let from; /* where to copy match bytes from */\n let from_source;\n let here = 0; /* current decoding table entry */\n let here_bits, here_op, here_val; // paked \"here\" denormalized (JS specific)\n //let last; /* parent table entry */\n let last_bits, last_op, last_val; // paked \"last\" denormalized (JS specific)\n let len; /* length to copy for repeats, bits to drop */\n let ret; /* return code */\n const hbuf = new Uint8Array(4); /* buffer for gzip header crc calculation */\n let opts;\n\n let n; // temporary variable for NEED_BITS\n\n const order = /* permutation of code lengths */\n new Uint8Array([ 16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15 ]);\n\n\n if (!strm || !strm.state || !strm.output ||\n (!strm.input && strm.avail_in !== 0)) {\n return Z_STREAM_ERROR$1;\n }\n\n state = strm.state;\n if (state.mode === TYPE) { state.mode = TYPEDO; } /* skip check */\n\n\n //--- LOAD() ---\n put = strm.next_out;\n output = strm.output;\n left = strm.avail_out;\n next = strm.next_in;\n input = strm.input;\n have = strm.avail_in;\n hold = state.hold;\n bits = state.bits;\n //---\n\n _in = have;\n _out = left;\n ret = Z_OK$1;\n\n inf_leave: // goto emulation\n for (;;) {\n switch (state.mode) {\n case HEAD:\n if (state.wrap === 0) {\n state.mode = TYPEDO;\n break;\n }\n //=== NEEDBITS(16);\n while (bits < 16) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n if ((state.wrap & 2) && hold === 0x8b1f) { /* gzip header */\n state.check = 0/*crc32(0L, Z_NULL, 0)*/;\n //=== CRC2(state.check, hold);\n hbuf[0] = hold & 0xff;\n hbuf[1] = (hold >>> 8) & 0xff;\n state.check = crc32_1(state.check, hbuf, 2, 0);\n //===//\n\n //=== INITBITS();\n hold = 0;\n bits = 0;\n //===//\n state.mode = FLAGS;\n break;\n }\n state.flags = 0; /* expect zlib header */\n if (state.head) {\n state.head.done = false;\n }\n if (!(state.wrap & 1) || /* check if zlib header allowed */\n (((hold & 0xff)/*BITS(8)*/ << 8) + (hold >> 8)) % 31) {\n strm.msg = 'incorrect header check';\n state.mode = BAD;\n break;\n }\n if ((hold & 0x0f)/*BITS(4)*/ !== Z_DEFLATED) {\n strm.msg = 'unknown compression method';\n state.mode = BAD;\n break;\n }\n //--- DROPBITS(4) ---//\n hold >>>= 4;\n bits -= 4;\n //---//\n len = (hold & 0x0f)/*BITS(4)*/ + 8;\n if (state.wbits === 0) {\n state.wbits = len;\n }\n else if (len > state.wbits) {\n strm.msg = 'invalid window size';\n state.mode = BAD;\n break;\n }\n\n // !!! pako patch. Force use `options.windowBits` if passed.\n // Required to always use max window size by default.\n state.dmax = 1 << state.wbits;\n //state.dmax = 1 << len;\n\n //Tracev((stderr, \"inflate: zlib header ok\\n\"));\n strm.adler = state.check = 1/*adler32(0L, Z_NULL, 0)*/;\n state.mode = hold & 0x200 ? DICTID : TYPE;\n //=== INITBITS();\n hold = 0;\n bits = 0;\n //===//\n break;\n case FLAGS:\n //=== NEEDBITS(16); */\n while (bits < 16) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n state.flags = hold;\n if ((state.flags & 0xff) !== Z_DEFLATED) {\n strm.msg = 'unknown compression method';\n state.mode = BAD;\n break;\n }\n if (state.flags & 0xe000) {\n strm.msg = 'unknown header flags set';\n state.mode = BAD;\n break;\n }\n if (state.head) {\n state.head.text = ((hold >> 8) & 1);\n }\n if (state.flags & 0x0200) {\n //=== CRC2(state.check, hold);\n hbuf[0] = hold & 0xff;\n hbuf[1] = (hold >>> 8) & 0xff;\n state.check = crc32_1(state.check, hbuf, 2, 0);\n //===//\n }\n //=== INITBITS();\n hold = 0;\n bits = 0;\n //===//\n state.mode = TIME;\n /* falls through */\n case TIME:\n //=== NEEDBITS(32); */\n while (bits < 32) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n if (state.head) {\n state.head.time = hold;\n }\n if (state.flags & 0x0200) {\n //=== CRC4(state.check, hold)\n hbuf[0] = hold & 0xff;\n hbuf[1] = (hold >>> 8) & 0xff;\n hbuf[2] = (hold >>> 16) & 0xff;\n hbuf[3] = (hold >>> 24) & 0xff;\n state.check = crc32_1(state.check, hbuf, 4, 0);\n //===\n }\n //=== INITBITS();\n hold = 0;\n bits = 0;\n //===//\n state.mode = OS;\n /* falls through */\n case OS:\n //=== NEEDBITS(16); */\n while (bits < 16) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n if (state.head) {\n state.head.xflags = (hold & 0xff);\n state.head.os = (hold >> 8);\n }\n if (state.flags & 0x0200) {\n //=== CRC2(state.check, hold);\n hbuf[0] = hold & 0xff;\n hbuf[1] = (hold >>> 8) & 0xff;\n state.check = crc32_1(state.check, hbuf, 2, 0);\n //===//\n }\n //=== INITBITS();\n hold = 0;\n bits = 0;\n //===//\n state.mode = EXLEN;\n /* falls through */\n case EXLEN:\n if (state.flags & 0x0400) {\n //=== NEEDBITS(16); */\n while (bits < 16) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n state.length = hold;\n if (state.head) {\n state.head.extra_len = hold;\n }\n if (state.flags & 0x0200) {\n //=== CRC2(state.check, hold);\n hbuf[0] = hold & 0xff;\n hbuf[1] = (hold >>> 8) & 0xff;\n state.check = crc32_1(state.check, hbuf, 2, 0);\n //===//\n }\n //=== INITBITS();\n hold = 0;\n bits = 0;\n //===//\n }\n else if (state.head) {\n state.head.extra = null/*Z_NULL*/;\n }\n state.mode = EXTRA;\n /* falls through */\n case EXTRA:\n if (state.flags & 0x0400) {\n copy = state.length;\n if (copy > have) { copy = have; }\n if (copy) {\n if (state.head) {\n len = state.head.extra_len - state.length;\n if (!state.head.extra) {\n // Use untyped array for more convenient processing later\n state.head.extra = new Uint8Array(state.head.extra_len);\n }\n state.head.extra.set(\n input.subarray(\n next,\n // extra field is limited to 65536 bytes\n // - no need for additional size check\n next + copy\n ),\n /*len + copy > state.head.extra_max - len ? state.head.extra_max : copy,*/\n len\n );\n //zmemcpy(state.head.extra + len, next,\n // len + copy > state.head.extra_max ?\n // state.head.extra_max - len : copy);\n }\n if (state.flags & 0x0200) {\n state.check = crc32_1(state.check, input, copy, next);\n }\n have -= copy;\n next += copy;\n state.length -= copy;\n }\n if (state.length) { break inf_leave; }\n }\n state.length = 0;\n state.mode = NAME;\n /* falls through */\n case NAME:\n if (state.flags & 0x0800) {\n if (have === 0) { break inf_leave; }\n copy = 0;\n do {\n // TODO: 2 or 1 bytes?\n len = input[next + copy++];\n /* use constant limit because in js we should not preallocate memory */\n if (state.head && len &&\n (state.length < 65536 /*state.head.name_max*/)) {\n state.head.name += String.fromCharCode(len);\n }\n } while (len && copy < have);\n\n if (state.flags & 0x0200) {\n state.check = crc32_1(state.check, input, copy, next);\n }\n have -= copy;\n next += copy;\n if (len) { break inf_leave; }\n }\n else if (state.head) {\n state.head.name = null;\n }\n state.length = 0;\n state.mode = COMMENT;\n /* falls through */\n case COMMENT:\n if (state.flags & 0x1000) {\n if (have === 0) { break inf_leave; }\n copy = 0;\n do {\n len = input[next + copy++];\n /* use constant limit because in js we should not preallocate memory */\n if (state.head && len &&\n (state.length < 65536 /*state.head.comm_max*/)) {\n state.head.comment += String.fromCharCode(len);\n }\n } while (len && copy < have);\n if (state.flags & 0x0200) {\n state.check = crc32_1(state.check, input, copy, next);\n }\n have -= copy;\n next += copy;\n if (len) { break inf_leave; }\n }\n else if (state.head) {\n state.head.comment = null;\n }\n state.mode = HCRC;\n /* falls through */\n case HCRC:\n if (state.flags & 0x0200) {\n //=== NEEDBITS(16); */\n while (bits < 16) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n if (hold !== (state.check & 0xffff)) {\n strm.msg = 'header crc mismatch';\n state.mode = BAD;\n break;\n }\n //=== INITBITS();\n hold = 0;\n bits = 0;\n //===//\n }\n if (state.head) {\n state.head.hcrc = ((state.flags >> 9) & 1);\n state.head.done = true;\n }\n strm.adler = state.check = 0;\n state.mode = TYPE;\n break;\n case DICTID:\n //=== NEEDBITS(32); */\n while (bits < 32) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n strm.adler = state.check = zswap32(hold);\n //=== INITBITS();\n hold = 0;\n bits = 0;\n //===//\n state.mode = DICT;\n /* falls through */\n case DICT:\n if (state.havedict === 0) {\n //--- RESTORE() ---\n strm.next_out = put;\n strm.avail_out = left;\n strm.next_in = next;\n strm.avail_in = have;\n state.hold = hold;\n state.bits = bits;\n //---\n return Z_NEED_DICT$1;\n }\n strm.adler = state.check = 1/*adler32(0L, Z_NULL, 0)*/;\n state.mode = TYPE;\n /* falls through */\n case TYPE:\n if (flush === Z_BLOCK || flush === Z_TREES) { break inf_leave; }\n /* falls through */\n case TYPEDO:\n if (state.last) {\n //--- BYTEBITS() ---//\n hold >>>= bits & 7;\n bits -= bits & 7;\n //---//\n state.mode = CHECK;\n break;\n }\n //=== NEEDBITS(3); */\n while (bits < 3) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n state.last = (hold & 0x01)/*BITS(1)*/;\n //--- DROPBITS(1) ---//\n hold >>>= 1;\n bits -= 1;\n //---//\n\n switch ((hold & 0x03)/*BITS(2)*/) {\n case 0: /* stored block */\n //Tracev((stderr, \"inflate: stored block%s\\n\",\n // state.last ? \" (last)\" : \"\"));\n state.mode = STORED;\n break;\n case 1: /* fixed block */\n fixedtables(state);\n //Tracev((stderr, \"inflate: fixed codes block%s\\n\",\n // state.last ? \" (last)\" : \"\"));\n state.mode = LEN_; /* decode codes */\n if (flush === Z_TREES) {\n //--- DROPBITS(2) ---//\n hold >>>= 2;\n bits -= 2;\n //---//\n break inf_leave;\n }\n break;\n case 2: /* dynamic block */\n //Tracev((stderr, \"inflate: dynamic codes block%s\\n\",\n // state.last ? \" (last)\" : \"\"));\n state.mode = TABLE;\n break;\n case 3:\n strm.msg = 'invalid block type';\n state.mode = BAD;\n }\n //--- DROPBITS(2) ---//\n hold >>>= 2;\n bits -= 2;\n //---//\n break;\n case STORED:\n //--- BYTEBITS() ---// /* go to byte boundary */\n hold >>>= bits & 7;\n bits -= bits & 7;\n //---//\n //=== NEEDBITS(32); */\n while (bits < 32) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n if ((hold & 0xffff) !== ((hold >>> 16) ^ 0xffff)) {\n strm.msg = 'invalid stored block lengths';\n state.mode = BAD;\n break;\n }\n state.length = hold & 0xffff;\n //Tracev((stderr, \"inflate: stored length %u\\n\",\n // state.length));\n //=== INITBITS();\n hold = 0;\n bits = 0;\n //===//\n state.mode = COPY_;\n if (flush === Z_TREES) { break inf_leave; }\n /* falls through */\n case COPY_:\n state.mode = COPY;\n /* falls through */\n case COPY:\n copy = state.length;\n if (copy) {\n if (copy > have) { copy = have; }\n if (copy > left) { copy = left; }\n if (copy === 0) { break inf_leave; }\n //--- zmemcpy(put, next, copy); ---\n output.set(input.subarray(next, next + copy), put);\n //---//\n have -= copy;\n next += copy;\n left -= copy;\n put += copy;\n state.length -= copy;\n break;\n }\n //Tracev((stderr, \"inflate: stored end\\n\"));\n state.mode = TYPE;\n break;\n case TABLE:\n //=== NEEDBITS(14); */\n while (bits < 14) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n state.nlen = (hold & 0x1f)/*BITS(5)*/ + 257;\n //--- DROPBITS(5) ---//\n hold >>>= 5;\n bits -= 5;\n //---//\n state.ndist = (hold & 0x1f)/*BITS(5)*/ + 1;\n //--- DROPBITS(5) ---//\n hold >>>= 5;\n bits -= 5;\n //---//\n state.ncode = (hold & 0x0f)/*BITS(4)*/ + 4;\n //--- DROPBITS(4) ---//\n hold >>>= 4;\n bits -= 4;\n //---//\n//#ifndef PKZIP_BUG_WORKAROUND\n if (state.nlen > 286 || state.ndist > 30) {\n strm.msg = 'too many length or distance symbols';\n state.mode = BAD;\n break;\n }\n//#endif\n //Tracev((stderr, \"inflate: table sizes ok\\n\"));\n state.have = 0;\n state.mode = LENLENS;\n /* falls through */\n case LENLENS:\n while (state.have < state.ncode) {\n //=== NEEDBITS(3);\n while (bits < 3) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n state.lens[order[state.have++]] = (hold & 0x07);//BITS(3);\n //--- DROPBITS(3) ---//\n hold >>>= 3;\n bits -= 3;\n //---//\n }\n while (state.have < 19) {\n state.lens[order[state.have++]] = 0;\n }\n // We have separate tables & no pointers. 2 commented lines below not needed.\n //state.next = state.codes;\n //state.lencode = state.next;\n // Switch to use dynamic table\n state.lencode = state.lendyn;\n state.lenbits = 7;\n\n opts = { bits: state.lenbits };\n ret = inftrees(CODES, state.lens, 0, 19, state.lencode, 0, state.work, opts);\n state.lenbits = opts.bits;\n\n if (ret) {\n strm.msg = 'invalid code lengths set';\n state.mode = BAD;\n break;\n }\n //Tracev((stderr, \"inflate: code lengths ok\\n\"));\n state.have = 0;\n state.mode = CODELENS;\n /* falls through */\n case CODELENS:\n while (state.have < state.nlen + state.ndist) {\n for (;;) {\n here = state.lencode[hold & ((1 << state.lenbits) - 1)];/*BITS(state.lenbits)*/\n here_bits = here >>> 24;\n here_op = (here >>> 16) & 0xff;\n here_val = here & 0xffff;\n\n if ((here_bits) <= bits) { break; }\n //--- PULLBYTE() ---//\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n //---//\n }\n if (here_val < 16) {\n //--- DROPBITS(here.bits) ---//\n hold >>>= here_bits;\n bits -= here_bits;\n //---//\n state.lens[state.have++] = here_val;\n }\n else {\n if (here_val === 16) {\n //=== NEEDBITS(here.bits + 2);\n n = here_bits + 2;\n while (bits < n) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n //--- DROPBITS(here.bits) ---//\n hold >>>= here_bits;\n bits -= here_bits;\n //---//\n if (state.have === 0) {\n strm.msg = 'invalid bit length repeat';\n state.mode = BAD;\n break;\n }\n len = state.lens[state.have - 1];\n copy = 3 + (hold & 0x03);//BITS(2);\n //--- DROPBITS(2) ---//\n hold >>>= 2;\n bits -= 2;\n //---//\n }\n else if (here_val === 17) {\n //=== NEEDBITS(here.bits + 3);\n n = here_bits + 3;\n while (bits < n) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n //--- DROPBITS(here.bits) ---//\n hold >>>= here_bits;\n bits -= here_bits;\n //---//\n len = 0;\n copy = 3 + (hold & 0x07);//BITS(3);\n //--- DROPBITS(3) ---//\n hold >>>= 3;\n bits -= 3;\n //---//\n }\n else {\n //=== NEEDBITS(here.bits + 7);\n n = here_bits + 7;\n while (bits < n) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n //--- DROPBITS(here.bits) ---//\n hold >>>= here_bits;\n bits -= here_bits;\n //---//\n len = 0;\n copy = 11 + (hold & 0x7f);//BITS(7);\n //--- DROPBITS(7) ---//\n hold >>>= 7;\n bits -= 7;\n //---//\n }\n if (state.have + copy > state.nlen + state.ndist) {\n strm.msg = 'invalid bit length repeat';\n state.mode = BAD;\n break;\n }\n while (copy--) {\n state.lens[state.have++] = len;\n }\n }\n }\n\n /* handle error breaks in while */\n if (state.mode === BAD) { break; }\n\n /* check for end-of-block code (better have one) */\n if (state.lens[256] === 0) {\n strm.msg = 'invalid code -- missing end-of-block';\n state.mode = BAD;\n break;\n }\n\n /* build code tables -- note: do not change the lenbits or distbits\n values here (9 and 6) without reading the comments in inftrees.h\n concerning the ENOUGH constants, which depend on those values */\n state.lenbits = 9;\n\n opts = { bits: state.lenbits };\n ret = inftrees(LENS, state.lens, 0, state.nlen, state.lencode, 0, state.work, opts);\n // We have separate tables & no pointers. 2 commented lines below not needed.\n // state.next_index = opts.table_index;\n state.lenbits = opts.bits;\n // state.lencode = state.next;\n\n if (ret) {\n strm.msg = 'invalid literal/lengths set';\n state.mode = BAD;\n break;\n }\n\n state.distbits = 6;\n //state.distcode.copy(state.codes);\n // Switch to use dynamic table\n state.distcode = state.distdyn;\n opts = { bits: state.distbits };\n ret = inftrees(DISTS, state.lens, state.nlen, state.ndist, state.distcode, 0, state.work, opts);\n // We have separate tables & no pointers. 2 commented lines below not needed.\n // state.next_index = opts.table_index;\n state.distbits = opts.bits;\n // state.distcode = state.next;\n\n if (ret) {\n strm.msg = 'invalid distances set';\n state.mode = BAD;\n break;\n }\n //Tracev((stderr, 'inflate: codes ok\\n'));\n state.mode = LEN_;\n if (flush === Z_TREES) { break inf_leave; }\n /* falls through */\n case LEN_:\n state.mode = LEN;\n /* falls through */\n case LEN:\n if (have >= 6 && left >= 258) {\n //--- RESTORE() ---\n strm.next_out = put;\n strm.avail_out = left;\n strm.next_in = next;\n strm.avail_in = have;\n state.hold = hold;\n state.bits = bits;\n //---\n inffast(strm, _out);\n //--- LOAD() ---\n put = strm.next_out;\n output = strm.output;\n left = strm.avail_out;\n next = strm.next_in;\n input = strm.input;\n have = strm.avail_in;\n hold = state.hold;\n bits = state.bits;\n //---\n\n if (state.mode === TYPE) {\n state.back = -1;\n }\n break;\n }\n state.back = 0;\n for (;;) {\n here = state.lencode[hold & ((1 << state.lenbits) - 1)]; /*BITS(state.lenbits)*/\n here_bits = here >>> 24;\n here_op = (here >>> 16) & 0xff;\n here_val = here & 0xffff;\n\n if (here_bits <= bits) { break; }\n //--- PULLBYTE() ---//\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n //---//\n }\n if (here_op && (here_op & 0xf0) === 0) {\n last_bits = here_bits;\n last_op = here_op;\n last_val = here_val;\n for (;;) {\n here = state.lencode[last_val +\n ((hold & ((1 << (last_bits + last_op)) - 1))/*BITS(last.bits + last.op)*/ >> last_bits)];\n here_bits = here >>> 24;\n here_op = (here >>> 16) & 0xff;\n here_val = here & 0xffff;\n\n if ((last_bits + here_bits) <= bits) { break; }\n //--- PULLBYTE() ---//\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n //---//\n }\n //--- DROPBITS(last.bits) ---//\n hold >>>= last_bits;\n bits -= last_bits;\n //---//\n state.back += last_bits;\n }\n //--- DROPBITS(here.bits) ---//\n hold >>>= here_bits;\n bits -= here_bits;\n //---//\n state.back += here_bits;\n state.length = here_val;\n if (here_op === 0) {\n //Tracevv((stderr, here.val >= 0x20 && here.val < 0x7f ?\n // \"inflate: literal '%c'\\n\" :\n // \"inflate: literal 0x%02x\\n\", here.val));\n state.mode = LIT;\n break;\n }\n if (here_op & 32) {\n //Tracevv((stderr, \"inflate: end of block\\n\"));\n state.back = -1;\n state.mode = TYPE;\n break;\n }\n if (here_op & 64) {\n strm.msg = 'invalid literal/length code';\n state.mode = BAD;\n break;\n }\n state.extra = here_op & 15;\n state.mode = LENEXT;\n /* falls through */\n case LENEXT:\n if (state.extra) {\n //=== NEEDBITS(state.extra);\n n = state.extra;\n while (bits < n) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n state.length += hold & ((1 << state.extra) - 1)/*BITS(state.extra)*/;\n //--- DROPBITS(state.extra) ---//\n hold >>>= state.extra;\n bits -= state.extra;\n //---//\n state.back += state.extra;\n }\n //Tracevv((stderr, \"inflate: length %u\\n\", state.length));\n state.was = state.length;\n state.mode = DIST;\n /* falls through */\n case DIST:\n for (;;) {\n here = state.distcode[hold & ((1 << state.distbits) - 1)];/*BITS(state.distbits)*/\n here_bits = here >>> 24;\n here_op = (here >>> 16) & 0xff;\n here_val = here & 0xffff;\n\n if ((here_bits) <= bits) { break; }\n //--- PULLBYTE() ---//\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n //---//\n }\n if ((here_op & 0xf0) === 0) {\n last_bits = here_bits;\n last_op = here_op;\n last_val = here_val;\n for (;;) {\n here = state.distcode[last_val +\n ((hold & ((1 << (last_bits + last_op)) - 1))/*BITS(last.bits + last.op)*/ >> last_bits)];\n here_bits = here >>> 24;\n here_op = (here >>> 16) & 0xff;\n here_val = here & 0xffff;\n\n if ((last_bits + here_bits) <= bits) { break; }\n //--- PULLBYTE() ---//\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n //---//\n }\n //--- DROPBITS(last.bits) ---//\n hold >>>= last_bits;\n bits -= last_bits;\n //---//\n state.back += last_bits;\n }\n //--- DROPBITS(here.bits) ---//\n hold >>>= here_bits;\n bits -= here_bits;\n //---//\n state.back += here_bits;\n if (here_op & 64) {\n strm.msg = 'invalid distance code';\n state.mode = BAD;\n break;\n }\n state.offset = here_val;\n state.extra = (here_op) & 15;\n state.mode = DISTEXT;\n /* falls through */\n case DISTEXT:\n if (state.extra) {\n //=== NEEDBITS(state.extra);\n n = state.extra;\n while (bits < n) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n state.offset += hold & ((1 << state.extra) - 1)/*BITS(state.extra)*/;\n //--- DROPBITS(state.extra) ---//\n hold >>>= state.extra;\n bits -= state.extra;\n //---//\n state.back += state.extra;\n }\n//#ifdef INFLATE_STRICT\n if (state.offset > state.dmax) {\n strm.msg = 'invalid distance too far back';\n state.mode = BAD;\n break;\n }\n//#endif\n //Tracevv((stderr, \"inflate: distance %u\\n\", state.offset));\n state.mode = MATCH;\n /* falls through */\n case MATCH:\n if (left === 0) { break inf_leave; }\n copy = _out - left;\n if (state.offset > copy) { /* copy from window */\n copy = state.offset - copy;\n if (copy > state.whave) {\n if (state.sane) {\n strm.msg = 'invalid distance too far back';\n state.mode = BAD;\n break;\n }\n// (!) This block is disabled in zlib defaults,\n// don't enable it for binary compatibility\n//#ifdef INFLATE_ALLOW_INVALID_DISTANCE_TOOFAR_ARRR\n// Trace((stderr, \"inflate.c too far\\n\"));\n// copy -= state.whave;\n// if (copy > state.length) { copy = state.length; }\n// if (copy > left) { copy = left; }\n// left -= copy;\n// state.length -= copy;\n// do {\n// output[put++] = 0;\n// } while (--copy);\n// if (state.length === 0) { state.mode = LEN; }\n// break;\n//#endif\n }\n if (copy > state.wnext) {\n copy -= state.wnext;\n from = state.wsize - copy;\n }\n else {\n from = state.wnext - copy;\n }\n if (copy > state.length) { copy = state.length; }\n from_source = state.window;\n }\n else { /* copy from output */\n from_source = output;\n from = put - state.offset;\n copy = state.length;\n }\n if (copy > left) { copy = left; }\n left -= copy;\n state.length -= copy;\n do {\n output[put++] = from_source[from++];\n } while (--copy);\n if (state.length === 0) { state.mode = LEN; }\n break;\n case LIT:\n if (left === 0) { break inf_leave; }\n output[put++] = state.length;\n left--;\n state.mode = LEN;\n break;\n case CHECK:\n if (state.wrap) {\n //=== NEEDBITS(32);\n while (bits < 32) {\n if (have === 0) { break inf_leave; }\n have--;\n // Use '|' instead of '+' to make sure that result is signed\n hold |= input[next++] << bits;\n bits += 8;\n }\n //===//\n _out -= left;\n strm.total_out += _out;\n state.total += _out;\n if (_out) {\n strm.adler = state.check =\n /*UPDATE(state.check, put - _out, _out);*/\n (state.flags ? crc32_1(state.check, output, _out, put - _out) : adler32_1(state.check, output, _out, put - _out));\n\n }\n _out = left;\n // NB: crc32 stored as signed 32-bit int, zswap32 returns signed too\n if ((state.flags ? hold : zswap32(hold)) !== state.check) {\n strm.msg = 'incorrect data check';\n state.mode = BAD;\n break;\n }\n //=== INITBITS();\n hold = 0;\n bits = 0;\n //===//\n //Tracev((stderr, \"inflate: check matches trailer\\n\"));\n }\n state.mode = LENGTH;\n /* falls through */\n case LENGTH:\n if (state.wrap && state.flags) {\n //=== NEEDBITS(32);\n while (bits < 32) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n if (hold !== (state.total & 0xffffffff)) {\n strm.msg = 'incorrect length check';\n state.mode = BAD;\n break;\n }\n //=== INITBITS();\n hold = 0;\n bits = 0;\n //===//\n //Tracev((stderr, \"inflate: length matches trailer\\n\"));\n }\n state.mode = DONE;\n /* falls through */\n case DONE:\n ret = Z_STREAM_END$1;\n break inf_leave;\n case BAD:\n ret = Z_DATA_ERROR$1;\n break inf_leave;\n case MEM:\n return Z_MEM_ERROR$1;\n case SYNC:\n /* falls through */\n default:\n return Z_STREAM_ERROR$1;\n }\n }\n\n // inf_leave <- here is real place for \"goto inf_leave\", emulated via \"break inf_leave\"\n\n /*\n Return from inflate(), updating the total counts and the check value.\n If there was no progress during the inflate() call, return a buffer\n error. Call updatewindow() to create and/or update the window state.\n Note: a memory error from inflate() is non-recoverable.\n */\n\n //--- RESTORE() ---\n strm.next_out = put;\n strm.avail_out = left;\n strm.next_in = next;\n strm.avail_in = have;\n state.hold = hold;\n state.bits = bits;\n //---\n\n if (state.wsize || (_out !== strm.avail_out && state.mode < BAD &&\n (state.mode < CHECK || flush !== Z_FINISH$1))) {\n if (updatewindow(strm, strm.output, strm.next_out, _out - strm.avail_out)) ;\n }\n _in -= strm.avail_in;\n _out -= strm.avail_out;\n strm.total_in += _in;\n strm.total_out += _out;\n state.total += _out;\n if (state.wrap && _out) {\n strm.adler = state.check = /*UPDATE(state.check, strm.next_out - _out, _out);*/\n (state.flags ? crc32_1(state.check, output, _out, strm.next_out - _out) : adler32_1(state.check, output, _out, strm.next_out - _out));\n }\n strm.data_type = state.bits + (state.last ? 64 : 0) +\n (state.mode === TYPE ? 128 : 0) +\n (state.mode === LEN_ || state.mode === COPY_ ? 256 : 0);\n if (((_in === 0 && _out === 0) || flush === Z_FINISH$1) && ret === Z_OK$1) {\n ret = Z_BUF_ERROR;\n }\n return ret;\n};\n\n\nconst inflateEnd = (strm) => {\n\n if (!strm || !strm.state /*|| strm->zfree == (free_func)0*/) {\n return Z_STREAM_ERROR$1;\n }\n\n let state = strm.state;\n if (state.window) {\n state.window = null;\n }\n strm.state = null;\n return Z_OK$1;\n};\n\n\nconst inflateGetHeader = (strm, head) => {\n\n /* check state */\n if (!strm || !strm.state) { return Z_STREAM_ERROR$1; }\n const state = strm.state;\n if ((state.wrap & 2) === 0) { return Z_STREAM_ERROR$1; }\n\n /* save header structure */\n state.head = head;\n head.done = false;\n return Z_OK$1;\n};\n\n\nconst inflateSetDictionary = (strm, dictionary) => {\n const dictLength = dictionary.length;\n\n let state;\n let dictid;\n let ret;\n\n /* check state */\n if (!strm /* == Z_NULL */ || !strm.state /* == Z_NULL */) { return Z_STREAM_ERROR$1; }\n state = strm.state;\n\n if (state.wrap !== 0 && state.mode !== DICT) {\n return Z_STREAM_ERROR$1;\n }\n\n /* check for correct dictionary identifier */\n if (state.mode === DICT) {\n dictid = 1; /* adler32(0, null, 0)*/\n /* dictid = adler32(dictid, dictionary, dictLength); */\n dictid = adler32_1(dictid, dictionary, dictLength, 0);\n if (dictid !== state.check) {\n return Z_DATA_ERROR$1;\n }\n }\n /* copy dictionary to window using updatewindow(), which will amend the\n existing dictionary if appropriate */\n ret = updatewindow(strm, dictionary, dictLength, dictLength);\n if (ret) {\n state.mode = MEM;\n return Z_MEM_ERROR$1;\n }\n state.havedict = 1;\n // Tracev((stderr, \"inflate: dictionary set\\n\"));\n return Z_OK$1;\n};\n\n\nvar inflateReset_1 = inflateReset;\nvar inflateReset2_1 = inflateReset2;\nvar inflateResetKeep_1 = inflateResetKeep;\nvar inflateInit_1 = inflateInit;\nvar inflateInit2_1 = inflateInit2;\nvar inflate_2$1 = inflate$2;\nvar inflateEnd_1 = inflateEnd;\nvar inflateGetHeader_1 = inflateGetHeader;\nvar inflateSetDictionary_1 = inflateSetDictionary;\nvar inflateInfo = 'pako inflate (from Nodeca project)';\n\n/* Not implemented\nmodule.exports.inflateCopy = inflateCopy;\nmodule.exports.inflateGetDictionary = inflateGetDictionary;\nmodule.exports.inflateMark = inflateMark;\nmodule.exports.inflatePrime = inflatePrime;\nmodule.exports.inflateSync = inflateSync;\nmodule.exports.inflateSyncPoint = inflateSyncPoint;\nmodule.exports.inflateUndermine = inflateUndermine;\n*/\n\nvar inflate_1$2 = {\n\tinflateReset: inflateReset_1,\n\tinflateReset2: inflateReset2_1,\n\tinflateResetKeep: inflateResetKeep_1,\n\tinflateInit: inflateInit_1,\n\tinflateInit2: inflateInit2_1,\n\tinflate: inflate_2$1,\n\tinflateEnd: inflateEnd_1,\n\tinflateGetHeader: inflateGetHeader_1,\n\tinflateSetDictionary: inflateSetDictionary_1,\n\tinflateInfo: inflateInfo\n};\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n// claim that you wrote the original software. If you use this software\n// in a product, an acknowledgment in the product documentation would be\n// appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n// misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nfunction GZheader() {\n /* true if compressed data believed to be text */\n this.text = 0;\n /* modification time */\n this.time = 0;\n /* extra flags (not used when writing a gzip file) */\n this.xflags = 0;\n /* operating system */\n this.os = 0;\n /* pointer to extra field or Z_NULL if none */\n this.extra = null;\n /* extra field length (valid if extra != Z_NULL) */\n this.extra_len = 0; // Actually, we don't need it in JS,\n // but leave for few code modifications\n\n //\n // Setup limits is not necessary because in js we should not preallocate memory\n // for inflate use constant limit in 65536 bytes\n //\n\n /* space at extra (only when reading header) */\n // this.extra_max = 0;\n /* pointer to zero-terminated file name or Z_NULL */\n this.name = '';\n /* space at name (only when reading header) */\n // this.name_max = 0;\n /* pointer to zero-terminated comment or Z_NULL */\n this.comment = '';\n /* space at comment (only when reading header) */\n // this.comm_max = 0;\n /* true if there was or will be a header crc */\n this.hcrc = 0;\n /* true when done reading gzip header (not used when writing a gzip file) */\n this.done = false;\n}\n\nvar gzheader = GZheader;\n\nconst toString = Object.prototype.toString;\n\n/* Public constants ==========================================================*/\n/* ===========================================================================*/\n\nconst {\n Z_NO_FLUSH, Z_FINISH,\n Z_OK, Z_STREAM_END, Z_NEED_DICT, Z_STREAM_ERROR, Z_DATA_ERROR, Z_MEM_ERROR\n} = constants$2;\n\n/* ===========================================================================*/\n\n\n/**\n * class Inflate\n *\n * Generic JS-style wrapper for zlib calls. If you don't need\n * streaming behaviour - use more simple functions: [[inflate]]\n * and [[inflateRaw]].\n **/\n\n/* internal\n * inflate.chunks -> Array\n *\n * Chunks of output data, if [[Inflate#onData]] not overridden.\n **/\n\n/**\n * Inflate.result -> Uint8Array|String\n *\n * Uncompressed result, generated by default [[Inflate#onData]]\n * and [[Inflate#onEnd]] handlers. Filled after you push last chunk\n * (call [[Inflate#push]] with `Z_FINISH` / `true` param).\n **/\n\n/**\n * Inflate.err -> Number\n *\n * Error code after inflate finished. 0 (Z_OK) on success.\n * Should be checked if broken data possible.\n **/\n\n/**\n * Inflate.msg -> String\n *\n * Error message, if [[Inflate.err]] != 0\n **/\n\n\n/**\n * new Inflate(options)\n * - options (Object): zlib inflate options.\n *\n * Creates new inflator instance with specified params. Throws exception\n * on bad params. Supported options:\n *\n * - `windowBits`\n * - `dictionary`\n *\n * [http://zlib.net/manual.html#Advanced](http://zlib.net/manual.html#Advanced)\n * for more information on these.\n *\n * Additional options, for internal needs:\n *\n * - `chunkSize` - size of generated data chunks (16K by default)\n * - `raw` (Boolean) - do raw inflate\n * - `to` (String) - if equal to 'string', then result will be converted\n * from utf8 to utf16 (javascript) string. When string output requested,\n * chunk length can differ from `chunkSize`, depending on content.\n *\n * By default, when no options set, autodetect deflate/gzip data format via\n * wrapper header.\n *\n * ##### Example:\n *\n * ```javascript\n * const pako = require('pako')\n * const chunk1 = new Uint8Array([1,2,3,4,5,6,7,8,9])\n * const chunk2 = new Uint8Array([10,11,12,13,14,15,16,17,18,19]);\n *\n * const inflate = new pako.Inflate({ level: 3});\n *\n * inflate.push(chunk1, false);\n * inflate.push(chunk2, true); // true -> last chunk\n *\n * if (inflate.err) { throw new Error(inflate.err); }\n *\n * console.log(inflate.result);\n * ```\n **/\nfunction Inflate$1(options) {\n this.options = common.assign({\n chunkSize: 1024 * 64,\n windowBits: 15,\n to: ''\n }, options || {});\n\n const opt = this.options;\n\n // Force window size for `raw` data, if not set directly,\n // because we have no header for autodetect.\n if (opt.raw && (opt.windowBits >= 0) && (opt.windowBits < 16)) {\n opt.windowBits = -opt.windowBits;\n if (opt.windowBits === 0) { opt.windowBits = -15; }\n }\n\n // If `windowBits` not defined (and mode not raw) - set autodetect flag for gzip/deflate\n if ((opt.windowBits >= 0) && (opt.windowBits < 16) &&\n !(options && options.windowBits)) {\n opt.windowBits += 32;\n }\n\n // Gzip header has no info about windows size, we can do autodetect only\n // for deflate. So, if window size not set, force it to max when gzip possible\n if ((opt.windowBits > 15) && (opt.windowBits < 48)) {\n // bit 3 (16) -> gzipped data\n // bit 4 (32) -> autodetect gzip/deflate\n if ((opt.windowBits & 15) === 0) {\n opt.windowBits |= 15;\n }\n }\n\n this.err = 0; // error code, if happens (0 = Z_OK)\n this.msg = ''; // error message\n this.ended = false; // used to avoid multiple onEnd() calls\n this.chunks = []; // chunks of compressed data\n\n this.strm = new zstream();\n this.strm.avail_out = 0;\n\n let status = inflate_1$2.inflateInit2(\n this.strm,\n opt.windowBits\n );\n\n if (status !== Z_OK) {\n throw new Error(messages[status]);\n }\n\n this.header = new gzheader();\n\n inflate_1$2.inflateGetHeader(this.strm, this.header);\n\n // Setup dictionary\n if (opt.dictionary) {\n // Convert data if needed\n if (typeof opt.dictionary === 'string') {\n opt.dictionary = strings.string2buf(opt.dictionary);\n } else if (toString.call(opt.dictionary) === '[object ArrayBuffer]') {\n opt.dictionary = new Uint8Array(opt.dictionary);\n }\n if (opt.raw) { //In raw mode we need to set the dictionary early\n status = inflate_1$2.inflateSetDictionary(this.strm, opt.dictionary);\n if (status !== Z_OK) {\n throw new Error(messages[status]);\n }\n }\n }\n}\n\n/**\n * Inflate#push(data[, flush_mode]) -> Boolean\n * - data (Uint8Array|ArrayBuffer): input data\n * - flush_mode (Number|Boolean): 0..6 for corresponding Z_NO_FLUSH..Z_TREE\n * flush modes. See constants. Skipped or `false` means Z_NO_FLUSH,\n * `true` means Z_FINISH.\n *\n * Sends input data to inflate pipe, generating [[Inflate#onData]] calls with\n * new output chunks. Returns `true` on success. If end of stream detected,\n * [[Inflate#onEnd]] will be called.\n *\n * `flush_mode` is not needed for normal operation, because end of stream\n * detected automatically. You may try to use it for advanced things, but\n * this functionality was not tested.\n *\n * On fail call [[Inflate#onEnd]] with error code and return false.\n *\n * ##### Example\n *\n * ```javascript\n * push(chunk, false); // push one of data chunks\n * ...\n * push(chunk, true); // push last chunk\n * ```\n **/\nInflate$1.prototype.push = function (data, flush_mode) {\n const strm = this.strm;\n const chunkSize = this.options.chunkSize;\n const dictionary = this.options.dictionary;\n let status, _flush_mode, last_avail_out;\n\n if (this.ended) return false;\n\n if (flush_mode === ~~flush_mode) _flush_mode = flush_mode;\n else _flush_mode = flush_mode === true ? Z_FINISH : Z_NO_FLUSH;\n\n // Convert data if needed\n if (toString.call(data) === '[object ArrayBuffer]') {\n strm.input = new Uint8Array(data);\n } else {\n strm.input = data;\n }\n\n strm.next_in = 0;\n strm.avail_in = strm.input.length;\n\n for (;;) {\n if (strm.avail_out === 0) {\n strm.output = new Uint8Array(chunkSize);\n strm.next_out = 0;\n strm.avail_out = chunkSize;\n }\n\n status = inflate_1$2.inflate(strm, _flush_mode);\n\n if (status === Z_NEED_DICT && dictionary) {\n status = inflate_1$2.inflateSetDictionary(strm, dictionary);\n\n if (status === Z_OK) {\n status = inflate_1$2.inflate(strm, _flush_mode);\n } else if (status === Z_DATA_ERROR) {\n // Replace code with more verbose\n status = Z_NEED_DICT;\n }\n }\n\n // Skip snyc markers if more data follows and not raw mode\n while (strm.avail_in > 0 &&\n status === Z_STREAM_END &&\n strm.state.wrap > 0 &&\n data[strm.next_in] !== 0)\n {\n inflate_1$2.inflateReset(strm);\n status = inflate_1$2.inflate(strm, _flush_mode);\n }\n\n switch (status) {\n case Z_STREAM_ERROR:\n case Z_DATA_ERROR:\n case Z_NEED_DICT:\n case Z_MEM_ERROR:\n this.onEnd(status);\n this.ended = true;\n return false;\n }\n\n // Remember real `avail_out` value, because we may patch out buffer content\n // to align utf8 strings boundaries.\n last_avail_out = strm.avail_out;\n\n if (strm.next_out) {\n if (strm.avail_out === 0 || status === Z_STREAM_END) {\n\n if (this.options.to === 'string') {\n\n let next_out_utf8 = strings.utf8border(strm.output, strm.next_out);\n\n let tail = strm.next_out - next_out_utf8;\n let utf8str = strings.buf2string(strm.output, next_out_utf8);\n\n // move tail & realign counters\n strm.next_out = tail;\n strm.avail_out = chunkSize - tail;\n if (tail) strm.output.set(strm.output.subarray(next_out_utf8, next_out_utf8 + tail), 0);\n\n this.onData(utf8str);\n\n } else {\n this.onData(strm.output.length === strm.next_out ? strm.output : strm.output.subarray(0, strm.next_out));\n }\n }\n }\n\n // Must repeat iteration if out buffer is full\n if (status === Z_OK && last_avail_out === 0) continue;\n\n // Finalize if end of stream reached.\n if (status === Z_STREAM_END) {\n status = inflate_1$2.inflateEnd(this.strm);\n this.onEnd(status);\n this.ended = true;\n return true;\n }\n\n if (strm.avail_in === 0) break;\n }\n\n return true;\n};\n\n\n/**\n * Inflate#onData(chunk) -> Void\n * - chunk (Uint8Array|String): output data. When string output requested,\n * each chunk will be string.\n *\n * By default, stores data blocks in `chunks[]` property and glue\n * those in `onEnd`. Override this handler, if you need another behaviour.\n **/\nInflate$1.prototype.onData = function (chunk) {\n this.chunks.push(chunk);\n};\n\n\n/**\n * Inflate#onEnd(status) -> Void\n * - status (Number): inflate status. 0 (Z_OK) on success,\n * other if not.\n *\n * Called either after you tell inflate that the input stream is\n * complete (Z_FINISH). By default - join collected chunks,\n * free memory and fill `results` / `err` properties.\n **/\nInflate$1.prototype.onEnd = function (status) {\n // On success - join\n if (status === Z_OK) {\n if (this.options.to === 'string') {\n this.result = this.chunks.join('');\n } else {\n this.result = common.flattenChunks(this.chunks);\n }\n }\n this.chunks = [];\n this.err = status;\n this.msg = this.strm.msg;\n};\n\n\n/**\n * inflate(data[, options]) -> Uint8Array|String\n * - data (Uint8Array): input data to decompress.\n * - options (Object): zlib inflate options.\n *\n * Decompress `data` with inflate/ungzip and `options`. Autodetect\n * format via wrapper header by default. That's why we don't provide\n * separate `ungzip` method.\n *\n * Supported options are:\n *\n * - windowBits\n *\n * [http://zlib.net/manual.html#Advanced](http://zlib.net/manual.html#Advanced)\n * for more information.\n *\n * Sugar (options):\n *\n * - `raw` (Boolean) - say that we work with raw stream, if you don't wish to specify\n * negative windowBits implicitly.\n * - `to` (String) - if equal to 'string', then result will be converted\n * from utf8 to utf16 (javascript) string. When string output requested,\n * chunk length can differ from `chunkSize`, depending on content.\n *\n *\n * ##### Example:\n *\n * ```javascript\n * const pako = require('pako');\n * const input = pako.deflate(new Uint8Array([1,2,3,4,5,6,7,8,9]));\n * let output;\n *\n * try {\n * output = pako.inflate(input);\n * } catch (err) {\n * console.log(err);\n * }\n * ```\n **/\nfunction inflate$1(input, options) {\n const inflator = new Inflate$1(options);\n\n inflator.push(input);\n\n // That will never happens, if you don't cheat with options :)\n if (inflator.err) throw inflator.msg || messages[inflator.err];\n\n return inflator.result;\n}\n\n\n/**\n * inflateRaw(data[, options]) -> Uint8Array|String\n * - data (Uint8Array): input data to decompress.\n * - options (Object): zlib inflate options.\n *\n * The same as [[inflate]], but creates raw data, without wrapper\n * (header and adler32 crc).\n **/\nfunction inflateRaw$1(input, options) {\n options = options || {};\n options.raw = true;\n return inflate$1(input, options);\n}\n\n\n/**\n * ungzip(data[, options]) -> Uint8Array|String\n * - data (Uint8Array): input data to decompress.\n * - options (Object): zlib inflate options.\n *\n * Just shortcut to [[inflate]], because it autodetects format\n * by header.content. Done for convenience.\n **/\n\n\nvar Inflate_1$1 = Inflate$1;\nvar inflate_2 = inflate$1;\nvar inflateRaw_1$1 = inflateRaw$1;\nvar ungzip$1 = inflate$1;\nvar constants = constants$2;\n\nvar inflate_1$1 = {\n\tInflate: Inflate_1$1,\n\tinflate: inflate_2,\n\tinflateRaw: inflateRaw_1$1,\n\tungzip: ungzip$1,\n\tconstants: constants\n};\n\nconst { Deflate, deflate, deflateRaw, gzip } = deflate_1$1;\n\nconst { Inflate, inflate, inflateRaw, ungzip } = inflate_1$1;\n\n\n\nvar Deflate_1 = Deflate;\nvar deflate_1 = deflate;\nvar deflateRaw_1 = deflateRaw;\nvar gzip_1 = gzip;\nvar Inflate_1 = Inflate;\nvar inflate_1 = inflate;\nvar inflateRaw_1 = inflateRaw;\nvar ungzip_1 = ungzip;\nvar constants_1 = constants$2;\n\nvar pako = {\n\tDeflate: Deflate_1,\n\tdeflate: deflate_1,\n\tdeflateRaw: deflateRaw_1,\n\tgzip: gzip_1,\n\tInflate: Inflate_1,\n\tinflate: inflate_1,\n\tinflateRaw: inflateRaw_1,\n\tungzip: ungzip_1,\n\tconstants: constants_1\n};\n\nexport { Deflate_1 as Deflate, Inflate_1 as Inflate, constants_1 as constants, pako as default, deflate_1 as deflate, deflateRaw_1 as deflateRaw, gzip_1 as gzip, inflate_1 as inflate, inflateRaw_1 as inflateRaw, ungzip_1 as ungzip };\n","/**\n * Common utilities\n * @module glMatrix\n */\n// Configuration Constants\nexport var EPSILON = 0.000001;\nexport var ARRAY_TYPE = typeof Float32Array !== 'undefined' ? Float32Array : Array;\nexport var RANDOM = Math.random;\n/**\n * Sets the type of array used when creating new vectors and matrices\n *\n * @param {Float32ArrayConstructor | ArrayConstructor} type Array type, such as Float32Array or Array\n */\n\nexport function setMatrixArrayType(type) {\n ARRAY_TYPE = type;\n}\nvar degree = Math.PI / 180;\n/**\n * Convert Degree To Radian\n *\n * @param {Number} a Angle in Degrees\n */\n\nexport function toRadian(a) {\n return a * degree;\n}\n/**\n * Tests whether or not the arguments have approximately the same value, within an absolute\n * or relative tolerance of glMatrix.EPSILON (an absolute tolerance is used for values less\n * than or equal to 1.0, and a relative tolerance is used for larger values)\n *\n * @param {Number} a The first number to test.\n * @param {Number} b The second number to test.\n * @returns {Boolean} True if the numbers are approximately equal, false otherwise.\n */\n\nexport function equals(a, b) {\n return Math.abs(a - b) <= EPSILON * Math.max(1.0, Math.abs(a), Math.abs(b));\n}\nif (!Math.hypot) Math.hypot = function () {\n var y = 0,\n i = arguments.length;\n\n while (i--) {\n y += arguments[i] * arguments[i];\n }\n\n return Math.sqrt(y);\n};","import * as glMatrix from \"./common.js\";\n/**\n * 4x4 Matrix Format: column-major, when typed out it looks like row-major The matrices are being post multiplied.\n * @module mat4\n */\n\n/**\n * Creates a new identity mat4\n *\n * @returns {mat4} a new 4x4 matrix\n */\n\nexport function create() {\n var out = new glMatrix.ARRAY_TYPE(16);\n\n if (glMatrix.ARRAY_TYPE != Float32Array) {\n out[1] = 0;\n out[2] = 0;\n out[3] = 0;\n out[4] = 0;\n out[6] = 0;\n out[7] = 0;\n out[8] = 0;\n out[9] = 0;\n out[11] = 0;\n out[12] = 0;\n out[13] = 0;\n out[14] = 0;\n }\n\n out[0] = 1;\n out[5] = 1;\n out[10] = 1;\n out[15] = 1;\n return out;\n}\n/**\n * Creates a new mat4 initialized with values from an existing matrix\n *\n * @param {ReadonlyMat4} a matrix to clone\n * @returns {mat4} a new 4x4 matrix\n */\n\nexport function clone(a) {\n var out = new glMatrix.ARRAY_TYPE(16);\n out[0] = a[0];\n out[1] = a[1];\n out[2] = a[2];\n out[3] = a[3];\n out[4] = a[4];\n out[5] = a[5];\n out[6] = a[6];\n out[7] = a[7];\n out[8] = a[8];\n out[9] = a[9];\n out[10] = a[10];\n out[11] = a[11];\n out[12] = a[12];\n out[13] = a[13];\n out[14] = a[14];\n out[15] = a[15];\n return out;\n}\n/**\n * Copy the values from one mat4 to another\n *\n * @param {mat4} out the receiving matrix\n * @param {ReadonlyMat4} a the source matrix\n * @returns {mat4} out\n */\n\nexport function copy(out, a) {\n out[0] = a[0];\n out[1] = a[1];\n out[2] = a[2];\n out[3] = a[3];\n out[4] = a[4];\n out[5] = a[5];\n out[6] = a[6];\n out[7] = a[7];\n out[8] = a[8];\n out[9] = a[9];\n out[10] = a[10];\n out[11] = a[11];\n out[12] = a[12];\n out[13] = a[13];\n out[14] = a[14];\n out[15] = a[15];\n return out;\n}\n/**\n * Create a new mat4 with the given values\n *\n * @param {Number} m00 Component in column 0, row 0 position (index 0)\n * @param {Number} m01 Component in column 0, row 1 position (index 1)\n * @param {Number} m02 Component in column 0, row 2 position (index 2)\n * @param {Number} m03 Component in column 0, row 3 position (index 3)\n * @param {Number} m10 Component in column 1, row 0 position (index 4)\n * @param {Number} m11 Component in column 1, row 1 position (index 5)\n * @param {Number} m12 Component in column 1, row 2 position (index 6)\n * @param {Number} m13 Component in column 1, row 3 position (index 7)\n * @param {Number} m20 Component in column 2, row 0 position (index 8)\n * @param {Number} m21 Component in column 2, row 1 position (index 9)\n * @param {Number} m22 Component in column 2, row 2 position (index 10)\n * @param {Number} m23 Component in column 2, row 3 position (index 11)\n * @param {Number} m30 Component in column 3, row 0 position (index 12)\n * @param {Number} m31 Component in column 3, row 1 position (index 13)\n * @param {Number} m32 Component in column 3, row 2 position (index 14)\n * @param {Number} m33 Component in column 3, row 3 position (index 15)\n * @returns {mat4} A new mat4\n */\n\nexport function fromValues(m00, m01, m02, m03, m10, m11, m12, m13, m20, m21, m22, m23, m30, m31, m32, m33) {\n var out = new glMatrix.ARRAY_TYPE(16);\n out[0] = m00;\n out[1] = m01;\n out[2] = m02;\n out[3] = m03;\n out[4] = m10;\n out[5] = m11;\n out[6] = m12;\n out[7] = m13;\n out[8] = m20;\n out[9] = m21;\n out[10] = m22;\n out[11] = m23;\n out[12] = m30;\n out[13] = m31;\n out[14] = m32;\n out[15] = m33;\n return out;\n}\n/**\n * Set the components of a mat4 to the given values\n *\n * @param {mat4} out the receiving matrix\n * @param {Number} m00 Component in column 0, row 0 position (index 0)\n * @param {Number} m01 Component in column 0, row 1 position (index 1)\n * @param {Number} m02 Component in column 0, row 2 position (index 2)\n * @param {Number} m03 Component in column 0, row 3 position (index 3)\n * @param {Number} m10 Component in column 1, row 0 position (index 4)\n * @param {Number} m11 Component in column 1, row 1 position (index 5)\n * @param {Number} m12 Component in column 1, row 2 position (index 6)\n * @param {Number} m13 Component in column 1, row 3 position (index 7)\n * @param {Number} m20 Component in column 2, row 0 position (index 8)\n * @param {Number} m21 Component in column 2, row 1 position (index 9)\n * @param {Number} m22 Component in column 2, row 2 position (index 10)\n * @param {Number} m23 Component in column 2, row 3 position (index 11)\n * @param {Number} m30 Component in column 3, row 0 position (index 12)\n * @param {Number} m31 Component in column 3, row 1 position (index 13)\n * @param {Number} m32 Component in column 3, row 2 position (index 14)\n * @param {Number} m33 Component in column 3, row 3 position (index 15)\n * @returns {mat4} out\n */\n\nexport function set(out, m00, m01, m02, m03, m10, m11, m12, m13, m20, m21, m22, m23, m30, m31, m32, m33) {\n out[0] = m00;\n out[1] = m01;\n out[2] = m02;\n out[3] = m03;\n out[4] = m10;\n out[5] = m11;\n out[6] = m12;\n out[7] = m13;\n out[8] = m20;\n out[9] = m21;\n out[10] = m22;\n out[11] = m23;\n out[12] = m30;\n out[13] = m31;\n out[14] = m32;\n out[15] = m33;\n return out;\n}\n/**\n * Set a mat4 to the identity matrix\n *\n * @param {mat4} out the receiving matrix\n * @returns {mat4} out\n */\n\nexport function identity(out) {\n out[0] = 1;\n out[1] = 0;\n out[2] = 0;\n out[3] = 0;\n out[4] = 0;\n out[5] = 1;\n out[6] = 0;\n out[7] = 0;\n out[8] = 0;\n out[9] = 0;\n out[10] = 1;\n out[11] = 0;\n out[12] = 0;\n out[13] = 0;\n out[14] = 0;\n out[15] = 1;\n return out;\n}\n/**\n * Transpose the values of a mat4\n *\n * @param {mat4} out the receiving matrix\n * @param {ReadonlyMat4} a the source matrix\n * @returns {mat4} out\n */\n\nexport function transpose(out, a) {\n // If we are transposing ourselves we can skip a few steps but have to cache some values\n if (out === a) {\n var a01 = a[1],\n a02 = a[2],\n a03 = a[3];\n var a12 = a[6],\n a13 = a[7];\n var a23 = a[11];\n out[1] = a[4];\n out[2] = a[8];\n out[3] = a[12];\n out[4] = a01;\n out[6] = a[9];\n out[7] = a[13];\n out[8] = a02;\n out[9] = a12;\n out[11] = a[14];\n out[12] = a03;\n out[13] = a13;\n out[14] = a23;\n } else {\n out[0] = a[0];\n out[1] = a[4];\n out[2] = a[8];\n out[3] = a[12];\n out[4] = a[1];\n out[5] = a[5];\n out[6] = a[9];\n out[7] = a[13];\n out[8] = a[2];\n out[9] = a[6];\n out[10] = a[10];\n out[11] = a[14];\n out[12] = a[3];\n out[13] = a[7];\n out[14] = a[11];\n out[15] = a[15];\n }\n\n return out;\n}\n/**\n * Inverts a mat4\n *\n * @param {mat4} out the receiving matrix\n * @param {ReadonlyMat4} a the source matrix\n * @returns {mat4} out\n */\n\nexport function invert(out, a) {\n var a00 = a[0],\n a01 = a[1],\n a02 = a[2],\n a03 = a[3];\n var a10 = a[4],\n a11 = a[5],\n a12 = a[6],\n a13 = a[7];\n var a20 = a[8],\n a21 = a[9],\n a22 = a[10],\n a23 = a[11];\n var a30 = a[12],\n a31 = a[13],\n a32 = a[14],\n a33 = a[15];\n var b00 = a00 * a11 - a01 * a10;\n var b01 = a00 * a12 - a02 * a10;\n var b02 = a00 * a13 - a03 * a10;\n var b03 = a01 * a12 - a02 * a11;\n var b04 = a01 * a13 - a03 * a11;\n var b05 = a02 * a13 - a03 * a12;\n var b06 = a20 * a31 - a21 * a30;\n var b07 = a20 * a32 - a22 * a30;\n var b08 = a20 * a33 - a23 * a30;\n var b09 = a21 * a32 - a22 * a31;\n var b10 = a21 * a33 - a23 * a31;\n var b11 = a22 * a33 - a23 * a32; // Calculate the determinant\n\n var det = b00 * b11 - b01 * b10 + b02 * b09 + b03 * b08 - b04 * b07 + b05 * b06;\n\n if (!det) {\n return null;\n }\n\n det = 1.0 / det;\n out[0] = (a11 * b11 - a12 * b10 + a13 * b09) * det;\n out[1] = (a02 * b10 - a01 * b11 - a03 * b09) * det;\n out[2] = (a31 * b05 - a32 * b04 + a33 * b03) * det;\n out[3] = (a22 * b04 - a21 * b05 - a23 * b03) * det;\n out[4] = (a12 * b08 - a10 * b11 - a13 * b07) * det;\n out[5] = (a00 * b11 - a02 * b08 + a03 * b07) * det;\n out[6] = (a32 * b02 - a30 * b05 - a33 * b01) * det;\n out[7] = (a20 * b05 - a22 * b02 + a23 * b01) * det;\n out[8] = (a10 * b10 - a11 * b08 + a13 * b06) * det;\n out[9] = (a01 * b08 - a00 * b10 - a03 * b06) * det;\n out[10] = (a30 * b04 - a31 * b02 + a33 * b00) * det;\n out[11] = (a21 * b02 - a20 * b04 - a23 * b00) * det;\n out[12] = (a11 * b07 - a10 * b09 - a12 * b06) * det;\n out[13] = (a00 * b09 - a01 * b07 + a02 * b06) * det;\n out[14] = (a31 * b01 - a30 * b03 - a32 * b00) * det;\n out[15] = (a20 * b03 - a21 * b01 + a22 * b00) * det;\n return out;\n}\n/**\n * Calculates the adjugate of a mat4\n *\n * @param {mat4} out the receiving matrix\n * @param {ReadonlyMat4} a the source matrix\n * @returns {mat4} out\n */\n\nexport function adjoint(out, a) {\n var a00 = a[0],\n a01 = a[1],\n a02 = a[2],\n a03 = a[3];\n var a10 = a[4],\n a11 = a[5],\n a12 = a[6],\n a13 = a[7];\n var a20 = a[8],\n a21 = a[9],\n a22 = a[10],\n a23 = a[11];\n var a30 = a[12],\n a31 = a[13],\n a32 = a[14],\n a33 = a[15];\n out[0] = a11 * (a22 * a33 - a23 * a32) - a21 * (a12 * a33 - a13 * a32) + a31 * (a12 * a23 - a13 * a22);\n out[1] = -(a01 * (a22 * a33 - a23 * a32) - a21 * (a02 * a33 - a03 * a32) + a31 * (a02 * a23 - a03 * a22));\n out[2] = a01 * (a12 * a33 - a13 * a32) - a11 * (a02 * a33 - a03 * a32) + a31 * (a02 * a13 - a03 * a12);\n out[3] = -(a01 * (a12 * a23 - a13 * a22) - a11 * (a02 * a23 - a03 * a22) + a21 * (a02 * a13 - a03 * a12));\n out[4] = -(a10 * (a22 * a33 - a23 * a32) - a20 * (a12 * a33 - a13 * a32) + a30 * (a12 * a23 - a13 * a22));\n out[5] = a00 * (a22 * a33 - a23 * a32) - a20 * (a02 * a33 - a03 * a32) + a30 * (a02 * a23 - a03 * a22);\n out[6] = -(a00 * (a12 * a33 - a13 * a32) - a10 * (a02 * a33 - a03 * a32) + a30 * (a02 * a13 - a03 * a12));\n out[7] = a00 * (a12 * a23 - a13 * a22) - a10 * (a02 * a23 - a03 * a22) + a20 * (a02 * a13 - a03 * a12);\n out[8] = a10 * (a21 * a33 - a23 * a31) - a20 * (a11 * a33 - a13 * a31) + a30 * (a11 * a23 - a13 * a21);\n out[9] = -(a00 * (a21 * a33 - a23 * a31) - a20 * (a01 * a33 - a03 * a31) + a30 * (a01 * a23 - a03 * a21));\n out[10] = a00 * (a11 * a33 - a13 * a31) - a10 * (a01 * a33 - a03 * a31) + a30 * (a01 * a13 - a03 * a11);\n out[11] = -(a00 * (a11 * a23 - a13 * a21) - a10 * (a01 * a23 - a03 * a21) + a20 * (a01 * a13 - a03 * a11));\n out[12] = -(a10 * (a21 * a32 - a22 * a31) - a20 * (a11 * a32 - a12 * a31) + a30 * (a11 * a22 - a12 * a21));\n out[13] = a00 * (a21 * a32 - a22 * a31) - a20 * (a01 * a32 - a02 * a31) + a30 * (a01 * a22 - a02 * a21);\n out[14] = -(a00 * (a11 * a32 - a12 * a31) - a10 * (a01 * a32 - a02 * a31) + a30 * (a01 * a12 - a02 * a11));\n out[15] = a00 * (a11 * a22 - a12 * a21) - a10 * (a01 * a22 - a02 * a21) + a20 * (a01 * a12 - a02 * a11);\n return out;\n}\n/**\n * Calculates the determinant of a mat4\n *\n * @param {ReadonlyMat4} a the source matrix\n * @returns {Number} determinant of a\n */\n\nexport function determinant(a) {\n var a00 = a[0],\n a01 = a[1],\n a02 = a[2],\n a03 = a[3];\n var a10 = a[4],\n a11 = a[5],\n a12 = a[6],\n a13 = a[7];\n var a20 = a[8],\n a21 = a[9],\n a22 = a[10],\n a23 = a[11];\n var a30 = a[12],\n a31 = a[13],\n a32 = a[14],\n a33 = a[15];\n var b00 = a00 * a11 - a01 * a10;\n var b01 = a00 * a12 - a02 * a10;\n var b02 = a00 * a13 - a03 * a10;\n var b03 = a01 * a12 - a02 * a11;\n var b04 = a01 * a13 - a03 * a11;\n var b05 = a02 * a13 - a03 * a12;\n var b06 = a20 * a31 - a21 * a30;\n var b07 = a20 * a32 - a22 * a30;\n var b08 = a20 * a33 - a23 * a30;\n var b09 = a21 * a32 - a22 * a31;\n var b10 = a21 * a33 - a23 * a31;\n var b11 = a22 * a33 - a23 * a32; // Calculate the determinant\n\n return b00 * b11 - b01 * b10 + b02 * b09 + b03 * b08 - b04 * b07 + b05 * b06;\n}\n/**\n * Multiplies two mat4s\n *\n * @param {mat4} out the receiving matrix\n * @param {ReadonlyMat4} a the first operand\n * @param {ReadonlyMat4} b the second operand\n * @returns {mat4} out\n */\n\nexport function multiply(out, a, b) {\n var a00 = a[0],\n a01 = a[1],\n a02 = a[2],\n a03 = a[3];\n var a10 = a[4],\n a11 = a[5],\n a12 = a[6],\n a13 = a[7];\n var a20 = a[8],\n a21 = a[9],\n a22 = a[10],\n a23 = a[11];\n var a30 = a[12],\n a31 = a[13],\n a32 = a[14],\n a33 = a[15]; // Cache only the current line of the second matrix\n\n var b0 = b[0],\n b1 = b[1],\n b2 = b[2],\n b3 = b[3];\n out[0] = b0 * a00 + b1 * a10 + b2 * a20 + b3 * a30;\n out[1] = b0 * a01 + b1 * a11 + b2 * a21 + b3 * a31;\n out[2] = b0 * a02 + b1 * a12 + b2 * a22 + b3 * a32;\n out[3] = b0 * a03 + b1 * a13 + b2 * a23 + b3 * a33;\n b0 = b[4];\n b1 = b[5];\n b2 = b[6];\n b3 = b[7];\n out[4] = b0 * a00 + b1 * a10 + b2 * a20 + b3 * a30;\n out[5] = b0 * a01 + b1 * a11 + b2 * a21 + b3 * a31;\n out[6] = b0 * a02 + b1 * a12 + b2 * a22 + b3 * a32;\n out[7] = b0 * a03 + b1 * a13 + b2 * a23 + b3 * a33;\n b0 = b[8];\n b1 = b[9];\n b2 = b[10];\n b3 = b[11];\n out[8] = b0 * a00 + b1 * a10 + b2 * a20 + b3 * a30;\n out[9] = b0 * a01 + b1 * a11 + b2 * a21 + b3 * a31;\n out[10] = b0 * a02 + b1 * a12 + b2 * a22 + b3 * a32;\n out[11] = b0 * a03 + b1 * a13 + b2 * a23 + b3 * a33;\n b0 = b[12];\n b1 = b[13];\n b2 = b[14];\n b3 = b[15];\n out[12] = b0 * a00 + b1 * a10 + b2 * a20 + b3 * a30;\n out[13] = b0 * a01 + b1 * a11 + b2 * a21 + b3 * a31;\n out[14] = b0 * a02 + b1 * a12 + b2 * a22 + b3 * a32;\n out[15] = b0 * a03 + b1 * a13 + b2 * a23 + b3 * a33;\n return out;\n}\n/**\n * Translate a mat4 by the given vector\n *\n * @param {mat4} out the receiving matrix\n * @param {ReadonlyMat4} a the matrix to translate\n * @param {ReadonlyVec3} v vector to translate by\n * @returns {mat4} out\n */\n\nexport function translate(out, a, v) {\n var x = v[0],\n y = v[1],\n z = v[2];\n var a00, a01, a02, a03;\n var a10, a11, a12, a13;\n var a20, a21, a22, a23;\n\n if (a === out) {\n out[12] = a[0] * x + a[4] * y + a[8] * z + a[12];\n out[13] = a[1] * x + a[5] * y + a[9] * z + a[13];\n out[14] = a[2] * x + a[6] * y + a[10] * z + a[14];\n out[15] = a[3] * x + a[7] * y + a[11] * z + a[15];\n } else {\n a00 = a[0];\n a01 = a[1];\n a02 = a[2];\n a03 = a[3];\n a10 = a[4];\n a11 = a[5];\n a12 = a[6];\n a13 = a[7];\n a20 = a[8];\n a21 = a[9];\n a22 = a[10];\n a23 = a[11];\n out[0] = a00;\n out[1] = a01;\n out[2] = a02;\n out[3] = a03;\n out[4] = a10;\n out[5] = a11;\n out[6] = a12;\n out[7] = a13;\n out[8] = a20;\n out[9] = a21;\n out[10] = a22;\n out[11] = a23;\n out[12] = a00 * x + a10 * y + a20 * z + a[12];\n out[13] = a01 * x + a11 * y + a21 * z + a[13];\n out[14] = a02 * x + a12 * y + a22 * z + a[14];\n out[15] = a03 * x + a13 * y + a23 * z + a[15];\n }\n\n return out;\n}\n/**\n * Scales the mat4 by the dimensions in the given vec3 not using vectorization\n *\n * @param {mat4} out the receiving matrix\n * @param {ReadonlyMat4} a the matrix to scale\n * @param {ReadonlyVec3} v the vec3 to scale the matrix by\n * @returns {mat4} out\n **/\n\nexport function scale(out, a, v) {\n var x = v[0],\n y = v[1],\n z = v[2];\n out[0] = a[0] * x;\n out[1] = a[1] * x;\n out[2] = a[2] * x;\n out[3] = a[3] * x;\n out[4] = a[4] * y;\n out[5] = a[5] * y;\n out[6] = a[6] * y;\n out[7] = a[7] * y;\n out[8] = a[8] * z;\n out[9] = a[9] * z;\n out[10] = a[10] * z;\n out[11] = a[11] * z;\n out[12] = a[12];\n out[13] = a[13];\n out[14] = a[14];\n out[15] = a[15];\n return out;\n}\n/**\n * Rotates a mat4 by the given angle around the given axis\n *\n * @param {mat4} out the receiving matrix\n * @param {ReadonlyMat4} a the matrix to rotate\n * @param {Number} rad the angle to rotate the matrix by\n * @param {ReadonlyVec3} axis the axis to rotate around\n * @returns {mat4} out\n */\n\nexport function rotate(out, a, rad, axis) {\n var x = axis[0],\n y = axis[1],\n z = axis[2];\n var len = Math.hypot(x, y, z);\n var s, c, t;\n var a00, a01, a02, a03;\n var a10, a11, a12, a13;\n var a20, a21, a22, a23;\n var b00, b01, b02;\n var b10, b11, b12;\n var b20, b21, b22;\n\n if (len < glMatrix.EPSILON) {\n return null;\n }\n\n len = 1 / len;\n x *= len;\n y *= len;\n z *= len;\n s = Math.sin(rad);\n c = Math.cos(rad);\n t = 1 - c;\n a00 = a[0];\n a01 = a[1];\n a02 = a[2];\n a03 = a[3];\n a10 = a[4];\n a11 = a[5];\n a12 = a[6];\n a13 = a[7];\n a20 = a[8];\n a21 = a[9];\n a22 = a[10];\n a23 = a[11]; // Construct the elements of the rotation matrix\n\n b00 = x * x * t + c;\n b01 = y * x * t + z * s;\n b02 = z * x * t - y * s;\n b10 = x * y * t - z * s;\n b11 = y * y * t + c;\n b12 = z * y * t + x * s;\n b20 = x * z * t + y * s;\n b21 = y * z * t - x * s;\n b22 = z * z * t + c; // Perform rotation-specific matrix multiplication\n\n out[0] = a00 * b00 + a10 * b01 + a20 * b02;\n out[1] = a01 * b00 + a11 * b01 + a21 * b02;\n out[2] = a02 * b00 + a12 * b01 + a22 * b02;\n out[3] = a03 * b00 + a13 * b01 + a23 * b02;\n out[4] = a00 * b10 + a10 * b11 + a20 * b12;\n out[5] = a01 * b10 + a11 * b11 + a21 * b12;\n out[6] = a02 * b10 + a12 * b11 + a22 * b12;\n out[7] = a03 * b10 + a13 * b11 + a23 * b12;\n out[8] = a00 * b20 + a10 * b21 + a20 * b22;\n out[9] = a01 * b20 + a11 * b21 + a21 * b22;\n out[10] = a02 * b20 + a12 * b21 + a22 * b22;\n out[11] = a03 * b20 + a13 * b21 + a23 * b22;\n\n if (a !== out) {\n // If the source and destination differ, copy the unchanged last row\n out[12] = a[12];\n out[13] = a[13];\n out[14] = a[14];\n out[15] = a[15];\n }\n\n return out;\n}\n/**\n * Rotates a matrix by the given angle around the X axis\n *\n * @param {mat4} out the receiving matrix\n * @param {ReadonlyMat4} a the matrix to rotate\n * @param {Number} rad the angle to rotate the matrix by\n * @returns {mat4} out\n */\n\nexport function rotateX(out, a, rad) {\n var s = Math.sin(rad);\n var c = Math.cos(rad);\n var a10 = a[4];\n var a11 = a[5];\n var a12 = a[6];\n var a13 = a[7];\n var a20 = a[8];\n var a21 = a[9];\n var a22 = a[10];\n var a23 = a[11];\n\n if (a !== out) {\n // If the source and destination differ, copy the unchanged rows\n out[0] = a[0];\n out[1] = a[1];\n out[2] = a[2];\n out[3] = a[3];\n out[12] = a[12];\n out[13] = a[13];\n out[14] = a[14];\n out[15] = a[15];\n } // Perform axis-specific matrix multiplication\n\n\n out[4] = a10 * c + a20 * s;\n out[5] = a11 * c + a21 * s;\n out[6] = a12 * c + a22 * s;\n out[7] = a13 * c + a23 * s;\n out[8] = a20 * c - a10 * s;\n out[9] = a21 * c - a11 * s;\n out[10] = a22 * c - a12 * s;\n out[11] = a23 * c - a13 * s;\n return out;\n}\n/**\n * Rotates a matrix by the given angle around the Y axis\n *\n * @param {mat4} out the receiving matrix\n * @param {ReadonlyMat4} a the matrix to rotate\n * @param {Number} rad the angle to rotate the matrix by\n * @returns {mat4} out\n */\n\nexport function rotateY(out, a, rad) {\n var s = Math.sin(rad);\n var c = Math.cos(rad);\n var a00 = a[0];\n var a01 = a[1];\n var a02 = a[2];\n var a03 = a[3];\n var a20 = a[8];\n var a21 = a[9];\n var a22 = a[10];\n var a23 = a[11];\n\n if (a !== out) {\n // If the source and destination differ, copy the unchanged rows\n out[4] = a[4];\n out[5] = a[5];\n out[6] = a[6];\n out[7] = a[7];\n out[12] = a[12];\n out[13] = a[13];\n out[14] = a[14];\n out[15] = a[15];\n } // Perform axis-specific matrix multiplication\n\n\n out[0] = a00 * c - a20 * s;\n out[1] = a01 * c - a21 * s;\n out[2] = a02 * c - a22 * s;\n out[3] = a03 * c - a23 * s;\n out[8] = a00 * s + a20 * c;\n out[9] = a01 * s + a21 * c;\n out[10] = a02 * s + a22 * c;\n out[11] = a03 * s + a23 * c;\n return out;\n}\n/**\n * Rotates a matrix by the given angle around the Z axis\n *\n * @param {mat4} out the receiving matrix\n * @param {ReadonlyMat4} a the matrix to rotate\n * @param {Number} rad the angle to rotate the matrix by\n * @returns {mat4} out\n */\n\nexport function rotateZ(out, a, rad) {\n var s = Math.sin(rad);\n var c = Math.cos(rad);\n var a00 = a[0];\n var a01 = a[1];\n var a02 = a[2];\n var a03 = a[3];\n var a10 = a[4];\n var a11 = a[5];\n var a12 = a[6];\n var a13 = a[7];\n\n if (a !== out) {\n // If the source and destination differ, copy the unchanged last row\n out[8] = a[8];\n out[9] = a[9];\n out[10] = a[10];\n out[11] = a[11];\n out[12] = a[12];\n out[13] = a[13];\n out[14] = a[14];\n out[15] = a[15];\n } // Perform axis-specific matrix multiplication\n\n\n out[0] = a00 * c + a10 * s;\n out[1] = a01 * c + a11 * s;\n out[2] = a02 * c + a12 * s;\n out[3] = a03 * c + a13 * s;\n out[4] = a10 * c - a00 * s;\n out[5] = a11 * c - a01 * s;\n out[6] = a12 * c - a02 * s;\n out[7] = a13 * c - a03 * s;\n return out;\n}\n/**\n * Creates a matrix from a vector translation\n * This is equivalent to (but much faster than):\n *\n * mat4.identity(dest);\n * mat4.translate(dest, dest, vec);\n *\n * @param {mat4} out mat4 receiving operation result\n * @param {ReadonlyVec3} v Translation vector\n * @returns {mat4} out\n */\n\nexport function fromTranslation(out, v) {\n out[0] = 1;\n out[1] = 0;\n out[2] = 0;\n out[3] = 0;\n out[4] = 0;\n out[5] = 1;\n out[6] = 0;\n out[7] = 0;\n out[8] = 0;\n out[9] = 0;\n out[10] = 1;\n out[11] = 0;\n out[12] = v[0];\n out[13] = v[1];\n out[14] = v[2];\n out[15] = 1;\n return out;\n}\n/**\n * Creates a matrix from a vector scaling\n * This is equivalent to (but much faster than):\n *\n * mat4.identity(dest);\n * mat4.scale(dest, dest, vec);\n *\n * @param {mat4} out mat4 receiving operation result\n * @param {ReadonlyVec3} v Scaling vector\n * @returns {mat4} out\n */\n\nexport function fromScaling(out, v) {\n out[0] = v[0];\n out[1] = 0;\n out[2] = 0;\n out[3] = 0;\n out[4] = 0;\n out[5] = v[1];\n out[6] = 0;\n out[7] = 0;\n out[8] = 0;\n out[9] = 0;\n out[10] = v[2];\n out[11] = 0;\n out[12] = 0;\n out[13] = 0;\n out[14] = 0;\n out[15] = 1;\n return out;\n}\n/**\n * Creates a matrix from a given angle around a given axis\n * This is equivalent to (but much faster than):\n *\n * mat4.identity(dest);\n * mat4.rotate(dest, dest, rad, axis);\n *\n * @param {mat4} out mat4 receiving operation result\n * @param {Number} rad the angle to rotate the matrix by\n * @param {ReadonlyVec3} axis the axis to rotate around\n * @returns {mat4} out\n */\n\nexport function fromRotation(out, rad, axis) {\n var x = axis[0],\n y = axis[1],\n z = axis[2];\n var len = Math.hypot(x, y, z);\n var s, c, t;\n\n if (len < glMatrix.EPSILON) {\n return null;\n }\n\n len = 1 / len;\n x *= len;\n y *= len;\n z *= len;\n s = Math.sin(rad);\n c = Math.cos(rad);\n t = 1 - c; // Perform rotation-specific matrix multiplication\n\n out[0] = x * x * t + c;\n out[1] = y * x * t + z * s;\n out[2] = z * x * t - y * s;\n out[3] = 0;\n out[4] = x * y * t - z * s;\n out[5] = y * y * t + c;\n out[6] = z * y * t + x * s;\n out[7] = 0;\n out[8] = x * z * t + y * s;\n out[9] = y * z * t - x * s;\n out[10] = z * z * t + c;\n out[11] = 0;\n out[12] = 0;\n out[13] = 0;\n out[14] = 0;\n out[15] = 1;\n return out;\n}\n/**\n * Creates a matrix from the given angle around the X axis\n * This is equivalent to (but much faster than):\n *\n * mat4.identity(dest);\n * mat4.rotateX(dest, dest, rad);\n *\n * @param {mat4} out mat4 receiving operation result\n * @param {Number} rad the angle to rotate the matrix by\n * @returns {mat4} out\n */\n\nexport function fromXRotation(out, rad) {\n var s = Math.sin(rad);\n var c = Math.cos(rad); // Perform axis-specific matrix multiplication\n\n out[0] = 1;\n out[1] = 0;\n out[2] = 0;\n out[3] = 0;\n out[4] = 0;\n out[5] = c;\n out[6] = s;\n out[7] = 0;\n out[8] = 0;\n out[9] = -s;\n out[10] = c;\n out[11] = 0;\n out[12] = 0;\n out[13] = 0;\n out[14] = 0;\n out[15] = 1;\n return out;\n}\n/**\n * Creates a matrix from the given angle around the Y axis\n * This is equivalent to (but much faster than):\n *\n * mat4.identity(dest);\n * mat4.rotateY(dest, dest, rad);\n *\n * @param {mat4} out mat4 receiving operation result\n * @param {Number} rad the angle to rotate the matrix by\n * @returns {mat4} out\n */\n\nexport function fromYRotation(out, rad) {\n var s = Math.sin(rad);\n var c = Math.cos(rad); // Perform axis-specific matrix multiplication\n\n out[0] = c;\n out[1] = 0;\n out[2] = -s;\n out[3] = 0;\n out[4] = 0;\n out[5] = 1;\n out[6] = 0;\n out[7] = 0;\n out[8] = s;\n out[9] = 0;\n out[10] = c;\n out[11] = 0;\n out[12] = 0;\n out[13] = 0;\n out[14] = 0;\n out[15] = 1;\n return out;\n}\n/**\n * Creates a matrix from the given angle around the Z axis\n * This is equivalent to (but much faster than):\n *\n * mat4.identity(dest);\n * mat4.rotateZ(dest, dest, rad);\n *\n * @param {mat4} out mat4 receiving operation result\n * @param {Number} rad the angle to rotate the matrix by\n * @returns {mat4} out\n */\n\nexport function fromZRotation(out, rad) {\n var s = Math.sin(rad);\n var c = Math.cos(rad); // Perform axis-specific matrix multiplication\n\n out[0] = c;\n out[1] = s;\n out[2] = 0;\n out[3] = 0;\n out[4] = -s;\n out[5] = c;\n out[6] = 0;\n out[7] = 0;\n out[8] = 0;\n out[9] = 0;\n out[10] = 1;\n out[11] = 0;\n out[12] = 0;\n out[13] = 0;\n out[14] = 0;\n out[15] = 1;\n return out;\n}\n/**\n * Creates a matrix from a quaternion rotation and vector translation\n * This is equivalent to (but much faster than):\n *\n * mat4.identity(dest);\n * mat4.translate(dest, vec);\n * let quatMat = mat4.create();\n * quat4.toMat4(quat, quatMat);\n * mat4.multiply(dest, quatMat);\n *\n * @param {mat4} out mat4 receiving operation result\n * @param {quat4} q Rotation quaternion\n * @param {ReadonlyVec3} v Translation vector\n * @returns {mat4} out\n */\n\nexport function fromRotationTranslation(out, q, v) {\n // Quaternion math\n var x = q[0],\n y = q[1],\n z = q[2],\n w = q[3];\n var x2 = x + x;\n var y2 = y + y;\n var z2 = z + z;\n var xx = x * x2;\n var xy = x * y2;\n var xz = x * z2;\n var yy = y * y2;\n var yz = y * z2;\n var zz = z * z2;\n var wx = w * x2;\n var wy = w * y2;\n var wz = w * z2;\n out[0] = 1 - (yy + zz);\n out[1] = xy + wz;\n out[2] = xz - wy;\n out[3] = 0;\n out[4] = xy - wz;\n out[5] = 1 - (xx + zz);\n out[6] = yz + wx;\n out[7] = 0;\n out[8] = xz + wy;\n out[9] = yz - wx;\n out[10] = 1 - (xx + yy);\n out[11] = 0;\n out[12] = v[0];\n out[13] = v[1];\n out[14] = v[2];\n out[15] = 1;\n return out;\n}\n/**\n * Creates a new mat4 from a dual quat.\n *\n * @param {mat4} out Matrix\n * @param {ReadonlyQuat2} a Dual Quaternion\n * @returns {mat4} mat4 receiving operation result\n */\n\nexport function fromQuat2(out, a) {\n var translation = new glMatrix.ARRAY_TYPE(3);\n var bx = -a[0],\n by = -a[1],\n bz = -a[2],\n bw = a[3],\n ax = a[4],\n ay = a[5],\n az = a[6],\n aw = a[7];\n var magnitude = bx * bx + by * by + bz * bz + bw * bw; //Only scale if it makes sense\n\n if (magnitude > 0) {\n translation[0] = (ax * bw + aw * bx + ay * bz - az * by) * 2 / magnitude;\n translation[1] = (ay * bw + aw * by + az * bx - ax * bz) * 2 / magnitude;\n translation[2] = (az * bw + aw * bz + ax * by - ay * bx) * 2 / magnitude;\n } else {\n translation[0] = (ax * bw + aw * bx + ay * bz - az * by) * 2;\n translation[1] = (ay * bw + aw * by + az * bx - ax * bz) * 2;\n translation[2] = (az * bw + aw * bz + ax * by - ay * bx) * 2;\n }\n\n fromRotationTranslation(out, a, translation);\n return out;\n}\n/**\n * Returns the translation vector component of a transformation\n * matrix. If a matrix is built with fromRotationTranslation,\n * the returned vector will be the same as the translation vector\n * originally supplied.\n * @param {vec3} out Vector to receive translation component\n * @param {ReadonlyMat4} mat Matrix to be decomposed (input)\n * @return {vec3} out\n */\n\nexport function getTranslation(out, mat) {\n out[0] = mat[12];\n out[1] = mat[13];\n out[2] = mat[14];\n return out;\n}\n/**\n * Returns the scaling factor component of a transformation\n * matrix. If a matrix is built with fromRotationTranslationScale\n * with a normalized Quaternion paramter, the returned vector will be\n * the same as the scaling vector\n * originally supplied.\n * @param {vec3} out Vector to receive scaling factor component\n * @param {ReadonlyMat4} mat Matrix to be decomposed (input)\n * @return {vec3} out\n */\n\nexport function getScaling(out, mat) {\n var m11 = mat[0];\n var m12 = mat[1];\n var m13 = mat[2];\n var m21 = mat[4];\n var m22 = mat[5];\n var m23 = mat[6];\n var m31 = mat[8];\n var m32 = mat[9];\n var m33 = mat[10];\n out[0] = Math.hypot(m11, m12, m13);\n out[1] = Math.hypot(m21, m22, m23);\n out[2] = Math.hypot(m31, m32, m33);\n return out;\n}\n/**\n * Returns a quaternion representing the rotational component\n * of a transformation matrix. If a matrix is built with\n * fromRotationTranslation, the returned quaternion will be the\n * same as the quaternion originally supplied.\n * @param {quat} out Quaternion to receive the rotation component\n * @param {ReadonlyMat4} mat Matrix to be decomposed (input)\n * @return {quat} out\n */\n\nexport function getRotation(out, mat) {\n var scaling = new glMatrix.ARRAY_TYPE(3);\n getScaling(scaling, mat);\n var is1 = 1 / scaling[0];\n var is2 = 1 / scaling[1];\n var is3 = 1 / scaling[2];\n var sm11 = mat[0] * is1;\n var sm12 = mat[1] * is2;\n var sm13 = mat[2] * is3;\n var sm21 = mat[4] * is1;\n var sm22 = mat[5] * is2;\n var sm23 = mat[6] * is3;\n var sm31 = mat[8] * is1;\n var sm32 = mat[9] * is2;\n var sm33 = mat[10] * is3;\n var trace = sm11 + sm22 + sm33;\n var S = 0;\n\n if (trace > 0) {\n S = Math.sqrt(trace + 1.0) * 2;\n out[3] = 0.25 * S;\n out[0] = (sm23 - sm32) / S;\n out[1] = (sm31 - sm13) / S;\n out[2] = (sm12 - sm21) / S;\n } else if (sm11 > sm22 && sm11 > sm33) {\n S = Math.sqrt(1.0 + sm11 - sm22 - sm33) * 2;\n out[3] = (sm23 - sm32) / S;\n out[0] = 0.25 * S;\n out[1] = (sm12 + sm21) / S;\n out[2] = (sm31 + sm13) / S;\n } else if (sm22 > sm33) {\n S = Math.sqrt(1.0 + sm22 - sm11 - sm33) * 2;\n out[3] = (sm31 - sm13) / S;\n out[0] = (sm12 + sm21) / S;\n out[1] = 0.25 * S;\n out[2] = (sm23 + sm32) / S;\n } else {\n S = Math.sqrt(1.0 + sm33 - sm11 - sm22) * 2;\n out[3] = (sm12 - sm21) / S;\n out[0] = (sm31 + sm13) / S;\n out[1] = (sm23 + sm32) / S;\n out[2] = 0.25 * S;\n }\n\n return out;\n}\n/**\n * Creates a matrix from a quaternion rotation, vector translation and vector scale\n * This is equivalent to (but much faster than):\n *\n * mat4.identity(dest);\n * mat4.translate(dest, vec);\n * let quatMat = mat4.create();\n * quat4.toMat4(quat, quatMat);\n * mat4.multiply(dest, quatMat);\n * mat4.scale(dest, scale)\n *\n * @param {mat4} out mat4 receiving operation result\n * @param {quat4} q Rotation quaternion\n * @param {ReadonlyVec3} v Translation vector\n * @param {ReadonlyVec3} s Scaling vector\n * @returns {mat4} out\n */\n\nexport function fromRotationTranslationScale(out, q, v, s) {\n // Quaternion math\n var x = q[0],\n y = q[1],\n z = q[2],\n w = q[3];\n var x2 = x + x;\n var y2 = y + y;\n var z2 = z + z;\n var xx = x * x2;\n var xy = x * y2;\n var xz = x * z2;\n var yy = y * y2;\n var yz = y * z2;\n var zz = z * z2;\n var wx = w * x2;\n var wy = w * y2;\n var wz = w * z2;\n var sx = s[0];\n var sy = s[1];\n var sz = s[2];\n out[0] = (1 - (yy + zz)) * sx;\n out[1] = (xy + wz) * sx;\n out[2] = (xz - wy) * sx;\n out[3] = 0;\n out[4] = (xy - wz) * sy;\n out[5] = (1 - (xx + zz)) * sy;\n out[6] = (yz + wx) * sy;\n out[7] = 0;\n out[8] = (xz + wy) * sz;\n out[9] = (yz - wx) * sz;\n out[10] = (1 - (xx + yy)) * sz;\n out[11] = 0;\n out[12] = v[0];\n out[13] = v[1];\n out[14] = v[2];\n out[15] = 1;\n return out;\n}\n/**\n * Creates a matrix from a quaternion rotation, vector translation and vector scale, rotating and scaling around the given origin\n * This is equivalent to (but much faster than):\n *\n * mat4.identity(dest);\n * mat4.translate(dest, vec);\n * mat4.translate(dest, origin);\n * let quatMat = mat4.create();\n * quat4.toMat4(quat, quatMat);\n * mat4.multiply(dest, quatMat);\n * mat4.scale(dest, scale)\n * mat4.translate(dest, negativeOrigin);\n *\n * @param {mat4} out mat4 receiving operation result\n * @param {quat4} q Rotation quaternion\n * @param {ReadonlyVec3} v Translation vector\n * @param {ReadonlyVec3} s Scaling vector\n * @param {ReadonlyVec3} o The origin vector around which to scale and rotate\n * @returns {mat4} out\n */\n\nexport function fromRotationTranslationScaleOrigin(out, q, v, s, o) {\n // Quaternion math\n var x = q[0],\n y = q[1],\n z = q[2],\n w = q[3];\n var x2 = x + x;\n var y2 = y + y;\n var z2 = z + z;\n var xx = x * x2;\n var xy = x * y2;\n var xz = x * z2;\n var yy = y * y2;\n var yz = y * z2;\n var zz = z * z2;\n var wx = w * x2;\n var wy = w * y2;\n var wz = w * z2;\n var sx = s[0];\n var sy = s[1];\n var sz = s[2];\n var ox = o[0];\n var oy = o[1];\n var oz = o[2];\n var out0 = (1 - (yy + zz)) * sx;\n var out1 = (xy + wz) * sx;\n var out2 = (xz - wy) * sx;\n var out4 = (xy - wz) * sy;\n var out5 = (1 - (xx + zz)) * sy;\n var out6 = (yz + wx) * sy;\n var out8 = (xz + wy) * sz;\n var out9 = (yz - wx) * sz;\n var out10 = (1 - (xx + yy)) * sz;\n out[0] = out0;\n out[1] = out1;\n out[2] = out2;\n out[3] = 0;\n out[4] = out4;\n out[5] = out5;\n out[6] = out6;\n out[7] = 0;\n out[8] = out8;\n out[9] = out9;\n out[10] = out10;\n out[11] = 0;\n out[12] = v[0] + ox - (out0 * ox + out4 * oy + out8 * oz);\n out[13] = v[1] + oy - (out1 * ox + out5 * oy + out9 * oz);\n out[14] = v[2] + oz - (out2 * ox + out6 * oy + out10 * oz);\n out[15] = 1;\n return out;\n}\n/**\n * Calculates a 4x4 matrix from the given quaternion\n *\n * @param {mat4} out mat4 receiving operation result\n * @param {ReadonlyQuat} q Quaternion to create matrix from\n *\n * @returns {mat4} out\n */\n\nexport function fromQuat(out, q) {\n var x = q[0],\n y = q[1],\n z = q[2],\n w = q[3];\n var x2 = x + x;\n var y2 = y + y;\n var z2 = z + z;\n var xx = x * x2;\n var yx = y * x2;\n var yy = y * y2;\n var zx = z * x2;\n var zy = z * y2;\n var zz = z * z2;\n var wx = w * x2;\n var wy = w * y2;\n var wz = w * z2;\n out[0] = 1 - yy - zz;\n out[1] = yx + wz;\n out[2] = zx - wy;\n out[3] = 0;\n out[4] = yx - wz;\n out[5] = 1 - xx - zz;\n out[6] = zy + wx;\n out[7] = 0;\n out[8] = zx + wy;\n out[9] = zy - wx;\n out[10] = 1 - xx - yy;\n out[11] = 0;\n out[12] = 0;\n out[13] = 0;\n out[14] = 0;\n out[15] = 1;\n return out;\n}\n/**\n * Generates a frustum matrix with the given bounds\n *\n * @param {mat4} out mat4 frustum matrix will be written into\n * @param {Number} left Left bound of the frustum\n * @param {Number} right Right bound of the frustum\n * @param {Number} bottom Bottom bound of the frustum\n * @param {Number} top Top bound of the frustum\n * @param {Number} near Near bound of the frustum\n * @param {Number} far Far bound of the frustum\n * @returns {mat4} out\n */\n\nexport function frustum(out, left, right, bottom, top, near, far) {\n var rl = 1 / (right - left);\n var tb = 1 / (top - bottom);\n var nf = 1 / (near - far);\n out[0] = near * 2 * rl;\n out[1] = 0;\n out[2] = 0;\n out[3] = 0;\n out[4] = 0;\n out[5] = near * 2 * tb;\n out[6] = 0;\n out[7] = 0;\n out[8] = (right + left) * rl;\n out[9] = (top + bottom) * tb;\n out[10] = (far + near) * nf;\n out[11] = -1;\n out[12] = 0;\n out[13] = 0;\n out[14] = far * near * 2 * nf;\n out[15] = 0;\n return out;\n}\n/**\n * Generates a perspective projection matrix with the given bounds.\n * The near/far clip planes correspond to a normalized device coordinate Z range of [-1, 1],\n * which matches WebGL/OpenGL's clip volume.\n * Passing null/undefined/no value for far will generate infinite projection matrix.\n *\n * @param {mat4} out mat4 frustum matrix will be written into\n * @param {number} fovy Vertical field of view in radians\n * @param {number} aspect Aspect ratio. typically viewport width/height\n * @param {number} near Near bound of the frustum\n * @param {number} far Far bound of the frustum, can be null or Infinity\n * @returns {mat4} out\n */\n\nexport function perspectiveNO(out, fovy, aspect, near, far) {\n var f = 1.0 / Math.tan(fovy / 2),\n nf;\n out[0] = f / aspect;\n out[1] = 0;\n out[2] = 0;\n out[3] = 0;\n out[4] = 0;\n out[5] = f;\n out[6] = 0;\n out[7] = 0;\n out[8] = 0;\n out[9] = 0;\n out[11] = -1;\n out[12] = 0;\n out[13] = 0;\n out[15] = 0;\n\n if (far != null && far !== Infinity) {\n nf = 1 / (near - far);\n out[10] = (far + near) * nf;\n out[14] = 2 * far * near * nf;\n } else {\n out[10] = -1;\n out[14] = -2 * near;\n }\n\n return out;\n}\n/**\n * Alias for {@link mat4.perspectiveNO}\n * @function\n */\n\nexport var perspective = perspectiveNO;\n/**\n * Generates a perspective projection matrix suitable for WebGPU with the given bounds.\n * The near/far clip planes correspond to a normalized device coordinate Z range of [0, 1],\n * which matches WebGPU/Vulkan/DirectX/Metal's clip volume.\n * Passing null/undefined/no value for far will generate infinite projection matrix.\n *\n * @param {mat4} out mat4 frustum matrix will be written into\n * @param {number} fovy Vertical field of view in radians\n * @param {number} aspect Aspect ratio. typically viewport width/height\n * @param {number} near Near bound of the frustum\n * @param {number} far Far bound of the frustum, can be null or Infinity\n * @returns {mat4} out\n */\n\nexport function perspectiveZO(out, fovy, aspect, near, far) {\n var f = 1.0 / Math.tan(fovy / 2),\n nf;\n out[0] = f / aspect;\n out[1] = 0;\n out[2] = 0;\n out[3] = 0;\n out[4] = 0;\n out[5] = f;\n out[6] = 0;\n out[7] = 0;\n out[8] = 0;\n out[9] = 0;\n out[11] = -1;\n out[12] = 0;\n out[13] = 0;\n out[15] = 0;\n\n if (far != null && far !== Infinity) {\n nf = 1 / (near - far);\n out[10] = far * nf;\n out[14] = far * near * nf;\n } else {\n out[10] = -1;\n out[14] = -near;\n }\n\n return out;\n}\n/**\n * Generates a perspective projection matrix with the given field of view.\n * This is primarily useful for generating projection matrices to be used\n * with the still experiemental WebVR API.\n *\n * @param {mat4} out mat4 frustum matrix will be written into\n * @param {Object} fov Object containing the following values: upDegrees, downDegrees, leftDegrees, rightDegrees\n * @param {number} near Near bound of the frustum\n * @param {number} far Far bound of the frustum\n * @returns {mat4} out\n */\n\nexport function perspectiveFromFieldOfView(out, fov, near, far) {\n var upTan = Math.tan(fov.upDegrees * Math.PI / 180.0);\n var downTan = Math.tan(fov.downDegrees * Math.PI / 180.0);\n var leftTan = Math.tan(fov.leftDegrees * Math.PI / 180.0);\n var rightTan = Math.tan(fov.rightDegrees * Math.PI / 180.0);\n var xScale = 2.0 / (leftTan + rightTan);\n var yScale = 2.0 / (upTan + downTan);\n out[0] = xScale;\n out[1] = 0.0;\n out[2] = 0.0;\n out[3] = 0.0;\n out[4] = 0.0;\n out[5] = yScale;\n out[6] = 0.0;\n out[7] = 0.0;\n out[8] = -((leftTan - rightTan) * xScale * 0.5);\n out[9] = (upTan - downTan) * yScale * 0.5;\n out[10] = far / (near - far);\n out[11] = -1.0;\n out[12] = 0.0;\n out[13] = 0.0;\n out[14] = far * near / (near - far);\n out[15] = 0.0;\n return out;\n}\n/**\n * Generates a orthogonal projection matrix with the given bounds.\n * The near/far clip planes correspond to a normalized device coordinate Z range of [-1, 1],\n * which matches WebGL/OpenGL's clip volume.\n *\n * @param {mat4} out mat4 frustum matrix will be written into\n * @param {number} left Left bound of the frustum\n * @param {number} right Right bound of the frustum\n * @param {number} bottom Bottom bound of the frustum\n * @param {number} top Top bound of the frustum\n * @param {number} near Near bound of the frustum\n * @param {number} far Far bound of the frustum\n * @returns {mat4} out\n */\n\nexport function orthoNO(out, left, right, bottom, top, near, far) {\n var lr = 1 / (left - right);\n var bt = 1 / (bottom - top);\n var nf = 1 / (near - far);\n out[0] = -2 * lr;\n out[1] = 0;\n out[2] = 0;\n out[3] = 0;\n out[4] = 0;\n out[5] = -2 * bt;\n out[6] = 0;\n out[7] = 0;\n out[8] = 0;\n out[9] = 0;\n out[10] = 2 * nf;\n out[11] = 0;\n out[12] = (left + right) * lr;\n out[13] = (top + bottom) * bt;\n out[14] = (far + near) * nf;\n out[15] = 1;\n return out;\n}\n/**\n * Alias for {@link mat4.orthoNO}\n * @function\n */\n\nexport var ortho = orthoNO;\n/**\n * Generates a orthogonal projection matrix with the given bounds.\n * The near/far clip planes correspond to a normalized device coordinate Z range of [0, 1],\n * which matches WebGPU/Vulkan/DirectX/Metal's clip volume.\n *\n * @param {mat4} out mat4 frustum matrix will be written into\n * @param {number} left Left bound of the frustum\n * @param {number} right Right bound of the frustum\n * @param {number} bottom Bottom bound of the frustum\n * @param {number} top Top bound of the frustum\n * @param {number} near Near bound of the frustum\n * @param {number} far Far bound of the frustum\n * @returns {mat4} out\n */\n\nexport function orthoZO(out, left, right, bottom, top, near, far) {\n var lr = 1 / (left - right);\n var bt = 1 / (bottom - top);\n var nf = 1 / (near - far);\n out[0] = -2 * lr;\n out[1] = 0;\n out[2] = 0;\n out[3] = 0;\n out[4] = 0;\n out[5] = -2 * bt;\n out[6] = 0;\n out[7] = 0;\n out[8] = 0;\n out[9] = 0;\n out[10] = nf;\n out[11] = 0;\n out[12] = (left + right) * lr;\n out[13] = (top + bottom) * bt;\n out[14] = near * nf;\n out[15] = 1;\n return out;\n}\n/**\n * Generates a look-at matrix with the given eye position, focal point, and up axis.\n * If you want a matrix that actually makes an object look at another object, you should use targetTo instead.\n *\n * @param {mat4} out mat4 frustum matrix will be written into\n * @param {ReadonlyVec3} eye Position of the viewer\n * @param {ReadonlyVec3} center Point the viewer is looking at\n * @param {ReadonlyVec3} up vec3 pointing up\n * @returns {mat4} out\n */\n\nexport function lookAt(out, eye, center, up) {\n var x0, x1, x2, y0, y1, y2, z0, z1, z2, len;\n var eyex = eye[0];\n var eyey = eye[1];\n var eyez = eye[2];\n var upx = up[0];\n var upy = up[1];\n var upz = up[2];\n var centerx = center[0];\n var centery = center[1];\n var centerz = center[2];\n\n if (Math.abs(eyex - centerx) < glMatrix.EPSILON && Math.abs(eyey - centery) < glMatrix.EPSILON && Math.abs(eyez - centerz) < glMatrix.EPSILON) {\n return identity(out);\n }\n\n z0 = eyex - centerx;\n z1 = eyey - centery;\n z2 = eyez - centerz;\n len = 1 / Math.hypot(z0, z1, z2);\n z0 *= len;\n z1 *= len;\n z2 *= len;\n x0 = upy * z2 - upz * z1;\n x1 = upz * z0 - upx * z2;\n x2 = upx * z1 - upy * z0;\n len = Math.hypot(x0, x1, x2);\n\n if (!len) {\n x0 = 0;\n x1 = 0;\n x2 = 0;\n } else {\n len = 1 / len;\n x0 *= len;\n x1 *= len;\n x2 *= len;\n }\n\n y0 = z1 * x2 - z2 * x1;\n y1 = z2 * x0 - z0 * x2;\n y2 = z0 * x1 - z1 * x0;\n len = Math.hypot(y0, y1, y2);\n\n if (!len) {\n y0 = 0;\n y1 = 0;\n y2 = 0;\n } else {\n len = 1 / len;\n y0 *= len;\n y1 *= len;\n y2 *= len;\n }\n\n out[0] = x0;\n out[1] = y0;\n out[2] = z0;\n out[3] = 0;\n out[4] = x1;\n out[5] = y1;\n out[6] = z1;\n out[7] = 0;\n out[8] = x2;\n out[9] = y2;\n out[10] = z2;\n out[11] = 0;\n out[12] = -(x0 * eyex + x1 * eyey + x2 * eyez);\n out[13] = -(y0 * eyex + y1 * eyey + y2 * eyez);\n out[14] = -(z0 * eyex + z1 * eyey + z2 * eyez);\n out[15] = 1;\n return out;\n}\n/**\n * Generates a matrix that makes something look at something else.\n *\n * @param {mat4} out mat4 frustum matrix will be written into\n * @param {ReadonlyVec3} eye Position of the viewer\n * @param {ReadonlyVec3} center Point the viewer is looking at\n * @param {ReadonlyVec3} up vec3 pointing up\n * @returns {mat4} out\n */\n\nexport function targetTo(out, eye, target, up) {\n var eyex = eye[0],\n eyey = eye[1],\n eyez = eye[2],\n upx = up[0],\n upy = up[1],\n upz = up[2];\n var z0 = eyex - target[0],\n z1 = eyey - target[1],\n z2 = eyez - target[2];\n var len = z0 * z0 + z1 * z1 + z2 * z2;\n\n if (len > 0) {\n len = 1 / Math.sqrt(len);\n z0 *= len;\n z1 *= len;\n z2 *= len;\n }\n\n var x0 = upy * z2 - upz * z1,\n x1 = upz * z0 - upx * z2,\n x2 = upx * z1 - upy * z0;\n len = x0 * x0 + x1 * x1 + x2 * x2;\n\n if (len > 0) {\n len = 1 / Math.sqrt(len);\n x0 *= len;\n x1 *= len;\n x2 *= len;\n }\n\n out[0] = x0;\n out[1] = x1;\n out[2] = x2;\n out[3] = 0;\n out[4] = z1 * x2 - z2 * x1;\n out[5] = z2 * x0 - z0 * x2;\n out[6] = z0 * x1 - z1 * x0;\n out[7] = 0;\n out[8] = z0;\n out[9] = z1;\n out[10] = z2;\n out[11] = 0;\n out[12] = eyex;\n out[13] = eyey;\n out[14] = eyez;\n out[15] = 1;\n return out;\n}\n/**\n * Returns a string representation of a mat4\n *\n * @param {ReadonlyMat4} a matrix to represent as a string\n * @returns {String} string representation of the matrix\n */\n\nexport function str(a) {\n return \"mat4(\" + a[0] + \", \" + a[1] + \", \" + a[2] + \", \" + a[3] + \", \" + a[4] + \", \" + a[5] + \", \" + a[6] + \", \" + a[7] + \", \" + a[8] + \", \" + a[9] + \", \" + a[10] + \", \" + a[11] + \", \" + a[12] + \", \" + a[13] + \", \" + a[14] + \", \" + a[15] + \")\";\n}\n/**\n * Returns Frobenius norm of a mat4\n *\n * @param {ReadonlyMat4} a the matrix to calculate Frobenius norm of\n * @returns {Number} Frobenius norm\n */\n\nexport function frob(a) {\n return Math.hypot(a[0], a[1], a[2], a[3], a[4], a[5], a[6], a[7], a[8], a[9], a[10], a[11], a[12], a[13], a[14], a[15]);\n}\n/**\n * Adds two mat4's\n *\n * @param {mat4} out the receiving matrix\n * @param {ReadonlyMat4} a the first operand\n * @param {ReadonlyMat4} b the second operand\n * @returns {mat4} out\n */\n\nexport function add(out, a, b) {\n out[0] = a[0] + b[0];\n out[1] = a[1] + b[1];\n out[2] = a[2] + b[2];\n out[3] = a[3] + b[3];\n out[4] = a[4] + b[4];\n out[5] = a[5] + b[5];\n out[6] = a[6] + b[6];\n out[7] = a[7] + b[7];\n out[8] = a[8] + b[8];\n out[9] = a[9] + b[9];\n out[10] = a[10] + b[10];\n out[11] = a[11] + b[11];\n out[12] = a[12] + b[12];\n out[13] = a[13] + b[13];\n out[14] = a[14] + b[14];\n out[15] = a[15] + b[15];\n return out;\n}\n/**\n * Subtracts matrix b from matrix a\n *\n * @param {mat4} out the receiving matrix\n * @param {ReadonlyMat4} a the first operand\n * @param {ReadonlyMat4} b the second operand\n * @returns {mat4} out\n */\n\nexport function subtract(out, a, b) {\n out[0] = a[0] - b[0];\n out[1] = a[1] - b[1];\n out[2] = a[2] - b[2];\n out[3] = a[3] - b[3];\n out[4] = a[4] - b[4];\n out[5] = a[5] - b[5];\n out[6] = a[6] - b[6];\n out[7] = a[7] - b[7];\n out[8] = a[8] - b[8];\n out[9] = a[9] - b[9];\n out[10] = a[10] - b[10];\n out[11] = a[11] - b[11];\n out[12] = a[12] - b[12];\n out[13] = a[13] - b[13];\n out[14] = a[14] - b[14];\n out[15] = a[15] - b[15];\n return out;\n}\n/**\n * Multiply each element of the matrix by a scalar.\n *\n * @param {mat4} out the receiving matrix\n * @param {ReadonlyMat4} a the matrix to scale\n * @param {Number} b amount to scale the matrix's elements by\n * @returns {mat4} out\n */\n\nexport function multiplyScalar(out, a, b) {\n out[0] = a[0] * b;\n out[1] = a[1] * b;\n out[2] = a[2] * b;\n out[3] = a[3] * b;\n out[4] = a[4] * b;\n out[5] = a[5] * b;\n out[6] = a[6] * b;\n out[7] = a[7] * b;\n out[8] = a[8] * b;\n out[9] = a[9] * b;\n out[10] = a[10] * b;\n out[11] = a[11] * b;\n out[12] = a[12] * b;\n out[13] = a[13] * b;\n out[14] = a[14] * b;\n out[15] = a[15] * b;\n return out;\n}\n/**\n * Adds two mat4's after multiplying each element of the second operand by a scalar value.\n *\n * @param {mat4} out the receiving vector\n * @param {ReadonlyMat4} a the first operand\n * @param {ReadonlyMat4} b the second operand\n * @param {Number} scale the amount to scale b's elements by before adding\n * @returns {mat4} out\n */\n\nexport function multiplyScalarAndAdd(out, a, b, scale) {\n out[0] = a[0] + b[0] * scale;\n out[1] = a[1] + b[1] * scale;\n out[2] = a[2] + b[2] * scale;\n out[3] = a[3] + b[3] * scale;\n out[4] = a[4] + b[4] * scale;\n out[5] = a[5] + b[5] * scale;\n out[6] = a[6] + b[6] * scale;\n out[7] = a[7] + b[7] * scale;\n out[8] = a[8] + b[8] * scale;\n out[9] = a[9] + b[9] * scale;\n out[10] = a[10] + b[10] * scale;\n out[11] = a[11] + b[11] * scale;\n out[12] = a[12] + b[12] * scale;\n out[13] = a[13] + b[13] * scale;\n out[14] = a[14] + b[14] * scale;\n out[15] = a[15] + b[15] * scale;\n return out;\n}\n/**\n * Returns whether or not the matrices have exactly the same elements in the same position (when compared with ===)\n *\n * @param {ReadonlyMat4} a The first matrix.\n * @param {ReadonlyMat4} b The second matrix.\n * @returns {Boolean} True if the matrices are equal, false otherwise.\n */\n\nexport function exactEquals(a, b) {\n return a[0] === b[0] && a[1] === b[1] && a[2] === b[2] && a[3] === b[3] && a[4] === b[4] && a[5] === b[5] && a[6] === b[6] && a[7] === b[7] && a[8] === b[8] && a[9] === b[9] && a[10] === b[10] && a[11] === b[11] && a[12] === b[12] && a[13] === b[13] && a[14] === b[14] && a[15] === b[15];\n}\n/**\n * Returns whether or not the matrices have approximately the same elements in the same position.\n *\n * @param {ReadonlyMat4} a The first matrix.\n * @param {ReadonlyMat4} b The second matrix.\n * @returns {Boolean} True if the matrices are equal, false otherwise.\n */\n\nexport function equals(a, b) {\n var a0 = a[0],\n a1 = a[1],\n a2 = a[2],\n a3 = a[3];\n var a4 = a[4],\n a5 = a[5],\n a6 = a[6],\n a7 = a[7];\n var a8 = a[8],\n a9 = a[9],\n a10 = a[10],\n a11 = a[11];\n var a12 = a[12],\n a13 = a[13],\n a14 = a[14],\n a15 = a[15];\n var b0 = b[0],\n b1 = b[1],\n b2 = b[2],\n b3 = b[3];\n var b4 = b[4],\n b5 = b[5],\n b6 = b[6],\n b7 = b[7];\n var b8 = b[8],\n b9 = b[9],\n b10 = b[10],\n b11 = b[11];\n var b12 = b[12],\n b13 = b[13],\n b14 = b[14],\n b15 = b[15];\n return Math.abs(a0 - b0) <= glMatrix.EPSILON * Math.max(1.0, Math.abs(a0), Math.abs(b0)) && Math.abs(a1 - b1) <= glMatrix.EPSILON * Math.max(1.0, Math.abs(a1), Math.abs(b1)) && Math.abs(a2 - b2) <= glMatrix.EPSILON * Math.max(1.0, Math.abs(a2), Math.abs(b2)) && Math.abs(a3 - b3) <= glMatrix.EPSILON * Math.max(1.0, Math.abs(a3), Math.abs(b3)) && Math.abs(a4 - b4) <= glMatrix.EPSILON * Math.max(1.0, Math.abs(a4), Math.abs(b4)) && Math.abs(a5 - b5) <= glMatrix.EPSILON * Math.max(1.0, Math.abs(a5), Math.abs(b5)) && Math.abs(a6 - b6) <= glMatrix.EPSILON * Math.max(1.0, Math.abs(a6), Math.abs(b6)) && Math.abs(a7 - b7) <= glMatrix.EPSILON * Math.max(1.0, Math.abs(a7), Math.abs(b7)) && Math.abs(a8 - b8) <= glMatrix.EPSILON * Math.max(1.0, Math.abs(a8), Math.abs(b8)) && Math.abs(a9 - b9) <= glMatrix.EPSILON * Math.max(1.0, Math.abs(a9), Math.abs(b9)) && Math.abs(a10 - b10) <= glMatrix.EPSILON * Math.max(1.0, Math.abs(a10), Math.abs(b10)) && Math.abs(a11 - b11) <= glMatrix.EPSILON * Math.max(1.0, Math.abs(a11), Math.abs(b11)) && Math.abs(a12 - b12) <= glMatrix.EPSILON * Math.max(1.0, Math.abs(a12), Math.abs(b12)) && Math.abs(a13 - b13) <= glMatrix.EPSILON * Math.max(1.0, Math.abs(a13), Math.abs(b13)) && Math.abs(a14 - b14) <= glMatrix.EPSILON * Math.max(1.0, Math.abs(a14), Math.abs(b14)) && Math.abs(a15 - b15) <= glMatrix.EPSILON * Math.max(1.0, Math.abs(a15), Math.abs(b15));\n}\n/**\n * Alias for {@link mat4.multiply}\n * @function\n */\n\nexport var mul = multiply;\n/**\n * Alias for {@link mat4.subtract}\n * @function\n */\n\nexport var sub = subtract;","import * as glMatrix from \"./common.js\";\n/**\n * 3 Dimensional Vector\n * @module vec3\n */\n\n/**\n * Creates a new, empty vec3\n *\n * @returns {vec3} a new 3D vector\n */\n\nexport function create() {\n var out = new glMatrix.ARRAY_TYPE(3);\n\n if (glMatrix.ARRAY_TYPE != Float32Array) {\n out[0] = 0;\n out[1] = 0;\n out[2] = 0;\n }\n\n return out;\n}\n/**\n * Creates a new vec3 initialized with values from an existing vector\n *\n * @param {ReadonlyVec3} a vector to clone\n * @returns {vec3} a new 3D vector\n */\n\nexport function clone(a) {\n var out = new glMatrix.ARRAY_TYPE(3);\n out[0] = a[0];\n out[1] = a[1];\n out[2] = a[2];\n return out;\n}\n/**\n * Calculates the length of a vec3\n *\n * @param {ReadonlyVec3} a vector to calculate length of\n * @returns {Number} length of a\n */\n\nexport function length(a) {\n var x = a[0];\n var y = a[1];\n var z = a[2];\n return Math.hypot(x, y, z);\n}\n/**\n * Creates a new vec3 initialized with the given values\n *\n * @param {Number} x X component\n * @param {Number} y Y component\n * @param {Number} z Z component\n * @returns {vec3} a new 3D vector\n */\n\nexport function fromValues(x, y, z) {\n var out = new glMatrix.ARRAY_TYPE(3);\n out[0] = x;\n out[1] = y;\n out[2] = z;\n return out;\n}\n/**\n * Copy the values from one vec3 to another\n *\n * @param {vec3} out the receiving vector\n * @param {ReadonlyVec3} a the source vector\n * @returns {vec3} out\n */\n\nexport function copy(out, a) {\n out[0] = a[0];\n out[1] = a[1];\n out[2] = a[2];\n return out;\n}\n/**\n * Set the components of a vec3 to the given values\n *\n * @param {vec3} out the receiving vector\n * @param {Number} x X component\n * @param {Number} y Y component\n * @param {Number} z Z component\n * @returns {vec3} out\n */\n\nexport function set(out, x, y, z) {\n out[0] = x;\n out[1] = y;\n out[2] = z;\n return out;\n}\n/**\n * Adds two vec3's\n *\n * @param {vec3} out the receiving vector\n * @param {ReadonlyVec3} a the first operand\n * @param {ReadonlyVec3} b the second operand\n * @returns {vec3} out\n */\n\nexport function add(out, a, b) {\n out[0] = a[0] + b[0];\n out[1] = a[1] + b[1];\n out[2] = a[2] + b[2];\n return out;\n}\n/**\n * Subtracts vector b from vector a\n *\n * @param {vec3} out the receiving vector\n * @param {ReadonlyVec3} a the first operand\n * @param {ReadonlyVec3} b the second operand\n * @returns {vec3} out\n */\n\nexport function subtract(out, a, b) {\n out[0] = a[0] - b[0];\n out[1] = a[1] - b[1];\n out[2] = a[2] - b[2];\n return out;\n}\n/**\n * Multiplies two vec3's\n *\n * @param {vec3} out the receiving vector\n * @param {ReadonlyVec3} a the first operand\n * @param {ReadonlyVec3} b the second operand\n * @returns {vec3} out\n */\n\nexport function multiply(out, a, b) {\n out[0] = a[0] * b[0];\n out[1] = a[1] * b[1];\n out[2] = a[2] * b[2];\n return out;\n}\n/**\n * Divides two vec3's\n *\n * @param {vec3} out the receiving vector\n * @param {ReadonlyVec3} a the first operand\n * @param {ReadonlyVec3} b the second operand\n * @returns {vec3} out\n */\n\nexport function divide(out, a, b) {\n out[0] = a[0] / b[0];\n out[1] = a[1] / b[1];\n out[2] = a[2] / b[2];\n return out;\n}\n/**\n * Math.ceil the components of a vec3\n *\n * @param {vec3} out the receiving vector\n * @param {ReadonlyVec3} a vector to ceil\n * @returns {vec3} out\n */\n\nexport function ceil(out, a) {\n out[0] = Math.ceil(a[0]);\n out[1] = Math.ceil(a[1]);\n out[2] = Math.ceil(a[2]);\n return out;\n}\n/**\n * Math.floor the components of a vec3\n *\n * @param {vec3} out the receiving vector\n * @param {ReadonlyVec3} a vector to floor\n * @returns {vec3} out\n */\n\nexport function floor(out, a) {\n out[0] = Math.floor(a[0]);\n out[1] = Math.floor(a[1]);\n out[2] = Math.floor(a[2]);\n return out;\n}\n/**\n * Returns the minimum of two vec3's\n *\n * @param {vec3} out the receiving vector\n * @param {ReadonlyVec3} a the first operand\n * @param {ReadonlyVec3} b the second operand\n * @returns {vec3} out\n */\n\nexport function min(out, a, b) {\n out[0] = Math.min(a[0], b[0]);\n out[1] = Math.min(a[1], b[1]);\n out[2] = Math.min(a[2], b[2]);\n return out;\n}\n/**\n * Returns the maximum of two vec3's\n *\n * @param {vec3} out the receiving vector\n * @param {ReadonlyVec3} a the first operand\n * @param {ReadonlyVec3} b the second operand\n * @returns {vec3} out\n */\n\nexport function max(out, a, b) {\n out[0] = Math.max(a[0], b[0]);\n out[1] = Math.max(a[1], b[1]);\n out[2] = Math.max(a[2], b[2]);\n return out;\n}\n/**\n * Math.round the components of a vec3\n *\n * @param {vec3} out the receiving vector\n * @param {ReadonlyVec3} a vector to round\n * @returns {vec3} out\n */\n\nexport function round(out, a) {\n out[0] = Math.round(a[0]);\n out[1] = Math.round(a[1]);\n out[2] = Math.round(a[2]);\n return out;\n}\n/**\n * Scales a vec3 by a scalar number\n *\n * @param {vec3} out the receiving vector\n * @param {ReadonlyVec3} a the vector to scale\n * @param {Number} b amount to scale the vector by\n * @returns {vec3} out\n */\n\nexport function scale(out, a, b) {\n out[0] = a[0] * b;\n out[1] = a[1] * b;\n out[2] = a[2] * b;\n return out;\n}\n/**\n * Adds two vec3's after scaling the second operand by a scalar value\n *\n * @param {vec3} out the receiving vector\n * @param {ReadonlyVec3} a the first operand\n * @param {ReadonlyVec3} b the second operand\n * @param {Number} scale the amount to scale b by before adding\n * @returns {vec3} out\n */\n\nexport function scaleAndAdd(out, a, b, scale) {\n out[0] = a[0] + b[0] * scale;\n out[1] = a[1] + b[1] * scale;\n out[2] = a[2] + b[2] * scale;\n return out;\n}\n/**\n * Calculates the euclidian distance between two vec3's\n *\n * @param {ReadonlyVec3} a the first operand\n * @param {ReadonlyVec3} b the second operand\n * @returns {Number} distance between a and b\n */\n\nexport function distance(a, b) {\n var x = b[0] - a[0];\n var y = b[1] - a[1];\n var z = b[2] - a[2];\n return Math.hypot(x, y, z);\n}\n/**\n * Calculates the squared euclidian distance between two vec3's\n *\n * @param {ReadonlyVec3} a the first operand\n * @param {ReadonlyVec3} b the second operand\n * @returns {Number} squared distance between a and b\n */\n\nexport function squaredDistance(a, b) {\n var x = b[0] - a[0];\n var y = b[1] - a[1];\n var z = b[2] - a[2];\n return x * x + y * y + z * z;\n}\n/**\n * Calculates the squared length of a vec3\n *\n * @param {ReadonlyVec3} a vector to calculate squared length of\n * @returns {Number} squared length of a\n */\n\nexport function squaredLength(a) {\n var x = a[0];\n var y = a[1];\n var z = a[2];\n return x * x + y * y + z * z;\n}\n/**\n * Negates the components of a vec3\n *\n * @param {vec3} out the receiving vector\n * @param {ReadonlyVec3} a vector to negate\n * @returns {vec3} out\n */\n\nexport function negate(out, a) {\n out[0] = -a[0];\n out[1] = -a[1];\n out[2] = -a[2];\n return out;\n}\n/**\n * Returns the inverse of the components of a vec3\n *\n * @param {vec3} out the receiving vector\n * @param {ReadonlyVec3} a vector to invert\n * @returns {vec3} out\n */\n\nexport function inverse(out, a) {\n out[0] = 1.0 / a[0];\n out[1] = 1.0 / a[1];\n out[2] = 1.0 / a[2];\n return out;\n}\n/**\n * Normalize a vec3\n *\n * @param {vec3} out the receiving vector\n * @param {ReadonlyVec3} a vector to normalize\n * @returns {vec3} out\n */\n\nexport function normalize(out, a) {\n var x = a[0];\n var y = a[1];\n var z = a[2];\n var len = x * x + y * y + z * z;\n\n if (len > 0) {\n //TODO: evaluate use of glm_invsqrt here?\n len = 1 / Math.sqrt(len);\n }\n\n out[0] = a[0] * len;\n out[1] = a[1] * len;\n out[2] = a[2] * len;\n return out;\n}\n/**\n * Calculates the dot product of two vec3's\n *\n * @param {ReadonlyVec3} a the first operand\n * @param {ReadonlyVec3} b the second operand\n * @returns {Number} dot product of a and b\n */\n\nexport function dot(a, b) {\n return a[0] * b[0] + a[1] * b[1] + a[2] * b[2];\n}\n/**\n * Computes the cross product of two vec3's\n *\n * @param {vec3} out the receiving vector\n * @param {ReadonlyVec3} a the first operand\n * @param {ReadonlyVec3} b the second operand\n * @returns {vec3} out\n */\n\nexport function cross(out, a, b) {\n var ax = a[0],\n ay = a[1],\n az = a[2];\n var bx = b[0],\n by = b[1],\n bz = b[2];\n out[0] = ay * bz - az * by;\n out[1] = az * bx - ax * bz;\n out[2] = ax * by - ay * bx;\n return out;\n}\n/**\n * Performs a linear interpolation between two vec3's\n *\n * @param {vec3} out the receiving vector\n * @param {ReadonlyVec3} a the first operand\n * @param {ReadonlyVec3} b the second operand\n * @param {Number} t interpolation amount, in the range [0-1], between the two inputs\n * @returns {vec3} out\n */\n\nexport function lerp(out, a, b, t) {\n var ax = a[0];\n var ay = a[1];\n var az = a[2];\n out[0] = ax + t * (b[0] - ax);\n out[1] = ay + t * (b[1] - ay);\n out[2] = az + t * (b[2] - az);\n return out;\n}\n/**\n * Performs a hermite interpolation with two control points\n *\n * @param {vec3} out the receiving vector\n * @param {ReadonlyVec3} a the first operand\n * @param {ReadonlyVec3} b the second operand\n * @param {ReadonlyVec3} c the third operand\n * @param {ReadonlyVec3} d the fourth operand\n * @param {Number} t interpolation amount, in the range [0-1], between the two inputs\n * @returns {vec3} out\n */\n\nexport function hermite(out, a, b, c, d, t) {\n var factorTimes2 = t * t;\n var factor1 = factorTimes2 * (2 * t - 3) + 1;\n var factor2 = factorTimes2 * (t - 2) + t;\n var factor3 = factorTimes2 * (t - 1);\n var factor4 = factorTimes2 * (3 - 2 * t);\n out[0] = a[0] * factor1 + b[0] * factor2 + c[0] * factor3 + d[0] * factor4;\n out[1] = a[1] * factor1 + b[1] * factor2 + c[1] * factor3 + d[1] * factor4;\n out[2] = a[2] * factor1 + b[2] * factor2 + c[2] * factor3 + d[2] * factor4;\n return out;\n}\n/**\n * Performs a bezier interpolation with two control points\n *\n * @param {vec3} out the receiving vector\n * @param {ReadonlyVec3} a the first operand\n * @param {ReadonlyVec3} b the second operand\n * @param {ReadonlyVec3} c the third operand\n * @param {ReadonlyVec3} d the fourth operand\n * @param {Number} t interpolation amount, in the range [0-1], between the two inputs\n * @returns {vec3} out\n */\n\nexport function bezier(out, a, b, c, d, t) {\n var inverseFactor = 1 - t;\n var inverseFactorTimesTwo = inverseFactor * inverseFactor;\n var factorTimes2 = t * t;\n var factor1 = inverseFactorTimesTwo * inverseFactor;\n var factor2 = 3 * t * inverseFactorTimesTwo;\n var factor3 = 3 * factorTimes2 * inverseFactor;\n var factor4 = factorTimes2 * t;\n out[0] = a[0] * factor1 + b[0] * factor2 + c[0] * factor3 + d[0] * factor4;\n out[1] = a[1] * factor1 + b[1] * factor2 + c[1] * factor3 + d[1] * factor4;\n out[2] = a[2] * factor1 + b[2] * factor2 + c[2] * factor3 + d[2] * factor4;\n return out;\n}\n/**\n * Generates a random vector with the given scale\n *\n * @param {vec3} out the receiving vector\n * @param {Number} [scale] Length of the resulting vector. If ommitted, a unit vector will be returned\n * @returns {vec3} out\n */\n\nexport function random(out, scale) {\n scale = scale || 1.0;\n var r = glMatrix.RANDOM() * 2.0 * Math.PI;\n var z = glMatrix.RANDOM() * 2.0 - 1.0;\n var zScale = Math.sqrt(1.0 - z * z) * scale;\n out[0] = Math.cos(r) * zScale;\n out[1] = Math.sin(r) * zScale;\n out[2] = z * scale;\n return out;\n}\n/**\n * Transforms the vec3 with a mat4.\n * 4th vector component is implicitly '1'\n *\n * @param {vec3} out the receiving vector\n * @param {ReadonlyVec3} a the vector to transform\n * @param {ReadonlyMat4} m matrix to transform with\n * @returns {vec3} out\n */\n\nexport function transformMat4(out, a, m) {\n var x = a[0],\n y = a[1],\n z = a[2];\n var w = m[3] * x + m[7] * y + m[11] * z + m[15];\n w = w || 1.0;\n out[0] = (m[0] * x + m[4] * y + m[8] * z + m[12]) / w;\n out[1] = (m[1] * x + m[5] * y + m[9] * z + m[13]) / w;\n out[2] = (m[2] * x + m[6] * y + m[10] * z + m[14]) / w;\n return out;\n}\n/**\n * Transforms the vec3 with a mat3.\n *\n * @param {vec3} out the receiving vector\n * @param {ReadonlyVec3} a the vector to transform\n * @param {ReadonlyMat3} m the 3x3 matrix to transform with\n * @returns {vec3} out\n */\n\nexport function transformMat3(out, a, m) {\n var x = a[0],\n y = a[1],\n z = a[2];\n out[0] = x * m[0] + y * m[3] + z * m[6];\n out[1] = x * m[1] + y * m[4] + z * m[7];\n out[2] = x * m[2] + y * m[5] + z * m[8];\n return out;\n}\n/**\n * Transforms the vec3 with a quat\n * Can also be used for dual quaternions. (Multiply it with the real part)\n *\n * @param {vec3} out the receiving vector\n * @param {ReadonlyVec3} a the vector to transform\n * @param {ReadonlyQuat} q quaternion to transform with\n * @returns {vec3} out\n */\n\nexport function transformQuat(out, a, q) {\n // benchmarks: https://jsperf.com/quaternion-transform-vec3-implementations-fixed\n var qx = q[0],\n qy = q[1],\n qz = q[2],\n qw = q[3];\n var x = a[0],\n y = a[1],\n z = a[2]; // var qvec = [qx, qy, qz];\n // var uv = vec3.cross([], qvec, a);\n\n var uvx = qy * z - qz * y,\n uvy = qz * x - qx * z,\n uvz = qx * y - qy * x; // var uuv = vec3.cross([], qvec, uv);\n\n var uuvx = qy * uvz - qz * uvy,\n uuvy = qz * uvx - qx * uvz,\n uuvz = qx * uvy - qy * uvx; // vec3.scale(uv, uv, 2 * w);\n\n var w2 = qw * 2;\n uvx *= w2;\n uvy *= w2;\n uvz *= w2; // vec3.scale(uuv, uuv, 2);\n\n uuvx *= 2;\n uuvy *= 2;\n uuvz *= 2; // return vec3.add(out, a, vec3.add(out, uv, uuv));\n\n out[0] = x + uvx + uuvx;\n out[1] = y + uvy + uuvy;\n out[2] = z + uvz + uuvz;\n return out;\n}\n/**\n * Rotate a 3D vector around the x-axis\n * @param {vec3} out The receiving vec3\n * @param {ReadonlyVec3} a The vec3 point to rotate\n * @param {ReadonlyVec3} b The origin of the rotation\n * @param {Number} rad The angle of rotation in radians\n * @returns {vec3} out\n */\n\nexport function rotateX(out, a, b, rad) {\n var p = [],\n r = []; //Translate point to the origin\n\n p[0] = a[0] - b[0];\n p[1] = a[1] - b[1];\n p[2] = a[2] - b[2]; //perform rotation\n\n r[0] = p[0];\n r[1] = p[1] * Math.cos(rad) - p[2] * Math.sin(rad);\n r[2] = p[1] * Math.sin(rad) + p[2] * Math.cos(rad); //translate to correct position\n\n out[0] = r[0] + b[0];\n out[1] = r[1] + b[1];\n out[2] = r[2] + b[2];\n return out;\n}\n/**\n * Rotate a 3D vector around the y-axis\n * @param {vec3} out The receiving vec3\n * @param {ReadonlyVec3} a The vec3 point to rotate\n * @param {ReadonlyVec3} b The origin of the rotation\n * @param {Number} rad The angle of rotation in radians\n * @returns {vec3} out\n */\n\nexport function rotateY(out, a, b, rad) {\n var p = [],\n r = []; //Translate point to the origin\n\n p[0] = a[0] - b[0];\n p[1] = a[1] - b[1];\n p[2] = a[2] - b[2]; //perform rotation\n\n r[0] = p[2] * Math.sin(rad) + p[0] * Math.cos(rad);\n r[1] = p[1];\n r[2] = p[2] * Math.cos(rad) - p[0] * Math.sin(rad); //translate to correct position\n\n out[0] = r[0] + b[0];\n out[1] = r[1] + b[1];\n out[2] = r[2] + b[2];\n return out;\n}\n/**\n * Rotate a 3D vector around the z-axis\n * @param {vec3} out The receiving vec3\n * @param {ReadonlyVec3} a The vec3 point to rotate\n * @param {ReadonlyVec3} b The origin of the rotation\n * @param {Number} rad The angle of rotation in radians\n * @returns {vec3} out\n */\n\nexport function rotateZ(out, a, b, rad) {\n var p = [],\n r = []; //Translate point to the origin\n\n p[0] = a[0] - b[0];\n p[1] = a[1] - b[1];\n p[2] = a[2] - b[2]; //perform rotation\n\n r[0] = p[0] * Math.cos(rad) - p[1] * Math.sin(rad);\n r[1] = p[0] * Math.sin(rad) + p[1] * Math.cos(rad);\n r[2] = p[2]; //translate to correct position\n\n out[0] = r[0] + b[0];\n out[1] = r[1] + b[1];\n out[2] = r[2] + b[2];\n return out;\n}\n/**\n * Get the angle between two 3D vectors\n * @param {ReadonlyVec3} a The first operand\n * @param {ReadonlyVec3} b The second operand\n * @returns {Number} The angle in radians\n */\n\nexport function angle(a, b) {\n var ax = a[0],\n ay = a[1],\n az = a[2],\n bx = b[0],\n by = b[1],\n bz = b[2],\n mag1 = Math.sqrt(ax * ax + ay * ay + az * az),\n mag2 = Math.sqrt(bx * bx + by * by + bz * bz),\n mag = mag1 * mag2,\n cosine = mag && dot(a, b) / mag;\n return Math.acos(Math.min(Math.max(cosine, -1), 1));\n}\n/**\n * Set the components of a vec3 to zero\n *\n * @param {vec3} out the receiving vector\n * @returns {vec3} out\n */\n\nexport function zero(out) {\n out[0] = 0.0;\n out[1] = 0.0;\n out[2] = 0.0;\n return out;\n}\n/**\n * Returns a string representation of a vector\n *\n * @param {ReadonlyVec3} a vector to represent as a string\n * @returns {String} string representation of the vector\n */\n\nexport function str(a) {\n return \"vec3(\" + a[0] + \", \" + a[1] + \", \" + a[2] + \")\";\n}\n/**\n * Returns whether or not the vectors have exactly the same elements in the same position (when compared with ===)\n *\n * @param {ReadonlyVec3} a The first vector.\n * @param {ReadonlyVec3} b The second vector.\n * @returns {Boolean} True if the vectors are equal, false otherwise.\n */\n\nexport function exactEquals(a, b) {\n return a[0] === b[0] && a[1] === b[1] && a[2] === b[2];\n}\n/**\n * Returns whether or not the vectors have approximately the same elements in the same position.\n *\n * @param {ReadonlyVec3} a The first vector.\n * @param {ReadonlyVec3} b The second vector.\n * @returns {Boolean} True if the vectors are equal, false otherwise.\n */\n\nexport function equals(a, b) {\n var a0 = a[0],\n a1 = a[1],\n a2 = a[2];\n var b0 = b[0],\n b1 = b[1],\n b2 = b[2];\n return Math.abs(a0 - b0) <= glMatrix.EPSILON * Math.max(1.0, Math.abs(a0), Math.abs(b0)) && Math.abs(a1 - b1) <= glMatrix.EPSILON * Math.max(1.0, Math.abs(a1), Math.abs(b1)) && Math.abs(a2 - b2) <= glMatrix.EPSILON * Math.max(1.0, Math.abs(a2), Math.abs(b2));\n}\n/**\n * Alias for {@link vec3.subtract}\n * @function\n */\n\nexport var sub = subtract;\n/**\n * Alias for {@link vec3.multiply}\n * @function\n */\n\nexport var mul = multiply;\n/**\n * Alias for {@link vec3.divide}\n * @function\n */\n\nexport var div = divide;\n/**\n * Alias for {@link vec3.distance}\n * @function\n */\n\nexport var dist = distance;\n/**\n * Alias for {@link vec3.squaredDistance}\n * @function\n */\n\nexport var sqrDist = squaredDistance;\n/**\n * Alias for {@link vec3.length}\n * @function\n */\n\nexport var len = length;\n/**\n * Alias for {@link vec3.squaredLength}\n * @function\n */\n\nexport var sqrLen = squaredLength;\n/**\n * Perform some operation over an array of vec3s.\n *\n * @param {Array} a the array of vectors to iterate over\n * @param {Number} stride Number of elements between the start of each vec3. If 0 assumes tightly packed\n * @param {Number} offset Number of elements to skip at the beginning of the array\n * @param {Number} count Number of vec3s to iterate over. If 0 iterates over entire array\n * @param {Function} fn Function to call for each vector in the array\n * @param {Object} [arg] additional argument to pass to fn\n * @returns {Array} a\n * @function\n */\n\nexport var forEach = function () {\n var vec = create();\n return function (a, stride, offset, count, fn, arg) {\n var i, l;\n\n if (!stride) {\n stride = 3;\n }\n\n if (!offset) {\n offset = 0;\n }\n\n if (count) {\n l = Math.min(count * stride + offset, a.length);\n } else {\n l = a.length;\n }\n\n for (i = offset; i < l; i += stride) {\n vec[0] = a[i];\n vec[1] = a[i + 1];\n vec[2] = a[i + 2];\n fn(vec, vec, arg);\n a[i] = vec[0];\n a[i + 1] = vec[1];\n a[i + 2] = vec[2];\n }\n\n return a;\n };\n}();","import t from\"pako\";import e from\"md5\";import{vec3 as i,mat4 as s,glMatrix as n}from\"gl-matrix\";var r;!function(t){t.UP=\"up\",t.DOWN=\"down\",t.NORTH=\"north\",t.EAST=\"east\",t.SOUTH=\"south\",t.WEST=\"west\"}(r||(r={}));const o={[r.UP]:[0,1,0],[r.DOWN]:[0,-1,0],[r.NORTH]:[0,0,-1],[r.EAST]:[1,0,0],[r.SOUTH]:[0,0,1],[r.WEST]:[-1,0,0]};var a;!function(t){t.ALL=[t.UP,t.DOWN,t.NORTH,t.EAST,t.SOUTH,t.WEST],t.normal=function(t){return o[t]}}(r||(r={})),function(t){t.create=function(t,e,i){return[t,e,i]},t.offset=function(t,e,i,s){return[t[0]+e,t[1]+i,t[2]+s]},t.towards=function(e,i){return t.offset(e,...r.normal(i))}}(a||(a={}));const l={end:0,byte:1,short:2,int:3,long:4,float:5,double:6,byteArray:7,string:8,list:9,compound:10,intArray:11,longArray:12},h=[\"end\",\"byte\",\"short\",\"int\",\"long\",\"float\",\"double\",\"byteArray\",\"string\",\"list\",\"compound\",\"intArray\",\"longArray\"];class u{constructor(t,e=!1){this.byte=this.readNum.bind(this,\"getInt8\",1),this.short=this.readNum.bind(this,\"getInt16\",2),this.int=this.readNum.bind(this,\"getInt32\",4),this.float=this.readNum.bind(this,\"getFloat32\",4),this.double=this.readNum.bind(this,\"getFloat64\",8),this.offset=0,this.littleEndian=e,this.arrayView=t,this.dataView=new DataView(t.buffer,t.byteOffset)}end(){return null}readNum(t,e){const i=this.dataView[t](this.offset,this.littleEndian);return this.offset+=e,i}long(){return[this.int(),this.int()]}byteArray(){const t=this.int(),e=[];for(let i=0;i=e)return;let i=this.buffer.byteLength;for(;ithis.buffer.byteLength&&n.fill(0,this.buffer.byteLength,this.offset),this.buffer=s,this.dataView=new DataView(s),this.arrayView=n}getData(){return this.accommodate(0),this.arrayView.slice(0,this.offset)}end(t){}writeNum(t,e,i){this.accommodate(e),this.dataView[t](this.offset,i,this.littleEndian),this.offset+=e}long(t){this.int(t[0]),this.int(t[1])}byteArray(t){this.int(t.length),this.accommodate(t.length),this.arrayView.set(t,this.offset),this.offset+=t.length}intArray(t){this.int(t.length);for(let e=0;e>6),s.push(128|63&i)):i<65536?(s.push(224|i>>12),s.push(128|i>>6&63),s.push(128|63&i)):(s.push(240|i>>18&7),s.push(128|i>>12&63),s.push(128|i>>6&63),s.push(128|63&i));return s}(t);this.short(e.length),this.accommodate(e.length),this.arrayView.set(e,this.offset),this.offset+=e.length}list(t){this.byte(l[t.type]),this.int(t.value.length),t.value;for(let e=0;e>16),s.setInt16(t+1,65535&n),s.setInt8(t+3,r),s.setInt32(t+4096,e.timestamp);const o=4096*n;s.setInt32(o,e.data.length+1),s.setInt8(o+4,e.compression),i.set(e.data,o+5),n+=r}return i}function I(t,e,i,s){const n=w(t,e,i);switch(n.compression){case 1:n.data=b(s);break;case 2:n.data=b(s,!1,!0);break;case 3:n.data=v(s);break;default:throw new Error(`Invalid compression mode ${n.compression}`)}return n}function w(t,e,i){const s=t.find((t=>t.x===e&&t.z===i));if(void 0===s)throw new Error(`Cannot find chunk [${e}, ${i}]`);return s}function A(t,e,i){if(!t[e])throw new Error(`Missing ${e} tag`);if(t[e].type!==i)throw new Error(`Expected ${e} to be of type ${i}, but found ${t[e].type}`);return t[e].value}function N(t,e,i,s){const n=A(t,e,\"list\");if(n.type!==i)throw new Error(`Expected ${e} to be a list of ${i}s, but found ${n.type}s`);if(s&&n.value.length!==s)throw new Error(`Expected ${e} to be a list of length ${s}, but found length ${n.value.length}`);return n.value}function F(t,e){try{return t()}catch(t){return e}}var _,y,P,R,B;!function(t){function e(t){return\"object\"==typeof t&&null!==t?t:void 0}t.readNumber=function(t){return\"number\"==typeof t?t:void 0},t.readInt=function(t){return\"number\"==typeof t?Math.floor(t):void 0},t.readString=function(t){return\"string\"==typeof t?t:void 0},t.readBoolean=function(t){return\"boolean\"==typeof t?t:void 0},t.readObject=e,t.readArray=function(t,e){if(Array.isArray(t))return t.map((t=>e(t)))},t.readMap=function(t,i){var s;const n=null!==(s=e(t))&&void 0!==s?s:{};return Object.fromEntries(Object.entries(n).map((([t,e])=>[t,i(e)])))},t.compose=function(t,e,i){const s=e(t);return s?i(s):void 0}}(_||(_={}));class x{constructor(t,e={}){this.name=t,this.properties=e}getName(){return this.name}getProperties(){return this.properties}getProperty(t){return this.properties[t]}isFluid(){return\"minecraft:water\"===this.name||\"minecraft:lava\"===this.name}equals(t){return this.name===t.name&&Object.keys(this.properties).every((e=>t.properties[e]===this.properties[e]))}toString(){return 0===Object.keys(this.properties).length?this.name:`${this.name}[${Object.entries(this.properties).map((([t,e])=>t+\"=\"+e)).join(\",\")}]`}static fromNbt(t){const e=A(t.value,\"Name\",\"string\"),i=F((()=>A(t.value,\"Properties\",\"compound\")),{}),s=Object.keys(i).reduce(((t,e)=>Object.assign(Object.assign({},t),{[e]:A(i,e,\"string\")})),{});return new x(e,s)}static fromJson(t){var e,i;const s=null!==(e=_.readObject(t))&&void 0!==e?e:{},n=null!==(i=_.readString(s.Name))&&void 0!==i?i:\"minecraft:stone\",r=_.readMap(s.Properties,(t=>{var e;return null!==(e=_.readString(t))&&void 0!==e?e:\"\"}));return new x(n,r)}}x.AIR=new x(\"minecraft:air\");class T{constructor(t){this.minY=t,this.storage=Array(T.SIZE),this.palette=[x.AIR]}get minBlockY(){return this.minY<<4}index(t,e,i){return(t<<8)+(e<<4)+i}getBlockState(t,e,i){var s;const n=this.storage[this.index(t,e,i)];return null!==(s=this.palette[n])&&void 0!==s?s:x.AIR}setBlockState(t,e,i,s){let n=this.palette.findIndex((t=>t.equals(s)));-1===n&&(n=this.palette.length,this.palette.push(s)),this.storage[this.index(t,e,i)]=n}}T.WIDTH=16,T.SIZE=T.WIDTH*T.WIDTH*T.WIDTH;class C{constructor(t,e,i){this.minY=t,this.height=e,this.pos=i,this.sections=Array(this.sectionsCount).fill(null)}get maxY(){return this.minY+this.height}get minSection(){return this.minY>>4}get maxSection(){return 1+(this.maxY-1>>4)}get sectionsCount(){return this.maxSection-this.minSection}getSectionIndex(t){return(t>>4)-this.minSection}getBlockState(t){var e;const[i,s,n]=t,r=this.sections[this.getSectionIndex(s)];return null!==(e=null==r?void 0:r.getBlockState(15&i,15&s,15&n))&&void 0!==e?e:x.AIR}setBlockState(t,e){const[i,s,n]=t,r=this.getSectionIndex(s);let o=this.sections[r];if(null===o){if(e.equals(x.AIR))return;o=this.getOrCreateSection(r)}o.setBlockState(15&i,15&s,15&n,e)}getOrCreateSection(t){return null==this.sections[t]&&(this.sections[t]=new T(this.minSection+t)),this.sections[t]}}!function(t){function e(t,e){return BigInt(4294967295&t)|BigInt(4294967295&e)<>4,t[2]>>4]},t.fromLong=function(t){return[4294967295&Number(t),Number(t>>BigInt(32))]},t.toLong=function(t){return e(t[0],t[1])},t.asLong=e,t.minBlockX=function(t){return t[0]<<4},t.minBlockZ=function(t){return t[1]<<4},t.maxBlockX=function(t){return 15+(t[0]<<4)},t.maxBlockZ=function(t){return 15+(t[1]<<4)}}(y||(y={}));class k{constructor(t,e=[],i=[]){this.size=t,this.palette=e,this.blocks=i,this.blocksMap=[],i.forEach((e=>{if(!this.isInside(e.pos))throw new Error(`Found block at ${e.pos} which is outside the structure bounds ${this.size}`);this.blocksMap[e.pos[0]*t[1]*t[2]+e.pos[1]*t[2]+e.pos[2]]=e}))}getSize(){return this.size}addBlock(t,e,i,s){if(!this.isInside(t))throw new Error(`Cannot add block at ${t} outside the structure bounds ${this.size}`);const n=new x(e,i);let r=this.palette.findIndex((t=>t.equals(n)));return-1===r&&(r=this.palette.length,this.palette.push(n)),this.blocks.push({pos:t,state:r,nbt:s}),this.blocksMap[t[0]*this.size[1]*this.size[2]+t[1]*this.size[2]+t[2]]={pos:t,state:r,nbt:s},this}getBlocks(){return this.blocks.map((t=>({pos:t.pos,state:this.palette[t.state],nbt:t.nbt})))}getBlock(t){if(!this.isInside(t))return null;const e=this.blocksMap[t[0]*this.size[1]*this.size[2]+t[1]*this.size[2]+t[2]];if(!e)return null;return{pos:e.pos,state:this.palette[e.state],nbt:e.nbt}}isInside(t){return t[0]>=0&&t[0]=0&&t[1]=0&&t[2]x.fromNbt({name:\"\",value:t}))),s=N(t.value,\"blocks\",\"compound\").map((t=>({pos:N(t,\"pos\",\"int\",3),state:A(t,\"state\",\"int\"),nbt:F((()=>A(t,\"nbt\",\"compound\")),void 0)})));return new k(e,i,s)}}function D(t){let e=null;return()=>(null==e&&(e=t()),e)}function M(t,e,i){const s=t.get(e);if(s)return s;const n=i(e);return t.set(e,n),n}function O(t){return t*t}function L(t,e,i){return Math.max(e,Math.min(i,t))}function U(t,e,i){return e+t*(i-e)}function Y(t,e,i,s,n,r){return U(e,U(t,i,s),U(t,n,r))}function G(t,e,i,s,n,r,o,a,l,h,u){return U(i,Y(t,e,s,n,r,o),Y(t,e,a,l,h,u))}function H(t,e,i){return i<0?t:i>1?e:U(i,t,e)}function V(t,e,i){return(t-e)/(i-e)}function z(t){return t*t*t*(t*(6*t-15)+10)}function j(t,e,i,s,n){return U(V(t,e,i),s,n)}function J(t,e,i,s,n){return H(s,n,V(t,e,i))}function X(t,e,i){let s=e-t;for(;s>0;){const e=Math.floor(s/2),n=t+e;i(n)?s=e:(t=n+1,s-=e+1)}return t}function Z(t,e,i){let s=BigInt(3129871*t)^BigInt(i)*BigInt(116129781)^BigInt(e);return s=s*s*BigInt(42317861)+s*BigInt(11),s>>BigInt(16)}function W(t,e,i,s,n,r,o,a){return BigInt(t)<>BigInt(q.MODULUS_BITS-t));return e>2147483647?e-4294967296:e}nextInt(t){if(void 0===t)return this.next(32);if(0==(t&t-1))return Number(BigInt(t)*BigInt(this.next(31))>>BigInt(31));let e,i;for(;(e=this.next(31))-(i=e%t)+(t-1)<0;);return i}nextLong(){return(BigInt(this.next(32))<>BigInt(30))*BigInt(\"-4658895280553007687\")&BigInt(\"0xFFFFFFFFFFFFFFFF\"))^t>>BigInt(27))*BigInt(\"-7723592293110705685\")&BigInt(\"0xFFFFFFFFFFFFFFFF\"))^t>>BigInt(31))&BigInt(\"0xFFFFFFFFFFFFFFFF\")}static upgradeSeedTo128bit(t){t<0&&(t+=BigInt(\"0x10000000000000000\"));const e=t^K.SILVER_RATIO_64,i=e+K.GOLDEN_RATIO_64&BigInt(\"0xFFFFFFFFFFFFFFFF\");return[K.mixStafford13(e),K.mixStafford13(i)]}static rotateLeft(t,e){return t<>BigInt(64)-e}setSeed(t){this.seed=K.upgradeSeedTo128bit(t)}fork(){return new K([this.next(),this.next()])}forkPositional(){return new Q(this.next(),this.next())}next(){const t=this.seed[0];let e=this.seed[1];const i=K.rotateLeft(t+e&BigInt(\"0xFFFFFFFFFFFFFFFF\"),BigInt(17))+t&BigInt(\"0xFFFFFFFFFFFFFFFF\");return e^=t,this.seed=[K.rotateLeft(t,BigInt(49))^e^e<BigInt(\"0x8000000000000000\")&&(t-=BigInt(\"0x10000000000000000\")),t}consume(t){let e=this.seed[0],i=this.seed[1];for(let s=0;s>BigInt(64-t)}nextInt(t){let e=this.next()&BigInt(4294967295);if(t){const i=BigInt(t);let s=e*i,n=s&BigInt(4294967295);if(n>BigInt(32);return Number(r)}{let t=Number(e);return t>=2147483648&&(t-=4294967296),t}}nextFloat(){return Number(this.nextBits(24))*K.FLOAT_MULTIPLIER}nextDouble(){return Number(this.nextBits(53))*K.DOUBLE_MULTIPLIER}parityConfigString(){return\"seedLo: \"+this.seed[0]+\", seedHi: \"+this.seed[1]}}K.SILVER_RATIO_64=BigInt(\"7640891576956012809\"),K.GOLDEN_RATIO_64=BigInt(\"-7046029254386353131\"),K.FLOAT_MULTIPLIER=1/Math.pow(2,24),K.DOUBLE_MULTIPLIER=11102230246251565e-32;class Q{constructor(t,e){this.seedLo=t,this.seedHi=e}at(t,e,i){const s=Z(t,e,i)^this.seedLo;return new K([s,this.seedHi])}fromHashOf(t){const i=e(t,{asBytes:!0}),s=W(i[0],i[1],i[2],i[3],i[4],i[5],i[6],i[7]),n=W(i[8],i[9],i[10],i[11],i[12],i[13],i[14],i[15]);return new K([s^this.seedLo,n^this.seedHi])}}class tt{constructor(t){this.xo=256*t.nextDouble(),this.yo=256*t.nextDouble(),this.zo=256*t.nextDouble(),this.p=Array(256);for(let t=0;t<256;t+=1)this.p[t]=t;for(let e=0;e<256;e+=1){const i=t.nextInt(256-e),s=this.p[e];this.p[e]=this.p[e+i],this.p[e+i]=s}}sample2D(t,e){let i,s,n;const r=(t+e)*tt.F2,o=Math.floor(t+r),a=t-(o-(i=(o+(s=Math.floor(e+r)))*tt.G2));let l,h;a>(n=e-(s-i))?(l=1,h=0):(l=0,h=1);const u=a-l+tt.G2,c=n-h+tt.G2,d=a-1+2*tt.G2,f=n-1+2*tt.G2,g=255&o,p=255&s,m=this.P(g+this.P(p))%12,v=this.P(g+l+this.P(p+h))%12,b=this.P(g+1+this.P(p+1))%12;return 70*(this.getCornerNoise3D(m,a,n,0,.5)+this.getCornerNoise3D(v,u,c,0,.5)+this.getCornerNoise3D(b,d,f,0,.5))}sample(t,e,i){const s=.3333333333333333*(t+e+i),n=Math.floor(t+s),r=Math.floor(e+s),o=Math.floor(i+s),a=.16666666666666666*(n+r+o),l=t-(n-a),h=e-(r-a),u=i-(o-a);let c,d,f,g,p,m;l>=h?h>=u?(c=1,d=0,f=0,g=1,p=1,m=0):l>=u?(c=1,d=0,f=0,g=1,p=0,m=1):(c=0,d=0,f=1,g=1,p=0,m=1):h127?t-256:t;for(let e=0;e<256;e+=1){const i=t.nextInt(256-e),s=this.p[e];this.p[e]=this.p[e+i],this.p[e+i]=s}}sample(t,e,i,s=0,n=0){const r=t+this.xo,o=e+this.yo,a=i+this.zo,l=Math.floor(r),h=Math.floor(o),u=Math.floor(a),c=r-l,d=o-h,f=a-u;let g=0;if(0!==s){const t=n>=0&&n=0;s-=1)s0&&(s=this.maxLimitNoise.getOctaveNoise(l))&&(a+=s.sample(c,d,f,u,e*u)/r),r/=2}return H(o/512,a/512,n)/128}}!function(t){t.fromJson=function(t){var e,i,s,n,r;const o=null!==(e=_.readObject(t))&&void 0!==e?e:{};return{xzScale:null!==(i=_.readNumber(o.xz_scale))&&void 0!==i?i:1,yScale:null!==(s=_.readNumber(o.y_scale))&&void 0!==s?s:1,xzFactor:null!==(n=_.readNumber(o.xz_factor))&&void 0!==n?n:80,yFactor:null!==(r=_.readNumber(o.y_factor))&&void 0!==r?r:80}}}(P||(P={}));class nt{constructor(t,{firstOctave:e,amplitudes:i}){this.first=new it(t,e,i),this.second=new it(t,e,i);let s=1/0,n=-1/0;for(let t=0;t{var e;return null!==(e=_.readNumber(t))&&void 0!==e?e:0})))&&void 0!==s?s:[]}}}(R||(R={}));class rt{constructor(t,e){const i=e[e.length-1],s=-e[0]+i+1,n=new Set(e),r=new tt(t);this.noiseLevels=Array(s),i>=0&&i=0&&n.has(i-e)?this.noiseLevels[e]=new tt(t):t.consume(262);if(i>0)throw new Error(\"Positive octaves are not allowed\");this.highestFreqInputFactor=Math.pow(2,i),this.highestFreqValueFactor=1/(Math.pow(2,s)-1)}sample(t,e,i){let s=0,n=this.highestFreqInputFactor,r=this.highestFreqValueFactor;for(let o=0;o{var e;return null!==(e=_.readObject(t))&&void 0!==e?e:{}})))&&void 0!==n?n:[];if(0===h.length)return new ot(0);for(const e of h){const s=null!==(r=_.readNumber(e.location))&&void 0!==r?r:0,n=t.fromJson(e.value,i),a=null!==(o=_.readNumber(e.derivative))&&void 0!==o?o:0;l.addPoint(s,n,a)}return l}}(B||(B={}));class ot{constructor(t){this.value=t}apply(){return this.value}toJson(){return this.value}}class at{constructor(t,e=[],i=[],s=[]){this.coordinate=t,this.locations=e,this.values=i,this.derivatives=s}apply(t){const e=this.coordinate.apply(t),i=X(0,this.locations.length,(t=>e({location:t,value:this.values[e].toJson(),derivative:this.derivatives[e]})))}}}const lt=t=>[(t>>16&255)/256,(t>>8&255)/256,(255&t)/256],ht=[124/256,189/256,107/256],ut=lt(6396257),ct=lt(8431445),dt=lt(4764952),ft=lt(4159204),gt=lt(8431445),pt=lt(2129968),mt=t=>[t/8,1-t/32,64*t],vt={large_fern:()=>ht,tall_grass:()=>ht,grass_block:()=>ht,fern:()=>ht,grass:()=>ht,potted_fern:()=>ht,spruce_leaves:()=>ut,birch_leaves:()=>ct,oak_leaves:()=>dt,jungle_leaves:()=>dt,acacia_leaves:()=>dt,dark_oak_leaves:()=>dt,vine:()=>dt,water:()=>ft,bubble_column:()=>ft,cauldron:()=>ft,redstone_wire:t=>{var e;return(t=>{const e=t/15;return[.6*e+(e>0?.4:.3),L(e*e*.7-.5,0,1),L(e*e*.6-.7,0,1)]})(parseInt(null!==(e=t.power)&&void 0!==e?e:\"0\"))},sugar_cane:()=>ht,attached_melon_stem:()=>gt,attached_pumpkin_stem:()=>gt,melon_stem:t=>{var e;return mt(parseInt(null!==(e=t.age)&&void 0!==e?e:\"0\"))},pumpkin_stem:t=>{var e;return mt(parseInt(null!==(e=t.age)&&void 0!==e?e:\"0\"))},lily_pad:()=>pt};var bt;function St(...t){let e=0;for(const i of t)e+=i.length;const i=new Float32Array(e);let s=0;for(const e of t)i.set(e,s),s+=e.length;return i}function Et(t,e){const s=i.create();for(let n=0;nthis.matchesVariant(e,t)));if(0===e.length)return[];const i=this.variants[e[0]];return[Array.isArray(i)?i[0]:i]}if(this.multipart){return this.multipart.filter((e=>!e.when||this.matchesCase(e.when,t))).map((t=>Array.isArray(t.apply)?t.apply[0]:t.apply))}return[]}getBuffers(t,e,i,r,o,a){var l,h,u,c;const d=this.getModelVariants(e),f=[],g=[],p=[],m=[];for(const v of d){const d=bt.rotate(a,null!==(l=v.x)&&void 0!==l?l:0,null!==(h=v.y)&&void 0!==h?h:0),b=r.getBlockModel(v.model).getBuffers(t,e,i,o,d);if(v.x||v.y){const t=s.create();s.identity(t),s.translate(t,t,[8,8,8]),s.rotateY(t,t,-n.toRadian(null!==(u=v.y)&&void 0!==u?u:0)),s.rotateX(t,t,-n.toRadian(null!==(c=v.x)&&void 0!==c?c:0)),s.translate(t,t,[-8,-8,-8]),Et(b.position,t)}f.push(b.position),g.push(...b.texCoord),p.push(...b.tintColor),m.push(...b.index),o+=b.texCoord.length/2}const v=s.create();s.identity(v),s.scale(v,v,[.0625,.0625,.0625]);const b=St(...f);return Et(b,v),{position:b,texCoord:g,tintColor:p,index:m}}matchesVariant(t,e){return t.split(\",\").every((t=>{const[i,s]=t.split(\"=\");return e[i]===s}))}matchesCase(t,e){if(Array.isArray(t.OR))return t.OR.some((t=>this.matchesCase(t,e)));const i=t;return Object.keys(i).every((t=>i[t].split(\"|\").includes(e[t])))}static fromJson(t,e){return new It(t,e.variants,e.multipart)}}const wt={0:[0,3,2,3,2,1,0,1],90:[2,3,2,1,0,1,0,3],180:[2,1,0,1,0,3,2,3],270:[0,1,0,3,2,3,2,1]},At={x:[1,0,0],y:[0,1,0],z:[0,0,1]},Nt=1.41421356237,Ft={x:[1,Nt,Nt],y:[Nt,1,Nt],z:[Nt,Nt,1]};class _t{constructor(t,e,i,s){this.id=t,this.parent=e,this.textures=i,this.elements=s,this.flattened=!1}getBuffers(t,e,i,s,n){var r;const o=[],a=[],l=[],h=[];for(const u of null!==(r=this.elements)&&void 0!==r?r:[]){const r=this.getElementBuffers(t,e,u,s,i,n);o.push(r.position),a.push(...r.texCoord),l.push(...r.tintColor),h.push(...r.index),s+=r.texCoord.length/2}return{position:St(...o),texCoord:a,tintColor:l,index:h}}getElementBuffers(t,e,r,o,a,l){var h,u,c,d,f,g,p,m,v,b,S,E;const I=r.from[0],w=r.from[1],A=r.from[2],N=r.to[0],F=r.to[1],_=r.to[2],y=[],P=[],R=[],B=[],x=(i,s,n)=>{var r,l,h,u,c,d,f,g,p,m,v,b;const[S,E,I,w]=a.getTextureUV(this.getTexture(i.texture)),A=(I-S)/16,N=(w-E)/16,F=A/16,_=N/16;s[0]=(null!==(l=null===(r=i.uv)||void 0===r?void 0:r[0])&&void 0!==l?l:s[0])*A+F,s[1]=(null!==(u=null===(h=i.uv)||void 0===h?void 0:h[1])&&void 0!==u?u:s[1])*N+_,s[2]=(null!==(d=null===(c=i.uv)||void 0===c?void 0:c[2])&&void 0!==d?d:s[2])*A-F,s[3]=(null!==(g=null===(f=i.uv)||void 0===f?void 0:f[3])&&void 0!==g?g:s[3])*N-_;const x=wt[null!==(p=i.rotation)&&void 0!==p?p:0];P.push(S+s[x[0]],E+s[x[1]],S+s[x[2]],E+s[x[3]],S+s[x[4]],E+s[x[5]],S+s[x[6]],E+s[x[7]]);const T=(null!==(m=i.tintindex)&&void 0!==m?m:-1)>=0&&null!==(b=null===(v=vt[t.slice(10)])||void 0===v?void 0:v.call(vt,e))&&void 0!==b?b:[1,1,1];R.push(...T,...T,...T,...T),y.push(...n),B.push(o,o+1,o+2,o,o+2,o+3),o+=4};!(null===(u=null===(h=r.faces)||void 0===h?void 0:h.up)||void 0===u?void 0:u.texture)||r.faces.up.cullface&&l[r.faces.up.cullface]||x(r.faces.up,[I,16-_,N,16-A],[I,F,_,N,F,_,N,F,A,I,F,A]),!(null===(d=null===(c=r.faces)||void 0===c?void 0:c.down)||void 0===d?void 0:d.texture)||r.faces.down.cullface&&l[r.faces.down.cullface]||x(r.faces.down,[16-_,16-N,16-A,16-I],[I,w,A,N,w,A,N,w,_,I,w,_]),!(null===(g=null===(f=r.faces)||void 0===f?void 0:f.south)||void 0===g?void 0:g.texture)||r.faces.south.cullface&&l[r.faces.south.cullface]||x(r.faces.south,[I,16-F,N,16-w],[I,w,_,N,w,_,N,F,_,I,F,_]),!(null===(m=null===(p=r.faces)||void 0===p?void 0:p.north)||void 0===m?void 0:m.texture)||r.faces.north.cullface&&l[r.faces.north.cullface]||x(r.faces.north,[16-N,16-F,16-I,16-w],[N,w,A,I,w,A,I,F,A,N,F,A]),!(null===(b=null===(v=r.faces)||void 0===v?void 0:v.east)||void 0===b?void 0:b.texture)||r.faces.east.cullface&&l[r.faces.east.cullface]||x(r.faces.east,[16-_,16-F,16-A,16-w],[N,w,_,N,w,A,N,F,A,N,F,_]),!(null===(E=null===(S=r.faces)||void 0===S?void 0:S.west)||void 0===E?void 0:E.texture)||r.faces.west.cullface&&l[r.faces.west.cullface]||x(r.faces.west,[A,16-F,_,16-w],[I,w,A,I,w,_,I,F,_,I,F,A]);const T=s.create();if(s.identity(T),r.rotation){const t=i.fromValues(...r.rotation.origin);s.translate(T,T,t),s.rotate(T,T,n.toRadian(r.rotation.angle),At[r.rotation.axis]),r.rotation.rescale&&s.scale(T,T,Ft[r.rotation.axis]),i.negate(t,t),s.translate(T,T,t)}const C=new Float32Array(y);return Et(C,T),{position:C,texCoord:P,tintColor:R,index:B}}getTexture(t){for(var e,i;t.startsWith(\"#\");)t=null!==(i=null===(e=this.textures)||void 0===e?void 0:e[t.slice(1)])&&void 0!==i?i:\"\";return t.startsWith(\"minecraft:\")||(t=\"minecraft:\"+t),t}flatten(t){var e;if(!this.flattened&&this.parent){const i=t.getBlockModel(this.parent);if(!i)return console.warn(`parent ${this.parent} does not exist!`),void(this.flattened=!0);i.flatten(t),this.elements||(this.elements=i.elements),this.textures||(this.textures={}),Object.keys(null!==(e=i.textures)&&void 0!==e?e:{}).forEach((t=>{this.textures[t]||(this.textures[t]=i.textures[t])})),this.flattened=!0}}static fromJson(t,e){let i=e.parent;return i&&!i.startsWith(\"minecraft:\")&&(i=\"minecraft:\"+i),new _t(t,i,e.textures,e.elements)}}class yt{constructor(t,e,i){this.gl=t,this.program=this.initShaderProgram(e,i)}getProgram(){return this.program}initShaderProgram(t,e){const i=this.loadShader(this.gl.VERTEX_SHADER,t),s=this.loadShader(this.gl.FRAGMENT_SHADER,e),n=this.gl.createProgram();if(this.gl.attachShader(n,i),this.gl.attachShader(n,s),this.gl.linkProgram(n),!this.gl.getProgramParameter(n,this.gl.LINK_STATUS))throw new Error(`Unable to link shader program: ${this.gl.getProgramInfoLog(n)}`);return n}loadShader(t,e){const i=this.gl.createShader(t);if(this.gl.shaderSource(i,e),this.gl.compileShader(i),!this.gl.getShaderParameter(i,this.gl.COMPILE_STATUS)){const e=new Error(`Compiling ${t===this.gl.VERTEX_SHADER?\"vertex\":\"fragment\"} shader: ${this.gl.getShaderInfoLog(i)}`);throw this.gl.deleteShader(i),e}return i}}function Pt(t,e,i,s,n){const r=new It(\"\",{\"\":{model:\"\"}},void 0),o={getBlockModel:()=>n};return n.flatten(o),r.getBuffers(t,{},e,o,i,s)}function Rt(t,e,i,s,n,o){const a=n.up?16:[14.2,12.5,10.5,9,7,5.3,3.7,1.9,16,16,16,16,16,16,16,16][i];return Pt(`minecraft:${t}`,s,e,n,new _t(\"\",\"\",{still:`minecraft:block/${t}_still`,flow:`minecraft:block/${t}_flow`},[{from:[0,0,0],to:[16,a,16],faces:{up:{texture:\"#still\",tintindex:o,cullface:r.UP},down:{texture:\"#still\",tintindex:o,cullface:r.DOWN},north:{texture:\"#flow\",tintindex:o,cullface:r.NORTH},east:{texture:\"#flow\",tintindex:o,cullface:r.EAST},south:{texture:\"#flow\",tintindex:o,cullface:r.SOUTH},west:{texture:\"#flow\",tintindex:o,cullface:r.WEST}}}]))}const Bt={\"minecraft:water\":(t,e,i,s)=>Rt(\"water\",t,parseInt(e.level),i,s,0),\"minecraft:lava\":(t,e,i,s)=>Rt(\"lava\",t,parseInt(e.level),i,s),\"minecraft:chest\":(t,e,i)=>function(t,e,i,s){return Pt(\"minecraft:chest\",s,t,{},new _t(\"\",\"\",{0:\"minecraft:block/chest\"},[{from:[1,0,1],to:[15,14,15],faces:{up:{texture:\"#0\"},down:{texture:\"#0\"},north:{texture:\"#0\"},east:{texture:\"#0\"},south:{texture:\"#0\"},west:{texture:\"#0\"}}}]))}(t,e.facing,e.type,i)},xt=new Set(Object.keys(Bt));class Tt{constructor(t,e,i,s){var n,r;this.gl=t,this.structure=e,this.resources=i,this.chunks=[],(null==s?void 0:s.facesPerBuffer)&&console.warn(\"webgl render warning: facesPerBuffer option has been removed in favor of chunkSize\"),this.chunkSize=null!==(n=null==s?void 0:s.chunkSize)&&void 0!==n?n:16,this.useInvisibleBlockBuffer=null===(r=null==s?void 0:s.useInvisibleBlockBuffer)||void 0===r||r,this.shaderProgram=new yt(t,\"\\n attribute vec4 vertPos;\\n attribute vec2 texCoord;\\n attribute vec3 tintColor;\\n attribute vec3 normal;\\n\\n uniform mat4 mView;\\n uniform mat4 mProj;\\n\\n varying highp vec2 vTexCoord;\\n varying highp vec3 vTintColor;\\n varying highp float vLighting;\\n\\n void main(void) {\\n gl_Position = mProj * mView * vertPos;\\n vTexCoord = texCoord;\\n vTintColor = tintColor;\\n vLighting = normal.y * 0.2 + abs(normal.z) * 0.1 + 0.8;\\n }\\n\",\"\\n precision highp float;\\n varying highp vec2 vTexCoord;\\n varying highp vec3 vTintColor;\\n varying highp float vLighting;\\n\\n uniform sampler2D sampler;\\n\\n void main(void) {\\n vec4 texColor = texture2D(sampler, vTexCoord);\\n if(texColor.a < 0.01) discard;\\n gl_FragColor = vec4(texColor.xyz * vTintColor * vLighting, texColor.a);\\n }\\n\").getProgram(),this.gridShaderProgram=new yt(t,\"\\n attribute vec4 vertPos;\\n attribute vec3 vertColor;\\n\\n uniform mat4 mView;\\n uniform mat4 mProj;\\n\\n varying highp vec3 vColor;\\n\\n void main(void) {\\n gl_Position = mProj * mView * vertPos;\\n vColor = vertColor;\\n }\\n\",\"\\n precision highp float;\\n varying highp vec3 vColor;\\n\\n void main(void) {\\n gl_FragColor = vec4(vColor, 1.0);\\n }\\n\").getProgram(),this.colorShaderProgram=new yt(t,\"\\n attribute vec4 vertPos;\\n attribute vec3 blockPos;\\n\\n uniform mat4 mView;\\n uniform mat4 mProj;\\n\\n varying highp vec3 vColor;\\n\\n void main(void) {\\n gl_Position = mProj * mView * vertPos;\\n vColor = blockPos / 256.0;\\n }\\n\",\"\\n precision highp float;\\n varying highp vec3 vColor;\\n\\n void main(void) {\\n gl_FragColor = vec4(vColor, 1.0);\\n }\\n\").getProgram(),this.updateStructureBuffers(),this.gridBuffers=this.getGridBuffers(),this.outlineBuffers=this.getOutlineBuffers(),this.invisibleBlockBuffers=this.getInvisibleBlockBuffers(),this.atlasTexture=this.getBlockTexture(),this.projMatrix=this.getPerspective(),this.activeShader=this.shaderProgram,this.initialize()}setStructure(t){this.structure=t,this.updateStructureBuffers(),this.gridBuffers=this.getGridBuffers(),this.invisibleBlockBuffers=this.getInvisibleBlockBuffers()}initialize(){this.gl.enable(this.gl.DEPTH_TEST),this.gl.depthFunc(this.gl.LEQUAL),this.gl.enable(this.gl.BLEND),this.gl.blendFunc(this.gl.SRC_ALPHA,this.gl.ONE_MINUS_SRC_ALPHA),this.gl.enable(this.gl.CULL_FACE),this.gl.cullFace(this.gl.BACK)}getBlockTexture(){const t=this.gl.createTexture();return this.gl.bindTexture(this.gl.TEXTURE_2D,t),this.gl.texImage2D(this.gl.TEXTURE_2D,0,this.gl.RGBA,this.gl.RGBA,this.gl.UNSIGNED_BYTE,this.resources.getTextureAtlas()),this.gl.generateMipmap(this.gl.TEXTURE_2D),this.gl.texParameteri(this.gl.TEXTURE_2D,this.gl.TEXTURE_MAG_FILTER,this.gl.NEAREST),t}getPerspective(){const t=70*Math.PI/180,e=this.gl.canvas.clientWidth/this.gl.canvas.clientHeight,i=s.create();return s.perspective(i,t,e,.1,500),i}getChunk(t){const e=2*Math.abs(t[0])+(t[0]<0?1:0),i=2*Math.abs(t[1])+(t[1]<0?1:0),s=2*Math.abs(t[2])+(t[2]<0?1:0);return this.chunks[e]||(this.chunks[e]=[]),this.chunks[e][i]||(this.chunks[e][i]=[]),this.chunks[e][i][s]||(this.chunks[e][i][s]={positions:[],textureCoordinates:[],tintColors:[],blockPositions:[],normals:[],indices:[],indexOffset:0}),this.chunks[e][i][s]}updateStructureBuffers(t){var e;const n=(t,e,n)=>{const r=s.create();s.translate(r,r,e),Et(t.position,r),n.positions.push(t.position),n.textureCoordinates.push(...t.texCoord),n.tintColors.push(...t.tintColor);for(let e=0;e{t.positions=[],t.textureCoordinates=[],t.tintColors=[],t.blockPositions=[],t.normals=[],t.indices=[],t.indexOffset=0},a=t=>{t.buffer?(this.updateBuffer(t.buffer.position,this.gl.ARRAY_BUFFER,St(...t.positions)),this.updateBuffer(t.buffer.texCoord,this.gl.ARRAY_BUFFER,new Float32Array(t.textureCoordinates)),this.updateBuffer(t.buffer.tintColor,this.gl.ARRAY_BUFFER,new Float32Array(t.tintColors)),this.updateBuffer(t.buffer.normal,this.gl.ARRAY_BUFFER,new Float32Array(t.normals)),this.updateBuffer(t.buffer.blockPos,this.gl.ARRAY_BUFFER,new Float32Array(t.blockPositions)),this.updateBuffer(t.buffer.index,this.gl.ELEMENT_ARRAY_BUFFER,new Uint16Array(t.indices)),t.buffer.length=t.indices.length):t.buffer={position:this.createBuffer(this.gl.ARRAY_BUFFER,St(...t.positions)),texCoord:this.createBuffer(this.gl.ARRAY_BUFFER,new Float32Array(t.textureCoordinates)),tintColor:this.createBuffer(this.gl.ARRAY_BUFFER,new Float32Array(t.tintColors)),blockPos:this.createBuffer(this.gl.ARRAY_BUFFER,new Float32Array(t.blockPositions)),normal:this.createBuffer(this.gl.ARRAY_BUFFER,new Float32Array(t.normals)),index:this.createBuffer(this.gl.ELEMENT_ARRAY_BUFFER,new Uint16Array(t.indices)),length:t.indices.length}};let l;t?t.forEach((t=>{const e=this.getChunk(t);o(e)})):this.chunks.forEach((t=>t.forEach((t=>t.forEach((t=>{o(t)}))))));for(const s of this.structure.getBlocks()){const o=s.state.getName(),a=s.state.getProperties(),h=null!==(e=this.resources.getDefaultBlockProperties(o))&&void 0!==e?e:{};Object.entries(h).forEach((([t,e])=>{a[t]||(a[t]=e)}));const u=[Math.floor(s.pos[0]/this.chunkSize),Math.floor(s.pos[1]/this.chunkSize),Math.floor(s.pos[2]/this.chunkSize)];if(t&&!t.some((t=>i.equals(t,u))))continue;const c=this.getChunk(u);try{const t=this.resources.getBlockDefinition(o),e={up:this.needsCull(s,r.UP),down:this.needsCull(s,r.DOWN),west:this.needsCull(s,r.WEST),east:this.needsCull(s,r.EAST),north:this.needsCull(s,r.NORTH),south:this.needsCull(s,r.SOUTH)};t&&(l=t.getBuffers(o,a,this.resources,this.resources,c.indexOffset,e),n(l,s.pos,c)),xt.has(o)&&(l=Bt[o](c.indexOffset,a,this.resources,e),n(l,s.pos,c))}catch(t){console.error(`Error rendering block ${o}`,t)}}t?t.forEach((t=>{const e=this.getChunk(t);a(e)})):this.chunks.forEach((t=>t.forEach((t=>t.forEach((t=>{a(t)}))))))}needsCull(t,e){var i,s;const n=null===(i=this.structure.getBlock(a.towards(t.pos,e)))||void 0===i?void 0:i.state;return!!n&&((null===(s=this.resources.getBlockFlags(n.getName()))||void 0===s?void 0:s.opaque)?!(e===r.UP&&t.state.isFluid()):t.state.isFluid()&&n.isFluid())}getGridBuffers(){const[t,e,i]=this.structure.getSize(),s=[],n=[];s.push(0,0,0,t,0,0),n.push(1,0,0,1,0,0),s.push(0,0,0,0,0,i),n.push(0,0,1,0,0,1),s.push(0,0,0,0,e,0),s.push(t,0,0,t,e,0),s.push(0,0,i,0,e,i),s.push(t,0,i,t,e,i),s.push(0,e,0,0,e,i),s.push(t,e,0,t,e,i),s.push(0,e,0,t,e,0),s.push(0,e,i,t,e,i);for(let e=1;e<=t;e+=1)s.push(e,0,0,e,0,i);for(let e=1;e<=i;e+=1)s.push(0,0,e,t,0,e);for(let e=0;e<8+t+i;e+=1)n.push(.8,.8,.8,.8,.8,.8);return{position:this.createBuffer(this.gl.ARRAY_BUFFER,new Float32Array(s)),color:this.createBuffer(this.gl.ARRAY_BUFFER,new Float32Array(n)),length:s.length/3}}getOutlineBuffers(){const t=[],e=[];return this.addCube(t,e,[1,1,1],[0,0,0],[1,1,1]),{position:this.createBuffer(this.gl.ARRAY_BUFFER,new Float32Array(t)),color:this.createBuffer(this.gl.ARRAY_BUFFER,new Float32Array(e)),length:t.length/3}}getInvisibleBlockBuffers(){if(!this.useInvisibleBlockBuffer)return;const t=this.structure.getSize(),e=[],i=[];for(let s=0;s{t.forEach((t=>{t.forEach((t=>{t.buffer&&(this.setVertexAttr(\"vertPos\",3,t.buffer.position),this.setVertexAttr(\"texCoord\",2,t.buffer.texCoord),this.setVertexAttr(\"tintColor\",3,t.buffer.tintColor),this.setVertexAttr(\"normal\",3,t.buffer.normal),this.gl.bindBuffer(this.gl.ELEMENT_ARRAY_BUFFER,t.buffer.index),this.gl.drawElements(this.gl.TRIANGLES,t.buffer.length,this.gl.UNSIGNED_SHORT,0))}))}))}))}drawColoredStructure(t){this.setShader(this.colorShaderProgram),this.setUniform(\"mView\",t),this.setUniform(\"mProj\",this.projMatrix),this.chunks.forEach((t=>{t.forEach((t=>{t.forEach((t=>{t.buffer&&(this.setVertexAttr(\"vertPos\",3,t.buffer.position),this.setVertexAttr(\"blockPos\",3,t.buffer.blockPos),this.gl.bindBuffer(this.gl.ELEMENT_ARRAY_BUFFER,t.buffer.index),this.gl.drawElements(this.gl.TRIANGLES,t.buffer.length,this.gl.UNSIGNED_SHORT,0))}))}))}))}drawOutline(t,e){this.setShader(this.gridShaderProgram),this.setVertexAttr(\"vertPos\",3,this.outlineBuffers.position),this.setVertexAttr(\"vertColor\",3,this.outlineBuffers.color);const i=s.create();s.copy(i,t),s.translate(i,i,e),this.setUniform(\"mView\",i),this.setUniform(\"mProj\",this.projMatrix),this.gl.drawArrays(this.gl.LINES,0,this.outlineBuffers.length)}setViewport(t,e,i,s){this.gl.viewport(t,e,i,s),this.projMatrix=this.getPerspective()}setShader(t){this.gl.useProgram(t),this.activeShader=t}setVertexAttr(t,e,i){const s=this.gl.getAttribLocation(this.activeShader,t);this.gl.bindBuffer(this.gl.ARRAY_BUFFER,i),this.gl.vertexAttribPointer(s,e,this.gl.FLOAT,!1,0,0),this.gl.enableVertexAttribArray(s)}setUniform(t,e){const i=this.gl.getUniformLocation(this.activeShader,t);this.gl.uniformMatrix4fv(i,!1,e)}}\n/*! *****************************************************************************\nCopyright (c) Microsoft Corporation.\n\nPermission to use, copy, modify, and/or distribute this software for any\npurpose with or without fee is hereby granted.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\" AND THE AUTHOR DISCLAIMS ALL WARRANTIES WITH\nREGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY\nAND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT,\nINDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM\nLOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR\nOTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR\nPERFORMANCE OF THIS SOFTWARE.\n***************************************************************************** */function Ct(t,e,i,s){return new(i||(i=Promise))((function(n,r){function o(t){try{l(s.next(t))}catch(t){r(t)}}function a(t){try{l(s.throw(t))}catch(t){r(t)}}function l(t){var e;t.done?n(t.value):(e=t.value,e instanceof i?e:new i((function(t){t(e)}))).then(o,a)}l((s=s.apply(t,e||[])).next())}))}class kt{constructor(t,e){this.img=t,this.idMap=e,this.part=16/t.width}getTextureAtlas(){return this.img}getTextureUV(t){var e;return null!==(e=this.idMap[t])&&void 0!==e?e:[0,0,this.part,this.part]}static fromBlobs(t){return Ct(this,void 0,void 0,(function*(){const e=Math.sqrt(Object.keys(t).length+1),i=Math.pow(2,Math.ceil(Math.log(e)/Math.log(2))),s=16*i,n=1/i,r=document.createElement(\"canvas\");r.width=s,r.height=s;const o=r.getContext(\"2d\");this.drawInvalidTexture(o);const a={};let l=1;return yield Promise.all(Object.keys(t).map((e=>Ct(this,void 0,void 0,(function*(){const s=l%i,r=Math.floor(l/i);l+=1,a[e]=[n*s,n*r,n*s+n,n*r+n];const h=yield createImageBitmap(t[e]);o.drawImage(h,0,0,16,16,16*s,16*r,16,16)}))))),new kt(o.getImageData(0,0,s,s),a)}))}static empty(){const t=document.createElement(\"canvas\");t.width=16,t.height=16;const e=t.getContext(\"2d\");return kt.drawInvalidTexture(e),new kt(e.getImageData(0,0,16,16),{})}static drawInvalidTexture(t){t.fillStyle=\"black\",t.fillRect(0,0,16,16),t.fillStyle=\"magenta\",t.fillRect(0,0,8,8),t.fillRect(8,8,8,8)}}var Dt,Mt,Ot,Lt,Ut,Yt,Gt,Ht,Vt,zt,jt,Jt,Xt;!function(t){function e(t,e){return\"number\"==typeof t?new i(t,null!=e?e:t):t}t.target=function(t,e,i,s,r,o){return new n(t,e,i,s,r,o)},t.parameters=function(t,i,n,r,o,a,l){return new s(e(t),e(i),e(n),e(r),e(o),e(a),l)},t.param=e;class i{constructor(t,e){this.min=t,this.max=e}distance(t){const e=(\"number\"==typeof t?t:t.min)-this.max,i=this.min-(\"number\"==typeof t?t:t.max);return e>0?e:Math.max(i,0)}union(t){return new i(Math.min(this.min,t.min),Math.max(this.max,t.max))}static fromJson(t){var e;if(\"number\"==typeof t)return new i(t,t);const[s,n]=null!==(e=_.readArray(t,(t=>_.readNumber(t))))&&void 0!==e?e:[];return new i(null!=s?s:0,null!=n?n:0)}}t.Param=i;class s{constructor(t,e,i,s,n,r,o){this.temperature=t,this.humidity=e,this.continentalness=i,this.erosion=s,this.depth=n,this.weirdness=r,this.offset=o}fittness(t){return O(this.temperature.distance(t.temperature))+O(this.humidity.distance(t.humidity))+O(this.continentalness.distance(t.continentalness))+O(this.erosion.distance(t.erosion))+O(this.depth.distance(t.depth))+O(this.weirdness.distance(t.weirdness))+O(this.offset-t.offset)}space(){return[this.temperature,this.humidity,this.continentalness,this.erosion,this.depth,this.weirdness,new i(this.offset,this.offset)]}static fromJson(t){var e,n;const r=null!==(e=_.readObject(t))&&void 0!==e?e:{};return new s(i.fromJson(r.temperature),i.fromJson(r.humidity),i.fromJson(r.continentalness),i.fromJson(r.erosion),i.fromJson(r.depth),i.fromJson(r.weirdness),null!==(n=_.readInt(r.offset))&&void 0!==n?n:0)}}t.ParamPoint=s;class n{constructor(t,e,i,s,n,r){this.temperature=t,this.humidity=e,this.continentalness=i,this.erosion=s,this.depth=n,this.weirdness=r}get offset(){return 0}toArray(){return[this.temperature,this.humidity,this.continentalness,this.erosion,this.depth,this.weirdness,this.offset]}}t.TargetPoint=n;t.Parameters=class{constructor(t){this.things=t,this.index=new r(t)}find(t){return this.index.search(t,((t,e)=>t.distance(e)))}};class r{constructor(t){this.root=r.build(t.map((([t,e])=>new l(t,e))))}static build(t){if(1===t.length)return t[0];if(t.length<=r.CHILDREN_PER_NODE){const e=t.map((t=>{let e=0;for(let i=0;i<7;i+=1){const s=t.space[i];e+=Math.abs((s.min+s.max)/2)}return{key:e,node:t}})).sort(((t,e)=>t.key-e.key)).map((({node:t})=>t));return new a(e)}let e=1/0,i=-1,s=[];for(let n=0;n<7;++n){t=r.sort(t,n,!1),s=r.bucketize(t);let o=0;for(const t of s)o+=r.area(t.space);e>o&&(e=o,i=n)}return t=r.sort(t,i,!1),s=r.bucketize(t),s=r.sort(s,i,!0),new a(s.map((t=>r.build(t.children))))}static sort(t,e,i){return t.map((t=>{const s=t.space[e],n=(s.min+s.max)/2;return{key:i?Math.abs(n):n,node:t}})).sort(((t,e)=>t.key-e.key)).map((({node:t})=>t))}static bucketize(t){const e=[];let i=[];const s=Math.pow(10,Math.floor(Math.log(t.length-.01)/Math.log(10)));for(const n of t)i.push(n),i.lengthnew i(1/0,-1/0)));for(const i of t)e=[...Array(7)].map(((t,s)=>e[s].union(i.space[s])));return e}search(t,e){let i=1/0,s=null;for(const n of this.children){const r=e(n,t);if(i<=r)continue;const o=n.search(t,e),a=n==o?r:e(o,t);i<=a||(i=a,s=o)}return s}}t.RSubTree=a;class l extends o{constructor(t,e){super(t.space()),this.thing=e}search(){return this}}t.RLeaf=l}(Dt||(Dt={}));class Zt{constructor(t){this.biome=t}getBiome(){return this.biome}static fromJson(t){var e,i;const s=null!==(e=_.readObject(t))&&void 0!==e?e:{},n=null!==(i=_.readString(s.biome))&&void 0!==i?i:\"minecraft:the_void\";return new Zt(n)}}class Wt{constructor(t){this.parameters=t}getBiome(t,e,i,s){const n=s(t,e,i);return this.parameters.find(n)}static fromJson(t){var e,i;const s=null!==(e=_.readObject(t))&&void 0!==e?e:{},n=(null!==(i=_.readArray(s.biomes,(t=>{var e;return(t=>{var e;return{biome:null!==(e=_.readString(t.biome))&&void 0!==e?e:\"minecraft:the_void\",parameters:Dt.ParamPoint.fromJson(t.parameters)}})(null!==(e=_.readObject(t))&&void 0!==e?e:{})})))&&void 0!==i?i:[]).map((t=>[t.parameters,()=>t.biome]));return new Wt(new Dt.Parameters(n))}}class qt{constructor(t,e,i){this.offsetSampler=t,this.factorSampler=e,this.jaggednessSampler=i}static extractor(t){return{apply:e=>e[t],toJson:()=>t}}static fromJson(t){var e;const i=null!==(e=_.readObject(t))&&void 0!==e?e:{};return new qt(B.fromJson(i.offset,this.EXTRACTOR),B.fromJson(i.factor,this.EXTRACTOR),B.fromJson(i.jaggedness,this.EXTRACTOR))}toJson(){return{offset:this.offsetSampler.toJson(),factor:this.factorSampler.toJson(),jaggedness:this.jaggednessSampler.toJson()}}offset(t){return this.offsetSampler.apply(t)+qt.GLOBAL_OFFSET}factor(t){return this.factorSampler.apply(t)}jaggedness(t){return this.jaggednessSampler.apply(t)}static point(t,e,i){return{continents:t,erosion:e,weirdness:i,ridges:this.peaksAndValleys(i)}}static peaksAndValleys(t){return 3*-(Math.abs(Math.abs(t)-.6666667)-.33333334)}static overworld(){const t=this.buildErosionOffsetSpline(-.05,0,0,.1,0,-.03,!1,!1),e=this.buildErosionOffsetSpline(-.1,.03,.1,.1,.01,-.03,!1,!1),i=this.buildErosionOffsetSpline(-.1,.03,.1,.7,.01,-.03,!0,!0),s=this.buildErosionOffsetSpline(.3,.03,.1,1,.01,.01,!0,!0),n=new at(this.CONTINENTS).addPoint(-1.1,.044).addPoint(-1.02,-.2222).addPoint(-.51,-.2222).addPoint(-.44,-.12).addPoint(-.18,-.12).addPoint(-.16,t).addPoint(-.15,t).addPoint(-.1,e).addPoint(.25,i).addPoint(1,s),r=new at(this.CONTINENTS).addPoint(-.19,3.95).addPoint(-.15,this.getErosionFactor(6.25,!0)).addPoint(-.1,this.getErosionFactor(5.47,!0)).addPoint(.03,this.getErosionFactor(5.08,!0)).addPoint(.06,this.getErosionFactor(4.69,!1)),o=new at(this.CONTINENTS).addPoint(.11,0).addPoint(.03,this.buildErosionJaggednessSpline(1,.5,0,0)).addPoint(.65,this.buildErosionJaggednessSpline(1,1,1,0));return new qt(n,r,o)}static getErosionFactor(t,e){const i=new at(this.WEIRDNESS).addPoint(-.2,6.3).addPoint(.2,t),s=new at(this.EROSION).addPoint(-.6,i).addPoint(-.5,new at(this.WEIRDNESS).addPoint(-.05,6.3).addPoint(.05,2.67)).addPoint(-.35,i).addPoint(-.25,i).addPoint(-.1,new at(this.WEIRDNESS).addPoint(-.05,2.67).addPoint(.05,6.3)).addPoint(.03,i);if(e){const e=new at(this.WEIRDNESS).addPoint(0,t).addPoint(.1,.625),i=new at(this.RIDGES).addPoint(-.9,t).addPoint(-.69,e);s.addPoint(.35,t).addPoint(.45,i).addPoint(.55,i).addPoint(.62,t)}else{const e=new at(this.RIDGES).addPoint(-.7,i).addPoint(-.15,1.37),n=new at(this.RIDGES).addPoint(.45,i).addPoint(.7,1.56);s.addPoint(.05,n).addPoint(.4,n).addPoint(.45,e).addPoint(.55,e).addPoint(.58,t)}return s}static buildErosionOffsetSpline(t,e,i,s,n,r,o,a){const l=this.buildMountainRidgeSplineWithPoints(U(s,.6,1.5),a),h=this.buildMountainRidgeSplineWithPoints(U(s,.6,1),a),u=this.buildMountainRidgeSplineWithPoints(s,a),c=this.ridgeSpline(t-.15,.5*s,U(.5,.5,.5)*s,.5*s,.6*s,.5),d=this.ridgeSpline(t,n*s,e*s,.5*s,.6*s,.5),f=this.ridgeSpline(t,n,n,e,i,.5),g=this.ridgeSpline(t,n,n,e,i,.5),p=new at(this.RIDGES).addPoint(-1,t).addPoint(-.4,f).addPoint(0,i+.07),m=this.ridgeSpline(-.02,r,r,e,i,0),v=new at(this.EROSION).addPoint(-.85,l).addPoint(-.7,h).addPoint(-.4,u).addPoint(-.35,c).addPoint(-.1,d).addPoint(.2,f);return o&&v.addPoint(.4,g).addPoint(.45,p).addPoint(.55,p).addPoint(.58,g),v.addPoint(.7,m),v}static buildMountainRidgeSplineWithPoints(t,e){const i=new at(this.RIDGES),s=this.mountainContinentalness(-1,t,-.7),n=this.mountainContinentalness(1,t,-.7),r=this.calculateMountainRidgeZeroContinentalnessPoint(t);if(-.650?this.buildWeirdnessJaggednessSpline(e):0).addPoint(1,t>0?this.buildWeirdnessJaggednessSpline(t):0)}static buildWeirdnessJaggednessSpline(t){return new at(qt.WEIRDNESS).addPoint(-.01,.63*t).addPoint(.01,.3*t)}}qt.GLOBAL_OFFSET=-.50375,qt.EXTRACTOR=t=>{var e;const i=null!==(e=_.readString(t))&&void 0!==e?e:\"continents\";return qt.extractor(i)},qt.CONTINENTS=qt.extractor(\"continents\"),qt.EROSION=qt.extractor(\"erosion\"),qt.WEIRDNESS=qt.extractor(\"weirdness\"),qt.RIDGES=qt.extractor(\"ridges\"),function(t){t.fromList=function(t){return(e,i,s,n)=>{for(const r of t){const t=r(e,i,s,n);if(t)return t}return null}}}(Mt||(Mt={})),function(t){function e(t){return t.ySize<<2}t.fromJson=function(t){var e,i,s,n,r,o,a,l;const h=null!==(e=_.readObject(t))&&void 0!==e?e:{};return{minY:null!==(i=_.readInt(h.min_y))&&void 0!==i?i:0,height:null!==(s=_.readInt(h.height))&&void 0!==s?s:256,xzSize:null!==(n=_.readInt(h.size_horizontal))&&void 0!==n?n:1,ySize:null!==(r=_.readInt(h.size_vertical))&&void 0!==r?r:1,sampling:P.fromJson(h.sampling),topSlide:Lt.fromJson(h.top_slide),bottomSlide:Lt.fromJson(h.bottom_slide),terrainShaper:qt.fromJson(h.terrain_shaper),islandNoiseOverride:null!==(o=_.readBoolean(h.island_noise_override))&&void 0!==o&&o,isAmplified:null!==(a=_.readBoolean(h.amplified))&&void 0!==a&&a,hasLargeBiomes:null!==(l=_.readBoolean(h.large_biomes))&&void 0!==l&&l}},t.cellHeight=e,t.cellWidth=function(t){return t.xzSize<<2},t.cellCountY=function(t){return t.height/e(t)},t.minCellY=function(t){return Math.floor(t.minY/e(t))}}(Ot||(Ot={})),function(t){t.fromJson=function(t){var e,i,s,n;const r=null!==(e=_.readObject(t))&&void 0!==e?e:{};return{target:null!==(i=_.readNumber(r.target))&&void 0!==i?i:0,size:null!==(s=_.readInt(r.size))&&void 0!==s?s:0,offset:null!==(n=_.readInt(r.offset))&&void 0!==n?n:0}},t.apply=function(t,e,i){if(t.size<=0)return e;const s=(i-t.offset)/t.size;return H(t.target,e,s)}}(Lt||(Lt={}));class $t{constructor(t,e){this.chunk=t,this.filler=e,this.noise000=0,this.noise001=0,this.noise100=0,this.noise101=0,this.noise010=0,this.noise011=0,this.noise110=0,this.noise111=0,this.valueXZ00=0,this.valueXZ10=0,this.valueXZ01=0,this.valueXZ11=0,this.valueZ0=0,this.valueZ1=0,this.value=0,this.slice0=$t.allocateSlice(t.cellCountY,t.cellCountXZ),this.slice1=$t.allocateSlice(t.cellCountY,t.cellCountXZ)}static allocateSlice(t,e){const i=Array(e+1);for(let s=0;s>2,this.firstNoiseZ=r>>2,this.interpolators=[];const h=t*l>>2;this.noiseData=Array(h+1);for(let t=0;t<=h;t+=1){const e=this.firstNoiseX+t;this.noiseData[t]=Array(h+1);for(let i=0;i<=h;i+=1){const n=this.firstNoiseZ+i;this.noiseData[t][i]=s.noiseData(e,n)}}this.preliminarySurfaceLevel=new Map,this.baseNoise=s.makeBaseNoiseFiller(this,o,a.noodleCavesEnabled)}getNoiseData(t,e){return this.noiseData[t-this.firstNoiseX][e-this.firstNoiseZ]}getPreliminarySurfaceLevel(t,e){return M(this.preliminarySurfaceLevel,y.asLong(t,e),(()=>{const i=t-this.firstNoiseX,s=e-this.firstNoiseZ,n=this.noiseData.length,r=i>=0&&s>=0&&it.initializeForFirstCellX()))}advanceCellX(t){this.interpolators.forEach((e=>e.advanceCellX(t)))}selectCellYZ(t,e){this.interpolators.forEach((i=>i.selectCellYZ(t,e)))}updateForY(t){this.interpolators.forEach((e=>e.updateForY(t)))}updateForX(t){this.interpolators.forEach((e=>e.updateForX(t)))}updateForZ(t){this.interpolators.forEach((e=>e.updateForZ(t)))}swapSlices(){this.interpolators.forEach((t=>t.swapSlices()))}updateNoiseAndGenerateBaseState(t,e,i){return this.baseNoise(t,e,i)}}!function(t){t.create=function(t,e,i){return{offset:t,factor:e,jaggedness:i}}}(Ut||(Ut={})),function(t){const e=new Map;function i(t,i,s){const n=Object.assign({name:`minecraft:${t}`},R.create(i,s));return e.set(t,n),n}t.TEMPERATURE=i(\"temperature\",-10,[1.5,0,1,0,0,0]),t.VEGETATION=i(\"vegetation\",-8,[1,1,0,0,0,0]),t.CONTINENTALNESS=i(\"continentalness\",-9,[1,1,2,2,2,1,1,1,1]),t.EROSION=i(\"erosion\",-9,[1,1,0,1,1]),t.TEMPERATURE_LARGE=i(\"temperature_large\",-12,[1.5,0,1,0,0,0]),t.VEGETATION_LARGE=i(\"vegetation_large\",-10,[1,1,0,0,0,0]),t.CONTINENTALNESS_LARGE=i(\"continentalness_large\",-11,[1,1,2,2,2,1,1,1,1]),t.EROSION_LARGE=i(\"erosion_large\",-11,[1,1,0,1,1]),t.RIDGE=i(\"ridge\",-7,[1,2,1,0,0,0]),t.SHIFT=i(\"offset\",-3,[1,1,1,0]),t.PILLAR=i(\"pillar\",-7,[1,1]),t.PILLAR_RARENESS=i(\"pillar_rareness\",-8,[1]),t.PILLAR_THICKNESS=i(\"pillar_thickness\",-8,[1]),t.SPAGHETTI_2D=i(\"spaghetti_2d\",-8,[1]),t.SPAGHETTI_2D_ELEVATION=i(\"spaghetti_2d_elevation\",-8,[1]),t.SPAGHETTI_2D_MODULATOR=i(\"spaghetti_2d_modulator\",-8,[1]),t.SPAGHETTI_2D_THICKNESS=i(\"spaghetti_2d_thickness\",-8,[1]),t.SPAGHETTI_3D_1=i(\"spaghetti_3d_1\",-8,[1]),t.SPAGHETTI_3D_2=i(\"spaghetti_3d_2\",-8,[1]),t.SPAGHETTI_3D_RARITY=i(\"spaghetti_3d_rarity\",-8,[1]),t.SPAGHETTI_3D_THICKNESS=i(\"spaghetti_3d_thickness\",-8,[1]),t.SPAGHETTI_ROUGHNESS=i(\"spaghetti_roughness\",-8,[1]),t.SPAGHETTI_ROUGHNESS_MODULATOR=i(\"spaghetti_roughness_modulator\",-8,[1]),t.CAVE_ENTRANCE=i(\"cave_entrance\",-7,[.4,.5,1]),t.CAVE_LAYER=i(\"cave_layer\",-8,[1]),t.CAVE_CHEESE=i(\"cave_cheese\",-8,[.5,1,2,1,2,1,0,2,0]),t.NOODLE=i(\"noodle\",-8,[1]),t.NOODLE_THICKNESS=i(\"noodle_thickness\",-8,[1]),t.NOODLE_RIDGE_A=i(\"noodle_ridge_a\",-7,[1]),t.NOODLE_RIDGE_B=i(\"noodle_ridge_b\",-7,[1]),t.JAGGED=i(\"jagged\",-16,[1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1]),t.SURFACE=i(\"surface\",-6,[1,1,1]),t.SURFACE_SECONDARY=i(\"surface_secondary\",-6,[1,1,0,1]),t.instantiate=function(t,e){return new nt(t.fromHashOf(e.name),e)}}(Yt||(Yt={}));class Qt{constructor(t,e,i,s=!1){this.settings=t,this.isNoiseCavesEnabled=e;const n=t.hasLargeBiomes,r=(s?new q(i):K.create(i)).forkPositional();s?(this.blendedNoise=new st(new q(i),t.sampling,Ot.cellWidth(t),Ot.cellHeight(t)),this.temperatureNoise=new nt(new q(i),R.create(-7,[1,1])),this.humidityNoise=new nt(new q(i+BigInt(1)),R.create(-7,[1,1])),this.offsetNoise=new nt(new q(i+BigInt(5)),R.create(0,[0]))):(this.blendedNoise=new st(r.fromHashOf(\"minecraft:terrain\"),t.sampling,Ot.cellWidth(t),Ot.cellHeight(t)),this.temperatureNoise=Yt.instantiate(r,n?Yt.TEMPERATURE_LARGE:Yt.TEMPERATURE),this.humidityNoise=Yt.instantiate(r,n?Yt.VEGETATION_LARGE:Yt.VEGETATION),this.offsetNoise=Yt.instantiate(r,Yt.SHIFT)),this.continentalnessNoise=Yt.instantiate(r,n?Yt.CONTINENTALNESS_LARGE:Yt.CONTINENTALNESS),this.erosionNoise=Yt.instantiate(r,n?Yt.EROSION_LARGE:Yt.EROSION),this.weirdnessNoise=Yt.instantiate(r,Yt.RIDGE),this.pillarNoise=Yt.instantiate(r,Yt.PILLAR),this.pillarRarenessModulator=Yt.instantiate(r,Yt.PILLAR_RARENESS),this.pillarThicknessModulator=Yt.instantiate(r,Yt.PILLAR_THICKNESS),this.spaghetti2DNoise=Yt.instantiate(r,Yt.SPAGHETTI_2D),this.spaghetti2DElevationModulator=Yt.instantiate(r,Yt.SPAGHETTI_2D_ELEVATION),this.spaghetti2DRarityModulator=Yt.instantiate(r,Yt.SPAGHETTI_2D_MODULATOR),this.spaghetti2DThicknessModulator=Yt.instantiate(r,Yt.SPAGHETTI_2D_THICKNESS),this.spaghetti3DNoise1=Yt.instantiate(r,Yt.SPAGHETTI_3D_1),this.spaghetti3DNoise2=Yt.instantiate(r,Yt.SPAGHETTI_3D_2),this.spaghetti3DRarityModulator=Yt.instantiate(r,Yt.SPAGHETTI_3D_RARITY),this.spaghetti3DThicknessModulator=Yt.instantiate(r,Yt.SPAGHETTI_3D_THICKNESS),this.spaghettiRoughnessNoise=Yt.instantiate(r,Yt.SPAGHETTI_ROUGHNESS),this.spaghettiRoughnessModulator=Yt.instantiate(r,Yt.SPAGHETTI_ROUGHNESS_MODULATOR),this.bigEntranceNoise=Yt.instantiate(r,Yt.CAVE_ENTRANCE),this.layerNoise=Yt.instantiate(r,Yt.CAVE_LAYER),this.cheeseNoise=Yt.instantiate(r,Yt.CAVE_CHEESE);const o=t.minY+4,a=o+t.height;this.noodleToggleNoise=this.yLimitedInterpolatable(Yt.instantiate(r,Yt.NOODLE),o,a,-1,1),this.noodleThicknessNoise=this.yLimitedInterpolatable(Yt.instantiate(r,Yt.NOODLE_THICKNESS),o,a,0,1),this.noodleRidgeANoise=this.yLimitedInterpolatable(Yt.instantiate(r,Yt.NOODLE_RIDGE_A),o,a,0,8/3),this.noodleRidgeBNoise=this.yLimitedInterpolatable(Yt.instantiate(r,Yt.NOODLE_RIDGE_B),o,a,0,8/3),this.jaggedNoise=Yt.instantiate(r,Yt.JAGGED),this.shaper=t.terrainShaper,this.baseNoise=t=>t.createNoiseInterpolator(((e,i,s)=>this.calculateBlendedBaseNoise(e,i,s,t.getNoiseData(e>>2,s>>2).terrainInfo)))}yLimitedInterpolatable(t,e,i,s,n){const r=(r,o,a)=>o>i||ot.createNoiseInterpolator(r)}noiseData(t,e){const i=t+this.getOffset(t,0,e),s=e+this.getOffset(e,t,0),n=this.getContinentalness(i,s),r=this.getErosion(i,s),o=this.getWeirdness(i,s),a=this.terrainInfo(n,r,o);return Gt.create(i,s,n,r,o,a)}sample(t,e,i){return this.target(t,e,i,this.noiseData(t,i))}target(t,e,i,s){const n=s.shiftedX,r=e+this.getOffset(e,i,t),o=s.shiftedZ,a=this.getTemperature(n,r,o),l=this.getHumidity(n,r,o),h=this.computeDimensionDensity(e<<2,s.terrainInfo);return Dt.target(a,l,s.continentalness,s.erosion,h,s.weirdness)}terrainInfo(t,e,i){const s=qt.point(t,e,i),n=this.shaper.offset(s),r=this.shaper.factor(s),o=this.shaper.jaggedness(s);return Ut.create(n,r,o)}getOffset(t,e,i){return 4*this.offsetNoise.sample(t,e,i)}getTemperature(t,e,i){return this.temperatureNoise.sample(t,e,i)}getHumidity(t,e,i){return this.humidityNoise.sample(t,e,i)}getContinentalness(t,e){return this.continentalnessNoise.sample(t,0,e)}getErosion(t,e){return this.erosionNoise.sample(t,0,e)}getWeirdness(t,e){return this.weirdnessNoise.sample(t,0,e)}makeBaseNoiseFiller(t,e,i){const s=this.baseNoise(t),n=i?this.noodleToggleNoise(t):()=>-1,r=i?this.noodleThicknessNoise(t):()=>0,o=i?this.noodleRidgeANoise(t):()=>0,a=i?this.noodleRidgeBNoise(t):()=>0;return(t,i,l)=>{let h=s();if(h=L(.64*h,-1,1),h=h/2-h*h*h/24,n()>=0){const t=J(r(),-1,1,.05,.1),e=Math.abs(1.5*o())-t,i=Math.abs(1.5*a())-t;h=Math.min(h,Math.max(e,i))}return h+=e(t,i,l),h>0?null:x.AIR}}calculateBlendedBaseNoise(t,e,i,s){const n=this.blendedNoise.sample(t,e,i);return this.calculateBaseNoise(t,e,i,s,n,!this.isNoiseCavesEnabled,!0)}calculateBaseNoise(t,e,i,s,n,r,o){if(!this.settings.islandNoiseOverride){const r=o?this.sampleJaggedNoise(s.jaggedness,t,i):0,a=this.computeDimensionDensity(e,s),l=s.factor*(r+a);n+=l>0?4*l:l}let a=-64,l=64;if(!r&&n>=-64){const s=n-1.5625,r=this.getBigEntrances(t,e,i),o=this.getSpaghettiRoughness(t,e,i),h=this.getSpaghetti3D(t,e,i),u=Math.min(r,h+o);if(s<0)l=u;else{const r=this.getLayerizedCaverns(t,e,i);if(r>64)n=64;else{n=this.getCheese(t,e,i)+r+H(.5,0,1.28*s)}const h=this.getSpaghetti2D(t,e,i);a=this.getPillars(t,e,i),l=Math.min(u,h+o)}}return n=L(n,a,l),n=L(n=this.applySlide(n,e/Ot.cellHeight(this.settings)),-64,64)}sampleJaggedNoise(t,e,i){if(0===t)return 0;const s=this.jaggedNoise.sample(1500*e,0,1500*i);return s>0?t*s:t/2*s}computeDimensionDensity(t,e){return 1-t/128+e.offset}getBigEntrances(t,e,i){return this.bigEntranceNoise.sample(.75*t,.5*e,.75*i)+.37+H(.3,0,(e+10)/40)}getSpaghettiRoughness(t,e,i){const s=this.spaghettiRoughnessNoise.sample(t,e,i),n=j(this.spaghettiRoughnessModulator.sample(t,e,i),-1,1,0,1);return(.4-Math.abs(s))*n}getSpaghetti2D(t,e,i){const s=this.quantizeSpaghettiRarity2D(this.spaghetti2DRarityModulator.sample(2*t,e,2*i)),n=j(this.spaghetti2DThicknessModulator.sample(2*t,e,2*i),-1,1,.6,1.3),r=this.sampleWithRarity(this.spaghetti2DNoise,t,e,i,s),o=Math.abs(s*r)-.083*n,a=Ot.minCellY(this.settings),l=j(this.spaghetti2DElevationModulator.sample(t,0,i),-1,1,a,8),h=Math.abs(l-e/8)-1*n;return L(Math.max(h,o),-1,1)}getSpaghetti3D(t,e,i){const s=this.quantizeSpaghettiRarity3D(this.spaghetti3DRarityModulator.sample(2*t,e,2*i)),n=j(this.spaghetti3DThicknessModulator.sample(t,e,i),-1,1,.065,.088),r=this.sampleWithRarity(this.spaghetti3DNoise1,t,e,i,s),o=Math.abs(s*r)-n,a=this.sampleWithRarity(this.spaghetti3DNoise2,t,e,i,s),l=Math.abs(s*a)-n;return L(Math.max(o,l),-1,1)}quantizeSpaghettiRarity2D(t){return t<-.75?.5:t<-.5?.75:t<.5?1:t<.75?2:3}quantizeSpaghettiRarity3D(t){return t<-.5?.75:t<0?1:t<.5?1.5:2}sampleWithRarity(t,e,i,s,n){return t.sample(e/n,i/n,s/n)}getLayerizedCaverns(t,e,i){return 4*O(this.layerNoise.sample(t,8*e,i))}getCheese(t,e,i){return L(this.cheeseNoise.sample(t,e/1.5,i)+.27,-1,1)}getPillars(t,e,i){const s=j(this.pillarRarenessModulator.sample(t,e,i),-1,1,0,2),n=j(this.pillarThicknessModulator.sample(t,e,i),-1,1,0,1.1),r=this.pillarNoise.sample(25*t,.3*e,25*i),o=Math.pow(n,3)*(2*r-s);return o<=.03?Number.MIN_SAFE_INTEGER:o}applySlide(t,e){const i=e-Ot.minCellY(this.settings);return t=Lt.apply(this.settings.topSlide,t,Ot.cellCountY(this.settings)-i),t=Lt.apply(this.settings.bottomSlide,t,i)}getPreliminarySurfaceLevel(t,e,i){const s=Ot.minCellY(this.settings)+Ot.cellCountY(this.settings),n=Ot.minCellY(this.settings),r=Ot.cellHeight(this.settings);for(let o=s;o>=n;o-=1){const s=o*r;if(this.calculateBaseNoise(t,s,e,i,-.703125,!0,!1)>=.390625)return s}return Number.MAX_SAFE_INTEGER}}!function(t){t.create=function(t,e,i,s,n,r){return{shiftedX:t,shiftedZ:e,continentalness:i,weirdness:s,erosion:n,terrainInfo:r}}}(Gt||(Gt={})),function(t){t.fromJson=function(t){var e,i,s,n;const r=null!==(e=_.readObject(t))&&void 0!==e?e:{};return void 0!==r.absolute?(o=null!==(i=_.readNumber(r.absolute))&&void 0!==i?i:0,()=>o):void 0!==r.above_bottom?function(t){return e=>e.minY+t}(null!==(s=_.readNumber(r.above_bottom))&&void 0!==s?s:0):void 0!==r.below_top?function(t){return e=>e.maxY-t}(null!==(n=_.readNumber(r.below_top))&&void 0!==n?n:0):()=>0;var o}}(Ht||(Ht={})),function(t){t.create=function(t,e){return{minY:t,height:e,maxY:t+e-1}}}(Vt||(Vt={}));class te{constructor(t,e,i){this.rule=t,this.defaultBlock=e,this.random=K.create(i).forkPositional(),this.surfaceNoise=Yt.instantiate(this.random,Yt.SURFACE),this.surfaceSecondaryNoise=Yt.instantiate(this.random,Yt.SURFACE_SECONDARY),this.positionalRandoms=new Map}buildSurface(t,e,i,s){const n=y.minBlockX(t.pos),r=y.minBlockZ(t.pos),o=new ee(this,t,e,i,s),l=this.rule(o);for(let e=0;e<16;e+=1){const i=n+e;for(let e=0;e<1;e+=1){const s=r+e;o.updateXZ(i,s);let n=0,h=Number.MIN_SAFE_INTEGER,u=Number.MAX_SAFE_INTEGER;for(let e=t.maxY;e>=t.minY;e-=1){const r=a.create(i,e,s),c=t.getBlockState(r);if(c.equals(x.AIR)){n=0,h=Number.MIN_SAFE_INTEGER;continue}if(c.isFluid()){h===Number.MIN_SAFE_INTEGER&&(h=e+1);continue}if(u>=e){u=Number.MIN_SAFE_INTEGER;for(let n=e-1;n>=t.minY;n-=1){const e=t.getBlockState(a.create(i,n,s));if(e.equals(x.AIR)||e.isFluid()){u=n+1;break}}}n+=1;const d=e-u+1;if(!c.equals(this.defaultBlock))continue;o.updateY(n,d,h,e);const f=l(i,e,s);f&&t.setBlockState(r,f)}}}}getSurfaceDepth(t,e){return 2.75*this.surfaceNoise.sample(t,0,e)+3+.25*this.random.at(t,0,e).nextDouble()}getSurfaceSecondary(t,e){return this.surfaceSecondaryNoise.sample(t,0,e)}getRandom(t){return M(this.positionalRandoms,t,(()=>this.random.fromHashOf(t)))}}class ee{constructor(t,e,i,s,n){this.system=t,this.chunk=e,this.noiseChunk=i,this.context=s,this.getBiome=n,this.blockX=0,this.blockY=0,this.blockZ=0,this.stoneDepthAbove=0,this.stoneDepthBelow=0,this.surfaceDepth=0,this.waterHeight=0,this.biome=()=>\"\",this.surfaceSecondary=()=>0,this.minSurfaceLevel=()=>0}updateXZ(t,e){this.blockX=t,this.blockZ=e,this.surfaceDepth=this.system.getSurfaceDepth(t,e),this.surfaceSecondary=D((()=>this.system.getSurfaceSecondary(t,e))),this.minSurfaceLevel=D((()=>this.calculateMinSurfaceLevel(t,e)))}updateY(t,e,i,s){this.blockY=s,this.stoneDepthAbove=t,this.stoneDepthBelow=e,this.waterHeight=i,this.biome=D((()=>this.getBiome(a.create(this.blockX,this.blockY,this.blockZ))))}calculateMinSurfaceLevel(t,e){const i=t>>4,s=e>>4,n=this.noiseChunk.getPreliminarySurfaceLevel(i<<4,s<<4),r=this.noiseChunk.getPreliminarySurfaceLevel(i+1<<4,s<<4),o=this.noiseChunk.getPreliminarySurfaceLevel(i<<4,s+1<<4),a=this.noiseChunk.getPreliminarySurfaceLevel(i+1<<4,s+1<<4);return Math.floor(Y((15&t)/16,(15&e)/16,n,r,o,a))+this.surfaceDepth-8}}!function(t){function e(t){return()=>()=>t}function i(t){return e=>{const i=t.map((t=>t(e)));return(t,e,s)=>{for(const n of i){const i=n(t,e,s);if(i)return i}}}}function s(t,e){return i=>(s,n,r)=>{if(t(i))return e(i)(s,n,r)}}t.NOOP=()=>()=>{},t.fromJson=function(n){var r,o,a;const l=null!==(r=_.readObject(n))&&void 0!==r?r:{};switch(null===(o=_.readString(l.type))||void 0===o?void 0:o.replace(/^minecraft:/,\"\")){case\"block\":return e(x.fromJson(l.result_state));case\"sequence\":return i(null!==(a=_.readArray(l.sequence,t.fromJson))&&void 0!==a?a:[]);case\"condition\":return s(jt.fromJson(l.if_true),t.fromJson(l.then_run))}return t.NOOP},t.block=e,t.sequence=i,t.condition=s}(zt||(zt={})),function(t){function e(){return t=>t.blockY>=t.minSurfaceLevel()}function i(t){const e=new Set(t);return t=>e.has(t.biome())}function s(t){return e=>!t(e)}function n(t,e,i,s){return n=>{const r=s?n.stoneDepthBelow:n.stoneDepthAbove,o=e?n.surfaceDepth:0,a=0===i?0:j(n.surfaceSecondary(),-1,1,0,i);return r<=1+t+o+a}}function r(t,e,i){return s=>{const n=e(s.context),r=i(s.context);if(s.blockY<=n)return!0;if(s.blockY>=r)return!1;const o=s.system.getRandom(t),a=j(s.blockY,n,r,1,0);return o.nextFloat(){if(s.waterHeight===Number.MIN_SAFE_INTEGER)return!0;const n=i?s.stoneDepthAbove:0;return s.blockY+n>=s.waterHeight+t+s.surfaceDepth*e}}function a(t,e,i){return s=>{const n=i?s.stoneDepthAbove:0;return s.blockY+n>=t(s.context)+s.surfaceDepth*e}}t.FALSE=()=>!1,t.TRUE=()=>!0,t.fromJson=function(e){var l,h,u,c,d,f,g,p,m,v,b,S;const E=null!==(l=_.readObject(e))&&void 0!==l?l:{};switch(null===(h=_.readString(E.type))||void 0===h?void 0:h.replace(/^minecraft:/,\"\")){case\"above_preliminary_surface\":return t=>t.blockY>=t.minSurfaceLevel();case\"biome\":return i(null!==(u=_.readArray(E.biome_is,(t=>{var e;return null!==(e=_.readString(t))&&void 0!==e?e:\"\"})))&&void 0!==u?u:[]);case\"not\":return s(t.fromJson(E.invert));case\"stone_depth\":return n(null!==(c=_.readInt(E.offset))&&void 0!==c?c:0,null!==(d=_.readBoolean(E.add_surface_depth))&&void 0!==d&&d,null!==(f=_.readInt(E.secondary_depth_range))&&void 0!==f?f:0,\"ceiling\"===_.readString(E.surface_type));case\"vertical_gradient\":return r(null!==(g=_.readString(E.random_name))&&void 0!==g?g:\"\",Ht.fromJson(E.true_at_and_below),Ht.fromJson(E.false_at_and_above));case\"water\":return o(null!==(p=_.readInt(E.offset))&&void 0!==p?p:0,null!==(m=_.readInt(E.surface_depth_multiplier))&&void 0!==m?m:0,null!==(v=_.readBoolean(E.add_surface_depth))&&void 0!==v&&v);case\"y_above\":return a(Ht.fromJson(E.anchor),null!==(b=_.readInt(E.surface_depth_multiplier))&&void 0!==b?b:0,null!==(S=_.readBoolean(E.add_surface_depth))&&void 0!==S&&S)}return t.FALSE},t.abovePreliminarySurface=e,t.biome=i,t.not=s,t.stoneDepth=n,t.verticalGradient=r,t.water=o,t.yAbove=a}(jt||(jt={}));class ie{constructor(t,e,i){this.biomeSource=e,this.settings=i,this.sampler=new Qt(i.noise,i.noiseCavesEnabled,t,i.legacyRandomSource),this.noiseChunkCache=new Map,this.materialRule=Mt.fromList([(t,e,i,s)=>t.updateNoiseAndGenerateBaseState(e,i,s)]),this.surfaceSystem=new te(i.surfaceRule,i.defaultBlock,t)}fill(t){var e;const i=Math.max(t.minY,this.settings.noise.minY),s=Math.min(t.maxY,this.settings.noise.minY+this.settings.noise.height),n=Ot.cellWidth(this.settings.noise),r=Ot.cellHeight(this.settings.noise),o=Math.floor(16/n),a=Math.floor(i/r),l=Math.floor((s-i)/r),h=y.minBlockX(t.pos),u=y.minBlockZ(t.pos),c=this.getNoiseChunk(t);c.initializeForFirstCellX();for(let i=0;i=0;d-=1){c.selectCellYZ(d,s);for(let l=r-1;l>=0;l-=1){const f=(a+d)*r+l,g=15&f,p=t.getSectionIndex(f);t.getSectionIndex(o.minBlockY)!==p&&(o=t.getOrCreateSection(p));const m=l/r;c.updateForY(m);for(let t=0;te))}getNoiseChunk(t){return M(this.noiseChunkCache,y.toLong(t.pos),(()=>{const e=Math.max(t.minY,this.settings.noise.minY),i=Math.min(t.maxY,this.settings.noise.minY+this.settings.noise.height),s=Ot.cellWidth(this.settings.noise),n=Ot.cellHeight(this.settings.noise),r=Math.floor(16/s),o=Math.floor(e/n),a=Math.floor((i-e)/n),l=y.minBlockX(t.pos),h=y.minBlockZ(t.pos);return new Kt(r,a,o,this.sampler,l,h,(()=>0),this.settings)}))}}!function(t){t.fromJson=function(t){var e,i,s,n,r,o,a,l,h,u,c;const d=null!==(e=_.readObject(t))&&void 0!==e?e:{};return{structures:Xt.fromJson(d.structures),surfaceRule:zt.fromJson(d.surface_rule),noise:Ot.fromJson(d.noise),defaultBlock:x.fromJson(d.default_block),defaultFluid:x.fromJson(d.default_fluid),bedrockRoofPosition:null!==(i=_.readInt(d.bedrock_roof_position))&&void 0!==i?i:0,bedrockFloorPosition:null!==(s=_.readInt(d.bedrock_floor_position))&&void 0!==s?s:0,seaLevel:null!==(n=_.readInt(d.sea_level))&&void 0!==n?n:0,disableMobGeneration:null!==(r=_.readBoolean(d.disable_mob_generation))&&void 0!==r&&r,aquifersEnabled:null!==(o=_.readBoolean(d.aquifers_enabled))&&void 0!==o&&o,noiseCavesEnabled:null!==(a=_.readBoolean(d.noise_caves_enabled))&&void 0!==a&&a,deepslateEnabled:null!==(l=_.readBoolean(d.deepslate_enabled))&&void 0!==l&&l,oreVeinsEnabled:null!==(h=_.readBoolean(d.ore_veins_enabled))&&void 0!==h&&h,noodleCavesEnabled:null!==(u=_.readBoolean(d.noodle_caves_enabled))&&void 0!==u&&u,legacyRandomSource:null!==(c=_.readBoolean(d.legacy_random_source))&&void 0!==c&&c}}}(Jt||(Jt={})),function(t){t.fromJson=function(t){var e;const i=null!==(e=_.readObject(t))&&void 0!==e?e:{};return{stronghold:_.compose(i.stronghold,_.readObject,(t=>{var e,i,s;return{distance:null!==(e=_.readInt(t.distance))&&void 0!==e?e:0,spread:null!==(i=_.readInt(t.spread))&&void 0!==i?i:0,count:null!==(s=_.readInt(t.count))&&void 0!==s?s:0}})),structures:_.readMap(i.structures,(t=>{var e;return(t=>{var e,i,s;return{spacing:null!==(e=_.readInt(t.spacing))&&void 0!==e?e:0,separation:null!==(i=_.readInt(t.separation))&&void 0!==i?i:0,salt:null!==(s=_.readInt(t.salt))&&void 0!==s?s:0}})(null!==(e=_.readObject(t))&&void 0!==e?e:{})}))}}}(Xt||(Xt={}));export{st as BlendedNoise,vt as BlockColors,It as BlockDefinition,_t as BlockModel,a as BlockPos,x as BlockState,C as Chunk,y as ChunkPos,T as ChunkSection,Dt as Climate,ot as ConstantProvider,r as Direction,Zt as FixedBiome,Gt as FlatNoiseData,et as ImprovedNoise,_ as Json,$ as LegacyPositionalRandom,q as LegacyRandom,Mt as MaterialRule,Wt as MultiNoise,u as NbtReader,c as NbtWriter,Kt as NoiseChunk,ie as NoiseChunkGenerator,Jt as NoiseGeneratorSettings,$t as NoiseInterpolator,R as NoiseParameters,Qt as NoiseSampler,P as NoiseSamplingSettings,Ot as NoiseSettings,Lt as NoiseSlideSettings,Yt as Noises,nt as NormalNoise,B as NumberProvider,it as PerlinNoise,rt as PerlinSimplexNoise,tt as SimplexNoise,at as Spline,k as Structure,Tt as StructureRenderer,Xt as StructureSettings,jt as SurfaceCondition,ee as SurfaceContext,zt as SurfaceRule,te as SurfaceSystem,Ut as TerrainInfo,qt as TerrainShaper,kt as TextureAtlas,Ht as VerticalAnchor,Vt as WorldgenContext,Q as XoroshiroPositionalRandom,K as XoroshiroRandom,X as binarySearch,L as clamp,H as clampedLerp,J as clampedMap,M as computeIfAbsent,N as getListTag,F as getOptional,Z as getSeed,A as getTag,V as inverseLerp,D as lazy,U as lerp,Y as lerp2,G as lerp3,W as longfromBytes,j as map,g as read,m as readChunk,f as readCompressed,p as readRegion,d as readUncompressed,z as smoothstep,O as square,h as tagNames,l as tagTypes,S as write,I as writeChunk,b as writeCompressed,E as writeRegion,v as writeUncompressed};\n//# sourceMappingURL=deepslate.esm.js.map\n"],"names":["glMatrix.ARRAY_TYPE","glMatrix.EPSILON","t","i.create","i.transformMat4","s.create","s.identity","s.translate","s.rotateY","n.toRadian","s.rotateX","s.scale","i.fromValues","s.rotate","i.negate","s.perspective","i.subtract","i.cross","i.normalize","i.equals","s.copy"],"mappings":"yCACA,wEA6BA,KAAM,IAA0B,EAI1B,GAAwB,EACxB,GAAwB,EAExB,GAA0B,EAKhC,YAAgB,EAAK,CAAE,GAAI,GAAM,EAAI,OAAQ,KAAO,EAAE,GAAO,GAAK,EAAI,GAAO,CAAM,CAInF,KAAM,IAAe,EACf,GAAe,EACf,GAAe,EAGf,GAAiB,EACjB,GAAiB,IAQjB,GAAkB,GAGlB,GAAkB,IAGlB,GAAkB,GAAa,EAAI,GAGnC,GAAkB,GAGlB,GAAkB,GAGlB,GAAkB,EAAI,GAAY,EAGlC,GAAkB,GAGlB,GAAgB,GAQhB,GAAc,EAGd,GAAc,IAGd,GAAc,GAGd,GAAc,GAGd,GAAc,GAId,GACJ,GAAI,YAAW,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,EAEtE,GACJ,GAAI,YAAW,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,EAAE,CAAC,EAEhF,GACJ,GAAI,YAAW,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,EAElD,GACJ,GAAI,YAAW,CAAC,GAAG,GAAG,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,CAAC,EAa3D,GAAgB,IAGhB,GAAgB,GAAI,OAAO,IAAY,GAAK,CAAC,EACnD,GAAO,EAAY,EAOnB,KAAM,IAAgB,GAAI,OAAM,GAAY,CAAC,EAC7C,GAAO,EAAY,EAKnB,KAAM,IAAgB,GAAI,OAAM,EAAa,EAC7C,GAAO,EAAU,EAMjB,KAAM,IAAgB,GAAI,OAAM,GAAc,GAAc,CAAC,EAC7D,GAAO,EAAY,EAGnB,KAAM,IAAgB,GAAI,OAAM,EAAc,EAC9C,GAAO,EAAW,EAGlB,KAAM,IAAgB,GAAI,OAAM,EAAS,EACzC,GAAO,EAAS,EAIhB,YAAwB,EAAa,EAAY,EAAY,EAAO,EAAY,CAE9E,KAAK,YAAe,EACpB,KAAK,WAAe,EACpB,KAAK,WAAe,EACpB,KAAK,MAAe,EACpB,KAAK,WAAe,EAGpB,KAAK,UAAe,GAAe,EAAY,MACjD,CAGA,GAAI,IACA,GACA,GAGJ,YAAkB,EAAU,EAAW,CACrC,KAAK,SAAW,EAChB,KAAK,SAAW,EAChB,KAAK,UAAY,CACnB,CAIA,KAAM,IAAS,AAAC,GAEP,EAAO,IAAM,GAAW,GAAQ,GAAW,IAAO,KAAS,IAQ9D,GAAY,CAAC,EAAG,IAAM,CAG1B,EAAE,YAAY,EAAE,WAAc,EAAK,IACnC,EAAE,YAAY,EAAE,WAAc,IAAM,EAAK,GAC3C,EAOM,EAAY,CAAC,EAAG,EAAO,IAAW,CAEtC,AAAI,EAAE,SAAY,GAAW,EAC3B,GAAE,QAAW,GAAS,EAAE,SAAY,MACpC,GAAU,EAAG,EAAE,MAAM,EACrB,EAAE,OAAS,GAAU,GAAW,EAAE,SAClC,EAAE,UAAY,EAAS,IAEvB,GAAE,QAAW,GAAS,EAAE,SAAY,MACpC,EAAE,UAAY,EAElB,EAGM,GAAY,CAAC,EAAG,EAAG,IAAS,CAEhC,EAAU,EAAG,EAAK,EAAI,GAAa,EAAK,EAAI,EAAI,GAClD,EAQM,GAAa,CAAC,EAAM,IAAQ,CAEhC,GAAI,GAAM,EACV,EACE,IAAO,EAAO,EACd,KAAU,EACV,IAAQ,QACD,EAAE,EAAM,GACjB,MAAO,KAAQ,CACjB,EAMM,GAAW,AAAC,GAAM,CAEtB,AAAI,EAAE,WAAa,GACjB,IAAU,EAAG,EAAE,MAAM,EACrB,EAAE,OAAS,EACX,EAAE,SAAW,GAEJ,EAAE,UAAY,GACvB,GAAE,YAAY,EAAE,WAAa,EAAE,OAAS,IACxC,EAAE,SAAW,EACb,EAAE,UAAY,EAElB,EAaM,GAAa,CAAC,EAAG,IAGvB,CACE,KAAM,GAAkB,EAAK,SACvB,EAAkB,EAAK,SACvB,EAAkB,EAAK,UAAU,YACjC,EAAkB,EAAK,UAAU,UACjC,EAAkB,EAAK,UAAU,WACjC,EAAkB,EAAK,UAAU,WACjC,EAAkB,EAAK,UAAU,WACvC,GAAI,GACA,EAAG,EACH,EACA,EACA,EACA,EAAW,EAEf,IAAK,EAAO,EAAG,GAAQ,GAAY,IACjC,EAAE,SAAS,GAAQ,EAQrB,IAFA,EAAK,EAAE,KAAK,EAAE,UAAY,EAAI,GAAa,EAEtC,EAAI,EAAE,SAAW,EAAG,EAAI,GAAa,IAUxC,AATA,EAAI,EAAE,KAAK,GACX,EAAO,EAAK,EAAK,EAAI,EAAI,GAAa,EAAI,GAAa,EACnD,EAAO,GACT,GAAO,EACP,KAEF,EAAK,EAAI,EAAI,GAAa,EAGtB,IAAI,IAER,GAAE,SAAS,KACX,EAAQ,EACJ,GAAK,GACP,GAAQ,EAAM,EAAI,IAEpB,EAAI,EAAK,EAAI,GACb,EAAE,SAAW,EAAK,GAAO,GACrB,GACF,GAAE,YAAc,EAAK,GAAM,EAAI,EAAI,GAAa,KAGpD,GAAI,IAAa,EAMjB,GAAG,CAED,IADA,EAAO,EAAa,EACb,EAAE,SAAS,KAAU,GAAK,IACjC,EAAE,SAAS,KACX,EAAE,SAAS,EAAO,IAAM,EACxB,EAAE,SAAS,KAIX,GAAY,CAChB,OAAW,EAAW,GAOpB,IAAK,EAAO,EAAY,IAAS,EAAG,IAElC,IADA,EAAI,EAAE,SAAS,GACR,IAAM,GAEX,AADA,EAAI,EAAE,KAAK,EAAE,GACT,IAAI,IACJ,GAAK,EAAI,EAAI,KAAe,GAE9B,GAAE,SAAY,GAAO,EAAK,EAAI,EAAI,IAAc,EAAK,EAAI,GACzD,EAAK,EAAI,EAAI,GAAa,GAE5B,KAGN,EAWM,GAAY,CAAC,EAAM,EAAU,IAInC,CACE,KAAM,GAAY,GAAI,OAAM,GAAa,CAAC,EAC1C,GAAI,GAAO,EACP,EACA,EAKJ,IAAK,EAAO,EAAG,GAAQ,GAAY,IACjC,EAAU,GAAQ,EAAQ,EAAO,EAAS,EAAO,IAAO,EAS1D,IAAK,EAAI,EAAI,GAAK,EAAU,IAAK,CAC/B,GAAI,GAAM,EAAK,EAAI,EAAI,GACvB,AAAI,IAAQ,GAEZ,GAAK,EAAI,GAAc,GAAW,EAAU,KAAQ,CAAG,EAIxD,CACH,EAMM,GAAiB,IAAM,CAE3B,GAAI,GACA,EACA,EACA,EACA,EACJ,KAAM,GAAW,GAAI,OAAM,GAAa,CAAC,EAiBzC,IADA,EAAS,EACJ,EAAO,EAAG,EAAO,GAAiB,EAAG,IAExC,IADA,GAAY,GAAQ,EACf,EAAI,EAAG,EAAK,GAAK,GAAY,GAAQ,IACxC,GAAa,KAAY,EAY7B,IAJA,GAAa,EAAS,GAAK,EAG3B,EAAO,EACF,EAAO,EAAG,EAAO,GAAI,IAExB,IADA,GAAU,GAAQ,EACb,EAAI,EAAG,EAAK,GAAK,GAAY,GAAQ,IACxC,GAAW,KAAU,EAKzB,IADA,IAAS,EACF,EAAO,GAAW,IAEvB,IADA,GAAU,GAAQ,GAAQ,EACrB,EAAI,EAAG,EAAK,GAAM,GAAY,GAAQ,EAAK,IAC9C,GAAW,IAAM,KAAU,EAM/B,IAAK,EAAO,EAAG,GAAQ,GAAY,IACjC,EAAS,GAAQ,EAInB,IADA,EAAI,EACG,GAAK,KACV,GAAa,EAAI,EAAI,GAAa,EAClC,IACA,EAAS,KAEX,KAAO,GAAK,KACV,GAAa,EAAI,EAAI,GAAa,EAClC,IACA,EAAS,KAEX,KAAO,GAAK,KACV,GAAa,EAAI,EAAI,GAAa,EAClC,IACA,EAAS,KAEX,KAAO,GAAK,KACV,GAAa,EAAI,EAAI,GAAa,EAClC,IACA,EAAS,KASX,IAHA,GAAU,GAAc,GAAY,EAAG,CAAQ,EAG1C,EAAI,EAAG,EAAI,GAAW,IACzB,GAAa,EAAI,EAAI,GAAa,EAClC,GAAa,EAAI,GAAc,GAAW,EAAG,CAAC,EAIhD,GAAgB,GAAI,IAAe,GAAc,GAAa,GAAa,EAAG,GAAW,EAAU,EACnG,GAAgB,GAAI,IAAe,GAAc,GAAa,EAAY,GAAW,EAAU,EAC/F,GAAiB,GAAI,IAAe,GAAI,OAAM,CAAC,EAAG,GAAc,EAAW,GAAY,EAAW,CAGpG,EAMM,GAAa,AAAC,GAAM,CAExB,GAAI,GAGJ,IAAK,EAAI,EAAG,EAAI,GAAY,IAAO,EAAE,UAAU,EAAI,GAAc,EACjE,IAAK,EAAI,EAAG,EAAI,GAAY,IAAO,EAAE,UAAU,EAAI,GAAc,EACjE,IAAK,EAAI,EAAG,EAAI,GAAY,IAAO,EAAE,QAAQ,EAAI,GAAc,EAE/D,EAAE,UAAU,GAAY,GAAc,EACtC,EAAE,QAAU,EAAE,WAAa,EAC3B,EAAE,SAAW,EAAE,QAAU,CAC3B,EAMM,GAAY,AAAC,GACnB,CACE,AAAI,EAAE,SAAW,EACf,GAAU,EAAG,EAAE,MAAM,EACZ,EAAE,SAAW,GAEtB,GAAE,YAAY,EAAE,WAAa,EAAE,QAEjC,EAAE,OAAS,EACX,EAAE,SAAW,CACf,EAMM,GAAa,CAAC,EAAG,EAAK,EAAK,IAKjC,CACE,GAAU,CAAC,EAEP,GACF,IAAU,EAAG,CAAG,EAChB,GAAU,EAAG,CAAC,CAAG,GAKnB,EAAE,YAAY,IAAI,EAAE,OAAO,SAAS,EAAK,EAAM,CAAG,EAAG,EAAE,OAAO,EAC9D,EAAE,SAAW,CACf,EAMM,GAAU,CAAC,EAAM,EAAG,EAAG,IAAU,CAErC,KAAM,GAAM,EAAI,EACV,EAAM,EAAI,EAChB,MAAQ,GAAK,GAAgB,EAAK,IAC1B,EAAK,KAAkB,EAAK,IAAiB,EAAM,IAAM,EAAM,EACzE,EAQM,GAAa,CAAC,EAAG,EAAM,IAI7B,CACE,KAAM,GAAI,EAAE,KAAK,GACjB,GAAI,GAAI,GAAK,EACb,KAAO,GAAK,EAAE,UAER,GAAI,EAAE,UACR,GAAQ,EAAM,EAAE,KAAK,EAAI,GAAI,EAAE,KAAK,GAAI,EAAE,KAAK,GAC/C,IAGE,IAAQ,EAAM,EAAG,EAAE,KAAK,GAAI,EAAE,KAAK,IAGvC,EAAE,KAAK,GAAK,EAAE,KAAK,GACnB,EAAI,EAGJ,IAAM,EAER,EAAE,KAAK,GAAK,CACd,EASM,GAAiB,CAAC,EAAG,EAAO,IAIlC,CACE,GAAI,GACA,EACA,EAAK,EACL,EACA,EAEJ,GAAI,EAAE,WAAa,EACjB,EACE,GAAQ,EAAE,YAAY,EAAE,MAAQ,EAAK,IAAM,EAAM,EAAE,YAAY,EAAE,MAAQ,EAAK,EAAI,GAClF,EAAK,EAAE,YAAY,EAAE,MAAQ,GAC7B,IAEA,AAAI,IAAS,EACX,GAAU,EAAG,EAAI,CAAK,EAItB,GAAO,GAAa,GACpB,GAAU,EAAG,EAAO,GAAa,EAAG,CAAK,EACzC,EAAQ,GAAY,GAChB,IAAU,GACZ,IAAM,GAAY,GAClB,EAAU,EAAG,EAAI,CAAK,GAExB,IACA,EAAO,GAAO,CAAI,EAGlB,GAAU,EAAG,EAAM,CAAK,EACxB,EAAQ,GAAY,GAChB,IAAU,GACZ,IAAQ,GAAU,GAClB,EAAU,EAAG,EAAM,CAAK,UAQrB,EAAK,EAAE,UAGlB,GAAU,EAAG,GAAW,CAAK,CAC/B,EAWM,GAAa,CAAC,EAAG,IAGvB,CACE,KAAM,GAAW,EAAK,SAChB,EAAW,EAAK,UAAU,YAC1B,EAAY,EAAK,UAAU,UAC3B,EAAW,EAAK,UAAU,MAChC,GAAI,GAAG,EACH,EAAW,GACX,EASJ,IAHA,EAAE,SAAW,EACb,EAAE,SAAW,GAER,EAAI,EAAG,EAAI,EAAO,IACrB,AAAI,EAAK,EAAI,KAAgB,EAC3B,GAAE,KAAK,EAAE,EAAE,UAAY,EAAW,EAClC,EAAE,MAAM,GAAK,GAGb,EAAK,EAAI,EAAI,GAAa,EAS9B,KAAO,EAAE,SAAW,GAClB,EAAO,EAAE,KAAK,EAAE,EAAE,UAAa,EAAW,EAAI,EAAE,EAAW,EAC3D,EAAK,EAAO,GAAc,EAC1B,EAAE,MAAM,GAAQ,EAChB,EAAE,UAEE,GACF,GAAE,YAAc,EAAM,EAAO,EAAI,IASrC,IALA,EAAK,SAAW,EAKX,EAAK,EAAE,UAAY,EAAc,GAAK,EAAG,IAAO,GAAW,EAAG,EAAM,CAAC,EAK1E,EAAO,EACP,EAGE,GAAI,EAAE,KAAK,GACX,EAAE,KAAK,GAAiB,EAAE,KAAK,EAAE,YACjC,GAAW,EAAG,EAAM,GAGpB,EAAI,EAAE,KAAK,GAEX,EAAE,KAAK,EAAE,EAAE,UAAY,EACvB,EAAE,KAAK,EAAE,EAAE,UAAY,EAGvB,EAAK,EAAO,GAAc,EAAK,EAAI,GAAc,EAAK,EAAI,GAC1D,EAAE,MAAM,GAAS,GAAE,MAAM,IAAM,EAAE,MAAM,GAAK,EAAE,MAAM,GAAK,EAAE,MAAM,IAAM,EACvE,EAAK,EAAI,EAAI,GAAa,EAAK,EAAI,EAAI,GAAa,EAGpD,EAAE,KAAK,GAAiB,IACxB,GAAW,EAAG,EAAM,SAEb,EAAE,UAAY,GAEvB,EAAE,KAAK,EAAE,EAAE,UAAY,EAAE,KAAK,GAK9B,GAAW,EAAG,CAAI,EAGlB,GAAU,EAAM,EAAU,EAAE,QAAQ,CACtC,EAOM,GAAY,CAAC,EAAG,EAAM,IAI5B,CACE,GAAI,GACA,EAAU,GACV,EAEA,EAAU,EAAK,EAAI,EAAI,GAEvB,EAAQ,EACR,EAAY,EACZ,EAAY,EAQhB,IANI,IAAY,GACd,GAAY,IACZ,EAAY,GAEd,EAAM,GAAW,GAAK,EAAI,GAAa,MAElC,EAAI,EAAG,GAAK,EAAU,IAIzB,AAHA,EAAS,EACT,EAAU,EAAM,GAAI,GAAK,EAAI,GAEzB,IAAE,EAAQ,GAAa,IAAW,IAG/B,CAAI,EAAQ,EACjB,EAAE,QAAQ,EAAS,IAAe,EAE7B,AAAI,IAAW,EAEhB,KAAW,GAAW,EAAE,QAAQ,EAAS,KAC7C,EAAE,QAAQ,GAAU,MAEf,AAAI,GAAS,GAClB,EAAE,QAAQ,GAAY,KAGtB,EAAE,QAAQ,GAAc,KAG1B,EAAQ,EACR,EAAU,EAEV,AAAI,IAAY,EACd,GAAY,IACZ,EAAY,GAEP,AAAI,IAAW,EACpB,GAAY,EACZ,EAAY,GAGZ,GAAY,EACZ,EAAY,GAGlB,EAOM,GAAY,CAAC,EAAG,EAAM,IAI5B,CACE,GAAI,GACA,EAAU,GACV,EAEA,EAAU,EAAK,EAAI,EAAI,GAEvB,EAAQ,EACR,EAAY,EACZ,EAAY,EAQhB,IALI,IAAY,GACd,GAAY,IACZ,EAAY,GAGT,EAAI,EAAG,GAAK,EAAU,IAIzB,GAHA,EAAS,EACT,EAAU,EAAM,GAAI,GAAK,EAAI,GAEzB,IAAE,EAAQ,GAAa,IAAW,GAG/B,IAAI,EAAQ,EACjB,EAAK,IAAU,EAAG,EAAQ,EAAE,OAAO,QAAY,EAAE,IAAU,OAEtD,AAAI,KAAW,EAChB,KAAW,GACb,IAAU,EAAG,EAAQ,EAAE,OAAO,EAC9B,KAGF,GAAU,EAAG,GAAS,EAAE,OAAO,EAC/B,EAAU,EAAG,EAAQ,EAAG,CAAC,GAEpB,AAAI,GAAS,GAClB,IAAU,EAAG,GAAW,EAAE,OAAO,EACjC,EAAU,EAAG,EAAQ,EAAG,CAAC,GAGzB,IAAU,EAAG,GAAa,EAAE,OAAO,EACnC,EAAU,EAAG,EAAQ,GAAI,CAAC,GAG5B,EAAQ,EACR,EAAU,EACV,AAAI,IAAY,EACd,GAAY,IACZ,EAAY,GAEP,AAAI,IAAW,EACpB,GAAY,EACZ,EAAY,GAGZ,GAAY,EACZ,EAAY,GAGlB,EAOM,GAAgB,AAAC,GAAM,CAE3B,GAAI,GAgBJ,IAbA,GAAU,EAAG,EAAE,UAAW,EAAE,OAAO,QAAQ,EAC3C,GAAU,EAAG,EAAE,UAAW,EAAE,OAAO,QAAQ,EAG3C,GAAW,EAAG,EAAE,OAAO,EASlB,EAAc,GAAa,EAAG,GAAe,GAC5C,EAAE,QAAQ,GAAS,GAAe,EAAI,KAAe,EADN,IACnD,CAKF,SAAE,SAAW,EAAK,GAAc,GAAK,EAAI,EAAI,EAItC,CACT,EAQM,GAAiB,CAAC,EAAG,EAAQ,EAAQ,IAG3C,CACE,GAAI,GASJ,IAHA,EAAU,EAAG,EAAS,IAAK,CAAC,EAC5B,EAAU,EAAG,EAAS,EAAK,CAAC,EAC5B,EAAU,EAAG,EAAU,EAAI,CAAC,EACvB,EAAO,EAAG,EAAO,EAAS,IAE7B,EAAU,EAAG,EAAE,QAAQ,GAAS,GAAQ,EAAI,GAAY,CAAC,EAI3D,GAAU,EAAG,EAAE,UAAW,EAAS,CAAC,EAGpC,GAAU,EAAG,EAAE,UAAW,EAAS,CAAC,CAEtC,EAgBM,GAAmB,AAAC,GAAM,CAK9B,GAAI,GAAa,WACb,EAGJ,IAAK,EAAI,EAAG,GAAK,GAAI,IAAK,KAAgB,EACxC,GAAK,EAAa,GAAO,EAAE,UAAU,EAAI,KAAgB,EACvD,MAAO,IAKX,GAAI,EAAE,UAAU,EAAI,KAAgB,GAAK,EAAE,UAAU,GAAK,KAAgB,GACtE,EAAE,UAAU,GAAK,KAAgB,EACnC,MAAO,IAET,IAAK,EAAI,GAAI,EAAI,GAAY,IAC3B,GAAI,EAAE,UAAU,EAAI,KAAgB,EAClC,MAAO,IAOX,MAAO,GACT,EAGA,GAAI,IAAmB,GAKvB,KAAM,IAAa,AAAC,GACpB,CAEE,AAAK,IACH,MACA,GAAmB,IAGrB,EAAE,OAAU,GAAI,IAAS,EAAE,UAAW,EAAa,EACnD,EAAE,OAAU,GAAI,IAAS,EAAE,UAAW,EAAa,EACnD,EAAE,QAAU,GAAI,IAAS,EAAE,QAAS,EAAc,EAElD,EAAE,OAAS,EACX,EAAE,SAAW,EAGb,GAAW,CAAC,CACd,EAMM,GAAqB,CAAC,EAAG,EAAK,EAAY,IAKhD,CACE,EAAU,EAAI,KAAgB,GAAM,GAAO,EAAI,GAAI,CAAC,EACpD,GAAW,EAAG,EAAK,EAAY,EAAI,CACrC,EAOM,GAAc,AAAC,GAAM,CACzB,EAAU,EAAG,IAAgB,EAAG,CAAC,EACjC,GAAU,EAAG,GAAW,EAAY,EACpC,GAAS,CAAC,CACZ,EAOM,GAAoB,CAAC,EAAG,EAAK,EAAY,IAK/C,CACE,GAAI,GAAU,EACV,EAAc,EAGlB,AAAI,EAAE,MAAQ,EAGR,GAAE,KAAK,YAAc,IACvB,GAAE,KAAK,UAAY,GAAiB,CAAC,GAIvC,GAAW,EAAG,EAAE,MAAM,EAItB,GAAW,EAAG,EAAE,MAAM,EAUtB,EAAc,GAAc,CAAC,EAG7B,EAAY,EAAE,QAAU,EAAI,IAAO,EACnC,EAAe,EAAE,WAAa,EAAI,IAAO,EAMrC,GAAe,GAAY,GAAW,IAI1C,EAAW,EAAc,EAAa,EAGxC,AAAK,EAAa,GAAK,GAAc,IAAQ,GAS3C,GAAmB,EAAG,EAAK,EAAY,CAAI,EAEtC,AAAI,EAAE,WAAa,IAAa,IAAgB,EAErD,GAAU,EAAI,KAAgB,GAAM,GAAO,EAAI,GAAI,CAAC,EACpD,GAAe,EAAG,GAAc,EAAY,GAG5C,GAAU,EAAI,KAAa,GAAM,GAAO,EAAI,GAAI,CAAC,EACjD,GAAe,EAAG,EAAE,OAAO,SAAW,EAAG,EAAE,OAAO,SAAW,EAAG,EAAc,CAAC,EAC/E,GAAe,EAAG,EAAE,UAAW,EAAE,SAAS,GAM5C,GAAW,CAAC,EAER,GACF,GAAU,CAAC,CAIf,EAMM,GAAc,CAAC,EAAG,EAAM,IAO5B,GAAE,YAAY,EAAE,MAAQ,EAAE,SAAW,GAAU,IAAS,EAAK,IAC7D,EAAE,YAAY,EAAE,MAAQ,EAAE,SAAW,EAAI,GAAK,EAAO,IAErD,EAAE,YAAY,EAAE,MAAQ,EAAE,UAAY,EAAK,IAC3C,EAAE,WAEF,AAAI,IAAS,EAEX,EAAE,UAAU,EAAK,KAEjB,GAAE,UAEF,IAKA,EAAE,UAAW,IAAa,GAAM,GAAa,GAAK,KAClD,EAAE,UAAU,GAAO,CAAI,EAAI,MA0BrB,EAAE,WAAa,EAAE,YAAc,GAOzC,GAAI,IAAc,GACd,GAAqB,GACrB,GAAqB,GACrB,GAAc,GACd,GAAc,GAEd,GAAQ,CACX,SAAU,GACV,iBAAkB,GAClB,gBAAiB,GACjB,UAAW,GACX,UAAW,EACZ,EAyBA,KAAM,IAAU,CAAC,EAAO,EAAK,EAAK,IAAQ,CACxC,GAAI,GAAM,EAAQ,MAAS,EACvB,EAAO,IAAU,GAAM,MAAS,EAChC,EAAI,EAER,KAAO,IAAQ,GAAG,CAIhB,EAAI,EAAM,IAAO,IAAO,EACxB,GAAO,EAEP,EACE,GAAM,EAAK,EAAI,KAAS,EACxB,EAAM,EAAK,EAAK,QACT,EAAE,GAEX,GAAM,MACN,GAAM,KACP,CAED,MAAQ,GAAM,GAAM,GAAM,CAC5B,EAGA,GAAI,IAAY,GA0BhB,KAAM,IAAY,IAAM,CACtB,GAAI,GAAG,EAAQ,GAEf,OAAS,GAAI,EAAG,EAAI,IAAK,IAAK,CAC5B,EAAI,EACJ,OAAS,GAAI,EAAG,EAAI,EAAG,IACrB,EAAM,EAAI,EAAM,WAAc,IAAM,EAAO,IAAM,EAEnD,EAAM,GAAK,CACZ,CAED,MAAO,EACT,EAGM,GAAW,GAAI,aAAY,GAAS,CAAE,EAGtC,GAAQ,CAAC,EAAK,EAAK,EAAK,IAAQ,CACpC,KAAM,GAAI,GACJ,EAAM,EAAM,EAElB,GAAO,GAEP,OAAS,GAAI,EAAK,EAAI,EAAK,IACzB,EAAO,IAAQ,EAAK,EAAG,GAAM,EAAI,IAAM,KAGzC,MAAQ,GAAO,EACjB,EAGA,GAAI,GAAU,GAqBV,GAAW,CACb,EAAQ,kBACR,EAAQ,aACR,EAAQ,GACR,KAAQ,aACR,KAAQ,eACR,KAAQ,aACR,KAAQ,sBACR,KAAQ,eACR,KAAQ,sBACV,EAqBI,GAAc,CAGhB,WAAoB,EACpB,gBAAoB,EACpB,aAAoB,EACpB,aAAoB,EACpB,SAAoB,EACpB,QAAoB,EACpB,QAAoB,EAKpB,KAAoB,EACpB,aAAoB,EACpB,YAAoB,EACpB,QAAmB,GACnB,eAAmB,GACnB,aAAmB,GACnB,YAAmB,GACnB,YAAmB,GAInB,iBAA0B,EAC1B,aAA0B,EAC1B,mBAA0B,EAC1B,sBAAyB,GAGzB,WAA0B,EAC1B,eAA0B,EAC1B,MAA0B,EAC1B,QAA0B,EAC1B,mBAA0B,EAG1B,SAA0B,EAC1B,OAA0B,EAE1B,UAA0B,EAG1B,WAA0B,CAE5B,EAqBA,KAAM,CAAE,YAAU,oBAAkB,mBAAiB,aAAW,cAAc,GAQxE,CACJ,WAAY,GAAc,mBAAiB,aAAc,GAAgB,SAAU,GAAY,QAAS,GACxG,KAAM,GAAQ,aAAc,GAAgB,eAAgB,EAAkB,aAAc,GAAgB,YAAa,GACzH,sBAAuB,GACvB,cAAY,kBAAgB,SAAO,WAAS,mBAAoB,GAChE,aACA,WAAY,IACV,GAKE,GAAgB,EAEhB,GAAc,GAEd,GAAgB,EAGhB,GAAgB,GAEhB,GAAgB,IAEhB,GAAgB,GAAW,EAAI,GAE/B,GAAgB,GAEhB,GAAgB,GAEhB,GAAgB,EAAI,GAAU,EAE9B,GAAY,GAGZ,EAAY,EACZ,GAAY,IACZ,GAAiB,GAAY,EAAY,EAEzC,GAAc,GAEd,GAAa,GACb,GAAc,GACd,GAAa,GACb,GAAgB,GAChB,GAAa,IACb,GAAa,IACb,GAAe,IAEf,EAAoB,EACpB,GAAoB,EACpB,GAAoB,EACpB,GAAoB,EAEpB,GAAU,EAEV,GAAM,CAAC,EAAM,IACjB,GAAK,IAAM,GAAS,GACb,GAGH,GAAO,AAAC,GACH,IAAM,GAAO,GAAK,EAAI,EAAI,GAG/B,GAAO,AAAC,GAAQ,CACpB,GAAI,GAAM,EAAI,OAAQ,KAAO,EAAE,GAAO,GAAK,EAAI,GAAO,CACxD,EAIA,GAAI,IAAY,CAAC,EAAG,EAAM,IAAW,IAAQ,EAAE,WAAc,GAAQ,EAAE,UAInE,GAAO,GAQX,KAAM,IAAgB,AAAC,GAAS,CAC9B,KAAM,GAAI,EAAK,MAGf,GAAI,GAAM,EAAE,QAIZ,AAHI,EAAM,EAAK,WACb,GAAM,EAAK,WAET,IAAQ,GAEZ,GAAK,OAAO,IAAI,EAAE,YAAY,SAAS,EAAE,YAAa,EAAE,YAAc,CAAG,EAAG,EAAK,QAAQ,EACzF,EAAK,UAAY,EACjB,EAAE,aAAe,EACjB,EAAK,WAAa,EAClB,EAAK,WAAa,EAClB,EAAE,SAAW,EACT,EAAE,UAAY,GAChB,GAAE,YAAc,GAEpB,EAGM,EAAmB,CAAC,EAAG,IAAS,CACpC,GAAgB,EAAI,EAAE,aAAe,EAAI,EAAE,YAAc,GAAK,EAAE,SAAW,EAAE,YAAa,CAAI,EAC9F,EAAE,YAAc,EAAE,SAClB,GAAc,EAAE,IAAI,CACtB,EAGM,EAAW,CAAC,EAAG,IAAM,CACzB,EAAE,YAAY,EAAE,WAAa,CAC/B,EAQM,GAAc,CAAC,EAAG,IAAM,CAI5B,EAAE,YAAY,EAAE,WAAc,IAAM,EAAK,IACzC,EAAE,YAAY,EAAE,WAAa,EAAI,GACnC,EAUM,GAAW,CAAC,EAAM,EAAK,EAAO,IAAS,CAE3C,GAAI,GAAM,EAAK,SAGf,MADI,GAAM,GAAQ,GAAM,GACpB,IAAQ,EAAY,EAExB,GAAK,UAAY,EAGjB,EAAI,IAAI,EAAK,MAAM,SAAS,EAAK,QAAS,EAAK,QAAU,CAAG,EAAG,CAAK,EACpE,AAAI,EAAK,MAAM,OAAS,EACtB,EAAK,MAAQ,GAAU,EAAK,MAAO,EAAK,EAAK,CAAK,EAG3C,EAAK,MAAM,OAAS,GAC3B,GAAK,MAAQ,EAAQ,EAAK,MAAO,EAAK,EAAK,CAAK,GAGlD,EAAK,SAAW,EAChB,EAAK,UAAY,EAEV,EACT,EAYM,GAAgB,CAAC,EAAG,IAAc,CAEtC,GAAI,GAAe,EAAE,iBACjB,EAAO,EAAE,SACT,EACA,EACA,EAAW,EAAE,YACb,EAAa,EAAE,WACnB,KAAM,GAAS,EAAE,SAAY,EAAE,OAAS,GACpC,EAAE,SAAY,GAAE,OAAS,IAAiB,EAExC,EAAO,EAAE,OAET,EAAQ,EAAE,OACV,EAAQ,EAAE,KAMV,EAAS,EAAE,SAAW,GAC5B,GAAI,GAAa,EAAK,EAAO,EAAW,GACpC,EAAa,EAAK,EAAO,GAQ7B,AAAI,EAAE,aAAe,EAAE,YACrB,KAAiB,GAKf,EAAa,EAAE,WAAa,GAAa,EAAE,WAI/C,EAaE,IAXA,EAAQ,EAWJ,IAAK,EAAQ,KAAkB,GAC/B,EAAK,EAAQ,EAAW,KAAO,GAC/B,EAAK,KAA0B,EAAK,IACpC,EAAK,EAAE,KAAwB,EAAK,EAAO,IAU/C,IAAQ,EACR,IAMA,EAAG,OAEM,EAAK,EAAE,KAAU,EAAK,EAAE,IAAU,EAAK,EAAE,KAAU,EAAK,EAAE,IAC1D,EAAK,EAAE,KAAU,EAAK,EAAE,IAAU,EAAK,EAAE,KAAU,EAAK,EAAE,IAC1D,EAAK,EAAE,KAAU,EAAK,EAAE,IAAU,EAAK,EAAE,KAAU,EAAK,EAAE,IAC1D,EAAK,EAAE,KAAU,EAAK,EAAE,IAAU,EAAK,EAAE,KAAU,EAAK,EAAE,IAC1D,EAAO,GAOhB,GAHA,EAAM,GAAa,GAAS,GAC5B,EAAO,EAAS,GAEZ,EAAM,EAAU,CAGlB,GAFA,EAAE,YAAc,EAChB,EAAW,EACP,GAAO,EACT,MAEF,EAAa,EAAK,EAAO,EAAW,GACpC,EAAa,EAAK,EAAO,EAC1B,QACO,GAAY,EAAK,EAAY,IAAU,GAAS,EAAE,IAAiB,GAE7E,MAAI,IAAY,EAAE,UACT,EAEF,EAAE,SACX,EAaM,GAAc,AAAC,GAAM,CAEzB,KAAM,GAAU,EAAE,OAClB,GAAI,GAAG,EAAG,EAAG,EAAM,EAInB,EAAG,CAqBD,GApBA,EAAO,EAAE,YAAc,EAAE,UAAY,EAAE,SAoBnC,EAAE,UAAY,EAAW,GAAU,IAAgB,CAErD,EAAE,OAAO,IAAI,EAAE,OAAO,SAAS,EAAS,EAAU,CAAO,EAAG,CAAC,EAC7D,EAAE,aAAe,EACjB,EAAE,UAAY,EAEd,EAAE,aAAe,EASjB,EAAI,EAAE,UACN,EAAI,EAEJ,EACE,GAAI,EAAE,KAAK,EAAE,GACb,EAAE,KAAK,GAAM,GAAK,EAAU,EAAI,EAAU,QACnC,EAAE,GAEX,EAAI,EACJ,EAAI,EAEJ,EACE,GAAI,EAAE,KAAK,EAAE,GACb,EAAE,KAAK,GAAM,GAAK,EAAU,EAAI,EAAU,QAInC,EAAE,GAEX,GAAQ,CACT,CACD,GAAI,EAAE,KAAK,WAAa,EACtB,MAmBF,GAJA,EAAI,GAAS,EAAE,KAAM,EAAE,OAAQ,EAAE,SAAW,EAAE,UAAW,CAAI,EAC7D,EAAE,WAAa,EAGX,EAAE,UAAY,EAAE,QAAU,EAS5B,IARA,EAAM,EAAE,SAAW,EAAE,OACrB,EAAE,MAAQ,EAAE,OAAO,GAGnB,EAAE,MAAQ,GAAK,EAAG,EAAE,MAAO,EAAE,OAAO,EAAM,EAAE,EAIrC,EAAE,QAEP,GAAE,MAAQ,GAAK,EAAG,EAAE,MAAO,EAAE,OAAO,EAAM,EAAY,EAAE,EAExD,EAAE,KAAK,EAAM,EAAE,QAAU,EAAE,KAAK,EAAE,OAClC,EAAE,KAAK,EAAE,OAAS,EAClB,IACA,EAAE,SACE,IAAE,UAAY,EAAE,OAAS,KAA7B,CASR,OAAW,EAAE,UAAY,IAAiB,EAAE,KAAK,WAAa,EAsC9D,EAWM,GAAiB,CAAC,EAAG,IAAU,CAKnC,GAAI,GAAiB,MAOrB,IALI,EAAiB,EAAE,iBAAmB,GACxC,GAAiB,EAAE,iBAAmB,KAI/B,CAEP,GAAI,EAAE,WAAa,EAAG,CAUpB,GADA,GAAY,CAAC,EACT,EAAE,YAAc,GAAK,IAAU,GACjC,MAAO,GAGT,GAAI,EAAE,YAAc,EAClB,KAGH,CAID,EAAE,UAAY,EAAE,UAChB,EAAE,UAAY,EAGd,KAAM,GAAY,EAAE,YAAc,EAkBlC,GAhBI,GAAE,WAAa,GAAK,EAAE,UAAY,IAEpC,GAAE,UAAY,EAAE,SAAW,EAC3B,EAAE,SAAW,EAEb,EAAiB,EAAG,EAAK,EACrB,EAAE,KAAK,YAAc,IAUvB,EAAE,SAAW,EAAE,aAAgB,EAAE,OAAS,IAE5C,GAAiB,EAAG,EAAK,EACrB,EAAE,KAAK,YAAc,GACvB,MAAO,EAIZ,CAID,MAFA,GAAE,OAAS,EAEP,IAAU,GAEZ,GAAiB,EAAG,EAAI,EACpB,EAAE,KAAK,YAAc,EAChB,GAGF,IAGL,GAAE,SAAW,EAAE,aAEjB,GAAiB,EAAG,EAAK,EACrB,EAAE,KAAK,YAAc,GAChB,EAMb,EASM,GAAe,CAAC,EAAG,IAAU,CAEjC,GAAI,GACA,EAEJ,OAAS,CAMP,GAAI,EAAE,UAAY,GAAe,CAE/B,GADA,GAAY,CAAC,EACT,EAAE,UAAY,IAAiB,IAAU,GAC3C,MAAO,GAET,GAAI,EAAE,YAAc,EAClB,KAEH,CAyBD,GApBA,EAAY,EACR,EAAE,WAAa,GAEjB,GAAE,MAAQ,GAAK,EAAG,EAAE,MAAO,EAAE,OAAO,EAAE,SAAW,EAAY,EAAE,EAC/D,EAAY,EAAE,KAAK,EAAE,SAAW,EAAE,QAAU,EAAE,KAAK,EAAE,OACrD,EAAE,KAAK,EAAE,OAAS,EAAE,UAOlB,IAAc,GAAc,EAAE,SAAW,GAAe,EAAE,OAAS,IAKrE,GAAE,aAAe,GAAc,EAAG,CAAS,GAGzC,EAAE,cAAgB,EAYpB,GAPA,EAAS,GAAU,EAAG,EAAE,SAAW,EAAE,YAAa,EAAE,aAAe,CAAS,EAE5E,EAAE,WAAa,EAAE,aAKb,EAAE,cAAgB,EAAE,gBAAuC,EAAE,WAAa,EAAW,CACvF,EAAE,eACF,EACE,GAAE,WAEF,EAAE,MAAQ,GAAK,EAAG,EAAE,MAAO,EAAE,OAAO,EAAE,SAAW,EAAY,EAAE,EAC/D,EAAY,EAAE,KAAK,EAAE,SAAW,EAAE,QAAU,EAAE,KAAK,EAAE,OACrD,EAAE,KAAK,EAAE,OAAS,EAAE,eAKb,EAAE,EAAE,eAAiB,GAC9B,EAAE,UACH,KAEC,GAAE,UAAY,EAAE,aAChB,EAAE,aAAe,EACjB,EAAE,MAAQ,EAAE,OAAO,EAAE,UAErB,EAAE,MAAQ,GAAK,EAAG,EAAE,MAAO,EAAE,OAAO,EAAE,SAAW,EAAE,MAarD,GAAS,GAAU,EAAG,EAAG,EAAE,OAAO,EAAE,SAAS,EAE7C,EAAE,YACF,EAAE,WAEJ,GAAI,GAEF,GAAiB,EAAG,EAAK,EACrB,EAAE,KAAK,YAAc,GACvB,MAAO,EAIZ,CAED,MADA,GAAE,OAAW,EAAE,SAAY,EAAY,EAAM,EAAE,SAAW,EAAY,EAClE,IAAU,GAEZ,GAAiB,EAAG,EAAI,EACpB,EAAE,KAAK,YAAc,EAChB,GAGF,IAEL,EAAE,UAEJ,GAAiB,EAAG,EAAK,EACrB,EAAE,KAAK,YAAc,GAChB,EAIJ,EACT,EAOM,GAAe,CAAC,EAAG,IAAU,CAEjC,GAAI,GACA,EAEA,EAGJ,OAAS,CAMP,GAAI,EAAE,UAAY,GAAe,CAE/B,GADA,GAAY,CAAC,EACT,EAAE,UAAY,IAAiB,IAAU,GAC3C,MAAO,GAET,GAAI,EAAE,YAAc,EAAK,KAC1B,CAyCD,GApCA,EAAY,EACR,EAAE,WAAa,GAEjB,GAAE,MAAQ,GAAK,EAAG,EAAE,MAAO,EAAE,OAAO,EAAE,SAAW,EAAY,EAAE,EAC/D,EAAY,EAAE,KAAK,EAAE,SAAW,EAAE,QAAU,EAAE,KAAK,EAAE,OACrD,EAAE,KAAK,EAAE,OAAS,EAAE,UAMtB,EAAE,YAAc,EAAE,aAClB,EAAE,WAAa,EAAE,YACjB,EAAE,aAAe,EAAY,EAEzB,IAAc,GAAY,EAAE,YAAc,EAAE,gBAC5C,EAAE,SAAW,GAAc,EAAE,OAAS,IAKxC,GAAE,aAAe,GAAc,EAAG,CAAS,EAGvC,EAAE,cAAgB,GAClB,GAAE,WAAa,IAAe,EAAE,eAAiB,GAAa,EAAE,SAAW,EAAE,YAAc,OAK7F,GAAE,aAAe,EAAY,IAM7B,EAAE,aAAe,GAAa,EAAE,cAAgB,EAAE,YAAa,CACjE,EAAa,EAAE,SAAW,EAAE,UAAY,EAOxC,EAAS,GAAU,EAAG,EAAE,SAAW,EAAI,EAAE,WAAY,EAAE,YAAc,CAAS,EAM9E,EAAE,WAAa,EAAE,YAAc,EAC/B,EAAE,aAAe,EACjB,EACE,AAAI,EAAE,EAAE,UAAY,GAElB,GAAE,MAAQ,GAAK,EAAG,EAAE,MAAO,EAAE,OAAO,EAAE,SAAW,EAAY,EAAE,EAC/D,EAAY,EAAE,KAAK,EAAE,SAAW,EAAE,QAAU,EAAE,KAAK,EAAE,OACrD,EAAE,KAAK,EAAE,OAAS,EAAE,gBAGf,EAAE,EAAE,cAAgB,GAK7B,GAJA,EAAE,gBAAkB,EACpB,EAAE,aAAe,EAAY,EAC7B,EAAE,WAEE,GAEF,GAAiB,EAAG,EAAK,EACrB,EAAE,KAAK,YAAc,GACvB,MAAO,EAKjB,SAAe,EAAE,iBAgBX,GATA,EAAS,GAAU,EAAG,EAAG,EAAE,OAAO,EAAE,SAAW,EAAE,EAE7C,GAEF,EAAiB,EAAG,EAAK,EAG3B,EAAE,WACF,EAAE,YACE,EAAE,KAAK,YAAc,EACvB,MAAO,OAMT,GAAE,gBAAkB,EACpB,EAAE,WACF,EAAE,WAEL,CAUD,MARI,GAAE,iBAGJ,GAAS,GAAU,EAAG,EAAG,EAAE,OAAO,EAAE,SAAW,EAAE,EAEjD,EAAE,gBAAkB,GAEtB,EAAE,OAAS,EAAE,SAAW,EAAY,EAAI,EAAE,SAAW,EAAY,EAC7D,IAAU,GAEZ,GAAiB,EAAG,EAAI,EACpB,EAAE,KAAK,YAAc,EAChB,GAGF,IAEL,EAAE,UAEJ,GAAiB,EAAG,EAAK,EACrB,EAAE,KAAK,YAAc,GAChB,EAKJ,EACT,EAQM,GAAc,CAAC,EAAG,IAAU,CAEhC,GAAI,GACA,EACA,EAAM,EAEV,KAAM,GAAO,EAAE,OAEf,OAAS,CAKP,GAAI,EAAE,WAAa,GAAW,CAE5B,GADA,GAAY,CAAC,EACT,EAAE,WAAa,IAAa,IAAU,GACxC,MAAO,GAET,GAAI,EAAE,YAAc,EAAK,KAC1B,CAID,GADA,EAAE,aAAe,EACb,EAAE,WAAa,GAAa,EAAE,SAAW,GAC3C,GAAO,EAAE,SAAW,EACpB,EAAO,EAAK,GACR,IAAS,EAAK,EAAE,IAAS,IAAS,EAAK,EAAE,IAAS,IAAS,EAAK,EAAE,IAAO,CAC3E,EAAS,EAAE,SAAW,GACtB,EAAG,OAEM,IAAS,EAAK,EAAE,IAAS,IAAS,EAAK,EAAE,IACzC,IAAS,EAAK,EAAE,IAAS,IAAS,EAAK,EAAE,IACzC,IAAS,EAAK,EAAE,IAAS,IAAS,EAAK,EAAE,IACzC,IAAS,EAAK,EAAE,IAAS,IAAS,EAAK,EAAE,IACzC,EAAO,GAChB,EAAE,aAAe,GAAa,GAAS,GACnC,EAAE,aAAe,EAAE,WACrB,GAAE,aAAe,EAAE,UAEtB,CAuBH,GAlBA,AAAI,EAAE,cAAgB,EAIpB,GAAS,GAAU,EAAG,EAAG,EAAE,aAAe,CAAS,EAEnD,EAAE,WAAa,EAAE,aACjB,EAAE,UAAY,EAAE,aAChB,EAAE,aAAe,GAKjB,GAAS,GAAU,EAAG,EAAG,EAAE,OAAO,EAAE,SAAS,EAE7C,EAAE,YACF,EAAE,YAEA,GAEF,GAAiB,EAAG,EAAK,EACrB,EAAE,KAAK,YAAc,GACvB,MAAO,EAIZ,CAED,MADA,GAAE,OAAS,EACP,IAAU,GAEZ,GAAiB,EAAG,EAAI,EACpB,EAAE,KAAK,YAAc,EAChB,GAGF,IAEL,EAAE,UAEJ,GAAiB,EAAG,EAAK,EACrB,EAAE,KAAK,YAAc,GAChB,EAIJ,EACT,EAMM,GAAe,CAAC,EAAG,IAAU,CAEjC,GAAI,GAEJ,OAAS,CAEP,GAAI,EAAE,YAAc,GAClB,IAAY,CAAC,EACT,EAAE,YAAc,GAAG,CACrB,GAAI,IAAU,GACZ,MAAO,GAET,KACD,CAUH,GANA,EAAE,aAAe,EAGjB,EAAS,GAAU,EAAG,EAAG,EAAE,OAAO,EAAE,SAAS,EAC7C,EAAE,YACF,EAAE,WACE,GAEF,GAAiB,EAAG,EAAK,EACrB,EAAE,KAAK,YAAc,GACvB,MAAO,EAIZ,CAED,MADA,GAAE,OAAS,EACP,IAAU,GAEZ,GAAiB,EAAG,EAAI,EACpB,EAAE,KAAK,YAAc,EAChB,GAGF,IAEL,EAAE,UAEJ,GAAiB,EAAG,EAAK,EACrB,EAAE,KAAK,YAAc,GAChB,EAIJ,EACT,EAOA,YAAgB,EAAa,EAAU,EAAa,EAAW,EAAM,CAEnE,KAAK,YAAc,EACnB,KAAK,SAAW,EAChB,KAAK,YAAc,EACnB,KAAK,UAAY,EACjB,KAAK,KAAO,CACd,CAEA,KAAM,IAAsB,CAE1B,GAAI,IAAO,EAAG,EAAG,EAAG,EAAG,EAAc,EACrC,GAAI,IAAO,EAAG,EAAG,EAAG,EAAG,EAAY,EACnC,GAAI,IAAO,EAAG,EAAG,GAAI,EAAG,EAAY,EACpC,GAAI,IAAO,EAAG,EAAG,GAAI,GAAI,EAAY,EAErC,GAAI,IAAO,EAAG,EAAG,GAAI,GAAI,EAAY,EACrC,GAAI,IAAO,EAAG,GAAI,GAAI,GAAI,EAAY,EACtC,GAAI,IAAO,EAAG,GAAI,IAAK,IAAK,EAAY,EACxC,GAAI,IAAO,EAAG,GAAI,IAAK,IAAK,EAAY,EACxC,GAAI,IAAO,GAAI,IAAK,IAAK,KAAM,EAAY,EAC3C,GAAI,IAAO,GAAI,IAAK,IAAK,KAAM,EAAY,CAC7C,EAMM,GAAU,AAAC,GAAM,CAErB,EAAE,YAAc,EAAI,EAAE,OAGtB,GAAK,EAAE,IAAI,EAIX,EAAE,eAAiB,GAAoB,EAAE,OAAO,SAChD,EAAE,WAAa,GAAoB,EAAE,OAAO,YAC5C,EAAE,WAAa,GAAoB,EAAE,OAAO,YAC5C,EAAE,iBAAmB,GAAoB,EAAE,OAAO,UAElD,EAAE,SAAW,EACb,EAAE,YAAc,EAChB,EAAE,UAAY,EACd,EAAE,OAAS,EACX,EAAE,aAAe,EAAE,YAAc,EAAY,EAC7C,EAAE,gBAAkB,EACpB,EAAE,MAAQ,CACZ,EAGA,aAAwB,CACtB,KAAK,KAAO,KACZ,KAAK,OAAS,EACd,KAAK,YAAc,KACnB,KAAK,iBAAmB,EACxB,KAAK,YAAc,EACnB,KAAK,QAAU,EACf,KAAK,KAAO,EACZ,KAAK,OAAS,KACd,KAAK,QAAU,EACf,KAAK,OAAS,GACd,KAAK,WAAa,GAElB,KAAK,OAAS,EACd,KAAK,OAAS,EACd,KAAK,OAAS,EAEd,KAAK,OAAS,KAQd,KAAK,YAAc,EAKnB,KAAK,KAAO,KAMZ,KAAK,KAAO,KAEZ,KAAK,MAAQ,EACb,KAAK,UAAY,EACjB,KAAK,UAAY,EACjB,KAAK,UAAY,EAEjB,KAAK,WAAa,EAOlB,KAAK,YAAc,EAKnB,KAAK,aAAe,EACpB,KAAK,WAAa,EAClB,KAAK,gBAAkB,EACvB,KAAK,SAAW,EAChB,KAAK,YAAc,EACnB,KAAK,UAAY,EAEjB,KAAK,YAAc,EAKnB,KAAK,iBAAmB,EAMxB,KAAK,eAAiB,EAYtB,KAAK,MAAQ,EACb,KAAK,SAAW,EAEhB,KAAK,WAAa,EAGlB,KAAK,WAAa,EAYlB,KAAK,UAAa,GAAI,aAAY,GAAY,CAAC,EAC/C,KAAK,UAAa,GAAI,aAAa,GAAI,GAAU,GAAK,CAAC,EACvD,KAAK,QAAa,GAAI,aAAa,GAAI,GAAW,GAAK,CAAC,EACxD,GAAK,KAAK,SAAS,EACnB,GAAK,KAAK,SAAS,EACnB,GAAK,KAAK,OAAO,EAEjB,KAAK,OAAW,KAChB,KAAK,OAAW,KAChB,KAAK,QAAW,KAGhB,KAAK,SAAW,GAAI,aAAY,GAAW,CAAC,EAI5C,KAAK,KAAO,GAAI,aAAY,EAAI,GAAU,CAAC,EAC3C,GAAK,KAAK,IAAI,EAEd,KAAK,SAAW,EAChB,KAAK,SAAW,EAKhB,KAAK,MAAQ,GAAI,aAAY,EAAI,GAAU,CAAC,EAC5C,GAAK,KAAK,KAAK,EAIf,KAAK,MAAQ,EAEb,KAAK,YAAc,EAoBnB,KAAK,SAAW,EAEhB,KAAK,MAAQ,EAMb,KAAK,QAAU,EACf,KAAK,WAAa,EAClB,KAAK,QAAU,EACf,KAAK,OAAS,EAGd,KAAK,OAAS,EAId,KAAK,SAAW,CAalB,CAGA,KAAM,IAAmB,AAAC,GAAS,CAEjC,GAAI,CAAC,GAAQ,CAAC,EAAK,MACjB,MAAO,IAAI,EAAM,CAAgB,EAGnC,EAAK,SAAW,EAAK,UAAY,EACjC,EAAK,UAAY,GAEjB,KAAM,GAAI,EAAK,MACf,SAAE,QAAU,EACZ,EAAE,YAAc,EAEZ,EAAE,KAAO,GACX,GAAE,KAAO,CAAC,EAAE,MAGd,EAAE,OAAU,EAAE,KAAO,GAAa,GAClC,EAAK,MAAS,EAAE,OAAS,EACvB,EAEA,EACF,EAAE,WAAa,GACf,GAAS,CAAC,EACH,EACT,EAGM,GAAe,AAAC,GAAS,CAE7B,KAAM,GAAM,GAAiB,CAAI,EACjC,MAAI,KAAQ,IACV,GAAQ,EAAK,KAAK,EAEb,CACT,EAGM,GAAmB,CAAC,EAAM,IAE1B,CAAC,GAAQ,CAAC,EAAK,OACf,EAAK,MAAM,OAAS,EAAY,EACpC,GAAK,MAAM,OAAS,EACb,IAIH,GAAe,CAAC,EAAM,EAAO,EAAQ,EAAY,EAAU,IAAa,CAE5E,GAAI,CAAC,EACH,MAAO,GAET,GAAI,GAAO,EAiBX,GAfI,IAAU,IACZ,GAAQ,GAGV,AAAI,EAAa,EACf,GAAO,EACP,EAAa,CAAC,GAGP,EAAa,IACpB,GAAO,EACP,GAAc,IAIZ,EAAW,GAAK,EAAW,IAAiB,IAAW,IACzD,EAAa,GAAK,EAAa,IAAM,EAAQ,GAAK,EAAQ,GAC1D,EAAW,GAAK,EAAW,GAC3B,MAAO,IAAI,EAAM,CAAgB,EAInC,AAAI,IAAe,GACjB,GAAa,GAIf,KAAM,GAAI,GAAI,IAEd,SAAK,MAAQ,EACb,EAAE,KAAO,EAET,EAAE,KAAO,EACT,EAAE,OAAS,KACX,EAAE,OAAS,EACX,EAAE,OAAS,GAAK,EAAE,OAClB,EAAE,OAAS,EAAE,OAAS,EAEtB,EAAE,UAAY,EAAW,EACzB,EAAE,UAAY,GAAK,EAAE,UACrB,EAAE,UAAY,EAAE,UAAY,EAC5B,EAAE,WAAa,CAAC,CAAG,IAAE,UAAY,EAAY,GAAK,GAElD,EAAE,OAAS,GAAI,YAAW,EAAE,OAAS,CAAC,EACtC,EAAE,KAAO,GAAI,aAAY,EAAE,SAAS,EACpC,EAAE,KAAO,GAAI,aAAY,EAAE,MAAM,EAKjC,EAAE,YAAc,GAAM,EAAW,EAEjC,EAAE,iBAAmB,EAAE,YAAc,EAIrC,EAAE,YAAc,GAAI,YAAW,EAAE,gBAAgB,EAIjD,EAAE,MAAQ,EAAI,EAAE,YAGhB,EAAE,MAAS,GAAI,GAAK,EAAE,YAEtB,EAAE,MAAQ,EACV,EAAE,SAAW,EACb,EAAE,OAAS,EAEJ,GAAa,CAAI,CAC1B,EAEM,GAAc,CAAC,EAAM,IAElB,GAAa,EAAM,EAAO,GAAc,GAAa,GAAe,EAAoB,EAI3F,GAAY,CAAC,EAAM,IAAU,CAEjC,GAAI,GAAK,EAET,GAAI,CAAC,GAAQ,CAAC,EAAK,OACjB,EAAQ,IAAa,EAAQ,EAC7B,MAAO,GAAO,GAAI,EAAM,CAAgB,EAAI,EAG9C,KAAM,GAAI,EAAK,MAEf,GAAI,CAAC,EAAK,QACL,CAAC,EAAK,OAAS,EAAK,WAAa,GACjC,EAAE,SAAW,IAAgB,IAAU,GAC1C,MAAO,IAAI,EAAO,EAAK,YAAc,EAAK,GAAgB,CAAgB,EAG5E,EAAE,KAAO,EACT,KAAM,GAAY,EAAE,WAIpB,GAHA,EAAE,WAAa,EAGX,EAAE,SAAW,GAEf,GAAI,EAAE,OAAS,EACb,EAAK,MAAQ,EACb,EAAS,EAAG,EAAE,EACd,EAAS,EAAG,GAAG,EACf,EAAS,EAAG,CAAC,EACb,AAAK,EAAE,OAaL,GAAS,EAAI,GAAE,OAAO,KAAO,EAAI,GACpB,GAAE,OAAO,KAAO,EAAI,GACpB,CAAC,EAAE,OAAO,MAAY,EAAJ,GAClB,CAAC,EAAE,OAAO,KAAW,EAAJ,GACjB,CAAC,EAAE,OAAO,QAAc,GAAJ,EACzC,EACQ,EAAS,EAAG,EAAE,OAAO,KAAO,GAAI,EAChC,EAAS,EAAI,EAAE,OAAO,MAAQ,EAAK,GAAI,EACvC,EAAS,EAAI,EAAE,OAAO,MAAQ,GAAM,GAAI,EACxC,EAAS,EAAI,EAAE,OAAO,MAAQ,GAAM,GAAI,EACxC,EAAS,EAAG,EAAE,QAAU,EAAI,EACf,EAAE,UAAY,IAAkB,EAAE,MAAQ,EAC1C,EAAI,CAAE,EACnB,EAAS,EAAG,EAAE,OAAO,GAAK,GAAI,EAC1B,EAAE,OAAO,OAAS,EAAE,OAAO,MAAM,QACnC,GAAS,EAAG,EAAE,OAAO,MAAM,OAAS,GAAI,EACxC,EAAS,EAAI,EAAE,OAAO,MAAM,QAAU,EAAK,GAAI,GAE7C,EAAE,OAAO,MACX,GAAK,MAAQ,EAAQ,EAAK,MAAO,EAAE,YAAa,EAAE,QAAS,CAAC,GAE9D,EAAE,QAAU,EACZ,EAAE,OAAS,IAlCX,GAAS,EAAG,CAAC,EACb,EAAS,EAAG,CAAC,EACb,EAAS,EAAG,CAAC,EACb,EAAS,EAAG,CAAC,EACb,EAAS,EAAG,CAAC,EACb,EAAS,EAAG,EAAE,QAAU,EAAI,EACf,EAAE,UAAY,IAAkB,EAAE,MAAQ,EAC1C,EAAI,CAAE,EACnB,EAAS,EAAG,EAAO,EACnB,EAAE,OAAS,QA6Bf,CACE,GAAI,GAAU,GAAiB,GAAE,OAAS,GAAM,IAAO,EACnD,EAAc,GAElB,AAAI,EAAE,UAAY,IAAkB,EAAE,MAAQ,EAC5C,EAAc,EACT,AAAI,EAAE,MAAQ,EACnB,EAAc,EACT,AAAI,EAAE,QAAU,EACrB,EAAc,EAEd,EAAc,EAEhB,GAAW,GAAe,EACtB,EAAE,WAAa,GAAK,IAAU,IAClC,GAAU,GAAM,EAAS,GAEzB,EAAE,OAAS,GACX,GAAY,EAAG,CAAM,EAGjB,EAAE,WAAa,GACjB,IAAY,EAAG,EAAK,QAAU,EAAE,EAChC,GAAY,EAAG,EAAK,MAAQ,KAAM,GAEpC,EAAK,MAAQ,CACd,CAIH,GAAI,EAAE,SAAW,GACf,GAAI,EAAE,OAAO,MAAqB,CAGhC,IAFA,EAAM,EAAE,QAED,EAAE,QAAW,GAAE,OAAO,MAAM,OAAS,QACtC,IAAE,UAAY,EAAE,kBACd,GAAE,OAAO,MAAQ,EAAE,QAAU,GAC/B,GAAK,MAAQ,EAAQ,EAAK,MAAO,EAAE,YAAa,EAAE,QAAU,EAAK,CAAG,GAEtE,GAAc,CAAI,EAClB,EAAM,EAAE,QACJ,EAAE,UAAY,EAAE,oBAItB,EAAS,EAAG,EAAE,OAAO,MAAM,EAAE,SAAW,GAAI,EAC5C,EAAE,UAEJ,AAAI,EAAE,OAAO,MAAQ,EAAE,QAAU,GAC/B,GAAK,MAAQ,EAAQ,EAAK,MAAO,EAAE,YAAa,EAAE,QAAU,EAAK,CAAG,GAElE,EAAE,UAAY,EAAE,OAAO,MAAM,QAC/B,GAAE,QAAU,EACZ,EAAE,OAAS,GAEd,KAEC,GAAE,OAAS,GAGf,GAAI,EAAE,SAAW,GACf,GAAI,EAAE,OAAO,KAAoB,CAC/B,EAAM,EAAE,QAGR,EAAG,CACD,GAAI,EAAE,UAAY,EAAE,kBACd,GAAE,OAAO,MAAQ,EAAE,QAAU,GAC/B,GAAK,MAAQ,EAAQ,EAAK,MAAO,EAAE,YAAa,EAAE,QAAU,EAAK,CAAG,GAEtE,GAAc,CAAI,EAClB,EAAM,EAAE,QACJ,EAAE,UAAY,EAAE,kBAAkB,CACpC,EAAM,EACN,KACD,CAGH,AAAI,EAAE,QAAU,EAAE,OAAO,KAAK,OAC5B,EAAM,EAAE,OAAO,KAAK,WAAW,EAAE,SAAS,EAAI,IAE9C,EAAM,EAER,EAAS,EAAG,CAAG,CACvB,OAAe,IAAQ,GAEjB,AAAI,EAAE,OAAO,MAAQ,EAAE,QAAU,GAC/B,GAAK,MAAQ,EAAQ,EAAK,MAAO,EAAE,YAAa,EAAE,QAAU,EAAK,CAAG,GAElE,IAAQ,GACV,GAAE,QAAU,EACZ,EAAE,OAAS,GAEd,KAEC,GAAE,OAAS,GAGf,GAAI,EAAE,SAAW,GACf,GAAI,EAAE,OAAO,QAAuB,CAClC,EAAM,EAAE,QAGR,EAAG,CACD,GAAI,EAAE,UAAY,EAAE,kBACd,GAAE,OAAO,MAAQ,EAAE,QAAU,GAC/B,GAAK,MAAQ,EAAQ,EAAK,MAAO,EAAE,YAAa,EAAE,QAAU,EAAK,CAAG,GAEtE,GAAc,CAAI,EAClB,EAAM,EAAE,QACJ,EAAE,UAAY,EAAE,kBAAkB,CACpC,EAAM,EACN,KACD,CAGH,AAAI,EAAE,QAAU,EAAE,OAAO,QAAQ,OAC/B,EAAM,EAAE,OAAO,QAAQ,WAAW,EAAE,SAAS,EAAI,IAEjD,EAAM,EAER,EAAS,EAAG,CAAG,CACvB,OAAe,IAAQ,GAEjB,AAAI,EAAE,OAAO,MAAQ,EAAE,QAAU,GAC/B,GAAK,MAAQ,EAAQ,EAAK,MAAO,EAAE,YAAa,EAAE,QAAU,EAAK,CAAG,GAElE,IAAQ,GACV,GAAE,OAAS,GAEd,KAEC,GAAE,OAAS,GAsBf,GAnBI,EAAE,SAAW,IACf,CAAI,EAAE,OAAO,KACP,GAAE,QAAU,EAAI,EAAE,kBACpB,GAAc,CAAI,EAEhB,EAAE,QAAU,GAAK,EAAE,kBACrB,GAAS,EAAG,EAAK,MAAQ,GAAI,EAC7B,EAAS,EAAI,EAAK,OAAS,EAAK,GAAI,EACpC,EAAK,MAAQ,EACb,EAAE,OAAS,KAIb,EAAE,OAAS,IAMX,EAAE,UAAY,GAEhB,GADA,GAAc,CAAI,EACd,EAAK,YAAc,EAOrB,SAAE,WAAa,GACR,WAOA,EAAK,WAAa,GAAK,GAAK,CAAK,GAAK,GAAK,CAAS,GAC7D,IAAU,GACV,MAAO,IAAI,EAAM,EAAa,EAIhC,GAAI,EAAE,SAAW,IAAgB,EAAK,WAAa,EACjD,MAAO,IAAI,EAAM,EAAa,EAKhC,GAAI,EAAK,WAAa,GAAK,EAAE,YAAc,GACxC,IAAU,IAAgB,EAAE,SAAW,GAAe,CACvD,GAAI,GAAU,EAAE,WAAa,GAAkB,GAAa,EAAG,CAAK,EACjE,EAAE,WAAa,GAAQ,GAAY,EAAG,CAAK,EAC1C,GAAoB,EAAE,OAAO,KAAK,EAAG,CAAK,EAK9C,GAHI,KAAW,IAAqB,IAAW,KAC7C,GAAE,OAAS,IAET,IAAW,GAAgB,IAAW,GACxC,MAAI,GAAK,YAAc,GACrB,GAAE,WAAa,IAGV,GAST,GAAI,IAAW,IACb,CAAI,IAAU,GACZ,GAAU,CAAC,EAEJ,IAAU,IAEjB,IAAiB,EAAG,EAAG,EAAG,EAAK,EAI3B,IAAU,IAEZ,IAAK,EAAE,IAAI,EAEP,EAAE,YAAc,GAClB,GAAE,SAAW,EACb,EAAE,YAAc,EAChB,EAAE,OAAS,KAIjB,GAAc,CAAI,EACd,EAAK,YAAc,GACrB,SAAE,WAAa,GACR,EAGZ,CAID,MAAI,KAAU,GAAqB,GAC/B,EAAE,MAAQ,EAAY,GAG1B,CAAI,EAAE,OAAS,EACb,GAAS,EAAG,EAAK,MAAQ,GAAI,EAC7B,EAAS,EAAI,EAAK,OAAS,EAAK,GAAI,EACpC,EAAS,EAAI,EAAK,OAAS,GAAM,GAAI,EACrC,EAAS,EAAI,EAAK,OAAS,GAAM,GAAI,EACrC,EAAS,EAAG,EAAK,SAAW,GAAI,EAChC,EAAS,EAAI,EAAK,UAAY,EAAK,GAAI,EACvC,EAAS,EAAI,EAAK,UAAY,GAAM,GAAI,EACxC,EAAS,EAAI,EAAK,UAAY,GAAM,GAAI,GAIxC,IAAY,EAAG,EAAK,QAAU,EAAE,EAChC,GAAY,EAAG,EAAK,MAAQ,KAAM,GAGpC,GAAc,CAAI,EAId,EAAE,KAAO,GAAK,GAAE,KAAO,CAAC,EAAE,MAEvB,EAAE,UAAY,EAAI,GAAS,GACpC,EAGM,GAAa,AAAC,GAAS,CAE3B,GAAI,CAAC,GAAqB,CAAC,EAAK,MAC9B,MAAO,GAGT,KAAM,GAAS,EAAK,MAAM,OAC1B,MAAI,KAAW,IACb,IAAW,IACX,IAAW,IACX,IAAW,IACX,IAAW,IACX,IAAW,IACX,IAAW,GAEJ,GAAI,EAAM,CAAgB,EAGnC,GAAK,MAAQ,KAEN,IAAW,GAAa,GAAI,EAAM,EAAc,EAAI,GAC7D,EAOM,GAAuB,CAAC,EAAM,IAAe,CAEjD,GAAI,GAAa,EAAW,OAE5B,GAAI,CAAC,GAAqB,CAAC,EAAK,MAC9B,MAAO,GAGT,KAAM,GAAI,EAAK,MACT,EAAO,EAAE,KAEf,GAAI,IAAS,GAAM,IAAS,GAAK,EAAE,SAAW,IAAe,EAAE,UAC7D,MAAO,GAYT,GARI,IAAS,GAEX,GAAK,MAAQ,GAAU,EAAK,MAAO,EAAY,EAAY,CAAC,GAG9D,EAAE,KAAO,EAGL,GAAc,EAAE,OAAQ,CAC1B,AAAI,IAAS,GAEX,IAAK,EAAE,IAAI,EACX,EAAE,SAAW,EACb,EAAE,YAAc,EAChB,EAAE,OAAS,GAIb,GAAI,GAAU,GAAI,YAAW,EAAE,MAAM,EACrC,EAAQ,IAAI,EAAW,SAAS,EAAa,EAAE,OAAQ,CAAU,EAAG,CAAC,EACrE,EAAa,EACb,EAAa,EAAE,MAChB,CAED,KAAM,GAAQ,EAAK,SACb,EAAO,EAAK,QACZ,EAAQ,EAAK,MAKnB,IAJA,EAAK,SAAW,EAChB,EAAK,QAAU,EACf,EAAK,MAAQ,EACb,GAAY,CAAC,EACN,EAAE,WAAa,GAAW,CAC/B,GAAI,GAAM,EAAE,SACR,EAAI,EAAE,UAAa,GAAY,GACnC,EAEE,GAAE,MAAQ,GAAK,EAAG,EAAE,MAAO,EAAE,OAAO,EAAM,EAAY,EAAE,EAExD,EAAE,KAAK,EAAM,EAAE,QAAU,EAAE,KAAK,EAAE,OAElC,EAAE,KAAK,EAAE,OAAS,EAClB,UACO,EAAE,GACX,EAAE,SAAW,EACb,EAAE,UAAY,EAAY,EAC1B,GAAY,CAAC,CACd,CACD,SAAE,UAAY,EAAE,UAChB,EAAE,YAAc,EAAE,SAClB,EAAE,OAAS,EAAE,UACb,EAAE,UAAY,EACd,EAAE,aAAe,EAAE,YAAc,EAAY,EAC7C,EAAE,gBAAkB,EACpB,EAAK,QAAU,EACf,EAAK,MAAQ,EACb,EAAK,SAAW,EAChB,EAAE,KAAO,EACF,EACT,EAGA,GAAI,IAAgB,GAChB,GAAiB,GACjB,GAAiB,GACjB,GAAqB,GACrB,GAAqB,GACrB,GAAc,GACd,GAAe,GACf,GAAyB,GACzB,GAAc,qCAWd,GAAc,CACjB,YAAa,GACb,aAAc,GACd,aAAc,GACd,iBAAkB,GAClB,iBAAkB,GAClB,QAAS,GACT,WAAY,GACZ,qBAAsB,GACtB,YAAa,EACd,EAEA,KAAM,IAAO,CAAC,EAAK,IACV,OAAO,UAAU,eAAe,KAAK,EAAK,CAAG,EAGtD,GAAI,IAAS,SAAU,EAAkC,CACvD,KAAM,GAAU,MAAM,UAAU,MAAM,KAAK,UAAW,CAAC,EACvD,KAAO,EAAQ,QAAQ,CACrB,KAAM,GAAS,EAAQ,QACvB,GAAI,EAAC,EAEL,IAAI,MAAO,IAAW,SACpB,KAAM,IAAI,WAAU,EAAS,oBAAoB,EAGnD,SAAW,KAAK,GACd,AAAI,GAAK,EAAQ,CAAC,GAChB,GAAI,GAAK,EAAO,IAGrB,CAED,MAAO,EACT,EAII,GAAgB,AAAC,GAAW,CAE9B,GAAI,GAAM,EAEV,OAAS,GAAI,EAAG,EAAI,EAAO,OAAQ,EAAI,EAAG,IACxC,GAAO,EAAO,GAAG,OAInB,KAAM,GAAS,GAAI,YAAW,CAAG,EAEjC,OAAS,GAAI,EAAG,EAAM,EAAG,EAAI,EAAO,OAAQ,EAAI,EAAG,IAAK,CACtD,GAAI,GAAQ,EAAO,GACnB,EAAO,IAAI,EAAO,CAAG,EACrB,GAAO,EAAM,MACd,CAED,MAAO,EACT,EAEI,GAAS,CACZ,OAAQ,GACR,cAAe,EAChB,EAUA,GAAI,IAAmB,GAEvB,GAAI,CAAE,OAAO,aAAa,MAAM,KAAM,GAAI,YAAW,CAAC,CAAC,CAAI,MAAC,CAAa,GAAmB,EAAQ,CAMpG,KAAM,IAAW,GAAI,YAAW,GAAG,EACnC,OAAS,GAAI,EAAG,EAAI,IAAK,IACvB,GAAS,GAAM,GAAK,IAAM,EAAI,GAAK,IAAM,EAAI,GAAK,IAAM,EAAI,GAAK,IAAM,EAAI,GAAK,IAAM,EAAI,EAE5F,GAAS,KAAO,GAAS,KAAO,EAIhC,GAAI,IAAa,AAAC,GAAQ,CACxB,GAAI,MAAO,cAAgB,YAAc,YAAY,UAAU,OAC7D,MAAO,IAAI,aAAW,EAAG,OAAO,CAAG,EAGrC,GAAI,GAAK,EAAG,EAAI,EAAO,EAAG,EAAU,EAAI,OAAQ,EAAU,EAG1D,IAAK,EAAQ,EAAG,EAAQ,EAAS,IAC/B,EAAI,EAAI,WAAW,CAAK,EACnB,GAAI,SAAY,OAAW,EAAQ,EAAI,GAC1C,GAAK,EAAI,WAAW,EAAQ,CAAC,EACxB,GAAK,SAAY,OACpB,GAAI,MAAY,GAAI,OAAW,IAAO,GAAK,OAC3C,MAGJ,GAAW,EAAI,IAAO,EAAI,EAAI,KAAQ,EAAI,EAAI,MAAU,EAAI,EAO9D,IAHA,EAAM,GAAI,YAAW,CAAO,EAGvB,EAAI,EAAG,EAAQ,EAAG,EAAI,EAAS,IAClC,EAAI,EAAI,WAAW,CAAK,EACnB,GAAI,SAAY,OAAW,EAAQ,EAAI,GAC1C,GAAK,EAAI,WAAW,EAAQ,CAAC,EACxB,GAAK,SAAY,OACpB,GAAI,MAAY,GAAI,OAAW,IAAO,GAAK,OAC3C,MAGJ,AAAI,EAAI,IAEN,EAAI,KAAO,EACN,AAAI,EAAI,KAEb,GAAI,KAAO,IAAQ,IAAM,EACzB,EAAI,KAAO,IAAQ,EAAI,IAClB,AAAI,EAAI,MAEb,GAAI,KAAO,IAAQ,IAAM,GACzB,EAAI,KAAO,IAAQ,IAAM,EAAI,GAC7B,EAAI,KAAO,IAAQ,EAAI,IAGvB,GAAI,KAAO,IAAQ,IAAM,GACzB,EAAI,KAAO,IAAQ,IAAM,GAAK,GAC9B,EAAI,KAAO,IAAQ,IAAM,EAAI,GAC7B,EAAI,KAAO,IAAQ,EAAI,IAI3B,MAAO,EACT,EAGA,KAAM,IAAgB,CAAC,EAAK,IAAQ,CAIlC,GAAI,EAAM,OACJ,EAAI,UAAY,GAClB,MAAO,QAAO,aAAa,MAAM,KAAM,EAAI,SAAW,EAAM,EAAM,EAAI,SAAS,EAAG,CAAG,CAAC,EAI1F,GAAI,GAAS,GACb,OAAS,GAAI,EAAG,EAAI,EAAK,IACvB,GAAU,OAAO,aAAa,EAAI,EAAE,EAEtC,MAAO,EACT,EAIA,GAAI,IAAa,CAAC,EAAK,IAAQ,CAC7B,KAAM,GAAM,GAAO,EAAI,OAEvB,GAAI,MAAO,cAAgB,YAAc,YAAY,UAAU,OAC7D,MAAO,IAAI,aAAa,EAAC,OAAO,EAAI,SAAS,EAAG,CAAG,CAAC,EAGtD,GAAI,GAAG,EAKP,KAAM,GAAW,GAAI,OAAM,EAAM,CAAC,EAElC,IAAK,EAAM,EAAG,EAAI,EAAG,EAAI,GAAM,CAC7B,GAAI,GAAI,EAAI,KAEZ,GAAI,EAAI,IAAM,CAAE,EAAS,KAAS,EAAG,QAAW,CAEhD,GAAI,GAAQ,GAAS,GAErB,GAAI,EAAQ,EAAG,CAAE,EAAS,KAAS,MAAQ,GAAK,EAAQ,EAAG,QAAW,CAKtE,IAFA,GAAK,IAAU,EAAI,GAAO,IAAU,EAAI,GAAO,EAExC,EAAQ,GAAK,EAAI,GACtB,EAAK,GAAK,EAAM,EAAI,KAAO,GAC3B,IAIF,GAAI,EAAQ,EAAG,CAAE,EAAS,KAAS,MAAQ,QAAW,CAEtD,AAAI,EAAI,MACN,EAAS,KAAS,EAElB,IAAK,MACL,EAAS,KAAS,MAAW,GAAK,GAAM,KACxC,EAAS,KAAS,MAAU,EAAI,KAEnC,CAED,MAAO,IAAc,EAAU,CAAG,CACpC,EASI,GAAa,CAAC,EAAK,IAAQ,CAE7B,EAAM,GAAO,EAAI,OACb,EAAM,EAAI,QAAU,GAAM,EAAI,QAGlC,GAAI,GAAM,EAAM,EAChB,KAAO,GAAO,GAAM,GAAI,GAAO,OAAU,KAAQ,IAQjD,MAJI,GAAM,GAIN,IAAQ,EAAY,EAEhB,EAAM,GAAS,EAAI,IAAQ,EAAO,EAAM,CAClD,EAEI,GAAU,CACb,WAAY,GACZ,WAAY,GACZ,WAAY,EACb,EAqBA,aAAmB,CAEjB,KAAK,MAAQ,KACb,KAAK,QAAU,EAEf,KAAK,SAAW,EAEhB,KAAK,SAAW,EAEhB,KAAK,OAAS,KACd,KAAK,SAAW,EAEhB,KAAK,UAAY,EAEjB,KAAK,UAAY,EAEjB,KAAK,IAAM,GAEX,KAAK,MAAQ,KAEb,KAAK,UAAY,EAEjB,KAAK,MAAQ,CACf,CAEA,GAAI,IAAU,GAEd,KAAM,IAAa,OAAO,UAAU,SAK9B,CACJ,WAAY,GAAc,gBAAc,gBAAc,SAAU,GAChE,KAAM,GAAQ,aAAc,GAC5B,yBACA,sBACA,WAAY,IACV,GA0FJ,YAAmB,EAAS,CAC1B,KAAK,QAAU,GAAO,OAAO,CAC3B,MAAO,GACP,OAAQ,GACR,UAAW,MACX,WAAY,GACZ,SAAU,EACV,SAAU,EACd,EAAK,GAAW,CAAA,CAAE,EAEhB,GAAI,GAAM,KAAK,QAEf,AAAI,EAAI,KAAQ,EAAI,WAAa,EAC/B,EAAI,WAAa,CAAC,EAAI,WAGf,EAAI,MAAS,EAAI,WAAa,GAAO,EAAI,WAAa,IAC7D,GAAI,YAAc,IAGpB,KAAK,IAAS,EACd,KAAK,IAAS,GACd,KAAK,MAAS,GACd,KAAK,OAAS,GAEd,KAAK,KAAO,GAAI,IAChB,KAAK,KAAK,UAAY,EAEtB,GAAI,GAAS,GAAY,aACvB,KAAK,KACL,EAAI,MACJ,EAAI,OACJ,EAAI,WACJ,EAAI,SACJ,EAAI,QACR,EAEE,GAAI,IAAW,GACb,KAAM,IAAI,OAAM,GAAS,EAAO,EAOlC,GAJI,EAAI,QACN,GAAY,iBAAiB,KAAK,KAAM,EAAI,MAAM,EAGhD,EAAI,WAAY,CAClB,GAAI,GAaJ,GAXA,AAAI,MAAO,GAAI,YAAe,SAE5B,EAAO,GAAQ,WAAW,EAAI,UAAU,EACnC,AAAI,GAAW,KAAK,EAAI,UAAU,IAAM,uBAC7C,EAAO,GAAI,YAAW,EAAI,UAAU,EAEpC,EAAO,EAAI,WAGb,EAAS,GAAY,qBAAqB,KAAK,KAAM,CAAI,EAErD,IAAW,GACb,KAAM,IAAI,OAAM,GAAS,EAAO,EAGlC,KAAK,UAAY,EAClB,CACH,CAwBA,GAAU,UAAU,KAAO,SAAU,EAAM,EAAY,CACrD,KAAM,GAAO,KAAK,KACZ,EAAY,KAAK,QAAQ,UAC/B,GAAI,GAAQ,EAEZ,GAAI,KAAK,MAAS,MAAO,GAkBzB,IAhBA,AAAI,IAAe,CAAC,CAAC,EAAY,EAAc,EAC1C,EAAc,IAAe,GAAO,GAAa,GAGtD,AAAI,MAAO,IAAS,SAElB,EAAK,MAAQ,GAAQ,WAAW,CAAI,EAC/B,AAAI,GAAW,KAAK,CAAI,IAAM,uBACnC,EAAK,MAAQ,GAAI,YAAW,CAAI,EAEhC,EAAK,MAAQ,EAGf,EAAK,QAAU,EACf,EAAK,SAAW,EAAK,MAAM,SAElB,CAQP,GAPI,EAAK,YAAc,GACrB,GAAK,OAAS,GAAI,YAAW,CAAS,EACtC,EAAK,SAAW,EAChB,EAAK,UAAY,GAId,KAAgB,IAAgB,IAAgB,KAAiB,EAAK,WAAa,EAAG,CACzF,KAAK,OAAO,EAAK,OAAO,SAAS,EAAG,EAAK,QAAQ,CAAC,EAClD,EAAK,UAAY,EACjB,QACD,CAKD,GAHA,EAAS,GAAY,QAAQ,EAAM,CAAW,EAG1C,IAAW,GACb,MAAI,GAAK,SAAW,GAClB,KAAK,OAAO,EAAK,OAAO,SAAS,EAAG,EAAK,QAAQ,CAAC,EAEpD,EAAS,GAAY,WAAW,KAAK,IAAI,EACzC,KAAK,MAAM,CAAM,EACjB,KAAK,MAAQ,GACN,IAAW,GAIpB,GAAI,EAAK,YAAc,EAAG,CACxB,KAAK,OAAO,EAAK,MAAM,EACvB,QACD,CAGD,GAAI,EAAc,GAAK,EAAK,SAAW,EAAG,CACxC,KAAK,OAAO,EAAK,OAAO,SAAS,EAAG,EAAK,QAAQ,CAAC,EAClD,EAAK,UAAY,EACjB,QACD,CAED,GAAI,EAAK,WAAa,EAAG,KAC1B,CAED,MAAO,EACT,EAUA,GAAU,UAAU,OAAS,SAAU,EAAO,CAC5C,KAAK,OAAO,KAAK,CAAK,CACxB,EAYA,GAAU,UAAU,MAAQ,SAAU,EAAQ,CAE5C,AAAI,IAAW,IACb,MAAK,OAAS,GAAO,cAAc,KAAK,MAAM,GAEhD,KAAK,OAAS,GACd,KAAK,IAAM,EACX,KAAK,IAAM,KAAK,KAAK,GACvB,EAmCA,YAAmB,EAAO,EAAS,CACjC,KAAM,GAAW,GAAI,IAAU,CAAO,EAKtC,GAHA,EAAS,KAAK,EAAO,EAAI,EAGrB,EAAS,IAAO,KAAM,GAAS,KAAO,GAAS,EAAS,KAE5D,MAAO,GAAS,MAClB,CAWA,YAAsB,EAAO,EAAS,CACpC,SAAU,GAAW,GACrB,EAAQ,IAAM,GACP,GAAU,EAAO,CAAO,CACjC,CAWA,YAAgB,EAAO,EAAS,CAC9B,SAAU,GAAW,GACrB,EAAQ,KAAO,GACR,GAAU,EAAO,CAAO,CACjC,CAGA,GAAI,IAAc,GACd,GAAY,GACZ,GAAiB,GACjB,GAAW,GACX,GAAc,GAEd,GAAc,CACjB,QAAS,GACT,QAAS,GACT,WAAY,GACZ,KAAM,GACN,UAAW,EACZ,EAsBA,KAAM,IAAQ,GACR,GAAS,GAqCf,GAAI,IAAU,SAAsB,EAAM,EAAO,CAC/C,GAAI,GACA,EACA,EACA,EACA,EAEA,EAEA,EACA,EACA,EAEA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EAEA,EACA,EACA,EACA,EAGA,EAAO,EAGX,KAAM,GAAQ,EAAK,MAEnB,EAAM,EAAK,QACX,EAAQ,EAAK,MACb,EAAO,EAAO,GAAK,SAAW,GAC9B,EAAO,EAAK,SACZ,EAAS,EAAK,OACd,EAAM,EAAQ,GAAQ,EAAK,WAC3B,EAAM,EAAQ,GAAK,UAAY,KAE/B,EAAO,EAAM,KAEb,EAAQ,EAAM,MACd,EAAQ,EAAM,MACd,EAAQ,EAAM,MACd,EAAW,EAAM,OACjB,EAAO,EAAM,KACb,EAAO,EAAM,KACb,EAAQ,EAAM,QACd,EAAQ,EAAM,SACd,EAAS,IAAK,EAAM,SAAW,EAC/B,EAAS,IAAK,EAAM,UAAY,EAMhC,EACA,EAAG,CACD,AAAI,EAAO,IACT,IAAQ,EAAM,MAAU,EACxB,GAAQ,EACR,GAAQ,EAAM,MAAU,EACxB,GAAQ,GAGV,EAAO,EAAM,EAAO,GAEpB,EACA,OAAS,CAKP,GAJA,EAAK,IAAS,GACd,KAAU,EACV,GAAQ,EACR,EAAM,IAAS,GAAM,IACjB,IAAO,EAIT,EAAO,KAAU,EAAO,cAEjB,EAAK,GAAI,CAChB,EAAM,EAAO,MACb,GAAM,GACF,GACE,GAAO,GACT,IAAQ,EAAM,MAAU,EACxB,GAAQ,GAEV,GAAO,EAAS,IAAK,GAAM,EAC3B,KAAU,EACV,GAAQ,GAGN,EAAO,IACT,IAAQ,EAAM,MAAU,EACxB,GAAQ,EACR,GAAQ,EAAM,MAAU,EACxB,GAAQ,GAEV,EAAO,EAAM,EAAO,GAEpB,EACA,OAAS,CAMP,GALA,EAAK,IAAS,GACd,KAAU,EACV,GAAQ,EACR,EAAM,IAAS,GAAM,IAEjB,EAAK,GAAI,CAaX,GAZA,EAAO,EAAO,MACd,GAAM,GACF,EAAO,GACT,IAAQ,EAAM,MAAU,EACxB,GAAQ,EACJ,EAAO,GACT,IAAQ,EAAM,MAAU,EACxB,GAAQ,IAGZ,GAAQ,EAAS,IAAK,GAAM,EAExB,EAAO,EAAM,CACf,EAAK,IAAM,gCACX,EAAM,KAAO,GACb,OACD,CAMD,GAJA,KAAU,EACV,GAAQ,EAER,EAAK,EAAO,EACR,EAAO,EAAI,CAEb,GADA,EAAK,EAAO,EACR,EAAK,GACH,EAAM,KAAM,CACd,EAAK,IAAM,gCACX,EAAM,KAAO,GACb,OACD,CA0BH,GAFA,EAAO,EACP,EAAc,EACV,IAAU,GAEZ,GADA,GAAQ,EAAQ,EACZ,EAAK,EAAK,CACZ,GAAO,EACP,EACE,GAAO,KAAU,EAAS,WACnB,EAAE,GACX,EAAO,EAAO,EACd,EAAc,CACf,UAEM,EAAQ,GAGf,GAFA,GAAQ,EAAQ,EAAQ,EACxB,GAAM,EACF,EAAK,EAAK,CACZ,GAAO,EACP,EACE,GAAO,KAAU,EAAS,WACnB,EAAE,GAEX,GADA,EAAO,EACH,EAAQ,EAAK,CACf,EAAK,EACL,GAAO,EACP,EACE,GAAO,KAAU,EAAS,WACnB,EAAE,GACX,EAAO,EAAO,EACd,EAAc,CACf,CACF,UAGD,GAAQ,EAAQ,EACZ,EAAK,EAAK,CACZ,GAAO,EACP,EACE,GAAO,KAAU,EAAS,WACnB,EAAE,GACX,EAAO,EAAO,EACd,EAAc,CACf,CAEH,KAAO,EAAM,GACX,EAAO,KAAU,EAAY,KAC7B,EAAO,KAAU,EAAY,KAC7B,EAAO,KAAU,EAAY,KAC7B,GAAO,EAET,AAAI,GACF,GAAO,KAAU,EAAY,KACzB,EAAM,GACR,GAAO,KAAU,EAAY,MAGlC,KACI,CACH,EAAO,EAAO,EACd,EACE,GAAO,KAAU,EAAO,KACxB,EAAO,KAAU,EAAO,KACxB,EAAO,KAAU,EAAO,KACxB,GAAO,QACA,EAAM,GACf,AAAI,GACF,GAAO,KAAU,EAAO,KACpB,EAAM,GACR,GAAO,KAAU,EAAO,MAG7B,CACF,SACS,GAAK,MAAQ,EAAG,CACxB,EAAO,EAAO,GAAO,OAAuB,GAAS,IAAK,GAAM,IAChE,UACD,KACI,CACH,EAAK,IAAM,wBACX,EAAM,KAAO,GACb,OACD,CAED,KACD,CACF,SACS,GAAK,MAAQ,EAAG,CACxB,EAAO,EAAO,GAAO,OAAuB,GAAS,IAAK,GAAM,IAChE,UACD,SACQ,EAAK,GAAI,CAEhB,EAAM,KAAO,GACb,OACD,KACI,CACH,EAAK,IAAM,8BACX,EAAM,KAAO,GACb,OACD,CAED,KACD,CACF,OAAQ,EAAM,GAAQ,EAAO,GAG9B,EAAM,GAAQ,EACd,GAAO,EACP,GAAQ,GAAO,EACf,GAAS,IAAK,GAAQ,EAGtB,EAAK,QAAU,EACf,EAAK,SAAW,EAChB,EAAK,SAAY,EAAM,EAAO,EAAK,GAAO,GAAO,EAAK,GAAM,GAC5D,EAAK,UAAa,EAAO,EAAM,IAAO,GAAM,GAAQ,IAAO,GAAO,GAClE,EAAM,KAAO,EACb,EAAM,KAAO,CAEf,EAqBA,KAAM,IAAU,GACV,GAAgB,IAChB,GAAiB,IAGjB,GAAU,EACV,GAAS,EACT,GAAU,EAEV,GAAQ,GAAI,aAAY,CAC5B,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GACrD,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,EAAG,CAC/D,CAAC,EAEK,GAAO,GAAI,YAAW,CAC1B,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAC5D,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,EAC1D,CAAC,EAEK,GAAQ,GAAI,aAAY,CAC5B,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,IAAK,IACtD,IAAK,IAAK,IAAK,IAAK,KAAM,KAAM,KAAM,KAAM,KAAM,KAClD,KAAM,MAAO,MAAO,MAAO,EAAG,CAChC,CAAC,EAEK,GAAO,GAAI,YAAW,CAC1B,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAC5D,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GACpC,GAAI,GAAI,GAAI,GAAI,GAAI,EACtB,CAAC,EAEK,GAAgB,CAAC,EAAM,EAAM,EAAY,EAAO,EAAO,EAAa,EAAM,IAChF,CACE,KAAM,GAAO,EAAK,KAGlB,GAAI,GAAM,EACN,EAAM,EACN,EAAM,EAAG,EAAM,EACf,EAAO,EACP,EAAO,EACP,EAAO,EACP,EAAO,EACP,EAAO,EACP,EAAO,EACP,EACA,EACA,EACA,EACA,EACA,EAAO,KACP,EAAa,EAEb,EACJ,KAAM,GAAQ,GAAI,aAAY,GAAU,CAAC,EACnC,EAAO,GAAI,aAAY,GAAU,CAAC,EACxC,GAAI,GAAQ,KACR,EAAc,EAEd,EAAW,EAAS,EAkCxB,IAAK,EAAM,EAAG,GAAO,GAAS,IAC5B,EAAM,GAAO,EAEf,IAAK,EAAM,EAAG,EAAM,EAAO,IACzB,EAAM,EAAK,EAAa,MAK1B,IADA,EAAO,EACF,EAAM,GAAS,GAAO,GACrB,EAAM,KAAS,EADS,IAC5B,CAKF,GAHI,EAAO,GACT,GAAO,GAEL,IAAQ,EAIV,SAAM,KAAkB,GAAK,GAAO,IAAM,GAAM,EAMhD,EAAM,KAAkB,GAAK,GAAO,IAAM,GAAM,EAEhD,EAAK,KAAO,EACL,EAET,IAAK,EAAM,EAAG,EAAM,GACd,EAAM,KAAS,EADI,IACvB,CAQF,IANI,EAAO,GACT,GAAO,GAIT,EAAO,EACF,EAAM,EAAG,GAAO,GAAS,IAG5B,GAFA,IAAS,EACT,GAAQ,EAAM,GACV,EAAO,EACT,MAAO,GAGX,GAAI,EAAO,GAAM,KAAS,IAAW,IAAQ,GAC3C,MAAO,GAKT,IADA,EAAK,GAAK,EACL,EAAM,EAAG,EAAM,GAAS,IAC3B,EAAK,EAAM,GAAK,EAAK,GAAO,EAAM,GAIpC,IAAK,EAAM,EAAG,EAAM,EAAO,IACzB,AAAI,EAAK,EAAa,KAAS,GAC7B,GAAK,EAAK,EAAK,EAAa,OAAW,GAmE3C,GA7BA,AAAI,IAAS,GACX,GAAO,EAAQ,EACf,EAAM,IAED,AAAI,IAAS,GAClB,GAAO,GACP,GAAc,IACd,EAAQ,GACR,GAAe,IACf,EAAM,KAGN,GAAO,GACP,EAAQ,GACR,EAAM,IAIR,EAAO,EACP,EAAM,EACN,EAAM,EACN,EAAO,EACP,EAAO,EACP,EAAO,EACP,EAAM,GACN,EAAO,GAAK,EACZ,EAAO,EAAO,EAGT,IAAS,IAAU,EAAO,IAC5B,IAAS,IAAW,EAAO,GAC5B,MAAO,GAIT,OAAS,CAEP,EAAY,EAAM,EAClB,AAAI,EAAK,GAAO,EACd,GAAU,EACV,EAAW,EAAK,IAEb,AAAI,EAAK,GAAO,EACnB,GAAU,EAAM,EAAc,EAAK,IACnC,EAAW,EAAK,EAAa,EAAK,KAGlC,GAAU,GAAK,GACf,EAAW,GAIb,EAAO,GAAM,EAAM,EACnB,EAAO,GAAK,EACZ,EAAM,EACN,EACE,IAAQ,EACR,EAAM,EAAQ,IAAQ,GAAQ,GAAS,GAAa,GAAO,GAAW,GAAM,EAAU,QAC/E,IAAS,GAIlB,IADA,EAAO,GAAM,EAAM,EACZ,EAAO,GACZ,IAAS,EAWX,GATA,AAAI,IAAS,EACX,IAAQ,EAAO,EACf,GAAQ,GAER,EAAO,EAIT,IACI,EAAE,EAAM,KAAS,EAAG,CACtB,GAAI,IAAQ,EAAO,MACnB,EAAM,EAAK,EAAa,EAAK,GAC9B,CAGD,GAAI,EAAM,GAAS,GAAO,KAAU,EAAK,CAYvC,IAVI,IAAS,GACX,GAAO,GAIT,GAAQ,EAGR,EAAO,EAAM,EACb,EAAO,GAAK,EACL,EAAO,EAAO,GACnB,IAAQ,EAAM,EAAO,GACjB,KAAQ,KACZ,IACA,IAAS,EAKX,GADA,GAAQ,GAAK,EACR,IAAS,IAAU,EAAO,IAC5B,IAAS,IAAW,EAAO,GAC5B,MAAO,GAIT,EAAM,EAAO,EAIb,EAAM,GAAQ,GAAQ,GAAO,GAAQ,GAAO,EAAO,EAAc,CAClE,CACF,CAKD,MAAI,KAAS,GAIX,GAAM,EAAO,GAAU,EAAM,GAAS,GAAO,IAAM,GAAK,GAK1D,EAAK,KAAO,EACL,CACT,EAGA,GAAI,IAAW,GA0Bf,KAAM,IAAQ,EACR,GAAO,EACP,GAAQ,EAKR,CACJ,SAAU,GAAY,WAAS,WAC/B,KAAM,GAAQ,aAAc,GAAgB,YAAa,GAAe,eAAgB,GAAkB,aAAc,GAAgB,YAAa,GAAe,eACpK,eACE,GAOK,GAAO,EACP,GAAQ,EACR,GAAO,EACP,GAAK,EACL,GAAQ,EACR,GAAQ,EACR,GAAO,EACP,GAAU,EACV,GAAO,EACP,GAAS,GACT,GAAO,GACH,GAAO,GACP,GAAS,GACT,GAAS,GACT,GAAQ,GACR,GAAO,GACP,GAAQ,GACR,GAAU,GACV,GAAW,GACP,GAAO,GACP,GAAM,GACN,GAAS,GACT,GAAO,GACP,GAAU,GACV,GAAQ,GACR,GAAM,GACd,GAAQ,GACR,GAAS,GACT,GAAO,GACP,EAAM,GACN,GAAM,GACN,GAAO,GAMV,GAAc,IACd,GAAe,IAGf,GAAY,GAEZ,GAAY,GAGZ,GAAU,AAAC,GAEJ,KAAM,GAAM,KACb,KAAM,EAAK,OACX,IAAI,QAAW,GACf,IAAI,MAAS,IAIzB,aAAwB,CACtB,KAAK,KAAO,EACZ,KAAK,KAAO,GACZ,KAAK,KAAO,EACZ,KAAK,SAAW,GAChB,KAAK,MAAQ,EACb,KAAK,KAAO,EACZ,KAAK,MAAQ,EACb,KAAK,MAAQ,EAEb,KAAK,KAAO,KAGZ,KAAK,MAAQ,EACb,KAAK,MAAQ,EACb,KAAK,MAAQ,EACb,KAAK,MAAQ,EACb,KAAK,OAAS,KAGd,KAAK,KAAO,EACZ,KAAK,KAAO,EAGZ,KAAK,OAAS,EACd,KAAK,OAAS,EAGd,KAAK,MAAQ,EAGb,KAAK,QAAU,KACf,KAAK,SAAW,KAChB,KAAK,QAAU,EACf,KAAK,SAAW,EAGhB,KAAK,MAAQ,EACb,KAAK,KAAO,EACZ,KAAK,MAAQ,EACb,KAAK,KAAO,EACZ,KAAK,KAAO,KAEZ,KAAK,KAAO,GAAI,aAAY,GAAG,EAC/B,KAAK,KAAO,GAAI,aAAY,GAAG,EAO/B,KAAK,OAAS,KACd,KAAK,QAAU,KACf,KAAK,KAAO,EACZ,KAAK,KAAO,EACZ,KAAK,IAAM,CACb,CAGA,KAAM,IAAmB,AAAC,GAAS,CAEjC,GAAI,CAAC,GAAQ,CAAC,EAAK,MAAS,MAAO,IACnC,KAAM,GAAQ,EAAK,MACnB,SAAK,SAAW,EAAK,UAAY,EAAM,MAAQ,EAC/C,EAAK,IAAM,GACP,EAAM,MACR,GAAK,MAAQ,EAAM,KAAO,GAE5B,EAAM,KAAO,GACb,EAAM,KAAO,EACb,EAAM,SAAW,EACjB,EAAM,KAAO,MACb,EAAM,KAAO,KACb,EAAM,KAAO,EACb,EAAM,KAAO,EAEb,EAAM,QAAU,EAAM,OAAS,GAAI,YAAW,EAAW,EACzD,EAAM,SAAW,EAAM,QAAU,GAAI,YAAW,EAAY,EAE5D,EAAM,KAAO,EACb,EAAM,KAAO,GAEN,EACT,EAGM,GAAe,AAAC,GAAS,CAE7B,GAAI,CAAC,GAAQ,CAAC,EAAK,MAAS,MAAO,IACnC,KAAM,GAAQ,EAAK,MACnB,SAAM,MAAQ,EACd,EAAM,MAAQ,EACd,EAAM,MAAQ,EACP,GAAiB,CAAI,CAE9B,EAGM,GAAgB,CAAC,EAAM,IAAe,CAC1C,GAAI,GAGJ,GAAI,CAAC,GAAQ,CAAC,EAAK,MAAS,MAAO,IACnC,KAAM,GAAQ,EAAK,MAenB,MAZA,AAAI,GAAa,EACf,GAAO,EACP,EAAa,CAAC,GAGd,GAAQ,IAAc,GAAK,EACvB,EAAa,IACf,IAAc,KAKd,GAAe,GAAa,GAAK,EAAa,IACzC,GAEL,GAAM,SAAW,MAAQ,EAAM,QAAU,GAC3C,GAAM,OAAS,MAIjB,EAAM,KAAO,EACb,EAAM,MAAQ,EACP,GAAa,CAAI,EAC1B,EAGM,GAAe,CAAC,EAAM,IAAe,CAEzC,GAAI,CAAC,EAAQ,MAAO,IAGpB,KAAM,GAAQ,GAAI,IAIlB,EAAK,MAAQ,EACb,EAAM,OAAS,KACf,KAAM,GAAM,GAAc,EAAM,CAAU,EAC1C,MAAI,KAAQ,IACV,GAAK,MAAQ,MAER,CACT,EAGM,GAAc,AAAC,GAEZ,GAAa,EAAM,EAAS,EAcrC,GAAI,IAAS,GAET,GAAQ,GAGZ,KAAM,IAAc,AAAC,GAAU,CAG7B,GAAI,GAAQ,CACV,GAAS,GAAI,YAAW,GAAG,EAC3B,GAAU,GAAI,YAAW,EAAE,EAG3B,GAAI,GAAM,EACV,KAAO,EAAM,KAAO,EAAM,KAAK,KAAS,EACxC,KAAO,EAAM,KAAO,EAAM,KAAK,KAAS,EACxC,KAAO,EAAM,KAAO,EAAM,KAAK,KAAS,EACxC,KAAO,EAAM,KAAO,EAAM,KAAK,KAAS,EAMxC,IAJA,GAAS,GAAO,EAAM,KAAM,EAAG,IAAK,GAAU,EAAG,EAAM,KAAM,CAAE,KAAM,CAAG,CAAA,EAGxE,EAAM,EACC,EAAM,IAAM,EAAM,KAAK,KAAS,EAEvC,GAAS,GAAO,EAAM,KAAM,EAAG,GAAM,GAAS,EAAG,EAAM,KAAM,CAAE,KAAM,CAAG,CAAA,EAGxE,GAAS,EACV,CAED,EAAM,QAAU,GAChB,EAAM,QAAU,EAChB,EAAM,SAAW,GACjB,EAAM,SAAW,CACnB,EAiBM,GAAe,CAAC,EAAM,EAAK,EAAK,IAAS,CAE7C,GAAI,GACJ,KAAM,GAAQ,EAAK,MAGnB,MAAI,GAAM,SAAW,MACnB,GAAM,MAAQ,GAAK,EAAM,MACzB,EAAM,MAAQ,EACd,EAAM,MAAQ,EAEd,EAAM,OAAS,GAAI,YAAW,EAAM,KAAK,GAI3C,AAAI,GAAQ,EAAM,MAChB,GAAM,OAAO,IAAI,EAAI,SAAS,EAAM,EAAM,MAAO,CAAG,EAAG,CAAC,EACxD,EAAM,MAAQ,EACd,EAAM,MAAQ,EAAM,OAGpB,GAAO,EAAM,MAAQ,EAAM,MACvB,EAAO,GACT,GAAO,GAGT,EAAM,OAAO,IAAI,EAAI,SAAS,EAAM,EAAM,EAAM,EAAO,CAAI,EAAG,EAAM,KAAK,EACzE,GAAQ,EACR,AAAI,EAEF,GAAM,OAAO,IAAI,EAAI,SAAS,EAAM,EAAM,CAAG,EAAG,CAAC,EACjD,EAAM,MAAQ,EACd,EAAM,MAAQ,EAAM,OAGpB,GAAM,OAAS,EACX,EAAM,QAAU,EAAM,OAAS,GAAM,MAAQ,GAC7C,EAAM,MAAQ,EAAM,OAAS,GAAM,OAAS,KAG7C,CACT,EAGM,GAAY,CAAC,EAAM,IAAU,CAEjC,GAAI,GACA,EAAO,EACP,EACA,EACA,EAAM,EACN,EACA,EACA,EAAK,EACL,EACA,EACA,EACA,EAAO,EACP,EAAW,EAAS,EAEpB,EAAW,EAAS,EACpB,EACA,EACJ,KAAM,GAAO,GAAI,YAAW,CAAC,EAC7B,GAAI,GAEA,EAEJ,KAAM,GACJ,GAAI,YAAW,CAAE,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,EAAE,CAAE,EAGrF,GAAI,CAAC,GAAQ,CAAC,EAAK,OAAS,CAAC,EAAK,QAC7B,CAAC,EAAK,OAAS,EAAK,WAAa,EACpC,MAAO,IAGT,EAAQ,EAAK,MACT,EAAM,OAAS,IAAQ,GAAM,KAAO,IAIxC,EAAM,EAAK,SACX,EAAS,EAAK,OACd,EAAO,EAAK,UACZ,EAAO,EAAK,QACZ,EAAQ,EAAK,MACb,EAAO,EAAK,SACZ,EAAO,EAAM,KACb,EAAO,EAAM,KAGb,EAAM,EACN,EAAO,EACP,EAAM,GAEN,EACA,OACE,OAAQ,EAAM,UACP,IACH,GAAI,EAAM,OAAS,EAAG,CACpB,EAAM,KAAO,GACb,KACD,CAED,KAAO,EAAO,IAAI,CAChB,GAAI,IAAS,EAAK,QAClB,IACA,GAAQ,EAAM,MAAW,EACzB,GAAQ,CACT,CAED,GAAK,EAAM,KAAO,GAAM,IAAS,MAAQ,CACvC,EAAM,MAAQ,EAEd,EAAK,GAAK,EAAO,IACjB,EAAK,GAAM,IAAS,EAAK,IACzB,EAAM,MAAQ,EAAQ,EAAM,MAAO,EAAM,EAAG,CAAC,EAI7C,EAAO,EACP,EAAO,EAEP,EAAM,KAAO,GACb,KACD,CAKD,GAJA,EAAM,MAAQ,EACV,EAAM,MACR,GAAM,KAAK,KAAO,IAEhB,CAAE,GAAM,KAAO,IACd,KAAO,MAAoB,GAAM,IAAQ,IAAM,GAAI,CACtD,EAAK,IAAM,yBACX,EAAM,KAAO,EACb,KACD,CACD,GAAK,GAAO,MAAqB,GAAY,CAC3C,EAAK,IAAM,6BACX,EAAM,KAAO,EACb,KACD,CAMD,GAJA,KAAU,EACV,GAAQ,EAER,EAAO,GAAO,IAAmB,EAC7B,EAAM,QAAU,EAClB,EAAM,MAAQ,UAEP,EAAM,EAAM,MAAO,CAC1B,EAAK,IAAM,sBACX,EAAM,KAAO,EACb,KACD,CAID,EAAM,KAAO,GAAK,EAAM,MAIxB,EAAK,MAAQ,EAAM,MAAQ,EAC3B,EAAM,KAAO,EAAO,IAAQ,GAAS,GAErC,EAAO,EACP,EAAO,EAEP,UACG,IAEH,KAAO,EAAO,IAAI,CAChB,GAAI,IAAS,EAAK,QAClB,IACA,GAAQ,EAAM,MAAW,EACzB,GAAQ,CACT,CAGD,GADA,EAAM,MAAQ,EACT,GAAM,MAAQ,OAAU,GAAY,CACvC,EAAK,IAAM,6BACX,EAAM,KAAO,EACb,KACD,CACD,GAAI,EAAM,MAAQ,MAAQ,CACxB,EAAK,IAAM,2BACX,EAAM,KAAO,EACb,KACD,CACD,AAAI,EAAM,MACR,GAAM,KAAK,KAAS,GAAQ,EAAK,GAE/B,EAAM,MAAQ,KAEhB,GAAK,GAAK,EAAO,IACjB,EAAK,GAAM,IAAS,EAAK,IACzB,EAAM,MAAQ,EAAQ,EAAM,MAAO,EAAM,EAAG,CAAC,GAI/C,EAAO,EACP,EAAO,EAEP,EAAM,KAAO,OAEV,IAEH,KAAO,EAAO,IAAI,CAChB,GAAI,IAAS,EAAK,QAClB,IACA,GAAQ,EAAM,MAAW,EACzB,GAAQ,CACT,CAED,AAAI,EAAM,MACR,GAAM,KAAK,KAAO,GAEhB,EAAM,MAAQ,KAEhB,GAAK,GAAK,EAAO,IACjB,EAAK,GAAM,IAAS,EAAK,IACzB,EAAK,GAAM,IAAS,GAAM,IAC1B,EAAK,GAAM,IAAS,GAAM,IAC1B,EAAM,MAAQ,EAAQ,EAAM,MAAO,EAAM,EAAG,CAAC,GAI/C,EAAO,EACP,EAAO,EAEP,EAAM,KAAO,OAEV,IAEH,KAAO,EAAO,IAAI,CAChB,GAAI,IAAS,EAAK,QAClB,IACA,GAAQ,EAAM,MAAW,EACzB,GAAQ,CACT,CAED,AAAI,EAAM,MACR,GAAM,KAAK,OAAU,EAAO,IAC5B,EAAM,KAAK,GAAM,GAAQ,GAEvB,EAAM,MAAQ,KAEhB,GAAK,GAAK,EAAO,IACjB,EAAK,GAAM,IAAS,EAAK,IACzB,EAAM,MAAQ,EAAQ,EAAM,MAAO,EAAM,EAAG,CAAC,GAI/C,EAAO,EACP,EAAO,EAEP,EAAM,KAAO,OAEV,IACH,GAAI,EAAM,MAAQ,KAAQ,CAExB,KAAO,EAAO,IAAI,CAChB,GAAI,IAAS,EAAK,QAClB,IACA,GAAQ,EAAM,MAAW,EACzB,GAAQ,CACT,CAED,EAAM,OAAS,EACX,EAAM,MACR,GAAM,KAAK,UAAY,GAErB,EAAM,MAAQ,KAEhB,GAAK,GAAK,EAAO,IACjB,EAAK,GAAM,IAAS,EAAK,IACzB,EAAM,MAAQ,EAAQ,EAAM,MAAO,EAAM,EAAG,CAAC,GAI/C,EAAO,EACP,EAAO,CAER,KACI,AAAI,GAAM,MACb,GAAM,KAAK,MAAQ,MAErB,EAAM,KAAO,OAEV,IACH,GAAI,EAAM,MAAQ,MAChB,GAAO,EAAM,OACT,EAAO,GAAQ,GAAO,GACtB,GACE,GAAM,MACR,GAAM,EAAM,KAAK,UAAY,EAAM,OAC9B,EAAM,KAAK,OAEd,GAAM,KAAK,MAAQ,GAAI,YAAW,EAAM,KAAK,SAAS,GAExD,EAAM,KAAK,MAAM,IACf,EAAM,SACJ,EAGA,EAAO,CACR,EAED,CAChB,GAKgB,EAAM,MAAQ,KAChB,GAAM,MAAQ,EAAQ,EAAM,MAAO,EAAO,EAAM,CAAI,GAEtD,GAAQ,EACR,GAAQ,EACR,EAAM,QAAU,GAEd,EAAM,QAAU,QAEtB,EAAM,OAAS,EACf,EAAM,KAAO,OAEV,IACH,GAAI,EAAM,MAAQ,KAAQ,CACxB,GAAI,IAAS,EAAK,QAClB,EAAO,EACP,EAEE,GAAM,EAAM,EAAO,KAEf,EAAM,MAAQ,GACb,EAAM,OAAS,OAClB,GAAM,KAAK,MAAQ,OAAO,aAAa,CAAG,SAErC,GAAO,EAAO,GAOvB,GALI,EAAM,MAAQ,KAChB,GAAM,MAAQ,EAAQ,EAAM,MAAO,EAAO,EAAM,CAAI,GAEtD,GAAQ,EACR,GAAQ,EACJ,EAAO,OACZ,KACI,AAAI,GAAM,MACb,GAAM,KAAK,KAAO,MAEpB,EAAM,OAAS,EACf,EAAM,KAAO,OAEV,IACH,GAAI,EAAM,MAAQ,KAAQ,CACxB,GAAI,IAAS,EAAK,QAClB,EAAO,EACP,EACE,GAAM,EAAM,EAAO,KAEf,EAAM,MAAQ,GACb,EAAM,OAAS,OAClB,GAAM,KAAK,SAAW,OAAO,aAAa,CAAG,SAExC,GAAO,EAAO,GAMvB,GALI,EAAM,MAAQ,KAChB,GAAM,MAAQ,EAAQ,EAAM,MAAO,EAAO,EAAM,CAAI,GAEtD,GAAQ,EACR,GAAQ,EACJ,EAAO,OACZ,KACI,AAAI,GAAM,MACb,GAAM,KAAK,QAAU,MAEvB,EAAM,KAAO,OAEV,IACH,GAAI,EAAM,MAAQ,IAAQ,CAExB,KAAO,EAAO,IAAI,CAChB,GAAI,IAAS,EAAK,QAClB,IACA,GAAQ,EAAM,MAAW,EACzB,GAAQ,CACT,CAED,GAAI,IAAU,GAAM,MAAQ,OAAS,CACnC,EAAK,IAAM,sBACX,EAAM,KAAO,EACb,KACD,CAED,EAAO,EACP,EAAO,CAER,CACD,AAAI,EAAM,MACR,GAAM,KAAK,KAAS,EAAM,OAAS,EAAK,EACxC,EAAM,KAAK,KAAO,IAEpB,EAAK,MAAQ,EAAM,MAAQ,EAC3B,EAAM,KAAO,GACb,UACG,IAEH,KAAO,EAAO,IAAI,CAChB,GAAI,IAAS,EAAK,QAClB,IACA,GAAQ,EAAM,MAAW,EACzB,GAAQ,CACT,CAED,EAAK,MAAQ,EAAM,MAAQ,GAAQ,CAAI,EAEvC,EAAO,EACP,EAAO,EAEP,EAAM,KAAO,OAEV,IACH,GAAI,EAAM,WAAa,EAErB,SAAK,SAAW,EAChB,EAAK,UAAY,EACjB,EAAK,QAAU,EACf,EAAK,SAAW,EAChB,EAAM,KAAO,EACb,EAAM,KAAO,EAEN,GAET,EAAK,MAAQ,EAAM,MAAQ,EAC3B,EAAM,KAAO,OAEV,IACH,GAAI,IAAU,IAAW,IAAU,GAAW,YAE3C,IACH,GAAI,EAAM,KAAM,CAEd,KAAU,EAAO,EACjB,GAAQ,EAAO,EAEf,EAAM,KAAO,GACb,KACD,CAED,KAAO,EAAO,GAAG,CACf,GAAI,IAAS,EAAK,QAClB,IACA,GAAQ,EAAM,MAAW,EACzB,GAAQ,CACT,CAQD,OANA,EAAM,KAAQ,EAAO,EAErB,KAAU,EACV,GAAQ,EAGC,EAAO,OACT,GAGH,EAAM,KAAO,GACb,UACG,GAKH,GAJA,GAAY,CAAK,EAGjB,EAAM,KAAO,GACT,IAAU,GAAS,CAErB,KAAU,EACV,GAAQ,EAER,OACD,CACD,UACG,GAGH,EAAM,KAAO,GACb,UACG,GACH,EAAK,IAAM,qBACX,EAAM,KAAO,EAGjB,KAAU,EACV,GAAQ,EAER,UACG,IAMH,IAJA,KAAU,EAAO,EACjB,GAAQ,EAAO,EAGR,EAAO,IAAI,CAChB,GAAI,IAAS,EAAK,QAClB,IACA,GAAQ,EAAM,MAAW,EACzB,GAAQ,CACT,CAED,GAAK,GAAO,SAAc,KAAS,GAAM,OAAS,CAChD,EAAK,IAAM,+BACX,EAAM,KAAO,EACb,KACD,CASD,GARA,EAAM,OAAS,EAAO,MAItB,EAAO,EACP,EAAO,EAEP,EAAM,KAAO,GACT,IAAU,GAAW,YAEtB,IACH,EAAM,KAAO,OAEV,IAEH,GADA,EAAO,EAAM,OACT,EAAM,CAGR,GAFI,EAAO,GAAQ,GAAO,GACtB,EAAO,GAAQ,GAAO,GACtB,IAAS,EAAK,QAElB,EAAO,IAAI,EAAM,SAAS,EAAM,EAAO,CAAI,EAAG,CAAG,EAEjD,GAAQ,EACR,GAAQ,EACR,GAAQ,EACR,GAAO,EACP,EAAM,QAAU,EAChB,KACD,CAED,EAAM,KAAO,GACb,UACG,IAEH,KAAO,EAAO,IAAI,CAChB,GAAI,IAAS,EAAK,QAClB,IACA,GAAQ,EAAM,MAAW,EACzB,GAAQ,CACT,CAkBD,GAhBA,EAAM,KAAQ,GAAO,IAAmB,IAExC,KAAU,EACV,GAAQ,EAER,EAAM,MAAS,GAAO,IAAmB,EAEzC,KAAU,EACV,GAAQ,EAER,EAAM,MAAS,GAAO,IAAmB,EAEzC,KAAU,EACV,GAAQ,EAGJ,EAAM,KAAO,KAAO,EAAM,MAAQ,GAAI,CACxC,EAAK,IAAM,sCACX,EAAM,KAAO,EACb,KACD,CAGD,EAAM,KAAO,EACb,EAAM,KAAO,OAEV,IACH,KAAO,EAAM,KAAO,EAAM,OAAO,CAE/B,KAAO,EAAO,GAAG,CACf,GAAI,IAAS,EAAK,QAClB,IACA,GAAQ,EAAM,MAAW,EACzB,GAAQ,CACT,CAED,EAAM,KAAK,EAAM,EAAM,SAAY,EAAO,EAE1C,KAAU,EACV,GAAQ,CAET,CACD,KAAO,EAAM,KAAO,IAClB,EAAM,KAAK,EAAM,EAAM,SAAW,EAapC,GAPA,EAAM,QAAU,EAAM,OACtB,EAAM,QAAU,EAEhB,EAAO,CAAE,KAAM,EAAM,OAAO,EAC5B,EAAM,GAAS,GAAO,EAAM,KAAM,EAAG,GAAI,EAAM,QAAS,EAAG,EAAM,KAAM,CAAI,EAC3E,EAAM,QAAU,EAAK,KAEjB,EAAK,CACP,EAAK,IAAM,2BACX,EAAM,KAAO,EACb,KACD,CAED,EAAM,KAAO,EACb,EAAM,KAAO,OAEV,IACH,KAAO,EAAM,KAAO,EAAM,KAAO,EAAM,OAAO,CAC5C,KACE,EAAO,EAAM,QAAQ,EAAS,IAAK,EAAM,SAAW,GACpD,EAAY,IAAS,GACrB,EAAW,IAAS,GAAM,IAC1B,EAAW,EAAO,MAEb,KAAc,IANZ,CAQP,GAAI,IAAS,EAAK,QAClB,IACA,GAAQ,EAAM,MAAW,EACzB,GAAQ,CAET,CACD,GAAI,EAAW,GAEb,KAAU,EACV,GAAQ,EAER,EAAM,KAAK,EAAM,QAAU,MAExB,CACH,GAAI,IAAa,GAAI,CAGnB,IADA,EAAI,EAAY,EACT,EAAO,GAAG,CACf,GAAI,IAAS,EAAK,QAClB,IACA,GAAQ,EAAM,MAAW,EACzB,GAAQ,CACT,CAMD,GAHA,KAAU,EACV,GAAQ,EAEJ,EAAM,OAAS,EAAG,CACpB,EAAK,IAAM,4BACX,EAAM,KAAO,EACb,KACD,CACD,EAAM,EAAM,KAAK,EAAM,KAAO,GAC9B,EAAO,EAAK,GAAO,GAEnB,KAAU,EACV,GAAQ,CAET,SACQ,IAAa,GAAI,CAGxB,IADA,EAAI,EAAY,EACT,EAAO,GAAG,CACf,GAAI,IAAS,EAAK,QAClB,IACA,GAAQ,EAAM,MAAW,EACzB,GAAQ,CACT,CAGD,KAAU,EACV,GAAQ,EAER,EAAM,EACN,EAAO,EAAK,GAAO,GAEnB,KAAU,EACV,GAAQ,CAET,KACI,CAGH,IADA,EAAI,EAAY,EACT,EAAO,GAAG,CACf,GAAI,IAAS,EAAK,QAClB,IACA,GAAQ,EAAM,MAAW,EACzB,GAAQ,CACT,CAGD,KAAU,EACV,GAAQ,EAER,EAAM,EACN,EAAO,GAAM,GAAO,KAEpB,KAAU,EACV,GAAQ,CAET,CACD,GAAI,EAAM,KAAO,EAAO,EAAM,KAAO,EAAM,MAAO,CAChD,EAAK,IAAM,4BACX,EAAM,KAAO,EACb,KACD,CACD,KAAO,KACL,EAAM,KAAK,EAAM,QAAU,CAE9B,CACF,CAGD,GAAI,EAAM,OAAS,EAAO,MAG1B,GAAI,EAAM,KAAK,OAAS,EAAG,CACzB,EAAK,IAAM,uCACX,EAAM,KAAO,EACb,KACD,CAcD,GATA,EAAM,QAAU,EAEhB,EAAO,CAAE,KAAM,EAAM,OAAO,EAC5B,EAAM,GAAS,GAAM,EAAM,KAAM,EAAG,EAAM,KAAM,EAAM,QAAS,EAAG,EAAM,KAAM,CAAI,EAGlF,EAAM,QAAU,EAAK,KAGjB,EAAK,CACP,EAAK,IAAM,8BACX,EAAM,KAAO,EACb,KACD,CAaD,GAXA,EAAM,SAAW,EAGjB,EAAM,SAAW,EAAM,QACvB,EAAO,CAAE,KAAM,EAAM,QAAQ,EAC7B,EAAM,GAAS,GAAO,EAAM,KAAM,EAAM,KAAM,EAAM,MAAO,EAAM,SAAU,EAAG,EAAM,KAAM,CAAI,EAG9F,EAAM,SAAW,EAAK,KAGlB,EAAK,CACP,EAAK,IAAM,wBACX,EAAM,KAAO,EACb,KACD,CAGD,GADA,EAAM,KAAO,GACT,IAAU,GAAW,YAEtB,IACH,EAAM,KAAO,OAEV,IACH,GAAI,GAAQ,GAAK,GAAQ,IAAK,CAE5B,EAAK,SAAW,EAChB,EAAK,UAAY,EACjB,EAAK,QAAU,EACf,EAAK,SAAW,EAChB,EAAM,KAAO,EACb,EAAM,KAAO,EAEb,GAAQ,EAAM,CAAI,EAElB,EAAM,EAAK,SACX,EAAS,EAAK,OACd,EAAO,EAAK,UACZ,EAAO,EAAK,QACZ,EAAQ,EAAK,MACb,EAAO,EAAK,SACZ,EAAO,EAAM,KACb,EAAO,EAAM,KAGT,EAAM,OAAS,IACjB,GAAM,KAAO,IAEf,KACD,CAED,IADA,EAAM,KAAO,EAEX,EAAO,EAAM,QAAQ,EAAS,IAAK,EAAM,SAAW,GACpD,EAAY,IAAS,GACrB,EAAW,IAAS,GAAM,IAC1B,EAAW,EAAO,MAEd,KAAa,IANV,CAQP,GAAI,IAAS,EAAK,QAClB,IACA,GAAQ,EAAM,MAAW,EACzB,GAAQ,CAET,CACD,GAAI,GAAY,GAAU,OAAU,EAAG,CAIrC,IAHA,EAAY,EACZ,EAAU,EACV,EAAW,EAET,EAAO,EAAM,QAAQ,EACX,IAAS,IAAM,EAAY,GAAY,IAAoC,IACrF,EAAY,IAAS,GACrB,EAAW,IAAS,GAAM,IAC1B,EAAW,EAAO,MAEb,IAAY,GAAc,IAPxB,CASP,GAAI,IAAS,EAAK,QAClB,IACA,GAAQ,EAAM,MAAW,EACzB,GAAQ,CAET,CAED,KAAU,EACV,GAAQ,EAER,EAAM,MAAQ,CACf,CAOD,GALA,KAAU,EACV,GAAQ,EAER,EAAM,MAAQ,EACd,EAAM,OAAS,EACX,IAAY,EAAG,CAIjB,EAAM,KAAO,GACb,KACD,CACD,GAAI,EAAU,GAAI,CAEhB,EAAM,KAAO,GACb,EAAM,KAAO,GACb,KACD,CACD,GAAI,EAAU,GAAI,CAChB,EAAK,IAAM,8BACX,EAAM,KAAO,EACb,KACD,CACD,EAAM,MAAQ,EAAU,GACxB,EAAM,KAAO,OAEV,IACH,GAAI,EAAM,MAAO,CAGf,IADA,EAAI,EAAM,MACH,EAAO,GAAG,CACf,GAAI,IAAS,EAAK,QAClB,IACA,GAAQ,EAAM,MAAW,EACzB,GAAQ,CACT,CAED,EAAM,QAAU,EAAS,IAAK,EAAM,OAAS,EAE7C,KAAU,EAAM,MAChB,GAAQ,EAAM,MAEd,EAAM,MAAQ,EAAM,KACrB,CAED,EAAM,IAAM,EAAM,OAClB,EAAM,KAAO,OAEV,IACH,KACE,EAAO,EAAM,SAAS,EAAS,IAAK,EAAM,UAAY,GACtD,EAAY,IAAS,GACrB,EAAW,IAAS,GAAM,IAC1B,EAAW,EAAO,MAEb,KAAc,IANZ,CAQP,GAAI,IAAS,EAAK,QAClB,IACA,GAAQ,EAAM,MAAW,EACzB,GAAQ,CAET,CACD,GAAK,GAAU,OAAU,EAAG,CAI1B,IAHA,EAAY,EACZ,EAAU,EACV,EAAW,EAET,EAAO,EAAM,SAAS,EACZ,IAAS,IAAM,EAAY,GAAY,IAAoC,IACrF,EAAY,IAAS,GACrB,EAAW,IAAS,GAAM,IAC1B,EAAW,EAAO,MAEb,IAAY,GAAc,IAPxB,CASP,GAAI,IAAS,EAAK,QAClB,IACA,GAAQ,EAAM,MAAW,EACzB,GAAQ,CAET,CAED,KAAU,EACV,GAAQ,EAER,EAAM,MAAQ,CACf,CAMD,GAJA,KAAU,EACV,GAAQ,EAER,EAAM,MAAQ,EACV,EAAU,GAAI,CAChB,EAAK,IAAM,wBACX,EAAM,KAAO,EACb,KACD,CACD,EAAM,OAAS,EACf,EAAM,MAAS,EAAW,GAC1B,EAAM,KAAO,OAEV,IACH,GAAI,EAAM,MAAO,CAGf,IADA,EAAI,EAAM,MACH,EAAO,GAAG,CACf,GAAI,IAAS,EAAK,QAClB,IACA,GAAQ,EAAM,MAAW,EACzB,GAAQ,CACT,CAED,EAAM,QAAU,EAAS,IAAK,EAAM,OAAS,EAE7C,KAAU,EAAM,MAChB,GAAQ,EAAM,MAEd,EAAM,MAAQ,EAAM,KACrB,CAED,GAAI,EAAM,OAAS,EAAM,KAAM,CAC7B,EAAK,IAAM,gCACX,EAAM,KAAO,EACb,KACD,CAGD,EAAM,KAAO,OAEV,IACH,GAAI,IAAS,EAAK,QAElB,GADA,EAAO,EAAO,EACV,EAAM,OAAS,EAAM,CAEvB,GADA,EAAO,EAAM,OAAS,EAClB,EAAO,EAAM,OACX,EAAM,KAAM,CACd,EAAK,IAAM,gCACX,EAAM,KAAO,EACb,KACD,CAiBH,AAAI,EAAO,EAAM,MACf,IAAQ,EAAM,MACd,EAAO,EAAM,MAAQ,GAGrB,EAAO,EAAM,MAAQ,EAEnB,EAAO,EAAM,QAAU,GAAO,EAAM,QACxC,EAAc,EAAM,MACrB,KAEC,GAAc,EACd,EAAO,EAAM,EAAM,OACnB,EAAO,EAAM,OAEf,AAAI,EAAO,GAAQ,GAAO,GAC1B,GAAQ,EACR,EAAM,QAAU,EAChB,EACE,GAAO,KAAS,EAAY,WACrB,EAAE,GACX,AAAI,EAAM,SAAW,GAAK,GAAM,KAAO,IACvC,UACG,IACH,GAAI,IAAS,EAAK,QAClB,EAAO,KAAS,EAAM,OACtB,IACA,EAAM,KAAO,GACb,UACG,IACH,GAAI,EAAM,KAAM,CAEd,KAAO,EAAO,IAAI,CAChB,GAAI,IAAS,EAAK,QAClB,IAEA,GAAQ,EAAM,MAAW,EACzB,GAAQ,CACT,CAaD,GAXA,GAAQ,EACR,EAAK,WAAa,EAClB,EAAM,OAAS,EACX,GACF,GAAK,MAAQ,EAAM,MAEd,EAAM,MAAQ,EAAQ,EAAM,MAAO,EAAQ,EAAM,EAAM,CAAI,EAAI,GAAU,EAAM,MAAO,EAAQ,EAAM,EAAM,CAAI,GAGrH,EAAO,EAEF,GAAM,MAAQ,EAAO,GAAQ,CAAI,KAAO,EAAM,MAAO,CACxD,EAAK,IAAM,uBACX,EAAM,KAAO,EACb,KACD,CAED,EAAO,EACP,EAAO,CAGR,CACD,EAAM,KAAO,OAEV,IACH,GAAI,EAAM,MAAQ,EAAM,MAAO,CAE7B,KAAO,EAAO,IAAI,CAChB,GAAI,IAAS,EAAK,QAClB,IACA,GAAQ,EAAM,MAAW,EACzB,GAAQ,CACT,CAED,GAAI,IAAU,GAAM,MAAQ,YAAa,CACvC,EAAK,IAAM,yBACX,EAAM,KAAO,EACb,KACD,CAED,EAAO,EACP,EAAO,CAGR,CACD,EAAM,KAAO,OAEV,IACH,EAAM,GACN,YACG,GACH,EAAM,GACN,YACG,IACH,MAAO,QACJ,YAGH,MAAO,IAcb,SAAK,SAAW,EAChB,EAAK,UAAY,EACjB,EAAK,QAAU,EACf,EAAK,SAAW,EAChB,EAAM,KAAO,EACb,EAAM,KAAO,EAGT,GAAM,OAAU,IAAS,EAAK,WAAa,EAAM,KAAO,GACvC,GAAM,KAAO,IAAS,IAAU,MAC/C,GAAa,EAAM,EAAK,OAAQ,EAAK,SAAU,EAAO,EAAK,SAAS,EAE1E,GAAO,EAAK,SACZ,GAAQ,EAAK,UACb,EAAK,UAAY,EACjB,EAAK,WAAa,EAClB,EAAM,OAAS,EACX,EAAM,MAAQ,GAChB,GAAK,MAAQ,EAAM,MAChB,EAAM,MAAQ,EAAQ,EAAM,MAAO,EAAQ,EAAM,EAAK,SAAW,CAAI,EAAI,GAAU,EAAM,MAAO,EAAQ,EAAM,EAAK,SAAW,CAAI,GAEvI,EAAK,UAAY,EAAM,KAAQ,GAAM,KAAO,GAAK,GAC9B,GAAM,OAAS,GAAO,IAAM,GAC5B,GAAM,OAAS,IAAQ,EAAM,OAAS,GAAQ,IAAM,GACjE,KAAQ,GAAK,IAAS,GAAM,IAAU,KAAe,IAAQ,IACjE,GAAM,IAED,CACT,EAGM,GAAa,AAAC,GAAS,CAE3B,GAAI,CAAC,GAAQ,CAAC,EAAK,MACjB,MAAO,IAGT,GAAI,GAAQ,EAAK,MACjB,MAAI,GAAM,QACR,GAAM,OAAS,MAEjB,EAAK,MAAQ,KACN,EACT,EAGM,GAAmB,CAAC,EAAM,IAAS,CAGvC,GAAI,CAAC,GAAQ,CAAC,EAAK,MAAS,MAAO,IACnC,KAAM,GAAQ,EAAK,MACnB,MAAK,GAAM,KAAO,KAAO,EAAY,GAGrC,GAAM,KAAO,EACb,EAAK,KAAO,GACL,GACT,EAGM,GAAuB,CAAC,EAAM,IAAe,CACjD,KAAM,GAAa,EAAW,OAE9B,GAAI,GACA,EACA,EAMJ,MAHI,CAAC,GAAwB,CAAC,EAAK,OACnC,GAAQ,EAAK,MAET,EAAM,OAAS,GAAK,EAAM,OAAS,IAC9B,GAIL,EAAM,OAAS,IACjB,GAAS,EAET,EAAS,GAAU,EAAQ,EAAY,EAAY,CAAC,EAChD,IAAW,EAAM,OACZ,GAKX,GAAM,GAAa,EAAM,EAAY,EAAY,CAAU,EACvD,EACF,GAAM,KAAO,GACN,IAET,GAAM,SAAW,EAEV,IACT,EAGA,GAAI,IAAiB,GACjB,GAAkB,GAClB,GAAqB,GACrB,GAAgB,GAChB,GAAiB,GACjB,GAAc,GACd,GAAe,GACf,GAAqB,GACrB,GAAyB,GACzB,GAAc,qCAYd,GAAc,CACjB,aAAc,GACd,cAAe,GACf,iBAAkB,GAClB,YAAa,GACb,aAAc,GACd,QAAS,GACT,WAAY,GACZ,iBAAkB,GAClB,qBAAsB,GACtB,YAAa,EACd,EAqBA,aAAoB,CAElB,KAAK,KAAa,EAElB,KAAK,KAAa,EAElB,KAAK,OAAa,EAElB,KAAK,GAAa,EAElB,KAAK,MAAa,KAElB,KAAK,UAAa,EAWlB,KAAK,KAAa,GAIlB,KAAK,QAAa,GAIlB,KAAK,KAAa,EAElB,KAAK,KAAa,EACpB,CAEA,GAAI,IAAW,GAEf,KAAM,IAAW,OAAO,UAAU,SAK5B,CACJ,cAAY,YACZ,QAAM,gBAAc,eAAa,kBAAgB,gBAAc,gBAC7D,GAkFJ,YAAmB,EAAS,CAC1B,KAAK,QAAU,GAAO,OAAO,CAC3B,UAAW,KAAO,GAClB,WAAY,GACZ,GAAI,EACR,EAAK,GAAW,CAAA,CAAE,EAEhB,KAAM,GAAM,KAAK,QAIjB,AAAI,EAAI,KAAQ,EAAI,YAAc,GAAO,EAAI,WAAa,IACxD,GAAI,WAAa,CAAC,EAAI,WAClB,EAAI,aAAe,GAAK,GAAI,WAAa,MAI1C,EAAI,YAAc,GAAO,EAAI,WAAa,IAC3C,CAAE,IAAW,EAAQ,aACvB,GAAI,YAAc,IAKf,EAAI,WAAa,IAAQ,EAAI,WAAa,IAGxC,GAAI,WAAa,MAAQ,GAC5B,GAAI,YAAc,IAItB,KAAK,IAAS,EACd,KAAK,IAAS,GACd,KAAK,MAAS,GACd,KAAK,OAAS,GAEd,KAAK,KAAS,GAAI,IAClB,KAAK,KAAK,UAAY,EAEtB,GAAI,GAAU,GAAY,aACxB,KAAK,KACL,EAAI,UACR,EAEE,GAAI,IAAW,GACb,KAAM,IAAI,OAAM,GAAS,EAAO,EAQlC,GALA,KAAK,OAAS,GAAI,IAElB,GAAY,iBAAiB,KAAK,KAAM,KAAK,MAAM,EAG/C,EAAI,YAEN,CAAI,MAAO,GAAI,YAAe,SAC5B,EAAI,WAAa,GAAQ,WAAW,EAAI,UAAU,EACzC,GAAS,KAAK,EAAI,UAAU,IAAM,wBAC3C,GAAI,WAAa,GAAI,YAAW,EAAI,UAAU,GAE5C,EAAI,KACN,GAAS,GAAY,qBAAqB,KAAK,KAAM,EAAI,UAAU,EAC/D,IAAW,KACb,KAAM,IAAI,OAAM,GAAS,EAAO,CAIxC,CA2BA,GAAU,UAAU,KAAO,SAAU,EAAM,EAAY,CACrD,KAAM,GAAO,KAAK,KACZ,EAAY,KAAK,QAAQ,UACzB,EAAa,KAAK,QAAQ,WAChC,GAAI,GAAQ,EAAa,EAEzB,GAAI,KAAK,MAAO,MAAO,GAevB,IAbA,AAAI,IAAe,CAAC,CAAC,EAAY,EAAc,EAC1C,EAAc,IAAe,GAAO,GAAW,GAGpD,AAAI,GAAS,KAAK,CAAI,IAAM,uBAC1B,EAAK,MAAQ,GAAI,YAAW,CAAI,EAEhC,EAAK,MAAQ,EAGf,EAAK,QAAU,EACf,EAAK,SAAW,EAAK,MAAM,SAElB,CAqBP,IApBI,EAAK,YAAc,GACrB,GAAK,OAAS,GAAI,YAAW,CAAS,EACtC,EAAK,SAAW,EAChB,EAAK,UAAY,GAGnB,EAAS,GAAY,QAAQ,EAAM,CAAW,EAE1C,IAAW,IAAe,GAC5B,GAAS,GAAY,qBAAqB,EAAM,CAAU,EAE1D,AAAI,IAAW,GACb,EAAS,GAAY,QAAQ,EAAM,CAAW,EACrC,IAAW,IAEpB,GAAS,KAKN,EAAK,SAAW,GAChB,IAAW,IACX,EAAK,MAAM,KAAO,GAClB,EAAK,EAAK,WAAa,GAE5B,GAAY,aAAa,CAAI,EAC7B,EAAS,GAAY,QAAQ,EAAM,CAAW,EAGhD,OAAQ,OACD,QACA,QACA,QACA,IACH,YAAK,MAAM,CAAM,EACjB,KAAK,MAAQ,GACN,GAOX,GAFA,EAAiB,EAAK,UAElB,EAAK,UACH,GAAK,YAAc,GAAK,IAAW,IAErC,GAAI,KAAK,QAAQ,KAAO,SAAU,CAEhC,GAAI,GAAgB,GAAQ,WAAW,EAAK,OAAQ,EAAK,QAAQ,EAE7D,EAAO,EAAK,SAAW,EACvB,EAAU,GAAQ,WAAW,EAAK,OAAQ,CAAa,EAG3D,EAAK,SAAW,EAChB,EAAK,UAAY,EAAY,EACzB,GAAM,EAAK,OAAO,IAAI,EAAK,OAAO,SAAS,EAAe,EAAgB,CAAI,EAAG,CAAC,EAEtF,KAAK,OAAO,CAAO,CAE7B,KACU,MAAK,OAAO,EAAK,OAAO,SAAW,EAAK,SAAW,EAAK,OAAS,EAAK,OAAO,SAAS,EAAG,EAAK,QAAQ,CAAC,EAM7G,GAAI,MAAW,IAAQ,IAAmB,GAG1C,IAAI,IAAW,GACb,SAAS,GAAY,WAAW,KAAK,IAAI,EACzC,KAAK,MAAM,CAAM,EACjB,KAAK,MAAQ,GACN,GAGT,GAAI,EAAK,WAAa,EAAG,MAC1B,CAED,MAAO,EACT,EAWA,GAAU,UAAU,OAAS,SAAU,EAAO,CAC5C,KAAK,OAAO,KAAK,CAAK,CACxB,EAYA,GAAU,UAAU,MAAQ,SAAU,EAAQ,CAE5C,AAAI,IAAW,IACb,CAAI,KAAK,QAAQ,KAAO,SACtB,KAAK,OAAS,KAAK,OAAO,KAAK,EAAE,EAEjC,KAAK,OAAS,GAAO,cAAc,KAAK,MAAM,GAGlD,KAAK,OAAS,GACd,KAAK,IAAM,EACX,KAAK,IAAM,KAAK,KAAK,GACvB,EA0CA,YAAmB,EAAO,EAAS,CACjC,KAAM,GAAW,GAAI,IAAU,CAAO,EAKtC,GAHA,EAAS,KAAK,CAAK,EAGf,EAAS,IAAK,KAAM,GAAS,KAAO,GAAS,EAAS,KAE1D,MAAO,GAAS,MAClB,CAWA,YAAsB,EAAO,EAAS,CACpC,SAAU,GAAW,GACrB,EAAQ,IAAM,GACP,GAAU,EAAO,CAAO,CACjC,CAaA,GAAI,IAAc,GACd,GAAY,GACZ,GAAiB,GACjB,GAAW,GACX,GAAY,GAEZ,GAAc,CACjB,QAAS,GACT,QAAS,GACT,WAAY,GACZ,OAAQ,GACR,UAAW,EACZ,EAEA,KAAM,CAAE,WAAS,WAAS,cAAY,SAAS,GAEzC,CAAE,WAAS,WAAS,cAAY,WAAW,GAIjD,GAAI,IAAY,GACZ,GAAY,GACZ,GAAe,GACf,GAAS,GACT,GAAY,GACZ,GAAY,GACZ,GAAe,GACf,GAAW,GACX,GAAc,GAEd,GAAO,CACV,QAAS,GACT,QAAS,GACT,WAAY,GACZ,KAAM,GACN,QAAS,GACT,QAAS,GACT,WAAY,GACZ,OAAQ,GACR,UAAW,EACZ,EC5iNW,GAAU,KACV,GAAa,MAAO,eAAiB,YAAc,aAAe,MAWzE,GAAS,KAAK,GAAK,IAOhB,YAAkB,EAAG,CAC1B,MAAO,GAAI,EACb,CAcA,AAAK,KAAK,OAAO,MAAK,MAAQ,UAAY,CAIxC,OAHI,GAAI,EACJ,EAAI,UAAU,OAEX,KACL,GAAK,UAAU,GAAK,UAAU,GAGhC,MAAO,MAAK,KAAK,CAAC,CACpB,GCrCO,aAAkB,CACvB,GAAI,GAAM,GAAIA,IAAoB,EAAE,EAEpC,MAAIA,KAAuB,cACzB,GAAI,GAAK,EACT,EAAI,GAAK,EACT,EAAI,GAAK,EACT,EAAI,GAAK,EACT,EAAI,GAAK,EACT,EAAI,GAAK,EACT,EAAI,GAAK,EACT,EAAI,GAAK,EACT,EAAI,IAAM,EACV,EAAI,IAAM,EACV,EAAI,IAAM,EACV,EAAI,IAAM,GAGZ,EAAI,GAAK,EACT,EAAI,GAAK,EACT,EAAI,IAAM,EACV,EAAI,IAAM,EACH,CACT,CAoCO,YAAc,EAAK,EAAG,CAC3B,SAAI,GAAK,EAAE,GACX,EAAI,GAAK,EAAE,GACX,EAAI,GAAK,EAAE,GACX,EAAI,GAAK,EAAE,GACX,EAAI,GAAK,EAAE,GACX,EAAI,GAAK,EAAE,GACX,EAAI,GAAK,EAAE,GACX,EAAI,GAAK,EAAE,GACX,EAAI,GAAK,EAAE,GACX,EAAI,GAAK,EAAE,GACX,EAAI,IAAM,EAAE,IACZ,EAAI,IAAM,EAAE,IACZ,EAAI,IAAM,EAAE,IACZ,EAAI,IAAM,EAAE,IACZ,EAAI,IAAM,EAAE,IACZ,EAAI,IAAM,EAAE,IACL,CACT,CA4FO,YAAkB,EAAK,CAC5B,SAAI,GAAK,EACT,EAAI,GAAK,EACT,EAAI,GAAK,EACT,EAAI,GAAK,EACT,EAAI,GAAK,EACT,EAAI,GAAK,EACT,EAAI,GAAK,EACT,EAAI,GAAK,EACT,EAAI,GAAK,EACT,EAAI,GAAK,EACT,EAAI,IAAM,EACV,EAAI,IAAM,EACV,EAAI,IAAM,EACV,EAAI,IAAM,EACV,EAAI,IAAM,EACV,EAAI,IAAM,EACH,CACT,CA0QO,YAAmB,EAAK,EAAG,EAAG,CACnC,GAAI,GAAI,EAAE,GACN,EAAI,EAAE,GACN,EAAI,EAAE,GACN,EAAK,EAAK,EAAK,EACf,EAAK,EAAK,EAAK,EACf,EAAK,EAAK,EAAK,EAEnB,MAAI,KAAM,EACR,GAAI,IAAM,EAAE,GAAK,EAAI,EAAE,GAAK,EAAI,EAAE,GAAK,EAAI,EAAE,IAC7C,EAAI,IAAM,EAAE,GAAK,EAAI,EAAE,GAAK,EAAI,EAAE,GAAK,EAAI,EAAE,IAC7C,EAAI,IAAM,EAAE,GAAK,EAAI,EAAE,GAAK,EAAI,EAAE,IAAM,EAAI,EAAE,IAC9C,EAAI,IAAM,EAAE,GAAK,EAAI,EAAE,GAAK,EAAI,EAAE,IAAM,EAAI,EAAE,KAE9C,GAAM,EAAE,GACR,EAAM,EAAE,GACR,EAAM,EAAE,GACR,EAAM,EAAE,GACR,EAAM,EAAE,GACR,EAAM,EAAE,GACR,EAAM,EAAE,GACR,EAAM,EAAE,GACR,EAAM,EAAE,GACR,EAAM,EAAE,GACR,EAAM,EAAE,IACR,EAAM,EAAE,IACR,EAAI,GAAK,EACT,EAAI,GAAK,EACT,EAAI,GAAK,EACT,EAAI,GAAK,EACT,EAAI,GAAK,EACT,EAAI,GAAK,EACT,EAAI,GAAK,EACT,EAAI,GAAK,EACT,EAAI,GAAK,EACT,EAAI,GAAK,EACT,EAAI,IAAM,EACV,EAAI,IAAM,EACV,EAAI,IAAM,EAAM,EAAI,EAAM,EAAI,EAAM,EAAI,EAAE,IAC1C,EAAI,IAAM,EAAM,EAAI,EAAM,EAAI,EAAM,EAAI,EAAE,IAC1C,EAAI,IAAM,EAAM,EAAI,EAAM,EAAI,EAAM,EAAI,EAAE,IAC1C,EAAI,IAAM,EAAM,EAAI,EAAM,EAAI,EAAM,EAAI,EAAE,KAGrC,CACT,CAUO,YAAe,EAAK,EAAG,EAAG,CAC/B,GAAI,GAAI,EAAE,GACN,EAAI,EAAE,GACN,EAAI,EAAE,GACV,SAAI,GAAK,EAAE,GAAK,EAChB,EAAI,GAAK,EAAE,GAAK,EAChB,EAAI,GAAK,EAAE,GAAK,EAChB,EAAI,GAAK,EAAE,GAAK,EAChB,EAAI,GAAK,EAAE,GAAK,EAChB,EAAI,GAAK,EAAE,GAAK,EAChB,EAAI,GAAK,EAAE,GAAK,EAChB,EAAI,GAAK,EAAE,GAAK,EAChB,EAAI,GAAK,EAAE,GAAK,EAChB,EAAI,GAAK,EAAE,GAAK,EAChB,EAAI,IAAM,EAAE,IAAM,EAClB,EAAI,IAAM,EAAE,IAAM,EAClB,EAAI,IAAM,EAAE,IACZ,EAAI,IAAM,EAAE,IACZ,EAAI,IAAM,EAAE,IACZ,EAAI,IAAM,EAAE,IACL,CACT,CAWO,YAAgB,EAAK,EAAG,EAAK,EAAM,CACxC,GAAI,GAAI,EAAK,GACT,EAAI,EAAK,GACT,EAAI,EAAK,GACT,EAAM,KAAK,MAAM,EAAG,EAAG,CAAC,EACxB,EAAG,EAAG,EACN,EAAK,EAAK,EAAK,EACf,EAAK,EAAK,EAAK,EACf,EAAK,EAAK,EAAK,EACf,EAAK,EAAK,EACV,EAAK,EAAK,EACV,EAAK,EAAK,EAEd,MAAI,GAAMC,GACD,KAGT,GAAM,EAAI,EACV,GAAK,EACL,GAAK,EACL,GAAK,EACL,EAAI,KAAK,IAAI,CAAG,EAChB,EAAI,KAAK,IAAI,CAAG,EAChB,EAAI,EAAI,EACR,EAAM,EAAE,GACR,EAAM,EAAE,GACR,EAAM,EAAE,GACR,EAAM,EAAE,GACR,EAAM,EAAE,GACR,EAAM,EAAE,GACR,EAAM,EAAE,GACR,EAAM,EAAE,GACR,EAAM,EAAE,GACR,EAAM,EAAE,GACR,EAAM,EAAE,IACR,EAAM,EAAE,IAER,EAAM,EAAI,EAAI,EAAI,EAClB,EAAM,EAAI,EAAI,EAAI,EAAI,EACtB,EAAM,EAAI,EAAI,EAAI,EAAI,EACtB,EAAM,EAAI,EAAI,EAAI,EAAI,EACtB,EAAM,EAAI,EAAI,EAAI,EAClB,EAAM,EAAI,EAAI,EAAI,EAAI,EACtB,EAAM,EAAI,EAAI,EAAI,EAAI,EACtB,EAAM,EAAI,EAAI,EAAI,EAAI,EACtB,EAAM,EAAI,EAAI,EAAI,EAElB,EAAI,GAAK,EAAM,EAAM,EAAM,EAAM,EAAM,EACvC,EAAI,GAAK,EAAM,EAAM,EAAM,EAAM,EAAM,EACvC,EAAI,GAAK,EAAM,EAAM,EAAM,EAAM,EAAM,EACvC,EAAI,GAAK,EAAM,EAAM,EAAM,EAAM,EAAM,EACvC,EAAI,GAAK,EAAM,EAAM,EAAM,EAAM,EAAM,EACvC,EAAI,GAAK,EAAM,EAAM,EAAM,EAAM,EAAM,EACvC,EAAI,GAAK,EAAM,EAAM,EAAM,EAAM,EAAM,EACvC,EAAI,GAAK,EAAM,EAAM,EAAM,EAAM,EAAM,EACvC,EAAI,GAAK,EAAM,EAAM,EAAM,EAAM,EAAM,EACvC,EAAI,GAAK,EAAM,EAAM,EAAM,EAAM,EAAM,EACvC,EAAI,IAAM,EAAM,EAAM,EAAM,EAAM,EAAM,EACxC,EAAI,IAAM,EAAM,EAAM,EAAM,EAAM,EAAM,EAEpC,IAAM,GAER,GAAI,IAAM,EAAE,IACZ,EAAI,IAAM,EAAE,IACZ,EAAI,IAAM,EAAE,IACZ,EAAI,IAAM,EAAE,KAGP,EACT,CAUO,YAAiB,EAAK,EAAG,EAAK,CACnC,GAAI,GAAI,KAAK,IAAI,CAAG,EAChB,EAAI,KAAK,IAAI,CAAG,EAChB,EAAM,EAAE,GACR,EAAM,EAAE,GACR,EAAM,EAAE,GACR,EAAM,EAAE,GACR,EAAM,EAAE,GACR,EAAM,EAAE,GACR,EAAM,EAAE,IACR,EAAM,EAAE,IAEZ,MAAI,KAAM,GAER,GAAI,GAAK,EAAE,GACX,EAAI,GAAK,EAAE,GACX,EAAI,GAAK,EAAE,GACX,EAAI,GAAK,EAAE,GACX,EAAI,IAAM,EAAE,IACZ,EAAI,IAAM,EAAE,IACZ,EAAI,IAAM,EAAE,IACZ,EAAI,IAAM,EAAE,KAId,EAAI,GAAK,EAAM,EAAI,EAAM,EACzB,EAAI,GAAK,EAAM,EAAI,EAAM,EACzB,EAAI,GAAK,EAAM,EAAI,EAAM,EACzB,EAAI,GAAK,EAAM,EAAI,EAAM,EACzB,EAAI,GAAK,EAAM,EAAI,EAAM,EACzB,EAAI,GAAK,EAAM,EAAI,EAAM,EACzB,EAAI,IAAM,EAAM,EAAI,EAAM,EAC1B,EAAI,IAAM,EAAM,EAAI,EAAM,EACnB,CACT,CAUO,YAAiB,EAAK,EAAG,EAAK,CACnC,GAAI,GAAI,KAAK,IAAI,CAAG,EAChB,EAAI,KAAK,IAAI,CAAG,EAChB,EAAM,EAAE,GACR,EAAM,EAAE,GACR,EAAM,EAAE,GACR,EAAM,EAAE,GACR,EAAM,EAAE,GACR,EAAM,EAAE,GACR,EAAM,EAAE,IACR,EAAM,EAAE,IAEZ,MAAI,KAAM,GAER,GAAI,GAAK,EAAE,GACX,EAAI,GAAK,EAAE,GACX,EAAI,GAAK,EAAE,GACX,EAAI,GAAK,EAAE,GACX,EAAI,IAAM,EAAE,IACZ,EAAI,IAAM,EAAE,IACZ,EAAI,IAAM,EAAE,IACZ,EAAI,IAAM,EAAE,KAId,EAAI,GAAK,EAAM,EAAI,EAAM,EACzB,EAAI,GAAK,EAAM,EAAI,EAAM,EACzB,EAAI,GAAK,EAAM,EAAI,EAAM,EACzB,EAAI,GAAK,EAAM,EAAI,EAAM,EACzB,EAAI,GAAK,EAAM,EAAI,EAAM,EACzB,EAAI,GAAK,EAAM,EAAI,EAAM,EACzB,EAAI,IAAM,EAAM,EAAI,EAAM,EAC1B,EAAI,IAAM,EAAM,EAAI,EAAM,EACnB,CACT,CAwpBO,YAAuB,EAAK,EAAM,EAAQ,EAAM,EAAK,CAC1D,GAAI,GAAI,EAAM,KAAK,IAAI,EAAO,CAAC,EAC3B,EACJ,SAAI,GAAK,EAAI,EACb,EAAI,GAAK,EACT,EAAI,GAAK,EACT,EAAI,GAAK,EACT,EAAI,GAAK,EACT,EAAI,GAAK,EACT,EAAI,GAAK,EACT,EAAI,GAAK,EACT,EAAI,GAAK,EACT,EAAI,GAAK,EACT,EAAI,IAAM,GACV,EAAI,IAAM,EACV,EAAI,IAAM,EACV,EAAI,IAAM,EAEV,AAAI,GAAO,MAAQ,IAAQ,IACzB,GAAK,EAAK,GAAO,GACjB,EAAI,IAAO,GAAM,GAAQ,EACzB,EAAI,IAAM,EAAI,EAAM,EAAO,GAE3B,GAAI,IAAM,GACV,EAAI,IAAM,GAAK,GAGV,CACT,CAMO,GAAI,IAAc,GCn3ClB,aAAkB,CACvB,GAAI,GAAM,GAAID,IAAoB,CAAC,EAEnC,MAAIA,KAAuB,cACzB,GAAI,GAAK,EACT,EAAI,GAAK,EACT,EAAI,GAAK,GAGJ,CACT,CAqCO,YAAoB,EAAG,EAAG,EAAG,CAClC,GAAI,GAAM,GAAIA,IAAoB,CAAC,EACnC,SAAI,GAAK,EACT,EAAI,GAAK,EACT,EAAI,GAAK,EACF,CACT,CAuDO,YAAkB,EAAK,EAAG,EAAG,CAClC,SAAI,GAAK,EAAE,GAAK,EAAE,GAClB,EAAI,GAAK,EAAE,GAAK,EAAE,GAClB,EAAI,GAAK,EAAE,GAAK,EAAE,GACX,CACT,CAuLO,YAAgB,EAAK,EAAG,CAC7B,SAAI,GAAK,CAAC,EAAE,GACZ,EAAI,GAAK,CAAC,EAAE,GACZ,EAAI,GAAK,CAAC,EAAE,GACL,CACT,CAuBO,YAAmB,EAAK,EAAG,CAChC,GAAI,GAAI,EAAE,GACN,EAAI,EAAE,GACN,EAAI,EAAE,GACN,EAAM,EAAI,EAAI,EAAI,EAAI,EAAI,EAE9B,MAAI,GAAM,GAER,GAAM,EAAI,KAAK,KAAK,CAAG,GAGzB,EAAI,GAAK,EAAE,GAAK,EAChB,EAAI,GAAK,EAAE,GAAK,EAChB,EAAI,GAAK,EAAE,GAAK,EACT,CACT,CAqBO,YAAe,EAAK,EAAG,EAAG,CAC/B,GAAI,GAAK,EAAE,GACP,EAAK,EAAE,GACP,EAAK,EAAE,GACP,EAAK,EAAE,GACP,EAAK,EAAE,GACP,EAAK,EAAE,GACX,SAAI,GAAK,EAAK,EAAK,EAAK,EACxB,EAAI,GAAK,EAAK,EAAK,EAAK,EACxB,EAAI,GAAK,EAAK,EAAK,EAAK,EACjB,CACT,CAgGO,YAAuB,EAAK,EAAG,EAAG,CACvC,GAAI,GAAI,EAAE,GACN,EAAI,EAAE,GACN,EAAI,EAAE,GACN,EAAI,EAAE,GAAK,EAAI,EAAE,GAAK,EAAI,EAAE,IAAM,EAAI,EAAE,IAC5C,SAAI,GAAK,EACT,EAAI,GAAM,GAAE,GAAK,EAAI,EAAE,GAAK,EAAI,EAAE,GAAK,EAAI,EAAE,KAAO,EACpD,EAAI,GAAM,GAAE,GAAK,EAAI,EAAE,GAAK,EAAI,EAAE,GAAK,EAAI,EAAE,KAAO,EACpD,EAAI,GAAM,GAAE,GAAK,EAAI,EAAE,GAAK,EAAI,EAAE,IAAM,EAAI,EAAE,KAAO,EAC9C,CACT,CA0MO,YAAgB,EAAG,EAAG,CAC3B,GAAI,GAAK,EAAE,GACP,EAAK,EAAE,GACP,EAAK,EAAE,GACP,EAAK,EAAE,GACP,EAAK,EAAE,GACP,EAAK,EAAE,GACX,MAAO,MAAK,IAAI,EAAK,CAAE,GAAKC,GAAmB,KAAK,IAAI,EAAK,KAAK,IAAI,CAAE,EAAG,KAAK,IAAI,CAAE,CAAC,GAAK,KAAK,IAAI,EAAK,CAAE,GAAKA,GAAmB,KAAK,IAAI,EAAK,KAAK,IAAI,CAAE,EAAG,KAAK,IAAI,CAAE,CAAC,GAAK,KAAK,IAAI,EAAK,CAAE,GAAKA,GAAmB,KAAK,IAAI,EAAK,KAAK,IAAI,CAAE,EAAG,KAAK,IAAI,CAAE,CAAC,CACnQ,CAwDqB,WAAY,CAC/B,GAAI,GAAM,KACV,MAAO,UAAU,EAAG,EAAQ,EAAQ,EAAO,EAAI,EAAK,CAClD,GAAI,GAAG,EAgBP,IAdK,GACH,GAAS,GAGN,GACH,GAAS,GAGX,AAAI,EACF,EAAI,KAAK,IAAI,EAAQ,EAAS,EAAQ,EAAE,MAAM,EAE9C,EAAI,EAAE,OAGH,EAAI,EAAQ,EAAI,EAAG,GAAK,EAC3B,EAAI,GAAK,EAAE,GACX,EAAI,GAAK,EAAE,EAAI,GACf,EAAI,GAAK,EAAE,EAAI,GACf,EAAG,EAAK,EAAK,CAAG,EAChB,EAAE,GAAK,EAAI,GACX,EAAE,EAAI,GAAK,EAAI,GACf,EAAE,EAAI,GAAK,EAAI,GAGjB,MAAO,EACX,CACA,GAAC,EClxBkG,GAAC,GAAE,AAAC,UAAS,EAAE,CAAC,EAAE,GAAG,KAAK,EAAE,KAAK,OAAO,EAAE,MAAM,QAAQ,EAAE,KAAK,OAAO,EAAE,MAAM,QAAQ,EAAE,KAAK,MAAM,GAAE,GAAI,GAAE,GAAG,EAAE,KAAM,IAAE,EAAE,EAAE,IAAI,CAAC,EAAE,EAAE,CAAC,GAAG,EAAE,MAAM,CAAC,EAAE,GAAG,CAAC,GAAG,EAAE,OAAO,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,MAAM,CAAC,EAAE,EAAE,CAAC,GAAG,EAAE,OAAO,CAAC,EAAE,EAAE,CAAC,GAAG,EAAE,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,EAAK,GAAC,IAAE,AAAC,UAAS,EAAE,CAAC,EAAE,IAAI,CAAC,EAAE,GAAG,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,IAAI,EAAE,EAAE,OAAO,SAAS,EAAE,CAAC,MAAO,IAAE,EAAE,CAAC,GAAE,GAAI,GAAE,CAAA,EAAG,EAAE,SAAS,EAAE,CAAC,EAAE,OAAO,SAAS,EAAE,EAAE,EAAE,CAAC,MAAM,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,OAAO,SAAS,EAAE,EAAE,EAAE,EAAE,CAAC,MAAM,CAAC,EAAE,GAAG,EAAE,EAAE,GAAG,EAAE,EAAE,GAAG,CAAC,CAAC,EAAE,EAAE,QAAQ,SAAS,EAAE,EAAE,CAAC,MAAO,GAAE,OAAO,EAAE,GAAG,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,IAAE,GAAG,EAAO,KAAC,IAAE,CAAC,IAAI,EAAE,KAAK,EAAE,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,MAAM,EAAE,OAAO,EAAE,UAAU,EAAE,OAAO,EAAE,KAAK,EAAE,SAAS,GAAG,SAAS,GAAG,UAAU,EAAE,EAAE,GAAE,CAAC,MAAM,OAAO,QAAQ,MAAM,OAAO,QAAQ,SAAS,YAAY,SAAS,OAAO,WAAW,WAAW,WAAW,EAAE,MAAM,EAAC,CAAC,YAAY,EAAE,EAAE,GAAG,CAAC,KAAK,KAAK,KAAK,QAAQ,KAAK,KAAK,UAAU,CAAC,EAAE,KAAK,MAAM,KAAK,QAAQ,KAAK,KAAK,WAAW,CAAC,EAAE,KAAK,IAAI,KAAK,QAAQ,KAAK,KAAK,WAAW,CAAC,EAAE,KAAK,MAAM,KAAK,QAAQ,KAAK,KAAK,aAAa,CAAC,EAAE,KAAK,OAAO,KAAK,QAAQ,KAAK,KAAK,aAAa,CAAC,EAAE,KAAK,OAAO,EAAE,KAAK,aAAa,EAAE,KAAK,UAAU,EAAE,KAAK,SAAS,GAAI,UAAS,EAAE,OAAO,EAAE,UAAU,CAAC,CAAC,KAAK,CAAC,MAAO,KAAI,CAAC,QAAQ,EAAE,EAAE,CAAC,KAAM,GAAE,KAAK,SAAS,GAAG,KAAK,OAAO,KAAK,YAAY,EAAE,MAAO,MAAK,QAAQ,EAAE,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,MAAM,KAAK,KAAK,CAAC,CAAC,WAAW,CAAC,KAAM,GAAE,KAAK,IAAK,EAAC,EAAE,CAAA,EAAG,OAAQ,GAAE,EAAE,EAAE,EAAE,IAAI,EAAE,KAAK,KAAK,KAAI,CAAE,EAAE,MAAO,EAAC,CAAC,UAAU,CAAC,KAAM,GAAE,KAAK,MAAM,EAAE,CAAA,EAAG,OAAQ,GAAE,EAAE,EAAE,EAAE,IAAI,EAAE,KAAK,KAAK,IAAG,CAAE,EAAE,MAAO,EAAC,CAAC,WAAW,CAAC,KAAM,GAAE,KAAK,IAAK,EAAC,EAAE,CAAA,EAAG,OAAQ,GAAE,EAAE,EAAE,EAAE,IAAI,EAAE,KAAK,KAAK,KAAI,CAAE,EAAE,MAAO,EAAC,CAAC,QAAQ,CAAC,KAAM,GAAE,KAAK,QAAQ,EAAE,KAAK,UAAU,MAAM,KAAK,OAAO,KAAK,OAAO,CAAC,EAAE,MAAO,MAAK,QAAQ,EAAE,SAAS,EAAE,CAAC,GAAI,GAAE,EAAE,CAAE,EAAC,IAAI,EAAE,EAAE,EAAE,EAAE,OAAO,IAAI,AAAI,KAAI,EAAE,KAAV,EAAc,EAAE,KAAK,IAAI,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,QAAQ,AAAM,KAAI,EAAE,KAAZ,KAAiB,AAAM,KAAI,EAAE,EAAE,KAAd,IAAkB,EAAE,KAAM,IAAG,EAAE,KAAK,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,QAAQ,AAAM,KAAI,EAAE,KAAZ,KAAiB,AAAM,KAAI,EAAE,EAAE,KAAd,KAAmB,AAAM,KAAI,EAAE,EAAE,KAAd,IAAkB,EAAE,KAAM,IAAG,EAAE,KAAK,GAAI,IAAG,EAAE,EAAE,KAAK,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,QAAQ,AAAM,KAAI,EAAE,KAAZ,KAAiB,AAAM,KAAI,EAAE,EAAE,KAAd,KAAmB,AAAM,KAAI,EAAE,EAAE,KAAd,KAAmB,AAAM,KAAI,EAAE,EAAE,KAAd,KAAmB,EAAE,KAAM,GAAE,EAAE,KAAK,GAAI,IAAG,EAAE,EAAE,KAAK,GAAI,IAAG,EAAE,EAAE,KAAK,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,MAAO,QAAO,aAAa,MAAM,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,KAAM,GAAE,GAAE,KAAK,KAAM,GAAE,EAAE,KAAK,MAAM,EAAE,CAAA,EAAG,OAAQ,GAAE,EAAE,EAAE,EAAE,IAAI,EAAE,KAAK,KAAK,GAAE,CAAE,EAAE,MAAM,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC,CAAC,UAAU,CAAC,KAAM,GAAE,CAAE,EAAC,OAAO,CAAC,KAAM,GAAE,GAAE,KAAK,KAAM,GAAE,GAAG,AAAQ,IAAR,MAAU,MAAM,KAAM,GAAE,KAAK,OAAM,EAAG,EAAE,KAAK,KAAK,EAAE,GAAG,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC,CAAC,MAAO,EAAC,CAAC,CAAC,MAAM,EAAC,CAAC,YAAY,EAAE,GAAG,CAAC,KAAK,KAAK,KAAK,SAAS,KAAK,KAAK,UAAU,CAAC,EAAE,KAAK,MAAM,KAAK,SAAS,KAAK,KAAK,WAAW,CAAC,EAAE,KAAK,IAAI,KAAK,SAAS,KAAK,KAAK,WAAW,CAAC,EAAE,KAAK,MAAM,KAAK,SAAS,KAAK,KAAK,aAAa,CAAC,EAAE,KAAK,OAAO,KAAK,SAAS,KAAK,KAAK,aAAa,CAAC,EAAE,KAAK,OAAO,EAAE,KAAK,aAAa,EAAE,KAAK,OAAO,GAAI,aAAY,IAAI,EAAE,KAAK,UAAU,GAAI,YAAW,KAAK,MAAM,EAAE,KAAK,SAAS,GAAI,UAAS,KAAK,MAAM,CAAC,CAAC,YAAY,EAAE,CAAC,KAAM,GAAE,KAAK,OAAO,EAAE,GAAG,KAAK,OAAO,YAAY,EAAE,OAAO,GAAI,GAAE,KAAK,OAAO,WAAW,KAAK,EAAE,GAAG,GAAG,EAAE,KAAM,GAAE,GAAI,aAAY,CAAC,EAAE,EAAE,GAAI,YAAW,CAAC,EAAE,EAAE,IAAI,KAAK,SAAS,EAAE,KAAK,OAAO,KAAK,OAAO,YAAY,EAAE,KAAK,EAAE,KAAK,OAAO,WAAW,KAAK,MAAM,EAAE,KAAK,OAAO,EAAE,KAAK,SAAS,GAAI,UAAS,CAAC,EAAE,KAAK,UAAU,CAAC,CAAC,SAAS,CAAC,MAAO,MAAK,YAAY,CAAC,EAAE,KAAK,UAAU,MAAM,EAAE,KAAK,MAAM,CAAC,CAAC,IAAI,EAAE,CAAE,CAAA,SAAS,EAAE,EAAE,EAAE,CAAC,KAAK,YAAY,CAAC,EAAE,KAAK,SAAS,GAAG,KAAK,OAAO,EAAE,KAAK,YAAY,EAAE,KAAK,QAAQ,CAAC,CAAC,KAAK,EAAE,CAAC,KAAK,IAAI,EAAE,EAAE,EAAE,KAAK,IAAI,EAAE,EAAE,CAAC,CAAC,UAAU,EAAE,CAAC,KAAK,IAAI,EAAE,MAAM,EAAE,KAAK,YAAY,EAAE,MAAM,EAAE,KAAK,UAAU,IAAI,EAAE,KAAK,MAAM,EAAE,KAAK,QAAQ,EAAE,MAAM,CAAC,SAAS,EAAE,CAAC,KAAK,IAAI,EAAE,MAAM,EAAE,OAAQ,GAAE,EAAE,EAAE,EAAE,OAAO,IAAI,KAAK,IAAI,EAAE,EAAE,CAAC,CAAC,UAAU,EAAE,CAAC,KAAK,IAAI,EAAE,MAAM,EAAE,OAAQ,GAAE,EAAE,EAAE,EAAE,OAAO,IAAI,KAAK,KAAK,EAAE,EAAE,CAAC,CAAC,OAAO,EAAE,CAAC,KAAM,GAAE,SAAS,EAAE,CAAC,GAAI,GAAE,EAAE,EAAE,CAAE,EAAC,IAAI,EAAE,EAAE,EAAE,EAAE,OAAO,IAAI,AAAC,GAAE,EAAE,WAAW,CAAC,GAAG,IAAI,EAAE,KAAK,CAAC,EAAE,EAAE,KAAM,GAAE,KAAK,IAAI,GAAG,CAAC,EAAE,EAAE,KAAK,IAAI,GAAG,CAAC,GAAG,EAAE,MAAO,GAAE,KAAK,IAAI,GAAG,EAAE,EAAE,EAAE,KAAK,IAAI,GAAG,EAAE,EAAE,EAAE,EAAE,KAAK,IAAI,GAAG,CAAC,GAAI,GAAE,KAAK,IAAI,GAAG,GAAG,CAAC,EAAE,EAAE,KAAK,IAAI,GAAG,GAAG,EAAE,EAAE,EAAE,KAAK,IAAI,GAAG,EAAE,EAAE,EAAE,EAAE,KAAK,IAAI,GAAG,CAAC,GAAG,MAAO,EAAC,EAAE,CAAC,EAAE,KAAK,MAAM,EAAE,MAAM,EAAE,KAAK,YAAY,EAAE,MAAM,EAAE,KAAK,UAAU,IAAI,EAAE,KAAK,MAAM,EAAE,KAAK,QAAQ,EAAE,MAAM,CAAC,KAAK,EAAE,CAAC,KAAK,KAAK,GAAE,EAAE,KAAK,EAAE,KAAK,IAAI,EAAE,MAAM,MAAM,EAAE,EAAE,MAAM,OAAQ,GAAE,EAAE,EAAE,EAAE,MAAM,OAAO,IAAI,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,CAAC,CAAC,SAAS,EAAE,CAAC,SAAU,KAAK,GAAE,KAAK,KAAK,GAAE,EAAE,GAAG,KAAK,EAAE,KAAK,OAAO,CAAC,EAAE,KAAK,EAAE,GAAG,MAAM,EAAE,GAAG,KAAK,EAAE,KAAK,KAAK,GAAE,GAAG,CAAC,CAAC,CAAC,YAAW,EAAE,EAAE,CAAC,KAAM,GAAE,GAAI,IAAE,EAAE,CAAC,EAAE,GAAG,EAAE,KAAI,IAAK,GAAE,SAAS,KAAM,IAAI,OAAM,8BAA8B,EAAE,MAAM,CAAC,KAAK,EAAE,OAAM,EAAG,MAAM,EAAE,UAAU,CAAC,CAAC,YAAW,EAAE,EAAE,CAAC,MAAO,IAAEC,GAAE,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC,YAAW,EAAE,EAAE,CAAC,MAAO,AAAK,GAAE,GAAI,YAAW,EAAE,MAAM,EAAE,CAAC,CAAC,GAAG,SAArC,GAA6C,AAAK,EAAE,KAAP,IAAW,AAAM,EAAE,KAAR,IAAW,CAAC,WAAW,GAAG,OAAO,GAAE,EAAE,CAAC,CAAC,EAAE,CAAC,WAAW,GAAG,OAAO,GAAE,EAAE,CAAC,CAAC,EAAE,GAAI,EAAC,CAAC,YAAW,EAAE,CAAC,KAAM,GAAE,CAAA,EAAG,OAAQ,GAAE,EAAE,EAAE,GAAG,GAAG,EAAE,OAAQ,GAAE,EAAE,EAAE,GAAG,GAAG,EAAE,CAAC,KAAM,GAAE,EAAI,KAAG,GAAG,GAAI,IAAG,IAAI,GAAG,AAAI,EAAE,EAAE,KAAR,EAAW,SAAS,KAAM,GAAG,GAAE,IAAI,IAAK,GAAE,EAAE,IAAI,GAAG,EAAE,EAAE,GAAG,EAAG,GAAE,EAAE,OAAO,IAAK,GAAE,EAAE,OAAO,IAAK,GAAE,EAAE,OAAO,GAAG,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,EAAG,GAAE,IAAI,IAAK,GAAE,EAAE,IAAI,IAAK,GAAE,EAAE,IAAI,GAAG,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,KAAK,CAAC,EAAE,EAAE,EAAE,EAAE,UAAU,EAAE,YAAY,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,MAAO,EAAC,CAAC,YAAW,EAAE,EAAE,EAAE,CAAC,KAAM,GAAE,GAAE,EAAE,EAAE,CAAC,EAAE,OAAO,EAAE,iBAAkB,OAAO,GAAE,EAAE,IAAI,GAAE,EAAE,IAAI,EAAE,UAAW,GAAE,EAAE,IAAI,GAAE,EAAE,IAAI,EAAE,cAAc,KAAM,IAAI,OAAM,4BAA4B,EAAE,aAAa,EAAE,MAAO,EAAC,CAAC,YAAW,EAAE,EAAE,CAAC,KAAM,GAAE,GAAI,IAAE,CAAC,EAAE,MAAO,GAAE,KAAK,GAAE,QAAQ,EAAE,EAAE,OAAO,EAAE,IAAI,EAAE,EAAE,SAAS,EAAE,KAAK,EAAE,EAAE,QAAS,CAAA,CAAC,YAAW,EAAE,EAAE,EAAE,CAAC,KAAM,GAAE,GAAE,EAAE,CAAC,EAAE,MAAOA,IAAE,EAAE,UAAU,QAAQ,CAAC,CAAC,CAAC,YAAW,EAAE,EAAE,EAAE,CAAC,MAAO,GAAE,GAAE,EAAE,CAAC,EAAE,GAAE,EAAE,CAAC,CAAC,CAAC,YAAW,EAAE,CAAC,GAAI,GAAE,EAAE,SAAU,KAAK,GAAE,GAAG,KAAK,KAAK,EAAE,KAAK,OAAO,IAAI,EAAE,KAAM,GAAE,GAAI,YAAW,KAAK,KAAK,CAAC,EAAE,EAAE,GAAI,UAAS,EAAE,MAAM,EAAE,GAAI,GAAE,EAAE,SAAU,KAAK,GAAE,CAAC,KAAM,GAAE,EAAI,KAAG,EAAE,GAAG,GAAI,IAAG,EAAE,IAAI,EAAE,KAAK,KAAK,EAAE,KAAK,OAAO,IAAI,EAAE,EAAE,QAAQ,EAAE,GAAG,EAAE,EAAE,EAAE,SAAS,EAAE,EAAE,MAAM,CAAC,EAAE,EAAE,QAAQ,EAAE,EAAE,CAAC,EAAE,EAAE,SAAS,EAAE,KAAK,EAAE,SAAS,EAAE,KAAM,GAAE,KAAK,EAAE,EAAE,SAAS,EAAE,EAAE,KAAK,OAAO,CAAC,EAAE,EAAE,QAAQ,EAAE,EAAE,EAAE,WAAW,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC,MAAO,EAAC,CAAC,YAAW,EAAE,EAAE,EAAE,EAAE,CAAC,KAAM,GAAE,GAAE,EAAE,EAAE,CAAC,EAAE,OAAO,EAAE,iBAAkB,GAAE,EAAE,KAAK,GAAE,CAAC,EAAE,UAAW,GAAE,EAAE,KAAK,GAAE,EAAE,GAAG,EAAE,EAAE,UAAW,GAAE,EAAE,KAAK,GAAE,CAAC,EAAE,cAAc,KAAM,IAAI,OAAM,4BAA4B,EAAE,aAAa,EAAE,MAAO,EAAC,CAAC,YAAW,EAAE,EAAE,EAAE,CAAC,KAAM,GAAE,EAAE,KAAM,GAAG,EAAE,IAAI,GAAG,EAAE,IAAI,CAAC,EAAG,GAAG,AAAS,IAAT,OAAW,KAAM,IAAI,OAAM,sBAAsB,MAAM,IAAI,EAAE,MAAO,EAAC,CAAC,YAAW,EAAE,EAAE,EAAE,CAAC,GAAG,CAAC,EAAE,GAAG,KAAM,IAAI,OAAM,WAAW,OAAO,EAAE,GAAG,EAAE,GAAG,OAAO,EAAE,KAAM,IAAI,OAAM,YAAY,mBAAmB,gBAAgB,EAAE,GAAG,MAAM,EAAE,MAAO,GAAE,GAAG,KAAK,CAAC,YAAW,EAAE,EAAE,EAAE,EAAE,CAAC,KAAM,GAAE,GAAE,EAAE,EAAE,MAAM,EAAE,GAAG,EAAE,OAAO,EAAE,KAAM,IAAI,OAAM,YAAY,qBAAqB,iBAAiB,EAAE,OAAO,EAAE,GAAG,GAAG,EAAE,MAAM,SAAS,EAAE,KAAM,IAAI,OAAM,YAAY,4BAA4B,uBAAuB,EAAE,MAAM,QAAQ,EAAE,MAAO,GAAE,KAAK,CAAC,YAAW,EAAE,EAAE,CAAC,GAAG,CAAC,MAAO,IAAG,MAAC,CAAS,MAAO,EAAC,CAAC,CAAI,GAAC,GAAE,GAAE,GAAE,GAAE,GAAE,AAAC,UAAS,EAAE,CAAC,WAAW,EAAE,CAAC,MAAM,AAAU,OAAO,IAAjB,UAAoB,AAAO,IAAP,KAAS,EAAE,MAAM,CAAC,EAAE,WAAW,SAAS,EAAE,CAAC,MAAM,AAAU,OAAO,IAAjB,SAAmB,EAAE,MAAM,EAAE,EAAE,QAAQ,SAAS,EAAE,CAAC,MAAM,AAAU,OAAO,IAAjB,SAAmB,KAAK,MAAM,CAAC,EAAE,MAAM,EAAE,EAAE,WAAW,SAAS,EAAE,CAAC,MAAM,AAAU,OAAO,IAAjB,SAAmB,EAAE,MAAM,EAAE,EAAE,YAAY,SAAS,EAAE,CAAC,MAAM,AAAW,OAAO,IAAlB,UAAoB,EAAE,MAAM,EAAE,EAAE,WAAW,EAAE,EAAE,UAAU,SAAS,EAAE,EAAE,CAAC,GAAG,MAAM,QAAQ,CAAC,EAAE,MAAO,GAAE,IAAK,GAAG,EAAE,CAAC,CAAG,CAAA,EAAE,EAAE,QAAQ,SAAS,EAAE,EAAE,CAAC,GAAI,GAAE,KAAM,GAAE,AAAQ,GAAE,EAAE,CAAC,KAAb,MAAiB,AAAS,IAAT,OAAW,EAAE,CAAA,EAAG,MAAO,QAAO,YAAY,OAAO,QAAQ,CAAC,EAAE,IAAK,CAAC,CAAC,EAAE,KAAK,CAAC,EAAE,EAAE,CAAC,CAAC,CAAG,CAAA,CAAC,EAAE,EAAE,QAAQ,SAAS,EAAE,EAAE,EAAE,CAAC,KAAM,GAAE,EAAE,CAAC,EAAE,MAAO,GAAE,EAAE,CAAC,EAAE,MAAM,CAAC,GAAE,GAAI,GAAE,CAAE,EAAC,EAAE,MAAM,CAAC,CAAC,YAAY,EAAE,EAAE,CAAE,EAAC,CAAC,KAAK,KAAK,EAAE,KAAK,WAAW,CAAC,CAAC,SAAS,CAAC,MAAO,MAAK,IAAI,CAAC,eAAe,CAAC,MAAO,MAAK,UAAU,CAAC,YAAY,EAAE,CAAC,MAAO,MAAK,WAAW,EAAE,CAAC,SAAS,CAAC,MAAM,AAAoB,MAAK,OAAzB,mBAA+B,AAAmB,KAAK,OAAxB,gBAA4B,CAAC,OAAO,EAAE,CAAC,MAAO,MAAK,OAAO,EAAE,MAAM,OAAO,KAAK,KAAK,UAAU,EAAE,MAAO,GAAG,EAAE,WAAW,KAAK,KAAK,WAAW,GAAI,CAAC,UAAU,CAAC,MAAO,AAAI,QAAO,KAAK,KAAK,UAAU,EAAE,SAAjC,EAAwC,KAAK,KAAK,GAAG,KAAK,QAAQ,OAAO,QAAQ,KAAK,UAAU,EAAE,IAAK,CAAC,CAAC,EAAE,KAAK,EAAE,IAAI,GAAI,KAAK,GAAG,IAAI,OAAQ,SAAQ,EAAE,CAAC,KAAM,GAAE,GAAE,EAAE,MAAM,OAAO,QAAQ,EAAE,EAAE,GAAG,IAAI,GAAE,EAAE,MAAM,aAAa,UAAU,EAAG,CAAE,CAAA,EAAE,EAAE,OAAO,KAAK,CAAC,EAAE,OAAQ,CAAC,EAAE,IAAI,OAAO,OAAO,OAAO,OAAO,CAAE,EAAC,CAAC,EAAE,EAAE,GAAG,GAAE,EAAE,EAAE,QAAQ,CAAC,CAAC,EAAG,CAAA,CAAE,EAAE,MAAO,IAAI,GAAE,EAAE,CAAC,CAAC,OAAQ,UAAS,EAAE,CAAC,GAAI,GAAE,EAAE,KAAM,GAAE,AAAQ,GAAE,EAAE,WAAW,CAAC,KAAxB,MAA4B,AAAS,IAAT,OAAW,EAAE,CAAE,EAAC,EAAE,AAAQ,GAAE,EAAE,WAAW,EAAE,IAAI,KAA7B,MAAiC,AAAS,IAAT,OAAW,EAAE,kBAAkB,EAAE,EAAE,QAAQ,EAAE,WAAY,GAAG,CAAC,GAAI,GAAE,MAAO,AAAQ,GAAE,EAAE,WAAW,CAAC,KAAxB,MAA4B,AAAS,IAAT,OAAW,EAAE,EAAE,GAAI,MAAO,IAAI,GAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,GAAI,GAAE,eAAe,EAAE,MAAM,EAAC,CAAC,YAAY,EAAE,CAAC,KAAK,KAAK,EAAE,KAAK,QAAQ,MAAM,GAAE,IAAI,EAAE,KAAK,QAAQ,CAAC,EAAE,GAAG,CAAC,IAAK,YAAW,CAAC,MAAO,MAAK,MAAM,CAAC,CAAC,MAAM,EAAE,EAAE,EAAE,CAAC,MAAO,IAAG,GAAI,IAAG,GAAG,CAAC,CAAC,cAAc,EAAE,EAAE,EAAE,CAAC,GAAI,GAAE,KAAM,GAAE,KAAK,QAAQ,KAAK,MAAM,EAAE,EAAE,CAAC,GAAG,MAAO,AAAQ,GAAE,KAAK,QAAQ,MAAvB,MAA4B,AAAS,IAAT,OAAW,EAAE,EAAE,GAAG,CAAC,cAAc,EAAE,EAAE,EAAE,EAAE,CAAC,GAAI,GAAE,KAAK,QAAQ,UAAW,GAAG,EAAE,OAAO,CAAC,CAAC,EAAG,AAAK,IAAL,IAAS,GAAE,KAAK,QAAQ,OAAO,KAAK,QAAQ,KAAK,CAAC,GAAG,KAAK,QAAQ,KAAK,MAAM,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,GAAE,MAAM,GAAG,GAAE,KAAK,GAAE,MAAM,GAAE,MAAM,GAAE,MAAM,MAAM,EAAC,CAAC,YAAY,EAAE,EAAE,EAAE,CAAC,KAAK,KAAK,EAAE,KAAK,OAAO,EAAE,KAAK,IAAI,EAAE,KAAK,SAAS,MAAM,KAAK,aAAa,EAAE,KAAK,IAAI,CAAC,IAAK,OAAM,CAAC,MAAO,MAAK,KAAK,KAAK,MAAM,IAAK,aAAY,CAAC,MAAO,MAAK,MAAM,CAAC,IAAK,aAAY,CAAC,MAAO,GAAG,MAAK,KAAK,GAAG,EAAE,IAAK,gBAAe,CAAC,MAAO,MAAK,WAAW,KAAK,UAAU,CAAC,gBAAgB,EAAE,CAAC,MAAO,IAAG,GAAG,KAAK,UAAU,CAAC,cAAc,EAAE,CAAC,GAAI,GAAE,KAAK,CAAC,EAAE,EAAE,GAAG,EAAE,EAAE,KAAK,SAAS,KAAK,gBAAgB,CAAC,GAAG,MAAO,AAAQ,GAAE,AAAM,GAAN,KAAQ,OAAO,EAAE,cAAc,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,KAAvD,MAA2D,AAAS,IAAT,OAAW,EAAE,EAAE,GAAG,CAAC,cAAc,EAAE,EAAE,CAAC,KAAK,CAAC,EAAE,EAAE,GAAG,EAAE,EAAE,KAAK,gBAAgB,CAAC,EAAE,GAAI,GAAE,KAAK,SAAS,GAAG,GAAG,AAAO,IAAP,KAAS,CAAC,GAAG,EAAE,OAAO,EAAE,GAAG,EAAE,OAAO,EAAE,KAAK,mBAAmB,CAAC,CAAC,CAAC,EAAE,cAAc,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,mBAAmB,EAAE,CAAC,MAAO,AAAM,MAAK,SAAS,IAApB,MAAyB,MAAK,SAAS,GAAG,GAAI,IAAE,KAAK,WAAW,CAAC,GAAG,KAAK,SAAS,EAAE,CAAC,CAAC,AAAC,UAAS,EAAE,CAAC,WAAW,EAAE,EAAE,CAAC,MAAO,QAAO,WAAW,CAAC,EAAE,OAAO,WAAW,CAAC,GAAG,OAAO,EAAE,CAAC,CAAC,EAAE,OAAO,SAAS,EAAE,EAAE,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,aAAa,SAAS,EAAE,CAAC,MAAM,CAAC,EAAE,IAAI,EAAE,EAAE,IAAI,CAAC,CAAC,EAAE,EAAE,SAAS,SAAS,EAAE,CAAC,MAAM,CAAC,WAAW,OAAO,CAAC,EAAE,OAAO,GAAG,OAAO,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,OAAO,SAAS,EAAE,CAAC,MAAO,GAAE,EAAE,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE,OAAO,EAAE,EAAE,UAAU,SAAS,EAAE,CAAC,MAAO,GAAE,IAAI,CAAC,EAAE,EAAE,UAAU,SAAS,EAAE,CAAC,MAAO,GAAE,IAAI,CAAC,EAAE,EAAE,UAAU,SAAS,EAAE,CAAC,MAAO,IAAI,GAAE,IAAI,EAAE,EAAE,EAAE,UAAU,SAAS,EAAE,CAAC,MAAO,IAAI,GAAE,IAAI,EAAE,CAAC,GAAE,IAAI,IAAE,CAAE,EAAC,EAAE,MAAM,EAAC,CAAC,YAAY,EAAE,EAAE,CAAA,EAAG,EAAE,CAAE,EAAC,CAAC,KAAK,KAAK,EAAE,KAAK,QAAQ,EAAE,KAAK,OAAO,EAAE,KAAK,UAAU,CAAA,EAAG,EAAE,QAAS,GAAG,CAAC,GAAG,CAAC,KAAK,SAAS,EAAE,GAAG,EAAE,KAAM,IAAI,OAAM,kBAAkB,EAAE,6CAA6C,KAAK,MAAM,EAAE,KAAK,UAAU,EAAE,IAAI,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,IAAI,GAAG,EAAE,GAAG,EAAE,IAAI,IAAI,CAAC,CAAG,CAAA,CAAC,SAAS,CAAC,MAAO,MAAK,IAAI,CAAC,SAAS,EAAE,EAAE,EAAE,EAAE,CAAC,GAAG,CAAC,KAAK,SAAS,CAAC,EAAE,KAAM,IAAI,OAAM,uBAAuB,kCAAkC,KAAK,MAAM,EAAE,KAAM,GAAE,GAAI,GAAE,EAAE,CAAC,EAAE,GAAI,GAAE,KAAK,QAAQ,UAAW,GAAG,EAAE,OAAO,CAAC,CAAC,EAAG,MAAM,AAAK,KAAL,IAAS,GAAE,KAAK,QAAQ,OAAO,KAAK,QAAQ,KAAK,CAAC,GAAG,KAAK,OAAO,KAAK,CAAC,IAAI,EAAE,MAAM,EAAE,IAAI,CAAC,CAAC,EAAE,KAAK,UAAU,EAAE,GAAG,KAAK,KAAK,GAAG,KAAK,KAAK,GAAG,EAAE,GAAG,KAAK,KAAK,GAAG,EAAE,IAAI,CAAC,IAAI,EAAE,MAAM,EAAE,IAAI,CAAC,EAAE,IAAI,CAAC,WAAW,CAAC,MAAO,MAAK,OAAO,IAAK,GAAI,EAAC,IAAI,EAAE,IAAI,MAAM,KAAK,QAAQ,EAAE,OAAO,IAAI,EAAE,GAAG,EAAI,CAAA,CAAC,SAAS,EAAE,CAAC,GAAG,CAAC,KAAK,SAAS,CAAC,EAAE,MAAO,MAAK,KAAM,GAAE,KAAK,UAAU,EAAE,GAAG,KAAK,KAAK,GAAG,KAAK,KAAK,GAAG,EAAE,GAAG,KAAK,KAAK,GAAG,EAAE,IAAI,MAAI,GAAoB,CAAC,IAAI,EAAE,IAAI,MAAM,KAAK,QAAQ,EAAE,OAAO,IAAI,EAAE,GAAG,EAA3D,IAA4D,CAAC,SAAS,EAAE,CAAC,MAAO,GAAE,IAAI,GAAG,EAAE,GAAG,KAAK,KAAK,IAAI,EAAE,IAAI,GAAG,EAAE,GAAG,KAAK,KAAK,IAAI,EAAE,IAAI,GAAG,EAAE,GAAG,KAAK,KAAK,EAAE,OAAQ,SAAQ,EAAE,CAAC,KAAM,GAAE,GAAE,EAAE,MAAM,OAAO,MAAM,CAAC,EAAE,EAAE,GAAE,EAAE,MAAM,UAAU,UAAU,EAAE,IAAK,GAAG,EAAE,QAAQ,CAAC,KAAK,GAAG,MAAM,CAAC,CAAC,GAAI,EAAE,GAAE,EAAE,MAAM,SAAS,UAAU,EAAE,IAAK,GAAI,EAAC,IAAI,GAAE,EAAE,MAAM,MAAM,CAAC,EAAE,MAAM,GAAE,EAAE,QAAQ,KAAK,EAAE,IAAI,GAAG,IAAI,GAAE,EAAE,MAAM,UAAU,EAAG,MAAM,CAAC,EAAE,EAAG,MAAO,IAAI,IAAE,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,YAAW,EAAE,CAAC,GAAI,GAAE,KAAK,MAAM,IAAK,CAAM,GAAN,MAAU,GAAE,KAAK,EAAE,CAAC,YAAW,EAAE,EAAE,EAAE,CAAC,KAAM,GAAE,EAAE,IAAI,CAAC,EAAE,GAAG,EAAE,MAAO,GAAE,KAAM,GAAE,EAAE,CAAC,EAAE,MAAO,GAAE,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC,YAAW,EAAE,CAAC,MAAO,GAAE,CAAC,CAAC,YAAW,EAAE,EAAE,EAAE,CAAC,MAAO,MAAK,IAAI,EAAE,KAAK,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,WAAW,EAAE,EAAE,EAAE,CAAC,MAAO,GAAE,EAAG,GAAE,EAAE,CAAC,YAAW,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,MAAO,GAAE,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,YAAW,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,MAAO,GAAE,EAAE,GAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,GAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,YAAW,EAAE,EAAE,EAAE,CAAC,MAAO,GAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,YAAW,EAAE,EAAE,EAAE,CAAC,MAAO,GAAE,GAAI,GAAE,EAAE,CAAC,YAAW,EAAE,CAAC,MAAO,GAAE,EAAE,EAAG,GAAG,GAAE,EAAE,IAAI,GAAG,CAAC,YAAW,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,MAAO,GAAE,GAAE,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,YAAW,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,MAAO,IAAE,EAAE,EAAE,GAAE,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,YAAW,EAAE,EAAE,EAAE,CAAC,GAAI,GAAE,EAAE,EAAE,KAAK,EAAE,GAAG,CAAC,KAAM,GAAE,KAAK,MAAM,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAG,GAAE,EAAE,EAAE,GAAG,EAAE,EAAE,CAAC,MAAO,EAAC,CAAC,YAAW,EAAE,EAAE,EAAE,CAAC,GAAI,GAAE,OAAO,QAAQ,CAAC,EAAE,OAAO,CAAC,EAAE,OAAO,SAAS,EAAE,OAAO,CAAC,EAAE,MAAO,GAAE,EAAE,EAAE,OAAO,QAAQ,EAAE,EAAE,OAAO,EAAE,EAAE,GAAG,OAAO,EAAE,CAAC,CAAC,YAAW,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,MAAO,QAAO,CAAC,GAAG,OAAO,EAAE,EAAE,OAAO,CAAC,GAAG,OAAO,EAAE,EAAE,OAAO,CAAC,GAAG,OAAO,EAAE,EAAE,OAAO,CAAC,GAAG,OAAO,EAAE,EAAE,OAAO,CAAC,GAAG,OAAO,EAAE,EAAE,OAAO,CAAC,GAAG,OAAO,EAAE,EAAE,OAAO,CAAC,GAAG,OAAO,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,YAAY,EAAE,CAAC,KAAK,KAAK,OAAO,CAAC,EAAE,KAAK,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAC,MAAO,IAAI,GAAE,KAAK,SAAU,CAAA,CAAC,CAAC,gBAAgB,CAAC,MAAO,IAAI,IAAE,KAAK,IAAI,CAAC,CAAC,QAAQ,EAAE,CAAC,KAAK,KAAK,EAAE,EAAE,WAAW,EAAE,YAAY,CAAC,SAAS,CAAC,KAAK,KAAK,KAAK,KAAK,EAAE,WAAW,EAAE,UAAU,EAAE,YAAY,CAAC,QAAQ,EAAE,CAAC,OAAQ,GAAE,EAAE,EAAE,EAAE,GAAG,EAAE,KAAK,SAAS,CAAC,KAAK,EAAE,CAAC,KAAK,UAAU,KAAM,GAAE,OAAO,KAAK,MAAM,OAAO,EAAE,aAAa,CAAC,CAAC,EAAE,MAAO,GAAE,WAAW,EAAE,WAAW,CAAC,CAAC,QAAQ,EAAE,CAAC,GAAG,AAAS,IAAT,OAAW,MAAO,MAAK,KAAK,EAAE,EAAE,GAAG,AAAI,GAAE,EAAE,IAAR,EAAW,MAAO,QAAO,OAAO,CAAC,EAAE,OAAO,KAAK,KAAK,EAAE,CAAC,GAAG,OAAO,EAAE,CAAC,EAAE,GAAI,GAAE,EAAE,KAAM,GAAE,KAAK,KAAK,EAAE,GAAI,GAAE,EAAE,GAAI,GAAE,GAAG,GAAG,CAAC,MAAO,EAAC,CAAC,UAAU,CAAC,MAAO,QAAO,KAAK,KAAK,EAAE,CAAC,GAAG,OAAO,EAAE,GAAG,OAAO,KAAK,KAAK,EAAE,CAAC,CAAC,CAAC,WAAW,CAAC,MAAO,MAAK,KAAK,EAAE,EAAE,EAAE,gBAAgB,CAAC,YAAY,CAAC,KAAM,GAAE,KAAK,KAAK,EAAE,EAAE,MAAO,MAAK,QAAO,EAAG,EAAE,EAAE,iBAAiB,CAAC,CAAC,EAAE,aAAa,GAAG,EAAE,aAAa,OAAO,iBAAiB,EAAE,EAAE,WAAW,OAAO,aAAa,EAAE,EAAE,UAAU,OAAO,IAAI,EAAE,EAAE,iBAAiB,EAAE,KAAK,IAAI,EAAE,EAAE,EAAE,EAAE,kBAAkB,EAAE,KAAK,IAAI,EAAE,EAAE,EAAE,MAAM,EAAC,CAAC,YAAY,EAAE,CAAC,KAAK,KAAK,CAAC,CAAC,GAAG,EAAE,EAAE,EAAE,CAAC,KAAM,GAAE,GAAE,EAAE,EAAE,CAAC,EAAE,MAAO,IAAI,GAAE,EAAE,KAAK,IAAI,CAAC,CAAC,WAAW,EAAE,CAAC,KAAM,GAAE,GAAE,EAAE,CAAC,QAAQ,EAAE,CAAC,EAAE,EAAE,GAAE,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,EAAE,MAAO,IAAI,GAAE,EAAE,KAAK,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,YAAY,EAAE,CAAC,KAAK,KAAK,CAAC,OAAO,CAAC,EAAE,OAAO,CAAC,CAAC,EAAE,KAAK,KAAK,CAAC,OAAQ,QAAO,EAAE,CAAC,MAAO,IAAI,GAAE,EAAE,oBAAoB,CAAC,CAAC,CAAC,OAAQ,eAAc,EAAE,CAAC,MAAQ,IAAI,IAAG,GAAE,GAAG,OAAO,EAAE,GAAG,OAAO,sBAAsB,EAAE,OAAO,oBAAoB,GAAG,GAAG,OAAO,EAAE,GAAG,OAAO,sBAAsB,EAAE,OAAO,oBAAoB,GAAG,GAAG,OAAO,EAAE,GAAG,OAAO,oBAAoB,CAAC,OAAQ,qBAAoB,EAAE,CAAC,EAAE,GAAI,IAAG,OAAO,qBAAqB,GAAG,KAAM,GAAE,EAAE,EAAE,gBAAgB,EAAE,EAAE,EAAE,gBAAgB,OAAO,oBAAoB,EAAE,MAAM,CAAC,EAAE,cAAc,CAAC,EAAE,EAAE,cAAc,CAAC,CAAC,CAAC,OAAQ,YAAW,EAAE,EAAE,CAAC,MAAO,IAAG,EAAE,OAAO,oBAAoB,EAAE,GAAG,OAAO,EAAE,EAAE,CAAC,CAAC,QAAQ,EAAE,CAAC,KAAK,KAAK,EAAE,oBAAoB,CAAC,CAAC,CAAC,MAAM,CAAC,MAAO,IAAI,GAAE,CAAC,KAAK,KAAI,EAAG,KAAK,KAAI,CAAE,CAAC,CAAC,CAAC,gBAAgB,CAAC,MAAO,IAAI,IAAE,KAAK,KAAM,EAAC,KAAK,KAAM,CAAA,CAAC,CAAC,MAAM,CAAC,KAAM,GAAE,KAAK,KAAK,GAAG,GAAI,GAAE,KAAK,KAAK,GAAG,KAAM,GAAE,EAAE,WAAW,EAAE,EAAE,OAAO,oBAAoB,EAAE,OAAO,EAAE,CAAC,EAAE,EAAE,OAAO,oBAAoB,EAAE,MAAO,IAAG,EAAE,KAAK,KAAK,CAAC,EAAE,WAAW,EAAE,OAAO,EAAE,CAAC,EAAE,EAAE,GAAG,OAAO,EAAE,EAAE,OAAO,oBAAoB,EAAE,EAAE,WAAW,EAAE,OAAO,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,UAAU,CAAC,GAAI,GAAE,KAAK,KAAI,EAAG,MAAO,GAAE,OAAO,oBAAoB,GAAI,IAAG,OAAO,qBAAqB,GAAG,CAAC,CAAC,QAAQ,EAAE,CAAC,GAAI,GAAE,KAAK,KAAK,GAAG,EAAE,KAAK,KAAK,GAAG,OAAQ,GAAE,EAAE,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,EAAE,WAAW,EAAE,OAAO,EAAE,CAAC,EAAE,EAAE,GAAG,OAAO,EAAE,EAAE,EAAE,EAAE,WAAW,EAAE,OAAO,EAAE,CAAC,EAAE,KAAK,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC,MAAO,MAAK,KAAI,GAAI,OAAO,GAAG,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC,GAAI,GAAE,KAAK,OAAO,OAAO,UAAU,EAAE,GAAG,EAAE,CAAC,KAAM,GAAE,OAAO,CAAC,EAAE,GAAI,GAAE,EAAE,EAAE,EAAE,EAAE,OAAO,UAAU,EAAE,GAAG,EAAE,EAAE,CAAC,KAAM,GAAI,GAAC,EAAE,OAAO,UAAU,GAAG,OAAO,CAAC,GAAG,EAAE,KAAK,EAAE,GAAG,EAAE,KAAK,KAAM,EAAC,OAAO,UAAU,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,OAAO,UAAU,CAAC,CAAC,KAAM,GAAE,GAAG,OAAO,EAAE,EAAE,MAAO,QAAO,CAAC,CAAC,CAAC,CAAC,GAAI,GAAE,OAAO,CAAC,EAAE,MAAO,IAAG,YAAa,IAAG,YAAY,CAAC,CAAC,CAAC,WAAW,CAAC,MAAO,QAAO,KAAK,SAAS,EAAE,CAAC,EAAE,EAAE,gBAAgB,CAAC,YAAY,CAAC,MAAO,QAAO,KAAK,SAAS,EAAE,CAAC,EAAE,EAAE,iBAAiB,CAAC,oBAAoB,CAAC,MAAM,WAAW,KAAK,KAAK,GAAG,aAAa,KAAK,KAAK,EAAE,CAAC,CAAC,EAAE,gBAAgB,OAAO,qBAAqB,EAAE,EAAE,gBAAgB,OAAO,sBAAsB,EAAE,EAAE,iBAAiB,EAAE,KAAK,IAAI,EAAE,EAAE,EAAE,EAAE,kBAAkB,sBAAsB,MAAM,EAAC,CAAC,YAAY,EAAE,EAAE,CAAC,KAAK,OAAO,EAAE,KAAK,OAAO,CAAC,CAAC,GAAG,EAAE,EAAE,EAAE,CAAC,KAAM,GAAE,GAAE,EAAE,EAAE,CAAC,EAAE,KAAK,OAAO,MAAO,IAAI,GAAE,CAAC,EAAE,KAAK,MAAM,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC,KAAM,GAAE,GAAE,EAAE,CAAC,QAAQ,EAAE,CAAC,EAAE,EAAE,GAAE,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,GAAE,EAAE,GAAG,EAAE,GAAG,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,GAAG,EAAE,MAAO,IAAI,GAAE,CAAC,EAAE,KAAK,OAAO,EAAE,KAAK,MAAM,CAAC,CAAC,CAAC,CAAC,MAAM,CAAE,CAAC,YAAY,EAAE,CAAC,KAAK,GAAG,IAAI,EAAE,WAAU,EAAG,KAAK,GAAG,IAAI,EAAE,WAAY,EAAC,KAAK,GAAG,IAAI,EAAE,WAAY,EAAC,KAAK,EAAE,MAAM,GAAG,EAAE,OAAQ,GAAE,EAAE,EAAE,IAAI,GAAG,EAAE,KAAK,EAAE,GAAG,EAAE,OAAQ,GAAE,EAAE,EAAE,IAAI,GAAG,EAAE,CAAC,KAAM,GAAE,EAAE,QAAQ,IAAI,CAAC,EAAE,EAAE,KAAK,EAAE,GAAG,KAAK,EAAE,GAAG,KAAK,EAAE,EAAE,GAAG,KAAK,EAAE,EAAE,GAAG,CAAC,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,GAAI,GAAE,EAAE,EAAE,KAAM,GAAG,GAAE,GAAG,EAAG,GAAG,EAAE,KAAK,MAAM,EAAE,CAAC,EAAE,EAAE,EAAG,GAAG,GAAG,GAAG,GAAE,KAAK,MAAM,EAAE,CAAC,IAAI,EAAG,KAAK,GAAI,GAAE,EAAE,EAAG,GAAE,EAAG,GAAE,IAAK,GAAE,EAAE,EAAE,GAAI,GAAE,EAAE,EAAE,GAAG,KAAM,GAAE,EAAE,EAAE,EAAG,GAAG,EAAE,EAAE,EAAE,EAAG,GAAG,EAAE,EAAE,EAAE,EAAE,EAAG,GAAG,EAAE,EAAE,EAAE,EAAE,EAAG,GAAG,EAAE,IAAI,EAAE,EAAE,IAAI,EAAE,EAAE,KAAK,EAAE,EAAE,KAAK,EAAE,CAAC,CAAC,EAAE,GAAG,EAAE,KAAK,EAAE,EAAE,EAAE,KAAK,EAAE,EAAE,CAAC,CAAC,EAAE,GAAG,EAAE,KAAK,EAAE,EAAE,EAAE,KAAK,EAAE,EAAE,CAAC,CAAC,EAAE,GAAG,MAAO,IAAI,MAAK,iBAAiB,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,KAAK,iBAAiB,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,KAAK,iBAAiB,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,OAAO,EAAE,EAAE,EAAE,CAAC,KAAM,GAAE,kBAAmB,GAAE,EAAE,GAAG,EAAE,KAAK,MAAM,EAAE,CAAC,EAAE,EAAE,KAAK,MAAM,EAAE,CAAC,EAAE,EAAE,KAAK,MAAM,EAAE,CAAC,EAAE,EAAE,mBAAoB,GAAE,EAAE,GAAG,EAAE,EAAG,GAAE,GAAG,EAAE,EAAG,GAAE,GAAG,EAAE,EAAG,GAAE,GAAG,GAAI,GAAE,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,GAAG,EAAG,GAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,GAAG,EAAG,GAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,GAAI,GAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,EAAG,GAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,EAAG,GAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,GAAI,GAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,KAAM,GAAE,EAAE,EAAE,mBAAmB,EAAE,EAAE,EAAE,mBAAmB,EAAE,EAAE,EAAE,mBAAmB,EAAE,EAAE,EAAE,kBAAkB,EAAE,EAAE,EAAE,kBAAkB,EAAE,EAAE,EAAE,kBAAkB,EAAE,EAAE,GAAG,EAAE,EAAE,GAAG,EAAE,EAAE,GAAG,EAAE,IAAI,EAAE,EAAE,IAAI,EAAE,EAAE,IAAI,EAAE,EAAE,KAAK,EAAE,EAAE,KAAK,EAAE,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,KAAK,EAAE,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,KAAK,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,KAAK,EAAE,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,KAAK,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,KAAK,EAAE,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,KAAK,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,GAAG,MAAO,IAAI,MAAK,iBAAiB,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,KAAK,iBAAiB,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,KAAK,iBAAiB,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,KAAK,iBAAiB,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC,MAAO,MAAK,EAAE,IAAI,EAAE,CAAC,iBAAiB,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,GAAI,GAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,MAAO,GAAE,EAAE,EAAE,EAAG,IAAG,EAAE,EAAE,EAAE,EAAE,EAAG,QAAQ,EAAE,EAAE,EAAE,CAAC,GAAG,CAAC,OAAQ,SAAQ,EAAE,EAAE,EAAE,EAAE,CAAC,KAAM,GAAE,EAAG,SAAS,GAAG,GAAG,MAAO,GAAE,GAAG,EAAE,EAAE,GAAG,EAAE,EAAE,GAAG,CAAC,CAAC,CAAC,EAAG,SAAS,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,GAAG,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,EAAG,GAAG,GAAI,MAAK,KAAK,CAAC,EAAE,GAAG,EAAG,GAAI,GAAE,KAAK,KAAK,CAAC,GAAG,EAAE,MAAM,EAAE,CAAC,YAAY,EAAE,CAAC,KAAK,GAAG,IAAI,EAAE,WAAY,EAAC,KAAK,GAAG,IAAI,EAAE,aAAa,KAAK,GAAG,IAAI,EAAE,WAAY,EAAC,KAAK,EAAE,MAAM,GAAG,EAAE,OAAQ,GAAE,EAAE,EAAE,IAAI,GAAG,EAAE,KAAK,EAAE,GAAG,EAAE,IAAI,EAAE,IAAI,EAAE,OAAQ,GAAE,EAAE,EAAE,IAAI,GAAG,EAAE,CAAC,KAAM,GAAE,EAAE,QAAQ,IAAI,CAAC,EAAE,EAAE,KAAK,EAAE,GAAG,KAAK,EAAE,GAAG,KAAK,EAAE,EAAE,GAAG,KAAK,EAAE,EAAE,GAAG,CAAC,CAAC,CAAC,OAAO,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,KAAM,GAAE,EAAE,KAAK,GAAG,EAAE,EAAE,KAAK,GAAG,EAAE,EAAE,KAAK,GAAG,EAAE,KAAK,MAAM,CAAC,EAAE,EAAE,KAAK,MAAM,CAAC,EAAE,EAAE,KAAK,MAAM,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,GAAI,GAAE,EAAE,GAAG,AAAI,IAAJ,EAAM,CAAC,KAAM,GAAE,GAAG,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,KAAK,MAAM,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC,MAAO,MAAK,cAAc,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,cAAc,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,KAAM,GAAE,KAAK,EAAE,CAAC,EAAE,EAAE,KAAK,EAAE,EAAE,CAAC,EAAE,EAAE,KAAK,EAAE,EAAE,CAAC,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,KAAK,EAAE,EAAE,CAAC,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAG,QAAQ,KAAK,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAG,QAAQ,KAAK,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAG,QAAQ,KAAK,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAG,QAAQ,KAAK,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAG,QAAQ,KAAK,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAG,QAAQ,KAAK,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAG,QAAQ,KAAK,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAG,QAAQ,KAAK,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,MAAO,IAAE,GAAE,CAAC,EAAE,GAAE,CAAC,EAAE,GAAE,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,MAAO,KAAI,KAAK,EAAE,IAAI,EAAE,CAAC,CAAC,MAAM,CAAE,CAAC,YAAY,EAAE,EAAE,EAAE,CAAC,GAAG,YAAa,GAAE,CAAC,KAAM,GAAE,EAAE,eAAgB,EAAC,KAAK,YAAY,MAAM,EAAE,MAAM,EAAE,OAAQ,GAAE,EAAE,EAAE,EAAE,OAAO,IAAI,GAAG,AAAI,EAAE,KAAN,EAAS,CAAC,KAAM,GAAE,EAAE,EAAE,KAAK,YAAY,GAAG,GAAI,IAAG,EAAE,WAAW,UAAU,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,EAAE,EAAE,EAAE,OAAO,KAAM,IAAI,OAAM,0DAA0D,EAAE,KAAK,YAAY,MAAM,EAAE,MAAM,EAAE,OAAQ,GAAE,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,EAAE,QAAQ,AAAI,EAAE,KAAN,EAAS,KAAK,YAAY,GAAG,GAAI,IAAG,CAAC,EAAE,EAAE,QAAQ,GAAG,CAAC,CAAC,KAAK,WAAW,EAAE,KAAK,sBAAsB,KAAK,IAAI,EAAE,CAAC,EAAE,KAAK,sBAAsB,KAAK,IAAI,EAAE,EAAE,OAAO,CAAC,EAAG,MAAK,IAAI,EAAE,EAAE,MAAM,EAAE,EAAE,CAAC,OAAO,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,CAAC,GAAI,GAAE,EAAE,EAAE,KAAK,sBAAsB,EAAE,KAAK,sBAAsB,OAAQ,GAAE,EAAE,EAAE,KAAK,YAAY,OAAO,GAAG,EAAE,CAAC,KAAM,GAAE,KAAK,YAAY,GAAG,GAAI,IAAG,KAAK,WAAW,GAAG,EAAE,EAAE,OAAO,EAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC,EAAE,GAAG,EAAG,KAAK,EAAE,CAAC,EAAE,EAAG,KAAK,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,GAAG,GAAG,EAAE,GAAG,CAAC,CAAC,MAAO,EAAC,CAAC,eAAe,EAAE,CAAC,MAAO,MAAK,YAAY,KAAK,YAAY,OAAO,EAAE,EAAE,OAAQ,MAAK,EAAE,CAAC,MAAO,GAAE,SAAS,KAAK,MAAM,EAAE,SAAS,EAAE,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,YAAY,EAAE,EAAE,EAAE,EAAE,CAAC,KAAK,UAAU,EAAE,KAAK,WAAW,EAAE,KAAK,cAAc,GAAI,GAAG,EAAE,IAAI,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,KAAK,cAAc,GAAI,GAAG,EAAE,IAAI,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,KAAK,UAAU,GAAI,GAAG,EAAE,GAAG,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,KAAK,QAAQ,QAAQ,EAAE,QAAQ,KAAK,OAAO,QAAQ,EAAE,OAAO,KAAK,YAAY,KAAK,QAAQ,EAAE,SAAS,KAAK,WAAW,KAAK,OAAO,EAAE,OAAO,CAAC,OAAO,EAAE,EAAE,EAAE,CAAC,GAAI,GAAE,EAAE,KAAK,MAAM,EAAE,KAAK,SAAS,EAAE,EAAE,KAAK,MAAM,EAAE,KAAK,UAAU,EAAE,EAAE,KAAK,MAAM,EAAE,KAAK,SAAS,EAAE,GAAI,GAAE,EAAE,EAAE,EAAE,OAAQ,GAAE,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC,GAAG,EAAE,KAAK,UAAU,eAAe,CAAC,EAAE,EAAE,CAAC,KAAM,GAAE,KAAK,YAAY,EAAE,EAAE,KAAK,WAAW,EAAE,EAAE,EAAG,KAAK,EAAE,CAAC,EAAE,EAAE,EAAG,KAAK,EAAE,CAAC,EAAE,EAAE,EAAG,KAAK,EAAE,CAAC,EAAE,GAAG,EAAE,OAAO,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,EAAG,GAAE,GAAG,GAAG,EAAE,EAAE,EAAE,GAAI,GAAE,EAAE,EAAE,EAAE,OAAQ,GAAE,EAAE,EAAE,GAAG,GAAG,EAAE,CAAC,KAAM,GAAE,KAAK,QAAQ,EAAE,EAAE,KAAK,OAAO,EAAE,EAAE,EAAG,KAAK,EAAE,CAAC,EAAE,EAAE,EAAG,KAAK,EAAE,CAAC,EAAE,EAAE,EAAG,KAAK,EAAE,CAAC,EAAE,EAAE,GAAI,GAAE,KAAK,cAAc,eAAe,CAAC,IAAK,IAAG,EAAE,OAAO,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,GAAG,EAAE,GAAI,GAAE,KAAK,cAAc,eAAe,CAAC,IAAK,IAAG,EAAE,OAAO,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,GAAG,GAAG,CAAC,CAAC,MAAO,IAAE,EAAE,IAAI,EAAE,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC,AAAC,UAAS,EAAE,CAAC,EAAE,SAAS,SAAS,EAAE,CAAC,GAAI,GAAE,EAAE,EAAE,EAAE,EAAE,KAAM,GAAE,AAAQ,GAAE,EAAE,WAAW,CAAC,KAAxB,MAA4B,AAAS,IAAT,OAAW,EAAE,CAAE,EAAC,MAAM,CAAC,QAAQ,AAAQ,GAAE,EAAE,WAAW,EAAE,QAAQ,KAAjC,MAAqC,AAAS,IAAT,OAAW,EAAE,EAAE,OAAO,AAAQ,GAAE,EAAE,WAAW,EAAE,OAAO,KAAhC,MAAoC,AAAS,IAAT,OAAW,EAAE,EAAE,SAAS,AAAQ,GAAE,EAAE,WAAW,EAAE,SAAS,KAAlC,MAAsC,AAAS,IAAT,OAAW,EAAE,GAAG,QAAQ,AAAQ,GAAE,EAAE,WAAW,EAAE,QAAQ,KAAjC,MAAqC,AAAS,IAAT,OAAW,EAAE,EAAE,CAAC,CAAC,GAAE,IAAI,IAAE,CAAE,EAAC,EAAE,MAAM,EAAE,CAAC,YAAY,EAAE,CAAC,YAAY,EAAE,WAAW,GAAG,CAAC,KAAK,MAAM,GAAI,GAAG,EAAE,EAAE,CAAC,EAAE,KAAK,OAAO,GAAI,GAAG,EAAE,EAAE,CAAC,EAAE,GAAI,GAAE,EAAE,EAAE,EAAE,GAAG,EAAE,OAAQ,GAAE,EAAE,EAAE,EAAE,OAAO,GAAG,EAAE,AAAI,EAAE,KAAN,GAAW,GAAE,KAAK,IAAI,EAAE,CAAC,EAAE,EAAE,KAAK,IAAI,EAAE,CAAC,GAAG,KAAM,GAAE,GAAI,GAAE,EAAG,GAAE,EAAE,IAAI,KAAK,YAAY,EAAE,EAAE,CAAC,CAAC,OAAO,EAAE,EAAE,EAAE,CAAC,KAAM,GAAE,EAAE,GAAG,aAAa,EAAE,EAAE,GAAG,aAAa,EAAE,EAAE,GAAG,aAAa,MAAO,MAAK,MAAM,OAAO,EAAE,EAAE,CAAC,EAAE,KAAK,OAAO,OAAO,EAAE,EAAE,CAAC,GAAG,KAAK,WAAW,CAAC,CAAC,GAAG,aAAa,mBAAmB,SAAS,EAAE,CAAC,EAAE,OAAO,SAAS,EAAE,EAAE,CAAC,MAAM,CAAC,YAAY,EAAE,WAAW,CAAC,CAAC,EAAE,EAAE,SAAS,SAAS,EAAE,CAAC,GAAI,GAAE,EAAE,EAAE,KAAM,GAAE,AAAQ,GAAE,EAAE,WAAW,CAAC,KAAxB,MAA4B,AAAS,IAAT,OAAW,EAAE,CAAA,EAAG,MAAM,CAAC,YAAY,AAAQ,GAAE,EAAE,QAAQ,EAAE,WAAW,KAAjC,MAAqC,AAAS,IAAT,OAAW,EAAE,EAAE,WAAW,AAAQ,GAAE,EAAE,UAAU,EAAE,WAAY,GAAG,CAAC,GAAI,GAAE,MAAO,AAAQ,GAAE,EAAE,WAAW,CAAC,KAAxB,MAA4B,AAAS,IAAT,OAAW,EAAE,CAAC,CAAG,KAAlG,MAAqG,AAAS,IAAT,OAAW,EAAE,CAAE,CAAA,CAAC,CAAC,EAAE,IAAI,IAAE,GAAG,EAAE,MAAM,EAAE,CAAC,YAAY,EAAE,EAAE,CAAC,KAAM,GAAE,EAAE,EAAE,OAAO,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,EAAE,EAAE,GAAI,KAAI,CAAC,EAAE,EAAE,GAAI,GAAG,CAAC,EAAE,KAAK,YAAY,MAAM,CAAC,EAAE,GAAG,GAAG,EAAE,GAAG,EAAE,IAAI,CAAC,GAAI,MAAK,YAAY,GAAG,GAAG,OAAQ,GAAE,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,GAAG,GAAG,EAAE,IAAI,EAAE,CAAC,EAAE,KAAK,YAAY,GAAG,GAAI,GAAG,CAAC,EAAE,EAAE,QAAQ,GAAG,EAAE,GAAG,EAAE,EAAE,KAAM,IAAI,OAAM,kCAAkC,EAAE,KAAK,uBAAuB,KAAK,IAAI,EAAE,CAAC,EAAE,KAAK,uBAAuB,EAAG,MAAK,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC,OAAO,EAAE,EAAE,EAAE,CAAC,GAAI,GAAE,EAAE,EAAE,KAAK,uBAAuB,EAAE,KAAK,uBAAuB,OAAQ,GAAE,EAAE,EAAE,KAAK,YAAY,OAAO,GAAG,EAAE,CAAC,KAAM,GAAE,KAAK,YAAY,GAAG,GAAI,IAAG,EAAE,EAAE,SAAS,EAAE,EAAG,GAAE,EAAE,GAAG,GAAG,EAAE,EAAG,GAAE,EAAE,GAAG,EAAE,GAAG,GAAG,EAAE,GAAG,CAAC,CAAC,MAAO,EAAC,CAAC,CAAC,AAAC,UAAS,EAAE,CAAC,EAAE,SAAS,SAAS,EAAE,EAAE,CAAC,GAAI,GAAE,EAAE,EAAE,EAAE,GAAG,AAAU,MAAO,IAAjB,SAAmB,MAAO,IAAI,IAAG,CAAC,EAAE,KAAM,GAAE,AAAQ,GAAE,EAAE,WAAW,CAAC,KAAxB,MAA4B,AAAS,IAAT,OAAW,EAAE,GAAG,EAAE,GAAI,GAAG,EAAE,EAAE,UAAU,CAAC,EAAE,EAAE,AAAQ,GAAE,EAAE,UAAU,EAAE,OAAQ,GAAG,CAAC,GAAI,GAAE,MAAO,AAAQ,GAAE,EAAE,WAAW,CAAC,KAAxB,MAA4B,AAAS,IAAT,OAAW,EAAE,CAAE,CAAA,MAA5F,MAAkG,AAAS,IAAT,OAAW,EAAE,GAAG,GAAG,AAAI,EAAE,SAAN,EAAa,MAAO,IAAI,IAAG,CAAC,EAAE,SAAU,KAAK,GAAE,CAAC,KAAM,GAAE,AAAQ,GAAE,EAAE,WAAW,EAAE,QAAQ,KAAjC,MAAqC,AAAS,IAAT,OAAW,EAAE,EAAE,EAAE,EAAE,SAAS,EAAE,MAAM,CAAC,EAAE,EAAE,AAAQ,GAAE,EAAE,WAAW,EAAE,UAAU,KAAnC,MAAuC,AAAS,IAAT,OAAW,EAAE,EAAE,EAAE,SAAS,EAAE,EAAE,CAAC,CAAC,CAAC,MAAO,EAAC,CAAC,GAAE,IAAI,IAAE,GAAG,EAAE,MAAM,EAAE,CAAC,YAAY,EAAE,CAAC,KAAK,MAAM,CAAC,CAAC,OAAO,CAAC,MAAO,MAAK,KAAK,CAAC,QAAQ,CAAC,MAAO,MAAK,KAAK,CAAC,CAAC,MAAM,CAAE,CAAC,YAAY,EAAE,EAAE,CAAE,EAAC,EAAE,GAAG,EAAE,CAAA,EAAG,CAAC,KAAK,WAAW,EAAE,KAAK,UAAU,EAAE,KAAK,OAAO,EAAE,KAAK,YAAY,CAAC,CAAC,MAAM,EAAE,CAAC,KAAM,GAAE,KAAK,WAAW,MAAM,CAAC,EAAE,EAAE,GAAE,EAAE,KAAK,UAAU,OAAQ,GAAG,EAAE,KAAK,UAAU,EAAE,EAAG,EAAE,EAAE,KAAK,UAAU,OAAO,EAAE,GAAG,EAAE,EAAE,MAAO,MAAK,OAAO,GAAG,MAAM,CAAC,EAAE,KAAK,YAAY,GAAI,GAAE,KAAK,UAAU,IAAI,GAAG,IAAI,EAAE,MAAO,MAAK,OAAO,GAAG,MAAM,CAAC,EAAE,KAAK,YAAY,GAAI,GAAE,KAAK,UAAU,IAAI,KAAM,GAAE,KAAK,UAAU,GAAG,EAAE,KAAK,UAAU,EAAE,GAAG,EAAE,KAAK,YAAY,GAAG,EAAE,KAAK,YAAY,EAAE,GAAG,EAAG,GAAE,GAAI,GAAE,GAAG,EAAE,KAAK,OAAO,GAAG,MAAM,CAAC,EAAE,EAAE,KAAK,OAAO,EAAE,GAAG,MAAM,CAAC,EAAE,EAAE,EAAG,GAAE,GAAI,GAAE,GAAG,EAAE,CAAC,EAAG,GAAE,GAAI,GAAE,GAAG,MAAO,GAAE,EAAE,EAAE,CAAC,EAAE,EAAG,GAAE,GAAG,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,EAAE,EAAE,EAAE,EAAE,CAAC,MAAO,MAAK,UAAU,KAAK,CAAC,EAAE,KAAK,OAAO,KAAK,AAAU,MAAO,IAAjB,SAAmB,GAAI,IAAG,CAAC,EAAE,CAAC,EAAE,KAAK,YAAY,KAAK,CAAC,EAAE,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,WAAW,KAAK,WAAW,OAAM,EAAG,OAAO,KAAK,UAAU,IAAK,CAAC,EAAE,IAAK,EAAC,SAAS,EAAE,MAAM,KAAK,OAAO,GAAG,OAAQ,EAAC,WAAW,KAAK,YAAY,EAAE,GAAI,CAAC,CAAC,CAAM,KAAC,IAAG,GAAG,CAAE,IAAG,GAAG,KAAK,IAAK,IAAG,EAAE,KAAK,IAAK,KAAI,GAAG,GAAG,EAAE,GAAG,CAAC,IAAI,IAAI,IAAI,IAAI,IAAI,GAAG,EAAE,GAAG,GAAG,OAAO,EAAE,GAAG,GAAG,OAAO,EAAE,GAAG,GAAG,OAAO,EAAE,GAAG,GAAG,OAAO,EAAE,GAAG,GAAG,OAAO,EAAE,GAAG,GAAG,OAAO,EAAE,GAAG,GAAG,CAAC,EAAE,EAAE,EAAE,EAAE,GAAG,GAAG,CAAC,EAAE,GAAG,CAAC,WAAW,IAAI,GAAG,WAAW,IAAI,GAAG,YAAY,IAAI,GAAG,KAAK,IAAI,GAAG,MAAM,IAAI,GAAG,YAAY,IAAI,GAAG,cAAc,IAAI,GAAG,aAAa,IAAI,GAAG,WAAW,IAAI,GAAG,cAAc,IAAI,GAAG,cAAc,IAAI,GAAG,gBAAgB,IAAI,GAAG,KAAK,IAAI,GAAG,MAAM,IAAI,GAAG,cAAc,IAAI,GAAG,SAAS,IAAI,GAAG,cAAc,GAAG,CAAC,GAAI,GAAE,MAAO,IAAG,CAAC,KAAM,GAAE,EAAE,GAAG,MAAM,CAAC,GAAG,EAAG,GAAE,EAAE,GAAG,IAAI,GAAE,EAAE,EAAE,GAAG,GAAG,EAAE,CAAC,EAAE,GAAE,EAAE,EAAE,GAAG,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,SAAS,AAAQ,GAAE,EAAE,SAAZ,MAAoB,AAAS,IAAT,OAAW,EAAE,GAAG,CAAC,CAAC,EAAE,WAAW,IAAI,GAAG,oBAAoB,IAAI,GAAG,sBAAsB,IAAI,GAAG,WAAW,GAAG,CAAC,GAAI,GAAE,MAAO,IAAG,SAAS,AAAQ,GAAE,EAAE,OAAZ,MAAkB,AAAS,IAAT,OAAW,EAAE,GAAG,CAAC,CAAC,EAAE,aAAa,GAAG,CAAC,GAAI,GAAE,MAAO,IAAG,SAAS,AAAQ,GAAE,EAAE,OAAZ,MAAkB,AAAS,IAAT,OAAW,EAAE,GAAG,CAAC,CAAC,EAAE,SAAS,IAAI,EAAE,EAAE,GAAI,IAAG,eAAe,EAAE,CAAC,GAAI,GAAE,EAAE,SAAU,KAAK,GAAE,GAAG,EAAE,OAAO,KAAM,GAAE,GAAI,cAAa,CAAC,EAAE,GAAI,GAAE,EAAE,SAAU,KAAK,GAAE,EAAE,IAAI,EAAE,CAAC,EAAE,GAAG,EAAE,OAAO,MAAO,EAAC,CAAC,YAAY,EAAE,EAAE,CAAC,KAAM,GAAEC,GAAQ,EAAG,OAAQ,GAAE,EAAE,EAAE,EAAE,OAAO,GAAG,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,GAAGC,GAAgB,EAAE,EAAE,CAAC,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,GAAG,EAAE,EAAE,CAAC,AAAC,UAAS,EAAE,CAAC,EAAE,OAAO,SAAS,EAAE,EAAE,EAAE,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,GAAG,EAAE,OAAO,OAAQ,IAAG,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,UAAW,KAAI,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,UAAW,KAAI,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,OAAO,OAAQ,IAAG,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,UAAW,KAAI,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,UAAW,KAAI,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,MAAM,CAAC,GAAG,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,CAAC,CAAC,CAAC,GAAE,IAAK,IAAG,CAAA,EAAG,EAAE,MAAM,EAAE,CAAC,YAAY,EAAE,EAAE,EAAE,CAAC,KAAK,GAAG,EAAE,KAAK,SAAS,EAAE,KAAK,UAAU,EAAE,KAAK,SAAS,CAAC,CAAC,iBAAiB,EAAE,CAAC,GAAG,KAAK,SAAS,CAAC,KAAM,GAAE,OAAO,KAAK,KAAK,QAAQ,EAAE,OAAQ,GAAG,KAAK,eAAe,EAAE,CAAC,CAAC,EAAG,GAAG,AAAI,EAAE,SAAN,EAAa,MAAM,CAAA,EAAG,KAAM,GAAE,KAAK,SAAS,EAAE,IAAI,MAAM,CAAC,MAAM,QAAQ,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC,CAAC,MAAG,MAAK,UAAkB,KAAK,UAAU,OAAQ,GAAG,CAAC,EAAE,MAAM,KAAK,YAAY,EAAE,KAAK,CAAC,CAAG,EAAC,IAAK,GAAG,MAAM,QAAQ,EAAE,KAAK,EAAE,EAAE,MAAM,GAAG,EAAE,KAAK,EAAS,EAAE,CAAC,WAAW,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,GAAI,GAAE,EAAE,EAAE,EAAE,KAAM,GAAE,KAAK,iBAAiB,CAAC,EAAE,EAAE,GAAG,EAAE,CAAA,EAAG,EAAE,CAAE,EAAC,EAAE,CAAA,EAAG,SAAU,KAAK,GAAE,CAAC,KAAM,GAAE,GAAG,OAAO,EAAE,AAAQ,GAAE,EAAE,KAAZ,MAAgB,AAAS,IAAT,OAAW,EAAE,EAAE,AAAQ,GAAE,EAAE,KAAZ,MAAgB,AAAS,IAAT,OAAW,EAAE,CAAC,EAAE,EAAE,EAAE,cAAc,EAAE,KAAK,EAAE,WAAW,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,CAAC,KAAM,GAAEC,GAAQ,EAAGC,GAAW,CAAC,EAAEC,GAAY,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,EAAEC,GAAU,EAAE,EAAE,CAACC,GAAW,AAAQ,GAAE,EAAE,KAAZ,MAAgB,AAAS,IAAT,OAAW,EAAE,CAAC,CAAC,EAAEC,GAAU,EAAE,EAAE,CAACD,GAAW,AAAQ,GAAE,EAAE,KAAZ,MAAgB,AAAS,IAAT,OAAW,EAAE,CAAC,CAAC,EAAEF,GAAY,EAAE,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,SAAS,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,QAAQ,EAAE,EAAE,KAAK,GAAG,EAAE,QAAQ,EAAE,EAAE,KAAK,GAAG,EAAE,SAAS,EAAE,EAAE,KAAK,GAAG,EAAE,KAAK,EAAE,GAAG,EAAE,SAAS,OAAO,CAAC,CAAC,KAAM,GAAEF,GAAQ,EAAGC,GAAW,CAAC,EAAEK,GAAQ,EAAE,EAAE,CAAC,MAAM,MAAM,KAAK,CAAC,EAAE,KAAM,GAAE,GAAG,GAAG,CAAC,EAAE,MAAO,IAAG,EAAE,CAAC,EAAE,CAAC,SAAS,EAAE,SAAS,EAAE,UAAU,EAAE,MAAM,CAAC,CAAC,CAAC,eAAe,EAAE,EAAE,CAAC,MAAO,GAAE,MAAM,GAAG,EAAE,MAAO,GAAG,CAAC,KAAK,CAAC,EAAE,GAAG,EAAE,MAAM,GAAG,EAAE,MAAO,GAAE,KAAK,CAAC,EAAG,CAAC,YAAY,EAAE,EAAE,CAAC,GAAG,MAAM,QAAQ,EAAE,EAAE,EAAE,MAAO,GAAE,GAAG,KAAM,GAAG,KAAK,YAAY,EAAE,CAAC,CAAC,EAAG,KAAM,GAAE,EAAE,MAAO,QAAO,KAAK,CAAC,EAAE,MAAO,GAAG,EAAE,GAAG,MAAM,GAAG,EAAE,SAAS,EAAE,EAAE,CAAC,CAAE,OAAQ,UAAS,EAAE,EAAE,CAAC,MAAO,IAAI,IAAG,EAAE,EAAE,SAAS,EAAE,SAAS,CAAC,CAAC,CAAC,KAAM,IAAG,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,GAAG,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,IAAI,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,IAAI,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,GAAG,cAAc,GAAG,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,EAAE,EAAE,CAAC,GAAG,EAAE,EAAE,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,YAAY,EAAE,EAAE,EAAE,EAAE,CAAC,KAAK,GAAG,EAAE,KAAK,OAAO,EAAE,KAAK,SAAS,EAAE,KAAK,SAAS,EAAE,KAAK,UAAU,EAAE,CAAC,WAAW,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,GAAI,GAAE,KAAM,GAAE,CAAA,EAAG,EAAE,CAAE,EAAC,EAAE,CAAA,EAAG,EAAE,CAAA,EAAG,SAAU,KAAK,AAAQ,GAAE,KAAK,YAAf,MAA0B,AAAS,IAAT,OAAW,EAAE,CAAA,EAAG,CAAC,KAAM,GAAE,KAAK,kBAAkB,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,KAAK,EAAE,QAAQ,EAAE,EAAE,KAAK,GAAG,EAAE,QAAQ,EAAE,EAAE,KAAK,GAAG,EAAE,SAAS,EAAE,EAAE,KAAK,GAAG,EAAE,KAAK,EAAE,GAAG,EAAE,SAAS,OAAO,CAAC,CAAC,MAAM,CAAC,SAAS,GAAG,GAAG,CAAC,EAAE,SAAS,EAAE,UAAU,EAAE,MAAM,CAAC,CAAC,CAAC,kBAAkB,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,GAAI,GAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,KAAM,GAAE,EAAE,KAAK,GAAG,EAAE,EAAE,KAAK,GAAG,EAAE,EAAE,KAAK,GAAG,EAAE,EAAE,GAAG,GAAG,EAAE,EAAE,GAAG,GAAG,EAAE,EAAE,GAAG,GAAG,EAAE,CAAE,EAAC,EAAE,CAAA,EAAG,EAAE,CAAE,EAAC,EAAE,GAAG,EAAE,CAAC,EAAE,EAAE,KAAI,CAAC,GAAI,IAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,GAAE,KAAK,CAAC,GAAE,GAAE,GAAE,IAAG,EAAE,aAAa,KAAK,WAAW,EAAE,OAAO,CAAC,EAAE,GAAG,IAAE,IAAG,GAAG,GAAG,IAAE,IAAG,GAAG,GAAE,GAAE,GAAG,GAAE,GAAE,GAAG,EAAE,GAAI,CAAQ,IAAE,AAAQ,IAAE,EAAE,MAAZ,MAAiB,AAAS,KAAT,OAAW,OAAO,GAAE,MAA/C,MAAoD,AAAS,KAAT,OAAW,GAAE,EAAE,IAAI,GAAE,GAAE,EAAE,GAAI,CAAQ,IAAE,AAAQ,IAAE,EAAE,MAAZ,MAAiB,AAAS,KAAT,OAAW,OAAO,GAAE,MAA/C,MAAoD,AAAS,KAAT,OAAW,GAAE,EAAE,IAAI,GAAE,GAAE,EAAE,GAAI,CAAQ,IAAE,AAAQ,IAAE,EAAE,MAAZ,MAAiB,AAAS,KAAT,OAAW,OAAO,GAAE,MAA/C,MAAoD,AAAS,KAAT,OAAW,GAAE,EAAE,IAAI,GAAE,GAAE,EAAE,GAAI,CAAQ,IAAE,AAAQ,IAAE,EAAE,MAAZ,MAAiB,AAAS,KAAT,OAAW,OAAO,GAAE,MAA/C,MAAoD,AAAS,KAAT,OAAW,GAAE,EAAE,IAAI,GAAE,GAAE,KAAM,IAAE,GAAG,AAAQ,IAAE,EAAE,YAAZ,MAAuB,AAAS,KAAT,OAAW,GAAE,GAAG,EAAE,KAAK,GAAE,EAAE,GAAE,IAAI,GAAE,EAAE,GAAE,IAAI,GAAE,EAAE,GAAE,IAAI,GAAE,EAAE,GAAE,IAAI,GAAE,EAAE,GAAE,IAAI,GAAE,EAAE,GAAE,IAAI,GAAE,EAAE,GAAE,IAAI,GAAE,EAAE,GAAE,GAAG,EAAE,KAAM,IAAG,CAAQ,IAAE,EAAE,aAAZ,MAAwB,AAAS,KAAT,OAAW,GAAE,KAAK,GAAG,AAAQ,IAAE,AAAQ,IAAE,GAAG,EAAE,MAAM,EAAE,MAAvB,MAA4B,AAAS,KAAT,OAAW,OAAO,GAAE,KAAK,GAAG,CAAC,KAAnE,MAAuE,AAAS,KAAT,OAAW,GAAE,CAAC,EAAE,EAAE,CAAC,EAAE,EAAE,KAAK,GAAG,GAAE,GAAG,GAAE,GAAG,GAAE,GAAG,EAAC,EAAE,EAAE,KAAK,GAAG,EAAC,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,GAAG,CAAC,EAAE,CAAE,GAAQ,GAAE,AAAQ,GAAE,EAAE,SAAZ,MAAoB,AAAS,IAAT,OAAW,OAAO,EAAE,MAAlD,MAAuD,AAAS,IAAT,SAAkB,EAAE,UAAU,EAAE,MAAM,GAAG,UAAU,EAAE,EAAE,MAAM,GAAG,WAAW,EAAE,EAAE,MAAM,GAAG,CAAC,EAAE,GAAG,EAAE,EAAE,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,CAAE,GAAQ,GAAE,AAAQ,GAAE,EAAE,SAAZ,MAAoB,AAAS,IAAT,OAAW,OAAO,EAAE,QAAlD,MAAyD,AAAS,IAAT,SAAkB,EAAE,UAAU,EAAE,MAAM,KAAK,UAAU,EAAE,EAAE,MAAM,KAAK,WAAW,EAAE,EAAE,MAAM,KAAK,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,CAAE,GAAQ,GAAE,AAAQ,GAAE,EAAE,SAAZ,MAAoB,AAAS,IAAT,OAAW,OAAO,EAAE,SAAlD,MAA0D,AAAS,IAAT,SAAkB,EAAE,UAAU,EAAE,MAAM,MAAM,UAAU,EAAE,EAAE,MAAM,MAAM,WAAW,EAAE,EAAE,MAAM,MAAM,CAAC,EAAE,GAAG,EAAE,EAAE,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,CAAE,GAAQ,GAAE,AAAQ,GAAE,EAAE,SAAZ,MAAoB,AAAS,IAAT,OAAW,OAAO,EAAE,SAAlD,MAA0D,AAAS,IAAT,SAAkB,EAAE,UAAU,EAAE,MAAM,MAAM,UAAU,EAAE,EAAE,MAAM,MAAM,WAAW,EAAE,EAAE,MAAM,MAAM,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,CAAE,GAAQ,GAAE,AAAQ,GAAE,EAAE,SAAZ,MAAoB,AAAS,IAAT,OAAW,OAAO,EAAE,QAAlD,MAAyD,AAAS,IAAT,SAAkB,EAAE,UAAU,EAAE,MAAM,KAAK,UAAU,EAAE,EAAE,MAAM,KAAK,WAAW,EAAE,EAAE,MAAM,KAAK,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,CAAE,GAAQ,GAAE,AAAQ,GAAE,EAAE,SAAZ,MAAoB,AAAS,IAAT,OAAW,OAAO,EAAE,QAAlD,MAAyD,AAAS,IAAT,SAAkB,EAAE,UAAU,EAAE,MAAM,KAAK,UAAU,EAAE,EAAE,MAAM,KAAK,WAAW,EAAE,EAAE,MAAM,KAAK,CAAC,EAAE,GAAG,EAAE,EAAE,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,KAAM,GAAEN,GAAU,EAAC,GAAGC,GAAW,CAAC,EAAE,EAAE,SAAS,CAAC,KAAM,GAAEM,GAAa,GAAG,EAAE,SAAS,MAAM,EAAEL,GAAY,EAAE,EAAE,CAAC,EAAEM,GAAS,EAAE,EAAEJ,GAAW,EAAE,SAAS,KAAK,EAAE,GAAG,EAAE,SAAS,KAAK,EAAE,EAAE,SAAS,SAASE,GAAQ,EAAE,EAAE,GAAG,EAAE,SAAS,KAAK,EAAEG,GAAS,EAAE,CAAC,EAAEP,GAAY,EAAE,EAAE,CAAC,CAAC,CAAC,KAAM,GAAE,GAAI,cAAa,CAAC,EAAE,MAAO,IAAG,EAAE,CAAC,EAAE,CAAC,SAAS,EAAE,SAAS,EAAE,UAAU,EAAE,MAAM,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC,OAAQ,GAAE,EAAE,EAAE,WAAW,GAAG,GAAG,EAAE,AAAQ,GAAE,AAAQ,GAAE,KAAK,YAAf,MAA0B,AAAS,IAAT,OAAW,OAAO,EAAE,EAAE,MAAM,CAAC,MAAjE,MAAsE,AAAS,IAAT,OAAW,EAAE,GAAG,MAAO,GAAE,WAAW,YAAY,GAAI,GAAE,aAAa,GAAG,CAAC,CAAC,QAAQ,EAAE,CAAC,GAAI,GAAE,GAAG,CAAC,KAAK,WAAW,KAAK,OAAO,CAAC,KAAM,GAAE,EAAE,cAAc,KAAK,MAAM,EAAE,GAAG,CAAC,EAAE,MAAO,SAAQ,KAAK,UAAU,KAAK,wBAAwB,EAAE,IAAK,MAAK,UAAU,IAAI,EAAE,QAAQ,CAAC,EAAE,KAAK,UAAW,MAAK,SAAS,EAAE,UAAU,KAAK,UAAW,MAAK,SAAS,CAAA,GAAI,OAAO,KAAK,AAAQ,GAAE,EAAE,YAAZ,MAAuB,AAAS,IAAT,OAAW,EAAE,CAAA,CAAE,EAAE,QAAS,GAAG,CAAC,KAAK,SAAS,IAAK,MAAK,SAAS,GAAG,EAAE,SAAS,GAAG,CAAC,EAAG,KAAK,UAAU,EAAE,CAAC,OAAQ,UAAS,EAAE,EAAE,CAAC,GAAI,GAAE,EAAE,OAAO,MAAO,IAAG,CAAC,EAAE,WAAW,YAAY,GAAI,GAAE,aAAa,GAAG,GAAI,IAAG,EAAE,EAAE,EAAE,SAAS,EAAE,QAAQ,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,YAAY,EAAE,EAAE,EAAE,CAAC,KAAK,GAAG,EAAE,KAAK,QAAQ,KAAK,kBAAkB,EAAE,CAAC,CAAC,CAAC,YAAY,CAAC,MAAO,MAAK,OAAO,CAAC,kBAAkB,EAAE,EAAE,CAAC,KAAM,GAAE,KAAK,WAAW,KAAK,GAAG,cAAc,CAAC,EAAE,EAAE,KAAK,WAAW,KAAK,GAAG,gBAAgB,CAAC,EAAE,EAAE,KAAK,GAAG,cAAa,EAAG,GAAG,KAAK,GAAG,aAAa,EAAE,CAAC,EAAE,KAAK,GAAG,aAAa,EAAE,CAAC,EAAE,KAAK,GAAG,YAAY,CAAC,EAAE,CAAC,KAAK,GAAG,oBAAoB,EAAE,KAAK,GAAG,WAAW,EAAE,KAAM,IAAI,OAAM,kCAAkC,KAAK,GAAG,kBAAkB,CAAC,GAAG,EAAE,MAAO,EAAC,CAAC,WAAW,EAAE,EAAE,CAAC,KAAM,GAAE,KAAK,GAAG,aAAa,CAAC,EAAE,GAAG,KAAK,GAAG,aAAa,EAAE,CAAC,EAAE,KAAK,GAAG,cAAc,CAAC,EAAE,CAAC,KAAK,GAAG,mBAAmB,EAAE,KAAK,GAAG,cAAc,EAAE,CAAC,KAAM,GAAE,GAAI,OAAM,aAAa,IAAI,KAAK,GAAG,cAAc,SAAS,sBAAsB,KAAK,GAAG,iBAAiB,CAAC,GAAG,EAAE,KAAM,MAAK,GAAG,aAAa,CAAC,EAAE,CAAC,CAAC,MAAO,EAAC,CAAC,CAAC,YAAY,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,KAAM,GAAE,GAAI,IAAG,GAAG,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,EAAE,CAAC,cAAc,IAAI,CAAC,EAAE,MAAO,GAAE,QAAQ,CAAC,EAAE,EAAE,WAAW,EAAE,CAAA,EAAG,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,YAAY,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,KAAM,GAAE,EAAE,GAAG,GAAG,CAAC,KAAK,KAAK,KAAK,EAAE,EAAE,IAAI,IAAI,IAAI,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,EAAE,EAAE,GAAG,MAAO,IAAG,aAAa,IAAI,EAAE,EAAE,EAAE,GAAI,IAAG,GAAG,GAAG,CAAC,MAAM,mBAAmB,UAAU,KAAK,mBAAmB,QAAQ,EAAE,CAAC,CAAC,KAAK,CAAC,EAAE,EAAE,CAAC,EAAE,GAAG,CAAC,GAAG,EAAE,EAAE,EAAE,MAAM,CAAC,GAAG,CAAC,QAAQ,SAAS,UAAU,EAAE,SAAS,EAAE,EAAE,EAAE,KAAK,CAAC,QAAQ,SAAS,UAAU,EAAE,SAAS,EAAE,IAAI,EAAE,MAAM,CAAC,QAAQ,QAAQ,UAAU,EAAE,SAAS,EAAE,KAAK,EAAE,KAAK,CAAC,QAAQ,QAAQ,UAAU,EAAE,SAAS,EAAE,IAAI,EAAE,MAAM,CAAC,QAAQ,QAAQ,UAAU,EAAE,SAAS,EAAE,KAAK,EAAE,KAAK,CAAC,QAAQ,QAAQ,UAAU,EAAE,SAAS,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAM,IAAG,CAAC,kBAAkB,CAAC,EAAE,EAAE,EAAE,IAAI,GAAG,QAAQ,EAAE,SAAS,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC,EAAE,iBAAiB,CAAC,EAAE,EAAE,EAAE,IAAI,GAAG,OAAO,EAAE,SAAS,EAAE,KAAK,EAAE,EAAE,CAAC,EAAE,kBAAkB,CAAC,EAAE,EAAE,IAAI,SAAS,EAAE,EAAE,EAAE,EAAE,CAAC,MAAO,IAAG,kBAAkB,EAAE,EAAE,CAAE,EAAC,GAAI,IAAG,GAAG,GAAG,CAAC,EAAE,uBAAuB,EAAE,CAAC,CAAC,KAAK,CAAC,EAAE,EAAE,CAAC,EAAE,GAAG,CAAC,GAAG,GAAG,EAAE,EAAE,MAAM,CAAC,GAAG,CAAC,QAAQ,IAAI,EAAE,KAAK,CAAC,QAAQ,IAAI,EAAE,MAAM,CAAC,QAAQ,IAAI,EAAE,KAAK,CAAC,QAAQ,IAAI,EAAE,MAAM,CAAC,QAAQ,IAAI,EAAE,KAAK,CAAC,QAAQ,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,OAAO,EAAE,KAAK,CAAC,CAAC,EAAE,GAAG,GAAI,KAAI,OAAO,KAAK,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,YAAY,EAAE,EAAE,EAAE,EAAE,CAAC,GAAI,GAAE,EAAE,KAAK,GAAG,EAAE,KAAK,UAAU,EAAE,KAAK,UAAU,EAAE,KAAK,OAAO,GAAI,AAAM,GAAN,MAAe,EAAE,gBAAiB,QAAQ,KAAK,oFAAoF,EAAE,KAAK,UAAU,AAAQ,GAAE,AAAM,GAAN,KAAQ,OAAO,EAAE,aAA3B,MAAuC,AAAS,IAAT,OAAW,EAAE,GAAG,KAAK,wBAAwB,AAAQ,GAAE,AAAM,GAAN,KAAQ,OAAO,EAAE,2BAA3B,MAAqD,AAAS,IAAT,QAAY,EAAE,KAAK,cAAc,GAAI,IAAG,EAAE;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAAuc;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,CAAoW,EAAE,WAAY,EAAC,KAAK,kBAAkB,GAAI,IAAG,EAAE;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAA8O;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,CAA+H,EAAE,WAAY,EAAC,KAAK,mBAAmB,GAAI,IAAG,EAAE;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAAoP;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,CAA+H,EAAE,WAAY,EAAC,KAAK,uBAAwB,EAAC,KAAK,YAAY,KAAK,iBAAiB,KAAK,eAAe,KAAK,kBAAiB,EAAG,KAAK,sBAAsB,KAAK,yBAA0B,EAAC,KAAK,aAAa,KAAK,gBAAiB,EAAC,KAAK,WAAW,KAAK,eAAc,EAAG,KAAK,aAAa,KAAK,cAAc,KAAK,WAAY,CAAA,CAAC,aAAa,EAAE,CAAC,KAAK,UAAU,EAAE,KAAK,uBAAwB,EAAC,KAAK,YAAY,KAAK,eAAc,EAAG,KAAK,sBAAsB,KAAK,yBAA0B,CAAA,CAAC,YAAY,CAAC,KAAK,GAAG,OAAO,KAAK,GAAG,UAAU,EAAE,KAAK,GAAG,UAAU,KAAK,GAAG,MAAM,EAAE,KAAK,GAAG,OAAO,KAAK,GAAG,KAAK,EAAE,KAAK,GAAG,UAAU,KAAK,GAAG,UAAU,KAAK,GAAG,mBAAmB,EAAE,KAAK,GAAG,OAAO,KAAK,GAAG,SAAS,EAAE,KAAK,GAAG,SAAS,KAAK,GAAG,IAAI,CAAC,CAAC,iBAAiB,CAAC,KAAM,GAAE,KAAK,GAAG,cAAa,EAAG,MAAO,MAAK,GAAG,YAAY,KAAK,GAAG,WAAW,CAAC,EAAE,KAAK,GAAG,WAAW,KAAK,GAAG,WAAW,EAAE,KAAK,GAAG,KAAK,KAAK,GAAG,KAAK,KAAK,GAAG,cAAc,KAAK,UAAU,gBAAiB,CAAA,EAAE,KAAK,GAAG,eAAe,KAAK,GAAG,UAAU,EAAE,KAAK,GAAG,cAAc,KAAK,GAAG,WAAW,KAAK,GAAG,mBAAmB,KAAK,GAAG,OAAO,EAAE,CAAC,CAAC,gBAAgB,CAAC,KAAM,GAAE,GAAG,KAAK,GAAG,IAAI,EAAE,KAAK,GAAG,OAAO,YAAY,KAAK,GAAG,OAAO,aAAa,EAAEF,GAAU,EAAC,MAAOU,IAAc,EAAE,EAAE,EAAE,GAAG,GAAG,EAAE,CAAC,CAAC,SAAS,EAAE,CAAC,KAAM,GAAE,EAAE,KAAK,IAAI,EAAE,EAAE,EAAG,GAAE,GAAG,EAAE,EAAE,GAAG,EAAE,EAAE,KAAK,IAAI,EAAE,EAAE,EAAG,GAAE,GAAG,EAAE,EAAE,GAAG,EAAE,EAAE,KAAK,IAAI,EAAE,EAAE,EAAG,GAAE,GAAG,EAAE,EAAE,GAAG,MAAO,MAAK,OAAO,IAAK,MAAK,OAAO,GAAG,CAAA,GAAI,KAAK,OAAO,GAAG,IAAK,MAAK,OAAO,GAAG,GAAG,CAAE,GAAE,KAAK,OAAO,GAAG,GAAG,IAAK,MAAK,OAAO,GAAG,GAAG,GAAG,CAAC,UAAU,CAAE,EAAC,mBAAmB,CAAE,EAAC,WAAW,CAAA,EAAG,eAAe,CAAE,EAAC,QAAQ,GAAG,QAAQ,CAAA,EAAG,YAAY,CAAC,GAAG,KAAK,OAAO,GAAG,GAAG,EAAE,CAAC,uBAAuB,EAAE,CAAC,GAAI,GAAE,KAAM,GAAE,CAAC,EAAE,EAAE,IAAI,CAAC,KAAM,GAAEV,KAAWE,GAAY,EAAE,EAAE,CAAC,EAAE,GAAG,EAAE,SAAS,CAAC,EAAE,EAAE,UAAU,KAAK,EAAE,QAAQ,EAAE,EAAE,mBAAmB,KAAK,GAAG,EAAE,QAAQ,EAAE,EAAE,WAAW,KAAK,GAAG,EAAE,SAAS,EAAE,OAAQ,GAAE,EAAE,EAAE,EAAE,SAAS,OAAO,GAAG,GAAG,CAAC,KAAM,GAAEK,GAAa,EAAE,SAAS,GAAG,EAAE,SAAS,EAAE,GAAG,EAAE,SAAS,EAAE,EAAE,EAAE,EAAEA,GAAa,EAAE,SAAS,EAAE,GAAG,EAAE,SAAS,EAAE,GAAG,EAAE,SAAS,EAAE,EAAE,EAAE,EAAEA,GAAa,EAAE,SAAS,EAAE,GAAG,EAAE,SAAS,EAAE,GAAG,EAAE,SAAS,EAAE,EAAE,EAAEI,GAAW,EAAE,EAAE,CAAC,EAAEA,GAAW,EAAE,EAAE,CAAC,EAAEC,GAAQ,EAAE,EAAE,CAAC,EAAEC,GAAY,EAAE,CAAC,EAAE,EAAE,QAAQ,KAAK,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,OAAQ,GAAE,EAAE,EAAE,EAAE,SAAS,OAAO,EAAE,GAAG,EAAE,EAAE,eAAe,KAAK,GAAG,CAAC,EAAE,EAAE,QAAQ,KAAK,GAAG,EAAE,KAAK,EAAE,EAAE,aAAa,EAAE,SAAS,OAAO,CAAC,EAAE,EAAE,GAAG,CAAC,EAAE,UAAU,CAAE,EAAC,EAAE,mBAAmB,CAAA,EAAG,EAAE,WAAW,CAAE,EAAC,EAAE,eAAe,CAAA,EAAG,EAAE,QAAQ,GAAG,EAAE,QAAQ,CAAE,EAAC,EAAE,YAAY,CAAC,EAAE,EAAE,GAAG,CAAC,EAAE,OAAQ,MAAK,aAAa,EAAE,OAAO,SAAS,KAAK,GAAG,aAAa,GAAG,GAAG,EAAE,SAAS,CAAC,EAAE,KAAK,aAAa,EAAE,OAAO,SAAS,KAAK,GAAG,aAAa,GAAI,cAAa,EAAE,kBAAkB,CAAC,EAAE,KAAK,aAAa,EAAE,OAAO,UAAU,KAAK,GAAG,aAAa,GAAI,cAAa,EAAE,UAAU,CAAC,EAAE,KAAK,aAAa,EAAE,OAAO,OAAO,KAAK,GAAG,aAAa,GAAI,cAAa,EAAE,OAAO,CAAC,EAAE,KAAK,aAAa,EAAE,OAAO,SAAS,KAAK,GAAG,aAAa,GAAI,cAAa,EAAE,cAAc,CAAC,EAAE,KAAK,aAAa,EAAE,OAAO,MAAM,KAAK,GAAG,qBAAqB,GAAI,aAAY,EAAE,OAAO,CAAC,EAAE,EAAE,OAAO,OAAO,EAAE,QAAQ,QAAQ,EAAE,OAAO,CAAC,SAAS,KAAK,aAAa,KAAK,GAAG,aAAa,GAAG,GAAG,EAAE,SAAS,CAAC,EAAE,SAAS,KAAK,aAAa,KAAK,GAAG,aAAa,GAAI,cAAa,EAAE,kBAAkB,CAAC,EAAE,UAAU,KAAK,aAAa,KAAK,GAAG,aAAa,GAAI,cAAa,EAAE,UAAU,CAAC,EAAE,SAAS,KAAK,aAAa,KAAK,GAAG,aAAa,GAAI,cAAa,EAAE,cAAc,CAAC,EAAE,OAAO,KAAK,aAAa,KAAK,GAAG,aAAa,GAAI,cAAa,EAAE,OAAO,CAAC,EAAE,MAAM,KAAK,aAAa,KAAK,GAAG,qBAAqB,GAAI,aAAY,EAAE,OAAO,CAAC,EAAE,OAAO,EAAE,QAAQ,MAAM,CAAC,EAAE,GAAI,GAAE,EAAE,EAAE,QAAS,GAAG,CAAC,KAAM,GAAE,KAAK,SAAS,CAAC,EAAE,EAAE,CAAC,CAAC,GAAI,KAAK,OAAO,QAAS,GAAG,EAAE,QAAS,GAAG,EAAE,QAAS,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,EAAM,EAAC,SAAU,KAAK,MAAK,UAAU,UAAS,EAAG,CAAC,KAAM,GAAE,EAAE,MAAM,QAAO,EAAG,EAAE,EAAE,MAAM,cAAe,EAAC,EAAE,AAAQ,GAAE,KAAK,UAAU,0BAA0B,CAAC,KAApD,MAAwD,AAAS,IAAT,OAAW,EAAE,CAAE,EAAC,OAAO,QAAQ,CAAC,EAAE,QAAS,CAAC,CAAC,EAAE,KAAK,CAAC,EAAE,IAAK,GAAE,GAAG,EAAE,CAAG,EAAC,KAAM,GAAE,CAAC,KAAK,MAAM,EAAE,IAAI,GAAG,KAAK,SAAS,EAAE,KAAK,MAAM,EAAE,IAAI,GAAG,KAAK,SAAS,EAAE,KAAK,MAAM,EAAE,IAAI,GAAG,KAAK,SAAS,CAAC,EAAE,GAAG,GAAG,CAAC,EAAE,KAAM,GAAGC,GAAS,EAAE,CAAC,CAAC,EAAG,SAAS,KAAM,GAAE,KAAK,SAAS,CAAC,EAAE,GAAG,CAAC,KAAM,GAAE,KAAK,UAAU,mBAAmB,CAAC,EAAE,EAAE,CAAC,GAAG,KAAK,UAAU,EAAE,EAAE,EAAE,EAAE,KAAK,KAAK,UAAU,EAAE,EAAE,IAAI,EAAE,KAAK,KAAK,UAAU,EAAE,EAAE,IAAI,EAAE,KAAK,KAAK,UAAU,EAAE,EAAE,IAAI,EAAE,MAAM,KAAK,UAAU,EAAE,EAAE,KAAK,EAAE,MAAM,KAAK,UAAU,EAAE,EAAE,KAAK,CAAC,EAAE,GAAI,GAAE,EAAE,WAAW,EAAE,EAAE,KAAK,UAAU,KAAK,UAAU,EAAE,YAAY,CAAC,EAAE,EAAE,EAAE,EAAE,IAAI,CAAC,GAAG,GAAG,IAAI,CAAC,GAAI,GAAE,GAAG,GAAG,EAAE,YAAY,EAAE,KAAK,UAAU,CAAC,EAAE,EAAE,EAAE,EAAE,IAAI,CAAC,EAAE,OAAO,EAAN,CAAS,QAAQ,MAAM,yBAAyB,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,QAAS,GAAG,CAAC,KAAM,GAAE,KAAK,SAAS,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAG,KAAK,OAAO,QAAS,GAAG,EAAE,QAAS,GAAG,EAAE,QAAS,GAAG,CAAC,EAAE,CAAC,CAAC,CAAG,CAAA,CAAI,CAAA,CAAC,UAAU,EAAE,EAAE,CAAC,GAAI,GAAE,EAAE,KAAM,GAAE,AAAQ,GAAE,KAAK,UAAU,SAAS,GAAE,QAAQ,EAAE,IAAI,CAAC,CAAC,KAApD,MAAwD,AAAS,IAAT,OAAW,OAAO,EAAE,MAAM,MAAM,CAAC,CAAC,GAAK,GAAQ,GAAE,KAAK,UAAU,cAAc,EAAE,QAAS,CAAA,KAAlD,MAAsD,AAAS,IAAT,SAAkB,EAAE,OAAQ,CAAE,KAAI,EAAE,IAAI,EAAE,MAAM,WAAW,EAAE,MAAM,QAAO,GAAI,EAAE,QAAO,EAAG,CAAC,gBAAgB,CAAC,KAAK,CAAC,EAAE,EAAE,GAAG,KAAK,UAAU,QAAO,EAAG,EAAE,CAAE,EAAC,EAAE,CAAA,EAAG,EAAE,KAAK,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,OAAQ,GAAE,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,OAAQ,GAAE,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,OAAQ,GAAE,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,KAAK,GAAG,GAAG,GAAG,GAAG,GAAG,EAAE,EAAE,MAAM,CAAC,SAAS,KAAK,aAAa,KAAK,GAAG,aAAa,GAAI,cAAa,CAAC,CAAC,EAAE,MAAM,KAAK,aAAa,KAAK,GAAG,aAAa,GAAI,cAAa,CAAC,CAAC,EAAE,OAAO,EAAE,OAAO,CAAC,CAAC,CAAC,mBAAmB,CAAC,KAAM,GAAE,CAAA,EAAG,EAAE,CAAE,EAAC,MAAO,MAAK,QAAQ,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,SAAS,KAAK,aAAa,KAAK,GAAG,aAAa,GAAI,cAAa,CAAC,CAAC,EAAE,MAAM,KAAK,aAAa,KAAK,GAAG,aAAa,GAAI,cAAa,CAAC,CAAC,EAAE,OAAO,EAAE,OAAO,CAAC,CAAC,CAAC,0BAA0B,CAAC,GAAG,CAAC,KAAK,wBAAwB,OAAO,KAAM,GAAE,KAAK,UAAU,QAAS,EAAC,EAAE,CAAE,EAAC,EAAE,GAAG,OAAQ,GAAE,EAAE,EAAE,EAAE,GAAG,GAAG,EAAE,OAAQ,GAAE,EAAE,EAAE,EAAE,GAAG,GAAG,EAAE,OAAQ,GAAE,EAAE,EAAE,EAAE,GAAG,GAAG,EAAE,CAAC,KAAM,GAAE,KAAK,UAAU,SAAS,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,AAAS,IAAT,QAAa,CAAO,IAAP,KAAS,KAAK,QAAQ,EAAE,EAAE,CAAC,EAAE,IAAI,GAAG,EAAE,CAAC,EAAE,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,EAAE,MAAM,EAAE,MAAM,EAAE,KAAK,CAAC,EAAE,AAAkB,EAAE,MAAM,QAAO,IAAjC,gBAAoC,KAAK,QAAQ,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,EAAE,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,CAAC,EAAE,AAAuB,EAAE,MAAM,QAAO,IAAtC,sBAA0C,KAAK,QAAQ,EAAE,EAAE,CAAC,GAAG,EAAE,EAAE,EAAE,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,CAAC,EAAE,CAAC,MAAM,CAAC,SAAS,KAAK,aAAa,KAAK,GAAG,aAAa,GAAI,cAAa,CAAC,CAAC,EAAE,MAAM,KAAK,aAAa,KAAK,GAAG,aAAa,GAAI,cAAa,CAAC,CAAC,EAAE,OAAO,EAAE,OAAO,CAAC,CAAC,CAAC,QAAQ,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,KAAK,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,KAAK,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,KAAK,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,KAAK,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,KAAK,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,KAAK,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,KAAK,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,KAAK,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,KAAK,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,KAAK,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,KAAK,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,KAAK,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,EAAE,OAAQ,GAAE,EAAE,EAAE,GAAG,GAAG,EAAE,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC,aAAa,EAAE,EAAE,CAAC,KAAM,GAAE,KAAK,GAAG,aAAc,EAAC,MAAO,MAAK,GAAG,WAAW,EAAE,CAAC,EAAE,KAAK,GAAG,WAAW,EAAE,EAAE,KAAK,GAAG,YAAY,EAAE,CAAC,CAAC,aAAa,EAAE,EAAE,EAAE,CAAC,KAAK,GAAG,WAAW,EAAE,CAAC,EAAE,KAAK,GAAG,WAAW,EAAE,EAAE,KAAK,GAAG,WAAW,CAAC,CAAC,SAAS,EAAE,CAAC,KAAK,UAAU,KAAK,iBAAiB,EAAE,KAAK,cAAc,UAAU,EAAE,KAAK,YAAY,QAAQ,EAAE,KAAK,cAAc,YAAY,EAAE,KAAK,YAAY,KAAK,EAAE,KAAK,WAAW,QAAQ,CAAC,EAAE,KAAK,WAAW,QAAQ,KAAK,UAAU,EAAE,KAAK,GAAG,WAAW,KAAK,GAAG,MAAM,EAAE,KAAK,YAAY,MAAM,CAAC,CAAC,oBAAoB,EAAE,CAAC,KAAK,yBAA0B,MAAK,UAAU,KAAK,iBAAiB,EAAE,KAAK,cAAc,UAAU,EAAE,KAAK,sBAAsB,QAAQ,EAAE,KAAK,cAAc,YAAY,EAAE,KAAK,sBAAsB,KAAK,EAAE,KAAK,WAAW,QAAQ,CAAC,EAAE,KAAK,WAAW,QAAQ,KAAK,UAAU,EAAE,KAAK,GAAG,WAAW,KAAK,GAAG,MAAM,EAAE,KAAK,sBAAsB,MAAM,EAAE,CAAC,cAAc,EAAE,CAAC,KAAK,UAAU,KAAK,aAAa,EAAE,KAAK,GAAG,cAAc,KAAK,GAAG,QAAQ,EAAE,KAAK,GAAG,YAAY,KAAK,GAAG,WAAW,KAAK,YAAY,EAAE,KAAK,WAAW,QAAQ,CAAC,EAAE,KAAK,WAAW,QAAQ,KAAK,UAAU,EAAE,KAAK,OAAO,QAAS,GAAG,CAAC,EAAE,QAAS,GAAG,CAAC,EAAE,QAAS,GAAG,CAAC,EAAE,QAAS,MAAK,cAAc,UAAU,EAAE,EAAE,OAAO,QAAQ,EAAE,KAAK,cAAc,WAAW,EAAE,EAAE,OAAO,QAAQ,EAAE,KAAK,cAAc,YAAY,EAAE,EAAE,OAAO,SAAS,EAAE,KAAK,cAAc,SAAS,EAAE,EAAE,OAAO,MAAM,EAAE,KAAK,GAAG,WAAW,KAAK,GAAG,qBAAqB,EAAE,OAAO,KAAK,EAAE,KAAK,GAAG,aAAa,KAAK,GAAG,UAAU,EAAE,OAAO,OAAO,KAAK,GAAG,eAAe,CAAC,EAAE,CAAG,CAAA,CAAG,CAAA,EAAG,CAAC,qBAAqB,EAAE,CAAC,KAAK,UAAU,KAAK,kBAAkB,EAAE,KAAK,WAAW,QAAQ,CAAC,EAAE,KAAK,WAAW,QAAQ,KAAK,UAAU,EAAE,KAAK,OAAO,QAAS,GAAG,CAAC,EAAE,QAAS,GAAG,CAAC,EAAE,QAAS,GAAG,CAAC,EAAE,QAAS,MAAK,cAAc,UAAU,EAAE,EAAE,OAAO,QAAQ,EAAE,KAAK,cAAc,WAAW,EAAE,EAAE,OAAO,QAAQ,EAAE,KAAK,GAAG,WAAW,KAAK,GAAG,qBAAqB,EAAE,OAAO,KAAK,EAAE,KAAK,GAAG,aAAa,KAAK,GAAG,UAAU,EAAE,OAAO,OAAO,KAAK,GAAG,eAAe,CAAC,EAAE,CAAC,CAAE,CAAG,CAAA,CAAG,CAAA,CAAC,YAAY,EAAE,EAAE,CAAC,KAAK,UAAU,KAAK,iBAAiB,EAAE,KAAK,cAAc,UAAU,EAAE,KAAK,eAAe,QAAQ,EAAE,KAAK,cAAc,YAAY,EAAE,KAAK,eAAe,KAAK,EAAE,KAAM,GAAEd,GAAQ,EAAGe,GAAO,EAAE,CAAC,EAAEb,GAAY,EAAE,EAAE,CAAC,EAAE,KAAK,WAAW,QAAQ,CAAC,EAAE,KAAK,WAAW,QAAQ,KAAK,UAAU,EAAE,KAAK,GAAG,WAAW,KAAK,GAAG,MAAM,EAAE,KAAK,eAAe,MAAM,CAAC,CAAC,YAAY,EAAE,EAAE,EAAE,EAAE,CAAC,KAAK,GAAG,SAAS,EAAE,EAAE,EAAE,CAAC,EAAE,KAAK,WAAW,KAAK,eAAgB,CAAA,CAAC,UAAU,EAAE,CAAC,KAAK,GAAG,WAAW,CAAC,EAAE,KAAK,aAAa,CAAC,CAAC,cAAc,EAAE,EAAE,EAAE,CAAC,KAAM,GAAE,KAAK,GAAG,kBAAkB,KAAK,aAAa,CAAC,EAAE,KAAK,GAAG,WAAW,KAAK,GAAG,aAAa,CAAC,EAAE,KAAK,GAAG,oBAAoB,EAAE,EAAE,KAAK,GAAG,MAAM,GAAG,EAAE,CAAC,EAAE,KAAK,GAAG,wBAAwB,CAAC,CAAC,CAAC,WAAW,EAAE,EAAE,CAAC,KAAM,GAAE,KAAK,GAAG,mBAAmB,KAAK,aAAa,CAAC,EAAE,KAAK,GAAG,iBAAiB,EAAE,GAAG,CAAC,CAAC,CAAC,CAC743C;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,gFAagF,YAAY,EAAE,EAAE,EAAE,EAAE,CAAC,MAAO,IAAI,IAAI,GAAE,UAAW,SAAS,EAAE,EAAE,CAAC,WAAW,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC,CAAC,OAAO,EAAN,CAAS,EAAE,CAAC,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,MAAM,CAAC,CAAC,CAAC,OAAO,EAAN,CAAS,EAAE,CAAC,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC,GAAI,GAAE,EAAE,KAAK,EAAE,EAAE,KAAK,EAAG,GAAE,EAAE,MAAM,YAAa,GAAE,EAAE,GAAI,GAAG,SAAS,EAAE,CAAC,EAAE,CAAC,CAAC,CAAG,GAAE,KAAK,EAAE,CAAC,CAAC,CAAC,EAAG,GAAE,EAAE,MAAM,EAAE,GAAG,CAAA,CAAE,GAAG,KAAI,CAAE,CAAC,CAAC,CAAE,CAAC,MAAM,EAAE,CAAC,YAAY,EAAE,EAAE,CAAC,KAAK,IAAI,EAAE,KAAK,MAAM,EAAE,KAAK,KAAK,GAAG,EAAE,KAAK,CAAC,iBAAiB,CAAC,MAAO,MAAK,GAAG,CAAC,aAAa,EAAE,CAAC,GAAI,GAAE,MAAO,AAAQ,GAAE,KAAK,MAAM,MAArB,MAA0B,AAAS,IAAT,OAAW,EAAE,CAAC,EAAE,EAAE,KAAK,KAAK,KAAK,IAAI,CAAC,OAAQ,WAAU,EAAE,CAAC,MAAO,IAAG,KAAK,OAAO,OAAQ,WAAW,CAAC,KAAM,GAAE,KAAK,KAAK,OAAO,KAAK,CAAC,EAAE,OAAO,CAAC,EAAE,EAAE,KAAK,IAAI,EAAE,KAAK,KAAK,KAAK,IAAI,CAAC,EAAE,KAAK,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,SAAS,cAAc,QAAQ,EAAE,EAAE,MAAM,EAAE,EAAE,OAAO,EAAE,KAAM,GAAE,EAAE,WAAW,IAAI,EAAE,KAAK,mBAAmB,CAAC,EAAE,KAAM,GAAE,CAAA,EAAG,GAAI,GAAE,EAAE,MAAO,MAAM,SAAQ,IAAI,OAAO,KAAK,CAAC,EAAE,IAAK,GAAG,GAAG,KAAK,OAAO,OAAQ,WAAW,CAAC,KAAM,GAAE,EAAE,EAAE,EAAE,KAAK,MAAM,EAAE,CAAC,EAAE,GAAG,EAAE,EAAE,GAAG,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,KAAM,GAAE,KAAM,mBAAkB,EAAE,EAAE,EAAE,EAAE,UAAU,EAAE,EAAE,EAAE,GAAG,GAAG,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,EAAK,CAAA,EAAE,GAAI,IAAG,EAAE,aAAa,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,CAAG,CAAA,OAAQ,QAAO,CAAC,KAAM,GAAE,SAAS,cAAc,QAAQ,EAAE,EAAE,MAAM,GAAG,EAAE,OAAO,GAAG,KAAM,GAAE,EAAE,WAAW,IAAI,EAAE,MAAO,IAAG,mBAAmB,CAAC,EAAE,GAAI,IAAG,EAAE,aAAa,EAAE,EAAE,GAAG,EAAE,EAAE,CAAE,CAAA,CAAC,OAAQ,oBAAmB,EAAE,CAAC,EAAE,UAAU,QAAQ,EAAE,SAAS,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,UAAU,UAAU,EAAE,SAAS,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,SAAS,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,CAAI,GAAC,IAAG,GAAG,EAAG,GAAG,GAAG,EAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,AAAC,UAAS,EAAE,CAAC,WAAW,EAAE,EAAE,CAAC,MAAM,AAAU,OAAO,IAAjB,SAAmB,GAAI,GAAE,EAAE,AAAM,GAAN,KAAQ,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,OAAO,SAAS,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,MAAO,IAAI,GAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,WAAW,SAAS,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,MAAO,IAAI,GAAE,EAAE,CAAC,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC,YAAY,EAAE,EAAE,CAAC,KAAK,IAAI,EAAE,KAAK,IAAI,CAAC,CAAC,SAAS,EAAE,CAAC,KAAM,GAAG,CAAU,MAAO,IAAjB,SAAmB,EAAE,EAAE,KAAK,KAAK,IAAI,EAAE,KAAK,IAAK,CAAU,MAAO,IAAjB,SAAmB,EAAE,EAAE,KAAK,MAAO,GAAE,EAAE,EAAE,KAAK,IAAI,EAAE,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,MAAO,IAAI,GAAE,KAAK,IAAI,KAAK,IAAI,EAAE,GAAG,EAAE,KAAK,IAAI,KAAK,IAAI,EAAE,GAAG,CAAC,CAAC,OAAQ,UAAS,EAAE,CAAC,GAAI,GAAE,GAAG,AAAU,MAAO,IAAjB,SAAmB,MAAO,IAAI,GAAE,EAAE,CAAC,EAAE,KAAK,CAAC,EAAE,GAAG,AAAQ,GAAE,EAAE,UAAU,EAAG,GAAG,EAAE,WAAW,CAAC,CAAC,KAA3C,MAAgD,AAAS,IAAT,OAAW,EAAE,CAAA,EAAG,MAAO,IAAI,GAAE,AAAM,GAAN,KAAQ,EAAE,EAAE,AAAM,GAAN,KAAQ,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC,YAAY,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,KAAK,YAAY,EAAE,KAAK,SAAS,EAAE,KAAK,gBAAgB,EAAE,KAAK,QAAQ,EAAE,KAAK,MAAM,EAAE,KAAK,UAAU,EAAE,KAAK,OAAO,CAAC,CAAC,SAAS,EAAE,CAAC,MAAO,IAAE,KAAK,YAAY,SAAS,EAAE,WAAW,CAAC,EAAE,GAAE,KAAK,SAAS,SAAS,EAAE,QAAQ,CAAC,EAAE,GAAE,KAAK,gBAAgB,SAAS,EAAE,eAAe,CAAC,EAAE,GAAE,KAAK,QAAQ,SAAS,EAAE,OAAO,CAAC,EAAE,GAAE,KAAK,MAAM,SAAS,EAAE,KAAK,CAAC,EAAE,GAAE,KAAK,UAAU,SAAS,EAAE,SAAS,CAAC,EAAE,GAAE,KAAK,OAAO,EAAE,MAAM,CAAC,CAAC,OAAO,CAAC,MAAM,CAAC,KAAK,YAAY,KAAK,SAAS,KAAK,gBAAgB,KAAK,QAAQ,KAAK,MAAM,KAAK,UAAU,GAAI,GAAE,KAAK,OAAO,KAAK,MAAM,CAAC,CAAC,OAAQ,UAAS,EAAE,CAAC,GAAI,GAAE,EAAE,KAAM,GAAE,AAAQ,GAAE,EAAE,WAAW,CAAC,KAAxB,MAA4B,AAAS,IAAT,OAAW,EAAE,CAAA,EAAG,MAAO,IAAI,GAAE,EAAE,SAAS,EAAE,WAAW,EAAE,EAAE,SAAS,EAAE,QAAQ,EAAE,EAAE,SAAS,EAAE,eAAe,EAAE,EAAE,SAAS,EAAE,OAAO,EAAE,EAAE,SAAS,EAAE,KAAK,EAAE,EAAE,SAAS,EAAE,SAAS,EAAE,AAAQ,GAAE,EAAE,QAAQ,EAAE,MAAM,KAA5B,MAAgC,AAAS,IAAT,OAAW,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,WAAW,EAAE,MAAM,CAAC,CAAC,YAAY,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,KAAK,YAAY,EAAE,KAAK,SAAS,EAAE,KAAK,gBAAgB,EAAE,KAAK,QAAQ,EAAE,KAAK,MAAM,EAAE,KAAK,UAAU,CAAC,IAAK,SAAQ,CAAC,MAAO,EAAC,CAAC,SAAS,CAAC,MAAM,CAAC,KAAK,YAAY,KAAK,SAAS,KAAK,gBAAgB,KAAK,QAAQ,KAAK,MAAM,KAAK,UAAU,KAAK,MAAM,CAAC,CAAC,CAAC,EAAE,YAAY,EAAE,EAAE,WAAW,KAAK,CAAC,YAAY,EAAE,CAAC,KAAK,OAAO,EAAE,KAAK,MAAM,GAAI,GAAE,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,MAAO,MAAK,MAAM,OAAO,EAAG,CAAC,EAAE,IAAI,EAAE,SAAS,CAAC,EAAG,CAAC,EAAE,MAAM,CAAC,CAAC,YAAY,EAAE,CAAC,KAAK,KAAK,EAAE,MAAM,EAAE,IAAK,CAAC,CAAC,EAAE,KAAK,GAAI,GAAE,EAAE,CAAC,CAAC,CAAE,CAAC,OAAQ,OAAM,EAAE,CAAC,GAAG,AAAI,EAAE,SAAN,EAAa,MAAO,GAAE,GAAG,GAAG,EAAE,QAAQ,EAAE,kBAAkB,CAAC,KAAM,GAAE,EAAE,IAAK,GAAG,CAAC,GAAI,GAAE,EAAE,OAAQ,GAAE,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC,KAAM,GAAE,EAAE,MAAM,GAAG,GAAG,KAAK,IAAK,GAAE,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC,EAAG,KAAM,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,GAAG,EAAG,IAAK,CAAC,CAAC,KAAK,KAAK,CAAC,EAAG,MAAO,IAAI,GAAE,CAAC,CAAC,CAAC,GAAI,GAAE,EAAE,EAAE,EAAE,GAAG,EAAE,CAAE,EAAC,OAAQ,GAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,UAAU,CAAC,EAAE,GAAI,GAAE,EAAE,SAAU,KAAK,GAAE,GAAG,EAAE,KAAK,EAAE,KAAK,EAAE,EAAE,GAAI,GAAE,EAAE,EAAE,EAAE,CAAC,MAAO,GAAE,EAAE,KAAK,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,UAAU,CAAC,EAAE,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,EAAE,GAAI,GAAE,EAAE,IAAK,GAAG,EAAE,MAAM,EAAE,QAAQ,CAAC,CAAE,CAAC,OAAQ,MAAK,EAAE,EAAE,EAAE,CAAC,MAAO,GAAE,IAAK,GAAG,CAAC,KAAM,GAAE,EAAE,MAAM,GAAG,EAAG,GAAE,IAAI,EAAE,KAAK,EAAE,MAAM,CAAC,IAAI,EAAE,KAAK,IAAI,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC,CAAC,EAAG,KAAM,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,GAAG,EAAG,IAAK,CAAC,CAAC,KAAK,KAAK,EAAG,OAAQ,WAAU,EAAE,CAAC,KAAM,GAAE,CAAA,EAAG,GAAI,GAAE,CAAA,EAAG,KAAM,GAAE,KAAK,IAAI,GAAG,KAAK,MAAM,KAAK,IAAI,EAAE,OAAO,GAAG,EAAE,KAAK,IAAI,EAAE,CAAC,CAAC,EAAE,SAAU,KAAK,GAAE,EAAE,KAAK,CAAC,EAAE,EAAE,OAAO,GAAI,GAAE,KAAK,GAAI,GAAE,CAAC,CAAC,EAAE,EAAE,IAAI,MAAO,AAAI,GAAE,SAAN,GAAc,EAAE,KAAK,GAAI,GAAE,CAAC,CAAC,EAAE,CAAC,OAAQ,MAAK,EAAE,CAAC,GAAI,GAAE,EAAE,SAAU,KAAK,GAAE,GAAG,KAAK,IAAI,EAAE,IAAI,EAAE,GAAG,EAAE,MAAO,EAAC,CAAC,OAAO,EAAE,EAAE,CAAC,MAAO,MAAK,KAAK,OAAO,EAAE,UAAU,CAAC,EAAE,MAAK,CAAE,CAAC,CAAC,EAAE,kBAAkB,GAAG,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC,YAAY,EAAE,CAAC,KAAK,MAAM,CAAC,CAAC,SAAS,EAAE,CAAC,GAAI,GAAE,EAAE,OAAQ,GAAE,EAAE,EAAE,EAAE,GAAG,EAAE,GAAG,GAAE,KAAK,MAAM,GAAG,SAAS,EAAE,EAAE,CAAC,EAAE,MAAO,EAAC,CAAC,CAAC,EAAE,MAAM,EAAE,MAAM,SAAU,EAAC,CAAC,YAAY,EAAE,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC,EAAE,KAAK,SAAS,CAAC,OAAQ,YAAW,EAAE,CAAC,GAAI,GAAE,CAAC,GAAG,MAAM,CAAC,CAAC,EAAE,IAAK,IAAI,GAAI,GAAE,IAAI,IAAI,CAAC,EAAG,SAAU,KAAK,GAAE,EAAE,CAAC,GAAG,MAAM,CAAC,CAAC,EAAE,IAAK,CAAC,EAAE,IAAI,EAAE,GAAG,MAAM,EAAE,MAAM,EAAE,CAAG,EAAC,MAAO,EAAC,CAAC,OAAO,EAAE,EAAE,CAAC,GAAI,GAAE,IAAI,EAAE,KAAK,SAAU,KAAK,MAAK,SAAS,CAAC,KAAM,GAAE,EAAE,EAAE,CAAC,EAAE,GAAG,GAAG,EAAE,SAAS,KAAM,GAAE,EAAE,OAAO,EAAE,CAAC,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,GAAG,GAAI,GAAE,EAAE,EAAE,EAAE,CAAC,MAAO,EAAC,CAAC,CAAC,EAAE,SAAS,EAAE,MAAM,SAAU,EAAC,CAAC,YAAY,EAAE,EAAE,CAAC,MAAM,EAAE,MAAK,CAAE,EAAE,KAAK,MAAM,CAAC,CAAC,QAAQ,CAAC,MAAO,KAAI,CAAC,CAAC,EAAE,MAAM,CAAC,GAAE,IAAK,IAAG,CAAA,EAAG,EAAE,MAAM,EAAE,CAAC,YAAY,EAAE,CAAC,KAAK,MAAM,CAAC,CAAC,UAAU,CAAC,MAAO,MAAK,KAAK,OAAQ,UAAS,EAAE,CAAC,GAAI,GAAE,EAAE,KAAM,GAAE,AAAQ,GAAE,EAAE,WAAW,CAAC,KAAxB,MAA4B,AAAS,IAAT,OAAW,EAAE,CAAE,EAAC,EAAE,AAAQ,GAAE,EAAE,WAAW,EAAE,KAAK,KAA9B,MAAkC,AAAS,IAAT,OAAW,EAAE,qBAAqB,MAAO,IAAI,IAAG,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,YAAY,EAAE,CAAC,KAAK,WAAW,CAAC,CAAC,SAAS,EAAE,EAAE,EAAE,EAAE,CAAC,KAAM,GAAE,EAAE,EAAE,EAAE,CAAC,EAAE,MAAO,MAAK,WAAW,KAAK,CAAC,CAAC,OAAQ,UAAS,EAAE,CAAC,GAAI,GAAE,EAAE,KAAM,GAAE,AAAQ,GAAE,EAAE,WAAW,CAAC,KAAxB,MAA4B,AAAS,IAAT,OAAW,EAAE,CAAE,EAAC,EAAG,CAAQ,GAAE,EAAE,UAAU,EAAE,OAAQ,GAAG,CAAC,GAAI,GAAE,MAAO,IAAG,CAAC,GAAI,GAAE,MAAM,CAAC,MAAM,AAAQ,GAAE,EAAE,WAAW,EAAE,KAAK,KAA9B,MAAkC,AAAS,IAAT,OAAW,EAAE,qBAAqB,WAAW,GAAG,WAAW,SAAS,EAAE,UAAU,CAAC,CAAC,GAAG,AAAQ,GAAE,EAAE,WAAW,CAAC,KAAxB,MAA4B,AAAS,IAAT,OAAW,EAAE,CAAA,CAAE,CAAC,MAA3O,MAAiP,AAAS,IAAT,OAAW,EAAE,CAAE,GAAE,IAAK,GAAG,CAAC,EAAE,WAAW,IAAI,EAAE,KAAK,CAAC,EAAG,MAAO,IAAI,IAAG,GAAI,IAAG,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAE,CAAC,YAAY,EAAE,EAAE,EAAE,CAAC,KAAK,cAAc,EAAE,KAAK,cAAc,EAAE,KAAK,kBAAkB,CAAC,OAAQ,WAAU,EAAE,CAAC,MAAM,CAAC,MAAM,GAAG,EAAE,GAAG,OAAO,IAAI,CAAC,CAAC,OAAQ,UAAS,EAAE,CAAC,GAAI,GAAE,KAAM,GAAE,AAAQ,GAAE,EAAE,WAAW,CAAC,KAAxB,MAA4B,AAAS,IAAT,OAAW,EAAE,CAAE,EAAC,MAAO,IAAI,GAAG,GAAE,SAAS,EAAE,OAAO,KAAK,SAAS,EAAE,GAAE,SAAS,EAAE,OAAO,KAAK,SAAS,EAAE,GAAE,SAAS,EAAE,WAAW,KAAK,SAAS,CAAC,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC,OAAO,KAAK,cAAc,OAAM,EAAG,OAAO,KAAK,cAAc,OAAQ,EAAC,WAAW,KAAK,kBAAkB,OAAQ,CAAA,CAAC,CAAC,OAAO,EAAE,CAAC,MAAO,MAAK,cAAc,MAAM,CAAC,EAAE,EAAG,aAAa,CAAC,OAAO,EAAE,CAAC,MAAO,MAAK,cAAc,MAAM,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC,MAAO,MAAK,kBAAkB,MAAM,CAAC,CAAC,OAAQ,OAAM,EAAE,EAAE,EAAE,CAAC,MAAM,CAAC,WAAW,EAAE,QAAQ,EAAE,UAAU,EAAE,OAAO,KAAK,gBAAgB,CAAC,CAAC,CAAC,OAAQ,iBAAgB,EAAE,CAAC,MAAO,GAAE,CAAE,MAAK,IAAI,KAAK,IAAI,CAAC,EAAE,QAAQ,EAAE,UAAU,OAAQ,YAAW,CAAC,KAAM,GAAE,KAAK,yBAAyB,KAAK,EAAE,EAAE,GAAG,EAAE,KAAK,GAAG,EAAE,EAAE,EAAE,KAAK,yBAAyB,IAAI,IAAI,GAAG,GAAG,IAAI,KAAK,GAAG,EAAE,EAAE,EAAE,KAAK,yBAAyB,IAAI,IAAI,GAAG,GAAG,IAAI,KAAK,GAAG,EAAE,EAAE,EAAE,KAAK,yBAAyB,GAAG,IAAI,GAAG,EAAE,IAAI,IAAI,GAAG,EAAE,EAAE,EAAE,GAAI,GAAG,KAAK,UAAU,EAAE,SAAS,KAAK,IAAI,EAAE,SAAS,MAAM,MAAM,EAAE,SAAS,KAAK,MAAM,EAAE,SAAS,KAAK,IAAI,EAAE,SAAS,KAAK,IAAI,EAAE,SAAS,KAAK,CAAC,EAAE,SAAS,KAAK,CAAC,EAAE,SAAS,IAAI,CAAC,EAAE,SAAS,IAAI,CAAC,EAAE,SAAS,EAAE,CAAC,EAAE,EAAE,GAAI,GAAG,KAAK,UAAU,EAAE,SAAS,KAAK,IAAI,EAAE,SAAS,KAAK,KAAK,iBAAiB,KAAK,EAAE,CAAC,EAAE,SAAS,IAAI,KAAK,iBAAiB,KAAK,EAAE,CAAC,EAAE,SAAS,IAAI,KAAK,iBAAiB,KAAK,EAAE,CAAC,EAAE,SAAS,IAAI,KAAK,iBAAiB,KAAK,EAAE,CAAC,EAAE,EAAE,GAAI,GAAG,KAAK,UAAU,EAAE,SAAS,IAAI,CAAC,EAAE,SAAS,IAAI,KAAK,6BAA6B,EAAE,GAAG,EAAE,CAAC,CAAC,EAAE,SAAS,IAAI,KAAK,6BAA6B,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,MAAO,IAAI,GAAG,EAAE,EAAE,CAAC,CAAC,OAAQ,kBAAiB,EAAE,EAAE,CAAC,KAAM,GAAE,GAAI,GAAG,KAAK,SAAS,EAAE,SAAS,IAAI,GAAG,EAAE,SAAS,GAAG,CAAC,EAAE,EAAE,GAAI,GAAG,KAAK,OAAO,EAAE,SAAS,IAAI,CAAC,EAAE,SAAS,IAAI,GAAI,GAAG,KAAK,SAAS,EAAE,SAAS,KAAK,GAAG,EAAE,SAAS,IAAI,IAAI,CAAC,EAAE,SAAS,KAAK,CAAC,EAAE,SAAS,KAAK,CAAC,EAAE,SAAS,IAAI,GAAI,GAAG,KAAK,SAAS,EAAE,SAAS,KAAK,IAAI,EAAE,SAAS,IAAI,GAAG,CAAC,EAAE,SAAS,IAAI,CAAC,EAAE,GAAG,EAAE,CAAC,KAAM,GAAE,GAAI,GAAG,KAAK,SAAS,EAAE,SAAS,EAAE,CAAC,EAAE,SAAS,GAAG,IAAI,EAAE,EAAE,GAAI,GAAG,KAAK,MAAM,EAAE,SAAS,IAAI,CAAC,EAAE,SAAS,KAAK,CAAC,EAAE,EAAE,SAAS,IAAI,CAAC,EAAE,SAAS,IAAI,CAAC,EAAE,SAAS,IAAI,CAAC,EAAE,SAAS,IAAI,CAAC,CAAC,KAAK,CAAC,KAAM,GAAE,GAAI,GAAG,KAAK,MAAM,EAAE,SAAS,IAAI,CAAC,EAAE,SAAS,KAAK,IAAI,EAAE,EAAE,GAAI,GAAG,KAAK,MAAM,EAAE,SAAS,IAAI,CAAC,EAAE,SAAS,GAAG,IAAI,EAAE,EAAE,SAAS,IAAI,CAAC,EAAE,SAAS,GAAG,CAAC,EAAE,SAAS,IAAI,CAAC,EAAE,SAAS,IAAI,CAAC,EAAE,SAAS,IAAI,CAAC,CAAC,CAAC,MAAO,EAAC,OAAQ,0BAAyB,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,KAAM,GAAE,KAAK,mCAAmC,EAAE,EAAE,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,KAAK,mCAAmC,EAAE,EAAE,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,KAAK,mCAAmC,EAAE,CAAC,EAAE,EAAE,KAAK,YAAY,EAAE,IAAI,GAAG,EAAE,EAAE,GAAG,GAAG,EAAE,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,KAAK,YAAY,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,KAAK,YAAY,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,KAAK,YAAY,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,GAAI,GAAG,KAAK,MAAM,EAAE,SAAS,GAAG,CAAC,EAAE,SAAS,IAAI,CAAC,EAAE,SAAS,EAAE,EAAE,GAAG,EAAE,EAAE,KAAK,YAAY,KAAK,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,GAAI,GAAG,KAAK,OAAO,EAAE,SAAS,KAAK,CAAC,EAAE,SAAS,IAAI,CAAC,EAAE,SAAS,IAAI,CAAC,EAAE,SAAS,KAAK,CAAC,EAAE,SAAS,IAAI,CAAC,EAAE,SAAS,GAAG,CAAC,EAAE,MAAO,IAAG,EAAE,SAAS,GAAG,CAAC,EAAE,SAAS,IAAI,CAAC,EAAE,SAAS,IAAI,CAAC,EAAE,SAAS,IAAI,CAAC,EAAE,EAAE,SAAS,GAAG,CAAC,EAAE,CAAC,OAAQ,oCAAmC,EAAE,EAAE,CAAC,KAAM,GAAE,GAAI,GAAG,KAAK,MAAM,EAAE,EAAE,KAAK,wBAAwB,GAAG,EAAE,GAAG,EAAE,EAAE,KAAK,wBAAwB,EAAE,EAAE,GAAG,EAAE,EAAE,KAAK,+CAA+C,CAAC,EAAE,GAAG,KAAK,GAAG,EAAE,EAAE,CAAC,KAAM,GAAE,KAAK,wBAAwB,KAAK,EAAE,GAAG,EAAE,EAAE,KAAK,wBAAwB,KAAK,EAAE,GAAG,EAAE,EAAE,KAAK,eAAe,EAAE,EAAE,GAAG,IAAI,EAAE,EAAE,SAAS,GAAG,EAAE,CAAC,EAAE,EAAE,SAAS,KAAK,CAAC,EAAE,EAAE,SAAS,KAAK,CAAC,EAAE,KAAM,GAAE,KAAK,wBAAwB,EAAE,EAAE,GAAG,EAAE,EAAE,KAAK,eAAe,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,SAAS,EAAE,IAAI,CAAC,EAAE,EAAE,SAAS,EAAE,EAAE,CAAC,EAAE,EAAE,SAAS,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,KAAM,GAAE,KAAK,eAAe,EAAE,EAAE,GAAG,CAAC,EAAE,EAAG,GAAE,SAAS,GAAG,KAAK,IAAI,GAAG,CAAC,CAAC,EAAE,EAAE,SAAS,EAAE,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,GAAG,EAAE,SAAS,GAAG,EAAE,CAAC,EAAE,EAAE,SAAS,EAAE,EAAE,CAAC,CAAC,CAAC,MAAO,EAAC,OAAQ,yBAAwB,EAAE,EAAE,EAAE,CAAC,KAAM,GAAE,UAAW,GAAE,MAAO,GAAE,GAAI,GAAE,IAAI,GAAI,GAAE,GAAG,MAAO,GAAE,EAAE,KAAK,IAAI,EAAE,MAAM,EAAE,KAAK,IAAI,EAAE,CAAC,CAAC,OAAQ,gDAA+C,EAAE,CAAC,MAAM,IAAI,GAAE,GAAI,WAAW,GAAE,GAAI,GAAE,KAAK,IAAI,OAAQ,gBAAe,EAAE,EAAE,EAAE,EAAE,CAAC,MAAO,GAAE,GAAI,GAAE,EAAE,OAAQ,aAAY,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,KAAM,GAAE,KAAK,IAAI,GAAI,GAAE,GAAG,CAAC,EAAE,EAAE,EAAG,GAAE,GAAG,MAAO,IAAI,GAAG,KAAK,MAAM,EAAE,SAAS,GAAG,EAAE,CAAC,EAAE,SAAS,IAAI,EAAE,KAAK,IAAI,EAAE,CAAC,CAAC,EAAE,SAAS,EAAE,EAAE,CAAC,EAAE,SAAS,GAAG,EAAE,EAAG,GAAE,EAAE,EAAE,SAAS,EAAE,EAAE,GAAI,GAAE,EAAE,CAAC,OAAQ,8BAA6B,EAAE,EAAE,EAAE,EAAE,CAAC,KAAM,GAAE,KAAK,2BAA2B,EAAE,CAAC,EAAE,EAAE,KAAK,2BAA2B,EAAE,CAAC,EAAE,MAAO,IAAI,GAAG,KAAK,OAAO,EAAE,SAAS,GAAG,CAAC,EAAE,SAAS,KAAK,CAAC,EAAE,SAAS,OAAO,CAAC,EAAE,SAAS,MAAM,CAAC,CAAC,OAAQ,4BAA2B,EAAE,EAAE,CAAC,KAAM,GAAE,EAAG,gBAAgB,EAAE,EAAE,EAAG,GAAE,EAAG,gBAAgB,SAAS,GAAG,EAAE,MAAO,IAAI,GAAG,KAAK,MAAM,EAAE,SAAS,EAAE,CAAC,EAAE,SAAS,EAAE,EAAE,EAAE,KAAK,+BAA+B,CAAC,EAAE,CAAC,EAAE,SAAS,EAAE,EAAE,EAAE,KAAK,+BAA+B,CAAC,EAAE,CAAC,CAAC,OAAQ,gCAA+B,EAAE,CAAC,MAAO,IAAI,GAAG,EAAG,SAAS,EAAE,SAAS,KAAK,IAAI,CAAC,EAAE,SAAS,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,EAAG,cAAc,QAAQ,EAAG,UAAU,GAAG,CAAC,GAAI,GAAE,KAAM,GAAE,AAAQ,GAAE,EAAE,WAAW,CAAC,KAAxB,MAA4B,AAAS,IAAT,OAAW,EAAE,aAAa,MAAO,GAAG,UAAU,CAAC,CAAC,EAAE,EAAG,WAAW,EAAG,UAAU,YAAY,EAAE,EAAG,QAAQ,EAAG,UAAU,SAAS,EAAE,EAAG,UAAU,EAAG,UAAU,WAAW,EAAE,EAAG,OAAO,EAAG,UAAU,QAAQ,EAAE,SAAS,EAAE,CAAC,EAAE,SAAS,SAAS,EAAE,CAAC,MAAM,CAAC,EAAE,EAAE,EAAE,IAAI,CAAC,SAAU,KAAK,GAAE,CAAC,KAAM,GAAE,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,GAAG,EAAE,MAAO,EAAC,CAAC,MAAO,KAAI,CAAC,CAAC,EAAE,IAAK,IAAG,GAAG,EAAE,SAAS,EAAE,CAAC,WAAW,EAAE,CAAC,MAAO,GAAE,OAAO,CAAC,CAAC,EAAE,SAAS,SAAS,EAAE,CAAC,GAAI,GAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,KAAM,GAAE,AAAQ,GAAE,EAAE,WAAW,CAAC,KAAxB,MAA4B,AAAS,IAAT,OAAW,EAAE,GAAG,MAAM,CAAC,KAAK,AAAQ,GAAE,EAAE,QAAQ,EAAE,KAAK,KAA3B,MAA+B,AAAS,IAAT,OAAW,EAAE,EAAE,OAAO,AAAQ,GAAE,EAAE,QAAQ,EAAE,MAAM,KAA5B,MAAgC,AAAS,IAAT,OAAW,EAAE,IAAI,OAAO,AAAQ,GAAE,EAAE,QAAQ,EAAE,eAAe,KAArC,MAAyC,AAAS,IAAT,OAAW,EAAE,EAAE,MAAM,AAAQ,GAAE,EAAE,QAAQ,EAAE,aAAa,KAAnC,MAAuC,AAAS,IAAT,OAAW,EAAE,EAAE,SAAS,GAAE,SAAS,EAAE,QAAQ,EAAE,SAAS,GAAG,SAAS,EAAE,SAAS,EAAE,YAAY,GAAG,SAAS,EAAE,YAAY,EAAE,cAAc,EAAG,SAAS,EAAE,cAAc,EAAE,oBAAoB,AAAQ,GAAE,EAAE,YAAY,EAAE,qBAAqB,KAA/C,MAAmD,AAAS,IAAT,QAAY,EAAE,YAAY,AAAQ,GAAE,EAAE,YAAY,EAAE,SAAS,KAAnC,MAAuC,AAAS,IAAT,QAAY,EAAE,eAAe,AAAQ,GAAE,EAAE,YAAY,EAAE,YAAY,KAAtC,MAA0C,AAAS,IAAT,QAAY,CAAC,CAAC,EAAE,EAAE,WAAW,EAAE,EAAE,UAAU,SAAS,EAAE,CAAC,MAAO,GAAE,QAAQ,CAAC,EAAE,EAAE,WAAW,SAAS,EAAE,CAAC,MAAO,GAAE,OAAO,EAAE,CAAC,CAAC,EAAE,EAAE,SAAS,SAAS,EAAE,CAAC,MAAO,MAAK,MAAM,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,GAAK,GAAG,CAAE,EAAC,EAAE,SAAS,EAAE,CAAC,EAAE,SAAS,SAAS,EAAE,CAAC,GAAI,GAAE,EAAE,EAAE,EAAE,KAAM,GAAE,AAAQ,GAAE,EAAE,WAAW,CAAC,KAAxB,MAA4B,AAAS,IAAT,OAAW,EAAE,GAAG,MAAM,CAAC,OAAO,AAAQ,GAAE,EAAE,WAAW,EAAE,MAAM,KAA/B,MAAmC,AAAS,IAAT,OAAW,EAAE,EAAE,KAAK,AAAQ,GAAE,EAAE,QAAQ,EAAE,IAAI,KAA1B,MAA8B,AAAS,IAAT,OAAW,EAAE,EAAE,OAAO,AAAQ,GAAE,EAAE,QAAQ,EAAE,MAAM,KAA5B,MAAgC,AAAS,IAAT,OAAW,EAAE,CAAC,CAAC,EAAE,EAAE,MAAM,SAAS,EAAE,EAAE,EAAE,CAAC,GAAG,EAAE,MAAM,EAAE,MAAO,GAAE,KAAM,GAAG,GAAE,EAAE,QAAQ,EAAE,KAAK,MAAO,IAAE,EAAE,OAAO,EAAE,CAAC,CAAC,CAAC,EAAE,IAAK,IAAG,CAAE,EAAC,EAAE,MAAM,EAAE,CAAC,YAAY,EAAE,EAAE,CAAC,KAAK,MAAM,EAAE,KAAK,OAAO,EAAE,KAAK,SAAS,EAAE,KAAK,SAAS,EAAE,KAAK,SAAS,EAAE,KAAK,SAAS,EAAE,KAAK,SAAS,EAAE,KAAK,SAAS,EAAE,KAAK,SAAS,EAAE,KAAK,SAAS,EAAE,KAAK,UAAU,EAAE,KAAK,UAAU,EAAE,KAAK,UAAU,EAAE,KAAK,UAAU,EAAE,KAAK,QAAQ,EAAE,KAAK,QAAQ,EAAE,KAAK,MAAM,EAAE,KAAK,OAAO,GAAG,cAAc,EAAE,WAAW,EAAE,WAAW,EAAE,KAAK,OAAO,GAAG,cAAc,EAAE,WAAW,EAAE,WAAW,CAAC,OAAQ,eAAc,EAAE,EAAE,CAAC,KAAM,GAAE,MAAM,EAAE,CAAC,EAAE,OAAQ,GAAE,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,GAAG,MAAM,EAAE,CAAC,EAAE,MAAO,EAAC,CAAC,yBAAyB,CAAC,KAAK,UAAU,KAAK,OAAO,KAAK,MAAM,UAAU,CAAC,CAAC,aAAa,EAAE,CAAC,KAAK,UAAU,KAAK,OAAO,KAAK,MAAM,WAAW,EAAE,CAAC,CAAC,CAAC,UAAU,EAAE,EAAE,CAAC,KAAM,GAAE,EAAG,UAAU,KAAK,MAAM,SAAS,KAAK,EAAE,EAAE,EAAG,WAAW,KAAK,MAAM,SAAS,KAAK,EAAE,EAAE,EAAE,EAAE,OAAQ,GAAE,EAAE,EAAE,KAAK,MAAM,YAAY,EAAE,GAAG,EAAE,CAAC,KAAM,GAAG,MAAK,MAAM,WAAW,GAAG,EAAE,OAAQ,GAAE,EAAE,EAAE,KAAK,MAAM,WAAW,EAAE,GAAG,EAAE,CAAC,KAAM,GAAG,MAAK,MAAM,mBAAmB,GAAG,EAAE,EAAE,GAAG,GAAG,KAAK,OAAO,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,aAAa,EAAE,EAAE,CAAC,KAAK,SAAS,KAAK,OAAO,GAAG,GAAG,KAAK,SAAS,KAAK,OAAO,EAAE,GAAG,GAAG,KAAK,SAAS,KAAK,OAAO,GAAG,GAAG,KAAK,SAAS,KAAK,OAAO,EAAE,GAAG,GAAG,KAAK,SAAS,KAAK,OAAO,GAAG,EAAE,GAAG,KAAK,SAAS,KAAK,OAAO,EAAE,GAAG,EAAE,GAAG,KAAK,SAAS,KAAK,OAAO,GAAG,EAAE,GAAG,KAAK,SAAS,KAAK,OAAO,EAAE,GAAG,EAAE,EAAE,CAAC,WAAW,EAAE,CAAC,KAAK,UAAU,EAAE,EAAE,KAAK,SAAS,KAAK,QAAQ,EAAE,KAAK,UAAU,EAAE,EAAE,KAAK,SAAS,KAAK,QAAQ,EAAE,KAAK,UAAU,EAAE,EAAE,KAAK,SAAS,KAAK,QAAQ,EAAE,KAAK,UAAU,EAAE,EAAE,KAAK,SAAS,KAAK,QAAQ,CAAC,CAAC,WAAW,EAAE,CAAC,KAAK,QAAQ,EAAE,EAAE,KAAK,UAAU,KAAK,SAAS,EAAE,KAAK,QAAQ,EAAE,EAAE,KAAK,UAAU,KAAK,SAAS,CAAC,CAAC,WAAW,EAAE,CAAC,KAAK,MAAM,EAAE,EAAE,KAAK,QAAQ,KAAK,OAAO,CAAC,CAAC,QAAQ,CAAC,MAAO,MAAK,KAAK,CAAC,YAAY,CAAC,CAAC,KAAK,OAAO,KAAK,MAAM,EAAE,CAAC,KAAK,OAAO,KAAK,MAAM,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,YAAY,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,KAAK,YAAY,EAAE,KAAK,WAAW,EAAE,KAAK,mBAAmB,EAAE,KAAK,QAAQ,EAAE,KAAK,SAAS,EAAE,KAAM,GAAE,EAAG,UAAU,EAAE,KAAK,EAAE,KAAK,WAAW,KAAK,MAAM,EAAE,CAAC,EAAE,KAAK,WAAW,KAAK,MAAM,EAAE,CAAC,EAAE,KAAK,YAAY,GAAG,EAAE,KAAK,YAAY,GAAG,EAAE,KAAK,cAAc,CAAA,EAAG,KAAM,GAAE,EAAE,GAAG,EAAE,KAAK,UAAU,MAAM,EAAE,CAAC,EAAE,OAAQ,GAAE,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,KAAM,GAAE,KAAK,YAAY,EAAE,KAAK,UAAU,GAAG,MAAM,EAAE,CAAC,EAAE,OAAQ,GAAE,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,KAAM,GAAE,KAAK,YAAY,EAAE,KAAK,UAAU,GAAG,GAAG,EAAE,UAAU,EAAE,CAAC,CAAC,CAAC,CAAC,KAAK,wBAAwB,GAAI,KAAI,KAAK,UAAU,EAAE,oBAAoB,KAAK,EAAE,EAAE,kBAAkB,CAAC,CAAC,aAAa,EAAE,EAAE,CAAC,MAAO,MAAK,UAAU,EAAE,KAAK,aAAa,EAAE,KAAK,YAAY,CAAC,2BAA2B,EAAE,EAAE,CAAC,MAAO,IAAE,KAAK,wBAAwB,GAAE,OAAO,EAAE,CAAC,EAAG,IAAI,CAAC,KAAM,GAAE,EAAE,KAAK,YAAY,EAAE,EAAE,KAAK,YAAY,EAAE,KAAK,UAAU,OAAO,EAAE,GAAG,GAAG,GAAG,GAAG,EAAE,GAAG,EAAE,EAAE,KAAK,UAAU,GAAG,GAAG,YAAY,KAAK,QAAQ,UAAU,EAAE,CAAC,EAAE,YAAY,MAAO,MAAK,QAAQ,2BAA2B,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC,EAAG,CAAC,wBAAwB,EAAE,CAAC,KAAM,GAAE,GAAI,IAAG,KAAK,CAAC,EAAE,MAAO,MAAK,cAAc,KAAK,CAAC,EAAE,EAAE,OAAO,KAAK,CAAC,CAAC,CAAC,yBAAyB,CAAC,KAAK,cAAc,QAAS,GAAG,EAAE,wBAAyB,CAAA,CAAE,CAAC,aAAa,EAAE,CAAC,KAAK,cAAc,QAAS,GAAG,EAAE,aAAa,CAAC,CAAG,CAAA,CAAC,aAAa,EAAE,EAAE,CAAC,KAAK,cAAc,QAAS,GAAG,EAAE,aAAa,EAAE,CAAC,CAAC,CAAE,CAAC,WAAW,EAAE,CAAC,KAAK,cAAc,QAAS,GAAG,EAAE,WAAW,CAAC,CAAC,CAAE,CAAC,WAAW,EAAE,CAAC,KAAK,cAAc,QAAS,GAAG,EAAE,WAAW,CAAC,CAAG,CAAA,CAAC,WAAW,EAAE,CAAC,KAAK,cAAc,QAAS,GAAG,EAAE,WAAW,CAAC,CAAG,CAAA,CAAC,YAAY,CAAC,KAAK,cAAc,QAAS,GAAG,EAAE,WAAY,CAAA,CAAE,CAAC,gCAAgC,EAAE,EAAE,EAAE,CAAC,MAAO,MAAK,UAAU,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,AAAC,UAAS,EAAE,CAAC,EAAE,OAAO,SAAS,EAAE,EAAE,EAAE,CAAC,MAAM,CAAC,OAAO,EAAE,OAAO,EAAE,WAAW,CAAC,CAAC,CAAC,GAAE,IAAK,IAAG,CAAE,EAAC,EAAE,SAAS,EAAE,CAAC,KAAM,GAAE,GAAI,KAAI,WAAW,EAAE,EAAE,EAAE,CAAC,KAAM,GAAE,OAAO,OAAO,CAAC,KAAK,aAAa,GAAG,EAAE,GAAE,OAAO,EAAE,CAAC,CAAC,EAAE,MAAO,GAAE,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,YAAY,EAAE,cAAc,IAAI,CAAC,IAAI,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,WAAW,EAAE,aAAa,GAAG,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,gBAAgB,EAAE,kBAAkB,GAAG,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,QAAQ,EAAE,UAAU,GAAG,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,kBAAkB,EAAE,oBAAoB,IAAI,CAAC,IAAI,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,iBAAiB,EAAE,mBAAmB,IAAI,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,sBAAsB,EAAE,wBAAwB,IAAI,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,cAAc,EAAE,gBAAgB,IAAI,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,MAAM,EAAE,QAAQ,GAAG,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,MAAM,EAAE,SAAS,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,OAAO,EAAE,SAAS,GAAG,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,gBAAgB,EAAE,kBAAkB,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,iBAAiB,EAAE,mBAAmB,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,aAAa,EAAE,eAAe,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,uBAAuB,EAAE,yBAAyB,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,uBAAuB,EAAE,yBAAyB,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,uBAAuB,EAAE,yBAAyB,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,eAAe,EAAE,iBAAiB,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,eAAe,EAAE,iBAAiB,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,oBAAoB,EAAE,sBAAsB,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,uBAAuB,EAAE,yBAAyB,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,oBAAoB,EAAE,sBAAsB,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,8BAA8B,EAAE,gCAAgC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,cAAc,EAAE,gBAAgB,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC,EAAE,EAAE,WAAW,EAAE,aAAa,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,YAAY,EAAE,cAAc,GAAG,CAAC,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,OAAO,EAAE,SAAS,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,iBAAiB,EAAE,mBAAmB,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,eAAe,EAAE,iBAAiB,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,eAAe,EAAE,iBAAiB,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,OAAO,EAAE,SAAS,IAAI,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,QAAQ,EAAE,UAAU,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,kBAAkB,EAAE,oBAAoB,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,YAAY,SAAS,EAAE,EAAE,CAAC,MAAO,IAAI,IAAG,EAAE,WAAW,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,GAAK,GAAG,CAAE,EAAC,EAAE,MAAM,EAAE,CAAC,YAAY,EAAE,EAAE,EAAE,EAAE,GAAG,CAAC,KAAK,SAAS,EAAE,KAAK,oBAAoB,EAAE,KAAM,GAAE,EAAE,eAAe,EAAG,GAAE,GAAI,GAAE,CAAC,EAAE,EAAE,OAAO,CAAC,GAAG,eAAc,EAAG,EAAG,MAAK,aAAa,GAAI,IAAG,GAAI,GAAE,CAAC,EAAE,EAAE,SAAS,EAAG,UAAU,CAAC,EAAE,EAAG,WAAW,CAAC,CAAC,EAAE,KAAK,iBAAiB,GAAI,IAAG,GAAI,GAAE,CAAC,EAAE,GAAE,OAAO,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,cAAc,GAAI,IAAG,GAAI,GAAE,EAAE,OAAO,CAAC,CAAC,EAAE,GAAE,OAAO,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,YAAY,GAAI,IAAG,GAAI,GAAE,EAAE,OAAO,CAAC,CAAC,EAAE,GAAE,OAAO,EAAE,CAAC,CAAC,CAAC,CAAC,GAAI,MAAK,aAAa,GAAI,IAAG,EAAE,WAAW,mBAAmB,EAAE,EAAE,SAAS,EAAG,UAAU,CAAC,EAAE,EAAG,WAAW,CAAC,CAAC,EAAE,KAAK,iBAAiB,EAAG,YAAY,EAAE,EAAE,EAAG,kBAAkB,EAAG,WAAW,EAAE,KAAK,cAAc,EAAG,YAAY,EAAE,EAAE,EAAG,iBAAiB,EAAG,UAAU,EAAE,KAAK,YAAY,EAAG,YAAY,EAAE,EAAG,KAAK,GAAG,KAAK,qBAAqB,EAAG,YAAY,EAAE,EAAE,EAAG,sBAAsB,EAAG,eAAe,EAAE,KAAK,aAAa,EAAG,YAAY,EAAE,EAAE,EAAG,cAAc,EAAG,OAAO,EAAE,KAAK,eAAe,EAAG,YAAY,EAAE,EAAG,KAAK,EAAE,KAAK,YAAY,EAAG,YAAY,EAAE,EAAG,MAAM,EAAE,KAAK,wBAAwB,EAAG,YAAY,EAAE,EAAG,eAAe,EAAE,KAAK,yBAAyB,EAAG,YAAY,EAAE,EAAG,gBAAgB,EAAE,KAAK,iBAAiB,EAAG,YAAY,EAAE,EAAG,YAAY,EAAE,KAAK,8BAA8B,EAAG,YAAY,EAAE,EAAG,sBAAsB,EAAE,KAAK,2BAA2B,EAAG,YAAY,EAAE,EAAG,sBAAsB,EAAE,KAAK,8BAA8B,EAAG,YAAY,EAAE,EAAG,sBAAsB,EAAE,KAAK,kBAAkB,EAAG,YAAY,EAAE,EAAG,cAAc,EAAE,KAAK,kBAAkB,EAAG,YAAY,EAAE,EAAG,cAAc,EAAE,KAAK,2BAA2B,EAAG,YAAY,EAAE,EAAG,mBAAmB,EAAE,KAAK,8BAA8B,EAAG,YAAY,EAAE,EAAG,sBAAsB,EAAE,KAAK,wBAAwB,EAAG,YAAY,EAAE,EAAG,mBAAmB,EAAE,KAAK,4BAA4B,EAAG,YAAY,EAAE,EAAG,6BAA6B,EAAE,KAAK,iBAAiB,EAAG,YAAY,EAAE,EAAG,aAAa,EAAE,KAAK,WAAW,EAAG,YAAY,EAAE,EAAG,UAAU,EAAE,KAAK,YAAY,EAAG,YAAY,EAAE,EAAG,WAAW,EAAE,KAAM,GAAE,EAAE,KAAK,EAAE,EAAE,EAAE,EAAE,OAAO,KAAK,kBAAkB,KAAK,uBAAuB,EAAG,YAAY,EAAE,EAAG,MAAM,EAAE,EAAE,EAAE,GAAG,CAAC,EAAE,KAAK,qBAAqB,KAAK,uBAAuB,EAAG,YAAY,EAAE,EAAG,gBAAgB,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,KAAK,kBAAkB,KAAK,uBAAuB,EAAG,YAAY,EAAE,EAAG,cAAc,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,KAAK,kBAAkB,KAAK,uBAAuB,EAAG,YAAY,EAAE,EAAG,cAAc,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,KAAK,YAAY,EAAG,YAAY,EAAE,EAAG,MAAM,EAAE,KAAK,OAAO,EAAE,cAAc,KAAK,UAAU,GAAG,EAAE,wBAAyB,CAAC,EAAE,EAAE,IAAI,KAAK,0BAA0B,EAAE,EAAE,EAAE,EAAE,aAAa,GAAG,EAAE,GAAG,CAAC,EAAE,WAAW,CAAC,CAAE,CAAC,uBAAuB,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,KAAM,GAAE,CAAC,EAAE,EAAE,IAAI,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,OAAO,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,MAAO,IAAG,EAAE,wBAAwB,CAAC,CAAC,CAAC,UAAU,EAAE,EAAE,CAAC,KAAM,GAAE,EAAE,KAAK,UAAU,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,KAAK,UAAU,EAAE,EAAE,CAAC,EAAE,EAAE,KAAK,mBAAmB,EAAE,CAAC,EAAE,EAAE,KAAK,WAAW,EAAE,CAAC,EAAE,EAAE,KAAK,aAAa,EAAE,CAAC,EAAE,EAAE,KAAK,YAAY,EAAE,EAAE,CAAC,EAAE,MAAO,IAAG,OAAO,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,EAAE,EAAE,EAAE,CAAC,MAAO,MAAK,OAAO,EAAE,EAAE,EAAE,KAAK,UAAU,EAAE,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,EAAE,EAAE,EAAE,CAAC,KAAM,GAAE,EAAE,SAAS,EAAE,EAAE,KAAK,UAAU,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,SAAS,EAAE,KAAK,eAAe,EAAE,EAAE,CAAC,EAAE,EAAE,KAAK,YAAY,EAAE,EAAE,CAAC,EAAE,EAAE,KAAK,wBAAwB,GAAG,EAAE,EAAE,WAAW,EAAE,MAAO,IAAG,OAAO,EAAE,EAAE,EAAE,gBAAgB,EAAE,QAAQ,EAAE,EAAE,SAAS,CAAC,CAAC,YAAY,EAAE,EAAE,EAAE,CAAC,KAAM,GAAE,EAAG,MAAM,EAAE,EAAE,CAAC,EAAE,EAAE,KAAK,OAAO,OAAO,CAAC,EAAE,EAAE,KAAK,OAAO,OAAO,CAAC,EAAE,EAAE,KAAK,OAAO,WAAW,CAAC,EAAE,MAAO,IAAG,OAAO,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,EAAE,EAAE,EAAE,CAAC,MAAO,GAAE,KAAK,YAAY,OAAO,EAAE,EAAE,CAAC,CAAC,CAAC,eAAe,EAAE,EAAE,EAAE,CAAC,MAAO,MAAK,iBAAiB,OAAO,EAAE,EAAE,CAAC,CAAC,CAAC,YAAY,EAAE,EAAE,EAAE,CAAC,MAAO,MAAK,cAAc,OAAO,EAAE,EAAE,CAAC,CAAC,CAAC,mBAAmB,EAAE,EAAE,CAAC,MAAO,MAAK,qBAAqB,OAAO,EAAE,EAAE,CAAC,CAAC,CAAC,WAAW,EAAE,EAAE,CAAC,MAAO,MAAK,aAAa,OAAO,EAAE,EAAE,CAAC,CAAC,CAAC,aAAa,EAAE,EAAE,CAAC,MAAO,MAAK,eAAe,OAAO,EAAE,EAAE,CAAC,CAAC,CAAC,oBAAoB,EAAE,EAAE,EAAE,CAAC,KAAM,GAAE,KAAK,UAAU,CAAC,EAAE,EAAE,EAAE,KAAK,kBAAkB,CAAC,EAAE,IAAI,GAAG,EAAE,EAAE,KAAK,qBAAqB,CAAC,EAAE,IAAI,EAAE,EAAE,EAAE,KAAK,kBAAkB,CAAC,EAAE,IAAI,EAAE,EAAE,EAAE,KAAK,kBAAkB,CAAC,EAAE,IAAI,EAAE,MAAM,CAAC,EAAE,EAAE,IAAI,CAAC,GAAI,GAAE,EAAG,EAAC,GAAG,EAAE,GAAE,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,EAAG,GAAE,EAAE,CAAC,KAAM,GAAE,GAAE,EAAG,EAAC,GAAG,EAAE,IAAI,EAAE,EAAE,EAAE,KAAK,IAAI,IAAI,EAAG,CAAA,EAAE,EAAE,EAAE,KAAK,IAAI,IAAI,EAAG,CAAA,EAAE,EAAE,EAAE,KAAK,IAAI,EAAE,KAAK,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,MAAO,IAAG,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,KAAK,EAAE,GAAG,CAAC,CAAC,0BAA0B,EAAE,EAAE,EAAE,EAAE,CAAC,KAAM,GAAE,KAAK,aAAa,OAAO,EAAE,EAAE,CAAC,EAAE,MAAO,MAAK,mBAAmB,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,KAAK,oBAAoB,EAAE,CAAC,CAAC,mBAAmB,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,GAAG,CAAC,KAAK,SAAS,oBAAoB,CAAC,KAAM,GAAE,EAAE,KAAK,kBAAkB,EAAE,WAAW,EAAE,CAAC,EAAE,EAAE,EAAE,KAAK,wBAAwB,EAAE,CAAC,EAAE,EAAE,EAAE,OAAQ,GAAE,GAAG,GAAG,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,GAAI,GAAE,IAAI,EAAE,GAAG,GAAG,CAAC,GAAG,GAAG,IAAI,CAAC,KAAM,GAAE,EAAE,OAAO,EAAE,KAAK,gBAAgB,EAAE,EAAE,CAAC,EAAE,EAAE,KAAK,sBAAsB,EAAE,EAAE,CAAC,EAAE,EAAE,KAAK,eAAe,EAAE,EAAE,CAAC,EAAE,EAAE,KAAK,IAAI,EAAE,EAAE,CAAC,EAAE,GAAG,EAAE,EAAE,EAAE,MAAM,CAAC,KAAM,GAAE,KAAK,oBAAoB,EAAE,EAAE,CAAC,EAAE,AAAG,EAAE,GAAG,EAAE,GAAQ,EAAE,KAAK,UAAU,EAAE,EAAE,CAAC,EAAE,EAAE,GAAE,GAAG,EAAE,KAAK,CAAC,EAAE,KAAM,GAAE,KAAK,eAAe,EAAE,EAAE,CAAC,EAAE,EAAE,KAAK,WAAW,EAAE,EAAE,CAAC,EAAE,EAAE,KAAK,IAAI,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,MAAO,GAAE,GAAE,EAAE,EAAE,CAAC,EAAE,EAAE,GAAE,EAAE,KAAK,WAAW,EAAE,EAAE,EAAG,WAAW,KAAK,QAAQ,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,kBAAkB,EAAE,EAAE,EAAE,CAAC,GAAG,AAAI,IAAJ,EAAM,MAAO,GAAE,KAAM,GAAE,KAAK,YAAY,OAAO,KAAK,EAAE,EAAE,KAAK,CAAC,EAAE,MAAO,GAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,wBAAwB,EAAE,EAAE,CAAC,MAAO,GAAE,EAAE,IAAI,EAAE,MAAM,CAAC,gBAAgB,EAAE,EAAE,EAAE,CAAC,MAAO,MAAK,iBAAiB,OAAO,IAAI,EAAE,GAAG,EAAE,IAAI,CAAC,EAAE,IAAI,GAAE,GAAG,EAAG,GAAE,IAAI,EAAE,CAAC,CAAC,sBAAsB,EAAE,EAAE,EAAE,CAAC,KAAM,GAAE,KAAK,wBAAwB,OAAO,EAAE,EAAE,CAAC,EAAE,EAAE,GAAE,KAAK,4BAA4B,OAAO,EAAE,EAAE,CAAC,EAAE,GAAG,EAAE,EAAE,CAAC,EAAE,MAAO,IAAG,KAAK,IAAI,CAAC,GAAG,CAAC,CAAC,eAAe,EAAE,EAAE,EAAE,CAAC,KAAM,GAAE,KAAK,0BAA0B,KAAK,2BAA2B,OAAO,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,GAAE,KAAK,8BAA8B,OAAO,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,GAAG,EAAE,GAAG,GAAG,EAAE,EAAE,KAAK,iBAAiB,KAAK,iBAAiB,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,KAAK,IAAI,EAAE,CAAC,EAAE,KAAK,EAAE,EAAE,EAAG,SAAS,KAAK,QAAQ,EAAE,EAAE,GAAE,KAAK,8BAA8B,OAAO,EAAE,EAAE,CAAC,EAAE,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE,KAAK,IAAI,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,MAAO,IAAE,KAAK,IAAI,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,eAAe,EAAE,EAAE,EAAE,CAAC,KAAM,GAAE,KAAK,0BAA0B,KAAK,2BAA2B,OAAO,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,GAAE,KAAK,8BAA8B,OAAO,EAAE,EAAE,CAAC,EAAE,GAAG,EAAE,KAAK,IAAI,EAAE,EAAE,KAAK,iBAAiB,KAAK,kBAAkB,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,KAAK,IAAI,EAAE,CAAC,EAAE,EAAE,EAAE,KAAK,iBAAiB,KAAK,kBAAkB,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,KAAK,IAAI,EAAE,CAAC,EAAE,EAAE,MAAO,IAAE,KAAK,IAAI,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,0BAA0B,EAAE,CAAC,MAAO,GAAE,KAAK,GAAG,EAAE,IAAI,IAAI,EAAE,GAAG,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC,0BAA0B,EAAE,CAAC,MAAO,GAAE,IAAI,IAAI,EAAE,EAAE,EAAE,EAAE,GAAG,IAAI,CAAC,CAAC,iBAAiB,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,MAAO,GAAE,OAAO,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,oBAAoB,EAAE,EAAE,EAAE,CAAC,MAAO,GAAE,GAAE,KAAK,WAAW,OAAO,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,UAAU,EAAE,EAAE,EAAE,CAAC,MAAO,IAAE,KAAK,YAAY,OAAO,EAAE,EAAE,IAAI,CAAC,EAAE,IAAI,GAAG,CAAC,CAAC,CAAC,WAAW,EAAE,EAAE,EAAE,CAAC,KAAM,GAAE,GAAE,KAAK,wBAAwB,OAAO,EAAE,EAAE,CAAC,EAAE,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE,GAAE,KAAK,yBAAyB,OAAO,EAAE,EAAE,CAAC,EAAE,GAAG,EAAE,EAAE,GAAG,EAAE,EAAE,KAAK,YAAY,OAAO,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,EAAE,EAAE,KAAK,IAAI,EAAE,CAAC,EAAG,GAAE,EAAE,GAAG,MAAO,IAAG,IAAI,OAAO,iBAAiB,CAAC,CAAC,WAAW,EAAE,EAAE,CAAC,KAAM,GAAE,EAAE,EAAG,SAAS,KAAK,QAAQ,EAAE,MAAO,GAAE,GAAG,MAAM,KAAK,SAAS,SAAS,EAAE,EAAG,WAAW,KAAK,QAAQ,EAAE,CAAC,EAAE,EAAE,GAAG,MAAM,KAAK,SAAS,YAAY,EAAE,CAAC,CAAC,CAAC,2BAA2B,EAAE,EAAE,EAAE,CAAC,KAAM,GAAE,EAAG,SAAS,KAAK,QAAQ,EAAE,EAAG,WAAW,KAAK,QAAQ,EAAE,EAAE,EAAG,SAAS,KAAK,QAAQ,EAAE,EAAE,EAAG,WAAW,KAAK,QAAQ,EAAE,OAAQ,GAAE,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,KAAM,GAAE,EAAE,EAAE,GAAG,KAAK,mBAAmB,EAAE,EAAE,EAAE,EAAE,SAAS,GAAG,EAAE,GAAG,QAAQ,MAAO,EAAC,CAAC,MAAO,QAAO,gBAAgB,CAAC,CAAC,AAAC,UAAS,EAAE,CAAC,EAAE,OAAO,SAAS,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,MAAM,CAAC,SAAS,EAAE,SAAS,EAAE,gBAAgB,EAAE,UAAU,EAAE,QAAQ,EAAE,YAAY,CAAC,CAAC,CAAC,GAAE,IAAK,IAAG,CAAE,EAAC,EAAE,SAAS,EAAE,CAAC,EAAE,SAAS,SAAS,EAAE,CAAC,GAAI,GAAE,EAAE,EAAE,EAAE,KAAM,GAAE,AAAQ,GAAE,EAAE,WAAW,CAAC,KAAxB,MAA4B,AAAS,IAAT,OAAW,EAAE,GAAG,MAAO,AAAS,GAAE,WAAX,OAAqB,GAAE,AAAQ,GAAE,EAAE,WAAW,EAAE,QAAQ,KAAjC,MAAqC,AAAS,IAAT,OAAW,EAAE,EAAE,IAAI,GAAG,AAAS,EAAE,eAAX,OAAwB,SAAS,EAAE,CAAC,MAAO,IAAG,EAAE,KAAK,CAAC,EAAE,AAAQ,GAAE,EAAE,WAAW,EAAE,YAAY,KAArC,MAAyC,AAAS,IAAT,OAAW,EAAE,CAAC,EAAE,AAAS,EAAE,YAAX,OAAqB,SAAS,EAAE,CAAC,MAAO,IAAG,EAAE,KAAK,CAAC,EAAE,AAAQ,GAAE,EAAE,WAAW,EAAE,SAAS,KAAlC,MAAsC,AAAS,IAAT,OAAW,EAAE,CAAC,EAAE,IAAI,EAAE,GAAI,EAAC,CAAC,EAAE,IAAK,IAAG,CAAA,EAAG,EAAE,SAAS,EAAE,CAAC,EAAE,OAAO,SAAS,EAAE,EAAE,CAAC,MAAM,CAAC,KAAK,EAAE,OAAO,EAAE,KAAK,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,IAAK,IAAG,CAAE,EAAC,EAAE,MAAM,EAAE,CAAC,YAAY,EAAE,EAAE,EAAE,CAAC,KAAK,KAAK,EAAE,KAAK,aAAa,EAAE,KAAK,OAAO,EAAE,OAAO,CAAC,EAAE,iBAAiB,KAAK,aAAa,EAAG,YAAY,KAAK,OAAO,EAAG,OAAO,EAAE,KAAK,sBAAsB,EAAG,YAAY,KAAK,OAAO,EAAG,iBAAiB,EAAE,KAAK,kBAAkB,GAAI,IAAG,CAAC,aAAa,EAAE,EAAE,EAAE,EAAE,CAAC,KAAM,GAAE,GAAE,UAAU,EAAE,GAAG,EAAE,EAAE,GAAE,UAAU,EAAE,GAAG,EAAE,EAAE,GAAI,IAAG,KAAK,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,KAAK,KAAK,CAAC,EAAE,OAAQ,GAAE,EAAE,EAAE,GAAG,GAAG,EAAE,CAAC,KAAM,GAAE,EAAE,EAAE,OAAQ,GAAE,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC,KAAM,GAAE,EAAE,EAAE,EAAE,SAAS,EAAE,CAAC,EAAE,GAAI,GAAE,EAAE,EAAE,OAAO,iBAAiB,EAAE,OAAO,iBAAiB,OAAQ,GAAE,EAAE,KAAK,GAAG,EAAE,KAAK,GAAG,EAAE,CAAC,KAAM,GAAE,GAAE,OAAO,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,cAAc,CAAC,EAAE,GAAG,EAAE,OAAO,EAAE,GAAG,EAAE,CAAC,EAAE,EAAE,EAAE,OAAO,iBAAiB,QAAQ,CAAC,GAAG,EAAE,QAAS,EAAC,CAAC,IAAI,OAAO,kBAAmB,GAAE,EAAE,GAAG,QAAQ,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,OAAO,iBAAiB,OAAQ,GAAE,EAAE,EAAE,GAAG,EAAE,KAAK,GAAG,EAAE,CAAC,KAAM,GAAE,EAAE,cAAc,GAAE,OAAO,EAAE,EAAE,CAAC,CAAC,EAAE,GAAG,EAAE,OAAO,EAAE,GAAG,GAAG,EAAE,QAAO,EAAG,CAAC,EAAE,EAAE,EAAE,KAAK,CAAC,CAAC,CAAC,GAAG,EAAE,KAAM,GAAE,EAAE,EAAE,EAAE,GAAG,CAAC,EAAE,OAAO,KAAK,YAAY,EAAE,SAAS,EAAE,QAAQ,EAAE,EAAE,EAAE,CAAC,EAAE,KAAM,GAAE,EAAE,EAAE,EAAE,CAAC,EAAE,GAAG,EAAE,cAAc,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,gBAAgB,EAAE,EAAE,CAAC,MAAO,MAAK,KAAK,aAAa,OAAO,EAAE,EAAE,CAAC,EAAE,EAAE,IAAI,KAAK,OAAO,GAAG,EAAE,EAAE,CAAC,EAAE,WAAY,CAAA,CAAC,oBAAoB,EAAE,EAAE,CAAC,MAAO,MAAK,sBAAsB,OAAO,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,EAAE,CAAC,MAAO,IAAE,KAAK,kBAAkB,EAAG,IAAI,KAAK,OAAO,WAAW,CAAC,CAAC,CAAE,CAAC,CAAC,MAAM,EAAE,CAAC,YAAY,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,KAAK,OAAO,EAAE,KAAK,MAAM,EAAE,KAAK,WAAW,EAAE,KAAK,QAAQ,EAAE,KAAK,SAAS,EAAE,KAAK,OAAO,EAAE,KAAK,OAAO,EAAE,KAAK,OAAO,EAAE,KAAK,gBAAgB,EAAE,KAAK,gBAAgB,EAAE,KAAK,aAAa,EAAE,KAAK,YAAY,EAAE,KAAK,MAAM,IAAI,GAAG,KAAK,iBAAiB,IAAI,EAAE,KAAK,gBAAgB,IAAI,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,KAAK,OAAO,EAAE,KAAK,OAAO,EAAE,KAAK,aAAa,KAAK,OAAO,gBAAgB,EAAE,CAAC,EAAE,KAAK,iBAAiB,GAAG,IAAI,KAAK,OAAO,oBAAoB,EAAE,CAAC,CAAC,EAAG,KAAK,gBAAgB,GAAG,IAAI,KAAK,yBAAyB,EAAE,CAAC,CAAG,CAAA,CAAC,QAAQ,EAAE,EAAE,EAAE,EAAE,CAAC,KAAK,OAAO,EAAE,KAAK,gBAAgB,EAAE,KAAK,gBAAgB,EAAE,KAAK,YAAY,EAAE,KAAK,MAAM,GAAG,IAAI,KAAK,SAAS,GAAE,OAAO,KAAK,OAAO,KAAK,OAAO,KAAK,MAAM,CAAC,CAAC,CAAE,CAAC,yBAAyB,EAAE,EAAE,CAAC,KAAM,GAAE,GAAG,EAAE,EAAE,GAAG,EAAE,EAAE,KAAK,WAAW,2BAA2B,GAAG,EAAE,GAAG,CAAC,EAAE,EAAE,KAAK,WAAW,2BAA2B,EAAE,GAAG,EAAE,GAAG,CAAC,EAAE,EAAE,KAAK,WAAW,2BAA2B,GAAG,EAAE,EAAE,GAAG,CAAC,EAAE,EAAE,KAAK,WAAW,2BAA2B,EAAE,GAAG,EAAE,EAAE,GAAG,CAAC,EAAE,MAAO,MAAK,MAAM,GAAG,IAAG,GAAG,GAAI,IAAG,GAAG,GAAG,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,KAAK,aAAa,CAAC,CAAC,CAAC,AAAC,UAAS,EAAE,CAAC,WAAW,EAAE,CAAC,MAAM,IAAI,IAAI,CAAC,CAAC,WAAW,EAAE,CAAC,MAAO,IAAG,CAAC,KAAM,GAAE,EAAE,IAAK,GAAG,EAAE,CAAC,CAAG,EAAC,MAAM,CAAC,EAAE,EAAE,IAAI,CAAC,SAAU,KAAK,GAAE,CAAC,KAAM,GAAE,EAAE,EAAE,EAAE,CAAC,EAAE,GAAG,EAAE,MAAO,EAAC,CAAC,CAAC,CAAC,CAAC,WAAW,EAAE,EAAE,CAAC,MAAO,IAAG,CAAC,EAAE,EAAE,IAAI,CAAC,GAAG,EAAE,CAAC,EAAE,MAAO,GAAE,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,KAAK,IAAI,IAAI,CAAE,EAAC,EAAE,SAAS,SAAS,EAAE,CAAC,GAAI,GAAE,EAAE,EAAE,KAAM,GAAE,AAAQ,GAAE,EAAE,WAAW,CAAC,KAAxB,MAA4B,AAAS,IAAT,OAAW,EAAE,GAAG,OAAO,AAAQ,GAAE,EAAE,WAAW,EAAE,IAAI,KAA7B,MAAiC,AAAS,IAAT,OAAW,OAAO,EAAE,QAAQ,cAAc,EAAE,OAAO,QAAQ,MAAO,GAAE,EAAE,SAAS,EAAE,YAAY,CAAC,MAAM,WAAW,MAAO,GAAE,AAAQ,GAAE,EAAE,UAAU,EAAE,SAAS,EAAE,QAAQ,KAA3C,MAA+C,AAAS,IAAT,OAAW,EAAE,CAAA,CAAE,MAAM,YAAY,MAAO,GAAE,GAAG,SAAS,EAAE,OAAO,EAAE,EAAE,SAAS,EAAE,QAAQ,CAAC,EAAE,MAAO,GAAE,IAAI,EAAE,EAAE,MAAM,EAAE,EAAE,SAAS,EAAE,EAAE,UAAU,CAAC,GAAE,IAAK,IAAG,CAAE,EAAC,EAAE,SAAS,EAAE,CAAC,YAAY,CAAC,MAAO,IAAG,EAAE,QAAQ,EAAE,gBAAe,CAAE,CAAC,WAAW,EAAE,CAAC,KAAM,GAAE,GAAI,KAAI,CAAC,EAAE,MAAO,IAAG,EAAE,IAAI,EAAE,MAAK,CAAE,CAAC,CAAC,WAAW,EAAE,CAAC,MAAO,IAAG,CAAC,EAAE,CAAC,CAAC,CAAC,WAAW,EAAE,EAAE,EAAE,EAAE,CAAC,MAAO,IAAG,CAAC,KAAM,GAAE,EAAE,EAAE,gBAAgB,EAAE,gBAAgB,EAAE,EAAE,EAAE,aAAa,EAAE,EAAE,AAAI,IAAJ,EAAM,EAAE,GAAE,EAAE,iBAAkB,EAAC,GAAG,EAAE,EAAE,CAAC,EAAE,MAAO,IAAG,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,WAAW,EAAE,EAAE,EAAE,CAAC,MAAO,IAAG,CAAC,KAAM,GAAE,EAAE,EAAE,OAAO,EAAE,EAAE,EAAE,EAAE,OAAO,EAAE,GAAG,EAAE,QAAQ,EAAE,MAAM,GAAG,GAAG,EAAE,QAAQ,EAAE,MAAM,GAAG,KAAM,GAAE,EAAE,OAAO,UAAU,CAAC,EAAE,EAAE,GAAE,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC,EAAE,MAAO,GAAE,UAAS,EAAG,CAAC,CAAC,CAAC,WAAW,EAAE,EAAE,EAAE,CAAC,MAAO,IAAG,CAAC,GAAG,EAAE,cAAc,OAAO,iBAAiB,MAAM,GAAG,KAAM,GAAE,EAAE,EAAE,gBAAgB,EAAE,MAAO,GAAE,OAAO,GAAG,EAAE,YAAY,EAAE,EAAE,aAAa,CAAC,CAAC,CAAC,WAAW,EAAE,EAAE,EAAE,CAAC,MAAO,IAAG,CAAC,KAAM,GAAE,EAAE,EAAE,gBAAgB,EAAE,MAAO,GAAE,OAAO,GAAG,EAAE,EAAE,OAAO,EAAE,EAAE,aAAa,CAAC,CAAC,CAAC,EAAE,MAAM,IAAI,GAAG,EAAE,KAAK,IAAI,GAAG,EAAE,SAAS,SAAS,EAAE,CAAC,GAAI,GAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,KAAM,GAAE,AAAQ,GAAE,EAAE,WAAW,CAAC,KAAxB,MAA4B,AAAS,IAAT,OAAW,EAAE,GAAG,OAAO,AAAQ,GAAE,EAAE,WAAW,EAAE,IAAI,KAA7B,MAAiC,AAAS,IAAT,OAAW,OAAO,EAAE,QAAQ,cAAc,EAAE,OAAO,4BAA4B,MAAO,IAAG,EAAE,QAAQ,EAAE,gBAAe,MAAO,QAAQ,MAAO,GAAE,AAAQ,GAAE,EAAE,UAAU,EAAE,SAAU,GAAG,CAAC,GAAI,GAAE,MAAO,AAAQ,GAAE,EAAE,WAAW,CAAC,KAAxB,MAA4B,AAAS,IAAT,OAAW,EAAE,EAAE,CAAC,KAA/F,MAAoG,AAAS,IAAT,OAAW,EAAE,CAAA,CAAE,MAAM,MAAM,MAAO,GAAE,EAAE,SAAS,EAAE,MAAM,CAAC,MAAM,cAAc,MAAO,GAAE,AAAQ,GAAE,EAAE,QAAQ,EAAE,MAAM,KAA5B,MAAgC,AAAS,IAAT,OAAW,EAAE,EAAE,AAAQ,GAAE,EAAE,YAAY,EAAE,iBAAiB,KAA3C,MAA+C,AAAS,IAAT,QAAY,EAAE,AAAQ,GAAE,EAAE,QAAQ,EAAE,qBAAqB,KAA3C,MAA+C,AAAS,IAAT,OAAW,EAAE,EAAE,AAAY,EAAE,WAAW,EAAE,YAAY,IAAvC,SAAwC,MAAM,oBAAoB,MAAO,GAAE,AAAQ,GAAE,EAAE,WAAW,EAAE,WAAW,KAApC,MAAwC,AAAS,IAAT,OAAW,EAAE,GAAG,GAAG,SAAS,EAAE,iBAAiB,EAAE,GAAG,SAAS,EAAE,kBAAkB,CAAC,MAAM,QAAQ,MAAO,GAAE,AAAQ,GAAE,EAAE,QAAQ,EAAE,MAAM,KAA5B,MAAgC,AAAS,IAAT,OAAW,EAAE,EAAE,AAAQ,GAAE,EAAE,QAAQ,EAAE,wBAAwB,KAA9C,MAAkD,AAAS,IAAT,OAAW,EAAE,EAAE,AAAQ,GAAE,EAAE,YAAY,EAAE,iBAAiB,KAA3C,MAA+C,AAAS,IAAT,QAAY,CAAC,MAAM,UAAU,MAAO,GAAE,GAAG,SAAS,EAAE,MAAM,EAAE,AAAQ,GAAE,EAAE,QAAQ,EAAE,wBAAwB,KAA9C,MAAkD,AAAS,IAAT,OAAW,EAAE,EAAE,AAAQ,GAAE,EAAE,YAAY,EAAE,iBAAiB,KAA3C,MAA+C,AAAS,IAAT,QAAY,CAAC,EAAE,MAAO,GAAE,KAAK,EAAE,EAAE,wBAAwB,EAAE,EAAE,MAAM,EAAE,EAAE,IAAI,EAAE,EAAE,WAAW,EAAE,EAAE,iBAAiB,EAAE,EAAE,MAAM,EAAE,EAAE,OAAO,CAAC,EAAE,IAAK,IAAG,CAAE,EAAC,EAAE,MAAM,EAAE,CAAC,YAAY,EAAE,EAAE,EAAE,CAAC,KAAK,YAAY,EAAE,KAAK,SAAS,EAAE,KAAK,QAAQ,GAAI,IAAG,EAAE,MAAM,EAAE,kBAAkB,EAAE,EAAE,kBAAkB,EAAE,KAAK,gBAAgB,GAAI,KAAI,KAAK,aAAa,GAAG,SAAS,CAAC,CAAC,EAAE,EAAE,EAAE,IAAI,EAAE,gCAAgC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,cAAc,GAAI,IAAG,EAAE,YAAY,EAAE,aAAa,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,GAAI,GAAE,KAAM,GAAE,KAAK,IAAI,EAAE,KAAK,KAAK,SAAS,MAAM,IAAI,EAAE,EAAE,KAAK,IAAI,EAAE,KAAK,KAAK,SAAS,MAAM,KAAK,KAAK,SAAS,MAAM,MAAM,EAAE,EAAE,EAAG,UAAU,KAAK,SAAS,KAAK,EAAE,EAAE,EAAG,WAAW,KAAK,SAAS,KAAK,EAAE,EAAE,KAAK,MAAM,GAAG,CAAC,EAAE,EAAE,KAAK,MAAM,EAAE,CAAC,EAAE,EAAE,KAAK,MAAO,GAAE,GAAG,CAAC,EAAE,EAAE,GAAE,UAAU,EAAE,GAAG,EAAE,EAAE,GAAE,UAAU,EAAE,GAAG,EAAE,EAAE,KAAK,cAAc,CAAC,EAAE,EAAE,wBAAuB,EAAG,OAAQ,GAAE,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC,EAAE,aAAa,CAAC,EAAE,OAAQ,GAAE,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC,GAAI,GAAE,EAAE,mBAAmB,EAAE,cAAc,CAAC,EAAE,OAAQ,GAAE,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,EAAE,aAAa,EAAE,CAAC,EAAE,OAAQ,GAAE,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,KAAM,GAAG,GAAE,GAAG,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,gBAAgB,CAAC,EAAE,EAAE,gBAAgB,EAAE,SAAS,IAAI,GAAI,GAAE,EAAE,mBAAmB,CAAC,GAAG,KAAM,GAAE,EAAE,EAAE,EAAE,WAAW,CAAC,EAAE,OAAQ,GAAE,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC,KAAM,GAAE,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,WAAW,CAAC,EAAE,OAAQ,GAAE,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC,KAAM,GAAE,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,WAAW,CAAC,EAAE,GAAI,GAAE,AAAQ,GAAE,KAAK,aAAa,EAAE,EAAE,EAAE,CAAC,KAAnC,MAAuC,AAAS,IAAT,OAAW,EAAE,KAAK,SAAS,aAAa,GAAG,EAAE,OAAO,EAAE,GAAG,EAAE,CAAC,GAAG,CAAE,GAAE,KAAK,SAAS,UAAU,SAAS,EAAE,KAAK,SAAS,YAAY,CAAC,EAAE,cAAc,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,WAAY,CAAA,CAAC,CAAC,aAAa,EAAE,EAAE,mBAAmB,CAAC,KAAM,GAAE,KAAK,cAAc,CAAC,EAAE,EAAE,GAAG,OAAO,KAAK,SAAS,MAAM,KAAK,KAAK,SAAS,MAAM,MAAM,EAAE,KAAK,cAAc,aAAa,EAAE,EAAE,EAAG,IAAI,CAAG,CAAA,CAAC,cAAc,EAAE,CAAC,MAAO,IAAE,KAAK,gBAAgB,GAAE,OAAO,EAAE,GAAG,EAAG,IAAI,CAAC,KAAM,GAAE,KAAK,IAAI,EAAE,KAAK,KAAK,SAAS,MAAM,IAAI,EAAE,EAAE,KAAK,IAAI,EAAE,KAAK,KAAK,SAAS,MAAM,KAAK,KAAK,SAAS,MAAM,MAAM,EAAE,EAAE,EAAG,UAAU,KAAK,SAAS,KAAK,EAAE,EAAE,EAAG,WAAW,KAAK,SAAS,KAAK,EAAE,EAAE,KAAK,MAAM,GAAG,CAAC,EAAE,EAAE,KAAK,MAAM,EAAE,CAAC,EAAE,EAAE,KAAK,MAAO,GAAE,GAAG,CAAC,EAAE,EAAE,GAAE,UAAU,EAAE,GAAG,EAAE,EAAE,GAAE,UAAU,EAAE,GAAG,EAAE,MAAO,IAAI,IAAG,EAAE,EAAE,EAAE,KAAK,QAAQ,EAAE,EAAG,IAAI,EAAG,KAAK,QAAQ,CAAC,EAAG,CAAC,CAAC,AAAC,UAAS,EAAE,CAAC,EAAE,SAAS,SAAS,EAAE,CAAC,GAAI,GAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,KAAM,GAAE,AAAQ,GAAE,EAAE,WAAW,CAAC,KAAxB,MAA4B,AAAS,IAAT,OAAW,EAAE,CAAA,EAAG,MAAM,CAAC,WAAW,GAAG,SAAS,EAAE,UAAU,EAAE,YAAY,GAAG,SAAS,EAAE,YAAY,EAAE,MAAM,EAAG,SAAS,EAAE,KAAK,EAAE,aAAa,EAAE,SAAS,EAAE,aAAa,EAAE,aAAa,EAAE,SAAS,EAAE,aAAa,EAAE,oBAAoB,AAAQ,GAAE,EAAE,QAAQ,EAAE,qBAAqB,KAA3C,MAA+C,AAAS,IAAT,OAAW,EAAE,EAAE,qBAAqB,AAAQ,GAAE,EAAE,QAAQ,EAAE,sBAAsB,KAA5C,MAAgD,AAAS,IAAT,OAAW,EAAE,EAAE,SAAS,AAAQ,GAAE,EAAE,QAAQ,EAAE,SAAS,KAA/B,MAAmC,AAAS,IAAT,OAAW,EAAE,EAAE,qBAAqB,AAAQ,GAAE,EAAE,YAAY,EAAE,sBAAsB,KAAhD,MAAoD,AAAS,IAAT,QAAY,EAAE,gBAAgB,AAAQ,GAAE,EAAE,YAAY,EAAE,gBAAgB,KAA1C,MAA8C,AAAS,IAAT,QAAY,EAAE,kBAAkB,AAAQ,GAAE,EAAE,YAAY,EAAE,mBAAmB,KAA7C,MAAiD,AAAS,IAAT,QAAY,EAAE,iBAAiB,AAAQ,GAAE,EAAE,YAAY,EAAE,iBAAiB,KAA3C,MAA+C,AAAS,IAAT,QAAY,EAAE,gBAAgB,AAAQ,GAAE,EAAE,YAAY,EAAE,iBAAiB,KAA3C,MAA+C,AAAS,IAAT,QAAY,EAAE,mBAAmB,AAAQ,GAAE,EAAE,YAAY,EAAE,oBAAoB,KAA9C,MAAkD,AAAS,IAAT,QAAY,EAAE,mBAAmB,AAAQ,GAAE,EAAE,YAAY,EAAE,oBAAoB,KAA9C,MAAkD,AAAS,IAAT,QAAY,CAAC,CAAC,CAAC,GAAE,IAAK,IAAG,CAAE,EAAC,EAAE,SAAS,EAAE,CAAC,EAAE,SAAS,SAAS,EAAE,CAAC,GAAI,GAAE,KAAM,GAAE,AAAQ,GAAE,EAAE,WAAW,CAAC,KAAxB,MAA4B,AAAS,IAAT,OAAW,EAAE,CAAE,EAAC,MAAM,CAAC,WAAW,EAAE,QAAQ,EAAE,WAAW,EAAE,WAAY,GAAG,CAAC,GAAI,GAAE,EAAE,EAAE,MAAM,CAAC,SAAS,AAAQ,GAAE,EAAE,QAAQ,EAAE,QAAQ,KAA9B,MAAkC,AAAS,IAAT,OAAW,EAAE,EAAE,OAAO,AAAQ,GAAE,EAAE,QAAQ,EAAE,MAAM,KAA5B,MAAgC,AAAS,IAAT,OAAW,EAAE,EAAE,MAAM,AAAQ,GAAE,EAAE,QAAQ,EAAE,KAAK,KAA3B,MAA+B,AAAS,IAAT,OAAW,EAAE,CAAC,CAAC,CAAG,EAAC,WAAW,EAAE,QAAQ,EAAE,WAAY,GAAG,CAAC,GAAI,GAAE,MAAO,IAAG,CAAC,GAAI,GAAE,EAAE,EAAE,MAAM,CAAC,QAAQ,AAAQ,GAAE,EAAE,QAAQ,EAAE,OAAO,KAA7B,MAAiC,AAAS,IAAT,OAAW,EAAE,EAAE,WAAW,AAAQ,GAAE,EAAE,QAAQ,EAAE,UAAU,KAAhC,MAAoC,AAAS,IAAT,OAAW,EAAE,EAAE,KAAK,AAAQ,GAAE,EAAE,QAAQ,EAAE,IAAI,KAA1B,MAA8B,AAAS,IAAT,OAAW,EAAE,CAAC,CAAC,GAAG,AAAQ,GAAE,EAAE,WAAW,CAAC,KAAxB,MAA4B,AAAS,IAAT,OAAW,EAAE,CAAE,CAAA,CAAC,CAAG,CAAA,CAAC,CAAC,EAAE,IAAK,IAAG,CAAE,EAAC"}
\ No newline at end of file
diff --git a/assets/howler.ff64ae5d.js b/assets/howler.8f9f31bf.js
similarity index 99%
rename from assets/howler.ff64ae5d.js
rename to assets/howler.8f9f31bf.js
index 631a16eb..2e17ae60 100644
--- a/assets/howler.ff64ae5d.js
+++ b/assets/howler.8f9f31bf.js
@@ -1,4 +1,4 @@
-import{c as S}from"./index.18869b2a.js";function L(b,g){return g.forEach(function(r){r&&typeof r!="string"&&!Array.isArray(r)&&Object.keys(r).forEach(function(u){if(u!=="default"&&!(u in b)){var i=Object.getOwnPropertyDescriptor(r,u);Object.defineProperty(b,u,i.get?i:{enumerable:!0,get:function(){return r[u]}})}})}),Object.freeze(Object.defineProperty(b,Symbol.toStringTag,{value:"Module"}))}var O={};/*!
+import{c as S}from"./index.cecfddbb.js";function L(b,g){return g.forEach(function(r){r&&typeof r!="string"&&!Array.isArray(r)&&Object.keys(r).forEach(function(u){if(u!=="default"&&!(u in b)){var i=Object.getOwnPropertyDescriptor(r,u);Object.defineProperty(b,u,i.get?i:{enumerable:!0,get:function(){return r[u]}})}})}),Object.freeze(Object.defineProperty(b,Symbol.toStringTag,{value:"Module"}))}var O={};/*!
* howler.js v2.2.3
* howlerjs.com
*
@@ -17,4 +17,4 @@ import{c as S}from"./index.18869b2a.js";function L(b,g){return g.forEach(functio
*
* MIT License
*/(function(){HowlerGlobal.prototype._pos=[0,0,0],HowlerGlobal.prototype._orientation=[0,0,-1,0,1,0],HowlerGlobal.prototype.stereo=function(r){var u=this;if(!u.ctx||!u.ctx.listener)return u;for(var i=u._howls.length-1;i>=0;i--)u._howls[i].stereo(r);return u},HowlerGlobal.prototype.pos=function(r,u,i){var c=this;if(!c.ctx||!c.ctx.listener)return c;if(u=typeof u!="number"?c._pos[1]:u,i=typeof i!="number"?c._pos[2]:i,typeof r=="number")c._pos=[r,u,i],typeof c.ctx.listener.positionX!="undefined"?(c.ctx.listener.positionX.setTargetAtTime(c._pos[0],Howler.ctx.currentTime,.1),c.ctx.listener.positionY.setTargetAtTime(c._pos[1],Howler.ctx.currentTime,.1),c.ctx.listener.positionZ.setTargetAtTime(c._pos[2],Howler.ctx.currentTime,.1)):c.ctx.listener.setPosition(c._pos[0],c._pos[1],c._pos[2]);else return c._pos;return c},HowlerGlobal.prototype.orientation=function(r,u,i,c,d,h){var p=this;if(!p.ctx||!p.ctx.listener)return p;var s=p._orientation;if(u=typeof u!="number"?s[1]:u,i=typeof i!="number"?s[2]:i,c=typeof c!="number"?s[3]:c,d=typeof d!="number"?s[4]:d,h=typeof h!="number"?s[5]:h,typeof r=="number")p._orientation=[r,u,i,c,d,h],typeof p.ctx.listener.forwardX!="undefined"?(p.ctx.listener.forwardX.setTargetAtTime(r,Howler.ctx.currentTime,.1),p.ctx.listener.forwardY.setTargetAtTime(u,Howler.ctx.currentTime,.1),p.ctx.listener.forwardZ.setTargetAtTime(i,Howler.ctx.currentTime,.1),p.ctx.listener.upX.setTargetAtTime(c,Howler.ctx.currentTime,.1),p.ctx.listener.upY.setTargetAtTime(d,Howler.ctx.currentTime,.1),p.ctx.listener.upZ.setTargetAtTime(h,Howler.ctx.currentTime,.1)):p.ctx.listener.setOrientation(r,u,i,c,d,h);else return s;return p},Howl.prototype.init=function(r){return function(u){var i=this;return i._orientation=u.orientation||[1,0,0],i._stereo=u.stereo||null,i._pos=u.pos||null,i._pannerAttr={coneInnerAngle:typeof u.coneInnerAngle!="undefined"?u.coneInnerAngle:360,coneOuterAngle:typeof u.coneOuterAngle!="undefined"?u.coneOuterAngle:360,coneOuterGain:typeof u.coneOuterGain!="undefined"?u.coneOuterGain:0,distanceModel:typeof u.distanceModel!="undefined"?u.distanceModel:"inverse",maxDistance:typeof u.maxDistance!="undefined"?u.maxDistance:1e4,panningModel:typeof u.panningModel!="undefined"?u.panningModel:"HRTF",refDistance:typeof u.refDistance!="undefined"?u.refDistance:1,rolloffFactor:typeof u.rolloffFactor!="undefined"?u.rolloffFactor:1},i._onstereo=u.onstereo?[{fn:u.onstereo}]:[],i._onpos=u.onpos?[{fn:u.onpos}]:[],i._onorientation=u.onorientation?[{fn:u.onorientation}]:[],r.call(this,u)}}(Howl.prototype.init),Howl.prototype.stereo=function(r,u){var i=this;if(!i._webAudio)return i;if(i._state!=="loaded")return i._queue.push({event:"stereo",action:function(){i.stereo(r,u)}}),i;var c=typeof Howler.ctx.createStereoPanner=="undefined"?"spatial":"stereo";if(typeof u=="undefined")if(typeof r=="number")i._stereo=r,i._pos=[r,0,0];else return i._stereo;for(var d=i._getSoundIds(u),h=0;h= 0 && vol <= 1) {\n self._volume = vol;\n\n // Don't update any of the nodes if we are muted.\n if (self._muted) {\n return self;\n }\n\n // When using Web Audio, we just need to adjust the master gain.\n if (self.usingWebAudio) {\n self.masterGain.gain.setValueAtTime(vol, Howler.ctx.currentTime);\n }\n\n // Loop through and change volume for all HTML5 audio nodes.\n for (var i=0; i=0; i--) {\n self._howls[i].unload();\n }\n\n // Create a new AudioContext to make sure it is fully reset.\n if (self.usingWebAudio && self.ctx && typeof self.ctx.close !== 'undefined') {\n self.ctx.close();\n self.ctx = null;\n setupAudioContext();\n }\n\n return self;\n },\n\n /**\n * Check for codec support of specific extension.\n * @param {String} ext Audio file extention.\n * @return {Boolean}\n */\n codecs: function(ext) {\n return (this || Howler)._codecs[ext.replace(/^x-/, '')];\n },\n\n /**\n * Setup various state values for global tracking.\n * @return {Howler}\n */\n _setup: function() {\n var self = this || Howler;\n\n // Keeps track of the suspend/resume state of the AudioContext.\n self.state = self.ctx ? self.ctx.state || 'suspended' : 'suspended';\n\n // Automatically begin the 30-second suspend process\n self._autoSuspend();\n\n // Check if audio is available.\n if (!self.usingWebAudio) {\n // No audio is available on this system if noAudio is set to true.\n if (typeof Audio !== 'undefined') {\n try {\n var test = new Audio();\n\n // Check if the canplaythrough event is available.\n if (typeof test.oncanplaythrough === 'undefined') {\n self._canPlayEvent = 'canplay';\n }\n } catch(e) {\n self.noAudio = true;\n }\n } else {\n self.noAudio = true;\n }\n }\n\n // Test to make sure audio isn't disabled in Internet Explorer.\n try {\n var test = new Audio();\n if (test.muted) {\n self.noAudio = true;\n }\n } catch (e) {}\n\n // Check for supported codecs.\n if (!self.noAudio) {\n self._setupCodecs();\n }\n\n return self;\n },\n\n /**\n * Check for browser support for various codecs and cache the results.\n * @return {Howler}\n */\n _setupCodecs: function() {\n var self = this || Howler;\n var audioTest = null;\n\n // Must wrap in a try/catch because IE11 in server mode throws an error.\n try {\n audioTest = (typeof Audio !== 'undefined') ? new Audio() : null;\n } catch (err) {\n return self;\n }\n\n if (!audioTest || typeof audioTest.canPlayType !== 'function') {\n return self;\n }\n\n var mpegTest = audioTest.canPlayType('audio/mpeg;').replace(/^no$/, '');\n\n // Opera version <33 has mixed MP3 support, so we need to check for and block it.\n var ua = self._navigator ? self._navigator.userAgent : '';\n var checkOpera = ua.match(/OPR\\/([0-6].)/g);\n var isOldOpera = (checkOpera && parseInt(checkOpera[0].split('/')[1], 10) < 33);\n var checkSafari = ua.indexOf('Safari') !== -1 && ua.indexOf('Chrome') === -1;\n var safariVersion = ua.match(/Version\\/(.*?) /);\n var isOldSafari = (checkSafari && safariVersion && parseInt(safariVersion[1], 10) < 15);\n\n self._codecs = {\n mp3: !!(!isOldOpera && (mpegTest || audioTest.canPlayType('audio/mp3;').replace(/^no$/, ''))),\n mpeg: !!mpegTest,\n opus: !!audioTest.canPlayType('audio/ogg; codecs=\"opus\"').replace(/^no$/, ''),\n ogg: !!audioTest.canPlayType('audio/ogg; codecs=\"vorbis\"').replace(/^no$/, ''),\n oga: !!audioTest.canPlayType('audio/ogg; codecs=\"vorbis\"').replace(/^no$/, ''),\n wav: !!(audioTest.canPlayType('audio/wav; codecs=\"1\"') || audioTest.canPlayType('audio/wav')).replace(/^no$/, ''),\n aac: !!audioTest.canPlayType('audio/aac;').replace(/^no$/, ''),\n caf: !!audioTest.canPlayType('audio/x-caf;').replace(/^no$/, ''),\n m4a: !!(audioTest.canPlayType('audio/x-m4a;') || audioTest.canPlayType('audio/m4a;') || audioTest.canPlayType('audio/aac;')).replace(/^no$/, ''),\n m4b: !!(audioTest.canPlayType('audio/x-m4b;') || audioTest.canPlayType('audio/m4b;') || audioTest.canPlayType('audio/aac;')).replace(/^no$/, ''),\n mp4: !!(audioTest.canPlayType('audio/x-mp4;') || audioTest.canPlayType('audio/mp4;') || audioTest.canPlayType('audio/aac;')).replace(/^no$/, ''),\n weba: !!(!isOldSafari && audioTest.canPlayType('audio/webm; codecs=\"vorbis\"').replace(/^no$/, '')),\n webm: !!(!isOldSafari && audioTest.canPlayType('audio/webm; codecs=\"vorbis\"').replace(/^no$/, '')),\n dolby: !!audioTest.canPlayType('audio/mp4; codecs=\"ec-3\"').replace(/^no$/, ''),\n flac: !!(audioTest.canPlayType('audio/x-flac;') || audioTest.canPlayType('audio/flac;')).replace(/^no$/, '')\n };\n\n return self;\n },\n\n /**\n * Some browsers/devices will only allow audio to be played after a user interaction.\n * Attempt to automatically unlock audio on the first user interaction.\n * Concept from: http://paulbakaus.com/tutorials/html5/web-audio-on-ios/\n * @return {Howler}\n */\n _unlockAudio: function() {\n var self = this || Howler;\n\n // Only run this if Web Audio is supported and it hasn't already been unlocked.\n if (self._audioUnlocked || !self.ctx) {\n return;\n }\n\n self._audioUnlocked = false;\n self.autoUnlock = false;\n\n // Some mobile devices/platforms have distortion issues when opening/closing tabs and/or web views.\n // Bugs in the browser (especially Mobile Safari) can cause the sampleRate to change from 44100 to 48000.\n // By calling Howler.unload(), we create a new AudioContext with the correct sampleRate.\n if (!self._mobileUnloaded && self.ctx.sampleRate !== 44100) {\n self._mobileUnloaded = true;\n self.unload();\n }\n\n // Scratch buffer for enabling iOS to dispose of web audio buffers correctly, as per:\n // http://stackoverflow.com/questions/24119684\n self._scratchBuffer = self.ctx.createBuffer(1, 1, 22050);\n\n // Call this method on touch start to create and play a buffer,\n // then check if the audio actually played to determine if\n // audio has now been unlocked on iOS, Android, etc.\n var unlock = function(e) {\n // Create a pool of unlocked HTML5 Audio objects that can\n // be used for playing sounds without user interaction. HTML5\n // Audio objects must be individually unlocked, as opposed\n // to the WebAudio API which only needs a single activation.\n // This must occur before WebAudio setup or the source.onended\n // event will not fire.\n while (self._html5AudioPool.length < self.html5PoolSize) {\n try {\n var audioNode = new Audio();\n\n // Mark this Audio object as unlocked to ensure it can get returned\n // to the unlocked pool when released.\n audioNode._unlocked = true;\n\n // Add the audio node to the pool.\n self._releaseHtml5Audio(audioNode);\n } catch (e) {\n self.noAudio = true;\n break;\n }\n }\n\n // Loop through any assigned audio nodes and unlock them.\n for (var i=0; i= 55.\n if (typeof self.ctx.resume === 'function') {\n self.ctx.resume();\n }\n\n // Setup a timeout to check that we are unlocked on the next event loop.\n source.onended = function() {\n source.disconnect(0);\n\n // Update the unlocked state and prevent this check from happening again.\n self._audioUnlocked = true;\n\n // Remove the touch start listener.\n document.removeEventListener('touchstart', unlock, true);\n document.removeEventListener('touchend', unlock, true);\n document.removeEventListener('click', unlock, true);\n document.removeEventListener('keydown', unlock, true);\n\n // Let all sounds know that audio has been unlocked.\n for (var i=0; i 0 ? sound._seek : self._sprite[sprite][0] / 1000);\n var duration = Math.max(0, ((self._sprite[sprite][0] + self._sprite[sprite][1]) / 1000) - seek);\n var timeout = (duration * 1000) / Math.abs(sound._rate);\n var start = self._sprite[sprite][0] / 1000;\n var stop = (self._sprite[sprite][0] + self._sprite[sprite][1]) / 1000;\n sound._sprite = sprite;\n\n // Mark the sound as ended instantly so that this async playback\n // doesn't get grabbed by another call to play while this one waits to start.\n sound._ended = false;\n\n // Update the parameters of the sound.\n var setParams = function() {\n sound._paused = false;\n sound._seek = seek;\n sound._start = start;\n sound._stop = stop;\n sound._loop = !!(sound._loop || self._sprite[sprite][2]);\n };\n\n // End the sound instantly if seek is at the end.\n if (seek >= stop) {\n self._ended(sound);\n return;\n }\n\n // Begin the actual playback.\n var node = sound._node;\n if (self._webAudio) {\n // Fire this when the sound is ready to play to begin Web Audio playback.\n var playWebAudio = function() {\n self._playLock = false;\n setParams();\n self._refreshBuffer(sound);\n\n // Setup the playback params.\n var vol = (sound._muted || self._muted) ? 0 : sound._volume;\n node.gain.setValueAtTime(vol, Howler.ctx.currentTime);\n sound._playStart = Howler.ctx.currentTime;\n\n // Play the sound using the supported method.\n if (typeof node.bufferSource.start === 'undefined') {\n sound._loop ? node.bufferSource.noteGrainOn(0, seek, 86400) : node.bufferSource.noteGrainOn(0, seek, duration);\n } else {\n sound._loop ? node.bufferSource.start(0, seek, 86400) : node.bufferSource.start(0, seek, duration);\n }\n\n // Start a new timer if none is present.\n if (timeout !== Infinity) {\n self._endTimers[sound._id] = setTimeout(self._ended.bind(self, sound), timeout);\n }\n\n if (!internal) {\n setTimeout(function() {\n self._emit('play', sound._id);\n self._loadQueue();\n }, 0);\n }\n };\n\n if (Howler.state === 'running' && Howler.ctx.state !== 'interrupted') {\n playWebAudio();\n } else {\n self._playLock = true;\n\n // Wait for the audio context to resume before playing.\n self.once('resume', playWebAudio);\n\n // Cancel the end timer.\n self._clearTimer(sound._id);\n }\n } else {\n // Fire this when the sound is ready to play to begin HTML5 Audio playback.\n var playHtml5 = function() {\n node.currentTime = seek;\n node.muted = sound._muted || self._muted || Howler._muted || node.muted;\n node.volume = sound._volume * Howler.volume();\n node.playbackRate = sound._rate;\n\n // Some browsers will throw an error if this is called without user interaction.\n try {\n var play = node.play();\n\n // Support older browsers that don't support promises, and thus don't have this issue.\n if (play && typeof Promise !== 'undefined' && (play instanceof Promise || typeof play.then === 'function')) {\n // Implements a lock to prevent DOMException: The play() request was interrupted by a call to pause().\n self._playLock = true;\n\n // Set param values immediately.\n setParams();\n\n // Releases the lock and executes queued actions.\n play\n .then(function() {\n self._playLock = false;\n node._unlocked = true;\n if (!internal) {\n self._emit('play', sound._id);\n } else {\n self._loadQueue();\n }\n })\n .catch(function() {\n self._playLock = false;\n self._emit('playerror', sound._id, 'Playback was unable to start. This is most commonly an issue ' +\n 'on mobile devices and Chrome where playback was not within a user interaction.');\n\n // Reset the ended and paused values.\n sound._ended = true;\n sound._paused = true;\n });\n } else if (!internal) {\n self._playLock = false;\n setParams();\n self._emit('play', sound._id);\n }\n\n // Setting rate before playing won't work in IE, so we set it again here.\n node.playbackRate = sound._rate;\n\n // If the node is still paused, then we can assume there was a playback issue.\n if (node.paused) {\n self._emit('playerror', sound._id, 'Playback was unable to start. This is most commonly an issue ' +\n 'on mobile devices and Chrome where playback was not within a user interaction.');\n return;\n }\n\n // Setup the end timer on sprites or listen for the ended event.\n if (sprite !== '__default' || sound._loop) {\n self._endTimers[sound._id] = setTimeout(self._ended.bind(self, sound), timeout);\n } else {\n self._endTimers[sound._id] = function() {\n // Fire ended on this audio node.\n self._ended(sound);\n\n // Clear this listener.\n node.removeEventListener('ended', self._endTimers[sound._id], false);\n };\n node.addEventListener('ended', self._endTimers[sound._id], false);\n }\n } catch (err) {\n self._emit('playerror', sound._id, err);\n }\n };\n\n // If this is streaming audio, make sure the src is set and load again.\n if (node.src === 'data:audio/wav;base64,UklGRigAAABXQVZFZm10IBIAAAABAAEARKwAAIhYAQACABAAAABkYXRhAgAAAAEA') {\n node.src = self._src;\n node.load();\n }\n\n // Play immediately if ready, or wait for the 'canplaythrough'e vent.\n var loadedNoReadyState = (window && window.ejecta) || (!node.readyState && Howler._navigator.isCocoonJS);\n if (node.readyState >= 3 || loadedNoReadyState) {\n playHtml5();\n } else {\n self._playLock = true;\n self._state = 'loading';\n\n var listener = function() {\n self._state = 'loaded';\n \n // Begin playback.\n playHtml5();\n\n // Clear this listener.\n node.removeEventListener(Howler._canPlayEvent, listener, false);\n };\n node.addEventListener(Howler._canPlayEvent, listener, false);\n\n // Cancel the end timer.\n self._clearTimer(sound._id);\n }\n }\n\n return sound._id;\n },\n\n /**\n * Pause playback and save current position.\n * @param {Number} id The sound ID (empty to pause all in group).\n * @return {Howl}\n */\n pause: function(id) {\n var self = this;\n\n // If the sound hasn't loaded or a play() promise is pending, add it to the load queue to pause when capable.\n if (self._state !== 'loaded' || self._playLock) {\n self._queue.push({\n event: 'pause',\n action: function() {\n self.pause(id);\n }\n });\n\n return self;\n }\n\n // If no id is passed, get all ID's to be paused.\n var ids = self._getSoundIds(id);\n\n for (var i=0; i Returns the group's volume value.\n * volume(id) -> Returns the sound id's current volume.\n * volume(vol) -> Sets the volume of all sounds in this Howl group.\n * volume(vol, id) -> Sets the volume of passed sound id.\n * @return {Howl/Number} Returns self or current volume.\n */\n volume: function() {\n var self = this;\n var args = arguments;\n var vol, id;\n\n // Determine the values based on arguments.\n if (args.length === 0) {\n // Return the value of the groups' volume.\n return self._volume;\n } else if (args.length === 1 || args.length === 2 && typeof args[1] === 'undefined') {\n // First check if this is an ID, and if not, assume it is a new volume.\n var ids = self._getSoundIds();\n var index = ids.indexOf(args[0]);\n if (index >= 0) {\n id = parseInt(args[0], 10);\n } else {\n vol = parseFloat(args[0]);\n }\n } else if (args.length >= 2) {\n vol = parseFloat(args[0]);\n id = parseInt(args[1], 10);\n }\n\n // Update the volume or return the current volume.\n var sound;\n if (typeof vol !== 'undefined' && vol >= 0 && vol <= 1) {\n // If the sound hasn't loaded, add it to the load queue to change volume when capable.\n if (self._state !== 'loaded'|| self._playLock) {\n self._queue.push({\n event: 'volume',\n action: function() {\n self.volume.apply(self, args);\n }\n });\n\n return self;\n }\n\n // Set the group volume.\n if (typeof id === 'undefined') {\n self._volume = vol;\n }\n\n // Update one or all volumes.\n id = self._getSoundIds(id);\n for (var i=0; i 0) ? len / steps : len);\n var lastTick = Date.now();\n\n // Store the value being faded to.\n sound._fadeTo = to;\n\n // Update the volume value on each interval tick.\n sound._interval = setInterval(function() {\n // Update the volume based on the time since the last tick.\n var tick = (Date.now() - lastTick) / len;\n lastTick = Date.now();\n vol += diff * tick;\n\n // Round to within 2 decimal points.\n vol = Math.round(vol * 100) / 100;\n\n // Make sure the volume is in the right bounds.\n if (diff < 0) {\n vol = Math.max(to, vol);\n } else {\n vol = Math.min(to, vol);\n }\n\n // Change the volume.\n if (self._webAudio) {\n sound._volume = vol;\n } else {\n self.volume(vol, sound._id, true);\n }\n\n // Set the group's volume.\n if (isGroup) {\n self._volume = vol;\n }\n\n // When the fade is complete, stop it and fire event.\n if ((to < from && vol <= to) || (to > from && vol >= to)) {\n clearInterval(sound._interval);\n sound._interval = null;\n sound._fadeTo = null;\n self.volume(to, sound._id);\n self._emit('fade', sound._id);\n }\n }, stepLen);\n },\n\n /**\n * Internal method that stops the currently playing fade when\n * a new fade starts, volume is changed or the sound is stopped.\n * @param {Number} id The sound id.\n * @return {Howl}\n */\n _stopFade: function(id) {\n var self = this;\n var sound = self._soundById(id);\n\n if (sound && sound._interval) {\n if (self._webAudio) {\n sound._node.gain.cancelScheduledValues(Howler.ctx.currentTime);\n }\n\n clearInterval(sound._interval);\n sound._interval = null;\n self.volume(sound._fadeTo, id);\n sound._fadeTo = null;\n self._emit('fade', id);\n }\n\n return self;\n },\n\n /**\n * Get/set the loop parameter on a sound. This method can optionally take 0, 1 or 2 arguments.\n * loop() -> Returns the group's loop value.\n * loop(id) -> Returns the sound id's loop value.\n * loop(loop) -> Sets the loop value for all sounds in this Howl group.\n * loop(loop, id) -> Sets the loop value of passed sound id.\n * @return {Howl/Boolean} Returns self or current loop value.\n */\n loop: function() {\n var self = this;\n var args = arguments;\n var loop, id, sound;\n\n // Determine the values for loop and id.\n if (args.length === 0) {\n // Return the grou's loop value.\n return self._loop;\n } else if (args.length === 1) {\n if (typeof args[0] === 'boolean') {\n loop = args[0];\n self._loop = loop;\n } else {\n // Return this sound's loop value.\n sound = self._soundById(parseInt(args[0], 10));\n return sound ? sound._loop : false;\n }\n } else if (args.length === 2) {\n loop = args[0];\n id = parseInt(args[1], 10);\n }\n\n // If no id is passed, get all ID's to be looped.\n var ids = self._getSoundIds(id);\n for (var i=0; i Returns the first sound node's current playback rate.\n * rate(id) -> Returns the sound id's current playback rate.\n * rate(rate) -> Sets the playback rate of all sounds in this Howl group.\n * rate(rate, id) -> Sets the playback rate of passed sound id.\n * @return {Howl/Number} Returns self or the current playback rate.\n */\n rate: function() {\n var self = this;\n var args = arguments;\n var rate, id;\n\n // Determine the values based on arguments.\n if (args.length === 0) {\n // We will simply return the current rate of the first node.\n id = self._sounds[0]._id;\n } else if (args.length === 1) {\n // First check if this is an ID, and if not, assume it is a new rate value.\n var ids = self._getSoundIds();\n var index = ids.indexOf(args[0]);\n if (index >= 0) {\n id = parseInt(args[0], 10);\n } else {\n rate = parseFloat(args[0]);\n }\n } else if (args.length === 2) {\n rate = parseFloat(args[0]);\n id = parseInt(args[1], 10);\n }\n\n // Update the playback rate or return the current value.\n var sound;\n if (typeof rate === 'number') {\n // If the sound hasn't loaded, add it to the load queue to change playback rate when capable.\n if (self._state !== 'loaded' || self._playLock) {\n self._queue.push({\n event: 'rate',\n action: function() {\n self.rate.apply(self, args);\n }\n });\n\n return self;\n }\n\n // Set the group rate.\n if (typeof id === 'undefined') {\n self._rate = rate;\n }\n\n // Update one or all volumes.\n id = self._getSoundIds(id);\n for (var i=0; i Returns the first sound node's current seek position.\n * seek(id) -> Returns the sound id's current seek position.\n * seek(seek) -> Sets the seek position of the first sound node.\n * seek(seek, id) -> Sets the seek position of passed sound id.\n * @return {Howl/Number} Returns self or the current seek position.\n */\n seek: function() {\n var self = this;\n var args = arguments;\n var seek, id;\n\n // Determine the values based on arguments.\n if (args.length === 0) {\n // We will simply return the current position of the first node.\n if (self._sounds.length) {\n id = self._sounds[0]._id;\n }\n } else if (args.length === 1) {\n // First check if this is an ID, and if not, assume it is a new seek position.\n var ids = self._getSoundIds();\n var index = ids.indexOf(args[0]);\n if (index >= 0) {\n id = parseInt(args[0], 10);\n } else if (self._sounds.length) {\n id = self._sounds[0]._id;\n seek = parseFloat(args[0]);\n }\n } else if (args.length === 2) {\n seek = parseFloat(args[0]);\n id = parseInt(args[1], 10);\n }\n\n // If there is no ID, bail out.\n if (typeof id === 'undefined') {\n return 0;\n }\n\n // If the sound hasn't loaded, add it to the load queue to seek when capable.\n if (typeof seek === 'number' && (self._state !== 'loaded' || self._playLock)) {\n self._queue.push({\n event: 'seek',\n action: function() {\n self.seek.apply(self, args);\n }\n });\n\n return self;\n }\n\n // Get the sound.\n var sound = self._soundById(id);\n\n if (sound) {\n if (typeof seek === 'number' && seek >= 0) {\n // Pause the sound and update position for restarting playback.\n var playing = self.playing(id);\n if (playing) {\n self.pause(id, true);\n }\n\n // Move the position of the track and cancel timer.\n sound._seek = seek;\n sound._ended = false;\n self._clearTimer(id);\n\n // Update the seek position for HTML5 Audio.\n if (!self._webAudio && sound._node && !isNaN(sound._node.duration)) {\n sound._node.currentTime = seek;\n }\n\n // Seek and emit when ready.\n var seekAndEmit = function() {\n // Restart the playback if the sound was playing.\n if (playing) {\n self.play(id, true);\n }\n\n self._emit('seek', id);\n };\n\n // Wait for the play lock to be unset before emitting (HTML5 Audio).\n if (playing && !self._webAudio) {\n var emitSeek = function() {\n if (!self._playLock) {\n seekAndEmit();\n } else {\n setTimeout(emitSeek, 0);\n }\n };\n setTimeout(emitSeek, 0);\n } else {\n seekAndEmit();\n }\n } else {\n if (self._webAudio) {\n var realTime = self.playing(id) ? Howler.ctx.currentTime - sound._playStart : 0;\n var rateSeek = sound._rateSeek ? sound._rateSeek - sound._seek : 0;\n return sound._seek + (rateSeek + realTime * Math.abs(sound._rate));\n } else {\n return sound._node.currentTime;\n }\n }\n }\n\n return self;\n },\n\n /**\n * Check if a specific sound is currently playing or not (if id is provided), or check if at least one of the sounds in the group is playing or not.\n * @param {Number} id The sound id to check. If none is passed, the whole sound group is checked.\n * @return {Boolean} True if playing and false if not.\n */\n playing: function(id) {\n var self = this;\n\n // Check the passed sound ID (if any).\n if (typeof id === 'number') {\n var sound = self._soundById(id);\n return sound ? !sound._paused : false;\n }\n\n // Otherwise, loop through all sounds and check if any are playing.\n for (var i=0; i= 0) {\n Howler._howls.splice(index, 1);\n }\n\n // Delete this sound from the cache (if no other Howl is using it).\n var remCache = true;\n for (i=0; i= 0) {\n remCache = false;\n break;\n }\n }\n\n if (cache && remCache) {\n delete cache[self._src];\n }\n\n // Clear global errors.\n Howler.noAudio = false;\n\n // Clear out `self`.\n self._state = 'unloaded';\n self._sounds = [];\n self = null;\n\n return null;\n },\n\n /**\n * Listen to a custom event.\n * @param {String} event Event name.\n * @param {Function} fn Listener to call.\n * @param {Number} id (optional) Only listen to events for this sound.\n * @param {Number} once (INTERNAL) Marks event to fire only once.\n * @return {Howl}\n */\n on: function(event, fn, id, once) {\n var self = this;\n var events = self['_on' + event];\n\n if (typeof fn === 'function') {\n events.push(once ? {id: id, fn: fn, once: once} : {id: id, fn: fn});\n }\n\n return self;\n },\n\n /**\n * Remove a custom event. Call without parameters to remove all events.\n * @param {String} event Event name.\n * @param {Function} fn Listener to remove. Leave empty to remove all.\n * @param {Number} id (optional) Only remove events for this sound.\n * @return {Howl}\n */\n off: function(event, fn, id) {\n var self = this;\n var events = self['_on' + event];\n var i = 0;\n\n // Allow passing just an event and ID.\n if (typeof fn === 'number') {\n id = fn;\n fn = null;\n }\n\n if (fn || id) {\n // Loop through event store and remove the passed function.\n for (i=0; i=0; i--) {\n // Only fire the listener if the correct ID is used.\n if (!events[i].id || events[i].id === id || event === 'load') {\n setTimeout(function(fn) {\n fn.call(this, id, msg);\n }.bind(self, events[i].fn), 0);\n\n // If this event was setup with `once`, remove it.\n if (events[i].once) {\n self.off(event, events[i].fn, events[i].id);\n }\n }\n }\n\n // Pass the event type into load queue so that it can continue stepping.\n self._loadQueue(event);\n\n return self;\n },\n\n /**\n * Queue of actions initiated before the sound has loaded.\n * These will be called in sequence, with the next only firing\n * after the previous has finished executing (even if async like play).\n * @return {Howl}\n */\n _loadQueue: function(event) {\n var self = this;\n\n if (self._queue.length > 0) {\n var task = self._queue[0];\n\n // Remove this task if a matching event was passed.\n if (task.event === event) {\n self._queue.shift();\n self._loadQueue();\n }\n\n // Run the task if no event type is passed.\n if (!event) {\n task.action();\n }\n }\n\n return self;\n },\n\n /**\n * Fired when playback ends at the end of the duration.\n * @param {Sound} sound The sound object to work with.\n * @return {Howl}\n */\n _ended: function(sound) {\n var self = this;\n var sprite = sound._sprite;\n\n // If we are using IE and there was network latency we may be clipping\n // audio before it completes playing. Lets check the node to make sure it\n // believes it has completed, before ending the playback.\n if (!self._webAudio && sound._node && !sound._node.paused && !sound._node.ended && sound._node.currentTime < sound._stop) {\n setTimeout(self._ended.bind(self, sound), 100);\n return self;\n }\n\n // Should this sound loop?\n var loop = !!(sound._loop || self._sprite[sprite][2]);\n\n // Fire the ended event.\n self._emit('end', sound._id);\n\n // Restart the playback for HTML5 Audio loop.\n if (!self._webAudio && loop) {\n self.stop(sound._id, true).play(sound._id);\n }\n\n // Restart this timer if on a Web Audio loop.\n if (self._webAudio && loop) {\n self._emit('play', sound._id);\n sound._seek = sound._start || 0;\n sound._rateSeek = 0;\n sound._playStart = Howler.ctx.currentTime;\n\n var timeout = ((sound._stop - sound._start) * 1000) / Math.abs(sound._rate);\n self._endTimers[sound._id] = setTimeout(self._ended.bind(self, sound), timeout);\n }\n\n // Mark the node as paused.\n if (self._webAudio && !loop) {\n sound._paused = true;\n sound._ended = true;\n sound._seek = sound._start || 0;\n sound._rateSeek = 0;\n self._clearTimer(sound._id);\n\n // Clean up the buffer source.\n self._cleanBuffer(sound._node);\n\n // Attempt to auto-suspend AudioContext if no sounds are still playing.\n Howler._autoSuspend();\n }\n\n // When using a sprite, end the track.\n if (!self._webAudio && !loop) {\n self.stop(sound._id, true);\n }\n\n return self;\n },\n\n /**\n * Clear the end timer for a sound playback.\n * @param {Number} id The sound ID.\n * @return {Howl}\n */\n _clearTimer: function(id) {\n var self = this;\n\n if (self._endTimers[id]) {\n // Clear the timeout or remove the ended listener.\n if (typeof self._endTimers[id] !== 'function') {\n clearTimeout(self._endTimers[id]);\n } else {\n var sound = self._soundById(id);\n if (sound && sound._node) {\n sound._node.removeEventListener('ended', self._endTimers[id], false);\n }\n }\n\n delete self._endTimers[id];\n }\n\n return self;\n },\n\n /**\n * Return the sound identified by this ID, or return null.\n * @param {Number} id Sound ID\n * @return {Object} Sound object or null.\n */\n _soundById: function(id) {\n var self = this;\n\n // Loop through all sounds and find the one with this ID.\n for (var i=0; i=0; i--) {\n if (cnt <= limit) {\n return;\n }\n\n if (self._sounds[i]._ended) {\n // Disconnect the audio source when using Web Audio.\n if (self._webAudio && self._sounds[i]._node) {\n self._sounds[i]._node.disconnect(0);\n }\n\n // Remove sounds until we have the pool size.\n self._sounds.splice(i, 1);\n cnt--;\n }\n }\n },\n\n /**\n * Get all ID's from the sounds pool.\n * @param {Number} id Only return one ID if one is passed.\n * @return {Array} Array of IDs.\n */\n _getSoundIds: function(id) {\n var self = this;\n\n if (typeof id === 'undefined') {\n var ids = [];\n for (var i=0; i= 0;\n\n if (Howler._scratchBuffer && node.bufferSource) {\n node.bufferSource.onended = null;\n node.bufferSource.disconnect(0);\n if (isIOS) {\n try { node.bufferSource.buffer = Howler._scratchBuffer; } catch(e) {}\n }\n }\n node.bufferSource = null;\n\n return self;\n },\n\n /**\n * Set the source to a 0-second silence to stop any downloading (except in IE).\n * @param {Object} node Audio node to clear.\n */\n _clearSound: function(node) {\n var checkIE = /MSIE |Trident\\//.test(Howler._navigator && Howler._navigator.userAgent);\n if (!checkIE) {\n node.src = 'data:audio/wav;base64,UklGRigAAABXQVZFZm10IBIAAAABAAEARKwAAIhYAQACABAAAABkYXRhAgAAAAEA';\n }\n }\n };\n\n /** Single Sound Methods **/\n /***************************************************************************/\n\n /**\n * Setup the sound object, which each node attached to a Howl group is contained in.\n * @param {Object} howl The Howl parent group.\n */\n var Sound = function(howl) {\n this._parent = howl;\n this.init();\n };\n Sound.prototype = {\n /**\n * Initialize a new Sound object.\n * @return {Sound}\n */\n init: function() {\n var self = this;\n var parent = self._parent;\n\n // Setup the default parameters.\n self._muted = parent._muted;\n self._loop = parent._loop;\n self._volume = parent._volume;\n self._rate = parent._rate;\n self._seek = 0;\n self._paused = true;\n self._ended = true;\n self._sprite = '__default';\n\n // Generate a unique ID for this sound.\n self._id = ++Howler._counter;\n\n // Add itself to the parent's pool.\n parent._sounds.push(self);\n\n // Create the new node.\n self.create();\n\n return self;\n },\n\n /**\n * Create and setup a new sound object, whether HTML5 Audio or Web Audio.\n * @return {Sound}\n */\n create: function() {\n var self = this;\n var parent = self._parent;\n var volume = (Howler._muted || self._muted || self._parent._muted) ? 0 : self._volume;\n\n if (parent._webAudio) {\n // Create the gain node for controlling volume (the source will connect to this).\n self._node = (typeof Howler.ctx.createGain === 'undefined') ? Howler.ctx.createGainNode() : Howler.ctx.createGain();\n self._node.gain.setValueAtTime(volume, Howler.ctx.currentTime);\n self._node.paused = true;\n self._node.connect(Howler.masterGain);\n } else if (!Howler.noAudio) {\n // Get an unlocked Audio object from the pool.\n self._node = Howler._obtainHtml5Audio();\n\n // Listen for errors (http://dev.w3.org/html5/spec-author-view/spec.html#mediaerror).\n self._errorFn = self._errorListener.bind(self);\n self._node.addEventListener('error', self._errorFn, false);\n\n // Listen for 'canplaythrough' event to let us know the sound is ready.\n self._loadFn = self._loadListener.bind(self);\n self._node.addEventListener(Howler._canPlayEvent, self._loadFn, false);\n\n // Listen for the 'ended' event on the sound to account for edge-case where\n // a finite sound has a duration of Infinity.\n self._endFn = self._endListener.bind(self);\n self._node.addEventListener('ended', self._endFn, false);\n\n // Setup the new audio node.\n self._node.src = parent._src;\n self._node.preload = parent._preload === true ? 'auto' : parent._preload;\n self._node.volume = volume * Howler.volume();\n\n // Begin loading the source.\n self._node.load();\n }\n\n return self;\n },\n\n /**\n * Reset the parameters of this sound to the original state (for recycle).\n * @return {Sound}\n */\n reset: function() {\n var self = this;\n var parent = self._parent;\n\n // Reset all of the parameters of this sound.\n self._muted = parent._muted;\n self._loop = parent._loop;\n self._volume = parent._volume;\n self._rate = parent._rate;\n self._seek = 0;\n self._rateSeek = 0;\n self._paused = true;\n self._ended = true;\n self._sprite = '__default';\n\n // Generate a new ID so that it isn't confused with the previous sound.\n self._id = ++Howler._counter;\n\n return self;\n },\n\n /**\n * HTML5 Audio error listener callback.\n */\n _errorListener: function() {\n var self = this;\n\n // Fire an error event and pass back the code.\n self._parent._emit('loaderror', self._id, self._node.error ? self._node.error.code : 0);\n\n // Clear the event listener.\n self._node.removeEventListener('error', self._errorFn, false);\n },\n\n /**\n * HTML5 Audio canplaythrough listener callback.\n */\n _loadListener: function() {\n var self = this;\n var parent = self._parent;\n\n // Round up the duration to account for the lower precision in HTML5 Audio.\n parent._duration = Math.ceil(self._node.duration * 10) / 10;\n\n // Setup a sprite if none is defined.\n if (Object.keys(parent._sprite).length === 0) {\n parent._sprite = {__default: [0, parent._duration * 1000]};\n }\n\n if (parent._state !== 'loaded') {\n parent._state = 'loaded';\n parent._emit('load');\n parent._loadQueue();\n }\n\n // Clear the event listener.\n self._node.removeEventListener(Howler._canPlayEvent, self._loadFn, false);\n },\n\n /**\n * HTML5 Audio ended listener callback.\n */\n _endListener: function() {\n var self = this;\n var parent = self._parent;\n\n // Only handle the `ended`` event if the duration is Infinity.\n if (parent._duration === Infinity) {\n // Update the parent duration to match the real audio duration.\n // Round up the duration to account for the lower precision in HTML5 Audio.\n parent._duration = Math.ceil(self._node.duration * 10) / 10;\n\n // Update the sprite that corresponds to the real duration.\n if (parent._sprite.__default[1] === Infinity) {\n parent._sprite.__default[1] = parent._duration * 1000;\n }\n\n // Run the regular ended method.\n parent._ended(self);\n }\n\n // Clear the event listener since the duration is now correct.\n self._node.removeEventListener('ended', self._endFn, false);\n }\n };\n\n /** Helper Methods **/\n /***************************************************************************/\n\n var cache = {};\n\n /**\n * Buffer a sound from URL, Data URI or cache and decode to audio source (Web Audio API).\n * @param {Howl} self\n */\n var loadBuffer = function(self) {\n var url = self._src;\n\n // Check if the buffer has already been cached and use it instead.\n if (cache[url]) {\n // Set the duration from the cache.\n self._duration = cache[url].duration;\n\n // Load the sound into this Howl.\n loadSound(self);\n\n return;\n }\n\n if (/^data:[^;]+;base64,/.test(url)) {\n // Decode the base64 data URI without XHR, since some browsers don't support it.\n var data = atob(url.split(',')[1]);\n var dataView = new Uint8Array(data.length);\n for (var i=0; i 0) {\n cache[self._src] = buffer;\n loadSound(self, buffer);\n } else {\n error();\n }\n };\n\n // Decode the buffer into an audio source.\n if (typeof Promise !== 'undefined' && Howler.ctx.decodeAudioData.length === 1) {\n Howler.ctx.decodeAudioData(arraybuffer).then(success).catch(error);\n } else {\n Howler.ctx.decodeAudioData(arraybuffer, success, error);\n }\n }\n\n /**\n * Sound is now loaded, so finish setting everything up and fire the loaded event.\n * @param {Howl} self\n * @param {Object} buffer The decoded buffer sound source.\n */\n var loadSound = function(self, buffer) {\n // Set the duration.\n if (buffer && !self._duration) {\n self._duration = buffer.duration;\n }\n\n // Setup a sprite if none is defined.\n if (Object.keys(self._sprite).length === 0) {\n self._sprite = {__default: [0, self._duration * 1000]};\n }\n\n // Fire the loaded event.\n if (self._state !== 'loaded') {\n self._state = 'loaded';\n self._emit('load');\n self._loadQueue();\n }\n };\n\n /**\n * Setup the audio context when available, or switch to HTML5 Audio mode.\n */\n var setupAudioContext = function() {\n // If we have already detected that Web Audio isn't supported, don't run this step again.\n if (!Howler.usingWebAudio) {\n return;\n }\n\n // Check if we are using Web Audio and setup the AudioContext if we are.\n try {\n if (typeof AudioContext !== 'undefined') {\n Howler.ctx = new AudioContext();\n } else if (typeof webkitAudioContext !== 'undefined') {\n Howler.ctx = new webkitAudioContext();\n } else {\n Howler.usingWebAudio = false;\n }\n } catch(e) {\n Howler.usingWebAudio = false;\n }\n\n // If the audio context creation still failed, set using web audio to false.\n if (!Howler.ctx) {\n Howler.usingWebAudio = false;\n }\n\n // Check if a webview is being used on iOS8 or earlier (rather than the browser).\n // If it is, disable Web Audio as it causes crashing.\n var iOS = (/iP(hone|od|ad)/.test(Howler._navigator && Howler._navigator.platform));\n var appVersion = Howler._navigator && Howler._navigator.appVersion.match(/OS (\\d+)_(\\d+)_?(\\d+)?/);\n var version = appVersion ? parseInt(appVersion[1], 10) : null;\n if (iOS && version && version < 9) {\n var safari = /safari/.test(Howler._navigator && Howler._navigator.userAgent.toLowerCase());\n if (Howler._navigator && !safari) {\n Howler.usingWebAudio = false;\n }\n }\n\n // Create and expose the master GainNode when using Web Audio (useful for plugins or advanced usage).\n if (Howler.usingWebAudio) {\n Howler.masterGain = (typeof Howler.ctx.createGain === 'undefined') ? Howler.ctx.createGainNode() : Howler.ctx.createGain();\n Howler.masterGain.gain.setValueAtTime(Howler._muted ? 0 : Howler._volume, Howler.ctx.currentTime);\n Howler.masterGain.connect(Howler.ctx.destination);\n }\n\n // Re-run the setup on Howler.\n Howler._setup();\n };\n\n // Add support for AMD (Asynchronous Module Definition) libraries such as require.js.\n if (typeof define === 'function' && define.amd) {\n define([], function() {\n return {\n Howler: Howler,\n Howl: Howl\n };\n });\n }\n\n // Add support for CommonJS libraries such as browserify.\n if (typeof exports !== 'undefined') {\n exports.Howler = Howler;\n exports.Howl = Howl;\n }\n\n // Add to global in Node.js (for testing, etc).\n if (typeof global !== 'undefined') {\n global.HowlerGlobal = HowlerGlobal;\n global.Howler = Howler;\n global.Howl = Howl;\n global.Sound = Sound;\n } else if (typeof window !== 'undefined') { // Define globally in case AMD is not available or unused.\n window.HowlerGlobal = HowlerGlobal;\n window.Howler = Howler;\n window.Howl = Howl;\n window.Sound = Sound;\n }\n})();\n\n\n/*!\n * Spatial Plugin - Adds support for stereo and 3D audio where Web Audio is supported.\n * \n * howler.js v2.2.3\n * howlerjs.com\n *\n * (c) 2013-2020, James Simpson of GoldFire Studios\n * goldfirestudios.com\n *\n * MIT License\n */\n\n(function() {\n\n 'use strict';\n\n // Setup default properties.\n HowlerGlobal.prototype._pos = [0, 0, 0];\n HowlerGlobal.prototype._orientation = [0, 0, -1, 0, 1, 0];\n\n /** Global Methods **/\n /***************************************************************************/\n\n /**\n * Helper method to update the stereo panning position of all current Howls.\n * Future Howls will not use this value unless explicitly set.\n * @param {Number} pan A value of -1.0 is all the way left and 1.0 is all the way right.\n * @return {Howler/Number} Self or current stereo panning value.\n */\n HowlerGlobal.prototype.stereo = function(pan) {\n var self = this;\n\n // Stop right here if not using Web Audio.\n if (!self.ctx || !self.ctx.listener) {\n return self;\n }\n\n // Loop through all Howls and update their stereo panning.\n for (var i=self._howls.length-1; i>=0; i--) {\n self._howls[i].stereo(pan);\n }\n\n return self;\n };\n\n /**\n * Get/set the position of the listener in 3D cartesian space. Sounds using\n * 3D position will be relative to the listener's position.\n * @param {Number} x The x-position of the listener.\n * @param {Number} y The y-position of the listener.\n * @param {Number} z The z-position of the listener.\n * @return {Howler/Array} Self or current listener position.\n */\n HowlerGlobal.prototype.pos = function(x, y, z) {\n var self = this;\n\n // Stop right here if not using Web Audio.\n if (!self.ctx || !self.ctx.listener) {\n return self;\n }\n\n // Set the defaults for optional 'y' & 'z'.\n y = (typeof y !== 'number') ? self._pos[1] : y;\n z = (typeof z !== 'number') ? self._pos[2] : z;\n\n if (typeof x === 'number') {\n self._pos = [x, y, z];\n\n if (typeof self.ctx.listener.positionX !== 'undefined') {\n self.ctx.listener.positionX.setTargetAtTime(self._pos[0], Howler.ctx.currentTime, 0.1);\n self.ctx.listener.positionY.setTargetAtTime(self._pos[1], Howler.ctx.currentTime, 0.1);\n self.ctx.listener.positionZ.setTargetAtTime(self._pos[2], Howler.ctx.currentTime, 0.1);\n } else {\n self.ctx.listener.setPosition(self._pos[0], self._pos[1], self._pos[2]);\n }\n } else {\n return self._pos;\n }\n\n return self;\n };\n\n /**\n * Get/set the direction the listener is pointing in the 3D cartesian space.\n * A front and up vector must be provided. The front is the direction the\n * face of the listener is pointing, and up is the direction the top of the\n * listener is pointing. Thus, these values are expected to be at right angles\n * from each other.\n * @param {Number} x The x-orientation of the listener.\n * @param {Number} y The y-orientation of the listener.\n * @param {Number} z The z-orientation of the listener.\n * @param {Number} xUp The x-orientation of the top of the listener.\n * @param {Number} yUp The y-orientation of the top of the listener.\n * @param {Number} zUp The z-orientation of the top of the listener.\n * @return {Howler/Array} Returns self or the current orientation vectors.\n */\n HowlerGlobal.prototype.orientation = function(x, y, z, xUp, yUp, zUp) {\n var self = this;\n\n // Stop right here if not using Web Audio.\n if (!self.ctx || !self.ctx.listener) {\n return self;\n }\n\n // Set the defaults for optional 'y' & 'z'.\n var or = self._orientation;\n y = (typeof y !== 'number') ? or[1] : y;\n z = (typeof z !== 'number') ? or[2] : z;\n xUp = (typeof xUp !== 'number') ? or[3] : xUp;\n yUp = (typeof yUp !== 'number') ? or[4] : yUp;\n zUp = (typeof zUp !== 'number') ? or[5] : zUp;\n\n if (typeof x === 'number') {\n self._orientation = [x, y, z, xUp, yUp, zUp];\n\n if (typeof self.ctx.listener.forwardX !== 'undefined') {\n self.ctx.listener.forwardX.setTargetAtTime(x, Howler.ctx.currentTime, 0.1);\n self.ctx.listener.forwardY.setTargetAtTime(y, Howler.ctx.currentTime, 0.1);\n self.ctx.listener.forwardZ.setTargetAtTime(z, Howler.ctx.currentTime, 0.1);\n self.ctx.listener.upX.setTargetAtTime(xUp, Howler.ctx.currentTime, 0.1);\n self.ctx.listener.upY.setTargetAtTime(yUp, Howler.ctx.currentTime, 0.1);\n self.ctx.listener.upZ.setTargetAtTime(zUp, Howler.ctx.currentTime, 0.1);\n } else {\n self.ctx.listener.setOrientation(x, y, z, xUp, yUp, zUp);\n }\n } else {\n return or;\n }\n\n return self;\n };\n\n /** Group Methods **/\n /***************************************************************************/\n\n /**\n * Add new properties to the core init.\n * @param {Function} _super Core init method.\n * @return {Howl}\n */\n Howl.prototype.init = (function(_super) {\n return function(o) {\n var self = this;\n\n // Setup user-defined default properties.\n self._orientation = o.orientation || [1, 0, 0];\n self._stereo = o.stereo || null;\n self._pos = o.pos || null;\n self._pannerAttr = {\n coneInnerAngle: typeof o.coneInnerAngle !== 'undefined' ? o.coneInnerAngle : 360,\n coneOuterAngle: typeof o.coneOuterAngle !== 'undefined' ? o.coneOuterAngle : 360,\n coneOuterGain: typeof o.coneOuterGain !== 'undefined' ? o.coneOuterGain : 0,\n distanceModel: typeof o.distanceModel !== 'undefined' ? o.distanceModel : 'inverse',\n maxDistance: typeof o.maxDistance !== 'undefined' ? o.maxDistance : 10000,\n panningModel: typeof o.panningModel !== 'undefined' ? o.panningModel : 'HRTF',\n refDistance: typeof o.refDistance !== 'undefined' ? o.refDistance : 1,\n rolloffFactor: typeof o.rolloffFactor !== 'undefined' ? o.rolloffFactor : 1\n };\n\n // Setup event listeners.\n self._onstereo = o.onstereo ? [{fn: o.onstereo}] : [];\n self._onpos = o.onpos ? [{fn: o.onpos}] : [];\n self._onorientation = o.onorientation ? [{fn: o.onorientation}] : [];\n\n // Complete initilization with howler.js core's init function.\n return _super.call(this, o);\n };\n })(Howl.prototype.init);\n\n /**\n * Get/set the stereo panning of the audio source for this sound or all in the group.\n * @param {Number} pan A value of -1.0 is all the way left and 1.0 is all the way right.\n * @param {Number} id (optional) The sound ID. If none is passed, all in group will be updated.\n * @return {Howl/Number} Returns self or the current stereo panning value.\n */\n Howl.prototype.stereo = function(pan, id) {\n var self = this;\n\n // Stop right here if not using Web Audio.\n if (!self._webAudio) {\n return self;\n }\n\n // If the sound hasn't loaded, add it to the load queue to change stereo pan when capable.\n if (self._state !== 'loaded') {\n self._queue.push({\n event: 'stereo',\n action: function() {\n self.stereo(pan, id);\n }\n });\n\n return self;\n }\n\n // Check for PannerStereoNode support and fallback to PannerNode if it doesn't exist.\n var pannerType = (typeof Howler.ctx.createStereoPanner === 'undefined') ? 'spatial' : 'stereo';\n\n // Setup the group's stereo panning if no ID is passed.\n if (typeof id === 'undefined') {\n // Return the group's stereo panning if no parameters are passed.\n if (typeof pan === 'number') {\n self._stereo = pan;\n self._pos = [pan, 0, 0];\n } else {\n return self._stereo;\n }\n }\n\n // Change the streo panning of one or all sounds in group.\n var ids = self._getSoundIds(id);\n for (var i=0; i Returns the group's values.\n * pannerAttr(id) -> Returns the sound id's values.\n * pannerAttr(o) -> Set's the values of all sounds in this Howl group.\n * pannerAttr(o, id) -> Set's the values of passed sound id.\n *\n * Attributes:\n * coneInnerAngle - (360 by default) A parameter for directional audio sources, this is an angle, in degrees,\n * inside of which there will be no volume reduction.\n * coneOuterAngle - (360 by default) A parameter for directional audio sources, this is an angle, in degrees,\n * outside of which the volume will be reduced to a constant value of `coneOuterGain`.\n * coneOuterGain - (0 by default) A parameter for directional audio sources, this is the gain outside of the\n * `coneOuterAngle`. It is a linear value in the range `[0, 1]`.\n * distanceModel - ('inverse' by default) Determines algorithm used to reduce volume as audio moves away from\n * listener. Can be `linear`, `inverse` or `exponential.\n * maxDistance - (10000 by default) The maximum distance between source and listener, after which the volume\n * will not be reduced any further.\n * refDistance - (1 by default) A reference distance for reducing volume as source moves further from the listener.\n * This is simply a variable of the distance model and has a different effect depending on which model\n * is used and the scale of your coordinates. Generally, volume will be equal to 1 at this distance.\n * rolloffFactor - (1 by default) How quickly the volume reduces as source moves from listener. This is simply a\n * variable of the distance model and can be in the range of `[0, 1]` with `linear` and `[0, ∞]`\n * with `inverse` and `exponential`.\n * panningModel - ('HRTF' by default) Determines which spatialization algorithm is used to position audio.\n * Can be `HRTF` or `equalpower`.\n *\n * @return {Howl/Object} Returns self or current panner attributes.\n */\n Howl.prototype.pannerAttr = function() {\n var self = this;\n var args = arguments;\n var o, id, sound;\n\n // Stop right here if not using Web Audio.\n if (!self._webAudio) {\n return self;\n }\n\n // Determine the values based on arguments.\n if (args.length === 0) {\n // Return the group's panner attribute values.\n return self._pannerAttr;\n } else if (args.length === 1) {\n if (typeof args[0] === 'object') {\n o = args[0];\n\n // Set the grou's panner attribute values.\n if (typeof id === 'undefined') {\n if (!o.pannerAttr) {\n o.pannerAttr = {\n coneInnerAngle: o.coneInnerAngle,\n coneOuterAngle: o.coneOuterAngle,\n coneOuterGain: o.coneOuterGain,\n distanceModel: o.distanceModel,\n maxDistance: o.maxDistance,\n refDistance: o.refDistance,\n rolloffFactor: o.rolloffFactor,\n panningModel: o.panningModel\n };\n }\n\n self._pannerAttr = {\n coneInnerAngle: typeof o.pannerAttr.coneInnerAngle !== 'undefined' ? o.pannerAttr.coneInnerAngle : self._coneInnerAngle,\n coneOuterAngle: typeof o.pannerAttr.coneOuterAngle !== 'undefined' ? o.pannerAttr.coneOuterAngle : self._coneOuterAngle,\n coneOuterGain: typeof o.pannerAttr.coneOuterGain !== 'undefined' ? o.pannerAttr.coneOuterGain : self._coneOuterGain,\n distanceModel: typeof o.pannerAttr.distanceModel !== 'undefined' ? o.pannerAttr.distanceModel : self._distanceModel,\n maxDistance: typeof o.pannerAttr.maxDistance !== 'undefined' ? o.pannerAttr.maxDistance : self._maxDistance,\n refDistance: typeof o.pannerAttr.refDistance !== 'undefined' ? o.pannerAttr.refDistance : self._refDistance,\n rolloffFactor: typeof o.pannerAttr.rolloffFactor !== 'undefined' ? o.pannerAttr.rolloffFactor : self._rolloffFactor,\n panningModel: typeof o.pannerAttr.panningModel !== 'undefined' ? o.pannerAttr.panningModel : self._panningModel\n };\n }\n } else {\n // Return this sound's panner attribute values.\n sound = self._soundById(parseInt(args[0], 10));\n return sound ? sound._pannerAttr : self._pannerAttr;\n }\n } else if (args.length === 2) {\n o = args[0];\n id = parseInt(args[1], 10);\n }\n\n // Update the values of the specified sounds.\n var ids = self._getSoundIds(id);\n for (var i=0; i= 0 && vol <= 1) {\n self._volume = vol;\n\n // Don't update any of the nodes if we are muted.\n if (self._muted) {\n return self;\n }\n\n // When using Web Audio, we just need to adjust the master gain.\n if (self.usingWebAudio) {\n self.masterGain.gain.setValueAtTime(vol, Howler.ctx.currentTime);\n }\n\n // Loop through and change volume for all HTML5 audio nodes.\n for (var i=0; i=0; i--) {\n self._howls[i].unload();\n }\n\n // Create a new AudioContext to make sure it is fully reset.\n if (self.usingWebAudio && self.ctx && typeof self.ctx.close !== 'undefined') {\n self.ctx.close();\n self.ctx = null;\n setupAudioContext();\n }\n\n return self;\n },\n\n /**\n * Check for codec support of specific extension.\n * @param {String} ext Audio file extention.\n * @return {Boolean}\n */\n codecs: function(ext) {\n return (this || Howler)._codecs[ext.replace(/^x-/, '')];\n },\n\n /**\n * Setup various state values for global tracking.\n * @return {Howler}\n */\n _setup: function() {\n var self = this || Howler;\n\n // Keeps track of the suspend/resume state of the AudioContext.\n self.state = self.ctx ? self.ctx.state || 'suspended' : 'suspended';\n\n // Automatically begin the 30-second suspend process\n self._autoSuspend();\n\n // Check if audio is available.\n if (!self.usingWebAudio) {\n // No audio is available on this system if noAudio is set to true.\n if (typeof Audio !== 'undefined') {\n try {\n var test = new Audio();\n\n // Check if the canplaythrough event is available.\n if (typeof test.oncanplaythrough === 'undefined') {\n self._canPlayEvent = 'canplay';\n }\n } catch(e) {\n self.noAudio = true;\n }\n } else {\n self.noAudio = true;\n }\n }\n\n // Test to make sure audio isn't disabled in Internet Explorer.\n try {\n var test = new Audio();\n if (test.muted) {\n self.noAudio = true;\n }\n } catch (e) {}\n\n // Check for supported codecs.\n if (!self.noAudio) {\n self._setupCodecs();\n }\n\n return self;\n },\n\n /**\n * Check for browser support for various codecs and cache the results.\n * @return {Howler}\n */\n _setupCodecs: function() {\n var self = this || Howler;\n var audioTest = null;\n\n // Must wrap in a try/catch because IE11 in server mode throws an error.\n try {\n audioTest = (typeof Audio !== 'undefined') ? new Audio() : null;\n } catch (err) {\n return self;\n }\n\n if (!audioTest || typeof audioTest.canPlayType !== 'function') {\n return self;\n }\n\n var mpegTest = audioTest.canPlayType('audio/mpeg;').replace(/^no$/, '');\n\n // Opera version <33 has mixed MP3 support, so we need to check for and block it.\n var ua = self._navigator ? self._navigator.userAgent : '';\n var checkOpera = ua.match(/OPR\\/([0-6].)/g);\n var isOldOpera = (checkOpera && parseInt(checkOpera[0].split('/')[1], 10) < 33);\n var checkSafari = ua.indexOf('Safari') !== -1 && ua.indexOf('Chrome') === -1;\n var safariVersion = ua.match(/Version\\/(.*?) /);\n var isOldSafari = (checkSafari && safariVersion && parseInt(safariVersion[1], 10) < 15);\n\n self._codecs = {\n mp3: !!(!isOldOpera && (mpegTest || audioTest.canPlayType('audio/mp3;').replace(/^no$/, ''))),\n mpeg: !!mpegTest,\n opus: !!audioTest.canPlayType('audio/ogg; codecs=\"opus\"').replace(/^no$/, ''),\n ogg: !!audioTest.canPlayType('audio/ogg; codecs=\"vorbis\"').replace(/^no$/, ''),\n oga: !!audioTest.canPlayType('audio/ogg; codecs=\"vorbis\"').replace(/^no$/, ''),\n wav: !!(audioTest.canPlayType('audio/wav; codecs=\"1\"') || audioTest.canPlayType('audio/wav')).replace(/^no$/, ''),\n aac: !!audioTest.canPlayType('audio/aac;').replace(/^no$/, ''),\n caf: !!audioTest.canPlayType('audio/x-caf;').replace(/^no$/, ''),\n m4a: !!(audioTest.canPlayType('audio/x-m4a;') || audioTest.canPlayType('audio/m4a;') || audioTest.canPlayType('audio/aac;')).replace(/^no$/, ''),\n m4b: !!(audioTest.canPlayType('audio/x-m4b;') || audioTest.canPlayType('audio/m4b;') || audioTest.canPlayType('audio/aac;')).replace(/^no$/, ''),\n mp4: !!(audioTest.canPlayType('audio/x-mp4;') || audioTest.canPlayType('audio/mp4;') || audioTest.canPlayType('audio/aac;')).replace(/^no$/, ''),\n weba: !!(!isOldSafari && audioTest.canPlayType('audio/webm; codecs=\"vorbis\"').replace(/^no$/, '')),\n webm: !!(!isOldSafari && audioTest.canPlayType('audio/webm; codecs=\"vorbis\"').replace(/^no$/, '')),\n dolby: !!audioTest.canPlayType('audio/mp4; codecs=\"ec-3\"').replace(/^no$/, ''),\n flac: !!(audioTest.canPlayType('audio/x-flac;') || audioTest.canPlayType('audio/flac;')).replace(/^no$/, '')\n };\n\n return self;\n },\n\n /**\n * Some browsers/devices will only allow audio to be played after a user interaction.\n * Attempt to automatically unlock audio on the first user interaction.\n * Concept from: http://paulbakaus.com/tutorials/html5/web-audio-on-ios/\n * @return {Howler}\n */\n _unlockAudio: function() {\n var self = this || Howler;\n\n // Only run this if Web Audio is supported and it hasn't already been unlocked.\n if (self._audioUnlocked || !self.ctx) {\n return;\n }\n\n self._audioUnlocked = false;\n self.autoUnlock = false;\n\n // Some mobile devices/platforms have distortion issues when opening/closing tabs and/or web views.\n // Bugs in the browser (especially Mobile Safari) can cause the sampleRate to change from 44100 to 48000.\n // By calling Howler.unload(), we create a new AudioContext with the correct sampleRate.\n if (!self._mobileUnloaded && self.ctx.sampleRate !== 44100) {\n self._mobileUnloaded = true;\n self.unload();\n }\n\n // Scratch buffer for enabling iOS to dispose of web audio buffers correctly, as per:\n // http://stackoverflow.com/questions/24119684\n self._scratchBuffer = self.ctx.createBuffer(1, 1, 22050);\n\n // Call this method on touch start to create and play a buffer,\n // then check if the audio actually played to determine if\n // audio has now been unlocked on iOS, Android, etc.\n var unlock = function(e) {\n // Create a pool of unlocked HTML5 Audio objects that can\n // be used for playing sounds without user interaction. HTML5\n // Audio objects must be individually unlocked, as opposed\n // to the WebAudio API which only needs a single activation.\n // This must occur before WebAudio setup or the source.onended\n // event will not fire.\n while (self._html5AudioPool.length < self.html5PoolSize) {\n try {\n var audioNode = new Audio();\n\n // Mark this Audio object as unlocked to ensure it can get returned\n // to the unlocked pool when released.\n audioNode._unlocked = true;\n\n // Add the audio node to the pool.\n self._releaseHtml5Audio(audioNode);\n } catch (e) {\n self.noAudio = true;\n break;\n }\n }\n\n // Loop through any assigned audio nodes and unlock them.\n for (var i=0; i= 55.\n if (typeof self.ctx.resume === 'function') {\n self.ctx.resume();\n }\n\n // Setup a timeout to check that we are unlocked on the next event loop.\n source.onended = function() {\n source.disconnect(0);\n\n // Update the unlocked state and prevent this check from happening again.\n self._audioUnlocked = true;\n\n // Remove the touch start listener.\n document.removeEventListener('touchstart', unlock, true);\n document.removeEventListener('touchend', unlock, true);\n document.removeEventListener('click', unlock, true);\n document.removeEventListener('keydown', unlock, true);\n\n // Let all sounds know that audio has been unlocked.\n for (var i=0; i 0 ? sound._seek : self._sprite[sprite][0] / 1000);\n var duration = Math.max(0, ((self._sprite[sprite][0] + self._sprite[sprite][1]) / 1000) - seek);\n var timeout = (duration * 1000) / Math.abs(sound._rate);\n var start = self._sprite[sprite][0] / 1000;\n var stop = (self._sprite[sprite][0] + self._sprite[sprite][1]) / 1000;\n sound._sprite = sprite;\n\n // Mark the sound as ended instantly so that this async playback\n // doesn't get grabbed by another call to play while this one waits to start.\n sound._ended = false;\n\n // Update the parameters of the sound.\n var setParams = function() {\n sound._paused = false;\n sound._seek = seek;\n sound._start = start;\n sound._stop = stop;\n sound._loop = !!(sound._loop || self._sprite[sprite][2]);\n };\n\n // End the sound instantly if seek is at the end.\n if (seek >= stop) {\n self._ended(sound);\n return;\n }\n\n // Begin the actual playback.\n var node = sound._node;\n if (self._webAudio) {\n // Fire this when the sound is ready to play to begin Web Audio playback.\n var playWebAudio = function() {\n self._playLock = false;\n setParams();\n self._refreshBuffer(sound);\n\n // Setup the playback params.\n var vol = (sound._muted || self._muted) ? 0 : sound._volume;\n node.gain.setValueAtTime(vol, Howler.ctx.currentTime);\n sound._playStart = Howler.ctx.currentTime;\n\n // Play the sound using the supported method.\n if (typeof node.bufferSource.start === 'undefined') {\n sound._loop ? node.bufferSource.noteGrainOn(0, seek, 86400) : node.bufferSource.noteGrainOn(0, seek, duration);\n } else {\n sound._loop ? node.bufferSource.start(0, seek, 86400) : node.bufferSource.start(0, seek, duration);\n }\n\n // Start a new timer if none is present.\n if (timeout !== Infinity) {\n self._endTimers[sound._id] = setTimeout(self._ended.bind(self, sound), timeout);\n }\n\n if (!internal) {\n setTimeout(function() {\n self._emit('play', sound._id);\n self._loadQueue();\n }, 0);\n }\n };\n\n if (Howler.state === 'running' && Howler.ctx.state !== 'interrupted') {\n playWebAudio();\n } else {\n self._playLock = true;\n\n // Wait for the audio context to resume before playing.\n self.once('resume', playWebAudio);\n\n // Cancel the end timer.\n self._clearTimer(sound._id);\n }\n } else {\n // Fire this when the sound is ready to play to begin HTML5 Audio playback.\n var playHtml5 = function() {\n node.currentTime = seek;\n node.muted = sound._muted || self._muted || Howler._muted || node.muted;\n node.volume = sound._volume * Howler.volume();\n node.playbackRate = sound._rate;\n\n // Some browsers will throw an error if this is called without user interaction.\n try {\n var play = node.play();\n\n // Support older browsers that don't support promises, and thus don't have this issue.\n if (play && typeof Promise !== 'undefined' && (play instanceof Promise || typeof play.then === 'function')) {\n // Implements a lock to prevent DOMException: The play() request was interrupted by a call to pause().\n self._playLock = true;\n\n // Set param values immediately.\n setParams();\n\n // Releases the lock and executes queued actions.\n play\n .then(function() {\n self._playLock = false;\n node._unlocked = true;\n if (!internal) {\n self._emit('play', sound._id);\n } else {\n self._loadQueue();\n }\n })\n .catch(function() {\n self._playLock = false;\n self._emit('playerror', sound._id, 'Playback was unable to start. This is most commonly an issue ' +\n 'on mobile devices and Chrome where playback was not within a user interaction.');\n\n // Reset the ended and paused values.\n sound._ended = true;\n sound._paused = true;\n });\n } else if (!internal) {\n self._playLock = false;\n setParams();\n self._emit('play', sound._id);\n }\n\n // Setting rate before playing won't work in IE, so we set it again here.\n node.playbackRate = sound._rate;\n\n // If the node is still paused, then we can assume there was a playback issue.\n if (node.paused) {\n self._emit('playerror', sound._id, 'Playback was unable to start. This is most commonly an issue ' +\n 'on mobile devices and Chrome where playback was not within a user interaction.');\n return;\n }\n\n // Setup the end timer on sprites or listen for the ended event.\n if (sprite !== '__default' || sound._loop) {\n self._endTimers[sound._id] = setTimeout(self._ended.bind(self, sound), timeout);\n } else {\n self._endTimers[sound._id] = function() {\n // Fire ended on this audio node.\n self._ended(sound);\n\n // Clear this listener.\n node.removeEventListener('ended', self._endTimers[sound._id], false);\n };\n node.addEventListener('ended', self._endTimers[sound._id], false);\n }\n } catch (err) {\n self._emit('playerror', sound._id, err);\n }\n };\n\n // If this is streaming audio, make sure the src is set and load again.\n if (node.src === 'data:audio/wav;base64,UklGRigAAABXQVZFZm10IBIAAAABAAEARKwAAIhYAQACABAAAABkYXRhAgAAAAEA') {\n node.src = self._src;\n node.load();\n }\n\n // Play immediately if ready, or wait for the 'canplaythrough'e vent.\n var loadedNoReadyState = (window && window.ejecta) || (!node.readyState && Howler._navigator.isCocoonJS);\n if (node.readyState >= 3 || loadedNoReadyState) {\n playHtml5();\n } else {\n self._playLock = true;\n self._state = 'loading';\n\n var listener = function() {\n self._state = 'loaded';\n \n // Begin playback.\n playHtml5();\n\n // Clear this listener.\n node.removeEventListener(Howler._canPlayEvent, listener, false);\n };\n node.addEventListener(Howler._canPlayEvent, listener, false);\n\n // Cancel the end timer.\n self._clearTimer(sound._id);\n }\n }\n\n return sound._id;\n },\n\n /**\n * Pause playback and save current position.\n * @param {Number} id The sound ID (empty to pause all in group).\n * @return {Howl}\n */\n pause: function(id) {\n var self = this;\n\n // If the sound hasn't loaded or a play() promise is pending, add it to the load queue to pause when capable.\n if (self._state !== 'loaded' || self._playLock) {\n self._queue.push({\n event: 'pause',\n action: function() {\n self.pause(id);\n }\n });\n\n return self;\n }\n\n // If no id is passed, get all ID's to be paused.\n var ids = self._getSoundIds(id);\n\n for (var i=0; i Returns the group's volume value.\n * volume(id) -> Returns the sound id's current volume.\n * volume(vol) -> Sets the volume of all sounds in this Howl group.\n * volume(vol, id) -> Sets the volume of passed sound id.\n * @return {Howl/Number} Returns self or current volume.\n */\n volume: function() {\n var self = this;\n var args = arguments;\n var vol, id;\n\n // Determine the values based on arguments.\n if (args.length === 0) {\n // Return the value of the groups' volume.\n return self._volume;\n } else if (args.length === 1 || args.length === 2 && typeof args[1] === 'undefined') {\n // First check if this is an ID, and if not, assume it is a new volume.\n var ids = self._getSoundIds();\n var index = ids.indexOf(args[0]);\n if (index >= 0) {\n id = parseInt(args[0], 10);\n } else {\n vol = parseFloat(args[0]);\n }\n } else if (args.length >= 2) {\n vol = parseFloat(args[0]);\n id = parseInt(args[1], 10);\n }\n\n // Update the volume or return the current volume.\n var sound;\n if (typeof vol !== 'undefined' && vol >= 0 && vol <= 1) {\n // If the sound hasn't loaded, add it to the load queue to change volume when capable.\n if (self._state !== 'loaded'|| self._playLock) {\n self._queue.push({\n event: 'volume',\n action: function() {\n self.volume.apply(self, args);\n }\n });\n\n return self;\n }\n\n // Set the group volume.\n if (typeof id === 'undefined') {\n self._volume = vol;\n }\n\n // Update one or all volumes.\n id = self._getSoundIds(id);\n for (var i=0; i 0) ? len / steps : len);\n var lastTick = Date.now();\n\n // Store the value being faded to.\n sound._fadeTo = to;\n\n // Update the volume value on each interval tick.\n sound._interval = setInterval(function() {\n // Update the volume based on the time since the last tick.\n var tick = (Date.now() - lastTick) / len;\n lastTick = Date.now();\n vol += diff * tick;\n\n // Round to within 2 decimal points.\n vol = Math.round(vol * 100) / 100;\n\n // Make sure the volume is in the right bounds.\n if (diff < 0) {\n vol = Math.max(to, vol);\n } else {\n vol = Math.min(to, vol);\n }\n\n // Change the volume.\n if (self._webAudio) {\n sound._volume = vol;\n } else {\n self.volume(vol, sound._id, true);\n }\n\n // Set the group's volume.\n if (isGroup) {\n self._volume = vol;\n }\n\n // When the fade is complete, stop it and fire event.\n if ((to < from && vol <= to) || (to > from && vol >= to)) {\n clearInterval(sound._interval);\n sound._interval = null;\n sound._fadeTo = null;\n self.volume(to, sound._id);\n self._emit('fade', sound._id);\n }\n }, stepLen);\n },\n\n /**\n * Internal method that stops the currently playing fade when\n * a new fade starts, volume is changed or the sound is stopped.\n * @param {Number} id The sound id.\n * @return {Howl}\n */\n _stopFade: function(id) {\n var self = this;\n var sound = self._soundById(id);\n\n if (sound && sound._interval) {\n if (self._webAudio) {\n sound._node.gain.cancelScheduledValues(Howler.ctx.currentTime);\n }\n\n clearInterval(sound._interval);\n sound._interval = null;\n self.volume(sound._fadeTo, id);\n sound._fadeTo = null;\n self._emit('fade', id);\n }\n\n return self;\n },\n\n /**\n * Get/set the loop parameter on a sound. This method can optionally take 0, 1 or 2 arguments.\n * loop() -> Returns the group's loop value.\n * loop(id) -> Returns the sound id's loop value.\n * loop(loop) -> Sets the loop value for all sounds in this Howl group.\n * loop(loop, id) -> Sets the loop value of passed sound id.\n * @return {Howl/Boolean} Returns self or current loop value.\n */\n loop: function() {\n var self = this;\n var args = arguments;\n var loop, id, sound;\n\n // Determine the values for loop and id.\n if (args.length === 0) {\n // Return the grou's loop value.\n return self._loop;\n } else if (args.length === 1) {\n if (typeof args[0] === 'boolean') {\n loop = args[0];\n self._loop = loop;\n } else {\n // Return this sound's loop value.\n sound = self._soundById(parseInt(args[0], 10));\n return sound ? sound._loop : false;\n }\n } else if (args.length === 2) {\n loop = args[0];\n id = parseInt(args[1], 10);\n }\n\n // If no id is passed, get all ID's to be looped.\n var ids = self._getSoundIds(id);\n for (var i=0; i Returns the first sound node's current playback rate.\n * rate(id) -> Returns the sound id's current playback rate.\n * rate(rate) -> Sets the playback rate of all sounds in this Howl group.\n * rate(rate, id) -> Sets the playback rate of passed sound id.\n * @return {Howl/Number} Returns self or the current playback rate.\n */\n rate: function() {\n var self = this;\n var args = arguments;\n var rate, id;\n\n // Determine the values based on arguments.\n if (args.length === 0) {\n // We will simply return the current rate of the first node.\n id = self._sounds[0]._id;\n } else if (args.length === 1) {\n // First check if this is an ID, and if not, assume it is a new rate value.\n var ids = self._getSoundIds();\n var index = ids.indexOf(args[0]);\n if (index >= 0) {\n id = parseInt(args[0], 10);\n } else {\n rate = parseFloat(args[0]);\n }\n } else if (args.length === 2) {\n rate = parseFloat(args[0]);\n id = parseInt(args[1], 10);\n }\n\n // Update the playback rate or return the current value.\n var sound;\n if (typeof rate === 'number') {\n // If the sound hasn't loaded, add it to the load queue to change playback rate when capable.\n if (self._state !== 'loaded' || self._playLock) {\n self._queue.push({\n event: 'rate',\n action: function() {\n self.rate.apply(self, args);\n }\n });\n\n return self;\n }\n\n // Set the group rate.\n if (typeof id === 'undefined') {\n self._rate = rate;\n }\n\n // Update one or all volumes.\n id = self._getSoundIds(id);\n for (var i=0; i Returns the first sound node's current seek position.\n * seek(id) -> Returns the sound id's current seek position.\n * seek(seek) -> Sets the seek position of the first sound node.\n * seek(seek, id) -> Sets the seek position of passed sound id.\n * @return {Howl/Number} Returns self or the current seek position.\n */\n seek: function() {\n var self = this;\n var args = arguments;\n var seek, id;\n\n // Determine the values based on arguments.\n if (args.length === 0) {\n // We will simply return the current position of the first node.\n if (self._sounds.length) {\n id = self._sounds[0]._id;\n }\n } else if (args.length === 1) {\n // First check if this is an ID, and if not, assume it is a new seek position.\n var ids = self._getSoundIds();\n var index = ids.indexOf(args[0]);\n if (index >= 0) {\n id = parseInt(args[0], 10);\n } else if (self._sounds.length) {\n id = self._sounds[0]._id;\n seek = parseFloat(args[0]);\n }\n } else if (args.length === 2) {\n seek = parseFloat(args[0]);\n id = parseInt(args[1], 10);\n }\n\n // If there is no ID, bail out.\n if (typeof id === 'undefined') {\n return 0;\n }\n\n // If the sound hasn't loaded, add it to the load queue to seek when capable.\n if (typeof seek === 'number' && (self._state !== 'loaded' || self._playLock)) {\n self._queue.push({\n event: 'seek',\n action: function() {\n self.seek.apply(self, args);\n }\n });\n\n return self;\n }\n\n // Get the sound.\n var sound = self._soundById(id);\n\n if (sound) {\n if (typeof seek === 'number' && seek >= 0) {\n // Pause the sound and update position for restarting playback.\n var playing = self.playing(id);\n if (playing) {\n self.pause(id, true);\n }\n\n // Move the position of the track and cancel timer.\n sound._seek = seek;\n sound._ended = false;\n self._clearTimer(id);\n\n // Update the seek position for HTML5 Audio.\n if (!self._webAudio && sound._node && !isNaN(sound._node.duration)) {\n sound._node.currentTime = seek;\n }\n\n // Seek and emit when ready.\n var seekAndEmit = function() {\n // Restart the playback if the sound was playing.\n if (playing) {\n self.play(id, true);\n }\n\n self._emit('seek', id);\n };\n\n // Wait for the play lock to be unset before emitting (HTML5 Audio).\n if (playing && !self._webAudio) {\n var emitSeek = function() {\n if (!self._playLock) {\n seekAndEmit();\n } else {\n setTimeout(emitSeek, 0);\n }\n };\n setTimeout(emitSeek, 0);\n } else {\n seekAndEmit();\n }\n } else {\n if (self._webAudio) {\n var realTime = self.playing(id) ? Howler.ctx.currentTime - sound._playStart : 0;\n var rateSeek = sound._rateSeek ? sound._rateSeek - sound._seek : 0;\n return sound._seek + (rateSeek + realTime * Math.abs(sound._rate));\n } else {\n return sound._node.currentTime;\n }\n }\n }\n\n return self;\n },\n\n /**\n * Check if a specific sound is currently playing or not (if id is provided), or check if at least one of the sounds in the group is playing or not.\n * @param {Number} id The sound id to check. If none is passed, the whole sound group is checked.\n * @return {Boolean} True if playing and false if not.\n */\n playing: function(id) {\n var self = this;\n\n // Check the passed sound ID (if any).\n if (typeof id === 'number') {\n var sound = self._soundById(id);\n return sound ? !sound._paused : false;\n }\n\n // Otherwise, loop through all sounds and check if any are playing.\n for (var i=0; i= 0) {\n Howler._howls.splice(index, 1);\n }\n\n // Delete this sound from the cache (if no other Howl is using it).\n var remCache = true;\n for (i=0; i= 0) {\n remCache = false;\n break;\n }\n }\n\n if (cache && remCache) {\n delete cache[self._src];\n }\n\n // Clear global errors.\n Howler.noAudio = false;\n\n // Clear out `self`.\n self._state = 'unloaded';\n self._sounds = [];\n self = null;\n\n return null;\n },\n\n /**\n * Listen to a custom event.\n * @param {String} event Event name.\n * @param {Function} fn Listener to call.\n * @param {Number} id (optional) Only listen to events for this sound.\n * @param {Number} once (INTERNAL) Marks event to fire only once.\n * @return {Howl}\n */\n on: function(event, fn, id, once) {\n var self = this;\n var events = self['_on' + event];\n\n if (typeof fn === 'function') {\n events.push(once ? {id: id, fn: fn, once: once} : {id: id, fn: fn});\n }\n\n return self;\n },\n\n /**\n * Remove a custom event. Call without parameters to remove all events.\n * @param {String} event Event name.\n * @param {Function} fn Listener to remove. Leave empty to remove all.\n * @param {Number} id (optional) Only remove events for this sound.\n * @return {Howl}\n */\n off: function(event, fn, id) {\n var self = this;\n var events = self['_on' + event];\n var i = 0;\n\n // Allow passing just an event and ID.\n if (typeof fn === 'number') {\n id = fn;\n fn = null;\n }\n\n if (fn || id) {\n // Loop through event store and remove the passed function.\n for (i=0; i=0; i--) {\n // Only fire the listener if the correct ID is used.\n if (!events[i].id || events[i].id === id || event === 'load') {\n setTimeout(function(fn) {\n fn.call(this, id, msg);\n }.bind(self, events[i].fn), 0);\n\n // If this event was setup with `once`, remove it.\n if (events[i].once) {\n self.off(event, events[i].fn, events[i].id);\n }\n }\n }\n\n // Pass the event type into load queue so that it can continue stepping.\n self._loadQueue(event);\n\n return self;\n },\n\n /**\n * Queue of actions initiated before the sound has loaded.\n * These will be called in sequence, with the next only firing\n * after the previous has finished executing (even if async like play).\n * @return {Howl}\n */\n _loadQueue: function(event) {\n var self = this;\n\n if (self._queue.length > 0) {\n var task = self._queue[0];\n\n // Remove this task if a matching event was passed.\n if (task.event === event) {\n self._queue.shift();\n self._loadQueue();\n }\n\n // Run the task if no event type is passed.\n if (!event) {\n task.action();\n }\n }\n\n return self;\n },\n\n /**\n * Fired when playback ends at the end of the duration.\n * @param {Sound} sound The sound object to work with.\n * @return {Howl}\n */\n _ended: function(sound) {\n var self = this;\n var sprite = sound._sprite;\n\n // If we are using IE and there was network latency we may be clipping\n // audio before it completes playing. Lets check the node to make sure it\n // believes it has completed, before ending the playback.\n if (!self._webAudio && sound._node && !sound._node.paused && !sound._node.ended && sound._node.currentTime < sound._stop) {\n setTimeout(self._ended.bind(self, sound), 100);\n return self;\n }\n\n // Should this sound loop?\n var loop = !!(sound._loop || self._sprite[sprite][2]);\n\n // Fire the ended event.\n self._emit('end', sound._id);\n\n // Restart the playback for HTML5 Audio loop.\n if (!self._webAudio && loop) {\n self.stop(sound._id, true).play(sound._id);\n }\n\n // Restart this timer if on a Web Audio loop.\n if (self._webAudio && loop) {\n self._emit('play', sound._id);\n sound._seek = sound._start || 0;\n sound._rateSeek = 0;\n sound._playStart = Howler.ctx.currentTime;\n\n var timeout = ((sound._stop - sound._start) * 1000) / Math.abs(sound._rate);\n self._endTimers[sound._id] = setTimeout(self._ended.bind(self, sound), timeout);\n }\n\n // Mark the node as paused.\n if (self._webAudio && !loop) {\n sound._paused = true;\n sound._ended = true;\n sound._seek = sound._start || 0;\n sound._rateSeek = 0;\n self._clearTimer(sound._id);\n\n // Clean up the buffer source.\n self._cleanBuffer(sound._node);\n\n // Attempt to auto-suspend AudioContext if no sounds are still playing.\n Howler._autoSuspend();\n }\n\n // When using a sprite, end the track.\n if (!self._webAudio && !loop) {\n self.stop(sound._id, true);\n }\n\n return self;\n },\n\n /**\n * Clear the end timer for a sound playback.\n * @param {Number} id The sound ID.\n * @return {Howl}\n */\n _clearTimer: function(id) {\n var self = this;\n\n if (self._endTimers[id]) {\n // Clear the timeout or remove the ended listener.\n if (typeof self._endTimers[id] !== 'function') {\n clearTimeout(self._endTimers[id]);\n } else {\n var sound = self._soundById(id);\n if (sound && sound._node) {\n sound._node.removeEventListener('ended', self._endTimers[id], false);\n }\n }\n\n delete self._endTimers[id];\n }\n\n return self;\n },\n\n /**\n * Return the sound identified by this ID, or return null.\n * @param {Number} id Sound ID\n * @return {Object} Sound object or null.\n */\n _soundById: function(id) {\n var self = this;\n\n // Loop through all sounds and find the one with this ID.\n for (var i=0; i=0; i--) {\n if (cnt <= limit) {\n return;\n }\n\n if (self._sounds[i]._ended) {\n // Disconnect the audio source when using Web Audio.\n if (self._webAudio && self._sounds[i]._node) {\n self._sounds[i]._node.disconnect(0);\n }\n\n // Remove sounds until we have the pool size.\n self._sounds.splice(i, 1);\n cnt--;\n }\n }\n },\n\n /**\n * Get all ID's from the sounds pool.\n * @param {Number} id Only return one ID if one is passed.\n * @return {Array} Array of IDs.\n */\n _getSoundIds: function(id) {\n var self = this;\n\n if (typeof id === 'undefined') {\n var ids = [];\n for (var i=0; i= 0;\n\n if (Howler._scratchBuffer && node.bufferSource) {\n node.bufferSource.onended = null;\n node.bufferSource.disconnect(0);\n if (isIOS) {\n try { node.bufferSource.buffer = Howler._scratchBuffer; } catch(e) {}\n }\n }\n node.bufferSource = null;\n\n return self;\n },\n\n /**\n * Set the source to a 0-second silence to stop any downloading (except in IE).\n * @param {Object} node Audio node to clear.\n */\n _clearSound: function(node) {\n var checkIE = /MSIE |Trident\\//.test(Howler._navigator && Howler._navigator.userAgent);\n if (!checkIE) {\n node.src = 'data:audio/wav;base64,UklGRigAAABXQVZFZm10IBIAAAABAAEARKwAAIhYAQACABAAAABkYXRhAgAAAAEA';\n }\n }\n };\n\n /** Single Sound Methods **/\n /***************************************************************************/\n\n /**\n * Setup the sound object, which each node attached to a Howl group is contained in.\n * @param {Object} howl The Howl parent group.\n */\n var Sound = function(howl) {\n this._parent = howl;\n this.init();\n };\n Sound.prototype = {\n /**\n * Initialize a new Sound object.\n * @return {Sound}\n */\n init: function() {\n var self = this;\n var parent = self._parent;\n\n // Setup the default parameters.\n self._muted = parent._muted;\n self._loop = parent._loop;\n self._volume = parent._volume;\n self._rate = parent._rate;\n self._seek = 0;\n self._paused = true;\n self._ended = true;\n self._sprite = '__default';\n\n // Generate a unique ID for this sound.\n self._id = ++Howler._counter;\n\n // Add itself to the parent's pool.\n parent._sounds.push(self);\n\n // Create the new node.\n self.create();\n\n return self;\n },\n\n /**\n * Create and setup a new sound object, whether HTML5 Audio or Web Audio.\n * @return {Sound}\n */\n create: function() {\n var self = this;\n var parent = self._parent;\n var volume = (Howler._muted || self._muted || self._parent._muted) ? 0 : self._volume;\n\n if (parent._webAudio) {\n // Create the gain node for controlling volume (the source will connect to this).\n self._node = (typeof Howler.ctx.createGain === 'undefined') ? Howler.ctx.createGainNode() : Howler.ctx.createGain();\n self._node.gain.setValueAtTime(volume, Howler.ctx.currentTime);\n self._node.paused = true;\n self._node.connect(Howler.masterGain);\n } else if (!Howler.noAudio) {\n // Get an unlocked Audio object from the pool.\n self._node = Howler._obtainHtml5Audio();\n\n // Listen for errors (http://dev.w3.org/html5/spec-author-view/spec.html#mediaerror).\n self._errorFn = self._errorListener.bind(self);\n self._node.addEventListener('error', self._errorFn, false);\n\n // Listen for 'canplaythrough' event to let us know the sound is ready.\n self._loadFn = self._loadListener.bind(self);\n self._node.addEventListener(Howler._canPlayEvent, self._loadFn, false);\n\n // Listen for the 'ended' event on the sound to account for edge-case where\n // a finite sound has a duration of Infinity.\n self._endFn = self._endListener.bind(self);\n self._node.addEventListener('ended', self._endFn, false);\n\n // Setup the new audio node.\n self._node.src = parent._src;\n self._node.preload = parent._preload === true ? 'auto' : parent._preload;\n self._node.volume = volume * Howler.volume();\n\n // Begin loading the source.\n self._node.load();\n }\n\n return self;\n },\n\n /**\n * Reset the parameters of this sound to the original state (for recycle).\n * @return {Sound}\n */\n reset: function() {\n var self = this;\n var parent = self._parent;\n\n // Reset all of the parameters of this sound.\n self._muted = parent._muted;\n self._loop = parent._loop;\n self._volume = parent._volume;\n self._rate = parent._rate;\n self._seek = 0;\n self._rateSeek = 0;\n self._paused = true;\n self._ended = true;\n self._sprite = '__default';\n\n // Generate a new ID so that it isn't confused with the previous sound.\n self._id = ++Howler._counter;\n\n return self;\n },\n\n /**\n * HTML5 Audio error listener callback.\n */\n _errorListener: function() {\n var self = this;\n\n // Fire an error event and pass back the code.\n self._parent._emit('loaderror', self._id, self._node.error ? self._node.error.code : 0);\n\n // Clear the event listener.\n self._node.removeEventListener('error', self._errorFn, false);\n },\n\n /**\n * HTML5 Audio canplaythrough listener callback.\n */\n _loadListener: function() {\n var self = this;\n var parent = self._parent;\n\n // Round up the duration to account for the lower precision in HTML5 Audio.\n parent._duration = Math.ceil(self._node.duration * 10) / 10;\n\n // Setup a sprite if none is defined.\n if (Object.keys(parent._sprite).length === 0) {\n parent._sprite = {__default: [0, parent._duration * 1000]};\n }\n\n if (parent._state !== 'loaded') {\n parent._state = 'loaded';\n parent._emit('load');\n parent._loadQueue();\n }\n\n // Clear the event listener.\n self._node.removeEventListener(Howler._canPlayEvent, self._loadFn, false);\n },\n\n /**\n * HTML5 Audio ended listener callback.\n */\n _endListener: function() {\n var self = this;\n var parent = self._parent;\n\n // Only handle the `ended`` event if the duration is Infinity.\n if (parent._duration === Infinity) {\n // Update the parent duration to match the real audio duration.\n // Round up the duration to account for the lower precision in HTML5 Audio.\n parent._duration = Math.ceil(self._node.duration * 10) / 10;\n\n // Update the sprite that corresponds to the real duration.\n if (parent._sprite.__default[1] === Infinity) {\n parent._sprite.__default[1] = parent._duration * 1000;\n }\n\n // Run the regular ended method.\n parent._ended(self);\n }\n\n // Clear the event listener since the duration is now correct.\n self._node.removeEventListener('ended', self._endFn, false);\n }\n };\n\n /** Helper Methods **/\n /***************************************************************************/\n\n var cache = {};\n\n /**\n * Buffer a sound from URL, Data URI or cache and decode to audio source (Web Audio API).\n * @param {Howl} self\n */\n var loadBuffer = function(self) {\n var url = self._src;\n\n // Check if the buffer has already been cached and use it instead.\n if (cache[url]) {\n // Set the duration from the cache.\n self._duration = cache[url].duration;\n\n // Load the sound into this Howl.\n loadSound(self);\n\n return;\n }\n\n if (/^data:[^;]+;base64,/.test(url)) {\n // Decode the base64 data URI without XHR, since some browsers don't support it.\n var data = atob(url.split(',')[1]);\n var dataView = new Uint8Array(data.length);\n for (var i=0; i 0) {\n cache[self._src] = buffer;\n loadSound(self, buffer);\n } else {\n error();\n }\n };\n\n // Decode the buffer into an audio source.\n if (typeof Promise !== 'undefined' && Howler.ctx.decodeAudioData.length === 1) {\n Howler.ctx.decodeAudioData(arraybuffer).then(success).catch(error);\n } else {\n Howler.ctx.decodeAudioData(arraybuffer, success, error);\n }\n }\n\n /**\n * Sound is now loaded, so finish setting everything up and fire the loaded event.\n * @param {Howl} self\n * @param {Object} buffer The decoded buffer sound source.\n */\n var loadSound = function(self, buffer) {\n // Set the duration.\n if (buffer && !self._duration) {\n self._duration = buffer.duration;\n }\n\n // Setup a sprite if none is defined.\n if (Object.keys(self._sprite).length === 0) {\n self._sprite = {__default: [0, self._duration * 1000]};\n }\n\n // Fire the loaded event.\n if (self._state !== 'loaded') {\n self._state = 'loaded';\n self._emit('load');\n self._loadQueue();\n }\n };\n\n /**\n * Setup the audio context when available, or switch to HTML5 Audio mode.\n */\n var setupAudioContext = function() {\n // If we have already detected that Web Audio isn't supported, don't run this step again.\n if (!Howler.usingWebAudio) {\n return;\n }\n\n // Check if we are using Web Audio and setup the AudioContext if we are.\n try {\n if (typeof AudioContext !== 'undefined') {\n Howler.ctx = new AudioContext();\n } else if (typeof webkitAudioContext !== 'undefined') {\n Howler.ctx = new webkitAudioContext();\n } else {\n Howler.usingWebAudio = false;\n }\n } catch(e) {\n Howler.usingWebAudio = false;\n }\n\n // If the audio context creation still failed, set using web audio to false.\n if (!Howler.ctx) {\n Howler.usingWebAudio = false;\n }\n\n // Check if a webview is being used on iOS8 or earlier (rather than the browser).\n // If it is, disable Web Audio as it causes crashing.\n var iOS = (/iP(hone|od|ad)/.test(Howler._navigator && Howler._navigator.platform));\n var appVersion = Howler._navigator && Howler._navigator.appVersion.match(/OS (\\d+)_(\\d+)_?(\\d+)?/);\n var version = appVersion ? parseInt(appVersion[1], 10) : null;\n if (iOS && version && version < 9) {\n var safari = /safari/.test(Howler._navigator && Howler._navigator.userAgent.toLowerCase());\n if (Howler._navigator && !safari) {\n Howler.usingWebAudio = false;\n }\n }\n\n // Create and expose the master GainNode when using Web Audio (useful for plugins or advanced usage).\n if (Howler.usingWebAudio) {\n Howler.masterGain = (typeof Howler.ctx.createGain === 'undefined') ? Howler.ctx.createGainNode() : Howler.ctx.createGain();\n Howler.masterGain.gain.setValueAtTime(Howler._muted ? 0 : Howler._volume, Howler.ctx.currentTime);\n Howler.masterGain.connect(Howler.ctx.destination);\n }\n\n // Re-run the setup on Howler.\n Howler._setup();\n };\n\n // Add support for AMD (Asynchronous Module Definition) libraries such as require.js.\n if (typeof define === 'function' && define.amd) {\n define([], function() {\n return {\n Howler: Howler,\n Howl: Howl\n };\n });\n }\n\n // Add support for CommonJS libraries such as browserify.\n if (typeof exports !== 'undefined') {\n exports.Howler = Howler;\n exports.Howl = Howl;\n }\n\n // Add to global in Node.js (for testing, etc).\n if (typeof global !== 'undefined') {\n global.HowlerGlobal = HowlerGlobal;\n global.Howler = Howler;\n global.Howl = Howl;\n global.Sound = Sound;\n } else if (typeof window !== 'undefined') { // Define globally in case AMD is not available or unused.\n window.HowlerGlobal = HowlerGlobal;\n window.Howler = Howler;\n window.Howl = Howl;\n window.Sound = Sound;\n }\n})();\n\n\n/*!\n * Spatial Plugin - Adds support for stereo and 3D audio where Web Audio is supported.\n * \n * howler.js v2.2.3\n * howlerjs.com\n *\n * (c) 2013-2020, James Simpson of GoldFire Studios\n * goldfirestudios.com\n *\n * MIT License\n */\n\n(function() {\n\n 'use strict';\n\n // Setup default properties.\n HowlerGlobal.prototype._pos = [0, 0, 0];\n HowlerGlobal.prototype._orientation = [0, 0, -1, 0, 1, 0];\n\n /** Global Methods **/\n /***************************************************************************/\n\n /**\n * Helper method to update the stereo panning position of all current Howls.\n * Future Howls will not use this value unless explicitly set.\n * @param {Number} pan A value of -1.0 is all the way left and 1.0 is all the way right.\n * @return {Howler/Number} Self or current stereo panning value.\n */\n HowlerGlobal.prototype.stereo = function(pan) {\n var self = this;\n\n // Stop right here if not using Web Audio.\n if (!self.ctx || !self.ctx.listener) {\n return self;\n }\n\n // Loop through all Howls and update their stereo panning.\n for (var i=self._howls.length-1; i>=0; i--) {\n self._howls[i].stereo(pan);\n }\n\n return self;\n };\n\n /**\n * Get/set the position of the listener in 3D cartesian space. Sounds using\n * 3D position will be relative to the listener's position.\n * @param {Number} x The x-position of the listener.\n * @param {Number} y The y-position of the listener.\n * @param {Number} z The z-position of the listener.\n * @return {Howler/Array} Self or current listener position.\n */\n HowlerGlobal.prototype.pos = function(x, y, z) {\n var self = this;\n\n // Stop right here if not using Web Audio.\n if (!self.ctx || !self.ctx.listener) {\n return self;\n }\n\n // Set the defaults for optional 'y' & 'z'.\n y = (typeof y !== 'number') ? self._pos[1] : y;\n z = (typeof z !== 'number') ? self._pos[2] : z;\n\n if (typeof x === 'number') {\n self._pos = [x, y, z];\n\n if (typeof self.ctx.listener.positionX !== 'undefined') {\n self.ctx.listener.positionX.setTargetAtTime(self._pos[0], Howler.ctx.currentTime, 0.1);\n self.ctx.listener.positionY.setTargetAtTime(self._pos[1], Howler.ctx.currentTime, 0.1);\n self.ctx.listener.positionZ.setTargetAtTime(self._pos[2], Howler.ctx.currentTime, 0.1);\n } else {\n self.ctx.listener.setPosition(self._pos[0], self._pos[1], self._pos[2]);\n }\n } else {\n return self._pos;\n }\n\n return self;\n };\n\n /**\n * Get/set the direction the listener is pointing in the 3D cartesian space.\n * A front and up vector must be provided. The front is the direction the\n * face of the listener is pointing, and up is the direction the top of the\n * listener is pointing. Thus, these values are expected to be at right angles\n * from each other.\n * @param {Number} x The x-orientation of the listener.\n * @param {Number} y The y-orientation of the listener.\n * @param {Number} z The z-orientation of the listener.\n * @param {Number} xUp The x-orientation of the top of the listener.\n * @param {Number} yUp The y-orientation of the top of the listener.\n * @param {Number} zUp The z-orientation of the top of the listener.\n * @return {Howler/Array} Returns self or the current orientation vectors.\n */\n HowlerGlobal.prototype.orientation = function(x, y, z, xUp, yUp, zUp) {\n var self = this;\n\n // Stop right here if not using Web Audio.\n if (!self.ctx || !self.ctx.listener) {\n return self;\n }\n\n // Set the defaults for optional 'y' & 'z'.\n var or = self._orientation;\n y = (typeof y !== 'number') ? or[1] : y;\n z = (typeof z !== 'number') ? or[2] : z;\n xUp = (typeof xUp !== 'number') ? or[3] : xUp;\n yUp = (typeof yUp !== 'number') ? or[4] : yUp;\n zUp = (typeof zUp !== 'number') ? or[5] : zUp;\n\n if (typeof x === 'number') {\n self._orientation = [x, y, z, xUp, yUp, zUp];\n\n if (typeof self.ctx.listener.forwardX !== 'undefined') {\n self.ctx.listener.forwardX.setTargetAtTime(x, Howler.ctx.currentTime, 0.1);\n self.ctx.listener.forwardY.setTargetAtTime(y, Howler.ctx.currentTime, 0.1);\n self.ctx.listener.forwardZ.setTargetAtTime(z, Howler.ctx.currentTime, 0.1);\n self.ctx.listener.upX.setTargetAtTime(xUp, Howler.ctx.currentTime, 0.1);\n self.ctx.listener.upY.setTargetAtTime(yUp, Howler.ctx.currentTime, 0.1);\n self.ctx.listener.upZ.setTargetAtTime(zUp, Howler.ctx.currentTime, 0.1);\n } else {\n self.ctx.listener.setOrientation(x, y, z, xUp, yUp, zUp);\n }\n } else {\n return or;\n }\n\n return self;\n };\n\n /** Group Methods **/\n /***************************************************************************/\n\n /**\n * Add new properties to the core init.\n * @param {Function} _super Core init method.\n * @return {Howl}\n */\n Howl.prototype.init = (function(_super) {\n return function(o) {\n var self = this;\n\n // Setup user-defined default properties.\n self._orientation = o.orientation || [1, 0, 0];\n self._stereo = o.stereo || null;\n self._pos = o.pos || null;\n self._pannerAttr = {\n coneInnerAngle: typeof o.coneInnerAngle !== 'undefined' ? o.coneInnerAngle : 360,\n coneOuterAngle: typeof o.coneOuterAngle !== 'undefined' ? o.coneOuterAngle : 360,\n coneOuterGain: typeof o.coneOuterGain !== 'undefined' ? o.coneOuterGain : 0,\n distanceModel: typeof o.distanceModel !== 'undefined' ? o.distanceModel : 'inverse',\n maxDistance: typeof o.maxDistance !== 'undefined' ? o.maxDistance : 10000,\n panningModel: typeof o.panningModel !== 'undefined' ? o.panningModel : 'HRTF',\n refDistance: typeof o.refDistance !== 'undefined' ? o.refDistance : 1,\n rolloffFactor: typeof o.rolloffFactor !== 'undefined' ? o.rolloffFactor : 1\n };\n\n // Setup event listeners.\n self._onstereo = o.onstereo ? [{fn: o.onstereo}] : [];\n self._onpos = o.onpos ? [{fn: o.onpos}] : [];\n self._onorientation = o.onorientation ? [{fn: o.onorientation}] : [];\n\n // Complete initilization with howler.js core's init function.\n return _super.call(this, o);\n };\n })(Howl.prototype.init);\n\n /**\n * Get/set the stereo panning of the audio source for this sound or all in the group.\n * @param {Number} pan A value of -1.0 is all the way left and 1.0 is all the way right.\n * @param {Number} id (optional) The sound ID. If none is passed, all in group will be updated.\n * @return {Howl/Number} Returns self or the current stereo panning value.\n */\n Howl.prototype.stereo = function(pan, id) {\n var self = this;\n\n // Stop right here if not using Web Audio.\n if (!self._webAudio) {\n return self;\n }\n\n // If the sound hasn't loaded, add it to the load queue to change stereo pan when capable.\n if (self._state !== 'loaded') {\n self._queue.push({\n event: 'stereo',\n action: function() {\n self.stereo(pan, id);\n }\n });\n\n return self;\n }\n\n // Check for PannerStereoNode support and fallback to PannerNode if it doesn't exist.\n var pannerType = (typeof Howler.ctx.createStereoPanner === 'undefined') ? 'spatial' : 'stereo';\n\n // Setup the group's stereo panning if no ID is passed.\n if (typeof id === 'undefined') {\n // Return the group's stereo panning if no parameters are passed.\n if (typeof pan === 'number') {\n self._stereo = pan;\n self._pos = [pan, 0, 0];\n } else {\n return self._stereo;\n }\n }\n\n // Change the streo panning of one or all sounds in group.\n var ids = self._getSoundIds(id);\n for (var i=0; i Returns the group's values.\n * pannerAttr(id) -> Returns the sound id's values.\n * pannerAttr(o) -> Set's the values of all sounds in this Howl group.\n * pannerAttr(o, id) -> Set's the values of passed sound id.\n *\n * Attributes:\n * coneInnerAngle - (360 by default) A parameter for directional audio sources, this is an angle, in degrees,\n * inside of which there will be no volume reduction.\n * coneOuterAngle - (360 by default) A parameter for directional audio sources, this is an angle, in degrees,\n * outside of which the volume will be reduced to a constant value of `coneOuterGain`.\n * coneOuterGain - (0 by default) A parameter for directional audio sources, this is the gain outside of the\n * `coneOuterAngle`. It is a linear value in the range `[0, 1]`.\n * distanceModel - ('inverse' by default) Determines algorithm used to reduce volume as audio moves away from\n * listener. Can be `linear`, `inverse` or `exponential.\n * maxDistance - (10000 by default) The maximum distance between source and listener, after which the volume\n * will not be reduced any further.\n * refDistance - (1 by default) A reference distance for reducing volume as source moves further from the listener.\n * This is simply a variable of the distance model and has a different effect depending on which model\n * is used and the scale of your coordinates. Generally, volume will be equal to 1 at this distance.\n * rolloffFactor - (1 by default) How quickly the volume reduces as source moves from listener. This is simply a\n * variable of the distance model and can be in the range of `[0, 1]` with `linear` and `[0, ∞]`\n * with `inverse` and `exponential`.\n * panningModel - ('HRTF' by default) Determines which spatialization algorithm is used to position audio.\n * Can be `HRTF` or `equalpower`.\n *\n * @return {Howl/Object} Returns self or current panner attributes.\n */\n Howl.prototype.pannerAttr = function() {\n var self = this;\n var args = arguments;\n var o, id, sound;\n\n // Stop right here if not using Web Audio.\n if (!self._webAudio) {\n return self;\n }\n\n // Determine the values based on arguments.\n if (args.length === 0) {\n // Return the group's panner attribute values.\n return self._pannerAttr;\n } else if (args.length === 1) {\n if (typeof args[0] === 'object') {\n o = args[0];\n\n // Set the grou's panner attribute values.\n if (typeof id === 'undefined') {\n if (!o.pannerAttr) {\n o.pannerAttr = {\n coneInnerAngle: o.coneInnerAngle,\n coneOuterAngle: o.coneOuterAngle,\n coneOuterGain: o.coneOuterGain,\n distanceModel: o.distanceModel,\n maxDistance: o.maxDistance,\n refDistance: o.refDistance,\n rolloffFactor: o.rolloffFactor,\n panningModel: o.panningModel\n };\n }\n\n self._pannerAttr = {\n coneInnerAngle: typeof o.pannerAttr.coneInnerAngle !== 'undefined' ? o.pannerAttr.coneInnerAngle : self._coneInnerAngle,\n coneOuterAngle: typeof o.pannerAttr.coneOuterAngle !== 'undefined' ? o.pannerAttr.coneOuterAngle : self._coneOuterAngle,\n coneOuterGain: typeof o.pannerAttr.coneOuterGain !== 'undefined' ? o.pannerAttr.coneOuterGain : self._coneOuterGain,\n distanceModel: typeof o.pannerAttr.distanceModel !== 'undefined' ? o.pannerAttr.distanceModel : self._distanceModel,\n maxDistance: typeof o.pannerAttr.maxDistance !== 'undefined' ? o.pannerAttr.maxDistance : self._maxDistance,\n refDistance: typeof o.pannerAttr.refDistance !== 'undefined' ? o.pannerAttr.refDistance : self._refDistance,\n rolloffFactor: typeof o.pannerAttr.rolloffFactor !== 'undefined' ? o.pannerAttr.rolloffFactor : self._rolloffFactor,\n panningModel: typeof o.pannerAttr.panningModel !== 'undefined' ? o.pannerAttr.panningModel : self._panningModel\n };\n }\n } else {\n // Return this sound's panner attribute values.\n sound = self._soundById(parseInt(args[0], 10));\n return sound ? sound._pannerAttr : self._pannerAttr;\n }\n } else if (args.length === 2) {\n o = args[0];\n id = parseInt(args[1], 10);\n }\n\n // Update the values of the specified sounds.\n var ids = self._getSoundIds(id);\n for (var i=0; it in e?p1(e,t,{enumerable:!0,configurable:!0,writable:!0,value:n}):e[t]=n,ge=(e,t)=>{for(var n in t||(t={}))Tu.call(t,n)&&Iu(e,n,t[n]);if(ks)for(var n of ks(t))Bu.call(t,n)&&Iu(e,n,t[n]);return e},Je=(e,t)=>m1(e,g1(t));var Ko=e=>typeof e=="symbol"?e:e+"",Nu=(e,t)=>{var n={};for(var i in e)Tu.call(e,i)&&t.indexOf(i)<0&&(n[i]=e[i]);if(e!=null&&ks)for(var i of ks(e))t.indexOf(i)<0&&Bu.call(e,i)&&(n[i]=e[i]);return n};const _1=function(){const t=document.createElement("link").relList;if(t&&t.supports&&t.supports("modulepreload"))return;for(const r of document.querySelectorAll('link[rel="modulepreload"]'))i(r);new MutationObserver(r=>{for(const s of r)if(s.type==="childList")for(const o of s.addedNodes)o.tagName==="LINK"&&o.rel==="modulepreload"&&i(o)}).observe(document,{childList:!0,subtree:!0});function n(r){const s={};return r.integrity&&(s.integrity=r.integrity),r.referrerpolicy&&(s.referrerPolicy=r.referrerpolicy),r.crossorigin==="use-credentials"?s.credentials="include":r.crossorigin==="anonymous"?s.credentials="omit":s.credentials="same-origin",s}function i(r){if(r.ep)return;r.ep=!0;const s=n(r);fetch(r.href,s)}};_1();var ue,Nr,Ff,Mu,If,ro={},Bl=[],v1=/acit|ex(?:s|g|n|p|$)|rph|grid|ows|mnc|ntw|ine[ch]|zoo|^ord|itera/i;function Nn(e,t){for(var n in t)e[n]=t[n];return e}function Tf(e){var t=e.parentNode;t&&t.removeChild(e)}function w(e,t,n){var i,r,s,o=arguments,a={};for(s in t)s=="key"?i=t[s]:s=="ref"?r=t[s]:a[s]=t[s];if(arguments.length>3)for(n=[n],s=3;s0?Mr(d.type,d.props,d.key,null,d.__v):d)!=null){if(d.__=n,d.__b=n.__b+1,(f=g[c])===null||f&&d.key==f.key&&d.type===f.type)g[c]=void 0;else for(p=0;p3)for(n=[n],s=3;st.rank?-1:e.index-t.index}function S1(e,t){return e.index=t,e.rank=k1(e),e.props}function Ha(e){return e.replace(/(^\/+|\/+$)/g,"").split("/")}function D1(e){return e.charAt(0)==":"?1+"*+?".indexOf(e.charAt(e.length-1))||4:5}function C1(e){return Ha(e).map(D1).join("")}function k1(e){return e.props.default?0:C1(e.props.path)}var Ot=null,pi=[],Va=[],F1={};function I1(e,t){t===void 0&&(t="push"),Ot&&Ot[t]?Ot[t](e):typeof history!="undefined"&&history[t+"State"]&&history[t+"State"](null,null,e)}function er(){var e;return Ot&&Ot.location?e=Ot.location:Ot&&Ot.getCurrentLocation?e=Ot.getCurrentLocation():e=typeof location!="undefined"?location:F1,""+(e.pathname||"")+(e.search||"")}function ii(e,t){return t===void 0&&(t=!1),typeof e!="string"&&e.url&&(t=e.replace,e=e.url),T1(e)&&I1(e,t?"replace":"push"),Hf(e)}function T1(e){for(var t=pi.length;t--;)if(pi[t].canRoute(e))return!0;return!1}function Hf(e){for(var t=!1,n=0;n0},t.prototype.routeTo=function(i){this.setState({url:i});var r=this.canRoute(i);return this.updating||this.forceUpdate(),r},t.prototype.componentWillMount=function(){pi.push(this),this.updating=!0},t.prototype.componentDidMount=function(){var i=this;Ot&&(this.unlisten=Ot.listen(function(r){i.routeTo(""+(r.pathname||"")+(r.search||""))})),this.updating=!1},t.prototype.componentWillUnmount=function(){typeof this.unlisten=="function"&&this.unlisten(),pi.splice(pi.indexOf(this),1)},t.prototype.componentWillUpdate=function(){this.updating=!0},t.prototype.componentDidUpdate=function(){this.updating=!1},t.prototype.getMatchingChildren=function(i,r,s){return i.filter(S1).sort(A1).map(function(o){var a=jf(r,o.props.path,o.props);if(a){if(s!==!1){var l={url:r,matches:a};return Uf(l,a),delete l.ref,delete l.key,zf(o,l)}return o}}).filter(Boolean)},t.prototype.render=function(i,r){var s=i.children,o=i.onChange,a=r.url,l=this.getMatchingChildren(nn(s),a,!0),u=l[0]||null,c=this.previousUrl;return a!==c&&(this.previousUrl=a,typeof o=="function"&&o({router:this,url:a,previous:c,active:l,current:u})),u},t}(tn),Jf=function(e){return w("a",Uf({onClick:B1},e))},O1=function(e){return w(e.component,e)};On.subscribers=Va;On.getCurrentUrl=er;On.route=ii;On.Router=On;On.Route=O1;On.Link=Jf;On.exec=jf;var it;(e=>{const t="Site",n="Generator";function u(y,A,b){ga("send","event",y,A,b)}function c(y,A){ga("set",`dimension${y}`,A)}function p(y){ga("set","page",y),ga("send","pageview")}e.pageview=p;function f(y){c(4,y),u(t,"set-language",y)}e.setLanguage=f;function d(y){c(1,y),u(t,"set-theme",y)}e.setTheme=d;function _(y){c(3,y),u(n,"set-version",y)}e.setVersion=_;function h(y){c(5,y),u(n,"set-preview",y)}e.setPreview=h;function m(y){c(6,y)}e.setGenerator=m;function g(y){c(7,y)}e.setPrefersColorScheme=g;function v(y,A){u(n,y,A)}e.generatorEvent=v})(it||(it={}));var Di,bt,$u,tr=0,Xa=[],zu=ue.__b,Uu=ue.__r,ju=ue.diffed,Hu=ue.__c,Vu=ue.unmount;function dr(e,t){ue.__h&&ue.__h(bt,e,tr||t),tr=0;var n=bt.__H||(bt.__H={__:[],__h:[]});return e>=n.__.length&&n.__.push({}),n.__[e]}function Y(e){return tr=1,Gf(Zf,e)}function Gf(e,t,n){var i=dr(Di++,2);return i.t=e,i.__c||(i.__=[n?n(t):Zf(void 0,t),function(r){var s=i.t(i.__[0],r);i.__[0]!==s&&(i.__=[s,i.__[1]],i.__c.setState({}))}],i.__c=bt),i.__}function me(e,t){var n=dr(Di++,3);!ue.__s&&Ml(n.__H,t)&&(n.__=e,n.__H=t,bt.__H.__h.push(n))}function Yf(e,t){var n=dr(Di++,4);!ue.__s&&Ml(n.__H,t)&&(n.__=e,n.__H=t,bt.__h.push(n))}function Pe(e){return tr=5,He(function(){return{current:e}},[])}function L1(e,t,n){tr=6,Yf(function(){typeof e=="function"?e(t()):e&&(e.current=t())},n==null?n:n.concat(e))}function He(e,t){var n=dr(Di++,7);return Ml(n.__H,t)&&(n.__=e(),n.__H=t,n.__h=e),n.__}function mt(e,t){return tr=8,He(function(){return e},t)}function pr(e){var t=bt.context[e.__c],n=dr(Di++,9);return n.__c=e,t?(n.__==null&&(n.__=!0,t.sub(bt)),t.props.value):e.__}function R1(e,t){ue.useDebugValue&&ue.useDebugValue(t?t(e):e)}function Wf(e){var t=dr(Di++,10),n=Y();return t.__=e,bt.componentDidCatch||(bt.componentDidCatch=function(i){t.__&&t.__(i),n[1](i)}),[n[0],function(){n[1](void 0)}]}function P1(){Xa.forEach(function(e){if(e.__P)try{e.__H.__h.forEach(Us),e.__H.__h.forEach(Ja),e.__H.__h=[]}catch(t){e.__H.__h=[],ue.__e(t,e.__v)}}),Xa=[]}ue.__b=function(e){bt=null,zu&&zu(e)},ue.__r=function(e){Uu&&Uu(e),Di=0;var t=(bt=e.__c).__H;t&&(t.__h.forEach(Us),t.__h.forEach(Ja),t.__h=[])},ue.diffed=function(e){ju&&ju(e);var t=e.__c;t&&t.__H&&t.__H.__h.length&&(Xa.push(t)!==1&&$u===ue.requestAnimationFrame||(($u=ue.requestAnimationFrame)||function(n){var i,r=function(){clearTimeout(s),Xu&&cancelAnimationFrame(i),setTimeout(n)},s=setTimeout(r,100);Xu&&(i=requestAnimationFrame(r))})(P1)),bt=void 0},ue.__c=function(e,t){t.some(function(n){try{n.__h.forEach(Us),n.__h=n.__h.filter(function(i){return!i.__||Ja(i)})}catch(i){t.some(function(r){r.__h&&(r.__h=[])}),t=[],ue.__e(i,n.__v)}}),Hu&&Hu(e,t)},ue.unmount=function(e){Vu&&Vu(e);var t=e.__c;if(t&&t.__H)try{t.__H.__.forEach(Us)}catch(n){ue.__e(n,t.__v)}};var Xu=typeof requestAnimationFrame=="function";function Us(e){var t=bt;typeof e.__c=="function"&&e.__c(),bt=t}function Ja(e){var t=bt;e.__c=e.__(),bt=t}function Ml(e,t){return!e||e.length!==t.length||t.some(function(n,i){return n!==e[i]})}function Zf(e,t){return typeof t=="function"?t(e):t}function ps({type:e,id:t}){return me(()=>{var n;(n=document.getElementById("ad-placeholder"))==null||n.remove(),"ethicalads"in window&ðicalads.load()},[]),w("div",{"data-ea-publisher":"misode-github-io","data-ea-type":e,class:"ad dark flat",id:t})}function fe({icon:e,label:t,active:n,class:i,tooltip:r,tooltipLoc:s,onClick:o}){return w("div",{class:`btn${n?" active":""}${i?` ${i}`:""}${r?` tooltipped tip-${s!=null?s:"sw"}`:""}${n?" tip-shown":""}`,onClick:o,"aria-label":r},e&&be[e],t&&w("span",null,t))}var ji=typeof globalThis!="undefined"?globalThis:typeof window!="undefined"?window:typeof global!="undefined"?global:typeof self!="undefined"?self:{};function Kf(e){throw new Error('Could not dynamically require "'+e+'". Please configure the dynamicRequireTargets or/and ignoreDynamicRequires option of @rollup/plugin-commonjs appropriately for this require call to work.')}var q={},En={},xn={};Object.defineProperty(xn,"__esModule",{value:!0});xn.ModelPath=xn.Path=xn.relativePath=void 0;function $1(e,t){return t.reduce((n,i)=>i==="pop"?n.pop():n.push(i.push),e)}xn.relativePath=$1;class Cn{constructor(t,n){this.modelArr=t!=null?t:[],this.contextArr=n!=null?n:[]}last(){return this.modelArr[this.modelArr.length-1]}slice(t,n){return new Cn(this.modelArr.slice(t,n),this.contextArr)}shift(){return new Cn(this.modelArr.slice(1),this.contextArr)}pop(){return new Cn(this.modelArr.slice(0,-1),this.contextArr)}push(t){return this.modelPush(t).contextPush(t)}modelPush(t){return new Cn([...this.modelArr,t],[...this.contextArr])}contextPush(t){if(typeof t=="number")return this.copy();const n=t.startsWith("minecraft:")?t.slice(10):t;return new Cn([...this.modelArr],[...this.contextArr,n])}copy(){return new Cn([...this.modelArr],[...this.contextArr])}getArray(){return this.modelArr}withModel(t){return new kn(t,this)}getContext(){return this.contextArr}equals(t){return t.modelArr.length===this.modelArr.length&&t.modelArr.every((n,i)=>n===this.modelArr[i])}startsWith(t){return this.modelArr.lengthn===this.modelArr[i])}endsWith(t){const n=this.modelArr.length-t.modelArr.length;return n<0?!1:t.modelArr.every((i,r)=>i===this.modelArr[n+r])}toString(){return this.modelArr.map(t=>typeof t=="string"?`.${t}`:`[${t}]`).join("").replace(/^\./,"")}forEach(t,n){return this.modelArr.forEach(t,n)}}xn.Path=Cn;class kn extends Cn{constructor(t,n){super(n==null?void 0:n.modelArr,n==null?void 0:n.contextArr),this.model=t}getModel(){return this.model}get(){var t;return(t=this.model)===null||t===void 0?void 0:t.get(this)}set(t){var n;(n=this.model)===null||n===void 0||n.set(this,t)}slice(t,n){return new kn(this.model,super.slice(t,n))}shift(){return new kn(this.model,super.shift())}pop(){return new kn(this.model,super.pop())}push(t){return this.modelPush(t).contextPush(t)}modelPush(t){return new kn(this.model,super.modelPush(t))}contextPush(t){return new kn(this.model,super.contextPush(t))}copy(){return new kn(this.model,super.copy())}}xn.ModelPath=kn;var mr={};Object.defineProperty(mr,"__esModule",{value:!0});mr.Errors=void 0;class z1{constructor(){this.errors=[]}add(t,n,...i){return this.errors.push({path:t,error:n,params:i}),!1}get(t,n=!1){return n?this.errors.filter(i=>i.path.equals(t)):this.errors.filter(i=>i.path.startsWith(t))}getAll(){return this.errors}clear(){this.errors=[]}count(){return this.errors.length}*[Symbol.iterator](){for(const t of this.errors)yield t}}mr.Errors=z1;var yn={};Object.defineProperty(yn,"__esModule",{value:!0});yn.hexId=yn.quoteString=yn.escapeString=void 0;function qf(e){return e.replace(/(\\|")/g,"\\$1")}yn.escapeString=qf;function U1(e){return`"${qf(e)}"`}yn.quoteString=U1;const j1=e=>("0"+e.toString(16)).substr(-2);function H1(e=12){var t=new Uint8Array(e/2);return window.crypto.getRandomValues(t),Array.from(t,j1).join("")}yn.hexId=H1;Object.defineProperty(En,"__esModule",{value:!0});En.DataModel=void 0;const V1=xn,Ju=mr,qo=yn;class Ol{constructor(t,n){var i,r,s,o;this.historyMax=(i=n==null?void 0:n.historyMax)!==null&&i!==void 0?i:50,this.verbose=(r=n==null?void 0:n.verbose)!==null&&r!==void 0?r:!1,this.wrapLists=(s=n==null?void 0:n.wrapLists)!==null&&s!==void 0?s:!1,this.schema=t;const a=(o=n==null?void 0:n.initialData)!==null&&o!==void 0?o:t.default();this.data=this.wrapLists?Ol.wrapLists(a):a,this.listeners=[],this.errors=new Ju.Errors,this.history=[JSON.stringify(this.data)],this.historyIndex=0}addListener(t){this.listeners.push(t)}removeListener(t){const n=this.listeners.indexOf(t);n>-1&&this.listeners.splice(n,1)}invalidate(){const t=JSON.stringify(this.data);this.history[this.historyIndex]!==t&&(this.historyIndex+=1,this.history.splice(this.historyIndex,this.historyMax,t),this.history.length>this.historyMax&&(this.history.splice(0,1),this.historyIndex-=1)),this.silentInvalidate()}silentInvalidate(){this.listeners.forEach(t=>{t.invalidated&&t.invalidated(this),t.errors&&t.errors(this.errors)})}reset(t,n){this.data=t,this.validate(n),this.invalidate()}get(t){let n=this.data;return t.forEach(i=>{if(n===void 0)return n;this.wrapLists&&typeof i=="number"?n=n[i].node:n=n[i]}),n}set(t,n,i){if(t.getArray().length===0){this.reset(n,!0);return}let r=this.data;t.pop().forEach(s=>{(r[s]===void 0||typeof r[s]=="string"||typeof r[s]=="number")&&(this.wrapLists&&typeof s=="number"?r[s]={node:{},id:(0,qo.hexId)()}:r[s]={}),this.wrapLists&&typeof s=="number"?r=r[s].node:r=r[s]}),r!==null&&(n===void 0||typeof n=="number"&&isNaN(n)?typeof t.last()=="number"?r.splice(t.last(),1):delete r[t.last()]:this.wrapLists&&typeof t.last()=="number"?r[t.last()]={node:n,id:(0,qo.hexId)()}:r[t.last()]=n,!i&&(this.verbose&&console.log("Set",t.toString(),JSON.stringify(n)),this.validate(!0),this.invalidate()))}undo(){this.historyIndex>0&&(this.historyIndex-=1,this.data=JSON.parse(this.history[this.historyIndex]),this.validate(!1),this.silentInvalidate())}redo(){this.historyIndex{s.errors&&s.errors(r)})}static wrapLists(t){if(Array.isArray(t)){const n=t.map(i=>({node:this.wrapLists(i),id:(0,qo.hexId)()}));for(const i of Object.getOwnPropertySymbols(t))n[i]=t[i];return n}else if(typeof t=="object"&&t!==null){const n={};Object.entries(t).map(([i,r])=>{n[i]=this.wrapLists(r)});for(const i of Object.getOwnPropertySymbols(t))n[i]=t[i];return n}else return t}static unwrapLists(t){if(Array.isArray(t)){const n=t.map(i=>this.unwrapLists(i.node));for(const i of Object.getOwnPropertySymbols(t))n[i]=t[i];return n}else if(typeof t=="object"&&t!==null){const n={};Object.entries(t).map(([i,r])=>{n[i]=this.unwrapLists(r)});for(const i of Object.getOwnPropertySymbols(t))n[i]=t[i];return n}else return t}}En.DataModel=Ol;var zn={};(function(e){Object.defineProperty(e,"__esModule",{value:!0}),e.Keep=e.Opt=e.Has=e.Mod=e.Base=void 0,e.Base={type:()=>"base",category:()=>{},default:()=>{},enabled:()=>!0,keep:()=>!1,optional:()=>!1,navigate(){return this},pathPush:s=>s,suggest:()=>[],validate:(s,o)=>o,validationOption:()=>{},hook(s,o,...a){return s.base({node:this},o,...a)},canUpdate:()=>!1,update:()=>[]};const t=(s,o)=>ge(ge({},s),typeof o=="function"?o(s):o);e.Mod=t;const n=(s,o)=>(0,e.Mod)(o,{enabled:a=>a.push(s).get()!==void 0});e.Has=n;function i(s){return Je(ge({},s),{optional:()=>!0})}e.Opt=i;function r(s){return Je(ge({},s),{keep:()=>!0})}e.Keep=r})(zn);var So={};Object.defineProperty(So,"__esModule",{value:!0});So.BooleanNode=void 0;const X1=En,J1=zn,G1=()=>Je(ge({},J1.Base),{type:()=>"boolean",default:()=>!1,suggest:()=>["false","true"],validate(e,t,n,i){return i.loose&&typeof t!="boolean"&&(t=i.wrapLists?X1.DataModel.wrapLists(this.default()):this.default()),(typeof t!="boolean"||t===void 0)&&n.add(e,"error.expected_boolean"),t},hook(e,t,...n){var i;return((i=e.boolean)!==null&&i!==void 0?i:e.base).call(e,{node:this},t,...n)}});So.BooleanNode=G1;var Qf={},ms={};Object.defineProperty(ms,"__esModule",{value:!0});ms.ListNode=void 0;const Y1=En,W1=zn,Z1=(e,t)=>{var n,i;const r=(n=t==null?void 0:t.minLength)!==null&&n!==void 0?n:0,s=(i=t==null?void 0:t.maxLength)!==null&&i!==void 0?i:1/0,o=(t==null?void 0:t.minLength)&&(t==null?void 0:t.maxLength);return Je(ge({},W1.Base),{type:()=>"list",default:()=>t!=null&&t.minLength?[...Array(r)].map(a=>e.default()):[],navigate(a,l){const u=l+1;return a.getArray().length<=u?this:e.navigate(a,u)},pathPush(a,l){return a.push(parseInt(l.toString())).contextPush("entry")},validate(a,l,u,c){if(c.loose&&!Array.isArray(l)&&(l=c.wrapLists?Y1.DataModel.wrapLists(this.default()):this.default()),Array.isArray(l))o&&(l.lengths)?r===s?u.add(a,"error.invalid_list_range.exact",l.length,r):u.add(a,"error.invalid_list_range.between",l.length,r,s):l.lengths&&u.add(a,"error.invalid_list_range.larger",l.length,s);else return u.add(a,"error.expected_list"),l;const p=l.map((f,d)=>{const _=e.validate(a.push(d),c.wrapLists?f.node:f,u,c);return c.wrapLists?{node:_,id:f.id}:_});for(const f of Object.getOwnPropertySymbols(l))p[f]=l[f];return p},hook(a,l,...u){var c;return((c=a.list)!==null&&c!==void 0?c:a.base).call(a,{node:this,children:e,config:t!=null?t:{}},l,...u)}})};ms.ListNode=Z1;var gs={};Object.defineProperty(gs,"__esModule",{value:!0});gs.SwitchNode=void 0;const K1=zn,q1=e=>Je(ge({},K1.Base),{type(t){return this.activeCase(t,!0).node.type(t)},category(t){return this.activeCase(t,!0).node.category(t)},default:()=>e[0].node.default(),navigate(t,n){var i;const r=n+1;return(i=this.activeCase(t.slice(0,r)))===null||i===void 0?void 0:i.node.navigate(t,n)},pathPush(t,n){var i,r;return(r=(i=this.activeCase(t))===null||i===void 0?void 0:i.node.pathPush(t,n))!==null&&r!==void 0?r:t},suggest(t,n){var i,r;return(r=(i=this.activeCase(t))===null||i===void 0?void 0:i.node.suggest(t,n))!==null&&r!==void 0?r:e.filter(s=>s.match(t)).map(s=>s.node.suggest(t,n)).reduce((s,o)=>s.concat(o))},validate(t,n,i,r){let s=this.activeCase(t);return s===void 0?n:s.node.validate(t,n,i,r)},validationOption(t){var n;return(n=this.activeCase(t))===null||n===void 0?void 0:n.node.validationOption(t)},activeCase(t,n){const i=(s,o)=>{var a,l;return((a=o.priority)!==null&&a!==void 0?a:0)-((l=s.priority)!==null&&l!==void 0?l:0)},r=e.filter(s=>s.match(t)).sort(i);return n&&r.length===0?e.sort(i)[0]:r.length>0?r[0]:void 0},hook(t,n,...i){return this.activeCase(n,!0).node.hook(t,n,...i)}});gs.SwitchNode=q1;(function(e){Object.defineProperty(e,"__esModule",{value:!0}),e.ObjectOrPreset=e.StringOrList=e.ObjectOrList=e.ChoiceNode=void 0;const t=ms,n=gs,i=(o,a)=>{const l=(c,p)=>{if(c.match)return c.match(p);switch(c.type){case"list":return Array.isArray(p);case"object":return typeof p=="object"&&!Array.isArray(p);default:return typeof p===c.type}},u=(0,n.SwitchNode)(o.map(c=>({type:c.type,priority:c.priority,match:p=>l(c,p.get()),node:c.node})));return Je(ge({},u),{validate(c,p,f,d){let _=u.activeCase(c,!0);return _.node.optional()?p:_.node.validate(c,p,f,d)},hook(c,p,...f){var d;return((d=c.choice)!==null&&d!==void 0?d:c.base).call(c,{node:this,choices:o,config:a!=null?a:{},switchNode:u},p,...f)}})};e.ChoiceNode=i;const r=o=>(a,l)=>(0,e.ChoiceNode)([{type:o,node:a,change:u=>{var c;return(c=u[0])!==null&&c!==void 0?c:a.default()}},{type:"list",node:(0,t.ListNode)(a),change:u=>u?[u]:[]}],l);e.ObjectOrList=r("object"),e.StringOrList=r("string");const s=(o,a,l)=>(0,e.ChoiceNode)([{type:"string",priority:1,node:o,change:u=>Object.keys(l)[0]},{type:"object",node:a,change:u=>{var c;return(c=l[u])!==null&&c!==void 0?c:l[Object.keys(l)[0]]}}]);e.ObjectOrPreset=s})(Qf);var Do={};Object.defineProperty(Do,"__esModule",{value:!0});Do.MapNode=void 0;const Q1=zn,em=En,tm=(e,t,n)=>Je(ge({},Q1.Base),{type:()=>"map",default:()=>({}),navigate(i,r){const s=r+1;return i.getArray().length<=s?this:t.navigate(i,s)},pathPush(i,r){return i.modelPush(r)},suggest:i=>e.suggest(i,""),validate(i,r,s,o){if(o.loose&&typeof r!="object"&&(r=o.wrapLists?em.DataModel.wrapLists(this.default()):this.default()),r===null||typeof r!="object")return s.add(i,"error.expected_object"),r;const a={};Object.keys(r).forEach(l=>{e.validate(i,l,s,o),a[l]=t.validate(i.push(l),r[l],s,o)});for(const l of Object.getOwnPropertySymbols(r))a[l]=r[l];return a},validationOption(i){var r;return(r=n==null?void 0:n.validation)!==null&&r!==void 0?r:e.validationOption(i.push(""))},hook(i,r,...s){var o;return((o=i.map)!==null&&o!==void 0?o:i.base).call(i,{node:this,keys:e,children:t,config:n!=null?n:{}},r,...s)}});Do.MapNode=tm;var e0={};(function(e){Object.defineProperty(e,"__esModule",{value:!0}),e.NumberEnum=e.NumberNode=void 0;const t=q,n=En,i=zn,r=o=>{var a,l,u;const c=o!=null&&o.color?!0:(a=o==null?void 0:o.integer)!==null&&a!==void 0?a:!1,p=o!=null&&o.color?0:(l=o==null?void 0:o.min)!==null&&l!==void 0?l:-1/0,f=o!=null&&o.color?16777215:(u=o==null?void 0:o.max)!==null&&u!==void 0?u:1/0,d=(o==null?void 0:o.min)!==void 0&&(o==null?void 0:o.max)!==void 0;return Je(ge({},i.Base),{type:()=>"number",default:()=>p>0?p:0,validate(_,h,m,g){return g.loose&&typeof h!="number"&&(h=g.wrapLists?n.DataModel.wrapLists(this.default()):this.default()),typeof h!="number"?m.add(_,"error.expected_number"):c&&!Number.isInteger(h)?m.add(_,"error.expected_integer"):d&&(hf)?m.add(_,"error.invalid_number_range.between",h,p,f):hf&&m.add(_,"error.invalid_number_range.larger",h,f),h},hook(_,h,...m){var g;return((g=_.number)!==null&&g!==void 0?g:_.base).call(_,{node:this,integer:c,min:p,max:f,between:d,config:o!=null?o:{}},h,...m)}})};e.NumberNode=r;const s=({integer:o,values:a})=>(0,t.Mod)((0,e.NumberNode)({integer:o}),l=>({validate:(u,c,p,f)=>(c=l.validate(u,c,p,f),a.includes(c)||p.add(u,"error.invalid_number_enum",a.join(", ")),c)}));e.NumberEnum=s})(e0);var t0={};(function(e){Object.defineProperty(e,"__esModule",{value:!0}),e.ObjectNode=e.Case=e.Switch=void 0;const t=zn,n=xn,i=mr,r=yn,s=En;e.Switch=Symbol("switch"),e.Case=Symbol("case");const o=(a,l)=>{var _,h;const m=a,{[_=e.Switch]:u,[h=e.Case]:c}=m,p=Nu(m,[Ko(_),Ko(h)]),f=g=>{if(u===void 0)return p;const v=(0,n.relativePath)(g,u).get(),y=c[v];return ge(ge({},p),y)},d=(g,v)=>{var y;const A=u?(0,n.relativePath)(g,u).get():void 0,b=u?(y=c[A])!==null&&y!==void 0?y:{}:{},S=Object.keys(b),D=l!=null&&l.context?new n.ModelPath(g.getModel(),new n.Path(g.getArray(),[l.context])):g;return(!(l!=null&&l.disableSwitchContext)&&A&&S.includes(v)?D.contextPush(A):D).push(v)};return Je(ge({},t.Base),{type:()=>"object",category:()=>l==null?void 0:l.category,default:()=>({}),keep(){return this.optional()},navigate(g,v){const y=v+1,A=g.getArray();if(A.length<=y)return this;const S=f(g.slice(0,y))[A[y]];return S==null?void 0:S.navigate(g,y)},pathPush(g,v){return d(g,v.toString())},suggest(g,v){const y=f(g),A=Object.keys(typeof v=="object"?v:{});return Object.keys(y).filter(b=>y[b].enabled(g)).filter(b=>!A.includes(b)).map(r.quoteString)},validate(g,v,y,A){if(A.loose&&typeof v!="object"&&(v=A.wrapLists?s.DataModel.wrapLists(this.default()):this.default()),typeof v!="object"||v===null)return y.add(g,"error.expected_object"),v;let b=p;if(u){const B=(0,n.relativePath)(g,u);let M=B.get();if(g.equals(B.pop())){const U=B.last();M=p[U].validate(g.push(U),v[U],new i.Errors,A)}b=ge(ge({},b),c[M])}const S=Object.keys(b),D=S.filter(B=>!b[B].optional()),k=new Set([...D,...Object.keys(v)]),T={};k.forEach(B=>{if(S.includes(B)){if(!b[B].enabled(g))return;const M=b[B].validate(g.push(B),v[B],y,A);!b[B].keep()&&b[B].optional()&&(M===void 0||Array.isArray(M)&&M.length===0||M.constructor===Object&&Object.keys(M).length===0)?delete T[B]:(T[B]=M,g.getModel().set(g.push(B),M,!0))}else T[B]=v[B]});for(const B of Object.getOwnPropertySymbols(v))T[B]=v[B];return T},hook(g,v,...y){var A;return((A=g.object)!==null&&A!==void 0?A:g.base).call(g,{node:this,fields:p,config:l!=null?l:{},filter:u,cases:c,getActiveFields:f,getChildModelPath:d},v,...y)}})};e.ObjectNode=o})(t0);var Co={};Object.defineProperty(Co,"__esModule",{value:!0});Co.Reference=void 0;const nm=(e,t)=>({type(n){return e.get(t).type.bind(this)(n)},category(n){return e.get(t).category.bind(this)(n)},default(){return e.get(t).default.bind(this)()},transform(n,i){return e.get(t).transform(n,i)},enabled(n){return e.get(t).enabled.bind(this)(n)},keep(){return e.get(t).keep.bind(this)()},optional(){return e.get(t).optional.bind(this)()},navigate(n,i){return e.get(t).navigate.bind(this)(n,i)},pathPush(n,i){return e.get(t).pathPush.bind(this)(n,i)},suggest(n,i){return e.get(t).suggest.bind(this)(n,i)},validate(n,i,r,s){return e.get(t).validate.bind(this)(n,i,r,s)},validationOption(n){return e.get(t).validationOption.bind(this)(n)},hook(n,i,...r){return e.get(t).hook.bind(this)(n,i,...r)},activeCase(n,i){return e.get(t).activeCase.bind(this)(n,i)},canUpdate(n,i){return e.get(t).canUpdate.bind(this)(n,i)},update(n,i){return e.get(t).update.bind(this)(n,i)}});Co.Reference=nm;var ko={};Object.defineProperty(ko,"__esModule",{value:!0});ko.StringNode=void 0;const im=zn,rm=yn,sm=En,Gu=e=>!!(e!=null&&e.enum),Yu=e=>!!(e!=null&&e.validator),om=(e,t)=>{const n=()=>{var i,r,s,o;if(Gu(t))return typeof t.enum=="string"?(i=e==null?void 0:e.get(t.enum))!==null&&i!==void 0?i:[]:t.enum;if((t==null?void 0:t.validator)==="resource"){if(typeof t.params.pool=="string"){if(t.params.requireTag)return(r=e==null?void 0:e.get(`tag/${t.params.pool}`).map(l=>`#${l}`))!==null&&r!==void 0?r:[];const a=t.params.pool.replace(/^\$/,"");return[...t.params.allowTag?(s=e==null?void 0:e.get(`tag/${a}`).map(l=>`#${l}`))!==null&&s!==void 0?s:[]:[],...(o=e==null?void 0:e.get(a))!==null&&o!==void 0?o:[]]}return t.params.pool}return[]};return Je(ge({},im.Base),{type:()=>"string",default:()=>"",validate(i,r,s,o){if(o.loose&&typeof r!="string"&&(r=(o.wrapLists?sm.DataModel.wrapLists(this.default()):this.default())||void 0),typeof r!="string")return s.add(i,"error.expected_string"),r;if(Yu(t)){if(t.validator==="resource"&&r.length>0&&!r.includes(":")&&(r=r.startsWith("#")?"#minecraft:"+r.slice(1):"minecraft:"+r),t.validator==="resource"&&typeof r=="string"){let l=r;if(r.startsWith("#")){if(typeof t.params.pool=="string"&&t.params.pool.startsWith("$tag/"))return s.add(i,"error.disallowed_tag_prefix"),r;if(!t.params.allowTag&&!t.params.requireTag)return s.add(i,"error.disallowed_tag"),r;l=l.slice(1)}else if(t.params.requireTag)return s.add(i,"error.expected_tag"),r;if(!l.match(/^(?:[_\-a-z0-9.]*:)?[_\-a-z0-9/.]*$/g))return s.add(i,"error.invalid_resource_location"),r}if(t.validator==="resource"&&(typeof t.params.pool=="string"&&t.params.pool.startsWith("$")||(t.params.allowTag||t.params.requireTag)&&r.startsWith("#")||t.params.isDefinition||t.params.allowUnknown))return r}if(Gu(t)&&t.additional)return r;const a=n();return a.length>0&&!a.includes(r)&&s.add(i,"error.invalid_enum_option",r),r},suggest:()=>n().map(rm.quoteString),validationOption(){return Yu(t)?t:void 0},hook(i,r,...s){var o;return((o=i.string)!==null&&o!==void 0?o:i.base).call(i,{node:this,getValues:n,config:t},r,...s)}})};ko.StringNode=om;var n0={};Object.defineProperty(n0,"__esModule",{value:!0});var nr={};Object.defineProperty(nr,"__esModule",{value:!0});nr.CollectionRegistry=nr.SchemaRegistry=void 0;class am{constructor(){this.registry={}}register(t,n){this.registry[t]=n}get(t){const n=this.registry[t];return n===void 0&&console.error(`Tried to access schema "${t}", but that doesn't exist.`),n}}nr.SchemaRegistry=am;class lm{constructor(){this.registry={}}register(t,n){this.registry[t]=n}get(t){const n=this.registry[t];return n===void 0&&console.warn(`Tried to access collection "${t}", but that doesn't exist.`),n!=null?n:[]}}nr.CollectionRegistry=lm;var i0={};Object.defineProperty(i0,"__esModule",{value:!0});(function(e){var t=ji&&ji.__createBinding||(Object.create?function(i,r,s,o){o===void 0&&(o=s);var a=Object.getOwnPropertyDescriptor(r,s);(!a||("get"in a?!r.__esModule:a.writable||a.configurable))&&(a={enumerable:!0,get:function(){return r[s]}}),Object.defineProperty(i,o,a)}:function(i,r,s,o){o===void 0&&(o=s),i[o]=r[s]}),n=ji&&ji.__exportStar||function(i,r){for(var s in i)s!=="default"&&!Object.prototype.hasOwnProperty.call(r,s)&&t(r,i,s)};Object.defineProperty(e,"__esModule",{value:!0}),n(En,e),n(xn,e),n(mr,e),n(zn,e),n(So,e),n(Qf,e),n(ms,e),n(Do,e),n(e0,e),n(t0,e),n(Co,e),n(ko,e),n(gs,e),n(n0,e),n(nr,e),n(i0,e)})(q);var et={},_s={},Kt={};function r0(e){return typeof e=="undefined"||e===null}function um(e){return typeof e=="object"&&e!==null}function cm(e){return Array.isArray(e)?e:r0(e)?[]:[e]}function hm(e,t){var n,i,r,s;if(t)for(s=Object.keys(t),n=0,i=s.length;n0&&`\0\r
-\x85\u2028\u2029`.indexOf(this.buffer.charAt(r-1))===-1;)if(r-=1,this.position-r>n/2-1){i=" ... ",r+=5;break}for(s="",o=this.position;on/2-1){s=" ... ",o-=5;break}return a=this.buffer.slice(r,o),Wu.repeat(" ",t)+i+a+s+`
-`+Wu.repeat(" ",t+this.position-r+i.length)+"^"};Ll.prototype.toString=function(t){var n,i="";return this.name&&(i+='in "'+this.name+'" '),i+="at line "+(this.line+1)+", column "+(this.column+1),t||(n=this.getSnippet(),n&&(i+=`:
-`+n)),i};var pm=Ll,Zu=vs,mm=["kind","resolve","construct","instanceOf","predicate","represent","defaultStyle","styleAliases"],gm=["scalar","sequence","mapping"];function _m(e){var t={};return e!==null&&Object.keys(e).forEach(function(n){e[n].forEach(function(i){t[String(i)]=n})}),t}function vm(e,t){if(t=t||{},Object.keys(t).forEach(function(n){if(mm.indexOf(n)===-1)throw new Zu('Unknown option "'+n+'" is met in definition of "'+e+'" YAML type.')}),this.tag=e,this.kind=t.kind||null,this.resolve=t.resolve||function(){return!0},this.construct=t.construct||function(n){return n},this.instanceOf=t.instanceOf||null,this.predicate=t.predicate||null,this.represent=t.represent||null,this.defaultStyle=t.defaultStyle||null,this.styleAliases=_m(t.styleAliases||null),gm.indexOf(this.kind)===-1)throw new Zu('Unknown kind "'+this.kind+'" is specified for "'+e+'" YAML type.')}var gt=vm,Ku=Kt,js=vs,xm=gt;function Ga(e,t,n){var i=[];return e.include.forEach(function(r){n=Ga(r,t,n)}),e[t].forEach(function(r){n.forEach(function(s,o){s.tag===r.tag&&s.kind===r.kind&&i.push(o)}),n.push(r)}),n.filter(function(r,s){return i.indexOf(s)===-1})}function ym(){var e={scalar:{},sequence:{},mapping:{},fallback:{}},t,n;function i(r){e[r.kind][r.tag]=e.fallback[r.tag]=r}for(t=0,n=arguments.length;t=0?"0b"+e.toString(2):"-0b"+e.toString(2).slice(1)},octal:function(e){return e>=0?"0"+e.toString(8):"-0"+e.toString(8).slice(1)},decimal:function(e){return e.toString(10)},hexadecimal:function(e){return e>=0?"0x"+e.toString(16).toUpperCase():"-0x"+e.toString(16).toUpperCase().slice(1)}},defaultStyle:"decimal",styleAliases:{binary:[2,"bin"],octal:[8,"oct"],decimal:[10,"dec"],hexadecimal:[16,"hex"]}}),s0=Kt,Gm=gt,Ym=new RegExp("^(?:[-+]?(?:0|[1-9][0-9_]*)(?:\\.[0-9_]*)?(?:[eE][-+]?[0-9]+)?|\\.[0-9_]+(?:[eE][-+]?[0-9]+)?|[-+]?[0-9][0-9_]*(?::[0-5]?[0-9])+\\.[0-9_]*|[-+]?\\.(?:inf|Inf|INF)|\\.(?:nan|NaN|NAN))$");function Wm(e){return!(e===null||!Ym.test(e)||e[e.length-1]==="_")}function Zm(e){var t,n,i,r;return t=e.replace(/_/g,"").toLowerCase(),n=t[0]==="-"?-1:1,r=[],"+-".indexOf(t[0])>=0&&(t=t.slice(1)),t===".inf"?n===1?Number.POSITIVE_INFINITY:Number.NEGATIVE_INFINITY:t===".nan"?NaN:t.indexOf(":")>=0?(t.split(":").forEach(function(s){r.unshift(parseFloat(s,10))}),t=0,i=1,r.forEach(function(s){t+=s*i,i*=60}),n*t):n*parseFloat(t,10)}var Km=/^[-+]?[0-9]+e/;function qm(e,t){var n;if(isNaN(e))switch(t){case"lowercase":return".nan";case"uppercase":return".NAN";case"camelcase":return".NaN"}else if(Number.POSITIVE_INFINITY===e)switch(t){case"lowercase":return".inf";case"uppercase":return".INF";case"camelcase":return".Inf"}else if(Number.NEGATIVE_INFINITY===e)switch(t){case"lowercase":return"-.inf";case"uppercase":return"-.INF";case"camelcase":return"-.Inf"}else if(s0.isNegativeZero(e))return"-0.0";return n=e.toString(10),Km.test(n)?n.replace("e",".e"):n}function Qm(e){return Object.prototype.toString.call(e)==="[object Number]"&&(e%1!==0||s0.isNegativeZero(e))}var eg=new Gm("tag:yaml.org,2002:float",{kind:"scalar",resolve:Wm,construct:Zm,predicate:Qm,represent:qm,defaultStyle:"lowercase"}),tg=gr,o0=new tg({include:[Rl],implicit:[Bm,Rm,Jm,eg]}),ng=gr,a0=new ng({include:[o0]}),ig=gt,l0=new RegExp("^([0-9][0-9][0-9][0-9])-([0-9][0-9])-([0-9][0-9])$"),u0=new RegExp("^([0-9][0-9][0-9][0-9])-([0-9][0-9]?)-([0-9][0-9]?)(?:[Tt]|[ \\t]+)([0-9][0-9]?):([0-9][0-9]):([0-9][0-9])(?:\\.([0-9]*))?(?:[ \\t]*(Z|([-+])([0-9][0-9]?)(?::([0-9][0-9]))?))?$");function rg(e){return e===null?!1:l0.exec(e)!==null||u0.exec(e)!==null}function sg(e){var t,n,i,r,s,o,a,l=0,u=null,c,p,f;if(t=l0.exec(e),t===null&&(t=u0.exec(e)),t===null)throw new Error("Date resolve error");if(n=+t[1],i=+t[2]-1,r=+t[3],!t[4])return new Date(Date.UTC(n,i,r));if(s=+t[4],o=+t[5],a=+t[6],t[7]){for(l=t[7].slice(0,3);l.length<3;)l+="0";l=+l}return t[9]&&(c=+t[10],p=+(t[11]||0),u=(c*60+p)*6e4,t[9]==="-"&&(u=-u)),f=new Date(Date.UTC(n,i,r,s,o,a,l)),u&&f.setTime(f.getTime()-u),f}function og(e){return e.toISOString()}var ag=new ig("tag:yaml.org,2002:timestamp",{kind:"scalar",resolve:rg,construct:sg,instanceOf:Date,represent:og}),lg=gt;function ug(e){return e==="<<"||e===null}var cg=new lg("tag:yaml.org,2002:merge",{kind:"scalar",resolve:ug}),hi;try{var hg=Kf;hi=hg("buffer").Buffer}catch{}var fg=gt,Pl=`ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/=
-\r`;function dg(e){if(e===null)return!1;var t,n,i=0,r=e.length,s=Pl;for(n=0;n64)){if(t<0)return!1;i+=6}return i%8===0}function pg(e){var t,n,i=e.replace(/[\r\n=]/g,""),r=i.length,s=Pl,o=0,a=[];for(t=0;t>16&255),a.push(o>>8&255),a.push(o&255)),o=o<<6|s.indexOf(i.charAt(t));return n=r%4*6,n===0?(a.push(o>>16&255),a.push(o>>8&255),a.push(o&255)):n===18?(a.push(o>>10&255),a.push(o>>2&255)):n===12&&a.push(o>>4&255),hi?hi.from?hi.from(a):new hi(a):a}function mg(e){var t="",n=0,i,r,s=e.length,o=Pl;for(i=0;i>18&63],t+=o[n>>12&63],t+=o[n>>6&63],t+=o[n&63]),n=(n<<8)+e[i];return r=s%3,r===0?(t+=o[n>>18&63],t+=o[n>>12&63],t+=o[n>>6&63],t+=o[n&63]):r===2?(t+=o[n>>10&63],t+=o[n>>4&63],t+=o[n<<2&63],t+=o[64]):r===1&&(t+=o[n>>2&63],t+=o[n<<4&63],t+=o[64],t+=o[64]),t}function gg(e){return hi&&hi.isBuffer(e)}var _g=new fg("tag:yaml.org,2002:binary",{kind:"scalar",resolve:dg,construct:pg,predicate:gg,represent:mg}),vg=gt,xg=Object.prototype.hasOwnProperty,yg=Object.prototype.toString;function wg(e){if(e===null)return!0;var t=[],n,i,r,s,o,a=e;for(n=0,i=a.length;n3||t[t.length-i.length-1]!=="/"))}function Hg(e){var t=e,n=/\/([gim]*)$/.exec(e),i="";return t[0]==="/"&&(n&&(i=n[1]),t=t.slice(1,t.length-i.length-1)),new RegExp(t,i)}function Vg(e){var t="/"+e.source+"/";return e.global&&(t+="g"),e.multiline&&(t+="m"),e.ignoreCase&&(t+="i"),t}function Xg(e){return Object.prototype.toString.call(e)==="[object RegExp]"}var Jg=new Ug("tag:yaml.org,2002:js/regexp",{kind:"scalar",resolve:jg,construct:Hg,predicate:Xg,represent:Vg}),ao;try{var Gg=Kf;ao=Gg("esprima")}catch{typeof window!="undefined"&&(ao=window.esprima)}var Yg=gt;function Wg(e){if(e===null)return!1;try{var t="("+e+")",n=ao.parse(t,{range:!0});return!(n.type!=="Program"||n.body.length!==1||n.body[0].type!=="ExpressionStatement"||n.body[0].expression.type!=="ArrowFunctionExpression"&&n.body[0].expression.type!=="FunctionExpression")}catch{return!1}}function Zg(e){var t="("+e+")",n=ao.parse(t,{range:!0}),i=[],r;if(n.type!=="Program"||n.body.length!==1||n.body[0].type!=="ExpressionStatement"||n.body[0].expression.type!=="ArrowFunctionExpression"&&n.body[0].expression.type!=="FunctionExpression")throw new Error("Failed to resolve function");return n.body[0].expression.params.forEach(function(s){i.push(s.name)}),r=n.body[0].expression.body.range,n.body[0].expression.body.type==="BlockStatement"?new Function(i,t.slice(r[0]+1,r[1]-1)):new Function(i,"return "+t.slice(r[0],r[1]))}function Kg(e){return e.toString()}function qg(e){return Object.prototype.toString.call(e)==="[object Function]"}var Qg=new Yg("tag:yaml.org,2002:js/function",{kind:"scalar",resolve:Wg,construct:Zg,predicate:qg,represent:Kg}),qu=gr,Fo=qu.DEFAULT=new qu({include:[xs],explicit:[zg,Jg,Qg]}),Bn=Kt,c0=vs,e_=pm,h0=xs,t_=Fo,ri=Object.prototype.hasOwnProperty,lo=1,f0=2,d0=3,uo=4,Qo=1,n_=2,Qu=3,i_=/[\x00-\x08\x0B\x0C\x0E-\x1F\x7F-\x84\x86-\x9F\uFFFE\uFFFF]|[\uD800-\uDBFF](?![\uDC00-\uDFFF])|(?:[^\uD800-\uDBFF]|^)[\uDC00-\uDFFF]/,r_=/[\x85\u2028\u2029]/,s_=/[,\[\]\{\}]/,p0=/^(?:!|!!|![a-z\-]+!)$/i,m0=/^(?:!|[^,\[\]\{\}])(?:%[0-9a-f]{2}|[0-9a-z\-#;\/\?:@&=\+\$,_\.!~\*'\(\)\[\]])*$/i;function ec(e){return Object.prototype.toString.call(e)}function wn(e){return e===10||e===13}function mi(e){return e===9||e===32}function It(e){return e===9||e===32||e===10||e===13}function Vi(e){return e===44||e===91||e===93||e===123||e===125}function o_(e){var t;return 48<=e&&e<=57?e-48:(t=e|32,97<=t&&t<=102?t-97+10:-1)}function a_(e){return e===120?2:e===117?4:e===85?8:0}function l_(e){return 48<=e&&e<=57?e-48:-1}function tc(e){return e===48?"\0":e===97?"\x07":e===98?"\b":e===116||e===9?" ":e===110?`
-`:e===118?"\v":e===102?"\f":e===114?"\r":e===101?"\x1B":e===32?" ":e===34?'"':e===47?"/":e===92?"\\":e===78?"\x85":e===95?"\xA0":e===76?"\u2028":e===80?"\u2029":""}function u_(e){return e<=65535?String.fromCharCode(e):String.fromCharCode((e-65536>>10)+55296,(e-65536&1023)+56320)}var g0=new Array(256),_0=new Array(256);for(var Ii=0;Ii<256;Ii++)g0[Ii]=tc(Ii)?1:0,_0[Ii]=tc(Ii);function c_(e,t){this.input=e,this.filename=t.filename||null,this.schema=t.schema||t_,this.onWarning=t.onWarning||null,this.legacy=t.legacy||!1,this.json=t.json||!1,this.listener=t.listener||null,this.implicitTypes=this.schema.compiledImplicit,this.typeMap=this.schema.compiledTypeMap,this.length=e.length,this.position=0,this.line=0,this.lineStart=0,this.lineIndent=0,this.documents=[]}function v0(e,t){return new c0(t,new e_(e.filename,e.input,e.position,e.line,e.position-e.lineStart))}function de(e,t){throw v0(e,t)}function co(e,t){e.onWarning&&e.onWarning.call(null,v0(e,t))}var nc={YAML:function(t,n,i){var r,s,o;t.version!==null&&de(t,"duplication of %YAML directive"),i.length!==1&&de(t,"YAML directive accepts exactly one argument"),r=/^([0-9]+)\.([0-9]+)$/.exec(i[0]),r===null&&de(t,"ill-formed argument of the YAML directive"),s=parseInt(r[1],10),o=parseInt(r[2],10),s!==1&&de(t,"unacceptable YAML version of the document"),t.version=i[0],t.checkLineBreaks=o<2,o!==1&&o!==2&&co(t,"unsupported YAML version of the document")},TAG:function(t,n,i){var r,s;i.length!==2&&de(t,"TAG directive accepts exactly two arguments"),r=i[0],s=i[1],p0.test(r)||de(t,"ill-formed tag handle (first argument) of the TAG directive"),ri.call(t.tagMap,r)&&de(t,'there is a previously declared suffix for "'+r+'" tag handle'),m0.test(s)||de(t,"ill-formed tag prefix (second argument) of the TAG directive"),t.tagMap[r]=s}};function qn(e,t,n,i){var r,s,o,a;if(t1&&(e.result+=Bn.repeat(`
-`,t-1))}function h_(e,t,n){var i,r,s,o,a,l,u,c,p=e.kind,f=e.result,d;if(d=e.input.charCodeAt(e.position),It(d)||Vi(d)||d===35||d===38||d===42||d===33||d===124||d===62||d===39||d===34||d===37||d===64||d===96||(d===63||d===45)&&(r=e.input.charCodeAt(e.position+1),It(r)||n&&Vi(r)))return!1;for(e.kind="scalar",e.result="",s=o=e.position,a=!1;d!==0;){if(d===58){if(r=e.input.charCodeAt(e.position+1),It(r)||n&&Vi(r))break}else if(d===35){if(i=e.input.charCodeAt(e.position-1),It(i))break}else{if(e.position===e.lineStart&&Io(e)||n&&Vi(d))break;if(wn(d))if(l=e.line,u=e.lineStart,c=e.lineIndent,at(e,!1,-1),e.lineIndent>=t){a=!0,d=e.input.charCodeAt(e.position);continue}else{e.position=o,e.line=l,e.lineStart=u,e.lineIndent=c;break}}a&&(qn(e,s,o,!1),zl(e,e.line-l),s=o=e.position,a=!1),mi(d)||(o=e.position+1),d=e.input.charCodeAt(++e.position)}return qn(e,s,o,!1),e.result?!0:(e.kind=p,e.result=f,!1)}function f_(e,t){var n,i,r;if(n=e.input.charCodeAt(e.position),n!==39)return!1;for(e.kind="scalar",e.result="",e.position++,i=r=e.position;(n=e.input.charCodeAt(e.position))!==0;)if(n===39)if(qn(e,i,e.position,!0),n=e.input.charCodeAt(++e.position),n===39)i=e.position,e.position++,r=e.position;else return!0;else wn(n)?(qn(e,i,r,!0),zl(e,at(e,!1,t)),i=r=e.position):e.position===e.lineStart&&Io(e)?de(e,"unexpected end of the document within a single quoted scalar"):(e.position++,r=e.position);de(e,"unexpected end of the stream within a single quoted scalar")}function d_(e,t){var n,i,r,s,o,a;if(a=e.input.charCodeAt(e.position),a!==34)return!1;for(e.kind="scalar",e.result="",e.position++,n=i=e.position;(a=e.input.charCodeAt(e.position))!==0;){if(a===34)return qn(e,n,e.position,!0),e.position++,!0;if(a===92){if(qn(e,n,e.position,!0),a=e.input.charCodeAt(++e.position),wn(a))at(e,!1,t);else if(a<256&&g0[a])e.result+=_0[a],e.position++;else if((o=a_(a))>0){for(r=o,s=0;r>0;r--)a=e.input.charCodeAt(++e.position),(o=o_(a))>=0?s=(s<<4)+o:de(e,"expected hexadecimal character");e.result+=u_(s),e.position++}else de(e,"unknown escape sequence");n=i=e.position}else wn(a)?(qn(e,n,i,!0),zl(e,at(e,!1,t)),n=i=e.position):e.position===e.lineStart&&Io(e)?de(e,"unexpected end of the document within a double quoted scalar"):(e.position++,i=e.position)}de(e,"unexpected end of the stream within a double quoted scalar")}function p_(e,t){var n=!0,i,r=e.tag,s,o=e.anchor,a,l,u,c,p,f={},d,_,h,m;if(m=e.input.charCodeAt(e.position),m===91)l=93,p=!1,s=[];else if(m===123)l=125,p=!0,s={};else return!1;for(e.anchor!==null&&(e.anchorMap[e.anchor]=s),m=e.input.charCodeAt(++e.position);m!==0;){if(at(e,!0,t),m=e.input.charCodeAt(e.position),m===l)return e.position++,e.tag=r,e.anchor=o,e.kind=p?"mapping":"sequence",e.result=s,!0;n||de(e,"missed comma between flow collection entries"),_=d=h=null,u=c=!1,m===63&&(a=e.input.charCodeAt(e.position+1),It(a)&&(u=c=!0,e.position++,at(e,!0,t))),i=e.line,ir(e,t,lo,!1,!0),_=e.tag,d=e.result,at(e,!0,t),m=e.input.charCodeAt(e.position),(c||e.line===i)&&m===58&&(u=!0,m=e.input.charCodeAt(++e.position),at(e,!0,t),ir(e,t,lo,!1,!0),h=e.result),p?Xi(e,s,f,_,d,h):u?s.push(Xi(e,null,f,_,d,h)):s.push(d),at(e,!0,t),m=e.input.charCodeAt(e.position),m===44?(n=!0,m=e.input.charCodeAt(++e.position)):n=!1}de(e,"unexpected end of the stream within a flow collection")}function m_(e,t){var n,i,r=Qo,s=!1,o=!1,a=t,l=0,u=!1,c,p;if(p=e.input.charCodeAt(e.position),p===124)i=!1;else if(p===62)i=!0;else return!1;for(e.kind="scalar",e.result="";p!==0;)if(p=e.input.charCodeAt(++e.position),p===43||p===45)Qo===r?r=p===43?Qu:n_:de(e,"repeat of a chomping mode identifier");else if((c=l_(p))>=0)c===0?de(e,"bad explicit indentation width of a block scalar; it cannot be less than one"):o?de(e,"repeat of an indentation width identifier"):(a=t+c-1,o=!0);else break;if(mi(p)){do p=e.input.charCodeAt(++e.position);while(mi(p));if(p===35)do p=e.input.charCodeAt(++e.position);while(!wn(p)&&p!==0)}for(;p!==0;){for($l(e),e.lineIndent=0,p=e.input.charCodeAt(e.position);(!o||e.lineIndenta&&(a=e.lineIndent),wn(p)){l++;continue}if(e.lineIndentt)&&l!==0)de(e,"bad indentation of a sequence entry");else if(e.lineIndentt)&&(ir(e,t,uo,!0,r)&&(_?f=e.result:d=e.result),_||(Xi(e,u,c,p,f,d,s,o),p=f=d=null),at(e,!0,-1),m=e.input.charCodeAt(e.position)),e.lineIndent>t&&m!==0)de(e,"bad indentation of a mapping entry");else if(e.lineIndentt?l=1:e.lineIndent===t?l=0:e.lineIndentt?l=1:e.lineIndent===t?l=0:e.lineIndent tag; it should be "scalar", not "'+e.kind+'"'),p=0,f=e.implicitTypes.length;p tag; it should be "'+d.kind+'", not "'+e.kind+'"'),d.resolve(e.result)?(e.result=d.construct(e.result),e.anchor!==null&&(e.anchorMap[e.anchor]=e.result)):de(e,"cannot resolve a node with !<"+e.tag+"> explicit tag")):de(e,"unknown tag !<"+e.tag+">");return e.listener!==null&&e.listener("close",e),e.tag!==null||e.anchor!==null||c}function y_(e){var t=e.position,n,i,r,s=!1,o;for(e.version=null,e.checkLineBreaks=e.legacy,e.tagMap={},e.anchorMap={};(o=e.input.charCodeAt(e.position))!==0&&(at(e,!0,-1),o=e.input.charCodeAt(e.position),!(e.lineIndent>0||o!==37));){for(s=!0,o=e.input.charCodeAt(++e.position),n=e.position;o!==0&&!It(o);)o=e.input.charCodeAt(++e.position);for(i=e.input.slice(n,e.position),r=[],i.length<1&&de(e,"directive name must not be less than one character in length");o!==0;){for(;mi(o);)o=e.input.charCodeAt(++e.position);if(o===35){do o=e.input.charCodeAt(++e.position);while(o!==0&&!wn(o));break}if(wn(o))break;for(n=e.position;o!==0&&!It(o);)o=e.input.charCodeAt(++e.position);r.push(e.input.slice(n,e.position))}o!==0&&$l(e),ri.call(nc,i)?nc[i](e,i,r):co(e,'unknown document directive "'+i+'"')}if(at(e,!0,-1),e.lineIndent===0&&e.input.charCodeAt(e.position)===45&&e.input.charCodeAt(e.position+1)===45&&e.input.charCodeAt(e.position+2)===45?(e.position+=3,at(e,!0,-1)):s&&de(e,"directives end mark is expected"),ir(e,e.lineIndent-1,uo,!1,!0),at(e,!0,-1),e.checkLineBreaks&&r_.test(e.input.slice(t,e.position))&&co(e,"non-ASCII line breaks are interpreted as content"),e.documents.push(e.result),e.position===e.lineStart&&Io(e)){e.input.charCodeAt(e.position)===46&&(e.position+=3,at(e,!0,-1));return}if(e.position0?e.charCodeAt(s-1):null,f=f&&ac(o,a)}else{for(s=0;si&&e[p+1]!==" ",p=s);else if(!rr(o))return Hs;a=s>0?e.charCodeAt(s-1):null,f=f&&ac(o,a)}u=u||c&&s-p-1>i&&e[p+1]!==" "}return!l&&!u?f&&!r(e)?B0:N0:n>9&&T0(e)?Hs:u?O0:M0}function Y_(e,t,n,i){e.dump=function(){if(t.length===0)return"''";if(!e.noCompatMode&&U_.indexOf(t)!==-1)return"'"+t+"'";var r=e.indent*Math.max(1,n),s=e.lineWidth===-1?-1:Math.max(Math.min(e.lineWidth,40),e.lineWidth-r),o=i||e.flowLevel>-1&&n>=e.flowLevel;function a(l){return V_(e,l)}switch(G_(t,o,e.indent,s,a)){case B0:return t;case N0:return"'"+t.replace(/'/g,"''")+"'";case M0:return"|"+lc(t,e.indent)+uc(oc(t,r));case O0:return">"+lc(t,e.indent)+uc(oc(W_(t,s),r));case Hs:return'"'+Z_(t)+'"';default:throw new ws("impossible error: invalid scalar style")}}()}function lc(e,t){var n=T0(e)?String(t):"",i=e[e.length-1]===`
-`,r=i&&(e[e.length-2]===`
-`||e===`
-`),s=r?"+":i?"":"-";return n+s+`
-`}function uc(e){return e[e.length-1]===`
-`?e.slice(0,-1):e}function W_(e,t){for(var n=/(\n+)([^\n]*)/g,i=function(){var u=e.indexOf(`
-`);return u=u!==-1?u:e.length,n.lastIndex=u,cc(e.slice(0,u),t)}(),r=e[0]===`
-`||e[0]===" ",s,o;o=n.exec(e);){var a=o[1],l=o[2];s=l[0]===" ",i+=a+(!r&&!s&&l!==""?`
-`:"")+cc(l,t),r=s}return i}function cc(e,t){if(e===""||e[0]===" ")return e;for(var n=/ [^ ]/g,i,r=0,s,o=0,a=0,l="";i=n.exec(e);)a=i.index,a-r>t&&(s=o>r?o:a,l+=`
-`+e.slice(r,s),r=s+1),o=a;return l+=`
-`,e.length-r>t&&o>r?l+=e.slice(r,o)+`
-`+e.slice(o+1):l+=e.slice(r),l.slice(1)}function Z_(e){for(var t="",n,i,r,s=0;s=55296&&n<=56319&&(i=e.charCodeAt(s+1),i>=56320&&i<=57343)){t+=sc((n-55296)*1024+i-56320+65536),s++;continue}r=Dt[n],t+=!r&&rr(n)?e[s]:r||sc(n)}return t}function K_(e,t,n){var i="",r=e.tag,s,o;for(s=0,o=n.length;s1024&&(c+="? "),c+=e.dump+(e.condenseFlow?'"':"")+":"+(e.condenseFlow?"":" "),xi(e,t,u,!1,!1)&&(c+=e.dump,i+=c));e.tag=r,e.dump="{"+i+"}"}function ev(e,t,n,i){var r="",s=e.tag,o=Object.keys(n),a,l,u,c,p,f;if(e.sortKeys===!0)o.sort();else if(typeof e.sortKeys=="function")o.sort(e.sortKeys);else if(e.sortKeys)throw new ws("sortKeys must be a boolean or a function");for(a=0,l=o.length;a1024,p&&(e.dump&&Xr===e.dump.charCodeAt(0)?f+="?":f+="? "),f+=e.dump,p&&(f+=Ya(e,t)),xi(e,t+1,c,!0,p)&&(e.dump&&Xr===e.dump.charCodeAt(0)?f+=":":f+=": ",f+=e.dump,r+=f));e.tag=s,e.dump=r||"{}"}function hc(e,t,n){var i,r,s,o,a,l;for(r=n?e.explicitTypes:e.implicitTypes,s=0,o=r.length;s tag resolver accepts not "'+l+'" style');e.dump=i}return!0}return!1}function xi(e,t,n,i,r,s){e.tag=null,e.dump=n,hc(e,n,!1)||hc(e,n,!0);var o=E0.call(e.dump);i&&(i=e.flowLevel<0||e.flowLevel>t);var a=o==="[object Object]"||o==="[object Array]",l,u;if(a&&(l=e.duplicates.indexOf(n),u=l!==-1),(e.tag!==null&&e.tag!=="?"||u||e.indent!==2&&t>0)&&(r=!1),u&&e.usedDuplicates[l])e.dump="*ref_"+l;else{if(a&&u&&!e.usedDuplicates[l]&&(e.usedDuplicates[l]=!0),o==="[object Object]")i&&Object.keys(e.dump).length!==0?(ev(e,t,e.dump,r),u&&(e.dump="&ref_"+l+e.dump)):(Q_(e,t,e.dump),u&&(e.dump="&ref_"+l+" "+e.dump));else if(o==="[object Array]"){var c=e.noArrayIndent&&t>0?t-1:t;i&&e.dump.length!==0?(q_(e,c,e.dump,r),u&&(e.dump="&ref_"+l+e.dump)):(K_(e,c,e.dump),u&&(e.dump="&ref_"+l+" "+e.dump))}else if(o==="[object String]")e.tag!=="?"&&Y_(e,e.dump,t,s);else{if(e.skipInvalid)return!1;throw new ws("unacceptable kind of an object to dump "+o)}e.tag!==null&&e.tag!=="?"&&(e.dump="!<"+e.tag+"> "+e.dump)}return!0}function tv(e,t){var n=[],i=[],r,s;for(Wa(e,n,i),r=0,s=i.length;r("0"+e.toString(16)).substr(-2);function gi(e=12){var t=new Uint8Array(e/2);return window.crypto.getRandomValues(t),Array.from(t,av).join("")}function Ln(){return BigInt(Math.floor(Math.random()*Number.MAX_SAFE_INTEGER))}function P0(e){const t=Math.floor(Math.random()*4294967296)-2147483648,n=e.get(new q.Path(["dimensions"]));e.set(new q.Path(["seed"]),t,!0),Ci(n)&&Object.keys(n).forEach(i=>{e.set(new q.Path(["dimensions",i,"generator","seed"]),t,!0),e.set(new q.Path(["dimensions",i,"generator","biome_source","seed"]),t,!0)}),e.set(new q.Path(["placement","salt"]),Math.abs(t),!0),e.set(new q.Path(["generator","seed"]),t,!0),e.set(new q.Path(["generator","biome_source","seed"]),t)}function $0(e){let t=0;for(let n=0;n=0&&(e=e.slice(0,t)),Rn(e)}function z0(e){const t=lv(e).replace(/^\//,"").replace(/\/$/,"");return Ne.generators.find(n=>n.url===t)}function U0({path:e,search:t,hash:n,replace:i}){const r=(e!==void 0?Rn(e):location.pathname)+(t!==void 0?t.startsWith("?")||t.length===0?t:"?"+t:location.search)+(n!==void 0?n.startsWith("#")?n:"#"+n:location.hash);ii(r,i)}function uv(e){const t=Za.load(e.substring(3,e.indexOf("---",3)));return Ci(t)?t:{}}function cv(e,t){var i;let n=0;for(;;){const r=e.indexOf("{#",n);if(r<0)break;const s=hv(e,r+2),o=e.indexOf("#[",r+1);let a="";if(o>=0&&oc.id===t);a=(i={version:u==null?void 0:u.id,pack_format:u==null?void 0:u.pack_format.toString()}[l])!=null?i:""}e=e.substring(0,r)+a+e.substring(s+2),n=r}return e}function hv(e,t){let n=0,i=0;for(;i++<1e3;){const r=e.indexOf("#}",t),s=e.indexOf("{#",t);if(r<0)return console.warn("Missing closing bracket"),e.length;if(s<0){if(n===0)return r;n-=1,t=r+2}else if(s>8)%256,(t>>16)%256]}function wr(e){return e*e}function Lt(e,t,n){return Math.max(e,Math.min(t,n))}function ea(e,t,n){return n<0?e:n>1?t:Vs(n,e,t)}function Vs(e,t,n){return t+e*(n-t)}function fv(e,t,n,i,r,s){return Vs(t,Vs(e,n,i),Vs(e,r,s))}function Yt(e){return e instanceof Error?e.message:`${e}`}const No=rv();function yi(e,t){if(e===t)return!0;if(e&&t&&typeof e=="object"&&typeof t=="object"){if(e.constructor!==t.constructor)return!1;let n,i;if(Array.isArray(e)){if(n=e.length,n!=t.length)return!1;for(i=0;i{}:f=>{const d=f.target.value;l==null||l(d)},c=Pe(null);me(()=>{r&&c.current&&c.current.select()},[r]);const p=a&&gi();return w("div",{class:`btn btn-input ${n?"large-input":""} ${i?"larger-input":""}`,onClick:f=>f.stopPropagation()},e&&be[e],t&&w("span",null,t),w("input",{ref:c,type:"text",value:s,onChange:u,placeholder:o,list:p}),a&&w("datalist",{id:p},a.map(f=>w("option",{value:f}))))}function Sr({cooldown:e,invert:t,initial:n}={}){const[i,r]=Y(n),s=Pe(void 0);return[i,()=>{r(!t),s.current!==void 0&&clearTimeout(s.current),s.current=setTimeout(()=>{r(!!t)},e!=null?e:2e3)}]}function Es({size:e,draw:t,onDrag:n,onHover:i,onLeave:r},s){const o=Pe(null),a=Pe(),l=Pe(),u=Pe([0,0]),c=Pe(!1);me(()=>{const d=g=>{a.current=[g.offsetX,g.offsetY]},_=g=>{if(a.current===void 0){const A=g.offsetX/o.current.clientWidth,b=g.offsetY/o.current.clientHeight;i==null||i(A,b);return}if(!n)return;const v=g.offsetX-a.current[0],y=g.offsetY-a.current[1];v===0&&y===0||(u.current=[u.current[0]+v,u.current[1]+y],c.current||(cancelAnimationFrame(l.current),l.current=requestAnimationFrame(async()=>{c.current=!0;const A=u.current[0]/o.current.clientWidth,b=u.current[1]/o.current.clientHeight;u.current=[0,0],await(n==null?void 0:n(A,b)),c.current=!1}))),a.current=[g.offsetX,g.offsetY]},h=()=>{a.current=void 0},m=()=>{r==null||r()};return o.current.addEventListener("mousedown",d),o.current.addEventListener("mousemove",_),o.current.addEventListener("mouseleave",m),document.body.addEventListener("mouseup",h),()=>{var g,v,y;(g=o.current)==null||g.removeEventListener("mousedown",d),(v=o.current)==null||v.removeEventListener("mousemove",_),(y=o.current)==null||y.removeEventListener("mouseleave",m),document.body.removeEventListener("mouseup",h)}},[...s!=null?s:[],o.current]);const p=Pe(),f=Pe(0);return p.current=async()=>{const d=o.current.getContext("2d"),_=e();o.current.width=_[0],o.current.height=_[1];const h=d.getImageData(0,0,_[0],_[1]),m=f.current+=1;try{await t(h)}catch(g){throw g}m===f.current&&d.putImageData(h,0,0)},{canvas:o,redraw:p.current}}function Hl(){const[e,t]=Y(!1),n=()=>{t(!1)};return me(()=>(e&&(document.body.addEventListener("click",n),document.body.addEventListener("contextmenu",n)),()=>{document.body.removeEventListener("click",n),document.body.removeEventListener("contextmenu",n)}),[e]),[e,()=>t(!0)]}function pv(){const[e,t]=Y(window.location.hash),n=mt(()=>{t(window.location.hash)},[]);me(()=>(window.addEventListener("hashchange",n),window.addEventListener("replacestate",n),()=>{window.removeEventListener("hashchange",n),window.removeEventListener("replacestate",n)}),[]);const i=mt(r=>{r!==e&&U0({hash:r})},[e]);return[e,i]}function fc(e){const[t,n]=Y(matchMedia(e).matches),i=r=>{n(r.matches)};return me(()=>{const r=matchMedia(e);return r.addEventListener("change",i),()=>{r.removeEventListener("change",i)}},[e]),t}function Mo(e,t,n){const i={invalidated(){e&&t(e)}};me(()=>(e==null||e.addListener(i),()=>{e==null||e.removeListener(i)}),[e,...n!=null?n:[]])}const dc=(e,t)=>{var n;return(n=new URLSearchParams(e).get(t))!=null?n:void 0};function Jr(e){const t=window.location,[n,i]=Y(dc(t.search,e));me(()=>{const s=()=>{i(dc(t.search,e))};return window.addEventListener("popstate",s),window.addEventListener("pushstate",s),window.addEventListener("replacestate",s),()=>{window.removeEventListener("popstate",s),window.removeEventListener("pushstate",s),window.removeEventListener("replacestate",s)}},[]);const r=mt((s,o)=>{if(s!==n){const a=new URLSearchParams(t.search);s===void 0||s.length===0?a.delete(e):a.set(e,s),U0({search:a.toString().replaceAll("%7C","|"),replace:o})}},[n]);return[n,r]}function Tt(e){const{icon:t,label:n,relative:i,tooltip:r,tooltipLoc:s,children:o}=e,[a,l]=Hl();return w("div",ge({class:`btn-menu${i===!1?" no-relative":""}`},e),w(fe,{icon:t,label:n,tooltip:r,tooltipLoc:s,onClick:l}),a&&w("div",{class:"btn-group"},o))}var H0={exports:{}};(function(e,t){(function(i,r){e.exports=r()})(ji,function(){return function(n){var i={};function r(s){if(i[s])return i[s].exports;var o=i[s]={exports:{},id:s,loaded:!1};return n[s].call(o.exports,o,o.exports,r),o.loaded=!0,o.exports}return r.m=n,r.c=i,r.p="",r(0)}([function(n,i,r){var s,o;s=[r(1)],o=function(a){var l={},u=function(D,k,T){var B,M,U={},H,Q,te,$,X,ie=new h(T),ae=T&&T.traceFormat;if(ae!=="chrome"&&ae!=="firefox"){if(ae)throw new Error('unknown traceFormat "'+ae+'" :(');if(c()||d())ae="chrome";else if(p()||f())ae="firefox";else throw new Error("unknown browser :(")}ae==="chrome"?($=/^ +at.+\((.*):([0-9]+):([0-9]+)/,te=4,X=1):($=/@(.*):([0-9]+):([0-9]+)/,te=4,X=0),B=D.split(`
-`).slice(X);for(var j=0;j/)||ie.fetchScript(Q)));ie.sem.whenReady(function(){var I=g(B,U,ie.mapForUri,ae);k(I)})},c=function(){return navigator.userAgent.toLowerCase().indexOf("chrome")>-1},p=function(){return navigator.userAgent.toLowerCase().indexOf("firefox")>-1},f=function(){return navigator.userAgent.toLowerCase().indexOf("safari")>-1},d=function(){return document.documentMode&&document.documentMode>=11},_=function(){this.count=0,this.pending=[]};_.prototype.incr=function(){this.count++},_.prototype.decr=function(){this.count--,this.flush()},_.prototype.whenReady=function(D){this.pending.push(D),this.flush()},_.prototype.flush=function(){this.count===0&&(this.pending.forEach(function(D){D()}),this.pending=[])};var h=function(D){this.sem=new _,this.sync=D&&D.sync,this.mapForUri=D&&D.cacheGlobally?l:{}};h.prototype.ajax=function(D,k){var T=S(),B=this;T.onreadystatechange=function(){T.readyState==4&&k.call(B,T,D)},T.open("GET",D,!this.sync),T.send()},h.prototype.fetchScript=function(D){if(!(D in this.mapForUri))this.sem.incr(),this.mapForUri[D]=null;else return;this.ajax(D,this.onScriptLoad)};var m=new RegExp("^(?:[a-z]+:)?//","i");h.prototype.onScriptLoad=function(D,k){if(D.status===200||k.slice(0,7)==="file://"&&D.status===0){var T=D.responseText.match("//# [s]ourceMappingURL=(.*)[\\s]*$","m");if(T&&T.length===2){var B=T[1],M=B.match("data:application/json;(charset=[^;]+;)?base64,(.*)");if(M&&M[2])this.mapForUri[k]=new a.SourceMapConsumer(atob(M[2])),this.sem.decr();else{if(!m.test(B)){var U,H=k.lastIndexOf("/");H!==-1&&(U=k.slice(0,H+1),B=U+B)}this.ajax(B,function(Q){(Q.status===200||B.slice(0,7)==="file://"&&Q.status===0)&&(this.mapForUri[k]=new a.SourceMapConsumer(Q.responseText)),this.sem.decr()})}}else this.sem.decr()}else this.sem.decr()};var g=function(D,k,T,B){for(var M=[],U,H=B==="chrome"?v:y,Q=0;Q=0){var A=this._originalMappings[y];if(h.column===void 0)for(var b=A.originalLine;A&&A.originalLine===b;)v.push({line:s.getArg(A,"generatedLine",null),column:s.getArg(A,"generatedColumn",null),lastColumn:s.getArg(A,"lastGeneratedColumn",null)}),A=this._originalMappings[++y];else for(var S=A.originalColumn;A&&A.originalLine===m&&A.originalColumn==S;)v.push({line:s.getArg(A,"generatedLine",null),column:s.getArg(A,"generatedColumn",null),lastColumn:s.getArg(A,"lastGeneratedColumn",null)}),A=this._originalMappings[++y]}return v},i.SourceMapConsumer=c;function p(_){var h=_;typeof _=="string"&&(h=JSON.parse(_.replace(/^\)\]\}'/,"")));var m=s.getArg(h,"version"),g=s.getArg(h,"sources"),v=s.getArg(h,"names",[]),y=s.getArg(h,"sourceRoot",null),A=s.getArg(h,"sourcesContent",null),b=s.getArg(h,"mappings"),S=s.getArg(h,"file",null);if(m!=this._version)throw new Error("Unsupported version: "+m);g=g.map(String).map(s.normalize).map(function(D){return y&&s.isAbsolute(y)&&s.isAbsolute(D)?s.relative(y,D):D}),this._names=a.fromArray(v.map(String),!0),this._sources=a.fromArray(g,!0),this.sourceRoot=y,this.sourcesContent=A,this._mappings=b,this.file=S}p.prototype=Object.create(c.prototype),p.prototype.consumer=c,p.fromSourceMap=function(h){var m=Object.create(p.prototype),g=m._names=a.fromArray(h._names.toArray(),!0),v=m._sources=a.fromArray(h._sources.toArray(),!0);m.sourceRoot=h._sourceRoot,m.sourcesContent=h._generateSourcesContent(m._sources.toArray(),m.sourceRoot),m.file=h._file;for(var y=h._mappings.toArray().slice(),A=m.__generatedMappings=[],b=m.__originalMappings=[],S=0,D=y.length;S1&&(H.source=b+te[1],b+=te[1],H.originalLine=y+te[2],y=H.originalLine,H.originalLine+=1,H.originalColumn=A+te[3],A=H.originalColumn,te.length>4&&(H.name=S+te[4],S+=te[4])),U.push(H),typeof H.originalLine=="number"&&M.push(H)}u(U,s.compareByGeneratedPositionsDeflated),this.__generatedMappings=U,u(M,s.compareByOriginalPositions),this.__originalMappings=M},p.prototype._findMapping=function(h,m,g,v,y,A){if(h[g]<=0)throw new TypeError("Line must be greater than or equal to 1, got "+h[g]);if(h[v]<0)throw new TypeError("Column must be greater than or equal to 0, got "+h[v]);return o.search(h,m,y,A)},p.prototype.computeColumnSpans=function(){for(var h=0;h=0){var v=this._generatedMappings[g];if(v.generatedLine===m.generatedLine){var y=s.getArg(v,"source",null);y!==null&&(y=this._sources.at(y),this.sourceRoot!=null&&(y=s.join(this.sourceRoot,y)));var A=s.getArg(v,"name",null);return A!==null&&(A=this._names.at(A)),{source:y,line:s.getArg(v,"originalLine",null),column:s.getArg(v,"originalColumn",null),name:A}}}return{source:null,line:null,column:null,name:null}},p.prototype.hasContentsOfAllSources=function(){return this.sourcesContent?this.sourcesContent.length>=this._sources.size()&&!this.sourcesContent.some(function(h){return h==null}):!1},p.prototype.sourceContentFor=function(h,m){if(!this.sourcesContent)return null;if(this.sourceRoot!=null&&(h=s.relative(this.sourceRoot,h)),this._sources.has(h))return this.sourcesContent[this._sources.indexOf(h)];var g;if(this.sourceRoot!=null&&(g=s.urlParse(this.sourceRoot))){var v=h.replace(/^file:\/\//,"");if(g.scheme=="file"&&this._sources.has(v))return this.sourcesContent[this._sources.indexOf(v)];if((!g.path||g.path=="/")&&this._sources.has("/"+h))return this.sourcesContent[this._sources.indexOf("/"+h)]}if(m)return null;throw new Error('"'+h+'" is not in the SourceMap.')},p.prototype.generatedPositionFor=function(h){var m=s.getArg(h,"source");if(this.sourceRoot!=null&&(m=s.relative(this.sourceRoot,m)),!this._sources.has(m))return{line:null,column:null,lastColumn:null};m=this._sources.indexOf(m);var g={source:m,originalLine:s.getArg(h,"line"),originalColumn:s.getArg(h,"column")},v=this._findMapping(g,this._originalMappings,"originalLine","originalColumn",s.compareByOriginalPositions,s.getArg(h,"bias",c.GREATEST_LOWER_BOUND));if(v>=0){var y=this._originalMappings[v];if(y.source===g.source)return{line:s.getArg(y,"generatedLine",null),column:s.getArg(y,"generatedColumn",null),lastColumn:s.getArg(y,"lastGeneratedColumn",null)}}return{line:null,column:null,lastColumn:null}},i.BasicSourceMapConsumer=p;function d(_){var h=_;typeof _=="string"&&(h=JSON.parse(_.replace(/^\)\]\}'/,"")));var m=s.getArg(h,"version"),g=s.getArg(h,"sections");if(m!=this._version)throw new Error("Unsupported version: "+m);this._sources=new a,this._names=new a;var v={line:-1,column:0};this._sections=g.map(function(y){if(y.url)throw new Error("Support for url field in sections not implemented.");var A=s.getArg(y,"offset"),b=s.getArg(A,"line"),S=s.getArg(A,"column");if(b=0;U--)B=T[U],B==="."?T.splice(U,1):B===".."?M++:M>0&&(B===""?(T.splice(U+1,M),M=0):(T.splice(U,2),M--));return S=T.join("/"),S===""&&(S=k?"/":"."),D?(D.path=S,l(D)):S}i.normalize=u;function c(b,S){b===""&&(b="."),S===""&&(S=".");var D=a(S),k=a(b);if(k&&(b=k.path||"/"),D&&!D.scheme)return k&&(D.scheme=k.scheme),l(D);if(D||S.match(o))return S;if(k&&!k.host&&!k.path)return k.host=S,l(k);var T=S.charAt(0)==="/"?S:u(b.replace(/\/+$/,"")+"/"+S);return k?(k.path=T,l(k)):T}i.join=c,i.isAbsolute=function(b){return b.charAt(0)==="/"||!!b.match(s)};function p(b,S){b===""&&(b="."),b=b.replace(/\/$/,"");for(var D=0;S.indexOf(b+"/")!==0;){var k=b.lastIndexOf("/");if(k<0||(b=b.slice(0,k),b.match(/^([^\/]+:\/)?\/*$/)))return S;++D}return Array(D+1).join("../")+S.substr(b.length+1)}i.relative=p;var f=function(){var b=Object.create(null);return!("__proto__"in b)}();function d(b){return b}function _(b){return m(b)?"$"+b:b}i.toSetString=f?d:_;function h(b){return m(b)?b.slice(1):b}i.fromSetString=f?d:h;function m(b){if(!b)return!1;var S=b.length;if(S<9||b.charCodeAt(S-1)!==95||b.charCodeAt(S-2)!==95||b.charCodeAt(S-3)!==111||b.charCodeAt(S-4)!==116||b.charCodeAt(S-5)!==111||b.charCodeAt(S-6)!==114||b.charCodeAt(S-7)!==112||b.charCodeAt(S-8)!==95||b.charCodeAt(S-9)!==95)return!1;for(var D=S-10;D>=0;D--)if(b.charCodeAt(D)!==36)return!1;return!0}function g(b,S,D){var k=b.source-S.source;return k!==0||(k=b.originalLine-S.originalLine,k!==0)||(k=b.originalColumn-S.originalColumn,k!==0||D)||(k=b.generatedColumn-S.generatedColumn,k!==0)||(k=b.generatedLine-S.generatedLine,k!==0)?k:b.name-S.name}i.compareByOriginalPositions=g;function v(b,S,D){var k=b.generatedLine-S.generatedLine;return k!==0||(k=b.generatedColumn-S.generatedColumn,k!==0||D)||(k=b.source-S.source,k!==0)||(k=b.originalLine-S.originalLine,k!==0)||(k=b.originalColumn-S.originalColumn,k!==0)?k:b.name-S.name}i.compareByGeneratedPositionsDeflated=v;function y(b,S){return b===S?0:b>S?1:-1}function A(b,S){var D=b.generatedLine-S.generatedLine;return D!==0||(D=b.generatedColumn-S.generatedColumn,D!==0)||(D=y(b.source,S.source),D!==0)||(D=b.originalLine-S.originalLine,D!==0)||(D=b.originalColumn-S.originalColumn,D!==0)?D:y(b.name,S.name)}i.compareByGeneratedPositionsInflated=A},function(n,i){i.GREATEST_LOWER_BOUND=1,i.LEAST_UPPER_BOUND=2;function r(s,o,a,l,u,c){var p=Math.floor((o-s)/2)+s,f=u(a,l[p],!0);return f===0?p:f>0?o-p>1?r(p,o,a,l,u,c):c==i.LEAST_UPPER_BOUND?o1?r(s,p,a,l,u,c):c==i.LEAST_UPPER_BOUND?p:s<0?-1:s}i.search=function(o,a,l,u){if(a.length===0)return-1;var c=r(-1,a.length,o,a,l,u||i.GREATEST_LOWER_BOUND);if(c<0)return-1;for(;c-1>=0&&l(a[c],a[c-1],!0)===0;)--c;return c}},function(n,i,r){var s=r(2),o=Object.prototype.hasOwnProperty;function a(){this._array=[],this._set=Object.create(null)}a.fromArray=function(u,c){for(var p=new a,f=0,d=u.length;f=0&&u>1;return d?-_:_}i.encode=function(d){var _="",h,m=c(d);do h=m&l,m>>>=o,m>0&&(h|=u),_+=s.encode(h);while(m>0);return _},i.decode=function(d,_,h){var m=d.length,g=0,v=0,y,A;do{if(_>=m)throw new Error("Expected more digits in base 64 VLQ value.");if(A=s.decode(d.charCodeAt(_++)),A===-1)throw new Error("Invalid base64 digit: "+d.charAt(_-1));y=!!(A&u),A&=l,g=g+(A<{if(e instanceof Error){const a=e.stack.split(`
-`).map(l=>l.replace(/^(\s+)at (?:async )?(https?:.*)/,"$1at ($2)"));s(a.join(`
-`)),H0.exports.mapStackTrace(a.join(`
-`),l=>{const u=l.map(c=>c.replace(/..\/..\/src\//,"src/")).join(`
-`);s(u)})}},[e]);const o=He(()=>{let a="https://github.com/misode/misode.github.io/issues/new";return e instanceof Error?(a+=`?title=${encodeURIComponent(`${e.name}: ${e.message}`)}`,r&&(a+=`&body=${encodeURIComponent(`\`\`\`
-${e.name}: ${e.message}
-${r}
-\`\`\`
-`)}`)):a+=`?title=${encodeURIComponent(e.toString())}`,a},[e,r]);return w("div",{class:"error"},t&&w("div",{class:"error-dismiss",onClick:t},be.x),w("h3",null,e instanceof Error?e.message:e,r&&w("span",{onClick:()=>i(!n)},be.info)),r&&n&&w("pre",null,r),w("p",null,"If you think this is a bug, you can report it ",w("a",{href:o,target:"_blank"},"on GitHub")))}function mv({label:e,value:t,onChange:n}){const i=gi();return w("label",{class:"checkbox"},w("input",{id:i,type:"checkbox",checked:t,onClick:()=>n(!t)}),e)}function Vl(e,t,n){const i=r=>{const s=r.onChange&&(a=>{var u;const l=a.target.value;(u=r.onChange)==null||u.call(r,n(l))}),o=r.onEnter&&(a=>{var l;if(a.key==="Enter"){const u=a.target.value;(l=r.onEnter)==null||l.call(r,n(u))}});return w("input",Je(ge({},r),{type:t,onChange:s,onKeyDown:o}))};return i.displayName=e,i}const wi=Vl("TextInput","text",e=>e),gv=Vl("NumberInput","number",e=>Number(e)),pc=Vl("RangeInput","range",e=>Number(e));function mc({values:e,onSelect:t,searchPlaceholder:n,noResults:i}){const[r,s]=Y(""),o=He(()=>{var l;const a=r.trim().split(" ");return(l=e==null?void 0:e.filter(u=>a.every(c=>u.includes(c))))!=null?l:[]},[e,r]);return w(xe,null,w(Xs,{icon:"search",large:!0,value:r,onChange:s,doSelect:1,placeholder:n!=null?n:"Search"}),w("div",{class:"result-list"},o.map(a=>w(fe,{key:a,label:a,onClick:()=>t==null?void 0:t(a)})),o.length===0&&w(fe,{label:i!=null?i:"No results"})))}const Xl="https://raw.githubusercontent.com/misode/technical-changes/main";let ta=null;async function V0(){if(!ta){const e=await(await fetch(`${Xl}/index.json`)).json();ta=(await Promise.all(e.map((t,n)=>_v(X0(t),n)))).flat().map(t=>Je(ge({},t),{tags:[t.group.id,...t.tags]}))}return ta}async function _v(e,t){const n=await(await fetch(`${Xl}/${e.id}/index.json`)).json();return(await Promise.all(n.map((i,r)=>vv(e,X0(i),t,r)))).flat()}async function vv(e,t,n,i){const r=await(await fetch(`${Xl}/${e.id}/${t.id}.md`)).text();return xv(r).map(s=>ge({version:t,group:e,order:n*1e3+i},s))}function xv(e){return e.split(`
-
-`).map(t=>{const n=t.indexOf("|");return{tags:t.substring(0,n).trim().split(" "),content:t.slice(n+1).trim().replaceAll("->","\u2192").replaceAll(`
-...
-`,`
-
-`)}})}function X0(e){return typeof e=="string"?{id:e,article:e.match(/\d\dw\d\d[a-z]/)?"minecraft-snapshot-"+e:e.match(/\d+\.\d+(\.\d+)?-pre[0-9]+/)?"minecraft-"+e.replaceAll(".","-").replaceAll("pre","pre-release-"):null}:Ci(e)?e:{id:"unknown",article:null}}["1.15","1.16","1.17"].forEach(e=>localStorage.removeItem(`cache_${e}`));["mcdata_master","vanilla_datapack_summary"].forEach(e=>localStorage.removeItem(`cached_${e}`));caches.delete("misode-v1");const Wi="misode-v2",gc="cached_latest_version",na="22w18a",Dr="https://raw.githubusercontent.com/misode/mcmeta";function si(e,t){return`${Dr}/${e.dynamic?t:`${e.ref}-${t}`}`}async function Oo(e){e.dynamic&&(localStorage.getItem(gc)!==na&&(await Cv(t=>t.startsWith(`${Dr}/summary/`)||t.startsWith(`${Dr}/data/`)||t.startsWith(`${Dr}/assets/`)||t.startsWith(`${Dr}/registries/`)),localStorage.setItem(gc,na)),e.ref=na)}async function yv(e,t,n){const i=Ne.versions.find(r=>r.id===e);if(!i){console.error(`[fetchData] Unknown version ${i} in ${JSON.stringify(Ne.versions)}`);return}await Oo(i),await Promise.all([wv(i,t),Ev(i,n)])}async function wv(e,t){console.debug(`[fetchRegistries] ${e.id}`);try{const n=await sr(`${si(e,"summary")}/registries/data.min.json`);for(const i in n)t.register(i,n[i].map(r=>"minecraft:"+r))}catch(n){console.warn("Error occurred while fetching registries:",Yt(n))}}async function Ev(e,t){console.debug(`[fetchBlockStateMap] ${e.id}`);try{const n=await sr(`${si(e,"summary")}/blocks/data.min.json`);for(const i in n)t["minecraft:"+i]={properties:n[i][0],default:n[i][1]}}catch(n){console.warn("Error occurred while fetching block state map:",Yt(n))}}async function J0(e,t,n){console.debug(`[fetchPreset] ${e} ${t} ${n}`);const i=Ne.versions.find(r=>r.id===e);try{const r=["blockstates","models"].includes(t)?"assets":"data",s=`${si(i,r)}/${r}/minecraft/${t}/${n}.json`;return await(await fetch(s)).json()}catch(r){throw new Error(`Error occurred while fetching ${t} preset ${n}: ${Yt(r)}`)}}async function bv(e,t){console.debug(`[fetchAllPresets] ${e} ${t}`);const n=Ne.versions.find(i=>i.id===e);await Oo(n);try{const i=await sr(`${si(n,"registries")}/${t}/data.min.json`);return new Map(await Promise.all(i.map(async r=>[r,await sr(`${si(n,"data")}/data/minecraft/${t}/${r}.json`)])))}catch(i){throw new Error(`Error occurred while fetching all ${t} presets: ${Yt(i)}`)}}async function Av(e){const t=Ne.versions.find(n=>n.id===e);await Oo(t);try{const n=`${si(t,"summary")}/sounds/data.min.json`;return await sr(n)}catch(n){throw new Error(`Error occurred while fetching sounds for ${t}: ${Yt(n)}`)}}function Sv(e,t){const n=Ne.versions.find(i=>i.id===e);return`${si(n,"assets")}/assets/minecraft/sounds/${t}.ogg`}async function Dv(){const e=Ne.versions[Ne.versions.length-1];await Oo(e);try{return sr(`${si(e,"summary")}/versions/data.min.json`)}catch(t){throw new Error(`Error occured while fetching versions: ${Yt(t)}`)}}async function sr(e,t=n=>n){try{const n=await caches.open(Wi);console.debug(`[getData] Opened cache ${Wi} ${e}`);const i=await n.match(e);if(i&&i.ok)return console.debug(`[getData] Retrieving cached data ${e}`),await i.json();console.debug(`[getData] fetching data ${e}`);const r=await fetch(e),s=t(await r.json());return await n.put(e,new Response(JSON.stringify(s))),s}catch(n){console.warn(`[getData] Failed to open cache ${Wi}: ${Yt(n)}`),console.debug(`[getData] fetching data ${e}`);const i=await fetch(e);return t(await i.json())}}async function Cv(e){try{const t=await caches.open(Wi);console.debug(`[deleteMatching] Opened cache ${Wi}`);const n=[];for(const i of await t.keys())e(i.url)&&n.push(t.delete(i));console.debug(`[deleteMatching] Removing ${n.length} cache objects...`),await Promise.all(n)}catch(t){console.warn(`[deleteMatching] Failed to open cache ${Wi}: ${Yt(t)}`)}}const kv="modulepreload",_c={},Fv="/",Ce=function(t,n){return!n||n.length===0?t():Promise.all(n.map(i=>{if(i=`${Fv}${i}`,i in _c)return;_c[i]=!0;const r=i.endsWith(".css"),s=r?'[rel="stylesheet"]':"";if(document.querySelector(`link[href="${i}"]${s}`))return;const o=document.createElement("link");if(o.rel=r?"stylesheet":kv,r||(o.as="script",o.crossOrigin=""),o.href=i,document.head.appendChild(o),r)return new Promise((a,l)=>{o.addEventListener("load",a),o.addEventListener("error",()=>l(new Error(`Unable to preload CSS for ${i}`)))})})).then(()=>t())},G0=["1.15","1.16","1.17","1.18","1.18.2","1.19"],Ti={},Bi={},Iv={1.15:()=>Ce(()=>import("./index.047b40e9.js").then(function(e){return e.i}),[]),1.16:()=>Ce(()=>import("./index.43e8f1d5.js").then(function(e){return e.i}),[]),1.17:()=>Ce(()=>import("./index.ec1836d3.js").then(function(e){return e.i}),[]),1.18:()=>Ce(()=>import("./index.f8251f36.js").then(function(e){return e.i}),[]),"1.18.2":()=>Ce(()=>import("./index.e47e678b.js").then(function(e){return e.i}),[]),1.19:()=>Ce(()=>import("./index.15314e06.js").then(function(e){return e.i}),[])};let Y0,W0,Js;async function Jl(e){return Ti[e]||(Ti[e]=(async()=>{try{const t=await Iv[e](),n=t.getCollections(),i={};await yv(e,n,i);const r=t.getSchemas(n);return Ti[e]={collections:n,schemas:r,blockStates:i},Ti[e]}catch(t){throw new Error(`Cannot get version "${e}": ${Yt(t)}`)}})()),Ti[e]}async function Tv(e,t){var n;if(!Bi[t]||Bi[t].version!==e){const i=await Jl(e);Y0=q.Reference(i.schemas,"configured_decorator"),W0=q.ChoiceNode([{type:"string",node:q.StringNode(i.collections,{validator:"resource",params:{pool:"$worldgen/configured_feature"}})},{type:"object",node:q.Reference(i.schemas,"configured_feature")}],{choiceContext:"feature"});const r=(n=Ne.generators.find(s=>s.id===t))==null?void 0:n.schema;if(!r)throw new Error(`Cannot find model ${t}`);try{const s=i.schemas.get(r),o=new q.DataModel(s,{wrapLists:!0});Bi[t]?o.reset(Bi[t].model.data,!1):(o.validate(!0),o.history=[JSON.stringify(o.data)]),Bi[t]={model:o,version:e}}catch(s){const o=new Error(`Cannot get generator "${t}" for version "${e}": ${Yt(s)}`);throw s instanceof Error&&(o.stack=s.stack),o}}return Bi[t].model}async function Bv(e){const t=await Jl(e);return Js=t.collections,t.collections}async function Nv(e){return(await Jl(e)).blockStates}function Bt(e,t,n){const i=Ne.versions.findIndex(o=>o.id===e),r=t?Ne.versions.findIndex(o=>o.id===t):0,s=n?Ne.versions.findIndex(o=>o.id===n):Ne.versions.length-1;return r<=i&&i<=s}var Z0={exports:{}};(function(e){var t=function(){var n=String.fromCharCode,i="ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/=",r="ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+-$",s={};function o(l,u){if(!s[l]){s[l]={};for(var c=0;c>>8,c[p*2+1]=d%256}return c},decompressFromUint8Array:function(l){if(l==null)return a.decompress(l);for(var u=new Array(l.length/2),c=0,p=u.length;c>1}else{for(f=1,p=0;p>1}v--,v==0&&(v=Math.pow(2,A),A++),delete _[g]}else for(f=d[g],p=0;p>1;v--,v==0&&(v=Math.pow(2,A),A++),d[m]=y++,g=String(h)}if(g!==""){if(Object.prototype.hasOwnProperty.call(_,g)){if(g.charCodeAt(0)<256){for(p=0;p>1}else{for(f=1,p=0;p>1}v--,v==0&&(v=Math.pow(2,A),A++),delete _[g]}else for(f=d[g],p=0;p>1;v--,v==0&&(v=Math.pow(2,A),A++)}for(f=2,p=0;p>1;for(;;)if(S=S<<1,D==u-1){b.push(c(S));break}else D++;return b.join("")},decompress:function(l){return l==null?"":l==""?null:a._decompress(l.length,32768,function(u){return l.charCodeAt(u)})},_decompress:function(l,u,c){var p=[],f=4,d=4,_=3,h="",m=[],g,v,y,A,b,S,D,k={val:c(0),position:u,index:1};for(g=0;g<3;g+=1)p[g]=g;for(y=0,b=Math.pow(2,2),S=1;S!=b;)A=k.val&k.position,k.position>>=1,k.position==0&&(k.position=u,k.val=c(k.index++)),y|=(A>0?1:0)*S,S<<=1;switch(y){case 0:for(y=0,b=Math.pow(2,8),S=1;S!=b;)A=k.val&k.position,k.position>>=1,k.position==0&&(k.position=u,k.val=c(k.index++)),y|=(A>0?1:0)*S,S<<=1;D=n(y);break;case 1:for(y=0,b=Math.pow(2,16),S=1;S!=b;)A=k.val&k.position,k.position>>=1,k.position==0&&(k.position=u,k.val=c(k.index++)),y|=(A>0?1:0)*S,S<<=1;D=n(y);break;case 2:return""}for(p[3]=D,v=D,m.push(D);;){if(k.index>l)return"";for(y=0,b=Math.pow(2,_),S=1;S!=b;)A=k.val&k.position,k.position>>=1,k.position==0&&(k.position=u,k.val=c(k.index++)),y|=(A>0?1:0)*S,S<<=1;switch(D=y){case 0:for(y=0,b=Math.pow(2,8),S=1;S!=b;)A=k.val&k.position,k.position>>=1,k.position==0&&(k.position=u,k.val=c(k.index++)),y|=(A>0?1:0)*S,S<<=1;p[d++]=n(y),D=d-1,f--;break;case 1:for(y=0,b=Math.pow(2,16),S=1;S!=b;)A=k.val&k.position,k.position>>=1,k.position==0&&(k.position=u,k.val=c(k.index++)),y|=(A>0?1:0)*S,S<<=1;p[d++]=n(y),D=d-1,f--;break;case 2:return m.join("")}if(f==0&&(f=Math.pow(2,_),_++),p[D])h=p[D];else if(D===d)h=v+v.charAt(0);else return null;m.push(h),p[d++]=v+h.charAt(0),f--,v=h,f==0&&(f=Math.pow(2,_),_++)}}};return a}();e!=null&&(e.exports=t)})(Z0);var K0=Z0.exports;const Mv="https://z15g7can.directus.app/items",Ka="share",vc=new Map;async function Ov(e,t,n,i){try{const r=K0.compressToBase64(JSON.stringify(n)),s=btoa(JSON.stringify(n));console.log("Compression rate",s.length/r.length);const o=JSON.stringify({data:r,type:e,version:t,show_preview:i});let a=vc.get(o);if(!a){const u=await q0("/snippets",o);vc.set(o,u.id),a=u.id}const l=Ne.generators.find(u=>u.id===e);return`${location.protocol}//${location.host}/${l.url}/?${Ka}=${a}`}catch(r){throw r instanceof Error&&(r.message=`Error creating share link: ${r.message}`),r}}async function xc(e){var t;try{const n=await q0(`/snippets/${e}`);return Je(ge({},n),{data:JSON.parse((t=K0.decompressFromBase64(n.data))!=null?t:"{}")})}catch(n){throw n instanceof Error&&(n.message=`Error loading shared content: ${n.message}`),n}}async function q0(e,t){var r,s,o;const i=await(await fetch(Mv+e,t?{method:"post",headers:{"Content-Type":"application/json"},body:t}:void 0)).json();if(i.data)return i.data;throw new Error((o=(s=(r=i.errors)==null?void 0:r[0])==null?void 0:s.message)!=null?o:"Unknown error")}var Q0=JSON.parse('{"add":"Add","add_bottom":"Add to bottom","add_top":"Add to top","advancement":"Advancement","any_version":"Any","assets":"Assets","block_definition":"Blockstate","changelog.search":"Search changes","changelog.no_results":"No changes","chat_type":"Chat Type","collapse":"Collapse","collapse_all":"Hold %0% to collapse all","configure_layers":"Configure layers","copy":"Copy","copy_share":"Copy share link","copied":"Copied!","copy_context":"Copy context","dimension_type":"Dimension Type","dimension":"Dimension","disabled":"Disabled","download":"Download","duplicate":"Duplicate","enabled":"Enabled","entries_hidden":"%0% entries hidden","entries_hidden.more":"Show %0% more","entries_hidden.all":"Show all","expand":"Expand","expand_all":"Hold %0% to expand all","feature.decorated.decorators":"Decorators","feature.decorated.decorators.entry":"Decorator","follow_reference":"Follow reference","format.json":"JSON","format.yaml":"YAML","fields":"Fields","generate_new_seed":"Generate new seed","github":"GitHub","guides.all":"All guides","guides.search":"Search guides","guides.no_results.version":"No guides for this version","guides.no_results.query":"No guides for this query","hide_output":"Hide output","hide_preview":"Hide preview","home":"Home","import":"Import","indentation.2_spaces":"2 spaces","indentation.4_spaces":"4 spaces","indentation.minified":"Minified","indentation.tabs":"Tabs","item_modifier":"Item Modifier","language":"Language","layer.biomes":"Biomes","layer.temperature":"Temperature","layer.humidity":"Humidity","layer.continentalness":"Continentalness","layer.erosion":"Erosion","layer.weirdness":"Weirdness","layer.offset":"Offset","layer.factor":"Factor","layer.jaggedness":"Jaggedness","highlighting":"Highlighting","loading":"Loading...","loot_table":"Loot Table","model":"Model","more":"More","move_down":"Move down","move_up":"Move up","not_found.description":"The page you were looking for does not exist.","no_presets":"No presets","output_settings":"Output settings","predicate":"Predicate","recipe":"Recipe","redo":"Redo","reset":"Reset","restore_backup":"Restore last backup","settings":"Settings","settings.fields.description":"Customize advanced field settings","settings.fields.path":"Context","settings.fields.name":"Name","share":"Share","theme":"Theme","theme.dark":"Dark","theme.light":"Light","theme.system":"System","title.changelog":"Technical Changelog","title.generator":"%0% Generator","title.generator_category":"%0% Generators","title.guides":"Data Pack Guides","title.home":"Data Pack Generators","title.project":"%0% Project","title.sounds":"Sound Explorer","title.versions":"Versions Explorer","presets":"Presets","preview":"Visualize","preview.auto_scroll":"Auto scroll","preview.biome":"Biome","preview.scale":"Scale","preview.depth":"Depth","preview.factor":"Factor","preview.offset":"Offset","preview.peaks":"Peaks","preview.width":"Width","project.delete_file":"Delete file","project.go_to":"Go to project","project.new_file":"New file","project.no_files":"No files","project.search":"Search project","project.search_drafts":"Search drafts","project.unsaved_file":"Unsaved file","remove":"Remove","search":"Search","show_output":"Show output","show_preview":"Show preview","sounds.play":"Play","sounds.play_sound":"Play sound","sounds.play_all":"Play all","sounds.search":"Search sounds","sounds.download_function":"Download Mcfunction","sounds.delay":"Delay","sounds.pitch":"Pitch","sounds.volume":"Volume","sounds.copy_command":"Copy command","sounds.add_sound":"Add sound","sounds.remove_sound":"Remove sound","sounds.unknown_sound":"Unknown sound","sounds.loading_sound":"Loading sound","source_placeholder":"Paste raw %0% content here","switch_generator":"Switch generator","switch_version":"Switch version","terrain_settings":"Terrain settings","text_component":"Text Component","undo":"Undo","versions.search":"Search versions","versions.no_results":"No results","versions.all":"All versions","versions.previous":"Previous","versions.next":"Next","versions.released":"Released","versions.release_target":"Release target","versions.data_version":"Data version","versions.protocol_version":"Protocol version","versions.pack_format":"Pack format","versions.data_pack_format":"Data pack format","versions.resource_pack_format":"Resource pack format","versions.technical_changes":"Technical changes","versions.discussion":"Discussion","world":"World Settings","worldgen":"Worldgen","worldgen/biome":"Biome","worldgen/configured_carver":"Carver","worldgen/configured_feature":"Feature","worldgen/density_function":"Density Function","worldgen/placed_feature":"Placed Feature","worldgen/noise":"Noise","worldgen/noise_settings":"Noise Settings","worldgen/processor_list":"Processor List","worldgen/configured_structure_feature":"Structure Feature","worldgen/structure":"Structure","worldgen/structure_set":"Structure Set","worldgen/configured_surface_builder":"Surface Builder","worldgen/template_pool":"Template Pool","worldgen/world_preset":"World Preset","worldgen/flat_level_generator_preset":"Flat World Preset","zoom_in":"Zoom in","zoom_out":"Zoom out"}'),Lv=Object.freeze(Object.defineProperty({__proto__:null,default:Q0},Symbol.toStringTag,{value:"Module"})),pt;(e=>{e.ID_LANGUAGE="language",e.ID_THEME="theme",e.ID_VERSION="schema_version",e.ID_INDENT="indentation",e.ID_FORMAT="output_format",e.ID_HIGHLIGHTING="output_highlighting",e.ID_SOUNDS_VERSION="minecraft_sounds_version",e.ID_PROJECTS="misode_projects",e.ID_BACKUPS="misode_generator_backups";function t(){var y;return(y=localStorage.getItem(e.ID_LANGUAGE))!=null?y:"en"}e.getLanguage=t;function n(){var y;return(y=localStorage.getItem(e.ID_THEME))!=null?y:"dark"}e.getTheme=n;function i(){const y=localStorage.getItem(e.ID_VERSION);return y&&G0.includes(y)?y:"1.18.2"}e.getVersion=i;function r(){var y;return(y=localStorage.getItem(e.ID_INDENT))!=null?y:"2_spaces"}e.getIndent=r;function s(){var y;return(y=localStorage.getItem(e.ID_FORMAT))!=null?y:"json"}e.getFormat=s;function o(){return localStorage.getItem(e.ID_HIGHLIGHTING)!=="false"}e.getHighlighting=o;function a(){var y;return(y=localStorage.getItem(e.ID_SOUNDS_VERSION))!=null?y:"latest"}e.getSoundsVersion=a;function l(){const y=localStorage.getItem(e.ID_PROJECTS);return y?JSON.parse(y):[ho]}e.getProjects=l;function u(y){var b;return JSON.parse((b=localStorage.getItem(e.ID_BACKUPS))!=null?b:"{}")[y]}e.getBackup=u;function c(y){y&&localStorage.setItem(e.ID_LANGUAGE,y)}e.setLanguage=c;function p(y){y&&localStorage.setItem(e.ID_THEME,y)}e.setTheme=p;function f(y){y&&localStorage.setItem(e.ID_VERSION,y)}e.setVersion=f;function d(y){y&&localStorage.setItem(e.ID_INDENT,y)}e.setIndent=d;function _(y){y&&localStorage.setItem(e.ID_FORMAT,y)}e.setFormat=_;function h(y){y!==void 0&&localStorage.setItem(e.ID_HIGHLIGHTING,y.toString())}e.setHighlighting=h;function m(y){y&&localStorage.setItem(e.ID_SOUNDS_VERSION,y)}e.setSoundsVersion=m;function g(y){y&&localStorage.setItem(e.ID_PROJECTS,JSON.stringify(y))}e.setProjects=g;function v(y,A){var S;const b=JSON.parse((S=localStorage.getItem(e.ID_BACKUPS))!=null?S:"{}");A===void 0?delete b[y]:b[y]=A,localStorage.setItem(e.ID_BACKUPS,JSON.stringify(b))}e.setBackup=v})(pt||(pt={}));function Rv(e){switch(e){case"../../../node_modules/@mcschema/locales/src/cs.json":return Ce(()=>import("./cs.967a01eb.js"),[]);case"../../../node_modules/@mcschema/locales/src/de.json":return Ce(()=>import("./de.8e2383d8.js"),[]);case"../../../node_modules/@mcschema/locales/src/en.json":return Ce(()=>import("./en.4ab98cb7.js"),[]);case"../../../node_modules/@mcschema/locales/src/es.json":return Ce(()=>import("./es.6b3597bc.js"),[]);case"../../../node_modules/@mcschema/locales/src/fr.json":return Ce(()=>import("./fr.e316b1e2.js"),[]);case"../../../node_modules/@mcschema/locales/src/it.json":return Ce(()=>import("./it.7ff123cd.js"),[]);case"../../../node_modules/@mcschema/locales/src/ja.json":return Ce(()=>import("./ja.3170354d.js"),[]);case"../../../node_modules/@mcschema/locales/src/pl.json":return Ce(()=>import("./pl.ae1f6791.js"),[]);case"../../../node_modules/@mcschema/locales/src/pt.json":return Ce(()=>import("./pt.31e14993.js"),[]);case"../../../node_modules/@mcschema/locales/src/ru.json":return Ce(()=>import("./ru.1298edc9.js"),[]);case"../../../node_modules/@mcschema/locales/src/sk.json":return Ce(()=>import("./sk.d4265232.js"),[]);case"../../../node_modules/@mcschema/locales/src/zh-cn.json":return Ce(()=>import("./zh-cn.4129665a.js"),[]);case"../../../node_modules/@mcschema/locales/src/zh-tw.json":return Ce(()=>import("./zh-tw.bdc36a24.js"),[]);default:return new Promise(function(t,n){(typeof queueMicrotask=="function"?queueMicrotask:setTimeout)(n.bind(null,new Error("Unknown variable dynamic import: "+e)))})}}function Pv(e){switch(e){case"../../locales/de.json":return Ce(()=>import("./de.a269acce.js"),[]);case"../../locales/en.json":return Ce(()=>Promise.resolve().then(function(){return Lv}),void 0);case"../../locales/es.json":return Ce(()=>import("./es.833a9774.js"),[]);case"../../locales/fr.json":return Ce(()=>import("./fr.f5531eea.js"),[]);case"../../locales/it.json":return Ce(()=>import("./it.fd9a8268.js"),[]);case"../../locales/ja.json":return Ce(()=>import("./ja.167de97b.js"),[]);case"../../locales/pl.json":return Ce(()=>import("./pl.3a9fb38c.js"),[]);case"../../locales/pt.json":return Ce(()=>import("./pt.1a04bd2d.js"),[]);case"../../locales/ru.json":return Ce(()=>import("./ru.578070fe.js"),[]);case"../../locales/sk.json":return Ce(()=>import("./sk.96bbf351.js"),[]);case"../../locales/zh-cn.json":return Ce(()=>import("./zh-cn.e3c47b68.js"),[]);case"../../locales/zh-tw.json":return Ce(()=>import("./zh-tw.42e9d37d.js"),[]);default:return new Promise(function(t,n){(typeof queueMicrotask=="function"?queueMicrotask:setTimeout)(n.bind(null,new Error("Unknown variable dynamic import: "+e)))})}}const ed=fr({lang:"none",locale:e=>e,changeLanguage:()=>{}}),Or={fallback:Q0};function Fe(e,t,...n){var r,s,o,a,l;const i=(l=(a=(o=(r=Or[e])==null?void 0:r[t])!=null?o:(s=Or.en)==null?void 0:s[t])!=null?a:Or.fallback[t])!=null?l:t;return $v(i,n)}function $v(e,t){return e.replace(/%\d+%/g,n=>{const i=parseInt(n.slice(1,-1));return(t==null?void 0:t[i])!==void 0?t[i]:n})}async function ia(e){if(Or[e])return;const t=Ne.languages.find(r=>r.code===e);if(!t)return;const n=await Pv(`../../locales/${e}.json`),i=t.schemas!==!1&&await Rv(`../../../node_modules/@mcschema/locales/src/${e}.json`);Or[e]=ge(ge({},n.default),i.default)}function We(){return pr(ed)}function zv({children:e}){const[t,n]=Y("none"),i=mt((o,...a)=>Fe(t,o,...a),[t]),r=mt(async o=>{await ia(o),it.setLanguage(o),pt.setLanguage(o),n(o)},[]);me(()=>{(async()=>{const o=pt.getLanguage();await Promise.all([ia("en"),...o!=="en"?[ia(o)]:[]]),n(o)})()},[]);const s={lang:t,locale:i,changeLanguage:r};return w(ed.Provider,{value:s},e)}const ho={name:"Drafts",namespace:"draft",files:[]},td=fr({project:ho,changeProject:()=>{},updateProject:()=>{},updateFile:()=>!1,openFile:()=>{},closeFile:()=>{}});function nd(){return pr(td)}function Uv({children:e}){const[t,n]=Y(pt.getProjects()),[i,r]=Y(ho.name),s=He(()=>{var h;return(h=t.find(m=>m.name===i))!=null?h:ho},[t,i]),[o,a]=Y(void 0),l=He(()=>{if(!!o)return s.files.find(h=>h.type===o[0]&&h.id===o[1])},[s,o]),u=mt(h=>{pt.setProjects(h),n(h)},[]),c=mt(h=>{u(t.map(m=>m.name===i?ge(ge({},m),h):m))},[t,i]),p=mt((h,m,g)=>{var v;if(!g.id)c({files:s.files.filter(y=>y.type!==h||y.id!==m)});else{const y=g.id.includes(":")?g.id:`${s.namespace}:${g.id}`,A=s.files.some(b=>b.type===h&&b.id===y);if(m){if((l==null?void 0:l.id)===m&&m!==y&&A)return!1;c({files:s.files.map(b=>b.type===h&&b.id===m?Je(ge(ge({},b),g),{id:y}):b)}),(l==null?void 0:l.id)===m&&a([h,y])}else{if(A)return!1;c({files:[...s.files,{type:h,id:y,data:(v=g.data)!=null?v:{}}]}),a([h,y])}}return!0},[c,s,l]),f=mt((h,m)=>{const g=Ne.generators.find(v=>v.id===h||v.path===h);if(!g)throw new Error(`Cannot find generator of type ${h}`);a([g.id,m]),ii(Rn(g.url))},[]),d=mt(()=>{a(void 0)},[]),_={project:s,file:l,changeProject:r,updateProject:c,updateFile:p,openFile:f,closeFile:d};return w(td.Provider,{value:_},e)}function jv(e){var r;const[t,n]=e.id.includes(":")?e.id.split(":"):["minecraft",e.id],i=Ne.generators.find(s=>s.id===e.type);if(!i)throw new Error(`Cannot find generator of type ${e.type}`);return`data/${t}/${(r=i.path)!=null?r:i.id}/${n}`}const id=fr({theme:"dark",actualTheme:"dark",changeTheme:()=>{}});function rd(){return pr(id)}function Hv({children:e}){const[t,n]=Y(pt.getTheme()),i=fc("(prefers-color-scheme: light)"),r=fc("(prefers-color-scheme: dark)");me(()=>{document.documentElement.setAttribute("data-theme",t)},[t]);const s=mt(a=>{it.setTheme(a),pt.setTheme(a),n(a)},[]);me(()=>{it.setPrefersColorScheme(i?"light":r?"dark":"none")},[i,r]);const o={theme:t,actualTheme:t==="light"||t!=="dark"&&i?"light":"dark",changeTheme:s};return w(id.Provider,{value:o},e)}const Vv=3,sd=fr({title:"",changeTitle:()=>{}});function sn(e,t){const n=pr(sd);return me(()=>{e&&n.changeTitle(e,t)},[e,t]),n}function Xv({children:e}){const{locale:t}=We(),[n,i]=Y(t("title.home")),r=mt((o,a)=>{a!=null||(a=Ne.versions.map(u=>u.id));const l=a.slice(-Vv);document.title=`${o} Minecraft ${l.join(", ")}`,i(o)},[]),s={title:n,changeTitle:r};return w(sd.Provider,{value:s},e)}const Jv="version",od=fr({version:"1.18.2",changeVersion:()=>{},changeTargetVersion:()=>{}});function _r(){return pr(od)}function Gv({children:e}){const[t,n]=Y(pt.getVersion()),[i,r]=Jr(Jv);me(()=>{G0.includes(i)&&t!==i&&n(i)},[t,i]);const s=mt((a,l=!0,u=!1)=>{(u||i)&&r(a,!0),l&&(it.setVersion(a),pt.setVersion(a)),n(a)},[i]),o={version:t,changeVersion:s,changeTargetVersion:r};return w(od.Provider,{value:o},e)}/*! pako 2.0.4 https://github.com/nodeca/pako @license (MIT AND Zlib) */const Yv=4,yc=0,wc=1,Wv=2;function vr(e){let t=e.length;for(;--t>=0;)e[t]=0}const Zv=0,ad=1,Kv=2,qv=3,Qv=258,Gl=29,bs=256,Gr=bs+1+Gl,Zi=30,Yl=19,ld=2*Gr+1,fi=15,ra=16,ex=7,Wl=256,ud=16,cd=17,hd=18,qa=new Uint8Array([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]),Gs=new Uint8Array([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]),tx=new Uint8Array([0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,3,7]),fd=new Uint8Array([16,17,18,0,8,7,9,6,10,5,11,4,12,3,13,2,14,1,15]),nx=512,Fn=new Array((Gr+2)*2);vr(Fn);const Lr=new Array(Zi*2);vr(Lr);const Yr=new Array(nx);vr(Yr);const Wr=new Array(Qv-qv+1);vr(Wr);const Zl=new Array(Gl);vr(Zl);const fo=new Array(Zi);vr(fo);function sa(e,t,n,i,r){this.static_tree=e,this.extra_bits=t,this.extra_base=n,this.elems=i,this.max_length=r,this.has_stree=e&&e.length}let dd,pd,md;function oa(e,t){this.dyn_tree=e,this.max_code=0,this.stat_desc=t}const gd=e=>e<256?Yr[e]:Yr[256+(e>>>7)],Zr=(e,t)=>{e.pending_buf[e.pending++]=t&255,e.pending_buf[e.pending++]=t>>>8&255},Nt=(e,t,n)=>{e.bi_valid>ra-n?(e.bi_buf|=t<>ra-e.bi_valid,e.bi_valid+=n-ra):(e.bi_buf|=t<{Nt(e,n[t*2],n[t*2+1])},_d=(e,t)=>{let n=0;do n|=e&1,e>>>=1,n<<=1;while(--t>0);return n>>>1},ix=e=>{e.bi_valid===16?(Zr(e,e.bi_buf),e.bi_buf=0,e.bi_valid=0):e.bi_valid>=8&&(e.pending_buf[e.pending++]=e.bi_buf&255,e.bi_buf>>=8,e.bi_valid-=8)},rx=(e,t)=>{const n=t.dyn_tree,i=t.max_code,r=t.stat_desc.static_tree,s=t.stat_desc.has_stree,o=t.stat_desc.extra_bits,a=t.stat_desc.extra_base,l=t.stat_desc.max_length;let u,c,p,f,d,_,h=0;for(f=0;f<=fi;f++)e.bl_count[f]=0;for(n[e.heap[e.heap_max]*2+1]=0,u=e.heap_max+1;ul&&(f=l,h++),n[c*2+1]=f,!(c>i)&&(e.bl_count[f]++,d=0,c>=a&&(d=o[c-a]),_=n[c*2],e.opt_len+=_*(f+d),s&&(e.static_len+=_*(r[c*2+1]+d)));if(h!==0){do{for(f=l-1;e.bl_count[f]===0;)f--;e.bl_count[f]--,e.bl_count[f+1]+=2,e.bl_count[l]--,h-=2}while(h>0);for(f=l;f!==0;f--)for(c=e.bl_count[f];c!==0;)p=e.heap[--u],!(p>i)&&(n[p*2+1]!==f&&(e.opt_len+=(f-n[p*2+1])*n[p*2],n[p*2+1]=f),c--)}},vd=(e,t,n)=>{const i=new Array(fi+1);let r=0,s,o;for(s=1;s<=fi;s++)i[s]=r=r+n[s-1]<<1;for(o=0;o<=t;o++){let a=e[o*2+1];a!==0&&(e[o*2]=_d(i[a]++,a))}},sx=()=>{let e,t,n,i,r;const s=new Array(fi+1);for(n=0,i=0;i>=7;i{let t;for(t=0;t{e.bi_valid>8?Zr(e,e.bi_buf):e.bi_valid>0&&(e.pending_buf[e.pending++]=e.bi_buf),e.bi_buf=0,e.bi_valid=0},ox=(e,t,n,i)=>{yd(e),i&&(Zr(e,n),Zr(e,~n)),e.pending_buf.set(e.window.subarray(t,t+n),e.pending),e.pending+=n},Ec=(e,t,n,i)=>{const r=t*2,s=n*2;return e[r]{const i=e.heap[n];let r=n<<1;for(;r<=e.heap_len&&(r{let i,r,s=0,o,a;if(e.last_lit!==0)do i=e.pending_buf[e.d_buf+s*2]<<8|e.pending_buf[e.d_buf+s*2+1],r=e.pending_buf[e.l_buf+s],s++,i===0?hn(e,r,t):(o=Wr[r],hn(e,o+bs+1,t),a=qa[o],a!==0&&(r-=Zl[o],Nt(e,r,a)),i--,o=gd(i),hn(e,o,n),a=Gs[o],a!==0&&(i-=fo[o],Nt(e,i,a)));while(s{const n=t.dyn_tree,i=t.stat_desc.static_tree,r=t.stat_desc.has_stree,s=t.stat_desc.elems;let o,a,l=-1,u;for(e.heap_len=0,e.heap_max=ld,o=0;o>1;o>=1;o--)aa(e,n,o);u=s;do o=e.heap[1],e.heap[1]=e.heap[e.heap_len--],aa(e,n,1),a=e.heap[1],e.heap[--e.heap_max]=o,e.heap[--e.heap_max]=a,n[u*2]=n[o*2]+n[a*2],e.depth[u]=(e.depth[o]>=e.depth[a]?e.depth[o]:e.depth[a])+1,n[o*2+1]=n[a*2+1]=u,e.heap[1]=u++,aa(e,n,1);while(e.heap_len>=2);e.heap[--e.heap_max]=e.heap[1],rx(e,t),vd(n,l,e.bl_count)},Ac=(e,t,n)=>{let i,r=-1,s,o=t[0*2+1],a=0,l=7,u=4;for(o===0&&(l=138,u=3),t[(n+1)*2+1]=65535,i=0;i<=n;i++)s=o,o=t[(i+1)*2+1],!(++a{let i,r=-1,s,o=t[0*2+1],a=0,l=7,u=4;for(o===0&&(l=138,u=3),i=0;i<=n;i++)if(s=o,o=t[(i+1)*2+1],!(++a{let t;for(Ac(e,e.dyn_ltree,e.l_desc.max_code),Ac(e,e.dyn_dtree,e.d_desc.max_code),Qa(e,e.bl_desc),t=Yl-1;t>=3&&e.bl_tree[fd[t]*2+1]===0;t--);return e.opt_len+=3*(t+1)+5+5+4,t},lx=(e,t,n,i)=>{let r;for(Nt(e,t-257,5),Nt(e,n-1,5),Nt(e,i-4,4),r=0;r{let t=4093624447,n;for(n=0;n<=31;n++,t>>>=1)if(t&1&&e.dyn_ltree[n*2]!==0)return yc;if(e.dyn_ltree[9*2]!==0||e.dyn_ltree[10*2]!==0||e.dyn_ltree[13*2]!==0)return wc;for(n=32;n{Dc||(sx(),Dc=!0),e.l_desc=new oa(e.dyn_ltree,dd),e.d_desc=new oa(e.dyn_dtree,pd),e.bl_desc=new oa(e.bl_tree,md),e.bi_buf=0,e.bi_valid=0,xd(e)},wd=(e,t,n,i)=>{Nt(e,(Zv<<1)+(i?1:0),3),ox(e,t,n,!0)},hx=e=>{Nt(e,ad<<1,3),hn(e,Wl,Fn),ix(e)},fx=(e,t,n,i)=>{let r,s,o=0;e.level>0?(e.strm.data_type===Wv&&(e.strm.data_type=ux(e)),Qa(e,e.l_desc),Qa(e,e.d_desc),o=ax(e),r=e.opt_len+3+7>>>3,s=e.static_len+3+7>>>3,s<=r&&(r=s)):r=s=n+5,n+4<=r&&t!==-1?wd(e,t,n,i):e.strategy===Yv||s===r?(Nt(e,(ad<<1)+(i?1:0),3),bc(e,Fn,Lr)):(Nt(e,(Kv<<1)+(i?1:0),3),lx(e,e.l_desc.max_code+1,e.d_desc.max_code+1,o+1),bc(e,e.dyn_ltree,e.dyn_dtree)),xd(e),i&&yd(e)},dx=(e,t,n)=>(e.pending_buf[e.d_buf+e.last_lit*2]=t>>>8&255,e.pending_buf[e.d_buf+e.last_lit*2+1]=t&255,e.pending_buf[e.l_buf+e.last_lit]=n&255,e.last_lit++,t===0?e.dyn_ltree[n*2]++:(e.matches++,t--,e.dyn_ltree[(Wr[n]+bs+1)*2]++,e.dyn_dtree[gd(t)*2]++),e.last_lit===e.lit_bufsize-1);var px=cx,mx=wd,gx=fx,_x=dx,vx=hx,xx={_tr_init:px,_tr_stored_block:mx,_tr_flush_block:gx,_tr_tally:_x,_tr_align:vx};const yx=(e,t,n,i)=>{let r=e&65535|0,s=e>>>16&65535|0,o=0;for(;n!==0;){o=n>2e3?2e3:n,n-=o;do r=r+t[i++]|0,s=s+r|0;while(--o);r%=65521,s%=65521}return r|s<<16|0};var Kr=yx;const wx=()=>{let e,t=[];for(var n=0;n<256;n++){e=n;for(var i=0;i<8;i++)e=e&1?3988292384^e>>>1:e>>>1;t[n]=e}return t},Ex=new Uint32Array(wx()),bx=(e,t,n,i)=>{const r=Ex,s=i+n;e^=-1;for(let o=i;o>>8^r[(e^t[o])&255];return e^-1};var ft=bx,qr={2:"need dictionary",1:"stream end",0:"","-1":"file error","-2":"stream error","-3":"data error","-4":"insufficient memory","-5":"buffer error","-6":"incompatible version"},Lo={Z_NO_FLUSH:0,Z_PARTIAL_FLUSH:1,Z_SYNC_FLUSH:2,Z_FULL_FLUSH:3,Z_FINISH:4,Z_BLOCK:5,Z_TREES:6,Z_OK:0,Z_STREAM_END:1,Z_NEED_DICT:2,Z_ERRNO:-1,Z_STREAM_ERROR:-2,Z_DATA_ERROR:-3,Z_MEM_ERROR:-4,Z_BUF_ERROR:-5,Z_NO_COMPRESSION:0,Z_BEST_SPEED:1,Z_BEST_COMPRESSION:9,Z_DEFAULT_COMPRESSION:-1,Z_FILTERED:1,Z_HUFFMAN_ONLY:2,Z_RLE:3,Z_FIXED:4,Z_DEFAULT_STRATEGY:0,Z_BINARY:0,Z_TEXT:1,Z_UNKNOWN:2,Z_DEFLATED:8};const{_tr_init:Ax,_tr_stored_block:Sx,_tr_flush_block:Dx,_tr_tally:Qn,_tr_align:Cx}=xx,{Z_NO_FLUSH:ki,Z_PARTIAL_FLUSH:kx,Z_FULL_FLUSH:Fx,Z_FINISH:ei,Z_BLOCK:Cc,Z_OK:fn,Z_STREAM_END:kc,Z_STREAM_ERROR:Gt,Z_DATA_ERROR:Ix,Z_BUF_ERROR:la,Z_DEFAULT_COMPRESSION:Tx,Z_FILTERED:Bx,Z_HUFFMAN_ONLY:Fs,Z_RLE:Nx,Z_FIXED:Mx,Z_DEFAULT_STRATEGY:Ox,Z_UNKNOWN:Lx,Z_DEFLATED:Ro}=Lo,Rx=9,Px=15,$x=8,zx=29,Ux=256,el=Ux+1+zx,jx=30,Hx=19,Vx=2*el+1,Xx=15,ke=3,Yn=258,rn=Yn+ke+1,Jx=32,Po=42,tl=69,Ys=73,Ws=91,Zs=103,di=113,Cr=666,ht=1,As=2,Ei=3,xr=4,Gx=3,Wn=(e,t)=>(e.msg=qr[t],t),Fc=e=>(e<<1)-(e>4?9:0),Jn=e=>{let t=e.length;for(;--t>=0;)e[t]=0};let Yx=(e,t,n)=>(t<{const t=e.state;let n=t.pending;n>e.avail_out&&(n=e.avail_out),n!==0&&(e.output.set(t.pending_buf.subarray(t.pending_out,t.pending_out+n),e.next_out),e.next_out+=n,t.pending_out+=n,e.total_out+=n,e.avail_out-=n,t.pending-=n,t.pending===0&&(t.pending_out=0))},Et=(e,t)=>{Dx(e,e.block_start>=0?e.block_start:-1,e.strstart-e.block_start,t),e.block_start=e.strstart,Hn(e.strm)},Te=(e,t)=>{e.pending_buf[e.pending++]=t},Er=(e,t)=>{e.pending_buf[e.pending++]=t>>>8&255,e.pending_buf[e.pending++]=t&255},Wx=(e,t,n,i)=>{let r=e.avail_in;return r>i&&(r=i),r===0?0:(e.avail_in-=r,t.set(e.input.subarray(e.next_in,e.next_in+r),n),e.state.wrap===1?e.adler=Kr(e.adler,t,r,n):e.state.wrap===2&&(e.adler=ft(e.adler,t,r,n)),e.next_in+=r,e.total_in+=r,r)},Ed=(e,t)=>{let n=e.max_chain_length,i=e.strstart,r,s,o=e.prev_length,a=e.nice_match;const l=e.strstart>e.w_size-rn?e.strstart-(e.w_size-rn):0,u=e.window,c=e.w_mask,p=e.prev,f=e.strstart+Yn;let d=u[i+o-1],_=u[i+o];e.prev_length>=e.good_match&&(n>>=2),a>e.lookahead&&(a=e.lookahead);do if(r=t,!(u[r+o]!==_||u[r+o-1]!==d||u[r]!==u[i]||u[++r]!==u[i+1])){i+=2,r++;do;while(u[++i]===u[++r]&&u[++i]===u[++r]&&u[++i]===u[++r]&&u[++i]===u[++r]&&u[++i]===u[++r]&&u[++i]===u[++r]&&u[++i]===u[++r]&&u[++i]===u[++r]&&io){if(e.match_start=t,o=s,s>=a)break;d=u[i+o-1],_=u[i+o]}}while((t=p[t&c])>l&&--n!==0);return o<=e.lookahead?o:e.lookahead},bi=e=>{const t=e.w_size;let n,i,r,s,o;do{if(s=e.window_size-e.lookahead-e.strstart,e.strstart>=t+(t-rn)){e.window.set(e.window.subarray(t,t+t),0),e.match_start-=t,e.strstart-=t,e.block_start-=t,i=e.hash_size,n=i;do r=e.head[--n],e.head[n]=r>=t?r-t:0;while(--i);i=t,n=i;do r=e.prev[--n],e.prev[n]=r>=t?r-t:0;while(--i);s+=t}if(e.strm.avail_in===0)break;if(i=Wx(e.strm,e.window,e.strstart+e.lookahead,s),e.lookahead+=i,e.lookahead+e.insert>=ke)for(o=e.strstart-e.insert,e.ins_h=e.window[o],e.ins_h=ti(e,e.ins_h,e.window[o+1]);e.insert&&(e.ins_h=ti(e,e.ins_h,e.window[o+ke-1]),e.prev[o&e.w_mask]=e.head[e.ins_h],e.head[e.ins_h]=o,o++,e.insert--,!(e.lookahead+e.insert{let n=65535;for(n>e.pending_buf_size-5&&(n=e.pending_buf_size-5);;){if(e.lookahead<=1){if(bi(e),e.lookahead===0&&t===ki)return ht;if(e.lookahead===0)break}e.strstart+=e.lookahead,e.lookahead=0;const i=e.block_start+n;if((e.strstart===0||e.strstart>=i)&&(e.lookahead=e.strstart-i,e.strstart=i,Et(e,!1),e.strm.avail_out===0)||e.strstart-e.block_start>=e.w_size-rn&&(Et(e,!1),e.strm.avail_out===0))return ht}return e.insert=0,t===ei?(Et(e,!0),e.strm.avail_out===0?Ei:xr):(e.strstart>e.block_start&&(Et(e,!1),e.strm.avail_out===0),ht)},ua=(e,t)=>{let n,i;for(;;){if(e.lookahead=ke&&(e.ins_h=ti(e,e.ins_h,e.window[e.strstart+ke-1]),n=e.prev[e.strstart&e.w_mask]=e.head[e.ins_h],e.head[e.ins_h]=e.strstart),n!==0&&e.strstart-n<=e.w_size-rn&&(e.match_length=Ed(e,n)),e.match_length>=ke)if(i=Qn(e,e.strstart-e.match_start,e.match_length-ke),e.lookahead-=e.match_length,e.match_length<=e.max_lazy_match&&e.lookahead>=ke){e.match_length--;do e.strstart++,e.ins_h=ti(e,e.ins_h,e.window[e.strstart+ke-1]),n=e.prev[e.strstart&e.w_mask]=e.head[e.ins_h],e.head[e.ins_h]=e.strstart;while(--e.match_length!==0);e.strstart++}else e.strstart+=e.match_length,e.match_length=0,e.ins_h=e.window[e.strstart],e.ins_h=ti(e,e.ins_h,e.window[e.strstart+1]);else i=Qn(e,0,e.window[e.strstart]),e.lookahead--,e.strstart++;if(i&&(Et(e,!1),e.strm.avail_out===0))return ht}return e.insert=e.strstart{let n,i,r;for(;;){if(e.lookahead=ke&&(e.ins_h=ti(e,e.ins_h,e.window[e.strstart+ke-1]),n=e.prev[e.strstart&e.w_mask]=e.head[e.ins_h],e.head[e.ins_h]=e.strstart),e.prev_length=e.match_length,e.prev_match=e.match_start,e.match_length=ke-1,n!==0&&e.prev_length4096)&&(e.match_length=ke-1)),e.prev_length>=ke&&e.match_length<=e.prev_length){r=e.strstart+e.lookahead-ke,i=Qn(e,e.strstart-1-e.prev_match,e.prev_length-ke),e.lookahead-=e.prev_length-1,e.prev_length-=2;do++e.strstart<=r&&(e.ins_h=ti(e,e.ins_h,e.window[e.strstart+ke-1]),n=e.prev[e.strstart&e.w_mask]=e.head[e.ins_h],e.head[e.ins_h]=e.strstart);while(--e.prev_length!==0);if(e.match_available=0,e.match_length=ke-1,e.strstart++,i&&(Et(e,!1),e.strm.avail_out===0))return ht}else if(e.match_available){if(i=Qn(e,0,e.window[e.strstart-1]),i&&Et(e,!1),e.strstart++,e.lookahead--,e.strm.avail_out===0)return ht}else e.match_available=1,e.strstart++,e.lookahead--}return e.match_available&&(i=Qn(e,0,e.window[e.strstart-1]),e.match_available=0),e.insert=e.strstart{let n,i,r,s;const o=e.window;for(;;){if(e.lookahead<=Yn){if(bi(e),e.lookahead<=Yn&&t===ki)return ht;if(e.lookahead===0)break}if(e.match_length=0,e.lookahead>=ke&&e.strstart>0&&(r=e.strstart-1,i=o[r],i===o[++r]&&i===o[++r]&&i===o[++r])){s=e.strstart+Yn;do;while(i===o[++r]&&i===o[++r]&&i===o[++r]&&i===o[++r]&&i===o[++r]&&i===o[++r]&&i===o[++r]&&i===o[++r]&&re.lookahead&&(e.match_length=e.lookahead)}if(e.match_length>=ke?(n=Qn(e,1,e.match_length-ke),e.lookahead-=e.match_length,e.strstart+=e.match_length,e.match_length=0):(n=Qn(e,0,e.window[e.strstart]),e.lookahead--,e.strstart++),n&&(Et(e,!1),e.strm.avail_out===0))return ht}return e.insert=0,t===ei?(Et(e,!0),e.strm.avail_out===0?Ei:xr):e.last_lit&&(Et(e,!1),e.strm.avail_out===0)?ht:As},qx=(e,t)=>{let n;for(;;){if(e.lookahead===0&&(bi(e),e.lookahead===0)){if(t===ki)return ht;break}if(e.match_length=0,n=Qn(e,0,e.window[e.strstart]),e.lookahead--,e.strstart++,n&&(Et(e,!1),e.strm.avail_out===0))return ht}return e.insert=0,t===ei?(Et(e,!0),e.strm.avail_out===0?Ei:xr):e.last_lit&&(Et(e,!1),e.strm.avail_out===0)?ht:As};function ln(e,t,n,i,r){this.good_length=e,this.max_lazy=t,this.nice_length=n,this.max_chain=i,this.func=r}const kr=[new ln(0,0,0,0,Zx),new ln(4,4,8,4,ua),new ln(4,5,16,8,ua),new ln(4,6,32,32,ua),new ln(4,4,16,16,Ni),new ln(8,16,32,32,Ni),new ln(8,16,128,128,Ni),new ln(8,32,128,256,Ni),new ln(32,128,258,1024,Ni),new ln(32,258,258,4096,Ni)],Qx=e=>{e.window_size=2*e.w_size,Jn(e.head),e.max_lazy_match=kr[e.level].max_lazy,e.good_match=kr[e.level].good_length,e.nice_match=kr[e.level].nice_length,e.max_chain_length=kr[e.level].max_chain,e.strstart=0,e.block_start=0,e.lookahead=0,e.insert=0,e.match_length=e.prev_length=ke-1,e.match_available=0,e.ins_h=0};function ey(){this.strm=null,this.status=0,this.pending_buf=null,this.pending_buf_size=0,this.pending_out=0,this.pending=0,this.wrap=0,this.gzhead=null,this.gzindex=0,this.method=Ro,this.last_flush=-1,this.w_size=0,this.w_bits=0,this.w_mask=0,this.window=null,this.window_size=0,this.prev=null,this.head=null,this.ins_h=0,this.hash_size=0,this.hash_bits=0,this.hash_mask=0,this.hash_shift=0,this.block_start=0,this.match_length=0,this.prev_match=0,this.match_available=0,this.strstart=0,this.match_start=0,this.lookahead=0,this.prev_length=0,this.max_chain_length=0,this.max_lazy_match=0,this.level=0,this.strategy=0,this.good_match=0,this.nice_match=0,this.dyn_ltree=new Uint16Array(Vx*2),this.dyn_dtree=new Uint16Array((2*jx+1)*2),this.bl_tree=new Uint16Array((2*Hx+1)*2),Jn(this.dyn_ltree),Jn(this.dyn_dtree),Jn(this.bl_tree),this.l_desc=null,this.d_desc=null,this.bl_desc=null,this.bl_count=new Uint16Array(Xx+1),this.heap=new Uint16Array(2*el+1),Jn(this.heap),this.heap_len=0,this.heap_max=0,this.depth=new Uint16Array(2*el+1),Jn(this.depth),this.l_buf=0,this.lit_bufsize=0,this.last_lit=0,this.d_buf=0,this.opt_len=0,this.static_len=0,this.matches=0,this.insert=0,this.bi_buf=0,this.bi_valid=0}const bd=e=>{if(!e||!e.state)return Wn(e,Gt);e.total_in=e.total_out=0,e.data_type=Lx;const t=e.state;return t.pending=0,t.pending_out=0,t.wrap<0&&(t.wrap=-t.wrap),t.status=t.wrap?Po:di,e.adler=t.wrap===2?0:1,t.last_flush=ki,Ax(t),fn},Ad=e=>{const t=bd(e);return t===fn&&Qx(e.state),t},ty=(e,t)=>!e||!e.state||e.state.wrap!==2?Gt:(e.state.gzhead=t,fn),Sd=(e,t,n,i,r,s)=>{if(!e)return Gt;let o=1;if(t===Tx&&(t=6),i<0?(o=0,i=-i):i>15&&(o=2,i-=16),r<1||r>Rx||n!==Ro||i<8||i>15||t<0||t>9||s<0||s>Mx)return Wn(e,Gt);i===8&&(i=9);const a=new ey;return e.state=a,a.strm=e,a.wrap=o,a.gzhead=null,a.w_bits=i,a.w_size=1<Sd(e,t,Ro,Px,$x,Ox),iy=(e,t)=>{let n,i;if(!e||!e.state||t>Cc||t<0)return e?Wn(e,Gt):Gt;const r=e.state;if(!e.output||!e.input&&e.avail_in!==0||r.status===Cr&&t!==ei)return Wn(e,e.avail_out===0?la:Gt);r.strm=e;const s=r.last_flush;if(r.last_flush=t,r.status===Po)if(r.wrap===2)e.adler=0,Te(r,31),Te(r,139),Te(r,8),r.gzhead?(Te(r,(r.gzhead.text?1:0)+(r.gzhead.hcrc?2:0)+(r.gzhead.extra?4:0)+(r.gzhead.name?8:0)+(r.gzhead.comment?16:0)),Te(r,r.gzhead.time&255),Te(r,r.gzhead.time>>8&255),Te(r,r.gzhead.time>>16&255),Te(r,r.gzhead.time>>24&255),Te(r,r.level===9?2:r.strategy>=Fs||r.level<2?4:0),Te(r,r.gzhead.os&255),r.gzhead.extra&&r.gzhead.extra.length&&(Te(r,r.gzhead.extra.length&255),Te(r,r.gzhead.extra.length>>8&255)),r.gzhead.hcrc&&(e.adler=ft(e.adler,r.pending_buf,r.pending,0)),r.gzindex=0,r.status=tl):(Te(r,0),Te(r,0),Te(r,0),Te(r,0),Te(r,0),Te(r,r.level===9?2:r.strategy>=Fs||r.level<2?4:0),Te(r,Gx),r.status=di);else{let o=Ro+(r.w_bits-8<<4)<<8,a=-1;r.strategy>=Fs||r.level<2?a=0:r.level<6?a=1:r.level===6?a=2:a=3,o|=a<<6,r.strstart!==0&&(o|=Jx),o+=31-o%31,r.status=di,Er(r,o),r.strstart!==0&&(Er(r,e.adler>>>16),Er(r,e.adler&65535)),e.adler=1}if(r.status===tl)if(r.gzhead.extra){for(n=r.pending;r.gzindex<(r.gzhead.extra.length&65535)&&!(r.pending===r.pending_buf_size&&(r.gzhead.hcrc&&r.pending>n&&(e.adler=ft(e.adler,r.pending_buf,r.pending-n,n)),Hn(e),n=r.pending,r.pending===r.pending_buf_size));)Te(r,r.gzhead.extra[r.gzindex]&255),r.gzindex++;r.gzhead.hcrc&&r.pending>n&&(e.adler=ft(e.adler,r.pending_buf,r.pending-n,n)),r.gzindex===r.gzhead.extra.length&&(r.gzindex=0,r.status=Ys)}else r.status=Ys;if(r.status===Ys)if(r.gzhead.name){n=r.pending;do{if(r.pending===r.pending_buf_size&&(r.gzhead.hcrc&&r.pending>n&&(e.adler=ft(e.adler,r.pending_buf,r.pending-n,n)),Hn(e),n=r.pending,r.pending===r.pending_buf_size)){i=1;break}r.gzindexn&&(e.adler=ft(e.adler,r.pending_buf,r.pending-n,n)),i===0&&(r.gzindex=0,r.status=Ws)}else r.status=Ws;if(r.status===Ws)if(r.gzhead.comment){n=r.pending;do{if(r.pending===r.pending_buf_size&&(r.gzhead.hcrc&&r.pending>n&&(e.adler=ft(e.adler,r.pending_buf,r.pending-n,n)),Hn(e),n=r.pending,r.pending===r.pending_buf_size)){i=1;break}r.gzindexn&&(e.adler=ft(e.adler,r.pending_buf,r.pending-n,n)),i===0&&(r.status=Zs)}else r.status=Zs;if(r.status===Zs&&(r.gzhead.hcrc?(r.pending+2>r.pending_buf_size&&Hn(e),r.pending+2<=r.pending_buf_size&&(Te(r,e.adler&255),Te(r,e.adler>>8&255),e.adler=0,r.status=di)):r.status=di),r.pending!==0){if(Hn(e),e.avail_out===0)return r.last_flush=-1,fn}else if(e.avail_in===0&&Fc(t)<=Fc(s)&&t!==ei)return Wn(e,la);if(r.status===Cr&&e.avail_in!==0)return Wn(e,la);if(e.avail_in!==0||r.lookahead!==0||t!==ki&&r.status!==Cr){let o=r.strategy===Fs?qx(r,t):r.strategy===Nx?Kx(r,t):kr[r.level].func(r,t);if((o===Ei||o===xr)&&(r.status=Cr),o===ht||o===Ei)return e.avail_out===0&&(r.last_flush=-1),fn;if(o===As&&(t===kx?Cx(r):t!==Cc&&(Sx(r,0,0,!1),t===Fx&&(Jn(r.head),r.lookahead===0&&(r.strstart=0,r.block_start=0,r.insert=0))),Hn(e),e.avail_out===0))return r.last_flush=-1,fn}return t!==ei?fn:r.wrap<=0?kc:(r.wrap===2?(Te(r,e.adler&255),Te(r,e.adler>>8&255),Te(r,e.adler>>16&255),Te(r,e.adler>>24&255),Te(r,e.total_in&255),Te(r,e.total_in>>8&255),Te(r,e.total_in>>16&255),Te(r,e.total_in>>24&255)):(Er(r,e.adler>>>16),Er(r,e.adler&65535)),Hn(e),r.wrap>0&&(r.wrap=-r.wrap),r.pending!==0?fn:kc)},ry=e=>{if(!e||!e.state)return Gt;const t=e.state.status;return t!==Po&&t!==tl&&t!==Ys&&t!==Ws&&t!==Zs&&t!==di&&t!==Cr?Wn(e,Gt):(e.state=null,t===di?Wn(e,Ix):fn)},sy=(e,t)=>{let n=t.length;if(!e||!e.state)return Gt;const i=e.state,r=i.wrap;if(r===2||r===1&&i.status!==Po||i.lookahead)return Gt;if(r===1&&(e.adler=Kr(e.adler,t,n,0)),i.wrap=0,n>=i.w_size){r===0&&(Jn(i.head),i.strstart=0,i.block_start=0,i.insert=0);let l=new Uint8Array(i.w_size);l.set(t.subarray(n-i.w_size,n),0),t=l,n=i.w_size}const s=e.avail_in,o=e.next_in,a=e.input;for(e.avail_in=n,e.next_in=0,e.input=t,bi(i);i.lookahead>=ke;){let l=i.strstart,u=i.lookahead-(ke-1);do i.ins_h=ti(i,i.ins_h,i.window[l+ke-1]),i.prev[l&i.w_mask]=i.head[i.ins_h],i.head[i.ins_h]=l,l++;while(--u);i.strstart=l,i.lookahead=ke-1,bi(i)}return i.strstart+=i.lookahead,i.block_start=i.strstart,i.insert=i.lookahead,i.lookahead=0,i.match_length=i.prev_length=ke-1,i.match_available=0,e.next_in=o,e.input=a,e.avail_in=s,i.wrap=r,fn};var oy=ny,ay=Sd,ly=Ad,uy=bd,cy=ty,hy=iy,fy=ry,dy=sy,py="pako deflate (from Nodeca project)",Rr={deflateInit:oy,deflateInit2:ay,deflateReset:ly,deflateResetKeep:uy,deflateSetHeader:cy,deflate:hy,deflateEnd:fy,deflateSetDictionary:dy,deflateInfo:py};const my=(e,t)=>Object.prototype.hasOwnProperty.call(e,t);var gy=function(e){const t=Array.prototype.slice.call(arguments,1);for(;t.length;){const n=t.shift();if(!!n){if(typeof n!="object")throw new TypeError(n+"must be non-object");for(const i in n)my(n,i)&&(e[i]=n[i])}}return e},_y=e=>{let t=0;for(let i=0,r=e.length;i=252?6:e>=248?5:e>=240?4:e>=224?3:e>=192?2:1;Qr[254]=Qr[254]=1;var vy=e=>{if(typeof TextEncoder=="function"&&TextEncoder.prototype.encode)return new TextEncoder().encode(e);let t,n,i,r,s,o=e.length,a=0;for(r=0;r>>6,t[s++]=128|n&63):n<65536?(t[s++]=224|n>>>12,t[s++]=128|n>>>6&63,t[s++]=128|n&63):(t[s++]=240|n>>>18,t[s++]=128|n>>>12&63,t[s++]=128|n>>>6&63,t[s++]=128|n&63);return t};const xy=(e,t)=>{if(t<65534&&e.subarray&&Dd)return String.fromCharCode.apply(null,e.length===t?e:e.subarray(0,t));let n="";for(let i=0;i{const n=t||e.length;if(typeof TextDecoder=="function"&&TextDecoder.prototype.decode)return new TextDecoder().decode(e.subarray(0,t));let i,r;const s=new Array(n*2);for(r=0,i=0;i4){s[r++]=65533,i+=a-1;continue}for(o&=a===2?31:a===3?15:7;a>1&&i