@picked/client 0.0.1 → 0.0.2-next.2

package/dist/{experience-instance-BA0EXYg5.js → experience-instance-DYZovD6a.js}

@@ -1,29 +1,29 @@
-import { createDomain as ft, createEvent as b, combine as O, createApi as J, sample as S, createEffect as v, attach as A, split as pt } from "effector";
-import { createFactory as Q, invoke as X } from "@withease/factories";
-import { h as lt, s as Y, a as dt } from "./supports-BvrzQAVk.js";
-import { l as P } from "./logger-C9a75KZn.js";
-import { i as mt } from "./object-JwZ58NOH.js";
-function gt(t) {
+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 { createFactory as Q, invoke as Y } from "@withease/factories";
+import { h as lt, s as Z, a as dt } from "./supports-yKVnaaMQ.js";
+import { l as D } from "./logger-C9a75KZn.js";
+import { i as gt } from "./object-JwZ58NOH.js";
+function mt(t) {
   return typeof t == "number" && !isNaN(t);
 }
-function T(t) {
+function O(t) {
   return typeof t == "string";
 }
 function w(t) {
   return Array.isArray(t);
 }
-function Z(t) {
+function tt(t) {
   return t instanceof Promise;
 }
-function K(t) {
+function z(t) {
   return typeof t == "object" && t !== null && !Array.isArray(t) && Object.keys(t).length === 1;
 }
 function d(t) {
-  if (gt(t)) return t;
+  if (mt(t)) return t;
   const e = parseFloat(`${t}`);
   return isNaN(e) ? 0 : e;
 }
-function B(t) {
+function M(t) {
   return `${t}`;
 }
 const ht = {
@@ -36,34 +36,34 @@ const ht = {
   ">": (t, e) => d(t) > d(e),
   ">=": (t, e) => d(t) >= d(e),
   "<": (t, e, r) => {
-    const n = d(t), c = d(e);
-    if (r === void 0) return n < c;
-    const i = d(r);
-    return n < c && c < i;
+    const n = d(t), i = d(e);
+    if (r === void 0) return n < i;
+    const c = d(r);
+    return n < i && i < c;
   },
   "<=": (t, e, r) => {
-    const n = d(t), c = d(e);
-    if (r === void 0) return n <= c;
-    const i = d(r);
-    return n <= c && c <= i;
+    const n = d(t), i = d(e);
+    if (r === void 0) return n <= i;
+    const c = d(r);
+    return n <= i && i <= c;
   },
-  "!!": async (t) => await E(t),
-  "!": async (t) => !await E(t),
+  "!!": 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 ? T(e) ? e.indexOf(B(t)) !== -1 : w(e) ? e.includes(t) : !1 : !1,
-  cat: (...t) => t.map(B).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 = B(t), c = d(e);
-    if (r === void 0) return n.substr(c);
-    const i = d(r);
-    if (i < 0) {
-      const o = n.substr(c);
-      return o.substr(0, o.length + i);
+    const n = M(t), i = d(e);
+    if (r === void 0) return n.substr(i);
+    const c = d(r);
+    if (c < 0) {
+      const o = n.substr(i);
+      return o.substr(0, o.length + c);
     }
-    return n.substr(c, i);
+    return n.substr(i, c);
   },
   /* eslint-enable sonarjs/deprecation */
   "+": (...t) => t.reduce((e, r) => d(e) + d(r), 0),
@@ -82,35 +82,35 @@ const ht = {
       return this;
     if (typeof t == "number" && Array.isArray(this))
       return t >= 0 && t < this.length ? this[t] : r;
-    const n = B(t);
+    const n = M(t);
     if (n === "" || n === ".")
       return this;
-    const c = n.split(".");
-    let i = this;
-    for (const o of c) {
-      if (i == null)
+    const i = n.split(".");
+    let c = this;
+    for (const o of i) {
+      if (c == null)
         return r;
-      if (Array.isArray(i)) {
+      if (Array.isArray(c)) {
         const a = parseInt(o, 10);
-        isNaN(a) ? i = i[o] : i = i[a];
+        isNaN(a) ? c = c[o] : c = c[a];
       } else
-        i = i[o];
+        c = c[o];
     }
-    return i !== void 0 ? i : r;
+    return c !== void 0 ? c : r;
   },
   async missing(...t) {
     const e = w(t[0]) ? t[0] : t, r = [];
     for (const n of e) {
-      const c = await l({ var: n }, this);
-      (c === null || c === "") && r.push(`${n}`);
+      const i = await l({ var: n }, this);
+      (i === null || i === "") && r.push(`${n}`);
     }
     return r;
   },
   async missing_some(t, e) {
     const r = await l({ missing: e }, this);
     if (!w(r) || !w(e)) return [];
-    const n = r.filter(T);
-    return e.filter(T).length - n.length >= d(t) ? [] : n;
+    const n = r.filter(O);
+    return e.filter(O).length - n.length >= d(t) ? [] : n;
   },
   // eslint-disable-next-line sonarjs/function-return-type
   invoke(t) {
@@ -119,42 +119,42 @@ const ht = {
   regexp_matches(t, e) {
     let r = t, n = "";
     if (w(t)) {
-      const [i, o] = t;
-      r = i, n = o;
+      const [c, o] = t;
+      r = c, n = o;
     }
-    return !T(r) || !T(n) ? !1 : new RegExp(r, n).test(B(e));
+    return !O(r) || !O(n) ? !1 : new RegExp(r, n).test(M(e));
   },
   throw(t) {
-    throw new Error(B(t));
+    throw new Error(M(t));
   }
 };
 async function l(t, e) {
   if (!t) return t;
-  if (Z(t))
+  if (tt(t))
     return l(await t, e);
   if (w(t))
     return Promise.all(t.map((o) => l(o, e)));
-  if (!K(t)) return t;
+  if (!z(t)) return t;
   const r = St(t);
   let n = r ? t[r] ?? [] : [];
   switch (w(n) || (n = [n]), r) {
     case "if":
     case "?:":
       for (let o = 0; o < n.length - 1; o += 2)
-        if (await E(await l(n[o], e)))
+        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;
     case "and": {
       let o = null;
       for (const a of n)
-        if (o = await l(a, e), !await E(o))
+        if (o = await l(a, 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 E(o)) return o;
+        if (o = await l(a, e), await I(o)) return o;
       return o;
     }
     case "map": {
@@ -165,7 +165,7 @@ async function l(t, e) {
       const o = await l(n[0], e);
       return w(o) ? (await Promise.all(
         o.map(async (u) => {
-          const h = await E(await l(n[1], u));
+          const h = await I(await l(n[1], u));
           return { item: u, shouldInclude: h };
         })
       )).filter(({ shouldInclude: u }) => u).map(({ item: u }) => u) : [];
@@ -176,56 +176,56 @@ async function l(t, e) {
         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;
-      for (const I of o)
-        h = await l(a, { current: I, accumulator: h });
+      for (const E of o)
+        h = await l(a, { current: E, accumulator: h });
       return h;
     }
     case "all": {
       const o = await l(n[0], e);
       if (!w(o) || o.length === 0) return !1;
       for (const a of o)
-        if (!await E(await l(n[1], a))) return !1;
+        if (!await I(await l(n[1], a))) return !1;
       return !0;
     }
     case "some": {
       const o = await l(n[0], e);
       if (!w(o)) return !1;
       for (const a of o)
-        if (await E(await l(n[1], a))) return !0;
+        if (await I(await l(n[1], a))) return !0;
       return !1;
     }
     case "none": {
       const o = await l(n[0], e);
       if (!w(o)) return !0;
       for (const a of o)
-        if (await E(await l(n[1], a))) return !1;
+        if (await I(await l(n[1], a))) return !1;
       return !0;
     }
     case "catch":
       try {
         return await l(n[0], e);
       } catch (o) {
-        return K(o) ? await l(o, e) : n[1] ? await l(n[1], o) : o instanceof Error ? o.message : o;
+        return z(o) ? await l(o, e) : n[1] ? await l(n[1], o) : o instanceof Error ? o.message : o;
       }
   }
-  const c = await Promise.all(n.map((o) => l(o, e))), i = r ? ht[r] : void 0;
-  if (!i) throw new Error(`Unrecognized operation ${r}`);
-  return i.apply(e, c);
+  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);
 }
-async function E(t) {
-  return Z(t) ? E(await t) : !(Array.isArray(t) && t.length === 0) && !!t;
+async function I(t) {
+  return tt(t) ? I(await t) : !(Array.isArray(t) && t.length === 0) && !!t;
 }
 function St(t) {
   return Object.keys(t)[0];
 }
-function $t(t) {
-  return !mt(t);
+function jt(t) {
+  return !gt(t);
 }
 async function yt(t, e, r) {
-  const n = t.getStateSnapshot(), c = t.predicates.listStore.getState().reduce((a, u) => ({
+  const n = t.getStateSnapshot(), i = t.predicates.listStore.getState().reduce((a, u) => ({
     ...a,
     [u.name]: () => u.predicate(n)
-  }), {}), i = t.features.listStore.getState().reduce((a, u) => ({
+  }), {}), c = t.features.listStore.getState().reduce((a, u) => ({
     ...a,
     [u.id]: async () => {
       const { bucket: h } = await u.getBucket();
@@ -245,184 +245,191 @@ async function yt(t, e, r) {
       protocol: n.location.protocol,
       search: n.location.search
     } : void 0,
-    predicates: c,
-    features: i
+    predicates: i,
+    features: c
   };
   return await l(e, o);
 }
 function wt(t) {
-  return !dt() || !Y() ? [] : Array.from(window.document.querySelectorAll(t)).filter(
+  return !dt() || !Z() ? [] : Array.from(window.document.querySelectorAll(t)).filter(
     (e) => e instanceof HTMLElement
   );
 }
 function xt(t) {
   if (!lt())
     throw new Error("Shadow DOM is not supported in this environment");
-  return t.attachShadow({ mode: "open" });
+  return t.attachShadow({ mode: "closed" });
 }
-function Ht() {
+function Gt() {
   return new Promise((t, e) => {
-    if (!Y()) {
+    if (!Z()) {
       e();
       return;
     }
     document.readyState !== "loading" ? t() : document.addEventListener("readystatechange", () => t(), { once: !0 });
   });
 }
-function It(t, e) {
+function Et(t, e) {
   const r = new MutationObserver((n) => {
     document.contains(t) || (r.disconnect(), e());
   });
   r.observe(document.body, { childList: !0, subtree: !0 });
 }
-const tt = "picked-root", U = "picked-target";
-function jt(t, e) {
-  return t.flatMap((r) => {
-    const n = wt(r.selector).filter(
-      (c) => !kt(c, e)
+const P = "picked-root", R = "picked-target", kt = "picked-root";
+function Kt(t, e) {
+  return [
+    ...t,
+    // Target and replace picked-root web components
+    {
+      selector: `${kt}[experience-id="${e}"]`,
+      placement: "replace"
+    }
+  ].flatMap((n) => {
+    const i = wt(n.selector).filter(
+      (c) => !It(c, e) && !Nt(c, e)
     );
     return {
-      ...r,
-      elements: n
+      ...n,
+      elements: i
     };
   });
 }
-function Ut(t) {
-  return t.flatMap((e) => e.elements.map((r) => Nt(r, e.placement)));
+function Ut(t, e) {
+  return t.flatMap((r) => r.elements.map((n) => vt(n, r.placement, e)));
 }
 function Vt(t, e) {
-  t.classList.add(U), t.classList.add(`${U}-${e}`);
+  t.classList.add(R), t.classList.add(`${R}-${e}`);
 }
-function kt(t, e) {
-  return t.classList.contains(`${U}-${e}`);
+function It(t, e) {
+  return e ? t.classList.contains(`${R}-${e}`) : t.classList.contains(`${R}`);
 }
-function qt(t) {
-  return t.classList.contains(tt);
+function Nt(t, e) {
+  return e ? t.classList.contains(`${P}-${e}`) : t.classList.contains(P);
 }
-function Et() {
-  const t = document.createElement("div");
-  return t.style.display = "block", t.classList.add(tt), t;
+function bt(t) {
+  const e = document.createElement("div");
+  return e.style.display = "block", e.classList.add(P), e.classList.add(`${P}-${t}`), e;
 }
-function Nt(t, e) {
-  let r;
-  const n = Et();
+function vt(t, e, r) {
+  let n;
+  const i = bt(r);
   if (t instanceof Document)
-    r = t.body.appendChild(n);
+    n = t.body.appendChild(i);
   else {
     switch (e) {
       case "replace":
-        t.replaceWith(n);
+        t.replaceWith(i);
         break;
       case "before":
-        t.before(n);
+        t.before(i);
         break;
       case "after":
-        t.after(n);
+        t.after(i);
         break;
       case "prepend":
-        t.prepend(n);
+        t.prepend(i);
         break;
       default:
-        t.append(n);
+        t.append(i);
         break;
     }
-    r = n;
+    n = i;
   }
-  return r;
+  return n;
 }
-function bt(t) {
+function _t(t) {
   return t.type === "conditional";
 }
-function D(t) {
+function $(t) {
   return t.type === "step";
 }
-function vt(t) {
+function At(t) {
   return t.type === "experience";
 }
-function W(t) {
+function X(t) {
   return t.type === "origin";
 }
-const et = (t, e, r, n, c = /* @__PURE__ */ new Set()) => c.has(r.id) ? [] : (c.add(r.id), D(r) && !n ? [r] : e.filter((o) => o.sourceNodeId === r.id).flatMap((o) => {
+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, c) : [];
-})), At = (t, e, r) => et(t, e, r, !0, /* @__PURE__ */ new Set()), nt = (t, e, r, n, c = /* @__PURE__ */ new Set()) => {
-  if (c.has(r.id)) return [-1, -1];
-  c.add(r.id);
-  const i = e.filter((u) => u.sourceNodeId === r.id);
-  if (i.length === 0) return [0, 0];
+  return a ? et(t, e, a, !1, i) : [];
+})), Lt = (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 i) {
+  for (const u of c) {
     const h = t.find((k) => k.id === u.destinationNodeId);
     if (!h) continue;
-    const [I, y] = nt(
+    const [E, y] = nt(
       t,
       e,
       h,
       !1,
-      new Set(c)
+      new Set(i)
     );
-    I !== -1 && (o = Math.min(o, I + 1), a = Math.max(a, y + 1));
+    E !== -1 && (o = Math.min(o, E + 1), a = Math.max(a, y + 1));
   }
   return o === 1 / 0 ? [-1, -1] : [o, a];
-}, Ft = (t, e, r) => nt(t, e, r, !0, /* @__PURE__ */ new Set()), rt = (t, e, r, n = /* @__PURE__ */ new Set()) => {
+}, 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 c = e.filter((a) => a.destinationNodeId === r.id);
-  if (c.length === 0) return [-1, -1];
-  let i = 1 / 0, o = -1 / 0;
-  for (const a of c) {
+  const i = e.filter((a) => a.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);
     if (!u) continue;
-    const [h, I] = rt(
+    const [h, E] = rt(
       t,
       e,
       u,
       new Set(n)
     );
-    h !== -1 && (i = Math.min(i, h + 1), o = Math.max(o, I + 1));
+    h !== -1 && (c = Math.min(c, h + 1), o = Math.max(o, E + 1));
   }
-  return i === 1 / 0 ? [-1, -1] : [i, o];
-}, _t = (t, e, r) => rt(t, e, r, /* @__PURE__ */ new Set()), ot = (t) => t.find((r) => r.type === "origin") || null, j = (t, e, r) => {
+  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) => {
   if (!t)
     return ot(e);
-  const n = r.find((i) => i.sourceNodeId === t.id);
+  const n = r.find((c) => c.sourceNodeId === t.id);
   if (!n)
     return null;
-  const c = e.find((i) => i.id === n.destinationNodeId);
-  return c || null;
+  const i = e.find((c) => c.id === n.destinationNodeId);
+  return i || null;
 };
 async function Bt(t, e, r, n) {
-  const c = t ? "true" : "false", i = n.find(
-    (o) => o.sourceNodeHandle === c && o.sourceNodeId === e
+  const i = t ? "true" : "false", c = n.find(
+    (o) => o.sourceNodeHandle === i && o.sourceNodeId === e
   );
-  return r.find((o) => o.id === (i == null ? void 0 : i.destinationNodeId));
+  return r.find((o) => o.id === (c == null ? void 0 : c.destinationNodeId));
 }
-const V = ft("experience-instance"), Mt = Q(
+const U = ft("experience-instance"), Ft = Q(
   ({
     client: t,
     experience: e,
     target: r
   }) => {
-    const n = b(), c = b(), i = b(), o = b(), a = e.componentStore, u = V.store("transitioning"), h = t.history.entriesStore.map((s) => s.filter((p) => p.experienceId === e.id)), I = h.map((s) => s.filter((p) => D(p.node))), y = h.map((s) => {
+    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;
-    }), k = O(
+    }), k = F(
       e.treeStore,
       y,
-      ({ steps: s }, p) => s.find((m) => p && D(p) && m.id === p.stepId) || null
-    ), R = O(
+      ({ steps: s }, p) => s.find((g) => p && $(p) && g.id === p.stepId) || null
+    ), C = F(
       e.treeStore,
       y,
-      ({ nodes: s, edges: p }, m) => m ? At(s, p, m) : []
-    ), f = O(
+      ({ nodes: s, edges: p }, g) => g ? Lt(s, p, g) : []
+    ), f = F(
       e.treeStore,
       y,
-      ({ nodes: s, edges: p }, m) => m ? _t(s, p, m) : [-1, -1]
-    ), g = O(
+      ({ nodes: s, edges: p }, g) => g ? Tt(s, p, g) : [-1, -1]
+    ), m = F(
       e.treeStore,
       y,
-      ({ nodes: s, edges: p }, m) => m ? Ft(s, p, m) : [-1, -1]
-    ), x = V.store(!0), N = J(x, {
+      ({ nodes: s, edges: p }, g) => g ? Mt(s, p, g) : [-1, -1]
+    ), x = U.store(!0), N = J(x, {
       open: () => !0,
       close: () => !1,
       toggle: (s) => !s,
@@ -443,73 +450,73 @@ const V = ft("experience-instance"), Mt = Q(
         experience: e
       }))
     });
-    const F = v(async () => {
+    const A = v(async () => {
       t.history.back({ experienceId: e.id });
-    }), M = A({
+    }), T = _({
       source: e.treeStore,
       effect: async (s, p) => {
-        const m = s.nodes.find((_) => D(_) && _.stepId === p);
-        m && t.history.push({ experienceId: e.id, node: m });
+        const g = s.nodes.find((L) => $(L) && L.stepId === p);
+        g && t.history.push({ experienceId: e.id, node: g });
       }
-    }), q = A({
+    }), V = _({
       source: y,
       effect: (s) => {
       }
-    }), C = A({
+    }), H = _({
       source: e.treeStore,
       effect: async ({ nodes: s }) => ot(s)
-    }), $ = A({
+    }), j = _({
       source: e.treeStore,
-      effect: async ({ nodes: s, edges: p }, m) => j(m, s, p)
-    }), H = A({
+      effect: async ({ nodes: s, edges: p }, g) => K(g, s, p)
+    }), G = _({
       source: e.treeStore,
-      effect: async ({ nodes: s, edges: p, conditionals: m }, _) => {
-        if (!_)
+      effect: async ({ nodes: s, edges: p, conditionals: g }, L) => {
+        if (!L)
           return;
-        const G = m.find((ut) => ut.id === _.conditionalId);
-        if (!G)
+        const q = g.find((ut) => ut.id === L.conditionalId);
+        if (!q)
           return;
-        const ct = _.id, at = await yt(t, G.condition);
+        const ct = L.id, at = await yt(t, q.condition);
         return Bt(!!at, ct, s, p);
       }
     }), st = v((s) => {
       if (s)
         return t.launchExperienceById(s.experienceId);
-    }), z = A({
+    }), W = _({
       source: [y, e.treeStore],
-      effect: async ([s, { nodes: p, edges: m }]) => j(s, p, m)
-    }), L = A({
+      effect: async ([s, { nodes: p, edges: g }]) => K(s, p, g)
+    }), B = _({
       source: [y, e.treeStore],
-      effect: async ([s, { nodes: p, edges: m }]) => j(s, p, m)
+      effect: async ([s, { nodes: p, edges: g }]) => K(s, p, g)
     }), it = v((s) => {
       t.history.push({ experienceId: e.id, node: s });
     });
     return pt({
       source: y,
-      match: (s) => s ? bt(s) ? "condition" : D(s) ? "step" : vt(s) ? "launchExperience" : W(s) ? "origin" : "other" : "none",
+      match: (s) => s ? _t(s) ? "condition" : $(s) ? "step" : At(s) ? "launchExperience" : X(s) ? "origin" : "other" : "none",
       cases: {
-        none: C,
-        origin: $,
-        condition: H,
-        step: q,
+        none: H,
+        origin: j,
+        condition: G,
+        step: V,
         launchExperience: st,
         __: b()
       }
     }), S({
       clock: [
+        G.doneData,
+        j.doneData,
         H.doneData,
-        $.doneData,
-        C.doneData,
-        L.doneData,
-        z.doneData
+        B.doneData,
+        W.doneData
       ],
       filter: Boolean,
       target: it
     }), S({
-      clock: c,
-      target: L
+      clock: i,
+      target: B
     }), S({
-      clock: c,
+      clock: i,
       source: k,
       target: t.eventBus.prepend((s) => ({
         type: "step_submit",
@@ -517,7 +524,7 @@ const V = ft("experience-instance"), Mt = Q(
         experience: e
       }))
     }), S({
-      clock: L.done,
+      clock: B.done,
       source: k,
       target: t.eventBus.prepend((s) => ({
         type: "step_submit_success",
@@ -525,7 +532,7 @@ const V = ft("experience-instance"), Mt = Q(
         experience: e
       }))
     }), S({
-      clock: L.fail,
+      clock: B.fail,
       source: k,
       target: t.eventBus.prepend((s) => ({
         type: "step_submit_error",
@@ -533,27 +540,27 @@ const V = ft("experience-instance"), Mt = Q(
         experience: e
       }))
     }), S({
-      clock: i,
-      target: F
+      clock: c,
+      target: A
     }), S({
-      clock: i,
+      clock: c,
       source: k,
       target: t.eventBus.prepend((s) => ({
         type: "step_submit",
         step: s ?? void 0,
         experience: e
       }))
-    }), S({ clock: o, target: M }), S({
-      source: O([
+    }), S({ clock: o, target: T }), S({
+      source: F([
+        G.pending,
+        j.pending,
         H.pending,
-        $.pending,
-        C.pending,
-        L.pending
+        B.pending
       ]),
       fn: (s) => s.some(Boolean) ? "transitioning" : "ready",
       target: u
     }), S({
-      clock: q.doneData,
+      clock: V.doneData,
       source: k,
       target: t.eventBus.prepend((s) => ({
         type: "step_enter",
@@ -563,8 +570,8 @@ const V = ft("experience-instance"), Mt = Q(
     }), S({
       source: y,
       clock: n,
-      filter: (s) => s ? W(s) : !0,
-      target: z
+      filter: (s) => s ? X(s) : !0,
+      target: W
     }), n(), {
       // config
       experienceId: e.id,
@@ -583,35 +590,35 @@ const V = ft("experience-instance"), Mt = Q(
       treeStore: e.treeStore,
       currentNodeStore: y,
       currentStepStore: k,
-      nextReachableStepNodesStore: R,
+      nextReachableStepNodesStore: C,
       stepsToOriginStore: f,
-      stepsToLeafStore: g,
+      stepsToLeafStore: m,
       // history
-      goToNextStep: c,
-      goToPreviousStep: i,
+      goToNextStep: i,
+      goToPreviousStep: c,
       goToStepById: o,
-      stepsHistoryStore: I
+      stepsHistoryStore: E
     };
   }
 );
-function Lt(t) {
-  return X(Mt, t);
+function Ot(t) {
+  return Y(Ft, t);
 }
-const Ot = Q(({ client: t }) => {
-  const e = V.store({}), r = b(), n = b(), c = b(), i = J(e, {
-    register(f, g) {
+const $t = Q(({ client: t }) => {
+  const e = U.store({}), r = b(), n = b(), i = b(), c = J(e, {
+    register(f, m) {
       const x = [
-        ...f[g.experienceId] ?? []
+        ...f[m.experienceId] ?? []
       ];
-      return x.push(g), {
+      return x.push(m), {
         ...f,
-        [g.experienceId]: x
+        [m.experienceId]: x
       };
     },
-    unregister(f, g) {
-      var F;
-      const x = g.experienceId, N = (F = f[x]) == null ? void 0 : F.filter(
-        (M) => M !== g
+    unregister(f, m) {
+      var A;
+      const x = m.experienceId, N = (A = f[x]) == null ? void 0 : A.filter(
+        (T) => T !== m
       );
       return {
         ...f,
@@ -619,51 +626,51 @@ const Ot = Q(({ client: t }) => {
       };
     }
   }), o = v(
-    ({ experience: f, target: g }) => Lt({ client: t, experience: f, target: g })
+    ({ experience: f, target: m }) => Ot({ client: t, experience: f, target: m })
   ), a = v((f) => {
-    i.register(f);
+    c.register(f);
   }), u = v(
     (f) => {
-      f.target && It(f.target, () => {
-        c(f);
+      f.target && Et(f.target, () => {
+        i(f);
       });
     }
   ), h = v((f) => {
-    i.unregister(f);
-  }), I = v((f) => {
-    const g = f.componentStore.getState();
-    if (!g) {
-      P("warn", "No app component registered. Skipping init.");
+    c.unregister(f);
+  }), E = v((f) => {
+    const m = f.componentStore.getState();
+    if (!m) {
+      D("warn", "No app component registered. Skipping init.");
       return;
     }
-    const x = g.frameworkStore.getState();
+    const x = m.frameworkStore.getState();
     if (!x) {
-      P(
+      D(
         "error",
-        `No framework registered for component '${g.name}'. Skipping rendering.`
+        `No framework registered for component '${m.name}'. Skipping rendering.`
       );
       return;
     }
     const N = f.target;
     if (!N) {
-      P(
+      D(
         "error",
         `No target element registered for experience '${f.experienceId}'. Skipping rendering.`
       );
       return;
     }
-    const F = xt(N);
+    const A = xt(N);
     try {
-      x.render(F, g.component, t, f);
-    } catch (M) {
-      P("error", M);
+      x.render(A, m.component, t, f);
+    } catch (T) {
+      D("error", T);
     }
   });
   S({
     clock: r,
     target: o
   }), S({
-    clock: c,
+    clock: i,
     target: h
   }), S({
     clock: o.doneData,
@@ -680,33 +687,33 @@ const Ot = Q(({ client: t }) => {
     }))
   }), S({
     clock: n,
-    target: I
+    target: E
   });
-  function y(f, g) {
-    r({ experience: f, target: g });
+  function y(f, m) {
+    r({ experience: f, target: m });
   }
   const k = e.map((f) => Object.values(f).flat());
-  function R(f) {
-    return e.map((g) => g[f] || [], { skipVoid: !1 });
+  function C(f) {
+    return e.map((m) => m[f] || [], { skipVoid: !1 });
   }
   return {
     spawn: y,
-    getByExperienceId: R,
+    getByExperienceId: C,
     listStore: k
   };
 });
-function zt(t) {
-  return X(Ot, t);
+function Wt(t) {
+  return Y($t, t);
 }
 export {
-  D as a,
-  zt as b,
+  $ as a,
+  Wt as b,
   Ut as c,
-  Ht as d,
+  Gt as d,
   yt as e,
-  qt as f,
-  jt as g,
-  Lt as h,
-  $t as i,
+  Nt as f,
+  Kt as g,
+  Ot as h,
+  jt as i,
   Vt as t
 };