npm - @animaapp/anima-sdk - Versions diffs - 0.9.0 → 0.11.0 - Mend

@animaapp/anima-sdk 0.9.0 → 0.11.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,17 +1,17 @@
-var Dr = Object.defineProperty, Lr = Object.defineProperties;
-var Fr = Object.getOwnPropertyDescriptors;
+var Lr = Object.defineProperty, Fr = Object.defineProperties;
+var $r = Object.getOwnPropertyDescriptors;
 var yn = Object.getOwnPropertySymbols;
-var $r = Object.prototype.hasOwnProperty, jr = Object.prototype.propertyIsEnumerable;
+var jr = Object.prototype.hasOwnProperty, Mr = Object.prototype.propertyIsEnumerable;
 var bn = (e) => {
   throw TypeError(e);
-}, 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) => {
+}, wn = Math.pow, vn = (e, t, n) => t in e ? Lr(e, t, { enumerable: !0, configurable: !0, writable: !0, value: n }) : e[t] = n, d = (e, t) => {
   for (var n in t || (t = {}))
-    $r.call(t, n) && vn(e, n, t[n]);
+    jr.call(t, n) && vn(e, n, t[n]);
   if (yn)
     for (var n of yn(t))
-      jr.call(t, n) && vn(e, n, t[n]);
+      Mr.call(t, n) && vn(e, n, t[n]);
   return e;
-}, v = (e, t) => Lr(e, Fr(t));
+}, v = (e, t) => Fr(e, $r(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) => {
@@ -36,22 +36,22 @@ function $e(e) {
   for (; --t >= 0; )
     e[t] = 0;
 }
-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 = (
+const Ur = 0, tr = 1, Pr = 2, Br = 3, Vr = 258, un = 29, ot = 256, Ye = ot + 1 + un, Oe = 30, fn = 19, nr = 2 * Ye + 1, we = 15, Dt = 16, Hr = 7, hn = 256, rr = 16, ar = 17, ir = 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])
 ), 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])
-), Hr = (
+), Wr = (
   /* 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])
-), 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);
+), sr = new Uint8Array([16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15]), qr = 512, ie = new Array((Ye + 2) * 2);
 $e(ie);
 const Ge = new Array(Oe * 2);
 $e(Ge);
-const Je = new Array(Wr);
+const Je = new Array(qr);
 $e(Je);
-const Qe = new Array(Br - Pr + 1);
+const Qe = new Array(Vr - Br + 1);
 $e(Qe);
 const _n = new Array(un);
 $e(_n);
@@ -60,11 +60,11 @@ $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 sr, or, lr;
+let or, lr, cr;
 function Ft(e, t) {
   this.dyn_tree = e, this.max_code = 0, this.stat_desc = t;
 }
-const cr = (e) => e < 256 ? Je[e] : Je[256 + (e >>> 7)], et = (e, t) => {
+const dr = (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;
 }, 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);
@@ -75,20 +75,20 @@ const cr = (e) => e < 256 ? Je[e] : Je[256 + (e >>> 7)], et = (e, t) => {
     n[t * 2 + 1]
     /*.Len*/
   );
-}, dr = (e, t) => {
+}, ur = (e, t) => {
   let n = 0;
   do
     n |= e & 1, e >>>= 1, n <<= 1;
   while (--t > 0);
   return n >>> 1;
-}, qr = (e) => {
+}, Kr = (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) => {
+}, Gr = (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, 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 < tr; l++)
+  for (n[e.heap[e.heap_max] * 2 + 1] = 0, l = e.heap_max + 1; l < nr; 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 {
@@ -100,16 +100,16 @@ const cr = (e) => e < 256 ? Je[e] : Je[256 + (e >>> 7)], et = (e, t) => {
       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--);
   }
-}, ur = (e, t, n) => {
+}, fr = (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] = dr(r[o]++, o));
+    o !== 0 && (e[s * 2] = ur(r[o]++, o));
   }
-}, Gr = () => {
+}, Xr = () => {
   let e, t, n, r, a;
   const i = new Array(we + 1);
   for (n = 0, r = 0; r < un - 1; r++)
@@ -131,10 +131,10 @@ const cr = (e) => e < 256 ? Je[e] : Je[256 + (e >>> 7)], et = (e, t) => {
     ie[e * 2 + 1] = 7, e++, i[7]++;
   for (; e <= 287; )
     ie[e * 2 + 1] = 8, e++, i[8]++;
-  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) => {
+  for (fr(ie, Ye + 1, i), e = 0; e < Oe; e++)
+    Ge[e * 2 + 1] = 5, Ge[e * 2] = ur(e, 5);
+  or = new Lt(ie, Bt, ot + 1, Ye, we), lr = new Lt(Ge, yt, 0, Oe, we), cr = new Lt(new Array(0), Wr, 0, fn, Hr);
+}, hr = (e) => {
   let t;
   for (t = 0; t < Ye; t++)
     e.dyn_ltree[t * 2] = 0;
@@ -143,7 +143,7 @@ const cr = (e) => e < 256 ? Je[e] : Je[256 + (e >>> 7)], et = (e, t) => {
   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;
-}, hr = (e) => {
+}, _r = (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;
@@ -158,13 +158,13 @@ const cr = (e) => e < 256 ? Je[e] : Je[256 + (e >>> 7)], et = (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 = 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)));
+      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 = dr(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);
 }, 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 = tr, s = 0; s < i; s++)
+  for (e.heap_len = 0, e.heap_max = nr, 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 cr = (e) => e < 256 ? Je[e] : Je[256 + (e >>> 7)], et = (e, t) => {
   e.heap[--e.heap_max] = e.heap[
     1
     /*SMALLEST*/
-  ], Kr(e, t), ur(n, c, e.bl_count);
+  ], Gr(e, t), fr(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[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));
+    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[rr * 2]++) : o <= 10 ? e.bl_tree[ar * 2]++ : e.bl_tree[ir * 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,20 +212,20 @@ const cr = (e) => e < 256 ? Je[e] : Je[256 + (e >>> 7)], et = (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, 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));
+      else i !== 0 ? (i !== a && (Q(e, i, e.bl_tree), o--), Q(e, rr, e.bl_tree), U(e, o - 3, 2)) : o <= 10 ? (Q(e, ar, e.bl_tree), U(e, o - 3, 3)) : (Q(e, ir, 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);
     }
-}, Xr = (e) => {
+}, Yr = (e) => {
   let 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--)
+  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[sr[t] * 2 + 1] === 0; t--)
     ;
   return e.opt_len += 3 * (t + 1) + 5 + 5 + 4, t;
-}, Yr = (e, t, n, r) => {
+}, Jr = (e, t, n, r) => {
   let a;
   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);
+    U(e, e.bl_tree[sr[a] * 2 + 1], 3);
   Tn(e, e.dyn_ltree, t - 1), Tn(e, e.dyn_dtree, n - 1);
-}, Jr = (e) => {
+}, Qr = (e) => {
   let t = 4093624447, n;
   for (n = 0; n <= 31; n++, t >>>= 1)
     if (t & 1 && e.dyn_ltree[n * 2] !== 0)
@@ -238,24 +238,24 @@ const cr = (e) => e < 256 ? Je[e] : Je[256 + (e >>> 7)], et = (e, t) => {
   return 0;
 };
 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) => {
+const ea = (e) => {
+  En || (Xr(), En = !0), e.l_desc = new Ft(e.dyn_ltree, or), e.d_desc = new Ft(e.dyn_dtree, lr), e.bl_desc = new Ft(e.bl_tree, cr), e.bi_buf = 0, e.bi_valid = 0, hr(e);
+}, pr = (e, t, n, r) => {
+  U(e, (Ur << 1) + (r ? 1 : 0), 3), _r(e), et(e, n), et(e, ~n), n && e.pending_buf.set(e.window.subarray(t, t + n), e.pending), e.pending += n;
+}, ta = (e) => {
+  U(e, tr << 1, 3), Q(e, hn, ie), Kr(e);
+}, na = (e, t, n, r) => {
   let a, i, s = 0;
-  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
+  e.level > 0 ? (e.strm.data_type === 2 && (e.strm.data_type = Qr(e)), Vt(e, e.l_desc), Vt(e, e.d_desc), s = Yr(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 ? pr(e, t, n, r) : e.strategy === 4 || i === a ? (U(e, (tr << 1) + (r ? 1 : 0), 3), kn(e, ie, Ge)) : (U(e, (Pr << 1) + (r ? 1 : 0), 3), Jr(e, e.l_desc.max_code + 1, e.d_desc.max_code + 1, s + 1), kn(e, e.dyn_ltree, e.dyn_dtree)), hr(e), r && _r(e);
+}, ra = (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[dr(t) * 2]++), e.sym_next === e.sym_end);
+var aa = ea, ia = pr, sa = na, oa = ra, la = ta, ca = {
+  _tr_init: aa,
+  _tr_stored_block: ia,
+  _tr_flush_block: sa,
+  _tr_tally: oa,
+  _tr_align: la
 };
-const ca = (e, t, n, r) => {
+const da = (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 ca = (e, t, n, r) => {
   }
   return a | i << 16 | 0;
 };
-var pr = ca;
-const da = () => {
+var gr = da;
+const ua = () => {
   let e, t = [];
   for (var n = 0; n < 256; n++) {
     e = n;
@@ -276,14 +276,14 @@ const da = () => {
     t[n] = e;
   }
   return t;
-}, ua = new Uint32Array(da()), fa = (e, t, n, r) => {
-  const a = ua, i = r + n;
+}, fa = new Uint32Array(ua()), ha = (e, t, n, r) => {
+  const a = fa, 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 = fa, xt = {
+var de = ha, xt = {
   2: "need dictionary",
   /* Z_NEED_DICT       2  */
   1: "stream end",
@@ -302,7 +302,7 @@ var de = fa, xt = {
   /* Z_BUF_ERROR     (-5) */
   "-6": "incompatible version"
   /* Z_VERSION_ERROR (-6) */
-}, gr = {
+}, mr = {
   /* Allowed flush values; see deflate() and inflate() below for details */
   Z_NO_FLUSH: 0,
   Z_PARTIAL_FLUSH: 1,
@@ -330,30 +330,30 @@ var de = fa, xt = {
   Z_DEFLATED: 8
   //Z_NULL:                 null // Use -1 or null inline, depending on var type
 };
-const { _tr_init: ha, _tr_stored_block: Ht, _tr_flush_block: _a, _tr_tally: _e, _tr_align: pa } = la, {
+const { _tr_init: _a, _tr_stored_block: Ht, _tr_flush_block: pa, _tr_tally: _e, _tr_align: ga } = ca, {
   Z_NO_FLUSH: pe,
-  Z_PARTIAL_FLUSH: ga,
-  Z_FULL_FLUSH: ma,
+  Z_PARTIAL_FLUSH: ma,
+  Z_FULL_FLUSH: ya,
   Z_FINISH: K,
   Z_BLOCK: An,
   Z_OK: D,
   Z_STREAM_END: On,
   Z_STREAM_ERROR: ee,
-  Z_DATA_ERROR: ya,
+  Z_DATA_ERROR: va,
   Z_BUF_ERROR: jt,
-  Z_DEFAULT_COMPRESSION: va,
-  Z_FILTERED: ba,
+  Z_DEFAULT_COMPRESSION: ba,
+  Z_FILTERED: wa,
   Z_HUFFMAN_ONLY: _t,
-  Z_RLE: wa,
-  Z_FIXED: xa,
-  Z_DEFAULT_STRATEGY: ka,
-  Z_UNKNOWN: Sa,
+  Z_RLE: xa,
+  Z_FIXED: ka,
+  Z_DEFAULT_STRATEGY: Sa,
+  Z_UNKNOWN: Ta,
   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) => {
+} = mr, Ea = 9, Aa = 15, Oa = 8, Ca = 29, Ra = 256, Wt = Ra + 1 + Ca, Na = 30, Ia = 19, Za = 2 * Wt + 1, za = 15, x = 3, he = 258, te = he + x + 1, Da = 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, La = 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;
-}, La = (e) => {
+}, Fa = (e) => {
   let t, n, r, a = e.w_size;
   t = e.hash_size, r = t;
   do
@@ -364,21 +364,21 @@ const { _tr_init: ha, _tr_stored_block: Ht, _tr_flush_block: _a, _tr_tally: _e,
     n = e.prev[--r], e.prev[r] = n >= a ? n - a : 0;
   while (--t);
 };
-let Fa = (e, t, n) => (t << e.hash_shift ^ n) & e.hash_mask, ge = Fa;
+let $a = (e, t, n) => (t << e.hash_shift ^ n) & e.hash_mask, ge = $a;
 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));
 }, 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);
+  pa(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;
 }, 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 = 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) => {
+  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 = gr(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);
+}, yr = (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 N = l[r + s - 1], Z = l[r + s];
@@ -401,13 +401,13 @@ const V = (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), La(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), Fa(e), r += t), e.strm.avail_in === 0)
       break;
     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);
-}, yr = (e, t) => {
+}, vr = (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 !== K || t === pe || r !== a + e.strm.avail_in)))
@@ -424,7 +424,7 @@ const V = (e) => {
       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 = mr(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 = yr(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
@@ -448,7 +448,7 @@ const V = (e) => {
       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 = 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) {
+    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 = yr(e, n), e.match_length <= 5 && (e.strategy === wa || 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);
@@ -462,7 +462,7 @@ const V = (e) => {
       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 === 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) => {
+}, ja = (e, t) => {
   let n, r, a, i;
   const s = e.window;
   for (; ; ) {
@@ -483,7 +483,7 @@ const V = (e) => {
       return j;
   }
   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) => {
+}, Ma = (e, t) => {
   let n;
   for (; ; ) {
     if (e.lookahead === 0 && (Ne(e), e.lookahead === 0)) {
@@ -501,7 +501,7 @@ function J(e, t, n, r, a) {
 }
 const He = [
   /*      good lazy nice chain */
-  new J(0, 0, 0, 0, yr),
+  new J(0, 0, 0, 0, vr),
   /* 0 store only */
   new J(4, 4, 8, 4, Mt),
   /* 1 max speed, no lazy matches */
@@ -521,11 +521,11 @@ const He = [
   /* 8 */
   new J(32, 258, 258, 4096, Ee)
   /* 9 max compression */
-], Ma = (e) => {
+], Ua = (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 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;
+function Pa() {
+  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(Za * 2), this.dyn_dtree = new Uint16Array((2 * Na + 1) * 2), this.bl_tree = new Uint16Array((2 * Ia + 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 lt = (e) => {
   if (!e)
@@ -534,29 +534,29 @@ const lt = (e) => {
   return !t || t.strm !== e || t.status !== Re && //#ifdef GZIP
   t.status !== pn && //#endif
   t.status !== qt && t.status !== Kt && t.status !== Gt && t.status !== Xt && t.status !== xe && t.status !== Ve ? 1 : 0;
-}, vr = (e) => {
+}, br = (e) => {
   if (lt(e))
     return ke(e, ee);
-  e.total_in = e.total_out = 0, e.data_type = Sa;
+  e.total_in = e.total_out = 0, e.data_type = Ta;
   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, 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) => {
+  ), e.adler = t.wrap === 2 ? 0 : 1, t.last_flush = -2, _a(t), D;
+}, wr = (e) => {
+  const t = br(e);
+  return t === D && Ua(e.state), t;
+}, Ba = (e, t) => lt(e) || e.state.wrap !== 2 ? ee : (e.state.gzhead = t, D), xr = (e, t, n, r, a, i) => {
   if (!e)
     return ee;
   let 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)
+  if (t === ba && (t = 6), r < 0 ? (s = 0, r = -r) : r > 15 && (s = 2, r -= 16), a < 1 || a > Ea || n !== Rt || r < 8 || r > 15 || t < 0 || t > 9 || i < 0 || i > ka || r === 8 && s !== 1)
     return ke(e, ee);
   r === 8 && (r = 9);
-  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) => {
+  const o = new Pa();
+  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, wr(e);
+}, Va = (e, t) => xr(e, t, Rt, Aa, Oa, Sa), Ha = (e, t) => {
   if (lt(e) || t > An || t < 0)
     return e ? ke(e, ee) : ee;
   const n = e.state;
@@ -572,7 +572,7 @@ const lt = (e) => {
     return ke(e, jt);
   if (n.status === Re && n.wrap === 0 && (n.status = xe), n.status === Re) {
     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)
+    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 |= Da), 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) {
@@ -581,7 +581,7 @@ const lt = (e) => {
         n,
         (n.gzhead.text ? 1 : 0) + (n.gzhead.hcrc ? 2 : 0) + (n.gzhead.extra ? 4 : 0) + (n.gzhead.name ? 8 : 0) + (n.gzhead.comment ? 16 : 0)
       ), 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)
+    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, La), n.status = xe, V(e), n.pending !== 0)
       return n.last_flush = -1, D;
   }
   if (n.status === qt) {
@@ -638,26 +638,26 @@ const lt = (e) => {
       return n.last_flush = -1, D;
   }
   if (e.avail_in !== 0 || n.lookahead !== 0 || t !== pe && n.status !== Ve) {
-    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);
+    let a = n.level === 0 ? vr(n, t) : n.strategy === _t ? Ma(n, t) : n.strategy === xa ? ja(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))
+    if (a === je && (t === ma ? ga(n) : t !== An && (Ht(n, 0, 0, !1), t === ya && (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) => {
+}, Wa = (e) => {
   if (lt(e))
     return ee;
   const t = e.state.status;
-  return e.state = null, t === xe ? ke(e, ya) : D;
-}, Wa = (e, t) => {
+  return e.state = null, t === xe ? ke(e, va) : D;
+}, qa = (e, t) => {
   let n = t.length;
   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 = pr(e.adler, t, n, 0)), r.wrap = 0, n >= r.w_size) {
+  if (a === 1 && (e.adler = gr(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;
@@ -672,19 +672,19 @@ const lt = (e) => {
   }
   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 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
+var Ka = Va, Ga = xr, Xa = wr, Ya = br, Ja = Ba, Qa = Ha, ei = Wa, ti = qa, ni = "pako deflate (from Nodeca project)", Xe = {
+  deflateInit: Ka,
+  deflateInit2: Ga,
+  deflateReset: Xa,
+  deflateResetKeep: Ya,
+  deflateSetHeader: Ja,
+  deflate: Qa,
+  deflateEnd: ei,
+  deflateSetDictionary: ti,
+  deflateInfo: ni
 };
-const ni = (e, t) => Object.prototype.hasOwnProperty.call(e, t);
-var ri = function(e) {
+const ri = (e, t) => Object.prototype.hasOwnProperty.call(e, t);
+var ai = function(e) {
   const t = Array.prototype.slice.call(arguments, 1);
   for (; t.length; ) {
     const n = t.shift();
@@ -692,11 +692,11 @@ var ri = function(e) {
       if (typeof n != "object")
         throw new TypeError(n + "must be non-object");
       for (const r in n)
-        ni(n, r) && (e[r] = n[r]);
+        ri(n, r) && (e[r] = n[r]);
     }
   }
   return e;
-}, ai = (e) => {
+}, ii = (e) => {
   let t = 0;
   for (let r = 0, a = e.length; r < a; r++)
     t += e[r].length;
@@ -706,21 +706,21 @@ var ri = function(e) {
     n.set(s, a), a += s.length;
   }
   return n;
-}, xr = {
-  assign: ri,
-  flattenChunks: ai
+}, kr = {
+  assign: ai,
+  flattenChunks: ii
 };
-let kr = !0;
+let Sr = !0;
 try {
   String.fromCharCode.apply(null, new Uint8Array(1));
 } catch (e) {
-  kr = !1;
+  Sr = !1;
 }
 const tt = new Uint8Array(256);
 for (let e = 0; e < 256; 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) => {
+var si = (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 ii = (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 si = (e, t) => {
-  if (t < 65534 && e.subarray && kr)
+const oi = (e, t) => {
+  if (t < 65534 && e.subarray && Sr)
     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 oi = (e, t) => {
+var li = (e, t) => {
   const n = t || e.length;
   if (typeof TextDecoder == "function" && TextDecoder.prototype.decode)
     return new TextDecoder().decode(e.subarray(0, t));
@@ -763,44 +763,44 @@ var oi = (e, t) => {
     }
     s < 65536 ? i[a++] = s : (s -= 65536, i[a++] = 55296 | s >> 10 & 1023, i[a++] = 56320 | s & 1023);
   }
-  return si(i, a);
-}, li = (e, t) => {
+  return oi(i, a);
+}, ci = (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 + tt[e[n]] > t ? n : t;
-}, Sr = {
-  string2buf: ii,
-  buf2string: oi,
-  utf8border: li
+}, Tr = {
+  string2buf: si,
+  buf2string: li,
+  utf8border: ci
 };
-function ci() {
+function di() {
   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 di = ci;
-const Tr = Object.prototype.toString, {
-  Z_NO_FLUSH: ui,
-  Z_SYNC_FLUSH: fi,
-  Z_FULL_FLUSH: hi,
-  Z_FINISH: _i,
+var ui = di;
+const Er = Object.prototype.toString, {
+  Z_NO_FLUSH: fi,
+  Z_SYNC_FLUSH: hi,
+  Z_FULL_FLUSH: _i,
+  Z_FINISH: pi,
   Z_OK: kt,
-  Z_STREAM_END: pi,
-  Z_DEFAULT_COMPRESSION: gi,
-  Z_DEFAULT_STRATEGY: mi,
-  Z_DEFLATED: yi
-} = gr;
+  Z_STREAM_END: gi,
+  Z_DEFAULT_COMPRESSION: mi,
+  Z_DEFAULT_STRATEGY: yi,
+  Z_DEFLATED: vi
+} = mr;
 function Nt(e) {
-  this.options = xr.assign({
-    level: gi,
-    method: yi,
+  this.options = kr.assign({
+    level: mi,
+    method: vi,
     chunkSize: 16384,
     windowBits: 15,
     memLevel: 8,
-    strategy: mi
+    strategy: yi
   }, 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 di(), this.strm.avail_out = 0;
+  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 ui(), this.strm.avail_out = 0;
   let n = Xe.deflateInit2(
     this.strm,
     t.level,
@@ -813,7 +813,7 @@ function Nt(e) {
     throw new Error(xt[n]);
   if (t.header && Xe.deflateSetHeader(this.strm, t.header), t.dictionary) {
     let r;
-    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)
+    if (typeof t.dictionary == "string" ? r = Tr.string2buf(t.dictionary) : Er.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;
   }
@@ -823,12 +823,12 @@ Nt.prototype.push = function(e, t) {
   let a, i;
   if (this.ended)
     return !1;
-  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) {
+  for (t === ~~t ? i = t : i = t === !0 ? pi : fi, typeof e == "string" ? n.input = Tr.string2buf(e) : Er.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 === hi || i === _i) && n.avail_out <= 6) {
       this.onData(n.output.subarray(0, n.next_out)), n.avail_out = 0;
       continue;
     }
-    if (a = Xe.deflate(n, i), a === pi)
+    if (a = Xe.deflate(n, i), a === gi)
       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);
@@ -846,22 +846,22 @@ Nt.prototype.onData = function(e) {
   this.chunks.push(e);
 };
 Nt.prototype.onEnd = function(e) {
-  e === kt && (this.result = xr.flattenChunks(this.chunks)), this.chunks = [], this.err = e, this.msg = this.strm.msg;
+  e === kt && (this.result = kr.flattenChunks(this.chunks)), this.chunks = [], this.err = e, this.msg = this.strm.msg;
 };
-function vi(e, t) {
+function bi(e, t) {
   const n = new Nt(t);
   if (n.push(e, !0), n.err)
     throw n.msg || xt[n.err];
   return n.result;
 }
-function bi(e, t) {
-  return t = t || {}, t.gzip = !0, vi(e, t);
+function wi(e, t) {
+  return t = t || {}, t.gzip = !0, bi(e, t);
 }
-var wi = bi, xi = {
-  gzip: wi
+var xi = wi, ki = {
+  gzip: xi
 };
-const { gzip: ki } = xi;
-var Si = ki;
+const { gzip: Si } = ki;
+var Ti = Si;
 class be extends Error {
   constructor({
     name: t,
@@ -872,12 +872,12 @@ class be extends Error {
     super(), this.name = t, this.message = n, this.detail = a, this.status = r;
   }
 }
-class Ti extends Error {
+class Ei extends Error {
   constructor() {
     super("Malformatted Figma Token");
   }
 }
-class Ei extends Error {
+class Ai extends Error {
   constructor() {
     super("Missing Figma Token");
   }
@@ -893,35 +893,40 @@ class Nn extends Error {
   }
 }
 class In extends Error {
-  constructor({ reason: t }) {
-    super("Unknown Forbidden Figma Error"), this.reason = t;
+  constructor() {
+    super("File Not Exportable");
   }
 }
-const Er = "Not Found";
-class Ai extends Error {
-  constructor({ cause: t }) {
-    super(Er), this.cause = t;
+class Zn extends Error {
+  constructor({ reason: t }) {
+    super("Unknown Forbidden Figma Error"), this.reason = t;
   }
 }
-const Hs = (e) => e.message === Er, Ar = "Unknown Figma API Exception";
+const Ar = "Not Found";
 class Oi extends Error {
   constructor({ cause: t }) {
     super(Ar), this.cause = t;
   }
 }
-const Ws = (e) => e.message === Ar, Or = "Rate Limit Exceeded";
-class Zn extends Error {
+const Ws = (e) => e.message === Ar, Or = "Unknown Figma API Exception";
+class Ci extends Error {
   constructor({ cause: t }) {
     super(Or), this.cause = t;
   }
 }
-const qs = (e) => e.message === Or, Cr = "Request Too Large";
-class Ci extends Error {
+const qs = (e) => e.message === Or, Cr = "Rate Limit Exceeded";
+class zn extends Error {
   constructor({ cause: t }) {
     super(Cr), this.cause = t;
   }
 }
-const Ks = (e) => e.message === Cr;
+const Ks = (e) => e.message === Cr, Rr = "Request Too Large";
+class Ri extends Error {
+  constructor({ cause: t }) {
+    super(Rr), this.cause = t;
+  }
+}
+const Gs = (e) => e.message === Rr;
 var E;
 (function(e) {
   e.assertEqual = (a) => {
@@ -959,10 +964,10 @@ var E;
   }
   e.joinValues = r, e.jsonStringifyReplacer = (a, i) => typeof i == "bigint" ? i.toString() : i;
 })(E || (E = {}));
-var zn;
+var Dn;
 (function(e) {
   e.mergeShapes = (t, n) => d(d({}, t), n);
-})(zn || (zn = {}));
+})(Dn || (Dn = {}));
 const _ = E.arrayToEnum([
   "string",
   "nan",
@@ -1143,11 +1148,11 @@ const Jt = (e, t) => {
   }
   return { message: n };
 };
-let Ri = Jt;
-function Ni() {
-  return Ri;
+let Ni = Jt;
+function Ii() {
+  return Ni;
 }
-const Ii = (e) => {
+const Zi = (e) => {
   const { data: t, path: n, errorMaps: r, issueData: a } = e, i = [...n, ...a.path || []], s = v(d({}, a), {
     path: i
   });
@@ -1166,7 +1171,7 @@ const Ii = (e) => {
   });
 };
 function f(e, t) {
-  const n = Ni(), r = Ii({
+  const n = Ii(), r = Zi({
     issueData: t,
     data: e.data,
     path: e.path,
@@ -1228,7 +1233,7 @@ class M {
 }
 const m = Object.freeze({
   status: "aborted"
-}), 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;
+}), We = (e) => ({ status: "dirty", value: e }), G = (e) => ({ status: "valid", value: e }), Ln = (e) => e.status === "aborted", Fn = (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;
@@ -1241,7 +1246,7 @@ 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 Fn = (e, t) => {
+const $n = (e, t) => {
   if (Ie(t))
     return { success: !0, data: t.value };
   if (!e.common.issues.length)
@@ -1328,7 +1333,7 @@ class k {
       data: t,
       parsedType: ue(t)
     }, a = this._parseSync({ data: t, path: r.path, parent: r });
-    return Fn(r, a);
+    return $n(r, a);
   }
   "~validate"(t) {
     var r, a;
@@ -1385,7 +1390,7 @@ class k {
         data: t,
         parsedType: ue(t)
       }, a = this._parse({ data: t, path: r.path, parent: r }), i = yield St(a) ? a : Promise.resolve(a);
-      return Fn(r, i);
+      return $n(r, i);
     });
   }
   refine(t, n) {
@@ -1454,7 +1459,7 @@ class k {
     }));
   }
   brand() {
-    return new ts(d({
+    return new ns(d({
       typeName: g.ZodBranded,
       type: this
     }, b(this._def)));
@@ -1486,28 +1491,28 @@ class k {
     return this.safeParse(null).success;
   }
 }
-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})+$";
+const zi = /^c[^\s-]{8,}$/i, Di = /^[0-9a-z]+$/, Li = /^[0-9A-HJKMNP-TV-Z]{26}$/i, Fi = /^[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, $i = /^[a-z0-9_-]{21}$/i, ji = /^[A-Za-z0-9-_]+\.[A-Za-z0-9-_]+\.[A-Za-z0-9-_]*$/, Mi = /^[-+]?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)?)??$/, Ui = /^(?!\.)(?!.*\.\.)([A-Z0-9_'+\-\.]*)[A-Z0-9_+-]@([A-Z0-9][A-Z0-9\-]*\.)+[A-Z]{2,}$/i, Pi = "^(\\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) {
+const 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])$/, Vi = /^(?:(?: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])$/, 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]))$/, Wi = /^(([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])$/, qi = /^([0-9a-zA-Z+/]{4})*(([0-9a-zA-Z+/]{2}==)|([0-9a-zA-Z+/]{3}=))?$/, Ki = /^([0-9a-zA-Z-_]{4})*(([0-9a-zA-Z-_]{2}(==)?)|([0-9a-zA-Z-_]{3}(=)?))?$/, Nr = "((\\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])))", Gi = new RegExp(`^${Nr}$`);
+function Ir(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 Gi(e) {
-  return new RegExp(`^${Nr(e)}$`);
-}
 function Xi(e) {
-  let t = `${Rr}T${Nr(e)}`;
+  return new RegExp(`^${Ir(e)}$`);
+}
+function Yi(e) {
+  let t = `${Nr}T${Ir(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 Yi(e, t) {
-  return !!((t === "v4" || !t) && Pi.test(e) || (t === "v6" || !t) && Vi.test(e));
-}
 function Ji(e, t) {
-  if (!$i.test(e))
+  return !!((t === "v4" || !t) && Bi.test(e) || (t === "v6" || !t) && Hi.test(e));
+}
+function Qi(e, t) {
+  if (!ji.test(e))
     return !1;
   try {
     const [n] = e.split(".");
@@ -1519,8 +1524,8 @@ function Ji(e, t) {
     return !1;
   }
 }
-function Qi(e, t) {
-  return !!((t === "v4" || !t) && Bi.test(e) || (t === "v6" || !t) && Hi.test(e));
+function es(e, t) {
+  return !!((t === "v4" || !t) && Vi.test(e) || (t === "v6" || !t) && Wi.test(e));
 }
 class oe extends k {
   _parse(t) {
@@ -1571,43 +1576,43 @@ class oe extends k {
           message: i.message
         }), r.dirty());
       } else if (i.kind === "email")
-        Mi.test(t.data) || (a = this._getOrReturnCtx(t, a), f(a, {
+        Ui.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")
-        Ut || (Ut = new RegExp(Ui, "u")), Ut.test(t.data) || (a = this._getOrReturnCtx(t, a), f(a, {
+        Ut || (Ut = new RegExp(Pi, "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")
-        Li.test(t.data) || (a = this._getOrReturnCtx(t, a), f(a, {
+        Fi.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")
-        Fi.test(t.data) || (a = this._getOrReturnCtx(t, a), f(a, {
+        $i.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")
-        Zi.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")
-        zi.test(t.data) || (a = this._getOrReturnCtx(t, a), f(a, {
+        Di.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")
-        Di.test(t.data) || (a = this._getOrReturnCtx(t, a), f(a, {
+        Li.test(t.data) || (a = this._getOrReturnCtx(t, a), f(a, {
           validation: "ulid",
           code: u.invalid_string,
           message: i.message
@@ -1638,39 +1643,39 @@ class oe extends k {
         code: u.invalid_string,
         validation: { endsWith: i.value },
         message: i.message
-      }), r.dirty()) : i.kind === "datetime" ? Xi(i).test(t.data) || (a = this._getOrReturnCtx(t, a), f(a, {
+      }), r.dirty()) : i.kind === "datetime" ? Yi(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" ? Ki.test(t.data) || (a = this._getOrReturnCtx(t, a), f(a, {
+      }), r.dirty()) : i.kind === "date" ? Gi.test(t.data) || (a = this._getOrReturnCtx(t, a), f(a, {
         code: u.invalid_string,
         validation: "date",
         message: i.message
-      }), r.dirty()) : i.kind === "time" ? Gi(i).test(t.data) || (a = this._getOrReturnCtx(t, a), f(a, {
+      }), r.dirty()) : i.kind === "time" ? Xi(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" ? ji.test(t.data) || (a = this._getOrReturnCtx(t, a), f(a, {
+      }), r.dirty()) : i.kind === "duration" ? Mi.test(t.data) || (a = this._getOrReturnCtx(t, a), f(a, {
         validation: "duration",
         code: u.invalid_string,
         message: i.message
-      }), r.dirty()) : i.kind === "ip" ? Yi(t.data, i.version) || (a = this._getOrReturnCtx(t, a), f(a, {
+      }), r.dirty()) : i.kind === "ip" ? Ji(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" ? Ji(t.data, i.alg) || (a = this._getOrReturnCtx(t, a), f(a, {
+      }), r.dirty()) : i.kind === "jwt" ? Qi(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" ? Qi(t.data, i.version) || (a = this._getOrReturnCtx(t, a), f(a, {
+      }), r.dirty()) : i.kind === "cidr" ? es(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" ? Wi.test(t.data) || (a = this._getOrReturnCtx(t, a), f(a, {
+      }), r.dirty()) : i.kind === "base64" ? qi.test(t.data) || (a = this._getOrReturnCtx(t, a), f(a, {
         validation: "base64",
         code: u.invalid_string,
         message: i.message
-      }), r.dirty()) : i.kind === "base64url" ? qi.test(t.data) || (a = this._getOrReturnCtx(t, a), f(a, {
+      }), r.dirty()) : i.kind === "base64url" ? Ki.test(t.data) || (a = this._getOrReturnCtx(t, a), f(a, {
         validation: "base64url",
         code: u.invalid_string,
         message: i.message
@@ -1893,7 +1898,7 @@ oe.create = (e) => {
     coerce: (t = e == null ? void 0 : e.coerce) != null ? t : !1
   }, b(e)));
 };
-function es(e, t) {
+function ts(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);
 }
@@ -1932,7 +1937,7 @@ class Ze extends k {
         inclusive: i.inclusive,
         exact: !1,
         message: i.message
-      }), a.dirty()) : i.kind === "multipleOf" ? es(t.data, i.value) !== 0 && (r = this._getOrReturnCtx(t, r), f(r, {
+      }), a.dirty()) : i.kind === "multipleOf" ? ts(t.data, i.value) !== 0 && (r = this._getOrReturnCtx(t, r), f(r, {
         code: u.not_multiple_of,
         multipleOf: i.value,
         message: i.message
@@ -2292,7 +2297,7 @@ Tt.create = (e) => new Tt(d({
   coerce: (e == null ? void 0 : e.coerce) || !1,
   typeName: g.ZodDate
 }, b(e)));
-class $n extends k {
+class jn extends k {
   _parse(t) {
     if (this._getType(t) !== _.symbol) {
       const r = this._getOrReturnCtx(t);
@@ -2305,10 +2310,10 @@ class $n extends k {
     return G(t.data);
   }
 }
-$n.create = (e) => new $n(d({
+jn.create = (e) => new jn(d({
   typeName: g.ZodSymbol
 }, b(e)));
-class jn extends k {
+class Mn extends k {
   _parse(t) {
     if (this._getType(t) !== _.undefined) {
       const r = this._getOrReturnCtx(t);
@@ -2321,10 +2326,10 @@ class jn extends k {
     return G(t.data);
   }
 }
-jn.create = (e) => new jn(d({
+Mn.create = (e) => new Mn(d({
   typeName: g.ZodUndefined
 }, b(e)));
-class Mn extends k {
+class Un extends k {
   _parse(t) {
     if (this._getType(t) !== _.null) {
       const r = this._getOrReturnCtx(t);
@@ -2337,10 +2342,10 @@ class Mn extends k {
     return G(t.data);
   }
 }
-Mn.create = (e) => new Mn(d({
+Un.create = (e) => new Un(d({
   typeName: g.ZodNull
 }, b(e)));
-class Un extends k {
+class Pn extends k {
   constructor() {
     super(...arguments), this._any = !0;
   }
@@ -2348,7 +2353,7 @@ class Un extends k {
     return G(t.data);
   }
 }
-Un.create = (e) => new Un(d({
+Pn.create = (e) => new Pn(d({
   typeName: g.ZodAny
 }, b(e)));
 class en extends k {
@@ -2375,7 +2380,7 @@ class ye extends k {
 ye.create = (e) => new ye(d({
   typeName: g.ZodNever
 }, b(e)));
-class Pn extends k {
+class Bn extends k {
   _parse(t) {
     if (this._getType(t) !== _.undefined) {
       const r = this._getOrReturnCtx(t);
@@ -2388,7 +2393,7 @@ class Pn extends k {
     return G(t.data);
   }
 }
-Pn.create = (e) => new Pn(d({
+Bn.create = (e) => new Bn(d({
   typeName: g.ZodVoid
 }, b(e)));
 class ne extends k {
@@ -2722,7 +2727,7 @@ class I extends k {
     }));
   }
   keyof() {
-    return Ir(E.objectKeys(this.shape));
+    return Zr(E.objectKeys(this.shape));
   }
 }
 I.create = (e, t) => new I(d({
@@ -2840,10 +2845,10 @@ function tn(e, t) {
 class At extends k {
   _parse(t) {
     const { status: n, ctx: r } = this._processInputParams(t), a = (i, s) => {
-      if (Dn(i) || Dn(s))
+      if (Ln(i) || Ln(s))
         return m;
       const o = tn(i.value, s.value);
-      return o.valid ? ((Ln(i) || Ln(s)) && n.dirty(), { status: n.value, value: o.data }) : (f(r, {
+      return o.valid ? ((Fn(i) || Fn(s)) && n.dirty(), { status: n.value, value: o.data }) : (f(r, {
         code: u.invalid_intersection_types
       }), m);
     };
@@ -2961,7 +2966,7 @@ class Ot extends k {
     }, b(n)));
   }
 }
-class Bn extends k {
+class Vn extends k {
   get keySchema() {
     return this._def.keyType;
   }
@@ -3003,7 +3008,7 @@ class Bn extends k {
     }
   }
 }
-Bn.create = (e, t, n) => new Bn(d({
+Vn.create = (e, t, n) => new Vn(d({
   valueType: t,
   keyType: e,
   typeName: g.ZodMap
@@ -3069,7 +3074,7 @@ rt.create = (e, t) => new rt(d({
   maxSize: null,
   typeName: g.ZodSet
 }, b(t)));
-class Vn extends k {
+class Hn extends k {
   get schema() {
     return this._def.getter();
   }
@@ -3078,7 +3083,7 @@ class Vn extends k {
     return this._def.getter()._parse({ data: n.data, path: n.path, parent: n });
   }
 }
-Vn.create = (e, t) => new Vn(d({
+Hn.create = (e, t) => new Hn(d({
   getter: e,
   typeName: g.ZodLazy
 }, b(t)));
@@ -3102,7 +3107,7 @@ nn.create = (e, t) => new nn(d({
   value: e,
   typeName: g.ZodLiteral
 }, b(t)));
-function Ir(e, t) {
+function Zr(e, t) {
   return new ze(d({
     values: e,
     typeName: g.ZodEnum
@@ -3156,8 +3161,8 @@ class ze extends k {
     return ze.create(this.options.filter((r) => !t.includes(r)), d(d({}, this._def), n));
   }
 }
-ze.create = Ir;
-class Hn extends k {
+ze.create = Zr;
+class Wn extends k {
   _parse(t) {
     const n = E.getValidEnumValues(this._def.values), r = this._getOrReturnCtx(t);
     if (r.parsedType !== _.string && r.parsedType !== _.number) {
@@ -3182,7 +3187,7 @@ class Hn extends k {
     return this._def.values;
   }
 }
-Hn.create = (e, t) => new Hn(d({
+Wn.create = (e, t) => new Wn(d({
   values: e,
   typeName: g.ZodNativeEnum
 }, b(t)));
@@ -3380,7 +3385,7 @@ an.create = (e, t) => new an(d({
   typeName: g.ZodCatch,
   catchValue: typeof t.catch == "function" ? t.catch : () => t.catch
 }, b(t)));
-class Wn extends k {
+class qn extends k {
   _parse(t) {
     if (this._getType(t) !== _.nan) {
       const r = this._getOrReturnCtx(t);
@@ -3393,10 +3398,10 @@ class Wn extends k {
     return { status: "valid", value: t.data };
   }
 }
-Wn.create = (e) => new Wn(d({
+qn.create = (e) => new qn(d({
   typeName: g.ZodNaN
 }, b(e)));
-class ts extends k {
+class ns extends k {
   _parse(t) {
     const { ctx: n } = this._processInputParams(t), r = n.data;
     return this._def.type._parse({
@@ -3466,32 +3471,32 @@ 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 pt = oe.create, ns = Ze.create, X = Qt.create, rs = en.create;
+const pt = oe.create, rs = Ze.create, X = Qt.create, as = en.create;
 ye.create;
-const qn = ne.create, gt = I.create, as = Et.create;
+const Kn = ne.create, gt = I.create, is = Et.create;
 At.create;
 Te.create;
-const is = Ot.create, Kn = nn.create, mt = ze.create;
+const ss = Ot.create, Gn = nn.create, mt = ze.create;
 Ct.create;
 me.create;
 Le.create;
-const ss = gt({
+const os = gt({
   language: mt(["typescript", "javascript"]).optional(),
   disableMarkedForExport: X().optional(),
   allowAutoSelectFirstNode: X().optional().default(!0),
   enableDisplayDataId: X().optional(),
   enableDisplayDataName: X().optional()
 }).and(
-  as([
+  is([
     gt({
-      framework: Kn("react"),
+      framework: Gn("react"),
       model: pt().optional(),
       styling: mt(["plain_css", "tailwind", "inline_styles"]),
       uiLibrary: mt(["mui", "antd", "radix", "shadcn", "clean_react"]).optional(),
-      responsivePages: qn(
+      responsivePages: Kn(
         gt({
           name: pt(),
-          framesId: qn(pt())
+          framesId: Kn(pt())
         })
       ).optional(),
       enableUILibraryTheming: X().optional(),
@@ -3500,41 +3505,41 @@ const ss = gt({
       enableGeneratePackageLock: X().optional(),
       enableAnimationsPreset: X().optional(),
       enableAutoSplit: X().optional(),
-      autoSplitThreshold: ns().optional(),
+      autoSplitThreshold: rs().optional(),
       url: pt().url().optional(),
-      codegenSettings: is(rs()).optional()
+      codegenSettings: ss(as()).optional()
     }),
     gt({
-      framework: Kn("html"),
+      framework: Gn("html"),
       styling: mt(["plain_css", "inline_styles", "tailwind"]),
       enableTranslation: X().optional()
     })
   ])
-), os = (e) => {
-  const t = ss.safeParse(e);
+), ls = (e) => {
+  const t = os.safeParse(e);
   if (t.success === !1) {
     const n = new Error("Invalid codegen settings");
     throw n.cause = t.error, n;
   }
   return t.data;
-}, Zr = (e, t) => {
+}, zr = (e, t) => {
   if (e.id === t)
     return e;
   if ("children" in e)
     for (const n of e.children) {
-      const r = Zr(n, t);
+      const r = zr(n, t);
       if (r)
         return r;
     }
   return null;
-}, Gn = /* @__PURE__ */ new Set([
+}, Xn = /* @__PURE__ */ new Set([
   "FRAME",
   "INSTANCE",
   "COMPONENT",
   "COMPONENT_SET",
   "GROUP"
-]), ls = (e, t, n = { allowAutoSelectFirstNode: !0 }) => {
-  const r = Zr(e.document, t);
+]), cs = (e, t, n = { allowAutoSelectFirstNode: !0 }) => {
+  const r = zr(e.document, t);
   if (!r)
     return {
       isValid: !1,
@@ -3542,7 +3547,7 @@ const ss = gt({
     };
   if (r.type === "CANVAS") {
     const a = r.children.filter(
-      (i) => Gn.has(i.type)
+      (i) => Xn.has(i.type)
     );
     return a.length === 0 ? {
       isValid: !1,
@@ -3560,20 +3565,20 @@ const ss = gt({
       reason: "Selected node is a page with multiple children"
     };
   }
-  return Gn.has(r.type) ? { isValid: !0, node: r } : {
+  return Xn.has(r.type) ? { isValid: !0, node: r } : {
     isValid: !1,
     reason: "Selected node type is not supported"
   };
 };
-function cs(e) {
+function ds(e) {
   return e && e.__esModule && Object.prototype.hasOwnProperty.call(e, "default") ? e.default : e;
 }
-var vt = { exports: {} }, ds = vt.exports, Xn;
-function us() {
-  return Xn || (Xn = 1, (function(e, t) {
+var vt = { exports: {} }, us = vt.exports, Yn;
+function fs() {
+  return Yn || (Yn = 1, (function(e, t) {
     (function(n, r) {
       e.exports = r();
-    })(ds, (function() {
+    })(us, (function() {
       var n = typeof Promise == "function", r = (function(R) {
         if (typeof globalThis == "object")
           return globalThis;
@@ -3626,8 +3631,8 @@ function us() {
     }));
   })(vt)), vt.exports;
 }
-var fs = us();
-const hs = /* @__PURE__ */ cs(fs), mn = typeof Buffer != "undefined", _s = mn && typeof Buffer.from != "undefined", ps = mn ? (
+var hs = fs();
+const _s = /* @__PURE__ */ ds(hs), mn = typeof Buffer != "undefined", ps = mn && typeof Buffer.from != "undefined", gs = mn ? (
   /**
    * is value is Buffer?
    *
@@ -3648,7 +3653,7 @@ const hs = /* @__PURE__ */ cs(fs), mn = typeof Buffer != "undefined", _s = mn &&
   function() {
     return !1;
   }
-), gs = _s ? (
+), ms = ps ? (
   /**
    * copy Buffer
    *
@@ -3684,16 +3689,16 @@ const hs = /* @__PURE__ */ cs(fs), mn = typeof Buffer != "undefined", _s = mn &&
   }
 );
 function Fe(e) {
-  return ps(e) ? "Buffer" : hs(e);
+  return gs(e) ? "Buffer" : _s(e);
 }
-const ms = /* @__PURE__ */ new Set([
+const ys = /* @__PURE__ */ new Set([
   "Arguments",
   "Array",
   "Map",
   "Object",
   "Set"
 ]);
-function ys(e, t, n = null) {
+function vs(e, t, n = null) {
   switch (n || Fe(e)) {
     case "Arguments":
     case "Array":
@@ -3706,9 +3711,9 @@ function ys(e, t, n = null) {
   }
 }
 function on(e) {
-  return ms.has(e);
+  return ys.has(e);
 }
-function Yn(e, t, n, r = null) {
+function Jn(e, t, n, r = null) {
   switch (r || Fe(e)) {
     case "Arguments":
     case "Array":
@@ -3724,29 +3729,29 @@ function Yn(e, t, n, r = null) {
   }
   return 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);
-}
+const bs = typeof globalThis != "undefined" && globalThis !== null && globalThis.Object === Object && globalThis, ws = typeof global != "undefined" && global !== null && global.Object === Object && global, xs = typeof self != "undefined" && self !== null && self.Object === Object && self, Pt = bs || ws || xs || Function("return this")();
 function ks(e) {
-  return new Boolean(e.valueOf());
+  return e.slice(0);
 }
 function Ss(e) {
-  return new DataView(e.buffer);
+  return new Boolean(e.valueOf());
 }
 function Ts(e) {
-  return gs(e);
+  return new DataView(e.buffer);
 }
 function Es(e) {
-  return new Date(e.getTime());
+  return ms(e);
 }
 function As(e) {
-  return new Number(e);
+  return new Date(e.getTime());
 }
 function Os(e) {
-  return new RegExp(e.source, e.flags);
+  return new Number(e);
 }
 function Cs(e) {
+  return new RegExp(e.source, e.flags);
+}
+function Rs(e) {
   return new String(e);
 }
 function ae(e, t) {
@@ -3755,28 +3760,28 @@ function ae(e, t) {
 function $(e) {
   return e;
 }
-function Jn() {
+function Qn() {
   return [];
 }
-function Rs() {
+function Ns() {
   return /* @__PURE__ */ new Map();
 }
-function Ns() {
+function Is() {
   return {};
 }
-function Is() {
+function Zs() {
   return /* @__PURE__ */ new Set();
 }
-const Zs = /* @__PURE__ */ new Map([
+const zs = /* @__PURE__ */ new Map([
   // deep copy
-  ["ArrayBuffer", xs],
-  ["Boolean", ks],
-  ["Buffer", Ts],
-  ["DataView", Ss],
-  ["Date", Es],
-  ["Number", As],
-  ["RegExp", Os],
-  ["String", Cs],
+  ["ArrayBuffer", ks],
+  ["Boolean", Ss],
+  ["Buffer", Es],
+  ["DataView", Ts],
+  ["Date", As],
+  ["Number", Os],
+  ["RegExp", Cs],
+  ["String", Rs],
   // typed arrays
   // TODO: pass bound function
   ["Float32Array", ae],
@@ -3808,11 +3813,11 @@ const Zs = /* @__PURE__ */ new Map([
   ["undefined", $],
   // collections
   // NOTE: return empty value, because recursively copy later.
-  ["Arguments", Jn],
-  ["Array", Jn],
-  ["Map", Rs],
-  ["Object", Ns],
-  ["Set", Is]
+  ["Arguments", Qn],
+  ["Array", Qn],
+  ["Map", Ns],
+  ["Object", Is],
+  ["Set", Zs]
   // NOTE: type-detect returns following types
   // 'Location'
   // 'Document'
@@ -3824,11 +3829,11 @@ const Zs = /* @__PURE__ */ new Map([
   // TODO: is type-detect never return 'object'?
   // 'object'
 ]);
-function zs() {
+function Ds() {
 }
-function ln(e, t = null, n = zs) {
+function ln(e, t = null, n = Ds) {
   arguments.length === 2 && typeof t == "function" && (n = t, t = null);
-  const r = t || Fe(e), a = Zs.get(r);
+  const r = t || Fe(e), a = zs.get(r);
   if (r === "Object") {
     const i = n(e, r);
     if (i !== void 0)
@@ -3836,7 +3841,7 @@ function ln(e, t = null, n = zs) {
   }
   return a ? a(e, r) : e;
 }
-function Qn(e, t = {}) {
+function er(e, t = {}) {
   typeof t == "function" && (t = {
     customizer: t
   });
@@ -3870,12 +3875,12 @@ function cn(e, t, n, r, a) {
       break;
   }
   for (let c of o) {
-    const l = ys(e, c, i);
+    const l = vs(e, c, i);
     if (r.has(l))
-      Yn(t, c, n.get(l), i);
+      Jn(t, c, n.get(l), i);
     else {
       const h = Fe(l), S = ln(l, h);
-      on(h) && (n.set(l, S), r.add(l)), Yn(
+      on(h) && (n.set(l, S), r.add(l)), Jn(
         t,
         c,
         cn(
@@ -3891,7 +3896,7 @@ function cn(e, t, n, r, a) {
   return t;
 }
 var at, Ce, se, q, P, dn, bt, qe;
-class Ds {
+class Ls {
   constructor({
     fetch: t = globalThis.fetch.bind(globalThis),
     baseAddress: n = "https://api.figma.com/",
@@ -3922,7 +3927,7 @@ class Ds {
     else if (r != null && r.startsWith("figu_"))
       n.Authorization = `Bearer ${r}`;
     else
-      throw new Ei();
+      throw new Ai();
     return n;
   }
   getFile(a) {
@@ -3984,7 +3989,7 @@ class Ds {
 }
 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 Ti();
+    throw new Ei();
 }, bt = function(t, n) {
   return O(this, null, function* () {
     var a;
@@ -3997,13 +4002,13 @@ at = new WeakMap(), Ce = new WeakMap(), se = new WeakMap(), q = new WeakMap(), P
       } catch (o) {
       }
       if (i === 403)
-        throw s != null && s.includes("Invalid token") ? new Rn() : s != null && s.includes("Token expired") ? new Nn() : new In({ reason: s });
+        throw s != null && s.includes("Invalid token") ? new Rn() : s != null && s.includes("Token expired") ? new Nn() : s != null && s.includes("File not exportable") ? new In() : new Zn({ reason: s });
       if (i === 404)
-        throw new Ai({ cause: r });
+        throw new Oi({ cause: r });
       if (i === 429) {
         const o = r.headers.get("Retry-After"), c = o ? Number(o) : null;
         if (!c)
-          throw new Zn({
+          throw new zn({
             cause: r
           });
         if (yield (a = t.onRateLimited) == null ? void 0 : a.call(t, {
@@ -4028,8 +4033,8 @@ at = new WeakMap(), Ce = new WeakMap(), se = new WeakMap(), q = new WeakMap(), P
               clearTimeout(y), S(new Error("The operation was aborted."));
             });
           });
-        throw new Zn({ cause: r });
-      } else throw i === 500 && (s != null && s.includes("Request too large")) ? new Ci({ cause: r }) : new Oi({
+        throw new zn({ cause: r });
+      } else throw i === 500 && (s != null && s.includes("Request too large")) ? new Ri({ cause: r }) : new Ci({
         cause: r
       });
     }
@@ -4037,8 +4042,8 @@ at = new WeakMap(), Ce = new WeakMap(), se = new WeakMap(), q = new WeakMap(), P
   });
 }, qe = function(t) {
   return O(this, null, function* () {
-    const n = Qn(w(this, se));
-    W(this, se, Qn(w(this, q)));
+    const n = er(w(this, se));
+    W(this, se, er(w(this, q)));
     const r = () => O(this, null, function* () {
       return yield w(this, Ce).call(this, `${w(this, at)}${t}`, {
         method: "GET",
@@ -4049,7 +4054,7 @@ at = new WeakMap(), Ce = new WeakMap(), se = new WeakMap(), q = new WeakMap(), P
     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)) {
+      if (n.onForbidden && (a instanceof Rn || a instanceof Nn || a instanceof In || a instanceof Zn)) {
         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();
@@ -4058,12 +4063,12 @@ at = new WeakMap(), Ce = new WeakMap(), se = new WeakMap(), q = new WeakMap(), P
     }
   });
 };
-var C, it, st, le, zr, Ke;
-class Gs {
+var C, it, st, le, Dr, Ke;
+class Xs {
   constructor({
     auth: t,
     apiBaseAddress: n = "https://public-api.animaapp.com",
-    figmaRestApi: r = new Ds()
+    figmaRestApi: r = new Ls()
   } = {}) {
     Y(this, le);
     Y(this, C);
@@ -4095,8 +4100,8 @@ class Gs {
         if (h instanceof Error && h.name === "AbortError")
           throw h;
       }
-      const s = os(t.settings);
-      i && (yield F(this, le, zr).call(this, i, t.nodesId, {
+      const s = ls(t.settings);
+      i && (yield F(this, le, Dr).call(this, i, t.nodesId, {
         allowAutoSelectFirstNode: (l = s.allowAutoSelectFirstNode) != null ? l : !0
       }));
       let o = t.tracking;
@@ -4128,7 +4133,9 @@ class Gs {
         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 F(this, le, Ke).call(this, "/v1/codegen", c, n, "codegen", r);
     });
@@ -4138,7 +4145,13 @@ class Gs {
       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,
@@ -4150,7 +4163,7 @@ class Gs {
           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 = {
@@ -4245,10 +4258,10 @@ class Gs {
     });
   }
 }
-C = new WeakMap(), it = new WeakMap(), st = new WeakMap(), le = new WeakSet(), zr = function(t, n, r) {
+C = new WeakMap(), it = new WeakMap(), st = new WeakMap(), le = new WeakSet(), Dr = function(t, n, r) {
   return O(this, null, function* () {
     const i = n.map(
-      (s) => ls(t, s, r)
+      (s) => cs(t, s, r)
     ).find(
       (s) => !s.isValid
     );
@@ -4263,7 +4276,7 @@ C = new WeakMap(), it = new WeakMap(), st = new WeakMap(), le = new WeakSet(), z
     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 = Si(JSON.stringify(n)), c = yield fetch(`${w(this, it)}${t}`, {
+    const s = {}, o = Ti(JSON.stringify(n)), c = yield fetch(`${w(this, it)}${t}`, {
       method: "POST",
       headers: v(d({}, this.headers), {
         Accept: "text/event-stream",
@@ -4320,7 +4333,7 @@ C = new WeakMap(), it = new WeakMap(), st = new WeakMap(), le = new WeakSet(), z
             let T;
             try {
               T = JSON.parse(z.slice(6));
-            } catch (Bs) {
+            } catch (Vs) {
               continue;
             }
             switch (T.type) {
@@ -4399,7 +4412,7 @@ C = new WeakMap(), it = new WeakMap(), st = new WeakMap(), le = new WeakSet(), z
     });
   });
 };
-const Xs = (e) => {
+const Ys = (e) => {
   var t;
   if (!e)
     return [!1, "", ""];
@@ -4415,7 +4428,7 @@ const Xs = (e) => {
   } catch (n) {
     return [!1, "", ""];
   }
-}, Ys = ({
+}, Js = ({
   fileKey: e,
   nodeId: t,
   duplicate: n
@@ -4423,12 +4436,12 @@ const Xs = (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 Js extends Error {
+class Qs extends Error {
   constructor(t, n) {
     super(t), this.response = n;
   }
 }
-const Qs = ({
+const eo = ({
   files: e,
   screenPath: t = "src/screens"
 }) => {
@@ -4436,12 +4449,12 @@ const Qs = ({
   function a(i) {
     if (r.has(i) || !e[i])
       return;
-    r.add(i), n[i] = e[i], Ls(e[i].content).forEach((o) => {
+    r.add(i), n[i] = e[i], Fs(e[i].content).forEach((o) => {
       try {
-        const c = Fs(i, o);
+        const c = $s(i, o);
         if (c.startsWith("src/")) {
           const l = c.split("/").slice(0, -1).join("/");
-          $s(e, l).forEach((S) => {
+          js(e, l).forEach((S) => {
             r.has(S) || a(S);
           });
         }
@@ -4457,7 +4470,7 @@ const Qs = ({
     i.startsWith(t) ? a(i) : i.startsWith("src/") || (n[i] = s);
   }), n;
 };
-function Ls(e) {
+function Fs(e) {
   const t = /import.*?["']([^"']+)["']/g, n = /export.*from\s+["']([^"']+)["']/g, r = [];
   let a;
   for (; (a = t.exec(e)) !== null; )
@@ -4466,7 +4479,7 @@ function Ls(e) {
     r.push(a[1]);
   return [...new Set(r)];
 }
-function Fs(e, t) {
+function $s(e, t) {
   if (!t.startsWith("."))
     return t;
   const n = e.split("/").slice(0, -1), r = t.split("/"), a = [...n];
@@ -4474,7 +4487,7 @@ function Fs(e, t) {
     i === ".." ? a.pop() : i !== "." && a.push(i);
   return a.join("/");
 }
-function $s(e, t) {
+function js(e, t) {
   return Object.keys(e).filter((n) => n.startsWith(t));
 }
 function It(e, t, n) {
@@ -4505,7 +4518,7 @@ function It(e, t, n) {
     }
   });
 }
-const js = (e, t) => It(e, t, e.generateCode);
+const Ms = (e, t) => It(e, t, e.generateCode);
 function Zt(e) {
   return O(this, null, function* () {
     var s, o, c, l;
@@ -4540,50 +4553,51 @@ data: ${JSON.stringify(
     });
   });
 }
-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 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* () {
+}), Us = (e, t) => It(e, t, e.generateCodeFromWebsite), 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* () {
+}), Ps = (e, t) => It(e, t, e.generateCodeFromPrompt), ro = (e, t) => O(null, null, function* () {
   const n = Ps(e, t);
   return Zt(n);
+}), Bs = (e, t) => It(e, t, e.generateLink2Code), ao = (e, t) => O(null, null, function* () {
+  const n = Bs(e, t);
+  return Zt(n);
 });
 export {
-  Gs as Anima,
+  Xs as Anima,
   be as CodegenError,
   Nn as ExpiredFigmaToken,
-  Ds as FigmaRestApi,
-  Ti as MalformattedFigmaToken,
-  Ei as MissingFigmaToken,
+  Ls as FigmaRestApi,
+  In as FileNotExportable,
+  Ei as MalformattedFigmaToken,
+  Ai 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
+  Oi as NotFound,
+  zn as RateLimitExceeded,
+  Ri as RequestTooLarge,
+  Qs as ResponseError,
+  Ci as UnknownFigmaApiException,
+  Zn as UnknownForbiddenFigmaError,
+  ro as createCodeFromPromptResponseEventStream,
+  Ps as createCodeFromPromptStream,
+  no as createCodeFromWebsiteResponseEventStream,
+  Us as createCodeFromWebsiteStream,
+  to as createCodegenResponseEventStream,
+  Ms as createCodegenStream,
+  ao as createLink2CodeResponseEventStream,
+  Bs as createLink2CodeStream,
+  zr as findChildrenNode,
+  Js as formatToFigmaLink,
+  eo as getRelatedScreenFiles,
+  cs as isNodeCodegenCompatible,
+  Ws as isNotFound,
+  Ks as isRateLimitExceeded,
+  Gs as isRequestTooLarge,
+  qs as isUnknownFigmaApiException,
+  Ys as isValidFigmaUrl,
+  ls as validateSettings
 };
 //# sourceMappingURL=index.js.map