@picked/client 0.0.83 → 0.0.84-next.2

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

@@ -10,18 +10,18 @@ function m(e) {
 function h(e) {
 	return e.type === "step";
 }
-function g(e) {
+function ee(e) {
 	return e.type === "experience";
 }
-function _(e) {
+function g(e) {
 	return e.type === "origin";
 }
-function v(e) {
+function _(e) {
 	return e.type === "action";
 }
 //#endregion
 //#region src/utils/node-tree/node-adjacency.ts
-var y = [], b = (e, t) => {
+var v = [], y = (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();
@@ -36,14 +36,14 @@ var y = [], b = (e, t) => {
 		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) => {
+}, b = (e, t) => e.outgoingEdges.get(t) ?? v, x = (e, t) => e.incomingEdges.get(t) ?? v, S = -1, C = -Infinity, w = (e, t) => Array.from({ length: e }, () => t), T = (e) => Array.from({ length: e }, () => !1), E = (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) => {
+}, D = (e, t) => {
 	let n = /* @__PURE__ */ new Map();
 	t.forEach((e, t) => {
 		n.set(e, t);
@@ -57,15 +57,15 @@ var y = [], b = (e, t) => {
 		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 a = b(e, t);
+		r.successors.push(E(a, "destinationNodeId", n)), r.predecessors.push(E(x(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];
+}, O = (e, t, n) => {
+	let r = w(n, S), i = [...e];
 	for (let t of e) r[t] = 0;
 	let a = 0, o = 0;
 	for (; o < i.length;) {
@@ -73,144 +73,144 @@ var y = [], b = (e, t) => {
 		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));
+		for (let a of t[e] ?? []) r[a] === S && (r[a] = n, i.push(a));
 	}
 	return {
 		values: r,
 		visits: a
 	};
-}, A = (e, t) => {
+}, k = (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) => {
+}, te = (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);
+		if (e.discoveryOf[n] === S) {
+			k(e, n);
 			return;
 		}
 		e.onStack[n] && (e.lowLinkOf[t.node] = Math.min(e.lowLinkOf[t.node] ?? 0, e.discoveryOf[n] ?? 0));
 	}
-}, M = (e, t) => {
+}, ne = (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) => {
+}, A = (e, t) => {
 	let n = {
 		successors: e,
-		discoveryOf: T(t, C),
-		lowLinkOf: T(t, C),
-		onStack: E(t),
-		componentOf: T(t, C),
+		discoveryOf: w(t, S),
+		lowLinkOf: w(t, S),
+		onStack: T(t),
+		componentOf: w(t, S),
 		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;) {
+	for (let r = 0; r < t; r += 1) if (n.discoveryOf[r] === S) for (k(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);
+		t.edge < (e[t.node] ?? []).length ? te(n, t) : ne(n, t);
 	}
 	return {
 		componentOf: n.componentOf,
 		members: n.members,
 		visits: n.visits
 	};
-}, P = (e, t, n) => {
-	let r = w;
+}, j = (e, t, n) => {
+	let r = C;
 	for (let i of e.adjacency[t] ?? []) {
-		let t = e.components.componentOf[i] ?? C;
+		let t = e.components.componentOf[i] ?? S;
 		if (t === n) continue;
-		let a = e.perComponent[t] ?? w;
-		a !== w && (r = Math.max(r, a + 1));
+		let a = e.perComponent[t] ?? C;
+		a !== C && (r = Math.max(r, a + 1));
 	}
 	return r;
-}, ee = (e, t) => {
-	let n = w;
+}, M = (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, P(e, r, t));
+		n = Math.max(n, j(e, r, t));
 	}
 	return n;
-}, F = (e, t, n, r) => {
+}, N = (e, t, n, r) => {
 	let i = n.members.length, a = {
 		adjacency: e,
 		isTerminus: t,
 		components: n,
-		perComponent: T(i, w)
+		perComponent: w(i, C)
 	}, 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;
+		let c = M(a, t);
+		a.perComponent[t] = c === C ? C : 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;
+			let r = a.perComponent[e] ?? C;
+			return r === C ? S : r;
 		}),
 		visits: o
 	};
-}, I = (e, t, n) => {
+}, P = (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]);
+		let a = t.values[i] ?? S, o = n.values[i] ?? S;
+		r.set(e, a === S ? [S, S] : [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);
+}, 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);
 	return {
 		...n,
-		stepsToLeaf: I(r, s, c),
-		stepsToOrigin: I(r, l, u),
+		stepsToLeaf: P(r, s, c),
+		stepsToOrigin: P(r, l, u),
 		nodeVisits: o.visits + s.visits + c.visits + l.visits + u.visits
 	};
-}, L = (e, t, n) => {
-	let r = Infinity, i = w;
+}, F = (e, t, n) => {
+	let r = Infinity, i = C;
 	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));
+		!t || t[0] === S || (r = Math.min(r, t[0] + 1), i = Math.max(i, t[1] + 1));
 	}
-	return r === Infinity ? [C, C] : [r, i];
-}, ne = (e, t) => {
+	return r === Infinity ? [S, S] : [r, i];
+}, ie = (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 r = b(e, t.id);
+	return r.length === 0 ? [0, 0] : F(e.stepsToLeaf, r, "destinationNodeId");
+}, ae = (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 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 typeof e == "object" && !!e && !Array.isArray(e);
 }
-function B(e) {
+function z(e) {
 	if (e === void 0) return null;
-	if (Array.isArray(e)) return e.map((e) => B(e));
-	if (z(e)) {
+	if (Array.isArray(e)) return e.map((e) => z(e));
+	if (R(e)) {
 		let t = Object.keys(e).sort((e, t) => e.localeCompare(t)), n = {};
-		for (let r of t) n[r] = B(e[r]);
+		for (let r of t) n[r] = z(e[r]);
 		return n;
 	}
 	return e;
 }
-function V(e) {
-	return JSON.stringify(B(e));
+function B(e) {
+	return JSON.stringify(z(e));
 }
-var H = f(() => {
-	let e = R.store({}), t = o(e, {
+var oe = f(() => {
+	let e = L.store({}), t = o(e, {
 		set(e, t) {
 			return e[t.hash] === t.result ? e : {
 				...e,
@@ -247,118 +247,118 @@ var H = f(() => {
 		reset: i
 	};
 });
-function U() {
-	return p(H);
+function V() {
+	return p(oe);
 }
-async function W(n, r, i) {
+async function H(n, r, i) {
 	return r == null ? !0 : typeof r == "boolean" ? r : !e(r) || await t(n, r, i) === !0;
 }
-function G(e) {
+function U(e) {
 	if (typeof e == "string") return e;
 	if (Array.isArray(e) && typeof e[0] == "string") return e[0];
 }
-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);
+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);
 	}
 	return !1;
 }
-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)];
+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)];
 	}
 	return [];
 }
-function J(e, t, n = /* @__PURE__ */ new Set()) {
-	if (K(e)) return !0;
-	for (let r of q(e)) {
+function K(e, t, n = /* @__PURE__ */ new Set()) {
+	if (W(e)) return !0;
+	for (let r of G(e)) {
 		if (n.has(r)) continue;
 		n.add(r);
 		let e = t[r];
-		if (e !== void 0 && J(e.logic, t, n)) return !0;
+		if (e !== void 0 && K(e.logic, t, n)) return !0;
 	}
 	return !1;
 }
-async function Y(e, t, n) {
+async function q(e, t, n) {
 	let r = {};
 	for (let t of e.conditions.listStore.getState()) r[t.key] = t;
-	let i = J(t, r), a = V(t);
+	let i = K(t, r), a = B(t);
 	if (!i) {
 		let t = e.conditionResults.peek(a);
 		if (t !== void 0) return t;
 	}
-	let o = await W(e, t, n?.context);
+	let o = await H(e, t, n?.context);
 	return i || e.conditionResults.set({
 		hash: a,
 		result: o
 	}), o;
 }
-async function ae(e, t, n) {
+async function J(e, t, n) {
 	let r = n?.context, i = [
 		n?.precondition,
 		n?.condition,
 		t.condition
 	];
-	for (let t of i) if (!await Y(e, t, { context: r })) return !1;
+	for (let t of i) if (!await q(e, t, { context: r })) return !1;
 	return !0;
 }
 //#endregion
 //#region src/utils/node-tree/next-reachable-step-nodes.ts
-var X = (e, t, n, r) => r.has(t.id) ? [] : (r.add(t.id), h(t) && !n ? [t] : x(e, t.id).flatMap((t) => {
+var Y = (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 ? 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);
+	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);
 	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 ce(e, t, n, r) {
+async function le(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 le(e, t, n, r) {
+function ue(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 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);
+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);
 	u({
 		clock: [
-			A,
+			j,
 			r.steps.listStore,
-			w
+			T
 		],
 		source: {
 			steps: r.steps.listStore,
-			node: A
+			node: j
 		},
 		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: j
+		target: M
 	});
-	let M = a(r.steps.listStore, k, (e, t) => {
+	let N = a(r.steps.listStore, A, (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;
-	}), 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, {
+	}), 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, {
 		open: () => !0,
 		close: () => !1,
 		toggle: (e) => !e,
 		set: (e, t) => t
-	}), te = c(async () => {
+	}), z = c(async () => {
 		r.history.back({ experienceId: s.id });
-	}), L = i({
+	}), B = i({
 		source: s.treeStore,
 		effect: async (e, t) => {
 			let n = e.nodes.find((e) => h(e) && e.stepId === t);
@@ -367,7 +367,7 @@ var Q = s("experience-instance"), $ = f(({ client: r, experience: s, target: f,
 				node: n
 			});
 		}
-	}), ie = i({
+	}), oe = i({
 		source: s.treeStore,
 		effect: async (e, t) => {
 			let n = e.steps.find((e) => e.key === t);
@@ -378,25 +378,25 @@ var Q = s("experience-instance"), $ = f(({ client: r, experience: s, target: f,
 				node: i
 			});
 		}
-	}), R = i({
-		source: A,
+	}), V = i({
+		source: j,
 		effect: (e) => {}
-	}), z = i({
+	}), H = i({
 		source: s.treeStore,
-		effect: async ({ nodes: e }) => se(e)
-	}), B = i({
+		effect: async ({ nodes: e }) => ce(e)
+	}), U = i({
 		source: s.treeStore,
 		effect: async ({ nodes: e, edges: t }, n) => {
-			if (_(n)) return Z(n, e, t);
+			if (g(n)) return X(n, e, t);
 		}
-	}), V = i({
+	}), 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 ? ce(!!await t(r, o), a.id, e, n) : void 0;
+			return o ? le(!!await t(r, o), a.id, e, n) : void 0;
 		}
-	}), H = i({
+	}), G = i({
 		source: {
 			tree: s.treeStore,
 			actions: r.actions.listStore,
@@ -404,55 +404,58 @@ var Q = s("experience-instance"), $ = f(({ client: r, experience: s, target: f,
 		},
 		effect: async ({ tree: e, actions: t, snapshot: n }, r) => {
 			let { nodes: i, edges: a } = e;
-			if (!v(r)) return;
+			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}`, le(!1, r.id, i, a) ?? null;
+			if (typeof s != "function") return `${o}`, ue(!1, r.id, i, a) ?? null;
 			let c = !0;
 			try {
 				`${o}`, await s({
 					...n,
 					args: []
-				}, { experience: Y });
+				}, { experience: $ });
 			} catch {
 				`${o}`, c = !1;
 			}
-			let l = le(c, r.id, i, a);
+			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;
 			}
 			return `${o}${l.id}`, l;
 		}
-	}), U = c((e) => {
-		g(e) && r.experiences.launch({ key: e.experienceKey });
-	}), W = i({
-		source: [A, s.treeStore],
-		effect: async ([e, { nodes: t, edges: n }]) => Z(e, t, n)
-	}), G = i({
-		source: [A, s.treeStore],
-		effect: async ([e, { nodes: t, edges: n }]) => Z(e, t, n)
 	}), K = c((e) => {
-		r.history.push({
-			experienceId: s.id,
-			node: 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,
+		effect: (e, t) => {
+			e && r.history.push({
+				experienceId: s.id,
+				node: t
+			});
+		}
+	}), fe = i({
 		source: s.configStore,
-		effect: async ({ initializeOpenLogic: n }) => p?.initialiseOpen === void 0 ? e(n) ? !!await t(r, n) : n ?? !1 : p.initialiseOpen
-	}), J = a(E, r.frameworks.listStore, (e, t) => {
+		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) => {
 		if (!e) return null;
 		let n = t.find((t) => t.name === e.component.frameworkName);
 		return n ? {
 			component: e,
 			framework: n
 		} : null;
-	}, { skipVoid: !1 }), Y, ae = i({
-		source: J,
+	}, { skipVoid: !1 }), $, pe = i({
+		source: Q,
 		effect: (e) => {
 			if (!e) return;
 			if (!f) {
@@ -461,172 +464,180 @@ var Q = s("experience-instance"), $ = f(({ client: r, experience: s, target: f,
 			}
 			let t = n(f);
 			try {
-				e.framework.render(t, e.component.component, r, Y);
+				e.framework.render(t, e.component.component, r, $);
 			} catch {}
 		}
 	});
-	Y = Object.freeze({
+	$ = Object.freeze({
 		id: Math.random().toString(36).substring(7),
 		experienceKey: s.key,
 		experienceId: s.id,
 		experienceName: s.name,
 		configStore: s.configStore,
 		target: f,
-		componentStore: E,
-		componentAndFrameworkStore: J,
-		stateStore: D,
-		isOpenStore: F,
-		open: I.open,
-		close: I.close,
-		toggleOpen: I.toggle,
-		setOpen: I.set,
+		componentStore: k,
+		componentAndFrameworkStore: Q,
+		stateStore: te,
+		isOpenStore: L,
+		open: R.open,
+		close: R.close,
+		toggleOpen: R.toggle,
+		setOpen: R.set,
 		treeStore: s.treeStore,
-		currentNodeStore: A,
-		currentStepStore: j,
-		previousStepStore: M,
-		nextReachableStepNodesStore: N,
-		stepsToOriginStore: P,
-		stepsToLeafStore: ee,
-		goToNextStep: b,
-		goToPreviousStep: x,
-		goToStepById: S,
-		goToStepByKey: C,
-		stepsHistoryStore: k,
-		mountFx: ae
+		currentNodeStore: j,
+		currentStepStore: M,
+		previousStepStore: N,
+		nextReachableStepNodesStore: P,
+		stepsToOriginStore: re,
+		stepsToLeafStore: F,
+		goToNextStep: x,
+		goToPreviousStep: S,
+		goToStepById: C,
+		goToStepByKey: w,
+		stepsHistoryStore: A,
+		mountFx: pe
 	});
-	let X = l(), $ = l();
+	let me = l(), he = l();
 	return u({
-		clock: A,
-		target: X
+		clock: j,
+		filter: I,
+		target: me
 	}), u({
-		clock: X,
+		clock: me,
 		filter: (e) => e === null,
-		target: z
+		target: H
 	}), u({
-		clock: X,
+		clock: me,
 		filter: (e) => e !== null,
-		target: $
+		target: he
 	}), d({
-		source: $,
-		match: (e) => m(e) ? "condition" : h(e) ? "step" : g(e) ? "launchExperience" : _(e) ? "origin" : v(e) ? "action" : "other",
+		source: he,
+		match: (e) => m(e) ? "condition" : h(e) ? "step" : ee(e) ? "launchExperience" : g(e) ? "origin" : _(e) ? "action" : "other",
 		cases: {
-			origin: B,
-			condition: V,
-			step: R,
-			launchExperience: U,
-			action: H,
+			origin: U,
+			condition: W,
+			step: V,
+			launchExperience: K,
+			action: G,
 			__: l()
 		}
 	}), u({
 		clock: [
-			V.doneData,
-			B.doneData,
-			z.doneData,
-			G.doneData,
 			W.doneData,
-			H.doneData
+			U.doneData,
+			H.doneData,
+			J.doneData,
+			q.doneData,
+			G.doneData
 		],
 		filter: Boolean,
-		target: K
+		target: Y
 	}), u({
-		clock: b,
-		target: G
+		clock: x,
+		target: J
 	}), u({
-		clock: b,
-		source: j,
+		clock: x,
+		source: M,
 		filter: Boolean,
-		target: r.eventBus.prepend((e) => ({
+		target: O.prepend((e) => ({
 			type: "step_submit",
 			step: e,
-			experience: Y
+			experience: $
 		}))
 	}), u({
-		clock: G.done,
-		source: j,
+		clock: J.done,
+		source: M,
 		filter: Boolean,
-		target: r.eventBus.prepend((e) => ({
+		target: O.prepend((e) => ({
 			type: "step_submit_success",
 			step: e,
-			experience: Y
+			experience: $
 		}))
 	}), u({
-		clock: G.fail,
-		source: j,
+		clock: J.fail,
+		source: M,
 		filter: Boolean,
-		target: r.eventBus.prepend((e) => ({
+		target: O.prepend((e) => ({
 			type: "step_submit_error",
 			step: e,
-			experience: Y
+			experience: $
 		}))
-	}), u({
-		clock: x,
-		target: te
 	}), u({
 		clock: S,
-		target: L
+		target: z
 	}), u({
 		clock: C,
-		target: ie
+		target: B
+	}), u({
+		clock: w,
+		target: oe
 	}), u({
 		source: a([
-			V.pending,
-			B.pending,
-			z.pending,
-			G.pending,
 			W.pending,
-			H.pending
+			U.pending,
+			H.pending,
+			J.pending,
+			q.pending,
+			G.pending
 		]),
 		fn: (e) => e.some(Boolean) ? "transitioning" : "ready",
-		target: D
+		target: te
 	}), u({
-		clock: R.doneData,
-		source: j,
+		clock: V.doneData,
+		source: M,
 		filter: Boolean,
-		target: r.eventBus.prepend((e) => ({
+		target: O.prepend((e) => ({
 			type: "step_enter",
 			step: e,
-			experience: Y
+			experience: $
 		}))
 	}), u({
-		clock: T,
-		target: q
+		clock: E,
+		target: fe
 	}), u({
-		source: q.doneData,
+		clock: fe.doneData,
+		filter: I,
 		fn: Boolean,
-		target: F
+		target: L
 	}), u({
-		source: A,
-		clock: y,
-		filter: (e) => !e || _(e),
-		target: W
+		source: j,
+		clock: b,
+		filter: (e) => !e || g(e),
+		target: q
 	}), u({
-		source: F,
+		source: L,
 		filter: Boolean,
-		target: y
+		target: b
 	}), u({
-		source: F,
+		source: L,
 		filter: Boolean,
-		target: r.eventBus.prepend(() => ({
+		target: O.prepend(() => ({
 			type: "experience_open",
-			experience: Y
+			experience: $
 		}))
 	}), u({
-		source: F,
+		source: L,
 		filter: (e) => !e,
-		target: r.eventBus.prepend(() => ({
+		target: O.prepend(() => ({
 			type: "experience_close",
-			experience: Y
+			experience: $
 		}))
 	}), u({
-		clock: w,
-		target: [T]
-	}), w(), Y;
+		clock: O,
+		filter: I,
+		target: r.eventBus
+	}), v ? de.set($, (e) => {
+		e && R.close(), D(e), e && E();
+	}) : u({
+		clock: T,
+		target: E
+	}), T(), $;
 });
-function ue(e) {
-	return p($, e);
+function Q(e) {
+	return p(fe, e);
 }
-var de = f(({ client: e }) => {
-	let t = Q.store({}), n = l(), i = l(), a = l(), s = o(t, {
+var $ = f(({ client: e }) => {
+	let t = Z.store({}), n = l(), i = l(), a = l(), s = o(t, {
 		register(e, t) {
 			let n = [...e[t.experienceId] ?? []];
 			return n.push(t), {
@@ -641,7 +652,7 @@ var de = f(({ client: e }) => {
 				[n]: r ?? []
 			};
 		}
-	}), d = c(({ experience: t, target: n, options: r }) => ue({
+	}), d = c(({ experience: t, target: n, options: r }) => Q({
 		client: e,
 		experience: t,
 		target: n,
@@ -680,29 +691,44 @@ var de = f(({ client: e }) => {
 		clock: i,
 		target: h
 	});
-	function g(e, t, r) {
+	function ee(e, t, r) {
 		n({
 			experience: e,
 			target: t,
 			options: r
 		});
 	}
-	let _ = t.map((e) => Object.values(e).flat());
-	function v(e) {
-		return _.map((t) => t.filter((t) => t.experienceKey === e), { skipVoid: !1 });
+	let g = t.map((e) => Object.values(e).flat());
+	function _(e) {
+		return g.map((t) => t.filter((t) => t.experienceKey === e), { skipVoid: !1 });
 	}
-	function y(e) {
+	function v(e) {
 		return t.map((t) => t[e] || [], { skipVoid: !1 });
 	}
+	let y = /* @__PURE__ */ new Map();
+	function b(t) {
+		return y.has(t) || (s.register(t), e.eventBus({
+			type: "experience_initialize",
+			experience: t
+		}), de.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({
+					type: "experience_unmount",
+					experience: t
+				}));
+			}));
+		};
+	}
 	return {
-		spawn: g,
-		getByExperienceKey: v,
-		getByExperienceId: y,
-		listStore: _
+		spawn: ee,
+		adopt: b,
+		getByExperienceKey: _,
+		getByExperienceId: v,
+		listStore: g
 	};
 });
-function fe(e) {
-	return p(de, e);
+function pe(e) {
+	return p($, e);
 }
 //#endregion
-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 };
+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 };