@btc-vision/transaction/browser/vendors.js

OPNet transaction library allows you to create and sign transactions for the OPNet network.

import { i as $e, n as Ke, r as We, t as se } from "./rolldown-runtime.js";
import { A as Fo, C as uu, F as fu, M as du, N as hu, T as lr, a as pu, c as gu, d as mu, i as bu, l as Ys, o as vu, r as kn, u as En, w as yu } from "./noble-curves.js";
import { a as Ws, c as wu, i as _u, l as ku, n as Eu, o as Au, r as Bu, s as fr, t as zu } from "./noble-hashes.js";
var Su = 4, An = 0, Bn = 1, Iu = 2;
function Nt(e) {
  let t = e.length;
  for (; --t >= 0; ) e[t] = 0;
}
var xu = 0, Xs = 1, ju = 2, Tu = 3, Ou = 258, $o = 29, _a = 256, ca = _a + 1 + $o, jt = 30, Ko = 19, Js = 2 * ca + 1, ct = 15, Ri = 16, Uu = 7, Ho = 256, Qs = 16, el = 17, rl = 18, oo = new Uint8Array([
  0,
  0,
  0,
  0,
  0,
  0,
  0,
  0,
  1,
  1,
  1,
  1,
  2,
  2,
  2,
  2,
  3,
  3,
  3,
  3,
  4,
  4,
  4,
  4,
  5,
  5,
  5,
  5,
  0
]), $a = new Uint8Array([
  0,
  0,
  0,
  0,
  1,
  1,
  2,
  2,
  3,
  3,
  4,
  4,
  5,
  5,
  6,
  6,
  7,
  7,
  8,
  8,
  9,
  9,
  10,
  10,
  11,
  11,
  12,
  12,
  13,
  13
]), Pu = new Uint8Array([
  0,
  0,
  0,
  0,
  0,
  0,
  0,
  0,
  0,
  0,
  0,
  0,
  0,
  0,
  0,
  0,
  2,
  3,
  7
]), tl = new Uint8Array([
  16,
  17,
  18,
  0,
  8,
  7,
  9,
  6,
  10,
  5,
  11,
  4,
  12,
  3,
  13,
  2,
  14,
  1,
  15
]), Ru = 512, qr = new Array((ca + 2) * 2);
Nt(qr);
var ra = new Array(jt * 2);
Nt(ra);
var ua = new Array(Ru);
Nt(ua);
var fa = new Array(Ou - Tu + 1);
Nt(fa);
var Zo = new Array($o);
Nt(Zo);
var ii = new Array(jt);
Nt(ii);
function Li(e, t, r, a, i) {
  this.static_tree = e, this.extra_bits = t, this.extra_base = r, this.elems = a, this.max_length = i, this.has_stree = e && e.length;
}
var al, il, ol;
function Ni(e, t) {
  this.dyn_tree = e, this.max_code = 0, this.stat_desc = t;
}
var nl = (e) => e < 256 ? ua[e] : ua[256 + (e >>> 7)], da = (e, t) => {
  e.pending_buf[e.pending++] = t & 255, e.pending_buf[e.pending++] = t >>> 8 & 255;
}, tr = (e, t, r) => {
  e.bi_valid > Ri - r ? (e.bi_buf |= t << e.bi_valid & 65535, da(e, e.bi_buf), e.bi_buf = t >> Ri - e.bi_valid, e.bi_valid += r - Ri) : (e.bi_buf |= t << e.bi_valid & 65535, e.bi_valid += r);
}, Ar = (e, t, r) => {
  tr(e, r[t * 2], r[t * 2 + 1]);
}, sl = (e, t) => {
  let r = 0;
  do
    r |= e & 1, e >>>= 1, r <<= 1;
  while (--t > 0);
  return r >>> 1;
}, Lu = (e) => {
  e.bi_valid === 16 ? (da(e, e.bi_buf), e.bi_buf = 0, e.bi_valid = 0) : e.bi_valid >= 8 && (e.pending_buf[e.pending++] = e.bi_buf & 255, e.bi_buf >>= 8, e.bi_valid -= 8);
}, Nu = (e, t) => {
  const r = t.dyn_tree, a = t.max_code, i = t.stat_desc.static_tree, o = t.stat_desc.has_stree, c = t.stat_desc.extra_bits, u = t.stat_desc.extra_base, p = t.stat_desc.max_length;
  let h, s, _, y, b, E, q = 0;
  for (y = 0; y <= ct; y++) e.bl_count[y] = 0;
  for (r[e.heap[e.heap_max] * 2 + 1] = 0, h = e.heap_max + 1; h < Js; h++)
    s = e.heap[h], y = r[r[s * 2 + 1] * 2 + 1] + 1, y > p && (y = p, q++), r[s * 2 + 1] = y, !(s > a) && (e.bl_count[y]++, b = 0, s >= u && (b = c[s - u]), E = r[s * 2], e.opt_len += E * (y + b), o && (e.static_len += E * (i[s * 2 + 1] + b)));
  if (q !== 0) {
    do {
      for (y = p - 1; e.bl_count[y] === 0; ) y--;
      e.bl_count[y]--, e.bl_count[y + 1] += 2, e.bl_count[p]--, q -= 2;
    } while (q > 0);
    for (y = p; y !== 0; y--)
      for (s = e.bl_count[y]; s !== 0; )
        _ = e.heap[--h], !(_ > a) && (r[_ * 2 + 1] !== y && (e.opt_len += (y - r[_ * 2 + 1]) * r[_ * 2], r[_ * 2 + 1] = y), s--);
  }
}, ll = (e, t, r) => {
  const a = new Array(ct + 1);
  let i = 0, o, c;
  for (o = 1; o <= ct; o++)
    i = i + r[o - 1] << 1, a[o] = i;
  for (c = 0; c <= t; c++) {
    let u = e[c * 2 + 1];
    u !== 0 && (e[c * 2] = sl(a[u]++, u));
  }
}, Cu = () => {
  let e, t, r, a, i;
  const o = new Array(ct + 1);
  for (r = 0, a = 0; a < $o - 1; a++)
    for (Zo[a] = r, e = 0; e < 1 << oo[a]; e++) fa[r++] = a;
  for (fa[r - 1] = a, i = 0, a = 0; a < 16; a++)
    for (ii[a] = i, e = 0; e < 1 << $a[a]; e++) ua[i++] = a;
  for (i >>= 7; a < jt; a++)
    for (ii[a] = i << 7, e = 0; e < 1 << $a[a] - 7; e++) ua[256 + i++] = a;
  for (t = 0; t <= ct; t++) o[t] = 0;
  for (e = 0; e <= 143; )
    qr[e * 2 + 1] = 8, e++, o[8]++;
  for (; e <= 255; )
    qr[e * 2 + 1] = 9, e++, o[9]++;
  for (; e <= 279; )
    qr[e * 2 + 1] = 7, e++, o[7]++;
  for (; e <= 287; )
    qr[e * 2 + 1] = 8, e++, o[8]++;
  for (ll(qr, ca + 1, o), e = 0; e < jt; e++)
    ra[e * 2 + 1] = 5, ra[e * 2] = sl(e, 5);
  al = new Li(qr, oo, _a + 1, ca, ct), il = new Li(ra, $a, 0, jt, ct), ol = new Li(new Array(0), Pu, 0, Ko, Uu);
}, cl = (e) => {
  let t;
  for (t = 0; t < ca; t++) e.dyn_ltree[t * 2] = 0;
  for (t = 0; t < jt; t++) e.dyn_dtree[t * 2] = 0;
  for (t = 0; t < Ko; t++) e.bl_tree[t * 2] = 0;
  e.dyn_ltree[Ho * 2] = 1, e.opt_len = e.static_len = 0, e.sym_next = e.matches = 0;
}, ul = (e) => {
  e.bi_valid > 8 ? da(e, e.bi_buf) : e.bi_valid > 0 && (e.pending_buf[e.pending++] = e.bi_buf), e.bi_buf = 0, e.bi_valid = 0;
}, zn = (e, t, r, a) => {
  const i = t * 2, o = r * 2;
  return e[i] < e[o] || e[i] === e[o] && a[t] <= a[r];
}, Ci = (e, t, r) => {
  const a = e.heap[r];
  let i = r << 1;
  for (; i <= e.heap_len && (i < e.heap_len && zn(t, e.heap[i + 1], e.heap[i], e.depth) && i++, !zn(t, a, e.heap[i], e.depth)); )
    e.heap[r] = e.heap[i], r = i, i <<= 1;
  e.heap[r] = a;
}, Sn = (e, t, r) => {
  let a, i, o = 0, c, u;
  if (e.sym_next !== 0) do
    a = e.pending_buf[e.sym_buf + o++] & 255, a += (e.pending_buf[e.sym_buf + o++] & 255) << 8, i = e.pending_buf[e.sym_buf + o++], a === 0 ? Ar(e, i, t) : (c = fa[i], Ar(e, c + _a + 1, t), u = oo[c], u !== 0 && (i -= Zo[c], tr(e, i, u)), a--, c = nl(a), Ar(e, c, r), u = $a[c], u !== 0 && (a -= ii[c], tr(e, a, u)));
  while (o < e.sym_next);
  Ar(e, Ho, t);
}, no = (e, t) => {
  const r = t.dyn_tree, a = t.stat_desc.static_tree, i = t.stat_desc.has_stree, o = t.stat_desc.elems;
  let c, u, p = -1, h;
  for (e.heap_len = 0, e.heap_max = Js, c = 0; c < o; c++) r[c * 2] !== 0 ? (e.heap[++e.heap_len] = p = c, e.depth[c] = 0) : r[c * 2 + 1] = 0;
  for (; e.heap_len < 2; )
    h = e.heap[++e.heap_len] = p < 2 ? ++p : 0, r[h * 2] = 1, e.depth[h] = 0, e.opt_len--, i && (e.static_len -= a[h * 2 + 1]);
  for (t.max_code = p, c = e.heap_len >> 1; c >= 1; c--) Ci(e, r, c);
  h = o;
  do
    c = e.heap[1], e.heap[1] = e.heap[e.heap_len--], Ci(e, r, 1), u = e.heap[1], e.heap[--e.heap_max] = c, e.heap[--e.heap_max] = u, r[h * 2] = r[c * 2] + r[u * 2], e.depth[h] = (e.depth[c] >= e.depth[u] ? e.depth[c] : e.depth[u]) + 1, r[c * 2 + 1] = r[u * 2 + 1] = h, e.heap[1] = h++, Ci(e, r, 1);
  while (e.heap_len >= 2);
  e.heap[--e.heap_max] = e.heap[1], Nu(e, t), ll(r, p, e.bl_count);
}, In = (e, t, r) => {
  let a, i = -1, o, c = t[1], u = 0, p = 7, h = 4;
  for (c === 0 && (p = 138, h = 3), t[(r + 1) * 2 + 1] = 65535, a = 0; a <= r; a++)
    o = c, c = t[(a + 1) * 2 + 1], !(++u < p && o === c) && (u < h ? e.bl_tree[o * 2] += u : o !== 0 ? (o !== i && e.bl_tree[o * 2]++, e.bl_tree[Qs * 2]++) : u <= 10 ? e.bl_tree[el * 2]++ : e.bl_tree[rl * 2]++, u = 0, i = o, c === 0 ? (p = 138, h = 3) : o === c ? (p = 6, h = 3) : (p = 7, h = 4));
}, xn = (e, t, r) => {
  let a, i = -1, o, c = t[1], u = 0, p = 7, h = 4;
  for (c === 0 && (p = 138, h = 3), a = 0; a <= r; a++)
    if (o = c, c = t[(a + 1) * 2 + 1], !(++u < p && o === c)) {
      if (u < h) do
        Ar(e, o, e.bl_tree);
      while (--u !== 0);
      else o !== 0 ? (o !== i && (Ar(e, o, e.bl_tree), u--), Ar(e, Qs, e.bl_tree), tr(e, u - 3, 2)) : u <= 10 ? (Ar(e, el, e.bl_tree), tr(e, u - 3, 3)) : (Ar(e, rl, e.bl_tree), tr(e, u - 11, 7));
      u = 0, i = o, c === 0 ? (p = 138, h = 3) : o === c ? (p = 6, h = 3) : (p = 7, h = 4);
    }
}, Mu = (e) => {
  let t;
  for (In(e, e.dyn_ltree, e.l_desc.max_code), In(e, e.dyn_dtree, e.d_desc.max_code), no(e, e.bl_desc), t = Ko - 1; t >= 3 && e.bl_tree[tl[t] * 2 + 1] === 0; t--) ;
  return e.opt_len += 3 * (t + 1) + 5 + 5 + 4, t;
}, qu = (e, t, r, a) => {
  let i;
  for (tr(e, t - 257, 5), tr(e, r - 1, 5), tr(e, a - 4, 4), i = 0; i < a; i++) tr(e, e.bl_tree[tl[i] * 2 + 1], 3);
  xn(e, e.dyn_ltree, t - 1), xn(e, e.dyn_dtree, r - 1);
}, Du = (e) => {
  let t = 4093624447, r;
  for (r = 0; r <= 31; r++, t >>>= 1) if (t & 1 && e.dyn_ltree[r * 2] !== 0) return An;
  if (e.dyn_ltree[18] !== 0 || e.dyn_ltree[20] !== 0 || e.dyn_ltree[26] !== 0) return Bn;
  for (r = 32; r < _a; r++) if (e.dyn_ltree[r * 2] !== 0) return Bn;
  return An;
}, jn = !1, Fu = (e) => {
  jn || (Cu(), jn = !0), e.l_desc = new Ni(e.dyn_ltree, al), e.d_desc = new Ni(e.dyn_dtree, il), e.bl_desc = new Ni(e.bl_tree, ol), e.bi_buf = 0, e.bi_valid = 0, cl(e);
}, fl = (e, t, r, a) => {
  tr(e, (xu << 1) + (a ? 1 : 0), 3), ul(e), da(e, r), da(e, ~r), r && e.pending_buf.set(e.window.subarray(t, t + r), e.pending), e.pending += r;
}, $u = (e) => {
  tr(e, Xs << 1, 3), Ar(e, Ho, qr), Lu(e);
}, Ku = (e, t, r, a) => {
  let i, o, c = 0;
  e.level > 0 ? (e.strm.data_type === Iu && (e.strm.data_type = Du(e)), no(e, e.l_desc), no(e, e.d_desc), c = Mu(e), i = e.opt_len + 3 + 7 >>> 3, o = e.static_len + 3 + 7 >>> 3, o <= i && (i = o)) : i = o = r + 5, r + 4 <= i && t !== -1 ? fl(e, t, r, a) : e.strategy === Su || o === i ? (tr(e, (Xs << 1) + (a ? 1 : 0), 3), Sn(e, qr, ra)) : (tr(e, (ju << 1) + (a ? 1 : 0), 3), qu(e, e.l_desc.max_code + 1, e.d_desc.max_code + 1, c + 1), Sn(e, e.dyn_ltree, e.dyn_dtree)), cl(e), a && ul(e);
}, Hu = (e, t, r) => (e.pending_buf[e.sym_buf + e.sym_next++] = t, e.pending_buf[e.sym_buf + e.sym_next++] = t >> 8, e.pending_buf[e.sym_buf + e.sym_next++] = r, t === 0 ? e.dyn_ltree[r * 2]++ : (e.matches++, t--, e.dyn_ltree[(fa[r] + _a + 1) * 2]++, e.dyn_dtree[nl(t) * 2]++), e.sym_next === e.sym_end), Zu = {
  _tr_init: Fu,
  _tr_stored_block: fl,
  _tr_flush_block: Ku,
  _tr_tally: Hu,
  _tr_align: $u
}, Gu = (e, t, r, a) => {
  let i = e & 65535 | 0, o = e >>> 16 & 65535 | 0, c = 0;
  for (; r !== 0; ) {
    c = r > 2e3 ? 2e3 : r, r -= c;
    do
      i = i + t[a++] | 0, o = o + i | 0;
    while (--c);
    i %= 65521, o %= 65521;
  }
  return i | o << 16 | 0;
}, ha = Gu, Vu = () => {
  let e, t = [];
  for (var r = 0; r < 256; r++) {
    e = r;
    for (var a = 0; a < 8; a++) e = e & 1 ? 3988292384 ^ e >>> 1 : e >>> 1;
    t[r] = e;
  }
  return t;
}, Yu = new Uint32Array(Vu()), Wu = (e, t, r, a) => {
  const i = Yu, o = a + r;
  e ^= -1;
  for (let c = a; c < o; c++) e = e >>> 8 ^ i[(e ^ t[c]) & 255];
  return e ^ -1;
}, Ge = Wu, mt = {
  2: "need dictionary",
  1: "stream end",
  0: "",
  "-1": "file error",
  "-2": "stream error",
  "-3": "data error",
  "-4": "insufficient memory",
  "-5": "buffer error",
  "-6": "incompatible version"
}, wt = {
  Z_NO_FLUSH: 0,
  Z_PARTIAL_FLUSH: 1,
  Z_SYNC_FLUSH: 2,
  Z_FULL_FLUSH: 3,
  Z_FINISH: 4,
  Z_BLOCK: 5,
  Z_TREES: 6,
  Z_OK: 0,
  Z_STREAM_END: 1,
  Z_NEED_DICT: 2,
  Z_ERRNO: -1,
  Z_STREAM_ERROR: -2,
  Z_DATA_ERROR: -3,
  Z_MEM_ERROR: -4,
  Z_BUF_ERROR: -5,
  Z_NO_COMPRESSION: 0,
  Z_BEST_SPEED: 1,
  Z_BEST_COMPRESSION: 9,
  Z_DEFAULT_COMPRESSION: -1,
  Z_FILTERED: 1,
  Z_HUFFMAN_ONLY: 2,
  Z_RLE: 3,
  Z_FIXED: 4,
  Z_DEFAULT_STRATEGY: 0,
  Z_BINARY: 0,
  Z_TEXT: 1,
  Z_UNKNOWN: 2,
  Z_DEFLATED: 8
}, { _tr_init: Xu, _tr_stored_block: so, _tr_flush_block: Ju, _tr_tally: Qr, _tr_align: Qu } = Zu, { Z_NO_FLUSH: et, Z_PARTIAL_FLUSH: ef, Z_FULL_FLUSH: rf, Z_FINISH: dr, Z_BLOCK: Tn, Z_OK: Ve, Z_STREAM_END: On, Z_STREAM_ERROR: Ir, Z_DATA_ERROR: tf, Z_BUF_ERROR: Mi, Z_DEFAULT_COMPRESSION: af, Z_FILTERED: of, Z_HUFFMAN_ONLY: xa, Z_RLE: nf, Z_FIXED: sf, Z_DEFAULT_STRATEGY: lf, Z_UNKNOWN: cf, Z_DEFLATED: wi } = wt, uf = 9, ff = 15, df = 8, lo = 286, hf = 30, pf = 19, gf = 2 * lo + 1, mf = 15, ke = 3, Yr = 258, xr = Yr + ke + 1, bf = 32, Ot = 42, Go = 57, co = 69, uo = 73, fo = 91, ho = 103, ut = 113, Gt = 666, Qe = 1, Ct = 2, bt = 3, Mt = 4, vf = 3, ft = (e, t) => (e.msg = mt[t], t), Un = (e) => e * 2 - (e > 4 ? 9 : 0), Gr = (e) => {
  let t = e.length;
  for (; --t >= 0; ) e[t] = 0;
}, yf = (e) => {
  let t, r, a, i = e.w_size;
  t = e.hash_size, a = t;
  do
    r = e.head[--a], e.head[a] = r >= i ? r - i : 0;
  while (--t);
  t = i, a = t;
  do
    r = e.prev[--a], e.prev[a] = r >= i ? r - i : 0;
  while (--t);
}, wf = (e, t, r) => (t << e.hash_shift ^ r) & e.hash_mask, rt = wf, ir = (e) => {
  const t = e.state;
  let r = t.pending;
  r > e.avail_out && (r = e.avail_out), r !== 0 && (e.output.set(t.pending_buf.subarray(t.pending_out, t.pending_out + r), e.next_out), e.next_out += r, t.pending_out += r, e.total_out += r, e.avail_out -= r, t.pending -= r, t.pending === 0 && (t.pending_out = 0));
}, sr = (e, t) => {
  Ju(e, e.block_start >= 0 ? e.block_start : -1, e.strstart - e.block_start, t), e.block_start = e.strstart, ir(e.strm);
}, Ae = (e, t) => {
  e.pending_buf[e.pending++] = t;
}, Kt = (e, t) => {
  e.pending_buf[e.pending++] = t >>> 8 & 255, e.pending_buf[e.pending++] = t & 255;
}, po = (e, t, r, a) => {
  let i = e.avail_in;
  return i > a && (i = a), i === 0 ? 0 : (e.avail_in -= i, t.set(e.input.subarray(e.next_in, e.next_in + i), r), e.state.wrap === 1 ? e.adler = ha(e.adler, t, i, r) : e.state.wrap === 2 && (e.adler = Ge(e.adler, t, i, r)), e.next_in += i, e.total_in += i, i);
}, dl = (e, t) => {
  let r = e.max_chain_length, a = e.strstart, i, o, c = e.prev_length, u = e.nice_match;
  const p = e.strstart > e.w_size - xr ? e.strstart - (e.w_size - xr) : 0, h = e.window, s = e.w_mask, _ = e.prev, y = e.strstart + Yr;
  let b = h[a + c - 1], E = h[a + c];
  e.prev_length >= e.good_match && (r >>= 2), u > e.lookahead && (u = e.lookahead);
  do
    if (i = t, !(h[i + c] !== E || h[i + c - 1] !== b || h[i] !== h[a] || h[++i] !== h[a + 1])) {
      a += 2, i++;
      do
        ;
      while (h[++a] === h[++i] && h[++a] === h[++i] && h[++a] === h[++i] && h[++a] === h[++i] && h[++a] === h[++i] && h[++a] === h[++i] && h[++a] === h[++i] && h[++a] === h[++i] && a < y);
      if (o = Yr - (y - a), a = y - Yr, o > c) {
        if (e.match_start = t, c = o, o >= u) break;
        b = h[a + c - 1], E = h[a + c];
      }
    }
  while ((t = _[t & s]) > p && --r !== 0);
  return c <= e.lookahead ? c : e.lookahead;
}, Ut = (e) => {
  const t = e.w_size;
  let r, a, i;
  do {
    if (a = e.window_size - e.lookahead - e.strstart, e.strstart >= t + (t - xr) && (e.window.set(e.window.subarray(t, t + t - a), 0), e.match_start -= t, e.strstart -= t, e.block_start -= t, e.insert > e.strstart && (e.insert = e.strstart), yf(e), a += t), e.strm.avail_in === 0) break;
    if (r = po(e.strm, e.window, e.strstart + e.lookahead, a), e.lookahead += r, e.lookahead + e.insert >= ke)
      for (i = e.strstart - e.insert, e.ins_h = e.window[i], e.ins_h = rt(e, e.ins_h, e.window[i + 1]); e.insert && (e.ins_h = rt(e, e.ins_h, e.window[i + ke - 1]), e.prev[i & e.w_mask] = e.head[e.ins_h], e.head[e.ins_h] = i, i++, e.insert--, !(e.lookahead + e.insert < ke)); )
        ;
  } while (e.lookahead < xr && e.strm.avail_in !== 0);
}, hl = (e, t) => {
  let r = e.pending_buf_size - 5 > e.w_size ? e.w_size : e.pending_buf_size - 5, a, i, o, c = 0, u = e.strm.avail_in;
  do {
    if (a = 65535, o = e.bi_valid + 42 >> 3, e.strm.avail_out < o || (o = e.strm.avail_out - o, i = e.strstart - e.block_start, a > i + e.strm.avail_in && (a = i + e.strm.avail_in), a > o && (a = o), a < r && (a === 0 && t !== dr || t === et || a !== i + e.strm.avail_in))) break;
    c = t === dr && a === i + e.strm.avail_in ? 1 : 0, so(e, 0, 0, c), e.pending_buf[e.pending - 4] = a, e.pending_buf[e.pending - 3] = a >> 8, e.pending_buf[e.pending - 2] = ~a, e.pending_buf[e.pending - 1] = ~a >> 8, ir(e.strm), i && (i > a && (i = a), e.strm.output.set(e.window.subarray(e.block_start, e.block_start + i), e.strm.next_out), e.strm.next_out += i, e.strm.avail_out -= i, e.strm.total_out += i, e.block_start += i, a -= i), a && (po(e.strm, e.strm.output, e.strm.next_out, a), e.strm.next_out += a, e.strm.avail_out -= a, e.strm.total_out += a);
  } while (c === 0);
  return u -= e.strm.avail_in, u && (u >= e.w_size ? (e.matches = 2, e.window.set(e.strm.input.subarray(e.strm.next_in - e.w_size, e.strm.next_in), 0), e.strstart = e.w_size, e.insert = e.strstart) : (e.window_size - e.strstart <= u && (e.strstart -= e.w_size, e.window.set(e.window.subarray(e.w_size, e.w_size + e.strstart), 0), e.matches < 2 && e.matches++, e.insert > e.strstart && (e.insert = e.strstart)), e.window.set(e.strm.input.subarray(e.strm.next_in - u, e.strm.next_in), e.strstart), e.strstart += u, e.insert += u > e.w_size - e.insert ? e.w_size - e.insert : u), e.block_start = e.strstart), e.high_water < e.strstart && (e.high_water = e.strstart), c ? Mt : t !== et && t !== dr && e.strm.avail_in === 0 && e.strstart === e.block_start ? Ct : (o = e.window_size - e.strstart, e.strm.avail_in > o && e.block_start >= e.w_size && (e.block_start -= e.w_size, e.strstart -= e.w_size, e.window.set(e.window.subarray(e.w_size, e.w_size + e.strstart), 0), e.matches < 2 && e.matches++, o += e.w_size, e.insert > e.strstart && (e.insert = e.strstart)), o > e.strm.avail_in && (o = e.strm.avail_in), o && (po(e.strm, e.window, e.strstart, o), e.strstart += o, e.insert += o > e.w_size - e.insert ? e.w_size - e.insert : o), e.high_water < e.strstart && (e.high_water = e.strstart), o = e.bi_valid + 42 >> 3, o = e.pending_buf_size - o > 65535 ? 65535 : e.pending_buf_size - o, r = o > e.w_size ? e.w_size : o, i = e.strstart - e.block_start, (i >= r || (i || t === dr) && t !== et && e.strm.avail_in === 0 && i <= o) && (a = i > o ? o : i, c = t === dr && e.strm.avail_in === 0 && a === i ? 1 : 0, so(e, e.block_start, a, c), e.block_start += a, ir(e.strm)), c ? bt : Qe);
}, qi = (e, t) => {
  let r, a;
  for (; ; ) {
    if (e.lookahead < xr) {
      if (Ut(e), e.lookahead < xr && t === et) return Qe;
      if (e.lookahead === 0) break;
    }
    if (r = 0, e.lookahead >= ke && (e.ins_h = rt(e, e.ins_h, e.window[e.strstart + ke - 1]), r = e.prev[e.strstart & e.w_mask] = e.head[e.ins_h], e.head[e.ins_h] = e.strstart), r !== 0 && e.strstart - r <= e.w_size - xr && (e.match_length = dl(e, r)), e.match_length >= ke)
      if (a = Qr(e, e.strstart - e.match_start, e.match_length - ke), e.lookahead -= e.match_length, e.match_length <= e.max_lazy_match && e.lookahead >= ke) {
        e.match_length--;
        do
          e.strstart++, e.ins_h = rt(e, e.ins_h, e.window[e.strstart + ke - 1]), r = 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 = rt(e, e.ins_h, e.window[e.strstart + 1]);
    else
      a = Qr(e, 0, e.window[e.strstart]), e.lookahead--, e.strstart++;
    if (a && (sr(e, !1), e.strm.avail_out === 0))
      return Qe;
  }
  return e.insert = e.strstart < ke - 1 ? e.strstart : ke - 1, t === dr ? (sr(e, !0), e.strm.avail_out === 0 ? bt : Mt) : e.sym_next && (sr(e, !1), e.strm.avail_out === 0) ? Qe : Ct;
}, Et = (e, t) => {
  let r, a, i;
  for (; ; ) {
    if (e.lookahead < xr) {
      if (Ut(e), e.lookahead < xr && t === et) return Qe;
      if (e.lookahead === 0) break;
    }
    if (r = 0, e.lookahead >= ke && (e.ins_h = rt(e, e.ins_h, e.window[e.strstart + ke - 1]), r = 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 = ke - 1, r !== 0 && e.prev_length < e.max_lazy_match && e.strstart - r <= e.w_size - xr && (e.match_length = dl(e, r), e.match_length <= 5 && (e.strategy === of || e.match_length === ke && e.strstart - e.match_start > 4096) && (e.match_length = ke - 1)), e.prev_length >= ke && e.match_length <= e.prev_length) {
      i = e.strstart + e.lookahead - ke, a = Qr(e, e.strstart - 1 - e.prev_match, e.prev_length - ke), e.lookahead -= e.prev_length - 1, e.prev_length -= 2;
      do
        ++e.strstart <= i && (e.ins_h = rt(e, e.ins_h, e.window[e.strstart + ke - 1]), r = 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 = ke - 1, e.strstart++, a && (sr(e, !1), e.strm.avail_out === 0))
        return Qe;
    } else if (e.match_available) {
      if (a = Qr(e, 0, e.window[e.strstart - 1]), a && sr(e, !1), e.strstart++, e.lookahead--, e.strm.avail_out === 0) return Qe;
    } else
      e.match_available = 1, e.strstart++, e.lookahead--;
  }
  return e.match_available && (a = Qr(e, 0, e.window[e.strstart - 1]), e.match_available = 0), e.insert = e.strstart < ke - 1 ? e.strstart : ke - 1, t === dr ? (sr(e, !0), e.strm.avail_out === 0 ? bt : Mt) : e.sym_next && (sr(e, !1), e.strm.avail_out === 0) ? Qe : Ct;
}, _f = (e, t) => {
  let r, a, i, o;
  const c = e.window;
  for (; ; ) {
    if (e.lookahead <= Yr) {
      if (Ut(e), e.lookahead <= Yr && t === et) return Qe;
      if (e.lookahead === 0) break;
    }
    if (e.match_length = 0, e.lookahead >= ke && e.strstart > 0 && (i = e.strstart - 1, a = c[i], a === c[++i] && a === c[++i] && a === c[++i])) {
      o = e.strstart + Yr;
      do
        ;
      while (a === c[++i] && a === c[++i] && a === c[++i] && a === c[++i] && a === c[++i] && a === c[++i] && a === c[++i] && a === c[++i] && i < o);
      e.match_length = Yr - (o - i), e.match_length > e.lookahead && (e.match_length = e.lookahead);
    }
    if (e.match_length >= ke ? (r = Qr(e, 1, e.match_length - ke), e.lookahead -= e.match_length, e.strstart += e.match_length, e.match_length = 0) : (r = Qr(e, 0, e.window[e.strstart]), e.lookahead--, e.strstart++), r && (sr(e, !1), e.strm.avail_out === 0))
      return Qe;
  }
  return e.insert = 0, t === dr ? (sr(e, !0), e.strm.avail_out === 0 ? bt : Mt) : e.sym_next && (sr(e, !1), e.strm.avail_out === 0) ? Qe : Ct;
}, kf = (e, t) => {
  let r;
  for (; ; ) {
    if (e.lookahead === 0 && (Ut(e), e.lookahead === 0)) {
      if (t === et) return Qe;
      break;
    }
    if (e.match_length = 0, r = Qr(e, 0, e.window[e.strstart]), e.lookahead--, e.strstart++, r && (sr(e, !1), e.strm.avail_out === 0))
      return Qe;
  }
  return e.insert = 0, t === dr ? (sr(e, !0), e.strm.avail_out === 0 ? bt : Mt) : e.sym_next && (sr(e, !1), e.strm.avail_out === 0) ? Qe : Ct;
};
function br(e, t, r, a, i) {
  this.good_length = e, this.max_lazy = t, this.nice_length = r, this.max_chain = a, this.func = i;
}
var Vt = [
  new br(0, 0, 0, 0, hl),
  new br(4, 4, 8, 4, qi),
  new br(4, 5, 16, 8, qi),
  new br(4, 6, 32, 32, qi),
  new br(4, 4, 16, 16, Et),
  new br(8, 16, 32, 32, Et),
  new br(8, 16, 128, 128, Et),
  new br(8, 32, 128, 256, Et),
  new br(32, 128, 258, 1024, Et),
  new br(32, 258, 258, 4096, Et)
], Ef = (e) => {
  e.window_size = 2 * e.w_size, Gr(e.head), e.max_lazy_match = Vt[e.level].max_lazy, e.good_match = Vt[e.level].good_length, e.nice_match = Vt[e.level].nice_length, e.max_chain_length = Vt[e.level].max_chain, e.strstart = 0, e.block_start = 0, e.lookahead = 0, e.insert = 0, e.match_length = e.prev_length = ke - 1, e.match_available = 0, e.ins_h = 0;
};
function Af() {
  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 = wi, 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 Uint16Array(gf * 2), this.dyn_dtree = new Uint16Array((2 * hf + 1) * 2), this.bl_tree = new Uint16Array((2 * pf + 1) * 2), Gr(this.dyn_ltree), Gr(this.dyn_dtree), Gr(this.bl_tree), this.l_desc = null, this.d_desc = null, this.bl_desc = null, this.bl_count = new Uint16Array(mf + 1), this.heap = new Uint16Array(2 * lo + 1), Gr(this.heap), this.heap_len = 0, this.heap_max = 0, this.depth = new Uint16Array(2 * lo + 1), Gr(this.depth), this.sym_buf = 0, this.lit_bufsize = 0, this.sym_next = 0, this.sym_end = 0, this.opt_len = 0, this.static_len = 0, this.matches = 0, this.insert = 0, this.bi_buf = 0, this.bi_valid = 0;
}
var ka = (e) => {
  if (!e) return 1;
  const t = e.state;
  return !t || t.strm !== e || t.status !== Ot && t.status !== Go && t.status !== co && t.status !== uo && t.status !== fo && t.status !== ho && t.status !== ut && t.status !== Gt ? 1 : 0;
}, pl = (e) => {
  if (ka(e)) return ft(e, Ir);
  e.total_in = e.total_out = 0, e.data_type = cf;
  const t = e.state;
  return t.pending = 0, t.pending_out = 0, t.wrap < 0 && (t.wrap = -t.wrap), t.status = t.wrap === 2 ? Go : t.wrap ? Ot : ut, e.adler = t.wrap === 2 ? 0 : 1, t.last_flush = -2, Xu(t), Ve;
}, gl = (e) => {
  const t = pl(e);
  return t === Ve && Ef(e.state), t;
}, Bf = (e, t) => ka(e) || e.state.wrap !== 2 ? Ir : (e.state.gzhead = t, Ve), ml = (e, t, r, a, i, o) => {
  if (!e) return Ir;
  let c = 1;
  if (t === af && (t = 6), a < 0 ? (c = 0, a = -a) : a > 15 && (c = 2, a -= 16), i < 1 || i > uf || r !== wi || a < 8 || a > 15 || t < 0 || t > 9 || o < 0 || o > sf || a === 8 && c !== 1) return ft(e, Ir);
  a === 8 && (a = 9);
  const u = new Af();
  return e.state = u, u.strm = e, u.status = Ot, u.wrap = c, u.gzhead = null, u.w_bits = a, u.w_size = 1 << u.w_bits, u.w_mask = u.w_size - 1, u.hash_bits = i + 7, u.hash_size = 1 << u.hash_bits, u.hash_mask = u.hash_size - 1, u.hash_shift = ~~((u.hash_bits + ke - 1) / ke), u.window = new Uint8Array(u.w_size * 2), u.head = new Uint16Array(u.hash_size), u.prev = new Uint16Array(u.w_size), u.lit_bufsize = 1 << i + 6, u.pending_buf_size = u.lit_bufsize * 4, u.pending_buf = new Uint8Array(u.pending_buf_size), u.sym_buf = u.lit_bufsize, u.sym_end = (u.lit_bufsize - 1) * 3, u.level = t, u.strategy = o, u.method = r, gl(e);
}, zf = (e, t) => ml(e, t, wi, ff, df, lf), Sf = (e, t) => {
  if (ka(e) || t > Tn || t < 0) return e ? ft(e, Ir) : Ir;
  const r = e.state;
  if (!e.output || e.avail_in !== 0 && !e.input || r.status === Gt && t !== dr) return ft(e, e.avail_out === 0 ? Mi : Ir);
  const a = r.last_flush;
  if (r.last_flush = t, r.pending !== 0) {
    if (ir(e), e.avail_out === 0)
      return r.last_flush = -1, Ve;
  } else if (e.avail_in === 0 && Un(t) <= Un(a) && t !== dr) return ft(e, Mi);
  if (r.status === Gt && e.avail_in !== 0) return ft(e, Mi);
  if (r.status === Ot && r.wrap === 0 && (r.status = ut), r.status === Ot) {
    let i = wi + (r.w_bits - 8 << 4) << 8, o = -1;
    if (r.strategy >= xa || r.level < 2 ? o = 0 : r.level < 6 ? o = 1 : r.level === 6 ? o = 2 : o = 3, i |= o << 6, r.strstart !== 0 && (i |= bf), i += 31 - i % 31, Kt(r, i), r.strstart !== 0 && (Kt(r, e.adler >>> 16), Kt(r, e.adler & 65535)), e.adler = 1, r.status = ut, ir(e), r.pending !== 0)
      return r.last_flush = -1, Ve;
  }
  if (r.status === Go) {
    if (e.adler = 0, Ae(r, 31), Ae(r, 139), Ae(r, 8), r.gzhead)
      Ae(r, (r.gzhead.text ? 1 : 0) + (r.gzhead.hcrc ? 2 : 0) + (r.gzhead.extra ? 4 : 0) + (r.gzhead.name ? 8 : 0) + (r.gzhead.comment ? 16 : 0)), Ae(r, r.gzhead.time & 255), Ae(r, r.gzhead.time >> 8 & 255), Ae(r, r.gzhead.time >> 16 & 255), Ae(r, r.gzhead.time >> 24 & 255), Ae(r, r.level === 9 ? 2 : r.strategy >= xa || r.level < 2 ? 4 : 0), Ae(r, r.gzhead.os & 255), r.gzhead.extra && r.gzhead.extra.length && (Ae(r, r.gzhead.extra.length & 255), Ae(r, r.gzhead.extra.length >> 8 & 255)), r.gzhead.hcrc && (e.adler = Ge(e.adler, r.pending_buf, r.pending, 0)), r.gzindex = 0, r.status = co;
    else if (Ae(r, 0), Ae(r, 0), Ae(r, 0), Ae(r, 0), Ae(r, 0), Ae(r, r.level === 9 ? 2 : r.strategy >= xa || r.level < 2 ? 4 : 0), Ae(r, vf), r.status = ut, ir(e), r.pending !== 0)
      return r.last_flush = -1, Ve;
  }
  if (r.status === co) {
    if (r.gzhead.extra) {
      let i = r.pending, o = (r.gzhead.extra.length & 65535) - r.gzindex;
      for (; r.pending + o > r.pending_buf_size; ) {
        let u = r.pending_buf_size - r.pending;
        if (r.pending_buf.set(r.gzhead.extra.subarray(r.gzindex, r.gzindex + u), r.pending), r.pending = r.pending_buf_size, r.gzhead.hcrc && r.pending > i && (e.adler = Ge(e.adler, r.pending_buf, r.pending - i, i)), r.gzindex += u, ir(e), r.pending !== 0)
          return r.last_flush = -1, Ve;
        i = 0, o -= u;
      }
      let c = new Uint8Array(r.gzhead.extra);
      r.pending_buf.set(c.subarray(r.gzindex, r.gzindex + o), r.pending), r.pending += o, r.gzhead.hcrc && r.pending > i && (e.adler = Ge(e.adler, r.pending_buf, r.pending - i, i)), r.gzindex = 0;
    }
    r.status = uo;
  }
  if (r.status === uo) {
    if (r.gzhead.name) {
      let i = r.pending, o;
      do {
        if (r.pending === r.pending_buf_size) {
          if (r.gzhead.hcrc && r.pending > i && (e.adler = Ge(e.adler, r.pending_buf, r.pending - i, i)), ir(e), r.pending !== 0)
            return r.last_flush = -1, Ve;
          i = 0;
        }
        r.gzindex < r.gzhead.name.length ? o = r.gzhead.name.charCodeAt(r.gzindex++) & 255 : o = 0, Ae(r, o);
      } while (o !== 0);
      r.gzhead.hcrc && r.pending > i && (e.adler = Ge(e.adler, r.pending_buf, r.pending - i, i)), r.gzindex = 0;
    }
    r.status = fo;
  }
  if (r.status === fo) {
    if (r.gzhead.comment) {
      let i = r.pending, o;
      do {
        if (r.pending === r.pending_buf_size) {
          if (r.gzhead.hcrc && r.pending > i && (e.adler = Ge(e.adler, r.pending_buf, r.pending - i, i)), ir(e), r.pending !== 0)
            return r.last_flush = -1, Ve;
          i = 0;
        }
        r.gzindex < r.gzhead.comment.length ? o = r.gzhead.comment.charCodeAt(r.gzindex++) & 255 : o = 0, Ae(r, o);
      } while (o !== 0);
      r.gzhead.hcrc && r.pending > i && (e.adler = Ge(e.adler, r.pending_buf, r.pending - i, i));
    }
    r.status = ho;
  }
  if (r.status === ho) {
    if (r.gzhead.hcrc) {
      if (r.pending + 2 > r.pending_buf_size && (ir(e), r.pending !== 0))
        return r.last_flush = -1, Ve;
      Ae(r, e.adler & 255), Ae(r, e.adler >> 8 & 255), e.adler = 0;
    }
    if (r.status = ut, ir(e), r.pending !== 0)
      return r.last_flush = -1, Ve;
  }
  if (e.avail_in !== 0 || r.lookahead !== 0 || t !== et && r.status !== Gt) {
    let i = r.level === 0 ? hl(r, t) : r.strategy === xa ? kf(r, t) : r.strategy === nf ? _f(r, t) : Vt[r.level].func(r, t);
    if ((i === bt || i === Mt) && (r.status = Gt), i === Qe || i === bt)
      return e.avail_out === 0 && (r.last_flush = -1), Ve;
    if (i === Ct && (t === ef ? Qu(r) : t !== Tn && (so(r, 0, 0, !1), t === rf && (Gr(r.head), r.lookahead === 0 && (r.strstart = 0, r.block_start = 0, r.insert = 0))), ir(e), e.avail_out === 0))
      return r.last_flush = -1, Ve;
  }
  return t !== dr ? Ve : r.wrap <= 0 ? On : (r.wrap === 2 ? (Ae(r, e.adler & 255), Ae(r, e.adler >> 8 & 255), Ae(r, e.adler >> 16 & 255), Ae(r, e.adler >> 24 & 255), Ae(r, e.total_in & 255), Ae(r, e.total_in >> 8 & 255), Ae(r, e.total_in >> 16 & 255), Ae(r, e.total_in >> 24 & 255)) : (Kt(r, e.adler >>> 16), Kt(r, e.adler & 65535)), ir(e), r.wrap > 0 && (r.wrap = -r.wrap), r.pending !== 0 ? Ve : On);
}, If = (e) => {
  if (ka(e)) return Ir;
  const t = e.state.status;
  return e.state = null, t === ut ? ft(e, tf) : Ve;
}, xf = (e, t) => {
  let r = t.length;
  if (ka(e)) return Ir;
  const a = e.state, i = a.wrap;
  if (i === 2 || i === 1 && a.status !== Ot || a.lookahead) return Ir;
  if (i === 1 && (e.adler = ha(e.adler, t, r, 0)), a.wrap = 0, r >= a.w_size) {
    i === 0 && (Gr(a.head), a.strstart = 0, a.block_start = 0, a.insert = 0);
    let p = new Uint8Array(a.w_size);
    p.set(t.subarray(r - a.w_size, r), 0), t = p, r = a.w_size;
  }
  const o = e.avail_in, c = e.next_in, u = e.input;
  for (e.avail_in = r, e.next_in = 0, e.input = t, Ut(a); a.lookahead >= ke; ) {
    let p = a.strstart, h = a.lookahead - (ke - 1);
    do
      a.ins_h = rt(a, a.ins_h, a.window[p + ke - 1]), a.prev[p & a.w_mask] = a.head[a.ins_h], a.head[a.ins_h] = p, p++;
    while (--h);
    a.strstart = p, a.lookahead = ke - 1, Ut(a);
  }
  return a.strstart += a.lookahead, a.block_start = a.strstart, a.insert = a.lookahead, a.lookahead = 0, a.match_length = a.prev_length = ke - 1, a.match_available = 0, e.next_in = c, e.input = u, e.avail_in = o, a.wrap = i, Ve;
}, ta = {
  deflateInit: zf,
  deflateInit2: ml,
  deflateReset: gl,
  deflateResetKeep: pl,
  deflateSetHeader: Bf,
  deflate: Sf,
  deflateEnd: If,
  deflateSetDictionary: xf,
  deflateInfo: "pako deflate (from Nodeca project)"
}, jf = (e, t) => Object.prototype.hasOwnProperty.call(e, t), Tf = function(e) {
  const t = Array.prototype.slice.call(arguments, 1);
  for (; t.length; ) {
    const r = t.shift();
    if (r) {
      if (typeof r != "object") throw new TypeError(r + "must be non-object");
      for (const a in r) jf(r, a) && (e[a] = r[a]);
    }
  }
  return e;
}, Of = (e) => {
  let t = 0;
  for (let a = 0, i = e.length; a < i; a++) t += e[a].length;
  const r = new Uint8Array(t);
  for (let a = 0, i = 0, o = e.length; a < o; a++) {
    let c = e[a];
    r.set(c, i), i += c.length;
  }
  return r;
}, _i = {
  assign: Tf,
  flattenChunks: Of
}, bl = !0;
try {
  String.fromCharCode.apply(null, new Uint8Array(1));
} catch {
  bl = !1;
}
var pa = new Uint8Array(256);
for (let e = 0; e < 256; e++) pa[e] = e >= 252 ? 6 : e >= 248 ? 5 : e >= 240 ? 4 : e >= 224 ? 3 : e >= 192 ? 2 : 1;
pa[254] = pa[254] = 1;
var Uf = (e) => {
  if (typeof TextEncoder == "function" && TextEncoder.prototype.encode) return new TextEncoder().encode(e);
  let t, r, a, i, o, c = e.length, u = 0;
  for (i = 0; i < c; i++)
    r = e.charCodeAt(i), (r & 64512) === 55296 && i + 1 < c && (a = e.charCodeAt(i + 1), (a & 64512) === 56320 && (r = 65536 + (r - 55296 << 10) + (a - 56320), i++)), u += r < 128 ? 1 : r < 2048 ? 2 : r < 65536 ? 3 : 4;
  for (t = new Uint8Array(u), o = 0, i = 0; o < u; i++)
    r = e.charCodeAt(i), (r & 64512) === 55296 && i + 1 < c && (a = e.charCodeAt(i + 1), (a & 64512) === 56320 && (r = 65536 + (r - 55296 << 10) + (a - 56320), i++)), r < 128 ? t[o++] = r : r < 2048 ? (t[o++] = 192 | r >>> 6, t[o++] = 128 | r & 63) : r < 65536 ? (t[o++] = 224 | r >>> 12, t[o++] = 128 | r >>> 6 & 63, t[o++] = 128 | r & 63) : (t[o++] = 240 | r >>> 18, t[o++] = 128 | r >>> 12 & 63, t[o++] = 128 | r >>> 6 & 63, t[o++] = 128 | r & 63);
  return t;
}, Pf = (e, t) => {
  if (t < 65534 && e.subarray && bl)
    return String.fromCharCode.apply(null, e.length === t ? e : e.subarray(0, t));
  let r = "";
  for (let a = 0; a < t; a++) r += String.fromCharCode(e[a]);
  return r;
}, Rf = (e, t) => {
  const r = t || e.length;
  if (typeof TextDecoder == "function" && TextDecoder.prototype.decode) return new TextDecoder().decode(e.subarray(0, t));
  let a, i;
  const o = new Array(r * 2);
  for (i = 0, a = 0; a < r; ) {
    let c = e[a++];
    if (c < 128) {
      o[i++] = c;
      continue;
    }
    let u = pa[c];
    if (u > 4) {
      o[i++] = 65533, a += u - 1;
      continue;
    }
    for (c &= u === 2 ? 31 : u === 3 ? 15 : 7; u > 1 && a < r; )
      c = c << 6 | e[a++] & 63, u--;
    if (u > 1) {
      o[i++] = 65533;
      continue;
    }
    c < 65536 ? o[i++] = c : (c -= 65536, o[i++] = 55296 | c >> 10 & 1023, o[i++] = 56320 | c & 1023);
  }
  return Pf(o, i);
}, Lf = (e, t) => {
  t = t || e.length, t > e.length && (t = e.length);
  let r = t - 1;
  for (; r >= 0 && (e[r] & 192) === 128; ) r--;
  return r < 0 || r === 0 ? t : r + pa[e[r]] > t ? r : t;
}, ga = {
  string2buf: Uf,
  buf2string: Rf,
  utf8border: Lf
};
function Nf() {
  this.input = null, this.next_in = 0, this.avail_in = 0, this.total_in = 0, this.output = null, this.next_out = 0, this.avail_out = 0, this.total_out = 0, this.msg = "", this.state = null, this.data_type = 2, this.adler = 0;
}
var vl = Nf, yl = Object.prototype.toString, { Z_NO_FLUSH: Cf, Z_SYNC_FLUSH: Mf, Z_FULL_FLUSH: qf, Z_FINISH: Df, Z_OK: oi, Z_STREAM_END: Ff, Z_DEFAULT_COMPRESSION: $f, Z_DEFAULT_STRATEGY: Kf, Z_DEFLATED: Hf } = wt;
function Ea(e) {
  this.options = _i.assign({
    level: $f,
    method: Hf,
    chunkSize: 16384,
    windowBits: 15,
    memLevel: 8,
    strategy: Kf
  }, e || {});
  let t = this.options;
  t.raw && t.windowBits > 0 ? t.windowBits = -t.windowBits : t.gzip && t.windowBits > 0 && t.windowBits < 16 && (t.windowBits += 16), this.err = 0, this.msg = "", this.ended = !1, this.chunks = [], this.strm = new vl(), this.strm.avail_out = 0;
  let r = ta.deflateInit2(this.strm, t.level, t.method, t.windowBits, t.memLevel, t.strategy);
  if (r !== oi) throw new Error(mt[r]);
  if (t.header && ta.deflateSetHeader(this.strm, t.header), t.dictionary) {
    let a;
    if (typeof t.dictionary == "string" ? a = ga.string2buf(t.dictionary) : yl.call(t.dictionary) === "[object ArrayBuffer]" ? a = new Uint8Array(t.dictionary) : a = t.dictionary, r = ta.deflateSetDictionary(this.strm, a), r !== oi) throw new Error(mt[r]);
    this._dict_set = !0;
  }
}
Ea.prototype.push = function(e, t) {
  const r = this.strm, a = this.options.chunkSize;
  let i, o;
  if (this.ended) return !1;
  for (t === ~~t ? o = t : o = t === !0 ? Df : Cf, typeof e == "string" ? r.input = ga.string2buf(e) : yl.call(e) === "[object ArrayBuffer]" ? r.input = new Uint8Array(e) : r.input = e, r.next_in = 0, r.avail_in = r.input.length; ; ) {
    if (r.avail_out === 0 && (r.output = new Uint8Array(a), r.next_out = 0, r.avail_out = a), (o === Mf || o === qf) && r.avail_out <= 6) {
      this.onData(r.output.subarray(0, r.next_out)), r.avail_out = 0;
      continue;
    }
    if (i = ta.deflate(r, o), i === Ff)
      return r.next_out > 0 && this.onData(r.output.subarray(0, r.next_out)), i = ta.deflateEnd(this.strm), this.onEnd(i), this.ended = !0, i === oi;
    if (r.avail_out === 0) {
      this.onData(r.output);
      continue;
    }
    if (o > 0 && r.next_out > 0) {
      this.onData(r.output.subarray(0, r.next_out)), r.avail_out = 0;
      continue;
    }
    if (r.avail_in === 0) break;
  }
  return !0;
};
Ea.prototype.onData = function(e) {
  this.chunks.push(e);
};
Ea.prototype.onEnd = function(e) {
  e === oi && (this.result = _i.flattenChunks(this.chunks)), this.chunks = [], this.err = e, this.msg = this.strm.msg;
};
function Vo(e, t) {
  const r = new Ea(t);
  if (r.push(e, !0), r.err) throw r.msg || mt[r.err];
  return r.result;
}
function Zf(e, t) {
  return t = t || {}, t.raw = !0, Vo(e, t);
}
function Gf(e, t) {
  return t = t || {}, t.gzip = !0, Vo(e, t);
}
var Vf = {
  Deflate: Ea,
  deflate: Vo,
  deflateRaw: Zf,
  gzip: Gf,
  constants: wt
}, ja = 16209, Yf = 16191, Wf = function(t, r) {
  let a, i, o, c, u, p, h, s, _, y, b, E, q, I, N, v, B, S, F, K, A, U, T, D;
  const V = t.state;
  a = t.next_in, T = t.input, i = a + (t.avail_in - 5), o = t.next_out, D = t.output, c = o - (r - t.avail_out), u = o + (t.avail_out - 257), p = V.dmax, h = V.wsize, s = V.whave, _ = V.wnext, y = V.window, b = V.hold, E = V.bits, q = V.lencode, I = V.distcode, N = (1 << V.lenbits) - 1, v = (1 << V.distbits) - 1;
  e: do {
    E < 15 && (b += T[a++] << E, E += 8, b += T[a++] << E, E += 8), B = q[b & N];
    r: for (; ; ) {
      if (S = B >>> 24, b >>>= S, E -= S, S = B >>> 16 & 255, S === 0) D[o++] = B & 65535;
      else if (S & 16) {
        F = B & 65535, S &= 15, S && (E < S && (b += T[a++] << E, E += 8), F += b & (1 << S) - 1, b >>>= S, E -= S), E < 15 && (b += T[a++] << E, E += 8, b += T[a++] << E, E += 8), B = I[b & v];
        t: for (; ; ) {
          if (S = B >>> 24, b >>>= S, E -= S, S = B >>> 16 & 255, S & 16) {
            if (K = B & 65535, S &= 15, E < S && (b += T[a++] << E, E += 8, E < S && (b += T[a++] << E, E += 8)), K += b & (1 << S) - 1, K > p) {
              t.msg = "invalid distance too far back", V.mode = ja;
              break e;
            }
            if (b >>>= S, E -= S, S = o - c, K > S) {
              if (S = K - S, S > s && V.sane) {
                t.msg = "invalid distance too far back", V.mode = ja;
                break e;
              }
              if (A = 0, U = y, _ === 0) {
                if (A += h - S, S < F) {
                  F -= S;
                  do
                    D[o++] = y[A++];
                  while (--S);
                  A = o - K, U = D;
                }
              } else if (_ < S) {
                if (A += h + _ - S, S -= _, S < F) {
                  F -= S;
                  do
                    D[o++] = y[A++];
                  while (--S);
                  if (A = 0, _ < F) {
                    S = _, F -= S;
                    do
                      D[o++] = y[A++];
                    while (--S);
                    A = o - K, U = D;
                  }
                }
              } else if (A += _ - S, S < F) {
                F -= S;
                do
                  D[o++] = y[A++];
                while (--S);
                A = o - K, U = D;
              }
              for (; F > 2; )
                D[o++] = U[A++], D[o++] = U[A++], D[o++] = U[A++], F -= 3;
              F && (D[o++] = U[A++], F > 1 && (D[o++] = U[A++]));
            } else {
              A = o - K;
              do
                D[o++] = D[A++], D[o++] = D[A++], D[o++] = D[A++], F -= 3;
              while (F > 2);
              F && (D[o++] = D[A++], F > 1 && (D[o++] = D[A++]));
            }
          } else if ((S & 64) === 0) {
            B = I[(B & 65535) + (b & (1 << S) - 1)];
            continue t;
          } else {
            t.msg = "invalid distance code", V.mode = ja;
            break e;
          }
          break;
        }
      } else if ((S & 64) === 0) {
        B = q[(B & 65535) + (b & (1 << S) - 1)];
        continue r;
      } else if (S & 32) {
        V.mode = Yf;
        break e;
      } else {
        t.msg = "invalid literal/length code", V.mode = ja;
        break e;
      }
      break;
    }
  } while (a < i && o < u);
  F = E >> 3, a -= F, E -= F << 3, b &= (1 << E) - 1, t.next_in = a, t.next_out = o, t.avail_in = a < i ? 5 + (i - a) : 5 - (a - i), t.avail_out = o < u ? 257 + (u - o) : 257 - (o - u), V.hold = b, V.bits = E;
}, At = 15, Pn = 852, Rn = 592, Ln = 0, Di = 1, Nn = 2, Xf = new Uint16Array([
  3,
  4,
  5,
  6,
  7,
  8,
  9,
  10,
  11,
  13,
  15,
  17,
  19,
  23,
  27,
  31,
  35,
  43,
  51,
  59,
  67,
  83,
  99,
  115,
  131,
  163,
  195,
  227,
  258,
  0,
  0
]), Jf = new Uint8Array([
  16,
  16,
  16,
  16,
  16,
  16,
  16,
  16,
  17,
  17,
  17,
  17,
  18,
  18,
  18,
  18,
  19,
  19,
  19,
  19,
  20,
  20,
  20,
  20,
  21,
  21,
  21,
  21,
  16,
  72,
  78
]), Qf = new Uint16Array([
  1,
  2,
  3,
  4,
  5,
  7,
  9,
  13,
  17,
  25,
  33,
  49,
  65,
  97,
  129,
  193,
  257,
  385,
  513,
  769,
  1025,
  1537,
  2049,
  3073,
  4097,
  6145,
  8193,
  12289,
  16385,
  24577,
  0,
  0
]), ed = new Uint8Array([
  16,
  16,
  16,
  16,
  17,
  17,
  18,
  18,
  19,
  19,
  20,
  20,
  21,
  21,
  22,
  22,
  23,
  23,
  24,
  24,
  25,
  25,
  26,
  26,
  27,
  27,
  28,
  28,
  29,
  29,
  64,
  64
]), rd = (e, t, r, a, i, o, c, u) => {
  const p = u.bits;
  let h = 0, s = 0, _ = 0, y = 0, b = 0, E = 0, q = 0, I = 0, N = 0, v = 0, B, S, F, K, A, U = null, T;
  const D = new Uint16Array(At + 1), V = new Uint16Array(At + 1);
  let z = null, j, P, M;
  for (h = 0; h <= At; h++) D[h] = 0;
  for (s = 0; s < a; s++) D[t[r + s]]++;
  for (b = p, y = At; y >= 1 && D[y] === 0; y--) ;
  if (b > y && (b = y), y === 0)
    return i[o++] = 20971520, i[o++] = 20971520, u.bits = 1, 0;
  for (_ = 1; _ < y && D[_] === 0; _++) ;
  for (b < _ && (b = _), I = 1, h = 1; h <= At; h++)
    if (I <<= 1, I -= D[h], I < 0) return -1;
  if (I > 0 && (e === Ln || y !== 1)) return -1;
  for (V[1] = 0, h = 1; h < At; h++) V[h + 1] = V[h] + D[h];
  for (s = 0; s < a; s++) t[r + s] !== 0 && (c[V[t[r + s]]++] = s);
  if (e === Ln ? (U = z = c, T = 20) : e === Di ? (U = Xf, z = Jf, T = 257) : (U = Qf, z = ed, T = 0), v = 0, s = 0, h = _, A = o, E = b, q = 0, F = -1, N = 1 << b, K = N - 1, e === Di && N > Pn || e === Nn && N > Rn) return 1;
  for (; ; ) {
    j = h - q, c[s] + 1 < T ? (P = 0, M = c[s]) : c[s] >= T ? (P = z[c[s] - T], M = U[c[s] - T]) : (P = 96, M = 0), B = 1 << h - q, S = 1 << E, _ = S;
    do
      S -= B, i[A + (v >> q) + S] = j << 24 | P << 16 | M | 0;
    while (S !== 0);
    for (B = 1 << h - 1; v & B; ) B >>= 1;
    if (B !== 0 ? (v &= B - 1, v += B) : v = 0, s++, --D[h] === 0) {
      if (h === y) break;
      h = t[r + c[s]];
    }
    if (h > b && (v & K) !== F) {
      for (q === 0 && (q = b), A += _, E = h - q, I = 1 << E; E + q < y && (I -= D[E + q], !(I <= 0)); )
        E++, I <<= 1;
      if (N += 1 << E, e === Di && N > Pn || e === Nn && N > Rn) return 1;
      F = v & K, i[F] = b << 24 | E << 16 | A - o | 0;
    }
  }
  return v !== 0 && (i[A + v] = h - q << 24 | 4194304), u.bits = b, 0;
}, aa = rd, td = 0, wl = 1, _l = 2, { Z_FINISH: Cn, Z_BLOCK: ad, Z_TREES: Ta, Z_OK: vt, Z_STREAM_END: id, Z_NEED_DICT: od, Z_STREAM_ERROR: hr, Z_DATA_ERROR: kl, Z_MEM_ERROR: El, Z_BUF_ERROR: nd, Z_DEFLATED: Mn } = wt, ki = 16180, qn = 16181, Dn = 16182, Fn = 16183, $n = 16184, Kn = 16185, Hn = 16186, Zn = 16187, Gn = 16188, Vn = 16189, ni = 16190, Tr = 16191, Fi = 16192, Yn = 16193, $i = 16194, Wn = 16195, Xn = 16196, Jn = 16197, Qn = 16198, Oa = 16199, Ua = 16200, es = 16201, rs = 16202, ts = 16203, as = 16204, is = 16205, Ki = 16206, os = 16207, ns = 16208, Ne = 16209, Al = 16210, Bl = 16211, sd = 852, ld = 592, cd = 15, ss = (e) => (e >>> 24 & 255) + (e >>> 8 & 65280) + ((e & 65280) << 8) + ((e & 255) << 24);
function ud() {
  this.strm = null, 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 Uint16Array(320), this.work = new Uint16Array(288), this.lendyn = null, this.distdyn = null, this.sane = 0, this.back = 0, this.was = 0;
}
var _t = (e) => {
  if (!e) return 1;
  const t = e.state;
  return !t || t.strm !== e || t.mode < ki || t.mode > Bl ? 1 : 0;
}, zl = (e) => {
  if (_t(e)) return hr;
  const t = e.state;
  return e.total_in = e.total_out = t.total = 0, e.msg = "", t.wrap && (e.adler = t.wrap & 1), t.mode = ki, t.last = 0, t.havedict = 0, t.flags = -1, t.dmax = 32768, t.head = null, t.hold = 0, t.bits = 0, t.lencode = t.lendyn = new Int32Array(sd), t.distcode = t.distdyn = new Int32Array(ld), t.sane = 1, t.back = -1, vt;
}, Sl = (e) => {
  if (_t(e)) return hr;
  const t = e.state;
  return t.wsize = 0, t.whave = 0, t.wnext = 0, zl(e);
}, Il = (e, t) => {
  let r;
  if (_t(e)) return hr;
  const a = e.state;
  return t < 0 ? (r = 0, t = -t) : (r = (t >> 4) + 5, t < 48 && (t &= 15)), t && (t < 8 || t > 15) ? hr : (a.window !== null && a.wbits !== t && (a.window = null), a.wrap = r, a.wbits = t, Sl(e));
}, xl = (e, t) => {
  if (!e) return hr;
  const r = new ud();
  e.state = r, r.strm = e, r.window = null, r.mode = ki;
  const a = Il(e, t);
  return a !== vt && (e.state = null), a;
}, fd = (e) => xl(e, cd), ls = !0, Hi, Zi, dd = (e) => {
  if (ls) {
    Hi = new Int32Array(512), Zi = new Int32Array(32);
    let t = 0;
    for (; t < 144; ) e.lens[t++] = 8;
    for (; t < 256; ) e.lens[t++] = 9;
    for (; t < 280; ) e.lens[t++] = 7;
    for (; t < 288; ) e.lens[t++] = 8;
    for (aa(wl, e.lens, 0, 288, Hi, 0, e.work, { bits: 9 }), t = 0; t < 32; ) e.lens[t++] = 5;
    aa(_l, e.lens, 0, 32, Zi, 0, e.work, { bits: 5 }), ls = !1;
  }
  e.lencode = Hi, e.lenbits = 9, e.distcode = Zi, e.distbits = 5;
}, jl = (e, t, r, a) => {
  let i;
  const o = e.state;
  return o.window === null && (o.wsize = 1 << o.wbits, o.wnext = 0, o.whave = 0, o.window = new Uint8Array(o.wsize)), a >= o.wsize ? (o.window.set(t.subarray(r - o.wsize, r), 0), o.wnext = 0, o.whave = o.wsize) : (i = o.wsize - o.wnext, i > a && (i = a), o.window.set(t.subarray(r - a, r - a + i), o.wnext), a -= i, a ? (o.window.set(t.subarray(r - a, r), 0), o.wnext = a, o.whave = o.wsize) : (o.wnext += i, o.wnext === o.wsize && (o.wnext = 0), o.whave < o.wsize && (o.whave += i))), 0;
}, hd = (e, t) => {
  let r, a, i, o, c, u, p, h, s, _, y, b, E, q, I = 0, N, v, B, S, F, K, A, U;
  const T = new Uint8Array(4);
  let D, V;
  const z = new Uint8Array([
    16,
    17,
    18,
    0,
    8,
    7,
    9,
    6,
    10,
    5,
    11,
    4,
    12,
    3,
    13,
    2,
    14,
    1,
    15
  ]);
  if (_t(e) || !e.output || !e.input && e.avail_in !== 0) return hr;
  r = e.state, r.mode === Tr && (r.mode = Fi), c = e.next_out, i = e.output, p = e.avail_out, o = e.next_in, a = e.input, u = e.avail_in, h = r.hold, s = r.bits, _ = u, y = p, U = vt;
  e: for (; ; ) switch (r.mode) {
    case ki:
      if (r.wrap === 0) {
        r.mode = Fi;
        break;
      }
      for (; s < 16; ) {
        if (u === 0) break e;
        u--, h += a[o++] << s, s += 8;
      }
      if (r.wrap & 2 && h === 35615) {
        r.wbits === 0 && (r.wbits = 15), r.check = 0, T[0] = h & 255, T[1] = h >>> 8 & 255, r.check = Ge(r.check, T, 2, 0), h = 0, s = 0, r.mode = qn;
        break;
      }
      if (r.head && (r.head.done = !1), !(r.wrap & 1) || (((h & 255) << 8) + (h >> 8)) % 31) {
        e.msg = "incorrect header check", r.mode = Ne;
        break;
      }
      if ((h & 15) !== Mn) {
        e.msg = "unknown compression method", r.mode = Ne;
        break;
      }
      if (h >>>= 4, s -= 4, A = (h & 15) + 8, r.wbi