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

package/dist/system-skills.js

@@ -0,0 +1,168 @@
+/**
+ * System skills — the instruction documents that ship with NodeTool.
+ *
+ * A user skill is a row someone wrote and can rewrite. A system skill is a
+ * `SKILL.md` in the build: same shape in the prompt, but **immutable**, so a
+ * workflow the product depends on cannot be edited away by an agent that
+ * mis-read its own instructions, and every install has it on day one without a
+ * seeding migration that then drifts per machine.
+ *
+ * Nothing imports these files, so they are not a workspace and npm links
+ * nothing. Discovery mirrors the sandbox packs (`shippedPackSearchPaths`):
+ * `_skills/` beside the bundled `server.mjs`, else `packages/system-skills` on
+ * the way up from this module, else `NODETOOL_SYSTEM_SKILLS_DIR`.
+ *
+ * Their names are **reserved**: `create_skill` and `update_skill` refuse them,
+ * so a user row can never shadow one going forward.
+ */
+import { existsSync, readdirSync, readFileSync, statSync } from "node:fs";
+import { dirname, join } from "node:path";
+import { fileURLToPath } from "node:url";
+import { SHIPPED_SYSTEM_SKILLS_BUNDLE_DIR, SHIPPED_SYSTEM_SKILLS_SOURCE_DIR } from "@nodetool-ai/config";
+import { isValidSkillDescription, isValidSkillName } from "@nodetool-ai/protocol";
+/** The directory holding the shipped skills, or null when this build has none. */
+export function systemSkillsDir() {
+    const override = process.env["NODETOOL_SYSTEM_SKILLS_DIR"];
+    if (override)
+        return existsSync(override) ? override : null;
+    const here = dirname(fileURLToPath(import.meta.url));
+    const bundled = join(here, SHIPPED_SYSTEM_SKILLS_BUNDLE_DIR);
+    if (existsSync(bundled))
+        return bundled;
+    const segments = SHIPPED_SYSTEM_SKILLS_SOURCE_DIR.split("/");
+    let dir = here;
+    for (;;) {
+        const candidate = join(dir, ...segments);
+        if (existsSync(candidate))
+            return candidate;
+        const parent = dirname(dir);
+        if (parent === dir)
+            return null;
+        dir = parent;
+    }
+}
+/**
+ * Split a `SKILL.md` into its frontmatter fields and body.
+ *
+ * Deliberately not a YAML parse: the frontmatter is two scalar fields, and
+ * pulling js-yaml into the host to read them would buy nothing. A file whose
+ * frontmatter is missing or malformed yields null and is skipped rather than
+ * failing the whole catalog — one bad shipped file must not cost a user every
+ * other skill.
+ */
+export function parseSkillMarkdown(text) {
+    // A fence is a whole line. Matching it as a substring ended the frontmatter
+    // on any line merely starting with "---", spilling the fields below it into
+    // the body the model reads as instructions.
+    const lines = text.split(/\r?\n/);
+    if (lines[0] !== "---")
+        return null;
+    const close = lines.indexOf("---", 1);
+    if (close === -1)
+        return null;
+    const front = lines.slice(1, close).join("\n");
+    const body = lines.slice(close + 1).join("\n");
+    const field = (key) => {
+        // `\s` matches newlines, so a `\s*` here let an empty field take the next
+        // line as its value.
+        const line = new RegExp(`^${key}:(.*)$`, "m").exec(front);
+        const value = (line?.[1] ?? "").trim();
+        // Only a matching pair wraps the value: stripping a leading and a trailing
+        // quote independently ate the closing quote off a quoted trigger phrase.
+        const quote = value[0];
+        const quoted = (quote === '"' || quote === "'") &&
+            value.length >= 2 &&
+            value.endsWith(quote);
+        return quoted ? value.slice(1, -1) : value;
+    };
+    const name = field("name").toLowerCase();
+    const description = field("description");
+    const content = body.trim();
+    if (!name || !description || !content)
+        return null;
+    if (!isValidSkillName(name) || !isValidSkillDescription(description)) {
+        return null;
+    }
+    return { name, description, content };
+}
+let cache = null;
+/**
+ * Every shipped skill, read once per process.
+ *
+ * Cached because the files are part of the build and cannot change under a
+ * running server; `clearSystemSkillCache` exists for tests that stage a
+ * directory of their own.
+ */
+export function loadSystemSkills() {
+    if (cache)
+        return cache;
+    cache = readSystemSkills();
+    return cache;
+}
+/** Drop the cache. Tests only. */
+export function clearSystemSkillCache() {
+    cache = null;
+}
+function readSystemSkills() {
+    const root = systemSkillsDir();
+    if (!root)
+        return [];
+    let entries;
+    try {
+        entries = readdirSync(root);
+    }
+    catch {
+        return [];
+    }
+    const skills = [];
+    const seen = new Set();
+    for (const entry of entries.sort()) {
+        const file = join(root, entry, "SKILL.md");
+        try {
+            if (!statSync(join(root, entry)).isDirectory())
+                continue;
+            if (!existsSync(file))
+                continue;
+            const parsed = parseSkillMarkdown(readFileSync(file, "utf8"));
+            if (!parsed)
+                continue;
+            // The directory names the skill. A frontmatter name that disagrees is a
+            // packaging mistake, and taking the directory keeps `/name` matching what
+            // a reader sees on disk.
+            if (parsed.name !== entry.toLowerCase())
+                continue;
+            if (seen.has(parsed.name))
+                continue;
+            seen.add(parsed.name);
+            skills.push({ ...parsed, system: true });
+        }
+        catch {
+            // A skill that cannot be read is skipped, never fatal.
+        }
+    }
+    return skills;
+}
+/** Whether `name` belongs to a shipped skill, and is therefore not writable. */
+export function isSystemSkillName(name) {
+    const wanted = name.trim().replace(/^\//, "").toLowerCase();
+    return loadSystemSkills().some((skill) => skill.name === wanted);
+}
+/** One shipped skill by name, or null. */
+export function findSystemSkill(name) {
+    const wanted = name.trim().replace(/^\//, "").toLowerCase();
+    return loadSystemSkills().find((skill) => skill.name === wanted) ?? null;
+}
+/**
+ * The catalog a prompt or `list_skills` should show: the user's rows, plus every
+ * shipped skill the user has not already taken the name of.
+ *
+ * A pre-existing user row wins on a collision. Reserving the names only stops
+ * *new* ones, so a row written before a skill shipped keeps working — and the
+ * person who wrote it gets what they wrote.
+ */
+export function mergeSystemSkills(userSkills) {
+    const taken = new Set(userSkills.map((skill) => skill.name.toLowerCase()));
+    const shipped = loadSystemSkills().filter((skill) => !taken.has(skill.name));
+    return [...userSkills, ...shipped];
+}
+//# sourceMappingURL=system-skills.js.map

package/dist/system-skills.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"system-skills.js","sourceRoot":"","sources":["../src/system-skills.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;GAgBG;AAEH,OAAO,EAAE,UAAU,EAAE,WAAW,EAAE,YAAY,EAAE,QAAQ,EAAE,MAAM,SAAS,CAAC;AAC1E,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,MAAM,WAAW,CAAC;AAC1C,OAAO,EAAE,aAAa,EAAE,MAAM,UAAU,CAAC;AACzC,OAAO,EACL,gCAAgC,EAChC,gCAAgC,EACjC,MAAM,qBAAqB,CAAC;AAC7B,OAAO,EAAE,uBAAuB,EAAE,gBAAgB,EAAE,MAAM,uBAAuB,CAAC;AAWlF,kFAAkF;AAClF,MAAM,UAAU,eAAe;IAC7B,MAAM,QAAQ,GAAG,OAAO,CAAC,GAAG,CAAC,4BAA4B,CAAC,CAAC;IAC3D,IAAI,QAAQ;QAAE,OAAO,UAAU,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC;IAE5D,MAAM,IAAI,GAAG,OAAO,CAAC,aAAa,CAAC,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;IACrD,MAAM,OAAO,GAAG,IAAI,CAAC,IAAI,EAAE,gCAAgC,CAAC,CAAC;IAC7D,IAAI,UAAU,CAAC,OAAO,CAAC;QAAE,OAAO,OAAO,CAAC;IAExC,MAAM,QAAQ,GAAG,gCAAgC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;IAC7D,IAAI,GAAG,GAAG,IAAI,CAAC;IACf,SAAS,CAAC;QACR,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,QAAQ,CAAC,CAAC;QACzC,IAAI,UAAU,CAAC,SAAS,CAAC;YAAE,OAAO,SAAS,CAAC;QAC5C,MAAM,MAAM,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC;QAC5B,IAAI,MAAM,KAAK,GAAG;YAAE,OAAO,IAAI,CAAC;QAChC,GAAG,GAAG,MAAM,CAAC;IACf,CAAC;AACH,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,kBAAkB,CAAC,IAAY;IAK7C,4EAA4E;IAC5E,4EAA4E;IAC5E,4CAA4C;IAC5C,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;IAClC,IAAI,KAAK,CAAC,CAAC,CAAC,KAAK,KAAK;QAAE,OAAO,IAAI,CAAC;IACpC,MAAM,KAAK,GAAG,KAAK,CAAC,OAAO,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;IACtC,IAAI,KAAK,KAAK,CAAC,CAAC;QAAE,OAAO,IAAI,CAAC;IAC9B,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC/C,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC/C,MAAM,KAAK,GAAG,CAAC,GAAW,EAAU,EAAE;QACpC,0EAA0E;QAC1E,qBAAqB;QACrB,MAAM,IAAI,GAAG,IAAI,MAAM,CAAC,IAAI,GAAG,QAAQ,EAAE,GAAG,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC1D,MAAM,KAAK,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC;QACvC,2EAA2E;QAC3E,yEAAyE;QACzE,MAAM,KAAK,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QACvB,MAAM,MAAM,GACV,CAAC,KAAK,KAAK,GAAG,IAAI,KAAK,KAAK,GAAG,CAAC;YAChC,KAAK,CAAC,MAAM,IAAI,CAAC;YACjB,KAAK,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;QACxB,OAAO,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;IAC7C,CAAC,CAAC;IACF,MAAM,IAAI,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,WAAW,EAAE,CAAC;IACzC,MAAM,WAAW,GAAG,KAAK,CAAC,aAAa,CAAC,CAAC;IACzC,MAAM,OAAO,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC;IAC5B,IAAI,CAAC,IAAI,IAAI,CAAC,WAAW,IAAI,CAAC,OAAO;QAAE,OAAO,IAAI,CAAC;IACnD,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,IAAI,CAAC,uBAAuB,CAAC,WAAW,CAAC,EAAE,CAAC;QACrE,OAAO,IAAI,CAAC;IACd,CAAC;IACD,OAAO,EAAE,IAAI,EAAE,WAAW,EAAE,OAAO,EAAE,CAAC;AACxC,CAAC;AAED,IAAI,KAAK,GAAkC,IAAI,CAAC;AAEhD;;;;;;GAMG;AACH,MAAM,UAAU,gBAAgB;IAC9B,IAAI,KAAK;QAAE,OAAO,KAAK,CAAC;IACxB,KAAK,GAAG,gBAAgB,EAAE,CAAC;IAC3B,OAAO,KAAK,CAAC;AACf,CAAC;AAED,kCAAkC;AAClC,MAAM,UAAU,qBAAqB;IACnC,KAAK,GAAG,IAAI,CAAC;AACf,CAAC;AAED,SAAS,gBAAgB;IACvB,MAAM,IAAI,GAAG,eAAe,EAAE,CAAC;IAC/B,IAAI,CAAC,IAAI;QAAE,OAAO,EAAE,CAAC;IACrB,IAAI,OAAiB,CAAC;IACtB,IAAI,CAAC;QACH,OAAO,GAAG,WAAW,CAAC,IAAI,CAAC,CAAC;IAC9B,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,EAAE,CAAC;IACZ,CAAC;IACD,MAAM,MAAM,GAAkB,EAAE,CAAC;IACjC,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,KAAK,MAAM,KAAK,IAAI,OAAO,CAAC,IAAI,EAAE,EAAE,CAAC;QACnC,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,EAAE,KAAK,EAAE,UAAU,CAAC,CAAC;QAC3C,IAAI,CAAC;YACH,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC,WAAW,EAAE;gBAAE,SAAS;YACzD,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC;gBAAE,SAAS;YAChC,MAAM,MAAM,GAAG,kBAAkB,CAAC,YAAY,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC,CAAC;YAC9D,IAAI,CAAC,MAAM;gBAAE,SAAS;YACtB,wEAAwE;YACxE,0EAA0E;YAC1E,yBAAyB;YACzB,IAAI,MAAM,CAAC,IAAI,KAAK,KAAK,CAAC,WAAW,EAAE;gBAAE,SAAS;YAClD,IAAI,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC;gBAAE,SAAS;YACpC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;YACtB,MAAM,CAAC,IAAI,CAAC,EAAE,GAAG,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC,CAAC;QAC3C,CAAC;QAAC,MAAM,CAAC;YACP,uDAAuD;QACzD,CAAC;IACH,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,gFAAgF;AAChF,MAAM,UAAU,iBAAiB,CAAC,IAAY;IAC5C,MAAM,MAAM,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC,OAAO,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,WAAW,EAAE,CAAC;IAC5D,OAAO,gBAAgB,EAAE,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,IAAI,KAAK,MAAM,CAAC,CAAC;AACnE,CAAC;AAED,0CAA0C;AAC1C,MAAM,UAAU,eAAe,CAAC,IAAY;IAC1C,MAAM,MAAM,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC,OAAO,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,WAAW,EAAE,CAAC;IAC5D,OAAO,gBAAgB,EAAE,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,IAAI,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC;AAC3E,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,iBAAiB,CAC/B,UAAwB;IAExB,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC;IAC3E,MAAM,OAAO,GAAG,gBAAgB,EAAE,CAAC,MAAM,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC;IAC7E,OAAO,CAAC,GAAG,UAAU,EAAE,GAAG,OAAO,CAAC,CAAC;AACrC,CAAC"}

package/dist/task-executor.d.ts

@@ -3,18 +3,13 @@
  *
  * Port of src/nodetool/agents/task_executor.py
  *
- * Iteratively finds steps whose dependencies are satisfied, runs
- * StepExecutor for each, and collects results until all steps complete
- * or the safety limit is reached.
- *
- * Process-mode steps automatically fan out over list inputs produced by
- * a preceding discover step. Each item is rendered into the step's
- * `perItemInstructions` template and executed as an ephemeral step.
- * Results are aggregated into a list that downstream aggregate steps consume.
+ * The task's steps are a DAG, handed to {@link scheduleDag}: a step starts the
+ * moment its last dependency settles and runs as a `CodeActExecutor`. Nothing
+ * counts dispatch rounds, so a chain is as deep as the plan says; what bounds
+ * the work is the run budget, the per-step iteration cap, and the permit pool.
  */
-import type { BaseProvider } from "@nodetool-ai/runtime";
-import type { ProcessingContext } from "@nodetool-ai/runtime";
-import type { ProcessingMessage } from "@nodetool-ai/protocol";
+import type { BaseProvider, ProcessingContext, RunBudget } from "@nodetool-ai/runtime";
+import { type ProcessingMessage } from "@nodetool-ai/protocol";
 import type { Tool } from "./tools/base-tool.js";
 import type { Task } from "./types.js";
 export interface TaskExecutorOptions {
@@ -25,13 +20,34 @@ export interface TaskExecutorOptions {
     task: Task;
     systemPrompt?: string;
     inputs?: Record<string, unknown>;
-    maxSteps?: number;
     maxStepIterations?: number;
-    maxTokenLimit?: number;
-    /** ID of the final aggregation step (will use useFinishTask=true). */
-    finalStepId?: string;
-    /** Execute independent steps in parallel (default: false). */
-    parallelExecution?: boolean;
+    /** Cap on output tokens per step turn. Forwarded to each step executor. */
+    maxTokens?: number;
+    /**
+     * Steps this task may run at once. Defaults to the shared agent policy, so a
+     * wide task does not open one provider conversation per step.
+     */
+    maxConcurrentAgents?: number;
+    /**
+     * Memory keys (typically `task:<id>` from the parent plan's task-level
+     * dependencies) to surface in every step's user message as required
+     * upstream context. Forwarded to {@link CodeActExecutor.upstreamMemoryKeys}.
+     */
+    upstreamMemoryKeys?: string[];
+    /**
+     * The run's budget, forwarded to every step executor so the whole task
+     * reserves against one cap, and used as the concurrency bound its fan-outs
+     * share. Omitted, the budget on {@link context} is used; absent there too,
+     * the task is unbudgeted.
+     */
+    budget?: RunBudget;
+    /** External cancellation, forwarded to every step executor. */
+    signal?: AbortSignal;
+    /**
+     * Sandbox package specifiers the session consents to, forwarded to every step
+     * executor. Empty by default — installed is not chosen.
+     */
+    sandboxPackages?: readonly string[];
 }
 export declare class TaskExecutor {
     private provider;
@@ -41,12 +57,22 @@ export declare class TaskExecutor {
     private context;
     private inputs;
     private systemPrompt;
-    private maxSteps;
     private maxStepIterations;
-    private maxTokenLimit;
-    private finalStepId;
-    private parallelExecution;
+    private maxTokens?;
+    private maxConcurrentAgents;
+    private upstreamMemoryKeys;
+    private readonly budget?;
+    private signal?;
+    private readonly sandboxPackages;
     private _finishStepId;
+    /** Steps by id, so settling a node is not a scan of the task per dependency. */
+    private readonly stepsById;
+    /**
+     * Steps whose `step_result` reached the consumer. On abort the merge stops
+     * draining, so a step's own terminal events can land in a queue nobody
+     * reads; {@link settleStep} re-emits them for a step not in this set.
+     */
+    private readonly resultDelivered;
     constructor(opts: TaskExecutorOptions);
     /**
      * Execute all steps in the task plan, respecting dependency order.
@@ -54,36 +80,60 @@ export declare class TaskExecutor {
      */
     executeTasks(): AsyncGenerator<ProcessingMessage>;
     /**
-     * Produce a short deterministic hash for a value (used in ephemeral step IDs).
+     * The steps the scheduler runs, with the dependencies each waits on.
+     *
+     * A step already settled when the task starts is not a node: its dependents
+     * treat it as satisfied (completed) or as never satisfiable (failed), which
+     * is what the round loop's `completedIds` set did. Input keys count as
+     * satisfied the same way. A dependency naming nothing at all is left in
+     * place, so the step never becomes ready and the scheduler settles it with
+     * `unsatisfiable dependency`.
      */
-    private shortHash;
+    private stepNodes;
     /**
-     * Handle a process-mode step by fanning out over list inputs.
-     * Creates ephemeral steps for each item in the discover step's result
-     * and aggregates the outputs into a list stored in context.
+     * The steps the finish step must wait for: every other pending step that
+     * does not itself depend on the finish step.
+     *
+     * The aggregation step runs last, which the round loop arranged by holding
+     * it back each round. Here it is a real dependency, so a sibling that fails
+     * blocks it (I-5) instead of aggregating over a hole. Steps downstream of
+     * the finish step are excluded — a plan may declare one, and depending on
+     * them both ways is a cycle nothing could run.
      */
-    private handleProcessStep;
+    private stepsFinishWaitsFor;
     /**
-     * Check if all steps in the task are completed.
+     * Run one step and report how it settled.
+     *
+     * The step runs on a context of its own, sharing the task's memory: the
+     * permit the step merge holds for it is recorded there, so a sub-agent the
+     * step spawns finds its parent's permit rather than a sibling's. Messages a
+     * tool posts on that context are forwarded to the task's, where the host
+     * reads them.
      */
-    private allTasksComplete;
+    private runStep;
     /**
-     * Find steps whose dependencies are all satisfied (completed).
+     * Terminal events for a settled step. A step that ran emitted its own, so
+     * this speaks only for one that never did — blocked by a dependency that can
+     * never be satisfied — or for one the run's signal cut short, whose own
+     * terminal events the abort may have dropped on the way out.
      */
-    private getExecutableSteps;
+    private settleStep;
     /**
-     * Check if a step is currently running (started but not finished).
-     * Mirrors Python's Step.is_running().
+     * Bracket one step with a start/finish line. The run log recorded task
+     * boundaries and nothing between them, so a plan that spent minutes in a
+     * step left no trace of which step, how long, or how it settled. Bounded by
+     * the plan's step count, so it cannot become the log-volume problem it fixes.
      */
-    private isStepRunning;
+    private withStepLog;
     /**
-     * Check if a step is the designated finish/aggregation step.
+     * Tools a step may call. A plan's per-step `tools` allow-list is a privilege
+     * boundary, not a hint: an empty or fully-unresolvable list yields no tools
+     * rather than silently falling back to the full collection.
      */
+    private toolsForStep;
+    /** Record one step as a terminal failure and build its lifecycle events. */
+    private failStepEvents;
+    /** The task's last step, the one whose result is the task's result. */
     private isFinishStep;
-    /**
-     * Defer the finish step until all other steps are complete.
-     * This ensures the final aggregation step runs last.
-     */
-    private maybeDeferFinishStep;
 }
 //# sourceMappingURL=task-executor.d.ts.map

package/dist/task-executor.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"task-executor.d.ts","sourceRoot":"","sources":["../src/task-executor.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AAGH,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,sBAAsB,CAAC;AACzD,OAAO,KAAK,EAAE,iBAAiB,EAAE,MAAM,sBAAsB,CAAC;AAE9D,OAAO,KAAK,EAAE,iBAAiB,EAAqB,MAAM,uBAAuB,CAAC;AAIlF,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,sBAAsB,CAAC;AACjD,OAAO,KAAK,EAAQ,IAAI,EAAE,MAAM,YAAY,CAAC;AAM7C,MAAM,WAAW,mBAAmB;IAClC,QAAQ,EAAE,YAAY,CAAC;IACvB,KAAK,EAAE,MAAM,CAAC;IACd,OAAO,EAAE,iBAAiB,CAAC;IAC3B,KAAK,EAAE,IAAI,EAAE,CAAC;IACd,IAAI,EAAE,IAAI,CAAC;IACX,YAAY,CAAC,EAAE,MAAM,CAAC;IACtB,MAAM,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;IACjC,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,iBAAiB,CAAC,EAAE,MAAM,CAAC;IAC3B,aAAa,CAAC,EAAE,MAAM,CAAC;IACvB,sEAAsE;IACtE,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,8DAA8D;IAC9D,iBAAiB,CAAC,EAAE,OAAO,CAAC;CAC7B;AAED,qBAAa,YAAY;IACvB,OAAO,CAAC,QAAQ,CAAe;IAC/B,OAAO,CAAC,KAAK,CAAS;IACtB,OAAO,CAAC,KAAK,CAAS;IACtB,OAAO,CAAC,IAAI,CAAO;IACnB,OAAO,CAAC,OAAO,CAAoB;IACnC,OAAO,CAAC,MAAM,CAA0B;IACxC,OAAO,CAAC,YAAY,CAAqB;IACzC,OAAO,CAAC,QAAQ,CAAS;IACzB,OAAO,CAAC,iBAAiB,CAAS;IAClC,OAAO,CAAC,aAAa,CAAS;IAC9B,OAAO,CAAC,WAAW,CAAqB;IACxC,OAAO,CAAC,iBAAiB,CAAU;IACnC,OAAO,CAAC,aAAa,CAAqB;gBAE9B,IAAI,EAAE,mBAAmB;IAgBrC;;;OAGG;IACI,YAAY,IAAI,cAAc,CAAC,iBAAiB,CAAC;IAkFxD;;OAEG;IACH,OAAO,CAAC,SAAS;IAcjB;;;;OAIG;YACY,iBAAiB;IAyHhC;;OAEG;IACH,OAAO,CAAC,gBAAgB;IAIxB;;OAEG;IACH,OAAO,CAAC,kBAAkB;IAiB1B;;;OAGG;IACH,OAAO,CAAC,aAAa;IAIrB;;OAEG;IACH,OAAO,CAAC,YAAY;IAUpB;;;OAGG;IACH,OAAO,CAAC,oBAAoB;CAe7B"}
+{"version":3,"file":"task-executor.d.ts","sourceRoot":"","sources":["../src/task-executor.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAEH,OAAO,KAAK,EACV,YAAY,EACZ,iBAAiB,EACjB,SAAS,EACV,MAAM,sBAAsB,CAAC;AAO9B,OAAO,EAEL,KAAK,iBAAiB,EAGvB,MAAM,uBAAuB,CAAC;AAa/B,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,sBAAsB,CAAC;AACjD,OAAO,KAAK,EAAQ,IAAI,EAAE,MAAM,YAAY,CAAC;AAW7C,MAAM,WAAW,mBAAmB;IAClC,QAAQ,EAAE,YAAY,CAAC;IACvB,KAAK,EAAE,MAAM,CAAC;IACd,OAAO,EAAE,iBAAiB,CAAC;IAC3B,KAAK,EAAE,IAAI,EAAE,CAAC;IACd,IAAI,EAAE,IAAI,CAAC;IACX,YAAY,CAAC,EAAE,MAAM,CAAC;IACtB,MAAM,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;IACjC,iBAAiB,CAAC,EAAE,MAAM,CAAC;IAC3B,2EAA2E;IAC3E,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB;;;OAGG;IACH,mBAAmB,CAAC,EAAE,MAAM,CAAC;IAC7B;;;;OAIG;IACH,kBAAkB,CAAC,EAAE,MAAM,EAAE,CAAC;IAC9B;;;;;OAKG;IACH,MAAM,CAAC,EAAE,SAAS,CAAC;IACnB,+DAA+D;IAC/D,MAAM,CAAC,EAAE,WAAW,CAAC;IACrB;;;OAGG;IACH,eAAe,CAAC,EAAE,SAAS,MAAM,EAAE,CAAC;CACrC;AAED,qBAAa,YAAY;IACvB,OAAO,CAAC,QAAQ,CAAe;IAC/B,OAAO,CAAC,KAAK,CAAS;IACtB,OAAO,CAAC,KAAK,CAAS;IACtB,OAAO,CAAC,IAAI,CAAO;IACnB,OAAO,CAAC,OAAO,CAAoB;IACnC,OAAO,CAAC,MAAM,CAA0B;IACxC,OAAO,CAAC,YAAY,CAAqB;IACzC,OAAO,CAAC,iBAAiB,CAAS;IAClC,OAAO,CAAC,SAAS,CAAC,CAAS;IAC3B,OAAO,CAAC,mBAAmB,CAAS;IACpC,OAAO,CAAC,kBAAkB,CAAW;IACrC,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAY;IACpC,OAAO,CAAC,MAAM,CAAC,CAAc;IAC7B,OAAO,CAAC,QAAQ,CAAC,eAAe,CAAoB;IACpD,OAAO,CAAC,aAAa,CAAqB;IAC1C,gFAAgF;IAChF,OAAO,CAAC,QAAQ,CAAC,SAAS,CAAoB;IAC9C;;;;OAIG;IACH,OAAO,CAAC,QAAQ,CAAC,eAAe,CAAqB;IAErD,YAAY,IAAI,EAAE,mBAAmB,EAkBpC;IAED;;;OAGG;IACI,YAAY,IAAI,cAAc,CAAC,iBAAiB,CAAC,CAoDvD;IAED;;;;;;;;;OASG;IACH,OAAO,CAAC,SAAS;IAwBjB;;;;;;;;;OASG;IACH,OAAO,CAAC,mBAAmB;IA4B3B;;;;;;;;OAQG;YACY,OAAO;IA4CtB;;;;;OAKG;IACH,OAAO,CAAC,UAAU;IAuBlB;;;;;OAKG;YACY,WAAW;IAwB1B;;;;OAIG;IACH,OAAO,CAAC,YAAY;IAgBpB,4EAA4E;IAC5E,OAAO,CAAC,cAAc;IA8BtB,uEAAuE;IACvE,OAAO,CAAC,YAAY;CAGrB"}