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

package/dist/browser/flow-change.js

@@ -11,24 +11,27 @@ function t(e) {
 	if (!/^[\p{L}\p{N}](?:[\p{L}\p{N} _-]*[\p{L}\p{N}])?$/u.test(t)) return "specialCharacter";
 }
 function n(e) {
-	return Object.fromEntries(e.map((e) => [e.handle, e]));
+	return e.length <= 256 && /^[A-Za-z_][A-Za-z0-9_]*$/.test(e) && e.slice(0, 3).toUpperCase() != "OO_";
 }
-var r = class extends Error {};
-function i() {
-	throw new r();
+function r(e) {
+	return Object.fromEntries(e.flatMap((e) => "handle" in e ? [[e.handle, e]] : []));
 }
-function a(e, t) {
+var i = class extends Error {};
+function a() {
+	throw new i();
+}
+function o(e, t) {
 	if (t.kind == "flow") return e.graph;
 	let n = e.subflows[t.id];
-	return n ?? i(), n.graph;
+	return n ?? a(), n.graph;
 }
-function o(e, t, n) {
+function s(e, t, n) {
 	if (t.kind == "flow") return {
 		...e,
 		graph: n
 	};
 	let r = e.subflows[t.id];
-	return r ?? i(), {
+	return r ?? a(), {
 		...e,
 		subflows: {
 			...e.subflows,
@@ -39,7 +42,7 @@ function o(e, t, n) {
 		}
 	};
 }
-function s(e, t) {
+function c(e, t) {
 	if (!("inputs" in e)) return e;
 	let n = { ...e.inputs };
 	for (let [e, r] of Object.entries(n)) {
@@ -55,38 +58,38 @@ function s(e, t) {
 		inputs: n
 	};
 }
-function c(e, t) {
+function l(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 && i(), n.bindings = {
+			n.bindings[e.bindingId] != null && a(), n.bindings = {
 				...n.bindings,
 				[e.bindingId]: e.binding
 			};
 			break;
 		case "binding.replace":
-			n.bindings[e.bindingId] ?? i(), n.bindings = {
+			n.bindings[e.bindingId] ?? a(), n.bindings = {
 				...n.bindings,
 				[e.bindingId]: e.binding
 			};
 			break;
 		case "binding.delete": {
-			n.bindings[e.bindingId] ?? i();
+			n.bindings[e.bindingId] ?? a();
 			let t = { ...n.bindings };
 			delete t[e.bindingId], n.bindings = t;
 			break;
 		}
 		case "graph.edge.connect": {
-			let t = a(n, e.target);
-			t.nodes[e.edge.source] ?? i();
+			let t = o(n, e.target);
+			t.nodes[e.edge.source] ?? a();
 			let r = t.nodes[e.edge.target];
-			(r == null || !("inputs" in r)) && i();
-			let s = r.inputs[e.edge.targetHandle], c = {
+			(r == null || !("inputs" in r)) && a();
+			let i = r.inputs[e.edge.targetHandle], c = {
 				kind: "node",
 				nodeId: e.edge.source,
 				output: e.edge.sourceHandle
-			}, l = s?.kind == "sources" ? s.sources : [];
-			l.some((e) => e.kind == "node" && e.nodeId == c.nodeId && e.output == c.output) && i();
+			}, l = i?.kind == "sources" ? i.sources.filter((e) => e.kind != "binding" || n.bindings[e.bindingId]?.kind != "variable") : [];
+			l.some((e) => e.kind == "node" && e.nodeId == c.nodeId && e.output == c.output) && a();
 			let u = {
 				...r,
 				inputs: {
@@ -97,24 +100,24 @@ function c(e, t) {
 					}
 				}
 			};
-			Object.assign(n, o(n, e.target, { nodes: {
+			Object.assign(n, s(n, e.target, { nodes: {
 				...t.nodes,
 				[e.edge.target]: u
 			} }));
 			break;
 		}
 		case "graph.edge.disconnect": {
-			let t = a(n, e.target), r = t.nodes[e.edge.target];
-			(r == null || !("inputs" in r)) && i();
-			let s = r.inputs[e.edge.targetHandle];
-			s?.kind != "sources" && i();
-			let c = s.sources.filter((t) => t.kind != "node" || t.nodeId != e.edge.source || t.output != e.edge.sourceHandle);
-			c.length == s.sources.length && i();
+			let t = o(n, e.target), r = t.nodes[e.edge.target];
+			(r == null || !("inputs" in r)) && a();
+			let i = r.inputs[e.edge.targetHandle];
+			i?.kind != "sources" && a();
+			let c = i.sources.filter((t) => t.kind != "node" || t.nodeId != e.edge.source || t.output != e.edge.sourceHandle);
+			c.length == i.sources.length && a();
 			let l = { ...r.inputs };
 			c.length == 0 ? delete l[e.edge.targetHandle] : l[e.edge.targetHandle] = {
 				kind: "sources",
 				sources: c
-			}, Object.assign(n, o(n, e.target, { nodes: {
+			}, Object.assign(n, s(n, e.target, { nodes: {
 				...t.nodes,
 				[e.edge.target]: {
 					...r,
@@ -124,18 +127,18 @@ function c(e, t) {
 			break;
 		}
 		case "graph.node.create": {
-			let t = a(n, e.target);
-			(t.nodes[e.nodeId] != null || e.target.kind == "subflow" && !("inputs" in e.node)) && i(), Object.assign(n, o(n, e.target, { nodes: {
+			let t = o(n, e.target);
+			(t.nodes[e.nodeId] != null || e.target.kind == "subflow" && !("inputs" in e.node)) && a(), Object.assign(n, s(n, e.target, { nodes: {
 				...t.nodes,
 				[e.nodeId]: e.node
 			} }));
 			break;
 		}
 		case "graph.node.delete": {
-			let t = a(n, e.target);
-			t.nodes[e.nodeId] ?? i();
-			let r = /* @__PURE__ */ new Set([e.nodeId]), c = Object.fromEntries(Object.entries(t.nodes).flatMap(([e, t]) => r.has(e) ? [] : [[e, s(t, r)]]));
-			if (Object.assign(n, o(n, e.target, { nodes: c })), e.target.kind == "subflow") {
+			let t = o(n, e.target);
+			t.nodes[e.nodeId] ?? a();
+			let r = /* @__PURE__ */ new Set([e.nodeId]), i = Object.fromEntries(Object.entries(t.nodes).flatMap(([e, t]) => r.has(e) ? [] : [[e, c(t, r)]]));
+			if (Object.assign(n, s(n, e.target, { nodes: i })), e.target.kind == "subflow") {
 				let t = n.subflows[e.target.id], i = t.outputs.map((e) => ({
 					...e,
 					sources: e.sources.filter((e) => e.kind != "node" || !r.has(e.nodeId))
@@ -151,22 +154,22 @@ function c(e, t) {
 			break;
 		}
 		case "graph.node.replace": {
-			let t = a(n, e.target);
-			(t.nodes[e.nodeId] == null || e.target.kind == "subflow" && !("inputs" in e.node)) && i(), Object.assign(n, o(n, e.target, { nodes: {
+			let t = o(n, e.target);
+			(t.nodes[e.nodeId] == null || e.target.kind == "subflow" && !("inputs" in e.node)) && a(), Object.assign(n, s(n, e.target, { nodes: {
 				...t.nodes,
 				[e.nodeId]: e.node
 			} }));
 			break;
 		}
 		case "module.create":
-			r[e.moduleId] != null && i(), r[e.moduleId] = e.module;
+			r[e.moduleId] != null && a(), r[e.moduleId] = e.module;
 			break;
 		case "module.delete":
-			r[e.moduleId] ?? i(), delete r[e.moduleId];
+			r[e.moduleId] ?? a(), delete r[e.moduleId];
 			break;
 		case "module.rename": {
 			let t = r[e.moduleId];
-			t ?? i(), r[e.moduleId] = {
+			t ?? a(), r[e.moduleId] = {
 				...t,
 				name: e.name
 			};
@@ -174,7 +177,7 @@ function c(e, t) {
 		}
 		case "module.source.replace": {
 			let t = r[e.moduleId];
-			t ?? i(), r[e.moduleId] = {
+			t ?? a(), r[e.moduleId] = {
 				...t,
 				imports: e.imports,
 				source: e.source
@@ -182,14 +185,14 @@ function c(e, t) {
 			break;
 		}
 		case "subflow.create":
-			n.subflows[e.subflowId] != null && i(), n.subflows = {
+			n.subflows[e.subflowId] != null && a(), n.subflows = {
 				...n.subflows,
 				[e.subflowId]: e.subflow
 			};
 			break;
 		case "subflow.definition.replace": {
 			let t = n.subflows[e.subflowId];
-			t ?? i(), n.subflows = {
+			t ?? a(), n.subflows = {
 				...n.subflows,
 				[e.subflowId]: {
 					...e.definition,
@@ -199,24 +202,24 @@ function c(e, t) {
 			break;
 		}
 		case "subflow.delete": {
-			n.subflows[e.subflowId] ?? i();
+			n.subflows[e.subflowId] ?? a();
 			let t = { ...n.subflows };
 			delete t[e.subflowId], n.subflows = t;
 			break;
 		}
 		case "task.create":
-			n.tasks[e.taskId] != null && i(), n.tasks = {
+			n.tasks[e.taskId] != null && a(), n.tasks = {
 				...n.tasks,
 				[e.taskId]: e.task
 			};
 			break;
 		case "task.delete": {
-			n.tasks[e.taskId] ?? i();
+			n.tasks[e.taskId] ?? a();
 			let t = { ...n.tasks };
 			delete t[e.taskId], n.tasks = t;
 			break;
 		}
-		case "task.replace": n.tasks[e.taskId] ?? i(), n.tasks = {
+		case "task.replace": n.tasks[e.taskId] ?? a(), n.tasks = {
 			...n.tasks,
 			[e.taskId]: e.task
 		};
@@ -228,4 +231,4 @@ function c(e, t) {
 	};
 }
 //#endregion
-export { r as FlowChangeError, c as applyFlowChanges, n as portsByHandle, t as resourceNameIssue, e as resourceNameMaxLength };
+export { i as FlowChangeError, l as applyFlowChanges, r as portsByHandle, t as resourceNameIssue, e as resourceNameMaxLength, n as validVariableName };