@umodeapporg/ui 0.22.3 → 0.23.0

package/dist/components/UI/Flow/flowEditorStore.js

@@ -0,0 +1,258 @@
+import { createStore } from "zustand/vanilla";
+import { generateUUID } from "../../../helpers/utilityHelpers.js";
+import { canConnect, FLOW_SIBLING_GAP, FLOW_LEVEL_GAP, layoutFlowByLevels } from "./flowGraph.js";
+const HISTORY_LIMIT = 50;
+const PASTE_OFFSET = 32;
+const COALESCE_WINDOW_MS = 1e3;
+const isPosition = (position) => typeof position?.x === "number" && typeof position?.y === "number";
+const normalizeGraph = (graph, registry) => {
+  const normalized = {
+    nodes: Array.isArray(graph?.nodes) ? graph.nodes : [],
+    edges: Array.isArray(graph?.edges) ? graph.edges : []
+  };
+  if (normalized.nodes.every((node) => isPosition(node.position))) return normalized;
+  const layout = layoutFlowByLevels(normalized, registry);
+  return {
+    ...normalized,
+    nodes: normalized.nodes.map(
+      (node) => isPosition(node.position) ? node : { ...node, position: layout[node.nodeId] ?? { x: 0, y: 0 } }
+    )
+  };
+};
+const withoutNodes = (graph, nodeIds) => ({
+  nodes: graph.nodes.filter((node) => !nodeIds.has(node.nodeId)),
+  edges: graph.edges.filter((edge) => !nodeIds.has(edge.source) && !nodeIds.has(edge.target))
+});
+const isPositionTaken = (graph, position) => graph.nodes.some(
+  (node) => Math.abs(node.position.x - position.x) < FLOW_LEVEL_GAP && Math.abs(node.position.y - position.y) < FLOW_SIBLING_GAP
+);
+const nextFreePosition = (graph, selectedNodeIds) => {
+  if (graph.nodes.length === 0) return { x: 0, y: 0 };
+  const anchor = graph.nodes.find((node) => node.nodeId === selectedNodeIds[0]) ?? graph.nodes.reduce((current, node) => node.position.x > current.position.x ? node : current);
+  let candidate = { x: anchor.position.x + FLOW_LEVEL_GAP, y: anchor.position.y };
+  while (isPositionTaken(graph, candidate)) candidate = { x: candidate.x, y: candidate.y + FLOW_SIBLING_GAP };
+  return candidate;
+};
+const createFlowEditorStore = (initialGraph, registry) => createStore()((set, get) => {
+  let currentRegistry = registry;
+  let lastCoalesce = null;
+  const commit = (next, selection, coalesceKey) => {
+    const { graph, past } = get();
+    const now = Date.now();
+    const extendsLastStep = coalesceKey !== void 0 && lastCoalesce?.key === coalesceKey && now - lastCoalesce.at < COALESCE_WINDOW_MS;
+    lastCoalesce = coalesceKey === void 0 ? null : { key: coalesceKey, at: now };
+    set({
+      graph: next,
+      past: extendsLastStep ? past : [...past, graph].slice(-HISTORY_LIMIT),
+      future: [],
+      isDirty: true,
+      ...selection?.nodeIds ? { selectedNodeIds: selection.nodeIds } : {},
+      ...selection?.edgeIds ? { selectedEdgeIds: selection.edgeIds } : {}
+    });
+  };
+  const cloneNodes = (nodes, offset) => {
+    const instancesByType = /* @__PURE__ */ new Map();
+    get().graph.nodes.forEach((node) => instancesByType.set(node.type, (instancesByType.get(node.type) ?? 0) + 1));
+    return nodes.filter((node) => {
+      const definition = currentRegistry.get(node.type);
+      if (!definition || definition.category === "trigger") return false;
+      const instances = instancesByType.get(node.type) ?? 0;
+      if (definition.maxInstances !== void 0 && instances >= definition.maxInstances) return false;
+      instancesByType.set(node.type, instances + 1);
+      return true;
+    }).map((node) => ({
+      ...node,
+      nodeId: generateUUID(),
+      config: structuredClone(node.config),
+      position: { x: node.position.x + offset, y: node.position.y + offset }
+    }));
+  };
+  return {
+    graph: normalizeGraph(initialGraph, registry),
+    selectedNodeIds: [],
+    selectedEdgeIds: [],
+    past: [],
+    future: [],
+    clipboard: [],
+    isDirty: false,
+    replaceGraph: (graph, options) => {
+      set((state) => ({
+        graph: normalizeGraph(graph, currentRegistry),
+        past: options?.keepHistory ? [...state.past, state.graph].slice(-HISTORY_LIMIT) : [],
+        future: [],
+        selectedNodeIds: [],
+        selectedEdgeIds: [],
+        isDirty: Boolean(options?.keepHistory)
+      }));
+    },
+    markClean: () => set({ isDirty: false }),
+    recordHistory: () => {
+      const { graph, past } = get();
+      set({ past: [...past, graph].slice(-HISTORY_LIMIT), future: [] });
+    },
+    addNode: (type, position) => {
+      const definition = currentRegistry.get(type);
+      if (!definition) return null;
+      const { graph, selectedNodeIds } = get();
+      const instances = graph.nodes.filter((node2) => node2.type === type).length;
+      if (definition.maxInstances !== void 0 && instances >= definition.maxInstances) return null;
+      const node = {
+        nodeId: generateUUID(),
+        type,
+        typeVersion: definition.typeVersion,
+        config: definition.createDefaultConfig(),
+        position: position ?? nextFreePosition(graph, selectedNodeIds)
+      };
+      commit({ ...graph, nodes: [...graph.nodes, node] }, { nodeIds: [node.nodeId], edgeIds: [] });
+      return node.nodeId;
+    },
+    addNodeFromPort: (type, sourceNodeId, sourcePort) => {
+      const definition = currentRegistry.get(type);
+      const { graph } = get();
+      const source = graph.nodes.find((node2) => node2.nodeId === sourceNodeId);
+      if (!definition || !source) return null;
+      const instances = graph.nodes.filter((node2) => node2.type === type).length;
+      if (definition.maxInstances !== void 0 && instances >= definition.maxInstances) return null;
+      if (graph.edges.some((edge) => edge.source === sourceNodeId && edge.sourcePort === sourcePort)) return null;
+      const outputs = currentRegistry.get(source.type)?.outputs ?? [];
+      const portIndex = Math.max(0, outputs.indexOf(sourcePort));
+      let position = {
+        x: source.position.x + FLOW_LEVEL_GAP,
+        y: source.position.y + (portIndex - (outputs.length - 1) / 2) * FLOW_SIBLING_GAP
+      };
+      while (isPositionTaken(graph, position)) position = { x: position.x, y: position.y + FLOW_SIBLING_GAP };
+      const node = {
+        nodeId: generateUUID(),
+        type,
+        typeVersion: definition.typeVersion,
+        config: definition.createDefaultConfig(),
+        position
+      };
+      const nodes = [...graph.nodes, node];
+      const wires = canConnect({ ...graph, nodes }, currentRegistry, { source: sourceNodeId, sourcePort, target: node.nodeId });
+      const edges = wires ? [...graph.edges, { edgeId: generateUUID(), source: sourceNodeId, sourcePort, target: node.nodeId }] : graph.edges;
+      commit({ nodes, edges }, { nodeIds: [node.nodeId], edgeIds: [] });
+      return node.nodeId;
+    },
+    updateNodeConfig: (nodeId, config) => {
+      const { graph } = get();
+      commit(
+        { ...graph, nodes: graph.nodes.map((node) => node.nodeId === nodeId ? { ...node, config } : node) },
+        void 0,
+        `config:${nodeId}`
+      );
+    },
+    updateNodeLabel: (nodeId, label) => {
+      const { graph } = get();
+      const hasText = label.trim().length > 0;
+      commit(
+        {
+          ...graph,
+          nodes: graph.nodes.map(
+            (node) => node.nodeId === nodeId ? { ...node, label: hasText ? label : void 0 } : node
+          )
+        },
+        void 0,
+        `label:${nodeId}`
+      );
+    },
+    moveNodes: (positions) => {
+      const { graph } = get();
+      set({
+        graph: {
+          ...graph,
+          nodes: graph.nodes.map(
+            (node) => positions[node.nodeId] ? { ...node, position: positions[node.nodeId] } : node
+          )
+        },
+        isDirty: true
+      });
+    },
+    connect: (source, sourcePort, target) => {
+      const { graph } = get();
+      if (!canConnect(graph, currentRegistry, { source, sourcePort, target })) return false;
+      const edge = { edgeId: generateUUID(), source, sourcePort, target };
+      commit({ ...graph, edges: [...graph.edges, edge] });
+      return true;
+    },
+    removeEdges: (edgeIds) => {
+      if (edgeIds.length === 0) return;
+      const { graph } = get();
+      const removed = new Set(edgeIds);
+      commit({ ...graph, edges: graph.edges.filter((edge) => !removed.has(edge.edgeId)) }, { edgeIds: [] });
+    },
+    removeSelected: () => {
+      const { graph, selectedNodeIds, selectedEdgeIds } = get();
+      if (selectedNodeIds.length === 0 && selectedEdgeIds.length === 0) return;
+      const removedEdges = new Set(selectedEdgeIds);
+      const next = withoutNodes(
+        { ...graph, edges: graph.edges.filter((edge) => !removedEdges.has(edge.edgeId)) },
+        new Set(selectedNodeIds)
+      );
+      commit(next, { nodeIds: [], edgeIds: [] });
+    },
+    duplicateSelected: () => {
+      const { graph, selectedNodeIds } = get();
+      const selected = graph.nodes.filter((node) => selectedNodeIds.includes(node.nodeId));
+      const copies = cloneNodes(selected, PASTE_OFFSET);
+      if (copies.length === 0) return;
+      commit(
+        { ...graph, nodes: [...graph.nodes, ...copies] },
+        { nodeIds: copies.map((node) => node.nodeId), edgeIds: [] }
+      );
+    },
+    copySelected: () => {
+      const { graph, selectedNodeIds } = get();
+      set({ clipboard: graph.nodes.filter((node) => selectedNodeIds.includes(node.nodeId)) });
+    },
+    paste: () => {
+      const { graph, clipboard } = get();
+      const copies = cloneNodes(clipboard, PASTE_OFFSET);
+      if (copies.length === 0) return;
+      commit(
+        { ...graph, nodes: [...graph.nodes, ...copies] },
+        { nodeIds: copies.map((node) => node.nodeId), edgeIds: [] }
+      );
+      set({ clipboard: copies });
+    },
+    setSelection: ({ nodeIds, edgeIds }) => {
+      set((state) => ({
+        selectedNodeIds: nodeIds ?? state.selectedNodeIds,
+        selectedEdgeIds: edgeIds ?? state.selectedEdgeIds
+      }));
+    },
+    undo: () => {
+      const { graph, past, future } = get();
+      const previous = past[past.length - 1];
+      if (!previous) return;
+      set({
+        graph: previous,
+        past: past.slice(0, -1),
+        future: [graph, ...future].slice(0, HISTORY_LIMIT),
+        selectedNodeIds: [],
+        selectedEdgeIds: [],
+        isDirty: true
+      });
+    },
+    redo: () => {
+      const { graph, past, future } = get();
+      const following = future[0];
+      if (!following) return;
+      set({
+        graph: following,
+        past: [...past, graph].slice(-HISTORY_LIMIT),
+        future: future.slice(1),
+        selectedNodeIds: [],
+        selectedEdgeIds: [],
+        isDirty: true
+      });
+    },
+    setRegistry: (nextRegistry) => {
+      currentRegistry = nextRegistry;
+    }
+  };
+});
+export {
+  createFlowEditorStore
+};
+//# sourceMappingURL=flowEditorStore.js.map

package/dist/components/UI/Flow/flowEditorStore.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"flowEditorStore.js","sources":["../../../../src/components/UI/Flow/flowEditorStore.ts"],"sourcesContent":["import { createStore, type StoreApi } from 'zustand/vanilla';\n\nimport { generateUUID } from '@/helpers/utilityHelpers';\n\nimport type { IFlowBlockRegistry } from './flowBlockRegistry';\nimport { canConnect, FLOW_LEVEL_GAP, FLOW_SIBLING_GAP, layoutFlowByLevels } from './flowGraph';\nimport type { IFlowEdge, IFlowGraph, IFlowNode, IFlowPosition, TFlowPortId } from './flowTypes';\n\nconst HISTORY_LIMIT = 50;\nconst PASTE_OFFSET = 32;\n/** Edits to the same field within this window share one undo step (typing a name is one change). */\nconst COALESCE_WINDOW_MS = 1000;\n\nexport interface IFlowEditorState {\n  graph: IFlowGraph;\n  selectedNodeIds: Array<string>;\n  selectedEdgeIds: Array<string>;\n  past: Array<IFlowGraph>;\n  future: Array<IFlowGraph>;\n  clipboard: Array<IFlowNode>;\n  isDirty: boolean;\n\n  replaceGraph: (graph: IFlowGraph, options?: { keepHistory?: boolean }) => void;\n  markClean: () => void;\n  /** Snapshot before a gesture that changes the graph in many small steps (a drag). */\n  recordHistory: () => void;\n  addNode: (type: string, position?: IFlowPosition) => string | null;\n  /** Adds a block right of `sourceNodeId` and wires `sourcePort` to it in one undo step. */\n  addNodeFromPort: (type: string, sourceNodeId: string, sourcePort: TFlowPortId) => string | null;\n  updateNodeConfig: (nodeId: string, config: unknown) => void;\n  updateNodeLabel: (nodeId: string, label: string) => void;\n  moveNodes: (positions: Record<string, IFlowPosition>) => void;\n  connect: (source: string, sourcePort: TFlowPortId, target: string) => boolean;\n  removeEdges: (edgeIds: Array<string>) => void;\n  removeSelected: () => void;\n  duplicateSelected: () => void;\n  copySelected: () => void;\n  paste: () => void;\n  setSelection: (selection: { nodeIds?: Array<string>; edgeIds?: Array<string> }) => void;\n  undo: () => void;\n  redo: () => void;\n  /** The host may rebuild its registry (labels after a language switch); gestures always read the latest. */\n  setRegistry: (registry: IFlowBlockRegistry) => void;\n}\n\nexport type TFlowEditorStore = StoreApi<IFlowEditorState>;\n\nconst isPosition = (position: unknown): position is IFlowPosition =>\n  typeof (position as IFlowPosition | undefined)?.x === 'number' &&\n  typeof (position as IFlowPosition | undefined)?.y === 'number';\n\n/** Coerces a stored graph; a block saved without a position is placed by the automatic layout. */\nconst normalizeGraph = (graph: IFlowGraph | null | undefined, registry: IFlowBlockRegistry): IFlowGraph => {\n  const normalized: IFlowGraph = {\n    nodes: Array.isArray(graph?.nodes) ? graph.nodes : [],\n    edges: Array.isArray(graph?.edges) ? graph.edges : [],\n  };\n  if (normalized.nodes.every((node) => isPosition(node.position))) return normalized;\n\n  const layout = layoutFlowByLevels(normalized, registry);\n  return {\n    ...normalized,\n    nodes: normalized.nodes.map((node) =>\n      isPosition(node.position) ? node : { ...node, position: layout[node.nodeId] ?? { x: 0, y: 0 } },\n    ),\n  };\n};\n\nconst withoutNodes = (graph: IFlowGraph, nodeIds: Set<string>): IFlowGraph => ({\n  nodes: graph.nodes.filter((node) => !nodeIds.has(node.nodeId)),\n  edges: graph.edges.filter((edge) => !nodeIds.has(edge.source) && !nodeIds.has(edge.target)),\n});\n\nconst isPositionTaken = (graph: IFlowGraph, position: IFlowPosition): boolean =>\n  graph.nodes.some(\n    (node) =>\n      Math.abs(node.position.x - position.x) < FLOW_LEVEL_GAP &&\n      Math.abs(node.position.y - position.y) < FLOW_SIBLING_GAP,\n  );\n\n/** Right of the selected block (or the rightmost one), stepping down the column until the slot is free. */\nconst nextFreePosition = (graph: IFlowGraph, selectedNodeIds: Array<string>): IFlowPosition => {\n  if (graph.nodes.length === 0) return { x: 0, y: 0 };\n  const anchor =\n    graph.nodes.find((node) => node.nodeId === selectedNodeIds[0]) ??\n    graph.nodes.reduce((current, node) => (node.position.x > current.position.x ? node : current));\n  let candidate = { x: anchor.position.x + FLOW_LEVEL_GAP, y: anchor.position.y };\n  while (isPositionTaken(graph, candidate)) candidate = { x: candidate.x, y: candidate.y + FLOW_SIBLING_GAP };\n  return candidate;\n};\n\n/**\n * One store per editor instance (two canvases on a page never share state). The graph\n * is the source of truth; the canvas only renders it and reports gestures back.\n */\nexport const createFlowEditorStore = (initialGraph: IFlowGraph, registry: IFlowBlockRegistry): TFlowEditorStore =>\n  createStore<IFlowEditorState>()((set, get) => {\n    let currentRegistry = registry;\n    let lastCoalesce: { key: string; at: number } | null = null;\n\n    const commit = (\n      next: IFlowGraph,\n      selection?: { nodeIds?: Array<string>; edgeIds?: Array<string> },\n      coalesceKey?: string,\n    ) => {\n      const { graph, past } = get();\n      const now = Date.now();\n      const extendsLastStep =\n        coalesceKey !== undefined && lastCoalesce?.key === coalesceKey && now - lastCoalesce.at < COALESCE_WINDOW_MS;\n      lastCoalesce = coalesceKey === undefined ? null : { key: coalesceKey, at: now };\n      set({\n        graph: next,\n        past: extendsLastStep ? past : [...past, graph].slice(-HISTORY_LIMIT),\n        future: [],\n        isDirty: true,\n        ...(selection?.nodeIds ? { selectedNodeIds: selection.nodeIds } : {}),\n        ...(selection?.edgeIds ? { selectedEdgeIds: selection.edgeIds } : {}),\n      });\n    };\n\n    const cloneNodes = (nodes: Array<IFlowNode>, offset: number): Array<IFlowNode> => {\n      const instancesByType = new Map<string, number>();\n      get().graph.nodes.forEach((node) => instancesByType.set(node.type, (instancesByType.get(node.type) ?? 0) + 1));\n      return nodes\n        .filter((node) => {\n          const definition = currentRegistry.get(node.type);\n          if (!definition || definition.category === 'trigger') return false;\n          const instances = instancesByType.get(node.type) ?? 0;\n          if (definition.maxInstances !== undefined && instances >= definition.maxInstances) return false;\n          instancesByType.set(node.type, instances + 1);\n          return true;\n        })\n        .map((node) => ({\n          ...node,\n          nodeId: generateUUID(),\n          config: structuredClone(node.config),\n          position: { x: node.position.x + offset, y: node.position.y + offset },\n        }));\n    };\n\n    return {\n      graph: normalizeGraph(initialGraph, registry),\n      selectedNodeIds: [],\n      selectedEdgeIds: [],\n      past: [],\n      future: [],\n      clipboard: [],\n      isDirty: false,\n\n      replaceGraph: (graph, options) => {\n        set((state) => ({\n          graph: normalizeGraph(graph, currentRegistry),\n          past: options?.keepHistory ? [...state.past, state.graph].slice(-HISTORY_LIMIT) : [],\n          future: [],\n          selectedNodeIds: [],\n          selectedEdgeIds: [],\n          isDirty: Boolean(options?.keepHistory),\n        }));\n      },\n\n      markClean: () => set({ isDirty: false }),\n\n      recordHistory: () => {\n        const { graph, past } = get();\n        set({ past: [...past, graph].slice(-HISTORY_LIMIT), future: [] });\n      },\n\n      addNode: (type, position) => {\n        const definition = currentRegistry.get(type);\n        if (!definition) return null;\n\n        const { graph, selectedNodeIds } = get();\n        const instances = graph.nodes.filter((node) => node.type === type).length;\n        if (definition.maxInstances !== undefined && instances >= definition.maxInstances) return null;\n\n        const node: IFlowNode = {\n          nodeId: generateUUID(),\n          type,\n          typeVersion: definition.typeVersion,\n          config: definition.createDefaultConfig(),\n          position: position ?? nextFreePosition(graph, selectedNodeIds),\n        };\n        commit({ ...graph, nodes: [...graph.nodes, node] }, { nodeIds: [node.nodeId], edgeIds: [] });\n        return node.nodeId;\n      },\n\n      addNodeFromPort: (type, sourceNodeId, sourcePort) => {\n        const definition = currentRegistry.get(type);\n        const { graph } = get();\n        const source = graph.nodes.find((node) => node.nodeId === sourceNodeId);\n        if (!definition || !source) return null;\n\n        const instances = graph.nodes.filter((node) => node.type === type).length;\n        if (definition.maxInstances !== undefined && instances >= definition.maxInstances) return null;\n        if (graph.edges.some((edge) => edge.source === sourceNodeId && edge.sourcePort === sourcePort)) return null;\n\n        const outputs = currentRegistry.get(source.type)?.outputs ?? [];\n        const portIndex = Math.max(0, outputs.indexOf(sourcePort));\n        let position = {\n          x: source.position.x + FLOW_LEVEL_GAP,\n          y: source.position.y + (portIndex - (outputs.length - 1) / 2) * FLOW_SIBLING_GAP,\n        };\n        while (isPositionTaken(graph, position)) position = { x: position.x, y: position.y + FLOW_SIBLING_GAP };\n\n        const node: IFlowNode = {\n          nodeId: generateUUID(),\n          type,\n          typeVersion: definition.typeVersion,\n          config: definition.createDefaultConfig(),\n          position,\n        };\n        const nodes = [...graph.nodes, node];\n        const wires = canConnect({ ...graph, nodes }, currentRegistry, { source: sourceNodeId, sourcePort, target: node.nodeId });\n        const edges = wires\n          ? [...graph.edges, { edgeId: generateUUID(), source: sourceNodeId, sourcePort, target: node.nodeId }]\n          : graph.edges;\n        commit({ nodes, edges }, { nodeIds: [node.nodeId], edgeIds: [] });\n        return node.nodeId;\n      },\n\n      updateNodeConfig: (nodeId, config) => {\n        const { graph } = get();\n        commit(\n          { ...graph, nodes: graph.nodes.map((node) => (node.nodeId === nodeId ? { ...node, config } : node)) },\n          undefined,\n          `config:${nodeId}`,\n        );\n      },\n\n      updateNodeLabel: (nodeId, label) => {\n        const { graph } = get();\n        const hasText = label.trim().length > 0;\n        commit(\n          {\n            ...graph,\n            nodes: graph.nodes.map((node) =>\n              node.nodeId === nodeId ? { ...node, label: hasText ? label : undefined } : node,\n            ),\n          },\n          undefined,\n          `label:${nodeId}`,\n        );\n      },\n\n      moveNodes: (positions) => {\n        const { graph } = get();\n        set({\n          graph: {\n            ...graph,\n            nodes: graph.nodes.map((node) =>\n              positions[node.nodeId] ? { ...node, position: positions[node.nodeId] } : node,\n            ),\n          },\n          isDirty: true,\n        });\n      },\n\n      connect: (source, sourcePort, target) => {\n        const { graph } = get();\n        if (!canConnect(graph, currentRegistry, { source, sourcePort, target })) return false;\n        const edge: IFlowEdge = { edgeId: generateUUID(), source, sourcePort, target };\n        commit({ ...graph, edges: [...graph.edges, edge] });\n        return true;\n      },\n\n      removeEdges: (edgeIds) => {\n        if (edgeIds.length === 0) return;\n        const { graph } = get();\n        const removed = new Set(edgeIds);\n        commit({ ...graph, edges: graph.edges.filter((edge) => !removed.has(edge.edgeId)) }, { edgeIds: [] });\n      },\n\n      removeSelected: () => {\n        const { graph, selectedNodeIds, selectedEdgeIds } = get();\n        if (selectedNodeIds.length === 0 && selectedEdgeIds.length === 0) return;\n        const removedEdges = new Set(selectedEdgeIds);\n        const next = withoutNodes(\n          { ...graph, edges: graph.edges.filter((edge) => !removedEdges.has(edge.edgeId)) },\n          new Set(selectedNodeIds),\n        );\n        commit(next, { nodeIds: [], edgeIds: [] });\n      },\n\n      duplicateSelected: () => {\n        const { graph, selectedNodeIds } = get();\n        const selected = graph.nodes.filter((node) => selectedNodeIds.includes(node.nodeId));\n        const copies = cloneNodes(selected, PASTE_OFFSET);\n        if (copies.length === 0) return;\n        commit(\n          { ...graph, nodes: [...graph.nodes, ...copies] },\n          { nodeIds: copies.map((node) => node.nodeId), edgeIds: [] },\n        );\n      },\n\n      copySelected: () => {\n        const { graph, selectedNodeIds } = get();\n        set({ clipboard: graph.nodes.filter((node) => selectedNodeIds.includes(node.nodeId)) });\n      },\n\n      paste: () => {\n        const { graph, clipboard } = get();\n        const copies = cloneNodes(clipboard, PASTE_OFFSET);\n        if (copies.length === 0) return;\n        commit(\n          { ...graph, nodes: [...graph.nodes, ...copies] },\n          { nodeIds: copies.map((node) => node.nodeId), edgeIds: [] },\n        );\n        set({ clipboard: copies });\n      },\n\n      setSelection: ({ nodeIds, edgeIds }) => {\n        set((state) => ({\n          selectedNodeIds: nodeIds ?? state.selectedNodeIds,\n          selectedEdgeIds: edgeIds ?? state.selectedEdgeIds,\n        }));\n      },\n\n      undo: () => {\n        const { graph, past, future } = get();\n        const previous = past[past.length - 1];\n        if (!previous) return;\n        set({\n          graph: previous,\n          past: past.slice(0, -1),\n          future: [graph, ...future].slice(0, HISTORY_LIMIT),\n          selectedNodeIds: [],\n          selectedEdgeIds: [],\n          isDirty: true,\n        });\n      },\n\n      redo: () => {\n        const { graph, past, future } = get();\n        const following = future[0];\n        if (!following) return;\n        set({\n          graph: following,\n          past: [...past, graph].slice(-HISTORY_LIMIT),\n          future: future.slice(1),\n          selectedNodeIds: [],\n          selectedEdgeIds: [],\n          isDirty: true,\n        });\n      },\n\n      setRegistry: (nextRegistry) => {\n        currentRegistry = nextRegistry;\n      },\n    };\n  });\n"],"names":["node"],"mappings":";;;AAQA,MAAM,gBAAgB;AACtB,MAAM,eAAe;AAErB,MAAM,qBAAqB;AAoC3B,MAAM,aAAa,CAAC,aAClB,OAAQ,UAAwC,MAAM,YACtD,OAAQ,UAAwC,MAAM;AAGxD,MAAM,iBAAiB,CAAC,OAAsC,aAA6C;AACzG,QAAM,aAAyB;AAAA,IAC7B,OAAO,MAAM,QAAQ,OAAO,KAAK,IAAI,MAAM,QAAQ,CAAA;AAAA,IACnD,OAAO,MAAM,QAAQ,OAAO,KAAK,IAAI,MAAM,QAAQ,CAAA;AAAA,EAAC;AAEtD,MAAI,WAAW,MAAM,MAAM,CAAC,SAAS,WAAW,KAAK,QAAQ,CAAC,EAAG,QAAO;AAExE,QAAM,SAAS,mBAAmB,YAAY,QAAQ;AACtD,SAAO;AAAA,IACL,GAAG;AAAA,IACH,OAAO,WAAW,MAAM;AAAA,MAAI,CAAC,SAC3B,WAAW,KAAK,QAAQ,IAAI,OAAO,EAAE,GAAG,MAAM,UAAU,OAAO,KAAK,MAAM,KAAK,EAAE,GAAG,GAAG,GAAG,IAAE;AAAA,IAAE;AAAA,EAChG;AAEJ;AAEA,MAAM,eAAe,CAAC,OAAmB,aAAsC;AAAA,EAC7E,OAAO,MAAM,MAAM,OAAO,CAAC,SAAS,CAAC,QAAQ,IAAI,KAAK,MAAM,CAAC;AAAA,EAC7D,OAAO,MAAM,MAAM,OAAO,CAAC,SAAS,CAAC,QAAQ,IAAI,KAAK,MAAM,KAAK,CAAC,QAAQ,IAAI,KAAK,MAAM,CAAC;AAC5F;AAEA,MAAM,kBAAkB,CAAC,OAAmB,aAC1C,MAAM,MAAM;AAAA,EACV,CAAC,SACC,KAAK,IAAI,KAAK,SAAS,IAAI,SAAS,CAAC,IAAI,kBACzC,KAAK,IAAI,KAAK,SAAS,IAAI,SAAS,CAAC,IAAI;AAC7C;AAGF,MAAM,mBAAmB,CAAC,OAAmB,oBAAkD;AAC7F,MAAI,MAAM,MAAM,WAAW,UAAU,EAAE,GAAG,GAAG,GAAG,EAAA;AAChD,QAAM,SACJ,MAAM,MAAM,KAAK,CAAC,SAAS,KAAK,WAAW,gBAAgB,CAAC,CAAC,KAC7D,MAAM,MAAM,OAAO,CAAC,SAAS,SAAU,KAAK,SAAS,IAAI,QAAQ,SAAS,IAAI,OAAO,OAAQ;AAC/F,MAAI,YAAY,EAAE,GAAG,OAAO,SAAS,IAAI,gBAAgB,GAAG,OAAO,SAAS,EAAA;AAC5E,SAAO,gBAAgB,OAAO,SAAS,EAAG,aAAY,EAAE,GAAG,UAAU,GAAG,GAAG,UAAU,IAAI,iBAAA;AACzF,SAAO;AACT;AAMO,MAAM,wBAAwB,CAAC,cAA0B,aAC9D,cAAgC,CAAC,KAAK,QAAQ;AAC5C,MAAI,kBAAkB;AACtB,MAAI,eAAmD;AAEvD,QAAM,SAAS,CACb,MACA,WACA,gBACG;AACH,UAAM,EAAE,OAAO,KAAA,IAAS,IAAA;AACxB,UAAM,MAAM,KAAK,IAAA;AACjB,UAAM,kBACJ,gBAAgB,UAAa,cAAc,QAAQ,eAAe,MAAM,aAAa,KAAK;AAC5F,mBAAe,gBAAgB,SAAY,OAAO,EAAE,KAAK,aAAa,IAAI,IAAA;AAC1E,QAAI;AAAA,MACF,OAAO;AAAA,MACP,MAAM,kBAAkB,OAAO,CAAC,GAAG,MAAM,KAAK,EAAE,MAAM,CAAC,aAAa;AAAA,MACpE,QAAQ,CAAA;AAAA,MACR,SAAS;AAAA,MACT,GAAI,WAAW,UAAU,EAAE,iBAAiB,UAAU,QAAA,IAAY,CAAA;AAAA,MAClE,GAAI,WAAW,UAAU,EAAE,iBAAiB,UAAU,QAAA,IAAY,CAAA;AAAA,IAAC,CACpE;AAAA,EACH;AAEA,QAAM,aAAa,CAAC,OAAyB,WAAqC;AAChF,UAAM,sCAAsB,IAAA;AAC5B,QAAA,EAAM,MAAM,MAAM,QAAQ,CAAC,SAAS,gBAAgB,IAAI,KAAK,OAAO,gBAAgB,IAAI,KAAK,IAAI,KAAK,KAAK,CAAC,CAAC;AAC7G,WAAO,MACJ,OAAO,CAAC,SAAS;AAChB,YAAM,aAAa,gBAAgB,IAAI,KAAK,IAAI;AAChD,UAAI,CAAC,cAAc,WAAW,aAAa,UAAW,QAAO;AAC7D,YAAM,YAAY,gBAAgB,IAAI,KAAK,IAAI,KAAK;AACpD,UAAI,WAAW,iBAAiB,UAAa,aAAa,WAAW,aAAc,QAAO;AAC1F,sBAAgB,IAAI,KAAK,MAAM,YAAY,CAAC;AAC5C,aAAO;AAAA,IACT,CAAC,EACA,IAAI,CAAC,UAAU;AAAA,MACd,GAAG;AAAA,MACH,QAAQ,aAAA;AAAA,MACR,QAAQ,gBAAgB,KAAK,MAAM;AAAA,MACnC,UAAU,EAAE,GAAG,KAAK,SAAS,IAAI,QAAQ,GAAG,KAAK,SAAS,IAAI,OAAA;AAAA,IAAO,EACrE;AAAA,EACN;AAEA,SAAO;AAAA,IACL,OAAO,eAAe,cAAc,QAAQ;AAAA,IAC5C,iBAAiB,CAAA;AAAA,IACjB,iBAAiB,CAAA;AAAA,IACjB,MAAM,CAAA;AAAA,IACN,QAAQ,CAAA;AAAA,IACR,WAAW,CAAA;AAAA,IACX,SAAS;AAAA,IAET,cAAc,CAAC,OAAO,YAAY;AAChC,UAAI,CAAC,WAAW;AAAA,QACd,OAAO,eAAe,OAAO,eAAe;AAAA,QAC5C,MAAM,SAAS,cAAc,CAAC,GAAG,MAAM,MAAM,MAAM,KAAK,EAAE,MAAM,CAAC,aAAa,IAAI,CAAA;AAAA,QAClF,QAAQ,CAAA;AAAA,QACR,iBAAiB,CAAA;AAAA,QACjB,iBAAiB,CAAA;AAAA,QACjB,SAAS,QAAQ,SAAS,WAAW;AAAA,MAAA,EACrC;AAAA,IACJ;AAAA,IAEA,WAAW,MAAM,IAAI,EAAE,SAAS,OAAO;AAAA,IAEvC,eAAe,MAAM;AACnB,YAAM,EAAE,OAAO,KAAA,IAAS,IAAA;AACxB,UAAI,EAAE,MAAM,CAAC,GAAG,MAAM,KAAK,EAAE,MAAM,CAAC,aAAa,GAAG,QAAQ,CAAA,GAAI;AAAA,IAClE;AAAA,IAEA,SAAS,CAAC,MAAM,aAAa;AAC3B,YAAM,aAAa,gBAAgB,IAAI,IAAI;AAC3C,UAAI,CAAC,WAAY,QAAO;AAExB,YAAM,EAAE,OAAO,gBAAA,IAAoB,IAAA;AACnC,YAAM,YAAY,MAAM,MAAM,OAAO,CAACA,UAASA,MAAK,SAAS,IAAI,EAAE;AACnE,UAAI,WAAW,iBAAiB,UAAa,aAAa,WAAW,aAAc,QAAO;AAE1F,YAAM,OAAkB;AAAA,QACtB,QAAQ,aAAA;AAAA,QACR;AAAA,QACA,aAAa,WAAW;AAAA,QACxB,QAAQ,WAAW,oBAAA;AAAA,QACnB,UAAU,YAAY,iBAAiB,OAAO,eAAe;AAAA,MAAA;AAE/D,aAAO,EAAE,GAAG,OAAO,OAAO,CAAC,GAAG,MAAM,OAAO,IAAI,EAAA,GAAK,EAAE,SAAS,CAAC,KAAK,MAAM,GAAG,SAAS,CAAA,GAAI;AAC3F,aAAO,KAAK;AAAA,IACd;AAAA,IAEA,iBAAiB,CAAC,MAAM,cAAc,eAAe;AACnD,YAAM,aAAa,gBAAgB,IAAI,IAAI;AAC3C,YAAM,EAAE,MAAA,IAAU,IAAA;AAClB,YAAM,SAAS,MAAM,MAAM,KAAK,CAACA,UAASA,MAAK,WAAW,YAAY;AACtE,UAAI,CAAC,cAAc,CAAC,OAAQ,QAAO;AAEnC,YAAM,YAAY,MAAM,MAAM,OAAO,CAACA,UAASA,MAAK,SAAS,IAAI,EAAE;AACnE,UAAI,WAAW,iBAAiB,UAAa,aAAa,WAAW,aAAc,QAAO;AAC1F,UAAI,MAAM,MAAM,KAAK,CAAC,SAAS,KAAK,WAAW,gBAAgB,KAAK,eAAe,UAAU,EAAG,QAAO;AAEvG,YAAM,UAAU,gBAAgB,IAAI,OAAO,IAAI,GAAG,WAAW,CAAA;AAC7D,YAAM,YAAY,KAAK,IAAI,GAAG,QAAQ,QAAQ,UAAU,CAAC;AACzD,UAAI,WAAW;AAAA,QACb,GAAG,OAAO,SAAS,IAAI;AAAA,QACvB,GAAG,OAAO,SAAS,KAAK,aAAa,QAAQ,SAAS,KAAK,KAAK;AAAA,MAAA;AAElE,aAAO,gBAAgB,OAAO,QAAQ,EAAG,YAAW,EAAE,GAAG,SAAS,GAAG,GAAG,SAAS,IAAI,iBAAA;AAErF,YAAM,OAAkB;AAAA,QACtB,QAAQ,aAAA;AAAA,QACR;AAAA,QACA,aAAa,WAAW;AAAA,QACxB,QAAQ,WAAW,oBAAA;AAAA,QACnB;AAAA,MAAA;AAEF,YAAM,QAAQ,CAAC,GAAG,MAAM,OAAO,IAAI;AACnC,YAAM,QAAQ,WAAW,EAAE,GAAG,OAAO,MAAA,GAAS,iBAAiB,EAAE,QAAQ,cAAc,YAAY,QAAQ,KAAK,QAAQ;AACxH,YAAM,QAAQ,QACV,CAAC,GAAG,MAAM,OAAO,EAAE,QAAQ,aAAA,GAAgB,QAAQ,cAAc,YAAY,QAAQ,KAAK,OAAA,CAAQ,IAClG,MAAM;AACV,aAAO,EAAE,OAAO,MAAA,GAAS,EAAE,SAAS,CAAC,KAAK,MAAM,GAAG,SAAS,CAAA,GAAI;AAChE,aAAO,KAAK;AAAA,IACd;AAAA,IAEA,kBAAkB,CAAC,QAAQ,WAAW;AACpC,YAAM,EAAE,MAAA,IAAU,IAAA;AAClB;AAAA,QACE,EAAE,GAAG,OAAO,OAAO,MAAM,MAAM,IAAI,CAAC,SAAU,KAAK,WAAW,SAAS,EAAE,GAAG,MAAM,OAAA,IAAW,IAAK,EAAA;AAAA,QAClG;AAAA,QACA,UAAU,MAAM;AAAA,MAAA;AAAA,IAEpB;AAAA,IAEA,iBAAiB,CAAC,QAAQ,UAAU;AAClC,YAAM,EAAE,MAAA,IAAU,IAAA;AAClB,YAAM,UAAU,MAAM,KAAA,EAAO,SAAS;AACtC;AAAA,QACE;AAAA,UACE,GAAG;AAAA,UACH,OAAO,MAAM,MAAM;AAAA,YAAI,CAAC,SACtB,KAAK,WAAW,SAAS,EAAE,GAAG,MAAM,OAAO,UAAU,QAAQ,OAAA,IAAc;AAAA,UAAA;AAAA,QAC7E;AAAA,QAEF;AAAA,QACA,SAAS,MAAM;AAAA,MAAA;AAAA,IAEnB;AAAA,IAEA,WAAW,CAAC,cAAc;AACxB,YAAM,EAAE,MAAA,IAAU,IAAA;AAClB,UAAI;AAAA,QACF,OAAO;AAAA,UACL,GAAG;AAAA,UACH,OAAO,MAAM,MAAM;AAAA,YAAI,CAAC,SACtB,UAAU,KAAK,MAAM,IAAI,EAAE,GAAG,MAAM,UAAU,UAAU,KAAK,MAAM,MAAM;AAAA,UAAA;AAAA,QAC3E;AAAA,QAEF,SAAS;AAAA,MAAA,CACV;AAAA,IACH;AAAA,IAEA,SAAS,CAAC,QAAQ,YAAY,WAAW;AACvC,YAAM,EAAE,MAAA,IAAU,IAAA;AAClB,UAAI,CAAC,WAAW,OAAO,iBAAiB,EAAE,QAAQ,YAAY,QAAQ,EAAG,QAAO;AAChF,YAAM,OAAkB,EAAE,QAAQ,gBAAgB,QAAQ,YAAY,OAAA;AACtE,aAAO,EAAE,GAAG,OAAO,OAAO,CAAC,GAAG,MAAM,OAAO,IAAI,GAAG;AAClD,aAAO;AAAA,IACT;AAAA,IAEA,aAAa,CAAC,YAAY;AACxB,UAAI,QAAQ,WAAW,EAAG;AAC1B,YAAM,EAAE,MAAA,IAAU,IAAA;AAClB,YAAM,UAAU,IAAI,IAAI,OAAO;AAC/B,aAAO,EAAE,GAAG,OAAO,OAAO,MAAM,MAAM,OAAO,CAAC,SAAS,CAAC,QAAQ,IAAI,KAAK,MAAM,CAAC,EAAA,GAAK,EAAE,SAAS,CAAA,GAAI;AAAA,IACtG;AAAA,IAEA,gBAAgB,MAAM;AACpB,YAAM,EAAE,OAAO,iBAAiB,gBAAA,IAAoB,IAAA;AACpD,UAAI,gBAAgB,WAAW,KAAK,gBAAgB,WAAW,EAAG;AAClE,YAAM,eAAe,IAAI,IAAI,eAAe;AAC5C,YAAM,OAAO;AAAA,QACX,EAAE,GAAG,OAAO,OAAO,MAAM,MAAM,OAAO,CAAC,SAAS,CAAC,aAAa,IAAI,KAAK,MAAM,CAAC,EAAA;AAAA,QAC9E,IAAI,IAAI,eAAe;AAAA,MAAA;AAEzB,aAAO,MAAM,EAAE,SAAS,CAAA,GAAI,SAAS,CAAA,GAAI;AAAA,IAC3C;AAAA,IAEA,mBAAmB,MAAM;AACvB,YAAM,EAAE,OAAO,gBAAA,IAAoB,IAAA;AACnC,YAAM,WAAW,MAAM,MAAM,OAAO,CAAC,SAAS,gBAAgB,SAAS,KAAK,MAAM,CAAC;AACnF,YAAM,SAAS,WAAW,UAAU,YAAY;AAChD,UAAI,OAAO,WAAW,EAAG;AACzB;AAAA,QACE,EAAE,GAAG,OAAO,OAAO,CAAC,GAAG,MAAM,OAAO,GAAG,MAAM,EAAA;AAAA,QAC7C,EAAE,SAAS,OAAO,IAAI,CAAC,SAAS,KAAK,MAAM,GAAG,SAAS,CAAA,EAAC;AAAA,MAAE;AAAA,IAE9D;AAAA,IAEA,cAAc,MAAM;AAClB,YAAM,EAAE,OAAO,gBAAA,IAAoB,IAAA;AACnC,UAAI,EAAE,WAAW,MAAM,MAAM,OAAO,CAAC,SAAS,gBAAgB,SAAS,KAAK,MAAM,CAAC,GAAG;AAAA,IACxF;AAAA,IAEA,OAAO,MAAM;AACX,YAAM,EAAE,OAAO,UAAA,IAAc,IAAA;AAC7B,YAAM,SAAS,WAAW,WAAW,YAAY;AACjD,UAAI,OAAO,WAAW,EAAG;AACzB;AAAA,QACE,EAAE,GAAG,OAAO,OAAO,CAAC,GAAG,MAAM,OAAO,GAAG,MAAM,EAAA;AAAA,QAC7C,EAAE,SAAS,OAAO,IAAI,CAAC,SAAS,KAAK,MAAM,GAAG,SAAS,CAAA,EAAC;AAAA,MAAE;AAE5D,UAAI,EAAE,WAAW,QAAQ;AAAA,IAC3B;AAAA,IAEA,cAAc,CAAC,EAAE,SAAS,cAAc;AACtC,UAAI,CAAC,WAAW;AAAA,QACd,iBAAiB,WAAW,MAAM;AAAA,QAClC,iBAAiB,WAAW,MAAM;AAAA,MAAA,EAClC;AAAA,IACJ;AAAA,IAEA,MAAM,MAAM;AACV,YAAM,EAAE,OAAO,MAAM,OAAA,IAAW,IAAA;AAChC,YAAM,WAAW,KAAK,KAAK,SAAS,CAAC;AACrC,UAAI,CAAC,SAAU;AACf,UAAI;AAAA,QACF,OAAO;AAAA,QACP,MAAM,KAAK,MAAM,GAAG,EAAE;AAAA,QACtB,QAAQ,CAAC,OAAO,GAAG,MAAM,EAAE,MAAM,GAAG,aAAa;AAAA,QACjD,iBAAiB,CAAA;AAAA,QACjB,iBAAiB,CAAA;AAAA,QACjB,SAAS;AAAA,MAAA,CACV;AAAA,IACH;AAAA,IAEA,MAAM,MAAM;AACV,YAAM,EAAE,OAAO,MAAM,OAAA,IAAW,IAAA;AAChC,YAAM,YAAY,OAAO,CAAC;AAC1B,UAAI,CAAC,UAAW;AAChB,UAAI;AAAA,QACF,OAAO;AAAA,QACP,MAAM,CAAC,GAAG,MAAM,KAAK,EAAE,MAAM,CAAC,aAAa;AAAA,QAC3C,QAAQ,OAAO,MAAM,CAAC;AAAA,QACtB,iBAAiB,CAAA;AAAA,QACjB,iBAAiB,CAAA;AAAA,QACjB,SAAS;AAAA,MAAA,CACV;AAAA,IACH;AAAA,IAEA,aAAa,CAAC,iBAAiB;AAC7B,wBAAkB;AAAA,IACpB;AAAA,EAAA;AAEJ,CAAC;"}

package/dist/components/UI/Flow/flowGraph.d.ts

@@ -0,0 +1,32 @@
+import { IFlowBlockRegistry } from './flowBlockRegistry';
+import { IFlowGraph, IFlowIssue, IFlowNode, IFlowPosition, TFlowPortId } from './flowTypes';
+/** The flow reads left to right: one level per column, siblings stacked in the column. */
+export declare const FLOW_LEVEL_GAP = 336;
+export declare const FLOW_SIBLING_GAP = 176;
+export declare const triggerNodesOf: (graph: IFlowGraph, registry: IFlowBlockRegistry) => Array<IFlowNode>;
+/** Node ids reachable from `startNodeId` following edges, the start included. */
+export declare const reachableFrom: (graph: IFlowGraph, startNodeId: string) => Set<string>;
+/** The node ids of the first cycle found, in order, or null when the graph has none. */
+export declare const findCycle: (graph: IFlowGraph) => Array<string> | null;
+export interface IFlowConnectionCandidate {
+    source: string;
+    sourcePort: TFlowPortId;
+    target: string;
+}
+/**
+ * The V0 shape is a tree with no fan-out: one input per block, one edge per output
+ * port, no edge into a trigger and no cycle. Keeping this rule here lets the canvas
+ * refuse a bad connection while it is being drawn, not only when publishing.
+ */
+export declare const canConnect: (graph: IFlowGraph, registry: IFlowBlockRegistry, candidate: IFlowConnectionCandidate) => boolean;
+/** The structural rules of the V0 shape, plus each block's own `validate`. */
+export declare const validateFlowGraph: (graph: IFlowGraph, registry: IFlowBlockRegistry) => Array<IFlowIssue>;
+export declare const hasBlockingIssues: (issues: Array<IFlowIssue>) => boolean;
+/**
+ * Lays the tree out by levels from the trigger: each level one column to the right,
+ * siblings stacked in the column. Used only for a flow with no saved positions (one born from a rule) or when
+ * the user asks for it; a position the user arranged is data and is never overwritten
+ * implicitly.
+ */
+export declare const layoutFlowByLevels: (graph: IFlowGraph, registry: IFlowBlockRegistry) => Record<string, IFlowPosition>;
+export declare const hasSavedPositions: (graph: IFlowGraph) => boolean;

package/dist/components/UI/Flow/flowGraph.js

@@ -0,0 +1,156 @@
+const FLOW_LEVEL_GAP = 336;
+const FLOW_SIBLING_GAP = 176;
+const nodesOf = (graph) => Array.isArray(graph?.nodes) ? graph.nodes : [];
+const edgesOf = (graph) => Array.isArray(graph?.edges) ? graph.edges : [];
+const outgoingByNode = (graph) => {
+  const outgoing = /* @__PURE__ */ new Map();
+  for (const edge of edgesOf(graph)) {
+    outgoing.set(edge.source, [...outgoing.get(edge.source) ?? [], edge]);
+  }
+  return outgoing;
+};
+const triggerNodesOf = (graph, registry) => nodesOf(graph).filter((node) => registry.get(node.type)?.category === "trigger");
+const reachableFrom = (graph, startNodeId) => {
+  const outgoing = outgoingByNode(graph);
+  const visited = /* @__PURE__ */ new Set();
+  const pending = [startNodeId];
+  while (pending.length > 0) {
+    const nodeId = pending.pop();
+    if (nodeId === void 0 || visited.has(nodeId)) continue;
+    visited.add(nodeId);
+    for (const edge of outgoing.get(nodeId) ?? []) pending.push(edge.target);
+  }
+  return visited;
+};
+const findCycle = (graph) => {
+  const outgoing = outgoingByNode(graph);
+  const state = /* @__PURE__ */ new Map();
+  const path = [];
+  const visit = (nodeId) => {
+    state.set(nodeId, "visiting");
+    path.push(nodeId);
+    for (const edge of outgoing.get(nodeId) ?? []) {
+      const targetState = state.get(edge.target);
+      if (targetState === "visiting") return path.slice(path.indexOf(edge.target));
+      if (targetState === void 0) {
+        const cycle = visit(edge.target);
+        if (cycle) return cycle;
+      }
+    }
+    path.pop();
+    state.set(nodeId, "done");
+    return null;
+  };
+  for (const node of nodesOf(graph)) {
+    if (state.has(node.nodeId)) continue;
+    const cycle = visit(node.nodeId);
+    if (cycle) return cycle;
+  }
+  return null;
+};
+const canConnect = (graph, registry, candidate) => {
+  const { source, sourcePort, target } = candidate;
+  if (!source || !target || source === target) return false;
+  const nodes = nodesOf(graph);
+  const sourceNode = nodes.find((node) => node.nodeId === source);
+  const targetNode = nodes.find((node) => node.nodeId === target);
+  if (!sourceNode || !targetNode) return false;
+  const sourceDefinition = registry.get(sourceNode.type);
+  const targetDefinition = registry.get(targetNode.type);
+  if (!sourceDefinition?.outputs.includes(sourcePort)) return false;
+  if (!targetDefinition || targetDefinition.category === "trigger") return false;
+  const edges = edgesOf(graph);
+  if (edges.some((edge) => edge.source === source && edge.sourcePort === sourcePort)) return false;
+  if (edges.some((edge) => edge.target === target)) return false;
+  return !reachableFrom(graph, target).has(source);
+};
+const validateFlowGraph = (graph, registry) => {
+  const issues = [];
+  const nodes = nodesOf(graph);
+  const edges = edgesOf(graph);
+  for (const node of nodes) {
+    const definition = registry.get(node.type);
+    if (!definition) {
+      issues.push({ code: "unknownBlock", severity: "error", nodeId: node.nodeId });
+      continue;
+    }
+    for (const blockIssue of definition.validate(node.config) ?? []) {
+      issues.push({ ...blockIssue, nodeId: node.nodeId });
+    }
+  }
+  const triggers = triggerNodesOf(graph, registry);
+  if (triggers.length === 0) issues.push({ code: "missingTrigger", severity: "error" });
+  triggers.slice(1).forEach((trigger) => {
+    issues.push({ code: "multipleTriggers", severity: "error", nodeId: trigger.nodeId });
+  });
+  const firstTrigger = triggers[0];
+  if (firstTrigger) {
+    const reachable = reachableFrom(graph, firstTrigger.nodeId);
+    nodes.filter((node) => !reachable.has(node.nodeId) && registry.get(node.type)?.category !== "trigger").forEach((node) => issues.push({ code: "unreachableNode", severity: "error", nodeId: node.nodeId }));
+  }
+  const inputCount = /* @__PURE__ */ new Map();
+  const portCount = /* @__PURE__ */ new Map();
+  for (const edge of edges) {
+    inputCount.set(edge.target, (inputCount.get(edge.target) ?? 0) + 1);
+    const portKey = `${edge.source}|${edge.sourcePort}`;
+    portCount.set(portKey, (portCount.get(portKey) ?? 0) + 1);
+  }
+  inputCount.forEach((count, nodeId) => {
+    if (count > 1) issues.push({ code: "multipleInputs", severity: "error", nodeId });
+  });
+  edges.filter((edge) => (portCount.get(`${edge.source}|${edge.sourcePort}`) ?? 0) > 1).forEach(
+    (edge) => issues.push({ code: "portFanOut", severity: "error", edgeId: edge.edgeId, nodeId: edge.source })
+  );
+  const cycle = findCycle(graph);
+  if (cycle) cycle.forEach((nodeId) => issues.push({ code: "cycle", severity: "error", nodeId }));
+  nodes.filter((node) => registry.get(node.type)?.outputs.includes("true")).filter((node) => !edges.some((edge) => edge.source === node.nodeId && edge.sourcePort === "true")).forEach((node) => issues.push({ code: "missingTrueBranch", severity: "warning", nodeId: node.nodeId }));
+  return issues;
+};
+const hasBlockingIssues = (issues) => (issues ?? []).some((issue) => issue.severity === "error");
+const layoutFlowByLevels = (graph, registry) => {
+  const nodes = nodesOf(graph);
+  const outgoing = outgoingByNode(graph);
+  const levelOf = /* @__PURE__ */ new Map();
+  const roots = triggerNodesOf(graph, registry);
+  const queue = roots.map((root) => root.nodeId);
+  roots.forEach((root) => levelOf.set(root.nodeId, 0));
+  while (queue.length > 0) {
+    const nodeId = queue.shift();
+    if (nodeId === void 0) continue;
+    const level = levelOf.get(nodeId) ?? 0;
+    for (const edge of outgoing.get(nodeId) ?? []) {
+      if (levelOf.has(edge.target)) continue;
+      levelOf.set(edge.target, level + 1);
+      queue.push(edge.target);
+    }
+  }
+  const deepestLevel = Math.max(-1, ...Array.from(levelOf.values()));
+  nodes.filter((node) => !levelOf.has(node.nodeId)).forEach((node) => levelOf.set(node.nodeId, deepestLevel + 1));
+  const nodesByLevel = /* @__PURE__ */ new Map();
+  nodes.forEach((node) => {
+    const level = levelOf.get(node.nodeId) ?? 0;
+    nodesByLevel.set(level, [...nodesByLevel.get(level) ?? [], node.nodeId]);
+  });
+  const positions = {};
+  nodesByLevel.forEach((nodeIds, level) => {
+    const columnHeight = (nodeIds.length - 1) * FLOW_SIBLING_GAP;
+    nodeIds.forEach((nodeId, index) => {
+      positions[nodeId] = { x: level * FLOW_LEVEL_GAP, y: index * FLOW_SIBLING_GAP - columnHeight / 2 };
+    });
+  });
+  return positions;
+};
+const hasSavedPositions = (graph) => nodesOf(graph).some((node) => node.position && (node.position.x !== 0 || node.position.y !== 0));
+export {
+  FLOW_LEVEL_GAP,
+  FLOW_SIBLING_GAP,
+  canConnect,
+  findCycle,
+  hasBlockingIssues,
+  hasSavedPositions,
+  layoutFlowByLevels,
+  reachableFrom,
+  triggerNodesOf,
+  validateFlowGraph
+};
+//# sourceMappingURL=flowGraph.js.map

package/dist/components/UI/Flow/flowGraph.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"flowGraph.js","sources":["../../../../src/components/UI/Flow/flowGraph.ts"],"sourcesContent":["import type { IFlowBlockRegistry } from './flowBlockRegistry';\nimport type { IFlowEdge, IFlowGraph, IFlowIssue, IFlowNode, IFlowPosition, TFlowPortId } from './flowTypes';\n\n/** The flow reads left to right: one level per column, siblings stacked in the column. */\nexport const FLOW_LEVEL_GAP = 336;\nexport const FLOW_SIBLING_GAP = 176;\n\nconst nodesOf = (graph: IFlowGraph): Array<IFlowNode> => (Array.isArray(graph?.nodes) ? graph.nodes : []);\nconst edgesOf = (graph: IFlowGraph): Array<IFlowEdge> => (Array.isArray(graph?.edges) ? graph.edges : []);\n\nconst outgoingByNode = (graph: IFlowGraph): Map<string, Array<IFlowEdge>> => {\n  const outgoing = new Map<string, Array<IFlowEdge>>();\n  for (const edge of edgesOf(graph)) {\n    outgoing.set(edge.source, [...(outgoing.get(edge.source) ?? []), edge]);\n  }\n  return outgoing;\n};\n\nexport const triggerNodesOf = (graph: IFlowGraph, registry: IFlowBlockRegistry): Array<IFlowNode> =>\n  nodesOf(graph).filter((node) => registry.get(node.type)?.category === 'trigger');\n\n/** Node ids reachable from `startNodeId` following edges, the start included. */\nexport const reachableFrom = (graph: IFlowGraph, startNodeId: string): Set<string> => {\n  const outgoing = outgoingByNode(graph);\n  const visited = new Set<string>();\n  const pending = [startNodeId];\n  while (pending.length > 0) {\n    const nodeId = pending.pop();\n    if (nodeId === undefined || visited.has(nodeId)) continue;\n    visited.add(nodeId);\n    for (const edge of outgoing.get(nodeId) ?? []) pending.push(edge.target);\n  }\n  return visited;\n};\n\n/** The node ids of the first cycle found, in order, or null when the graph has none. */\nexport const findCycle = (graph: IFlowGraph): Array<string> | null => {\n  const outgoing = outgoingByNode(graph);\n  const state = new Map<string, 'visiting' | 'done'>();\n  const path: Array<string> = [];\n\n  const visit = (nodeId: string): Array<string> | null => {\n    state.set(nodeId, 'visiting');\n    path.push(nodeId);\n    for (const edge of outgoing.get(nodeId) ?? []) {\n      const targetState = state.get(edge.target);\n      if (targetState === 'visiting') return path.slice(path.indexOf(edge.target));\n      if (targetState === undefined) {\n        const cycle = visit(edge.target);\n        if (cycle) return cycle;\n      }\n    }\n    path.pop();\n    state.set(nodeId, 'done');\n    return null;\n  };\n\n  for (const node of nodesOf(graph)) {\n    if (state.has(node.nodeId)) continue;\n    const cycle = visit(node.nodeId);\n    if (cycle) return cycle;\n  }\n  return null;\n};\n\nexport interface IFlowConnectionCandidate {\n  source: string;\n  sourcePort: TFlowPortId;\n  target: string;\n}\n\n/**\n * The V0 shape is a tree with no fan-out: one input per block, one edge per output\n * port, no edge into a trigger and no cycle. Keeping this rule here lets the canvas\n * refuse a bad connection while it is being drawn, not only when publishing.\n */\nexport const canConnect = (\n  graph: IFlowGraph,\n  registry: IFlowBlockRegistry,\n  candidate: IFlowConnectionCandidate,\n): boolean => {\n  const { source, sourcePort, target } = candidate;\n  if (!source || !target || source === target) return false;\n\n  const nodes = nodesOf(graph);\n  const sourceNode = nodes.find((node) => node.nodeId === source);\n  const targetNode = nodes.find((node) => node.nodeId === target);\n  if (!sourceNode || !targetNode) return false;\n\n  const sourceDefinition = registry.get(sourceNode.type);\n  const targetDefinition = registry.get(targetNode.type);\n  if (!sourceDefinition?.outputs.includes(sourcePort)) return false;\n  if (!targetDefinition || targetDefinition.category === 'trigger') return false;\n\n  const edges = edgesOf(graph);\n  if (edges.some((edge) => edge.source === source && edge.sourcePort === sourcePort)) return false;\n  if (edges.some((edge) => edge.target === target)) return false;\n\n  return !reachableFrom(graph, target).has(source);\n};\n\n/** The structural rules of the V0 shape, plus each block's own `validate`. */\nexport const validateFlowGraph = (graph: IFlowGraph, registry: IFlowBlockRegistry): Array<IFlowIssue> => {\n  const issues: Array<IFlowIssue> = [];\n  const nodes = nodesOf(graph);\n  const edges = edgesOf(graph);\n\n  for (const node of nodes) {\n    const definition = registry.get(node.type);\n    if (!definition) {\n      issues.push({ code: 'unknownBlock', severity: 'error', nodeId: node.nodeId });\n      continue;\n    }\n    for (const blockIssue of definition.validate(node.config) ?? []) {\n      issues.push({ ...blockIssue, nodeId: node.nodeId });\n    }\n  }\n\n  const triggers = triggerNodesOf(graph, registry);\n  if (triggers.length === 0) issues.push({ code: 'missingTrigger', severity: 'error' });\n  triggers.slice(1).forEach((trigger) => {\n    issues.push({ code: 'multipleTriggers', severity: 'error', nodeId: trigger.nodeId });\n  });\n\n  const firstTrigger = triggers[0];\n  if (firstTrigger) {\n    const reachable = reachableFrom(graph, firstTrigger.nodeId);\n    nodes\n      .filter((node) => !reachable.has(node.nodeId) && registry.get(node.type)?.category !== 'trigger')\n      .forEach((node) => issues.push({ code: 'unreachableNode', severity: 'error', nodeId: node.nodeId }));\n  }\n\n  const inputCount = new Map<string, number>();\n  const portCount = new Map<string, number>();\n  for (const edge of edges) {\n    inputCount.set(edge.target, (inputCount.get(edge.target) ?? 0) + 1);\n    const portKey = `${edge.source}|${edge.sourcePort}`;\n    portCount.set(portKey, (portCount.get(portKey) ?? 0) + 1);\n  }\n  inputCount.forEach((count, nodeId) => {\n    if (count > 1) issues.push({ code: 'multipleInputs', severity: 'error', nodeId });\n  });\n  edges\n    .filter((edge) => (portCount.get(`${edge.source}|${edge.sourcePort}`) ?? 0) > 1)\n    .forEach((edge) =>\n      issues.push({ code: 'portFanOut', severity: 'error', edgeId: edge.edgeId, nodeId: edge.source }),\n    );\n\n  const cycle = findCycle(graph);\n  if (cycle) cycle.forEach((nodeId) => issues.push({ code: 'cycle', severity: 'error', nodeId }));\n\n  nodes\n    .filter((node) => registry.get(node.type)?.outputs.includes('true'))\n    .filter((node) => !edges.some((edge) => edge.source === node.nodeId && edge.sourcePort === 'true'))\n    .forEach((node) => issues.push({ code: 'missingTrueBranch', severity: 'warning', nodeId: node.nodeId }));\n\n  return issues;\n};\n\nexport const hasBlockingIssues = (issues: Array<IFlowIssue>): boolean =>\n  (issues ?? []).some((issue) => issue.severity === 'error');\n\n/**\n * Lays the tree out by levels from the trigger: each level one column to the right,\n * siblings stacked in the column. Used only for a flow with no saved positions (one born from a rule) or when\n * the user asks for it; a position the user arranged is data and is never overwritten\n * implicitly.\n */\nexport const layoutFlowByLevels = (graph: IFlowGraph, registry: IFlowBlockRegistry): Record<string, IFlowPosition> => {\n  const nodes = nodesOf(graph);\n  const outgoing = outgoingByNode(graph);\n  const levelOf = new Map<string, number>();\n  const roots = triggerNodesOf(graph, registry);\n  const queue: Array<string> = roots.map((root) => root.nodeId);\n  roots.forEach((root) => levelOf.set(root.nodeId, 0));\n\n  while (queue.length > 0) {\n    const nodeId = queue.shift();\n    if (nodeId === undefined) continue;\n    const level = levelOf.get(nodeId) ?? 0;\n    for (const edge of outgoing.get(nodeId) ?? []) {\n      if (levelOf.has(edge.target)) continue;\n      levelOf.set(edge.target, level + 1);\n      queue.push(edge.target);\n    }\n  }\n\n  const deepestLevel = Math.max(-1, ...Array.from(levelOf.values()));\n  nodes.filter((node) => !levelOf.has(node.nodeId)).forEach((node) => levelOf.set(node.nodeId, deepestLevel + 1));\n\n  const nodesByLevel = new Map<number, Array<string>>();\n  nodes.forEach((node) => {\n    const level = levelOf.get(node.nodeId) ?? 0;\n    nodesByLevel.set(level, [...(nodesByLevel.get(level) ?? []), node.nodeId]);\n  });\n\n  const positions: Record<string, IFlowPosition> = {};\n  nodesByLevel.forEach((nodeIds, level) => {\n    const columnHeight = (nodeIds.length - 1) * FLOW_SIBLING_GAP;\n    nodeIds.forEach((nodeId, index) => {\n      positions[nodeId] = { x: level * FLOW_LEVEL_GAP, y: index * FLOW_SIBLING_GAP - columnHeight / 2 };\n    });\n  });\n  return positions;\n};\n\nexport const hasSavedPositions = (graph: IFlowGraph): boolean =>\n  nodesOf(graph).some((node) => node.position && (node.position.x !== 0 || node.position.y !== 0));\n"],"names":[],"mappings":"AAIO,MAAM,iBAAiB;AACvB,MAAM,mBAAmB;AAEhC,MAAM,UAAU,CAAC,UAAyC,MAAM,QAAQ,OAAO,KAAK,IAAI,MAAM,QAAQ,CAAA;AACtG,MAAM,UAAU,CAAC,UAAyC,MAAM,QAAQ,OAAO,KAAK,IAAI,MAAM,QAAQ,CAAA;AAEtG,MAAM,iBAAiB,CAAC,UAAqD;AAC3E,QAAM,+BAAe,IAAA;AACrB,aAAW,QAAQ,QAAQ,KAAK,GAAG;AACjC,aAAS,IAAI,KAAK,QAAQ,CAAC,GAAI,SAAS,IAAI,KAAK,MAAM,KAAK,CAAA,GAAK,IAAI,CAAC;AAAA,EACxE;AACA,SAAO;AACT;AAEO,MAAM,iBAAiB,CAAC,OAAmB,aAChD,QAAQ,KAAK,EAAE,OAAO,CAAC,SAAS,SAAS,IAAI,KAAK,IAAI,GAAG,aAAa,SAAS;AAG1E,MAAM,gBAAgB,CAAC,OAAmB,gBAAqC;AACpF,QAAM,WAAW,eAAe,KAAK;AACrC,QAAM,8BAAc,IAAA;AACpB,QAAM,UAAU,CAAC,WAAW;AAC5B,SAAO,QAAQ,SAAS,GAAG;AACzB,UAAM,SAAS,QAAQ,IAAA;AACvB,QAAI,WAAW,UAAa,QAAQ,IAAI,MAAM,EAAG;AACjD,YAAQ,IAAI,MAAM;AAClB,eAAW,QAAQ,SAAS,IAAI,MAAM,KAAK,CAAA,EAAI,SAAQ,KAAK,KAAK,MAAM;AAAA,EACzE;AACA,SAAO;AACT;AAGO,MAAM,YAAY,CAAC,UAA4C;AACpE,QAAM,WAAW,eAAe,KAAK;AACrC,QAAM,4BAAY,IAAA;AAClB,QAAM,OAAsB,CAAA;AAE5B,QAAM,QAAQ,CAAC,WAAyC;AACtD,UAAM,IAAI,QAAQ,UAAU;AAC5B,SAAK,KAAK,MAAM;AAChB,eAAW,QAAQ,SAAS,IAAI,MAAM,KAAK,CAAA,GAAI;AAC7C,YAAM,cAAc,MAAM,IAAI,KAAK,MAAM;AACzC,UAAI,gBAAgB,WAAY,QAAO,KAAK,MAAM,KAAK,QAAQ,KAAK,MAAM,CAAC;AAC3E,UAAI,gBAAgB,QAAW;AAC7B,cAAM,QAAQ,MAAM,KAAK,MAAM;AAC/B,YAAI,MAAO,QAAO;AAAA,MACpB;AAAA,IACF;AACA,SAAK,IAAA;AACL,UAAM,IAAI,QAAQ,MAAM;AACxB,WAAO;AAAA,EACT;AAEA,aAAW,QAAQ,QAAQ,KAAK,GAAG;AACjC,QAAI,MAAM,IAAI,KAAK,MAAM,EAAG;AAC5B,UAAM,QAAQ,MAAM,KAAK,MAAM;AAC/B,QAAI,MAAO,QAAO;AAAA,EACpB;AACA,SAAO;AACT;AAaO,MAAM,aAAa,CACxB,OACA,UACA,cACY;AACZ,QAAM,EAAE,QAAQ,YAAY,OAAA,IAAW;AACvC,MAAI,CAAC,UAAU,CAAC,UAAU,WAAW,OAAQ,QAAO;AAEpD,QAAM,QAAQ,QAAQ,KAAK;AAC3B,QAAM,aAAa,MAAM,KAAK,CAAC,SAAS,KAAK,WAAW,MAAM;AAC9D,QAAM,aAAa,MAAM,KAAK,CAAC,SAAS,KAAK,WAAW,MAAM;AAC9D,MAAI,CAAC,cAAc,CAAC,WAAY,QAAO;AAEvC,QAAM,mBAAmB,SAAS,IAAI,WAAW,IAAI;AACrD,QAAM,mBAAmB,SAAS,IAAI,WAAW,IAAI;AACrD,MAAI,CAAC,kBAAkB,QAAQ,SAAS,UAAU,EAAG,QAAO;AAC5D,MAAI,CAAC,oBAAoB,iBAAiB,aAAa,UAAW,QAAO;AAEzE,QAAM,QAAQ,QAAQ,KAAK;AAC3B,MAAI,MAAM,KAAK,CAAC,SAAS,KAAK,WAAW,UAAU,KAAK,eAAe,UAAU,EAAG,QAAO;AAC3F,MAAI,MAAM,KAAK,CAAC,SAAS,KAAK,WAAW,MAAM,EAAG,QAAO;AAEzD,SAAO,CAAC,cAAc,OAAO,MAAM,EAAE,IAAI,MAAM;AACjD;AAGO,MAAM,oBAAoB,CAAC,OAAmB,aAAoD;AACvG,QAAM,SAA4B,CAAA;AAClC,QAAM,QAAQ,QAAQ,KAAK;AAC3B,QAAM,QAAQ,QAAQ,KAAK;AAE3B,aAAW,QAAQ,OAAO;AACxB,UAAM,aAAa,SAAS,IAAI,KAAK,IAAI;AACzC,QAAI,CAAC,YAAY;AACf,aAAO,KAAK,EAAE,MAAM,gBAAgB,UAAU,SAAS,QAAQ,KAAK,QAAQ;AAC5E;AAAA,IACF;AACA,eAAW,cAAc,WAAW,SAAS,KAAK,MAAM,KAAK,IAAI;AAC/D,aAAO,KAAK,EAAE,GAAG,YAAY,QAAQ,KAAK,QAAQ;AAAA,IACpD;AAAA,EACF;AAEA,QAAM,WAAW,eAAe,OAAO,QAAQ;AAC/C,MAAI,SAAS,WAAW,EAAG,QAAO,KAAK,EAAE,MAAM,kBAAkB,UAAU,SAAS;AACpF,WAAS,MAAM,CAAC,EAAE,QAAQ,CAAC,YAAY;AACrC,WAAO,KAAK,EAAE,MAAM,oBAAoB,UAAU,SAAS,QAAQ,QAAQ,QAAQ;AAAA,EACrF,CAAC;AAED,QAAM,eAAe,SAAS,CAAC;AAC/B,MAAI,cAAc;AAChB,UAAM,YAAY,cAAc,OAAO,aAAa,MAAM;AAC1D,UACG,OAAO,CAAC,SAAS,CAAC,UAAU,IAAI,KAAK,MAAM,KAAK,SAAS,IAAI,KAAK,IAAI,GAAG,aAAa,SAAS,EAC/F,QAAQ,CAAC,SAAS,OAAO,KAAK,EAAE,MAAM,mBAAmB,UAAU,SAAS,QAAQ,KAAK,OAAA,CAAQ,CAAC;AAAA,EACvG;AAEA,QAAM,iCAAiB,IAAA;AACvB,QAAM,gCAAgB,IAAA;AACtB,aAAW,QAAQ,OAAO;AACxB,eAAW,IAAI,KAAK,SAAS,WAAW,IAAI,KAAK,MAAM,KAAK,KAAK,CAAC;AAClE,UAAM,UAAU,GAAG,KAAK,MAAM,IAAI,KAAK,UAAU;AACjD,cAAU,IAAI,UAAU,UAAU,IAAI,OAAO,KAAK,KAAK,CAAC;AAAA,EAC1D;AACA,aAAW,QAAQ,CAAC,OAAO,WAAW;AACpC,QAAI,QAAQ,EAAG,QAAO,KAAK,EAAE,MAAM,kBAAkB,UAAU,SAAS,QAAQ;AAAA,EAClF,CAAC;AACD,QACG,OAAO,CAAC,UAAU,UAAU,IAAI,GAAG,KAAK,MAAM,IAAI,KAAK,UAAU,EAAE,KAAK,KAAK,CAAC,EAC9E;AAAA,IAAQ,CAAC,SACR,OAAO,KAAK,EAAE,MAAM,cAAc,UAAU,SAAS,QAAQ,KAAK,QAAQ,QAAQ,KAAK,QAAQ;AAAA,EAAA;AAGnG,QAAM,QAAQ,UAAU,KAAK;AAC7B,MAAI,MAAO,OAAM,QAAQ,CAAC,WAAW,OAAO,KAAK,EAAE,MAAM,SAAS,UAAU,SAAS,OAAA,CAAQ,CAAC;AAE9F,QACG,OAAO,CAAC,SAAS,SAAS,IAAI,KAAK,IAAI,GAAG,QAAQ,SAAS,MAAM,CAAC,EAClE,OAAO,CAAC,SAAS,CAAC,MAAM,KAAK,CAAC,SAAS,KAAK,WAAW,KAAK,UAAU,KAAK,eAAe,MAAM,CAAC,EACjG,QAAQ,CAAC,SAAS,OAAO,KAAK,EAAE,MAAM,qBAAqB,UAAU,WAAW,QAAQ,KAAK,OAAA,CAAQ,CAAC;AAEzG,SAAO;AACT;AAEO,MAAM,oBAAoB,CAAC,YAC/B,UAAU,CAAA,GAAI,KAAK,CAAC,UAAU,MAAM,aAAa,OAAO;AAQpD,MAAM,qBAAqB,CAAC,OAAmB,aAAgE;AACpH,QAAM,QAAQ,QAAQ,KAAK;AAC3B,QAAM,WAAW,eAAe,KAAK;AACrC,QAAM,8BAAc,IAAA;AACpB,QAAM,QAAQ,eAAe,OAAO,QAAQ;AAC5C,QAAM,QAAuB,MAAM,IAAI,CAAC,SAAS,KAAK,MAAM;AAC5D,QAAM,QAAQ,CAAC,SAAS,QAAQ,IAAI,KAAK,QAAQ,CAAC,CAAC;AAEnD,SAAO,MAAM,SAAS,GAAG;AACvB,UAAM,SAAS,MAAM,MAAA;AACrB,QAAI,WAAW,OAAW;AAC1B,UAAM,QAAQ,QAAQ,IAAI,MAAM,KAAK;AACrC,eAAW,QAAQ,SAAS,IAAI,MAAM,KAAK,CAAA,GAAI;AAC7C,UAAI,QAAQ,IAAI,KAAK,MAAM,EAAG;AAC9B,cAAQ,IAAI,KAAK,QAAQ,QAAQ,CAAC;AAClC,YAAM,KAAK,KAAK,MAAM;AAAA,IACxB;AAAA,EACF;AAEA,QAAM,eAAe,KAAK,IAAI,IAAI,GAAG,MAAM,KAAK,QAAQ,OAAA,CAAQ,CAAC;AACjE,QAAM,OAAO,CAAC,SAAS,CAAC,QAAQ,IAAI,KAAK,MAAM,CAAC,EAAE,QAAQ,CAAC,SAAS,QAAQ,IAAI,KAAK,QAAQ,eAAe,CAAC,CAAC;AAE9G,QAAM,mCAAmB,IAAA;AACzB,QAAM,QAAQ,CAAC,SAAS;AACtB,UAAM,QAAQ,QAAQ,IAAI,KAAK,MAAM,KAAK;AAC1C,iBAAa,IAAI,OAAO,CAAC,GAAI,aAAa,IAAI,KAAK,KAAK,CAAA,GAAK,KAAK,MAAM,CAAC;AAAA,EAC3E,CAAC;AAED,QAAM,YAA2C,CAAA;AACjD,eAAa,QAAQ,CAAC,SAAS,UAAU;AACvC,UAAM,gBAAgB,QAAQ,SAAS,KAAK;AAC5C,YAAQ,QAAQ,CAAC,QAAQ,UAAU;AACjC,gBAAU,MAAM,IAAI,EAAE,GAAG,QAAQ,gBAAgB,GAAG,QAAQ,mBAAmB,eAAe,EAAA;AAAA,IAChG,CAAC;AAAA,EACH,CAAC;AACD,SAAO;AACT;AAEO,MAAM,oBAAoB,CAAC,UAChC,QAAQ,KAAK,EAAE,KAAK,CAAC,SAAS,KAAK,aAAa,KAAK,SAAS,MAAM,KAAK,KAAK,SAAS,MAAM,EAAE;"}

package/dist/components/UI/Flow/flowTypes.d.ts

@@ -0,0 +1,74 @@
+import { ComponentType, ReactNode } from 'react';
+import { SymbolCodepoints } from '../MaterialSymbol';
+export type TFlowPortId = 'next' | 'true' | 'false' | 'error';
+export type TFlowBlockCategory = 'trigger' | 'condition' | 'action';
+export interface IFlowPosition {
+    x: number;
+    y: number;
+}
+export interface IFlowNode<TConfig = unknown> {
+    nodeId: string;
+    type: string;
+    typeVersion: number;
+    config: TConfig;
+    position: IFlowPosition;
+    label?: string;
+    disabled?: boolean;
+}
+export interface IFlowEdge {
+    edgeId: string;
+    source: string;
+    sourcePort: TFlowPortId;
+    target: string;
+}
+export interface IFlowGraph {
+    nodes: Array<IFlowNode>;
+    edges: Array<IFlowEdge>;
+}
+export type TFlowIssueSeverity = 'error' | 'warning';
+export type TFlowGraphIssueCode = 'missingTrigger' | 'multipleTriggers' | 'unknownBlock' | 'unreachableNode' | 'multipleInputs' | 'portFanOut' | 'cycle' | 'missingTrueBranch';
+export interface IFlowIssue {
+    /** A graph rule from `TFlowGraphIssueCode`, or a block-specific code from its `validate`. */
+    code: string;
+    severity: TFlowIssueSeverity;
+    /** Already translated by the block. Graph issues leave it empty and the UI names them. */
+    message?: string;
+    nodeId?: string;
+    edgeId?: string;
+}
+export type TFlowRunStepStatus = 'passed' | 'failed' | 'skipped' | 'wouldRun' | 'error' | 'blocked';
+/** The result of one run (real or simulated) painted over the canvas. */
+export interface IFlowRunOverlay {
+    steps: Record<string, TFlowRunStepStatus>;
+    traversedEdgeIds: Array<string>;
+}
+export interface IFlowBlockConfigPanelProps<TConfig> {
+    config: TConfig;
+    onChange: (next: TConfig) => void;
+    readOnly?: boolean;
+}
+export type TFlowBlockIssue = Omit<IFlowIssue, 'nodeId' | 'edgeId'>;
+export interface IFlowBlockDefinition<TConfig = unknown> {
+    /** Namespaced and stable: `trigger.recordEvent`, `action.moveWorkflowCard`. */
+    type: string;
+    typeVersion: number;
+    category: TFlowBlockCategory;
+    icon: SymbolCodepoints;
+    /** Translated by the host. */
+    label: string;
+    description?: string;
+    outputs: Array<TFlowPortId>;
+    /** How many of this block a flow may hold; omit for no limit. */
+    maxInstances?: number;
+    createDefaultConfig: () => TConfig;
+    migrateConfig?: (config: unknown, fromVersion: number) => TConfig;
+    ConfigPanel: ComponentType<IFlowBlockConfigPanelProps<TConfig>>;
+    /** When one block stands for several kinds (chosen inside it), the icon and name of the chosen kind. */
+    resolveIcon?: (config: TConfig) => SymbolCodepoints | undefined;
+    resolveLabel?: (config: TConfig) => string | undefined;
+    /** One line inside the block on the canvas. */
+    renderSummary: (config: TConfig) => ReactNode;
+    /** This block's piece of the "When..., if..., then..." sentence. */
+    describe: (config: TConfig) => string;
+    validate: (config: TConfig) => Array<TFlowBlockIssue>;
+}

package/dist/components/UI/Flow/flowTypes.js

@@ -0,0 +1,2 @@
+
+//# sourceMappingURL=flowTypes.js.map

package/dist/components/UI/Flow/flowTypes.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"flowTypes.js","sources":[],"sourcesContent":[],"names":[],"mappings":""}

package/dist/components/UI/Flow/index.d.ts

@@ -0,0 +1,14 @@
+export { createFlowBlockRegistry, defineFlowBlock, type IFlowBlockRegistry } from './flowBlockRegistry';
+export { default as FlowCanvas, type IFlowCanvasProps } from './FlowCanvas';
+export { FLOW_BLOCK_DRAG_TYPE } from './flowConstants';
+export { default as FlowEditorProvider, useFlowBlockRegistry, useFlowEditor, useFlowEditorStore, } from './FlowEditorProvider';
+export { createFlowEditorStore, type IFlowEditorState, type TFlowEditorStore } from './flowEditorStore';
+export { canConnect, findCycle, FLOW_LEVEL_GAP, FLOW_SIBLING_GAP, hasBlockingIssues, hasSavedPositions, layoutFlowByLevels, reachableFrom, triggerNodesOf, validateFlowGraph, } from './flowGraph';
+export { default as FlowInspector } from './FlowInspector';
+export { default as FlowIssueList } from './FlowIssueList';
+export { default as FlowLaneMap, type IFlowArc, type IFlowLane, type TFlowArcTone } from './FlowLaneMap';
+export { default as FlowNodeShell, type IFlowNodeShellProps } from './FlowNodeShell';
+export { default as FlowPalette } from './FlowPalette';
+export { default as FlowResizablePanel, type IFlowResizablePanelProps } from './FlowResizablePanel';
+export type * from './flowTypes';
+export { FLOW_RUN_STATUS_TONE, useFlowLabels } from './useFlowLabels';