@decaf-ts/integrations 0.10.5 → 0.11.0

package/lib/cjs/graph/engine/planning/GraphExecutionPlan.cjs

@@ -1,4 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-//# sourceMappingURL=GraphExecutionPlan.js.map
-//# sourceMappingURL=GraphExecutionPlan.cjs.map

package/lib/cjs/graph/engine/planning/GraphExecutionPlan.cjs.map

@@ -1 +0,0 @@
-{"version":3,"file":"graph/engine/planning/GraphExecutionPlan.cjs","sourceRoot":"","sources":["graph/engine/planning/GraphExecutionPlan.js"],"names":[],"mappings":";;AACA,8CAA8C"}

package/lib/cjs/graph/engine/planning/GraphExecutionPlanEdge.cjs

@@ -1,4 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-//# sourceMappingURL=GraphExecutionPlanEdge.js.map
-//# sourceMappingURL=GraphExecutionPlanEdge.cjs.map

package/lib/cjs/graph/engine/planning/GraphExecutionPlanEdge.cjs.map

@@ -1 +0,0 @@
-{"version":3,"file":"graph/engine/planning/GraphExecutionPlanEdge.cjs","sourceRoot":"","sources":["graph/engine/planning/GraphExecutionPlanEdge.js"],"names":[],"mappings":";;AAQA,kDAAkD"}

package/lib/cjs/graph/engine/planning/GraphExecutionPlanLayer.cjs

@@ -1,4 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-//# sourceMappingURL=GraphExecutionPlanLayer.js.map
-//# sourceMappingURL=GraphExecutionPlanLayer.cjs.map

package/lib/cjs/graph/engine/planning/GraphExecutionPlanLayer.cjs.map

@@ -1 +0,0 @@
-{"version":3,"file":"graph/engine/planning/GraphExecutionPlanLayer.cjs","sourceRoot":"","sources":["graph/engine/planning/GraphExecutionPlanLayer.js"],"names":[],"mappings":";;AACA,mDAAmD"}

package/lib/cjs/graph/engine/planning/GraphExecutionPlanNode.cjs

@@ -1,4 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-//# sourceMappingURL=GraphExecutionPlanNode.js.map
-//# sourceMappingURL=GraphExecutionPlanNode.cjs.map

package/lib/cjs/graph/engine/planning/GraphExecutionPlanNode.cjs.map

@@ -1 +0,0 @@
-{"version":3,"file":"graph/engine/planning/GraphExecutionPlanNode.cjs","sourceRoot":"","sources":["graph/engine/planning/GraphExecutionPlanNode.js"],"names":[],"mappings":";;AACA,kDAAkD"}

package/lib/cjs/graph/engine/planning/GraphExecutionPlanner.cjs

@@ -1,188 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.GraphExecutionPlanner = void 0;
-/**
- * @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}.
- */
-const constants_js_1 = require("./../constants.cjs");
-const GraphCycleError_js_1 = require("./../errors/GraphCycleError.cjs");
-const GraphTopologyError_js_1 = require("./../errors/GraphTopologyError.cjs");
-const GraphWorkflowDocumentValidator_js_1 = require("./../validation/GraphWorkflowDocumentValidator.cjs");
-/**
- * Planner that turns a {@link GraphResolvedWorkflow} into a
- * {@link GraphExecutionPlan} with topological layers.
- */
-class GraphExecutionPlanner {
-    /**
-     * Plans a resolved workflow for execution.
-     *
-     * @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 the input is not a resolved workflow.
-     * @throws {GraphCycleError} when the workflow contains an unsupported cycle.
-     */
-    plan(workflow) {
-        if (!(0, GraphWorkflowDocumentValidator_js_1.isGraphResolvedWorkflow)(workflow)) {
-            throw new GraphTopologyError_js_1.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 {
-            resolved: workflow,
-            workflowId: workflow.document.id || workflow.document.name,
-            nodes,
-            edges,
-            layers,
-            incomingByNode,
-            outgoingByNode,
-        };
-    }
-    /**
-     * 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.
-     */
-    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,
-        }));
-    }
-    /**
-     * Builds plan edges from the flattened resolved edges (already validated by
-     * §4.8 stage 5/6).
-     */
-    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,
-        }));
-    }
-    /**
-     * 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 === constants_js_1.GRAPH_WORKFLOW_BOUNDARY)
-                continue;
-            const list = map.get(edge.targetNodeId) ?? [];
-            list.push(edge);
-            map.set(edge.targetNodeId, list);
-        }
-        return map;
-    }
-    /**
-     * 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 === constants_js_1.GRAPH_WORKFLOW_BOUNDARY)
-                continue;
-            const list = map.get(edge.sourceNodeId) ?? [];
-            list.push(edge);
-            map.set(edge.sourceNodeId, list);
-        }
-        return map;
-    }
-    /**
-     * 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 !== constants_js_1.GRAPH_WORKFLOW_BOUNDARY);
-        const nodeIds = new Set(executableNodes.map((n) => n.id));
-        // Only edges between two executable nodes count as dependencies
-        const execEdges = edges.filter((e) => nodeIds.has(e.sourceNodeId) && nodeIds.has(e.targetNodeId));
-        // Compute in-degree
-        const indegree = new Map();
-        for (const node of executableNodes)
-            indegree.set(node.id, 0);
-        for (const edge of execEdges) {
-            indegree.set(edge.targetNodeId, (indegree.get(edge.targetNodeId) ?? 0) + 1);
-        }
-        const layers = [];
-        const planned = new Set();
-        let ready = executableNodes.filter((n) => (indegree.get(n.id) ?? 0) === 0);
-        let layerIndex = 0;
-        while (ready.length > 0) {
-            const layer = { index: layerIndex++, nodes: ready };
-            layers.push(layer);
-            const nextReady = [];
-            for (const node of ready) {
-                planned.add(node.id);
-                const outgoing = execEdges.filter((e) => e.sourceNodeId === node.id);
-                for (const edge of outgoing) {
-                    const deg = (indegree.get(edge.targetNodeId) ?? 1) - 1;
-                    indegree.set(edge.targetNodeId, deg);
-                    if (deg === 0 && !planned.has(edge.targetNodeId)) {
-                        const next = executableNodes.find((n) => n.id === edge.targetNodeId);
-                        if (next)
-                            nextReady.push(next);
-                    }
-                }
-            }
-            ready = nextReady;
-        }
-        if (planned.size !== executableNodes.length) {
-            const unplanned = executableNodes
-                .filter((n) => !planned.has(n.id))
-                .map((n) => n.id);
-            throw new GraphCycleError_js_1.GraphCycleError({
-                unplannedNodes: unplanned,
-                workflowId: executableNodes[0]?.manifest.kind,
-            });
-        }
-        return layers;
-    }
-}
-exports.GraphExecutionPlanner = GraphExecutionPlanner;
-/**
- * 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
-//# sourceMappingURL=GraphExecutionPlanner.cjs.map

package/lib/cjs/graph/engine/planning/GraphExecutionPlanner.cjs.map

@@ -1 +0,0 @@
-{"version":3,"file":"graph/engine/planning/GraphExecutionPlanner.cjs","sourceRoot":"","sources":["graph/engine/planning/GraphExecutionPlanner.js"],"names":[],"mappings":";;;AAAA;;;;;;;;;;GAUG;AACH,oDAA4D;AAC5D,uEAAiE;AACjE,6EAAuE;AACvE,yGAA4F;AAC5F;;;GAGG;AACH,MAAa,qBAAqB;IAC9B;;;;;;;;;OASG;IACH,IAAI,CAAC,QAAQ;QACT,IAAI,CAAC,IAAA,2DAAuB,EAAC,QAAQ,CAAC,EAAE,CAAC;YACrC,MAAM,IAAI,0CAAkB,CAAC,+KAA+K,EAAE,EAAE,QAAQ,EAAE,aAAa,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;QACzP,CAAC;QACD,MAAM,KAAK,GAAG,IAAI,CAAC,cAAc,CAAC,QAAQ,CAAC,CAAC;QAC5C,MAAM,KAAK,GAAG,IAAI,CAAC,cAAc,CAAC,QAAQ,CAAC,CAAC;QAC5C,MAAM,cAAc,GAAG,IAAI,CAAC,gBAAgB,CAAC,KAAK,CAAC,CAAC;QACpD,MAAM,cAAc,GAAG,IAAI,CAAC,gBAAgB,CAAC,KAAK,CAAC,CAAC;QACpD,MAAM,MAAM,GAAG,IAAI,CAAC,iBAAiB,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;QACpD,OAAO;YACH,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;SACjB,CAAC;IACN,CAAC;IACD;;;;OAIG;IACH,cAAc,CAAC,QAAQ;QACnB,OAAO,QAAQ,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;YACjC,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,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;YACzE,QAAQ,EAAE,IAAI,CAAC,QAAQ,CAAC,QAAQ;SACnC,CAAC,CAAC,CAAC;IACR,CAAC;IACD;;;OAGG;IACH,cAAc,CAAC,QAAQ;QACnB,OAAO,QAAQ,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;YACjC,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;SAC1B,CAAC,CAAC,CAAC;IACR,CAAC;IACD;;OAEG;IACH,gBAAgB,CAAC,KAAK;QAClB,MAAM,GAAG,GAAG,IAAI,GAAG,EAAE,CAAC;QACtB,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACvB,IAAI,IAAI,CAAC,YAAY,KAAK,sCAAuB;gBAC7C,SAAS;YACb,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;QACrC,CAAC;QACD,OAAO,GAAG,CAAC;IACf,CAAC;IACD;;;OAGG;IACH,gBAAgB,CAAC,KAAK;QAClB,MAAM,GAAG,GAAG,IAAI,GAAG,EAAE,CAAC;QACtB,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACvB,IAAI,IAAI,CAAC,YAAY,KAAK,sCAAuB;gBAC7C,SAAS;YACb,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;QACrC,CAAC;QACD,OAAO,GAAG,CAAC;IACf,CAAC;IACD;;;;;;;OAOG;IACH,iBAAiB,CAAC,KAAK,EAAE,KAAK;QAC1B,MAAM,eAAe,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,sCAAuB,CAAC,CAAC;QAC9E,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,eAAe,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAC1D,gEAAgE;QAChE,MAAM,SAAS,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,YAAY,CAAC,IAAI,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC;QAClG,oBAAoB;QACpB,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAE,CAAC;QAC3B,KAAK,MAAM,IAAI,IAAI,eAAe;YAC9B,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;QAC7B,KAAK,MAAM,IAAI,IAAI,SAAS,EAAE,CAAC;YAC3B,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,YAAY,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAChF,CAAC;QACD,MAAM,MAAM,GAAG,EAAE,CAAC;QAClB,MAAM,OAAO,GAAG,IAAI,GAAG,EAAE,CAAC;QAC1B,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;QACnB,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACtB,MAAM,KAAK,GAAG,EAAE,KAAK,EAAE,UAAU,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC;YACpD,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACnB,MAAM,SAAS,GAAG,EAAE,CAAC;YACrB,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;gBACvB,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;oBAC1B,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;wBAC/C,MAAM,IAAI,GAAG,eAAe,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,IAAI,CAAC,YAAY,CAAC,CAAC;wBACrE,IAAI,IAAI;4BACJ,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;oBAC7B,CAAC;gBACL,CAAC;YACL,CAAC;YACD,KAAK,GAAG,SAAS,CAAC;QACtB,CAAC;QACD,IAAI,OAAO,CAAC,IAAI,KAAK,eAAe,CAAC,MAAM,EAAE,CAAC;YAC1C,MAAM,SAAS,GAAG,eAAe;iBAC5B,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;YACtB,MAAM,IAAI,oCAAe,CAAC;gBACtB,cAAc,EAAE,SAAS;gBACzB,UAAU,EAAE,eAAe,CAAC,CAAC,CAAC,EAAE,QAAQ,CAAC,IAAI;aAChD,CAAC,CAAC;QACP,CAAC;QACD,OAAO,MAAM,CAAC;IAClB,CAAC;CACJ;AAnJD,sDAmJC;AACD;;;GAGG;AACH,SAAS,aAAa,CAAC,KAAK;IACxB,IAAI,CAAC,KAAK,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE,CAAC;QACtC,OAAO,EAAE,MAAM,EAAE,wBAAwB,EAAE,CAAC;IAChD,CAAC;IACD,MAAM,MAAM,GAAG,KAAK,CAAC;IACrB,OAAO;QACH,MAAM,EAAE,sCAAsC;QAC9C,2BAA2B,EAAE,OAAO,IAAI,MAAM,IAAI,WAAW,IAAI,MAAM,IAAI,CAAC,CAAC,UAAU,IAAI,MAAM,CAAC;QAClG,gBAAgB,EAAE,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;KACnD,CAAC;AACN,CAAC;AACD,iDAAiD"}

package/lib/cjs/graph/engine/planning/GraphTopology.cjs

@@ -1,57 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.GraphTopology = void 0;
-/**
- * Topology utility for traversing the execution plan's edges.
- */
-class GraphTopology {
-    /**
-     * Returns the set of upstream node ids reachable from `nodeId` by following
-     * incoming edges. The workflow boundary node is excluded.
-     */
-    static upstreamNodes(nodeId, incomingByNode, includeBoundary = false) {
-        const visited = new Set();
-        const stack = [nodeId];
-        while (stack.length) {
-            const current = stack.pop();
-            const incoming = incomingByNode.get(current) ?? [];
-            for (const edge of incoming) {
-                if (!includeBoundary && this.isBoundary(edge.sourceNodeId))
-                    continue;
-                if (!visited.has(edge.sourceNodeId)) {
-                    visited.add(edge.sourceNodeId);
-                    stack.push(edge.sourceNodeId);
-                }
-            }
-        }
-        return visited;
-    }
-    /**
-     * Returns the set of downstream node ids reachable from `nodeId` by following
-     * outgoing edges. The workflow boundary node is excluded.
-     */
-    static downstreamNodes(nodeId, outgoingByNode, includeBoundary = false) {
-        const visited = new Set();
-        const stack = [nodeId];
-        while (stack.length) {
-            const current = stack.pop();
-            const outgoing = outgoingByNode.get(current) ?? [];
-            for (const edge of outgoing) {
-                if (!includeBoundary && this.isBoundary(edge.targetNodeId))
-                    continue;
-                if (!visited.has(edge.targetNodeId)) {
-                    visited.add(edge.targetNodeId);
-                    stack.push(edge.targetNodeId);
-                }
-            }
-        }
-        return visited;
-    }
-    /** Returns whether a node id is the workflow boundary. */
-    static isBoundary(nodeId) {
-        return nodeId === "$workflow";
-    }
-}
-exports.GraphTopology = GraphTopology;
-//# sourceMappingURL=GraphTopology.js.map
-//# sourceMappingURL=GraphTopology.cjs.map

package/lib/cjs/graph/engine/planning/GraphTopology.cjs.map

@@ -1 +0,0 @@
-{"version":3,"file":"graph/engine/planning/GraphTopology.cjs","sourceRoot":"","sources":["graph/engine/planning/GraphTopology.js"],"names":[],"mappings":";;;AAAA;;GAEG;AACH,MAAa,aAAa;IACtB;;;OAGG;IACH,MAAM,CAAC,aAAa,CAAC,MAAM,EAAE,cAAc,EAAE,eAAe,GAAG,KAAK;QAChE,MAAM,OAAO,GAAG,IAAI,GAAG,EAAE,CAAC;QAC1B,MAAM,KAAK,GAAG,CAAC,MAAM,CAAC,CAAC;QACvB,OAAO,KAAK,CAAC,MAAM,EAAE,CAAC;YAClB,MAAM,OAAO,GAAG,KAAK,CAAC,GAAG,EAAE,CAAC;YAC5B,MAAM,QAAQ,GAAG,cAAc,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC;YACnD,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;gBAC1B,IAAI,CAAC,eAAe,IAAI,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,YAAY,CAAC;oBACtD,SAAS;gBACb,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,YAAY,CAAC,EAAE,CAAC;oBAClC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;oBAC/B,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;gBAClC,CAAC;YACL,CAAC;QACL,CAAC;QACD,OAAO,OAAO,CAAC;IACnB,CAAC;IACD;;;OAGG;IACH,MAAM,CAAC,eAAe,CAAC,MAAM,EAAE,cAAc,EAAE,eAAe,GAAG,KAAK;QAClE,MAAM,OAAO,GAAG,IAAI,GAAG,EAAE,CAAC;QAC1B,MAAM,KAAK,GAAG,CAAC,MAAM,CAAC,CAAC;QACvB,OAAO,KAAK,CAAC,MAAM,EAAE,CAAC;YAClB,MAAM,OAAO,GAAG,KAAK,CAAC,GAAG,EAAE,CAAC;YAC5B,MAAM,QAAQ,GAAG,cAAc,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC;YACnD,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;gBAC1B,IAAI,CAAC,eAAe,IAAI,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,YAAY,CAAC;oBACtD,SAAS;gBACb,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,YAAY,CAAC,EAAE,CAAC;oBAClC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;oBAC/B,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;gBAClC,CAAC;YACL,CAAC;QACL,CAAC;QACD,OAAO,OAAO,CAAC;IACnB,CAAC;IACD,0DAA0D;IAC1D,MAAM,CAAC,UAAU,CAAC,MAAM;QACpB,OAAO,MAAM,KAAK,WAAW,CAAC;IAClC,CAAC;CACJ;AA/CD,sCA+CC;AACD,yCAAyC"}

package/lib/cjs/graph/engine/planning/index.cjs

@@ -1,29 +0,0 @@
-"use strict";
-var __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {
-    if (k2 === undefined) k2 = k;
-    var desc = Object.getOwnPropertyDescriptor(m, k);
-    if (!desc || ("get" in desc ? !m.__esModule : desc.writable || desc.configurable)) {
-      desc = { enumerable: true, get: function() { return m[k]; } };
-    }
-    Object.defineProperty(o, k2, desc);
-}) : (function(o, m, k, k2) {
-    if (k2 === undefined) k2 = k;
-    o[k2] = m[k];
-}));
-var __exportStar = (this && this.__exportStar) || function(m, exports) {
-    for (var p in m) if (p !== "default" && !Object.prototype.hasOwnProperty.call(exports, p)) __createBinding(exports, m, p);
-};
-Object.defineProperty(exports, "__esModule", { value: true });
-/**
- * @module integrations/graph/planning
- * @summary Graph execution planning.
- * @description Re-exports the execution plan types, relation resolver, and topological planner.
- */
-__exportStar(require("./GraphExecutionPlanNode.cjs"), exports);
-__exportStar(require("./GraphExecutionPlanEdge.cjs"), exports);
-__exportStar(require("./GraphExecutionPlanLayer.cjs"), exports);
-__exportStar(require("./GraphExecutionPlan.cjs"), exports);
-__exportStar(require("./GraphExecutionPlanner.cjs"), exports);
-__exportStar(require("./GraphTopology.cjs"), exports);
-//# sourceMappingURL=index.js.map
-//# sourceMappingURL=index.cjs.map

package/lib/cjs/graph/engine/planning/index.cjs.map

@@ -1 +0,0 @@
-{"version":3,"file":"graph/engine/planning/index.cjs","sourceRoot":"","sources":["graph/engine/planning/index.js"],"names":[],"mappings":";;;;;;;;;;;;;;;;AAAA;;;;GAIG;AACH,8DAA4C;AAC5C,8DAA4C;AAC5C,+DAA6C;AAC7C,0DAAwC;AACxC,6DAA2C;AAC3C,qDAAmC;AACnC,iCAAiC"}

package/lib/cjs/graph/engine/registry/GraphNodeExecutorRegistry.cjs

@@ -1,57 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.GraphNodeExecutorRegistry = void 0;
-const GraphNodeCatalogue_js_1 = require("./../catalog/GraphNodeCatalogue.cjs");
-const GraphCatalogueErrors_js_1 = require("./../catalog/GraphCatalogueErrors.cjs");
-const GraphExecutionError_js_1 = require("./../errors/GraphExecutionError.cjs");
-/**
- * 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.
- */
-class GraphNodeExecutorRegistry {
-    constructor(catalogue = new GraphNodeCatalogue_js_1.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) {
-            throw new GraphExecutionError_js_1.GraphExecutionError("Graph executor kind is required");
-        }
-        this.catalogue.registerExecutor(kind, executor);
-        return this;
-    }
-    /** Removes the registration for the given node kind. */
-    unregister(kind) {
-        this.catalogue.unregister(kind);
-        return this;
-    }
-    /** Returns whether a registration exists for the given kind. */
-    has(kind) {
-        return this.catalogue.has(kind);
-    }
-    /**
-     * Resolves the executor for the given node kind.
-     *
-     * @throws {GraphExecutionError} when no registration exists for `kind`.
-     */
-    resolve(kind) {
-        try {
-            return this.catalogue.getExecutor(kind);
-        }
-        catch (e) {
-            if (e instanceof GraphCatalogueErrors_js_1.GraphNodeNotFoundError) {
-                throw new GraphExecutionError_js_1.GraphExecutionError(`No graph executor registered for kind '${kind}'`, "GRAPH_EXECUTOR_NOT_FOUND", { kind });
-            }
-            throw e;
-        }
-    }
-}
-exports.GraphNodeExecutorRegistry = GraphNodeExecutorRegistry;
-//# sourceMappingURL=GraphNodeExecutorRegistry.js.map
-//# sourceMappingURL=GraphNodeExecutorRegistry.cjs.map

package/lib/cjs/graph/engine/registry/GraphNodeExecutorRegistry.cjs.map

@@ -1 +0,0 @@
-{"version":3,"file":"graph/engine/registry/GraphNodeExecutorRegistry.cjs","sourceRoot":"","sources":["graph/engine/registry/GraphNodeExecutorRegistry.js"],"names":[],"mappings":";;;AAAA,8EAAwE;AACxE,kFAA8E;AAC9E,+EAAyE;AACzE;;;;;GAKG;AACH,MAAa,yBAAyB;IAClC,YAAY,SAAS,GAAG,IAAI,0CAAkB,EAAE;QAC5C,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC;IAC/B,CAAC;IACD,mEAAmE;IACnE,IAAI,OAAO;QACP,OAAO,IAAI,CAAC,SAAS,CAAC;IAC1B,CAAC;IACD,qDAAqD;IACrD,QAAQ,CAAC,IAAI,EAAE,QAAQ;QACnB,IAAI,CAAC,IAAI,EAAE,CAAC;YACR,MAAM,IAAI,4CAAmB,CAAC,iCAAiC,CAAC,CAAC;QACrE,CAAC;QACD,IAAI,CAAC,SAAS,CAAC,gBAAgB,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;QAChD,OAAO,IAAI,CAAC;IAChB,CAAC;IACD,wDAAwD;IACxD,UAAU,CAAC,IAAI;QACX,IAAI,CAAC,SAAS,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;QAChC,OAAO,IAAI,CAAC;IAChB,CAAC;IACD,gEAAgE;IAChE,GAAG,CAAC,IAAI;QACJ,OAAO,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IACpC,CAAC;IACD;;;;OAIG;IACH,OAAO,CAAC,IAAI;QACR,IAAI,CAAC;YACD,OAAO,IAAI,CAAC,SAAS,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;QAC5C,CAAC;QACD,OAAO,CAAC,EAAE,CAAC;YACP,IAAI,CAAC,YAAY,gDAAsB,EAAE,CAAC;gBACtC,MAAM,IAAI,4CAAmB,CAAC,0CAA0C,IAAI,GAAG,EAAE,0BAA0B,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC;YAC3H,CAAC;YACD,MAAM,CAAC,CAAC;QACZ,CAAC;IACL,CAAC;CACJ;AAzCD,8DAyCC;AACD,qDAAqD"}

package/lib/cjs/graph/engine/registry/GraphNodeExecutorResolver.cjs

@@ -1,27 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.GraphNodeExecutorResolver = void 0;
-/**
- * Resolver that wraps a {@link GraphNodeExecutorRegistry} and optionally
- * falls back to a default executor when a kind is not found.
- */
-class GraphNodeExecutorResolver {
-    constructor(registry, defaultExecutor) {
-        this.registry = registry;
-        this.defaultExecutor = defaultExecutor;
-    }
-    /**
-     * Resolves the executor for `kind`, falling back to the default executor
-     * when provided.
-     */
-    resolve(kind) {
-        if (this.registry.has(kind))
-            return this.registry.resolve(kind);
-        if (this.defaultExecutor)
-            return this.defaultExecutor;
-        return this.registry.resolve(kind);
-    }
-}
-exports.GraphNodeExecutorResolver = GraphNodeExecutorResolver;
-//# sourceMappingURL=GraphNodeExecutorResolver.js.map
-//# sourceMappingURL=GraphNodeExecutorResolver.cjs.map

package/lib/cjs/graph/engine/registry/GraphNodeExecutorResolver.cjs.map

@@ -1 +0,0 @@
-{"version":3,"file":"graph/engine/registry/GraphNodeExecutorResolver.cjs","sourceRoot":"","sources":["graph/engine/registry/GraphNodeExecutorResolver.js"],"names":[],"mappings":";;;AAAA;;;GAGG;AACH,MAAa,yBAAyB;IAClC,YAAY,QAAQ,EAAE,eAAe;QACjC,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;QACzB,IAAI,CAAC,eAAe,GAAG,eAAe,CAAC;IAC3C,CAAC;IACD;;;OAGG;IACH,OAAO,CAAC,IAAI;QACR,IAAI,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC;YACvB,OAAO,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;QACvC,IAAI,IAAI,CAAC,eAAe;YACpB,OAAO,IAAI,CAAC,eAAe,CAAC;QAChC,OAAO,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;IACvC,CAAC;CACJ;AAhBD,8DAgBC;AACD,qDAAqD"}

package/lib/cjs/graph/engine/registry/index.cjs

@@ -1,25 +0,0 @@
-"use strict";
-var __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {
-    if (k2 === undefined) k2 = k;
-    var desc = Object.getOwnPropertyDescriptor(m, k);
-    if (!desc || ("get" in desc ? !m.__esModule : desc.writable || desc.configurable)) {
-      desc = { enumerable: true, get: function() { return m[k]; } };
-    }
-    Object.defineProperty(o, k2, desc);
-}) : (function(o, m, k, k2) {
-    if (k2 === undefined) k2 = k;
-    o[k2] = m[k];
-}));
-var __exportStar = (this && this.__exportStar) || function(m, exports) {
-    for (var p in m) if (p !== "default" && !Object.prototype.hasOwnProperty.call(exports, p)) __createBinding(exports, m, p);
-};
-Object.defineProperty(exports, "__esModule", { value: true });
-/**
- * @module integrations/graph/registry
- * @summary Graph node executor registry and resolver.
- * @description Re-exports the executor registry and resolver.
- */
-__exportStar(require("./GraphNodeExecutorRegistry.cjs"), exports);
-__exportStar(require("./GraphNodeExecutorResolver.cjs"), exports);
-//# sourceMappingURL=index.js.map
-//# sourceMappingURL=index.cjs.map

package/lib/cjs/graph/engine/registry/index.cjs.map

@@ -1 +0,0 @@
-{"version":3,"file":"graph/engine/registry/index.cjs","sourceRoot":"","sources":["graph/engine/registry/index.js"],"names":[],"mappings":";;;;;;;;;;;;;;;;AAAA;;;;GAIG;AACH,iEAA+C;AAC/C,iEAA+C;AAC/C,iCAAiC"}

package/lib/cjs/graph/engine/runs/GraphRunEventPublisher.cjs

@@ -1,69 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.GraphRunEventPublisher = void 0;
-const graph_1 = require("@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.
- */
-class GraphRunEventPublisher {
-    constructor(store, limits = {}) {
-        this.sequences = new Map();
-        this.chains = new Map();
-        this.store = store;
-        this.limits = { ...graph_1.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,
-        };
-    }
-}
-exports.GraphRunEventPublisher = GraphRunEventPublisher;
-//# sourceMappingURL=GraphRunEventPublisher.js.map
-//# sourceMappingURL=GraphRunEventPublisher.cjs.map

package/lib/cjs/graph/engine/runs/GraphRunEventPublisher.cjs.map

@@ -1 +0,0 @@
-{"version":3,"file":"graph/engine/runs/GraphRunEventPublisher.cjs","sourceRoot":"","sources":["graph/engine/runs/GraphRunEventPublisher.js"],"names":[],"mappings":";;;AAAA,yDAA0E;AAC1E;;;;;;GAMG;AACH,MAAa,sBAAsB;IAC/B,YAAY,KAAK,EAAE,MAAM,GAAG,EAAE;QAC1B,IAAI,CAAC,SAAS,GAAG,IAAI,GAAG,EAAE,CAAC;QAC3B,IAAI,CAAC,MAAM,GAAG,IAAI,GAAG,EAAE,CAAC;QACxB,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,MAAM,GAAG,EAAE,GAAG,gCAAwB,EAAE,GAAG,MAAM,EAAE,CAAC;IAC7D,CAAC;IACD;;;OAGG;IACH,KAAK,CAAC,OAAO,CAAC,KAAK;QACf,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,GAAG;YACb,GAAG,KAAK;YACR,OAAO,EAAE,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,OAAO,CAAC;YACzC,QAAQ;YACR,SAAS,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;SACtC,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,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC;QACtG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,EAAE,OAAO,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC,SAAS,CAAC,CAAC,CAAC;QACvD,MAAM,OAAO,CAAC;QACd,OAAO,QAAQ,CAAC;IACpB,CAAC;IACD,gEAAgE;IAChE,YAAY,CAAC,KAAK;QACd,OAAO,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IAC1C,CAAC;IACD,iDAAiD;IACjD,OAAO,CAAC,KAAK;QACT,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QAC7B,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;IAC9B,CAAC;IACD,YAAY,CAAC,OAAO;QAChB,IAAI,OAAO,KAAK,SAAS;YACrB,OAAO,SAAS,CAAC;QACrB,IAAI,UAAU,CAAC;QACf,IAAI,CAAC;YACD,UAAU,GAAG,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC;QACzC,CAAC;QACD,MAAM,CAAC;YACH,OAAO,EAAE,eAAe,EAAE,IAAI,EAAE,CAAC;QACrC,CAAC;QACD,IAAI,UAAU,CAAC,MAAM,IAAI,IAAI,CAAC,MAAM,CAAC,oBAAoB,EAAE,CAAC;YACxD,OAAO,OAAO,CAAC;QACnB,CAAC;QACD,OAAO;YACH,SAAS,EAAE,IAAI;YACf,MAAM,EAAE,iDAAiD;YACzD,KAAK,EAAE,UAAU,CAAC,MAAM;SAC3B,CAAC;IACN,CAAC;CACJ;AAtDD,wDAsDC;AACD,kDAAkD"}