@mindlogic-ai/logician-ui 3.1.0 → 3.2.0-alpha.1

package/dist/components/Workflow/graphReducer.mjs

@@ -0,0 +1,119 @@
+"use client";
+/** Normalize null-vs-undefined for optional handle ids so dedupe works. */
+function normEdge(edge) {
+    return {
+        ...edge,
+        sourceHandle: edge.sourceHandle ?? undefined,
+        targetHandle: edge.targetHandle ?? undefined,
+    };
+}
+function normGraph(graph) {
+    return { ...graph, edges: graph.edges.map(normEdge) };
+}
+function graphReducer(state, action) {
+    switch (action.type) {
+        case 'addNode':
+            if (state.nodes.some((n) => n.id === action.node.id))
+                return state;
+            return { ...state, nodes: [...state.nodes, action.node] };
+        case 'addNodeWithEdge': {
+            if (state.nodes.some((n) => n.id === action.node.id))
+                return state;
+            const nodes = [...state.nodes, action.node];
+            if (!action.autoConnectFrom)
+                return { ...state, nodes };
+            const edge = normEdge(action.autoConnectFrom.edge);
+            // The auto-edge is freshly generated and references a brand-new node id,
+            // so it can't collide; append it alongside the node.
+            return { nodes, edges: [...state.edges, edge] };
+        }
+        case 'updateNodePosition':
+            return {
+                ...state,
+                nodes: state.nodes.map((n) => n.id === action.id ? { ...n, position: action.position } : n),
+            };
+        case 'arrangeNodes': {
+            // Skip nodes that don't move so an arrange producing the current layout
+            // collapses to the same reference — `historyReducer` then treats it as a
+            // no-op and records no undo step.
+            let moved = false;
+            const nodes = state.nodes.map((n) => {
+                const next = action.positions[n.id];
+                if (!next || (next.x === n.position.x && next.y === n.position.y)) {
+                    return n;
+                }
+                moved = true;
+                return { ...n, position: next };
+            });
+            return moved ? { ...state, nodes } : state;
+        }
+        case 'updateNodeConfig': {
+            const nodes = state.nodes.map((n) => n.id === action.id ? { ...n, config: action.config } : n);
+            const remap = action.remapEdgeHandle;
+            if (!remap)
+                return { ...state, nodes };
+            const edges = state.edges.map((e) => e.source === action.id && (e.sourceHandle ?? undefined) === remap.from
+                ? { ...e, sourceHandle: remap.to }
+                : e);
+            return { ...state, nodes, edges };
+        }
+        case 'deleteNode':
+            return {
+                nodes: state.nodes.filter((n) => n.id !== action.id),
+                edges: state.edges.filter((e) => e.source !== action.id && e.target !== action.id),
+            };
+        case 'addEdge': {
+            const edge = normEdge(action.edge);
+            if (state.edges.some((e) => e.id === edge.id))
+                return state;
+            const dup = state.edges.some((e) => e.source === edge.source &&
+                (e.sourceHandle ?? undefined) === edge.sourceHandle &&
+                e.target === edge.target &&
+                (e.targetHandle ?? undefined) === edge.targetHandle);
+            if (dup)
+                return state;
+            return { ...state, edges: [...state.edges, edge] };
+        }
+        case 'reconnectEdge': {
+            const existing = state.edges.find((e) => e.id === action.id);
+            if (!existing)
+                return state;
+            const next = normEdge({
+                ...existing,
+                source: action.source,
+                target: action.target,
+                sourceHandle: action.sourceHandle,
+                targetHandle: action.targetHandle,
+            });
+            // A reconnect can land on endpoints that already have an identical edge;
+            // isValidConnection doesn't dedupe, so guard here and no-op the move.
+            const dup = state.edges.some((e) => e.id !== next.id &&
+                e.source === next.source &&
+                (e.sourceHandle ?? undefined) === next.sourceHandle &&
+                e.target === next.target &&
+                (e.targetHandle ?? undefined) === next.targetHandle);
+            if (dup)
+                return state;
+            return {
+                ...state,
+                edges: state.edges.map((e) => (e.id === next.id ? next : e)),
+            };
+        }
+        case 'deleteEdge':
+            return { ...state, edges: state.edges.filter((e) => e.id !== action.id) };
+        case 'updateEdge': {
+            if (!state.edges.some((e) => e.id === action.id))
+                return state;
+            return {
+                ...state,
+                edges: state.edges.map((e) => e.id === action.id ? normEdge({ ...e, ...action.patch }) : e),
+            };
+        }
+        case 'replace':
+            return normGraph(action.graph);
+    }
+}
+const emptyGraph = { nodes: [], edges: [] };
+
+export { emptyGraph, graphReducer };
+//# sourceMappingURL=graphReducer.mjs.map

package/dist/components/Workflow/graphReducer.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"graphReducer.mjs","sources":["../../../src/components/Workflow/graphReducer.ts"],"sourcesContent":[null],"names":[],"mappings":";AA6DA;AACA,SAAS,QAAQ,CAAC,IAAe,EAAA;IAC/B,OAAO;AACL,QAAA,GAAG,IAAI;AACP,QAAA,YAAY,EAAE,IAAI,CAAC,YAAY,IAAI,SAAS;AAC5C,QAAA,YAAY,EAAE,IAAI,CAAC,YAAY,IAAI,SAAS;KAC7C;AACH;AAEA,SAAS,SAAS,CAAC,KAAY,EAAA;AAC7B,IAAA,OAAO,EAAE,GAAG,KAAK,EAAE,KAAK,EAAE,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE;AACvD;AAEM,SAAU,YAAY,CAAC,KAAY,EAAE,MAAmB,EAAA;AAC5D,IAAA,QAAQ,MAAM,CAAC,IAAI;AACjB,QAAA,KAAK,SAAS;YACZ,IAAI,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC;AAAE,gBAAA,OAAO,KAAK;AAClE,YAAA,OAAO,EAAE,GAAG,KAAK,EAAE,KAAK,EAAE,CAAC,GAAG,KAAK,CAAC,KAAK,EAAE,MAAM,CAAC,IAAI,CAAC,EAAE;QAE3D,KAAK,iBAAiB,EAAE;YACtB,IAAI,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC;AAAE,gBAAA,OAAO,KAAK;AAClE,YAAA,MAAM,KAAK,GAAG,CAAC,GAAG,KAAK,CAAC,KAAK,EAAE,MAAM,CAAC,IAAI,CAAC;YAC3C,IAAI,CAAC,MAAM,CAAC,eAAe;AAAE,gBAAA,OAAO,EAAE,GAAG,KAAK,EAAE,KAAK,EAAE;YACvD,MAAM,IAAI,GAAG,QAAQ,CAAC,MAAM,CAAC,eAAe,CAAC,IAAI,CAAC;;;AAGlD,YAAA,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,GAAG,KAAK,CAAC,KAAK,EAAE,IAAI,CAAC,EAAE;QACjD;AAEA,QAAA,KAAK,oBAAoB;YACvB,OAAO;AACL,gBAAA,GAAG,KAAK;AACR,gBAAA,KAAK,EAAE,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,KACvB,CAAC,CAAC,EAAE,KAAK,MAAM,CAAC,EAAE,GAAG,EAAE,GAAG,CAAC,EAAE,QAAQ,EAAE,MAAM,CAAC,QAAQ,EAAE,GAAG,CAAC,CAC7D;aACF;QAEH,KAAK,cAAc,EAAE;;;;YAInB,IAAI,KAAK,GAAG,KAAK;YACjB,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,KAAI;gBAClC,MAAM,IAAI,GAAG,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC;gBACnC,IAAI,CAAC,IAAI,KAAK,IAAI,CAAC,CAAC,KAAK,CAAC,CAAC,QAAQ,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,KAAK,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE;AACjE,oBAAA,OAAO,CAAC;gBACV;gBACA,KAAK,GAAG,IAAI;gBACZ,OAAO,EAAE,GAAG,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAE;AACjC,YAAA,CAAC,CAAC;AACF,YAAA,OAAO,KAAK,GAAG,EAAE,GAAG,KAAK,EAAE,KAAK,EAAE,GAAG,KAAK;QAC5C;QAEA,KAAK,kBAAkB,EAAE;AACvB,YAAA,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,KAC9B,CAAC,CAAC,EAAE,KAAK,MAAM,CAAC,EAAE,GAAG,EAAE,GAAG,CAAC,EAAE,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC,CACzD;AACD,YAAA,MAAM,KAAK,GAAG,MAAM,CAAC,eAAe;AACpC,YAAA,IAAI,CAAC,KAAK;AAAE,gBAAA,OAAO,EAAE,GAAG,KAAK,EAAE,KAAK,EAAE;AACtC,YAAA,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,KAC9B,CAAC,CAAC,MAAM,KAAK,MAAM,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,YAAY,IAAI,SAAS,MAAM,KAAK,CAAC;kBAC9D,EAAE,GAAG,CAAC,EAAE,YAAY,EAAE,KAAK,CAAC,EAAE;kBAC9B,CAAC,CACN;YACD,OAAO,EAAE,GAAG,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE;QACnC;AAEA,QAAA,KAAK,YAAY;YACf,OAAO;AACL,gBAAA,KAAK,EAAE,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,MAAM,CAAC,EAAE,CAAC;gBACpD,KAAK,EAAE,KAAK,CAAC,KAAK,CAAC,MAAM,CACvB,CAAC,CAAC,KAAK,CAAC,CAAC,MAAM,KAAK,MAAM,CAAC,EAAE,IAAI,CAAC,CAAC,MAAM,KAAK,MAAM,CAAC,EAAE,CACxD;aACF;QAEH,KAAK,SAAS,EAAE;YACd,MAAM,IAAI,GAAG,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC;AAClC,YAAA,IAAI,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,IAAI,CAAC,EAAE,CAAC;AAAE,gBAAA,OAAO,KAAK;AAC3D,YAAA,MAAM,GAAG,GAAG,KAAK,CAAC,KAAK,CAAC,IAAI,CAC1B,CAAC,CAAC,KACA,CAAC,CAAC,MAAM,KAAK,IAAI,CAAC,MAAM;gBACxB,CAAC,CAAC,CAAC,YAAY,IAAI,SAAS,MAAM,IAAI,CAAC,YAAY;AACnD,gBAAA,CAAC,CAAC,MAAM,KAAK,IAAI,CAAC,MAAM;gBACxB,CAAC,CAAC,CAAC,YAAY,IAAI,SAAS,MAAM,IAAI,CAAC,YAAY,CACtD;AACD,YAAA,IAAI,GAAG;AAAE,gBAAA,OAAO,KAAK;AACrB,YAAA,OAAO,EAAE,GAAG,KAAK,EAAE,KAAK,EAAE,CAAC,GAAG,KAAK,CAAC,KAAK,EAAE,IAAI,CAAC,EAAE;QACpD;QAEA,KAAK,eAAe,EAAE;YACpB,MAAM,QAAQ,GAAG,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,MAAM,CAAC,EAAE,CAAC;AAC5D,YAAA,IAAI,CAAC,QAAQ;AAAE,gBAAA,OAAO,KAAK;YAC3B,MAAM,IAAI,GAAG,QAAQ,CAAC;AACpB,gBAAA,GAAG,QAAQ;gBACX,MAAM,EAAE,MAAM,CAAC,MAAM;gBACrB,MAAM,EAAE,MAAM,CAAC,MAAM;gBACrB,YAAY,EAAE,MAAM,CAAC,YAAY;gBACjC,YAAY,EAAE,MAAM,CAAC,YAAY;AAClC,aAAA,CAAC;;;AAGF,YAAA,MAAM,GAAG,GAAG,KAAK,CAAC,KAAK,CAAC,IAAI,CAC1B,CAAC,CAAC,KACA,CAAC,CAAC,EAAE,KAAK,IAAI,CAAC,EAAE;AAChB,gBAAA,CAAC,CAAC,MAAM,KAAK,IAAI,CAAC,MAAM;gBACxB,CAAC,CAAC,CAAC,YAAY,IAAI,SAAS,MAAM,IAAI,CAAC,YAAY;AACnD,gBAAA,CAAC,CAAC,MAAM,KAAK,IAAI,CAAC,MAAM;gBACxB,CAAC,CAAC,CAAC,YAAY,IAAI,SAAS,MAAM,IAAI,CAAC,YAAY,CACtD;AACD,YAAA,IAAI,GAAG;AAAE,gBAAA,OAAO,KAAK;YACrB,OAAO;AACL,gBAAA,GAAG,KAAK;AACR,gBAAA,KAAK,EAAE,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,EAAE,KAAK,IAAI,CAAC,EAAE,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC;aAC7D;QACH;AAEA,QAAA,KAAK,YAAY;YACf,OAAO,EAAE,GAAG,KAAK,EAAE,KAAK,EAAE,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,MAAM,CAAC,EAAE,CAAC,EAAE;QAE3E,KAAK,YAAY,EAAE;AACjB,YAAA,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,MAAM,CAAC,EAAE,CAAC;AAAE,gBAAA,OAAO,KAAK;YAC9D,OAAO;AACL,gBAAA,GAAG,KAAK;AACR,gBAAA,KAAK,EAAE,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,KACvB,CAAC,CAAC,EAAE,KAAK,MAAM,CAAC,EAAE,GAAG,QAAQ,CAAC,EAAE,GAAG,CAAC,EAAE,GAAG,MAAM,CAAC,KAAK,EAAE,CAAC,GAAG,CAAC,CAC7D;aACF;QACH;AAEA,QAAA,KAAK,SAAS;AACZ,YAAA,OAAO,SAAS,CAAC,MAAM,CAAC,KAAK,CAAC;;AAEpC;AAEO,MAAM,UAAU,GAAU,EAAE,KAAK,EAAE,EAAE,EAAE,KAAK,EAAE,EAAE;;;;"}

package/dist/components/Workflow/index.d.ts

@@ -0,0 +1,22 @@
+export type { CollapsibleSectionProps } from './canvas/CollapsibleSection';
+export { CollapsibleSection } from './canvas/CollapsibleSection';
+export type { NodeInspectorProps } from './canvas/DrawerShell';
+export { NodeInspector } from './canvas/DrawerShell';
+export type { FieldTone, FieldToneState, FieldWrapperProps, } from './canvas/FieldWrapper';
+export { FieldWrapper } from './canvas/FieldWrapper';
+export { FLOATING_CARD_WIDTH, FloatingCard } from './canvas/FloatingCard';
+export type { CategoryTokenMap, CategoryTokens, IconTileProps, } from './canvas/IconTile';
+export { DEFAULT_CATEGORY_TOKENS, getCategoryTokens, IconTile, } from './canvas/IconTile';
+export type { NodeShellProps, PortStyle, RingChrome } from './canvas/NodeShell';
+export { CARD_WIDTH, MAX_META_CHIPS, metaChipStyles, NodeShell, PORT_STYLE, } from './canvas/NodeShell';
+export { workflowLabelProps } from './canvas/workflowLabelProps';
+export type { WorkflowGraphObserver } from './graphObserver';
+export { useWorkflowGraphObserver, WorkflowGraphObserverContext, } from './graphObserver';
+export type { GraphAction } from './graphReducer';
+export { emptyGraph, graphReducer } from './graphReducer';
+export { Workflow } from './Workflow';
+export type { ConnectionCtx, DockSide, DrawerRenderProps, EdgeDrawerRenderProps, Graph, GraphEdge, GraphNode, HandleDef, Issue, IssueSeverity, JSONSchema, MetaChipSpec, MetaChipTone, NodeCategory, NodeRenderProps, NodeTypeDef, NodeTypeRegistry, PlacementRule, Position, RunState, WorkflowProps, WorkflowSelection, WorkflowTranslate, } from './Workflow.types';
+export { defineNodeType, resolveDefaultConfig } from './Workflow.types';
+export type { EditorState, WorkflowContextValue, WorkflowProviderProps, } from './WorkflowContext';
+export { useWorkflow, useWorkflowTranslate, WorkflowProvider, } from './WorkflowContext';
+//# sourceMappingURL=index.d.ts.map

package/dist/components/Workflow/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/components/Workflow/index.ts"],"names":[],"mappings":"AAAA,YAAY,EAAE,uBAAuB,EAAE,MAAM,6BAA6B,CAAC;AAC3E,OAAO,EAAE,kBAAkB,EAAE,MAAM,6BAA6B,CAAC;AACjE,YAAY,EAAE,kBAAkB,EAAE,MAAM,sBAAsB,CAAC;AAC/D,OAAO,EAAE,aAAa,EAAE,MAAM,sBAAsB,CAAC;AACrD,YAAY,EACV,SAAS,EACT,cAAc,EACd,iBAAiB,GAClB,MAAM,uBAAuB,CAAC;AAC/B,OAAO,EAAE,YAAY,EAAE,MAAM,uBAAuB,CAAC;AACrD,OAAO,EAAE,mBAAmB,EAAE,YAAY,EAAE,MAAM,uBAAuB,CAAC;AAC1E,YAAY,EACV,gBAAgB,EAChB,cAAc,EACd,aAAa,GACd,MAAM,mBAAmB,CAAC;AAC3B,OAAO,EACL,uBAAuB,EACvB,iBAAiB,EACjB,QAAQ,GACT,MAAM,mBAAmB,CAAC;AAC3B,YAAY,EAAE,cAAc,EAAE,SAAS,EAAE,UAAU,EAAE,MAAM,oBAAoB,CAAC;AAChF,OAAO,EACL,UAAU,EACV,cAAc,EACd,cAAc,EACd,SAAS,EACT,UAAU,GACX,MAAM,oBAAoB,CAAC;AAC5B,OAAO,EAAE,kBAAkB,EAAE,MAAM,6BAA6B,CAAC;AACjE,YAAY,EAAE,qBAAqB,EAAE,MAAM,iBAAiB,CAAC;AAC7D,OAAO,EACL,wBAAwB,EACxB,4BAA4B,GAC7B,MAAM,iBAAiB,CAAC;AACzB,YAAY,EAAE,WAAW,EAAE,MAAM,gBAAgB,CAAC;AAClD,OAAO,EAAE,UAAU,EAAE,YAAY,EAAE,MAAM,gBAAgB,CAAC;AAC1D,OAAO,EAAE,QAAQ,EAAE,MAAM,YAAY,CAAC;AACtC,YAAY,EACV,aAAa,EACb,QAAQ,EACR,iBAAiB,EACjB,qBAAqB,EACrB,KAAK,EACL,SAAS,EACT,SAAS,EACT,SAAS,EACT,KAAK,EACL,aAAa,EACb,UAAU,EACV,YAAY,EACZ,YAAY,EACZ,YAAY,EACZ,eAAe,EACf,WAAW,EACX,gBAAgB,EAChB,aAAa,EACb,QAAQ,EACR,QAAQ,EACR,aAAa,EACb,iBAAiB,EACjB,iBAAiB,GAClB,MAAM,kBAAkB,CAAC;AAC1B,OAAO,EAAE,cAAc,EAAE,oBAAoB,EAAE,MAAM,kBAAkB,CAAC;AACxE,YAAY,EACV,WAAW,EACX,oBAAoB,EACpB,qBAAqB,GACtB,MAAM,mBAAmB,CAAC;AAC3B,OAAO,EACL,WAAW,EACX,oBAAoB,EACpB,gBAAgB,GACjB,MAAM,mBAAmB,CAAC"}

package/dist/components/Workflow/layout/autoLayout.d.ts

@@ -0,0 +1,49 @@
+import type { Graph } from '../Workflow.types';
+/**
+ * Flow axis of the laid-out graph. `LR` (the default) lays ranks out
+ * left-to-right, matching the way a workflow reads: trigger → steps → output.
+ */
+export type LayoutDirection = 'LR' | 'TB';
+/** Rendered footprint of a node, used so ranks don't overlap. */
+export type NodeDimensions = {
+    width: number;
+    height: number;
+    /**
+     * Extra room (px) to reserve on the node's trailing (downstream) edge for
+     * content that overflows the card — specifically the exit labels a Classify /
+     * If-Else node paints to the right of its handles. These are absolutely
+     * positioned, so React Flow's measured `width` excludes them; without this
+     * the next rank packs right up against the node and the edges leaving those
+     * exits get tucked under the label text. See `estimateLabelOverhang`.
+     */
+    trailing?: number;
+};
+export declare function estimateLabelOverhang(labels: string[]): number;
+export type AutoLayoutOptions = {
+    direction?: LayoutDirection;
+    /** Gap between adjacent ranks (along the flow axis). */
+    rankGap?: number;
+    /** Gap between sibling nodes within a rank (the cross axis). */
+    nodeGap?: number;
+    /**
+     * Per-node order of output handles, keyed by node id — the ordered list of
+     * `HandleDef.id`s a node paints top-to-bottom (e.g. a Classify node's
+     * categories). Used to lay a node's downstream children out in the same order
+     * its exits read, so the child wired to the first exit sits above the one
+     * wired to the last (see `orderEdgesForDagre`). Nodes absent from the map (or
+     * edges with no `sourceHandle`) keep their order in `graph.edges`.
+     */
+    outputOrder?: Record<string, readonly string[]>;
+};
+/**
+ * Compute a tidy, hierarchical layout for a workflow graph and return a new
+ * `Graph` with every node's `position` recomputed (edges untouched). Pure and
+ * deterministic — same graph + dimensions in, same positions out — so it's
+ * safe to dispatch through the reducer and to snapshot in tests.
+ *
+ * `dimensions` maps node id → measured size; missing entries fall back to the
+ * node-card defaults. Disconnected nodes are placed by dagre in the first rank
+ * (never overlapping, thanks to `nodesep`).
+ */
+export declare function autoLayout(graph: Graph, dimensions?: Record<string, NodeDimensions>, options?: AutoLayoutOptions): Graph;
+//# sourceMappingURL=autoLayout.d.ts.map

package/dist/components/Workflow/layout/autoLayout.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"autoLayout.d.ts","sourceRoot":"","sources":["../../../../src/components/Workflow/layout/autoLayout.ts"],"names":[],"mappings":"AAGA,OAAO,KAAK,EAAE,KAAK,EAAY,MAAM,mBAAmB,CAAC;AAEzD;;;GAGG;AACH,MAAM,MAAM,eAAe,GAAG,IAAI,GAAG,IAAI,CAAC;AAE1C,iEAAiE;AACjE,MAAM,MAAM,cAAc,GAAG;IAC3B,KAAK,EAAE,MAAM,CAAC;IACd,MAAM,EAAE,MAAM,CAAC;IACf;;;;;;;OAOG;IACH,QAAQ,CAAC,EAAE,MAAM,CAAC;CACnB,CAAC;AAYF,wBAAgB,qBAAqB,CAAC,MAAM,EAAE,MAAM,EAAE,GAAG,MAAM,CAG9D;AAED,MAAM,MAAM,iBAAiB,GAAG;IAC9B,SAAS,CAAC,EAAE,eAAe,CAAC;IAC5B,wDAAwD;IACxD,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,gEAAgE;IAChE,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB;;;;;;;OAOG;IACH,WAAW,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,SAAS,MAAM,EAAE,CAAC,CAAC;CACjD,CAAC;AA0EF;;;;;;;;;GASG;AACH,wBAAgB,UAAU,CACxB,KAAK,EAAE,KAAK,EACZ,UAAU,GAAE,MAAM,CAAC,MAAM,EAAE,cAAc,CAAM,EAC/C,OAAO,GAAE,iBAAsB,GAC9B,KAAK,CAuDP"}

package/dist/components/Workflow/layout/autoLayout.js

@@ -0,0 +1,149 @@
+"use client";
+'use strict';
+
+var dagre = require('@dagrejs/dagre');
+var NodeShell_styles = require('../canvas/NodeShell/NodeShell.styles.js');
+
+/**
+ * Roughly how wide (px) the longest of a node's exit labels renders, so the
+ * layout can reserve trailing room for it. The label is absolutely positioned
+ * and not in the layout pass, so we approximate from text length rather than
+ * measure: a per-glyph width plus the label's inset from the node edge. Korean
+ * glyphs are near full-width, so we size for the wider case to stay safe.
+ */
+const LABEL_GLYPH_PX = 8;
+const LABEL_INSET_PX = 18;
+function estimateLabelOverhang(labels) {
+    const longest = labels.reduce((max, label) => Math.max(max, label.length), 0);
+    return longest === 0 ? 0 : LABEL_INSET_PX + longest * LABEL_GLYPH_PX;
+}
+/**
+ * Order `edges` for insertion into dagre so a fan-out node's children come out
+ * in exit order — first exit on top, last on the bottom.
+ *
+ * dagre derives a rank's initial vertical order from a DFS that pushes each
+ * node's successors in *edge-insertion order*, and the first-pushed sibling
+ * lands at the BOTTOM (largest cross-axis coordinate). Left to the raw
+ * `graph.edges` order — which is just whenever the author happened to wire each
+ * exit — that yields criss-crossed edges: the first exit's child gets sent to
+ * the bottom and the last exit's to the top.
+ *
+ * So for each source we know the exit order of, we reorder ITS edges in REVERSE
+ * exit order to cancel dagre's reversal. Every other edge — a source with no
+ * known exit order, or fewer than two edges — keeps its exact slot in
+ * `graph.edges`, so the documented fallback path doesn't perturb the layout.
+ * Stable: ties (e.g. two edges off one exit) preserve input order.
+ */
+function orderEdgesForDagre(edges, outputOrder) {
+    // Collect, per source we can sort, that source's edges in REVERSE exit order.
+    const sortedBySource = new Map();
+    for (const edge of edges) {
+        if (!outputOrder[edge.source])
+            continue;
+        const group = sortedBySource.get(edge.source);
+        if (group)
+            group.push(edge);
+        else
+            sortedBySource.set(edge.source, [edge]);
+    }
+    for (const [source, group] of sortedBySource) {
+        const order = outputOrder[source];
+        if (group.length < 2) {
+            sortedBySource.delete(source);
+            continue;
+        }
+        const exitIndex = (handle) => {
+            // An undefined handle denotes the first output (matches the
+            // `resolveHandle` convention in connectionRules), so it ranks as exit 0.
+            const i = order.indexOf(handle ?? order[0]);
+            return i === -1 ? Number.MAX_SAFE_INTEGER : i;
+        };
+        // Stable sort keeps ties (e.g. two edges off one exit) in input order.
+        group.sort((a, b) => exitIndex(b.sourceHandle) - exitIndex(a.sourceHandle));
+    }
+    // Nothing to reorder — hand back the original array untouched.
+    if (sortedBySource.size === 0)
+        return edges;
+    // Replay `graph.edges` in place, drawing each sortable source's edges from
+    // its reordered queue so only those slots change and all others stay put.
+    const cursor = new Map();
+    return edges.map((edge) => {
+        const group = sortedBySource.get(edge.source);
+        if (!group)
+            return edge;
+        const i = cursor.get(edge.source) ?? 0;
+        cursor.set(edge.source, i + 1);
+        return group[i];
+    });
+}
+/**
+ * Footprint assumed for a node we have no measured size for — e.g. one added
+ * but not yet rendered. Width tracks the fixed node-card width (`CARD_WIDTH`);
+ * height is a typical two-row card. Callers should pass real measured sizes
+ * when available so ranks pack tightly.
+ */
+const FALLBACK_WIDTH = parseInt(NodeShell_styles.CARD_WIDTH, 10);
+const FALLBACK_HEIGHT = 76;
+const DEFAULT_RANK_GAP = 80;
+const DEFAULT_NODE_GAP = 40;
+/**
+ * Compute a tidy, hierarchical layout for a workflow graph and return a new
+ * `Graph` with every node's `position` recomputed (edges untouched). Pure and
+ * deterministic — same graph + dimensions in, same positions out — so it's
+ * safe to dispatch through the reducer and to snapshot in tests.
+ *
+ * `dimensions` maps node id → measured size; missing entries fall back to the
+ * node-card defaults. Disconnected nodes are placed by dagre in the first rank
+ * (never overlapping, thanks to `nodesep`).
+ */
+function autoLayout(graph, dimensions = {}, options = {}) {
+    const { direction = 'LR', rankGap = DEFAULT_RANK_GAP, nodeGap = DEFAULT_NODE_GAP, outputOrder = {}, } = options;
+    // Footprint dagre lays out with: the real card height, and a width padded by
+    // any trailing exit-label overhang so the next rank clears it. We keep the
+    // node left-aligned within that padded box (see the offset below) so the
+    // reserved space lands on the trailing edge, where the labels actually are.
+    const footprintOf = (id) => {
+        const d = dimensions[id];
+        return {
+            width: (d?.width ?? FALLBACK_WIDTH) + (d?.trailing ?? 0),
+            height: d?.height ?? FALLBACK_HEIGHT,
+        };
+    };
+    const g = new dagre.graphlib.Graph();
+    g.setGraph({ rankdir: direction, ranksep: rankGap, nodesep: nodeGap });
+    // dagre requires an edge-label factory even when we attach no labels.
+    g.setDefaultEdgeLabel(() => ({}));
+    for (const node of graph.nodes) {
+        g.setNode(node.id, footprintOf(node.id));
+    }
+    for (const edge of orderEdgesForDagre(graph.edges, outputOrder)) {
+        // Guard against edges that reference a pruned node so dagre doesn't
+        // implicitly create a zero-size node for the dangling endpoint.
+        if (g.hasNode(edge.source) && g.hasNode(edge.target)) {
+            g.setEdge(edge.source, edge.target);
+        }
+    }
+    dagre.layout(g);
+    return {
+        ...graph,
+        nodes: graph.nodes.map((node) => {
+            const laidOut = g.node(node.id);
+            if (!laidOut)
+                return node;
+            const { width, height } = footprintOf(node.id);
+            // dagre reports the node CENTER; React Flow positions are top-left. The
+            // footprint width includes the trailing label pad, so subtracting half of
+            // it puts the card's real left edge at the box's left — leaving the pad on
+            // the trailing side, under the overflowing exit labels.
+            const position = {
+                x: laidOut.x - width / 2,
+                y: laidOut.y - height / 2,
+            };
+            return { ...node, position };
+        }),
+    };
+}
+
+exports.autoLayout = autoLayout;
+exports.estimateLabelOverhang = estimateLabelOverhang;
+//# sourceMappingURL=autoLayout.js.map

package/dist/components/Workflow/layout/autoLayout.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"autoLayout.js","sources":["../../../../src/components/Workflow/layout/autoLayout.ts"],"sourcesContent":[null],"names":["CARD_WIDTH","graphlib","layout"],"mappings":";;;;;;AA0BA;;;;;;AAMG;AACH,MAAM,cAAc,GAAG,CAAC;AACxB,MAAM,cAAc,GAAG,EAAE;AAEnB,SAAU,qBAAqB,CAAC,MAAgB,EAAA;IACpD,MAAM,OAAO,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,KAAK,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;AAC7E,IAAA,OAAO,OAAO,KAAK,CAAC,GAAG,CAAC,GAAG,cAAc,GAAG,OAAO,GAAG,cAAc;AACtE;AAmBA;;;;;;;;;;;;;;;;AAgBG;AACH,SAAS,kBAAkB,CACzB,KAAqB,EACrB,WAA8C,EAAA;;AAG9C,IAAA,MAAM,cAAc,GAAG,IAAI,GAAG,EAA0B;AACxD,IAAA,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE;AACxB,QAAA,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,MAAM,CAAC;YAAE;QAC/B,MAAM,KAAK,GAAG,cAAc,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC;AAC7C,QAAA,IAAI,KAAK;AAAE,YAAA,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC;;YACtB,cAAc,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,CAAC;IAC9C;IACA,KAAK,MAAM,CAAC,MAAM,EAAE,KAAK,CAAC,IAAI,cAAc,EAAE;AAC5C,QAAA,MAAM,KAAK,GAAG,WAAW,CAAC,MAAM,CAAC;AACjC,QAAA,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE;AACpB,YAAA,cAAc,CAAC,MAAM,CAAC,MAAM,CAAC;YAC7B;QACF;AACA,QAAA,MAAM,SAAS,GAAG,CAAC,MAA0B,KAAY;;;AAGvD,YAAA,MAAM,CAAC,GAAG,KAAK,CAAC,OAAO,CAAC,MAAM,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC;AAC3C,YAAA,OAAO,CAAC,KAAK,EAAE,GAAG,MAAM,CAAC,gBAAgB,GAAG,CAAC;AAC/C,QAAA,CAAC;;QAED,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,SAAS,CAAC,CAAC,CAAC,YAAY,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC;IAC7E;;AAGA,IAAA,IAAI,cAAc,CAAC,IAAI,KAAK,CAAC;AAAE,QAAA,OAAO,KAAK;;;AAI3C,IAAA,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB;AACxC,IAAA,OAAO,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,KAAI;QACxB,MAAM,KAAK,GAAG,cAAc,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC;AAC7C,QAAA,IAAI,CAAC,KAAK;AAAE,YAAA,OAAO,IAAI;AACvB,QAAA,MAAM,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC;QACtC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC;AAC9B,QAAA,OAAO,KAAK,CAAC,CAAC,CAAC;AACjB,IAAA,CAAC,CAAC;AACJ;AAEA;;;;;AAKG;AACH,MAAM,cAAc,GAAG,QAAQ,CAACA,2BAAU,EAAE,EAAE,CAAC;AAC/C,MAAM,eAAe,GAAG,EAAE;AAE1B,MAAM,gBAAgB,GAAG,EAAE;AAC3B,MAAM,gBAAgB,GAAG,EAAE;AAE3B;;;;;;;;;AASG;AACG,SAAU,UAAU,CACxB,KAAY,EACZ,UAAA,GAA6C,EAAE,EAC/C,OAAA,GAA6B,EAAE,EAAA;AAE/B,IAAA,MAAM,EACJ,SAAS,GAAG,IAAI,EAChB,OAAO,GAAG,gBAAgB,EAC1B,OAAO,GAAG,gBAAgB,EAC1B,WAAW,GAAG,EAAE,GACjB,GAAG,OAAO;;;;;AAMX,IAAA,MAAM,WAAW,GAAG,CAAC,EAAU,KAAoB;AACjD,QAAA,MAAM,CAAC,GAAG,UAAU,CAAC,EAAE,CAAC;QACxB,OAAO;AACL,YAAA,KAAK,EAAE,CAAC,CAAC,EAAE,KAAK,IAAI,cAAc,KAAK,CAAC,EAAE,QAAQ,IAAI,CAAC,CAAC;AACxD,YAAA,MAAM,EAAE,CAAC,EAAE,MAAM,IAAI,eAAe;SACrC;AACH,IAAA,CAAC;AAED,IAAA,MAAM,CAAC,GAAG,IAAIC,cAAQ,CAAC,KAAK,EAAE;AAC9B,IAAA,CAAC,CAAC,QAAQ,CAAC,EAAE,OAAO,EAAE,SAAS,EAAE,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,CAAC;;IAEtE,CAAC,CAAC,mBAAmB,CAAC,OAAO,EAAE,CAAC,CAAC;AAEjC,IAAA,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE;AAC9B,QAAA,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,EAAE,WAAW,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAC1C;AACA,IAAA,KAAK,MAAM,IAAI,IAAI,kBAAkB,CAAC,KAAK,CAAC,KAAK,EAAE,WAAW,CAAC,EAAE;;;AAG/D,QAAA,IAAI,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE;YACpD,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC;QACrC;IACF;IAEAC,YAAM,CAAC,CAAC,CAAC;IAET,OAAO;AACL,QAAA,GAAG,KAAK;QACR,KAAK,EAAE,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,KAAI;YAC9B,MAAM,OAAO,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;AAC/B,YAAA,IAAI,CAAC,OAAO;AAAE,gBAAA,OAAO,IAAI;AACzB,YAAA,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,GAAG,WAAW,CAAC,IAAI,CAAC,EAAE,CAAC;;;;;AAK9C,YAAA,MAAM,QAAQ,GAAa;AACzB,gBAAA,CAAC,EAAE,OAAO,CAAC,CAAC,GAAG,KAAK,GAAG,CAAC;AACxB,gBAAA,CAAC,EAAE,OAAO,CAAC,CAAC,GAAG,MAAM,GAAG,CAAC;aAC1B;AACD,YAAA,OAAO,EAAE,GAAG,IAAI,EAAE,QAAQ,EAAE;AAC9B,QAAA,CAAC,CAAC;KACH;AACH;;;;;"}

package/dist/components/Workflow/layout/autoLayout.mjs

@@ -0,0 +1,146 @@
+"use client";
+import { graphlib, layout } from '@dagrejs/dagre';
+import { CARD_WIDTH } from '../canvas/NodeShell/NodeShell.styles.mjs';
+
+/**
+ * Roughly how wide (px) the longest of a node's exit labels renders, so the
+ * layout can reserve trailing room for it. The label is absolutely positioned
+ * and not in the layout pass, so we approximate from text length rather than
+ * measure: a per-glyph width plus the label's inset from the node edge. Korean
+ * glyphs are near full-width, so we size for the wider case to stay safe.
+ */
+const LABEL_GLYPH_PX = 8;
+const LABEL_INSET_PX = 18;
+function estimateLabelOverhang(labels) {
+    const longest = labels.reduce((max, label) => Math.max(max, label.length), 0);
+    return longest === 0 ? 0 : LABEL_INSET_PX + longest * LABEL_GLYPH_PX;
+}
+/**
+ * Order `edges` for insertion into dagre so a fan-out node's children come out
+ * in exit order — first exit on top, last on the bottom.
+ *
+ * dagre derives a rank's initial vertical order from a DFS that pushes each
+ * node's successors in *edge-insertion order*, and the first-pushed sibling
+ * lands at the BOTTOM (largest cross-axis coordinate). Left to the raw
+ * `graph.edges` order — which is just whenever the author happened to wire each
+ * exit — that yields criss-crossed edges: the first exit's child gets sent to
+ * the bottom and the last exit's to the top.
+ *
+ * So for each source we know the exit order of, we reorder ITS edges in REVERSE
+ * exit order to cancel dagre's reversal. Every other edge — a source with no
+ * known exit order, or fewer than two edges — keeps its exact slot in
+ * `graph.edges`, so the documented fallback path doesn't perturb the layout.
+ * Stable: ties (e.g. two edges off one exit) preserve input order.
+ */
+function orderEdgesForDagre(edges, outputOrder) {
+    // Collect, per source we can sort, that source's edges in REVERSE exit order.
+    const sortedBySource = new Map();
+    for (const edge of edges) {
+        if (!outputOrder[edge.source])
+            continue;
+        const group = sortedBySource.get(edge.source);
+        if (group)
+            group.push(edge);
+        else
+            sortedBySource.set(edge.source, [edge]);
+    }
+    for (const [source, group] of sortedBySource) {
+        const order = outputOrder[source];
+        if (group.length < 2) {
+            sortedBySource.delete(source);
+            continue;
+        }
+        const exitIndex = (handle) => {
+            // An undefined handle denotes the first output (matches the
+            // `resolveHandle` convention in connectionRules), so it ranks as exit 0.
+            const i = order.indexOf(handle ?? order[0]);
+            return i === -1 ? Number.MAX_SAFE_INTEGER : i;
+        };
+        // Stable sort keeps ties (e.g. two edges off one exit) in input order.
+        group.sort((a, b) => exitIndex(b.sourceHandle) - exitIndex(a.sourceHandle));
+    }
+    // Nothing to reorder — hand back the original array untouched.
+    if (sortedBySource.size === 0)
+        return edges;
+    // Replay `graph.edges` in place, drawing each sortable source's edges from
+    // its reordered queue so only those slots change and all others stay put.
+    const cursor = new Map();
+    return edges.map((edge) => {
+        const group = sortedBySource.get(edge.source);
+        if (!group)
+            return edge;
+        const i = cursor.get(edge.source) ?? 0;
+        cursor.set(edge.source, i + 1);
+        return group[i];
+    });
+}
+/**
+ * Footprint assumed for a node we have no measured size for — e.g. one added
+ * but not yet rendered. Width tracks the fixed node-card width (`CARD_WIDTH`);
+ * height is a typical two-row card. Callers should pass real measured sizes
+ * when available so ranks pack tightly.
+ */
+const FALLBACK_WIDTH = parseInt(CARD_WIDTH, 10);
+const FALLBACK_HEIGHT = 76;
+const DEFAULT_RANK_GAP = 80;
+const DEFAULT_NODE_GAP = 40;
+/**
+ * Compute a tidy, hierarchical layout for a workflow graph and return a new
+ * `Graph` with every node's `position` recomputed (edges untouched). Pure and
+ * deterministic — same graph + dimensions in, same positions out — so it's
+ * safe to dispatch through the reducer and to snapshot in tests.
+ *
+ * `dimensions` maps node id → measured size; missing entries fall back to the
+ * node-card defaults. Disconnected nodes are placed by dagre in the first rank
+ * (never overlapping, thanks to `nodesep`).
+ */
+function autoLayout(graph, dimensions = {}, options = {}) {
+    const { direction = 'LR', rankGap = DEFAULT_RANK_GAP, nodeGap = DEFAULT_NODE_GAP, outputOrder = {}, } = options;
+    // Footprint dagre lays out with: the real card height, and a width padded by
+    // any trailing exit-label overhang so the next rank clears it. We keep the
+    // node left-aligned within that padded box (see the offset below) so the
+    // reserved space lands on the trailing edge, where the labels actually are.
+    const footprintOf = (id) => {
+        const d = dimensions[id];
+        return {
+            width: (d?.width ?? FALLBACK_WIDTH) + (d?.trailing ?? 0),
+            height: d?.height ?? FALLBACK_HEIGHT,
+        };
+    };
+    const g = new graphlib.Graph();
+    g.setGraph({ rankdir: direction, ranksep: rankGap, nodesep: nodeGap });
+    // dagre requires an edge-label factory even when we attach no labels.
+    g.setDefaultEdgeLabel(() => ({}));
+    for (const node of graph.nodes) {
+        g.setNode(node.id, footprintOf(node.id));
+    }
+    for (const edge of orderEdgesForDagre(graph.edges, outputOrder)) {
+        // Guard against edges that reference a pruned node so dagre doesn't
+        // implicitly create a zero-size node for the dangling endpoint.
+        if (g.hasNode(edge.source) && g.hasNode(edge.target)) {
+            g.setEdge(edge.source, edge.target);
+        }
+    }
+    layout(g);
+    return {
+        ...graph,
+        nodes: graph.nodes.map((node) => {
+            const laidOut = g.node(node.id);
+            if (!laidOut)
+                return node;
+            const { width, height } = footprintOf(node.id);
+            // dagre reports the node CENTER; React Flow positions are top-left. The
+            // footprint width includes the trailing label pad, so subtracting half of
+            // it puts the card's real left edge at the box's left — leaving the pad on
+            // the trailing side, under the overflowing exit labels.
+            const position = {
+                x: laidOut.x - width / 2,
+                y: laidOut.y - height / 2,
+            };
+            return { ...node, position };
+        }),
+    };
+}
+
+export { autoLayout, estimateLabelOverhang };
+//# sourceMappingURL=autoLayout.mjs.map

package/dist/components/Workflow/layout/autoLayout.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"autoLayout.mjs","sources":["../../../../src/components/Workflow/layout/autoLayout.ts"],"sourcesContent":[null],"names":[],"mappings":";;;;AA0BA;;;;;;AAMG;AACH,MAAM,cAAc,GAAG,CAAC;AACxB,MAAM,cAAc,GAAG,EAAE;AAEnB,SAAU,qBAAqB,CAAC,MAAgB,EAAA;IACpD,MAAM,OAAO,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,KAAK,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;AAC7E,IAAA,OAAO,OAAO,KAAK,CAAC,GAAG,CAAC,GAAG,cAAc,GAAG,OAAO,GAAG,cAAc;AACtE;AAmBA;;;;;;;;;;;;;;;;AAgBG;AACH,SAAS,kBAAkB,CACzB,KAAqB,EACrB,WAA8C,EAAA;;AAG9C,IAAA,MAAM,cAAc,GAAG,IAAI,GAAG,EAA0B;AACxD,IAAA,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE;AACxB,QAAA,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,MAAM,CAAC;YAAE;QAC/B,MAAM,KAAK,GAAG,cAAc,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC;AAC7C,QAAA,IAAI,KAAK;AAAE,YAAA,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC;;YACtB,cAAc,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,CAAC;IAC9C;IACA,KAAK,MAAM,CAAC,MAAM,EAAE,KAAK,CAAC,IAAI,cAAc,EAAE;AAC5C,QAAA,MAAM,KAAK,GAAG,WAAW,CAAC,MAAM,CAAC;AACjC,QAAA,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE;AACpB,YAAA,cAAc,CAAC,MAAM,CAAC,MAAM,CAAC;YAC7B;QACF;AACA,QAAA,MAAM,SAAS,GAAG,CAAC,MAA0B,KAAY;;;AAGvD,YAAA,MAAM,CAAC,GAAG,KAAK,CAAC,OAAO,CAAC,MAAM,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC;AAC3C,YAAA,OAAO,CAAC,KAAK,EAAE,GAAG,MAAM,CAAC,gBAAgB,GAAG,CAAC;AAC/C,QAAA,CAAC;;QAED,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,SAAS,CAAC,CAAC,CAAC,YAAY,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC;IAC7E;;AAGA,IAAA,IAAI,cAAc,CAAC,IAAI,KAAK,CAAC;AAAE,QAAA,OAAO,KAAK;;;AAI3C,IAAA,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB;AACxC,IAAA,OAAO,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,KAAI;QACxB,MAAM,KAAK,GAAG,cAAc,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC;AAC7C,QAAA,IAAI,CAAC,KAAK;AAAE,YAAA,OAAO,IAAI;AACvB,QAAA,MAAM,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC;QACtC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC;AAC9B,QAAA,OAAO,KAAK,CAAC,CAAC,CAAC;AACjB,IAAA,CAAC,CAAC;AACJ;AAEA;;;;;AAKG;AACH,MAAM,cAAc,GAAG,QAAQ,CAAC,UAAU,EAAE,EAAE,CAAC;AAC/C,MAAM,eAAe,GAAG,EAAE;AAE1B,MAAM,gBAAgB,GAAG,EAAE;AAC3B,MAAM,gBAAgB,GAAG,EAAE;AAE3B;;;;;;;;;AASG;AACG,SAAU,UAAU,CACxB,KAAY,EACZ,UAAA,GAA6C,EAAE,EAC/C,OAAA,GAA6B,EAAE,EAAA;AAE/B,IAAA,MAAM,EACJ,SAAS,GAAG,IAAI,EAChB,OAAO,GAAG,gBAAgB,EAC1B,OAAO,GAAG,gBAAgB,EAC1B,WAAW,GAAG,EAAE,GACjB,GAAG,OAAO;;;;;AAMX,IAAA,MAAM,WAAW,GAAG,CAAC,EAAU,KAAoB;AACjD,QAAA,MAAM,CAAC,GAAG,UAAU,CAAC,EAAE,CAAC;QACxB,OAAO;AACL,YAAA,KAAK,EAAE,CAAC,CAAC,EAAE,KAAK,IAAI,cAAc,KAAK,CAAC,EAAE,QAAQ,IAAI,CAAC,CAAC;AACxD,YAAA,MAAM,EAAE,CAAC,EAAE,MAAM,IAAI,eAAe;SACrC;AACH,IAAA,CAAC;AAED,IAAA,MAAM,CAAC,GAAG,IAAI,QAAQ,CAAC,KAAK,EAAE;AAC9B,IAAA,CAAC,CAAC,QAAQ,CAAC,EAAE,OAAO,EAAE,SAAS,EAAE,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,CAAC;;IAEtE,CAAC,CAAC,mBAAmB,CAAC,OAAO,EAAE,CAAC,CAAC;AAEjC,IAAA,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE;AAC9B,QAAA,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,EAAE,WAAW,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAC1C;AACA,IAAA,KAAK,MAAM,IAAI,IAAI,kBAAkB,CAAC,KAAK,CAAC,KAAK,EAAE,WAAW,CAAC,EAAE;;;AAG/D,QAAA,IAAI,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE;YACpD,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC;QACrC;IACF;IAEA,MAAM,CAAC,CAAC,CAAC;IAET,OAAO;AACL,QAAA,GAAG,KAAK;QACR,KAAK,EAAE,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,KAAI;YAC9B,MAAM,OAAO,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;AAC/B,YAAA,IAAI,CAAC,OAAO;AAAE,gBAAA,OAAO,IAAI;AACzB,YAAA,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,GAAG,WAAW,CAAC,IAAI,CAAC,EAAE,CAAC;;;;;AAK9C,YAAA,MAAM,QAAQ,GAAa;AACzB,gBAAA,CAAC,EAAE,OAAO,CAAC,CAAC,GAAG,KAAK,GAAG,CAAC;AACxB,gBAAA,CAAC,EAAE,OAAO,CAAC,CAAC,GAAG,MAAM,GAAG,CAAC;aAC1B;AACD,YAAA,OAAO,EAAE,GAAG,IAAI,EAAE,QAAQ,EAAE;AAC9B,QAAA,CAAC,CAAC;KACH;AACH;;;;"}

package/dist/components/Workflow/stories/toyNodeTypes.d.ts

@@ -0,0 +1,40 @@
+import { type NodeTypeDef } from '../Workflow.types';
+export declare const toyNodeTypes: NodeTypeDef[];
+/** A small starter graph: two inputs feeding an Add, feeding a Print. */
+export declare const toyGraph: {
+    nodes: ({
+        id: string;
+        kind: string;
+        position: {
+            x: number;
+            y: number;
+        };
+        config: {
+            value: number;
+            label?: undefined;
+        };
+    } | {
+        id: string;
+        kind: string;
+        position: {
+            x: number;
+            y: number;
+        };
+        config: {
+            label: string;
+            value?: undefined;
+        };
+    })[];
+    edges: ({
+        id: string;
+        source: string;
+        target: string;
+        targetHandle: string;
+    } | {
+        id: string;
+        source: string;
+        target: string;
+        targetHandle?: undefined;
+    })[];
+};
+//# sourceMappingURL=toyNodeTypes.d.ts.map

package/dist/components/Workflow/stories/toyNodeTypes.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"toyNodeTypes.d.ts","sourceRoot":"","sources":["../../../../src/components/Workflow/stories/toyNodeTypes.tsx"],"names":[],"mappings":"AASA,OAAO,EAAkB,KAAK,WAAW,EAAE,MAAM,mBAAmB,CAAC;AAqGrE,eAAO,MAAM,YAAY,EAAE,WAAW,EAAqC,CAAC;AAE5E,yEAAyE;AACzE,eAAO,MAAM,QAAQ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;CAgCpB,CAAC"}

package/dist/components/Workflow/useWorkflowIssueMessage.d.ts

@@ -0,0 +1,15 @@
+import type { Issue } from './Workflow.types';
+/**
+ * Maps backend workflow validation issue codes to translated messages.
+ * Mirrors the connectors error-message hook precedent
+ * (`useConnectorErrorMessage`): the backend owns validation and returns raw
+ * English in `Issue.message` (kept as a fallback for tests / logs), while
+ * rendering surfaces resolve the localized copy here.
+ *
+ * Node kind names (Agent, Classify, etc.) are intentionally kept in English
+ * across the UI; issues that interpolate them pass the raw `def.label` string
+ * in `messageVars`, and Korean sentences read naturally with the
+ * mixed-language token (e.g. "Agent는 최소 1개 이상 필요합니다").
+ */
+export declare const useWorkflowIssueMessage: () => (issue: Issue) => string;
+//# sourceMappingURL=useWorkflowIssueMessage.d.ts.map

package/dist/components/Workflow/useWorkflowIssueMessage.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"useWorkflowIssueMessage.d.ts","sourceRoot":"","sources":["../../../src/components/Workflow/useWorkflowIssueMessage.ts"],"names":[],"mappings":"AAIA,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,kBAAkB,CAAC;AAG9C;;;;;;;;;;;GAWG;AACH,eAAO,MAAM,uBAAuB,gBAIxB,KAAK,KAAG,MAyBnB,CAAC"}

package/dist/components/Workflow/useWorkflowIssueMessage.js

@@ -0,0 +1,45 @@
+"use client";
+'use strict';
+
+var React = require('react');
+var WorkflowContext = require('./WorkflowContext/WorkflowContext.js');
+
+/**
+ * Maps backend workflow validation issue codes to translated messages.
+ * Mirrors the connectors error-message hook precedent
+ * (`useConnectorErrorMessage`): the backend owns validation and returns raw
+ * English in `Issue.message` (kept as a fallback for tests / logs), while
+ * rendering surfaces resolve the localized copy here.
+ *
+ * Node kind names (Agent, Classify, etc.) are intentionally kept in English
+ * across the UI; issues that interpolate them pass the raw `def.label` string
+ * in `messageVars`, and Korean sentences read naturally with the
+ * mixed-language token (e.g. "Agent는 최소 1개 이상 필요합니다").
+ */
+const useWorkflowIssueMessage = () => {
+    const translate = WorkflowContext.useWorkflowTranslate();
+    return React.useCallback((issue) => {
+        // Coerce all interpolation values to strings — `useTranslate`
+        // returns a React-element array when a numeric var is passed,
+        // which loses its string-ness through the `as string` cast and
+        // breaks downstream code that joins or trims the message.
+        const vars = issue.messageVars
+            ? Object.fromEntries(Object.entries(issue.messageVars).map(([k, v]) => [k, String(v)]))
+            : undefined;
+        const t = (key) => translate(key, vars);
+        // Backend (`INVALID_GRAPH`) issues arrive with the validator's own
+        // snake_case `code` (e.g. `agent_model_required`), localized under a
+        // deterministic `workflow_be_<code>` key. Normalize defensively so a
+        // dotted/uppercased variant still resolves. `useTranslate` returns the
+        // key itself when no entry exists, so a missing key falls back to the
+        // raw English `issue.message`.
+        const beKey = `workflow_be_${issue.code
+            .toLowerCase()
+            .replace(/[.-]/g, '_')}`;
+        const beMessage = t(beKey);
+        return beMessage === beKey ? issue.message : beMessage;
+    }, [translate]);
+};
+
+exports.useWorkflowIssueMessage = useWorkflowIssueMessage;
+//# sourceMappingURL=useWorkflowIssueMessage.js.map

package/dist/components/Workflow/useWorkflowIssueMessage.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"useWorkflowIssueMessage.js","sources":["../../../src/components/Workflow/useWorkflowIssueMessage.ts"],"sourcesContent":[null],"names":["useWorkflowTranslate","useCallback"],"mappings":";;;;;;AAOA;;;;;;;;;;;AAWG;AACI,MAAM,uBAAuB,GAAG,MAAK;AAC1C,IAAA,MAAM,SAAS,GAAGA,oCAAoB,EAAE;AAExC,IAAA,OAAOC,iBAAW,CAChB,CAAC,KAAY,KAAY;;;;;AAKvB,QAAA,MAAM,IAAI,GAAG,KAAK,CAAC;AACjB,cAAE,MAAM,CAAC,WAAW,CAChB,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;cAEnE,SAAS;AACb,QAAA,MAAM,CAAC,GAAG,CAAC,GAAW,KAAK,SAAS,CAAC,GAAG,EAAE,IAAI,CAAW;;;;;;;AAOzD,QAAA,MAAM,KAAK,GAAG,CAAA,YAAA,EAAe,KAAK,CAAC;AAChC,aAAA,WAAW;AACX,aAAA,OAAO,CAAC,OAAO,EAAE,GAAG,CAAC,EAAE;AAC1B,QAAA,MAAM,SAAS,GAAG,CAAC,CAAC,KAAK,CAAC;AAC1B,QAAA,OAAO,SAAS,KAAK,KAAK,GAAG,KAAK,CAAC,OAAO,GAAG,SAAS;AACxD,IAAA,CAAC,EACD,CAAC,SAAS,CAAC,CACZ;AACH;;;;"}