@picked/client 0.0.1-dev.1789541668638 → 0.0.1-next.2

package/dist/experience-instance-B9S6Yf0N.js

@@ -1,711 +0,0 @@
-import { n as e, t } from "./rules-logic-HesIUCu6.js";
-import "./logger-DMN6TxJJ.js";
-import { n, o as r } from "./dom-BqcToNL0.js";
-import { attach as i, combine as a, createApi as o, createDomain as s, createEffect as c, createEvent as l, sample as u, split as d } from "effector";
-import { createFactory as f, invoke as p } from "@withease/factories";
-//#region src/utils/nodes.ts
-function m(e) {
-	return e.type === "condition";
-}
-function h(e) {
-	return e.type === "step";
-}
-function g(e) {
-	return e.type === "experience";
-}
-function _(e) {
-	return e.type === "origin";
-}
-function v(e) {
-	return e.type === "action";
-}
-//#endregion
-//#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[e.frames.length - 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 = [];
-	for (;;) {
-		let n = e.stack.pop();
-		if (n === void 0 || (e.onStack[n] = !1, e.componentOf[n] = e.members.length, r.push(n), n === t.node)) break;
-	}
-	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[n.frames.length - 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 B(e) {
-	if (e === void 0) return null;
-	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] = B(e[r]);
-		return n;
-	}
-	return e;
-}
-function V(e) {
-	return JSON.stringify(B(e));
-}
-var H = f(() => {
-	let e = R.store({}), t = o(e, {
-		set(e, t) {
-			return e[t.hash] === t.result ? e : {
-				...e,
-				[t.hash]: t.result
-			};
-		},
-		seed(e, t) {
-			return Object.keys(t).every((n) => e[n] === t[n]) ? e : {
-				...e,
-				...t
-			};
-		},
-		clear() {
-			return {};
-		}
-	});
-	function n(e) {
-		t.set(e);
-	}
-	function r(e) {
-		t.seed(e);
-	}
-	function i() {
-		t.clear();
-	}
-	function a(t) {
-		return e.getState()[t];
-	}
-	return {
-		store: e,
-		set: n,
-		seed: r,
-		peek: a,
-		reset: i
-	};
-});
-function U() {
-	return p(H);
-}
-async function W(n, r, i) {
-	return r == null ? !0 : typeof r == "boolean" ? r : !e(r) || await t(n, r, i) === !0;
-}
-function G(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);
-	}
-	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)];
-	}
-	return [];
-}
-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 && J(e.logic, t, n)) return !0;
-	}
-	return !1;
-}
-async function Y(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);
-	if (!i) {
-		let t = e.conditionResults.peek(a);
-		if (t !== void 0) return t;
-	}
-	let o = await W(e, t, n?.context);
-	return i || e.conditionResults.set({
-		hash: a,
-		result: o
-	}), o;
-}
-async function ae(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;
-	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) => {
-	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 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 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 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,
-			r.steps.listStore,
-			w
-		],
-		source: {
-			steps: r.steps.listStore,
-			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: j
-	});
-	let M = a(r.steps.listStore, k, (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, {
-		open: () => !0,
-		close: () => !1,
-		toggle: (e) => !e,
-		set: (e, t) => t
-	}), te = c(async () => {
-		r.history.back({ experienceId: s.id });
-	}), L = i({
-		source: s.treeStore,
-		effect: async (e, t) => {
-			let n = e.nodes.find((e) => h(e) && e.stepId === t);
-			n && r.history.push({
-				experienceId: s.id,
-				node: n
-			});
-		}
-	}), ie = i({
-		source: s.treeStore,
-		effect: async (e, t) => {
-			let n = e.steps.find((e) => e.key === t);
-			if (!n) return;
-			let i = e.nodes.find((e) => h(e) && e.stepId === n.id);
-			i && r.history.push({
-				experienceId: s.id,
-				node: i
-			});
-		}
-	}), R = i({
-		source: A,
-		effect: (e) => {}
-	}), z = i({
-		source: s.treeStore,
-		effect: async ({ nodes: e }) => se(e)
-	}), B = i({
-		source: s.treeStore,
-		effect: async ({ nodes: e, edges: t }, n) => {
-			if (_(n)) return Z(n, e, t);
-		}
-	}), 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 ? ce(!!await t(r, o), a.id, e, n) : void 0;
-		}
-	}), H = i({
-		source: {
-			tree: s.treeStore,
-			actions: r.actions.listStore,
-			snapshot: r.stateSnapshotStore
-		},
-		effect: async ({ tree: e, actions: t, snapshot: n }, r) => {
-			let { nodes: i, edges: a } = e;
-			if (!v(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;
-			let c = !0;
-			try {
-				`${o}`, await s({
-					...n,
-					args: []
-				}, { experience: Y });
-			} catch {
-				`${o}`, c = !1;
-			}
-			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;
-		}
-	}), 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
-		});
-	}), q = 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) => {
-		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,
-		effect: (e) => {
-			if (!e) return;
-			if (!f) {
-				`${s.id}`;
-				return;
-			}
-			let t = n(f);
-			try {
-				e.framework.render(t, e.component.component, r, Y);
-			} catch {}
-		}
-	});
-	Y = 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,
-		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
-	});
-	let X = l(), $ = l();
-	return u({
-		clock: A,
-		target: X
-	}), u({
-		clock: X,
-		filter: (e) => e === null,
-		target: z
-	}), u({
-		clock: X,
-		filter: (e) => e !== null,
-		target: $
-	}), d({
-		source: $,
-		match: (e) => m(e) ? "condition" : h(e) ? "step" : g(e) ? "launchExperience" : _(e) ? "origin" : v(e) ? "action" : "other",
-		cases: {
-			origin: B,
-			condition: V,
-			step: R,
-			launchExperience: U,
-			action: H,
-			__: l()
-		}
-	}), u({
-		clock: [
-			V.doneData,
-			B.doneData,
-			z.doneData,
-			G.doneData,
-			W.doneData,
-			H.doneData
-		],
-		filter: Boolean,
-		target: K
-	}), u({
-		clock: b,
-		target: G
-	}), u({
-		clock: b,
-		source: j,
-		filter: Boolean,
-		target: r.eventBus.prepend((e) => ({
-			type: "step_submit",
-			step: e,
-			experience: Y
-		}))
-	}), u({
-		clock: G.done,
-		source: j,
-		filter: Boolean,
-		target: r.eventBus.prepend((e) => ({
-			type: "step_submit_success",
-			step: e,
-			experience: Y
-		}))
-	}), u({
-		clock: G.fail,
-		source: j,
-		filter: Boolean,
-		target: r.eventBus.prepend((e) => ({
-			type: "step_submit_error",
-			step: e,
-			experience: Y
-		}))
-	}), u({
-		clock: x,
-		target: te
-	}), u({
-		clock: S,
-		target: L
-	}), u({
-		clock: C,
-		target: ie
-	}), u({
-		source: a([
-			V.pending,
-			B.pending,
-			z.pending,
-			G.pending,
-			W.pending,
-			H.pending
-		]),
-		fn: (e) => e.some(Boolean) ? "transitioning" : "ready",
-		target: D
-	}), u({
-		clock: R.doneData,
-		source: j,
-		filter: Boolean,
-		target: r.eventBus.prepend((e) => ({
-			type: "step_enter",
-			step: e,
-			experience: Y
-		}))
-	}), u({
-		clock: T,
-		target: q
-	}), u({
-		source: q.doneData,
-		fn: Boolean,
-		target: F
-	}), u({
-		source: A,
-		clock: y,
-		filter: (e) => !e || _(e),
-		target: W
-	}), u({
-		source: F,
-		filter: Boolean,
-		target: y
-	}), u({
-		source: F,
-		filter: Boolean,
-		target: r.eventBus.prepend(() => ({
-			type: "experience_open",
-			experience: Y
-		}))
-	}), u({
-		source: F,
-		filter: (e) => !e,
-		target: r.eventBus.prepend(() => ({
-			type: "experience_close",
-			experience: Y
-		}))
-	}), u({
-		clock: w,
-		target: [T]
-	}), w(), Y;
-});
-function ue(e) {
-	return p($, e);
-}
-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), {
-				...e,
-				[t.experienceId]: n
-			};
-		},
-		unregister(e, t) {
-			let n = t.experienceId, r = e[n]?.filter((e) => e !== t);
-			return {
-				...e,
-				[n]: r ?? []
-			};
-		}
-	}), d = c(({ experience: t, target: n, options: r }) => ue({
-		client: e,
-		experience: t,
-		target: n,
-		options: r
-	})), f = c((e) => {
-		s.register(e);
-	}), p = c((e) => {
-		e.target && r(e.target, () => {
-			a(e);
-		});
-	}), m = c((e) => {
-		s.unregister(e);
-	}), h = c(async (e) => {
-		await e.mountFx();
-	});
-	u({
-		clock: n,
-		target: d
-	}), u({
-		clock: a,
-		target: m
-	}), u({
-		clock: d.doneData,
-		target: [
-			f,
-			p,
-			i
-		]
-	}), u({
-		clock: d.doneData,
-		target: e.eventBus.prepend((e) => ({
-			type: "experience_initialize",
-			experience: e
-		}))
-	}), u({
-		clock: i,
-		target: h
-	});
-	function g(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 });
-	}
-	function y(e) {
-		return t.map((t) => t[e] || [], { skipVoid: !1 });
-	}
-	return {
-		spawn: g,
-		getByExperienceKey: v,
-		getByExperienceId: y,
-		listStore: _
-	};
-});
-function fe(e) {
-	return p(de, 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 };