npm - @animaapp/anima-sdk - Versions diffs - 0.8.0 → 0.10.0 - Mend

@animaapp/anima-sdk 0.8.0 → 0.10.0

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.

Files changed (6) hide show

package/dist/index.js CHANGED Viewed

@@ -1,19 +1,19 @@
-var Zr = Object.defineProperty, zr = Object.defineProperties;
-var Lr = Object.getOwnPropertyDescriptors;
+var Dr = Object.defineProperty, Lr = Object.defineProperties;
+var Fr = Object.getOwnPropertyDescriptors;
 var yn = Object.getOwnPropertySymbols;
-var Dr = Object.prototype.hasOwnProperty, $r = Object.prototype.propertyIsEnumerable;
+var $r = Object.prototype.hasOwnProperty, jr = Object.prototype.propertyIsEnumerable;
 var bn = (e) => {
   throw TypeError(e);
-}, wn = Math.pow, vn = (e, t, n) => t in e ? Zr(e, t, { enumerable: !0, configurable: !0, writable: !0, value: n }) : e[t] = n, d = (e, t) => {
+}, wn = Math.pow, vn = (e, t, n) => t in e ? Dr(e, t, { enumerable: !0, configurable: !0, writable: !0, value: n }) : e[t] = n, d = (e, t) => {
   for (var n in t || (t = {}))
-    Dr.call(t, n) && vn(e, n, t[n]);
+    $r.call(t, n) && vn(e, n, t[n]);
   if (yn)
     for (var n of yn(t))
-      $r.call(t, n) && vn(e, n, t[n]);
+      jr.call(t, n) && vn(e, n, t[n]);
   return e;
-}, v = (e, t) => zr(e, Lr(t));
-var Zt = (e, t, n) => t.has(e) || bn("Cannot " + n);
-var w = (e, t, n) => (Zt(e, t, "read from private field"), n ? n.call(e) : t.get(e)), Y = (e, t, n) => t.has(e) ? bn("Cannot add the same private member more than once") : t instanceof WeakSet ? t.add(e) : t.set(e, n), H = (e, t, n, r) => (Zt(e, t, "write to private field"), r ? r.call(e, n) : t.set(e, n), n), P = (e, t, n) => (Zt(e, t, "access private method"), n);
+}, v = (e, t) => Lr(e, Fr(t));
+var zt = (e, t, n) => t.has(e) || bn("Cannot " + n);
+var w = (e, t, n) => (zt(e, t, "read from private field"), n ? n.call(e) : t.get(e)), Y = (e, t, n) => t.has(e) ? bn("Cannot add the same private member more than once") : t instanceof WeakSet ? t.add(e) : t.set(e, n), W = (e, t, n, r) => (zt(e, t, "write to private field"), r ? r.call(e, n) : t.set(e, n), n), F = (e, t, n) => (zt(e, t, "access private method"), n);
 var O = (e, t, n) => new Promise((r, a) => {
   var i = (c) => {
     try {
@@ -31,96 +31,96 @@ var O = (e, t, n) => new Promise((r, a) => {
   o((n = n.apply(e, t)).next());
 });
 /*! pako 2.1.0 https://github.com/nodeca/pako @license (MIT AND Zlib) */
-function Fe(e) {
+function $e(e) {
   let t = e.length;
   for (; --t >= 0; )
     e[t] = 0;
 }
-const Fr = 0, Yn = 1, jr = 2, Mr = 3, Ur = 258, un = 29, st = 256, Xe = st + 1 + un, Oe = 30, fn = 19, Jn = 2 * Xe + 1, we = 15, zt = 16, Pr = 7, hn = 256, Qn = 16, er = 17, tr = 18, Pt = (
+const Mr = 0, er = 1, Ur = 2, Pr = 3, Br = 258, un = 29, ot = 256, Ye = ot + 1 + un, Oe = 30, fn = 19, tr = 2 * Ye + 1, we = 15, Dt = 16, Vr = 7, hn = 256, nr = 16, rr = 17, ar = 18, Bt = (
   /* 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])
-), mt = (
+), yt = (
   /* 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])
-), Br = (
+), Hr = (
   /* 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])
-), nr = new Uint8Array([16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15]), Vr = 512, ie = new Array((Xe + 2) * 2);
-Fe(ie);
-const Ke = new Array(Oe * 2);
-Fe(Ke);
-const Ye = new Array(Vr);
-Fe(Ye);
-const Je = new Array(Ur - Mr + 1);
-Fe(Je);
+), ir = new Uint8Array([16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15]), Wr = 512, ie = new Array((Ye + 2) * 2);
+$e(ie);
+const Ge = new Array(Oe * 2);
+$e(Ge);
+const Je = new Array(Wr);
+$e(Je);
+const Qe = new Array(Br - Pr + 1);
+$e(Qe);
 const _n = new Array(un);
-Fe(_n);
-const bt = new Array(Oe);
-Fe(bt);
+$e(_n);
+const wt = new Array(Oe);
+$e(wt);
 function Lt(e, t, n, r, a) {
   this.static_tree = e, this.extra_bits = t, this.extra_base = n, this.elems = r, this.max_length = a, this.has_stree = e && e.length;
 }
-let rr, ar, ir;
-function Dt(e, t) {
+let sr, or, lr;
+function Ft(e, t) {
   this.dyn_tree = e, this.max_code = 0, this.stat_desc = t;
 }
-const sr = (e) => e < 256 ? Ye[e] : Ye[256 + (e >>> 7)], Qe = (e, t) => {
+const cr = (e) => e < 256 ? Je[e] : Je[256 + (e >>> 7)], et = (e, t) => {
   e.pending_buf[e.pending++] = t & 255, e.pending_buf[e.pending++] = t >>> 8 & 255;
-}, M = (e, t, n) => {
-  e.bi_valid > zt - n ? (e.bi_buf |= t << e.bi_valid & 65535, Qe(e, e.bi_buf), e.bi_buf = t >> zt - e.bi_valid, e.bi_valid += n - zt) : (e.bi_buf |= t << e.bi_valid & 65535, e.bi_valid += n);
+}, U = (e, t, n) => {
+  e.bi_valid > Dt - n ? (e.bi_buf |= t << e.bi_valid & 65535, et(e, e.bi_buf), e.bi_buf = t >> Dt - e.bi_valid, e.bi_valid += n - Dt) : (e.bi_buf |= t << e.bi_valid & 65535, e.bi_valid += n);
 }, Q = (e, t, n) => {
-  M(
+  U(
     e,
     n[t * 2],
     n[t * 2 + 1]
     /*.Len*/
   );
-}, or = (e, t) => {
+}, dr = (e, t) => {
   let n = 0;
   do
     n |= e & 1, e >>>= 1, n <<= 1;
   while (--t > 0);
   return n >>> 1;
-}, Hr = (e) => {
-  e.bi_valid === 16 ? (Qe(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);
-}, Wr = (e, t) => {
+}, qr = (e) => {
+  e.bi_valid === 16 ? (et(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);
+}, Kr = (e, t) => {
   const n = t.dyn_tree, r = t.max_code, a = t.stat_desc.static_tree, i = t.stat_desc.has_stree, s = t.stat_desc.extra_bits, o = t.stat_desc.extra_base, c = t.stat_desc.max_length;
-  let l, h, S, y, I, Z, U = 0;
+  let l, h, S, y, N, Z, B = 0;
   for (y = 0; y <= we; y++)
     e.bl_count[y] = 0;
-  for (n[e.heap[e.heap_max] * 2 + 1] = 0, l = e.heap_max + 1; l < Jn; l++)
-    h = e.heap[l], y = n[n[h * 2 + 1] * 2 + 1] + 1, y > c && (y = c, U++), n[h * 2 + 1] = y, !(h > r) && (e.bl_count[y]++, I = 0, h >= o && (I = s[h - o]), Z = n[h * 2], e.opt_len += Z * (y + I), i && (e.static_len += Z * (a[h * 2 + 1] + I)));
-  if (U !== 0) {
+  for (n[e.heap[e.heap_max] * 2 + 1] = 0, l = e.heap_max + 1; l < tr; l++)
+    h = e.heap[l], y = n[n[h * 2 + 1] * 2 + 1] + 1, y > c && (y = c, B++), n[h * 2 + 1] = y, !(h > r) && (e.bl_count[y]++, N = 0, h >= o && (N = s[h - o]), Z = n[h * 2], e.opt_len += Z * (y + N), i && (e.static_len += Z * (a[h * 2 + 1] + N)));
+  if (B !== 0) {
     do {
       for (y = c - 1; e.bl_count[y] === 0; )
         y--;
-      e.bl_count[y]--, e.bl_count[y + 1] += 2, e.bl_count[c]--, U -= 2;
-    } while (U > 0);
+      e.bl_count[y]--, e.bl_count[y + 1] += 2, e.bl_count[c]--, B -= 2;
+    } while (B > 0);
     for (y = c; y !== 0; y--)
       for (h = e.bl_count[y]; h !== 0; )
         S = e.heap[--l], !(S > r) && (n[S * 2 + 1] !== y && (e.opt_len += (y - n[S * 2 + 1]) * n[S * 2], n[S * 2 + 1] = y), h--);
   }
-}, lr = (e, t, n) => {
+}, ur = (e, t, n) => {
   const r = new Array(we + 1);
   let a = 0, i, s;
   for (i = 1; i <= we; i++)
     a = a + n[i - 1] << 1, r[i] = a;
   for (s = 0; s <= t; s++) {
     let o = e[s * 2 + 1];
-    o !== 0 && (e[s * 2] = or(r[o]++, o));
+    o !== 0 && (e[s * 2] = dr(r[o]++, o));
   }
-}, qr = () => {
+}, Gr = () => {
   let e, t, n, r, a;
   const i = new Array(we + 1);
   for (n = 0, r = 0; r < un - 1; r++)
-    for (_n[r] = n, e = 0; e < 1 << Pt[r]; e++)
-      Je[n++] = r;
-  for (Je[n - 1] = r, a = 0, r = 0; r < 16; r++)
-    for (bt[r] = a, e = 0; e < 1 << mt[r]; e++)
-      Ye[a++] = r;
+    for (_n[r] = n, e = 0; e < 1 << Bt[r]; e++)
+      Qe[n++] = r;
+  for (Qe[n - 1] = r, a = 0, r = 0; r < 16; r++)
+    for (wt[r] = a, e = 0; e < 1 << yt[r]; e++)
+      Je[a++] = r;
   for (a >>= 7; r < Oe; r++)
-    for (bt[r] = a << 7, e = 0; e < 1 << mt[r] - 7; e++)
-      Ye[256 + a++] = r;
+    for (wt[r] = a << 7, e = 0; e < 1 << yt[r] - 7; e++)
+      Je[256 + a++] = r;
   for (t = 0; t <= we; t++)
     i[t] = 0;
   for (e = 0; e <= 143; )
@@ -131,20 +131,20 @@ const sr = (e) => e < 256 ? Ye[e] : Ye[256 + (e >>> 7)], Qe = (e, t) => {
     ie[e * 2 + 1] = 7, e++, i[7]++;
   for (; e <= 287; )
     ie[e * 2 + 1] = 8, e++, i[8]++;
-  for (lr(ie, Xe + 1, i), e = 0; e < Oe; e++)
-    Ke[e * 2 + 1] = 5, Ke[e * 2] = or(e, 5);
-  rr = new Lt(ie, Pt, st + 1, Xe, we), ar = new Lt(Ke, mt, 0, Oe, we), ir = new Lt(new Array(0), Br, 0, fn, Pr);
-}, cr = (e) => {
+  for (ur(ie, Ye + 1, i), e = 0; e < Oe; e++)
+    Ge[e * 2 + 1] = 5, Ge[e * 2] = dr(e, 5);
+  sr = new Lt(ie, Bt, ot + 1, Ye, we), or = new Lt(Ge, yt, 0, Oe, we), lr = new Lt(new Array(0), Hr, 0, fn, Vr);
+}, fr = (e) => {
   let t;
-  for (t = 0; t < Xe; t++)
+  for (t = 0; t < Ye; t++)
     e.dyn_ltree[t * 2] = 0;
   for (t = 0; t < Oe; t++)
     e.dyn_dtree[t * 2] = 0;
   for (t = 0; t < fn; 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;
-}, dr = (e) => {
-  e.bi_valid > 8 ? Qe(e, e.bi_buf) : e.bi_valid > 0 && (e.pending_buf[e.pending++] = e.bi_buf), e.bi_buf = 0, e.bi_valid = 0;
+}, hr = (e) => {
+  e.bi_valid > 8 ? et(e, e.bi_buf) : e.bi_valid > 0 && (e.pending_buf[e.pending++] = e.bi_buf), e.bi_buf = 0, e.bi_valid = 0;
 }, xn = (e, t, n, r) => {
   const a = t * 2, i = n * 2;
   return e[a] < e[i] || e[a] === e[i] && r[t] <= r[n];
@@ -158,13 +158,13 @@ const sr = (e) => e < 256 ? Ye[e] : Ye[256 + (e >>> 7)], Qe = (e, t) => {
   let r, a, i = 0, s, o;
   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, a = e.pending_buf[e.sym_buf + i++], r === 0 ? Q(e, a, t) : (s = Je[a], Q(e, s + st + 1, t), o = Pt[s], o !== 0 && (a -= _n[s], M(e, a, o)), r--, s = sr(r), Q(e, s, n), o = mt[s], o !== 0 && (r -= bt[s], M(e, r, o)));
+      r = e.pending_buf[e.sym_buf + i++] & 255, r += (e.pending_buf[e.sym_buf + i++] & 255) << 8, a = e.pending_buf[e.sym_buf + i++], r === 0 ? Q(e, a, t) : (s = Qe[a], Q(e, s + ot + 1, t), o = Bt[s], o !== 0 && (a -= _n[s], U(e, a, o)), r--, s = cr(r), Q(e, s, n), o = yt[s], o !== 0 && (r -= wt[s], U(e, r, o)));
     while (i < e.sym_next);
   Q(e, hn, t);
-}, Bt = (e, t) => {
+}, Vt = (e, t) => {
   const n = t.dyn_tree, r = t.stat_desc.static_tree, a = t.stat_desc.has_stree, i = t.stat_desc.elems;
   let s, o, c = -1, l;
-  for (e.heap_len = 0, e.heap_max = Jn, s = 0; s < i; s++)
+  for (e.heap_len = 0, e.heap_max = tr, s = 0; s < i; s++)
     n[s * 2] !== 0 ? (e.heap[++e.heap_len] = c = s, e.depth[s] = 0) : n[s * 2 + 1] = 0;
   for (; e.heap_len < 2; )
     l = e.heap[++e.heap_len] = c < 2 ? ++c : 0, n[l * 2] = 1, e.depth[l] = 0, e.opt_len--, a && (e.static_len -= r[l * 2 + 1]);
@@ -199,11 +199,11 @@ const sr = (e) => e < 256 ? Ye[e] : Ye[256 + (e >>> 7)], Qe = (e, t) => {
   e.heap[--e.heap_max] = e.heap[
     1
     /*SMALLEST*/
-  ], Wr(e, t), lr(n, c, e.bl_count);
+  ], Kr(e, t), ur(n, c, e.bl_count);
 }, Sn = (e, t, n) => {
   let r, a = -1, i, s = t[1], o = 0, c = 7, l = 4;
   for (s === 0 && (c = 138, l = 3), t[(n + 1) * 2 + 1] = 65535, r = 0; r <= n; r++)
-    i = s, s = t[(r + 1) * 2 + 1], !(++o < c && i === s) && (o < l ? e.bl_tree[i * 2] += o : i !== 0 ? (i !== a && e.bl_tree[i * 2]++, e.bl_tree[Qn * 2]++) : o <= 10 ? e.bl_tree[er * 2]++ : e.bl_tree[tr * 2]++, o = 0, a = i, s === 0 ? (c = 138, l = 3) : i === s ? (c = 6, l = 3) : (c = 7, l = 4));
+    i = s, s = t[(r + 1) * 2 + 1], !(++o < c && i === s) && (o < l ? e.bl_tree[i * 2] += o : i !== 0 ? (i !== a && e.bl_tree[i * 2]++, e.bl_tree[nr * 2]++) : o <= 10 ? e.bl_tree[rr * 2]++ : e.bl_tree[ar * 2]++, o = 0, a = i, s === 0 ? (c = 138, l = 3) : i === s ? (c = 6, l = 3) : (c = 7, l = 4));
 }, Tn = (e, t, n) => {
   let r, a = -1, i, s = t[1], o = 0, c = 7, l = 4;
   for (s === 0 && (c = 138, l = 3), r = 0; r <= n; r++)
@@ -212,50 +212,50 @@ const sr = (e) => e < 256 ? Ye[e] : Ye[256 + (e >>> 7)], Qe = (e, t) => {
         do
           Q(e, i, e.bl_tree);
         while (--o !== 0);
-      else i !== 0 ? (i !== a && (Q(e, i, e.bl_tree), o--), Q(e, Qn, e.bl_tree), M(e, o - 3, 2)) : o <= 10 ? (Q(e, er, e.bl_tree), M(e, o - 3, 3)) : (Q(e, tr, e.bl_tree), M(e, o - 11, 7));
+      else i !== 0 ? (i !== a && (Q(e, i, e.bl_tree), o--), Q(e, nr, e.bl_tree), U(e, o - 3, 2)) : o <= 10 ? (Q(e, rr, e.bl_tree), U(e, o - 3, 3)) : (Q(e, ar, e.bl_tree), U(e, o - 11, 7));
       o = 0, a = i, s === 0 ? (c = 138, l = 3) : i === s ? (c = 6, l = 3) : (c = 7, l = 4);
     }
-}, Kr = (e) => {
+}, Xr = (e) => {
   let t;
-  for (Sn(e, e.dyn_ltree, e.l_desc.max_code), Sn(e, e.dyn_dtree, e.d_desc.max_code), Bt(e, e.bl_desc), t = fn - 1; t >= 3 && e.bl_tree[nr[t] * 2 + 1] === 0; t--)
+  for (Sn(e, e.dyn_ltree, e.l_desc.max_code), Sn(e, e.dyn_dtree, e.d_desc.max_code), Vt(e, e.bl_desc), t = fn - 1; t >= 3 && e.bl_tree[ir[t] * 2 + 1] === 0; t--)
     ;
   return e.opt_len += 3 * (t + 1) + 5 + 5 + 4, t;
-}, Gr = (e, t, n, r) => {
+}, Yr = (e, t, n, r) => {
   let a;
-  for (M(e, t - 257, 5), M(e, n - 1, 5), M(e, r - 4, 4), a = 0; a < r; a++)
-    M(e, e.bl_tree[nr[a] * 2 + 1], 3);
+  for (U(e, t - 257, 5), U(e, n - 1, 5), U(e, r - 4, 4), a = 0; a < r; a++)
+    U(e, e.bl_tree[ir[a] * 2 + 1], 3);
   Tn(e, e.dyn_ltree, t - 1), Tn(e, e.dyn_dtree, n - 1);
-}, Xr = (e) => {
+}, Jr = (e) => {
   let t = 4093624447, n;
   for (n = 0; n <= 31; n++, t >>>= 1)
     if (t & 1 && e.dyn_ltree[n * 2] !== 0)
       return 0;
   if (e.dyn_ltree[18] !== 0 || e.dyn_ltree[20] !== 0 || e.dyn_ltree[26] !== 0)
     return 1;
-  for (n = 32; n < st; n++)
+  for (n = 32; n < ot; n++)
     if (e.dyn_ltree[n * 2] !== 0)
       return 1;
   return 0;
 };
-let An = !1;
-const Yr = (e) => {
-  An || (qr(), An = !0), e.l_desc = new Dt(e.dyn_ltree, rr), e.d_desc = new Dt(e.dyn_dtree, ar), e.bl_desc = new Dt(e.bl_tree, ir), e.bi_buf = 0, e.bi_valid = 0, cr(e);
-}, ur = (e, t, n, r) => {
-  M(e, (Fr << 1) + (r ? 1 : 0), 3), dr(e), Qe(e, n), Qe(e, ~n), n && e.pending_buf.set(e.window.subarray(t, t + n), e.pending), e.pending += n;
-}, Jr = (e) => {
-  M(e, Yn << 1, 3), Q(e, hn, ie), Hr(e);
-}, Qr = (e, t, n, r) => {
+let En = !1;
+const Qr = (e) => {
+  En || (Gr(), En = !0), e.l_desc = new Ft(e.dyn_ltree, sr), e.d_desc = new Ft(e.dyn_dtree, or), e.bl_desc = new Ft(e.bl_tree, lr), e.bi_buf = 0, e.bi_valid = 0, fr(e);
+}, _r = (e, t, n, r) => {
+  U(e, (Mr << 1) + (r ? 1 : 0), 3), hr(e), et(e, n), et(e, ~n), n && e.pending_buf.set(e.window.subarray(t, t + n), e.pending), e.pending += n;
+}, ea = (e) => {
+  U(e, er << 1, 3), Q(e, hn, ie), qr(e);
+}, ta = (e, t, n, r) => {
   let a, i, s = 0;
-  e.level > 0 ? (e.strm.data_type === 2 && (e.strm.data_type = Xr(e)), Bt(e, e.l_desc), Bt(e, e.d_desc), s = Kr(e), a = e.opt_len + 3 + 7 >>> 3, i = e.static_len + 3 + 7 >>> 3, i <= a && (a = i)) : a = i = n + 5, n + 4 <= a && t !== -1 ? ur(e, t, n, r) : e.strategy === 4 || i === a ? (M(e, (Yn << 1) + (r ? 1 : 0), 3), kn(e, ie, Ke)) : (M(e, (jr << 1) + (r ? 1 : 0), 3), Gr(e, e.l_desc.max_code + 1, e.d_desc.max_code + 1, s + 1), kn(e, e.dyn_ltree, e.dyn_dtree)), cr(e), r && dr(e);
-}, ea = (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[(Je[n] + st + 1) * 2]++, e.dyn_dtree[sr(t) * 2]++), e.sym_next === e.sym_end);
-var ta = Yr, na = ur, ra = Qr, aa = ea, ia = Jr, sa = {
-  _tr_init: ta,
-  _tr_stored_block: na,
-  _tr_flush_block: ra,
-  _tr_tally: aa,
-  _tr_align: ia
+  e.level > 0 ? (e.strm.data_type === 2 && (e.strm.data_type = Jr(e)), Vt(e, e.l_desc), Vt(e, e.d_desc), s = Xr(e), a = e.opt_len + 3 + 7 >>> 3, i = e.static_len + 3 + 7 >>> 3, i <= a && (a = i)) : a = i = n + 5, n + 4 <= a && t !== -1 ? _r(e, t, n, r) : e.strategy === 4 || i === a ? (U(e, (er << 1) + (r ? 1 : 0), 3), kn(e, ie, Ge)) : (U(e, (Ur << 1) + (r ? 1 : 0), 3), Yr(e, e.l_desc.max_code + 1, e.d_desc.max_code + 1, s + 1), kn(e, e.dyn_ltree, e.dyn_dtree)), fr(e), r && hr(e);
+}, na = (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[(Qe[n] + ot + 1) * 2]++, e.dyn_dtree[cr(t) * 2]++), e.sym_next === e.sym_end);
+var ra = Qr, aa = _r, ia = ta, sa = na, oa = ea, la = {
+  _tr_init: ra,
+  _tr_stored_block: aa,
+  _tr_flush_block: ia,
+  _tr_tally: sa,
+  _tr_align: oa
 };
-const oa = (e, t, n, r) => {
+const ca = (e, t, n, r) => {
   let a = e & 65535 | 0, i = e >>> 16 & 65535 | 0, s = 0;
   for (; n !== 0; ) {
     s = n > 2e3 ? 2e3 : n, n -= s;
@@ -266,8 +266,8 @@ const oa = (e, t, n, r) => {
   }
   return a | i << 16 | 0;
 };
-var fr = oa;
-const la = () => {
+var pr = ca;
+const da = () => {
   let e, t = [];
   for (var n = 0; n < 256; n++) {
     e = n;
@@ -276,14 +276,14 @@ const la = () => {
     t[n] = e;
   }
   return t;
-}, ca = new Uint32Array(la()), da = (e, t, n, r) => {
-  const a = ca, i = r + n;
+}, ua = new Uint32Array(da()), fa = (e, t, n, r) => {
+  const a = ua, i = r + n;
   e ^= -1;
   for (let s = r; s < i; s++)
     e = e >>> 8 ^ a[(e ^ t[s]) & 255];
   return e ^ -1;
 };
-var de = da, wt = {
+var de = fa, xt = {
   2: "need dictionary",
   /* Z_NEED_DICT       2  */
   1: "stream end",
@@ -302,7 +302,7 @@ var de = da, wt = {
   /* Z_BUF_ERROR     (-5) */
   "-6": "incompatible version"
   /* Z_VERSION_ERROR (-6) */
-}, hr = {
+}, gr = {
   /* Allowed flush values; see deflate() and inflate() below for details */
   Z_NO_FLUSH: 0,
   Z_PARTIAL_FLUSH: 1,
@@ -330,30 +330,30 @@ var de = da, wt = {
   Z_DEFLATED: 8
   //Z_NULL:                 null // Use -1 or null inline, depending on var type
 };
-const { _tr_init: ua, _tr_stored_block: Vt, _tr_flush_block: fa, _tr_tally: _e, _tr_align: ha } = sa, {
+const { _tr_init: ha, _tr_stored_block: Ht, _tr_flush_block: _a, _tr_tally: _e, _tr_align: pa } = la, {
   Z_NO_FLUSH: pe,
-  Z_PARTIAL_FLUSH: _a,
-  Z_FULL_FLUSH: pa,
-  Z_FINISH: W,
-  Z_BLOCK: En,
-  Z_OK: L,
+  Z_PARTIAL_FLUSH: ga,
+  Z_FULL_FLUSH: ma,
+  Z_FINISH: K,
+  Z_BLOCK: An,
+  Z_OK: D,
   Z_STREAM_END: On,
   Z_STREAM_ERROR: ee,
-  Z_DATA_ERROR: ga,
-  Z_BUF_ERROR: Ft,
-  Z_DEFAULT_COMPRESSION: ma,
-  Z_FILTERED: ya,
-  Z_HUFFMAN_ONLY: ht,
-  Z_RLE: va,
-  Z_FIXED: ba,
-  Z_DEFAULT_STRATEGY: wa,
-  Z_UNKNOWN: xa,
-  Z_DEFLATED: Ct
-} = hr, ka = 9, Sa = 15, Ta = 8, Aa = 29, Ea = 256, Ht = Ea + 1 + Aa, Oa = 30, Ca = 19, Ra = 2 * Ht + 1, Ia = 15, x = 3, he = 258, te = he + x + 1, Na = 32, Re = 42, pn = 57, Wt = 69, qt = 73, Kt = 91, Gt = 103, xe = 113, Ve = 666, F = 1, je = 2, Se = 3, Me = 4, Za = 3, ke = (e, t) => (e.msg = wt[t], t), Cn = (e) => e * 2 - (e > 4 ? 9 : 0), fe = (e) => {
+  Z_DATA_ERROR: ya,
+  Z_BUF_ERROR: jt,
+  Z_DEFAULT_COMPRESSION: va,
+  Z_FILTERED: ba,
+  Z_HUFFMAN_ONLY: _t,
+  Z_RLE: wa,
+  Z_FIXED: xa,
+  Z_DEFAULT_STRATEGY: ka,
+  Z_UNKNOWN: Sa,
+  Z_DEFLATED: Rt
+} = gr, Ta = 9, Ea = 15, Aa = 8, Oa = 29, Ca = 256, Wt = Ca + 1 + Oa, Ra = 30, Na = 19, Ia = 2 * Wt + 1, Za = 15, x = 3, he = 258, te = he + x + 1, za = 32, Re = 42, pn = 57, qt = 69, Kt = 73, Gt = 91, Xt = 103, xe = 113, Ve = 666, j = 1, je = 2, Se = 3, Me = 4, Da = 3, ke = (e, t) => (e.msg = xt[t], t), Cn = (e) => e * 2 - (e > 4 ? 9 : 0), fe = (e) => {
   let t = e.length;
   for (; --t >= 0; )
     e[t] = 0;
-}, za = (e) => {
+}, La = (e) => {
   let t, n, r, a = e.w_size;
   t = e.hash_size, r = t;
   do
@@ -364,27 +364,27 @@ const { _tr_init: ua, _tr_stored_block: Vt, _tr_flush_block: fa, _tr_tally: _e,
     n = e.prev[--r], e.prev[r] = n >= a ? n - a : 0;
   while (--t);
 };
-let La = (e, t, n) => (t << e.hash_shift ^ n) & e.hash_mask, ge = La;
-const B = (e) => {
+let Fa = (e, t, n) => (t << e.hash_shift ^ n) & e.hash_mask, ge = Fa;
+const V = (e) => {
   const t = e.state;
   let n = t.pending;
   n > e.avail_out && (n = e.avail_out), n !== 0 && (e.output.set(t.pending_buf.subarray(t.pending_out, t.pending_out + n), e.next_out), e.next_out += n, t.pending_out += n, e.total_out += n, e.avail_out -= n, t.pending -= n, t.pending === 0 && (t.pending_out = 0));
-}, V = (e, t) => {
-  fa(e, e.block_start >= 0 ? e.block_start : -1, e.strstart - e.block_start, t), e.block_start = e.strstart, B(e.strm);
-}, E = (e, t) => {
+}, H = (e, t) => {
+  _a(e, e.block_start >= 0 ? e.block_start : -1, e.strstart - e.block_start, t), e.block_start = e.strstart, V(e.strm);
+}, A = (e, t) => {
   e.pending_buf[e.pending++] = t;
 }, Be = (e, t) => {
   e.pending_buf[e.pending++] = t >>> 8 & 255, e.pending_buf[e.pending++] = t & 255;
-}, Xt = (e, t, n, r) => {
+}, Yt = (e, t, n, r) => {
   let a = e.avail_in;
-  return a > r && (a = r), a === 0 ? 0 : (e.avail_in -= a, t.set(e.input.subarray(e.next_in, e.next_in + a), n), e.state.wrap === 1 ? e.adler = fr(e.adler, t, a, n) : e.state.wrap === 2 && (e.adler = de(e.adler, t, a, n)), e.next_in += a, e.total_in += a, a);
-}, _r = (e, t) => {
+  return a > r && (a = r), a === 0 ? 0 : (e.avail_in -= a, t.set(e.input.subarray(e.next_in, e.next_in + a), n), e.state.wrap === 1 ? e.adler = pr(e.adler, t, a, n) : e.state.wrap === 2 && (e.adler = de(e.adler, t, a, n)), e.next_in += a, e.total_in += a, a);
+}, mr = (e, t) => {
   let n = e.max_chain_length, r = e.strstart, a, i, s = e.prev_length, o = e.nice_match;
   const c = e.strstart > e.w_size - te ? e.strstart - (e.w_size - te) : 0, l = e.window, h = e.w_mask, S = e.prev, y = e.strstart + he;
-  let I = l[r + s - 1], Z = l[r + s];
+  let N = l[r + s - 1], Z = l[r + s];
   e.prev_length >= e.good_match && (n >>= 2), o > e.lookahead && (o = e.lookahead);
   do
-    if (a = t, !(l[a + s] !== Z || l[a + s - 1] !== I || l[a] !== l[r] || l[++a] !== l[r + 1])) {
+    if (a = t, !(l[a + s] !== Z || l[a + s - 1] !== N || l[a] !== l[r] || l[++a] !== l[r + 1])) {
       r += 2, a++;
       do
         ;
@@ -392,39 +392,39 @@ const B = (e) => {
       if (i = he - (y - r), r = y - he, i > s) {
         if (e.match_start = t, s = i, i >= o)
           break;
-        I = l[r + s - 1], Z = l[r + s];
+        N = l[r + s - 1], Z = l[r + s];
       }
     }
   while ((t = S[t & h]) > c && --n !== 0);
   return s <= e.lookahead ? s : e.lookahead;
-}, Ie = (e) => {
+}, Ne = (e) => {
   const t = e.w_size;
   let n, r, a;
   do {
-    if (r = e.window_size - e.lookahead - e.strstart, e.strstart >= t + (t - te) && (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), za(e), r += t), e.strm.avail_in === 0)
+    if (r = e.window_size - e.lookahead - e.strstart, e.strstart >= t + (t - te) && (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), La(e), r += t), e.strm.avail_in === 0)
       break;
-    if (n = Xt(e.strm, e.window, e.strstart + e.lookahead, r), e.lookahead += n, e.lookahead + e.insert >= x)
+    if (n = Yt(e.strm, e.window, e.strstart + e.lookahead, r), e.lookahead += n, e.lookahead + e.insert >= x)
       for (a = e.strstart - e.insert, e.ins_h = e.window[a], e.ins_h = ge(e, e.ins_h, e.window[a + 1]); e.insert && (e.ins_h = ge(e, e.ins_h, e.window[a + x - 1]), e.prev[a & e.w_mask] = e.head[e.ins_h], e.head[e.ins_h] = a, a++, e.insert--, !(e.lookahead + e.insert < x)); )
         ;
   } while (e.lookahead < te && e.strm.avail_in !== 0);
-}, pr = (e, t) => {
+}, yr = (e, t) => {
   let n = e.pending_buf_size - 5 > e.w_size ? e.w_size : e.pending_buf_size - 5, r, a, i, s = 0, o = 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, a = e.strstart - e.block_start, r > a + e.strm.avail_in && (r = a + e.strm.avail_in), r > i && (r = i), r < n && (r === 0 && t !== W || t === pe || r !== a + e.strm.avail_in)))
+    if (r = 65535, i = e.bi_valid + 42 >> 3, e.strm.avail_out < i || (i = e.strm.avail_out - i, a = e.strstart - e.block_start, r > a + e.strm.avail_in && (r = a + e.strm.avail_in), r > i && (r = i), r < n && (r === 0 && t !== K || t === pe || r !== a + e.strm.avail_in)))
       break;
-    s = t === W && r === a + e.strm.avail_in ? 1 : 0, Vt(e, 0, 0, s), 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, B(e.strm), a && (a > r && (a = r), e.strm.output.set(e.window.subarray(e.block_start, e.block_start + a), e.strm.next_out), e.strm.next_out += a, e.strm.avail_out -= a, e.strm.total_out += a, e.block_start += a, r -= a), r && (Xt(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);
+    s = t === K && r === a + e.strm.avail_in ? 1 : 0, Ht(e, 0, 0, s), 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, V(e.strm), a && (a > r && (a = r), e.strm.output.set(e.window.subarray(e.block_start, e.block_start + a), e.strm.next_out), e.strm.next_out += a, e.strm.avail_out -= a, e.strm.total_out += a, e.block_start += a, r -= a), r && (Yt(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 (s === 0);
-  return o -= e.strm.avail_in, o && (o >= 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 <= o && (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 - o, e.strm.next_in), e.strstart), e.strstart += o, e.insert += o > e.w_size - e.insert ? e.w_size - e.insert : o), e.block_start = e.strstart), e.high_water < e.strstart && (e.high_water = e.strstart), s ? Me : t !== pe && t !== W && e.strm.avail_in === 0 && e.strstart === e.block_start ? je : (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 && (Xt(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, a = e.strstart - e.block_start, (a >= n || (a || t === W) && t !== pe && e.strm.avail_in === 0 && a <= i) && (r = a > i ? i : a, s = t === W && e.strm.avail_in === 0 && r === a ? 1 : 0, Vt(e, e.block_start, r, s), e.block_start += r, B(e.strm)), s ? Se : F);
-}, jt = (e, t) => {
+  return o -= e.strm.avail_in, o && (o >= 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 <= o && (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 - o, e.strm.next_in), e.strstart), e.strstart += o, e.insert += o > e.w_size - e.insert ? e.w_size - e.insert : o), e.block_start = e.strstart), e.high_water < e.strstart && (e.high_water = e.strstart), s ? Me : t !== pe && t !== K && e.strm.avail_in === 0 && e.strstart === e.block_start ? je : (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 && (Yt(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, a = e.strstart - e.block_start, (a >= n || (a || t === K) && t !== pe && e.strm.avail_in === 0 && a <= i) && (r = a > i ? i : a, s = t === K && e.strm.avail_in === 0 && r === a ? 1 : 0, Ht(e, e.block_start, r, s), e.block_start += r, V(e.strm)), s ? Se : j);
+}, Mt = (e, t) => {
   let n, r;
   for (; ; ) {
     if (e.lookahead < te) {
-      if (Ie(e), e.lookahead < te && t === pe)
-        return F;
+      if (Ne(e), e.lookahead < te && t === pe)
+        return j;
       if (e.lookahead === 0)
         break;
     }
-    if (n = 0, e.lookahead >= x && (e.ins_h = ge(e, e.ins_h, e.window[e.strstart + x - 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 - te && (e.match_length = _r(e, n)), e.match_length >= x)
+    if (n = 0, e.lookahead >= x && (e.ins_h = ge(e, e.ins_h, e.window[e.strstart + x - 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 - te && (e.match_length = mr(e, n)), e.match_length >= x)
       if (r = _e(e, e.strstart - e.match_start, e.match_length - x), e.lookahead -= e.match_length, e.match_length <= e.max_lazy_match && e.lookahead >= x) {
         e.match_length--;
         do
@@ -435,40 +435,40 @@ const B = (e) => {
         e.strstart += e.match_length, e.match_length = 0, e.ins_h = e.window[e.strstart], e.ins_h = ge(e, e.ins_h, e.window[e.strstart + 1]);
     else
       r = _e(e, 0, e.window[e.strstart]), e.lookahead--, e.strstart++;
-    if (r && (V(e, !1), e.strm.avail_out === 0))
-      return F;
+    if (r && (H(e, !1), e.strm.avail_out === 0))
+      return j;
   }
-  return e.insert = e.strstart < x - 1 ? e.strstart : x - 1, t === W ? (V(e, !0), e.strm.avail_out === 0 ? Se : Me) : e.sym_next && (V(e, !1), e.strm.avail_out === 0) ? F : je;
-}, Ae = (e, t) => {
+  return e.insert = e.strstart < x - 1 ? e.strstart : x - 1, t === K ? (H(e, !0), e.strm.avail_out === 0 ? Se : Me) : e.sym_next && (H(e, !1), e.strm.avail_out === 0) ? j : je;
+}, Ee = (e, t) => {
   let n, r, a;
   for (; ; ) {
     if (e.lookahead < te) {
-      if (Ie(e), e.lookahead < te && t === pe)
-        return F;
+      if (Ne(e), e.lookahead < te && t === pe)
+        return j;
       if (e.lookahead === 0)
         break;
     }
-    if (n = 0, e.lookahead >= x && (e.ins_h = ge(e, e.ins_h, e.window[e.strstart + x - 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 = x - 1, n !== 0 && e.prev_length < e.max_lazy_match && e.strstart - n <= e.w_size - te && (e.match_length = _r(e, n), e.match_length <= 5 && (e.strategy === ya || e.match_length === x && e.strstart - e.match_start > 4096) && (e.match_length = x - 1)), e.prev_length >= x && e.match_length <= e.prev_length) {
+    if (n = 0, e.lookahead >= x && (e.ins_h = ge(e, e.ins_h, e.window[e.strstart + x - 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 = x - 1, n !== 0 && e.prev_length < e.max_lazy_match && e.strstart - n <= e.w_size - te && (e.match_length = mr(e, n), e.match_length <= 5 && (e.strategy === ba || e.match_length === x && e.strstart - e.match_start > 4096) && (e.match_length = x - 1)), e.prev_length >= x && e.match_length <= e.prev_length) {
       a = e.strstart + e.lookahead - x, r = _e(e, e.strstart - 1 - e.prev_match, e.prev_length - x), e.lookahead -= e.prev_length - 1, e.prev_length -= 2;
       do
         ++e.strstart <= a && (e.ins_h = ge(e, e.ins_h, e.window[e.strstart + x - 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 = x - 1, e.strstart++, r && (V(e, !1), e.strm.avail_out === 0))
-        return F;
+      if (e.match_available = 0, e.match_length = x - 1, e.strstart++, r && (H(e, !1), e.strm.avail_out === 0))
+        return j;
     } else if (e.match_available) {
-      if (r = _e(e, 0, e.window[e.strstart - 1]), r && V(e, !1), e.strstart++, e.lookahead--, e.strm.avail_out === 0)
-        return F;
+      if (r = _e(e, 0, e.window[e.strstart - 1]), r && H(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 = _e(e, 0, e.window[e.strstart - 1]), e.match_available = 0), e.insert = e.strstart < x - 1 ? e.strstart : x - 1, t === W ? (V(e, !0), e.strm.avail_out === 0 ? Se : Me) : e.sym_next && (V(e, !1), e.strm.avail_out === 0) ? F : je;
-}, Da = (e, t) => {
+  return e.match_available && (r = _e(e, 0, e.window[e.strstart - 1]), e.match_available = 0), e.insert = e.strstart < x - 1 ? e.strstart : x - 1, t === K ? (H(e, !0), e.strm.avail_out === 0 ? Se : Me) : e.sym_next && (H(e, !1), e.strm.avail_out === 0) ? j : je;
+}, $a = (e, t) => {
   let n, r, a, i;
   const s = e.window;
   for (; ; ) {
     if (e.lookahead <= he) {
-      if (Ie(e), e.lookahead <= he && t === pe)
-        return F;
+      if (Ne(e), e.lookahead <= he && t === pe)
+        return j;
       if (e.lookahead === 0)
         break;
     }
@@ -479,212 +479,212 @@ const B = (e) => {
       while (r === s[++a] && r === s[++a] && r === s[++a] && r === s[++a] && r === s[++a] && r === s[++a] && r === s[++a] && r === s[++a] && a < i);
       e.match_length = he - (i - a), e.match_length > e.lookahead && (e.match_length = e.lookahead);
     }
-    if (e.match_length >= x ? (n = _e(e, 1, e.match_length - x), e.lookahead -= e.match_length, e.strstart += e.match_length, e.match_length = 0) : (n = _e(e, 0, e.window[e.strstart]), e.lookahead--, e.strstart++), n && (V(e, !1), e.strm.avail_out === 0))
-      return F;
+    if (e.match_length >= x ? (n = _e(e, 1, e.match_length - x), e.lookahead -= e.match_length, e.strstart += e.match_length, e.match_length = 0) : (n = _e(e, 0, e.window[e.strstart]), e.lookahead--, e.strstart++), n && (H(e, !1), e.strm.avail_out === 0))
+      return j;
   }
-  return e.insert = 0, t === W ? (V(e, !0), e.strm.avail_out === 0 ? Se : Me) : e.sym_next && (V(e, !1), e.strm.avail_out === 0) ? F : je;
-}, $a = (e, t) => {
+  return e.insert = 0, t === K ? (H(e, !0), e.strm.avail_out === 0 ? Se : Me) : e.sym_next && (H(e, !1), e.strm.avail_out === 0) ? j : je;
+}, ja = (e, t) => {
   let n;
   for (; ; ) {
-    if (e.lookahead === 0 && (Ie(e), e.lookahead === 0)) {
+    if (e.lookahead === 0 && (Ne(e), e.lookahead === 0)) {
       if (t === pe)
-        return F;
+        return j;
       break;
     }
-    if (e.match_length = 0, n = _e(e, 0, e.window[e.strstart]), e.lookahead--, e.strstart++, n && (V(e, !1), e.strm.avail_out === 0))
-      return F;
+    if (e.match_length = 0, n = _e(e, 0, e.window[e.strstart]), e.lookahead--, e.strstart++, n && (H(e, !1), e.strm.avail_out === 0))
+      return j;
   }
-  return e.insert = 0, t === W ? (V(e, !0), e.strm.avail_out === 0 ? Se : Me) : e.sym_next && (V(e, !1), e.strm.avail_out === 0) ? F : je;
+  return e.insert = 0, t === K ? (H(e, !0), e.strm.avail_out === 0 ? Se : Me) : e.sym_next && (H(e, !1), e.strm.avail_out === 0) ? j : je;
 };
 function J(e, t, n, r, a) {
   this.good_length = e, this.max_lazy = t, this.nice_length = n, this.max_chain = r, this.func = a;
 }
 const He = [
   /*      good lazy nice chain */
-  new J(0, 0, 0, 0, pr),
+  new J(0, 0, 0, 0, yr),
   /* 0 store only */
-  new J(4, 4, 8, 4, jt),
+  new J(4, 4, 8, 4, Mt),
   /* 1 max speed, no lazy matches */
-  new J(4, 5, 16, 8, jt),
+  new J(4, 5, 16, 8, Mt),
   /* 2 */
-  new J(4, 6, 32, 32, jt),
+  new J(4, 6, 32, 32, Mt),
   /* 3 */
-  new J(4, 4, 16, 16, Ae),
+  new J(4, 4, 16, 16, Ee),
   /* 4 lazy matches */
-  new J(8, 16, 32, 32, Ae),
+  new J(8, 16, 32, 32, Ee),
   /* 5 */
-  new J(8, 16, 128, 128, Ae),
+  new J(8, 16, 128, 128, Ee),
   /* 6 */
-  new J(8, 32, 128, 256, Ae),
+  new J(8, 32, 128, 256, Ee),
   /* 7 */
-  new J(32, 128, 258, 1024, Ae),
+  new J(32, 128, 258, 1024, Ee),
   /* 8 */
-  new J(32, 258, 258, 4096, Ae)
+  new J(32, 258, 258, 4096, Ee)
   /* 9 max compression */
-], Fa = (e) => {
+], Ma = (e) => {
   e.window_size = 2 * e.w_size, fe(e.head), e.max_lazy_match = He[e.level].max_lazy, e.good_match = He[e.level].good_length, e.nice_match = He[e.level].nice_length, e.max_chain_length = He[e.level].max_chain, e.strstart = 0, e.block_start = 0, e.lookahead = 0, e.insert = 0, e.match_length = e.prev_length = x - 1, e.match_available = 0, e.ins_h = 0;
 };
-function ja() {
-  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 = Ct, 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(Ra * 2), this.dyn_dtree = new Uint16Array((2 * Oa + 1) * 2), this.bl_tree = new Uint16Array((2 * Ca + 1) * 2), fe(this.dyn_ltree), fe(this.dyn_dtree), fe(this.bl_tree), this.l_desc = null, this.d_desc = null, this.bl_desc = null, this.bl_count = new Uint16Array(Ia + 1), this.heap = new Uint16Array(2 * Ht + 1), fe(this.heap), this.heap_len = 0, this.heap_max = 0, this.depth = new Uint16Array(2 * Ht + 1), fe(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;
+function Ua() {
+  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 = Rt, 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(Ia * 2), this.dyn_dtree = new Uint16Array((2 * Ra + 1) * 2), this.bl_tree = new Uint16Array((2 * Na + 1) * 2), fe(this.dyn_ltree), fe(this.dyn_dtree), fe(this.bl_tree), this.l_desc = null, this.d_desc = null, this.bl_desc = null, this.bl_count = new Uint16Array(Za + 1), this.heap = new Uint16Array(2 * Wt + 1), fe(this.heap), this.heap_len = 0, this.heap_max = 0, this.depth = new Uint16Array(2 * Wt + 1), fe(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 ot = (e) => {
+const lt = (e) => {
   if (!e)
     return 1;
   const t = e.state;
   return !t || t.strm !== e || t.status !== Re && //#ifdef GZIP
   t.status !== pn && //#endif
-  t.status !== Wt && t.status !== qt && t.status !== Kt && t.status !== Gt && t.status !== xe && t.status !== Ve ? 1 : 0;
-}, gr = (e) => {
-  if (ot(e))
+  t.status !== qt && t.status !== Kt && t.status !== Gt && t.status !== Xt && t.status !== xe && t.status !== Ve ? 1 : 0;
+}, vr = (e) => {
+  if (lt(e))
     return ke(e, ee);
-  e.total_in = e.total_out = 0, e.data_type = xa;
+  e.total_in = e.total_out = 0, e.data_type = Sa;
   const t = e.state;
   return t.pending = 0, t.pending_out = 0, t.wrap < 0 && (t.wrap = -t.wrap), t.status = //#ifdef GZIP
   t.wrap === 2 ? pn : (
     //#endif
     t.wrap ? Re : xe
-  ), e.adler = t.wrap === 2 ? 0 : 1, t.last_flush = -2, ua(t), L;
-}, mr = (e) => {
-  const t = gr(e);
-  return t === L && Fa(e.state), t;
-}, Ma = (e, t) => ot(e) || e.state.wrap !== 2 ? ee : (e.state.gzhead = t, L), yr = (e, t, n, r, a, i) => {
+  ), e.adler = t.wrap === 2 ? 0 : 1, t.last_flush = -2, ha(t), D;
+}, br = (e) => {
+  const t = vr(e);
+  return t === D && Ma(e.state), t;
+}, Pa = (e, t) => lt(e) || e.state.wrap !== 2 ? ee : (e.state.gzhead = t, D), wr = (e, t, n, r, a, i) => {
   if (!e)
     return ee;
   let s = 1;
-  if (t === ma && (t = 6), r < 0 ? (s = 0, r = -r) : r > 15 && (s = 2, r -= 16), a < 1 || a > ka || n !== Ct || r < 8 || r > 15 || t < 0 || t > 9 || i < 0 || i > ba || r === 8 && s !== 1)
+  if (t === va && (t = 6), r < 0 ? (s = 0, r = -r) : r > 15 && (s = 2, r -= 16), a < 1 || a > Ta || n !== Rt || r < 8 || r > 15 || t < 0 || t > 9 || i < 0 || i > xa || r === 8 && s !== 1)
     return ke(e, ee);
   r === 8 && (r = 9);
-  const o = new ja();
-  return e.state = o, o.strm = e, o.status = Re, o.wrap = s, o.gzhead = null, o.w_bits = r, o.w_size = 1 << o.w_bits, o.w_mask = o.w_size - 1, o.hash_bits = a + 7, o.hash_size = 1 << o.hash_bits, o.hash_mask = o.hash_size - 1, o.hash_shift = ~~((o.hash_bits + x - 1) / x), o.window = new Uint8Array(o.w_size * 2), o.head = new Uint16Array(o.hash_size), o.prev = new Uint16Array(o.w_size), o.lit_bufsize = 1 << a + 6, o.pending_buf_size = o.lit_bufsize * 4, o.pending_buf = new Uint8Array(o.pending_buf_size), o.sym_buf = o.lit_bufsize, o.sym_end = (o.lit_bufsize - 1) * 3, o.level = t, o.strategy = i, o.method = n, mr(e);
-}, Ua = (e, t) => yr(e, t, Ct, Sa, Ta, wa), Pa = (e, t) => {
-  if (ot(e) || t > En || t < 0)
+  const o = new Ua();
+  return e.state = o, o.strm = e, o.status = Re, o.wrap = s, o.gzhead = null, o.w_bits = r, o.w_size = 1 << o.w_bits, o.w_mask = o.w_size - 1, o.hash_bits = a + 7, o.hash_size = 1 << o.hash_bits, o.hash_mask = o.hash_size - 1, o.hash_shift = ~~((o.hash_bits + x - 1) / x), o.window = new Uint8Array(o.w_size * 2), o.head = new Uint16Array(o.hash_size), o.prev = new Uint16Array(o.w_size), o.lit_bufsize = 1 << a + 6, o.pending_buf_size = o.lit_bufsize * 4, o.pending_buf = new Uint8Array(o.pending_buf_size), o.sym_buf = o.lit_bufsize, o.sym_end = (o.lit_bufsize - 1) * 3, o.level = t, o.strategy = i, o.method = n, br(e);
+}, Ba = (e, t) => wr(e, t, Rt, Ea, Aa, ka), Va = (e, t) => {
+  if (lt(e) || t > An || t < 0)
     return e ? ke(e, ee) : ee;
   const n = e.state;
-  if (!e.output || e.avail_in !== 0 && !e.input || n.status === Ve && t !== W)
-    return ke(e, e.avail_out === 0 ? Ft : ee);
+  if (!e.output || e.avail_in !== 0 && !e.input || n.status === Ve && t !== K)
+    return ke(e, e.avail_out === 0 ? jt : ee);
   const r = n.last_flush;
   if (n.last_flush = t, n.pending !== 0) {
-    if (B(e), e.avail_out === 0)
-      return n.last_flush = -1, L;
-  } else if (e.avail_in === 0 && Cn(t) <= Cn(r) && t !== W)
-    return ke(e, Ft);
+    if (V(e), e.avail_out === 0)
+      return n.last_flush = -1, D;
+  } else if (e.avail_in === 0 && Cn(t) <= Cn(r) && t !== K)
+    return ke(e, jt);
   if (n.status === Ve && e.avail_in !== 0)
-    return ke(e, Ft);
+    return ke(e, jt);
   if (n.status === Re && n.wrap === 0 && (n.status = xe), n.status === Re) {
-    let a = Ct + (n.w_bits - 8 << 4) << 8, i = -1;
-    if (n.strategy >= ht || n.level < 2 ? i = 0 : n.level < 6 ? i = 1 : n.level === 6 ? i = 2 : i = 3, a |= i << 6, n.strstart !== 0 && (a |= Na), a += 31 - a % 31, Be(n, a), n.strstart !== 0 && (Be(n, e.adler >>> 16), Be(n, e.adler & 65535)), e.adler = 1, n.status = xe, B(e), n.pending !== 0)
-      return n.last_flush = -1, L;
+    let a = Rt + (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, a |= i << 6, n.strstart !== 0 && (a |= za), a += 31 - a % 31, Be(n, a), n.strstart !== 0 && (Be(n, e.adler >>> 16), Be(n, e.adler & 65535)), e.adler = 1, n.status = xe, V(e), n.pending !== 0)
+      return n.last_flush = -1, D;
   }
   if (n.status === pn) {
-    if (e.adler = 0, E(n, 31), E(n, 139), E(n, 8), n.gzhead)
-      E(
+    if (e.adler = 0, A(n, 31), A(n, 139), A(n, 8), n.gzhead)
+      A(
         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)
-      ), E(n, n.gzhead.time & 255), E(n, n.gzhead.time >> 8 & 255), E(n, n.gzhead.time >> 16 & 255), E(n, n.gzhead.time >> 24 & 255), E(n, n.level === 9 ? 2 : n.strategy >= ht || n.level < 2 ? 4 : 0), E(n, n.gzhead.os & 255), n.gzhead.extra && n.gzhead.extra.length && (E(n, n.gzhead.extra.length & 255), E(n, n.gzhead.extra.length >> 8 & 255)), n.gzhead.hcrc && (e.adler = de(e.adler, n.pending_buf, n.pending, 0)), n.gzindex = 0, n.status = Wt;
-    else if (E(n, 0), E(n, 0), E(n, 0), E(n, 0), E(n, 0), E(n, n.level === 9 ? 2 : n.strategy >= ht || n.level < 2 ? 4 : 0), E(n, Za), n.status = xe, B(e), n.pending !== 0)
-      return n.last_flush = -1, L;
+      ), A(n, n.gzhead.time & 255), A(n, n.gzhead.time >> 8 & 255), A(n, n.gzhead.time >> 16 & 255), A(n, n.gzhead.time >> 24 & 255), A(n, n.level === 9 ? 2 : n.strategy >= _t || n.level < 2 ? 4 : 0), A(n, n.gzhead.os & 255), n.gzhead.extra && n.gzhead.extra.length && (A(n, n.gzhead.extra.length & 255), A(n, n.gzhead.extra.length >> 8 & 255)), n.gzhead.hcrc && (e.adler = de(e.adler, n.pending_buf, n.pending, 0)), n.gzindex = 0, n.status = qt;
+    else if (A(n, 0), A(n, 0), A(n, 0), A(n, 0), A(n, 0), A(n, n.level === 9 ? 2 : n.strategy >= _t || n.level < 2 ? 4 : 0), A(n, Da), n.status = xe, V(e), n.pending !== 0)
+      return n.last_flush = -1, D;
   }
-  if (n.status === Wt) {
+  if (n.status === qt) {
     if (n.gzhead.extra) {
       let a = n.pending, i = (n.gzhead.extra.length & 65535) - n.gzindex;
       for (; n.pending + i > n.pending_buf_size; ) {
         let o = n.pending_buf_size - n.pending;
-        if (n.pending_buf.set(n.gzhead.extra.subarray(n.gzindex, n.gzindex + o), n.pending), n.pending = n.pending_buf_size, n.gzhead.hcrc && n.pending > a && (e.adler = de(e.adler, n.pending_buf, n.pending - a, a)), n.gzindex += o, B(e), n.pending !== 0)
-          return n.last_flush = -1, L;
+        if (n.pending_buf.set(n.gzhead.extra.subarray(n.gzindex, n.gzindex + o), n.pending), n.pending = n.pending_buf_size, n.gzhead.hcrc && n.pending > a && (e.adler = de(e.adler, n.pending_buf, n.pending - a, a)), n.gzindex += o, V(e), n.pending !== 0)
+          return n.last_flush = -1, D;
         a = 0, i -= o;
       }
       let s = new Uint8Array(n.gzhead.extra);
       n.pending_buf.set(s.subarray(n.gzindex, n.gzindex + i), n.pending), n.pending += i, n.gzhead.hcrc && n.pending > a && (e.adler = de(e.adler, n.pending_buf, n.pending - a, a)), n.gzindex = 0;
     }
-    n.status = qt;
+    n.status = Kt;
   }
-  if (n.status === qt) {
+  if (n.status === Kt) {
     if (n.gzhead.name) {
       let a = n.pending, i;
       do {
         if (n.pending === n.pending_buf_size) {
-          if (n.gzhead.hcrc && n.pending > a && (e.adler = de(e.adler, n.pending_buf, n.pending - a, a)), B(e), n.pending !== 0)
-            return n.last_flush = -1, L;
+          if (n.gzhead.hcrc && n.pending > a && (e.adler = de(e.adler, n.pending_buf, n.pending - a, a)), V(e), n.pending !== 0)
+            return n.last_flush = -1, D;
           a = 0;
         }
-        n.gzindex < n.gzhead.name.length ? i = n.gzhead.name.charCodeAt(n.gzindex++) & 255 : i = 0, E(n, i);
+        n.gzindex < n.gzhead.name.length ? i = n.gzhead.name.charCodeAt(n.gzindex++) & 255 : i = 0, A(n, i);
       } while (i !== 0);
       n.gzhead.hcrc && n.pending > a && (e.adler = de(e.adler, n.pending_buf, n.pending - a, a)), n.gzindex = 0;
     }
-    n.status = Kt;
+    n.status = Gt;
   }
-  if (n.status === Kt) {
+  if (n.status === Gt) {
     if (n.gzhead.comment) {
       let a = n.pending, i;
       do {
         if (n.pending === n.pending_buf_size) {
-          if (n.gzhead.hcrc && n.pending > a && (e.adler = de(e.adler, n.pending_buf, n.pending - a, a)), B(e), n.pending !== 0)
-            return n.last_flush = -1, L;
+          if (n.gzhead.hcrc && n.pending > a && (e.adler = de(e.adler, n.pending_buf, n.pending - a, a)), V(e), n.pending !== 0)
+            return n.last_flush = -1, D;
           a = 0;
         }
-        n.gzindex < n.gzhead.comment.length ? i = n.gzhead.comment.charCodeAt(n.gzindex++) & 255 : i = 0, E(n, i);
+        n.gzindex < n.gzhead.comment.length ? i = n.gzhead.comment.charCodeAt(n.gzindex++) & 255 : i = 0, A(n, i);
       } while (i !== 0);
       n.gzhead.hcrc && n.pending > a && (e.adler = de(e.adler, n.pending_buf, n.pending - a, a));
     }
-    n.status = Gt;
+    n.status = Xt;
   }
-  if (n.status === Gt) {
+  if (n.status === Xt) {
     if (n.gzhead.hcrc) {
-      if (n.pending + 2 > n.pending_buf_size && (B(e), n.pending !== 0))
-        return n.last_flush = -1, L;
-      E(n, e.adler & 255), E(n, e.adler >> 8 & 255), e.adler = 0;
+      if (n.pending + 2 > n.pending_buf_size && (V(e), n.pending !== 0))
+        return n.last_flush = -1, D;
+      A(n, e.adler & 255), A(n, e.adler >> 8 & 255), e.adler = 0;
     }
-    if (n.status = xe, B(e), n.pending !== 0)
-      return n.last_flush = -1, L;
+    if (n.status = xe, V(e), n.pending !== 0)
+      return n.last_flush = -1, D;
   }
   if (e.avail_in !== 0 || n.lookahead !== 0 || t !== pe && n.status !== Ve) {
-    let a = n.level === 0 ? pr(n, t) : n.strategy === ht ? $a(n, t) : n.strategy === va ? Da(n, t) : He[n.level].func(n, t);
-    if ((a === Se || a === Me) && (n.status = Ve), a === F || a === Se)
-      return e.avail_out === 0 && (n.last_flush = -1), L;
-    if (a === je && (t === _a ? ha(n) : t !== En && (Vt(n, 0, 0, !1), t === pa && (fe(n.head), n.lookahead === 0 && (n.strstart = 0, n.block_start = 0, n.insert = 0))), B(e), e.avail_out === 0))
-      return n.last_flush = -1, L;
-  }
-  return t !== W ? L : n.wrap <= 0 ? On : (n.wrap === 2 ? (E(n, e.adler & 255), E(n, e.adler >> 8 & 255), E(n, e.adler >> 16 & 255), E(n, e.adler >> 24 & 255), E(n, e.total_in & 255), E(n, e.total_in >> 8 & 255), E(n, e.total_in >> 16 & 255), E(n, e.total_in >> 24 & 255)) : (Be(n, e.adler >>> 16), Be(n, e.adler & 65535)), B(e), n.wrap > 0 && (n.wrap = -n.wrap), n.pending !== 0 ? L : On);
-}, Ba = (e) => {
-  if (ot(e))
+    let a = n.level === 0 ? yr(n, t) : n.strategy === _t ? ja(n, t) : n.strategy === wa ? $a(n, t) : He[n.level].func(n, t);
+    if ((a === Se || a === Me) && (n.status = Ve), a === j || a === Se)
+      return e.avail_out === 0 && (n.last_flush = -1), D;
+    if (a === je && (t === ga ? pa(n) : t !== An && (Ht(n, 0, 0, !1), t === ma && (fe(n.head), n.lookahead === 0 && (n.strstart = 0, n.block_start = 0, n.insert = 0))), V(e), e.avail_out === 0))
+      return n.last_flush = -1, D;
+  }
+  return t !== K ? D : n.wrap <= 0 ? On : (n.wrap === 2 ? (A(n, e.adler & 255), A(n, e.adler >> 8 & 255), A(n, e.adler >> 16 & 255), A(n, e.adler >> 24 & 255), A(n, e.total_in & 255), A(n, e.total_in >> 8 & 255), A(n, e.total_in >> 16 & 255), A(n, e.total_in >> 24 & 255)) : (Be(n, e.adler >>> 16), Be(n, e.adler & 65535)), V(e), n.wrap > 0 && (n.wrap = -n.wrap), n.pending !== 0 ? D : On);
+}, Ha = (e) => {
+  if (lt(e))
     return ee;
   const t = e.state.status;
-  return e.state = null, t === xe ? ke(e, ga) : L;
-}, Va = (e, t) => {
+  return e.state = null, t === xe ? ke(e, ya) : D;
+}, Wa = (e, t) => {
   let n = t.length;
-  if (ot(e))
+  if (lt(e))
     return ee;
   const r = e.state, a = r.wrap;
   if (a === 2 || a === 1 && r.status !== Re || r.lookahead)
     return ee;
-  if (a === 1 && (e.adler = fr(e.adler, t, n, 0)), r.wrap = 0, n >= r.w_size) {
+  if (a === 1 && (e.adler = pr(e.adler, t, n, 0)), r.wrap = 0, n >= r.w_size) {
     a === 0 && (fe(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, s = e.next_in, o = e.input;
-  for (e.avail_in = n, e.next_in = 0, e.input = t, Ie(r); r.lookahead >= x; ) {
+  for (e.avail_in = n, e.next_in = 0, e.input = t, Ne(r); r.lookahead >= x; ) {
     let c = r.strstart, l = r.lookahead - (x - 1);
     do
       r.ins_h = ge(r, r.ins_h, r.window[c + x - 1]), r.prev[c & r.w_mask] = r.head[r.ins_h], r.head[r.ins_h] = c, c++;
     while (--l);
-    r.strstart = c, r.lookahead = x - 1, Ie(r);
+    r.strstart = c, r.lookahead = x - 1, Ne(r);
   }
-  return r.strstart += r.lookahead, r.block_start = r.strstart, r.insert = r.lookahead, r.lookahead = 0, r.match_length = r.prev_length = x - 1, r.match_available = 0, e.next_in = s, e.input = o, e.avail_in = i, r.wrap = a, L;
+  return r.strstart += r.lookahead, r.block_start = r.strstart, r.insert = r.lookahead, r.lookahead = 0, r.match_length = r.prev_length = x - 1, r.match_available = 0, e.next_in = s, e.input = o, e.avail_in = i, r.wrap = a, D;
 };
-var Ha = Ua, Wa = yr, qa = mr, Ka = gr, Ga = Ma, Xa = Pa, Ya = Ba, Ja = Va, Qa = "pako deflate (from Nodeca project)", Ge = {
-  deflateInit: Ha,
-  deflateInit2: Wa,
-  deflateReset: qa,
-  deflateResetKeep: Ka,
-  deflateSetHeader: Ga,
-  deflate: Xa,
-  deflateEnd: Ya,
-  deflateSetDictionary: Ja,
-  deflateInfo: Qa
+var qa = Ba, Ka = wr, Ga = br, Xa = vr, Ya = Pa, Ja = Va, Qa = Ha, ei = Wa, ti = "pako deflate (from Nodeca project)", Xe = {
+  deflateInit: qa,
+  deflateInit2: Ka,
+  deflateReset: Ga,
+  deflateResetKeep: Xa,
+  deflateSetHeader: Ya,
+  deflate: Ja,
+  deflateEnd: Qa,
+  deflateSetDictionary: ei,
+  deflateInfo: ti
 };
-const ei = (e, t) => Object.prototype.hasOwnProperty.call(e, t);
-var ti = function(e) {
+const ni = (e, t) => Object.prototype.hasOwnProperty.call(e, t);
+var ri = function(e) {
   const t = Array.prototype.slice.call(arguments, 1);
   for (; t.length; ) {
     const n = t.shift();
@@ -692,11 +692,11 @@ var ti = function(e) {
       if (typeof n != "object")
         throw new TypeError(n + "must be non-object");
       for (const r in n)
-        ei(n, r) && (e[r] = n[r]);
+        ni(n, r) && (e[r] = n[r]);
     }
   }
   return e;
-}, ni = (e) => {
+}, ai = (e) => {
   let t = 0;
   for (let r = 0, a = e.length; r < a; r++)
     t += e[r].length;
@@ -706,21 +706,21 @@ var ti = function(e) {
     n.set(s, a), a += s.length;
   }
   return n;
-}, vr = {
-  assign: ti,
-  flattenChunks: ni
+}, xr = {
+  assign: ri,
+  flattenChunks: ai
 };
-let br = !0;
+let kr = !0;
 try {
   String.fromCharCode.apply(null, new Uint8Array(1));
 } catch (e) {
-  br = !1;
+  kr = !1;
 }
-const et = new Uint8Array(256);
+const tt = new Uint8Array(256);
 for (let e = 0; e < 256; e++)
-  et[e] = e >= 252 ? 6 : e >= 248 ? 5 : e >= 240 ? 4 : e >= 224 ? 3 : e >= 192 ? 2 : 1;
-et[254] = et[254] = 1;
-var ri = (e) => {
+  tt[e] = e >= 252 ? 6 : e >= 248 ? 5 : e >= 240 ? 4 : e >= 224 ? 3 : e >= 192 ? 2 : 1;
+tt[254] = tt[254] = 1;
+var ii = (e) => {
   if (typeof TextEncoder == "function" && TextEncoder.prototype.encode)
     return new TextEncoder().encode(e);
   let t, n, r, a, i, s = e.length, o = 0;
@@ -730,15 +730,15 @@ var ri = (e) => {
     n = e.charCodeAt(a), (n & 64512) === 55296 && a + 1 < s && (r = e.charCodeAt(a + 1), (r & 64512) === 56320 && (n = 65536 + (n - 55296 << 10) + (r - 56320), a++)), n < 128 ? t[i++] = n : n < 2048 ? (t[i++] = 192 | n >>> 6, t[i++] = 128 | n & 63) : n < 65536 ? (t[i++] = 224 | n >>> 12, t[i++] = 128 | n >>> 6 & 63, t[i++] = 128 | n & 63) : (t[i++] = 240 | n >>> 18, t[i++] = 128 | n >>> 12 & 63, t[i++] = 128 | n >>> 6 & 63, t[i++] = 128 | n & 63);
   return t;
 };
-const ai = (e, t) => {
-  if (t < 65534 && e.subarray && br)
+const si = (e, t) => {
+  if (t < 65534 && e.subarray && kr)
     return String.fromCharCode.apply(null, e.length === t ? e : e.subarray(0, t));
   let n = "";
   for (let r = 0; r < t; r++)
     n += String.fromCharCode(e[r]);
   return n;
 };
-var ii = (e, t) => {
+var oi = (e, t) => {
   const n = t || e.length;
   if (typeof TextDecoder == "function" && TextDecoder.prototype.decode)
     return new TextDecoder().decode(e.subarray(0, t));
@@ -750,7 +750,7 @@ var ii = (e, t) => {
       i[a++] = s;
       continue;
     }
-    let o = et[s];
+    let o = tt[s];
     if (o > 4) {
       i[a++] = 65533, r += o - 1;
       continue;
@@ -763,45 +763,45 @@ var ii = (e, t) => {
     }
     s < 65536 ? i[a++] = s : (s -= 65536, i[a++] = 55296 | s >> 10 & 1023, i[a++] = 56320 | s & 1023);
   }
-  return ai(i, a);
-}, si = (e, t) => {
+  return si(i, a);
+}, li = (e, t) => {
   t = t || e.length, t > e.length && (t = e.length);
   let n = t - 1;
   for (; n >= 0 && (e[n] & 192) === 128; )
     n--;
-  return n < 0 || n === 0 ? t : n + et[e[n]] > t ? n : t;
-}, wr = {
-  string2buf: ri,
-  buf2string: ii,
-  utf8border: si
+  return n < 0 || n === 0 ? t : n + tt[e[n]] > t ? n : t;
+}, Sr = {
+  string2buf: ii,
+  buf2string: oi,
+  utf8border: li
 };
-function oi() {
+function ci() {
   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 li = oi;
-const xr = Object.prototype.toString, {
-  Z_NO_FLUSH: ci,
-  Z_SYNC_FLUSH: di,
-  Z_FULL_FLUSH: ui,
-  Z_FINISH: fi,
-  Z_OK: xt,
-  Z_STREAM_END: hi,
-  Z_DEFAULT_COMPRESSION: _i,
-  Z_DEFAULT_STRATEGY: pi,
-  Z_DEFLATED: gi
-} = hr;
-function Rt(e) {
-  this.options = vr.assign({
-    level: _i,
-    method: gi,
+var di = ci;
+const Tr = Object.prototype.toString, {
+  Z_NO_FLUSH: ui,
+  Z_SYNC_FLUSH: fi,
+  Z_FULL_FLUSH: hi,
+  Z_FINISH: _i,
+  Z_OK: kt,
+  Z_STREAM_END: pi,
+  Z_DEFAULT_COMPRESSION: gi,
+  Z_DEFAULT_STRATEGY: mi,
+  Z_DEFLATED: yi
+} = gr;
+function Nt(e) {
+  this.options = xr.assign({
+    level: gi,
+    method: yi,
     chunkSize: 16384,
     windowBits: 15,
     memLevel: 8,
-    strategy: pi
+    strategy: mi
   }, 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 li(), this.strm.avail_out = 0;
-  let n = Ge.deflateInit2(
+  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 di(), this.strm.avail_out = 0;
+  let n = Xe.deflateInit2(
     this.strm,
     t.level,
     t.method,
@@ -809,27 +809,27 @@ function Rt(e) {
     t.memLevel,
     t.strategy
   );
-  if (n !== xt)
-    throw new Error(wt[n]);
-  if (t.header && Ge.deflateSetHeader(this.strm, t.header), t.dictionary) {
+  if (n !== kt)
+    throw new Error(xt[n]);
+  if (t.header && Xe.deflateSetHeader(this.strm, t.header), t.dictionary) {
     let r;
-    if (typeof t.dictionary == "string" ? r = wr.string2buf(t.dictionary) : xr.call(t.dictionary) === "[object ArrayBuffer]" ? r = new Uint8Array(t.dictionary) : r = t.dictionary, n = Ge.deflateSetDictionary(this.strm, r), n !== xt)
-      throw new Error(wt[n]);
+    if (typeof t.dictionary == "string" ? r = Sr.string2buf(t.dictionary) : Tr.call(t.dictionary) === "[object ArrayBuffer]" ? r = new Uint8Array(t.dictionary) : r = t.dictionary, n = Xe.deflateSetDictionary(this.strm, r), n !== kt)
+      throw new Error(xt[n]);
     this._dict_set = !0;
   }
 }
-Rt.prototype.push = function(e, t) {
+Nt.prototype.push = function(e, t) {
   const n = this.strm, r = this.options.chunkSize;
   let a, i;
   if (this.ended)
     return !1;
-  for (t === ~~t ? i = t : i = t === !0 ? fi : ci, typeof e == "string" ? n.input = wr.string2buf(e) : xr.call(e) === "[object ArrayBuffer]" ? n.input = new Uint8Array(e) : n.input = e, n.next_in = 0, n.avail_in = n.input.length; ; ) {
-    if (n.avail_out === 0 && (n.output = new Uint8Array(r), n.next_out = 0, n.avail_out = r), (i === di || i === ui) && n.avail_out <= 6) {
+  for (t === ~~t ? i = t : i = t === !0 ? _i : ui, typeof e == "string" ? n.input = Sr.string2buf(e) : Tr.call(e) === "[object ArrayBuffer]" ? n.input = new Uint8Array(e) : n.input = e, n.next_in = 0, n.avail_in = n.input.length; ; ) {
+    if (n.avail_out === 0 && (n.output = new Uint8Array(r), n.next_out = 0, n.avail_out = r), (i === fi || i === hi) && n.avail_out <= 6) {
       this.onData(n.output.subarray(0, n.next_out)), n.avail_out = 0;
       continue;
     }
-    if (a = Ge.deflate(n, i), a === hi)
-      return n.next_out > 0 && this.onData(n.output.subarray(0, n.next_out)), a = Ge.deflateEnd(this.strm), this.onEnd(a), this.ended = !0, a === xt;
+    if (a = Xe.deflate(n, i), a === pi)
+      return n.next_out > 0 && this.onData(n.output.subarray(0, n.next_out)), a = Xe.deflateEnd(this.strm), this.onEnd(a), this.ended = !0, a === kt;
     if (n.avail_out === 0) {
       this.onData(n.output);
       continue;
@@ -842,26 +842,26 @@ Rt.prototype.push = function(e, t) {
   }
   return !0;
 };
-Rt.prototype.onData = function(e) {
+Nt.prototype.onData = function(e) {
   this.chunks.push(e);
 };
-Rt.prototype.onEnd = function(e) {
-  e === xt && (this.result = vr.flattenChunks(this.chunks)), this.chunks = [], this.err = e, this.msg = this.strm.msg;
+Nt.prototype.onEnd = function(e) {
+  e === kt && (this.result = xr.flattenChunks(this.chunks)), this.chunks = [], this.err = e, this.msg = this.strm.msg;
 };
-function mi(e, t) {
-  const n = new Rt(t);
+function vi(e, t) {
+  const n = new Nt(t);
   if (n.push(e, !0), n.err)
-    throw n.msg || wt[n.err];
+    throw n.msg || xt[n.err];
   return n.result;
 }
-function yi(e, t) {
-  return t = t || {}, t.gzip = !0, mi(e, t);
+function bi(e, t) {
+  return t = t || {}, t.gzip = !0, vi(e, t);
 }
-var vi = yi, bi = {
-  gzip: vi
+var wi = bi, xi = {
+  gzip: wi
 };
-const { gzip: wi } = bi;
-var xi = wi;
+const { gzip: ki } = xi;
+var Si = ki;
 class be extends Error {
   constructor({
     name: t,
@@ -872,48 +872,57 @@ class be extends Error {
     super(), this.name = t, this.message = n, this.detail = a, this.status = r;
   }
 }
-class ki extends Error {
+class Ti extends Error {
   constructor() {
-    super("Invalid Figma Access Token");
+    super("Malformatted Figma Token");
   }
 }
-class Si extends Error {
+class Ei extends Error {
   constructor() {
     super("Missing Figma Token");
   }
 }
-const kr = "Figma Token Issue";
-class Ti extends Error {
-  constructor({ cause: t }) {
-    super(kr), this.cause = t;
+class Rn extends Error {
+  constructor() {
+    super("Needs Reauth Figma Token");
   }
 }
-const Ai = (e) => e.message === kr, Sr = "Not Found";
-class Ei extends Error {
-  constructor({ cause: t }) {
-    super(Sr), this.cause = t;
+class Nn extends Error {
+  constructor() {
+    super("Expired Figma Token");
   }
 }
-const Oi = (e) => e.message === Sr, Tr = "Unknown Figma API Exception";
-class Ci extends Error {
+class In extends Error {
+  constructor({ reason: t }) {
+    super("Unknown Forbidden Figma Error"), this.reason = t;
+  }
+}
+const Er = "Not Found";
+class Ai extends Error {
   constructor({ cause: t }) {
-    super(Tr), this.cause = t;
+    super(Er), this.cause = t;
   }
 }
-const Ks = (e) => e.message === Tr, Ar = "Rate Limit Exceeded";
-class Rn extends Error {
+const Hs = (e) => e.message === Er, Ar = "Unknown Figma API Exception";
+class Oi extends Error {
   constructor({ cause: t }) {
     super(Ar), this.cause = t;
   }
 }
-const Ri = (e) => e.message === Ar, Er = "Request Too Large";
-class Ii extends Error {
+const Ws = (e) => e.message === Ar, Or = "Rate Limit Exceeded";
+class Zn extends Error {
   constructor({ cause: t }) {
-    super(Er), this.cause = t;
+    super(Or), this.cause = t;
+  }
+}
+const qs = (e) => e.message === Or, Cr = "Request Too Large";
+class Ci extends Error {
+  constructor({ cause: t }) {
+    super(Cr), this.cause = t;
   }
 }
-const Ni = (e) => e.message === Er;
-var A;
+const Ks = (e) => e.message === Cr;
+var E;
 (function(e) {
   e.assertEqual = (a) => {
   };
@@ -949,12 +958,12 @@ var A;
     return a.map((s) => typeof s == "string" ? `'${s}'` : s).join(i);
   }
   e.joinValues = r, e.jsonStringifyReplacer = (a, i) => typeof i == "bigint" ? i.toString() : i;
-})(A || (A = {}));
-var In;
+})(E || (E = {}));
+var zn;
 (function(e) {
   e.mergeShapes = (t, n) => d(d({}, t), n);
-})(In || (In = {}));
-const _ = A.arrayToEnum([
+})(zn || (zn = {}));
+const _ = E.arrayToEnum([
   "string",
   "nan",
   "number",
@@ -996,7 +1005,7 @@ const _ = A.arrayToEnum([
     default:
       return _.unknown;
   }
-}, u = A.arrayToEnum([
+}, u = E.arrayToEnum([
   "invalid_type",
   "invalid_literal",
   "custom",
@@ -1058,7 +1067,7 @@ class ce extends Error {
     return this.message;
   }
   get message() {
-    return JSON.stringify(this.issues, A.jsonStringifyReplacer, 2);
+    return JSON.stringify(this.issues, E.jsonStringifyReplacer, 2);
   }
   get isEmpty() {
     return this.issues.length === 0;
@@ -1078,26 +1087,26 @@ class ce extends Error {
   }
 }
 ce.create = (e) => new ce(e);
-const Yt = (e, t) => {
+const Jt = (e, t) => {
   let n;
   switch (e.code) {
     case u.invalid_type:
       e.received === _.undefined ? n = "Required" : n = `Expected ${e.expected}, received ${e.received}`;
       break;
     case u.invalid_literal:
-      n = `Invalid literal value, expected ${JSON.stringify(e.expected, A.jsonStringifyReplacer)}`;
+      n = `Invalid literal value, expected ${JSON.stringify(e.expected, E.jsonStringifyReplacer)}`;
       break;
     case u.unrecognized_keys:
-      n = `Unrecognized key(s) in object: ${A.joinValues(e.keys, ", ")}`;
+      n = `Unrecognized key(s) in object: ${E.joinValues(e.keys, ", ")}`;
       break;
     case u.invalid_union:
       n = "Invalid input";
       break;
     case u.invalid_union_discriminator:
-      n = `Invalid discriminator value. Expected ${A.joinValues(e.options)}`;
+      n = `Invalid discriminator value. Expected ${E.joinValues(e.options)}`;
       break;
     case u.invalid_enum_value:
-      n = `Invalid enum value. Expected ${A.joinValues(e.options)}, received '${e.received}'`;
+      n = `Invalid enum value. Expected ${E.joinValues(e.options)}, received '${e.received}'`;
       break;
     case u.invalid_arguments:
       n = "Invalid function arguments";
@@ -1109,7 +1118,7 @@ const Yt = (e, t) => {
       n = "Invalid date";
       break;
     case u.invalid_string:
-      typeof e.validation == "object" ? "includes" in e.validation ? (n = `Invalid input: must include "${e.validation.includes}"`, typeof e.validation.position == "number" && (n = `${n} at one or more positions greater than or equal to ${e.validation.position}`)) : "startsWith" in e.validation ? n = `Invalid input: must start with "${e.validation.startsWith}"` : "endsWith" in e.validation ? n = `Invalid input: must end with "${e.validation.endsWith}"` : A.assertNever(e.validation) : e.validation !== "regex" ? n = `Invalid ${e.validation}` : n = "Invalid";
+      typeof e.validation == "object" ? "includes" in e.validation ? (n = `Invalid input: must include "${e.validation.includes}"`, typeof e.validation.position == "number" && (n = `${n} at one or more positions greater than or equal to ${e.validation.position}`)) : "startsWith" in e.validation ? n = `Invalid input: must start with "${e.validation.startsWith}"` : "endsWith" in e.validation ? n = `Invalid input: must end with "${e.validation.endsWith}"` : E.assertNever(e.validation) : e.validation !== "regex" ? n = `Invalid ${e.validation}` : n = "Invalid";
       break;
     case u.too_small:
       e.type === "array" ? n = `Array must contain ${e.exact ? "exactly" : e.inclusive ? "at least" : "more than"} ${e.minimum} element(s)` : e.type === "string" ? n = `String must contain ${e.exact ? "exactly" : e.inclusive ? "at least" : "over"} ${e.minimum} character(s)` : e.type === "number" ? n = `Number must be ${e.exact ? "exactly equal to " : e.inclusive ? "greater than or equal to " : "greater than "}${e.minimum}` : e.type === "bigint" ? n = `Number must be ${e.exact ? "exactly equal to " : e.inclusive ? "greater than or equal to " : "greater than "}${e.minimum}` : e.type === "date" ? n = `Date must be ${e.exact ? "exactly equal to " : e.inclusive ? "greater than or equal to " : "greater than "}${new Date(Number(e.minimum))}` : n = "Invalid input";
@@ -1130,15 +1139,15 @@ const Yt = (e, t) => {
       n = "Number must be finite";
       break;
     default:
-      n = t.defaultError, A.assertNever(e);
+      n = t.defaultError, E.assertNever(e);
   }
   return { message: n };
 };
-let Zi = Yt;
-function zi() {
-  return Zi;
+let Ri = Jt;
+function Ni() {
+  return Ri;
 }
-const Li = (e) => {
+const Ii = (e) => {
   const { data: t, path: n, errorMaps: r, issueData: a } = e, i = [...n, ...a.path || []], s = v(d({}, a), {
     path: i
   });
@@ -1157,7 +1166,7 @@ const Li = (e) => {
   });
 };
 function f(e, t) {
-  const n = zi(), r = Li({
+  const n = Ni(), r = Ii({
     issueData: t,
     data: e.data,
     path: e.path,
@@ -1168,13 +1177,13 @@ function f(e, t) {
       // then schema-bound map if available
       n,
       // then global override map
-      n === Yt ? void 0 : Yt
+      n === Jt ? void 0 : Jt
       // then global default map
     ].filter((a) => !!a)
   });
   e.common.issues.push(r);
 }
-class j {
+class M {
   constructor() {
     this.value = "valid";
   }
@@ -1203,7 +1212,7 @@ class j {
           value: s
         });
       }
-      return j.mergeObjectSync(t, r);
+      return M.mergeObjectSync(t, r);
     });
   }
   static mergeObjectSync(t, n) {
@@ -1219,7 +1228,7 @@ class j {
 }
 const m = Object.freeze({
   status: "aborted"
-}), We = (e) => ({ status: "dirty", value: e }), K = (e) => ({ status: "valid", value: e }), Nn = (e) => e.status === "aborted", Zn = (e) => e.status === "dirty", Ne = (e) => e.status === "valid", kt = (e) => typeof Promise != "undefined" && e instanceof Promise;
+}), We = (e) => ({ status: "dirty", value: e }), G = (e) => ({ status: "valid", value: e }), Dn = (e) => e.status === "aborted", Ln = (e) => e.status === "dirty", Ie = (e) => e.status === "valid", St = (e) => typeof Promise != "undefined" && e instanceof Promise;
 var p;
 (function(e) {
   e.errToObj = (t) => typeof t == "string" ? { message: t } : t || {}, e.toString = (t) => typeof t == "string" ? t : t == null ? void 0 : t.message;
@@ -1232,8 +1241,8 @@ class re {
     return this._cachedPath.length || (Array.isArray(this._key) ? this._cachedPath.push(...this._path, ...this._key) : this._cachedPath.push(...this._path, this._key)), this._cachedPath;
   }
 }
-const zn = (e, t) => {
-  if (Ne(t))
+const Fn = (e, t) => {
+  if (Ie(t))
     return { success: !0, data: t.value };
   if (!e.common.issues.length)
     throw new Error("Validation failed but no issues detected.");
@@ -1278,7 +1287,7 @@ class k {
   }
   _processInputParams(t) {
     return {
-      status: new j(),
+      status: new M(),
       ctx: {
         common: t.parent.common,
         data: t.data,
@@ -1291,7 +1300,7 @@ class k {
   }
   _parseSync(t) {
     const n = this._parse(t);
-    if (kt(n))
+    if (St(n))
       throw new Error("Synchronous parse encountered promise.");
     return n;
   }
@@ -1319,7 +1328,7 @@ class k {
       data: t,
       parsedType: ue(t)
     }, a = this._parseSync({ data: t, path: r.path, parent: r });
-    return zn(r, a);
+    return Fn(r, a);
   }
   "~validate"(t) {
     var r, a;
@@ -1337,7 +1346,7 @@ class k {
     if (!this["~standard"].async)
       try {
         const i = this._parseSync({ data: t, path: [], parent: n });
-        return Ne(i) ? {
+        return Ie(i) ? {
           value: i.value
         } : {
           issues: n.common.issues
@@ -1348,7 +1357,7 @@ class k {
           async: !0
         };
       }
-    return this._parseAsync({ data: t, path: [], parent: n }).then((i) => Ne(i) ? {
+    return this._parseAsync({ data: t, path: [], parent: n }).then((i) => Ie(i) ? {
       value: i.value
     } : {
       issues: n.common.issues
@@ -1375,8 +1384,8 @@ class k {
         parent: null,
         data: t,
         parsedType: ue(t)
-      }, a = this._parse({ data: t, path: r.path, parent: r }), i = yield kt(a) ? a : Promise.resolve(a);
-      return zn(r, i);
+      }, a = this._parse({ data: t, path: r.path, parent: r }), i = yield St(a) ? a : Promise.resolve(a);
+      return Fn(r, i);
     });
   }
   refine(t, n) {
@@ -1392,7 +1401,7 @@ class k {
     return this._refinement((r, a) => t(r) ? !0 : (a.addIssue(typeof n == "function" ? n(r, a) : n), !1));
   }
   _refinement(t) {
-    return new Le({
+    return new De({
       schema: this,
       typeName: g.ZodEffects,
       effect: { type: "refinement", refinement: t }
@@ -1412,7 +1421,7 @@ class k {
     return me.create(this, this._def);
   }
   nullable() {
-    return De.create(this, this._def);
+    return Le.create(this, this._def);
   }
   nullish() {
     return this.nullable().optional();
@@ -1421,16 +1430,16 @@ class k {
     return ne.create(this);
   }
   promise() {
-    return Ot.create(this, this._def);
+    return Ct.create(this, this._def);
   }
   or(t) {
-    return Tt.create([this, t], this._def);
+    return Et.create([this, t], this._def);
   }
   and(t) {
     return At.create(this, t, this._def);
   }
   transform(t) {
-    return new Le(v(d({}, b(this._def)), {
+    return new De(v(d({}, b(this._def)), {
       schema: this,
       typeName: g.ZodEffects,
       effect: { type: "transform", transform: t }
@@ -1438,21 +1447,21 @@ class k {
   }
   default(t) {
     const n = typeof t == "function" ? t : () => t;
-    return new nn(v(d({}, b(this._def)), {
+    return new rn(v(d({}, b(this._def)), {
       innerType: this,
       defaultValue: n,
       typeName: g.ZodDefault
     }));
   }
   brand() {
-    return new as(d({
+    return new ts(d({
       typeName: g.ZodBranded,
       type: this
     }, b(this._def)));
   }
   catch(t) {
     const n = typeof t == "function" ? t : () => t;
-    return new rn(v(d({}, b(this._def)), {
+    return new an(v(d({}, b(this._def)), {
       innerType: this,
       catchValue: n,
       typeName: g.ZodCatch
@@ -1468,7 +1477,7 @@ class k {
     return gn.create(this, t);
   }
   readonly() {
-    return an.create(this);
+    return sn.create(this);
   }
   isOptional() {
     return this.safeParse(void 0).success;
@@ -1477,28 +1486,28 @@ class k {
     return this.safeParse(null).success;
   }
 }
-const Di = /^c[^\s-]{8,}$/i, $i = /^[0-9a-z]+$/, Fi = /^[0-9A-HJKMNP-TV-Z]{26}$/i, ji = /^[0-9a-fA-F]{8}\b-[0-9a-fA-F]{4}\b-[0-9a-fA-F]{4}\b-[0-9a-fA-F]{4}\b-[0-9a-fA-F]{12}$/i, Mi = /^[a-z0-9_-]{21}$/i, Ui = /^[A-Za-z0-9-_]+\.[A-Za-z0-9-_]+\.[A-Za-z0-9-_]*$/, Pi = /^[-+]?P(?!$)(?:(?:[-+]?\d+Y)|(?:[-+]?\d+[.,]\d+Y$))?(?:(?:[-+]?\d+M)|(?:[-+]?\d+[.,]\d+M$))?(?:(?:[-+]?\d+W)|(?:[-+]?\d+[.,]\d+W$))?(?:(?:[-+]?\d+D)|(?:[-+]?\d+[.,]\d+D$))?(?:T(?=[\d+-])(?:(?:[-+]?\d+H)|(?:[-+]?\d+[.,]\d+H$))?(?:(?:[-+]?\d+M)|(?:[-+]?\d+[.,]\d+M$))?(?:[-+]?\d+(?:[.,]\d+)?S)?)??$/, Bi = /^(?!\.)(?!.*\.\.)([A-Z0-9_'+\-\.]*)[A-Z0-9_+-]@([A-Z0-9][A-Z0-9\-]*\.)+[A-Z]{2,}$/i, Vi = "^(\\p{Extended_Pictographic}|\\p{Emoji_Component})+$";
-let Mt;
-const Hi = /^(?:(?:25[0-5]|2[0-4][0-9]|1[0-9][0-9]|[1-9][0-9]|[0-9])\.){3}(?:25[0-5]|2[0-4][0-9]|1[0-9][0-9]|[1-9][0-9]|[0-9])$/, Wi = /^(?:(?:25[0-5]|2[0-4][0-9]|1[0-9][0-9]|[1-9][0-9]|[0-9])\.){3}(?:25[0-5]|2[0-4][0-9]|1[0-9][0-9]|[1-9][0-9]|[0-9])\/(3[0-2]|[12]?[0-9])$/, qi = /^(([0-9a-fA-F]{1,4}:){7,7}[0-9a-fA-F]{1,4}|([0-9a-fA-F]{1,4}:){1,7}:|([0-9a-fA-F]{1,4}:){1,6}:[0-9a-fA-F]{1,4}|([0-9a-fA-F]{1,4}:){1,5}(:[0-9a-fA-F]{1,4}){1,2}|([0-9a-fA-F]{1,4}:){1,4}(:[0-9a-fA-F]{1,4}){1,3}|([0-9a-fA-F]{1,4}:){1,3}(:[0-9a-fA-F]{1,4}){1,4}|([0-9a-fA-F]{1,4}:){1,2}(:[0-9a-fA-F]{1,4}){1,5}|[0-9a-fA-F]{1,4}:((:[0-9a-fA-F]{1,4}){1,6})|:((:[0-9a-fA-F]{1,4}){1,7}|:)|fe80:(:[0-9a-fA-F]{0,4}){0,4}%[0-9a-zA-Z]{1,}|::(ffff(:0{1,4}){0,1}:){0,1}((25[0-5]|(2[0-4]|1{0,1}[0-9]){0,1}[0-9])\.){3,3}(25[0-5]|(2[0-4]|1{0,1}[0-9]){0,1}[0-9])|([0-9a-fA-F]{1,4}:){1,4}:((25[0-5]|(2[0-4]|1{0,1}[0-9]){0,1}[0-9])\.){3,3}(25[0-5]|(2[0-4]|1{0,1}[0-9]){0,1}[0-9]))$/, Ki = /^(([0-9a-fA-F]{1,4}:){7,7}[0-9a-fA-F]{1,4}|([0-9a-fA-F]{1,4}:){1,7}:|([0-9a-fA-F]{1,4}:){1,6}:[0-9a-fA-F]{1,4}|([0-9a-fA-F]{1,4}:){1,5}(:[0-9a-fA-F]{1,4}){1,2}|([0-9a-fA-F]{1,4}:){1,4}(:[0-9a-fA-F]{1,4}){1,3}|([0-9a-fA-F]{1,4}:){1,3}(:[0-9a-fA-F]{1,4}){1,4}|([0-9a-fA-F]{1,4}:){1,2}(:[0-9a-fA-F]{1,4}){1,5}|[0-9a-fA-F]{1,4}:((:[0-9a-fA-F]{1,4}){1,6})|:((:[0-9a-fA-F]{1,4}){1,7}|:)|fe80:(:[0-9a-fA-F]{0,4}){0,4}%[0-9a-zA-Z]{1,}|::(ffff(:0{1,4}){0,1}:){0,1}((25[0-5]|(2[0-4]|1{0,1}[0-9]){0,1}[0-9])\.){3,3}(25[0-5]|(2[0-4]|1{0,1}[0-9]){0,1}[0-9])|([0-9a-fA-F]{1,4}:){1,4}:((25[0-5]|(2[0-4]|1{0,1}[0-9]){0,1}[0-9])\.){3,3}(25[0-5]|(2[0-4]|1{0,1}[0-9]){0,1}[0-9]))\/(12[0-8]|1[01][0-9]|[1-9]?[0-9])$/, Gi = /^([0-9a-zA-Z+/]{4})*(([0-9a-zA-Z+/]{2}==)|([0-9a-zA-Z+/]{3}=))?$/, Xi = /^([0-9a-zA-Z-_]{4})*(([0-9a-zA-Z-_]{2}(==)?)|([0-9a-zA-Z-_]{3}(=)?))?$/, Or = "((\\d\\d[2468][048]|\\d\\d[13579][26]|\\d\\d0[48]|[02468][048]00|[13579][26]00)-02-29|\\d{4}-((0[13578]|1[02])-(0[1-9]|[12]\\d|3[01])|(0[469]|11)-(0[1-9]|[12]\\d|30)|(02)-(0[1-9]|1\\d|2[0-8])))", Yi = new RegExp(`^${Or}$`);
-function Cr(e) {
+const Zi = /^c[^\s-]{8,}$/i, zi = /^[0-9a-z]+$/, Di = /^[0-9A-HJKMNP-TV-Z]{26}$/i, Li = /^[0-9a-fA-F]{8}\b-[0-9a-fA-F]{4}\b-[0-9a-fA-F]{4}\b-[0-9a-fA-F]{4}\b-[0-9a-fA-F]{12}$/i, Fi = /^[a-z0-9_-]{21}$/i, $i = /^[A-Za-z0-9-_]+\.[A-Za-z0-9-_]+\.[A-Za-z0-9-_]*$/, ji = /^[-+]?P(?!$)(?:(?:[-+]?\d+Y)|(?:[-+]?\d+[.,]\d+Y$))?(?:(?:[-+]?\d+M)|(?:[-+]?\d+[.,]\d+M$))?(?:(?:[-+]?\d+W)|(?:[-+]?\d+[.,]\d+W$))?(?:(?:[-+]?\d+D)|(?:[-+]?\d+[.,]\d+D$))?(?:T(?=[\d+-])(?:(?:[-+]?\d+H)|(?:[-+]?\d+[.,]\d+H$))?(?:(?:[-+]?\d+M)|(?:[-+]?\d+[.,]\d+M$))?(?:[-+]?\d+(?:[.,]\d+)?S)?)??$/, Mi = /^(?!\.)(?!.*\.\.)([A-Z0-9_'+\-\.]*)[A-Z0-9_+-]@([A-Z0-9][A-Z0-9\-]*\.)+[A-Z]{2,}$/i, Ui = "^(\\p{Extended_Pictographic}|\\p{Emoji_Component})+$";
+let Ut;
+const Pi = /^(?:(?:25[0-5]|2[0-4][0-9]|1[0-9][0-9]|[1-9][0-9]|[0-9])\.){3}(?:25[0-5]|2[0-4][0-9]|1[0-9][0-9]|[1-9][0-9]|[0-9])$/, Bi = /^(?:(?:25[0-5]|2[0-4][0-9]|1[0-9][0-9]|[1-9][0-9]|[0-9])\.){3}(?:25[0-5]|2[0-4][0-9]|1[0-9][0-9]|[1-9][0-9]|[0-9])\/(3[0-2]|[12]?[0-9])$/, Vi = /^(([0-9a-fA-F]{1,4}:){7,7}[0-9a-fA-F]{1,4}|([0-9a-fA-F]{1,4}:){1,7}:|([0-9a-fA-F]{1,4}:){1,6}:[0-9a-fA-F]{1,4}|([0-9a-fA-F]{1,4}:){1,5}(:[0-9a-fA-F]{1,4}){1,2}|([0-9a-fA-F]{1,4}:){1,4}(:[0-9a-fA-F]{1,4}){1,3}|([0-9a-fA-F]{1,4}:){1,3}(:[0-9a-fA-F]{1,4}){1,4}|([0-9a-fA-F]{1,4}:){1,2}(:[0-9a-fA-F]{1,4}){1,5}|[0-9a-fA-F]{1,4}:((:[0-9a-fA-F]{1,4}){1,6})|:((:[0-9a-fA-F]{1,4}){1,7}|:)|fe80:(:[0-9a-fA-F]{0,4}){0,4}%[0-9a-zA-Z]{1,}|::(ffff(:0{1,4}){0,1}:){0,1}((25[0-5]|(2[0-4]|1{0,1}[0-9]){0,1}[0-9])\.){3,3}(25[0-5]|(2[0-4]|1{0,1}[0-9]){0,1}[0-9])|([0-9a-fA-F]{1,4}:){1,4}:((25[0-5]|(2[0-4]|1{0,1}[0-9]){0,1}[0-9])\.){3,3}(25[0-5]|(2[0-4]|1{0,1}[0-9]){0,1}[0-9]))$/, Hi = /^(([0-9a-fA-F]{1,4}:){7,7}[0-9a-fA-F]{1,4}|([0-9a-fA-F]{1,4}:){1,7}:|([0-9a-fA-F]{1,4}:){1,6}:[0-9a-fA-F]{1,4}|([0-9a-fA-F]{1,4}:){1,5}(:[0-9a-fA-F]{1,4}){1,2}|([0-9a-fA-F]{1,4}:){1,4}(:[0-9a-fA-F]{1,4}){1,3}|([0-9a-fA-F]{1,4}:){1,3}(:[0-9a-fA-F]{1,4}){1,4}|([0-9a-fA-F]{1,4}:){1,2}(:[0-9a-fA-F]{1,4}){1,5}|[0-9a-fA-F]{1,4}:((:[0-9a-fA-F]{1,4}){1,6})|:((:[0-9a-fA-F]{1,4}){1,7}|:)|fe80:(:[0-9a-fA-F]{0,4}){0,4}%[0-9a-zA-Z]{1,}|::(ffff(:0{1,4}){0,1}:){0,1}((25[0-5]|(2[0-4]|1{0,1}[0-9]){0,1}[0-9])\.){3,3}(25[0-5]|(2[0-4]|1{0,1}[0-9]){0,1}[0-9])|([0-9a-fA-F]{1,4}:){1,4}:((25[0-5]|(2[0-4]|1{0,1}[0-9]){0,1}[0-9])\.){3,3}(25[0-5]|(2[0-4]|1{0,1}[0-9]){0,1}[0-9]))\/(12[0-8]|1[01][0-9]|[1-9]?[0-9])$/, Wi = /^([0-9a-zA-Z+/]{4})*(([0-9a-zA-Z+/]{2}==)|([0-9a-zA-Z+/]{3}=))?$/, qi = /^([0-9a-zA-Z-_]{4})*(([0-9a-zA-Z-_]{2}(==)?)|([0-9a-zA-Z-_]{3}(=)?))?$/, Rr = "((\\d\\d[2468][048]|\\d\\d[13579][26]|\\d\\d0[48]|[02468][048]00|[13579][26]00)-02-29|\\d{4}-((0[13578]|1[02])-(0[1-9]|[12]\\d|3[01])|(0[469]|11)-(0[1-9]|[12]\\d|30)|(02)-(0[1-9]|1\\d|2[0-8])))", Ki = new RegExp(`^${Rr}$`);
+function Nr(e) {
   let t = "[0-5]\\d";
   e.precision ? t = `${t}\\.\\d{${e.precision}}` : e.precision == null && (t = `${t}(\\.\\d+)?`);
   const n = e.precision ? "+" : "?";
   return `([01]\\d|2[0-3]):[0-5]\\d(:${t})${n}`;
 }
-function Ji(e) {
-  return new RegExp(`^${Cr(e)}$`);
+function Gi(e) {
+  return new RegExp(`^${Nr(e)}$`);
 }
-function Qi(e) {
-  let t = `${Or}T${Cr(e)}`;
+function Xi(e) {
+  let t = `${Rr}T${Nr(e)}`;
   const n = [];
   return n.push(e.local ? "Z?" : "Z"), e.offset && n.push("([+-]\\d{2}:?\\d{2})"), t = `${t}(${n.join("|")})`, new RegExp(`^${t}$`);
 }
-function es(e, t) {
-  return !!((t === "v4" || !t) && Hi.test(e) || (t === "v6" || !t) && qi.test(e));
+function Yi(e, t) {
+  return !!((t === "v4" || !t) && Pi.test(e) || (t === "v6" || !t) && Vi.test(e));
 }
-function ts(e, t) {
-  if (!Ui.test(e))
+function Ji(e, t) {
+  if (!$i.test(e))
     return !1;
   try {
     const [n] = e.split(".");
@@ -1510,8 +1519,8 @@ function ts(e, t) {
     return !1;
   }
 }
-function ns(e, t) {
-  return !!((t === "v4" || !t) && Wi.test(e) || (t === "v6" || !t) && Ki.test(e));
+function Qi(e, t) {
+  return !!((t === "v4" || !t) && Bi.test(e) || (t === "v6" || !t) && Hi.test(e));
 }
 class oe extends k {
   _parse(t) {
@@ -1523,7 +1532,7 @@ class oe extends k {
         received: i.parsedType
       }), m;
     }
-    const r = new j();
+    const r = new M();
     let a;
     for (const i of this._def.checks)
       if (i.kind === "min")
@@ -1562,43 +1571,43 @@ class oe extends k {
           message: i.message
         }), r.dirty());
       } else if (i.kind === "email")
-        Bi.test(t.data) || (a = this._getOrReturnCtx(t, a), f(a, {
+        Mi.test(t.data) || (a = this._getOrReturnCtx(t, a), f(a, {
           validation: "email",
           code: u.invalid_string,
           message: i.message
         }), r.dirty());
       else if (i.kind === "emoji")
-        Mt || (Mt = new RegExp(Vi, "u")), Mt.test(t.data) || (a = this._getOrReturnCtx(t, a), f(a, {
+        Ut || (Ut = new RegExp(Ui, "u")), Ut.test(t.data) || (a = this._getOrReturnCtx(t, a), f(a, {
           validation: "emoji",
           code: u.invalid_string,
           message: i.message
         }), r.dirty());
       else if (i.kind === "uuid")
-        ji.test(t.data) || (a = this._getOrReturnCtx(t, a), f(a, {
+        Li.test(t.data) || (a = this._getOrReturnCtx(t, a), f(a, {
           validation: "uuid",
           code: u.invalid_string,
           message: i.message
         }), r.dirty());
       else if (i.kind === "nanoid")
-        Mi.test(t.data) || (a = this._getOrReturnCtx(t, a), f(a, {
+        Fi.test(t.data) || (a = this._getOrReturnCtx(t, a), f(a, {
           validation: "nanoid",
           code: u.invalid_string,
           message: i.message
         }), r.dirty());
       else if (i.kind === "cuid")
-        Di.test(t.data) || (a = this._getOrReturnCtx(t, a), f(a, {
+        Zi.test(t.data) || (a = this._getOrReturnCtx(t, a), f(a, {
           validation: "cuid",
           code: u.invalid_string,
           message: i.message
         }), r.dirty());
       else if (i.kind === "cuid2")
-        $i.test(t.data) || (a = this._getOrReturnCtx(t, a), f(a, {
+        zi.test(t.data) || (a = this._getOrReturnCtx(t, a), f(a, {
           validation: "cuid2",
           code: u.invalid_string,
           message: i.message
         }), r.dirty());
       else if (i.kind === "ulid")
-        Fi.test(t.data) || (a = this._getOrReturnCtx(t, a), f(a, {
+        Di.test(t.data) || (a = this._getOrReturnCtx(t, a), f(a, {
           validation: "ulid",
           code: u.invalid_string,
           message: i.message
@@ -1629,43 +1638,43 @@ class oe extends k {
         code: u.invalid_string,
         validation: { endsWith: i.value },
         message: i.message
-      }), r.dirty()) : i.kind === "datetime" ? Qi(i).test(t.data) || (a = this._getOrReturnCtx(t, a), f(a, {
+      }), r.dirty()) : i.kind === "datetime" ? Xi(i).test(t.data) || (a = this._getOrReturnCtx(t, a), f(a, {
         code: u.invalid_string,
         validation: "datetime",
         message: i.message
-      }), r.dirty()) : i.kind === "date" ? Yi.test(t.data) || (a = this._getOrReturnCtx(t, a), f(a, {
+      }), r.dirty()) : i.kind === "date" ? Ki.test(t.data) || (a = this._getOrReturnCtx(t, a), f(a, {
         code: u.invalid_string,
         validation: "date",
         message: i.message
-      }), r.dirty()) : i.kind === "time" ? Ji(i).test(t.data) || (a = this._getOrReturnCtx(t, a), f(a, {
+      }), r.dirty()) : i.kind === "time" ? Gi(i).test(t.data) || (a = this._getOrReturnCtx(t, a), f(a, {
         code: u.invalid_string,
         validation: "time",
         message: i.message
-      }), r.dirty()) : i.kind === "duration" ? Pi.test(t.data) || (a = this._getOrReturnCtx(t, a), f(a, {
+      }), r.dirty()) : i.kind === "duration" ? ji.test(t.data) || (a = this._getOrReturnCtx(t, a), f(a, {
         validation: "duration",
         code: u.invalid_string,
         message: i.message
-      }), r.dirty()) : i.kind === "ip" ? es(t.data, i.version) || (a = this._getOrReturnCtx(t, a), f(a, {
+      }), r.dirty()) : i.kind === "ip" ? Yi(t.data, i.version) || (a = this._getOrReturnCtx(t, a), f(a, {
         validation: "ip",
         code: u.invalid_string,
         message: i.message
-      }), r.dirty()) : i.kind === "jwt" ? ts(t.data, i.alg) || (a = this._getOrReturnCtx(t, a), f(a, {
+      }), r.dirty()) : i.kind === "jwt" ? Ji(t.data, i.alg) || (a = this._getOrReturnCtx(t, a), f(a, {
         validation: "jwt",
         code: u.invalid_string,
         message: i.message
-      }), r.dirty()) : i.kind === "cidr" ? ns(t.data, i.version) || (a = this._getOrReturnCtx(t, a), f(a, {
+      }), r.dirty()) : i.kind === "cidr" ? Qi(t.data, i.version) || (a = this._getOrReturnCtx(t, a), f(a, {
         validation: "cidr",
         code: u.invalid_string,
         message: i.message
-      }), r.dirty()) : i.kind === "base64" ? Gi.test(t.data) || (a = this._getOrReturnCtx(t, a), f(a, {
+      }), r.dirty()) : i.kind === "base64" ? Wi.test(t.data) || (a = this._getOrReturnCtx(t, a), f(a, {
         validation: "base64",
         code: u.invalid_string,
         message: i.message
-      }), r.dirty()) : i.kind === "base64url" ? Xi.test(t.data) || (a = this._getOrReturnCtx(t, a), f(a, {
+      }), r.dirty()) : i.kind === "base64url" ? qi.test(t.data) || (a = this._getOrReturnCtx(t, a), f(a, {
         validation: "base64url",
         code: u.invalid_string,
         message: i.message
-      }), r.dirty()) : A.assertNever(i);
+      }), r.dirty()) : E.assertNever(i);
     return { status: r.value, value: t.data };
   }
   _regex(t, n, r) {
@@ -1884,7 +1893,7 @@ oe.create = (e) => {
     coerce: (t = e == null ? void 0 : e.coerce) != null ? t : !1
   }, b(e)));
 };
-function rs(e, t) {
+function es(e, t) {
   const n = (e.toString().split(".")[1] || "").length, r = (t.toString().split(".")[1] || "").length, a = n > r ? n : r, i = Number.parseInt(e.toFixed(a).replace(".", "")), s = Number.parseInt(t.toFixed(a).replace(".", ""));
   return i % s / wn(10, a);
 }
@@ -1902,9 +1911,9 @@ class Ze extends k {
       }), m;
     }
     let r;
-    const a = new j();
+    const a = new M();
     for (const i of this._def.checks)
-      i.kind === "int" ? A.isInteger(t.data) || (r = this._getOrReturnCtx(t, r), f(r, {
+      i.kind === "int" ? E.isInteger(t.data) || (r = this._getOrReturnCtx(t, r), f(r, {
         code: u.invalid_type,
         expected: "integer",
         received: "float",
@@ -1923,14 +1932,14 @@ class Ze extends k {
         inclusive: i.inclusive,
         exact: !1,
         message: i.message
-      }), a.dirty()) : i.kind === "multipleOf" ? rs(t.data, i.value) !== 0 && (r = this._getOrReturnCtx(t, r), f(r, {
+      }), a.dirty()) : i.kind === "multipleOf" ? es(t.data, i.value) !== 0 && (r = this._getOrReturnCtx(t, r), f(r, {
         code: u.not_multiple_of,
         multipleOf: i.value,
         message: i.message
       }), a.dirty()) : i.kind === "finite" ? Number.isFinite(t.data) || (r = this._getOrReturnCtx(t, r), f(r, {
         code: u.not_finite,
         message: i.message
-      }), a.dirty()) : A.assertNever(i);
+      }), a.dirty()) : E.assertNever(i);
     return { status: a.value, value: t.data };
   }
   gte(t, n) {
@@ -2040,7 +2049,7 @@ class Ze extends k {
     return t;
   }
   get isInt() {
-    return !!this._def.checks.find((t) => t.kind === "int" || t.kind === "multipleOf" && A.isInteger(t.value));
+    return !!this._def.checks.find((t) => t.kind === "int" || t.kind === "multipleOf" && E.isInteger(t.value));
   }
   get isFinite() {
     let t = null, n = null;
@@ -2057,7 +2066,7 @@ Ze.create = (e) => new Ze(d({
   typeName: g.ZodNumber,
   coerce: (e == null ? void 0 : e.coerce) || !1
 }, b(e)));
-class tt extends k {
+class nt extends k {
   constructor() {
     super(...arguments), this.min = this.gte, this.max = this.lte;
   }
@@ -2071,7 +2080,7 @@ class tt extends k {
     if (this._getType(t) !== _.bigint)
       return this._getInvalidInput(t);
     let r;
-    const a = new j();
+    const a = new M();
     for (const i of this._def.checks)
       i.kind === "min" ? (i.inclusive ? t.data < i.value : t.data <= i.value) && (r = this._getOrReturnCtx(t, r), f(r, {
         code: u.too_small,
@@ -2089,7 +2098,7 @@ class tt extends k {
         code: u.not_multiple_of,
         multipleOf: i.value,
         message: i.message
-      }), a.dirty()) : A.assertNever(i);
+      }), a.dirty()) : E.assertNever(i);
     return { status: a.value, value: t.data };
   }
   _getInvalidInput(t) {
@@ -2113,7 +2122,7 @@ class tt extends k {
     return this.setLimit("max", t, !1, p.toString(n));
   }
   setLimit(t, n, r, a) {
-    return new tt(v(d({}, this._def), {
+    return new nt(v(d({}, this._def), {
       checks: [
         ...this._def.checks,
         {
@@ -2126,7 +2135,7 @@ class tt extends k {
     }));
   }
   _addCheck(t) {
-    return new tt(v(d({}, this._def), {
+    return new nt(v(d({}, this._def), {
       checks: [...this._def.checks, t]
     }));
   }
@@ -2182,15 +2191,15 @@ class tt extends k {
     return t;
   }
 }
-tt.create = (e) => {
+nt.create = (e) => {
   var t;
-  return new tt(d({
+  return new nt(d({
     checks: [],
     typeName: g.ZodBigInt,
     coerce: (t = e == null ? void 0 : e.coerce) != null ? t : !1
   }, b(e)));
 };
-class Jt extends k {
+class Qt extends k {
   _parse(t) {
     if (this._def.coerce && (t.data = !!t.data), this._getType(t) !== _.boolean) {
       const r = this._getOrReturnCtx(t);
@@ -2200,14 +2209,14 @@ class Jt extends k {
         received: r.parsedType
       }), m;
     }
-    return K(t.data);
+    return G(t.data);
   }
 }
-Jt.create = (e) => new Jt(d({
+Qt.create = (e) => new Qt(d({
   typeName: g.ZodBoolean,
   coerce: (e == null ? void 0 : e.coerce) || !1
 }, b(e)));
-class St extends k {
+class Tt extends k {
   _parse(t) {
     if (this._def.coerce && (t.data = new Date(t.data)), this._getType(t) !== _.date) {
       const i = this._getOrReturnCtx(t);
@@ -2223,7 +2232,7 @@ class St extends k {
         code: u.invalid_date
       }), m;
     }
-    const r = new j();
+    const r = new M();
     let a;
     for (const i of this._def.checks)
       i.kind === "min" ? t.data.getTime() < i.value && (a = this._getOrReturnCtx(t, a), f(a, {
@@ -2240,14 +2249,14 @@ class St extends k {
         exact: !1,
         maximum: i.value,
         type: "date"
-      }), r.dirty()) : A.assertNever(i);
+      }), r.dirty()) : E.assertNever(i);
     return {
       status: r.value,
       value: new Date(t.data.getTime())
     };
   }
   _addCheck(t) {
-    return new St(v(d({}, this._def), {
+    return new Tt(v(d({}, this._def), {
       checks: [...this._def.checks, t]
     }));
   }
@@ -2278,12 +2287,12 @@ class St extends k {
     return t != null ? new Date(t) : null;
   }
 }
-St.create = (e) => new St(d({
+Tt.create = (e) => new Tt(d({
   checks: [],
   coerce: (e == null ? void 0 : e.coerce) || !1,
   typeName: g.ZodDate
 }, b(e)));
-class Ln extends k {
+class $n extends k {
   _parse(t) {
     if (this._getType(t) !== _.symbol) {
       const r = this._getOrReturnCtx(t);
@@ -2293,13 +2302,13 @@ class Ln extends k {
         received: r.parsedType
       }), m;
     }
-    return K(t.data);
+    return G(t.data);
   }
 }
-Ln.create = (e) => new Ln(d({
+$n.create = (e) => new $n(d({
   typeName: g.ZodSymbol
 }, b(e)));
-class Dn extends k {
+class jn extends k {
   _parse(t) {
     if (this._getType(t) !== _.undefined) {
       const r = this._getOrReturnCtx(t);
@@ -2309,13 +2318,13 @@ class Dn extends k {
         received: r.parsedType
       }), m;
     }
-    return K(t.data);
+    return G(t.data);
   }
 }
-Dn.create = (e) => new Dn(d({
+jn.create = (e) => new jn(d({
   typeName: g.ZodUndefined
 }, b(e)));
-class $n extends k {
+class Mn extends k {
   _parse(t) {
     if (this._getType(t) !== _.null) {
       const r = this._getOrReturnCtx(t);
@@ -2325,32 +2334,32 @@ class $n extends k {
         received: r.parsedType
       }), m;
     }
-    return K(t.data);
+    return G(t.data);
   }
 }
-$n.create = (e) => new $n(d({
+Mn.create = (e) => new Mn(d({
   typeName: g.ZodNull
 }, b(e)));
-class Fn extends k {
+class Un extends k {
   constructor() {
     super(...arguments), this._any = !0;
   }
   _parse(t) {
-    return K(t.data);
+    return G(t.data);
   }
 }
-Fn.create = (e) => new Fn(d({
+Un.create = (e) => new Un(d({
   typeName: g.ZodAny
 }, b(e)));
-class Qt extends k {
+class en extends k {
   constructor() {
     super(...arguments), this._unknown = !0;
   }
   _parse(t) {
-    return K(t.data);
+    return G(t.data);
   }
 }
-Qt.create = (e) => new Qt(d({
+en.create = (e) => new en(d({
   typeName: g.ZodUnknown
 }, b(e)));
 class ye extends k {
@@ -2366,7 +2375,7 @@ class ye extends k {
 ye.create = (e) => new ye(d({
   typeName: g.ZodNever
 }, b(e)));
-class jn extends k {
+class Pn extends k {
   _parse(t) {
     if (this._getType(t) !== _.undefined) {
       const r = this._getOrReturnCtx(t);
@@ -2376,10 +2385,10 @@ class jn extends k {
         received: r.parsedType
       }), m;
     }
-    return K(t.data);
+    return G(t.data);
   }
 }
-jn.create = (e) => new jn(d({
+Pn.create = (e) => new Pn(d({
   typeName: g.ZodVoid
 }, b(e)));
 class ne extends k {
@@ -2418,9 +2427,9 @@ class ne extends k {
       exact: !1,
       message: a.maxLength.message
     }), r.dirty()), n.common.async)
-      return Promise.all([...n.data].map((s, o) => a.type._parseAsync(new re(n, s, n.path, o)))).then((s) => j.mergeArray(r, s));
+      return Promise.all([...n.data].map((s, o) => a.type._parseAsync(new re(n, s, n.path, o)))).then((s) => M.mergeArray(r, s));
     const i = [...n.data].map((s, o) => a.type._parseSync(new re(n, s, n.path, o)));
-    return j.mergeArray(r, i);
+    return M.mergeArray(r, i);
   }
   get element() {
     return this._def.type;
@@ -2451,28 +2460,28 @@ ne.create = (e, t) => new ne(d({
   exactLength: null,
   typeName: g.ZodArray
 }, b(t)));
-function Ee(e) {
-  if (e instanceof N) {
+function Ae(e) {
+  if (e instanceof I) {
     const t = {};
     for (const n in e.shape) {
       const r = e.shape[n];
-      t[n] = me.create(Ee(r));
+      t[n] = me.create(Ae(r));
     }
-    return new N(v(d({}, e._def), {
+    return new I(v(d({}, e._def), {
       shape: () => t
     }));
   } else return e instanceof ne ? new ne(v(d({}, e._def), {
-    type: Ee(e.element)
-  })) : e instanceof me ? me.create(Ee(e.unwrap())) : e instanceof De ? De.create(Ee(e.unwrap())) : e instanceof Te ? Te.create(e.items.map((t) => Ee(t))) : e;
+    type: Ae(e.element)
+  })) : e instanceof me ? me.create(Ae(e.unwrap())) : e instanceof Le ? Le.create(Ae(e.unwrap())) : e instanceof Te ? Te.create(e.items.map((t) => Ae(t))) : e;
 }
-class N extends k {
+class I extends k {
   constructor() {
     super(...arguments), this._cached = null, this.nonstrict = this.passthrough, this.augment = this.extend;
   }
   _getCached() {
     if (this._cached !== null)
       return this._cached;
-    const t = this._def.shape(), n = A.objectKeys(t);
+    const t = this._def.shape(), n = E.objectKeys(t);
     return this._cached = { shape: t, keys: n }, this._cached;
   }
   _parse(t) {
@@ -2536,13 +2545,13 @@ class N extends k {
         });
       }
       return l;
-    })).then((l) => j.mergeObjectSync(r, l)) : j.mergeObjectSync(r, c);
+    })).then((l) => M.mergeObjectSync(r, l)) : M.mergeObjectSync(r, c);
   }
   get shape() {
     return this._def.shape();
   }
   strict(t) {
-    return p.errToObj, new N(d(v(d({}, this._def), {
+    return p.errToObj, new I(d(v(d({}, this._def), {
       unknownKeys: "strict"
     }), t !== void 0 ? {
       errorMap: (n, r) => {
@@ -2557,12 +2566,12 @@ class N extends k {
     } : {}));
   }
   strip() {
-    return new N(v(d({}, this._def), {
+    return new I(v(d({}, this._def), {
       unknownKeys: "strip"
     }));
   }
   passthrough() {
-    return new N(v(d({}, this._def), {
+    return new I(v(d({}, this._def), {
       unknownKeys: "passthrough"
     }));
   }
@@ -2584,7 +2593,7 @@ class N extends k {
   //     }) as any;
   //   };
   extend(t) {
-    return new N(v(d({}, this._def), {
+    return new I(v(d({}, this._def), {
       shape: () => d(d({}, this._def.shape()), t)
     }));
   }
@@ -2594,7 +2603,7 @@ class N extends k {
    * upgrade if you are experiencing issues.
    */
   merge(t) {
-    return new N({
+    return new I({
       unknownKeys: t._def.unknownKeys,
       catchall: t._def.catchall,
       shape: () => d(d({}, this._def.shape()), t._def.shape()),
@@ -2661,23 +2670,23 @@ class N extends k {
   //   return merged;
   // }
   catchall(t) {
-    return new N(v(d({}, this._def), {
+    return new I(v(d({}, this._def), {
       catchall: t
     }));
   }
   pick(t) {
     const n = {};
-    for (const r of A.objectKeys(t))
+    for (const r of E.objectKeys(t))
       t[r] && this.shape[r] && (n[r] = this.shape[r]);
-    return new N(v(d({}, this._def), {
+    return new I(v(d({}, this._def), {
       shape: () => n
     }));
   }
   omit(t) {
     const n = {};
-    for (const r of A.objectKeys(this.shape))
+    for (const r of E.objectKeys(this.shape))
       t[r] || (n[r] = this.shape[r]);
-    return new N(v(d({}, this._def), {
+    return new I(v(d({}, this._def), {
       shape: () => n
     }));
   }
@@ -2685,21 +2694,21 @@ class N extends k {
    * @deprecated
    */
   deepPartial() {
-    return Ee(this);
+    return Ae(this);
   }
   partial(t) {
     const n = {};
-    for (const r of A.objectKeys(this.shape)) {
+    for (const r of E.objectKeys(this.shape)) {
       const a = this.shape[r];
       t && !t[r] ? n[r] = a : n[r] = a.optional();
     }
-    return new N(v(d({}, this._def), {
+    return new I(v(d({}, this._def), {
       shape: () => n
     }));
   }
   required(t) {
     const n = {};
-    for (const r of A.objectKeys(this.shape))
+    for (const r of E.objectKeys(this.shape))
       if (t && !t[r])
         n[r] = this.shape[r];
       else {
@@ -2708,33 +2717,33 @@ class N extends k {
           i = i._def.innerType;
         n[r] = i;
       }
-    return new N(v(d({}, this._def), {
+    return new I(v(d({}, this._def), {
       shape: () => n
     }));
   }
   keyof() {
-    return Rr(A.objectKeys(this.shape));
+    return Ir(E.objectKeys(this.shape));
   }
 }
-N.create = (e, t) => new N(d({
+I.create = (e, t) => new I(d({
   shape: () => e,
   unknownKeys: "strip",
   catchall: ye.create(),
   typeName: g.ZodObject
 }, b(t)));
-N.strictCreate = (e, t) => new N(d({
+I.strictCreate = (e, t) => new I(d({
   shape: () => e,
   unknownKeys: "strict",
   catchall: ye.create(),
   typeName: g.ZodObject
 }, b(t)));
-N.lazycreate = (e, t) => new N(d({
+I.lazycreate = (e, t) => new I(d({
   shape: e,
   unknownKeys: "strip",
   catchall: ye.create(),
   typeName: g.ZodObject
 }, b(t)));
-class Tt extends k {
+class Et extends k {
   _parse(t) {
     const { ctx: n } = this._processInputParams(t), r = this._def.options;
     function a(i) {
@@ -2798,18 +2807,18 @@ class Tt extends k {
     return this._def.options;
   }
 }
-Tt.create = (e, t) => new Tt(d({
+Et.create = (e, t) => new Et(d({
   options: e,
   typeName: g.ZodUnion
 }, b(t)));
-function en(e, t) {
+function tn(e, t) {
   const n = ue(e), r = ue(t);
   if (e === t)
     return { valid: !0, data: e };
   if (n === _.object && r === _.object) {
-    const a = A.objectKeys(t), i = A.objectKeys(e).filter((o) => a.indexOf(o) !== -1), s = d(d({}, e), t);
+    const a = E.objectKeys(t), i = E.objectKeys(e).filter((o) => a.indexOf(o) !== -1), s = d(d({}, e), t);
     for (const o of i) {
-      const c = en(e[o], t[o]);
+      const c = tn(e[o], t[o]);
       if (!c.valid)
         return { valid: !1 };
       s[o] = c.data;
@@ -2820,7 +2829,7 @@ function en(e, t) {
       return { valid: !1 };
     const a = [];
     for (let i = 0; i < e.length; i++) {
-      const s = e[i], o = t[i], c = en(s, o);
+      const s = e[i], o = t[i], c = tn(s, o);
       if (!c.valid)
         return { valid: !1 };
       a.push(c.data);
@@ -2831,10 +2840,10 @@ function en(e, t) {
 class At extends k {
   _parse(t) {
     const { status: n, ctx: r } = this._processInputParams(t), a = (i, s) => {
-      if (Nn(i) || Nn(s))
+      if (Dn(i) || Dn(s))
         return m;
-      const o = en(i.value, s.value);
-      return o.valid ? ((Zn(i) || Zn(s)) && n.dirty(), { status: n.value, value: o.data }) : (f(r, {
+      const o = tn(i.value, s.value);
+      return o.valid ? ((Ln(i) || Ln(s)) && n.dirty(), { status: n.value, value: o.data }) : (f(r, {
         code: u.invalid_intersection_types
       }), m);
     };
@@ -2893,7 +2902,7 @@ class Te extends k {
       const c = this._def.items[o] || this._def.rest;
       return c ? c._parse(new re(r, s, r.path, o)) : null;
     }).filter((s) => !!s);
-    return r.common.async ? Promise.all(i).then((s) => j.mergeArray(n, s)) : j.mergeArray(n, i);
+    return r.common.async ? Promise.all(i).then((s) => M.mergeArray(n, s)) : M.mergeArray(n, i);
   }
   get items() {
     return this._def.items;
@@ -2913,7 +2922,7 @@ Te.create = (e, t) => {
     rest: null
   }, b(t)));
 };
-class Et extends k {
+class Ot extends k {
   get keySchema() {
     return this._def.keyType;
   }
@@ -2935,24 +2944,24 @@ class Et extends k {
         value: s._parse(new re(r, r.data[o], r.path, o)),
         alwaysSet: o in r.data
       });
-    return r.common.async ? j.mergeObjectAsync(n, a) : j.mergeObjectSync(n, a);
+    return r.common.async ? M.mergeObjectAsync(n, a) : M.mergeObjectSync(n, a);
   }
   get element() {
     return this._def.valueType;
   }
   static create(t, n, r) {
-    return n instanceof k ? new Et(d({
+    return n instanceof k ? new Ot(d({
       keyType: t,
       valueType: n,
       typeName: g.ZodRecord
-    }, b(r))) : new Et(d({
+    }, b(r))) : new Ot(d({
       keyType: oe.create(),
       valueType: t,
       typeName: g.ZodRecord
     }, b(n)));
   }
 }
-class Mn extends k {
+class Bn extends k {
   get keySchema() {
     return this._def.keyType;
   }
@@ -2994,12 +3003,12 @@ class Mn extends k {
     }
   }
 }
-Mn.create = (e, t, n) => new Mn(d({
+Bn.create = (e, t, n) => new Bn(d({
   valueType: t,
   keyType: e,
   typeName: g.ZodMap
 }, b(n)));
-class nt extends k {
+class rt extends k {
   _parse(t) {
     const { status: n, ctx: r } = this._processInputParams(t);
     if (r.parsedType !== _.set)
@@ -3038,12 +3047,12 @@ class nt extends k {
     return r.common.async ? Promise.all(o).then((c) => s(c)) : s(o);
   }
   min(t, n) {
-    return new nt(v(d({}, this._def), {
+    return new rt(v(d({}, this._def), {
       minSize: { value: t, message: p.toString(n) }
     }));
   }
   max(t, n) {
-    return new nt(v(d({}, this._def), {
+    return new rt(v(d({}, this._def), {
       maxSize: { value: t, message: p.toString(n) }
     }));
   }
@@ -3054,13 +3063,13 @@ class nt extends k {
     return this.min(1, t);
   }
 }
-nt.create = (e, t) => new nt(d({
+rt.create = (e, t) => new rt(d({
   valueType: e,
   minSize: null,
   maxSize: null,
   typeName: g.ZodSet
 }, b(t)));
-class Un extends k {
+class Vn extends k {
   get schema() {
     return this._def.getter();
   }
@@ -3069,11 +3078,11 @@ class Un extends k {
     return this._def.getter()._parse({ data: n.data, path: n.path, parent: n });
   }
 }
-Un.create = (e, t) => new Un(d({
+Vn.create = (e, t) => new Vn(d({
   getter: e,
   typeName: g.ZodLazy
 }, b(t)));
-class tn extends k {
+class nn extends k {
   _parse(t) {
     if (t.data !== this._def.value) {
       const n = this._getOrReturnCtx(t);
@@ -3089,11 +3098,11 @@ class tn extends k {
     return this._def.value;
   }
 }
-tn.create = (e, t) => new tn(d({
+nn.create = (e, t) => new nn(d({
   value: e,
   typeName: g.ZodLiteral
 }, b(t)));
-function Rr(e, t) {
+function Ir(e, t) {
   return new ze(d({
     values: e,
     typeName: g.ZodEnum
@@ -3104,7 +3113,7 @@ class ze extends k {
     if (typeof t.data != "string") {
       const n = this._getOrReturnCtx(t), r = this._def.values;
       return f(n, {
-        expected: A.joinValues(r),
+        expected: E.joinValues(r),
         received: n.parsedType,
         code: u.invalid_type
       }), m;
@@ -3117,7 +3126,7 @@ class ze extends k {
         options: r
       }), m;
     }
-    return K(t.data);
+    return G(t.data);
   }
   get options() {
     return this._def.values;
@@ -3147,37 +3156,37 @@ class ze extends k {
     return ze.create(this.options.filter((r) => !t.includes(r)), d(d({}, this._def), n));
   }
 }
-ze.create = Rr;
-class Pn extends k {
+ze.create = Ir;
+class Hn extends k {
   _parse(t) {
-    const n = A.getValidEnumValues(this._def.values), r = this._getOrReturnCtx(t);
+    const n = E.getValidEnumValues(this._def.values), r = this._getOrReturnCtx(t);
     if (r.parsedType !== _.string && r.parsedType !== _.number) {
-      const a = A.objectValues(n);
+      const a = E.objectValues(n);
       return f(r, {
-        expected: A.joinValues(a),
+        expected: E.joinValues(a),
         received: r.parsedType,
         code: u.invalid_type
       }), m;
     }
-    if (this._cache || (this._cache = new Set(A.getValidEnumValues(this._def.values))), !this._cache.has(t.data)) {
-      const a = A.objectValues(n);
+    if (this._cache || (this._cache = new Set(E.getValidEnumValues(this._def.values))), !this._cache.has(t.data)) {
+      const a = E.objectValues(n);
       return f(r, {
         received: r.data,
         code: u.invalid_enum_value,
         options: a
       }), m;
     }
-    return K(t.data);
+    return G(t.data);
   }
   get enum() {
     return this._def.values;
   }
 }
-Pn.create = (e, t) => new Pn(d({
+Hn.create = (e, t) => new Hn(d({
   values: e,
   typeName: g.ZodNativeEnum
 }, b(t)));
-class Ot extends k {
+class Ct extends k {
   unwrap() {
     return this._def.type;
   }
@@ -3190,17 +3199,17 @@ class Ot extends k {
         received: n.parsedType
       }), m;
     const r = n.parsedType === _.promise ? n.data : Promise.resolve(n.data);
-    return K(r.then((a) => this._def.type.parseAsync(a, {
+    return G(r.then((a) => this._def.type.parseAsync(a, {
       path: n.path,
       errorMap: n.common.contextualErrorMap
     })));
   }
 }
-Ot.create = (e, t) => new Ot(d({
+Ct.create = (e, t) => new Ct(d({
   type: e,
   typeName: g.ZodPromise
 }, b(t)));
-class Le extends k {
+class De extends k {
   innerType() {
     return this._def.schema;
   }
@@ -3266,33 +3275,33 @@ class Le extends k {
           path: r.path,
           parent: r
         });
-        if (!Ne(s))
+        if (!Ie(s))
           return m;
         const o = a.transform(s.value, i);
         if (o instanceof Promise)
           throw new Error("Asynchronous transform encountered during synchronous parse operation. Use .parseAsync instead.");
         return { status: n.value, value: o };
       } else
-        return this._def.schema._parseAsync({ data: r.data, path: r.path, parent: r }).then((s) => Ne(s) ? Promise.resolve(a.transform(s.value, i)).then((o) => ({
+        return this._def.schema._parseAsync({ data: r.data, path: r.path, parent: r }).then((s) => Ie(s) ? Promise.resolve(a.transform(s.value, i)).then((o) => ({
           status: n.value,
           value: o
         })) : m);
-    A.assertNever(a);
+    E.assertNever(a);
   }
 }
-Le.create = (e, t, n) => new Le(d({
+De.create = (e, t, n) => new De(d({
   schema: e,
   typeName: g.ZodEffects,
   effect: t
 }, b(n)));
-Le.createWithPreprocess = (e, t, n) => new Le(d({
+De.createWithPreprocess = (e, t, n) => new De(d({
   schema: t,
   effect: { type: "preprocess", transform: e },
   typeName: g.ZodEffects
 }, b(n)));
 class me extends k {
   _parse(t) {
-    return this._getType(t) === _.undefined ? K(void 0) : this._def.innerType._parse(t);
+    return this._getType(t) === _.undefined ? G(void 0) : this._def.innerType._parse(t);
   }
   unwrap() {
     return this._def.innerType;
@@ -3302,19 +3311,19 @@ me.create = (e, t) => new me(d({
   innerType: e,
   typeName: g.ZodOptional
 }, b(t)));
-class De extends k {
+class Le extends k {
   _parse(t) {
-    return this._getType(t) === _.null ? K(null) : this._def.innerType._parse(t);
+    return this._getType(t) === _.null ? G(null) : this._def.innerType._parse(t);
   }
   unwrap() {
     return this._def.innerType;
   }
 }
-De.create = (e, t) => new De(d({
+Le.create = (e, t) => new Le(d({
   innerType: e,
   typeName: g.ZodNullable
 }, b(t)));
-class nn extends k {
+class rn extends k {
   _parse(t) {
     const { ctx: n } = this._processInputParams(t);
     let r = n.data;
@@ -3328,12 +3337,12 @@ class nn extends k {
     return this._def.innerType;
   }
 }
-nn.create = (e, t) => new nn(d({
+rn.create = (e, t) => new rn(d({
   innerType: e,
   typeName: g.ZodDefault,
   defaultValue: typeof t.default == "function" ? t.default : () => t.default
 }, b(t)));
-class rn extends k {
+class an extends k {
   _parse(t) {
     const { ctx: n } = this._processInputParams(t), r = v(d({}, n), {
       common: v(d({}, n.common), {
@@ -3344,7 +3353,7 @@ class rn extends k {
       path: r.path,
       parent: d({}, r)
     });
-    return kt(a) ? a.then((i) => ({
+    return St(a) ? a.then((i) => ({
       status: "valid",
       value: i.status === "valid" ? i.value : this._def.catchValue({
         get error() {
@@ -3366,12 +3375,12 @@ class rn extends k {
     return this._def.innerType;
   }
 }
-rn.create = (e, t) => new rn(d({
+an.create = (e, t) => new an(d({
   innerType: e,
   typeName: g.ZodCatch,
   catchValue: typeof t.catch == "function" ? t.catch : () => t.catch
 }, b(t)));
-class Bn extends k {
+class Wn extends k {
   _parse(t) {
     if (this._getType(t) !== _.nan) {
       const r = this._getOrReturnCtx(t);
@@ -3384,10 +3393,10 @@ class Bn extends k {
     return { status: "valid", value: t.data };
   }
 }
-Bn.create = (e) => new Bn(d({
+Wn.create = (e) => new Wn(d({
   typeName: g.ZodNaN
 }, b(e)));
-class as extends k {
+class ts extends k {
   _parse(t) {
     const { ctx: n } = this._processInputParams(t), r = n.data;
     return this._def.type._parse({
@@ -3440,16 +3449,16 @@ class gn extends k {
     });
   }
 }
-class an extends k {
+class sn extends k {
   _parse(t) {
-    const n = this._def.innerType._parse(t), r = (a) => (Ne(a) && (a.value = Object.freeze(a.value)), a);
-    return kt(n) ? n.then((a) => r(a)) : r(n);
+    const n = this._def.innerType._parse(t), r = (a) => (Ie(a) && (a.value = Object.freeze(a.value)), a);
+    return St(n) ? n.then((a) => r(a)) : r(n);
   }
   unwrap() {
     return this._def.innerType;
   }
 }
-an.create = (e, t) => new an(d({
+sn.create = (e, t) => new sn(d({
   innerType: e,
   typeName: g.ZodReadonly
 }, b(t)));
@@ -3457,75 +3466,75 @@ var g;
 (function(e) {
   e.ZodString = "ZodString", e.ZodNumber = "ZodNumber", e.ZodNaN = "ZodNaN", e.ZodBigInt = "ZodBigInt", e.ZodBoolean = "ZodBoolean", e.ZodDate = "ZodDate", e.ZodSymbol = "ZodSymbol", e.ZodUndefined = "ZodUndefined", e.ZodNull = "ZodNull", e.ZodAny = "ZodAny", e.ZodUnknown = "ZodUnknown", e.ZodNever = "ZodNever", e.ZodVoid = "ZodVoid", e.ZodArray = "ZodArray", e.ZodObject = "ZodObject", e.ZodUnion = "ZodUnion", e.ZodDiscriminatedUnion = "ZodDiscriminatedUnion", e.ZodIntersection = "ZodIntersection", e.ZodTuple = "ZodTuple", e.ZodRecord = "ZodRecord", e.ZodMap = "ZodMap", e.ZodSet = "ZodSet", e.ZodFunction = "ZodFunction", e.ZodLazy = "ZodLazy", e.ZodLiteral = "ZodLiteral", e.ZodEnum = "ZodEnum", e.ZodEffects = "ZodEffects", e.ZodNativeEnum = "ZodNativeEnum", e.ZodOptional = "ZodOptional", e.ZodNullable = "ZodNullable", e.ZodDefault = "ZodDefault", e.ZodCatch = "ZodCatch", e.ZodPromise = "ZodPromise", e.ZodBranded = "ZodBranded", e.ZodPipeline = "ZodPipeline", e.ZodReadonly = "ZodReadonly";
 })(g || (g = {}));
-const _t = oe.create, is = Ze.create, G = Jt.create, ss = Qt.create;
+const pt = oe.create, ns = Ze.create, X = Qt.create, rs = en.create;
 ye.create;
-const Vn = ne.create, pt = N.create, os = Tt.create;
+const qn = ne.create, gt = I.create, as = Et.create;
 At.create;
 Te.create;
-const ls = Et.create, Hn = tn.create, gt = ze.create;
-Ot.create;
+const is = Ot.create, Kn = nn.create, mt = ze.create;
+Ct.create;
 me.create;
-De.create;
-const cs = pt({
-  language: gt(["typescript", "javascript"]).optional(),
-  disableMarkedForExport: G().optional(),
-  allowAutoSelectFirstNode: G().optional().default(!0),
-  enableDisplayDataId: G().optional(),
-  enableDisplayDataName: G().optional()
+Le.create;
+const ss = gt({
+  language: mt(["typescript", "javascript"]).optional(),
+  disableMarkedForExport: X().optional(),
+  allowAutoSelectFirstNode: X().optional().default(!0),
+  enableDisplayDataId: X().optional(),
+  enableDisplayDataName: X().optional()
 }).and(
-  os([
-    pt({
-      framework: Hn("react"),
-      model: _t().optional(),
-      styling: gt(["plain_css", "tailwind", "inline_styles"]),
-      uiLibrary: gt(["mui", "antd", "radix", "shadcn", "clean_react"]).optional(),
-      responsivePages: Vn(
-        pt({
-          name: _t(),
-          framesId: Vn(_t())
+  as([
+    gt({
+      framework: Kn("react"),
+      model: pt().optional(),
+      styling: mt(["plain_css", "tailwind", "inline_styles"]),
+      uiLibrary: mt(["mui", "antd", "radix", "shadcn", "clean_react"]).optional(),
+      responsivePages: qn(
+        gt({
+          name: pt(),
+          framesId: qn(pt())
         })
       ).optional(),
-      enableUILibraryTheming: G().optional(),
-      enableCompactStructure: G().optional(),
-      enableDisplayScreenModelId: G().optional(),
-      enableGeneratePackageLock: G().optional(),
-      enableAnimationsPreset: G().optional(),
-      enableAutoSplit: G().optional(),
-      autoSplitThreshold: is().optional(),
-      url: _t().url().optional(),
-      codegenSettings: ls(ss()).optional()
+      enableUILibraryTheming: X().optional(),
+      enableCompactStructure: X().optional(),
+      enableDisplayScreenModelId: X().optional(),
+      enableGeneratePackageLock: X().optional(),
+      enableAnimationsPreset: X().optional(),
+      enableAutoSplit: X().optional(),
+      autoSplitThreshold: ns().optional(),
+      url: pt().url().optional(),
+      codegenSettings: is(rs()).optional()
     }),
-    pt({
-      framework: Hn("html"),
-      styling: gt(["plain_css", "inline_styles", "tailwind"]),
-      enableTranslation: G().optional()
+    gt({
+      framework: Kn("html"),
+      styling: mt(["plain_css", "inline_styles", "tailwind"]),
+      enableTranslation: X().optional()
     })
   ])
-), ds = (e) => {
-  const t = cs.safeParse(e);
+), os = (e) => {
+  const t = ss.safeParse(e);
   if (t.success === !1) {
     const n = new Error("Invalid codegen settings");
     throw n.cause = t.error, n;
   }
   return t.data;
-}, Gs = (e) => Oi(e) ? "NotFound" : Ri(e) ? "RateLimitExceeded" : Ai(e) ? "FigmaTokenIssue" : Ni(e) ? "RequestTooLarge" : "UnknownFigmaApiException", Ir = (e, t) => {
+}, Zr = (e, t) => {
   if (e.id === t)
     return e;
   if ("children" in e)
     for (const n of e.children) {
-      const r = Ir(n, t);
+      const r = Zr(n, t);
       if (r)
         return r;
     }
   return null;
-}, Wn = /* @__PURE__ */ new Set([
+}, Gn = /* @__PURE__ */ new Set([
   "FRAME",
   "INSTANCE",
   "COMPONENT",
   "COMPONENT_SET",
   "GROUP"
-]), us = (e, t, n = { allowAutoSelectFirstNode: !0 }) => {
-  const r = Ir(e.document, t);
+]), ls = (e, t, n = { allowAutoSelectFirstNode: !0 }) => {
+  const r = Zr(e.document, t);
   if (!r)
     return {
       isValid: !1,
@@ -3533,7 +3542,7 @@ const cs = pt({
     };
   if (r.type === "CANVAS") {
     const a = r.children.filter(
-      (i) => Wn.has(i.type)
+      (i) => Gn.has(i.type)
     );
     return a.length === 0 ? {
       isValid: !1,
@@ -3551,20 +3560,20 @@ const cs = pt({
       reason: "Selected node is a page with multiple children"
     };
   }
-  return Wn.has(r.type) ? { isValid: !0, node: r } : {
+  return Gn.has(r.type) ? { isValid: !0, node: r } : {
     isValid: !1,
     reason: "Selected node type is not supported"
   };
 };
-function fs(e) {
+function cs(e) {
   return e && e.__esModule && Object.prototype.hasOwnProperty.call(e, "default") ? e.default : e;
 }
-var yt = { exports: {} }, hs = yt.exports, qn;
-function _s() {
-  return qn || (qn = 1, (function(e, t) {
+var vt = { exports: {} }, ds = vt.exports, Xn;
+function us() {
+  return Xn || (Xn = 1, (function(e, t) {
     (function(n, r) {
       e.exports = r();
-    })(hs, (function() {
+    })(ds, (function() {
       var n = typeof Promise == "function", r = (function(R) {
         if (typeof globalThis == "object")
           return globalThis;
@@ -3574,13 +3583,13 @@ function _s() {
           },
           configurable: !0
         });
-        var D = typeDetectGlobalObject;
-        return delete R.typeDetectGlobalObject, D;
-      })(Object.prototype), a = typeof Symbol != "undefined", i = typeof Map != "undefined", s = typeof Set != "undefined", o = typeof WeakMap != "undefined", c = typeof WeakSet != "undefined", l = typeof DataView != "undefined", h = a && typeof Symbol.iterator != "undefined", S = a && typeof Symbol.toStringTag != "undefined", y = s && typeof Set.prototype.entries == "function", I = i && typeof Map.prototype.entries == "function", Z = y && Object.getPrototypeOf((/* @__PURE__ */ new Set()).entries()), U = I && Object.getPrototypeOf((/* @__PURE__ */ new Map()).entries()), Ue = h && typeof Array.prototype[Symbol.iterator] == "function", lt = Ue && Object.getPrototypeOf([][Symbol.iterator]()), Pe = h && typeof String.prototype[Symbol.iterator] == "function", ct = Pe && Object.getPrototypeOf(""[Symbol.iterator]()), dt = 8, ut = -1;
-      function ft(R) {
-        var D = typeof R;
-        if (D !== "object")
-          return D;
+        var L = typeDetectGlobalObject;
+        return delete R.typeDetectGlobalObject, L;
+      })(Object.prototype), a = typeof Symbol != "undefined", i = typeof Map != "undefined", s = typeof Set != "undefined", o = typeof WeakMap != "undefined", c = typeof WeakSet != "undefined", l = typeof DataView != "undefined", h = a && typeof Symbol.iterator != "undefined", S = a && typeof Symbol.toStringTag != "undefined", y = s && typeof Set.prototype.entries == "function", N = i && typeof Map.prototype.entries == "function", Z = y && Object.getPrototypeOf((/* @__PURE__ */ new Set()).entries()), B = N && Object.getPrototypeOf((/* @__PURE__ */ new Map()).entries()), Ue = h && typeof Array.prototype[Symbol.iterator] == "function", ct = Ue && Object.getPrototypeOf([][Symbol.iterator]()), Pe = h && typeof String.prototype[Symbol.iterator] == "function", dt = Pe && Object.getPrototypeOf(""[Symbol.iterator]()), ut = 8, ft = -1;
+      function ht(R) {
+        var L = typeof R;
+        if (L !== "object")
+          return L;
         if (R === null)
           return "null";
         if (R === r)
@@ -3611,14 +3620,14 @@ function _s() {
         if (typeof ve == "string")
           return ve;
         var z = Object.getPrototypeOf(R);
-        return z === RegExp.prototype ? "RegExp" : z === Date.prototype ? "Date" : n && z === Promise.prototype ? "Promise" : s && z === Set.prototype ? "Set" : i && z === Map.prototype ? "Map" : c && z === WeakSet.prototype ? "WeakSet" : o && z === WeakMap.prototype ? "WeakMap" : l && z === DataView.prototype ? "DataView" : i && z === U ? "Map Iterator" : s && z === Z ? "Set Iterator" : Ue && z === lt ? "Array Iterator" : Pe && z === ct ? "String Iterator" : z === null ? "Object" : Object.prototype.toString.call(R).slice(dt, ut);
+        return z === RegExp.prototype ? "RegExp" : z === Date.prototype ? "Date" : n && z === Promise.prototype ? "Promise" : s && z === Set.prototype ? "Set" : i && z === Map.prototype ? "Map" : c && z === WeakSet.prototype ? "WeakSet" : o && z === WeakMap.prototype ? "WeakMap" : l && z === DataView.prototype ? "DataView" : i && z === B ? "Map Iterator" : s && z === Z ? "Set Iterator" : Ue && z === ct ? "Array Iterator" : Pe && z === dt ? "String Iterator" : z === null ? "Object" : Object.prototype.toString.call(R).slice(ut, ft);
       }
-      return ft;
+      return ht;
     }));
-  })(yt)), yt.exports;
+  })(vt)), vt.exports;
 }
-var ps = _s();
-const gs = /* @__PURE__ */ fs(ps), mn = typeof Buffer != "undefined", ms = mn && typeof Buffer.from != "undefined", ys = mn ? (
+var fs = us();
+const hs = /* @__PURE__ */ cs(fs), mn = typeof Buffer != "undefined", _s = mn && typeof Buffer.from != "undefined", ps = mn ? (
   /**
    * is value is Buffer?
    *
@@ -3639,7 +3648,7 @@ const gs = /* @__PURE__ */ fs(ps), mn = typeof Buffer != "undefined", ms = mn &&
   function() {
     return !1;
   }
-), vs = ms ? (
+), gs = _s ? (
   /**
    * copy Buffer
    *
@@ -3674,18 +3683,18 @@ const gs = /* @__PURE__ */ fs(ps), mn = typeof Buffer != "undefined", ms = mn &&
     return t;
   }
 );
-function $e(e) {
-  return ys(e) ? "Buffer" : gs(e);
+function Fe(e) {
+  return ps(e) ? "Buffer" : hs(e);
 }
-const bs = /* @__PURE__ */ new Set([
+const ms = /* @__PURE__ */ new Set([
   "Arguments",
   "Array",
   "Map",
   "Object",
   "Set"
 ]);
-function ws(e, t, n = null) {
-  switch (n || $e(e)) {
+function ys(e, t, n = null) {
+  switch (n || Fe(e)) {
     case "Arguments":
     case "Array":
     case "Object":
@@ -3696,11 +3705,11 @@ function ws(e, t, n = null) {
       return t;
   }
 }
-function sn(e) {
-  return bs.has(e);
+function on(e) {
+  return ms.has(e);
 }
-function Kn(e, t, n, r = null) {
-  switch (r || $e(e)) {
+function Yn(e, t, n, r = null) {
+  switch (r || Fe(e)) {
     case "Arguments":
     case "Array":
     case "Object":
@@ -3715,59 +3724,59 @@ function Kn(e, t, n, r = null) {
   }
   return e;
 }
-const xs = typeof globalThis != "undefined" && globalThis !== null && globalThis.Object === Object && globalThis, ks = typeof global != "undefined" && global !== null && global.Object === Object && global, Ss = typeof self != "undefined" && self !== null && self.Object === Object && self, Ut = xs || ks || Ss || Function("return this")();
-function Ts(e) {
+const vs = typeof globalThis != "undefined" && globalThis !== null && globalThis.Object === Object && globalThis, bs = typeof global != "undefined" && global !== null && global.Object === Object && global, ws = typeof self != "undefined" && self !== null && self.Object === Object && self, Pt = vs || bs || ws || Function("return this")();
+function xs(e) {
   return e.slice(0);
 }
-function As(e) {
+function ks(e) {
   return new Boolean(e.valueOf());
 }
-function Es(e) {
+function Ss(e) {
   return new DataView(e.buffer);
 }
-function Os(e) {
-  return vs(e);
+function Ts(e) {
+  return gs(e);
 }
-function Cs(e) {
+function Es(e) {
   return new Date(e.getTime());
 }
-function Rs(e) {
+function As(e) {
   return new Number(e);
 }
-function Is(e) {
+function Os(e) {
   return new RegExp(e.source, e.flags);
 }
-function Ns(e) {
+function Cs(e) {
   return new String(e);
 }
 function ae(e, t) {
-  return Ut[t].from ? Ut[t].from(e) : new Ut[t](e);
+  return Pt[t].from ? Pt[t].from(e) : new Pt[t](e);
 }
 function $(e) {
   return e;
 }
-function Gn() {
+function Jn() {
   return [];
 }
-function Zs() {
+function Rs() {
   return /* @__PURE__ */ new Map();
 }
-function zs() {
+function Ns() {
   return {};
 }
-function Ls() {
+function Is() {
   return /* @__PURE__ */ new Set();
 }
-const Ds = /* @__PURE__ */ new Map([
+const Zs = /* @__PURE__ */ new Map([
   // deep copy
-  ["ArrayBuffer", Ts],
-  ["Boolean", As],
-  ["Buffer", Os],
-  ["DataView", Es],
-  ["Date", Cs],
-  ["Number", Rs],
-  ["RegExp", Is],
-  ["String", Ns],
+  ["ArrayBuffer", xs],
+  ["Boolean", ks],
+  ["Buffer", Ts],
+  ["DataView", Ss],
+  ["Date", Es],
+  ["Number", As],
+  ["RegExp", Os],
+  ["String", Cs],
   // typed arrays
   // TODO: pass bound function
   ["Float32Array", ae],
@@ -3799,11 +3808,11 @@ const Ds = /* @__PURE__ */ new Map([
   ["undefined", $],
   // collections
   // NOTE: return empty value, because recursively copy later.
-  ["Arguments", Gn],
-  ["Array", Gn],
-  ["Map", Zs],
-  ["Object", zs],
-  ["Set", Ls]
+  ["Arguments", Jn],
+  ["Array", Jn],
+  ["Map", Rs],
+  ["Object", Ns],
+  ["Set", Is]
   // NOTE: type-detect returns following types
   // 'Location'
   // 'Document'
@@ -3815,11 +3824,11 @@ const Ds = /* @__PURE__ */ new Map([
   // TODO: is type-detect never return 'object'?
   // 'object'
 ]);
-function $s() {
+function zs() {
 }
-function on(e, t = null, n = $s) {
+function ln(e, t = null, n = zs) {
   arguments.length === 2 && typeof t == "function" && (n = t, t = null);
-  const r = t || $e(e), a = Ds.get(r);
+  const r = t || Fe(e), a = Zs.get(r);
   if (r === "Object") {
     const i = n(e, r);
     if (i !== void 0)
@@ -3827,7 +3836,7 @@ function on(e, t = null, n = $s) {
   }
   return a ? a(e, r) : e;
 }
-function Xn(e, t = {}) {
+function Qn(e, t = {}) {
   typeof t == "function" && (t = {
     customizer: t
   });
@@ -3836,15 +3845,15 @@ function Xn(e, t = {}) {
     customizer: n
     // TODO: max depth
     // depth = Infinity,
-  } = t, r = $e(e);
-  if (!sn(r))
-    return ln(e, null, null, null);
-  const a = on(e, r, n), i = new WeakMap([[e, a]]), s = new WeakSet([e]);
-  return ln(e, a, i, s);
+  } = t, r = Fe(e);
+  if (!on(r))
+    return cn(e, null, null, null);
+  const a = ln(e, r, n), i = new WeakMap([[e, a]]), s = new WeakSet([e]);
+  return cn(e, a, i, s);
 }
-function ln(e, t, n, r, a) {
-  const i = $e(e), s = on(e, i);
-  if (!sn(i))
+function cn(e, t, n, r, a) {
+  const i = Fe(e), s = ln(e, i);
+  if (!on(i))
     return s;
   let o;
   switch (i) {
@@ -3861,15 +3870,15 @@ function ln(e, t, n, r, a) {
       break;
   }
   for (let c of o) {
-    const l = ws(e, c, i);
+    const l = ys(e, c, i);
     if (r.has(l))
-      Kn(t, c, n.get(l), i);
+      Yn(t, c, n.get(l), i);
     else {
-      const h = $e(l), S = on(l, h);
-      sn(h) && (n.set(l, S), r.add(l)), Kn(
+      const h = Fe(l), S = ln(l, h);
+      on(h) && (n.set(l, S), r.add(l)), Yn(
         t,
         c,
-        ln(
+        cn(
           l,
           S,
           n,
@@ -3881,36 +3890,39 @@ function ln(e, t, n, r, a) {
   }
   return t;
 }
-var rt, Ce, se, X, q, cn, dn, vt;
-class Fs {
+var at, Ce, se, q, P, dn, bt, qe;
+class Ds {
   constructor({
     fetch: t = globalThis.fetch.bind(globalThis),
     baseAddress: n = "https://api.figma.com/",
     defaultOptions: r = {}
   } = {}) {
-    Y(this, q);
-    Y(this, rt);
+    Y(this, P);
+    Y(this, at);
     Y(this, Ce);
     Y(this, se);
-    Y(this, X);
-    H(this, rt, n), H(this, Ce, t), H(this, X, r), H(this, se, w(this, X)), r.token && P(this, q, cn).call(this, r.token);
+    Y(this, q);
+    W(this, at, n), W(this, Ce, t), W(this, q, r), W(this, se, w(this, q)), r.token && F(this, P, dn).call(this, r.token);
+  }
+  hasDefaultToken() {
+    return !!w(this, q).token;
   }
   updateDefaultOptions(t) {
-    t.token && P(this, q, cn).call(this, t.token), H(this, X, d(d({}, w(this, X)), t)), H(this, se, w(this, X));
+    t.token && F(this, P, dn).call(this, t.token), W(this, q, d(d({}, w(this, q)), t)), W(this, se, w(this, q));
   }
   withOptions(t) {
-    return H(this, se, d(d(d({}, w(this, X)), w(this, se)), t)), this;
+    return W(this, se, d(d(d({}, w(this, q)), w(this, se)), t)), this;
   }
   getHeaders(t) {
     const n = {
       "Content-Type": "application/json"
-    }, r = t != null ? t : w(this, X).token;
+    }, r = t != null ? t : w(this, q).token;
     if (r != null && r.startsWith("figd_"))
       n["X-FIGMA-TOKEN"] = r;
     else if (r != null && r.startsWith("figu_"))
       n.Authorization = `Bearer ${r}`;
     else
-      throw new Si();
+      throw new Ei();
     return n;
   }
   getFile(a) {
@@ -3925,7 +3937,7 @@ class Fs {
       });
       n.length > 0 && i.append("ids", n.join(",")), r && i.append("depth", `${r}`);
       const s = i.toString(), o = `v1/files/${t}?${s}`;
-      return yield P(this, q, vt).call(this, o);
+      return yield F(this, P, qe).call(this, o);
     });
   }
   getNodeImages(s) {
@@ -3936,20 +3948,20 @@ class Fs {
       as: a = "arrayBuffer",
       format: i = "jpg"
     }) {
-      const c = (yield P(this, q, vt).call(this, `v1/images/${t}?ids=${n}&format=${i}&scale=${r}`)).images;
+      const c = (yield F(this, P, qe).call(this, `v1/images/${t}?ids=${n}&format=${i}&scale=${r}`)).images;
       if (a === "links")
         return c;
       const l = n.map((y) => O(this, null, function* () {
-        const I = c[y];
-        if (!I)
+        const N = c[y];
+        if (!N)
           return null;
-        const Z = yield w(this, Ce).call(this, I);
+        const Z = yield w(this, Ce).call(this, N);
         return Z.ok ? yield Z.arrayBuffer() : null;
       })), h = yield Promise.allSettled(l);
       return n.reduce(
-        (y, I, Z) => {
-          const U = h[Z];
-          return U.status === "fulfilled" ? y[I] = U.value : y[I] = null, y;
+        (y, N, Z) => {
+          const B = h[Z];
+          return B.status === "fulfilled" ? y[N] = B.value : y[N] = null, y;
         },
         {}
       );
@@ -3961,14 +3973,19 @@ class Fs {
     }) {
       var i, s;
       const r = `v1/files/${t}/images`;
-      return (s = (i = (yield P(this, q, vt).call(this, r)).meta) == null ? void 0 : i.images) != null ? s : {};
+      return (s = (i = (yield F(this, P, qe).call(this, r)).meta) == null ? void 0 : i.images) != null ? s : {};
+    });
+  }
+  getMe() {
+    return O(this, null, function* () {
+      return yield F(this, P, qe).call(this, "v1/me");
     });
   }
 }
-rt = new WeakMap(), Ce = new WeakMap(), se = new WeakMap(), X = new WeakMap(), q = new WeakSet(), cn = function(t) {
+at = new WeakMap(), Ce = new WeakMap(), se = new WeakMap(), q = new WeakMap(), P = new WeakSet(), dn = function(t) {
   if (!t.startsWith("figd_") && !t.startsWith("figu_"))
-    throw new ki();
-}, dn = function(t, n) {
+    throw new Ti();
+}, bt = function(t, n) {
   return O(this, null, function* () {
     var a;
     const r = yield n();
@@ -3980,15 +3997,13 @@ rt = new WeakMap(), Ce = new WeakMap(), se = new WeakMap(), X = new WeakMap(), q
       } catch (o) {
       }
       if (i === 403)
-        throw new Ti({
-          cause: r
-        });
+        throw s != null && s.includes("Invalid token") ? new Rn() : s != null && s.includes("Token expired") ? new Nn() : new In({ reason: s });
       if (i === 404)
-        throw new Ei({ cause: r });
+        throw new Ai({ cause: r });
       if (i === 429) {
         const o = r.headers.get("Retry-After"), c = o ? Number(o) : null;
         if (!c)
-          throw new Rn({
+          throw new Zn({
             cause: r
           });
         if (yield (a = t.onRateLimited) == null ? void 0 : a.call(t, {
@@ -4001,57 +4016,66 @@ rt = new WeakMap(), Ce = new WeakMap(), se = new WeakMap(), X = new WeakMap(), q
           )
         }))
           return new Promise((h, S) => {
-            var I;
+            var N;
             const y = setTimeout(
               () => {
                 var Z;
-                (Z = t.abortSignal) != null && Z.aborted || P(this, q, dn).call(this, t, n).then(h).catch(S);
+                (Z = t.abortSignal) != null && Z.aborted || F(this, P, bt).call(this, t, n).then(h).catch(S);
               },
               c * 1e3 + 1e3
             );
-            (I = t.abortSignal) == null || I.addEventListener("abort", () => {
+            (N = t.abortSignal) == null || N.addEventListener("abort", () => {
               clearTimeout(y), S(new Error("The operation was aborted."));
             });
           });
-        throw new Rn({ cause: r });
-      } else throw i === 500 && (s != null && s.includes("Request too large")) ? new Ii({ cause: r }) : new Ci({
+        throw new Zn({ cause: r });
+      } else throw i === 500 && (s != null && s.includes("Request too large")) ? new Ci({ cause: r }) : new Oi({
         cause: r
       });
     }
     return r;
   });
-}, vt = function(t) {
+}, qe = function(t) {
   return O(this, null, function* () {
-    const n = Xn(w(this, se));
-    H(this, se, Xn(w(this, X)));
+    const n = Qn(w(this, se));
+    W(this, se, Qn(w(this, q)));
     const r = () => O(this, null, function* () {
-      return yield w(this, Ce).call(this, `${w(this, rt)}${t}`, {
+      return yield w(this, Ce).call(this, `${w(this, at)}${t}`, {
         method: "GET",
         headers: this.getHeaders(n.token),
         signal: n.abortSignal
       });
     });
-    return yield (yield P(this, q, dn).call(this, n, r)).json();
+    try {
+      return yield (yield F(this, P, bt).call(this, n, r)).json();
+    } catch (a) {
+      if (n.onForbidden && (a instanceof Rn || a instanceof Nn || a instanceof In)) {
+        const i = yield n.onForbidden(a);
+        if (i)
+          return n.token = i.retry.newToken, yield (yield F(this, P, bt).call(this, n, r)).json();
+      }
+      throw a;
+    }
   });
 };
-var C, at, it, le, Nr, qe;
-class Xs {
+var C, it, st, le, zr, Ke;
+class Gs {
   constructor({
     auth: t,
     apiBaseAddress: n = "https://public-api.animaapp.com",
-    figmaRestApi: r = new Fs()
+    figmaRestApi: r = new Ds()
   } = {}) {
     Y(this, le);
     Y(this, C);
-    Y(this, at);
     Y(this, it);
-    H(this, at, n), H(this, it, r), t && (this.auth = t);
+    Y(this, st);
+    W(this, it, n), W(this, st, r), t && (this.auth = t);
   }
   hasAuth() {
     return !!w(this, C);
   }
   set auth(t) {
-    H(this, C, t);
+    W(this, C, t);
   }
   get headers() {
     const t = {
@@ -4064,15 +4088,15 @@ class Xs {
       var l;
       let i;
       try {
-        i = yield w(this, it).withOptions({ token: t.figmaToken, abortSignal: r }).getFile({
+        i = yield w(this, st).withOptions({ token: t.figmaToken, abortSignal: r }).getFile({
           fileKey: t.fileKey
         });
       } catch (h) {
         if (h instanceof Error && h.name === "AbortError")
           throw h;
       }
-      const s = ds(t.settings);
-      i && (yield P(this, le, Nr).call(this, i, t.nodesId, {
+      const s = os(t.settings);
+      i && (yield F(this, le, zr).call(this, i, t.nodesId, {
         allowAutoSelectFirstNode: (l = s.allowAutoSelectFirstNode) != null ? l : !0
       }));
       let o = t.tracking;
@@ -4104,9 +4128,11 @@ class Xs {
         codegenSettings: s.codegenSettings,
         webhookUrl: t.webhookUrl,
         prompt: t.prompt,
-        images: t.images
+        images: t.images,
+        // @ts-expect-error: We don't need to expose this parameter to GetCodeParams
+        createSession: t.createSession
       };
-      return P(this, le, qe).call(this, "/v1/codegen", c, n, "codegen", r);
+      return F(this, le, Ke).call(this, "/v1/codegen", c, n, "codegen", r);
     });
   }
   generateCodeFromWebsite(a) {
@@ -4114,7 +4140,13 @@ class Xs {
       let i = t.tracking;
       w(this, C) && "userId" in w(this, C) && w(this, C).userId && (i != null && i.externalId || (i = { externalId: w(this, C).userId }));
       let s;
-      if (t.mhtml)
+      if (t.mhtmlUrl)
+        s = {
+          type: "hosted-mhtml",
+          mhtmlUrl: t.mhtmlUrl,
+          url: t.url
+        };
+      else if (t.mhtml)
         s = {
           type: "mhtml",
           mhtml: t.mhtml,
@@ -4126,7 +4158,7 @@ class Xs {
           url: t.url
         };
       else
-        throw new Error("Either 'url' or 'mhtml' must be provided");
+        throw new Error("Either 'url', 'mhtml' or 'mhtmlUrl' must be provided");
       let o;
       t.experimental_useNewReactEngine && (o = "react-v2");
       const c = {
@@ -4147,7 +4179,7 @@ class Xs {
           engine: o
         }
       };
-      return P(this, le, qe).call(this, "/v1/l2c", c, n, "l2c", r);
+      return F(this, le, Ke).call(this, "/v1/l2c", c, n, "l2c", r);
     });
   }
   /**
@@ -4202,7 +4234,7 @@ class Xs {
         }, (o = t.settings.codegenSettings) != null ? o : {}),
         webhookUrl: t.webhookUrl
       };
-      return P(this, le, qe).call(this, "/v1/p2c", s, n, "p2c", r);
+      return F(this, le, Ke).call(this, "/v1/p2c", s, n, "p2c", r);
     });
   }
   /**
@@ -4217,14 +4249,14 @@ class Xs {
         assetsStorage: t.assetsStorage,
         params: t.params
       };
-      return P(this, le, qe).call(this, "/v1/l2c", s, n, "l2c", r);
+      return F(this, le, Ke).call(this, "/v1/l2c", s, n, "l2c", r);
     });
   }
 }
-C = new WeakMap(), at = new WeakMap(), it = new WeakMap(), le = new WeakSet(), Nr = function(t, n, r) {
+C = new WeakMap(), it = new WeakMap(), st = new WeakMap(), le = new WeakSet(), zr = function(t, n, r) {
   return O(this, null, function* () {
     const i = n.map(
-      (s) => us(t, s, r)
+      (s) => ls(t, s, r)
     ).find(
       (s) => !s.isValid
     );
@@ -4234,12 +4266,12 @@ C = new WeakMap(), at = new WeakMap(), it = new WeakMap(), le = new WeakSet(), N
         reason: i.reason
       });
   });
-}, qe = function(t, n, r, a, i) {
+}, Ke = function(t, n, r, a, i) {
   return O(this, null, function* () {
-    var y, I, Z, U, Ue, lt, Pe, ct, dt, ut, ft;
+    var y, N, Z, B, Ue, ct, Pe, dt, ut, ft, ht;
     if (this.hasAuth() === !1)
       throw new Error('It needs to set "auth" before calling this method.');
-    const s = {}, o = xi(JSON.stringify(n)), c = yield fetch(`${w(this, at)}${t}`, {
+    const s = {}, o = Si(JSON.stringify(n)), c = yield fetch(`${w(this, it)}${t}`, {
       method: "POST",
       headers: v(d({}, this.headers), {
         Accept: "text/event-stream",
@@ -4251,21 +4283,21 @@ C = new WeakMap(), at = new WeakMap(), it = new WeakMap(), le = new WeakSet(), N
     });
     if (!c.ok) {
       const R = yield c.text();
-      let D;
+      let L;
       try {
-        D = JSON.parse(R);
+        L = JSON.parse(R);
       } catch (ve) {
       }
-      throw ((y = D == null ? void 0 : D.error) == null ? void 0 : y.name) === "ZodError" ? (console.log(
+      throw ((y = L == null ? void 0 : L.error) == null ? void 0 : y.name) === "ZodError" ? (console.log(
         "Zod validation error:",
-        JSON.stringify(D.error.issues, null, 2)
+        JSON.stringify(L.error.issues, null, 2)
       ), new be({
         name: "HTTP error from Anima API",
         reason: "Invalid body payload",
-        detail: D.error.issues,
+        detail: L.error.issues,
         status: c.status
-      })) : typeof D == "object" ? new be({
-        name: `Error "${D}"`,
+      })) : typeof L == "object" ? new be({
+        name: `Error "${L}"`,
         reason: "Unknown",
         status: c.status
       }) : new be({
@@ -4284,10 +4316,10 @@ C = new WeakMap(), at = new WeakMap(), it = new WeakMap(), le = new WeakSet(), N
     let S = "";
     try {
       for (; ; ) {
-        const { done: R, value: D } = yield l.read();
+        const { done: R, value: L } = yield l.read();
         if (R)
           break;
-        S += h.decode(D, { stream: !0 });
+        S += h.decode(L, { stream: !0 });
         const ve = S.split(`
 `);
         S = ve.pop() || "";
@@ -4296,12 +4328,12 @@ C = new WeakMap(), at = new WeakMap(), it = new WeakMap(), le = new WeakSet(), N
             let T;
             try {
               T = JSON.parse(z.slice(6));
-            } catch (Ws) {
+            } catch (Bs) {
               continue;
             }
             switch (T.type) {
               case "queueing": {
-                typeof r == "function" ? r(T) : (I = r.onQueueing) == null || I.call(r, {
+                typeof r == "function" ? r(T) : (N = r.onQueueing) == null || N.call(r, {
                   sessionId: T.sessionId
                 });
                 break;
@@ -4311,7 +4343,7 @@ C = new WeakMap(), at = new WeakMap(), it = new WeakMap(), le = new WeakSet(), N
                 break;
               }
               case "pre_codegen": {
-                a === "codegen" && (typeof r == "function" ? r(T) : (U = r.onPreCodegen) == null || U.call(r, {
+                a === "codegen" && (typeof r == "function" ? r(T) : (B = r.onPreCodegen) == null || B.call(r, {
                   message: T.message
                 }));
                 break;
@@ -4321,7 +4353,7 @@ C = new WeakMap(), at = new WeakMap(), it = new WeakMap(), le = new WeakSet(), N
                 break;
               }
               case "assets_list": {
-                s.assets = T.payload.assets, typeof r == "function" ? r(T) : (lt = r.onAssetsList) == null || lt.call(r, T.payload);
+                s.assets = T.payload.assets, typeof r == "function" ? r(T) : (ct = r.onAssetsList) == null || ct.call(r, T.payload);
                 break;
               }
               case "figma_metadata": {
@@ -4332,7 +4364,7 @@ C = new WeakMap(), at = new WeakMap(), it = new WeakMap(), le = new WeakSet(), N
                 break;
               }
               case "generating_code": {
-                T.payload.status === "success" && (s.files = T.payload.files), typeof r == "function" ? r(T) : (ct = r.onGeneratingCode) == null || ct.call(r, {
+                T.payload.status === "success" && (s.files = T.payload.files), typeof r == "function" ? r(T) : (dt = r.onGeneratingCode) == null || dt.call(r, {
                   status: T.payload.status,
                   progress: T.payload.progress,
                   files: T.payload.files
@@ -4340,19 +4372,19 @@ C = new WeakMap(), at = new WeakMap(), it = new WeakMap(), le = new WeakSet(), N
                 break;
               }
               case "progress_messages_updated": {
-                typeof r == "function" ? r(T) : (dt = r.onProgressMessagesUpdated) == null || dt.call(
+                typeof r == "function" ? r(T) : (ut = r.onProgressMessagesUpdated) == null || ut.call(
                   r,
                   T.payload.progressMessages
                 );
                 break;
               }
               case "job_status_updated": {
-                typeof r == "function" ? r(T) : (ut = r.onJobStatusUpdated) == null || ut.call(r, T.payload.jobStatus);
+                typeof r == "function" ? r(T) : (ft = r.onJobStatusUpdated) == null || ft.call(r, T.payload.jobStatus);
                 break;
               }
               case "codegen_completed":
               case "generation_completed": {
-                typeof r == "function" ? r(T) : (ft = r.onCodegenCompleted) == null || ft.call(r);
+                typeof r == "function" ? r(T) : (ht = r.onCodegenCompleted) == null || ht.call(r);
                 break;
               }
               case "error":
@@ -4375,7 +4407,7 @@ C = new WeakMap(), at = new WeakMap(), it = new WeakMap(), le = new WeakSet(), N
     });
   });
 };
-const Ys = (e) => {
+const Xs = (e) => {
   var t;
   if (!e)
     return [!1, "", ""];
@@ -4391,7 +4423,7 @@ const Ys = (e) => {
   } catch (n) {
     return [!1, "", ""];
   }
-}, Js = ({
+}, Ys = ({
   fileKey: e,
   nodeId: t,
   duplicate: n
@@ -4399,12 +4431,12 @@ const Ys = (e) => {
   const r = new URL("https://www.figma.com");
   return r.pathname = `design/${e}`, n && (r.pathname = `${r.pathname}/dummy/duplicate`), t && r.searchParams.set("node-id", t.replace(":", "-")), r;
 };
-class Qs extends Error {
+class Js extends Error {
   constructor(t, n) {
     super(t), this.response = n;
   }
 }
-const eo = ({
+const Qs = ({
   files: e,
   screenPath: t = "src/screens"
 }) => {
@@ -4412,12 +4444,12 @@ const eo = ({
   function a(i) {
     if (r.has(i) || !e[i])
       return;
-    r.add(i), n[i] = e[i], js(e[i].content).forEach((o) => {
+    r.add(i), n[i] = e[i], Ls(e[i].content).forEach((o) => {
       try {
-        const c = Ms(i, o);
+        const c = Fs(i, o);
         if (c.startsWith("src/")) {
           const l = c.split("/").slice(0, -1).join("/");
-          Us(e, l).forEach((S) => {
+          $s(e, l).forEach((S) => {
             r.has(S) || a(S);
           });
         }
@@ -4433,7 +4465,7 @@ const eo = ({
     i.startsWith(t) ? a(i) : i.startsWith("src/") || (n[i] = s);
   }), n;
 };
-function js(e) {
+function Ls(e) {
   const t = /import.*?["']([^"']+)["']/g, n = /export.*from\s+["']([^"']+)["']/g, r = [];
   let a;
   for (; (a = t.exec(e)) !== null; )
@@ -4442,7 +4474,7 @@ function js(e) {
     r.push(a[1]);
   return [...new Set(r)];
 }
-function Ms(e, t) {
+function Fs(e, t) {
   if (!t.startsWith("."))
     return t;
   const n = e.split("/").slice(0, -1), r = t.split("/"), a = [...n];
@@ -4450,7 +4482,7 @@ function Ms(e, t) {
     i === ".." ? a.pop() : i !== "." && a.push(i);
   return a.join("/");
 }
-function Us(e, t) {
+function $s(e, t) {
   return Object.keys(e).filter((n) => n.startsWith(t));
 }
 function It(e, t, n) {
@@ -4481,8 +4513,8 @@ function It(e, t, n) {
     }
   });
 }
-const Ps = (e, t) => It(e, t, e.generateCode);
-function Nt(e) {
+const js = (e, t) => It(e, t, e.generateCode);
+function Zt(e) {
   return O(this, null, function* () {
     var s, o, c, l;
     const [t, n] = e.tee(), r = yield t.getReader().read();
@@ -4516,50 +4548,50 @@ data: ${JSON.stringify(
     });
   });
 }
-const to = (e, t) => O(null, null, function* () {
+const eo = (e, t) => O(null, null, function* () {
+  const n = js(e, t);
+  return Zt(n);
+}), Ms = (e, t) => It(e, t, e.generateCodeFromWebsite), to = (e, t) => O(null, null, function* () {
+  const n = Ms(e, t);
+  return Zt(n);
+}), Us = (e, t) => It(e, t, e.generateCodeFromPrompt), no = (e, t) => O(null, null, function* () {
+  const n = Us(e, t);
+  return Zt(n);
+}), Ps = (e, t) => It(e, t, e.generateLink2Code), ro = (e, t) => O(null, null, function* () {
   const n = Ps(e, t);
-  return Nt(n);
-}), Bs = (e, t) => It(e, t, e.generateCodeFromWebsite), no = (e, t) => O(null, null, function* () {
-  const n = Bs(e, t);
-  return Nt(n);
-}), Vs = (e, t) => It(e, t, e.generateCodeFromPrompt), ro = (e, t) => O(null, null, function* () {
-  const n = Vs(e, t);
-  return Nt(n);
-}), Hs = (e, t) => It(e, t, e.generateLink2Code), ao = (e, t) => O(null, null, function* () {
-  const n = Hs(e, t);
-  return Nt(n);
+  return Zt(n);
 });
 export {
-  Xs as Anima,
+  Gs as Anima,
   be as CodegenError,
-  Fs as FigmaRestApi,
-  Ti as FigmaTokenIssue,
-  ki as InvalidFigmaAccessTokenError,
-  Si as MissingFigmaToken,
-  Ei as NotFound,
-  Rn as RateLimitExceeded,
-  Ii as RequestTooLarge,
-  Qs as ResponseError,
-  Ci as UnknownFigmaApiException,
-  ro as createCodeFromPromptResponseEventStream,
-  Vs as createCodeFromPromptStream,
-  no as createCodeFromWebsiteResponseEventStream,
-  Bs as createCodeFromWebsiteStream,
-  to as createCodegenResponseEventStream,
-  Ps as createCodegenStream,
-  ao as createLink2CodeResponseEventStream,
-  Hs as createLink2CodeStream,
-  Ir as findChildrenNode,
-  Js as formatToFigmaLink,
-  Gs as getFigmaApiErrorType,
-  eo as getRelatedScreenFiles,
-  Ai as isFigmaTokenIssue,
-  us as isNodeCodegenCompatible,
-  Oi as isNotFound,
-  Ri as isRateLimitExceeded,
-  Ni as isRequestTooLarge,
-  Ks as isUnknownFigmaApiException,
-  Ys as isValidFigmaUrl,
-  ds as validateSettings
+  Nn as ExpiredFigmaToken,
+  Ds as FigmaRestApi,
+  Ti as MalformattedFigmaToken,
+  Ei as MissingFigmaToken,
+  Rn as NeedsReauthFigmaToken,
+  Ai as NotFound,
+  Zn as RateLimitExceeded,
+  Ci as RequestTooLarge,
+  Js as ResponseError,
+  Oi as UnknownFigmaApiException,
+  In as UnknownForbiddenFigmaError,
+  no as createCodeFromPromptResponseEventStream,
+  Us as createCodeFromPromptStream,
+  to as createCodeFromWebsiteResponseEventStream,
+  Ms as createCodeFromWebsiteStream,
+  eo as createCodegenResponseEventStream,
+  js as createCodegenStream,
+  ro as createLink2CodeResponseEventStream,
+  Ps as createLink2CodeStream,
+  Zr as findChildrenNode,
+  Ys as formatToFigmaLink,
+  Qs as getRelatedScreenFiles,
+  ls as isNodeCodegenCompatible,
+  Hs as isNotFound,
+  qs as isRateLimitExceeded,
+  Ks as isRequestTooLarge,
+  Ws as isUnknownFigmaApiException,
+  Xs as isValidFigmaUrl,
+  os as validateSettings
 };
 //# sourceMappingURL=index.js.map