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

package/dist/components/Workflow/createNode.js

@@ -0,0 +1,66 @@
+"use client";
+'use strict';
+
+/**
+ * Unique id for edges and other internal graph elements that aren't referenced
+ * by name in user content. Node IDs use `nextNodeId` for memorable
+ * `{kind}_{N}` ids instead.
+ */
+function genId(prefix) {
+    if (typeof crypto !== 'undefined' && 'randomUUID' in crypto) {
+        return `${prefix}_${crypto.randomUUID()}`;
+    }
+    return `${prefix}_${Date.now().toString(36)}_${Math.random()
+        .toString(36)
+        .slice(2, 8)}`;
+}
+/**
+ * Next sequential id for a node of the given kind, given the current node
+ * list. Returns ids like `agent_1`, `classify_2`, `guardrail_1`, etc., so
+ * authors can type them verbatim into `{{...}}` references.
+ *
+ * Start is a singleton — always `start`. Existing seeded graphs use hand-named
+ * ids like `agent_main` / `guard_out`; those don't match the `kind_<digits>`
+ * pattern and are ignored when computing the next number, so a fresh `agent`
+ * dropped next to `agent_main` becomes `agent_1`, not `agent_2`.
+ */
+function nextNodeId(kind, nodes) {
+    if (kind === 'start')
+        return 'start';
+    const re = new RegExp(`^${kind}_(\\d+)$`);
+    let max = 0;
+    for (const n of nodes) {
+        const m = re.exec(n.id);
+        if (m) {
+            const v = Number.parseInt(m[1], 10);
+            if (Number.isFinite(v) && v > max)
+                max = v;
+        }
+    }
+    return `${kind}_${max + 1}`;
+}
+/** Offset applied to a duplicated node so it doesn't sit exactly on top. */
+const DUPLICATE_OFFSET = 40;
+/**
+ * A copy of `node` with a fresh sequential id, a deep-cloned config, and a
+ * slight offset. Pass the current node list so the duplicate's id continues
+ * the per-kind counter. If two duplicates race within the same React batch
+ * the second collides and the reducer's existing `addNode` dedupe drops it
+ * — one missing duplicate, no corrupt state.
+ */
+function cloneNode(node, nodes) {
+    return {
+        id: nextNodeId(node.kind, nodes),
+        kind: node.kind,
+        position: {
+            x: node.position.x + DUPLICATE_OFFSET,
+            y: node.position.y + DUPLICATE_OFFSET,
+        },
+        config: structuredClone(node.config),
+    };
+}
+
+exports.cloneNode = cloneNode;
+exports.genId = genId;
+exports.nextNodeId = nextNodeId;
+//# sourceMappingURL=createNode.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"createNode.js","sources":["../../../src/components/Workflow/createNode.ts"],"sourcesContent":[null],"names":[],"mappings":";;;AAEA;;;;AAIG;AACG,SAAU,KAAK,CAAC,MAAc,EAAA;IAClC,IAAI,OAAO,MAAM,KAAK,WAAW,IAAI,YAAY,IAAI,MAAM,EAAE;QAC3D,OAAO,CAAA,EAAG,MAAM,CAAA,CAAA,EAAI,MAAM,CAAC,UAAU,EAAE,EAAE;IAC3C;AACA,IAAA,OAAO,GAAG,MAAM,CAAA,CAAA,EAAI,IAAI,CAAC,GAAG,EAAE,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAA,CAAA,EAAI,IAAI,CAAC,MAAM;SACvD,QAAQ,CAAC,EAAE;AACX,SAAA,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE;AAClB;AAEA;;;;;;;;;AASG;AACG,SAAU,UAAU,CACxB,IAAY,EACZ,KAA+B,EAAA;IAE/B,IAAI,IAAI,KAAK,OAAO;AAAE,QAAA,OAAO,OAAO;IACpC,MAAM,EAAE,GAAG,IAAI,MAAM,CAAC,CAAA,CAAA,EAAI,IAAI,CAAA,QAAA,CAAU,CAAC;IACzC,IAAI,GAAG,GAAG,CAAC;AACX,IAAA,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE;QACrB,MAAM,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC;QACvB,IAAI,CAAC,EAAE;AACL,YAAA,MAAM,CAAC,GAAG,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC;YACnC,IAAI,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,GAAG;gBAAE,GAAG,GAAG,CAAC;QAC5C;IACF;AACA,IAAA,OAAO,GAAG,IAAI,CAAA,CAAA,EAAI,GAAG,GAAG,CAAC,EAAE;AAC7B;AAEA;AACA,MAAM,gBAAgB,GAAG,EAAE;AAE3B;;;;;;AAMG;AACG,SAAU,SAAS,CACvB,IAAe,EACf,KAA+B,EAAA;IAE/B,OAAO;QACL,EAAE,EAAE,UAAU,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC;QAChC,IAAI,EAAE,IAAI,CAAC,IAAI;AACf,QAAA,QAAQ,EAAE;AACR,YAAA,CAAC,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC,GAAG,gBAAgB;AACrC,YAAA,CAAC,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC,GAAG,gBAAgB;AACtC,SAAA;AACD,QAAA,MAAM,EAAE,eAAe,CAAC,IAAI,CAAC,MAAM,CAAC;KACrC;AACH;;;;;;"}

package/dist/components/Workflow/createNode.mjs

@@ -0,0 +1,62 @@
+"use client";
+/**
+ * Unique id for edges and other internal graph elements that aren't referenced
+ * by name in user content. Node IDs use `nextNodeId` for memorable
+ * `{kind}_{N}` ids instead.
+ */
+function genId(prefix) {
+    if (typeof crypto !== 'undefined' && 'randomUUID' in crypto) {
+        return `${prefix}_${crypto.randomUUID()}`;
+    }
+    return `${prefix}_${Date.now().toString(36)}_${Math.random()
+        .toString(36)
+        .slice(2, 8)}`;
+}
+/**
+ * Next sequential id for a node of the given kind, given the current node
+ * list. Returns ids like `agent_1`, `classify_2`, `guardrail_1`, etc., so
+ * authors can type them verbatim into `{{...}}` references.
+ *
+ * Start is a singleton — always `start`. Existing seeded graphs use hand-named
+ * ids like `agent_main` / `guard_out`; those don't match the `kind_<digits>`
+ * pattern and are ignored when computing the next number, so a fresh `agent`
+ * dropped next to `agent_main` becomes `agent_1`, not `agent_2`.
+ */
+function nextNodeId(kind, nodes) {
+    if (kind === 'start')
+        return 'start';
+    const re = new RegExp(`^${kind}_(\\d+)$`);
+    let max = 0;
+    for (const n of nodes) {
+        const m = re.exec(n.id);
+        if (m) {
+            const v = Number.parseInt(m[1], 10);
+            if (Number.isFinite(v) && v > max)
+                max = v;
+        }
+    }
+    return `${kind}_${max + 1}`;
+}
+/** Offset applied to a duplicated node so it doesn't sit exactly on top. */
+const DUPLICATE_OFFSET = 40;
+/**
+ * A copy of `node` with a fresh sequential id, a deep-cloned config, and a
+ * slight offset. Pass the current node list so the duplicate's id continues
+ * the per-kind counter. If two duplicates race within the same React batch
+ * the second collides and the reducer's existing `addNode` dedupe drops it
+ * — one missing duplicate, no corrupt state.
+ */
+function cloneNode(node, nodes) {
+    return {
+        id: nextNodeId(node.kind, nodes),
+        kind: node.kind,
+        position: {
+            x: node.position.x + DUPLICATE_OFFSET,
+            y: node.position.y + DUPLICATE_OFFSET,
+        },
+        config: structuredClone(node.config),
+    };
+}
+
+export { cloneNode, genId, nextNodeId };
+//# sourceMappingURL=createNode.mjs.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"createNode.mjs","sources":["../../../src/components/Workflow/createNode.ts"],"sourcesContent":[null],"names":[],"mappings":";AAEA;;;;AAIG;AACG,SAAU,KAAK,CAAC,MAAc,EAAA;IAClC,IAAI,OAAO,MAAM,KAAK,WAAW,IAAI,YAAY,IAAI,MAAM,EAAE;QAC3D,OAAO,CAAA,EAAG,MAAM,CAAA,CAAA,EAAI,MAAM,CAAC,UAAU,EAAE,EAAE;IAC3C;AACA,IAAA,OAAO,GAAG,MAAM,CAAA,CAAA,EAAI,IAAI,CAAC,GAAG,EAAE,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAA,CAAA,EAAI,IAAI,CAAC,MAAM;SACvD,QAAQ,CAAC,EAAE;AACX,SAAA,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE;AAClB;AAEA;;;;;;;;;AASG;AACG,SAAU,UAAU,CACxB,IAAY,EACZ,KAA+B,EAAA;IAE/B,IAAI,IAAI,KAAK,OAAO;AAAE,QAAA,OAAO,OAAO;IACpC,MAAM,EAAE,GAAG,IAAI,MAAM,CAAC,CAAA,CAAA,EAAI,IAAI,CAAA,QAAA,CAAU,CAAC;IACzC,IAAI,GAAG,GAAG,CAAC;AACX,IAAA,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE;QACrB,MAAM,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC;QACvB,IAAI,CAAC,EAAE;AACL,YAAA,MAAM,CAAC,GAAG,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC;YACnC,IAAI,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,GAAG;gBAAE,GAAG,GAAG,CAAC;QAC5C;IACF;AACA,IAAA,OAAO,GAAG,IAAI,CAAA,CAAA,EAAI,GAAG,GAAG,CAAC,EAAE;AAC7B;AAEA;AACA,MAAM,gBAAgB,GAAG,EAAE;AAE3B;;;;;;AAMG;AACG,SAAU,SAAS,CACvB,IAAe,EACf,KAA+B,EAAA;IAE/B,OAAO;QACL,EAAE,EAAE,UAAU,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC;QAChC,IAAI,EAAE,IAAI,CAAC,IAAI;AACf,QAAA,QAAQ,EAAE;AACR,YAAA,CAAC,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC,GAAG,gBAAgB;AACrC,YAAA,CAAC,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC,GAAG,gBAAgB;AACtC,SAAA;AACD,QAAA,MAAM,EAAE,eAAe,CAAC,IAAI,CAAC,MAAM,CAAC;KACrC;AACH;;;;"}

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

@@ -0,0 +1,23 @@
+import { type GraphAction } from './graphReducer';
+import type { Graph } from './Workflow.types';
+/** Max retained undo steps. Older steps are dropped once exceeded. */
+export declare const MAX_HISTORY = 50;
+export type HistoryState = {
+    past: Graph[];
+    present: Graph;
+    future: Graph[];
+    /**
+     * Coalescing key of the action that produced `present`. A new action with
+     * the same key merges into the current step instead of pushing a new one,
+     * so a burst of edits to one node stays a single undo unit.
+     */
+    lastKey: string | null;
+};
+export type HistoryAction = GraphAction | {
+    type: 'undo';
+} | {
+    type: 'redo';
+};
+export declare const initHistory: (graph: Graph) => HistoryState;
+export declare function historyReducer(state: HistoryState, action: HistoryAction): HistoryState;
+//# sourceMappingURL=graphHistory.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"graphHistory.d.ts","sourceRoot":"","sources":["../../../src/components/Workflow/graphHistory.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,KAAK,WAAW,EAAgB,MAAM,gBAAgB,CAAC;AAChE,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,kBAAkB,CAAC;AAE9C,sEAAsE;AACtE,eAAO,MAAM,WAAW,KAAK,CAAC;AAE9B,MAAM,MAAM,YAAY,GAAG;IACzB,IAAI,EAAE,KAAK,EAAE,CAAC;IACd,OAAO,EAAE,KAAK,CAAC;IACf,MAAM,EAAE,KAAK,EAAE,CAAC;IAChB;;;;OAIG;IACH,OAAO,EAAE,MAAM,GAAG,IAAI,CAAC;CACxB,CAAC;AAEF,MAAM,MAAM,aAAa,GAAG,WAAW,GAAG;IAAE,IAAI,EAAE,MAAM,CAAA;CAAE,GAAG;IAAE,IAAI,EAAE,MAAM,CAAA;CAAE,CAAC;AAE9E,eAAO,MAAM,WAAW,GAAI,OAAO,KAAK,KAAG,YAKzC,CAAC;AAmBH,wBAAgB,cAAc,CAC5B,KAAK,EAAE,YAAY,EACnB,MAAM,EAAE,aAAa,GACpB,YAAY,CA2Cd"}

package/dist/components/Workflow/graphHistory.js

@@ -0,0 +1,73 @@
+"use client";
+'use strict';
+
+var graphReducer = require('./graphReducer.js');
+
+const initHistory = (graph) => ({
+    past: [],
+    present: graph,
+    future: [],
+    lastKey: null,
+});
+/**
+ * Key used to collapse a run of edits into one undo step. `updateNodeConfig`
+ * / `updateNodePosition` targeting the same node coalesce (typing a prompt or
+ * dragging a node is one undo); structural actions return `null` (never
+ * coalesce).
+ */
+const coalesceKey = (action) => {
+    switch (action.type) {
+        case 'updateNodeConfig':
+        case 'updateNodePosition':
+        case 'updateEdge':
+            return `${action.type}:${action.id}`;
+        default:
+            return null;
+    }
+};
+function historyReducer(state, action) {
+    if (action.type === 'undo') {
+        if (state.past.length === 0)
+            return state;
+        return {
+            past: state.past.slice(0, -1),
+            present: state.past[state.past.length - 1],
+            future: [state.present, ...state.future],
+            lastKey: null,
+        };
+    }
+    if (action.type === 'redo') {
+        if (state.future.length === 0)
+            return state;
+        const [next, ...rest] = state.future;
+        return {
+            past: [...state.past, state.present],
+            present: next,
+            future: rest,
+            lastKey: null,
+        };
+    }
+    const present = graphReducer.graphReducer(state.present, action);
+    // Pure no-op actions (dedupe guards, unknown ids) must not create history.
+    if (present === state.present)
+        return state;
+    // `replace` is an external resync (draft load, server push), not a user
+    // edit — it establishes a fresh baseline, so history is cleared.
+    if (action.type === 'replace') {
+        return { past: [], present, future: [], lastKey: null };
+    }
+    const key = coalesceKey(action);
+    if (key !== null && key === state.lastKey) {
+        return { ...state, present };
+    }
+    return {
+        past: [...state.past, state.present].slice(-50),
+        present,
+        future: [],
+        lastKey: key,
+    };
+}
+
+exports.historyReducer = historyReducer;
+exports.initHistory = initHistory;
+//# sourceMappingURL=graphHistory.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"graphHistory.js","sources":["../../../src/components/Workflow/graphHistory.ts"],"sourcesContent":[null],"names":["graphReducer"],"mappings":";;;;;MAoBa,WAAW,GAAG,CAAC,KAAY,MAAoB;AAC1D,IAAA,IAAI,EAAE,EAAE;AACR,IAAA,OAAO,EAAE,KAAK;AACd,IAAA,MAAM,EAAE,EAAE;AACV,IAAA,OAAO,EAAE,IAAI;AACd,CAAA;AAED;;;;;AAKG;AACH,MAAM,WAAW,GAAG,CAAC,MAAmB,KAAmB;AACzD,IAAA,QAAQ,MAAM,CAAC,IAAI;AACjB,QAAA,KAAK,kBAAkB;AACvB,QAAA,KAAK,oBAAoB;AACzB,QAAA,KAAK,YAAY;YACf,OAAO,CAAA,EAAG,MAAM,CAAC,IAAI,IAAI,MAAM,CAAC,EAAE,CAAA,CAAE;AACtC,QAAA;AACE,YAAA,OAAO,IAAI;;AAEjB,CAAC;AAEK,SAAU,cAAc,CAC5B,KAAmB,EACnB,MAAqB,EAAA;AAErB,IAAA,IAAI,MAAM,CAAC,IAAI,KAAK,MAAM,EAAE;AAC1B,QAAA,IAAI,KAAK,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC;AAAE,YAAA,OAAO,KAAK;QACzC,OAAO;YACL,IAAI,EAAE,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC;AAC7B,YAAA,OAAO,EAAE,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;YAC1C,MAAM,EAAE,CAAC,KAAK,CAAC,OAAO,EAAE,GAAG,KAAK,CAAC,MAAM,CAAC;AACxC,YAAA,OAAO,EAAE,IAAI;SACd;IACH;AAEA,IAAA,IAAI,MAAM,CAAC,IAAI,KAAK,MAAM,EAAE;AAC1B,QAAA,IAAI,KAAK,CAAC,MAAM,CAAC,MAAM,KAAK,CAAC;AAAE,YAAA,OAAO,KAAK;QAC3C,MAAM,CAAC,IAAI,EAAE,GAAG,IAAI,CAAC,GAAG,KAAK,CAAC,MAAM;QACpC,OAAO;YACL,IAAI,EAAE,CAAC,GAAG,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC,OAAO,CAAC;AACpC,YAAA,OAAO,EAAE,IAAI;AACb,YAAA,MAAM,EAAE,IAAI;AACZ,YAAA,OAAO,EAAE,IAAI;SACd;IACH;IAEA,MAAM,OAAO,GAAGA,yBAAY,CAAC,KAAK,CAAC,OAAO,EAAE,MAAM,CAAC;;AAEnD,IAAA,IAAI,OAAO,KAAK,KAAK,CAAC,OAAO;AAAE,QAAA,OAAO,KAAK;;;AAI3C,IAAA,IAAI,MAAM,CAAC,IAAI,KAAK,SAAS,EAAE;AAC7B,QAAA,OAAO,EAAE,IAAI,EAAE,EAAE,EAAE,OAAO,EAAE,MAAM,EAAE,EAAE,EAAE,OAAO,EAAE,IAAI,EAAE;IACzD;AAEA,IAAA,MAAM,GAAG,GAAG,WAAW,CAAC,MAAM,CAAC;IAC/B,IAAI,GAAG,KAAK,IAAI,IAAI,GAAG,KAAK,KAAK,CAAC,OAAO,EAAE;AACzC,QAAA,OAAO,EAAE,GAAG,KAAK,EAAE,OAAO,EAAE;IAC9B;IAEA,OAAO;AACL,QAAA,IAAI,EAAE,CAAC,GAAG,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC,OAAO,CAAC,CAAC,KAAK,CAAC,GAAY,CAAC;QACxD,OAAO;AACP,QAAA,MAAM,EAAE,EAAE;AACV,QAAA,OAAO,EAAE,GAAG;KACb;AACH;;;;;"}

package/dist/components/Workflow/graphHistory.mjs

@@ -0,0 +1,70 @@
+"use client";
+import { graphReducer } from './graphReducer.mjs';
+
+const initHistory = (graph) => ({
+    past: [],
+    present: graph,
+    future: [],
+    lastKey: null,
+});
+/**
+ * Key used to collapse a run of edits into one undo step. `updateNodeConfig`
+ * / `updateNodePosition` targeting the same node coalesce (typing a prompt or
+ * dragging a node is one undo); structural actions return `null` (never
+ * coalesce).
+ */
+const coalesceKey = (action) => {
+    switch (action.type) {
+        case 'updateNodeConfig':
+        case 'updateNodePosition':
+        case 'updateEdge':
+            return `${action.type}:${action.id}`;
+        default:
+            return null;
+    }
+};
+function historyReducer(state, action) {
+    if (action.type === 'undo') {
+        if (state.past.length === 0)
+            return state;
+        return {
+            past: state.past.slice(0, -1),
+            present: state.past[state.past.length - 1],
+            future: [state.present, ...state.future],
+            lastKey: null,
+        };
+    }
+    if (action.type === 'redo') {
+        if (state.future.length === 0)
+            return state;
+        const [next, ...rest] = state.future;
+        return {
+            past: [...state.past, state.present],
+            present: next,
+            future: rest,
+            lastKey: null,
+        };
+    }
+    const present = graphReducer(state.present, action);
+    // Pure no-op actions (dedupe guards, unknown ids) must not create history.
+    if (present === state.present)
+        return state;
+    // `replace` is an external resync (draft load, server push), not a user
+    // edit — it establishes a fresh baseline, so history is cleared.
+    if (action.type === 'replace') {
+        return { past: [], present, future: [], lastKey: null };
+    }
+    const key = coalesceKey(action);
+    if (key !== null && key === state.lastKey) {
+        return { ...state, present };
+    }
+    return {
+        past: [...state.past, state.present].slice(-50),
+        present,
+        future: [],
+        lastKey: key,
+    };
+}
+
+export { historyReducer, initHistory };
+//# sourceMappingURL=graphHistory.mjs.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"graphHistory.mjs","sources":["../../../src/components/Workflow/graphHistory.ts"],"sourcesContent":[null],"names":[],"mappings":";;;MAoBa,WAAW,GAAG,CAAC,KAAY,MAAoB;AAC1D,IAAA,IAAI,EAAE,EAAE;AACR,IAAA,OAAO,EAAE,KAAK;AACd,IAAA,MAAM,EAAE,EAAE;AACV,IAAA,OAAO,EAAE,IAAI;AACd,CAAA;AAED;;;;;AAKG;AACH,MAAM,WAAW,GAAG,CAAC,MAAmB,KAAmB;AACzD,IAAA,QAAQ,MAAM,CAAC,IAAI;AACjB,QAAA,KAAK,kBAAkB;AACvB,QAAA,KAAK,oBAAoB;AACzB,QAAA,KAAK,YAAY;YACf,OAAO,CAAA,EAAG,MAAM,CAAC,IAAI,IAAI,MAAM,CAAC,EAAE,CAAA,CAAE;AACtC,QAAA;AACE,YAAA,OAAO,IAAI;;AAEjB,CAAC;AAEK,SAAU,cAAc,CAC5B,KAAmB,EACnB,MAAqB,EAAA;AAErB,IAAA,IAAI,MAAM,CAAC,IAAI,KAAK,MAAM,EAAE;AAC1B,QAAA,IAAI,KAAK,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC;AAAE,YAAA,OAAO,KAAK;QACzC,OAAO;YACL,IAAI,EAAE,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC;AAC7B,YAAA,OAAO,EAAE,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;YAC1C,MAAM,EAAE,CAAC,KAAK,CAAC,OAAO,EAAE,GAAG,KAAK,CAAC,MAAM,CAAC;AACxC,YAAA,OAAO,EAAE,IAAI;SACd;IACH;AAEA,IAAA,IAAI,MAAM,CAAC,IAAI,KAAK,MAAM,EAAE;AAC1B,QAAA,IAAI,KAAK,CAAC,MAAM,CAAC,MAAM,KAAK,CAAC;AAAE,YAAA,OAAO,KAAK;QAC3C,MAAM,CAAC,IAAI,EAAE,GAAG,IAAI,CAAC,GAAG,KAAK,CAAC,MAAM;QACpC,OAAO;YACL,IAAI,EAAE,CAAC,GAAG,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC,OAAO,CAAC;AACpC,YAAA,OAAO,EAAE,IAAI;AACb,YAAA,MAAM,EAAE,IAAI;AACZ,YAAA,OAAO,EAAE,IAAI;SACd;IACH;IAEA,MAAM,OAAO,GAAG,YAAY,CAAC,KAAK,CAAC,OAAO,EAAE,MAAM,CAAC;;AAEnD,IAAA,IAAI,OAAO,KAAK,KAAK,CAAC,OAAO;AAAE,QAAA,OAAO,KAAK;;;AAI3C,IAAA,IAAI,MAAM,CAAC,IAAI,KAAK,SAAS,EAAE;AAC7B,QAAA,OAAO,EAAE,IAAI,EAAE,EAAE,EAAE,OAAO,EAAE,MAAM,EAAE,EAAE,EAAE,OAAO,EAAE,IAAI,EAAE;IACzD;AAEA,IAAA,MAAM,GAAG,GAAG,WAAW,CAAC,MAAM,CAAC;IAC/B,IAAI,GAAG,KAAK,IAAI,IAAI,GAAG,KAAK,KAAK,CAAC,OAAO,EAAE;AACzC,QAAA,OAAO,EAAE,GAAG,KAAK,EAAE,OAAO,EAAE;IAC9B;IAEA,OAAO;AACL,QAAA,IAAI,EAAE,CAAC,GAAG,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC,OAAO,CAAC,CAAC,KAAK,CAAC,GAAY,CAAC;QACxD,OAAO;AACP,QAAA,MAAM,EAAE,EAAE;AACV,QAAA,OAAO,EAAE,GAAG;KACb;AACH;;;;"}

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

@@ -0,0 +1,13 @@
+import type { Graph } from './Workflow.types';
+/**
+ * Optional ancestor-provided hook to observe an uncontrolled <Workflow>'s
+ * graph without taking over its state (which `graph` + `onGraphChange` would).
+ *
+ * Used by the Storybook JSON-preview decorator so every story can render the
+ * serialized graph payload. No provider exists in production, so <Workflow>
+ * treats it as a no-op.
+ */
+export type WorkflowGraphObserver = (graph: Graph) => void;
+export declare const WorkflowGraphObserverContext: import("react").Context<WorkflowGraphObserver>;
+export declare const useWorkflowGraphObserver: () => WorkflowGraphObserver;
+//# sourceMappingURL=graphObserver.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"graphObserver.d.ts","sourceRoot":"","sources":["../../../src/components/Workflow/graphObserver.ts"],"names":[],"mappings":"AAIA,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,kBAAkB,CAAC;AAE9C;;;;;;;GAOG;AACH,MAAM,MAAM,qBAAqB,GAAG,CAAC,KAAK,EAAE,KAAK,KAAK,IAAI,CAAC;AAE3D,eAAO,MAAM,4BAA4B,gDACU,CAAC;AAEpD,eAAO,MAAM,wBAAwB,6BACK,CAAC"}

package/dist/components/Workflow/graphObserver.js

@@ -0,0 +1,11 @@
+"use client";
+'use strict';
+
+var React = require('react');
+
+const WorkflowGraphObserverContext = React.createContext(null);
+const useWorkflowGraphObserver = () => React.useContext(WorkflowGraphObserverContext);
+
+exports.WorkflowGraphObserverContext = WorkflowGraphObserverContext;
+exports.useWorkflowGraphObserver = useWorkflowGraphObserver;
+//# sourceMappingURL=graphObserver.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"graphObserver.js","sources":["../../../src/components/Workflow/graphObserver.ts"],"sourcesContent":[null],"names":["createContext","useContext"],"mappings":";;;;;MAgBa,4BAA4B,GACvCA,mBAAa,CAA+B,IAAI;AAE3C,MAAM,wBAAwB,GAAG,MACtCC,gBAAU,CAAC,4BAA4B;;;;;"}

package/dist/components/Workflow/graphObserver.mjs

@@ -0,0 +1,8 @@
+"use client";
+import { createContext, useContext } from 'react';
+
+const WorkflowGraphObserverContext = createContext(null);
+const useWorkflowGraphObserver = () => useContext(WorkflowGraphObserverContext);
+
+export { WorkflowGraphObserverContext, useWorkflowGraphObserver };
+//# sourceMappingURL=graphObserver.mjs.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"graphObserver.mjs","sources":["../../../src/components/Workflow/graphObserver.ts"],"sourcesContent":[null],"names":[],"mappings":";;;MAgBa,4BAA4B,GACvC,aAAa,CAA+B,IAAI;AAE3C,MAAM,wBAAwB,GAAG,MACtC,UAAU,CAAC,4BAA4B;;;;"}

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

@@ -0,0 +1,75 @@
+import type { Graph, GraphEdge, GraphNode, Position } from './Workflow.types';
+export type GraphAction = {
+    type: 'addNode';
+    node: GraphNode;
+} | {
+    /**
+     * Adds a node and, when `autoConnectFrom` is supplied, an edge from that
+     * source node into the new node — both in a single reducer transition so
+     * one undo step reverts the node and the auto-edge together.
+     */
+    type: 'addNodeWithEdge';
+    node: GraphNode;
+    autoConnectFrom: {
+        edge: GraphEdge;
+    } | null;
+} | {
+    type: 'updateNodePosition';
+    id: string;
+    position: Position;
+} | {
+    /**
+     * Repositions many nodes in one transition — the one-click auto-arrange.
+     * Positions are precomputed by `autoLayout`; a node absent from the map
+     * keeps its current position. Unlike `replace` this is an in-place user
+     * edit, so it pushes a SINGLE undo step (and leaves the rest of the undo
+     * stack intact) rather than resetting history.
+     */
+    type: 'arrangeNodes';
+    positions: Record<string, Position>;
+} | {
+    type: 'updateNodeConfig';
+    id: string;
+    config: unknown;
+    /**
+     * Renames an output handle id on the node's outbound edges in the SAME
+     * transition. Some handle ids derive from mutable config (Classify:
+     * `cat_<name>`); moving the edge atomically keeps React Flow from pruning
+     * it as an orphan when the id changes.
+     */
+    remapEdgeHandle?: {
+        from: string;
+        to: string;
+    };
+} | {
+    type: 'deleteNode';
+    id: string;
+} | {
+    type: 'addEdge';
+    edge: GraphEdge;
+} | {
+    type: 'reconnectEdge';
+    id: string;
+    source: string;
+    target: string;
+    sourceHandle?: string;
+    targetHandle?: string;
+} | {
+    type: 'deleteEdge';
+    id: string;
+} | {
+    /**
+     * Merges a partial patch into an edge by id (e.g. its `label`). Endpoint
+     * moves go through `reconnectEdge`; this is for non-structural fields so
+     * label edits stay undoable through `graphHistory`.
+     */
+    type: 'updateEdge';
+    id: string;
+    patch: Partial<Omit<GraphEdge, 'id'>>;
+} | {
+    type: 'replace';
+    graph: Graph;
+};
+export declare function graphReducer(state: Graph, action: GraphAction): Graph;
+export declare const emptyGraph: Graph;
+//# sourceMappingURL=graphReducer.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"graphReducer.d.ts","sourceRoot":"","sources":["../../../src/components/Workflow/graphReducer.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,KAAK,EAAE,SAAS,EAAE,SAAS,EAAE,QAAQ,EAAE,MAAM,kBAAkB,CAAC;AAE9E,MAAM,MAAM,WAAW,GACnB;IAAE,IAAI,EAAE,SAAS,CAAC;IAAC,IAAI,EAAE,SAAS,CAAA;CAAE,GACpC;IACE;;;;OAIG;IACH,IAAI,EAAE,iBAAiB,CAAC;IACxB,IAAI,EAAE,SAAS,CAAC;IAChB,eAAe,EAAE;QAAE,IAAI,EAAE,SAAS,CAAA;KAAE,GAAG,IAAI,CAAC;CAC7C,GACD;IAAE,IAAI,EAAE,oBAAoB,CAAC;IAAC,EAAE,EAAE,MAAM,CAAC;IAAC,QAAQ,EAAE,QAAQ,CAAA;CAAE,GAC9D;IACE;;;;;;OAMG;IACH,IAAI,EAAE,cAAc,CAAC;IACrB,SAAS,EAAE,MAAM,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;CACrC,GACD;IACE,IAAI,EAAE,kBAAkB,CAAC;IACzB,EAAE,EAAE,MAAM,CAAC;IACX,MAAM,EAAE,OAAO,CAAC;IAChB;;;;;OAKG;IACH,eAAe,CAAC,EAAE;QAAE,IAAI,EAAE,MAAM,CAAC;QAAC,EAAE,EAAE,MAAM,CAAA;KAAE,CAAC;CAChD,GACD;IAAE,IAAI,EAAE,YAAY,CAAC;IAAC,EAAE,EAAE,MAAM,CAAA;CAAE,GAClC;IAAE,IAAI,EAAE,SAAS,CAAC;IAAC,IAAI,EAAE,SAAS,CAAA;CAAE,GACpC;IACE,IAAI,EAAE,eAAe,CAAC;IACtB,EAAE,EAAE,MAAM,CAAC;IACX,MAAM,EAAE,MAAM,CAAC;IACf,MAAM,EAAE,MAAM,CAAC;IACf,YAAY,CAAC,EAAE,MAAM,CAAC;IACtB,YAAY,CAAC,EAAE,MAAM,CAAC;CACvB,GACD;IAAE,IAAI,EAAE,YAAY,CAAC;IAAC,EAAE,EAAE,MAAM,CAAA;CAAE,GAClC;IACE;;;;OAIG;IACH,IAAI,EAAE,YAAY,CAAC;IACnB,EAAE,EAAE,MAAM,CAAC;IACX,KAAK,EAAE,OAAO,CAAC,IAAI,CAAC,SAAS,EAAE,IAAI,CAAC,CAAC,CAAC;CACvC,GACD;IAAE,IAAI,EAAE,SAAS,CAAC;IAAC,KAAK,EAAE,KAAK,CAAA;CAAE,CAAC;AAetC,wBAAgB,YAAY,CAAC,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,WAAW,GAAG,KAAK,CAuHrE;AAED,eAAO,MAAM,UAAU,EAAE,KAAgC,CAAC"}

package/dist/components/Workflow/graphReducer.js

@@ -0,0 +1,122 @@
+"use client";
+'use strict';
+
+/** 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: [] };
+
+exports.emptyGraph = emptyGraph;
+exports.graphReducer = graphReducer;
+//# sourceMappingURL=graphReducer.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"graphReducer.js","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;;;;;"}