npm - infinity-forge - Versions diffs - 9.7.7 → 9.7.8 - Mend

infinity-forge 9.7.7 → 9.7.8

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.

Files changed (2776) hide show

package/dist/node_modules/.pnpm/pako@1.0.11/node_modules/pako/lib/zlib/inflate.js ADDED Viewed

	@@ -0,0 +1,2 @@
1	+ "use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const T=require("../../../../../../../_virtual/inflate.js"),je=require("../utils/common.js"),We=require("./adler32.js"),ye=require("./crc32.js"),Je=require("./inffast.js"),Qe=require("./inftrees.js");var Ce;function Ve(){if(Ce)return T.__exports;Ce=1;var _=je.__require(),G=We.__require(),R=ye.__require(),Oe=Je.__require(),O=Qe.__require(),me=0,U=1,$=2,j=4,ze=5,m=6,C=0,Le=1,Ae=2,E=-2,W=-3,y=-4,Me=-5,J=8,Q=1,V=2,ee=3,ae=4,ie=5,fe=6,te=7,ne=8,re=9,le=10,z=11,I=12,F=13,oe=14,K=15,de=16,he=17,se=18,ce=19,L=20,A=21,ve=22,be=23,ke=24,xe=25,ue=26,P=27,we=28,_e=29,h=30,ge=31,qe=32,Ze=852,He=592,Ge=15,Fe=Ge;function Ee(a){return(a>>>24&255)+(a>>>8&65280)+((a&65280)<<8)+((a&255)<<24)}function Ke(){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 _.Buf16(320),this.work=new _.Buf16(288),this.lendyn=null,this.distdyn=null,this.sane=0,this.back=0,this.was=0}function pe(a){var n;return!a\|\|!a.state?E:(n=a.state,a.total_in=a.total_out=n.total=0,a.msg="",n.wrap&&(a.adler=n.wrap&1),n.mode=Q,n.last=0,n.havedict=0,n.dmax=32768,n.head=null,n.hold=0,n.bits=0,n.lencode=n.lendyn=new _.Buf32(Ze),n.distcode=n.distdyn=new _.Buf32(He),n.sane=1,n.back=-1,C)}function Se(a){var n;return!a\|\|!a.state?E:(n=a.state,n.wsize=0,n.whave=0,n.wnext=0,pe(a))}function Te(a,n){var e,l;return!a\|\|!a.state\|\|(l=a.state,n<0?(e=0,n=-n):(e=(n>>4)+1,n<48&&(n&=15)),n&&(n<8\|\|n>15))?E:(l.window!==null&&l.wbits!==n&&(l.window=null),l.wrap=e,l.wbits=n,Se(a))}function Re(a,n){var e,l;return a?(l=new Ke,a.state=l,l.window=null,e=Te(a,n),e!==C&&(a.state=null),e):E}function Pe(a){return Re(a,Fe)}var De=!0,X,Y;function Xe(a){if(De){var n;for(X=new _.Buf32(512),Y=new _.Buf32(32),n=0;n<144;)a.lens[n++]=8;for(;n<256;)a.lens[n++]=9;for(;n<280;)a.lens[n++]=7;for(;n<288;)a.lens[n++]=8;for(O(U,a.lens,0,288,X,0,a.work,{bits:9}),n=0;n<32;)a.lens[n++]=5;O($,a.lens,0,32,Y,0,a.work,{bits:5}),De=!1}a.lencode=X,a.lenbits=9,a.distcode=Y,a.distbits=5}function Ie(a,n,e,l){var s,t=a.state;return t.window===null&&(t.wsize=1<<t.wbits,t.wnext=0,t.whave=0,t.window=new _.Buf8(t.wsize)),l>=t.wsize?(_.arraySet(t.window,n,e-t.wsize,t.wsize,0),t.wnext=0,t.whave=t.wsize):(s=t.wsize-t.wnext,s>l&&(s=l),_.arraySet(t.window,n,e-l,s,t.wnext),l-=s,l?(_.arraySet(t.window,n,e-l,l,0),t.wnext=l,t.whave=t.wsize):(t.wnext+=s,t.wnext===t.wsize&&(t.wnext=0),t.whave<t.wsize&&(t.whave+=s))),0}function Ye(a,n){var e,l,s,t,p,r,k,f,i,M,c,o,q,B,v=0,d,u,g,w,Z,H,b,S,x=new _.Buf8(4),N,D,Ne=[16,17,18,0,8,7,9,6,10,5,11,4,12,3,13,2,14,1,15];if(!a\|\|!a.state\|\|!a.output\|\|!a.input&&a.avail_in!==0)return E;e=a.state,e.mode===I&&(e.mode=F),p=a.next_out,s=a.output,k=a.avail_out,t=a.next_in,l=a.input,r=a.avail_in,f=e.hold,i=e.bits,M=r,c=k,S=C;e:for(;;)switch(e.mode){case Q:if(e.wrap===0){e.mode=F;break}for(;i<16;){if(r===0)break e;r--,f+=l[t++]<<i,i+=8}if(e.wrap&2&&f===35615){e.check=0,x[0]=f&255,x[1]=f>>>8&255,e.check=R(e.check,x,2,0),f=0,i=0,e.mode=V;break}if(e.flags=0,e.head&&(e.head.done=!1),!(e.wrap&1)\|\|(((f&255)<<8)+(f>>8))%31){a.msg="incorrect header check",e.mode=h;break}if((f&15)!==J){a.msg="unknown compression method",e.mode=h;break}if(f>>>=4,i-=4,b=(f&15)+8,e.wbits===0)e.wbits=b;else if(b>e.wbits){a.msg="invalid window size",e.mode=h;break}e.dmax=1<<b,a.adler=e.check=1,e.mode=f&512?le:I,f=0,i=0;break;case V:for(;i<16;){if(r===0)break e;r--,f+=l[t++]<<i,i+=8}if(e.flags=f,(e.flags&255)!==J){a.msg="unknown compression method",e.mode=h;break}if(e.flags&57344){a.msg="unknown header flags set",e.mode=h;break}e.head&&(e.head.text=f>>8&1),e.flags&512&&(x[0]=f&255,x[1]=f>>>8&255,e.check=R(e.check,x,2,0)),f=0,i=0,e.mode=ee;case ee:for(;i<32;){if(r===0)break e;r--,f+=l[t++]<<i,i+=8}e.head&&(e.head.time=f),e.flags&512&&(x[0]=f&255,x[1]=f>>>8&255,x[2]=f>>>16&255,x[3]=f>>>24&255,e.check=R(e.check,x,4,0)),f=0,i=0,e.mode=ae;case ae:for(;i<16;){if(r===0)break e;r--,f+=l[t++]<<i,i+=8}e.head&&(e.head.xflags=f&255,e.head.os=f>>8),e.flags&512&&(x[0]=f&255,x[1]=f>>>8&255,e.check=R(e.check,x,2,0)),f=0,i=0,e.mode=ie;case ie:if(e.flags&1024){for(;i<16;){if(r===0)break e;r--,f+=l[t++]<<i,i+=8}e.length=f,e.head&&(e.head.extra_len=f),e.flags&512&&(x[0]=f&255,x[1]=f>>>8&255,e.check=R(e.check,x,2,0)),f=0,i=0}else e.head&&(e.head.extra=null);e.mode=fe;case fe:if(e.flags&1024&&(o=e.length,o>r&&(o=r),o&&(e.head&&(b=e.head.extra_len-e.length,e.head.extra\|\|(e.head.extra=new Array(e.head.extra_len)),_.arraySet(e.head.extra,l,t,o,b)),e.flags&512&&(e.check=R(e.check,l,o,t)),r-=o,t+=o,e.length-=o),e.length))break e;e.length=0,e.mode=te;case te:if(e.flags&2048){if(r===0)break e;o=0;do b=l[t+o++],e.head&&b&&e.length<65536&&(e.head.name+=String.fromCharCode(b));while(b&&o<r);if(e.flags&512&&(e.check=R(e.check,l,o,t)),r-=o,t+=o,b)break e}else e.head&&(e.head.name=null);e.length=0,e.mode=ne;case ne:if(e.flags&4096){if(r===0)break e;o=0;do b=l[t+o++],e.head&&b&&e.length<65536&&(e.head.comment+=String.fromCharCode(b));while(b&&o<r);if(e.flags&512&&(e.check=R(e.check,l,o,t)),r-=o,t+=o,b)break e}else e.head&&(e.head.comment=null);e.mode=re;case re:if(e.flags&512){for(;i<16;){if(r===0)break e;r--,f+=l[t++]<<i,i+=8}if(f!==(e.check&65535)){a.msg="header crc mismatch",e.mode=h;break}f=0,i=0}e.head&&(e.head.hcrc=e.flags>>9&1,e.head.done=!0),a.adler=e.check=0,e.mode=I;break;case le:for(;i<32;){if(r===0)break e;r--,f+=l[t++]<<i,i+=8}a.adler=e.check=Ee(f),f=0,i=0,e.mode=z;case z:if(e.havedict===0)return a.next_out=p,a.avail_out=k,a.next_in=t,a.avail_in=r,e.hold=f,e.bits=i,Ae;a.adler=e.check=1,e.mode=I;case I:if(n===ze\|\|n===m)break e;case F:if(e.last){f>>>=i&7,i-=i&7,e.mode=P;break}for(;i<3;){if(r===0)break e;r--,f+=l[t++]<<i,i+=8}switch(e.last=f&1,f>>>=1,i-=1,f&3){case 0:e.mode=oe;break;case 1:if(Xe(e),e.mode=L,n===m){f>>>=2,i-=2;break e}break;case 2:e.mode=he;break;case 3:a.msg="invalid block type",e.mode=h}f>>>=2,i-=2;break;case oe:for(f>>>=i&7,i-=i&7;i<32;){if(r===0)break e;r--,f+=l[t++]<<i,i+=8}if((f&65535)!==(f>>>16^65535)){a.msg="invalid stored block lengths",e.mode=h;break}if(e.length=f&65535,f=0,i=0,e.mode=K,n===m)break e;case K:e.mode=de;case de:if(o=e.length,o){if(o>r&&(o=r),o>k&&(o=k),o===0)break e;_.arraySet(s,l,t,o,p),r-=o,t+=o,k-=o,p+=o,e.length-=o;break}e.mode=I;break;case he:for(;i<14;){if(r===0)break e;r--,f+=l[t++]<<i,i+=8}if(e.nlen=(f&31)+257,f>>>=5,i-=5,e.ndist=(f&31)+1,f>>>=5,i-=5,e.ncode=(f&15)+4,f>>>=4,i-=4,e.nlen>286\|\|e.ndist>30){a.msg="too many length or distance symbols",e.mode=h;break}e.have=0,e.mode=se;case se:for(;e.have<e.ncode;){for(;i<3;){if(r===0)break e;r--,f+=l[t++]<<i,i+=8}e.lens[Ne[e.have++]]=f&7,f>>>=3,i-=3}for(;e.have<19;)e.lens[Ne[e.have++]]=0;if(e.lencode=e.lendyn,e.lenbits=7,N={bits:e.lenbits},S=O(me,e.lens,0,19,e.lencode,0,e.work,N),e.lenbits=N.bits,S){a.msg="invalid code lengths set",e.mode=h;break}e.have=0,e.mode=ce;case ce:for(;e.have<e.nlen+e.ndist;){for(;v=e.lencode[f&(1<<e.lenbits)-1],d=v>>>24,u=v>>>16&255,g=v&65535,!(d<=i);){if(r===0)break e;r--,f+=l[t++]<<i,i+=8}if(g<16)f>>>=d,i-=d,e.lens[e.have++]=g;else{if(g===16){for(D=d+2;i<D;){if(r===0)break e;r--,f+=l[t++]<<i,i+=8}if(f>>>=d,i-=d,e.have===0){a.msg="invalid bit length repeat",e.mode=h;break}b=e.lens[e.have-1],o=3+(f&3),f>>>=2,i-=2}else if(g===17){for(D=d+3;i<D;){if(r===0)break e;r--,f+=l[t++]<<i,i+=8}f>>>=d,i-=d,b=0,o=3+(f&7),f>>>=3,i-=3}else{for(D=d+7;i<D;){if(r===0)break e;r--,f+=l[t++]<<i,i+=8}f>>>=d,i-=d,b=0,o=11+(f&127),f>>>=7,i-=7}if(e.have+o>e.nlen+e.ndist){a.msg="invalid bit length repeat",e.mode=h;break}for(;o--;)e.lens[e.have++]=b}}if(e.mode===h)break;if(e.lens[256]===0){a.msg="invalid code -- missing end-of-block",e.mode=h;break}if(e.lenbits=9,N={bits:e.lenbits},S=O(U,e.lens,0,e.nlen,e.lencode,0,e.work,N),e.lenbits=N.bits,S){a.msg="invalid literal/lengths set",e.mode=h;break}if(e.distbits=6,e.distcode=e.distdyn,N={bits:e.distbits},S=O($,e.lens,e.nlen,e.ndist,e.distcode,0,e.work,N),e.distbits=N.bits,S){a.msg="invalid distances set",e.mode=h;break}if(e.mode=L,n===m)break e;case L:e.mode=A;case A:if(r>=6&&k>=258){a.next_out=p,a.avail_out=k,a.next_in=t,a.avail_in=r,e.hold=f,e.bits=i,Oe(a,c),p=a.next_out,s=a.output,k=a.avail_out,t=a.next_in,l=a.input,r=a.avail_in,f=e.hold,i=e.bits,e.mode===I&&(e.back=-1);break}for(e.back=0;v=e.lencode[f&(1<<e.lenbits)-1],d=v>>>24,u=v>>>16&255,g=v&65535,!(d<=i);){if(r===0)break e;r--,f+=l[t++]<<i,i+=8}if(u&&!(u&240)){for(w=d,Z=u,H=g;v=e.lencode[H+((f&(1<<w+Z)-1)>>w)],d=v>>>24,u=v>>>16&255,g=v&65535,!(w+d<=i);){if(r===0)break e;r--,f+=l[t++]<<i,i+=8}f>>>=w,i-=w,e.back+=w}if(f>>>=d,i-=d,e.back+=d,e.length=g,u===0){e.mode=ue;break}if(u&32){e.back=-1,e.mode=I;break}if(u&64){a.msg="invalid literal/length code",e.mode=h;break}e.extra=u&15,e.mode=ve;case ve:if(e.extra){for(D=e.extra;i<D;){if(r===0)break e;r--,f+=l[t++]<<i,i+=8}e.length+=f&(1<<e.extra)-1,f>>>=e.extra,i-=e.extra,e.back+=e.extra}e.was=e.length,e.mode=be;case be:for(;v=e.distcode[f&(1<<e.distbits)-1],d=v>>>24,u=v>>>16&255,g=v&65535,!(d<=i);){if(r===0)break e;r--,f+=l[t++]<<i,i+=8}if(!(u&240)){for(w=d,Z=u,H=g;v=e.distcode[H+((f&(1<<w+Z)-1)>>w)],d=v>>>24,u=v>>>16&255,g=v&65535,!(w+d<=i);){if(r===0)break e;r--,f+=l[t++]<<i,i+=8}f>>>=w,i-=w,e.back+=w}if(f>>>=d,i-=d,e.back+=d,u&64){a.msg="invalid distance code",e.mode=h;break}e.offset=g,e.extra=u&15,e.mode=ke;case ke:if(e.extra){for(D=e.extra;i<D;){if(r===0)break e;r--,f+=l[t++]<<i,i+=8}e.offset+=f&(1<<e.extra)-1,f>>>=e.extra,i-=e.extra,e.back+=e.extra}if(e.offset>e.dmax){a.msg="invalid distance too far back",e.mode=h;break}e.mode=xe;case xe:if(k===0)break e;if(o=c-k,e.offset>o){if(o=e.offset-o,o>e.whave&&e.sane){a.msg="invalid distance too far back",e.mode=h;break}o>e.wnext?(o-=e.wnext,q=e.wsize-o):q=e.wnext-o,o>e.length&&(o=e.length),B=e.window}else B=s,q=p-e.offset,o=e.length;o>k&&(o=k),k-=o,e.length-=o;do s[p++]=B[q++];while(--o);e.length===0&&(e.mode=A);break;case ue:if(k===0)break e;s[p++]=e.length,k--,e.mode=A;break;case P:if(e.wrap){for(;i<32;){if(r===0)break e;r--,f\|=l[t++]<<i,i+=8}if(c-=k,a.total_out+=c,e.total+=c,c&&(a.adler=e.check=e.flags?R(e.check,s,c,p-c):G(e.check,s,c,p-c)),c=k,(e.flags?f:Ee(f))!==e.check){a.msg="incorrect data check",e.mode=h;break}f=0,i=0}e.mode=we;case we:if(e.wrap&&e.flags){for(;i<32;){if(r===0)break e;r--,f+=l[t++]<<i,i+=8}if(f!==(e.total&4294967295)){a.msg="incorrect length check",e.mode=h;break}f=0,i=0}e.mode=_e;case _e:S=Le;break e;case h:S=W;break e;case ge:return y;case qe:default:return E}return a.next_out=p,a.avail_out=k,a.next_in=t,a.avail_in=r,e.hold=f,e.bits=i,(e.wsize\|\|c!==a.avail_out&&e.mode<h&&(e.mode<P\|\|n!==j))&&Ie(a,a.output,a.next_out,c-a.avail_out),M-=a.avail_in,c-=a.avail_out,a.total_in+=M,a.total_out+=c,e.total+=c,e.wrap&&c&&(a.adler=e.check=e.flags?R(e.check,s,c,a.next_out-c):G(e.check,s,c,a.next_out-c)),a.data_type=e.bits+(e.last?64:0)+(e.mode===I?128:0)+(e.mode===L\|\|e.mode===K?256:0),(M===0&&c===0\|\|n===j)&&S===C&&(S=Me),S}function Be(a){if(!a\|\|!a.state)return E;var n=a.state;return n.window&&(n.window=null),a.state=null,C}function Ue(a,n){var e;return!a\|\|!a.state\|\|(e=a.state,!(e.wrap&2))?E:(e.head=n,n.done=!1,C)}function $e(a,n){var e=n.length,l,s,t;return!a\|\|!a.state\|\|(l=a.state,l.wrap!==0&&l.mode!==z)?E:l.mode===z&&(s=1,s=G(s,n,e,0),s!==l.check)?W:(t=Ie(a,n,e,e),t?(l.mode=ge,y):(l.havedict=1,C))}return T.__exports.inflateReset=Se,T.__exports.inflateReset2=Te,T.__exports.inflateResetKeep=pe,T.__exports.inflateInit=Pe,T.__exports.inflateInit2=Re,T.__exports.inflate=Ye,T.__exports.inflateEnd=Be,T.__exports.inflateGetHeader=Ue,T.__exports.inflateSetDictionary=$e,T.__exports.inflateInfo="pako inflate (from Nodeca project)",T.__exports}exports.__require=Ve;
2	+ //# sourceMappingURL=inflate.js.map

package/dist/node_modules/.pnpm/pako@1.0.11/node_modules/pako/lib/zlib/inflate.js.map ADDED Viewed

@@ -0,0 +1 @@

+ {"version":3,"file":"inflate.js","sources":["../../../../../../../../node_modules/.pnpm/pako@1.0.11/node_modules/pako/lib/zlib/inflate.js"],"sourcesContent":["'use strict';\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n// claim that you wrote the original software. If you use this software\n// in a product, an acknowledgment in the product documentation would be\n// appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n// misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nvar utils = require('../utils/common');\nvar adler32 = require('./adler32');\nvar crc32 = require('./crc32');\nvar inflate_fast = require('./inffast');\nvar inflate_table = require('./inftrees');\n\nvar CODES = 0;\nvar LENS = 1;\nvar DISTS = 2;\n\n/* Public constants ==========================================================*/\n/* ===========================================================================*/\n\n\n/* Allowed flush values; see deflate() and inflate() below for details */\n//var Z_NO_FLUSH = 0;\n//var Z_PARTIAL_FLUSH = 1;\n//var Z_SYNC_FLUSH = 2;\n//var Z_FULL_FLUSH = 3;\nvar Z_FINISH = 4;\nvar Z_BLOCK = 5;\nvar Z_TREES = 6;\n\n\n/* Return codes for the compression/decompression functions. Negative values\n * are errors, positive values are used for special but normal events.\n */\nvar Z_OK = 0;\nvar Z_STREAM_END = 1;\nvar Z_NEED_DICT = 2;\n//var Z_ERRNO = -1;\nvar Z_STREAM_ERROR = -2;\nvar Z_DATA_ERROR = -3;\nvar Z_MEM_ERROR = -4;\nvar Z_BUF_ERROR = -5;\n//var Z_VERSION_ERROR = -6;\n\n/* The deflate compression method */\nvar Z_DEFLATED = 8;\n\n\n/* STATES ====================================================================*/\n/* ===========================================================================*/\n\n\nvar HEAD = 1; /* i: waiting for magic header */\nvar FLAGS = 2; /* i: waiting for method and flags (gzip) */\nvar TIME = 3; /* i: waiting for modification time (gzip) */\nvar OS = 4; /* i: waiting for extra flags and operating system (gzip) */\nvar EXLEN = 5; /* i: waiting for extra length (gzip) */\nvar EXTRA = 6; /* i: waiting for extra bytes (gzip) */\nvar NAME = 7; /* i: waiting for end of file name (gzip) */\nvar COMMENT = 8; /* i: waiting for end of comment (gzip) */\nvar HCRC = 9; /* i: waiting for header crc (gzip) */\nvar DICTID = 10; /* i: waiting for dictionary check value */\nvar DICT = 11; /* waiting for inflateSetDictionary() call */\nvar TYPE = 12; /* i: waiting for type bits, including last-flag bit */\nvar TYPEDO = 13; /* i: same, but skip check to exit inflate on new block */\nvar STORED = 14; /* i: waiting for stored size (length and complement) */\nvar COPY_ = 15; /* i/o: same as COPY below, but only first time in */\nvar COPY = 16; /* i/o: waiting for input or output to copy stored block */\nvar TABLE = 17; /* i: waiting for dynamic block table lengths */\nvar LENLENS = 18; /* i: waiting for code length code lengths */\nvar CODELENS = 19; /* i: waiting for length/lit and distance code lengths */\nvar LEN_ = 20; /* i: same as LEN below, but only first time in */\nvar LEN = 21; /* i: waiting for length/lit/eob code */\nvar LENEXT = 22; /* i: waiting for length extra bits */\nvar DIST = 23; /* i: waiting for distance code */\nvar DISTEXT = 24; /* i: waiting for distance extra bits */\nvar MATCH = 25; /* o: waiting for output space to copy string */\nvar LIT = 26; /* o: waiting for output space to write literal */\nvar CHECK = 27; /* i: waiting for 32-bit check value */\nvar LENGTH = 28; /* i: waiting for 32-bit length (gzip) */\nvar DONE = 29; /* finished check, done -- remain here until reset */\nvar BAD = 30; /* got a data error -- remain here until reset */\nvar MEM = 31; /* got an inflate() memory error -- remain here until reset */\nvar SYNC = 32; /* looking for synchronization bytes to restart inflate() */\n\n/* ===========================================================================*/\n\n\n\nvar ENOUGH_LENS = 852;\nvar ENOUGH_DISTS = 592;\n//var ENOUGH = (ENOUGH_LENS+ENOUGH_DISTS);\n\nvar MAX_WBITS = 15;\n/* 32K LZ77 window */\nvar DEF_WBITS = MAX_WBITS;\n\n\nfunction zswap32(q) {\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 utils.Buf16(320); /* temporary storage for code lengths */\n this.work = new utils.Buf16(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 utils.Buf32(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\nfunction inflateResetKeep(strm) {\n var state;\n\n if (!strm || !strm.state) { return Z_STREAM_ERROR; }\n 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 utils.Buf32(ENOUGH_LENS);\n state.distcode = state.distdyn = new utils.Buf32(ENOUGH_DISTS);\n\n state.sane = 1;\n state.back = -1;\n //Tracev((stderr, \"inflate: reset\\n\"));\n return Z_OK;\n}\n\nfunction inflateReset(strm) {\n var state;\n\n if (!strm || !strm.state) { return Z_STREAM_ERROR; }\n state = strm.state;\n state.wsize = 0;\n state.whave = 0;\n state.wnext = 0;\n return inflateResetKeep(strm);\n\n}\n\nfunction inflateReset2(strm, windowBits) {\n var wrap;\n var state;\n\n /* get the state */\n if (!strm || !strm.state) { return Z_STREAM_ERROR; }\n 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;\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\nfunction inflateInit2(strm, windowBits) {\n var ret;\n var state;\n\n if (!strm) { return Z_STREAM_ERROR; }\n //strm.msg = Z_NULL; /* in case we return an error */\n\n 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 ret = inflateReset2(strm, windowBits);\n if (ret !== Z_OK) {\n strm.state = null/*Z_NULL*/;\n }\n return ret;\n}\n\nfunction inflateInit(strm) {\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 */\nvar virgin = true;\n\nvar lenfix, distfix; // We have no pointers in JS, so keep tables separate\n\nfunction fixedtables(state) {\n /* build fixed huffman tables if first call (may not be thread safe) */\n if (virgin) {\n var sym;\n\n lenfix = new utils.Buf32(512);\n distfix = new utils.Buf32(32);\n\n /* literal/length table */\n 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 inflate_table(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 inflate_table(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 */\nfunction updatewindow(strm, src, end, copy) {\n var dist;\n var 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 utils.Buf8(state.wsize);\n }\n\n /* copy state->wsize or less output bytes into the circular window */\n if (copy >= state.wsize) {\n utils.arraySet(state.window, src, end - state.wsize, state.wsize, 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 utils.arraySet(state.window, src, end - copy, dist, state.wnext);\n copy -= dist;\n if (copy) {\n //zmemcpy(state->window, end - copy, copy);\n utils.arraySet(state.window, src, end - copy, copy, 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\nfunction inflate(strm, flush) {\n var state;\n var input, output; // input/output buffers\n var next; /* next input INDEX */\n var put; /* next output INDEX */\n var have, left; /* available input and output */\n var hold; /* bit buffer */\n var bits; /* bits in bit buffer */\n var _in, _out; /* save starting available input and output */\n var copy; /* number of stored or match bytes to copy */\n var from; /* where to copy match bytes from */\n var from_source;\n var here = 0; /* current decoding table entry */\n var here_bits, here_op, here_val; // paked \"here\" denormalized (JS specific)\n //var last; /* parent table entry */\n var last_bits, last_op, last_val; // paked \"last\" denormalized (JS specific)\n var len; /* length to copy for repeats, bits to drop */\n var ret; /* return code */\n var hbuf = new utils.Buf8(4); /* buffer for gzip header crc calculation */\n var opts;\n\n var n; // temporary var for NEED_BITS\n\n var order = /* permutation of code lengths */\n [ 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;\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;\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(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 state.dmax = 1 << len;\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(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(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(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(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 Array(state.head.extra_len);\n }\n utils.arraySet(\n state.head.extra,\n input,\n next,\n // extra field is limited to 65536 bytes\n // - no need for additional size check\n copy,\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(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(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(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;\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 utils.arraySet(output, input, 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 = inflate_table(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 = inflate_table(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 = inflate_table(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 inflate_fast(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(state.check, output, _out, put - _out) : adler32(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;\n break inf_leave;\n case BAD:\n ret = Z_DATA_ERROR;\n break inf_leave;\n case MEM:\n return Z_MEM_ERROR;\n case SYNC:\n /* falls through */\n default:\n return Z_STREAM_ERROR;\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))) {\n if (updatewindow(strm, strm.output, strm.next_out, _out - strm.avail_out)) {\n state.mode = MEM;\n return Z_MEM_ERROR;\n }\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(state.check, output, _out, strm.next_out - _out) : adler32(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) && ret === Z_OK) {\n ret = Z_BUF_ERROR;\n }\n return ret;\n}\n\nfunction inflateEnd(strm) {\n\n if (!strm || !strm.state /*|| strm->zfree == (free_func)0*/) {\n return Z_STREAM_ERROR;\n }\n\n var state = strm.state;\n if (state.window) {\n state.window = null;\n }\n strm.state = null;\n return Z_OK;\n}\n\nfunction inflateGetHeader(strm, head) {\n var state;\n\n /* check state */\n if (!strm || !strm.state) { return Z_STREAM_ERROR; }\n state = strm.state;\n if ((state.wrap & 2) === 0) { return Z_STREAM_ERROR; }\n\n /* save header structure */\n state.head = head;\n head.done = false;\n return Z_OK;\n}\n\nfunction inflateSetDictionary(strm, dictionary) {\n var dictLength = dictionary.length;\n\n var state;\n var dictid;\n var ret;\n\n /* check state */\n if (!strm /* == Z_NULL */ || !strm.state /* == Z_NULL */) { return Z_STREAM_ERROR; }\n state = strm.state;\n\n if (state.wrap !== 0 && state.mode !== DICT) {\n return Z_STREAM_ERROR;\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(dictid, dictionary, dictLength, 0);\n if (dictid !== state.check) {\n return Z_DATA_ERROR;\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;\n }\n state.havedict = 1;\n // Tracev((stderr, \"inflate: dictionary set\\n\"));\n return Z_OK;\n}\n\nexports.inflateReset = inflateReset;\nexports.inflateReset2 = inflateReset2;\nexports.inflateResetKeep = inflateResetKeep;\nexports.inflateInit = inflateInit;\nexports.inflateInit2 = inflateInit2;\nexports.inflate = inflate;\nexports.inflateEnd = inflateEnd;\nexports.inflateGetHeader = inflateGetHeader;\nexports.inflateSetDictionary = inflateSetDictionary;\nexports.inflateInfo = 'pako inflate (from Nodeca project)';\n\n/* Not implemented\nexports.inflateCopy = inflateCopy;\nexports.inflateGetDictionary = inflateGetDictionary;\nexports.inflateMark = inflateMark;\nexports.inflatePrime = inflatePrime;\nexports.inflateSync = inflateSync;\nexports.inflateSyncPoint = inflateSyncPoint;\nexports.inflateUndermine = inflateUndermine;\n*/\n"],"names":["utils","require$$0","adler32","require$$1","crc32","require$$2","inflate_fast","require$$3","inflate_table","require$$4","CODES","LENS","DISTS","Z_FINISH","Z_BLOCK","Z_TREES","Z_OK","Z_STREAM_END","Z_NEED_DICT","Z_STREAM_ERROR","Z_DATA_ERROR","Z_MEM_ERROR","Z_BUF_ERROR","Z_DEFLATED","HEAD","FLAGS","TIME","OS","EXLEN","EXTRA","NAME","COMMENT","HCRC","DICTID","DICT","TYPE","TYPEDO","STORED","COPY_","COPY","TABLE","LENLENS","CODELENS","LEN_","LEN","LENEXT","DIST","DISTEXT","MATCH","LIT","CHECK","LENGTH","DONE","BAD","MEM","SYNC","ENOUGH_LENS","ENOUGH_DISTS","MAX_WBITS","DEF_WBITS","zswap32","q","InflateState","inflateResetKeep","strm","state","inflateReset","inflateReset2","windowBits","wrap","inflateInit2","ret","inflateInit","virgin","lenfix","distfix","fixedtables","sym","updatewindow","src","end","copy","dist","inflate","flush","input","output","next","put","have","left","hold","bits","_in","_out","from","from_source","here","here_bits","here_op","here_val","last_bits","last_op","last_val","len","hbuf","opts","n","order","inf_leave","inflateEnd","inflateGetHeader","head","inflateSetDictionary","dictionary","dictLength","dictid","inflate_1"],"mappings":"2UAqBA,IAAIA,EAAgBC,GAAAA,UAA0B,EAC1CC,EAAgBC,GAAAA,UAAoB,EACpCC,EAAgBC,GAAAA,UAAkB,EAClCC,GAAgBC,GAAAA,UAAoB,EACpCC,EAAgBC,GAAAA,UAAqB,EAErCC,GAAQ,EACRC,EAAO,EACPC,EAAQ,EAWRC,EAAkB,EAClBC,GAAkB,EAClBC,EAAkB,EAMlBC,EAAkB,EAClBC,GAAkB,EAClBC,GAAkB,EAElBC,EAAkB,GAClBC,EAAkB,GAClBC,EAAkB,GAClBC,GAAkB,GAIlBC,EAAc,EAOXC,EAAO,EACPC,EAAQ,EACRC,GAAO,EACPC,GAAK,EACLC,GAAQ,EACRC,GAAQ,EACRC,GAAO,EACPC,GAAU,EACVC,GAAO,EACPC,GAAS,GACTC,EAAO,GACHC,EAAO,GACPC,EAAS,GACTC,GAAS,GACTC,EAAQ,GACRC,GAAO,GACPC,GAAQ,GACRC,GAAU,GACVC,GAAW,GACPC,EAAO,GACPC,EAAM,GACNC,GAAS,GACTC,GAAO,GACPC,GAAU,GACVC,GAAQ,GACRC,GAAM,GACdC,EAAQ,GACRC,GAAS,GACTC,GAAO,GACPC,EAAM,GACNC,GAAM,GACNC,GAAO,GAMVC,GAAc,IACdC,GAAe,IAGfC,GAAY,GAEZC,GAAYD,GAGhB,SAASE,GAAQC,EAAG,CAClB,OAAWA,IAAM,GAAM,MACbA,IAAM,EAAK,SACXA,EAAI,QAAW,KACfA,EAAI,MAAS,IAIzB,SAASC,IAAe,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,IAAI9D,EAAM,MAAM,GAAG,EAC/B,KAAK,KAAO,IAAIA,EAAM,MAAM,GAAG,EAO/B,KAAK,OAAS,KACd,KAAK,QAAU,KACf,KAAK,KAAO,EACZ,KAAK,KAAO,EACZ,KAAK,IAAM,EAGb,SAAS+D,GAAiBC,EAAM,CAC9B,IAAIC,EAEJ,MAAI,CAACD,GAAQ,CAACA,EAAK,MAAgB7C,GACnC8C,EAAQD,EAAK,MACbA,EAAK,SAAWA,EAAK,UAAYC,EAAM,MAAQ,EAC/CD,EAAK,IAAM,GACPC,EAAM,OACRD,EAAK,MAAQC,EAAM,KAAO,GAE5BA,EAAM,KAAOzC,EACbyC,EAAM,KAAO,EACbA,EAAM,SAAW,EACjBA,EAAM,KAAO,MACbA,EAAM,KAAO,KACbA,EAAM,KAAO,EACbA,EAAM,KAAO,EAEbA,EAAM,QAAUA,EAAM,OAAS,IAAIjE,EAAM,MAAMwD,EAAW,EAC1DS,EAAM,SAAWA,EAAM,QAAU,IAAIjE,EAAM,MAAMyD,EAAY,EAE7DQ,EAAM,KAAO,EACbA,EAAM,KAAO,GAENjD,GAGT,SAASkD,GAAaF,EAAM,CAC1B,IAAIC,EAEJ,MAAI,CAACD,GAAQ,CAACA,EAAK,MAAgB7C,GACnC8C,EAAQD,EAAK,MACbC,EAAM,MAAQ,EACdA,EAAM,MAAQ,EACdA,EAAM,MAAQ,EACPF,GAAiBC,CAAI,GAI9B,SAASG,GAAcH,EAAMI,EAAY,CACvC,IAAIC,EACAJ,EAmBJ,MAhBI,CAACD,GAAQ,CAACA,EAAK,QACnBC,EAAQD,EAAK,MAGTI,EAAa,GACfC,EAAO,EACPD,EAAa,CAACA,IAGdC,GAAQD,GAAc,GAAK,EACvBA,EAAa,KACfA,GAAc,KAKdA,IAAeA,EAAa,GAAKA,EAAa,KACzCjD,GAEL8C,EAAM,SAAW,MAAQA,EAAM,QAAUG,IAC3CH,EAAM,OAAS,MAIjBA,EAAM,KAAOI,EACbJ,EAAM,MAAQG,EACPF,GAAaF,CAAI,GAG1B,SAASM,GAAaN,EAAMI,EAAY,CACtC,IAAIG,EACAN,EAEJ,OAAKD,GAGLC,EAAQ,IAAIH,GAIZE,EAAK,MAAQC,EACbA,EAAM,OAAS,KACfM,EAAMJ,GAAcH,EAAMI,CAAU,EAChCG,IAAQvD,IACVgD,EAAK,MAAQ,MAERO,GAbapD,EAgBtB,SAASqD,GAAYR,EAAM,CACzB,OAAOM,GAAaN,EAAML,EAAS,EAcrC,IAAIc,GAAS,GAETC,EAAQC,EAEZ,SAASC,GAAYX,EAAO,CAE1B,GAAIQ,GAAQ,CACV,IAAII,EAOJ,IALAH,EAAS,IAAI1E,EAAM,MAAM,GAAG,EAC5B2E,EAAU,IAAI3E,EAAM,MAAM,EAAE,EAG5B6E,EAAM,EACCA,EAAM,KAAOZ,EAAM,KAAKY,GAAK,EAAI,EACxC,KAAOA,EAAM,KAAOZ,EAAM,KAAKY,GAAK,EAAI,EACxC,KAAOA,EAAM,KAAOZ,EAAM,KAAKY,GAAK,EAAI,EACxC,KAAOA,EAAM,KAAOZ,EAAM,KAAKY,GAAK,EAAI,EAMxC,IAJArE,EAAcG,EAAOsD,EAAM,KAAM,EAAG,IAAKS,EAAU,EAAGT,EAAM,KAAM,CAAE,KAAM,CAAC,CAAE,EAG7EY,EAAM,EACCA,EAAM,IAAMZ,EAAM,KAAKY,GAAK,EAAI,EAEvCrE,EAAcI,EAAOqD,EAAM,KAAM,EAAG,GAAMU,EAAS,EAAGV,EAAM,KAAM,CAAE,KAAM,CAAC,CAAE,EAG7EQ,GAAS,GAGXR,EAAM,QAAUS,EAChBT,EAAM,QAAU,EAChBA,EAAM,SAAWU,EACjBV,EAAM,SAAW,EAkBnB,SAASa,GAAad,EAAMe,EAAKC,EAAKC,EAAM,CAC1C,IAAIC,EACAjB,EAAQD,EAAK,MAGjB,OAAIC,EAAM,SAAW,OACnBA,EAAM,MAAQ,GAAKA,EAAM,MACzBA,EAAM,MAAQ,EACdA,EAAM,MAAQ,EAEdA,EAAM,OAAS,IAAIjE,EAAM,KAAKiE,EAAM,KAAK,GAIvCgB,GAAQhB,EAAM,OAChBjE,EAAM,SAASiE,EAAM,OAAQc,EAAKC,EAAMf,EAAM,MAAOA,EAAM,MAAO,CAAC,EACnEA,EAAM,MAAQ,EACdA,EAAM,MAAQA,EAAM,QAGpBiB,EAAOjB,EAAM,MAAQA,EAAM,MACvBiB,EAAOD,IACTC,EAAOD,GAGTjF,EAAM,SAASiE,EAAM,OAAQc,EAAKC,EAAMC,EAAMC,EAAMjB,EAAM,KAAK,EAC/DgB,GAAQC,EACJD,GAEFjF,EAAM,SAASiE,EAAM,OAAQc,EAAKC,EAAMC,EAAMA,EAAM,CAAC,EACrDhB,EAAM,MAAQgB,EACdhB,EAAM,MAAQA,EAAM,QAGpBA,EAAM,OAASiB,EACXjB,EAAM,QAAUA,EAAM,QAASA,EAAM,MAAQ,GAC7CA,EAAM,MAAQA,EAAM,QAASA,EAAM,OAASiB,KAG7C,EAGT,SAASC,GAAQnB,EAAMoB,EAAO,CAC5B,IAAInB,EACAoB,EAAOC,EACPC,EACAC,EACAC,EAAMC,EACNC,EACAC,EACAC,EAAKC,EACLb,EACAc,EACAC,EACAC,EAAO,EACPC,EAAWC,EAASC,EAEpBC,EAAWC,EAASC,EACpBC,EACAjC,EACAkC,EAAO,IAAIzG,EAAM,KAAK,CAAC,EACvB0G,EAEAC,EAEAC,GACF,CAAE,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,EAAI,EAGtE,GAAI,CAAC5C,GAAQ,CAACA,EAAK,OAAS,CAACA,EAAK,QAC7B,CAACA,EAAK,OAASA,EAAK,WAAa,EACpC,OAAO7C,EAGT8C,EAAQD,EAAK,MACTC,EAAM,OAAS9B,IAAQ8B,EAAM,KAAO7B,GAIxCoD,EAAMxB,EAAK,SACXsB,EAAStB,EAAK,OACd0B,EAAO1B,EAAK,UACZuB,EAAOvB,EAAK,QACZqB,EAAQrB,EAAK,MACbyB,EAAOzB,EAAK,SACZ2B,EAAO1B,EAAM,KACb2B,EAAO3B,EAAM,KAGb4B,EAAMJ,EACNK,EAAOJ,EACPnB,EAAMvD,EAEN6F,EACA,OACE,OAAQ5C,EAAM,KAAI,CAChB,KAAKzC,EACH,GAAIyC,EAAM,OAAS,EAAG,CACpBA,EAAM,KAAO7B,EACb,MAGF,KAAOwD,EAAO,IAAI,CAChB,GAAIH,IAAS,EAAK,MAAMoB,EACxBpB,IACAE,GAAQN,EAAME,GAAM,GAAKK,EACzBA,GAAQ,EAGV,GAAK3B,EAAM,KAAO,GAAM0B,IAAS,MAAQ,CACvC1B,EAAM,MAAQ,EAEdwC,EAAK,CAAC,EAAId,EAAO,IACjBc,EAAK,CAAC,EAAKd,IAAS,EAAK,IACzB1B,EAAM,MAAQ7D,EAAM6D,EAAM,MAAOwC,EAAM,EAAG,CAAC,EAI3Cd,EAAO,EACPC,EAAO,EAEP3B,EAAM,KAAOxC,EACb,MAMF,GAJAwC,EAAM,MAAQ,EACVA,EAAM,OACRA,EAAM,KAAK,KAAO,IAEhB,EAAEA,EAAM,KAAO,OACd0B,EAAO,MAAoB,IAAMA,GAAQ,IAAM,GAAI,CACtD3B,EAAK,IAAM,yBACXC,EAAM,KAAOZ,EACb,MAEF,IAAKsC,EAAO,MAAqBpE,EAAY,CAC3CyC,EAAK,IAAM,6BACXC,EAAM,KAAOZ,EACb,MAOF,GAJAsC,KAAU,EACVC,GAAQ,EAERY,GAAOb,EAAO,IAAmB,EAC7B1B,EAAM,QAAU,EAClBA,EAAM,MAAQuC,UAEPA,EAAMvC,EAAM,MAAO,CAC1BD,EAAK,IAAM,sBACXC,EAAM,KAAOZ,EACb,MAEFY,EAAM,KAAO,GAAKuC,EAElBxC,EAAK,MAAQC,EAAM,MAAQ,EAC3BA,EAAM,KAAO0B,EAAO,IAAQ1D,GAASE,EAErCwD,EAAO,EACPC,EAAO,EAEP,MACF,KAAKnE,EAEH,KAAOmE,EAAO,IAAI,CAChB,GAAIH,IAAS,EAAK,MAAMoB,EACxBpB,IACAE,GAAQN,EAAME,GAAM,GAAKK,EACzBA,GAAQ,EAIV,GADA3B,EAAM,MAAQ0B,GACT1B,EAAM,MAAQ,OAAU1C,EAAY,CACvCyC,EAAK,IAAM,6BACXC,EAAM,KAAOZ,EACb,MAEF,GAAIY,EAAM,MAAQ,MAAQ,CACxBD,EAAK,IAAM,2BACXC,EAAM,KAAOZ,EACb,MAEEY,EAAM,OACRA,EAAM,KAAK,KAAS0B,GAAQ,EAAK,GAE/B1B,EAAM,MAAQ,MAEhBwC,EAAK,CAAC,EAAId,EAAO,IACjBc,EAAK,CAAC,EAAKd,IAAS,EAAK,IACzB1B,EAAM,MAAQ7D,EAAM6D,EAAM,MAAOwC,EAAM,EAAG,CAAC,GAI7Cd,EAAO,EACPC,EAAO,EAEP3B,EAAM,KAAOvC,GAEf,KAAKA,GAEH,KAAOkE,EAAO,IAAI,CAChB,GAAIH,IAAS,EAAK,MAAMoB,EACxBpB,IACAE,GAAQN,EAAME,GAAM,GAAKK,EACzBA,GAAQ,EAGN3B,EAAM,OACRA,EAAM,KAAK,KAAO0B,GAEhB1B,EAAM,MAAQ,MAEhBwC,EAAK,CAAC,EAAId,EAAO,IACjBc,EAAK,CAAC,EAAKd,IAAS,EAAK,IACzBc,EAAK,CAAC,EAAKd,IAAS,GAAM,IAC1Bc,EAAK,CAAC,EAAKd,IAAS,GAAM,IAC1B1B,EAAM,MAAQ7D,EAAM6D,EAAM,MAAOwC,EAAM,EAAG,CAAC,GAI7Cd,EAAO,EACPC,EAAO,EAEP3B,EAAM,KAAOtC,GAEf,KAAKA,GAEH,KAAOiE,EAAO,IAAI,CAChB,GAAIH,IAAS,EAAK,MAAMoB,EACxBpB,IACAE,GAAQN,EAAME,GAAM,GAAKK,EACzBA,GAAQ,EAGN3B,EAAM,OACRA,EAAM,KAAK,OAAU0B,EAAO,IAC5B1B,EAAM,KAAK,GAAM0B,GAAQ,GAEvB1B,EAAM,MAAQ,MAEhBwC,EAAK,CAAC,EAAId,EAAO,IACjBc,EAAK,CAAC,EAAKd,IAAS,EAAK,IACzB1B,EAAM,MAAQ7D,EAAM6D,EAAM,MAAOwC,EAAM,EAAG,CAAC,GAI7Cd,EAAO,EACPC,EAAO,EAEP3B,EAAM,KAAOrC,GAEf,KAAKA,GACH,GAAIqC,EAAM,MAAQ,KAAQ,CAExB,KAAO2B,EAAO,IAAI,CAChB,GAAIH,IAAS,EAAK,MAAMoB,EACxBpB,IACAE,GAAQN,EAAME,GAAM,GAAKK,EACzBA,GAAQ,EAGV3B,EAAM,OAAS0B,EACX1B,EAAM,OACRA,EAAM,KAAK,UAAY0B,GAErB1B,EAAM,MAAQ,MAEhBwC,EAAK,CAAC,EAAId,EAAO,IACjBc,EAAK,CAAC,EAAKd,IAAS,EAAK,IACzB1B,EAAM,MAAQ7D,EAAM6D,EAAM,MAAOwC,EAAM,EAAG,CAAC,GAI7Cd,EAAO,EACPC,EAAO,OAGA3B,EAAM,OACbA,EAAM,KAAK,MAAQ,MAErBA,EAAM,KAAOpC,GAEf,KAAKA,GACH,GAAIoC,EAAM,MAAQ,OAChBgB,EAAOhB,EAAM,OACTgB,EAAOQ,IAAQR,EAAOQ,GACtBR,IACEhB,EAAM,OACRuC,EAAMvC,EAAM,KAAK,UAAYA,EAAM,OAC9BA,EAAM,KAAK,QAEdA,EAAM,KAAK,MAAQ,IAAI,MAAMA,EAAM,KAAK,SAAS,GAEnDjE,EAAM,SACJiE,EAAM,KAAK,MACXoB,EACAE,EAGAN,EAEAuB,CACD,GAKCvC,EAAM,MAAQ,MAChBA,EAAM,MAAQ7D,EAAM6D,EAAM,MAAOoB,EAAOJ,EAAMM,CAAI,GAEpDE,GAAQR,EACRM,GAAQN,EACRhB,EAAM,QAAUgB,GAEdhB,EAAM,QAAU,MAAM4C,EAE5B5C,EAAM,OAAS,EACfA,EAAM,KAAOnC,GAEf,KAAKA,GACH,GAAImC,EAAM,MAAQ,KAAQ,CACxB,GAAIwB,IAAS,EAAK,MAAMoB,EACxB5B,EAAO,EACP,GAEEuB,EAAMnB,EAAME,EAAON,GAAM,EAErBhB,EAAM,MAAQuC,GACbvC,EAAM,OAAS,QAClBA,EAAM,KAAK,MAAQ,OAAO,aAAauC,CAAG,SAErCA,GAAOvB,EAAOQ,GAOvB,GALIxB,EAAM,MAAQ,MAChBA,EAAM,MAAQ7D,EAAM6D,EAAM,MAAOoB,EAAOJ,EAAMM,CAAI,GAEpDE,GAAQR,EACRM,GAAQN,EACJuB,EAAO,MAAMK,OAEV5C,EAAM,OACbA,EAAM,KAAK,KAAO,MAEpBA,EAAM,OAAS,EACfA,EAAM,KAAOlC,GAEf,KAAKA,GACH,GAAIkC,EAAM,MAAQ,KAAQ,CACxB,GAAIwB,IAAS,EAAK,MAAMoB,EACxB5B,EAAO,EACP,GACEuB,EAAMnB,EAAME,EAAON,GAAM,EAErBhB,EAAM,MAAQuC,GACbvC,EAAM,OAAS,QAClBA,EAAM,KAAK,SAAW,OAAO,aAAauC,CAAG,SAExCA,GAAOvB,EAAOQ,GAMvB,GALIxB,EAAM,MAAQ,MAChBA,EAAM,MAAQ7D,EAAM6D,EAAM,MAAOoB,EAAOJ,EAAMM,CAAI,GAEpDE,GAAQR,EACRM,GAAQN,EACJuB,EAAO,MAAMK,OAEV5C,EAAM,OACbA,EAAM,KAAK,QAAU,MAEvBA,EAAM,KAAOjC,GAEf,KAAKA,GACH,GAAIiC,EAAM,MAAQ,IAAQ,CAExB,KAAO2B,EAAO,IAAI,CAChB,GAAIH,IAAS,EAAK,MAAMoB,EACxBpB,IACAE,GAAQN,EAAME,GAAM,GAAKK,EACzBA,GAAQ,EAGV,GAAID,KAAU1B,EAAM,MAAQ,OAAS,CACnCD,EAAK,IAAM,sBACXC,EAAM,KAAOZ,EACb,MAGFsC,EAAO,EACPC,EAAO,EAGL3B,EAAM,OACRA,EAAM,KAAK,KAASA,EAAM,OAAS,EAAK,EACxCA,EAAM,KAAK,KAAO,IAEpBD,EAAK,MAAQC,EAAM,MAAQ,EAC3BA,EAAM,KAAO9B,EACb,MACF,KAAKF,GAEH,KAAO2D,EAAO,IAAI,CAChB,GAAIH,IAAS,EAAK,MAAMoB,EACxBpB,IACAE,GAAQN,EAAME,GAAM,GAAKK,EACzBA,GAAQ,EAGV5B,EAAK,MAAQC,EAAM,MAAQL,GAAQ+B,CAAI,EAEvCA,EAAO,EACPC,EAAO,EAEP3B,EAAM,KAAO/B,EAEf,KAAKA,EACH,GAAI+B,EAAM,WAAa,EAErB,OAAAD,EAAK,SAAWwB,EAChBxB,EAAK,UAAY0B,EACjB1B,EAAK,QAAUuB,EACfvB,EAAK,SAAWyB,EAChBxB,EAAM,KAAO0B,EACb1B,EAAM,KAAO2B,EAEN1E,GAET8C,EAAK,MAAQC,EAAM,MAAQ,EAC3BA,EAAM,KAAO9B,EAEf,KAAKA,EACH,GAAIiD,IAAUtE,IAAWsE,IAAUrE,EAAW,MAAM8F,EAEtD,KAAKzE,EACH,GAAI6B,EAAM,KAAM,CAEd0B,KAAUC,EAAO,EACjBA,GAAQA,EAAO,EAEf3B,EAAM,KAAOf,EACb,MAGF,KAAO0C,EAAO,GAAG,CACf,GAAIH,IAAS,EAAK,MAAMoB,EACxBpB,IACAE,GAAQN,EAAME,GAAM,GAAKK,EACzBA,GAAQ,EASV,OANA3B,EAAM,KAAQ0B,EAAO,EAErBA,KAAU,EACVC,GAAQ,EAGCD,EAAO,EAAI,CAClB,IAAK,GAGH1B,EAAM,KAAO5B,GACb,MACF,IAAK,GAKH,GAJAuC,GAAYX,CAAK,EAGjBA,EAAM,KAAOtB,EACTyC,IAAUrE,EAAS,CAErB4E,KAAU,EACVC,GAAQ,EAER,MAAMiB,EAER,MACF,IAAK,GAGH5C,EAAM,KAAOzB,GACb,MACF,IAAK,GACHwB,EAAK,IAAM,qBACXC,EAAM,KAAOZ,EAGjBsC,KAAU,EACVC,GAAQ,EAER,MACF,KAAKvD,GAMH,IAJAsD,KAAUC,EAAO,EACjBA,GAAQA,EAAO,EAGRA,EAAO,IAAI,CAChB,GAAIH,IAAS,EAAK,MAAMoB,EACxBpB,IACAE,GAAQN,EAAME,GAAM,GAAKK,EACzBA,GAAQ,EAGV,IAAKD,EAAO,UAAcA,IAAS,GAAM,OAAS,CAChD3B,EAAK,IAAM,+BACXC,EAAM,KAAOZ,EACb,MAUF,GARAY,EAAM,OAAS0B,EAAO,MAItBA,EAAO,EACPC,EAAO,EAEP3B,EAAM,KAAO3B,EACT8C,IAAUrE,EAAW,MAAM8F,EAEjC,KAAKvE,EACH2B,EAAM,KAAO1B,GAEf,KAAKA,GAEH,GADA0C,EAAOhB,EAAM,OACTgB,EAAM,CAGR,GAFIA,EAAOQ,IAAQR,EAAOQ,GACtBR,EAAOS,IAAQT,EAAOS,GACtBT,IAAS,EAAK,MAAM4B,EAExB7G,EAAM,SAASsF,EAAQD,EAAOE,EAAMN,EAAMO,CAAG,EAE7CC,GAAQR,EACRM,GAAQN,EACRS,GAAQT,EACRO,GAAOP,EACPhB,EAAM,QAAUgB,EAChB,MAGFhB,EAAM,KAAO9B,EACb,MACF,KAAKK,GAEH,KAAOoD,EAAO,IAAI,CAChB,GAAIH,IAAS,EAAK,MAAMoB,EACxBpB,IACAE,GAAQN,EAAME,GAAM,GAAKK,EACzBA,GAAQ,EAmBV,GAhBA3B,EAAM,MAAQ0B,EAAO,IAAmB,IAExCA,KAAU,EACVC,GAAQ,EAER3B,EAAM,OAAS0B,EAAO,IAAmB,EAEzCA,KAAU,EACVC,GAAQ,EAER3B,EAAM,OAAS0B,EAAO,IAAmB,EAEzCA,KAAU,EACVC,GAAQ,EAGJ3B,EAAM,KAAO,KAAOA,EAAM,MAAQ,GAAI,CACxCD,EAAK,IAAM,sCACXC,EAAM,KAAOZ,EACb,MAIFY,EAAM,KAAO,EACbA,EAAM,KAAOxB,GAEf,KAAKA,GACH,KAAOwB,EAAM,KAAOA,EAAM,OAAO,CAE/B,KAAO2B,EAAO,GAAG,CACf,GAAIH,IAAS,EAAK,MAAMoB,EACxBpB,IACAE,GAAQN,EAAME,GAAM,GAAKK,EACzBA,GAAQ,EAGV3B,EAAM,KAAK2C,GAAM3C,EAAM,MAAM,CAAC,EAAK0B,EAAO,EAE1CA,KAAU,EACVC,GAAQ,EAGV,KAAO3B,EAAM,KAAO,IAClBA,EAAM,KAAK2C,GAAM3C,EAAM,MAAM,CAAC,EAAI,EAapC,GAPAA,EAAM,QAAUA,EAAM,OACtBA,EAAM,QAAU,EAEhByC,EAAO,CAAE,KAAMzC,EAAM,OAAS,EAC9BM,EAAM/D,EAAcE,GAAOuD,EAAM,KAAM,EAAG,GAAIA,EAAM,QAAS,EAAGA,EAAM,KAAMyC,CAAI,EAChFzC,EAAM,QAAUyC,EAAK,KAEjBnC,EAAK,CACPP,EAAK,IAAM,2BACXC,EAAM,KAAOZ,EACb,MAGFY,EAAM,KAAO,EACbA,EAAM,KAAOvB,GAEf,KAAKA,GACH,KAAOuB,EAAM,KAAOA,EAAM,KAAOA,EAAM,OAAO,CAC5C,KACEgC,EAAOhC,EAAM,QAAQ0B,GAAS,GAAK1B,EAAM,SAAW,CAAE,EACtDiC,EAAYD,IAAS,GACrBE,EAAWF,IAAS,GAAM,IAC1BG,EAAWH,EAAO,MAEb,EAAAC,GAAcN,IANZ,CAQP,GAAIH,IAAS,EAAK,MAAMoB,EACxBpB,IACAE,GAAQN,EAAME,GAAM,GAAKK,EACzBA,GAAQ,EAGV,GAAIQ,EAAW,GAEbT,KAAUO,EACVN,GAAQM,EAERjC,EAAM,KAAKA,EAAM,MAAM,EAAImC,MAExB,CACH,GAAIA,IAAa,GAAI,CAGnB,IADAO,EAAIT,EAAY,EACTN,EAAOe,GAAG,CACf,GAAIlB,IAAS,EAAK,MAAMoB,EACxBpB,IACAE,GAAQN,EAAME,GAAM,GAAKK,EACzBA,GAAQ,EAOV,GAHAD,KAAUO,EACVN,GAAQM,EAEJjC,EAAM,OAAS,EAAG,CACpBD,EAAK,IAAM,4BACXC,EAAM,KAAOZ,EACb,MAEFmD,EAAMvC,EAAM,KAAKA,EAAM,KAAO,CAAC,EAC/BgB,EAAO,GAAKU,EAAO,GAEnBA,KAAU,EACVC,GAAQ,UAGDQ,IAAa,GAAI,CAGxB,IADAO,EAAIT,EAAY,EACTN,EAAOe,GAAG,CACf,GAAIlB,IAAS,EAAK,MAAMoB,EACxBpB,IACAE,GAAQN,EAAME,GAAM,GAAKK,EACzBA,GAAQ,EAIVD,KAAUO,EACVN,GAAQM,EAERM,EAAM,EACNvB,EAAO,GAAKU,EAAO,GAEnBA,KAAU,EACVC,GAAQ,MAGL,CAGH,IADAe,EAAIT,EAAY,EACTN,EAAOe,GAAG,CACf,GAAIlB,IAAS,EAAK,MAAMoB,EACxBpB,IACAE,GAAQN,EAAME,GAAM,GAAKK,EACzBA,GAAQ,EAIVD,KAAUO,EACVN,GAAQM,EAERM,EAAM,EACNvB,EAAO,IAAMU,EAAO,KAEpBA,KAAU,EACVC,GAAQ,EAGV,GAAI3B,EAAM,KAAOgB,EAAOhB,EAAM,KAAOA,EAAM,MAAO,CAChDD,EAAK,IAAM,4BACXC,EAAM,KAAOZ,EACb,MAEF,KAAO4B,KACLhB,EAAM,KAAKA,EAAM,MAAM,EAAIuC,GAMjC,GAAIvC,EAAM,OAASZ,EAAO,MAG1B,GAAIY,EAAM,KAAK,GAAG,IAAM,EAAG,CACzBD,EAAK,IAAM,uCACXC,EAAM,KAAOZ,EACb,MAeF,GATAY,EAAM,QAAU,EAEhByC,EAAO,CAAE,KAAMzC,EAAM,OAAS,EAC9BM,EAAM/D,EAAcG,EAAMsD,EAAM,KAAM,EAAGA,EAAM,KAAMA,EAAM,QAAS,EAAGA,EAAM,KAAMyC,CAAI,EAGvFzC,EAAM,QAAUyC,EAAK,KAGjBnC,EAAK,CACPP,EAAK,IAAM,8BACXC,EAAM,KAAOZ,EACb,MAcF,GAXAY,EAAM,SAAW,EAGjBA,EAAM,SAAWA,EAAM,QACvByC,EAAO,CAAE,KAAMzC,EAAM,QAAU,EAC/BM,EAAM/D,EAAcI,EAAOqD,EAAM,KAAMA,EAAM,KAAMA,EAAM,MAAOA,EAAM,SAAU,EAAGA,EAAM,KAAMyC,CAAI,EAGnGzC,EAAM,SAAWyC,EAAK,KAGlBnC,EAAK,CACPP,EAAK,IAAM,wBACXC,EAAM,KAAOZ,EACb,MAIF,GADAY,EAAM,KAAOtB,EACTyC,IAAUrE,EAAW,MAAM8F,EAEjC,KAAKlE,EACHsB,EAAM,KAAOrB,EAEf,KAAKA,EACH,GAAI6C,GAAQ,GAAKC,GAAQ,IAAK,CAE5B1B,EAAK,SAAWwB,EAChBxB,EAAK,UAAY0B,EACjB1B,EAAK,QAAUuB,EACfvB,EAAK,SAAWyB,EAChBxB,EAAM,KAAO0B,EACb1B,EAAM,KAAO2B,EAEbtF,GAAa0D,EAAM8B,CAAI,EAEvBN,EAAMxB,EAAK,SACXsB,EAAStB,EAAK,OACd0B,EAAO1B,EAAK,UACZuB,EAAOvB,EAAK,QACZqB,EAAQrB,EAAK,MACbyB,EAAOzB,EAAK,SACZ2B,EAAO1B,EAAM,KACb2B,EAAO3B,EAAM,KAGTA,EAAM,OAAS9B,IACjB8B,EAAM,KAAO,IAEf,MAGF,IADAA,EAAM,KAAO,EAEXgC,EAAOhC,EAAM,QAAQ0B,GAAS,GAAK1B,EAAM,SAAW,CAAE,EACtDiC,EAAYD,IAAS,GACrBE,EAAWF,IAAS,GAAM,IAC1BG,EAAWH,EAAO,MAEd,EAAAC,GAAaN,IANV,CAQP,GAAIH,IAAS,EAAK,MAAMoB,EACxBpB,IACAE,GAAQN,EAAME,GAAM,GAAKK,EACzBA,GAAQ,EAGV,GAAIO,GAAY,EAAAA,EAAU,KAAa,CAIrC,IAHAE,EAAYH,EACZI,EAAUH,EACVI,EAAWH,EAETH,EAAOhC,EAAM,QAAQsC,IACXZ,GAAS,GAAMU,EAAYC,GAAY,IAAoCD,EAAU,EAC/FH,EAAYD,IAAS,GACrBE,EAAWF,IAAS,GAAM,IAC1BG,EAAWH,EAAO,MAEb,EAAAI,EAAYH,GAAcN,IAPxB,CASP,GAAIH,IAAS,EAAK,MAAMoB,EACxBpB,IACAE,GAAQN,EAAME,GAAM,GAAKK,EACzBA,GAAQ,EAIVD,KAAUU,EACVT,GAAQS,EAERpC,EAAM,MAAQoC,EAQhB,GALAV,KAAUO,EACVN,GAAQM,EAERjC,EAAM,MAAQiC,EACdjC,EAAM,OAASmC,EACXD,IAAY,EAAG,CAIjBlC,EAAM,KAAOhB,GACb,MAEF,GAAIkD,EAAU,GAAI,CAEhBlC,EAAM,KAAO,GACbA,EAAM,KAAO9B,EACb,MAEF,GAAIgE,EAAU,GAAI,CAChBnC,EAAK,IAAM,8BACXC,EAAM,KAAOZ,EACb,MAEFY,EAAM,MAAQkC,EAAU,GACxBlC,EAAM,KAAOpB,GAEf,KAAKA,GACH,GAAIoB,EAAM,MAAO,CAGf,IADA0C,EAAI1C,EAAM,MACH2B,EAAOe,GAAG,CACf,GAAIlB,IAAS,EAAK,MAAMoB,EACxBpB,IACAE,GAAQN,EAAME,GAAM,GAAKK,EACzBA,GAAQ,EAGV3B,EAAM,QAAU0B,GAAS,GAAK1B,EAAM,OAAS,EAE7C0B,KAAU1B,EAAM,MAChB2B,GAAQ3B,EAAM,MAEdA,EAAM,MAAQA,EAAM,MAGtBA,EAAM,IAAMA,EAAM,OAClBA,EAAM,KAAOnB,GAEf,KAAKA,GACH,KACEmD,EAAOhC,EAAM,SAAS0B,GAAS,GAAK1B,EAAM,UAAY,CAAE,EACxDiC,EAAYD,IAAS,GACrBE,EAAWF,IAAS,GAAM,IAC1BG,EAAWH,EAAO,MAEb,EAAAC,GAAcN,IANZ,CAQP,GAAIH,IAAS,EAAK,MAAMoB,EACxBpB,IACAE,GAAQN,EAAME,GAAM,GAAKK,EACzBA,GAAQ,EAGV,GAAK,EAAAO,EAAU,KAAa,CAI1B,IAHAE,EAAYH,EACZI,EAAUH,EACVI,EAAWH,EAETH,EAAOhC,EAAM,SAASsC,IACZZ,GAAS,GAAMU,EAAYC,GAAY,IAAoCD,EAAU,EAC/FH,EAAYD,IAAS,GACrBE,EAAWF,IAAS,GAAM,IAC1BG,EAAWH,EAAO,MAEb,EAAAI,EAAYH,GAAcN,IAPxB,CASP,GAAIH,IAAS,EAAK,MAAMoB,EACxBpB,IACAE,GAAQN,EAAME,GAAM,GAAKK,EACzBA,GAAQ,EAIVD,KAAUU,EACVT,GAAQS,EAERpC,EAAM,MAAQoC,EAOhB,GAJAV,KAAUO,EACVN,GAAQM,EAERjC,EAAM,MAAQiC,EACVC,EAAU,GAAI,CAChBnC,EAAK,IAAM,wBACXC,EAAM,KAAOZ,EACb,MAEFY,EAAM,OAASmC,EACfnC,EAAM,MAASkC,EAAW,GAC1BlC,EAAM,KAAOlB,GAEf,KAAKA,GACH,GAAIkB,EAAM,MAAO,CAGf,IADA0C,EAAI1C,EAAM,MACH2B,EAAOe,GAAG,CACf,GAAIlB,IAAS,EAAK,MAAMoB,EACxBpB,IACAE,GAAQN,EAAME,GAAM,GAAKK,EACzBA,GAAQ,EAGV3B,EAAM,QAAU0B,GAAS,GAAK1B,EAAM,OAAS,EAE7C0B,KAAU1B,EAAM,MAChB2B,GAAQ3B,EAAM,MAEdA,EAAM,MAAQA,EAAM,MAGtB,GAAIA,EAAM,OAASA,EAAM,KAAM,CAC7BD,EAAK,IAAM,gCACXC,EAAM,KAAOZ,EACb,MAIFY,EAAM,KAAOjB,GAEf,KAAKA,GACH,GAAI0C,IAAS,EAAK,MAAMmB,EAExB,GADA5B,EAAOa,EAAOJ,EACVzB,EAAM,OAASgB,EAAM,CAEvB,GADAA,EAAOhB,EAAM,OAASgB,EAClBA,EAAOhB,EAAM,OACXA,EAAM,KAAM,CACdD,EAAK,IAAM,gCACXC,EAAM,KAAOZ,EACb,MAkBA4B,EAAOhB,EAAM,OACfgB,GAAQhB,EAAM,MACd8B,EAAO9B,EAAM,MAAQgB,GAGrBc,EAAO9B,EAAM,MAAQgB,EAEnBA,EAAOhB,EAAM,SAAUgB,EAAOhB,EAAM,QACxC+B,EAAc/B,EAAM,YAGpB+B,EAAcV,EACdS,EAAOP,EAAMvB,EAAM,OACnBgB,EAAOhB,EAAM,OAEXgB,EAAOS,IAAQT,EAAOS,GAC1BA,GAAQT,EACRhB,EAAM,QAAUgB,EAChB,GACEK,EAAOE,GAAK,EAAIQ,EAAYD,GAAM,QAC3B,EAAEd,GACPhB,EAAM,SAAW,IAAKA,EAAM,KAAOrB,GACvC,MACF,KAAKK,GACH,GAAIyC,IAAS,EAAK,MAAMmB,EACxBvB,EAAOE,GAAK,EAAIvB,EAAM,OACtByB,IACAzB,EAAM,KAAOrB,EACb,MACF,KAAKM,EACH,GAAIe,EAAM,KAAM,CAEd,KAAO2B,EAAO,IAAI,CAChB,GAAIH,IAAS,EAAK,MAAMoB,EACxBpB,IAEAE,GAAQN,EAAME,GAAM,GAAKK,EACzBA,GAAQ,EAcV,GAXAE,GAAQJ,EACR1B,EAAK,WAAa8B,EAClB7B,EAAM,OAAS6B,EACXA,IACF9B,EAAK,MAAQC,EAAM,MAEdA,EAAM,MAAQ7D,EAAM6D,EAAM,MAAOqB,EAAQQ,EAAMN,EAAMM,CAAI,EAAI5F,EAAQ+D,EAAM,MAAOqB,EAAQQ,EAAMN,EAAMM,CAAI,GAGjHA,EAAOJ,GAEFzB,EAAM,MAAQ0B,EAAO/B,GAAQ+B,CAAI,KAAO1B,EAAM,MAAO,CACxDD,EAAK,IAAM,uBACXC,EAAM,KAAOZ,EACb,MAGFsC,EAAO,EACPC,EAAO,EAIT3B,EAAM,KAAOd,GAEf,KAAKA,GACH,GAAIc,EAAM,MAAQA,EAAM,MAAO,CAE7B,KAAO2B,EAAO,IAAI,CAChB,GAAIH,IAAS,EAAK,MAAMoB,EACxBpB,IACAE,GAAQN,EAAME,GAAM,GAAKK,EACzBA,GAAQ,EAGV,GAAID,KAAU1B,EAAM,MAAQ,YAAa,CACvCD,EAAK,IAAM,yBACXC,EAAM,KAAOZ,EACb,MAGFsC,EAAO,EACPC,EAAO,EAIT3B,EAAM,KAAOb,GAEf,KAAKA,GACHmB,EAAMtD,GACN,MAAM4F,EACR,KAAKxD,EACHkB,EAAMnD,EACN,MAAMyF,EACR,KAAKvD,GACH,OAAOjC,EACT,KAAKkC,GAEL,QACE,OAAOpC,EAcb,OAAA6C,EAAK,SAAWwB,EAChBxB,EAAK,UAAY0B,EACjB1B,EAAK,QAAUuB,EACfvB,EAAK,SAAWyB,EAChBxB,EAAM,KAAO0B,EACb1B,EAAM,KAAO2B,GAGT3B,EAAM,OAAU6B,IAAS9B,EAAK,WAAaC,EAAM,KAAOZ,IACvCY,EAAM,KAAOf,GAASkC,IAAUvE,KAC/CiE,GAAad,EAAMA,EAAK,OAAQA,EAAK,SAAU8B,EAAO9B,EAAK,SAAS,EAK1E6B,GAAO7B,EAAK,SACZ8B,GAAQ9B,EAAK,UACbA,EAAK,UAAY6B,EACjB7B,EAAK,WAAa8B,EAClB7B,EAAM,OAAS6B,EACX7B,EAAM,MAAQ6B,IAChB9B,EAAK,MAAQC,EAAM,MAChBA,EAAM,MAAQ7D,EAAM6D,EAAM,MAAOqB,EAAQQ,EAAM9B,EAAK,SAAW8B,CAAI,EAAI5F,EAAQ+D,EAAM,MAAOqB,EAAQQ,EAAM9B,EAAK,SAAW8B,CAAI,GAEnI9B,EAAK,UAAYC,EAAM,MAAQA,EAAM,KAAO,GAAK,IAC9BA,EAAM,OAAS9B,EAAO,IAAM,IAC5B8B,EAAM,OAAStB,GAAQsB,EAAM,OAAS3B,EAAQ,IAAM,IACjEuD,IAAQ,GAAKC,IAAS,GAAMV,IAAUvE,IAAa0D,IAAQvD,IAC/DuD,EAAMjD,IAEDiD,EAGT,SAASuC,GAAW9C,EAAM,CAExB,GAAI,CAACA,GAAQ,CAACA,EAAK,MACjB,OAAO7C,EAGT,IAAI8C,EAAQD,EAAK,MACjB,OAAIC,EAAM,SACRA,EAAM,OAAS,MAEjBD,EAAK,MAAQ,KACNhD,EAGT,SAAS+F,GAAiB/C,EAAMgD,EAAM,CACpC,IAAI/C,EAKJ,MAFI,CAACD,GAAQ,CAACA,EAAK,QACnBC,EAAQD,EAAK,MACR,EAAAC,EAAM,KAAO,IAAmB9C,GAGrC8C,EAAM,KAAO+C,EACbA,EAAK,KAAO,GACLhG,GAGT,SAASiG,GAAqBjD,EAAMkD,EAAY,CAC9C,IAAIC,EAAaD,EAAW,OAExBjD,EACAmD,EACA7C,EAMJ,MAHI,CAACP,GAAwB,CAACA,EAAK,QACnCC,EAAQD,EAAK,MAETC,EAAM,OAAS,GAAKA,EAAM,OAAS/B,GAC9Bf,EAIL8C,EAAM,OAAS/B,IACjBkF,EAAS,EAETA,EAASlH,EAAQkH,EAAQF,EAAYC,EAAY,CAAC,EAC9CC,IAAWnD,EAAM,OACZ7C,GAKXmD,EAAMO,GAAad,EAAMkD,EAAYC,EAAYA,CAAU,EACvD5C,GACFN,EAAM,KAAOX,GACNjC,IAET4C,EAAM,SAAW,EAEVjD,IAGWqG,OAAAA,EAAA,UAAA,aAAGnD,GACFmD,EAAA,UAAA,cAAGlD,GACAkD,EAAA,UAAA,iBAAGtD,GACRsD,EAAA,UAAA,YAAG7C,GACF6C,EAAA,UAAA,aAAG/C,GACR+C,EAAA,UAAA,QAAGlC,GACAkC,EAAA,UAAA,WAAGP,GACGO,EAAA,UAAA,iBAAGN,GACCM,EAAA,UAAA,qBAAGJ,GACZI,EAAA,UAAA,YAAG","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/pako@1.0.11/node_modules/pako/lib/zlib/inftrees.js ADDED Viewed

	@@ -0,0 +1,2 @@
1	+ "use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const Y=require("../utils/common.js");var L,F;function Z(){if(F)return L;F=1;var M=Y.__require(),c=15,U=852,j=592,A=0,x=1,C=2,J=[3,4,5,6,7,8,9,10,11,13,15,17,19,23,27,31,35,43,51,59,67,83,99,115,131,163,195,227,258,0,0],K=[16,16,16,16,16,16,16,16,17,17,17,17,18,18,18,18,19,19,19,19,20,20,20,20,21,21,21,21,16,72,78],Q=[1,2,3,4,5,7,9,13,17,25,33,49,65,97,129,193,257,385,513,769,1025,1537,2049,3073,4097,6145,8193,12289,16385,24577,0,0],V=[16,16,16,16,17,17,18,18,19,19,20,20,21,21,22,22,23,23,24,24,25,25,26,26,27,27,28,28,29,29,64,64];return L=function(S,E,I,P,h,d,s,G){var W=G.bits,r=0,a=0,u=0,e=0,f=0,t=0,i=0,n=0,b=0,v=0,o,m,N,H,_,O=null,R=0,q,l=new M.Buf16(c+1),T=new M.Buf16(c+1),B=null,X=0,z,D,g;for(r=0;r<=c;r++)l[r]=0;for(a=0;a<P;a++)l[E[I+a]]++;for(f=W,e=c;e>=1&&l[e]===0;e--);if(f>e&&(f=e),e===0)return h[d++]=1<<24\|64<<16\|0,h[d++]=1<<24\|64<<16\|0,G.bits=1,0;for(u=1;u<e&&l[u]===0;u++);for(f<u&&(f=u),n=1,r=1;r<=c;r++)if(n<<=1,n-=l[r],n<0)return-1;if(n>0&&(S===A\|\|e!==1))return-1;for(T[1]=0,r=1;r<c;r++)T[r+1]=T[r]+l[r];for(a=0;a<P;a++)E[I+a]!==0&&(s[T[E[I+a]]++]=a);if(S===A?(O=B=s,q=19):S===x?(O=J,R-=257,B=K,X-=257,q=256):(O=Q,B=V,q=-1),v=0,a=0,r=u,_=d,t=f,i=0,N=-1,b=1<<f,H=b-1,S===x&&b>U\|\|S===C&&b>j)return 1;for(;;){z=r-i,s[a]<q?(D=0,g=s[a]):s[a]>q?(D=B[X+s[a]],g=O[R+s[a]]):(D=96,g=0),o=1<<r-i,m=1<<t,u=m;do m-=o,h[_+(v>>i)+m]=z<<24\|D<<16\|g\|0;while(m!==0);for(o=1<<r-1;v&o;)o>>=1;if(o!==0?(v&=o-1,v+=o):v=0,a++,--l[r]===0){if(r===e)break;r=E[I+s[a]]}if(r>f&&(v&H)!==N){for(i===0&&(i=f),_+=u,t=r-i,n=1<<t;t+i<e&&(n-=l[t+i],!(n<=0));)t++,n<<=1;if(b+=1<<t,S===x&&b>U\|\|S===C&&b>j)return 1;N=v&H,h[N]=f<<24\|t<<16\|_-d\|0}}return v!==0&&(h[_+v]=r-i<<24\|64<<16\|0),G.bits=f,0},L}exports.__require=Z;
2	+ //# sourceMappingURL=inftrees.js.map

package/dist/node_modules/.pnpm/pako@1.0.11/node_modules/pako/lib/zlib/inftrees.js.map ADDED Viewed

@@ -0,0 +1 @@

+ {"version":3,"file":"inftrees.js","sources":["../../../../../../../../node_modules/.pnpm/pako@1.0.11/node_modules/pako/lib/zlib/inftrees.js"],"sourcesContent":["'use strict';\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n// claim that you wrote the original software. If you use this software\n// in a product, an acknowledgment in the product documentation would be\n// appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n// misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nvar utils = require('../utils/common');\n\nvar MAXBITS = 15;\nvar ENOUGH_LENS = 852;\nvar ENOUGH_DISTS = 592;\n//var ENOUGH = (ENOUGH_LENS+ENOUGH_DISTS);\n\nvar CODES = 0;\nvar LENS = 1;\nvar DISTS = 2;\n\nvar lbase = [ /* 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\nvar lext = [ /* 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\nvar dbase = [ /* 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\nvar dext = [ /* 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\nmodule.exports = function inflate_table(type, lens, lens_index, codes, table, table_index, work, opts)\n{\n var bits = opts.bits;\n //here = opts.here; /* table entry for duplication */\n\n var len = 0; /* a code's length in bits */\n var sym = 0; /* index of code symbols */\n var min = 0, max = 0; /* minimum and maximum code lengths */\n var root = 0; /* number of index bits for root table */\n var curr = 0; /* number of index bits for current table */\n var drop = 0; /* code bits to drop for sub-table */\n var left = 0; /* number of prefix codes available */\n var used = 0; /* code entries in table used */\n var huff = 0; /* Huffman code */\n var incr; /* for incrementing code, index */\n var fill; /* index for replicating entries */\n var low; /* low bits for current root entry */\n var mask; /* mask for low root bits */\n var next; /* next available space in table */\n var base = null; /* base value table to use */\n var base_index = 0;\n// var shoextra; /* extra bits table to use */\n var end; /* use base and extra for symbol > end */\n var count = new utils.Buf16(MAXBITS + 1); //[MAXBITS+1]; /* number of codes of each length */\n var offs = new utils.Buf16(MAXBITS + 1); //[MAXBITS+1]; /* offsets in table for each length */\n var extra = null;\n var extra_index = 0;\n\n var 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 || 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) {\n base = extra = work; /* dummy value--not used */\n end = 19;\n\n } else if (type === LENS) {\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 && used > ENOUGH_LENS) ||\n (type === DISTS && used > ENOUGH_DISTS)) {\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 && used > ENOUGH_LENS) ||\n (type === DISTS && used > ENOUGH_DISTS)) {\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"],"names":["utils","require$$0","MAXBITS","ENOUGH_LENS","ENOUGH_DISTS","CODES","LENS","DISTS","lbase","lext","dbase","dext","inftrees","type","lens","lens_index","codes","table","table_index","work","opts","bits","len","sym","min","max","root","curr","drop","left","used","huff","incr","fill","low","mask","next","base","base_index","end","count","offs","extra","extra_index","here_bits","here_op","here_val"],"mappings":"6JAqBA,IAAIA,EAAQC,EAAAA,UAA0B,EAElCC,EAAU,GACVC,EAAc,IACdC,EAAe,IAGfC,EAAQ,EACRC,EAAO,EACPC,EAAQ,EAERC,EAAQ,CACV,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,CAC9D,EAEGC,EAAO,CACT,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,EACzD,EAEGC,EAAQ,CACV,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,CAC/B,EAEGC,EAAO,CACT,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,EACrB,EAED,OAAAC,EAAiB,SAAuBC,EAAMC,EAAMC,EAAYC,EAAOC,EAAOC,EAAaC,EAAMC,EACjG,CACE,IAAIC,EAAOD,EAAK,KAGZE,EAAM,EACNC,EAAM,EACNC,EAAM,EAAGC,EAAM,EACfC,EAAO,EACPC,EAAO,EACPC,EAAO,EACPC,EAAO,EACPC,EAAO,EACPC,EAAO,EACPC,EACAC,EACAC,EACAC,EACAC,EACAC,EAAO,KACPC,EAAa,EAEbC,EACAC,EAAQ,IAAIxC,EAAM,MAAME,EAAU,CAAC,EACnCuC,EAAO,IAAIzC,EAAM,MAAME,EAAU,CAAC,EAClCwC,EAAQ,KACRC,EAAc,EAEdC,EAAWC,EAASC,EAkCxB,IAAKxB,EAAM,EAAGA,GAAOpB,EAASoB,IAC5BkB,EAAMlB,CAAG,EAAI,EAEf,IAAKC,EAAM,EAAGA,EAAMP,EAAOO,IACzBiB,EAAM1B,EAAKC,EAAaQ,CAAG,CAAC,IAK9B,IADAG,EAAOL,EACFI,EAAMvB,EAASuB,GAAO,GACrBe,EAAMf,CAAG,IAAM,EADSA,IAC5B,CAKF,GAHIC,EAAOD,IACTC,EAAOD,GAELA,IAAQ,EAIV,OAAAR,EAAMC,GAAa,EAAK,GAAK,GAAO,IAAM,GAAM,EAMhDD,EAAMC,GAAa,EAAK,GAAK,GAAO,IAAM,GAAM,EAEhDE,EAAK,KAAO,EACL,EAET,IAAKI,EAAM,EAAGA,EAAMC,GACde,EAAMhB,CAAG,IAAM,EADIA,IACvB,CAQF,IANIE,EAAOF,IACTE,EAAOF,GAITK,EAAO,EACFP,EAAM,EAAGA,GAAOpB,EAASoB,IAG5B,GAFAO,IAAS,EACTA,GAAQW,EAAMlB,CAAG,EACbO,EAAO,EACT,MAAO,GAGX,GAAIA,EAAO,IAAMhB,IAASR,GAASoB,IAAQ,GACzC,MAAO,GAKT,IADAgB,EAAK,CAAC,EAAI,EACLnB,EAAM,EAAGA,EAAMpB,EAASoB,IAC3BmB,EAAKnB,EAAM,CAAC,EAAImB,EAAKnB,CAAG,EAAIkB,EAAMlB,CAAG,EAIvC,IAAKC,EAAM,EAAGA,EAAMP,EAAOO,IACrBT,EAAKC,EAAaQ,CAAG,IAAM,IAC7BJ,EAAKsB,EAAK3B,EAAKC,EAAaQ,CAAG,CAAC,GAAG,EAAIA,GAmE3C,GA7BIV,IAASR,GACXgC,EAAOK,EAAQvB,EACfoB,EAAM,IAEG1B,IAASP,GAClB+B,EAAO7B,EACP8B,GAAc,IACdI,EAAQjC,EACRkC,GAAe,IACfJ,EAAM,MAGNF,EAAO3B,EACPgC,EAAQ/B,EACR4B,EAAM,IAIRR,EAAO,EACPR,EAAM,EACND,EAAME,EACNY,EAAOlB,EACPS,EAAOD,EACPE,EAAO,EACPM,EAAM,GACNJ,EAAO,GAAKJ,EACZS,EAAOL,EAAO,EAGTjB,IAASP,GAAQwB,EAAO3B,GAC1BU,IAASN,GAASuB,EAAO1B,EAC1B,MAAO,GAIT,OAAS,CAEPwC,EAAYtB,EAAMM,EACdT,EAAKI,CAAG,EAAIgB,GACdM,EAAU,EACVC,EAAW3B,EAAKI,CAAG,GAEZJ,EAAKI,CAAG,EAAIgB,GACnBM,EAAUH,EAAMC,EAAcxB,EAAKI,CAAG,CAAC,EACvCuB,EAAWT,EAAKC,EAAanB,EAAKI,CAAG,CAAC,IAGtCsB,EAAU,GACVC,EAAW,GAIbd,EAAO,GAAMV,EAAMM,EACnBK,EAAO,GAAKN,EACZH,EAAMS,EACN,GACEA,GAAQD,EACRf,EAAMmB,GAAQL,GAAQH,GAAQK,CAAI,EAAKW,GAAa,GAAOC,GAAW,GAAMC,EAAU,QAC/Eb,IAAS,GAIlB,IADAD,EAAO,GAAMV,EAAM,EACZS,EAAOC,GACZA,IAAS,EAWX,GATIA,IAAS,GACXD,GAAQC,EAAO,EACfD,GAAQC,GAERD,EAAO,EAITR,IACI,EAAEiB,EAAMlB,CAAG,IAAM,EAAG,CACtB,GAAIA,IAAQG,EAAO,MACnBH,EAAMR,EAAKC,EAAaI,EAAKI,CAAG,CAAC,EAInC,GAAID,EAAMI,IAASK,EAAOI,KAAUD,EAAK,CAYvC,IAVIN,IAAS,IACXA,EAAOF,GAITU,GAAQZ,EAGRG,EAAOL,EAAMM,EACbC,EAAO,GAAKF,EACLA,EAAOC,EAAOH,IACnBI,GAAQW,EAAMb,EAAOC,CAAI,EACrB,EAAAC,GAAQ,KACZF,IACAE,IAAS,EAKX,GADAC,GAAQ,GAAKH,EACRd,IAASP,GAAQwB,EAAO3B,GAC1BU,IAASN,GAASuB,EAAO1B,EAC1B,MAAO,GAIT8B,EAAMH,EAAOI,EAIblB,EAAMiB,CAAG,EAAKR,GAAQ,GAAOC,GAAQ,GAAOS,EAAOlB,EAAc,GAOrE,OAAIa,IAAS,IAIXd,EAAMmB,EAAOL,CAAI,EAAMT,EAAMM,GAAS,GAAO,IAAM,GAAK,GAK1DR,EAAK,KAAOM,EACL,CACR","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/pako@1.0.11/node_modules/pako/lib/zlib/messages.js ADDED Viewed

	@@ -0,0 +1,2 @@
1	+ "use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});var e,r;function i(){return r\|\|(r=1,e={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"}),e}exports.__require=i;
2	+ //# sourceMappingURL=messages.js.map

package/dist/node_modules/.pnpm/pako@1.0.11/node_modules/pako/lib/zlib/messages.js.map ADDED Viewed

@@ -0,0 +1 @@

+ {"version":3,"file":"messages.js","sources":["../../../../../../../../node_modules/.pnpm/pako@1.0.11/node_modules/pako/lib/zlib/messages.js"],"sourcesContent":["'use strict';\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n// claim that you wrote the original software. If you use this software\n// in a product, an acknowledgment in the product documentation would be\n// appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n// misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nmodule.exports = {\n 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"],"names":["messages"],"mappings":"oHAqBAA,EAAiB,CACf,EAAQ,kBACR,EAAQ,aACR,EAAQ,GACR,KAAQ,aACR,KAAQ,eACR,KAAQ,aACR,KAAQ,sBACR,KAAQ,eACR,KAAQ,sBACT","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/pako@1.0.11/node_modules/pako/lib/zlib/trees.js ADDED Viewed

	@@ -0,0 +1,2 @@
1	+ "use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const p=require("../../../../../../../_virtual/trees.js"),Ne=require("../utils/common.js");var oe;function Re(){if(oe)return p.__exports;oe=1;var de=Ne.__require(),ve=4,z=0,K=1,be=2;function x(e){for(var _=e.length;--_>=0;)e[_]=0}var ce=0,j=1,ue=2,he=3,pe=258,L=29,w=256,g=w+1+L,y=30,N=19,Y=2g+1,h=15,R=16,xe=7,k=256,F=16,G=17,U=18,B=[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],D=[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],ye=[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,3,7],W=[16,17,18,0,8,7,9,6,10,5,11,4,12,3,13,2,14,1,15],me=512,u=new Array((g+2)2);x(u);var E=new Array(y2);x(E);var T=new Array(me);x(T);var A=new Array(pe-he+1);x(A);var q=new Array(L);x(q);var C=new Array(y);x(C);function M(e,_,r,t,a){this.static_tree=e,this.extra_bits=_,this.extra_base=r,this.elems=t,this.max_length=a,this.has_stree=e&&e.length}var J,Q,V;function Z(e,_){this.dyn_tree=e,this.max_code=0,this.stat_desc=_}function $(e){return e<256?T[e]:T[256+(e>>>7)]}function S(e,_){e.pending_buf[e.pending++]=_&255,e.pending_buf[e.pending++]=_>>>8&255}function v(e,_,r){e.bi_valid>R-r?(e.bi_buf\|=_<<e.bi_valid&65535,S(e,e.bi_buf),e.bi_buf=_>>R-e.bi_valid,e.bi_valid+=r-R):(e.bi_buf\|=_<<e.bi_valid&65535,e.bi_valid+=r)}function c(e,_,r){v(e,r[_2],r[_2+1])}function s(e,_){var r=0;do r\|=e&1,e>>>=1,r<<=1;while(--_>0);return r>>>1}function we(e){e.bi_valid===16?(S(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)}function ge(e,_){var r=_.dyn_tree,t=_.max_code,a=_.stat_desc.static_tree,i=_.stat_desc.has_stree,n=_.stat_desc.extra_bits,l=_.stat_desc.extra_base,o=_.stat_desc.max_length,f,b,m,d,O,H,I=0;for(d=0;d<=h;d++)e.bl_count[d]=0;for(r[e.heap[e.heap_max]2+1]=0,f=e.heap_max+1;f<Y;f++)b=e.heap[f],d=r[r[b2+1]2+1]+1,d>o&&(d=o,I++),r[b2+1]=d,!(b>t)&&(e.bl_count[d]++,O=0,b>=l&&(O=n[b-l]),H=r[b2],e.opt_len+=H(d+O),i&&(e.static_len+=H(a[b2+1]+O)));if(I!==0){do{for(d=o-1;e.bl_count[d]===0;)d--;e.bl_count[d]--,e.bl_count[d+1]+=2,e.bl_count[o]--,I-=2}while(I>0);for(d=o;d!==0;d--)for(b=e.bl_count[d];b!==0;)m=e.heap[--f],!(m>t)&&(r[m2+1]!==d&&(e.opt_len+=(d-r[m2+1])r[m2],r[m2+1]=d),b--)}}function ee(e,_,r){var t=new Array(h+1),a=0,i,n;for(i=1;i<=h;i++)t[i]=a=a+r[i-1]<<1;for(n=0;n<=_;n++){var l=e[n2+1];l!==0&&(e[n2]=s(t[l]++,l))}}function Ee(){var e,_,r,t,a,i=new Array(h+1);for(r=0,t=0;t<L-1;t++)for(q[t]=r,e=0;e<1<<B[t];e++)A[r++]=t;for(A[r-1]=t,a=0,t=0;t<16;t++)for(C[t]=a,e=0;e<1<<D[t];e++)T[a++]=t;for(a>>=7;t<y;t++)for(C[t]=a<<7,e=0;e<1<<D[t]-7;e++)T[256+a++]=t;for(_=0;_<=h;_++)i[_]=0;for(e=0;e<=143;)u[e2+1]=8,e++,i[8]++;for(;e<=255;)u[e2+1]=9,e++,i[9]++;for(;e<=279;)u[e2+1]=7,e++,i[7]++;for(;e<=287;)u[e2+1]=8,e++,i[8]++;for(ee(u,g+1,i),e=0;e<y;e++)E[e2+1]=5,E[e2]=s(e,5);J=new M(u,B,w+1,g,h),Q=new M(E,D,0,y,h),V=new M(new Array(0),ye,0,N,xe)}function _e(e){var _;for(_=0;_<g;_++)e.dyn_ltree[_2]=0;for(_=0;_<y;_++)e.dyn_dtree[_2]=0;for(_=0;_<N;_++)e.bl_tree[_2]=0;e.dyn_ltree[k2]=1,e.opt_len=e.static_len=0,e.last_lit=e.matches=0}function re(e){e.bi_valid>8?S(e,e.bi_buf):e.bi_valid>0&&(e.pending_buf[e.pending++]=e.bi_buf),e.bi_buf=0,e.bi_valid=0}function Te(e,_,r,t){re(e),S(e,r),S(e,~r),de.arraySet(e.pending_buf,e.window,_,r,e.pending),e.pending+=r}function te(e,_,r,t){var a=_2,i=r2;return e[a]<e[i]\|\|e[a]===e[i]&&t[_]<=t[r]}function P(e,_,r){for(var t=e.heap[r],a=r<<1;a<=e.heap_len&&(a<e.heap_len&&te(_,e.heap[a+1],e.heap[a],e.depth)&&a++,!te(_,t,e.heap[a],e.depth));)e.heap[r]=e.heap[a],r=a,a<<=1;e.heap[r]=t}function ae(e,_,r){var t,a,i=0,n,l;if(e.last_lit!==0)do t=e.pending_buf[e.d_buf+i2]<<8\|e.pending_buf[e.d_buf+i2+1],a=e.pending_buf[e.l_buf+i],i++,t===0?c(e,a,_):(n=A[a],c(e,n+w+1,_),l=B[n],l!==0&&(a-=q[n],v(e,a,l)),t--,n=$(t),c(e,n,r),l=D[n],l!==0&&(t-=C[n],v(e,t,l)));while(i<e.last_lit);c(e,k,_)}function X(e,_){var r=_.dyn_tree,t=_.stat_desc.static_tree,a=_.stat_desc.has_stree,i=_.stat_desc.elems,n,l,o=-1,f;for(e.heap_len=0,e.heap_max=Y,n=0;n<i;n++)r[n2]!==0?(e.heap[++e.heap_len]=o=n,e.depth[n]=0):r[n2+1]=0;for(;e.heap_len<2;)f=e.heap[++e.heap_len]=o<2?++o:0,r[f2]=1,e.depth[f]=0,e.opt_len--,a&&(e.static_len-=t[f2+1]);for(_.max_code=o,n=e.heap_len>>1;n>=1;n--)P(e,r,n);f=i;do n=e.heap[1],e.heap[1]=e.heap[e.heap_len--],P(e,r,1),l=e.heap[1],e.heap[--e.heap_max]=n,e.heap[--e.heap_max]=l,r[f2]=r[n2]+r[l2],e.depth[f]=(e.depth[n]>=e.depth[l]?e.depth[n]:e.depth[l])+1,r[n2+1]=r[l2+1]=f,e.heap[1]=f++,P(e,r,1);while(e.heap_len>=2);e.heap[--e.heap_max]=e.heap[1],ge(e,_),ee(r,o,e.bl_count)}function ne(e,_,r){var t,a=-1,i,n=_[02+1],l=0,o=7,f=4;for(n===0&&(o=138,f=3),_[(r+1)2+1]=65535,t=0;t<=r;t++)i=n,n=_[(t+1)2+1],!(++l<o&&i===n)&&(l<f?e.bl_tree[i2]+=l:i!==0?(i!==a&&e.bl_tree[i2]++,e.bl_tree[F2]++):l<=10?e.bl_tree[G2]++:e.bl_tree[U2]++,l=0,a=i,n===0?(o=138,f=3):i===n?(o=6,f=3):(o=7,f=4))}function ie(e,_,r){var t,a=-1,i,n=_[02+1],l=0,o=7,f=4;for(n===0&&(o=138,f=3),t=0;t<=r;t++)if(i=n,n=_[(t+1)2+1],!(++l<o&&i===n)){if(l<f)do c(e,i,e.bl_tree);while(--l!==0);else i!==0?(i!==a&&(c(e,i,e.bl_tree),l--),c(e,F,e.bl_tree),v(e,l-3,2)):l<=10?(c(e,G,e.bl_tree),v(e,l-3,3)):(c(e,U,e.bl_tree),v(e,l-11,7));l=0,a=i,n===0?(o=138,f=3):i===n?(o=6,f=3):(o=7,f=4)}}function Ae(e){var _;for(ne(e,e.dyn_ltree,e.l_desc.max_code),ne(e,e.dyn_dtree,e.d_desc.max_code),X(e,e.bl_desc),_=N-1;_>=3&&e.bl_tree[W[_]2+1]===0;_--);return e.opt_len+=3(_+1)+5+5+4,_}function Se(e,_,r,t){var a;for(v(e,_-257,5),v(e,r-1,5),v(e,t-4,4),a=0;a<t;a++)v(e,e.bl_tree[W[a]2+1],3);ie(e,e.dyn_ltree,_-1),ie(e,e.dyn_dtree,r-1)}function De(e){var _=4093624447,r;for(r=0;r<=31;r++,_>>>=1)if(_&1&&e.dyn_ltree[r2]!==0)return z;if(e.dyn_ltree[92]!==0\|\|e.dyn_ltree[102]!==0\|\|e.dyn_ltree[132]!==0)return K;for(r=32;r<w;r++)if(e.dyn_ltree[r2]!==0)return K;return z}var le=!1;function Ce(e){le\|\|(Ee(),le=!0),e.l_desc=new Z(e.dyn_ltree,J),e.d_desc=new Z(e.dyn_dtree,Q),e.bl_desc=new Z(e.bl_tree,V),e.bi_buf=0,e.bi_valid=0,_e(e)}function fe(e,_,r,t){v(e,(ce<<1)+(t?1:0),3),Te(e,_,r)}function Oe(e){v(e,j<<1,3),c(e,k,u),we(e)}function Ie(e,_,r,t){var a,i,n=0;e.level>0?(e.strm.data_type===be&&(e.strm.data_type=De(e)),X(e,e.l_desc),X(e,e.d_desc),n=Ae(e),a=e.opt_len+3+7>>>3,i=e.static_len+3+7>>>3,i<=a&&(a=i)):a=i=r+5,r+4<=a&&_!==-1?fe(e,_,r,t):e.strategy===ve\|\|i===a?(v(e,(j<<1)+(t?1:0),3),ae(e,u,E)):(v(e,(ue<<1)+(t?1:0),3),Se(e,e.l_desc.max_code+1,e.d_desc.max_code+1,n+1),ae(e,e.dyn_ltree,e.dyn_dtree)),_e(e),t&&re(e)}function Le(e,_,r){return e.pending_buf[e.d_buf+e.last_lit2]=_>>>8&255,e.pending_buf[e.d_buf+e.last_lit2+1]=_&255,e.pending_buf[e.l_buf+e.last_lit]=r&255,e.last_lit++,_===0?e.dyn_ltree[r2]++:(e.matches++,_--,e.dyn_ltree[(A[r]+w+1)2]++,e.dyn_dtree[$(_)2]++),e.last_lit===e.lit_bufsize-1}return p.__exports._tr_init=Ce,p.__exports._tr_stored_block=fe,p.__exports._tr_flush_block=Ie,p.__exports._tr_tally=Le,p.__exports._tr_align=Oe,p.__exports}exports.__require=Re;
2	+ //# sourceMappingURL=trees.js.map

package/dist/node_modules/.pnpm/pako@1.0.11/node_modules/pako/lib/zlib/trees.js.map ADDED Viewed

@@ -0,0 +1 @@

+ {"version":3,"file":"trees.js","sources":["../../../../../../../../node_modules/.pnpm/pako@1.0.11/node_modules/pako/lib/zlib/trees.js"],"sourcesContent":["'use strict';\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n// claim that you wrote the original software. If you use this software\n// in a product, an acknowledgment in the product documentation would be\n// appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n// misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\n/* eslint-disable space-unary-ops */\n\nvar utils = require('../utils/common');\n\n/* Public constants ==========================================================*/\n/* ===========================================================================*/\n\n\n//var Z_FILTERED = 1;\n//var Z_HUFFMAN_ONLY = 2;\n//var Z_RLE = 3;\nvar Z_FIXED = 4;\n//var Z_DEFAULT_STRATEGY = 0;\n\n/* Possible values of the data_type field (though see inflate()) */\nvar Z_BINARY = 0;\nvar Z_TEXT = 1;\n//var Z_ASCII = 1; // = Z_TEXT\nvar Z_UNKNOWN = 2;\n\n/*============================================================================*/\n\n\nfunction zero(buf) { var len = buf.length; while (--len >= 0) { buf[len] = 0; } }\n\n// From zutil.h\n\nvar STORED_BLOCK = 0;\nvar STATIC_TREES = 1;\nvar DYN_TREES = 2;\n/* The three kinds of block type */\n\nvar MIN_MATCH = 3;\nvar MAX_MATCH = 258;\n/* The minimum and maximum match lengths */\n\n// From deflate.h\n/* ===========================================================================\n * Internal compression state.\n */\n\nvar LENGTH_CODES = 29;\n/* number of length codes, not counting the special END_BLOCK code */\n\nvar LITERALS = 256;\n/* number of literal bytes 0..255 */\n\nvar L_CODES = LITERALS + 1 + LENGTH_CODES;\n/* number of Literal or Length codes, including the END_BLOCK code */\n\nvar D_CODES = 30;\n/* number of distance codes */\n\nvar BL_CODES = 19;\n/* number of codes used to transfer the bit lengths */\n\nvar HEAP_SIZE = 2 * L_CODES + 1;\n/* maximum heap size */\n\nvar MAX_BITS = 15;\n/* All codes must not exceed MAX_BITS bits */\n\nvar Buf_size = 16;\n/* size of bit buffer in bi_buf */\n\n\n/* ===========================================================================\n * Constants\n */\n\nvar MAX_BL_BITS = 7;\n/* Bit length codes must not exceed MAX_BL_BITS bits */\n\nvar END_BLOCK = 256;\n/* end of block literal code */\n\nvar REP_3_6 = 16;\n/* repeat previous bit length 3-6 times (2 bits of repeat count) */\n\nvar REPZ_3_10 = 17;\n/* repeat a zero length 3-10 times (3 bits of repeat count) */\n\nvar 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 */\nvar extra_lbits = /* extra bits for each length code */\n [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\nvar extra_dbits = /* extra bits for each distance code */\n [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\nvar extra_blbits = /* extra bits for each bit length code */\n [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,3,7];\n\nvar bl_order =\n [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\nvar 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\nvar static_ltree = new Array((L_CODES + 2) * 2);\nzero(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\nvar static_dtree = new Array(D_CODES * 2);\nzero(static_dtree);\n/* The static distance tree. (Actually a trivial tree since all codes use\n * 5 bits.)\n */\n\nvar _dist_code = new Array(DIST_CODE_LEN);\nzero(_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\nvar _length_code = new Array(MAX_MATCH - MIN_MATCH + 1);\nzero(_length_code);\n/* length code for each normalized match length (0 == MIN_MATCH) */\n\nvar base_length = new Array(LENGTH_CODES);\nzero(base_length);\n/* First normalized length for each code (0 = MIN_MATCH) */\n\nvar base_dist = new Array(D_CODES);\nzero(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\nvar static_l_desc;\nvar static_d_desc;\nvar 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\nfunction d_code(dist) {\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 */\nfunction 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 */\nfunction send_bits(s, value, length) {\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\nfunction send_code(s, c, tree) {\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 */\nfunction bi_reverse(code, len) {\n var 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 */\nfunction bi_flush(s) {\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 */\nfunction gen_bitlen(s, desc)\n// deflate_state *s;\n// tree_desc *desc; /* the tree descriptor */\n{\n var tree = desc.dyn_tree;\n var max_code = desc.max_code;\n var stree = desc.stat_desc.static_tree;\n var has_stree = desc.stat_desc.has_stree;\n var extra = desc.stat_desc.extra_bits;\n var base = desc.stat_desc.extra_base;\n var max_length = desc.stat_desc.max_length;\n var h; /* heap index */\n var n, m; /* iterate over the tree elements */\n var bits; /* bit length */\n var xbits; /* extra bits */\n var f; /* frequency */\n var overflow = 0; /* number of elements with bit length too large */\n\n for (bits = 0; bits <= MAX_BITS; 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; 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 */\nfunction 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 var next_code = new Array(MAX_BITS + 1); /* next code value for each bit length */\n var code = 0; /* running code value */\n var bits; /* bit index */\n var 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; 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<<MAX_BITS)-1,\n // \"inconsistent bit counts\");\n //Tracev((stderr,\"\\ngen_codes: max_code %d \", max_code));\n\n for (n = 0; n <= max_code; n++) {\n var len = tree[n * 2 + 1]/*.Len*/;\n if (len === 0) { continue; }\n /* Now reverse the bits */\n tree[n * 2]/*.Code*/ = bi_reverse(next_code[len]++, len);\n\n //Tracecv(tree != static_ltree, (stderr,\"\\nn %3d %c l %2d c %4x (%x) \",\n // n, (isgraph(n) ? n : ' '), len, tree[n].Code, next_code[len]-1));\n }\n}\n\n\n/* ===========================================================================\n * Initialize the various 'constant' tables.\n */\nfunction tr_static_init() {\n var n; /* iterates over tree elements */\n var bits; /* bit counter */\n var length; /* length value */\n var code; /* code value */\n var dist; /* distance index */\n var bl_count = new Array(MAX_BITS + 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; 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; 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; 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, bl_count);\n\n /* The static distance tree is trivial: */\n for (n = 0; n < D_CODES; 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, L_CODES, MAX_BITS);\n static_d_desc = new StaticTreeDesc(static_dtree, extra_dbits, 0, D_CODES, MAX_BITS);\n static_bl_desc = new StaticTreeDesc(new Array(0), extra_blbits, 0, BL_CODES, MAX_BL_BITS);\n\n //static_init_done = true;\n}\n\n\n/* ===========================================================================\n * Initialize a new block.\n */\nfunction init_block(s) {\n var n; /* iterates over tree elements */\n\n /* Initialize the trees. */\n for (n = 0; n < L_CODES; n++) { s.dyn_ltree[n * 2]/*.Freq*/ = 0; }\n for (n = 0; n < D_CODES; n++) { s.dyn_dtree[n * 2]/*.Freq*/ = 0; }\n for (n = 0; n < BL_CODES; 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 */\nfunction 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 */\nfunction 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 utils.arraySet(s.pending_buf, s.window, 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 */\nfunction smaller(tree, n, m, depth) {\n var _n2 = n * 2;\n var _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 */\nfunction 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 var v = s.heap[k];\n var 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// var SMALLEST = 1;\n\n/* ===========================================================================\n * Send the block data compressed using the given Huffman trees\n */\nfunction 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 var dist; /* distance of matched string */\n var lc; /* match length or unmatched char (if dist == 0) */\n var lx = 0; /* running index in l_buf */\n var code; /* the code to send */\n var 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, 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 */\nfunction build_tree(s, desc)\n// deflate_state *s;\n// tree_desc *desc; /* the tree descriptor */\n{\n var tree = desc.dyn_tree;\n var stree = desc.stat_desc.static_tree;\n var has_stree = desc.stat_desc.has_stree;\n var elems = desc.stat_desc.elems;\n var n, m; /* iterate over heap elements */\n var max_code = -1; /* largest code with non zero frequency */\n var 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;\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 */\nfunction 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 var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var 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 */\nfunction 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 var n; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var 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 */\nfunction build_bl_tree(s) {\n var 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; 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 */\nfunction send_all_trees(s, lcodes, dcodes, blcodes)\n// deflate_state *s;\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\n{\n var 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 */\nfunction 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 var black_mask = 0xf3ffc07f;\n var 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; 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\nvar static_init_done = false;\n\n/* ===========================================================================\n * Initialize the tree data structures for a new zlib stream.\n */\nfunction _tr_init(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 */\nfunction _tr_stored_block(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 */\nfunction _tr_align(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 */\nfunction _tr_flush_block(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 var opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n var 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) {\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(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED || 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 */\nfunction _tr_tally(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 //var 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) * 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\nexports._tr_init = _tr_init;\nexports._tr_stored_block = _tr_stored_block;\nexports._tr_flush_block = _tr_flush_block;\nexports._tr_tally = _tr_tally;\nexports._tr_align = _tr_align;\n"],"names":["utils","require$$0","Z_FIXED","Z_BINARY","Z_TEXT","Z_UNKNOWN","zero","buf","len","STORED_BLOCK","STATIC_TREES","DYN_TREES","MIN_MATCH","MAX_MATCH","LENGTH_CODES","LITERALS","L_CODES","D_CODES","BL_CODES","HEAP_SIZE","MAX_BITS","Buf_size","MAX_BL_BITS","END_BLOCK","REP_3_6","REPZ_3_10","REPZ_11_138","extra_lbits","extra_dbits","extra_blbits","bl_order","DIST_CODE_LEN","static_ltree","static_dtree","_dist_code","_length_code","base_length","base_dist","StaticTreeDesc","static_tree","extra_bits","extra_base","elems","max_length","static_l_desc","static_d_desc","static_bl_desc","TreeDesc","dyn_tree","stat_desc","d_code","dist","put_short","s","w","send_bits","value","length","send_code","c","tree","bi_reverse","code","res","bi_flush","gen_bitlen","desc","max_code","stree","has_stree","extra","base","h","n","bits","xbits","f","overflow","gen_codes","bl_count","next_code","tr_static_init","init_block","bi_windup","copy_block","header","smaller","m","depth","_n2","_m2","pqdownheap","k","v","j","compress_block","ltree","dtree","lc","lx","build_tree","node","scan_tree","prevlen","curlen","nextlen","count","max_count","min_count","send_tree","build_bl_tree","max_blindex","send_all_trees","lcodes","dcodes","blcodes","rank","detect_data_type","black_mask","static_init_done","_tr_init","_tr_stored_block","stored_len","last","_tr_align","_tr_flush_block","opt_lenb","static_lenb","_tr_tally","trees"],"mappings":"8NAuBA,IAAIA,GAAQC,GAAAA,UAAyB,EASjCC,GAAwB,EAIxBC,EAAwB,EACxBC,EAAwB,EAExBC,GAAwB,EAK5B,SAASC,EAAKC,EAAK,CAA+B,QAAzBC,EAAMD,EAAI,OAAe,EAAEC,GAAO,GAAKD,EAAIC,CAAG,EAAI,EAI3E,IAAIC,GAAe,EACfC,EAAe,EACfC,GAAe,EAGfC,GAAe,EACfC,GAAe,IAQfC,EAAgB,GAGhBC,EAAgB,IAGhBC,EAAgBD,EAAW,EAAID,EAG/BG,EAAgB,GAGhBC,EAAgB,GAGhBC,EAAgB,EAAIH,EAAU,EAG9BI,EAAgB,GAGhBC,EAAgB,GAQhBC,GAAc,EAGdC,EAAc,IAGdC,EAAc,GAGdC,EAAc,GAGdC,EAAc,GAIdC,EACF,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,EAExDC,EACF,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,EAElEC,GACF,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,EAEpCC,EACF,CAAC,GAAG,GAAG,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,EAa7CC,GAAgB,IAGhBC,EAAgB,IAAI,OAAOhB,EAAU,GAAK,CAAC,EAC/CV,EAAK0B,CAAY,EAOjB,IAAIC,EAAgB,IAAI,MAAMhB,EAAU,CAAC,EACzCX,EAAK2B,CAAY,EAKjB,IAAIC,EAAgB,IAAI,MAAMH,EAAa,EAC3CzB,EAAK4B,CAAU,EAMf,IAAIC,EAAgB,IAAI,MAAMtB,GAAYD,GAAY,CAAC,EACvDN,EAAK6B,CAAY,EAGjB,IAAIC,EAAgB,IAAI,MAAMtB,CAAY,EAC1CR,EAAK8B,CAAW,EAGhB,IAAIC,EAAgB,IAAI,MAAMpB,CAAO,EACrCX,EAAK+B,CAAS,EAId,SAASC,EAAeC,EAAaC,EAAYC,EAAYC,EAAOC,EAAY,CAE9E,KAAK,YAAeJ,EACpB,KAAK,WAAeC,EACpB,KAAK,WAAeC,EACpB,KAAK,MAAeC,EACpB,KAAK,WAAeC,EAGf,KAAA,UAAeJ,GAAeA,EAAY,OAIjD,IAAIK,EACAC,EACAC,EAGJ,SAASC,EAASC,EAAUC,EAAW,CACrC,KAAK,SAAWD,EAChB,KAAK,SAAW,EAChB,KAAK,UAAYC,EAKnB,SAASC,EAAOC,EAAM,CACb,OAAAA,EAAO,IAAMjB,EAAWiB,CAAI,EAAIjB,EAAW,KAAOiB,IAAS,EAAE,EAQtE,SAASC,EAAUC,EAAGC,EAAG,CAGvBD,EAAE,YAAYA,EAAE,SAAS,EAAKC,EAAK,IACnCD,EAAE,YAAYA,EAAE,SAAS,EAAKC,IAAM,EAAK,IAQ3C,SAASC,EAAUF,EAAGG,EAAOC,EAAQ,CAC/BJ,EAAE,SAAYhC,EAAWoC,GACzBJ,EAAA,QAAWG,GAASH,EAAE,SAAY,MAC1BD,EAAAC,EAAGA,EAAE,MAAM,EACnBA,EAAA,OAASG,GAAUnC,EAAWgC,EAAE,SAClCA,EAAE,UAAYI,EAASpC,IAErBgC,EAAA,QAAWG,GAASH,EAAE,SAAY,MACpCA,EAAE,UAAYI,GAKlB,SAASC,EAAUL,EAAGM,EAAGC,EAAM,CAC7BL,EAAUF,EAAGO,EAAKD,EAAI,CAAC,EAAYC,EAAKD,EAAI,EAAI,CAAC,CAAS,EAS5D,SAASE,EAAWC,EAAMtD,EAAK,CAC7B,IAAIuD,EAAM,EACP,GACDA,GAAOD,EAAO,EACJA,KAAA,EACFC,IAAA,QACD,EAAEvD,EAAM,GACjB,OAAOuD,IAAQ,EAOjB,SAASC,GAASX,EAAG,CACfA,EAAE,WAAa,IACPD,EAAAC,EAAGA,EAAE,MAAM,EACrBA,EAAE,OAAS,EACXA,EAAE,SAAW,GAEJA,EAAE,UAAY,IACvBA,EAAE,YAAYA,EAAE,SAAS,EAAIA,EAAE,OAAS,IACxCA,EAAE,SAAW,EACbA,EAAE,UAAY,GAelB,SAASY,GAAWZ,EAAGa,EAGvB,CACE,IAAIN,EAAkBM,EAAK,SACvBC,EAAkBD,EAAK,SACvBE,EAAkBF,EAAK,UAAU,YACjCG,EAAkBH,EAAK,UAAU,UACjCI,EAAkBJ,EAAK,UAAU,WACjCK,EAAkBL,EAAK,UAAU,WACjCvB,EAAkBuB,EAAK,UAAU,WACjCM,EACAC,EAAG,EACHC,EACAC,EACAC,EACAC,EAAW,EAEf,IAAKH,EAAO,EAAGA,GAAQtD,EAAUsD,IAC7BrB,EAAA,SAASqB,CAAI,EAAI,EAQrB,IAFAd,EAAKP,EAAE,KAAKA,EAAE,QAAQ,EAAI,EAAI,CAAC,EAAY,EAEtCmB,EAAInB,EAAE,SAAW,EAAGmB,EAAIrD,EAAWqD,IAClCC,EAAApB,EAAE,KAAKmB,CAAC,EACLE,EAAAd,EAAKA,EAAKa,EAAI,EAAI,CAAC,EAAY,EAAI,CAAC,EAAY,EACnDC,EAAO/B,IACF+B,EAAA/B,EACPkC,KAEGjB,EAAAa,EAAI,EAAI,CAAC,EAAYC,EAGtB,EAAAD,EAAIN,KAERd,EAAE,SAASqB,CAAI,IACPC,EAAA,EACJF,GAAKF,IACCI,EAAAL,EAAMG,EAAIF,CAAI,GAEpBK,EAAAhB,EAAKa,EAAI,CAAC,EACZpB,EAAA,SAAWuB,GAAKF,EAAOC,GACrBN,IACFhB,EAAE,YAAcuB,GAAKR,EAAMK,EAAI,EAAI,CAAC,EAAYE,KAGpD,GAAIE,IAAa,EAMd,GAAA,CAED,IADAH,EAAO/B,EAAa,EACbU,EAAE,SAASqB,CAAI,IAAM,GAAKA,IACjCrB,EAAE,SAASqB,CAAI,IACbrB,EAAA,SAASqB,EAAO,CAAC,GAAK,EACxBrB,EAAE,SAASV,CAAU,IAITkC,GAAA,QACLA,EAAW,GAOpB,IAAKH,EAAO/B,EAAY+B,IAAS,EAAGA,IAElC,IADID,EAAApB,EAAE,SAASqB,CAAI,EACZD,IAAM,GACP,EAAApB,EAAE,KAAK,EAAEmB,CAAC,EACV,IAAIL,KACJP,EAAK,EAAI,EAAI,CAAC,IAAcc,IAE5BrB,EAAA,UAAYqB,EAAOd,EAAK,EAAI,EAAI,CAAC,GAAaA,EAAK,EAAI,CAAC,EACrDA,EAAA,EAAI,EAAI,CAAC,EAAYc,GAE5BD,MAcN,SAASK,GAAUlB,EAAMO,EAAUY,EAInC,CACE,IAAIC,EAAY,IAAI,MAAM5D,EAAW,CAAC,EAClC0C,EAAO,EACPY,EACA,EAKJ,IAAKA,EAAO,EAAGA,GAAQtD,EAAUsD,IAC/BM,EAAUN,CAAI,EAAIZ,EAAQA,EAAOiB,EAASL,EAAO,CAAC,GAAM,EAS1D,IAAK,EAAI,EAAI,GAAKP,EAAU,IAAK,CAC/B,IAAI3D,EAAMoD,EAAK,EAAI,EAAI,CAAC,EACpBpD,IAAQ,IAEZoD,EAAK,EAAI,CAAC,EAAaC,EAAWmB,EAAUxE,CAAG,IAAKA,CAAG,IAW3D,SAASyE,IAAiB,CACpB,IAAAR,EACAC,EACAjB,EACAK,EACAX,EACA4B,EAAW,IAAI,MAAM3D,EAAW,CAAC,EAiBrC,IADSqC,EAAA,EACJK,EAAO,EAAGA,EAAOhD,EAAe,EAAGgD,IAEtC,IADA1B,EAAY0B,CAAI,EAAIL,EACfgB,EAAI,EAAGA,EAAK,GAAK9C,EAAYmC,CAAI,EAAIW,IACxCtC,EAAasB,GAAQ,EAAIK,EAY7B,IAJa3B,EAAAsB,EAAS,CAAC,EAAIK,EAGpBX,EAAA,EACFW,EAAO,EAAGA,EAAO,GAAIA,IAExB,IADAzB,EAAUyB,CAAI,EAAIX,EACbsB,EAAI,EAAGA,EAAK,GAAK7C,EAAYkC,CAAI,EAAIW,IACxCvC,EAAWiB,GAAM,EAAIW,EAKlB,IADEX,IAAA,EACFW,EAAO7C,EAAS6C,IAEhB,IADKzB,EAAAyB,CAAI,EAAIX,GAAQ,EACrBsB,EAAI,EAAGA,EAAK,GAAM7C,EAAYkC,CAAI,EAAI,EAAKW,IACnCvC,EAAA,IAAMiB,GAAM,EAAIW,EAM/B,IAAKY,EAAO,EAAGA,GAAQtD,EAAUsD,IAC/BK,EAASL,CAAI,EAAI,EAInB,IADID,EAAA,EACGA,GAAK,KACGzC,EAAAyC,EAAI,EAAI,CAAC,EAAY,EAClCA,IACAM,EAAS,CAAC,IAEZ,KAAON,GAAK,KACGzC,EAAAyC,EAAI,EAAI,CAAC,EAAY,EAClCA,IACAM,EAAS,CAAC,IAEZ,KAAON,GAAK,KACGzC,EAAAyC,EAAI,EAAI,CAAC,EAAY,EAClCA,IACAM,EAAS,CAAC,IAEZ,KAAON,GAAK,KACGzC,EAAAyC,EAAI,EAAI,CAAC,EAAY,EAClCA,IACAM,EAAS,CAAC,IASZ,IAHUD,GAAA9C,EAAchB,EAAU,EAAG+D,CAAQ,EAGxCN,EAAI,EAAGA,EAAIxD,EAASwD,IACVxC,EAAAwC,EAAI,EAAI,CAAC,EAAY,EAClCxC,EAAawC,EAAI,CAAC,EAAaZ,EAAWY,EAAG,CAAC,EAIhD7B,EAAgB,IAAIN,EAAeN,EAAcL,EAAaZ,EAAW,EAAGC,EAASI,CAAQ,EAC7FyB,EAAgB,IAAIP,EAAeL,EAAcL,EAAa,EAAYX,EAASG,CAAQ,EAC1E0B,EAAA,IAAIR,EAAe,IAAI,MAAM,CAAC,EAAGT,GAAc,EAAWX,EAAUI,EAAW,EASlG,SAAS4D,GAAW7B,EAAG,CACjB,IAAAoB,EAGJ,IAAKA,EAAI,EAAGA,EAAIzD,EAAUyD,IAASpB,EAAA,UAAUoB,EAAI,CAAC,EAAa,EAC/D,IAAKA,EAAI,EAAGA,EAAIxD,EAAUwD,IAASpB,EAAA,UAAUoB,EAAI,CAAC,EAAa,EAC/D,IAAKA,EAAI,EAAGA,EAAIvD,EAAUuD,IAASpB,EAAA,QAAQoB,EAAI,CAAC,EAAa,EAE3DpB,EAAA,UAAU9B,EAAY,CAAC,EAAa,EACpC8B,EAAA,QAAUA,EAAE,WAAa,EACzBA,EAAA,SAAWA,EAAE,QAAU,EAO3B,SAAS8B,GAAU9B,EACnB,CACMA,EAAE,SAAW,EACLD,EAAAC,EAAGA,EAAE,MAAM,EACZA,EAAE,SAAW,IAEtBA,EAAE,YAAYA,EAAE,SAAS,EAAIA,EAAE,QAEjCA,EAAE,OAAS,EACXA,EAAE,SAAW,EAOf,SAAS+B,GAAW/B,EAAG9C,EAAKC,EAAK6E,EAKjC,CACEF,GAAU9B,CAAC,EAGTD,EAAUC,EAAG7C,CAAG,EACN4C,EAAAC,EAAG,CAAC7C,CAAG,EAKbR,GAAA,SAASqD,EAAE,YAAaA,EAAE,OAAQ9C,EAAKC,EAAK6C,EAAE,OAAO,EAC3DA,EAAE,SAAW7C,EAOf,SAAS8E,GAAQ1B,EAAMa,EAAGc,EAAGC,EAAO,CAClC,IAAIC,EAAMhB,EAAI,EACViB,EAAMH,EAAI,EACd,OAAQ3B,EAAK6B,CAAG,EAAa7B,EAAK8B,CAAG,GAC7B9B,EAAK6B,CAAG,IAAe7B,EAAK8B,CAAG,GAAcF,EAAMf,CAAC,GAAKe,EAAMD,CAAC,EAS1E,SAASI,EAAWtC,EAAGO,EAAMgC,EAI7B,CAGS,QAFHC,EAAIxC,EAAE,KAAKuC,CAAC,EACZE,EAAIF,GAAK,EACNE,GAAKzC,EAAE,WAERyC,EAAIzC,EAAE,UACRiC,GAAQ1B,EAAMP,EAAE,KAAKyC,EAAI,CAAC,EAAGzC,EAAE,KAAKyC,CAAC,EAAGzC,EAAE,KAAK,GAC/CyC,IAGE,CAAAR,GAAQ1B,EAAMiC,EAAGxC,EAAE,KAAKyC,CAAC,EAAGzC,EAAE,KAAK,IAGvCA,EAAE,KAAKuC,CAAC,EAAIvC,EAAE,KAAKyC,CAAC,EAChBF,EAAAE,EAGEA,IAAA,EAENzC,EAAA,KAAKuC,CAAC,EAAIC,EAUd,SAASE,GAAe1C,EAAG2C,EAAOC,EAIlC,CACM,IAAA9C,EACA+C,EACAC,EAAK,EACLrC,EACAQ,EAEA,GAAAjB,EAAE,WAAa,EACd,GACDF,EAAQE,EAAE,YAAYA,EAAE,MAAQ8C,EAAK,CAAC,GAAK,EAAM9C,EAAE,YAAYA,EAAE,MAAQ8C,EAAK,EAAI,CAAC,EACnFD,EAAK7C,EAAE,YAAYA,EAAE,MAAQ8C,CAAE,EAC/BA,IAEIhD,IAAS,EACDO,EAAAL,EAAG6C,EAAIF,CAAK,GAItBlC,EAAO3B,EAAa+D,CAAE,EACtBxC,EAAUL,EAAGS,EAAO/C,EAAW,EAAGiF,CAAK,EACvC1B,EAAQ3C,EAAYmC,CAAI,EACpBQ,IAAU,IACZ4B,GAAM9D,EAAY0B,CAAI,EACZP,EAAAF,EAAG6C,EAAI5B,CAAK,GAExBnB,IACAW,EAAOZ,EAAOC,CAAI,EAGRO,EAAAL,EAAGS,EAAMmC,CAAK,EACxB3B,EAAQ1C,EAAYkC,CAAI,EACpBQ,IAAU,IACZnB,GAAQd,EAAUyB,CAAI,EACZP,EAAAF,EAAGF,EAAMmB,CAAK,UAQrB6B,EAAK9C,EAAE,UAGRK,EAAAL,EAAG9B,EAAWyE,CAAK,EAY/B,SAASI,EAAW/C,EAAGa,EAGvB,CACE,IAAIN,EAAWM,EAAK,SAChBE,EAAWF,EAAK,UAAU,YAC1BG,EAAYH,EAAK,UAAU,UAC3BxB,EAAWwB,EAAK,UAAU,MAC1B,EAAGqB,EACHpB,EAAW,GACXkC,EASJ,IAHAhD,EAAE,SAAW,EACbA,EAAE,SAAWlC,EAER,EAAI,EAAG,EAAIuB,EAAO,IACjBkB,EAAK,EAAI,CAAC,IAAe,GAC3BP,EAAE,KAAK,EAAEA,EAAE,QAAQ,EAAIc,EAAW,EAChCd,EAAA,MAAM,CAAC,EAAI,GAGRO,EAAA,EAAI,EAAI,CAAC,EAAY,EASvB,KAAAP,EAAE,SAAW,GACXgD,EAAAhD,EAAE,KAAK,EAAEA,EAAE,QAAQ,EAAKc,EAAW,EAAI,EAAEA,EAAW,EACtDP,EAAAyC,EAAO,CAAC,EAAa,EACxBhD,EAAA,MAAMgD,CAAI,EAAI,EACdhD,EAAA,UAEEgB,IACFhB,EAAE,YAAce,EAAMiC,EAAO,EAAI,CAAC,GAStC,IALAnC,EAAK,SAAWC,EAKX,EAAKd,EAAE,UAAY,EAAc,GAAK,EAAG,IAAkBsC,EAAAtC,EAAGO,EAAM,CAAC,EAKnEyC,EAAA3D,EACJ,GAGD,EAAIW,EAAE,KAAK,CAAa,EACtBA,EAAA,KAAK,CAAiB,EAAAA,EAAE,KAAKA,EAAE,UAAU,EAC3CsC,EAAWtC,EAAGO,EAAM,CAAa,EAGjC2B,EAAIlC,EAAE,KAAK,CAAa,EAExBA,EAAE,KAAK,EAAEA,EAAE,QAAQ,EAAI,EACvBA,EAAE,KAAK,EAAEA,EAAE,QAAQ,EAAIkC,EAGlB3B,EAAAyC,EAAO,CAAC,EAAazC,EAAK,EAAI,CAAC,EAAaA,EAAK2B,EAAI,CAAC,EAC3DlC,EAAE,MAAMgD,CAAI,GAAKhD,EAAE,MAAM,CAAC,GAAKA,EAAE,MAAMkC,CAAC,EAAIlC,EAAE,MAAM,CAAC,EAAIA,EAAE,MAAMkC,CAAC,GAAK,EAClE3B,EAAA,EAAI,EAAI,CAAC,EAAYA,EAAK2B,EAAI,EAAI,CAAC,EAAYc,EAGlDhD,EAAA,KAAK,CAAiB,EAAAgD,IACxBV,EAAWtC,EAAGO,EAAM,CAAa,QAE1BP,EAAE,UAAY,GAEvBA,EAAE,KAAK,EAAEA,EAAE,QAAQ,EAAIA,EAAE,KAAK,CAAa,EAK3CY,GAAWZ,EAAGa,CAAI,EAGRY,GAAAlB,EAAMO,EAAUd,EAAE,QAAQ,EAQtC,SAASiD,GAAUjD,EAAGO,EAAMO,EAI5B,CACM,IAAAM,EACA8B,EAAU,GACVC,EAEAC,EAAU7C,EAAK,EAAI,EAAI,CAAC,EAExB8C,EAAQ,EACRC,EAAY,EACZC,EAAY,EAQhB,IANIH,IAAY,IACFE,EAAA,IACAC,EAAA,GAEdhD,GAAMO,EAAW,GAAK,EAAI,CAAC,EAAY,MAElCM,EAAI,EAAGA,GAAKN,EAAUM,IAChB+B,EAAAC,EACTA,EAAU7C,GAAMa,EAAI,GAAK,EAAI,CAAC,EAE1B,IAAEiC,EAAQC,GAAaH,IAAWC,KAG3BC,EAAQE,EACfvD,EAAA,QAAQmD,EAAS,CAAC,GAAcE,EAEzBF,IAAW,GAEhBA,IAAWD,GAAalD,EAAA,QAAQmD,EAAS,CAAC,IAC5CnD,EAAA,QAAQ7B,EAAU,CAAC,KAEZkF,GAAS,GAChBrD,EAAA,QAAQ5B,EAAY,CAAC,IAGrB4B,EAAA,QAAQ3B,EAAc,CAAC,IAGnBgF,EAAA,EACEH,EAAAC,EAENC,IAAY,GACFE,EAAA,IACAC,EAAA,GAEHJ,IAAWC,GACRE,EAAA,EACAC,EAAA,IAGAD,EAAA,EACAC,EAAA,IAUlB,SAASC,GAAUxD,EAAGO,EAAMO,EAI5B,CACM,IAAAM,EACA8B,EAAU,GACVC,EAEAC,EAAU7C,EAAK,EAAI,EAAI,CAAC,EAExB8C,EAAQ,EACRC,EAAY,EACZC,EAAY,EAQhB,IALIH,IAAY,IACFE,EAAA,IACAC,EAAA,GAGTnC,EAAI,EAAGA,GAAKN,EAAUM,IAIzB,GAHS+B,EAAAC,EACTA,EAAU7C,GAAMa,EAAI,GAAK,EAAI,CAAC,EAE1B,IAAEiC,EAAQC,GAAaH,IAAWC,GAGtC,IAAWC,EAAQE,EACd,GAAYlD,EAAAL,EAAGmD,EAAQnD,EAAE,OAAO,QAAY,EAAEqD,IAAU,QAElDF,IAAW,GAChBA,IAAWD,IACH7C,EAAAL,EAAGmD,EAAQnD,EAAE,OAAO,EAC9BqD,KAGQhD,EAAAL,EAAG7B,EAAS6B,EAAE,OAAO,EACrBE,EAAAF,EAAGqD,EAAQ,EAAG,CAAC,GAEhBA,GAAS,IACRhD,EAAAL,EAAG5B,EAAW4B,EAAE,OAAO,EACvBE,EAAAF,EAAGqD,EAAQ,EAAG,CAAC,IAGfhD,EAAAL,EAAG3B,EAAa2B,EAAE,OAAO,EACzBE,EAAAF,EAAGqD,EAAQ,GAAI,CAAC,GAGpBA,EAAA,EACEH,EAAAC,EACNC,IAAY,GACFE,EAAA,IACAC,EAAA,GAEHJ,IAAWC,GACRE,EAAA,EACAC,EAAA,IAGAD,EAAA,EACAC,EAAA,IAUlB,SAASE,GAAczD,EAAG,CACpB,IAAA0D,EAgBJ,IAbAT,GAAUjD,EAAGA,EAAE,UAAWA,EAAE,OAAO,QAAQ,EAC3CiD,GAAUjD,EAAGA,EAAE,UAAWA,EAAE,OAAO,QAAQ,EAGhC+C,EAAA/C,EAAGA,EAAE,OAAO,EASlB0D,EAAc7F,EAAW,EAAG6F,GAAe,GAC1C1D,EAAE,QAAQvB,EAASiF,CAAW,EAAI,EAAI,CAAC,IAAc,EADRA,IAC7C,CAKN,OAAA1D,EAAE,SAAW,GAAK0D,EAAc,GAAK,EAAI,EAAI,EAItCA,EAST,SAASC,GAAe3D,EAAG4D,EAAQC,EAAQC,EAG3C,CACM,IAAAC,EASJ,IAHU7D,EAAAF,EAAG4D,EAAS,IAAK,CAAC,EAClB1D,EAAAF,EAAG6D,EAAS,EAAK,CAAC,EAClB3D,EAAAF,EAAG8D,EAAU,EAAI,CAAC,EACvBC,EAAO,EAAGA,EAAOD,EAASC,IAEnB7D,EAAAF,EAAGA,EAAE,QAAQvB,EAASsF,CAAI,EAAI,EAAI,CAAC,EAAW,CAAC,EAI3DP,GAAUxD,EAAGA,EAAE,UAAW4D,EAAS,CAAC,EAGpCJ,GAAUxD,EAAGA,EAAE,UAAW6D,EAAS,CAAC,EAkBtC,SAASG,GAAiBhE,EAAG,CAK3B,IAAIiE,EAAa,WACb7C,EAGJ,IAAKA,EAAI,EAAGA,GAAK,GAAIA,IAAK6C,KAAgB,EACxC,GAAKA,EAAa,GAAOjE,EAAE,UAAUoB,EAAI,CAAC,IAAe,EAChD,OAAAtE,EAKX,GAAIkD,EAAE,UAAU,EAAI,CAAC,IAAe,GAAKA,EAAE,UAAU,GAAK,CAAC,IAAe,GACtEA,EAAE,UAAU,GAAK,CAAC,IAAe,EAC5B,OAAAjD,EAET,IAAKqE,EAAI,GAAIA,EAAI1D,EAAU0D,IACzB,GAAIpB,EAAE,UAAUoB,EAAI,CAAC,IAAe,EAC3B,OAAArE,EAOJ,OAAAD,EAIT,IAAIoH,GAAmB,GAKvB,SAASC,GAASnE,EAClB,CAEOkE,KACYtC,GAAA,EACIsC,GAAA,IAGrBlE,EAAE,OAAU,IAAIN,EAASM,EAAE,UAAWT,CAAa,EACnDS,EAAE,OAAU,IAAIN,EAASM,EAAE,UAAWR,CAAa,EACnDQ,EAAE,QAAU,IAAIN,EAASM,EAAE,QAASP,CAAc,EAElDO,EAAE,OAAS,EACXA,EAAE,SAAW,EAGb6B,GAAW7B,CAAC,EAOd,SAASoE,GAAiBpE,EAAG9C,EAAKmH,EAAYC,EAK9C,CACEpE,EAAUF,GAAI5C,IAAgB,IAAMkH,EAAO,EAAI,GAAI,CAAC,EACzCvC,GAAA/B,EAAG9C,EAAKmH,CAAgB,EAQrC,SAASE,GAAUvE,EAAG,CACVE,EAAAF,EAAG3C,GAAgB,EAAG,CAAC,EACvBgD,EAAAL,EAAG9B,EAAWS,CAAY,EACpCgC,GAASX,CAAC,EAQZ,SAASwE,GAAgBxE,EAAG9C,EAAKmH,EAAYC,EAK7C,CACE,IAAIG,EAAUC,EACVhB,EAAc,EAGd1D,EAAE,MAAQ,GAGRA,EAAE,KAAK,YAAchD,KACrBgD,EAAA,KAAK,UAAYgE,GAAiBhE,CAAC,GAI5B+C,EAAA/C,EAAGA,EAAE,MAAM,EAIX+C,EAAA/C,EAAGA,EAAE,MAAM,EAUtB0D,EAAcD,GAAczD,CAAC,EAGjByE,EAAAzE,EAAE,QAAU,EAAI,IAAO,EACpB0E,EAAA1E,EAAE,WAAa,EAAI,IAAO,EAMrC0E,GAAeD,IAAuBA,EAAAC,IAI1CD,EAAWC,EAAcL,EAAa,EAGnCA,EAAa,GAAKI,GAAcvH,IAAQ,GAS1BkH,GAAApE,EAAG9C,EAAKmH,EAAYC,CAAI,EAEhCtE,EAAE,WAAanD,IAAW6H,IAAgBD,GAEnDvE,EAAUF,GAAI3C,GAAgB,IAAMiH,EAAO,EAAI,GAAI,CAAC,EACrC5B,GAAA1C,EAAGrB,EAAcC,CAAY,IAG5CsB,EAAUF,GAAI1C,IAAa,IAAMgH,EAAO,EAAI,GAAI,CAAC,EAClCX,GAAA3D,EAAGA,EAAE,OAAO,SAAW,EAAGA,EAAE,OAAO,SAAW,EAAG0D,EAAc,CAAC,EAC/EhB,GAAe1C,EAAGA,EAAE,UAAWA,EAAE,SAAS,GAM5C6B,GAAW7B,CAAC,EAERsE,GACFxC,GAAU9B,CAAC,EAUf,SAAS2E,GAAU3E,EAAGF,EAAM+C,EAI5B,CAGI,OAAA7C,EAAA,YAAYA,EAAE,MAAQA,EAAE,SAAW,CAAC,EAASF,IAAS,EAAK,IAC3DE,EAAA,YAAYA,EAAE,MAAQA,EAAE,SAAW,EAAI,CAAC,EAAIF,EAAO,IAErDE,EAAE,YAAYA,EAAE,MAAQA,EAAE,QAAQ,EAAI6C,EAAK,IACzC7C,EAAA,WAEEF,IAAS,EAETE,EAAA,UAAU6C,EAAK,CAAC,KAEhB7C,EAAA,UAEFF,IAKAE,EAAE,WAAWlB,EAAa+D,CAAE,EAAInF,EAAW,GAAK,CAAC,IACjDsC,EAAE,UAAUH,EAAOC,CAAI,EAAI,CAAC,KA0BtBE,EAAE,WAAaA,EAAE,YAAc,EAOrB4E,OAAAA,EAAA,UAAA,SAAAT,GACOS,EAAA,UAAA,iBAAAR,GACAQ,EAAA,UAAA,gBAAAJ,GACPI,EAAA,UAAA,UAAAD,GACpBC,EAAA,UAAA,UAAoBL","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/pako@1.0.11/node_modules/pako/lib/zlib/zstream.js ADDED Viewed

	@@ -0,0 +1,2 @@
1	+ "use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});var t,i;function r(){if(i)return t;i=1;function e(){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}return t=e,t}exports.__require=r;
2	+ //# sourceMappingURL=zstream.js.map

package/dist/node_modules/.pnpm/pako@1.0.11/node_modules/pako/lib/zlib/zstream.js.map ADDED Viewed

@@ -0,0 +1 @@

+ {"version":3,"file":"zstream.js","sources":["../../../../../../../../node_modules/.pnpm/pako@1.0.11/node_modules/pako/lib/zlib/zstream.js"],"sourcesContent":["'use strict';\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n// claim that you wrote the original software. If you use this software\n// in a product, an acknowledgment in the product documentation would be\n// appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n// misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\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\nmodule.exports = ZStream;\n"],"names":["ZStream","zstream"],"mappings":"uHAqBA,SAASA,GAAU,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,EAGf,OAAAC,EAAiBD","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/possible-typed-array-names@1.1.0/node_modules/possible-typed-array-names/index.js ADDED Viewed

	@@ -0,0 +1,2 @@
1	+ "use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});var r,a;function e(){return a\|\|(a=1,r=["Float16Array","Float32Array","Float64Array","Int8Array","Int16Array","Int32Array","Uint8Array","Uint8ClampedArray","Uint16Array","Uint32Array","BigInt64Array","BigUint64Array"]),r}exports.__require=e;
2	+ //# sourceMappingURL=index.js.map

package/dist/node_modules/.pnpm/possible-typed-array-names@1.1.0/node_modules/possible-typed-array-names/index.js.map ADDED Viewed

@@ -0,0 +1 @@

+ {"version":3,"file":"index.js","sources":["../../../../../../node_modules/.pnpm/possible-typed-array-names@1.1.0/node_modules/possible-typed-array-names/index.js"],"sourcesContent":["'use strict';\n\n/** @type {import('.')} */\nmodule.exports = [\n\t'Float16Array',\n\t'Float32Array',\n\t'Float64Array',\n\t'Int8Array',\n\t'Int16Array',\n\t'Int32Array',\n\t'Uint8Array',\n\t'Uint8ClampedArray',\n\t'Uint16Array',\n\t'Uint32Array',\n\t'BigInt64Array',\n\t'BigUint64Array'\n];\n"],"names":["possibleTypedArrayNames"],"mappings":"oHAGAA,EAAiB,CAChB,eACA,eACA,eACA,YACA,aACA,aACA,aACA,oBACA,cACA,cACA,gBACA,gBACA","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/react-is@16.13.1/node_modules/react-is/cjs/react-is.production.min.js ADDED Viewed

@@ -0,0 +1,9 @@
+"use strict";Object.defineProperties(exports,{__esModule:{value:!0},[Symbol.toStringTag]:{value:"Module"}});const t=require("../../../../../../_virtual/react-is.production.min.js");/** @license React v16.13.1
+ * react-is.production.min.js
+ *
+ * Copyright (c) Facebook, Inc. and its affiliates.
+ *
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
+ */var r=typeof Symbol=="function"&&Symbol.for,x=r?Symbol.for("react.element"):60103,b=r?Symbol.for("react.portal"):60106,n=r?Symbol.for("react.fragment"):60107,s=r?Symbol.for("react.strict_mode"):60108,c=r?Symbol.for("react.profiler"):60114,f=r?Symbol.for("react.provider"):60109,_=r?Symbol.for("react.context"):60110,d=r?Symbol.for("react.async_mode"):60111,p=r?Symbol.for("react.concurrent_mode"):60111,u=r?Symbol.for("react.forward_ref"):60112,i=r?Symbol.for("react.suspense"):60113,a=r?Symbol.for("react.suspense_list"):60120,l=r?Symbol.for("react.memo"):60115,y=r?Symbol.for("react.lazy"):60116,$=r?Symbol.for("react.block"):60121,M=r?Symbol.for("react.fundamental"):60117,v=r?Symbol.for("react.responder"):60118,C=r?Symbol.for("react.scope"):60119;function o(e){if(typeof e=="object"&&e!==null){var m=e.$$typeof;switch(m){case x:switch(e=e.type,e){case d:case p:case n:case c:case s:case i:return e;default:switch(e=e&&e.$$typeof,e){case _:case u:case y:case l:case f:return e;default:return m}}case b:return m}}}function S(e){return o(e)===p}t.__exports.AsyncMode=d;t.__exports.ConcurrentMode=p;t.__exports.ContextConsumer=_;t.__exports.ContextProvider=f;t.__exports.Element=x;t.__exports.ForwardRef=u;t.__exports.Fragment=n;t.__exports.Lazy=y;t.__exports.Memo=l;t.__exports.Portal=b;t.__exports.Profiler=c;t.__exports.StrictMode=s;t.__exports.Suspense=i;t.__exports.isAsyncMode=function(e){return S(e)||o(e)===d};t.__exports.isConcurrentMode=S;t.__exports.isContextConsumer=function(e){return o(e)===_};t.__exports.isContextProvider=function(e){return o(e)===f};t.__exports.isElement=function(e){return typeof e=="object"&&e!==null&&e.$$typeof===x};t.__exports.isForwardRef=function(e){return o(e)===u};t.__exports.isFragment=function(e){return o(e)===n};t.__exports.isLazy=function(e){return o(e)===y};t.__exports.isMemo=function(e){return o(e)===l};t.__exports.isPortal=function(e){return o(e)===b};t.__exports.isProfiler=function(e){return o(e)===c};t.__exports.isStrictMode=function(e){return o(e)===s};t.__exports.isSuspense=function(e){return o(e)===i};t.__exports.isValidElementType=function(e){return typeof e=="string"||typeof e=="function"||e===n||e===p||e===c||e===s||e===i||e===a||typeof e=="object"&&e!==null&&(e.$$typeof===y||e.$$typeof===l||e.$$typeof===f||e.$$typeof===_||e.$$typeof===u||e.$$typeof===M||e.$$typeof===v||e.$$typeof===C||e.$$typeof===$)};t.__exports.typeOf=o;exports.default=t.__exports;
+//# sourceMappingURL=react-is.production.min.js.map

package/dist/node_modules/.pnpm/react-is@16.13.1/node_modules/react-is/cjs/react-is.production.min.js.map ADDED Viewed

@@ -0,0 +1 @@

+ {"version":3,"file":"react-is.production.min.js","sources":["../../../../../../../node_modules/.pnpm/react-is@16.13.1/node_modules/react-is/cjs/react-is.production.min.js"],"sourcesContent":["/** @license React v16.13.1\n * react-is.production.min.js\n *\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n */\n\n'use strict';var b=\"function\"===typeof Symbol&&Symbol.for,c=b?Symbol.for(\"react.element\"):60103,d=b?Symbol.for(\"react.portal\"):60106,e=b?Symbol.for(\"react.fragment\"):60107,f=b?Symbol.for(\"react.strict_mode\"):60108,g=b?Symbol.for(\"react.profiler\"):60114,h=b?Symbol.for(\"react.provider\"):60109,k=b?Symbol.for(\"react.context\"):60110,l=b?Symbol.for(\"react.async_mode\"):60111,m=b?Symbol.for(\"react.concurrent_mode\"):60111,n=b?Symbol.for(\"react.forward_ref\"):60112,p=b?Symbol.for(\"react.suspense\"):60113,q=b?\nSymbol.for(\"react.suspense_list\"):60120,r=b?Symbol.for(\"react.memo\"):60115,t=b?Symbol.for(\"react.lazy\"):60116,v=b?Symbol.for(\"react.block\"):60121,w=b?Symbol.for(\"react.fundamental\"):60117,x=b?Symbol.for(\"react.responder\"):60118,y=b?Symbol.for(\"react.scope\"):60119;\nfunction z(a){if(\"object\"===typeof a&&null!==a){var u=a.$$typeof;switch(u){case c:switch(a=a.type,a){case l:case m:case e:case g:case f:case p:return a;default:switch(a=a&&a.$$typeof,a){case k:case n:case t:case r:case h:return a;default:return u}}case d:return u}}}function A(a){return z(a)===m}exports.AsyncMode=l;exports.ConcurrentMode=m;exports.ContextConsumer=k;exports.ContextProvider=h;exports.Element=c;exports.ForwardRef=n;exports.Fragment=e;exports.Lazy=t;exports.Memo=r;exports.Portal=d;\nexports.Profiler=g;exports.StrictMode=f;exports.Suspense=p;exports.isAsyncMode=function(a){return A(a)||z(a)===l};exports.isConcurrentMode=A;exports.isContextConsumer=function(a){return z(a)===k};exports.isContextProvider=function(a){return z(a)===h};exports.isElement=function(a){return\"object\"===typeof a&&null!==a&&a.$$typeof===c};exports.isForwardRef=function(a){return z(a)===n};exports.isFragment=function(a){return z(a)===e};exports.isLazy=function(a){return z(a)===t};\nexports.isMemo=function(a){return z(a)===r};exports.isPortal=function(a){return z(a)===d};exports.isProfiler=function(a){return z(a)===g};exports.isStrictMode=function(a){return z(a)===f};exports.isSuspense=function(a){return z(a)===p};\nexports.isValidElementType=function(a){return\"string\"===typeof a||\"function\"===typeof a||a===e||a===m||a===g||a===f||a===p||a===q||\"object\"===typeof a&&null!==a&&(a.$$typeof===t||a.$$typeof===r||a.$$typeof===h||a.$$typeof===k||a.$$typeof===n||a.$$typeof===w||a.$$typeof===x||a.$$typeof===y||a.$$typeof===v)};exports.typeOf=z;\n"],"names":["b","c","d","e","f","g","h","k","l","m","n","p","q","r","t","v","w","x","y","z","a","u","A","reactIs_production_min"],"mappings":";;;;;;;GASa,IAAIA,EAAe,OAAO,QAApB,YAA4B,OAAO,IAAIC,EAAED,EAAE,OAAO,IAAI,eAAe,EAAE,MAAME,EAAEF,EAAE,OAAO,IAAI,cAAc,EAAE,MAAMG,EAAEH,EAAE,OAAO,IAAI,gBAAgB,EAAE,MAAMI,EAAEJ,EAAE,OAAO,IAAI,mBAAmB,EAAE,MAAMK,EAAEL,EAAE,OAAO,IAAI,gBAAgB,EAAE,MAAMM,EAAEN,EAAE,OAAO,IAAI,gBAAgB,EAAE,MAAMO,EAAEP,EAAE,OAAO,IAAI,eAAe,EAAE,MAAMQ,EAAER,EAAE,OAAO,IAAI,kBAAkB,EAAE,MAAMS,EAAET,EAAE,OAAO,IAAI,uBAAuB,EAAE,MAAMU,EAAEV,EAAE,OAAO,IAAI,mBAAmB,EAAE,MAAMW,EAAEX,EAAE,OAAO,IAAI,gBAAgB,EAAE,MAAMY,EAAEZ,EACpf,OAAO,IAAI,qBAAqB,EAAE,MAAMa,EAAEb,EAAE,OAAO,IAAI,YAAY,EAAE,MAAMc,EAAEd,EAAE,OAAO,IAAI,YAAY,EAAE,MAAMe,EAAEf,EAAE,OAAO,IAAI,aAAa,EAAE,MAAMgB,EAAEhB,EAAE,OAAO,IAAI,mBAAmB,EAAE,MAAMiB,EAAEjB,EAAE,OAAO,IAAI,iBAAiB,EAAE,MAAMkB,EAAElB,EAAE,OAAO,IAAI,aAAa,EAAE,MAClQ,SAASmB,EAAEC,EAAE,CAAC,GAAc,OAAOA,GAAlB,UAA4BA,IAAP,KAAS,CAAC,IAAIC,EAAED,EAAE,SAAS,OAAOC,EAAC,CAAE,KAAKpB,EAAE,OAAOmB,EAAEA,EAAE,KAAKA,GAAG,KAAKZ,EAAE,KAAKC,EAAE,KAAKN,EAAE,KAAKE,EAAE,KAAKD,EAAE,KAAKO,EAAE,OAAOS,EAAE,QAAQ,OAAOA,EAAEA,GAAGA,EAAE,SAASA,EAAC,CAAE,KAAKb,EAAE,KAAKG,EAAE,KAAKI,EAAE,KAAKD,EAAE,KAAKP,EAAE,OAAOc,EAAE,QAAQ,OAAOC,CAAC,CAAC,CAAC,KAAKnB,EAAE,OAAOmB,CAAC,CAAC,CAAC,CAAC,SAASC,EAAEF,EAAE,CAAC,OAAOD,EAAEC,CAAC,IAAIX,CAAC,CAACc,EAAA,UAAA,UAAkBf,EAAwBe,YAAA,eAACd,8BAA0BF,EAAEgB,YAAA,gBAAwBjB,EAAiBiB,YAAA,QAACtB,EAAEsB,EAAAA,UAAA,WAAmBb,EAAkBa,EAAAA,UAAA,SAACpB,mBAAeW,EAAES,EAAAA,UAAA,KAAaV,EAAgBU,EAAA,UAAA,OAACrB,EAChfqB,EAAAA,UAAA,SAAiBlB,EAAEkB,YAAA,WAAmBnB,EAAEmB,EAAA,UAAA,SAAiBZ,EAAEY,EAAA,UAAA,YAAoB,SAASH,EAAE,CAAC,OAAOE,EAAEF,CAAC,GAAGD,EAAEC,CAAC,IAAIZ,CAAC,EAAEe,EAAAA,UAAA,iBAAyBD,EAAEC,YAAA,kBAA0B,SAASH,EAAE,CAAC,OAAOD,EAAEC,CAAC,IAAIb,CAAC,EAAEgB,EAAA,UAAA,kBAA0B,SAASH,EAAE,CAAC,OAAOD,EAAEC,CAAC,IAAId,CAAC,EAAEiB,EAAAA,UAAA,UAAkB,SAASH,EAAE,CAAC,OAAiB,OAAOA,GAAlB,UAA4BA,IAAP,MAAUA,EAAE,WAAWnB,CAAC,EAAEsB,EAAA,UAAA,aAAqB,SAASH,EAAE,CAAC,OAAOD,EAAEC,CAAC,IAAIV,CAAC,EAAEa,EAAAA,UAAA,WAAmB,SAASH,EAAE,CAAC,OAAOD,EAAEC,CAAC,IAAIjB,CAAC,EAAEoB,EAAAA,UAAA,OAAe,SAASH,EAAE,CAAC,OAAOD,EAAEC,CAAC,IAAIN,CAAC,EAC1dS,EAAAA,UAAA,OAAe,SAASH,EAAE,CAAC,OAAOD,EAAEC,CAAC,IAAIP,CAAC,uBAAmB,SAASO,EAAE,CAAC,OAAOD,EAAEC,CAAC,IAAIlB,CAAC,EAAoBqB,EAAA,UAAA,WAAC,SAASH,EAAE,CAAC,OAAOD,EAAEC,CAAC,IAAIf,CAAC,EAAEkB,EAAAA,UAAA,aAAqB,SAASH,EAAE,CAAC,OAAOD,EAAEC,CAAC,IAAIhB,CAAC,EAAEmB,EAAA,UAAA,WAAmB,SAASH,EAAE,CAAC,OAAOD,EAAEC,CAAC,IAAIT,CAAC,EAChNY,EAAA,UAAA,mBAAC,SAASH,EAAE,CAAC,OAAiB,OAAOA,GAAlB,UAAkC,OAAOA,GAApB,YAAuBA,IAAIjB,GAAGiB,IAAIX,GAAGW,IAAIf,GAAGe,IAAIhB,GAAGgB,IAAIT,GAAGS,IAAIR,GAAc,OAAOQ,GAAlB,UAA4BA,IAAP,OAAWA,EAAE,WAAWN,GAAGM,EAAE,WAAWP,GAAGO,EAAE,WAAWd,GAAGc,EAAE,WAAWb,GAAGa,EAAE,WAAWV,GAAGU,EAAE,WAAWJ,GAAGI,EAAE,WAAWH,GAAGG,EAAE,WAAWF,GAAGE,EAAE,WAAWL,EAAE,EAAgBQ,EAAAA,UAAA,OAACJ","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/react-is@16.13.1/node_modules/react-is/index.js ADDED Viewed

	@@ -0,0 +1,2 @@
1	+ "use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const e=require("../../../../../_virtual/index10.js");require("./cjs/react-is.production.min.js");const r=require("../../../../../_virtual/react-is.production.min.js");e.__module.exports=r.__exports;var t=e.__module.exports;exports.reactIsExports=t;
2	+ //# sourceMappingURL=index.js.map

package/dist/node_modules/.pnpm/react-is@16.13.1/node_modules/react-is/index.js.map ADDED Viewed

@@ -0,0 +1 @@

+ {"version":3,"file":"index.js","sources":["../../../../../../node_modules/.pnpm/react-is@16.13.1/node_modules/react-is/index.js"],"sourcesContent":["'use strict';\n\nif (process.env.NODE_ENV === 'production') {\n module.exports = require('./cjs/react-is.production.min.js');\n} else {\n module.exports = require('./cjs/react-is.development.js');\n}\n"],"names":["reactIsModule","require$$0"],"mappings":"wPAGSA,EAAA,SAAA,QAAUC,EAA0C","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/react-select@5.10.1_@types__730135ca68db29c6169637f77fe48ed2/node_modules/react-select/creatable/dist/react-select-creatable.esm.js ADDED Viewed

	@@ -0,0 +1,2 @@
1	+ "use strict";Object.defineProperties(exports,{__esModule:{value:!0},[Symbol.toStringTag]:{value:"Module"}});const n=require("../../../../../@babel_runtime@7.27.1/node_modules/@babel/runtime/helpers/esm/extends.js"),u=require("react"),o=require("../../dist/Select-aab027f3.esm.js"),l=require("../../dist/useStateManager-7e1e8489.esm.js"),c=require("../../dist/useCreatable-84008237.esm.js");require("react-dom");function s(e){const r=Object.create(null,{[Symbol.toStringTag]:{value:"Module"}});if(e){for(const t in e)if(t!=="default"){const a=Object.getOwnPropertyDescriptor(e,t);Object.defineProperty(r,t,a.get?a:{enumerable:!0,get:()=>e[t]})}}return r.default=e,Object.freeze(r)}const i=s(u);var f=u.forwardRef(function(e,r){var t=l.u(e),a=c.u(t);return i.createElement(o.S,n.default({ref:r},a))}),b=f;exports.useCreatable=c.u;exports.default=b;
2	+ //# sourceMappingURL=react-select-creatable.esm.js.map

package/dist/node_modules/.pnpm/react-select@5.10.1_@types__730135ca68db29c6169637f77fe48ed2/node_modules/react-select/creatable/dist/react-select-creatable.esm.js.map ADDED Viewed

@@ -0,0 +1 @@

+ {"version":3,"file":"react-select-creatable.esm.js","sources":["../../../../../../../../node_modules/.pnpm/react-select@5.10.1_@types+_730135ca68db29c6169637f77fe48ed2/node_modules/react-select/creatable/dist/react-select-creatable.esm.js"],"sourcesContent":["import _extends from '@babel/runtime/helpers/esm/extends';\nimport * as React from 'react';\nimport { forwardRef } from 'react';\nimport { S as Select } from '../../dist/Select-aab027f3.esm.js';\nimport { u as useStateManager } from '../../dist/useStateManager-7e1e8489.esm.js';\nimport { u as useCreatable } from '../../dist/useCreatable-84008237.esm.js';\nexport { u as useCreatable } from '../../dist/useCreatable-84008237.esm.js';\nimport '@babel/runtime/helpers/objectSpread2';\nimport '@babel/runtime/helpers/classCallCheck';\nimport '@babel/runtime/helpers/createClass';\nimport '@babel/runtime/helpers/inherits';\nimport '@babel/runtime/helpers/createSuper';\nimport '@babel/runtime/helpers/toConsumableArray';\nimport '../../dist/index-641ee5b8.esm.js';\nimport '@emotion/react';\nimport '@babel/runtime/helpers/slicedToArray';\nimport '@babel/runtime/helpers/objectWithoutProperties';\nimport '@babel/runtime/helpers/typeof';\nimport '@babel/runtime/helpers/taggedTemplateLiteral';\nimport '@babel/runtime/helpers/defineProperty';\nimport 'react-dom';\nimport '@floating-ui/dom';\nimport 'use-isomorphic-layout-effect';\nimport 'memoize-one';\n\nvar CreatableSelect = /*#__PURE__*/forwardRef(function (props, ref) {\n var creatableProps = useStateManager(props);\n var selectProps = useCreatable(creatableProps);\n return /*#__PURE__*/React.createElement(Select, _extends({\n ref: ref\n }, selectProps));\n});\nvar CreatableSelect$1 = CreatableSelect;\n\nexport { CreatableSelect$1 as default };\n"],"names":["CreatableSelect","forwardRef","props","ref","creatableProps","useStateManager","selectProps","useCreatable","React","Select","_extends","CreatableSelect$1"],"mappings":"qrBAyBA,IAAIA,EAA+BC,EAAU,WAAC,SAAUC,EAAOC,EAAK,CAClE,IAAIC,EAAiBC,EAAe,EAACH,CAAK,EACtCI,EAAcC,EAAY,EAACH,CAAc,EAC7C,OAAoBI,EAAM,cAAcC,EAAM,EAAEC,UAAS,CACvD,IAAKP,CACN,EAAEG,CAAW,CAAC,CACjB,CAAC,EACGK,EAAoBX","x_google_ignoreList":[0]}