@decaf-ts/integrations 0.8.0 → 0.9.0

package/lib/esm/graph/engine/planning/GraphExecutionPlanner.js

@@ -1,34 +1,45 @@
-import { graphDefinitionOf } from "@decaf-ts/ui-decorators/graph";
+/**
+ * @module integrations/graph/planning/GraphExecutionPlanner
+ * @summary Topological planner for resolved graph workflows (DECAF-50 §4.9).
+ * @description Turns a {@link GraphResolvedWorkflow} — the output of the
+ * nine-stage §4.8 validation gate — into a {@link GraphExecutionPlan} with
+ * topological layers. The planner accepts ONLY resolved workflows: it never
+ * calls `graphDefinitionOf()` and never accepts `GraphWorkflowDefinition`
+ * objects or inline raw `GraphNodeDefinition` objects (P3 gate). Resolution
+ * against the trusted backend catalogue happens upstream, in
+ * {@link GraphWorkflowDocumentValidator}.
+ */
 import { GRAPH_WORKFLOW_BOUNDARY } from "./../constants.js";
 import { GraphCycleError } from "./../errors/GraphCycleError.js";
 import { GraphTopologyError } from "./../errors/GraphTopologyError.js";
-import { GraphRelationResolver } from "./GraphRelationResolver.js";
+import { isGraphResolvedWorkflow } from "./../validation/GraphWorkflowDocumentValidator.js";
 /**
- * Planner that turns a {@link GraphWorkflowDefinition} into a
+ * Planner that turns a {@link GraphResolvedWorkflow} into a
  * {@link GraphExecutionPlan} with topological layers.
  */
 export class GraphExecutionPlanner {
-    constructor(resolver) {
-        this.resolver = resolver ?? new GraphRelationResolver();
-    }
     /**
-     * Plans a workflow for execution.
+     * Plans a resolved workflow for execution.
      *
-     * @param workflow - The workflow definition to plan.
+     * @param workflow - The catalogue-resolved workflow (output of the
+     *   nine-stage validation gate). Raw `GraphWorkflowDefinition` objects and
+     *   inline `GraphNodeDefinition` objects are rejected.
      * @returns The execution plan with nodes, edges, layers, and maps.
-     * @throws {GraphTopologyError} when node IDs are not unique.
+     * @throws {GraphTopologyError} when the input is not a resolved workflow.
      * @throws {GraphCycleError} when the workflow contains an unsupported cycle.
      */
     plan(workflow) {
-        this.validateUniqueNodeIds(workflow);
-        const nodes = this.resolveNodes(workflow);
-        const edges = this.resolver.resolve(workflow);
+        if (!isGraphResolvedWorkflow(workflow)) {
+            throw new GraphTopologyError("GraphExecutionPlanner.plan accepts only a GraphResolvedWorkflow produced by the nine-stage validation gate; raw workflow definitions and inline node definitions are rejected", { received: describeInput(workflow) });
+        }
+        const nodes = this.buildPlanNodes(workflow);
+        const edges = this.buildPlanEdges(workflow);
         const incomingByNode = this.buildIncomingMap(edges);
         const outgoingByNode = this.buildOutgoingMap(edges);
         const layers = this.topologicalLayers(nodes, edges);
         return {
-            workflow,
-            workflowId: workflow.name,
+            resolved: workflow,
+            workflowId: workflow.document.id || workflow.document.name,
             nodes,
             edges,
             layers,
@@ -37,88 +48,47 @@ export class GraphExecutionPlanner {
         };
     }
     /**
-     * Validates that all workflow node IDs are unique.
+     * Builds catalogue-resolved plan nodes from the resolved workflow.
+     * Each plan node carries the canonical instance, the effective manifest,
+     * and the trusted executor — never a raw node definition.
      */
-    validateUniqueNodeIds(workflow) {
-        const seen = new Set();
-        for (const node of workflow.nodes ?? []) {
-            if (seen.has(node.id)) {
-                throw new GraphTopologyError(`Duplicate node id '${node.id}' in workflow '${workflow.name}'`, { nodeId: node.id, workflowId: workflow.name });
-            }
-            seen.add(node.id);
-        }
+    buildPlanNodes(workflow) {
+        return workflow.nodes.map((node) => ({
+            id: node.instance.id,
+            kind: node.manifest.kind,
+            instance: node.instance,
+            manifest: node.manifest,
+            executor: node.executor,
+            inputPorts: node.manifest.inputs.map((port) => port.id),
+            outputPorts: node.manifest.outputs.map((port) => port.id),
+            connectionPorts: (node.manifest.connections ?? []).map((port) => port.id),
+            metadata: node.instance.metadata,
+        }));
     }
     /**
-     * Resolves workflow node metadata into plan nodes with full definitions.
+     * Builds plan edges from the flattened resolved edges (already validated by
+     * §4.8 stage 5/6).
      */
-    resolveNodes(workflow) {
-        const result = [];
-        for (const nodeMeta of workflow.nodes ?? []) {
-            const definition = this.resolveDefinition(nodeMeta);
-            const inputPorts = (definition.ports ?? [])
-                .filter((p) => p.direction === "input")
-                .map((p) => p.name);
-            const outputPorts = (definition.ports ?? [])
-                .filter((p) => p.direction === "output")
-                .map((p) => p.name);
-            result.push({
-                id: nodeMeta.id,
-                kind: nodeMeta.kind ?? definition.kind ?? nodeMeta.id,
-                label: nodeMeta.label,
-                source: nodeMeta,
-                definition,
-                inputPorts,
-                outputPorts,
-                metadata: nodeMeta.metadata,
-            });
-        }
-        return result;
+    buildPlanEdges(workflow) {
+        return workflow.edges.map((edge) => ({
+            id: edge.id,
+            type: edge.type,
+            sourceNodeId: edge.sourceNodeId,
+            sourcePort: edge.sourcePort,
+            targetNodeId: edge.targetNodeId,
+            targetPort: edge.targetPort,
+            ...(edge.label !== undefined ? { label: edge.label } : {}),
+            metadata: edge.metadata,
+        }));
     }
     /**
-     * Attempts to resolve the full graph node definition from metadata.
-     *
-     * Accepts either a decorated Model class/instance (resolved via
-     * `graphDefinitionOf`) or a plain `GraphNodeDefinition`-shaped object
-     * (useful for serialized workflows that inline node definitions).
-     */
-    resolveDefinition(nodeMeta) {
-        if (nodeMeta.node) {
-            if (this.isRawDefinition(nodeMeta.node)) {
-                return nodeMeta.node;
-            }
-            try {
-                return graphDefinitionOf(nodeMeta.node);
-            }
-            catch {
-                // fall through to stub
-            }
-        }
-        // Return a minimal stub definition so planning can proceed
-        return {
-            name: nodeMeta.id,
-            tag: nodeMeta.id,
-            kind: nodeMeta.kind ?? nodeMeta.id,
-            labels: [],
-            ports: [],
-        };
-    }
-    /**
-     * Returns `true` when a value looks like a raw {@link GraphNodeDefinition}
-     * (a plain object with a `ports` array and a `name` string).
-     */
-    isRawDefinition(value) {
-        return (typeof value === "object" &&
-            value !== null &&
-            !Array.isArray(value) &&
-            typeof value.name === "string" &&
-            Array.isArray(value.ports));
-    }
-    /**
-     * Builds a map of node id -> incoming edges.
+     * Builds a map of node id -> incoming edges (boundary excluded from keys).
      */
     buildIncomingMap(edges) {
         const map = new Map();
         for (const edge of edges) {
+            if (edge.targetNodeId === GRAPH_WORKFLOW_BOUNDARY)
+                continue;
             const list = map.get(edge.targetNodeId) ?? [];
             list.push(edge);
             map.set(edge.targetNodeId, list);
@@ -126,11 +96,14 @@ export class GraphExecutionPlanner {
         return map;
     }
     /**
-     * Builds a map of node id -> outgoing edges.
+     * Builds a map of node id -> outgoing edges (boundary targets included as
+     * edge values so workflow outputs stay routable).
      */
     buildOutgoingMap(edges) {
         const map = new Map();
         for (const edge of edges) {
+            if (edge.sourceNodeId === GRAPH_WORKFLOW_BOUNDARY)
+                continue;
             const list = map.get(edge.sourceNodeId) ?? [];
             list.push(edge);
             map.set(edge.sourceNodeId, list);
@@ -141,6 +114,9 @@ export class GraphExecutionPlanner {
      * Produces topological layers using Kahn's algorithm.
      *
      * Workflow boundary edges do not count as executable-node dependencies.
+     * Both data and structural (connection) edges count as dependencies
+     * (DECAF-32 acyclicity preserved; loop constructs are excepted because
+     * their bodies are separate nested documents).
      */
     topologicalLayers(nodes, edges) {
         const executableNodes = nodes.filter((n) => n.id !== GRAPH_WORKFLOW_BOUNDARY);
@@ -183,10 +159,25 @@ export class GraphExecutionPlanner {
                 .map((n) => n.id);
             throw new GraphCycleError({
                 unplannedNodes: unplanned,
-                workflowId: nodes[0]?.definition?.name,
+                workflowId: executableNodes[0]?.manifest.kind,
             });
         }
         return layers;
     }
 }
+/**
+ * Produces a safe, JSON-friendly description of a rejected planner input for
+ * error details (never serialises executors or class instances).
+ */
+function describeInput(value) {
+    if (!value || typeof value !== "object") {
+        return { reason: "input is not an object" };
+    }
+    const record = value;
+    return {
+        reason: "input is not a GraphResolvedWorkflow",
+        looksLikeWorkflowDefinition: "nodes" in record && "relations" in record && !("nodeById" in record),
+        hasResolvedNodes: Array.isArray(record["nodes"]),
+    };
+}
 //# sourceMappingURL=GraphExecutionPlanner.js.map

package/lib/esm/graph/engine/planning/GraphExecutionPlanner.js.map

@@ -1 +1 @@
-{"version":3,"file":"GraphExecutionPlanner.js","sourceRoot":"","sources":["../../../../../src/graph/engine/planning/GraphExecutionPlanner.ts"],"names":[],"mappings":"AASA,OAAO,EAAE,iBAAiB,EAAE,MAAM,+BAA+B,CAAC;AAElE,OAAO,EAAE,uBAAuB,EAAE,0BAAqB;AACvD,OAAO,EAAE,eAAe,EAAE,uCAAkC;AAC5D,OAAO,EAAE,kBAAkB,EAAE,0CAAqC;AAKlE,OAAO,EAAE,qBAAqB,EAAE,mCAAgC;AAEhE;;;GAGG;AACH,MAAM,OAAO,qBAAqB;IAGhC,YAAY,QAAgC;QAC1C,IAAI,CAAC,QAAQ,GAAG,QAAQ,IAAI,IAAI,qBAAqB,EAAE,CAAC;IAC1D,CAAC;IAED;;;;;;;OAOG;IACH,IAAI,CAAC,QAAiC;QACpC,IAAI,CAAC,qBAAqB,CAAC,QAAQ,CAAC,CAAC;QAErC,MAAM,KAAK,GAAG,IAAI,CAAC,YAAY,CAAC,QAAQ,CAAC,CAAC;QAC1C,MAAM,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;QAE9C,MAAM,cAAc,GAAG,IAAI,CAAC,gBAAgB,CAAC,KAAK,CAAC,CAAC;QACpD,MAAM,cAAc,GAAG,IAAI,CAAC,gBAAgB,CAAC,KAAK,CAAC,CAAC;QAEpD,MAAM,MAAM,GAAG,IAAI,CAAC,iBAAiB,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;QAEpD,OAAO;YACL,QAAQ;YACR,UAAU,EAAE,QAAQ,CAAC,IAAI;YACzB,KAAK;YACL,KAAK;YACL,MAAM;YACN,cAAc;YACd,cAAc;SACf,CAAC;IACJ,CAAC;IAED;;OAEG;IACK,qBAAqB,CAAC,QAAiC;QAC7D,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;QAC/B,KAAK,MAAM,IAAI,IAAI,QAAQ,CAAC,KAAK,IAAI,EAAE,EAAE,CAAC;YACxC,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;gBACtB,MAAM,IAAI,kBAAkB,CAC1B,sBAAsB,IAAI,CAAC,EAAE,kBAAkB,QAAQ,CAAC,IAAI,GAAG,EAC/D,EAAE,MAAM,EAAE,IAAI,CAAC,EAAE,EAAE,UAAU,EAAE,QAAQ,CAAC,IAAI,EAAE,CAC/C,CAAC;YACJ,CAAC;YACD,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACpB,CAAC;IACH,CAAC;IAED;;OAEG;IACK,YAAY,CAClB,QAAiC;QAEjC,MAAM,MAAM,GAA6B,EAAE,CAAC;QAC5C,KAAK,MAAM,QAAQ,IAAI,QAAQ,CAAC,KAAK,IAAI,EAAE,EAAE,CAAC;YAC5C,MAAM,UAAU,GAAG,IAAI,CAAC,iBAAiB,CAAC,QAAQ,CAAC,CAAC;YACpD,MAAM,UAAU,GAAG,CAAC,UAAU,CAAC,KAAK,IAAI,EAAE,CAAC;iBACxC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,KAAK,OAAO,CAAC;iBACtC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;YACtB,MAAM,WAAW,GAAG,CAAC,UAAU,CAAC,KAAK,IAAI,EAAE,CAAC;iBACzC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,KAAK,QAAQ,CAAC;iBACvC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;YACtB,MAAM,CAAC,IAAI,CAAC;gBACV,EAAE,EAAE,QAAQ,CAAC,EAAE;gBACf,IAAI,EAAE,QAAQ,CAAC,IAAI,IAAI,UAAU,CAAC,IAAI,IAAI,QAAQ,CAAC,EAAE;gBACrD,KAAK,EAAE,QAAQ,CAAC,KAAK;gBACrB,MAAM,EAAE,QAAQ;gBAChB,UAAU;gBACV,UAAU;gBACV,WAAW;gBACX,QAAQ,EAAE,QAAQ,CAAC,QAAQ;aAC5B,CAAC,CAAC;QACL,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;;;;;OAMG;IACK,iBAAiB,CAAC,QAIzB;QACC,IAAI,QAAQ,CAAC,IAAI,EAAE,CAAC;YAClB,IAAI,IAAI,CAAC,eAAe,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC;gBACxC,OAAO,QAAQ,CAAC,IAA2B,CAAC;YAC9C,CAAC;YACD,IAAI,CAAC;gBACH,OAAO,iBAAiB,CAAC,QAAQ,CAAC,IAAW,CAAC,CAAC;YACjD,CAAC;YAAC,MAAM,CAAC;gBACP,uBAAuB;YACzB,CAAC;QACH,CAAC;QACD,2DAA2D;QAC3D,OAAO;YACL,IAAI,EAAE,QAAQ,CAAC,EAAE;YACjB,GAAG,EAAE,QAAQ,CAAC,EAAE;YAChB,IAAI,EAAE,QAAQ,CAAC,IAAI,IAAI,QAAQ,CAAC,EAAE;YAClC,MAAM,EAAE,EAAE;YACV,KAAK,EAAE,EAAE;SACV,CAAC;IACJ,CAAC;IAED;;;OAGG;IACK,eAAe,CAAC,KAAc;QACpC,OAAO,CACL,OAAO,KAAK,KAAK,QAAQ;YACzB,KAAK,KAAK,IAAI;YACd,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC;YACrB,OAAQ,KAA4B,CAAC,IAAI,KAAK,QAAQ;YACtD,KAAK,CAAC,OAAO,CAAE,KAA6B,CAAC,KAAK,CAAC,CACpD,CAAC;IACJ,CAAC;IAED;;OAEG;IACK,gBAAgB,CACtB,KAA+B;QAE/B,MAAM,GAAG,GAAG,IAAI,GAAG,EAAoC,CAAC;QACxD,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,MAAM,IAAI,GAAG,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,YAAY,CAAC,IAAI,EAAE,CAAC;YAC9C,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAChB,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,YAAY,EAAE,IAAI,CAAC,CAAC;QACnC,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IAED;;OAEG;IACK,gBAAgB,CACtB,KAA+B;QAE/B,MAAM,GAAG,GAAG,IAAI,GAAG,EAAoC,CAAC;QACxD,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,MAAM,IAAI,GAAG,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,YAAY,CAAC,IAAI,EAAE,CAAC;YAC9C,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAChB,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,YAAY,EAAE,IAAI,CAAC,CAAC;QACnC,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IAED;;;;OAIG;IACK,iBAAiB,CACvB,KAA+B,EAC/B,KAA+B;QAE/B,MAAM,eAAe,GAAG,KAAK,CAAC,MAAM,CAClC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,uBAAuB,CACxC,CAAC;QACF,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,eAAe,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAE1D,gEAAgE;QAChE,MAAM,SAAS,GAAG,KAAK,CAAC,MAAM,CAC5B,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,YAAY,CAAC,IAAI,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,YAAY,CAAC,CAClE,CAAC;QAEF,oBAAoB;QACpB,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAC;QAC3C,KAAK,MAAM,IAAI,IAAI,eAAe;YAAE,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;QAC7D,KAAK,MAAM,IAAI,IAAI,SAAS,EAAE,CAAC;YAC7B,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,YAAY,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAC9E,CAAC;QAED,MAAM,MAAM,GAA8B,EAAE,CAAC;QAC7C,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAClC,IAAI,KAAK,GAAG,eAAe,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;QAC3E,IAAI,UAAU,GAAG,CAAC,CAAC;QAEnB,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,MAAM,KAAK,GAA4B,EAAE,KAAK,EAAE,UAAU,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC;YAC7E,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACnB,MAAM,SAAS,GAA6B,EAAE,CAAC;YAC/C,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;gBACzB,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBACrB,MAAM,QAAQ,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,YAAY,KAAK,IAAI,CAAC,EAAE,CAAC,CAAC;gBACrE,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;oBAC5B,MAAM,GAAG,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;oBACvD,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,YAAY,EAAE,GAAG,CAAC,CAAC;oBACrC,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,YAAY,CAAC,EAAE,CAAC;wBACjD,MAAM,IAAI,GAAG,eAAe,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,IAAI,CAAC,YAAY,CAAC,CAAC;wBACrE,IAAI,IAAI;4BAAE,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;oBACjC,CAAC;gBACH,CAAC;YACH,CAAC;YACD,KAAK,GAAG,SAAS,CAAC;QACpB,CAAC;QAED,IAAI,OAAO,CAAC,IAAI,KAAK,eAAe,CAAC,MAAM,EAAE,CAAC;YAC5C,MAAM,SAAS,GAAG,eAAe;iBAC9B,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;iBACjC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YACpB,MAAM,IAAI,eAAe,CAAC;gBACxB,cAAc,EAAE,SAAS;gBACzB,UAAU,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,UAAU,EAAE,IAAI;aACvC,CAAC,CAAC;QACL,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;CACF"}
+{"version":3,"file":"GraphExecutionPlanner.js","sourceRoot":"","sources":["../../../../../src/graph/engine/planning/GraphExecutionPlanner.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AACH,OAAO,EAAE,uBAAuB,EAAE,0BAAqB;AACvD,OAAO,EAAE,eAAe,EAAE,uCAAkC;AAC5D,OAAO,EAAE,kBAAkB,EAAE,0CAAqC;AAClE,OAAO,EAAE,uBAAuB,EAAE,0DAAqD;AAOvF;;;GAGG;AACH,MAAM,OAAO,qBAAqB;IAChC;;;;;;;;;OASG;IACH,IAAI,CAAC,QAA+B;QAClC,IAAI,CAAC,uBAAuB,CAAC,QAAQ,CAAC,EAAE,CAAC;YACvC,MAAM,IAAI,kBAAkB,CAC1B,+KAA+K,EAC/K,EAAE,QAAQ,EAAE,aAAa,CAAC,QAAQ,CAAC,EAAE,CACtC,CAAC;QACJ,CAAC;QAED,MAAM,KAAK,GAAG,IAAI,CAAC,cAAc,CAAC,QAAQ,CAAC,CAAC;QAC5C,MAAM,KAAK,GAAG,IAAI,CAAC,cAAc,CAAC,QAAQ,CAAC,CAAC;QAE5C,MAAM,cAAc,GAAG,IAAI,CAAC,gBAAgB,CAAC,KAAK,CAAC,CAAC;QACpD,MAAM,cAAc,GAAG,IAAI,CAAC,gBAAgB,CAAC,KAAK,CAAC,CAAC;QAEpD,MAAM,MAAM,GAAG,IAAI,CAAC,iBAAiB,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;QAEpD,OAAO;YACL,QAAQ,EAAE,QAAQ;YAClB,UAAU,EAAE,QAAQ,CAAC,QAAQ,CAAC,EAAE,IAAI,QAAQ,CAAC,QAAQ,CAAC,IAAI;YAC1D,KAAK;YACL,KAAK;YACL,MAAM;YACN,cAAc;YACd,cAAc;SACf,CAAC;IACJ,CAAC;IAED;;;;OAIG;IACK,cAAc,CAAC,QAA+B;QACpD,OAAO,QAAQ,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;YACnC,EAAE,EAAE,IAAI,CAAC,QAAQ,CAAC,EAAE;YACpB,IAAI,EAAE,IAAI,CAAC,QAAQ,CAAC,IAAI;YACxB,QAAQ,EAAE,IAAI,CAAC,QAAQ;YACvB,QAAQ,EAAE,IAAI,CAAC,QAAQ;YACvB,QAAQ,EAAE,IAAI,CAAC,QAAQ;YACvB,UAAU,EAAE,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;YACvD,WAAW,EAAE,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;YACzD,eAAe,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,WAAW,IAAI,EAAE,CAAC,CAAC,GAAG,CACpD,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,EAAE,CAClB;YACD,QAAQ,EAAE,IAAI,CAAC,QAAQ,CAAC,QAAQ;SACjC,CAAC,CAAC,CAAC;IACN,CAAC;IAED;;;OAGG;IACK,cAAc,CAAC,QAA+B;QACpD,OAAO,QAAQ,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;YACnC,EAAE,EAAE,IAAI,CAAC,EAAE;YACX,IAAI,EAAE,IAAI,CAAC,IAAI;YACf,YAAY,EAAE,IAAI,CAAC,YAAY;YAC/B,UAAU,EAAE,IAAI,CAAC,UAAU;YAC3B,YAAY,EAAE,IAAI,CAAC,YAAY;YAC/B,UAAU,EAAE,IAAI,CAAC,UAAU;YAC3B,GAAG,CAAC,IAAI,CAAC,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YAC1D,QAAQ,EAAE,IAAI,CAAC,QAAQ;SACxB,CAAC,CAAC,CAAC;IACN,CAAC;IAED;;OAEG;IACK,gBAAgB,CACtB,KAA+B;QAE/B,MAAM,GAAG,GAAG,IAAI,GAAG,EAAoC,CAAC;QACxD,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,IAAI,IAAI,CAAC,YAAY,KAAK,uBAAuB;gBAAE,SAAS;YAC5D,MAAM,IAAI,GAAG,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,YAAY,CAAC,IAAI,EAAE,CAAC;YAC9C,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAChB,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,YAAY,EAAE,IAAI,CAAC,CAAC;QACnC,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IAED;;;OAGG;IACK,gBAAgB,CACtB,KAA+B;QAE/B,MAAM,GAAG,GAAG,IAAI,GAAG,EAAoC,CAAC;QACxD,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,IAAI,IAAI,CAAC,YAAY,KAAK,uBAAuB;gBAAE,SAAS;YAC5D,MAAM,IAAI,GAAG,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,YAAY,CAAC,IAAI,EAAE,CAAC;YAC9C,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAChB,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,YAAY,EAAE,IAAI,CAAC,CAAC;QACnC,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IAED;;;;;;;OAOG;IACK,iBAAiB,CACvB,KAA+B,EAC/B,KAA+B;QAE/B,MAAM,eAAe,GAAG,KAAK,CAAC,MAAM,CAClC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,uBAAuB,CACxC,CAAC;QACF,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,eAAe,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAE1D,gEAAgE;QAChE,MAAM,SAAS,GAAG,KAAK,CAAC,MAAM,CAC5B,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,YAAY,CAAC,IAAI,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,YAAY,CAAC,CAClE,CAAC;QAEF,oBAAoB;QACpB,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAC;QAC3C,KAAK,MAAM,IAAI,IAAI,eAAe;YAAE,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;QAC7D,KAAK,MAAM,IAAI,IAAI,SAAS,EAAE,CAAC;YAC7B,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,YAAY,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAC9E,CAAC;QAED,MAAM,MAAM,GAA8B,EAAE,CAAC;QAC7C,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAClC,IAAI,KAAK,GAAG,eAAe,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;QAC3E,IAAI,UAAU,GAAG,CAAC,CAAC;QAEnB,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,MAAM,KAAK,GAA4B,EAAE,KAAK,EAAE,UAAU,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC;YAC7E,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACnB,MAAM,SAAS,GAA6B,EAAE,CAAC;YAC/C,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;gBACzB,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBACrB,MAAM,QAAQ,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,YAAY,KAAK,IAAI,CAAC,EAAE,CAAC,CAAC;gBACrE,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;oBAC5B,MAAM,GAAG,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;oBACvD,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,YAAY,EAAE,GAAG,CAAC,CAAC;oBACrC,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,YAAY,CAAC,EAAE,CAAC;wBACjD,MAAM,IAAI,GAAG,eAAe,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,IAAI,CAAC,YAAY,CAAC,CAAC;wBACrE,IAAI,IAAI;4BAAE,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;oBACjC,CAAC;gBACH,CAAC;YACH,CAAC;YACD,KAAK,GAAG,SAAS,CAAC;QACpB,CAAC;QAED,IAAI,OAAO,CAAC,IAAI,KAAK,eAAe,CAAC,MAAM,EAAE,CAAC;YAC5C,MAAM,SAAS,GAAG,eAAe;iBAC9B,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;iBACjC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YACpB,MAAM,IAAI,eAAe,CAAC;gBACxB,cAAc,EAAE,SAAS;gBACzB,UAAU,EAAE,eAAe,CAAC,CAAC,CAAC,EAAE,QAAQ,CAAC,IAAI;aAC9C,CAAC,CAAC;QACL,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;CACF;AAED;;;GAGG;AACH,SAAS,aAAa,CAAC,KAAc;IACnC,IAAI,CAAC,KAAK,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE,CAAC;QACxC,OAAO,EAAE,MAAM,EAAE,wBAAwB,EAAE,CAAC;IAC9C,CAAC;IACD,MAAM,MAAM,GAAG,KAAgC,CAAC;IAChD,OAAO;QACL,MAAM,EAAE,sCAAsC;QAC9C,2BAA2B,EACzB,OAAO,IAAI,MAAM,IAAI,WAAW,IAAI,MAAM,IAAI,CAAC,CAAC,UAAU,IAAI,MAAM,CAAC;QACvE,gBAAgB,EAAE,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;KACjD,CAAC;AACJ,CAAC"}

package/lib/esm/graph/engine/planning/index.js

@@ -7,7 +7,6 @@ export * from "./GraphExecutionPlanNode.js";
 export * from "./GraphExecutionPlanEdge.js";
 export * from "./GraphExecutionPlanLayer.js";
 export * from "./GraphExecutionPlan.js";
-export * from "./GraphRelationResolver.js";
 export * from "./GraphExecutionPlanner.js";
 export * from "./GraphTopology.js";
 //# sourceMappingURL=index.js.map

package/lib/esm/graph/engine/planning/index.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../../../src/graph/engine/planning/index.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AACH,4CAAyC;AACzC,4CAAyC;AACzC,6CAA0C;AAC1C,wCAAqC;AACrC,2CAAwC;AACxC,2CAAwC;AACxC,mCAAgC"}
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../../../src/graph/engine/planning/index.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AACH,4CAAyC;AACzC,4CAAyC;AACzC,6CAA0C;AAC1C,wCAAqC;AACrC,2CAAwC;AACxC,mCAAgC"}

package/lib/esm/graph/engine/registry/GraphNodeExecutorRegistry.js

@@ -1,39 +1,52 @@
+import { GraphNodeCatalogue } from "./../catalog/GraphNodeCatalogue.js";
+import { GraphNodeNotFoundError } from "./../catalog/GraphCatalogueErrors.js";
 import { GraphExecutionError } from "./../errors/GraphExecutionError.js";
 /**
- * Registry that maps node `kind` strings to {@link GraphNodeExecutor}
- * instances.
+ * Compatibility facade over {@link GraphNodeCatalogue} for legacy
+ * kind→executor registration (DECAF-50 §4.7). Delegates every binding to the
+ * catalogue and preserves the pre-catalogue {@link GraphExecutionError}
+ * contract.
  */
 export class GraphNodeExecutorRegistry {
-    constructor() {
-        this.executors = new Map();
+    constructor(catalogue = new GraphNodeCatalogue()) {
+        this.catalogue = catalogue;
+    }
+    /** The backing catalogue holding all kind→registration entries. */
+    get catalog() {
+        return this.catalogue;
     }
     /** Registers an executor for the given node kind. */
     register(kind, executor) {
-        if (!kind)
+        if (!kind) {
             throw new GraphExecutionError("Graph executor kind is required");
-        this.executors.set(kind, executor);
+        }
+        this.catalogue.registerExecutor(kind, executor);
         return this;
     }
-    /** Removes the executor for the given node kind. */
+    /** Removes the registration for the given node kind. */
     unregister(kind) {
-        this.executors.delete(kind);
+        this.catalogue.unregister(kind);
         return this;
     }
-    /** Returns whether an executor is registered for the given kind. */
+    /** Returns whether a registration exists for the given kind. */
     has(kind) {
-        return this.executors.has(kind);
+        return this.catalogue.has(kind);
     }
     /**
      * Resolves the executor for the given node kind.
      *
-     * @throws {GraphExecutionError} when no executor is registered for `kind`.
+     * @throws {GraphExecutionError} when no registration exists for `kind`.
      */
     resolve(kind) {
-        const executor = this.executors.get(kind);
-        if (!executor) {
-            throw new GraphExecutionError(`No graph executor registered for kind '${kind}'`, "GRAPH_EXECUTOR_NOT_FOUND", { kind });
+        try {
+            return this.catalogue.getExecutor(kind);
+        }
+        catch (e) {
+            if (e instanceof GraphNodeNotFoundError) {
+                throw new GraphExecutionError(`No graph executor registered for kind '${kind}'`, "GRAPH_EXECUTOR_NOT_FOUND", { kind });
+            }
+            throw e;
         }
-        return executor;
     }
 }
 //# sourceMappingURL=GraphNodeExecutorRegistry.js.map

package/lib/esm/graph/engine/registry/GraphNodeExecutorRegistry.js.map

@@ -1 +1 @@
-{"version":3,"file":"GraphNodeExecutorRegistry.js","sourceRoot":"","sources":["../../../../../src/graph/engine/registry/GraphNodeExecutorRegistry.ts"],"names":[],"mappings":"AAMA,OAAO,EAAE,mBAAmB,EAAE,2CAAsC;AAEpE;;;GAGG;AACH,MAAM,OAAO,yBAAyB;IAAtC;QACmB,cAAS,GAAG,IAAI,GAAG,EAA6B,CAAC;IAoCpE,CAAC;IAlCC,qDAAqD;IACrD,QAAQ,CAAC,IAAY,EAAE,QAA2B;QAChD,IAAI,CAAC,IAAI;YAAE,MAAM,IAAI,mBAAmB,CAAC,iCAAiC,CAAC,CAAC;QAC5E,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;QACnC,OAAO,IAAI,CAAC;IACd,CAAC;IAED,oDAAoD;IACpD,UAAU,CAAC,IAAY;QACrB,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QAC5B,OAAO,IAAI,CAAC;IACd,CAAC;IAED,oEAAoE;IACpE,GAAG,CAAC,IAAY;QACd,OAAO,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IAClC,CAAC;IAED;;;;OAIG;IACH,OAAO,CAAC,IAAY;QAClB,MAAM,QAAQ,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAC1C,IAAI,CAAC,QAAQ,EAAE,CAAC;YACd,MAAM,IAAI,mBAAmB,CAC3B,0CAA0C,IAAI,GAAG,EACjD,0BAA0B,EAC1B,EAAE,IAAI,EAAE,CACT,CAAC;QACJ,CAAC;QACD,OAAO,QAAQ,CAAC;IAClB,CAAC;CACF"}
+{"version":3,"file":"GraphNodeExecutorRegistry.js","sourceRoot":"","sources":["../../../../../src/graph/engine/registry/GraphNodeExecutorRegistry.ts"],"names":[],"mappings":"AAcA,OAAO,EAAE,kBAAkB,EAAE,2CAAsC;AACnE,OAAO,EAAE,sBAAsB,EAAE,6CAAwC;AACzE,OAAO,EAAE,mBAAmB,EAAE,2CAAsC;AAEpE;;;;;GAKG;AACH,MAAM,OAAO,yBAAyB;IACpC,YACmB,YAAgC,IAAI,kBAAkB,EAAE;QAAxD,cAAS,GAAT,SAAS,CAA+C;IACxE,CAAC;IAEJ,mEAAmE;IACnE,IAAI,OAAO;QACT,OAAO,IAAI,CAAC,SAAS,CAAC;IACxB,CAAC;IAED,qDAAqD;IACrD,QAAQ,CAAC,IAAY,EAAE,QAA2B;QAChD,IAAI,CAAC,IAAI,EAAE,CAAC;YACV,MAAM,IAAI,mBAAmB,CAAC,iCAAiC,CAAC,CAAC;QACnE,CAAC;QACD,IAAI,CAAC,SAAS,CAAC,gBAAgB,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;QAChD,OAAO,IAAI,CAAC;IACd,CAAC;IAED,wDAAwD;IACxD,UAAU,CAAC,IAAY;QACrB,IAAI,CAAC,SAAS,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;QAChC,OAAO,IAAI,CAAC;IACd,CAAC;IAED,gEAAgE;IAChE,GAAG,CAAC,IAAY;QACd,OAAO,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IAClC,CAAC;IAED;;;;OAIG;IACH,OAAO,CAAC,IAAY;QAClB,IAAI,CAAC;YACH,OAAO,IAAI,CAAC,SAAS,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;QAC1C,CAAC;QAAC,OAAO,CAAC,EAAE,CAAC;YACX,IAAI,CAAC,YAAY,sBAAsB,EAAE,CAAC;gBACxC,MAAM,IAAI,mBAAmB,CAC3B,0CAA0C,IAAI,GAAG,EACjD,0BAA0B,EAC1B,EAAE,IAAI,EAAE,CACT,CAAC;YACJ,CAAC;YACD,MAAM,CAAC,CAAC;QACV,CAAC;IACH,CAAC;CACF"}

package/lib/esm/graph/engine/runs/GraphRunEventPublisher.js

@@ -0,0 +1,64 @@
+import { DEFAULT_GRAPH_RUN_LIMITS, } from "@decaf-ts/ui-decorators/graph";
+/**
+ * Sequences and persists run events for the SSE run stream (DECAF-50 §4.16):
+ * assigns a monotonically increasing `sequence` per run, stamps ISO
+ * timestamps, truncates oversized/non-serializable payloads to the
+ * configured limits, and chains appends per run so store writes preserve
+ * publish order.
+ */
+export class GraphRunEventPublisher {
+    constructor(store, limits = {}) {
+        this.sequences = new Map();
+        this.chains = new Map();
+        this.store = store;
+        this.limits = { ...DEFAULT_GRAPH_RUN_LIMITS, ...limits };
+    }
+    /**
+     * Assigns the next sequence number for the run, stamps and limits the
+     * payload, and appends the envelope to the store in publish order.
+     */
+    async publish(event) {
+        const runId = event.runId;
+        const sequence = (this.sequences.get(runId) ?? 0) + 1;
+        this.sequences.set(runId, sequence);
+        const envelope = {
+            ...event,
+            payload: this.limitPayload(event.payload),
+            sequence,
+            timestamp: new Date().toISOString(),
+        };
+        const chained = (this.chains.get(runId) ?? Promise.resolve()).then(() => this.store.append(envelope));
+        this.chains.set(runId, chained.catch(() => undefined));
+        await chained;
+        return envelope;
+    }
+    /** Highest sequence number issued for the run (0 when none). */
+    lastSequence(runId) {
+        return this.sequences.get(runId) ?? 0;
+    }
+    /** Drops sequencing state for a finished run. */
+    release(runId) {
+        this.sequences.delete(runId);
+        this.chains.delete(runId);
+    }
+    limitPayload(payload) {
+        if (payload === undefined)
+            return undefined;
+        let serialized;
+        try {
+            serialized = JSON.stringify(payload);
+        }
+        catch {
+            return { nonSerializable: true };
+        }
+        if (serialized.length <= this.limits.maxEventPayloadBytes) {
+            return payload;
+        }
+        return {
+            truncated: true,
+            reason: "event payload exceeds the configured byte limit",
+            bytes: serialized.length,
+        };
+    }
+}
+//# sourceMappingURL=GraphRunEventPublisher.js.map

package/lib/esm/graph/engine/runs/GraphRunEventPublisher.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"GraphRunEventPublisher.js","sourceRoot":"","sources":["../../../../../src/graph/engine/runs/GraphRunEventPublisher.ts"],"names":[],"mappings":"AAUA,OAAO,EACL,wBAAwB,GAIzB,MAAM,+BAA+B,CAAC;AAKvC;;;;;;GAMG;AACH,MAAM,OAAO,sBAAsB;IAMjC,YAAY,KAAyB,EAAE,SAAyB,EAAE;QAHjD,cAAS,GAAG,IAAI,GAAG,EAAkB,CAAC;QACtC,WAAM,GAAG,IAAI,GAAG,EAAyB,CAAC;QAGzD,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,MAAM,GAAG,EAAE,GAAG,wBAAwB,EAAE,GAAG,MAAM,EAAE,CAAC;IAC3D,CAAC;IAED;;;OAGG;IACH,KAAK,CAAC,OAAO,CACX,KAAiC;QAEjC,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC;QAC1B,MAAM,QAAQ,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;QACtD,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC;QACpC,MAAM,QAAQ,GAA0B;YACtC,GAAG,KAAK;YACR,OAAO,EAAE,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,OAAO,CAAC;YACzC,QAAQ;YACR,SAAS,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;SACpC,CAAC;QACF,MAAM,OAAO,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,OAAO,CAAC,OAAO,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,EAAE,CACtE,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,QAAQ,CAAC,CAC5B,CAAC;QACF,IAAI,CAAC,MAAM,CAAC,GAAG,CACb,KAAK,EACL,OAAO,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC,SAAS,CAAC,CAC/B,CAAC;QACF,MAAM,OAAO,CAAC;QACd,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED,gEAAgE;IAChE,YAAY,CAAC,KAAa;QACxB,OAAO,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IACxC,CAAC;IAED,iDAAiD;IACjD,OAAO,CAAC,KAAa;QACnB,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QAC7B,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;IAC5B,CAAC;IAEO,YAAY,CAAC,OAAgB;QACnC,IAAI,OAAO,KAAK,SAAS;YAAE,OAAO,SAAS,CAAC;QAC5C,IAAI,UAAkB,CAAC;QACvB,IAAI,CAAC;YACH,UAAU,GAAG,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC;QACvC,CAAC;QAAC,MAAM,CAAC;YACP,OAAO,EAAE,eAAe,EAAE,IAAI,EAAE,CAAC;QACnC,CAAC;QACD,IAAI,UAAU,CAAC,MAAM,IAAI,IAAI,CAAC,MAAM,CAAC,oBAAoB,EAAE,CAAC;YAC1D,OAAO,OAA2C,CAAC;QACrD,CAAC;QACD,OAAO;YACL,SAAS,EAAE,IAAI;YACf,MAAM,EAAE,iDAAiD;YACzD,KAAK,EAAE,UAAU,CAAC,MAAM;SACzB,CAAC;IACJ,CAAC;CACF"}