@picked/client 0.0.9 → 0.0.10-next.2

package/dist/{experience-instance-C1Ky25uw.js → experience-instance-BEKoIaYp.js}

@@ -1,6 +1,6 @@
-import { createDomain as ft, createEvent as b, combine as F, createApi as J, sample as S, createEffect as v, attach as _, split as pt } from "effector";
+import { createDomain as ft, createEvent as b, combine as F, createApi as J, sample as S, createEffect as B, attach as _, split as lt } from "effector";
 import { createFactory as Q, invoke as Y } from "@withease/factories";
-import { h as lt, s as Z, a as dt } from "./supports-yKVnaaMQ.js";
+import { i as pt, s as Z, a as dt } from "./supports-BjhuLJ8z.js";
 import { l as D } from "./logger-C9a75KZn.js";
 import { i as gt } from "./object-JwZ58NOH.js";
 function mt(t) {
@@ -23,7 +23,7 @@ function d(t) {
   const e = parseFloat(`${t}`);
   return isNaN(e) ? 0 : e;
 }
-function L(t) {
+function M(t) {
   return `${t}`;
 }
 const ht = {
@@ -38,32 +38,32 @@ const ht = {
   "<": (t, e, r) => {
     const n = d(t), i = d(e);
     if (r === void 0) return n < i;
-    const c = d(r);
-    return n < i && i < c;
+    const a = d(r);
+    return n < i && i < a;
   },
   "<=": (t, e, r) => {
     const n = d(t), i = d(e);
     if (r === void 0) return n <= i;
-    const c = d(r);
-    return n <= i && i <= c;
+    const a = d(r);
+    return n <= i && i <= a;
   },
   "!!": async (t) => await I(t),
   "!": async (t) => !await I(t),
   "%": (t, e) => d(t) % d(e),
   // eslint-disable-next-line sonarjs/function-return-type
   log: (t) => (console.log(t), t),
-  in: (t, e) => e ? O(e) ? e.indexOf(L(t)) !== -1 : w(e) ? e.includes(t) : !1 : !1,
-  cat: (...t) => t.map(L).join(""),
+  in: (t, e) => e ? O(e) ? e.indexOf(M(t)) !== -1 : w(e) ? e.includes(t) : !1 : !1,
+  cat: (...t) => t.map(M).join(""),
   /* eslint-disable sonarjs/deprecation */
   substr: (t, e, r) => {
-    const n = L(t), i = d(e);
+    const n = M(t), i = d(e);
     if (r === void 0) return n.substr(i);
-    const c = d(r);
-    if (c < 0) {
+    const a = d(r);
+    if (a < 0) {
       const o = n.substr(i);
-      return o.substr(0, o.length + c);
+      return o.substr(0, o.length + a);
     }
-    return n.substr(i, c);
+    return n.substr(i, a);
   },
   /* eslint-enable sonarjs/deprecation */
   "+": (...t) => t.reduce((e, r) => d(e) + d(r), 0),
@@ -82,32 +82,32 @@ const ht = {
       return this;
     if (typeof t == "number" && Array.isArray(this))
       return t >= 0 && t < this.length ? this[t] : r;
-    const n = L(t);
+    const n = M(t);
     if (n === "" || n === ".")
       return this;
     const i = n.split(".");
-    let c = this;
+    let a = this;
     for (const o of i) {
-      if (c == null)
+      if (a == null)
         return r;
-      if (Array.isArray(c)) {
-        const a = parseInt(o, 10);
-        isNaN(a) ? c = c[o] : c = c[a];
+      if (Array.isArray(a)) {
+        const c = parseInt(o, 10);
+        isNaN(c) ? a = a[o] : a = a[c];
       } else
-        c = c[o];
+        a = a[o];
     }
-    return c !== void 0 ? c : r;
+    return a !== void 0 ? a : r;
   },
   async missing(...t) {
     const e = w(t[0]) ? t[0] : t, r = [];
     for (const n of e) {
-      const i = await l({ var: n }, this);
+      const i = await p({ var: n }, this);
       (i === null || i === "") && r.push(`${n}`);
     }
     return r;
   },
   async missing_some(t, e) {
-    const r = await l({ missing: e }, this);
+    const r = await p({ missing: e }, this);
     if (!w(r) || !w(e)) return [];
     const n = r.filter(O);
     return e.filter(O).length - n.length >= d(t) ? [] : n;
@@ -119,21 +119,21 @@ const ht = {
   regexp_matches(t, e) {
     let r = t, n = "";
     if (w(t)) {
-      const [c, o] = t;
-      r = c, n = o;
+      const [a, o] = t;
+      r = a, n = o;
     }
-    return !O(r) || !O(n) ? !1 : new RegExp(r, n).test(L(e));
+    return !O(r) || !O(n) ? !1 : new RegExp(r, n).test(M(e));
   },
   throw(t) {
-    throw new Error(L(t));
+    throw new Error(M(t));
   }
 };
-async function l(t, e) {
+async function p(t, e) {
   if (!t) return t;
   if (tt(t))
-    return l(await t, e);
+    return p(await t, e);
   if (w(t))
-    return Promise.all(t.map((o) => l(o, e)));
+    return Promise.all(t.map((o) => p(o, e)));
   if (!z(t)) return t;
   const r = St(t);
   let n = r ? t[r] ?? [] : [];
@@ -141,76 +141,76 @@ async function l(t, e) {
     case "if":
     case "?:":
       for (let o = 0; o < n.length - 1; o += 2)
-        if (await I(await l(n[o], e)))
-          return l(n[o + 1], e);
-      return n.length % 2 === 1 ? l(n[n.length - 1], e) : null;
+        if (await I(await p(n[o], e)))
+          return p(n[o + 1], e);
+      return n.length % 2 === 1 ? p(n[n.length - 1], e) : null;
     case "and": {
       let o = null;
-      for (const a of n)
-        if (o = await l(a, e), !await I(o))
+      for (const c of n)
+        if (o = await p(c, e), !await I(o))
           return o;
       return o;
     }
     case "or": {
       let o = null;
-      for (const a of n)
-        if (o = await l(a, e), await I(o)) return o;
+      for (const c of n)
+        if (o = await p(c, e), await I(o)) return o;
       return o;
     }
     case "map": {
-      const o = await l(n[0], e);
-      return w(o) ? await Promise.all(o.map((a) => l(n[1], a))) : [];
+      const o = await p(n[0], e);
+      return w(o) ? await Promise.all(o.map((c) => p(n[1], c))) : [];
     }
     case "filter": {
-      const o = await l(n[0], e);
+      const o = await p(n[0], e);
       return w(o) ? (await Promise.all(
         o.map(async (u) => {
-          const h = await I(await l(n[1], u));
+          const h = await I(await p(n[1], u));
           return { item: u, shouldInclude: h };
         })
       )).filter(({ shouldInclude: u }) => u).map(({ item: u }) => u) : [];
     }
     case "reduce": {
-      const o = await l(n[0], e);
+      const o = await p(n[0], e);
       if (!w(o))
-        return n.length > 2 ? await l(n[2], e) : null;
-      const a = n[1];
-      let h = n.length > 2 ? await l(n[2], e) : null;
+        return n.length > 2 ? await p(n[2], e) : null;
+      const c = n[1];
+      let h = n.length > 2 ? await p(n[2], e) : null;
       for (const E of o)
-        h = await l(a, { current: E, accumulator: h });
+        h = await p(c, { current: E, accumulator: h });
       return h;
     }
     case "all": {
-      const o = await l(n[0], e);
+      const o = await p(n[0], e);
       if (!w(o) || o.length === 0) return !1;
-      for (const a of o)
-        if (!await I(await l(n[1], a))) return !1;
+      for (const c of o)
+        if (!await I(await p(n[1], c))) return !1;
       return !0;
     }
     case "some": {
-      const o = await l(n[0], e);
+      const o = await p(n[0], e);
       if (!w(o)) return !1;
-      for (const a of o)
-        if (await I(await l(n[1], a))) return !0;
+      for (const c of o)
+        if (await I(await p(n[1], c))) return !0;
       return !1;
     }
     case "none": {
-      const o = await l(n[0], e);
+      const o = await p(n[0], e);
       if (!w(o)) return !0;
-      for (const a of o)
-        if (await I(await l(n[1], a))) return !1;
+      for (const c of o)
+        if (await I(await p(n[1], c))) return !1;
       return !0;
     }
     case "catch":
       try {
-        return await l(n[0], e);
+        return await p(n[0], e);
       } catch (o) {
-        return z(o) ? await l(o, e) : n[1] ? await l(n[1], o) : o instanceof Error ? o.message : o;
+        return z(o) ? await p(o, e) : n[1] ? await p(n[1], o) : o instanceof Error ? o.message : o;
       }
   }
-  const i = await Promise.all(n.map((o) => l(o, e))), c = r ? ht[r] : void 0;
-  if (!c) throw new Error(`Unrecognized operation ${r}`);
-  return c.apply(e, i);
+  const i = await Promise.all(n.map((o) => p(o, e))), a = r ? ht[r] : void 0;
+  if (!a) throw new Error(`Unrecognized operation ${r}`);
+  return a.apply(e, i);
 }
 async function I(t) {
   return tt(t) ? I(await t) : !(Array.isArray(t) && t.length === 0) && !!t;
@@ -222,11 +222,11 @@ function jt(t) {
   return !gt(t);
 }
 async function yt(t, e, r) {
-  const n = t.getStateSnapshot(), i = t.predicates.listStore.getState().reduce((a, u) => ({
-    ...a,
+  const n = t.getStateSnapshot(), i = t.predicates.listStore.getState().reduce((c, u) => ({
+    ...c,
     [u.name]: () => u.predicate(n)
-  }), {}), c = t.features.listStore.getState().reduce((a, u) => ({
-    ...a,
+  }), {}), a = t.features.listStore.getState().reduce((c, u) => ({
+    ...c,
     [u.id]: async () => {
       const { bucket: h } = await u.getBucket();
       return h;
@@ -246,9 +246,9 @@ async function yt(t, e, r) {
       search: n.location.search
     } : void 0,
     predicates: i,
-    features: c
+    features: a
   };
-  return await l(e, o);
+  return await p(e, o);
 }
 function wt(t) {
   return !dt() || !Z() ? [] : Array.from(window.document.querySelectorAll(t)).filter(
@@ -256,7 +256,7 @@ function wt(t) {
   );
 }
 function xt(t) {
-  if (!lt())
+  if (!pt())
     throw new Error("Shadow DOM is not supported in this environment");
   return t.attachShadow({ mode: "closed" });
 }
@@ -286,7 +286,7 @@ function Kt(t, e) {
     }
   ].flatMap((n) => {
     const i = wt(n.selector).filter(
-      (c) => !It(c, e) && !Nt(c, e)
+      (a) => !It(a, e) && !Nt(a, e)
     );
     return {
       ...n,
@@ -295,7 +295,7 @@ function Kt(t, e) {
   });
 }
 function Ut(t, e) {
-  return t.flatMap((r) => r.elements.map((n) => vt(n, r.placement, e)));
+  return t.flatMap((r) => r.elements.map((n) => Bt(n, r.placement, e)));
 }
 function Vt(t, e) {
   t.classList.add(R), t.classList.add(`${R}-${e}`);
@@ -310,7 +310,7 @@ function bt(t) {
   const e = document.createElement("div");
   return e.style.display = "block", e.classList.add(P), e.classList.add(`${P}-${t}`), e;
 }
-function vt(t, e, r) {
+function Bt(t, e, r) {
   let n;
   const i = bt(r);
   if (t instanceof Document)
@@ -343,22 +343,22 @@ function _t(t) {
 function $(t) {
   return t.type === "step";
 }
-function At(t) {
+function vt(t) {
   return t.type === "experience";
 }
 function X(t) {
   return t.type === "origin";
 }
 const et = (t, e, r, n, i = /* @__PURE__ */ new Set()) => i.has(r.id) ? [] : (i.add(r.id), $(r) && !n ? [r] : e.filter((o) => o.sourceNodeId === r.id).flatMap((o) => {
-  const a = t.find((u) => u.id === o.destinationNodeId);
-  return a ? et(t, e, a, !1, i) : [];
-})), Mt = (t, e, r) => et(t, e, r, !0, /* @__PURE__ */ new Set()), nt = (t, e, r, n, i = /* @__PURE__ */ new Set()) => {
+  const c = t.find((u) => u.id === o.destinationNodeId);
+  return c ? et(t, e, c, !1, i) : [];
+})), At = (t, e, r) => et(t, e, r, !0, /* @__PURE__ */ new Set()), nt = (t, e, r, n, i = /* @__PURE__ */ new Set()) => {
   if (i.has(r.id)) return [-1, -1];
   i.add(r.id);
-  const c = e.filter((u) => u.sourceNodeId === r.id);
-  if (c.length === 0) return [0, 0];
-  let o = 1 / 0, a = -1 / 0;
-  for (const u of c) {
+  const a = e.filter((u) => u.sourceNodeId === r.id);
+  if (a.length === 0) return [0, 0];
+  let o = 1 / 0, c = -1 / 0;
+  for (const u of a) {
     const h = t.find((k) => k.id === u.destinationNodeId);
     if (!h) continue;
     const [E, y] = nt(
@@ -368,17 +368,17 @@ const et = (t, e, r, n, i = /* @__PURE__ */ new Set()) => i.has(r.id) ? [] : (i.
       !1,
       new Set(i)
     );
-    E !== -1 && (o = Math.min(o, E + 1), a = Math.max(a, y + 1));
+    E !== -1 && (o = Math.min(o, E + 1), c = Math.max(c, y + 1));
   }
-  return o === 1 / 0 ? [-1, -1] : [o, a];
-}, Lt = (t, e, r) => nt(t, e, r, !0, /* @__PURE__ */ new Set()), rt = (t, e, r, n = /* @__PURE__ */ new Set()) => {
+  return o === 1 / 0 ? [-1, -1] : [o, c];
+}, Mt = (t, e, r) => nt(t, e, r, !0, /* @__PURE__ */ new Set()), rt = (t, e, r, n = /* @__PURE__ */ new Set()) => {
   if (n.has(r.id)) return [-1, -1];
   if (n.add(r.id), r.type === "origin") return [0, 0];
-  const i = e.filter((a) => a.destinationNodeId === r.id);
+  const i = e.filter((c) => c.destinationNodeId === r.id);
   if (i.length === 0) return [-1, -1];
-  let c = 1 / 0, o = -1 / 0;
-  for (const a of i) {
-    const u = t.find((y) => y.id === a.sourceNodeId);
+  let a = 1 / 0, o = -1 / 0;
+  for (const c of i) {
+    const u = t.find((y) => y.id === c.sourceNodeId);
     if (!u) continue;
     const [h, E] = rt(
       t,
@@ -386,23 +386,23 @@ const et = (t, e, r, n, i = /* @__PURE__ */ new Set()) => i.has(r.id) ? [] : (i.
       u,
       new Set(n)
     );
-    h !== -1 && (c = Math.min(c, h + 1), o = Math.max(o, E + 1));
+    h !== -1 && (a = Math.min(a, h + 1), o = Math.max(o, E + 1));
   }
-  return c === 1 / 0 ? [-1, -1] : [c, o];
-}, Tt = (t, e, r) => rt(t, e, r, /* @__PURE__ */ new Set()), ot = (t) => t.find((r) => r.type === "origin") || null, K = (t, e, r) => {
+  return a === 1 / 0 ? [-1, -1] : [a, o];
+}, Lt = (t, e, r) => rt(t, e, r, /* @__PURE__ */ new Set()), ot = (t) => t.find((r) => r.type === "origin") || null, K = (t, e, r) => {
   if (!t)
     return ot(e);
-  const n = r.find((c) => c.sourceNodeId === t.id);
+  const n = r.find((a) => a.sourceNodeId === t.id);
   if (!n)
     return null;
-  const i = e.find((c) => c.id === n.destinationNodeId);
+  const i = e.find((a) => a.id === n.destinationNodeId);
   return i || null;
 };
-async function Bt(t, e, r, n) {
-  const i = t ? "true" : "false", c = n.find(
+async function Tt(t, e, r, n) {
+  const i = t ? "true" : "false", a = n.find(
     (o) => o.sourceNodeHandle === i && o.sourceNodeId === e
   );
-  return r.find((o) => o.id === (c == null ? void 0 : c.destinationNodeId));
+  return r.find((o) => o.id === (a == null ? void 0 : a.destinationNodeId));
 }
 const U = ft("experience-instance"), Ft = Q(
   ({
@@ -410,30 +410,30 @@ const U = ft("experience-instance"), Ft = Q(
     experience: e,
     target: r
   }) => {
-    const n = b(), i = b(), c = b(), o = b(), a = e.componentStore, u = U.store("transitioning"), h = t.history.entriesStore.map((s) => s.filter((p) => p.experienceId === e.id)), E = h.map((s) => s.filter((p) => $(p.node))), y = h.map((s) => {
-      var p;
-      return ((p = s[s.length - 1]) == null ? void 0 : p.node) || null;
+    const n = b(), i = b(), a = b(), o = b(), c = e.componentStore, u = U.store("transitioning"), h = t.history.entriesStore.map((s) => s.filter((l) => l.experienceId === e.id)), E = h.map((s) => s.filter((l) => $(l.node))), y = h.map((s) => {
+      var l;
+      return ((l = s[s.length - 1]) == null ? void 0 : l.node) || null;
     }), k = F(
       e.treeStore,
       y,
-      ({ steps: s }, p) => s.find((g) => p && $(p) && g.id === p.stepId) || null
+      ({ steps: s }, l) => s.find((g) => l && $(l) && g.id === l.stepId) || null
     ), C = F(
       e.treeStore,
       y,
-      ({ nodes: s, edges: p }, g) => g ? Mt(s, p, g) : []
+      ({ nodes: s, edges: l }, g) => g ? At(s, l, g) : []
     ), f = F(
       e.treeStore,
       y,
-      ({ nodes: s, edges: p }, g) => g ? Tt(s, p, g) : [-1, -1]
+      ({ nodes: s, edges: l }, g) => g ? Lt(s, l, g) : [-1, -1]
     ), m = F(
       e.treeStore,
       y,
-      ({ nodes: s, edges: p }, g) => g ? Lt(s, p, g) : [-1, -1]
+      ({ nodes: s, edges: l }, g) => g ? Mt(s, l, g) : [-1, -1]
     ), x = U.store(!0), N = J(x, {
       open: () => !0,
       close: () => !1,
       toggle: (s) => !s,
-      set: (s, p) => p
+      set: (s, l) => l
     });
     S({
       source: x,
@@ -450,12 +450,12 @@ const U = ft("experience-instance"), Ft = Q(
         experience: e
       }))
     });
-    const A = v(async () => {
+    const v = B(async () => {
       t.history.back({ experienceId: e.id });
-    }), T = _({
+    }), L = _({
       source: e.treeStore,
-      effect: async (s, p) => {
-        const g = s.nodes.find((M) => $(M) && M.stepId === p);
+      effect: async (s, l) => {
+        const g = s.nodes.find((A) => $(A) && A.stepId === l);
         g && t.history.push({ experienceId: e.id, node: g });
       }
     }), V = _({
@@ -467,33 +467,33 @@ const U = ft("experience-instance"), Ft = Q(
       effect: async ({ nodes: s }) => ot(s)
     }), j = _({
       source: e.treeStore,
-      effect: async ({ nodes: s, edges: p }, g) => K(g, s, p)
+      effect: async ({ nodes: s, edges: l }, g) => K(g, s, l)
     }), G = _({
       source: e.treeStore,
-      effect: async ({ nodes: s, edges: p, conditionals: g }, M) => {
-        if (!M)
+      effect: async ({ nodes: s, edges: l, conditionals: g }, A) => {
+        if (!A)
           return;
-        const q = g.find((ut) => ut.id === M.conditionalId);
+        const q = g.find((ut) => ut.id === A.conditionalId);
         if (!q)
           return;
-        const ct = M.id, at = await yt(t, q.condition);
-        return Bt(!!at, ct, s, p);
+        const at = A.id, ct = await yt(t, q.condition);
+        return Tt(!!ct, at, s, l);
       }
-    }), st = v((s) => {
+    }), st = B((s) => {
       if (s)
         return t.launchExperienceById(s.experienceId);
     }), W = _({
       source: [y, e.treeStore],
-      effect: async ([s, { nodes: p, edges: g }]) => K(s, p, g)
-    }), B = _({
+      effect: async ([s, { nodes: l, edges: g }]) => K(s, l, g)
+    }), T = _({
       source: [y, e.treeStore],
-      effect: async ([s, { nodes: p, edges: g }]) => K(s, p, g)
-    }), it = v((s) => {
+      effect: async ([s, { nodes: l, edges: g }]) => K(s, l, g)
+    }), it = B((s) => {
       t.history.push({ experienceId: e.id, node: s });
     });
-    return pt({
+    return lt({
       source: y,
-      match: (s) => s ? _t(s) ? "condition" : $(s) ? "step" : At(s) ? "launchExperience" : X(s) ? "origin" : "other" : "none",
+      match: (s) => s ? _t(s) ? "condition" : $(s) ? "step" : vt(s) ? "launchExperience" : X(s) ? "origin" : "other" : "none",
       cases: {
         none: H,
         origin: j,
@@ -507,64 +507,69 @@ const U = ft("experience-instance"), Ft = Q(
         G.doneData,
         j.doneData,
         H.doneData,
-        B.doneData,
+        T.doneData,
         W.doneData
       ],
       filter: Boolean,
       target: it
     }), S({
       clock: i,
-      target: B
+      target: T
     }), S({
       clock: i,
       source: k,
+      filter: Boolean,
       target: t.eventBus.prepend((s) => ({
         type: "step_submit",
-        step: s ?? void 0,
+        step: s,
         experience: e
       }))
     }), S({
-      clock: B.done,
+      clock: T.done,
       source: k,
+      filter: Boolean,
       target: t.eventBus.prepend((s) => ({
         type: "step_submit_success",
-        step: s ?? void 0,
+        step: s,
         experience: e
       }))
     }), S({
-      clock: B.fail,
+      clock: T.fail,
       source: k,
+      filter: Boolean,
       target: t.eventBus.prepend((s) => ({
         type: "step_submit_error",
-        step: s ?? void 0,
+        step: s,
         experience: e
       }))
     }), S({
-      clock: c,
-      target: A
+      clock: a,
+      target: v
     }), S({
-      clock: c,
+      clock: a,
       source: k,
+      filter: Boolean,
       target: t.eventBus.prepend((s) => ({
         type: "step_submit",
-        step: s ?? void 0,
+        step: s,
         experience: e
       }))
-    }), S({ clock: o, target: T }), S({
+    }), S({ clock: o, target: L }), S({
       source: F([
         G.pending,
         j.pending,
         H.pending,
-        B.pending
+        T.pending
       ]),
       fn: (s) => s.some(Boolean) ? "transitioning" : "ready",
       target: u
     }), S({
       clock: V.doneData,
       source: k,
+      filter: Boolean,
       target: t.eventBus.prepend((s) => ({
         type: "step_enter",
-        step: s ?? void 0,
+        step: s,
         experience: e
       }))
     }), S({
@@ -578,7 +583,7 @@ const U = ft("experience-instance"), Ft = Q(
       experienceId: e.id,
       configStore: e.configStore,
       target: r,
-      componentStore: a,
+      componentStore: c,
       // state
       stateStore: u,
       // open close
@@ -596,7 +601,7 @@ const U = ft("experience-instance"), Ft = Q(
       stepsToLeafStore: m,
       // history
       goToNextStep: i,
-      goToPreviousStep: c,
+      goToPreviousStep: a,
       goToStepById: o,
       stepsHistoryStore: E
     };
@@ -606,7 +611,7 @@ function Ot(t) {
   return Y(Ft, t);
 }
 const $t = Q(({ client: t }) => {
-  const e = U.store({}), r = b(), n = b(), i = b(), c = J(e, {
+  const e = U.store({}), r = b(), n = b(), i = b(), a = J(e, {
     register(f, m) {
       const x = [
         ...f[m.experienceId] ?? []
@@ -617,28 +622,28 @@ const $t = Q(({ client: t }) => {
       };
     },
     unregister(f, m) {
-      var A;
-      const x = m.experienceId, N = (A = f[x]) == null ? void 0 : A.filter(
-        (T) => T !== m
+      var v;
+      const x = m.experienceId, N = (v = f[x]) == null ? void 0 : v.filter(
+        (L) => L !== m
       );
       return {
         ...f,
         [x]: N ?? []
       };
     }
-  }), o = v(
+  }), o = B(
     ({ experience: f, target: m }) => Ot({ client: t, experience: f, target: m })
-  ), a = v((f) => {
-    c.register(f);
-  }), u = v(
+  ), c = B((f) => {
+    a.register(f);
+  }), u = B(
     (f) => {
       f.target && Et(f.target, () => {
         i(f);
       });
     }
-  ), h = v((f) => {
-    c.unregister(f);
-  }), E = v((f) => {
+  ), h = B((f) => {
+    a.unregister(f);
+  }), E = B((f) => {
     const m = f.componentStore.getState();
     if (!m) {
       D("warn", "No app component registered. Skipping init.");
@@ -660,11 +665,11 @@ const $t = Q(({ client: t }) => {
       );
       return;
     }
-    const A = xt(N);
+    const v = xt(N);
     try {
-      x.render(A, m.component, t, f);
-    } catch (T) {
-      D("error", T);
+      x.render(v, m.component, t, f);
+    } catch (L) {
+      D("error", L);
     }
   });
   S({
@@ -676,7 +681,7 @@ const $t = Q(({ client: t }) => {
   }), S({
     clock: o.doneData,
     target: [
-      a,
+      c,
       u,
       n
     ]