@animaapp/anima-sdk 0.17.0 → 0.19.0

package/dist/index.js

@@ -36,7 +36,7 @@ function Me(e) {
   for (; --t >= 0; )
     e[t] = 0;
 }
-const Vr = 0, ar = 1, Hr = 2, Wr = 3, qr = 258, _n = 29, lt = 256, Ye = lt + 1 + _n, Re = 30, pn = 19, ir = 2 * Ye + 1, we = 15, jt = 16, Gr = 7, gn = 256, sr = 16, or = 17, lr = 18, Wt = (
+const Vr = 0, ar = 1, Hr = 2, Wr = 3, qr = 258, _n = 29, ct = 256, Qe = ct + 1 + _n, Re = 30, pn = 19, ir = 2 * Qe + 1, we = 15, jt = 16, Gr = 7, gn = 256, sr = 16, or = 17, lr = 18, Wt = (
   /* extra bits for each length code */
   new Uint8Array([0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 5, 5, 5, 5, 0])
 ), xt = (
@@ -45,14 +45,14 @@ const Vr = 0, ar = 1, Hr = 2, Wr = 3, qr = 258, _n = 29, lt = 256, Ye = lt + 1 +
 ), Kr = (
   /* 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])
-), cr = new Uint8Array([16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15]), Jr = 512, se = new Array((Ye + 2) * 2);
+), cr = new Uint8Array([16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15]), Jr = 512, se = new Array((Qe + 2) * 2);
 Me(se);
-const Je = new Array(Re * 2);
-Me(Je);
-const Qe = new Array(Jr);
-Me(Qe);
-const et = new Array(qr - Wr + 1);
+const Xe = new Array(Re * 2);
+Me(Xe);
+const et = new Array(Jr);
 Me(et);
+const tt = new Array(qr - Wr + 1);
+Me(tt);
 const mn = new Array(_n);
 Me(mn);
 const Tt = new Array(Re);
@@ -64,10 +64,10 @@ let dr, ur, fr;
 function Mt(e, t) {
   this.dyn_tree = e, this.max_code = 0, this.stat_desc = t;
 }
-const hr = (e) => e < 256 ? Qe[e] : Qe[256 + (e >>> 7)], tt = (e, t) => {
+const hr = (e) => e < 256 ? et[e] : et[256 + (e >>> 7)], nt = (e, t) => {
   e.pending_buf[e.pending++] = t & 255, e.pending_buf[e.pending++] = t >>> 8 & 255;
 }, M = (e, t, n) => {
-  e.bi_valid > jt - n ? (e.bi_buf |= t << e.bi_valid & 65535, tt(e, e.bi_buf), e.bi_buf = t >> jt - e.bi_valid, e.bi_valid += n - jt) : (e.bi_buf |= t << e.bi_valid & 65535, e.bi_valid += n);
+  e.bi_valid > jt - n ? (e.bi_buf |= t << e.bi_valid & 65535, nt(e, e.bi_buf), e.bi_buf = t >> jt - e.bi_valid, e.bi_valid += n - jt) : (e.bi_buf |= t << e.bi_valid & 65535, e.bi_valid += n);
 }, Q = (e, t, n) => {
   M(
     e,
@@ -82,7 +82,7 @@ const hr = (e) => e < 256 ? Qe[e] : Qe[256 + (e >>> 7)], tt = (e, t) => {
   while (--t > 0);
   return n >>> 1;
 }, Xr = (e) => {
-  e.bi_valid === 16 ? (tt(e, e.bi_buf), e.bi_buf = 0, e.bi_valid = 0) : e.bi_valid >= 8 && (e.pending_buf[e.pending++] = e.bi_buf & 255, e.bi_buf >>= 8, e.bi_valid -= 8);
+  e.bi_valid === 16 ? (nt(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);
 }, Yr = (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, T, y, N, I, P = 0;
@@ -114,13 +114,13 @@ const hr = (e) => e < 256 ? Qe[e] : Qe[256 + (e >>> 7)], tt = (e, t) => {
   const i = new Array(we + 1);
   for (n = 0, r = 0; r < _n - 1; r++)
     for (mn[r] = n, e = 0; e < 1 << Wt[r]; e++)
-      et[n++] = r;
-  for (et[n - 1] = r, a = 0, r = 0; r < 16; r++)
+      tt[n++] = r;
+  for (tt[n - 1] = r, a = 0, r = 0; r < 16; r++)
     for (Tt[r] = a, e = 0; e < 1 << xt[r]; e++)
-      Qe[a++] = r;
+      et[a++] = r;
   for (a >>= 7; r < Re; r++)
     for (Tt[r] = a << 7, e = 0; e < 1 << xt[r] - 7; e++)
-      Qe[256 + a++] = r;
+      et[256 + a++] = r;
   for (t = 0; t <= we; t++)
     i[t] = 0;
   for (e = 0; e <= 143; )
@@ -131,12 +131,12 @@ const hr = (e) => e < 256 ? Qe[e] : Qe[256 + (e >>> 7)], tt = (e, t) => {
     se[e * 2 + 1] = 7, e++, i[7]++;
   for (; e <= 287; )
     se[e * 2 + 1] = 8, e++, i[8]++;
-  for (pr(se, Ye + 1, i), e = 0; e < Re; e++)
-    Je[e * 2 + 1] = 5, Je[e * 2] = _r(e, 5);
-  dr = new $t(se, Wt, lt + 1, Ye, we), ur = new $t(Je, xt, 0, Re, we), fr = new $t(new Array(0), Kr, 0, pn, Gr);
+  for (pr(se, Qe + 1, i), e = 0; e < Re; e++)
+    Xe[e * 2 + 1] = 5, Xe[e * 2] = _r(e, 5);
+  dr = new $t(se, Wt, ct + 1, Qe, we), ur = new $t(Xe, xt, 0, Re, we), fr = new $t(new Array(0), Kr, 0, pn, Gr);
 }, gr = (e) => {
   let t;
-  for (t = 0; t < Ye; t++)
+  for (t = 0; t < Qe; t++)
     e.dyn_ltree[t * 2] = 0;
   for (t = 0; t < Re; t++)
     e.dyn_dtree[t * 2] = 0;
@@ -144,7 +144,7 @@ const hr = (e) => e < 256 ? Qe[e] : Qe[256 + (e >>> 7)], tt = (e, t) => {
     e.bl_tree[t * 2] = 0;
   e.dyn_ltree[gn * 2] = 1, e.opt_len = e.static_len = 0, e.sym_next = e.matches = 0;
 }, mr = (e) => {
-  e.bi_valid > 8 ? tt(e, e.bi_buf) : e.bi_valid > 0 && (e.pending_buf[e.pending++] = e.bi_buf), e.bi_buf = 0, e.bi_valid = 0;
+  e.bi_valid > 8 ? nt(e, e.bi_buf) : e.bi_valid > 0 && (e.pending_buf[e.pending++] = e.bi_buf), e.bi_buf = 0, e.bi_valid = 0;
 }, Tn = (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,7 +158,7 @@ const hr = (e) => e < 256 ? Qe[e] : Qe[256 + (e >>> 7)], tt = (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 = et[a], Q(e, s + lt + 1, t), o = Wt[s], o !== 0 && (a -= mn[s], M(e, a, o)), r--, s = hr(r), Q(e, s, n), o = xt[s], o !== 0 && (r -= Tt[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 = tt[a], Q(e, s + ct + 1, t), o = Wt[s], o !== 0 && (a -= mn[s], M(e, a, o)), r--, s = hr(r), Q(e, s, n), o = xt[s], o !== 0 && (r -= Tt[s], M(e, r, o)));
     while (i < e.sym_next);
   Q(e, gn, t);
 }, qt = (e, t) => {
@@ -232,7 +232,7 @@ const hr = (e) => e < 256 ? Qe[e] : Qe[256 + (e >>> 7)], tt = (e, t) => {
       return 0;
   if (e.dyn_ltree[18] !== 0 || e.dyn_ltree[20] !== 0 || e.dyn_ltree[26] !== 0)
     return 1;
-  for (n = 32; n < lt; n++)
+  for (n = 32; n < ct; n++)
     if (e.dyn_ltree[n * 2] !== 0)
       return 1;
   return 0;
@@ -241,13 +241,13 @@ let Cn = !1;
 const ra = (e) => {
   Cn || (Qr(), Cn = !0), e.l_desc = new Mt(e.dyn_ltree, dr), e.d_desc = new Mt(e.dyn_dtree, ur), e.bl_desc = new Mt(e.bl_tree, fr), e.bi_buf = 0, e.bi_valid = 0, gr(e);
 }, yr = (e, t, n, r) => {
-  M(e, (Vr << 1) + (r ? 1 : 0), 3), mr(e), tt(e, n), tt(e, ~n), n && e.pending_buf.set(e.window.subarray(t, t + n), e.pending), e.pending += n;
+  M(e, (Vr << 1) + (r ? 1 : 0), 3), mr(e), nt(e, n), nt(e, ~n), n && e.pending_buf.set(e.window.subarray(t, t + n), e.pending), e.pending += n;
 }, aa = (e) => {
   M(e, ar << 1, 3), Q(e, gn, se), Xr(e);
 }, ia = (e, t, n, r) => {
   let a, i, s = 0;
-  e.level > 0 ? (e.strm.data_type === 2 && (e.strm.data_type = na(e)), qt(e, e.l_desc), qt(e, e.d_desc), s = ea(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 ? yr(e, t, n, r) : e.strategy === 4 || i === a ? (M(e, (ar << 1) + (r ? 1 : 0), 3), En(e, se, Je)) : (M(e, (Hr << 1) + (r ? 1 : 0), 3), ta(e, e.l_desc.max_code + 1, e.d_desc.max_code + 1, s + 1), En(e, e.dyn_ltree, e.dyn_dtree)), gr(e), r && mr(e);
-}, sa = (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[(et[n] + lt + 1) * 2]++, e.dyn_dtree[hr(t) * 2]++), e.sym_next === e.sym_end);
+  e.level > 0 ? (e.strm.data_type === 2 && (e.strm.data_type = na(e)), qt(e, e.l_desc), qt(e, e.d_desc), s = ea(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 ? yr(e, t, n, r) : e.strategy === 4 || i === a ? (M(e, (ar << 1) + (r ? 1 : 0), 3), En(e, se, Xe)) : (M(e, (Hr << 1) + (r ? 1 : 0), 3), ta(e, e.l_desc.max_code + 1, e.d_desc.max_code + 1, s + 1), En(e, e.dyn_ltree, e.dyn_dtree)), gr(e), r && mr(e);
+}, sa = (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[(tt[n] + ct + 1) * 2]++, e.dyn_dtree[hr(t) * 2]++), e.sym_next === e.sym_end);
 var oa = ra, la = yr, ca = ia, da = sa, ua = aa, fa = {
   _tr_init: oa,
   _tr_stored_block: la,
@@ -343,13 +343,13 @@ const { _tr_init: ma, _tr_stored_block: Gt, _tr_flush_block: ya, _tr_tally: _e,
   Z_BUF_ERROR: Pt,
   Z_DEFAULT_COMPRESSION: ka,
   Z_FILTERED: Sa,
-  Z_HUFFMAN_ONLY: yt,
+  Z_HUFFMAN_ONLY: vt,
   Z_RLE: Ta,
   Z_FIXED: Ea,
   Z_DEFAULT_STRATEGY: Aa,
   Z_UNKNOWN: Oa,
   Z_DEFLATED: zt
-} = br, Ca = 9, Ra = 15, Na = 8, Ia = 29, Za = 256, Kt = Za + 1 + Ia, za = 30, Da = 19, La = 2 * Kt + 1, Fa = 15, x = 3, he = 258, ne = he + x + 1, ja = 32, Ie = 42, yn = 57, Jt = 69, Xt = 73, Yt = 91, Qt = 103, xe = 113, We = 666, j = 1, Ue = 2, Se = 3, Pe = 4, $a = 3, ke = (e, t) => (e.msg = Et[t], t), In = (e) => e * 2 - (e > 4 ? 9 : 0), fe = (e) => {
+} = br, Ca = 9, Ra = 15, Na = 8, Ia = 29, Za = 256, Kt = Za + 1 + Ia, za = 30, Da = 19, La = 2 * Kt + 1, Fa = 15, x = 3, he = 258, ne = he + x + 1, ja = 32, Ie = 42, yn = 57, Jt = 69, Xt = 73, Yt = 91, Qt = 103, xe = 113, qe = 666, j = 1, Ue = 2, Se = 3, Pe = 4, $a = 3, ke = (e, t) => (e.msg = Et[t], t), In = (e) => e * 2 - (e > 4 ? 9 : 0), fe = (e) => {
   let t = e.length;
   for (; --t >= 0; )
     e[t] = 0;
@@ -499,7 +499,7 @@ const B = (e) => {
 function Y(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 qe = [
+const Ge = [
   /*      good lazy nice chain */
   new Y(0, 0, 0, 0, xr),
   /* 0 store only */
@@ -522,20 +522,20 @@ const qe = [
   new Y(32, 258, 258, 4096, Ae)
   /* 9 max compression */
 ], Va = (e) => {
-  e.window_size = 2 * e.w_size, fe(e.head), e.max_lazy_match = qe[e.level].max_lazy, e.good_match = qe[e.level].good_length, e.nice_match = qe[e.level].nice_length, e.max_chain_length = qe[e.level].max_chain, e.strstart = 0, e.block_start = 0, e.lookahead = 0, e.insert = 0, e.match_length = e.prev_length = x - 1, e.match_available = 0, e.ins_h = 0;
+  e.window_size = 2 * e.w_size, fe(e.head), e.max_lazy_match = Ge[e.level].max_lazy, e.good_match = Ge[e.level].good_length, e.nice_match = Ge[e.level].nice_length, e.max_chain_length = Ge[e.level].max_chain, e.strstart = 0, e.block_start = 0, e.lookahead = 0, e.insert = 0, e.match_length = e.prev_length = x - 1, e.match_available = 0, e.ins_h = 0;
 };
 function Ha() {
   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 = zt, 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(La * 2), this.dyn_dtree = new Uint16Array((2 * za + 1) * 2), this.bl_tree = new Uint16Array((2 * Da + 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(Fa + 1), this.heap = new Uint16Array(2 * Kt + 1), fe(this.heap), this.heap_len = 0, this.heap_max = 0, this.depth = new Uint16Array(2 * Kt + 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 ct = (e) => {
+const dt = (e) => {
   if (!e)
     return 1;
   const t = e.state;
   return !t || t.strm !== e || t.status !== Ie && //#ifdef GZIP
   t.status !== yn && //#endif
-  t.status !== Jt && t.status !== Xt && t.status !== Yt && t.status !== Qt && t.status !== xe && t.status !== We ? 1 : 0;
+  t.status !== Jt && t.status !== Xt && t.status !== Yt && t.status !== Qt && t.status !== xe && t.status !== qe ? 1 : 0;
 }, kr = (e) => {
-  if (ct(e))
+  if (dt(e))
     return ke(e, te);
   e.total_in = e.total_out = 0, e.data_type = Oa;
   const t = e.state;
@@ -547,7 +547,7 @@ const ct = (e) => {
 }, Sr = (e) => {
   const t = kr(e);
   return t === D && Va(e.state), t;
-}, Wa = (e, t) => ct(e) || e.state.wrap !== 2 ? te : (e.state.gzhead = t, D), Tr = (e, t, n, r, a, i) => {
+}, Wa = (e, t) => dt(e) || e.state.wrap !== 2 ? te : (e.state.gzhead = t, D), Tr = (e, t, n, r, a, i) => {
   if (!e)
     return te;
   let s = 1;
@@ -557,10 +557,10 @@ const ct = (e) => {
   const o = new Ha();
   return e.state = o, o.strm = e, o.status = Ie, 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, Sr(e);
 }, qa = (e, t) => Tr(e, t, zt, Ra, Na, Aa), Ga = (e, t) => {
-  if (ct(e) || t > Rn || t < 0)
+  if (dt(e) || t > Rn || t < 0)
     return e ? ke(e, te) : te;
   const n = e.state;
-  if (!e.output || e.avail_in !== 0 && !e.input || n.status === We && t !== q)
+  if (!e.output || e.avail_in !== 0 && !e.input || n.status === qe && t !== q)
     return ke(e, e.avail_out === 0 ? Pt : te);
   const r = n.last_flush;
   if (n.last_flush = t, n.pending !== 0) {
@@ -568,11 +568,11 @@ const ct = (e) => {
       return n.last_flush = -1, D;
   } else if (e.avail_in === 0 && In(t) <= In(r) && t !== q)
     return ke(e, Pt);
-  if (n.status === We && e.avail_in !== 0)
+  if (n.status === qe && e.avail_in !== 0)
     return ke(e, Pt);
   if (n.status === Ie && n.wrap === 0 && (n.status = xe), n.status === Ie) {
     let a = zt + (n.w_bits - 8 << 4) << 8, i = -1;
-    if (n.strategy >= yt || n.level < 2 ? i = 0 : n.level < 6 ? i = 1 : n.level === 6 ? i = 2 : i = 3, a |= i << 6, n.strstart !== 0 && (a |= ja), a += 31 - a % 31, He(n, a), n.strstart !== 0 && (He(n, e.adler >>> 16), He(n, e.adler & 65535)), e.adler = 1, n.status = xe, B(e), n.pending !== 0)
+    if (n.strategy >= vt || n.level < 2 ? i = 0 : n.level < 6 ? i = 1 : n.level === 6 ? i = 2 : i = 3, a |= i << 6, n.strstart !== 0 && (a |= ja), a += 31 - a % 31, He(n, a), n.strstart !== 0 && (He(n, e.adler >>> 16), He(n, e.adler & 65535)), e.adler = 1, n.status = xe, B(e), n.pending !== 0)
       return n.last_flush = -1, D;
   }
   if (n.status === yn) {
@@ -580,8 +580,8 @@ const ct = (e) => {
       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)
-      ), 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 >= yt || 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 = Jt;
-    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 >= yt || n.level < 2 ? 4 : 0), A(n, $a), n.status = xe, B(e), n.pending !== 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 >= vt || 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 = Jt;
+    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 >= vt || n.level < 2 ? 4 : 0), A(n, $a), n.status = xe, B(e), n.pending !== 0)
       return n.last_flush = -1, D;
   }
   if (n.status === Jt) {
@@ -637,22 +637,22 @@ const ct = (e) => {
     if (n.status = xe, B(e), n.pending !== 0)
       return n.last_flush = -1, D;
   }
-  if (e.avail_in !== 0 || n.lookahead !== 0 || t !== pe && n.status !== We) {
-    let a = n.level === 0 ? xr(n, t) : n.strategy === yt ? Ba(n, t) : n.strategy === Ta ? Pa(n, t) : qe[n.level].func(n, t);
-    if ((a === Se || a === Pe) && (n.status = We), a === j || a === Se)
+  if (e.avail_in !== 0 || n.lookahead !== 0 || t !== pe && n.status !== qe) {
+    let a = n.level === 0 ? xr(n, t) : n.strategy === vt ? Ba(n, t) : n.strategy === Ta ? Pa(n, t) : Ge[n.level].func(n, t);
+    if ((a === Se || a === Pe) && (n.status = qe), a === j || a === Se)
       return e.avail_out === 0 && (n.last_flush = -1), D;
     if (a === Ue && (t === ba ? va(n) : t !== Rn && (Gt(n, 0, 0, !1), t === wa && (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, D;
   }
   return t !== q ? D : n.wrap <= 0 ? Nn : (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)) : (He(n, e.adler >>> 16), He(n, e.adler & 65535)), B(e), n.wrap > 0 && (n.wrap = -n.wrap), n.pending !== 0 ? D : Nn);
 }, Ka = (e) => {
-  if (ct(e))
+  if (dt(e))
     return te;
   const t = e.state.status;
   return e.state = null, t === xe ? ke(e, xa) : D;
 }, Ja = (e, t) => {
   let n = t.length;
-  if (ct(e))
+  if (dt(e))
     return te;
   const r = e.state, a = r.wrap;
   if (a === 2 || a === 1 && r.status !== Ie || r.lookahead)
@@ -672,7 +672,7 @@ const ct = (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 Xa = qa, Ya = Tr, Qa = Sr, ei = kr, ti = Wa, ni = Ga, ri = Ka, ai = Ja, ii = "pako deflate (from Nodeca project)", Xe = {
+var Xa = qa, Ya = Tr, Qa = Sr, ei = kr, ti = Wa, ni = Ga, ri = Ka, ai = Ja, ii = "pako deflate (from Nodeca project)", Ye = {
   deflateInit: Xa,
   deflateInit2: Ya,
   deflateReset: Qa,
@@ -716,10 +716,10 @@ try {
 } catch (e) {
   Ar = !1;
 }
-const nt = new Uint8Array(256);
+const rt = new Uint8Array(256);
 for (let e = 0; e < 256; e++)
-  nt[e] = e >= 252 ? 6 : e >= 248 ? 5 : e >= 240 ? 4 : e >= 224 ? 3 : e >= 192 ? 2 : 1;
-nt[254] = nt[254] = 1;
+  rt[e] = e >= 252 ? 6 : e >= 248 ? 5 : e >= 240 ? 4 : e >= 224 ? 3 : e >= 192 ? 2 : 1;
+rt[254] = rt[254] = 1;
 var ci = (e) => {
   if (typeof TextEncoder == "function" && TextEncoder.prototype.encode)
     return new TextEncoder().encode(e);
@@ -750,7 +750,7 @@ var ui = (e, t) => {
       i[a++] = s;
       continue;
     }
-    let o = nt[s];
+    let o = rt[s];
     if (o > 4) {
       i[a++] = 65533, r += o - 1;
       continue;
@@ -769,7 +769,7 @@ var ui = (e, t) => {
   let n = t - 1;
   for (; n >= 0 && (e[n] & 192) === 128; )
     n--;
-  return n < 0 || n === 0 ? t : n + nt[e[n]] > t ? n : t;
+  return n < 0 || n === 0 ? t : n + rt[e[n]] > t ? n : t;
 }, Or = {
   string2buf: ci,
   buf2string: ui,
@@ -801,7 +801,7 @@ function Dt(e) {
   }, e || {});
   let t = this.options;
   t.raw && t.windowBits > 0 ? t.windowBits = -t.windowBits : t.gzip && t.windowBits > 0 && t.windowBits < 16 && (t.windowBits += 16), this.err = 0, this.msg = "", this.ended = !1, this.chunks = [], this.strm = new _i(), this.strm.avail_out = 0;
-  let n = Xe.deflateInit2(
+  let n = Ye.deflateInit2(
     this.strm,
     t.level,
     t.method,
@@ -811,9 +811,9 @@ function Dt(e) {
   );
   if (n !== At)
     throw new Error(Et[n]);
-  if (t.header && Xe.deflateSetHeader(this.strm, t.header), t.dictionary) {
+  if (t.header && Ye.deflateSetHeader(this.strm, t.header), t.dictionary) {
     let r;
-    if (typeof t.dictionary == "string" ? r = Or.string2buf(t.dictionary) : Cr.call(t.dictionary) === "[object ArrayBuffer]" ? r = new Uint8Array(t.dictionary) : r = t.dictionary, n = Xe.deflateSetDictionary(this.strm, r), n !== At)
+    if (typeof t.dictionary == "string" ? r = Or.string2buf(t.dictionary) : Cr.call(t.dictionary) === "[object ArrayBuffer]" ? r = new Uint8Array(t.dictionary) : r = t.dictionary, n = Ye.deflateSetDictionary(this.strm, r), n !== At)
       throw new Error(Et[n]);
     this._dict_set = !0;
   }
@@ -828,8 +828,8 @@ Dt.prototype.push = function(e, t) {
       this.onData(n.output.subarray(0, n.next_out)), n.avail_out = 0;
       continue;
     }
-    if (a = Xe.deflate(n, i), a === vi)
-      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 === At;
+    if (a = Ye.deflate(n, i), a === vi)
+      return n.next_out > 0 && this.onData(n.output.subarray(0, n.next_out)), a = Ye.deflateEnd(this.strm), this.onEnd(a), this.ended = !0, a === At;
     if (n.avail_out === 0) {
       this.onData(n.output);
       continue;
@@ -1233,7 +1233,7 @@ class $ {
 }
 const m = Object.freeze({
   status: "aborted"
-}), Ge = (e) => ({ status: "dirty", value: e }), G = (e) => ({ status: "valid", value: e }), $n = (e) => e.status === "aborted", Mn = (e) => e.status === "dirty", ze = (e) => e.status === "valid", Ot = (e) => typeof Promise != "undefined" && e instanceof Promise;
+}), Ke = (e) => ({ status: "dirty", value: e }), G = (e) => ({ status: "valid", value: e }), $n = (e) => e.status === "aborted", Mn = (e) => e.status === "dirty", ze = (e) => e.status === "valid", Ot = (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;
@@ -2071,7 +2071,7 @@ De.create = (e) => new De(d({
   typeName: g.ZodNumber,
   coerce: (e == null ? void 0 : e.coerce) || !1
 }, b(e)));
-class rt extends k {
+class at extends k {
   constructor() {
     super(...arguments), this.min = this.gte, this.max = this.lte;
   }
@@ -2127,7 +2127,7 @@ class rt extends k {
     return this.setLimit("max", t, !1, p.toString(n));
   }
   setLimit(t, n, r, a) {
-    return new rt(v(d({}, this._def), {
+    return new at(v(d({}, this._def), {
       checks: [
         ...this._def.checks,
         {
@@ -2140,7 +2140,7 @@ class rt extends k {
     }));
   }
   _addCheck(t) {
-    return new rt(v(d({}, this._def), {
+    return new at(v(d({}, this._def), {
       checks: [...this._def.checks, t]
     }));
   }
@@ -2196,9 +2196,9 @@ class rt extends k {
     return t;
   }
 }
-rt.create = (e) => {
+at.create = (e) => {
   var t;
-  return new rt(d({
+  return new at(d({
     checks: [],
     typeName: g.ZodBigInt,
     coerce: (t = e == null ? void 0 : e.coerce) != null ? t : !1
@@ -3013,7 +3013,7 @@ qn.create = (e, t, n) => new qn(d({
   keyType: e,
   typeName: g.ZodMap
 }, b(n)));
-class at extends k {
+class it extends k {
   _parse(t) {
     const { status: n, ctx: r } = this._processInputParams(t);
     if (r.parsedType !== _.set)
@@ -3052,12 +3052,12 @@ class at extends k {
     return r.common.async ? Promise.all(o).then((c) => s(c)) : s(o);
   }
   min(t, n) {
-    return new at(v(d({}, this._def), {
+    return new it(v(d({}, this._def), {
       minSize: { value: t, message: p.toString(n) }
     }));
   }
   max(t, n) {
-    return new at(v(d({}, this._def), {
+    return new it(v(d({}, this._def), {
       maxSize: { value: t, message: p.toString(n) }
     }));
   }
@@ -3068,7 +3068,7 @@ class at extends k {
     return this.min(1, t);
   }
 }
-at.create = (e, t) => new at(d({
+it.create = (e, t) => new it(d({
   valueType: e,
   minSize: null,
   maxSize: null,
@@ -3241,7 +3241,7 @@ class Fe extends k {
             path: r.path,
             parent: r
           });
-          return c.status === "aborted" ? m : c.status === "dirty" || n.value === "dirty" ? Ge(c.value) : c;
+          return c.status === "aborted" ? m : c.status === "dirty" || n.value === "dirty" ? Ke(c.value) : c;
         }));
       {
         if (n.value === "aborted")
@@ -3251,7 +3251,7 @@ class Fe extends k {
           path: r.path,
           parent: r
         });
-        return o.status === "aborted" ? m : o.status === "dirty" || n.value === "dirty" ? Ge(o.value) : o;
+        return o.status === "aborted" ? m : o.status === "dirty" || n.value === "dirty" ? Ke(o.value) : o;
       }
     }
     if (a.type === "refinement") {
@@ -3424,7 +3424,7 @@ class vn extends k {
           path: r.path,
           parent: r
         });
-        return i.status === "aborted" ? m : i.status === "dirty" ? (n.dirty(), Ge(i.value)) : this._def.out._parseAsync({
+        return i.status === "aborted" ? m : i.status === "dirty" ? (n.dirty(), Ke(i.value)) : this._def.out._parseAsync({
           data: i.value,
           path: r.path,
           parent: r
@@ -3471,7 +3471,7 @@ 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 vt = le.create, ss = De.create, K = nn.create, os = rn.create;
+const We = le.create, ss = De.create, K = nn.create, os = rn.create;
 ye.create;
 const Xn = re.create, bt = z.create, ls = Rt.create;
 Nt.create;
@@ -3490,13 +3490,13 @@ const ds = bt({
   ls([
     bt({
       framework: Yn("react"),
-      model: vt().optional(),
+      model: We().optional(),
       styling: wt(["plain_css", "tailwind", "inline_styles"]),
       uiLibrary: wt(["mui", "antd", "radix", "shadcn", "clean_react", "custom_design_system"]).optional(),
       responsivePages: Xn(
         bt({
-          name: vt(),
-          framesId: Xn(vt())
+          name: We(),
+          framesId: Xn(We())
         })
       ).optional(),
       enableUILibraryTheming: K().optional(),
@@ -3506,8 +3506,9 @@ const ds = bt({
       enableAnimationsPreset: K().optional(),
       enableAutoSplit: K().optional(),
       autoSplitThreshold: ss().optional(),
-      url: vt().url().optional(),
-      codegenSettings: cs(os()).optional()
+      url: We().url().optional(),
+      codegenSettings: cs(os()).optional(),
+      designSystemId: We().optional()
     }),
     bt({
       framework: Yn("html"),
@@ -3590,8 +3591,8 @@ function ps() {
         });
         var ve = typeDetectGlobalObject;
         return delete R.typeDetectGlobalObject, ve;
-      })(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", T = a && typeof Symbol.toStringTag != "undefined", y = s && typeof Set.prototype.entries == "function", N = i && typeof Map.prototype.entries == "function", I = y && Object.getPrototypeOf((/* @__PURE__ */ new Set()).entries()), P = N && Object.getPrototypeOf((/* @__PURE__ */ new Map()).entries()), Be = h && typeof Array.prototype[Symbol.iterator] == "function", ft = Be && Object.getPrototypeOf([][Symbol.iterator]()), Ve = h && typeof String.prototype[Symbol.iterator] == "function", ht = Ve && Object.getPrototypeOf(""[Symbol.iterator]()), _t = 8, pt = -1;
-      function gt(R) {
+      })(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", T = a && typeof Symbol.toStringTag != "undefined", y = s && typeof Set.prototype.entries == "function", N = i && typeof Map.prototype.entries == "function", I = y && Object.getPrototypeOf((/* @__PURE__ */ new Set()).entries()), P = N && Object.getPrototypeOf((/* @__PURE__ */ new Map()).entries()), Be = h && typeof Array.prototype[Symbol.iterator] == "function", ht = Be && Object.getPrototypeOf([][Symbol.iterator]()), Ve = h && typeof String.prototype[Symbol.iterator] == "function", _t = Ve && Object.getPrototypeOf(""[Symbol.iterator]()), pt = 8, gt = -1;
+      function mt(R) {
         var ve = typeof R;
         if (ve !== "object")
           return ve;
@@ -3625,9 +3626,9 @@ function ps() {
         if (typeof Ee == "string")
           return Ee;
         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 === P ? "Map Iterator" : s && Z === I ? "Set Iterator" : Be && Z === ft ? "Array Iterator" : Ve && Z === ht ? "String Iterator" : Z === null ? "Object" : Object.prototype.toString.call(R).slice(_t, pt);
+        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 === P ? "Map Iterator" : s && Z === I ? "Set Iterator" : Be && Z === ht ? "Array Iterator" : Ve && Z === _t ? "String Iterator" : Z === null ? "Object" : Object.prototype.toString.call(R).slice(pt, gt);
       }
-      return gt;
+      return mt;
     }));
   })(kt)), kt.exports;
 }
@@ -3895,7 +3896,7 @@ function fn(e, t, n, r, a) {
   }
   return t;
 }
-var it, Ne, oe, W, U, hn, St, Ke;
+var st, Ne, oe, W, U, hn, St, Je;
 class $s {
   constructor({
     fetch: t = globalThis.fetch.bind(globalThis),
@@ -3903,11 +3904,11 @@ class $s {
     defaultOptions: r = {}
   } = {}) {
     X(this, U);
-    X(this, it);
+    X(this, st);
     X(this, Ne);
     X(this, oe);
     X(this, W);
-    H(this, it, n), H(this, Ne, t), H(this, W, r), H(this, oe, w(this, W)), r.token && L(this, U, hn).call(this, r.token);
+    H(this, st, n), H(this, Ne, t), H(this, W, r), H(this, oe, w(this, W)), r.token && L(this, U, hn).call(this, r.token);
   }
   hasDefaultToken() {
     return !!w(this, W).token;
@@ -3942,7 +3943,7 @@ class $s {
       });
       n.length > 0 && i.append("ids", n.join(",")), r && i.append("depth", `${r}`);
       const s = i.toString(), o = `v1/files/${t}?${s}`;
-      return yield L(this, U, Ke).call(this, o);
+      return yield L(this, U, Je).call(this, o);
     });
   }
   getNodeImages(s) {
@@ -3953,7 +3954,7 @@ class $s {
       as: a = "arrayBuffer",
       format: i = "jpg"
     }) {
-      const c = (yield L(this, U, Ke).call(this, `v1/images/${t}?ids=${n}&format=${i}&scale=${r}`)).images;
+      const c = (yield L(this, U, Je).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* () {
@@ -3978,16 +3979,16 @@ class $s {
     }) {
       var i, s;
       const r = `v1/files/${t}/images`;
-      return (s = (i = (yield L(this, U, Ke).call(this, r)).meta) == null ? void 0 : i.images) != null ? s : {};
+      return (s = (i = (yield L(this, U, Je).call(this, r)).meta) == null ? void 0 : i.images) != null ? s : {};
     });
   }
   getMe() {
     return O(this, null, function* () {
-      return yield L(this, U, Ke).call(this, "v1/me");
+      return yield L(this, U, Je).call(this, "v1/me");
     });
   }
 }
-it = new WeakMap(), Ne = new WeakMap(), oe = new WeakMap(), W = new WeakMap(), U = new WeakSet(), hn = function(t) {
+st = new WeakMap(), Ne = new WeakMap(), oe = new WeakMap(), W = new WeakMap(), U = new WeakSet(), hn = function(t) {
   if (!t.startsWith("figd_") && !t.startsWith("figu_"))
     throw new Ci();
 }, St = function(t, n) {
@@ -4040,12 +4041,12 @@ it = new WeakMap(), Ne = new WeakMap(), oe = new WeakMap(), W = new WeakMap(), U
     }
     return r;
   });
-}, Ke = function(t) {
+}, Je = function(t) {
   return O(this, null, function* () {
     const n = rr(w(this, oe));
     H(this, oe, rr(w(this, W)));
     const r = () => O(this, null, function* () {
-      return yield w(this, Ne).call(this, `${w(this, it)}${t}`, {
+      return yield w(this, Ne).call(this, `${w(this, st)}${t}`, {
         method: "GET",
         headers: this.getHeaders(n.token),
         signal: n.abortSignal
@@ -4068,7 +4069,7 @@ const Ms = {
   l2c: "l2c",
   p2c: "p2c"
 };
-var C, st, ot, ee, jr, Ce;
+var C, ot, lt, ee, jr, Ce;
 class to {
   constructor({
     auth: t,
@@ -4077,9 +4078,9 @@ class to {
   } = {}) {
     X(this, ee);
     X(this, C);
-    X(this, st);
     X(this, ot);
-    H(this, st, n), H(this, ot, r), t && (this.auth = t);
+    X(this, lt);
+    H(this, ot, n), H(this, lt, r), t && (this.auth = t);
   }
   hasAuth() {
     return !!w(this, C);
@@ -4098,7 +4099,7 @@ class to {
       var l;
       let i;
       try {
-        i = yield w(this, ot).withOptions({ token: t.figmaToken, abortSignal: r }).getFile({
+        i = yield w(this, lt).withOptions({ token: t.figmaToken, abortSignal: r }).getFile({
           fileKey: t.fileKey
         });
       } catch (h) {
@@ -4270,7 +4271,7 @@ class to {
     });
   }
 }
-C = new WeakMap(), st = new WeakMap(), ot = new WeakMap(), ee = new WeakSet(), jr = function(t, n, r) {
+C = new WeakMap(), ot = new WeakMap(), lt = new WeakMap(), ee = new WeakSet(), jr = function(t, n, r) {
   return O(this, null, function* () {
     const i = n.map(
       (s) => fs(t, s, r)
@@ -4285,7 +4286,7 @@ C = new WeakMap(), st = new WeakMap(), ot = new WeakMap(), ee = new WeakSet(), j
   });
 }, Ce = function(t, n, r, a, i, s) {
   return O(this, null, function* () {
-    var P, Be, ft, Ve, ht, _t, pt, gt, R, ve, Ee;
+    var P, Be, ht, Ve, _t, pt, gt, mt, R, ve, Ee;
     if (this.hasAuth() === !1)
       throw new Error('It needs to set "auth" before calling this method.');
     const o = {}, c = {
@@ -4302,7 +4303,7 @@ C = new WeakMap(), st = new WeakMap(), ot = new WeakMap(), ee = new WeakSet(), j
         "Content-Type": "application/json"
       });
     }
-    const l = yield fetch(`${w(this, st)}${n}`, c);
+    const l = yield fetch(`${w(this, ot)}${n}`, c);
     if (!l.ok) {
       const Z = yield l.text();
       let J;
@@ -4347,11 +4348,11 @@ C = new WeakMap(), st = new WeakMap(), ot = new WeakMap(), ee = new WeakSet(), j
         const Lt = I.split(`
 `);
         I = Lt.pop() || "";
-        for (const mt of Lt)
-          if (!(!mt.trim() || mt.startsWith(":")) && mt.startsWith("data: ")) {
+        for (const yt of Lt)
+          if (!(!yt.trim() || yt.startsWith(":")) && yt.startsWith("data: ")) {
             let S;
             try {
-              S = JSON.parse(mt.slice(6));
+              S = JSON.parse(yt.slice(6));
             } catch (Ks) {
               continue;
             }
@@ -4363,7 +4364,7 @@ C = new WeakMap(), st = new WeakMap(), ot = new WeakMap(), ee = new WeakSet(), j
                 break;
               }
               case "start": {
-                o.sessionId = S.sessionId, typeof a == "function" ? a(S) : (ft = a.onStart) == null || ft.call(a, { sessionId: S.sessionId });
+                o.sessionId = S.sessionId, typeof a == "function" ? a(S) : (ht = a.onStart) == null || ht.call(a, { sessionId: S.sessionId });
                 break;
               }
               case "pre_codegen": {
@@ -4373,22 +4374,22 @@ C = new WeakMap(), st = new WeakMap(), ot = new WeakMap(), ee = new WeakSet(), j
                 break;
               }
               case "assets_uploaded": {
-                typeof a == "function" ? a(S) : (ht = a.onAssetsUploaded) == null || ht.call(a);
+                typeof a == "function" ? a(S) : (_t = a.onAssetsUploaded) == null || _t.call(a);
                 break;
               }
               case "assets_list": {
-                o.assets = S.payload.assets, typeof a == "function" ? a(S) : (_t = a.onAssetsList) == null || _t.call(a, S.payload);
+                o.assets = S.payload.assets, typeof a == "function" ? a(S) : (pt = a.onAssetsList) == null || pt.call(a, S.payload);
                 break;
               }
               case "figma_metadata": {
-                i === "codegen" && (o.figmaFileName = S.figmaFileName, o.figmaSelectedFrameName = S.figmaSelectedFrameName, typeof a == "function" ? a(S) : (pt = a.onFigmaMetadata) == null || pt.call(a, {
+                i === "codegen" && (o.figmaFileName = S.figmaFileName, o.figmaSelectedFrameName = S.figmaSelectedFrameName, typeof a == "function" ? a(S) : (gt = a.onFigmaMetadata) == null || gt.call(a, {
                   figmaFileName: S.figmaFileName,
                   figmaSelectedFrameName: S.figmaSelectedFrameName
                 }));
                 break;
               }
               case "generating_code": {
-                S.payload.status === "success" && (o.files = S.payload.files), typeof a == "function" ? a(S) : (gt = a.onGeneratingCode) == null || gt.call(a, {
+                S.payload.status === "success" && (o.files = S.payload.files), typeof a == "function" ? a(S) : (mt = a.onGeneratingCode) == null || mt.call(a, {
                   status: S.payload.status,
                   progress: S.payload.progress,
                   files: S.payload.files
@@ -4509,7 +4510,7 @@ function Ps(e, t) {
 function Bs(e, t) {
   return Object.keys(e).filter((n) => n.startsWith(t));
 }
-function dt(e, t, n) {
+function ut(e, t, n) {
   return new ReadableStream({
     start(r) {
       n.call(e, t, (a) => {
@@ -4537,8 +4538,8 @@ function dt(e, t, n) {
     }
   });
 }
-const Vs = (e, t) => dt(e, t, e.generateCode);
-function ut(e) {
+const Vs = (e, t) => ut(e, t, e.generateCode);
+function ft(e) {
   return O(this, null, function* () {
     var s, o, c, l;
     const [t, n] = e.tee(), r = yield t.getReader().read();
@@ -4574,19 +4575,19 @@ data: ${JSON.stringify(
 }
 const so = (e, t) => O(null, null, function* () {
   const n = Vs(e, t);
-  return ut(n);
-}), Hs = (e, t) => dt(e, t, e.generateCodeFromWebsite), oo = (e, t) => O(null, null, function* () {
+  return ft(n);
+}), Hs = (e, t) => ut(e, t, e.generateCodeFromWebsite), oo = (e, t) => O(null, null, function* () {
   const n = Hs(e, t);
-  return ut(n);
-}), Ws = (e, t) => dt(e, t, e.generateCodeFromPrompt), lo = (e, t) => O(null, null, function* () {
+  return ft(n);
+}), Ws = (e, t) => ut(e, t, e.generateCodeFromPrompt), lo = (e, t) => O(null, null, function* () {
   const n = Ws(e, t);
-  return ut(n);
-}), qs = (e, t) => dt(e, t, e.attachToGenerationJob), co = (e, t) => O(null, null, function* () {
+  return ft(n);
+}), qs = (e, t) => ut(e, t, e.attachToGenerationJob), co = (e, t) => O(null, null, function* () {
   const n = qs(e, t);
-  return ut(n);
-}), Gs = (e, t) => dt(e, t, e.generateLink2Code), uo = (e, t) => O(null, null, function* () {
+  return ft(n);
+}), Gs = (e, t) => ut(e, t, e.generateLink2Code), uo = (e, t) => O(null, null, function* () {
   const n = Gs(e, t);
-  return ut(n);
+  return ft(n);
 });
 export {
   to as Anima,