@bowenqt/qiniu-ai-sdk 0.10.0 → 0.13.0

package/dist/ai/graph/state-graph.js

@@ -0,0 +1,149 @@
+"use strict";
+/**
+ * StateGraph - LangGraph-inspired graph builder.
+ * Minimal implementation for Phase 1.
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.StateGraph = exports.MaxGraphStepsError = void 0;
+const types_1 = require("./types");
+/** Maximum steps error */
+class MaxGraphStepsError extends Error {
+    constructor(maxSteps) {
+        super(`Graph execution exceeded maximum steps: ${maxSteps}`);
+        this.maxSteps = maxSteps;
+        this.name = 'MaxGraphStepsError';
+    }
+}
+exports.MaxGraphStepsError = MaxGraphStepsError;
+/**
+ * StateGraph builder for agent workflows.
+ */
+class StateGraph {
+    constructor(config = {}) {
+        this.config = config;
+        this.nodes = new Map();
+        this.edges = [];
+        this.entryPoint = null;
+        if (config.entryPoint) {
+            this.entryPoint = config.entryPoint;
+        }
+    }
+    /**
+     * Add a node to the graph.
+     */
+    addNode(name, fn) {
+        this.nodes.set(name, { name, fn });
+        // First node is default entry point
+        if (!this.entryPoint) {
+            this.entryPoint = name;
+        }
+        return this;
+    }
+    /**
+     * Add an edge between nodes.
+     */
+    addEdge(from, to) {
+        this.edges.push({ from, to });
+        return this;
+    }
+    /**
+     * Add a conditional edge.
+     */
+    addConditionalEdge(from, resolver) {
+        this.edges.push({ from, to: resolver });
+        return this;
+    }
+    /**
+     * Set the entry point.
+     */
+    setEntryPoint(name) {
+        this.entryPoint = name;
+        return this;
+    }
+    /**
+     * Compile the graph into an executable form.
+     */
+    compile() {
+        if (!this.entryPoint) {
+            throw new Error('Graph has no entry point');
+        }
+        const nodes = new Map(this.nodes);
+        const edges = [...this.edges];
+        const entryPoint = this.entryPoint;
+        return {
+            invoke: async (initialState, options) => {
+                const maxSteps = options?.maxSteps ?? 100;
+                let state = { ...initialState };
+                let currentNode = entryPoint;
+                let steps = 0;
+                while (currentNode && steps < maxSteps) {
+                    const node = nodes.get(currentNode);
+                    if (!node) {
+                        throw new Error(`Node not found: ${currentNode}`);
+                    }
+                    // Execute node
+                    const update = await node.fn(state);
+                    state = { ...state, ...update };
+                    steps++;
+                    // Find next node
+                    const edge = edges.find(e => e.from === currentNode);
+                    if (!edge) {
+                        break; // No outgoing edge, stop
+                    }
+                    if (typeof edge.to === 'string') {
+                        currentNode = edge.to;
+                    }
+                    else {
+                        const next = edge.to(state);
+                        if (next === types_1.END) {
+                            break;
+                        }
+                        currentNode = next;
+                    }
+                }
+                if (steps >= maxSteps) {
+                    throw new MaxGraphStepsError(maxSteps);
+                }
+                return state;
+            },
+            stream: async function* (initialState, options) {
+                const maxSteps = options?.maxSteps ?? 100;
+                let state = { ...initialState };
+                let currentNode = entryPoint;
+                let steps = 0;
+                while (currentNode && steps < maxSteps) {
+                    const node = nodes.get(currentNode);
+                    if (!node) {
+                        throw new Error(`Node not found: ${currentNode}`);
+                    }
+                    // Execute node
+                    const update = await node.fn(state);
+                    state = { ...state, ...update };
+                    steps++;
+                    // Yield current state
+                    yield { node: currentNode, state };
+                    // Find next node
+                    const edge = edges.find(e => e.from === currentNode);
+                    if (!edge) {
+                        break;
+                    }
+                    if (typeof edge.to === 'string') {
+                        currentNode = edge.to;
+                    }
+                    else {
+                        const next = edge.to(state);
+                        if (next === types_1.END) {
+                            break;
+                        }
+                        currentNode = next;
+                    }
+                }
+                if (steps >= maxSteps) {
+                    throw new MaxGraphStepsError(maxSteps);
+                }
+            },
+        };
+    }
+}
+exports.StateGraph = StateGraph;
+//# sourceMappingURL=state-graph.js.map

package/dist/ai/graph/state-graph.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"state-graph.js","sourceRoot":"","sources":["../../../src/ai/graph/state-graph.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;AAWH,mCAA8B;AAE9B,0BAA0B;AAC1B,MAAa,kBAAmB,SAAQ,KAAK;IACzC,YAA4B,QAAgB;QACxC,KAAK,CAAC,2CAA2C,QAAQ,EAAE,CAAC,CAAC;QADrC,aAAQ,GAAR,QAAQ,CAAQ;QAExC,IAAI,CAAC,IAAI,GAAG,oBAAoB,CAAC;IACrC,CAAC;CACJ;AALD,gDAKC;AAED;;GAEG;AACH,MAAa,UAAU;IAKnB,YAAoB,SAA8B,EAAE;QAAhC,WAAM,GAAN,MAAM,CAA0B;QAJ5C,UAAK,GAAG,IAAI,GAAG,EAAwB,CAAC;QACxC,UAAK,GAAmB,EAAE,CAAC;QAC3B,eAAU,GAAkB,IAAI,CAAC;QAGrC,IAAI,MAAM,CAAC,UAAU,EAAE,CAAC;YACpB,IAAI,CAAC,UAAU,GAAG,MAAM,CAAC,UAAU,CAAC;QACxC,CAAC;IACL,CAAC;IAED;;OAEG;IACH,OAAO,CAAC,IAAY,EAAE,EAAmB;QACrC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,IAAI,EAAE,EAAE,EAAE,CAAC,CAAC;QAEnC,oCAAoC;QACpC,IAAI,CAAC,IAAI,CAAC,UAAU,EAAE,CAAC;YACnB,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC;QAC3B,CAAC;QAED,OAAO,IAAI,CAAC;IAChB,CAAC;IAED;;OAEG;IACH,OAAO,CAAC,IAAY,EAAE,EAAU;QAC5B,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,EAAE,EAAE,CAAC,CAAC;QAC9B,OAAO,IAAI,CAAC;IAChB,CAAC;IAED;;OAEG;IACH,kBAAkB,CAAC,IAAY,EAAE,QAAyB;QACtD,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,EAAE,EAAE,QAAQ,EAAE,CAAC,CAAC;QACxC,OAAO,IAAI,CAAC;IAChB,CAAC;IAED;;OAEG;IACH,aAAa,CAAC,IAAY;QACtB,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC;QACvB,OAAO,IAAI,CAAC;IAChB,CAAC;IAED;;OAEG;IACH,OAAO;QACH,IAAI,CAAC,IAAI,CAAC,UAAU,EAAE,CAAC;YACnB,MAAM,IAAI,KAAK,CAAC,0BAA0B,CAAC,CAAC;QAChD,CAAC;QAED,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAClC,MAAM,KAAK,GAAG,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC;QAC9B,MAAM,UAAU,GAAG,IAAI,CAAC,UAAU,CAAC;QAEnC,OAAO;YACH,MAAM,EAAE,KAAK,EAAE,YAAe,EAAE,OAAuB,EAAc,EAAE;gBACnE,MAAM,QAAQ,GAAG,OAAO,EAAE,QAAQ,IAAI,GAAG,CAAC;gBAC1C,IAAI,KAAK,GAAG,EAAE,GAAG,YAAY,EAAE,CAAC;gBAChC,IAAI,WAAW,GAAG,UAAU,CAAC;gBAC7B,IAAI,KAAK,GAAG,CAAC,CAAC;gBAEd,OAAO,WAAW,IAAI,KAAK,GAAG,QAAQ,EAAE,CAAC;oBACrC,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;oBACpC,IAAI,CAAC,IAAI,EAAE,CAAC;wBACR,MAAM,IAAI,KAAK,CAAC,mBAAmB,WAAW,EAAE,CAAC,CAAC;oBACtD,CAAC;oBAED,eAAe;oBACf,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC;oBACpC,KAAK,GAAG,EAAE,GAAG,KAAK,EAAE,GAAG,MAAM,EAAE,CAAC;oBAChC,KAAK,EAAE,CAAC;oBAER,iBAAiB;oBACjB,MAAM,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,WAAW,CAAC,CAAC;oBACrD,IAAI,CAAC,IAAI,EAAE,CAAC;wBACR,MAAM,CAAC,yBAAyB;oBACpC,CAAC;oBAED,IAAI,OAAO,IAAI,CAAC,EAAE,KAAK,QAAQ,EAAE,CAAC;wBAC9B,WAAW,GAAG,IAAI,CAAC,EAAE,CAAC;oBAC1B,CAAC;yBAAM,CAAC;wBACJ,MAAM,IAAI,GAAG,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC;wBAC5B,IAAI,IAAI,KAAK,WAAG,EAAE,CAAC;4BACf,MAAM;wBACV,CAAC;wBACD,WAAW,GAAG,IAAc,CAAC;oBACjC,CAAC;gBACL,CAAC;gBAED,IAAI,KAAK,IAAI,QAAQ,EAAE,CAAC;oBACpB,MAAM,IAAI,kBAAkB,CAAC,QAAQ,CAAC,CAAC;gBAC3C,CAAC;gBAED,OAAO,KAAK,CAAC;YACjB,CAAC;YAED,MAAM,EAAE,KAAK,SAAS,CAAC,EAAE,YAAe,EAAE,OAAuB;gBAC7D,MAAM,QAAQ,GAAG,OAAO,EAAE,QAAQ,IAAI,GAAG,CAAC;gBAC1C,IAAI,KAAK,GAAG,EAAE,GAAG,YAAY,EAAE,CAAC;gBAChC,IAAI,WAAW,GAAG,UAAU,CAAC;gBAC7B,IAAI,KAAK,GAAG,CAAC,CAAC;gBAEd,OAAO,WAAW,IAAI,KAAK,GAAG,QAAQ,EAAE,CAAC;oBACrC,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;oBACpC,IAAI,CAAC,IAAI,EAAE,CAAC;wBACR,MAAM,IAAI,KAAK,CAAC,mBAAmB,WAAW,EAAE,CAAC,CAAC;oBACtD,CAAC;oBAED,eAAe;oBACf,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC;oBACpC,KAAK,GAAG,EAAE,GAAG,KAAK,EAAE,GAAG,MAAM,EAAE,CAAC;oBAChC,KAAK,EAAE,CAAC;oBAER,sBAAsB;oBACtB,MAAM,EAAE,IAAI,EAAE,WAAW,EAAE,KAAK,EAAE,CAAC;oBAEnC,iBAAiB;oBACjB,MAAM,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,WAAW,CAAC,CAAC;oBACrD,IAAI,CAAC,IAAI,EAAE,CAAC;wBACR,MAAM;oBACV,CAAC;oBAED,IAAI,OAAO,IAAI,CAAC,EAAE,KAAK,QAAQ,EAAE,CAAC;wBAC9B,WAAW,GAAG,IAAI,CAAC,EAAE,CAAC;oBAC1B,CAAC;yBAAM,CAAC;wBACJ,MAAM,IAAI,GAAG,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC;wBAC5B,IAAI,IAAI,KAAK,WAAG,EAAE,CAAC;4BACf,MAAM;wBACV,CAAC;wBACD,WAAW,GAAG,IAAc,CAAC;oBACjC,CAAC;gBACL,CAAC;gBAED,IAAI,KAAK,IAAI,QAAQ,EAAE,CAAC;oBACpB,MAAM,IAAI,kBAAkB,CAAC,QAAQ,CAAC,CAAC;gBAC3C,CAAC;YACL,CAAC;SACJ,CAAC;IACN,CAAC;CACJ;AAlJD,gCAkJC"}

package/dist/ai/graph/state-graph.mjs

@@ -0,0 +1,144 @@
+/**
+ * StateGraph - LangGraph-inspired graph builder.
+ * Minimal implementation for Phase 1.
+ */
+import { END } from './types.mjs';
+/** Maximum steps error */
+export class MaxGraphStepsError extends Error {
+    constructor(maxSteps) {
+        super(`Graph execution exceeded maximum steps: ${maxSteps}`);
+        this.maxSteps = maxSteps;
+        this.name = 'MaxGraphStepsError';
+    }
+}
+/**
+ * StateGraph builder for agent workflows.
+ */
+export class StateGraph {
+    constructor(config = {}) {
+        this.config = config;
+        this.nodes = new Map();
+        this.edges = [];
+        this.entryPoint = null;
+        if (config.entryPoint) {
+            this.entryPoint = config.entryPoint;
+        }
+    }
+    /**
+     * Add a node to the graph.
+     */
+    addNode(name, fn) {
+        this.nodes.set(name, { name, fn });
+        // First node is default entry point
+        if (!this.entryPoint) {
+            this.entryPoint = name;
+        }
+        return this;
+    }
+    /**
+     * Add an edge between nodes.
+     */
+    addEdge(from, to) {
+        this.edges.push({ from, to });
+        return this;
+    }
+    /**
+     * Add a conditional edge.
+     */
+    addConditionalEdge(from, resolver) {
+        this.edges.push({ from, to: resolver });
+        return this;
+    }
+    /**
+     * Set the entry point.
+     */
+    setEntryPoint(name) {
+        this.entryPoint = name;
+        return this;
+    }
+    /**
+     * Compile the graph into an executable form.
+     */
+    compile() {
+        if (!this.entryPoint) {
+            throw new Error('Graph has no entry point');
+        }
+        const nodes = new Map(this.nodes);
+        const edges = [...this.edges];
+        const entryPoint = this.entryPoint;
+        return {
+            invoke: async (initialState, options) => {
+                const maxSteps = options?.maxSteps ?? 100;
+                let state = { ...initialState };
+                let currentNode = entryPoint;
+                let steps = 0;
+                while (currentNode && steps < maxSteps) {
+                    const node = nodes.get(currentNode);
+                    if (!node) {
+                        throw new Error(`Node not found: ${currentNode}`);
+                    }
+                    // Execute node
+                    const update = await node.fn(state);
+                    state = { ...state, ...update };
+                    steps++;
+                    // Find next node
+                    const edge = edges.find(e => e.from === currentNode);
+                    if (!edge) {
+                        break; // No outgoing edge, stop
+                    }
+                    if (typeof edge.to === 'string') {
+                        currentNode = edge.to;
+                    }
+                    else {
+                        const next = edge.to(state);
+                        if (next === END) {
+                            break;
+                        }
+                        currentNode = next;
+                    }
+                }
+                if (steps >= maxSteps) {
+                    throw new MaxGraphStepsError(maxSteps);
+                }
+                return state;
+            },
+            stream: async function* (initialState, options) {
+                const maxSteps = options?.maxSteps ?? 100;
+                let state = { ...initialState };
+                let currentNode = entryPoint;
+                let steps = 0;
+                while (currentNode && steps < maxSteps) {
+                    const node = nodes.get(currentNode);
+                    if (!node) {
+                        throw new Error(`Node not found: ${currentNode}`);
+                    }
+                    // Execute node
+                    const update = await node.fn(state);
+                    state = { ...state, ...update };
+                    steps++;
+                    // Yield current state
+                    yield { node: currentNode, state };
+                    // Find next node
+                    const edge = edges.find(e => e.from === currentNode);
+                    if (!edge) {
+                        break;
+                    }
+                    if (typeof edge.to === 'string') {
+                        currentNode = edge.to;
+                    }
+                    else {
+                        const next = edge.to(state);
+                        if (next === END) {
+                            break;
+                        }
+                        currentNode = next;
+                    }
+                }
+                if (steps >= maxSteps) {
+                    throw new MaxGraphStepsError(maxSteps);
+                }
+            },
+        };
+    }
+}
+//# sourceMappingURL=state-graph.js.map

package/dist/ai/graph/types.d.ts

@@ -0,0 +1,41 @@
+/**
+ * Graph Runtime types.
+ * Minimal implementation for Phase 1.
+ */
+/** Graph node function signature */
+export type NodeFunction<S> = (state: S) => Promise<Partial<S>> | Partial<S>;
+/** Edge destination resolver */
+export type EdgeResolver<S> = (state: S) => string | typeof END;
+/** Special end symbol */
+export declare const END: unique symbol;
+/** Graph node definition */
+export interface GraphNode<S> {
+    name: string;
+    fn: NodeFunction<S>;
+}
+/** Graph edge definition */
+export interface GraphEdge<S> {
+    from: string;
+    to: string | EdgeResolver<S>;
+}
+/** Compiled graph */
+export interface CompiledGraph<S> {
+    invoke: (initialState: S, options?: InvokeOptions) => Promise<S>;
+    stream: (initialState: S, options?: InvokeOptions) => AsyncGenerator<{
+        node: string;
+        state: S;
+    }>;
+}
+/** Invoke options */
+export interface InvokeOptions {
+    /** Thread ID for checkpointing */
+    threadId?: string;
+    /** Maximum number of steps */
+    maxSteps?: number;
+}
+/** Graph builder config */
+export interface StateGraphConfig<S> {
+    /** Entry point node */
+    entryPoint?: string;
+}
+//# sourceMappingURL=types.d.ts.map

package/dist/ai/graph/types.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../../../src/ai/graph/types.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,oCAAoC;AACpC,MAAM,MAAM,YAAY,CAAC,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,KAAK,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;AAE7E,gCAAgC;AAChC,MAAM,MAAM,YAAY,CAAC,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,KAAK,MAAM,GAAG,OAAO,GAAG,CAAC;AAEhE,yBAAyB;AACzB,eAAO,MAAM,GAAG,eAAgB,CAAC;AAEjC,4BAA4B;AAC5B,MAAM,WAAW,SAAS,CAAC,CAAC;IACxB,IAAI,EAAE,MAAM,CAAC;IACb,EAAE,EAAE,YAAY,CAAC,CAAC,CAAC,CAAC;CACvB;AAED,4BAA4B;AAC5B,MAAM,WAAW,SAAS,CAAC,CAAC;IACxB,IAAI,EAAE,MAAM,CAAC;IACb,EAAE,EAAE,MAAM,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC;CAChC;AAED,qBAAqB;AACrB,MAAM,WAAW,aAAa,CAAC,CAAC;IAC5B,MAAM,EAAE,CAAC,YAAY,EAAE,CAAC,EAAE,OAAO,CAAC,EAAE,aAAa,KAAK,OAAO,CAAC,CAAC,CAAC,CAAC;IACjE,MAAM,EAAE,CAAC,YAAY,EAAE,CAAC,EAAE,OAAO,CAAC,EAAE,aAAa,KAAK,cAAc,CAAC;QAAE,IAAI,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,CAAC,CAAA;KAAE,CAAC,CAAC;CACpG;AAED,qBAAqB;AACrB,MAAM,WAAW,aAAa;IAC1B,kCAAkC;IAClC,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,8BAA8B;IAC9B,QAAQ,CAAC,EAAE,MAAM,CAAC;CACrB;AAED,2BAA2B;AAC3B,MAAM,WAAW,gBAAgB,CAAC,CAAC;IAC/B,uBAAuB;IACvB,UAAU,CAAC,EAAE,MAAM,CAAC;CACvB"}

package/dist/ai/graph/types.js

@@ -0,0 +1,10 @@
+"use strict";
+/**
+ * Graph Runtime types.
+ * Minimal implementation for Phase 1.
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.END = void 0;
+/** Special end symbol */
+exports.END = Symbol('END');
+//# sourceMappingURL=types.js.map

package/dist/ai/graph/types.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.js","sourceRoot":"","sources":["../../../src/ai/graph/types.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;AAQH,yBAAyB;AACZ,QAAA,GAAG,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC"}

package/dist/ai/graph/types.mjs

@@ -0,0 +1,7 @@
+/**
+ * Graph Runtime types.
+ * Minimal implementation for Phase 1.
+ */
+/** Special end symbol */
+export const END = Symbol('END');
+//# sourceMappingURL=types.js.map

package/dist/ai/internal-types.d.ts

@@ -0,0 +1,109 @@
+/**
+ * Internal types for Agent Graph execution.
+ * These types extend public types with internal metadata.
+ */
+import type { ChatMessage, ToolCall } from '../lib/types';
+import type { RegisteredTool } from '../lib/tool-registry';
+/**
+ * Internal metadata for messages.
+ * Stripped before sending to API.
+ */
+export interface MessageMeta {
+    /** Skill ID for skill-injected messages */
+    skillId?: string;
+    /** Whether this message can be dropped during compaction */
+    droppable?: boolean;
+    /** Original message index before injection */
+    originalIndex?: number;
+    /** Skill priority for stable compaction (lower = drop first) */
+    priority?: number;
+}
+/**
+ * Internal message with metadata.
+ * API-bound messages have _meta stripped.
+ */
+export interface InternalMessage extends ChatMessage {
+    _meta?: MessageMeta;
+}
+/**
+ * Agent state for graph execution.
+ */
+export interface AgentState {
+    /** Current messages in conversation */
+    messages: InternalMessage[];
+    /** Injected skills with metadata */
+    skills: InjectedSkill[];
+    /** Available tools */
+    tools: Map<string, RegisteredTool>;
+    /** Current step count */
+    stepCount: number;
+    /** Maximum allowed steps */
+    maxSteps: number;
+    /** Whether execution is complete */
+    done: boolean;
+    /** Final text output */
+    output: string;
+    /** Accumulated reasoning */
+    reasoning: string;
+    /** Finish reason from last prediction */
+    finishReason: string | null;
+    /** Token usage */
+    usage?: {
+        prompt_tokens: number;
+        completion_tokens: number;
+        total_tokens: number;
+    };
+    /** Abort signal for cancellation */
+    abortSignal?: AbortSignal;
+}
+/**
+ * Injected skill with position info for compaction.
+ */
+export interface InjectedSkill {
+    /** Skill name */
+    name: string;
+    /** Priority for compaction (lower = drop first) */
+    priority: number;
+    /** Message index in messages array */
+    messageIndex: number;
+    /** Estimated token count */
+    tokenCount: number;
+}
+/**
+ * Step result for event callbacks.
+ */
+export interface StepResult {
+    type: 'text' | 'tool_call' | 'tool_result';
+    content: string;
+    reasoning?: string;
+    toolCalls?: ToolCall[];
+    toolResults?: {
+        toolCallId: string;
+        result: string;
+    }[];
+}
+/**
+ * Agent graph events.
+ * Note: onToken is not supported in Phase 2 (no token-level streaming).
+ */
+export interface AgentGraphEvents {
+    /** Called when a step completes */
+    onStepFinish?: (step: StepResult) => void;
+    /** Called when entering a node */
+    onNodeEnter?: (nodeName: string) => void;
+    /** Called when exiting a node */
+    onNodeExit?: (nodeName: string) => void;
+}
+/**
+ * Strip internal metadata from messages before API call.
+ */
+export declare function stripMeta(messages: InternalMessage[]): ChatMessage[];
+/**
+ * Check if message is droppable during compaction.
+ */
+export declare function isDroppable(message: InternalMessage): boolean;
+/**
+ * Get skill ID from message.
+ */
+export declare function getSkillId(message: InternalMessage): string | undefined;
+//# sourceMappingURL=internal-types.d.ts.map

package/dist/ai/internal-types.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"internal-types.d.ts","sourceRoot":"","sources":["../../src/ai/internal-types.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,KAAK,EAAE,WAAW,EAAE,QAAQ,EAAE,MAAM,cAAc,CAAC;AAC1D,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,sBAAsB,CAAC;AAG3D;;;GAGG;AACH,MAAM,WAAW,WAAW;IACxB,2CAA2C;IAC3C,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,4DAA4D;IAC5D,SAAS,CAAC,EAAE,OAAO,CAAC;IACpB,8CAA8C;IAC9C,aAAa,CAAC,EAAE,MAAM,CAAC;IACvB,gEAAgE;IAChE,QAAQ,CAAC,EAAE,MAAM,CAAC;CACrB;AAED;;;GAGG;AACH,MAAM,WAAW,eAAgB,SAAQ,WAAW;IAChD,KAAK,CAAC,EAAE,WAAW,CAAC;CACvB;AAED;;GAEG;AACH,MAAM,WAAW,UAAU;IACvB,uCAAuC;IACvC,QAAQ,EAAE,eAAe,EAAE,CAAC;IAC5B,oCAAoC;IACpC,MAAM,EAAE,aAAa,EAAE,CAAC;IACxB,sBAAsB;IACtB,KAAK,EAAE,GAAG,CAAC,MAAM,EAAE,cAAc,CAAC,CAAC;IACnC,yBAAyB;IACzB,SAAS,EAAE,MAAM,CAAC;IAClB,4BAA4B;IAC5B,QAAQ,EAAE,MAAM,CAAC;IACjB,oCAAoC;IACpC,IAAI,EAAE,OAAO,CAAC;IACd,wBAAwB;IACxB,MAAM,EAAE,MAAM,CAAC;IACf,4BAA4B;IAC5B,SAAS,EAAE,MAAM,CAAC;IAClB,yCAAyC;IACzC,YAAY,EAAE,MAAM,GAAG,IAAI,CAAC;IAC5B,kBAAkB;IAClB,KAAK,CAAC,EAAE;QACJ,aAAa,EAAE,MAAM,CAAC;QACtB,iBAAiB,EAAE,MAAM,CAAC;QAC1B,YAAY,EAAE,MAAM,CAAC;KACxB,CAAC;IACF,oCAAoC;IACpC,WAAW,CAAC,EAAE,WAAW,CAAC;CAC7B;AAED;;GAEG;AACH,MAAM,WAAW,aAAa;IAC1B,iBAAiB;IACjB,IAAI,EAAE,MAAM,CAAC;IACb,mDAAmD;IACnD,QAAQ,EAAE,MAAM,CAAC;IACjB,sCAAsC;IACtC,YAAY,EAAE,MAAM,CAAC;IACrB,4BAA4B;IAC5B,UAAU,EAAE,MAAM,CAAC;CACtB;AAED;;GAEG;AACH,MAAM,WAAW,UAAU;IACvB,IAAI,EAAE,MAAM,GAAG,WAAW,GAAG,aAAa,CAAC;IAC3C,OAAO,EAAE,MAAM,CAAC;IAChB,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,SAAS,CAAC,EAAE,QAAQ,EAAE,CAAC;IACvB,WAAW,CAAC,EAAE;QAAE,UAAU,EAAE,MAAM,CAAC;QAAC,MAAM,EAAE,MAAM,CAAA;KAAE,EAAE,CAAC;CAC1D;AAED;;;GAGG;AACH,MAAM,WAAW,gBAAgB;IAC7B,mCAAmC;IACnC,YAAY,CAAC,EAAE,CAAC,IAAI,EAAE,UAAU,KAAK,IAAI,CAAC;IAC1C,kCAAkC;IAClC,WAAW,CAAC,EAAE,CAAC,QAAQ,EAAE,MAAM,KAAK,IAAI,CAAC;IACzC,iCAAiC;IACjC,UAAU,CAAC,EAAE,CAAC,QAAQ,EAAE,MAAM,KAAK,IAAI,CAAC;CAC3C;AAED;;GAEG;AACH,wBAAgB,SAAS,CAAC,QAAQ,EAAE,eAAe,EAAE,GAAG,WAAW,EAAE,CAEpE;AAED;;GAEG;AACH,wBAAgB,WAAW,CAAC,OAAO,EAAE,eAAe,GAAG,OAAO,CAE7D;AAED;;GAEG;AACH,wBAAgB,UAAU,CAAC,OAAO,EAAE,eAAe,GAAG,MAAM,GAAG,SAAS,CAEvE"}

package/dist/ai/internal-types.js

@@ -0,0 +1,28 @@
+"use strict";
+/**
+ * Internal types for Agent Graph execution.
+ * These types extend public types with internal metadata.
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.stripMeta = stripMeta;
+exports.isDroppable = isDroppable;
+exports.getSkillId = getSkillId;
+/**
+ * Strip internal metadata from messages before API call.
+ */
+function stripMeta(messages) {
+    return messages.map(({ _meta, ...msg }) => msg);
+}
+/**
+ * Check if message is droppable during compaction.
+ */
+function isDroppable(message) {
+    return message._meta?.droppable === true;
+}
+/**
+ * Get skill ID from message.
+ */
+function getSkillId(message) {
+    return message._meta?.skillId;
+}
+//# sourceMappingURL=internal-types.js.map

package/dist/ai/internal-types.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"internal-types.js","sourceRoot":"","sources":["../../src/ai/internal-types.ts"],"names":[],"mappings":";AAAA;;;GAGG;;AAsGH,8BAEC;AAKD,kCAEC;AAKD,gCAEC;AAnBD;;GAEG;AACH,SAAgB,SAAS,CAAC,QAA2B;IACjD,OAAO,QAAQ,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,EAAE,GAAG,GAAG,EAAE,EAAE,EAAE,CAAC,GAAkB,CAAC,CAAC;AACnE,CAAC;AAED;;GAEG;AACH,SAAgB,WAAW,CAAC,OAAwB;IAChD,OAAO,OAAO,CAAC,KAAK,EAAE,SAAS,KAAK,IAAI,CAAC;AAC7C,CAAC;AAED;;GAEG;AACH,SAAgB,UAAU,CAAC,OAAwB;IAC/C,OAAO,OAAO,CAAC,KAAK,EAAE,OAAO,CAAC;AAClC,CAAC"}

package/dist/ai/internal-types.mjs

@@ -0,0 +1,23 @@
+/**
+ * Internal types for Agent Graph execution.
+ * These types extend public types with internal metadata.
+ */
+/**
+ * Strip internal metadata from messages before API call.
+ */
+export function stripMeta(messages) {
+    return messages.map(({ _meta, ...msg }) => msg);
+}
+/**
+ * Check if message is droppable during compaction.
+ */
+export function isDroppable(message) {
+    return message._meta?.droppable === true;
+}
+/**
+ * Get skill ID from message.
+ */
+export function getSkillId(message) {
+    return message._meta?.skillId;
+}
+//# sourceMappingURL=internal-types.js.map

package/dist/ai/nodes/execute-node.d.ts

@@ -0,0 +1,27 @@
+/**
+ * ExecuteNode - Tool execution abstraction.
+ * Extracted from generateText for modular use in Graph Runtime.
+ */
+import type { ChatMessage, ToolCall } from '../../lib/types';
+import type { RegisteredTool } from '../../lib/tool-registry';
+/** Tool execution context */
+export interface ExecutionContext {
+    toolCallId: string;
+    messages: ChatMessage[];
+    abortSignal?: AbortSignal;
+}
+/** Tool result */
+export interface ToolExecutionResult {
+    toolCallId: string;
+    result: string;
+    isError: boolean;
+}
+/**
+ * Execute tools based on tool calls from LLM.
+ */
+export declare function executeTools(toolCalls: ToolCall[], tools: Map<string, RegisteredTool>, context: Omit<ExecutionContext, 'toolCallId'>): Promise<ToolExecutionResult[]>;
+/**
+ * Convert tool execution results to chat messages.
+ */
+export declare function toolResultsToMessages(results: ToolExecutionResult[]): ChatMessage[];
+//# sourceMappingURL=execute-node.d.ts.map

package/dist/ai/nodes/execute-node.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"execute-node.d.ts","sourceRoot":"","sources":["../../../src/ai/nodes/execute-node.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,KAAK,EAAE,WAAW,EAAE,QAAQ,EAAE,MAAM,iBAAiB,CAAC;AAC7D,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,yBAAyB,CAAC;AAG9D,6BAA6B;AAC7B,MAAM,WAAW,gBAAgB;IAC7B,UAAU,EAAE,MAAM,CAAC;IACnB,QAAQ,EAAE,WAAW,EAAE,CAAC;IACxB,WAAW,CAAC,EAAE,WAAW,CAAC;CAC7B;AAED,kBAAkB;AAClB,MAAM,WAAW,mBAAmB;IAChC,UAAU,EAAE,MAAM,CAAC;IACnB,MAAM,EAAE,MAAM,CAAC;IACf,OAAO,EAAE,OAAO,CAAC;CACpB;AAED;;GAEG;AACH,wBAAsB,YAAY,CAC9B,SAAS,EAAE,QAAQ,EAAE,EACrB,KAAK,EAAE,GAAG,CAAC,MAAM,EAAE,cAAc,CAAC,EAClC,OAAO,EAAE,IAAI,CAAC,gBAAgB,EAAE,YAAY,CAAC,GAC9C,OAAO,CAAC,mBAAmB,EAAE,CAAC,CAgEhC;AAED;;GAEG;AACH,wBAAgB,qBAAqB,CAAC,OAAO,EAAE,mBAAmB,EAAE,GAAG,WAAW,EAAE,CAMnF"}