@univerjs-pro/exchange-client 0.4.2-nightly.202410291606 → 0.4.2-nightly.202410310419

package/lib/exchange.service-j28_A1tl.mjs

@@ -0,0 +1,2481 @@
+var _i = Object.defineProperty;
+var fi = (e, n, t) => n in e ? _i(e, n, { enumerable: !0, configurable: !0, writable: !0, value: t }) : e[n] = t;
+var $e = (e, n, t) => fi(e, typeof n != "symbol" ? n + "" : n, t);
+import { createIdentifier as mn, Inject as Rn, IConfigService as kn, Disposable as ci } from "@univerjs/core";
+import { transformWorkbookDataToSnapshot as hi, getSheetBlocksFromSnapshot as di, b64EncodeUnicode as dt, textDecoder as Ke, transformSnapshotToDocumentData as ui, b64DecodeUnicode as pi, transformSnapshotToWorkbookData as gi, textEncoder as Ei } from "@univerjs-pro/collaboration";
+import { Subject as wi } from "rxjs";
+import { HTTPService as bi } from "@univerjs/network";
+const te = "exchange-client.config", ns = {};
+var S = /* @__PURE__ */ ((e) => (e[e.UNDEFINED = 0] = "UNDEFINED", e[e.OK = 1] = "OK", e[e.INTERNAL_ERROR = 2] = "INTERNAL_ERROR", e[e.PERMISSION_DENIED = 3] = "PERMISSION_DENIED", e[e.NOT_FOUND = 4] = "NOT_FOUND", e[e.UNAUTHENTICATED = 5] = "UNAUTHENTICATED", e[e.ALREADY_EXISTS = 6] = "ALREADY_EXISTS", e[e.INVALID_ARGUMENT = 7] = "INVALID_ARGUMENT", e[e.TOO_MANY_REQUESTS = 8] = "TOO_MANY_REQUESTS", e[e.COMPLETION_FINISHED = 9] = "COMPLETION_FINISHED", e[e.CHANGESET_REVISION_CONFILICT = 5001] = "CHANGESET_REVISION_CONFILICT", e[e.SNAPSHOT_INVALID_SNAPSHOT = 6001] = "SNAPSHOT_INVALID_SNAPSHOT", e[e.SNAPSHOT_HAS_BEEN_REMOVED = 6002] = "SNAPSHOT_HAS_BEEN_REMOVED", e[e.ENSURE_SNAPSHOT_EXECUTION = 6003] = "ENSURE_SNAPSHOT_EXECUTION", e[e.APPLY_REJECT = 7001] = "APPLY_REJECT", e[e.APPLY_NON_SEQUENTIAL_REVISION = 7002] = "APPLY_NON_SEQUENTIAL_REVISION", e[e.APPLY_REVISION_CONFILICT = 7003] = "APPLY_REVISION_CONFILICT", e[e.APPLY_PERMISSION_DENIED = 7004] = "APPLY_PERMISSION_DENIED", e[e.APPLY_DUPLICATED = 7005] = "APPLY_DUPLICATED", e[e.CONNECTOR_DATA_TOO_LARGE = 8001] = "CONNECTOR_DATA_TOO_LARGE", e[e.LICENSE_MAX_UNITS_EXCEEDED = 9001] = "LICENSE_MAX_UNITS_EXCEEDED", e[e.LICENSE_MAX_MEMBERS_PER_UNIT_EXCEEDED = 9002] = "LICENSE_MAX_MEMBERS_PER_UNIT_EXCEEDED", e[e.LICENSE_IMPORT_SIZE_EXCEEDED = 9003] = "LICENSE_IMPORT_SIZE_EXCEEDED", e[e.LICENSE_EXPORT_SIZE_EXCEEDED = 9004] = "LICENSE_EXPORT_SIZE_EXCEEDED", e[e.LICENSE_DISTRO_REJECTED = 9005] = "LICENSE_DISTRO_REJECTED", e[e.YUUMI_UNABLE_LOAD_URL = 10001] = "YUUMI_UNABLE_LOAD_URL", e[e.YUUMI_URL_COL_OUT_OF_RANGE = 10002] = "YUUMI_URL_COL_OUT_OF_RANGE", e[e.YUUMI_RATE_OVER_LIMIT = 10003] = "YUUMI_RATE_OVER_LIMIT", e[e.YUUMI_SUBSCRIPTION_NOT_FOUND = 10004] = "YUUMI_SUBSCRIPTION_NOT_FOUND", e[e.UNRECOGNIZED = -1] = "UNRECOGNIZED", e))(S || {}), U = /* @__PURE__ */ ((e) => (e[e.UNIVER_UNKNOWN = 0] = "UNIVER_UNKNOWN", e[e.UNIVER_DOC = 1] = "UNIVER_DOC", e[e.UNIVER_SHEET = 2] = "UNIVER_SHEET", e[e.UNIVER_SLIDE = 3] = "UNIVER_SLIDE", e[e.UNIVER_PROJECT = 4] = "UNIVER_PROJECT", e[e.UNRECOGNIZED = -1] = "UNRECOGNIZED", e))(U || {}), In = /* @__PURE__ */ ((e) => (e[e.Undefined = 0] = "Undefined", e[e.HttpImport = 1] = "HttpImport", e[e.HttpExport = 2] = "HttpExport", e[e.UnitEmbedded = 3] = "UnitEmbedded", e[e.UnitSnapshot = 4] = "UnitSnapshot", e[e.UNRECOGNIZED = -1] = "UNRECOGNIZED", e))(In || {});
+/*! pako 2.1.0 https://github.com/nodeca/pako @license (MIT AND Zlib) */
+const xi = 4, Ut = 0, Ot = 1, Si = 2;
+function pe(e) {
+  let n = e.length;
+  for (; --n >= 0; )
+    e[n] = 0;
+}
+const vi = 0, Nn = 1, mi = 2, Ri = 3, ki = 258, mt = 29, Oe = 256, Re = Oe + 1 + mt, he = 30, Rt = 19, Dn = 2 * Re + 1, ne = 15, Qe = 16, Ii = 7, kt = 256, Tn = 16, yn = 17, Un = 18, ut = (
+  /* extra bits for each length code */
+  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])
+), Ge = (
+  /* extra bits for each distance code */
+  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])
+), Ni = (
+  /* extra bits for each bit length code */
+  new Uint8Array([0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 3, 7])
+), On = new Uint8Array([16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15]), Di = 512, V = new Array((Re + 2) * 2);
+pe(V);
+const Se = new Array(he * 2);
+pe(Se);
+const ke = new Array(Di);
+pe(ke);
+const Ie = new Array(ki - Ri + 1);
+pe(Ie);
+const It = new Array(mt);
+pe(It);
+const Xe = new Array(he);
+pe(Xe);
+function et(e, n, t, i, r) {
+  this.static_tree = e, this.extra_bits = n, this.extra_base = t, this.elems = i, this.max_length = r, this.has_stree = e && e.length;
+}
+let An, Ln, zn;
+function tt(e, n) {
+  this.dyn_tree = e, this.max_code = 0, this.stat_desc = n;
+}
+const Cn = (e) => e < 256 ? ke[e] : ke[256 + (e >>> 7)], Ne = (e, n) => {
+  e.pending_buf[e.pending++] = n & 255, e.pending_buf[e.pending++] = n >>> 8 & 255;
+}, C = (e, n, t) => {
+  e.bi_valid > Qe - t ? (e.bi_buf |= n << e.bi_valid & 65535, Ne(e, e.bi_buf), e.bi_buf = n >> Qe - e.bi_valid, e.bi_valid += t - Qe) : (e.bi_buf |= n << e.bi_valid & 65535, e.bi_valid += t);
+}, H = (e, n, t) => {
+  C(
+    e,
+    t[n * 2],
+    t[n * 2 + 1]
+    /*.Len*/
+  );
+}, Zn = (e, n) => {
+  let t = 0;
+  do
+    t |= e & 1, e >>>= 1, t <<= 1;
+  while (--n > 0);
+  return t >>> 1;
+}, Ti = (e) => {
+  e.bi_valid === 16 ? (Ne(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);
+}, yi = (e, n) => {
+  const t = n.dyn_tree, i = n.max_code, r = n.stat_desc.static_tree, a = n.stat_desc.has_stree, l = n.stat_desc.extra_bits, s = n.stat_desc.extra_base, c = n.stat_desc.max_length;
+  let o, _, E, h, f, u, y = 0;
+  for (h = 0; h <= ne; h++)
+    e.bl_count[h] = 0;
+  for (t[e.heap[e.heap_max] * 2 + 1] = 0, o = e.heap_max + 1; o < Dn; o++)
+    _ = e.heap[o], h = t[t[_ * 2 + 1] * 2 + 1] + 1, h > c && (h = c, y++), t[_ * 2 + 1] = h, !(_ > i) && (e.bl_count[h]++, f = 0, _ >= s && (f = l[_ - s]), u = t[_ * 2], e.opt_len += u * (h + f), a && (e.static_len += u * (r[_ * 2 + 1] + f)));
+  if (y !== 0) {
+    do {
+      for (h = c - 1; e.bl_count[h] === 0; )
+        h--;
+      e.bl_count[h]--, e.bl_count[h + 1] += 2, e.bl_count[c]--, y -= 2;
+    } while (y > 0);
+    for (h = c; h !== 0; h--)
+      for (_ = e.bl_count[h]; _ !== 0; )
+        E = e.heap[--o], !(E > i) && (t[E * 2 + 1] !== h && (e.opt_len += (h - t[E * 2 + 1]) * t[E * 2], t[E * 2 + 1] = h), _--);
+  }
+}, $n = (e, n, t) => {
+  const i = new Array(ne + 1);
+  let r = 0, a, l;
+  for (a = 1; a <= ne; a++)
+    r = r + t[a - 1] << 1, i[a] = r;
+  for (l = 0; l <= n; l++) {
+    let s = e[l * 2 + 1];
+    s !== 0 && (e[l * 2] = Zn(i[s]++, s));
+  }
+}, Ui = () => {
+  let e, n, t, i, r;
+  const a = new Array(ne + 1);
+  for (t = 0, i = 0; i < mt - 1; i++)
+    for (It[i] = t, e = 0; e < 1 << ut[i]; e++)
+      Ie[t++] = i;
+  for (Ie[t - 1] = i, r = 0, i = 0; i < 16; i++)
+    for (Xe[i] = r, e = 0; e < 1 << Ge[i]; e++)
+      ke[r++] = i;
+  for (r >>= 7; i < he; i++)
+    for (Xe[i] = r << 7, e = 0; e < 1 << Ge[i] - 7; e++)
+      ke[256 + r++] = i;
+  for (n = 0; n <= ne; n++)
+    a[n] = 0;
+  for (e = 0; e <= 143; )
+    V[e * 2 + 1] = 8, e++, a[8]++;
+  for (; e <= 255; )
+    V[e * 2 + 1] = 9, e++, a[9]++;
+  for (; e <= 279; )
+    V[e * 2 + 1] = 7, e++, a[7]++;
+  for (; e <= 287; )
+    V[e * 2 + 1] = 8, e++, a[8]++;
+  for ($n(V, Re + 1, a), e = 0; e < he; e++)
+    Se[e * 2 + 1] = 5, Se[e * 2] = Zn(e, 5);
+  An = new et(V, ut, Oe + 1, Re, ne), Ln = new et(Se, Ge, 0, he, ne), zn = new et(new Array(0), Ni, 0, Rt, Ii);
+}, Mn = (e) => {
+  let n;
+  for (n = 0; n < Re; n++)
+    e.dyn_ltree[n * 2] = 0;
+  for (n = 0; n < he; n++)
+    e.dyn_dtree[n * 2] = 0;
+  for (n = 0; n < Rt; n++)
+    e.bl_tree[n * 2] = 0;
+  e.dyn_ltree[kt * 2] = 1, e.opt_len = e.static_len = 0, e.sym_next = e.matches = 0;
+}, Pn = (e) => {
+  e.bi_valid > 8 ? Ne(e, e.bi_buf) : e.bi_valid > 0 && (e.pending_buf[e.pending++] = e.bi_buf), e.bi_buf = 0, e.bi_valid = 0;
+}, At = (e, n, t, i) => {
+  const r = n * 2, a = t * 2;
+  return e[r] < e[a] || e[r] === e[a] && i[n] <= i[t];
+}, nt = (e, n, t) => {
+  const i = e.heap[t];
+  let r = t << 1;
+  for (; r <= e.heap_len && (r < e.heap_len && At(n, e.heap[r + 1], e.heap[r], e.depth) && r++, !At(n, i, e.heap[r], e.depth)); )
+    e.heap[t] = e.heap[r], t = r, r <<= 1;
+  e.heap[t] = i;
+}, Lt = (e, n, t) => {
+  let i, r, a = 0, l, s;
+  if (e.sym_next !== 0)
+    do
+      i = e.pending_buf[e.sym_buf + a++] & 255, i += (e.pending_buf[e.sym_buf + a++] & 255) << 8, r = e.pending_buf[e.sym_buf + a++], i === 0 ? H(e, r, n) : (l = Ie[r], H(e, l + Oe + 1, n), s = ut[l], s !== 0 && (r -= It[l], C(e, r, s)), i--, l = Cn(i), H(e, l, t), s = Ge[l], s !== 0 && (i -= Xe[l], C(e, i, s)));
+    while (a < e.sym_next);
+  H(e, kt, n);
+}, pt = (e, n) => {
+  const t = n.dyn_tree, i = n.stat_desc.static_tree, r = n.stat_desc.has_stree, a = n.stat_desc.elems;
+  let l, s, c = -1, o;
+  for (e.heap_len = 0, e.heap_max = Dn, l = 0; l < a; l++)
+    t[l * 2] !== 0 ? (e.heap[++e.heap_len] = c = l, e.depth[l] = 0) : t[l * 2 + 1] = 0;
+  for (; e.heap_len < 2; )
+    o = e.heap[++e.heap_len] = c < 2 ? ++c : 0, t[o * 2] = 1, e.depth[o] = 0, e.opt_len--, r && (e.static_len -= i[o * 2 + 1]);
+  for (n.max_code = c, l = e.heap_len >> 1; l >= 1; l--)
+    nt(e, t, l);
+  o = a;
+  do
+    l = e.heap[
+      1
+      /*SMALLEST*/
+    ], e.heap[
+      1
+      /*SMALLEST*/
+    ] = e.heap[e.heap_len--], nt(
+      e,
+      t,
+      1
+      /*SMALLEST*/
+    ), s = e.heap[
+      1
+      /*SMALLEST*/
+    ], e.heap[--e.heap_max] = l, e.heap[--e.heap_max] = s, t[o * 2] = t[l * 2] + t[s * 2], e.depth[o] = (e.depth[l] >= e.depth[s] ? e.depth[l] : e.depth[s]) + 1, t[l * 2 + 1] = t[s * 2 + 1] = o, e.heap[
+      1
+      /*SMALLEST*/
+    ] = o++, nt(
+      e,
+      t,
+      1
+      /*SMALLEST*/
+    );
+  while (e.heap_len >= 2);
+  e.heap[--e.heap_max] = e.heap[
+    1
+    /*SMALLEST*/
+  ], yi(e, n), $n(t, c, e.bl_count);
+}, zt = (e, n, t) => {
+  let i, r = -1, a, l = n[0 * 2 + 1], s = 0, c = 7, o = 4;
+  for (l === 0 && (c = 138, o = 3), n[(t + 1) * 2 + 1] = 65535, i = 0; i <= t; i++)
+    a = l, l = n[(i + 1) * 2 + 1], !(++s < c && a === l) && (s < o ? e.bl_tree[a * 2] += s : a !== 0 ? (a !== r && e.bl_tree[a * 2]++, e.bl_tree[Tn * 2]++) : s <= 10 ? e.bl_tree[yn * 2]++ : e.bl_tree[Un * 2]++, s = 0, r = a, l === 0 ? (c = 138, o = 3) : a === l ? (c = 6, o = 3) : (c = 7, o = 4));
+}, Ct = (e, n, t) => {
+  let i, r = -1, a, l = n[0 * 2 + 1], s = 0, c = 7, o = 4;
+  for (l === 0 && (c = 138, o = 3), i = 0; i <= t; i++)
+    if (a = l, l = n[(i + 1) * 2 + 1], !(++s < c && a === l)) {
+      if (s < o)
+        do
+          H(e, a, e.bl_tree);
+        while (--s !== 0);
+      else a !== 0 ? (a !== r && (H(e, a, e.bl_tree), s--), H(e, Tn, e.bl_tree), C(e, s - 3, 2)) : s <= 10 ? (H(e, yn, e.bl_tree), C(e, s - 3, 3)) : (H(e, Un, e.bl_tree), C(e, s - 11, 7));
+      s = 0, r = a, l === 0 ? (c = 138, o = 3) : a === l ? (c = 6, o = 3) : (c = 7, o = 4);
+    }
+}, Oi = (e) => {
+  let n;
+  for (zt(e, e.dyn_ltree, e.l_desc.max_code), zt(e, e.dyn_dtree, e.d_desc.max_code), pt(e, e.bl_desc), n = Rt - 1; n >= 3 && e.bl_tree[On[n] * 2 + 1] === 0; n--)
+    ;
+  return e.opt_len += 3 * (n + 1) + 5 + 5 + 4, n;
+}, Ai = (e, n, t, i) => {
+  let r;
+  for (C(e, n - 257, 5), C(e, t - 1, 5), C(e, i - 4, 4), r = 0; r < i; r++)
+    C(e, e.bl_tree[On[r] * 2 + 1], 3);
+  Ct(e, e.dyn_ltree, n - 1), Ct(e, e.dyn_dtree, t - 1);
+}, Li = (e) => {
+  let n = 4093624447, t;
+  for (t = 0; t <= 31; t++, n >>>= 1)
+    if (n & 1 && e.dyn_ltree[t * 2] !== 0)
+      return Ut;
+  if (e.dyn_ltree[9 * 2] !== 0 || e.dyn_ltree[10 * 2] !== 0 || e.dyn_ltree[13 * 2] !== 0)
+    return Ot;
+  for (t = 32; t < Oe; t++)
+    if (e.dyn_ltree[t * 2] !== 0)
+      return Ot;
+  return Ut;
+};
+let Zt = !1;
+const zi = (e) => {
+  Zt || (Ui(), Zt = !0), e.l_desc = new tt(e.dyn_ltree, An), e.d_desc = new tt(e.dyn_dtree, Ln), e.bl_desc = new tt(e.bl_tree, zn), e.bi_buf = 0, e.bi_valid = 0, Mn(e);
+}, Fn = (e, n, t, i) => {
+  C(e, (vi << 1) + (i ? 1 : 0), 3), Pn(e), Ne(e, t), Ne(e, ~t), t && e.pending_buf.set(e.window.subarray(n, n + t), e.pending), e.pending += t;
+}, Ci = (e) => {
+  C(e, Nn << 1, 3), H(e, kt, V), Ti(e);
+}, Zi = (e, n, t, i) => {
+  let r, a, l = 0;
+  e.level > 0 ? (e.strm.data_type === Si && (e.strm.data_type = Li(e)), pt(e, e.l_desc), pt(e, e.d_desc), l = Oi(e), r = e.opt_len + 3 + 7 >>> 3, a = e.static_len + 3 + 7 >>> 3, a <= r && (r = a)) : r = a = t + 5, t + 4 <= r && n !== -1 ? Fn(e, n, t, i) : e.strategy === xi || a === r ? (C(e, (Nn << 1) + (i ? 1 : 0), 3), Lt(e, V, Se)) : (C(e, (mi << 1) + (i ? 1 : 0), 3), Ai(e, e.l_desc.max_code + 1, e.d_desc.max_code + 1, l + 1), Lt(e, e.dyn_ltree, e.dyn_dtree)), Mn(e), i && Pn(e);
+}, $i = (e, n, t) => (e.pending_buf[e.sym_buf + e.sym_next++] = n, e.pending_buf[e.sym_buf + e.sym_next++] = n >> 8, e.pending_buf[e.sym_buf + e.sym_next++] = t, n === 0 ? e.dyn_ltree[t * 2]++ : (e.matches++, n--, e.dyn_ltree[(Ie[t] + Oe + 1) * 2]++, e.dyn_dtree[Cn(n) * 2]++), e.sym_next === e.sym_end);
+var Mi = zi, Pi = Fn, Fi = Zi, Hi = $i, Bi = Ci, Gi = {
+  _tr_init: Mi,
+  _tr_stored_block: Pi,
+  _tr_flush_block: Fi,
+  _tr_tally: Hi,
+  _tr_align: Bi
+};
+const Ki = (e, n, t, i) => {
+  let r = e & 65535 | 0, a = e >>> 16 & 65535 | 0, l = 0;
+  for (; t !== 0; ) {
+    l = t > 2e3 ? 2e3 : t, t -= l;
+    do
+      r = r + n[i++] | 0, a = a + r | 0;
+    while (--l);
+    r %= 65521, a %= 65521;
+  }
+  return r | a << 16 | 0;
+};
+var De = Ki;
+const Xi = () => {
+  let e, n = [];
+  for (var t = 0; t < 256; t++) {
+    e = t;
+    for (var i = 0; i < 8; i++)
+      e = e & 1 ? 3988292384 ^ e >>> 1 : e >>> 1;
+    n[t] = e;
+  }
+  return n;
+}, Vi = new Uint32Array(Xi()), Yi = (e, n, t, i) => {
+  const r = Vi, a = i + t;
+  e ^= -1;
+  for (let l = i; l < a; l++)
+    e = e >>> 8 ^ r[(e ^ n[l]) & 255];
+  return e ^ -1;
+};
+var A = Yi, re = {
+  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) */
+}, le = {
+  /* 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
+};
+const { _tr_init: qi, _tr_stored_block: gt, _tr_flush_block: ji, _tr_tally: J, _tr_align: Ji } = Gi, {
+  Z_NO_FLUSH: W,
+  Z_PARTIAL_FLUSH: Wi,
+  Z_FULL_FLUSH: Qi,
+  Z_FINISH: M,
+  Z_BLOCK: $t,
+  Z_OK: L,
+  Z_STREAM_END: Mt,
+  Z_STREAM_ERROR: B,
+  Z_DATA_ERROR: ea,
+  Z_BUF_ERROR: it,
+  Z_DEFAULT_COMPRESSION: ta,
+  Z_FILTERED: na,
+  Z_HUFFMAN_ONLY: Me,
+  Z_RLE: ia,
+  Z_FIXED: aa,
+  Z_DEFAULT_STRATEGY: ra,
+  Z_UNKNOWN: oa,
+  Z_DEFLATED: qe
+} = le, sa = 9, la = 15, _a = 8, fa = 29, ca = 256, Et = ca + 1 + fa, ha = 30, da = 19, ua = 2 * Et + 1, pa = 15, v = 3, j = 258, G = j + v + 1, ga = 32, de = 42, Nt = 57, wt = 69, bt = 73, xt = 91, St = 103, ie = 113, be = 666, z = 1, ge = 2, oe = 3, Ee = 4, Ea = 3, ae = (e, n) => (e.msg = re[n], n), Pt = (e) => e * 2 - (e > 4 ? 9 : 0), q = (e) => {
+  let n = e.length;
+  for (; --n >= 0; )
+    e[n] = 0;
+}, wa = (e) => {
+  let n, t, i, r = e.w_size;
+  n = e.hash_size, i = n;
+  do
+    t = e.head[--i], e.head[i] = t >= r ? t - r : 0;
+  while (--n);
+  n = r, i = n;
+  do
+    t = e.prev[--i], e.prev[i] = t >= r ? t - r : 0;
+  while (--n);
+};
+let ba = (e, n, t) => (n << e.hash_shift ^ t) & e.hash_mask, Q = ba;
+const Z = (e) => {
+  const n = e.state;
+  let t = n.pending;
+  t > e.avail_out && (t = e.avail_out), t !== 0 && (e.output.set(n.pending_buf.subarray(n.pending_out, n.pending_out + t), e.next_out), e.next_out += t, n.pending_out += t, e.total_out += t, e.avail_out -= t, n.pending -= t, n.pending === 0 && (n.pending_out = 0));
+}, $ = (e, n) => {
+  ji(e, e.block_start >= 0 ? e.block_start : -1, e.strstart - e.block_start, n), e.block_start = e.strstart, Z(e.strm);
+}, I = (e, n) => {
+  e.pending_buf[e.pending++] = n;
+}, we = (e, n) => {
+  e.pending_buf[e.pending++] = n >>> 8 & 255, e.pending_buf[e.pending++] = n & 255;
+}, vt = (e, n, t, i) => {
+  let r = e.avail_in;
+  return r > i && (r = i), r === 0 ? 0 : (e.avail_in -= r, n.set(e.input.subarray(e.next_in, e.next_in + r), t), e.state.wrap === 1 ? e.adler = De(e.adler, n, r, t) : e.state.wrap === 2 && (e.adler = A(e.adler, n, r, t)), e.next_in += r, e.total_in += r, r);
+}, Hn = (e, n) => {
+  let t = e.max_chain_length, i = e.strstart, r, a, l = e.prev_length, s = e.nice_match;
+  const c = e.strstart > e.w_size - G ? e.strstart - (e.w_size - G) : 0, o = e.window, _ = e.w_mask, E = e.prev, h = e.strstart + j;
+  let f = o[i + l - 1], u = o[i + l];
+  e.prev_length >= e.good_match && (t >>= 2), s > e.lookahead && (s = e.lookahead);
+  do
+    if (r = n, !(o[r + l] !== u || o[r + l - 1] !== f || o[r] !== o[i] || o[++r] !== o[i + 1])) {
+      i += 2, r++;
+      do
+        ;
+      while (o[++i] === o[++r] && o[++i] === o[++r] && o[++i] === o[++r] && o[++i] === o[++r] && o[++i] === o[++r] && o[++i] === o[++r] && o[++i] === o[++r] && o[++i] === o[++r] && i < h);
+      if (a = j - (h - i), i = h - j, a > l) {
+        if (e.match_start = n, l = a, a >= s)
+          break;
+        f = o[i + l - 1], u = o[i + l];
+      }
+    }
+  while ((n = E[n & _]) > c && --t !== 0);
+  return l <= e.lookahead ? l : e.lookahead;
+}, ue = (e) => {
+  const n = e.w_size;
+  let t, i, r;
+  do {
+    if (i = e.window_size - e.lookahead - e.strstart, e.strstart >= n + (n - G) && (e.window.set(e.window.subarray(n, n + n - i), 0), e.match_start -= n, e.strstart -= n, e.block_start -= n, e.insert > e.strstart && (e.insert = e.strstart), wa(e), i += n), e.strm.avail_in === 0)
+      break;
+    if (t = vt(e.strm, e.window, e.strstart + e.lookahead, i), e.lookahead += t, e.lookahead + e.insert >= v)
+      for (r = e.strstart - e.insert, e.ins_h = e.window[r], e.ins_h = Q(e, e.ins_h, e.window[r + 1]); e.insert && (e.ins_h = Q(e, e.ins_h, e.window[r + v - 1]), e.prev[r & e.w_mask] = e.head[e.ins_h], e.head[e.ins_h] = r, r++, e.insert--, !(e.lookahead + e.insert < v)); )
+        ;
+  } while (e.lookahead < G && e.strm.avail_in !== 0);
+}, Bn = (e, n) => {
+  let t = e.pending_buf_size - 5 > e.w_size ? e.w_size : e.pending_buf_size - 5, i, r, a, l = 0, s = e.strm.avail_in;
+  do {
+    if (i = 65535, a = e.bi_valid + 42 >> 3, e.strm.avail_out < a || (a = e.strm.avail_out - a, r = e.strstart - e.block_start, i > r + e.strm.avail_in && (i = r + e.strm.avail_in), i > a && (i = a), i < t && (i === 0 && n !== M || n === W || i !== r + e.strm.avail_in)))
+      break;
+    l = n === M && i === r + e.strm.avail_in ? 1 : 0, gt(e, 0, 0, l), e.pending_buf[e.pending - 4] = i, e.pending_buf[e.pending - 3] = i >> 8, e.pending_buf[e.pending - 2] = ~i, e.pending_buf[e.pending - 1] = ~i >> 8, Z(e.strm), r && (r > i && (r = i), e.strm.output.set(e.window.subarray(e.block_start, e.block_start + r), e.strm.next_out), e.strm.next_out += r, e.strm.avail_out -= r, e.strm.total_out += r, e.block_start += r, i -= r), i && (vt(e.strm, e.strm.output, e.strm.next_out, i), e.strm.next_out += i, e.strm.avail_out -= i, e.strm.total_out += i);
+  } while (l === 0);
+  return s -= e.strm.avail_in, s && (s >= 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 <= s && (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 - s, e.strm.next_in), e.strstart), e.strstart += s, e.insert += s > e.w_size - e.insert ? e.w_size - e.insert : s), e.block_start = e.strstart), e.high_water < e.strstart && (e.high_water = e.strstart), l ? Ee : n !== W && n !== M && e.strm.avail_in === 0 && e.strstart === e.block_start ? ge : (a = e.window_size - e.strstart, e.strm.avail_in > a && 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++, a += e.w_size, e.insert > e.strstart && (e.insert = e.strstart)), a > e.strm.avail_in && (a = e.strm.avail_in), a && (vt(e.strm, e.window, e.strstart, a), e.strstart += a, e.insert += a > e.w_size - e.insert ? e.w_size - e.insert : a), e.high_water < e.strstart && (e.high_water = e.strstart), a = e.bi_valid + 42 >> 3, a = e.pending_buf_size - a > 65535 ? 65535 : e.pending_buf_size - a, t = a > e.w_size ? e.w_size : a, r = e.strstart - e.block_start, (r >= t || (r || n === M) && n !== W && e.strm.avail_in === 0 && r <= a) && (i = r > a ? a : r, l = n === M && e.strm.avail_in === 0 && i === r ? 1 : 0, gt(e, e.block_start, i, l), e.block_start += i, Z(e.strm)), l ? oe : z);
+}, at = (e, n) => {
+  let t, i;
+  for (; ; ) {
+    if (e.lookahead < G) {
+      if (ue(e), e.lookahead < G && n === W)
+        return z;
+      if (e.lookahead === 0)
+        break;
+    }
+    if (t = 0, e.lookahead >= v && (e.ins_h = Q(e, e.ins_h, e.window[e.strstart + v - 1]), t = e.prev[e.strstart & e.w_mask] = e.head[e.ins_h], e.head[e.ins_h] = e.strstart), t !== 0 && e.strstart - t <= e.w_size - G && (e.match_length = Hn(e, t)), e.match_length >= v)
+      if (i = J(e, e.strstart - e.match_start, e.match_length - v), e.lookahead -= e.match_length, e.match_length <= e.max_lazy_match && e.lookahead >= v) {
+        e.match_length--;
+        do
+          e.strstart++, e.ins_h = Q(e, e.ins_h, e.window[e.strstart + v - 1]), t = 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 = Q(e, e.ins_h, e.window[e.strstart + 1]);
+    else
+      i = J(e, 0, e.window[e.strstart]), e.lookahead--, e.strstart++;
+    if (i && ($(e, !1), e.strm.avail_out === 0))
+      return z;
+  }
+  return e.insert = e.strstart < v - 1 ? e.strstart : v - 1, n === M ? ($(e, !0), e.strm.avail_out === 0 ? oe : Ee) : e.sym_next && ($(e, !1), e.strm.avail_out === 0) ? z : ge;
+}, fe = (e, n) => {
+  let t, i, r;
+  for (; ; ) {
+    if (e.lookahead < G) {
+      if (ue(e), e.lookahead < G && n === W)
+        return z;
+      if (e.lookahead === 0)
+        break;
+    }
+    if (t = 0, e.lookahead >= v && (e.ins_h = Q(e, e.ins_h, e.window[e.strstart + v - 1]), t = 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 = v - 1, t !== 0 && e.prev_length < e.max_lazy_match && e.strstart - t <= e.w_size - G && (e.match_length = Hn(e, t), e.match_length <= 5 && (e.strategy === na || e.match_length === v && e.strstart - e.match_start > 4096) && (e.match_length = v - 1)), e.prev_length >= v && e.match_length <= e.prev_length) {
+      r = e.strstart + e.lookahead - v, i = J(e, e.strstart - 1 - e.prev_match, e.prev_length - v), e.lookahead -= e.prev_length - 1, e.prev_length -= 2;
+      do
+        ++e.strstart <= r && (e.ins_h = Q(e, e.ins_h, e.window[e.strstart + v - 1]), t = 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 = v - 1, e.strstart++, i && ($(e, !1), e.strm.avail_out === 0))
+        return z;
+    } else if (e.match_available) {
+      if (i = J(e, 0, e.window[e.strstart - 1]), i && $(e, !1), e.strstart++, e.lookahead--, e.strm.avail_out === 0)
+        return z;
+    } else
+      e.match_available = 1, e.strstart++, e.lookahead--;
+  }
+  return e.match_available && (i = J(e, 0, e.window[e.strstart - 1]), e.match_available = 0), e.insert = e.strstart < v - 1 ? e.strstart : v - 1, n === M ? ($(e, !0), e.strm.avail_out === 0 ? oe : Ee) : e.sym_next && ($(e, !1), e.strm.avail_out === 0) ? z : ge;
+}, xa = (e, n) => {
+  let t, i, r, a;
+  const l = e.window;
+  for (; ; ) {
+    if (e.lookahead <= j) {
+      if (ue(e), e.lookahead <= j && n === W)
+        return z;
+      if (e.lookahead === 0)
+        break;
+    }
+    if (e.match_length = 0, e.lookahead >= v && e.strstart > 0 && (r = e.strstart - 1, i = l[r], i === l[++r] && i === l[++r] && i === l[++r])) {
+      a = e.strstart + j;
+      do
+        ;
+      while (i === l[++r] && i === l[++r] && i === l[++r] && i === l[++r] && i === l[++r] && i === l[++r] && i === l[++r] && i === l[++r] && r < a);
+      e.match_length = j - (a - r), e.match_length > e.lookahead && (e.match_length = e.lookahead);
+    }
+    if (e.match_length >= v ? (t = J(e, 1, e.match_length - v), e.lookahead -= e.match_length, e.strstart += e.match_length, e.match_length = 0) : (t = J(e, 0, e.window[e.strstart]), e.lookahead--, e.strstart++), t && ($(e, !1), e.strm.avail_out === 0))
+      return z;
+  }
+  return e.insert = 0, n === M ? ($(e, !0), e.strm.avail_out === 0 ? oe : Ee) : e.sym_next && ($(e, !1), e.strm.avail_out === 0) ? z : ge;
+}, Sa = (e, n) => {
+  let t;
+  for (; ; ) {
+    if (e.lookahead === 0 && (ue(e), e.lookahead === 0)) {
+      if (n === W)
+        return z;
+      break;
+    }
+    if (e.match_length = 0, t = J(e, 0, e.window[e.strstart]), e.lookahead--, e.strstart++, t && ($(e, !1), e.strm.avail_out === 0))
+      return z;
+  }
+  return e.insert = 0, n === M ? ($(e, !0), e.strm.avail_out === 0 ? oe : Ee) : e.sym_next && ($(e, !1), e.strm.avail_out === 0) ? z : ge;
+};
+function F(e, n, t, i, r) {
+  this.good_length = e, this.max_lazy = n, this.nice_length = t, this.max_chain = i, this.func = r;
+}
+const xe = [
+  /*      good lazy nice chain */
+  new F(0, 0, 0, 0, Bn),
+  /* 0 store only */
+  new F(4, 4, 8, 4, at),
+  /* 1 max speed, no lazy matches */
+  new F(4, 5, 16, 8, at),
+  /* 2 */
+  new F(4, 6, 32, 32, at),
+  /* 3 */
+  new F(4, 4, 16, 16, fe),
+  /* 4 lazy matches */
+  new F(8, 16, 32, 32, fe),
+  /* 5 */
+  new F(8, 16, 128, 128, fe),
+  /* 6 */
+  new F(8, 32, 128, 256, fe),
+  /* 7 */
+  new F(32, 128, 258, 1024, fe),
+  /* 8 */
+  new F(32, 258, 258, 4096, fe)
+  /* 9 max compression */
+], va = (e) => {
+  e.window_size = 2 * e.w_size, q(e.head), e.max_lazy_match = xe[e.level].max_lazy, e.good_match = xe[e.level].good_length, e.nice_match = xe[e.level].nice_length, e.max_chain_length = xe[e.level].max_chain, e.strstart = 0, e.block_start = 0, e.lookahead = 0, e.insert = 0, e.match_length = e.prev_length = v - 1, e.match_available = 0, e.ins_h = 0;
+};
+function ma() {
+  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 = qe, 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(ua * 2), this.dyn_dtree = new Uint16Array((2 * ha + 1) * 2), this.bl_tree = new Uint16Array((2 * da + 1) * 2), q(this.dyn_ltree), q(this.dyn_dtree), q(this.bl_tree), this.l_desc = null, this.d_desc = null, this.bl_desc = null, this.bl_count = new Uint16Array(pa + 1), this.heap = new Uint16Array(2 * Et + 1), q(this.heap), this.heap_len = 0, this.heap_max = 0, this.depth = new Uint16Array(2 * Et + 1), q(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;
+}
+const Ae = (e) => {
+  if (!e)
+    return 1;
+  const n = e.state;
+  return !n || n.strm !== e || n.status !== de && //#ifdef GZIP
+  n.status !== Nt && //#endif
+  n.status !== wt && n.status !== bt && n.status !== xt && n.status !== St && n.status !== ie && n.status !== be ? 1 : 0;
+}, Gn = (e) => {
+  if (Ae(e))
+    return ae(e, B);
+  e.total_in = e.total_out = 0, e.data_type = oa;
+  const n = e.state;
+  return n.pending = 0, n.pending_out = 0, n.wrap < 0 && (n.wrap = -n.wrap), n.status = //#ifdef GZIP
+  n.wrap === 2 ? Nt : (
+    //#endif
+    n.wrap ? de : ie
+  ), e.adler = n.wrap === 2 ? 0 : 1, n.last_flush = -2, qi(n), L;
+}, Kn = (e) => {
+  const n = Gn(e);
+  return n === L && va(e.state), n;
+}, Ra = (e, n) => Ae(e) || e.state.wrap !== 2 ? B : (e.state.gzhead = n, L), Xn = (e, n, t, i, r, a) => {
+  if (!e)
+    return B;
+  let l = 1;
+  if (n === ta && (n = 6), i < 0 ? (l = 0, i = -i) : i > 15 && (l = 2, i -= 16), r < 1 || r > sa || t !== qe || i < 8 || i > 15 || n < 0 || n > 9 || a < 0 || a > aa || i === 8 && l !== 1)
+    return ae(e, B);
+  i === 8 && (i = 9);
+  const s = new ma();
+  return e.state = s, s.strm = e, s.status = de, s.wrap = l, s.gzhead = null, s.w_bits = i, s.w_size = 1 << s.w_bits, s.w_mask = s.w_size - 1, s.hash_bits = r + 7, s.hash_size = 1 << s.hash_bits, s.hash_mask = s.hash_size - 1, s.hash_shift = ~~((s.hash_bits + v - 1) / v), s.window = new Uint8Array(s.w_size * 2), s.head = new Uint16Array(s.hash_size), s.prev = new Uint16Array(s.w_size), s.lit_bufsize = 1 << r + 6, s.pending_buf_size = s.lit_bufsize * 4, s.pending_buf = new Uint8Array(s.pending_buf_size), s.sym_buf = s.lit_bufsize, s.sym_end = (s.lit_bufsize - 1) * 3, s.level = n, s.strategy = a, s.method = t, Kn(e);
+}, ka = (e, n) => Xn(e, n, qe, la, _a, ra), Ia = (e, n) => {
+  if (Ae(e) || n > $t || n < 0)
+    return e ? ae(e, B) : B;
+  const t = e.state;
+  if (!e.output || e.avail_in !== 0 && !e.input || t.status === be && n !== M)
+    return ae(e, e.avail_out === 0 ? it : B);
+  const i = t.last_flush;
+  if (t.last_flush = n, t.pending !== 0) {
+    if (Z(e), e.avail_out === 0)
+      return t.last_flush = -1, L;
+  } else if (e.avail_in === 0 && Pt(n) <= Pt(i) && n !== M)
+    return ae(e, it);
+  if (t.status === be && e.avail_in !== 0)
+    return ae(e, it);
+  if (t.status === de && t.wrap === 0 && (t.status = ie), t.status === de) {
+    let r = qe + (t.w_bits - 8 << 4) << 8, a = -1;
+    if (t.strategy >= Me || t.level < 2 ? a = 0 : t.level < 6 ? a = 1 : t.level === 6 ? a = 2 : a = 3, r |= a << 6, t.strstart !== 0 && (r |= ga), r += 31 - r % 31, we(t, r), t.strstart !== 0 && (we(t, e.adler >>> 16), we(t, e.adler & 65535)), e.adler = 1, t.status = ie, Z(e), t.pending !== 0)
+      return t.last_flush = -1, L;
+  }
+  if (t.status === Nt) {
+    if (e.adler = 0, I(t, 31), I(t, 139), I(t, 8), t.gzhead)
+      I(
+        t,
+        (t.gzhead.text ? 1 : 0) + (t.gzhead.hcrc ? 2 : 0) + (t.gzhead.extra ? 4 : 0) + (t.gzhead.name ? 8 : 0) + (t.gzhead.comment ? 16 : 0)
+      ), I(t, t.gzhead.time & 255), I(t, t.gzhead.time >> 8 & 255), I(t, t.gzhead.time >> 16 & 255), I(t, t.gzhead.time >> 24 & 255), I(t, t.level === 9 ? 2 : t.strategy >= Me || t.level < 2 ? 4 : 0), I(t, t.gzhead.os & 255), t.gzhead.extra && t.gzhead.extra.length && (I(t, t.gzhead.extra.length & 255), I(t, t.gzhead.extra.length >> 8 & 255)), t.gzhead.hcrc && (e.adler = A(e.adler, t.pending_buf, t.pending, 0)), t.gzindex = 0, t.status = wt;
+    else if (I(t, 0), I(t, 0), I(t, 0), I(t, 0), I(t, 0), I(t, t.level === 9 ? 2 : t.strategy >= Me || t.level < 2 ? 4 : 0), I(t, Ea), t.status = ie, Z(e), t.pending !== 0)
+      return t.last_flush = -1, L;
+  }
+  if (t.status === wt) {
+    if (t.gzhead.extra) {
+      let r = t.pending, a = (t.gzhead.extra.length & 65535) - t.gzindex;
+      for (; t.pending + a > t.pending_buf_size; ) {
+        let s = t.pending_buf_size - t.pending;
+        if (t.pending_buf.set(t.gzhead.extra.subarray(t.gzindex, t.gzindex + s), t.pending), t.pending = t.pending_buf_size, t.gzhead.hcrc && t.pending > r && (e.adler = A(e.adler, t.pending_buf, t.pending - r, r)), t.gzindex += s, Z(e), t.pending !== 0)
+          return t.last_flush = -1, L;
+        r = 0, a -= s;
+      }
+      let l = new Uint8Array(t.gzhead.extra);
+      t.pending_buf.set(l.subarray(t.gzindex, t.gzindex + a), t.pending), t.pending += a, t.gzhead.hcrc && t.pending > r && (e.adler = A(e.adler, t.pending_buf, t.pending - r, r)), t.gzindex = 0;
+    }
+    t.status = bt;
+  }
+  if (t.status === bt) {
+    if (t.gzhead.name) {
+      let r = t.pending, a;
+      do {
+        if (t.pending === t.pending_buf_size) {
+          if (t.gzhead.hcrc && t.pending > r && (e.adler = A(e.adler, t.pending_buf, t.pending - r, r)), Z(e), t.pending !== 0)
+            return t.last_flush = -1, L;
+          r = 0;
+        }
+        t.gzindex < t.gzhead.name.length ? a = t.gzhead.name.charCodeAt(t.gzindex++) & 255 : a = 0, I(t, a);
+      } while (a !== 0);
+      t.gzhead.hcrc && t.pending > r && (e.adler = A(e.adler, t.pending_buf, t.pending - r, r)), t.gzindex = 0;
+    }
+    t.status = xt;
+  }
+  if (t.status === xt) {
+    if (t.gzhead.comment) {
+      let r = t.pending, a;
+      do {
+        if (t.pending === t.pending_buf_size) {
+          if (t.gzhead.hcrc && t.pending > r && (e.adler = A(e.adler, t.pending_buf, t.pending - r, r)), Z(e), t.pending !== 0)
+            return t.last_flush = -1, L;
+          r = 0;
+        }
+        t.gzindex < t.gzhead.comment.length ? a = t.gzhead.comment.charCodeAt(t.gzindex++) & 255 : a = 0, I(t, a);
+      } while (a !== 0);
+      t.gzhead.hcrc && t.pending > r && (e.adler = A(e.adler, t.pending_buf, t.pending - r, r));
+    }
+    t.status = St;
+  }
+  if (t.status === St) {
+    if (t.gzhead.hcrc) {
+      if (t.pending + 2 > t.pending_buf_size && (Z(e), t.pending !== 0))
+        return t.last_flush = -1, L;
+      I(t, e.adler & 255), I(t, e.adler >> 8 & 255), e.adler = 0;
+    }
+    if (t.status = ie, Z(e), t.pending !== 0)
+      return t.last_flush = -1, L;
+  }
+  if (e.avail_in !== 0 || t.lookahead !== 0 || n !== W && t.status !== be) {
+    let r = t.level === 0 ? Bn(t, n) : t.strategy === Me ? Sa(t, n) : t.strategy === ia ? xa(t, n) : xe[t.level].func(t, n);
+    if ((r === oe || r === Ee) && (t.status = be), r === z || r === oe)
+      return e.avail_out === 0 && (t.last_flush = -1), L;
+    if (r === ge && (n === Wi ? Ji(t) : n !== $t && (gt(t, 0, 0, !1), n === Qi && (q(t.head), t.lookahead === 0 && (t.strstart = 0, t.block_start = 0, t.insert = 0))), Z(e), e.avail_out === 0))
+      return t.last_flush = -1, L;
+  }
+  return n !== M ? L : t.wrap <= 0 ? Mt : (t.wrap === 2 ? (I(t, e.adler & 255), I(t, e.adler >> 8 & 255), I(t, e.adler >> 16 & 255), I(t, e.adler >> 24 & 255), I(t, e.total_in & 255), I(t, e.total_in >> 8 & 255), I(t, e.total_in >> 16 & 255), I(t, e.total_in >> 24 & 255)) : (we(t, e.adler >>> 16), we(t, e.adler & 65535)), Z(e), t.wrap > 0 && (t.wrap = -t.wrap), t.pending !== 0 ? L : Mt);
+}, Na = (e) => {
+  if (Ae(e))
+    return B;
+  const n = e.state.status;
+  return e.state = null, n === ie ? ae(e, ea) : L;
+}, Da = (e, n) => {
+  let t = n.length;
+  if (Ae(e))
+    return B;
+  const i = e.state, r = i.wrap;
+  if (r === 2 || r === 1 && i.status !== de || i.lookahead)
+    return B;
+  if (r === 1 && (e.adler = De(e.adler, n, t, 0)), i.wrap = 0, t >= i.w_size) {
+    r === 0 && (q(i.head), i.strstart = 0, i.block_start = 0, i.insert = 0);
+    let c = new Uint8Array(i.w_size);
+    c.set(n.subarray(t - i.w_size, t), 0), n = c, t = i.w_size;
+  }
+  const a = e.avail_in, l = e.next_in, s = e.input;
+  for (e.avail_in = t, e.next_in = 0, e.input = n, ue(i); i.lookahead >= v; ) {
+    let c = i.strstart, o = i.lookahead - (v - 1);
+    do
+      i.ins_h = Q(i, i.ins_h, i.window[c + v - 1]), i.prev[c & i.w_mask] = i.head[i.ins_h], i.head[i.ins_h] = c, c++;
+    while (--o);
+    i.strstart = c, i.lookahead = v - 1, ue(i);
+  }
+  return i.strstart += i.lookahead, i.block_start = i.strstart, i.insert = i.lookahead, i.lookahead = 0, i.match_length = i.prev_length = v - 1, i.match_available = 0, e.next_in = l, e.input = s, e.avail_in = a, i.wrap = r, L;
+};
+var Ta = ka, ya = Xn, Ua = Kn, Oa = Gn, Aa = Ra, La = Ia, za = Na, Ca = Da, Za = "pako deflate (from Nodeca project)", ve = {
+  deflateInit: Ta,
+  deflateInit2: ya,
+  deflateReset: Ua,
+  deflateResetKeep: Oa,
+  deflateSetHeader: Aa,
+  deflate: La,
+  deflateEnd: za,
+  deflateSetDictionary: Ca,
+  deflateInfo: Za
+};
+const $a = (e, n) => Object.prototype.hasOwnProperty.call(e, n);
+var Ma = function(e) {
+  const n = Array.prototype.slice.call(arguments, 1);
+  for (; n.length; ) {
+    const t = n.shift();
+    if (t) {
+      if (typeof t != "object")
+        throw new TypeError(t + "must be non-object");
+      for (const i in t)
+        $a(t, i) && (e[i] = t[i]);
+    }
+  }
+  return e;
+}, Pa = (e) => {
+  let n = 0;
+  for (let i = 0, r = e.length; i < r; i++)
+    n += e[i].length;
+  const t = new Uint8Array(n);
+  for (let i = 0, r = 0, a = e.length; i < a; i++) {
+    let l = e[i];
+    t.set(l, r), r += l.length;
+  }
+  return t;
+}, je = {
+  assign: Ma,
+  flattenChunks: Pa
+};
+let Vn = !0;
+try {
+  String.fromCharCode.apply(null, new Uint8Array(1));
+} catch {
+  Vn = !1;
+}
+const Te = new Uint8Array(256);
+for (let e = 0; e < 256; e++)
+  Te[e] = e >= 252 ? 6 : e >= 248 ? 5 : e >= 240 ? 4 : e >= 224 ? 3 : e >= 192 ? 2 : 1;
+Te[254] = Te[254] = 1;
+var Fa = (e) => {
+  if (typeof TextEncoder == "function" && TextEncoder.prototype.encode)
+    return new TextEncoder().encode(e);
+  let n, t, i, r, a, l = e.length, s = 0;
+  for (r = 0; r < l; r++)
+    t = e.charCodeAt(r), (t & 64512) === 55296 && r + 1 < l && (i = e.charCodeAt(r + 1), (i & 64512) === 56320 && (t = 65536 + (t - 55296 << 10) + (i - 56320), r++)), s += t < 128 ? 1 : t < 2048 ? 2 : t < 65536 ? 3 : 4;
+  for (n = new Uint8Array(s), a = 0, r = 0; a < s; r++)
+    t = e.charCodeAt(r), (t & 64512) === 55296 && r + 1 < l && (i = e.charCodeAt(r + 1), (i & 64512) === 56320 && (t = 65536 + (t - 55296 << 10) + (i - 56320), r++)), t < 128 ? n[a++] = t : t < 2048 ? (n[a++] = 192 | t >>> 6, n[a++] = 128 | t & 63) : t < 65536 ? (n[a++] = 224 | t >>> 12, n[a++] = 128 | t >>> 6 & 63, n[a++] = 128 | t & 63) : (n[a++] = 240 | t >>> 18, n[a++] = 128 | t >>> 12 & 63, n[a++] = 128 | t >>> 6 & 63, n[a++] = 128 | t & 63);
+  return n;
+};
+const Ha = (e, n) => {
+  if (n < 65534 && e.subarray && Vn)
+    return String.fromCharCode.apply(null, e.length === n ? e : e.subarray(0, n));
+  let t = "";
+  for (let i = 0; i < n; i++)
+    t += String.fromCharCode(e[i]);
+  return t;
+};
+var Ba = (e, n) => {
+  const t = n || e.length;
+  if (typeof TextDecoder == "function" && TextDecoder.prototype.decode)
+    return new TextDecoder().decode(e.subarray(0, n));
+  let i, r;
+  const a = new Array(t * 2);
+  for (r = 0, i = 0; i < t; ) {
+    let l = e[i++];
+    if (l < 128) {
+      a[r++] = l;
+      continue;
+    }
+    let s = Te[l];
+    if (s > 4) {
+      a[r++] = 65533, i += s - 1;
+      continue;
+    }
+    for (l &= s === 2 ? 31 : s === 3 ? 15 : 7; s > 1 && i < t; )
+      l = l << 6 | e[i++] & 63, s--;
+    if (s > 1) {
+      a[r++] = 65533;
+      continue;
+    }
+    l < 65536 ? a[r++] = l : (l -= 65536, a[r++] = 55296 | l >> 10 & 1023, a[r++] = 56320 | l & 1023);
+  }
+  return Ha(a, r);
+}, Ga = (e, n) => {
+  n = n || e.length, n > e.length && (n = e.length);
+  let t = n - 1;
+  for (; t >= 0 && (e[t] & 192) === 128; )
+    t--;
+  return t < 0 || t === 0 ? n : t + Te[e[t]] > n ? t : n;
+}, ye = {
+  string2buf: Fa,
+  buf2string: Ba,
+  utf8border: Ga
+};
+function Ka() {
+  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 Yn = Ka;
+const qn = Object.prototype.toString, {
+  Z_NO_FLUSH: Xa,
+  Z_SYNC_FLUSH: Va,
+  Z_FULL_FLUSH: Ya,
+  Z_FINISH: qa,
+  Z_OK: Ve,
+  Z_STREAM_END: ja,
+  Z_DEFAULT_COMPRESSION: Ja,
+  Z_DEFAULT_STRATEGY: Wa,
+  Z_DEFLATED: Qa
+} = le;
+function Le(e) {
+  this.options = je.assign({
+    level: Ja,
+    method: Qa,
+    chunkSize: 16384,
+    windowBits: 15,
+    memLevel: 8,
+    strategy: Wa
+  }, e || {});
+  let n = this.options;
+  n.raw && n.windowBits > 0 ? n.windowBits = -n.windowBits : n.gzip && n.windowBits > 0 && n.windowBits < 16 && (n.windowBits += 16), this.err = 0, this.msg = "", this.ended = !1, this.chunks = [], this.strm = new Yn(), this.strm.avail_out = 0;
+  let t = ve.deflateInit2(
+    this.strm,
+    n.level,
+    n.method,
+    n.windowBits,
+    n.memLevel,
+    n.strategy
+  );
+  if (t !== Ve)
+    throw new Error(re[t]);
+  if (n.header && ve.deflateSetHeader(this.strm, n.header), n.dictionary) {
+    let i;
+    if (typeof n.dictionary == "string" ? i = ye.string2buf(n.dictionary) : qn.call(n.dictionary) === "[object ArrayBuffer]" ? i = new Uint8Array(n.dictionary) : i = n.dictionary, t = ve.deflateSetDictionary(this.strm, i), t !== Ve)
+      throw new Error(re[t]);
+    this._dict_set = !0;
+  }
+}
+Le.prototype.push = function(e, n) {
+  const t = this.strm, i = this.options.chunkSize;
+  let r, a;
+  if (this.ended)
+    return !1;
+  for (n === ~~n ? a = n : a = n === !0 ? qa : Xa, typeof e == "string" ? t.input = ye.string2buf(e) : qn.call(e) === "[object ArrayBuffer]" ? t.input = new Uint8Array(e) : t.input = e, t.next_in = 0, t.avail_in = t.input.length; ; ) {
+    if (t.avail_out === 0 && (t.output = new Uint8Array(i), t.next_out = 0, t.avail_out = i), (a === Va || a === Ya) && t.avail_out <= 6) {
+      this.onData(t.output.subarray(0, t.next_out)), t.avail_out = 0;
+      continue;
+    }
+    if (r = ve.deflate(t, a), r === ja)
+      return t.next_out > 0 && this.onData(t.output.subarray(0, t.next_out)), r = ve.deflateEnd(this.strm), this.onEnd(r), this.ended = !0, r === Ve;
+    if (t.avail_out === 0) {
+      this.onData(t.output);
+      continue;
+    }
+    if (a > 0 && t.next_out > 0) {
+      this.onData(t.output.subarray(0, t.next_out)), t.avail_out = 0;
+      continue;
+    }
+    if (t.avail_in === 0) break;
+  }
+  return !0;
+};
+Le.prototype.onData = function(e) {
+  this.chunks.push(e);
+};
+Le.prototype.onEnd = function(e) {
+  e === Ve && (this.result = je.flattenChunks(this.chunks)), this.chunks = [], this.err = e, this.msg = this.strm.msg;
+};
+function Dt(e, n) {
+  const t = new Le(n);
+  if (t.push(e, !0), t.err)
+    throw t.msg || re[t.err];
+  return t.result;
+}
+function er(e, n) {
+  return n = n || {}, n.raw = !0, Dt(e, n);
+}
+function tr(e, n) {
+  return n = n || {}, n.gzip = !0, Dt(e, n);
+}
+var nr = Le, ir = Dt, ar = er, rr = tr, or = le, sr = {
+  Deflate: nr,
+  deflate: ir,
+  deflateRaw: ar,
+  gzip: rr,
+  constants: or
+};
+const Pe = 16209, lr = 16191;
+var _r = function(n, t) {
+  let i, r, a, l, s, c, o, _, E, h, f, u, y, m, w, N, b, d, k, O, p, D, R, g;
+  const x = n.state;
+  i = n.next_in, R = n.input, r = i + (n.avail_in - 5), a = n.next_out, g = n.output, l = a - (t - n.avail_out), s = a + (n.avail_out - 257), c = x.dmax, o = x.wsize, _ = x.whave, E = x.wnext, h = x.window, f = x.hold, u = x.bits, y = x.lencode, m = x.distcode, w = (1 << x.lenbits) - 1, N = (1 << x.distbits) - 1;
+  e:
+    do {
+      u < 15 && (f += R[i++] << u, u += 8, f += R[i++] << u, u += 8), b = y[f & w];
+      t:
+        for (; ; ) {
+          if (d = b >>> 24, f >>>= d, u -= d, d = b >>> 16 & 255, d === 0)
+            g[a++] = b & 65535;
+          else if (d & 16) {
+            k = b & 65535, d &= 15, d && (u < d && (f += R[i++] << u, u += 8), k += f & (1 << d) - 1, f >>>= d, u -= d), u < 15 && (f += R[i++] << u, u += 8, f += R[i++] << u, u += 8), b = m[f & N];
+            n:
+              for (; ; ) {
+                if (d = b >>> 24, f >>>= d, u -= d, d = b >>> 16 & 255, d & 16) {
+                  if (O = b & 65535, d &= 15, u < d && (f += R[i++] << u, u += 8, u < d && (f += R[i++] << u, u += 8)), O += f & (1 << d) - 1, O > c) {
+                    n.msg = "invalid distance too far back", x.mode = Pe;
+                    break e;
+                  }
+                  if (f >>>= d, u -= d, d = a - l, O > d) {
+                    if (d = O - d, d > _ && x.sane) {
+                      n.msg = "invalid distance too far back", x.mode = Pe;
+                      break e;
+                    }
+                    if (p = 0, D = h, E === 0) {
+                      if (p += o - d, d < k) {
+                        k -= d;
+                        do
+                          g[a++] = h[p++];
+                        while (--d);
+                        p = a - O, D = g;
+                      }
+                    } else if (E < d) {
+                      if (p += o + E - d, d -= E, d < k) {
+                        k -= d;
+                        do
+                          g[a++] = h[p++];
+                        while (--d);
+                        if (p = 0, E < k) {
+                          d = E, k -= d;
+                          do
+                            g[a++] = h[p++];
+                          while (--d);
+                          p = a - O, D = g;
+                        }
+                      }
+                    } else if (p += E - d, d < k) {
+                      k -= d;
+                      do
+                        g[a++] = h[p++];
+                      while (--d);
+                      p = a - O, D = g;
+                    }
+                    for (; k > 2; )
+                      g[a++] = D[p++], g[a++] = D[p++], g[a++] = D[p++], k -= 3;
+                    k && (g[a++] = D[p++], k > 1 && (g[a++] = D[p++]));
+                  } else {
+                    p = a - O;
+                    do
+                      g[a++] = g[p++], g[a++] = g[p++], g[a++] = g[p++], k -= 3;
+                    while (k > 2);
+                    k && (g[a++] = g[p++], k > 1 && (g[a++] = g[p++]));
+                  }
+                } else if (d & 64) {
+                  n.msg = "invalid distance code", x.mode = Pe;
+                  break e;
+                } else {
+                  b = m[(b & 65535) + (f & (1 << d) - 1)];
+                  continue n;
+                }
+                break;
+              }
+          } else if (d & 64)
+            if (d & 32) {
+              x.mode = lr;
+              break e;
+            } else {
+              n.msg = "invalid literal/length code", x.mode = Pe;
+              break e;
+            }
+          else {
+            b = y[(b & 65535) + (f & (1 << d) - 1)];
+            continue t;
+          }
+          break;
+        }
+    } while (i < r && a < s);
+  k = u >> 3, i -= k, u -= k << 3, f &= (1 << u) - 1, n.next_in = i, n.next_out = a, n.avail_in = i < r ? 5 + (r - i) : 5 - (i - r), n.avail_out = a < s ? 257 + (s - a) : 257 - (a - s), x.hold = f, x.bits = u;
+};
+const ce = 15, Ft = 852, Ht = 592, Bt = 0, rt = 1, Gt = 2, fr = new Uint16Array([
+  /* Length codes 257..285 base */
+  3,
+  4,
+  5,
+  6,
+  7,
+  8,
+  9,
+  10,
+  11,
+  13,
+  15,
+  17,
+  19,
+  23,
+  27,
+  31,
+  35,
+  43,
+  51,
+  59,
+  67,
+  83,
+  99,
+  115,
+  131,
+  163,
+  195,
+  227,
+  258,
+  0,
+  0
+]), cr = new Uint8Array([
+  /* Length codes 257..285 extra */
+  16,
+  16,
+  16,
+  16,
+  16,
+  16,
+  16,
+  16,
+  17,
+  17,
+  17,
+  17,
+  18,
+  18,
+  18,
+  18,
+  19,
+  19,
+  19,
+  19,
+  20,
+  20,
+  20,
+  20,
+  21,
+  21,
+  21,
+  21,
+  16,
+  72,
+  78
+]), hr = new Uint16Array([
+  /* Distance codes 0..29 base */
+  1,
+  2,
+  3,
+  4,
+  5,
+  7,
+  9,
+  13,
+  17,
+  25,
+  33,
+  49,
+  65,
+  97,
+  129,
+  193,
+  257,
+  385,
+  513,
+  769,
+  1025,
+  1537,
+  2049,
+  3073,
+  4097,
+  6145,
+  8193,
+  12289,
+  16385,
+  24577,
+  0,
+  0
+]), dr = new Uint8Array([
+  /* Distance codes 0..29 extra */
+  16,
+  16,
+  16,
+  16,
+  17,
+  17,
+  18,
+  18,
+  19,
+  19,
+  20,
+  20,
+  21,
+  21,
+  22,
+  22,
+  23,
+  23,
+  24,
+  24,
+  25,
+  25,
+  26,
+  26,
+  27,
+  27,
+  28,
+  28,
+  29,
+  29,
+  64,
+  64
+]), ur = (e, n, t, i, r, a, l, s) => {
+  const c = s.bits;
+  let o = 0, _ = 0, E = 0, h = 0, f = 0, u = 0, y = 0, m = 0, w = 0, N = 0, b, d, k, O, p, D = null, R;
+  const g = new Uint16Array(ce + 1), x = new Uint16Array(ce + 1);
+  let ee = null, yt, Ce, Ze;
+  for (o = 0; o <= ce; o++)
+    g[o] = 0;
+  for (_ = 0; _ < i; _++)
+    g[n[t + _]]++;
+  for (f = c, h = ce; h >= 1 && g[h] === 0; h--)
+    ;
+  if (f > h && (f = h), h === 0)
+    return r[a++] = 1 << 24 | 64 << 16 | 0, r[a++] = 1 << 24 | 64 << 16 | 0, s.bits = 1, 0;
+  for (E = 1; E < h && g[E] === 0; E++)
+    ;
+  for (f < E && (f = E), m = 1, o = 1; o <= ce; o++)
+    if (m <<= 1, m -= g[o], m < 0)
+      return -1;
+  if (m > 0 && (e === Bt || h !== 1))
+    return -1;
+  for (x[1] = 0, o = 1; o < ce; o++)
+    x[o + 1] = x[o] + g[o];
+  for (_ = 0; _ < i; _++)
+    n[t + _] !== 0 && (l[x[n[t + _]]++] = _);
+  if (e === Bt ? (D = ee = l, R = 20) : e === rt ? (D = fr, ee = cr, R = 257) : (D = hr, ee = dr, R = 0), N = 0, _ = 0, o = E, p = a, u = f, y = 0, k = -1, w = 1 << f, O = w - 1, e === rt && w > Ft || e === Gt && w > Ht)
+    return 1;
+  for (; ; ) {
+    yt = o - y, l[_] + 1 < R ? (Ce = 0, Ze = l[_]) : l[_] >= R ? (Ce = ee[l[_] - R], Ze = D[l[_] - R]) : (Ce = 96, Ze = 0), b = 1 << o - y, d = 1 << u, E = d;
+    do
+      d -= b, r[p + (N >> y) + d] = yt << 24 | Ce << 16 | Ze | 0;
+    while (d !== 0);
+    for (b = 1 << o - 1; N & b; )
+      b >>= 1;
+    if (b !== 0 ? (N &= b - 1, N += b) : N = 0, _++, --g[o] === 0) {
+      if (o === h)
+        break;
+      o = n[t + l[_]];
+    }
+    if (o > f && (N & O) !== k) {
+      for (y === 0 && (y = f), p += E, u = o - y, m = 1 << u; u + y < h && (m -= g[u + y], !(m <= 0)); )
+        u++, m <<= 1;
+      if (w += 1 << u, e === rt && w > Ft || e === Gt && w > Ht)
+        return 1;
+      k = N & O, r[k] = f << 24 | u << 16 | p - a | 0;
+    }
+  }
+  return N !== 0 && (r[p + N] = o - y << 24 | 64 << 16 | 0), s.bits = f, 0;
+};
+var me = ur;
+const pr = 0, jn = 1, Jn = 2, {
+  Z_FINISH: Kt,
+  Z_BLOCK: gr,
+  Z_TREES: Fe,
+  Z_OK: se,
+  Z_STREAM_END: Er,
+  Z_NEED_DICT: wr,
+  Z_STREAM_ERROR: P,
+  Z_DATA_ERROR: Wn,
+  Z_MEM_ERROR: Qn,
+  Z_BUF_ERROR: br,
+  Z_DEFLATED: Xt
+} = le, Je = 16180, Vt = 16181, Yt = 16182, qt = 16183, jt = 16184, Jt = 16185, Wt = 16186, Qt = 16187, en = 16188, tn = 16189, Ye = 16190, K = 16191, ot = 16192, nn = 16193, st = 16194, an = 16195, rn = 16196, on = 16197, sn = 16198, He = 16199, Be = 16200, ln = 16201, _n = 16202, fn = 16203, cn = 16204, hn = 16205, lt = 16206, dn = 16207, un = 16208, T = 16209, ei = 16210, ti = 16211, xr = 852, Sr = 592, vr = 15, mr = vr, pn = (e) => (e >>> 24 & 255) + (e >>> 8 & 65280) + ((e & 65280) << 8) + ((e & 255) << 24);
+function Rr() {
+  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;
+}
+const _e = (e) => {
+  if (!e)
+    return 1;
+  const n = e.state;
+  return !n || n.strm !== e || n.mode < Je || n.mode > ti ? 1 : 0;
+}, ni = (e) => {
+  if (_e(e))
+    return P;
+  const n = e.state;
+  return e.total_in = e.total_out = n.total = 0, e.msg = "", n.wrap && (e.adler = n.wrap & 1), n.mode = Je, n.last = 0, n.havedict = 0, n.flags = -1, n.dmax = 32768, n.head = null, n.hold = 0, n.bits = 0, n.lencode = n.lendyn = new Int32Array(xr), n.distcode = n.distdyn = new Int32Array(Sr), n.sane = 1, n.back = -1, se;
+}, ii = (e) => {
+  if (_e(e))
+    return P;
+  const n = e.state;
+  return n.wsize = 0, n.whave = 0, n.wnext = 0, ni(e);
+}, ai = (e, n) => {
+  let t;
+  if (_e(e))
+    return P;
+  const i = e.state;
+  return n < 0 ? (t = 0, n = -n) : (t = (n >> 4) + 5, n < 48 && (n &= 15)), n && (n < 8 || n > 15) ? P : (i.window !== null && i.wbits !== n && (i.window = null), i.wrap = t, i.wbits = n, ii(e));
+}, ri = (e, n) => {
+  if (!e)
+    return P;
+  const t = new Rr();
+  e.state = t, t.strm = e, t.window = null, t.mode = Je;
+  const i = ai(e, n);
+  return i !== se && (e.state = null), i;
+}, kr = (e) => ri(e, mr);
+let gn = !0, _t, ft;
+const Ir = (e) => {
+  if (gn) {
+    _t = new Int32Array(512), ft = new Int32Array(32);
+    let n = 0;
+    for (; n < 144; )
+      e.lens[n++] = 8;
+    for (; n < 256; )
+      e.lens[n++] = 9;
+    for (; n < 280; )
+      e.lens[n++] = 7;
+    for (; n < 288; )
+      e.lens[n++] = 8;
+    for (me(jn, e.lens, 0, 288, _t, 0, e.work, { bits: 9 }), n = 0; n < 32; )
+      e.lens[n++] = 5;
+    me(Jn, e.lens, 0, 32, ft, 0, e.work, { bits: 5 }), gn = !1;
+  }
+  e.lencode = _t, e.lenbits = 9, e.distcode = ft, e.distbits = 5;
+}, oi = (e, n, t, i) => {
+  let r;
+  const a = e.state;
+  return a.window === null && (a.wsize = 1 << a.wbits, a.wnext = 0, a.whave = 0, a.window = new Uint8Array(a.wsize)), i >= a.wsize ? (a.window.set(n.subarray(t - a.wsize, t), 0), a.wnext = 0, a.whave = a.wsize) : (r = a.wsize - a.wnext, r > i && (r = i), a.window.set(n.subarray(t - i, t - i + r), a.wnext), i -= r, i ? (a.window.set(n.subarray(t - i, t), 0), a.wnext = i, a.whave = a.wsize) : (a.wnext += r, a.wnext === a.wsize && (a.wnext = 0), a.whave < a.wsize && (a.whave += r))), 0;
+}, Nr = (e, n) => {
+  let t, i, r, a, l, s, c, o, _, E, h, f, u, y, m = 0, w, N, b, d, k, O, p, D;
+  const R = new Uint8Array(4);
+  let g, x;
+  const ee = (
+    /* permutation of code lengths */
+    new Uint8Array([16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15])
+  );
+  if (_e(e) || !e.output || !e.input && e.avail_in !== 0)
+    return P;
+  t = e.state, t.mode === K && (t.mode = ot), l = e.next_out, r = e.output, c = e.avail_out, a = e.next_in, i = e.input, s = e.avail_in, o = t.hold, _ = t.bits, E = s, h = c, D = se;
+  e:
+    for (; ; )
+      switch (t.mode) {
+        case Je:
+          if (t.wrap === 0) {
+            t.mode = ot;
+            break;
+          }
+          for (; _ < 16; ) {
+            if (s === 0)
+              break e;
+            s--, o += i[a++] << _, _ += 8;
+          }
+          if (t.wrap & 2 && o === 35615) {
+            t.wbits === 0 && (t.wbits = 15), t.check = 0, R[0] = o & 255, R[1] = o >>> 8 & 255, t.check = A(t.check, R, 2, 0), o = 0, _ = 0, t.mode = Vt;
+            break;
+          }
+          if (t.head && (t.head.done = !1), !(t.wrap & 1) || /* check if zlib header allowed */
+          (((o & 255) << 8) + (o >> 8)) % 31) {
+            e.msg = "incorrect header check", t.mode = T;
+            break;
+          }
+          if ((o & 15) !== Xt) {
+            e.msg = "unknown compression method", t.mode = T;
+            break;
+          }
+          if (o >>>= 4, _ -= 4, p = (o & 15) + 8, t.wbits === 0 && (t.wbits = p), p > 15 || p > t.wbits) {
+            e.msg = "invalid window size", t.mode = T;
+            break;
+          }
+          t.dmax = 1 << t.wbits, t.flags = 0, e.adler = t.check = 1, t.mode = o & 512 ? tn : K, o = 0, _ = 0;
+          break;
+        case Vt:
+          for (; _ < 16; ) {
+            if (s === 0)
+              break e;
+            s--, o += i[a++] << _, _ += 8;
+          }
+          if (t.flags = o, (t.flags & 255) !== Xt) {
+            e.msg = "unknown compression method", t.mode = T;
+            break;
+          }
+          if (t.flags & 57344) {
+            e.msg = "unknown header flags set", t.mode = T;
+            break;
+          }
+          t.head && (t.head.text = o >> 8 & 1), t.flags & 512 && t.wrap & 4 && (R[0] = o & 255, R[1] = o >>> 8 & 255, t.check = A(t.check, R, 2, 0)), o = 0, _ = 0, t.mode = Yt;
+        case Yt:
+          for (; _ < 32; ) {
+            if (s === 0)
+              break e;
+            s--, o += i[a++] << _, _ += 8;
+          }
+          t.head && (t.head.time = o), t.flags & 512 && t.wrap & 4 && (R[0] = o & 255, R[1] = o >>> 8 & 255, R[2] = o >>> 16 & 255, R[3] = o >>> 24 & 255, t.check = A(t.check, R, 4, 0)), o = 0, _ = 0, t.mode = qt;
+        case qt:
+          for (; _ < 16; ) {
+            if (s === 0)
+              break e;
+            s--, o += i[a++] << _, _ += 8;
+          }
+          t.head && (t.head.xflags = o & 255, t.head.os = o >> 8), t.flags & 512 && t.wrap & 4 && (R[0] = o & 255, R[1] = o >>> 8 & 255, t.check = A(t.check, R, 2, 0)), o = 0, _ = 0, t.mode = jt;
+        case jt:
+          if (t.flags & 1024) {
+            for (; _ < 16; ) {
+              if (s === 0)
+                break e;
+              s--, o += i[a++] << _, _ += 8;
+            }
+            t.length = o, t.head && (t.head.extra_len = o), t.flags & 512 && t.wrap & 4 && (R[0] = o & 255, R[1] = o >>> 8 & 255, t.check = A(t.check, R, 2, 0)), o = 0, _ = 0;
+          } else t.head && (t.head.extra = null);
+          t.mode = Jt;
+        case Jt:
+          if (t.flags & 1024 && (f = t.length, f > s && (f = s), f && (t.head && (p = t.head.extra_len - t.length, t.head.extra || (t.head.extra = new Uint8Array(t.head.extra_len)), t.head.extra.set(
+            i.subarray(
+              a,
+              // extra field is limited to 65536 bytes
+              // - no need for additional size check
+              a + f
+            ),
+            /*len + copy > state.head.extra_max - len ? state.head.extra_max : copy,*/
+            p
+          )), t.flags & 512 && t.wrap & 4 && (t.check = A(t.check, i, f, a)), s -= f, a += f, t.length -= f), t.length))
+            break e;
+          t.length = 0, t.mode = Wt;
+        case Wt:
+          if (t.flags & 2048) {
+            if (s === 0)
+              break e;
+            f = 0;
+            do
+              p = i[a + f++], t.head && p && t.length < 65536 && (t.head.name += String.fromCharCode(p));
+            while (p && f < s);
+            if (t.flags & 512 && t.wrap & 4 && (t.check = A(t.check, i, f, a)), s -= f, a += f, p)
+              break e;
+          } else t.head && (t.head.name = null);
+          t.length = 0, t.mode = Qt;
+        case Qt:
+          if (t.flags & 4096) {
+            if (s === 0)
+              break e;
+            f = 0;
+            do
+              p = i[a + f++], t.head && p && t.length < 65536 && (t.head.comment += String.fromCharCode(p));
+            while (p && f < s);
+            if (t.flags & 512 && t.wrap & 4 && (t.check = A(t.check, i, f, a)), s -= f, a += f, p)
+              break e;
+          } else t.head && (t.head.comment = null);
+          t.mode = en;
+        case en:
+          if (t.flags & 512) {
+            for (; _ < 16; ) {
+              if (s === 0)
+                break e;
+              s--, o += i[a++] << _, _ += 8;
+            }
+            if (t.wrap & 4 && o !== (t.check & 65535)) {
+              e.msg = "header crc mismatch", t.mode = T;
+              break;
+            }
+            o = 0, _ = 0;
+          }
+          t.head && (t.head.hcrc = t.flags >> 9 & 1, t.head.done = !0), e.adler = t.check = 0, t.mode = K;
+          break;
+        case tn:
+          for (; _ < 32; ) {
+            if (s === 0)
+              break e;
+            s--, o += i[a++] << _, _ += 8;
+          }
+          e.adler = t.check = pn(o), o = 0, _ = 0, t.mode = Ye;
+        case Ye:
+          if (t.havedict === 0)
+            return e.next_out = l, e.avail_out = c, e.next_in = a, e.avail_in = s, t.hold = o, t.bits = _, wr;
+          e.adler = t.check = 1, t.mode = K;
+        case K:
+          if (n === gr || n === Fe)
+            break e;
+        case ot:
+          if (t.last) {
+            o >>>= _ & 7, _ -= _ & 7, t.mode = lt;
+            break;
+          }
+          for (; _ < 3; ) {
+            if (s === 0)
+              break e;
+            s--, o += i[a++] << _, _ += 8;
+          }
+          switch (t.last = o & 1, o >>>= 1, _ -= 1, o & 3) {
+            case 0:
+              t.mode = nn;
+              break;
+            case 1:
+              if (Ir(t), t.mode = He, n === Fe) {
+                o >>>= 2, _ -= 2;
+                break e;
+              }
+              break;
+            case 2:
+              t.mode = rn;
+              break;
+            case 3:
+              e.msg = "invalid block type", t.mode = T;
+          }
+          o >>>= 2, _ -= 2;
+          break;
+        case nn:
+          for (o >>>= _ & 7, _ -= _ & 7; _ < 32; ) {
+            if (s === 0)
+              break e;
+            s--, o += i[a++] << _, _ += 8;
+          }
+          if ((o & 65535) !== (o >>> 16 ^ 65535)) {
+            e.msg = "invalid stored block lengths", t.mode = T;
+            break;
+          }
+          if (t.length = o & 65535, o = 0, _ = 0, t.mode = st, n === Fe)
+            break e;
+        case st:
+          t.mode = an;
+        case an:
+          if (f = t.length, f) {
+            if (f > s && (f = s), f > c && (f = c), f === 0)
+              break e;
+            r.set(i.subarray(a, a + f), l), s -= f, a += f, c -= f, l += f, t.length -= f;
+            break;
+          }
+          t.mode = K;
+          break;
+        case rn:
+          for (; _ < 14; ) {
+            if (s === 0)
+              break e;
+            s--, o += i[a++] << _, _ += 8;
+          }
+          if (t.nlen = (o & 31) + 257, o >>>= 5, _ -= 5, t.ndist = (o & 31) + 1, o >>>= 5, _ -= 5, t.ncode = (o & 15) + 4, o >>>= 4, _ -= 4, t.nlen > 286 || t.ndist > 30) {
+            e.msg = "too many length or distance symbols", t.mode = T;
+            break;
+          }
+          t.have = 0, t.mode = on;
+        case on:
+          for (; t.have < t.ncode; ) {
+            for (; _ < 3; ) {
+              if (s === 0)
+                break e;
+              s--, o += i[a++] << _, _ += 8;
+            }
+            t.lens[ee[t.have++]] = o & 7, o >>>= 3, _ -= 3;
+          }
+          for (; t.have < 19; )
+            t.lens[ee[t.have++]] = 0;
+          if (t.lencode = t.lendyn, t.lenbits = 7, g = { bits: t.lenbits }, D = me(pr, t.lens, 0, 19, t.lencode, 0, t.work, g), t.lenbits = g.bits, D) {
+            e.msg = "invalid code lengths set", t.mode = T;
+            break;
+          }
+          t.have = 0, t.mode = sn;
+        case sn:
+          for (; t.have < t.nlen + t.ndist; ) {
+            for (; m = t.lencode[o & (1 << t.lenbits) - 1], w = m >>> 24, N = m >>> 16 & 255, b = m & 65535, !(w <= _); ) {
+              if (s === 0)
+                break e;
+              s--, o += i[a++] << _, _ += 8;
+            }
+            if (b < 16)
+              o >>>= w, _ -= w, t.lens[t.have++] = b;
+            else {
+              if (b === 16) {
+                for (x = w + 2; _ < x; ) {
+                  if (s === 0)
+                    break e;
+                  s--, o += i[a++] << _, _ += 8;
+                }
+                if (o >>>= w, _ -= w, t.have === 0) {
+                  e.msg = "invalid bit length repeat", t.mode = T;
+                  break;
+                }
+                p = t.lens[t.have - 1], f = 3 + (o & 3), o >>>= 2, _ -= 2;
+              } else if (b === 17) {
+                for (x = w + 3; _ < x; ) {
+                  if (s === 0)
+                    break e;
+                  s--, o += i[a++] << _, _ += 8;
+                }
+                o >>>= w, _ -= w, p = 0, f = 3 + (o & 7), o >>>= 3, _ -= 3;
+              } else {
+                for (x = w + 7; _ < x; ) {
+                  if (s === 0)
+                    break e;
+                  s--, o += i[a++] << _, _ += 8;
+                }
+                o >>>= w, _ -= w, p = 0, f = 11 + (o & 127), o >>>= 7, _ -= 7;
+              }
+              if (t.have + f > t.nlen + t.ndist) {
+                e.msg = "invalid bit length repeat", t.mode = T;
+                break;
+              }
+              for (; f--; )
+                t.lens[t.have++] = p;
+            }
+          }
+          if (t.mode === T)
+            break;
+          if (t.lens[256] === 0) {
+            e.msg = "invalid code -- missing end-of-block", t.mode = T;
+            break;
+          }
+          if (t.lenbits = 9, g = { bits: t.lenbits }, D = me(jn, t.lens, 0, t.nlen, t.lencode, 0, t.work, g), t.lenbits = g.bits, D) {
+            e.msg = "invalid literal/lengths set", t.mode = T;
+            break;
+          }
+          if (t.distbits = 6, t.distcode = t.distdyn, g = { bits: t.distbits }, D = me(Jn, t.lens, t.nlen, t.ndist, t.distcode, 0, t.work, g), t.distbits = g.bits, D) {
+            e.msg = "invalid distances set", t.mode = T;
+            break;
+          }
+          if (t.mode = He, n === Fe)
+            break e;
+        case He:
+          t.mode = Be;
+        case Be:
+          if (s >= 6 && c >= 258) {
+            e.next_out = l, e.avail_out = c, e.next_in = a, e.avail_in = s, t.hold = o, t.bits = _, _r(e, h), l = e.next_out, r = e.output, c = e.avail_out, a = e.next_in, i = e.input, s = e.avail_in, o = t.hold, _ = t.bits, t.mode === K && (t.back = -1);
+            break;
+          }
+          for (t.back = 0; m = t.lencode[o & (1 << t.lenbits) - 1], w = m >>> 24, N = m >>> 16 & 255, b = m & 65535, !(w <= _); ) {
+            if (s === 0)
+              break e;
+            s--, o += i[a++] << _, _ += 8;
+          }
+          if (N && !(N & 240)) {
+            for (d = w, k = N, O = b; m = t.lencode[O + ((o & (1 << d + k) - 1) >> d)], w = m >>> 24, N = m >>> 16 & 255, b = m & 65535, !(d + w <= _); ) {
+              if (s === 0)
+                break e;
+              s--, o += i[a++] << _, _ += 8;
+            }
+            o >>>= d, _ -= d, t.back += d;
+          }
+          if (o >>>= w, _ -= w, t.back += w, t.length = b, N === 0) {
+            t.mode = hn;
+            break;
+          }
+          if (N & 32) {
+            t.back = -1, t.mode = K;
+            break;
+          }
+          if (N & 64) {
+            e.msg = "invalid literal/length code", t.mode = T;
+            break;
+          }
+          t.extra = N & 15, t.mode = ln;
+        case ln:
+          if (t.extra) {
+            for (x = t.extra; _ < x; ) {
+              if (s === 0)
+                break e;
+              s--, o += i[a++] << _, _ += 8;
+            }
+            t.length += o & (1 << t.extra) - 1, o >>>= t.extra, _ -= t.extra, t.back += t.extra;
+          }
+          t.was = t.length, t.mode = _n;
+        case _n:
+          for (; m = t.distcode[o & (1 << t.distbits) - 1], w = m >>> 24, N = m >>> 16 & 255, b = m & 65535, !(w <= _); ) {
+            if (s === 0)
+              break e;
+            s--, o += i[a++] << _, _ += 8;
+          }
+          if (!(N & 240)) {
+            for (d = w, k = N, O = b; m = t.distcode[O + ((o & (1 << d + k) - 1) >> d)], w = m >>> 24, N = m >>> 16 & 255, b = m & 65535, !(d + w <= _); ) {
+              if (s === 0)
+                break e;
+              s--, o += i[a++] << _, _ += 8;
+            }
+            o >>>= d, _ -= d, t.back += d;
+          }
+          if (o >>>= w, _ -= w, t.back += w, N & 64) {
+            e.msg = "invalid distance code", t.mode = T;
+            break;
+          }
+          t.offset = b, t.extra = N & 15, t.mode = fn;
+        case fn:
+          if (t.extra) {
+            for (x = t.extra; _ < x; ) {
+              if (s === 0)
+                break e;
+              s--, o += i[a++] << _, _ += 8;
+            }
+            t.offset += o & (1 << t.extra) - 1, o >>>= t.extra, _ -= t.extra, t.back += t.extra;
+          }
+          if (t.offset > t.dmax) {
+            e.msg = "invalid distance too far back", t.mode = T;
+            break;
+          }
+          t.mode = cn;
+        case cn:
+          if (c === 0)
+            break e;
+          if (f = h - c, t.offset > f) {
+            if (f = t.offset - f, f > t.whave && t.sane) {
+              e.msg = "invalid distance too far back", t.mode = T;
+              break;
+            }
+            f > t.wnext ? (f -= t.wnext, u = t.wsize - f) : u = t.wnext - f, f > t.length && (f = t.length), y = t.window;
+          } else
+            y = r, u = l - t.offset, f = t.length;
+          f > c && (f = c), c -= f, t.length -= f;
+          do
+            r[l++] = y[u++];
+          while (--f);
+          t.length === 0 && (t.mode = Be);
+          break;
+        case hn:
+          if (c === 0)
+            break e;
+          r[l++] = t.length, c--, t.mode = Be;
+          break;
+        case lt:
+          if (t.wrap) {
+            for (; _ < 32; ) {
+              if (s === 0)
+                break e;
+              s--, o |= i[a++] << _, _ += 8;
+            }
+            if (h -= c, e.total_out += h, t.total += h, t.wrap & 4 && h && (e.adler = t.check = /*UPDATE_CHECK(state.check, put - _out, _out);*/
+            t.flags ? A(t.check, r, h, l - h) : De(t.check, r, h, l - h)), h = c, t.wrap & 4 && (t.flags ? o : pn(o)) !== t.check) {
+              e.msg = "incorrect data check", t.mode = T;
+              break;
+            }
+            o = 0, _ = 0;
+          }
+          t.mode = dn;
+        case dn:
+          if (t.wrap && t.flags) {
+            for (; _ < 32; ) {
+              if (s === 0)
+                break e;
+              s--, o += i[a++] << _, _ += 8;
+            }
+            if (t.wrap & 4 && o !== (t.total & 4294967295)) {
+              e.msg = "incorrect length check", t.mode = T;
+              break;
+            }
+            o = 0, _ = 0;
+          }
+          t.mode = un;
+        case un:
+          D = Er;
+          break e;
+        case T:
+          D = Wn;
+          break e;
+        case ei:
+          return Qn;
+        case ti:
+        default:
+          return P;
+      }
+  return e.next_out = l, e.avail_out = c, e.next_in = a, e.avail_in = s, t.hold = o, t.bits = _, (t.wsize || h !== e.avail_out && t.mode < T && (t.mode < lt || n !== Kt)) && oi(e, e.output, e.next_out, h - e.avail_out), E -= e.avail_in, h -= e.avail_out, e.total_in += E, e.total_out += h, t.total += h, t.wrap & 4 && h && (e.adler = t.check = /*UPDATE_CHECK(state.check, strm.next_out - _out, _out);*/
+  t.flags ? A(t.check, r, h, e.next_out - h) : De(t.check, r, h, e.next_out - h)), e.data_type = t.bits + (t.last ? 64 : 0) + (t.mode === K ? 128 : 0) + (t.mode === He || t.mode === st ? 256 : 0), (E === 0 && h === 0 || n === Kt) && D === se && (D = br), D;
+}, Dr = (e) => {
+  if (_e(e))
+    return P;
+  let n = e.state;
+  return n.window && (n.window = null), e.state = null, se;
+}, Tr = (e, n) => {
+  if (_e(e))
+    return P;
+  const t = e.state;
+  return t.wrap & 2 ? (t.head = n, n.done = !1, se) : P;
+}, yr = (e, n) => {
+  const t = n.length;
+  let i, r, a;
+  return _e(e) || (i = e.state, i.wrap !== 0 && i.mode !== Ye) ? P : i.mode === Ye && (r = 1, r = De(r, n, t, 0), r !== i.check) ? Wn : (a = oi(e, n, t, t), a ? (i.mode = ei, Qn) : (i.havedict = 1, se));
+};
+var Ur = ii, Or = ai, Ar = ni, Lr = kr, zr = ri, Cr = Nr, Zr = Dr, $r = Tr, Mr = yr, Pr = "pako inflate (from Nodeca project)", Y = {
+  inflateReset: Ur,
+  inflateReset2: Or,
+  inflateResetKeep: Ar,
+  inflateInit: Lr,
+  inflateInit2: zr,
+  inflate: Cr,
+  inflateEnd: Zr,
+  inflateGetHeader: $r,
+  inflateSetDictionary: Mr,
+  inflateInfo: Pr
+};
+function Fr() {
+  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;
+}
+var Hr = Fr;
+const si = Object.prototype.toString, {
+  Z_NO_FLUSH: Br,
+  Z_FINISH: Gr,
+  Z_OK: Ue,
+  Z_STREAM_END: ct,
+  Z_NEED_DICT: ht,
+  Z_STREAM_ERROR: Kr,
+  Z_DATA_ERROR: En,
+  Z_MEM_ERROR: Xr
+} = le;
+function ze(e) {
+  this.options = je.assign({
+    chunkSize: 1024 * 64,
+    windowBits: 15,
+    to: ""
+  }, e || {});
+  const n = this.options;
+  n.raw && n.windowBits >= 0 && n.windowBits < 16 && (n.windowBits = -n.windowBits, n.windowBits === 0 && (n.windowBits = -15)), n.windowBits >= 0 && n.windowBits < 16 && !(e && e.windowBits) && (n.windowBits += 32), n.windowBits > 15 && n.windowBits < 48 && (n.windowBits & 15 || (n.windowBits |= 15)), this.err = 0, this.msg = "", this.ended = !1, this.chunks = [], this.strm = new Yn(), this.strm.avail_out = 0;
+  let t = Y.inflateInit2(
+    this.strm,
+    n.windowBits
+  );
+  if (t !== Ue)
+    throw new Error(re[t]);
+  if (this.header = new Hr(), Y.inflateGetHeader(this.strm, this.header), n.dictionary && (typeof n.dictionary == "string" ? n.dictionary = ye.string2buf(n.dictionary) : si.call(n.dictionary) === "[object ArrayBuffer]" && (n.dictionary = new Uint8Array(n.dictionary)), n.raw && (t = Y.inflateSetDictionary(this.strm, n.dictionary), t !== Ue)))
+    throw new Error(re[t]);
+}
+ze.prototype.push = function(e, n) {
+  const t = this.strm, i = this.options.chunkSize, r = this.options.dictionary;
+  let a, l, s;
+  if (this.ended) return !1;
+  for (n === ~~n ? l = n : l = n === !0 ? Gr : Br, si.call(e) === "[object ArrayBuffer]" ? t.input = new Uint8Array(e) : t.input = e, t.next_in = 0, t.avail_in = t.input.length; ; ) {
+    for (t.avail_out === 0 && (t.output = new Uint8Array(i), t.next_out = 0, t.avail_out = i), a = Y.inflate(t, l), a === ht && r && (a = Y.inflateSetDictionary(t, r), a === Ue ? a = Y.inflate(t, l) : a === En && (a = ht)); t.avail_in > 0 && a === ct && t.state.wrap > 0 && e[t.next_in] !== 0; )
+      Y.inflateReset(t), a = Y.inflate(t, l);
+    switch (a) {
+      case Kr:
+      case En:
+      case ht:
+      case Xr:
+        return this.onEnd(a), this.ended = !0, !1;
+    }
+    if (s = t.avail_out, t.next_out && (t.avail_out === 0 || a === ct))
+      if (this.options.to === "string") {
+        let c = ye.utf8border(t.output, t.next_out), o = t.next_out - c, _ = ye.buf2string(t.output, c);
+        t.next_out = o, t.avail_out = i - o, o && t.output.set(t.output.subarray(c, c + o), 0), this.onData(_);
+      } else
+        this.onData(t.output.length === t.next_out ? t.output : t.output.subarray(0, t.next_out));
+    if (!(a === Ue && s === 0)) {
+      if (a === ct)
+        return a = Y.inflateEnd(this.strm), this.onEnd(a), this.ended = !0, !0;
+      if (t.avail_in === 0) break;
+    }
+  }
+  return !0;
+};
+ze.prototype.onData = function(e) {
+  this.chunks.push(e);
+};
+ze.prototype.onEnd = function(e) {
+  e === Ue && (this.options.to === "string" ? this.result = this.chunks.join("") : this.result = je.flattenChunks(this.chunks)), this.chunks = [], this.err = e, this.msg = this.strm.msg;
+};
+function Tt(e, n) {
+  const t = new ze(n);
+  if (t.push(e), t.err) throw t.msg || re[t.err];
+  return t.result;
+}
+function Vr(e, n) {
+  return n = n || {}, n.raw = !0, Tt(e, n);
+}
+var Yr = ze, qr = Tt, jr = Vr, Jr = Tt, Wr = le, Qr = {
+  Inflate: Yr,
+  inflate: qr,
+  inflateRaw: jr,
+  ungzip: Jr,
+  constants: Wr
+};
+const { Deflate: eo, deflate: to, deflateRaw: no, gzip: io } = sr, { Inflate: ao, inflate: ro, inflateRaw: oo, ungzip: so } = Qr;
+var lo = eo, _o = to, fo = no, co = io, ho = ao, uo = ro, po = oo, go = so, Eo = le, wo = {
+  Deflate: lo,
+  deflate: _o,
+  deflateRaw: fo,
+  gzip: co,
+  Inflate: ho,
+  inflate: uo,
+  inflateRaw: po,
+  ungzip: go,
+  constants: Eo
+};
+function bo(e, n, t) {
+  const i = document.createElement("a");
+  i.href = e, i.style.display = "none", i.download = `${n}.${t}`, document.body.appendChild(i), i.click(), document.body.removeChild(i);
+}
+function is(e, n, t) {
+  const i = URL.createObjectURL(e);
+  bo(i, n, t), URL.revokeObjectURL(i);
+}
+const We = {
+  [U.UNIVER_UNKNOWN]: "",
+  [U.UNIVER_DOC]: "application/vnd.openxmlformats-officedocument.wordprocessingml.document",
+  [U.UNIVER_SHEET]: "application/vnd.openxmlformats-officedocument.spreadsheetml.sheet",
+  [U.UNIVER_SLIDE]: "application/vnd.openxmlformats-officedocument.presentationml.presentation",
+  [U.UNIVER_PROJECT]: "",
+  [U.UNRECOGNIZED]: ""
+}, xo = {
+  "application/vnd.openxmlformats-officedocument.wordprocessingml.document": "docx",
+  "application/vnd.openxmlformats-officedocument.spreadsheetml.sheet": "xlsx",
+  "application/vnd.openxmlformats-officedocument.presentationml.presentation": "pptx"
+};
+function as(e) {
+  return So(e.type) ? U.UNIVER_SHEET : vo(e.type) ? U.UNIVER_DOC : mo(e.type) ? U.UNIVER_SLIDE : U.UNIVER_UNKNOWN;
+}
+function So(e) {
+  return e === We[U.UNIVER_SHEET];
+}
+function vo(e) {
+  return e === We[U.UNIVER_DOC];
+}
+function mo(e) {
+  return e === We[U.UNIVER_SLIDE];
+}
+function rs(e, n = !1) {
+  const t = e.map((i) => We[i]).join(",");
+  return new Promise((i, r) => {
+    const a = document.createElement("input");
+    a.type = "file", a.accept = t, a.multiple = n, a.addEventListener("change", (l) => {
+      const s = l.currentTarget;
+      if (!s.files || s.files.length === 0)
+        throw r(null), new Error("No file selected");
+      i(s.files);
+    }), a.click();
+  });
+}
+async function li(e) {
+  try {
+    const n = await fetch(e);
+    if (!n.ok)
+      throw new Error(`HTTP error! Status: ${n.status}`);
+    const t = await n.blob(), i = n.headers.get("Content-Type") || "application/octet-stream";
+    let a = `file.${xo[i] || "xlsx"}`;
+    const l = n.headers.get("content-disposition");
+    if (l) {
+      const c = l.match(/filename=(.+)/);
+      c && c[1] && (a = c[1]);
+    } else
+      a = Ro(e) || a;
+    return new File([t], a, { type: i });
+  } catch (n) {
+    console.error("Error fetching file from URL:", n);
+    return;
+  }
+}
+function Ro(e) {
+  try {
+    return new URL(e).pathname.split("/").pop();
+  } catch (n) {
+    console.error("Error getting file name from URL:", n);
+    return;
+  }
+}
+async function ko(e) {
+  try {
+    const n = await fetch(e);
+    if (!n.ok)
+      throw new Error(`HTTP error! Status: ${n.status}`);
+    return await n.text();
+  } catch (n) {
+    console.error("Error fetching text from URL:", n);
+    return;
+  }
+}
+function Io(e) {
+  const n = new Blob([e], { type: "application/json" });
+  return new File([n], "file.json");
+}
+function wn(e, n) {
+  return e.replace("{type}", n);
+}
+function No(e, n) {
+  return e.replace("{taskID}", n);
+}
+function Do(e, n) {
+  return e.replace("{fileID}", n);
+}
+var To = Object.defineProperty, yo = Object.getOwnPropertyDescriptor, Uo = (e, n, t, i) => {
+  for (var r = i > 1 ? void 0 : i ? yo(n, t) : n, a = e.length - 1, l; a >= 0; a--)
+    (l = e[a]) && (r = (i ? l(n, t, r) : l(r)) || r);
+  return i && r && To(n, t, r), r;
+}, bn = (e, n) => (t, i) => n(t, i, e);
+const Oo = "EXCHANGE_UPLOAD_FILE_SERVER_URL_KEY", Ao = "/universer-api/stream/file/upload", Lo = "EXCHANGE_IMPORT_SERVER_URL_KEY", zo = "/universer-api/exchange/{type}/import", Co = "EXCHANGE_EXPORT_SERVER_URL_KEY", Zo = "/universer-api/exchange/{type}/export", $o = "EXCHANGE_GET_TASK_SERVER_URL_KEY", Mo = "/universer-api/exchange/task/{taskID}", Po = "EXCHANGE_SIGN_URL_SERVER_URL_KEY", Fo = "/universer-api/file/{fileID}/sign-url", Ho = 12e4;
+var X = /* @__PURE__ */ ((e) => (e[e.UNDEFINED = 0] = "UNDEFINED", e[e.UNIT = 1] = "UNIT", e[e.JSON = 2] = "JSON", e[e.UNRECOGNIZED = -1] = "UNRECOGNIZED", e))(X || {});
+const Bo = mn("univer-pro.exchange-client.request.service");
+let xn = class {
+  constructor(e, n) {
+    this._configService = e, this._httpService = n;
+  }
+  dispose() {
+  }
+  /**
+   * upload file to server
+   * @param file
+   */
+  async upload(e, n = 0, t = !1) {
+    if (typeof e == "string") {
+      const r = await li(e);
+      if (!r)
+        return;
+      e = r;
+    }
+    n = n || e.size;
+    const i = new FormData();
+    i.append("file", e);
+    try {
+      const r = `${this._getUploadFileURL()}?size=${n}&source=${In.HttpImport}&flate=${t}`;
+      return await (await fetch(r, { method: "POST", body: i })).json();
+    } catch {
+      return;
+    }
+  }
+  async import(e) {
+    const { fileID: n, type: t, outputType: i } = e;
+    try {
+      const r = wn(this._getImportURL(), `${t}`);
+      return await (await fetch(r, { method: "POST", body: JSON.stringify({
+        body: {
+          fileID: n,
+          outputType: i
+        }
+      }.body), headers: { "Content-Type": "application/json" } })).json();
+    } catch {
+      return;
+    }
+  }
+  async export(e) {
+    const { unitID: n, jsonID: t, type: i } = e;
+    try {
+      const r = wn(this._getExportURL(), `${i}`);
+      return await (await fetch(r, { method: "POST", body: JSON.stringify({
+        body: {
+          unitID: n,
+          jsonID: t,
+          type: i
+        }
+      }.body), headers: { "Content-Type": "application/json" } })).json();
+    } catch {
+      return;
+    }
+  }
+  async getTask(e) {
+    return new Promise((n, t) => {
+      try {
+        let i = 0;
+        const r = No(this._getTaskURL(), `${e}`), a = this._getMaxPollingTime(), l = async () => {
+          const c = (await this._httpService.get(r)).body;
+          if (c.error && c.error.code === S.OK)
+            if (c.status === "done")
+              n(c);
+            else if (c.status === "pending") {
+              let o = 1e3;
+              if (i >= a) {
+                t(c);
+                return;
+              } else i >= 3e4 && (o = 5e3);
+              i += o, setTimeout(l, o);
+            } else
+              t(c);
+          else
+            t(c);
+        };
+        l();
+      } catch (i) {
+        t(i instanceof Error ? i : new Error(String(i)));
+      }
+    });
+  }
+  async signUrl(e) {
+    try {
+      const n = Do(this._getSignURL(), `${e}`);
+      return (await this._httpService.get(n)).body;
+    } catch {
+      return;
+    }
+  }
+  _getUploadFileURL() {
+    var t, i;
+    const e = this._configService.getConfig(Oo), n = this._configService.getConfig(te);
+    return (i = (t = n == null ? void 0 : n.uploadFileServerUrl) != null ? t : e) != null ? i : Ao;
+  }
+  _getImportURL() {
+    var t, i;
+    const e = this._configService.getConfig(Lo), n = this._configService.getConfig(te);
+    return (i = (t = n == null ? void 0 : n.importServerUrl) != null ? t : e) != null ? i : zo;
+  }
+  _getExportURL() {
+    var t, i;
+    const e = this._configService.getConfig(Co), n = this._configService.getConfig(te);
+    return (i = (t = n == null ? void 0 : n.exportServerUrl) != null ? t : e) != null ? i : Zo;
+  }
+  _getTaskURL() {
+    var t, i;
+    const e = this._configService.getConfig($o), n = this._configService.getConfig(te);
+    return (i = (t = n == null ? void 0 : n.getTaskServerUrl) != null ? t : e) != null ? i : Mo;
+  }
+  _getSignURL() {
+    var t, i;
+    const e = this._configService.getConfig(Po), n = this._configService.getConfig(te);
+    return (i = (t = n == null ? void 0 : n.signUrlServerUrl) != null ? t : e) != null ? i : Fo;
+  }
+  _getMaxPollingTime() {
+    var n;
+    const e = this._configService.getConfig(te);
+    return (n = e == null ? void 0 : e.maxTimeoutTime) != null ? n : Ho;
+  }
+};
+xn = Uo([
+  bn(0, kn),
+  bn(1, Rn(bi))
+], xn);
+function Go(e) {
+  const n = e.workbook;
+  if (!n) return null;
+  const t = {};
+  n.sheets && Object.keys(n.sheets).forEach((r) => {
+    const a = n.sheets[r];
+    t[r] = {
+      ...a,
+      originalMeta: dt(Ke.decode(a.originalMeta))
+    };
+  });
+  const i = dt(Ke.decode(n.originalMeta));
+  return {
+    ...e,
+    workbook: {
+      ...n,
+      originalMeta: i,
+      sheets: t
+    },
+    doc: {}
+  };
+}
+function Ko(e) {
+  const n = {};
+  return e.forEach((t) => {
+    n[t.id] = {
+      ...t,
+      data: dt(Ke.decode(t.data))
+    };
+  }), n;
+}
+async function Xo(e) {
+  var c;
+  const n = {
+    metadata: void 0
+  }, t = e.id, i = (c = e.rev) != null ? c : 0, r = new Vo(), { snapshot: a } = await hi(n, e, t, i, r), l = await di(a, r), s = Go(a);
+  if (!s) throw new Error("Failed to transform snapshot to string");
+  return {
+    snapshot: s,
+    sheetBlocks: Ko(l)
+  };
+}
+class Vo {
+  constructor() {
+    $e(this, "_sheetBlockCache", /* @__PURE__ */ new Map());
+  }
+  /** Load snapshot from a database. */
+  getUnitOnRev(n, t) {
+    return Promise.resolve({
+      snapshot: {
+        unitID: "",
+        type: U.UNIVER_SHEET,
+        rev: 0,
+        workbook: void 0,
+        doc: void 0
+      },
+      changesets: [],
+      error: {
+        code: S.OK,
+        message: ""
+      }
+    });
+  }
+  /** Load sheet block from a database.  */
+  getSheetBlock(n, t) {
+    const i = this._sheetBlockCache.get(t.blockID);
+    return Promise.resolve({
+      block: i,
+      error: {
+        code: S.OK,
+        message: ""
+      }
+    });
+  }
+  /** Load deserialized sheet block from a database.  */
+  getDeserializedSheetBlock(n, t) {
+    const i = this._sheetBlockCache.get(t.blockID);
+    return Promise.resolve({
+      block: i === void 0 ? void 0 : {
+        ...i,
+        data: JSON.parse(Ke.decode(i.data))
+      },
+      error: {
+        code: S.OK,
+        message: ""
+      }
+    });
+  }
+  /** Fetch missing changeset */
+  fetchMissingChangesets(n, t) {
+    return Promise.resolve({
+      changesets: [],
+      error: {
+        code: S.OK,
+        message: ""
+      }
+    });
+  }
+  getResourcesRequest(n, t) {
+    return Promise.resolve({
+      resources: {},
+      error: {
+        code: S.OK,
+        message: ""
+      }
+    });
+  }
+  /** Save snapshot to a database. */
+  saveSnapshot(n, t) {
+    return Promise.resolve({
+      error: {
+        code: S.OK,
+        message: ""
+      }
+    });
+  }
+  /** Save sheet block to a database. */
+  saveSheetBlock(n, t) {
+    const { block: i } = t;
+    return i ? (this._sheetBlockCache.set(i.id, i), Promise.resolve({
+      error: {
+        code: S.OK,
+        message: ""
+      },
+      blockID: i.id
+    })) : Promise.resolve({
+      error: {
+        code: S.UNDEFINED,
+        message: "block is required"
+      },
+      blockID: ""
+    });
+  }
+  /** Save changeset to a database. */
+  saveChangeset(n, t) {
+    return Promise.resolve({
+      error: {
+        code: S.OK,
+        message: ""
+      },
+      concurrent: []
+    });
+  }
+  copyFileMeta(n, t) {
+    return Promise.resolve({
+      error: void 0,
+      fileMetaId: ""
+    });
+  }
+  getLatestCsReqIdBySid(n, t) {
+    return Promise.resolve({
+      error: void 0,
+      latestReqID: 0
+    });
+  }
+}
+var Yo = Object.defineProperty, qo = Object.getOwnPropertyDescriptor, jo = (e, n, t, i) => {
+  for (var r = i > 1 ? void 0 : i ? qo(n, t) : n, a = e.length - 1, l; a >= 0; a--)
+    (l = e[a]) && (r = (i ? l(n, t, r) : l(r)) || r);
+  return i && r && Yo(n, t, r), r;
+}, Sn = (e, n) => (t, i) => n(t, i, e);
+const os = mn("univer-pro.exchange-client.exchange.service");
+let vn = class extends ci {
+  constructor(n, t) {
+    super();
+    $e(this, "_requestState$", new wi());
+    $e(this, "requestState$", this._requestState$.asObservable());
+    this._configService = n, this._requestService = t;
+  }
+  dispose() {
+    super.dispose(), this._requestState$.complete();
+  }
+  async importDOCXToSnapshot(n) {
+    const t = await this._importToSnapshot(n, U.UNIVER_DOC);
+    if (!t || !t.snapshot) return;
+    const i = ui(t.snapshot);
+    if (i)
+      return i;
+  }
+  exportDOCXByUnitId(n) {
+    throw new Error("Method not implemented.");
+  }
+  exportDOCXBySnapshot(n) {
+    throw new Error("Method not implemented.");
+  }
+  async importXLSXToSnapshot(n) {
+    const t = await this._importToSnapshot(n, U.UNIVER_SHEET);
+    if (!t) return;
+    const i = t.snapshot, r = t.sheetBlocks, l = Object.keys(r).map((c) => r[c]).map((c) => ({
+      ...c,
+      data: c.data ? JSON.parse(pi(c.data)) : void 0
+    })), s = gi(i, l);
+    if (s)
+      return s;
+  }
+  async exportXLSXByUnitId(n) {
+    return this._export(n, X.UNIT, U.UNIVER_SHEET);
+  }
+  async exportXLSXBySnapshot(n) {
+    const t = await Xo(n);
+    return this._exportBySnapshot(t, U.UNIVER_SHEET);
+  }
+  async importFileToUnitId(n, t) {
+    var c, o;
+    const i = await this._upload(n);
+    if (!i) return;
+    const r = await this._import(i, X.UNIT, t);
+    if (!r) return;
+    const a = await this._requestService.getTask(r).catch((_) => {
+      var h;
+      const E = _ instanceof Error ? _.message : (h = _.error) == null ? void 0 : h.message;
+      this._requestState$.next({
+        error: { code: S.UNRECOGNIZED, message: E || "" },
+        state: 3
+        /* GET_TASK */
+      });
+    });
+    if (!a)
+      return;
+    const l = (c = a.import) == null ? void 0 : c.outputType, s = ((o = a.import) == null ? void 0 : o.unitID) || "";
+    if (l !== X.UNIT) {
+      this._requestState$.next({
+        error: { code: S.UNRECOGNIZED, message: "Get outputType error" },
+        state: 3
+        /* GET_TASK */
+      });
+      return;
+    }
+    if (s.length === 0) {
+      this._requestState$.next({
+        error: { code: S.UNRECOGNIZED, message: "Failed to get unitID from task" },
+        state: 3
+        /* GET_TASK */
+      });
+      return;
+    }
+    return this._requestState$.next({
+      error: a.error,
+      state: 3
+      /* GET_TASK */
+    }), s;
+  }
+  async _importToSnapshot(n, t) {
+    var _, E;
+    const i = await this._upload(n);
+    if (!i) return;
+    const r = await this._import(i, X.JSON, t);
+    if (!r) return;
+    const a = await this._requestService.getTask(r).catch((h) => {
+      var u;
+      const f = h instanceof Error ? h.message : (u = h.error) == null ? void 0 : u.message;
+      this._requestState$.next({
+        error: { code: S.UNRECOGNIZED, message: f || "" },
+        state: 3
+        /* GET_TASK */
+      });
+    });
+    if (!a)
+      return;
+    const l = (_ = a.import) == null ? void 0 : _.outputType, s = ((E = a.import) == null ? void 0 : E.jsonID) || "";
+    if (l !== X.JSON) {
+      this._requestState$.next({
+        error: { code: S.UNRECOGNIZED, message: "Get outputType error" },
+        state: 3
+        /* GET_TASK */
+      });
+      return;
+    }
+    if (s.length === 0) {
+      this._requestState$.next({
+        error: { code: S.UNRECOGNIZED, message: "Failed to get jsonID from task" },
+        state: 3
+        /* GET_TASK */
+      });
+      return;
+    }
+    this._requestState$.next({
+      error: a.error,
+      state: 3
+      /* GET_TASK */
+    });
+    const c = await this._signUrl(s);
+    if (!c) return;
+    const o = await ko(c);
+    if (!o) {
+      this._requestState$.next({
+        error: { code: S.UNRECOGNIZED, message: "Failed to get text from url" },
+        state: 5
+        /* GET_JSON */
+      });
+      return;
+    }
+    try {
+      const h = JSON.parse(o);
+      return this._requestState$.next({
+        error: { code: S.OK, message: "success" },
+        state: 5
+        /* GET_JSON */
+      }), h;
+    } catch {
+      this._requestState$.next({
+        error: { code: S.UNRECOGNIZED, message: "Failed to parse json" },
+        state: 5
+        /* GET_JSON */
+      });
+    }
+  }
+  /**
+   * Export file by snapshot
+   * @param snapshot
+   * @param univerType
+   * @returns
+   */
+  async _exportBySnapshot(n, t) {
+    const i = JSON.stringify(n), r = wo.deflateRaw(i), a = Ei.encode(i).length, l = Io(r), s = await this._upload(l, a, !0);
+    if (s)
+      return this._export(s, X.JSON, t);
+  }
+  async _export(n, t, i) {
+    var _;
+    const r = await this._requestService.export({
+      unitID: t === X.UNIT ? n : "",
+      jsonID: t === X.JSON ? n : "",
+      type: i
+    });
+    if (!r) {
+      this._requestState$.next({
+        error: { code: S.UNRECOGNIZED, message: "export error" },
+        state: 2
+        /* EXPORT */
+      });
+      return;
+    }
+    if (this._requestState$.next({
+      error: r.error,
+      state: 2
+      /* EXPORT */
+    }), r.error && r.error.code !== S.OK)
+      return;
+    const a = r.taskID, l = await this._requestService.getTask(a).catch((E) => {
+      var f;
+      const h = E instanceof Error ? E.message : (f = E.error) == null ? void 0 : f.message;
+      this._requestState$.next({
+        error: { code: S.UNRECOGNIZED, message: h || "" },
+        state: 3
+        /* GET_TASK */
+      });
+    });
+    if (!l)
+      return;
+    const s = ((_ = l.export) == null ? void 0 : _.fileID) || "";
+    if (s.length === 0) {
+      this._requestState$.next({
+        error: { code: S.UNRECOGNIZED, message: "Failed to get fileID from task" },
+        state: 3
+        /* GET_TASK */
+      });
+      return;
+    }
+    this._requestState$.next({
+      error: l.error,
+      state: 3
+      /* GET_TASK */
+    });
+    const c = await this._signUrl(s);
+    if (!c) return;
+    const o = await li(c);
+    if (!o) {
+      this._requestState$.next({
+        error: { code: S.UNRECOGNIZED, message: "Failed to get file from url" },
+        state: 6
+        /* GET_FILE */
+      });
+      return;
+    }
+    return this._requestState$.next({
+      error: { code: S.OK, message: "success" },
+      state: 6
+      /* GET_FILE */
+    }), o;
+  }
+  async _upload(n, t, i) {
+    const r = await this._requestService.upload(n, t, i);
+    if (!r || typeof r.FileId != "string") {
+      this._requestState$.next({
+        error: { code: S.UNRECOGNIZED, message: "upload error" },
+        state: 0
+        /* UPLOAD */
+      });
+      return;
+    }
+    const a = r.FileId;
+    if (a.length === 0) {
+      this._requestState$.next({
+        error: { code: S.UNRECOGNIZED, message: "upload error" },
+        state: 0
+        /* UPLOAD */
+      });
+      return;
+    }
+    return this._requestState$.next({
+      error: { code: S.OK, message: "success" },
+      state: 0
+      /* UPLOAD */
+    }), a;
+  }
+  async _import(n, t, i) {
+    const r = {
+      fileID: n,
+      type: i,
+      outputType: t,
+      fileUrl: ""
+    }, a = await this._requestService.import(r);
+    if (!a) {
+      this._requestState$.next({
+        error: { code: S.UNRECOGNIZED, message: "import error" },
+        state: 1
+        /* IMPORT */
+      });
+      return;
+    }
+    if (a.error && a.error.code !== S.OK) {
+      this._requestState$.next({
+        error: a.error,
+        state: 1
+        /* IMPORT */
+      });
+      return;
+    }
+    const l = a.taskID;
+    if (l.length === 0) {
+      this._requestState$.next({
+        error: { code: S.UNRECOGNIZED, message: "Failed to get taskID from import response" },
+        state: 1
+        /* IMPORT */
+      });
+      return;
+    }
+    return this._requestState$.next({
+      error: a.error,
+      state: 1
+      /* IMPORT */
+    }), l;
+  }
+  async _signUrl(n) {
+    const t = await this._requestService.signUrl(n);
+    if (!t) {
+      this._requestState$.next({
+        error: { code: S.UNRECOGNIZED, message: "sign url error" },
+        state: 4
+        /* SIGN_URL */
+      });
+      return;
+    }
+    if (t.error && t.error.code !== S.OK) {
+      this._requestState$.next({
+        error: t.error,
+        state: 4
+        /* SIGN_URL */
+      });
+      return;
+    }
+    const i = new URL(t.url, this._getDownloadEndpointURL()).toString();
+    if (i.length === 0) {
+      this._requestState$.next({
+        error: { code: S.UNRECOGNIZED, message: "sign url error" },
+        state: 4
+        /* SIGN_URL */
+      });
+      return;
+    }
+    return this._requestState$.next({
+      error: t.error,
+      state: 4
+      /* SIGN_URL */
+    }), i;
+  }
+  _getDownloadEndpointURL() {
+    var t;
+    const n = this._configService.getConfig(te);
+    return (t = n == null ? void 0 : n.downloadEndpointUrl) != null ? t : location.origin;
+  }
+};
+vn = jo([
+  Sn(0, kn),
+  Sn(1, Rn(Bo))
+], vn);
+export {
+  S as E,
+  os as I,
+  te as P,
+  xn as R,
+  U,
+  ns as a,
+  vn as b,
+  Bo as c,
+  is as d,
+  Co as e,
+  $o as f,
+  rs as g,
+  Lo as h,
+  Po as i,
+  Oo as j,
+  as as k,
+  Xo as t
+};