@animaapp/anima-sdk 0.25.0 → 0.26.0

package/dist/index.js

@@ -31,12 +31,12 @@ var k = (e, t, n) => new Promise((r, o) => {
   s((n = n.apply(e, t)).next());
 });
 /*! pako 2.1.0 https://github.com/nodeca/pako @license (MIT AND Zlib) */
-function Je(e) {
+function Be(e) {
   let t = e.length;
   for (; --t >= 0; )
     e[t] = 0;
 }
-const xo = 0, _r = 1, Ao = 2, Io = 3, No = 258, fn = 29, lt = 256, tt = lt + 1 + fn, Re = 30, dn = 19, gr = 2 * tt + 1, Se = 15, Ct = 16, Po = 7, hn = 256, mr = 16, yr = 17, br = 18, Wt = (
+const xo = 0, _r = 1, Ao = 2, Io = 3, No = 258, fn = 29, lt = 256, nt = lt + 1 + fn, Re = 30, dn = 19, gr = 2 * nt + 1, Se = 15, Ct = 16, Po = 7, hn = 256, mr = 16, yr = 17, br = 18, Wt = (
   /* 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])
 ), wt = (
@@ -45,18 +45,18 @@ const xo = 0, _r = 1, Ao = 2, Io = 3, No = 258, fn = 29, lt = 256, tt = lt + 1 +
 ), Ro = (
   /* 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])
-), wr = new Uint8Array([16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15]), Do = 512, fe = new Array((tt + 2) * 2);
-Je(fe);
-const Qe = new Array(Re * 2);
-Je(Qe);
-const nt = new Array(Do);
-Je(nt);
-const rt = new Array(No - Io + 1);
-Je(rt);
+), wr = new Uint8Array([16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15]), Do = 512, fe = new Array((nt + 2) * 2);
+Be(fe);
+const et = new Array(Re * 2);
+Be(et);
+const rt = new Array(Do);
+Be(rt);
+const ot = new Array(No - Io + 1);
+Be(ot);
 const pn = new Array(fn);
-Je(pn);
+Be(pn);
 const zt = new Array(Re);
-Je(zt);
+Be(zt);
 function Ft(e, t, n, r, o) {
   this.static_tree = e, this.extra_bits = t, this.extra_base = n, this.elems = r, this.max_length = o, this.has_stree = e && e.length;
 }
@@ -64,10 +64,10 @@ let vr, kr, zr;
 function jt(e, t) {
   this.dyn_tree = e, this.max_code = 0, this.stat_desc = t;
 }
-const Sr = (e) => e < 256 ? nt[e] : nt[256 + (e >>> 7)], ot = (e, t) => {
+const Sr = (e) => e < 256 ? rt[e] : rt[256 + (e >>> 7)], it = (e, t) => {
   e.pending_buf[e.pending++] = t & 255, e.pending_buf[e.pending++] = t >>> 8 & 255;
 }, B = (e, t, n) => {
-  e.bi_valid > Ct - n ? (e.bi_buf |= t << e.bi_valid & 65535, ot(e, e.bi_buf), e.bi_buf = t >> Ct - e.bi_valid, e.bi_valid += n - Ct) : (e.bi_buf |= t << e.bi_valid & 65535, e.bi_valid += n);
+  e.bi_valid > Ct - n ? (e.bi_buf |= t << e.bi_valid & 65535, it(e, e.bi_buf), e.bi_buf = t >> Ct - e.bi_valid, e.bi_valid += n - Ct) : (e.bi_buf |= t << e.bi_valid & 65535, e.bi_valid += n);
 }, ie = (e, t, n) => {
   B(
     e,
@@ -82,7 +82,7 @@ const Sr = (e) => e < 256 ? nt[e] : nt[256 + (e >>> 7)], ot = (e, t) => {
   while (--t > 0);
   return n >>> 1;
 }, Co = (e) => {
-  e.bi_valid === 16 ? (ot(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);
+  e.bi_valid === 16 ? (it(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);
 }, Fo = (e, t) => {
   const n = t.dyn_tree, r = t.max_code, o = t.stat_desc.static_tree, i = t.stat_desc.has_stree, a = t.stat_desc.extra_bits, s = t.stat_desc.extra_base, c = t.stat_desc.max_length;
   let u, l, d, f, _, m, w = 0;
@@ -114,13 +114,13 @@ const Sr = (e) => e < 256 ? nt[e] : nt[256 + (e >>> 7)], ot = (e, t) => {
   const i = new Array(Se + 1);
   for (n = 0, r = 0; r < fn - 1; r++)
     for (pn[r] = n, e = 0; e < 1 << Wt[r]; e++)
-      rt[n++] = r;
-  for (rt[n - 1] = r, o = 0, r = 0; r < 16; r++)
+      ot[n++] = r;
+  for (ot[n - 1] = r, o = 0, r = 0; r < 16; r++)
     for (zt[r] = o, e = 0; e < 1 << wt[r]; e++)
-      nt[o++] = r;
+      rt[o++] = r;
   for (o >>= 7; r < Re; r++)
     for (zt[r] = o << 7, e = 0; e < 1 << wt[r] - 7; e++)
-      nt[256 + o++] = r;
+      rt[256 + o++] = r;
   for (t = 0; t <= Se; t++)
     i[t] = 0;
   for (e = 0; e <= 143; )
@@ -131,12 +131,12 @@ const Sr = (e) => e < 256 ? nt[e] : nt[256 + (e >>> 7)], ot = (e, t) => {
     fe[e * 2 + 1] = 7, e++, i[7]++;
   for (; e <= 287; )
     fe[e * 2 + 1] = 8, e++, i[8]++;
-  for (Tr(fe, tt + 1, i), e = 0; e < Re; e++)
-    Qe[e * 2 + 1] = 5, Qe[e * 2] = Er(e, 5);
-  vr = new Ft(fe, Wt, lt + 1, tt, Se), kr = new Ft(Qe, wt, 0, Re, Se), zr = new Ft(new Array(0), Ro, 0, dn, Po);
+  for (Tr(fe, nt + 1, i), e = 0; e < Re; e++)
+    et[e * 2 + 1] = 5, et[e * 2] = Er(e, 5);
+  vr = new Ft(fe, Wt, lt + 1, nt, Se), kr = new Ft(et, wt, 0, Re, Se), zr = new Ft(new Array(0), Ro, 0, dn, Po);
 }, $r = (e) => {
   let t;
-  for (t = 0; t < tt; t++)
+  for (t = 0; t < nt; t++)
     e.dyn_ltree[t * 2] = 0;
   for (t = 0; t < Re; t++)
     e.dyn_dtree[t * 2] = 0;
@@ -144,7 +144,7 @@ const Sr = (e) => e < 256 ? nt[e] : nt[256 + (e >>> 7)], ot = (e, t) => {
     e.bl_tree[t * 2] = 0;
   e.dyn_ltree[hn * 2] = 1, e.opt_len = e.static_len = 0, e.sym_next = e.matches = 0;
 }, Zr = (e) => {
-  e.bi_valid > 8 ? ot(e, e.bi_buf) : e.bi_valid > 0 && (e.pending_buf[e.pending++] = e.bi_buf), e.bi_buf = 0, e.bi_valid = 0;
+  e.bi_valid > 8 ? it(e, e.bi_buf) : e.bi_valid > 0 && (e.pending_buf[e.pending++] = e.bi_buf), e.bi_buf = 0, e.bi_valid = 0;
 }, Zn = (e, t, n, r) => {
   const o = t * 2, i = n * 2;
   return e[o] < e[i] || e[o] === e[i] && r[t] <= r[n];
@@ -158,7 +158,7 @@ const Sr = (e) => e < 256 ? nt[e] : nt[256 + (e >>> 7)], ot = (e, t) => {
   let r, o, i = 0, a, s;
   if (e.sym_next !== 0)
     do
-      r = e.pending_buf[e.sym_buf + i++] & 255, r += (e.pending_buf[e.sym_buf + i++] & 255) << 8, o = e.pending_buf[e.sym_buf + i++], r === 0 ? ie(e, o, t) : (a = rt[o], ie(e, a + lt + 1, t), s = Wt[a], s !== 0 && (o -= pn[a], B(e, o, s)), r--, a = Sr(r), ie(e, a, n), s = wt[a], s !== 0 && (r -= zt[a], B(e, r, s)));
+      r = e.pending_buf[e.sym_buf + i++] & 255, r += (e.pending_buf[e.sym_buf + i++] & 255) << 8, o = e.pending_buf[e.sym_buf + i++], r === 0 ? ie(e, o, t) : (a = ot[o], ie(e, a + lt + 1, t), s = Wt[a], s !== 0 && (o -= pn[a], B(e, o, s)), r--, a = Sr(r), ie(e, a, n), s = wt[a], s !== 0 && (r -= zt[a], B(e, r, s)));
     while (i < e.sym_next);
   ie(e, hn, t);
 }, Ht = (e, t) => {
@@ -241,13 +241,13 @@ let In = !1;
 const Jo = (e) => {
   In || (jo(), In = !0), e.l_desc = new jt(e.dyn_ltree, vr), e.d_desc = new jt(e.dyn_dtree, kr), e.bl_desc = new jt(e.bl_tree, zr), e.bi_buf = 0, e.bi_valid = 0, $r(e);
 }, Or = (e, t, n, r) => {
-  B(e, (xo << 1) + (r ? 1 : 0), 3), Zr(e), ot(e, n), ot(e, ~n), n && e.pending_buf.set(e.window.subarray(t, t + n), e.pending), e.pending += n;
+  B(e, (xo << 1) + (r ? 1 : 0), 3), Zr(e), it(e, n), it(e, ~n), n && e.pending_buf.set(e.window.subarray(t, t + n), e.pending), e.pending += n;
 }, Bo = (e) => {
   B(e, _r << 1, 3), ie(e, hn, fe), Co(e);
 }, Vo = (e, t, n, r) => {
   let o, i, a = 0;
-  e.level > 0 ? (e.strm.data_type === 2 && (e.strm.data_type = Mo(e)), Ht(e, e.l_desc), Ht(e, e.d_desc), a = Uo(e), o = e.opt_len + 3 + 7 >>> 3, i = e.static_len + 3 + 7 >>> 3, i <= o && (o = i)) : o = i = n + 5, n + 4 <= o && t !== -1 ? Or(e, t, n, r) : e.strategy === 4 || i === o ? (B(e, (_r << 1) + (r ? 1 : 0), 3), On(e, fe, Qe)) : (B(e, (Ao << 1) + (r ? 1 : 0), 3), Lo(e, e.l_desc.max_code + 1, e.d_desc.max_code + 1, a + 1), On(e, e.dyn_ltree, e.dyn_dtree)), $r(e), r && Zr(e);
-}, Wo = (e, t, n) => (e.pending_buf[e.sym_buf + e.sym_next++] = t, e.pending_buf[e.sym_buf + e.sym_next++] = t >> 8, e.pending_buf[e.sym_buf + e.sym_next++] = n, t === 0 ? e.dyn_ltree[n * 2]++ : (e.matches++, t--, e.dyn_ltree[(rt[n] + lt + 1) * 2]++, e.dyn_dtree[Sr(t) * 2]++), e.sym_next === e.sym_end);
+  e.level > 0 ? (e.strm.data_type === 2 && (e.strm.data_type = Mo(e)), Ht(e, e.l_desc), Ht(e, e.d_desc), a = Uo(e), o = e.opt_len + 3 + 7 >>> 3, i = e.static_len + 3 + 7 >>> 3, i <= o && (o = i)) : o = i = n + 5, n + 4 <= o && t !== -1 ? Or(e, t, n, r) : e.strategy === 4 || i === o ? (B(e, (_r << 1) + (r ? 1 : 0), 3), On(e, fe, et)) : (B(e, (Ao << 1) + (r ? 1 : 0), 3), Lo(e, e.l_desc.max_code + 1, e.d_desc.max_code + 1, a + 1), On(e, e.dyn_ltree, e.dyn_dtree)), $r(e), r && Zr(e);
+}, Wo = (e, t, n) => (e.pending_buf[e.sym_buf + e.sym_next++] = t, e.pending_buf[e.sym_buf + e.sym_next++] = t >> 8, e.pending_buf[e.sym_buf + e.sym_next++] = n, t === 0 ? e.dyn_ltree[n * 2]++ : (e.matches++, t--, e.dyn_ltree[(ot[n] + lt + 1) * 2]++, e.dyn_dtree[Sr(t) * 2]++), e.sym_next === e.sym_end);
 var Ho = Jo, Ko = Or, Go = Vo, qo = Wo, Xo = Bo, Yo = {
   _tr_init: Ho,
   _tr_stored_block: Ko,
@@ -283,7 +283,7 @@ const ei = () => {
     e = e >>> 8 ^ o[(e ^ t[a]) & 255];
   return e ^ -1;
 };
-var he = ni, St = {
+var pe = ni, St = {
   2: "need dictionary",
   /* Z_NEED_DICT       2  */
   1: "stream end",
@@ -330,8 +330,8 @@ var he = ni, St = {
   Z_DEFLATED: 8
   //Z_NULL:                 null // Use -1 or null inline, depending on var type
 };
-const { _tr_init: ri, _tr_stored_block: Kt, _tr_flush_block: oi, _tr_tally: ge, _tr_align: ii } = Yo, {
-  Z_NO_FLUSH: me,
+const { _tr_init: ri, _tr_stored_block: Kt, _tr_flush_block: oi, _tr_tally: me, _tr_align: ii } = Yo, {
+  Z_NO_FLUSH: ye,
   Z_PARTIAL_FLUSH: ai,
   Z_FULL_FLUSH: si,
   Z_FINISH: ee,
@@ -349,7 +349,7 @@ const { _tr_init: ri, _tr_stored_block: Kt, _tr_flush_block: oi, _tr_tally: ge,
   Z_DEFAULT_STRATEGY: hi,
   Z_UNKNOWN: pi,
   Z_DEFLATED: xt
-} = Ar, _i = 9, gi = 15, mi = 8, yi = 29, bi = 256, Gt = bi + 1 + yi, wi = 30, vi = 19, ki = 2 * Gt + 1, zi = 15, z = 3, _e = 258, ce = _e + z + 1, Si = 32, Fe = 42, _n = 57, qt = 69, Xt = 73, Yt = 91, Qt = 103, Ee = 113, Ke = 666, J = 1, Be = 2, $e = 3, Ve = 4, Ei = 3, Te = (e, t) => (e.msg = St[t], t), Rn = (e) => e * 2 - (e > 4 ? 9 : 0), pe = (e) => {
+} = Ar, _i = 9, gi = 15, mi = 8, yi = 29, bi = 256, Gt = bi + 1 + yi, wi = 30, vi = 19, ki = 2 * Gt + 1, zi = 15, z = 3, ge = 258, ce = ge + z + 1, Si = 32, je = 42, _n = 57, qt = 69, Xt = 73, Yt = 91, Qt = 103, Ee = 113, Ge = 666, J = 1, Ve = 2, $e = 3, We = 4, Ei = 3, Te = (e, t) => (e.msg = St[t], t), Rn = (e) => e * 2 - (e > 4 ? 9 : 0), _e = (e) => {
   let t = e.length;
   for (; --t >= 0; )
     e[t] = 0;
@@ -364,7 +364,7 @@ const { _tr_init: ri, _tr_stored_block: Kt, _tr_flush_block: oi, _tr_tally: ge,
     n = e.prev[--r], e.prev[r] = n >= o ? n - o : 0;
   while (--t);
 };
-let $i = (e, t, n) => (t << e.hash_shift ^ n) & e.hash_mask, ye = $i;
+let $i = (e, t, n) => (t << e.hash_shift ^ n) & e.hash_mask, be = $i;
 const G = (e) => {
   const t = e.state;
   let n = t.pending;
@@ -373,14 +373,14 @@ const G = (e) => {
   oi(e, e.block_start >= 0 ? e.block_start : -1, e.strstart - e.block_start, t), e.block_start = e.strstart, G(e.strm);
 }, $ = (e, t) => {
   e.pending_buf[e.pending++] = t;
-}, He = (e, t) => {
+}, Ke = (e, t) => {
   e.pending_buf[e.pending++] = t >>> 8 & 255, e.pending_buf[e.pending++] = t & 255;
 }, en = (e, t, n, r) => {
   let o = e.avail_in;
-  return o > r && (o = r), o === 0 ? 0 : (e.avail_in -= o, t.set(e.input.subarray(e.next_in, e.next_in + o), n), e.state.wrap === 1 ? e.adler = xr(e.adler, t, o, n) : e.state.wrap === 2 && (e.adler = he(e.adler, t, o, n)), e.next_in += o, e.total_in += o, o);
+  return o > r && (o = r), o === 0 ? 0 : (e.avail_in -= o, t.set(e.input.subarray(e.next_in, e.next_in + o), n), e.state.wrap === 1 ? e.adler = xr(e.adler, t, o, n) : e.state.wrap === 2 && (e.adler = pe(e.adler, t, o, n)), e.next_in += o, e.total_in += o, o);
 }, Ir = (e, t) => {
   let n = e.max_chain_length, r = e.strstart, o, i, a = e.prev_length, s = e.nice_match;
-  const c = e.strstart > e.w_size - ce ? e.strstart - (e.w_size - ce) : 0, u = e.window, l = e.w_mask, d = e.prev, f = e.strstart + _e;
+  const c = e.strstart > e.w_size - ce ? e.strstart - (e.w_size - ce) : 0, u = e.window, l = e.w_mask, d = e.prev, f = e.strstart + ge;
   let _ = u[r + a - 1], m = u[r + a];
   e.prev_length >= e.good_match && (n >>= 2), s > e.lookahead && (s = e.lookahead);
   do
@@ -389,7 +389,7 @@ const G = (e) => {
       do
         ;
       while (u[++r] === u[++o] && u[++r] === u[++o] && u[++r] === u[++o] && u[++r] === u[++o] && u[++r] === u[++o] && u[++r] === u[++o] && u[++r] === u[++o] && u[++r] === u[++o] && r < f);
-      if (i = _e - (f - r), r = f - _e, i > a) {
+      if (i = ge - (f - r), r = f - ge, i > a) {
         if (e.match_start = t, a = i, i >= s)
           break;
         _ = u[r + a - 1], m = u[r + a];
@@ -397,109 +397,109 @@ const G = (e) => {
     }
   while ((t = d[t & l]) > c && --n !== 0);
   return a <= e.lookahead ? a : e.lookahead;
-}, je = (e) => {
+}, Ue = (e) => {
   const t = e.w_size;
   let n, r, o;
   do {
     if (r = e.window_size - e.lookahead - e.strstart, e.strstart >= t + (t - ce) && (e.window.set(e.window.subarray(t, t + t - r), 0), e.match_start -= t, e.strstart -= t, e.block_start -= t, e.insert > e.strstart && (e.insert = e.strstart), Ti(e), r += t), e.strm.avail_in === 0)
       break;
     if (n = en(e.strm, e.window, e.strstart + e.lookahead, r), e.lookahead += n, e.lookahead + e.insert >= z)
-      for (o = e.strstart - e.insert, e.ins_h = e.window[o], e.ins_h = ye(e, e.ins_h, e.window[o + 1]); e.insert && (e.ins_h = ye(e, e.ins_h, e.window[o + z - 1]), e.prev[o & e.w_mask] = e.head[e.ins_h], e.head[e.ins_h] = o, o++, e.insert--, !(e.lookahead + e.insert < z)); )
+      for (o = e.strstart - e.insert, e.ins_h = e.window[o], e.ins_h = be(e, e.ins_h, e.window[o + 1]); e.insert && (e.ins_h = be(e, e.ins_h, e.window[o + z - 1]), e.prev[o & e.w_mask] = e.head[e.ins_h], e.head[e.ins_h] = o, o++, e.insert--, !(e.lookahead + e.insert < z)); )
         ;
   } while (e.lookahead < ce && e.strm.avail_in !== 0);
 }, Nr = (e, t) => {
   let n = e.pending_buf_size - 5 > e.w_size ? e.w_size : e.pending_buf_size - 5, r, o, i, a = 0, s = e.strm.avail_in;
   do {
-    if (r = 65535, i = e.bi_valid + 42 >> 3, e.strm.avail_out < i || (i = e.strm.avail_out - i, o = e.strstart - e.block_start, r > o + e.strm.avail_in && (r = o + e.strm.avail_in), r > i && (r = i), r < n && (r === 0 && t !== ee || t === me || r !== o + e.strm.avail_in)))
+    if (r = 65535, i = e.bi_valid + 42 >> 3, e.strm.avail_out < i || (i = e.strm.avail_out - i, o = e.strstart - e.block_start, r > o + e.strm.avail_in && (r = o + e.strm.avail_in), r > i && (r = i), r < n && (r === 0 && t !== ee || t === ye || r !== o + e.strm.avail_in)))
       break;
     a = t === ee && r === o + e.strm.avail_in ? 1 : 0, Kt(e, 0, 0, a), e.pending_buf[e.pending - 4] = r, e.pending_buf[e.pending - 3] = r >> 8, e.pending_buf[e.pending - 2] = ~r, e.pending_buf[e.pending - 1] = ~r >> 8, G(e.strm), o && (o > r && (o = r), e.strm.output.set(e.window.subarray(e.block_start, e.block_start + o), e.strm.next_out), e.strm.next_out += o, e.strm.avail_out -= o, e.strm.total_out += o, e.block_start += o, r -= o), r && (en(e.strm, e.strm.output, e.strm.next_out, r), e.strm.next_out += r, e.strm.avail_out -= r, e.strm.total_out += r);
   } while (a === 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), a ? Ve : t !== me && t !== ee && e.strm.avail_in === 0 && e.strstart === e.block_start ? Be : (i = e.window_size - e.strstart, e.strm.avail_in > i && 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++, i += e.w_size, e.insert > e.strstart && (e.insert = e.strstart)), i > e.strm.avail_in && (i = e.strm.avail_in), i && (en(e.strm, e.window, e.strstart, i), e.strstart += i, e.insert += i > e.w_size - e.insert ? e.w_size - e.insert : i), e.high_water < e.strstart && (e.high_water = e.strstart), i = e.bi_valid + 42 >> 3, i = e.pending_buf_size - i > 65535 ? 65535 : e.pending_buf_size - i, n = i > e.w_size ? e.w_size : i, o = e.strstart - e.block_start, (o >= n || (o || t === ee) && t !== me && e.strm.avail_in === 0 && o <= i) && (r = o > i ? i : o, a = t === ee && e.strm.avail_in === 0 && r === o ? 1 : 0, Kt(e, e.block_start, r, a), e.block_start += r, G(e.strm)), a ? $e : J);
+  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), a ? We : t !== ye && t !== ee && e.strm.avail_in === 0 && e.strstart === e.block_start ? Ve : (i = e.window_size - e.strstart, e.strm.avail_in > i && 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++, i += e.w_size, e.insert > e.strstart && (e.insert = e.strstart)), i > e.strm.avail_in && (i = e.strm.avail_in), i && (en(e.strm, e.window, e.strstart, i), e.strstart += i, e.insert += i > e.w_size - e.insert ? e.w_size - e.insert : i), e.high_water < e.strstart && (e.high_water = e.strstart), i = e.bi_valid + 42 >> 3, i = e.pending_buf_size - i > 65535 ? 65535 : e.pending_buf_size - i, n = i > e.w_size ? e.w_size : i, o = e.strstart - e.block_start, (o >= n || (o || t === ee) && t !== ye && e.strm.avail_in === 0 && o <= i) && (r = o > i ? i : o, a = t === ee && e.strm.avail_in === 0 && r === o ? 1 : 0, Kt(e, e.block_start, r, a), e.block_start += r, G(e.strm)), a ? $e : J);
 }, Mt = (e, t) => {
   let n, r;
   for (; ; ) {
     if (e.lookahead < ce) {
-      if (je(e), e.lookahead < ce && t === me)
+      if (Ue(e), e.lookahead < ce && t === ye)
         return J;
       if (e.lookahead === 0)
         break;
     }
-    if (n = 0, e.lookahead >= z && (e.ins_h = ye(e, e.ins_h, e.window[e.strstart + z - 1]), n = e.prev[e.strstart & e.w_mask] = e.head[e.ins_h], e.head[e.ins_h] = e.strstart), n !== 0 && e.strstart - n <= e.w_size - ce && (e.match_length = Ir(e, n)), e.match_length >= z)
-      if (r = ge(e, e.strstart - e.match_start, e.match_length - z), e.lookahead -= e.match_length, e.match_length <= e.max_lazy_match && e.lookahead >= z) {
+    if (n = 0, e.lookahead >= z && (e.ins_h = be(e, e.ins_h, e.window[e.strstart + z - 1]), n = e.prev[e.strstart & e.w_mask] = e.head[e.ins_h], e.head[e.ins_h] = e.strstart), n !== 0 && e.strstart - n <= e.w_size - ce && (e.match_length = Ir(e, n)), e.match_length >= z)
+      if (r = me(e, e.strstart - e.match_start, e.match_length - z), e.lookahead -= e.match_length, e.match_length <= e.max_lazy_match && e.lookahead >= z) {
         e.match_length--;
         do
-          e.strstart++, e.ins_h = ye(e, e.ins_h, e.window[e.strstart + z - 1]), n = e.prev[e.strstart & e.w_mask] = e.head[e.ins_h], e.head[e.ins_h] = e.strstart;
+          e.strstart++, e.ins_h = be(e, e.ins_h, e.window[e.strstart + z - 1]), n = 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 = ye(e, e.ins_h, e.window[e.strstart + 1]);
+        e.strstart += e.match_length, e.match_length = 0, e.ins_h = e.window[e.strstart], e.ins_h = be(e, e.ins_h, e.window[e.strstart + 1]);
     else
-      r = ge(e, 0, e.window[e.strstart]), e.lookahead--, e.strstart++;
+      r = me(e, 0, e.window[e.strstart]), e.lookahead--, e.strstart++;
     if (r && (q(e, !1), e.strm.avail_out === 0))
       return J;
   }
-  return e.insert = e.strstart < z - 1 ? e.strstart : z - 1, t === ee ? (q(e, !0), e.strm.avail_out === 0 ? $e : Ve) : e.sym_next && (q(e, !1), e.strm.avail_out === 0) ? J : Be;
+  return e.insert = e.strstart < z - 1 ? e.strstart : z - 1, t === ee ? (q(e, !0), e.strm.avail_out === 0 ? $e : We) : e.sym_next && (q(e, !1), e.strm.avail_out === 0) ? J : Ve;
 }, xe = (e, t) => {
   let n, r, o;
   for (; ; ) {
     if (e.lookahead < ce) {
-      if (je(e), e.lookahead < ce && t === me)
+      if (Ue(e), e.lookahead < ce && t === ye)
         return J;
       if (e.lookahead === 0)
         break;
     }
-    if (n = 0, e.lookahead >= z && (e.ins_h = ye(e, e.ins_h, e.window[e.strstart + z - 1]), n = 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 = z - 1, n !== 0 && e.prev_length < e.max_lazy_match && e.strstart - n <= e.w_size - ce && (e.match_length = Ir(e, n), e.match_length <= 5 && (e.strategy === li || e.match_length === z && e.strstart - e.match_start > 4096) && (e.match_length = z - 1)), e.prev_length >= z && e.match_length <= e.prev_length) {
-      o = e.strstart + e.lookahead - z, r = ge(e, e.strstart - 1 - e.prev_match, e.prev_length - z), e.lookahead -= e.prev_length - 1, e.prev_length -= 2;
+    if (n = 0, e.lookahead >= z && (e.ins_h = be(e, e.ins_h, e.window[e.strstart + z - 1]), n = 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 = z - 1, n !== 0 && e.prev_length < e.max_lazy_match && e.strstart - n <= e.w_size - ce && (e.match_length = Ir(e, n), e.match_length <= 5 && (e.strategy === li || e.match_length === z && e.strstart - e.match_start > 4096) && (e.match_length = z - 1)), e.prev_length >= z && e.match_length <= e.prev_length) {
+      o = e.strstart + e.lookahead - z, r = me(e, e.strstart - 1 - e.prev_match, e.prev_length - z), e.lookahead -= e.prev_length - 1, e.prev_length -= 2;
       do
-        ++e.strstart <= o && (e.ins_h = ye(e, e.ins_h, e.window[e.strstart + z - 1]), n = e.prev[e.strstart & e.w_mask] = e.head[e.ins_h], e.head[e.ins_h] = e.strstart);
+        ++e.strstart <= o && (e.ins_h = be(e, e.ins_h, e.window[e.strstart + z - 1]), n = 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 = z - 1, e.strstart++, r && (q(e, !1), e.strm.avail_out === 0))
         return J;
     } else if (e.match_available) {
-      if (r = ge(e, 0, e.window[e.strstart - 1]), r && q(e, !1), e.strstart++, e.lookahead--, e.strm.avail_out === 0)
+      if (r = me(e, 0, e.window[e.strstart - 1]), r && q(e, !1), e.strstart++, e.lookahead--, e.strm.avail_out === 0)
         return J;
     } else
       e.match_available = 1, e.strstart++, e.lookahead--;
   }
-  return e.match_available && (r = ge(e, 0, e.window[e.strstart - 1]), e.match_available = 0), e.insert = e.strstart < z - 1 ? e.strstart : z - 1, t === ee ? (q(e, !0), e.strm.avail_out === 0 ? $e : Ve) : e.sym_next && (q(e, !1), e.strm.avail_out === 0) ? J : Be;
+  return e.match_available && (r = me(e, 0, e.window[e.strstart - 1]), e.match_available = 0), e.insert = e.strstart < z - 1 ? e.strstart : z - 1, t === ee ? (q(e, !0), e.strm.avail_out === 0 ? $e : We) : e.sym_next && (q(e, !1), e.strm.avail_out === 0) ? J : Ve;
 }, Zi = (e, t) => {
   let n, r, o, i;
   const a = e.window;
   for (; ; ) {
-    if (e.lookahead <= _e) {
-      if (je(e), e.lookahead <= _e && t === me)
+    if (e.lookahead <= ge) {
+      if (Ue(e), e.lookahead <= ge && t === ye)
         return J;
       if (e.lookahead === 0)
         break;
     }
     if (e.match_length = 0, e.lookahead >= z && e.strstart > 0 && (o = e.strstart - 1, r = a[o], r === a[++o] && r === a[++o] && r === a[++o])) {
-      i = e.strstart + _e;
+      i = e.strstart + ge;
       do
         ;
       while (r === a[++o] && r === a[++o] && r === a[++o] && r === a[++o] && r === a[++o] && r === a[++o] && r === a[++o] && r === a[++o] && o < i);
-      e.match_length = _e - (i - o), e.match_length > e.lookahead && (e.match_length = e.lookahead);
+      e.match_length = ge - (i - o), e.match_length > e.lookahead && (e.match_length = e.lookahead);
     }
-    if (e.match_length >= z ? (n = ge(e, 1, e.match_length - z), e.lookahead -= e.match_length, e.strstart += e.match_length, e.match_length = 0) : (n = ge(e, 0, e.window[e.strstart]), e.lookahead--, e.strstart++), n && (q(e, !1), e.strm.avail_out === 0))
+    if (e.match_length >= z ? (n = me(e, 1, e.match_length - z), e.lookahead -= e.match_length, e.strstart += e.match_length, e.match_length = 0) : (n = me(e, 0, e.window[e.strstart]), e.lookahead--, e.strstart++), n && (q(e, !1), e.strm.avail_out === 0))
       return J;
   }
-  return e.insert = 0, t === ee ? (q(e, !0), e.strm.avail_out === 0 ? $e : Ve) : e.sym_next && (q(e, !1), e.strm.avail_out === 0) ? J : Be;
+  return e.insert = 0, t === ee ? (q(e, !0), e.strm.avail_out === 0 ? $e : We) : e.sym_next && (q(e, !1), e.strm.avail_out === 0) ? J : Ve;
 }, Oi = (e, t) => {
   let n;
   for (; ; ) {
-    if (e.lookahead === 0 && (je(e), e.lookahead === 0)) {
-      if (t === me)
+    if (e.lookahead === 0 && (Ue(e), e.lookahead === 0)) {
+      if (t === ye)
         return J;
       break;
     }
-    if (e.match_length = 0, n = ge(e, 0, e.window[e.strstart]), e.lookahead--, e.strstart++, n && (q(e, !1), e.strm.avail_out === 0))
+    if (e.match_length = 0, n = me(e, 0, e.window[e.strstart]), e.lookahead--, e.strstart++, n && (q(e, !1), e.strm.avail_out === 0))
       return J;
   }
-  return e.insert = 0, t === ee ? (q(e, !0), e.strm.avail_out === 0 ? $e : Ve) : e.sym_next && (q(e, !1), e.strm.avail_out === 0) ? J : Be;
+  return e.insert = 0, t === ee ? (q(e, !0), e.strm.avail_out === 0 ? $e : We) : e.sym_next && (q(e, !1), e.strm.avail_out === 0) ? J : Ve;
 };
 function oe(e, t, n, r, o) {
   this.good_length = e, this.max_lazy = t, this.nice_length = n, this.max_chain = r, this.func = o;
 }
-const Ge = [
+const qe = [
   /*      good lazy nice chain */
   new oe(0, 0, 0, 0, Nr),
   /* 0 store only */
@@ -522,18 +522,18 @@ const Ge = [
   new oe(32, 258, 258, 4096, xe)
   /* 9 max compression */
 ], xi = (e) => {
-  e.window_size = 2 * e.w_size, pe(e.head), e.max_lazy_match = Ge[e.level].max_lazy, e.good_match = Ge[e.level].good_length, e.nice_match = Ge[e.level].nice_length, e.max_chain_length = Ge[e.level].max_chain, e.strstart = 0, e.block_start = 0, e.lookahead = 0, e.insert = 0, e.match_length = e.prev_length = z - 1, e.match_available = 0, e.ins_h = 0;
+  e.window_size = 2 * e.w_size, _e(e.head), e.max_lazy_match = qe[e.level].max_lazy, e.good_match = qe[e.level].good_length, e.nice_match = qe[e.level].nice_length, e.max_chain_length = qe[e.level].max_chain, e.strstart = 0, e.block_start = 0, e.lookahead = 0, e.insert = 0, e.match_length = e.prev_length = z - 1, e.match_available = 0, e.ins_h = 0;
 };
 function Ai() {
-  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 = xt, 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(ki * 2), this.dyn_dtree = new Uint16Array((2 * wi + 1) * 2), this.bl_tree = new Uint16Array((2 * vi + 1) * 2), pe(this.dyn_ltree), pe(this.dyn_dtree), pe(this.bl_tree), this.l_desc = null, this.d_desc = null, this.bl_desc = null, this.bl_count = new Uint16Array(zi + 1), this.heap = new Uint16Array(2 * Gt + 1), pe(this.heap), this.heap_len = 0, this.heap_max = 0, this.depth = new Uint16Array(2 * Gt + 1), pe(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;
+  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 = xt, 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(ki * 2), this.dyn_dtree = new Uint16Array((2 * wi + 1) * 2), this.bl_tree = new Uint16Array((2 * vi + 1) * 2), _e(this.dyn_ltree), _e(this.dyn_dtree), _e(this.bl_tree), this.l_desc = null, this.d_desc = null, this.bl_desc = null, this.bl_count = new Uint16Array(zi + 1), this.heap = new Uint16Array(2 * Gt + 1), _e(this.heap), this.heap_len = 0, this.heap_max = 0, this.depth = new Uint16Array(2 * Gt + 1), _e(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 ft = (e) => {
   if (!e)
     return 1;
   const t = e.state;
-  return !t || t.strm !== e || t.status !== Fe && //#ifdef GZIP
+  return !t || t.strm !== e || t.status !== je && //#ifdef GZIP
   t.status !== _n && //#endif
-  t.status !== qt && t.status !== Xt && t.status !== Yt && t.status !== Qt && t.status !== Ee && t.status !== Ke ? 1 : 0;
+  t.status !== qt && t.status !== Xt && t.status !== Yt && t.status !== Qt && t.status !== Ee && t.status !== Ge ? 1 : 0;
 }, Pr = (e) => {
   if (ft(e))
     return Te(e, se);
@@ -542,7 +542,7 @@ const ft = (e) => {
   return t.pending = 0, t.pending_out = 0, t.wrap < 0 && (t.wrap = -t.wrap), t.status = //#ifdef GZIP
   t.wrap === 2 ? _n : (
     //#endif
-    t.wrap ? Fe : Ee
+    t.wrap ? je : Ee
   ), e.adler = t.wrap === 2 ? 0 : 1, t.last_flush = -2, ri(t), F;
 }, Rr = (e) => {
   const t = Pr(e);
@@ -555,12 +555,12 @@ const ft = (e) => {
     return Te(e, se);
   r === 8 && (r = 9);
   const s = new Ai();
-  return e.state = s, s.strm = e, s.status = Fe, s.wrap = a, s.gzhead = null, s.w_bits = r, s.w_size = 1 << s.w_bits, s.w_mask = s.w_size - 1, s.hash_bits = o + 7, s.hash_size = 1 << s.hash_bits, s.hash_mask = s.hash_size - 1, s.hash_shift = ~~((s.hash_bits + z - 1) / z), 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 << o + 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 = t, s.strategy = i, s.method = n, Rr(e);
+  return e.state = s, s.strm = e, s.status = je, s.wrap = a, s.gzhead = null, s.w_bits = r, s.w_size = 1 << s.w_bits, s.w_mask = s.w_size - 1, s.hash_bits = o + 7, s.hash_size = 1 << s.hash_bits, s.hash_mask = s.hash_size - 1, s.hash_shift = ~~((s.hash_bits + z - 1) / z), 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 << o + 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 = t, s.strategy = i, s.method = n, Rr(e);
 }, Ni = (e, t) => Dr(e, t, xt, gi, mi, hi), Pi = (e, t) => {
   if (ft(e) || t > Nn || t < 0)
     return e ? Te(e, se) : se;
   const n = e.state;
-  if (!e.output || e.avail_in !== 0 && !e.input || n.status === Ke && t !== ee)
+  if (!e.output || e.avail_in !== 0 && !e.input || n.status === Ge && t !== ee)
     return Te(e, e.avail_out === 0 ? Lt : se);
   const r = n.last_flush;
   if (n.last_flush = t, n.pending !== 0) {
@@ -568,11 +568,11 @@ const ft = (e) => {
       return n.last_flush = -1, F;
   } else if (e.avail_in === 0 && Rn(t) <= Rn(r) && t !== ee)
     return Te(e, Lt);
-  if (n.status === Ke && e.avail_in !== 0)
+  if (n.status === Ge && e.avail_in !== 0)
     return Te(e, Lt);
-  if (n.status === Fe && n.wrap === 0 && (n.status = Ee), n.status === Fe) {
+  if (n.status === je && n.wrap === 0 && (n.status = Ee), n.status === je) {
     let o = xt + (n.w_bits - 8 << 4) << 8, i = -1;
-    if (n.strategy >= _t || n.level < 2 ? i = 0 : n.level < 6 ? i = 1 : n.level === 6 ? i = 2 : i = 3, o |= i << 6, n.strstart !== 0 && (o |= Si), o += 31 - o % 31, He(n, o), n.strstart !== 0 && (He(n, e.adler >>> 16), He(n, e.adler & 65535)), e.adler = 1, n.status = Ee, G(e), n.pending !== 0)
+    if (n.strategy >= _t || n.level < 2 ? i = 0 : n.level < 6 ? i = 1 : n.level === 6 ? i = 2 : i = 3, o |= i << 6, n.strstart !== 0 && (o |= Si), o += 31 - o % 31, Ke(n, o), n.strstart !== 0 && (Ke(n, e.adler >>> 16), Ke(n, e.adler & 65535)), e.adler = 1, n.status = Ee, G(e), n.pending !== 0)
       return n.last_flush = -1, F;
   }
   if (n.status === _n) {
@@ -580,7 +580,7 @@ const ft = (e) => {
       $(
         n,
         (n.gzhead.text ? 1 : 0) + (n.gzhead.hcrc ? 2 : 0) + (n.gzhead.extra ? 4 : 0) + (n.gzhead.name ? 8 : 0) + (n.gzhead.comment ? 16 : 0)
-      ), $(n, n.gzhead.time & 255), $(n, n.gzhead.time >> 8 & 255), $(n, n.gzhead.time >> 16 & 255), $(n, n.gzhead.time >> 24 & 255), $(n, n.level === 9 ? 2 : n.strategy >= _t || n.level < 2 ? 4 : 0), $(n, n.gzhead.os & 255), n.gzhead.extra && n.gzhead.extra.length && ($(n, n.gzhead.extra.length & 255), $(n, n.gzhead.extra.length >> 8 & 255)), n.gzhead.hcrc && (e.adler = he(e.adler, n.pending_buf, n.pending, 0)), n.gzindex = 0, n.status = qt;
+      ), $(n, n.gzhead.time & 255), $(n, n.gzhead.time >> 8 & 255), $(n, n.gzhead.time >> 16 & 255), $(n, n.gzhead.time >> 24 & 255), $(n, n.level === 9 ? 2 : n.strategy >= _t || n.level < 2 ? 4 : 0), $(n, n.gzhead.os & 255), n.gzhead.extra && n.gzhead.extra.length && ($(n, n.gzhead.extra.length & 255), $(n, n.gzhead.extra.length >> 8 & 255)), n.gzhead.hcrc && (e.adler = pe(e.adler, n.pending_buf, n.pending, 0)), n.gzindex = 0, n.status = qt;
     else if ($(n, 0), $(n, 0), $(n, 0), $(n, 0), $(n, 0), $(n, n.level === 9 ? 2 : n.strategy >= _t || n.level < 2 ? 4 : 0), $(n, Ei), n.status = Ee, G(e), n.pending !== 0)
       return n.last_flush = -1, F;
   }
@@ -589,12 +589,12 @@ const ft = (e) => {
       let o = n.pending, i = (n.gzhead.extra.length & 65535) - n.gzindex;
       for (; n.pending + i > n.pending_buf_size; ) {
         let s = n.pending_buf_size - n.pending;
-        if (n.pending_buf.set(n.gzhead.extra.subarray(n.gzindex, n.gzindex + s), n.pending), n.pending = n.pending_buf_size, n.gzhead.hcrc && n.pending > o && (e.adler = he(e.adler, n.pending_buf, n.pending - o, o)), n.gzindex += s, G(e), n.pending !== 0)
+        if (n.pending_buf.set(n.gzhead.extra.subarray(n.gzindex, n.gzindex + s), n.pending), n.pending = n.pending_buf_size, n.gzhead.hcrc && n.pending > o && (e.adler = pe(e.adler, n.pending_buf, n.pending - o, o)), n.gzindex += s, G(e), n.pending !== 0)
           return n.last_flush = -1, F;
         o = 0, i -= s;
       }
       let a = new Uint8Array(n.gzhead.extra);
-      n.pending_buf.set(a.subarray(n.gzindex, n.gzindex + i), n.pending), n.pending += i, n.gzhead.hcrc && n.pending > o && (e.adler = he(e.adler, n.pending_buf, n.pending - o, o)), n.gzindex = 0;
+      n.pending_buf.set(a.subarray(n.gzindex, n.gzindex + i), n.pending), n.pending += i, n.gzhead.hcrc && n.pending > o && (e.adler = pe(e.adler, n.pending_buf, n.pending - o, o)), n.gzindex = 0;
     }
     n.status = Xt;
   }
@@ -603,13 +603,13 @@ const ft = (e) => {
       let o = n.pending, i;
       do {
         if (n.pending === n.pending_buf_size) {
-          if (n.gzhead.hcrc && n.pending > o && (e.adler = he(e.adler, n.pending_buf, n.pending - o, o)), G(e), n.pending !== 0)
+          if (n.gzhead.hcrc && n.pending > o && (e.adler = pe(e.adler, n.pending_buf, n.pending - o, o)), G(e), n.pending !== 0)
             return n.last_flush = -1, F;
           o = 0;
         }
         n.gzindex < n.gzhead.name.length ? i = n.gzhead.name.charCodeAt(n.gzindex++) & 255 : i = 0, $(n, i);
       } while (i !== 0);
-      n.gzhead.hcrc && n.pending > o && (e.adler = he(e.adler, n.pending_buf, n.pending - o, o)), n.gzindex = 0;
+      n.gzhead.hcrc && n.pending > o && (e.adler = pe(e.adler, n.pending_buf, n.pending - o, o)), n.gzindex = 0;
     }
     n.status = Yt;
   }
@@ -618,13 +618,13 @@ const ft = (e) => {
       let o = n.pending, i;
       do {
         if (n.pending === n.pending_buf_size) {
-          if (n.gzhead.hcrc && n.pending > o && (e.adler = he(e.adler, n.pending_buf, n.pending - o, o)), G(e), n.pending !== 0)
+          if (n.gzhead.hcrc && n.pending > o && (e.adler = pe(e.adler, n.pending_buf, n.pending - o, o)), G(e), n.pending !== 0)
             return n.last_flush = -1, F;
           o = 0;
         }
         n.gzindex < n.gzhead.comment.length ? i = n.gzhead.comment.charCodeAt(n.gzindex++) & 255 : i = 0, $(n, i);
       } while (i !== 0);
-      n.gzhead.hcrc && n.pending > o && (e.adler = he(e.adler, n.pending_buf, n.pending - o, o));
+      n.gzhead.hcrc && n.pending > o && (e.adler = pe(e.adler, n.pending_buf, n.pending - o, o));
     }
     n.status = Qt;
   }
@@ -637,14 +637,14 @@ const ft = (e) => {
     if (n.status = Ee, G(e), n.pending !== 0)
       return n.last_flush = -1, F;
   }
-  if (e.avail_in !== 0 || n.lookahead !== 0 || t !== me && n.status !== Ke) {
-    let o = n.level === 0 ? Nr(n, t) : n.strategy === _t ? Oi(n, t) : n.strategy === fi ? Zi(n, t) : Ge[n.level].func(n, t);
-    if ((o === $e || o === Ve) && (n.status = Ke), o === J || o === $e)
+  if (e.avail_in !== 0 || n.lookahead !== 0 || t !== ye && n.status !== Ge) {
+    let o = n.level === 0 ? Nr(n, t) : n.strategy === _t ? Oi(n, t) : n.strategy === fi ? Zi(n, t) : qe[n.level].func(n, t);
+    if ((o === $e || o === We) && (n.status = Ge), o === J || o === $e)
       return e.avail_out === 0 && (n.last_flush = -1), F;
-    if (o === Be && (t === ai ? ii(n) : t !== Nn && (Kt(n, 0, 0, !1), t === si && (pe(n.head), n.lookahead === 0 && (n.strstart = 0, n.block_start = 0, n.insert = 0))), G(e), e.avail_out === 0))
+    if (o === Ve && (t === ai ? ii(n) : t !== Nn && (Kt(n, 0, 0, !1), t === si && (_e(n.head), n.lookahead === 0 && (n.strstart = 0, n.block_start = 0, n.insert = 0))), G(e), e.avail_out === 0))
       return n.last_flush = -1, F;
   }
-  return t !== ee ? F : n.wrap <= 0 ? Pn : (n.wrap === 2 ? ($(n, e.adler & 255), $(n, e.adler >> 8 & 255), $(n, e.adler >> 16 & 255), $(n, e.adler >> 24 & 255), $(n, e.total_in & 255), $(n, e.total_in >> 8 & 255), $(n, e.total_in >> 16 & 255), $(n, e.total_in >> 24 & 255)) : (He(n, e.adler >>> 16), He(n, e.adler & 65535)), G(e), n.wrap > 0 && (n.wrap = -n.wrap), n.pending !== 0 ? F : Pn);
+  return t !== ee ? F : n.wrap <= 0 ? Pn : (n.wrap === 2 ? ($(n, e.adler & 255), $(n, e.adler >> 8 & 255), $(n, e.adler >> 16 & 255), $(n, e.adler >> 24 & 255), $(n, e.total_in & 255), $(n, e.total_in >> 8 & 255), $(n, e.total_in >> 16 & 255), $(n, e.total_in >> 24 & 255)) : (Ke(n, e.adler >>> 16), Ke(n, e.adler & 65535)), G(e), n.wrap > 0 && (n.wrap = -n.wrap), n.pending !== 0 ? F : Pn);
 }, Ri = (e) => {
   if (ft(e))
     return se;
@@ -655,24 +655,24 @@ const ft = (e) => {
   if (ft(e))
     return se;
   const r = e.state, o = r.wrap;
-  if (o === 2 || o === 1 && r.status !== Fe || r.lookahead)
+  if (o === 2 || o === 1 && r.status !== je || r.lookahead)
     return se;
   if (o === 1 && (e.adler = xr(e.adler, t, n, 0)), r.wrap = 0, n >= r.w_size) {
-    o === 0 && (pe(r.head), r.strstart = 0, r.block_start = 0, r.insert = 0);
+    o === 0 && (_e(r.head), r.strstart = 0, r.block_start = 0, r.insert = 0);
     let c = new Uint8Array(r.w_size);
     c.set(t.subarray(n - r.w_size, n), 0), t = c, n = r.w_size;
   }
   const i = e.avail_in, a = e.next_in, s = e.input;
-  for (e.avail_in = n, e.next_in = 0, e.input = t, je(r); r.lookahead >= z; ) {
+  for (e.avail_in = n, e.next_in = 0, e.input = t, Ue(r); r.lookahead >= z; ) {
     let c = r.strstart, u = r.lookahead - (z - 1);
     do
-      r.ins_h = ye(r, r.ins_h, r.window[c + z - 1]), r.prev[c & r.w_mask] = r.head[r.ins_h], r.head[r.ins_h] = c, c++;
+      r.ins_h = be(r, r.ins_h, r.window[c + z - 1]), r.prev[c & r.w_mask] = r.head[r.ins_h], r.head[r.ins_h] = c, c++;
     while (--u);
-    r.strstart = c, r.lookahead = z - 1, je(r);
+    r.strstart = c, r.lookahead = z - 1, Ue(r);
   }
   return r.strstart += r.lookahead, r.block_start = r.strstart, r.insert = r.lookahead, r.lookahead = 0, r.match_length = r.prev_length = z - 1, r.match_available = 0, e.next_in = a, e.input = s, e.avail_in = i, r.wrap = o, F;
 };
-var Ci = Ni, Fi = Dr, ji = Rr, Ui = Pr, Li = Ii, Mi = Pi, Ji = Ri, Bi = Di, Vi = "pako deflate (from Nodeca project)", et = {
+var Ci = Ni, Fi = Dr, ji = Rr, Ui = Pr, Li = Ii, Mi = Pi, Ji = Ri, Bi = Di, Vi = "pako deflate (from Nodeca project)", tt = {
   deflateInit: Ci,
   deflateInit2: Fi,
   deflateReset: ji,
@@ -716,10 +716,10 @@ try {
 } catch (e) {
   Fr = !1;
 }
-const it = new Uint8Array(256);
+const at = new Uint8Array(256);
 for (let e = 0; e < 256; e++)
-  it[e] = e >= 252 ? 6 : e >= 248 ? 5 : e >= 240 ? 4 : e >= 224 ? 3 : e >= 192 ? 2 : 1;
-it[254] = it[254] = 1;
+  at[e] = e >= 252 ? 6 : e >= 248 ? 5 : e >= 240 ? 4 : e >= 224 ? 3 : e >= 192 ? 2 : 1;
+at[254] = at[254] = 1;
 var Gi = (e) => {
   if (typeof TextEncoder == "function" && TextEncoder.prototype.encode)
     return new TextEncoder().encode(e);
@@ -750,7 +750,7 @@ var Xi = (e, t) => {
       i[o++] = a;
       continue;
     }
-    let s = it[a];
+    let s = at[a];
     if (s > 4) {
       i[o++] = 65533, r += s - 1;
       continue;
@@ -769,7 +769,7 @@ var Xi = (e, t) => {
   let n = t - 1;
   for (; n >= 0 && (e[n] & 192) === 128; )
     n--;
-  return n < 0 || n === 0 ? t : n + it[e[n]] > t ? n : t;
+  return n < 0 || n === 0 ? t : n + at[e[n]] > t ? n : t;
 }, jr = {
   string2buf: Gi,
   buf2string: Xi,
@@ -801,7 +801,7 @@ function At(e) {
   }, e || {});
   let t = this.options;
   t.raw && t.windowBits > 0 ? t.windowBits = -t.windowBits : t.gzip && t.windowBits > 0 && t.windowBits < 16 && (t.windowBits += 16), this.err = 0, this.msg = "", this.ended = !1, this.chunks = [], this.strm = new ea(), this.strm.avail_out = 0;
-  let n = et.deflateInit2(
+  let n = tt.deflateInit2(
     this.strm,
     t.level,
     t.method,
@@ -811,9 +811,9 @@ function At(e) {
   );
   if (n !== Et)
     throw new Error(St[n]);
-  if (t.header && et.deflateSetHeader(this.strm, t.header), t.dictionary) {
+  if (t.header && tt.deflateSetHeader(this.strm, t.header), t.dictionary) {
     let r;
-    if (typeof t.dictionary == "string" ? r = jr.string2buf(t.dictionary) : Ur.call(t.dictionary) === "[object ArrayBuffer]" ? r = new Uint8Array(t.dictionary) : r = t.dictionary, n = et.deflateSetDictionary(this.strm, r), n !== Et)
+    if (typeof t.dictionary == "string" ? r = jr.string2buf(t.dictionary) : Ur.call(t.dictionary) === "[object ArrayBuffer]" ? r = new Uint8Array(t.dictionary) : r = t.dictionary, n = tt.deflateSetDictionary(this.strm, r), n !== Et)
       throw new Error(St[n]);
     this._dict_set = !0;
   }
@@ -828,8 +828,8 @@ At.prototype.push = function(e, t) {
       this.onData(n.output.subarray(0, n.next_out)), n.avail_out = 0;
       continue;
     }
-    if (o = et.deflate(n, i), o === ia)
-      return n.next_out > 0 && this.onData(n.output.subarray(0, n.next_out)), o = et.deflateEnd(this.strm), this.onEnd(o), this.ended = !0, o === Et;
+    if (o = tt.deflate(n, i), o === ia)
+      return n.next_out > 0 && this.onData(n.output.subarray(0, n.next_out)), o = tt.deflateEnd(this.strm), this.onEnd(o), this.ended = !0, o === Et;
     if (n.avail_out === 0) {
       this.onData(n.output);
       continue;
@@ -862,7 +862,7 @@ var fa = la, da = {
 };
 const { gzip: ha } = da;
 var pa = ha;
-class ze extends Error {
+class he extends Error {
   constructor({
     name: t,
     reason: n,
@@ -977,7 +977,7 @@ class Vr extends Error {
   }
 }
 const Wr = {};
-function be(e) {
+function we(e) {
   return Wr;
 }
 function Hr(e) {
@@ -1039,7 +1039,7 @@ function Ze(e, t, n) {
     configurable: !0
   });
 }
-function ve(...e) {
+function ke(...e) {
   const t = {};
   for (const n of e) {
     const r = Object.getOwnPropertyDescriptors(n);
@@ -1069,7 +1069,7 @@ const ka = gn(() => {
     return !1;
   }
 });
-function Ue(e) {
+function Le(e) {
   if (Tt(e) === !1)
     return !1;
   const t = e.constructor;
@@ -1079,13 +1079,13 @@ function Ue(e) {
   return !(Tt(n) === !1 || Object.prototype.hasOwnProperty.call(n, "isPrototypeOf") === !1);
 }
 function Gr(e) {
-  return Ue(e) ? p({}, e) : Array.isArray(e) ? [...e] : e;
+  return Le(e) ? p({}, e) : Array.isArray(e) ? [...e] : e;
 }
 const za = /* @__PURE__ */ new Set(["string", "number", "symbol"]);
-function Le(e) {
+function Me(e) {
   return e.replace(/[.*+?^${}()|[\]\\]/g, "\\$&");
 }
-function ke(e, t, n) {
+function ze(e, t, n) {
   const r = new e._zod.constr(t != null ? t : e._zod.def);
   return (!t || n != null && n.parent) && (r._zod.parent = e), r;
 }
@@ -1116,7 +1116,7 @@ function Ta(e, t) {
   const n = e._zod.def, r = n.checks;
   if (r && r.length > 0)
     throw new Error(".pick() cannot be used on object schemas containing refinements");
-  const i = ve(e._zod.def, {
+  const i = ke(e._zod.def, {
     get shape() {
       const a = {};
       for (const s in t) {
@@ -1128,13 +1128,13 @@ function Ta(e, t) {
     },
     checks: []
   });
-  return ke(e, i);
+  return ze(e, i);
 }
 function $a(e, t) {
   const n = e._zod.def, r = n.checks;
   if (r && r.length > 0)
     throw new Error(".omit() cannot be used on object schemas containing refinements");
-  const i = ve(e._zod.def, {
+  const i = ke(e._zod.def, {
     get shape() {
       const a = p({}, e._zod.def.shape);
       for (const s in t) {
@@ -1146,10 +1146,10 @@ function $a(e, t) {
     },
     checks: []
   });
-  return ke(e, i);
+  return ze(e, i);
 }
 function Za(e, t) {
-  if (!Ue(t))
+  if (!Le(t))
     throw new Error("Invalid input to extend: expected a plain object");
   const n = e._zod.def.checks;
   if (n && n.length > 0) {
@@ -1158,27 +1158,27 @@ function Za(e, t) {
       if (Object.getOwnPropertyDescriptor(i, a) !== void 0)
         throw new Error("Cannot overwrite keys on object schemas containing refinements. Use `.safeExtend()` instead.");
   }
-  const o = ve(e._zod.def, {
+  const o = ke(e._zod.def, {
     get shape() {
       const i = p(p({}, e._zod.def.shape), t);
       return Ze(this, "shape", i), i;
     }
   });
-  return ke(e, o);
+  return ze(e, o);
 }
 function Oa(e, t) {
-  if (!Ue(t))
+  if (!Le(t))
     throw new Error("Invalid input to safeExtend: expected a plain object");
-  const n = ve(e._zod.def, {
+  const n = ke(e._zod.def, {
     get shape() {
       const r = p(p({}, e._zod.def.shape), t);
       return Ze(this, "shape", r), r;
     }
   });
-  return ke(e, n);
+  return ze(e, n);
 }
 function xa(e, t) {
-  const n = ve(e._zod.def, {
+  const n = ke(e._zod.def, {
     get shape() {
       const r = p(p({}, e._zod.def.shape), t._zod.def.shape);
       return Ze(this, "shape", r), r;
@@ -1189,13 +1189,13 @@ function xa(e, t) {
     checks: []
     // delete existing checks
   });
-  return ke(e, n);
+  return ze(e, n);
 }
 function Aa(e, t, n) {
   const o = t._zod.def.checks;
   if (o && o.length > 0)
     throw new Error(".partial() cannot be used on object schemas containing refinements");
-  const a = ve(t._zod.def, {
+  const a = ke(t._zod.def, {
     get shape() {
       const s = t._zod.def.shape, c = p({}, s);
       if (n)
@@ -1217,10 +1217,10 @@ function Aa(e, t, n) {
     },
     checks: []
   });
-  return ke(t, a);
+  return ze(t, a);
 }
 function Ia(e, t, n) {
-  const r = ve(t._zod.def, {
+  const r = ke(t._zod.def, {
     get shape() {
       const o = t._zod.def.shape, i = p({}, o);
       if (n)
@@ -1241,7 +1241,7 @@ function Ia(e, t, n) {
       return Ze(this, "shape", i), i;
     }
   });
-  return ke(t, r);
+  return ze(t, r);
 }
 function Ne(e, t = 0) {
   var n;
@@ -1262,7 +1262,7 @@ function Pe(e, t) {
 function gt(e) {
   return typeof e == "string" ? e : e == null ? void 0 : e.message;
 }
-function we(e, t, n) {
+function ve(e, t, n) {
   var o, i, a, s, c, u, l, d, f, _, m;
   const r = y(p({}, e), { path: (o = e.path) != null ? o : [] });
   if (!e.message) {
@@ -1274,7 +1274,7 @@ function we(e, t, n) {
 function bn(e) {
   return Array.isArray(e) ? "array" : typeof e == "string" ? "string" : "unknown";
 }
-function at(...e) {
+function st(...e) {
   const [t, n, r] = e;
   return typeof t == "string" ? {
     message: t,
@@ -1328,7 +1328,7 @@ const wn = (e) => (t, n, r, o) => {
   if (a instanceof Promise)
     throw new De();
   if (a.issues.length) {
-    const c = new ((s = o == null ? void 0 : o.Err) != null ? s : e)(a.issues.map((u) => we(u, i, be())));
+    const c = new ((s = o == null ? void 0 : o.Err) != null ? s : e)(a.issues.map((u) => ve(u, i, we())));
     throw Kr(c, o == null ? void 0 : o.callee), c;
   }
   return a.value;
@@ -1337,7 +1337,7 @@ const wn = (e) => (t, n, r, o) => {
   const i = r ? Object.assign(r, { async: !0 }) : { async: !0 };
   let a = t._zod.run({ value: n, issues: [] }, i);
   if (a instanceof Promise && (a = yield a), a.issues.length) {
-    const c = new ((s = o == null ? void 0 : o.Err) != null ? s : e)(a.issues.map((u) => we(u, i, be())));
+    const c = new ((s = o == null ? void 0 : o.Err) != null ? s : e)(a.issues.map((u) => ve(u, i, we())));
     throw Kr(c, o == null ? void 0 : o.callee), c;
   }
   return a.value;
@@ -1347,14 +1347,14 @@ const wn = (e) => (t, n, r, o) => {
     throw new De();
   return i.issues.length ? {
     success: !1,
-    error: new (e != null ? e : Xr)(i.issues.map((a) => we(a, o, be())))
+    error: new (e != null ? e : Xr)(i.issues.map((a) => ve(a, o, we())))
   } : { success: !0, data: i.value };
 }, Ra = /* @__PURE__ */ It(Yr), Nt = (e) => (t, n, r) => k(null, null, function* () {
   const o = r ? Object.assign(r, { async: !0 }) : { async: !0 };
   let i = t._zod.run({ value: n, issues: [] }, o);
   return i instanceof Promise && (i = yield i), i.issues.length ? {
     success: !1,
-    error: new e(i.issues.map((a) => we(a, o, be())))
+    error: new e(i.issues.map((a) => ve(a, o, we())))
   } : { success: !0, data: i.value };
 }), Da = /* @__PURE__ */ Nt(Yr), Ca = (e) => (t, n, r) => {
   const o = r ? Object.assign(r, { direction: "backward" }) : { direction: "backward" };
@@ -1630,7 +1630,7 @@ const fs = (e) => {
   (n = t.pattern) != null || (t.pattern = _s), Pt.init(e, t);
 }), Ss = /* @__PURE__ */ h("$ZodCheckIncludes", (e, t) => {
   W.init(e, t);
-  const n = Le(t.includes), r = new RegExp(typeof t.position == "number" ? `^.{${t.position}}${n}` : n);
+  const n = Me(t.includes), r = new RegExp(typeof t.position == "number" ? `^.{${t.position}}${n}` : n);
   t.pattern = r, e._zod.onattach.push((o) => {
     var a;
     const i = o._zod.bag;
@@ -1649,7 +1649,7 @@ const fs = (e) => {
 }), Es = /* @__PURE__ */ h("$ZodCheckStartsWith", (e, t) => {
   var r;
   W.init(e, t);
-  const n = new RegExp(`^${Le(t.prefix)}.*`);
+  const n = new RegExp(`^${Me(t.prefix)}.*`);
   (r = t.pattern) != null || (t.pattern = n), e._zod.onattach.push((o) => {
     var a;
     const i = o._zod.bag;
@@ -1668,7 +1668,7 @@ const fs = (e) => {
 }), Ts = /* @__PURE__ */ h("$ZodCheckEndsWith", (e, t) => {
   var r;
   W.init(e, t);
-  const n = new RegExp(`.*${Le(t.suffix)}$`);
+  const n = new RegExp(`.*${Me(t.suffix)}$`);
   (r = t.pattern) != null || (t.pattern = n), e._zod.onattach.push((o) => {
     var a;
     const i = o._zod.bag;
@@ -2258,7 +2258,7 @@ function Vn(e, t, n, r) {
     code: "invalid_union",
     input: t.value,
     inst: n,
-    errors: e.map((i) => i.issues.map((a) => we(a, r, be())))
+    errors: e.map((i) => i.issues.map((a) => ve(a, r, we())))
   }), t);
 }
 const cc = /* @__PURE__ */ h("$ZodUnion", (e, t) => {
@@ -2303,7 +2303,7 @@ function nn(e, t) {
     return { valid: !0, data: e };
   if (e instanceof Date && t instanceof Date && +e == +t)
     return { valid: !0, data: e };
-  if (Ue(e) && Ue(t)) {
+  if (Le(e) && Le(t)) {
     const n = Object.keys(t), r = Object.keys(e).filter((i) => n.indexOf(i) !== -1), o = p(p({}, e), t);
     for (const i of r) {
       const a = nn(e[i], t[i]);
@@ -2360,7 +2360,7 @@ function Wn(e, t, n) {
 const lc = /* @__PURE__ */ h("$ZodRecord", (e, t) => {
   I.init(e, t), e._zod.parse = (n, r) => {
     const o = n.value;
-    if (!Ue(o))
+    if (!Le(o))
       return n.issues.push({
         expected: "record",
         code: "invalid_type",
@@ -2406,7 +2406,7 @@ const lc = /* @__PURE__ */ h("$ZodRecord", (e, t) => {
           t.mode === "loose" ? n.value[s] = o[s] : n.issues.push({
             code: "invalid_key",
             origin: "record",
-            issues: c.issues.map((d) => we(d, r, be())),
+            issues: c.issues.map((d) => ve(d, r, we())),
             input: s,
             path: [s],
             inst: e
@@ -2424,7 +2424,7 @@ const lc = /* @__PURE__ */ h("$ZodRecord", (e, t) => {
 }), fc = /* @__PURE__ */ h("$ZodEnum", (e, t) => {
   I.init(e, t);
   const n = Hr(t.entries), r = new Set(n);
-  e._zod.values = r, e._zod.pattern = new RegExp(`^(${n.filter((o) => za.has(typeof o)).map((o) => typeof o == "string" ? Le(o) : o.toString()).join("|")})$`), e._zod.parse = (o, i) => {
+  e._zod.values = r, e._zod.pattern = new RegExp(`^(${n.filter((o) => za.has(typeof o)).map((o) => typeof o == "string" ? Me(o) : o.toString()).join("|")})$`), e._zod.parse = (o, i) => {
     const a = o.value;
     return r.has(a) || o.issues.push({
       code: "invalid_value",
@@ -2437,7 +2437,7 @@ const lc = /* @__PURE__ */ h("$ZodRecord", (e, t) => {
   if (I.init(e, t), t.values.length === 0)
     throw new Error("Cannot create literal schema with no valid values");
   const n = new Set(t.values);
-  e._zod.values = n, e._zod.pattern = new RegExp(`^(${t.values.map((r) => typeof r == "string" ? Le(r) : r ? Le(r.toString()) : String(r)).join("|")})$`), e._zod.parse = (r, o) => {
+  e._zod.values = n, e._zod.pattern = new RegExp(`^(${t.values.map((r) => typeof r == "string" ? Me(r) : r ? Me(r.toString()) : String(r)).join("|")})$`), e._zod.parse = (r, o) => {
     const i = r.value;
     return n.has(i) || r.issues.push({
       code: "invalid_value",
@@ -2518,12 +2518,12 @@ const bc = /* @__PURE__ */ h("$ZodCatch", (e, t) => {
     const o = t.innerType._zod.run(n, r);
     return o instanceof Promise ? o.then((i) => (n.value = i.value, i.issues.length && (n.value = t.catchValue(y(p({}, n), {
       error: {
-        issues: i.issues.map((a) => we(a, r, be()))
+        issues: i.issues.map((a) => ve(a, r, we()))
       },
       input: n.value
     })), n.issues = []), n)) : (n.value = o.value, o.issues.length && (n.value = t.catchValue(y(p({}, n), {
       error: {
-        issues: o.issues.map((i) => we(i, r, be()))
+        issues: o.issues.map((i) => ve(i, r, we()))
       },
       input: n.value
     })), n.issues = []), n);
@@ -2579,7 +2579,7 @@ function Xn(e, t, n, r) {
       continue: !r._zod.def.abort
       // params: inst._zod.def.params,
     };
-    r._zod.def.params && (i.params = r._zod.def.params), t.issues.push(at(i));
+    r._zod.def.params && (i.params = r._zod.def.params), t.issues.push(st(i));
   }
 }
 var Yn;
@@ -2618,7 +2618,7 @@ function Sc() {
 }
 var pr;
 (pr = (Yn = globalThis).__zod_globalRegistry) != null || (Yn.__zod_globalRegistry = Sc());
-const qe = globalThis.__zod_globalRegistry;
+const Xe = globalThis.__zod_globalRegistry;
 // @__NO_SIDE_EFFECTS__
 function Ec(e, t) {
   return new e(p({
@@ -3015,7 +3015,7 @@ function su(e, t) {
   }));
 }
 // @__NO_SIDE_EFFECTS__
-function We(e) {
+function He(e) {
   return new $s({
     check: "overwrite",
     tx: e
@@ -3023,23 +3023,23 @@ function We(e) {
 }
 // @__NO_SIDE_EFFECTS__
 function cu(e) {
-  return /* @__PURE__ */ We((t) => t.normalize(e));
+  return /* @__PURE__ */ He((t) => t.normalize(e));
 }
 // @__NO_SIDE_EFFECTS__
 function uu() {
-  return /* @__PURE__ */ We((e) => e.trim());
+  return /* @__PURE__ */ He((e) => e.trim());
 }
 // @__NO_SIDE_EFFECTS__
 function lu() {
-  return /* @__PURE__ */ We((e) => e.toLowerCase());
+  return /* @__PURE__ */ He((e) => e.toLowerCase());
 }
 // @__NO_SIDE_EFFECTS__
 function fu() {
-  return /* @__PURE__ */ We((e) => e.toUpperCase());
+  return /* @__PURE__ */ He((e) => e.toUpperCase());
 }
 // @__NO_SIDE_EFFECTS__
 function du() {
-  return /* @__PURE__ */ We((e) => va(e));
+  return /* @__PURE__ */ He((e) => va(e));
 }
 // @__NO_SIDE_EFFECTS__
 function hu(e, t, n) {
@@ -3061,10 +3061,10 @@ function _u(e) {
   const t = /* @__PURE__ */ gu((n) => (n.addIssue = (r) => {
     var o, i, a, s;
     if (typeof r == "string")
-      n.issues.push(at(r, n.value, t._zod.def));
+      n.issues.push(st(r, n.value, t._zod.def));
     else {
       const c = r;
-      c.fatal && (c.continue = !1), (o = c.code) != null || (c.code = "custom"), (i = c.input) != null || (c.input = n.value), (a = c.inst) != null || (c.inst = t), (s = c.continue) != null || (c.continue = !t._zod.def.abort), n.issues.push(at(c));
+      c.fatal && (c.continue = !1), (o = c.code) != null || (c.code = "custom"), (i = c.input) != null || (c.input = n.value), (a = c.inst) != null || (c.inst = t), (s = c.continue) != null || (c.continue = !t._zod.def.abort), n.issues.push(st(c));
     }
   }, e(n.value, n)));
   return t;
@@ -3081,7 +3081,7 @@ function po(e) {
   let t = (n = e == null ? void 0 : e.target) != null ? n : "draft-2020-12";
   return t === "draft-4" && (t = "draft-04"), t === "draft-7" && (t = "draft-07"), {
     processors: (r = e.processors) != null ? r : {},
-    metadataRegistry: (o = e == null ? void 0 : e.metadata) != null ? o : qe,
+    metadataRegistry: (o = e == null ? void 0 : e.metadata) != null ? o : Xe,
     target: t,
     unrepresentable: (i = e == null ? void 0 : e.unrepresentable) != null ? i : "throw",
     override: (a = e == null ? void 0 : e.override) != null ? a : (() => {
@@ -3530,7 +3530,7 @@ const Ku = (e, t) => {
   }
 }), e.toJSONSchema = mu(e, {}), e.def = t, e.type = t.type, Object.defineProperty(e, "_def", { value: t }), e.check = (...n) => {
   var r;
-  return e.clone(ve(t, {
+  return e.clone(ke(t, {
     checks: [
       ...(r = t.checks) != null ? r : [],
       ...n.map((o) => typeof o == "function" ? { _zod: { check: o, def: { check: "custom" }, onattach: [] } } : o)
@@ -3538,7 +3538,7 @@ const Ku = (e, t) => {
   }), {
     parent: !0
   });
-}, e.with = e.check, e.clone = (n, r) => ke(e, n, r), e.brand = () => e, e.register = ((n, r) => (n.add(e, r), e)), e.parse = (n, r) => Gu(e, n, r, { callee: e.parse }), e.safeParse = (n, r) => Xu(e, n, r), e.parseAsync = (n, r) => k(null, null, function* () {
+}, e.with = e.check, e.clone = (n, r) => ze(e, n, r), e.brand = () => e, e.register = ((n, r) => (n.add(e, r), e)), e.parse = (n, r) => Gu(e, n, r, { callee: e.parse }), e.safeParse = (n, r) => Xu(e, n, r), e.parseAsync = (n, r) => k(null, null, function* () {
   return qu(e, n, r, { callee: e.parseAsync });
 }), e.safeParseAsync = (n, r) => k(null, null, function* () {
   return Yu(e, n, r);
@@ -3550,20 +3550,20 @@ const Ku = (e, t) => {
   return il(e, n, r);
 }), e.safeDecodeAsync = (n, r) => k(null, null, function* () {
   return al(e, n, r);
-}), e.refine = (n, r) => e.check(tf(n, r)), e.superRefine = (n) => e.check(nf(n)), e.overwrite = (n) => e.check(/* @__PURE__ */ We(n)), e.optional = () => ar(e), e.exactOptional = () => Ml(e), e.nullable = () => sr(e), e.nullish = () => ar(sr(e)), e.nonoptional = (n) => Kl(e, n), e.array = () => on(e), e.or = (n) => wo([e, n]), e.and = (n) => Rl(e, n), e.transform = (n) => cr(e, Ul(n)), e.default = (n) => Vl(e, n), e.prefault = (n) => Hl(e, n), e.catch = (n) => ql(e, n), e.pipe = (n) => cr(e, n), e.readonly = () => Ql(e), e.describe = (n) => {
+}), e.refine = (n, r) => e.check(tf(n, r)), e.superRefine = (n) => e.check(nf(n)), e.overwrite = (n) => e.check(/* @__PURE__ */ He(n)), e.optional = () => ar(e), e.exactOptional = () => Ml(e), e.nullable = () => sr(e), e.nullish = () => ar(sr(e)), e.nonoptional = (n) => Kl(e, n), e.array = () => on(e), e.or = (n) => wo([e, n]), e.and = (n) => Rl(e, n), e.transform = (n) => cr(e, Ul(n)), e.default = (n) => Vl(e, n), e.prefault = (n) => Hl(e, n), e.catch = (n) => ql(e, n), e.pipe = (n) => cr(e, n), e.readonly = () => Ql(e), e.describe = (n) => {
   const r = e.clone();
-  return qe.add(r, { description: n }), r;
+  return Xe.add(r, { description: n }), r;
 }, Object.defineProperty(e, "description", {
   get() {
     var n;
-    return (n = qe.get(e)) == null ? void 0 : n.description;
+    return (n = Xe.get(e)) == null ? void 0 : n.description;
   },
   configurable: !0
 }), e.meta = (...n) => {
   if (n.length === 0)
-    return qe.get(e);
+    return Xe.get(e);
   const r = e.clone();
-  return qe.add(r, n[0]), r;
+  return Xe.add(r, n[0]), r;
 }, e.isOptional = () => e.safeParse(void 0).success, e.isNullable = () => e.safeParse(null).success, e.apply = (n) => n(e), e)), yo = /* @__PURE__ */ h("_ZodString", (e, t) => {
   var r, o, i;
   kn.init(e, t), N.init(e, t), e._zod.processJSONSchema = (a, s, c) => bu(e, a, s);
@@ -3655,7 +3655,7 @@ function on(e, t) {
   return /* @__PURE__ */ hu(Al, e, t);
 }
 const Il = /* @__PURE__ */ h("ZodObject", (e, t) => {
-  sc.init(e, t), N.init(e, t), e._zod.processJSONSchema = (n, r, o) => Ou(e, n, r, o), Z(e, "shape", () => t.shape), e.keyof = () => Xe(Object.keys(e._zod.def.shape)), e.catchall = (n) => e.clone(y(p({}, e._zod.def), { catchall: n })), e.passthrough = () => e.clone(y(p({}, e._zod.def), { catchall: rn() })), e.loose = () => e.clone(y(p({}, e._zod.def), { catchall: rn() })), e.strict = () => e.clone(y(p({}, e._zod.def), { catchall: xl() })), e.strip = () => e.clone(y(p({}, e._zod.def), { catchall: void 0 })), e.extend = (n) => Za(e, n), e.safeExtend = (n) => Oa(e, n), e.merge = (n) => xa(e, n), e.pick = (n) => Ta(e, n), e.omit = (n) => $a(e, n), e.partial = (...n) => Aa(vo, e, n[0]), e.required = (...n) => Ia(ko, e, n[0]);
+  sc.init(e, t), N.init(e, t), e._zod.processJSONSchema = (n, r, o) => Ou(e, n, r, o), Z(e, "shape", () => t.shape), e.keyof = () => Ye(Object.keys(e._zod.def.shape)), e.catchall = (n) => e.clone(y(p({}, e._zod.def), { catchall: n })), e.passthrough = () => e.clone(y(p({}, e._zod.def), { catchall: rn() })), e.loose = () => e.clone(y(p({}, e._zod.def), { catchall: rn() })), e.strict = () => e.clone(y(p({}, e._zod.def), { catchall: xl() })), e.strip = () => e.clone(y(p({}, e._zod.def), { catchall: void 0 })), e.extend = (n) => Za(e, n), e.safeExtend = (n) => Oa(e, n), e.merge = (n) => xa(e, n), e.pick = (n) => Ta(e, n), e.omit = (n) => $a(e, n), e.partial = (...n) => Aa(vo, e, n[0]), e.required = (...n) => Ia(ko, e, n[0]);
 });
 function bt(e, t) {
   const n = p({
@@ -3722,7 +3722,7 @@ const an = /* @__PURE__ */ h("ZodEnum", (e, t) => {
     }));
   };
 });
-function Xe(e, t) {
+function Ye(e, t) {
   const n = Array.isArray(e) ? Object.fromEntries(e.map((r) => [r, r])) : e;
   return new an(p({
     type: "enum",
@@ -3751,10 +3751,10 @@ const jl = /* @__PURE__ */ h("ZodTransform", (e, t) => {
     n.addIssue = (i) => {
       var a, s, c;
       if (typeof i == "string")
-        n.issues.push(at(i, n.value, t));
+        n.issues.push(st(i, n.value, t));
       else {
         const u = i;
-        u.fatal && (u.continue = !1), (a = u.code) != null || (u.code = "custom"), (s = u.input) != null || (u.input = n.value), (c = u.inst) != null || (u.inst = e), n.issues.push(at(u));
+        u.fatal && (u.continue = !1), (a = u.code) != null || (u.code = "custom"), (s = u.input) != null || (u.input = n.value), (c = u.inst) != null || (u.inst = e), n.issues.push(st(u));
       }
     };
     const o = t.transform(n.value, n);
@@ -3867,7 +3867,7 @@ function nf(e) {
   return /* @__PURE__ */ _u(e);
 }
 const rf = bt({
-  language: Xe(["typescript", "javascript"]).optional(),
+  language: Ye(["typescript", "javascript"]).optional(),
   disableMarkedForExport: Y().optional(),
   allowAutoSelectFirstNode: Y().optional().default(!0),
   enableDisplayDataId: Y().optional(),
@@ -3878,8 +3878,8 @@ const rf = bt({
     bt({
       framework: ir("react"),
       model: Ae().optional(),
-      styling: Xe(["plain_css", "tailwind", "inline_styles"]),
-      uiLibrary: Xe(["mui", "antd", "radix", "shadcn", "clean_react", "custom_design_system"]).optional(),
+      styling: Ye(["plain_css", "tailwind", "inline_styles"]),
+      uiLibrary: Ye(["mui", "antd", "radix", "shadcn", "clean_react", "custom_design_system"]).optional(),
       responsivePages: on(
         bt({
           name: Ae(),
@@ -3899,7 +3899,7 @@ const rf = bt({
     }),
     bt({
       framework: ir("html"),
-      styling: Xe(["plain_css", "inline_styles", "tailwind"]),
+      styling: Ye(["plain_css", "inline_styles", "tailwind"]),
       enableTranslation: Y().optional()
     })
   ])
@@ -4076,7 +4076,7 @@ const ff = /* @__PURE__ */ sf(lf), zn = typeof Buffer != "undefined", df = zn &&
     return t;
   }
 );
-function Me(e) {
+function Je(e) {
   return hf(e) ? "Buffer" : ff(e);
 }
 const _f = /* @__PURE__ */ new Set([
@@ -4087,7 +4087,7 @@ const _f = /* @__PURE__ */ new Set([
   "Set"
 ]);
 function gf(e, t, n = null) {
-  switch (n || Me(e)) {
+  switch (n || Je(e)) {
     case "Arguments":
     case "Array":
     case "Object":
@@ -4102,7 +4102,7 @@ function sn(e) {
   return _f.has(e);
 }
 function fr(e, t, n, r = null) {
-  switch (r || Me(e)) {
+  switch (r || Je(e)) {
     case "Arguments":
     case "Array":
     case "Object":
@@ -4221,7 +4221,7 @@ function If() {
 }
 function cn(e, t = null, n = If) {
   arguments.length === 2 && typeof t == "function" && (n = t, t = null);
-  const r = t || Me(e), o = Af.get(r);
+  const r = t || Je(e), o = Af.get(r);
   if (r === "Object") {
     const i = n(e, r);
     if (i !== void 0)
@@ -4238,14 +4238,14 @@ function hr(e, t = {}) {
     customizer: n
     // TODO: max depth
     // depth = Infinity,
-  } = t, r = Me(e);
+  } = t, r = Je(e);
   if (!sn(r))
     return un(e, null, null, null);
   const o = cn(e, r, n), i = new WeakMap([[e, o]]), a = new WeakSet([e]);
   return un(e, o, i, a);
 }
 function un(e, t, n, r, o) {
-  const i = Me(e), a = cn(e, i);
+  const i = Je(e), a = cn(e, i);
   if (!sn(i))
     return a;
   let s;
@@ -4267,7 +4267,7 @@ function un(e, t, n, r, o) {
     if (r.has(u))
       fr(t, c, n.get(u), i);
     else {
-      const l = Me(u), d = cn(u, l);
+      const l = Je(u), d = cn(u, l);
       sn(l) && (n.set(u, d), r.add(u)), fr(
         t,
         c,
@@ -4283,7 +4283,7 @@ function un(e, t, n, r, o) {
   }
   return t;
 }
-var st, Ce, de, Q, V, ln, kt, Ye;
+var ct, Ce, de, Q, V, ln, kt, Qe;
 class Nf {
   constructor({
     fetch: t = globalThis.fetch.bind(globalThis),
@@ -4291,11 +4291,11 @@ class Nf {
     defaultOptions: r = {}
   } = {}) {
     re(this, V);
-    re(this, st);
+    re(this, ct);
     re(this, Ce);
     re(this, de);
     re(this, Q);
-    X(this, st, n), X(this, Ce, t), X(this, Q, r), X(this, de, v(this, Q)), r.token && j(this, V, ln).call(this, r.token);
+    X(this, ct, n), X(this, Ce, t), X(this, Q, r), X(this, de, v(this, Q)), r.token && j(this, V, ln).call(this, r.token);
   }
   hasDefaultToken() {
     return !!v(this, Q).token;
@@ -4330,7 +4330,7 @@ class Nf {
       });
       n.length > 0 && i.append("ids", n.join(",")), r && i.append("depth", `${r}`);
       const a = i.toString(), s = `v1/files/${t}?${a}`;
-      return yield j(this, V, Ye).call(this, s);
+      return yield j(this, V, Qe).call(this, s);
     });
   }
   getNodeImages(a) {
@@ -4341,7 +4341,7 @@ class Nf {
       as: o = "arrayBuffer",
       format: i = "jpg"
     }) {
-      const c = (yield j(this, V, Ye).call(this, `v1/images/${t}?ids=${n}&format=${i}&scale=${r}`)).images;
+      const c = (yield j(this, V, Qe).call(this, `v1/images/${t}?ids=${n}&format=${i}&scale=${r}`)).images;
       if (o === "links")
         return c;
       const u = n.map((f) => k(this, null, function* () {
@@ -4366,16 +4366,16 @@ class Nf {
     }) {
       var i, a;
       const r = `v1/files/${t}/images`;
-      return (a = (i = (yield j(this, V, Ye).call(this, r)).meta) == null ? void 0 : i.images) != null ? a : {};
+      return (a = (i = (yield j(this, V, Qe).call(this, r)).meta) == null ? void 0 : i.images) != null ? a : {};
     });
   }
   getMe() {
     return k(this, null, function* () {
-      return yield j(this, V, Ye).call(this, "v1/me");
+      return yield j(this, V, Qe).call(this, "v1/me");
     });
   }
 }
-st = new WeakMap(), Ce = new WeakMap(), de = new WeakMap(), Q = new WeakMap(), V = new WeakSet(), ln = function(t) {
+ct = new WeakMap(), Ce = new WeakMap(), de = new WeakMap(), Q = new WeakMap(), V = new WeakSet(), ln = function(t) {
   if (!t.startsWith("figd_") && !t.startsWith("figu_"))
     throw new _a();
 }, kt = function(t, n) {
@@ -4428,12 +4428,12 @@ st = new WeakMap(), Ce = new WeakMap(), de = new WeakMap(), Q = new WeakMap(), V
     }
     return r;
   });
-}, Ye = function(t) {
+}, Qe = function(t) {
   return k(this, null, function* () {
     const n = hr(v(this, de));
     X(this, de, hr(v(this, Q)));
     const r = () => k(this, null, function* () {
-      return yield v(this, Ce).call(this, `${v(this, st)}${t}`, {
+      return yield v(this, Ce).call(this, `${v(this, ct)}${t}`, {
         method: "GET",
         headers: this.getHeaders(n.token),
         signal: n.abortSignal
@@ -4456,7 +4456,7 @@ const Pf = {
   l2c: "l2c",
   p2c: "p2c"
 };
-var x, ct, ut, ae, So, Ie;
+var x, Fe, ut, ae, So, Ie;
 class Gf {
   constructor({
     auth: t,
@@ -4465,9 +4465,9 @@ class Gf {
   } = {}) {
     re(this, ae);
     re(this, x);
-    re(this, ct);
+    re(this, Fe);
     re(this, ut);
-    X(this, ct, n), X(this, ut, r), t && (this.auth = t);
+    X(this, Fe, n), X(this, ut, r), t && (this.auth = t);
   }
   hasAuth() {
     return !!v(this, x);
@@ -4579,12 +4579,43 @@ class Gf {
             type: "bundled"
           },
           engine: s,
-          htmlOptimizations: t.htmlOptimizations
+          htmlOptimizations: t.htmlOptimizations,
+          subpages: t.subpages
         }, (u = t.settings.codegenSettings) != null ? u : {})
       };
       return j(this, ae, Ie).call(this, "POST", "/v1/l2c", c, n, "l2c", r);
     });
   }
+  discoverSubpages(t, n) {
+    return k(this, null, function* () {
+      if (this.hasAuth() === !1)
+        throw new Error('It needs to set "auth" before calling this method.');
+      const r = yield fetch(
+        `${v(this, Fe)}/v1/l2c/discover-subpages`,
+        {
+          method: "POST",
+          headers: this.headers,
+          body: JSON.stringify(t),
+          signal: n
+        }
+      );
+      if (!r.ok) {
+        const o = yield r.text();
+        let i = o;
+        try {
+          const a = JSON.parse(o);
+          typeof (a == null ? void 0 : a.error) == "string" ? i = a.error : typeof (a == null ? void 0 : a.message) == "string" && (i = a.message);
+        } catch (a) {
+        }
+        throw new he({
+          name: "HTTP error from Anima API",
+          reason: i || "Failed to discover website subpages",
+          status: r.status
+        });
+      }
+      return r.json();
+    });
+  }
   /**
    * Generates code from a text prompt using AI.
    *
@@ -4666,7 +4697,7 @@ class Gf {
     });
   }
 }
-x = new WeakMap(), ct = new WeakMap(), ut = new WeakMap(), ae = new WeakSet(), So = function(t, n, r) {
+x = new WeakMap(), Fe = new WeakMap(), ut = new WeakMap(), ae = new WeakSet(), So = function(t, n, r) {
   return k(this, null, function* () {
     const i = n.map(
       (a) => af(t, a, r)
@@ -4674,7 +4705,7 @@ x = new WeakMap(), ct = new WeakMap(), ut = new WeakMap(), ae = new WeakSet(), S
       (a) => !a.isValid
     );
     if (i)
-      throw new ze({
+      throw new he({
         name: "Task Crashed",
         reason: i.reason
       });
@@ -4698,7 +4729,7 @@ x = new WeakMap(), ct = new WeakMap(), ut = new WeakMap(), ae = new WeakSet(), S
         "Content-Type": "application/json"
       });
     }
-    const u = yield fetch(`${v(this, ct)}${n}`, c);
+    const u = yield fetch(`${v(this, Fe)}${n}`, c);
     if (!u.ok) {
       const D = yield u.text();
       let ne;
@@ -4709,23 +4740,23 @@ x = new WeakMap(), ct = new WeakMap(), ut = new WeakMap(), ae = new WeakSet(), S
       throw ((w = ne == null ? void 0 : ne.error) == null ? void 0 : w.name) === "ZodError" ? (console.log(
         "Zod validation error:",
         JSON.stringify(ne.error.issues, null, 2)
-      ), new ze({
+      ), new he({
         name: "HTTP error from Anima API",
         reason: "Invalid body payload",
         detail: ne.error.issues,
         status: u.status
-      })) : typeof ne == "object" ? new ze({
+      })) : typeof ne == "object" ? new he({
         name: `Error "${ne}"`,
         reason: "Unknown",
         status: u.status
-      }) : new ze({
+      }) : new he({
         name: "HTTP error from Anima API",
         reason: D,
         status: u.status
       });
     }
     if (!u.body)
-      throw new ze({
+      throw new he({
         name: "Stream Error",
         reason: "Response body is null",
         status: u.status
@@ -4808,7 +4839,7 @@ x = new WeakMap(), ct = new WeakMap(), ut = new WeakMap(), ae = new WeakSet(), S
                 break;
               }
               case "error":
-                throw new ze({
+                throw new he({
                   name: E.payload.errorName,
                   reason: E.payload.reason
                 });
@@ -4820,7 +4851,7 @@ x = new WeakMap(), ct = new WeakMap(), ut = new WeakMap(), ae = new WeakSet(), S
     } finally {
       f.cancel();
     }
-    throw new ze({
+    throw new he({
       name: "Connection",
       reason: "Connection closed before the 'done' message",
       status: 500
@@ -4986,7 +5017,7 @@ const ed = (e, t) => k(null, null, function* () {
 });
 export {
   Gf as Anima,
-  ze as CodegenError,
+  he as CodegenError,
   Cn as ExpiredFigmaToken,
   Nf as FigmaRestApi,
   Fn as FileNotExportable,