@oomol-lab/open-flow 0.1.0-beta.3 → 0.1.0-beta.5

package/dist/common/scheduler.js

@@ -1,19 +1,26 @@
 import * as e from "effect/Effect";
 import * as t from "effect/Exit";
 import * as n from "effect/FiberSet";
+//#region ../../node_modules/.bun/nanoid@6.0.1/node_modules/nanoid/url-alphabet/index.js
+var r = "useandom-26T198340PX75pxJACKVERYMINDBUSHWOLF_GQZbfghjklqvwyzrict", i = (e = 21) => {
+	let t = "", n = crypto.getRandomValues(new Uint8Array(e |= 0));
+	for (; e--;) t += r[n[e] & 63];
+	return t;
+};
+//#endregion
 //#region src/flow/common/change.ts
-function r(e) {
+function a(e) {
 	return Object.fromEntries(e.flatMap((e) => "handle" in e ? [[e.handle, e]] : []));
 }
 //#endregion
 //#region src/execution/common/scheduler.ts
-function i(e, t) {
+function o(e, t) {
 	return t?.(e) ?? {
 		code: "node.failed",
 		message: e instanceof Error ? e.message : String(e)
 	};
 }
-var a = class {
+var s = class {
 	#e = [];
 	#t = 0;
 	get length() {
@@ -26,14 +33,19 @@ var a = 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;
 	}
-}, o = class {
+	restore(e) {
+		this.#e.push(...e);
+	}
+	snapshot() {
+		return this.#e.slice(this.#t);
+	}
+}, c = class {
 	#e;
-	#t = new a();
+	#t = new s();
 	#n;
 	#r;
-	constructor(e, t, n) {
-		let r = e.inputs[t];
-		this.#e = r?.kind == "sources", this.#n = !this.#e && (r?.kind == "value" || Object.hasOwn(n, "value")), this.#r = r?.kind == "value" ? r.value : n.value ?? null;
+	constructor(e, t) {
+		this.#e = e?.kind == "sources", this.#n = !this.#e && (e?.kind == "value" || Object.hasOwn(t, "value")), this.#r = e?.kind == "value" ? e.value : t.value ?? null;
 	}
 	get ready() {
 		return this.#t.length > 0 || this.#n;
@@ -50,13 +62,26 @@ var a = class {
 	take() {
 		return this.#t.length > 0 ? this.#t.shift() : this.#r;
 	}
-}, s = class {
+	restore(e) {
+		this.#n = e.provided, this.#r = e.value, this.#t.restore(e.queue);
+	}
+	snapshot() {
+		return {
+			provided: this.#n,
+			queue: this.#t.snapshot(),
+			value: this.#r
+		};
+	}
+}, l = 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 o(t, e, n)])), this.#e = [...this.#n.values()].some((e) => e.dynamic);
+	constructor(e, t, n, r) {
+		this.#t = e, this.#n = new Map(Object.entries(n).map(([e, n]) => {
+			let i = new c(t[e], n), a = r?.slots[e];
+			return a != null && i.restore(a), [e, i];
+		})), this.#e = [...this.#n.values()].some((e) => e.dynamic), this.#r = r?.staticTaken ?? !1;
 	}
 	get ready() {
 		return (!this.#r || this.#e) && [...this.#n.values()].every((e) => e.ready);
@@ -74,36 +99,63 @@ var a = class {
 		if (!this.ready) throw Error(`Node "${this.#t}" inputs are not ready.`);
 		return this.#e || (this.#r = !0), Object.fromEntries([...this.#n].map(([e, t]) => [e, t.take()]));
 	}
-};
-function c(e, t) {
+	snapshot() {
+		return {
+			slots: Object.fromEntries([...this.#n].map(([e, t]) => [e, t.snapshot()])),
+			staticTaken: this.#r
+		};
+	}
+}, u = "notification:";
+function d(e) {
+	return `${u}${e}`;
+}
+function f(e) {
+	return e.kind != "wait" || e.notification == null ? e.inputs : {
+		...e.inputs,
+		...Object.fromEntries(Object.entries(e.notification.inputs).map(([e, t]) => [d(e), t]))
+	};
+}
+function p(e, t) {
 	switch (t.kind) {
 		case "condition": return { [t.input.handle]: t.input };
 		case "value": return {};
-		case "subflow": return r(e.subflows[t.subflowId].inputs);
-		case "task": return r(t.task == null ? e.tasks[t.taskId].inputs : t.task.inputs);
+		case "subflow": return a(e.subflows[t.subflowId].inputs);
+		case "task": return a([...t.task == null ? e.tasks[t.taskId].inputs : t.task.inputs, ...t.additionalInputs ?? []]);
+		case "wait": {
+			let n = t.notification == null ? void 0 : e.tasks[t.notification.taskId];
+			return {
+				value: {
+					jsonSchema: {},
+					nullable: !0,
+					value: null
+				},
+				...t.notification == null || n == null ? {} : Object.fromEntries(n.inputs.flatMap((e) => "handle" in e && e.handle != t.notification.messageHandle ? [[d(e.handle), e]] : []))
+			};
+		}
 	}
 }
-function l(e, t) {
+function m(e, t) {
 	if (t.name != null) return t.name;
 	switch (t.kind) {
 		case "condition": return;
 		case "value": return "Value";
 		case "subflow": return e.subflows[t.subflowId].name;
 		case "task": return t.task == null ? e.tasks[t.taskId].name : t.task.name;
+		case "wait": return "Wait";
 	}
 }
-function u(e, t) {
+function h(e, t) {
 	return t.kind == "task" ? t.task == null ? e.tasks[t.taskId].executor.kind : "javascript" : t.kind;
 }
-function d(e, t, n, r) {
+function g(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 f(e, t, n) {
+function _(e, t, n) {
 	return e.get(t)?.get(n) ?? [];
 }
-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 = [];
+function v(e) {
+	let t = new Map(Object.entries(e.nodes).map(([t, n]) => [t, new Set(Object.values(f(n)).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();
 		if (e.length == 0) throw Error("Prepared graph contains a dependency cycle.");
@@ -112,18 +164,124 @@ function p(e) {
 	}
 	return n;
 }
-function m(e, t) {
+function y(e, t) {
+	let n = new Set(Object.values(e.nodes).flatMap((e) => Object.values(f(e)).flatMap((e) => e.kind == "sources" ? e.sources.filter((e) => e.kind == "node").map((e) => e.nodeId) : [])));
+	return t.filter((e) => !n.has(e));
+}
+function b(e, t) {
+	if (typeof e != "object" || !e || Array.isArray(e)) throw Error(`${t} must be an object.`);
+	return e;
+}
+function x(e, t, n) {
+	let r = Object.keys(e);
+	if (r.length != t.length || r.some((e) => !t.includes(e))) throw Error(`${n} contains unsupported fields.`);
+}
+function S(e, t) {
+	if (typeof e != "string" || e.length == 0) throw Error(`${t} must be a non-empty string.`);
+	return e;
+}
+function C(e, t) {
+	if (!Number.isSafeInteger(e) || Number(e) < 0) throw Error(`${t} must be a non-negative integer.`);
+	return Number(e);
+}
+function w(e, t, n = 0) {
+	if (n > 64) throw Error(`${t} exceeds the maximum JSON depth.`);
+	if (e === null || typeof e == "boolean" || typeof e == "string" || typeof e == "number" && Number.isFinite(e)) return e;
+	if (Array.isArray(e)) return e.map((e) => w(e, t, n + 1));
+	let r = b(e, t);
+	return Object.fromEntries(Object.entries(r).map(([e, r]) => [e, w(r, t, n + 1)]));
+}
+function T(e) {
+	let t = b(e, "Flow Run checkpoint");
+	if (x(t, [
+		"bindingValues",
+		"buffers",
+		"completedNodes",
+		"nextJobs",
+		"outputs",
+		"results",
+		"version",
+		"wait"
+	], "Flow Run checkpoint"), t.version != 1) throw Error("Flow Run checkpoint version is unsupported.");
+	let n = b(t.bindingValues, "Flow Run checkpoint bindings"), r = Object.fromEntries(Object.entries(n).map(([e, t]) => {
+		if (typeof t != "string") throw Error(`Flow Run checkpoint binding "${e}" must be a string.`);
+		return [e, t];
+	})), i = b(t.buffers, "Flow Run checkpoint buffers"), a = Object.fromEntries(Object.entries(i).map(([e, t]) => {
+		let n = b(t, `Flow Run checkpoint buffer "${e}"`);
+		if (x(n, ["slots", "staticTaken"], `Flow Run checkpoint buffer "${e}"`), typeof n.staticTaken != "boolean") throw Error(`Flow Run checkpoint buffer "${e}" staticTaken must be boolean.`);
+		let r = b(n.slots, `Flow Run checkpoint buffer "${e}" slots`);
+		return [e, {
+			slots: Object.fromEntries(Object.entries(r).map(([t, n]) => {
+				let r = b(n, `Flow Run checkpoint slot "${e}/${t}"`);
+				if (x(r, [
+					"provided",
+					"queue",
+					"value"
+				], `Flow Run checkpoint slot "${e}/${t}"`), typeof r.provided != "boolean" || !Array.isArray(r.queue)) throw Error(`Flow Run checkpoint slot "${e}/${t}" is invalid.`);
+				return [t, {
+					provided: r.provided,
+					queue: r.queue.map((n) => w(n, `Flow Run checkpoint slot "${e}/${t}" queue`)),
+					value: w(r.value, `Flow Run checkpoint slot "${e}/${t}" value`)
+				}];
+			})),
+			staticTaken: n.staticTaken
+		}];
+	}));
+	if (!Array.isArray(t.completedNodes) || !Array.isArray(t.results)) throw Error("Flow Run checkpoint result state is invalid.");
+	let o = t.completedNodes.map((e) => S(e, "Flow Run checkpoint completed node")), s = Object.fromEntries(Object.entries(b(t.nextJobs, "Flow Run checkpoint next jobs")).map(([e, t]) => [e, C(t, `Flow Run checkpoint next job "${e}"`)])), c = Object.fromEntries(Object.entries(b(t.outputs, "Flow Run checkpoint outputs")).map(([e, t]) => [e, w(t, `Flow Run checkpoint output "${e}"`)])), l = t.results.map((e, t) => {
+		let n = b(e, `Flow Run checkpoint result ${t}`);
+		if (x(n, ["jobs", "nodeId"], `Flow Run checkpoint result ${t}`), !Array.isArray(n.jobs)) throw Error(`Flow Run checkpoint result ${t} jobs must be an array.`);
+		return {
+			jobs: n.jobs.map((e, n) => {
+				let r = b(e, `Flow Run checkpoint result ${t} job ${n}`);
+				return x(r, [
+					"jobId",
+					"order",
+					"outputs"
+				], `Flow Run checkpoint result ${t} job ${n}`), {
+					jobId: S(r.jobId, `Flow Run checkpoint result ${t} job ${n} ID`),
+					order: C(r.order, `Flow Run checkpoint result ${t} job ${n} order`),
+					outputs: Object.fromEntries(Object.entries(b(r.outputs, `Flow Run checkpoint result ${t} job ${n} outputs`)).map(([e, r]) => [e, w(r, `Flow Run checkpoint result ${t} job ${n} output "${e}"`)]))
+				};
+			}),
+			nodeId: S(n.nodeId, `Flow Run checkpoint result ${t} node ID`)
+		};
+	}), u = b(t.wait, "Flow Run checkpoint wait");
+	return x(u, [
+		"jobId",
+		"nodeId",
+		"order",
+		"value",
+		"waitId"
+	], "Flow Run checkpoint wait"), {
+		bindingValues: r,
+		buffers: a,
+		completedNodes: o,
+		nextJobs: s,
+		outputs: c,
+		results: l,
+		version: 1,
+		wait: {
+			jobId: S(u.jobId, "Flow Run checkpoint wait job ID"),
+			nodeId: S(u.nodeId, "Flow Run checkpoint wait node ID"),
+			order: C(u.order, "Flow Run checkpoint wait order"),
+			value: w(u.value, "Flow Run checkpoint wait value"),
+			waitId: S(u.waitId, "Flow Run checkpoint wait ID")
+		}
+	};
+}
+function E(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) => m(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) => E(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) && m(t, i[e]));
+	return n.length == r.length && n.every(([e, t]) => Object.hasOwn(i, e) && E(t, i[e]));
 }
-function h(e, t, n) {
+function D(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 && m(r, i);
-		case "!=": return i !== void 0 && !m(r, i);
+		case "==": return i !== void 0 && E(r, i);
+		case "!=": return i !== void 0 && !E(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;
@@ -131,7 +289,7 @@ function h(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) => m(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) => E(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);
@@ -144,7 +302,7 @@ function h(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) => m(e, i));
+			let e = Object.values(r).some((e) => E(e, i));
 			return t.operator == "hasValue" ? e : !e;
 		}
 		case "isEmpty":
@@ -158,65 +316,75 @@ function h(e, t, n) {
 		case "isFalse": return r === !1;
 	}
 }
-function g(e, t) {
+function O(e, t) {
 	if (typeof e != "object" || !e || Array.isArray(e)) throw Error(`Node "${t}" must return an object.`);
 	return e;
 }
-function _(a, o, m, v, b, x = {}, S, C) {
+function k(r, s, c, d, b, x = {}, S, C, w) {
 	return e.scoped(e.gen(function* () {
-		yield* a.emit({
-			flowId: o.flowId,
+		w ?? (yield* r.emit({
+			flowId: s.flowId,
 			...b == null ? {} : {
 				parentJobId: b.jobId,
 				parentRunId: b.runId
 			},
-			runId: m,
+			runId: c,
 			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) ?? [];
+		}));
+		let E = v(s.graph), A = y(s.graph, E), M = E.length, N = new Map(Object.entries(s.graph.nodes).map(([e, t]) => [e, new l(e, f(t), p(r.prepared, t), w?.checkpoint.buffers[e])]));
+		if (w != null) {
+			let t = Object.keys(w.checkpoint.buffers).toSorted();
+			if (t.length != E.length || t.some((e, t) => e != [...E].toSorted()[t])) return yield* e.fail(/* @__PURE__ */ Error("Flow Run checkpoint buffers do not match the prepared graph."));
+			for (let [t, n] of Object.entries(s.graph.nodes)) {
+				let i = Object.keys(p(r.prepared, n)).toSorted(), a = Object.keys(w.checkpoint.buffers[t].slots).toSorted();
+				if (i.length != a.length || i.some((e, t) => e != a[t])) return yield* e.fail(/* @__PURE__ */ Error(`Flow Run checkpoint inputs do not match node "${t}".`));
+			}
+		}
+		let P = /* @__PURE__ */ new Map(), F = /* @__PURE__ */ new Map(), I = /* @__PURE__ */ new Map(), L = /* @__PURE__ */ new Map();
+		for (let [e, t] of Object.entries(s.graph.nodes)) for (let [n, r] of Object.entries(f(t))) if (r.kind == "sources") for (let t of r.sources) if (t.kind == "binding") {
+			let r = F.get(t.bindingId) ?? [];
 			r.push({
 				handle: n,
 				nodeId: e
-			}), O.set(t.bindingId, r);
+			}), F.set(t.bindingId, r);
 		} else if (t.kind == "flow") {
-			let r = D.get(t.input) ?? [];
+			let r = P.get(t.input) ?? [];
 			r.push({
 				handle: n,
 				nodeId: e
-			}), D.set(t.input, r);
-		} else t.kind == "node" && d(k, t.nodeId, t.output, {
+			}), P.set(t.input, r);
+		} else t.kind == "node" && g(I, t.nodeId, t.output, {
 			handle: n,
 			nodeId: e
 		});
-		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,
+		for (let [e, t] of Object.entries(s.outputs)) for (let n of t.sources) n.kind == "node" && g(L, n.nodeId, n.output, e);
+		let R = /* @__PURE__ */ new Map(), z = yield* n.make(), B = yield* n.runtime(z)(), V = new Map(w?.checkpoint.results.map((e) => [e.nodeId, [...e.jobs]]) ?? []), H = new Map(Object.entries(w?.checkpoint.nextJobs ?? {})), U = new Map(Object.entries(w?.checkpoint.outputs ?? {})), W = new Set(w?.checkpoint.completedNodes ?? []), G, K, q = w != null, J, Y, X = (e, t) => {
+			G ?? (N.get(e.nodeId).push(e.handle, t), Y(e.nodeId));
+		}, Z = (t, n, i, a) => e.gen(function* () {
+			yield* r.emit({
+				handle: i,
 				jobId: n,
 				nodeId: t,
-				runId: m,
+				runId: c,
 				type: "node.output",
-				value: i
+				value: a
 			});
-			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]) => {
+			for (let e of _(I, t, i)) X(e, a);
+			for (let e of _(L, t, i)) U.set(e, a), S != null && (yield* S(e, a));
+		}), ee = (t, n, i, o) => {
+			let l = e.gen(function* () {
+				let l = h(r.prepared, n), u = m(r.prepared, n), d = Object.fromEntries(Object.entries(o).filter(([e]) => {
+					if (n.kind == "wait") return e == "value";
 					let t = n.inputs[e];
 					return t?.kind != "sources" || t.sources.every((e) => e.kind != "binding");
 				}));
-				yield* a.emit({
+				yield* r.emit({
 					inputs: d,
 					jobId: i,
 					nodeId: t,
-					nodeKind: s,
-					...c == null ? {} : { nodeTitle: c },
-					runId: m,
+					nodeKind: l,
+					...u == null ? {} : { nodeTitle: u },
+					runId: c,
 					type: "node.started"
 				});
 				let f;
@@ -224,159 +392,263 @@ function _(a, o, m, v, b, x = {}, S, C) {
 					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));
+							let t = e.expressions.map((e) => D(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]));
+						f = e == null ? {} : { [e]: o[n.input.handle] ?? null }, e != null && (yield* Z(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);
+						for (let [e, n] of Object.entries(f)) yield* Z(t, i, e, n);
 						break;
 					case "subflow": {
-						let e = a.prepared.subflows[n.subflowId];
-						f = yield* _(a, {
+						let e = r.prepared.subflows[n.subflowId];
+						f = yield* k(r, {
 							flowId: n.subflowId,
-							graph: y(e.graph),
-							inputs: r(e.inputs),
+							graph: j(e.graph),
+							inputs: a(e.inputs),
 							kind: "subflow",
-							outputs: r(e.outputs)
-						}, a.createId(), o, {
+							outputs: a(e.outputs)
+						}, r.createId(), o, {
 							jobId: i,
-							runId: m
-						}, {}, (e, n) => H(t, i, e, n));
+							runId: c
+						}, {}, (e, n) => Z(t, i, e, n));
 						break;
 					}
 					case "task": {
-						let r = yield* a.invokeTask({
-							input: o,
-							invocationId: a.createId(),
+						let a = new Set((n.additionalInputs ?? []).map((e) => e.handle)), l = yield* r.invokeTask({
+							additionalInputs: Object.fromEntries(Object.entries(o).filter(([e]) => a.has(e))),
+							blockId: n.task == null ? n.taskId : n.task.moduleId,
+							flowId: s.flowId,
+							input: Object.fromEntries(Object.entries(o).filter(([e]) => !a.has(e))),
+							invocationId: r.createId(),
 							jobId: i,
 							nodeId: t,
-							runId: m,
+							runId: c,
 							...n.task == null ? { taskId: n.taskId } : {
 								capabilities: n.task.capabilities ?? [],
 								moduleId: n.task.moduleId
 							}
 						});
 						f = yield* e.try({
-							try: () => g(r, t),
+							try: () => O(l, t),
 							catch: (e) => e instanceof Error ? e : Error(String(e))
 						});
-						for (let [e, n] of Object.entries(f)) yield* H(t, i, e, n);
+						for (let [e, n] of Object.entries(f)) yield* Z(t, i, e, n);
 						break;
 					}
+					case "wait": return yield* e.fail(/* @__PURE__ */ Error("Wait jobs are handled by the Scheduler suspension boundary."));
 				}
-				return yield* a.emit({
+				return yield* r.emit({
 					jobId: i,
 					nodeId: t,
-					runId: m,
+					runId: c,
 					type: "node.completed"
 				}), f;
 			});
-			return n.timeoutMs == null ? s : s.pipe(e.timeoutOrElse({
+			return n.timeoutMs == null ? l : l.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) ?? [];
+		}, te = (t) => {
+			let n = s.graph.nodes[t], a = N.get(t).take(), l = r.createId(), d = H.get(t) ?? 0;
+			if (H.set(t, d + 1), n.kind == "wait") {
+				q = !0, J = {
+					actions: n.actions,
+					jobId: l,
+					nodeId: t,
+					...n.notification == null ? {} : { notification: {
+						input: Object.fromEntries(Object.entries(a).flatMap(([e, t]) => e.startsWith(u) ? [[e.slice(13), t]] : [])),
+						messageHandle: n.notification.messageHandle,
+						taskId: n.notification.taskId
+					} },
+					order: d,
+					value: a.value ?? null,
+					waitId: i()
+				};
+				let e = n.inputs.value, o = e?.kind == "sources" && e.sources.some((e) => e.kind == "binding") ? {} : { value: a.value ?? null };
+				B(r.emit({
+					inputs: o,
+					jobId: l,
+					nodeId: t,
+					nodeKind: "wait",
+					...n.name == null ? {} : { nodeTitle: n.name },
+					runId: c,
+					type: "node.started"
+				}));
+				return;
+			}
+			R.set(t, (R.get(t) ?? 0) + 1), B(ee(t, n, l, a).pipe(e.tap((n) => e.gen(function* () {
+				let e = V.get(t) ?? [];
 				e.push({
-					jobId: s,
-					order: c,
+					jobId: l,
+					order: d,
 					outputs: n
-				}), P.set(t, e), L.has(t) || (L.add(t), yield* a.emit({
+				}), V.set(t, e), W.has(t) || (W.add(t), yield* r.emit({
 					...b == null ? {} : {
 						parentJobId: b.jobId,
 						parentRunId: b.runId
 					},
-					progress: L.size / T * 100,
-					runId: m,
+					progress: W.size / M * 100,
+					runId: c,
 					type: "run.progress"
 				}));
 			})), e.tapError((n) => e.gen(function* () {
-				R ?? (z ??= n);
-				let r = i(n, a.projectFailure);
-				yield* a.emit({
-					...r,
-					jobId: s,
+				G ?? (K ??= n);
+				let i = o(n, r.projectFailure);
+				yield* r.emit({
+					...i,
+					jobId: l,
 					nodeId: t,
-					runId: m,
+					runId: c,
 					type: "node.failed"
 				}).pipe(e.ignore);
 			})), e.tapCause((t) => e.sync(() => {
-				R ??= t;
+				G ??= t;
 			})), e.ensuring(e.sync(() => {
-				j.set(t, (j.get(t) ?? 1) - 1), B(t);
+				R.set(t, (R.get(t) ?? 1) - 1), Y(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);
+		if (Y = (e) => {
+			if (G != null || q) return;
+			let t = s.graph.nodes[e], n = N.get(e);
+			for (; n.ready && (R.get(e) ?? 0) < t.concurrency;) te(e);
+		}, w == null) {
+			for (let [e, t] of Object.entries(x)) {
+				let n = N.get(e);
+				if (n != null) for (let [e, r] of Object.entries(t)) n.launch(e, r);
+			}
+			for (let [t, n] of F) {
+				if (!Object.hasOwn(r.bindingValues, t)) return yield* e.fail(/* @__PURE__ */ Error(`Variable binding "${t}" is unresolved.`));
+				for (let e of n) X(e, r.bindingValues[t]);
 			}
+			for (let [e, t] of Object.entries(s.inputs)) {
+				let n = Object.hasOwn(d, e) ? d[e] : t.value;
+				if (n !== void 0) {
+					for (let t of Object.entries(s.outputs)) t[1].sources.some((t) => t.kind == "flow" && t.input == e) && (U.set(t[0], n), S != null && (yield* S(t[0], n)));
+					for (let t of P.get(e) ?? []) X(t, n);
+				}
+			}
+			if (C != null) for (let e of _(I, C.nodeId, "payload")) X(e, C.payload);
+		} else {
+			let t = w.checkpoint.wait, n = s.graph.nodes[t.nodeId];
+			if (n?.kind != "wait" || !n.actions.some((e) => e == w.action)) return yield* e.fail(/* @__PURE__ */ Error("Flow Run checkpoint resolution does not match the prepared Wait node."));
+			if (Object.keys(w.checkpoint.nextJobs).some((e) => s.graph.nodes[e] == null)) return yield* e.fail(/* @__PURE__ */ Error("Flow Run checkpoint job state does not match the prepared graph."));
+			let i = { [w.action]: t.value };
+			yield* Z(t.nodeId, t.jobId, w.action, t.value);
+			let a = V.get(t.nodeId) ?? [];
+			a.push({
+				jobId: t.jobId,
+				order: t.order,
+				outputs: i
+			}), V.set(t.nodeId, a), W.has(t.nodeId) || (W.add(t.nodeId), yield* r.emit({
+				progress: W.size / M * 100,
+				runId: c,
+				type: "run.progress"
+			})), yield* r.emit({
+				jobId: t.jobId,
+				nodeId: t.nodeId,
+				runId: c,
+				type: "node.completed"
+			}), q = !1;
 		}
-		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,
+		for (let e of E) Y(e);
+		let Q = yield* e.raceFirst(n.awaitEmpty(z), n.join(z)).pipe(e.exit);
+		if (K != null) return yield* n.clear(z), yield* r.emit({
+			message: K.message,
+			runId: c,
 			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({
+		}).pipe(e.ignore), yield* e.fail(K);
+		if (G != null) return yield* n.clear(z), yield* e.failCause(G);
+		if (t.isFailure(Q)) return yield* e.failCause(Q.cause);
+		if (J != null) {
+			if (s.kind != "flow") return yield* e.fail(/* @__PURE__ */ Error("Subflow Wait is not supported."));
+			let t = {
+				bindingValues: r.bindingValues,
+				buffers: Object.fromEntries([...N].map(([e, t]) => [e, t.snapshot()])),
+				completedNodes: [...W].toSorted(),
+				nextJobs: Object.fromEntries(H),
+				outputs: Object.fromEntries(U),
+				results: A.map((e) => ({
+					jobs: (V.get(e) ?? []).toSorted((e, t) => e.order - t.order),
+					nodeId: e
+				})),
+				version: 1,
+				wait: {
+					jobId: J.jobId,
+					nodeId: J.nodeId,
+					order: J.order,
+					value: J.value,
+					waitId: J.waitId
+				}
+			}, n = JSON.stringify(t);
+			if (new TextEncoder().encode(n).byteLength > 16777216) {
+				let t = "Flow Run checkpoint exceeds 16 MiB.";
+				return yield* r.emit({
+					code: "run.checkpoint-too-large",
+					jobId: J.jobId,
+					message: t,
+					nodeId: J.nodeId,
+					runId: c,
+					type: "node.failed"
+				}), yield* r.emit({
+					message: t,
+					runId: c,
+					type: "run.failed"
+				}), yield* e.fail(/* @__PURE__ */ Error(`run.checkpoint-too-large: ${t}`));
+			}
+			return {
+				checkpoint: T(JSON.parse(n)),
+				kind: "waiting",
+				...J.notification == null ? {} : { notification: J.notification },
+				wait: {
+					actions: J.actions,
+					jobId: J.jobId,
+					nodeId: J.nodeId,
+					order: J.order,
+					waitId: J.waitId
+				}
+			};
+		}
+		if (s.kind == "subflow") {
+			let e = Object.fromEntries(U);
+			return yield* r.emit({
 				result: {
 					kind: "function-outputs",
 					outputs: e,
 					target: "subflow"
 				},
-				runId: m,
+				runId: c,
 				type: "run.completed"
 			}), e;
 		}
-		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 = {
+		let $ = {
 			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 }) => ({
+			nodes: A.map((e) => ({
+				jobs: (V.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,
+		return yield* r.emit({
+			result: $,
+			runId: c,
 			type: "run.completed"
-		}), q;
+		}), $;
 	}));
 }
-function v(t, n) {
+function A(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 ?? {},
+		if (n.resume != null && (n.inputs != null || n.trigger != null)) return yield* e.fail(/* @__PURE__ */ Error("A resumed Flow Run cannot accept launch inputs or a Trigger seed."));
+		let i = n.resume == null ? void 0 : T(n.resume.checkpoint);
+		if (i != null && new TextEncoder().encode(JSON.stringify(i)).byteLength > 16777216) return yield* e.fail(/* @__PURE__ */ Error("Flow Run checkpoint exceeds 16 MiB."));
+		let a = n.trigger == null ? void 0 : t.graph.nodes[n.trigger.nodeId];
+		return n.trigger != null && (a == null || "inputs" in a) ? yield* e.fail(/* @__PURE__ */ Error(`Node "${n.trigger.nodeId}" is not a TriggerNode in Flow "${n.flowId}".`)) : yield* k({
+			bindingValues: i?.bindingValues ?? n.bindingValues ?? {},
 			createId: n.createId,
 			emit: r,
 			invokeTask: n.invokeTask,
@@ -384,15 +656,18 @@ function v(t, n) {
 			projectFailure: n.projectFailure
 		}, {
 			flowId: n.flowId,
-			graph: y(t.graph),
+			graph: j(t.graph),
 			inputs: {},
 			kind: "flow",
 			outputs: {}
-		}, n.runId, {}, void 0, n.inputs, void 0, n.trigger);
+		}, n.runId, {}, void 0, n.inputs, void 0, n.trigger, i == null ? void 0 : {
+			action: n.resume.action,
+			checkpoint: i
+		});
 	});
 }
-function y(e) {
+function j(e) {
 	return { nodes: Object.fromEntries(Object.entries(e.nodes).filter((e) => "inputs" in e[1])) };
 }
 //#endregion
-export { v as runFlow };
+export { T as decodeFlowRunCheckpoint, A as runFlow };