@cesium/engine 26.0.0 → 26.1.0

package/Build/Workers/decodeGoogleEarthEnterprisePacket.js

@@ -1,7 +1,7 @@
 /**
  * @license
  * Cesium - https://github.com/CesiumGS/cesium
- * Version 1.142.0
+ * Version 1.143.0
  *
  * Copyright 2011-2022 Cesium Contributors
  *
@@ -25,2321 +25,16 @@
 
 import {
   createTaskProcessorWorker_default
-} from "./chunk-4S7IE3LB.js";
+} from "./chunk-XDWCTQCZ.js";
 import {
   RuntimeError_default
-} from "./chunk-Y5BF6AFU.js";
+} from "./chunk-GXWQZBAI.js";
 import {
   Check_default
-} from "./chunk-AYKR4VBR.js";
+} from "./chunk-6YR6JBMY.js";
 import {
-  __commonJS,
-  __toESM,
   defined_default
-} from "./chunk-ZP7JMQV4.js";
-
-// node_modules/pako/lib/zlib/adler32.js
-var require_adler32 = __commonJS({
-  "node_modules/pako/lib/zlib/adler32.js"(exports, module) {
-    "use strict";
-    var adler32 = (adler, buf, len, pos) => {
-      let s1 = adler & 65535 | 0, s2 = adler >>> 16 & 65535 | 0, n = 0;
-      while (len !== 0) {
-        n = len > 2e3 ? 2e3 : len;
-        len -= n;
-        do {
-          s1 = s1 + buf[pos++] | 0;
-          s2 = s2 + s1 | 0;
-        } while (--n);
-        s1 %= 65521;
-        s2 %= 65521;
-      }
-      return s1 | s2 << 16 | 0;
-    };
-    module.exports = adler32;
-  }
-});
-
-// node_modules/pako/lib/zlib/crc32.js
-var require_crc32 = __commonJS({
-  "node_modules/pako/lib/zlib/crc32.js"(exports, module) {
-    "use strict";
-    var makeTable = () => {
-      let c, table = [];
-      for (var n = 0; n < 256; n++) {
-        c = n;
-        for (var k = 0; k < 8; k++) {
-          c = c & 1 ? 3988292384 ^ c >>> 1 : c >>> 1;
-        }
-        table[n] = c;
-      }
-      return table;
-    };
-    var crcTable = new Uint32Array(makeTable());
-    var crc32 = (crc, buf, len, pos) => {
-      const t = crcTable;
-      const end = pos + len;
-      crc ^= -1;
-      for (let i = pos; i < end; i++) {
-        crc = crc >>> 8 ^ t[(crc ^ buf[i]) & 255];
-      }
-      return crc ^ -1;
-    };
-    module.exports = crc32;
-  }
-});
-
-// node_modules/pako/lib/zlib/inffast.js
-var require_inffast = __commonJS({
-  "node_modules/pako/lib/zlib/inffast.js"(exports, module) {
-    "use strict";
-    var BAD = 16209;
-    var TYPE = 16191;
-    module.exports = function inflate_fast(strm, start) {
-      let _in;
-      let last;
-      let _out;
-      let beg;
-      let end;
-      let dmax;
-      let wsize;
-      let whave;
-      let wnext;
-      let s_window;
-      let hold;
-      let bits;
-      let lcode;
-      let dcode;
-      let lmask;
-      let dmask;
-      let here;
-      let op;
-      let len;
-      let dist;
-      let from;
-      let from_source;
-      let input, output;
-      const state = strm.state;
-      _in = strm.next_in;
-      input = strm.input;
-      last = _in + (strm.avail_in - 5);
-      _out = strm.next_out;
-      output = strm.output;
-      beg = _out - (start - strm.avail_out);
-      end = _out + (strm.avail_out - 257);
-      dmax = state.dmax;
-      wsize = state.wsize;
-      whave = state.whave;
-      wnext = state.wnext;
-      s_window = state.window;
-      hold = state.hold;
-      bits = state.bits;
-      lcode = state.lencode;
-      dcode = state.distcode;
-      lmask = (1 << state.lenbits) - 1;
-      dmask = (1 << state.distbits) - 1;
-      top:
-        do {
-          if (bits < 15) {
-            hold += input[_in++] << bits;
-            bits += 8;
-            hold += input[_in++] << bits;
-            bits += 8;
-          }
-          here = lcode[hold & lmask];
-          dolen:
-            for (; ; ) {
-              op = here >>> 24;
-              hold >>>= op;
-              bits -= op;
-              op = here >>> 16 & 255;
-              if (op === 0) {
-                output[_out++] = here & 65535;
-              } else if (op & 16) {
-                len = here & 65535;
-                op &= 15;
-                if (op) {
-                  if (bits < op) {
-                    hold += input[_in++] << bits;
-                    bits += 8;
-                  }
-                  len += hold & (1 << op) - 1;
-                  hold >>>= op;
-                  bits -= op;
-                }
-                if (bits < 15) {
-                  hold += input[_in++] << bits;
-                  bits += 8;
-                  hold += input[_in++] << bits;
-                  bits += 8;
-                }
-                here = dcode[hold & dmask];
-                dodist:
-                  for (; ; ) {
-                    op = here >>> 24;
-                    hold >>>= op;
-                    bits -= op;
-                    op = here >>> 16 & 255;
-                    if (op & 16) {
-                      dist = here & 65535;
-                      op &= 15;
-                      if (bits < op) {
-                        hold += input[_in++] << bits;
-                        bits += 8;
-                        if (bits < op) {
-                          hold += input[_in++] << bits;
-                          bits += 8;
-                        }
-                      }
-                      dist += hold & (1 << op) - 1;
-                      if (dist > dmax) {
-                        strm.msg = "invalid distance too far back";
-                        state.mode = BAD;
-                        break top;
-                      }
-                      hold >>>= op;
-                      bits -= op;
-                      op = _out - beg;
-                      if (dist > op) {
-                        op = dist - op;
-                        if (op > whave) {
-                          if (state.sane) {
-                            strm.msg = "invalid distance too far back";
-                            state.mode = BAD;
-                            break top;
-                          }
-                        }
-                        from = 0;
-                        from_source = s_window;
-                        if (wnext === 0) {
-                          from += wsize - op;
-                          if (op < len) {
-                            len -= op;
-                            do {
-                              output[_out++] = s_window[from++];
-                            } while (--op);
-                            from = _out - dist;
-                            from_source = output;
-                          }
-                        } else if (wnext < op) {
-                          from += wsize + wnext - op;
-                          op -= wnext;
-                          if (op < len) {
-                            len -= op;
-                            do {
-                              output[_out++] = s_window[from++];
-                            } while (--op);
-                            from = 0;
-                            if (wnext < len) {
-                              op = wnext;
-                              len -= op;
-                              do {
-                                output[_out++] = s_window[from++];
-                              } while (--op);
-                              from = _out - dist;
-                              from_source = output;
-                            }
-                          }
-                        } else {
-                          from += wnext - op;
-                          if (op < len) {
-                            len -= op;
-                            do {
-                              output[_out++] = s_window[from++];
-                            } while (--op);
-                            from = _out - dist;
-                            from_source = output;
-                          }
-                        }
-                        while (len > 2) {
-                          output[_out++] = from_source[from++];
-                          output[_out++] = from_source[from++];
-                          output[_out++] = from_source[from++];
-                          len -= 3;
-                        }
-                        if (len) {
-                          output[_out++] = from_source[from++];
-                          if (len > 1) {
-                            output[_out++] = from_source[from++];
-                          }
-                        }
-                      } else {
-                        from = _out - dist;
-                        do {
-                          output[_out++] = output[from++];
-                          output[_out++] = output[from++];
-                          output[_out++] = output[from++];
-                          len -= 3;
-                        } while (len > 2);
-                        if (len) {
-                          output[_out++] = output[from++];
-                          if (len > 1) {
-                            output[_out++] = output[from++];
-                          }
-                        }
-                      }
-                    } else if ((op & 64) === 0) {
-                      here = dcode[(here & 65535) + (hold & (1 << op) - 1)];
-                      continue dodist;
-                    } else {
-                      strm.msg = "invalid distance code";
-                      state.mode = BAD;
-                      break top;
-                    }
-                    break;
-                  }
-              } else if ((op & 64) === 0) {
-                here = lcode[(here & 65535) + (hold & (1 << op) - 1)];
-                continue dolen;
-              } else if (op & 32) {
-                state.mode = TYPE;
-                break top;
-              } else {
-                strm.msg = "invalid literal/length code";
-                state.mode = BAD;
-                break top;
-              }
-              break;
-            }
-        } while (_in < last && _out < end);
-      len = bits >> 3;
-      _in -= len;
-      bits -= len << 3;
-      hold &= (1 << bits) - 1;
-      strm.next_in = _in;
-      strm.next_out = _out;
-      strm.avail_in = _in < last ? 5 + (last - _in) : 5 - (_in - last);
-      strm.avail_out = _out < end ? 257 + (end - _out) : 257 - (_out - end);
-      state.hold = hold;
-      state.bits = bits;
-      return;
-    };
-  }
-});
-
-// node_modules/pako/lib/zlib/inftrees.js
-var require_inftrees = __commonJS({
-  "node_modules/pako/lib/zlib/inftrees.js"(exports, module) {
-    "use strict";
-    var MAXBITS = 15;
-    var ENOUGH_LENS = 852;
-    var ENOUGH_DISTS = 592;
-    var CODES = 0;
-    var LENS = 1;
-    var DISTS = 2;
-    var lbase = new Uint16Array([
-      /* Length codes 257..285 base */
-      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 = new Uint8Array([
-      /* Length codes 257..285 extra */
-      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 = new Uint16Array([
-      /* Distance codes 0..29 base */
-      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 = new Uint8Array([
-      /* Distance codes 0..29 extra */
-      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
-    ]);
-    var inflate_table = (type, lens, lens_index, codes, table, table_index, work, opts) => {
-      const bits = opts.bits;
-      let len = 0;
-      let sym = 0;
-      let min = 0, max = 0;
-      let root = 0;
-      let curr = 0;
-      let drop = 0;
-      let left = 0;
-      let used = 0;
-      let huff = 0;
-      let incr;
-      let fill;
-      let low;
-      let mask;
-      let next;
-      let base = null;
-      let match;
-      const count = new Uint16Array(MAXBITS + 1);
-      const offs = new Uint16Array(MAXBITS + 1);
-      let extra = null;
-      let 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++] = 1 << 24 | 64 << 16 | 0;
-        table[table_index++] = 1 << 24 | 64 << 16 | 0;
-        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;
-        match = 20;
-      } else if (type === LENS) {
-        base = lbase;
-        extra = lext;
-        match = 257;
-      } else {
-        base = dbase;
-        extra = dext;
-        match = 0;
-      }
-      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] + 1 < match) {
-          here_op = 0;
-          here_val = work[sym];
-        } else if (work[sym] >= match) {
-          here_op = extra[work[sym] - match];
-          here_val = base[work[sym] - match];
-        } else {
-          here_op = 32 + 64;
-          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 | 64 << 16 | 0;
-      }
-      opts.bits = root;
-      return 0;
-    };
-    module.exports = inflate_table;
-  }
-});
-
-// node_modules/pako/lib/zlib/constants.js
-var require_constants = __commonJS({
-  "node_modules/pako/lib/zlib/constants.js"(exports, module) {
-    "use strict";
-    module.exports = {
-      /* Allowed flush values; see deflate() and inflate() below for details */
-      Z_NO_FLUSH: 0,
-      Z_PARTIAL_FLUSH: 1,
-      Z_SYNC_FLUSH: 2,
-      Z_FULL_FLUSH: 3,
-      Z_FINISH: 4,
-      Z_BLOCK: 5,
-      Z_TREES: 6,
-      /* Return codes for the compression/decompression functions. Negative values
-      * are errors, positive values are used for special but normal events.
-      */
-      Z_OK: 0,
-      Z_STREAM_END: 1,
-      Z_NEED_DICT: 2,
-      Z_ERRNO: -1,
-      Z_STREAM_ERROR: -2,
-      Z_DATA_ERROR: -3,
-      Z_MEM_ERROR: -4,
-      Z_BUF_ERROR: -5,
-      //Z_VERSION_ERROR: -6,
-      /* compression levels */
-      Z_NO_COMPRESSION: 0,
-      Z_BEST_SPEED: 1,
-      Z_BEST_COMPRESSION: 9,
-      Z_DEFAULT_COMPRESSION: -1,
-      Z_FILTERED: 1,
-      Z_HUFFMAN_ONLY: 2,
-      Z_RLE: 3,
-      Z_FIXED: 4,
-      Z_DEFAULT_STRATEGY: 0,
-      /* Possible values of the data_type field (though see inflate()) */
-      Z_BINARY: 0,
-      Z_TEXT: 1,
-      //Z_ASCII:                1, // = Z_TEXT (deprecated)
-      Z_UNKNOWN: 2,
-      /* The deflate compression method */
-      Z_DEFLATED: 8
-      //Z_NULL:                 null // Use -1 or null inline, depending on var type
-    };
-  }
-});
-
-// node_modules/pako/lib/zlib/inflate.js
-var require_inflate = __commonJS({
-  "node_modules/pako/lib/zlib/inflate.js"(exports, module) {
-    "use strict";
-    var adler32 = require_adler32();
-    var crc32 = require_crc32();
-    var inflate_fast = require_inffast();
-    var inflate_table = require_inftrees();
-    var CODES = 0;
-    var LENS = 1;
-    var DISTS = 2;
-    var {
-      Z_FINISH,
-      Z_BLOCK,
-      Z_TREES,
-      Z_OK,
-      Z_STREAM_END,
-      Z_NEED_DICT,
-      Z_STREAM_ERROR,
-      Z_DATA_ERROR,
-      Z_MEM_ERROR,
-      Z_BUF_ERROR,
-      Z_DEFLATED
-    } = require_constants();
-    var HEAD = 16180;
-    var FLAGS = 16181;
-    var TIME = 16182;
-    var OS = 16183;
-    var EXLEN = 16184;
-    var EXTRA = 16185;
-    var NAME = 16186;
-    var COMMENT = 16187;
-    var HCRC = 16188;
-    var DICTID = 16189;
-    var DICT = 16190;
-    var TYPE = 16191;
-    var TYPEDO = 16192;
-    var STORED = 16193;
-    var COPY_ = 16194;
-    var COPY = 16195;
-    var TABLE = 16196;
-    var LENLENS = 16197;
-    var CODELENS = 16198;
-    var LEN_ = 16199;
-    var LEN = 16200;
-    var LENEXT = 16201;
-    var DIST = 16202;
-    var DISTEXT = 16203;
-    var MATCH = 16204;
-    var LIT = 16205;
-    var CHECK = 16206;
-    var LENGTH = 16207;
-    var DONE = 16208;
-    var BAD = 16209;
-    var MEM = 16210;
-    var SYNC = 16211;
-    var ENOUGH_LENS = 852;
-    var ENOUGH_DISTS = 592;
-    var MAX_WBITS = 15;
-    var DEF_WBITS = MAX_WBITS;
-    var zswap32 = (q) => {
-      return (q >>> 24 & 255) + (q >>> 8 & 65280) + ((q & 65280) << 8) + ((q & 255) << 24);
-    };
-    function InflateState() {
-      this.strm = null;
-      this.mode = 0;
-      this.last = false;
-      this.wrap = 0;
-      this.havedict = false;
-      this.flags = 0;
-      this.dmax = 0;
-      this.check = 0;
-      this.total = 0;
-      this.head = null;
-      this.wbits = 0;
-      this.wsize = 0;
-      this.whave = 0;
-      this.wnext = 0;
-      this.window = null;
-      this.hold = 0;
-      this.bits = 0;
-      this.length = 0;
-      this.offset = 0;
-      this.extra = 0;
-      this.lencode = null;
-      this.distcode = null;
-      this.lenbits = 0;
-      this.distbits = 0;
-      this.ncode = 0;
-      this.nlen = 0;
-      this.ndist = 0;
-      this.have = 0;
-      this.next = null;
-      this.lens = new Uint16Array(320);
-      this.work = new Uint16Array(288);
-      this.lendyn = null;
-      this.distdyn = null;
-      this.sane = 0;
-      this.back = 0;
-      this.was = 0;
-    }
-    var inflateStateCheck = (strm) => {
-      if (!strm) {
-        return 1;
-      }
-      const state = strm.state;
-      if (!state || state.strm !== strm || state.mode < HEAD || state.mode > SYNC) {
-        return 1;
-      }
-      return 0;
-    };
-    var inflateResetKeep = (strm) => {
-      if (inflateStateCheck(strm)) {
-        return Z_STREAM_ERROR;
-      }
-      const state = strm.state;
-      strm.total_in = strm.total_out = state.total = 0;
-      strm.msg = "";
-      if (state.wrap) {
-        strm.adler = state.wrap & 1;
-      }
-      state.mode = HEAD;
-      state.last = 0;
-      state.havedict = 0;
-      state.flags = -1;
-      state.dmax = 32768;
-      state.head = null;
-      state.hold = 0;
-      state.bits = 0;
-      state.lencode = state.lendyn = new Int32Array(ENOUGH_LENS);
-      state.distcode = state.distdyn = new Int32Array(ENOUGH_DISTS);
-      state.sane = 1;
-      state.back = -1;
-      return Z_OK;
-    };
-    var inflateReset = (strm) => {
-      if (inflateStateCheck(strm)) {
-        return Z_STREAM_ERROR;
-      }
-      const state = strm.state;
-      state.wsize = 0;
-      state.whave = 0;
-      state.wnext = 0;
-      return inflateResetKeep(strm);
-    };
-    var inflateReset2 = (strm, windowBits) => {
-      let wrap;
-      if (inflateStateCheck(strm)) {
-        return Z_STREAM_ERROR;
-      }
-      const state = strm.state;
-      if (windowBits < 0) {
-        wrap = 0;
-        windowBits = -windowBits;
-      } else {
-        wrap = (windowBits >> 4) + 5;
-        if (windowBits < 48) {
-          windowBits &= 15;
-        }
-      }
-      if (windowBits && (windowBits < 8 || windowBits > 15)) {
-        return Z_STREAM_ERROR;
-      }
-      if (state.window !== null && state.wbits !== windowBits) {
-        state.window = null;
-      }
-      state.wrap = wrap;
-      state.wbits = windowBits;
-      return inflateReset(strm);
-    };
-    var inflateInit2 = (strm, windowBits) => {
-      if (!strm) {
-        return Z_STREAM_ERROR;
-      }
-      const state = new InflateState();
-      strm.state = state;
-      state.strm = strm;
-      state.window = null;
-      state.mode = HEAD;
-      const ret = inflateReset2(strm, windowBits);
-      if (ret !== Z_OK) {
-        strm.state = null;
-      }
-      return ret;
-    };
-    var inflateInit = (strm) => {
-      return inflateInit2(strm, DEF_WBITS);
-    };
-    var virgin = true;
-    var lenfix;
-    var distfix;
-    var fixedtables = (state) => {
-      if (virgin) {
-        lenfix = new Int32Array(512);
-        distfix = new Int32Array(32);
-        let sym = 0;
-        while (sym < 144) {
-          state.lens[sym++] = 8;
-        }
-        while (sym < 256) {
-          state.lens[sym++] = 9;
-        }
-        while (sym < 280) {
-          state.lens[sym++] = 7;
-        }
-        while (sym < 288) {
-          state.lens[sym++] = 8;
-        }
-        inflate_table(LENS, state.lens, 0, 288, lenfix, 0, state.work, { bits: 9 });
-        sym = 0;
-        while (sym < 32) {
-          state.lens[sym++] = 5;
-        }
-        inflate_table(DISTS, state.lens, 0, 32, distfix, 0, state.work, { bits: 5 });
-        virgin = false;
-      }
-      state.lencode = lenfix;
-      state.lenbits = 9;
-      state.distcode = distfix;
-      state.distbits = 5;
-    };
-    var updatewindow = (strm, src, end, copy) => {
-      let dist;
-      const state = strm.state;
-      if (state.window === null) {
-        state.wsize = 1 << state.wbits;
-        state.wnext = 0;
-        state.whave = 0;
-        state.window = new Uint8Array(state.wsize);
-      }
-      if (copy >= state.wsize) {
-        state.window.set(src.subarray(end - state.wsize, end), 0);
-        state.wnext = 0;
-        state.whave = state.wsize;
-      } else {
-        dist = state.wsize - state.wnext;
-        if (dist > copy) {
-          dist = copy;
-        }
-        state.window.set(src.subarray(end - copy, end - copy + dist), state.wnext);
-        copy -= dist;
-        if (copy) {
-          state.window.set(src.subarray(end - copy, end), 0);
-          state.wnext = copy;
-          state.whave = state.wsize;
-        } else {
-          state.wnext += dist;
-          if (state.wnext === state.wsize) {
-            state.wnext = 0;
-          }
-          if (state.whave < state.wsize) {
-            state.whave += dist;
-          }
-        }
-      }
-      return 0;
-    };
-    var inflate = (strm, flush) => {
-      let state;
-      let input, output;
-      let next;
-      let put;
-      let have, left;
-      let hold;
-      let bits;
-      let _in, _out;
-      let copy;
-      let from;
-      let from_source;
-      let here = 0;
-      let here_bits, here_op, here_val;
-      let last_bits, last_op, last_val;
-      let len;
-      let ret;
-      const hbuf = new Uint8Array(4);
-      let opts;
-      let n;
-      const order = (
-        /* permutation of code lengths */
-        new Uint8Array([16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15])
-      );
-      if (inflateStateCheck(strm) || !strm.output || !strm.input && strm.avail_in !== 0) {
-        return Z_STREAM_ERROR;
-      }
-      state = strm.state;
-      if (state.mode === TYPE) {
-        state.mode = TYPEDO;
-      }
-      put = strm.next_out;
-      output = strm.output;
-      left = strm.avail_out;
-      next = strm.next_in;
-      input = strm.input;
-      have = strm.avail_in;
-      hold = state.hold;
-      bits = state.bits;
-      _in = have;
-      _out = left;
-      ret = Z_OK;
-      inf_leave:
-        for (; ; ) {
-          switch (state.mode) {
-            case HEAD:
-              if (state.wrap === 0) {
-                state.mode = TYPEDO;
-                break;
-              }
-              while (bits < 16) {
-                if (have === 0) {
-                  break inf_leave;
-                }
-                have--;
-                hold += input[next++] << bits;
-                bits += 8;
-              }
-              if (state.wrap & 2 && hold === 35615) {
-                if (state.wbits === 0) {
-                  state.wbits = 15;
-                }
-                state.check = 0;
-                hbuf[0] = hold & 255;
-                hbuf[1] = hold >>> 8 & 255;
-                state.check = crc32(state.check, hbuf, 2, 0);
-                hold = 0;
-                bits = 0;
-                state.mode = FLAGS;
-                break;
-              }
-              if (state.head) {
-                state.head.done = false;
-              }
-              if (!(state.wrap & 1) || /* check if zlib header allowed */
-              (((hold & 255) << 8) + (hold >> 8)) % 31) {
-                strm.msg = "incorrect header check";
-                state.mode = BAD;
-                break;
-              }
-              if ((hold & 15) !== Z_DEFLATED) {
-                strm.msg = "unknown compression method";
-                state.mode = BAD;
-                break;
-              }
-              hold >>>= 4;
-              bits -= 4;
-              len = (hold & 15) + 8;
-              if (state.wbits === 0) {
-                state.wbits = len;
-              }
-              if (len > 15 || len > state.wbits) {
-                strm.msg = "invalid window size";
-                state.mode = BAD;
-                break;
-              }
-              state.dmax = 1 << state.wbits;
-              state.flags = 0;
-              strm.adler = state.check = 1;
-              state.mode = hold & 512 ? DICTID : TYPE;
-              hold = 0;
-              bits = 0;
-              break;
-            case FLAGS:
-              while (bits < 16) {
-                if (have === 0) {
-                  break inf_leave;
-                }
-                have--;
-                hold += input[next++] << bits;
-                bits += 8;
-              }
-              state.flags = hold;
-              if ((state.flags & 255) !== Z_DEFLATED) {
-                strm.msg = "unknown compression method";
-                state.mode = BAD;
-                break;
-              }
-              if (state.flags & 57344) {
-                strm.msg = "unknown header flags set";
-                state.mode = BAD;
-                break;
-              }
-              if (state.head) {
-                state.head.text = hold >> 8 & 1;
-              }
-              if (state.flags & 512 && state.wrap & 4) {
-                hbuf[0] = hold & 255;
-                hbuf[1] = hold >>> 8 & 255;
-                state.check = crc32(state.check, hbuf, 2, 0);
-              }
-              hold = 0;
-              bits = 0;
-              state.mode = TIME;
-            /* falls through */
-            case TIME:
-              while (bits < 32) {
-                if (have === 0) {
-                  break inf_leave;
-                }
-                have--;
-                hold += input[next++] << bits;
-                bits += 8;
-              }
-              if (state.head) {
-                state.head.time = hold;
-              }
-              if (state.flags & 512 && state.wrap & 4) {
-                hbuf[0] = hold & 255;
-                hbuf[1] = hold >>> 8 & 255;
-                hbuf[2] = hold >>> 16 & 255;
-                hbuf[3] = hold >>> 24 & 255;
-                state.check = crc32(state.check, hbuf, 4, 0);
-              }
-              hold = 0;
-              bits = 0;
-              state.mode = OS;
-            /* falls through */
-            case OS:
-              while (bits < 16) {
-                if (have === 0) {
-                  break inf_leave;
-                }
-                have--;
-                hold += input[next++] << bits;
-                bits += 8;
-              }
-              if (state.head) {
-                state.head.xflags = hold & 255;
-                state.head.os = hold >> 8;
-              }
-              if (state.flags & 512 && state.wrap & 4) {
-                hbuf[0] = hold & 255;
-                hbuf[1] = hold >>> 8 & 255;
-                state.check = crc32(state.check, hbuf, 2, 0);
-              }
-              hold = 0;
-              bits = 0;
-              state.mode = EXLEN;
-            /* falls through */
-            case EXLEN:
-              if (state.flags & 1024) {
-                while (bits < 16) {
-                  if (have === 0) {
-                    break inf_leave;
-                  }
-                  have--;
-                  hold += input[next++] << bits;
-                  bits += 8;
-                }
-                state.length = hold;
-                if (state.head) {
-                  state.head.extra_len = hold;
-                }
-                if (state.flags & 512 && state.wrap & 4) {
-                  hbuf[0] = hold & 255;
-                  hbuf[1] = hold >>> 8 & 255;
-                  state.check = crc32(state.check, hbuf, 2, 0);
-                }
-                hold = 0;
-                bits = 0;
-              } else if (state.head) {
-                state.head.extra = null;
-              }
-              state.mode = EXTRA;
-            /* falls through */
-            case EXTRA:
-              if (state.flags & 1024) {
-                copy = state.length;
-                if (copy > have) {
-                  copy = have;
-                }
-                if (copy) {
-                  if (state.head) {
-                    len = state.head.extra_len - state.length;
-                    if (!state.head.extra) {
-                      state.head.extra = new Uint8Array(state.head.extra_len);
-                    }
-                    state.head.extra.set(
-                      input.subarray(
-                        next,
-                        // extra field is limited to 65536 bytes
-                        // - no need for additional size check
-                        next + copy
-                      ),
-                      /*len + copy > state.head.extra_max - len ? state.head.extra_max : copy,*/
-                      len
-                    );
-                  }
-                  if (state.flags & 512 && state.wrap & 4) {
-                    state.check = crc32(state.check, input, copy, next);
-                  }
-                  have -= copy;
-                  next += copy;
-                  state.length -= copy;
-                }
-                if (state.length) {
-                  break inf_leave;
-                }
-              }
-              state.length = 0;
-              state.mode = NAME;
-            /* falls through */
-            case NAME:
-              if (state.flags & 2048) {
-                if (have === 0) {
-                  break inf_leave;
-                }
-                copy = 0;
-                do {
-                  len = input[next + copy++];
-                  if (state.head && len && state.length < 65536) {
-                    state.head.name += String.fromCharCode(len);
-                  }
-                } while (len && copy < have);
-                if (state.flags & 512 && state.wrap & 4) {
-                  state.check = crc32(state.check, input, copy, next);
-                }
-                have -= copy;
-                next += copy;
-                if (len) {
-                  break inf_leave;
-                }
-              } else if (state.head) {
-                state.head.name = null;
-              }
-              state.length = 0;
-              state.mode = COMMENT;
-            /* falls through */
-            case COMMENT:
-              if (state.flags & 4096) {
-                if (have === 0) {
-                  break inf_leave;
-                }
-                copy = 0;
-                do {
-                  len = input[next + copy++];
-                  if (state.head && len && state.length < 65536) {
-                    state.head.comment += String.fromCharCode(len);
-                  }
-                } while (len && copy < have);
-                if (state.flags & 512 && state.wrap & 4) {
-                  state.check = crc32(state.check, input, copy, next);
-                }
-                have -= copy;
-                next += copy;
-                if (len) {
-                  break inf_leave;
-                }
-              } else if (state.head) {
-                state.head.comment = null;
-              }
-              state.mode = HCRC;
-            /* falls through */
-            case HCRC:
-              if (state.flags & 512) {
-                while (bits < 16) {
-                  if (have === 0) {
-                    break inf_leave;
-                  }
-                  have--;
-                  hold += input[next++] << bits;
-                  bits += 8;
-                }
-                if (state.wrap & 4 && hold !== (state.check & 65535)) {
-                  strm.msg = "header crc mismatch";
-                  state.mode = BAD;
-                  break;
-                }
-                hold = 0;
-                bits = 0;
-              }
-              if (state.head) {
-                state.head.hcrc = state.flags >> 9 & 1;
-                state.head.done = true;
-              }
-              strm.adler = state.check = 0;
-              state.mode = TYPE;
-              break;
-            case DICTID:
-              while (bits < 32) {
-                if (have === 0) {
-                  break inf_leave;
-                }
-                have--;
-                hold += input[next++] << bits;
-                bits += 8;
-              }
-              strm.adler = state.check = zswap32(hold);
-              hold = 0;
-              bits = 0;
-              state.mode = DICT;
-            /* falls through */
-            case DICT:
-              if (state.havedict === 0) {
-                strm.next_out = put;
-                strm.avail_out = left;
-                strm.next_in = next;
-                strm.avail_in = have;
-                state.hold = hold;
-                state.bits = bits;
-                return Z_NEED_DICT;
-              }
-              strm.adler = state.check = 1;
-              state.mode = TYPE;
-            /* falls through */
-            case TYPE:
-              if (flush === Z_BLOCK || flush === Z_TREES) {
-                break inf_leave;
-              }
-            /* falls through */
-            case TYPEDO:
-              if (state.last) {
-                hold >>>= bits & 7;
-                bits -= bits & 7;
-                state.mode = CHECK;
-                break;
-              }
-              while (bits < 3) {
-                if (have === 0) {
-                  break inf_leave;
-                }
-                have--;
-                hold += input[next++] << bits;
-                bits += 8;
-              }
-              state.last = hold & 1;
-              hold >>>= 1;
-              bits -= 1;
-              switch (hold & 3) {
-                case 0:
-                  state.mode = STORED;
-                  break;
-                case 1:
-                  fixedtables(state);
-                  state.mode = LEN_;
-                  if (flush === Z_TREES) {
-                    hold >>>= 2;
-                    bits -= 2;
-                    break inf_leave;
-                  }
-                  break;
-                case 2:
-                  state.mode = TABLE;
-                  break;
-                case 3:
-                  strm.msg = "invalid block type";
-                  state.mode = BAD;
-              }
-              hold >>>= 2;
-              bits -= 2;
-              break;
-            case STORED:
-              hold >>>= bits & 7;
-              bits -= bits & 7;
-              while (bits < 32) {
-                if (have === 0) {
-                  break inf_leave;
-                }
-                have--;
-                hold += input[next++] << bits;
-                bits += 8;
-              }
-              if ((hold & 65535) !== (hold >>> 16 ^ 65535)) {
-                strm.msg = "invalid stored block lengths";
-                state.mode = BAD;
-                break;
-              }
-              state.length = hold & 65535;
-              hold = 0;
-              bits = 0;
-              state.mode = COPY_;
-              if (flush === Z_TREES) {
-                break inf_leave;
-              }
-            /* falls through */
-            case COPY_:
-              state.mode = COPY;
-            /* falls through */
-            case COPY:
-              copy = state.length;
-              if (copy) {
-                if (copy > have) {
-                  copy = have;
-                }
-                if (copy > left) {
-                  copy = left;
-                }
-                if (copy === 0) {
-                  break inf_leave;
-                }
-                output.set(input.subarray(next, next + copy), put);
-                have -= copy;
-                next += copy;
-                left -= copy;
-                put += copy;
-                state.length -= copy;
-                break;
-              }
-              state.mode = TYPE;
-              break;
-            case TABLE:
-              while (bits < 14) {
-                if (have === 0) {
-                  break inf_leave;
-                }
-                have--;
-                hold += input[next++] << bits;
-                bits += 8;
-              }
-              state.nlen = (hold & 31) + 257;
-              hold >>>= 5;
-              bits -= 5;
-              state.ndist = (hold & 31) + 1;
-              hold >>>= 5;
-              bits -= 5;
-              state.ncode = (hold & 15) + 4;
-              hold >>>= 4;
-              bits -= 4;
-              if (state.nlen > 286 || state.ndist > 30) {
-                strm.msg = "too many length or distance symbols";
-                state.mode = BAD;
-                break;
-              }
-              state.have = 0;
-              state.mode = LENLENS;
-            /* falls through */
-            case LENLENS:
-              while (state.have < state.ncode) {
-                while (bits < 3) {
-                  if (have === 0) {
-                    break inf_leave;
-                  }
-                  have--;
-                  hold += input[next++] << bits;
-                  bits += 8;
-                }
-                state.lens[order[state.have++]] = hold & 7;
-                hold >>>= 3;
-                bits -= 3;
-              }
-              while (state.have < 19) {
-                state.lens[order[state.have++]] = 0;
-              }
-              state.lencode = state.lendyn;
-              state.lenbits = 7;
-              opts = { bits: state.lenbits };
-              ret = inflate_table(CODES, state.lens, 0, 19, state.lencode, 0, state.work, opts);
-              state.lenbits = opts.bits;
-              if (ret) {
-                strm.msg = "invalid code lengths set";
-                state.mode = BAD;
-                break;
-              }
-              state.have = 0;
-              state.mode = CODELENS;
-            /* falls through */
-            case CODELENS:
-              while (state.have < state.nlen + state.ndist) {
-                for (; ; ) {
-                  here = state.lencode[hold & (1 << state.lenbits) - 1];
-                  here_bits = here >>> 24;
-                  here_op = here >>> 16 & 255;
-                  here_val = here & 65535;
-                  if (here_bits <= bits) {
-                    break;
-                  }
-                  if (have === 0) {
-                    break inf_leave;
-                  }
-                  have--;
-                  hold += input[next++] << bits;
-                  bits += 8;
-                }
-                if (here_val < 16) {
-                  hold >>>= here_bits;
-                  bits -= here_bits;
-                  state.lens[state.have++] = here_val;
-                } else {
-                  if (here_val === 16) {
-                    n = here_bits + 2;
-                    while (bits < n) {
-                      if (have === 0) {
-                        break inf_leave;
-                      }
-                      have--;
-                      hold += input[next++] << bits;
-                      bits += 8;
-                    }
-                    hold >>>= here_bits;
-                    bits -= here_bits;
-                    if (state.have === 0) {
-                      strm.msg = "invalid bit length repeat";
-                      state.mode = BAD;
-                      break;
-                    }
-                    len = state.lens[state.have - 1];
-                    copy = 3 + (hold & 3);
-                    hold >>>= 2;
-                    bits -= 2;
-                  } else if (here_val === 17) {
-                    n = here_bits + 3;
-                    while (bits < n) {
-                      if (have === 0) {
-                        break inf_leave;
-                      }
-                      have--;
-                      hold += input[next++] << bits;
-                      bits += 8;
-                    }
-                    hold >>>= here_bits;
-                    bits -= here_bits;
-                    len = 0;
-                    copy = 3 + (hold & 7);
-                    hold >>>= 3;
-                    bits -= 3;
-                  } else {
-                    n = here_bits + 7;
-                    while (bits < n) {
-                      if (have === 0) {
-                        break inf_leave;
-                      }
-                      have--;
-                      hold += input[next++] << bits;
-                      bits += 8;
-                    }
-                    hold >>>= here_bits;
-                    bits -= here_bits;
-                    len = 0;
-                    copy = 11 + (hold & 127);
-                    hold >>>= 7;
-                    bits -= 7;
-                  }
-                  if (state.have + copy > state.nlen + state.ndist) {
-                    strm.msg = "invalid bit length repeat";
-                    state.mode = BAD;
-                    break;
-                  }
-                  while (copy--) {
-                    state.lens[state.have++] = len;
-                  }
-                }
-              }
-              if (state.mode === BAD) {
-                break;
-              }
-              if (state.lens[256] === 0) {
-                strm.msg = "invalid code -- missing end-of-block";
-                state.mode = BAD;
-                break;
-              }
-              state.lenbits = 9;
-              opts = { bits: state.lenbits };
-              ret = inflate_table(LENS, state.lens, 0, state.nlen, state.lencode, 0, state.work, opts);
-              state.lenbits = opts.bits;
-              if (ret) {
-                strm.msg = "invalid literal/lengths set";
-                state.mode = BAD;
-                break;
-              }
-              state.distbits = 6;
-              state.distcode = state.distdyn;
-              opts = { bits: state.distbits };
-              ret = inflate_table(DISTS, state.lens, state.nlen, state.ndist, state.distcode, 0, state.work, opts);
-              state.distbits = opts.bits;
-              if (ret) {
-                strm.msg = "invalid distances set";
-                state.mode = BAD;
-                break;
-              }
-              state.mode = LEN_;
-              if (flush === Z_TREES) {
-                break inf_leave;
-              }
-            /* falls through */
-            case LEN_:
-              state.mode = LEN;
-            /* falls through */
-            case LEN:
-              if (have >= 6 && left >= 258) {
-                strm.next_out = put;
-                strm.avail_out = left;
-                strm.next_in = next;
-                strm.avail_in = have;
-                state.hold = hold;
-                state.bits = bits;
-                inflate_fast(strm, _out);
-                put = strm.next_out;
-                output = strm.output;
-                left = strm.avail_out;
-                next = strm.next_in;
-                input = strm.input;
-                have = strm.avail_in;
-                hold = state.hold;
-                bits = state.bits;
-                if (state.mode === TYPE) {
-                  state.back = -1;
-                }
-                break;
-              }
-              state.back = 0;
-              for (; ; ) {
-                here = state.lencode[hold & (1 << state.lenbits) - 1];
-                here_bits = here >>> 24;
-                here_op = here >>> 16 & 255;
-                here_val = here & 65535;
-                if (here_bits <= bits) {
-                  break;
-                }
-                if (have === 0) {
-                  break inf_leave;
-                }
-                have--;
-                hold += input[next++] << bits;
-                bits += 8;
-              }
-              if (here_op && (here_op & 240) === 0) {
-                last_bits = here_bits;
-                last_op = here_op;
-                last_val = here_val;
-                for (; ; ) {
-                  here = state.lencode[last_val + ((hold & (1 << last_bits + last_op) - 1) >> last_bits)];
-                  here_bits = here >>> 24;
-                  here_op = here >>> 16 & 255;
-                  here_val = here & 65535;
-                  if (last_bits + here_bits <= bits) {
-                    break;
-                  }
-                  if (have === 0) {
-                    break inf_leave;
-                  }
-                  have--;
-                  hold += input[next++] << bits;
-                  bits += 8;
-                }
-                hold >>>= last_bits;
-                bits -= last_bits;
-                state.back += last_bits;
-              }
-              hold >>>= here_bits;
-              bits -= here_bits;
-              state.back += here_bits;
-              state.length = here_val;
-              if (here_op === 0) {
-                state.mode = LIT;
-                break;
-              }
-              if (here_op & 32) {
-                state.back = -1;
-                state.mode = TYPE;
-                break;
-              }
-              if (here_op & 64) {
-                strm.msg = "invalid literal/length code";
-                state.mode = BAD;
-                break;
-              }
-              state.extra = here_op & 15;
-              state.mode = LENEXT;
-            /* falls through */
-            case LENEXT:
-              if (state.extra) {
-                n = state.extra;
-                while (bits < n) {
-                  if (have === 0) {
-                    break inf_leave;
-                  }
-                  have--;
-                  hold += input[next++] << bits;
-                  bits += 8;
-                }
-                state.length += hold & (1 << state.extra) - 1;
-                hold >>>= state.extra;
-                bits -= state.extra;
-                state.back += state.extra;
-              }
-              state.was = state.length;
-              state.mode = DIST;
-            /* falls through */
-            case DIST:
-              for (; ; ) {
-                here = state.distcode[hold & (1 << state.distbits) - 1];
-                here_bits = here >>> 24;
-                here_op = here >>> 16 & 255;
-                here_val = here & 65535;
-                if (here_bits <= bits) {
-                  break;
-                }
-                if (have === 0) {
-                  break inf_leave;
-                }
-                have--;
-                hold += input[next++] << bits;
-                bits += 8;
-              }
-              if ((here_op & 240) === 0) {
-                last_bits = here_bits;
-                last_op = here_op;
-                last_val = here_val;
-                for (; ; ) {
-                  here = state.distcode[last_val + ((hold & (1 << last_bits + last_op) - 1) >> last_bits)];
-                  here_bits = here >>> 24;
-                  here_op = here >>> 16 & 255;
-                  here_val = here & 65535;
-                  if (last_bits + here_bits <= bits) {
-                    break;
-                  }
-                  if (have === 0) {
-                    break inf_leave;
-                  }
-                  have--;
-                  hold += input[next++] << bits;
-                  bits += 8;
-                }
-                hold >>>= last_bits;
-                bits -= last_bits;
-                state.back += last_bits;
-              }
-              hold >>>= here_bits;
-              bits -= here_bits;
-              state.back += here_bits;
-              if (here_op & 64) {
-                strm.msg = "invalid distance code";
-                state.mode = BAD;
-                break;
-              }
-              state.offset = here_val;
-              state.extra = here_op & 15;
-              state.mode = DISTEXT;
-            /* falls through */
-            case DISTEXT:
-              if (state.extra) {
-                n = state.extra;
-                while (bits < n) {
-                  if (have === 0) {
-                    break inf_leave;
-                  }
-                  have--;
-                  hold += input[next++] << bits;
-                  bits += 8;
-                }
-                state.offset += hold & (1 << state.extra) - 1;
-                hold >>>= state.extra;
-                bits -= state.extra;
-                state.back += state.extra;
-              }
-              if (state.offset > state.dmax) {
-                strm.msg = "invalid distance too far back";
-                state.mode = BAD;
-                break;
-              }
-              state.mode = MATCH;
-            /* falls through */
-            case MATCH:
-              if (left === 0) {
-                break inf_leave;
-              }
-              copy = _out - left;
-              if (state.offset > copy) {
-                copy = state.offset - copy;
-                if (copy > state.whave) {
-                  if (state.sane) {
-                    strm.msg = "invalid distance too far back";
-                    state.mode = BAD;
-                    break;
-                  }
-                }
-                if (copy > state.wnext) {
-                  copy -= state.wnext;
-                  from = state.wsize - copy;
-                } else {
-                  from = state.wnext - copy;
-                }
-                if (copy > state.length) {
-                  copy = state.length;
-                }
-                from_source = state.window;
-              } else {
-                from_source = output;
-                from = put - state.offset;
-                copy = state.length;
-              }
-              if (copy > left) {
-                copy = left;
-              }
-              left -= copy;
-              state.length -= copy;
-              do {
-                output[put++] = from_source[from++];
-              } while (--copy);
-              if (state.length === 0) {
-                state.mode = LEN;
-              }
-              break;
-            case LIT:
-              if (left === 0) {
-                break inf_leave;
-              }
-              output[put++] = state.length;
-              left--;
-              state.mode = LEN;
-              break;
-            case CHECK:
-              if (state.wrap) {
-                while (bits < 32) {
-                  if (have === 0) {
-                    break inf_leave;
-                  }
-                  have--;
-                  hold |= input[next++] << bits;
-                  bits += 8;
-                }
-                _out -= left;
-                strm.total_out += _out;
-                state.total += _out;
-                if (state.wrap & 4 && _out) {
-                  strm.adler = state.check = /*UPDATE_CHECK(state.check, put - _out, _out);*/
-                  state.flags ? crc32(state.check, output, _out, put - _out) : adler32(state.check, output, _out, put - _out);
-                }
-                _out = left;
-                if (state.wrap & 4 && (state.flags ? hold : zswap32(hold)) !== state.check) {
-                  strm.msg = "incorrect data check";
-                  state.mode = BAD;
-                  break;
-                }
-                hold = 0;
-                bits = 0;
-              }
-              state.mode = LENGTH;
-            /* falls through */
-            case LENGTH:
-              if (state.wrap && state.flags) {
-                while (bits < 32) {
-                  if (have === 0) {
-                    break inf_leave;
-                  }
-                  have--;
-                  hold += input[next++] << bits;
-                  bits += 8;
-                }
-                if (state.wrap & 4 && hold !== (state.total & 4294967295)) {
-                  strm.msg = "incorrect length check";
-                  state.mode = BAD;
-                  break;
-                }
-                hold = 0;
-                bits = 0;
-              }
-              state.mode = DONE;
-            /* falls through */
-            case DONE:
-              ret = Z_STREAM_END;
-              break inf_leave;
-            case BAD:
-              ret = Z_DATA_ERROR;
-              break inf_leave;
-            case MEM:
-              return Z_MEM_ERROR;
-            case SYNC:
-            /* falls through */
-            default:
-              return Z_STREAM_ERROR;
-          }
-        }
-      strm.next_out = put;
-      strm.avail_out = left;
-      strm.next_in = next;
-      strm.avail_in = have;
-      state.hold = hold;
-      state.bits = bits;
-      if (state.wsize || _out !== strm.avail_out && state.mode < BAD && (state.mode < CHECK || flush !== Z_FINISH)) {
-        if (updatewindow(strm, strm.output, strm.next_out, _out - strm.avail_out)) {
-          state.mode = MEM;
-          return Z_MEM_ERROR;
-        }
-      }
-      _in -= strm.avail_in;
-      _out -= strm.avail_out;
-      strm.total_in += _in;
-      strm.total_out += _out;
-      state.total += _out;
-      if (state.wrap & 4 && _out) {
-        strm.adler = state.check = /*UPDATE_CHECK(state.check, strm.next_out - _out, _out);*/
-        state.flags ? crc32(state.check, output, _out, strm.next_out - _out) : adler32(state.check, output, _out, strm.next_out - _out);
-      }
-      strm.data_type = state.bits + (state.last ? 64 : 0) + (state.mode === TYPE ? 128 : 0) + (state.mode === LEN_ || state.mode === COPY_ ? 256 : 0);
-      if ((_in === 0 && _out === 0 || flush === Z_FINISH) && ret === Z_OK) {
-        ret = Z_BUF_ERROR;
-      }
-      return ret;
-    };
-    var inflateEnd = (strm) => {
-      if (inflateStateCheck(strm)) {
-        return Z_STREAM_ERROR;
-      }
-      let state = strm.state;
-      if (state.window) {
-        state.window = null;
-      }
-      strm.state = null;
-      return Z_OK;
-    };
-    var inflateGetHeader = (strm, head) => {
-      if (inflateStateCheck(strm)) {
-        return Z_STREAM_ERROR;
-      }
-      const state = strm.state;
-      if ((state.wrap & 2) === 0) {
-        return Z_STREAM_ERROR;
-      }
-      state.head = head;
-      head.done = false;
-      return Z_OK;
-    };
-    var inflateSetDictionary = (strm, dictionary) => {
-      const dictLength = dictionary.length;
-      let state;
-      let dictid;
-      let ret;
-      if (inflateStateCheck(strm)) {
-        return Z_STREAM_ERROR;
-      }
-      state = strm.state;
-      if (state.wrap !== 0 && state.mode !== DICT) {
-        return Z_STREAM_ERROR;
-      }
-      if (state.mode === DICT) {
-        dictid = 1;
-        dictid = adler32(dictid, dictionary, dictLength, 0);
-        if (dictid !== state.check) {
-          return Z_DATA_ERROR;
-        }
-      }
-      ret = updatewindow(strm, dictionary, dictLength, dictLength);
-      if (ret) {
-        state.mode = MEM;
-        return Z_MEM_ERROR;
-      }
-      state.havedict = 1;
-      return Z_OK;
-    };
-    module.exports.inflateReset = inflateReset;
-    module.exports.inflateReset2 = inflateReset2;
-    module.exports.inflateResetKeep = inflateResetKeep;
-    module.exports.inflateInit = inflateInit;
-    module.exports.inflateInit2 = inflateInit2;
-    module.exports.inflate = inflate;
-    module.exports.inflateEnd = inflateEnd;
-    module.exports.inflateGetHeader = inflateGetHeader;
-    module.exports.inflateSetDictionary = inflateSetDictionary;
-    module.exports.inflateInfo = "pako inflate (from Nodeca project)";
-  }
-});
-
-// node_modules/pako/lib/utils/common.js
-var require_common = __commonJS({
-  "node_modules/pako/lib/utils/common.js"(exports, module) {
-    "use strict";
-    var _has = (obj, key) => {
-      return Object.prototype.hasOwnProperty.call(obj, key);
-    };
-    module.exports.assign = function(obj) {
-      const sources = Array.prototype.slice.call(arguments, 1);
-      while (sources.length) {
-        const source = sources.shift();
-        if (!source) {
-          continue;
-        }
-        if (typeof source !== "object") {
-          throw new TypeError(source + "must be non-object");
-        }
-        for (const p in source) {
-          if (_has(source, p)) {
-            obj[p] = source[p];
-          }
-        }
-      }
-      return obj;
-    };
-    module.exports.flattenChunks = (chunks) => {
-      let len = 0;
-      for (let i = 0, l = chunks.length; i < l; i++) {
-        len += chunks[i].length;
-      }
-      const result = new Uint8Array(len);
-      for (let i = 0, pos = 0, l = chunks.length; i < l; i++) {
-        let chunk = chunks[i];
-        result.set(chunk, pos);
-        pos += chunk.length;
-      }
-      return result;
-    };
-  }
-});
-
-// node_modules/pako/lib/utils/strings.js
-var require_strings = __commonJS({
-  "node_modules/pako/lib/utils/strings.js"(exports, module) {
-    "use strict";
-    var STR_APPLY_UIA_OK = true;
-    try {
-      String.fromCharCode.apply(null, new Uint8Array(1));
-    } catch (__) {
-      STR_APPLY_UIA_OK = false;
-    }
-    var _utf8len = new Uint8Array(256);
-    for (let q = 0; q < 256; q++) {
-      _utf8len[q] = q >= 252 ? 6 : q >= 248 ? 5 : q >= 240 ? 4 : q >= 224 ? 3 : q >= 192 ? 2 : 1;
-    }
-    _utf8len[254] = _utf8len[254] = 1;
-    module.exports.string2buf = (str) => {
-      if (typeof TextEncoder === "function" && TextEncoder.prototype.encode) {
-        return new TextEncoder().encode(str);
-      }
-      let buf, c, c2, m_pos, i, str_len = str.length, buf_len = 0;
-      for (m_pos = 0; m_pos < str_len; m_pos++) {
-        c = str.charCodeAt(m_pos);
-        if ((c & 64512) === 55296 && m_pos + 1 < str_len) {
-          c2 = str.charCodeAt(m_pos + 1);
-          if ((c2 & 64512) === 56320) {
-            c = 65536 + (c - 55296 << 10) + (c2 - 56320);
-            m_pos++;
-          }
-        }
-        buf_len += c < 128 ? 1 : c < 2048 ? 2 : c < 65536 ? 3 : 4;
-      }
-      buf = new Uint8Array(buf_len);
-      for (i = 0, m_pos = 0; i < buf_len; m_pos++) {
-        c = str.charCodeAt(m_pos);
-        if ((c & 64512) === 55296 && m_pos + 1 < str_len) {
-          c2 = str.charCodeAt(m_pos + 1);
-          if ((c2 & 64512) === 56320) {
-            c = 65536 + (c - 55296 << 10) + (c2 - 56320);
-            m_pos++;
-          }
-        }
-        if (c < 128) {
-          buf[i++] = c;
-        } else if (c < 2048) {
-          buf[i++] = 192 | c >>> 6;
-          buf[i++] = 128 | c & 63;
-        } else if (c < 65536) {
-          buf[i++] = 224 | c >>> 12;
-          buf[i++] = 128 | c >>> 6 & 63;
-          buf[i++] = 128 | c & 63;
-        } else {
-          buf[i++] = 240 | c >>> 18;
-          buf[i++] = 128 | c >>> 12 & 63;
-          buf[i++] = 128 | c >>> 6 & 63;
-          buf[i++] = 128 | c & 63;
-        }
-      }
-      return buf;
-    };
-    var buf2binstring = (buf, len) => {
-      if (len < 65534) {
-        if (buf.subarray && STR_APPLY_UIA_OK) {
-          return String.fromCharCode.apply(null, buf.length === len ? buf : buf.subarray(0, len));
-        }
-      }
-      let result = "";
-      for (let i = 0; i < len; i++) {
-        result += String.fromCharCode(buf[i]);
-      }
-      return result;
-    };
-    module.exports.buf2string = (buf, max) => {
-      const len = max || buf.length;
-      if (typeof TextDecoder === "function" && TextDecoder.prototype.decode) {
-        return new TextDecoder().decode(buf.subarray(0, max));
-      }
-      let i, out;
-      const utf16buf = new Array(len * 2);
-      for (out = 0, i = 0; i < len; ) {
-        let c = buf[i++];
-        if (c < 128) {
-          utf16buf[out++] = c;
-          continue;
-        }
-        let c_len = _utf8len[c];
-        if (c_len > 4) {
-          utf16buf[out++] = 65533;
-          i += c_len - 1;
-          continue;
-        }
-        c &= c_len === 2 ? 31 : c_len === 3 ? 15 : 7;
-        while (c_len > 1 && i < len) {
-          c = c << 6 | buf[i++] & 63;
-          c_len--;
-        }
-        if (c_len > 1) {
-          utf16buf[out++] = 65533;
-          continue;
-        }
-        if (c < 65536) {
-          utf16buf[out++] = c;
-        } else {
-          c -= 65536;
-          utf16buf[out++] = 55296 | c >> 10 & 1023;
-          utf16buf[out++] = 56320 | c & 1023;
-        }
-      }
-      return buf2binstring(utf16buf, out);
-    };
-    module.exports.utf8border = (buf, max) => {
-      max = max || buf.length;
-      if (max > buf.length) {
-        max = buf.length;
-      }
-      let pos = max - 1;
-      while (pos >= 0 && (buf[pos] & 192) === 128) {
-        pos--;
-      }
-      if (pos < 0) {
-        return max;
-      }
-      if (pos === 0) {
-        return max;
-      }
-      return pos + _utf8len[buf[pos]] > max ? pos : max;
-    };
-  }
-});
-
-// node_modules/pako/lib/zlib/messages.js
-var require_messages = __commonJS({
-  "node_modules/pako/lib/zlib/messages.js"(exports, module) {
-    "use strict";
-    module.exports = {
-      2: "need dictionary",
-      /* Z_NEED_DICT       2  */
-      1: "stream end",
-      /* Z_STREAM_END      1  */
-      0: "",
-      /* Z_OK              0  */
-      "-1": "file error",
-      /* Z_ERRNO         (-1) */
-      "-2": "stream error",
-      /* Z_STREAM_ERROR  (-2) */
-      "-3": "data error",
-      /* Z_DATA_ERROR    (-3) */
-      "-4": "insufficient memory",
-      /* Z_MEM_ERROR     (-4) */
-      "-5": "buffer error",
-      /* Z_BUF_ERROR     (-5) */
-      "-6": "incompatible version"
-      /* Z_VERSION_ERROR (-6) */
-    };
-  }
-});
-
-// node_modules/pako/lib/zlib/zstream.js
-var require_zstream = __commonJS({
-  "node_modules/pako/lib/zlib/zstream.js"(exports, module) {
-    "use strict";
-    function ZStream() {
-      this.input = null;
-      this.next_in = 0;
-      this.avail_in = 0;
-      this.total_in = 0;
-      this.output = null;
-      this.next_out = 0;
-      this.avail_out = 0;
-      this.total_out = 0;
-      this.msg = "";
-      this.state = null;
-      this.data_type = 2;
-      this.adler = 0;
-    }
-    module.exports = ZStream;
-  }
-});
-
-// node_modules/pako/lib/zlib/gzheader.js
-var require_gzheader = __commonJS({
-  "node_modules/pako/lib/zlib/gzheader.js"(exports, module) {
-    "use strict";
-    function GZheader() {
-      this.text = 0;
-      this.time = 0;
-      this.xflags = 0;
-      this.os = 0;
-      this.extra = null;
-      this.extra_len = 0;
-      this.name = "";
-      this.comment = "";
-      this.hcrc = 0;
-      this.done = false;
-    }
-    module.exports = GZheader;
-  }
-});
-
-// node_modules/pako/lib/inflate.js
-var require_inflate2 = __commonJS({
-  "node_modules/pako/lib/inflate.js"(exports, module) {
-    "use strict";
-    var zlib_inflate = require_inflate();
-    var utils = require_common();
-    var strings = require_strings();
-    var msg = require_messages();
-    var ZStream = require_zstream();
-    var GZheader = require_gzheader();
-    var toString = Object.prototype.toString;
-    var {
-      Z_NO_FLUSH,
-      Z_FINISH,
-      Z_OK,
-      Z_STREAM_END,
-      Z_NEED_DICT,
-      Z_STREAM_ERROR,
-      Z_DATA_ERROR,
-      Z_MEM_ERROR
-    } = require_constants();
-    function Inflate(options) {
-      this.options = utils.assign({
-        chunkSize: 1024 * 64,
-        windowBits: 15,
-        to: ""
-      }, options || {});
-      const opt = this.options;
-      if (opt.raw && opt.windowBits >= 0 && opt.windowBits < 16) {
-        opt.windowBits = -opt.windowBits;
-        if (opt.windowBits === 0) {
-          opt.windowBits = -15;
-        }
-      }
-      if (opt.windowBits >= 0 && opt.windowBits < 16 && !(options && options.windowBits)) {
-        opt.windowBits += 32;
-      }
-      if (opt.windowBits > 15 && opt.windowBits < 48) {
-        if ((opt.windowBits & 15) === 0) {
-          opt.windowBits |= 15;
-        }
-      }
-      this.err = 0;
-      this.msg = "";
-      this.ended = false;
-      this.chunks = [];
-      this.strm = new ZStream();
-      this.strm.avail_out = 0;
-      let status = zlib_inflate.inflateInit2(
-        this.strm,
-        opt.windowBits
-      );
-      if (status !== Z_OK) {
-        throw new Error(msg[status]);
-      }
-      this.header = new GZheader();
-      zlib_inflate.inflateGetHeader(this.strm, this.header);
-      if (opt.dictionary) {
-        if (typeof opt.dictionary === "string") {
-          opt.dictionary = strings.string2buf(opt.dictionary);
-        } else if (toString.call(opt.dictionary) === "[object ArrayBuffer]") {
-          opt.dictionary = new Uint8Array(opt.dictionary);
-        }
-        if (opt.raw) {
-          status = zlib_inflate.inflateSetDictionary(this.strm, opt.dictionary);
-          if (status !== Z_OK) {
-            throw new Error(msg[status]);
-          }
-        }
-      }
-    }
-    Inflate.prototype.push = function(data, flush_mode) {
-      const strm = this.strm;
-      const chunkSize = this.options.chunkSize;
-      const dictionary = this.options.dictionary;
-      let status, _flush_mode, last_avail_out;
-      if (this.ended) return false;
-      if (flush_mode === ~~flush_mode) _flush_mode = flush_mode;
-      else _flush_mode = flush_mode === true ? Z_FINISH : Z_NO_FLUSH;
-      if (toString.call(data) === "[object ArrayBuffer]") {
-        strm.input = new Uint8Array(data);
-      } else {
-        strm.input = data;
-      }
-      strm.next_in = 0;
-      strm.avail_in = strm.input.length;
-      for (; ; ) {
-        if (strm.avail_out === 0) {
-          strm.output = new Uint8Array(chunkSize);
-          strm.next_out = 0;
-          strm.avail_out = chunkSize;
-        }
-        status = zlib_inflate.inflate(strm, _flush_mode);
-        if (status === Z_NEED_DICT && dictionary) {
-          status = zlib_inflate.inflateSetDictionary(strm, dictionary);
-          if (status === Z_OK) {
-            status = zlib_inflate.inflate(strm, _flush_mode);
-          } else if (status === Z_DATA_ERROR) {
-            status = Z_NEED_DICT;
-          }
-        }
-        while (strm.avail_in > 0 && status === Z_STREAM_END && strm.state.wrap > 0 && data[strm.next_in] !== 0) {
-          zlib_inflate.inflateReset(strm);
-          status = zlib_inflate.inflate(strm, _flush_mode);
-        }
-        switch (status) {
-          case Z_STREAM_ERROR:
-          case Z_DATA_ERROR:
-          case Z_NEED_DICT:
-          case Z_MEM_ERROR:
-            this.onEnd(status);
-            this.ended = true;
-            return false;
-        }
-        last_avail_out = strm.avail_out;
-        if (strm.next_out) {
-          if (strm.avail_out === 0 || status === Z_STREAM_END) {
-            if (this.options.to === "string") {
-              let next_out_utf8 = strings.utf8border(strm.output, strm.next_out);
-              let tail = strm.next_out - next_out_utf8;
-              let utf8str = strings.buf2string(strm.output, next_out_utf8);
-              strm.next_out = tail;
-              strm.avail_out = chunkSize - tail;
-              if (tail) strm.output.set(strm.output.subarray(next_out_utf8, next_out_utf8 + tail), 0);
-              this.onData(utf8str);
-            } else {
-              this.onData(strm.output.length === strm.next_out ? strm.output : strm.output.subarray(0, strm.next_out));
-            }
-          }
-        }
-        if (status === Z_OK && last_avail_out === 0) continue;
-        if (status === Z_STREAM_END) {
-          status = zlib_inflate.inflateEnd(this.strm);
-          this.onEnd(status);
-          this.ended = true;
-          return true;
-        }
-        if (strm.avail_in === 0) break;
-      }
-      return true;
-    };
-    Inflate.prototype.onData = function(chunk) {
-      this.chunks.push(chunk);
-    };
-    Inflate.prototype.onEnd = function(status) {
-      if (status === Z_OK) {
-        if (this.options.to === "string") {
-          this.result = this.chunks.join("");
-        } else {
-          this.result = utils.flattenChunks(this.chunks);
-        }
-      }
-      this.chunks = [];
-      this.err = status;
-      this.msg = this.strm.msg;
-    };
-    function inflate(input, options) {
-      const inflator = new Inflate(options);
-      inflator.push(input);
-      if (inflator.err) throw inflator.msg || msg[inflator.err];
-      return inflator.result;
-    }
-    function inflateRaw(input, options) {
-      options = options || {};
-      options.raw = true;
-      return inflate(input, options);
-    }
-    module.exports.Inflate = Inflate;
-    module.exports.inflate = inflate;
-    module.exports.inflateRaw = inflateRaw;
-    module.exports.ungzip = inflate;
-    module.exports.constants = require_constants();
-  }
-});
+} from "./chunk-AHWAZRBV.js";
 
 // packages/engine/Source/Core/decodeGoogleEarthEnterpriseData.js
 var compressedMagic = 1953029805;
@@ -2468,8 +163,980 @@ GoogleEarthEnterpriseTileInformation.prototype.getChildBitmask = function() {
 };
 var GoogleEarthEnterpriseTileInformation_default = GoogleEarthEnterpriseTileInformation;
 
+// node_modules/pako/dist/browser/pako_inflate.esm.min.mjs
+var e = 0;
+var t = 1;
+function n(e2) {
+  let t2 = e2.length;
+  for (; --t2 >= 0; ) e2[t2] = 0;
+}
+var r = 29;
+var i = 256;
+var a = 30;
+var o = 19;
+var s = 573;
+var c = 15;
+var l = 16;
+var u = 256;
+var d = 16;
+var f = 17;
+var p = 18;
+var m = new Uint8Array([0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 5, 5, 5, 5, 0]);
+var h = new Uint8Array([0, 0, 0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7, 7, 8, 8, 9, 9, 10, 10, 11, 11, 12, 12, 13, 13]);
+new Uint8Array([0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 3, 7]);
+var g = new Uint8Array([16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15]);
+var _ = 512;
+var v = Array(288 * 2);
+n(v);
+var y = Array(a * 2);
+n(y);
+var b = Array(_);
+n(b);
+var x = Array(256);
+n(x);
+var S = Array(r);
+n(S);
+var C = Array(a);
+n(C);
+var w = (e2) => e2 < 256 ? b[e2] : b[256 + (e2 >>> 7)];
+var T = (e2, t2) => {
+  e2.pending_buf[e2.pending++] = t2 & 255, e2.pending_buf[e2.pending++] = t2 >>> 8 & 255;
+};
+var E = (e2, t2, n2) => {
+  e2.bi_valid > l - n2 ? (e2.bi_buf |= t2 << e2.bi_valid & 65535, T(e2, e2.bi_buf), e2.bi_buf = t2 >> l - e2.bi_valid, e2.bi_valid += n2 - l) : (e2.bi_buf |= t2 << e2.bi_valid & 65535, e2.bi_valid += n2);
+};
+var D = (e2, t2, n2) => {
+  E(e2, n2[t2 * 2], n2[t2 * 2 + 1]);
+};
+var O = (e2, t2) => {
+  let n2 = 0;
+  do
+    n2 |= e2 & 1, e2 >>>= 1, n2 <<= 1;
+  while (--t2 > 0);
+  return n2 >>> 1;
+};
+var ee = (e2, t2) => {
+  let n2 = t2.dyn_tree, r2 = t2.max_code, i2 = t2.stat_desc.static_tree, a2 = t2.stat_desc.has_stree, o2 = t2.stat_desc.extra_bits, l2 = t2.stat_desc.extra_base, u2 = t2.stat_desc.max_length, d2, f2, p2, m2, h2, g2, _2 = 0;
+  for (m2 = 0; m2 <= c; m2++) e2.bl_count[m2] = 0;
+  for (n2[e2.heap[e2.heap_max] * 2 + 1] = 0, d2 = e2.heap_max + 1; d2 < s; d2++) f2 = e2.heap[d2], m2 = n2[n2[f2 * 2 + 1] * 2 + 1] + 1, m2 > u2 && (m2 = u2, _2++), n2[f2 * 2 + 1] = m2, !(f2 > r2) && (e2.bl_count[m2]++, h2 = 0, f2 >= l2 && (h2 = o2[f2 - l2]), g2 = n2[f2 * 2], e2.opt_len += g2 * (m2 + h2), a2 && (e2.static_len += g2 * (i2[f2 * 2 + 1] + h2)));
+  if (_2 !== 0) {
+    do {
+      for (m2 = u2 - 1; e2.bl_count[m2] === 0; ) m2--;
+      e2.bl_count[m2]--, e2.bl_count[m2 + 1] += 2, e2.bl_count[u2]--, _2 -= 2;
+    } while (_2 > 0);
+    for (m2 = u2; m2 !== 0; m2--) for (f2 = e2.bl_count[m2]; f2 !== 0; ) p2 = e2.heap[--d2], !(p2 > r2) && (n2[p2 * 2 + 1] !== m2 && (e2.opt_len += (m2 - n2[p2 * 2 + 1]) * n2[p2 * 2], n2[p2 * 2 + 1] = m2), f2--);
+  }
+};
+var k = (e2, t2, n2) => {
+  let r2 = Array(16), i2 = 0, a2, o2;
+  for (a2 = 1; a2 <= c; a2++) i2 = i2 + n2[a2 - 1] << 1, r2[a2] = i2;
+  for (o2 = 0; o2 <= t2; o2++) {
+    let t3 = e2[o2 * 2 + 1];
+    t3 !== 0 && (e2[o2 * 2] = O(r2[t3]++, t3));
+  }
+};
+var A = (e2) => {
+  let t2;
+  for (t2 = 0; t2 < 286; t2++) e2.dyn_ltree[t2 * 2] = 0;
+  for (t2 = 0; t2 < a; t2++) e2.dyn_dtree[t2 * 2] = 0;
+  for (t2 = 0; t2 < o; t2++) e2.bl_tree[t2 * 2] = 0;
+  e2.dyn_ltree[u * 2] = 1, e2.opt_len = e2.static_len = 0, e2.sym_next = e2.matches = 0;
+};
+var te = (e2) => {
+  e2.bi_valid > 8 ? T(e2, e2.bi_buf) : e2.bi_valid > 0 && (e2.pending_buf[e2.pending++] = e2.bi_buf), e2.bi_buf = 0, e2.bi_valid = 0;
+};
+var ne = (e2, t2, n2, r2) => {
+  let i2 = t2 * 2, a2 = n2 * 2;
+  return e2[i2] < e2[a2] || e2[i2] === e2[a2] && r2[t2] <= r2[n2];
+};
+var re = (e2, t2, n2) => {
+  let r2 = e2.heap[n2], i2 = n2 << 1;
+  for (; i2 <= e2.heap_len && (i2 < e2.heap_len && ne(t2, e2.heap[i2 + 1], e2.heap[i2], e2.depth) && i2++, !ne(t2, r2, e2.heap[i2], e2.depth)); ) e2.heap[n2] = e2.heap[i2], n2 = i2, i2 <<= 1;
+  e2.heap[n2] = r2;
+};
+var ie = (e2, t2, n2) => {
+  let r2, a2, o2 = 0, s2, c2;
+  if (e2.sym_next !== 0) do
+    r2 = e2.pending_buf[e2.sym_buf + o2++] & 255, r2 += (e2.pending_buf[e2.sym_buf + o2++] & 255) << 8, a2 = e2.pending_buf[e2.sym_buf + o2++], r2 === 0 ? D(e2, a2, t2) : (s2 = x[a2], D(e2, s2 + i + 1, t2), c2 = m[s2], c2 !== 0 && (a2 -= S[s2], E(e2, a2, c2)), r2--, s2 = w(r2), D(e2, s2, n2), c2 = h[s2], c2 !== 0 && (r2 -= C[s2], E(e2, r2, c2)));
+  while (o2 < e2.sym_next);
+  D(e2, u, t2);
+};
+var ae = (e2, t2) => {
+  let n2 = t2.dyn_tree, r2 = t2.stat_desc.static_tree, i2 = t2.stat_desc.has_stree, a2 = t2.stat_desc.elems, o2, c2, l2 = -1, u2;
+  for (e2.heap_len = 0, e2.heap_max = s, o2 = 0; o2 < a2; o2++) n2[o2 * 2] === 0 ? n2[o2 * 2 + 1] = 0 : (e2.heap[++e2.heap_len] = l2 = o2, e2.depth[o2] = 0);
+  for (; e2.heap_len < 2; ) u2 = e2.heap[++e2.heap_len] = l2 < 2 ? ++l2 : 0, n2[u2 * 2] = 1, e2.depth[u2] = 0, e2.opt_len--, i2 && (e2.static_len -= r2[u2 * 2 + 1]);
+  for (t2.max_code = l2, o2 = e2.heap_len >> 1; o2 >= 1; o2--) re(e2, n2, o2);
+  u2 = a2;
+  do
+    o2 = e2.heap[1], e2.heap[1] = e2.heap[e2.heap_len--], re(e2, n2, 1), c2 = e2.heap[1], e2.heap[--e2.heap_max] = o2, e2.heap[--e2.heap_max] = c2, n2[u2 * 2] = n2[o2 * 2] + n2[c2 * 2], e2.depth[u2] = (e2.depth[o2] >= e2.depth[c2] ? e2.depth[o2] : e2.depth[c2]) + 1, n2[o2 * 2 + 1] = n2[c2 * 2 + 1] = u2, e2.heap[1] = u2++, re(e2, n2, 1);
+  while (e2.heap_len >= 2);
+  e2.heap[--e2.heap_max] = e2.heap[1], ee(e2, t2), k(n2, l2, e2.bl_count);
+};
+var oe = (e2, t2, n2) => {
+  let r2, i2 = -1, a2, o2 = t2[1], s2 = 0, c2 = 7, l2 = 4;
+  for (o2 === 0 && (c2 = 138, l2 = 3), t2[(n2 + 1) * 2 + 1] = 65535, r2 = 0; r2 <= n2; r2++) a2 = o2, o2 = t2[(r2 + 1) * 2 + 1], !(++s2 < c2 && a2 === o2) && (s2 < l2 ? e2.bl_tree[a2 * 2] += s2 : a2 === 0 ? s2 <= 10 ? e2.bl_tree[f * 2]++ : e2.bl_tree[p * 2]++ : (a2 !== i2 && e2.bl_tree[a2 * 2]++, e2.bl_tree[d * 2]++), s2 = 0, i2 = a2, o2 === 0 ? (c2 = 138, l2 = 3) : a2 === o2 ? (c2 = 6, l2 = 3) : (c2 = 7, l2 = 4));
+};
+var se = (e2, t2, n2) => {
+  let r2, i2 = -1, a2, o2 = t2[1], s2 = 0, c2 = 7, l2 = 4;
+  for (o2 === 0 && (c2 = 138, l2 = 3), r2 = 0; r2 <= n2; r2++) if (a2 = o2, o2 = t2[(r2 + 1) * 2 + 1], !(++s2 < c2 && a2 === o2)) {
+    if (s2 < l2) do
+      D(e2, a2, e2.bl_tree);
+    while (--s2 !== 0);
+    else a2 === 0 ? s2 <= 10 ? (D(e2, f, e2.bl_tree), E(e2, s2 - 3, 3)) : (D(e2, p, e2.bl_tree), E(e2, s2 - 11, 7)) : (a2 !== i2 && (D(e2, a2, e2.bl_tree), s2--), D(e2, d, e2.bl_tree), E(e2, s2 - 3, 2));
+    s2 = 0, i2 = a2, o2 === 0 ? (c2 = 138, l2 = 3) : a2 === o2 ? (c2 = 6, l2 = 3) : (c2 = 7, l2 = 4);
+  }
+};
+var ce = (e2) => {
+  let t2;
+  for (oe(e2, e2.dyn_ltree, e2.l_desc.max_code), oe(e2, e2.dyn_dtree, e2.d_desc.max_code), ae(e2, e2.bl_desc), t2 = o - 1; t2 >= 3 && e2.bl_tree[g[t2] * 2 + 1] === 0; t2--) ;
+  return e2.opt_len += 3 * (t2 + 1) + 5 + 5 + 4, t2;
+};
+var le = (e2, t2, n2, r2) => {
+  let i2;
+  for (E(e2, t2 - 257, 5), E(e2, n2 - 1, 5), E(e2, r2 - 4, 4), i2 = 0; i2 < r2; i2++) E(e2, e2.bl_tree[g[i2] * 2 + 1], 3);
+  se(e2, e2.dyn_ltree, t2 - 1), se(e2, e2.dyn_dtree, n2 - 1);
+};
+var ue = (n2) => {
+  let r2 = 4093624447, a2;
+  for (a2 = 0; a2 <= 31; a2++, r2 >>>= 1) if (r2 & 1 && n2.dyn_ltree[a2 * 2] !== 0) return e;
+  if (n2.dyn_ltree[18] !== 0 || n2.dyn_ltree[20] !== 0 || n2.dyn_ltree[26] !== 0) return t;
+  for (a2 = 32; a2 < i; a2++) if (n2.dyn_ltree[a2 * 2] !== 0) return t;
+  return e;
+};
+var de = (e2, t2, n2, r2) => {
+  E(e2, 0 + +!!r2, 3), te(e2), T(e2, n2), T(e2, ~n2), n2 && e2.pending_buf.set(e2.window.subarray(t2, t2 + n2), e2.pending), e2.pending += n2;
+};
+var fe = (e2, t2, n2, r2) => {
+  let i2, a2, o2 = 0;
+  e2.level > 0 ? (e2.strm.data_type === 2 && (e2.strm.data_type = ue(e2)), ae(e2, e2.l_desc), ae(e2, e2.d_desc), o2 = ce(e2), i2 = e2.opt_len + 3 + 7 >>> 3, a2 = e2.static_len + 3 + 7 >>> 3, a2 <= i2 && (i2 = a2)) : i2 = a2 = n2 + 5, n2 + 4 <= i2 && t2 !== -1 ? de(e2, t2, n2, r2) : e2.strategy === 4 || a2 === i2 ? (E(e2, 2 + +!!r2, 3), ie(e2, v, y)) : (E(e2, 4 + +!!r2, 3), le(e2, e2.l_desc.max_code + 1, e2.d_desc.max_code + 1, o2 + 1), ie(e2, e2.dyn_ltree, e2.dyn_dtree)), A(e2), r2 && te(e2);
+};
+var j = (e2, t2, n2) => (e2.pending_buf[e2.sym_buf + e2.sym_next++] = t2, e2.pending_buf[e2.sym_buf + e2.sym_next++] = t2 >> 8, e2.pending_buf[e2.sym_buf + e2.sym_next++] = n2, t2 === 0 ? e2.dyn_ltree[n2 * 2]++ : (e2.matches++, t2--, e2.dyn_ltree[(x[n2] + i + 1) * 2]++, e2.dyn_dtree[w(t2) * 2]++), e2.sym_next === e2.sym_end);
+var M = (e2, t2, n2, r2) => {
+  let i2 = e2 & 65535 | 0, a2 = e2 >>> 16 & 65535 | 0, o2 = 0;
+  for (; n2 !== 0; ) {
+    o2 = n2 > 2e3 ? 2e3 : n2, n2 -= o2;
+    do
+      i2 = i2 + t2[r2++] | 0, a2 = a2 + i2 | 0;
+    while (--o2);
+    i2 %= 65521, a2 %= 65521;
+  }
+  return i2 | a2 << 16 | 0;
+};
+var pe = new Uint32Array((() => {
+  let e2, t2 = [];
+  for (var n2 = 0; n2 < 256; n2++) {
+    e2 = n2;
+    for (var r2 = 0; r2 < 8; r2++) e2 = e2 & 1 ? 3988292384 ^ e2 >>> 1 : e2 >>> 1;
+    t2[n2] = e2;
+  }
+  return t2;
+})());
+var N = (e2, t2, n2, r2) => {
+  let i2 = pe, a2 = r2 + n2;
+  e2 ^= -1;
+  for (let n3 = r2; n3 < a2; n3++) e2 = e2 >>> 8 ^ i2[(e2 ^ t2[n3]) & 255];
+  return e2 ^ -1;
+};
+var me = { 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` };
+var P = 3;
+var he = 258;
+var F = 262;
+var I = 1;
+var ge = 2;
+var _e = 3;
+var ve = 4;
+var ye = (e2) => {
+  let t2, n2, r2, i2 = e2.w_size;
+  t2 = e2.hash_size, r2 = t2;
+  do
+    n2 = e2.head[--r2], e2.head[r2] = n2 >= i2 ? n2 - i2 : 0;
+  while (--t2);
+  t2 = i2, r2 = t2;
+  do
+    n2 = e2.prev[--r2], e2.prev[r2] = n2 >= i2 ? n2 - i2 : 0;
+  while (--t2);
+};
+var be = (e2, t2, n2) => (t2 << e2.hash_shift ^ n2) & e2.hash_mask;
+var L = (e2, t2) => {
+  let n2;
+  if (e2.legacy_hash) n2 = e2.ins_h = be(e2, e2.ins_h, e2.window[t2 + P - 1]);
+  else {
+    let r3 = e2.window, i2 = r3[t2] | r3[t2 + 1] << 8 | r3[t2 + 2] << 16 | r3[t2 + 3] << 24;
+    n2 = e2.ins_h = Math.imul(i2, 66521) + 66521 >>> 16 & e2.hash_mask;
+  }
+  let r2 = e2.prev[t2 & e2.w_mask] = e2.head[n2];
+  return e2.head[n2] = t2, r2;
+};
+var xe = (e2) => {
+  let t2 = e2.state, n2 = t2.pending;
+  n2 > e2.avail_out && (n2 = e2.avail_out), n2 !== 0 && (e2.output.set(t2.pending_buf.subarray(t2.pending_out, t2.pending_out + n2), e2.next_out), e2.next_out += n2, t2.pending_out += n2, e2.total_out += n2, e2.avail_out -= n2, t2.pending -= n2, t2.pending === 0 && (t2.pending_out = 0));
+};
+var R = (e2, t2) => {
+  fe(e2, e2.block_start >= 0 ? e2.block_start : -1, e2.strstart - e2.block_start, t2), e2.block_start = e2.strstart, xe(e2.strm);
+};
+var Se = (e2, t2, n2, r2) => {
+  let i2 = e2.avail_in;
+  return i2 > r2 && (i2 = r2), i2 === 0 ? 0 : (e2.avail_in -= i2, t2.set(e2.input.subarray(e2.next_in, e2.next_in + i2), n2), e2.state.wrap === 1 ? e2.adler = M(e2.adler, t2, i2, n2) : e2.state.wrap === 2 && (e2.adler = N(e2.adler, t2, i2, n2)), e2.next_in += i2, e2.total_in += i2, i2);
+};
+var Ce = (e2, t2) => {
+  let n2 = e2.max_chain_length, r2 = e2.strstart, i2, a2, o2 = e2.prev_length, s2 = e2.nice_match, c2 = e2.strstart > e2.w_size - F ? e2.strstart - (e2.w_size - F) : 0, l2 = e2.window, u2 = e2.w_mask, d2 = e2.prev, f2 = e2.strstart + he, p2 = l2[r2 + o2 - 1], m2 = l2[r2 + o2];
+  e2.prev_length >= e2.good_match && (n2 >>= 2), s2 > e2.lookahead && (s2 = e2.lookahead);
+  do {
+    if (i2 = t2, l2[i2 + o2] !== m2 || l2[i2 + o2 - 1] !== p2 || l2[i2] !== l2[r2] || l2[++i2] !== l2[r2 + 1]) continue;
+    r2 += 2, i2++;
+    do
+      ;
+    while (l2[++r2] === l2[++i2] && l2[++r2] === l2[++i2] && l2[++r2] === l2[++i2] && l2[++r2] === l2[++i2] && l2[++r2] === l2[++i2] && l2[++r2] === l2[++i2] && l2[++r2] === l2[++i2] && l2[++r2] === l2[++i2] && r2 < f2);
+    if (a2 = he - (f2 - r2), r2 = f2 - he, a2 > o2) {
+      if (e2.match_start = t2, o2 = a2, a2 >= s2) break;
+      p2 = l2[r2 + o2 - 1], m2 = l2[r2 + o2];
+    }
+  } while ((t2 = d2[t2 & u2]) > c2 && --n2 !== 0);
+  return o2 <= e2.lookahead ? o2 : e2.lookahead;
+};
+var we = (e2) => {
+  let t2 = e2.w_size, n2, r2, i2;
+  do {
+    if (r2 = e2.window_size - e2.lookahead - e2.strstart, e2.strstart >= t2 + (t2 - F) && (e2.window.set(e2.window.subarray(t2, t2 + t2 - r2), 0), e2.match_start -= t2, e2.strstart -= t2, e2.block_start -= t2, e2.insert > e2.strstart && (e2.insert = e2.strstart), ye(e2), r2 += t2), e2.strm.avail_in === 0) break;
+    if (n2 = Se(e2.strm, e2.window, e2.strstart + e2.lookahead, r2), e2.lookahead += n2, !e2.legacy_hash) {
+      if (e2.lookahead + e2.insert > P) for (i2 = e2.strstart - e2.insert; e2.insert && (L(e2, i2), i2++, e2.insert--, !(e2.lookahead + e2.insert <= P)); ) ;
+    } else if (e2.lookahead + e2.insert >= P) for (i2 = e2.strstart - e2.insert, e2.ins_h = e2.window[i2], e2.ins_h = be(e2, e2.ins_h, e2.window[i2 + 1]); e2.insert && (L(e2, i2), i2++, e2.insert--, !(e2.lookahead + e2.insert < P)); ) ;
+  } while (e2.lookahead < F && e2.strm.avail_in !== 0);
+};
+var Te = (e2, t2) => {
+  let n2 = e2.pending_buf_size - 5 > e2.w_size ? e2.w_size : e2.pending_buf_size - 5, r2, i2, a2, o2 = 0, s2 = e2.strm.avail_in;
+  do {
+    if (r2 = 65535, a2 = e2.bi_valid + 42 >> 3, e2.strm.avail_out < a2 || (a2 = e2.strm.avail_out - a2, i2 = e2.strstart - e2.block_start, r2 > i2 + e2.strm.avail_in && (r2 = i2 + e2.strm.avail_in), r2 > a2 && (r2 = a2), r2 < n2 && (r2 === 0 && t2 !== 4 || t2 === 0 || r2 !== i2 + e2.strm.avail_in))) break;
+    o2 = +(t2 === 4 && r2 === i2 + e2.strm.avail_in), de(e2, 0, 0, o2), e2.pending_buf[e2.pending - 4] = r2, e2.pending_buf[e2.pending - 3] = r2 >> 8, e2.pending_buf[e2.pending - 2] = ~r2, e2.pending_buf[e2.pending - 1] = ~r2 >> 8, xe(e2.strm), i2 && (i2 > r2 && (i2 = r2), e2.strm.output.set(e2.window.subarray(e2.block_start, e2.block_start + i2), e2.strm.next_out), e2.strm.next_out += i2, e2.strm.avail_out -= i2, e2.strm.total_out += i2, e2.block_start += i2, r2 -= i2), r2 && (Se(e2.strm, e2.strm.output, e2.strm.next_out, r2), e2.strm.next_out += r2, e2.strm.avail_out -= r2, e2.strm.total_out += r2);
+  } while (o2 === 0);
+  return s2 -= e2.strm.avail_in, s2 && (s2 >= e2.w_size ? (e2.matches = 2, e2.window.set(e2.strm.input.subarray(e2.strm.next_in - e2.w_size, e2.strm.next_in), 0), e2.strstart = e2.w_size, e2.insert = e2.strstart) : (e2.window_size - e2.strstart <= s2 && (e2.strstart -= e2.w_size, e2.window.set(e2.window.subarray(e2.w_size, e2.w_size + e2.strstart), 0), e2.matches < 2 && e2.matches++, e2.insert > e2.strstart && (e2.insert = e2.strstart)), e2.window.set(e2.strm.input.subarray(e2.strm.next_in - s2, e2.strm.next_in), e2.strstart), e2.strstart += s2, e2.insert += s2 > e2.w_size - e2.insert ? e2.w_size - e2.insert : s2), e2.block_start = e2.strstart), e2.high_water < e2.strstart && (e2.high_water = e2.strstart), o2 ? ve : t2 !== 0 && t2 !== 4 && e2.strm.avail_in === 0 && e2.strstart === e2.block_start ? ge : (a2 = e2.window_size - e2.strstart, e2.strm.avail_in > a2 && e2.block_start >= e2.w_size && (e2.block_start -= e2.w_size, e2.strstart -= e2.w_size, e2.window.set(e2.window.subarray(e2.w_size, e2.w_size + e2.strstart), 0), e2.matches < 2 && e2.matches++, a2 += e2.w_size, e2.insert > e2.strstart && (e2.insert = e2.strstart)), a2 > e2.strm.avail_in && (a2 = e2.strm.avail_in), a2 && (Se(e2.strm, e2.window, e2.strstart, a2), e2.strstart += a2, e2.insert += a2 > e2.w_size - e2.insert ? e2.w_size - e2.insert : a2), e2.high_water < e2.strstart && (e2.high_water = e2.strstart), a2 = e2.bi_valid + 42 >> 3, a2 = e2.pending_buf_size - a2 > 65535 ? 65535 : e2.pending_buf_size - a2, n2 = a2 > e2.w_size ? e2.w_size : a2, i2 = e2.strstart - e2.block_start, (i2 >= n2 || (i2 || t2 === 4) && t2 !== 0 && e2.strm.avail_in === 0 && i2 <= a2) && (r2 = i2 > a2 ? a2 : i2, o2 = +(t2 === 4 && e2.strm.avail_in === 0 && r2 === i2), de(e2, e2.block_start, r2, o2), e2.block_start += r2, xe(e2.strm)), o2 ? _e : I);
+};
+var Ee = (e2, t2) => {
+  let n2, r2;
+  for (; ; ) {
+    if (e2.lookahead < F) {
+      if (we(e2), e2.lookahead < F && t2 === 0) return I;
+      if (e2.lookahead === 0) break;
+    }
+    if (n2 = 0, e2.lookahead >= P && (n2 = L(e2, e2.strstart)), n2 !== 0 && e2.strstart - n2 <= e2.w_size - F && (e2.match_length = Ce(e2, n2)), e2.match_length >= P) if (r2 = j(e2, e2.strstart - e2.match_start, e2.match_length - P), e2.lookahead -= e2.match_length, e2.match_length <= e2.max_lazy_match && e2.lookahead >= P) {
+      e2.match_length--;
+      do
+        e2.strstart++, n2 = L(e2, e2.strstart);
+      while (--e2.match_length !== 0);
+      e2.strstart++;
+    } else e2.strstart += e2.match_length, e2.match_length = 0, e2.legacy_hash && (e2.ins_h = e2.window[e2.strstart], e2.ins_h = be(e2, e2.ins_h, e2.window[e2.strstart + 1]));
+    else r2 = j(e2, 0, e2.window[e2.strstart]), e2.lookahead--, e2.strstart++;
+    if (r2 && (R(e2, false), e2.strm.avail_out === 0)) return I;
+  }
+  return e2.insert = e2.strstart < P - 1 ? e2.strstart : P - 1, t2 === 4 ? (R(e2, true), e2.strm.avail_out === 0 ? _e : ve) : e2.sym_next && (R(e2, false), e2.strm.avail_out === 0) ? I : ge;
+};
+var z = (e2, t2) => {
+  let n2, r2, i2;
+  for (; ; ) {
+    if (e2.lookahead < F) {
+      if (we(e2), e2.lookahead < F && t2 === 0) return I;
+      if (e2.lookahead === 0) break;
+    }
+    if (n2 = 0, e2.lookahead >= P && (n2 = L(e2, e2.strstart)), e2.prev_length = e2.match_length, e2.prev_match = e2.match_start, e2.match_length = P - 1, n2 !== 0 && e2.prev_length < e2.max_lazy_match && e2.strstart - n2 <= e2.w_size - F && (e2.match_length = Ce(e2, n2), e2.match_length <= 5 && (e2.strategy === 1 || e2.match_length === P && e2.strstart - e2.match_start > 4096) && (e2.match_length = P - 1)), e2.prev_length >= P && e2.match_length <= e2.prev_length) {
+      i2 = e2.strstart + e2.lookahead - P, r2 = j(e2, e2.strstart - 1 - e2.prev_match, e2.prev_length - P), e2.lookahead -= e2.prev_length - 1, e2.prev_length -= 2;
+      do
+        ++e2.strstart <= i2 && (n2 = L(e2, e2.strstart));
+      while (--e2.prev_length !== 0);
+      if (e2.match_available = 0, e2.match_length = P - 1, e2.strstart++, r2 && (R(e2, false), e2.strm.avail_out === 0)) return I;
+    } else if (e2.match_available) {
+      if (r2 = j(e2, 0, e2.window[e2.strstart - 1]), r2 && R(e2, false), e2.strstart++, e2.lookahead--, e2.strm.avail_out === 0) return I;
+    } else e2.match_available = 1, e2.strstart++, e2.lookahead--;
+  }
+  return e2.match_available && (r2 = j(e2, 0, e2.window[e2.strstart - 1]), e2.match_available = 0), e2.insert = e2.strstart < P - 1 ? e2.strstart : P - 1, t2 === 4 ? (R(e2, true), e2.strm.avail_out === 0 ? _e : ve) : e2.sym_next && (R(e2, false), e2.strm.avail_out === 0) ? I : ge;
+};
+var B = class {
+  constructor(e2, t2, n2, r2, i2) {
+    this.good_length = e2, this.max_lazy = t2, this.nice_length = n2, this.max_chain = r2, this.func = i2;
+  }
+};
+new B(0, 0, 0, 0, Te), new B(4, 4, 8, 4, Ee), new B(4, 5, 16, 8, Ee), new B(4, 6, 32, 32, Ee), new B(4, 4, 16, 16, z), new B(8, 16, 32, 32, z), new B(8, 16, 128, 128, z), new B(8, 32, 128, 256, z), new B(32, 128, 258, 1024, z), new B(32, 258, 258, 4096, z);
+var V = 16209;
+var De = 16191;
+function Oe(e2, t2) {
+  let n2, r2, i2, a2, o2, s2, c2, l2, u2, d2, f2, p2, m2, h2, g2, _2, v2, y2, b2, x2, S2, C2, w2, T2, E2 = e2.state;
+  n2 = e2.next_in, w2 = e2.input, r2 = n2 + (e2.avail_in - 5), i2 = e2.next_out, T2 = e2.output, a2 = i2 - (t2 - e2.avail_out), o2 = i2 + (e2.avail_out - 257), s2 = E2.dmax, c2 = E2.wsize, l2 = E2.whave, u2 = E2.wnext, d2 = E2.window, f2 = E2.hold, p2 = E2.bits, m2 = E2.lencode, h2 = E2.distcode, g2 = (1 << E2.lenbits) - 1, _2 = (1 << E2.distbits) - 1;
+  top: do {
+    p2 < 15 && (f2 += w2[n2++] << p2, p2 += 8, f2 += w2[n2++] << p2, p2 += 8), v2 = m2[f2 & g2];
+    dolen: for (; ; ) {
+      if (y2 = v2 >>> 24, f2 >>>= y2, p2 -= y2, y2 = v2 >>> 16 & 255, y2 === 0) T2[i2++] = v2 & 65535;
+      else if (y2 & 16) {
+        b2 = v2 & 65535, y2 &= 15, y2 && (p2 < y2 && (f2 += w2[n2++] << p2, p2 += 8), b2 += f2 & (1 << y2) - 1, f2 >>>= y2, p2 -= y2), p2 < 15 && (f2 += w2[n2++] << p2, p2 += 8, f2 += w2[n2++] << p2, p2 += 8), v2 = h2[f2 & _2];
+        dodist: for (; ; ) {
+          if (y2 = v2 >>> 24, f2 >>>= y2, p2 -= y2, y2 = v2 >>> 16 & 255, y2 & 16) {
+            if (x2 = v2 & 65535, y2 &= 15, p2 < y2 && (f2 += w2[n2++] << p2, p2 += 8, p2 < y2 && (f2 += w2[n2++] << p2, p2 += 8)), x2 += f2 & (1 << y2) - 1, x2 > s2) {
+              e2.msg = `invalid distance too far back`, E2.mode = V;
+              break top;
+            }
+            if (f2 >>>= y2, p2 -= y2, y2 = i2 - a2, x2 > y2) {
+              if (y2 = x2 - y2, y2 > l2 && E2.sane) {
+                e2.msg = `invalid distance too far back`, E2.mode = V;
+                break top;
+              }
+              if (S2 = 0, C2 = d2, u2 === 0) {
+                if (S2 += c2 - y2, y2 < b2) {
+                  b2 -= y2;
+                  do
+                    T2[i2++] = d2[S2++];
+                  while (--y2);
+                  S2 = i2 - x2, C2 = T2;
+                }
+              } else if (u2 < y2) {
+                if (S2 += c2 + u2 - y2, y2 -= u2, y2 < b2) {
+                  b2 -= y2;
+                  do
+                    T2[i2++] = d2[S2++];
+                  while (--y2);
+                  if (S2 = 0, u2 < b2) {
+                    y2 = u2, b2 -= y2;
+                    do
+                      T2[i2++] = d2[S2++];
+                    while (--y2);
+                    S2 = i2 - x2, C2 = T2;
+                  }
+                }
+              } else if (S2 += u2 - y2, y2 < b2) {
+                b2 -= y2;
+                do
+                  T2[i2++] = d2[S2++];
+                while (--y2);
+                S2 = i2 - x2, C2 = T2;
+              }
+              for (; b2 > 2; ) T2[i2++] = C2[S2++], T2[i2++] = C2[S2++], T2[i2++] = C2[S2++], b2 -= 3;
+              b2 && (T2[i2++] = C2[S2++], b2 > 1 && (T2[i2++] = C2[S2++]));
+            } else {
+              S2 = i2 - x2;
+              do
+                T2[i2++] = T2[S2++], T2[i2++] = T2[S2++], T2[i2++] = T2[S2++], b2 -= 3;
+              while (b2 > 2);
+              b2 && (T2[i2++] = T2[S2++], b2 > 1 && (T2[i2++] = T2[S2++]));
+            }
+          } else if (y2 & 64) {
+            e2.msg = `invalid distance code`, E2.mode = V;
+            break top;
+          } else {
+            v2 = h2[(v2 & 65535) + (f2 & (1 << y2) - 1)];
+            continue dodist;
+          }
+          break;
+        }
+      } else if (!(y2 & 64)) {
+        v2 = m2[(v2 & 65535) + (f2 & (1 << y2) - 1)];
+        continue dolen;
+      } else if (y2 & 32) {
+        E2.mode = De;
+        break top;
+      } else {
+        e2.msg = `invalid literal/length code`, E2.mode = V;
+        break top;
+      }
+      break;
+    }
+  } while (n2 < r2 && i2 < o2);
+  b2 = p2 >> 3, n2 -= b2, p2 -= b2 << 3, f2 &= (1 << p2) - 1, e2.next_in = n2, e2.next_out = i2, e2.avail_in = n2 < r2 ? 5 + (r2 - n2) : 5 - (n2 - r2), e2.avail_out = i2 < o2 ? 257 + (o2 - i2) : 257 - (i2 - o2), E2.hold = f2, E2.bits = p2;
+}
+var H = 15;
+var ke = 852;
+var Ae = 592;
+var je = 0;
+var U = 1;
+var Me = 2;
+var Ne = new Uint16Array([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 Pe = new Uint8Array([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, 199, 75]);
+var Fe = new Uint16Array([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 Ie = new Uint8Array([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]);
+var W = (e2, t2, n2, r2, i2, a2, o2, s2) => {
+  let c2 = s2.bits, l2 = 0, u2 = 0, d2 = 0, f2 = 0, p2 = 0, m2 = 0, h2 = 0, g2 = 0, _2 = 0, v2 = 0, y2, b2, x2, S2, C2, w2 = null, T2, E2 = new Uint16Array(16), D2 = new Uint16Array(16), O2 = null, ee2, k2, A2;
+  for (l2 = 0; l2 <= H; l2++) E2[l2] = 0;
+  for (u2 = 0; u2 < r2; u2++) E2[t2[n2 + u2]]++;
+  for (p2 = c2, f2 = H; f2 >= 1 && E2[f2] === 0; f2--) ;
+  if (p2 > f2 && (p2 = f2), f2 === 0) return i2[a2++] = 20971520, i2[a2++] = 20971520, s2.bits = 1, 0;
+  for (d2 = 1; d2 < f2 && E2[d2] === 0; d2++) ;
+  for (p2 < d2 && (p2 = d2), g2 = 1, l2 = 1; l2 <= H; l2++) if (g2 <<= 1, g2 -= E2[l2], g2 < 0) return -1;
+  if (g2 > 0 && (e2 === je || f2 !== 1)) return -1;
+  for (D2[1] = 0, l2 = 1; l2 < H; l2++) D2[l2 + 1] = D2[l2] + E2[l2];
+  for (u2 = 0; u2 < r2; u2++) t2[n2 + u2] !== 0 && (o2[D2[t2[n2 + u2]]++] = u2);
+  if (e2 === je ? (w2 = O2 = o2, T2 = 20) : e2 === U ? (w2 = Ne, O2 = Pe, T2 = 257) : (w2 = Fe, O2 = Ie, T2 = 0), v2 = 0, u2 = 0, l2 = d2, C2 = a2, m2 = p2, h2 = 0, x2 = -1, _2 = 1 << p2, S2 = _2 - 1, e2 === U && _2 > ke || e2 === Me && _2 > Ae) return 1;
+  for (; ; ) {
+    ee2 = l2 - h2, o2[u2] + 1 < T2 ? (k2 = 0, A2 = o2[u2]) : o2[u2] >= T2 ? (k2 = O2[o2[u2] - T2], A2 = w2[o2[u2] - T2]) : (k2 = 96, A2 = 0), y2 = 1 << l2 - h2, b2 = 1 << m2, d2 = b2;
+    do
+      b2 -= y2, i2[C2 + (v2 >> h2) + b2] = ee2 << 24 | k2 << 16 | A2 | 0;
+    while (b2 !== 0);
+    for (y2 = 1 << l2 - 1; v2 & y2; ) y2 >>= 1;
+    if (y2 === 0 ? v2 = 0 : (v2 &= y2 - 1, v2 += y2), u2++, --E2[l2] === 0) {
+      if (l2 === f2) break;
+      l2 = t2[n2 + o2[u2]];
+    }
+    if (l2 > p2 && (v2 & S2) !== x2) {
+      for (h2 === 0 && (h2 = p2), C2 += d2, m2 = l2 - h2, g2 = 1 << m2; m2 + h2 < f2 && (g2 -= E2[m2 + h2], !(g2 <= 0)); ) m2++, g2 <<= 1;
+      if (_2 += 1 << m2, e2 === U && _2 > ke || e2 === Me && _2 > Ae) return 1;
+      x2 = v2 & S2, i2[x2] = p2 << 24 | m2 << 16 | C2 - a2 | 0;
+    }
+  }
+  return v2 !== 0 && (i2[C2 + v2] = l2 - h2 << 24 | 4194304), s2.bits = p2, 0;
+};
+var Le = 0;
+var Re = 1;
+var ze = 2;
+var G = 16180;
+var Be = 16181;
+var Ve = 16182;
+var He = 16183;
+var Ue = 16184;
+var We = 16185;
+var Ge = 16186;
+var Ke = 16187;
+var qe = 16188;
+var Je = 16189;
+var K = 16190;
+var q = 16191;
+var Ye = 16192;
+var Xe = 16193;
+var Ze = 16194;
+var Qe = 16195;
+var $e = 16196;
+var et = 16197;
+var tt = 16198;
+var J = 16199;
+var Y = 16200;
+var nt = 16201;
+var rt = 16202;
+var it = 16203;
+var at = 16204;
+var ot = 16205;
+var st = 16206;
+var ct = 16207;
+var lt = 16208;
+var X = 16209;
+var ut = 16210;
+var dt = 16211;
+var ft = 852;
+var pt = 592;
+var mt = (e2) => (e2 >>> 24 & 255) + (e2 >>> 8 & 65280) + ((e2 & 65280) << 8) + ((e2 & 255) << 24);
+var ht = class {
+  constructor() {
+    this.strm = null, this.mode = 0, this.last = false, this.wrap = 0, this.havedict = false, this.flags = 0, this.dmax = 0, this.check = 0, this.total = 0, this.head = null, this.wbits = 0, this.wsize = 0, this.whave = 0, this.wnext = 0, this.window = null, this.hold = 0, this.bits = 0, this.length = 0, this.offset = 0, this.extra = 0, this.lencode = null, this.distcode = null, this.lenbits = 0, this.distbits = 0, this.ncode = 0, this.nlen = 0, this.ndist = 0, this.have = 0, this.next = null, this.lens = new Uint16Array(320), this.work = new Uint16Array(288), this.lendyn = null, this.distdyn = null, this.sane = 0, this.back = 0, this.was = 0;
+  }
+};
+var Z = (e2) => {
+  if (!e2) return 1;
+  let t2 = e2.state;
+  return +(!t2 || t2.strm !== e2 || t2.mode < G || t2.mode > dt);
+};
+var gt = (e2) => {
+  if (Z(e2)) return -2;
+  let t2 = e2.state;
+  return e2.total_in = e2.total_out = t2.total = 0, e2.msg = ``, t2.wrap && (e2.adler = t2.wrap & 1), t2.mode = G, t2.last = 0, t2.havedict = 0, t2.flags = -1, t2.dmax = 32768, t2.head = null, t2.hold = 0, t2.bits = 0, t2.lencode = t2.lendyn = new Int32Array(ft), t2.distcode = t2.distdyn = new Int32Array(pt), t2.sane = 1, t2.back = -1, 0;
+};
+var _t = (e2) => {
+  if (Z(e2)) return -2;
+  let t2 = e2.state;
+  return t2.wsize = 0, t2.whave = 0, t2.wnext = 0, gt(e2);
+};
+var vt = (e2, t2) => {
+  let n2;
+  if (Z(e2)) return -2;
+  let r2 = e2.state;
+  return t2 < 0 ? (n2 = 0, t2 = -t2) : (n2 = (t2 >> 4) + 5, t2 < 48 && (t2 &= 15)), t2 && (t2 < 8 || t2 > 15) ? -2 : (r2.window !== null && r2.wbits !== t2 && (r2.window = null), r2.wrap = n2, r2.wbits = t2, _t(e2));
+};
+var yt = (e2, t2) => {
+  if (!e2) return -2;
+  let n2 = new ht();
+  e2.state = n2, n2.strm = e2, n2.window = null, n2.mode = G;
+  let r2 = vt(e2, t2);
+  return r2 !== 0 && (e2.state = null), r2;
+};
+var bt = true;
+var xt;
+var St;
+var Ct = (e2) => {
+  if (bt) {
+    xt = new Int32Array(512), St = new Int32Array(32);
+    let t2 = 0;
+    for (; t2 < 144; ) e2.lens[t2++] = 8;
+    for (; t2 < 256; ) e2.lens[t2++] = 9;
+    for (; t2 < 280; ) e2.lens[t2++] = 7;
+    for (; t2 < 288; ) e2.lens[t2++] = 8;
+    for (W(Re, e2.lens, 0, 288, xt, 0, e2.work, { bits: 9 }), t2 = 0; t2 < 32; ) e2.lens[t2++] = 5;
+    W(ze, e2.lens, 0, 32, St, 0, e2.work, { bits: 5 }), bt = false;
+  }
+  e2.lencode = xt, e2.lenbits = 9, e2.distcode = St, e2.distbits = 5;
+};
+var wt = (e2, t2, n2, r2) => {
+  let i2, a2 = e2.state;
+  return a2.window === null && (a2.window = new Uint8Array(1 << a2.wbits)), a2.wsize === 0 && (a2.wsize = 1 << a2.wbits, a2.wnext = 0, a2.whave = 0), r2 >= a2.wsize ? (a2.window.set(t2.subarray(n2 - a2.wsize, n2), 0), a2.wnext = 0, a2.whave = a2.wsize) : (i2 = a2.wsize - a2.wnext, i2 > r2 && (i2 = r2), a2.window.set(t2.subarray(n2 - r2, n2 - r2 + i2), a2.wnext), r2 -= i2, r2 ? (a2.window.set(t2.subarray(n2 - r2, n2), 0), a2.wnext = r2, a2.whave = a2.wsize) : (a2.wnext += i2, a2.wnext === a2.wsize && (a2.wnext = 0), a2.whave < a2.wsize && (a2.whave += i2))), 0;
+};
+var Tt = (e2, t2) => {
+  let n2, r2, i2, a2, o2, s2, c2, l2, u2, d2, f2, p2, m2, h2, g2 = 0, _2, v2, y2, b2, x2, S2, C2, w2, T2 = new Uint8Array(4), E2, D2, O2 = new Uint8Array([16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15]);
+  if (Z(e2) || !e2.output || !e2.input && e2.avail_in !== 0) return -2;
+  n2 = e2.state, n2.mode === q && (n2.mode = Ye), o2 = e2.next_out, i2 = e2.output, c2 = e2.avail_out, a2 = e2.next_in, r2 = e2.input, s2 = e2.avail_in, l2 = n2.hold, u2 = n2.bits, d2 = s2, f2 = c2, w2 = 0;
+  inf_leave: for (; ; ) switch (n2.mode) {
+    case G:
+      if (n2.wrap === 0) {
+        n2.mode = Ye;
+        break;
+      }
+      for (; u2 < 16; ) {
+        if (s2 === 0) break inf_leave;
+        s2--, l2 += r2[a2++] << u2, u2 += 8;
+      }
+      if (n2.wrap & 2 && l2 === 35615) {
+        n2.wbits === 0 && (n2.wbits = 15), n2.check = 0, T2[0] = l2 & 255, T2[1] = l2 >>> 8 & 255, n2.check = N(n2.check, T2, 2, 0), l2 = 0, u2 = 0, n2.mode = Be;
+        break;
+      }
+      if (n2.head && (n2.head.done = false), !(n2.wrap & 1) || (((l2 & 255) << 8) + (l2 >> 8)) % 31) {
+        e2.msg = `incorrect header check`, n2.mode = X;
+        break;
+      }
+      if ((l2 & 15) != 8) {
+        e2.msg = `unknown compression method`, n2.mode = X;
+        break;
+      }
+      if (l2 >>>= 4, u2 -= 4, C2 = (l2 & 15) + 8, n2.wbits === 0 && (n2.wbits = C2), C2 > 15 || C2 > n2.wbits) {
+        e2.msg = `invalid window size`, n2.mode = X;
+        break;
+      }
+      n2.dmax = 1 << n2.wbits, n2.flags = 0, e2.adler = n2.check = 1, n2.mode = l2 & 512 ? Je : q, l2 = 0, u2 = 0;
+      break;
+    case Be:
+      for (; u2 < 16; ) {
+        if (s2 === 0) break inf_leave;
+        s2--, l2 += r2[a2++] << u2, u2 += 8;
+      }
+      if (n2.flags = l2, (n2.flags & 255) != 8) {
+        e2.msg = `unknown compression method`, n2.mode = X;
+        break;
+      }
+      if (n2.flags & 57344) {
+        e2.msg = `unknown header flags set`, n2.mode = X;
+        break;
+      }
+      n2.head && (n2.head.text = l2 >> 8 & 1), n2.flags & 512 && n2.wrap & 4 && (T2[0] = l2 & 255, T2[1] = l2 >>> 8 & 255, n2.check = N(n2.check, T2, 2, 0)), l2 = 0, u2 = 0, n2.mode = Ve;
+    case Ve:
+      for (; u2 < 32; ) {
+        if (s2 === 0) break inf_leave;
+        s2--, l2 += r2[a2++] << u2, u2 += 8;
+      }
+      n2.head && (n2.head.time = l2), n2.flags & 512 && n2.wrap & 4 && (T2[0] = l2 & 255, T2[1] = l2 >>> 8 & 255, T2[2] = l2 >>> 16 & 255, T2[3] = l2 >>> 24 & 255, n2.check = N(n2.check, T2, 4, 0)), l2 = 0, u2 = 0, n2.mode = He;
+    case He:
+      for (; u2 < 16; ) {
+        if (s2 === 0) break inf_leave;
+        s2--, l2 += r2[a2++] << u2, u2 += 8;
+      }
+      n2.head && (n2.head.xflags = l2 & 255, n2.head.os = l2 >> 8), n2.flags & 512 && n2.wrap & 4 && (T2[0] = l2 & 255, T2[1] = l2 >>> 8 & 255, n2.check = N(n2.check, T2, 2, 0)), l2 = 0, u2 = 0, n2.mode = Ue;
+    case Ue:
+      if (n2.flags & 1024) {
+        for (; u2 < 16; ) {
+          if (s2 === 0) break inf_leave;
+          s2--, l2 += r2[a2++] << u2, u2 += 8;
+        }
+        n2.length = l2, n2.head && (n2.head.extra_len = l2), n2.flags & 512 && n2.wrap & 4 && (T2[0] = l2 & 255, T2[1] = l2 >>> 8 & 255, n2.check = N(n2.check, T2, 2, 0)), l2 = 0, u2 = 0;
+      } else n2.head && (n2.head.extra = null);
+      n2.mode = We;
+    case We:
+      if (n2.flags & 1024 && (p2 = n2.length, p2 > s2 && (p2 = s2), p2 && (n2.head && (C2 = n2.head.extra_len - n2.length, n2.head.extra || (n2.head.extra = new Uint8Array(n2.head.extra_len)), n2.head.extra.set(r2.subarray(a2, a2 + p2), C2)), n2.flags & 512 && n2.wrap & 4 && (n2.check = N(n2.check, r2, p2, a2)), s2 -= p2, a2 += p2, n2.length -= p2), n2.length)) break inf_leave;
+      n2.length = 0, n2.mode = Ge;
+    case Ge:
+      if (n2.flags & 2048) {
+        if (s2 === 0) break inf_leave;
+        p2 = 0;
+        do
+          C2 = r2[a2 + p2++], n2.head && C2 && n2.length < 65536 && (n2.head.name += String.fromCharCode(C2));
+        while (C2 && p2 < s2);
+        if (n2.flags & 512 && n2.wrap & 4 && (n2.check = N(n2.check, r2, p2, a2)), s2 -= p2, a2 += p2, C2) break inf_leave;
+      } else n2.head && (n2.head.name = null);
+      n2.length = 0, n2.mode = Ke;
+    case Ke:
+      if (n2.flags & 4096) {
+        if (s2 === 0) break inf_leave;
+        p2 = 0;
+        do
+          C2 = r2[a2 + p2++], n2.head && C2 && n2.length < 65536 && (n2.head.comment += String.fromCharCode(C2));
+        while (C2 && p2 < s2);
+        if (n2.flags & 512 && n2.wrap & 4 && (n2.check = N(n2.check, r2, p2, a2)), s2 -= p2, a2 += p2, C2) break inf_leave;
+      } else n2.head && (n2.head.comment = null);
+      n2.mode = qe;
+    case qe:
+      if (n2.flags & 512) {
+        for (; u2 < 16; ) {
+          if (s2 === 0) break inf_leave;
+          s2--, l2 += r2[a2++] << u2, u2 += 8;
+        }
+        if (n2.wrap & 4 && l2 !== (n2.check & 65535)) {
+          e2.msg = `header crc mismatch`, n2.mode = X;
+          break;
+        }
+        l2 = 0, u2 = 0;
+      }
+      n2.head && (n2.head.hcrc = n2.flags >> 9 & 1, n2.head.done = true), e2.adler = n2.check = 0, n2.mode = q;
+      break;
+    case Je:
+      for (; u2 < 32; ) {
+        if (s2 === 0) break inf_leave;
+        s2--, l2 += r2[a2++] << u2, u2 += 8;
+      }
+      e2.adler = n2.check = mt(l2), l2 = 0, u2 = 0, n2.mode = K;
+    case K:
+      if (n2.havedict === 0) return e2.next_out = o2, e2.avail_out = c2, e2.next_in = a2, e2.avail_in = s2, n2.hold = l2, n2.bits = u2, 2;
+      e2.adler = n2.check = 1, n2.mode = q;
+    case q:
+      if (t2 === 5 || t2 === 6) break inf_leave;
+    case Ye:
+      if (n2.last) {
+        l2 >>>= u2 & 7, u2 -= u2 & 7, n2.mode = st;
+        break;
+      }
+      for (; u2 < 3; ) {
+        if (s2 === 0) break inf_leave;
+        s2--, l2 += r2[a2++] << u2, u2 += 8;
+      }
+      switch (n2.last = l2 & 1, l2 >>>= 1, --u2, l2 & 3) {
+        case 0:
+          n2.mode = Xe;
+          break;
+        case 1:
+          if (Ct(n2), n2.mode = J, t2 === 6) {
+            l2 >>>= 2, u2 -= 2;
+            break inf_leave;
+          }
+          break;
+        case 2:
+          n2.mode = $e;
+          break;
+        case 3:
+          e2.msg = `invalid block type`, n2.mode = X;
+      }
+      l2 >>>= 2, u2 -= 2;
+      break;
+    case Xe:
+      for (l2 >>>= u2 & 7, u2 -= u2 & 7; u2 < 32; ) {
+        if (s2 === 0) break inf_leave;
+        s2--, l2 += r2[a2++] << u2, u2 += 8;
+      }
+      if ((l2 & 65535) != (l2 >>> 16 ^ 65535)) {
+        e2.msg = `invalid stored block lengths`, n2.mode = X;
+        break;
+      }
+      if (n2.length = l2 & 65535, l2 = 0, u2 = 0, n2.mode = Ze, t2 === 6) break inf_leave;
+    case Ze:
+      n2.mode = Qe;
+    case Qe:
+      if (p2 = n2.length, p2) {
+        if (p2 > s2 && (p2 = s2), p2 > c2 && (p2 = c2), p2 === 0) break inf_leave;
+        i2.set(r2.subarray(a2, a2 + p2), o2), s2 -= p2, a2 += p2, c2 -= p2, o2 += p2, n2.length -= p2;
+        break;
+      }
+      n2.mode = q;
+      break;
+    case $e:
+      for (; u2 < 14; ) {
+        if (s2 === 0) break inf_leave;
+        s2--, l2 += r2[a2++] << u2, u2 += 8;
+      }
+      if (n2.nlen = (l2 & 31) + 257, l2 >>>= 5, u2 -= 5, n2.ndist = (l2 & 31) + 1, l2 >>>= 5, u2 -= 5, n2.ncode = (l2 & 15) + 4, l2 >>>= 4, u2 -= 4, n2.nlen > 286 || n2.ndist > 30) {
+        e2.msg = `too many length or distance symbols`, n2.mode = X;
+        break;
+      }
+      n2.have = 0, n2.mode = et;
+    case et:
+      for (; n2.have < n2.ncode; ) {
+        for (; u2 < 3; ) {
+          if (s2 === 0) break inf_leave;
+          s2--, l2 += r2[a2++] << u2, u2 += 8;
+        }
+        n2.lens[O2[n2.have++]] = l2 & 7, l2 >>>= 3, u2 -= 3;
+      }
+      for (; n2.have < 19; ) n2.lens[O2[n2.have++]] = 0;
+      if (n2.lencode = n2.lendyn, n2.lenbits = 7, E2 = { bits: n2.lenbits }, w2 = W(Le, n2.lens, 0, 19, n2.lencode, 0, n2.work, E2), n2.lenbits = E2.bits, w2) {
+        e2.msg = `invalid code lengths set`, n2.mode = X;
+        break;
+      }
+      n2.have = 0, n2.mode = tt;
+    case tt:
+      for (; n2.have < n2.nlen + n2.ndist; ) {
+        for (; g2 = n2.lencode[l2 & (1 << n2.lenbits) - 1], _2 = g2 >>> 24, v2 = g2 >>> 16 & 255, y2 = g2 & 65535, !(_2 <= u2); ) {
+          if (s2 === 0) break inf_leave;
+          s2--, l2 += r2[a2++] << u2, u2 += 8;
+        }
+        if (y2 < 16) l2 >>>= _2, u2 -= _2, n2.lens[n2.have++] = y2;
+        else {
+          if (y2 === 16) {
+            for (D2 = _2 + 2; u2 < D2; ) {
+              if (s2 === 0) break inf_leave;
+              s2--, l2 += r2[a2++] << u2, u2 += 8;
+            }
+            if (l2 >>>= _2, u2 -= _2, n2.have === 0) {
+              e2.msg = `invalid bit length repeat`, n2.mode = X;
+              break;
+            }
+            C2 = n2.lens[n2.have - 1], p2 = 3 + (l2 & 3), l2 >>>= 2, u2 -= 2;
+          } else if (y2 === 17) {
+            for (D2 = _2 + 3; u2 < D2; ) {
+              if (s2 === 0) break inf_leave;
+              s2--, l2 += r2[a2++] << u2, u2 += 8;
+            }
+            l2 >>>= _2, u2 -= _2, C2 = 0, p2 = 3 + (l2 & 7), l2 >>>= 3, u2 -= 3;
+          } else {
+            for (D2 = _2 + 7; u2 < D2; ) {
+              if (s2 === 0) break inf_leave;
+              s2--, l2 += r2[a2++] << u2, u2 += 8;
+            }
+            l2 >>>= _2, u2 -= _2, C2 = 0, p2 = 11 + (l2 & 127), l2 >>>= 7, u2 -= 7;
+          }
+          if (n2.have + p2 > n2.nlen + n2.ndist) {
+            e2.msg = `invalid bit length repeat`, n2.mode = X;
+            break;
+          }
+          for (; p2--; ) n2.lens[n2.have++] = C2;
+        }
+      }
+      if (n2.mode === X) break;
+      if (n2.lens[256] === 0) {
+        e2.msg = `invalid code -- missing end-of-block`, n2.mode = X;
+        break;
+      }
+      if (n2.lenbits = 9, E2 = { bits: n2.lenbits }, w2 = W(Re, n2.lens, 0, n2.nlen, n2.lencode, 0, n2.work, E2), n2.lenbits = E2.bits, w2) {
+        e2.msg = `invalid literal/lengths set`, n2.mode = X;
+        break;
+      }
+      if (n2.distbits = 6, n2.distcode = n2.distdyn, E2 = { bits: n2.distbits }, w2 = W(ze, n2.lens, n2.nlen, n2.ndist, n2.distcode, 0, n2.work, E2), n2.distbits = E2.bits, w2) {
+        e2.msg = `invalid distances set`, n2.mode = X;
+        break;
+      }
+      if (n2.mode = J, t2 === 6) break inf_leave;
+    case J:
+      n2.mode = Y;
+    case Y:
+      if (s2 >= 6 && c2 >= 258) {
+        e2.next_out = o2, e2.avail_out = c2, e2.next_in = a2, e2.avail_in = s2, n2.hold = l2, n2.bits = u2, Oe(e2, f2), o2 = e2.next_out, i2 = e2.output, c2 = e2.avail_out, a2 = e2.next_in, r2 = e2.input, s2 = e2.avail_in, l2 = n2.hold, u2 = n2.bits, n2.mode === q && (n2.back = -1);
+        break;
+      }
+      for (n2.back = 0; g2 = n2.lencode[l2 & (1 << n2.lenbits) - 1], _2 = g2 >>> 24, v2 = g2 >>> 16 & 255, y2 = g2 & 65535, !(_2 <= u2); ) {
+        if (s2 === 0) break inf_leave;
+        s2--, l2 += r2[a2++] << u2, u2 += 8;
+      }
+      if (v2 && !(v2 & 240)) {
+        for (b2 = _2, x2 = v2, S2 = y2; g2 = n2.lencode[S2 + ((l2 & (1 << b2 + x2) - 1) >> b2)], _2 = g2 >>> 24, v2 = g2 >>> 16 & 255, y2 = g2 & 65535, !(b2 + _2 <= u2); ) {
+          if (s2 === 0) break inf_leave;
+          s2--, l2 += r2[a2++] << u2, u2 += 8;
+        }
+        l2 >>>= b2, u2 -= b2, n2.back += b2;
+      }
+      if (l2 >>>= _2, u2 -= _2, n2.back += _2, n2.length = y2, v2 === 0) {
+        n2.mode = ot;
+        break;
+      }
+      if (v2 & 32) {
+        n2.back = -1, n2.mode = q;
+        break;
+      }
+      if (v2 & 64) {
+        e2.msg = `invalid literal/length code`, n2.mode = X;
+        break;
+      }
+      n2.extra = v2 & 15, n2.mode = nt;
+    case nt:
+      if (n2.extra) {
+        for (D2 = n2.extra; u2 < D2; ) {
+          if (s2 === 0) break inf_leave;
+          s2--, l2 += r2[a2++] << u2, u2 += 8;
+        }
+        n2.length += l2 & (1 << n2.extra) - 1, l2 >>>= n2.extra, u2 -= n2.extra, n2.back += n2.extra;
+      }
+      n2.was = n2.length, n2.mode = rt;
+    case rt:
+      for (; g2 = n2.distcode[l2 & (1 << n2.distbits) - 1], _2 = g2 >>> 24, v2 = g2 >>> 16 & 255, y2 = g2 & 65535, !(_2 <= u2); ) {
+        if (s2 === 0) break inf_leave;
+        s2--, l2 += r2[a2++] << u2, u2 += 8;
+      }
+      if (!(v2 & 240)) {
+        for (b2 = _2, x2 = v2, S2 = y2; g2 = n2.distcode[S2 + ((l2 & (1 << b2 + x2) - 1) >> b2)], _2 = g2 >>> 24, v2 = g2 >>> 16 & 255, y2 = g2 & 65535, !(b2 + _2 <= u2); ) {
+          if (s2 === 0) break inf_leave;
+          s2--, l2 += r2[a2++] << u2, u2 += 8;
+        }
+        l2 >>>= b2, u2 -= b2, n2.back += b2;
+      }
+      if (l2 >>>= _2, u2 -= _2, n2.back += _2, v2 & 64) {
+        e2.msg = `invalid distance code`, n2.mode = X;
+        break;
+      }
+      n2.offset = y2, n2.extra = v2 & 15, n2.mode = it;
+    case it:
+      if (n2.extra) {
+        for (D2 = n2.extra; u2 < D2; ) {
+          if (s2 === 0) break inf_leave;
+          s2--, l2 += r2[a2++] << u2, u2 += 8;
+        }
+        n2.offset += l2 & (1 << n2.extra) - 1, l2 >>>= n2.extra, u2 -= n2.extra, n2.back += n2.extra;
+      }
+      if (n2.offset > n2.dmax) {
+        e2.msg = `invalid distance too far back`, n2.mode = X;
+        break;
+      }
+      n2.mode = at;
+    case at:
+      if (c2 === 0) break inf_leave;
+      if (p2 = f2 - c2, n2.offset > p2) {
+        if (p2 = n2.offset - p2, p2 > n2.whave && n2.sane) {
+          e2.msg = `invalid distance too far back`, n2.mode = X;
+          break;
+        }
+        p2 > n2.wnext ? (p2 -= n2.wnext, m2 = n2.wsize - p2) : m2 = n2.wnext - p2, p2 > n2.length && (p2 = n2.length), h2 = n2.window;
+      } else h2 = i2, m2 = o2 - n2.offset, p2 = n2.length;
+      p2 > c2 && (p2 = c2), c2 -= p2, n2.length -= p2;
+      do
+        i2[o2++] = h2[m2++];
+      while (--p2);
+      n2.length === 0 && (n2.mode = Y);
+      break;
+    case ot:
+      if (c2 === 0) break inf_leave;
+      i2[o2++] = n2.length, c2--, n2.mode = Y;
+      break;
+    case st:
+      if (n2.wrap) {
+        for (; u2 < 32; ) {
+          if (s2 === 0) break inf_leave;
+          s2--, l2 |= r2[a2++] << u2, u2 += 8;
+        }
+        if (f2 -= c2, e2.total_out += f2, n2.total += f2, n2.wrap & 4 && f2 && (e2.adler = n2.check = n2.flags ? N(n2.check, i2, f2, o2 - f2) : M(n2.check, i2, f2, o2 - f2)), f2 = c2, n2.wrap & 4 && (n2.flags ? l2 : mt(l2)) !== n2.check) {
+          e2.msg = `incorrect data check`, n2.mode = X;
+          break;
+        }
+        l2 = 0, u2 = 0;
+      }
+      n2.mode = ct;
+    case ct:
+      if (n2.wrap && n2.flags) {
+        for (; u2 < 32; ) {
+          if (s2 === 0) break inf_leave;
+          s2--, l2 += r2[a2++] << u2, u2 += 8;
+        }
+        if (n2.wrap & 4 && l2 !== (n2.total & 4294967295)) {
+          e2.msg = `incorrect length check`, n2.mode = X;
+          break;
+        }
+        l2 = 0, u2 = 0;
+      }
+      n2.mode = lt;
+    case lt:
+      w2 = 1;
+      break inf_leave;
+    case X:
+      w2 = -3;
+      break inf_leave;
+    case ut:
+      return -4;
+    case dt:
+    default:
+      return -2;
+  }
+  return e2.next_out = o2, e2.avail_out = c2, e2.next_in = a2, e2.avail_in = s2, n2.hold = l2, n2.bits = u2, (n2.wsize || f2 !== e2.avail_out && n2.mode < X && (n2.mode < st || t2 !== 4)) && wt(e2, e2.output, e2.next_out, f2 - e2.avail_out) ? (n2.mode = ut, -4) : (d2 -= e2.avail_in, f2 -= e2.avail_out, e2.total_in += d2, e2.total_out += f2, n2.total += f2, n2.wrap & 4 && f2 && (e2.adler = n2.check = n2.flags ? N(n2.check, i2, f2, e2.next_out - f2) : M(n2.check, i2, f2, e2.next_out - f2)), e2.data_type = n2.bits + (n2.last ? 64 : 0) + (n2.mode === q ? 128 : 0) + (n2.mode === J || n2.mode === Ze ? 256 : 0), (d2 === 0 && f2 === 0 || t2 === 4) && w2 === 0 && (w2 = -5), w2);
+};
+var Et = (e2) => {
+  if (Z(e2)) return -2;
+  let t2 = e2.state;
+  return t2.window && (t2.window = null), e2.state = null, 0;
+};
+var Dt = (e2, t2) => {
+  let n2 = t2.length, r2, i2, a2;
+  return Z(e2) || (r2 = e2.state, r2.wrap !== 0 && r2.mode !== K) ? -2 : r2.mode === K && (i2 = 1, i2 = M(i2, t2, n2, 0), i2 !== r2.check) ? -3 : (a2 = wt(e2, t2, n2, n2), a2 ? (r2.mode = ut, -4) : (r2.havedict = 1, 0));
+};
+var Ot = class {
+  constructor() {
+    this.input = null, this.next_in = 0, this.avail_in = 0, this.total_in = 0, this.output = null, this.next_out = 0, this.avail_out = 0, this.total_out = 0, this.msg = ``, this.state = null, this.data_type = 2, this.adler = 0;
+  }
+};
+var kt = (e2) => {
+  let t2 = new Uint8Array(e2.reduce((e3, t3) => e3 + t3.length, 0)), n2 = 0;
+  for (let r2 of e2) t2.set(r2, n2), n2 += r2.length;
+  return t2;
+};
+function Q(e2) {
+  "@babel/helpers - typeof";
+  return Q = typeof Symbol == `function` && typeof Symbol.iterator == `symbol` ? function(e3) {
+    return typeof e3;
+  } : function(e3) {
+    return e3 && typeof Symbol == `function` && e3.constructor === Symbol && e3 !== Symbol.prototype ? `symbol` : typeof e3;
+  }, Q(e2);
+}
+function At(e2, t2) {
+  if (Q(e2) != `object` || !e2) return e2;
+  var n2 = e2[Symbol.toPrimitive];
+  if (n2 !== void 0) {
+    var r2 = n2.call(e2, t2 || `default`);
+    if (Q(r2) != `object`) return r2;
+    throw TypeError(`@@toPrimitive must return a primitive value.`);
+  }
+  return (t2 === `string` ? String : Number)(e2);
+}
+function jt(e2) {
+  var t2 = At(e2, `string`);
+  return Q(t2) == `symbol` ? t2 : t2 + ``;
+}
+function $(e2, t2, n2) {
+  return (t2 = jt(t2)) in e2 ? Object.defineProperty(e2, t2, { value: n2, enumerable: true, configurable: true, writable: true }) : e2[t2] = n2, e2;
+}
+var Pt = Object.prototype.toString;
+var Ft = { chunkSize: 1024 * 64, windowBits: 15, raw: false, dictionary: new Uint8Array() };
+var It = class {
+  constructor(e2 = {}) {
+    $(this, `options`, void 0), $(this, `err`, void 0), $(this, `msg`, void 0), $(this, `ended`, void 0), $(this, `started`, void 0), $(this, `chunks`, void 0), $(this, `strm`, void 0), $(this, `result`, void 0), this.options = Object.assign({}, Ft, e2);
+    let t2 = this.options;
+    t2.raw && t2.windowBits >= 0 && t2.windowBits < 16 && (t2.windowBits = -t2.windowBits, t2.windowBits === 0 && (t2.windowBits = -15)), t2.windowBits >= 0 && t2.windowBits < 16 && !e2.windowBits && (t2.windowBits += 32), t2.windowBits > 15 && t2.windowBits < 48 && (t2.windowBits & 15 || (t2.windowBits |= 15)), this.err = 0, this.msg = ``, this.ended = false, this.started = false, this.chunks = [], this.result = new Uint8Array(), this.strm = new Ot(), this.strm.avail_out = 0;
+    let n2 = yt(this.strm, t2.windowBits);
+    if (n2 !== 0) throw Error(me[n2]);
+    Pt.call(t2.dictionary) === `[object ArrayBuffer]` && (t2.dictionary = new Uint8Array(t2.dictionary));
+    let r2 = t2.dictionary;
+    if (t2.raw && r2.length && (n2 = Dt(this.strm, r2), n2 !== 0)) throw Error(me[n2]);
+  }
+  push(e2, t2 = false) {
+    let n2 = this.strm, r2 = this.options.chunkSize, i2, a2, o2;
+    if (this.ended) return this.err === 0;
+    for (a2 = typeof t2 == `number` ? t2 : t2 === true ? 4 : 0, Pt.call(e2) === `[object ArrayBuffer]` ? n2.input = new Uint8Array(e2) : n2.input = e2, n2.next_in = 0, n2.avail_in = n2.input.length, this.started || (this.started = true, this.onStart(n2)); ; ) {
+      if (n2.avail_out === 0 && (n2.output = new Uint8Array(r2), n2.next_out = 0, n2.avail_out = r2), i2 = Tt(n2, a2), i2 === 2) {
+        let e3 = this.options.dictionary;
+        e3.length && (i2 = Dt(n2, e3), i2 === 0 ? i2 = Tt(n2, a2) : i2 === -3 && (i2 = 2));
+      }
+      for (; n2.avail_in > 0 && i2 === 1 && n2.state.wrap & 2 && n2.state.flags !== 0 && n2.input[n2.next_in] !== 0; ) _t(n2), i2 = Tt(n2, a2);
+      if (i2 === -2 || i2 === -3 || i2 === 2 || i2 === -4) break;
+      if (o2 = n2.avail_out, n2.next_out && (n2.avail_out === 0 || i2 === 1 || a2 > 0) && (this.onData(n2.output.length === n2.next_out ? n2.output : n2.output.subarray(0, n2.next_out)), n2.avail_out = 0, n2.next_out = 0), !((i2 === 0 || i2 === -5) && o2 === 0)) {
+        if (i2 === 1) {
+          i2 = Et(this.strm);
+          break;
+        }
+        if (n2.avail_in === 0) {
+          if (a2 === 4) {
+            i2 = Et(this.strm), i2 === 0 && (i2 = -5);
+            break;
+          }
+          return true;
+        }
+      }
+    }
+    return this.err = i2, this.msg = n2.msg || me[i2], this.ended = true, this.onEnd(i2), i2 === 0;
+  }
+  onStart(e2) {
+  }
+  onData(e2) {
+    this.chunks.push(e2);
+  }
+  onEnd(e2) {
+    e2 === 0 && (this.result = kt(this.chunks)), this.chunks = [];
+  }
+};
+function Lt(e2, t2 = {}) {
+  let n2 = new It(t2);
+  if (n2.push(e2, true), n2.err) throw Error(n2.msg);
+  let r2 = n2.result;
+  return t2.toText ? new TextDecoder().decode(r2) : r2;
+}
+
 // packages/engine/Source/Workers/decodeGoogleEarthEnterprisePacket.js
-var import_inflate = __toESM(require_inflate2(), 1);
 var sizeOfUint16 = Uint16Array.BYTES_PER_ELEMENT;
 var sizeOfInt32 = Int32Array.BYTES_PER_ELEMENT;
 var sizeOfUint32 = Uint32Array.BYTES_PER_ELEMENT;
@@ -2478,12 +1145,12 @@ var Types = {
   TERRAIN: 1,
   DBROOT: 2
 };
-Types.fromString = function(s) {
-  if (s === "Metadata") {
+Types.fromString = function(s2) {
+  if (s2 === "Metadata") {
     return Types.METADATA;
-  } else if (s === "Terrain") {
+  } else if (s2 === "Terrain") {
     return Types.TERRAIN;
-  } else if (s === "DbRoot") {
+  } else if (s2 === "DbRoot") {
     return Types.DBROOT;
   }
 };
@@ -2547,7 +1214,7 @@ function processMetadata(buffer, totalSize, quadKey) {
     throw new RuntimeError_default("Invalid packet offsets");
   }
   const instances = [];
-  for (let i = 0; i < numInstances; ++i) {
+  for (let i2 = 0; i2 < numInstances; ++i2) {
     const bitfield = dv.getUint8(offset);
     ++offset;
     ++offset;
@@ -2586,12 +1253,12 @@ function processMetadata(buffer, totalSize, quadKey) {
       }
       isLeaf = true;
     }
-    for (let i = 0; i < 4; ++i) {
-      const childKey = parentKey + i.toString();
+    for (let i2 = 0; i2 < 4; ++i2) {
+      const childKey = parentKey + i2.toString();
       if (isLeaf) {
         tileInfo[childKey] = null;
       } else if (level2 < 4) {
-        if (!parent.hasChild(i)) {
+        if (!parent.hasChild(i2)) {
           tileInfo[childKey] = null;
         } else {
           if (index === numInstances) {
@@ -2654,7 +1321,7 @@ function uncompressPacket(data) {
   const size = dv.getUint32(offset, magic === compressedMagic2);
   offset += sizeOfUint32;
   const compressedPacket = new Uint8Array(data, offset);
-  const uncompressedPacket = import_inflate.default.inflate(compressedPacket);
+  const uncompressedPacket = Lt(compressedPacket);
   if (uncompressedPacket.length !== size) {
     throw new RuntimeError_default("Size of packet doesn't match header");
   }