@oomol-lab/open-flow 0.1.0-alpha.9 → 0.1.0-beta.2

package/dist/common/scheduler.js

@@ -1,16 +1,19 @@
+import * as e from "effect/Effect";
+import * as t from "effect/Exit";
+import * as n from "effect/FiberSet";
 //#region src/flow/common/change.ts
-function e(e) {
-	return Object.fromEntries(e.map((e) => [e.handle, e]));
+function r(e) {
+	return Object.fromEntries(e.flatMap((e) => "handle" in e ? [[e.handle, e]] : []));
 }
 //#endregion
 //#region src/execution/common/scheduler.ts
-function t(e, t) {
+function i(e, t) {
 	return t?.(e) ?? {
 		code: "node.failed",
 		message: e instanceof Error ? e.message : String(e)
 	};
 }
-var n = class {
+var a = class {
 	#e = [];
 	#t = 0;
 	get length() {
@@ -23,9 +26,9 @@ var n = class {
 		let e = this.#e[this.#t];
 		return this.#t += 1, this.#t >= 64 && this.#t * 2 >= this.#e.length && (this.#e.splice(0, this.#t), this.#t = 0), e;
 	}
-}, r = class {
+}, o = class {
 	#e;
-	#t = new n();
+	#t = new a();
 	#n;
 	#r;
 	constructor(e, t, n) {
@@ -47,13 +50,13 @@ var n = class {
 	take() {
 		return this.#t.length > 0 ? this.#t.shift() : this.#r;
 	}
-}, i = class {
+}, s = class {
 	#e;
 	#t;
 	#n;
 	#r = !1;
 	constructor(e, t, n) {
-		this.#t = e, this.#n = new Map(Object.entries(n).map(([e, n]) => [e, new r(t, e, n)])), this.#e = [...this.#n.values()].some((e) => e.dynamic);
+		this.#t = e, this.#n = new Map(Object.entries(n).map(([e, n]) => [e, new o(t, e, n)])), this.#e = [...this.#n.values()].some((e) => e.dynamic);
 	}
 	get ready() {
 		return (!this.#r || this.#e) && [...this.#n.values()].every((e) => e.ready);
@@ -72,15 +75,15 @@ var n = class {
 		return this.#e || (this.#r = !0), Object.fromEntries([...this.#n].map(([e, t]) => [e, t.take()]));
 	}
 };
-function a(t, n) {
-	switch (n.kind) {
-		case "condition": return { [n.input.handle]: n.input };
+function c(e, t) {
+	switch (t.kind) {
+		case "condition": return { [t.input.handle]: t.input };
 		case "value": return {};
-		case "subflow": return e(t.subflows[n.subflowId].inputs);
-		case "task": return e(n.task == null ? t.tasks[n.taskId].inputs : n.task.inputs);
+		case "subflow": return r(e.subflows[t.subflowId].inputs);
+		case "task": return r(t.task == null ? e.tasks[t.taskId].inputs : t.task.inputs);
 	}
 }
-function o(e, t) {
+function l(e, t) {
 	if (t.name != null) return t.name;
 	switch (t.kind) {
 		case "condition": return;
@@ -89,17 +92,17 @@ function o(e, t) {
 		case "task": return t.task == null ? e.tasks[t.taskId].name : t.task.name;
 	}
 }
-function s(e, t) {
+function u(e, t) {
 	return t.kind == "task" ? t.task == null ? e.tasks[t.taskId].executor.kind : "javascript" : t.kind;
 }
-function c(e, t, n, r) {
+function d(e, t, n, r) {
 	let i = e.get(t) ?? /* @__PURE__ */ new Map(), a = i.get(n) ?? [];
 	a.push(r), i.set(n, a), e.set(t, i);
 }
-function l(e, t, n) {
+function f(e, t, n) {
 	return e.get(t)?.get(n) ?? [];
 }
-function u(e) {
+function p(e) {
 	let t = new Map(Object.entries(e.nodes).map(([t, n]) => [t, new Set(Object.values(n.inputs).flatMap((t) => t.kind == "sources" ? t.sources.flatMap((t) => t.kind == "node" && e.nodes[t.nodeId] != null ? [t.nodeId] : []) : []))])), n = [];
 	for (; t.size > 0;) {
 		let e = [...t].filter(([, e]) => e.size == 0).map(([e]) => e).toSorted();
@@ -109,18 +112,18 @@ function u(e) {
 	}
 	return n;
 }
-function d(e, t) {
+function m(e, t) {
 	if (e === t) return !0;
 	if (e == null || t == null || typeof e != "object" || typeof t != "object") return !1;
-	if (Array.isArray(e) || Array.isArray(t)) return Array.isArray(e) && Array.isArray(t) && e.length == t.length && e.every((e, n) => d(e, t[n]));
+	if (Array.isArray(e) || Array.isArray(t)) return Array.isArray(e) && Array.isArray(t) && e.length == t.length && e.every((e, n) => m(e, t[n]));
 	let n = Object.entries(e), r = Object.entries(t), i = t;
-	return n.length == r.length && n.every(([e, t]) => Object.hasOwn(i, e) && d(t, i[e]));
+	return n.length == r.length && n.every(([e, t]) => Object.hasOwn(i, e) && m(t, i[e]));
 }
-function f(e, t, n) {
+function h(e, t, n) {
 	let r = Object.hasOwn(n, t.input) ? n[t.input] : null, i = t.value;
 	switch (t.operator) {
-		case "==": return i !== void 0 && d(r, i);
-		case "!=": return i !== void 0 && !d(r, i);
+		case "==": return i !== void 0 && m(r, i);
+		case "!=": return i !== void 0 && !m(r, i);
 		case ">": return typeof r == "number" && typeof i == "number" && r > i;
 		case ">=": return typeof r == "number" && typeof i == "number" && r >= i;
 		case "<": return typeof r == "number" && typeof i == "number" && r < i;
@@ -128,7 +131,7 @@ function f(e, t, n) {
 		case "contains":
 		case "notContains": {
 			let e;
-			return typeof r == "string" && typeof i == "string" ? e = r.includes(i) : Array.isArray(r) && i !== void 0 && (e = r.some((e) => d(e, i))), e == null ? !1 : t.operator == "contains" ? e : !e;
+			return typeof r == "string" && typeof i == "string" ? e = r.includes(i) : Array.isArray(r) && i !== void 0 && (e = r.some((e) => m(e, i))), e == null ? !1 : t.operator == "contains" ? e : !e;
 		}
 		case "startsWith": return typeof r == "string" && typeof i == "string" && r.startsWith(i);
 		case "endsWith": return typeof r == "string" && typeof i == "string" && r.endsWith(i);
@@ -141,7 +144,7 @@ function f(e, t, n) {
 		case "hasValue":
 		case "notHasValue": {
 			if (r == null || Array.isArray(r) || typeof r != "object" || i === void 0) return !1;
-			let e = Object.values(r).some((e) => d(e, i));
+			let e = Object.values(r).some((e) => m(e, i));
 			return t.operator == "hasValue" ? e : !e;
 		}
 		case "isEmpty":
@@ -155,230 +158,241 @@ function f(e, t, n) {
 		case "isFalse": return r === !1;
 	}
 }
-function p(e, t) {
+function g(e, t) {
 	if (typeof e != "object" || !e || Array.isArray(e)) throw Error(`Node "${t}" must return an object.`);
 	return e;
 }
-function m(e) {
-	return e.reason instanceof Error ? e.reason : /* @__PURE__ */ Error("Run canceled.");
-}
-function h(e, t) {
-	return new Promise((n, r) => {
-		let i = () => {
-			t.removeEventListener("abort", i), r(m(t));
-		};
-		e.then((e) => {
-			t.removeEventListener("abort", i), n(e);
-		}, (e) => {
-			t.removeEventListener("abort", i), r(e);
-		}), t.aborted ? i() : t.addEventListener("abort", i, { once: !0 });
-	});
-}
-async function g(n, r, d, m, _, y, b = {}, x, S) {
-	_.throwIfAborted(), await n.emit({
-		flowId: r.flowId,
-		...y == null ? {} : {
-			parentJobId: y.jobId,
-			parentRunId: y.runId
-		},
-		runId: d,
-		type: "run.started"
-	});
-	let C = u(r.graph), w = C.length, T = new Map(Object.entries(r.graph.nodes).map(([e, t]) => [e, new i(e, t, a(n.prepared, t))])), E = /* @__PURE__ */ new Map(), D = /* @__PURE__ */ new Map(), O = /* @__PURE__ */ new Map();
-	for (let [e, t] of Object.entries(r.graph.nodes)) for (let [n, r] of Object.entries(t.inputs)) if (r.kind == "sources") for (let t of r.sources) if (t.kind == "flow") {
-		let r = E.get(t.input) ?? [];
-		r.push({
+function _(a, o, m, v, b, x = {}, S, C) {
+	return e.scoped(e.gen(function* () {
+		yield* a.emit({
+			flowId: o.flowId,
+			...b == null ? {} : {
+				parentJobId: b.jobId,
+				parentRunId: b.runId
+			},
+			runId: m,
+			type: "run.started"
+		});
+		let w = p(o.graph), T = w.length, E = new Map(Object.entries(o.graph.nodes).map(([e, t]) => [e, new s(e, t, c(a.prepared, t))])), D = /* @__PURE__ */ new Map(), O = /* @__PURE__ */ new Map(), k = /* @__PURE__ */ new Map(), A = /* @__PURE__ */ new Map();
+		for (let [e, t] of Object.entries(o.graph.nodes)) for (let [n, r] of Object.entries(t.inputs)) if (r.kind == "sources") for (let t of r.sources) if (t.kind == "binding") {
+			let r = O.get(t.bindingId) ?? [];
+			r.push({
+				handle: n,
+				nodeId: e
+			}), O.set(t.bindingId, r);
+		} else if (t.kind == "flow") {
+			let r = D.get(t.input) ?? [];
+			r.push({
+				handle: n,
+				nodeId: e
+			}), D.set(t.input, r);
+		} else t.kind == "node" && d(k, t.nodeId, t.output, {
 			handle: n,
 			nodeId: e
-		}), E.set(t.input, r);
-	} else t.kind == "node" && c(D, t.nodeId, t.output, {
-		handle: n,
-		nodeId: e
-	});
-	for (let [e, t] of Object.entries(r.outputs)) for (let n of t.sources) n.kind == "node" && c(O, n.nodeId, n.output, e);
-	let k = /* @__PURE__ */ new Map(), A = /* @__PURE__ */ new Set(), j = /* @__PURE__ */ new Map(), M = /* @__PURE__ */ new Map(), N = /* @__PURE__ */ new Map(), P = /* @__PURE__ */ new Set(), F = new AbortController(), I = AbortSignal.any([_, F.signal]), L, R = !1, z, B = (e, t) => {
-		F.signal.aborted || (T.get(e.nodeId).push(e.handle, t), z(e.nodeId));
-	}, V = async (e, t, r, i) => {
-		await n.emit({
-			handle: r,
-			jobId: t,
-			nodeId: e,
-			runId: d,
-			type: "node.output",
-			value: i
 		});
-		for (let t of l(D, e, r)) B(t, i);
-		for (let t of l(O, e, r)) N.set(t, i), await x?.(t, i);
-	}, H = async (t, r, i, a) => {
-		let c = s(n.prepared, r), l = o(n.prepared, r);
-		await n.emit({
-			inputs: a,
-			jobId: i,
-			nodeId: t,
-			nodeKind: c,
-			...l == null ? {} : { nodeTitle: l },
-			runId: d,
-			type: "node.started"
-		});
-		let u = r.timeoutMs == null ? void 0 : new AbortController(), m = u == null ? void 0 : setTimeout(() => u.abort(/* @__PURE__ */ Error(`Node "${t}" timed out.`)), r.timeoutMs), _ = u == null ? I : AbortSignal.any([I, u.signal]);
-		try {
-			let o;
-			switch (r.kind) {
-				case "condition": {
-					let e = r.cases.find((e) => {
-						if (e.expressions.length == 0) return !1;
-						let t = e.expressions.map((e) => f(r, e, a));
-						return e.relation == "all" ? t.every(Boolean) : t.some(Boolean);
-					})?.output ?? r.defaultOutput;
-					o = e == null ? {} : { [e]: a[r.input.handle] ?? null }, e != null && await V(t, i, e, o[e]);
-					break;
-				}
-				case "value":
-					o = Object.fromEntries(r.values.map((e) => [e.handle, e.value ?? null]));
-					for (let [e, n] of Object.entries(o)) await V(t, i, e, n);
-					break;
-				case "subflow": {
-					let s = n.prepared.subflows[r.subflowId];
-					o = await h(g(n, {
-						flowId: r.subflowId,
-						graph: v(s.graph),
-						inputs: e(s.inputs),
-						kind: "subflow",
-						outputs: e(s.outputs)
-					}, n.createId(), a, _, {
-						jobId: i,
-						runId: d
-					}, {}, (e, n) => V(t, i, e, n)), _);
-					break;
+		for (let [e, t] of Object.entries(o.outputs)) for (let n of t.sources) n.kind == "node" && d(A, n.nodeId, n.output, e);
+		let j = /* @__PURE__ */ new Map(), M = yield* n.make(), N = yield* n.runtime(M)(), P = /* @__PURE__ */ new Map(), F = /* @__PURE__ */ new Map(), I = /* @__PURE__ */ new Map(), L = /* @__PURE__ */ new Set(), R, z, B, V = (e, t) => {
+			R ?? (E.get(e.nodeId).push(e.handle, t), B(e.nodeId));
+		}, H = (t, n, r, i) => e.gen(function* () {
+			yield* a.emit({
+				handle: r,
+				jobId: n,
+				nodeId: t,
+				runId: m,
+				type: "node.output",
+				value: i
+			});
+			for (let e of f(k, t, r)) V(e, i);
+			for (let e of f(A, t, r)) I.set(e, i), S != null && (yield* S(e, i));
+		}), U = (t, n, i, o) => {
+			let s = e.gen(function* () {
+				let s = u(a.prepared, n), c = l(a.prepared, n), d = Object.fromEntries(Object.entries(o).filter(([e]) => {
+					let t = n.inputs[e];
+					return t?.kind != "sources" || t.sources.every((e) => e.kind != "binding");
+				}));
+				yield* a.emit({
+					inputs: d,
+					jobId: i,
+					nodeId: t,
+					nodeKind: s,
+					...c == null ? {} : { nodeTitle: c },
+					runId: m,
+					type: "node.started"
+				});
+				let f;
+				switch (n.kind) {
+					case "condition": {
+						let e = n.cases.find((e) => {
+							if (e.expressions.length == 0) return !1;
+							let t = e.expressions.map((e) => h(n, e, o));
+							return e.relation == "all" ? t.every(Boolean) : t.some(Boolean);
+						})?.output ?? n.defaultOutput;
+						f = e == null ? {} : { [e]: o[n.input.handle] ?? null }, e != null && (yield* H(t, i, e, f[e]));
+						break;
+					}
+					case "value":
+						f = Object.fromEntries(n.values.map((e) => [e.handle, e.value ?? null]));
+						for (let [e, n] of Object.entries(f)) yield* H(t, i, e, n);
+						break;
+					case "subflow": {
+						let e = a.prepared.subflows[n.subflowId];
+						f = yield* _(a, {
+							flowId: n.subflowId,
+							graph: y(e.graph),
+							inputs: r(e.inputs),
+							kind: "subflow",
+							outputs: r(e.outputs)
+						}, a.createId(), o, {
+							jobId: i,
+							runId: m
+						}, {}, (e, n) => H(t, i, e, n));
+						break;
+					}
+					case "task": {
+						let r = yield* a.invokeTask({
+							input: o,
+							invocationId: a.createId(),
+							jobId: i,
+							nodeId: t,
+							runId: m,
+							...n.task == null ? { taskId: n.taskId } : {
+								capabilities: n.task.capabilities ?? [],
+								moduleId: n.task.moduleId
+							}
+						});
+						f = yield* e.try({
+							try: () => g(r, t),
+							catch: (e) => e instanceof Error ? e : Error(String(e))
+						});
+						for (let [e, n] of Object.entries(f)) yield* H(t, i, e, n);
+						break;
+					}
 				}
-				case "task":
-					o = p(await h(n.invokeTask({
-						input: a,
-						invocationId: n.createId(),
-						jobId: i,
-						nodeId: t,
-						runId: d,
-						signal: _,
-						...r.task == null ? { taskId: r.taskId } : {
-							capabilities: r.task.capabilities ?? [],
-							moduleId: r.task.moduleId
-						}
-					}), _), t);
-					for (let [e, n] of Object.entries(o)) await V(t, i, e, n);
+				return yield* a.emit({
+					jobId: i,
+					nodeId: t,
+					runId: m,
+					type: "node.completed"
+				}), f;
+			});
+			return n.timeoutMs == null ? s : s.pipe(e.timeoutOrElse({
+				duration: n.timeoutMs,
+				orElse: () => e.fail(/* @__PURE__ */ Error(`Node "${t}" timed out.`))
+			}));
+		}, W = (t) => {
+			let n = o.graph.nodes[t], r = E.get(t).take(), s = a.createId(), c = F.get(t) ?? 0;
+			F.set(t, c + 1), j.set(t, (j.get(t) ?? 0) + 1), N(U(t, n, s, r).pipe(e.tap((n) => e.gen(function* () {
+				let e = P.get(t) ?? [];
+				e.push({
+					jobId: s,
+					order: c,
+					outputs: n
+				}), P.set(t, e), L.has(t) || (L.add(t), yield* a.emit({
+					...b == null ? {} : {
+						parentJobId: b.jobId,
+						parentRunId: b.runId
+					},
+					progress: L.size / T * 100,
+					runId: m,
+					type: "run.progress"
+				}));
+			})), e.tapError((n) => e.gen(function* () {
+				R ?? (z ??= n);
+				let r = i(n, a.projectFailure);
+				yield* a.emit({
+					...r,
+					jobId: s,
+					nodeId: t,
+					runId: m,
+					type: "node.failed"
+				}).pipe(e.ignore);
+			})), e.tapCause((t) => e.sync(() => {
+				R ??= t;
+			})), e.ensuring(e.sync(() => {
+				j.set(t, (j.get(t) ?? 1) - 1), B(t);
+			}))));
+		};
+		B = (e) => {
+			if (R != null) return;
+			let t = o.graph.nodes[e], n = E.get(e);
+			for (; n.ready && (j.get(e) ?? 0) < t.concurrency;) W(e);
+		};
+		for (let [e, t] of Object.entries(x)) {
+			let n = E.get(e);
+			if (n != null) for (let [e, r] of Object.entries(t)) n.launch(e, r);
+		}
+		for (let [t, n] of O) {
+			if (!Object.hasOwn(a.bindingValues, t)) return yield* e.fail(/* @__PURE__ */ Error(`Variable binding "${t}" is unresolved.`));
+			for (let e of n) V(e, a.bindingValues[t]);
+		}
+		for (let [e, t] of Object.entries(o.inputs)) {
+			let n = Object.hasOwn(v, e) ? v[e] : t.value;
+			if (n !== void 0) {
+				for (let t of Object.entries(o.outputs)) t[1].sources.some((t) => t.kind == "flow" && t.input == e) && (I.set(t[0], n), S != null && (yield* S(t[0], n)));
+				for (let t of D.get(e) ?? []) V(t, n);
 			}
-			return await n.emit({
-				jobId: i,
-				nodeId: t,
-				runId: d,
-				type: "node.completed"
-			}), o;
-		} finally {
-			m != null && clearTimeout(m);
 		}
-	}, U = (e) => {
-		let i = r.graph.nodes[e], a = T.get(e).take(), o = n.createId(), s = M.get(e) ?? 0;
-		M.set(e, s + 1), k.set(e, (k.get(e) ?? 0) + 1);
-		let c = Promise.resolve();
-		c = H(e, i, o, a).then(async (t) => {
-			let r = j.get(e) ?? [];
-			r.push({
-				jobId: o,
-				order: s,
-				outputs: t
-			}), j.set(e, r), P.has(e) || (P.add(e), await n.emit({
-				...y == null ? {} : {
-					parentJobId: y.jobId,
-					parentRunId: y.runId
+		if (C != null) for (let e of f(k, C.nodeId, "payload")) V(e, C.payload);
+		for (let e of w) B(e);
+		let G = yield* e.raceFirst(n.awaitEmpty(M), n.join(M)).pipe(e.exit);
+		if (z != null) return yield* n.clear(M), yield* a.emit({
+			message: z.message,
+			runId: m,
+			type: "run.failed"
+		}).pipe(e.ignore), yield* e.fail(z);
+		if (R != null) return yield* n.clear(M), yield* e.failCause(R);
+		if (t.isFailure(G)) return yield* e.failCause(G.cause);
+		if (o.kind == "subflow") {
+			let e = Object.fromEntries(I);
+			return yield* a.emit({
+				result: {
+					kind: "function-outputs",
+					outputs: e,
+					target: "subflow"
 				},
-				progress: P.size / w * 100,
-				runId: d,
-				type: "run.progress"
-			}));
-		}).catch(async (r) => {
-			R || (R = !0, L = r, F.abort(r));
-			let i = t(r, n.projectFailure);
-			await n.emit({
-				...i,
-				jobId: o,
-				nodeId: e,
-				runId: d,
-				type: "node.failed"
-			}).catch(() => void 0);
-		}).finally(() => {
-			A.delete(c), k.set(e, (k.get(e) ?? 1) - 1), z(e);
-		}), A.add(c);
-	};
-	z = (e) => {
-		if (F.signal.aborted) return;
-		let t = r.graph.nodes[e], n = T.get(e);
-		for (; n.ready && (k.get(e) ?? 0) < t.concurrency;) U(e);
-	};
-	for (let [e, t] of Object.entries(b)) {
-		let n = T.get(e);
-		if (n != null) for (let [e, r] of Object.entries(t)) n.launch(e, r);
-	}
-	for (let [e, t] of Object.entries(r.inputs)) {
-		let n = Object.hasOwn(m, e) ? m[e] : t.value;
-		if (n !== void 0) {
-			for (let t of Object.entries(r.outputs)) t[1].sources.some((t) => t.kind == "flow" && t.input == e) && (N.set(t[0], n), await x?.(t[0], n));
-			for (let t of E.get(e) ?? []) B(t, n);
+				runId: m,
+				type: "run.completed"
+			}), e;
 		}
-	}
-	if (S != null) for (let e of l(D, S.nodeId, "payload")) B(e, S.payload);
-	for (let e of C) z(e);
-	for (; A.size > 0;) await Promise.race(A);
-	if (R) throw await n.emit({
-		message: L instanceof Error ? L.message : String(L),
-		runId: d,
-		type: "run.failed"
-	}).catch(() => void 0), L;
-	if (I.throwIfAborted(), r.kind == "subflow") {
-		let e = Object.fromEntries(N);
-		return await n.emit({
-			result: {
-				kind: "function-outputs",
-				outputs: e,
-				target: "subflow"
-			},
-			runId: d,
+		let K = new Set(Object.values(o.graph.nodes).flatMap((e) => Object.values(e.inputs).flatMap((e) => e.kind == "sources" ? e.sources.filter((e) => e.kind == "node").map((e) => e.nodeId) : []))), q = {
+			kind: "node-results",
+			nodes: w.filter((e) => !K.has(e)).map((e) => ({
+				jobs: (P.get(e) ?? []).toSorted((e, t) => e.order - t.order).map(({ jobId: e, outputs: t }) => ({
+					jobId: e,
+					outputs: t
+				})),
+				nodeId: e
+			}))
+		};
+		return yield* a.emit({
+			result: q,
+			runId: m,
 			type: "run.completed"
-		}), e;
-	}
-	let W = new Set(Object.values(r.graph.nodes).flatMap((e) => Object.values(e.inputs).flatMap((e) => e.kind == "sources" ? e.sources.filter((e) => e.kind == "node").map((e) => e.nodeId) : []))), G = {
-		kind: "node-results",
-		nodes: C.filter((e) => !W.has(e)).map((e) => ({
-			jobs: (j.get(e) ?? []).toSorted((e, t) => e.order - t.order).map(({ jobId: e, outputs: t }) => ({
-				jobId: e,
-				outputs: t
-			})),
-			nodeId: e
-		}))
-	};
-	return await n.emit({
-		result: G,
-		runId: d,
-		type: "run.completed"
-	}), G;
+		}), q;
+	}));
 }
-async function _(e, t) {
-	let n = async (e) => await t.emit?.(e), r = t.signal ?? new AbortController().signal, i = t.trigger == null ? void 0 : e.graph.nodes[t.trigger.nodeId];
-	if (t.trigger != null && (i == null || "inputs" in i)) throw Error(`Node "${t.trigger.nodeId}" is not a TriggerNode in Flow "${t.flowId}".`);
-	return await g({
-		createId: t.createId,
-		emit: n,
-		invokeTask: t.invokeTask,
-		prepared: e,
-		projectFailure: t.projectFailure
-	}, {
-		flowId: t.flowId,
-		graph: v(e.graph),
-		inputs: {},
-		kind: "flow",
-		outputs: {}
-	}, t.runId, {}, r, void 0, t.inputs, void 0, t.trigger);
+function v(t, n) {
+	let r = n.emit ?? (() => e.void);
+	return e.gen(function* () {
+		let i = n.trigger == null ? void 0 : t.graph.nodes[n.trigger.nodeId];
+		return n.trigger != null && (i == null || "inputs" in i) ? yield* e.fail(/* @__PURE__ */ Error(`Node "${n.trigger.nodeId}" is not a TriggerNode in Flow "${n.flowId}".`)) : yield* _({
+			bindingValues: n.bindingValues ?? {},
+			createId: n.createId,
+			emit: r,
+			invokeTask: n.invokeTask,
+			prepared: t,
+			projectFailure: n.projectFailure
+		}, {
+			flowId: n.flowId,
+			graph: y(t.graph),
+			inputs: {},
+			kind: "flow",
+			outputs: {}
+		}, n.runId, {}, void 0, n.inputs, void 0, n.trigger);
+	});
 }
-function v(e) {
+function y(e) {
 	return { nodes: Object.fromEntries(Object.entries(e.nodes).filter((e) => "inputs" in e[1])) };
 }
 //#endregion
-export { _ as runFlow };
+export { v as runFlow };

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@oomol-lab/open-flow",
-  "version": "0.1.0-alpha.9",
+  "version": "0.1.0-beta.2",
   "description": "TypeScript contracts and Browser runtime for Open Flow.",
   "license": "Apache-2.0",
   "repository": {
@@ -37,6 +37,10 @@
       "types": "./dist/common/integration-trigger.d.ts",
       "import": "./dist/common/integration-trigger.js"
     },
+    "./localization": {
+      "types": "./dist/common/localization.d.ts",
+      "import": "./dist/common/localization.js"
+    },
     "./poll-trigger": {
       "types": "./dist/common/poll-trigger.d.ts",
       "import": "./dist/common/poll-trigger.js"
@@ -88,6 +92,10 @@
     "./workbench.css": {
       "types": "./dist/browser/workbench.css.d.ts",
       "default": "./dist/browser/workbench.css"
+    },
+    "./theme.css": {
+      "types": "./dist/browser/theme.css.d.ts",
+      "default": "./dist/browser/theme.css"
     }
   },
   "files": [
@@ -97,6 +105,7 @@
     "LICENSE"
   ],
   "peerDependencies": {
+    "effect": "4.0.0-rc.112",
     "react": "^18.3.1 || ^19.0.0",
     "react-dom": "^18.3.1 || ^19.0.0"
   },