@beeintel/batch-image 0.0.0-stage → 1.0.1

package/dist/assets/UPNG-CPfdwFSy.js

@@ -0,0 +1,2298 @@
+function Oa(C, W) {
+  return W.forEach(function(V) {
+    V && typeof V != "string" && !Array.isArray(V) && Object.keys(V).forEach(function(b) {
+      if (b !== "default" && !(b in C)) {
+        var P = Object.getOwnPropertyDescriptor(V, b);
+        Object.defineProperty(C, b, P.get ? P : {
+          enumerable: !0,
+          get: function() {
+            return V[b];
+          }
+        });
+      }
+    });
+  }), Object.freeze(C);
+}
+function Ba(C) {
+  return C && C.__esModule && Object.prototype.hasOwnProperty.call(C, "default") ? C.default : C;
+}
+function La(C) {
+  throw new Error('Could not dynamically require "' + C + '". Please configure the dynamicRequireTargets or/and ignoreDynamicRequires option of @rollup/plugin-commonjs appropriately for this require call to work.');
+}
+var Pe = { exports: {} }, Ge = {}, ua;
+function Ne() {
+  return ua || (ua = 1, (function(C) {
+    var W = typeof Uint8Array < "u" && typeof Uint16Array < "u" && typeof Int32Array < "u";
+    function V(a, t) {
+      return Object.prototype.hasOwnProperty.call(a, t);
+    }
+    C.assign = function(a) {
+      for (var t = Array.prototype.slice.call(arguments, 1); t.length; ) {
+        var h = t.shift();
+        if (h) {
+          if (typeof h != "object")
+            throw new TypeError(h + "must be non-object");
+          for (var n in h)
+            V(h, n) && (a[n] = h[n]);
+        }
+      }
+      return a;
+    }, C.shrinkBuf = function(a, t) {
+      return a.length === t ? a : a.subarray ? a.subarray(0, t) : (a.length = t, a);
+    };
+    var b = {
+      arraySet: function(a, t, h, n, g) {
+        if (t.subarray && a.subarray) {
+          a.set(t.subarray(h, h + n), g);
+          return;
+        }
+        for (var v = 0; v < n; v++)
+          a[g + v] = t[h + v];
+      },
+      // Join array of chunks to single array.
+      flattenChunks: function(a) {
+        var t, h, n, g, v, o;
+        for (n = 0, t = 0, h = a.length; t < h; t++)
+          n += a[t].length;
+        for (o = new Uint8Array(n), g = 0, t = 0, h = a.length; t < h; t++)
+          v = a[t], o.set(v, g), g += v.length;
+        return o;
+      }
+    }, P = {
+      arraySet: function(a, t, h, n, g) {
+        for (var v = 0; v < n; v++)
+          a[g + v] = t[h + v];
+      },
+      // Join array of chunks to single array.
+      flattenChunks: function(a) {
+        return [].concat.apply([], a);
+      }
+    };
+    C.setTyped = function(a) {
+      a ? (C.Buf8 = Uint8Array, C.Buf16 = Uint16Array, C.Buf32 = Int32Array, C.assign(C, b)) : (C.Buf8 = Array, C.Buf16 = Array, C.Buf32 = Array, C.assign(C, P));
+    }, C.setTyped(W);
+  })(Ge)), Ge;
+}
+var We = {}, Ce = {}, Ue = {}, va;
+function Ma() {
+  if (va) return Ue;
+  va = 1;
+  var C = Ne(), W = 4, V = 0, b = 1, P = 2;
+  function a(f) {
+    for (var y = f.length; --y >= 0; )
+      f[y] = 0;
+  }
+  var t = 0, h = 1, n = 2, g = 3, v = 258, o = 29, u = 256, w = u + 1 + o, l = 30, T = 19, z = 2 * w + 1, _ = 15, c = 16, E = 7, R = 256, Z = 16, m = 17, p = 18, I = (
+    /* 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]
+  ), F = (
+    /* 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]
+  ), L = [16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15], M = 512, B = new Array((w + 2) * 2);
+  a(B);
+  var U = new Array(l * 2);
+  a(U);
+  var J = new Array(M);
+  a(J);
+  var j = new Array(v - g + 1);
+  a(j);
+  var q = new Array(o);
+  a(q);
+  var X = new Array(l);
+  a(X);
+  function re(f, y, O, Y, s) {
+    this.static_tree = f, this.extra_bits = y, this.extra_base = O, this.elems = Y, this.max_length = s, this.has_stree = f && f.length;
+  }
+  var we, xe, ue;
+  function he(f, y) {
+    this.dyn_tree = f, this.max_code = 0, this.stat_desc = y;
+  }
+  function de(f) {
+    return f < 256 ? J[f] : J[256 + (f >>> 7)];
+  }
+  function _e(f, y) {
+    f.pending_buf[f.pending++] = y & 255, f.pending_buf[f.pending++] = y >>> 8 & 255;
+  }
+  function ie(f, y, O) {
+    f.bi_valid > c - O ? (f.bi_buf |= y << f.bi_valid & 65535, _e(f, f.bi_buf), f.bi_buf = y >> c - f.bi_valid, f.bi_valid += O - c) : (f.bi_buf |= y << f.bi_valid & 65535, f.bi_valid += O);
+  }
+  function le(f, y, O) {
+    ie(
+      f,
+      O[y * 2],
+      O[y * 2 + 1]
+      /*.Len*/
+    );
+  }
+  function ae(f, y) {
+    var O = 0;
+    do
+      O |= f & 1, f >>>= 1, O <<= 1;
+    while (--y > 0);
+    return O >>> 1;
+  }
+  function G(f) {
+    f.bi_valid === 16 ? (_e(f, f.bi_buf), f.bi_buf = 0, f.bi_valid = 0) : f.bi_valid >= 8 && (f.pending_buf[f.pending++] = f.bi_buf & 255, f.bi_buf >>= 8, f.bi_valid -= 8);
+  }
+  function Se(f, y) {
+    var O = y.dyn_tree, Y = y.max_code, s = y.stat_desc.static_tree, A = y.stat_desc.has_stree, r = y.stat_desc.extra_bits, D = y.stat_desc.extra_base, Q = y.stat_desc.max_length, e, k, S, i, d, x, $ = 0;
+    for (i = 0; i <= _; i++)
+      f.bl_count[i] = 0;
+    for (O[f.heap[f.heap_max] * 2 + 1] = 0, e = f.heap_max + 1; e < z; e++)
+      k = f.heap[e], i = O[O[k * 2 + 1] * 2 + 1] + 1, i > Q && (i = Q, $++), O[k * 2 + 1] = i, !(k > Y) && (f.bl_count[i]++, d = 0, k >= D && (d = r[k - D]), x = O[k * 2], f.opt_len += x * (i + d), A && (f.static_len += x * (s[k * 2 + 1] + d)));
+    if ($ !== 0) {
+      do {
+        for (i = Q - 1; f.bl_count[i] === 0; )
+          i--;
+        f.bl_count[i]--, f.bl_count[i + 1] += 2, f.bl_count[Q]--, $ -= 2;
+      } while ($ > 0);
+      for (i = Q; i !== 0; i--)
+        for (k = f.bl_count[i]; k !== 0; )
+          S = f.heap[--e], !(S > Y) && (O[S * 2 + 1] !== i && (f.opt_len += (i - O[S * 2 + 1]) * O[S * 2], O[S * 2 + 1] = i), k--);
+    }
+  }
+  function Ae(f, y, O) {
+    var Y = new Array(_ + 1), s = 0, A, r;
+    for (A = 1; A <= _; A++)
+      Y[A] = s = s + O[A - 1] << 1;
+    for (r = 0; r <= y; r++) {
+      var D = f[r * 2 + 1];
+      D !== 0 && (f[r * 2] = ae(Y[D]++, D));
+    }
+  }
+  function ee() {
+    var f, y, O, Y, s, A = new Array(_ + 1);
+    for (O = 0, Y = 0; Y < o - 1; Y++)
+      for (q[Y] = O, f = 0; f < 1 << I[Y]; f++)
+        j[O++] = Y;
+    for (j[O - 1] = Y, s = 0, Y = 0; Y < 16; Y++)
+      for (X[Y] = s, f = 0; f < 1 << N[Y]; f++)
+        J[s++] = Y;
+    for (s >>= 7; Y < l; Y++)
+      for (X[Y] = s << 7, f = 0; f < 1 << N[Y] - 7; f++)
+        J[256 + s++] = Y;
+    for (y = 0; y <= _; y++)
+      A[y] = 0;
+    for (f = 0; f <= 143; )
+      B[f * 2 + 1] = 8, f++, A[8]++;
+    for (; f <= 255; )
+      B[f * 2 + 1] = 9, f++, A[9]++;
+    for (; f <= 279; )
+      B[f * 2 + 1] = 7, f++, A[7]++;
+    for (; f <= 287; )
+      B[f * 2 + 1] = 8, f++, A[8]++;
+    for (Ae(B, w + 1, A), f = 0; f < l; f++)
+      U[f * 2 + 1] = 5, U[f * 2] = ae(f, 5);
+    we = new re(B, I, u + 1, w, _), xe = new re(U, N, 0, l, _), ue = new re(new Array(0), F, 0, T, E);
+  }
+  function ce(f) {
+    var y;
+    for (y = 0; y < w; y++)
+      f.dyn_ltree[y * 2] = 0;
+    for (y = 0; y < l; y++)
+      f.dyn_dtree[y * 2] = 0;
+    for (y = 0; y < T; y++)
+      f.bl_tree[y * 2] = 0;
+    f.dyn_ltree[R * 2] = 1, f.opt_len = f.static_len = 0, f.last_lit = f.matches = 0;
+  }
+  function Re(f) {
+    f.bi_valid > 8 ? _e(f, f.bi_buf) : f.bi_valid > 0 && (f.pending_buf[f.pending++] = f.bi_buf), f.bi_buf = 0, f.bi_valid = 0;
+  }
+  function ze(f, y, O, Y) {
+    Re(f), _e(f, O), _e(f, ~O), C.arraySet(f.pending_buf, f.window, y, O, f.pending), f.pending += O;
+  }
+  function be(f, y, O, Y) {
+    var s = y * 2, A = O * 2;
+    return f[s] < f[A] || f[s] === f[A] && Y[y] <= Y[O];
+  }
+  function oe(f, y, O) {
+    for (var Y = f.heap[O], s = O << 1; s <= f.heap_len && (s < f.heap_len && be(y, f.heap[s + 1], f.heap[s], f.depth) && s++, !be(y, Y, f.heap[s], f.depth)); )
+      f.heap[O] = f.heap[s], O = s, s <<= 1;
+    f.heap[O] = Y;
+  }
+  function te(f, y, O) {
+    var Y, s, A = 0, r, D;
+    if (f.last_lit !== 0)
+      do
+        Y = f.pending_buf[f.d_buf + A * 2] << 8 | f.pending_buf[f.d_buf + A * 2 + 1], s = f.pending_buf[f.l_buf + A], A++, Y === 0 ? le(f, s, y) : (r = j[s], le(f, r + u + 1, y), D = I[r], D !== 0 && (s -= q[r], ie(f, s, D)), Y--, r = de(Y), le(f, r, O), D = N[r], D !== 0 && (Y -= X[r], ie(f, Y, D)));
+      while (A < f.last_lit);
+    le(f, R, y);
+  }
+  function ye(f, y) {
+    var O = y.dyn_tree, Y = y.stat_desc.static_tree, s = y.stat_desc.has_stree, A = y.stat_desc.elems, r, D, Q = -1, e;
+    for (f.heap_len = 0, f.heap_max = z, r = 0; r < A; r++)
+      O[r * 2] !== 0 ? (f.heap[++f.heap_len] = Q = r, f.depth[r] = 0) : O[r * 2 + 1] = 0;
+    for (; f.heap_len < 2; )
+      e = f.heap[++f.heap_len] = Q < 2 ? ++Q : 0, O[e * 2] = 1, f.depth[e] = 0, f.opt_len--, s && (f.static_len -= Y[e * 2 + 1]);
+    for (y.max_code = Q, r = f.heap_len >> 1; r >= 1; r--)
+      oe(f, O, r);
+    e = A;
+    do
+      r = f.heap[
+        1
+        /*SMALLEST*/
+      ], f.heap[
+        1
+        /*SMALLEST*/
+      ] = f.heap[f.heap_len--], oe(
+        f,
+        O,
+        1
+        /*SMALLEST*/
+      ), D = f.heap[
+        1
+        /*SMALLEST*/
+      ], f.heap[--f.heap_max] = r, f.heap[--f.heap_max] = D, O[e * 2] = O[r * 2] + O[D * 2], f.depth[e] = (f.depth[r] >= f.depth[D] ? f.depth[r] : f.depth[D]) + 1, O[r * 2 + 1] = O[D * 2 + 1] = e, f.heap[
+        1
+        /*SMALLEST*/
+      ] = e++, oe(
+        f,
+        O,
+        1
+        /*SMALLEST*/
+      );
+    while (f.heap_len >= 2);
+    f.heap[--f.heap_max] = f.heap[
+      1
+      /*SMALLEST*/
+    ], Se(f, y), Ae(O, Q, f.bl_count);
+  }
+  function Ye(f, y, O) {
+    var Y, s = -1, A, r = y[1], D = 0, Q = 7, e = 4;
+    for (r === 0 && (Q = 138, e = 3), y[(O + 1) * 2 + 1] = 65535, Y = 0; Y <= O; Y++)
+      A = r, r = y[(Y + 1) * 2 + 1], !(++D < Q && A === r) && (D < e ? f.bl_tree[A * 2] += D : A !== 0 ? (A !== s && f.bl_tree[A * 2]++, f.bl_tree[Z * 2]++) : D <= 10 ? f.bl_tree[m * 2]++ : f.bl_tree[p * 2]++, D = 0, s = A, r === 0 ? (Q = 138, e = 3) : A === r ? (Q = 6, e = 3) : (Q = 7, e = 4));
+  }
+  function He(f, y, O) {
+    var Y, s = -1, A, r = y[1], D = 0, Q = 7, e = 4;
+    for (r === 0 && (Q = 138, e = 3), Y = 0; Y <= O; Y++)
+      if (A = r, r = y[(Y + 1) * 2 + 1], !(++D < Q && A === r)) {
+        if (D < e)
+          do
+            le(f, A, f.bl_tree);
+          while (--D !== 0);
+        else A !== 0 ? (A !== s && (le(f, A, f.bl_tree), D--), le(f, Z, f.bl_tree), ie(f, D - 3, 2)) : D <= 10 ? (le(f, m, f.bl_tree), ie(f, D - 3, 3)) : (le(f, p, f.bl_tree), ie(f, D - 11, 7));
+        D = 0, s = A, r === 0 ? (Q = 138, e = 3) : A === r ? (Q = 6, e = 3) : (Q = 7, e = 4);
+      }
+  }
+  function Ie(f) {
+    var y;
+    for (Ye(f, f.dyn_ltree, f.l_desc.max_code), Ye(f, f.dyn_dtree, f.d_desc.max_code), ye(f, f.bl_desc), y = T - 1; y >= 3 && f.bl_tree[L[y] * 2 + 1] === 0; y--)
+      ;
+    return f.opt_len += 3 * (y + 1) + 5 + 5 + 4, y;
+  }
+  function Xe(f, y, O, Y) {
+    var s;
+    for (ie(f, y - 257, 5), ie(f, O - 1, 5), ie(f, Y - 4, 4), s = 0; s < Y; s++)
+      ie(f, f.bl_tree[L[s] * 2 + 1], 3);
+    He(f, f.dyn_ltree, y - 1), He(f, f.dyn_dtree, O - 1);
+  }
+  function Fe(f) {
+    var y = 4093624447, O;
+    for (O = 0; O <= 31; O++, y >>>= 1)
+      if (y & 1 && f.dyn_ltree[O * 2] !== 0)
+        return V;
+    if (f.dyn_ltree[18] !== 0 || f.dyn_ltree[20] !== 0 || f.dyn_ltree[26] !== 0)
+      return b;
+    for (O = 32; O < u; O++)
+      if (f.dyn_ltree[O * 2] !== 0)
+        return b;
+    return V;
+  }
+  var me = !1;
+  function je(f) {
+    me || (ee(), me = !0), f.l_desc = new he(f.dyn_ltree, we), f.d_desc = new he(f.dyn_dtree, xe), f.bl_desc = new he(f.bl_tree, ue), f.bi_buf = 0, f.bi_valid = 0, ce(f);
+  }
+  function qe(f, y, O, Y) {
+    ie(f, (t << 1) + (Y ? 1 : 0), 3), ze(f, y, O);
+  }
+  function ke(f) {
+    ie(f, h << 1, 3), le(f, R, B), G(f);
+  }
+  function Oe(f, y, O, Y) {
+    var s, A, r = 0;
+    f.level > 0 ? (f.strm.data_type === P && (f.strm.data_type = Fe(f)), ye(f, f.l_desc), ye(f, f.d_desc), r = Ie(f), s = f.opt_len + 3 + 7 >>> 3, A = f.static_len + 3 + 7 >>> 3, A <= s && (s = A)) : s = A = O + 5, O + 4 <= s && y !== -1 ? qe(f, y, O, Y) : f.strategy === W || A === s ? (ie(f, (h << 1) + (Y ? 1 : 0), 3), te(f, B, U)) : (ie(f, (n << 1) + (Y ? 1 : 0), 3), Xe(f, f.l_desc.max_code + 1, f.d_desc.max_code + 1, r + 1), te(f, f.dyn_ltree, f.dyn_dtree)), ce(f), Y && Re(f);
+  }
+  function $e(f, y, O) {
+    return f.pending_buf[f.d_buf + f.last_lit * 2] = y >>> 8 & 255, f.pending_buf[f.d_buf + f.last_lit * 2 + 1] = y & 255, f.pending_buf[f.l_buf + f.last_lit] = O & 255, f.last_lit++, y === 0 ? f.dyn_ltree[O * 2]++ : (f.matches++, y--, f.dyn_ltree[(j[O] + u + 1) * 2]++, f.dyn_dtree[de(y) * 2]++), f.last_lit === f.lit_bufsize - 1;
+  }
+  return Ue._tr_init = je, Ue._tr_stored_block = qe, Ue._tr_flush_block = Oe, Ue._tr_tally = $e, Ue._tr_align = ke, Ue;
+}
+var ea, da;
+function ya() {
+  if (da) return ea;
+  da = 1;
+  function C(W, V, b, P) {
+    for (var a = W & 65535 | 0, t = W >>> 16 & 65535 | 0, h = 0; b !== 0; ) {
+      h = b > 2e3 ? 2e3 : b, b -= h;
+      do
+        a = a + V[P++] | 0, t = t + a | 0;
+      while (--h);
+      a %= 65521, t %= 65521;
+    }
+    return a | t << 16 | 0;
+  }
+  return ea = C, ea;
+}
+var aa, ca;
+function Ia() {
+  if (ca) return aa;
+  ca = 1;
+  function C() {
+    for (var b, P = [], a = 0; a < 256; a++) {
+      b = a;
+      for (var t = 0; t < 8; t++)
+        b = b & 1 ? 3988292384 ^ b >>> 1 : b >>> 1;
+      P[a] = b;
+    }
+    return P;
+  }
+  var W = C();
+  function V(b, P, a, t) {
+    var h = W, n = t + a;
+    b ^= -1;
+    for (var g = t; g < n; g++)
+      b = b >>> 8 ^ h[(b ^ P[g]) & 255];
+    return b ^ -1;
+  }
+  return aa = V, aa;
+}
+var ra, sa;
+function ha() {
+  return sa || (sa = 1, ra = {
+    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) */
+  }), ra;
+}
+var ga;
+function Ha() {
+  if (ga) return Ce;
+  ga = 1;
+  var C = Ne(), W = Ma(), V = ya(), b = Ia(), P = ha(), a = 0, t = 1, h = 3, n = 4, g = 5, v = 0, o = 1, u = -2, w = -3, l = -5, T = -1, z = 1, _ = 2, c = 3, E = 4, R = 0, Z = 2, m = 8, p = 9, I = 15, N = 8, F = 29, L = 256, M = L + 1 + F, B = 30, U = 19, J = 2 * M + 1, j = 15, q = 3, X = 258, re = X + q + 1, we = 32, xe = 42, ue = 69, he = 73, de = 91, _e = 103, ie = 113, le = 666, ae = 1, G = 2, Se = 3, Ae = 4, ee = 3;
+  function ce(e, k) {
+    return e.msg = P[k], k;
+  }
+  function Re(e) {
+    return (e << 1) - (e > 4 ? 9 : 0);
+  }
+  function ze(e) {
+    for (var k = e.length; --k >= 0; )
+      e[k] = 0;
+  }
+  function be(e) {
+    var k = e.state, S = k.pending;
+    S > e.avail_out && (S = e.avail_out), S !== 0 && (C.arraySet(e.output, k.pending_buf, k.pending_out, S, e.next_out), e.next_out += S, k.pending_out += S, e.total_out += S, e.avail_out -= S, k.pending -= S, k.pending === 0 && (k.pending_out = 0));
+  }
+  function oe(e, k) {
+    W._tr_flush_block(e, e.block_start >= 0 ? e.block_start : -1, e.strstart - e.block_start, k), e.block_start = e.strstart, be(e.strm);
+  }
+  function te(e, k) {
+    e.pending_buf[e.pending++] = k;
+  }
+  function ye(e, k) {
+    e.pending_buf[e.pending++] = k >>> 8 & 255, e.pending_buf[e.pending++] = k & 255;
+  }
+  function Ye(e, k, S, i) {
+    var d = e.avail_in;
+    return d > i && (d = i), d === 0 ? 0 : (e.avail_in -= d, C.arraySet(k, e.input, e.next_in, d, S), e.state.wrap === 1 ? e.adler = V(e.adler, k, d, S) : e.state.wrap === 2 && (e.adler = b(e.adler, k, d, S)), e.next_in += d, e.total_in += d, d);
+  }
+  function He(e, k) {
+    var S = e.max_chain_length, i = e.strstart, d, x, $ = e.prev_length, H = e.nice_match, K = e.strstart > e.w_size - re ? e.strstart - (e.w_size - re) : 0, ne = e.window, Le = e.w_mask, ve = e.prev, fe = e.strstart + X, ge = ne[i + $ - 1], Ee = ne[i + $];
+    e.prev_length >= e.good_match && (S >>= 2), H > e.lookahead && (H = e.lookahead);
+    do
+      if (d = k, !(ne[d + $] !== Ee || ne[d + $ - 1] !== ge || ne[d] !== ne[i] || ne[++d] !== ne[i + 1])) {
+        i += 2, d++;
+        do
+          ;
+        while (ne[++i] === ne[++d] && ne[++i] === ne[++d] && ne[++i] === ne[++d] && ne[++i] === ne[++d] && ne[++i] === ne[++d] && ne[++i] === ne[++d] && ne[++i] === ne[++d] && ne[++i] === ne[++d] && i < fe);
+        if (x = X - (fe - i), i = fe - X, x > $) {
+          if (e.match_start = k, $ = x, x >= H)
+            break;
+          ge = ne[i + $ - 1], Ee = ne[i + $];
+        }
+      }
+    while ((k = ve[k & Le]) > K && --S !== 0);
+    return $ <= e.lookahead ? $ : e.lookahead;
+  }
+  function Ie(e) {
+    var k = e.w_size, S, i, d, x, $;
+    do {
+      if (x = e.window_size - e.lookahead - e.strstart, e.strstart >= k + (k - re)) {
+        C.arraySet(e.window, e.window, k, k, 0), e.match_start -= k, e.strstart -= k, e.block_start -= k, i = e.hash_size, S = i;
+        do
+          d = e.head[--S], e.head[S] = d >= k ? d - k : 0;
+        while (--i);
+        i = k, S = i;
+        do
+          d = e.prev[--S], e.prev[S] = d >= k ? d - k : 0;
+        while (--i);
+        x += k;
+      }
+      if (e.strm.avail_in === 0)
+        break;
+      if (i = Ye(e.strm, e.window, e.strstart + e.lookahead, x), e.lookahead += i, e.lookahead + e.insert >= q)
+        for ($ = e.strstart - e.insert, e.ins_h = e.window[$], e.ins_h = (e.ins_h << e.hash_shift ^ e.window[$ + 1]) & e.hash_mask; e.insert && (e.ins_h = (e.ins_h << e.hash_shift ^ e.window[$ + q - 1]) & e.hash_mask, e.prev[$ & e.w_mask] = e.head[e.ins_h], e.head[e.ins_h] = $, $++, e.insert--, !(e.lookahead + e.insert < q)); )
+          ;
+    } while (e.lookahead < re && e.strm.avail_in !== 0);
+  }
+  function Xe(e, k) {
+    var S = 65535;
+    for (S > e.pending_buf_size - 5 && (S = e.pending_buf_size - 5); ; ) {
+      if (e.lookahead <= 1) {
+        if (Ie(e), e.lookahead === 0 && k === a)
+          return ae;
+        if (e.lookahead === 0)
+          break;
+      }
+      e.strstart += e.lookahead, e.lookahead = 0;
+      var i = e.block_start + S;
+      if ((e.strstart === 0 || e.strstart >= i) && (e.lookahead = e.strstart - i, e.strstart = i, oe(e, !1), e.strm.avail_out === 0) || e.strstart - e.block_start >= e.w_size - re && (oe(e, !1), e.strm.avail_out === 0))
+        return ae;
+    }
+    return e.insert = 0, k === n ? (oe(e, !0), e.strm.avail_out === 0 ? Se : Ae) : (e.strstart > e.block_start && (oe(e, !1), e.strm.avail_out === 0), ae);
+  }
+  function Fe(e, k) {
+    for (var S, i; ; ) {
+      if (e.lookahead < re) {
+        if (Ie(e), e.lookahead < re && k === a)
+          return ae;
+        if (e.lookahead === 0)
+          break;
+      }
+      if (S = 0, e.lookahead >= q && (e.ins_h = (e.ins_h << e.hash_shift ^ e.window[e.strstart + q - 1]) & e.hash_mask, S = e.prev[e.strstart & e.w_mask] = e.head[e.ins_h], e.head[e.ins_h] = e.strstart), S !== 0 && e.strstart - S <= e.w_size - re && (e.match_length = He(e, S)), e.match_length >= q)
+        if (i = W._tr_tally(e, e.strstart - e.match_start, e.match_length - q), e.lookahead -= e.match_length, e.match_length <= e.max_lazy_match && e.lookahead >= q) {
+          e.match_length--;
+          do
+            e.strstart++, e.ins_h = (e.ins_h << e.hash_shift ^ e.window[e.strstart + q - 1]) & e.hash_mask, S = e.prev[e.strstart & e.w_mask] = e.head[e.ins_h], e.head[e.ins_h] = e.strstart;
+          while (--e.match_length !== 0);
+          e.strstart++;
+        } else
+          e.strstart += e.match_length, e.match_length = 0, e.ins_h = e.window[e.strstart], e.ins_h = (e.ins_h << e.hash_shift ^ e.window[e.strstart + 1]) & e.hash_mask;
+      else
+        i = W._tr_tally(e, 0, e.window[e.strstart]), e.lookahead--, e.strstart++;
+      if (i && (oe(e, !1), e.strm.avail_out === 0))
+        return ae;
+    }
+    return e.insert = e.strstart < q - 1 ? e.strstart : q - 1, k === n ? (oe(e, !0), e.strm.avail_out === 0 ? Se : Ae) : e.last_lit && (oe(e, !1), e.strm.avail_out === 0) ? ae : G;
+  }
+  function me(e, k) {
+    for (var S, i, d; ; ) {
+      if (e.lookahead < re) {
+        if (Ie(e), e.lookahead < re && k === a)
+          return ae;
+        if (e.lookahead === 0)
+          break;
+      }
+      if (S = 0, e.lookahead >= q && (e.ins_h = (e.ins_h << e.hash_shift ^ e.window[e.strstart + q - 1]) & e.hash_mask, S = 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 = q - 1, S !== 0 && e.prev_length < e.max_lazy_match && e.strstart - S <= e.w_size - re && (e.match_length = He(e, S), e.match_length <= 5 && (e.strategy === z || e.match_length === q && e.strstart - e.match_start > 4096) && (e.match_length = q - 1)), e.prev_length >= q && e.match_length <= e.prev_length) {
+        d = e.strstart + e.lookahead - q, i = W._tr_tally(e, e.strstart - 1 - e.prev_match, e.prev_length - q), e.lookahead -= e.prev_length - 1, e.prev_length -= 2;
+        do
+          ++e.strstart <= d && (e.ins_h = (e.ins_h << e.hash_shift ^ e.window[e.strstart + q - 1]) & e.hash_mask, S = 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 = q - 1, e.strstart++, i && (oe(e, !1), e.strm.avail_out === 0))
+          return ae;
+      } else if (e.match_available) {
+        if (i = W._tr_tally(e, 0, e.window[e.strstart - 1]), i && oe(e, !1), e.strstart++, e.lookahead--, e.strm.avail_out === 0)
+          return ae;
+      } else
+        e.match_available = 1, e.strstart++, e.lookahead--;
+    }
+    return e.match_available && (i = W._tr_tally(e, 0, e.window[e.strstart - 1]), e.match_available = 0), e.insert = e.strstart < q - 1 ? e.strstart : q - 1, k === n ? (oe(e, !0), e.strm.avail_out === 0 ? Se : Ae) : e.last_lit && (oe(e, !1), e.strm.avail_out === 0) ? ae : G;
+  }
+  function je(e, k) {
+    for (var S, i, d, x, $ = e.window; ; ) {
+      if (e.lookahead <= X) {
+        if (Ie(e), e.lookahead <= X && k === a)
+          return ae;
+        if (e.lookahead === 0)
+          break;
+      }
+      if (e.match_length = 0, e.lookahead >= q && e.strstart > 0 && (d = e.strstart - 1, i = $[d], i === $[++d] && i === $[++d] && i === $[++d])) {
+        x = e.strstart + X;
+        do
+          ;
+        while (i === $[++d] && i === $[++d] && i === $[++d] && i === $[++d] && i === $[++d] && i === $[++d] && i === $[++d] && i === $[++d] && d < x);
+        e.match_length = X - (x - d), e.match_length > e.lookahead && (e.match_length = e.lookahead);
+      }
+      if (e.match_length >= q ? (S = W._tr_tally(e, 1, e.match_length - q), e.lookahead -= e.match_length, e.strstart += e.match_length, e.match_length = 0) : (S = W._tr_tally(e, 0, e.window[e.strstart]), e.lookahead--, e.strstart++), S && (oe(e, !1), e.strm.avail_out === 0))
+        return ae;
+    }
+    return e.insert = 0, k === n ? (oe(e, !0), e.strm.avail_out === 0 ? Se : Ae) : e.last_lit && (oe(e, !1), e.strm.avail_out === 0) ? ae : G;
+  }
+  function qe(e, k) {
+    for (var S; ; ) {
+      if (e.lookahead === 0 && (Ie(e), e.lookahead === 0)) {
+        if (k === a)
+          return ae;
+        break;
+      }
+      if (e.match_length = 0, S = W._tr_tally(e, 0, e.window[e.strstart]), e.lookahead--, e.strstart++, S && (oe(e, !1), e.strm.avail_out === 0))
+        return ae;
+    }
+    return e.insert = 0, k === n ? (oe(e, !0), e.strm.avail_out === 0 ? Se : Ae) : e.last_lit && (oe(e, !1), e.strm.avail_out === 0) ? ae : G;
+  }
+  function ke(e, k, S, i, d) {
+    this.good_length = e, this.max_lazy = k, this.nice_length = S, this.max_chain = i, this.func = d;
+  }
+  var Oe;
+  Oe = [
+    /*      good lazy nice chain */
+    new ke(0, 0, 0, 0, Xe),
+    /* 0 store only */
+    new ke(4, 4, 8, 4, Fe),
+    /* 1 max speed, no lazy matches */
+    new ke(4, 5, 16, 8, Fe),
+    /* 2 */
+    new ke(4, 6, 32, 32, Fe),
+    /* 3 */
+    new ke(4, 4, 16, 16, me),
+    /* 4 lazy matches */
+    new ke(8, 16, 32, 32, me),
+    /* 5 */
+    new ke(8, 16, 128, 128, me),
+    /* 6 */
+    new ke(8, 32, 128, 256, me),
+    /* 7 */
+    new ke(32, 128, 258, 1024, me),
+    /* 8 */
+    new ke(32, 258, 258, 4096, me)
+    /* 9 max compression */
+  ];
+  function $e(e) {
+    e.window_size = 2 * e.w_size, ze(e.head), e.max_lazy_match = Oe[e.level].max_lazy, e.good_match = Oe[e.level].good_length, e.nice_match = Oe[e.level].nice_length, e.max_chain_length = Oe[e.level].max_chain, e.strstart = 0, e.block_start = 0, e.lookahead = 0, e.insert = 0, e.match_length = e.prev_length = q - 1, e.match_available = 0, e.ins_h = 0;
+  }
+  function f() {
+    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 = m, 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 C.Buf16(J * 2), this.dyn_dtree = new C.Buf16((2 * B + 1) * 2), this.bl_tree = new C.Buf16((2 * U + 1) * 2), ze(this.dyn_ltree), ze(this.dyn_dtree), ze(this.bl_tree), this.l_desc = null, this.d_desc = null, this.bl_desc = null, this.bl_count = new C.Buf16(j + 1), this.heap = new C.Buf16(2 * M + 1), ze(this.heap), this.heap_len = 0, this.heap_max = 0, this.depth = new C.Buf16(2 * M + 1), ze(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 y(e) {
+    var k;
+    return !e || !e.state ? ce(e, u) : (e.total_in = e.total_out = 0, e.data_type = Z, k = e.state, k.pending = 0, k.pending_out = 0, k.wrap < 0 && (k.wrap = -k.wrap), k.status = k.wrap ? xe : ie, e.adler = k.wrap === 2 ? 0 : 1, k.last_flush = a, W._tr_init(k), v);
+  }
+  function O(e) {
+    var k = y(e);
+    return k === v && $e(e.state), k;
+  }
+  function Y(e, k) {
+    return !e || !e.state || e.state.wrap !== 2 ? u : (e.state.gzhead = k, v);
+  }
+  function s(e, k, S, i, d, x) {
+    if (!e)
+      return u;
+    var $ = 1;
+    if (k === T && (k = 6), i < 0 ? ($ = 0, i = -i) : i > 15 && ($ = 2, i -= 16), d < 1 || d > p || S !== m || i < 8 || i > 15 || k < 0 || k > 9 || x < 0 || x > E)
+      return ce(e, u);
+    i === 8 && (i = 9);
+    var H = new f();
+    return e.state = H, H.strm = e, H.wrap = $, H.gzhead = null, H.w_bits = i, H.w_size = 1 << H.w_bits, H.w_mask = H.w_size - 1, H.hash_bits = d + 7, H.hash_size = 1 << H.hash_bits, H.hash_mask = H.hash_size - 1, H.hash_shift = ~~((H.hash_bits + q - 1) / q), H.window = new C.Buf8(H.w_size * 2), H.head = new C.Buf16(H.hash_size), H.prev = new C.Buf16(H.w_size), H.lit_bufsize = 1 << d + 6, H.pending_buf_size = H.lit_bufsize * 4, H.pending_buf = new C.Buf8(H.pending_buf_size), H.d_buf = 1 * H.lit_bufsize, H.l_buf = 3 * H.lit_bufsize, H.level = k, H.strategy = x, H.method = S, O(e);
+  }
+  function A(e, k) {
+    return s(e, k, m, I, N, R);
+  }
+  function r(e, k) {
+    var S, i, d, x;
+    if (!e || !e.state || k > g || k < 0)
+      return e ? ce(e, u) : u;
+    if (i = e.state, !e.output || !e.input && e.avail_in !== 0 || i.status === le && k !== n)
+      return ce(e, e.avail_out === 0 ? l : u);
+    if (i.strm = e, S = i.last_flush, i.last_flush = k, i.status === xe)
+      if (i.wrap === 2)
+        e.adler = 0, te(i, 31), te(i, 139), te(i, 8), i.gzhead ? (te(
+          i,
+          (i.gzhead.text ? 1 : 0) + (i.gzhead.hcrc ? 2 : 0) + (i.gzhead.extra ? 4 : 0) + (i.gzhead.name ? 8 : 0) + (i.gzhead.comment ? 16 : 0)
+        ), te(i, i.gzhead.time & 255), te(i, i.gzhead.time >> 8 & 255), te(i, i.gzhead.time >> 16 & 255), te(i, i.gzhead.time >> 24 & 255), te(i, i.level === 9 ? 2 : i.strategy >= _ || i.level < 2 ? 4 : 0), te(i, i.gzhead.os & 255), i.gzhead.extra && i.gzhead.extra.length && (te(i, i.gzhead.extra.length & 255), te(i, i.gzhead.extra.length >> 8 & 255)), i.gzhead.hcrc && (e.adler = b(e.adler, i.pending_buf, i.pending, 0)), i.gzindex = 0, i.status = ue) : (te(i, 0), te(i, 0), te(i, 0), te(i, 0), te(i, 0), te(i, i.level === 9 ? 2 : i.strategy >= _ || i.level < 2 ? 4 : 0), te(i, ee), i.status = ie);
+      else {
+        var $ = m + (i.w_bits - 8 << 4) << 8, H = -1;
+        i.strategy >= _ || i.level < 2 ? H = 0 : i.level < 6 ? H = 1 : i.level === 6 ? H = 2 : H = 3, $ |= H << 6, i.strstart !== 0 && ($ |= we), $ += 31 - $ % 31, i.status = ie, ye(i, $), i.strstart !== 0 && (ye(i, e.adler >>> 16), ye(i, e.adler & 65535)), e.adler = 1;
+      }
+    if (i.status === ue)
+      if (i.gzhead.extra) {
+        for (d = i.pending; i.gzindex < (i.gzhead.extra.length & 65535) && !(i.pending === i.pending_buf_size && (i.gzhead.hcrc && i.pending > d && (e.adler = b(e.adler, i.pending_buf, i.pending - d, d)), be(e), d = i.pending, i.pending === i.pending_buf_size)); )
+          te(i, i.gzhead.extra[i.gzindex] & 255), i.gzindex++;
+        i.gzhead.hcrc && i.pending > d && (e.adler = b(e.adler, i.pending_buf, i.pending - d, d)), i.gzindex === i.gzhead.extra.length && (i.gzindex = 0, i.status = he);
+      } else
+        i.status = he;
+    if (i.status === he)
+      if (i.gzhead.name) {
+        d = i.pending;
+        do {
+          if (i.pending === i.pending_buf_size && (i.gzhead.hcrc && i.pending > d && (e.adler = b(e.adler, i.pending_buf, i.pending - d, d)), be(e), d = i.pending, i.pending === i.pending_buf_size)) {
+            x = 1;
+            break;
+          }
+          i.gzindex < i.gzhead.name.length ? x = i.gzhead.name.charCodeAt(i.gzindex++) & 255 : x = 0, te(i, x);
+        } while (x !== 0);
+        i.gzhead.hcrc && i.pending > d && (e.adler = b(e.adler, i.pending_buf, i.pending - d, d)), x === 0 && (i.gzindex = 0, i.status = de);
+      } else
+        i.status = de;
+    if (i.status === de)
+      if (i.gzhead.comment) {
+        d = i.pending;
+        do {
+          if (i.pending === i.pending_buf_size && (i.gzhead.hcrc && i.pending > d && (e.adler = b(e.adler, i.pending_buf, i.pending - d, d)), be(e), d = i.pending, i.pending === i.pending_buf_size)) {
+            x = 1;
+            break;
+          }
+          i.gzindex < i.gzhead.comment.length ? x = i.gzhead.comment.charCodeAt(i.gzindex++) & 255 : x = 0, te(i, x);
+        } while (x !== 0);
+        i.gzhead.hcrc && i.pending > d && (e.adler = b(e.adler, i.pending_buf, i.pending - d, d)), x === 0 && (i.status = _e);
+      } else
+        i.status = _e;
+    if (i.status === _e && (i.gzhead.hcrc ? (i.pending + 2 > i.pending_buf_size && be(e), i.pending + 2 <= i.pending_buf_size && (te(i, e.adler & 255), te(i, e.adler >> 8 & 255), e.adler = 0, i.status = ie)) : i.status = ie), i.pending !== 0) {
+      if (be(e), e.avail_out === 0)
+        return i.last_flush = -1, v;
+    } else if (e.avail_in === 0 && Re(k) <= Re(S) && k !== n)
+      return ce(e, l);
+    if (i.status === le && e.avail_in !== 0)
+      return ce(e, l);
+    if (e.avail_in !== 0 || i.lookahead !== 0 || k !== a && i.status !== le) {
+      var K = i.strategy === _ ? qe(i, k) : i.strategy === c ? je(i, k) : Oe[i.level].func(i, k);
+      if ((K === Se || K === Ae) && (i.status = le), K === ae || K === Se)
+        return e.avail_out === 0 && (i.last_flush = -1), v;
+      if (K === G && (k === t ? W._tr_align(i) : k !== g && (W._tr_stored_block(i, 0, 0, !1), k === h && (ze(i.head), i.lookahead === 0 && (i.strstart = 0, i.block_start = 0, i.insert = 0))), be(e), e.avail_out === 0))
+        return i.last_flush = -1, v;
+    }
+    return k !== n ? v : i.wrap <= 0 ? o : (i.wrap === 2 ? (te(i, e.adler & 255), te(i, e.adler >> 8 & 255), te(i, e.adler >> 16 & 255), te(i, e.adler >> 24 & 255), te(i, e.total_in & 255), te(i, e.total_in >> 8 & 255), te(i, e.total_in >> 16 & 255), te(i, e.total_in >> 24 & 255)) : (ye(i, e.adler >>> 16), ye(i, e.adler & 65535)), be(e), i.wrap > 0 && (i.wrap = -i.wrap), i.pending !== 0 ? v : o);
+  }
+  function D(e) {
+    var k;
+    return !e || !e.state ? u : (k = e.state.status, k !== xe && k !== ue && k !== he && k !== de && k !== _e && k !== ie && k !== le ? ce(e, u) : (e.state = null, k === ie ? ce(e, w) : v));
+  }
+  function Q(e, k) {
+    var S = k.length, i, d, x, $, H, K, ne, Le;
+    if (!e || !e.state || (i = e.state, $ = i.wrap, $ === 2 || $ === 1 && i.status !== xe || i.lookahead))
+      return u;
+    for ($ === 1 && (e.adler = V(e.adler, k, S, 0)), i.wrap = 0, S >= i.w_size && ($ === 0 && (ze(i.head), i.strstart = 0, i.block_start = 0, i.insert = 0), Le = new C.Buf8(i.w_size), C.arraySet(Le, k, S - i.w_size, i.w_size, 0), k = Le, S = i.w_size), H = e.avail_in, K = e.next_in, ne = e.input, e.avail_in = S, e.next_in = 0, e.input = k, Ie(i); i.lookahead >= q; ) {
+      d = i.strstart, x = i.lookahead - (q - 1);
+      do
+        i.ins_h = (i.ins_h << i.hash_shift ^ i.window[d + q - 1]) & i.hash_mask, i.prev[d & i.w_mask] = i.head[i.ins_h], i.head[i.ins_h] = d, d++;
+      while (--x);
+      i.strstart = d, i.lookahead = q - 1, Ie(i);
+    }
+    return i.strstart += i.lookahead, i.block_start = i.strstart, i.insert = i.lookahead, i.lookahead = 0, i.match_length = i.prev_length = q - 1, i.match_available = 0, e.next_in = K, e.input = ne, e.avail_in = H, i.wrap = $, v;
+  }
+  return Ce.deflateInit = A, Ce.deflateInit2 = s, Ce.deflateReset = O, Ce.deflateResetKeep = y, Ce.deflateSetHeader = Y, Ce.deflate = r, Ce.deflateEnd = D, Ce.deflateSetDictionary = Q, Ce.deflateInfo = "pako deflate (from Nodeca project)", Ce;
+}
+var Ke = {}, wa;
+function Da() {
+  if (wa) return Ke;
+  wa = 1;
+  var C = Ne(), W = !0, V = !0;
+  try {
+    String.fromCharCode.apply(null, [0]);
+  } catch {
+    W = !1;
+  }
+  try {
+    String.fromCharCode.apply(null, new Uint8Array(1));
+  } catch {
+    V = !1;
+  }
+  for (var b = new C.Buf8(256), P = 0; P < 256; P++)
+    b[P] = P >= 252 ? 6 : P >= 248 ? 5 : P >= 240 ? 4 : P >= 224 ? 3 : P >= 192 ? 2 : 1;
+  b[254] = b[254] = 1, Ke.string2buf = function(t) {
+    var h, n, g, v, o, u = t.length, w = 0;
+    for (v = 0; v < u; v++)
+      n = t.charCodeAt(v), (n & 64512) === 55296 && v + 1 < u && (g = t.charCodeAt(v + 1), (g & 64512) === 56320 && (n = 65536 + (n - 55296 << 10) + (g - 56320), v++)), w += n < 128 ? 1 : n < 2048 ? 2 : n < 65536 ? 3 : 4;
+    for (h = new C.Buf8(w), o = 0, v = 0; o < w; v++)
+      n = t.charCodeAt(v), (n & 64512) === 55296 && v + 1 < u && (g = t.charCodeAt(v + 1), (g & 64512) === 56320 && (n = 65536 + (n - 55296 << 10) + (g - 56320), v++)), n < 128 ? h[o++] = n : n < 2048 ? (h[o++] = 192 | n >>> 6, h[o++] = 128 | n & 63) : n < 65536 ? (h[o++] = 224 | n >>> 12, h[o++] = 128 | n >>> 6 & 63, h[o++] = 128 | n & 63) : (h[o++] = 240 | n >>> 18, h[o++] = 128 | n >>> 12 & 63, h[o++] = 128 | n >>> 6 & 63, h[o++] = 128 | n & 63);
+    return h;
+  };
+  function a(t, h) {
+    if (h < 65534 && (t.subarray && V || !t.subarray && W))
+      return String.fromCharCode.apply(null, C.shrinkBuf(t, h));
+    for (var n = "", g = 0; g < h; g++)
+      n += String.fromCharCode(t[g]);
+    return n;
+  }
+  return Ke.buf2binstring = function(t) {
+    return a(t, t.length);
+  }, Ke.binstring2buf = function(t) {
+    for (var h = new C.Buf8(t.length), n = 0, g = h.length; n < g; n++)
+      h[n] = t.charCodeAt(n);
+    return h;
+  }, Ke.buf2string = function(t, h) {
+    var n, g, v, o, u = h || t.length, w = new Array(u * 2);
+    for (g = 0, n = 0; n < u; ) {
+      if (v = t[n++], v < 128) {
+        w[g++] = v;
+        continue;
+      }
+      if (o = b[v], o > 4) {
+        w[g++] = 65533, n += o - 1;
+        continue;
+      }
+      for (v &= o === 2 ? 31 : o === 3 ? 15 : 7; o > 1 && n < u; )
+        v = v << 6 | t[n++] & 63, o--;
+      if (o > 1) {
+        w[g++] = 65533;
+        continue;
+      }
+      v < 65536 ? w[g++] = v : (v -= 65536, w[g++] = 55296 | v >> 10 & 1023, w[g++] = 56320 | v & 1023);
+    }
+    return a(w, g);
+  }, Ke.utf8border = function(t, h) {
+    var n;
+    for (h = h || t.length, h > t.length && (h = t.length), n = h - 1; n >= 0 && (t[n] & 192) === 128; )
+      n--;
+    return n < 0 || n === 0 ? h : n + b[t[n]] > h ? n : h;
+  }, Ke;
+}
+var ta, ba;
+function Za() {
+  if (ba) return ta;
+  ba = 1;
+  function C() {
+    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 ta = C, ta;
+}
+var pa;
+function Fa() {
+  if (pa) return We;
+  pa = 1;
+  var C = Ha(), W = Ne(), V = Da(), b = ha(), P = Za(), a = Object.prototype.toString, t = 0, h = 4, n = 0, g = 1, v = 2, o = -1, u = 0, w = 8;
+  function l(c) {
+    if (!(this instanceof l)) return new l(c);
+    this.options = W.assign({
+      level: o,
+      method: w,
+      chunkSize: 16384,
+      windowBits: 15,
+      memLevel: 8,
+      strategy: u,
+      to: ""
+    }, c || {});
+    var E = this.options;
+    E.raw && E.windowBits > 0 ? E.windowBits = -E.windowBits : E.gzip && E.windowBits > 0 && E.windowBits < 16 && (E.windowBits += 16), this.err = 0, this.msg = "", this.ended = !1, this.chunks = [], this.strm = new P(), this.strm.avail_out = 0;
+    var R = C.deflateInit2(
+      this.strm,
+      E.level,
+      E.method,
+      E.windowBits,
+      E.memLevel,
+      E.strategy
+    );
+    if (R !== n)
+      throw new Error(b[R]);
+    if (E.header && C.deflateSetHeader(this.strm, E.header), E.dictionary) {
+      var Z;
+      if (typeof E.dictionary == "string" ? Z = V.string2buf(E.dictionary) : a.call(E.dictionary) === "[object ArrayBuffer]" ? Z = new Uint8Array(E.dictionary) : Z = E.dictionary, R = C.deflateSetDictionary(this.strm, Z), R !== n)
+        throw new Error(b[R]);
+      this._dict_set = !0;
+    }
+  }
+  l.prototype.push = function(c, E) {
+    var R = this.strm, Z = this.options.chunkSize, m, p;
+    if (this.ended)
+      return !1;
+    p = E === ~~E ? E : E === !0 ? h : t, typeof c == "string" ? R.input = V.string2buf(c) : a.call(c) === "[object ArrayBuffer]" ? R.input = new Uint8Array(c) : R.input = c, R.next_in = 0, R.avail_in = R.input.length;
+    do {
+      if (R.avail_out === 0 && (R.output = new W.Buf8(Z), R.next_out = 0, R.avail_out = Z), m = C.deflate(R, p), m !== g && m !== n)
+        return this.onEnd(m), this.ended = !0, !1;
+      (R.avail_out === 0 || R.avail_in === 0 && (p === h || p === v)) && (this.options.to === "string" ? this.onData(V.buf2binstring(W.shrinkBuf(R.output, R.next_out))) : this.onData(W.shrinkBuf(R.output, R.next_out)));
+    } while ((R.avail_in > 0 || R.avail_out === 0) && m !== g);
+    return p === h ? (m = C.deflateEnd(this.strm), this.onEnd(m), this.ended = !0, m === n) : (p === v && (this.onEnd(n), R.avail_out = 0), !0);
+  }, l.prototype.onData = function(c) {
+    this.chunks.push(c);
+  }, l.prototype.onEnd = function(c) {
+    c === n && (this.options.to === "string" ? this.result = this.chunks.join("") : this.result = W.flattenChunks(this.chunks)), this.chunks = [], this.err = c, this.msg = this.strm.msg;
+  };
+  function T(c, E) {
+    var R = new l(E);
+    if (R.push(c, !0), R.err)
+      throw R.msg || b[R.err];
+    return R.result;
+  }
+  function z(c, E) {
+    return E = E || {}, E.raw = !0, T(c, E);
+  }
+  function _(c, E) {
+    return E = E || {}, E.gzip = !0, T(c, E);
+  }
+  return We.Deflate = l, We.deflate = T, We.deflateRaw = z, We.gzip = _, We;
+}
+var Ve = {}, Ze = {}, ia, xa;
+function qa() {
+  if (xa) return ia;
+  xa = 1;
+  var C = 30, W = 12;
+  return ia = function(b, P) {
+    var a, t, h, n, g, v, o, u, w, l, T, z, _, c, E, R, Z, m, p, I, N, F, L, M, B;
+    a = b.state, t = b.next_in, M = b.input, h = t + (b.avail_in - 5), n = b.next_out, B = b.output, g = n - (P - b.avail_out), v = n + (b.avail_out - 257), o = a.dmax, u = a.wsize, w = a.whave, l = a.wnext, T = a.window, z = a.hold, _ = a.bits, c = a.lencode, E = a.distcode, R = (1 << a.lenbits) - 1, Z = (1 << a.distbits) - 1;
+    e:
+      do {
+        _ < 15 && (z += M[t++] << _, _ += 8, z += M[t++] << _, _ += 8), m = c[z & R];
+        a:
+          for (; ; ) {
+            if (p = m >>> 24, z >>>= p, _ -= p, p = m >>> 16 & 255, p === 0)
+              B[n++] = m & 65535;
+            else if (p & 16) {
+              I = m & 65535, p &= 15, p && (_ < p && (z += M[t++] << _, _ += 8), I += z & (1 << p) - 1, z >>>= p, _ -= p), _ < 15 && (z += M[t++] << _, _ += 8, z += M[t++] << _, _ += 8), m = E[z & Z];
+              r:
+                for (; ; ) {
+                  if (p = m >>> 24, z >>>= p, _ -= p, p = m >>> 16 & 255, p & 16) {
+                    if (N = m & 65535, p &= 15, _ < p && (z += M[t++] << _, _ += 8, _ < p && (z += M[t++] << _, _ += 8)), N += z & (1 << p) - 1, N > o) {
+                      b.msg = "invalid distance too far back", a.mode = C;
+                      break e;
+                    }
+                    if (z >>>= p, _ -= p, p = n - g, N > p) {
+                      if (p = N - p, p > w && a.sane) {
+                        b.msg = "invalid distance too far back", a.mode = C;
+                        break e;
+                      }
+                      if (F = 0, L = T, l === 0) {
+                        if (F += u - p, p < I) {
+                          I -= p;
+                          do
+                            B[n++] = T[F++];
+                          while (--p);
+                          F = n - N, L = B;
+                        }
+                      } else if (l < p) {
+                        if (F += u + l - p, p -= l, p < I) {
+                          I -= p;
+                          do
+                            B[n++] = T[F++];
+                          while (--p);
+                          if (F = 0, l < I) {
+                            p = l, I -= p;
+                            do
+                              B[n++] = T[F++];
+                            while (--p);
+                            F = n - N, L = B;
+                          }
+                        }
+                      } else if (F += l - p, p < I) {
+                        I -= p;
+                        do
+                          B[n++] = T[F++];
+                        while (--p);
+                        F = n - N, L = B;
+                      }
+                      for (; I > 2; )
+                        B[n++] = L[F++], B[n++] = L[F++], B[n++] = L[F++], I -= 3;
+                      I && (B[n++] = L[F++], I > 1 && (B[n++] = L[F++]));
+                    } else {
+                      F = n - N;
+                      do
+                        B[n++] = B[F++], B[n++] = B[F++], B[n++] = B[F++], I -= 3;
+                      while (I > 2);
+                      I && (B[n++] = B[F++], I > 1 && (B[n++] = B[F++]));
+                    }
+                  } else if ((p & 64) === 0) {
+                    m = E[(m & 65535) + (z & (1 << p) - 1)];
+                    continue r;
+                  } else {
+                    b.msg = "invalid distance code", a.mode = C;
+                    break e;
+                  }
+                  break;
+                }
+            } else if ((p & 64) === 0) {
+              m = c[(m & 65535) + (z & (1 << p) - 1)];
+              continue a;
+            } else if (p & 32) {
+              a.mode = W;
+              break e;
+            } else {
+              b.msg = "invalid literal/length code", a.mode = C;
+              break e;
+            }
+            break;
+          }
+      } while (t < h && n < v);
+    I = _ >> 3, t -= I, _ -= I << 3, z &= (1 << _) - 1, b.next_in = t, b.next_out = n, b.avail_in = t < h ? 5 + (h - t) : 5 - (t - h), b.avail_out = n < v ? 257 + (v - n) : 257 - (n - v), a.hold = z, a.bits = _;
+  }, ia;
+}
+var na, ka;
+function Na() {
+  if (ka) return na;
+  ka = 1;
+  var C = Ne(), W = 15, V = 852, b = 592, P = 0, a = 1, t = 2, h = [
+    /* 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
+  ], n = [
+    /* 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
+  ], g = [
+    /* 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 na = function(u, w, l, T, z, _, c, E) {
+    var R = E.bits, Z = 0, m = 0, p = 0, I = 0, N = 0, F = 0, L = 0, M = 0, B = 0, U = 0, J, j, q, X, re, we = null, xe = 0, ue, he = new C.Buf16(W + 1), de = new C.Buf16(W + 1), _e = null, ie = 0, le, ae, G;
+    for (Z = 0; Z <= W; Z++)
+      he[Z] = 0;
+    for (m = 0; m < T; m++)
+      he[w[l + m]]++;
+    for (N = R, I = W; I >= 1 && he[I] === 0; I--)
+      ;
+    if (N > I && (N = I), I === 0)
+      return z[_++] = 1 << 24 | 64 << 16 | 0, z[_++] = 1 << 24 | 64 << 16 | 0, E.bits = 1, 0;
+    for (p = 1; p < I && he[p] === 0; p++)
+      ;
+    for (N < p && (N = p), M = 1, Z = 1; Z <= W; Z++)
+      if (M <<= 1, M -= he[Z], M < 0)
+        return -1;
+    if (M > 0 && (u === P || I !== 1))
+      return -1;
+    for (de[1] = 0, Z = 1; Z < W; Z++)
+      de[Z + 1] = de[Z] + he[Z];
+    for (m = 0; m < T; m++)
+      w[l + m] !== 0 && (c[de[w[l + m]]++] = m);
+    if (u === P ? (we = _e = c, ue = 19) : u === a ? (we = h, xe -= 257, _e = n, ie -= 257, ue = 256) : (we = g, _e = v, ue = -1), U = 0, m = 0, Z = p, re = _, F = N, L = 0, q = -1, B = 1 << N, X = B - 1, u === a && B > V || u === t && B > b)
+      return 1;
+    for (; ; ) {
+      le = Z - L, c[m] < ue ? (ae = 0, G = c[m]) : c[m] > ue ? (ae = _e[ie + c[m]], G = we[xe + c[m]]) : (ae = 96, G = 0), J = 1 << Z - L, j = 1 << F, p = j;
+      do
+        j -= J, z[re + (U >> L) + j] = le << 24 | ae << 16 | G | 0;
+      while (j !== 0);
+      for (J = 1 << Z - 1; U & J; )
+        J >>= 1;
+      if (J !== 0 ? (U &= J - 1, U += J) : U = 0, m++, --he[Z] === 0) {
+        if (Z === I)
+          break;
+        Z = w[l + c[m]];
+      }
+      if (Z > N && (U & X) !== q) {
+        for (L === 0 && (L = N), re += p, F = Z - L, M = 1 << F; F + L < I && (M -= he[F + L], !(M <= 0)); )
+          F++, M <<= 1;
+        if (B += 1 << F, u === a && B > V || u === t && B > b)
+          return 1;
+        q = U & X, z[q] = N << 24 | F << 16 | re - _ | 0;
+      }
+    }
+    return U !== 0 && (z[re + U] = Z - L << 24 | 64 << 16 | 0), E.bits = N, 0;
+  }, na;
+}
+var Ea;
+function Ua() {
+  if (Ea) return Ze;
+  Ea = 1;
+  var C = Ne(), W = ya(), V = Ia(), b = qa(), P = Na(), a = 0, t = 1, h = 2, n = 4, g = 5, v = 6, o = 0, u = 1, w = 2, l = -2, T = -3, z = -4, _ = -5, c = 8, E = 1, R = 2, Z = 3, m = 4, p = 5, I = 6, N = 7, F = 8, L = 9, M = 10, B = 11, U = 12, J = 13, j = 14, q = 15, X = 16, re = 17, we = 18, xe = 19, ue = 20, he = 21, de = 22, _e = 23, ie = 24, le = 25, ae = 26, G = 27, Se = 28, Ae = 29, ee = 30, ce = 31, Re = 32, ze = 852, be = 592, oe = 15, te = oe;
+  function ye(s) {
+    return (s >>> 24 & 255) + (s >>> 8 & 65280) + ((s & 65280) << 8) + ((s & 255) << 24);
+  }
+  function Ye() {
+    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 C.Buf16(320), this.work = new C.Buf16(288), this.lendyn = null, this.distdyn = null, this.sane = 0, this.back = 0, this.was = 0;
+  }
+  function He(s) {
+    var A;
+    return !s || !s.state ? l : (A = s.state, s.total_in = s.total_out = A.total = 0, s.msg = "", A.wrap && (s.adler = A.wrap & 1), A.mode = E, A.last = 0, A.havedict = 0, A.dmax = 32768, A.head = null, A.hold = 0, A.bits = 0, A.lencode = A.lendyn = new C.Buf32(ze), A.distcode = A.distdyn = new C.Buf32(be), A.sane = 1, A.back = -1, o);
+  }
+  function Ie(s) {
+    var A;
+    return !s || !s.state ? l : (A = s.state, A.wsize = 0, A.whave = 0, A.wnext = 0, He(s));
+  }
+  function Xe(s, A) {
+    var r, D;
+    return !s || !s.state || (D = s.state, A < 0 ? (r = 0, A = -A) : (r = (A >> 4) + 1, A < 48 && (A &= 15)), A && (A < 8 || A > 15)) ? l : (D.window !== null && D.wbits !== A && (D.window = null), D.wrap = r, D.wbits = A, Ie(s));
+  }
+  function Fe(s, A) {
+    var r, D;
+    return s ? (D = new Ye(), s.state = D, D.window = null, r = Xe(s, A), r !== o && (s.state = null), r) : l;
+  }
+  function me(s) {
+    return Fe(s, te);
+  }
+  var je = !0, qe, ke;
+  function Oe(s) {
+    if (je) {
+      var A;
+      for (qe = new C.Buf32(512), ke = new C.Buf32(32), A = 0; A < 144; )
+        s.lens[A++] = 8;
+      for (; A < 256; )
+        s.lens[A++] = 9;
+      for (; A < 280; )
+        s.lens[A++] = 7;
+      for (; A < 288; )
+        s.lens[A++] = 8;
+      for (P(t, s.lens, 0, 288, qe, 0, s.work, { bits: 9 }), A = 0; A < 32; )
+        s.lens[A++] = 5;
+      P(h, s.lens, 0, 32, ke, 0, s.work, { bits: 5 }), je = !1;
+    }
+    s.lencode = qe, s.lenbits = 9, s.distcode = ke, s.distbits = 5;
+  }
+  function $e(s, A, r, D) {
+    var Q, e = s.state;
+    return e.window === null && (e.wsize = 1 << e.wbits, e.wnext = 0, e.whave = 0, e.window = new C.Buf8(e.wsize)), D >= e.wsize ? (C.arraySet(e.window, A, r - e.wsize, e.wsize, 0), e.wnext = 0, e.whave = e.wsize) : (Q = e.wsize - e.wnext, Q > D && (Q = D), C.arraySet(e.window, A, r - D, Q, e.wnext), D -= Q, D ? (C.arraySet(e.window, A, r - D, D, 0), e.wnext = D, e.whave = e.wsize) : (e.wnext += Q, e.wnext === e.wsize && (e.wnext = 0), e.whave < e.wsize && (e.whave += Q))), 0;
+  }
+  function f(s, A) {
+    var r, D, Q, e, k, S, i, d, x, $, H, K, ne, Le, ve = 0, fe, ge, Ee, Te, Je, Qe, se, De, pe = new C.Buf8(4), Me, Be, _a = (
+      /* 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 l;
+    r = s.state, r.mode === U && (r.mode = J), k = s.next_out, Q = s.output, i = s.avail_out, e = s.next_in, D = s.input, S = s.avail_in, d = r.hold, x = r.bits, $ = S, H = i, De = o;
+    e:
+      for (; ; )
+        switch (r.mode) {
+          case E:
+            if (r.wrap === 0) {
+              r.mode = J;
+              break;
+            }
+            for (; x < 16; ) {
+              if (S === 0)
+                break e;
+              S--, d += D[e++] << x, x += 8;
+            }
+            if (r.wrap & 2 && d === 35615) {
+              r.check = 0, pe[0] = d & 255, pe[1] = d >>> 8 & 255, r.check = V(r.check, pe, 2, 0), d = 0, x = 0, r.mode = R;
+              break;
+            }
+            if (r.flags = 0, r.head && (r.head.done = !1), !(r.wrap & 1) || /* check if zlib header allowed */
+            (((d & 255) << 8) + (d >> 8)) % 31) {
+              s.msg = "incorrect header check", r.mode = ee;
+              break;
+            }
+            if ((d & 15) !== c) {
+              s.msg = "unknown compression method", r.mode = ee;
+              break;
+            }
+            if (d >>>= 4, x -= 4, se = (d & 15) + 8, r.wbits === 0)
+              r.wbits = se;
+            else if (se > r.wbits) {
+              s.msg = "invalid window size", r.mode = ee;
+              break;
+            }
+            r.dmax = 1 << se, s.adler = r.check = 1, r.mode = d & 512 ? M : U, d = 0, x = 0;
+            break;
+          case R:
+            for (; x < 16; ) {
+              if (S === 0)
+                break e;
+              S--, d += D[e++] << x, x += 8;
+            }
+            if (r.flags = d, (r.flags & 255) !== c) {
+              s.msg = "unknown compression method", r.mode = ee;
+              break;
+            }
+            if (r.flags & 57344) {
+              s.msg = "unknown header flags set", r.mode = ee;
+              break;
+            }
+            r.head && (r.head.text = d >> 8 & 1), r.flags & 512 && (pe[0] = d & 255, pe[1] = d >>> 8 & 255, r.check = V(r.check, pe, 2, 0)), d = 0, x = 0, r.mode = Z;
+          /* falls through */
+          case Z:
+            for (; x < 32; ) {
+              if (S === 0)
+                break e;
+              S--, d += D[e++] << x, x += 8;
+            }
+            r.head && (r.head.time = d), r.flags & 512 && (pe[0] = d & 255, pe[1] = d >>> 8 & 255, pe[2] = d >>> 16 & 255, pe[3] = d >>> 24 & 255, r.check = V(r.check, pe, 4, 0)), d = 0, x = 0, r.mode = m;
+          /* falls through */
+          case m:
+            for (; x < 16; ) {
+              if (S === 0)
+                break e;
+              S--, d += D[e++] << x, x += 8;
+            }
+            r.head && (r.head.xflags = d & 255, r.head.os = d >> 8), r.flags & 512 && (pe[0] = d & 255, pe[1] = d >>> 8 & 255, r.check = V(r.check, pe, 2, 0)), d = 0, x = 0, r.mode = p;
+          /* falls through */
+          case p:
+            if (r.flags & 1024) {
+              for (; x < 16; ) {
+                if (S === 0)
+                  break e;
+                S--, d += D[e++] << x, x += 8;
+              }
+              r.length = d, r.head && (r.head.extra_len = d), r.flags & 512 && (pe[0] = d & 255, pe[1] = d >>> 8 & 255, r.check = V(r.check, pe, 2, 0)), d = 0, x = 0;
+            } else r.head && (r.head.extra = null);
+            r.mode = I;
+          /* falls through */
+          case I:
+            if (r.flags & 1024 && (K = r.length, K > S && (K = S), K && (r.head && (se = r.head.extra_len - r.length, r.head.extra || (r.head.extra = new Array(r.head.extra_len)), C.arraySet(
+              r.head.extra,
+              D,
+              e,
+              // extra field is limited to 65536 bytes
+              // - no need for additional size check
+              K,
+              /*len + copy > state.head.extra_max - len ? state.head.extra_max : copy,*/
+              se
+            )), r.flags & 512 && (r.check = V(r.check, D, K, e)), S -= K, e += K, r.length -= K), r.length))
+              break e;
+            r.length = 0, r.mode = N;
+          /* falls through */
+          case N:
+            if (r.flags & 2048) {
+              if (S === 0)
+                break e;
+              K = 0;
+              do
+                se = D[e + K++], r.head && se && r.length < 65536 && (r.head.name += String.fromCharCode(se));
+              while (se && K < S);
+              if (r.flags & 512 && (r.check = V(r.check, D, K, e)), S -= K, e += K, se)
+                break e;
+            } else r.head && (r.head.name = null);
+            r.length = 0, r.mode = F;
+          /* falls through */
+          case F:
+            if (r.flags & 4096) {
+              if (S === 0)
+                break e;
+              K = 0;
+              do
+                se = D[e + K++], r.head && se && r.length < 65536 && (r.head.comment += String.fromCharCode(se));
+              while (se && K < S);
+              if (r.flags & 512 && (r.check = V(r.check, D, K, e)), S -= K, e += K, se)
+                break e;
+            } else r.head && (r.head.comment = null);
+            r.mode = L;
+          /* falls through */
+          case L:
+            if (r.flags & 512) {
+              for (; x < 16; ) {
+                if (S === 0)
+                  break e;
+                S--, d += D[e++] << x, x += 8;
+              }
+              if (d !== (r.check & 65535)) {
+                s.msg = "header crc mismatch", r.mode = ee;
+                break;
+              }
+              d = 0, x = 0;
+            }
+            r.head && (r.head.hcrc = r.flags >> 9 & 1, r.head.done = !0), s.adler = r.check = 0, r.mode = U;
+            break;
+          case M:
+            for (; x < 32; ) {
+              if (S === 0)
+                break e;
+              S--, d += D[e++] << x, x += 8;
+            }
+            s.adler = r.check = ye(d), d = 0, x = 0, r.mode = B;
+          /* falls through */
+          case B:
+            if (r.havedict === 0)
+              return s.next_out = k, s.avail_out = i, s.next_in = e, s.avail_in = S, r.hold = d, r.bits = x, w;
+            s.adler = r.check = 1, r.mode = U;
+          /* falls through */
+          case U:
+            if (A === g || A === v)
+              break e;
+          /* falls through */
+          case J:
+            if (r.last) {
+              d >>>= x & 7, x -= x & 7, r.mode = G;
+              break;
+            }
+            for (; x < 3; ) {
+              if (S === 0)
+                break e;
+              S--, d += D[e++] << x, x += 8;
+            }
+            switch (r.last = d & 1, d >>>= 1, x -= 1, d & 3) {
+              case 0:
+                r.mode = j;
+                break;
+              case 1:
+                if (Oe(r), r.mode = ue, A === v) {
+                  d >>>= 2, x -= 2;
+                  break e;
+                }
+                break;
+              case 2:
+                r.mode = re;
+                break;
+              case 3:
+                s.msg = "invalid block type", r.mode = ee;
+            }
+            d >>>= 2, x -= 2;
+            break;
+          case j:
+            for (d >>>= x & 7, x -= x & 7; x < 32; ) {
+              if (S === 0)
+                break e;
+              S--, d += D[e++] << x, x += 8;
+            }
+            if ((d & 65535) !== (d >>> 16 ^ 65535)) {
+              s.msg = "invalid stored block lengths", r.mode = ee;
+              break;
+            }
+            if (r.length = d & 65535, d = 0, x = 0, r.mode = q, A === v)
+              break e;
+          /* falls through */
+          case q:
+            r.mode = X;
+          /* falls through */
+          case X:
+            if (K = r.length, K) {
+              if (K > S && (K = S), K > i && (K = i), K === 0)
+                break e;
+              C.arraySet(Q, D, e, K, k), S -= K, e += K, i -= K, k += K, r.length -= K;
+              break;
+            }
+            r.mode = U;
+            break;
+          case re:
+            for (; x < 14; ) {
+              if (S === 0)
+                break e;
+              S--, d += D[e++] << x, x += 8;
+            }
+            if (r.nlen = (d & 31) + 257, d >>>= 5, x -= 5, r.ndist = (d & 31) + 1, d >>>= 5, x -= 5, r.ncode = (d & 15) + 4, d >>>= 4, x -= 4, r.nlen > 286 || r.ndist > 30) {
+              s.msg = "too many length or distance symbols", r.mode = ee;
+              break;
+            }
+            r.have = 0, r.mode = we;
+          /* falls through */
+          case we:
+            for (; r.have < r.ncode; ) {
+              for (; x < 3; ) {
+                if (S === 0)
+                  break e;
+                S--, d += D[e++] << x, x += 8;
+              }
+              r.lens[_a[r.have++]] = d & 7, d >>>= 3, x -= 3;
+            }
+            for (; r.have < 19; )
+              r.lens[_a[r.have++]] = 0;
+            if (r.lencode = r.lendyn, r.lenbits = 7, Me = { bits: r.lenbits }, De = P(a, r.lens, 0, 19, r.lencode, 0, r.work, Me), r.lenbits = Me.bits, De) {
+              s.msg = "invalid code lengths set", r.mode = ee;
+              break;
+            }
+            r.have = 0, r.mode = xe;
+          /* falls through */
+          case xe:
+            for (; r.have < r.nlen + r.ndist; ) {
+              for (; ve = r.lencode[d & (1 << r.lenbits) - 1], fe = ve >>> 24, ge = ve >>> 16 & 255, Ee = ve & 65535, !(fe <= x); ) {
+                if (S === 0)
+                  break e;
+                S--, d += D[e++] << x, x += 8;
+              }
+              if (Ee < 16)
+                d >>>= fe, x -= fe, r.lens[r.have++] = Ee;
+              else {
+                if (Ee === 16) {
+                  for (Be = fe + 2; x < Be; ) {
+                    if (S === 0)
+                      break e;
+                    S--, d += D[e++] << x, x += 8;
+                  }
+                  if (d >>>= fe, x -= fe, r.have === 0) {
+                    s.msg = "invalid bit length repeat", r.mode = ee;
+                    break;
+                  }
+                  se = r.lens[r.have - 1], K = 3 + (d & 3), d >>>= 2, x -= 2;
+                } else if (Ee === 17) {
+                  for (Be = fe + 3; x < Be; ) {
+                    if (S === 0)
+                      break e;
+                    S--, d += D[e++] << x, x += 8;
+                  }
+                  d >>>= fe, x -= fe, se = 0, K = 3 + (d & 7), d >>>= 3, x -= 3;
+                } else {
+                  for (Be = fe + 7; x < Be; ) {
+                    if (S === 0)
+                      break e;
+                    S--, d += D[e++] << x, x += 8;
+                  }
+                  d >>>= fe, x -= fe, se = 0, K = 11 + (d & 127), d >>>= 7, x -= 7;
+                }
+                if (r.have + K > r.nlen + r.ndist) {
+                  s.msg = "invalid bit length repeat", r.mode = ee;
+                  break;
+                }
+                for (; K--; )
+                  r.lens[r.have++] = se;
+              }
+            }
+            if (r.mode === ee)
+              break;
+            if (r.lens[256] === 0) {
+              s.msg = "invalid code -- missing end-of-block", r.mode = ee;
+              break;
+            }
+            if (r.lenbits = 9, Me = { bits: r.lenbits }, De = P(t, r.lens, 0, r.nlen, r.lencode, 0, r.work, Me), r.lenbits = Me.bits, De) {
+              s.msg = "invalid literal/lengths set", r.mode = ee;
+              break;
+            }
+            if (r.distbits = 6, r.distcode = r.distdyn, Me = { bits: r.distbits }, De = P(h, r.lens, r.nlen, r.ndist, r.distcode, 0, r.work, Me), r.distbits = Me.bits, De) {
+              s.msg = "invalid distances set", r.mode = ee;
+              break;
+            }
+            if (r.mode = ue, A === v)
+              break e;
+          /* falls through */
+          case ue:
+            r.mode = he;
+          /* falls through */
+          case he:
+            if (S >= 6 && i >= 258) {
+              s.next_out = k, s.avail_out = i, s.next_in = e, s.avail_in = S, r.hold = d, r.bits = x, b(s, H), k = s.next_out, Q = s.output, i = s.avail_out, e = s.next_in, D = s.input, S = s.avail_in, d = r.hold, x = r.bits, r.mode === U && (r.back = -1);
+              break;
+            }
+            for (r.back = 0; ve = r.lencode[d & (1 << r.lenbits) - 1], fe = ve >>> 24, ge = ve >>> 16 & 255, Ee = ve & 65535, !(fe <= x); ) {
+              if (S === 0)
+                break e;
+              S--, d += D[e++] << x, x += 8;
+            }
+            if (ge && (ge & 240) === 0) {
+              for (Te = fe, Je = ge, Qe = Ee; ve = r.lencode[Qe + ((d & (1 << Te + Je) - 1) >> Te)], fe = ve >>> 24, ge = ve >>> 16 & 255, Ee = ve & 65535, !(Te + fe <= x); ) {
+                if (S === 0)
+                  break e;
+                S--, d += D[e++] << x, x += 8;
+              }
+              d >>>= Te, x -= Te, r.back += Te;
+            }
+            if (d >>>= fe, x -= fe, r.back += fe, r.length = Ee, ge === 0) {
+              r.mode = ae;
+              break;
+            }
+            if (ge & 32) {
+              r.back = -1, r.mode = U;
+              break;
+            }
+            if (ge & 64) {
+              s.msg = "invalid literal/length code", r.mode = ee;
+              break;
+            }
+            r.extra = ge & 15, r.mode = de;
+          /* falls through */
+          case de:
+            if (r.extra) {
+              for (Be = r.extra; x < Be; ) {
+                if (S === 0)
+                  break e;
+                S--, d += D[e++] << x, x += 8;
+              }
+              r.length += d & (1 << r.extra) - 1, d >>>= r.extra, x -= r.extra, r.back += r.extra;
+            }
+            r.was = r.length, r.mode = _e;
+          /* falls through */
+          case _e:
+            for (; ve = r.distcode[d & (1 << r.distbits) - 1], fe = ve >>> 24, ge = ve >>> 16 & 255, Ee = ve & 65535, !(fe <= x); ) {
+              if (S === 0)
+                break e;
+              S--, d += D[e++] << x, x += 8;
+            }
+            if ((ge & 240) === 0) {
+              for (Te = fe, Je = ge, Qe = Ee; ve = r.distcode[Qe + ((d & (1 << Te + Je) - 1) >> Te)], fe = ve >>> 24, ge = ve >>> 16 & 255, Ee = ve & 65535, !(Te + fe <= x); ) {
+                if (S === 0)
+                  break e;
+                S--, d += D[e++] << x, x += 8;
+              }
+              d >>>= Te, x -= Te, r.back += Te;
+            }
+            if (d >>>= fe, x -= fe, r.back += fe, ge & 64) {
+              s.msg = "invalid distance code", r.mode = ee;
+              break;
+            }
+            r.offset = Ee, r.extra = ge & 15, r.mode = ie;
+          /* falls through */
+          case ie:
+            if (r.extra) {
+              for (Be = r.extra; x < Be; ) {
+                if (S === 0)
+                  break e;
+                S--, d += D[e++] << x, x += 8;
+              }
+              r.offset += d & (1 << r.extra) - 1, d >>>= r.extra, x -= r.extra, r.back += r.extra;
+            }
+            if (r.offset > r.dmax) {
+              s.msg = "invalid distance too far back", r.mode = ee;
+              break;
+            }
+            r.mode = le;
+          /* falls through */
+          case le:
+            if (i === 0)
+              break e;
+            if (K = H - i, r.offset > K) {
+              if (K = r.offset - K, K > r.whave && r.sane) {
+                s.msg = "invalid distance too far back", r.mode = ee;
+                break;
+              }
+              K > r.wnext ? (K -= r.wnext, ne = r.wsize - K) : ne = r.wnext - K, K > r.length && (K = r.length), Le = r.window;
+            } else
+              Le = Q, ne = k - r.offset, K = r.length;
+            K > i && (K = i), i -= K, r.length -= K;
+            do
+              Q[k++] = Le[ne++];
+            while (--K);
+            r.length === 0 && (r.mode = he);
+            break;
+          case ae:
+            if (i === 0)
+              break e;
+            Q[k++] = r.length, i--, r.mode = he;
+            break;
+          case G:
+            if (r.wrap) {
+              for (; x < 32; ) {
+                if (S === 0)
+                  break e;
+                S--, d |= D[e++] << x, x += 8;
+              }
+              if (H -= i, s.total_out += H, r.total += H, H && (s.adler = r.check = /*UPDATE(state.check, put - _out, _out);*/
+              r.flags ? V(r.check, Q, H, k - H) : W(r.check, Q, H, k - H)), H = i, (r.flags ? d : ye(d)) !== r.check) {
+                s.msg = "incorrect data check", r.mode = ee;
+                break;
+              }
+              d = 0, x = 0;
+            }
+            r.mode = Se;
+          /* falls through */
+          case Se:
+            if (r.wrap && r.flags) {
+              for (; x < 32; ) {
+                if (S === 0)
+                  break e;
+                S--, d += D[e++] << x, x += 8;
+              }
+              if (d !== (r.total & 4294967295)) {
+                s.msg = "incorrect length check", r.mode = ee;
+                break;
+              }
+              d = 0, x = 0;
+            }
+            r.mode = Ae;
+          /* falls through */
+          case Ae:
+            De = u;
+            break e;
+          case ee:
+            De = T;
+            break e;
+          case ce:
+            return z;
+          case Re:
+          /* falls through */
+          default:
+            return l;
+        }
+    return s.next_out = k, s.avail_out = i, s.next_in = e, s.avail_in = S, r.hold = d, r.bits = x, (r.wsize || H !== s.avail_out && r.mode < ee && (r.mode < G || A !== n)) && $e(s, s.output, s.next_out, H - s.avail_out), $ -= s.avail_in, H -= s.avail_out, s.total_in += $, s.total_out += H, r.total += H, r.wrap && H && (s.adler = r.check = /*UPDATE(state.check, strm.next_out - _out, _out);*/
+    r.flags ? V(r.check, Q, H, s.next_out - H) : W(r.check, Q, H, s.next_out - H)), s.data_type = r.bits + (r.last ? 64 : 0) + (r.mode === U ? 128 : 0) + (r.mode === ue || r.mode === q ? 256 : 0), ($ === 0 && H === 0 || A === n) && De === o && (De = _), De;
+  }
+  function y(s) {
+    if (!s || !s.state)
+      return l;
+    var A = s.state;
+    return A.window && (A.window = null), s.state = null, o;
+  }
+  function O(s, A) {
+    var r;
+    return !s || !s.state || (r = s.state, (r.wrap & 2) === 0) ? l : (r.head = A, A.done = !1, o);
+  }
+  function Y(s, A) {
+    var r = A.length, D, Q, e;
+    return !s || !s.state || (D = s.state, D.wrap !== 0 && D.mode !== B) ? l : D.mode === B && (Q = 1, Q = W(Q, A, r, 0), Q !== D.check) ? T : (e = $e(s, A, r, r), e ? (D.mode = ce, z) : (D.havedict = 1, o));
+  }
+  return Ze.inflateReset = Ie, Ze.inflateReset2 = Xe, Ze.inflateResetKeep = He, Ze.inflateInit = me, Ze.inflateInit2 = Fe, Ze.inflate = f, Ze.inflateEnd = y, Ze.inflateGetHeader = O, Ze.inflateSetDictionary = Y, Ze.inflateInfo = "pako inflate (from Nodeca project)", Ze;
+}
+var fa, Sa;
+function ma() {
+  return Sa || (Sa = 1, fa = {
+    /* 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
+  }), fa;
+}
+var la, Aa;
+function Ka() {
+  if (Aa) return la;
+  Aa = 1;
+  function C() {
+    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 la = C, la;
+}
+var za;
+function Ya() {
+  if (za) return Ve;
+  za = 1;
+  var C = Ua(), W = Ne(), V = Da(), b = ma(), P = ha(), a = Za(), t = Ka(), h = Object.prototype.toString;
+  function n(o) {
+    if (!(this instanceof n)) return new n(o);
+    this.options = W.assign({
+      chunkSize: 16384,
+      windowBits: 0,
+      to: ""
+    }, o || {});
+    var u = this.options;
+    u.raw && u.windowBits >= 0 && u.windowBits < 16 && (u.windowBits = -u.windowBits, u.windowBits === 0 && (u.windowBits = -15)), u.windowBits >= 0 && u.windowBits < 16 && !(o && o.windowBits) && (u.windowBits += 32), u.windowBits > 15 && u.windowBits < 48 && (u.windowBits & 15) === 0 && (u.windowBits |= 15), this.err = 0, this.msg = "", this.ended = !1, this.chunks = [], this.strm = new a(), this.strm.avail_out = 0;
+    var w = C.inflateInit2(
+      this.strm,
+      u.windowBits
+    );
+    if (w !== b.Z_OK)
+      throw new Error(P[w]);
+    if (this.header = new t(), C.inflateGetHeader(this.strm, this.header), u.dictionary && (typeof u.dictionary == "string" ? u.dictionary = V.string2buf(u.dictionary) : h.call(u.dictionary) === "[object ArrayBuffer]" && (u.dictionary = new Uint8Array(u.dictionary)), u.raw && (w = C.inflateSetDictionary(this.strm, u.dictionary), w !== b.Z_OK)))
+      throw new Error(P[w]);
+  }
+  n.prototype.push = function(o, u) {
+    var w = this.strm, l = this.options.chunkSize, T = this.options.dictionary, z, _, c, E, R, Z = !1;
+    if (this.ended)
+      return !1;
+    _ = u === ~~u ? u : u === !0 ? b.Z_FINISH : b.Z_NO_FLUSH, typeof o == "string" ? w.input = V.binstring2buf(o) : h.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 W.Buf8(l), w.next_out = 0, w.avail_out = l), z = C.inflate(w, b.Z_NO_FLUSH), z === b.Z_NEED_DICT && T && (z = C.inflateSetDictionary(this.strm, T)), z === b.Z_BUF_ERROR && Z === !0 && (z = b.Z_OK, Z = !1), z !== b.Z_STREAM_END && z !== b.Z_OK)
+        return this.onEnd(z), this.ended = !0, !1;
+      w.next_out && (w.avail_out === 0 || z === b.Z_STREAM_END || w.avail_in === 0 && (_ === b.Z_FINISH || _ === b.Z_SYNC_FLUSH)) && (this.options.to === "string" ? (c = V.utf8border(w.output, w.next_out), E = w.next_out - c, R = V.buf2string(w.output, c), w.next_out = E, w.avail_out = l - E, E && W.arraySet(w.output, w.output, c, E, 0), this.onData(R)) : this.onData(W.shrinkBuf(w.output, w.next_out))), w.avail_in === 0 && w.avail_out === 0 && (Z = !0);
+    } while ((w.avail_in > 0 || w.avail_out === 0) && z !== b.Z_STREAM_END);
+    return z === b.Z_STREAM_END && (_ = b.Z_FINISH), _ === b.Z_FINISH ? (z = C.inflateEnd(this.strm), this.onEnd(z), this.ended = !0, z === b.Z_OK) : (_ === b.Z_SYNC_FLUSH && (this.onEnd(b.Z_OK), w.avail_out = 0), !0);
+  }, n.prototype.onData = function(o) {
+    this.chunks.push(o);
+  }, n.prototype.onEnd = function(o) {
+    o === b.Z_OK && (this.options.to === "string" ? this.result = this.chunks.join("") : this.result = W.flattenChunks(this.chunks)), this.chunks = [], this.err = o, this.msg = this.strm.msg;
+  };
+  function g(o, u) {
+    var w = new n(u);
+    if (w.push(o, !0), w.err)
+      throw w.msg || P[w.err];
+    return w.result;
+  }
+  function v(o, u) {
+    return u = u || {}, u.raw = !0, g(o, u);
+  }
+  return Ve.Inflate = n, Ve.inflate = g, Ve.inflateRaw = v, Ve.ungzip = g, Ve;
+}
+var oa, Ta;
+function Xa() {
+  if (Ta) return oa;
+  Ta = 1;
+  var C = Ne().assign, W = Fa(), V = Ya(), b = ma(), P = {};
+  return C(P, W, V, b), oa = P, oa;
+}
+var Ra;
+function ja() {
+  return Ra || (Ra = 1, (function(C) {
+    (function() {
+      var W = {}, V;
+      C.exports = W, typeof La == "function" ? V = Xa() : V = window.pako, (function(b, P) {
+        b.toRGBA8 = function(a) {
+          var t = a.width, h = a.height;
+          if (a.tabs.acTL == null) return [b.toRGBA8.decodeImage(a.data, t, h, a).buffer];
+          var n = [];
+          a.frames[0].data == null && (a.frames[0].data = a.data);
+          for (var g, v = new Uint8Array(t * h * 4), o = 0; o < a.frames.length; o++) {
+            var u = a.frames[o], w = u.rect.x, l = u.rect.y, T = u.rect.width, z = u.rect.height, _ = b.toRGBA8.decodeImage(u.data, T, z, a);
+            if (o == 0 ? g = _ : u.blend == 0 ? b._copyTile(_, T, z, g, t, h, w, l, 0) : u.blend == 1 && b._copyTile(_, T, z, g, t, h, w, l, 1), n.push(g.buffer), g = g.slice(0), u.dispose != 0) {
+              if (u.dispose == 1) b._copyTile(v, T, z, g, t, h, w, l, 0);
+              else if (u.dispose == 2) {
+                for (var c = o - 1; a.frames[c].dispose == 2; ) c--;
+                g = new Uint8Array(n[c]).slice(0);
+              }
+            }
+          }
+          return n;
+        }, b.toRGBA8.decodeImage = function(a, t, h, n) {
+          var g = t * h, v = b.decode._getBPP(n), o = Math.ceil(t * v / 8), u = new Uint8Array(g * 4), w = new Uint32Array(u.buffer), l = n.ctype, T = n.depth, z = b._bin.readUshort;
+          if (l == 6) {
+            var _ = g << 2;
+            if (T == 8) for (var c = 0; c < _; c++)
+              u[c] = a[c];
+            if (T == 16) for (var c = 0; c < _; c++)
+              u[c] = a[c << 1];
+          } else if (l == 2) {
+            var E = n.tabs.tRNS, R = -1, Z = -1, m = -1;
+            if (E && (R = E[0], Z = E[1], m = E[2]), T == 8) for (var c = 0; c < g; c++) {
+              var p = c << 2, I = c * 3;
+              u[p] = a[I], u[p + 1] = a[I + 1], u[p + 2] = a[I + 2], u[p + 3] = 255, R != -1 && a[I] == R && a[I + 1] == Z && a[I + 2] == m && (u[p + 3] = 0);
+            }
+            if (T == 16) for (var c = 0; c < g; c++) {
+              var p = c << 2, I = c * 6;
+              u[p] = a[I], u[p + 1] = a[I + 2], u[p + 2] = a[I + 4], u[p + 3] = 255, R != -1 && z(a, I) == R && z(a, I + 2) == Z && z(a, I + 4) == m && (u[p + 3] = 0);
+            }
+          } else if (l == 3) {
+            var N = n.tabs.PLTE, F = n.tabs.tRNS, L = F ? F.length : 0;
+            if (T == 1) for (var M = 0; M < h; M++)
+              for (var B = M * o, U = M * t, c = 0; c < t; c++) {
+                var p = U + c << 2, J = a[B + (c >> 3)] >> 7 - ((c & 7) << 0) & 1, j = 3 * J;
+                u[p] = N[j], u[p + 1] = N[j + 1], u[p + 2] = N[j + 2], u[p + 3] = J < L ? F[J] : 255;
+              }
+            if (T == 2) for (var M = 0; M < h; M++)
+              for (var B = M * o, U = M * t, c = 0; c < t; c++) {
+                var p = U + c << 2, J = a[B + (c >> 2)] >> 6 - ((c & 3) << 1) & 3, j = 3 * J;
+                u[p] = N[j], u[p + 1] = N[j + 1], u[p + 2] = N[j + 2], u[p + 3] = J < L ? F[J] : 255;
+              }
+            if (T == 4) for (var M = 0; M < h; M++)
+              for (var B = M * o, U = M * t, c = 0; c < t; c++) {
+                var p = U + c << 2, J = a[B + (c >> 1)] >> 4 - ((c & 1) << 2) & 15, j = 3 * J;
+                u[p] = N[j], u[p + 1] = N[j + 1], u[p + 2] = N[j + 2], u[p + 3] = J < L ? F[J] : 255;
+              }
+            if (T == 8) for (var c = 0; c < g; c++) {
+              var p = c << 2, J = a[c], j = 3 * J;
+              u[p] = N[j], u[p + 1] = N[j + 1], u[p + 2] = N[j + 2], u[p + 3] = J < L ? F[J] : 255;
+            }
+          } else if (l == 4) {
+            if (T == 8) for (var c = 0; c < g; c++) {
+              var p = c << 2, q = c << 1, X = a[q];
+              u[p] = X, u[p + 1] = X, u[p + 2] = X, u[p + 3] = a[q + 1];
+            }
+            if (T == 16) for (var c = 0; c < g; c++) {
+              var p = c << 2, q = c << 2, X = a[q];
+              u[p] = X, u[p + 1] = X, u[p + 2] = X, u[p + 3] = a[q + 2];
+            }
+          } else if (l == 0) {
+            var R = n.tabs.tRNS ? n.tabs.tRNS : -1;
+            if (T == 1) for (var c = 0; c < g; c++) {
+              var X = 255 * (a[c >> 3] >> 7 - (c & 7) & 1), re = X == R * 255 ? 0 : 255;
+              w[c] = re << 24 | X << 16 | X << 8 | X;
+            }
+            if (T == 2) for (var c = 0; c < g; c++) {
+              var X = 85 * (a[c >> 2] >> 6 - ((c & 3) << 1) & 3), re = X == R * 85 ? 0 : 255;
+              w[c] = re << 24 | X << 16 | X << 8 | X;
+            }
+            if (T == 4) for (var c = 0; c < g; c++) {
+              var X = 17 * (a[c >> 1] >> 4 - ((c & 1) << 2) & 15), re = X == R * 17 ? 0 : 255;
+              w[c] = re << 24 | X << 16 | X << 8 | X;
+            }
+            if (T == 8) for (var c = 0; c < g; c++) {
+              var X = a[c], re = X == R ? 0 : 255;
+              w[c] = re << 24 | X << 16 | X << 8 | X;
+            }
+            if (T == 16) for (var c = 0; c < g; c++) {
+              var X = a[c << 1], re = z(a, c << 1) == R ? 0 : 255;
+              w[c] = re << 24 | X << 16 | X << 8 | X;
+            }
+          }
+          return u;
+        }, b.decode = function(a) {
+          for (var t = new Uint8Array(a), h = 8, n = b._bin, g = n.readUshort, v = n.readUint, o = { tabs: {}, frames: [] }, u = new Uint8Array(t.length), w = 0, l, T = 0, z = [137, 80, 78, 71, 13, 10, 26, 10], _ = 0; _ < 8; _++) if (t[_] != z[_]) throw "The input is not a PNG file!";
+          for (; h < t.length; ) {
+            var c = n.readUint(t, h);
+            h += 4;
+            var E = n.readASCII(t, h, 4);
+            if (h += 4, E == "IHDR")
+              b.decode._IHDR(t, h, o);
+            else if (E == "IDAT") {
+              for (var _ = 0; _ < c; _++) u[w + _] = t[h + _];
+              w += c;
+            } else if (E == "acTL")
+              o.tabs[E] = { num_frames: v(t, h), num_plays: v(t, h + 4) }, l = new Uint8Array(t.length);
+            else if (E == "fcTL") {
+              if (T != 0) {
+                var R = o.frames[o.frames.length - 1];
+                R.data = b.decode._decompress(o, l.slice(0, T), R.rect.width, R.rect.height), T = 0;
+              }
+              var Z = { x: v(t, h + 12), y: v(t, h + 16), width: v(t, h + 4), height: v(t, h + 8) }, m = g(t, h + 22);
+              m = g(t, h + 20) / (m == 0 ? 100 : m);
+              var p = { rect: Z, delay: Math.round(m * 1e3), dispose: t[h + 24], blend: t[h + 25] };
+              o.frames.push(p);
+            } else if (E == "fdAT") {
+              for (var _ = 0; _ < c - 4; _++) l[T + _] = t[h + _ + 4];
+              T += c - 4;
+            } else if (E == "pHYs")
+              o.tabs[E] = [n.readUint(t, h), n.readUint(t, h + 4), t[h + 8]];
+            else if (E == "cHRM") {
+              o.tabs[E] = [];
+              for (var _ = 0; _ < 8; _++) o.tabs[E].push(n.readUint(t, h + _ * 4));
+            } else if (E == "tEXt") {
+              o.tabs[E] == null && (o.tabs[E] = {});
+              var I = n.nextZero(t, h), N = n.readASCII(t, h, I - h), F = n.readASCII(t, I + 1, h + c - I - 1);
+              o.tabs[E][N] = F;
+            } else if (E == "iTXt") {
+              o.tabs[E] == null && (o.tabs[E] = {});
+              var I = 0, L = h;
+              I = n.nextZero(t, L);
+              var N = n.readASCII(t, L, I - L);
+              L = I + 1, t[L], t[L + 1], L += 2, I = n.nextZero(t, L), n.readASCII(t, L, I - L), L = I + 1, I = n.nextZero(t, L), n.readUTF8(t, L, I - L), L = I + 1;
+              var F = n.readUTF8(t, L, c - (L - h));
+              o.tabs[E][N] = F;
+            } else if (E == "PLTE")
+              o.tabs[E] = n.readBytes(t, h, c);
+            else if (E == "hIST") {
+              var M = o.tabs.PLTE.length / 3;
+              o.tabs[E] = [];
+              for (var _ = 0; _ < M; _++) o.tabs[E].push(g(t, h + _ * 2));
+            } else if (E == "tRNS")
+              o.ctype == 3 ? o.tabs[E] = n.readBytes(t, h, c) : o.ctype == 0 ? o.tabs[E] = g(t, h) : o.ctype == 2 && (o.tabs[E] = [g(t, h), g(t, h + 2), g(t, h + 4)]);
+            else if (E == "gAMA") o.tabs[E] = n.readUint(t, h) / 1e5;
+            else if (E == "sRGB") o.tabs[E] = t[h];
+            else if (E == "bKGD")
+              o.ctype == 0 || o.ctype == 4 ? o.tabs[E] = [g(t, h)] : o.ctype == 2 || o.ctype == 6 ? o.tabs[E] = [g(t, h), g(t, h + 2), g(t, h + 4)] : o.ctype == 3 && (o.tabs[E] = t[h]);
+            else if (E == "IEND") {
+              if (T != 0) {
+                var R = o.frames[o.frames.length - 1];
+                R.data = b.decode._decompress(o, l.slice(0, T), R.rect.width, R.rect.height), T = 0;
+              }
+              o.data = b.decode._decompress(o, u, o.width, o.height);
+              break;
+            }
+            h += c, n.readUint(t, h), h += 4;
+          }
+          return delete o.compress, delete o.interlace, delete o.filter, o;
+        }, b.decode._decompress = function(a, t, h, n) {
+          return a.compress == 0 && (t = b.decode._inflate(t)), a.interlace == 0 ? t = b.decode._filterZero(t, a, 0, h, n) : a.interlace == 1 && (t = b.decode._readInterlace(t, a)), t;
+        }, b.decode._inflate = function(a) {
+          return P.inflate(a);
+        }, b.decode._readInterlace = function(a, t) {
+          for (var h = t.width, n = t.height, g = b.decode._getBPP(t), v = g >> 3, o = Math.ceil(h * g / 8), u = new Uint8Array(n * o), w = 0, l = [0, 0, 4, 0, 2, 0, 1], T = [0, 4, 0, 2, 0, 1, 0], z = [8, 8, 8, 4, 4, 2, 2], _ = [8, 8, 4, 4, 2, 2, 1], c = 0; c < 7; ) {
+            for (var E = z[c], R = _[c], Z = 0, m = 0, p = l[c]; p < n; )
+              p += E, m++;
+            for (var I = T[c]; I < h; )
+              I += R, Z++;
+            var N = Math.ceil(Z * g / 8);
+            b.decode._filterZero(a, t, w, Z, m);
+            for (var F = 0, L = l[c]; L < n; ) {
+              for (var M = T[c], B = w + F * N << 3; M < h; ) {
+                if (g == 1) {
+                  var U = a[B >> 3];
+                  U = U >> 7 - (B & 7) & 1, u[L * o + (M >> 3)] |= U << 7 - ((M & 3) << 0);
+                }
+                if (g == 2) {
+                  var U = a[B >> 3];
+                  U = U >> 6 - (B & 7) & 3, u[L * o + (M >> 2)] |= U << 6 - ((M & 3) << 1);
+                }
+                if (g == 4) {
+                  var U = a[B >> 3];
+                  U = U >> 4 - (B & 7) & 15, u[L * o + (M >> 1)] |= U << 4 - ((M & 1) << 2);
+                }
+                if (g >= 8)
+                  for (var J = L * o + M * v, j = 0; j < v; j++) u[J + j] = a[(B >> 3) + j];
+                B += g, M += R;
+              }
+              F++, L += E;
+            }
+            Z * m != 0 && (w += m * (1 + N)), c = c + 1;
+          }
+          return u;
+        }, b.decode._getBPP = function(a) {
+          var t = [1, null, 3, 1, 2, null, 4][a.ctype];
+          return t * a.depth;
+        }, b.decode._filterZero = function(a, t, h, n, g) {
+          var v = b.decode._getBPP(t), o = Math.ceil(n * v / 8), u = b.decode._paeth;
+          v = Math.ceil(v / 8);
+          for (var w = 0; w < g; w++) {
+            var l = h + w * o, T = l + w + 1, z = a[T - 1];
+            if (z == 0) for (var _ = 0; _ < o; _++) a[l + _] = a[T + _];
+            else if (z == 1) {
+              for (var _ = 0; _ < v; _++) a[l + _] = a[T + _];
+              for (var _ = v; _ < o; _++) a[l + _] = a[T + _] + a[l + _ - v] & 255;
+            } else if (w == 0) {
+              for (var _ = 0; _ < v; _++) a[l + _] = a[T + _];
+              if (z == 2) for (var _ = v; _ < o; _++) a[l + _] = a[T + _] & 255;
+              if (z == 3) for (var _ = v; _ < o; _++) a[l + _] = a[T + _] + (a[l + _ - v] >> 1) & 255;
+              if (z == 4) for (var _ = v; _ < o; _++) a[l + _] = a[T + _] + u(a[l + _ - v], 0, 0) & 255;
+            } else {
+              if (z == 2)
+                for (var _ = 0; _ < o; _++) a[l + _] = a[T + _] + a[l + _ - o] & 255;
+              if (z == 3) {
+                for (var _ = 0; _ < v; _++) a[l + _] = a[T + _] + (a[l + _ - o] >> 1) & 255;
+                for (var _ = v; _ < o; _++) a[l + _] = a[T + _] + (a[l + _ - o] + a[l + _ - v] >> 1) & 255;
+              }
+              if (z == 4) {
+                for (var _ = 0; _ < v; _++) a[l + _] = a[T + _] + u(0, a[l + _ - o], 0) & 255;
+                for (var _ = v; _ < o; _++) a[l + _] = a[T + _] + u(a[l + _ - v], a[l + _ - o], a[l + _ - v - o]) & 255;
+              }
+            }
+          }
+          return a;
+        }, b.decode._paeth = function(a, t, h) {
+          var n = a + t - h, g = Math.abs(n - a), v = Math.abs(n - t), o = Math.abs(n - h);
+          return g <= v && g <= o ? a : v <= o ? t : h;
+        }, b.decode._IHDR = function(a, t, h) {
+          var n = b._bin;
+          h.width = n.readUint(a, t), t += 4, h.height = n.readUint(a, t), t += 4, h.depth = a[t], t++, h.ctype = a[t], t++, h.compress = a[t], t++, h.filter = a[t], t++, h.interlace = a[t], t++;
+        }, b._bin = {
+          nextZero: function(a, t) {
+            for (; a[t] != 0; ) t++;
+            return t;
+          },
+          readUshort: function(a, t) {
+            return a[t] << 8 | a[t + 1];
+          },
+          writeUshort: function(a, t, h) {
+            a[t] = h >> 8 & 255, a[t + 1] = h & 255;
+          },
+          readUint: function(a, t) {
+            return a[t] * (256 * 256 * 256) + (a[t + 1] << 16 | a[t + 2] << 8 | a[t + 3]);
+          },
+          writeUint: function(a, t, h) {
+            a[t] = h >> 24 & 255, a[t + 1] = h >> 16 & 255, a[t + 2] = h >> 8 & 255, a[t + 3] = h & 255;
+          },
+          readASCII: function(a, t, h) {
+            for (var n = "", g = 0; g < h; g++) n += String.fromCharCode(a[t + g]);
+            return n;
+          },
+          writeASCII: function(a, t, h) {
+            for (var n = 0; n < h.length; n++) a[t + n] = h.charCodeAt(n);
+          },
+          readBytes: function(a, t, h) {
+            for (var n = [], g = 0; g < h; g++) n.push(a[t + g]);
+            return n;
+          },
+          pad: function(a) {
+            return a.length < 2 ? "0" + a : a;
+          },
+          readUTF8: function(a, t, h) {
+            for (var n = "", g, v = 0; v < h; v++) n += "%" + b._bin.pad(a[t + v].toString(16));
+            try {
+              g = decodeURIComponent(n);
+            } catch {
+              return b._bin.readASCII(a, t, h);
+            }
+            return g;
+          }
+        }, b._copyTile = function(a, t, h, n, g, v, o, u, w) {
+          for (var l = Math.min(t, g), T = Math.min(h, v), z = 0, _ = 0, c = 0; c < T; c++)
+            for (var E = 0; E < l; E++)
+              if (o >= 0 && u >= 0 ? (z = c * t + E << 2, _ = (u + c) * g + o + E << 2) : (z = (-u + c) * t - o + E << 2, _ = c * g + E << 2), w == 0)
+                n[_] = a[z], n[_ + 1] = a[z + 1], n[_ + 2] = a[z + 2], n[_ + 3] = a[z + 3];
+              else if (w == 1) {
+                var R = a[z + 3] * 0.00392156862745098, Z = a[z] * R, m = a[z + 1] * R, p = a[z + 2] * R, I = n[_ + 3] * (1 / 255), N = n[_] * I, F = n[_ + 1] * I, L = n[_ + 2] * I, M = 1 - R, B = R + I * M, U = B == 0 ? 0 : 1 / B;
+                n[_ + 3] = 255 * B, n[_ + 0] = (Z + N * M) * U, n[_ + 1] = (m + F * M) * U, n[_ + 2] = (p + L * M) * U;
+              } else if (w == 2) {
+                var R = a[z + 3], Z = a[z], m = a[z + 1], p = a[z + 2], I = n[_ + 3], N = n[_], F = n[_ + 1], L = n[_ + 2];
+                R == I && Z == N && m == F && p == L ? (n[_] = 0, n[_ + 1] = 0, n[_ + 2] = 0, n[_ + 3] = 0) : (n[_] = Z, n[_ + 1] = m, n[_ + 2] = p, n[_ + 3] = R);
+              } else if (w == 3) {
+                var R = a[z + 3], Z = a[z], m = a[z + 1], p = a[z + 2], I = n[_ + 3], N = n[_], F = n[_ + 1], L = n[_ + 2];
+                if (R == I && Z == N && m == F && p == L) continue;
+                if (R < 220 && I > 20) return !1;
+              }
+          return !0;
+        }, b.encode = function(a, t, h, n, g, v) {
+          n == null && (n = 0), v == null && (v = !1);
+          for (var o = new Uint8Array(a[0].byteLength * a.length + 100), u = [137, 80, 78, 71, 13, 10, 26, 10], w = 0; w < 8; w++) o[w] = u[w];
+          var l = 8, T = b._bin, z = b.crc.crc, _ = T.writeUint, c = T.writeUshort, E = T.writeASCII, R = b.encode.compressPNG(a, t, h, n, v);
+          _(o, l, 13), l += 4, E(o, l, "IHDR"), l += 4, _(o, l, t), l += 4, _(o, l, h), l += 4, o[l] = R.depth, l++, o[l] = R.ctype, l++, o[l] = 0, l++, o[l] = 0, l++, o[l] = 0, l++, _(o, l, z(o, l - 17, 17)), l += 4, _(o, l, 1), l += 4, E(o, l, "sRGB"), l += 4, o[l] = 1, l++, _(o, l, z(o, l - 5, 5)), l += 4;
+          var Z = a.length > 1;
+          if (Z && (_(o, l, 8), l += 4, E(o, l, "acTL"), l += 4, _(o, l, a.length), l += 4, _(o, l, 0), l += 4, _(o, l, z(o, l - 12, 12)), l += 4), R.ctype == 3) {
+            var m = R.plte.length;
+            _(o, l, m * 3), l += 4, E(o, l, "PLTE"), l += 4;
+            for (var w = 0; w < m; w++) {
+              var p = w * 3, I = R.plte[w], N = I & 255, F = I >> 8 & 255, L = I >> 16 & 255;
+              o[l + p + 0] = N, o[l + p + 1] = F, o[l + p + 2] = L;
+            }
+            if (l += m * 3, _(o, l, z(o, l - m * 3 - 4, m * 3 + 4)), l += 4, R.gotAlpha) {
+              _(o, l, m), l += 4, E(o, l, "tRNS"), l += 4;
+              for (var w = 0; w < m; w++) o[l + w] = R.plte[w] >> 24 & 255;
+              l += m, _(o, l, z(o, l - m - 4, m + 4)), l += 4;
+            }
+          }
+          for (var M = 0, B = 0; B < R.frames.length; B++) {
+            var U = R.frames[B];
+            Z && (_(o, l, 26), l += 4, E(o, l, "fcTL"), l += 4, _(o, l, M++), l += 4, _(o, l, U.rect.width), l += 4, _(o, l, U.rect.height), l += 4, _(o, l, U.rect.x), l += 4, _(o, l, U.rect.y), l += 4, c(o, l, g[B]), l += 2, c(o, l, 1e3), l += 2, o[l] = U.dispose, l++, o[l] = U.blend, l++, _(o, l, z(o, l - 30, 30)), l += 4);
+            var J = U.cimg, m = J.length;
+            _(o, l, m + (B == 0 ? 0 : 4)), l += 4;
+            var j = l;
+            E(o, l, B == 0 ? "IDAT" : "fdAT"), l += 4, B != 0 && (_(o, l, M++), l += 4);
+            for (var w = 0; w < m; w++) o[l + w] = J[w];
+            l += m, _(o, l, z(o, j, l - j)), l += 4;
+          }
+          return _(o, l, 0), l += 4, E(o, l, "IEND"), l += 4, _(o, l, z(o, l - 4, 4)), l += 4, o.buffer.slice(0, l);
+        }, b.encode.compressPNG = function(a, t, h, n, g) {
+          for (var v = b.encode.compress(a, t, h, n, !1, g), o = 0; o < a.length; o++) {
+            var u = v.frames[o];
+            u.rect.width;
+            var w = u.rect.height, l = u.bpl, T = u.bpp, z = new Uint8Array(w * l + w);
+            u.cimg = b.encode._filterZero(u.img, w, T, l, z);
+          }
+          return v;
+        }, b.encode.compress = function(a, t, h, n, g, v) {
+          v == null && (v = !1);
+          for (var o = 6, u = 8, w = 4, l = 255, T = 0; T < a.length; T++)
+            for (var z = new Uint8Array(a[T]), _ = z.length, c = 0; c < _; c += 4) l &= z[c + 3];
+          var E = l != 255, R = {}, Z = [];
+          if (a.length != 0 && (R[0] = 0, Z.push(0), n != 0 && n--), n != 0) {
+            var m = b.quantize(a, n, g);
+            a = m.bufs;
+            for (var c = 0; c < m.plte.length; c++) {
+              var p = m.plte[c].est.rgba;
+              R[p] == null && (R[p] = Z.length, Z.push(p));
+            }
+          } else
+            for (var T = 0; T < a.length; T++)
+              for (var I = new Uint32Array(a[T]), _ = I.length, c = 0; c < _; c++) {
+                var p = I[c];
+                if ((c < t || p != I[c - 1] && p != I[c - t]) && R[p] == null && (R[p] = Z.length, Z.push(p), Z.length >= 300))
+                  break;
+              }
+          var N = E ? g : !1, F = Z.length;
+          F <= 256 && v == !1 && (F <= 2 ? u = 1 : F <= 4 ? u = 2 : F <= 16 ? u = 4 : u = 8, g && (u = 8), E = !0);
+          for (var L = [], T = 0; T < a.length; T++) {
+            var M = new Uint8Array(a[T]), B = new Uint32Array(M.buffer), U = 0, J = 0, j = t, q = h, X = 0;
+            if (T != 0 && !N) {
+              for (var re = g || T == 1 || L[L.length - 2].dispose == 2 ? 1 : 2, we = 0, xe = 1e9, ue = 0; ue < re; ue++) {
+                for (var Ae = new Uint8Array(a[T - 1 - ue]), he = new Uint32Array(a[T - 1 - ue]), de = t, _e = h, ie = -1, le = -1, ae = 0; ae < h; ae++) for (var G = 0; G < t; G++) {
+                  var c = ae * t + G;
+                  B[c] != he[c] && (G < de && (de = G), G > ie && (ie = G), ae < _e && (_e = ae), ae > le && (le = ae));
+                }
+                var Se = ie == -1 ? 1 : (ie - de + 1) * (le - _e + 1);
+                Se < xe && (xe = Se, we = ue, ie == -1 ? (U = J = 0, j = q = 1) : (U = de, J = _e, j = ie - de + 1, q = le - _e + 1));
+              }
+              var Ae = new Uint8Array(a[T - 1 - we]);
+              we == 1 && (L[L.length - 1].dispose = 2);
+              var ee = new Uint8Array(j * q * 4);
+              new Uint32Array(ee.buffer), b._copyTile(Ae, t, h, ee, j, q, -U, -J, 0), b._copyTile(M, t, h, ee, j, q, -U, -J, 3) ? (b._copyTile(M, t, h, ee, j, q, -U, -J, 2), X = 1) : (b._copyTile(M, t, h, ee, j, q, -U, -J, 0), X = 0), M = ee, B = new Uint32Array(M.buffer);
+            }
+            var ce = 4 * j;
+            if (F <= 256 && v == !1) {
+              ce = Math.ceil(u * j / 8);
+              for (var ee = new Uint8Array(ce * q), ae = 0; ae < q; ae++) {
+                var c = ae * ce, Re = ae * j;
+                if (u == 8) for (var G = 0; G < j; G++) ee[c + G] = R[B[Re + G]];
+                else if (u == 4) for (var G = 0; G < j; G++) ee[c + (G >> 1)] |= R[B[Re + G]] << 4 - (G & 1) * 4;
+                else if (u == 2) for (var G = 0; G < j; G++) ee[c + (G >> 2)] |= R[B[Re + G]] << 6 - (G & 3) * 2;
+                else if (u == 1) for (var G = 0; G < j; G++) ee[c + (G >> 3)] |= R[B[Re + G]] << 7 - (G & 7) * 1;
+              }
+              M = ee, o = 3, w = 1;
+            } else if (E == !1 && a.length == 1) {
+              for (var ee = new Uint8Array(j * q * 3), ze = j * q, c = 0; c < ze; c++) {
+                var be = c * 3, oe = c * 4;
+                ee[be] = M[oe], ee[be + 1] = M[oe + 1], ee[be + 2] = M[oe + 2];
+              }
+              M = ee, o = 2, w = 3, ce = 3 * j;
+            }
+            L.push({ rect: { x: U, y: J, width: j, height: q }, img: M, bpl: ce, bpp: w, blend: X, dispose: N ? 1 : 0 });
+          }
+          return { ctype: o, depth: u, plte: Z, gotAlpha: E, frames: L };
+        }, b.encode._filterZero = function(a, t, h, n, g) {
+          for (var v = [], o = 0; o < 5; o++)
+            if (!(t * n > 5e5 && (o == 2 || o == 3 || o == 4))) {
+              for (var u = 0; u < t; u++) b.encode._filterLine(g, a, u, n, h, o);
+              if (v.push(P.deflate(g)), h == 1) break;
+            }
+          for (var w, l = 1e9, T = 0; T < v.length; T++) v[T].length < l && (w = T, l = v[T].length);
+          return v[w];
+        }, b.encode._filterLine = function(a, t, h, n, g, v) {
+          var o = h * n, u = o + h, w = b.decode._paeth;
+          if (a[u] = v, u++, v == 0) for (var l = 0; l < n; l++) a[u + l] = t[o + l];
+          else if (v == 1) {
+            for (var l = 0; l < g; l++) a[u + l] = t[o + l];
+            for (var l = g; l < n; l++) a[u + l] = t[o + l] - t[o + l - g] + 256 & 255;
+          } else if (h == 0) {
+            for (var l = 0; l < g; l++) a[u + l] = t[o + l];
+            if (v == 2) for (var l = g; l < n; l++) a[u + l] = t[o + l];
+            if (v == 3) for (var l = g; l < n; l++) a[u + l] = t[o + l] - (t[o + l - g] >> 1) + 256 & 255;
+            if (v == 4) for (var l = g; l < n; l++) a[u + l] = t[o + l] - w(t[o + l - g], 0, 0) + 256 & 255;
+          } else {
+            if (v == 2)
+              for (var l = 0; l < n; l++) a[u + l] = t[o + l] + 256 - t[o + l - n] & 255;
+            if (v == 3) {
+              for (var l = 0; l < g; l++) a[u + l] = t[o + l] + 256 - (t[o + l - n] >> 1) & 255;
+              for (var l = g; l < n; l++) a[u + l] = t[o + l] + 256 - (t[o + l - n] + t[o + l - g] >> 1) & 255;
+            }
+            if (v == 4) {
+              for (var l = 0; l < g; l++) a[u + l] = t[o + l] + 256 - w(0, t[o + l - n], 0) & 255;
+              for (var l = g; l < n; l++) a[u + l] = t[o + l] + 256 - w(t[o + l - g], t[o + l - n], t[o + l - g - n]) & 255;
+            }
+          }
+        }, b.crc = {
+          table: (function() {
+            for (var a = new Uint32Array(256), t = 0; t < 256; t++) {
+              for (var h = t, n = 0; n < 8; n++)
+                h & 1 ? h = 3988292384 ^ h >>> 1 : h = h >>> 1;
+              a[t] = h;
+            }
+            return a;
+          })(),
+          update: function(a, t, h, n) {
+            for (var g = 0; g < n; g++) a = b.crc.table[(a ^ t[h + g]) & 255] ^ a >>> 8;
+            return a;
+          },
+          crc: function(a, t, h) {
+            return b.crc.update(4294967295, a, t, h) ^ 4294967295;
+          }
+        }, b.quantize = function(a, t, h) {
+          for (var n = [], g = 0, v = 0; v < a.length; v++)
+            n.push(b.encode.alphaMul(new Uint8Array(a[v]), h)), g += a[v].byteLength;
+          for (var o = new Uint8Array(g), u = new Uint32Array(o.buffer), w = 0, v = 0; v < n.length; v++) {
+            for (var l = n[v], T = l.length, z = 0; z < T; z++) o[w + z] = l[z];
+            w += T;
+          }
+          var _ = { i0: 0, i1: o.length, bst: null, est: null, tdst: 0, left: null, right: null };
+          _.bst = b.quantize.stats(o, _.i0, _.i1), _.est = b.quantize.estats(_.bst);
+          for (var c = [_]; c.length < t; ) {
+            for (var E = 0, R = 0, v = 0; v < c.length; v++) c[v].est.L > E && (E = c[v].est.L, R = v);
+            if (E < 1e-3) break;
+            var Z = c[R], m = b.quantize.splitPixels(o, u, Z.i0, Z.i1, Z.est.e, Z.est.eMq255), p = { i0: Z.i0, i1: m, bst: null, est: null, tdst: 0, left: null, right: null };
+            p.bst = b.quantize.stats(o, p.i0, p.i1), p.est = b.quantize.estats(p.bst);
+            var I = { i0: m, i1: Z.i1, bst: null, est: null, tdst: 0, left: null, right: null };
+            I.bst = { R: [], m: [], N: Z.bst.N - p.bst.N };
+            for (var v = 0; v < 16; v++) I.bst.R[v] = Z.bst.R[v] - p.bst.R[v];
+            for (var v = 0; v < 4; v++) I.bst.m[v] = Z.bst.m[v] - p.bst.m[v];
+            I.est = b.quantize.estats(I.bst), Z.left = p, Z.right = I, c[R] = p, c.push(I);
+          }
+          c.sort(function(re, we) {
+            return we.bst.N - re.bst.N;
+          });
+          for (var N = 0; N < n.length; N++) {
+            for (var F = b.quantize.planeDst, L = new Uint8Array(n[N].buffer), M = new Uint32Array(n[N].buffer), B = L.length, v = 0; v < B; v += 4) {
+              for (var U = L[v] * 0.00392156862745098, J = L[v + 1] * (1 / 255), j = L[v + 2] * (1 / 255), q = L[v + 3] * (1 / 255), X = _; X.left; ) X = F(X.est, U, J, j, q) <= 0 ? X.left : X.right;
+              M[v >> 2] = X.est.rgba;
+            }
+            n[N] = M.buffer;
+          }
+          return { bufs: n, plte: c };
+        }, b.quantize.getNearest = function(a, t, h, n, g) {
+          if (a.left == null)
+            return a.tdst = b.quantize.dist(a.est.q, t, h, n, g), a;
+          var v = b.quantize.planeDst(a.est, t, h, n, g), o = a.left, u = a.right;
+          v > 0 && (o = a.right, u = a.left);
+          var w = b.quantize.getNearest(o, t, h, n, g);
+          if (w.tdst <= v * v) return w;
+          var l = b.quantize.getNearest(u, t, h, n, g);
+          return l.tdst < w.tdst ? l : w;
+        }, b.quantize.planeDst = function(a, t, h, n, g) {
+          var v = a.e;
+          return v[0] * t + v[1] * h + v[2] * n + v[3] * g - a.eMq;
+        }, b.quantize.dist = function(a, t, h, n, g) {
+          var v = t - a[0], o = h - a[1], u = n - a[2], w = g - a[3];
+          return v * v + o * o + u * u + w * w;
+        }, b.quantize.splitPixels = function(a, t, h, n, g, v) {
+          var o = b.quantize.vecDot;
+          for (n -= 4; h < n; ) {
+            for (; o(a, h, g) <= v; ) h += 4;
+            for (; o(a, n, g) > v; ) n -= 4;
+            if (h >= n) break;
+            var u = t[h >> 2];
+            t[h >> 2] = t[n >> 2], t[n >> 2] = u, h += 4, n -= 4;
+          }
+          for (; o(a, h, g) > v; ) h -= 4;
+          return h + 4;
+        }, b.quantize.vecDot = function(a, t, h) {
+          return a[t] * h[0] + a[t + 1] * h[1] + a[t + 2] * h[2] + a[t + 3] * h[3];
+        }, b.quantize.stats = function(a, t, h) {
+          for (var n = [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], g = [0, 0, 0, 0], v = h - t >> 2, o = t; o < h; o += 4) {
+            var u = a[o] * 0.00392156862745098, w = a[o + 1] * (1 / 255), l = a[o + 2] * (1 / 255), T = a[o + 3] * (1 / 255);
+            g[0] += u, g[1] += w, g[2] += l, g[3] += T, n[0] += u * u, n[1] += u * w, n[2] += u * l, n[3] += u * T, n[5] += w * w, n[6] += w * l, n[7] += w * T, n[10] += l * l, n[11] += l * T, n[15] += T * T;
+          }
+          return n[4] = n[1], n[8] = n[2], n[12] = n[3], n[9] = n[6], n[13] = n[7], n[14] = n[11], { R: n, m: g, N: v };
+        }, b.quantize.estats = function(a) {
+          var t = a.R, h = a.m, n = a.N, g = h[0], v = h[1], o = h[2], u = h[3], w = n == 0 ? 0 : 1 / n, l = [
+            t[0] - g * g * w,
+            t[1] - g * v * w,
+            t[2] - g * o * w,
+            t[3] - g * u * w,
+            t[4] - v * g * w,
+            t[5] - v * v * w,
+            t[6] - v * o * w,
+            t[7] - v * u * w,
+            t[8] - o * g * w,
+            t[9] - o * v * w,
+            t[10] - o * o * w,
+            t[11] - o * u * w,
+            t[12] - u * g * w,
+            t[13] - u * v * w,
+            t[14] - u * o * w,
+            t[15] - u * u * w
+          ], T = l, z = b.M4, _ = [0.5, 0.5, 0.5, 0.5], c = 0, E = 0;
+          if (n != 0)
+            for (var R = 0; R < 10 && (_ = z.multVec(T, _), E = Math.sqrt(z.dot(_, _)), _ = z.sml(1 / E, _), !(Math.abs(E - c) < 1e-9)); R++)
+              c = E;
+          var Z = [g * w, v * w, o * w, u * w], m = z.dot(z.sml(255, Z), _), p = Z[3] < 1e-3 ? 0 : 1 / Z[3];
+          return {
+            Cov: l,
+            q: Z,
+            e: _,
+            L: c,
+            eMq255: m,
+            eMq: z.dot(_, Z),
+            rgba: (Math.round(255 * Z[3]) << 24 | Math.round(255 * Z[2] * p) << 16 | Math.round(255 * Z[1] * p) << 8 | Math.round(255 * Z[0] * p) << 0) >>> 0
+          };
+        }, b.M4 = {
+          multVec: function(a, t) {
+            return [
+              a[0] * t[0] + a[1] * t[1] + a[2] * t[2] + a[3] * t[3],
+              a[4] * t[0] + a[5] * t[1] + a[6] * t[2] + a[7] * t[3],
+              a[8] * t[0] + a[9] * t[1] + a[10] * t[2] + a[11] * t[3],
+              a[12] * t[0] + a[13] * t[1] + a[14] * t[2] + a[15] * t[3]
+            ];
+          },
+          dot: function(a, t) {
+            return a[0] * t[0] + a[1] * t[1] + a[2] * t[2] + a[3] * t[3];
+          },
+          sml: function(a, t) {
+            return [a * t[0], a * t[1], a * t[2], a * t[3]];
+          }
+        }, b.encode.alphaMul = function(a, t) {
+          for (var h = new Uint8Array(a.length), n = a.length >> 2, g = 0; g < n; g++) {
+            var v = g << 2, o = a[v + 3];
+            t && (o = o < 128 ? 0 : 255);
+            var u = o * (1 / 255);
+            h[v + 0] = a[v + 0] * u, h[v + 1] = a[v + 1] * u, h[v + 2] = a[v + 2] * u, h[v + 3] = o;
+          }
+          return h;
+        };
+      })(W, V);
+    })();
+  })(Pe)), Pe.exports;
+}
+var Ca = ja(), $a = /* @__PURE__ */ Ba(Ca), Wa = /* @__PURE__ */ Oa({
+  __proto__: null,
+  default: $a
+}, [Ca]);
+export {
+  Wa as U
+};