@intlayer/backend 7.1.3 → 7.1.5

package/dist/cjs/node_modules/pako/lib/zlib/inflate.cjs.map

@@ -1 +0,0 @@
-{"version":3,"file":"inflate.cjs","names":[],"sources":["../../../../../../../../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"],"x_google_ignoreList":[0],"mappings":";;;;;;;;;CAqBA,IAAI;CACJ,IAAI;CACJ,IAAI;CACJ,IAAI;CACJ,IAAI;CAEJ,IAAI,QAAQ;CACZ,IAAI,OAAO;CACX,IAAI,QAAQ;CAWZ,IAAI,WAAkB;CACtB,IAAI,UAAkB;CACtB,IAAI,UAAkB;CAMtB,IAAI,OAAkB;CACtB,IAAI,eAAkB;CACtB,IAAI,cAAkB;CAEtB,IAAI,iBAAkB;CACtB,IAAI,eAAkB;CACtB,IAAI,cAAkB;CACtB,IAAI,cAAkB;CAItB,IAAI,aAAc;CAOlB,IAAO,OAAO;CACd,IAAO,QAAQ;CACf,IAAO,OAAO;CACd,IAAO,KAAK;CACZ,IAAO,QAAQ;CACf,IAAO,QAAQ;CACf,IAAO,OAAO;CACd,IAAO,UAAU;CACjB,IAAO,OAAO;CACd,IAAO,SAAS;CAChB,IAAO,OAAO;CACd,IAAW,OAAO;CAClB,IAAW,SAAS;CACpB,IAAW,SAAS;CACpB,IAAW,QAAQ;CACnB,IAAW,OAAO;CAClB,IAAW,QAAQ;CACnB,IAAW,UAAU;CACrB,IAAW,WAAW;CACtB,IAAe,OAAO;CACtB,IAAe,MAAM;CACrB,IAAe,SAAS;CACxB,IAAe,OAAO;CACtB,IAAe,UAAU;CACzB,IAAe,QAAQ;CACvB,IAAe,MAAM;CACrB,IAAO,QAAQ;CACf,IAAO,SAAS;CAChB,IAAO,OAAO;CACd,IAAO,MAAM;CACb,IAAO,MAAM;CACb,IAAO,OAAO;CAMd,IAAI,cAAc;CAClB,IAAI,eAAe;CAKnB,IAAI,YAFY;CAKhB,SAAS,QAAQ,GAAG;AAClB,UAAW,MAAM,KAAM,QACb,MAAM,IAAK,WACX,IAAI,UAAW,OACf,IAAI,QAAS;;CAIzB,SAAS,eAAe;AACtB,OAAK,OAAO;AACZ,OAAK,OAAO;AACZ,OAAK,OAAO;AACZ,OAAK,WAAW;AAChB,OAAK,QAAQ;AACb,OAAK,OAAO;AACZ,OAAK,QAAQ;AACb,OAAK,QAAQ;AAEb,OAAK,OAAO;AAGZ,OAAK,QAAQ;AACb,OAAK,QAAQ;AACb,OAAK,QAAQ;AACb,OAAK,QAAQ;AACb,OAAK,SAAS;AAGd,OAAK,OAAO;AACZ,OAAK,OAAO;AAGZ,OAAK,SAAS;AACd,OAAK,SAAS;AAGd,OAAK,QAAQ;AAGb,OAAK,UAAU;AACf,OAAK,WAAW;AAChB,OAAK,UAAU;AACf,OAAK,WAAW;AAGhB,OAAK,QAAQ;AACb,OAAK,OAAO;AACZ,OAAK,QAAQ;AACb,OAAK,OAAO;AACZ,OAAK,OAAO;AAEZ,OAAK,OAAO,IAAI,MAAM,MAAM,IAAI;AAChC,OAAK,OAAO,IAAI,MAAM,MAAM,IAAI;AAOhC,OAAK,SAAS;AACd,OAAK,UAAU;AACf,OAAK,OAAO;AACZ,OAAK,OAAO;AACZ,OAAK,MAAM;;CAGb,SAAS,iBAAiB,MAAM;EAC9B,IAAI;AAEJ,MAAI,CAAC,QAAQ,CAAC,KAAK,MAAS,QAAO;AACnC,UAAQ,KAAK;AACb,OAAK,WAAW,KAAK,YAAY,MAAM,QAAQ;AAC/C,OAAK,MAAM;AACX,MAAI,MAAM,KACR,MAAK,QAAQ,MAAM,OAAO;AAE5B,QAAM,OAAO;AACb,QAAM,OAAO;AACb,QAAM,WAAW;AACjB,QAAM,OAAO;AACb,QAAM,OAAO;AACb,QAAM,OAAO;AACb,QAAM,OAAO;AAEb,QAAM,UAAU,MAAM,SAAS,IAAI,MAAM,MAAM,YAAY;AAC3D,QAAM,WAAW,MAAM,UAAU,IAAI,MAAM,MAAM,aAAa;AAE9D,QAAM,OAAO;AACb,QAAM,OAAO;AAEb,SAAO;;CAGT,SAAS,aAAa,MAAM;EAC1B,IAAI;AAEJ,MAAI,CAAC,QAAQ,CAAC,KAAK,MAAS,QAAO;AACnC,UAAQ,KAAK;AACb,QAAM,QAAQ;AACd,QAAM,QAAQ;AACd,QAAM,QAAQ;AACd,SAAO,iBAAiB,KAAK;;CAI/B,SAAS,cAAc,MAAM,YAAY;EACvC,IAAI;EACJ,IAAI;AAGJ,MAAI,CAAC,QAAQ,CAAC,KAAK,MAAS,QAAO;AACnC,UAAQ,KAAK;AAGb,MAAI,aAAa,GAAG;AAClB,UAAO;AACP,gBAAa,CAAC;SAEX;AACH,WAAQ,cAAc,KAAK;AAC3B,OAAI,aAAa,GACf,eAAc;;AAKlB,MAAI,eAAe,aAAa,KAAK,aAAa,IAChD,QAAO;AAET,MAAI,MAAM,WAAW,QAAQ,MAAM,UAAU,WAC3C,OAAM,SAAS;AAIjB,QAAM,OAAO;AACb,QAAM,QAAQ;AACd,SAAO,aAAa,KAAK;;CAG3B,SAAS,aAAa,MAAM,YAAY;EACtC,IAAI;EACJ,IAAI;AAEJ,MAAI,CAAC,KAAQ,QAAO;AAGpB,UAAQ,IAAI,cAAc;AAI1B,OAAK,QAAQ;AACb,QAAM,SAAS;AACf,QAAM,cAAc,MAAM,WAAW;AACrC,MAAI,QAAQ,KACV,MAAK,QAAQ;AAEf,SAAO;;CAGT,SAAS,YAAY,MAAM;AACzB,SAAO,aAAa,MAAM,UAAU;;CActC,IAAI,SAAS;CAEb,IAAI,QAAQ;CAEZ,SAAS,YAAY,OAAO;AAE1B,MAAI,QAAQ;GACV,IAAI;AAEJ,YAAS,IAAI,MAAM,MAAM,IAAI;AAC7B,aAAU,IAAI,MAAM,MAAM,GAAG;AAG7B,SAAM;AACN,UAAO,MAAM,IAAO,OAAM,KAAK,SAAS;AACxC,UAAO,MAAM,IAAO,OAAM,KAAK,SAAS;AACxC,UAAO,MAAM,IAAO,OAAM,KAAK,SAAS;AACxC,UAAO,MAAM,IAAO,OAAM,KAAK,SAAS;AAExC,iBAAc,MAAO,MAAM,MAAM,GAAG,KAAK,QAAU,GAAG,MAAM,MAAM,EAAE,MAAM,GAAG,CAAC;AAG9E,SAAM;AACN,UAAO,MAAM,GAAM,OAAM,KAAK,SAAS;AAEvC,iBAAc,OAAO,MAAM,MAAM,GAAG,IAAM,SAAS,GAAG,MAAM,MAAM,EAAE,MAAM,GAAG,CAAC;AAG9E,YAAS;;AAGX,QAAM,UAAU;AAChB,QAAM,UAAU;AAChB,QAAM,WAAW;AACjB,QAAM,WAAW;;CAkBnB,SAAS,aAAa,MAAM,KAAK,KAAK,MAAM;EAC1C,IAAI;EACJ,IAAI,QAAQ,KAAK;AAGjB,MAAI,MAAM,WAAW,MAAM;AACzB,SAAM,QAAQ,KAAK,MAAM;AACzB,SAAM,QAAQ;AACd,SAAM,QAAQ;AAEd,SAAM,SAAS,IAAI,MAAM,KAAK,MAAM,MAAM;;AAI5C,MAAI,QAAQ,MAAM,OAAO;AACvB,SAAM,SAAS,MAAM,QAAQ,KAAK,MAAM,MAAM,OAAO,MAAM,OAAO,EAAE;AACpE,SAAM,QAAQ;AACd,SAAM,QAAQ,MAAM;SAEjB;AACH,UAAO,MAAM,QAAQ,MAAM;AAC3B,OAAI,OAAO,KACT,QAAO;AAGT,SAAM,SAAS,MAAM,QAAQ,KAAK,MAAM,MAAM,MAAM,MAAM,MAAM;AAChE,WAAQ;AACR,OAAI,MAAM;AAER,UAAM,SAAS,MAAM,QAAQ,KAAK,MAAM,MAAM,MAAM,EAAE;AACtD,UAAM,QAAQ;AACd,UAAM,QAAQ,MAAM;UAEjB;AACH,UAAM,SAAS;AACf,QAAI,MAAM,UAAU,MAAM,MAAS,OAAM,QAAQ;AACjD,QAAI,MAAM,QAAQ,MAAM,MAAS,OAAM,SAAS;;;AAGpD,SAAO;;CAGT,SAAS,QAAQ,MAAM,OAAO;EAC5B,IAAI;EACJ,IAAI,OAAO;EACX,IAAI;EACJ,IAAI;EACJ,IAAI,MAAM;EACV,IAAI;EACJ,IAAI;EACJ,IAAI,KAAK;EACT,IAAI;EACJ,IAAI;EACJ,IAAI;EACJ,IAAI,OAAO;EACX,IAAI,WAAW,SAAS;EAExB,IAAI,WAAW,SAAS;EACxB,IAAI;EACJ,IAAI;EACJ,IAAI,OAAO,IAAI,MAAM,KAAK,EAAE;EAC5B,IAAI;EAEJ,IAAI;EAEJ,IAAI,QACF;GAAE;GAAI;GAAI;GAAI;GAAG;GAAG;GAAG;GAAG;GAAG;GAAI;GAAG;GAAI;GAAG;GAAI;GAAG;GAAI;GAAG;GAAI;GAAG;GAAI;AAGtE,MAAI,CAAC,QAAQ,CAAC,KAAK,SAAS,CAAC,KAAK,UAC7B,CAAC,KAAK,SAAS,KAAK,aAAa,EACpC,QAAO;AAGT,UAAQ,KAAK;AACb,MAAI,MAAM,SAAS,KAAQ,OAAM,OAAO;AAIxC,QAAM,KAAK;AACX,WAAS,KAAK;AACd,SAAO,KAAK;AACZ,SAAO,KAAK;AACZ,UAAQ,KAAK;AACb,SAAO,KAAK;AACZ,SAAO,MAAM;AACb,SAAO,MAAM;AAGb,QAAM;AACN,SAAO;AACP,QAAM;AAEN,YACA,SACE,SAAQ,MAAM,MAAd;GACE,KAAK;AACH,QAAI,MAAM,SAAS,GAAG;AACpB,WAAM,OAAO;AACb;;AAGF,WAAO,OAAO,IAAI;AAChB,SAAI,SAAS,EAAK,OAAM;AACxB;AACA,aAAQ,MAAM,WAAW;AACzB,aAAQ;;AAGV,QAAK,MAAM,OAAO,KAAM,SAAS,OAAQ;AACvC,WAAM,QAAQ;AAEd,UAAK,KAAK,OAAO;AACjB,UAAK,KAAM,SAAS,IAAK;AACzB,WAAM,QAAQ,MAAM,MAAM,OAAO,MAAM,GAAG,EAAE;AAI5C,YAAO;AACP,YAAO;AAEP,WAAM,OAAO;AACb;;AAEF,UAAM,QAAQ;AACd,QAAI,MAAM,KACR,OAAM,KAAK,OAAO;AAEpB,QAAI,EAAE,MAAM,OAAO,SACd,OAAO,QAAoB,MAAM,QAAQ,MAAM,IAAI;AACtD,UAAK,MAAM;AACX,WAAM,OAAO;AACb;;AAEF,SAAK,OAAO,QAAqB,YAAY;AAC3C,UAAK,MAAM;AACX,WAAM,OAAO;AACb;;AAGF,cAAU;AACV,YAAQ;AAER,WAAO,OAAO,MAAmB;AACjC,QAAI,MAAM,UAAU,EAClB,OAAM,QAAQ;aAEP,MAAM,MAAM,OAAO;AAC1B,UAAK,MAAM;AACX,WAAM,OAAO;AACb;;AAEF,UAAM,OAAO,KAAK;AAElB,SAAK,QAAQ,MAAM,QAAQ;AAC3B,UAAM,OAAO,OAAO,MAAQ,SAAS;AAErC,WAAO;AACP,WAAO;AAEP;GACF,KAAK;AAEH,WAAO,OAAO,IAAI;AAChB,SAAI,SAAS,EAAK,OAAM;AACxB;AACA,aAAQ,MAAM,WAAW;AACzB,aAAQ;;AAGV,UAAM,QAAQ;AACd,SAAK,MAAM,QAAQ,SAAU,YAAY;AACvC,UAAK,MAAM;AACX,WAAM,OAAO;AACb;;AAEF,QAAI,MAAM,QAAQ,OAAQ;AACxB,UAAK,MAAM;AACX,WAAM,OAAO;AACb;;AAEF,QAAI,MAAM,KACR,OAAM,KAAK,OAAS,QAAQ,IAAK;AAEnC,QAAI,MAAM,QAAQ,KAAQ;AAExB,UAAK,KAAK,OAAO;AACjB,UAAK,KAAM,SAAS,IAAK;AACzB,WAAM,QAAQ,MAAM,MAAM,OAAO,MAAM,GAAG,EAAE;;AAI9C,WAAO;AACP,WAAO;AAEP,UAAM,OAAO;GAEf,KAAK;AAEH,WAAO,OAAO,IAAI;AAChB,SAAI,SAAS,EAAK,OAAM;AACxB;AACA,aAAQ,MAAM,WAAW;AACzB,aAAQ;;AAGV,QAAI,MAAM,KACR,OAAM,KAAK,OAAO;AAEpB,QAAI,MAAM,QAAQ,KAAQ;AAExB,UAAK,KAAK,OAAO;AACjB,UAAK,KAAM,SAAS,IAAK;AACzB,UAAK,KAAM,SAAS,KAAM;AAC1B,UAAK,KAAM,SAAS,KAAM;AAC1B,WAAM,QAAQ,MAAM,MAAM,OAAO,MAAM,GAAG,EAAE;;AAI9C,WAAO;AACP,WAAO;AAEP,UAAM,OAAO;GAEf,KAAK;AAEH,WAAO,OAAO,IAAI;AAChB,SAAI,SAAS,EAAK,OAAM;AACxB;AACA,aAAQ,MAAM,WAAW;AACzB,aAAQ;;AAGV,QAAI,MAAM,MAAM;AACd,WAAM,KAAK,SAAU,OAAO;AAC5B,WAAM,KAAK,KAAM,QAAQ;;AAE3B,QAAI,MAAM,QAAQ,KAAQ;AAExB,UAAK,KAAK,OAAO;AACjB,UAAK,KAAM,SAAS,IAAK;AACzB,WAAM,QAAQ,MAAM,MAAM,OAAO,MAAM,GAAG,EAAE;;AAI9C,WAAO;AACP,WAAO;AAEP,UAAM,OAAO;GAEf,KAAK;AACH,QAAI,MAAM,QAAQ,MAAQ;AAExB,YAAO,OAAO,IAAI;AAChB,UAAI,SAAS,EAAK,OAAM;AACxB;AACA,cAAQ,MAAM,WAAW;AACzB,cAAQ;;AAGV,WAAM,SAAS;AACf,SAAI,MAAM,KACR,OAAM,KAAK,YAAY;AAEzB,SAAI,MAAM,QAAQ,KAAQ;AAExB,WAAK,KAAK,OAAO;AACjB,WAAK,KAAM,SAAS,IAAK;AACzB,YAAM,QAAQ,MAAM,MAAM,OAAO,MAAM,GAAG,EAAE;;AAI9C,YAAO;AACP,YAAO;eAGA,MAAM,KACb,OAAM,KAAK,QAAQ;AAErB,UAAM,OAAO;GAEf,KAAK;AACH,QAAI,MAAM,QAAQ,MAAQ;AACxB,YAAO,MAAM;AACb,SAAI,OAAO,KAAQ,QAAO;AAC1B,SAAI,MAAM;AACR,UAAI,MAAM,MAAM;AACd,aAAM,MAAM,KAAK,YAAY,MAAM;AACnC,WAAI,CAAC,MAAM,KAAK,MAEd,OAAM,KAAK,QAAQ,IAAI,MAAM,MAAM,KAAK,UAAU;AAEpD,aAAM,SACJ,MAAM,KAAK,OACX,OACA,MAGA,MAEA,IACD;;AAKH,UAAI,MAAM,QAAQ,IAChB,OAAM,QAAQ,MAAM,MAAM,OAAO,OAAO,MAAM,KAAK;AAErD,cAAQ;AACR,cAAQ;AACR,YAAM,UAAU;;AAElB,SAAI,MAAM,OAAU,OAAM;;AAE5B,UAAM,SAAS;AACf,UAAM,OAAO;GAEf,KAAK;AACH,QAAI,MAAM,QAAQ,MAAQ;AACxB,SAAI,SAAS,EAAK,OAAM;AACxB,YAAO;AACP,QAAG;AAED,YAAM,MAAM,OAAO;AAEnB,UAAI,MAAM,QAAQ,OACb,MAAM,SAAS,MAClB,OAAM,KAAK,QAAQ,OAAO,aAAa,IAAI;cAEtC,OAAO,OAAO;AAEvB,SAAI,MAAM,QAAQ,IAChB,OAAM,QAAQ,MAAM,MAAM,OAAO,OAAO,MAAM,KAAK;AAErD,aAAQ;AACR,aAAQ;AACR,SAAI,IAAO,OAAM;eAEV,MAAM,KACb,OAAM,KAAK,OAAO;AAEpB,UAAM,SAAS;AACf,UAAM,OAAO;GAEf,KAAK;AACH,QAAI,MAAM,QAAQ,MAAQ;AACxB,SAAI,SAAS,EAAK,OAAM;AACxB,YAAO;AACP,QAAG;AACD,YAAM,MAAM,OAAO;AAEnB,UAAI,MAAM,QAAQ,OACb,MAAM,SAAS,MAClB,OAAM,KAAK,WAAW,OAAO,aAAa,IAAI;cAEzC,OAAO,OAAO;AACvB,SAAI,MAAM,QAAQ,IAChB,OAAM,QAAQ,MAAM,MAAM,OAAO,OAAO,MAAM,KAAK;AAErD,aAAQ;AACR,aAAQ;AACR,SAAI,IAAO,OAAM;eAEV,MAAM,KACb,OAAM,KAAK,UAAU;AAEvB,UAAM,OAAO;GAEf,KAAK;AACH,QAAI,MAAM,QAAQ,KAAQ;AAExB,YAAO,OAAO,IAAI;AAChB,UAAI,SAAS,EAAK,OAAM;AACxB;AACA,cAAQ,MAAM,WAAW;AACzB,cAAQ;;AAGV,SAAI,UAAU,MAAM,QAAQ,QAAS;AACnC,WAAK,MAAM;AACX,YAAM,OAAO;AACb;;AAGF,YAAO;AACP,YAAO;;AAGT,QAAI,MAAM,MAAM;AACd,WAAM,KAAK,OAAS,MAAM,SAAS,IAAK;AACxC,WAAM,KAAK,OAAO;;AAEpB,SAAK,QAAQ,MAAM,QAAQ;AAC3B,UAAM,OAAO;AACb;GACF,KAAK;AAEH,WAAO,OAAO,IAAI;AAChB,SAAI,SAAS,EAAK,OAAM;AACxB;AACA,aAAQ,MAAM,WAAW;AACzB,aAAQ;;AAGV,SAAK,QAAQ,MAAM,QAAQ,QAAQ,KAAK;AAExC,WAAO;AACP,WAAO;AAEP,UAAM,OAAO;GAEf,KAAK;AACH,QAAI,MAAM,aAAa,GAAG;AAExB,UAAK,WAAW;AAChB,UAAK,YAAY;AACjB,UAAK,UAAU;AACf,UAAK,WAAW;AAChB,WAAM,OAAO;AACb,WAAM,OAAO;AAEb,YAAO;;AAET,SAAK,QAAQ,MAAM,QAAQ;AAC3B,UAAM,OAAO;GAEf,KAAK,KACH,KAAI,UAAU,WAAW,UAAU,QAAW,OAAM;GAEtD,KAAK;AACH,QAAI,MAAM,MAAM;AAEd,eAAU,OAAO;AACjB,aAAQ,OAAO;AAEf,WAAM,OAAO;AACb;;AAGF,WAAO,OAAO,GAAG;AACf,SAAI,SAAS,EAAK,OAAM;AACxB;AACA,aAAQ,MAAM,WAAW;AACzB,aAAQ;;AAGV,UAAM,OAAQ,OAAO;AAErB,cAAU;AACV,YAAQ;AAGR,YAAS,OAAO,GAAhB;KACE,KAAK;AAGH,YAAM,OAAO;AACb;KACF,KAAK;AACH,kBAAY,MAAM;AAGlB,YAAM,OAAO;AACb,UAAI,UAAU,SAAS;AAErB,iBAAU;AACV,eAAQ;AAER,aAAM;;AAER;KACF,KAAK;AAGH,YAAM,OAAO;AACb;KACF,KAAK;AACH,WAAK,MAAM;AACX,YAAM,OAAO;;AAGjB,cAAU;AACV,YAAQ;AAER;GACF,KAAK;AAEH,cAAU,OAAO;AACjB,YAAQ,OAAO;AAGf,WAAO,OAAO,IAAI;AAChB,SAAI,SAAS,EAAK,OAAM;AACxB;AACA,aAAQ,MAAM,WAAW;AACzB,aAAQ;;AAGV,SAAK,OAAO,YAAc,SAAS,KAAM,QAAS;AAChD,UAAK,MAAM;AACX,WAAM,OAAO;AACb;;AAEF,UAAM,SAAS,OAAO;AAItB,WAAO;AACP,WAAO;AAEP,UAAM,OAAO;AACb,QAAI,UAAU,QAAW,OAAM;GAEjC,KAAK,MACH,OAAM,OAAO;GAEf,KAAK;AACH,WAAO,MAAM;AACb,QAAI,MAAM;AACR,SAAI,OAAO,KAAQ,QAAO;AAC1B,SAAI,OAAO,KAAQ,QAAO;AAC1B,SAAI,SAAS,EAAK,OAAM;AAExB,WAAM,SAAS,QAAQ,OAAO,MAAM,MAAM,IAAI;AAE9C,aAAQ;AACR,aAAQ;AACR,aAAQ;AACR,YAAO;AACP,WAAM,UAAU;AAChB;;AAGF,UAAM,OAAO;AACb;GACF,KAAK;AAEH,WAAO,OAAO,IAAI;AAChB,SAAI,SAAS,EAAK,OAAM;AACxB;AACA,aAAQ,MAAM,WAAW;AACzB,aAAQ;;AAGV,UAAM,QAAQ,OAAO,MAAmB;AAExC,cAAU;AACV,YAAQ;AAER,UAAM,SAAS,OAAO,MAAmB;AAEzC,cAAU;AACV,YAAQ;AAER,UAAM,SAAS,OAAO,MAAmB;AAEzC,cAAU;AACV,YAAQ;AAGR,QAAI,MAAM,OAAO,OAAO,MAAM,QAAQ,IAAI;AACxC,UAAK,MAAM;AACX,WAAM,OAAO;AACb;;AAIF,UAAM,OAAO;AACb,UAAM,OAAO;GAEf,KAAK;AACH,WAAO,MAAM,OAAO,MAAM,OAAO;AAE/B,YAAO,OAAO,GAAG;AACf,UAAI,SAAS,EAAK,OAAM;AACxB;AACA,cAAQ,MAAM,WAAW;AACzB,cAAQ;;AAGV,WAAM,KAAK,MAAM,MAAM,WAAY,OAAO;AAE1C,eAAU;AACV,aAAQ;;AAGV,WAAO,MAAM,OAAO,GAClB,OAAM,KAAK,MAAM,MAAM,WAAW;AAMpC,UAAM,UAAU,MAAM;AACtB,UAAM,UAAU;AAEhB,WAAO,EAAE,MAAM,MAAM,SAAS;AAC9B,UAAM,cAAc,OAAO,MAAM,MAAM,GAAG,IAAI,MAAM,SAAS,GAAG,MAAM,MAAM,KAAK;AACjF,UAAM,UAAU,KAAK;AAErB,QAAI,KAAK;AACP,UAAK,MAAM;AACX,WAAM,OAAO;AACb;;AAGF,UAAM,OAAO;AACb,UAAM,OAAO;GAEf,KAAK;AACH,WAAO,MAAM,OAAO,MAAM,OAAO,MAAM,OAAO;AAC5C,cAAS;AACP,aAAO,MAAM,QAAQ,QAAS,KAAK,MAAM,WAAW;AACpD,kBAAY,SAAS;AACrB,gBAAW,SAAS,KAAM;AAC1B,iBAAW,OAAO;AAElB,UAAK,aAAc,KAAQ;AAE3B,UAAI,SAAS,EAAK,OAAM;AACxB;AACA,cAAQ,MAAM,WAAW;AACzB,cAAQ;;AAGV,SAAI,WAAW,IAAI;AAEjB,gBAAU;AACV,cAAQ;AAER,YAAM,KAAK,MAAM,UAAU;YAExB;AACH,UAAI,aAAa,IAAI;AAEnB,WAAI,YAAY;AAChB,cAAO,OAAO,GAAG;AACf,YAAI,SAAS,EAAK,OAAM;AACxB;AACA,gBAAQ,MAAM,WAAW;AACzB,gBAAQ;;AAIV,iBAAU;AACV,eAAQ;AAER,WAAI,MAAM,SAAS,GAAG;AACpB,aAAK,MAAM;AACX,cAAM,OAAO;AACb;;AAEF,aAAM,MAAM,KAAK,MAAM,OAAO;AAC9B,cAAO,KAAK,OAAO;AAEnB,iBAAU;AACV,eAAQ;iBAGD,aAAa,IAAI;AAExB,WAAI,YAAY;AAChB,cAAO,OAAO,GAAG;AACf,YAAI,SAAS,EAAK,OAAM;AACxB;AACA,gBAAQ,MAAM,WAAW;AACzB,gBAAQ;;AAIV,iBAAU;AACV,eAAQ;AAER,aAAM;AACN,cAAO,KAAK,OAAO;AAEnB,iBAAU;AACV,eAAQ;aAGL;AAEH,WAAI,YAAY;AAChB,cAAO,OAAO,GAAG;AACf,YAAI,SAAS,EAAK,OAAM;AACxB;AACA,gBAAQ,MAAM,WAAW;AACzB,gBAAQ;;AAIV,iBAAU;AACV,eAAQ;AAER,aAAM;AACN,cAAO,MAAM,OAAO;AAEpB,iBAAU;AACV,eAAQ;;AAGV,UAAI,MAAM,OAAO,OAAO,MAAM,OAAO,MAAM,OAAO;AAChD,YAAK,MAAM;AACX,aAAM,OAAO;AACb;;AAEF,aAAO,OACL,OAAM,KAAK,MAAM,UAAU;;;AAMjC,QAAI,MAAM,SAAS,IAAO;AAG1B,QAAI,MAAM,KAAK,SAAS,GAAG;AACzB,UAAK,MAAM;AACX,WAAM,OAAO;AACb;;AAMF,UAAM,UAAU;AAEhB,WAAO,EAAE,MAAM,MAAM,SAAS;AAC9B,UAAM,cAAc,MAAM,MAAM,MAAM,GAAG,MAAM,MAAM,MAAM,SAAS,GAAG,MAAM,MAAM,KAAK;AAGxF,UAAM,UAAU,KAAK;AAGrB,QAAI,KAAK;AACP,UAAK,MAAM;AACX,WAAM,OAAO;AACb;;AAGF,UAAM,WAAW;AAGjB,UAAM,WAAW,MAAM;AACvB,WAAO,EAAE,MAAM,MAAM,UAAU;AAC/B,UAAM,cAAc,OAAO,MAAM,MAAM,MAAM,MAAM,MAAM,OAAO,MAAM,UAAU,GAAG,MAAM,MAAM,KAAK;AAGpG,UAAM,WAAW,KAAK;AAGtB,QAAI,KAAK;AACP,UAAK,MAAM;AACX,WAAM,OAAO;AACb;;AAGF,UAAM,OAAO;AACb,QAAI,UAAU,QAAW,OAAM;GAEjC,KAAK,KACH,OAAM,OAAO;GAEf,KAAK;AACH,QAAI,QAAQ,KAAK,QAAQ,KAAK;AAE5B,UAAK,WAAW;AAChB,UAAK,YAAY;AACjB,UAAK,UAAU;AACf,UAAK,WAAW;AAChB,WAAM,OAAO;AACb,WAAM,OAAO;AAEb,kBAAa,MAAM,KAAK;AAExB,WAAM,KAAK;AACX,cAAS,KAAK;AACd,YAAO,KAAK;AACZ,YAAO,KAAK;AACZ,aAAQ,KAAK;AACb,YAAO,KAAK;AACZ,YAAO,MAAM;AACb,YAAO,MAAM;AAGb,SAAI,MAAM,SAAS,KACjB,OAAM,OAAO;AAEf;;AAEF,UAAM,OAAO;AACb,aAAS;AACP,YAAO,MAAM,QAAQ,QAAS,KAAK,MAAM,WAAW;AACpD,iBAAY,SAAS;AACrB,eAAW,SAAS,KAAM;AAC1B,gBAAW,OAAO;AAElB,SAAI,aAAa,KAAQ;AAEzB,SAAI,SAAS,EAAK,OAAM;AACxB;AACA,aAAQ,MAAM,WAAW;AACzB,aAAQ;;AAGV,QAAI,YAAY,UAAU,SAAU,GAAG;AACrC,iBAAY;AACZ,eAAU;AACV,gBAAW;AACX,cAAS;AACP,aAAO,MAAM,QAAQ,aACX,QAAS,KAAM,YAAY,WAAY,MAAoC;AACrF,kBAAY,SAAS;AACrB,gBAAW,SAAS,KAAM;AAC1B,iBAAW,OAAO;AAElB,UAAK,YAAY,aAAc,KAAQ;AAEvC,UAAI,SAAS,EAAK,OAAM;AACxB;AACA,cAAQ,MAAM,WAAW;AACzB,cAAQ;;AAIV,eAAU;AACV,aAAQ;AAER,WAAM,QAAQ;;AAGhB,cAAU;AACV,YAAQ;AAER,UAAM,QAAQ;AACd,UAAM,SAAS;AACf,QAAI,YAAY,GAAG;AAIjB,WAAM,OAAO;AACb;;AAEF,QAAI,UAAU,IAAI;AAEhB,WAAM,OAAO;AACb,WAAM,OAAO;AACb;;AAEF,QAAI,UAAU,IAAI;AAChB,UAAK,MAAM;AACX,WAAM,OAAO;AACb;;AAEF,UAAM,QAAQ,UAAU;AACxB,UAAM,OAAO;GAEf,KAAK;AACH,QAAI,MAAM,OAAO;AAEf,SAAI,MAAM;AACV,YAAO,OAAO,GAAG;AACf,UAAI,SAAS,EAAK,OAAM;AACxB;AACA,cAAQ,MAAM,WAAW;AACzB,cAAQ;;AAGV,WAAM,UAAU,QAAS,KAAK,MAAM,SAAS;AAE7C,eAAU,MAAM;AAChB,aAAQ,MAAM;AAEd,WAAM,QAAQ,MAAM;;AAGtB,UAAM,MAAM,MAAM;AAClB,UAAM,OAAO;GAEf,KAAK;AACH,aAAS;AACP,YAAO,MAAM,SAAS,QAAS,KAAK,MAAM,YAAY;AACtD,iBAAY,SAAS;AACrB,eAAW,SAAS,KAAM;AAC1B,gBAAW,OAAO;AAElB,SAAK,aAAc,KAAQ;AAE3B,SAAI,SAAS,EAAK,OAAM;AACxB;AACA,aAAQ,MAAM,WAAW;AACzB,aAAQ;;AAGV,SAAK,UAAU,SAAU,GAAG;AAC1B,iBAAY;AACZ,eAAU;AACV,gBAAW;AACX,cAAS;AACP,aAAO,MAAM,SAAS,aACZ,QAAS,KAAM,YAAY,WAAY,MAAoC;AACrF,kBAAY,SAAS;AACrB,gBAAW,SAAS,KAAM;AAC1B,iBAAW,OAAO;AAElB,UAAK,YAAY,aAAc,KAAQ;AAEvC,UAAI,SAAS,EAAK,OAAM;AACxB;AACA,cAAQ,MAAM,WAAW;AACzB,cAAQ;;AAIV,eAAU;AACV,aAAQ;AAER,WAAM,QAAQ;;AAGhB,cAAU;AACV,YAAQ;AAER,UAAM,QAAQ;AACd,QAAI,UAAU,IAAI;AAChB,UAAK,MAAM;AACX,WAAM,OAAO;AACb;;AAEF,UAAM,SAAS;AACf,UAAM,QAAS,UAAW;AAC1B,UAAM,OAAO;GAEf,KAAK;AACH,QAAI,MAAM,OAAO;AAEf,SAAI,MAAM;AACV,YAAO,OAAO,GAAG;AACf,UAAI,SAAS,EAAK,OAAM;AACxB;AACA,cAAQ,MAAM,WAAW;AACzB,cAAQ;;AAGV,WAAM,UAAU,QAAS,KAAK,MAAM,SAAS;AAE7C,eAAU,MAAM;AAChB,aAAQ,MAAM;AAEd,WAAM,QAAQ,MAAM;;AAGtB,QAAI,MAAM,SAAS,MAAM,MAAM;AAC7B,UAAK,MAAM;AACX,WAAM,OAAO;AACb;;AAIF,UAAM,OAAO;GAEf,KAAK;AACH,QAAI,SAAS,EAAK,OAAM;AACxB,WAAO,OAAO;AACd,QAAI,MAAM,SAAS,MAAM;AACvB,YAAO,MAAM,SAAS;AACtB,SAAI,OAAO,MAAM,OACf;UAAI,MAAM,MAAM;AACd,YAAK,MAAM;AACX,aAAM,OAAO;AACb;;;AAkBJ,SAAI,OAAO,MAAM,OAAO;AACtB,cAAQ,MAAM;AACd,aAAO,MAAM,QAAQ;WAGrB,QAAO,MAAM,QAAQ;AAEvB,SAAI,OAAO,MAAM,OAAU,QAAO,MAAM;AACxC,mBAAc,MAAM;WAEjB;AACH,mBAAc;AACd,YAAO,MAAM,MAAM;AACnB,YAAO,MAAM;;AAEf,QAAI,OAAO,KAAQ,QAAO;AAC1B,YAAQ;AACR,UAAM,UAAU;AAChB;AACE,YAAO,SAAS,YAAY;WACrB,EAAE;AACX,QAAI,MAAM,WAAW,EAAK,OAAM,OAAO;AACvC;GACF,KAAK;AACH,QAAI,SAAS,EAAK,OAAM;AACxB,WAAO,SAAS,MAAM;AACtB;AACA,UAAM,OAAO;AACb;GACF,KAAK;AACH,QAAI,MAAM,MAAM;AAEd,YAAO,OAAO,IAAI;AAChB,UAAI,SAAS,EAAK,OAAM;AACxB;AAEA,cAAQ,MAAM,WAAW;AACzB,cAAQ;;AAGV,aAAQ;AACR,UAAK,aAAa;AAClB,WAAM,SAAS;AACf,SAAI,KACF,MAAK,QAAQ,MAAM,QAEd,MAAM,QAAQ,MAAM,MAAM,OAAO,QAAQ,MAAM,MAAM,KAAK,GAAG,QAAQ,MAAM,OAAO,QAAQ,MAAM,MAAM,KAAK;AAGlH,YAAO;AAEP,UAAK,MAAM,QAAQ,OAAO,QAAQ,KAAK,MAAM,MAAM,OAAO;AACxD,WAAK,MAAM;AACX,YAAM,OAAO;AACb;;AAGF,YAAO;AACP,YAAO;;AAIT,UAAM,OAAO;GAEf,KAAK;AACH,QAAI,MAAM,QAAQ,MAAM,OAAO;AAE7B,YAAO,OAAO,IAAI;AAChB,UAAI,SAAS,EAAK,OAAM;AACxB;AACA,cAAQ,MAAM,WAAW;AACzB,cAAQ;;AAGV,SAAI,UAAU,MAAM,QAAQ,aAAa;AACvC,WAAK,MAAM;AACX,YAAM,OAAO;AACb;;AAGF,YAAO;AACP,YAAO;;AAIT,UAAM,OAAO;GAEf,KAAK;AACH,UAAM;AACN,UAAM;GACR,KAAK;AACH,UAAM;AACN,UAAM;GACR,KAAK,IACH,QAAO;GACT,KAAK;GAEL,QACE,QAAO;;AAcb,OAAK,WAAW;AAChB,OAAK,YAAY;AACjB,OAAK,UAAU;AACf,OAAK,WAAW;AAChB,QAAM,OAAO;AACb,QAAM,OAAO;AAGb,MAAI,MAAM,SAAU,SAAS,KAAK,aAAa,MAAM,OAAO,QACvC,MAAM,OAAO,SAAS,UAAU,WACnD;OAAI,aAAa,MAAM,KAAK,QAAQ,KAAK,UAAU,OAAO,KAAK,UAAU,EAAE;AACzE,UAAM,OAAO;AACb,WAAO;;;AAGX,SAAO,KAAK;AACZ,UAAQ,KAAK;AACb,OAAK,YAAY;AACjB,OAAK,aAAa;AAClB,QAAM,SAAS;AACf,MAAI,MAAM,QAAQ,KAChB,MAAK,QAAQ,MAAM,QAChB,MAAM,QAAQ,MAAM,MAAM,OAAO,QAAQ,MAAM,KAAK,WAAW,KAAK,GAAG,QAAQ,MAAM,OAAO,QAAQ,MAAM,KAAK,WAAW,KAAK;AAEpI,OAAK,YAAY,MAAM,QAAQ,MAAM,OAAO,KAAK,MAC9B,MAAM,SAAS,OAAO,MAAM,MAC5B,MAAM,SAAS,QAAQ,MAAM,SAAS,QAAQ,MAAM;AACvE,OAAM,QAAQ,KAAK,SAAS,KAAM,UAAU,aAAa,QAAQ,KAC/D,OAAM;AAER,SAAO;;CAGT,SAAS,WAAW,MAAM;AAExB,MAAI,CAAC,QAAQ,CAAC,KAAK,MACjB,QAAO;EAGT,IAAI,QAAQ,KAAK;AACjB,MAAI,MAAM,OACR,OAAM,SAAS;AAEjB,OAAK,QAAQ;AACb,SAAO;;CAGT,SAAS,iBAAiB,MAAM,MAAM;EACpC,IAAI;AAGJ,MAAI,CAAC,QAAQ,CAAC,KAAK,MAAS,QAAO;AACnC,UAAQ,KAAK;AACb,OAAK,MAAM,OAAO,OAAO,EAAK,QAAO;AAGrC,QAAM,OAAO;AACb,OAAK,OAAO;AACZ,SAAO;;CAGT,SAAS,qBAAqB,MAAM,YAAY;EAC9C,IAAI,aAAa,WAAW;EAE5B,IAAI;EACJ,IAAI;EACJ,IAAI;AAGJ,MAAI,CAAC,QAAwB,CAAC,KAAK,MAAyB,QAAO;AACnE,UAAQ,KAAK;AAEb,MAAI,MAAM,SAAS,KAAK,MAAM,SAAS,KACrC,QAAO;AAIT,MAAI,MAAM,SAAS,MAAM;AACvB,YAAS;AAET,YAAS,QAAQ,QAAQ,YAAY,YAAY,EAAE;AACnD,OAAI,WAAW,MAAM,MACnB,QAAO;;AAKX,QAAM,aAAa,MAAM,YAAY,YAAY,WAAW;AAC5D,MAAI,KAAK;AACP,SAAM,OAAO;AACb,UAAO;;AAET,QAAM,WAAW;AAEjB,SAAO;;AAGT,SAAQ,eAAe;AACvB,SAAQ,gBAAgB;AACxB,SAAQ,mBAAmB;AAC3B,SAAQ,cAAc;AACtB,SAAQ,eAAe;AACvB,SAAQ,UAAU;AAClB,SAAQ,aAAa;AACrB,SAAQ,mBAAmB;AAC3B,SAAQ,uBAAuB;AAC/B,SAAQ,cAAc"}

package/dist/cjs/node_modules/pako/lib/zlib/inftrees.cjs

@@ -1,278 +0,0 @@
-const require_rolldown_runtime = require('../../../../_virtual/rolldown_runtime.cjs');
-const require_common$1 = require('../utils/common.cjs');
-
-//#region ../../node_modules/pako/lib/zlib/inftrees.js
-var require_inftrees = /* @__PURE__ */ require_rolldown_runtime.__commonJS({ "../../node_modules/pako/lib/zlib/inftrees.js": ((exports, module) => {
-	var utils = require_common$1.default;
-	var MAXBITS = 15;
-	var ENOUGH_LENS = 852;
-	var ENOUGH_DISTS = 592;
-	var CODES = 0;
-	var LENS = 1;
-	var DISTS = 2;
-	var lbase = [
-		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
-	];
-	var lext = [
-		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
-	];
-	var dbase = [
-		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
-	];
-	var dext = [
-		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
-	];
-	module.exports = function inflate_table(type, lens, lens_index, codes, table, table_index, work, opts) {
-		var bits = opts.bits;
-		var len = 0;
-		var sym = 0;
-		var min = 0, max = 0;
-		var root = 0;
-		var curr = 0;
-		var drop = 0;
-		var left = 0;
-		var used = 0;
-		var huff = 0;
-		var incr;
-		var fill;
-		var low;
-		var mask;
-		var next;
-		var base = null;
-		var base_index = 0;
-		var end;
-		var count = new utils.Buf16(MAXBITS + 1);
-		var offs = new utils.Buf16(MAXBITS + 1);
-		var extra = null;
-		var extra_index = 0;
-		var here_bits, here_op, here_val;
-		for (len = 0; len <= MAXBITS; len++) count[len] = 0;
-		for (sym = 0; sym < codes; sym++) count[lens[lens_index + sym]]++;
-		root = bits;
-		for (max = MAXBITS; max >= 1; max--) if (count[max] !== 0) break;
-		if (root > max) root = max;
-		if (max === 0) {
-			table[table_index++] = 20971520;
-			table[table_index++] = 20971520;
-			opts.bits = 1;
-			return 0;
-		}
-		for (min = 1; min < max; min++) if (count[min] !== 0) break;
-		if (root < min) root = min;
-		left = 1;
-		for (len = 1; len <= MAXBITS; len++) {
-			left <<= 1;
-			left -= count[len];
-			if (left < 0) return -1;
-		}
-		if (left > 0 && (type === CODES || max !== 1)) return -1;
-		offs[1] = 0;
-		for (len = 1; len < MAXBITS; len++) offs[len + 1] = offs[len] + count[len];
-		for (sym = 0; sym < codes; sym++) if (lens[lens_index + sym] !== 0) work[offs[lens[lens_index + sym]]++] = sym;
-		if (type === CODES) {
-			base = extra = work;
-			end = 19;
-		} else if (type === LENS) {
-			base = lbase;
-			base_index -= 257;
-			extra = lext;
-			extra_index -= 257;
-			end = 256;
-		} else {
-			base = dbase;
-			extra = dext;
-			end = -1;
-		}
-		huff = 0;
-		sym = 0;
-		len = min;
-		next = table_index;
-		curr = root;
-		drop = 0;
-		low = -1;
-		used = 1 << root;
-		mask = used - 1;
-		if (type === LENS && used > ENOUGH_LENS || type === DISTS && used > ENOUGH_DISTS) return 1;
-		for (;;) {
-			here_bits = len - drop;
-			if (work[sym] < end) {
-				here_op = 0;
-				here_val = work[sym];
-			} else if (work[sym] > end) {
-				here_op = extra[extra_index + work[sym]];
-				here_val = base[base_index + work[sym]];
-			} else {
-				here_op = 96;
-				here_val = 0;
-			}
-			incr = 1 << len - drop;
-			fill = 1 << curr;
-			min = fill;
-			do {
-				fill -= incr;
-				table[next + (huff >> drop) + fill] = here_bits << 24 | here_op << 16 | here_val | 0;
-			} while (fill !== 0);
-			incr = 1 << len - 1;
-			while (huff & incr) incr >>= 1;
-			if (incr !== 0) {
-				huff &= incr - 1;
-				huff += incr;
-			} else huff = 0;
-			sym++;
-			if (--count[len] === 0) {
-				if (len === max) break;
-				len = lens[lens_index + work[sym]];
-			}
-			if (len > root && (huff & mask) !== low) {
-				if (drop === 0) drop = root;
-				next += min;
-				curr = len - drop;
-				left = 1 << curr;
-				while (curr + drop < max) {
-					left -= count[curr + drop];
-					if (left <= 0) break;
-					curr++;
-					left <<= 1;
-				}
-				used += 1 << curr;
-				if (type === LENS && used > ENOUGH_LENS || type === DISTS && used > ENOUGH_DISTS) return 1;
-				low = huff & mask;
-				table[low] = root << 24 | curr << 16 | next - table_index | 0;
-			}
-		}
-		if (huff !== 0) table[next + huff] = len - drop << 24 | 4194304;
-		opts.bits = root;
-		return 0;
-	};
-}) });
-
-//#endregion
-Object.defineProperty(exports, 'default', {
-  enumerable: true,
-  get: function () {
-    return require_inftrees();
-  }
-});
-//# sourceMappingURL=inftrees.cjs.map

package/dist/cjs/node_modules/pako/lib/zlib/inftrees.cjs.map

@@ -1 +0,0 @@
-{"version":3,"file":"inftrees.cjs","names":[],"sources":["../../../../../../../../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"],"x_google_ignoreList":[0],"mappings":";;;;;CAqBA,IAAI;CAEJ,IAAI,UAAU;CACd,IAAI,cAAc;CAClB,IAAI,eAAe;CAGnB,IAAI,QAAQ;CACZ,IAAI,OAAO;CACX,IAAI,QAAQ;CAEZ,IAAI,QAAQ;EACV;EAAG;EAAG;EAAG;EAAG;EAAG;EAAG;EAAG;EAAI;EAAI;EAAI;EAAI;EAAI;EAAI;EAAI;EAAI;EACrD;EAAI;EAAI;EAAI;EAAI;EAAI;EAAI;EAAI;EAAK;EAAK;EAAK;EAAK;EAAK;EAAK;EAAG;EAC9D;CAED,IAAI,OAAO;EACT;EAAI;EAAI;EAAI;EAAI;EAAI;EAAI;EAAI;EAAI;EAAI;EAAI;EAAI;EAAI;EAAI;EAAI;EAAI;EAC5D;EAAI;EAAI;EAAI;EAAI;EAAI;EAAI;EAAI;EAAI;EAAI;EAAI;EAAI;EAAI;EAAI;EAAI;EACzD;CAED,IAAI,QAAQ;EACV;EAAG;EAAG;EAAG;EAAG;EAAG;EAAG;EAAG;EAAI;EAAI;EAAI;EAAI;EAAI;EAAI;EAAI;EAAK;EACtD;EAAK;EAAK;EAAK;EAAK;EAAM;EAAM;EAAM;EAAM;EAAM;EAClD;EAAM;EAAO;EAAO;EAAO;EAAG;EAC/B;CAED,IAAI,OAAO;EACT;EAAI;EAAI;EAAI;EAAI;EAAI;EAAI;EAAI;EAAI;EAAI;EAAI;EAAI;EAAI;EAAI;EAAI;EAAI;EAC5D;EAAI;EAAI;EAAI;EAAI;EAAI;EAAI;EAAI;EAAI;EAAI;EACpC;EAAI;EAAI;EAAI;EAAI;EAAI;EACrB;AAED,QAAO,UAAU,SAAS,cAAc,MAAM,MAAM,YAAY,OAAO,OAAO,aAAa,MAAM,MACjG;EACE,IAAI,OAAO,KAAK;EAGhB,IAAI,MAAM;EACV,IAAI,MAAM;EACV,IAAI,MAAM,GAAG,MAAM;EACnB,IAAI,OAAO;EACX,IAAI,OAAO;EACX,IAAI,OAAO;EACX,IAAI,OAAO;EACX,IAAI,OAAO;EACX,IAAI,OAAO;EACX,IAAI;EACJ,IAAI;EACJ,IAAI;EACJ,IAAI;EACJ,IAAI;EACJ,IAAI,OAAO;EACX,IAAI,aAAa;EAEjB,IAAI;EACJ,IAAI,QAAQ,IAAI,MAAM,MAAM,UAAU,EAAE;EACxC,IAAI,OAAO,IAAI,MAAM,MAAM,UAAU,EAAE;EACvC,IAAI,QAAQ;EACZ,IAAI,cAAc;EAElB,IAAI,WAAW,SAAS;AAkCxB,OAAK,MAAM,GAAG,OAAO,SAAS,MAC5B,OAAM,OAAO;AAEf,OAAK,MAAM,GAAG,MAAM,OAAO,MACzB,OAAM,KAAK,aAAa;AAI1B,SAAO;AACP,OAAK,MAAM,SAAS,OAAO,GAAG,MAC5B,KAAI,MAAM,SAAS,EAAK;AAE1B,MAAI,OAAO,IACT,QAAO;AAET,MAAI,QAAQ,GAAG;AAIb,SAAM,iBAAiB;AAMvB,SAAM,iBAAiB;AAEvB,QAAK,OAAO;AACZ,UAAO;;AAET,OAAK,MAAM,GAAG,MAAM,KAAK,MACvB,KAAI,MAAM,SAAS,EAAK;AAE1B,MAAI,OAAO,IACT,QAAO;AAIT,SAAO;AACP,OAAK,MAAM,GAAG,OAAO,SAAS,OAAO;AACnC,YAAS;AACT,WAAQ,MAAM;AACd,OAAI,OAAO,EACT,QAAO;;AAGX,MAAI,OAAO,MAAM,SAAS,SAAS,QAAQ,GACzC,QAAO;AAIT,OAAK,KAAK;AACV,OAAK,MAAM,GAAG,MAAM,SAAS,MAC3B,MAAK,MAAM,KAAK,KAAK,OAAO,MAAM;AAIpC,OAAK,MAAM,GAAG,MAAM,OAAO,MACzB,KAAI,KAAK,aAAa,SAAS,EAC7B,MAAK,KAAK,KAAK,aAAa,WAAW;AAsC3C,MAAI,SAAS,OAAO;AAClB,UAAO,QAAQ;AACf,SAAM;aAEG,SAAS,MAAM;AACxB,UAAO;AACP,iBAAc;AACd,WAAQ;AACR,kBAAe;AACf,SAAM;SAED;AACL,UAAO;AACP,WAAQ;AACR,SAAM;;AAIR,SAAO;AACP,QAAM;AACN,QAAM;AACN,SAAO;AACP,SAAO;AACP,SAAO;AACP,QAAM;AACN,SAAO,KAAK;AACZ,SAAO,OAAO;AAGd,MAAK,SAAS,QAAQ,OAAO,eAC1B,SAAS,SAAS,OAAO,aAC1B,QAAO;AAIT,WAAS;AAEP,eAAY,MAAM;AAClB,OAAI,KAAK,OAAO,KAAK;AACnB,cAAU;AACV,eAAW,KAAK;cAET,KAAK,OAAO,KAAK;AACxB,cAAU,MAAM,cAAc,KAAK;AACnC,eAAW,KAAK,aAAa,KAAK;UAE/B;AACH,cAAU;AACV,eAAW;;AAIb,UAAO,KAAM,MAAM;AACnB,UAAO,KAAK;AACZ,SAAM;AACN,MAAG;AACD,YAAQ;AACR,UAAM,QAAQ,QAAQ,QAAQ,QAAS,aAAa,KAAO,WAAW,KAAM,WAAU;YAC/E,SAAS;AAGlB,UAAO,KAAM,MAAM;AACnB,UAAO,OAAO,KACZ,UAAS;AAEX,OAAI,SAAS,GAAG;AACd,YAAQ,OAAO;AACf,YAAQ;SAER,QAAO;AAIT;AACA,OAAI,EAAE,MAAM,SAAS,GAAG;AACtB,QAAI,QAAQ,IAAO;AACnB,UAAM,KAAK,aAAa,KAAK;;AAI/B,OAAI,MAAM,SAAS,OAAO,UAAU,KAAK;AAEvC,QAAI,SAAS,EACX,QAAO;AAIT,YAAQ;AAGR,WAAO,MAAM;AACb,WAAO,KAAK;AACZ,WAAO,OAAO,OAAO,KAAK;AACxB,aAAQ,MAAM,OAAO;AACrB,SAAI,QAAQ,EAAK;AACjB;AACA,cAAS;;AAIX,YAAQ,KAAK;AACb,QAAK,SAAS,QAAQ,OAAO,eAC1B,SAAS,SAAS,OAAO,aAC1B,QAAO;AAIT,UAAM,OAAO;AAIb,UAAM,OAAQ,QAAQ,KAAO,QAAQ,KAAO,OAAO,cAAc;;;AAOrE,MAAI,SAAS,EAIX,OAAM,OAAO,QAAU,MAAM,QAAS,KAAO;AAK/C,OAAK,OAAO;AACZ,SAAO"}

package/dist/cjs/node_modules/pako/lib/zlib/messages.cjs

@@ -1,25 +0,0 @@
-const require_rolldown_runtime = require('../../../../_virtual/rolldown_runtime.cjs');
-
-//#region ../../node_modules/pako/lib/zlib/messages.js
-var require_messages = /* @__PURE__ */ require_rolldown_runtime.__commonJS({ "../../node_modules/pako/lib/zlib/messages.js": ((exports, module) => {
-	module.exports = {
-		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"
-	};
-}) });
-
-//#endregion
-Object.defineProperty(exports, 'default', {
-  enumerable: true,
-  get: function () {
-    return require_messages();
-  }
-});
-//# sourceMappingURL=messages.cjs.map

package/dist/cjs/node_modules/pako/lib/zlib/messages.cjs.map

@@ -1 +0,0 @@
-{"version":3,"file":"messages.cjs","names":[],"sources":["../../../../../../../../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"],"x_google_ignoreList":[0],"mappings":";;;;AAqBA,QAAO,UAAU;EACf,GAAQ;EACR,GAAQ;EACR,GAAQ;EACR,MAAQ;EACR,MAAQ;EACR,MAAQ;EACR,MAAQ;EACR,MAAQ;EACR,MAAQ;EACT"}