@picked/client 0.0.1-dev.1773371977114 → 0.0.1-dev.1773724362573

package/dist/{experience-instance-fvSEb72i.js → experience-instance-DTyL1fNb.js}

@@ -1,15 +1,15 @@
-import { createDomain as kt, createEvent as k, combine as D, createApi as lt, createEffect as _, attach as O, sample as m, split as bt } from "effector";
+import { createDomain as kt, createEvent as b, combine as D, createApi as lt, createEffect as B, attach as O, sample as S, split as bt } from "effector";
 import { createFactory as dt, invoke as pt } from "@withease/factories";
 import { a as vt, s as gt, j as At } from "./supports-8YT4QKI7.js";
 import { l as I } from "./logger-C9a75KZn.js";
-import { i as Ot } from "./object-JwZ58NOH.js";
+import { i as Ot } from "./object-CJssU1Pm.js";
 function Ft(t) {
   return typeof t == "number" && !isNaN(t);
 }
 function j(t) {
   return typeof t == "string";
 }
-function N(t) {
+function E(t) {
   return Array.isArray(t);
 }
 function mt(t) {
@@ -18,7 +18,7 @@ function mt(t) {
 function st(t) {
   return typeof t == "object" && t !== null && !Array.isArray(t) && Object.keys(t).length === 1;
 }
-function g(t) {
+function m(t) {
   if (Ft(t)) return t;
   const e = parseFloat(`${t}`);
   return isNaN(e) ? 0 : e;
@@ -26,39 +26,39 @@ function g(t) {
 function R(t) {
   return `${t}`;
 }
-const Bt = {
+const _t = {
   // eslint-disable-next-line eqeqeq
   "==": (t, e) => t == e,
   "===": (t, e) => t === e,
   // eslint-disable-next-line eqeqeq
   "!=": (t, e) => t != e,
   "!==": (t, e) => t !== e,
-  ">": (t, e) => g(t) > g(e),
-  ">=": (t, e) => g(t) >= g(e),
+  ">": (t, e) => m(t) > m(e),
+  ">=": (t, e) => m(t) >= m(e),
   "<": (t, e, r) => {
-    const n = g(t), s = g(e);
+    const n = m(t), s = m(e);
     if (r === void 0) return n < s;
-    const a = g(r);
+    const a = m(r);
     return n < s && s < a;
   },
   "<=": (t, e, r) => {
-    const n = g(t), s = g(e);
+    const n = m(t), s = m(e);
     if (r === void 0) return n <= s;
-    const a = g(r);
+    const a = m(r);
     return n <= s && s <= a;
   },
   "!!": async (t) => await v(t),
   "!": async (t) => !await v(t),
-  "%": (t, e) => g(t) % g(e),
+  "%": (t, e) => m(t) % m(e),
   // eslint-disable-next-line sonarjs/function-return-type
   log: (t) => (console.log(t), t),
-  in: (t, e) => e ? j(e) ? e.indexOf(R(t)) !== -1 : N(e) ? e.includes(t) : !1 : !1,
+  in: (t, e) => e ? j(e) ? e.indexOf(R(t)) !== -1 : E(e) ? e.includes(t) : !1 : !1,
   cat: (...t) => t.map(R).join(""),
   /* eslint-disable sonarjs/deprecation */
   substr: (t, e, r) => {
-    const n = R(t), s = g(e);
+    const n = R(t), s = m(e);
     if (r === void 0) return n.substr(s);
-    const a = g(r);
+    const a = m(r);
     if (a < 0) {
       const o = n.substr(s);
       return o.substr(0, o.length + a);
@@ -66,16 +66,17 @@ const Bt = {
     return n.substr(s, a);
   },
   /* eslint-enable sonarjs/deprecation */
-  "+": (...t) => t.reduce((e, r) => g(e) + g(r), 0),
-  "*": (...t) => t.reduce((e, r) => g(e) * g(r), 1),
+  "+": (...t) => t.reduce((e, r) => m(e) + m(r), 0),
+  "*": (...t) => t.reduce((e, r) => m(e) * m(r), 1),
   "-": (t, e) => {
-    const r = g(t);
-    return e === void 0 ? -r : r - g(e);
+    const r = m(t);
+    return e === void 0 ? -r : r - m(e);
   },
-  "/": (t, e) => g(t) / g(e),
-  min: (...t) => Math.min(...t.map(g)),
-  max: (...t) => Math.max(...t.map(g)),
-  merge: (...t) => t.reduce((e, r) => N(r) ? e.concat(r) : e.concat([r]), []),
+  "/": (t, e) => m(t) / m(e),
+  min: (...t) => Math.min(...t.map(m)),
+  max: (...t) => Math.max(...t.map(m)),
+  merge: (...t) => t.reduce((e, r) => E(r) ? e.concat(r) : e.concat([r]), []),
+  // eslint-disable-next-line sonarjs/cognitive-complexity -- JSONLogic var operator requires complex path traversal logic
   var(t, e) {
     const r = arguments.length > 1 ? e : null;
     if (t === "" || t === "." || t === null || t === void 0)
@@ -91,15 +92,15 @@ const Bt = {
       if (a == null)
         return r;
       if (Array.isArray(a)) {
-        const u = parseInt(o, 10);
-        isNaN(u) ? a = a[o] : a = a[u];
+        const f = parseInt(o, 10);
+        isNaN(f) ? a = a[o] : a = a[f];
       } else
         a = a[o];
     }
     return a !== void 0 ? a : r;
   },
   async missing(...t) {
-    const e = N(t[0]) ? t[0] : t, r = [];
+    const e = E(t[0]) ? t[0] : t, r = [];
     for (const n of e) {
       const s = await p({ var: n }, this);
       (s === null || s === "") && r.push(`${n}`);
@@ -108,9 +109,9 @@ const Bt = {
   },
   async missing_some(t, e) {
     const r = await p({ missing: e }, this);
-    if (!N(r) || !N(e)) return [];
+    if (!E(r) || !E(e)) return [];
     const n = r.filter(j);
-    return e.filter(j).length - n.length >= g(t) ? [] : n;
+    return e.filter(j).length - n.length >= m(t) ? [] : n;
   },
   /**
    * Invoke operator - executes a function with optional arguments
@@ -130,7 +131,7 @@ const Bt = {
   },
   regexp_matches(t, e) {
     let r = t, n = "";
-    if (N(t)) {
+    if (E(t)) {
       const [a, o] = t;
       r = a, n = o;
     }
@@ -144,12 +145,12 @@ async function p(t, e) {
   if (!t) return t;
   if (mt(t))
     return p(await t, e);
-  if (N(t))
+  if (E(t))
     return Promise.all(t.map((o) => p(o, e)));
   if (!st(t)) return t;
-  const r = _t(t);
+  const r = Bt(t);
   let n = r ? t[r] ?? [] : [];
-  switch (N(n) || (n = [n]), r) {
+  switch (E(n) || (n = [n]), r) {
     case "if":
     case "?:":
       for (let o = 0; o < n.length - 1; o += 2)
@@ -158,59 +159,59 @@ async function p(t, e) {
       return n.length % 2 === 1 ? p(n[n.length - 1], e) : null;
     case "and": {
       let o = null;
-      for (const u of n)
-        if (o = await p(u, e), !await v(o))
+      for (const f of n)
+        if (o = await p(f, e), !await v(o))
           return o;
       return o;
     }
     case "or": {
       let o = null;
-      for (const u of n)
-        if (o = await p(u, e), await v(o)) return o;
+      for (const f of n)
+        if (o = await p(f, e), await v(o)) return o;
       return o;
     }
     case "map": {
       const o = await p(n[0], e);
-      return N(o) ? await Promise.all(o.map((u) => p(n[1], u))) : [];
+      return E(o) ? await Promise.all(o.map((f) => p(n[1], f))) : [];
     }
     case "filter": {
       const o = await p(n[0], e);
-      return N(o) ? (await Promise.all(
+      return E(o) ? (await Promise.all(
         o.map(async (d) => {
-          const y = await v(await p(n[1], d));
-          return { item: d, shouldInclude: y };
+          const g = await v(await p(n[1], d));
+          return { item: d, shouldInclude: g };
         })
       )).filter(({ shouldInclude: d }) => d).map(({ item: d }) => d) : [];
     }
     case "reduce": {
       const o = await p(n[0], e);
-      if (!N(o))
+      if (!E(o))
         return n.length > 2 ? await p(n[2], e) : null;
-      const u = n[1];
-      let y = n.length > 2 ? await p(n[2], e) : null;
-      for (const b of o)
-        y = await p(u, { current: b, accumulator: y });
-      return y;
+      const f = n[1];
+      let g = n.length > 2 ? await p(n[2], e) : null;
+      for (const x of o)
+        g = await p(f, { current: x, accumulator: g });
+      return g;
     }
     case "all": {
       const o = await p(n[0], e);
-      if (!N(o) || o.length === 0) return !1;
-      for (const u of o)
-        if (!await v(await p(n[1], u))) return !1;
+      if (!E(o) || o.length === 0) return !1;
+      for (const f of o)
+        if (!await v(await p(n[1], f))) return !1;
       return !0;
     }
     case "some": {
       const o = await p(n[0], e);
-      if (!N(o)) return !1;
-      for (const u of o)
-        if (await v(await p(n[1], u))) return !0;
+      if (!E(o)) return !1;
+      for (const f of o)
+        if (await v(await p(n[1], f))) return !0;
       return !1;
     }
     case "none": {
       const o = await p(n[0], e);
-      if (!N(o)) return !0;
-      for (const u of o)
-        if (await v(await p(n[1], u))) return !1;
+      if (!E(o)) return !0;
+      for (const f of o)
+        if (await v(await p(n[1], f))) return !1;
       return !0;
     }
     case "catch":
@@ -220,31 +221,33 @@ async function p(t, e) {
         return st(o) ? await p(o, e) : n[1] ? await p(n[1], o) : o instanceof Error ? o.message : o;
       }
   }
-  const s = await Promise.all(n.map((o) => p(o, e))), a = r ? Bt[r] : void 0;
+  const s = await Promise.all(n.map((o) => p(o, e))), a = r ? _t[r] : void 0;
   if (!a) throw new Error(`Unrecognized operation ${r}`);
   return a.apply(e, s);
 }
 async function v(t) {
   return mt(t) ? v(await t) : !(Array.isArray(t) && t.length === 0) && !!t;
 }
-function _t(t) {
+function Bt(t) {
   return Object.keys(t)[0];
 }
 function $t(t) {
   return !Ot(t);
 }
 async function at(t, e, r) {
-  const n = t.getStateSnapshot(), s = t.predicates.listStore.getState().reduce((u, d) => ({
-    ...u,
-    [d.name]: (...y) => d.predicate({ ...n, args: y })
-  }), {}), a = t.features.listStore.getState().reduce((u, d) => ({
-    ...u,
-    [d.id]: async () => {
-      const { bucket: y } = await d.getBucket();
-      return y;
+  const n = t.getStateSnapshot(), s = t.predicates.listStore.getState().reduce((d, g) => ({
+    ...d,
+    [g.name]: (...x) => g.predicate({ ...n, args: x })
+  }), {}), a = t.features.listStore.getState().reduce((d, g) => ({
+    ...d,
+    [g.id]: async () => {
+      const { bucket: x } = await g.getBucket();
+      return x;
     }
-  }), {}), o = {
-    ...r,
+  }), {}), o = t.actions.listStore.getState().reduce((d, g) => ({
+    ...d,
+    [g.name]: (x) => g.action(x)
+  }), {}), f = {
     responses: t.responses.getAllStore.getState(),
     location: typeof n.location == "object" ? {
       hash: n.location.hash,
@@ -258,9 +261,11 @@ async function at(t, e, r) {
       search: n.location.search
     } : void 0,
     predicates: s,
-    features: a
+    features: a,
+    actions: o,
+    ...r
   };
-  return await p(e, o);
+  return await p(e, f);
 }
 function Mt(t) {
   return !vt() || !gt() ? [] : Array.from(window.document.querySelectorAll(t)).filter(
@@ -342,7 +347,7 @@ function jt(t, e, r) {
       case "prepend":
         t.prepend(s);
         break;
-      default:
+      case "append":
         t.append(s);
         break;
     }
@@ -366,43 +371,43 @@ function ft(t) {
   return t.type === "action";
 }
 const St = (t, e, r, n, s = /* @__PURE__ */ new Set()) => s.has(r.id) ? [] : (s.add(r.id), P(r) && !n ? [r] : e.filter((o) => o.sourceNodeId === r.id).flatMap((o) => {
-  const u = t.find((d) => d.id === o.destinationNodeId);
-  return u ? St(t, e, u, !1, s) : [];
+  const f = t.find((d) => d.id === o.destinationNodeId);
+  return f ? St(t, e, f, !1, s) : [];
 })), Ut = (t, e, r) => St(t, e, r, !0, /* @__PURE__ */ new Set()), yt = (t, e, r, n, s = /* @__PURE__ */ new Set()) => {
   if (s.has(r.id)) return [-1, -1];
   s.add(r.id);
   const a = e.filter((d) => d.sourceNodeId === r.id);
   if (a.length === 0) return [0, 0];
-  let o = 1 / 0, u = -1 / 0;
+  let o = 1 / 0, f = -1 / 0;
   for (const d of a) {
-    const y = t.find((M) => M.id === d.destinationNodeId);
-    if (!y) continue;
-    const [b, F] = yt(
+    const g = t.find((M) => M.id === d.destinationNodeId);
+    if (!g) continue;
+    const [x, F] = yt(
       t,
       e,
-      y,
+      g,
       !1,
       new Set(s)
     );
-    b !== -1 && (o = Math.min(o, b + 1), u = Math.max(u, F + 1));
+    x !== -1 && (o = Math.min(o, x + 1), f = Math.max(f, F + 1));
   }
-  return o === 1 / 0 ? [-1, -1] : [o, u];
+  return o === 1 / 0 ? [-1, -1] : [o, f];
 }, Wt = (t, e, r) => yt(t, e, r, !0, /* @__PURE__ */ new Set()), ht = (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 s = e.filter((u) => u.destinationNodeId === r.id);
+  const s = e.filter((f) => f.destinationNodeId === r.id);
   if (s.length === 0) return [-1, -1];
   let a = 1 / 0, o = -1 / 0;
-  for (const u of s) {
-    const d = t.find((F) => F.id === u.sourceNodeId);
+  for (const f of s) {
+    const d = t.find((F) => F.id === f.sourceNodeId);
     if (!d) continue;
-    const [y, b] = ht(
+    const [g, x] = ht(
       t,
       e,
       d,
       new Set(n)
     );
-    y !== -1 && (a = Math.min(a, y + 1), o = Math.max(o, b + 1));
+    g !== -1 && (a = Math.min(a, g + 1), o = Math.max(o, x + 1));
   }
   return a === 1 / 0 ? [-1, -1] : [a, o];
 }, Gt = (t, e, r) => ht(t, e, r, /* @__PURE__ */ new Set()), wt = (t) => t.find((r) => r.type === "origin") || null, Z = (t, e, r) => {
@@ -427,44 +432,44 @@ const tt = kt("experience-instance"), Vt = dt(
     target: r,
     options: n
   }) => {
-    const s = k(), a = k(), o = k(), u = k(), d = k(), y = k(), b = e.componentStore, F = tt.store("transitioning"), M = t.history.entriesStore.map((i) => i.filter((l) => l.experienceId === e.id)), U = M.map((i) => i.filter((l) => P(l.node))), c = M.map((i) => i.at(-1)?.node || null), S = D(
+    const s = b(), a = b(), o = b(), f = b(), d = b(), g = b(), x = e.componentStore, F = tt.store("transitioning"), M = t.history.entriesStore.map((i) => i.filter((l) => l.experienceId === e.id)), U = M.map((i) => i.filter((l) => P(l.node))), c = M.map((i) => i.at(-1)?.node || null), y = D(
       e.treeStore,
       c,
-      ({ steps: i }, l) => i.find((f) => l && P(l) && f.id === l.stepId) || null
-    ), x = D(
+      ({ steps: i }, l) => i.find((u) => l && P(l) && u.id === l.stepId) || null
+    ), N = D(
       e.treeStore,
       U,
       ({ steps: i }, l) => {
-        const f = l.at(-2);
-        if (!f || !P(f.node))
+        const u = l.at(-2);
+        if (!u || !P(u.node))
           return null;
-        const h = f.node;
-        return i.find((B) => B.id === h.stepId) || null;
+        const h = u.node;
+        return i.find((_) => _.id === h.stepId) || null;
       }
     ), T = D(
       e.treeStore,
       c,
-      ({ nodes: i, edges: l }, f) => f ? Ut(i, l, f) : []
+      ({ nodes: i, edges: l }, u) => u ? Ut(i, l, u) : []
     ), C = D(
       e.treeStore,
       c,
-      ({ nodes: i, edges: l }, f) => f ? Gt(i, l, f) : [-1, -1]
+      ({ nodes: i, edges: l }, u) => u ? Gt(i, l, u) : [-1, -1]
     ), q = D(
       e.treeStore,
       c,
-      ({ nodes: i, edges: l }, f) => f ? Wt(i, l, f) : [-1, -1]
+      ({ nodes: i, edges: l }, u) => u ? Wt(i, l, u) : [-1, -1]
     ), L = tt.store(!1), W = lt(L, {
       open: () => !0,
       close: () => !1,
       toggle: (i) => !i,
       set: (i, l) => l
-    }), xt = _(async () => {
+    }), xt = B(async () => {
       t.history.back({ experienceId: e.id });
     }), Nt = O({
       source: e.treeStore,
       effect: async (i, l) => {
-        const f = i.nodes.find((h) => P(h) && h.stepId === l);
-        f && t.history.push({ experienceId: e.id, node: f });
+        const u = i.nodes.find((h) => P(h) && h.stepId === l);
+        u && t.history.push({ experienceId: e.id, node: u });
       }
     }), et = O({
       source: c,
@@ -475,86 +480,87 @@ const tt = kt("experience-instance"), Vt = dt(
       effect: async ({ nodes: i }) => wt(i)
     }), X = O({
       source: e.treeStore,
-      effect: async ({ nodes: i, edges: l }, f) => {
-        if (Y(f))
-          return Z(f, i, l);
+      effect: async ({ nodes: i, edges: l }, u) => {
+        if (Y(u))
+          return Z(u, i, l);
       }
     }), J = O({
       source: e.treeStore,
-      effect: async ({ nodes: i, edges: l, conditionals: f }, h) => {
+      effect: async ({ nodes: i, edges: l, conditionals: u }, h) => {
         if (!ct(h))
           return;
-        const B = f.find((A) => A.id === h.conditionalId);
-        if (!B)
+        const _ = u.find((A) => A.id === h.conditionalId);
+        if (!_)
           return;
-        const E = h.id, w = await at(t, B.condition);
-        return Kt(!!w, E, i, l);
+        const k = h.id, w = await at(t, _.condition);
+        return Kt(!!w, k, i, l);
       }
     }), nt = O({
       source: e.treeStore,
-      effect: async ({ nodes: i, edges: l }, f) => {
-        if (!ft(f))
+      effect: async ({ nodes: i, edges: l }, u) => {
+        if (!ft(u))
           return;
-        const h = f.action;
+        const h = u.action;
         if (!h) {
-          I("warn", `Action node ${f.id} has no action name`);
+          I("warn", `Action node ${u.id} has no action name`);
           return;
         }
-        const B = t.actions.getByName(h).getState();
-        if (!B) {
+        const _ = t.actions.getByName(h).getState();
+        if (!_) {
           I("warn", `Action '${h}' not registered on client`);
-          const E = l.find(
-            (w) => w.sourceNodeId === f.id && w.sourceNodeHandle === "false"
+          const k = l.find(
+            (w) => w.sourceNodeId === u.id && w.sourceNodeHandle === "false"
           );
-          return E ? i.find((w) => w.id === E.destinationNodeId) : null;
+          return k ? i.find((w) => w.id === k.destinationNodeId) : null;
         }
-        if (typeof B.action != "function") {
+        if (typeof _.action != "function") {
           I("warn", `Action '${h}' is not a function`);
-          const E = l.find(
-            (w) => w.sourceNodeId === f.id && w.sourceNodeHandle === "false"
+          const k = l.find(
+            (w) => w.sourceNodeId === u.id && w.sourceNodeHandle === "false"
           );
-          return E ? i.find((w) => w.id === E.destinationNodeId) : null;
+          return k ? i.find((w) => w.id === k.destinationNodeId) : null;
         }
         try {
-          I("info", `Executing action: ${h}`), await B.action(h);
-          const E = l.find(
-            (A) => A.sourceNodeId === f.id && A.sourceNodeHandle === "true"
+          I("info", `Executing action: ${h}`), await _.action(h);
+          const k = l.find(
+            (A) => A.sourceNodeId === u.id && A.sourceNodeHandle === "true"
           );
-          if (!E)
-            return I("warn", `No 'true' edge found for action node ${f.id}`), null;
-          const w = i.find((A) => A.id === E.destinationNodeId);
+          if (!k)
+            return I("warn", `No 'true' edge found for action node ${u.id}`), null;
+          const w = i.find((A) => A.id === k.destinationNodeId);
           return I("info", `Action '${h}' succeeded, moving to node ${w?.id}`), w || null;
-        } catch (E) {
-          I("warn", `Action '${h}' failed:`, E);
+        } catch (k) {
+          I("warn", `Action '${h}' failed:`, k);
           const w = l.find(
-            (G) => G.sourceNodeId === f.id && G.sourceNodeHandle === "false"
+            (G) => G.sourceNodeId === u.id && G.sourceNodeHandle === "false"
           );
           if (!w)
-            return I("warn", `No 'false' edge found for action node ${f.id}`), null;
+            return I("warn", `No 'false' edge found for action node ${u.id}`), null;
           const A = i.find((G) => G.id === w.destinationNodeId);
           return I("info", `Action '${h}' failed, moving to node ${A?.id}`), A || null;
         }
       }
-    }), It = _((i) => {
+    }), Et = B((i) => {
       ut(i) && t.experiences.launch({ id: i.experienceId });
     }), rt = O({
       source: [c, e.treeStore],
-      effect: async ([i, { nodes: l, edges: f }]) => Z(i, l, f)
+      effect: async ([i, { nodes: l, edges: u }]) => Z(i, l, u)
     }), H = O({
       source: [c, e.treeStore],
-      effect: async ([i, { nodes: l, edges: f }]) => Z(i, l, f)
-    }), Et = _((i) => {
+      effect: async ([i, { nodes: l, edges: u }]) => Z(i, l, u)
+    }), It = B((i) => {
       t.history.push({ experienceId: e.id, node: i });
     }), ot = O({
       source: e.configStore,
       effect: async ({ initializeOpenLogic: i }) => n?.initialiseOpen !== void 0 ? n.initialiseOpen : $t(i) ? !!await at(t, i) : i ?? !1
     }), $ = Object.freeze({
+      // eslint-disable-next-line sonarjs/pseudo-random -- non-security use: generating a unique runtime ID for UI tracking
       id: Math.random().toString(36).substring(7),
       // config
       experienceId: e.id,
       configStore: e.configStore,
       target: r,
-      componentStore: b,
+      componentStore: x,
       // state
       stateStore: F,
       // open close
@@ -567,25 +573,25 @@ const tt = kt("experience-instance"), Vt = dt(
       treeStore: e.treeStore,
       fieldsStore: e.fieldsStore,
       currentNodeStore: c,
-      currentStepStore: S,
-      previousStepStore: x,
+      currentStepStore: y,
+      previousStepStore: N,
       nextReachableStepNodesStore: T,
       stepsToOriginStore: C,
       stepsToLeafStore: q,
       // history
       goToNextStep: a,
       goToPreviousStep: o,
-      goToStepById: u,
+      goToStepById: f,
       stepsHistoryStore: U
-    }), Q = k(), it = k();
-    return m({
+    }), Q = b(), it = b();
+    return S({
       source: c,
       target: Q
-    }), m({
+    }), S({
       clock: Q,
       filter: (i) => i === null,
       target: z
-    }), m({
+    }), S({
       clock: Q,
       filter: (i) => i !== null,
       target: it
@@ -596,11 +602,11 @@ const tt = kt("experience-instance"), Vt = dt(
         origin: X,
         condition: J,
         step: et,
-        launchExperience: It,
+        launchExperience: Et,
         action: nt,
-        __: k()
+        __: b()
       }
-    }), m({
+    }), S({
       clock: [
         J.doneData,
         X.doneData,
@@ -610,41 +616,41 @@ const tt = kt("experience-instance"), Vt = dt(
         nt.doneData
       ],
       filter: Boolean,
-      target: Et
-    }), m({
+      target: It
+    }), S({
       clock: a,
       target: H
-    }), m({
+    }), S({
       clock: a,
-      source: S,
+      source: y,
       filter: Boolean,
       target: t.eventBus.prepend((i) => ({
         type: "step_submit",
         step: i,
         experience: $
       }))
-    }), m({
+    }), S({
       clock: H.done,
-      source: S,
+      source: y,
       filter: Boolean,
       target: t.eventBus.prepend((i) => ({
         type: "step_submit_success",
         step: i,
         experience: $
       }))
-    }), m({
+    }), S({
       clock: H.fail,
-      source: S,
+      source: y,
       filter: Boolean,
       target: t.eventBus.prepend((i) => ({
         type: "step_submit_error",
         step: i,
         experience: $
       }))
-    }), m({
+    }), S({
       clock: o,
       target: xt
-    }), m({ clock: u, target: Nt }), m({
+    }), S({ clock: f, target: Nt }), S({
       source: D([
         J.pending,
         X.pending,
@@ -653,48 +659,48 @@ const tt = kt("experience-instance"), Vt = dt(
       ]),
       fn: (i) => i.some(Boolean) ? "transitioning" : "ready",
       target: F
-    }), m({
+    }), S({
       clock: et.doneData,
-      source: S,
+      source: y,
       filter: Boolean,
       target: t.eventBus.prepend((i) => ({
         type: "step_enter",
         step: i,
         experience: $
       }))
-    }), m({
-      clock: y,
+    }), S({
+      clock: g,
       target: ot
-    }), m({
+    }), S({
       source: ot.doneData,
       fn: Boolean,
       target: L
-    }), m({
+    }), S({
       source: c,
       clock: s,
       filter: (i) => i ? Y(i) : !0,
       target: rt
-    }), m({
+    }), S({
       source: L,
       filter: Boolean,
       target: s
-    }), m({
+    }), S({
       source: L,
       filter: Boolean,
       target: t.eventBus.prepend(() => ({
         type: "experience_open",
         experience: $
       }))
-    }), m({
+    }), S({
       source: L,
       filter: (i) => !i,
       target: t.eventBus.prepend(() => ({
         type: "experience_close",
         experience: $
       }))
-    }), m({
+    }), S({
       clock: d,
-      target: [y]
+      target: [g]
     }), d(), $;
   }
 );
@@ -702,52 +708,52 @@ function qt(t) {
   return pt(Vt, t);
 }
 const zt = dt(({ client: t }) => {
-  const e = tt.store({}), r = k(), n = k(), s = k(), a = lt(e, {
-    register(c, S) {
-      const x = [
-        ...c[S.experienceId] ?? []
+  const e = tt.store({}), r = b(), n = b(), s = b(), a = lt(e, {
+    register(c, y) {
+      const N = [
+        ...c[y.experienceId] ?? []
       ];
-      return x.push(S), {
+      return N.push(y), {
         ...c,
-        [S.experienceId]: x
+        [y.experienceId]: N
       };
     },
-    unregister(c, S) {
-      const x = S.experienceId, T = c[x]?.filter(
-        (C) => C !== S
+    unregister(c, y) {
+      const N = y.experienceId, T = c[N]?.filter(
+        (C) => C !== y
       );
       return {
         ...c,
-        [x]: T ?? []
+        [N]: T ?? []
       };
     }
-  }), o = _(
+  }), o = B(
     ({
       experience: c,
-      target: S,
-      options: x
-    }) => qt({ client: t, experience: c, target: S, options: x })
-  ), u = _((c) => {
+      target: y,
+      options: N
+    }) => qt({ client: t, experience: c, target: y, options: N })
+  ), f = B((c) => {
     a.register(c);
-  }), d = _(
+  }), d = B(
     (c) => {
       c.target && Dt(c.target, () => {
         s(c);
       });
     }
-  ), y = _((c) => {
+  ), g = B((c) => {
     a.unregister(c);
-  }), b = _((c) => {
-    const S = c.componentStore.getState();
-    if (!S) {
+  }), x = B((c) => {
+    const y = c.componentStore.getState();
+    if (!y) {
       I("warn", "No app component registered. Skipping init.");
       return;
     }
-    const x = S.frameworkStore.getState();
-    if (!x) {
+    const N = y.frameworkStore.getState();
+    if (!N) {
       I(
         "error",
-        `No framework registered for component '${S.name}'. Skipping rendering.`
+        `No framework registered for component '${y.name}'. Skipping rendering.`
       );
       return;
     }
@@ -761,40 +767,40 @@ const zt = dt(({ client: t }) => {
     }
     const C = Lt(T);
     try {
-      x.render(C, S.component, t, c);
+      N.render(C, y.component, t, c);
     } catch (q) {
       I("error", q);
     }
   });
-  m({
+  S({
     clock: r,
     target: o
-  }), m({
+  }), S({
     clock: s,
-    target: y
-  }), m({
+    target: g
+  }), S({
     clock: o.doneData,
     target: [
-      u,
+      f,
       d,
       n
     ]
-  }), m({
+  }), S({
     clock: o.doneData,
     target: t.eventBus.prepend((c) => ({
       type: "experience_initialize",
       experience: c
     }))
-  }), m({
+  }), S({
     clock: n,
-    target: b
+    target: x
   });
-  function F(c, S, x) {
-    r({ experience: c, target: S, options: x });
+  function F(c, y, N) {
+    r({ experience: c, target: y, options: N });
   }
   const M = e.map((c) => Object.values(c).flat());
   function U(c) {
-    return e.map((S) => S[c] || [], { skipVoid: !1 });
+    return e.map((y) => y[c] || [], { skipVoid: !1 });
   }
   return {
     spawn: F,