@nodetool-ai/agents 0.7.0-rc.23 → 0.8.2

package/dist/tools/shared-tools.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"shared-tools.js","sourceRoot":"","sources":["../../src/tools/shared-tools.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;GAsBG;AAEH,OAAO,EAAE,qBAAqB,EAAE,MAAM,8BAA8B,CAAC;AAGrE,iFAAiF;AACjF,MAAM,CAAC,MAAM,iBAAiB,GAAG;IAC/B,aAAa;IACb,aAAa;IACb,cAAc;CACN,CAAC;AAEX;;;;GAIG;AACH,MAAM,UAAU,cAAc;IAC5B,OAAO,iBAAiB,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,qBAAqB,CAAC,IAAI,CAAC,CAAC,CAAC;AACtE,CAAC"}

package/dist/tools/start-subtask-tool.d.ts

@@ -0,0 +1,51 @@
+/**
+ * `start_subtask` — the background half of delegation.
+ *
+ * Same child as {@link RunSubtaskTool} — full inherited toolset, depth gate,
+ * tagged event forwarding — but `process()` returns a receipt immediately and
+ * the child loop runs detached, pumped by a promise this class owns. The
+ * per-turn {@link BackgroundSubtaskRegistry} (on
+ * `SubAgentToolRuntime.background`) is the handoff: the pump settles the
+ * record when the child ends, and `wait_subtasks` reads the same records.
+ *
+ * A host that builds no registry refuses with `background_unavailable`
+ * instead of spawning a child nobody can collect.
+ */
+import { type ProcessingContext } from "@nodetool-ai/runtime";
+import { SubAgentTool, type SubAgentToolRun, type SubAgentToolRuntime } from "../subagent.js";
+import type { BackgroundSubtaskRegistry } from "../background-subtasks.js";
+import { Tool } from "./base-tool.js";
+export interface StartSubtaskToolOptions extends SubAgentToolRuntime {
+    /** Registry shared with this turn's `wait_subtasks` tool. */
+    background?: BackgroundSubtaskRegistry;
+    /** Max LLM iterations per child loop. Defaults to 20. */
+    maxIterations?: number;
+}
+/**
+ * Background children one turn may start. The registry is per turn and every
+ * record on it is a detached child loop, so without a cap a model that keeps
+ * calling `start_subtask` grows the registry — and the queue for the run's
+ * permits — without bound.
+ */
+export declare const MAX_BACKGROUND_SUBTASKS_PER_TURN = 8;
+export declare class StartSubtaskTool extends SubAgentTool {
+    readonly name = "start_subtask";
+    readonly description: string;
+    readonly jsonSchema: import("@nodetool-ai/runtime").JsonSchema;
+    private readonly registry?;
+    constructor(opts: StartSubtaskToolOptions);
+    protected buildRun(params: Record<string, unknown>): SubAgentToolRun | {
+        error: string;
+        message: string;
+    };
+    protected buildChildToolset(parentTools: Tool[]): Tool[];
+    private runtimeForChild;
+    userMessage(params: Record<string, unknown>): string;
+    process(context: ProcessingContext, params: Record<string, unknown>): Promise<unknown>;
+    /**
+     * Drive the detached child to settlement. Never throws: every path lands
+     * in a registry settle, so `wait_subtasks` always sees a terminal status.
+     */
+    private pump;
+}
+//# sourceMappingURL=start-subtask-tool.d.ts.map

package/dist/tools/start-subtask-tool.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"start-subtask-tool.d.ts","sourceRoot":"","sources":["../../src/tools/start-subtask-tool.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAGH,OAAO,EAAqB,KAAK,iBAAiB,EAAE,MAAM,sBAAsB,CAAC;AAEjF,OAAO,EAIL,YAAY,EACZ,KAAK,eAAe,EACpB,KAAK,mBAAmB,EACzB,MAAM,gBAAgB,CAAC;AACxB,OAAO,KAAK,EAAE,yBAAyB,EAAE,MAAM,2BAA2B,CAAC;AAK3E,OAAO,EAAE,IAAI,EAAE,MAAM,gBAAgB,CAAC;AAMtC,MAAM,WAAW,uBAAwB,SAAQ,mBAAmB;IAClE,6DAA6D;IAC7D,UAAU,CAAC,EAAE,yBAAyB,CAAC;IACvC,yDAAyD;IACzD,aAAa,CAAC,EAAE,MAAM,CAAC;CACxB;AAID;;;;;GAKG;AACH,eAAO,MAAM,gCAAgC,IAAI,CAAC;AAElD,qBAAa,gBAAiB,SAAQ,YAAY;IAChD,QAAQ,CAAC,IAAI,mBAAmB;IAChC,QAAQ,CAAC,WAAW,SAA6B;IACjD,QAAQ,CAAC,UAAU,4CAAwB;IAE3C,OAAO,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAA4B;IAEtD,YAAY,IAAI,EAAE,uBAAuB,EAGxC;IAED,SAAS,CAAC,QAAQ,CAChB,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAC9B,eAAe,GAAG;QAAE,KAAK,EAAE,MAAM,CAAC;QAAC,OAAO,EAAE,MAAM,CAAA;KAAE,CAmBtD;IAED,SAAS,CAAC,iBAAiB,CAAC,WAAW,EAAE,IAAI,EAAE,GAAG,IAAI,EAAE,CAWvD;IAED,OAAO,CAAC,eAAe;IAavB,WAAW,CAAC,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,MAAM,CAKnD;IAEK,OAAO,CACX,OAAO,EAAE,iBAAiB,EAC1B,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAC9B,OAAO,CAAC,OAAO,CAAC,CAiElB;IAED;;;OAGG;YACW,IAAI;CAuCnB"}

package/dist/tools/start-subtask-tool.js

@@ -0,0 +1,189 @@
+/**
+ * `start_subtask` — the background half of delegation.
+ *
+ * Same child as {@link RunSubtaskTool} — full inherited toolset, depth gate,
+ * tagged event forwarding — but `process()` returns a receipt immediately and
+ * the child loop runs detached, pumped by a promise this class owns. The
+ * per-turn {@link BackgroundSubtaskRegistry} (on
+ * `SubAgentToolRuntime.background`) is the handoff: the pump settles the
+ * record when the child ends, and `wait_subtasks` reads the same records.
+ *
+ * A host that builds no registry refuses with `background_unavailable`
+ * instead of spawning a child nobody can collect.
+ */
+import { randomUUID } from "node:crypto";
+import { budgetFromContext } from "@nodetool-ai/runtime";
+import { enterSubAgentDepth, forwardSubAgentStream, runSubAgent, SubAgentTool } from "../subagent.js";
+import { START_SUBTASK_DESCRIPTION, START_SUBTASK_SCHEMA } from "../prompts/background-subtask-prompt.js";
+import { RunSubtaskTool } from "./run-subtask-tool.js";
+import { WaitSubtasksTool } from "./wait-subtasks-tool.js";
+import { TOOL_CALL_ID_FIELD } from "./subtask-fields.js";
+import { isString } from "../utils/type-guards.js";
+const DEFAULT_MAX_ITERATIONS = 20;
+/**
+ * Background children one turn may start. The registry is per turn and every
+ * record on it is a detached child loop, so without a cap a model that keeps
+ * calling `start_subtask` grows the registry — and the queue for the run's
+ * permits — without bound.
+ */
+export const MAX_BACKGROUND_SUBTASKS_PER_TURN = 8;
+export class StartSubtaskTool extends SubAgentTool {
+    name = "start_subtask";
+    description = START_SUBTASK_DESCRIPTION;
+    jsonSchema = START_SUBTASK_SCHEMA;
+    registry;
+    constructor(opts) {
+        super({ ...opts, maxIterations: opts.maxIterations ?? DEFAULT_MAX_ITERATIONS });
+        this.registry = opts.background;
+    }
+    buildRun(params) {
+        const description = isString(params.description)
+            ? params.description.trim()
+            : "";
+        const prompt = isString(params.prompt) ? params.prompt.trim() : "";
+        if (!prompt) {
+            return {
+                error: "missing_prompt",
+                message: "`prompt` is required and must be a non-empty string."
+            };
+        }
+        return {
+            instructions: prompt,
+            title: description || "subtask",
+            errorCode: "subtask_failed",
+            noResultCode: "subtask_no_result",
+            noResultMessage: "Subtask ended without producing a final assistant message.",
+            errorExtras: { description: description || null }
+        };
+    }
+    buildChildToolset(parentTools) {
+        const names = new Set(parentTools.map((t) => t.name));
+        const extras = [];
+        if (!names.has("run_subtask")) {
+            extras.push(new RunSubtaskTool(this.runtimeForChild()));
+        }
+        if (!names.has("start_subtask"))
+            extras.push(this);
+        if (!names.has("wait_subtasks")) {
+            extras.push(new WaitSubtasksTool({ background: this.registry }));
+        }
+        return extras.length > 0 ? [...extras, ...parentTools] : parentTools;
+    }
+    runtimeForChild() {
+        return {
+            provider: this.provider,
+            model: this.model,
+            parentTools: this.parentToolsFn,
+            forwardMessage: this.forward,
+            maxDepth: this.maxDepth,
+            maxIterations: this.maxIterations,
+            budget: this.budget,
+            background: this.registry
+        };
+    }
+    userMessage(params) {
+        const desc = isString(params.description) ? params.description.trim() : "";
+        return desc
+            ? `Starting background subtask: ${desc}`
+            : "Starting background subtask";
+    }
+    async process(context, params) {
+        if (!this.registry) {
+            return {
+                error: "background_unavailable",
+                message: "`start_subtask` needs a background registry, but this run carries " +
+                    "no `SubAgentToolRuntime.background`. Use `run_subtask`, which " +
+                    "blocks and returns the result directly."
+            };
+        }
+        if (this.registry.size >= MAX_BACKGROUND_SUBTASKS_PER_TURN) {
+            return {
+                error: "background_limit_reached",
+                limit: MAX_BACKGROUND_SUBTASKS_PER_TURN,
+                message: `This turn has already started ${MAX_BACKGROUND_SUBTASKS_PER_TURN} ` +
+                    "background subtasks, the most it may. Call wait_subtasks to " +
+                    "collect them, or use `run_subtask`, which blocks and returns the " +
+                    "result directly."
+            };
+        }
+        const gate = enterSubAgentDepth(context, this.maxDepth, this.depthNoun);
+        if (!gate.ok)
+            return gate.refusal;
+        const run = this.buildRun(params);
+        if ("error" in run)
+            return run;
+        const parentToolCallId = isString(params[TOOL_CALL_ID_FIELD])
+            ? params[TOOL_CALL_ID_FIELD]
+            : null;
+        const id = randomUUID();
+        this.registry.start(id, run.title, gate.depth);
+        const gen = runSubAgent({
+            context: gate.childCtx,
+            provider: this.provider,
+            model: this.model,
+            tools: this.buildChildToolset(this.parentToolsFn()),
+            instructions: run.instructions,
+            title: run.title,
+            outputSchema: run.outputSchema,
+            systemPrompt: run.systemPrompt,
+            maxIterations: run.maxIterations ?? this.maxIterations,
+            // A detached child still spends the parent's allowance, and draws a
+            // permit before it opens a conversation: the parent's own when free,
+            // else one of the run's (`acquireRunSlot`). The parent keeps its turn,
+            // so a child on the parent's permit can overlap the parent's next
+            // turn — the cap above is what bounds that.
+            turnBudget: this.budget ?? budgetFromContext(context),
+            signal: context.signal
+        });
+        void this.pump(gen, id, parentToolCallId, gate.depth, context.signal);
+        return {
+            subtask_id: id,
+            description: run.title,
+            status: "running",
+            message: "The subtask is running in the background. Call wait_subtasks to " +
+                "collect its result — include this subtask_id to wait for it alone."
+        };
+    }
+    /**
+     * Drive the detached child to settlement. Never throws: every path lands
+     * in a registry settle, so `wait_subtasks` always sees a terminal status.
+     */
+    async pump(gen, id, parentToolCallId, depth, signal) {
+        try {
+            const { aborted, value } = await forwardSubAgentStream(gen, {
+                forward: this.forward,
+                parentToolCallId,
+                depth,
+                label: this.name,
+                signal
+            });
+            if (aborted) {
+                this.registry?.settle(id, { aborted: true });
+            }
+            else if (!value || !value.ok) {
+                this.registry?.settle(id, {
+                    ok: false,
+                    error: value ? value.error : "Background subagent stream ended early."
+                });
+            }
+            else if (value.result === null || value.result === undefined) {
+                // Match run_subtask's settlement vocabulary: a child that ends with
+                // no final message is a failure, not a null success.
+                this.registry?.settle(id, {
+                    ok: false,
+                    error: "subtask_no_result"
+                });
+            }
+            else {
+                this.registry?.settle(id, value);
+            }
+        }
+        catch (e) {
+            this.registry?.settle(id, {
+                ok: false,
+                error: e instanceof Error ? e.message : String(e)
+            });
+        }
+    }
+}
+//# sourceMappingURL=start-subtask-tool.js.map

package/dist/tools/start-subtask-tool.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"start-subtask-tool.js","sourceRoot":"","sources":["../../src/tools/start-subtask-tool.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAEH,OAAO,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AACzC,OAAO,EAAE,iBAAiB,EAA0B,MAAM,sBAAsB,CAAC;AAEjF,OAAO,EACL,kBAAkB,EAClB,qBAAqB,EACrB,WAAW,EACX,YAAY,EAGb,MAAM,gBAAgB,CAAC;AAExB,OAAO,EACL,yBAAyB,EACzB,oBAAoB,EACrB,MAAM,yCAAyC,CAAC;AAEjD,OAAO,EAAE,cAAc,EAAE,MAAM,uBAAuB,CAAC;AACvD,OAAO,EAAE,gBAAgB,EAAE,MAAM,yBAAyB,CAAC;AAC3D,OAAO,EAAE,kBAAkB,EAAE,MAAM,qBAAqB,CAAC;AACzD,OAAO,EAAE,QAAQ,EAAE,MAAM,yBAAyB,CAAC;AASnD,MAAM,sBAAsB,GAAG,EAAE,CAAC;AAElC;;;;;GAKG;AACH,MAAM,CAAC,MAAM,gCAAgC,GAAG,CAAC,CAAC;AAElD,MAAM,OAAO,gBAAiB,SAAQ,YAAY;IACvC,IAAI,GAAG,eAAe,CAAC;IACvB,WAAW,GAAG,yBAAyB,CAAC;IACxC,UAAU,GAAG,oBAAoB,CAAC;IAE1B,QAAQ,CAA6B;IAEtD,YAAY,IAA6B;QACvC,KAAK,CAAC,EAAE,GAAG,IAAI,EAAE,aAAa,EAAE,IAAI,CAAC,aAAa,IAAI,sBAAsB,EAAE,CAAC,CAAC;QAChF,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,UAAU,CAAC;IAClC,CAAC;IAES,QAAQ,CAChB,MAA+B;QAE/B,MAAM,WAAW,GAAG,QAAQ,CAAC,MAAM,CAAC,WAAW,CAAC;YAC9C,CAAC,CAAC,MAAM,CAAC,WAAW,CAAC,IAAI,EAAE;YAC3B,CAAC,CAAC,EAAE,CAAC;QACP,MAAM,MAAM,GAAG,QAAQ,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QACnE,IAAI,CAAC,MAAM,EAAE,CAAC;YACZ,OAAO;gBACL,KAAK,EAAE,gBAAgB;gBACvB,OAAO,EAAE,sDAAsD;aAChE,CAAC;QACJ,CAAC;QACD,OAAO;YACL,YAAY,EAAE,MAAM;YACpB,KAAK,EAAE,WAAW,IAAI,SAAS;YAC/B,SAAS,EAAE,gBAAgB;YAC3B,YAAY,EAAE,mBAAmB;YACjC,eAAe,EAAE,4DAA4D;YAC7E,WAAW,EAAE,EAAE,WAAW,EAAE,WAAW,IAAI,IAAI,EAAE;SAClD,CAAC;IACJ,CAAC;IAES,iBAAiB,CAAC,WAAmB;QAC7C,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;QACtD,MAAM,MAAM,GAAW,EAAE,CAAC;QAC1B,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,aAAa,CAAC,EAAE,CAAC;YAC9B,MAAM,CAAC,IAAI,CAAC,IAAI,cAAc,CAAC,IAAI,CAAC,eAAe,EAAE,CAAC,CAAC,CAAC;QAC1D,CAAC;QACD,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,eAAe,CAAC;YAAE,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACnD,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,eAAe,CAAC,EAAE,CAAC;YAChC,MAAM,CAAC,IAAI,CAAC,IAAI,gBAAgB,CAAC,EAAE,UAAU,EAAE,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC;QACnE,CAAC;QACD,OAAO,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,MAAM,EAAE,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC;IACvE,CAAC;IAEO,eAAe;QACrB,OAAO;YACL,QAAQ,EAAE,IAAI,CAAC,QAAQ;YACvB,KAAK,EAAE,IAAI,CAAC,KAAK;YACjB,WAAW,EAAE,IAAI,CAAC,aAAa;YAC/B,cAAc,EAAE,IAAI,CAAC,OAAO;YAC5B,QAAQ,EAAE,IAAI,CAAC,QAAQ;YACvB,aAAa,EAAE,IAAI,CAAC,aAAa;YACjC,MAAM,EAAE,IAAI,CAAC,MAAM;YACnB,UAAU,EAAE,IAAI,CAAC,QAAQ;SAC1B,CAAC;IACJ,CAAC;IAED,WAAW,CAAC,MAA+B;QACzC,MAAM,IAAI,GAAG,QAAQ,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,WAAW,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QAC3E,OAAO,IAAI;YACT,CAAC,CAAC,gCAAgC,IAAI,EAAE;YACxC,CAAC,CAAC,6BAA6B,CAAC;IACpC,CAAC;IAED,KAAK,CAAC,OAAO,CACX,OAA0B,EAC1B,MAA+B;QAE/B,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC;YACnB,OAAO;gBACL,KAAK,EAAE,wBAAwB;gBAC/B,OAAO,EACL,oEAAoE;oBACpE,gEAAgE;oBAChE,yCAAyC;aAC5C,CAAC;QACJ,CAAC;QAED,IAAI,IAAI,CAAC,QAAQ,CAAC,IAAI,IAAI,gCAAgC,EAAE,CAAC;YAC3D,OAAO;gBACL,KAAK,EAAE,0BAA0B;gBACjC,KAAK,EAAE,gCAAgC;gBACvC,OAAO,EACL,iCAAiC,gCAAgC,GAAG;oBACpE,8DAA8D;oBAC9D,mEAAmE;oBACnE,kBAAkB;aACrB,CAAC;QACJ,CAAC;QAED,MAAM,IAAI,GAAG,kBAAkB,CAAC,OAAO,EAAE,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,SAAS,CAAC,CAAC;QACxE,IAAI,CAAC,IAAI,CAAC,EAAE;YAAE,OAAO,IAAI,CAAC,OAAO,CAAC;QAElC,MAAM,GAAG,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;QAClC,IAAI,OAAO,IAAI,GAAG;YAAE,OAAO,GAAG,CAAC;QAE/B,MAAM,gBAAgB,GAAG,QAAQ,CAAC,MAAM,CAAC,kBAAkB,CAAC,CAAC;YAC3D,CAAC,CAAC,MAAM,CAAC,kBAAkB,CAAC;YAC5B,CAAC,CAAC,IAAI,CAAC;QAET,MAAM,EAAE,GAAG,UAAU,EAAE,CAAC;QACxB,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,EAAE,GAAG,CAAC,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;QAE/C,MAAM,GAAG,GAAG,WAAW,CAAC;YACtB,OAAO,EAAE,IAAI,CAAC,QAAQ;YACtB,QAAQ,EAAE,IAAI,CAAC,QAAQ;YACvB,KAAK,EAAE,IAAI,CAAC,KAAK;YACjB,KAAK,EAAE,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAC,aAAa,EAAE,CAAC;YACnD,YAAY,EAAE,GAAG,CAAC,YAAY;YAC9B,KAAK,EAAE,GAAG,CAAC,KAAK;YAChB,YAAY,EAAE,GAAG,CAAC,YAAY;YAC9B,YAAY,EAAE,GAAG,CAAC,YAAY;YAC9B,aAAa,EAAE,GAAG,CAAC,aAAa,IAAI,IAAI,CAAC,aAAa;YACtD,oEAAoE;YACpE,qEAAqE;YACrE,uEAAuE;YACvE,kEAAkE;YAClE,4CAA4C;YAC5C,UAAU,EAAE,IAAI,CAAC,MAAM,IAAI,iBAAiB,CAAC,OAAO,CAAC;YACrD,MAAM,EAAE,OAAO,CAAC,MAAM;SACvB,CAAC,CAAC;QAEH,KAAK,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE,EAAE,EAAE,gBAAgB,EAAE,IAAI,CAAC,KAAK,EAAE,OAAO,CAAC,MAAM,CAAC,CAAC;QAEtE,OAAO;YACL,UAAU,EAAE,EAAE;YACd,WAAW,EAAE,GAAG,CAAC,KAAK;YACtB,MAAM,EAAE,SAAS;YACjB,OAAO,EACL,kEAAkE;gBAClE,oEAAoE;SACvE,CAAC;IACJ,CAAC;IAED;;;OAGG;IACK,KAAK,CAAC,IAAI,CAChB,GAAsC,EACtC,EAAU,EACV,gBAA+B,EAC/B,KAAa,EACb,MAAmB;QAEnB,IAAI,CAAC;YACH,MAAM,EAAE,OAAO,EAAE,KAAK,EAAE,GAAG,MAAM,qBAAqB,CAAC,GAAG,EAAE;gBAC1D,OAAO,EAAE,IAAI,CAAC,OAAO;gBACrB,gBAAgB;gBAChB,KAAK;gBACL,KAAK,EAAE,IAAI,CAAC,IAAI;gBAChB,MAAM;aACP,CAAC,CAAC;YACH,IAAI,OAAO,EAAE,CAAC;gBACZ,IAAI,CAAC,QAAQ,EAAE,MAAM,CAAC,EAAE,EAAE,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC,CAAC;YAC/C,CAAC;iBAAM,IAAI,CAAC,KAAK,IAAI,CAAC,KAAK,CAAC,EAAE,EAAE,CAAC;gBAC/B,IAAI,CAAC,QAAQ,EAAE,MAAM,CAAC,EAAE,EAAE;oBACxB,EAAE,EAAE,KAAK;oBACT,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,yCAAyC;iBACvE,CAAC,CAAC;YACL,CAAC;iBAAM,IAAI,KAAK,CAAC,MAAM,KAAK,IAAI,IAAI,KAAK,CAAC,MAAM,KAAK,SAAS,EAAE,CAAC;gBAC/D,oEAAoE;gBACpE,qDAAqD;gBACrD,IAAI,CAAC,QAAQ,EAAE,MAAM,CAAC,EAAE,EAAE;oBACxB,EAAE,EAAE,KAAK;oBACT,KAAK,EAAE,mBAAmB;iBAC3B,CAAC,CAAC;YACL,CAAC;iBAAM,CAAC;gBACN,IAAI,CAAC,QAAQ,EAAE,MAAM,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;YACnC,CAAC;QACH,CAAC;QAAC,OAAO,CAAC,EAAE,CAAC;YACX,IAAI,CAAC,QAAQ,EAAE,MAAM,CAAC,EAAE,EAAE;gBACxB,EAAE,EAAE,KAAK;gBACT,KAAK,EAAE,CAAC,YAAY,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC;aAClD,CAAC,CAAC;QACL,CAAC;IACH,CAAC;CACF"}

package/dist/tools/submit-code-tool.d.ts

@@ -0,0 +1,159 @@
+/**
+ * SubmitCodeTool -- the one tool `CodePlanner` forces.
+ *
+ * The model submits the whole Code node — title, summary, code, typed input and
+ * output slots — as one tool call. Transport shape is checked with the protocol
+ * schema, then the code is parsed and every declared output is verified on every
+ * visible return path. Failures come back as the tool result, so the model fixes
+ * the submission over feedback rounds instead of the planner re-prompting
+ * from scratch.
+ *
+ * Only the arguments of an accepted call become the result. Free text and code
+ * fences in the assistant message are never read.
+ */
+import type { ProcessingContext } from "@nodetool-ai/runtime";
+import { type CodeGenExpectedOutput, type CodeGenInputPort, type CodeGenSubmission } from "@nodetool-ai/protocol/api-schemas/code-gen.js";
+import { Tool } from "./base-tool.js";
+export interface SubmitCodeToolOptions {
+    /** Fired once a submission is accepted, so the planner can end its loop. */
+    onAccepted?: () => void;
+    /**
+     * Inputs seeded from handles that are already wired. The edge referencing
+     * each one was created before generation ran, so a submission that renames,
+     * drops, or incompatibly retypes one leaves the edge pointing at a handle the
+     * node no longer has.
+     */
+    requiredInputs?: readonly CodeGenInputPort[];
+    /** The output an existing edge already consumes, under the same contract. */
+    expectedOutput?: CodeGenExpectedOutput;
+}
+/** What {@link SubmitCodeTool} answers: the accepted submission, or why not. */
+export type SubmitCodeResult = {
+    status: "code_rejected";
+    errors: string[];
+} | {
+    status: "code_accepted";
+    title: string;
+    inputs: string[];
+    outputs: string[];
+};
+export declare class SubmitCodeTool extends Tool {
+    private readonly options;
+    readonly name = "submit_code";
+    readonly description: string;
+    readonly jsonSchema: {
+        type: "object";
+        properties: {
+            title: {
+                type: "string";
+                maxLength: number;
+                description: string;
+            };
+            summary: {
+                type: "string";
+                maxLength: number;
+                description: string;
+            };
+            code: {
+                type: "string";
+                maxLength: number;
+                description: string;
+            };
+            inputs: {
+                type: "array";
+                maxItems: number;
+                description: string;
+                items: {
+                    type: "object";
+                    properties: {
+                        name: {
+                            type: "string";
+                            description: string;
+                        };
+                        type: {
+                            type: "object";
+                            description: string;
+                            properties: {
+                                type: {
+                                    type: "string";
+                                    description: string;
+                                };
+                                optional: {
+                                    type: "boolean";
+                                };
+                                type_args: {
+                                    type: "array";
+                                    description: string;
+                                    items: {
+                                        type: "object";
+                                    };
+                                };
+                            };
+                            required: string[];
+                        };
+                        description: {
+                            type: "string";
+                        };
+                        required: {
+                            type: "boolean";
+                        };
+                    };
+                    required: string[];
+                };
+            };
+            outputs: {
+                type: "array";
+                minItems: number;
+                maxItems: number;
+                description: string;
+                items: {
+                    type: "object";
+                    properties: {
+                        name: {
+                            type: "string";
+                            description: string;
+                        };
+                        type: {
+                            type: "object";
+                            description: string;
+                            properties: {
+                                type: {
+                                    type: "string";
+                                    description: string;
+                                };
+                                optional: {
+                                    type: "boolean";
+                                };
+                                type_args: {
+                                    type: "array";
+                                    description: string;
+                                    items: {
+                                        type: "object";
+                                    };
+                                };
+                            };
+                            required: string[];
+                        };
+                        description: {
+                            type: "string";
+                        };
+                    };
+                    required: string[];
+                };
+            };
+        };
+        required: string[];
+    };
+    private _submission;
+    /** Code of the last submission, accepted or not — used in the retry prompt. */
+    lastCode: string | null;
+    /** Errors from the last rejected submission. */
+    lastErrors: string[];
+    /** Submissions seen so far, so the planner can cap feedback rounds. */
+    rounds: number;
+    get submission(): CodeGenSubmission | null;
+    constructor(options?: SubmitCodeToolOptions);
+    process(_context: ProcessingContext, params: Record<string, unknown>): Promise<SubmitCodeResult>;
+    userMessage(_params: Record<string, unknown>): string;
+}
+//# sourceMappingURL=submit-code-tool.d.ts.map

package/dist/tools/submit-code-tool.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"submit-code-tool.d.ts","sourceRoot":"","sources":["../../src/tools/submit-code-tool.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAEH,OAAO,KAAK,EAAE,iBAAiB,EAAE,MAAM,sBAAsB,CAAC;AAC9D,OAAO,EAML,KAAK,qBAAqB,EAC1B,KAAK,gBAAgB,EACrB,KAAK,iBAAiB,EACvB,MAAM,+CAA+C,CAAC;AAEvD,OAAO,EAAE,IAAI,EAAE,MAAM,gBAAgB,CAAC;AA0FtC,MAAM,WAAW,qBAAqB;IACpC,4EAA4E;IAC5E,UAAU,CAAC,EAAE,MAAM,IAAI,CAAC;IACxB;;;;;OAKG;IACH,cAAc,CAAC,EAAE,SAAS,gBAAgB,EAAE,CAAC;IAC7C,6EAA6E;IAC7E,cAAc,CAAC,EAAE,qBAAqB,CAAC;CACxC;AA4DD,gFAAgF;AAChF,MAAM,MAAM,gBAAgB,GACxB;IAAE,MAAM,EAAE,eAAe,CAAC;IAAC,MAAM,EAAE,MAAM,EAAE,CAAA;CAAE,GAC7C;IACE,MAAM,EAAE,eAAe,CAAC;IACxB,KAAK,EAAE,MAAM,CAAC;IACd,MAAM,EAAE,MAAM,EAAE,CAAC;IACjB,OAAO,EAAE,MAAM,EAAE,CAAC;CACnB,CAAC;AAEN,qBAAa,cAAe,SAAQ,IAAI;IAoB1B,OAAO,CAAC,QAAQ,CAAC,OAAO;IAnBpC,QAAQ,CAAC,IAAI,iBAAiB;IAC9B,QAAQ,CAAC,WAAW,SAG4B;IAChD,QAAQ,CAAC,UAAU;cAnJb,QAAQ;;;sBAGJ,QAAQ;;;;;sBAKR,QAAQ;;;;;sBAKR,QAAQ;;;;;sBAOR,OAAO;;;;oBAIX,IAAI,EAAE,QAAQ;oBACd,UAAU;wBACR,IAAI;4BACF,IAAI,EAAE,QAAQ;4BACd,WAAW;;wBAEb,IAAI;kCAnDN,QAAQ;;;gCAKZ,IAAI;oCACF,IAAI,EAAE,QAAQ;oCACd,WAAW;;gCAGb,QAAQ;oCAAI,IAAI,EAAE,SAAS;;gCAC3B,SAAS;oCACP,IAAI,EAAE,OAAO;oCACb,WAAW;oCACX,KAAK;wCAAI,IAAI,EAAE,QAAQ;;;;;;wBAsCnB,WAAW;4BAAI,IAAI,EAAE,QAAQ;;wBAC7B,QAAQ;4BAAI,IAAI,EAAE,SAAS;;;oBAE7B,QAAQ;;;;sBAIJ,OAAO;;;;;oBAKX,IAAI,EAAE,QAAQ;oBACd,UAAU;wBACR,IAAI;4BACF,IAAI,EAAE,QAAQ;4BACd,WAAW;;wBAEb,IAAI;;;;;;;;;;;;;;;;;;;;;wBACJ,WAAW;4BAAI,IAAI,EAAE,QAAQ;;;oBAE/B,QAAQ;;;;;MA+FmE;IAEjF,OAAO,CAAC,WAAW,CAAkC;IACrD,+EAA+E;IAC/E,QAAQ,EAAE,MAAM,GAAG,IAAI,CAAQ;IAC/B,gDAAgD;IAChD,UAAU,EAAE,MAAM,EAAE,CAAM;IAC1B,uEAAuE;IACvE,MAAM,SAAK;IAEX,IAAI,UAAU,IAAI,iBAAiB,GAAG,IAAI,CAEzC;IAED,YAA6B,OAAO,GAAE,qBAA0B,EAE/D;IAEK,OAAO,CACX,QAAQ,EAAE,iBAAiB,EAC3B,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAC9B,OAAO,CAAC,gBAAgB,CAAC,CAsD3B;IAED,WAAW,CAAC,OAAO,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,MAAM,CAEpD;CACF"}

package/dist/tools/submit-code-tool.js

@@ -0,0 +1,209 @@
+/**
+ * SubmitCodeTool -- the one tool `CodePlanner` forces.
+ *
+ * The model submits the whole Code node — title, summary, code, typed input and
+ * output slots — as one tool call. Transport shape is checked with the protocol
+ * schema, then the code is parsed and every declared output is verified on every
+ * visible return path. Failures come back as the tool result, so the model fixes
+ * the submission over feedback rounds instead of the planner re-prompting
+ * from scratch.
+ *
+ * Only the arguments of an accepted call become the result. Free text and code
+ * fences in the assistant message are never read.
+ */
+import { codeGenSubmission, MAX_CODE_LENGTH, MAX_PORTS, MAX_SUMMARY_LENGTH, MAX_TITLE_LENGTH } from "@nodetool-ai/protocol/api-schemas/code-gen.js";
+import { Tool } from "./base-tool.js";
+import { analyzeGeneratedCode } from "../code-gen/analyze.js";
+import { checkPortTypes, formatPortType, portTypesCompatible } from "../code-gen/port-types.js";
+import { isString } from "../utils/type-guards.js";
+const PORT_TYPE_SCHEMA = {
+    type: "object",
+    description: "NodeTool type metadata, e.g. {\"type\": \"str\"} or " +
+        "{\"type\": \"list\", \"type_args\": [{\"type\": \"str\"}]}.",
+    properties: {
+        type: {
+            type: "string",
+            description: "Type name: str, int, float, bool, list, dict, any, image, audio, video, document."
+        },
+        optional: { type: "boolean" },
+        type_args: {
+            type: "array",
+            description: "Element types for list and dict.",
+            items: { type: "object" }
+        }
+    },
+    required: ["type"]
+};
+const SUBMIT_CODE_INPUT_SCHEMA = {
+    type: "object",
+    properties: {
+        title: {
+            type: "string",
+            maxLength: MAX_TITLE_LENGTH,
+            description: "Imperative node title, e.g. \"Merge orders by customer\"."
+        },
+        summary: {
+            type: "string",
+            maxLength: MAX_SUMMARY_LENGTH,
+            description: "One sentence describing what the node does."
+        },
+        code: {
+            type: "string",
+            maxLength: MAX_CODE_LENGTH,
+            description: "The function body. Declared inputs are globals; end by returning an " +
+                "object whose keys are exactly the declared outputs."
+        },
+        inputs: {
+            type: "array",
+            maxItems: MAX_PORTS,
+            description: "Input slots the code reads as global variables.",
+            items: {
+                type: "object",
+                properties: {
+                    name: {
+                        type: "string",
+                        description: "Valid JavaScript identifier, unique among inputs."
+                    },
+                    type: PORT_TYPE_SCHEMA,
+                    description: { type: "string" },
+                    required: { type: "boolean" }
+                },
+                required: ["name", "type"]
+            }
+        },
+        outputs: {
+            type: "array",
+            minItems: 1,
+            maxItems: MAX_PORTS,
+            description: "Output slots. Must match the keys of the returned object.",
+            items: {
+                type: "object",
+                properties: {
+                    name: {
+                        type: "string",
+                        description: "Valid JavaScript identifier, unique among outputs."
+                    },
+                    type: PORT_TYPE_SCHEMA,
+                    description: { type: "string" }
+                },
+                required: ["name", "type"]
+            }
+        }
+    },
+    required: ["title", "summary", "code", "inputs", "outputs"]
+};
+/**
+ * Errors for seeded ports the submission failed to honour.
+ *
+ * The transport schema checks the submission against itself; nothing there
+ * knows which handles the graph has already wired. That contract is what makes
+ * the pre-created edge valid, so it is enforced here, where a violation can
+ * still be handed back to the model as a feedback round.
+ */
+function checkSeededPorts(submission, requiredInputs, expectedOutput) {
+    const errors = [];
+    for (const required of requiredInputs) {
+        const match = submission.inputs.find((port) => port.name === required.name);
+        if (!match) {
+            errors.push(`Input "${required.name}" is already connected to another node and must ` +
+                `stay in the submission under that exact name. Declare it as ` +
+                `"${required.name}": ${formatPortType(required.type)}.`);
+            continue;
+        }
+        if (!portTypesCompatible(required.type, match.type)) {
+            errors.push(`Input "${required.name}" is connected as ${formatPortType(required.type)}, ` +
+                `but the submission types it ${formatPortType(match.type)}. Keep the ` +
+                `connected type, and convert inside the code if you need another shape.`);
+        }
+    }
+    if (expectedOutput) {
+        const match = submission.outputs.find((port) => port.name === expectedOutput.name);
+        if (!match) {
+            errors.push(`Output "${expectedOutput.name}" is already connected to another node ` +
+                `and must stay in the submission under that exact name. Declare it as ` +
+                `"${expectedOutput.name}": ${formatPortType(expectedOutput.type)}.`);
+            // Wire order: the submission's output feeds the handle that expects it.
+            // The check is symmetric, so this reads as the graph does.
+        }
+        else if (!portTypesCompatible(match.type, expectedOutput.type)) {
+            errors.push(`Output "${expectedOutput.name}" is consumed as ` +
+                `${formatPortType(expectedOutput.type)}, but the submission types it ` +
+                `${formatPortType(match.type)}. Return the connected type.`);
+        }
+    }
+    return errors;
+}
+export class SubmitCodeTool extends Tool {
+    options;
+    name = "submit_code";
+    description = "Submit the finished Code node: title, summary, code, and typed input and " +
+        "output slots. Returns the validation errors to fix (resubmit the full " +
+        "corrected node), or accepts the submission.";
+    jsonSchema = SUBMIT_CODE_INPUT_SCHEMA;
+    _submission = null;
+    /** Code of the last submission, accepted or not — used in the retry prompt. */
+    lastCode = null;
+    /** Errors from the last rejected submission. */
+    lastErrors = [];
+    /** Submissions seen so far, so the planner can cap feedback rounds. */
+    rounds = 0;
+    get submission() {
+        return this._submission;
+    }
+    constructor(options = {}) {
+        super();
+        this.options = options;
+    }
+    async process(_context, params) {
+        this.rounds++;
+        this.lastCode =
+            isString(params["code"]) ? params["code"] : null;
+        this.lastErrors = [];
+        const parsed = codeGenSubmission.safeParse(params);
+        if (!parsed.success) {
+            this.lastErrors = formatZodIssues(parsed.error);
+            return { status: "code_rejected", errors: this.lastErrors };
+        }
+        const submission = parsed.data;
+        this.lastCode = submission.code;
+        // A port type lands verbatim on the node and decides handle compatibility,
+        // so an `integer` where NodeTool means `int` produces a node that looks
+        // right and will not connect. The transport schema can't catch it — custom
+        // type names are open-ended — but the feedback round can.
+        const typeErrors = checkPortTypes(submission);
+        if (typeErrors.length > 0) {
+            this.lastErrors = typeErrors;
+            return { status: "code_rejected", errors: typeErrors };
+        }
+        // Checked after the alias pass so an aliased type is reported as the alias
+        // it is, rather than as a mismatch against the handle it was seeded from.
+        const seededErrors = checkSeededPorts(submission, this.options.requiredInputs ?? [], this.options.expectedOutput);
+        if (seededErrors.length > 0) {
+            this.lastErrors = seededErrors;
+            return { status: "code_rejected", errors: seededErrors };
+        }
+        const analysis = analyzeGeneratedCode(submission.code, submission.outputs.map((output) => output.name));
+        if (!analysis.ok) {
+            this.lastErrors = analysis.errors;
+            return { status: "code_rejected", errors: analysis.errors };
+        }
+        this._submission = submission;
+        this.options.onAccepted?.();
+        return {
+            status: "code_accepted",
+            title: submission.title,
+            inputs: submission.inputs.map((input) => input.name),
+            outputs: submission.outputs.map((output) => output.name)
+        };
+    }
+    userMessage(_params) {
+        return "Submitting generated code";
+    }
+}
+function formatZodIssues(error) {
+    return error.issues.map((issue) => {
+        const path = issue.path.join(".");
+        return path ? `${path}: ${issue.message}` : issue.message;
+    });
+}
+//# sourceMappingURL=submit-code-tool.js.map

package/dist/tools/submit-code-tool.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"submit-code-tool.js","sourceRoot":"","sources":["../../src/tools/submit-code-tool.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAGH,OAAO,EACL,iBAAiB,EACjB,eAAe,EACf,SAAS,EACT,kBAAkB,EAClB,gBAAgB,EAIjB,MAAM,+CAA+C,CAAC;AAEvD,OAAO,EAAE,IAAI,EAAE,MAAM,gBAAgB,CAAC;AACtC,OAAO,EAAE,oBAAoB,EAAE,MAAM,wBAAwB,CAAC;AAC9D,OAAO,EACL,cAAc,EACd,cAAc,EACd,mBAAmB,EACpB,MAAM,2BAA2B,CAAC;AACnC,OAAO,EAAE,QAAQ,EAAE,MAAM,yBAAyB,CAAC;AAEnD,MAAM,gBAAgB,GAAG;IACvB,IAAI,EAAE,QAAiB;IACvB,WAAW,EACT,sDAAsD;QACtD,6DAA6D;IAC/D,UAAU,EAAE;QACV,IAAI,EAAE;YACJ,IAAI,EAAE,QAAiB;YACvB,WAAW,EACT,mFAAmF;SACtF;QACD,QAAQ,EAAE,EAAE,IAAI,EAAE,SAAkB,EAAE;QACtC,SAAS,EAAE;YACT,IAAI,EAAE,OAAgB;YACtB,WAAW,EAAE,kCAAkC;YAC/C,KAAK,EAAE,EAAE,IAAI,EAAE,QAAiB,EAAE;SACnC;KACF;IACD,QAAQ,EAAE,CAAC,MAAM,CAAC;CACnB,CAAC;AAEF,MAAM,wBAAwB,GAAG;IAC/B,IAAI,EAAE,QAAiB;IACvB,UAAU,EAAE;QACV,KAAK,EAAE;YACL,IAAI,EAAE,QAAiB;YACvB,SAAS,EAAE,gBAAgB;YAC3B,WAAW,EAAE,2DAA2D;SACzE;QACD,OAAO,EAAE;YACP,IAAI,EAAE,QAAiB;YACvB,SAAS,EAAE,kBAAkB;YAC7B,WAAW,EAAE,6CAA6C;SAC3D;QACD,IAAI,EAAE;YACJ,IAAI,EAAE,QAAiB;YACvB,SAAS,EAAE,eAAe;YAC1B,WAAW,EACT,sEAAsE;gBACtE,qDAAqD;SACxD;QACD,MAAM,EAAE;YACN,IAAI,EAAE,OAAgB;YACtB,QAAQ,EAAE,SAAS;YACnB,WAAW,EAAE,iDAAiD;YAC9D,KAAK,EAAE;gBACL,IAAI,EAAE,QAAiB;gBACvB,UAAU,EAAE;oBACV,IAAI,EAAE;wBACJ,IAAI,EAAE,QAAiB;wBACvB,WAAW,EAAE,mDAAmD;qBACjE;oBACD,IAAI,EAAE,gBAAgB;oBACtB,WAAW,EAAE,EAAE,IAAI,EAAE,QAAiB,EAAE;oBACxC,QAAQ,EAAE,EAAE,IAAI,EAAE,SAAkB,EAAE;iBACvC;gBACD,QAAQ,EAAE,CAAC,MAAM,EAAE,MAAM,CAAC;aAC3B;SACF;QACD,OAAO,EAAE;YACP,IAAI,EAAE,OAAgB;YACtB,QAAQ,EAAE,CAAC;YACX,QAAQ,EAAE,SAAS;YACnB,WAAW,EAAE,2DAA2D;YACxE,KAAK,EAAE;gBACL,IAAI,EAAE,QAAiB;gBACvB,UAAU,EAAE;oBACV,IAAI,EAAE;wBACJ,IAAI,EAAE,QAAiB;wBACvB,WAAW,EAAE,oDAAoD;qBAClE;oBACD,IAAI,EAAE,gBAAgB;oBACtB,WAAW,EAAE,EAAE,IAAI,EAAE,QAAiB,EAAE;iBACzC;gBACD,QAAQ,EAAE,CAAC,MAAM,EAAE,MAAM,CAAC;aAC3B;SACF;KACF;IACD,QAAQ,EAAE,CAAC,OAAO,EAAE,SAAS,EAAE,MAAM,EAAE,QAAQ,EAAE,SAAS,CAAC;CAC5D,CAAC;AAgBF;;;;;;;GAOG;AACH,SAAS,gBAAgB,CACvB,UAA6B,EAC7B,cAA2C,EAC3C,cAAiD;IAEjD,MAAM,MAAM,GAAa,EAAE,CAAC;IAE5B,KAAK,MAAM,QAAQ,IAAI,cAAc,EAAE,CAAC;QACtC,MAAM,KAAK,GAAG,UAAU,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,KAAK,QAAQ,CAAC,IAAI,CAAC,CAAC;QAC5E,IAAI,CAAC,KAAK,EAAE,CAAC;YACX,MAAM,CAAC,IAAI,CACT,UAAU,QAAQ,CAAC,IAAI,kDAAkD;gBACvE,8DAA8D;gBAC9D,IAAI,QAAQ,CAAC,IAAI,MAAM,cAAc,CAAC,QAAQ,CAAC,IAAI,CAAC,GAAG,CAC1D,CAAC;YACF,SAAS;QACX,CAAC;QACD,IAAI,CAAC,mBAAmB,CAAC,QAAQ,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC;YACpD,MAAM,CAAC,IAAI,CACT,UAAU,QAAQ,CAAC,IAAI,qBAAqB,cAAc,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI;gBAC3E,+BAA+B,cAAc,CAAC,KAAK,CAAC,IAAI,CAAC,aAAa;gBACtE,wEAAwE,CAC3E,CAAC;QACJ,CAAC;IACH,CAAC;IAED,IAAI,cAAc,EAAE,CAAC;QACnB,MAAM,KAAK,GAAG,UAAU,CAAC,OAAO,CAAC,IAAI,CACnC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,KAAK,cAAc,CAAC,IAAI,CAC5C,CAAC;QACF,IAAI,CAAC,KAAK,EAAE,CAAC;YACX,MAAM,CAAC,IAAI,CACT,WAAW,cAAc,CAAC,IAAI,yCAAyC;gBACrE,uEAAuE;gBACvE,IAAI,cAAc,CAAC,IAAI,MAAM,cAAc,CAAC,cAAc,CAAC,IAAI,CAAC,GAAG,CACtE,CAAC;YACF,wEAAwE;YACxE,2DAA2D;QAC7D,CAAC;aAAM,IAAI,CAAC,mBAAmB,CAAC,KAAK,CAAC,IAAI,EAAE,cAAc,CAAC,IAAI,CAAC,EAAE,CAAC;YACjE,MAAM,CAAC,IAAI,CACT,WAAW,cAAc,CAAC,IAAI,mBAAmB;gBAC/C,GAAG,cAAc,CAAC,cAAc,CAAC,IAAI,CAAC,gCAAgC;gBACtE,GAAG,cAAc,CAAC,KAAK,CAAC,IAAI,CAAC,8BAA8B,CAC9D,CAAC;QACJ,CAAC;IACH,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC;AAYD,MAAM,OAAO,cAAe,SAAQ,IAAI;IAoBT,OAAO;IAnB3B,IAAI,GAAG,aAAa,CAAC;IACrB,WAAW,GAClB,2EAA2E;QAC3E,wEAAwE;QACxE,6CAA6C,CAAC;IACvC,UAAU,GAAG,wBAA0D,CAAC;IAEzE,WAAW,GAA6B,IAAI,CAAC;IACrD,+EAA+E;IAC/E,QAAQ,GAAkB,IAAI,CAAC;IAC/B,gDAAgD;IAChD,UAAU,GAAa,EAAE,CAAC;IAC1B,uEAAuE;IACvE,MAAM,GAAG,CAAC,CAAC;IAEX,IAAI,UAAU;QACZ,OAAO,IAAI,CAAC,WAAW,CAAC;IAC1B,CAAC;IAED,YAA6B,OAAO,GAA0B,EAAE;QAC9D,KAAK,EAAE,CAAC;uBADmB,OAAO;IAEpC,CAAC;IAED,KAAK,CAAC,OAAO,CACX,QAA2B,EAC3B,MAA+B;QAE/B,IAAI,CAAC,MAAM,EAAE,CAAC;QACd,IAAI,CAAC,QAAQ;YACX,QAAQ,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;QACnD,IAAI,CAAC,UAAU,GAAG,EAAE,CAAC;QAErB,MAAM,MAAM,GAAG,iBAAiB,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC;QACnD,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC;YACpB,IAAI,CAAC,UAAU,GAAG,eAAe,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;YAChD,OAAO,EAAE,MAAM,EAAE,eAAe,EAAE,MAAM,EAAE,IAAI,CAAC,UAAU,EAAE,CAAC;QAC9D,CAAC;QAED,MAAM,UAAU,GAAG,MAAM,CAAC,IAAI,CAAC;QAC/B,IAAI,CAAC,QAAQ,GAAG,UAAU,CAAC,IAAI,CAAC;QAEhC,2EAA2E;QAC3E,wEAAwE;QACxE,2EAA2E;QAC3E,0DAA0D;QAC1D,MAAM,UAAU,GAAG,cAAc,CAAC,UAAU,CAAC,CAAC;QAC9C,IAAI,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC1B,IAAI,CAAC,UAAU,GAAG,UAAU,CAAC;YAC7B,OAAO,EAAE,MAAM,EAAE,eAAe,EAAE,MAAM,EAAE,UAAU,EAAE,CAAC;QACzD,CAAC;QAED,2EAA2E;QAC3E,0EAA0E;QAC1E,MAAM,YAAY,GAAG,gBAAgB,CACnC,UAAU,EACV,IAAI,CAAC,OAAO,CAAC,cAAc,IAAI,EAAE,EACjC,IAAI,CAAC,OAAO,CAAC,cAAc,CAC5B,CAAC;QACF,IAAI,YAAY,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC5B,IAAI,CAAC,UAAU,GAAG,YAAY,CAAC;YAC/B,OAAO,EAAE,MAAM,EAAE,eAAe,EAAE,MAAM,EAAE,YAAY,EAAE,CAAC;QAC3D,CAAC;QAED,MAAM,QAAQ,GAAG,oBAAoB,CACnC,UAAU,CAAC,IAAI,EACf,UAAU,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,CAChD,CAAC;QACF,IAAI,CAAC,QAAQ,CAAC,EAAE,EAAE,CAAC;YACjB,IAAI,CAAC,UAAU,GAAG,QAAQ,CAAC,MAAM,CAAC;YAClC,OAAO,EAAE,MAAM,EAAE,eAAe,EAAE,MAAM,EAAE,QAAQ,CAAC,MAAM,EAAE,CAAC;QAC9D,CAAC;QAED,IAAI,CAAC,WAAW,GAAG,UAAU,CAAC;QAC9B,IAAI,CAAC,OAAO,CAAC,UAAU,EAAE,EAAE,CAAC;QAC5B,OAAO;YACL,MAAM,EAAE,eAAe;YACvB,KAAK,EAAE,UAAU,CAAC,KAAK;YACvB,MAAM,EAAE,UAAU,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC;YACpD,OAAO,EAAE,UAAU,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC;SACzD,CAAC;IACJ,CAAC;IAED,WAAW,CAAC,OAAgC;QAC1C,OAAO,2BAA2B,CAAC;IACrC,CAAC;CACF;AAED,SAAS,eAAe,CAAC,KAAiB;IACxC,OAAO,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE;QAChC,MAAM,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAClC,OAAO,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,KAAK,KAAK,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC;IAC5D,CAAC,CAAC,CAAC;AACL,CAAC"}

package/dist/tools/subtask-fields.d.ts

@@ -0,0 +1,11 @@
+/**
+ * Reserved field names shared between {@link StepExecutor} and the
+ * `run_subtask` tool. Kept in this leaf module (no imports) so the two
+ * modules don't have to import each other — importing across that boundary
+ * created a top-level-await cycle that deadlocked the bundled server.
+ */
+/** Context variable carrying the current subtask depth (0 at the chat root). */
+export declare const SUBTASK_DEPTH_KEY = "__subtask_depth";
+/** Reserved input-schema field StepExecutor sets to the LLM-provided tool_call_id. */
+export declare const TOOL_CALL_ID_FIELD = "_tool_call_id";
+//# sourceMappingURL=subtask-fields.d.ts.map

package/dist/tools/subtask-fields.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"subtask-fields.d.ts","sourceRoot":"","sources":["../../src/tools/subtask-fields.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,gFAAgF;AAChF,eAAO,MAAM,iBAAiB,oBAAoB,CAAC;AAEnD,sFAAsF;AACtF,eAAO,MAAM,kBAAkB,kBAAkB,CAAC"}