@decaf-ts/integrations 0.3.1 → 0.3.2

package/lib/esm/graph/loops/GraphConditionEvaluator.js

@@ -0,0 +1,58 @@
+import { GraphConditionType } from "./../constants.js";
+import { GraphExecutionError } from "./../errors/GraphExecutionError.js";
+/**
+ * Evaluates loop conditions using built-in comparison types.
+ */
+export class GraphConditionEvaluator {
+    /**
+     * Evaluates a condition against the given state.
+     *
+     * @param condition - The condition definition.
+     * @param state - The current loop state.
+     * @returns `true` when the condition passes.
+     */
+    evaluate(condition, state) {
+        const left = this.resolveValue(condition.left, state);
+        const right = condition.right;
+        switch (condition.type) {
+            case GraphConditionType.TRUTHY:
+                return !!left;
+            case GraphConditionType.FALSY:
+                return !left;
+            case GraphConditionType.EQUALS:
+                return left === right;
+            case GraphConditionType.NOT_EQUALS:
+                return left !== right;
+            case GraphConditionType.GREATER_THAN:
+                return Number(left) > Number(right);
+            case GraphConditionType.GREATER_THAN_OR_EQUAL:
+                return Number(left) >= Number(right);
+            case GraphConditionType.LESS_THAN:
+                return Number(left) < Number(right);
+            case GraphConditionType.LESS_THAN_OR_EQUAL:
+                return Number(left) <= Number(right);
+            case GraphConditionType.EXISTS:
+                return left !== undefined && left !== null;
+            case GraphConditionType.CUSTOM:
+                throw new GraphExecutionError("Custom condition evaluators are not supported in v1", "GRAPH_CUSTOM_CONDITION_UNSUPPORTED");
+            default:
+                throw new GraphExecutionError(`Unknown condition type '${condition.type}'`, "GRAPH_UNKNOWN_CONDITION_TYPE", { condition });
+        }
+    }
+    /**
+     * Resolves a value that may be a dotted path into the state object.
+     */
+    resolveValue(path, state) {
+        if (!path)
+            return state;
+        const parts = path.split(".");
+        let current = state;
+        for (const part of parts) {
+            if (current == null)
+                return undefined;
+            current = current[part];
+        }
+        return current;
+    }
+}
+//# sourceMappingURL=GraphConditionEvaluator.js.map

package/lib/esm/graph/loops/GraphConditionEvaluator.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"GraphConditionEvaluator.js","sourceRoot":"","sources":["../../../../src/graph/loops/GraphConditionEvaluator.ts"],"names":[],"mappings":"AAMA,OAAO,EAAE,kBAAkB,EAAE,0BAAqB;AAClD,OAAO,EAAE,mBAAmB,EAAE,2CAAsC;AAEpE;;GAEG;AACH,MAAM,OAAO,uBAAuB;IAClC;;;;;;OAMG;IACH,QAAQ,CAAC,SAAmC,EAAE,KAAc;QAC1D,MAAM,IAAI,GAAG,IAAI,CAAC,YAAY,CAAC,SAAS,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;QACtD,MAAM,KAAK,GAAG,SAAS,CAAC,KAAK,CAAC;QAE9B,QAAQ,SAAS,CAAC,IAAI,EAAE,CAAC;YACvB,KAAK,kBAAkB,CAAC,MAAM;gBAC5B,OAAO,CAAC,CAAC,IAAI,CAAC;YAChB,KAAK,kBAAkB,CAAC,KAAK;gBAC3B,OAAO,CAAC,IAAI,CAAC;YACf,KAAK,kBAAkB,CAAC,MAAM;gBAC5B,OAAO,IAAI,KAAK,KAAK,CAAC;YACxB,KAAK,kBAAkB,CAAC,UAAU;gBAChC,OAAO,IAAI,KAAK,KAAK,CAAC;YACxB,KAAK,kBAAkB,CAAC,YAAY;gBAClC,OAAO,MAAM,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC;YACtC,KAAK,kBAAkB,CAAC,qBAAqB;gBAC3C,OAAO,MAAM,CAAC,IAAI,CAAC,IAAI,MAAM,CAAC,KAAK,CAAC,CAAC;YACvC,KAAK,kBAAkB,CAAC,SAAS;gBAC/B,OAAO,MAAM,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC;YACtC,KAAK,kBAAkB,CAAC,kBAAkB;gBACxC,OAAO,MAAM,CAAC,IAAI,CAAC,IAAI,MAAM,CAAC,KAAK,CAAC,CAAC;YACvC,KAAK,kBAAkB,CAAC,MAAM;gBAC5B,OAAO,IAAI,KAAK,SAAS,IAAI,IAAI,KAAK,IAAI,CAAC;YAC7C,KAAK,kBAAkB,CAAC,MAAM;gBAC5B,MAAM,IAAI,mBAAmB,CAC3B,qDAAqD,EACrD,oCAAoC,CACrC,CAAC;YACJ;gBACE,MAAM,IAAI,mBAAmB,CAC3B,2BAA2B,SAAS,CAAC,IAAI,GAAG,EAC5C,8BAA8B,EAC9B,EAAE,SAAS,EAAE,CACd,CAAC;QACN,CAAC;IACH,CAAC;IAED;;OAEG;IACK,YAAY,CAAC,IAAwB,EAAE,KAAc;QAC3D,IAAI,CAAC,IAAI;YAAE,OAAO,KAAK,CAAC;QACxB,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;QAC9B,IAAI,OAAO,GAAY,KAAK,CAAC;QAC7B,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,IAAI,OAAO,IAAI,IAAI;gBAAE,OAAO,SAAS,CAAC;YACtC,OAAO,GAAI,OAAmC,CAAC,IAAI,CAAC,CAAC;QACvD,CAAC;QACD,OAAO,OAAO,CAAC;IACjB,CAAC;CACF"}

package/lib/esm/graph/loops/GraphLoopExecutionContext.js

@@ -0,0 +1,11 @@
+/**
+ * Context for a single loop execution, carrying the loop metadata and
+ * current iteration index.
+ */
+export class GraphLoopExecutionContext {
+    constructor(iteration, metadata) {
+        this.iteration = iteration;
+        this.metadata = metadata;
+    }
+}
+//# sourceMappingURL=GraphLoopExecutionContext.js.map

package/lib/esm/graph/loops/GraphLoopExecutionContext.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"GraphLoopExecutionContext.js","sourceRoot":"","sources":["../../../../src/graph/loops/GraphLoopExecutionContext.ts"],"names":[],"mappings":"AAOA;;;GAGG;AACH,MAAM,OAAO,yBAAyB;IAIpC,YAAY,SAAiB,EAAE,QAA2B;QACxD,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC;QAC3B,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;IAC3B,CAAC;CACF"}

package/lib/esm/graph/loops/UntilGraphNodeExecutor.js

@@ -0,0 +1,71 @@
+import { GRAPH_DEFAULT_MAX_LOOP_ITERATIONS, GraphExecutionEventType } from "./../constants.js";
+import { GraphInputError } from "./../errors/GraphInputError.js";
+import { GraphLoopLimitError } from "./../errors/GraphLoopLimitError.js";
+import { GraphConditionEvaluator } from "./GraphConditionEvaluator.js";
+/**
+ * Executor for `core.loop.until` nodes.
+ *
+ * Executes the body at least once, then checks the condition. Repeats until
+ * the condition evaluates to true.
+ */
+export class UntilGraphNodeExecutor {
+    constructor(engine) {
+        this.engine = engine;
+        this.evaluator = new GraphConditionEvaluator();
+    }
+    async execute(input, context) {
+        const metadata = this.extractMetadata(context);
+        const maxIterations = metadata.maxIterations ?? GRAPH_DEFAULT_MAX_LOOP_ITERATIONS;
+        const condition = metadata.condition;
+        if (!condition) {
+            throw new GraphInputError("until node is missing a condition");
+        }
+        const statePort = metadata.statePort ?? "state";
+        const bodyWorkflow = metadata.body;
+        let state = input.state;
+        let iteration = 0;
+        await context.emit({ type: GraphExecutionEventType.LOOP_STARTED });
+        let shouldStop = false;
+        do {
+            if (iteration >= maxIterations) {
+                await context.emit({
+                    type: GraphExecutionEventType.LOOP_LIMIT_REACHED,
+                    iteration,
+                });
+                throw new GraphLoopLimitError(`until loop exceeded max iterations (${maxIterations})`);
+            }
+            await context.emit({
+                type: GraphExecutionEventType.LOOP_ITERATION_STARTED,
+                iteration,
+            });
+            const childResult = await this.engine.execute(bodyWorkflow, { [statePort]: state, iteration }, {
+                parentRunId: context.runId,
+                path: [...context.path, `iteration:${iteration}`],
+            });
+            state = childResult.outputs[statePort];
+            await context.emit({
+                type: GraphExecutionEventType.LOOP_ITERATION_COMPLETED,
+                iteration,
+            });
+            const conditionResult = this.evaluator.evaluate(condition, state);
+            await context.emit({
+                type: GraphExecutionEventType.LOOP_CONDITION_EVALUATED,
+                iteration,
+                payload: { result: conditionResult },
+            });
+            iteration++;
+            shouldStop = conditionResult;
+        } while (!shouldStop);
+        await context.emit({ type: GraphExecutionEventType.LOOP_COMPLETED });
+        return { [statePort]: state, iterations: iteration };
+    }
+    extractMetadata(context) {
+        const raw = context.node.graph?.metadata?.loop ??
+            context.metadata?.loop;
+        if (!raw) {
+            throw new GraphInputError("until node is missing loop metadata");
+        }
+        return raw;
+    }
+}
+//# sourceMappingURL=UntilGraphNodeExecutor.js.map

package/lib/esm/graph/loops/UntilGraphNodeExecutor.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"UntilGraphNodeExecutor.js","sourceRoot":"","sources":["../../../../src/graph/loops/UntilGraphNodeExecutor.ts"],"names":[],"mappings":"AAWA,OAAO,EAAE,iCAAiC,EAAE,uBAAuB,EAAE,0BAAqB;AAC1F,OAAO,EAAE,eAAe,EAAE,uCAAkC;AAC5D,OAAO,EAAE,mBAAmB,EAAE,2CAAsC;AACpE,OAAO,EAAE,uBAAuB,EAAE,qCAAkC;AAEpE;;;;;GAKG;AACH,MAAM,OAAO,sBAAsB;IAGjC,YAA6B,MAA4B;QAA5B,WAAM,GAAN,MAAM,CAAsB;QAFxC,cAAS,GAAG,IAAI,uBAAuB,EAAE,CAAC;IAEC,CAAC;IAE7D,KAAK,CAAC,OAAO,CACX,KAA2B,EAC3B,OAA8B;QAE9B,MAAM,QAAQ,GAAG,IAAI,CAAC,eAAe,CAAC,OAAO,CAAC,CAAC;QAC/C,MAAM,aAAa,GACjB,QAAQ,CAAC,aAAa,IAAI,iCAAiC,CAAC;QAC9D,MAAM,SAAS,GAAG,QAAQ,CAAC,SAAS,CAAC;QACrC,IAAI,CAAC,SAAS,EAAE,CAAC;YACf,MAAM,IAAI,eAAe,CAAC,mCAAmC,CAAC,CAAC;QACjE,CAAC;QACD,MAAM,SAAS,GAAG,QAAQ,CAAC,SAAS,IAAI,OAAO,CAAC;QAChD,MAAM,YAAY,GAAG,QAAQ,CAAC,IAA+B,CAAC;QAE9D,IAAI,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC;QACxB,IAAI,SAAS,GAAG,CAAC,CAAC;QAElB,MAAM,OAAO,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,uBAAuB,CAAC,YAAY,EAAE,CAAC,CAAC;QAEnE,IAAI,UAAU,GAAG,KAAK,CAAC;QAEvB,GAAG,CAAC;YACF,IAAI,SAAS,IAAI,aAAa,EAAE,CAAC;gBAC/B,MAAM,OAAO,CAAC,IAAI,CAAC;oBACjB,IAAI,EAAE,uBAAuB,CAAC,kBAAkB;oBAChD,SAAS;iBACV,CAAC,CAAC;gBACH,MAAM,IAAI,mBAAmB,CAC3B,uCAAuC,aAAa,GAAG,CACxD,CAAC;YACJ,CAAC;YAED,MAAM,OAAO,CAAC,IAAI,CAAC;gBACjB,IAAI,EAAE,uBAAuB,CAAC,sBAAsB;gBACpD,SAAS;aACV,CAAC,CAAC;YAEH,MAAM,WAAW,GAAG,MAAM,IAAI,CAAC,MAAM,CAAC,OAAO,CAC3C,YAAY,EACZ,EAAE,CAAC,SAAS,CAAC,EAAE,KAAK,EAAE,SAAS,EAAE,EACjC;gBACE,WAAW,EAAE,OAAO,CAAC,KAAK;gBAC1B,IAAI,EAAE,CAAC,GAAG,OAAO,CAAC,IAAI,EAAE,aAAa,SAAS,EAAE,CAAC;aAClD,CACF,CAAC;YAEF,KAAK,GAAG,WAAW,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;YAEvC,MAAM,OAAO,CAAC,IAAI,CAAC;gBACjB,IAAI,EAAE,uBAAuB,CAAC,wBAAwB;gBACtD,SAAS;aACV,CAAC,CAAC;YAEH,MAAM,eAAe,GAAG,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,SAAS,EAAE,KAAK,CAAC,CAAC;YAElE,MAAM,OAAO,CAAC,IAAI,CAAC;gBACjB,IAAI,EAAE,uBAAuB,CAAC,wBAAwB;gBACtD,SAAS;gBACT,OAAO,EAAE,EAAE,MAAM,EAAE,eAAe,EAAE;aACrC,CAAC,CAAC;YAEH,SAAS,EAAE,CAAC;YACZ,UAAU,GAAG,eAAe,CAAC;QAC/B,CAAC,QAAQ,CAAC,UAAU,EAAE;QAEtB,MAAM,OAAO,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,uBAAuB,CAAC,cAAc,EAAE,CAAC,CAAC;QAErE,OAAO,EAAE,CAAC,SAAS,CAAC,EAAE,KAAK,EAAE,UAAU,EAAE,SAAS,EAAE,CAAC;IACvD,CAAC;IAEO,eAAe,CAAC,OAA8B;QACpD,MAAM,GAAG,GAAI,OAAO,CAAC,IAAY,CAAC,KAAK,EAAE,QAAQ,EAAE,IAAI;YACpD,OAAO,CAAC,QAAgB,EAAE,IAAI,CAAC;QAClC,IAAI,CAAC,GAAG,EAAE,CAAC;YACT,MAAM,IAAI,eAAe,CAAC,qCAAqC,CAAC,CAAC;QACnE,CAAC;QACD,OAAO,GAAwB,CAAC;IAClC,CAAC;CACF"}

package/lib/esm/graph/loops/WhileGraphNodeExecutor.js

@@ -0,0 +1,72 @@
+import { GRAPH_DEFAULT_MAX_LOOP_ITERATIONS, GraphExecutionEventType } from "./../constants.js";
+import { GraphInputError } from "./../errors/GraphInputError.js";
+import { GraphLoopLimitError } from "./../errors/GraphLoopLimitError.js";
+import { GraphConditionEvaluator } from "./GraphConditionEvaluator.js";
+/**
+ * Executor for `core.loop.while` nodes.
+ *
+ * Expects input:
+ * - `state`: initial state
+ *
+ * Produces output:
+ * - `state`: final state
+ * - `iterations`: number of iterations executed
+ */
+export class WhileGraphNodeExecutor {
+    constructor(engine) {
+        this.engine = engine;
+        this.evaluator = new GraphConditionEvaluator();
+    }
+    async execute(input, context) {
+        const metadata = this.extractMetadata(context);
+        const maxIterations = metadata.maxIterations ?? GRAPH_DEFAULT_MAX_LOOP_ITERATIONS;
+        const condition = metadata.condition;
+        if (!condition) {
+            throw new GraphInputError("while node is missing a condition");
+        }
+        const statePort = metadata.statePort ?? "state";
+        const bodyWorkflow = metadata.body;
+        let state = input.state;
+        let iteration = 0;
+        await context.emit({ type: GraphExecutionEventType.LOOP_STARTED });
+        while (this.evaluator.evaluate(condition, state)) {
+            if (iteration >= maxIterations) {
+                await context.emit({
+                    type: GraphExecutionEventType.LOOP_LIMIT_REACHED,
+                    iteration,
+                });
+                throw new GraphLoopLimitError(`while loop exceeded max iterations (${maxIterations})`);
+            }
+            await context.emit({
+                type: GraphExecutionEventType.LOOP_CONDITION_EVALUATED,
+                iteration,
+                payload: { result: true },
+            });
+            await context.emit({
+                type: GraphExecutionEventType.LOOP_ITERATION_STARTED,
+                iteration,
+            });
+            const childResult = await this.engine.execute(bodyWorkflow, { [statePort]: state, iteration }, {
+                parentRunId: context.runId,
+                path: [...context.path, `iteration:${iteration}`],
+            });
+            state = childResult.outputs[statePort];
+            await context.emit({
+                type: GraphExecutionEventType.LOOP_ITERATION_COMPLETED,
+                iteration,
+            });
+            iteration++;
+        }
+        await context.emit({ type: GraphExecutionEventType.LOOP_COMPLETED });
+        return { [statePort]: state, iterations: iteration };
+    }
+    extractMetadata(context) {
+        const raw = context.node.graph?.metadata?.loop ??
+            context.metadata?.loop;
+        if (!raw) {
+            throw new GraphInputError("while node is missing loop metadata");
+        }
+        return raw;
+    }
+}
+//# sourceMappingURL=WhileGraphNodeExecutor.js.map

package/lib/esm/graph/loops/WhileGraphNodeExecutor.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"WhileGraphNodeExecutor.js","sourceRoot":"","sources":["../../../../src/graph/loops/WhileGraphNodeExecutor.ts"],"names":[],"mappings":"AAWA,OAAO,EAAE,iCAAiC,EAAE,uBAAuB,EAAE,0BAAqB;AAC1F,OAAO,EAAE,eAAe,EAAE,uCAAkC;AAC5D,OAAO,EAAE,mBAAmB,EAAE,2CAAsC;AACpE,OAAO,EAAE,uBAAuB,EAAE,qCAAkC;AAEpE;;;;;;;;;GASG;AACH,MAAM,OAAO,sBAAsB;IAGjC,YAA6B,MAA4B;QAA5B,WAAM,GAAN,MAAM,CAAsB;QAFxC,cAAS,GAAG,IAAI,uBAAuB,EAAE,CAAC;IAEC,CAAC;IAE7D,KAAK,CAAC,OAAO,CACX,KAA2B,EAC3B,OAA8B;QAE9B,MAAM,QAAQ,GAAG,IAAI,CAAC,eAAe,CAAC,OAAO,CAAC,CAAC;QAC/C,MAAM,aAAa,GACjB,QAAQ,CAAC,aAAa,IAAI,iCAAiC,CAAC;QAC9D,MAAM,SAAS,GAAG,QAAQ,CAAC,SAAS,CAAC;QACrC,IAAI,CAAC,SAAS,EAAE,CAAC;YACf,MAAM,IAAI,eAAe,CAAC,mCAAmC,CAAC,CAAC;QACjE,CAAC;QACD,MAAM,SAAS,GAAG,QAAQ,CAAC,SAAS,IAAI,OAAO,CAAC;QAChD,MAAM,YAAY,GAAG,QAAQ,CAAC,IAA+B,CAAC;QAE9D,IAAI,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC;QACxB,IAAI,SAAS,GAAG,CAAC,CAAC;QAElB,MAAM,OAAO,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,uBAAuB,CAAC,YAAY,EAAE,CAAC,CAAC;QAEnE,OAAO,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,SAAS,EAAE,KAAK,CAAC,EAAE,CAAC;YACjD,IAAI,SAAS,IAAI,aAAa,EAAE,CAAC;gBAC/B,MAAM,OAAO,CAAC,IAAI,CAAC;oBACjB,IAAI,EAAE,uBAAuB,CAAC,kBAAkB;oBAChD,SAAS;iBACV,CAAC,CAAC;gBACH,MAAM,IAAI,mBAAmB,CAC3B,uCAAuC,aAAa,GAAG,CACxD,CAAC;YACJ,CAAC;YAED,MAAM,OAAO,CAAC,IAAI,CAAC;gBACjB,IAAI,EAAE,uBAAuB,CAAC,wBAAwB;gBACtD,SAAS;gBACT,OAAO,EAAE,EAAE,MAAM,EAAE,IAAI,EAAE;aAC1B,CAAC,CAAC;YACH,MAAM,OAAO,CAAC,IAAI,CAAC;gBACjB,IAAI,EAAE,uBAAuB,CAAC,sBAAsB;gBACpD,SAAS;aACV,CAAC,CAAC;YAEH,MAAM,WAAW,GAAG,MAAM,IAAI,CAAC,MAAM,CAAC,OAAO,CAC3C,YAAY,EACZ,EAAE,CAAC,SAAS,CAAC,EAAE,KAAK,EAAE,SAAS,EAAE,EACjC;gBACE,WAAW,EAAE,OAAO,CAAC,KAAK;gBAC1B,IAAI,EAAE,CAAC,GAAG,OAAO,CAAC,IAAI,EAAE,aAAa,SAAS,EAAE,CAAC;aAClD,CACF,CAAC;YAEF,KAAK,GAAG,WAAW,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;YAEvC,MAAM,OAAO,CAAC,IAAI,CAAC;gBACjB,IAAI,EAAE,uBAAuB,CAAC,wBAAwB;gBACtD,SAAS;aACV,CAAC,CAAC;YAEH,SAAS,EAAE,CAAC;QACd,CAAC;QAED,MAAM,OAAO,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,uBAAuB,CAAC,cAAc,EAAE,CAAC,CAAC;QAErE,OAAO,EAAE,CAAC,SAAS,CAAC,EAAE,KAAK,EAAE,UAAU,EAAE,SAAS,EAAE,CAAC;IACvD,CAAC;IAEO,eAAe,CAAC,OAA8B;QACpD,MAAM,GAAG,GAAI,OAAO,CAAC,IAAY,CAAC,KAAK,EAAE,QAAQ,EAAE,IAAI;YACpD,OAAO,CAAC,QAAgB,EAAE,IAAI,CAAC;QAClC,IAAI,CAAC,GAAG,EAAE,CAAC;YACT,MAAM,IAAI,eAAe,CAAC,qCAAqC,CAAC,CAAC;QACnE,CAAC;QACD,OAAO,GAAwB,CAAC;IAClC,CAAC;CACF"}

package/lib/esm/graph/loops/index.js

@@ -0,0 +1,11 @@
+/**
+ * @module integrations/graph/loops
+ * @summary Structured loop executors.
+ * @description Re-exports the condition evaluator, loop execution context, and foreach/while/until executors.
+ */
+export * from "./GraphConditionEvaluator.js";
+export * from "./GraphLoopExecutionContext.js";
+export * from "./ForeachGraphNodeExecutor.js";
+export * from "./WhileGraphNodeExecutor.js";
+export * from "./UntilGraphNodeExecutor.js";
+//# sourceMappingURL=index.js.map

package/lib/esm/graph/loops/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../../src/graph/loops/index.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AACH,6CAA0C;AAC1C,+CAA4C;AAC5C,8CAA2C;AAC3C,4CAAyC;AACzC,4CAAyC"}

package/lib/esm/graph/pinning/GraphPinningDependencyResolver.js

@@ -0,0 +1,23 @@
+import { GraphTopology } from "./../planning/GraphTopology.js";
+/**
+ * Resolves the upstream dependency subtree of a node for pinning operations.
+ */
+export class GraphPinningDependencyResolver {
+    /**
+     * Returns the set of upstream node ids that the given node depends on,
+     * excluding the workflow boundary.
+     */
+    getDependencies(plan, nodeId) {
+        return GraphTopology.upstreamNodes(nodeId, plan.incomingByNode, false);
+    }
+    /**
+     * Returns the full set of node ids to pin: the node itself plus all its
+     * upstream dependencies.
+     */
+    getPinSet(plan, nodeId) {
+        const deps = this.getDependencies(plan, nodeId);
+        deps.add(nodeId);
+        return deps;
+    }
+}
+//# sourceMappingURL=GraphPinningDependencyResolver.js.map

package/lib/esm/graph/pinning/GraphPinningDependencyResolver.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"GraphPinningDependencyResolver.js","sourceRoot":"","sources":["../../../../src/graph/pinning/GraphPinningDependencyResolver.ts"],"names":[],"mappings":"AAMA,OAAO,EAAE,aAAa,EAAE,uCAAkC;AAE1D;;GAEG;AACH,MAAM,OAAO,8BAA8B;IACzC;;;OAGG;IACH,eAAe,CAAC,IAAwB,EAAE,MAAc;QACtD,OAAO,aAAa,CAAC,aAAa,CAChC,MAAM,EACN,IAAI,CAAC,cAAc,EACnB,KAAK,CACN,CAAC;IACJ,CAAC;IAED;;;OAGG;IACH,SAAS,CAAC,IAAwB,EAAE,MAAc;QAChD,MAAM,IAAI,GAAG,IAAI,CAAC,eAAe,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;QAChD,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACjB,OAAO,IAAI,CAAC;IACd,CAAC;CACF"}

package/lib/esm/graph/pinning/GraphPinningMetadata.js

@@ -0,0 +1,15 @@
+/**
+ * Default pinning metadata applied when `@pinnable()` is used without options.
+ */
+export const DEFAULT_PINNING_METADATA = {
+    enabled: true,
+    strategy: "manual",
+    includeDependencies: true,
+};
+/**
+ * Returns `true` when the given metadata allows pinning.
+ */
+export function isPinnable(metadata) {
+    return metadata?.enabled === true && metadata.strategy !== "disabled";
+}
+//# sourceMappingURL=GraphPinningMetadata.js.map

package/lib/esm/graph/pinning/GraphPinningMetadata.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"GraphPinningMetadata.js","sourceRoot":"","sources":["../../../../src/graph/pinning/GraphPinningMetadata.ts"],"names":[],"mappings":"AAOA;;GAEG;AACH,MAAM,CAAC,MAAM,wBAAwB,GAAyB;IAC5D,OAAO,EAAE,IAAI;IACb,QAAQ,EAAE,QAAQ;IAClB,mBAAmB,EAAE,IAAI;CAC1B,CAAC;AAEF;;GAEG;AACH,MAAM,UAAU,UAAU,CAAC,QAA0C;IACnE,OAAO,QAAQ,EAAE,OAAO,KAAK,IAAI,IAAI,QAAQ,CAAC,QAAQ,KAAK,UAAU,CAAC;AACxE,CAAC"}

package/lib/esm/graph/pinning/GraphPinningPolicy.js

@@ -0,0 +1,29 @@
+import { DEFAULT_PINNING_METADATA, isPinnable } from "./GraphPinningMetadata.js";
+/**
+ * Policy that decides pinning behaviour for a plan node.
+ */
+export class GraphPinningPolicy {
+    /** Returns whether the node is allowed to be pinned. */
+    canPin(node) {
+        return isPinnable(this.getPinningMetadata(node));
+    }
+    /** Returns whether the engine should attempt to use a pinned value for the node. */
+    shouldUsePinnedValue(node) {
+        const metadata = this.getPinningMetadata(node);
+        return metadata.enabled === true && metadata.strategy !== "disabled";
+    }
+    /** Returns whether automatic pinning should occur after execution. */
+    shouldAutoPin(node) {
+        const metadata = this.getPinningMetadata(node);
+        return metadata.enabled === true && metadata.strategy === "automatic";
+    }
+    /** Extracts pinning metadata from a plan node. */
+    getPinningMetadata(node) {
+        const raw = node.definition?.graph?.metadata?.pinnable ??
+            node.metadata?.pinnable;
+        return raw
+            ? { ...DEFAULT_PINNING_METADATA, ...raw }
+            : { ...DEFAULT_PINNING_METADATA, enabled: false };
+    }
+}
+//# sourceMappingURL=GraphPinningPolicy.js.map

package/lib/esm/graph/pinning/GraphPinningPolicy.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"GraphPinningPolicy.js","sourceRoot":"","sources":["../../../../src/graph/pinning/GraphPinningPolicy.ts"],"names":[],"mappings":"AAOA,OAAO,EAAE,wBAAwB,EAAE,UAAU,EAAE,kCAA+B;AAE9E;;GAEG;AACH,MAAM,OAAO,kBAAkB;IAC7B,wDAAwD;IACxD,MAAM,CAAC,IAA4B;QACjC,OAAO,UAAU,CAAC,IAAI,CAAC,kBAAkB,CAAC,IAAI,CAAC,CAAC,CAAC;IACnD,CAAC;IAED,oFAAoF;IACpF,oBAAoB,CAAC,IAA4B;QAC/C,MAAM,QAAQ,GAAG,IAAI,CAAC,kBAAkB,CAAC,IAAI,CAAC,CAAC;QAC/C,OAAO,QAAQ,CAAC,OAAO,KAAK,IAAI,IAAI,QAAQ,CAAC,QAAQ,KAAK,UAAU,CAAC;IACvE,CAAC;IAED,sEAAsE;IACtE,aAAa,CAAC,IAA4B;QACxC,MAAM,QAAQ,GAAG,IAAI,CAAC,kBAAkB,CAAC,IAAI,CAAC,CAAC;QAC/C,OAAO,QAAQ,CAAC,OAAO,KAAK,IAAI,IAAI,QAAQ,CAAC,QAAQ,KAAK,WAAW,CAAC;IACxE,CAAC;IAED,kDAAkD;IAClD,kBAAkB,CAAC,IAA4B;QAC7C,MAAM,GAAG,GACN,IAAI,CAAC,UAAkB,EAAE,KAAK,EAAE,QAAQ,EAAE,QAAQ;YAClD,IAAI,CAAC,QAAgB,EAAE,QAAQ,CAAC;QACnC,OAAO,GAAG;YACR,CAAC,CAAC,EAAE,GAAG,wBAAwB,EAAE,GAAG,GAAG,EAAE;YACzC,CAAC,CAAC,EAAE,GAAG,wBAAwB,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC;IACtD,CAAC;CACF"}

package/lib/esm/graph/pinning/GraphPinningService.js

@@ -0,0 +1,186 @@
+/**
+ * @module integrations/graph/pinning/GraphPinningService
+ * @summary Service for pinning and unpinning graph node values.
+ * @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.
+ */
+import { GRAPH_PINNING_METADATA_KEY } from "./../constants.js";
+import { GraphPinningError } from "./../errors/GraphPinningError.js";
+import { GraphTopology } from "./../planning/GraphTopology.js";
+/**
+ * Service that manages pinning and unpinning of graph node values.
+ */
+export 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(`Node '${nodeId}' not found in plan`);
+            }
+            if (!this.policy.canPin(node)) {
+                throw new 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(`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.workflow, node, inputs, depFingerprints, options.namespace);
+            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.workflow.name,
+            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(workflow, node, inputs, dependencyFingerprints, namespace) {
+        const key = this.createValueKey(workflow, 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(workflow, node, inputs, dependencyFingerprints, namespace) {
+        return {
+            workflowId: workflow.name,
+            nodeId: node.id,
+            fingerprint: this.computeFingerprint(workflow, node, inputs, dependencyFingerprints),
+            namespace,
+        };
+    }
+    /**
+     * Computes a stable fingerprint for a node's inputs and dependencies.
+     */
+    computeFingerprint(workflow, node, inputs, dependencyFingerprints) {
+        const data = {
+            workflowId: workflow.name,
+            nodeId: node.id,
+            nodeKind: node.kind,
+            nodeDefinitionVersion: node.definition?.graph?.metadata?.version,
+            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);
+    }
+    /**
+     * 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.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.workflow, 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}`;
+    }
+}
+void GRAPH_PINNING_METADATA_KEY;
+//# sourceMappingURL=GraphPinningService.js.map

package/lib/esm/graph/pinning/GraphPinningService.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"GraphPinningService.js","sourceRoot":"","sources":["../../../../src/graph/pinning/GraphPinningService.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AACH,OAAO,EAAE,0BAA0B,EAAE,0BAAqB;AAC1D,OAAO,EAAE,iBAAiB,EAAE,yCAAoC;AAGhE,OAAO,EAAE,aAAa,EAAE,uCAAkC;AAe1D;;GAEG;AACH,MAAM,OAAO,mBAAmB;IAC9B,YACmB,KAAsB,EACtB,MAA0B,EAC1B,kBAAkD;QAFlD,UAAK,GAAL,KAAK,CAAiB;QACtB,WAAM,GAAN,MAAM,CAAoB;QAC1B,uBAAkB,GAAlB,kBAAkB,CAAgC;IAClE,CAAC;IAEJ;;;;OAIG;IACH,KAAK,CAAC,OAAO,CAAC,OAA4B;QACxC,MAAM,IAAI,GAAG,OAAO,CAAC,IAA0B,CAAC;QAChD,MAAM,mBAAmB,GAAG,OAAO,CAAC,mBAAmB,IAAI,IAAI,CAAC;QAEhE,MAAM,MAAM,GAAG,mBAAmB;YAChC,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;QAE9B,0BAA0B;QAC1B,KAAK,MAAM,MAAM,IAAI,MAAM,EAAE,CAAC;YAC5B,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;gBACV,MAAM,IAAI,iBAAiB,CAAC,SAAS,MAAM,qBAAqB,CAAC,CAAC;YACpE,CAAC;YACD,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC;gBAC9B,MAAM,IAAI,iBAAiB,CACzB,SAAS,MAAM,mBAAmB,EAClC,EAAE,MAAM,EAAE,CACX,CAAC;YACJ,CAAC;QACH,CAAC;QAED,iDAAiD;QACjD,MAAM,OAAO,GAAG,IAAI,CAAC,gBAAgB,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;QACpD,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;YAC7B,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,MAAM,CAAE,CAAC;YACtD,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;YAClD,IAAI,CAAC,MAAM,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC;gBAC/B,MAAM,IAAI,iBAAiB,CACzB,SAAS,MAAM,kCAAkC,CAClD,CAAC;YACJ,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,EAAE,IAAI,EAAE,MAAM,EAAE,eAAe,EAAE,OAAO,CAAC,SAAS,CAAC,CAAC;YACpG,MAAM,GAAG,GAAG,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;YACrC,MAAM,MAAM,GAAqB;gBAC/B,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;aACjD,CAAC;YACF,MAAM,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC;QAC5C,CAAC;IACH,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,SAAS,CAAC,OAA8B;QAC5C,MAAM,GAAG,GAAkB;YACzB,UAAU,EAAE,OAAO,CAAC,QAAQ,CAAC,IAAI;YACjC,MAAM,EAAE,OAAO,CAAC,MAAM;YACtB,WAAW,EAAE,OAAO,CAAC,WAAW;YAChC,SAAS,EAAE,OAAO,CAAC,SAAS;SAC7B,CAAC;QACF,MAAM,IAAI,CAAC,KAAK,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC;IACrC,CAAC;IAED;;;OAGG;IACH,KAAK,CAAC,eAAe,CACnB,QAAiC,EACjC,IAA4B,EAC5B,MAA4B,EAC5B,sBAA8C,EAC9C,SAAkB;QAElB,MAAM,GAAG,GAAG,IAAI,CAAC,cAAc,CAAC,QAAQ,EAAE,IAAI,EAAE,MAAM,EAAE,sBAAsB,EAAE,SAAS,CAAC,CAAC;QAC3F,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC;QAChD,IAAI,MAAM,IAAI,MAAM,CAAC,MAAM,EAAE,CAAC;YAC5B,IAAI,MAAM,CAAC,SAAS,IAAI,IAAI,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,GAAG,IAAI,IAAI,EAAE,EAAE,CAAC;gBAChE,OAAO,SAAS,CAAC;YACnB,CAAC;YACD,OAAO,MAAM,CAAC;QAChB,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IAED;;OAEG;IACH,cAAc,CACZ,QAAiC,EACjC,IAA4B,EAC5B,MAA4B,EAC5B,sBAA8C,EAC9C,SAAkB;QAElB,OAAO;YACL,UAAU,EAAE,QAAQ,CAAC,IAAI;YACzB,MAAM,EAAE,IAAI,CAAC,EAAE;YACf,WAAW,EAAE,IAAI,CAAC,kBAAkB,CAAC,QAAQ,EAAE,IAAI,EAAE,MAAM,EAAE,sBAAsB,CAAC;YACpF,SAAS;SACV,CAAC;IACJ,CAAC;IAED;;OAEG;IACH,kBAAkB,CAChB,QAAiC,EACjC,IAA4B,EAC5B,MAA4B,EAC5B,sBAA8C;QAE9C,MAAM,IAAI,GAAG;YACX,UAAU,EAAE,QAAQ,CAAC,IAAI;YACzB,MAAM,EAAE,IAAI,CAAC,EAAE;YACf,QAAQ,EAAE,IAAI,CAAC,IAAI;YACnB,qBAAqB,EAAG,IAAI,CAAC,UAAkB,EAAE,KAAK,EAAE,QAAQ,EAAE,OAAO;YACzE,MAAM,EAAE,IAAI,CAAC,eAAe,CAAC,MAAM,CAAC;YACpC,sBAAsB,EAAE,IAAI,CAAC,eAAe,CAAC,sBAAsB,CAAC;SACrE,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;IAC/B,CAAC;IAED;;OAEG;IACK,gBAAgB,CACtB,IAAwB,EACxB,OAAoB;QAEpB,MAAM,MAAM,GAAa,EAAE,CAAC;QAC5B,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAClC,MAAM,KAAK,GAAG,CAAC,MAAc,EAAE,EAAE;YAC/B,IAAI,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC;gBAAE,OAAO;YAChC,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YACpB,MAAM,IAAI,GAAG,aAAa,CAAC,aAAa,CAAC,MAAM,EAAE,IAAI,CAAC,cAAc,EAAE,KAAK,CAAC,CAAC;YAC7E,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;gBACvB,IAAI,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC;oBAAE,KAAK,CAAC,GAAG,CAAC,CAAC;YACnC,CAAC;YACD,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACtB,CAAC,CAAC;QACF,KAAK,MAAM,MAAM,IAAI,OAAO;YAAE,KAAK,CAAC,MAAM,CAAC,CAAC;QAC5C,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;OAEG;IACK,sBAAsB,CAC5B,IAAwB,EACxB,MAAc,EACd,MAA4B;QAE5B,MAAM,IAAI,GAAG,IAAI,CAAC,kBAAkB,CAAC,eAAe,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;QACnE,MAAM,YAAY,GAA2B,EAAE,CAAC;QAChD,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;YACvB,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;gBACT,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,QAAQ,EAAE,IAAI,EAAE,MAAM,EAAE,UAAU,CAAC,CAAC;YACvF,CAAC;QACH,CAAC;QACD,OAAO,YAAY,CAAC;IACtB,CAAC;IAED;;OAEG;IACK,eAAe,CAAC,KAAc;QACpC,IAAI,KAAK,KAAK,IAAI,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE,CAAC;YAChD,OAAO,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;QAC/B,CAAC;QACD,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;YACzB,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;QACpE,CAAC;QACD,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,IAAI,EAAE,CAAC;QACvC,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CACpB,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,eAAe,CAAE,KAAa,CAAC,CAAC,CAAC,CAAC,EAAE,CACzE,CAAC;QACF,OAAO,IAAI,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;IAChC,CAAC;IAED;;;;;OAKG;IACK,UAAU,CAAC,GAAW;QAC5B,IAAI,IAAI,GAAG,CAAC,CAAC;QACb,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACpC,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;QACZ,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;IAC5E,CAAC;CACF;AAED,KAAK,0BAA0B,CAAC"}

package/lib/esm/graph/pinning/index.js

@@ -0,0 +1,10 @@
+/**
+ * @module integrations/graph/pinning
+ * @summary Graph pinning subsystem.
+ * @description Re-exports the pinning metadata, policy, dependency resolver, and service.
+ */
+export * from "./GraphPinningMetadata.js";
+export * from "./GraphPinningPolicy.js";
+export * from "./GraphPinningDependencyResolver.js";
+export * from "./GraphPinningService.js";
+//# sourceMappingURL=index.js.map

package/lib/esm/graph/pinning/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../../src/graph/pinning/index.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AACH,0CAAuC;AACvC,wCAAqC;AACrC,oDAAiD;AACjD,yCAAsC"}

package/lib/esm/graph/planning/GraphExecutionPlan.js

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=GraphExecutionPlan.js.map

package/lib/esm/graph/planning/GraphExecutionPlan.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"GraphExecutionPlan.js","sourceRoot":"","sources":["../../../../src/graph/planning/GraphExecutionPlan.ts"],"names":[],"mappings":""}

package/lib/esm/graph/planning/GraphExecutionPlanEdge.js

@@ -0,0 +1,7 @@
+/**
+ * @module integrations/graph/planning/GraphExecutionPlanEdge
+ * @summary Plan edge type for the execution plan.
+ * @description Represents a directed value route between two endpoints (node-to-node or node-to-workflow-boundary).
+ */
+export {};
+//# sourceMappingURL=GraphExecutionPlanEdge.js.map

package/lib/esm/graph/planning/GraphExecutionPlanEdge.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"GraphExecutionPlanEdge.js","sourceRoot":"","sources":["../../../../src/graph/planning/GraphExecutionPlanEdge.ts"],"names":[],"mappings":"AAAA;;;;GAIG"}

package/lib/esm/graph/planning/GraphExecutionPlanLayer.js

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=GraphExecutionPlanLayer.js.map

package/lib/esm/graph/planning/GraphExecutionPlanLayer.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"GraphExecutionPlanLayer.js","sourceRoot":"","sources":["../../../../src/graph/planning/GraphExecutionPlanLayer.ts"],"names":[],"mappings":""}

package/lib/esm/graph/planning/GraphExecutionPlanNode.js

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=GraphExecutionPlanNode.js.map

package/lib/esm/graph/planning/GraphExecutionPlanNode.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"GraphExecutionPlanNode.js","sourceRoot":"","sources":["../../../../src/graph/planning/GraphExecutionPlanNode.ts"],"names":[],"mappings":""}