@oomol-lab/open-flow 0.1.0-beta.6 → 0.1.0-beta.8

package/dist/browser/{createResourceDialog-Cf7QpXp6.js → createResourceDialog-DNBueSYZ.js}

@@ -1,7 +1,7 @@
 import { a as e } from "./main-DmjVyuWr.js";
 import { At as t, B as n, Ct as r, F as i, In as a, Kn as o, L as s, M as c, Mt as l, On as u, P as d, Pt as f, Qn as p, R as m, Rt as h, Tt as g, Un as _, V as v, Vn as y, W as b, Z as x, Zt as S, c as C, en as w, et as T, i as E, jt as D, kn as ee, lt as O, n as te, nt as k, o as ne, p as A, sr as j, tr as M, x as N, z as P } from "./getPseudoElementBounds-5LArT6Xc.js";
-import { c as F, d as re, f as I, l as L, o as ie, t as ae, u as oe } from "./icons-CRxvozBE.js";
-import { t as se } from "./workbenchSelect-Cf1zlVm9.js";
+import { c as F, d as re, f as I, l as L, o as ie, t as ae, u as oe } from "./icons-KIOgjHpD.js";
+import { t as se } from "./workbenchSelect-CbXrdwxW.js";
 import * as R from "react";
 import { useEffect as ce, useRef as z, useState as le } from "react";
 import { Fragment as ue, jsx as B, jsxs as V } from "react/jsx-runtime";

package/dist/browser/{esm-CTcBY7hh.js → esm-D6nXYREP.js}

@@ -1,6 +1,6 @@
 import { I as e, j as t, t as n } from "./dist-DxahK_I8.js";
 import { r } from "./dist-BKuSVKCC.js";
-import { r as i } from "./flowWorkspace-CPBHm14t.js";
+import { r as i } from "./flowWorkspace-BP4a-oo7.js";
 //#region ../../node_modules/.bun/@uiw+codemirror-themes@4.25.11/node_modules/@uiw/codemirror-themes/esm/index.js
 var a = (e) => {
 	var i = e.theme, a = e.settings, o = a === void 0 ? {} : a, s = e.styles, c = s === void 0 ? [] : s, l = { ".cm-gutters": {} }, u = {};

package/dist/browser/flow-authoring.js

@@ -41,14 +41,18 @@ function i(e, t) {
 }
 //#endregion
 //#region src/flow/common/change.ts
-var a = class extends Error {};
-function o() {
-	throw new a();
+var a = class extends Error {
+	constructor(e) {
+		super(e), this.name = "FlowChangeError";
+	}
+};
+function o(e) {
+	throw new a(e);
 }
 function s(e, t) {
 	if (t.kind == "flow") return e.graph;
 	let n = e.subflows[t.id];
-	return n ?? o(), n.graph;
+	return n ?? o("The target Subflow does not exist."), n.graph;
 }
 function c(e, t, n) {
 	if (t.kind == "flow") return {
@@ -56,7 +60,7 @@ function c(e, t, n) {
 		graph: n
 	};
 	let r = e.subflows[t.id];
-	return r ?? o(), {
+	return r ?? o("The target Subflow does not exist."), {
 		...e,
 		subflows: {
 			...e.subflows,
@@ -87,20 +91,20 @@ function u(e, t) {
 	let n = { ...e.document }, r = { ...e.modules };
 	for (let e of t) switch (e.kind) {
 		case "binding.create":
-			n.bindings[e.bindingId] != null && o(), n.bindings = {
+			n.bindings[e.bindingId] != null && o("A Binding with this ID already exists."), n.bindings = {
 				...n.bindings,
 				[e.bindingId]: e.binding
 			};
 			break;
 		case "binding.delete": {
-			n.bindings[e.bindingId] ?? o();
+			n.bindings[e.bindingId] ?? o("The Binding does not exist.");
 			let t = { ...n.bindings };
 			delete t[e.bindingId], n.bindings = t;
 			break;
 		}
 		case "binding.target.set": {
 			let t = n.bindings[e.bindingId];
-			(t == null || t.target != e.before) && o(), n.bindings = {
+			t ?? o("The Binding does not exist."), t.target != e.before && o("The Binding target changed before this operation was applied."), n.bindings = {
 				...n.bindings,
 				[e.bindingId]: {
 					...t,
@@ -111,17 +115,17 @@ function u(e, t) {
 		}
 		case "graph.edge.connect": {
 			let t = s(n, e.target);
-			t.nodes[e.edge.source] ?? o();
+			t.nodes[e.edge.source] ?? o("The source Node does not exist.");
 			let r = t.nodes[e.edge.target];
-			(r == null || !("inputs" in r)) && o();
+			(r == null || !("inputs" in r)) && o("The target Node does not accept inputs.");
 			let a = r.inputs[e.edge.targetHandle];
-			i(a, e.before) || o();
+			i(a, e.before) || o("The target input changed before this operation was applied.");
 			let l = {
 				kind: "node",
 				nodeId: e.edge.source,
 				output: e.edge.sourceHandle
 			}, u = a?.kind == "sources" ? a.sources.filter((e) => e.kind != "binding" || n.bindings[e.bindingId]?.kind != "variable") : [];
-			u.some((e) => e.kind == "node" && e.nodeId == l.nodeId && e.output == l.output) && o();
+			u.some((e) => e.kind == "node" && e.nodeId == l.nodeId && e.output == l.output) && o("The Nodes are already connected.");
 			let d = {
 				...r,
 				inputs: {
@@ -140,11 +144,11 @@ function u(e, t) {
 		}
 		case "graph.edge.disconnect": {
 			let t = s(n, e.target), r = t.nodes[e.edge.target];
-			(r == null || !("inputs" in r)) && o();
+			(r == null || !("inputs" in r)) && o("The target Node does not accept inputs.");
 			let a = r.inputs[e.edge.targetHandle];
-			(a?.kind != "sources" || !i(a, e.before)) && o();
+			(a?.kind != "sources" || !i(a, e.before)) && o("The target input changed before this operation was applied.");
 			let l = a.sources.filter((t) => t.kind != "node" || t.nodeId != e.edge.source || t.output != e.edge.sourceHandle);
-			l.length == a.sources.length && o();
+			l.length == a.sources.length && o("The Nodes are not connected.");
 			let u = { ...r.inputs };
 			l.length == 0 ? delete u[e.edge.targetHandle] : u[e.edge.targetHandle] = {
 				kind: "sources",
@@ -160,7 +164,7 @@ function u(e, t) {
 		}
 		case "graph.node.additional-inputs.set": {
 			let t = s(n, e.target), r = t.nodes[e.nodeId];
-			(r?.kind != "task" || !i(r.additionalInputs, e.before)) && o();
+			r?.kind != "task" && o("The Task Node does not exist."), i(r.additionalInputs, e.before) || o("The Task Node inputs changed before this operation was applied.");
 			let { additionalInputs: a, ...l } = r, u = e.value == null ? l : {
 				...l,
 				additionalInputs: e.value
@@ -173,7 +177,7 @@ function u(e, t) {
 		}
 		case "graph.node.condition.set": {
 			let t = s(n, e.target), r = t.nodes[e.nodeId];
-			r?.kind != "condition" && o(), (!i(r.cases, e.before.cases) || r.defaultOutput != e.before.defaultOutput || !i(r.input, e.before.input)) && o();
+			r?.kind != "condition" && o("The Condition Node does not exist."), (!i(r.cases, e.before.cases) || r.defaultOutput != e.before.defaultOutput || !i(r.input, e.before.input)) && o("The Condition Node changed before this operation was applied.");
 			let { defaultOutput: a, ...l } = r, u = e.value.defaultOutput == null ? {
 				...l,
 				...e.value
@@ -189,7 +193,7 @@ function u(e, t) {
 		}
 		case "graph.node.create": {
 			let t = s(n, e.target);
-			(t.nodes[e.nodeId] != null || e.target.kind == "subflow" && !("inputs" in e.node)) && o(), Object.assign(n, c(n, e.target, { nodes: {
+			t.nodes[e.nodeId] != null && o("A Node with this ID already exists in the target graph."), e.target.kind == "subflow" && !("inputs" in e.node) && o("Trigger Nodes cannot be created inside a Subflow."), Object.assign(n, c(n, e.target, { nodes: {
 				...t.nodes,
 				[e.nodeId]: e.node
 			} }));
@@ -197,7 +201,7 @@ function u(e, t) {
 		}
 		case "graph.node.delete": {
 			let t = s(n, e.target);
-			t.nodes[e.nodeId] ?? o();
+			t.nodes[e.nodeId] ?? o("The Node does not exist in the target graph.");
 			let r = /* @__PURE__ */ new Set([e.nodeId]), i = Object.fromEntries(Object.entries(t.nodes).flatMap(([e, t]) => r.has(e) ? [] : [[e, l(t, r)]]));
 			if (Object.assign(n, c(n, e.target, { nodes: i })), e.target.kind == "subflow") {
 				let t = n.subflows[e.target.id], i = t.outputs.map((e) => ({
@@ -216,7 +220,7 @@ function u(e, t) {
 		}
 		case "graph.node.field.set": {
 			let t = s(n, e.target), r = t.nodes[e.nodeId];
-			(r == null || !i(Reflect.get(r, e.field), e.before)) && o(), e.field == "concurrency" && e.value == null && o();
+			r ?? o("The Node does not exist in the target graph."), i(Reflect.get(r, e.field), e.before) || o("The Node field changed before this operation was applied."), e.field == "concurrency" && e.value == null && o("Node concurrency cannot be removed.");
 			let a = { ...r };
 			e.value == null ? Reflect.deleteProperty(a, e.field) : Object.assign(a, { [e.field]: e.value }), Object.assign(n, c(n, e.target, { nodes: {
 				...t.nodes,
@@ -226,7 +230,7 @@ function u(e, t) {
 		}
 		case "graph.node.input.set": {
 			let t = s(n, e.target), r = t.nodes[e.nodeId];
-			(r == null || !("inputs" in r) || !i(r.inputs[e.handle], e.before)) && o();
+			(r == null || !("inputs" in r)) && o("The Node does not accept inputs."), i(r.inputs[e.handle], e.before) || o("The Node input changed before this operation was applied.");
 			let a = { ...r.inputs };
 			e.value == null ? delete a[e.handle] : a[e.handle] = e.value, Object.assign(n, c(n, e.target, { nodes: {
 				...t.nodes,
@@ -239,7 +243,7 @@ function u(e, t) {
 		}
 		case "graph.node.task.name.set": {
 			let t = s(n, e.target), r = t.nodes[e.nodeId];
-			(r?.kind != "task" || r.task == null || r.task.name != e.before) && o();
+			(r?.kind != "task" || r.task == null) && o("The inline Task Node does not exist."), r.task.name != e.before && o("The inline Task name changed before this operation was applied.");
 			let i = {
 				...r,
 				task: {
@@ -255,10 +259,10 @@ function u(e, t) {
 		}
 		case "graph.node.task.ports.set": {
 			let t = s(n, e.target), r = t.nodes[e.nodeId];
-			(r?.kind != "task" || r.task == null || !i({
+			(r?.kind != "task" || r.task == null) && o("The inline Task Node does not exist."), i({
 				inputs: r.task.inputs,
 				outputs: r.task.outputs
-			}, e.before)) && o();
+			}, e.before) || o("The inline Task ports changed before this operation was applied.");
 			let a = {
 				...r,
 				task: {
@@ -274,7 +278,7 @@ function u(e, t) {
 		}
 		case "graph.node.values.set": {
 			let t = s(n, e.target), r = t.nodes[e.nodeId];
-			(r?.kind != "value" || !i(r.values, e.before)) && o(), Object.assign(n, c(n, e.target, { nodes: {
+			r?.kind != "value" && o("The Value Node does not exist."), i(r.values, e.before) || o("The Value Node changed before this operation was applied."), Object.assign(n, c(n, e.target, { nodes: {
 				...t.nodes,
 				[e.nodeId]: {
 					...r,
@@ -289,7 +293,7 @@ function u(e, t) {
 				actions: r.actions,
 				...r.notification == null ? {} : { notification: r.notification },
 				prompt: r.prompt
-			}, e.before)) && o();
+			}, e.before)) && o("The Wait Node changed before this operation was applied.");
 			let { notification: a, ...s } = r, c = e.value.notification == null ? {
 				...s,
 				...e.value
@@ -305,7 +309,7 @@ function u(e, t) {
 		}
 		case "graph.node.webhook.set": {
 			let t = s(n, e.target), r = t.nodes[e.nodeId];
-			(r?.kind != "webhook" || !i(r.inputsDef, e.before.inputsDef) || !i(r.options, e.before.options)) && o();
+			r?.kind != "webhook" && o("The Webhook Node does not exist."), (!i(r.inputsDef, e.before.inputsDef) || !i(r.options, e.before.options)) && o("The Webhook Node changed before this operation was applied.");
 			let { options: a, ...l } = r, u = e.value.options == null ? {
 				...l,
 				inputsDef: e.value.inputsDef
@@ -321,7 +325,7 @@ function u(e, t) {
 		}
 		case "graph.trigger.config.set": {
 			let t = n.graph, r = t.nodes[e.nodeId];
-			(r == null || r.kind != "integration" && r.kind != "poll" || !i(r.config[e.name], e.before)) && o();
+			(r == null || r.kind != "integration" && r.kind != "poll") && o("The configurable Trigger Node does not exist."), i(r.config[e.name], e.before) || o("The Trigger configuration changed before this operation was applied.");
 			let a = { ...r.config };
 			e.value === void 0 ? delete a[e.name] : a[e.name] = e.value, n.graph = { nodes: {
 				...t.nodes,
@@ -334,7 +338,7 @@ function u(e, t) {
 		}
 		case "graph.trigger.schedule.set": {
 			let t = n.graph, r = t.nodes[e.nodeId];
-			(r == null || r.kind != "cron" && r.kind != "poll") && o(), i(r.kind == "cron" ? r.cronTimes : r.pollTimes, e.before) || o();
+			(r == null || r.kind != "cron" && r.kind != "poll") && o("The scheduled Trigger Node does not exist."), i(r.kind == "cron" ? r.cronTimes : r.pollTimes, e.before) || o("The Trigger schedule changed before this operation was applied.");
 			let a = r.kind == "cron" ? {
 				...r,
 				cronTimes: e.value
@@ -349,14 +353,14 @@ function u(e, t) {
 			break;
 		}
 		case "module.create":
-			r[e.moduleId] != null && o(), r[e.moduleId] = e.module;
+			r[e.moduleId] != null && o("A CodeModule with this ID already exists."), r[e.moduleId] = e.module;
 			break;
 		case "module.delete":
-			r[e.moduleId] ?? o(), delete r[e.moduleId];
+			r[e.moduleId] ?? o("The CodeModule does not exist."), delete r[e.moduleId];
 			break;
 		case "module.rename": {
 			let t = r[e.moduleId];
-			(t == null || t.name != e.before) && o(), r[e.moduleId] = {
+			t ?? o("The CodeModule does not exist."), t.name != e.before && o("The CodeModule name changed before this operation was applied."), r[e.moduleId] = {
 				...t,
 				name: e.name
 			};
@@ -364,7 +368,7 @@ function u(e, t) {
 		}
 		case "module.source.replace": {
 			let t = r[e.moduleId];
-			(t == null || t.source != e.beforeSource || !i(t.imports, e.beforeImports)) && o(), r[e.moduleId] = {
+			t ?? o("The CodeModule does not exist."), (t.source != e.beforeSource || !i(t.imports, e.beforeImports)) && o("The CodeModule source changed before this operation was applied."), r[e.moduleId] = {
 				...t,
 				imports: e.imports,
 				source: e.source
@@ -372,18 +376,18 @@ function u(e, t) {
 			break;
 		}
 		case "subflow.create":
-			n.subflows[e.subflowId] != null && o(), n.subflows = {
+			n.subflows[e.subflowId] != null && o("A Subflow with this ID already exists."), n.subflows = {
 				...n.subflows,
 				[e.subflowId]: e.subflow
 			};
 			break;
 		case "subflow.definition.set": {
 			let t = n.subflows[e.subflowId];
-			(t == null || !i({
+			t ?? o("The Subflow does not exist."), i({
 				inputs: t.inputs,
 				name: t.name,
 				outputs: t.outputs
-			}, e.before)) && o(), n.subflows = {
+			}, e.before) || o("The Subflow definition changed before this operation was applied."), n.subflows = {
 				...n.subflows,
 				[e.subflowId]: {
 					...e.definition,
@@ -393,20 +397,20 @@ function u(e, t) {
 			break;
 		}
 		case "subflow.delete": {
-			n.subflows[e.subflowId] ?? o();
+			n.subflows[e.subflowId] ?? o("The Subflow does not exist.");
 			let t = { ...n.subflows };
 			delete t[e.subflowId], n.subflows = t;
 			break;
 		}
 		case "task.create":
-			n.tasks[e.taskId] != null && o(), n.tasks = {
+			n.tasks[e.taskId] != null && o("A Task with this ID already exists."), n.tasks = {
 				...n.tasks,
 				[e.taskId]: e.task
 			};
 			break;
 		case "task.connector.connection.set": {
 			let t = n.tasks[e.taskId];
-			(t == null || !("executor" in t) || t.executor.kind != "connector" || t.executor.connectionId != e.before) && o();
+			(t == null || !("executor" in t) || t.executor.kind != "connector") && o("The Connector Task does not exist."), t.executor.connectionId != e.before && o("The Connector Task connection changed before this operation was applied.");
 			let { connectionId: r, ...i } = t.executor, a = e.value == null ? i : {
 				...i,
 				connectionId: e.value
@@ -421,14 +425,14 @@ function u(e, t) {
 			break;
 		}
 		case "task.delete": {
-			n.tasks[e.taskId] ?? o();
+			n.tasks[e.taskId] ?? o("The Task does not exist.");
 			let t = { ...n.tasks };
 			delete t[e.taskId], n.tasks = t;
 			break;
 		}
 		case "task.llm.mode.set": {
 			let t = n.tasks[e.taskId];
-			(t == null || !("executor" in t) || t.executor.kind != "llm" || t.executor.mode != e.before) && o(), n.tasks = {
+			(t == null || !("executor" in t) || t.executor.kind != "llm") && o("The LLM Task does not exist."), t.executor.mode != e.before && o("The LLM Task mode changed before this operation was applied."), n.tasks = {
 				...n.tasks,
 				[e.taskId]: {
 					...t,
@@ -442,7 +446,7 @@ function u(e, t) {
 		}
 		case "task.name.set": {
 			let t = n.tasks[e.taskId];
-			(t == null || t.name != e.before) && o(), n.tasks = {
+			t ?? o("The Task does not exist."), t.name != e.before && o("The Task name changed before this operation was applied."), n.tasks = {
 				...n.tasks,
 				[e.taskId]: {
 					...t,

package/dist/browser/flow-change.d.ts

@@ -405,6 +405,7 @@ export type ChangeOperation = {
     readonly value: string;
 };
 export declare class FlowChangeError extends Error {
+    constructor(message: string);
 }
 export declare function applyFlowChanges(content: RevisionContent, operations: readonly ChangeOperation[]): RevisionContent;
 export {};

package/dist/browser/flow-change.js

@@ -36,14 +36,18 @@ function i(e) {
 function a(e) {
 	return Object.fromEntries(e.flatMap((e) => "handle" in e ? [[e.handle, e]] : []));
 }
-var o = class extends Error {};
-function s() {
-	throw new o();
+var o = class extends Error {
+	constructor(e) {
+		super(e), this.name = "FlowChangeError";
+	}
+};
+function s(e) {
+	throw new o(e);
 }
 function c(e, t) {
 	if (t.kind == "flow") return e.graph;
 	let n = e.subflows[t.id];
-	return n ?? s(), n.graph;
+	return n ?? s("The target Subflow does not exist."), n.graph;
 }
 function l(e, t, n) {
 	if (t.kind == "flow") return {
@@ -51,7 +55,7 @@ function l(e, t, n) {
 		graph: n
 	};
 	let r = e.subflows[t.id];
-	return r ?? s(), {
+	return r ?? s("The target Subflow does not exist."), {
 		...e,
 		subflows: {
 			...e.subflows,
@@ -82,20 +86,20 @@ function d(e, n) {
 	let r = { ...e.document }, i = { ...e.modules };
 	for (let e of n) switch (e.kind) {
 		case "binding.create":
-			r.bindings[e.bindingId] != null && s(), r.bindings = {
+			r.bindings[e.bindingId] != null && s("A Binding with this ID already exists."), r.bindings = {
 				...r.bindings,
 				[e.bindingId]: e.binding
 			};
 			break;
 		case "binding.delete": {
-			r.bindings[e.bindingId] ?? s();
+			r.bindings[e.bindingId] ?? s("The Binding does not exist.");
 			let t = { ...r.bindings };
 			delete t[e.bindingId], r.bindings = t;
 			break;
 		}
 		case "binding.target.set": {
 			let t = r.bindings[e.bindingId];
-			(t == null || t.target != e.before) && s(), r.bindings = {
+			t ?? s("The Binding does not exist."), t.target != e.before && s("The Binding target changed before this operation was applied."), r.bindings = {
 				...r.bindings,
 				[e.bindingId]: {
 					...t,
@@ -106,17 +110,17 @@ function d(e, n) {
 		}
 		case "graph.edge.connect": {
 			let n = c(r, e.target);
-			n.nodes[e.edge.source] ?? s();
+			n.nodes[e.edge.source] ?? s("The source Node does not exist.");
 			let i = n.nodes[e.edge.target];
-			(i == null || !("inputs" in i)) && s();
+			(i == null || !("inputs" in i)) && s("The target Node does not accept inputs.");
 			let a = i.inputs[e.edge.targetHandle];
-			t(a, e.before) || s();
+			t(a, e.before) || s("The target input changed before this operation was applied.");
 			let o = {
 				kind: "node",
 				nodeId: e.edge.source,
 				output: e.edge.sourceHandle
 			}, u = a?.kind == "sources" ? a.sources.filter((e) => e.kind != "binding" || r.bindings[e.bindingId]?.kind != "variable") : [];
-			u.some((e) => e.kind == "node" && e.nodeId == o.nodeId && e.output == o.output) && s();
+			u.some((e) => e.kind == "node" && e.nodeId == o.nodeId && e.output == o.output) && s("The Nodes are already connected.");
 			let d = {
 				...i,
 				inputs: {
@@ -135,11 +139,11 @@ function d(e, n) {
 		}
 		case "graph.edge.disconnect": {
 			let n = c(r, e.target), i = n.nodes[e.edge.target];
-			(i == null || !("inputs" in i)) && s();
+			(i == null || !("inputs" in i)) && s("The target Node does not accept inputs.");
 			let a = i.inputs[e.edge.targetHandle];
-			(a?.kind != "sources" || !t(a, e.before)) && s();
+			(a?.kind != "sources" || !t(a, e.before)) && s("The target input changed before this operation was applied.");
 			let o = a.sources.filter((t) => t.kind != "node" || t.nodeId != e.edge.source || t.output != e.edge.sourceHandle);
-			o.length == a.sources.length && s();
+			o.length == a.sources.length && s("The Nodes are not connected.");
 			let u = { ...i.inputs };
 			o.length == 0 ? delete u[e.edge.targetHandle] : u[e.edge.targetHandle] = {
 				kind: "sources",
@@ -155,7 +159,7 @@ function d(e, n) {
 		}
 		case "graph.node.additional-inputs.set": {
 			let n = c(r, e.target), i = n.nodes[e.nodeId];
-			(i?.kind != "task" || !t(i.additionalInputs, e.before)) && s();
+			i?.kind != "task" && s("The Task Node does not exist."), t(i.additionalInputs, e.before) || s("The Task Node inputs changed before this operation was applied.");
 			let { additionalInputs: a, ...o } = i, u = e.value == null ? o : {
 				...o,
 				additionalInputs: e.value
@@ -168,7 +172,7 @@ function d(e, n) {
 		}
 		case "graph.node.condition.set": {
 			let n = c(r, e.target), i = n.nodes[e.nodeId];
-			i?.kind != "condition" && s(), (!t(i.cases, e.before.cases) || i.defaultOutput != e.before.defaultOutput || !t(i.input, e.before.input)) && s();
+			i?.kind != "condition" && s("The Condition Node does not exist."), (!t(i.cases, e.before.cases) || i.defaultOutput != e.before.defaultOutput || !t(i.input, e.before.input)) && s("The Condition Node changed before this operation was applied.");
 			let { defaultOutput: a, ...o } = i, u = e.value.defaultOutput == null ? {
 				...o,
 				...e.value
@@ -184,7 +188,7 @@ function d(e, n) {
 		}
 		case "graph.node.create": {
 			let t = c(r, e.target);
-			(t.nodes[e.nodeId] != null || e.target.kind == "subflow" && !("inputs" in e.node)) && s(), Object.assign(r, l(r, e.target, { nodes: {
+			t.nodes[e.nodeId] != null && s("A Node with this ID already exists in the target graph."), e.target.kind == "subflow" && !("inputs" in e.node) && s("Trigger Nodes cannot be created inside a Subflow."), Object.assign(r, l(r, e.target, { nodes: {
 				...t.nodes,
 				[e.nodeId]: e.node
 			} }));
@@ -192,7 +196,7 @@ function d(e, n) {
 		}
 		case "graph.node.delete": {
 			let t = c(r, e.target);
-			t.nodes[e.nodeId] ?? s();
+			t.nodes[e.nodeId] ?? s("The Node does not exist in the target graph.");
 			let n = /* @__PURE__ */ new Set([e.nodeId]), i = Object.fromEntries(Object.entries(t.nodes).flatMap(([e, t]) => n.has(e) ? [] : [[e, u(t, n)]]));
 			if (Object.assign(r, l(r, e.target, { nodes: i })), e.target.kind == "subflow") {
 				let t = r.subflows[e.target.id], i = t.outputs.map((e) => ({
@@ -211,7 +215,7 @@ function d(e, n) {
 		}
 		case "graph.node.field.set": {
 			let n = c(r, e.target), i = n.nodes[e.nodeId];
-			(i == null || !t(Reflect.get(i, e.field), e.before)) && s(), e.field == "concurrency" && e.value == null && s();
+			i ?? s("The Node does not exist in the target graph."), t(Reflect.get(i, e.field), e.before) || s("The Node field changed before this operation was applied."), e.field == "concurrency" && e.value == null && s("Node concurrency cannot be removed.");
 			let a = { ...i };
 			e.value == null ? Reflect.deleteProperty(a, e.field) : Object.assign(a, { [e.field]: e.value }), Object.assign(r, l(r, e.target, { nodes: {
 				...n.nodes,
@@ -221,7 +225,7 @@ function d(e, n) {
 		}
 		case "graph.node.input.set": {
 			let n = c(r, e.target), i = n.nodes[e.nodeId];
-			(i == null || !("inputs" in i) || !t(i.inputs[e.handle], e.before)) && s();
+			(i == null || !("inputs" in i)) && s("The Node does not accept inputs."), t(i.inputs[e.handle], e.before) || s("The Node input changed before this operation was applied.");
 			let a = { ...i.inputs };
 			e.value == null ? delete a[e.handle] : a[e.handle] = e.value, Object.assign(r, l(r, e.target, { nodes: {
 				...n.nodes,
@@ -234,7 +238,7 @@ function d(e, n) {
 		}
 		case "graph.node.task.name.set": {
 			let t = c(r, e.target), n = t.nodes[e.nodeId];
-			(n?.kind != "task" || n.task == null || n.task.name != e.before) && s();
+			(n?.kind != "task" || n.task == null) && s("The inline Task Node does not exist."), n.task.name != e.before && s("The inline Task name changed before this operation was applied.");
 			let i = {
 				...n,
 				task: {
@@ -250,10 +254,10 @@ function d(e, n) {
 		}
 		case "graph.node.task.ports.set": {
 			let n = c(r, e.target), i = n.nodes[e.nodeId];
-			(i?.kind != "task" || i.task == null || !t({
+			(i?.kind != "task" || i.task == null) && s("The inline Task Node does not exist."), t({
 				inputs: i.task.inputs,
 				outputs: i.task.outputs
-			}, e.before)) && s();
+			}, e.before) || s("The inline Task ports changed before this operation was applied.");
 			let a = {
 				...i,
 				task: {
@@ -269,7 +273,7 @@ function d(e, n) {
 		}
 		case "graph.node.values.set": {
 			let n = c(r, e.target), i = n.nodes[e.nodeId];
-			(i?.kind != "value" || !t(i.values, e.before)) && s(), Object.assign(r, l(r, e.target, { nodes: {
+			i?.kind != "value" && s("The Value Node does not exist."), t(i.values, e.before) || s("The Value Node changed before this operation was applied."), Object.assign(r, l(r, e.target, { nodes: {
 				...n.nodes,
 				[e.nodeId]: {
 					...i,
@@ -284,7 +288,7 @@ function d(e, n) {
 				actions: i.actions,
 				...i.notification == null ? {} : { notification: i.notification },
 				prompt: i.prompt
-			}, e.before)) && s();
+			}, e.before)) && s("The Wait Node changed before this operation was applied.");
 			let { notification: a, ...o } = i, c = e.value.notification == null ? {
 				...o,
 				...e.value
@@ -300,7 +304,7 @@ function d(e, n) {
 		}
 		case "graph.node.webhook.set": {
 			let n = c(r, e.target), i = n.nodes[e.nodeId];
-			(i?.kind != "webhook" || !t(i.inputsDef, e.before.inputsDef) || !t(i.options, e.before.options)) && s();
+			i?.kind != "webhook" && s("The Webhook Node does not exist."), (!t(i.inputsDef, e.before.inputsDef) || !t(i.options, e.before.options)) && s("The Webhook Node changed before this operation was applied.");
 			let { options: a, ...o } = i, u = e.value.options == null ? {
 				...o,
 				inputsDef: e.value.inputsDef
@@ -316,7 +320,7 @@ function d(e, n) {
 		}
 		case "graph.trigger.config.set": {
 			let n = r.graph, i = n.nodes[e.nodeId];
-			(i == null || i.kind != "integration" && i.kind != "poll" || !t(i.config[e.name], e.before)) && s();
+			(i == null || i.kind != "integration" && i.kind != "poll") && s("The configurable Trigger Node does not exist."), t(i.config[e.name], e.before) || s("The Trigger configuration changed before this operation was applied.");
 			let a = { ...i.config };
 			e.value === void 0 ? delete a[e.name] : a[e.name] = e.value, r.graph = { nodes: {
 				...n.nodes,
@@ -329,7 +333,7 @@ function d(e, n) {
 		}
 		case "graph.trigger.schedule.set": {
 			let n = r.graph, i = n.nodes[e.nodeId];
-			(i == null || i.kind != "cron" && i.kind != "poll") && s(), t(i.kind == "cron" ? i.cronTimes : i.pollTimes, e.before) || s();
+			(i == null || i.kind != "cron" && i.kind != "poll") && s("The scheduled Trigger Node does not exist."), t(i.kind == "cron" ? i.cronTimes : i.pollTimes, e.before) || s("The Trigger schedule changed before this operation was applied.");
 			let a = i.kind == "cron" ? {
 				...i,
 				cronTimes: e.value
@@ -344,14 +348,14 @@ function d(e, n) {
 			break;
 		}
 		case "module.create":
-			i[e.moduleId] != null && s(), i[e.moduleId] = e.module;
+			i[e.moduleId] != null && s("A CodeModule with this ID already exists."), i[e.moduleId] = e.module;
 			break;
 		case "module.delete":
-			i[e.moduleId] ?? s(), delete i[e.moduleId];
+			i[e.moduleId] ?? s("The CodeModule does not exist."), delete i[e.moduleId];
 			break;
 		case "module.rename": {
 			let t = i[e.moduleId];
-			(t == null || t.name != e.before) && s(), i[e.moduleId] = {
+			t ?? s("The CodeModule does not exist."), t.name != e.before && s("The CodeModule name changed before this operation was applied."), i[e.moduleId] = {
 				...t,
 				name: e.name
 			};
@@ -359,7 +363,7 @@ function d(e, n) {
 		}
 		case "module.source.replace": {
 			let n = i[e.moduleId];
-			(n == null || n.source != e.beforeSource || !t(n.imports, e.beforeImports)) && s(), i[e.moduleId] = {
+			n ?? s("The CodeModule does not exist."), (n.source != e.beforeSource || !t(n.imports, e.beforeImports)) && s("The CodeModule source changed before this operation was applied."), i[e.moduleId] = {
 				...n,
 				imports: e.imports,
 				source: e.source
@@ -367,18 +371,18 @@ function d(e, n) {
 			break;
 		}
 		case "subflow.create":
-			r.subflows[e.subflowId] != null && s(), r.subflows = {
+			r.subflows[e.subflowId] != null && s("A Subflow with this ID already exists."), r.subflows = {
 				...r.subflows,
 				[e.subflowId]: e.subflow
 			};
 			break;
 		case "subflow.definition.set": {
 			let n = r.subflows[e.subflowId];
-			(n == null || !t({
+			n ?? s("The Subflow does not exist."), t({
 				inputs: n.inputs,
 				name: n.name,
 				outputs: n.outputs
-			}, e.before)) && s(), r.subflows = {
+			}, e.before) || s("The Subflow definition changed before this operation was applied."), r.subflows = {
 				...r.subflows,
 				[e.subflowId]: {
 					...e.definition,
@@ -388,20 +392,20 @@ function d(e, n) {
 			break;
 		}
 		case "subflow.delete": {
-			r.subflows[e.subflowId] ?? s();
+			r.subflows[e.subflowId] ?? s("The Subflow does not exist.");
 			let t = { ...r.subflows };
 			delete t[e.subflowId], r.subflows = t;
 			break;
 		}
 		case "task.create":
-			r.tasks[e.taskId] != null && s(), r.tasks = {
+			r.tasks[e.taskId] != null && s("A Task with this ID already exists."), r.tasks = {
 				...r.tasks,
 				[e.taskId]: e.task
 			};
 			break;
 		case "task.connector.connection.set": {
 			let t = r.tasks[e.taskId];
-			(t == null || !("executor" in t) || t.executor.kind != "connector" || t.executor.connectionId != e.before) && s();
+			(t == null || !("executor" in t) || t.executor.kind != "connector") && s("The Connector Task does not exist."), t.executor.connectionId != e.before && s("The Connector Task connection changed before this operation was applied.");
 			let { connectionId: n, ...i } = t.executor, a = e.value == null ? i : {
 				...i,
 				connectionId: e.value
@@ -416,14 +420,14 @@ function d(e, n) {
 			break;
 		}
 		case "task.delete": {
-			r.tasks[e.taskId] ?? s();
+			r.tasks[e.taskId] ?? s("The Task does not exist.");
 			let t = { ...r.tasks };
 			delete t[e.taskId], r.tasks = t;
 			break;
 		}
 		case "task.llm.mode.set": {
 			let t = r.tasks[e.taskId];
-			(t == null || !("executor" in t) || t.executor.kind != "llm" || t.executor.mode != e.before) && s(), r.tasks = {
+			(t == null || !("executor" in t) || t.executor.kind != "llm") && s("The LLM Task does not exist."), t.executor.mode != e.before && s("The LLM Task mode changed before this operation was applied."), r.tasks = {
 				...r.tasks,
 				[e.taskId]: {
 					...t,
@@ -437,7 +441,7 @@ function d(e, n) {
 		}
 		case "task.name.set": {
 			let t = r.tasks[e.taskId];
-			(t == null || t.name != e.before) && s(), r.tasks = {
+			t ?? s("The Task does not exist."), t.name != e.before && s("The Task name changed before this operation was applied."), r.tasks = {
 				...r.tasks,
 				[e.taskId]: {
 					...t,