@decaf-ts/integrations 0.3.0 → 0.3.2

package/lib/cjs/graph/loops/ForeachGraphNodeExecutor.cjs

@@ -0,0 +1,84 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.ForeachGraphNodeExecutor = void 0;
+const constants_js_1 = require("./../constants.cjs");
+const GraphInputError_js_1 = require("./../errors/GraphInputError.cjs");
+const GraphLoopLimitError_js_1 = require("./../errors/GraphLoopLimitError.cjs");
+/**
+ * Executor for `core.loop.foreach` nodes.
+ *
+ * Expects input:
+ * - `items`: array of values to iterate over
+ * - `state?`: optional initial state
+ *
+ * Produces output:
+ * - `results`: array of body outputs (in item order)
+ * - `state?`: final state
+ * - `iterations`: number of iterations executed
+ */
+class ForeachGraphNodeExecutor {
+    constructor(engine) {
+        this.engine = engine;
+    }
+    async execute(input, context) {
+        const metadata = this.extractMetadata(context);
+        const items = input.items;
+        const maxIterations = metadata.maxIterations ?? constants_js_1.GRAPH_DEFAULT_MAX_FOREACH_ITERATIONS;
+        if (!Array.isArray(items)) {
+            throw new GraphInputError_js_1.GraphInputError("foreach input 'items' must be an array");
+        }
+        if (items.length > maxIterations) {
+            throw new GraphLoopLimitError_js_1.GraphLoopLimitError(`foreach exceeded max iterations (${items.length} > ${maxIterations})`);
+        }
+        const itemPort = metadata.itemPort ?? "item";
+        const resultPort = metadata.resultPort ?? "result";
+        const statePort = metadata.statePort ?? "state";
+        const bodyWorkflow = metadata.body;
+        const results = [];
+        let state = input.state;
+        await context.emit({ type: constants_js_1.GraphExecutionEventType.LOOP_STARTED });
+        for (let i = 0; i < items.length; i++) {
+            await context.emit({
+                type: constants_js_1.GraphExecutionEventType.LOOP_ITERATION_STARTED,
+                iteration: i,
+            });
+            const childInputs = {
+                [itemPort]: items[i],
+                index: i,
+            };
+            if (state !== undefined)
+                childInputs[statePort] = state;
+            const childResult = await this.engine.execute(bodyWorkflow, childInputs, {
+                parentRunId: context.runId,
+                path: [...context.path, `iteration:${i}`],
+            });
+            results.push(childResult.outputs[resultPort]);
+            if (childResult.outputs[statePort] !== undefined) {
+                state = childResult.outputs[statePort];
+            }
+            await context.emit({
+                type: constants_js_1.GraphExecutionEventType.LOOP_ITERATION_COMPLETED,
+                iteration: i,
+            });
+        }
+        await context.emit({ type: constants_js_1.GraphExecutionEventType.LOOP_COMPLETED });
+        const output = {
+            results,
+            iterations: items.length,
+        };
+        if (state !== undefined)
+            output[statePort] = state;
+        return output;
+    }
+    extractMetadata(context) {
+        const raw = context.node.graph?.metadata?.loop ??
+            context.metadata?.loop;
+        if (!raw) {
+            throw new GraphInputError_js_1.GraphInputError("foreach node is missing loop metadata");
+        }
+        return raw;
+    }
+}
+exports.ForeachGraphNodeExecutor = ForeachGraphNodeExecutor;
+//# sourceMappingURL=ForeachGraphNodeExecutor.js.map
+//# sourceMappingURL=ForeachGraphNodeExecutor.cjs.map

package/lib/cjs/graph/loops/ForeachGraphNodeExecutor.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph/loops/ForeachGraphNodeExecutor.cjs","sourceRoot":"","sources":["graph/loops/ForeachGraphNodeExecutor.js"],"names":[],"mappings":";;;AAAA,oDAAkG;AAClG,uEAAiE;AACjE,+EAAyE;AACzE;;;;;;;;;;;GAWG;AACH,MAAa,wBAAwB;IACjC,YAAY,MAAM;QACd,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;IACzB,CAAC;IACD,KAAK,CAAC,OAAO,CAAC,KAAK,EAAE,OAAO;QACxB,MAAM,QAAQ,GAAG,IAAI,CAAC,eAAe,CAAC,OAAO,CAAC,CAAC;QAC/C,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC;QAC1B,MAAM,aAAa,GAAG,QAAQ,CAAC,aAAa,IAAI,mDAAoC,CAAC;QACrF,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;YACxB,MAAM,IAAI,oCAAe,CAAC,wCAAwC,CAAC,CAAC;QACxE,CAAC;QACD,IAAI,KAAK,CAAC,MAAM,GAAG,aAAa,EAAE,CAAC;YAC/B,MAAM,IAAI,4CAAmB,CAAC,oCAAoC,KAAK,CAAC,MAAM,MAAM,aAAa,GAAG,CAAC,CAAC;QAC1G,CAAC;QACD,MAAM,QAAQ,GAAG,QAAQ,CAAC,QAAQ,IAAI,MAAM,CAAC;QAC7C,MAAM,UAAU,GAAG,QAAQ,CAAC,UAAU,IAAI,QAAQ,CAAC;QACnD,MAAM,SAAS,GAAG,QAAQ,CAAC,SAAS,IAAI,OAAO,CAAC;QAChD,MAAM,YAAY,GAAG,QAAQ,CAAC,IAAI,CAAC;QACnC,MAAM,OAAO,GAAG,EAAE,CAAC;QACnB,IAAI,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC;QACxB,MAAM,OAAO,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,sCAAuB,CAAC,YAAY,EAAE,CAAC,CAAC;QACnE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACpC,MAAM,OAAO,CAAC,IAAI,CAAC;gBACf,IAAI,EAAE,sCAAuB,CAAC,sBAAsB;gBACpD,SAAS,EAAE,CAAC;aACf,CAAC,CAAC;YACH,MAAM,WAAW,GAAG;gBAChB,CAAC,QAAQ,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC;gBACpB,KAAK,EAAE,CAAC;aACX,CAAC;YACF,IAAI,KAAK,KAAK,SAAS;gBACnB,WAAW,CAAC,SAAS,CAAC,GAAG,KAAK,CAAC;YACnC,MAAM,WAAW,GAAG,MAAM,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,YAAY,EAAE,WAAW,EAAE;gBACrE,WAAW,EAAE,OAAO,CAAC,KAAK;gBAC1B,IAAI,EAAE,CAAC,GAAG,OAAO,CAAC,IAAI,EAAE,aAAa,CAAC,EAAE,CAAC;aAC5C,CAAC,CAAC;YACH,OAAO,CAAC,IAAI,CAAC,WAAW,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,CAAC;YAC9C,IAAI,WAAW,CAAC,OAAO,CAAC,SAAS,CAAC,KAAK,SAAS,EAAE,CAAC;gBAC/C,KAAK,GAAG,WAAW,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;YAC3C,CAAC;YACD,MAAM,OAAO,CAAC,IAAI,CAAC;gBACf,IAAI,EAAE,sCAAuB,CAAC,wBAAwB;gBACtD,SAAS,EAAE,CAAC;aACf,CAAC,CAAC;QACP,CAAC;QACD,MAAM,OAAO,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,sCAAuB,CAAC,cAAc,EAAE,CAAC,CAAC;QACrE,MAAM,MAAM,GAAG;YACX,OAAO;YACP,UAAU,EAAE,KAAK,CAAC,MAAM;SAC3B,CAAC;QACF,IAAI,KAAK,KAAK,SAAS;YACnB,MAAM,CAAC,SAAS,CAAC,GAAG,KAAK,CAAC;QAC9B,OAAO,MAAM,CAAC;IAClB,CAAC;IACD,eAAe,CAAC,OAAO;QACnB,MAAM,GAAG,GAAG,OAAO,CAAC,IAAI,CAAC,KAAK,EAAE,QAAQ,EAAE,IAAI;YAC1C,OAAO,CAAC,QAAQ,EAAE,IAAI,CAAC;QAC3B,IAAI,CAAC,GAAG,EAAE,CAAC;YACP,MAAM,IAAI,oCAAe,CAAC,uCAAuC,CAAC,CAAC;QACvE,CAAC;QACD,OAAO,GAAG,CAAC;IACf,CAAC;CACJ;AA9DD,4DA8DC;AACD,oDAAoD"}

package/lib/cjs/graph/loops/GraphConditionEvaluator.cjs

@@ -0,0 +1,63 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.GraphConditionEvaluator = void 0;
+const constants_js_1 = require("./../constants.cjs");
+const GraphExecutionError_js_1 = require("./../errors/GraphExecutionError.cjs");
+/**
+ * Evaluates loop conditions using built-in comparison types.
+ */
+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 constants_js_1.GraphConditionType.TRUTHY:
+                return !!left;
+            case constants_js_1.GraphConditionType.FALSY:
+                return !left;
+            case constants_js_1.GraphConditionType.EQUALS:
+                return left === right;
+            case constants_js_1.GraphConditionType.NOT_EQUALS:
+                return left !== right;
+            case constants_js_1.GraphConditionType.GREATER_THAN:
+                return Number(left) > Number(right);
+            case constants_js_1.GraphConditionType.GREATER_THAN_OR_EQUAL:
+                return Number(left) >= Number(right);
+            case constants_js_1.GraphConditionType.LESS_THAN:
+                return Number(left) < Number(right);
+            case constants_js_1.GraphConditionType.LESS_THAN_OR_EQUAL:
+                return Number(left) <= Number(right);
+            case constants_js_1.GraphConditionType.EXISTS:
+                return left !== undefined && left !== null;
+            case constants_js_1.GraphConditionType.CUSTOM:
+                throw new GraphExecutionError_js_1.GraphExecutionError("Custom condition evaluators are not supported in v1", "GRAPH_CUSTOM_CONDITION_UNSUPPORTED");
+            default:
+                throw new GraphExecutionError_js_1.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;
+    }
+}
+exports.GraphConditionEvaluator = GraphConditionEvaluator;
+//# sourceMappingURL=GraphConditionEvaluator.js.map
+//# sourceMappingURL=GraphConditionEvaluator.cjs.map

package/lib/cjs/graph/loops/GraphConditionEvaluator.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph/loops/GraphConditionEvaluator.cjs","sourceRoot":"","sources":["graph/loops/GraphConditionEvaluator.js"],"names":[],"mappings":";;;AAAA,oDAAuD;AACvD,+EAAyE;AACzE;;GAEG;AACH,MAAa,uBAAuB;IAChC;;;;;;OAMG;IACH,QAAQ,CAAC,SAAS,EAAE,KAAK;QACrB,MAAM,IAAI,GAAG,IAAI,CAAC,YAAY,CAAC,SAAS,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;QACtD,MAAM,KAAK,GAAG,SAAS,CAAC,KAAK,CAAC;QAC9B,QAAQ,SAAS,CAAC,IAAI,EAAE,CAAC;YACrB,KAAK,iCAAkB,CAAC,MAAM;gBAC1B,OAAO,CAAC,CAAC,IAAI,CAAC;YAClB,KAAK,iCAAkB,CAAC,KAAK;gBACzB,OAAO,CAAC,IAAI,CAAC;YACjB,KAAK,iCAAkB,CAAC,MAAM;gBAC1B,OAAO,IAAI,KAAK,KAAK,CAAC;YAC1B,KAAK,iCAAkB,CAAC,UAAU;gBAC9B,OAAO,IAAI,KAAK,KAAK,CAAC;YAC1B,KAAK,iCAAkB,CAAC,YAAY;gBAChC,OAAO,MAAM,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC;YACxC,KAAK,iCAAkB,CAAC,qBAAqB;gBACzC,OAAO,MAAM,CAAC,IAAI,CAAC,IAAI,MAAM,CAAC,KAAK,CAAC,CAAC;YACzC,KAAK,iCAAkB,CAAC,SAAS;gBAC7B,OAAO,MAAM,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC;YACxC,KAAK,iCAAkB,CAAC,kBAAkB;gBACtC,OAAO,MAAM,CAAC,IAAI,CAAC,IAAI,MAAM,CAAC,KAAK,CAAC,CAAC;YACzC,KAAK,iCAAkB,CAAC,MAAM;gBAC1B,OAAO,IAAI,KAAK,SAAS,IAAI,IAAI,KAAK,IAAI,CAAC;YAC/C,KAAK,iCAAkB,CAAC,MAAM;gBAC1B,MAAM,IAAI,4CAAmB,CAAC,qDAAqD,EAAE,oCAAoC,CAAC,CAAC;YAC/H;gBACI,MAAM,IAAI,4CAAmB,CAAC,2BAA2B,SAAS,CAAC,IAAI,GAAG,EAAE,8BAA8B,EAAE,EAAE,SAAS,EAAE,CAAC,CAAC;QACnI,CAAC;IACL,CAAC;IACD;;OAEG;IACH,YAAY,CAAC,IAAI,EAAE,KAAK;QACpB,IAAI,CAAC,IAAI;YACL,OAAO,KAAK,CAAC;QACjB,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;QAC9B,IAAI,OAAO,GAAG,KAAK,CAAC;QACpB,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACvB,IAAI,OAAO,IAAI,IAAI;gBACf,OAAO,SAAS,CAAC;YACrB,OAAO,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC;QAC5B,CAAC;QACD,OAAO,OAAO,CAAC;IACnB,CAAC;CACJ;AAnDD,0DAmDC;AACD,mDAAmD"}

package/lib/cjs/graph/loops/GraphLoopExecutionContext.cjs

@@ -0,0 +1,16 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.GraphLoopExecutionContext = void 0;
+/**
+ * Context for a single loop execution, carrying the loop metadata and
+ * current iteration index.
+ */
+class GraphLoopExecutionContext {
+    constructor(iteration, metadata) {
+        this.iteration = iteration;
+        this.metadata = metadata;
+    }
+}
+exports.GraphLoopExecutionContext = GraphLoopExecutionContext;
+//# sourceMappingURL=GraphLoopExecutionContext.js.map
+//# sourceMappingURL=GraphLoopExecutionContext.cjs.map

package/lib/cjs/graph/loops/GraphLoopExecutionContext.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph/loops/GraphLoopExecutionContext.cjs","sourceRoot":"","sources":["graph/loops/GraphLoopExecutionContext.js"],"names":[],"mappings":";;;AAAA;;;GAGG;AACH,MAAa,yBAAyB;IAClC,YAAY,SAAS,EAAE,QAAQ;QAC3B,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC;QAC3B,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;IAC7B,CAAC;CACJ;AALD,8DAKC;AACD,qDAAqD"}

package/lib/cjs/graph/loops/UntilGraphNodeExecutor.cjs

@@ -0,0 +1,76 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.UntilGraphNodeExecutor = void 0;
+const constants_js_1 = require("./../constants.cjs");
+const GraphInputError_js_1 = require("./../errors/GraphInputError.cjs");
+const GraphLoopLimitError_js_1 = require("./../errors/GraphLoopLimitError.cjs");
+const GraphConditionEvaluator_js_1 = require("./GraphConditionEvaluator.cjs");
+/**
+ * Executor for `core.loop.until` nodes.
+ *
+ * Executes the body at least once, then checks the condition. Repeats until
+ * the condition evaluates to true.
+ */
+class UntilGraphNodeExecutor {
+    constructor(engine) {
+        this.engine = engine;
+        this.evaluator = new GraphConditionEvaluator_js_1.GraphConditionEvaluator();
+    }
+    async execute(input, context) {
+        const metadata = this.extractMetadata(context);
+        const maxIterations = metadata.maxIterations ?? constants_js_1.GRAPH_DEFAULT_MAX_LOOP_ITERATIONS;
+        const condition = metadata.condition;
+        if (!condition) {
+            throw new GraphInputError_js_1.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: constants_js_1.GraphExecutionEventType.LOOP_STARTED });
+        let shouldStop = false;
+        do {
+            if (iteration >= maxIterations) {
+                await context.emit({
+                    type: constants_js_1.GraphExecutionEventType.LOOP_LIMIT_REACHED,
+                    iteration,
+                });
+                throw new GraphLoopLimitError_js_1.GraphLoopLimitError(`until loop exceeded max iterations (${maxIterations})`);
+            }
+            await context.emit({
+                type: constants_js_1.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: constants_js_1.GraphExecutionEventType.LOOP_ITERATION_COMPLETED,
+                iteration,
+            });
+            const conditionResult = this.evaluator.evaluate(condition, state);
+            await context.emit({
+                type: constants_js_1.GraphExecutionEventType.LOOP_CONDITION_EVALUATED,
+                iteration,
+                payload: { result: conditionResult },
+            });
+            iteration++;
+            shouldStop = conditionResult;
+        } while (!shouldStop);
+        await context.emit({ type: constants_js_1.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_js_1.GraphInputError("until node is missing loop metadata");
+        }
+        return raw;
+    }
+}
+exports.UntilGraphNodeExecutor = UntilGraphNodeExecutor;
+//# sourceMappingURL=UntilGraphNodeExecutor.js.map
+//# sourceMappingURL=UntilGraphNodeExecutor.cjs.map

package/lib/cjs/graph/loops/UntilGraphNodeExecutor.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph/loops/UntilGraphNodeExecutor.cjs","sourceRoot":"","sources":["graph/loops/UntilGraphNodeExecutor.js"],"names":[],"mappings":";;;AAAA,oDAA+F;AAC/F,uEAAiE;AACjE,+EAAyE;AACzE,6EAAuE;AACvE;;;;;GAKG;AACH,MAAa,sBAAsB;IAC/B,YAAY,MAAM;QACd,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;QACrB,IAAI,CAAC,SAAS,GAAG,IAAI,oDAAuB,EAAE,CAAC;IACnD,CAAC;IACD,KAAK,CAAC,OAAO,CAAC,KAAK,EAAE,OAAO;QACxB,MAAM,QAAQ,GAAG,IAAI,CAAC,eAAe,CAAC,OAAO,CAAC,CAAC;QAC/C,MAAM,aAAa,GAAG,QAAQ,CAAC,aAAa,IAAI,gDAAiC,CAAC;QAClF,MAAM,SAAS,GAAG,QAAQ,CAAC,SAAS,CAAC;QACrC,IAAI,CAAC,SAAS,EAAE,CAAC;YACb,MAAM,IAAI,oCAAe,CAAC,mCAAmC,CAAC,CAAC;QACnE,CAAC;QACD,MAAM,SAAS,GAAG,QAAQ,CAAC,SAAS,IAAI,OAAO,CAAC;QAChD,MAAM,YAAY,GAAG,QAAQ,CAAC,IAAI,CAAC;QACnC,IAAI,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC;QACxB,IAAI,SAAS,GAAG,CAAC,CAAC;QAClB,MAAM,OAAO,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,sCAAuB,CAAC,YAAY,EAAE,CAAC,CAAC;QACnE,IAAI,UAAU,GAAG,KAAK,CAAC;QACvB,GAAG,CAAC;YACA,IAAI,SAAS,IAAI,aAAa,EAAE,CAAC;gBAC7B,MAAM,OAAO,CAAC,IAAI,CAAC;oBACf,IAAI,EAAE,sCAAuB,CAAC,kBAAkB;oBAChD,SAAS;iBACZ,CAAC,CAAC;gBACH,MAAM,IAAI,4CAAmB,CAAC,uCAAuC,aAAa,GAAG,CAAC,CAAC;YAC3F,CAAC;YACD,MAAM,OAAO,CAAC,IAAI,CAAC;gBACf,IAAI,EAAE,sCAAuB,CAAC,sBAAsB;gBACpD,SAAS;aACZ,CAAC,CAAC;YACH,MAAM,WAAW,GAAG,MAAM,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,YAAY,EAAE,EAAE,CAAC,SAAS,CAAC,EAAE,KAAK,EAAE,SAAS,EAAE,EAAE;gBAC3F,WAAW,EAAE,OAAO,CAAC,KAAK;gBAC1B,IAAI,EAAE,CAAC,GAAG,OAAO,CAAC,IAAI,EAAE,aAAa,SAAS,EAAE,CAAC;aACpD,CAAC,CAAC;YACH,KAAK,GAAG,WAAW,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;YACvC,MAAM,OAAO,CAAC,IAAI,CAAC;gBACf,IAAI,EAAE,sCAAuB,CAAC,wBAAwB;gBACtD,SAAS;aACZ,CAAC,CAAC;YACH,MAAM,eAAe,GAAG,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,SAAS,EAAE,KAAK,CAAC,CAAC;YAClE,MAAM,OAAO,CAAC,IAAI,CAAC;gBACf,IAAI,EAAE,sCAAuB,CAAC,wBAAwB;gBACtD,SAAS;gBACT,OAAO,EAAE,EAAE,MAAM,EAAE,eAAe,EAAE;aACvC,CAAC,CAAC;YACH,SAAS,EAAE,CAAC;YACZ,UAAU,GAAG,eAAe,CAAC;QACjC,CAAC,QAAQ,CAAC,UAAU,EAAE;QACtB,MAAM,OAAO,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,sCAAuB,CAAC,cAAc,EAAE,CAAC,CAAC;QACrE,OAAO,EAAE,CAAC,SAAS,CAAC,EAAE,KAAK,EAAE,UAAU,EAAE,SAAS,EAAE,CAAC;IACzD,CAAC;IACD,eAAe,CAAC,OAAO;QACnB,MAAM,GAAG,GAAG,OAAO,CAAC,IAAI,CAAC,KAAK,EAAE,QAAQ,EAAE,IAAI;YAC1C,OAAO,CAAC,QAAQ,EAAE,IAAI,CAAC;QAC3B,IAAI,CAAC,GAAG,EAAE,CAAC;YACP,MAAM,IAAI,oCAAe,CAAC,qCAAqC,CAAC,CAAC;QACrE,CAAC;QACD,OAAO,GAAG,CAAC;IACf,CAAC;CACJ;AA3DD,wDA2DC;AACD,kDAAkD"}

package/lib/cjs/graph/loops/WhileGraphNodeExecutor.cjs

@@ -0,0 +1,77 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.WhileGraphNodeExecutor = void 0;
+const constants_js_1 = require("./../constants.cjs");
+const GraphInputError_js_1 = require("./../errors/GraphInputError.cjs");
+const GraphLoopLimitError_js_1 = require("./../errors/GraphLoopLimitError.cjs");
+const GraphConditionEvaluator_js_1 = require("./GraphConditionEvaluator.cjs");
+/**
+ * Executor for `core.loop.while` nodes.
+ *
+ * Expects input:
+ * - `state`: initial state
+ *
+ * Produces output:
+ * - `state`: final state
+ * - `iterations`: number of iterations executed
+ */
+class WhileGraphNodeExecutor {
+    constructor(engine) {
+        this.engine = engine;
+        this.evaluator = new GraphConditionEvaluator_js_1.GraphConditionEvaluator();
+    }
+    async execute(input, context) {
+        const metadata = this.extractMetadata(context);
+        const maxIterations = metadata.maxIterations ?? constants_js_1.GRAPH_DEFAULT_MAX_LOOP_ITERATIONS;
+        const condition = metadata.condition;
+        if (!condition) {
+            throw new GraphInputError_js_1.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: constants_js_1.GraphExecutionEventType.LOOP_STARTED });
+        while (this.evaluator.evaluate(condition, state)) {
+            if (iteration >= maxIterations) {
+                await context.emit({
+                    type: constants_js_1.GraphExecutionEventType.LOOP_LIMIT_REACHED,
+                    iteration,
+                });
+                throw new GraphLoopLimitError_js_1.GraphLoopLimitError(`while loop exceeded max iterations (${maxIterations})`);
+            }
+            await context.emit({
+                type: constants_js_1.GraphExecutionEventType.LOOP_CONDITION_EVALUATED,
+                iteration,
+                payload: { result: true },
+            });
+            await context.emit({
+                type: constants_js_1.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: constants_js_1.GraphExecutionEventType.LOOP_ITERATION_COMPLETED,
+                iteration,
+            });
+            iteration++;
+        }
+        await context.emit({ type: constants_js_1.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_js_1.GraphInputError("while node is missing loop metadata");
+        }
+        return raw;
+    }
+}
+exports.WhileGraphNodeExecutor = WhileGraphNodeExecutor;
+//# sourceMappingURL=WhileGraphNodeExecutor.js.map
+//# sourceMappingURL=WhileGraphNodeExecutor.cjs.map

package/lib/cjs/graph/loops/WhileGraphNodeExecutor.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph/loops/WhileGraphNodeExecutor.cjs","sourceRoot":"","sources":["graph/loops/WhileGraphNodeExecutor.js"],"names":[],"mappings":";;;AAAA,oDAA+F;AAC/F,uEAAiE;AACjE,+EAAyE;AACzE,6EAAuE;AACvE;;;;;;;;;GASG;AACH,MAAa,sBAAsB;IAC/B,YAAY,MAAM;QACd,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;QACrB,IAAI,CAAC,SAAS,GAAG,IAAI,oDAAuB,EAAE,CAAC;IACnD,CAAC;IACD,KAAK,CAAC,OAAO,CAAC,KAAK,EAAE,OAAO;QACxB,MAAM,QAAQ,GAAG,IAAI,CAAC,eAAe,CAAC,OAAO,CAAC,CAAC;QAC/C,MAAM,aAAa,GAAG,QAAQ,CAAC,aAAa,IAAI,gDAAiC,CAAC;QAClF,MAAM,SAAS,GAAG,QAAQ,CAAC,SAAS,CAAC;QACrC,IAAI,CAAC,SAAS,EAAE,CAAC;YACb,MAAM,IAAI,oCAAe,CAAC,mCAAmC,CAAC,CAAC;QACnE,CAAC;QACD,MAAM,SAAS,GAAG,QAAQ,CAAC,SAAS,IAAI,OAAO,CAAC;QAChD,MAAM,YAAY,GAAG,QAAQ,CAAC,IAAI,CAAC;QACnC,IAAI,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC;QACxB,IAAI,SAAS,GAAG,CAAC,CAAC;QAClB,MAAM,OAAO,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,sCAAuB,CAAC,YAAY,EAAE,CAAC,CAAC;QACnE,OAAO,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,SAAS,EAAE,KAAK,CAAC,EAAE,CAAC;YAC/C,IAAI,SAAS,IAAI,aAAa,EAAE,CAAC;gBAC7B,MAAM,OAAO,CAAC,IAAI,CAAC;oBACf,IAAI,EAAE,sCAAuB,CAAC,kBAAkB;oBAChD,SAAS;iBACZ,CAAC,CAAC;gBACH,MAAM,IAAI,4CAAmB,CAAC,uCAAuC,aAAa,GAAG,CAAC,CAAC;YAC3F,CAAC;YACD,MAAM,OAAO,CAAC,IAAI,CAAC;gBACf,IAAI,EAAE,sCAAuB,CAAC,wBAAwB;gBACtD,SAAS;gBACT,OAAO,EAAE,EAAE,MAAM,EAAE,IAAI,EAAE;aAC5B,CAAC,CAAC;YACH,MAAM,OAAO,CAAC,IAAI,CAAC;gBACf,IAAI,EAAE,sCAAuB,CAAC,sBAAsB;gBACpD,SAAS;aACZ,CAAC,CAAC;YACH,MAAM,WAAW,GAAG,MAAM,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,YAAY,EAAE,EAAE,CAAC,SAAS,CAAC,EAAE,KAAK,EAAE,SAAS,EAAE,EAAE;gBAC3F,WAAW,EAAE,OAAO,CAAC,KAAK;gBAC1B,IAAI,EAAE,CAAC,GAAG,OAAO,CAAC,IAAI,EAAE,aAAa,SAAS,EAAE,CAAC;aACpD,CAAC,CAAC;YACH,KAAK,GAAG,WAAW,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;YACvC,MAAM,OAAO,CAAC,IAAI,CAAC;gBACf,IAAI,EAAE,sCAAuB,CAAC,wBAAwB;gBACtD,SAAS;aACZ,CAAC,CAAC;YACH,SAAS,EAAE,CAAC;QAChB,CAAC;QACD,MAAM,OAAO,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,sCAAuB,CAAC,cAAc,EAAE,CAAC,CAAC;QACrE,OAAO,EAAE,CAAC,SAAS,CAAC,EAAE,KAAK,EAAE,UAAU,EAAE,SAAS,EAAE,CAAC;IACzD,CAAC;IACD,eAAe,CAAC,OAAO;QACnB,MAAM,GAAG,GAAG,OAAO,CAAC,IAAI,CAAC,KAAK,EAAE,QAAQ,EAAE,IAAI;YAC1C,OAAO,CAAC,QAAQ,EAAE,IAAI,CAAC;QAC3B,IAAI,CAAC,GAAG,EAAE,CAAC;YACP,MAAM,IAAI,oCAAe,CAAC,qCAAqC,CAAC,CAAC;QACrE,CAAC;QACD,OAAO,GAAG,CAAC;IACf,CAAC;CACJ;AAxDD,wDAwDC;AACD,kDAAkD"}

package/lib/cjs/graph/loops/index.cjs

@@ -0,0 +1,28 @@
+"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/loops
+ * @summary Structured loop executors.
+ * @description Re-exports the condition evaluator, loop execution context, and foreach/while/until executors.
+ */
+__exportStar(require("./GraphConditionEvaluator.cjs"), exports);
+__exportStar(require("./GraphLoopExecutionContext.cjs"), exports);
+__exportStar(require("./ForeachGraphNodeExecutor.cjs"), exports);
+__exportStar(require("./WhileGraphNodeExecutor.cjs"), exports);
+__exportStar(require("./UntilGraphNodeExecutor.cjs"), exports);
+//# sourceMappingURL=index.js.map
+//# sourceMappingURL=index.cjs.map

package/lib/cjs/graph/loops/index.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph/loops/index.cjs","sourceRoot":"","sources":["graph/loops/index.js"],"names":[],"mappings":";;;;;;;;;;;;;;;;AAAA;;;;GAIG;AACH,+DAA6C;AAC7C,iEAA+C;AAC/C,gEAA8C;AAC9C,8DAA4C;AAC5C,8DAA4C;AAC5C,iCAAiC"}

package/lib/cjs/graph/pinning/GraphPinningDependencyResolver.cjs

@@ -0,0 +1,28 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.GraphPinningDependencyResolver = void 0;
+const GraphTopology_js_1 = require("./../planning/GraphTopology.cjs");
+/**
+ * Resolves the upstream dependency subtree of a node for pinning operations.
+ */
+class GraphPinningDependencyResolver {
+    /**
+     * Returns the set of upstream node ids that the given node depends on,
+     * excluding the workflow boundary.
+     */
+    getDependencies(plan, nodeId) {
+        return GraphTopology_js_1.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;
+    }
+}
+exports.GraphPinningDependencyResolver = GraphPinningDependencyResolver;
+//# sourceMappingURL=GraphPinningDependencyResolver.js.map
+//# sourceMappingURL=GraphPinningDependencyResolver.cjs.map

package/lib/cjs/graph/pinning/GraphPinningDependencyResolver.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph/pinning/GraphPinningDependencyResolver.cjs","sourceRoot":"","sources":["graph/pinning/GraphPinningDependencyResolver.js"],"names":[],"mappings":";;;AAAA,qEAA+D;AAC/D;;GAEG;AACH,MAAa,8BAA8B;IACvC;;;OAGG;IACH,eAAe,CAAC,IAAI,EAAE,MAAM;QACxB,OAAO,gCAAa,CAAC,aAAa,CAAC,MAAM,EAAE,IAAI,CAAC,cAAc,EAAE,KAAK,CAAC,CAAC;IAC3E,CAAC;IACD;;;OAGG;IACH,SAAS,CAAC,IAAI,EAAE,MAAM;QAClB,MAAM,IAAI,GAAG,IAAI,CAAC,eAAe,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;QAChD,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACjB,OAAO,IAAI,CAAC;IAChB,CAAC;CACJ;AAjBD,wEAiBC;AACD,0DAA0D"}

package/lib/cjs/graph/pinning/GraphPinningMetadata.cjs

@@ -0,0 +1,20 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.DEFAULT_PINNING_METADATA = void 0;
+exports.isPinnable = isPinnable;
+/**
+ * Default pinning metadata applied when `@pinnable()` is used without options.
+ */
+exports.DEFAULT_PINNING_METADATA = {
+    enabled: true,
+    strategy: "manual",
+    includeDependencies: true,
+};
+/**
+ * Returns `true` when the given metadata allows pinning.
+ */
+function isPinnable(metadata) {
+    return metadata?.enabled === true && metadata.strategy !== "disabled";
+}
+//# sourceMappingURL=GraphPinningMetadata.js.map
+//# sourceMappingURL=GraphPinningMetadata.cjs.map

package/lib/cjs/graph/pinning/GraphPinningMetadata.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph/pinning/GraphPinningMetadata.cjs","sourceRoot":"","sources":["graph/pinning/GraphPinningMetadata.js"],"names":[],"mappings":";;;AAWA,gCAEC;AAbD;;GAEG;AACU,QAAA,wBAAwB,GAAG;IACpC,OAAO,EAAE,IAAI;IACb,QAAQ,EAAE,QAAQ;IAClB,mBAAmB,EAAE,IAAI;CAC5B,CAAC;AACF;;GAEG;AACH,SAAgB,UAAU,CAAC,QAAQ;IAC/B,OAAO,QAAQ,EAAE,OAAO,KAAK,IAAI,IAAI,QAAQ,CAAC,QAAQ,KAAK,UAAU,CAAC;AAC1E,CAAC;AACD,gDAAgD"}

package/lib/cjs/graph/pinning/GraphPinningPolicy.cjs

@@ -0,0 +1,34 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.GraphPinningPolicy = void 0;
+const GraphPinningMetadata_js_1 = require("./GraphPinningMetadata.cjs");
+/**
+ * Policy that decides pinning behaviour for a plan node.
+ */
+class GraphPinningPolicy {
+    /** Returns whether the node is allowed to be pinned. */
+    canPin(node) {
+        return (0, GraphPinningMetadata_js_1.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
+            ? { ...GraphPinningMetadata_js_1.DEFAULT_PINNING_METADATA, ...raw }
+            : { ...GraphPinningMetadata_js_1.DEFAULT_PINNING_METADATA, enabled: false };
+    }
+}
+exports.GraphPinningPolicy = GraphPinningPolicy;
+//# sourceMappingURL=GraphPinningPolicy.js.map
+//# sourceMappingURL=GraphPinningPolicy.cjs.map

package/lib/cjs/graph/pinning/GraphPinningPolicy.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph/pinning/GraphPinningPolicy.cjs","sourceRoot":"","sources":["graph/pinning/GraphPinningPolicy.js"],"names":[],"mappings":";;;AAAA,uEAAiF;AACjF;;GAEG;AACH,MAAa,kBAAkB;IAC3B,wDAAwD;IACxD,MAAM,CAAC,IAAI;QACP,OAAO,IAAA,oCAAU,EAAC,IAAI,CAAC,kBAAkB,CAAC,IAAI,CAAC,CAAC,CAAC;IACrD,CAAC;IACD,oFAAoF;IACpF,oBAAoB,CAAC,IAAI;QACrB,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;IACzE,CAAC;IACD,sEAAsE;IACtE,aAAa,CAAC,IAAI;QACd,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;IAC1E,CAAC;IACD,kDAAkD;IAClD,kBAAkB,CAAC,IAAI;QACnB,MAAM,GAAG,GAAG,IAAI,CAAC,UAAU,EAAE,KAAK,EAAE,QAAQ,EAAE,QAAQ;YAClD,IAAI,CAAC,QAAQ,EAAE,QAAQ,CAAC;QAC5B,OAAO,GAAG;YACN,CAAC,CAAC,EAAE,GAAG,kDAAwB,EAAE,GAAG,GAAG,EAAE;YACzC,CAAC,CAAC,EAAE,GAAG,kDAAwB,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC;IAC1D,CAAC;CACJ;AAvBD,gDAuBC;AACD,8CAA8C"}