@framers/agentos 0.1.69 → 0.1.71

package/dist/orchestration/runtime/GraphRuntime.d.ts

@@ -0,0 +1,135 @@
+/**
+ * @file GraphRuntime.ts
+ * @description Main execution engine for the AgentOS Unified Orchestration Layer.
+ *
+ * `GraphRuntime` ties together the `StateManager`, `NodeScheduler`, `NodeExecutor`,
+ * and `ICheckpointStore` subsystems into a single runnable unit. It supports three
+ * execution modes:
+ *
+ * - **`invoke()`** — execute a graph to completion and return final artifacts.
+ * - **`stream()`** — execute a graph while yielding `GraphEvent` values at every step.
+ * - **`resume()`** — restore a previously interrupted run from its latest checkpoint.
+ *
+ * Design principles:
+ * - No mutable instance state beyond the injected config; each `invoke`/`stream`/`resume`
+ *   call is fully isolated.
+ * - All state lives in `GraphState`; `StateManager` is the sole authority for mutations.
+ * - Checkpointing is always delegated to the injected `ICheckpointStore`.
+ * - Edge evaluation is a pure function of `GraphEdge[]`, `GraphState`, and `NodeExecutionResult`.
+ */
+import type { CompiledExecutionGraph } from '../ir/types.js';
+import type { GraphEvent } from '../events/GraphEvent.js';
+import type { ICheckpointStore } from '../checkpoint/ICheckpointStore.js';
+import { NodeExecutor } from './NodeExecutor.js';
+/**
+ * Dependencies required to construct a `GraphRuntime`.
+ *
+ * @property checkpointStore - Persistence backend for checkpoint snapshots.
+ * @property nodeExecutor    - Dispatcher that runs individual graph nodes.
+ */
+export interface GraphRuntimeConfig {
+    /** Persistence backend for checkpoint snapshots. */
+    checkpointStore: ICheckpointStore;
+    /** Dispatcher that executes individual `GraphNode` instances. */
+    nodeExecutor: NodeExecutor;
+}
+/**
+ * Main execution engine for compiled AgentOS graphs.
+ *
+ * Instantiate once and reuse across multiple runs — the runtime itself is stateless
+ * between calls. Each `invoke()` / `stream()` / `resume()` call creates isolated local
+ * state tracked via closures.
+ *
+ * @example
+ * ```ts
+ * const runtime = new GraphRuntime({ checkpointStore, nodeExecutor });
+ * const result = await runtime.invoke(compiledGraph, { query: 'hello' });
+ * ```
+ */
+export declare class GraphRuntime {
+    private readonly config;
+    /**
+     * @param config - Injected dependencies shared across all runs handled by this instance.
+     */
+    constructor(config: GraphRuntimeConfig);
+    /**
+     * Execute the graph to completion and return the final `artifacts` payload.
+     *
+     * This is a convenience wrapper around `stream()` that discards intermediate events
+     * and awaits the terminal `run_end` event.
+     *
+     * @param graph - Compiled execution graph to run.
+     * @param input - Initial user-provided input; frozen into `GraphState.input`.
+     * @returns The `GraphState.artifacts` value after the last node completes.
+     */
+    invoke(graph: CompiledExecutionGraph, input: unknown): Promise<unknown>;
+    /**
+     * Execute the graph while yielding `GraphEvent` values at each significant step.
+     *
+     * Events are emitted in strict causal order:
+     * `run_start` → (`node_start` → `node_end` → `edge_transition`?)+ → `run_end`
+     *
+     * Checkpoints are saved according to both the graph-wide `checkpointPolicy` and
+     * per-node `checkpoint` settings. An `interrupt` event causes immediate suspension
+     * followed by a terminal `run_end`.
+     *
+     * @param graph - Compiled execution graph to run.
+     * @param input - Initial user-provided input; frozen into `GraphState.input`.
+     * @yields {GraphEvent} Runtime events in causal order.
+     */
+    stream(graph: CompiledExecutionGraph, input: unknown): AsyncGenerator<GraphEvent>;
+    /**
+     * Resume a previously interrupted run from its latest persisted checkpoint.
+     *
+     * The runtime restores `GraphState` from the checkpoint and re-executes any nodes
+     * that had not yet completed when the run was suspended. Nodes recorded as
+     * `write`, `external`, or `human` effect-class are replayed from their stored
+     * outputs to avoid duplicate side-effects; all other nodes are re-executed.
+     *
+     * @param graph - The same compiled graph that was originally invoked.
+     * @param runId - The run identifier returned by the original `stream()` call.
+     * @returns The final `GraphState.artifacts` value after resumption completes.
+     * @throws {Error} When no checkpoint exists for the given `runId`.
+     */
+    resume(graph: CompiledExecutionGraph, runId: string): Promise<unknown>;
+    /**
+     * Continue execution from a restored checkpoint state.
+     *
+     * Mirrors `stream()` but initialises `completedNodes` / `nodeResults` from the
+     * checkpoint so previously-finished work is not repeated. Nodes with side-effectful
+     * effect classes are replayed from stored outputs; pure / read nodes are re-executed.
+     *
+     * @param graph      - The compiled execution graph.
+     * @param runId      - Original run identifier for checkpoint persistence.
+     * @param state      - `GraphState` restored from the checkpoint.
+     * @param checkpoint - Full checkpoint snapshot; provides `nodeResults` and `visitedNodes`.
+     * @yields {GraphEvent} Runtime events in causal order, starting from the resume point.
+     */
+    private continueFromCheckpoint;
+    /**
+     * Evaluate the outgoing edges from a just-completed node and return the list of
+     * target node ids to activate next.
+     *
+     * Priority rule: if `result.routeTarget` is set (returned by `router` or `guardrail`
+     * nodes) it overrides any edge-derived targets.
+     *
+     * @param edges  - All outgoing edges from the source node.
+     * @param state  - Current `GraphState` passed to condition functions.
+     * @param result - Execution result; `routeTarget` takes precedence when present.
+     * @returns Ordered array of target node ids (may include `END`).
+     */
+    private evaluateEdges;
+    /**
+     * Serialize the current execution state into a `Checkpoint` and persist it
+     * via the injected `ICheckpointStore`.
+     *
+     * @param graph        - The compiled graph (provides `id`).
+     * @param runId        - Unique run identifier assigned at `stream()` call-time.
+     * @param nodeId       - The node at whose boundary the checkpoint is being taken.
+     * @param state        - Current full `GraphState`.
+     * @param nodeResults  - Accumulated per-node execution results.
+     * @param visitedNodes - Ordered list of completed node ids.
+     */
+    private saveCheckpoint;
+}
+//# sourceMappingURL=GraphRuntime.d.ts.map

package/dist/orchestration/runtime/GraphRuntime.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"GraphRuntime.d.ts","sourceRoot":"","sources":["../../../src/orchestration/runtime/GraphRuntime.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;GAkBG;AAEH,OAAO,KAAK,EAAE,sBAAsB,EAAyB,MAAM,gBAAgB,CAAC;AAEpF,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,yBAAyB,CAAC;AAC1D,OAAO,KAAK,EAAE,gBAAgB,EAAc,MAAM,mCAAmC,CAAC;AAGtF,OAAO,EAAE,YAAY,EAA4B,MAAM,mBAAmB,CAAC;AAM3E;;;;;GAKG;AACH,MAAM,WAAW,kBAAkB;IACjC,oDAAoD;IACpD,eAAe,EAAE,gBAAgB,CAAC;IAClC,iEAAiE;IACjE,YAAY,EAAE,YAAY,CAAC;CAC5B;AAMD;;;;;;;;;;;;GAYG;AACH,qBAAa,YAAY;IAIX,OAAO,CAAC,QAAQ,CAAC,MAAM;IAHnC;;OAEG;gBAC0B,MAAM,EAAE,kBAAkB;IAMvD;;;;;;;;;OASG;IACG,MAAM,CAAC,KAAK,EAAE,sBAAsB,EAAE,KAAK,EAAE,OAAO,GAAG,OAAO,CAAC,OAAO,CAAC;IAQ7E;;;;;;;;;;;;;OAaG;IACI,MAAM,CAAC,KAAK,EAAE,sBAAsB,EAAE,KAAK,EAAE,OAAO,GAAG,cAAc,CAAC,UAAU,CAAC;IA2HxF;;;;;;;;;;;;OAYG;IACG,MAAM,CAAC,KAAK,EAAE,sBAAsB,EAAE,KAAK,EAAE,MAAM,GAAG,OAAO,CAAC,OAAO,CAAC;IA0B5E;;;;;;;;;;;;OAYG;YACY,sBAAsB;IA8ErC;;;;;;;;;;;OAWG;IACH,OAAO,CAAC,aAAa;IAwDrB;;;;;;;;;;OAUG;YACW,cAAc;CA2B7B"}

package/dist/orchestration/runtime/GraphRuntime.js

@@ -0,0 +1,381 @@
+/**
+ * @file GraphRuntime.ts
+ * @description Main execution engine for the AgentOS Unified Orchestration Layer.
+ *
+ * `GraphRuntime` ties together the `StateManager`, `NodeScheduler`, `NodeExecutor`,
+ * and `ICheckpointStore` subsystems into a single runnable unit. It supports three
+ * execution modes:
+ *
+ * - **`invoke()`** — execute a graph to completion and return final artifacts.
+ * - **`stream()`** — execute a graph while yielding `GraphEvent` values at every step.
+ * - **`resume()`** — restore a previously interrupted run from its latest checkpoint.
+ *
+ * Design principles:
+ * - No mutable instance state beyond the injected config; each `invoke`/`stream`/`resume`
+ *   call is fully isolated.
+ * - All state lives in `GraphState`; `StateManager` is the sole authority for mutations.
+ * - Checkpointing is always delegated to the injected `ICheckpointStore`.
+ * - Edge evaluation is a pure function of `GraphEdge[]`, `GraphState`, and `NodeExecutionResult`.
+ */
+import { END } from '../ir/types.js';
+import { StateManager } from './StateManager.js';
+import { NodeScheduler } from './NodeScheduler.js';
+// ---------------------------------------------------------------------------
+// GraphRuntime
+// ---------------------------------------------------------------------------
+/**
+ * Main execution engine for compiled AgentOS graphs.
+ *
+ * Instantiate once and reuse across multiple runs — the runtime itself is stateless
+ * between calls. Each `invoke()` / `stream()` / `resume()` call creates isolated local
+ * state tracked via closures.
+ *
+ * @example
+ * ```ts
+ * const runtime = new GraphRuntime({ checkpointStore, nodeExecutor });
+ * const result = await runtime.invoke(compiledGraph, { query: 'hello' });
+ * ```
+ */
+export class GraphRuntime {
+    /**
+     * @param config - Injected dependencies shared across all runs handled by this instance.
+     */
+    constructor(config) {
+        this.config = config;
+    }
+    // ---------------------------------------------------------------------------
+    // Public API
+    // ---------------------------------------------------------------------------
+    /**
+     * Execute the graph to completion and return the final `artifacts` payload.
+     *
+     * This is a convenience wrapper around `stream()` that discards intermediate events
+     * and awaits the terminal `run_end` event.
+     *
+     * @param graph - Compiled execution graph to run.
+     * @param input - Initial user-provided input; frozen into `GraphState.input`.
+     * @returns The `GraphState.artifacts` value after the last node completes.
+     */
+    async invoke(graph, input) {
+        let finalOutput;
+        for await (const event of this.stream(graph, input)) {
+            if (event.type === 'run_end')
+                finalOutput = event.finalOutput;
+        }
+        return finalOutput;
+    }
+    /**
+     * Execute the graph while yielding `GraphEvent` values at each significant step.
+     *
+     * Events are emitted in strict causal order:
+     * `run_start` → (`node_start` → `node_end` → `edge_transition`?)+ → `run_end`
+     *
+     * Checkpoints are saved according to both the graph-wide `checkpointPolicy` and
+     * per-node `checkpoint` settings. An `interrupt` event causes immediate suspension
+     * followed by a terminal `run_end`.
+     *
+     * @param graph - Compiled execution graph to run.
+     * @param input - Initial user-provided input; frozen into `GraphState.input`.
+     * @yields {GraphEvent} Runtime events in causal order.
+     */
+    async *stream(graph, input) {
+        const runId = crypto.randomUUID();
+        const stateManager = new StateManager(graph.reducers);
+        const scheduler = new NodeScheduler(graph.nodes, graph.edges);
+        let state = stateManager.initialize(input);
+        const startTime = Date.now();
+        /** Node ids whose execution has fully completed in this run. */
+        const completedNodes = [];
+        /** Node ids that were bypassed due to conditional routing. */
+        const skippedNodes = [];
+        /** Per-node execution results accumulated for checkpoint persistence. */
+        const nodeResults = {};
+        yield { type: 'run_start', runId, graphId: graph.id };
+        while (true) {
+            const readyNodes = scheduler.getReadyNodes(completedNodes, skippedNodes);
+            if (readyNodes.length === 0)
+                break; // All work is done (or no START edge).
+            for (const nodeId of readyNodes) {
+                const node = graph.nodes.find(n => n.id === nodeId);
+                if (!node) {
+                    // Node declared in edges but missing from nodes array — skip defensively.
+                    skippedNodes.push(nodeId);
+                    continue;
+                }
+                state = stateManager.recordNodeVisit(state, nodeId);
+                // ── Checkpoint BEFORE ────────────────────────────────────────────────
+                if (node.checkpoint === 'before' || node.checkpoint === 'both') {
+                    await this.saveCheckpoint(graph, runId, nodeId, state, nodeResults, completedNodes);
+                    yield { type: 'checkpoint_saved', checkpointId: `${runId}-${nodeId}-before`, nodeId };
+                }
+                yield { type: 'node_start', nodeId, state: { input: state.input, scratch: state.scratch } };
+                const nodeStart = Date.now();
+                // ── Execute ───────────────────────────────────────────────────────────
+                const result = await this.config.nodeExecutor.execute(node, state);
+                const durationMs = Date.now() - nodeStart;
+                nodeResults[nodeId] = {
+                    effectClass: node.effectClass,
+                    output: result.output,
+                    durationMs,
+                };
+                // Apply state patches produced by the node.
+                if (result.scratchUpdate) {
+                    state = stateManager.updateScratch(state, result.scratchUpdate);
+                }
+                if (result.artifactsUpdate) {
+                    state = stateManager.updateArtifacts(state, result.artifactsUpdate);
+                }
+                yield { type: 'node_end', nodeId, output: result.output, durationMs };
+                // ── Human interrupt ───────────────────────────────────────────────────
+                if (result.interrupt) {
+                    yield { type: 'interrupt', nodeId, reason: 'human_approval' };
+                    // Persist so the run can be resumed later.
+                    await this.saveCheckpoint(graph, runId, nodeId, state, nodeResults, completedNodes);
+                    yield {
+                        type: 'run_end',
+                        runId,
+                        finalOutput: state.artifacts,
+                        totalDurationMs: Date.now() - startTime,
+                    };
+                    return;
+                }
+                completedNodes.push(nodeId);
+                // ── Checkpoint AFTER ──────────────────────────────────────────────────
+                if (node.checkpoint === 'after' ||
+                    node.checkpoint === 'both' ||
+                    graph.checkpointPolicy === 'every_node') {
+                    await this.saveCheckpoint(graph, runId, nodeId, state, nodeResults, completedNodes);
+                    yield { type: 'checkpoint_saved', checkpointId: `${runId}-${nodeId}-after`, nodeId };
+                }
+                // ── Edge routing ──────────────────────────────────────────────────────
+                const outEdges = graph.edges.filter(e => e.source === nodeId);
+                const targets = this.evaluateEdges(outEdges, state, result);
+                // Any conditional-edge target that was NOT selected is marked as skipped
+                // so downstream nodes that depend only on the skipped branch do not block.
+                for (const edge of outEdges) {
+                    if (edge.type === 'conditional' || edge.type === 'personality') {
+                        for (const potentialTarget of outEdges.map(e => e.target)) {
+                            if (!targets.includes(potentialTarget) &&
+                                !completedNodes.includes(potentialTarget) &&
+                                !skippedNodes.includes(potentialTarget)) {
+                                skippedNodes.push(potentialTarget);
+                            }
+                        }
+                    }
+                }
+                for (const target of targets) {
+                    if (target !== END) {
+                        const edgeType = outEdges.find(e => e.target === target)?.type ?? 'static';
+                        yield { type: 'edge_transition', sourceId: nodeId, targetId: target, edgeType };
+                    }
+                }
+            }
+        }
+        yield {
+            type: 'run_end',
+            runId,
+            finalOutput: state.artifacts,
+            totalDurationMs: Date.now() - startTime,
+        };
+    }
+    /**
+     * Resume a previously interrupted run from its latest persisted checkpoint.
+     *
+     * The runtime restores `GraphState` from the checkpoint and re-executes any nodes
+     * that had not yet completed when the run was suspended. Nodes recorded as
+     * `write`, `external`, or `human` effect-class are replayed from their stored
+     * outputs to avoid duplicate side-effects; all other nodes are re-executed.
+     *
+     * @param graph - The same compiled graph that was originally invoked.
+     * @param runId - The run identifier returned by the original `stream()` call.
+     * @returns The final `GraphState.artifacts` value after resumption completes.
+     * @throws {Error} When no checkpoint exists for the given `runId`.
+     */
+    async resume(graph, runId) {
+        const checkpoint = await this.config.checkpointStore.latest(runId);
+        if (!checkpoint)
+            throw new Error(`No checkpoint found for run ${runId}`);
+        // Reconstruct graph state from the persisted snapshot.
+        const stateManager = new StateManager(graph.reducers);
+        let state = stateManager.initialize(checkpoint.state.input);
+        state = {
+            ...state,
+            scratch: checkpoint.state.scratch,
+            artifacts: checkpoint.state.artifacts,
+            visitedNodes: [...checkpoint.visitedNodes],
+            iteration: checkpoint.visitedNodes.length,
+        };
+        let finalOutput;
+        for await (const event of this.continueFromCheckpoint(graph, runId, state, checkpoint)) {
+            if (event.type === 'run_end')
+                finalOutput = event.finalOutput;
+        }
+        return finalOutput;
+    }
+    // ---------------------------------------------------------------------------
+    // Private helpers
+    // ---------------------------------------------------------------------------
+    /**
+     * Continue execution from a restored checkpoint state.
+     *
+     * Mirrors `stream()` but initialises `completedNodes` / `nodeResults` from the
+     * checkpoint so previously-finished work is not repeated. Nodes with side-effectful
+     * effect classes are replayed from stored outputs; pure / read nodes are re-executed.
+     *
+     * @param graph      - The compiled execution graph.
+     * @param runId      - Original run identifier for checkpoint persistence.
+     * @param state      - `GraphState` restored from the checkpoint.
+     * @param checkpoint - Full checkpoint snapshot; provides `nodeResults` and `visitedNodes`.
+     * @yields {GraphEvent} Runtime events in causal order, starting from the resume point.
+     */
+    async *continueFromCheckpoint(graph, runId, state, checkpoint) {
+        const scheduler = new NodeScheduler(graph.nodes, graph.edges);
+        const stateManager = new StateManager(graph.reducers);
+        const completedNodes = [...checkpoint.visitedNodes];
+        const skippedNodes = [];
+        const nodeResults = { ...checkpoint.nodeResults };
+        const startTime = Date.now();
+        yield { type: 'run_start', runId, graphId: graph.id };
+        while (true) {
+            const readyNodes = scheduler.getReadyNodes(completedNodes, skippedNodes);
+            if (readyNodes.length === 0)
+                break;
+            for (const nodeId of readyNodes) {
+                const node = graph.nodes.find(n => n.id === nodeId);
+                if (!node) {
+                    skippedNodes.push(nodeId);
+                    continue;
+                }
+                // Nodes with side-effects that were recorded are replayed from stored output
+                // to prevent duplicate writes/calls.
+                const recorded = checkpoint.nodeResults[nodeId];
+                if (recorded &&
+                    (recorded.effectClass === 'write' ||
+                        recorded.effectClass === 'external' ||
+                        recorded.effectClass === 'human')) {
+                    completedNodes.push(nodeId);
+                    yield { type: 'node_end', nodeId, output: recorded.output, durationMs: recorded.durationMs };
+                    continue;
+                }
+                // Re-execute the node (pure / read effects, or nodes without a stored result).
+                state = stateManager.recordNodeVisit(state, nodeId);
+                yield { type: 'node_start', nodeId, state: { input: state.input, scratch: state.scratch } };
+                const nodeStart = Date.now();
+                const result = await this.config.nodeExecutor.execute(node, state);
+                const durationMs = Date.now() - nodeStart;
+                nodeResults[nodeId] = { effectClass: node.effectClass, output: result.output, durationMs };
+                if (result.scratchUpdate)
+                    state = stateManager.updateScratch(state, result.scratchUpdate);
+                if (result.artifactsUpdate)
+                    state = stateManager.updateArtifacts(state, result.artifactsUpdate);
+                yield { type: 'node_end', nodeId, output: result.output, durationMs };
+                completedNodes.push(nodeId);
+                // Evaluate outgoing edges for the resumed node.
+                const outEdges = graph.edges.filter(e => e.source === nodeId);
+                const targets = this.evaluateEdges(outEdges, state, result);
+                for (const target of targets) {
+                    if (target !== END) {
+                        const edgeType = outEdges.find(e => e.target === target)?.type ?? 'static';
+                        yield { type: 'edge_transition', sourceId: nodeId, targetId: target, edgeType };
+                    }
+                }
+            }
+        }
+        yield {
+            type: 'run_end',
+            runId,
+            finalOutput: state.artifacts,
+            totalDurationMs: Date.now() - startTime,
+        };
+    }
+    /**
+     * Evaluate the outgoing edges from a just-completed node and return the list of
+     * target node ids to activate next.
+     *
+     * Priority rule: if `result.routeTarget` is set (returned by `router` or `guardrail`
+     * nodes) it overrides any edge-derived targets.
+     *
+     * @param edges  - All outgoing edges from the source node.
+     * @param state  - Current `GraphState` passed to condition functions.
+     * @param result - Execution result; `routeTarget` takes precedence when present.
+     * @returns Ordered array of target node ids (may include `END`).
+     */
+    evaluateEdges(edges, state, result) {
+        // Router / guardrail nodes return an explicit target that takes precedence.
+        if (result.routeTarget) {
+            return [result.routeTarget];
+        }
+        const targets = [];
+        for (const edge of edges) {
+            switch (edge.type) {
+                case 'static':
+                    // Always follow static edges.
+                    targets.push(edge.target);
+                    break;
+                case 'conditional': {
+                    if (!edge.condition)
+                        break;
+                    let resolvedTarget;
+                    if (edge.condition.type === 'function') {
+                        // Call the author-provided TypeScript routing function.
+                        resolvedTarget = edge.condition.fn(state);
+                    }
+                    else {
+                        // Expression evaluation is a stub; returns the raw expression until the
+                        // DSL interpreter is implemented (tracked separately).
+                        resolvedTarget = edge.target;
+                    }
+                    // Only add the target if the condition resolved to this edge's target.
+                    if (resolvedTarget === edge.target && !targets.includes(resolvedTarget)) {
+                        targets.push(resolvedTarget);
+                    }
+                    break;
+                }
+                case 'personality':
+                    if (edge.personalityCondition) {
+                        // Stub: always route to the 'above' branch until personality integration lands.
+                        targets.push(edge.personalityCondition.above);
+                    }
+                    break;
+                case 'discovery':
+                    // Stub: fall back to the declared fallback target until discovery is wired.
+                    if (edge.discoveryFallback)
+                        targets.push(edge.discoveryFallback);
+                    break;
+            }
+        }
+        return targets;
+    }
+    /**
+     * Serialize the current execution state into a `Checkpoint` and persist it
+     * via the injected `ICheckpointStore`.
+     *
+     * @param graph        - The compiled graph (provides `id`).
+     * @param runId        - Unique run identifier assigned at `stream()` call-time.
+     * @param nodeId       - The node at whose boundary the checkpoint is being taken.
+     * @param state        - Current full `GraphState`.
+     * @param nodeResults  - Accumulated per-node execution results.
+     * @param visitedNodes - Ordered list of completed node ids.
+     */
+    async saveCheckpoint(graph, runId, nodeId, state, nodeResults, visitedNodes) {
+        const checkpoint = {
+            id: `${runId}-${nodeId}-${Date.now()}`,
+            graphId: graph.id,
+            runId,
+            nodeId,
+            timestamp: Date.now(),
+            state: {
+                input: state.input,
+                scratch: state.scratch,
+                artifacts: state.artifacts,
+                diagnostics: state.diagnostics,
+            },
+            // Cast: checkpoint type requires EffectClass but we store as string for flexibility.
+            nodeResults: nodeResults,
+            visitedNodes: [...visitedNodes],
+            pendingEdges: [],
+        };
+        await this.config.checkpointStore.save(checkpoint);
+    }
+}
+//# sourceMappingURL=GraphRuntime.js.map

package/dist/orchestration/runtime/GraphRuntime.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"GraphRuntime.js","sourceRoot":"","sources":["../../../src/orchestration/runtime/GraphRuntime.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;GAkBG;AAGH,OAAO,EAAE,GAAG,EAAE,MAAM,gBAAgB,CAAC;AAGrC,OAAO,EAAE,YAAY,EAAE,MAAM,mBAAmB,CAAC;AACjD,OAAO,EAAE,aAAa,EAAE,MAAM,oBAAoB,CAAC;AAoBnD,8EAA8E;AAC9E,eAAe;AACf,8EAA8E;AAE9E;;;;;;;;;;;;GAYG;AACH,MAAM,OAAO,YAAY;IACvB;;OAEG;IACH,YAA6B,MAA0B;QAA1B,WAAM,GAAN,MAAM,CAAoB;IAAG,CAAC;IAE3D,8EAA8E;IAC9E,aAAa;IACb,8EAA8E;IAE9E;;;;;;;;;OASG;IACH,KAAK,CAAC,MAAM,CAAC,KAA6B,EAAE,KAAc;QACxD,IAAI,WAAoB,CAAC;QACzB,IAAI,KAAK,EAAE,MAAM,KAAK,IAAI,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,KAAK,CAAC,EAAE,CAAC;YACpD,IAAI,KAAK,CAAC,IAAI,KAAK,SAAS;gBAAE,WAAW,GAAG,KAAK,CAAC,WAAW,CAAC;QAChE,CAAC;QACD,OAAO,WAAW,CAAC;IACrB,CAAC;IAED;;;;;;;;;;;;;OAaG;IACH,KAAK,CAAC,CAAC,MAAM,CAAC,KAA6B,EAAE,KAAc;QACzD,MAAM,KAAK,GAAG,MAAM,CAAC,UAAU,EAAE,CAAC;QAClC,MAAM,YAAY,GAAG,IAAI,YAAY,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;QACtD,MAAM,SAAS,GAAG,IAAI,aAAa,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC;QAE9D,IAAI,KAAK,GAAG,YAAY,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;QAC3C,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QAE7B,gEAAgE;QAChE,MAAM,cAAc,GAAa,EAAE,CAAC;QACpC,8DAA8D;QAC9D,MAAM,YAAY,GAAa,EAAE,CAAC;QAClC,yEAAyE;QACzE,MAAM,WAAW,GAAiF,EAAE,CAAC;QAErG,MAAM,EAAE,IAAI,EAAE,WAAW,EAAE,KAAK,EAAE,OAAO,EAAE,KAAK,CAAC,EAAE,EAAE,CAAC;QAEtD,OAAO,IAAI,EAAE,CAAC;YACZ,MAAM,UAAU,GAAG,SAAS,CAAC,aAAa,CAAC,cAAc,EAAE,YAAY,CAAC,CAAC;YACzE,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC;gBAAE,MAAM,CAAC,uCAAuC;YAE3E,KAAK,MAAM,MAAM,IAAI,UAAU,EAAE,CAAC;gBAChC,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,MAAM,CAAC,CAAC;gBACpD,IAAI,CAAC,IAAI,EAAE,CAAC;oBACV,0EAA0E;oBAC1E,YAAY,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;oBAC1B,SAAS;gBACX,CAAC;gBAED,KAAK,GAAG,YAAY,CAAC,eAAe,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;gBAEpD,wEAAwE;gBACxE,IAAI,IAAI,CAAC,UAAU,KAAK,QAAQ,IAAI,IAAI,CAAC,UAAU,KAAK,MAAM,EAAE,CAAC;oBAC/D,MAAM,IAAI,CAAC,cAAc,CAAC,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,WAAW,EAAE,cAAc,CAAC,CAAC;oBACpF,MAAM,EAAE,IAAI,EAAE,kBAAkB,EAAE,YAAY,EAAE,GAAG,KAAK,IAAI,MAAM,SAAS,EAAE,MAAM,EAAE,CAAC;gBACxF,CAAC;gBAED,MAAM,EAAE,IAAI,EAAE,YAAY,EAAE,MAAM,EAAE,KAAK,EAAE,EAAE,KAAK,EAAE,KAAK,CAAC,KAAK,EAAE,OAAO,EAAE,KAAK,CAAC,OAAO,EAAE,EAAE,CAAC;gBAC5F,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;gBAE7B,yEAAyE;gBACzE,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,MAAM,CAAC,YAAY,CAAC,OAAO,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;gBACnE,MAAM,UAAU,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,SAAS,CAAC;gBAE1C,WAAW,CAAC,MAAM,CAAC,GAAG;oBACpB,WAAW,EAAE,IAAI,CAAC,WAAW;oBAC7B,MAAM,EAAE,MAAM,CAAC,MAAM;oBACrB,UAAU;iBACX,CAAC;gBAEF,4CAA4C;gBAC5C,IAAI,MAAM,CAAC,aAAa,EAAE,CAAC;oBACzB,KAAK,GAAG,YAAY,CAAC,aAAa,CAAC,KAAK,EAAE,MAAM,CAAC,aAAa,CAAC,CAAC;gBAClE,CAAC;gBACD,IAAI,MAAM,CAAC,eAAe,EAAE,CAAC;oBAC3B,KAAK,GAAG,YAAY,CAAC,eAAe,CAAC,KAAK,EAAE,MAAM,CAAC,eAAe,CAAC,CAAC;gBACtE,CAAC;gBAED,MAAM,EAAE,IAAI,EAAE,UAAU,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,UAAU,EAAE,CAAC;gBAEtE,yEAAyE;gBACzE,IAAI,MAAM,CAAC,SAAS,EAAE,CAAC;oBACrB,MAAM,EAAE,IAAI,EAAE,WAAW,EAAE,MAAM,EAAE,MAAM,EAAE,gBAAgB,EAAE,CAAC;oBAC9D,2CAA2C;oBAC3C,MAAM,IAAI,CAAC,cAAc,CAAC,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,WAAW,EAAE,cAAc,CAAC,CAAC;oBACpF,MAAM;wBACJ,IAAI,EAAE,SAAS;wBACf,KAAK;wBACL,WAAW,EAAE,KAAK,CAAC,SAAS;wBAC5B,eAAe,EAAE,IAAI,CAAC,GAAG,EAAE,GAAG,SAAS;qBACxC,CAAC;oBACF,OAAO;gBACT,CAAC;gBAED,cAAc,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;gBAE5B,yEAAyE;gBACzE,IACE,IAAI,CAAC,UAAU,KAAK,OAAO;oBAC3B,IAAI,CAAC,UAAU,KAAK,MAAM;oBAC1B,KAAK,CAAC,gBAAgB,KAAK,YAAY,EACvC,CAAC;oBACD,MAAM,IAAI,CAAC,cAAc,CAAC,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,WAAW,EAAE,cAAc,CAAC,CAAC;oBACpF,MAAM,EAAE,IAAI,EAAE,kBAAkB,EAAE,YAAY,EAAE,GAAG,KAAK,IAAI,MAAM,QAAQ,EAAE,MAAM,EAAE,CAAC;gBACvF,CAAC;gBAED,yEAAyE;gBACzE,MAAM,QAAQ,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,MAAM,CAAC,CAAC;gBAC9D,MAAM,OAAO,GAAG,IAAI,CAAC,aAAa,CAAC,QAAQ,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC;gBAE5D,yEAAyE;gBACzE,2EAA2E;gBAC3E,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;oBAC5B,IAAI,IAAI,CAAC,IAAI,KAAK,aAAa,IAAI,IAAI,CAAC,IAAI,KAAK,aAAa,EAAE,CAAC;wBAC/D,KAAK,MAAM,eAAe,IAAI,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC;4BAC1D,IACE,CAAC,OAAO,CAAC,QAAQ,CAAC,eAAe,CAAC;gCAClC,CAAC,cAAc,CAAC,QAAQ,CAAC,eAAe,CAAC;gCACzC,CAAC,YAAY,CAAC,QAAQ,CAAC,eAAe,CAAC,EACvC,CAAC;gCACD,YAAY,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC;4BACrC,CAAC;wBACH,CAAC;oBACH,CAAC;gBACH,CAAC;gBAED,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;oBAC7B,IAAI,MAAM,KAAK,GAAG,EAAE,CAAC;wBACnB,MAAM,QAAQ,GAAG,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,MAAM,CAAC,EAAE,IAAI,IAAI,QAAQ,CAAC;wBAC3E,MAAM,EAAE,IAAI,EAAE,iBAAiB,EAAE,QAAQ,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,EAAE,QAAQ,EAAE,CAAC;oBAClF,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QAED,MAAM;YACJ,IAAI,EAAE,SAAS;YACf,KAAK;YACL,WAAW,EAAE,KAAK,CAAC,SAAS;YAC5B,eAAe,EAAE,IAAI,CAAC,GAAG,EAAE,GAAG,SAAS;SACxC,CAAC;IACJ,CAAC;IAED;;;;;;;;;;;;OAYG;IACH,KAAK,CAAC,MAAM,CAAC,KAA6B,EAAE,KAAa;QACvD,MAAM,UAAU,GAAG,MAAM,IAAI,CAAC,MAAM,CAAC,eAAe,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QACnE,IAAI,CAAC,UAAU;YAAE,MAAM,IAAI,KAAK,CAAC,+BAA+B,KAAK,EAAE,CAAC,CAAC;QAEzE,uDAAuD;QACvD,MAAM,YAAY,GAAG,IAAI,YAAY,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;QACtD,IAAI,KAAK,GAAG,YAAY,CAAC,UAAU,CAAC,UAAU,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;QAC5D,KAAK,GAAG;YACN,GAAG,KAAK;YACR,OAAO,EAAE,UAAU,CAAC,KAAK,CAAC,OAAgC;YAC1D,SAAS,EAAE,UAAU,CAAC,KAAK,CAAC,SAAoC;YAChE,YAAY,EAAE,CAAC,GAAG,UAAU,CAAC,YAAY,CAAC;YAC1C,SAAS,EAAE,UAAU,CAAC,YAAY,CAAC,MAAM;SAC1C,CAAC;QAEF,IAAI,WAAoB,CAAC;QACzB,IAAI,KAAK,EAAE,MAAM,KAAK,IAAI,IAAI,CAAC,sBAAsB,CAAC,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,UAAU,CAAC,EAAE,CAAC;YACvF,IAAI,KAAK,CAAC,IAAI,KAAK,SAAS;gBAAE,WAAW,GAAG,KAAK,CAAC,WAAW,CAAC;QAChE,CAAC;QACD,OAAO,WAAW,CAAC;IACrB,CAAC;IAED,8EAA8E;IAC9E,kBAAkB;IAClB,8EAA8E;IAE9E;;;;;;;;;;;;OAYG;IACK,KAAK,CAAC,CAAC,sBAAsB,CACnC,KAA6B,EAC7B,KAAa,EACb,KAAiB,EACjB,UAAsB;QAEtB,MAAM,SAAS,GAAG,IAAI,aAAa,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC;QAC9D,MAAM,YAAY,GAAG,IAAI,YAAY,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;QAEtD,MAAM,cAAc,GAAG,CAAC,GAAG,UAAU,CAAC,YAAY,CAAC,CAAC;QACpD,MAAM,YAAY,GAAa,EAAE,CAAC;QAClC,MAAM,WAAW,GAAG,EAAE,GAAG,UAAU,CAAC,WAAW,EAAE,CAAC;QAClD,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QAE7B,MAAM,EAAE,IAAI,EAAE,WAAW,EAAE,KAAK,EAAE,OAAO,EAAE,KAAK,CAAC,EAAE,EAAE,CAAC;QAEtD,OAAO,IAAI,EAAE,CAAC;YACZ,MAAM,UAAU,GAAG,SAAS,CAAC,aAAa,CAAC,cAAc,EAAE,YAAY,CAAC,CAAC;YACzE,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC;gBAAE,MAAM;YAEnC,KAAK,MAAM,MAAM,IAAI,UAAU,EAAE,CAAC;gBAChC,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,MAAM,CAAC,CAAC;gBACpD,IAAI,CAAC,IAAI,EAAE,CAAC;oBACV,YAAY,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;oBAC1B,SAAS;gBACX,CAAC;gBAED,6EAA6E;gBAC7E,qCAAqC;gBACrC,MAAM,QAAQ,GAAG,UAAU,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;gBAChD,IACE,QAAQ;oBACR,CAAC,QAAQ,CAAC,WAAW,KAAK,OAAO;wBAC/B,QAAQ,CAAC,WAAW,KAAK,UAAU;wBACnC,QAAQ,CAAC,WAAW,KAAK,OAAO,CAAC,EACnC,CAAC;oBACD,cAAc,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;oBAC5B,MAAM,EAAE,IAAI,EAAE,UAAU,EAAE,MAAM,EAAE,MAAM,EAAE,QAAQ,CAAC,MAAM,EAAE,UAAU,EAAE,QAAQ,CAAC,UAAU,EAAE,CAAC;oBAC7F,SAAS;gBACX,CAAC;gBAED,+EAA+E;gBAC/E,KAAK,GAAG,YAAY,CAAC,eAAe,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;gBACpD,MAAM,EAAE,IAAI,EAAE,YAAY,EAAE,MAAM,EAAE,KAAK,EAAE,EAAE,KAAK,EAAE,KAAK,CAAC,KAAK,EAAE,OAAO,EAAE,KAAK,CAAC,OAAO,EAAE,EAAE,CAAC;gBAC5F,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;gBAE7B,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,MAAM,CAAC,YAAY,CAAC,OAAO,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;gBACnE,MAAM,UAAU,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,SAAS,CAAC;gBAE1C,WAAW,CAAC,MAAM,CAAC,GAAG,EAAE,WAAW,EAAE,IAAI,CAAC,WAAW,EAAE,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,UAAU,EAAE,CAAC;gBAE3F,IAAI,MAAM,CAAC,aAAa;oBAAE,KAAK,GAAG,YAAY,CAAC,aAAa,CAAC,KAAK,EAAE,MAAM,CAAC,aAAa,CAAC,CAAC;gBAC1F,IAAI,MAAM,CAAC,eAAe;oBAAE,KAAK,GAAG,YAAY,CAAC,eAAe,CAAC,KAAK,EAAE,MAAM,CAAC,eAAe,CAAC,CAAC;gBAEhG,MAAM,EAAE,IAAI,EAAE,UAAU,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,UAAU,EAAE,CAAC;gBACtE,cAAc,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;gBAE5B,gDAAgD;gBAChD,MAAM,QAAQ,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,MAAM,CAAC,CAAC;gBAC9D,MAAM,OAAO,GAAG,IAAI,CAAC,aAAa,CAAC,QAAQ,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC;gBAE5D,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;oBAC7B,IAAI,MAAM,KAAK,GAAG,EAAE,CAAC;wBACnB,MAAM,QAAQ,GAAG,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,MAAM,CAAC,EAAE,IAAI,IAAI,QAAQ,CAAC;wBAC3E,MAAM,EAAE,IAAI,EAAE,iBAAiB,EAAE,QAAQ,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,EAAE,QAAQ,EAAE,CAAC;oBAClF,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QAED,MAAM;YACJ,IAAI,EAAE,SAAS;YACf,KAAK;YACL,WAAW,EAAE,KAAK,CAAC,SAAS;YAC5B,eAAe,EAAE,IAAI,CAAC,GAAG,EAAE,GAAG,SAAS;SACxC,CAAC;IACJ,CAAC;IAED;;;;;;;;;;;OAWG;IACK,aAAa,CACnB,KAAkB,EAClB,KAAiB,EACjB,MAA2B;QAE3B,4EAA4E;QAC5E,IAAI,MAAM,CAAC,WAAW,EAAE,CAAC;YACvB,OAAO,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC;QAC9B,CAAC;QAED,MAAM,OAAO,GAAa,EAAE,CAAC;QAE7B,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,QAAQ,IAAI,CAAC,IAAI,EAAE,CAAC;gBAClB,KAAK,QAAQ;oBACX,8BAA8B;oBAC9B,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;oBAC1B,MAAM;gBAER,KAAK,aAAa,CAAC,CAAC,CAAC;oBACnB,IAAI,CAAC,IAAI,CAAC,SAAS;wBAAE,MAAM;oBAE3B,IAAI,cAAsB,CAAC;oBAC3B,IAAI,IAAI,CAAC,SAAS,CAAC,IAAI,KAAK,UAAU,EAAE,CAAC;wBACvC,wDAAwD;wBACxD,cAAc,GAAG,IAAI,CAAC,SAAS,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC;oBAC5C,CAAC;yBAAM,CAAC;wBACN,wEAAwE;wBACxE,uDAAuD;wBACvD,cAAc,GAAG,IAAI,CAAC,MAAM,CAAC;oBAC/B,CAAC;oBAED,uEAAuE;oBACvE,IAAI,cAAc,KAAK,IAAI,CAAC,MAAM,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,cAAc,CAAC,EAAE,CAAC;wBACxE,OAAO,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;oBAC/B,CAAC;oBACD,MAAM;gBACR,CAAC;gBAED,KAAK,aAAa;oBAChB,IAAI,IAAI,CAAC,oBAAoB,EAAE,CAAC;wBAC9B,gFAAgF;wBAChF,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,oBAAoB,CAAC,KAAK,CAAC,CAAC;oBAChD,CAAC;oBACD,MAAM;gBAER,KAAK,WAAW;oBACd,4EAA4E;oBAC5E,IAAI,IAAI,CAAC,iBAAiB;wBAAE,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,iBAAiB,CAAC,CAAC;oBACjE,MAAM;YACV,CAAC;QACH,CAAC;QAED,OAAO,OAAO,CAAC;IACjB,CAAC;IAED;;;;;;;;;;OAUG;IACK,KAAK,CAAC,cAAc,CAC1B,KAA6B,EAC7B,KAAa,EACb,MAAc,EACd,KAAiB,EACjB,WAAyF,EACzF,YAAsB;QAEtB,MAAM,UAAU,GAAe;YAC7B,EAAE,EAAE,GAAG,KAAK,IAAI,MAAM,IAAI,IAAI,CAAC,GAAG,EAAE,EAAE;YACtC,OAAO,EAAE,KAAK,CAAC,EAAE;YACjB,KAAK;YACL,MAAM;YACN,SAAS,EAAE,IAAI,CAAC,GAAG,EAAE;YACrB,KAAK,EAAE;gBACL,KAAK,EAAE,KAAK,CAAC,KAAK;gBAClB,OAAO,EAAE,KAAK,CAAC,OAAO;gBACtB,SAAS,EAAE,KAAK,CAAC,SAAS;gBAC1B,WAAW,EAAE,KAAK,CAAC,WAAW;aAC/B;YACD,qFAAqF;YACrF,WAAW,EAAE,WAAwC;YACrD,YAAY,EAAE,CAAC,GAAG,YAAY,CAAC;YAC/B,YAAY,EAAE,EAAE;SACjB,CAAC;QACF,MAAM,IAAI,CAAC,MAAM,CAAC,eAAe,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;IACrD,CAAC;CACF"}