pptx-svelte-viewer 3.2.1 → 3.2.2

package/dist/UTIF-VK8lD02M.js

@@ -0,0 +1,3020 @@
+import { n as e0, t as De } from "./rolldown-runtime--eTHp1Qs.js";
+var me = /* @__PURE__ */ De(((V) => {
+  var Q = typeof Uint8Array < "u" && typeof Uint16Array < "u" && typeof Int32Array < "u";
+  function ee(p, $) {
+    return Object.prototype.hasOwnProperty.call(p, $);
+  }
+  V.assign = function(p) {
+    for (var $ = Array.prototype.slice.call(arguments, 1); $.length; ) {
+      var n = $.shift();
+      if (n) {
+        if (typeof n != "object") throw new TypeError(n + "must be non-object");
+        for (var r in n) ee(n, r) && (p[r] = n[r]);
+      }
+    }
+    return p;
+  }, V.shrinkBuf = function(p, $) {
+    return p.length === $ ? p : p.subarray ? p.subarray(0, $) : (p.length = $, p);
+  };
+  var te = {
+    arraySet: function(p, $, n, r, l) {
+      if ($.subarray && p.subarray) {
+        p.set($.subarray(n, n + r), l);
+        return;
+      }
+      for (var u = 0; u < r; u++) p[l + u] = $[n + u];
+    },
+    flattenChunks: function(p) {
+      var $, n, r = 0, l, u, w;
+      for ($ = 0, n = p.length; $ < n; $++) r += p[$].length;
+      for (w = new Uint8Array(r), l = 0, $ = 0, n = p.length; $ < n; $++)
+        u = p[$], w.set(u, l), l += u.length;
+      return w;
+    }
+  }, T = {
+    arraySet: function(p, $, n, r, l) {
+      for (var u = 0; u < r; u++) p[l + u] = $[n + u];
+    },
+    flattenChunks: function(p) {
+      return [].concat.apply([], p);
+    }
+  };
+  V.setTyped = function(p) {
+    p ? (V.Buf8 = Uint8Array, V.Buf16 = Uint16Array, V.Buf32 = Int32Array, V.assign(V, te)) : (V.Buf8 = Array, V.Buf16 = Array, V.Buf32 = Array, V.assign(V, T));
+  }, V.setTyped(Q);
+})), r0 = /* @__PURE__ */ De(((V) => {
+  var Q = me(), ee = 4, te = 0, T = 1, p = 2;
+  function $(f) {
+    for (var J = f.length; --J >= 0; ) f[J] = 0;
+  }
+  var n = 0, r = 1, l = 2, u = 3, w = 258, d = 29, o = 256, v = o + 1 + d, y = 30, _ = 19, b = 2 * v + 1, s = 15, h = 16, t = 7, c = 256, g = 16, x = 17, B = 18, E = [
+    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
+  ], O = [
+    0,
+    0,
+    0,
+    0,
+    1,
+    1,
+    2,
+    2,
+    3,
+    3,
+    4,
+    4,
+    5,
+    5,
+    6,
+    6,
+    7,
+    7,
+    8,
+    8,
+    9,
+    9,
+    10,
+    10,
+    11,
+    11,
+    12,
+    12,
+    13,
+    13
+  ], N = [
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    0,
+    2,
+    3,
+    7
+  ], A = [
+    16,
+    17,
+    18,
+    0,
+    8,
+    7,
+    9,
+    6,
+    10,
+    5,
+    11,
+    4,
+    12,
+    3,
+    13,
+    2,
+    14,
+    1,
+    15
+  ], P = 512, G = new Array((v + 2) * 2);
+  $(G);
+  var L = new Array(y * 2);
+  $(L);
+  var R = new Array(P);
+  $(R);
+  var K = new Array(w - u + 1);
+  $(K);
+  var U = new Array(d);
+  $(U);
+  var m = new Array(y);
+  $(m);
+  function j(f, J, I, S, M) {
+    this.static_tree = f, this.extra_bits = J, this.extra_base = I, this.elems = S, this.max_length = M, this.has_stree = f && f.length;
+  }
+  var re, X, Y;
+  function le(f, J) {
+    this.dyn_tree = f, this.max_code = 0, this.stat_desc = J;
+  }
+  function oe(f) {
+    return f < 256 ? R[f] : R[256 + (f >>> 7)];
+  }
+  function ne(f, J) {
+    f.pending_buf[f.pending++] = J & 255, f.pending_buf[f.pending++] = J >>> 8 & 255;
+  }
+  function F(f, J, I) {
+    f.bi_valid > h - I ? (f.bi_buf |= J << f.bi_valid & 65535, ne(f, f.bi_buf), f.bi_buf = J >> h - f.bi_valid, f.bi_valid += I - h) : (f.bi_buf |= J << f.bi_valid & 65535, f.bi_valid += I);
+  }
+  function he(f, J, I) {
+    F(f, I[J * 2], I[J * 2 + 1]);
+  }
+  function ke(f, J) {
+    var I = 0;
+    do
+      I |= f & 1, f >>>= 1, I <<= 1;
+    while (--J > 0);
+    return I >>> 1;
+  }
+  function we(f) {
+    f.bi_valid === 16 ? (ne(f, f.bi_buf), f.bi_buf = 0, f.bi_valid = 0) : f.bi_valid >= 8 && (f.pending_buf[f.pending++] = f.bi_buf & 255, f.bi_buf >>= 8, f.bi_valid -= 8);
+  }
+  function ze(f, J) {
+    var I = J.dyn_tree, S = J.max_code, M = J.stat_desc.static_tree, a = J.stat_desc.has_stree, Z = J.stat_desc.extra_bits, e = J.stat_desc.extra_base, k = J.stat_desc.max_length, H, i, C, D, z, ie, fe = 0;
+    for (D = 0; D <= s; D++) f.bl_count[D] = 0;
+    for (I[f.heap[f.heap_max] * 2 + 1] = 0, H = f.heap_max + 1; H < b; H++)
+      i = f.heap[H], D = I[I[i * 2 + 1] * 2 + 1] + 1, D > k && (D = k, fe++), I[i * 2 + 1] = D, !(i > S) && (f.bl_count[D]++, z = 0, i >= e && (z = Z[i - e]), ie = I[i * 2], f.opt_len += ie * (D + z), a && (f.static_len += ie * (M[i * 2 + 1] + z)));
+    if (fe !== 0) {
+      do {
+        for (D = k - 1; f.bl_count[D] === 0; ) D--;
+        f.bl_count[D]--, f.bl_count[D + 1] += 2, f.bl_count[k]--, fe -= 2;
+      } while (fe > 0);
+      for (D = k; D !== 0; D--)
+        for (i = f.bl_count[D]; i !== 0; )
+          C = f.heap[--H], !(C > S) && (I[C * 2 + 1] !== D && (f.opt_len += (D - I[C * 2 + 1]) * I[C * 2], I[C * 2 + 1] = D), i--);
+    }
+  }
+  function pe(f, J, I) {
+    var S = new Array(s + 1), M = 0, a, Z;
+    for (a = 1; a <= s; a++) S[a] = M = M + I[a - 1] << 1;
+    for (Z = 0; Z <= J; Z++) {
+      var e = f[Z * 2 + 1];
+      e !== 0 && (f[Z * 2] = ke(S[e]++, e));
+    }
+  }
+  function ve() {
+    var f, J, I, S, M, a = new Array(s + 1);
+    for (I = 0, S = 0; S < d - 1; S++)
+      for (U[S] = I, f = 0; f < 1 << E[S]; f++) K[I++] = S;
+    for (K[I - 1] = S, M = 0, S = 0; S < 16; S++)
+      for (m[S] = M, f = 0; f < 1 << O[S]; f++) R[M++] = S;
+    for (M >>= 7; S < y; S++)
+      for (m[S] = M << 7, f = 0; f < 1 << O[S] - 7; f++) R[256 + M++] = S;
+    for (J = 0; J <= s; J++) a[J] = 0;
+    for (f = 0; f <= 143; )
+      G[f * 2 + 1] = 8, f++, a[8]++;
+    for (; f <= 255; )
+      G[f * 2 + 1] = 9, f++, a[9]++;
+    for (; f <= 279; )
+      G[f * 2 + 1] = 7, f++, a[7]++;
+    for (; f <= 287; )
+      G[f * 2 + 1] = 8, f++, a[8]++;
+    for (pe(G, v + 1, a), f = 0; f < y; f++)
+      L[f * 2 + 1] = 5, L[f * 2] = ke(f, 5);
+    re = new j(G, E, o + 1, v, s), X = new j(L, O, 0, y, s), Y = new j(new Array(0), N, 0, _, t);
+  }
+  function ye(f) {
+    var J;
+    for (J = 0; J < v; J++) f.dyn_ltree[J * 2] = 0;
+    for (J = 0; J < y; J++) f.dyn_dtree[J * 2] = 0;
+    for (J = 0; J < _; J++) f.bl_tree[J * 2] = 0;
+    f.dyn_ltree[c * 2] = 1, f.opt_len = f.static_len = 0, f.last_lit = f.matches = 0;
+  }
+  function xe(f) {
+    f.bi_valid > 8 ? ne(f, f.bi_buf) : f.bi_valid > 0 && (f.pending_buf[f.pending++] = f.bi_buf), f.bi_buf = 0, f.bi_valid = 0;
+  }
+  function be(f, J, I, S) {
+    xe(f), S && (ne(f, I), ne(f, ~I)), Q.arraySet(f.pending_buf, f.window, J, I, f.pending), f.pending += I;
+  }
+  function q(f, J, I, S) {
+    var M = J * 2, a = I * 2;
+    return f[M] < f[a] || f[M] === f[a] && S[J] <= S[I];
+  }
+  function ae(f, J, I) {
+    for (var S = f.heap[I], M = I << 1; M <= f.heap_len && (M < f.heap_len && q(J, f.heap[M + 1], f.heap[M], f.depth) && M++, !q(J, S, f.heap[M], f.depth)); )
+      f.heap[I] = f.heap[M], I = M, M <<= 1;
+    f.heap[I] = S;
+  }
+  function se(f, J, I) {
+    var S, M, a = 0, Z, e;
+    if (f.last_lit !== 0) do
+      S = f.pending_buf[f.d_buf + a * 2] << 8 | f.pending_buf[f.d_buf + a * 2 + 1], M = f.pending_buf[f.l_buf + a], a++, S === 0 ? he(f, M, J) : (Z = K[M], he(f, Z + o + 1, J), e = E[Z], e !== 0 && (M -= U[Z], F(f, M, e)), S--, Z = oe(S), he(f, Z, I), e = O[Z], e !== 0 && (S -= m[Z], F(f, S, e)));
+    while (a < f.last_lit);
+    he(f, c, J);
+  }
+  function de(f, J) {
+    var I = J.dyn_tree, S = J.stat_desc.static_tree, M = J.stat_desc.has_stree, a = J.stat_desc.elems, Z, e, k = -1, H;
+    for (f.heap_len = 0, f.heap_max = b, Z = 0; Z < a; Z++) I[Z * 2] !== 0 ? (f.heap[++f.heap_len] = k = Z, f.depth[Z] = 0) : I[Z * 2 + 1] = 0;
+    for (; f.heap_len < 2; )
+      H = f.heap[++f.heap_len] = k < 2 ? ++k : 0, I[H * 2] = 1, f.depth[H] = 0, f.opt_len--, M && (f.static_len -= S[H * 2 + 1]);
+    for (J.max_code = k, Z = f.heap_len >> 1; Z >= 1; Z--) ae(f, I, Z);
+    H = a;
+    do
+      Z = f.heap[1], f.heap[1] = f.heap[f.heap_len--], ae(f, I, 1), e = f.heap[1], f.heap[--f.heap_max] = Z, f.heap[--f.heap_max] = e, I[H * 2] = I[Z * 2] + I[e * 2], f.depth[H] = (f.depth[Z] >= f.depth[e] ? f.depth[Z] : f.depth[e]) + 1, I[Z * 2 + 1] = I[e * 2 + 1] = H, f.heap[1] = H++, ae(f, I, 1);
+    while (f.heap_len >= 2);
+    f.heap[--f.heap_max] = f.heap[1], ze(f, J), pe(I, k, f.bl_count);
+  }
+  function _e(f, J, I) {
+    var S, M = -1, a, Z = J[1], e = 0, k = 7, H = 4;
+    for (Z === 0 && (k = 138, H = 3), J[(I + 1) * 2 + 1] = 65535, S = 0; S <= I; S++)
+      a = Z, Z = J[(S + 1) * 2 + 1], !(++e < k && a === Z) && (e < H ? f.bl_tree[a * 2] += e : a !== 0 ? (a !== M && f.bl_tree[a * 2]++, f.bl_tree[g * 2]++) : e <= 10 ? f.bl_tree[x * 2]++ : f.bl_tree[B * 2]++, e = 0, M = a, Z === 0 ? (k = 138, H = 3) : a === Z ? (k = 6, H = 3) : (k = 7, H = 4));
+  }
+  function ce(f, J, I) {
+    var S, M = -1, a, Z = J[1], e = 0, k = 7, H = 4;
+    for (Z === 0 && (k = 138, H = 3), S = 0; S <= I; S++)
+      if (a = Z, Z = J[(S + 1) * 2 + 1], !(++e < k && a === Z)) {
+        if (e < H) do
+          he(f, a, f.bl_tree);
+        while (--e !== 0);
+        else a !== 0 ? (a !== M && (he(f, a, f.bl_tree), e--), he(f, g, f.bl_tree), F(f, e - 3, 2)) : e <= 10 ? (he(f, x, f.bl_tree), F(f, e - 3, 3)) : (he(f, B, f.bl_tree), F(f, e - 11, 7));
+        e = 0, M = a, Z === 0 ? (k = 138, H = 3) : a === Z ? (k = 6, H = 3) : (k = 7, H = 4);
+      }
+  }
+  function Re(f) {
+    var J;
+    for (_e(f, f.dyn_ltree, f.l_desc.max_code), _e(f, f.dyn_dtree, f.d_desc.max_code), de(f, f.bl_desc), J = _ - 1; J >= 3 && f.bl_tree[A[J] * 2 + 1] === 0; J--) ;
+    return f.opt_len += 3 * (J + 1) + 5 + 5 + 4, J;
+  }
+  function Ce(f, J, I, S) {
+    var M;
+    for (F(f, J - 257, 5), F(f, I - 1, 5), F(f, S - 4, 4), M = 0; M < S; M++) F(f, f.bl_tree[A[M] * 2 + 1], 3);
+    ce(f, f.dyn_ltree, J - 1), ce(f, f.dyn_dtree, I - 1);
+  }
+  function Ke(f) {
+    var J = 4093624447, I;
+    for (I = 0; I <= 31; I++, J >>>= 1) if (J & 1 && f.dyn_ltree[I * 2] !== 0) return te;
+    if (f.dyn_ltree[18] !== 0 || f.dyn_ltree[20] !== 0 || f.dyn_ltree[26] !== 0) return T;
+    for (I = 32; I < o; I++) if (f.dyn_ltree[I * 2] !== 0) return T;
+    return te;
+  }
+  var He = !1;
+  function Be(f) {
+    He || (ve(), He = !0), f.l_desc = new le(f.dyn_ltree, re), f.d_desc = new le(f.dyn_dtree, X), f.bl_desc = new le(f.bl_tree, Y), f.bi_buf = 0, f.bi_valid = 0, ye(f);
+  }
+  function Le(f, J, I, S) {
+    F(f, (n << 1) + (S ? 1 : 0), 3), be(f, J, I, !0);
+  }
+  function Ie(f) {
+    F(f, r << 1, 3), he(f, c, G), we(f);
+  }
+  function je(f, J, I, S) {
+    var M, a, Z = 0;
+    f.level > 0 ? (f.strm.data_type === p && (f.strm.data_type = Ke(f)), de(f, f.l_desc), de(f, f.d_desc), Z = Re(f), M = f.opt_len + 3 + 7 >>> 3, a = f.static_len + 3 + 7 >>> 3, a <= M && (M = a)) : M = a = I + 5, I + 4 <= M && J !== -1 ? Le(f, J, I, S) : f.strategy === ee || a === M ? (F(f, (r << 1) + (S ? 1 : 0), 3), se(f, G, L)) : (F(f, (l << 1) + (S ? 1 : 0), 3), Ce(f, f.l_desc.max_code + 1, f.d_desc.max_code + 1, Z + 1), se(f, f.dyn_ltree, f.dyn_dtree)), ye(f), S && xe(f);
+  }
+  function Je(f, J, I) {
+    return f.pending_buf[f.d_buf + f.last_lit * 2] = J >>> 8 & 255, f.pending_buf[f.d_buf + f.last_lit * 2 + 1] = J & 255, f.pending_buf[f.l_buf + f.last_lit] = I & 255, f.last_lit++, J === 0 ? f.dyn_ltree[I * 2]++ : (f.matches++, J--, f.dyn_ltree[(K[I] + o + 1) * 2]++, f.dyn_dtree[oe(J) * 2]++), f.last_lit === f.lit_bufsize - 1;
+  }
+  V._tr_init = Be, V._tr_stored_block = Le, V._tr_flush_block = je, V._tr_tally = Je, V._tr_align = Ie;
+})), Ve = /* @__PURE__ */ De(((V, Q) => {
+  function ee(te, T, p, $) {
+    for (var n = te & 65535 | 0, r = te >>> 16 & 65535 | 0, l = 0; p !== 0; ) {
+      l = p > 2e3 ? 2e3 : p, p -= l;
+      do
+        n = n + T[$++] | 0, r = r + n | 0;
+      while (--l);
+      n %= 65521, r %= 65521;
+    }
+    return n | r << 16 | 0;
+  }
+  Q.exports = ee;
+})), $e = /* @__PURE__ */ De(((V, Q) => {
+  function ee() {
+    for (var p, $ = [], n = 0; n < 256; n++) {
+      p = n;
+      for (var r = 0; r < 8; r++) p = p & 1 ? 3988292384 ^ p >>> 1 : p >>> 1;
+      $[n] = p;
+    }
+    return $;
+  }
+  var te = ee();
+  function T(p, $, n, r) {
+    var l = te, u = r + n;
+    p ^= -1;
+    for (var w = r; w < u; w++) p = p >>> 8 ^ l[(p ^ $[w]) & 255];
+    return p ^ -1;
+  }
+  Q.exports = T;
+})), Qe = /* @__PURE__ */ De(((V, Q) => {
+  Q.exports = {
+    2: "need dictionary",
+    1: "stream end",
+    0: "",
+    "-1": "file error",
+    "-2": "stream error",
+    "-3": "data error",
+    "-4": "insufficient memory",
+    "-5": "buffer error",
+    "-6": "incompatible version"
+  };
+})), i0 = /* @__PURE__ */ De(((V) => {
+  var Q = me(), ee = r0(), te = Ve(), T = $e(), p = Qe(), $ = 0, n = 1, r = 3, l = 4, u = 5, w = 0, d = 1, o = -2, v = -3, y = -5, _ = -1, b = 1, s = 2, h = 3, t = 4, c = 0, g = 2, x = 8, B = 9, E = 15, O = 8, N = 286, A = 30, P = 19, G = 2 * N + 1, L = 15, R = 3, K = 258, U = K + R + 1, m = 32, j = 42, re = 69, X = 73, Y = 91, le = 103, oe = 113, ne = 666, F = 1, he = 2, ke = 3, we = 4, ze = 3;
+  function pe(e, k) {
+    return e.msg = p[k], k;
+  }
+  function ve(e) {
+    return (e << 1) - (e > 4 ? 9 : 0);
+  }
+  function ye(e) {
+    for (var k = e.length; --k >= 0; ) e[k] = 0;
+  }
+  function xe(e) {
+    var k = e.state, H = k.pending;
+    H > e.avail_out && (H = e.avail_out), H !== 0 && (Q.arraySet(e.output, k.pending_buf, k.pending_out, H, e.next_out), e.next_out += H, k.pending_out += H, e.total_out += H, e.avail_out -= H, k.pending -= H, k.pending === 0 && (k.pending_out = 0));
+  }
+  function be(e, k) {
+    ee._tr_flush_block(e, e.block_start >= 0 ? e.block_start : -1, e.strstart - e.block_start, k), e.block_start = e.strstart, xe(e.strm);
+  }
+  function q(e, k) {
+    e.pending_buf[e.pending++] = k;
+  }
+  function ae(e, k) {
+    e.pending_buf[e.pending++] = k >>> 8 & 255, e.pending_buf[e.pending++] = k & 255;
+  }
+  function se(e, k, H, i) {
+    var C = e.avail_in;
+    return C > i && (C = i), C === 0 ? 0 : (e.avail_in -= C, Q.arraySet(k, e.input, e.next_in, C, H), e.state.wrap === 1 ? e.adler = te(e.adler, k, C, H) : e.state.wrap === 2 && (e.adler = T(e.adler, k, C, H)), e.next_in += C, e.total_in += C, C);
+  }
+  function de(e, k) {
+    var H = e.max_chain_length, i = e.strstart, C, D, z = e.prev_length, ie = e.nice_match, fe = e.strstart > e.w_size - U ? e.strstart - (e.w_size - U) : 0, W = e.window, Ze = e.w_mask, Ye = e.prev, ge = e.strstart + K, ue = W[i + z - 1], Se = W[i + z];
+    e.prev_length >= e.good_match && (H >>= 2), ie > e.lookahead && (ie = e.lookahead);
+    do
+      if (C = k, !(W[C + z] !== Se || W[C + z - 1] !== ue || W[C] !== W[i] || W[++C] !== W[i + 1])) {
+        i += 2, C++;
+        do
+          ;
+        while (W[++i] === W[++C] && W[++i] === W[++C] && W[++i] === W[++C] && W[++i] === W[++C] && W[++i] === W[++C] && W[++i] === W[++C] && W[++i] === W[++C] && W[++i] === W[++C] && i < ge);
+        if (D = K - (ge - i), i = ge - K, D > z) {
+          if (e.match_start = k, z = D, D >= ie) break;
+          ue = W[i + z - 1], Se = W[i + z];
+        }
+      }
+    while ((k = Ye[k & Ze]) > fe && --H !== 0);
+    return z <= e.lookahead ? z : e.lookahead;
+  }
+  function _e(e) {
+    var k = e.w_size, H, i, C, D, z;
+    do {
+      if (D = e.window_size - e.lookahead - e.strstart, e.strstart >= k + (k - U)) {
+        Q.arraySet(e.window, e.window, k, k, 0), e.match_start -= k, e.strstart -= k, e.block_start -= k, i = e.hash_size, H = i;
+        do
+          C = e.head[--H], e.head[H] = C >= k ? C - k : 0;
+        while (--i);
+        i = k, H = i;
+        do
+          C = e.prev[--H], e.prev[H] = C >= k ? C - k : 0;
+        while (--i);
+        D += k;
+      }
+      if (e.strm.avail_in === 0) break;
+      if (i = se(e.strm, e.window, e.strstart + e.lookahead, D), e.lookahead += i, e.lookahead + e.insert >= R)
+        for (z = e.strstart - e.insert, e.ins_h = e.window[z], e.ins_h = (e.ins_h << e.hash_shift ^ e.window[z + 1]) & e.hash_mask; e.insert && (e.ins_h = (e.ins_h << e.hash_shift ^ e.window[z + R - 1]) & e.hash_mask, e.prev[z & e.w_mask] = e.head[e.ins_h], e.head[e.ins_h] = z, z++, e.insert--, !(e.lookahead + e.insert < R)); )
+          ;
+    } while (e.lookahead < U && e.strm.avail_in !== 0);
+  }
+  function ce(e, k) {
+    var H = 65535;
+    for (H > e.pending_buf_size - 5 && (H = e.pending_buf_size - 5); ; ) {
+      if (e.lookahead <= 1) {
+        if (_e(e), e.lookahead === 0 && k === $) return F;
+        if (e.lookahead === 0) break;
+      }
+      e.strstart += e.lookahead, e.lookahead = 0;
+      var i = e.block_start + H;
+      if ((e.strstart === 0 || e.strstart >= i) && (e.lookahead = e.strstart - i, e.strstart = i, be(e, !1), e.strm.avail_out === 0) || e.strstart - e.block_start >= e.w_size - U && (be(e, !1), e.strm.avail_out === 0))
+        return F;
+    }
+    return e.insert = 0, k === l ? (be(e, !0), e.strm.avail_out === 0 ? ke : we) : (e.strstart > e.block_start && (be(e, !1), e.strm.avail_out === 0), F);
+  }
+  function Re(e, k) {
+    for (var H, i; ; ) {
+      if (e.lookahead < U) {
+        if (_e(e), e.lookahead < U && k === $) return F;
+        if (e.lookahead === 0) break;
+      }
+      if (H = 0, e.lookahead >= R && (e.ins_h = (e.ins_h << e.hash_shift ^ e.window[e.strstart + R - 1]) & e.hash_mask, H = e.prev[e.strstart & e.w_mask] = e.head[e.ins_h], e.head[e.ins_h] = e.strstart), H !== 0 && e.strstart - H <= e.w_size - U && (e.match_length = de(e, H)), e.match_length >= R)
+        if (i = ee._tr_tally(e, e.strstart - e.match_start, e.match_length - R), e.lookahead -= e.match_length, e.match_length <= e.max_lazy_match && e.lookahead >= R) {
+          e.match_length--;
+          do
+            e.strstart++, e.ins_h = (e.ins_h << e.hash_shift ^ e.window[e.strstart + R - 1]) & e.hash_mask, H = e.prev[e.strstart & e.w_mask] = e.head[e.ins_h], e.head[e.ins_h] = e.strstart;
+          while (--e.match_length !== 0);
+          e.strstart++;
+        } else
+          e.strstart += e.match_length, e.match_length = 0, e.ins_h = e.window[e.strstart], e.ins_h = (e.ins_h << e.hash_shift ^ e.window[e.strstart + 1]) & e.hash_mask;
+      else
+        i = ee._tr_tally(e, 0, e.window[e.strstart]), e.lookahead--, e.strstart++;
+      if (i && (be(e, !1), e.strm.avail_out === 0))
+        return F;
+    }
+    return e.insert = e.strstart < R - 1 ? e.strstart : R - 1, k === l ? (be(e, !0), e.strm.avail_out === 0 ? ke : we) : e.last_lit && (be(e, !1), e.strm.avail_out === 0) ? F : he;
+  }
+  function Ce(e, k) {
+    for (var H, i, C; ; ) {
+      if (e.lookahead < U) {
+        if (_e(e), e.lookahead < U && k === $) return F;
+        if (e.lookahead === 0) break;
+      }
+      if (H = 0, e.lookahead >= R && (e.ins_h = (e.ins_h << e.hash_shift ^ e.window[e.strstart + R - 1]) & e.hash_mask, H = e.prev[e.strstart & e.w_mask] = e.head[e.ins_h], e.head[e.ins_h] = e.strstart), e.prev_length = e.match_length, e.prev_match = e.match_start, e.match_length = R - 1, H !== 0 && e.prev_length < e.max_lazy_match && e.strstart - H <= e.w_size - U && (e.match_length = de(e, H), e.match_length <= 5 && (e.strategy === b || e.match_length === R && e.strstart - e.match_start > 4096) && (e.match_length = R - 1)), e.prev_length >= R && e.match_length <= e.prev_length) {
+        C = e.strstart + e.lookahead - R, i = ee._tr_tally(e, e.strstart - 1 - e.prev_match, e.prev_length - R), e.lookahead -= e.prev_length - 1, e.prev_length -= 2;
+        do
+          ++e.strstart <= C && (e.ins_h = (e.ins_h << e.hash_shift ^ e.window[e.strstart + R - 1]) & e.hash_mask, H = e.prev[e.strstart & e.w_mask] = e.head[e.ins_h], e.head[e.ins_h] = e.strstart);
+        while (--e.prev_length !== 0);
+        if (e.match_available = 0, e.match_length = R - 1, e.strstart++, i && (be(e, !1), e.strm.avail_out === 0))
+          return F;
+      } else if (e.match_available) {
+        if (i = ee._tr_tally(e, 0, e.window[e.strstart - 1]), i && be(e, !1), e.strstart++, e.lookahead--, e.strm.avail_out === 0) return F;
+      } else
+        e.match_available = 1, e.strstart++, e.lookahead--;
+    }
+    return e.match_available && (i = ee._tr_tally(e, 0, e.window[e.strstart - 1]), e.match_available = 0), e.insert = e.strstart < R - 1 ? e.strstart : R - 1, k === l ? (be(e, !0), e.strm.avail_out === 0 ? ke : we) : e.last_lit && (be(e, !1), e.strm.avail_out === 0) ? F : he;
+  }
+  function Ke(e, k) {
+    for (var H, i, C, D, z = e.window; ; ) {
+      if (e.lookahead <= K) {
+        if (_e(e), e.lookahead <= K && k === $) return F;
+        if (e.lookahead === 0) break;
+      }
+      if (e.match_length = 0, e.lookahead >= R && e.strstart > 0 && (C = e.strstart - 1, i = z[C], i === z[++C] && i === z[++C] && i === z[++C])) {
+        D = e.strstart + K;
+        do
+          ;
+        while (i === z[++C] && i === z[++C] && i === z[++C] && i === z[++C] && i === z[++C] && i === z[++C] && i === z[++C] && i === z[++C] && C < D);
+        e.match_length = K - (D - C), e.match_length > e.lookahead && (e.match_length = e.lookahead);
+      }
+      if (e.match_length >= R ? (H = ee._tr_tally(e, 1, e.match_length - R), e.lookahead -= e.match_length, e.strstart += e.match_length, e.match_length = 0) : (H = ee._tr_tally(e, 0, e.window[e.strstart]), e.lookahead--, e.strstart++), H && (be(e, !1), e.strm.avail_out === 0))
+        return F;
+    }
+    return e.insert = 0, k === l ? (be(e, !0), e.strm.avail_out === 0 ? ke : we) : e.last_lit && (be(e, !1), e.strm.avail_out === 0) ? F : he;
+  }
+  function He(e, k) {
+    for (var H; ; ) {
+      if (e.lookahead === 0 && (_e(e), e.lookahead === 0)) {
+        if (k === $) return F;
+        break;
+      }
+      if (e.match_length = 0, H = ee._tr_tally(e, 0, e.window[e.strstart]), e.lookahead--, e.strstart++, H && (be(e, !1), e.strm.avail_out === 0))
+        return F;
+    }
+    return e.insert = 0, k === l ? (be(e, !0), e.strm.avail_out === 0 ? ke : we) : e.last_lit && (be(e, !1), e.strm.avail_out === 0) ? F : he;
+  }
+  function Be(e, k, H, i, C) {
+    this.good_length = e, this.max_lazy = k, this.nice_length = H, this.max_chain = i, this.func = C;
+  }
+  var Le = [
+    new Be(0, 0, 0, 0, ce),
+    new Be(4, 4, 8, 4, Re),
+    new Be(4, 5, 16, 8, Re),
+    new Be(4, 6, 32, 32, Re),
+    new Be(4, 4, 16, 16, Ce),
+    new Be(8, 16, 32, 32, Ce),
+    new Be(8, 16, 128, 128, Ce),
+    new Be(8, 32, 128, 256, Ce),
+    new Be(32, 128, 258, 1024, Ce),
+    new Be(32, 258, 258, 4096, Ce)
+  ];
+  function Ie(e) {
+    e.window_size = 2 * e.w_size, ye(e.head), e.max_lazy_match = Le[e.level].max_lazy, e.good_match = Le[e.level].good_length, e.nice_match = Le[e.level].nice_length, e.max_chain_length = Le[e.level].max_chain, e.strstart = 0, e.block_start = 0, e.lookahead = 0, e.insert = 0, e.match_length = e.prev_length = R - 1, e.match_available = 0, e.ins_h = 0;
+  }
+  function je() {
+    this.strm = null, this.status = 0, this.pending_buf = null, this.pending_buf_size = 0, this.pending_out = 0, this.pending = 0, this.wrap = 0, this.gzhead = null, this.gzindex = 0, this.method = x, this.last_flush = -1, this.w_size = 0, this.w_bits = 0, this.w_mask = 0, this.window = null, this.window_size = 0, this.prev = null, this.head = null, this.ins_h = 0, this.hash_size = 0, this.hash_bits = 0, this.hash_mask = 0, this.hash_shift = 0, this.block_start = 0, this.match_length = 0, this.prev_match = 0, this.match_available = 0, this.strstart = 0, this.match_start = 0, this.lookahead = 0, this.prev_length = 0, this.max_chain_length = 0, this.max_lazy_match = 0, this.level = 0, this.strategy = 0, this.good_match = 0, this.nice_match = 0, this.dyn_ltree = new Q.Buf16(G * 2), this.dyn_dtree = new Q.Buf16((2 * A + 1) * 2), this.bl_tree = new Q.Buf16((2 * P + 1) * 2), ye(this.dyn_ltree), ye(this.dyn_dtree), ye(this.bl_tree), this.l_desc = null, this.d_desc = null, this.bl_desc = null, this.bl_count = new Q.Buf16(L + 1), this.heap = new Q.Buf16(2 * N + 1), ye(this.heap), this.heap_len = 0, this.heap_max = 0, this.depth = new Q.Buf16(2 * N + 1), ye(this.depth), this.l_buf = 0, this.lit_bufsize = 0, this.last_lit = 0, this.d_buf = 0, this.opt_len = 0, this.static_len = 0, this.matches = 0, this.insert = 0, this.bi_buf = 0, this.bi_valid = 0;
+  }
+  function Je(e) {
+    var k;
+    return !e || !e.state ? pe(e, o) : (e.total_in = e.total_out = 0, e.data_type = g, k = e.state, k.pending = 0, k.pending_out = 0, k.wrap < 0 && (k.wrap = -k.wrap), k.status = k.wrap ? j : oe, e.adler = k.wrap === 2 ? 0 : 1, k.last_flush = $, ee._tr_init(k), w);
+  }
+  function f(e) {
+    var k = Je(e);
+    return k === w && Ie(e.state), k;
+  }
+  function J(e, k) {
+    return !e || !e.state || e.state.wrap !== 2 ? o : (e.state.gzhead = k, w);
+  }
+  function I(e, k, H, i, C, D) {
+    if (!e) return o;
+    var z = 1;
+    if (k === _ && (k = 6), i < 0 ? (z = 0, i = -i) : i > 15 && (z = 2, i -= 16), C < 1 || C > B || H !== x || i < 8 || i > 15 || k < 0 || k > 9 || D < 0 || D > t) return pe(e, o);
+    i === 8 && (i = 9);
+    var ie = new je();
+    return e.state = ie, ie.strm = e, ie.wrap = z, ie.gzhead = null, ie.w_bits = i, ie.w_size = 1 << ie.w_bits, ie.w_mask = ie.w_size - 1, ie.hash_bits = C + 7, ie.hash_size = 1 << ie.hash_bits, ie.hash_mask = ie.hash_size - 1, ie.hash_shift = ~~((ie.hash_bits + R - 1) / R), ie.window = new Q.Buf8(ie.w_size * 2), ie.head = new Q.Buf16(ie.hash_size), ie.prev = new Q.Buf16(ie.w_size), ie.lit_bufsize = 1 << C + 6, ie.pending_buf_size = ie.lit_bufsize * 4, ie.pending_buf = new Q.Buf8(ie.pending_buf_size), ie.d_buf = 1 * ie.lit_bufsize, ie.l_buf = 3 * ie.lit_bufsize, ie.level = k, ie.strategy = D, ie.method = H, f(e);
+  }
+  function S(e, k) {
+    return I(e, k, x, E, O, c);
+  }
+  function M(e, k) {
+    var H, i, C, D;
+    if (!e || !e.state || k > u || k < 0) return e ? pe(e, o) : o;
+    if (i = e.state, !e.output || !e.input && e.avail_in !== 0 || i.status === ne && k !== l) return pe(e, e.avail_out === 0 ? y : o);
+    if (i.strm = e, H = i.last_flush, i.last_flush = k, i.status === j)
+      if (i.wrap === 2)
+        e.adler = 0, q(i, 31), q(i, 139), q(i, 8), i.gzhead ? (q(i, (i.gzhead.text ? 1 : 0) + (i.gzhead.hcrc ? 2 : 0) + (i.gzhead.extra ? 4 : 0) + (i.gzhead.name ? 8 : 0) + (i.gzhead.comment ? 16 : 0)), q(i, i.gzhead.time & 255), q(i, i.gzhead.time >> 8 & 255), q(i, i.gzhead.time >> 16 & 255), q(i, i.gzhead.time >> 24 & 255), q(i, i.level === 9 ? 2 : i.strategy >= s || i.level < 2 ? 4 : 0), q(i, i.gzhead.os & 255), i.gzhead.extra && i.gzhead.extra.length && (q(i, i.gzhead.extra.length & 255), q(i, i.gzhead.extra.length >> 8 & 255)), i.gzhead.hcrc && (e.adler = T(e.adler, i.pending_buf, i.pending, 0)), i.gzindex = 0, i.status = re) : (q(i, 0), q(i, 0), q(i, 0), q(i, 0), q(i, 0), q(i, i.level === 9 ? 2 : i.strategy >= s || i.level < 2 ? 4 : 0), q(i, ze), i.status = oe);
+      else {
+        var z = x + (i.w_bits - 8 << 4) << 8, ie = -1;
+        i.strategy >= s || i.level < 2 ? ie = 0 : i.level < 6 ? ie = 1 : i.level === 6 ? ie = 2 : ie = 3, z |= ie << 6, i.strstart !== 0 && (z |= m), z += 31 - z % 31, i.status = oe, ae(i, z), i.strstart !== 0 && (ae(i, e.adler >>> 16), ae(i, e.adler & 65535)), e.adler = 1;
+      }
+    if (i.status === re)
+      if (i.gzhead.extra) {
+        for (C = i.pending; i.gzindex < (i.gzhead.extra.length & 65535) && !(i.pending === i.pending_buf_size && (i.gzhead.hcrc && i.pending > C && (e.adler = T(e.adler, i.pending_buf, i.pending - C, C)), xe(e), C = i.pending, i.pending === i.pending_buf_size)); )
+          q(i, i.gzhead.extra[i.gzindex] & 255), i.gzindex++;
+        i.gzhead.hcrc && i.pending > C && (e.adler = T(e.adler, i.pending_buf, i.pending - C, C)), i.gzindex === i.gzhead.extra.length && (i.gzindex = 0, i.status = X);
+      } else i.status = X;
+    if (i.status === X)
+      if (i.gzhead.name) {
+        C = i.pending;
+        do {
+          if (i.pending === i.pending_buf_size && (i.gzhead.hcrc && i.pending > C && (e.adler = T(e.adler, i.pending_buf, i.pending - C, C)), xe(e), C = i.pending, i.pending === i.pending_buf_size)) {
+            D = 1;
+            break;
+          }
+          i.gzindex < i.gzhead.name.length ? D = i.gzhead.name.charCodeAt(i.gzindex++) & 255 : D = 0, q(i, D);
+        } while (D !== 0);
+        i.gzhead.hcrc && i.pending > C && (e.adler = T(e.adler, i.pending_buf, i.pending - C, C)), D === 0 && (i.gzindex = 0, i.status = Y);
+      } else i.status = Y;
+    if (i.status === Y)
+      if (i.gzhead.comment) {
+        C = i.pending;
+        do {
+          if (i.pending === i.pending_buf_size && (i.gzhead.hcrc && i.pending > C && (e.adler = T(e.adler, i.pending_buf, i.pending - C, C)), xe(e), C = i.pending, i.pending === i.pending_buf_size)) {
+            D = 1;
+            break;
+          }
+          i.gzindex < i.gzhead.comment.length ? D = i.gzhead.comment.charCodeAt(i.gzindex++) & 255 : D = 0, q(i, D);
+        } while (D !== 0);
+        i.gzhead.hcrc && i.pending > C && (e.adler = T(e.adler, i.pending_buf, i.pending - C, C)), D === 0 && (i.status = le);
+      } else i.status = le;
+    if (i.status === le && (i.gzhead.hcrc ? (i.pending + 2 > i.pending_buf_size && xe(e), i.pending + 2 <= i.pending_buf_size && (q(i, e.adler & 255), q(i, e.adler >> 8 & 255), e.adler = 0, i.status = oe)) : i.status = oe), i.pending !== 0) {
+      if (xe(e), e.avail_out === 0)
+        return i.last_flush = -1, w;
+    } else if (e.avail_in === 0 && ve(k) <= ve(H) && k !== l) return pe(e, y);
+    if (i.status === ne && e.avail_in !== 0) return pe(e, y);
+    if (e.avail_in !== 0 || i.lookahead !== 0 || k !== $ && i.status !== ne) {
+      var fe = i.strategy === s ? He(i, k) : i.strategy === h ? Ke(i, k) : Le[i.level].func(i, k);
+      if ((fe === ke || fe === we) && (i.status = ne), fe === F || fe === ke)
+        return e.avail_out === 0 && (i.last_flush = -1), w;
+      if (fe === he && (k === n ? ee._tr_align(i) : k !== u && (ee._tr_stored_block(i, 0, 0, !1), k === r && (ye(i.head), i.lookahead === 0 && (i.strstart = 0, i.block_start = 0, i.insert = 0))), xe(e), e.avail_out === 0))
+        return i.last_flush = -1, w;
+    }
+    return k !== l ? w : i.wrap <= 0 ? d : (i.wrap === 2 ? (q(i, e.adler & 255), q(i, e.adler >> 8 & 255), q(i, e.adler >> 16 & 255), q(i, e.adler >> 24 & 255), q(i, e.total_in & 255), q(i, e.total_in >> 8 & 255), q(i, e.total_in >> 16 & 255), q(i, e.total_in >> 24 & 255)) : (ae(i, e.adler >>> 16), ae(i, e.adler & 65535)), xe(e), i.wrap > 0 && (i.wrap = -i.wrap), i.pending !== 0 ? w : d);
+  }
+  function a(e) {
+    var k;
+    return !e || !e.state ? o : (k = e.state.status, k !== j && k !== re && k !== X && k !== Y && k !== le && k !== oe && k !== ne ? pe(e, o) : (e.state = null, k === oe ? pe(e, v) : w));
+  }
+  function Z(e, k) {
+    var H = k.length, i, C, D, z, ie, fe, W, Ze;
+    if (!e || !e.state || (i = e.state, z = i.wrap, z === 2 || z === 1 && i.status !== j || i.lookahead)) return o;
+    for (z === 1 && (e.adler = te(e.adler, k, H, 0)), i.wrap = 0, H >= i.w_size && (z === 0 && (ye(i.head), i.strstart = 0, i.block_start = 0, i.insert = 0), Ze = new Q.Buf8(i.w_size), Q.arraySet(Ze, k, H - i.w_size, i.w_size, 0), k = Ze, H = i.w_size), ie = e.avail_in, fe = e.next_in, W = e.input, e.avail_in = H, e.next_in = 0, e.input = k, _e(i); i.lookahead >= R; ) {
+      C = i.strstart, D = i.lookahead - (R - 1);
+      do
+        i.ins_h = (i.ins_h << i.hash_shift ^ i.window[C + R - 1]) & i.hash_mask, i.prev[C & i.w_mask] = i.head[i.ins_h], i.head[i.ins_h] = C, C++;
+      while (--D);
+      i.strstart = C, i.lookahead = R - 1, _e(i);
+    }
+    return i.strstart += i.lookahead, i.block_start = i.strstart, i.insert = i.lookahead, i.lookahead = 0, i.match_length = i.prev_length = R - 1, i.match_available = 0, e.next_in = fe, e.input = W, e.avail_in = ie, i.wrap = z, w;
+  }
+  V.deflateInit = S, V.deflateInit2 = I, V.deflateReset = f, V.deflateResetKeep = Je, V.deflateSetHeader = J, V.deflate = M, V.deflateEnd = a, V.deflateSetDictionary = Z, V.deflateInfo = "pako deflate (from Nodeca project)";
+})), Ue = /* @__PURE__ */ De(((V) => {
+  var Q = me(), ee = !0, te = !0;
+  try {
+    String.fromCharCode.apply(null, [0]);
+  } catch {
+    ee = !1;
+  }
+  try {
+    String.fromCharCode.apply(null, /* @__PURE__ */ new Uint8Array(1));
+  } catch {
+    te = !1;
+  }
+  for (var T = new Q.Buf8(256), p = 0; p < 256; p++) T[p] = p >= 252 ? 6 : p >= 248 ? 5 : p >= 240 ? 4 : p >= 224 ? 3 : p >= 192 ? 2 : 1;
+  T[254] = T[254] = 1, V.string2buf = function(n) {
+    var r, l, u, w, d, o = n.length, v = 0;
+    for (w = 0; w < o; w++)
+      l = n.charCodeAt(w), (l & 64512) === 55296 && w + 1 < o && (u = n.charCodeAt(w + 1), (u & 64512) === 56320 && (l = 65536 + (l - 55296 << 10) + (u - 56320), w++)), v += l < 128 ? 1 : l < 2048 ? 2 : l < 65536 ? 3 : 4;
+    for (r = new Q.Buf8(v), d = 0, w = 0; d < v; w++)
+      l = n.charCodeAt(w), (l & 64512) === 55296 && w + 1 < o && (u = n.charCodeAt(w + 1), (u & 64512) === 56320 && (l = 65536 + (l - 55296 << 10) + (u - 56320), w++)), l < 128 ? r[d++] = l : l < 2048 ? (r[d++] = 192 | l >>> 6, r[d++] = 128 | l & 63) : l < 65536 ? (r[d++] = 224 | l >>> 12, r[d++] = 128 | l >>> 6 & 63, r[d++] = 128 | l & 63) : (r[d++] = 240 | l >>> 18, r[d++] = 128 | l >>> 12 & 63, r[d++] = 128 | l >>> 6 & 63, r[d++] = 128 | l & 63);
+    return r;
+  };
+  function $(n, r) {
+    if (r < 65534 && (n.subarray && te || !n.subarray && ee))
+      return String.fromCharCode.apply(null, Q.shrinkBuf(n, r));
+    for (var l = "", u = 0; u < r; u++) l += String.fromCharCode(n[u]);
+    return l;
+  }
+  V.buf2binstring = function(n) {
+    return $(n, n.length);
+  }, V.binstring2buf = function(n) {
+    for (var r = new Q.Buf8(n.length), l = 0, u = r.length; l < u; l++) r[l] = n.charCodeAt(l);
+    return r;
+  }, V.buf2string = function(n, r) {
+    var l, u, w, d, o = r || n.length, v = new Array(o * 2);
+    for (u = 0, l = 0; l < o; ) {
+      if (w = n[l++], w < 128) {
+        v[u++] = w;
+        continue;
+      }
+      if (d = T[w], d > 4) {
+        v[u++] = 65533, l += d - 1;
+        continue;
+      }
+      for (w &= d === 2 ? 31 : d === 3 ? 15 : 7; d > 1 && l < o; )
+        w = w << 6 | n[l++] & 63, d--;
+      if (d > 1) {
+        v[u++] = 65533;
+        continue;
+      }
+      w < 65536 ? v[u++] = w : (w -= 65536, v[u++] = 55296 | w >> 10 & 1023, v[u++] = 56320 | w & 1023);
+    }
+    return $(v, u);
+  }, V.utf8border = function(n, r) {
+    var l;
+    for (r = r || n.length, r > n.length && (r = n.length), l = r - 1; l >= 0 && (n[l] & 192) === 128; ) l--;
+    return l < 0 || l === 0 ? r : l + T[n[l]] > r ? l : r;
+  };
+})), qe = /* @__PURE__ */ De(((V, Q) => {
+  function ee() {
+    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;
+  }
+  Q.exports = ee;
+})), a0 = /* @__PURE__ */ De(((V) => {
+  var Q = i0(), ee = me(), te = Ue(), T = Qe(), p = qe(), $ = Object.prototype.toString, n = 0, r = 4, l = 0, u = 1, w = 2, d = -1, o = 0, v = 8;
+  function y(h) {
+    if (!(this instanceof y)) return new y(h);
+    this.options = ee.assign({
+      level: d,
+      method: v,
+      chunkSize: 16384,
+      windowBits: 15,
+      memLevel: 8,
+      strategy: o,
+      to: ""
+    }, h || {});
+    var t = this.options;
+    t.raw && t.windowBits > 0 ? t.windowBits = -t.windowBits : t.gzip && t.windowBits > 0 && t.windowBits < 16 && (t.windowBits += 16), this.err = 0, this.msg = "", this.ended = !1, this.chunks = [], this.strm = new p(), this.strm.avail_out = 0;
+    var c = Q.deflateInit2(this.strm, t.level, t.method, t.windowBits, t.memLevel, t.strategy);
+    if (c !== l) throw new Error(T[c]);
+    if (t.header && Q.deflateSetHeader(this.strm, t.header), t.dictionary) {
+      var g;
+      if (typeof t.dictionary == "string" ? g = te.string2buf(t.dictionary) : $.call(t.dictionary) === "[object ArrayBuffer]" ? g = new Uint8Array(t.dictionary) : g = t.dictionary, c = Q.deflateSetDictionary(this.strm, g), c !== l) throw new Error(T[c]);
+      this._dict_set = !0;
+    }
+  }
+  y.prototype.push = function(h, t) {
+    var c = this.strm, g = this.options.chunkSize, x, B;
+    if (this.ended) return !1;
+    B = t === ~~t ? t : t === !0 ? r : n, typeof h == "string" ? c.input = te.string2buf(h) : $.call(h) === "[object ArrayBuffer]" ? c.input = new Uint8Array(h) : c.input = h, c.next_in = 0, c.avail_in = c.input.length;
+    do {
+      if (c.avail_out === 0 && (c.output = new ee.Buf8(g), c.next_out = 0, c.avail_out = g), x = Q.deflate(c, B), x !== u && x !== l)
+        return this.onEnd(x), this.ended = !0, !1;
+      (c.avail_out === 0 || c.avail_in === 0 && (B === r || B === w)) && (this.options.to === "string" ? this.onData(te.buf2binstring(ee.shrinkBuf(c.output, c.next_out))) : this.onData(ee.shrinkBuf(c.output, c.next_out)));
+    } while ((c.avail_in > 0 || c.avail_out === 0) && x !== u);
+    return B === r ? (x = Q.deflateEnd(this.strm), this.onEnd(x), this.ended = !0, x === l) : (B === w && (this.onEnd(l), c.avail_out = 0), !0);
+  }, y.prototype.onData = function(h) {
+    this.chunks.push(h);
+  }, y.prototype.onEnd = function(h) {
+    h === l && (this.options.to === "string" ? this.result = this.chunks.join("") : this.result = ee.flattenChunks(this.chunks)), this.chunks = [], this.err = h, this.msg = this.strm.msg;
+  };
+  function _(h, t) {
+    var c = new y(t);
+    if (c.push(h, !0), c.err) throw c.msg || T[c.err];
+    return c.result;
+  }
+  function b(h, t) {
+    return t = t || {}, t.raw = !0, _(h, t);
+  }
+  function s(h, t) {
+    return t = t || {}, t.gzip = !0, _(h, t);
+  }
+  V.Deflate = y, V.deflate = _, V.deflateRaw = b, V.gzip = s;
+})), t0 = /* @__PURE__ */ De(((V, Q) => {
+  var ee = 30, te = 12;
+  Q.exports = function(p, $) {
+    var n, r, l, u, w, d, o, v, y, _, b, s, h, t, c, g, x, B, E, O, N, A, P, G, L;
+    n = p.state, r = p.next_in, G = p.input, l = r + (p.avail_in - 5), u = p.next_out, L = p.output, w = u - ($ - p.avail_out), d = u + (p.avail_out - 257), o = n.dmax, v = n.wsize, y = n.whave, _ = n.wnext, b = n.window, s = n.hold, h = n.bits, t = n.lencode, c = n.distcode, g = (1 << n.lenbits) - 1, x = (1 << n.distbits) - 1;
+    e: do {
+      h < 15 && (s += G[r++] << h, h += 8, s += G[r++] << h, h += 8), B = t[s & g];
+      r: for (; ; ) {
+        if (E = B >>> 24, s >>>= E, h -= E, E = B >>> 16 & 255, E === 0) L[u++] = B & 65535;
+        else if (E & 16) {
+          O = B & 65535, E &= 15, E && (h < E && (s += G[r++] << h, h += 8), O += s & (1 << E) - 1, s >>>= E, h -= E), h < 15 && (s += G[r++] << h, h += 8, s += G[r++] << h, h += 8), B = c[s & x];
+          i: for (; ; ) {
+            if (E = B >>> 24, s >>>= E, h -= E, E = B >>> 16 & 255, E & 16) {
+              if (N = B & 65535, E &= 15, h < E && (s += G[r++] << h, h += 8, h < E && (s += G[r++] << h, h += 8)), N += s & (1 << E) - 1, N > o) {
+                p.msg = "invalid distance too far back", n.mode = ee;
+                break e;
+              }
+              if (s >>>= E, h -= E, E = u - w, N > E) {
+                if (E = N - E, E > y && n.sane) {
+                  p.msg = "invalid distance too far back", n.mode = ee;
+                  break e;
+                }
+                if (A = 0, P = b, _ === 0) {
+                  if (A += v - E, E < O) {
+                    O -= E;
+                    do
+                      L[u++] = b[A++];
+                    while (--E);
+                    A = u - N, P = L;
+                  }
+                } else if (_ < E) {
+                  if (A += v + _ - E, E -= _, E < O) {
+                    O -= E;
+                    do
+                      L[u++] = b[A++];
+                    while (--E);
+                    if (A = 0, _ < O) {
+                      E = _, O -= E;
+                      do
+                        L[u++] = b[A++];
+                      while (--E);
+                      A = u - N, P = L;
+                    }
+                  }
+                } else if (A += _ - E, E < O) {
+                  O -= E;
+                  do
+                    L[u++] = b[A++];
+                  while (--E);
+                  A = u - N, P = L;
+                }
+                for (; O > 2; )
+                  L[u++] = P[A++], L[u++] = P[A++], L[u++] = P[A++], O -= 3;
+                O && (L[u++] = P[A++], O > 1 && (L[u++] = P[A++]));
+              } else {
+                A = u - N;
+                do
+                  L[u++] = L[A++], L[u++] = L[A++], L[u++] = L[A++], O -= 3;
+                while (O > 2);
+                O && (L[u++] = L[A++], O > 1 && (L[u++] = L[A++]));
+              }
+            } else if ((E & 64) === 0) {
+              B = c[(B & 65535) + (s & (1 << E) - 1)];
+              continue i;
+            } else {
+              p.msg = "invalid distance code", n.mode = ee;
+              break e;
+            }
+            break;
+          }
+        } else if ((E & 64) === 0) {
+          B = t[(B & 65535) + (s & (1 << E) - 1)];
+          continue r;
+        } else if (E & 32) {
+          n.mode = te;
+          break e;
+        } else {
+          p.msg = "invalid literal/length code", n.mode = ee;
+          break e;
+        }
+        break;
+      }
+    } while (r < l && u < d);
+    O = h >> 3, r -= O, h -= O << 3, s &= (1 << h) - 1, p.next_in = r, p.next_out = u, p.avail_in = r < l ? 5 + (l - r) : 5 - (r - l), p.avail_out = u < d ? 257 + (d - u) : 257 - (u - d), n.hold = s, n.bits = h;
+  };
+})), n0 = /* @__PURE__ */ De(((V, Q) => {
+  var ee = me(), te = 15, T = 852, p = 592, $ = 0, n = 1, r = 2, l = [
+    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
+  ], u = [
+    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
+  ], w = [
+    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
+  ], d = [
+    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
+  ];
+  Q.exports = function(v, y, _, b, s, h, t, c) {
+    var g = c.bits, x = 0, B = 0, E = 0, O = 0, N = 0, A = 0, P = 0, G = 0, L = 0, R = 0, K, U, m, j, re, X = null, Y = 0, le, oe = new ee.Buf16(te + 1), ne = new ee.Buf16(te + 1), F = null, he = 0, ke, we, ze;
+    for (x = 0; x <= te; x++) oe[x] = 0;
+    for (B = 0; B < b; B++) oe[y[_ + B]]++;
+    for (N = g, O = te; O >= 1 && oe[O] === 0; O--) ;
+    if (N > O && (N = O), O === 0)
+      return s[h++] = 20971520, s[h++] = 20971520, c.bits = 1, 0;
+    for (E = 1; E < O && oe[E] === 0; E++) ;
+    for (N < E && (N = E), G = 1, x = 1; x <= te; x++)
+      if (G <<= 1, G -= oe[x], G < 0) return -1;
+    if (G > 0 && (v === $ || O !== 1)) return -1;
+    for (ne[1] = 0, x = 1; x < te; x++) ne[x + 1] = ne[x] + oe[x];
+    for (B = 0; B < b; B++) y[_ + B] !== 0 && (t[ne[y[_ + B]]++] = B);
+    if (v === $ ? (X = F = t, le = 19) : v === n ? (X = l, Y -= 257, F = u, he -= 257, le = 256) : (X = w, F = d, le = -1), R = 0, B = 0, x = E, re = h, A = N, P = 0, m = -1, L = 1 << N, j = L - 1, v === n && L > T || v === r && L > p) return 1;
+    for (; ; ) {
+      ke = x - P, t[B] < le ? (we = 0, ze = t[B]) : t[B] > le ? (we = F[he + t[B]], ze = X[Y + t[B]]) : (we = 96, ze = 0), K = 1 << x - P, U = 1 << A, E = U;
+      do
+        U -= K, s[re + (R >> P) + U] = ke << 24 | we << 16 | ze | 0;
+      while (U !== 0);
+      for (K = 1 << x - 1; R & K; ) K >>= 1;
+      if (K !== 0 ? (R &= K - 1, R += K) : R = 0, B++, --oe[x] === 0) {
+        if (x === O) break;
+        x = y[_ + t[B]];
+      }
+      if (x > N && (R & j) !== m) {
+        for (P === 0 && (P = N), re += E, A = x - P, G = 1 << A; A + P < O && (G -= oe[A + P], !(G <= 0)); )
+          A++, G <<= 1;
+        if (L += 1 << A, v === n && L > T || v === r && L > p) return 1;
+        m = R & j, s[m] = N << 24 | A << 16 | re - h | 0;
+      }
+    }
+    return R !== 0 && (s[re + R] = x - P << 24 | 4194304), c.bits = N, 0;
+  };
+})), l0 = /* @__PURE__ */ De(((V) => {
+  var Q = me(), ee = Ve(), te = $e(), T = t0(), p = n0(), $ = 0, n = 1, r = 2, l = 4, u = 5, w = 6, d = 0, o = 1, v = 2, y = -2, _ = -3, b = -4, s = -5, h = 8, t = 1, c = 2, g = 3, x = 4, B = 5, E = 6, O = 7, N = 8, A = 9, P = 10, G = 11, L = 12, R = 13, K = 14, U = 15, m = 16, j = 17, re = 18, X = 19, Y = 20, le = 21, oe = 22, ne = 23, F = 24, he = 25, ke = 26, we = 27, ze = 28, pe = 29, ve = 30, ye = 31, xe = 32, be = 852, q = 592, ae = 15;
+  function se(S) {
+    return (S >>> 24 & 255) + (S >>> 8 & 65280) + ((S & 65280) << 8) + ((S & 255) << 24);
+  }
+  function de() {
+    this.mode = 0, this.last = !1, this.wrap = 0, this.havedict = !1, this.flags = 0, this.dmax = 0, this.check = 0, this.total = 0, this.head = null, this.wbits = 0, this.wsize = 0, this.whave = 0, this.wnext = 0, this.window = null, this.hold = 0, this.bits = 0, this.length = 0, this.offset = 0, this.extra = 0, this.lencode = null, this.distcode = null, this.lenbits = 0, this.distbits = 0, this.ncode = 0, this.nlen = 0, this.ndist = 0, this.have = 0, this.next = null, this.lens = new Q.Buf16(320), this.work = new Q.Buf16(288), this.lendyn = null, this.distdyn = null, this.sane = 0, this.back = 0, this.was = 0;
+  }
+  function _e(S) {
+    var M;
+    return !S || !S.state ? y : (M = S.state, S.total_in = S.total_out = M.total = 0, S.msg = "", M.wrap && (S.adler = M.wrap & 1), M.mode = t, M.last = 0, M.havedict = 0, M.dmax = 32768, M.head = null, M.hold = 0, M.bits = 0, M.lencode = M.lendyn = new Q.Buf32(be), M.distcode = M.distdyn = new Q.Buf32(q), M.sane = 1, M.back = -1, d);
+  }
+  function ce(S) {
+    var M;
+    return !S || !S.state ? y : (M = S.state, M.wsize = 0, M.whave = 0, M.wnext = 0, _e(S));
+  }
+  function Re(S, M) {
+    var a, Z;
+    return !S || !S.state || (Z = S.state, M < 0 ? (a = 0, M = -M) : (a = (M >> 4) + 1, M < 48 && (M &= 15)), M && (M < 8 || M > 15)) ? y : (Z.window !== null && Z.wbits !== M && (Z.window = null), Z.wrap = a, Z.wbits = M, ce(S));
+  }
+  function Ce(S, M) {
+    var a, Z;
+    return S ? (Z = new de(), S.state = Z, Z.window = null, a = Re(S, M), a !== d && (S.state = null), a) : y;
+  }
+  function Ke(S) {
+    return Ce(S, ae);
+  }
+  var He = !0, Be, Le;
+  function Ie(S) {
+    if (He) {
+      var M;
+      for (Be = new Q.Buf32(512), Le = new Q.Buf32(32), M = 0; M < 144; ) S.lens[M++] = 8;
+      for (; M < 256; ) S.lens[M++] = 9;
+      for (; M < 280; ) S.lens[M++] = 7;
+      for (; M < 288; ) S.lens[M++] = 8;
+      for (p(n, S.lens, 0, 288, Be, 0, S.work, { bits: 9 }), M = 0; M < 32; ) S.lens[M++] = 5;
+      p(r, S.lens, 0, 32, Le, 0, S.work, { bits: 5 }), He = !1;
+    }
+    S.lencode = Be, S.lenbits = 9, S.distcode = Le, S.distbits = 5;
+  }
+  function je(S, M, a, Z) {
+    var e, k = S.state;
+    return k.window === null && (k.wsize = 1 << k.wbits, k.wnext = 0, k.whave = 0, k.window = new Q.Buf8(k.wsize)), Z >= k.wsize ? (Q.arraySet(k.window, M, a - k.wsize, k.wsize, 0), k.wnext = 0, k.whave = k.wsize) : (e = k.wsize - k.wnext, e > Z && (e = Z), Q.arraySet(k.window, M, a - Z, e, k.wnext), Z -= e, Z ? (Q.arraySet(k.window, M, a - Z, Z, 0), k.wnext = Z, k.whave = k.wsize) : (k.wnext += e, k.wnext === k.wsize && (k.wnext = 0), k.whave < k.wsize && (k.whave += e))), 0;
+  }
+  function Je(S, M) {
+    var a, Z, e, k, H, i, C, D, z, ie, fe, W, Ze, Ye, ge = 0, ue, Se, Oe, Ne, We, Xe, Ee, Me, Ae = new Q.Buf8(4), Pe, Ge, Te = [
+      16,
+      17,
+      18,
+      0,
+      8,
+      7,
+      9,
+      6,
+      10,
+      5,
+      11,
+      4,
+      12,
+      3,
+      13,
+      2,
+      14,
+      1,
+      15
+    ];
+    if (!S || !S.state || !S.output || !S.input && S.avail_in !== 0) return y;
+    a = S.state, a.mode === L && (a.mode = R), H = S.next_out, e = S.output, C = S.avail_out, k = S.next_in, Z = S.input, i = S.avail_in, D = a.hold, z = a.bits, ie = i, fe = C, Me = d;
+    e: for (; ; ) switch (a.mode) {
+      case t:
+        if (a.wrap === 0) {
+          a.mode = R;
+          break;
+        }
+        for (; z < 16; ) {
+          if (i === 0) break e;
+          i--, D += Z[k++] << z, z += 8;
+        }
+        if (a.wrap & 2 && D === 35615) {
+          a.check = 0, Ae[0] = D & 255, Ae[1] = D >>> 8 & 255, a.check = te(a.check, Ae, 2, 0), D = 0, z = 0, a.mode = c;
+          break;
+        }
+        if (a.flags = 0, a.head && (a.head.done = !1), !(a.wrap & 1) || (((D & 255) << 8) + (D >> 8)) % 31) {
+          S.msg = "incorrect header check", a.mode = ve;
+          break;
+        }
+        if ((D & 15) !== h) {
+          S.msg = "unknown compression method", a.mode = ve;
+          break;
+        }
+        if (D >>>= 4, z -= 4, Ee = (D & 15) + 8, a.wbits === 0) a.wbits = Ee;
+        else if (Ee > a.wbits) {
+          S.msg = "invalid window size", a.mode = ve;
+          break;
+        }
+        a.dmax = 1 << Ee, S.adler = a.check = 1, a.mode = D & 512 ? P : L, D = 0, z = 0;
+        break;
+      case c:
+        for (; z < 16; ) {
+          if (i === 0) break e;
+          i--, D += Z[k++] << z, z += 8;
+        }
+        if (a.flags = D, (a.flags & 255) !== h) {
+          S.msg = "unknown compression method", a.mode = ve;
+          break;
+        }
+        if (a.flags & 57344) {
+          S.msg = "unknown header flags set", a.mode = ve;
+          break;
+        }
+        a.head && (a.head.text = D >> 8 & 1), a.flags & 512 && (Ae[0] = D & 255, Ae[1] = D >>> 8 & 255, a.check = te(a.check, Ae, 2, 0)), D = 0, z = 0, a.mode = g;
+      case g:
+        for (; z < 32; ) {
+          if (i === 0) break e;
+          i--, D += Z[k++] << z, z += 8;
+        }
+        a.head && (a.head.time = D), a.flags & 512 && (Ae[0] = D & 255, Ae[1] = D >>> 8 & 255, Ae[2] = D >>> 16 & 255, Ae[3] = D >>> 24 & 255, a.check = te(a.check, Ae, 4, 0)), D = 0, z = 0, a.mode = x;
+      case x:
+        for (; z < 16; ) {
+          if (i === 0) break e;
+          i--, D += Z[k++] << z, z += 8;
+        }
+        a.head && (a.head.xflags = D & 255, a.head.os = D >> 8), a.flags & 512 && (Ae[0] = D & 255, Ae[1] = D >>> 8 & 255, a.check = te(a.check, Ae, 2, 0)), D = 0, z = 0, a.mode = B;
+      case B:
+        if (a.flags & 1024) {
+          for (; z < 16; ) {
+            if (i === 0) break e;
+            i--, D += Z[k++] << z, z += 8;
+          }
+          a.length = D, a.head && (a.head.extra_len = D), a.flags & 512 && (Ae[0] = D & 255, Ae[1] = D >>> 8 & 255, a.check = te(a.check, Ae, 2, 0)), D = 0, z = 0;
+        } else a.head && (a.head.extra = null);
+        a.mode = E;
+      case E:
+        if (a.flags & 1024 && (W = a.length, W > i && (W = i), W && (a.head && (Ee = a.head.extra_len - a.length, a.head.extra || (a.head.extra = new Array(a.head.extra_len)), Q.arraySet(a.head.extra, Z, k, W, Ee)), a.flags & 512 && (a.check = te(a.check, Z, W, k)), i -= W, k += W, a.length -= W), a.length))
+          break e;
+        a.length = 0, a.mode = O;
+      case O:
+        if (a.flags & 2048) {
+          if (i === 0) break e;
+          W = 0;
+          do
+            Ee = Z[k + W++], a.head && Ee && a.length < 65536 && (a.head.name += String.fromCharCode(Ee));
+          while (Ee && W < i);
+          if (a.flags & 512 && (a.check = te(a.check, Z, W, k)), i -= W, k += W, Ee) break e;
+        } else a.head && (a.head.name = null);
+        a.length = 0, a.mode = N;
+      case N:
+        if (a.flags & 4096) {
+          if (i === 0) break e;
+          W = 0;
+          do
+            Ee = Z[k + W++], a.head && Ee && a.length < 65536 && (a.head.comment += String.fromCharCode(Ee));
+          while (Ee && W < i);
+          if (a.flags & 512 && (a.check = te(a.check, Z, W, k)), i -= W, k += W, Ee) break e;
+        } else a.head && (a.head.comment = null);
+        a.mode = A;
+      case A:
+        if (a.flags & 512) {
+          for (; z < 16; ) {
+            if (i === 0) break e;
+            i--, D += Z[k++] << z, z += 8;
+          }
+          if (D !== (a.check & 65535)) {
+            S.msg = "header crc mismatch", a.mode = ve;
+            break;
+          }
+          D = 0, z = 0;
+        }
+        a.head && (a.head.hcrc = a.flags >> 9 & 1, a.head.done = !0), S.adler = a.check = 0, a.mode = L;
+        break;
+      case P:
+        for (; z < 32; ) {
+          if (i === 0) break e;
+          i--, D += Z[k++] << z, z += 8;
+        }
+        S.adler = a.check = se(D), D = 0, z = 0, a.mode = G;
+      case G:
+        if (a.havedict === 0)
+          return S.next_out = H, S.avail_out = C, S.next_in = k, S.avail_in = i, a.hold = D, a.bits = z, v;
+        S.adler = a.check = 1, a.mode = L;
+      case L:
+        if (M === u || M === w) break e;
+      case R:
+        if (a.last) {
+          D >>>= z & 7, z -= z & 7, a.mode = we;
+          break;
+        }
+        for (; z < 3; ) {
+          if (i === 0) break e;
+          i--, D += Z[k++] << z, z += 8;
+        }
+        switch (a.last = D & 1, D >>>= 1, z -= 1, D & 3) {
+          case 0:
+            a.mode = K;
+            break;
+          case 1:
+            if (Ie(a), a.mode = Y, M === w) {
+              D >>>= 2, z -= 2;
+              break e;
+            }
+            break;
+          case 2:
+            a.mode = j;
+            break;
+          case 3:
+            S.msg = "invalid block type", a.mode = ve;
+        }
+        D >>>= 2, z -= 2;
+        break;
+      case K:
+        for (D >>>= z & 7, z -= z & 7; z < 32; ) {
+          if (i === 0) break e;
+          i--, D += Z[k++] << z, z += 8;
+        }
+        if ((D & 65535) !== (D >>> 16 ^ 65535)) {
+          S.msg = "invalid stored block lengths", a.mode = ve;
+          break;
+        }
+        if (a.length = D & 65535, D = 0, z = 0, a.mode = U, M === w) break e;
+      case U:
+        a.mode = m;
+      case m:
+        if (W = a.length, W) {
+          if (W > i && (W = i), W > C && (W = C), W === 0) break e;
+          Q.arraySet(e, Z, k, W, H), i -= W, k += W, C -= W, H += W, a.length -= W;
+          break;
+        }
+        a.mode = L;
+        break;
+      case j:
+        for (; z < 14; ) {
+          if (i === 0) break e;
+          i--, D += Z[k++] << z, z += 8;
+        }
+        if (a.nlen = (D & 31) + 257, D >>>= 5, z -= 5, a.ndist = (D & 31) + 1, D >>>= 5, z -= 5, a.ncode = (D & 15) + 4, D >>>= 4, z -= 4, a.nlen > 286 || a.ndist > 30) {
+          S.msg = "too many length or distance symbols", a.mode = ve;
+          break;
+        }
+        a.have = 0, a.mode = re;
+      case re:
+        for (; a.have < a.ncode; ) {
+          for (; z < 3; ) {
+            if (i === 0) break e;
+            i--, D += Z[k++] << z, z += 8;
+          }
+          a.lens[Te[a.have++]] = D & 7, D >>>= 3, z -= 3;
+        }
+        for (; a.have < 19; ) a.lens[Te[a.have++]] = 0;
+        if (a.lencode = a.lendyn, a.lenbits = 7, Pe = { bits: a.lenbits }, Me = p($, a.lens, 0, 19, a.lencode, 0, a.work, Pe), a.lenbits = Pe.bits, Me) {
+          S.msg = "invalid code lengths set", a.mode = ve;
+          break;
+        }
+        a.have = 0, a.mode = X;
+      case X:
+        for (; a.have < a.nlen + a.ndist; ) {
+          for (; ge = a.lencode[D & (1 << a.lenbits) - 1], ue = ge >>> 24, Se = ge >>> 16 & 255, Oe = ge & 65535, !(ue <= z); ) {
+            if (i === 0) break e;
+            i--, D += Z[k++] << z, z += 8;
+          }
+          if (Oe < 16)
+            D >>>= ue, z -= ue, a.lens[a.have++] = Oe;
+          else {
+            if (Oe === 16) {
+              for (Ge = ue + 2; z < Ge; ) {
+                if (i === 0) break e;
+                i--, D += Z[k++] << z, z += 8;
+              }
+              if (D >>>= ue, z -= ue, a.have === 0) {
+                S.msg = "invalid bit length repeat", a.mode = ve;
+                break;
+              }
+              Ee = a.lens[a.have - 1], W = 3 + (D & 3), D >>>= 2, z -= 2;
+            } else if (Oe === 17) {
+              for (Ge = ue + 3; z < Ge; ) {
+                if (i === 0) break e;
+                i--, D += Z[k++] << z, z += 8;
+              }
+              D >>>= ue, z -= ue, Ee = 0, W = 3 + (D & 7), D >>>= 3, z -= 3;
+            } else {
+              for (Ge = ue + 7; z < Ge; ) {
+                if (i === 0) break e;
+                i--, D += Z[k++] << z, z += 8;
+              }
+              D >>>= ue, z -= ue, Ee = 0, W = 11 + (D & 127), D >>>= 7, z -= 7;
+            }
+            if (a.have + W > a.nlen + a.ndist) {
+              S.msg = "invalid bit length repeat", a.mode = ve;
+              break;
+            }
+            for (; W--; ) a.lens[a.have++] = Ee;
+          }
+        }
+        if (a.mode === ve) break;
+        if (a.lens[256] === 0) {
+          S.msg = "invalid code -- missing end-of-block", a.mode = ve;
+          break;
+        }
+        if (a.lenbits = 9, Pe = { bits: a.lenbits }, Me = p(n, a.lens, 0, a.nlen, a.lencode, 0, a.work, Pe), a.lenbits = Pe.bits, Me) {
+          S.msg = "invalid literal/lengths set", a.mode = ve;
+          break;
+        }
+        if (a.distbits = 6, a.distcode = a.distdyn, Pe = { bits: a.distbits }, Me = p(r, a.lens, a.nlen, a.ndist, a.distcode, 0, a.work, Pe), a.distbits = Pe.bits, Me) {
+          S.msg = "invalid distances set", a.mode = ve;
+          break;
+        }
+        if (a.mode = Y, M === w) break e;
+      case Y:
+        a.mode = le;
+      case le:
+        if (i >= 6 && C >= 258) {
+          S.next_out = H, S.avail_out = C, S.next_in = k, S.avail_in = i, a.hold = D, a.bits = z, T(S, fe), H = S.next_out, e = S.output, C = S.avail_out, k = S.next_in, Z = S.input, i = S.avail_in, D = a.hold, z = a.bits, a.mode === L && (a.back = -1);
+          break;
+        }
+        for (a.back = 0; ge = a.lencode[D & (1 << a.lenbits) - 1], ue = ge >>> 24, Se = ge >>> 16 & 255, Oe = ge & 65535, !(ue <= z); ) {
+          if (i === 0) break e;
+          i--, D += Z[k++] << z, z += 8;
+        }
+        if (Se && (Se & 240) === 0) {
+          for (Ne = ue, We = Se, Xe = Oe; ge = a.lencode[Xe + ((D & (1 << Ne + We) - 1) >> Ne)], ue = ge >>> 24, Se = ge >>> 16 & 255, Oe = ge & 65535, !(Ne + ue <= z); ) {
+            if (i === 0) break e;
+            i--, D += Z[k++] << z, z += 8;
+          }
+          D >>>= Ne, z -= Ne, a.back += Ne;
+        }
+        if (D >>>= ue, z -= ue, a.back += ue, a.length = Oe, Se === 0) {
+          a.mode = ke;
+          break;
+        }
+        if (Se & 32) {
+          a.back = -1, a.mode = L;
+          break;
+        }
+        if (Se & 64) {
+          S.msg = "invalid literal/length code", a.mode = ve;
+          break;
+        }
+        a.extra = Se & 15, a.mode = oe;
+      case oe:
+        if (a.extra) {
+          for (Ge = a.extra; z < Ge; ) {
+            if (i === 0) break e;
+            i--, D += Z[k++] << z, z += 8;
+          }
+          a.length += D & (1 << a.extra) - 1, D >>>= a.extra, z -= a.extra, a.back += a.extra;
+        }
+        a.was = a.length, a.mode = ne;
+      case ne:
+        for (; ge = a.distcode[D & (1 << a.distbits) - 1], ue = ge >>> 24, Se = ge >>> 16 & 255, Oe = ge & 65535, !(ue <= z); ) {
+          if (i === 0) break e;
+          i--, D += Z[k++] << z, z += 8;
+        }
+        if ((Se & 240) === 0) {
+          for (Ne = ue, We = Se, Xe = Oe; ge = a.distcode[Xe + ((D & (1 << Ne + We) - 1) >> Ne)], ue = ge >>> 24, Se = ge >>> 16 & 255, Oe = ge & 65535, !(Ne + ue <= z); ) {
+            if (i === 0) break e;
+            i--, D += Z[k++] << z, z += 8;
+          }
+          D >>>= Ne, z -= Ne, a.back += Ne;
+        }
+        if (D >>>= ue, z -= ue, a.back += ue, Se & 64) {
+          S.msg = "invalid distance code", a.mode = ve;
+          break;
+        }
+        a.offset = Oe, a.extra = Se & 15, a.mode = F;
+      case F:
+        if (a.extra) {
+          for (Ge = a.extra; z < Ge; ) {
+            if (i === 0) break e;
+            i--, D += Z[k++] << z, z += 8;
+          }
+          a.offset += D & (1 << a.extra) - 1, D >>>= a.extra, z -= a.extra, a.back += a.extra;
+        }
+        if (a.offset > a.dmax) {
+          S.msg = "invalid distance too far back", a.mode = ve;
+          break;
+        }
+        a.mode = he;
+      case he:
+        if (C === 0) break e;
+        if (W = fe - C, a.offset > W) {
+          if (W = a.offset - W, W > a.whave && a.sane) {
+            S.msg = "invalid distance too far back", a.mode = ve;
+            break;
+          }
+          W > a.wnext ? (W -= a.wnext, Ze = a.wsize - W) : Ze = a.wnext - W, W > a.length && (W = a.length), Ye = a.window;
+        } else
+          Ye = e, Ze = H - a.offset, W = a.length;
+        W > C && (W = C), C -= W, a.length -= W;
+        do
+          e[H++] = Ye[Ze++];
+        while (--W);
+        a.length === 0 && (a.mode = le);
+        break;
+      case ke:
+        if (C === 0) break e;
+        e[H++] = a.length, C--, a.mode = le;
+        break;
+      case we:
+        if (a.wrap) {
+          for (; z < 32; ) {
+            if (i === 0) break e;
+            i--, D |= Z[k++] << z, z += 8;
+          }
+          if (fe -= C, S.total_out += fe, a.total += fe, fe && (S.adler = a.check = a.flags ? te(a.check, e, fe, H - fe) : ee(a.check, e, fe, H - fe)), fe = C, (a.flags ? D : se(D)) !== a.check) {
+            S.msg = "incorrect data check", a.mode = ve;
+            break;
+          }
+          D = 0, z = 0;
+        }
+        a.mode = ze;
+      case ze:
+        if (a.wrap && a.flags) {
+          for (; z < 32; ) {
+            if (i === 0) break e;
+            i--, D += Z[k++] << z, z += 8;
+          }
+          if (D !== (a.total & 4294967295)) {
+            S.msg = "incorrect length check", a.mode = ve;
+            break;
+          }
+          D = 0, z = 0;
+        }
+        a.mode = pe;
+      case pe:
+        Me = o;
+        break e;
+      case ve:
+        Me = _;
+        break e;
+      case ye:
+        return b;
+      case xe:
+      default:
+        return y;
+    }
+    return S.next_out = H, S.avail_out = C, S.next_in = k, S.avail_in = i, a.hold = D, a.bits = z, (a.wsize || fe !== S.avail_out && a.mode < ve && (a.mode < we || M !== l)) && je(S, S.output, S.next_out, fe - S.avail_out) ? (a.mode = ye, b) : (ie -= S.avail_in, fe -= S.avail_out, S.total_in += ie, S.total_out += fe, a.total += fe, a.wrap && fe && (S.adler = a.check = a.flags ? te(a.check, e, fe, S.next_out - fe) : ee(a.check, e, fe, S.next_out - fe)), S.data_type = a.bits + (a.last ? 64 : 0) + (a.mode === L ? 128 : 0) + (a.mode === Y || a.mode === U ? 256 : 0), (ie === 0 && fe === 0 || M === l) && Me === d && (Me = s), Me);
+  }
+  function f(S) {
+    if (!S || !S.state) return y;
+    var M = S.state;
+    return M.window && (M.window = null), S.state = null, d;
+  }
+  function J(S, M) {
+    var a;
+    return !S || !S.state || (a = S.state, (a.wrap & 2) === 0) ? y : (a.head = M, M.done = !1, d);
+  }
+  function I(S, M) {
+    var a = M.length, Z, e, k;
+    return !S || !S.state || (Z = S.state, Z.wrap !== 0 && Z.mode !== G) ? y : Z.mode === G && (e = 1, e = ee(e, M, a, 0), e !== Z.check) ? _ : (k = je(S, M, a, a), k ? (Z.mode = ye, b) : (Z.havedict = 1, d));
+  }
+  V.inflateReset = ce, V.inflateReset2 = Re, V.inflateResetKeep = _e, V.inflateInit = Ke, V.inflateInit2 = Ce, V.inflate = Je, V.inflateEnd = f, V.inflateGetHeader = J, V.inflateSetDictionary = I, V.inflateInfo = "pako inflate (from Nodeca project)";
+})), Fe = /* @__PURE__ */ De(((V, Q) => {
+  Q.exports = {
+    Z_NO_FLUSH: 0,
+    Z_PARTIAL_FLUSH: 1,
+    Z_SYNC_FLUSH: 2,
+    Z_FULL_FLUSH: 3,
+    Z_FINISH: 4,
+    Z_BLOCK: 5,
+    Z_TREES: 6,
+    Z_OK: 0,
+    Z_STREAM_END: 1,
+    Z_NEED_DICT: 2,
+    Z_ERRNO: -1,
+    Z_STREAM_ERROR: -2,
+    Z_DATA_ERROR: -3,
+    Z_BUF_ERROR: -5,
+    Z_NO_COMPRESSION: 0,
+    Z_BEST_SPEED: 1,
+    Z_BEST_COMPRESSION: 9,
+    Z_DEFAULT_COMPRESSION: -1,
+    Z_FILTERED: 1,
+    Z_HUFFMAN_ONLY: 2,
+    Z_RLE: 3,
+    Z_FIXED: 4,
+    Z_DEFAULT_STRATEGY: 0,
+    Z_BINARY: 0,
+    Z_TEXT: 1,
+    Z_UNKNOWN: 2,
+    Z_DEFLATED: 8
+  };
+})), h0 = /* @__PURE__ */ De(((V, Q) => {
+  function ee() {
+    this.text = 0, this.time = 0, this.xflags = 0, this.os = 0, this.extra = null, this.extra_len = 0, this.name = "", this.comment = "", this.hcrc = 0, this.done = !1;
+  }
+  Q.exports = ee;
+})), o0 = /* @__PURE__ */ De(((V) => {
+  var Q = l0(), ee = me(), te = Ue(), T = Fe(), p = Qe(), $ = qe(), n = h0(), r = Object.prototype.toString;
+  function l(d) {
+    if (!(this instanceof l)) return new l(d);
+    this.options = ee.assign({
+      chunkSize: 16384,
+      windowBits: 0,
+      to: ""
+    }, d || {});
+    var o = this.options;
+    o.raw && o.windowBits >= 0 && o.windowBits < 16 && (o.windowBits = -o.windowBits, o.windowBits === 0 && (o.windowBits = -15)), o.windowBits >= 0 && o.windowBits < 16 && !(d && d.windowBits) && (o.windowBits += 32), o.windowBits > 15 && o.windowBits < 48 && (o.windowBits & 15) === 0 && (o.windowBits |= 15), this.err = 0, this.msg = "", this.ended = !1, this.chunks = [], this.strm = new $(), this.strm.avail_out = 0;
+    var v = Q.inflateInit2(this.strm, o.windowBits);
+    if (v !== T.Z_OK) throw new Error(p[v]);
+    if (this.header = new n(), Q.inflateGetHeader(this.strm, this.header), o.dictionary && (typeof o.dictionary == "string" ? o.dictionary = te.string2buf(o.dictionary) : r.call(o.dictionary) === "[object ArrayBuffer]" && (o.dictionary = new Uint8Array(o.dictionary)), o.raw && (v = Q.inflateSetDictionary(this.strm, o.dictionary), v !== T.Z_OK)))
+      throw new Error(p[v]);
+  }
+  l.prototype.push = function(d, o) {
+    var v = this.strm, y = this.options.chunkSize, _ = this.options.dictionary, b, s, h, t, c, g = !1;
+    if (this.ended) return !1;
+    s = o === ~~o ? o : o === !0 ? T.Z_FINISH : T.Z_NO_FLUSH, typeof d == "string" ? v.input = te.binstring2buf(d) : r.call(d) === "[object ArrayBuffer]" ? v.input = new Uint8Array(d) : v.input = d, v.next_in = 0, v.avail_in = v.input.length;
+    do {
+      if (v.avail_out === 0 && (v.output = new ee.Buf8(y), v.next_out = 0, v.avail_out = y), b = Q.inflate(v, T.Z_NO_FLUSH), b === T.Z_NEED_DICT && _ && (b = Q.inflateSetDictionary(this.strm, _)), b === T.Z_BUF_ERROR && g === !0 && (b = T.Z_OK, g = !1), b !== T.Z_STREAM_END && b !== T.Z_OK)
+        return this.onEnd(b), this.ended = !0, !1;
+      v.next_out && (v.avail_out === 0 || b === T.Z_STREAM_END || v.avail_in === 0 && (s === T.Z_FINISH || s === T.Z_SYNC_FLUSH)) && (this.options.to === "string" ? (h = te.utf8border(v.output, v.next_out), t = v.next_out - h, c = te.buf2string(v.output, h), v.next_out = t, v.avail_out = y - t, t && ee.arraySet(v.output, v.output, h, t, 0), this.onData(c)) : this.onData(ee.shrinkBuf(v.output, v.next_out))), v.avail_in === 0 && v.avail_out === 0 && (g = !0);
+    } while ((v.avail_in > 0 || v.avail_out === 0) && b !== T.Z_STREAM_END);
+    return b === T.Z_STREAM_END && (s = T.Z_FINISH), s === T.Z_FINISH ? (b = Q.inflateEnd(this.strm), this.onEnd(b), this.ended = !0, b === T.Z_OK) : (s === T.Z_SYNC_FLUSH && (this.onEnd(T.Z_OK), v.avail_out = 0), !0);
+  }, l.prototype.onData = function(d) {
+    this.chunks.push(d);
+  }, l.prototype.onEnd = function(d) {
+    d === T.Z_OK && (this.options.to === "string" ? this.result = this.chunks.join("") : this.result = ee.flattenChunks(this.chunks)), this.chunks = [], this.err = d, this.msg = this.strm.msg;
+  };
+  function u(d, o) {
+    var v = new l(o);
+    if (v.push(d, !0), v.err) throw v.msg || p[v.err];
+    return v.result;
+  }
+  function w(d, o) {
+    return o = o || {}, o.raw = !0, u(d, o);
+  }
+  V.Inflate = l, V.inflate = u, V.inflateRaw = w, V.ungzip = u;
+})), f0 = /* @__PURE__ */ De(((V, Q) => {
+  var ee = me().assign, te = a0(), T = o0(), p = Fe(), $ = {};
+  ee($, te, T, p), Q.exports = $;
+})), _0 = /* @__PURE__ */ De(((V, Q) => {
+  (function() {
+    var ee = {};
+    typeof Q == "object" ? Q.exports = ee : self.UTIF = ee;
+    var te;
+    typeof e0 == "function" ? te = f0() : te = self.pako;
+    function T() {
+      (typeof process > "u" || process.env.NODE_ENV == "development") && console.log.apply(console, arguments);
+    }
+    (function(p, $) {
+      (function() {
+        var n = typeof Symbol == "function" && typeof Symbol.iterator == "symbol" ? function(u) {
+          return typeof u;
+        } : function(u) {
+          return u && typeof Symbol == "function" && u.constructor === Symbol && u !== Symbol.prototype ? "symbol" : typeof u;
+        }, r = (function() {
+          function u(w) {
+            this.message = "JPEG error: " + w;
+          }
+          return u.prototype = Error(), u.prototype.name = "JpegError", u.constructor = u;
+        })(), l = (function() {
+          function u(w, d) {
+            this.message = w, this.g = d;
+          }
+          return u.prototype = Error(), u.prototype.name = "DNLMarkerError", u.constructor = u;
+        })();
+        (function() {
+          function u() {
+            this.M = null, this.B = -1;
+          }
+          function w(_, b) {
+            for (var s = 0, h = [], t, c, g = 16; 0 < g && !_[g - 1]; ) g--;
+            h.push({
+              children: [],
+              index: 0
+            });
+            var x = h[0], B;
+            for (t = 0; t < g; t++) {
+              for (c = 0; c < _[t]; c++) {
+                for (x = h.pop(), x.children[x.index] = b[s]; 0 < x.index; ) x = h.pop();
+                for (x.index++, h.push(x); h.length <= t; ) h.push(B = {
+                  children: [],
+                  index: 0
+                }), x.children[x.index] = B.children, x = B;
+                s++;
+              }
+              t + 1 < g && (h.push(B = {
+                children: [],
+                index: 0
+              }), x.children[x.index] = B.children, x = B);
+            }
+            return h[0].children;
+          }
+          function d(_, b, s, h, t, c, g, x, B) {
+            function E() {
+              if (0 < X) return X--, re >> X & 1;
+              if (re = _[b++], re === 255) {
+                var ae = _[b++];
+                if (ae) {
+                  if (ae === 220 && U) {
+                    b += 2;
+                    var se = _[b++] << 8 | _[b++];
+                    if (0 < se && se !== s.g) throw new l("Found DNL marker (0xFFDC) while parsing scan data", se);
+                  }
+                  throw new r("unexpected marker " + (re << 8 | ae).toString(16));
+                }
+              }
+              return X = 7, re >>> 7;
+            }
+            function O(ae) {
+              for (; ; ) {
+                if (ae = ae[E()], typeof ae == "number") return ae;
+                if ((typeof ae > "u" ? "undefined" : n(ae)) !== "object") throw new r("invalid huffman sequence");
+              }
+            }
+            function N(ae) {
+              for (var se = 0; 0 < ae; ) se = se << 1 | E(), ae--;
+              return se;
+            }
+            function A(ae) {
+              if (ae === 1) return E() === 1 ? 1 : -1;
+              var se = N(ae);
+              return se >= 1 << ae - 1 ? se : se + (-1 << ae) + 1;
+            }
+            function P(ae, se) {
+              var de = O(ae.D);
+              for (de = de === 0 ? 0 : A(de), ae.a[se] = ae.m += de, de = 1; 64 > de; ) {
+                var _e = O(ae.o), ce = _e & 15;
+                if (_e >>= 4, ce === 0) {
+                  if (15 > _e) break;
+                  de += 16;
+                } else de += _e, ae.a[se + y[de]] = A(ce), de++;
+              }
+            }
+            function G(ae, se) {
+              var de = O(ae.D);
+              de = de === 0 ? 0 : A(de) << B, ae.a[se] = ae.m += de;
+            }
+            function L(ae, se) {
+              ae.a[se] |= E() << B;
+            }
+            function R(ae, se) {
+              if (0 < Y) Y--;
+              else for (var de = c; de <= g; ) {
+                var _e = O(ae.o), ce = _e & 15;
+                if (_e >>= 4, ce === 0) {
+                  if (15 > _e) {
+                    Y = N(_e) + (1 << _e) - 1;
+                    break;
+                  }
+                  de += 16;
+                } else de += _e, ae.a[se + y[de]] = A(ce) * (1 << B), de++;
+              }
+            }
+            function K(ae, se) {
+              for (var de = c, _e = 0, ce; de <= g; ) {
+                ce = se + y[de];
+                var Re = 0 > ae.a[ce] ? -1 : 1;
+                switch (le) {
+                  case 0:
+                    if (_e = O(ae.o), ce = _e & 15, _e >>= 4, ce === 0) 15 > _e ? (Y = N(_e) + (1 << _e), le = 4) : (_e = 16, le = 1);
+                    else {
+                      if (ce !== 1) throw new r("invalid ACn encoding");
+                      oe = A(ce), le = _e ? 2 : 3;
+                    }
+                    continue;
+                  case 1:
+                  case 2:
+                    ae.a[ce] ? ae.a[ce] += Re * (E() << B) : (_e--, _e === 0 && (le = le === 2 ? 3 : 0));
+                    break;
+                  case 3:
+                    ae.a[ce] ? ae.a[ce] += Re * (E() << B) : (ae.a[ce] = oe << B, le = 0);
+                    break;
+                  case 4:
+                    ae.a[ce] && (ae.a[ce] += Re * (E() << B));
+                }
+                de++;
+              }
+              le === 4 && (Y--, Y === 0 && (le = 0));
+            }
+            for (var U = 9 < arguments.length && arguments[9] !== void 0 ? arguments[9] : !1, m = s.P, j = b, re = 0, X = 0, Y = 0, le = 0, oe, ne = h.length, F, he, ke, we, ze = s.S ? c === 0 ? x === 0 ? G : L : x === 0 ? R : K : P, pe = 0, ve = ne === 1 ? h[0].c * h[0].l : m * s.O, ye, xe; pe < ve; ) {
+              var be = t ? Math.min(ve - pe, t) : ve;
+              for (F = 0; F < ne; F++) h[F].m = 0;
+              if (Y = 0, ne === 1) {
+                var q = h[0];
+                for (we = 0; we < be; we++) ze(q, 64 * ((q.c + 1) * (pe / q.c | 0) + pe % q.c)), pe++;
+              } else for (we = 0; we < be; we++) {
+                for (F = 0; F < ne; F++) for (q = h[F], ye = q.h, xe = q.j, he = 0; he < xe; he++) for (ke = 0; ke < ye; ke++) ze(q, 64 * ((q.c + 1) * ((pe / m | 0) * q.j + he) + (pe % m * q.h + ke)));
+                pe++;
+              }
+              if (X = 0, (q = v(_, b)) && q.f && ((0, _util.warn)("decodeScan - unexpected MCU data, current marker is: " + q.f), b = q.offset), q = q && q.F, !q || 65280 >= q) throw new r("marker was not found");
+              if (65488 <= q && 65495 >= q) b += 2;
+              else break;
+            }
+            return (q = v(_, b)) && q.f && ((0, _util.warn)("decodeScan - unexpected Scan data, current marker is: " + q.f), b = q.offset), b - j;
+          }
+          function o(_, b) {
+            for (var s = b.c, h = b.l, t = /* @__PURE__ */ new Int16Array(64), c = 0; c < h; c++) for (var g = 0; g < s; g++) {
+              var x = 64 * ((b.c + 1) * c + g), B = t, E = b.G, O = b.a;
+              if (!E) throw new r("missing required Quantization Table.");
+              for (var N = 0; 64 > N; N += 8) {
+                var A = O[x + N], P = O[x + N + 1], G = O[x + N + 2], L = O[x + N + 3], R = O[x + N + 4], K = O[x + N + 5], U = O[x + N + 6], m = O[x + N + 7];
+                if (A *= E[N], (P | G | L | R | K | U | m) === 0) A = 5793 * A + 512 >> 10, B[N] = A, B[N + 1] = A, B[N + 2] = A, B[N + 3] = A, B[N + 4] = A, B[N + 5] = A, B[N + 6] = A, B[N + 7] = A;
+                else {
+                  P *= E[N + 1], G *= E[N + 2], L *= E[N + 3], R *= E[N + 4], K *= E[N + 5], U *= E[N + 6], m *= E[N + 7];
+                  var j = 5793 * A + 128 >> 8, re = 5793 * R + 128 >> 8, X = G, Y = U;
+                  R = 2896 * (P - m) + 128 >> 8, m = 2896 * (P + m) + 128 >> 8, L <<= 4, K <<= 4, j = j + re + 1 >> 1, re = j - re, A = 3784 * X + 1567 * Y + 128 >> 8, X = 1567 * X - 3784 * Y + 128 >> 8, Y = A, R = R + K + 1 >> 1, K = R - K, m = m + L + 1 >> 1, L = m - L, j = j + Y + 1 >> 1, Y = j - Y, re = re + X + 1 >> 1, X = re - X, A = 2276 * R + 3406 * m + 2048 >> 12, R = 3406 * R - 2276 * m + 2048 >> 12, m = A, A = 799 * L + 4017 * K + 2048 >> 12, L = 4017 * L - 799 * K + 2048 >> 12, K = A, B[N] = j + m, B[N + 7] = j - m, B[N + 1] = re + K, B[N + 6] = re - K, B[N + 2] = X + L, B[N + 5] = X - L, B[N + 3] = Y + R, B[N + 4] = Y - R;
+                }
+              }
+              for (E = 0; 8 > E; ++E) A = B[E], P = B[E + 8], G = B[E + 16], L = B[E + 24], R = B[E + 32], K = B[E + 40], U = B[E + 48], m = B[E + 56], (P | G | L | R | K | U | m) === 0 ? (A = 5793 * A + 8192 >> 14, A = -2040 > A ? 0 : 2024 <= A ? 255 : A + 2056 >> 4, O[x + E] = A, O[x + E + 8] = A, O[x + E + 16] = A, O[x + E + 24] = A, O[x + E + 32] = A, O[x + E + 40] = A, O[x + E + 48] = A, O[x + E + 56] = A) : (j = 5793 * A + 2048 >> 12, re = 5793 * R + 2048 >> 12, X = G, Y = U, R = 2896 * (P - m) + 2048 >> 12, m = 2896 * (P + m) + 2048 >> 12, j = (j + re + 1 >> 1) + 4112, re = j - re, A = 3784 * X + 1567 * Y + 2048 >> 12, X = 1567 * X - 3784 * Y + 2048 >> 12, Y = A, R = R + K + 1 >> 1, K = R - K, m = m + L + 1 >> 1, L = m - L, j = j + Y + 1 >> 1, Y = j - Y, re = re + X + 1 >> 1, X = re - X, A = 2276 * R + 3406 * m + 2048 >> 12, R = 3406 * R - 2276 * m + 2048 >> 12, m = A, A = 799 * L + 4017 * K + 2048 >> 12, L = 4017 * L - 799 * K + 2048 >> 12, K = A, A = j + m, m = j - m, P = re + K, U = re - K, G = X + L, K = X - L, L = Y + R, R = Y - R, A = 16 > A ? 0 : 4080 <= A ? 255 : A >> 4, P = 16 > P ? 0 : 4080 <= P ? 255 : P >> 4, G = 16 > G ? 0 : 4080 <= G ? 255 : G >> 4, L = 16 > L ? 0 : 4080 <= L ? 255 : L >> 4, R = 16 > R ? 0 : 4080 <= R ? 255 : R >> 4, K = 16 > K ? 0 : 4080 <= K ? 255 : K >> 4, U = 16 > U ? 0 : 4080 <= U ? 255 : U >> 4, m = 16 > m ? 0 : 4080 <= m ? 255 : m >> 4, O[x + E] = A, O[x + E + 8] = P, O[x + E + 16] = G, O[x + E + 24] = L, O[x + E + 32] = R, O[x + E + 40] = K, O[x + E + 48] = U, O[x + E + 56] = m);
+            }
+            return b.a;
+          }
+          function v(_, b) {
+            var s = 2 < arguments.length && arguments[2] !== void 0 ? arguments[2] : b, h = _.length - 1;
+            if (s = s < b ? s : b, b >= h) return null;
+            var t = _[b] << 8 | _[b + 1];
+            if (65472 <= t && 65534 >= t) return {
+              f: null,
+              F: t,
+              offset: b
+            };
+            for (var c = _[s] << 8 | _[s + 1]; !(65472 <= c && 65534 >= c); ) {
+              if (++s >= h) return null;
+              c = _[s] << 8 | _[s + 1];
+            }
+            return {
+              f: t.toString(16),
+              F: c,
+              offset: s
+            };
+          }
+          var y = new Uint8Array([
+            0,
+            1,
+            8,
+            16,
+            9,
+            2,
+            3,
+            10,
+            17,
+            24,
+            32,
+            25,
+            18,
+            11,
+            4,
+            5,
+            12,
+            19,
+            26,
+            33,
+            40,
+            48,
+            41,
+            34,
+            27,
+            20,
+            13,
+            6,
+            7,
+            14,
+            21,
+            28,
+            35,
+            42,
+            49,
+            56,
+            57,
+            50,
+            43,
+            36,
+            29,
+            22,
+            15,
+            23,
+            30,
+            37,
+            44,
+            51,
+            58,
+            59,
+            52,
+            45,
+            38,
+            31,
+            39,
+            46,
+            53,
+            60,
+            61,
+            54,
+            47,
+            55,
+            62,
+            63
+          ]);
+          u.prototype = {
+            parse: function(_) {
+              function b() {
+                var X = _[g] << 8 | _[g + 1];
+                return g += 2, X;
+              }
+              function s() {
+                var X = b();
+                X = g + X - 2;
+                var Y = v(_, X, g);
+                return Y && Y.f && ((0, _util.warn)("readDataBlock - incorrect length, current marker is: " + Y.f), X = Y.offset), X = _.subarray(g, X), g += X.length, X;
+              }
+              function h(X) {
+                for (var Y = Math.ceil(X.v / 8 / X.s), le = Math.ceil(X.g / 8 / X.u), oe = 0; oe < X.b.length; oe++) {
+                  j = X.b[oe];
+                  var ne = Math.ceil(Math.ceil(X.v / 8) * j.h / X.s), F = Math.ceil(Math.ceil(X.g / 8) * j.j / X.u);
+                  j.a = new Int16Array(64 * le * j.j * (Y * j.h + 1)), j.c = ne, j.l = F;
+                }
+                X.P = Y, X.O = le;
+              }
+              var t = (1 < arguments.length && arguments[1] !== void 0 ? arguments[1] : {}).N, c = t === void 0 ? null : t, g = 0, x = null, B = 0;
+              t = [];
+              var E = [], O = [], N = b();
+              if (N !== 65496) throw new r("SOI not found");
+              for (N = b(); N !== 65497; ) {
+                switch (N) {
+                  case 65504:
+                  case 65505:
+                  case 65506:
+                  case 65507:
+                  case 65508:
+                  case 65509:
+                  case 65510:
+                  case 65511:
+                  case 65512:
+                  case 65513:
+                  case 65514:
+                  case 65515:
+                  case 65516:
+                  case 65517:
+                  case 65518:
+                  case 65519:
+                  case 65534:
+                    var A = s();
+                    N === 65518 && A[0] === 65 && A[1] === 100 && A[2] === 111 && A[3] === 98 && A[4] === 101 && (x = {
+                      version: A[5] << 8 | A[6],
+                      Y: A[7] << 8 | A[8],
+                      Z: A[9] << 8 | A[10],
+                      W: A[11]
+                    });
+                    break;
+                  case 65499:
+                    N = b() + g - 2;
+                    for (var P; g < N; ) {
+                      var G = _[g++], L = /* @__PURE__ */ new Uint16Array(64);
+                      if (G >> 4 === 0) for (A = 0; 64 > A; A++) P = y[A], L[P] = _[g++];
+                      else if (G >> 4 === 1) for (A = 0; 64 > A; A++) P = y[A], L[P] = b();
+                      else throw new r("DQT - invalid table spec");
+                      t[G & 15] = L;
+                    }
+                    break;
+                  case 65472:
+                  case 65473:
+                  case 65474:
+                    if (R) throw new r("Only single frame JPEGs supported");
+                    b();
+                    var R = {};
+                    for (R.X = N === 65473, R.S = N === 65474, R.precision = _[g++], N = b(), R.g = c || N, R.v = b(), R.b = [], R.C = {}, A = _[g++], N = L = G = 0; N < A; N++) {
+                      P = _[g];
+                      var K = _[g + 1] >> 4, U = _[g + 1] & 15;
+                      G < K && (G = K), L < U && (L = U), K = R.b.push({
+                        h: K,
+                        j: U,
+                        T: _[g + 2],
+                        G: null
+                      }), R.C[P] = K - 1, g += 3;
+                    }
+                    R.s = G, R.u = L, h(R);
+                    break;
+                  case 65476:
+                    for (P = b(), N = 2; N < P; ) {
+                      for (G = _[g++], L = /* @__PURE__ */ new Uint8Array(16), A = K = 0; 16 > A; A++, g++) K += L[A] = _[g];
+                      for (U = new Uint8Array(K), A = 0; A < K; A++, g++) U[A] = _[g];
+                      N += 17 + K, (G >> 4 === 0 ? O : E)[G & 15] = w(L, U);
+                    }
+                    break;
+                  case 65501:
+                    b();
+                    var m = b();
+                    break;
+                  case 65498:
+                    for (A = ++B === 1 && !c, b(), G = _[g++], P = [], N = 0; N < G; N++) {
+                      L = R.C[_[g++]];
+                      var j = R.b[L];
+                      L = _[g++], j.D = O[L >> 4], j.o = E[L & 15], P.push(j);
+                    }
+                    N = _[g++], G = _[g++], L = _[g++];
+                    try {
+                      var re = d(_, g, R, P, m, N, G, L >> 4, L & 15, A);
+                      g += re;
+                    } catch (X) {
+                      if (X instanceof l) return (0, _util.warn)('Attempting to re-parse JPEG image using "scanLines" parameter found in DNL marker (0xFFDC) segment.'), this.parse(_, { N: X.g });
+                      throw X;
+                    }
+                    break;
+                  case 65500:
+                    g += 4;
+                    break;
+                  case 65535:
+                    _[g] !== 255 && g--;
+                    break;
+                  default:
+                    if (_[g - 3] === 255 && 192 <= _[g - 2] && 254 >= _[g - 2]) g -= 3;
+                    else if ((A = v(_, g - 2)) && A.f) (0, _util.warn)("JpegImage.parse - unexpected data, current marker is: " + A.f), g = A.offset;
+                    else throw new r("unknown marker " + N.toString(16));
+                }
+                N = b();
+              }
+              for (this.width = R.v, this.height = R.g, this.A = x, this.b = [], N = 0; N < R.b.length; N++)
+                j = R.b[N], (m = t[j.T]) && (j.G = m), this.b.push({
+                  R: o(R, j),
+                  U: j.h / R.s,
+                  V: j.j / R.u,
+                  c: j.c,
+                  l: j.l
+                });
+              this.i = this.b.length;
+            },
+            L: function(_, b) {
+              var s = this.width / _, h = this.height / b, t, c, g = this.b.length, x = _ * b * g, B = new Uint8ClampedArray(x), E = new Uint32Array(_);
+              for (c = 0; c < g; c++) {
+                var O = this.b[c], N = O.U * s, A = O.V * h, P = c, G = O.R, L = O.c + 1 << 3;
+                for (t = 0; t < _; t++) O = 0 | t * N, E[t] = (O & 4294967288) << 3 | O & 7;
+                for (N = 0; N < b; N++) for (O = 0 | N * A, O = L * (O & 4294967288) | (O & 7) << 3, t = 0; t < _; t++) B[P] = G[O + E[t]], P += g;
+              }
+              if (h = this.M) for (c = 0; c < x; ) for (s = O = 0; O < g; O++, c++, s += 2) B[c] = (B[c] * h[s] >> 8) + h[s + 1];
+              return B;
+            },
+            w: function() {
+              return this.A ? !!this.A.W : this.i === 3 ? this.B !== 0 : this.B === 1;
+            },
+            I: function(_) {
+              for (var b, s, h, t = 0, c = _.length; t < c; t += 3) b = _[t], s = _[t + 1], h = _[t + 2], _[t] = b - 179.456 + 1.402 * h, _[t + 1] = b + 135.459 - 0.344 * s - 0.714 * h, _[t + 2] = b - 226.816 + 1.772 * s;
+              return _;
+            },
+            K: function(_) {
+              for (var b, s, h, t, c = 0, g = 0, x = _.length; g < x; g += 4) b = _[g], s = _[g + 1], h = _[g + 2], t = _[g + 3], _[c++] = -122.67195406894 + s * (-660635669420364e-19 * s + 437130475926232e-18 * h - 54080610064599e-18 * b + 48449797120281e-17 * t - 0.154362151871126) + h * (-957964378445773e-18 * h + 817076911346625e-18 * b - 0.00477271405408747 * t + 1.53380253221734) + b * (961250184130688e-18 * b - 0.00266257332283933 * t + 0.48357088451265) + t * (-336197177618394e-18 * t + 0.484791561490776), _[c++] = 107.268039397724 + s * (219927104525741e-19 * s - 640992018297945e-18 * h + 659397001245577e-18 * b + 426105652938837e-18 * t - 0.176491792462875) + h * (-778269941513683e-18 * h + 0.00130872261408275 * b + 770482631801132e-18 * t - 0.151051492775562) + b * (0.00126935368114843 * b - 0.00265090189010898 * t + 0.25802910206845) + t * (-318913117588328e-18 * t - 0.213742400323665), _[c++] = -20.810012546947 + s * (-570115196973677e-18 * s - 263409051004589e-19 * h + 0.0020741088115012 * b - 0.00288260236853442 * t + 0.814272968359295) + h * (-153496057440975e-19 * h - 132689043961446e-18 * b + 560833691242812e-18 * t - 0.195152027534049) + b * (0.00174418132927582 * b - 0.00255243321439347 * t + 0.116935020465145) + t * (-343531996510555e-18 * t + 0.24165260232407);
+              return _.subarray(0, c);
+            },
+            J: function(_) {
+              for (var b, s, h, t = 0, c = _.length; t < c; t += 4) b = _[t], s = _[t + 1], h = _[t + 2], _[t] = 434.456 - b - 1.402 * h, _[t + 1] = 119.541 - b + 0.344 * s + 0.714 * h, _[t + 2] = 481.816 - b - 1.772 * s;
+              return _;
+            },
+            H: function(_) {
+              for (var b, s, h, t, c = 0, g = 1 / 255, x = 0, B = _.length; x < B; x += 4) b = _[x] * g, s = _[x + 1] * g, h = _[x + 2] * g, t = _[x + 3] * g, _[c++] = 255 + b * (-4.387332384609988 * b + 54.48615194189176 * s + 18.82290502165302 * h + 212.25662451639585 * t - 285.2331026137004) + s * (1.7149763477362134 * s - 5.6096736904047315 * h - 17.873870861415444 * t - 5.497006427196366) + h * (-2.5217340131683033 * h - 21.248923337353073 * t + 17.5119270841813) - t * (21.86122147463605 * t + 189.48180835922747), _[c++] = 255 + b * (8.841041422036149 * b + 60.118027045597366 * s + 6.871425592049007 * h + 31.159100130055922 * t - 79.2970844816548) + s * (-15.310361306967817 * s + 17.575251261109482 * h + 131.35250912493976 * t - 190.9453302588951) + h * (4.444339102852739 * h + 9.8632861493405 * t - 24.86741582555878) - t * (20.737325471181034 * t + 187.80453709719578), _[c++] = 255 + b * (0.8842522430003296 * b + 8.078677503112928 * s + 30.89978309703729 * h - 0.23883238689178934 * t - 14.183576799673286) + s * (10.49593273432072 * s + 63.02378494754052 * h + 50.606957656360734 * t - 112.23884253719248) + h * (0.03296041114873217 * h + 115.60384449646641 * t - 193.58209356861505) - t * (22.33816807309886 * t + 180.12613974708367);
+              return _.subarray(0, c);
+            },
+            getData: function(_, b, s) {
+              if (4 < this.i) throw new r("Unsupported color mode");
+              if (_ = this.L(_, b), this.i === 1 && s) {
+                s = _.length, b = new Uint8ClampedArray(3 * s);
+                for (var h = 0, t = 0; t < s; t++) {
+                  var c = _[t];
+                  b[h++] = c, b[h++] = c, b[h++] = c;
+                }
+                return b;
+              }
+              if (this.i === 3 && this.w()) return this.I(_);
+              if (this.i === 4) {
+                if (this.w()) return s ? this.K(_) : this.J(_);
+                if (s) return this.H(_);
+              }
+              return _;
+            }
+          }, p.JpegDecoder = u;
+        })();
+      })(), p.encodeImage = function(n, r, l, u) {
+        var w = {
+          t256: [r],
+          t257: [l],
+          t258: [
+            8,
+            8,
+            8,
+            8
+          ],
+          t259: [1],
+          t262: [2],
+          t273: [1e3],
+          t277: [4],
+          t278: [l],
+          t279: [r * l * 4],
+          t282: [1],
+          t283: [1],
+          t284: [1],
+          t286: [0],
+          t287: [0],
+          t296: [1],
+          t305: ["Photopea (UTIF.js)"],
+          t338: [1]
+        };
+        if (u) for (var d in u) w[d] = u[d];
+        for (var o = new Uint8Array(p.encode([w])), v = new Uint8Array(n), y = new Uint8Array(1e3 + r * l * 4), d = 0; d < o.length; d++) y[d] = o[d];
+        for (var d = 0; d < v.length; d++) y[1e3 + d] = v[d];
+        return y.buffer;
+      }, p.encode = function(n) {
+        var r = /* @__PURE__ */ new Uint8Array(2e4), l = 4, u = p._binBE;
+        r[0] = 77, r[1] = 77, r[3] = 42;
+        var w = 8;
+        u.writeUint(r, l, w), l += 4;
+        for (var d = 0; d < n.length; d++) {
+          var o = p._writeIFD(u, r, w, n[d]);
+          w = o[1], d < n.length - 1 && u.writeUint(r, o[0], w);
+        }
+        return r.slice(0, w).buffer;
+      }, p.decode = function(n) {
+        p.decode._decodeG3.allow2D = null;
+        var r = new Uint8Array(n), l = 0, u = p._binBE.readASCII(r, l, 2);
+        l += 2;
+        var w = u == "II" ? p._binLE : p._binBE;
+        w.readUshort(r, l), l += 2;
+        var d = w.readUint(r, l);
+        l += 4;
+        for (var o = []; ; ) {
+          var v = p._readIFD(w, r, d, o, 0, !1);
+          if (d = w.readUint(r, v), d == 0) break;
+        }
+        return o;
+      }, p.decodeImage = function(n, r, l) {
+        var u = new Uint8Array(n), w = p._binBE.readASCII(u, 0, 2);
+        if (r.t256 != null) {
+          r.isLE = w == "II", r.width = r.t256[0], r.height = r.t257[0];
+          var d = r.t259 ? r.t259[0] : 1, o = r.t266 ? r.t266[0] : 1;
+          r.t284 && r.t284[0] == 2 && T("PlanarConfiguration 2 should not be used!");
+          var v;
+          r.t258 ? v = Math.min(32, r.t258[0]) * r.t258.length : v = r.t277 ? r.t277[0] : 1, d == 1 && r.t279 != null && r.t278 && r.t262[0] == 32803 && (v = Math.round(r.t279[0] * 8 / (r.width * r.t278[0])));
+          var y = Math.ceil(r.width * v / 8) * 8, _ = r.t273;
+          _ == null && (_ = r.t324);
+          var b = r.t279;
+          d == 1 && _.length == 1 && (b = [r.height * (y >>> 3)]), b == null && (b = r.t325);
+          var s = new Uint8Array(r.height * (y >>> 3)), h = 0;
+          if (r.t322 != null) {
+            for (var t = r.t322[0], c = r.t323[0], g = Math.floor((r.width + t - 1) / t), x = Math.floor((r.height + c - 1) / c), B = new Uint8Array(Math.ceil(t * c * v / 8) | 0), E = 0; E < x; E++) for (var O = 0; O < g; O++) {
+              for (var N = E * g + O, A = 0; A < B.length; A++) B[A] = 0;
+              p.decode._decompress(r, l, u, _[N], b[N], d, B, 0, o), d == 6 ? s = B : p._copyTile(B, Math.ceil(t * v / 8) | 0, c, s, Math.ceil(r.width * v / 8) | 0, r.height, Math.ceil(O * t * v / 8) | 0, E * c);
+            }
+            h = s.length * 8;
+          } else {
+            var P = r.t278 ? r.t278[0] : r.height;
+            P = Math.min(P, r.height);
+            for (var N = 0; N < _.length; N++)
+              p.decode._decompress(r, l, u, _[N], b[N], d, s, Math.ceil(h / 8) | 0, o), h += y * P;
+            h = Math.min(h, s.length * 8);
+          }
+          r.data = new Uint8Array(s.buffer, 0, Math.ceil(h / 8) | 0);
+        }
+      }, p.decode._decompress = function(n, r, l, u, w, d, o, v, y) {
+        if (d == 1 || w == o.length && d != 32767) for (var _ = 0; _ < w; _++) o[v + _] = l[u + _];
+        else if (d == 3) p.decode._decodeG3(l, u, w, o, v, n.width, y);
+        else if (d == 4) p.decode._decodeG4(l, u, w, o, v, n.width, y);
+        else if (d == 5) p.decode._decodeLZW(l, u, o, v);
+        else if (d == 6) p.decode._decodeOldJPEG(n, l, u, w, o, v);
+        else if (d == 7) p.decode._decodeNewJPEG(n, l, u, w, o, v);
+        else if (d == 8)
+          for (var b = new Uint8Array(l.buffer, u, w), s = $.inflate(b), h = 0; h < s.length; h++) o[v + h] = s[h];
+        else d == 32767 ? p.decode._decodeARW(n, l, u, w, o, v) : d == 32773 ? p.decode._decodePackBits(l, u, w, o, v) : d == 32809 ? p.decode._decodeThunder(l, u, w, o, v) : d == 34713 ? p.decode._decodeNikon(n, r, l, u, w, o, v) : T("Unknown compression", d);
+        var t = n.t258 ? Math.min(32, n.t258[0]) : 1, c = n.t277 ? n.t277[0] : 1, g = t * c >>> 3, x = n.t278 ? n.t278[0] : n.height, B = Math.ceil(t * c * n.width / 8);
+        if (t == 16 && !n.isLE && n.t33422 == null) for (var E = 0; E < x; E++)
+          for (var O = v + E * B, N = 1; N < B; N += 2) {
+            var A = o[O + N];
+            o[O + N] = o[O + N - 1], o[O + N - 1] = A;
+          }
+        if (n.t317 && n.t317[0] == 2) for (var E = 0; E < x; E++) {
+          var P = v + E * B;
+          if (t == 16) for (var _ = g; _ < B; _ += 2) {
+            var G = (o[P + _ + 1] << 8 | o[P + _]) + (o[P + _ - g + 1] << 8 | o[P + _ - g]);
+            o[P + _] = G & 255, o[P + _ + 1] = G >>> 8 & 255;
+          }
+          else if (c == 3) for (var _ = 3; _ < B; _ += 3)
+            o[P + _] = o[P + _] + o[P + _ - 3] & 255, o[P + _ + 1] = o[P + _ + 1] + o[P + _ - 2] & 255, o[P + _ + 2] = o[P + _ + 2] + o[P + _ - 1] & 255;
+          else for (var _ = g; _ < B; _++) o[P + _] = o[P + _] + o[P + _ - g] & 255;
+        }
+      }, p.decode._ljpeg_diff = function(n, r, l) {
+        var u = p.decode._getbithuff, w = u(n, r, l[0], l), d = u(n, r, w, 0);
+        return (d & 1 << w - 1) == 0 && (d -= (1 << w) - 1), d;
+      }, p.decode._decodeARW = function(n, r, l, u, w, d) {
+        var o = n.t256[0], v = n.t257[0], y = n.t258[0], _ = n.isLE ? p._binLE : p._binBE;
+        if (!(o * v == u || o * v * 1.5 == u)) {
+          v += 8;
+          var b = [
+            l,
+            0,
+            0,
+            0
+          ], s = /* @__PURE__ */ new Uint16Array(32770), h = [
+            3857,
+            3856,
+            3599,
+            3342,
+            3085,
+            2828,
+            2571,
+            2314,
+            2057,
+            1800,
+            1543,
+            1286,
+            1029,
+            772,
+            771,
+            768,
+            514,
+            513
+          ], Y, t, c, L, G, g = 0, x = p.decode._ljpeg_diff;
+          for (s[0] = 15, c = Y = 0; Y < 18; Y++)
+            for (var B = 32768 >>> (h[Y] >>> 8), t = 0; t < B; t++) s[++c] = h[Y];
+          for (L = o; L--; ) for (G = 0; G < v + 1; G += 2)
+            if (G == v && (G = 1), g += x(r, b, s), G < v) {
+              var E = g & 4095;
+              p.decode._putsF(w, (G * o + L) * y, E << 16 - y);
+            }
+          return;
+        }
+        if (o * v * 1.5 == u) {
+          for (var Y = 0; Y < u; Y += 3) {
+            var O = r[l + Y + 0], N = r[l + Y + 1], A = r[l + Y + 2];
+            w[d + Y] = N << 4 | O >>> 4, w[d + Y + 1] = O << 4 | A >>> 4, w[d + Y + 2] = A << 4 | N >>> 4;
+          }
+          return;
+        }
+        var P = /* @__PURE__ */ new Uint16Array(16), G, L, R, K, U, m, j, re, X, Y, le, oe = new Uint8Array(o + 1);
+        for (G = 0; G < v; G++) {
+          for (var ne = 0; ne < o; ne++) oe[ne] = r[l++];
+          for (le = 0, L = 0; L < o - 30; le += 16) {
+            for (K = 2047 & (R = _.readUint(oe, le)), U = 2047 & R >>> 11, m = 15 & R >>> 22, j = 15 & R >>> 26, re = 0; re < 4 && 128 << re <= K - U; re++) ;
+            for (X = 30, Y = 0; Y < 16; Y++) Y == m ? P[Y] = K : Y == j ? P[Y] = U : (P[Y] = ((_.readUshort(oe, le + (X >> 3)) >>> (X & 7) & 127) << re) + U, P[Y] > 2047 && (P[Y] = 2047), X += 7);
+            for (Y = 0; Y < 16; Y++, L += 2) {
+              var E = P[Y] << 1;
+              p.decode._putsF(w, (G * o + L) * y, E << 16 - y);
+            }
+            L -= L & 1 ? 1 : 31;
+          }
+        }
+      }, p.decode._decodeNikon = function(n, r, l, u, w, d, o) {
+        var v = [
+          [
+            0,
+            0,
+            1,
+            5,
+            1,
+            1,
+            1,
+            1,
+            1,
+            1,
+            2,
+            0,
+            0,
+            0,
+            0,
+            0,
+            0,
+            5,
+            4,
+            3,
+            6,
+            2,
+            7,
+            1,
+            0,
+            8,
+            9,
+            11,
+            10,
+            12
+          ],
+          [
+            0,
+            0,
+            1,
+            5,
+            1,
+            1,
+            1,
+            1,
+            1,
+            1,
+            2,
+            0,
+            0,
+            0,
+            0,
+            0,
+            0,
+            57,
+            90,
+            56,
+            39,
+            22,
+            5,
+            4,
+            3,
+            2,
+            1,
+            0,
+            11,
+            12,
+            12
+          ],
+          [
+            0,
+            0,
+            1,
+            4,
+            2,
+            3,
+            1,
+            2,
+            0,
+            0,
+            0,
+            0,
+            0,
+            0,
+            0,
+            0,
+            0,
+            5,
+            4,
+            6,
+            3,
+            7,
+            2,
+            8,
+            1,
+            9,
+            0,
+            10,
+            11,
+            12
+          ],
+          [
+            0,
+            0,
+            1,
+            4,
+            3,
+            1,
+            1,
+            1,
+            1,
+            1,
+            2,
+            0,
+            0,
+            0,
+            0,
+            0,
+            0,
+            5,
+            6,
+            4,
+            7,
+            8,
+            3,
+            9,
+            2,
+            1,
+            0,
+            10,
+            11,
+            12,
+            13,
+            14
+          ],
+          [
+            0,
+            0,
+            1,
+            5,
+            1,
+            1,
+            1,
+            1,
+            1,
+            1,
+            1,
+            2,
+            0,
+            0,
+            0,
+            0,
+            0,
+            8,
+            92,
+            75,
+            58,
+            41,
+            7,
+            6,
+            5,
+            4,
+            3,
+            2,
+            1,
+            0,
+            13,
+            14
+          ],
+          [
+            0,
+            0,
+            1,
+            4,
+            2,
+            2,
+            3,
+            1,
+            2,
+            0,
+            0,
+            0,
+            0,
+            0,
+            0,
+            0,
+            0,
+            7,
+            6,
+            8,
+            5,
+            9,
+            4,
+            10,
+            3,
+            11,
+            12,
+            2,
+            0,
+            1,
+            13,
+            14
+          ]
+        ], y = n.t256[0], _ = n.t257[0], b = n.t258[0], s = 0, h = 0, t = p.decode._make_decoder, c = p.decode._getbithuff, g = r[0].exifIFD.makerNote, x = g.t150 ? g.t150 : g.t140, B = 0, E = x[B++], O = x[B++];
+        (E == 73 || O == 88) && (B += 2110), E == 70 && (s = 2), b == 14 && (s += 3);
+        for (var N = [[0, 0], [0, 0]], A = n.isLE ? p._binLE : p._binBE, K = 0; K < 2; K++) for (var P = 0; P < 2; P++)
+          N[K][P] = A.readShort(x, B), B += 2;
+        var G = 1 << b & 32767, L = 0, R = A.readShort(x, B);
+        B += 2, R > 1 && (L = Math.floor(G / (R - 1))), E == 68 && O == 32 && L > 0 && (h = A.readShort(x, 562));
+        var K, U, m, j, re, X, Y = [0, 0], le = t(v[s]), oe = [
+          u,
+          0,
+          0,
+          0
+        ];
+        for (U = 0; U < _; U++)
+          for (h && U == h && (le = t(v[s + 1])), m = 0; m < y; m++) {
+            K = c(l, oe, le[0], le), j = K & 15, re = K >>> 4, X = (c(l, oe, j - re, 0) << 1) + 1 << re >>> 1, (X & 1 << j - 1) == 0 && (X -= (1 << j) - (re == 0 ? 1 : 0)), m < 2 ? Y[m] = N[U & 1][m] += X : Y[m & 1] += X;
+            var ne = Math.min(Math.max(Y[m & 1], 0), (1 << b) - 1), F = (U * y + m) * b;
+            p.decode._putsF(d, F, ne << 16 - b);
+          }
+      }, p.decode._putsF = function(n, r, l) {
+        l = l << 8 - (r & 7);
+        var u = r >>> 3;
+        n[u] |= l >>> 16, n[u + 1] |= l >>> 8, n[u + 2] |= l;
+      }, p.decode._getbithuff = function(n, r, l, u) {
+        var w = 0;
+        p.decode._get_byte;
+        var d, o = r[0], v = r[1], y = r[2], _ = r[3];
+        if (l == 0 || y < 0) return 0;
+        for (; !_ && y < l && (d = n[o++]) != -1 && !(_ = w && d == 255 && n[o++]); )
+          v = (v << 8) + d, y += 8;
+        if (d = v << 32 - y >>> 32 - l, u ? (y -= u[d + 1] >>> 8, d = u[d + 1] & 255) : y -= l, y < 0) throw "e";
+        return r[0] = o, r[1] = v, r[2] = y, r[3] = _, d;
+      }, p.decode._make_decoder = function(n) {
+        var r, l, u, w, d, o = [];
+        for (r = 16; r != 0 && !n[r]; r--) ;
+        var v = 17;
+        for (o[0] = r, u = l = 1; l <= r; l++) for (w = 0; w < n[l]; w++, ++v) for (d = 0; d < 1 << r - l; d++) u <= 1 << r && (o[u++] = l << 8 | n[v]);
+        return o;
+      }, p.decode._decodeNewJPEG = function(n, r, l, u, w, d) {
+        var o = n.t347, v = o ? o.length : 0, y = new Uint8Array(v + u);
+        if (o) {
+          for (var _ = 216, b = 217, s = 0, h = 0; h < v - 1 && !(o[h] == 255 && o[h + 1] == b); h++)
+            y[s++] = o[h];
+          var t = r[l], c = r[l + 1];
+          (t != 255 || c != _) && (y[s++] = t, y[s++] = c);
+          for (var h = 2; h < u; h++) y[s++] = r[l + h];
+        } else for (var h = 0; h < u; h++) y[h] = r[l + h];
+        if (n.t262[0] == 32803 || n.t262[0] == 34892) {
+          var g = n.t258[0], x = p.LosslessJpegDecode(y), B = x.length;
+          if (g == 16)
+            if (n.isLE) for (var h = 0; h < B; h++)
+              w[d + (h << 1)] = x[h] & 255, w[d + (h << 1) + 1] = x[h] >>> 8;
+            else for (var h = 0; h < B; h++)
+              w[d + (h << 1)] = x[h] >>> 8, w[d + (h << 1) + 1] = x[h] & 255;
+          else if (g == 14 || g == 12)
+            for (var E = 16 - g, h = 0; h < B; h++) p.decode._putsF(w, h * g, x[h] << E);
+          else throw new Error("unsupported bit depth " + g);
+        } else {
+          var O = new p.JpegDecoder();
+          O.parse(y);
+          for (var N = O.getData(O.width, O.height), h = 0; h < N.length; h++) w[d + h] = N[h];
+        }
+        n.t262[0] == 6 && (n.t262[0] = 2);
+      }, p.decode._decodeOldJPEGInit = function(n, r, l, u) {
+        var w = 216, d = 219, o = 196, v = 221, y = 192, _ = 218, b = 0, s = 0, h, t, c = !1, g, x, B, E = n.t513, O = E ? E[0] : 0, N = n.t514, A = N ? N[0] : 0, P = n.t324 || n.t273 || E, G = n.t530, L = 0, R = 0, K = n.t277 ? n.t277[0] : 1, U = n.t515;
+        if (P && (s = P[0], c = P.length > 1), !c) {
+          if (r[l] == 255 && r[l + 1] == w) return { jpegOffset: l };
+          if (E != null && (r[l + O] == 255 && r[l + O + 1] == w ? b = l + O : T("JPEGInterchangeFormat does not point to SOI"), N == null ? T("JPEGInterchangeFormatLength field is missing") : (O >= s || O + A <= s) && T("JPEGInterchangeFormatLength field value is invalid"), b != null))
+            return { jpegOffset: b };
+        }
+        if (G != null && (L = G[0], R = G[1]), E != null && N != null)
+          if (A >= 2 && O + A <= s) {
+            for (r[l + O + A - 2] == 255 && r[l + O + A - 1] == w ? h = new Uint8Array(A - 2) : h = new Uint8Array(A), g = 0; g < h.length; g++) h[g] = r[l + O + g];
+            T("Incorrect JPEG interchange format: using JPEGInterchangeFormat offset to derive tables");
+          } else T("JPEGInterchangeFormat+JPEGInterchangeFormatLength > offset to first strip or tile");
+        if (h == null) {
+          var m = 0, j = [];
+          j[m++] = 255, j[m++] = w;
+          var re = n.t519;
+          if (re == null) throw new Error("JPEGQTables tag is missing");
+          for (g = 0; g < re.length; g++)
+            for (j[m++] = 255, j[m++] = d, j[m++] = 0, j[m++] = 67, j[m++] = g, x = 0; x < 64; x++) j[m++] = r[l + re[g] + x];
+          for (B = 0; B < 2; B++) {
+            var X = n[B == 0 ? "t520" : "t521"];
+            if (X == null) throw new Error((B == 0 ? "JPEGDCTables" : "JPEGACTables") + " tag is missing");
+            for (g = 0; g < X.length; g++) {
+              j[m++] = 255, j[m++] = o;
+              var Y = 19;
+              for (x = 0; x < 16; x++) Y += r[l + X[g] + x];
+              for (j[m++] = Y >>> 8, j[m++] = Y & 255, j[m++] = g | B << 4, x = 0; x < 16; x++) j[m++] = r[l + X[g] + x];
+              for (x = 0; x < Y; x++) j[m++] = r[l + X[g] + 16 + x];
+            }
+          }
+          if (j[m++] = 255, j[m++] = y, j[m++] = 0, j[m++] = 8 + 3 * K, j[m++] = 8, j[m++] = n.height >>> 8 & 255, j[m++] = n.height & 255, j[m++] = n.width >>> 8 & 255, j[m++] = n.width & 255, j[m++] = K, K == 1)
+            j[m++] = 1, j[m++] = 17, j[m++] = 0;
+          else for (g = 0; g < 3; g++)
+            j[m++] = g + 1, j[m++] = g != 0 ? 17 : (L & 15) << 4 | R & 15, j[m++] = g;
+          U != null && U[0] != 0 && (j[m++] = 255, j[m++] = v, j[m++] = 0, j[m++] = 4, j[m++] = U[0] >>> 8 & 255, j[m++] = U[0] & 255), h = new Uint8Array(j);
+        }
+        var le = -1;
+        for (g = 0; g < h.length - 1; ) {
+          if (h[g] == 255 && h[g + 1] == y) {
+            le = g;
+            break;
+          }
+          g++;
+        }
+        if (le == -1) {
+          var oe = new Uint8Array(h.length + 10 + 3 * K);
+          oe.set(h);
+          var ne = h.length;
+          if (le = h.length, h = oe, h[ne++] = 255, h[ne++] = y, h[ne++] = 0, h[ne++] = 8 + 3 * K, h[ne++] = 8, h[ne++] = n.height >>> 8 & 255, h[ne++] = n.height & 255, h[ne++] = n.width >>> 8 & 255, h[ne++] = n.width & 255, h[ne++] = K, K == 1)
+            h[ne++] = 1, h[ne++] = 17, h[ne++] = 0;
+          else for (g = 0; g < 3; g++)
+            h[ne++] = g + 1, h[ne++] = g != 0 ? 17 : (L & 15) << 4 | R & 15, h[ne++] = g;
+        }
+        if (r[s] == 255 && r[s + 1] == _) {
+          var F = r[s + 2] << 8 | r[s + 3];
+          for (t = new Uint8Array(F + 2), t[0] = r[s], t[1] = r[s + 1], t[2] = r[s + 2], t[3] = r[s + 3], g = 0; g < F - 2; g++) t[g + 4] = r[s + g + 4];
+        } else {
+          t = new Uint8Array(8 + 2 * K);
+          var he = 0;
+          if (t[he++] = 255, t[he++] = _, t[he++] = 0, t[he++] = 6 + 2 * K, t[he++] = K, K == 1)
+            t[he++] = 1, t[he++] = 0;
+          else for (g = 0; g < 3; g++)
+            t[he++] = g + 1, t[he++] = g << 4 | g;
+          t[he++] = 0, t[he++] = 63, t[he++] = 0;
+        }
+        return {
+          jpegOffset: l,
+          tables: h,
+          sosMarker: t,
+          sofPosition: le
+        };
+      }, p.decode._decodeOldJPEG = function(n, r, l, u, w, d) {
+        var o, v, y, _, b, s = p.decode._decodeOldJPEGInit(n, r, l, u);
+        if (s.jpegOffset != null)
+          for (v = l + u - s.jpegOffset, _ = new Uint8Array(v), o = 0; o < v; o++) _[o] = r[s.jpegOffset + o];
+        else {
+          for (y = s.tables.length, _ = new Uint8Array(y + s.sosMarker.length + u + 2), _.set(s.tables), b = y, _[s.sofPosition + 5] = n.height >>> 8 & 255, _[s.sofPosition + 6] = n.height & 255, _[s.sofPosition + 7] = n.width >>> 8 & 255, _[s.sofPosition + 8] = n.width & 255, (r[l] != 255 || r[l + 1] != SOS) && (_.set(s.sosMarker, b), b += sosMarker.length), o = 0; o < u; o++) _[b++] = r[l + o];
+          _[b++] = 255, _[b++] = EOI;
+        }
+        var h = new p.JpegDecoder();
+        h.parse(_);
+        for (var t = h.getData(h.width, h.height), o = 0; o < t.length; o++) w[d + o] = t[o];
+        n.t262 && n.t262[0] == 6 && (n.t262[0] = 2);
+      }, p.decode._decodePackBits = function(n, r, l, u, w) {
+        for (var d = new Int8Array(n.buffer), o = new Int8Array(u.buffer), v = r + l; r < v; ) {
+          var y = d[r];
+          if (r++, y >= 0 && y < 128) for (var _ = 0; _ < y + 1; _++)
+            o[w] = d[r], w++, r++;
+          if (y >= -127 && y < 0) {
+            for (var _ = 0; _ < -y + 1; _++)
+              o[w] = d[r], w++;
+            r++;
+          }
+        }
+      }, p.decode._decodeThunder = function(n, r, l, u, w) {
+        for (var d = [
+          0,
+          1,
+          0,
+          -1
+        ], o = [
+          0,
+          1,
+          2,
+          3,
+          0,
+          -3,
+          -2,
+          -1
+        ], v = r + l, y = w * 2, _ = 0; r < v; ) {
+          var b = n[r], s = b >>> 6, h = b & 63;
+          if (r++, s == 3 && (_ = h & 15, u[y >>> 1] |= _ << 4 * (1 - y & 1), y++), s == 0) for (var t = 0; t < h; t++)
+            u[y >>> 1] |= _ << 4 * (1 - y & 1), y++;
+          if (s == 2) for (var t = 0; t < 2; t++) {
+            var c = h >>> 3 * (1 - t) & 7;
+            c != 4 && (_ += o[c], u[y >>> 1] |= _ << 4 * (1 - y & 1), y++);
+          }
+          if (s == 1) for (var t = 0; t < 3; t++) {
+            var c = h >>> 2 * (2 - t) & 3;
+            c != 2 && (_ += d[c], u[y >>> 1] |= _ << 4 * (1 - y & 1), y++);
+          }
+        }
+      }, p.decode._dmap = {
+        1: 0,
+        "011": 1,
+        "000011": 2,
+        "0000011": 3,
+        "010": -1,
+        "000010": -2,
+        "0000010": -3
+      }, p.decode._lens = (function() {
+        var n = function(y, _, b, s) {
+          for (var h = 0; h < _.length; h++) y[_[h]] = b + h * s;
+        }, r = "00110101,000111,0111,1000,1011,1100,1110,1111,10011,10100,00111,01000,001000,000011,110100,110101,101010,101011,0100111,0001100,0001000,0010111,0000011,0000100,0101000,0101011,0010011,0100100,0011000,00000010,00000011,00011010,00011011,00010010,00010011,00010100,00010101,00010110,00010111,00101000,00101001,00101010,00101011,00101100,00101101,00000100,00000101,00001010,00001011,01010010,01010011,01010100,01010101,00100100,00100101,01011000,01011001,01011010,01011011,01001010,01001011,00110010,00110011,00110100", l = "0000110111,010,11,10,011,0011,0010,00011,000101,000100,0000100,0000101,0000111,00000100,00000111,000011000,0000010111,0000011000,0000001000,00001100111,00001101000,00001101100,00000110111,00000101000,00000010111,00000011000,000011001010,000011001011,000011001100,000011001101,000001101000,000001101001,000001101010,000001101011,000011010010,000011010011,000011010100,000011010101,000011010110,000011010111,000001101100,000001101101,000011011010,000011011011,000001010100,000001010101,000001010110,000001010111,000001100100,000001100101,000001010010,000001010011,000000100100,000000110111,000000111000,000000100111,000000101000,000001011000,000001011001,000000101011,000000101100,000001011010,000001100110,000001100111", u = "11011,10010,010111,0110111,00110110,00110111,01100100,01100101,01101000,01100111,011001100,011001101,011010010,011010011,011010100,011010101,011010110,011010111,011011000,011011001,011011010,011011011,010011000,010011001,010011010,011000,010011011", w = "0000001111,000011001000,000011001001,000001011011,000000110011,000000110100,000000110101,0000001101100,0000001101101,0000001001010,0000001001011,0000001001100,0000001001101,0000001110010,0000001110011,0000001110100,0000001110101,0000001110110,0000001110111,0000001010010,0000001010011,0000001010100,0000001010101,0000001011010,0000001011011,0000001100100,0000001100101", d = "00000001000,00000001100,00000001101,000000010010,000000010011,000000010100,000000010101,000000010110,000000010111,000000011100,000000011101,000000011110,000000011111";
+        r = r.split(","), l = l.split(","), u = u.split(","), w = w.split(","), d = d.split(",");
+        var o = {}, v = {};
+        return n(o, r, 0, 1), n(o, u, 64, 64), n(o, d, 1792, 64), n(v, l, 0, 1), n(v, w, 64, 64), n(v, d, 1792, 64), [o, v];
+      })(), p.decode._decodeG4 = function(n, r, l, u, w, d, o) {
+        for (var v = p.decode, y = r << 3, _ = 0, b = "", s = [], h = [], t = 0; t < d; t++) h.push(0);
+        h = v._makeDiff(h);
+        for (var c = 0, g = 0, x = 0, B = 0, E = 0, O = 0, N = "", A = 0, P = Math.ceil(d / 8) * 8; y >>> 3 < r + l; ) {
+          x = v._findDiff(h, c + (c == 0 ? 0 : 1), 1 - E), B = v._findDiff(h, x, E);
+          var G = 0;
+          if (o == 1 && (G = n[y >>> 3] >>> 7 - (y & 7) & 1), o == 2 && (G = n[y >>> 3] >>> (y & 7) & 1), y++, b += G, N == "H") {
+            if (v._lens[E][b] != null) {
+              var L = v._lens[E][b];
+              b = "", _ += L, L < 64 && (v._addNtimes(s, _, E), c += _, E = 1 - E, _ = 0, A--, A == 0 && (N = ""));
+            }
+          } else
+            b == "0001" && (b = "", v._addNtimes(s, B - c, E), c = B), b == "001" && (b = "", N = "H", A = 2), v._dmap[b] != null && (g = x + v._dmap[b], v._addNtimes(s, g - c, E), c = g, b = "", E = 1 - E);
+          s.length == d && N == "" && (v._writeBits(s, u, w * 8 + O * P), E = 0, O++, c = 0, h = v._makeDiff(s), s = []);
+        }
+      }, p.decode._findDiff = function(n, r, l) {
+        for (var u = 0; u < n.length; u += 2) if (n[u] >= r && n[u + 1] == l) return n[u];
+      }, p.decode._makeDiff = function(n) {
+        var r = [];
+        n[0] == 1 && r.push(0, 1);
+        for (var l = 1; l < n.length; l++) n[l - 1] != n[l] && r.push(l, n[l]);
+        return r.push(n.length, 0, n.length, 1), r;
+      }, p.decode._decodeG3 = function(n, r, l, u, w, d, o) {
+        for (var v = p.decode, y = r << 3, _ = 0, b = "", s = [], h = [], t = 0; t < d; t++) s.push(0);
+        for (var c = 0, g = 0, x = 0, B = 0, E = 0, O = -1, N = "", A = 0, P = !1, G = Math.ceil(d / 8) * 8; y >>> 3 < r + l; ) {
+          x = v._findDiff(h, c + (c == 0 ? 0 : 1), 1 - E), B = v._findDiff(h, x, E);
+          var L = 0;
+          if (o == 1 && (L = n[y >>> 3] >>> 7 - (y & 7) & 1), o == 2 && (L = n[y >>> 3] >>> (y & 7) & 1), y++, b += L, P) {
+            if (v._lens[E][b] != null) {
+              var R = v._lens[E][b];
+              b = "", _ += R, R < 64 && (v._addNtimes(s, _, E), E = 1 - E, _ = 0);
+            }
+          } else if (N == "H") {
+            if (v._lens[E][b] != null) {
+              var R = v._lens[E][b];
+              b = "", _ += R, R < 64 && (v._addNtimes(s, _, E), c += _, E = 1 - E, _ = 0, A--, A == 0 && (N = ""));
+            }
+          } else
+            b == "0001" && (b = "", v._addNtimes(s, B - c, E), c = B), b == "001" && (b = "", N = "H", A = 2), v._dmap[b] != null && (g = x + v._dmap[b], v._addNtimes(s, g - c, E), c = g, b = "", E = 1 - E);
+          b.endsWith("000000000001") && (O >= 0 && v._writeBits(s, u, w * 8 + O * G), o == 1 && (P = (n[y >>> 3] >>> 7 - (y & 7) & 1) == 1), o == 2 && (P = (n[y >>> 3] >>> (y & 7) & 1) == 1), y++, v._decodeG3.allow2D == null && (v._decodeG3.allow2D = P), v._decodeG3.allow2D || (P = !0, y--), b = "", E = 0, O++, c = 0, h = v._makeDiff(s), s = []);
+        }
+        s.length == d && v._writeBits(s, u, w * 8 + O * G);
+      }, p.decode._addNtimes = function(n, r, l) {
+        for (var u = 0; u < r; u++) n.push(l);
+      }, p.decode._writeBits = function(n, r, l) {
+        for (var u = 0; u < n.length; u++) r[l + u >>> 3] |= n[u] << 7 - (l + u & 7);
+      }, p.decode._decodeLZW = function(n, r, l, u) {
+        if (p.decode._lzwTab == null) {
+          for (var w = /* @__PURE__ */ new Uint32Array(65535), d = /* @__PURE__ */ new Uint16Array(65535), b = /* @__PURE__ */ new Uint8Array(2e6), o = 0; o < 256; o++)
+            b[o << 2] = o, w[o] = o << 2, d[o] = 1;
+          p.decode._lzwTab = [
+            w,
+            d,
+            b
+          ];
+        }
+        for (var v = p.decode._copyData, y = p.decode._lzwTab[0], _ = p.decode._lzwTab[1], b = p.decode._lzwTab[2], s = 258, h = 1032, t = 9, c = r << 3, g = 256, x = 257, B = 0, E = 0, O = 0; B = n[c >>> 3] << 16 | n[c + 8 >>> 3] << 8 | n[c + 16 >>> 3], E = B >> 24 - (c & 7) - t & (1 << t) - 1, c += t, E != x; ) {
+          if (E == g) {
+            if (t = 9, s = 258, h = 1032, B = n[c >>> 3] << 16 | n[c + 8 >>> 3] << 8 | n[c + 16 >>> 3], E = B >> 24 - (c & 7) - t & (1 << t) - 1, c += t, E == x) break;
+            l[u] = E, u++;
+          } else if (E < s) {
+            var N = y[E], A = _[E];
+            if (v(b, N, l, u, A), u += A, O >= s)
+              y[s] = h, b[y[s]] = N[0], _[s] = 1, h = h + 1 + 3 & -4, s++;
+            else {
+              y[s] = h;
+              var P = y[O], G = _[O];
+              v(b, P, b, h, G), b[h + G] = b[N], G++, _[s] = G, s++, h = h + G + 3 & -4;
+            }
+            s + 1 == 1 << t && t++;
+          } else {
+            if (O >= s)
+              y[s] = h, _[s] = 0, s++;
+            else {
+              y[s] = h;
+              var P = y[O], G = _[O];
+              v(b, P, b, h, G), b[h + G] = b[h], G++, _[s] = G, s++, v(b, h, l, u, G), u += G, h = h + G + 3 & -4;
+            }
+            s + 1 == 1 << t && t++;
+          }
+          O = E;
+        }
+      }, p.decode._copyData = function(n, r, l, u, w) {
+        for (var d = 0; d < w; d += 4)
+          l[u + d] = n[r + d], l[u + d + 1] = n[r + d + 1], l[u + d + 2] = n[r + d + 2], l[u + d + 3] = n[r + d + 3];
+      }, p.tags = {}, p.ttypes = {
+        256: 3,
+        257: 3,
+        258: 3,
+        259: 3,
+        262: 3,
+        273: 4,
+        274: 3,
+        277: 3,
+        278: 4,
+        279: 4,
+        282: 5,
+        283: 5,
+        284: 3,
+        286: 5,
+        287: 5,
+        296: 3,
+        305: 2,
+        306: 2,
+        338: 3,
+        513: 4,
+        514: 4,
+        34665: 4
+      }, p._readIFD = function(n, r, l, u, w, d) {
+        var o = n.readUshort(r, l);
+        l += 2;
+        var v = {};
+        u.push(v), d && T("   ".repeat(w), u.length - 1, ">>>----------------");
+        for (var y = 0; y < o; y++) {
+          var _ = n.readUshort(r, l);
+          l += 2;
+          var b = n.readUshort(r, l);
+          l += 2;
+          var s = n.readUint(r, l);
+          l += 4;
+          var h = n.readUint(r, l);
+          l += 4;
+          var t = [];
+          if ((b == 1 || b == 7) && (t = new Uint8Array(r.buffer, s < 5 ? l - 4 : h, s)), b == 2) {
+            var c = s < 5 ? l - 4 : h;
+            r[c] < 128 ? t.push(n.readASCII(r, c, s - 1)) : t = new Uint8Array(r.buffer, c, s - 1);
+          }
+          if (b == 3) for (var g = 0; g < s; g++) t.push(n.readUshort(r, (s < 3 ? l - 4 : h) + 2 * g));
+          if (b == 4) for (var g = 0; g < s; g++) t.push(n.readUint(r, (s < 2 ? l - 4 : h) + 4 * g));
+          if (b == 5) for (var g = 0; g < s; g++) t.push(n.readUint(r, h + g * 8) / n.readUint(r, h + g * 8 + 4));
+          if (b == 8) for (var g = 0; g < s; g++) t.push(n.readShort(r, (s < 3 ? l - 4 : h) + 2 * g));
+          if (b == 9) for (var g = 0; g < s; g++) t.push(n.readInt(r, (s < 2 ? l - 4 : h) + 4 * g));
+          if (b == 10) for (var g = 0; g < s; g++) t.push(n.readInt(r, h + g * 8) / n.readInt(r, h + g * 8 + 4));
+          if (b == 11) for (var g = 0; g < s; g++) t.push(n.readFloat(r, h + g * 4));
+          if (b == 12) for (var g = 0; g < s; g++) t.push(n.readDouble(r, h + g * 8));
+          if (v["t" + _] = t, s != 0 && t.length == 0 && T("unknown TIFF tag type: ", b, "num:", s), d && T("   ".repeat(w), _, b, p.tags[_], t), !(_ == 330 && v.t272 && v.t272[0] == "DSLR-A100")) {
+            if (_ == 330 || _ == 34665 || _ == 50740 && n.readUshort(r, n.readUint(t, 0)) < 300) {
+              for (var x = _ == 50740 ? [n.readUint(t, 0)] : t, B = [], g = 0; g < x.length; g++) p._readIFD(n, r, x[g], B, w + 1, d);
+              _ == 330 && (v.subIFD = B), _ == 34665 && (v.exifIFD = B[0]), _ == 50740 && (v.dngPrvt = B[0]);
+            }
+          }
+          if (_ == 37500) {
+            var E = t;
+            if (n.readASCII(E, 0, 5) == "Nikon") v.makerNote = p.decode(E.slice(10).buffer)[0];
+            else if (n.readUshort(r, h) < 300) {
+              var O = [];
+              p._readIFD(n, r, h, O, w + 1, d), v.makerNote = O[0];
+            }
+          }
+        }
+        return d && T("   ".repeat(w), "<<<---------------"), l;
+      }, p._writeIFD = function(n, r, l, u) {
+        var w = Object.keys(u);
+        n.writeUshort(r, l, w.length), l += 2;
+        for (var d = l + w.length * 12 + 4, o = 0; o < w.length; o++) {
+          var v = w[o], y = parseInt(v.slice(1)), _ = p.ttypes[y];
+          if (_ == null) throw new Error("unknown type of tag: " + y);
+          var b = u[v];
+          _ == 2 && (b = b[0] + "\0");
+          var s = b.length;
+          n.writeUshort(r, l, y), l += 2, n.writeUshort(r, l, _), l += 2, n.writeUint(r, l, s), l += 4;
+          var h = [
+            -1,
+            1,
+            1,
+            2,
+            4,
+            8,
+            0,
+            0,
+            0,
+            0,
+            0,
+            0,
+            8
+          ][_] * s, t = l;
+          if (h > 4 && (n.writeUint(r, l, d), t = d), _ == 2 && n.writeASCII(r, t, b), _ == 3) for (var c = 0; c < s; c++) n.writeUshort(r, t + 2 * c, b[c]);
+          if (_ == 4) for (var c = 0; c < s; c++) n.writeUint(r, t + 4 * c, b[c]);
+          if (_ == 5) for (var c = 0; c < s; c++)
+            n.writeUint(r, t + 8 * c, Math.round(b[c] * 1e4)), n.writeUint(r, t + 8 * c + 4, 1e4);
+          if (_ == 12) for (var c = 0; c < s; c++) n.writeDouble(r, t + 8 * c, b[c]);
+          h > 4 && (h += h & 1, d += h), l += 4;
+        }
+        return [l, d];
+      }, p.toRGBA8 = function(n) {
+        var r = n.width, l = n.height, u = r * l, w = u * 4, d = n.data, o = new Uint8Array(u * 4), v = n.t262 ? n.t262[0] : 2, y = n.t258 ? Math.min(32, n.t258[0]) : 1;
+        if (v == 0)
+          for (var _ = Math.ceil(y * r / 8), b = 0; b < l; b++) {
+            var s = b * _, h = b * r;
+            if (y == 1) for (var t = 0; t < r; t++) {
+              var c = h + t << 2, g = d[s + (t >> 3)] >> 7 - (t & 7) & 1;
+              o[c] = o[c + 1] = o[c + 2] = (1 - g) * 255, o[c + 3] = 255;
+            }
+            if (y == 4) for (var t = 0; t < r; t++) {
+              var c = h + t << 2, g = d[s + (t >> 1)] >> 4 - 4 * (t & 1) & 15;
+              o[c] = o[c + 1] = o[c + 2] = (15 - g) * 17, o[c + 3] = 255;
+            }
+            if (y == 8) for (var t = 0; t < r; t++) {
+              var c = h + t << 2, g = d[s + t];
+              o[c] = o[c + 1] = o[c + 2] = 255 - g, o[c + 3] = 255;
+            }
+          }
+        else if (v == 1)
+          for (var _ = Math.ceil(y * r / 8), b = 0; b < l; b++) {
+            var s = b * _, h = b * r;
+            if (y == 1) for (var t = 0; t < r; t++) {
+              var c = h + t << 2, g = d[s + (t >> 3)] >> 7 - (t & 7) & 1;
+              o[c] = o[c + 1] = o[c + 2] = g * 255, o[c + 3] = 255;
+            }
+            if (y == 2) for (var t = 0; t < r; t++) {
+              var c = h + t << 2, g = d[s + (t >> 2)] >> 6 - 2 * (t & 3) & 3;
+              o[c] = o[c + 1] = o[c + 2] = g * 85, o[c + 3] = 255;
+            }
+            if (y == 8) for (var t = 0; t < r; t++) {
+              var c = h + t << 2, g = d[s + t];
+              o[c] = o[c + 1] = o[c + 2] = g, o[c + 3] = 255;
+            }
+            if (y == 16) for (var t = 0; t < r; t++) {
+              var c = h + t << 2, g = d[s + (2 * t + 1)];
+              o[c] = o[c + 1] = o[c + 2] = Math.min(255, g), o[c + 3] = 255;
+            }
+          }
+        else if (v == 2) {
+          var x = n.t258 ? n.t258.length : 3;
+          if (y == 8) {
+            if (x == 4) for (var t = 0; t < w; t++) o[t] = d[t];
+            if (x == 3) for (var t = 0; t < u; t++) {
+              var c = t << 2, B = t * 3;
+              o[c] = d[B], o[c + 1] = d[B + 1], o[c + 2] = d[B + 2], o[c + 3] = 255;
+            }
+          } else {
+            if (x == 4) for (var t = 0; t < u; t++) {
+              var c = t << 2, B = t * 8 + 1;
+              o[c] = d[B], o[c + 1] = d[B + 2], o[c + 2] = d[B + 4], o[c + 3] = d[B + 6];
+            }
+            if (x == 3) for (var t = 0; t < u; t++) {
+              var c = t << 2, B = t * 6 + 1;
+              o[c] = d[B], o[c + 1] = d[B + 2], o[c + 2] = d[B + 4], o[c + 3] = 255;
+            }
+          }
+        } else if (v == 3)
+          for (var E = n.t320, t = 0; t < u; t++) {
+            var c = t << 2, O = d[t];
+            o[c] = E[O] >> 8, o[c + 1] = E[256 + O] >> 8, o[c + 2] = E[512 + O] >> 8, o[c + 3] = 255;
+          }
+        else if (v == 5)
+          for (var x = n.t258 ? n.t258.length : 4, N = x > 4 ? 1 : 0, t = 0; t < u; t++) {
+            var c = t << 2, A = t * x, P = 255 - d[A], G = 255 - d[A + 1], L = 255 - d[A + 2], R = (255 - d[A + 3]) * (1 / 255);
+            o[c] = ~~(P * R + 0.5), o[c + 1] = ~~(G * R + 0.5), o[c + 2] = ~~(L * R + 0.5), o[c + 3] = 255 * (1 - N) + d[A + 4] * N;
+          }
+        else T("Unknown Photometric interpretation: " + v);
+        return o;
+      }, p.replaceIMG = function(n) {
+        n == null && (n = document.getElementsByTagName("img"));
+        for (var r = [
+          "tif",
+          "tiff",
+          "dng",
+          "cr2",
+          "nef"
+        ], l = 0; l < n.length; l++) {
+          var u = n[l], w = u.getAttribute("src");
+          if (w != null) {
+            var d = w.split(".").pop().toLowerCase();
+            if (r.indexOf(d) != -1) {
+              var o = new XMLHttpRequest();
+              p._xhrs.push(o), p._imgs.push(u), o.open("GET", w), o.responseType = "arraybuffer", o.onload = p._imgLoaded, o.send();
+            }
+          }
+        }
+      }, p._xhrs = [], p._imgs = [], p._imgLoaded = function(n) {
+        var r = n.target.response, l = p.decode(r), u = l, w = 0, d = u[0];
+        l[0].subIFD && (u = u.concat(l[0].subIFD));
+        for (var o = 0; o < u.length; o++) {
+          var h = u[o];
+          if (!(h.t258 == null || h.t258.length < 3)) {
+            var v = h.t256 * h.t257;
+            v > w && (w = v, d = h);
+          }
+        }
+        p.decodeImage(r, d, l);
+        var y = p.toRGBA8(d), _ = d.width, b = d.height, s = p._xhrs.indexOf(n.target), h = p._imgs[s];
+        p._xhrs.splice(s, 1), p._imgs.splice(s, 1);
+        var t = document.createElement("canvas");
+        t.width = _, t.height = b;
+        for (var c = t.getContext("2d"), g = c.createImageData(_, b), o = 0; o < y.length; o++) g.data[o] = y[o];
+        c.putImageData(g, 0, 0), h.setAttribute("src", t.toDataURL());
+      }, p._binBE = {
+        nextZero: function(n, r) {
+          for (; n[r] != 0; ) r++;
+          return r;
+        },
+        readUshort: function(n, r) {
+          return n[r] << 8 | n[r + 1];
+        },
+        readShort: function(n, r) {
+          var l = p._binBE.ui8;
+          return l[0] = n[r + 1], l[1] = n[r + 0], p._binBE.i16[0];
+        },
+        readInt: function(n, r) {
+          var l = p._binBE.ui8;
+          return l[0] = n[r + 3], l[1] = n[r + 2], l[2] = n[r + 1], l[3] = n[r + 0], p._binBE.i32[0];
+        },
+        readUint: function(n, r) {
+          var l = p._binBE.ui8;
+          return l[0] = n[r + 3], l[1] = n[r + 2], l[2] = n[r + 1], l[3] = n[r + 0], p._binBE.ui32[0];
+        },
+        readASCII: function(n, r, l) {
+          for (var u = "", w = 0; w < l; w++) u += String.fromCharCode(n[r + w]);
+          return u;
+        },
+        readFloat: function(n, r) {
+          for (var l = p._binBE.ui8, u = 0; u < 4; u++) l[u] = n[r + 3 - u];
+          return p._binBE.fl32[0];
+        },
+        readDouble: function(n, r) {
+          for (var l = p._binBE.ui8, u = 0; u < 8; u++) l[u] = n[r + 7 - u];
+          return p._binBE.fl64[0];
+        },
+        writeUshort: function(n, r, l) {
+          n[r] = l >> 8 & 255, n[r + 1] = l & 255;
+        },
+        writeUint: function(n, r, l) {
+          n[r] = l >> 24 & 255, n[r + 1] = l >> 16 & 255, n[r + 2] = l >> 8 & 255, n[r + 3] = l >> 0 & 255;
+        },
+        writeASCII: function(n, r, l) {
+          for (var u = 0; u < l.length; u++) n[r + u] = l.charCodeAt(u);
+        },
+        writeDouble: function(n, r, l) {
+          p._binBE.fl64[0] = l;
+          for (var u = 0; u < 8; u++) n[r + u] = p._binBE.ui8[7 - u];
+        }
+      }, p._binBE.ui8 = /* @__PURE__ */ new Uint8Array(8), p._binBE.i16 = new Int16Array(p._binBE.ui8.buffer), p._binBE.i32 = new Int32Array(p._binBE.ui8.buffer), p._binBE.ui32 = new Uint32Array(p._binBE.ui8.buffer), p._binBE.fl32 = new Float32Array(p._binBE.ui8.buffer), p._binBE.fl64 = new Float64Array(p._binBE.ui8.buffer), p._binLE = {
+        nextZero: p._binBE.nextZero,
+        readUshort: function(n, r) {
+          return n[r + 1] << 8 | n[r];
+        },
+        readShort: function(n, r) {
+          var l = p._binBE.ui8;
+          return l[0] = n[r + 0], l[1] = n[r + 1], p._binBE.i16[0];
+        },
+        readInt: function(n, r) {
+          var l = p._binBE.ui8;
+          return l[0] = n[r + 0], l[1] = n[r + 1], l[2] = n[r + 2], l[3] = n[r + 3], p._binBE.i32[0];
+        },
+        readUint: function(n, r) {
+          var l = p._binBE.ui8;
+          return l[0] = n[r + 0], l[1] = n[r + 1], l[2] = n[r + 2], l[3] = n[r + 3], p._binBE.ui32[0];
+        },
+        readASCII: p._binBE.readASCII,
+        readFloat: function(n, r) {
+          for (var l = p._binBE.ui8, u = 0; u < 4; u++) l[u] = n[r + u];
+          return p._binBE.fl32[0];
+        },
+        readDouble: function(n, r) {
+          for (var l = p._binBE.ui8, u = 0; u < 8; u++) l[u] = n[r + u];
+          return p._binBE.fl64[0];
+        }
+      }, p._copyTile = function(n, r, l, u, w, d, o, v) {
+        for (var y = Math.min(r, w - o), _ = Math.min(l, d - v), b = 0; b < _; b++)
+          for (var s = (v + b) * w + o, h = b * r, t = 0; t < y; t++) u[s + t] = n[h + t];
+      }, p.LosslessJpegDecode = (function() {
+        function n(w) {
+          this.w = w, this.N = 0, this._ = 0, this.G = 0;
+        }
+        n.prototype = {
+          t: function(w) {
+            this.N = Math.max(0, Math.min(this.w.length, w));
+          },
+          i: function() {
+            return this.w[this.N++];
+          },
+          l: function() {
+            var w = this.N;
+            return this.N += 2, this.w[w] << 8 | this.w[w + 1];
+          },
+          J: function() {
+            return this._ == 0 && (this.G = this.w[this.N], this.N += 1 + (this.G + 1 >>> 8), this._ = 8), this.G >>> --this._ & 1;
+          },
+          Z: function(w) {
+            var d = this._, o = this.G, v = Math.min(d, w);
+            w -= v, d -= v;
+            for (var y = o >>> d & (1 << v) - 1; w > 0; )
+              o = this.w[this.N], this.N += 1 + (o + 1 >>> 8), v = Math.min(8, w), w -= v, d = 8 - v, y <<= v, y |= o >>> d & (1 << v) - 1;
+            return this._ = d, this.G = o, y;
+          }
+        };
+        var r = {};
+        r.X = function() {
+          return [
+            0,
+            0,
+            -1
+          ];
+        }, r.s = function(w, d, o) {
+          w[r.Y(w, 0, o) + 2] = d;
+        }, r.Y = function(w, d, o) {
+          if (w[d + 2] != -1) return 0;
+          if (o == 0) return d;
+          for (var v = 0; v < 2; v++) {
+            w[d + v] == 0 && (w[d + v] = w.length, w.push(0), w.push(0), w.push(-1));
+            var y = r.Y(w, w[d + v], o - 1);
+            if (y != 0) return y;
+          }
+          return 0;
+        }, r.B = function(w, d) {
+          for (var o = 0, v = 0, y = 0, _ = d._, b = d.G, s = d.N; ; )
+            if (_ == 0 && (b = d.w[s], s += 1 + (b + 1 >>> 8), _ = 8), y = b >>> --_ & 1, o = w[o + y], v = w[o + 2], v != -1)
+              return d._ = _, d.G = b, d.N = s, v;
+          return -1;
+        };
+        function l(w) {
+          this.z = new n(w), this.D(this.z);
+        }
+        l.prototype = {
+          $: function(w, d) {
+            this.Q = w.i(), this.F = w.l(), this.o = w.l();
+            var o = this.O = w.i();
+            this.L = [];
+            for (var v = 0; v < o; v++) {
+              var y = w.i();
+              w.i(), w.i(), this.L[y] = v;
+            }
+            w.t(w.N + d - (6 + o * 3));
+          },
+          e: function() {
+            var w = 0, d = this.z.i();
+            this.H == null && (this.H = {});
+            for (var o = this.H[d] = r.X(), v = [], y = 0; y < 16; y++)
+              v[y] = this.z.i(), w += v[y];
+            for (var y = 0; y < 16; y++) for (var _ = 0; _ < v[y]; _++) r.s(o, this.z.i(), y + 1);
+            return w + 17;
+          },
+          W: function(w) {
+            for (; w > 0; ) w -= this.e();
+          },
+          p: function(w, d) {
+            var o = w.i();
+            this.U || (this.U = []);
+            for (var v = 0; v < o; v++) {
+              var y = w.i(), _ = w.i();
+              this.U[this.L[y]] = this.H[_ >>> 4];
+            }
+            this.g = w.i(), w.t(w.N + d - (2 + o * 2));
+          },
+          D: function(w) {
+            var d = !1, o = w.l();
+            if (o === l.q)
+              do {
+                var o = w.l(), v = w.l() - 2;
+                switch (o) {
+                  case l.m:
+                    this.$(w, v);
+                    break;
+                  case l.K:
+                    this.W(v);
+                    break;
+                  case l.V:
+                    this.p(w, v), d = !0;
+                    break;
+                  default:
+                    w.t(w.N + v);
+                }
+              } while (!d);
+          },
+          I: function(w, d) {
+            var o = r.B(d, w);
+            if (o == 16) return -32768;
+            var v = w.Z(o);
+            return (v & 1 << o - 1) == 0 && (v -= (1 << o) - 1), v;
+          },
+          B: function(w, d) {
+            for (var o = this.z, v = this.O, y = this.F, _ = this.I, b = this.g, s = this.o * v, h = this.U, t = 0; t < v; t++) w[t] = _(o, h[t]) + (1 << this.Q - 1);
+            for (var c = v; c < s; c += v) for (var t = 0; t < v; t++) w[c + t] = _(o, h[t]) + w[c + t - v];
+            for (var g = d, x = 1; x < y; x++) {
+              for (var t = 0; t < v; t++) w[g + t] = _(o, h[t]) + w[g + t - d];
+              for (var c = v; c < s; c += v) for (var t = 0; t < v; t++) {
+                var B = g + c + t, E = w[B - v];
+                b == 6 && (E = w[B - d] + (E - w[B - v - d] >>> 1)), w[B] = E + _(o, h[t]);
+              }
+              g += d;
+            }
+          }
+        }, l.m = 65475, l.K = 65476, l.q = 65496, l.V = 65498;
+        function u(w) {
+          var d = new l(w), o = new (d.Q > 8 ? Uint16Array : Uint8Array)(d.o * d.F * d.O), v = d.o * d.O;
+          return d.B(o, v), o;
+        }
+        return u;
+      })();
+    })(ee, te);
+  })();
+})), v0 = _0();
+export {
+  v0 as default
+};