@nodetool-ai/agents 0.7.0-rc.11

package/dist/base-agent.js

@@ -0,0 +1,29 @@
+/**
+ * Abstract base class for all agents.
+ *
+ * Port of src/nodetool/agents/base_agent.py
+ */
+import { DEFAULT_TOKEN_LIMIT } from "./constants.js";
+export class BaseAgent {
+    name;
+    objective;
+    provider;
+    model;
+    tools;
+    inputs;
+    systemPrompt;
+    maxTokenLimit;
+    results = null;
+    task = null;
+    constructor(opts) {
+        this.name = opts.name;
+        this.objective = opts.objective;
+        this.provider = opts.provider;
+        this.model = opts.model;
+        this.tools = opts.tools ?? [];
+        this.inputs = opts.inputs ?? {};
+        this.systemPrompt = opts.systemPrompt ?? "";
+        this.maxTokenLimit = opts.maxTokenLimit ?? DEFAULT_TOKEN_LIMIT;
+    }
+}
+//# sourceMappingURL=base-agent.js.map

package/dist/base-agent.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"base-agent.js","sourceRoot":"","sources":["../src/base-agent.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAOH,OAAO,EAAE,mBAAmB,EAAE,MAAM,gBAAgB,CAAC;AAErD,MAAM,OAAgB,SAAS;IACpB,IAAI,CAAS;IACb,SAAS,CAAS;IAClB,QAAQ,CAAe;IACvB,KAAK,CAAS;IACd,KAAK,CAAS;IACd,MAAM,CAA0B;IAChC,YAAY,CAAS;IACrB,aAAa,CAAS;IAC/B,OAAO,GAAY,IAAI,CAAC;IACxB,IAAI,GAAgB,IAAI,CAAC;IAEzB,YAAY,IASX;QACC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;QACtB,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,SAAS,CAAC;QAChC,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC;QAC9B,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC;QACxB,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,IAAI,EAAE,CAAC;QAC9B,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,IAAI,EAAE,CAAC;QAChC,IAAI,CAAC,YAAY,GAAG,IAAI,CAAC,YAAY,IAAI,EAAE,CAAC;QAC5C,IAAI,CAAC,aAAa,GAAG,IAAI,CAAC,aAAa,IAAI,mBAAmB,CAAC;IACjE,CAAC;CAcF"}

package/dist/constants.d.ts

@@ -0,0 +1,8 @@
+/**
+ * Shared constants for the agents package.
+ */
+/** Default context window token limit shared across all executors. */
+export declare const DEFAULT_TOKEN_LIMIT = 128000;
+/** Maximum characters to retain from a single tool result. */
+export declare const MAX_TOOL_RESULT_CHARS = 25000;
+//# sourceMappingURL=constants.d.ts.map

package/dist/constants.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"constants.d.ts","sourceRoot":"","sources":["../src/constants.ts"],"names":[],"mappings":"AAAA;;GAEG;AAEH,sEAAsE;AACtE,eAAO,MAAM,mBAAmB,SAAU,CAAC;AAE3C,8DAA8D;AAC9D,eAAO,MAAM,qBAAqB,QAAS,CAAC"}

package/dist/constants.js

@@ -0,0 +1,8 @@
+/**
+ * Shared constants for the agents package.
+ */
+/** Default context window token limit shared across all executors. */
+export const DEFAULT_TOKEN_LIMIT = 128_000;
+/** Maximum characters to retain from a single tool result. */
+export const MAX_TOOL_RESULT_CHARS = 25_000;
+//# sourceMappingURL=constants.js.map

package/dist/constants.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"constants.js","sourceRoot":"","sources":["../src/constants.ts"],"names":[],"mappings":"AAAA;;GAEG;AAEH,sEAAsE;AACtE,MAAM,CAAC,MAAM,mBAAmB,GAAG,OAAO,CAAC;AAE3C,8DAA8D;AAC9D,MAAM,CAAC,MAAM,qBAAqB,GAAG,MAAM,CAAC"}

package/dist/graph-builder.d.ts

@@ -0,0 +1,49 @@
+/**
+ * GraphBuilder -- stateful in-memory graph accumulator for the graph planner.
+ *
+ * The planner LLM calls add_node / add_edge tools which mutate a shared
+ * GraphBuilder instance. Once the LLM calls finish_graph, the builder
+ * validates and produces a GraphData object for WorkflowRunner.
+ */
+import type { NodeDescriptor, GraphData } from "@nodetool-ai/protocol";
+/** The virtual node type used for LLM-driven agent steps. */
+export declare const AGENT_STEP_NODE_TYPE = "nodetool.agents.AgentStep";
+export declare class GraphBuilder {
+    private readonly _nodes;
+    private readonly _edges;
+    private _built;
+    /** All node IDs currently in the graph. */
+    get nodeIds(): ReadonlySet<string>;
+    /** Number of nodes in the graph. */
+    get nodeCount(): number;
+    /** Number of edges in the graph. */
+    get edgeCount(): number;
+    /** Check whether a node ID is already registered. */
+    hasNode(id: string): boolean;
+    /** Get a node descriptor by ID. */
+    getNode(id: string): NodeDescriptor | undefined;
+    /**
+     * Add a node to the graph.
+     * Returns an array of validation errors (empty = success).
+     */
+    addNode(id: string, type: string, properties?: Record<string, unknown>, name?: string): string[];
+    /**
+     * Add an edge connecting two nodes.
+     * Returns an array of validation errors (empty = success).
+     */
+    addEdge(source: string, sourceHandle: string, target: string, targetHandle: string): string[];
+    /**
+     * Validate the full graph: cycle detection, dangling edge references,
+     * and at least one node.
+     * Returns an array of errors (empty = valid).
+     */
+    validate(): string[];
+    /**
+     * Finalize and return the graph as GraphData.
+     * Throws if validation fails.
+     */
+    build(): GraphData;
+    /** Reset the builder for reuse. */
+    reset(): void;
+}
+//# sourceMappingURL=graph-builder.d.ts.map

package/dist/graph-builder.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph-builder.d.ts","sourceRoot":"","sources":["../src/graph-builder.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,OAAO,KAAK,EAAE,cAAc,EAAQ,SAAS,EAAE,MAAM,uBAAuB,CAAC;AAE7E,6DAA6D;AAC7D,eAAO,MAAM,oBAAoB,8BAA8B,CAAC;AAEhE,qBAAa,YAAY;IACvB,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAqC;IAC5D,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAc;IACrC,OAAO,CAAC,MAAM,CAAS;IAEvB,2CAA2C;IAC3C,IAAI,OAAO,IAAI,WAAW,CAAC,MAAM,CAAC,CAEjC;IAED,oCAAoC;IACpC,IAAI,SAAS,IAAI,MAAM,CAEtB;IAED,oCAAoC;IACpC,IAAI,SAAS,IAAI,MAAM,CAEtB;IAED,qDAAqD;IACrD,OAAO,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO;IAI5B,mCAAmC;IACnC,OAAO,CAAC,EAAE,EAAE,MAAM,GAAG,cAAc,GAAG,SAAS;IAI/C;;;OAGG;IACH,OAAO,CACL,EAAE,EAAE,MAAM,EACV,IAAI,EAAE,MAAM,EACZ,UAAU,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,EACpC,IAAI,CAAC,EAAE,MAAM,GACZ,MAAM,EAAE;IA8BX;;;OAGG;IACH,OAAO,CACL,MAAM,EAAE,MAAM,EACd,YAAY,EAAE,MAAM,EACpB,MAAM,EAAE,MAAM,EACd,YAAY,EAAE,MAAM,GACnB,MAAM,EAAE;IA0CX;;;;OAIG;IACH,QAAQ,IAAI,MAAM,EAAE;IAyDpB;;;OAGG;IACH,KAAK,IAAI,SAAS;IA0ClB,mCAAmC;IACnC,KAAK,IAAI,IAAI;CAKd"}

package/dist/graph-builder.js

@@ -0,0 +1,206 @@
+/**
+ * GraphBuilder -- stateful in-memory graph accumulator for the graph planner.
+ *
+ * The planner LLM calls add_node / add_edge tools which mutate a shared
+ * GraphBuilder instance. Once the LLM calls finish_graph, the builder
+ * validates and produces a GraphData object for WorkflowRunner.
+ */
+/** The virtual node type used for LLM-driven agent steps. */
+export const AGENT_STEP_NODE_TYPE = "nodetool.agents.AgentStep";
+export class GraphBuilder {
+    _nodes = new Map();
+    _edges = [];
+    _built = false;
+    /** All node IDs currently in the graph. */
+    get nodeIds() {
+        return new Set(this._nodes.keys());
+    }
+    /** Number of nodes in the graph. */
+    get nodeCount() {
+        return this._nodes.size;
+    }
+    /** Number of edges in the graph. */
+    get edgeCount() {
+        return this._edges.length;
+    }
+    /** Check whether a node ID is already registered. */
+    hasNode(id) {
+        return this._nodes.has(id);
+    }
+    /** Get a node descriptor by ID. */
+    getNode(id) {
+        return this._nodes.get(id);
+    }
+    /**
+     * Add a node to the graph.
+     * Returns an array of validation errors (empty = success).
+     */
+    addNode(id, type, properties, name) {
+        const errors = [];
+        if (this._built) {
+            errors.push("Graph has already been finalized.");
+            return errors;
+        }
+        if (!id || typeof id !== "string") {
+            errors.push("Node id must be a non-empty string.");
+            return errors;
+        }
+        if (!type || typeof type !== "string") {
+            errors.push("Node type must be a non-empty string.");
+            return errors;
+        }
+        if (this._nodes.has(id)) {
+            errors.push(`Duplicate node id: '${id}'.`);
+            return errors;
+        }
+        const descriptor = {
+            id,
+            type,
+            name: name ?? id,
+            properties: properties ?? {}
+        };
+        this._nodes.set(id, descriptor);
+        return errors;
+    }
+    /**
+     * Add an edge connecting two nodes.
+     * Returns an array of validation errors (empty = success).
+     */
+    addEdge(source, sourceHandle, target, targetHandle) {
+        const errors = [];
+        if (this._built) {
+            errors.push("Graph has already been finalized.");
+            return errors;
+        }
+        if (!this._nodes.has(source)) {
+            errors.push(`Source node '${source}' does not exist.`);
+        }
+        if (!this._nodes.has(target)) {
+            errors.push(`Target node '${target}' does not exist.`);
+        }
+        if (!sourceHandle) {
+            errors.push("sourceHandle must be a non-empty string.");
+        }
+        if (!targetHandle) {
+            errors.push("targetHandle must be a non-empty string.");
+        }
+        if (source === target) {
+            errors.push("Self-loops are not allowed.");
+        }
+        if (errors.length > 0)
+            return errors;
+        // Check for duplicate edge
+        const isDuplicate = this._edges.some((e) => e.source === source &&
+            e.sourceHandle === sourceHandle &&
+            e.target === target &&
+            e.targetHandle === targetHandle);
+        if (isDuplicate) {
+            errors.push(`Duplicate edge: ${source}.${sourceHandle} → ${target}.${targetHandle}`);
+            return errors;
+        }
+        this._edges.push({ source, sourceHandle, target, targetHandle });
+        return errors;
+    }
+    /**
+     * Validate the full graph: cycle detection, dangling edge references,
+     * and at least one node.
+     * Returns an array of errors (empty = valid).
+     */
+    validate() {
+        const errors = [];
+        if (this._nodes.size === 0) {
+            errors.push("Graph must contain at least one node.");
+            return errors;
+        }
+        // Check edge references
+        for (const edge of this._edges) {
+            if (!this._nodes.has(edge.source)) {
+                errors.push(`Edge references non-existent source node '${edge.source}'.`);
+            }
+            if (!this._nodes.has(edge.target)) {
+                errors.push(`Edge references non-existent target node '${edge.target}'.`);
+            }
+        }
+        // Cycle detection via Kahn's algorithm
+        const inDegree = new Map();
+        const adjList = new Map();
+        for (const id of this._nodes.keys()) {
+            inDegree.set(id, 0);
+            adjList.set(id, []);
+        }
+        for (const edge of this._edges) {
+            if (adjList.has(edge.source) && inDegree.has(edge.target)) {
+                adjList.get(edge.source).push(edge.target);
+                inDegree.set(edge.target, (inDegree.get(edge.target) ?? 0) + 1);
+            }
+        }
+        const queue = [];
+        for (const [id, deg] of inDegree) {
+            if (deg === 0)
+                queue.push(id);
+        }
+        let visited = 0;
+        while (queue.length > 0) {
+            const id = queue.shift();
+            visited++;
+            for (const neighbor of adjList.get(id) ?? []) {
+                const newDeg = (inDegree.get(neighbor) ?? 1) - 1;
+                inDegree.set(neighbor, newDeg);
+                if (newDeg === 0)
+                    queue.push(neighbor);
+            }
+        }
+        if (visited < this._nodes.size) {
+            errors.push("Graph contains a cycle.");
+        }
+        return errors;
+    }
+    /**
+     * Finalize and return the graph as GraphData.
+     * Throws if validation fails.
+     */
+    build() {
+        const errors = this.validate();
+        if (errors.length > 0) {
+            throw new Error(`Graph validation failed:\n${errors.map((e) => `- ${e}`).join("\n")}`);
+        }
+        this._built = true;
+        // Topological sort for deterministic node ordering
+        const inDegree = new Map();
+        const adjList = new Map();
+        for (const id of this._nodes.keys()) {
+            inDegree.set(id, 0);
+            adjList.set(id, []);
+        }
+        for (const edge of this._edges) {
+            adjList.get(edge.source).push(edge.target);
+            inDegree.set(edge.target, (inDegree.get(edge.target) ?? 0) + 1);
+        }
+        const queue = [];
+        for (const [id, deg] of inDegree) {
+            if (deg === 0)
+                queue.push(id);
+        }
+        const sorted = [];
+        while (queue.length > 0) {
+            const id = queue.shift();
+            sorted.push(id);
+            for (const neighbor of adjList.get(id) ?? []) {
+                const newDeg = (inDegree.get(neighbor) ?? 1) - 1;
+                inDegree.set(neighbor, newDeg);
+                if (newDeg === 0)
+                    queue.push(neighbor);
+            }
+        }
+        const nodes = sorted.map((id) => this._nodes.get(id));
+        const edges = [...this._edges];
+        return { nodes, edges };
+    }
+    /** Reset the builder for reuse. */
+    reset() {
+        this._nodes.clear();
+        this._edges.length = 0;
+        this._built = false;
+    }
+}
+//# sourceMappingURL=graph-builder.js.map

package/dist/graph-builder.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph-builder.js","sourceRoot":"","sources":["../src/graph-builder.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAIH,6DAA6D;AAC7D,MAAM,CAAC,MAAM,oBAAoB,GAAG,2BAA2B,CAAC;AAEhE,MAAM,OAAO,YAAY;IACN,MAAM,GAAG,IAAI,GAAG,EAA0B,CAAC;IAC3C,MAAM,GAAW,EAAE,CAAC;IAC7B,MAAM,GAAG,KAAK,CAAC;IAEvB,2CAA2C;IAC3C,IAAI,OAAO;QACT,OAAO,IAAI,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC;IACrC,CAAC;IAED,oCAAoC;IACpC,IAAI,SAAS;QACX,OAAO,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC;IAC1B,CAAC;IAED,oCAAoC;IACpC,IAAI,SAAS;QACX,OAAO,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC;IAC5B,CAAC;IAED,qDAAqD;IACrD,OAAO,CAAC,EAAU;QAChB,OAAO,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IAC7B,CAAC;IAED,mCAAmC;IACnC,OAAO,CAAC,EAAU;QAChB,OAAO,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IAC7B,CAAC;IAED;;;OAGG;IACH,OAAO,CACL,EAAU,EACV,IAAY,EACZ,UAAoC,EACpC,IAAa;QAEb,MAAM,MAAM,GAAa,EAAE,CAAC;QAC5B,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;YAChB,MAAM,CAAC,IAAI,CAAC,mCAAmC,CAAC,CAAC;YACjD,OAAO,MAAM,CAAC;QAChB,CAAC;QACD,IAAI,CAAC,EAAE,IAAI,OAAO,EAAE,KAAK,QAAQ,EAAE,CAAC;YAClC,MAAM,CAAC,IAAI,CAAC,qCAAqC,CAAC,CAAC;YACnD,OAAO,MAAM,CAAC;QAChB,CAAC;QACD,IAAI,CAAC,IAAI,IAAI,OAAO,IAAI,KAAK,QAAQ,EAAE,CAAC;YACtC,MAAM,CAAC,IAAI,CAAC,uCAAuC,CAAC,CAAC;YACrD,OAAO,MAAM,CAAC;QAChB,CAAC;QACD,IAAI,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;YACxB,MAAM,CAAC,IAAI,CAAC,uBAAuB,EAAE,IAAI,CAAC,CAAC;YAC3C,OAAO,MAAM,CAAC;QAChB,CAAC;QAED,MAAM,UAAU,GAAmB;YACjC,EAAE;YACF,IAAI;YACJ,IAAI,EAAE,IAAI,IAAI,EAAE;YAChB,UAAU,EAAE,UAAU,IAAI,EAAE;SAC7B,CAAC;QAEF,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,EAAE,UAAU,CAAC,CAAC;QAChC,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;;OAGG;IACH,OAAO,CACL,MAAc,EACd,YAAoB,EACpB,MAAc,EACd,YAAoB;QAEpB,MAAM,MAAM,GAAa,EAAE,CAAC;QAC5B,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;YAChB,MAAM,CAAC,IAAI,CAAC,mCAAmC,CAAC,CAAC;YACjD,OAAO,MAAM,CAAC;QAChB,CAAC;QACD,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;YAC7B,MAAM,CAAC,IAAI,CAAC,gBAAgB,MAAM,mBAAmB,CAAC,CAAC;QACzD,CAAC;QACD,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;YAC7B,MAAM,CAAC,IAAI,CAAC,gBAAgB,MAAM,mBAAmB,CAAC,CAAC;QACzD,CAAC;QACD,IAAI,CAAC,YAAY,EAAE,CAAC;YAClB,MAAM,CAAC,IAAI,CAAC,0CAA0C,CAAC,CAAC;QAC1D,CAAC;QACD,IAAI,CAAC,YAAY,EAAE,CAAC;YAClB,MAAM,CAAC,IAAI,CAAC,0CAA0C,CAAC,CAAC;QAC1D,CAAC;QACD,IAAI,MAAM,KAAK,MAAM,EAAE,CAAC;YACtB,MAAM,CAAC,IAAI,CAAC,6BAA6B,CAAC,CAAC;QAC7C,CAAC;QACD,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC;YAAE,OAAO,MAAM,CAAC;QAErC,2BAA2B;QAC3B,MAAM,WAAW,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,CAClC,CAAC,CAAC,EAAE,EAAE,CACJ,CAAC,CAAC,MAAM,KAAK,MAAM;YACnB,CAAC,CAAC,YAAY,KAAK,YAAY;YAC/B,CAAC,CAAC,MAAM,KAAK,MAAM;YACnB,CAAC,CAAC,YAAY,KAAK,YAAY,CAClC,CAAC;QACF,IAAI,WAAW,EAAE,CAAC;YAChB,MAAM,CAAC,IAAI,CACT,mBAAmB,MAAM,IAAI,YAAY,MAAM,MAAM,IAAI,YAAY,EAAE,CACxE,CAAC;YACF,OAAO,MAAM,CAAC;QAChB,CAAC;QAED,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,YAAY,EAAE,MAAM,EAAE,YAAY,EAAE,CAAC,CAAC;QACjE,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;;;OAIG;IACH,QAAQ;QACN,MAAM,MAAM,GAAa,EAAE,CAAC;QAE5B,IAAI,IAAI,CAAC,MAAM,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;YAC3B,MAAM,CAAC,IAAI,CAAC,uCAAuC,CAAC,CAAC;YACrD,OAAO,MAAM,CAAC;QAChB,CAAC;QAED,wBAAwB;QACxB,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;YAC/B,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;gBAClC,MAAM,CAAC,IAAI,CACT,6CAA6C,IAAI,CAAC,MAAM,IAAI,CAC7D,CAAC;YACJ,CAAC;YACD,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;gBAClC,MAAM,CAAC,IAAI,CACT,6CAA6C,IAAI,CAAC,MAAM,IAAI,CAC7D,CAAC;YACJ,CAAC;QACH,CAAC;QAED,uCAAuC;QACvC,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAC;QAC3C,MAAM,OAAO,GAAG,IAAI,GAAG,EAAoB,CAAC;QAC5C,KAAK,MAAM,EAAE,IAAI,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,EAAE,CAAC;YACpC,QAAQ,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;YACpB,OAAO,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QACtB,CAAC;QACD,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;YAC/B,IAAI,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;gBAC1D,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAE,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;gBAC5C,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAClE,CAAC;QACH,CAAC;QAED,MAAM,KAAK,GAAa,EAAE,CAAC;QAC3B,KAAK,MAAM,CAAC,EAAE,EAAE,GAAG,CAAC,IAAI,QAAQ,EAAE,CAAC;YACjC,IAAI,GAAG,KAAK,CAAC;gBAAE,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAChC,CAAC;QACD,IAAI,OAAO,GAAG,CAAC,CAAC;QAChB,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,MAAM,EAAE,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;YAC1B,OAAO,EAAE,CAAC;YACV,KAAK,MAAM,QAAQ,IAAI,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC;gBAC7C,MAAM,MAAM,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;gBACjD,QAAQ,CAAC,GAAG,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC;gBAC/B,IAAI,MAAM,KAAK,CAAC;oBAAE,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YACzC,CAAC;QACH,CAAC;QACD,IAAI,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;YAC/B,MAAM,CAAC,IAAI,CAAC,yBAAyB,CAAC,CAAC;QACzC,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;;OAGG;IACH,KAAK;QACH,MAAM,MAAM,GAAG,IAAI,CAAC,QAAQ,EAAE,CAAC;QAC/B,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACtB,MAAM,IAAI,KAAK,CACb,6BAA6B,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CACtE,CAAC;QACJ,CAAC;QACD,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC;QAEnB,mDAAmD;QACnD,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAC;QAC3C,MAAM,OAAO,GAAG,IAAI,GAAG,EAAoB,CAAC;QAC5C,KAAK,MAAM,EAAE,IAAI,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,EAAE,CAAC;YACpC,QAAQ,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;YACpB,OAAO,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QACtB,CAAC;QACD,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;YAC/B,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAE,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YAC5C,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAClE,CAAC;QAED,MAAM,KAAK,GAAa,EAAE,CAAC;QAC3B,KAAK,MAAM,CAAC,EAAE,EAAE,GAAG,CAAC,IAAI,QAAQ,EAAE,CAAC;YACjC,IAAI,GAAG,KAAK,CAAC;gBAAE,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAChC,CAAC;QACD,MAAM,MAAM,GAAa,EAAE,CAAC;QAC5B,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,MAAM,EAAE,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;YAC1B,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YAChB,KAAK,MAAM,QAAQ,IAAI,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC;gBAC7C,MAAM,MAAM,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;gBACjD,QAAQ,CAAC,GAAG,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC;gBAC/B,IAAI,MAAM,KAAK,CAAC;oBAAE,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YACzC,CAAC;QACH,CAAC;QAED,MAAM,KAAK,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAE,CAAC,CAAC;QACvD,MAAM,KAAK,GAAG,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC;QAE/B,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC;IAC1B,CAAC;IAED,mCAAmC;IACnC,KAAK;QACH,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC;QACpB,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC;QACvB,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;IACtB,CAAC;CACF"}

package/dist/graph-planner.d.ts

@@ -0,0 +1,56 @@
+/**
+ * GraphPlanner -- builds a workflow graph directly via LLM tool calling.
+ *
+ * Instead of producing a TaskPlan with prose steps, this planner gives the LLM
+ * tools to search for nodes, inspect their metadata, and build a DAG node-by-node.
+ * The result is a GraphData that goes straight to WorkflowRunner.
+ */
+import type { BaseProvider, ProcessingContext } from "@nodetool-ai/runtime";
+import type { NodeRegistry } from "@nodetool-ai/node-sdk";
+import type { GraphData, ProcessingMessage } from "@nodetool-ai/protocol";
+import type { Tool } from "./tools/base-tool.js";
+export interface GraphPlannerOptions {
+    provider: BaseProvider;
+    model: string;
+    registry: NodeRegistry;
+    tools?: Tool[];
+    systemPrompt?: string;
+    outputSchema?: Record<string, unknown>;
+    inputs?: Record<string, unknown>;
+    maxRetries?: number;
+    threadId?: string;
+    /**
+     * Configured BaseProvider instances by id. When supplied, the planner
+     * exposes a `find_model` tool so the agent can pick a real
+     * `{provider, model_id}` for generic AI nodes.
+     */
+    providers?: Record<string, BaseProvider>;
+}
+export declare class GraphPlanner {
+    private readonly provider;
+    private readonly model;
+    private readonly registry;
+    private readonly tools;
+    private readonly systemPrompt;
+    private readonly outputSchema;
+    private readonly inputs;
+    private readonly maxRetries;
+    private readonly threadId?;
+    private readonly providers?;
+    private readonly hasFindModel;
+    constructor(opts: GraphPlannerOptions);
+    /**
+     * Build a workflow graph from an objective using LLM tool calling.
+     * Returns null on repeated failure.
+     */
+    plan(objective: string, context: ProcessingContext): AsyncGenerator<ProcessingMessage, GraphData | null>;
+    private _planImpl;
+    /**
+     * Run the multi-turn tool-calling loop.
+     * The LLM can call search/inspect/add tools multiple times before finish_graph.
+     */
+    private runToolLoop;
+    private formatToolCallMessage;
+    private formatToolsInfo;
+}
+//# sourceMappingURL=graph-planner.d.ts.map

package/dist/graph-planner.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph-planner.d.ts","sourceRoot":"","sources":["../src/graph-planner.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,OAAO,KAAK,EACV,YAAY,EACZ,iBAAiB,EAElB,MAAM,sBAAsB,CAAC;AAE9B,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,uBAAuB,CAAC;AAE1D,OAAO,KAAK,EACV,SAAS,EACT,iBAAiB,EAIlB,MAAM,uBAAuB,CAAC;AAE/B,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,sBAAsB,CAAC;AA0BjD,MAAM,WAAW,mBAAmB;IAClC,QAAQ,EAAE,YAAY,CAAC;IACvB,KAAK,EAAE,MAAM,CAAC;IACd,QAAQ,EAAE,YAAY,CAAC;IACvB,KAAK,CAAC,EAAE,IAAI,EAAE,CAAC;IACf,YAAY,CAAC,EAAE,MAAM,CAAC;IACtB,YAAY,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;IACvC,MAAM,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;IACjC,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB;;;;OAIG;IACH,SAAS,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,YAAY,CAAC,CAAC;CAC1C;AAED,qBAAa,YAAY;IACvB,OAAO,CAAC,QAAQ,CAAC,QAAQ,CAAe;IACxC,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAS;IAC/B,OAAO,CAAC,QAAQ,CAAC,QAAQ,CAAe;IACxC,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAS;IAC/B,OAAO,CAAC,QAAQ,CAAC,YAAY,CAAS;IACtC,OAAO,CAAC,QAAQ,CAAC,YAAY,CAAsC;IACnE,OAAO,CAAC,QAAQ,CAAC,MAAM,CAA0B;IACjD,OAAO,CAAC,QAAQ,CAAC,UAAU,CAAS;IACpC,OAAO,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAS;IACnC,OAAO,CAAC,QAAQ,CAAC,SAAS,CAAC,CAA+B;IAC1D,OAAO,CAAC,QAAQ,CAAC,YAAY,CAAU;gBAE3B,IAAI,EAAE,mBAAmB;IAsBrC;;;OAGG;IACI,IAAI,CACT,SAAS,EAAE,MAAM,EACjB,OAAO,EAAE,iBAAiB,GACzB,cAAc,CAAC,iBAAiB,EAAE,SAAS,GAAG,IAAI,CAAC;YAavC,SAAS;IAwGxB;;;OAGG;YACY,WAAW;IAiJ1B,OAAO,CAAC,qBAAqB;IAwB7B,OAAO,CAAC,eAAe;CA0BxB"}