@picked/client 0.0.98-next.1 → 0.0.98-next.3

package/dist/{experience-instance-DptBuxBJ.js → experience-instance-4KUBH8Gb.js}

@@ -10,13 +10,13 @@ function m(e) {
 function h(e) {
 	return e.type === "step";
 }
-function ee(e) {
+function g(e) {
 	return e.type === "experience";
 }
-function g(e) {
+function _(e) {
 	return e.type === "origin";
 }
-function _(e) {
+function ee(e) {
 	return e.type === "action";
 }
 //#endregion
@@ -43,7 +43,7 @@ var v = [], y = (e, t) => {
 		e !== void 0 && r.push(e);
 	}
 	return r;
-}, D = (e, t) => {
+}, te = (e, t) => {
 	let n = /* @__PURE__ */ new Map();
 	t.forEach((e, t) => {
 		n.set(e, t);
@@ -64,7 +64,7 @@ var v = [], y = (e, t) => {
 		let s = e.nodeById.get(t)?.type === "origin";
 		r.isOrigin.push(s), s && r.origins.push(i);
 	}), r;
-}, O = (e, t, n) => {
+}, D = (e, t, n) => {
 	let r = w(n, S), i = [...e];
 	for (let t of e) r[t] = 0;
 	let a = 0, o = 0;
@@ -79,28 +79,28 @@ var v = [], y = (e, t) => {
 		values: r,
 		visits: a
 	};
-}, k = (e, t) => {
+}, O = (e, t) => {
 	e.discoveryOf[t] = e.counter, e.lowLinkOf[t] = e.counter, e.counter += 1, e.stack.push(t), e.onStack[t] = !0, e.frames.push({
 		node: t,
 		edge: 0
 	}), e.visits += 1;
-}, te = (e, t) => {
+}, ne = (e, t) => {
 	let n = (e.successors[t.node] ?? [])[t.edge];
 	if (t.edge += 1, n !== void 0) {
 		if (e.discoveryOf[n] === S) {
-			k(e, n);
+			O(e, n);
 			return;
 		}
 		e.onStack[n] && (e.lowLinkOf[t.node] = Math.min(e.lowLinkOf[t.node] ?? 0, e.discoveryOf[n] ?? 0));
 	}
-}, ne = (e, t) => {
+}, k = (e, t) => {
 	e.frames.pop(), e.visits += 1;
 	let n = e.frames.at(-1);
 	if (n && (e.lowLinkOf[n.node] = Math.min(e.lowLinkOf[n.node] ?? 0, e.lowLinkOf[t.node] ?? 0)), e.lowLinkOf[t.node] !== e.discoveryOf[t.node]) return;
 	let r = [], i = e.stack.pop();
 	for (; i !== void 0 && (e.onStack[i] = !1, e.componentOf[i] = e.members.length, r.push(i), i !== t.node);) i = e.stack.pop();
 	e.members.push(r);
-}, A = (e, t) => {
+}, re = (e, t) => {
 	let n = {
 		successors: e,
 		discoveryOf: w(t, S),
@@ -113,17 +113,17 @@ var v = [], y = (e, t) => {
 		counter: 0,
 		visits: 0
 	};
-	for (let r = 0; r < t; r += 1) if (n.discoveryOf[r] === S) for (k(n, r); n.frames.length > 0;) {
+	for (let r = 0; r < t; r += 1) if (n.discoveryOf[r] === S) for (O(n, r); n.frames.length > 0;) {
 		let t = n.frames.at(-1);
 		if (!t) break;
-		t.edge < (e[t.node] ?? []).length ? te(n, t) : ne(n, t);
+		t.edge < (e[t.node] ?? []).length ? ne(n, t) : k(n, t);
 	}
 	return {
 		componentOf: n.componentOf,
 		members: n.members,
 		visits: n.visits
 	};
-}, j = (e, t, n) => {
+}, A = (e, t, n) => {
 	let r = C;
 	for (let i of e.adjacency[t] ?? []) {
 		let t = e.components.componentOf[i] ?? S;
@@ -132,17 +132,17 @@ var v = [], y = (e, t) => {
 		a !== C && (r = Math.max(r, a + 1));
 	}
 	return r;
-}, M = (e, t) => {
+}, j = (e, t) => {
 	let n = C;
 	for (let r of e.components.members[t] ?? []) {
 		if (e.isTerminus[r]) {
 			n = Math.max(n, 0);
 			continue;
 		}
-		n = Math.max(n, j(e, r, t));
+		n = Math.max(n, A(e, r, t));
 	}
 	return n;
-}, N = (e, t, n, r) => {
+}, M = (e, t, n, r) => {
 	let i = n.members.length, a = {
 		adjacency: e,
 		isTerminus: t,
@@ -152,7 +152,7 @@ var v = [], y = (e, t) => {
 	for (let e = 0; e < i; e += 1) {
 		let t = r ? i - 1 - e : e, s = (n.members[t] ?? []).length;
 		o += s;
-		let c = M(a, t);
+		let c = j(a, t);
 		a.perComponent[t] = c === C ? C : c + s - 1;
 	}
 	return {
@@ -163,54 +163,54 @@ var v = [], y = (e, t) => {
 		}),
 		visits: o
 	};
-}, P = (e, t, n) => {
+}, N = (e, t, n) => {
 	let r = /* @__PURE__ */ new Map();
 	return e.forEach((e, i) => {
 		let a = t.values[i] ?? S, o = n.values[i] ?? S;
 		r.set(e, a === S ? [S, S] : [a, o]);
 	}), r;
-}, re = (e, t) => {
-	let n = y(e, t), r = [...n.nodeById.keys()], i = r.length, a = D(n, r), o = A(a.successors, i), s = O(a.leaves, a.predecessors, i), c = N(a.successors, a.isLeaf, o, !1), l = O(a.origins, a.successors, i), u = N(a.predecessors, a.isOrigin, o, !0);
+}, ie = (e, t) => {
+	let n = y(e, t), r = [...n.nodeById.keys()], i = r.length, a = te(n, r), o = re(a.successors, i), s = D(a.leaves, a.predecessors, i), c = M(a.successors, a.isLeaf, o, !1), l = D(a.origins, a.successors, i), u = M(a.predecessors, a.isOrigin, o, !0);
 	return {
 		...n,
-		stepsToLeaf: P(r, s, c),
-		stepsToOrigin: P(r, l, u),
+		stepsToLeaf: N(r, s, c),
+		stepsToOrigin: N(r, l, u),
 		nodeVisits: o.visits + s.visits + c.visits + l.visits + u.visits
 	};
-}, F = (e, t, n) => {
+}, P = (e, t, n) => {
 	let r = Infinity, i = C;
 	for (let a of t) {
 		let t = e.get(a[n]);
 		!t || t[0] === S || (r = Math.min(r, t[0] + 1), i = Math.max(i, t[1] + 1));
 	}
 	return r === Infinity ? [S, S] : [r, i];
-}, ie = (e, t) => {
+}, ae = (e, t) => {
 	let n = e.stepsToLeaf.get(t.id);
 	if (n) return [n[0], n[1]];
 	let r = b(e, t.id);
-	return r.length === 0 ? [0, 0] : F(e.stepsToLeaf, r, "destinationNodeId");
-}, ae = (e, t) => {
+	return r.length === 0 ? [0, 0] : P(e.stepsToLeaf, r, "destinationNodeId");
+}, oe = (e, t) => {
 	let n = e.stepsToOrigin.get(t.id);
-	return n ? [n[0], n[1]] : t.type === "origin" ? [0, 0] : F(e.stepsToOrigin, x(e, t.id), "sourceNodeId");
-}, I = "conditions.", L = s("condition-results");
-function R(e) {
+	return n ? [n[0], n[1]] : t.type === "origin" ? [0, 0] : P(e.stepsToOrigin, x(e, t.id), "sourceNodeId");
+}, F = "conditions.", I = s("condition-results");
+function L(e) {
 	return typeof e == "object" && !!e && !Array.isArray(e);
 }
-function z(e) {
+function R(e) {
 	if (e === void 0) return null;
-	if (Array.isArray(e)) return e.map((e) => z(e));
-	if (R(e)) {
+	if (Array.isArray(e)) return e.map((e) => R(e));
+	if (L(e)) {
 		let t = Object.keys(e).sort((e, t) => e.localeCompare(t)), n = {};
-		for (let r of t) n[r] = z(e[r]);
+		for (let r of t) n[r] = R(e[r]);
 		return n;
 	}
 	return e;
 }
-function B(e) {
-	return JSON.stringify(z(e));
+function se(e) {
+	return JSON.stringify(R(e));
 }
-var oe = f(() => {
-	let e = L.store({}), t = o(e, {
+var ce = f(() => {
+	let e = I.store({}), t = o(e, {
 		set(e, t) {
 			return e[t.hash] === t.result ? e : {
 				...e,
@@ -247,118 +247,118 @@ var oe = f(() => {
 		reset: i
 	};
 });
-function V() {
-	return p(oe);
+function z() {
+	return p(ce);
 }
-async function H(n, r, i) {
+async function B(n, r, i) {
 	return r == null ? !0 : typeof r == "boolean" ? r : !e(r) || await t(n, r, i) === !0;
 }
-function U(e) {
+function V(e) {
 	if (typeof e == "string") return e;
 	if (Array.isArray(e) && typeof e[0] == "string") return e[0];
 }
-function W(e) {
-	if (Array.isArray(e)) return e.some(W);
-	if (R(e)) {
-		let t = U(e.var);
-		return t !== void 0 && (t === "actions" || t.startsWith("actions.")) ? !0 : Object.values(e).some(W);
+function H(e) {
+	if (Array.isArray(e)) return e.some(H);
+	if (L(e)) {
+		let t = V(e.var);
+		return t !== void 0 && (t === "actions" || t.startsWith("actions.")) ? !0 : Object.values(e).some(H);
 	}
 	return !1;
 }
-function G(e) {
-	if (Array.isArray(e)) return e.flatMap(G);
-	if (R(e)) {
-		let t = U(e.var);
-		return [...t !== void 0 && t.startsWith(I) ? [t.slice(11)] : [], ...Object.values(e).flatMap(G)];
+function U(e) {
+	if (Array.isArray(e)) return e.flatMap(U);
+	if (L(e)) {
+		let t = V(e.var);
+		return [...t !== void 0 && t.startsWith(F) ? [t.slice(11)] : [], ...Object.values(e).flatMap(U)];
 	}
 	return [];
 }
-function K(e, t, n = /* @__PURE__ */ new Set()) {
-	if (W(e)) return !0;
-	for (let r of G(e)) {
+function W(e, t, n = /* @__PURE__ */ new Set()) {
+	if (H(e)) return !0;
+	for (let r of U(e)) {
 		if (n.has(r)) continue;
 		n.add(r);
 		let e = t[r];
-		if (e !== void 0 && K(e.logic, t, n)) return !0;
+		if (e !== void 0 && W(e.logic, t, n)) return !0;
 	}
 	return !1;
 }
-async function q(e, t, n) {
+async function G(e, t, n) {
 	let r = {};
 	for (let t of e.conditions.listStore.getState()) r[t.key] = t;
-	let i = K(t, r), a = B(t);
+	let i = W(t, r), a = se(t);
 	if (!i) {
 		let t = e.conditionResults.peek(a);
 		if (t !== void 0) return t;
 	}
-	let o = await H(e, t, n?.context);
+	let o = await B(e, t, n?.context);
 	return i || e.conditionResults.set({
 		hash: a,
 		result: o
 	}), o;
 }
-async function J(e, t, n) {
+async function le(e, t, n) {
 	let r = n?.context, i = [
 		n?.precondition,
 		n?.condition,
 		t.condition
 	];
-	for (let t of i) if (!await q(e, t, { context: r })) return !1;
+	for (let t of i) if (!await G(e, t, { context: r })) return !1;
 	return !0;
 }
 //#endregion
 //#region src/utils/node-tree/next-reachable-step-nodes.ts
-var Y = (e, t, n, r) => r.has(t.id) ? [] : (r.add(t.id), h(t) && !n ? [t] : b(e, t.id).flatMap((t) => {
+var K = (e, t, n, r) => r.has(t.id) ? [] : (r.add(t.id), h(t) && !n ? [t] : b(e, t.id).flatMap((t) => {
 	let n = e.nodeById.get(t.destinationNodeId);
-	return n ? Y(e, n, !1, r) : [];
-})), se = (e, t) => Y(e, t, !0, /* @__PURE__ */ new Set()), ce = (e) => e.find((e) => e.type === "origin") || null, X = (e, t, n) => {
-	if (!e) return ce(t);
+	return n ? K(e, n, !1, r) : [];
+})), ue = (e, t) => K(e, t, !0, /* @__PURE__ */ new Set()), de = (e) => e.find((e) => e.type === "origin") || null, q = (e, t, n) => {
+	if (!e) return de(t);
 	let r = n.find((t) => t.sourceNodeId === e.id);
 	return r && t.find((e) => e.id === r.destinationNodeId) || null;
 };
 //#endregion
 //#region src/utils/node-tree/get-next-node-from-condition.ts
-async function le(e, t, n, r) {
+async function fe(e, t, n, r) {
 	let i = e ? "true" : "false", a = r.find((e) => e.sourceHandle === i && e.sourceNodeId === t);
 	return n.find((e) => e.id === a?.destinationNodeId);
 }
 //#endregion
 //#region src/utils/node-tree/get-next-node-from-action.ts
-function ue(e, t, n, r) {
+function pe(e, t, n, r) {
 	let i = r.filter((e) => e.sourceNodeId === t), a = e ? "true" : "false", o = i.find((e) => e.sourceHandle === a) ?? i.find((e) => e.sourceHandle == null);
 	return n.find((e) => e.id === o?.destinationNodeId);
 }
 //#endregion
 //#region src/entities/experience-instance/experience-instance.ts
-var Z = s("experience-instance"), de = /* @__PURE__ */ new WeakMap(), fe = f(({ client: r, experience: s, target: f, options: p, deferOpen: v, slotOpen: y }) => {
-	let b = l(), x = l(), S = l(), C = l(), w = l(), T = l(), E = l(), D = l(), O = l(), k = s.componentStore, te = Z.store("transitioning"), ne = r.history.entriesStore.map((e) => e.filter((e) => e.experienceId === s.id)), A = ne.map((e) => e.filter((e) => h(e.node))), j = ne.map((e) => e.at(-1)?.node || null), M = Z.store(null);
+var J = s("experience-instance"), Y = /* @__PURE__ */ new WeakMap(), me = f(({ client: r, experience: s, target: f, options: p, deferOpen: v, slotOpen: y }) => {
+	let b = l(), x = l(), S = l(), C = l(), w = l(), T = l(), E = l(), te = l(), D = l(), O = s.componentStore, ne = J.store("transitioning"), k = r.history.entriesStore.map((e) => e.filter((e) => e.experienceId === s.id)), re = k.map((e) => e.filter((e) => h(e.node))), A = k.map((e) => e.at(-1)?.node || null), j = J.store(null);
 	u({
 		clock: [
-			j,
+			A,
 			r.steps.listStore,
 			T
 		],
 		source: {
 			steps: r.steps.listStore,
-			node: j
+			node: A
 		},
 		filter: ({ node: e }) => e !== null && h(e),
 		fn: ({ steps: e, node: t }) => t && h(t) ? e.find((e) => e.id === t.stepId) ?? null : null,
-		target: M
+		target: j
 	});
-	let N = a(r.steps.listStore, A, (e, t) => {
+	let M = a(r.steps.listStore, re, (e, t) => {
 		let n = t.at(-2);
 		if (!n || !h(n.node)) return null;
 		let r = n.node;
 		return e.find((e) => e.id === r.stepId) || null;
-	}), P = a(s.nodeTreeStore, j, (e, t) => t ? se(e, t) : []), re = a(s.nodeTreeStore, j, (e, t) => t ? ae(e, t) : [-1, -1]), F = a(s.nodeTreeStore, j, (e, t) => t ? ie(e, t) : [-1, -1]), I = Z.store(!v).on(D, (e, t) => t), L = Z.store(!1), R = o(L, {
+	}), N = a(s.nodeTreeStore, A, (e, t) => t ? ue(e, t) : []), ie = a(s.nodeTreeStore, A, (e, t) => t ? oe(e, t) : [-1, -1]), P = a(s.nodeTreeStore, A, (e, t) => t ? ae(e, t) : [-1, -1]), F = J.store(!v).on(te, (e, t) => t), I = J.store(!1), L = o(I, {
 		open: () => !0,
 		close: () => !1,
 		toggle: (e) => !e,
 		set: (e, t) => t
-	}), z = c(async () => {
+	}), R = c(async () => {
 		r.history.back({ experienceId: s.id });
-	}), B = i({
+	}), se = i({
 		source: s.treeStore,
 		effect: async (e, t) => {
 			let n = e.nodes.find((e) => h(e) && e.stepId === t);
@@ -367,7 +367,7 @@ var Z = s("experience-instance"), de = /* @__PURE__ */ new WeakMap(), fe = f(({
 				node: n
 			});
 		}
-	}), oe = i({
+	}), ce = i({
 		source: s.treeStore,
 		effect: async (e, t) => {
 			let n = e.steps.find((e) => e.key === t);
@@ -378,84 +378,137 @@ var Z = s("experience-instance"), de = /* @__PURE__ */ new WeakMap(), fe = f(({
 				node: i
 			});
 		}
-	}), V = i({
-		source: j,
-		effect: (e) => {}
-	}), H = i({
+	}), z = c(() => void 0), B = i({
 		source: s.treeStore,
-		effect: async ({ nodes: e }) => ce(e)
-	}), U = i({
+		effect: async ({ nodes: e }) => de(e)
+	}), V = i({
 		source: s.treeStore,
 		effect: async ({ nodes: e, edges: t }, n) => {
-			if (g(n)) return X(n, e, t);
+			if (_(n)) return q(n, e, t);
 		}
-	}), W = i({
-		source: s.treeStore,
-		effect: async ({ nodes: e, edges: n, conditions: i }, a) => {
-			if (!m(a)) return;
-			let o = i.find((e) => e.id === a.conditionId)?.logic;
-			return o ? le(!!await t(r, o), a.id, e, n) : void 0;
+	}), H = i({
+		source: {
+			tree: s.treeStore,
+			history: k
+		},
+		effect: async ({ tree: e, history: n }, i) => {
+			let { nodes: a, edges: o, conditions: s } = e, c = n.at(-1), l = m(i) ? s.find((e) => e.id === i.conditionId)?.logic : void 0;
+			if (!m(i) || !l) return {
+				next: null,
+				startedFrom: c
+			};
+			try {
+				return {
+					next: await fe(!!await t(r, l), i.id, a, o) ?? null,
+					startedFrom: c
+				};
+			} catch {
+				return `${i.id}`, {
+					next: null,
+					startedFrom: c
+				};
+			}
 		}
-	}), G = i({
+	}), U = i({
 		source: {
 			tree: s.treeStore,
 			actions: r.actions.listStore,
-			snapshot: r.stateSnapshotStore
+			snapshot: r.stateSnapshotStore,
+			history: k
 		},
-		effect: async ({ tree: e, actions: t, snapshot: n }, r) => {
-			let { nodes: i, edges: a } = e;
-			if (!_(r)) return;
-			let o = r.actionKey;
-			if (!o) {
-				`${r.id}`;
-				return;
-			}
-			let s = t.find((e) => e.key === o)?.action;
-			if (typeof s != "function") return `${o}`, ue(!1, r.id, i, a) ?? null;
-			let c = !0;
+		effect: async ({ tree: e, actions: t, snapshot: n, history: r }, i) => {
+			let { nodes: a, edges: o } = e, s = r.at(-1);
+			if (!ee(i)) return {
+				next: null,
+				startedFrom: s
+			};
+			let c = i.actionKey;
+			if (!c) return `${i.id}`, {
+				next: null,
+				startedFrom: s
+			};
+			let l = t.find((e) => e.key === c)?.action;
+			if (typeof l != "function") return `${c}`, {
+				next: pe(!1, i.id, a, o) ?? null,
+				startedFrom: s
+			};
+			let u = new AbortController(), d = k.watch((e) => {
+				e.at(-1) !== s && u.abort();
+			}), f = !0;
 			try {
-				`${o}`, await s({
+				`${c}`, await l({
 					...n,
-					args: []
+					args: [],
+					signal: u.signal
 				}, { experience: $ });
 			} catch {
-				`${o}`, c = !1;
+				u.signal.aborted || `${c}`, f = !1;
+			} finally {
+				d();
 			}
-			let l = ue(c, r.id, i, a);
-			if (!l) {
-				let e = a.some((e) => e.sourceNodeId === r.id) ? "no edge for its outcome" : "no outgoing edge";
-				return `${r.id}${e}`, null;
+			if (u.signal.aborted) return `${c}${i.id}`, {
+				next: null,
+				startedFrom: s
+			};
+			let p = pe(f, i.id, a, o);
+			if (!p) {
+				let e = o.some((e) => e.sourceNodeId === i.id) ? "no edge for its outcome" : "no outgoing edge";
+				return `${i.id}${e}`, {
+					next: null,
+					startedFrom: s
+				};
 			}
-			return `${o}${l.id}`, l;
+			return `${c}${p.id}`, {
+				next: p,
+				startedFrom: s
+			};
 		}
-	}), K = c((e) => {
-		ee(e) && r.experiences.launch({ key: e.experienceKey });
-	}), q = i({
-		source: [j, s.treeStore],
-		effect: async ([e, { nodes: t, edges: n }]) => X(e, t, n)
-	}), J = i({
-		source: [j, s.treeStore],
-		effect: async ([e, { nodes: t, edges: n }]) => X(e, t, n)
-	}), Y = i({
-		source: I,
+	}), W = l(), G = l(), le = J.store(null).on(W, (e, t) => t).on(G, (e, t) => e === t ? null : e);
+	u({
+		clock: [H, U],
+		source: k,
+		fn: (e) => e.at(-1) ?? null,
+		target: W
+	});
+	let K = l();
+	u({
+		clock: [H.doneData, U.doneData],
+		fn: (e) => e.startedFrom ?? null,
+		target: G
+	}), u({
+		clock: [H.doneData, U.doneData],
+		source: k,
+		fn: (e, t) => e.at(-1) === t.startedFrom ? t.next : null,
+		target: K
+	});
+	let me = a(le, k, (e, t) => e !== null && e === t.at(-1)), X = me.map((e) => !e), he = c((e) => {
+		g(e) && r.experiences.launch({ key: e.experienceKey });
+	}), Z = i({
+		source: [A, s.treeStore],
+		effect: async ([e, { nodes: t, edges: n }]) => q(e, t, n)
+	}), Q = i({
+		source: [A, s.treeStore],
+		effect: async ([e, { nodes: t, edges: n }]) => q(e, t, n)
+	}), ge = i({
+		source: F,
 		effect: (e, t) => {
 			e && r.history.push({
 				experienceId: s.id,
 				node: t
 			});
 		}
-	}), fe = i({
+	}), _e = i({
 		source: s.configStore,
 		effect: async ({ initializeOpenLogic: n }) => p?.initialiseOpen === void 0 ? n == null ? y === "rendered" : e(n) ? !!await t(r, n) : n : p.initialiseOpen
-	}), Q = a(k, r.frameworks.listStore, (e, t) => {
+	}), ve = a(O, r.frameworks.listStore, (e, t) => {
 		if (!e) return null;
 		let n = t.find((t) => t.name === e.component.frameworkName);
 		return n ? {
 			component: e,
 			framework: n
 		} : null;
-	}, { skipVoid: !1 }), $, pe = i({
-		source: Q,
+	}, { skipVoid: !1 }), $, ye = i({
+		source: ve,
 		effect: (e) => {
 			if (!e) return;
 			if (!f) {
@@ -475,169 +528,174 @@ var Z = s("experience-instance"), de = /* @__PURE__ */ new WeakMap(), fe = f(({
 		experienceName: s.name,
 		configStore: s.configStore,
 		target: f,
-		componentStore: k,
-		componentAndFrameworkStore: Q,
-		stateStore: te,
-		isOpenStore: L,
-		open: R.open,
-		close: R.close,
-		toggleOpen: R.toggle,
-		setOpen: R.set,
+		componentStore: O,
+		componentAndFrameworkStore: ve,
+		stateStore: ne,
+		isOpenStore: I,
+		open: L.open,
+		close: L.close,
+		toggleOpen: L.toggle,
+		setOpen: L.set,
 		treeStore: s.treeStore,
-		currentNodeStore: j,
-		currentStepStore: M,
-		previousStepStore: N,
-		nextReachableStepNodesStore: P,
-		stepsToOriginStore: re,
-		stepsToLeafStore: F,
+		currentNodeStore: A,
+		currentStepStore: j,
+		previousStepStore: M,
+		nextReachableStepNodesStore: N,
+		stepsToOriginStore: ie,
+		stepsToLeafStore: P,
 		goToNextStep: x,
 		goToPreviousStep: S,
 		goToStepById: C,
 		goToStepByKey: w,
-		stepsHistoryStore: A,
-		mountFx: pe
+		stepsHistoryStore: re,
+		mountFx: ye
 	});
-	let me = l(), he = l();
-	return u({
-		clock: j,
-		filter: I,
-		target: me
+	let be = l(), xe = l();
+	u({
+		clock: A,
+		filter: F,
+		target: be
 	}), u({
-		clock: me,
+		clock: be,
 		filter: (e) => e === null,
-		target: H
+		target: B
 	}), u({
-		clock: me,
+		clock: be,
 		filter: (e) => e !== null,
-		target: he
+		target: xe
 	}), d({
-		source: he,
-		match: (e) => m(e) ? "condition" : h(e) ? "step" : ee(e) ? "launchExperience" : g(e) ? "origin" : _(e) ? "action" : "other",
+		source: xe,
+		match: (e) => m(e) ? "condition" : h(e) ? "step" : g(e) ? "launchExperience" : _(e) ? "origin" : ee(e) ? "action" : "other",
 		cases: {
-			origin: U,
-			condition: W,
-			step: V,
-			launchExperience: K,
-			action: G,
+			origin: V,
+			condition: H,
+			step: z,
+			launchExperience: he,
+			action: U,
 			__: l()
 		}
 	}), u({
 		clock: [
-			W.doneData,
-			U.doneData,
-			H.doneData,
-			J.doneData,
-			q.doneData,
-			G.doneData
+			V.doneData,
+			B.doneData,
+			Q.doneData,
+			Z.doneData,
+			K
 		],
 		filter: Boolean,
-		target: Y
-	}), u({
+		target: ge
+	});
+	let Se = u({
 		clock: x,
-		target: J
+		filter: X
+	});
+	return u({
+		clock: Se,
+		target: Q
 	}), u({
-		clock: x,
-		source: M,
+		clock: Se,
+		source: j,
 		filter: Boolean,
-		target: O.prepend((e) => ({
+		target: D.prepend((e) => ({
 			type: "step_submit",
 			step: e,
 			experience: $
 		}))
 	}), u({
-		clock: J.done,
-		source: M,
+		clock: Q.done,
+		source: j,
 		filter: Boolean,
-		target: O.prepend((e) => ({
+		target: D.prepend((e) => ({
 			type: "step_submit_success",
 			step: e,
 			experience: $
 		}))
 	}), u({
-		clock: J.fail,
-		source: M,
+		clock: Q.fail,
+		source: j,
 		filter: Boolean,
-		target: O.prepend((e) => ({
+		target: D.prepend((e) => ({
 			type: "step_submit_error",
 			step: e,
 			experience: $
 		}))
 	}), u({
 		clock: S,
-		target: z
+		target: R
 	}), u({
 		clock: C,
-		target: B
+		filter: X,
+		target: se
 	}), u({
 		clock: w,
-		target: oe
+		filter: X,
+		target: ce
 	}), u({
 		source: a([
-			W.pending,
-			U.pending,
-			H.pending,
-			J.pending,
-			q.pending,
-			G.pending
+			V.pending,
+			B.pending,
+			Q.pending,
+			Z.pending,
+			me
 		]),
 		fn: (e) => e.some(Boolean) ? "transitioning" : "ready",
-		target: te
+		target: ne
 	}), u({
-		clock: V.doneData,
-		source: M,
+		clock: z.doneData,
+		source: j,
 		filter: Boolean,
-		target: O.prepend((e) => ({
+		target: D.prepend((e) => ({
 			type: "step_enter",
 			step: e,
 			experience: $
 		}))
 	}), u({
 		clock: E,
-		target: fe
+		target: _e
 	}), u({
-		clock: fe.doneData,
-		filter: I,
+		clock: _e.doneData,
+		filter: F,
 		fn: Boolean,
-		target: L
+		target: I
 	}), u({
-		source: j,
+		source: A,
 		clock: b,
-		filter: (e) => !e || g(e),
-		target: q
+		filter: (e) => !e || _(e),
+		target: Z
 	}), u({
-		source: L,
+		source: I,
 		filter: Boolean,
 		target: b
 	}), u({
-		source: L,
+		source: I,
 		filter: Boolean,
-		target: O.prepend(() => ({
+		target: D.prepend(() => ({
 			type: "experience_open",
 			experience: $
 		}))
 	}), u({
-		source: L,
+		source: I,
 		filter: (e) => !e,
-		target: O.prepend(() => ({
+		target: D.prepend(() => ({
 			type: "experience_close",
 			experience: $
 		}))
 	}), u({
-		clock: O,
-		filter: I,
+		clock: D,
+		filter: F,
 		target: r.eventBus
-	}), v ? de.set($, (e) => {
-		e && R.close(), D(e), e && E();
+	}), v ? Y.set($, (e) => {
+		e && L.close(), te(e), e && E();
 	}) : u({
 		clock: T,
 		target: E
 	}), T(), $;
 });
-function Q(e) {
-	return p(fe, e);
+function X(e) {
+	return p(me, e);
 }
-var $ = f(({ client: e }) => {
-	let t = Z.store({}), n = l(), i = l(), a = l(), s = o(t, {
+var he = f(({ client: e }) => {
+	let t = J.store({}), n = l(), i = l(), a = l(), s = o(t, {
 		register(e, t) {
 			let n = [...e[t.experienceId] ?? []];
 			return n.push(t), {
@@ -652,7 +710,7 @@ var $ = f(({ client: e }) => {
 				[n]: r ?? []
 			};
 		}
-	}), d = c(({ experience: t, target: n, options: r }) => Q({
+	}), d = c(({ experience: t, target: n, options: r }) => X({
 		client: e,
 		experience: t,
 		target: n,
@@ -691,16 +749,16 @@ var $ = f(({ client: e }) => {
 		clock: i,
 		target: h
 	});
-	function ee(e, t, r) {
+	function g(e, t, r) {
 		n({
 			experience: e,
 			target: t,
 			options: r
 		});
 	}
-	let g = t.map((e) => Object.values(e).flat());
-	function _(e) {
-		return g.map((t) => t.filter((t) => t.experienceKey === e), { skipVoid: !1 });
+	let _ = t.map((e) => Object.values(e).flat());
+	function ee(e) {
+		return _.map((t) => t.filter((t) => t.experienceKey === e), { skipVoid: !1 });
 	}
 	function v(e) {
 		return t.map((t) => t[e] || [], { skipVoid: !1 });
@@ -710,9 +768,9 @@ var $ = f(({ client: e }) => {
 		return y.has(t) || (s.register(t), e.eventBus({
 			type: "experience_initialize",
 			experience: t
-		}), de.get(t)?.(!0)), y.set(t, !0), () => {
+		}), Y.get(t)?.(!0)), y.set(t, !0), () => {
 			y.has(t) && (y.set(t, !1), queueMicrotask(() => {
-				y.get(t) === !1 && (y.delete(t), de.get(t)?.(!1), s.unregister(t), e.eventBus({
+				y.get(t) === !1 && (y.delete(t), Y.get(t)?.(!1), s.unregister(t), e.eventBus({
 					type: "experience_unmount",
 					experience: t
 				}));
@@ -720,15 +778,15 @@ var $ = f(({ client: e }) => {
 		};
 	}
 	return {
-		spawn: ee,
+		spawn: g,
 		adopt: b,
-		getByExperienceKey: _,
+		getByExperienceKey: ee,
 		getByExperienceId: v,
-		listStore: g
+		listStore: _
 	};
 });
-function pe(e) {
-	return p($, e);
+function Z(e) {
+	return p(he, e);
 }
 //#endregion
-export { B as a, K as c, h as d, q as i, re as l, pe as n, J as o, V as r, W as s, Q as t, m as u };
+export { se as a, W as c, h as d, G as i, ie as l, Z as n, le as o, z as r, H as s, X as t, m as u };