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

package/dist/utils/json-schema-validate.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"json-schema-validate.d.ts","sourceRoot":"","sources":["../../src/utils/json-schema-validate.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AAUH,MAAM,WAAW,eAAe;IAC9B,0DAA0D;IAC1D,IAAI,EAAE,MAAM,CAAC;IACb,OAAO,EAAE,MAAM,CAAC;CACjB;AAED,KAAK,MAAM,GAAG,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;AA4DtC;;;GAGG;AACH,wBAAgB,qBAAqB,CACnC,KAAK,EAAE,OAAO,EACd,MAAM,EAAE,MAAM,EACd,IAAI,SAAW,GACd,eAAe,EAAE,CAInB;AAoLD,kEAAkE;AAClE,wBAAgB,gBAAgB,CAAC,UAAU,EAAE,eAAe,EAAE,GAAG,MAAM,CAEtE"}

package/dist/utils/json-schema-validate.js

@@ -0,0 +1,228 @@
+/**
+ * Host-side JSON-schema validation for structured step results.
+ *
+ * A step declares an `outputSchema`; the model answers through `finish_step`.
+ * The provider-side tool schema is a hint at best — several backends drop
+ * `enum`, flatten unions, or ignore `additionalProperties` — so whether the
+ * answer really matches the contract has to be decided here. A verdict schema
+ * makes that concrete: "one of five actions, and `substitute` also carries
+ * outputs" is a discriminated union, and a validator that only checks the
+ * top-level type and required keys accepts a verdict the kernel will reject.
+ *
+ * Deliberately a subset of JSON Schema — the keywords a step contract uses,
+ * validated exactly, rather than the full specification validated loosely.
+ */
+import { isBoolean, isNumber, isObjectLike, isRecord, isString } from "./type-guards.js";
+const TYPE_NAMES = [
+    "string",
+    "number",
+    "integer",
+    "boolean",
+    "object",
+    "array",
+    "null"
+];
+/** A `type` keyword this validator knows. */
+function isTypeName(value) {
+    return (typeof value === "string" &&
+        TYPE_NAMES.includes(value));
+}
+function typeOf(value) {
+    if (value === null)
+        return "null";
+    if (Array.isArray(value))
+        return "array";
+    if (isNumber(value)) {
+        return Number.isInteger(value) ? "integer" : "number";
+    }
+    if (isString(value))
+        return "string";
+    if (isBoolean(value))
+        return "boolean";
+    return "object";
+}
+function matchesType(value, expected) {
+    const actual = typeOf(value);
+    if (expected === "number")
+        return actual === "number" || actual === "integer";
+    return actual === expected;
+}
+function deepEqual(a, b) {
+    if (a === b)
+        return true;
+    if (typeof a !== typeof b || a === null || b === null)
+        return false;
+    if (Array.isArray(a) !== Array.isArray(b))
+        return false;
+    if (!isObjectLike(a))
+        return false;
+    const ao = a;
+    const bo = b;
+    const aKeys = Object.keys(ao);
+    if (aKeys.length !== Object.keys(bo).length)
+        return false;
+    return aKeys.every((key) => Object.hasOwn(bo, key) && deepEqual(ao[key], bo[key]));
+}
+function describe(value) {
+    const text = isString(value) ? value : JSON.stringify(value);
+    return text !== undefined && text.length > 60
+        ? `${text.slice(0, 60)}…`
+        : String(text);
+}
+/**
+ * Validate `value` against `schema`. Returns every violation found, so one
+ * bounce back to the model can fix everything rather than one thing per round.
+ */
+export function validateAgainstSchema(value, schema, path = "result") {
+    const out = [];
+    validate(value, schema, path, out);
+    return out;
+}
+function validate(value, schema, path, out) {
+    if (schema["const"] !== undefined && !deepEqual(value, schema["const"])) {
+        out.push({
+            path,
+            message: `must equal ${describe(schema["const"])}, got ${describe(value)}`
+        });
+        return;
+    }
+    const enumValues = schema["enum"];
+    if (Array.isArray(enumValues)) {
+        if (!enumValues.some((candidate) => deepEqual(value, candidate))) {
+            out.push({
+                path,
+                message: `must be one of ${enumValues.map((v) => describe(v)).join(", ")}, got ${describe(value)}`
+            });
+            return;
+        }
+    }
+    const declared = schema["type"];
+    const types = Array.isArray(declared)
+        ? declared.filter(isTypeName)
+        : isTypeName(declared)
+            ? [declared]
+            : [];
+    if (types.length > 0 && !types.some((t) => matchesType(value, t))) {
+        out.push({
+            path,
+            message: `expected ${types.join(" | ")}, got ${typeOf(value)}`
+        });
+        return;
+    }
+    if (typeOf(value) === "object") {
+        validateObject(value, schema, path, out);
+    }
+    if (Array.isArray(value))
+        validateArray(value, schema, path, out);
+    if (isNumber(value))
+        validateNumber(value, schema, path, out);
+    if (isString(value))
+        validateString(value, schema, path, out);
+    validateCombinators(value, schema, path, out);
+}
+function validateObject(value, schema, path, out) {
+    const required = schema["required"];
+    if (Array.isArray(required)) {
+        for (const key of required) {
+            // Object.hasOwn, not `in`: a required key named `toString` must be
+            // produced by the model, not inherited from the prototype chain.
+            if (isString(key) && !Object.hasOwn(value, key)) {
+                out.push({ path, message: `missing required property "${key}"` });
+            }
+        }
+    }
+    const properties = schema["properties"] ?? {};
+    for (const [key, sub] of Object.entries(properties)) {
+        if (!Object.hasOwn(value, key))
+            continue;
+        if (isObjectLike(sub)) {
+            validate(value[key], sub, `${path}.${key}`, out);
+        }
+    }
+    const additional = schema["additionalProperties"];
+    if (additional === false) {
+        for (const key of Object.keys(value)) {
+            if (!Object.hasOwn(properties, key)) {
+                out.push({ path, message: `unexpected property "${key}"` });
+            }
+        }
+    }
+    else if (isObjectLike(additional)) {
+        for (const [key, entry] of Object.entries(value)) {
+            if (Object.hasOwn(properties, key))
+                continue;
+            validate(entry, additional, `${path}.${key}`, out);
+        }
+    }
+}
+function validateArray(value, schema, path, out) {
+    const items = schema["items"];
+    if (isRecord(items)) {
+        value.forEach((entry, index) => validate(entry, items, `${path}[${index}]`, out));
+    }
+    const min = schema["minItems"];
+    if (isNumber(min) && value.length < min) {
+        out.push({ path, message: `expected at least ${min} items` });
+    }
+    const max = schema["maxItems"];
+    if (isNumber(max) && value.length > max) {
+        out.push({ path, message: `expected at most ${max} items` });
+    }
+}
+function validateNumber(value, schema, path, out) {
+    const min = schema["minimum"];
+    if (isNumber(min) && value < min) {
+        out.push({ path, message: `must be >= ${min}` });
+    }
+    const max = schema["maximum"];
+    if (isNumber(max) && value > max) {
+        out.push({ path, message: `must be <= ${max}` });
+    }
+}
+function validateString(value, schema, path, out) {
+    const min = schema["minLength"];
+    if (isNumber(min) && value.length < min) {
+        out.push({ path, message: `must be at least ${min} characters` });
+    }
+    const max = schema["maxLength"];
+    if (isNumber(max) && value.length > max) {
+        out.push({ path, message: `must be at most ${max} characters` });
+    }
+}
+function validateCombinators(value, schema, path, out) {
+    const allOf = schema["allOf"];
+    if (Array.isArray(allOf)) {
+        for (const sub of allOf) {
+            if (isObjectLike(sub)) {
+                validate(value, sub, path, out);
+            }
+        }
+    }
+    for (const keyword of ["anyOf", "oneOf"]) {
+        const branches = schema[keyword];
+        if (!Array.isArray(branches) || branches.length === 0)
+            continue;
+        // A branch that validates cleanly is the branch the model meant. Reporting
+        // every branch's failures would bury the real error under four irrelevant
+        // ones, so an all-fail reports the closest branch — fewest violations.
+        let closest = null;
+        for (const branch of branches) {
+            if (!isObjectLike(branch))
+                continue;
+            const errors = validateAgainstSchema(value, branch, path);
+            if (errors.length === 0) {
+                closest = null;
+                break;
+            }
+            if (closest === null || errors.length < closest.length)
+                closest = errors;
+        }
+        if (closest)
+            out.push(...closest);
+    }
+}
+/** One-line rendering of violations, for a tool-result bounce. */
+export function formatViolations(violations) {
+    return violations.map((v) => `${v.path}: ${v.message}`).join("; ");
+}
+//# sourceMappingURL=json-schema-validate.js.map

package/dist/utils/json-schema-validate.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"json-schema-validate.js","sourceRoot":"","sources":["../../src/utils/json-schema-validate.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AAEH,OAAO,EACL,SAAS,EACT,QAAQ,EACR,YAAY,EACZ,QAAQ,EACR,QAAQ,EACT,MAAM,kBAAkB,CAAC;AAU1B,MAAM,UAAU,GAAG;IACjB,QAAQ;IACR,QAAQ;IACR,SAAS;IACT,SAAS;IACT,QAAQ;IACR,OAAO;IACP,MAAM;CACE,CAAC;AAIX,6CAA6C;AAC7C,SAAS,UAAU,CAAC,KAAc;IAChC,OAAO,CACL,OAAO,KAAK,KAAK,QAAQ;QACxB,UAAgC,CAAC,QAAQ,CAAC,KAAK,CAAC,CAClD,CAAC;AACJ,CAAC;AAED,SAAS,MAAM,CAAC,KAAc;IAC5B,IAAI,KAAK,KAAK,IAAI;QAAE,OAAO,MAAM,CAAC;IAClC,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC;QAAE,OAAO,OAAO,CAAC;IACzC,IAAI,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC;QACpB,OAAO,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,QAAQ,CAAC;IACxD,CAAC;IACD,IAAI,QAAQ,CAAC,KAAK,CAAC;QAAE,OAAO,QAAQ,CAAC;IACrC,IAAI,SAAS,CAAC,KAAK,CAAC;QAAE,OAAO,SAAS,CAAC;IACvC,OAAO,QAAQ,CAAC;AAClB,CAAC;AAED,SAAS,WAAW,CAAC,KAAc,EAAE,QAAkB;IACrD,MAAM,MAAM,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC;IAC7B,IAAI,QAAQ,KAAK,QAAQ;QAAE,OAAO,MAAM,KAAK,QAAQ,IAAI,MAAM,KAAK,SAAS,CAAC;IAC9E,OAAO,MAAM,KAAK,QAAQ,CAAC;AAC7B,CAAC;AAED,SAAS,SAAS,CAAC,CAAU,EAAE,CAAU;IACvC,IAAI,CAAC,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC;IACzB,IAAI,OAAO,CAAC,KAAK,OAAO,CAAC,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,KAAK,IAAI;QAAE,OAAO,KAAK,CAAC;IACpE,IAAI,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC;QAAE,OAAO,KAAK,CAAC;IACxD,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC;QAAE,OAAO,KAAK,CAAC;IACnC,MAAM,EAAE,GAAG,CAA4B,CAAC;IACxC,MAAM,EAAE,GAAG,CAA4B,CAAC;IACxC,MAAM,KAAK,GAAG,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAC9B,IAAI,KAAK,CAAC,MAAM,KAAK,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,MAAM;QAAE,OAAO,KAAK,CAAC;IAC1D,OAAO,KAAK,CAAC,KAAK,CAChB,CAAC,GAAG,EAAE,EAAE,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,EAAE,GAAG,CAAC,IAAI,SAAS,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,CAC/D,CAAC;AACJ,CAAC;AAED,SAAS,QAAQ,CAAC,KAAc;IAC9B,MAAM,IAAI,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;IAC7D,OAAO,IAAI,KAAK,SAAS,IAAI,IAAI,CAAC,MAAM,GAAG,EAAE;QAC3C,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG;QACzB,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;AACnB,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,qBAAqB,CACnC,KAAc,EACd,MAAc,EACd,IAAI,GAAG,QAAQ;IAEf,MAAM,GAAG,GAAsB,EAAE,CAAC;IAClC,QAAQ,CAAC,KAAK,EAAE,MAAM,EAAE,IAAI,EAAE,GAAG,CAAC,CAAC;IACnC,OAAO,GAAG,CAAC;AACb,CAAC;AAED,SAAS,QAAQ,CACf,KAAc,EACd,MAAc,EACd,IAAY,EACZ,GAAsB;IAEtB,IAAI,MAAM,CAAC,OAAO,CAAC,KAAK,SAAS,IAAI,CAAC,SAAS,CAAC,KAAK,EAAE,MAAM,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC;QACxE,GAAG,CAAC,IAAI,CAAC;YACP,IAAI;YACJ,OAAO,EAAE,cAAc,QAAQ,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,SAAS,QAAQ,CAAC,KAAK,CAAC,EAAE;SAC3E,CAAC,CAAC;QACH,OAAO;IACT,CAAC;IAED,MAAM,UAAU,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC;IAClC,IAAI,KAAK,CAAC,OAAO,CAAC,UAAU,CAAC,EAAE,CAAC;QAC9B,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,SAAS,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC,EAAE,CAAC;YACjE,GAAG,CAAC,IAAI,CAAC;gBACP,IAAI;gBACJ,OAAO,EAAE,kBAAkB,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,QAAQ,CAAC,KAAK,CAAC,EAAE;aACnG,CAAC,CAAC;YACH,OAAO;QACT,CAAC;IACH,CAAC;IAED,MAAM,QAAQ,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC;IAChC,MAAM,KAAK,GAAe,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC;QAC/C,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC,UAAU,CAAC;QAC7B,CAAC,CAAC,UAAU,CAAC,QAAQ,CAAC;YACpB,CAAC,CAAC,CAAC,QAAQ,CAAC;YACZ,CAAC,CAAC,EAAE,CAAC;IACT,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,WAAW,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QAClE,GAAG,CAAC,IAAI,CAAC;YACP,IAAI;YACJ,OAAO,EAAE,YAAY,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,SAAS,MAAM,CAAC,KAAK,CAAC,EAAE;SAC/D,CAAC,CAAC;QACH,OAAO;IACT,CAAC;IAED,IAAI,MAAM,CAAC,KAAK,CAAC,KAAK,QAAQ,EAAE,CAAC;QAC/B,cAAc,CAAC,KAAgC,EAAE,MAAM,EAAE,IAAI,EAAE,GAAG,CAAC,CAAC;IACtE,CAAC;IACD,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC;QAAE,aAAa,CAAC,KAAK,EAAE,MAAM,EAAE,IAAI,EAAE,GAAG,CAAC,CAAC;IAClE,IAAI,QAAQ,CAAC,KAAK,CAAC;QAAE,cAAc,CAAC,KAAK,EAAE,MAAM,EAAE,IAAI,EAAE,GAAG,CAAC,CAAC;IAC9D,IAAI,QAAQ,CAAC,KAAK,CAAC;QAAE,cAAc,CAAC,KAAK,EAAE,MAAM,EAAE,IAAI,EAAE,GAAG,CAAC,CAAC;IAE9D,mBAAmB,CAAC,KAAK,EAAE,MAAM,EAAE,IAAI,EAAE,GAAG,CAAC,CAAC;AAChD,CAAC;AAED,SAAS,cAAc,CACrB,KAA8B,EAC9B,MAAc,EACd,IAAY,EACZ,GAAsB;IAEtB,MAAM,QAAQ,GAAG,MAAM,CAAC,UAAU,CAAC,CAAC;IACpC,IAAI,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAE,CAAC;QAC5B,KAAK,MAAM,GAAG,IAAI,QAAQ,EAAE,CAAC;YAC3B,mEAAmE;YACnE,iEAAiE;YACjE,IAAI,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,EAAE,GAAG,CAAC,EAAE,CAAC;gBAChD,GAAG,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,8BAA8B,GAAG,GAAG,EAAE,CAAC,CAAC;YACpE,CAAC;QACH,CAAC;IACH,CAAC;IAED,MAAM,UAAU,GAAI,MAAM,CAAC,YAAY,CAAwB,IAAI,EAAE,CAAC;IACtE,KAAK,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,UAAU,CAAC,EAAE,CAAC;QACpD,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,EAAE,GAAG,CAAC;YAAE,SAAS;QACzC,IAAI,YAAY,CAAC,GAAG,CAAC,EAAE,CAAC;YACtB,QAAQ,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,GAAG,IAAI,IAAI,GAAG,EAAE,EAAE,GAAG,CAAC,CAAC;QACnD,CAAC;IACH,CAAC;IAED,MAAM,UAAU,GAAG,MAAM,CAAC,sBAAsB,CAAC,CAAC;IAClD,IAAI,UAAU,KAAK,KAAK,EAAE,CAAC;QACzB,KAAK,MAAM,GAAG,IAAI,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;YACrC,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,UAAU,EAAE,GAAG,CAAC,EAAE,CAAC;gBACpC,GAAG,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,wBAAwB,GAAG,GAAG,EAAE,CAAC,CAAC;YAC9D,CAAC;QACH,CAAC;IACH,CAAC;SAAM,IAAI,YAAY,CAAC,UAAU,CAAC,EAAE,CAAC;QACpC,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;YACjD,IAAI,MAAM,CAAC,MAAM,CAAC,UAAU,EAAE,GAAG,CAAC;gBAAE,SAAS;YAC7C,QAAQ,CAAC,KAAK,EAAE,UAAU,EAAE,GAAG,IAAI,IAAI,GAAG,EAAE,EAAE,GAAG,CAAC,CAAC;QACrD,CAAC;IACH,CAAC;AACH,CAAC;AAED,SAAS,aAAa,CACpB,KAAgB,EAChB,MAAc,EACd,IAAY,EACZ,GAAsB;IAEtB,MAAM,KAAK,GAAG,MAAM,CAAC,OAAO,CAAC,CAAC;IAC9B,IAAI,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC;QACpB,KAAK,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,KAAK,EAAE,EAAE,CAC7B,QAAQ,CAAC,KAAK,EAAE,KAAK,EAAE,GAAG,IAAI,IAAI,KAAK,GAAG,EAAE,GAAG,CAAC,CACjD,CAAC;IACJ,CAAC;IACD,MAAM,GAAG,GAAG,MAAM,CAAC,UAAU,CAAC,CAAC;IAC/B,IAAI,QAAQ,CAAC,GAAG,CAAC,IAAI,KAAK,CAAC,MAAM,GAAG,GAAG,EAAE,CAAC;QACxC,GAAG,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,qBAAqB,GAAG,QAAQ,EAAE,CAAC,CAAC;IAChE,CAAC;IACD,MAAM,GAAG,GAAG,MAAM,CAAC,UAAU,CAAC,CAAC;IAC/B,IAAI,QAAQ,CAAC,GAAG,CAAC,IAAI,KAAK,CAAC,MAAM,GAAG,GAAG,EAAE,CAAC;QACxC,GAAG,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,oBAAoB,GAAG,QAAQ,EAAE,CAAC,CAAC;IAC/D,CAAC;AACH,CAAC;AAED,SAAS,cAAc,CACrB,KAAa,EACb,MAAc,EACd,IAAY,EACZ,GAAsB;IAEtB,MAAM,GAAG,GAAG,MAAM,CAAC,SAAS,CAAC,CAAC;IAC9B,IAAI,QAAQ,CAAC,GAAG,CAAC,IAAI,KAAK,GAAG,GAAG,EAAE,CAAC;QACjC,GAAG,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,cAAc,GAAG,EAAE,EAAE,CAAC,CAAC;IACnD,CAAC;IACD,MAAM,GAAG,GAAG,MAAM,CAAC,SAAS,CAAC,CAAC;IAC9B,IAAI,QAAQ,CAAC,GAAG,CAAC,IAAI,KAAK,GAAG,GAAG,EAAE,CAAC;QACjC,GAAG,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,cAAc,GAAG,EAAE,EAAE,CAAC,CAAC;IACnD,CAAC;AACH,CAAC;AAED,SAAS,cAAc,CACrB,KAAa,EACb,MAAc,EACd,IAAY,EACZ,GAAsB;IAEtB,MAAM,GAAG,GAAG,MAAM,CAAC,WAAW,CAAC,CAAC;IAChC,IAAI,QAAQ,CAAC,GAAG,CAAC,IAAI,KAAK,CAAC,MAAM,GAAG,GAAG,EAAE,CAAC;QACxC,GAAG,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,oBAAoB,GAAG,aAAa,EAAE,CAAC,CAAC;IACpE,CAAC;IACD,MAAM,GAAG,GAAG,MAAM,CAAC,WAAW,CAAC,CAAC;IAChC,IAAI,QAAQ,CAAC,GAAG,CAAC,IAAI,KAAK,CAAC,MAAM,GAAG,GAAG,EAAE,CAAC;QACxC,GAAG,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,mBAAmB,GAAG,aAAa,EAAE,CAAC,CAAC;IACnE,CAAC;AACH,CAAC;AAED,SAAS,mBAAmB,CAC1B,KAAc,EACd,MAAc,EACd,IAAY,EACZ,GAAsB;IAEtB,MAAM,KAAK,GAAG,MAAM,CAAC,OAAO,CAAC,CAAC;IAC9B,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;QACzB,KAAK,MAAM,GAAG,IAAI,KAAK,EAAE,CAAC;YACxB,IAAI,YAAY,CAAC,GAAG,CAAC,EAAE,CAAC;gBACtB,QAAQ,CAAC,KAAK,EAAE,GAAG,EAAE,IAAI,EAAE,GAAG,CAAC,CAAC;YAClC,CAAC;QACH,CAAC;IACH,CAAC;IAED,KAAK,MAAM,OAAO,IAAI,CAAC,OAAO,EAAE,OAAO,CAAU,EAAE,CAAC;QAClD,MAAM,QAAQ,GAAG,MAAM,CAAC,OAAO,CAAC,CAAC;QACjC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;YAAE,SAAS;QAChE,2EAA2E;QAC3E,0EAA0E;QAC1E,uEAAuE;QACvE,IAAI,OAAO,GAA6B,IAAI,CAAC;QAC7C,KAAK,MAAM,MAAM,IAAI,QAAQ,EAAE,CAAC;YAC9B,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC;gBAAE,SAAS;YACpC,MAAM,MAAM,GAAG,qBAAqB,CAAC,KAAK,EAAE,MAAM,EAAE,IAAI,CAAC,CAAC;YAC1D,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBACxB,OAAO,GAAG,IAAI,CAAC;gBACf,MAAM;YACR,CAAC;YACD,IAAI,OAAO,KAAK,IAAI,IAAI,MAAM,CAAC,MAAM,GAAG,OAAO,CAAC,MAAM;gBAAE,OAAO,GAAG,MAAM,CAAC;QAC3E,CAAC;QACD,IAAI,OAAO;YAAE,GAAG,CAAC,IAAI,CAAC,GAAG,OAAO,CAAC,CAAC;IACpC,CAAC;AACH,CAAC;AAED,kEAAkE;AAClE,MAAM,UAAU,gBAAgB,CAAC,UAA6B;IAC5D,OAAO,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AACrE,CAAC"}

package/dist/utils/link-abort.d.ts

@@ -0,0 +1,13 @@
+/**
+ * Link an external cancellation signal to a locally-owned AbortController.
+ *
+ * Planners and executors own a private controller they fire for their own
+ * reasons (validation gave up, the step finished). Cancellation from outside —
+ * a user pressing Stop — has to reach that same controller, otherwise the
+ * provider call underneath it keeps running.
+ *
+ * Returns an unlink function; call it when the local controller's work is done
+ * so a long-lived external signal doesn't retain finished executors.
+ */
+export declare function linkAbort(local: AbortController, external?: AbortSignal): () => void;
+//# sourceMappingURL=link-abort.d.ts.map

package/dist/utils/link-abort.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"link-abort.d.ts","sourceRoot":"","sources":["../../src/utils/link-abort.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AACH,wBAAgB,SAAS,CACvB,KAAK,EAAE,eAAe,EACtB,QAAQ,CAAC,EAAE,WAAW,GACrB,MAAM,IAAI,CASZ"}

package/dist/utils/link-abort.js

@@ -0,0 +1,23 @@
+/**
+ * Link an external cancellation signal to a locally-owned AbortController.
+ *
+ * Planners and executors own a private controller they fire for their own
+ * reasons (validation gave up, the step finished). Cancellation from outside —
+ * a user pressing Stop — has to reach that same controller, otherwise the
+ * provider call underneath it keeps running.
+ *
+ * Returns an unlink function; call it when the local controller's work is done
+ * so a long-lived external signal doesn't retain finished executors.
+ */
+export function linkAbort(local, external) {
+    if (!external)
+        return () => { };
+    if (external.aborted) {
+        local.abort();
+        return () => { };
+    }
+    const onAbort = () => local.abort();
+    external.addEventListener("abort", onAbort, { once: true });
+    return () => external.removeEventListener("abort", onAbort);
+}
+//# sourceMappingURL=link-abort.js.map

package/dist/utils/link-abort.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"link-abort.js","sourceRoot":"","sources":["../../src/utils/link-abort.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AACH,MAAM,UAAU,SAAS,CACvB,KAAsB,EACtB,QAAsB;IAEtB,IAAI,CAAC,QAAQ;QAAE,OAAO,GAAG,EAAE,GAAE,CAAC,CAAC;IAC/B,IAAI,QAAQ,CAAC,OAAO,EAAE,CAAC;QACrB,KAAK,CAAC,KAAK,EAAE,CAAC;QACd,OAAO,GAAG,EAAE,GAAE,CAAC,CAAC;IAClB,CAAC;IACD,MAAM,OAAO,GAAG,GAAG,EAAE,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;IACpC,QAAQ,CAAC,gBAAgB,CAAC,OAAO,EAAE,OAAO,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC;IAC5D,OAAO,GAAG,EAAE,CAAC,QAAQ,CAAC,mBAAmB,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;AAC9D,CAAC"}

package/dist/utils/merge-generators.d.ts

@@ -0,0 +1,58 @@
+/**
+ * Bounded merge of async generators.
+ *
+ * Interleaves the output of several generators into one stream. `concurrency`
+ * caps how many run at once — the executors fan out over LLM-driven work, and
+ * an uncapped fan-out over a 200-item discover list opens 200 provider
+ * conversations simultaneously. Script mode has had a semaphore since it
+ * shipped; this is the same bound for the task-plan modes.
+ *
+ * A number bounds *this* merge and nothing else, so nested fan-outs multiply:
+ * eight tasks, each dispatching eight steps, each fanning out over eight items
+ * is 512 provider conversations under a `concurrency` of 8. A {@link Semaphore}
+ * is the run's own permit pool, so passing one bounds every merge that shares
+ * it together. Both may be given: the number caps this merge, the pool caps the
+ * run.
+ *
+ * Generators are lazy: one that has not been started yet has issued no provider
+ * call, so holding it back costs nothing.
+ *
+ * {@link createDynamicMerge} has an open end: generators may be added while the
+ * stream is being consumed, which is what lets the DAG scheduler start a node
+ * the moment its last dependency settles instead of at the end of a barrier
+ * round.
+ */
+import type { Semaphore } from "@nodetool-ai/runtime";
+export interface MergeOptions {
+    /** Maximum generators consumed at once. Defaults to unbounded. */
+    concurrency?: number;
+    /**
+     * Run-level permit pool. A generator holds one permit for as long as it is
+     * consumed, so several merges sharing a pool share one bound rather than
+     * each getting `concurrency` of their own.
+     */
+    semaphore?: Semaphore;
+}
+export interface DynamicMergeOptions extends MergeOptions {
+    /**
+     * Ends the stream when it fires. Every started generator is returned and its
+     * producer task awaited, the same as when a consumer breaks out early.
+     */
+    signal?: AbortSignal;
+}
+export interface DynamicMerge<T> {
+    /**
+     * Queue a generator. It starts as soon as a slot and a permit are free, and
+     * is ignored once the stream has ended.
+     */
+    add(generator: AsyncGenerator<T>): void;
+    /** No more generators will be added; the stream ends once the rest drain. */
+    close(): void;
+    /**
+     * The merged stream. Call once — a second call would consume the same queue.
+     * Nothing starts until it is iterated.
+     */
+    stream(): AsyncGenerator<T>;
+}
+export declare function createDynamicMerge<T>(options?: DynamicMergeOptions): DynamicMerge<T>;
+//# sourceMappingURL=merge-generators.d.ts.map

package/dist/utils/merge-generators.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"merge-generators.d.ts","sourceRoot":"","sources":["../../src/utils/merge-generators.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;GAuBG;AAEH,OAAO,KAAK,EAAW,SAAS,EAAE,MAAM,sBAAsB,CAAC;AAE/D,MAAM,WAAW,YAAY;IAC3B,kEAAkE;IAClE,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB;;;;OAIG;IACH,SAAS,CAAC,EAAE,SAAS,CAAC;CACvB;AAED,MAAM,WAAW,mBAAoB,SAAQ,YAAY;IACvD;;;OAGG;IACH,MAAM,CAAC,EAAE,WAAW,CAAC;CACtB;AAED,MAAM,WAAW,YAAY,CAAC,CAAC;IAC7B;;;OAGG;IACH,GAAG,CAAC,SAAS,EAAE,cAAc,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;IACxC,6EAA6E;IAC7E,KAAK,IAAI,IAAI,CAAC;IACd;;;OAGG;IACH,MAAM,IAAI,cAAc,CAAC,CAAC,CAAC,CAAC;CAC7B;AAED,wBAAgB,kBAAkB,CAAC,CAAC,EAClC,OAAO,GAAE,mBAAwB,GAChC,YAAY,CAAC,CAAC,CAAC,CA8HjB"}

package/dist/utils/merge-generators.js

@@ -0,0 +1,148 @@
+/**
+ * Bounded merge of async generators.
+ *
+ * Interleaves the output of several generators into one stream. `concurrency`
+ * caps how many run at once — the executors fan out over LLM-driven work, and
+ * an uncapped fan-out over a 200-item discover list opens 200 provider
+ * conversations simultaneously. Script mode has had a semaphore since it
+ * shipped; this is the same bound for the task-plan modes.
+ *
+ * A number bounds *this* merge and nothing else, so nested fan-outs multiply:
+ * eight tasks, each dispatching eight steps, each fanning out over eight items
+ * is 512 provider conversations under a `concurrency` of 8. A {@link Semaphore}
+ * is the run's own permit pool, so passing one bounds every merge that shares
+ * it together. Both may be given: the number caps this merge, the pool caps the
+ * run.
+ *
+ * Generators are lazy: one that has not been started yet has issued no provider
+ * call, so holding it back costs nothing.
+ *
+ * {@link createDynamicMerge} has an open end: generators may be added while the
+ * stream is being consumed, which is what lets the DAG scheduler start a node
+ * the moment its last dependency settles instead of at the end of a barrier
+ * round.
+ */
+export function createDynamicMerge(options = {}) {
+    const limit = options.concurrency && options.concurrency > 0
+        ? options.concurrency
+        : Number.POSITIVE_INFINITY;
+    const pending = [];
+    const queue = [];
+    /** Generators that were actually started — only those need `.return()`. */
+    const started = [];
+    const tasks = [];
+    let resolve = null;
+    let firstError = undefined;
+    let hasError = false;
+    /** Index into `pending`, not a shift, so a long queue stays O(1) per start. */
+    let nextIndex = 0;
+    let activeCount = 0;
+    let closed = false;
+    /** The stream has ended (consumer break, abort, or drained): admit nothing. */
+    let stopped = false;
+    function notify() {
+        if (resolve) {
+            const r = resolve;
+            resolve = null;
+            r();
+        }
+    }
+    function pump() {
+        while (!stopped && activeCount < limit && nextIndex < pending.length) {
+            const gen = pending[nextIndex++];
+            started.push(gen);
+            activeCount++;
+            tasks.push((async () => {
+                // A generator waiting for a permit still occupies its numeric slot:
+                // admitting another in its place would let `concurrency` generators
+                // run *and* a queue of them wait, which is not the bound the caller
+                // asked for.
+                let release = null;
+                try {
+                    if (options.semaphore)
+                        release = await options.semaphore.acquire();
+                    for await (const item of gen) {
+                        queue.push(item);
+                        notify();
+                    }
+                }
+                catch (e) {
+                    if (!hasError) {
+                        hasError = true;
+                        firstError = e;
+                    }
+                }
+                finally {
+                    release?.();
+                    activeCount--;
+                    // A finished slot admits the next generator.
+                    pump();
+                    notify();
+                }
+            })());
+        }
+    }
+    async function* stream() {
+        if (options.signal?.aborted)
+            stopped = true;
+        const onAbort = () => {
+            stopped = true;
+            notify();
+        };
+        options.signal?.addEventListener("abort", onAbort, { once: true });
+        // The try/finally guarantees that if the downstream consumer stops early
+        // (its `for await` breaks or throws, which injects `.return()` into this
+        // generator), the child generators terminate instead of leaving the
+        // producer tasks driving them to completion in the background (e.g. LLM
+        // calls firing after cancellation).
+        try {
+            while (!stopped) {
+                if (queue.length > 0) {
+                    yield queue.shift();
+                    continue;
+                }
+                if (closed && activeCount === 0 && nextIndex >= pending.length)
+                    break;
+                // Set resolve BEFORE re-checking the queue to avoid a race where an
+                // item is pushed between the check and the await.
+                const waitPromise = new Promise((r) => {
+                    resolve = r;
+                });
+                if (queue.length > 0 || stopped) {
+                    resolve = null;
+                    continue;
+                }
+                await waitPromise;
+            }
+        }
+        finally {
+            // Stop every started generator so its producer `for await` loop
+            // terminates (a generator may already be done — allSettled swallows
+            // those), then let the producer promises settle. Never-started
+            // generators are left alone.
+            stopped = true;
+            options.signal?.removeEventListener("abort", onAbort);
+            await Promise.allSettled(started.map((gen) => gen.return(undefined)));
+            await Promise.allSettled(tasks);
+        }
+        if (hasError) {
+            throw firstError instanceof Error
+                ? firstError
+                : new Error(String(firstError));
+        }
+    }
+    return {
+        add(generator) {
+            if (stopped)
+                return;
+            pending.push(generator);
+            pump();
+        },
+        close() {
+            closed = true;
+            notify();
+        },
+        stream
+    };
+}
+//# sourceMappingURL=merge-generators.js.map

package/dist/utils/merge-generators.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"merge-generators.js","sourceRoot":"","sources":["../../src/utils/merge-generators.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;GAuBG;AAsCH,MAAM,UAAU,kBAAkB,CAChC,OAAO,GAAwB,EAAE;IAEjC,MAAM,KAAK,GACT,OAAO,CAAC,WAAW,IAAI,OAAO,CAAC,WAAW,GAAG,CAAC;QAC5C,CAAC,CAAC,OAAO,CAAC,WAAW;QACrB,CAAC,CAAC,MAAM,CAAC,iBAAiB,CAAC;IAE/B,MAAM,OAAO,GAAwB,EAAE,CAAC;IACxC,MAAM,KAAK,GAAQ,EAAE,CAAC;IACtB,2EAA2E;IAC3E,MAAM,OAAO,GAAwB,EAAE,CAAC;IACxC,MAAM,KAAK,GAAoB,EAAE,CAAC;IAElC,IAAI,OAAO,GAAwB,IAAI,CAAC;IACxC,IAAI,UAAU,GAAY,SAAS,CAAC;IACpC,IAAI,QAAQ,GAAG,KAAK,CAAC;IACrB,+EAA+E;IAC/E,IAAI,SAAS,GAAG,CAAC,CAAC;IAClB,IAAI,WAAW,GAAG,CAAC,CAAC;IACpB,IAAI,MAAM,GAAG,KAAK,CAAC;IACnB,+EAA+E;IAC/E,IAAI,OAAO,GAAG,KAAK,CAAC;IAEpB,SAAS,MAAM;QACb,IAAI,OAAO,EAAE,CAAC;YACZ,MAAM,CAAC,GAAG,OAAO,CAAC;YAClB,OAAO,GAAG,IAAI,CAAC;YACf,CAAC,EAAE,CAAC;QACN,CAAC;IACH,CAAC;IAED,SAAS,IAAI;QACX,OAAO,CAAC,OAAO,IAAI,WAAW,GAAG,KAAK,IAAI,SAAS,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC;YACrE,MAAM,GAAG,GAAG,OAAO,CAAC,SAAS,EAAE,CAAC,CAAC;YACjC,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YAClB,WAAW,EAAE,CAAC;YACd,KAAK,CAAC,IAAI,CACR,CAAC,KAAK,IAAI,EAAE;gBACV,oEAAoE;gBACpE,oEAAoE;gBACpE,oEAAoE;gBACpE,aAAa;gBACb,IAAI,OAAO,GAAmB,IAAI,CAAC;gBACnC,IAAI,CAAC;oBACH,IAAI,OAAO,CAAC,SAAS;wBAAE,OAAO,GAAG,MAAM,OAAO,CAAC,SAAS,CAAC,OAAO,EAAE,CAAC;oBACnE,IAAI,KAAK,EAAE,MAAM,IAAI,IAAI,GAAG,EAAE,CAAC;wBAC7B,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;wBACjB,MAAM,EAAE,CAAC;oBACX,CAAC;gBACH,CAAC;gBAAC,OAAO,CAAC,EAAE,CAAC;oBACX,IAAI,CAAC,QAAQ,EAAE,CAAC;wBACd,QAAQ,GAAG,IAAI,CAAC;wBAChB,UAAU,GAAG,CAAC,CAAC;oBACjB,CAAC;gBACH,CAAC;wBAAS,CAAC;oBACT,OAAO,EAAE,EAAE,CAAC;oBACZ,WAAW,EAAE,CAAC;oBACd,6CAA6C;oBAC7C,IAAI,EAAE,CAAC;oBACP,MAAM,EAAE,CAAC;gBACX,CAAC;YACH,CAAC,CAAC,EAAE,CACL,CAAC;QACJ,CAAC;IACH,CAAC;IAED,KAAK,SAAS,CAAC,CAAC,MAAM;QACpB,IAAI,OAAO,CAAC,MAAM,EAAE,OAAO;YAAE,OAAO,GAAG,IAAI,CAAC;QAC5C,MAAM,OAAO,GAAG,GAAS,EAAE;YACzB,OAAO,GAAG,IAAI,CAAC;YACf,MAAM,EAAE,CAAC;QACX,CAAC,CAAC;QACF,OAAO,CAAC,MAAM,EAAE,gBAAgB,CAAC,OAAO,EAAE,OAAO,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC;QAEnE,yEAAyE;QACzE,yEAAyE;QACzE,oEAAoE;QACpE,wEAAwE;QACxE,oCAAoC;QACpC,IAAI,CAAC;YACH,OAAO,CAAC,OAAO,EAAE,CAAC;gBAChB,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;oBACrB,MAAM,KAAK,CAAC,KAAK,EAAG,CAAC;oBACrB,SAAS;gBACX,CAAC;gBACD,IAAI,MAAM,IAAI,WAAW,KAAK,CAAC,IAAI,SAAS,IAAI,OAAO,CAAC,MAAM;oBAAE,MAAM;gBACtE,oEAAoE;gBACpE,kDAAkD;gBAClD,MAAM,WAAW,GAAG,IAAI,OAAO,CAAO,CAAC,CAAC,EAAE,EAAE;oBAC1C,OAAO,GAAG,CAAC,CAAC;gBACd,CAAC,CAAC,CAAC;gBACH,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,IAAI,OAAO,EAAE,CAAC;oBAChC,OAAO,GAAG,IAAI,CAAC;oBACf,SAAS;gBACX,CAAC;gBACD,MAAM,WAAW,CAAC;YACpB,CAAC;QACH,CAAC;gBAAS,CAAC;YACT,gEAAgE;YAChE,oEAAoE;YACpE,+DAA+D;YAC/D,6BAA6B;YAC7B,OAAO,GAAG,IAAI,CAAC;YACf,OAAO,CAAC,MAAM,EAAE,mBAAmB,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;YACtD,MAAM,OAAO,CAAC,UAAU,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;YACtE,MAAM,OAAO,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;QAClC,CAAC;QAED,IAAI,QAAQ,EAAE,CAAC;YACb,MAAM,UAAU,YAAY,KAAK;gBAC/B,CAAC,CAAC,UAAU;gBACZ,CAAC,CAAC,IAAI,KAAK,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC;QACpC,CAAC;IACH,CAAC;IAED,OAAO;QACL,GAAG,CAAC,SAA4B;YAC9B,IAAI,OAAO;gBAAE,OAAO;YACpB,OAAO,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;YACxB,IAAI,EAAE,CAAC;QACT,CAAC;QACD,KAAK;YACH,MAAM,GAAG,IAAI,CAAC;YACd,MAAM,EAAE,CAAC;QACX,CAAC;QACD,MAAM;KACP,CAAC;AACJ,CAAC"}

package/dist/utils/remove-base64-images.d.ts

@@ -1,8 +1,3 @@
-/**
- * removeBase64Images — T-AG-7.
- *
- * Strips image content blocks where the data is base64-encoded.
- */
 import type { MessageContent } from "@nodetool-ai/runtime";
 /**
  * Remove base64 image content blocks from a message content array.

package/dist/utils/remove-base64-images.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"remove-base64-images.d.ts","sourceRoot":"","sources":["../../src/utils/remove-base64-images.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AACH,OAAO,KAAK,EAAE,cAAc,EAAuB,MAAM,sBAAsB,CAAC;AAShF;;;GAGG;AACH,wBAAgB,kBAAkB,CAChC,OAAO,EAAE,cAAc,EAAE,GACxB,cAAc,EAAE,CAKlB"}
+{"version":3,"file":"remove-base64-images.d.ts","sourceRoot":"","sources":["../../src/utils/remove-base64-images.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,cAAc,EAAuB,MAAM,sBAAsB,CAAC;AAShF;;;GAGG;AACH,wBAAgB,kBAAkB,CAChC,OAAO,EAAE,cAAc,EAAE,GACxB,cAAc,EAAE,CAKlB"}

package/dist/utils/remove-base64-images.js.map

@@ -1 +1 @@
-{"version":3,"file":"remove-base64-images.js","sourceRoot":"","sources":["../../src/utils/remove-base64-images.ts"],"names":[],"mappings":"AAOA,SAAS,aAAa,CAAC,OAA4B;IACjD,MAAM,EAAE,GAAG,EAAE,IAAI,EAAE,GAAG,OAAO,CAAC,KAAK,CAAC;IACpC,IAAI,GAAG,IAAI,GAAG,CAAC,UAAU,CAAC,aAAa,CAAC;QAAE,OAAO,IAAI,CAAC;IACtD,IAAI,IAAI,IAAI,IAAI;QAAE,OAAO,IAAI,CAAC;IAC9B,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,kBAAkB,CAChC,OAAyB;IAEzB,OAAO,OAAO,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE;QAC7B,IAAI,IAAI,CAAC,IAAI,KAAK,WAAW;YAAE,OAAO,IAAI,CAAC;QAC3C,OAAO,CAAC,aAAa,CAAC,IAA2B,CAAC,CAAC;IACrD,CAAC,CAAC,CAAC;AACL,CAAC"}
+{"version":3,"file":"remove-base64-images.js","sourceRoot":"","sources":["../../src/utils/remove-base64-images.ts"],"names":[],"mappings":"AAEA,SAAS,aAAa,CAAC,OAA4B;IACjD,MAAM,EAAE,GAAG,EAAE,IAAI,EAAE,GAAG,OAAO,CAAC,KAAK,CAAC;IACpC,IAAI,GAAG,IAAI,GAAG,CAAC,UAAU,CAAC,aAAa,CAAC;QAAE,OAAO,IAAI,CAAC;IACtD,IAAI,IAAI,IAAI,IAAI;QAAE,OAAO,IAAI,CAAC;IAC9B,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,kBAAkB,CAChC,OAAyB;IAEzB,OAAO,OAAO,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE;QAC7B,IAAI,IAAI,CAAC,IAAI,KAAK,WAAW;YAAE,OAAO,IAAI,CAAC;QAC3C,OAAO,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC;IAC9B,CAAC,CAAC,CAAC;AACL,CAAC"}

package/dist/utils/step-failure.d.ts

@@ -0,0 +1,20 @@
+/**
+ * Wording for the terminal state of a step that never produced a result.
+ *
+ * A step can end for reasons that need different answers from whoever reads
+ * the error: the provider threw, the iteration budget ran out, or the model
+ * simply stopped talking without calling the finishing tool. Reporting them
+ * all as "exceeded N iterations" sent debuggers after an iteration budget that
+ * was never touched, so the last case carries what the model actually said
+ * instead.
+ */
+import type { Message } from "@nodetool-ai/runtime";
+/** How much of the model's last message rides along in a failure message. */
+export declare const PROSE_HINT_MAX_CHARS = 200;
+/**
+ * A short quote of the model's last message, ready to append to a failure
+ * message. Empty when the model said nothing quotable, so the caller can
+ * concatenate it unconditionally.
+ */
+export declare function lastProseHint(message: Message | null): string;
+//# sourceMappingURL=step-failure.d.ts.map

package/dist/utils/step-failure.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"step-failure.d.ts","sourceRoot":"","sources":["../../src/utils/step-failure.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAEH,OAAO,KAAK,EAAE,OAAO,EAAE,MAAM,sBAAsB,CAAC;AAGpD,6EAA6E;AAC7E,eAAO,MAAM,oBAAoB,MAAM,CAAC;AAgBxC;;;;GAIG;AACH,wBAAgB,aAAa,CAAC,OAAO,EAAE,OAAO,GAAG,IAAI,GAAG,MAAM,CAQ7D"}

package/dist/utils/step-failure.js

@@ -0,0 +1,43 @@
+/**
+ * Wording for the terminal state of a step that never produced a result.
+ *
+ * A step can end for reasons that need different answers from whoever reads
+ * the error: the provider threw, the iteration budget ran out, or the model
+ * simply stopped talking without calling the finishing tool. Reporting them
+ * all as "exceeded N iterations" sent debuggers after an iteration budget that
+ * was never touched, so the last case carries what the model actually said
+ * instead.
+ */
+import { isString } from "./type-guards.js";
+/** How much of the model's last message rides along in a failure message. */
+export const PROSE_HINT_MAX_CHARS = 200;
+/** The plain text of an assistant message, across both content shapes. */
+function messageText(message) {
+    if (!message)
+        return "";
+    const content = message.content;
+    if (isString(content))
+        return content.trim();
+    if (Array.isArray(content)) {
+        return content
+            .map((part) => (part.type === "text" ? part.text : ""))
+            .join("")
+            .trim();
+    }
+    return "";
+}
+/**
+ * A short quote of the model's last message, ready to append to a failure
+ * message. Empty when the model said nothing quotable, so the caller can
+ * concatenate it unconditionally.
+ */
+export function lastProseHint(message) {
+    const text = messageText(message);
+    if (text === "")
+        return "";
+    const quote = text.length > PROSE_HINT_MAX_CHARS
+        ? `${text.slice(0, PROSE_HINT_MAX_CHARS)}…`
+        : text;
+    return ` Last message: "${quote}"`;
+}
+//# sourceMappingURL=step-failure.js.map

package/dist/utils/step-failure.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"step-failure.js","sourceRoot":"","sources":["../../src/utils/step-failure.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAGH,OAAO,EAAE,QAAQ,EAAE,MAAM,kBAAkB,CAAC;AAE5C,6EAA6E;AAC7E,MAAM,CAAC,MAAM,oBAAoB,GAAG,GAAG,CAAC;AAExC,0EAA0E;AAC1E,SAAS,WAAW,CAAC,OAAuB;IAC1C,IAAI,CAAC,OAAO;QAAE,OAAO,EAAE,CAAC;IACxB,MAAM,OAAO,GAAG,OAAO,CAAC,OAAO,CAAC;IAChC,IAAI,QAAQ,CAAC,OAAO,CAAC;QAAE,OAAO,OAAO,CAAC,IAAI,EAAE,CAAC;IAC7C,IAAI,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,EAAE,CAAC;QAC3B,OAAO,OAAO;aACX,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,KAAK,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;aACtD,IAAI,CAAC,EAAE,CAAC;aACR,IAAI,EAAE,CAAC;IACZ,CAAC;IACD,OAAO,EAAE,CAAC;AACZ,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,aAAa,CAAC,OAAuB;IACnD,MAAM,IAAI,GAAG,WAAW,CAAC,OAAO,CAAC,CAAC;IAClC,IAAI,IAAI,KAAK,EAAE;QAAE,OAAO,EAAE,CAAC;IAC3B,MAAM,KAAK,GACT,IAAI,CAAC,MAAM,GAAG,oBAAoB;QAChC,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,oBAAoB,CAAC,GAAG;QAC3C,CAAC,CAAC,IAAI,CAAC;IACX,OAAO,mBAAmB,KAAK,GAAG,CAAC;AACrC,CAAC"}

package/dist/utils/think-tags.d.ts

@@ -0,0 +1,16 @@
+/**
+ * Reasoning-block removal, shared by every step loop.
+ *
+ * Some providers emit their scratchpad inline in the assistant text. It is not
+ * part of the answer, so it must not reach a step result, agent memory, or the
+ * user.
+ */
+/**
+ * Strip well-formed PAIRED reasoning blocks from assistant text.
+ *
+ * Only matched pairs are removed (non-greedy). An open-ended pattern would
+ * delete everything after the first literal "<think>", truncating an answer
+ * that merely mentions the substring.
+ */
+export declare function removeThinkTags(text: string | null | undefined): string;
+//# sourceMappingURL=think-tags.d.ts.map

package/dist/utils/think-tags.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"think-tags.d.ts","sourceRoot":"","sources":["../../src/utils/think-tags.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH;;;;;;GAMG;AACH,wBAAgB,eAAe,CAAC,IAAI,EAAE,MAAM,GAAG,IAAI,GAAG,SAAS,GAAG,MAAM,CAMvE"}

package/dist/utils/think-tags.js

@@ -0,0 +1,23 @@
+/**
+ * Reasoning-block removal, shared by every step loop.
+ *
+ * Some providers emit their scratchpad inline in the assistant text. It is not
+ * part of the answer, so it must not reach a step result, agent memory, or the
+ * user.
+ */
+/**
+ * Strip well-formed PAIRED reasoning blocks from assistant text.
+ *
+ * Only matched pairs are removed (non-greedy). An open-ended pattern would
+ * delete everything after the first literal "<think>", truncating an answer
+ * that merely mentions the substring.
+ */
+export function removeThinkTags(text) {
+    if (!text)
+        return "";
+    return text
+        .replace(/<think>[\s\S]*?<\/think>/g, "")
+        .replace(/<redacted_thinking>[\s\S]*?<\/redacted_thinking>/g, "")
+        .trim();
+}
+//# sourceMappingURL=think-tags.js.map