@picked/client 0.0.82 → 0.0.83-next.2

package/dist/{experience-instance-DGk11d8a.js → experience-instance-BibCf-8y.js}

@@ -20,26 +20,197 @@ function v(e) {
 	return e.type === "action";
 }
 //#endregion
-//#region src/lifecycle/condition-selection.ts
-var y = "conditions.", b = s("condition-results");
-function x(e) {
+//#region src/utils/node-tree/node-adjacency.ts
+var y = [], b = (e, t) => {
+	let n = /* @__PURE__ */ new Map();
+	for (let t of e) n.set(t.id, t);
+	let r = /* @__PURE__ */ new Map(), i = /* @__PURE__ */ new Map();
+	for (let e of t) {
+		let t = r.get(e.sourceNodeId);
+		t ? t.push(e) : r.set(e.sourceNodeId, [e]);
+		let n = i.get(e.destinationNodeId);
+		n ? n.push(e) : i.set(e.destinationNodeId, [e]);
+	}
+	return {
+		nodeById: n,
+		outgoingEdges: r,
+		incomingEdges: i
+	};
+}, x = (e, t) => e.outgoingEdges.get(t) ?? y, S = (e, t) => e.incomingEdges.get(t) ?? y, C = -1, w = -Infinity, T = (e, t) => Array.from({ length: e }, () => t), E = (e) => Array.from({ length: e }, () => !1), D = (e, t, n) => {
+	let r = [];
+	for (let i of e) {
+		let e = n.get(i[t]);
+		e !== void 0 && r.push(e);
+	}
+	return r;
+}, O = (e, t) => {
+	let n = /* @__PURE__ */ new Map();
+	t.forEach((e, t) => {
+		n.set(e, t);
+	});
+	let r = {
+		successors: [],
+		predecessors: [],
+		isLeaf: [],
+		isOrigin: [],
+		leaves: [],
+		origins: []
+	};
+	return t.forEach((t, i) => {
+		let a = x(e, t);
+		r.successors.push(D(a, "destinationNodeId", n)), r.predecessors.push(D(S(e, t), "sourceNodeId", n));
+		let o = a.length === 0;
+		r.isLeaf.push(o), o && r.leaves.push(i);
+		let s = e.nodeById.get(t)?.type === "origin";
+		r.isOrigin.push(s), s && r.origins.push(i);
+	}), r;
+}, k = (e, t, n) => {
+	let r = T(n, C), i = [...e];
+	for (let t of e) r[t] = 0;
+	let a = 0, o = 0;
+	for (; o < i.length;) {
+		let e = i[o];
+		if (o += 1, e === void 0) continue;
+		a += 1;
+		let n = (r[e] ?? 0) + 1;
+		for (let a of t[e] ?? []) r[a] === C && (r[a] = n, i.push(a));
+	}
+	return {
+		values: r,
+		visits: a
+	};
+}, A = (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;
+}, j = (e, t) => {
+	let n = (e.successors[t.node] ?? [])[t.edge];
+	if (t.edge += 1, n !== void 0) {
+		if (e.discoveryOf[n] === C) {
+			A(e, n);
+			return;
+		}
+		e.onStack[n] && (e.lowLinkOf[t.node] = Math.min(e.lowLinkOf[t.node] ?? 0, e.discoveryOf[n] ?? 0));
+	}
+}, M = (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);
+}, N = (e, t) => {
+	let n = {
+		successors: e,
+		discoveryOf: T(t, C),
+		lowLinkOf: T(t, C),
+		onStack: E(t),
+		componentOf: T(t, C),
+		stack: [],
+		frames: [],
+		members: [],
+		counter: 0,
+		visits: 0
+	};
+	for (let r = 0; r < t; r += 1) if (n.discoveryOf[r] === C) for (A(n, r); n.frames.length > 0;) {
+		let t = n.frames.at(-1);
+		if (!t) break;
+		t.edge < (e[t.node] ?? []).length ? j(n, t) : M(n, t);
+	}
+	return {
+		componentOf: n.componentOf,
+		members: n.members,
+		visits: n.visits
+	};
+}, P = (e, t, n) => {
+	let r = w;
+	for (let i of e.adjacency[t] ?? []) {
+		let t = e.components.componentOf[i] ?? C;
+		if (t === n) continue;
+		let a = e.perComponent[t] ?? w;
+		a !== w && (r = Math.max(r, a + 1));
+	}
+	return r;
+}, ee = (e, t) => {
+	let n = w;
+	for (let r of e.components.members[t] ?? []) {
+		if (e.isTerminus[r]) {
+			n = Math.max(n, 0);
+			continue;
+		}
+		n = Math.max(n, P(e, r, t));
+	}
+	return n;
+}, F = (e, t, n, r) => {
+	let i = n.members.length, a = {
+		adjacency: e,
+		isTerminus: t,
+		components: n,
+		perComponent: T(i, w)
+	}, o = 0;
+	for (let e = 0; e < i; e += 1) {
+		let t = r ? i - 1 - e : e, s = (n.members[t] ?? []).length;
+		o += s;
+		let c = ee(a, t);
+		a.perComponent[t] = c === w ? w : c + s - 1;
+	}
+	return {
+		values: n.componentOf.map((e, n) => {
+			if (t[n]) return 0;
+			let r = a.perComponent[e] ?? w;
+			return r === w ? C : r;
+		}),
+		visits: o
+	};
+}, I = (e, t, n) => {
+	let r = /* @__PURE__ */ new Map();
+	return e.forEach((e, i) => {
+		let a = t.values[i] ?? C, o = n.values[i] ?? C;
+		r.set(e, a === C ? [C, C] : [a, o]);
+	}), r;
+}, te = (e, t) => {
+	let n = b(e, t), r = [...n.nodeById.keys()], i = r.length, a = O(n, r), o = N(a.successors, i), s = k(a.leaves, a.predecessors, i), c = F(a.successors, a.isLeaf, o, !1), l = k(a.origins, a.successors, i), u = F(a.predecessors, a.isOrigin, o, !0);
+	return {
+		...n,
+		stepsToLeaf: I(r, s, c),
+		stepsToOrigin: I(r, l, u),
+		nodeVisits: o.visits + s.visits + c.visits + l.visits + u.visits
+	};
+}, L = (e, t, n) => {
+	let r = Infinity, i = w;
+	for (let a of t) {
+		let t = e.get(a[n]);
+		!t || t[0] === C || (r = Math.min(r, t[0] + 1), i = Math.max(i, t[1] + 1));
+	}
+	return r === Infinity ? [C, C] : [r, i];
+}, ne = (e, t) => {
+	let n = e.stepsToLeaf.get(t.id);
+	if (n) return [n[0], n[1]];
+	let r = x(e, t.id);
+	return r.length === 0 ? [0, 0] : L(e.stepsToLeaf, r, "destinationNodeId");
+}, re = (e, t) => {
+	let n = e.stepsToOrigin.get(t.id);
+	return n ? [n[0], n[1]] : t.type === "origin" ? [0, 0] : L(e.stepsToOrigin, S(e, t.id), "sourceNodeId");
+}, ie = "conditions.", R = s("condition-results");
+function z(e) {
 	return typeof e == "object" && !!e && !Array.isArray(e);
 }
-function S(e) {
+function B(e) {
 	if (e === void 0) return null;
-	if (Array.isArray(e)) return e.map((e) => S(e));
-	if (x(e)) {
+	if (Array.isArray(e)) return e.map((e) => B(e));
+	if (z(e)) {
 		let t = Object.keys(e).sort((e, t) => e.localeCompare(t)), n = {};
-		for (let r of t) n[r] = S(e[r]);
+		for (let r of t) n[r] = B(e[r]);
 		return n;
 	}
 	return e;
 }
-function C(e) {
-	return JSON.stringify(S(e));
+function V(e) {
+	return JSON.stringify(B(e));
 }
-var w = f(() => {
-	let e = b.store({}), t = o(e, {
+var H = f(() => {
+	let e = R.store({}), t = o(e, {
 		set(e, t) {
 			return e[t.hash] === t.result ? e : {
 				...e,
@@ -76,117 +247,91 @@ var w = f(() => {
 		reset: i
 	};
 });
-function T() {
-	return p(w);
+function U() {
+	return p(H);
 }
-async function E(n, r, i) {
+async function W(n, r, i) {
 	return r == null ? !0 : typeof r == "boolean" ? r : !e(r) || await t(n, r, i) === !0;
 }
-function D(e) {
+function G(e) {
 	if (typeof e == "string") return e;
 	if (Array.isArray(e) && typeof e[0] == "string") return e[0];
 }
-function O(e) {
-	if (Array.isArray(e)) return e.some(O);
-	if (x(e)) {
-		let t = D(e.var);
-		return t !== void 0 && (t === "actions" || t.startsWith("actions.")) ? !0 : Object.values(e).some(O);
+function K(e) {
+	if (Array.isArray(e)) return e.some(K);
+	if (z(e)) {
+		let t = G(e.var);
+		return t !== void 0 && (t === "actions" || t.startsWith("actions.")) ? !0 : Object.values(e).some(K);
 	}
 	return !1;
 }
-function k(e) {
-	if (Array.isArray(e)) return e.flatMap(k);
-	if (x(e)) {
-		let t = D(e.var);
-		return [...t !== void 0 && t.startsWith(y) ? [t.slice(11)] : [], ...Object.values(e).flatMap(k)];
+function q(e) {
+	if (Array.isArray(e)) return e.flatMap(q);
+	if (z(e)) {
+		let t = G(e.var);
+		return [...t !== void 0 && t.startsWith(ie) ? [t.slice(11)] : [], ...Object.values(e).flatMap(q)];
 	}
 	return [];
 }
-function A(e, t, n = /* @__PURE__ */ new Set()) {
-	if (O(e)) return !0;
-	for (let r of k(e)) {
+function J(e, t, n = /* @__PURE__ */ new Set()) {
+	if (K(e)) return !0;
+	for (let r of q(e)) {
 		if (n.has(r)) continue;
 		n.add(r);
 		let e = t[r];
-		if (e !== void 0 && A(e.logic, t, n)) return !0;
+		if (e !== void 0 && J(e.logic, t, n)) return !0;
 	}
 	return !1;
 }
-async function j(e, t, n) {
+async function Y(e, t, n) {
 	let r = {};
 	for (let t of e.conditions.listStore.getState()) r[t.key] = t;
-	let i = A(t, r), a = C(t);
+	let i = J(t, r), a = V(t);
 	if (!i) {
 		let t = e.conditionResults.peek(a);
 		if (t !== void 0) return t;
 	}
-	let o = await E(e, t, n?.context);
+	let o = await W(e, t, n?.context);
 	return i || e.conditionResults.set({
 		hash: a,
 		result: o
 	}), o;
 }
-async function M(e, t, n) {
+async function ae(e, t, n) {
 	let r = n?.context, i = [
 		n?.precondition,
 		n?.condition,
 		t.condition
 	];
-	for (let t of i) if (!await j(e, t, { context: r })) return !1;
+	for (let t of i) if (!await Y(e, t, { context: r })) return !1;
 	return !0;
 }
 //#endregion
 //#region src/utils/node-tree/next-reachable-step-nodes.ts
-var N = (e, t, n, r, i = /* @__PURE__ */ new Set()) => i.has(n.id) ? [] : (i.add(n.id), h(n) && !r ? [n] : t.filter((e) => e.sourceNodeId === n.id).flatMap((n) => {
-	let r = e.find((e) => e.id === n.destinationNodeId);
-	return r ? N(e, t, r, !1, i) : [];
-})), ee = (e, t, n) => N(e, t, n, !0, /* @__PURE__ */ new Set()), P = (e, t, n, r, i = /* @__PURE__ */ new Set()) => {
-	if (i.has(n.id)) return [-1, -1];
-	i.add(n.id);
-	let a = t.filter((e) => e.sourceNodeId === n.id);
-	if (a.length === 0) return [0, 0];
-	let o = Infinity, s = -Infinity;
-	for (let n of a) {
-		let r = e.find((e) => e.id === n.destinationNodeId);
-		if (!r) continue;
-		let [a, c] = P(e, t, r, !1, new Set(i));
-		a !== -1 && (o = Math.min(o, a + 1), s = Math.max(s, c + 1));
-	}
-	return o === Infinity ? [-1, -1] : [o, s];
-}, te = (e, t, n) => P(e, t, n, !0, /* @__PURE__ */ new Set()), F = (e, t, n, r = /* @__PURE__ */ new Set()) => {
-	if (r.has(n.id)) return [-1, -1];
-	if (r.add(n.id), n.type === "origin") return [0, 0];
-	let i = t.filter((e) => e.destinationNodeId === n.id);
-	if (i.length === 0) return [-1, -1];
-	let a = Infinity, o = -Infinity;
-	for (let n of i) {
-		let i = e.find((e) => e.id === n.sourceNodeId);
-		if (!i) continue;
-		let [s, c] = F(e, t, i, new Set(r));
-		s !== -1 && (a = Math.min(a, s + 1), o = Math.max(o, c + 1));
-	}
-	return a === Infinity ? [-1, -1] : [a, o];
-}, ne = (e, t, n) => F(e, t, n, /* @__PURE__ */ new Set()), I = (e) => e.find((e) => e.type === "origin") || null, L = (e, t, n) => {
-	if (!e) return I(t);
+var X = (e, t, n, r) => r.has(t.id) ? [] : (r.add(t.id), h(t) && !n ? [t] : x(e, t.id).flatMap((t) => {
+	let n = e.nodeById.get(t.destinationNodeId);
+	return n ? X(e, n, !1, r) : [];
+})), oe = (e, t) => X(e, t, !0, /* @__PURE__ */ new Set()), se = (e) => e.find((e) => e.type === "origin") || null, Z = (e, t, n) => {
+	if (!e) return se(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 re(e, t, n, r) {
+async function ce(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 R(e, t, n, r) {
+function le(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"), B = f(({ client: r, experience: s, target: f, options: p }) => {
-	let y = l(), b = l(), x = l(), S = l(), C = l(), w = l(), T = l(), E = s.componentStore, D = z.store("transitioning"), O = r.history.entriesStore.map((e) => e.filter((e) => e.experienceId === s.id)), k = O.map((e) => e.filter((e) => h(e.node))), A = O.map((e) => e.at(-1)?.node || null), j = z.store(null);
+var Q = s("experience-instance"), $ = f(({ client: r, experience: s, target: f, options: p }) => {
+	let y = l(), b = l(), x = l(), S = l(), C = l(), w = l(), T = l(), E = s.componentStore, D = Q.store("transitioning"), O = r.history.entriesStore.map((e) => e.filter((e) => e.experienceId === s.id)), k = O.map((e) => e.filter((e) => h(e.node))), A = O.map((e) => e.at(-1)?.node || null), j = Q.store(null);
 	u({
 		clock: [
 			A,
@@ -206,14 +351,14 @@ var z = s("experience-instance"), B = f(({ client: r, experience: s, target: f,
 		if (!n || !h(n.node)) return null;
 		let r = n.node;
 		return e.find((e) => e.id === r.stepId) || null;
-	}), N = a(s.treeStore, A, ({ nodes: e, edges: t }, n) => n ? ee(e, t, n) : []), P = a(s.treeStore, A, ({ nodes: e, edges: t }, n) => n ? ne(e, t, n) : [-1, -1]), F = a(s.treeStore, A, ({ nodes: e, edges: t }, n) => n ? te(e, t, n) : [-1, -1]), B = z.store(!1), V = o(B, {
+	}), N = a(s.nodeTreeStore, A, (e, t) => t ? oe(e, t) : []), P = a(s.nodeTreeStore, A, (e, t) => t ? re(e, t) : [-1, -1]), ee = a(s.nodeTreeStore, A, (e, t) => t ? ne(e, t) : [-1, -1]), F = Q.store(!1), I = o(F, {
 		open: () => !0,
 		close: () => !1,
 		toggle: (e) => !e,
 		set: (e, t) => t
-	}), H = c(async () => {
+	}), te = c(async () => {
 		r.history.back({ experienceId: s.id });
-	}), ie = i({
+	}), L = i({
 		source: s.treeStore,
 		effect: async (e, t) => {
 			let n = e.nodes.find((e) => h(e) && e.stepId === t);
@@ -222,7 +367,7 @@ var z = s("experience-instance"), B = f(({ client: r, experience: s, target: f,
 				node: n
 			});
 		}
-	}), ae = i({
+	}), ie = i({
 		source: s.treeStore,
 		effect: async (e, t) => {
 			let n = e.steps.find((e) => e.key === t);
@@ -233,25 +378,25 @@ var z = s("experience-instance"), B = f(({ client: r, experience: s, target: f,
 				node: i
 			});
 		}
-	}), U = i({
+	}), R = i({
 		source: A,
 		effect: (e) => {}
-	}), W = i({
+	}), z = i({
 		source: s.treeStore,
-		effect: async ({ nodes: e }) => I(e)
-	}), G = i({
+		effect: async ({ nodes: e }) => se(e)
+	}), B = i({
 		source: s.treeStore,
 		effect: async ({ nodes: e, edges: t }, n) => {
-			if (_(n)) return L(n, e, t);
+			if (_(n)) return Z(n, e, t);
 		}
-	}), K = i({
+	}), V = 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 ? re(!!await t(r, o), a.id, e, n) : void 0;
+			return o ? ce(!!await t(r, o), a.id, e, n) : void 0;
 		}
-	}), q = i({
+	}), H = i({
 		source: {
 			tree: s.treeStore,
 			actions: r.actions.listStore,
@@ -266,48 +411,48 @@ var z = s("experience-instance"), B = f(({ client: r, experience: s, target: f,
 				return;
 			}
 			let s = t.find((e) => e.key === o)?.action;
-			if (typeof s != "function") return `${o}`, R(!1, r.id, i, a) ?? null;
+			if (typeof s != "function") return `${o}`, le(!1, r.id, i, a) ?? null;
 			let c = !0;
 			try {
 				`${o}`, await s({
 					...n,
 					args: []
-				}, { experience: Q });
+				}, { experience: Y });
 			} catch {
 				`${o}`, c = !1;
 			}
-			let l = R(c, r.id, i, a);
+			let l = le(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;
 			}
 			return `${o}${l.id}`, l;
 		}
-	}), oe = c((e) => {
+	}), U = c((e) => {
 		g(e) && r.experiences.launch({ key: e.experienceKey });
-	}), J = i({
+	}), W = i({
 		source: [A, s.treeStore],
-		effect: async ([e, { nodes: t, edges: n }]) => L(e, t, n)
-	}), Y = i({
+		effect: async ([e, { nodes: t, edges: n }]) => Z(e, t, n)
+	}), G = i({
 		source: [A, s.treeStore],
-		effect: async ([e, { nodes: t, edges: n }]) => L(e, t, n)
-	}), se = c((e) => {
+		effect: async ([e, { nodes: t, edges: n }]) => Z(e, t, n)
+	}), K = c((e) => {
 		r.history.push({
 			experienceId: s.id,
 			node: e
 		});
-	}), X = i({
+	}), q = i({
 		source: s.configStore,
 		effect: async ({ initializeOpenLogic: n }) => p?.initialiseOpen === void 0 ? e(n) ? !!await t(r, n) : n ?? !1 : p.initialiseOpen
-	}), Z = a(E, r.frameworks.listStore, (e, t) => {
+	}), J = a(E, 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 }), Q, ce = i({
-		source: Z,
+	}, { skipVoid: !1 }), Y, ae = i({
+		source: J,
 		effect: (e) => {
 			if (!e) return;
 			if (!f) {
@@ -316,11 +461,11 @@ var z = s("experience-instance"), B = f(({ client: r, experience: s, target: f,
 			}
 			let t = n(f);
 			try {
-				e.framework.render(t, e.component.component, r, Q);
+				e.framework.render(t, e.component.component, r, Y);
 			} catch {}
 		}
 	});
-	Q = Object.freeze({
+	Y = Object.freeze({
 		id: Math.random().toString(36).substring(7),
 		experienceKey: s.key,
 		experienceId: s.id,
@@ -328,64 +473,64 @@ var z = s("experience-instance"), B = f(({ client: r, experience: s, target: f,
 		configStore: s.configStore,
 		target: f,
 		componentStore: E,
-		componentAndFrameworkStore: Z,
+		componentAndFrameworkStore: J,
 		stateStore: D,
-		isOpenStore: B,
-		open: V.open,
-		close: V.close,
-		toggleOpen: V.toggle,
-		setOpen: V.set,
+		isOpenStore: F,
+		open: I.open,
+		close: I.close,
+		toggleOpen: I.toggle,
+		setOpen: I.set,
 		treeStore: s.treeStore,
 		currentNodeStore: A,
 		currentStepStore: j,
 		previousStepStore: M,
 		nextReachableStepNodesStore: N,
 		stepsToOriginStore: P,
-		stepsToLeafStore: F,
+		stepsToLeafStore: ee,
 		goToNextStep: b,
 		goToPreviousStep: x,
 		goToStepById: S,
 		goToStepByKey: C,
 		stepsHistoryStore: k,
-		mountFx: ce
+		mountFx: ae
 	});
-	let $ = l(), le = l();
+	let X = l(), $ = l();
 	return u({
 		clock: A,
-		target: $
+		target: X
 	}), u({
-		clock: $,
+		clock: X,
 		filter: (e) => e === null,
-		target: W
+		target: z
 	}), u({
-		clock: $,
+		clock: X,
 		filter: (e) => e !== null,
-		target: le
+		target: $
 	}), d({
-		source: le,
+		source: $,
 		match: (e) => m(e) ? "condition" : h(e) ? "step" : g(e) ? "launchExperience" : _(e) ? "origin" : v(e) ? "action" : "other",
 		cases: {
-			origin: G,
-			condition: K,
-			step: U,
-			launchExperience: oe,
-			action: q,
+			origin: B,
+			condition: V,
+			step: R,
+			launchExperience: U,
+			action: H,
 			__: l()
 		}
 	}), u({
 		clock: [
-			K.doneData,
+			V.doneData,
+			B.doneData,
+			z.doneData,
 			G.doneData,
 			W.doneData,
-			Y.doneData,
-			J.doneData,
-			q.doneData
+			H.doneData
 		],
 		filter: Boolean,
-		target: se
+		target: K
 	}), u({
 		clock: b,
-		target: Y
+		target: G
 	}), u({
 		clock: b,
 		source: j,
@@ -393,95 +538,95 @@ var z = s("experience-instance"), B = f(({ client: r, experience: s, target: f,
 		target: r.eventBus.prepend((e) => ({
 			type: "step_submit",
 			step: e,
-			experience: Q
+			experience: Y
 		}))
 	}), u({
-		clock: Y.done,
+		clock: G.done,
 		source: j,
 		filter: Boolean,
 		target: r.eventBus.prepend((e) => ({
 			type: "step_submit_success",
 			step: e,
-			experience: Q
+			experience: Y
 		}))
 	}), u({
-		clock: Y.fail,
+		clock: G.fail,
 		source: j,
 		filter: Boolean,
 		target: r.eventBus.prepend((e) => ({
 			type: "step_submit_error",
 			step: e,
-			experience: Q
+			experience: Y
 		}))
 	}), u({
 		clock: x,
-		target: H
+		target: te
 	}), u({
 		clock: S,
-		target: ie
+		target: L
 	}), u({
 		clock: C,
-		target: ae
+		target: ie
 	}), u({
 		source: a([
-			K.pending,
+			V.pending,
+			B.pending,
+			z.pending,
 			G.pending,
 			W.pending,
-			Y.pending,
-			J.pending,
-			q.pending
+			H.pending
 		]),
 		fn: (e) => e.some(Boolean) ? "transitioning" : "ready",
 		target: D
 	}), u({
-		clock: U.doneData,
+		clock: R.doneData,
 		source: j,
 		filter: Boolean,
 		target: r.eventBus.prepend((e) => ({
 			type: "step_enter",
 			step: e,
-			experience: Q
+			experience: Y
 		}))
 	}), u({
 		clock: T,
-		target: X
+		target: q
 	}), u({
-		source: X.doneData,
+		source: q.doneData,
 		fn: Boolean,
-		target: B
+		target: F
 	}), u({
 		source: A,
 		clock: y,
 		filter: (e) => !e || _(e),
-		target: J
+		target: W
 	}), u({
-		source: B,
+		source: F,
 		filter: Boolean,
 		target: y
 	}), u({
-		source: B,
+		source: F,
 		filter: Boolean,
 		target: r.eventBus.prepend(() => ({
 			type: "experience_open",
-			experience: Q
+			experience: Y
 		}))
 	}), u({
-		source: B,
+		source: F,
 		filter: (e) => !e,
 		target: r.eventBus.prepend(() => ({
 			type: "experience_close",
-			experience: Q
+			experience: Y
 		}))
 	}), u({
 		clock: w,
 		target: [T]
-	}), w(), Q;
+	}), w(), Y;
 });
-function V(e) {
-	return p(B, e);
+function ue(e) {
+	return p($, e);
 }
-var H = f(({ client: e }) => {
-	let t = z.store({}), n = l(), i = l(), a = l(), s = o(t, {
+var de = f(({ client: e }) => {
+	let t = Q.store({}), n = l(), i = l(), a = l(), s = o(t, {
 		register(e, t) {
 			let n = [...e[t.experienceId] ?? []];
 			return n.push(t), {
@@ -496,7 +641,7 @@ var H = f(({ client: e }) => {
 				[n]: r ?? []
 			};
 		}
-	}), d = c(({ experience: t, target: n, options: r }) => V({
+	}), d = c(({ experience: t, target: n, options: r }) => ue({
 		client: e,
 		experience: t,
 		target: n,
@@ -556,8 +701,8 @@ var H = f(({ client: e }) => {
 		listStore: _
 	};
 });
-function ie(e) {
-	return p(H, e);
+function fe(e) {
+	return p(de, e);
 }
 //#endregion
-export { C as a, A as c, j as i, m as l, ie as n, M as o, T as r, O as s, V as t, h as u };
+export { V as a, J as c, h as d, Y as i, te as l, fe as n, ae as o, U as r, K as s, ue as t, m as u };