@brftech/filex 0.1.56

package/dist/UTIF-DSbsvqXu.js

@@ -0,0 +1,3104 @@
+import { g as M0 } from "./_commonjsHelpers-DaMA6jEr.js";
+function C0(K, ae) {
+  for (var ne = 0; ne < ae.length; ne++) {
+    const G = ae[ne];
+    if (typeof G != "string" && !Array.isArray(G)) {
+      for (const y in G)
+        if (y !== "default" && !(y in K)) {
+          const J = Object.getOwnPropertyDescriptor(G, y);
+          J && Object.defineProperty(K, y, J.get ? J : {
+            enumerable: !0,
+            get: () => G[y]
+          });
+        }
+    }
+  }
+  return Object.freeze(Object.defineProperty(K, Symbol.toStringTag, { value: "Module" }));
+}
+function m0(K) {
+  throw new Error('Could not dynamically require "' + K + '". Please configure the dynamicRequireTargets or/and ignoreDynamicRequires option of @rollup/plugin-commonjs appropriately for this require call to work.');
+}
+var D0 = { exports: {} }, qe = {}, _0;
+function Je() {
+  return _0 || (_0 = 1, function(K) {
+    var ae = typeof Uint8Array < "u" && typeof Uint16Array < "u" && typeof Int32Array < "u";
+    function ne(J, t) {
+      return Object.prototype.hasOwnProperty.call(J, t);
+    }
+    K.assign = function(J) {
+      for (var t = Array.prototype.slice.call(arguments, 1); t.length; ) {
+        var r = t.shift();
+        if (r) {
+          if (typeof r != "object")
+            throw new TypeError(r + "must be non-object");
+          for (var i in r)
+            ne(r, i) && (J[i] = r[i]);
+        }
+      }
+      return J;
+    }, K.shrinkBuf = function(J, t) {
+      return J.length === t ? J : J.subarray ? J.subarray(0, t) : (J.length = t, J);
+    };
+    var G = {
+      arraySet: function(J, t, r, i, b) {
+        if (t.subarray && J.subarray) {
+          J.set(t.subarray(r, r + i), b);
+          return;
+        }
+        for (var v = 0; v < i; v++)
+          J[b + v] = t[r + v];
+      },
+      // Join array of chunks to single array.
+      flattenChunks: function(J) {
+        var t, r, i, b, v, d;
+        for (i = 0, t = 0, r = J.length; t < r; t++)
+          i += J[t].length;
+        for (d = new Uint8Array(i), b = 0, t = 0, r = J.length; t < r; t++)
+          v = J[t], d.set(v, b), b += v.length;
+        return d;
+      }
+    }, y = {
+      arraySet: function(J, t, r, i, b) {
+        for (var v = 0; v < i; v++)
+          J[b + v] = t[r + v];
+      },
+      // Join array of chunks to single array.
+      flattenChunks: function(J) {
+        return [].concat.apply([], J);
+      }
+    };
+    K.setTyped = function(J) {
+      J ? (K.Buf8 = Uint8Array, K.Buf16 = Uint16Array, K.Buf32 = Int32Array, K.assign(K, G)) : (K.Buf8 = Array, K.Buf16 = Array, K.Buf32 = Array, K.assign(K, y));
+    }, K.setTyped(ae);
+  }(qe)), qe;
+}
+var $e = {}, Ce = {}, Ke = {}, d0;
+function Z0() {
+  if (d0) return Ke;
+  d0 = 1;
+  var K = Je(), ae = 4, ne = 0, G = 1, y = 2;
+  function J(h) {
+    for (var j = h.length; --j >= 0; )
+      h[j] = 0;
+  }
+  var t = 0, r = 1, i = 2, b = 3, v = 258, d = 29, l = 256, s = l + 1 + d, x = 30, _ = 19, u = 2 * s + 1, c = 15, o = 16, n = 7, w = 256, g = 16, p = 17, E = 18, A = (
+    /* extra bits for each length code */
+    [0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 5, 5, 5, 5, 0]
+  ), N = (
+    /* extra bits for each distance code */
+    [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]
+  ), D = (
+    /* extra bits for each bit length code */
+    [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 3, 7]
+  ), B = [16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15], P = 512, M = new Array((s + 2) * 2);
+  J(M);
+  var Z = new Array(x * 2);
+  J(Z);
+  var H = new Array(P);
+  J(H);
+  var X = new Array(v - b + 1);
+  J(X);
+  var W = new Array(d);
+  J(W);
+  var C = new Array(x);
+  J(C);
+  function m(h, j, Y, q, S) {
+    this.static_tree = h, this.extra_bits = j, this.extra_base = Y, this.elems = q, this.max_length = S, this.has_stree = h && h.length;
+  }
+  var ie, T, F;
+  function $(h, j) {
+    this.dyn_tree = h, this.max_code = 0, this.stat_desc = j;
+  }
+  function ve(h) {
+    return h < 256 ? H[h] : H[256 + (h >>> 7)];
+  }
+  function fe(h, j) {
+    h.pending_buf[h.pending++] = j & 255, h.pending_buf[h.pending++] = j >>> 8 & 255;
+  }
+  function le(h, j, Y) {
+    h.bi_valid > o - Y ? (h.bi_buf |= j << h.bi_valid & 65535, fe(h, h.bi_buf), h.bi_buf = j >> o - h.bi_valid, h.bi_valid += Y - o) : (h.bi_buf |= j << h.bi_valid & 65535, h.bi_valid += Y);
+  }
+  function he(h, j, Y) {
+    le(
+      h,
+      Y[j * 2],
+      Y[j * 2 + 1]
+      /*.Len*/
+    );
+  }
+  function de(h, j) {
+    var Y = 0;
+    do
+      Y |= h & 1, h >>>= 1, Y <<= 1;
+    while (--j > 0);
+    return Y >>> 1;
+  }
+  function ge(h) {
+    h.bi_valid === 16 ? (fe(h, h.bi_buf), h.bi_buf = 0, h.bi_valid = 0) : h.bi_valid >= 8 && (h.pending_buf[h.pending++] = h.bi_buf & 255, h.bi_buf >>= 8, h.bi_valid -= 8);
+  }
+  function ze(h, j) {
+    var Y = j.dyn_tree, q = j.max_code, S = j.stat_desc.static_tree, L = j.stat_desc.has_stree, a = j.stat_desc.extra_bits, I = j.stat_desc.extra_base, te = j.stat_desc.max_length, e, R, O, f, k, z, re = 0;
+    for (f = 0; f <= c; f++)
+      h.bl_count[f] = 0;
+    for (Y[h.heap[h.heap_max] * 2 + 1] = 0, e = h.heap_max + 1; e < u; e++)
+      R = h.heap[e], f = Y[Y[R * 2 + 1] * 2 + 1] + 1, f > te && (f = te, re++), Y[R * 2 + 1] = f, !(R > q) && (h.bl_count[f]++, k = 0, R >= I && (k = a[R - I]), z = Y[R * 2], h.opt_len += z * (f + k), L && (h.static_len += z * (S[R * 2 + 1] + k)));
+    if (re !== 0) {
+      do {
+        for (f = te - 1; h.bl_count[f] === 0; )
+          f--;
+        h.bl_count[f]--, h.bl_count[f + 1] += 2, h.bl_count[te]--, re -= 2;
+      } while (re > 0);
+      for (f = te; f !== 0; f--)
+        for (R = h.bl_count[f]; R !== 0; )
+          O = h.heap[--e], !(O > q) && (Y[O * 2 + 1] !== f && (h.opt_len += (f - Y[O * 2 + 1]) * Y[O * 2], Y[O * 2 + 1] = f), R--);
+    }
+  }
+  function ke(h, j, Y) {
+    var q = new Array(c + 1), S = 0, L, a;
+    for (L = 1; L <= c; L++)
+      q[L] = S = S + Y[L - 1] << 1;
+    for (a = 0; a <= j; a++) {
+      var I = h[a * 2 + 1];
+      I !== 0 && (h[a * 2] = de(q[I]++, I));
+    }
+  }
+  function ce() {
+    var h, j, Y, q, S, L = new Array(c + 1);
+    for (Y = 0, q = 0; q < d - 1; q++)
+      for (W[q] = Y, h = 0; h < 1 << A[q]; h++)
+        X[Y++] = q;
+    for (X[Y - 1] = q, S = 0, q = 0; q < 16; q++)
+      for (C[q] = S, h = 0; h < 1 << N[q]; h++)
+        H[S++] = q;
+    for (S >>= 7; q < x; q++)
+      for (C[q] = S << 7, h = 0; h < 1 << N[q] - 7; h++)
+        H[256 + S++] = q;
+    for (j = 0; j <= c; j++)
+      L[j] = 0;
+    for (h = 0; h <= 143; )
+      M[h * 2 + 1] = 8, h++, L[8]++;
+    for (; h <= 255; )
+      M[h * 2 + 1] = 9, h++, L[9]++;
+    for (; h <= 279; )
+      M[h * 2 + 1] = 7, h++, L[7]++;
+    for (; h <= 287; )
+      M[h * 2 + 1] = 8, h++, L[8]++;
+    for (ke(M, s + 1, L), h = 0; h < x; h++)
+      Z[h * 2 + 1] = 5, Z[h * 2] = de(h, 5);
+    ie = new m(M, A, l + 1, s, c), T = new m(Z, N, 0, x, c), F = new m(new Array(0), D, 0, _, n);
+  }
+  function Se(h) {
+    var j;
+    for (j = 0; j < s; j++)
+      h.dyn_ltree[j * 2] = 0;
+    for (j = 0; j < x; j++)
+      h.dyn_dtree[j * 2] = 0;
+    for (j = 0; j < _; j++)
+      h.bl_tree[j * 2] = 0;
+    h.dyn_ltree[w * 2] = 1, h.opt_len = h.static_len = 0, h.last_lit = h.matches = 0;
+  }
+  function me(h) {
+    h.bi_valid > 8 ? fe(h, h.bi_buf) : h.bi_valid > 0 && (h.pending_buf[h.pending++] = h.bi_buf), h.bi_buf = 0, h.bi_valid = 0;
+  }
+  function Re(h, j, Y, q) {
+    me(h), fe(h, Y), fe(h, ~Y), K.arraySet(h.pending_buf, h.window, j, Y, h.pending), h.pending += Y;
+  }
+  function oe(h, j, Y, q) {
+    var S = j * 2, L = Y * 2;
+    return h[S] < h[L] || h[S] === h[L] && q[j] <= q[Y];
+  }
+  function V(h, j, Y) {
+    for (var q = h.heap[Y], S = Y << 1; S <= h.heap_len && (S < h.heap_len && oe(j, h.heap[S + 1], h.heap[S], h.depth) && S++, !oe(j, q, h.heap[S], h.depth)); )
+      h.heap[Y] = h.heap[S], Y = S, S <<= 1;
+    h.heap[Y] = q;
+  }
+  function ee(h, j, Y) {
+    var q, S, L = 0, a, I;
+    if (h.last_lit !== 0)
+      do
+        q = h.pending_buf[h.d_buf + L * 2] << 8 | h.pending_buf[h.d_buf + L * 2 + 1], S = h.pending_buf[h.l_buf + L], L++, q === 0 ? he(h, S, j) : (a = X[S], he(h, a + l + 1, j), I = A[a], I !== 0 && (S -= W[a], le(h, S, I)), q--, a = ve(q), he(h, a, Y), I = N[a], I !== 0 && (q -= C[a], le(h, q, I)));
+      while (L < h.last_lit);
+    he(h, w, j);
+  }
+  function _e(h, j) {
+    var Y = j.dyn_tree, q = j.stat_desc.static_tree, S = j.stat_desc.has_stree, L = j.stat_desc.elems, a, I, te = -1, e;
+    for (h.heap_len = 0, h.heap_max = u, a = 0; a < L; a++)
+      Y[a * 2] !== 0 ? (h.heap[++h.heap_len] = te = a, h.depth[a] = 0) : Y[a * 2 + 1] = 0;
+    for (; h.heap_len < 2; )
+      e = h.heap[++h.heap_len] = te < 2 ? ++te : 0, Y[e * 2] = 1, h.depth[e] = 0, h.opt_len--, S && (h.static_len -= q[e * 2 + 1]);
+    for (j.max_code = te, a = h.heap_len >> 1; a >= 1; a--)
+      V(h, Y, a);
+    e = L;
+    do
+      a = h.heap[
+        1
+        /*SMALLEST*/
+      ], h.heap[
+        1
+        /*SMALLEST*/
+      ] = h.heap[h.heap_len--], V(
+        h,
+        Y,
+        1
+        /*SMALLEST*/
+      ), I = h.heap[
+        1
+        /*SMALLEST*/
+      ], h.heap[--h.heap_max] = a, h.heap[--h.heap_max] = I, Y[e * 2] = Y[a * 2] + Y[I * 2], h.depth[e] = (h.depth[a] >= h.depth[I] ? h.depth[a] : h.depth[I]) + 1, Y[a * 2 + 1] = Y[I * 2 + 1] = e, h.heap[
+        1
+        /*SMALLEST*/
+      ] = e++, V(
+        h,
+        Y,
+        1
+        /*SMALLEST*/
+      );
+    while (h.heap_len >= 2);
+    h.heap[--h.heap_max] = h.heap[
+      1
+      /*SMALLEST*/
+    ], ze(h, j), ke(Y, te, h.bl_count);
+  }
+  function we(h, j, Y) {
+    var q, S = -1, L, a = j[0 * 2 + 1], I = 0, te = 7, e = 4;
+    for (a === 0 && (te = 138, e = 3), j[(Y + 1) * 2 + 1] = 65535, q = 0; q <= Y; q++)
+      L = a, a = j[(q + 1) * 2 + 1], !(++I < te && L === a) && (I < e ? h.bl_tree[L * 2] += I : L !== 0 ? (L !== S && h.bl_tree[L * 2]++, h.bl_tree[g * 2]++) : I <= 10 ? h.bl_tree[p * 2]++ : h.bl_tree[E * 2]++, I = 0, S = L, a === 0 ? (te = 138, e = 3) : L === a ? (te = 6, e = 3) : (te = 7, e = 4));
+  }
+  function be(h, j, Y) {
+    var q, S = -1, L, a = j[0 * 2 + 1], I = 0, te = 7, e = 4;
+    for (a === 0 && (te = 138, e = 3), q = 0; q <= Y; q++)
+      if (L = a, a = j[(q + 1) * 2 + 1], !(++I < te && L === a)) {
+        if (I < e)
+          do
+            he(h, L, h.bl_tree);
+          while (--I !== 0);
+        else L !== 0 ? (L !== S && (he(h, L, h.bl_tree), I--), he(h, g, h.bl_tree), le(h, I - 3, 2)) : I <= 10 ? (he(h, p, h.bl_tree), le(h, I - 3, 3)) : (he(h, E, h.bl_tree), le(h, I - 11, 7));
+        I = 0, S = L, a === 0 ? (te = 138, e = 3) : L === a ? (te = 6, e = 3) : (te = 7, e = 4);
+      }
+  }
+  function Ae(h) {
+    var j;
+    for (we(h, h.dyn_ltree, h.l_desc.max_code), we(h, h.dyn_dtree, h.d_desc.max_code), _e(h, h.bl_desc), j = _ - 1; j >= 3 && h.bl_tree[B[j] * 2 + 1] === 0; j--)
+      ;
+    return h.opt_len += 3 * (j + 1) + 5 + 5 + 4, j;
+  }
+  function We(h, j, Y, q) {
+    var S;
+    for (le(h, j - 257, 5), le(h, Y - 1, 5), le(h, q - 4, 4), S = 0; S < q; S++)
+      le(h, h.bl_tree[B[S] * 2 + 1], 3);
+    be(h, h.dyn_ltree, j - 1), be(h, h.dyn_dtree, Y - 1);
+  }
+  function je(h) {
+    var j = 4093624447, Y;
+    for (Y = 0; Y <= 31; Y++, j >>>= 1)
+      if (j & 1 && h.dyn_ltree[Y * 2] !== 0)
+        return ne;
+    if (h.dyn_ltree[9 * 2] !== 0 || h.dyn_ltree[10 * 2] !== 0 || h.dyn_ltree[13 * 2] !== 0)
+      return G;
+    for (Y = 32; Y < l; Y++)
+      if (h.dyn_ltree[Y * 2] !== 0)
+        return G;
+    return ne;
+  }
+  var Me = !1;
+  function Te(h) {
+    Me || (ce(), Me = !0), h.l_desc = new $(h.dyn_ltree, ie), h.d_desc = new $(h.dyn_dtree, T), h.bl_desc = new $(h.bl_tree, F), h.bi_buf = 0, h.bi_valid = 0, Se(h);
+  }
+  function Ie(h, j, Y, q) {
+    le(h, (t << 1) + (q ? 1 : 0), 3), Re(h, j, Y);
+  }
+  function De(h) {
+    le(h, r << 1, 3), he(h, w, M), ge(h);
+  }
+  function Ze(h, j, Y, q) {
+    var S, L, a = 0;
+    h.level > 0 ? (h.strm.data_type === y && (h.strm.data_type = je(h)), _e(h, h.l_desc), _e(h, h.d_desc), a = Ae(h), S = h.opt_len + 3 + 7 >>> 3, L = h.static_len + 3 + 7 >>> 3, L <= S && (S = L)) : S = L = Y + 5, Y + 4 <= S && j !== -1 ? Ie(h, j, Y, q) : h.strategy === ae || L === S ? (le(h, (r << 1) + (q ? 1 : 0), 3), ee(h, M, Z)) : (le(h, (i << 1) + (q ? 1 : 0), 3), We(h, h.l_desc.max_code + 1, h.d_desc.max_code + 1, a + 1), ee(h, h.dyn_ltree, h.dyn_dtree)), Se(h), q && me(h);
+  }
+  function Xe(h, j, Y) {
+    return h.pending_buf[h.d_buf + h.last_lit * 2] = j >>> 8 & 255, h.pending_buf[h.d_buf + h.last_lit * 2 + 1] = j & 255, h.pending_buf[h.l_buf + h.last_lit] = Y & 255, h.last_lit++, j === 0 ? h.dyn_ltree[Y * 2]++ : (h.matches++, j--, h.dyn_ltree[(X[Y] + l + 1) * 2]++, h.dyn_dtree[ve(j) * 2]++), h.last_lit === h.lit_bufsize - 1;
+  }
+  return Ke._tr_init = Te, Ke._tr_stored_block = Ie, Ke._tr_flush_block = Ze, Ke._tr_tally = Xe, Ke._tr_align = De, Ke;
+}
+var Fe, u0;
+function B0() {
+  if (u0) return Fe;
+  u0 = 1;
+  function K(ae, ne, G, y) {
+    for (var J = ae & 65535 | 0, t = ae >>> 16 & 65535 | 0, r = 0; G !== 0; ) {
+      r = G > 2e3 ? 2e3 : G, G -= r;
+      do
+        J = J + ne[y++] | 0, t = t + J | 0;
+      while (--r);
+      J %= 65521, t %= 65521;
+    }
+    return J | t << 16 | 0;
+  }
+  return Fe = K, Fe;
+}
+var e0, v0;
+function z0() {
+  if (v0) return e0;
+  v0 = 1;
+  function K() {
+    for (var G, y = [], J = 0; J < 256; J++) {
+      G = J;
+      for (var t = 0; t < 8; t++)
+        G = G & 1 ? 3988292384 ^ G >>> 1 : G >>> 1;
+      y[J] = G;
+    }
+    return y;
+  }
+  var ae = K();
+  function ne(G, y, J, t) {
+    var r = ae, i = t + J;
+    G ^= -1;
+    for (var b = t; b < i; b++)
+      G = G >>> 8 ^ r[(G ^ y[b]) & 255];
+    return G ^ -1;
+  }
+  return e0 = ne, e0;
+}
+var r0, s0;
+function h0() {
+  return s0 || (s0 = 1, r0 = {
+    2: "need dictionary",
+    /* Z_NEED_DICT       2  */
+    1: "stream end",
+    /* Z_STREAM_END      1  */
+    0: "",
+    /* Z_OK              0  */
+    "-1": "file error",
+    /* Z_ERRNO         (-1) */
+    "-2": "stream error",
+    /* Z_STREAM_ERROR  (-2) */
+    "-3": "data error",
+    /* Z_DATA_ERROR    (-3) */
+    "-4": "insufficient memory",
+    /* Z_MEM_ERROR     (-4) */
+    "-5": "buffer error",
+    /* Z_BUF_ERROR     (-5) */
+    "-6": "incompatible version"
+    /* Z_VERSION_ERROR (-6) */
+  }), r0;
+}
+var c0;
+function P0() {
+  if (c0) return Ce;
+  c0 = 1;
+  var K = Je(), ae = Z0(), ne = B0(), G = z0(), y = h0(), J = 0, t = 1, r = 3, i = 4, b = 5, v = 0, d = 1, l = -2, s = -3, x = -5, _ = -1, u = 1, c = 2, o = 3, n = 4, w = 0, g = 2, p = 8, E = 9, A = 15, N = 8, D = 29, B = 256, P = B + 1 + D, M = 30, Z = 19, H = 2 * P + 1, X = 15, W = 3, C = 258, m = C + W + 1, ie = 32, T = 42, F = 69, $ = 73, ve = 91, fe = 103, le = 113, he = 666, de = 1, ge = 2, ze = 3, ke = 4, ce = 3;
+  function Se(e, R) {
+    return e.msg = y[R], R;
+  }
+  function me(e) {
+    return (e << 1) - (e > 4 ? 9 : 0);
+  }
+  function Re(e) {
+    for (var R = e.length; --R >= 0; )
+      e[R] = 0;
+  }
+  function oe(e) {
+    var R = e.state, O = R.pending;
+    O > e.avail_out && (O = e.avail_out), O !== 0 && (K.arraySet(e.output, R.pending_buf, R.pending_out, O, e.next_out), e.next_out += O, R.pending_out += O, e.total_out += O, e.avail_out -= O, R.pending -= O, R.pending === 0 && (R.pending_out = 0));
+  }
+  function V(e, R) {
+    ae._tr_flush_block(e, e.block_start >= 0 ? e.block_start : -1, e.strstart - e.block_start, R), e.block_start = e.strstart, oe(e.strm);
+  }
+  function ee(e, R) {
+    e.pending_buf[e.pending++] = R;
+  }
+  function _e(e, R) {
+    e.pending_buf[e.pending++] = R >>> 8 & 255, e.pending_buf[e.pending++] = R & 255;
+  }
+  function we(e, R, O, f) {
+    var k = e.avail_in;
+    return k > f && (k = f), k === 0 ? 0 : (e.avail_in -= k, K.arraySet(R, e.input, e.next_in, k, O), e.state.wrap === 1 ? e.adler = ne(e.adler, R, k, O) : e.state.wrap === 2 && (e.adler = G(e.adler, R, k, O)), e.next_in += k, e.total_in += k, k);
+  }
+  function be(e, R) {
+    var O = e.max_chain_length, f = e.strstart, k, z, re = e.prev_length, Q = e.nice_match, U = e.strstart > e.w_size - m ? e.strstart - (e.w_size - m) : 0, ue = e.window, Ge = e.w_mask, pe = e.prev, se = e.strstart + C, Ee = ue[f + re - 1], Be = ue[f + re];
+    e.prev_length >= e.good_match && (O >>= 2), Q > e.lookahead && (Q = e.lookahead);
+    do
+      if (k = R, !(ue[k + re] !== Be || ue[k + re - 1] !== Ee || ue[k] !== ue[f] || ue[++k] !== ue[f + 1])) {
+        f += 2, k++;
+        do
+          ;
+        while (ue[++f] === ue[++k] && ue[++f] === ue[++k] && ue[++f] === ue[++k] && ue[++f] === ue[++k] && ue[++f] === ue[++k] && ue[++f] === ue[++k] && ue[++f] === ue[++k] && ue[++f] === ue[++k] && f < se);
+        if (z = C - (se - f), f = se - C, z > re) {
+          if (e.match_start = R, re = z, z >= Q)
+            break;
+          Ee = ue[f + re - 1], Be = ue[f + re];
+        }
+      }
+    while ((R = pe[R & Ge]) > U && --O !== 0);
+    return re <= e.lookahead ? re : e.lookahead;
+  }
+  function Ae(e) {
+    var R = e.w_size, O, f, k, z, re;
+    do {
+      if (z = e.window_size - e.lookahead - e.strstart, e.strstart >= R + (R - m)) {
+        K.arraySet(e.window, e.window, R, R, 0), e.match_start -= R, e.strstart -= R, e.block_start -= R, f = e.hash_size, O = f;
+        do
+          k = e.head[--O], e.head[O] = k >= R ? k - R : 0;
+        while (--f);
+        f = R, O = f;
+        do
+          k = e.prev[--O], e.prev[O] = k >= R ? k - R : 0;
+        while (--f);
+        z += R;
+      }
+      if (e.strm.avail_in === 0)
+        break;
+      if (f = we(e.strm, e.window, e.strstart + e.lookahead, z), e.lookahead += f, e.lookahead + e.insert >= W)
+        for (re = e.strstart - e.insert, e.ins_h = e.window[re], e.ins_h = (e.ins_h << e.hash_shift ^ e.window[re + 1]) & e.hash_mask; e.insert && (e.ins_h = (e.ins_h << e.hash_shift ^ e.window[re + W - 1]) & e.hash_mask, e.prev[re & e.w_mask] = e.head[e.ins_h], e.head[e.ins_h] = re, re++, e.insert--, !(e.lookahead + e.insert < W)); )
+          ;
+    } while (e.lookahead < m && e.strm.avail_in !== 0);
+  }
+  function We(e, R) {
+    var O = 65535;
+    for (O > e.pending_buf_size - 5 && (O = e.pending_buf_size - 5); ; ) {
+      if (e.lookahead <= 1) {
+        if (Ae(e), e.lookahead === 0 && R === J)
+          return de;
+        if (e.lookahead === 0)
+          break;
+      }
+      e.strstart += e.lookahead, e.lookahead = 0;
+      var f = e.block_start + O;
+      if ((e.strstart === 0 || e.strstart >= f) && (e.lookahead = e.strstart - f, e.strstart = f, V(e, !1), e.strm.avail_out === 0) || e.strstart - e.block_start >= e.w_size - m && (V(e, !1), e.strm.avail_out === 0))
+        return de;
+    }
+    return e.insert = 0, R === i ? (V(e, !0), e.strm.avail_out === 0 ? ze : ke) : (e.strstart > e.block_start && (V(e, !1), e.strm.avail_out === 0), de);
+  }
+  function je(e, R) {
+    for (var O, f; ; ) {
+      if (e.lookahead < m) {
+        if (Ae(e), e.lookahead < m && R === J)
+          return de;
+        if (e.lookahead === 0)
+          break;
+      }
+      if (O = 0, e.lookahead >= W && (e.ins_h = (e.ins_h << e.hash_shift ^ e.window[e.strstart + W - 1]) & e.hash_mask, O = e.prev[e.strstart & e.w_mask] = e.head[e.ins_h], e.head[e.ins_h] = e.strstart), O !== 0 && e.strstart - O <= e.w_size - m && (e.match_length = be(e, O)), e.match_length >= W)
+        if (f = ae._tr_tally(e, e.strstart - e.match_start, e.match_length - W), e.lookahead -= e.match_length, e.match_length <= e.max_lazy_match && e.lookahead >= W) {
+          e.match_length--;
+          do
+            e.strstart++, e.ins_h = (e.ins_h << e.hash_shift ^ e.window[e.strstart + W - 1]) & e.hash_mask, O = 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
+        f = ae._tr_tally(e, 0, e.window[e.strstart]), e.lookahead--, e.strstart++;
+      if (f && (V(e, !1), e.strm.avail_out === 0))
+        return de;
+    }
+    return e.insert = e.strstart < W - 1 ? e.strstart : W - 1, R === i ? (V(e, !0), e.strm.avail_out === 0 ? ze : ke) : e.last_lit && (V(e, !1), e.strm.avail_out === 0) ? de : ge;
+  }
+  function Me(e, R) {
+    for (var O, f, k; ; ) {
+      if (e.lookahead < m) {
+        if (Ae(e), e.lookahead < m && R === J)
+          return de;
+        if (e.lookahead === 0)
+          break;
+      }
+      if (O = 0, e.lookahead >= W && (e.ins_h = (e.ins_h << e.hash_shift ^ e.window[e.strstart + W - 1]) & e.hash_mask, O = 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 = W - 1, O !== 0 && e.prev_length < e.max_lazy_match && e.strstart - O <= e.w_size - m && (e.match_length = be(e, O), e.match_length <= 5 && (e.strategy === u || e.match_length === W && e.strstart - e.match_start > 4096) && (e.match_length = W - 1)), e.prev_length >= W && e.match_length <= e.prev_length) {
+        k = e.strstart + e.lookahead - W, f = ae._tr_tally(e, e.strstart - 1 - e.prev_match, e.prev_length - W), e.lookahead -= e.prev_length - 1, e.prev_length -= 2;
+        do
+          ++e.strstart <= k && (e.ins_h = (e.ins_h << e.hash_shift ^ e.window[e.strstart + W - 1]) & e.hash_mask, O = 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 = W - 1, e.strstart++, f && (V(e, !1), e.strm.avail_out === 0))
+          return de;
+      } else if (e.match_available) {
+        if (f = ae._tr_tally(e, 0, e.window[e.strstart - 1]), f && V(e, !1), e.strstart++, e.lookahead--, e.strm.avail_out === 0)
+          return de;
+      } else
+        e.match_available = 1, e.strstart++, e.lookahead--;
+    }
+    return e.match_available && (f = ae._tr_tally(e, 0, e.window[e.strstart - 1]), e.match_available = 0), e.insert = e.strstart < W - 1 ? e.strstart : W - 1, R === i ? (V(e, !0), e.strm.avail_out === 0 ? ze : ke) : e.last_lit && (V(e, !1), e.strm.avail_out === 0) ? de : ge;
+  }
+  function Te(e, R) {
+    for (var O, f, k, z, re = e.window; ; ) {
+      if (e.lookahead <= C) {
+        if (Ae(e), e.lookahead <= C && R === J)
+          return de;
+        if (e.lookahead === 0)
+          break;
+      }
+      if (e.match_length = 0, e.lookahead >= W && e.strstart > 0 && (k = e.strstart - 1, f = re[k], f === re[++k] && f === re[++k] && f === re[++k])) {
+        z = e.strstart + C;
+        do
+          ;
+        while (f === re[++k] && f === re[++k] && f === re[++k] && f === re[++k] && f === re[++k] && f === re[++k] && f === re[++k] && f === re[++k] && k < z);
+        e.match_length = C - (z - k), e.match_length > e.lookahead && (e.match_length = e.lookahead);
+      }
+      if (e.match_length >= W ? (O = ae._tr_tally(e, 1, e.match_length - W), e.lookahead -= e.match_length, e.strstart += e.match_length, e.match_length = 0) : (O = ae._tr_tally(e, 0, e.window[e.strstart]), e.lookahead--, e.strstart++), O && (V(e, !1), e.strm.avail_out === 0))
+        return de;
+    }
+    return e.insert = 0, R === i ? (V(e, !0), e.strm.avail_out === 0 ? ze : ke) : e.last_lit && (V(e, !1), e.strm.avail_out === 0) ? de : ge;
+  }
+  function Ie(e, R) {
+    for (var O; ; ) {
+      if (e.lookahead === 0 && (Ae(e), e.lookahead === 0)) {
+        if (R === J)
+          return de;
+        break;
+      }
+      if (e.match_length = 0, O = ae._tr_tally(e, 0, e.window[e.strstart]), e.lookahead--, e.strstart++, O && (V(e, !1), e.strm.avail_out === 0))
+        return de;
+    }
+    return e.insert = 0, R === i ? (V(e, !0), e.strm.avail_out === 0 ? ze : ke) : e.last_lit && (V(e, !1), e.strm.avail_out === 0) ? de : ge;
+  }
+  function De(e, R, O, f, k) {
+    this.good_length = e, this.max_lazy = R, this.nice_length = O, this.max_chain = f, this.func = k;
+  }
+  var Ze;
+  Ze = [
+    /*      good lazy nice chain */
+    new De(0, 0, 0, 0, We),
+    /* 0 store only */
+    new De(4, 4, 8, 4, je),
+    /* 1 max speed, no lazy matches */
+    new De(4, 5, 16, 8, je),
+    /* 2 */
+    new De(4, 6, 32, 32, je),
+    /* 3 */
+    new De(4, 4, 16, 16, Me),
+    /* 4 lazy matches */
+    new De(8, 16, 32, 32, Me),
+    /* 5 */
+    new De(8, 16, 128, 128, Me),
+    /* 6 */
+    new De(8, 32, 128, 256, Me),
+    /* 7 */
+    new De(32, 128, 258, 1024, Me),
+    /* 8 */
+    new De(32, 258, 258, 4096, Me)
+    /* 9 max compression */
+  ];
+  function Xe(e) {
+    e.window_size = 2 * e.w_size, Re(e.head), e.max_lazy_match = Ze[e.level].max_lazy, e.good_match = Ze[e.level].good_length, e.nice_match = Ze[e.level].nice_length, e.max_chain_length = Ze[e.level].max_chain, e.strstart = 0, e.block_start = 0, e.lookahead = 0, e.insert = 0, e.match_length = e.prev_length = W - 1, e.match_available = 0, e.ins_h = 0;
+  }
+  function h() {
+    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 = p, 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 K.Buf16(H * 2), this.dyn_dtree = new K.Buf16((2 * M + 1) * 2), this.bl_tree = new K.Buf16((2 * Z + 1) * 2), Re(this.dyn_ltree), Re(this.dyn_dtree), Re(this.bl_tree), this.l_desc = null, this.d_desc = null, this.bl_desc = null, this.bl_count = new K.Buf16(X + 1), this.heap = new K.Buf16(2 * P + 1), Re(this.heap), this.heap_len = 0, this.heap_max = 0, this.depth = new K.Buf16(2 * P + 1), Re(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 j(e) {
+    var R;
+    return !e || !e.state ? Se(e, l) : (e.total_in = e.total_out = 0, e.data_type = g, R = e.state, R.pending = 0, R.pending_out = 0, R.wrap < 0 && (R.wrap = -R.wrap), R.status = R.wrap ? T : le, e.adler = R.wrap === 2 ? 0 : 1, R.last_flush = J, ae._tr_init(R), v);
+  }
+  function Y(e) {
+    var R = j(e);
+    return R === v && Xe(e.state), R;
+  }
+  function q(e, R) {
+    return !e || !e.state || e.state.wrap !== 2 ? l : (e.state.gzhead = R, v);
+  }
+  function S(e, R, O, f, k, z) {
+    if (!e)
+      return l;
+    var re = 1;
+    if (R === _ && (R = 6), f < 0 ? (re = 0, f = -f) : f > 15 && (re = 2, f -= 16), k < 1 || k > E || O !== p || f < 8 || f > 15 || R < 0 || R > 9 || z < 0 || z > n)
+      return Se(e, l);
+    f === 8 && (f = 9);
+    var Q = new h();
+    return e.state = Q, Q.strm = e, Q.wrap = re, Q.gzhead = null, Q.w_bits = f, Q.w_size = 1 << Q.w_bits, Q.w_mask = Q.w_size - 1, Q.hash_bits = k + 7, Q.hash_size = 1 << Q.hash_bits, Q.hash_mask = Q.hash_size - 1, Q.hash_shift = ~~((Q.hash_bits + W - 1) / W), Q.window = new K.Buf8(Q.w_size * 2), Q.head = new K.Buf16(Q.hash_size), Q.prev = new K.Buf16(Q.w_size), Q.lit_bufsize = 1 << k + 6, Q.pending_buf_size = Q.lit_bufsize * 4, Q.pending_buf = new K.Buf8(Q.pending_buf_size), Q.d_buf = 1 * Q.lit_bufsize, Q.l_buf = 3 * Q.lit_bufsize, Q.level = R, Q.strategy = z, Q.method = O, Y(e);
+  }
+  function L(e, R) {
+    return S(e, R, p, A, N, w);
+  }
+  function a(e, R) {
+    var O, f, k, z;
+    if (!e || !e.state || R > b || R < 0)
+      return e ? Se(e, l) : l;
+    if (f = e.state, !e.output || !e.input && e.avail_in !== 0 || f.status === he && R !== i)
+      return Se(e, e.avail_out === 0 ? x : l);
+    if (f.strm = e, O = f.last_flush, f.last_flush = R, f.status === T)
+      if (f.wrap === 2)
+        e.adler = 0, ee(f, 31), ee(f, 139), ee(f, 8), f.gzhead ? (ee(
+          f,
+          (f.gzhead.text ? 1 : 0) + (f.gzhead.hcrc ? 2 : 0) + (f.gzhead.extra ? 4 : 0) + (f.gzhead.name ? 8 : 0) + (f.gzhead.comment ? 16 : 0)
+        ), ee(f, f.gzhead.time & 255), ee(f, f.gzhead.time >> 8 & 255), ee(f, f.gzhead.time >> 16 & 255), ee(f, f.gzhead.time >> 24 & 255), ee(f, f.level === 9 ? 2 : f.strategy >= c || f.level < 2 ? 4 : 0), ee(f, f.gzhead.os & 255), f.gzhead.extra && f.gzhead.extra.length && (ee(f, f.gzhead.extra.length & 255), ee(f, f.gzhead.extra.length >> 8 & 255)), f.gzhead.hcrc && (e.adler = G(e.adler, f.pending_buf, f.pending, 0)), f.gzindex = 0, f.status = F) : (ee(f, 0), ee(f, 0), ee(f, 0), ee(f, 0), ee(f, 0), ee(f, f.level === 9 ? 2 : f.strategy >= c || f.level < 2 ? 4 : 0), ee(f, ce), f.status = le);
+      else {
+        var re = p + (f.w_bits - 8 << 4) << 8, Q = -1;
+        f.strategy >= c || f.level < 2 ? Q = 0 : f.level < 6 ? Q = 1 : f.level === 6 ? Q = 2 : Q = 3, re |= Q << 6, f.strstart !== 0 && (re |= ie), re += 31 - re % 31, f.status = le, _e(f, re), f.strstart !== 0 && (_e(f, e.adler >>> 16), _e(f, e.adler & 65535)), e.adler = 1;
+      }
+    if (f.status === F)
+      if (f.gzhead.extra) {
+        for (k = f.pending; f.gzindex < (f.gzhead.extra.length & 65535) && !(f.pending === f.pending_buf_size && (f.gzhead.hcrc && f.pending > k && (e.adler = G(e.adler, f.pending_buf, f.pending - k, k)), oe(e), k = f.pending, f.pending === f.pending_buf_size)); )
+          ee(f, f.gzhead.extra[f.gzindex] & 255), f.gzindex++;
+        f.gzhead.hcrc && f.pending > k && (e.adler = G(e.adler, f.pending_buf, f.pending - k, k)), f.gzindex === f.gzhead.extra.length && (f.gzindex = 0, f.status = $);
+      } else
+        f.status = $;
+    if (f.status === $)
+      if (f.gzhead.name) {
+        k = f.pending;
+        do {
+          if (f.pending === f.pending_buf_size && (f.gzhead.hcrc && f.pending > k && (e.adler = G(e.adler, f.pending_buf, f.pending - k, k)), oe(e), k = f.pending, f.pending === f.pending_buf_size)) {
+            z = 1;
+            break;
+          }
+          f.gzindex < f.gzhead.name.length ? z = f.gzhead.name.charCodeAt(f.gzindex++) & 255 : z = 0, ee(f, z);
+        } while (z !== 0);
+        f.gzhead.hcrc && f.pending > k && (e.adler = G(e.adler, f.pending_buf, f.pending - k, k)), z === 0 && (f.gzindex = 0, f.status = ve);
+      } else
+        f.status = ve;
+    if (f.status === ve)
+      if (f.gzhead.comment) {
+        k = f.pending;
+        do {
+          if (f.pending === f.pending_buf_size && (f.gzhead.hcrc && f.pending > k && (e.adler = G(e.adler, f.pending_buf, f.pending - k, k)), oe(e), k = f.pending, f.pending === f.pending_buf_size)) {
+            z = 1;
+            break;
+          }
+          f.gzindex < f.gzhead.comment.length ? z = f.gzhead.comment.charCodeAt(f.gzindex++) & 255 : z = 0, ee(f, z);
+        } while (z !== 0);
+        f.gzhead.hcrc && f.pending > k && (e.adler = G(e.adler, f.pending_buf, f.pending - k, k)), z === 0 && (f.status = fe);
+      } else
+        f.status = fe;
+    if (f.status === fe && (f.gzhead.hcrc ? (f.pending + 2 > f.pending_buf_size && oe(e), f.pending + 2 <= f.pending_buf_size && (ee(f, e.adler & 255), ee(f, e.adler >> 8 & 255), e.adler = 0, f.status = le)) : f.status = le), f.pending !== 0) {
+      if (oe(e), e.avail_out === 0)
+        return f.last_flush = -1, v;
+    } else if (e.avail_in === 0 && me(R) <= me(O) && R !== i)
+      return Se(e, x);
+    if (f.status === he && e.avail_in !== 0)
+      return Se(e, x);
+    if (e.avail_in !== 0 || f.lookahead !== 0 || R !== J && f.status !== he) {
+      var U = f.strategy === c ? Ie(f, R) : f.strategy === o ? Te(f, R) : Ze[f.level].func(f, R);
+      if ((U === ze || U === ke) && (f.status = he), U === de || U === ze)
+        return e.avail_out === 0 && (f.last_flush = -1), v;
+      if (U === ge && (R === t ? ae._tr_align(f) : R !== b && (ae._tr_stored_block(f, 0, 0, !1), R === r && (Re(f.head), f.lookahead === 0 && (f.strstart = 0, f.block_start = 0, f.insert = 0))), oe(e), e.avail_out === 0))
+        return f.last_flush = -1, v;
+    }
+    return R !== i ? v : f.wrap <= 0 ? d : (f.wrap === 2 ? (ee(f, e.adler & 255), ee(f, e.adler >> 8 & 255), ee(f, e.adler >> 16 & 255), ee(f, e.adler >> 24 & 255), ee(f, e.total_in & 255), ee(f, e.total_in >> 8 & 255), ee(f, e.total_in >> 16 & 255), ee(f, e.total_in >> 24 & 255)) : (_e(f, e.adler >>> 16), _e(f, e.adler & 65535)), oe(e), f.wrap > 0 && (f.wrap = -f.wrap), f.pending !== 0 ? v : d);
+  }
+  function I(e) {
+    var R;
+    return !e || !e.state ? l : (R = e.state.status, R !== T && R !== F && R !== $ && R !== ve && R !== fe && R !== le && R !== he ? Se(e, l) : (e.state = null, R === le ? Se(e, s) : v));
+  }
+  function te(e, R) {
+    var O = R.length, f, k, z, re, Q, U, ue, Ge;
+    if (!e || !e.state || (f = e.state, re = f.wrap, re === 2 || re === 1 && f.status !== T || f.lookahead))
+      return l;
+    for (re === 1 && (e.adler = ne(e.adler, R, O, 0)), f.wrap = 0, O >= f.w_size && (re === 0 && (Re(f.head), f.strstart = 0, f.block_start = 0, f.insert = 0), Ge = new K.Buf8(f.w_size), K.arraySet(Ge, R, O - f.w_size, f.w_size, 0), R = Ge, O = f.w_size), Q = e.avail_in, U = e.next_in, ue = e.input, e.avail_in = O, e.next_in = 0, e.input = R, Ae(f); f.lookahead >= W; ) {
+      k = f.strstart, z = f.lookahead - (W - 1);
+      do
+        f.ins_h = (f.ins_h << f.hash_shift ^ f.window[k + W - 1]) & f.hash_mask, f.prev[k & f.w_mask] = f.head[f.ins_h], f.head[f.ins_h] = k, k++;
+      while (--z);
+      f.strstart = k, f.lookahead = W - 1, Ae(f);
+    }
+    return f.strstart += f.lookahead, f.block_start = f.strstart, f.insert = f.lookahead, f.lookahead = 0, f.match_length = f.prev_length = W - 1, f.match_available = 0, e.next_in = U, e.input = ue, e.avail_in = Q, f.wrap = re, v;
+  }
+  return Ce.deflateInit = L, Ce.deflateInit2 = S, Ce.deflateReset = Y, Ce.deflateResetKeep = j, Ce.deflateSetHeader = q, Ce.deflate = a, Ce.deflateEnd = I, Ce.deflateSetDictionary = te, Ce.deflateInfo = "pako deflate (from Nodeca project)", Ce;
+}
+var Ye = {}, w0;
+function R0() {
+  if (w0) return Ye;
+  w0 = 1;
+  var K = Je(), ae = !0, ne = !0;
+  try {
+    String.fromCharCode.apply(null, [0]);
+  } catch {
+    ae = !1;
+  }
+  try {
+    String.fromCharCode.apply(null, new Uint8Array(1));
+  } catch {
+    ne = !1;
+  }
+  for (var G = new K.Buf8(256), y = 0; y < 256; y++)
+    G[y] = y >= 252 ? 6 : y >= 248 ? 5 : y >= 240 ? 4 : y >= 224 ? 3 : y >= 192 ? 2 : 1;
+  G[254] = G[254] = 1, Ye.string2buf = function(t) {
+    var r, i, b, v, d, l = t.length, s = 0;
+    for (v = 0; v < l; v++)
+      i = t.charCodeAt(v), (i & 64512) === 55296 && v + 1 < l && (b = t.charCodeAt(v + 1), (b & 64512) === 56320 && (i = 65536 + (i - 55296 << 10) + (b - 56320), v++)), s += i < 128 ? 1 : i < 2048 ? 2 : i < 65536 ? 3 : 4;
+    for (r = new K.Buf8(s), d = 0, v = 0; d < s; v++)
+      i = t.charCodeAt(v), (i & 64512) === 55296 && v + 1 < l && (b = t.charCodeAt(v + 1), (b & 64512) === 56320 && (i = 65536 + (i - 55296 << 10) + (b - 56320), v++)), i < 128 ? r[d++] = i : i < 2048 ? (r[d++] = 192 | i >>> 6, r[d++] = 128 | i & 63) : i < 65536 ? (r[d++] = 224 | i >>> 12, r[d++] = 128 | i >>> 6 & 63, r[d++] = 128 | i & 63) : (r[d++] = 240 | i >>> 18, r[d++] = 128 | i >>> 12 & 63, r[d++] = 128 | i >>> 6 & 63, r[d++] = 128 | i & 63);
+    return r;
+  };
+  function J(t, r) {
+    if (r < 65534 && (t.subarray && ne || !t.subarray && ae))
+      return String.fromCharCode.apply(null, K.shrinkBuf(t, r));
+    for (var i = "", b = 0; b < r; b++)
+      i += String.fromCharCode(t[b]);
+    return i;
+  }
+  return Ye.buf2binstring = function(t) {
+    return J(t, t.length);
+  }, Ye.binstring2buf = function(t) {
+    for (var r = new K.Buf8(t.length), i = 0, b = r.length; i < b; i++)
+      r[i] = t.charCodeAt(i);
+    return r;
+  }, Ye.buf2string = function(t, r) {
+    var i, b, v, d, l = r || t.length, s = new Array(l * 2);
+    for (b = 0, i = 0; i < l; ) {
+      if (v = t[i++], v < 128) {
+        s[b++] = v;
+        continue;
+      }
+      if (d = G[v], d > 4) {
+        s[b++] = 65533, i += d - 1;
+        continue;
+      }
+      for (v &= d === 2 ? 31 : d === 3 ? 15 : 7; d > 1 && i < l; )
+        v = v << 6 | t[i++] & 63, d--;
+      if (d > 1) {
+        s[b++] = 65533;
+        continue;
+      }
+      v < 65536 ? s[b++] = v : (v -= 65536, s[b++] = 55296 | v >> 10 & 1023, s[b++] = 56320 | v & 1023);
+    }
+    return J(s, b);
+  }, Ye.utf8border = function(t, r) {
+    var i;
+    for (r = r || t.length, r > t.length && (r = t.length), i = r - 1; i >= 0 && (t[i] & 192) === 128; )
+      i--;
+    return i < 0 || i === 0 ? r : i + G[t[i]] > r ? i : r;
+  }, Ye;
+}
+var a0, b0;
+function N0() {
+  if (b0) return a0;
+  b0 = 1;
+  function K() {
+    this.input = null, this.next_in = 0, this.avail_in = 0, this.total_in = 0, this.output = null, this.next_out = 0, this.avail_out = 0, this.total_out = 0, this.msg = "", this.state = null, this.data_type = 2, this.adler = 0;
+  }
+  return a0 = K, a0;
+}
+var g0;
+function G0() {
+  if (g0) return $e;
+  g0 = 1;
+  var K = P0(), ae = Je(), ne = R0(), G = h0(), y = N0(), J = Object.prototype.toString, t = 0, r = 4, i = 0, b = 1, v = 2, d = -1, l = 0, s = 8;
+  function x(o) {
+    if (!(this instanceof x)) return new x(o);
+    this.options = ae.assign({
+      level: d,
+      method: s,
+      chunkSize: 16384,
+      windowBits: 15,
+      memLevel: 8,
+      strategy: l,
+      to: ""
+    }, o || {});
+    var n = this.options;
+    n.raw && n.windowBits > 0 ? n.windowBits = -n.windowBits : n.gzip && n.windowBits > 0 && n.windowBits < 16 && (n.windowBits += 16), this.err = 0, this.msg = "", this.ended = !1, this.chunks = [], this.strm = new y(), this.strm.avail_out = 0;
+    var w = K.deflateInit2(
+      this.strm,
+      n.level,
+      n.method,
+      n.windowBits,
+      n.memLevel,
+      n.strategy
+    );
+    if (w !== i)
+      throw new Error(G[w]);
+    if (n.header && K.deflateSetHeader(this.strm, n.header), n.dictionary) {
+      var g;
+      if (typeof n.dictionary == "string" ? g = ne.string2buf(n.dictionary) : J.call(n.dictionary) === "[object ArrayBuffer]" ? g = new Uint8Array(n.dictionary) : g = n.dictionary, w = K.deflateSetDictionary(this.strm, g), w !== i)
+        throw new Error(G[w]);
+      this._dict_set = !0;
+    }
+  }
+  x.prototype.push = function(o, n) {
+    var w = this.strm, g = this.options.chunkSize, p, E;
+    if (this.ended)
+      return !1;
+    E = n === ~~n ? n : n === !0 ? r : t, typeof o == "string" ? w.input = ne.string2buf(o) : J.call(o) === "[object ArrayBuffer]" ? w.input = new Uint8Array(o) : w.input = o, w.next_in = 0, w.avail_in = w.input.length;
+    do {
+      if (w.avail_out === 0 && (w.output = new ae.Buf8(g), w.next_out = 0, w.avail_out = g), p = K.deflate(w, E), p !== b && p !== i)
+        return this.onEnd(p), this.ended = !0, !1;
+      (w.avail_out === 0 || w.avail_in === 0 && (E === r || E === v)) && (this.options.to === "string" ? this.onData(ne.buf2binstring(ae.shrinkBuf(w.output, w.next_out))) : this.onData(ae.shrinkBuf(w.output, w.next_out)));
+    } while ((w.avail_in > 0 || w.avail_out === 0) && p !== b);
+    return E === r ? (p = K.deflateEnd(this.strm), this.onEnd(p), this.ended = !0, p === i) : (E === v && (this.onEnd(i), w.avail_out = 0), !0);
+  }, x.prototype.onData = function(o) {
+    this.chunks.push(o);
+  }, x.prototype.onEnd = function(o) {
+    o === i && (this.options.to === "string" ? this.result = this.chunks.join("") : this.result = ae.flattenChunks(this.chunks)), this.chunks = [], this.err = o, this.msg = this.strm.msg;
+  };
+  function _(o, n) {
+    var w = new x(n);
+    if (w.push(o, !0), w.err)
+      throw w.msg || G[w.err];
+    return w.result;
+  }
+  function u(o, n) {
+    return n = n || {}, n.raw = !0, _(o, n);
+  }
+  function c(o, n) {
+    return n = n || {}, n.gzip = !0, _(o, n);
+  }
+  return $e.Deflate = x, $e.deflate = _, $e.deflateRaw = u, $e.gzip = c, $e;
+}
+var Qe = {}, Le = {}, i0, p0;
+function H0() {
+  if (p0) return i0;
+  p0 = 1;
+  var K = 30, ae = 12;
+  return i0 = function(G, y) {
+    var J, t, r, i, b, v, d, l, s, x, _, u, c, o, n, w, g, p, E, A, N, D, B, P, M;
+    J = G.state, t = G.next_in, P = G.input, r = t + (G.avail_in - 5), i = G.next_out, M = G.output, b = i - (y - G.avail_out), v = i + (G.avail_out - 257), d = J.dmax, l = J.wsize, s = J.whave, x = J.wnext, _ = J.window, u = J.hold, c = J.bits, o = J.lencode, n = J.distcode, w = (1 << J.lenbits) - 1, g = (1 << J.distbits) - 1;
+    e:
+      do {
+        c < 15 && (u += P[t++] << c, c += 8, u += P[t++] << c, c += 8), p = o[u & w];
+        r:
+          for (; ; ) {
+            if (E = p >>> 24, u >>>= E, c -= E, E = p >>> 16 & 255, E === 0)
+              M[i++] = p & 65535;
+            else if (E & 16) {
+              A = p & 65535, E &= 15, E && (c < E && (u += P[t++] << c, c += 8), A += u & (1 << E) - 1, u >>>= E, c -= E), c < 15 && (u += P[t++] << c, c += 8, u += P[t++] << c, c += 8), p = n[u & g];
+              a:
+                for (; ; ) {
+                  if (E = p >>> 24, u >>>= E, c -= E, E = p >>> 16 & 255, E & 16) {
+                    if (N = p & 65535, E &= 15, c < E && (u += P[t++] << c, c += 8, c < E && (u += P[t++] << c, c += 8)), N += u & (1 << E) - 1, N > d) {
+                      G.msg = "invalid distance too far back", J.mode = K;
+                      break e;
+                    }
+                    if (u >>>= E, c -= E, E = i - b, N > E) {
+                      if (E = N - E, E > s && J.sane) {
+                        G.msg = "invalid distance too far back", J.mode = K;
+                        break e;
+                      }
+                      if (D = 0, B = _, x === 0) {
+                        if (D += l - E, E < A) {
+                          A -= E;
+                          do
+                            M[i++] = _[D++];
+                          while (--E);
+                          D = i - N, B = M;
+                        }
+                      } else if (x < E) {
+                        if (D += l + x - E, E -= x, E < A) {
+                          A -= E;
+                          do
+                            M[i++] = _[D++];
+                          while (--E);
+                          if (D = 0, x < A) {
+                            E = x, A -= E;
+                            do
+                              M[i++] = _[D++];
+                            while (--E);
+                            D = i - N, B = M;
+                          }
+                        }
+                      } else if (D += x - E, E < A) {
+                        A -= E;
+                        do
+                          M[i++] = _[D++];
+                        while (--E);
+                        D = i - N, B = M;
+                      }
+                      for (; A > 2; )
+                        M[i++] = B[D++], M[i++] = B[D++], M[i++] = B[D++], A -= 3;
+                      A && (M[i++] = B[D++], A > 1 && (M[i++] = B[D++]));
+                    } else {
+                      D = i - N;
+                      do
+                        M[i++] = M[D++], M[i++] = M[D++], M[i++] = M[D++], A -= 3;
+                      while (A > 2);
+                      A && (M[i++] = M[D++], A > 1 && (M[i++] = M[D++]));
+                    }
+                  } else if (E & 64) {
+                    G.msg = "invalid distance code", J.mode = K;
+                    break e;
+                  } else {
+                    p = n[(p & 65535) + (u & (1 << E) - 1)];
+                    continue a;
+                  }
+                  break;
+                }
+            } else if (E & 64)
+              if (E & 32) {
+                J.mode = ae;
+                break e;
+              } else {
+                G.msg = "invalid literal/length code", J.mode = K;
+                break e;
+              }
+            else {
+              p = o[(p & 65535) + (u & (1 << E) - 1)];
+              continue r;
+            }
+            break;
+          }
+      } while (t < r && i < v);
+    A = c >> 3, t -= A, c -= A << 3, u &= (1 << c) - 1, G.next_in = t, G.next_out = i, G.avail_in = t < r ? 5 + (r - t) : 5 - (t - r), G.avail_out = i < v ? 257 + (v - i) : 257 - (i - v), J.hold = u, J.bits = c;
+  }, i0;
+}
+var t0, k0;
+function j0() {
+  if (k0) return t0;
+  k0 = 1;
+  var K = Je(), ae = 15, ne = 852, G = 592, y = 0, J = 1, t = 2, r = [
+    /* Length codes 257..285 base */
+    3,
+    4,
+    5,
+    6,
+    7,
+    8,
+    9,
+    10,
+    11,
+    13,
+    15,
+    17,
+    19,
+    23,
+    27,
+    31,
+    35,
+    43,
+    51,
+    59,
+    67,
+    83,
+    99,
+    115,
+    131,
+    163,
+    195,
+    227,
+    258,
+    0,
+    0
+  ], i = [
+    /* Length codes 257..285 extra */
+    16,
+    16,
+    16,
+    16,
+    16,
+    16,
+    16,
+    16,
+    17,
+    17,
+    17,
+    17,
+    18,
+    18,
+    18,
+    18,
+    19,
+    19,
+    19,
+    19,
+    20,
+    20,
+    20,
+    20,
+    21,
+    21,
+    21,
+    21,
+    16,
+    72,
+    78
+  ], b = [
+    /* Distance codes 0..29 base */
+    1,
+    2,
+    3,
+    4,
+    5,
+    7,
+    9,
+    13,
+    17,
+    25,
+    33,
+    49,
+    65,
+    97,
+    129,
+    193,
+    257,
+    385,
+    513,
+    769,
+    1025,
+    1537,
+    2049,
+    3073,
+    4097,
+    6145,
+    8193,
+    12289,
+    16385,
+    24577,
+    0,
+    0
+  ], v = [
+    /* Distance codes 0..29 extra */
+    16,
+    16,
+    16,
+    16,
+    17,
+    17,
+    18,
+    18,
+    19,
+    19,
+    20,
+    20,
+    21,
+    21,
+    22,
+    22,
+    23,
+    23,
+    24,
+    24,
+    25,
+    25,
+    26,
+    26,
+    27,
+    27,
+    28,
+    28,
+    29,
+    29,
+    64,
+    64
+  ];
+  return t0 = function(l, s, x, _, u, c, o, n) {
+    var w = n.bits, g = 0, p = 0, E = 0, A = 0, N = 0, D = 0, B = 0, P = 0, M = 0, Z = 0, H, X, W, C, m, ie = null, T = 0, F, $ = new K.Buf16(ae + 1), ve = new K.Buf16(ae + 1), fe = null, le = 0, he, de, ge;
+    for (g = 0; g <= ae; g++)
+      $[g] = 0;
+    for (p = 0; p < _; p++)
+      $[s[x + p]]++;
+    for (N = w, A = ae; A >= 1 && $[A] === 0; A--)
+      ;
+    if (N > A && (N = A), A === 0)
+      return u[c++] = 1 << 24 | 64 << 16 | 0, u[c++] = 1 << 24 | 64 << 16 | 0, n.bits = 1, 0;
+    for (E = 1; E < A && $[E] === 0; E++)
+      ;
+    for (N < E && (N = E), P = 1, g = 1; g <= ae; g++)
+      if (P <<= 1, P -= $[g], P < 0)
+        return -1;
+    if (P > 0 && (l === y || A !== 1))
+      return -1;
+    for (ve[1] = 0, g = 1; g < ae; g++)
+      ve[g + 1] = ve[g] + $[g];
+    for (p = 0; p < _; p++)
+      s[x + p] !== 0 && (o[ve[s[x + p]]++] = p);
+    if (l === y ? (ie = fe = o, F = 19) : l === J ? (ie = r, T -= 257, fe = i, le -= 257, F = 256) : (ie = b, fe = v, F = -1), Z = 0, p = 0, g = E, m = c, D = N, B = 0, W = -1, M = 1 << N, C = M - 1, l === J && M > ne || l === t && M > G)
+      return 1;
+    for (; ; ) {
+      he = g - B, o[p] < F ? (de = 0, ge = o[p]) : o[p] > F ? (de = fe[le + o[p]], ge = ie[T + o[p]]) : (de = 96, ge = 0), H = 1 << g - B, X = 1 << D, E = X;
+      do
+        X -= H, u[m + (Z >> B) + X] = he << 24 | de << 16 | ge | 0;
+      while (X !== 0);
+      for (H = 1 << g - 1; Z & H; )
+        H >>= 1;
+      if (H !== 0 ? (Z &= H - 1, Z += H) : Z = 0, p++, --$[g] === 0) {
+        if (g === A)
+          break;
+        g = s[x + o[p]];
+      }
+      if (g > N && (Z & C) !== W) {
+        for (B === 0 && (B = N), m += E, D = g - B, P = 1 << D; D + B < A && (P -= $[D + B], !(P <= 0)); )
+          D++, P <<= 1;
+        if (M += 1 << D, l === J && M > ne || l === t && M > G)
+          return 1;
+        W = Z & C, u[W] = N << 24 | D << 16 | m - c | 0;
+      }
+    }
+    return Z !== 0 && (u[m + Z] = g - B << 24 | 64 << 16 | 0), n.bits = N, 0;
+  }, t0;
+}
+var x0;
+function I0() {
+  if (x0) return Le;
+  x0 = 1;
+  var K = Je(), ae = B0(), ne = z0(), G = H0(), y = j0(), J = 0, t = 1, r = 2, i = 4, b = 5, v = 6, d = 0, l = 1, s = 2, x = -2, _ = -3, u = -4, c = -5, o = 8, n = 1, w = 2, g = 3, p = 4, E = 5, A = 6, N = 7, D = 8, B = 9, P = 10, M = 11, Z = 12, H = 13, X = 14, W = 15, C = 16, m = 17, ie = 18, T = 19, F = 20, $ = 21, ve = 22, fe = 23, le = 24, he = 25, de = 26, ge = 27, ze = 28, ke = 29, ce = 30, Se = 31, me = 32, Re = 852, oe = 592, V = 15, ee = V;
+  function _e(S) {
+    return (S >>> 24 & 255) + (S >>> 8 & 65280) + ((S & 65280) << 8) + ((S & 255) << 24);
+  }
+  function we() {
+    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 K.Buf16(320), this.work = new K.Buf16(288), this.lendyn = null, this.distdyn = null, this.sane = 0, this.back = 0, this.was = 0;
+  }
+  function be(S) {
+    var L;
+    return !S || !S.state ? x : (L = S.state, S.total_in = S.total_out = L.total = 0, S.msg = "", L.wrap && (S.adler = L.wrap & 1), L.mode = n, L.last = 0, L.havedict = 0, L.dmax = 32768, L.head = null, L.hold = 0, L.bits = 0, L.lencode = L.lendyn = new K.Buf32(Re), L.distcode = L.distdyn = new K.Buf32(oe), L.sane = 1, L.back = -1, d);
+  }
+  function Ae(S) {
+    var L;
+    return !S || !S.state ? x : (L = S.state, L.wsize = 0, L.whave = 0, L.wnext = 0, be(S));
+  }
+  function We(S, L) {
+    var a, I;
+    return !S || !S.state || (I = S.state, L < 0 ? (a = 0, L = -L) : (a = (L >> 4) + 1, L < 48 && (L &= 15)), L && (L < 8 || L > 15)) ? x : (I.window !== null && I.wbits !== L && (I.window = null), I.wrap = a, I.wbits = L, Ae(S));
+  }
+  function je(S, L) {
+    var a, I;
+    return S ? (I = new we(), S.state = I, I.window = null, a = We(S, L), a !== d && (S.state = null), a) : x;
+  }
+  function Me(S) {
+    return je(S, ee);
+  }
+  var Te = !0, Ie, De;
+  function Ze(S) {
+    if (Te) {
+      var L;
+      for (Ie = new K.Buf32(512), De = new K.Buf32(32), L = 0; L < 144; )
+        S.lens[L++] = 8;
+      for (; L < 256; )
+        S.lens[L++] = 9;
+      for (; L < 280; )
+        S.lens[L++] = 7;
+      for (; L < 288; )
+        S.lens[L++] = 8;
+      for (y(t, S.lens, 0, 288, Ie, 0, S.work, { bits: 9 }), L = 0; L < 32; )
+        S.lens[L++] = 5;
+      y(r, S.lens, 0, 32, De, 0, S.work, { bits: 5 }), Te = !1;
+    }
+    S.lencode = Ie, S.lenbits = 9, S.distcode = De, S.distbits = 5;
+  }
+  function Xe(S, L, a, I) {
+    var te, e = S.state;
+    return e.window === null && (e.wsize = 1 << e.wbits, e.wnext = 0, e.whave = 0, e.window = new K.Buf8(e.wsize)), I >= e.wsize ? (K.arraySet(e.window, L, a - e.wsize, e.wsize, 0), e.wnext = 0, e.whave = e.wsize) : (te = e.wsize - e.wnext, te > I && (te = I), K.arraySet(e.window, L, a - I, te, e.wnext), I -= te, I ? (K.arraySet(e.window, L, a - I, I, 0), e.wnext = I, e.whave = e.wsize) : (e.wnext += te, e.wnext === e.wsize && (e.wnext = 0), e.whave < e.wsize && (e.whave += te))), 0;
+  }
+  function h(S, L) {
+    var a, I, te, e, R, O, f, k, z, re, Q, U, ue, Ge, pe = 0, se, Ee, Be, Ne, Ve, Ue, xe, Oe, ye = new K.Buf8(4), He, Pe, o0 = (
+      /* permutation of code lengths */
+      [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 x;
+    a = S.state, a.mode === Z && (a.mode = H), R = S.next_out, te = S.output, f = S.avail_out, e = S.next_in, I = S.input, O = S.avail_in, k = a.hold, z = a.bits, re = O, Q = f, Oe = d;
+    e:
+      for (; ; )
+        switch (a.mode) {
+          case n:
+            if (a.wrap === 0) {
+              a.mode = H;
+              break;
+            }
+            for (; z < 16; ) {
+              if (O === 0)
+                break e;
+              O--, k += I[e++] << z, z += 8;
+            }
+            if (a.wrap & 2 && k === 35615) {
+              a.check = 0, ye[0] = k & 255, ye[1] = k >>> 8 & 255, a.check = ne(a.check, ye, 2, 0), k = 0, z = 0, a.mode = w;
+              break;
+            }
+            if (a.flags = 0, a.head && (a.head.done = !1), !(a.wrap & 1) || /* check if zlib header allowed */
+            (((k & 255) << 8) + (k >> 8)) % 31) {
+              S.msg = "incorrect header check", a.mode = ce;
+              break;
+            }
+            if ((k & 15) !== o) {
+              S.msg = "unknown compression method", a.mode = ce;
+              break;
+            }
+            if (k >>>= 4, z -= 4, xe = (k & 15) + 8, a.wbits === 0)
+              a.wbits = xe;
+            else if (xe > a.wbits) {
+              S.msg = "invalid window size", a.mode = ce;
+              break;
+            }
+            a.dmax = 1 << xe, S.adler = a.check = 1, a.mode = k & 512 ? P : Z, k = 0, z = 0;
+            break;
+          case w:
+            for (; z < 16; ) {
+              if (O === 0)
+                break e;
+              O--, k += I[e++] << z, z += 8;
+            }
+            if (a.flags = k, (a.flags & 255) !== o) {
+              S.msg = "unknown compression method", a.mode = ce;
+              break;
+            }
+            if (a.flags & 57344) {
+              S.msg = "unknown header flags set", a.mode = ce;
+              break;
+            }
+            a.head && (a.head.text = k >> 8 & 1), a.flags & 512 && (ye[0] = k & 255, ye[1] = k >>> 8 & 255, a.check = ne(a.check, ye, 2, 0)), k = 0, z = 0, a.mode = g;
+          case g:
+            for (; z < 32; ) {
+              if (O === 0)
+                break e;
+              O--, k += I[e++] << z, z += 8;
+            }
+            a.head && (a.head.time = k), a.flags & 512 && (ye[0] = k & 255, ye[1] = k >>> 8 & 255, ye[2] = k >>> 16 & 255, ye[3] = k >>> 24 & 255, a.check = ne(a.check, ye, 4, 0)), k = 0, z = 0, a.mode = p;
+          case p:
+            for (; z < 16; ) {
+              if (O === 0)
+                break e;
+              O--, k += I[e++] << z, z += 8;
+            }
+            a.head && (a.head.xflags = k & 255, a.head.os = k >> 8), a.flags & 512 && (ye[0] = k & 255, ye[1] = k >>> 8 & 255, a.check = ne(a.check, ye, 2, 0)), k = 0, z = 0, a.mode = E;
+          case E:
+            if (a.flags & 1024) {
+              for (; z < 16; ) {
+                if (O === 0)
+                  break e;
+                O--, k += I[e++] << z, z += 8;
+              }
+              a.length = k, a.head && (a.head.extra_len = k), a.flags & 512 && (ye[0] = k & 255, ye[1] = k >>> 8 & 255, a.check = ne(a.check, ye, 2, 0)), k = 0, z = 0;
+            } else a.head && (a.head.extra = null);
+            a.mode = A;
+          case A:
+            if (a.flags & 1024 && (U = a.length, U > O && (U = O), U && (a.head && (xe = a.head.extra_len - a.length, a.head.extra || (a.head.extra = new Array(a.head.extra_len)), K.arraySet(
+              a.head.extra,
+              I,
+              e,
+              // extra field is limited to 65536 bytes
+              // - no need for additional size check
+              U,
+              /*len + copy > state.head.extra_max - len ? state.head.extra_max : copy,*/
+              xe
+            )), a.flags & 512 && (a.check = ne(a.check, I, U, e)), O -= U, e += U, a.length -= U), a.length))
+              break e;
+            a.length = 0, a.mode = N;
+          case N:
+            if (a.flags & 2048) {
+              if (O === 0)
+                break e;
+              U = 0;
+              do
+                xe = I[e + U++], a.head && xe && a.length < 65536 && (a.head.name += String.fromCharCode(xe));
+              while (xe && U < O);
+              if (a.flags & 512 && (a.check = ne(a.check, I, U, e)), O -= U, e += U, xe)
+                break e;
+            } else a.head && (a.head.name = null);
+            a.length = 0, a.mode = D;
+          case D:
+            if (a.flags & 4096) {
+              if (O === 0)
+                break e;
+              U = 0;
+              do
+                xe = I[e + U++], a.head && xe && a.length < 65536 && (a.head.comment += String.fromCharCode(xe));
+              while (xe && U < O);
+              if (a.flags & 512 && (a.check = ne(a.check, I, U, e)), O -= U, e += U, xe)
+                break e;
+            } else a.head && (a.head.comment = null);
+            a.mode = B;
+          case B:
+            if (a.flags & 512) {
+              for (; z < 16; ) {
+                if (O === 0)
+                  break e;
+                O--, k += I[e++] << z, z += 8;
+              }
+              if (k !== (a.check & 65535)) {
+                S.msg = "header crc mismatch", a.mode = ce;
+                break;
+              }
+              k = 0, z = 0;
+            }
+            a.head && (a.head.hcrc = a.flags >> 9 & 1, a.head.done = !0), S.adler = a.check = 0, a.mode = Z;
+            break;
+          case P:
+            for (; z < 32; ) {
+              if (O === 0)
+                break e;
+              O--, k += I[e++] << z, z += 8;
+            }
+            S.adler = a.check = _e(k), k = 0, z = 0, a.mode = M;
+          case M:
+            if (a.havedict === 0)
+              return S.next_out = R, S.avail_out = f, S.next_in = e, S.avail_in = O, a.hold = k, a.bits = z, s;
+            S.adler = a.check = 1, a.mode = Z;
+          case Z:
+            if (L === b || L === v)
+              break e;
+          case H:
+            if (a.last) {
+              k >>>= z & 7, z -= z & 7, a.mode = ge;
+              break;
+            }
+            for (; z < 3; ) {
+              if (O === 0)
+                break e;
+              O--, k += I[e++] << z, z += 8;
+            }
+            switch (a.last = k & 1, k >>>= 1, z -= 1, k & 3) {
+              case 0:
+                a.mode = X;
+                break;
+              case 1:
+                if (Ze(a), a.mode = F, L === v) {
+                  k >>>= 2, z -= 2;
+                  break e;
+                }
+                break;
+              case 2:
+                a.mode = m;
+                break;
+              case 3:
+                S.msg = "invalid block type", a.mode = ce;
+            }
+            k >>>= 2, z -= 2;
+            break;
+          case X:
+            for (k >>>= z & 7, z -= z & 7; z < 32; ) {
+              if (O === 0)
+                break e;
+              O--, k += I[e++] << z, z += 8;
+            }
+            if ((k & 65535) !== (k >>> 16 ^ 65535)) {
+              S.msg = "invalid stored block lengths", a.mode = ce;
+              break;
+            }
+            if (a.length = k & 65535, k = 0, z = 0, a.mode = W, L === v)
+              break e;
+          case W:
+            a.mode = C;
+          case C:
+            if (U = a.length, U) {
+              if (U > O && (U = O), U > f && (U = f), U === 0)
+                break e;
+              K.arraySet(te, I, e, U, R), O -= U, e += U, f -= U, R += U, a.length -= U;
+              break;
+            }
+            a.mode = Z;
+            break;
+          case m:
+            for (; z < 14; ) {
+              if (O === 0)
+                break e;
+              O--, k += I[e++] << z, z += 8;
+            }
+            if (a.nlen = (k & 31) + 257, k >>>= 5, z -= 5, a.ndist = (k & 31) + 1, k >>>= 5, z -= 5, a.ncode = (k & 15) + 4, k >>>= 4, z -= 4, a.nlen > 286 || a.ndist > 30) {
+              S.msg = "too many length or distance symbols", a.mode = ce;
+              break;
+            }
+            a.have = 0, a.mode = ie;
+          case ie:
+            for (; a.have < a.ncode; ) {
+              for (; z < 3; ) {
+                if (O === 0)
+                  break e;
+                O--, k += I[e++] << z, z += 8;
+              }
+              a.lens[o0[a.have++]] = k & 7, k >>>= 3, z -= 3;
+            }
+            for (; a.have < 19; )
+              a.lens[o0[a.have++]] = 0;
+            if (a.lencode = a.lendyn, a.lenbits = 7, He = { bits: a.lenbits }, Oe = y(J, a.lens, 0, 19, a.lencode, 0, a.work, He), a.lenbits = He.bits, Oe) {
+              S.msg = "invalid code lengths set", a.mode = ce;
+              break;
+            }
+            a.have = 0, a.mode = T;
+          case T:
+            for (; a.have < a.nlen + a.ndist; ) {
+              for (; pe = a.lencode[k & (1 << a.lenbits) - 1], se = pe >>> 24, Ee = pe >>> 16 & 255, Be = pe & 65535, !(se <= z); ) {
+                if (O === 0)
+                  break e;
+                O--, k += I[e++] << z, z += 8;
+              }
+              if (Be < 16)
+                k >>>= se, z -= se, a.lens[a.have++] = Be;
+              else {
+                if (Be === 16) {
+                  for (Pe = se + 2; z < Pe; ) {
+                    if (O === 0)
+                      break e;
+                    O--, k += I[e++] << z, z += 8;
+                  }
+                  if (k >>>= se, z -= se, a.have === 0) {
+                    S.msg = "invalid bit length repeat", a.mode = ce;
+                    break;
+                  }
+                  xe = a.lens[a.have - 1], U = 3 + (k & 3), k >>>= 2, z -= 2;
+                } else if (Be === 17) {
+                  for (Pe = se + 3; z < Pe; ) {
+                    if (O === 0)
+                      break e;
+                    O--, k += I[e++] << z, z += 8;
+                  }
+                  k >>>= se, z -= se, xe = 0, U = 3 + (k & 7), k >>>= 3, z -= 3;
+                } else {
+                  for (Pe = se + 7; z < Pe; ) {
+                    if (O === 0)
+                      break e;
+                    O--, k += I[e++] << z, z += 8;
+                  }
+                  k >>>= se, z -= se, xe = 0, U = 11 + (k & 127), k >>>= 7, z -= 7;
+                }
+                if (a.have + U > a.nlen + a.ndist) {
+                  S.msg = "invalid bit length repeat", a.mode = ce;
+                  break;
+                }
+                for (; U--; )
+                  a.lens[a.have++] = xe;
+              }
+            }
+            if (a.mode === ce)
+              break;
+            if (a.lens[256] === 0) {
+              S.msg = "invalid code -- missing end-of-block", a.mode = ce;
+              break;
+            }
+            if (a.lenbits = 9, He = { bits: a.lenbits }, Oe = y(t, a.lens, 0, a.nlen, a.lencode, 0, a.work, He), a.lenbits = He.bits, Oe) {
+              S.msg = "invalid literal/lengths set", a.mode = ce;
+              break;
+            }
+            if (a.distbits = 6, a.distcode = a.distdyn, He = { bits: a.distbits }, Oe = y(r, a.lens, a.nlen, a.ndist, a.distcode, 0, a.work, He), a.distbits = He.bits, Oe) {
+              S.msg = "invalid distances set", a.mode = ce;
+              break;
+            }
+            if (a.mode = F, L === v)
+              break e;
+          case F:
+            a.mode = $;
+          case $:
+            if (O >= 6 && f >= 258) {
+              S.next_out = R, S.avail_out = f, S.next_in = e, S.avail_in = O, a.hold = k, a.bits = z, G(S, Q), R = S.next_out, te = S.output, f = S.avail_out, e = S.next_in, I = S.input, O = S.avail_in, k = a.hold, z = a.bits, a.mode === Z && (a.back = -1);
+              break;
+            }
+            for (a.back = 0; pe = a.lencode[k & (1 << a.lenbits) - 1], se = pe >>> 24, Ee = pe >>> 16 & 255, Be = pe & 65535, !(se <= z); ) {
+              if (O === 0)
+                break e;
+              O--, k += I[e++] << z, z += 8;
+            }
+            if (Ee && !(Ee & 240)) {
+              for (Ne = se, Ve = Ee, Ue = Be; pe = a.lencode[Ue + ((k & (1 << Ne + Ve) - 1) >> Ne)], se = pe >>> 24, Ee = pe >>> 16 & 255, Be = pe & 65535, !(Ne + se <= z); ) {
+                if (O === 0)
+                  break e;
+                O--, k += I[e++] << z, z += 8;
+              }
+              k >>>= Ne, z -= Ne, a.back += Ne;
+            }
+            if (k >>>= se, z -= se, a.back += se, a.length = Be, Ee === 0) {
+              a.mode = de;
+              break;
+            }
+            if (Ee & 32) {
+              a.back = -1, a.mode = Z;
+              break;
+            }
+            if (Ee & 64) {
+              S.msg = "invalid literal/length code", a.mode = ce;
+              break;
+            }
+            a.extra = Ee & 15, a.mode = ve;
+          case ve:
+            if (a.extra) {
+              for (Pe = a.extra; z < Pe; ) {
+                if (O === 0)
+                  break e;
+                O--, k += I[e++] << z, z += 8;
+              }
+              a.length += k & (1 << a.extra) - 1, k >>>= a.extra, z -= a.extra, a.back += a.extra;
+            }
+            a.was = a.length, a.mode = fe;
+          case fe:
+            for (; pe = a.distcode[k & (1 << a.distbits) - 1], se = pe >>> 24, Ee = pe >>> 16 & 255, Be = pe & 65535, !(se <= z); ) {
+              if (O === 0)
+                break e;
+              O--, k += I[e++] << z, z += 8;
+            }
+            if (!(Ee & 240)) {
+              for (Ne = se, Ve = Ee, Ue = Be; pe = a.distcode[Ue + ((k & (1 << Ne + Ve) - 1) >> Ne)], se = pe >>> 24, Ee = pe >>> 16 & 255, Be = pe & 65535, !(Ne + se <= z); ) {
+                if (O === 0)
+                  break e;
+                O--, k += I[e++] << z, z += 8;
+              }
+              k >>>= Ne, z -= Ne, a.back += Ne;
+            }
+            if (k >>>= se, z -= se, a.back += se, Ee & 64) {
+              S.msg = "invalid distance code", a.mode = ce;
+              break;
+            }
+            a.offset = Be, a.extra = Ee & 15, a.mode = le;
+          case le:
+            if (a.extra) {
+              for (Pe = a.extra; z < Pe; ) {
+                if (O === 0)
+                  break e;
+                O--, k += I[e++] << z, z += 8;
+              }
+              a.offset += k & (1 << a.extra) - 1, k >>>= a.extra, z -= a.extra, a.back += a.extra;
+            }
+            if (a.offset > a.dmax) {
+              S.msg = "invalid distance too far back", a.mode = ce;
+              break;
+            }
+            a.mode = he;
+          case he:
+            if (f === 0)
+              break e;
+            if (U = Q - f, a.offset > U) {
+              if (U = a.offset - U, U > a.whave && a.sane) {
+                S.msg = "invalid distance too far back", a.mode = ce;
+                break;
+              }
+              U > a.wnext ? (U -= a.wnext, ue = a.wsize - U) : ue = a.wnext - U, U > a.length && (U = a.length), Ge = a.window;
+            } else
+              Ge = te, ue = R - a.offset, U = a.length;
+            U > f && (U = f), f -= U, a.length -= U;
+            do
+              te[R++] = Ge[ue++];
+            while (--U);
+            a.length === 0 && (a.mode = $);
+            break;
+          case de:
+            if (f === 0)
+              break e;
+            te[R++] = a.length, f--, a.mode = $;
+            break;
+          case ge:
+            if (a.wrap) {
+              for (; z < 32; ) {
+                if (O === 0)
+                  break e;
+                O--, k |= I[e++] << z, z += 8;
+              }
+              if (Q -= f, S.total_out += Q, a.total += Q, Q && (S.adler = a.check = /*UPDATE(state.check, put - _out, _out);*/
+              a.flags ? ne(a.check, te, Q, R - Q) : ae(a.check, te, Q, R - Q)), Q = f, (a.flags ? k : _e(k)) !== a.check) {
+                S.msg = "incorrect data check", a.mode = ce;
+                break;
+              }
+              k = 0, z = 0;
+            }
+            a.mode = ze;
+          case ze:
+            if (a.wrap && a.flags) {
+              for (; z < 32; ) {
+                if (O === 0)
+                  break e;
+                O--, k += I[e++] << z, z += 8;
+              }
+              if (k !== (a.total & 4294967295)) {
+                S.msg = "incorrect length check", a.mode = ce;
+                break;
+              }
+              k = 0, z = 0;
+            }
+            a.mode = ke;
+          case ke:
+            Oe = l;
+            break e;
+          case ce:
+            Oe = _;
+            break e;
+          case Se:
+            return u;
+          case me:
+          default:
+            return x;
+        }
+    return S.next_out = R, S.avail_out = f, S.next_in = e, S.avail_in = O, a.hold = k, a.bits = z, (a.wsize || Q !== S.avail_out && a.mode < ce && (a.mode < ge || L !== i)) && Xe(S, S.output, S.next_out, Q - S.avail_out), re -= S.avail_in, Q -= S.avail_out, S.total_in += re, S.total_out += Q, a.total += Q, a.wrap && Q && (S.adler = a.check = /*UPDATE(state.check, strm.next_out - _out, _out);*/
+    a.flags ? ne(a.check, te, Q, S.next_out - Q) : ae(a.check, te, Q, S.next_out - Q)), S.data_type = a.bits + (a.last ? 64 : 0) + (a.mode === Z ? 128 : 0) + (a.mode === F || a.mode === W ? 256 : 0), (re === 0 && Q === 0 || L === i) && Oe === d && (Oe = c), Oe;
+  }
+  function j(S) {
+    if (!S || !S.state)
+      return x;
+    var L = S.state;
+    return L.window && (L.window = null), S.state = null, d;
+  }
+  function Y(S, L) {
+    var a;
+    return !S || !S.state || (a = S.state, !(a.wrap & 2)) ? x : (a.head = L, L.done = !1, d);
+  }
+  function q(S, L) {
+    var a = L.length, I, te, e;
+    return !S || !S.state || (I = S.state, I.wrap !== 0 && I.mode !== M) ? x : I.mode === M && (te = 1, te = ae(te, L, a, 0), te !== I.check) ? _ : (e = Xe(S, L, a, a), e ? (I.mode = Se, u) : (I.havedict = 1, d));
+  }
+  return Le.inflateReset = Ae, Le.inflateReset2 = We, Le.inflateResetKeep = be, Le.inflateInit = Me, Le.inflateInit2 = je, Le.inflate = h, Le.inflateEnd = j, Le.inflateGetHeader = Y, Le.inflateSetDictionary = q, Le.inflateInfo = "pako inflate (from Nodeca project)", Le;
+}
+var n0, E0;
+function O0() {
+  return E0 || (E0 = 1, n0 = {
+    /* Allowed flush values; see deflate() and inflate() below for details */
+    Z_NO_FLUSH: 0,
+    Z_PARTIAL_FLUSH: 1,
+    Z_SYNC_FLUSH: 2,
+    Z_FULL_FLUSH: 3,
+    Z_FINISH: 4,
+    Z_BLOCK: 5,
+    Z_TREES: 6,
+    /* Return codes for the compression/decompression functions. Negative values
+    * are errors, positive values are used for special but normal events.
+    */
+    Z_OK: 0,
+    Z_STREAM_END: 1,
+    Z_NEED_DICT: 2,
+    Z_ERRNO: -1,
+    Z_STREAM_ERROR: -2,
+    Z_DATA_ERROR: -3,
+    //Z_MEM_ERROR:     -4,
+    Z_BUF_ERROR: -5,
+    //Z_VERSION_ERROR: -6,
+    /* compression levels */
+    Z_NO_COMPRESSION: 0,
+    Z_BEST_SPEED: 1,
+    Z_BEST_COMPRESSION: 9,
+    Z_DEFAULT_COMPRESSION: -1,
+    Z_FILTERED: 1,
+    Z_HUFFMAN_ONLY: 2,
+    Z_RLE: 3,
+    Z_FIXED: 4,
+    Z_DEFAULT_STRATEGY: 0,
+    /* Possible values of the data_type field (though see inflate()) */
+    Z_BINARY: 0,
+    Z_TEXT: 1,
+    //Z_ASCII:                1, // = Z_TEXT (deprecated)
+    Z_UNKNOWN: 2,
+    /* The deflate compression method */
+    Z_DEFLATED: 8
+    //Z_NULL:                 null // Use -1 or null inline, depending on var type
+  }), n0;
+}
+var f0, S0;
+function J0() {
+  if (S0) return f0;
+  S0 = 1;
+  function K() {
+    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;
+  }
+  return f0 = K, f0;
+}
+var y0;
+function K0() {
+  if (y0) return Qe;
+  y0 = 1;
+  var K = I0(), ae = Je(), ne = R0(), G = O0(), y = h0(), J = N0(), t = J0(), r = Object.prototype.toString;
+  function i(d) {
+    if (!(this instanceof i)) return new i(d);
+    this.options = ae.assign({
+      chunkSize: 16384,
+      windowBits: 0,
+      to: ""
+    }, d || {});
+    var l = this.options;
+    l.raw && l.windowBits >= 0 && l.windowBits < 16 && (l.windowBits = -l.windowBits, l.windowBits === 0 && (l.windowBits = -15)), l.windowBits >= 0 && l.windowBits < 16 && !(d && d.windowBits) && (l.windowBits += 32), l.windowBits > 15 && l.windowBits < 48 && (l.windowBits & 15 || (l.windowBits |= 15)), this.err = 0, this.msg = "", this.ended = !1, this.chunks = [], this.strm = new J(), this.strm.avail_out = 0;
+    var s = K.inflateInit2(
+      this.strm,
+      l.windowBits
+    );
+    if (s !== G.Z_OK)
+      throw new Error(y[s]);
+    if (this.header = new t(), K.inflateGetHeader(this.strm, this.header), l.dictionary && (typeof l.dictionary == "string" ? l.dictionary = ne.string2buf(l.dictionary) : r.call(l.dictionary) === "[object ArrayBuffer]" && (l.dictionary = new Uint8Array(l.dictionary)), l.raw && (s = K.inflateSetDictionary(this.strm, l.dictionary), s !== G.Z_OK)))
+      throw new Error(y[s]);
+  }
+  i.prototype.push = function(d, l) {
+    var s = this.strm, x = this.options.chunkSize, _ = this.options.dictionary, u, c, o, n, w, g = !1;
+    if (this.ended)
+      return !1;
+    c = l === ~~l ? l : l === !0 ? G.Z_FINISH : G.Z_NO_FLUSH, typeof d == "string" ? s.input = ne.binstring2buf(d) : r.call(d) === "[object ArrayBuffer]" ? s.input = new Uint8Array(d) : s.input = d, s.next_in = 0, s.avail_in = s.input.length;
+    do {
+      if (s.avail_out === 0 && (s.output = new ae.Buf8(x), s.next_out = 0, s.avail_out = x), u = K.inflate(s, G.Z_NO_FLUSH), u === G.Z_NEED_DICT && _ && (u = K.inflateSetDictionary(this.strm, _)), u === G.Z_BUF_ERROR && g === !0 && (u = G.Z_OK, g = !1), u !== G.Z_STREAM_END && u !== G.Z_OK)
+        return this.onEnd(u), this.ended = !0, !1;
+      s.next_out && (s.avail_out === 0 || u === G.Z_STREAM_END || s.avail_in === 0 && (c === G.Z_FINISH || c === G.Z_SYNC_FLUSH)) && (this.options.to === "string" ? (o = ne.utf8border(s.output, s.next_out), n = s.next_out - o, w = ne.buf2string(s.output, o), s.next_out = n, s.avail_out = x - n, n && ae.arraySet(s.output, s.output, o, n, 0), this.onData(w)) : this.onData(ae.shrinkBuf(s.output, s.next_out))), s.avail_in === 0 && s.avail_out === 0 && (g = !0);
+    } while ((s.avail_in > 0 || s.avail_out === 0) && u !== G.Z_STREAM_END);
+    return u === G.Z_STREAM_END && (c = G.Z_FINISH), c === G.Z_FINISH ? (u = K.inflateEnd(this.strm), this.onEnd(u), this.ended = !0, u === G.Z_OK) : (c === G.Z_SYNC_FLUSH && (this.onEnd(G.Z_OK), s.avail_out = 0), !0);
+  }, i.prototype.onData = function(d) {
+    this.chunks.push(d);
+  }, i.prototype.onEnd = function(d) {
+    d === G.Z_OK && (this.options.to === "string" ? this.result = this.chunks.join("") : this.result = ae.flattenChunks(this.chunks)), this.chunks = [], this.err = d, this.msg = this.strm.msg;
+  };
+  function b(d, l) {
+    var s = new i(l);
+    if (s.push(d, !0), s.err)
+      throw s.msg || y[s.err];
+    return s.result;
+  }
+  function v(d, l) {
+    return l = l || {}, l.raw = !0, b(d, l);
+  }
+  return Qe.Inflate = i, Qe.inflate = b, Qe.inflateRaw = v, Qe.ungzip = b, Qe;
+}
+var l0, A0;
+function Y0() {
+  if (A0) return l0;
+  A0 = 1;
+  var K = Je().assign, ae = G0(), ne = K0(), G = O0(), y = {};
+  return K(y, ae, ne, G), l0 = y, l0;
+}
+(function(K) {
+  (function() {
+    var ae = {};
+    K.exports = ae;
+    var ne;
+    typeof m0 == "function" ? ne = Y0() : ne = self.pako;
+    function G() {
+      typeof process > "u" && console.log.apply(console, arguments);
+    }
+    (function(y, J) {
+      (function() {
+        var t = typeof Symbol == "function" && typeof Symbol.iterator == "symbol" ? function(b) {
+          return typeof b;
+        } : function(b) {
+          return b && typeof Symbol == "function" && b.constructor === Symbol && b !== Symbol.prototype ? "symbol" : typeof b;
+        }, r = function() {
+          function b(v) {
+            this.message = "JPEG error: " + v;
+          }
+          return b.prototype = Error(), b.prototype.name = "JpegError", b.constructor = b;
+        }(), i = function() {
+          function b(v, d) {
+            this.message = v, this.g = d;
+          }
+          return b.prototype = Error(), b.prototype.name = "DNLMarkerError", b.constructor = b;
+        }();
+        (function() {
+          function b() {
+            this.M = null, this.B = -1;
+          }
+          function v(_, u) {
+            for (var c = 0, o = [], n, w, g = 16; 0 < g && !_[g - 1]; ) g--;
+            o.push({ children: [], index: 0 });
+            var p = o[0], E;
+            for (n = 0; n < g; n++) {
+              for (w = 0; w < _[n]; w++) {
+                for (p = o.pop(), p.children[p.index] = u[c]; 0 < p.index; ) p = o.pop();
+                for (p.index++, o.push(p); o.length <= n; ) o.push(E = { children: [], index: 0 }), p.children[p.index] = E.children, p = E;
+                c++;
+              }
+              n + 1 < g && (o.push(E = { children: [], index: 0 }), p.children[p.index] = E.children, p = E);
+            }
+            return o[0].children;
+          }
+          function d(_, u, c, o, n, w, g, p, E) {
+            function A() {
+              if (0 < T) return T--, ie >> T & 1;
+              if (ie = _[u++], ie === 255) {
+                var V = _[u++];
+                if (V) {
+                  if (V === 220 && W) {
+                    u += 2;
+                    var ee = _[u++] << 8 | _[u++];
+                    if (0 < ee && ee !== c.g) throw new i("Found DNL marker (0xFFDC) while parsing scan data", ee);
+                  }
+                  throw new r("unexpected marker " + (ie << 8 | V).toString(16));
+                }
+              }
+              return T = 7, ie >>> 7;
+            }
+            function N(V) {
+              for (; ; ) {
+                if (V = V[A()], typeof V == "number") return V;
+                if ((typeof V > "u" ? "undefined" : t(V)) !== "object") throw new r("invalid huffman sequence");
+              }
+            }
+            function D(V) {
+              for (var ee = 0; 0 < V; ) ee = ee << 1 | A(), V--;
+              return ee;
+            }
+            function B(V) {
+              if (V === 1) return A() === 1 ? 1 : -1;
+              var ee = D(V);
+              return ee >= 1 << V - 1 ? ee : ee + (-1 << V) + 1;
+            }
+            function P(V, ee) {
+              var _e = N(V.D);
+              for (_e = _e === 0 ? 0 : B(_e), V.a[ee] = V.m += _e, _e = 1; 64 > _e; ) {
+                var we = N(V.o), be = we & 15;
+                if (we >>= 4, be === 0) {
+                  if (15 > we) break;
+                  _e += 16;
+                } else _e += we, V.a[ee + x[_e]] = B(be), _e++;
+              }
+            }
+            function M(V, ee) {
+              var _e = N(V.D);
+              _e = _e === 0 ? 0 : B(_e) << E, V.a[ee] = V.m += _e;
+            }
+            function Z(V, ee) {
+              V.a[ee] |= A() << E;
+            }
+            function H(V, ee) {
+              if (0 < F) F--;
+              else for (var _e = w; _e <= g; ) {
+                var we = N(V.o), be = we & 15;
+                if (we >>= 4, be === 0) {
+                  if (15 > we) {
+                    F = D(we) + (1 << we) - 1;
+                    break;
+                  }
+                  _e += 16;
+                } else _e += we, V.a[ee + x[_e]] = B(be) * (1 << E), _e++;
+              }
+            }
+            function X(V, ee) {
+              for (var _e = w, we = 0, be; _e <= g; ) {
+                be = ee + x[_e];
+                var Ae = 0 > V.a[be] ? -1 : 1;
+                switch ($) {
+                  case 0:
+                    if (we = N(V.o), be = we & 15, we >>= 4, be === 0) 15 > we ? (F = D(we) + (1 << we), $ = 4) : (we = 16, $ = 1);
+                    else {
+                      if (be !== 1) throw new r("invalid ACn encoding");
+                      ve = B(be), $ = we ? 2 : 3;
+                    }
+                    continue;
+                  case 1:
+                  case 2:
+                    V.a[be] ? V.a[be] += Ae * (A() << E) : (we--, we === 0 && ($ = $ === 2 ? 3 : 0));
+                    break;
+                  case 3:
+                    V.a[be] ? V.a[be] += Ae * (A() << E) : (V.a[be] = ve << E, $ = 0);
+                    break;
+                  case 4:
+                    V.a[be] && (V.a[be] += Ae * (A() << E));
+                }
+                _e++;
+              }
+              $ === 4 && (F--, F === 0 && ($ = 0));
+            }
+            for (var W = 9 < arguments.length && arguments[9] !== void 0 ? arguments[9] : !1, C = c.P, m = u, ie = 0, T = 0, F = 0, $ = 0, ve, fe = o.length, le, he, de, ge, ze = c.S ? w === 0 ? p === 0 ? M : Z : p === 0 ? H : X : P, ke = 0, ce = fe === 1 ? o[0].c * o[0].l : C * c.O, Se, me; ke < ce; ) {
+              var Re = n ? Math.min(ce - ke, n) : ce;
+              for (le = 0; le < fe; le++) o[le].m = 0;
+              if (F = 0, fe === 1) {
+                var oe = o[0];
+                for (ge = 0; ge < Re; ge++) ze(oe, 64 * ((oe.c + 1) * (ke / oe.c | 0) + ke % oe.c)), ke++;
+              } else for (ge = 0; ge < Re; ge++) {
+                for (le = 0; le < fe; le++) for (oe = o[le], Se = oe.h, me = oe.j, he = 0; he < me; he++) for (de = 0; de < Se; de++) ze(oe, 64 * ((oe.c + 1) * ((ke / C | 0) * oe.j + he) + (ke % C * oe.h + de)));
+                ke++;
+              }
+              if (T = 0, (oe = s(_, u)) && oe.f && ((0, _util.warn)("decodeScan - unexpected MCU data, current marker is: " + oe.f), u = oe.offset), oe = oe && oe.F, !oe || 65280 >= oe) throw new r("marker was not found");
+              if (65488 <= oe && 65495 >= oe) u += 2;
+              else break;
+            }
+            return (oe = s(_, u)) && oe.f && ((0, _util.warn)("decodeScan - unexpected Scan data, current marker is: " + oe.f), u = oe.offset), u - m;
+          }
+          function l(_, u) {
+            for (var c = u.c, o = u.l, n = new Int16Array(64), w = 0; w < o; w++) for (var g = 0; g < c; g++) {
+              var p = 64 * ((u.c + 1) * w + g), E = n, A = u.G, N = u.a;
+              if (!A) throw new r("missing required Quantization Table.");
+              for (var D = 0; 64 > D; D += 8) {
+                var B = N[p + D], P = N[p + D + 1], M = N[p + D + 2], Z = N[p + D + 3], H = N[p + D + 4], X = N[p + D + 5], W = N[p + D + 6], C = N[p + D + 7];
+                if (B *= A[D], !(P | M | Z | H | X | W | C)) B = 5793 * B + 512 >> 10, E[D] = B, E[D + 1] = B, E[D + 2] = B, E[D + 3] = B, E[D + 4] = B, E[D + 5] = B, E[D + 6] = B, E[D + 7] = B;
+                else {
+                  P *= A[D + 1], M *= A[D + 2], Z *= A[D + 3], H *= A[D + 4], X *= A[D + 5], W *= A[D + 6], C *= A[D + 7];
+                  var m = 5793 * B + 128 >> 8, ie = 5793 * H + 128 >> 8, T = M, F = W;
+                  H = 2896 * (P - C) + 128 >> 8, C = 2896 * (P + C) + 128 >> 8, Z <<= 4, X <<= 4, m = m + ie + 1 >> 1, ie = m - ie, B = 3784 * T + 1567 * F + 128 >> 8, T = 1567 * T - 3784 * F + 128 >> 8, F = B, H = H + X + 1 >> 1, X = H - X, C = C + Z + 1 >> 1, Z = C - Z, m = m + F + 1 >> 1, F = m - F, ie = ie + T + 1 >> 1, T = ie - T, B = 2276 * H + 3406 * C + 2048 >> 12, H = 3406 * H - 2276 * C + 2048 >> 12, C = B, B = 799 * Z + 4017 * X + 2048 >> 12, Z = 4017 * Z - 799 * X + 2048 >> 12, X = B, E[D] = m + C, E[D + 7] = m - C, E[D + 1] = ie + X, E[D + 6] = ie - X, E[D + 2] = T + Z, E[D + 5] = T - Z, E[D + 3] = F + H, E[D + 4] = F - H;
+                }
+              }
+              for (A = 0; 8 > A; ++A) B = E[A], P = E[A + 8], M = E[A + 16], Z = E[A + 24], H = E[A + 32], X = E[A + 40], W = E[A + 48], C = E[A + 56], P | M | Z | H | X | W | C ? (m = 5793 * B + 2048 >> 12, ie = 5793 * H + 2048 >> 12, T = M, F = W, H = 2896 * (P - C) + 2048 >> 12, C = 2896 * (P + C) + 2048 >> 12, m = (m + ie + 1 >> 1) + 4112, ie = m - ie, B = 3784 * T + 1567 * F + 2048 >> 12, T = 1567 * T - 3784 * F + 2048 >> 12, F = B, H = H + X + 1 >> 1, X = H - X, C = C + Z + 1 >> 1, Z = C - Z, m = m + F + 1 >> 1, F = m - F, ie = ie + T + 1 >> 1, T = ie - T, B = 2276 * H + 3406 * C + 2048 >> 12, H = 3406 * H - 2276 * C + 2048 >> 12, C = B, B = 799 * Z + 4017 * X + 2048 >> 12, Z = 4017 * Z - 799 * X + 2048 >> 12, X = B, B = m + C, C = m - C, P = ie + X, W = ie - X, M = T + Z, X = T - Z, Z = F + H, H = F - H, B = 16 > B ? 0 : 4080 <= B ? 255 : B >> 4, P = 16 > P ? 0 : 4080 <= P ? 255 : P >> 4, M = 16 > M ? 0 : 4080 <= M ? 255 : M >> 4, Z = 16 > Z ? 0 : 4080 <= Z ? 255 : Z >> 4, H = 16 > H ? 0 : 4080 <= H ? 255 : H >> 4, X = 16 > X ? 0 : 4080 <= X ? 255 : X >> 4, W = 16 > W ? 0 : 4080 <= W ? 255 : W >> 4, C = 16 > C ? 0 : 4080 <= C ? 255 : C >> 4, N[p + A] = B, N[p + A + 8] = P, N[p + A + 16] = M, N[p + A + 24] = Z, N[p + A + 32] = H, N[p + A + 40] = X, N[p + A + 48] = W, N[p + A + 56] = C) : (B = 5793 * B + 8192 >> 14, B = -2040 > B ? 0 : 2024 <= B ? 255 : B + 2056 >> 4, N[p + A] = B, N[p + A + 8] = B, N[p + A + 16] = B, N[p + A + 24] = B, N[p + A + 32] = B, N[p + A + 40] = B, N[p + A + 48] = B, N[p + A + 56] = B);
+            }
+            return u.a;
+          }
+          function s(_, u) {
+            var c = 2 < arguments.length && arguments[2] !== void 0 ? arguments[2] : u, o = _.length - 1;
+            if (c = c < u ? c : u, u >= o) return null;
+            var n = _[u] << 8 | _[u + 1];
+            if (65472 <= n && 65534 >= n) return { f: null, F: n, offset: u };
+            for (var w = _[c] << 8 | _[c + 1]; !(65472 <= w && 65534 >= w); ) {
+              if (++c >= o) return null;
+              w = _[c] << 8 | _[c + 1];
+            }
+            return { f: n.toString(16), F: w, offset: c };
+          }
+          var x = 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
+          ]);
+          b.prototype = { parse: function(_) {
+            function u() {
+              var T = _[g] << 8 | _[g + 1];
+              return g += 2, T;
+            }
+            function c() {
+              var T = u();
+              T = g + T - 2;
+              var F = s(_, T, g);
+              return F && F.f && ((0, _util.warn)("readDataBlock - incorrect length, current marker is: " + F.f), T = F.offset), T = _.subarray(g, T), g += T.length, T;
+            }
+            function o(T) {
+              for (var F = Math.ceil(T.v / 8 / T.s), $ = Math.ceil(T.g / 8 / T.u), ve = 0; ve < T.b.length; ve++) {
+                m = T.b[ve];
+                var fe = Math.ceil(Math.ceil(T.v / 8) * m.h / T.s), le = Math.ceil(Math.ceil(T.g / 8) * m.j / T.u);
+                m.a = new Int16Array(64 * $ * m.j * (F * m.h + 1)), m.c = fe, m.l = le;
+              }
+              T.P = F, T.O = $;
+            }
+            var n = (1 < arguments.length && arguments[1] !== void 0 ? arguments[1] : {}).N, w = n === void 0 ? null : n, g = 0, p = null, E = 0;
+            n = [];
+            var A = [], N = [], D = u();
+            if (D !== 65496) throw new r("SOI not found");
+            for (D = u(); D !== 65497; ) {
+              switch (D) {
+                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 B = c();
+                  D === 65518 && B[0] === 65 && B[1] === 100 && B[2] === 111 && B[3] === 98 && B[4] === 101 && (p = { version: B[5] << 8 | B[6], Y: B[7] << 8 | B[8], Z: B[9] << 8 | B[10], W: B[11] });
+                  break;
+                case 65499:
+                  D = u() + g - 2;
+                  for (var P; g < D; ) {
+                    var M = _[g++], Z = new Uint16Array(64);
+                    if (M >> 4) if (M >> 4 === 1) for (B = 0; 64 > B; B++) P = x[B], Z[P] = u();
+                    else throw new r("DQT - invalid table spec");
+                    else for (B = 0; 64 > B; B++) P = x[B], Z[P] = _[g++];
+                    n[M & 15] = Z;
+                  }
+                  break;
+                case 65472:
+                case 65473:
+                case 65474:
+                  if (H) throw new r("Only single frame JPEGs supported");
+                  u();
+                  var H = {};
+                  for (H.X = D === 65473, H.S = D === 65474, H.precision = _[g++], D = u(), H.g = w || D, H.v = u(), H.b = [], H.C = {}, B = _[g++], D = Z = M = 0; D < B; D++) {
+                    P = _[g];
+                    var X = _[g + 1] >> 4, W = _[g + 1] & 15;
+                    M < X && (M = X), Z < W && (Z = W), X = H.b.push({ h: X, j: W, T: _[g + 2], G: null }), H.C[P] = X - 1, g += 3;
+                  }
+                  H.s = M, H.u = Z, o(H);
+                  break;
+                case 65476:
+                  for (P = u(), D = 2; D < P; ) {
+                    for (M = _[g++], Z = new Uint8Array(16), B = X = 0; 16 > B; B++, g++) X += Z[B] = _[g];
+                    for (W = new Uint8Array(X), B = 0; B < X; B++, g++) W[B] = _[g];
+                    D += 17 + X, (M >> 4 ? A : N)[M & 15] = v(Z, W);
+                  }
+                  break;
+                case 65501:
+                  u();
+                  var C = u();
+                  break;
+                case 65498:
+                  for (B = ++E === 1 && !w, u(), M = _[g++], P = [], D = 0; D < M; D++) {
+                    Z = H.C[_[g++]];
+                    var m = H.b[Z];
+                    Z = _[g++], m.D = N[Z >> 4], m.o = A[Z & 15], P.push(m);
+                  }
+                  D = _[g++], M = _[g++], Z = _[g++];
+                  try {
+                    var ie = d(_, g, H, P, C, D, M, Z >> 4, Z & 15, B);
+                    g += ie;
+                  } catch (T) {
+                    if (T instanceof i) return (0, _util.warn)('Attempting to re-parse JPEG image using "scanLines" parameter found in DNL marker (0xFFDC) segment.'), this.parse(_, { N: T.g });
+                    throw T;
+                  }
+                  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 ((B = s(_, g - 2)) && B.f) (0, _util.warn)("JpegImage.parse - unexpected data, current marker is: " + B.f), g = B.offset;
+                  else throw new r("unknown marker " + D.toString(16));
+              }
+              D = u();
+            }
+            for (this.width = H.v, this.height = H.g, this.A = p, this.b = [], D = 0; D < H.b.length; D++)
+              m = H.b[D], (C = n[m.T]) && (m.G = C), this.b.push({ R: l(H, m), U: m.h / H.s, V: m.j / H.u, c: m.c, l: m.l });
+            this.i = this.b.length;
+          }, L: function(_, u) {
+            var c = this.width / _, o = this.height / u, n, w, g = this.b.length, p = _ * u * g, E = new Uint8ClampedArray(p), A = new Uint32Array(_);
+            for (w = 0; w < g; w++) {
+              var N = this.b[w], D = N.U * c, B = N.V * o, P = w, M = N.R, Z = N.c + 1 << 3;
+              for (n = 0; n < _; n++) N = 0 | n * D, A[n] = (N & 4294967288) << 3 | N & 7;
+              for (D = 0; D < u; D++) for (N = 0 | D * B, N = Z * (N & 4294967288) | (N & 7) << 3, n = 0; n < _; n++) E[P] = M[N + A[n]], P += g;
+            }
+            if (o = this.M) for (w = 0; w < p; ) for (c = N = 0; N < g; N++, w++, c += 2) E[w] = (E[w] * o[c] >> 8) + o[c + 1];
+            return E;
+          }, w: function() {
+            return this.A ? !!this.A.W : this.i === 3 ? this.B !== 0 : this.B === 1;
+          }, I: function(_) {
+            for (var u, c, o, n = 0, w = _.length; n < w; n += 3) u = _[n], c = _[n + 1], o = _[n + 2], _[n] = u - 179.456 + 1.402 * o, _[n + 1] = u + 135.459 - 0.344 * c - 0.714 * o, _[n + 2] = u - 226.816 + 1.772 * c;
+            return _;
+          }, K: function(_) {
+            for (var u, c, o, n, w = 0, g = 0, p = _.length; g < p; g += 4) u = _[g], c = _[g + 1], o = _[g + 2], n = _[g + 3], _[w++] = -122.67195406894 + c * (-660635669420364e-19 * c + 437130475926232e-18 * o - 54080610064599e-18 * u + 48449797120281e-17 * n - 0.154362151871126) + o * (-957964378445773e-18 * o + 817076911346625e-18 * u - 0.00477271405408747 * n + 1.53380253221734) + u * (961250184130688e-18 * u - 0.00266257332283933 * n + 0.48357088451265) + n * (-336197177618394e-18 * n + 0.484791561490776), _[w++] = 107.268039397724 + c * (219927104525741e-19 * c - 640992018297945e-18 * o + 659397001245577e-18 * u + 426105652938837e-18 * n - 0.176491792462875) + o * (-778269941513683e-18 * o + 0.00130872261408275 * u + 770482631801132e-18 * n - 0.151051492775562) + u * (0.00126935368114843 * u - 0.00265090189010898 * n + 0.25802910206845) + n * (-318913117588328e-18 * n - 0.213742400323665), _[w++] = -20.810012546947 + c * (-570115196973677e-18 * c - 263409051004589e-19 * o + 0.0020741088115012 * u - 0.00288260236853442 * n + 0.814272968359295) + o * (-153496057440975e-19 * o - 132689043961446e-18 * u + 560833691242812e-18 * n - 0.195152027534049) + u * (0.00174418132927582 * u - 0.00255243321439347 * n + 0.116935020465145) + n * (-343531996510555e-18 * n + 0.24165260232407);
+            return _.subarray(
+              0,
+              w
+            );
+          }, J: function(_) {
+            for (var u, c, o, n = 0, w = _.length; n < w; n += 4) u = _[n], c = _[n + 1], o = _[n + 2], _[n] = 434.456 - u - 1.402 * o, _[n + 1] = 119.541 - u + 0.344 * c + 0.714 * o, _[n + 2] = 481.816 - u - 1.772 * c;
+            return _;
+          }, H: function(_) {
+            for (var u, c, o, n, w = 0, g = 1 / 255, p = 0, E = _.length; p < E; p += 4) u = _[p] * g, c = _[p + 1] * g, o = _[p + 2] * g, n = _[p + 3] * g, _[w++] = 255 + u * (-4.387332384609988 * u + 54.48615194189176 * c + 18.82290502165302 * o + 212.25662451639585 * n - 285.2331026137004) + c * (1.7149763477362134 * c - 5.6096736904047315 * o - 17.873870861415444 * n - 5.497006427196366) + o * (-2.5217340131683033 * o - 21.248923337353073 * n + 17.5119270841813) - n * (21.86122147463605 * n + 189.48180835922747), _[w++] = 255 + u * (8.841041422036149 * u + 60.118027045597366 * c + 6.871425592049007 * o + 31.159100130055922 * n - 79.2970844816548) + c * (-15.310361306967817 * c + 17.575251261109482 * o + 131.35250912493976 * n - 190.9453302588951) + o * (4.444339102852739 * o + 9.8632861493405 * n - 24.86741582555878) - n * (20.737325471181034 * n + 187.80453709719578), _[w++] = 255 + u * (0.8842522430003296 * u + 8.078677503112928 * c + 30.89978309703729 * o - 0.23883238689178934 * n - 14.183576799673286) + c * (10.49593273432072 * c + 63.02378494754052 * o + 50.606957656360734 * n - 112.23884253719248) + o * (0.03296041114873217 * o + 115.60384449646641 * n - 193.58209356861505) - n * (22.33816807309886 * n + 180.12613974708367);
+            return _.subarray(0, w);
+          }, getData: function(_, u, c) {
+            if (4 < this.i) throw new r("Unsupported color mode");
+            if (_ = this.L(_, u), this.i === 1 && c) {
+              c = _.length, u = new Uint8ClampedArray(3 * c);
+              for (var o = 0, n = 0; n < c; n++) {
+                var w = _[n];
+                u[o++] = w, u[o++] = w, u[o++] = w;
+              }
+              return u;
+            }
+            if (this.i === 3 && this.w()) return this.I(_);
+            if (this.i === 4) {
+              if (this.w()) return c ? this.K(_) : this.J(_);
+              if (c) return this.H(_);
+            }
+            return _;
+          } }, y.JpegDecoder = b;
+        })();
+      })(), y.encodeImage = function(t, r, i, b) {
+        var v = {
+          t256: [r],
+          t257: [i],
+          t258: [8, 8, 8, 8],
+          t259: [1],
+          t262: [2],
+          t273: [1e3],
+          // strips offset
+          t277: [4],
+          t278: [i],
+          /* rows per strip */
+          t279: [r * i * 4],
+          // strip byte counts
+          t282: [1],
+          t283: [1],
+          t284: [1],
+          t286: [0],
+          t287: [0],
+          t296: [1],
+          t305: ["Photopea (UTIF.js)"],
+          t338: [1]
+        };
+        if (b) for (var d in b) v[d] = b[d];
+        for (var l = new Uint8Array(y.encode([v])), s = new Uint8Array(t), x = new Uint8Array(1e3 + r * i * 4), d = 0; d < l.length; d++) x[d] = l[d];
+        for (var d = 0; d < s.length; d++) x[1e3 + d] = s[d];
+        return x.buffer;
+      }, y.encode = function(t) {
+        var r = new Uint8Array(2e4), i = 4, b = y._binBE;
+        r[0] = 77, r[1] = 77, r[3] = 42;
+        var v = 8;
+        b.writeUint(r, i, v), i += 4;
+        for (var d = 0; d < t.length; d++) {
+          var l = y._writeIFD(b, r, v, t[d]);
+          v = l[1], d < t.length - 1 && b.writeUint(r, l[0], v);
+        }
+        return r.slice(0, v).buffer;
+      }, y.decode = function(t) {
+        y.decode._decodeG3.allow2D = null;
+        var r = new Uint8Array(t), i = 0, b = y._binBE.readASCII(r, i, 2);
+        i += 2;
+        var v = b == "II" ? y._binLE : y._binBE;
+        v.readUshort(r, i), i += 2;
+        var d = v.readUint(r, i);
+        i += 4;
+        for (var l = []; ; ) {
+          var s = y._readIFD(v, r, d, l, 0, !1);
+          if (d = v.readUint(r, s), d == 0) break;
+        }
+        return l;
+      }, y.decodeImage = function(t, r, i) {
+        var b = new Uint8Array(t), v = y._binBE.readASCII(b, 0, 2);
+        if (r.t256 != null) {
+          r.isLE = v == "II", r.width = r.t256[0], r.height = r.t257[0];
+          var d = r.t259 ? r.t259[0] : 1, l = r.t266 ? r.t266[0] : 1;
+          r.t284 && r.t284[0] == 2 && G("PlanarConfiguration 2 should not be used!");
+          var s;
+          r.t258 ? s = Math.min(32, r.t258[0]) * r.t258.length : s = r.t277 ? r.t277[0] : 1, d == 1 && r.t279 != null && r.t278 && r.t262[0] == 32803 && (s = Math.round(r.t279[0] * 8 / (r.width * r.t278[0])));
+          var x = Math.ceil(r.width * s / 8) * 8, _ = r.t273;
+          _ == null && (_ = r.t324);
+          var u = r.t279;
+          d == 1 && _.length == 1 && (u = [r.height * (x >>> 3)]), u == null && (u = r.t325);
+          var c = new Uint8Array(r.height * (x >>> 3)), o = 0;
+          if (r.t322 != null) {
+            for (var n = r.t322[0], w = r.t323[0], g = Math.floor((r.width + n - 1) / n), p = Math.floor((r.height + w - 1) / w), E = new Uint8Array(Math.ceil(n * w * s / 8) | 0), A = 0; A < p; A++)
+              for (var N = 0; N < g; N++) {
+                for (var D = A * g + N, B = 0; B < E.length; B++) E[B] = 0;
+                y.decode._decompress(r, i, b, _[D], u[D], d, E, 0, l), d == 6 ? c = E : y._copyTile(E, Math.ceil(n * s / 8) | 0, w, c, Math.ceil(r.width * s / 8) | 0, r.height, Math.ceil(N * n * s / 8) | 0, A * w);
+              }
+            o = c.length * 8;
+          } else {
+            var P = r.t278 ? r.t278[0] : r.height;
+            P = Math.min(P, r.height);
+            for (var D = 0; D < _.length; D++)
+              y.decode._decompress(r, i, b, _[D], u[D], d, c, Math.ceil(o / 8) | 0, l), o += x * P;
+            o = Math.min(o, c.length * 8);
+          }
+          r.data = new Uint8Array(c.buffer, 0, Math.ceil(o / 8) | 0);
+        }
+      }, y.decode._decompress = function(t, r, i, b, v, d, l, s, x) {
+        if (d == 1 || v == l.length && d != 32767) for (var _ = 0; _ < v; _++) l[s + _] = i[b + _];
+        else if (d == 3) y.decode._decodeG3(i, b, v, l, s, t.width, x);
+        else if (d == 4) y.decode._decodeG4(i, b, v, l, s, t.width, x);
+        else if (d == 5) y.decode._decodeLZW(i, b, l, s);
+        else if (d == 6) y.decode._decodeOldJPEG(t, i, b, v, l, s);
+        else if (d == 7) y.decode._decodeNewJPEG(t, i, b, v, l, s);
+        else if (d == 8)
+          for (var u = new Uint8Array(i.buffer, b, v), c = J.inflate(u), o = 0; o < c.length; o++) l[s + o] = c[o];
+        else d == 32767 ? y.decode._decodeARW(t, i, b, v, l, s) : d == 32773 ? y.decode._decodePackBits(i, b, v, l, s) : d == 32809 ? y.decode._decodeThunder(i, b, v, l, s) : d == 34713 ? y.decode._decodeNikon(t, r, i, b, v, l, s) : G("Unknown compression", d);
+        var n = t.t258 ? Math.min(32, t.t258[0]) : 1, w = t.t277 ? t.t277[0] : 1, g = n * w >>> 3, p = t.t278 ? t.t278[0] : t.height, E = Math.ceil(n * w * t.width / 8);
+        if (n == 16 && !t.isLE && t.t33422 == null)
+          for (var A = 0; A < p; A++)
+            for (var N = s + A * E, D = 1; D < E; D += 2) {
+              var B = l[N + D];
+              l[N + D] = l[N + D - 1], l[N + D - 1] = B;
+            }
+        if (t.t317 && t.t317[0] == 2)
+          for (var A = 0; A < p; A++) {
+            var P = s + A * E;
+            if (n == 16) for (var _ = g; _ < E; _ += 2) {
+              var M = (l[P + _ + 1] << 8 | l[P + _]) + (l[P + _ - g + 1] << 8 | l[P + _ - g]);
+              l[P + _] = M & 255, l[P + _ + 1] = M >>> 8 & 255;
+            }
+            else if (w == 3) for (var _ = 3; _ < E; _ += 3)
+              l[P + _] = l[P + _] + l[P + _ - 3] & 255, l[P + _ + 1] = l[P + _ + 1] + l[P + _ - 2] & 255, l[P + _ + 2] = l[P + _ + 2] + l[P + _ - 1] & 255;
+            else for (var _ = g; _ < E; _++) l[P + _] = l[P + _] + l[P + _ - g] & 255;
+          }
+      }, y.decode._ljpeg_diff = function(t, r, i) {
+        var b = y.decode._getbithuff, v, d;
+        return v = b(t, r, i[0], i), d = b(t, r, v, 0), d & 1 << v - 1 || (d -= (1 << v) - 1), d;
+      }, y.decode._decodeARW = function(t, r, i, b, v, d) {
+        var l = t.t256[0], s = t.t257[0], x = t.t258[0], _ = t.isLE ? y._binLE : y._binBE, u = l * s == b || l * s * 1.5 == b;
+        if (!u) {
+          s += 8;
+          var c = [i, 0, 0, 0], o = new Uint16Array(32770), n = [
+            3857,
+            3856,
+            3599,
+            3342,
+            3085,
+            2828,
+            2571,
+            2314,
+            2057,
+            1800,
+            1543,
+            1286,
+            1029,
+            772,
+            771,
+            768,
+            514,
+            513
+          ], $, w, g, H, Z, p = 0, E = y.decode._ljpeg_diff;
+          for (o[0] = 15, g = $ = 0; $ < 18; $++)
+            for (var A = 32768 >>> (n[$] >>> 8), w = 0; w < A; w++) o[++g] = n[$];
+          for (H = l; H--; )
+            for (Z = 0; Z < s + 1; Z += 2)
+              if (Z == s && (Z = 1), p += E(r, c, o), Z < s) {
+                var N = p & 4095;
+                y.decode._putsF(v, (Z * l + H) * x, N << 16 - x);
+              }
+          return;
+        }
+        if (l * s * 1.5 == b) {
+          for (var $ = 0; $ < b; $ += 3) {
+            var D = r[i + $ + 0], B = r[i + $ + 1], P = r[i + $ + 2];
+            v[d + $] = B << 4 | D >>> 4, v[d + $ + 1] = D << 4 | P >>> 4, v[d + $ + 2] = P << 4 | B >>> 4;
+          }
+          return;
+        }
+        var M = new Uint16Array(16), Z, H, X, W, C, m, ie, T, F, $, ve, fe = new Uint8Array(l + 1);
+        for (Z = 0; Z < s; Z++) {
+          for (var le = 0; le < l; le++) fe[le] = r[i++];
+          for (ve = 0, H = 0; H < l - 30; ve += 16) {
+            for (W = 2047 & (X = _.readUint(fe, ve)), C = 2047 & X >>> 11, m = 15 & X >>> 22, ie = 15 & X >>> 26, T = 0; T < 4 && 128 << T <= W - C; T++) ;
+            for (F = 30, $ = 0; $ < 16; $++)
+              $ == m ? M[$] = W : $ == ie ? M[$] = C : (M[$] = ((_.readUshort(fe, ve + (F >> 3)) >>> (F & 7) & 127) << T) + C, M[$] > 2047 && (M[$] = 2047), F += 7);
+            for ($ = 0; $ < 16; $++, H += 2) {
+              var N = M[$] << 1;
+              y.decode._putsF(v, (Z * l + H) * x, N << 16 - x);
+            }
+            H -= H & 1 ? 1 : 31;
+          }
+        }
+      }, y.decode._decodeNikon = function(t, r, i, b, v, d, l) {
+        var s = [
+          [
+            0,
+            0,
+            1,
+            5,
+            1,
+            1,
+            1,
+            1,
+            1,
+            1,
+            2,
+            0,
+            0,
+            0,
+            0,
+            0,
+            0,
+            /* 12-bit lossy */
+            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,
+            /* 12-bit lossy after split */
+            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,
+            /* 12-bit lossless */
+            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,
+            /* 14-bit lossy */
+            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,
+            /* 14-bit lossy after split */
+            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,
+            /* 14-bit lossless */
+            7,
+            6,
+            8,
+            5,
+            9,
+            4,
+            10,
+            3,
+            11,
+            12,
+            2,
+            0,
+            1,
+            13,
+            14
+          ]
+        ], x = t.t256[0], _ = t.t257[0], u = t.t258[0], c = 0, o = 0, n = y.decode._make_decoder, w = y.decode._getbithuff, g = r[0].exifIFD.makerNote, p = g.t150 ? g.t150 : g.t140, E = 0, A = p[E++], N = p[E++];
+        (A == 73 || N == 88) && (E += 2110), A == 70 && (c = 2), u == 14 && (c += 3);
+        for (var D = [[0, 0], [0, 0]], B = t.isLE ? y._binLE : y._binBE, X = 0; X < 2; X++) for (var P = 0; P < 2; P++)
+          D[X][P] = B.readShort(p, E), E += 2;
+        var M = 1 << u & 32767, Z = 0, H = B.readShort(p, E);
+        E += 2, H > 1 && (Z = Math.floor(M / (H - 1))), A == 68 && N == 32 && Z > 0 && (o = B.readShort(p, 562));
+        var X, W, C, m, ie, T, F = [0, 0], $ = n(s[c]), ve = [b, 0, 0, 0];
+        for (W = 0; W < _; W++)
+          for (o && W == o && ($ = n(s[c + 1])), C = 0; C < x; C++) {
+            X = w(i, ve, $[0], $), m = X & 15, ie = X >>> 4, T = (w(i, ve, m - ie, 0) << 1) + 1 << ie >>> 1, T & 1 << m - 1 || (T -= (1 << m) - (ie == 0 ? 1 : 0)), C < 2 ? F[C] = D[W & 1][C] += T : F[C & 1] += T;
+            var fe = Math.min(Math.max(F[C & 1], 0), (1 << u) - 1), le = (W * x + C) * u;
+            y.decode._putsF(d, le, fe << 16 - u);
+          }
+      }, y.decode._putsF = function(t, r, i) {
+        i = i << 8 - (r & 7);
+        var b = r >>> 3;
+        t[b] |= i >>> 16, t[b + 1] |= i >>> 8, t[b + 2] |= i;
+      }, y.decode._getbithuff = function(t, r, i, b) {
+        var v = 0;
+        y.decode._get_byte;
+        var d, l = r[0], s = r[1], x = r[2], _ = r[3];
+        if (i == 0 || x < 0) return 0;
+        for (; !_ && x < i && (d = t[l++]) != -1 && !(_ = v); )
+          s = (s << 8) + d, x += 8;
+        if (d = s << 32 - x >>> 32 - i, b ? (x -= b[d + 1] >>> 8, d = b[d + 1] & 255) : x -= i, x < 0) throw "e";
+        return r[0] = l, r[1] = s, r[2] = x, r[3] = _, d;
+      }, y.decode._make_decoder = function(t) {
+        var r, i, b, v, d, l = [];
+        for (r = 16; r != 0 && !t[r]; r--) ;
+        var s = 17;
+        for (l[0] = r, b = i = 1; i <= r; i++)
+          for (v = 0; v < t[i]; v++, ++s)
+            for (d = 0; d < 1 << r - i; d++)
+              b <= 1 << r && (l[b++] = i << 8 | t[s]);
+        return l;
+      }, y.decode._decodeNewJPEG = function(t, r, i, b, v, d) {
+        var l = t.t347, s = l ? l.length : 0, x = new Uint8Array(s + b);
+        if (l) {
+          for (var _ = 216, u = 217, c = 0, o = 0; o < s - 1 && !(l[o] == 255 && l[o + 1] == u); o++)
+            x[c++] = l[o];
+          var n = r[i], w = r[i + 1];
+          (n != 255 || w != _) && (x[c++] = n, x[c++] = w);
+          for (var o = 2; o < b; o++) x[c++] = r[i + o];
+        } else for (var o = 0; o < b; o++) x[o] = r[i + o];
+        if (t.t262[0] == 32803 || t.t262[0] == 34892) {
+          var g = t.t258[0], p = y.LosslessJpegDecode(x), E = p.length;
+          if (g == 16)
+            if (t.isLE) for (var o = 0; o < E; o++)
+              v[d + (o << 1)] = p[o] & 255, v[d + (o << 1) + 1] = p[o] >>> 8;
+            else for (var o = 0; o < E; o++)
+              v[d + (o << 1)] = p[o] >>> 8, v[d + (o << 1) + 1] = p[o] & 255;
+          else if (g == 14 || g == 12)
+            for (var A = 16 - g, o = 0; o < E; o++) y.decode._putsF(v, o * g, p[o] << A);
+          else throw new Error("unsupported bit depth " + g);
+        } else {
+          var N = new y.JpegDecoder();
+          N.parse(x);
+          for (var D = N.getData(N.width, N.height), o = 0; o < D.length; o++) v[d + o] = D[o];
+        }
+        t.t262[0] == 6 && (t.t262[0] = 2);
+      }, y.decode._decodeOldJPEGInit = function(t, r, i, b) {
+        var v = 216, d = 219, l = 196, s = 221, x = 192, _ = 218, u = 0, c = 0, o, n, w = !1, g, p, E, A = t.t513, N = A ? A[0] : 0, D = t.t514, B = D ? D[0] : 0, P = t.t324 || t.t273 || A, M = t.t530, Z = 0, H = 0, X = t.t277 ? t.t277[0] : 1, W = t.t515;
+        if (P && (c = P[0], w = P.length > 1), !w) {
+          if (r[i] == 255 && r[i + 1] == v) return { jpegOffset: i };
+          if (A != null && (r[i + N] == 255 && r[i + N + 1] == v ? u = i + N : G("JPEGInterchangeFormat does not point to SOI"), D == null ? G("JPEGInterchangeFormatLength field is missing") : (N >= c || N + B <= c) && G("JPEGInterchangeFormatLength field value is invalid"), u != null))
+            return { jpegOffset: u };
+        }
+        if (M != null && (Z = M[0], H = M[1]), A != null && D != null)
+          if (B >= 2 && N + B <= c) {
+            for (r[i + N + B - 2] == 255 && r[i + N + B - 1] == v ? o = new Uint8Array(B - 2) : o = new Uint8Array(B), g = 0; g < o.length; g++) o[g] = r[i + N + g];
+            G("Incorrect JPEG interchange format: using JPEGInterchangeFormat offset to derive tables");
+          } else G("JPEGInterchangeFormat+JPEGInterchangeFormatLength > offset to first strip or tile");
+        if (o == null) {
+          var C = 0, m = [];
+          m[C++] = 255, m[C++] = v;
+          var ie = t.t519;
+          if (ie == null) throw new Error("JPEGQTables tag is missing");
+          for (g = 0; g < ie.length; g++)
+            for (m[C++] = 255, m[C++] = d, m[C++] = 0, m[C++] = 67, m[C++] = g, p = 0; p < 64; p++) m[C++] = r[i + ie[g] + p];
+          for (E = 0; E < 2; E++) {
+            var T = t[E == 0 ? "t520" : "t521"];
+            if (T == null) throw new Error((E == 0 ? "JPEGDCTables" : "JPEGACTables") + " tag is missing");
+            for (g = 0; g < T.length; g++) {
+              m[C++] = 255, m[C++] = l;
+              var F = 19;
+              for (p = 0; p < 16; p++) F += r[i + T[g] + p];
+              for (m[C++] = F >>> 8, m[C++] = F & 255, m[C++] = g | E << 4, p = 0; p < 16; p++) m[C++] = r[i + T[g] + p];
+              for (p = 0; p < F; p++) m[C++] = r[i + T[g] + 16 + p];
+            }
+          }
+          if (m[C++] = 255, m[C++] = x, m[C++] = 0, m[C++] = 8 + 3 * X, m[C++] = 8, m[C++] = t.height >>> 8 & 255, m[C++] = t.height & 255, m[C++] = t.width >>> 8 & 255, m[C++] = t.width & 255, m[C++] = X, X == 1)
+            m[C++] = 1, m[C++] = 17, m[C++] = 0;
+          else for (g = 0; g < 3; g++)
+            m[C++] = g + 1, m[C++] = g != 0 ? 17 : (Z & 15) << 4 | H & 15, m[C++] = g;
+          W != null && W[0] != 0 && (m[C++] = 255, m[C++] = s, m[C++] = 0, m[C++] = 4, m[C++] = W[0] >>> 8 & 255, m[C++] = W[0] & 255), o = new Uint8Array(m);
+        }
+        var $ = -1;
+        for (g = 0; g < o.length - 1; ) {
+          if (o[g] == 255 && o[g + 1] == x) {
+            $ = g;
+            break;
+          }
+          g++;
+        }
+        if ($ == -1) {
+          var ve = new Uint8Array(o.length + 10 + 3 * X);
+          ve.set(o);
+          var fe = o.length;
+          if ($ = o.length, o = ve, o[fe++] = 255, o[fe++] = x, o[fe++] = 0, o[fe++] = 8 + 3 * X, o[fe++] = 8, o[fe++] = t.height >>> 8 & 255, o[fe++] = t.height & 255, o[fe++] = t.width >>> 8 & 255, o[fe++] = t.width & 255, o[fe++] = X, X == 1)
+            o[fe++] = 1, o[fe++] = 17, o[fe++] = 0;
+          else for (g = 0; g < 3; g++)
+            o[fe++] = g + 1, o[fe++] = g != 0 ? 17 : (Z & 15) << 4 | H & 15, o[fe++] = g;
+        }
+        if (r[c] == 255 && r[c + 1] == _) {
+          var le = r[c + 2] << 8 | r[c + 3];
+          for (n = new Uint8Array(le + 2), n[0] = r[c], n[1] = r[c + 1], n[2] = r[c + 2], n[3] = r[c + 3], g = 0; g < le - 2; g++) n[g + 4] = r[c + g + 4];
+        } else {
+          n = new Uint8Array(8 + 2 * X);
+          var he = 0;
+          if (n[he++] = 255, n[he++] = _, n[he++] = 0, n[he++] = 6 + 2 * X, n[he++] = X, X == 1)
+            n[he++] = 1, n[he++] = 0;
+          else for (g = 0; g < 3; g++)
+            n[he++] = g + 1, n[he++] = g << 4 | g;
+          n[he++] = 0, n[he++] = 63, n[he++] = 0;
+        }
+        return { jpegOffset: i, tables: o, sosMarker: n, sofPosition: $ };
+      }, y.decode._decodeOldJPEG = function(t, r, i, b, v, d) {
+        var l, s, x, _, u, c = y.decode._decodeOldJPEGInit(t, r, i, b);
+        if (c.jpegOffset != null)
+          for (s = i + b - c.jpegOffset, _ = new Uint8Array(s), l = 0; l < s; l++) _[l] = r[c.jpegOffset + l];
+        else {
+          for (x = c.tables.length, _ = new Uint8Array(x + c.sosMarker.length + b + 2), _.set(c.tables), u = x, _[c.sofPosition + 5] = t.height >>> 8 & 255, _[c.sofPosition + 6] = t.height & 255, _[c.sofPosition + 7] = t.width >>> 8 & 255, _[c.sofPosition + 8] = t.width & 255, (r[i] != 255 || r[i + 1] != SOS) && (_.set(c.sosMarker, u), u += sosMarker.length), l = 0; l < b; l++) _[u++] = r[i + l];
+          _[u++] = 255, _[u++] = EOI;
+        }
+        var o = new y.JpegDecoder();
+        o.parse(_);
+        for (var n = o.getData(o.width, o.height), l = 0; l < n.length; l++) v[d + l] = n[l];
+        t.t262 && t.t262[0] == 6 && (t.t262[0] = 2);
+      }, y.decode._decodePackBits = function(t, r, i, b, v) {
+        for (var d = new Int8Array(t.buffer), l = new Int8Array(b.buffer), s = r + i; r < s; ) {
+          var x = d[r];
+          if (r++, x >= 0 && x < 128) for (var _ = 0; _ < x + 1; _++)
+            l[v] = d[r], v++, r++;
+          if (x >= -127 && x < 0) {
+            for (var _ = 0; _ < -x + 1; _++)
+              l[v] = d[r], v++;
+            r++;
+          }
+        }
+      }, y.decode._decodeThunder = function(t, r, i, b, v) {
+        for (var d = [0, 1, 0, -1], l = [0, 1, 2, 3, 0, -3, -2, -1], s = r + i, x = v * 2, _ = 0; r < s; ) {
+          var u = t[r], c = u >>> 6, o = u & 63;
+          if (r++, c == 3 && (_ = o & 15, b[x >>> 1] |= _ << 4 * (1 - x & 1), x++), c == 0) for (var n = 0; n < o; n++)
+            b[x >>> 1] |= _ << 4 * (1 - x & 1), x++;
+          if (c == 2) for (var n = 0; n < 2; n++) {
+            var w = o >>> 3 * (1 - n) & 7;
+            w != 4 && (_ += l[w], b[x >>> 1] |= _ << 4 * (1 - x & 1), x++);
+          }
+          if (c == 1) for (var n = 0; n < 3; n++) {
+            var w = o >>> 2 * (2 - n) & 3;
+            w != 2 && (_ += d[w], b[x >>> 1] |= _ << 4 * (1 - x & 1), x++);
+          }
+        }
+      }, y.decode._dmap = { 1: 0, "011": 1, "000011": 2, "0000011": 3, "010": -1, "000010": -2, "0000010": -3 }, y.decode._lens = function() {
+        var t = function(x, _, u, c) {
+          for (var o = 0; o < _.length; o++) x[_[o]] = u + o * c;
+        }, 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", i = "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", b = "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", v = "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(","), i = i.split(","), b = b.split(","), v = v.split(","), d = d.split(",");
+        var l = {}, s = {};
+        return t(l, r, 0, 1), t(l, b, 64, 64), t(l, d, 1792, 64), t(s, i, 0, 1), t(s, v, 64, 64), t(s, d, 1792, 64), [l, s];
+      }(), y.decode._decodeG4 = function(t, r, i, b, v, d, l) {
+        for (var s = y.decode, x = r << 3, _ = 0, u = "", c = [], o = [], n = 0; n < d; n++) o.push(0);
+        o = s._makeDiff(o);
+        for (var w = 0, g = 0, p = 0, E = 0, A = 0, N = 0, D = "", B = 0, P = Math.ceil(d / 8) * 8; x >>> 3 < r + i; ) {
+          p = s._findDiff(o, w + (w == 0 ? 0 : 1), 1 - A), E = s._findDiff(o, p, A);
+          var M = 0;
+          if (l == 1 && (M = t[x >>> 3] >>> 7 - (x & 7) & 1), l == 2 && (M = t[x >>> 3] >>> (x & 7) & 1), x++, u += M, D == "H") {
+            if (s._lens[A][u] != null) {
+              var Z = s._lens[A][u];
+              u = "", _ += Z, Z < 64 && (s._addNtimes(c, _, A), w += _, A = 1 - A, _ = 0, B--, B == 0 && (D = ""));
+            }
+          } else
+            u == "0001" && (u = "", s._addNtimes(c, E - w, A), w = E), u == "001" && (u = "", D = "H", B = 2), s._dmap[u] != null && (g = p + s._dmap[u], s._addNtimes(c, g - w, A), w = g, u = "", A = 1 - A);
+          c.length == d && D == "" && (s._writeBits(c, b, v * 8 + N * P), A = 0, N++, w = 0, o = s._makeDiff(c), c = []);
+        }
+      }, y.decode._findDiff = function(t, r, i) {
+        for (var b = 0; b < t.length; b += 2) if (t[b] >= r && t[b + 1] == i) return t[b];
+      }, y.decode._makeDiff = function(t) {
+        var r = [];
+        t[0] == 1 && r.push(0, 1);
+        for (var i = 1; i < t.length; i++) t[i - 1] != t[i] && r.push(i, t[i]);
+        return r.push(t.length, 0, t.length, 1), r;
+      }, y.decode._decodeG3 = function(t, r, i, b, v, d, l) {
+        for (var s = y.decode, x = r << 3, _ = 0, u = "", c = [], o = [], n = 0; n < d; n++) c.push(0);
+        for (var w = 0, g = 0, p = 0, E = 0, A = 0, N = -1, D = "", B = 0, P = !1, M = Math.ceil(d / 8) * 8; x >>> 3 < r + i; ) {
+          p = s._findDiff(o, w + (w == 0 ? 0 : 1), 1 - A), E = s._findDiff(o, p, A);
+          var Z = 0;
+          if (l == 1 && (Z = t[x >>> 3] >>> 7 - (x & 7) & 1), l == 2 && (Z = t[x >>> 3] >>> (x & 7) & 1), x++, u += Z, P) {
+            if (s._lens[A][u] != null) {
+              var H = s._lens[A][u];
+              u = "", _ += H, H < 64 && (s._addNtimes(c, _, A), A = 1 - A, _ = 0);
+            }
+          } else if (D == "H") {
+            if (s._lens[A][u] != null) {
+              var H = s._lens[A][u];
+              u = "", _ += H, H < 64 && (s._addNtimes(c, _, A), w += _, A = 1 - A, _ = 0, B--, B == 0 && (D = ""));
+            }
+          } else
+            u == "0001" && (u = "", s._addNtimes(c, E - w, A), w = E), u == "001" && (u = "", D = "H", B = 2), s._dmap[u] != null && (g = p + s._dmap[u], s._addNtimes(c, g - w, A), w = g, u = "", A = 1 - A);
+          u.endsWith("000000000001") && (N >= 0 && s._writeBits(c, b, v * 8 + N * M), l == 1 && (P = (t[x >>> 3] >>> 7 - (x & 7) & 1) == 1), l == 2 && (P = (t[x >>> 3] >>> (x & 7) & 1) == 1), x++, s._decodeG3.allow2D == null && (s._decodeG3.allow2D = P), s._decodeG3.allow2D || (P = !0, x--), u = "", A = 0, N++, w = 0, o = s._makeDiff(c), c = []);
+        }
+        c.length == d && s._writeBits(c, b, v * 8 + N * M);
+      }, y.decode._addNtimes = function(t, r, i) {
+        for (var b = 0; b < r; b++) t.push(i);
+      }, y.decode._writeBits = function(t, r, i) {
+        for (var b = 0; b < t.length; b++) r[i + b >>> 3] |= t[b] << 7 - (i + b & 7);
+      }, y.decode._decodeLZW = function(t, r, i, b) {
+        if (y.decode._lzwTab == null) {
+          for (var v = new Uint32Array(65535), d = new Uint16Array(65535), u = new Uint8Array(2e6), l = 0; l < 256; l++)
+            u[l << 2] = l, v[l] = l << 2, d[l] = 1;
+          y.decode._lzwTab = [v, d, u];
+        }
+        for (var s = y.decode._copyData, x = y.decode._lzwTab[0], _ = y.decode._lzwTab[1], u = y.decode._lzwTab[2], c = 258, o = 1032, n = 9, w = r << 3, g = 256, p = 257, E = 0, A = 0, N = 0; E = t[w >>> 3] << 16 | t[w + 8 >>> 3] << 8 | t[w + 16 >>> 3], A = E >> 24 - (w & 7) - n & (1 << n) - 1, w += n, A != p; ) {
+          if (A == g) {
+            if (n = 9, c = 258, o = 1032, E = t[w >>> 3] << 16 | t[w + 8 >>> 3] << 8 | t[w + 16 >>> 3], A = E >> 24 - (w & 7) - n & (1 << n) - 1, w += n, A == p) break;
+            i[b] = A, b++;
+          } else if (A < c) {
+            var D = x[A], B = _[A];
+            if (s(u, D, i, b, B), b += B, N >= c)
+              x[c] = o, u[x[c]] = D[0], _[c] = 1, o = o + 1 + 3 & -4, c++;
+            else {
+              x[c] = o;
+              var P = x[N], M = _[N];
+              s(u, P, u, o, M), u[o + M] = u[D], M++, _[c] = M, c++, o = o + M + 3 & -4;
+            }
+            c + 1 == 1 << n && n++;
+          } else {
+            if (N >= c)
+              x[c] = o, _[c] = 0, c++;
+            else {
+              x[c] = o;
+              var P = x[N], M = _[N];
+              s(u, P, u, o, M), u[o + M] = u[o], M++, _[c] = M, c++, s(u, o, i, b, M), b += M, o = o + M + 3 & -4;
+            }
+            c + 1 == 1 << n && n++;
+          }
+          N = A;
+        }
+      }, y.decode._copyData = function(t, r, i, b, v) {
+        for (var d = 0; d < v; d += 4)
+          i[b + d] = t[r + d], i[b + d + 1] = t[r + d + 1], i[b + d + 2] = t[r + d + 2], i[b + d + 3] = t[r + d + 3];
+      }, y.tags = {}, y.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 }, y._readIFD = function(t, r, i, b, v, d) {
+        var l = t.readUshort(r, i);
+        i += 2;
+        var s = {};
+        b.push(s), d && G("   ".repeat(v), b.length - 1, ">>>----------------");
+        for (var x = 0; x < l; x++) {
+          var _ = t.readUshort(r, i);
+          i += 2;
+          var u = t.readUshort(r, i);
+          i += 2;
+          var c = t.readUint(r, i);
+          i += 4;
+          var o = t.readUint(r, i);
+          i += 4;
+          var n = [];
+          if ((u == 1 || u == 7) && (n = new Uint8Array(r.buffer, c < 5 ? i - 4 : o, c)), u == 2) {
+            var w = c < 5 ? i - 4 : o, g = r[w];
+            g < 128 ? n.push(t.readASCII(r, w, c - 1)) : n = new Uint8Array(r.buffer, w, c - 1);
+          }
+          if (u == 3)
+            for (var p = 0; p < c; p++) n.push(t.readUshort(r, (c < 3 ? i - 4 : o) + 2 * p));
+          if (u == 4)
+            for (var p = 0; p < c; p++) n.push(t.readUint(r, (c < 2 ? i - 4 : o) + 4 * p));
+          if (u == 5)
+            for (var p = 0; p < c; p++) n.push(t.readUint(r, o + p * 8) / t.readUint(r, o + p * 8 + 4));
+          if (u == 8)
+            for (var p = 0; p < c; p++) n.push(t.readShort(r, (c < 3 ? i - 4 : o) + 2 * p));
+          if (u == 9)
+            for (var p = 0; p < c; p++) n.push(t.readInt(r, (c < 2 ? i - 4 : o) + 4 * p));
+          if (u == 10)
+            for (var p = 0; p < c; p++) n.push(t.readInt(r, o + p * 8) / t.readInt(r, o + p * 8 + 4));
+          if (u == 11)
+            for (var p = 0; p < c; p++) n.push(t.readFloat(r, o + p * 4));
+          if (u == 12)
+            for (var p = 0; p < c; p++) n.push(t.readDouble(r, o + p * 8));
+          if (s["t" + _] = n, c != 0 && n.length == 0 && G("unknown TIFF tag type: ", u, "num:", c), d && G("   ".repeat(v), _, u, y.tags[_], n), !(_ == 330 && s.t272 && s.t272[0] == "DSLR-A100")) {
+            if (_ == 330 || _ == 34665 || _ == 50740 && t.readUshort(r, t.readUint(n, 0)) < 300) {
+              for (var E = _ == 50740 ? [t.readUint(n, 0)] : n, A = [], p = 0; p < E.length; p++) y._readIFD(t, r, E[p], A, v + 1, d);
+              _ == 330 && (s.subIFD = A), _ == 34665 && (s.exifIFD = A[0]), _ == 50740 && (s.dngPrvt = A[0]);
+            }
+          }
+          if (_ == 37500) {
+            var N = n;
+            if (t.readASCII(N, 0, 5) == "Nikon") s.makerNote = y.decode(N.slice(10).buffer)[0];
+            else if (t.readUshort(r, o) < 300) {
+              var D = [];
+              y._readIFD(t, r, o, D, v + 1, d), s.makerNote = D[0];
+            }
+          }
+        }
+        return d && G("   ".repeat(v), "<<<---------------"), i;
+      }, y._writeIFD = function(t, r, i, b) {
+        var v = Object.keys(b);
+        t.writeUshort(r, i, v.length), i += 2;
+        for (var d = i + v.length * 12 + 4, l = 0; l < v.length; l++) {
+          var s = v[l], x = parseInt(s.slice(1)), _ = y.ttypes[x];
+          if (_ == null) throw new Error("unknown type of tag: " + x);
+          var u = b[s];
+          _ == 2 && (u = u[0] + "\0");
+          var c = u.length;
+          t.writeUshort(r, i, x), i += 2, t.writeUshort(r, i, _), i += 2, t.writeUint(r, i, c), i += 4;
+          var o = [-1, 1, 1, 2, 4, 8, 0, 0, 0, 0, 0, 0, 8][_] * c, n = i;
+          if (o > 4 && (t.writeUint(r, i, d), n = d), _ == 2 && t.writeASCII(r, n, u), _ == 3)
+            for (var w = 0; w < c; w++) t.writeUshort(r, n + 2 * w, u[w]);
+          if (_ == 4)
+            for (var w = 0; w < c; w++) t.writeUint(r, n + 4 * w, u[w]);
+          if (_ == 5)
+            for (var w = 0; w < c; w++)
+              t.writeUint(r, n + 8 * w, Math.round(u[w] * 1e4)), t.writeUint(r, n + 8 * w + 4, 1e4);
+          if (_ == 12)
+            for (var w = 0; w < c; w++) t.writeDouble(r, n + 8 * w, u[w]);
+          o > 4 && (o += o & 1, d += o), i += 4;
+        }
+        return [i, d];
+      }, y.toRGBA8 = function(t) {
+        var r = t.width, i = t.height, b = r * i, v = b * 4, d = t.data, l = new Uint8Array(b * 4), s = t.t262 ? t.t262[0] : 2, x = t.t258 ? Math.min(32, t.t258[0]) : 1;
+        if (s == 0)
+          for (var _ = Math.ceil(x * r / 8), u = 0; u < i; u++) {
+            var c = u * _, o = u * r;
+            if (x == 1) for (var n = 0; n < r; n++) {
+              var w = o + n << 2, g = d[c + (n >> 3)] >> 7 - (n & 7) & 1;
+              l[w] = l[w + 1] = l[w + 2] = (1 - g) * 255, l[w + 3] = 255;
+            }
+            if (x == 4) for (var n = 0; n < r; n++) {
+              var w = o + n << 2, g = d[c + (n >> 1)] >> 4 - 4 * (n & 1) & 15;
+              l[w] = l[w + 1] = l[w + 2] = (15 - g) * 17, l[w + 3] = 255;
+            }
+            if (x == 8) for (var n = 0; n < r; n++) {
+              var w = o + n << 2, g = d[c + n];
+              l[w] = l[w + 1] = l[w + 2] = 255 - g, l[w + 3] = 255;
+            }
+          }
+        else if (s == 1)
+          for (var _ = Math.ceil(x * r / 8), u = 0; u < i; u++) {
+            var c = u * _, o = u * r;
+            if (x == 1) for (var n = 0; n < r; n++) {
+              var w = o + n << 2, g = d[c + (n >> 3)] >> 7 - (n & 7) & 1;
+              l[w] = l[w + 1] = l[w + 2] = g * 255, l[w + 3] = 255;
+            }
+            if (x == 2) for (var n = 0; n < r; n++) {
+              var w = o + n << 2, g = d[c + (n >> 2)] >> 6 - 2 * (n & 3) & 3;
+              l[w] = l[w + 1] = l[w + 2] = g * 85, l[w + 3] = 255;
+            }
+            if (x == 8) for (var n = 0; n < r; n++) {
+              var w = o + n << 2, g = d[c + n];
+              l[w] = l[w + 1] = l[w + 2] = g, l[w + 3] = 255;
+            }
+            if (x == 16) for (var n = 0; n < r; n++) {
+              var w = o + n << 2, g = d[c + (2 * n + 1)];
+              l[w] = l[w + 1] = l[w + 2] = Math.min(255, g), l[w + 3] = 255;
+            }
+          }
+        else if (s == 2) {
+          var p = t.t258 ? t.t258.length : 3;
+          if (x == 8) {
+            if (p == 4) for (var n = 0; n < v; n++) l[n] = d[n];
+            if (p == 3) for (var n = 0; n < b; n++) {
+              var w = n << 2, E = n * 3;
+              l[w] = d[E], l[w + 1] = d[E + 1], l[w + 2] = d[E + 2], l[w + 3] = 255;
+            }
+          } else {
+            if (p == 4) for (var n = 0; n < b; n++) {
+              var w = n << 2, E = n * 8 + 1;
+              l[w] = d[E], l[w + 1] = d[E + 2], l[w + 2] = d[E + 4], l[w + 3] = d[E + 6];
+            }
+            if (p == 3) for (var n = 0; n < b; n++) {
+              var w = n << 2, E = n * 6 + 1;
+              l[w] = d[E], l[w + 1] = d[E + 2], l[w + 2] = d[E + 4], l[w + 3] = 255;
+            }
+          }
+        } else if (s == 3)
+          for (var A = t.t320, n = 0; n < b; n++) {
+            var w = n << 2, N = d[n];
+            l[w] = A[N] >> 8, l[w + 1] = A[256 + N] >> 8, l[w + 2] = A[512 + N] >> 8, l[w + 3] = 255;
+          }
+        else if (s == 5)
+          for (var p = t.t258 ? t.t258.length : 4, D = p > 4 ? 1 : 0, n = 0; n < b; n++) {
+            var w = n << 2, B = n * p, P = 255 - d[B], M = 255 - d[B + 1], Z = 255 - d[B + 2], H = (255 - d[B + 3]) * (1 / 255);
+            l[w] = ~~(P * H + 0.5), l[w + 1] = ~~(M * H + 0.5), l[w + 2] = ~~(Z * H + 0.5), l[w + 3] = 255 * (1 - D) + d[B + 4] * D;
+          }
+        else G("Unknown Photometric interpretation: " + s);
+        return l;
+      }, y.replaceIMG = function(t) {
+        t == null && (t = document.getElementsByTagName("img"));
+        for (var r = ["tif", "tiff", "dng", "cr2", "nef"], i = 0; i < t.length; i++) {
+          var b = t[i], v = b.getAttribute("src");
+          if (v != null) {
+            var d = v.split(".").pop().toLowerCase();
+            if (r.indexOf(d) != -1) {
+              var l = new XMLHttpRequest();
+              y._xhrs.push(l), y._imgs.push(b), l.open("GET", v), l.responseType = "arraybuffer", l.onload = y._imgLoaded, l.send();
+            }
+          }
+        }
+      }, y._xhrs = [], y._imgs = [], y._imgLoaded = function(t) {
+        var r = t.target.response, i = y.decode(r), b = i, v = 0, d = b[0];
+        i[0].subIFD && (b = b.concat(i[0].subIFD));
+        for (var l = 0; l < b.length; l++) {
+          var o = b[l];
+          if (!(o.t258 == null || o.t258.length < 3)) {
+            var s = o.t256 * o.t257;
+            s > v && (v = s, d = o);
+          }
+        }
+        y.decodeImage(r, d, i);
+        var x = y.toRGBA8(d), _ = d.width, u = d.height, c = y._xhrs.indexOf(t.target), o = y._imgs[c];
+        y._xhrs.splice(c, 1), y._imgs.splice(c, 1);
+        var n = document.createElement("canvas");
+        n.width = _, n.height = u;
+        for (var w = n.getContext("2d"), g = w.createImageData(_, u), l = 0; l < x.length; l++) g.data[l] = x[l];
+        w.putImageData(g, 0, 0), o.setAttribute("src", n.toDataURL());
+      }, y._binBE = {
+        nextZero: function(t, r) {
+          for (; t[r] != 0; ) r++;
+          return r;
+        },
+        readUshort: function(t, r) {
+          return t[r] << 8 | t[r + 1];
+        },
+        readShort: function(t, r) {
+          var i = y._binBE.ui8;
+          return i[0] = t[r + 1], i[1] = t[r + 0], y._binBE.i16[0];
+        },
+        readInt: function(t, r) {
+          var i = y._binBE.ui8;
+          return i[0] = t[r + 3], i[1] = t[r + 2], i[2] = t[r + 1], i[3] = t[r + 0], y._binBE.i32[0];
+        },
+        readUint: function(t, r) {
+          var i = y._binBE.ui8;
+          return i[0] = t[r + 3], i[1] = t[r + 2], i[2] = t[r + 1], i[3] = t[r + 0], y._binBE.ui32[0];
+        },
+        readASCII: function(t, r, i) {
+          for (var b = "", v = 0; v < i; v++) b += String.fromCharCode(t[r + v]);
+          return b;
+        },
+        readFloat: function(t, r) {
+          for (var i = y._binBE.ui8, b = 0; b < 4; b++) i[b] = t[r + 3 - b];
+          return y._binBE.fl32[0];
+        },
+        readDouble: function(t, r) {
+          for (var i = y._binBE.ui8, b = 0; b < 8; b++) i[b] = t[r + 7 - b];
+          return y._binBE.fl64[0];
+        },
+        writeUshort: function(t, r, i) {
+          t[r] = i >> 8 & 255, t[r + 1] = i & 255;
+        },
+        writeUint: function(t, r, i) {
+          t[r] = i >> 24 & 255, t[r + 1] = i >> 16 & 255, t[r + 2] = i >> 8 & 255, t[r + 3] = i >> 0 & 255;
+        },
+        writeASCII: function(t, r, i) {
+          for (var b = 0; b < i.length; b++) t[r + b] = i.charCodeAt(b);
+        },
+        writeDouble: function(t, r, i) {
+          y._binBE.fl64[0] = i;
+          for (var b = 0; b < 8; b++) t[r + b] = y._binBE.ui8[7 - b];
+        }
+      }, y._binBE.ui8 = new Uint8Array(8), y._binBE.i16 = new Int16Array(y._binBE.ui8.buffer), y._binBE.i32 = new Int32Array(y._binBE.ui8.buffer), y._binBE.ui32 = new Uint32Array(y._binBE.ui8.buffer), y._binBE.fl32 = new Float32Array(y._binBE.ui8.buffer), y._binBE.fl64 = new Float64Array(y._binBE.ui8.buffer), y._binLE = {
+        nextZero: y._binBE.nextZero,
+        readUshort: function(t, r) {
+          return t[r + 1] << 8 | t[r];
+        },
+        readShort: function(t, r) {
+          var i = y._binBE.ui8;
+          return i[0] = t[r + 0], i[1] = t[r + 1], y._binBE.i16[0];
+        },
+        readInt: function(t, r) {
+          var i = y._binBE.ui8;
+          return i[0] = t[r + 0], i[1] = t[r + 1], i[2] = t[r + 2], i[3] = t[r + 3], y._binBE.i32[0];
+        },
+        readUint: function(t, r) {
+          var i = y._binBE.ui8;
+          return i[0] = t[r + 0], i[1] = t[r + 1], i[2] = t[r + 2], i[3] = t[r + 3], y._binBE.ui32[0];
+        },
+        readASCII: y._binBE.readASCII,
+        readFloat: function(t, r) {
+          for (var i = y._binBE.ui8, b = 0; b < 4; b++) i[b] = t[r + b];
+          return y._binBE.fl32[0];
+        },
+        readDouble: function(t, r) {
+          for (var i = y._binBE.ui8, b = 0; b < 8; b++) i[b] = t[r + b];
+          return y._binBE.fl64[0];
+        }
+      }, y._copyTile = function(t, r, i, b, v, d, l, s) {
+        for (var x = Math.min(r, v - l), _ = Math.min(i, d - s), u = 0; u < _; u++)
+          for (var c = (s + u) * v + l, o = u * r, n = 0; n < x; n++) b[c + n] = t[o + n];
+      }, y.LosslessJpegDecode = function() {
+        function t(v) {
+          this.w = v, this.N = 0, this._ = 0, this.G = 0;
+        }
+        t.prototype = { t: function(v) {
+          this.N = Math.max(0, Math.min(this.w.length, v));
+        }, i: function() {
+          return this.w[this.N++];
+        }, l: function() {
+          var v = this.N;
+          return this.N += 2, this.w[v] << 8 | this.w[v + 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(v) {
+          var d = this._, l = this.G, s = Math.min(d, v);
+          v -= s, d -= s;
+          for (var x = l >>> d & (1 << s) - 1; v > 0; )
+            l = this.w[this.N], this.N += 1 + (l + 1 >>> 8), s = Math.min(8, v), v -= s, d = 8 - s, x <<= s, x |= l >>> d & (1 << s) - 1;
+          return this._ = d, this.G = l, x;
+        } };
+        var r = {};
+        r.X = function() {
+          return [0, 0, -1];
+        }, r.s = function(v, d, l) {
+          v[r.Y(v, 0, l) + 2] = d;
+        }, r.Y = function(v, d, l) {
+          if (v[d + 2] != -1) return 0;
+          if (l == 0) return d;
+          for (var s = 0; s < 2; s++) {
+            v[d + s] == 0 && (v[d + s] = v.length, v.push(0), v.push(0), v.push(-1));
+            var x = r.Y(v, v[d + s], l - 1);
+            if (x != 0) return x;
+          }
+          return 0;
+        }, r.B = function(v, d) {
+          for (var l = 0, s = 0, x = 0, _ = d._, u = d.G, c = d.N; ; )
+            if (_ == 0 && (u = d.w[c], c += 1 + (u + 1 >>> 8), _ = 8), x = u >>> --_ & 1, l = v[l + x], s = v[l + 2], s != -1)
+              return d._ = _, d.G = u, d.N = c, s;
+          return -1;
+        };
+        function i(v) {
+          this.z = new t(v), this.D(this.z);
+        }
+        i.prototype = { $: function(v, d) {
+          this.Q = v.i(), this.F = v.l(), this.o = v.l();
+          var l = this.O = v.i();
+          this.L = [];
+          for (var s = 0; s < l; s++) {
+            var x = v.i();
+            v.i(), v.i(), this.L[x] = s;
+          }
+          v.t(v.N + d - (6 + l * 3));
+        }, e: function() {
+          var v = 0, d = this.z.i();
+          this.H == null && (this.H = {});
+          for (var l = this.H[d] = r.X(), s = [], x = 0; x < 16; x++)
+            s[x] = this.z.i(), v += s[x];
+          for (var x = 0; x < 16; x++) for (var _ = 0; _ < s[x]; _++) r.s(l, this.z.i(), x + 1);
+          return v + 17;
+        }, W: function(v) {
+          for (; v > 0; ) v -= this.e();
+        }, p: function(v, d) {
+          var l = v.i();
+          this.U || (this.U = []);
+          for (var s = 0; s < l; s++) {
+            var x = v.i(), _ = v.i();
+            this.U[this.L[x]] = this.H[_ >>> 4];
+          }
+          this.g = v.i(), v.t(v.N + d - (2 + l * 2));
+        }, D: function(v) {
+          var d = !1, l = v.l();
+          if (l === i.q)
+            do {
+              var l = v.l(), s = v.l() - 2;
+              switch (l) {
+                case i.m:
+                  this.$(v, s);
+                  break;
+                case i.K:
+                  this.W(s);
+                  break;
+                case i.V:
+                  this.p(v, s), d = !0;
+                  break;
+                default:
+                  v.t(v.N + s);
+                  break;
+              }
+            } while (!d);
+        }, I: function(v, d) {
+          var l = r.B(d, v);
+          if (l == 16) return -32768;
+          var s = v.Z(l);
+          return s & 1 << l - 1 || (s -= (1 << l) - 1), s;
+        }, B: function(v, d) {
+          for (var l = this.z, s = this.O, x = this.F, _ = this.I, u = this.g, c = this.o * s, o = this.U, n = 0; n < s; n++)
+            v[n] = _(l, o[n]) + (1 << this.Q - 1);
+          for (var w = s; w < c; w += s)
+            for (var n = 0; n < s; n++) v[w + n] = _(l, o[n]) + v[w + n - s];
+          for (var g = d, p = 1; p < x; p++) {
+            for (var n = 0; n < s; n++)
+              v[g + n] = _(l, o[n]) + v[g + n - d];
+            for (var w = s; w < c; w += s)
+              for (var n = 0; n < s; n++) {
+                var E = g + w + n, A = v[E - s];
+                u == 6 && (A = v[E - d] + (A - v[E - s - d] >>> 1)), v[E] = A + _(l, o[n]);
+              }
+            g += d;
+          }
+        } }, i.m = 65475, i.K = 65476, i.q = 65496, i.V = 65498;
+        function b(v) {
+          var d = new i(v), l = d.Q > 8 ? Uint16Array : Uint8Array, s = new l(d.o * d.F * d.O), x = d.o * d.O;
+          return d.B(s, x), s;
+        }
+        return b;
+      }();
+    })(ae, ne);
+  })();
+})(D0);
+var L0 = D0.exports;
+const W0 = /* @__PURE__ */ M0(L0), X0 = /* @__PURE__ */ C0({
+  __proto__: null,
+  default: W0
+}, [L0]);
+export {
+  X0 as U
+};
+//# sourceMappingURL=UTIF-DSbsvqXu.js.map