@decaf-ts/integrations 0.10.8 → 0.11.0

package/lib/cjs/graph/engine/pinning/GraphPinningService.cjs

@@ -1,220 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.GraphPinningService = void 0;
-/**
- * @module integrations/graph/pinning/GraphPinningService
- * @summary Service for pinning and unpinning graph node values (DECAF-50 §4.9).
- * @description Computes stable fingerprints, pins/unpins nodes and their
- * upstream dependencies, reads pinned values, and emits pinning events.
- * Pinning is all-or-nothing: if any upstream dependency is not pinnable, the
- * operation fails.
- *
- * Fingerprints derive from the node kind, parameters, bindings, effective
- * inputs, relevant metadata, and configured dependency fingerprints
- * (DECAF-50 §4.9). Presentation-only UI state (node/canvas positions, colors,
- * and every `ui` record) is excluded — moving a node on the canvas never
- * invalidates its pinned value.
- */
-const constants_js_1 = require("./../constants.cjs");
-const GraphPinningError_js_1 = require("./../errors/GraphPinningError.cjs");
-const GraphTopology_js_1 = require("./../planning/GraphTopology.cjs");
-/**
- * Service that manages pinning and unpinning of graph node values.
- */
-class GraphPinningService {
-    constructor(store, policy, dependencyResolver) {
-        this.store = store;
-        this.policy = policy;
-        this.dependencyResolver = dependencyResolver;
-    }
-    /**
-     * Pins a node and all its upstream dependencies.
-     *
-     * @throws {GraphPinningError} when the node or any dependency is not pinnable.
-     */
-    async pinNode(options) {
-        const plan = options.plan;
-        const includeDependencies = options.includeDependencies ?? true;
-        const pinSet = includeDependencies
-            ? this.dependencyResolver.getPinSet(plan, options.nodeId)
-            : new Set([options.nodeId]);
-        // Validate all-or-nothing
-        for (const nodeId of pinSet) {
-            const node = plan.nodes.find((n) => n.id === nodeId);
-            if (!node) {
-                throw new GraphPinningError_js_1.GraphPinningError(`Node '${nodeId}' not found in plan`);
-            }
-            if (!this.policy.canPin(node)) {
-                throw new GraphPinningError_js_1.GraphPinningError(`Node '${nodeId}' is not pinnable`, { nodeId });
-            }
-        }
-        // Pin dependencies first, then the selected node
-        const ordered = this.topologicalOrder(plan, pinSet);
-        for (const nodeId of ordered) {
-            const node = plan.nodes.find((n) => n.id === nodeId);
-            const result = options.result.nodeResults[nodeId];
-            if (!result || !result.outputs) {
-                throw new GraphPinningError_js_1.GraphPinningError(`Node '${nodeId}' has no completed output to pin`);
-            }
-            const inputs = result.inputs ?? {};
-            const depFingerprints = this.dependencyFingerprints(plan, nodeId, options.result);
-            const key = this.createValueKey(options.document.id, node, inputs, depFingerprints);
-            const now = new Date().toISOString();
-            const cached = {
-                key,
-                outputs: result.outputs,
-                pinned: true,
-                createdAt: now,
-                updatedAt: now,
-                metadata: { ...options.result.metadata, nodeId },
-            };
-            await this.store.writeCached(key, cached);
-        }
-    }
-    /**
-     * Unpins a single node (does not unpin dependents in v1).
-     */
-    async unpinNode(options) {
-        const key = {
-            workflowId: options.document.id,
-            nodeId: options.nodeId,
-            fingerprint: options.fingerprint,
-            namespace: options.namespace,
-        };
-        await this.store.deleteCached(key);
-    }
-    /**
-     * Reads a pinned value for a node, returning `undefined` when no valid
-     * pinned value exists.
-     */
-    async readPinnedValue(workflowId, node, inputs, dependencyFingerprints, namespace) {
-        const key = this.createValueKey(workflowId, node, inputs, dependencyFingerprints, namespace);
-        const cached = await this.store.readCached(key);
-        if (cached && cached.pinned) {
-            if (cached.expiresAt && new Date(cached.expiresAt) < new Date()) {
-                return undefined;
-            }
-            return cached;
-        }
-        return undefined;
-    }
-    /**
-     * Creates a stable value key for a node.
-     */
-    createValueKey(workflowId, node, inputs, dependencyFingerprints, namespace) {
-        return {
-            workflowId,
-            nodeId: node.id,
-            fingerprint: this.computeFingerprint(workflowId, node, inputs, dependencyFingerprints),
-            namespace,
-        };
-    }
-    /**
-     * Computes a stable fingerprint for a node (DECAF-50 §4.9).
-     *
-     * The fingerprint derives from the node kind, the instance parameters, the
-     * input bindings, the effective input values, relevant instance metadata,
-     * and the configured dependency fingerprints. Presentation-only UI state is
-     * excluded: the instance `ui` record is never read, and a `ui` key inside
-     * metadata is stripped, so canvas positions and visual settings cannot
-     * affect pinning.
-     */
-    computeFingerprint(workflowId, node, inputs, dependencyFingerprints) {
-        const data = {
-            workflowId,
-            nodeId: node.id,
-            nodeKind: node.kind,
-            parameters: this.stableSerialize(node.instance.parameters ?? {}),
-            inputBindings: this.stableSerialize(node.instance.inputBindings ?? {}),
-            metadata: this.stableSerialize(this.relevantMetadata(node)),
-            inputs: this.stableSerialize(inputs),
-            dependencyFingerprints: this.stableSerialize(dependencyFingerprints),
-        };
-        const json = this.stableSerialize(data);
-        // Use a deterministic non-cryptographic hash that works in both browser
-        // and Node environments without requiring `node:crypto`.
-        return this.simpleHash(json);
-    }
-    /**
-     * Strips presentation-only keys (`ui` and UI-state shapes) from the node's
-     * instance metadata, leaving only pinning-relevant metadata.
-     */
-    relevantMetadata(node) {
-        const metadata = { ...(node.metadata ?? {}) };
-        delete metadata["ui"];
-        delete metadata["position"];
-        delete metadata["visual"];
-        return metadata;
-    }
-    /**
-     * Returns a topological ordering of the given node set.
-     */
-    topologicalOrder(plan, nodeSet) {
-        const result = [];
-        const visited = new Set();
-        const visit = (nodeId) => {
-            if (visited.has(nodeId))
-                return;
-            visited.add(nodeId);
-            const deps = GraphTopology_js_1.GraphTopology.upstreamNodes(nodeId, plan.incomingByNode, false);
-            for (const dep of deps) {
-                if (nodeSet.has(dep))
-                    visit(dep);
-            }
-            result.push(nodeId);
-        };
-        for (const nodeId of nodeSet)
-            visit(nodeId);
-        return result;
-    }
-    /**
-     * Computes fingerprints for all upstream dependencies of a node.
-     */
-    dependencyFingerprints(plan, nodeId, result) {
-        const deps = this.dependencyResolver.getDependencies(plan, nodeId);
-        const fingerprints = {};
-        for (const dep of deps) {
-            const node = plan.nodes.find((n) => n.id === dep);
-            if (node) {
-                const depResult = result.nodeResults[dep];
-                const inputs = depResult?.inputs ?? {};
-                const nestedDeps = this.dependencyFingerprints(plan, dep, result);
-                fingerprints[dep] = this.computeFingerprint(plan.workflowId, node, inputs, nestedDeps);
-            }
-        }
-        return fingerprints;
-    }
-    /**
-     * Serializes a value with recursively sorted keys for stable hashing.
-     */
-    stableSerialize(value) {
-        if (value === null || typeof value !== "object") {
-            return JSON.stringify(value);
-        }
-        if (Array.isArray(value)) {
-            return `[${value.map((v) => this.stableSerialize(v)).join(",")}]`;
-        }
-        const keys = Object.keys(value).sort();
-        const pairs = keys.map((k) => `${JSON.stringify(k)}:${this.stableSerialize(value[k])}`);
-        return `{${pairs.join(",")}}`;
-    }
-    /**
-     * Simple non-cryptographic hash for browser environments where
-     * `node:crypto` is unavailable. Produces a deterministic hex-like string
-     * from the input. This is NOT cryptographically secure but is sufficient
-     * for fingerprint-based cache keys.
-     */
-    simpleHash(str) {
-        let hash = 0;
-        for (let i = 0; i < str.length; i++) {
-            const char = str.charCodeAt(i);
-            hash = (hash << 5) - hash + char;
-            hash |= 0;
-        }
-        return `fp_${Math.abs(hash).toString(16).padStart(8, "0")}_${str.length}`;
-    }
-}
-exports.GraphPinningService = GraphPinningService;
-void constants_js_1.GRAPH_PINNING_METADATA_KEY;
-//# sourceMappingURL=GraphPinningService.js.map
-//# sourceMappingURL=GraphPinningService.cjs.map

package/lib/cjs/graph/engine/pinning/GraphPinningService.cjs.map

@@ -1 +0,0 @@
-{"version":3,"file":"graph/engine/pinning/GraphPinningService.cjs","sourceRoot":"","sources":["graph/engine/pinning/GraphPinningService.js"],"names":[],"mappings":";;;AAAA;;;;;;;;;;;;;GAaG;AACH,oDAA+D;AAC/D,2EAAqE;AACrE,qEAA+D;AAC/D;;GAEG;AACH,MAAa,mBAAmB;IAC5B,YAAY,KAAK,EAAE,MAAM,EAAE,kBAAkB;QACzC,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;QACrB,IAAI,CAAC,kBAAkB,GAAG,kBAAkB,CAAC;IACjD,CAAC;IACD;;;;OAIG;IACH,KAAK,CAAC,OAAO,CAAC,OAAO;QACjB,MAAM,IAAI,GAAG,OAAO,CAAC,IAAI,CAAC;QAC1B,MAAM,mBAAmB,GAAG,OAAO,CAAC,mBAAmB,IAAI,IAAI,CAAC;QAChE,MAAM,MAAM,GAAG,mBAAmB;YAC9B,CAAC,CAAC,IAAI,CAAC,kBAAkB,CAAC,SAAS,CAAC,IAAI,EAAE,OAAO,CAAC,MAAM,CAAC;YACzD,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC;QAChC,0BAA0B;QAC1B,KAAK,MAAM,MAAM,IAAI,MAAM,EAAE,CAAC;YAC1B,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,MAAM,CAAC,CAAC;YACrD,IAAI,CAAC,IAAI,EAAE,CAAC;gBACR,MAAM,IAAI,wCAAiB,CAAC,SAAS,MAAM,qBAAqB,CAAC,CAAC;YACtE,CAAC;YACD,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC;gBAC5B,MAAM,IAAI,wCAAiB,CAAC,SAAS,MAAM,mBAAmB,EAAE,EAAE,MAAM,EAAE,CAAC,CAAC;YAChF,CAAC;QACL,CAAC;QACD,iDAAiD;QACjD,MAAM,OAAO,GAAG,IAAI,CAAC,gBAAgB,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;QACpD,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;YAC3B,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,MAAM,CAAC,CAAC;YACrD,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;YAClD,IAAI,CAAC,MAAM,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC;gBAC7B,MAAM,IAAI,wCAAiB,CAAC,SAAS,MAAM,kCAAkC,CAAC,CAAC;YACnF,CAAC;YACD,MAAM,MAAM,GAAG,MAAM,CAAC,MAAM,IAAI,EAAE,CAAC;YACnC,MAAM,eAAe,GAAG,IAAI,CAAC,sBAAsB,CAAC,IAAI,EAAE,MAAM,EAAE,OAAO,CAAC,MAAM,CAAC,CAAC;YAClF,MAAM,GAAG,GAAG,IAAI,CAAC,cAAc,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,eAAe,CAAC,CAAC;YACpF,MAAM,GAAG,GAAG,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;YACrC,MAAM,MAAM,GAAG;gBACX,GAAG;gBACH,OAAO,EAAE,MAAM,CAAC,OAAO;gBACvB,MAAM,EAAE,IAAI;gBACZ,SAAS,EAAE,GAAG;gBACd,SAAS,EAAE,GAAG;gBACd,QAAQ,EAAE,EAAE,GAAG,OAAO,CAAC,MAAM,CAAC,QAAQ,EAAE,MAAM,EAAE;aACnD,CAAC;YACF,MAAM,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC;QAC9C,CAAC;IACL,CAAC;IACD;;OAEG;IACH,KAAK,CAAC,SAAS,CAAC,OAAO;QACnB,MAAM,GAAG,GAAG;YACR,UAAU,EAAE,OAAO,CAAC,QAAQ,CAAC,EAAE;YAC/B,MAAM,EAAE,OAAO,CAAC,MAAM;YACtB,WAAW,EAAE,OAAO,CAAC,WAAW;YAChC,SAAS,EAAE,OAAO,CAAC,SAAS;SAC/B,CAAC;QACF,MAAM,IAAI,CAAC,KAAK,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC;IACvC,CAAC;IACD;;;OAGG;IACH,KAAK,CAAC,eAAe,CAAC,UAAU,EAAE,IAAI,EAAE,MAAM,EAAE,sBAAsB,EAAE,SAAS;QAC7E,MAAM,GAAG,GAAG,IAAI,CAAC,cAAc,CAAC,UAAU,EAAE,IAAI,EAAE,MAAM,EAAE,sBAAsB,EAAE,SAAS,CAAC,CAAC;QAC7F,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC;QAChD,IAAI,MAAM,IAAI,MAAM,CAAC,MAAM,EAAE,CAAC;YAC1B,IAAI,MAAM,CAAC,SAAS,IAAI,IAAI,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,GAAG,IAAI,IAAI,EAAE,EAAE,CAAC;gBAC9D,OAAO,SAAS,CAAC;YACrB,CAAC;YACD,OAAO,MAAM,CAAC;QAClB,CAAC;QACD,OAAO,SAAS,CAAC;IACrB,CAAC;IACD;;OAEG;IACH,cAAc,CAAC,UAAU,EAAE,IAAI,EAAE,MAAM,EAAE,sBAAsB,EAAE,SAAS;QACtE,OAAO;YACH,UAAU;YACV,MAAM,EAAE,IAAI,CAAC,EAAE;YACf,WAAW,EAAE,IAAI,CAAC,kBAAkB,CAAC,UAAU,EAAE,IAAI,EAAE,MAAM,EAAE,sBAAsB,CAAC;YACtF,SAAS;SACZ,CAAC;IACN,CAAC;IACD;;;;;;;;;OASG;IACH,kBAAkB,CAAC,UAAU,EAAE,IAAI,EAAE,MAAM,EAAE,sBAAsB;QAC/D,MAAM,IAAI,GAAG;YACT,UAAU;YACV,MAAM,EAAE,IAAI,CAAC,EAAE;YACf,QAAQ,EAAE,IAAI,CAAC,IAAI;YACnB,UAAU,EAAE,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC,QAAQ,CAAC,UAAU,IAAI,EAAE,CAAC;YAChE,aAAa,EAAE,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC,QAAQ,CAAC,aAAa,IAAI,EAAE,CAAC;YACtE,QAAQ,EAAE,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,CAAC;YAC3D,MAAM,EAAE,IAAI,CAAC,eAAe,CAAC,MAAM,CAAC;YACpC,sBAAsB,EAAE,IAAI,CAAC,eAAe,CAAC,sBAAsB,CAAC;SACvE,CAAC;QACF,MAAM,IAAI,GAAG,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC,CAAC;QACxC,wEAAwE;QACxE,yDAAyD;QACzD,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;IACjC,CAAC;IACD;;;OAGG;IACH,gBAAgB,CAAC,IAAI;QACjB,MAAM,QAAQ,GAAG,EAAE,GAAG,CAAC,IAAI,CAAC,QAAQ,IAAI,EAAE,CAAC,EAAE,CAAC;QAC9C,OAAO,QAAQ,CAAC,IAAI,CAAC,CAAC;QACtB,OAAO,QAAQ,CAAC,UAAU,CAAC,CAAC;QAC5B,OAAO,QAAQ,CAAC,QAAQ,CAAC,CAAC;QAC1B,OAAO,QAAQ,CAAC;IACpB,CAAC;IACD;;OAEG;IACH,gBAAgB,CAAC,IAAI,EAAE,OAAO;QAC1B,MAAM,MAAM,GAAG,EAAE,CAAC;QAClB,MAAM,OAAO,GAAG,IAAI,GAAG,EAAE,CAAC;QAC1B,MAAM,KAAK,GAAG,CAAC,MAAM,EAAE,EAAE;YACrB,IAAI,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC;gBACnB,OAAO;YACX,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YACpB,MAAM,IAAI,GAAG,gCAAa,CAAC,aAAa,CAAC,MAAM,EAAE,IAAI,CAAC,cAAc,EAAE,KAAK,CAAC,CAAC;YAC7E,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;gBACrB,IAAI,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC;oBAChB,KAAK,CAAC,GAAG,CAAC,CAAC;YACnB,CAAC;YACD,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACxB,CAAC,CAAC;QACF,KAAK,MAAM,MAAM,IAAI,OAAO;YACxB,KAAK,CAAC,MAAM,CAAC,CAAC;QAClB,OAAO,MAAM,CAAC;IAClB,CAAC;IACD;;OAEG;IACH,sBAAsB,CAAC,IAAI,EAAE,MAAM,EAAE,MAAM;QACvC,MAAM,IAAI,GAAG,IAAI,CAAC,kBAAkB,CAAC,eAAe,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;QACnE,MAAM,YAAY,GAAG,EAAE,CAAC;QACxB,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;YACrB,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,GAAG,CAAC,CAAC;YAClD,IAAI,IAAI,EAAE,CAAC;gBACP,MAAM,SAAS,GAAG,MAAM,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC;gBAC1C,MAAM,MAAM,GAAG,SAAS,EAAE,MAAM,IAAI,EAAE,CAAC;gBACvC,MAAM,UAAU,GAAG,IAAI,CAAC,sBAAsB,CAAC,IAAI,EAAE,GAAG,EAAE,MAAM,CAAC,CAAC;gBAClE,YAAY,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,kBAAkB,CAAC,IAAI,CAAC,UAAU,EAAE,IAAI,EAAE,MAAM,EAAE,UAAU,CAAC,CAAC;YAC3F,CAAC;QACL,CAAC;QACD,OAAO,YAAY,CAAC;IACxB,CAAC;IACD;;OAEG;IACH,eAAe,CAAC,KAAK;QACjB,IAAI,KAAK,KAAK,IAAI,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE,CAAC;YAC9C,OAAO,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;QACjC,CAAC;QACD,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;YACvB,OAAO,IAAI,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;QACtE,CAAC;QACD,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,IAAI,EAAE,CAAC;QACvC,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,eAAe,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QACxF,OAAO,IAAI,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;IAClC,CAAC;IACD;;;;;OAKG;IACH,UAAU,CAAC,GAAG;QACV,IAAI,IAAI,GAAG,CAAC,CAAC;QACb,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAClC,MAAM,IAAI,GAAG,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;YAC/B,IAAI,GAAG,CAAC,IAAI,IAAI,CAAC,CAAC,GAAG,IAAI,GAAG,IAAI,CAAC;YACjC,IAAI,IAAI,CAAC,CAAC;QACd,CAAC;QACD,OAAO,MAAM,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,EAAE,GAAG,CAAC,IAAI,GAAG,CAAC,MAAM,EAAE,CAAC;IAC9E,CAAC;CACJ;AAhMD,kDAgMC;AACD,KAAK,yCAA0B,CAAC;AAChC,+CAA+C"}

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

@@ -1,27 +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/pinning
- * @summary Graph pinning subsystem.
- * @description Re-exports the pinning metadata, policy, dependency resolver, and service.
- */
-__exportStar(require("./GraphPinningMetadata.cjs"), exports);
-__exportStar(require("./GraphPinningPolicy.cjs"), exports);
-__exportStar(require("./GraphPinningDependencyResolver.cjs"), exports);
-__exportStar(require("./GraphPinningService.cjs"), exports);
-//# sourceMappingURL=index.js.map
-//# sourceMappingURL=index.cjs.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"graph/engine/pinning/index.cjs","sourceRoot":"","sources":["graph/engine/pinning/index.js"],"names":[],"mappings":";;;;;;;;;;;;;;;;AAAA;;;;GAIG;AACH,4DAA0C;AAC1C,0DAAwC;AACxC,sEAAoD;AACpD,2DAAyC;AACzC,iCAAiC"}

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