@nhtio/adk 1.20260607.2 → 1.20260609.0

package/batteries/tools/math.mjs

@@ -1,6 +1,6 @@
-import { o as isError, s as isInstanceOf } from "../../tool_registry-D1pSSlsd.mjs";
-import { t as Tool } from "../../tool-CMhaDRNd.mjs";
-import "../../common-BT0nfCi9.mjs";
+import { o as isError, s as isInstanceOf } from "../../tool_registry-791Vrjtf.mjs";
+import { t as Tool } from "../../tool-wMYMVl60.mjs";
+import "../../common-DYDUi99O.mjs";
 import "../../guards.mjs";
 import { validator } from "@nhtio/validation";
 import { all, create } from "mathjs";
@@ -80,12 +80,12 @@ function evaluateLatex(latex) {
 	expr = expr.replace(/\\arccos/g, "acos");
 	expr = expr.replace(/\\arctan/g, "atan");
 	expr = expr.replace(/\\(sin|cos|tan|cot|sec|csc|sinh|cosh|tanh|ln|log|exp|abs|det)/g, "$1");
-	expr = expr.replace(/log_\{?(\w+)\}?\(/g, (_, base) => {
+	expr = expr.replace(/log_\{?(\w+)\}?\(((?:[^()]|\([^()]*\))*)\)/g, (_, base, arg) => {
 		const baseLower = base.toLowerCase();
-		if (baseLower === "10") return "log10(";
-		if (baseLower === "2") return "log2(";
-		if (baseLower === "e") return "ln(";
-		return `ln(/ln(${base})`;
+		if (baseLower === "10") return `log10(${arg})`;
+		if (baseLower === "2") return `log2(${arg})`;
+		if (baseLower === "e") return `ln(${arg})`;
+		return `(ln(${arg})/ln(${base}))`;
 	});
 	expr = expr.replace(/_\{[^}]*\}/g, "");
 	expr = expr.replace(/_\w/g, "");
@@ -105,6 +105,7 @@ function evaluateLatex(latex) {
 	expr = expr.replace(/\\quad/g, " ");
 	expr = expr.replace(/\\qquad/g, " ");
 	expr = expr.replace(/\\text\{([^{}]*)\}/g, "");
+	expr = expr.replace(/(\d(?:\.\d+)?)[eE]([+-]?\d+)/g, "($1*10^($2))");
 	expr = expr.replace(/(\d)([a-zA-Z(])/g, "$1*$2");
 	expr = expr.replace(/\)\s*\(/g, ")*(");
 	expr = expr.replace(/\s+/g, " ").trim();
@@ -399,6 +400,7 @@ var calculateTool = new Tool({
 		if (lengthError) return lengthError;
 		try {
 			const result = math.evaluate(expression);
+			if (typeof result === "number" && !Number.isFinite(result)) return `Error: result is not finite (${result}) — the value overflows JavaScript's numeric range.`;
 			return `Result: ${result}\nKaTeX: $${math.parse(expression).toTex()} = ${result}$`;
 		} catch (err) {
 			return `Error: ${isError(err) ? err.message : String(err)}`;

package/batteries/tools/math.mjs.map

@@ -1 +1 @@
-{"version":3,"file":"math.mjs","names":[],"sources":["../../../src/batteries/tools/math/index.ts"],"sourcesContent":["/**\n * Pre-constructed tools for safe arithmetic, expression evaluation, and numeric operations.\n *\n * @module @nhtio/adk/batteries/tools/math\n *\n * @remarks\n * Pre-constructed bundled tools for the `math` category. Import individually, the whole\n * category, or import every tool via `@nhtio/adk/batteries`.\n */\n\nimport { create, all } from 'mathjs'\nimport { Tool } from '@nhtio/adk/common'\nimport { validator } from '@nhtio/validation'\nimport { default as evaluatex } from 'evaluatex'\nimport { isError, isInstanceOf } from '@nhtio/adk/guards'\n\nconst math = create(all)\n\nconst BLOCKED_FUNCTIONS = [\n  'import',\n  'createUnit',\n  'simplify',\n  'derivative',\n  'compile',\n  'chain',\n  'reviver',\n  'replacer',\n]\n\nfor (const fn of BLOCKED_FUNCTIONS) {\n  if (fn in math) {\n    ;(math as any)[fn] = undefined\n  }\n}\n\nconst MAX_EXPRESSION_LENGTH = 1000\n\nfunction validateExpression(expr: string): string | undefined {\n  if (expr.length > MAX_EXPRESSION_LENGTH) {\n    return `Expression too long (max ${MAX_EXPRESSION_LENGTH} characters).`\n  }\n  return undefined\n}\n\n/**\n * EvaluateX scope providing constants and function aliases that evaluatex does not ship\n * out-of-the-box, matching the capabilities that were previously provided by the mathjs\n * translation layer.\n */\nconst EVALUATEX_SCOPE: Record<string, unknown> = {\n  // Mathematical constants\n  pi: Math.PI,\n  e: Math.E,\n  infinity: Infinity,\n  // Greek letters as named constants (matching LaTeX macro names)\n  alpha: undefined,\n  beta: undefined,\n  gamma: undefined,\n  delta: undefined,\n  epsilon: undefined,\n  theta: undefined,\n  lambda: undefined,\n  mu: undefined,\n  sigma: undefined,\n  tau: undefined,\n  phi: undefined,\n  omega: undefined,\n  // Function aliases — evaluatex uses log for natural log; provide ln as alias,\n  // plus common log bases and nthRoot for \\sqrt[n]{...}.\n  ln: Math.log,\n  log10: (x: number) => Math.log(x) / Math.LN10,\n  log2: (x: number) => Math.log(x) / Math.LN2,\n  nthRoot: (x: number, n: number) => Math.pow(x, 1 / n),\n  // Determinant (identity for scalars — det([a,b;c,d]) is not supported in the scalar path)\n  det: (x: number) => x,\n}\n\n/**\n * Translate a LaTeX/KaTeX expression to evaluatex-compatible syntax and evaluate it.\n *\n * The translation is a lightweight pass over the LaTeX source that handles common constructs\n * (frac, sqrt, trig, Greek macros, delimiters, etc.) and feeds the result to evaluatex with\n * a pre-built scope providing constants and function aliases. This replaces the previous\n * hand-rolled regex → mathjs pipeline.\n */\nfunction evaluateLatex(latex: string): number {\n  let expr = latex.trim()\n\n  // Strip display/inline math delimiters: $$...$$ or $...$\n  expr = expr.replace(/^\\$\\$?|\\$\\$?$/g, '')\n  // Strip \\[ ... \\] or \\( ... \\) delimiters\n  expr = expr.replace(/^\\\\[[(]|\\\\[\\])]$/g, '')\n\n  // ---- LaTeX command translation ----\n\n  // \\frac{a}{b} → (a)/(b) — iterates to handle nested fractions\n  for (let i = 0; i < 20; i++) {\n    const before = expr\n    expr = expr.replace(/\\\\frac\\s*\\{([^}]*)\\}\\s*\\{([^}]*)\\}/g, '($1)/($2)')\n    if (expr === before) break\n  }\n\n  // \\sqrt[n]{x} → nthRoot(x, n)\n  expr = expr.replace(/\\\\sqrt\\[([^\\]]+)\\]\\s*\\{([^}]*)\\}/g, 'nthRoot($2, $1)')\n  // \\sqrt{x} → sqrt(x)\n  expr = expr.replace(/\\\\sqrt\\s*\\{([^}]*)\\}/g, 'sqrt($1)')\n\n  // Inverse trig: \\arcsin → asin (evaluatex uses asin/acos/atan natively)\n  expr = expr.replace(/\\\\arcsin/g, 'asin')\n  expr = expr.replace(/\\\\arccos/g, 'acos')\n  expr = expr.replace(/\\\\arctan/g, 'atan')\n\n  // Strip backslash from known function macros: \\sin, \\cos, \\tan, \\cot, \\sec, \\csc,\n  // \\sinh, \\cosh, \\tanh, \\ln, \\log, \\exp, \\abs, etc.\n  expr = expr.replace(/\\\\(sin|cos|tan|cot|sec|csc|sinh|cosh|tanh|ln|log|exp|abs|det)/g, '$1')\n\n  // Subscript-based log: \\log_2(x) → log2(x), or just strip subscript for single-arg\n  expr = expr.replace(/log_\\{?(\\w+)\\}?\\(/g, (_, base) => {\n    const baseLower = base.toLowerCase()\n    if (baseLower === '10') return 'log10('\n    if (baseLower === '2') return 'log2('\n    if (baseLower === 'e') return 'ln('\n    // Generic base: convert log_b(x) to ln(x)/ln(b) — evaluatex handles the\n    // resulting expression fine.\n    return `ln(/ln(${base})`\n  })\n  // Strip any remaining subscripts (e.g. x_1, a_n)\n  expr = expr.replace(/_\\{[^}]*\\}/g, '')\n  expr = expr.replace(/_\\w/g, '')\n\n  // Powers: ^{...} → ^(...)\n  expr = expr.replace(/\\^{([^{}]*)}/g, '^($1)')\n\n  // Greek letter macros\n  expr = expr.replace(/\\\\pi/g, 'pi')\n  expr = expr.replace(\n    /\\\\(alpha|beta|gamma|delta|epsilon|theta|lambda|mu|sigma|tau|phi|omega)/g,\n    '$1'\n  )\n\n  // Spacing and operators\n  expr = expr.replace(/\\\\cdot/g, '*')\n  expr = expr.replace(/\\\\times/g, '*')\n  expr = expr.replace(/\\\\div/g, '/')\n  expr = expr.replace(/\\\\infty/g, 'infinity')\n  expr = expr.replace(/\\\\left\\s*([([{|])/g, '$1')\n  expr = expr.replace(/\\\\right\\s*([)\\]}|])/g, '$1')\n  expr = expr.replace(/\\\\sum/g, 'sum')\n  expr = expr.replace(/\\\\prod/g, 'prod')\n  expr = expr.replace(/\\\\,/g, ' ')\n  expr = expr.replace(/\\\\;/g, ' ')\n  expr = expr.replace(/\\\\quad/g, ' ')\n  expr = expr.replace(/\\\\qquad/g, ' ')\n  // Strip \\text{...} blocks entirely\n  expr = expr.replace(/\\\\text\\{([^{}]*)\\}/g, '')\n\n  // Implicit multiplication: 2x, 3(x+1), etc.\n  expr = expr.replace(/(\\d)([a-zA-Z(])/g, '$1*$2')\n  expr = expr.replace(/\\)\\s*\\(/g, ')*(')\n\n  // Collapse whitespace\n  expr = expr.replace(/\\s+/g, ' ').trim()\n\n  const fn = evaluatex(expr, EVALUATEX_SCOPE)\n  const result = fn()\n  if (typeof result !== 'number' || !Number.isFinite(result)) {\n    throw new Error('Result is not finite')\n  }\n  return result\n}\n\n/**\n * Lightweight LaTeX-to-string translator for internal use by the numeric calculus path.\n *\n * This is the same translation pass as {@link evaluateLatex}, but returns the translated string\n * (compatible with mathjs syntax) rather than evaluating it. Used by the calculus handlers to\n * convert integrands, function bodies, and bound expressions before passing them to\n * `math.evaluate` for specific-point evaluation.\n */\nfunction translateLatex(latex: string): string {\n  let expr = latex.trim()\n  expr = expr.replace(/^\\$\\$?|\\$\\$?$/g, '')\n  expr = expr.replace(/^\\\\[[(]|\\\\[\\])]$/g, '')\n\n  for (let i = 0; i < 20; i++) {\n    const before = expr\n    expr = expr.replace(/\\\\frac\\s*\\{([^}]*)\\}\\s*\\{([^}]*)\\}/g, '($1)/($2)')\n    if (expr === before) break\n  }\n\n  expr = expr.replace(/\\\\sqrt\\[([^\\]]+)\\]\\s*\\{([^}]*)\\}/g, 'nthRoot($2, $1)')\n  expr = expr.replace(/\\\\sqrt\\s*\\{([^}]*)\\}/g, 'sqrt($1)')\n\n  expr = expr.replace(/\\\\arcsin/g, 'asin')\n  expr = expr.replace(/\\\\arccos/g, 'acos')\n  expr = expr.replace(/\\\\arctan/g, 'atan')\n\n  expr = expr.replace(/\\\\(sin|cos|tan|cot|sec|csc|sinh|cosh|tanh|ln|log|exp|abs|det)/g, '$1')\n\n  expr = expr.replace(/log_\\{?(\\w+)\\}?\\s*\\(([^)]+)\\)/g, 'log($2, $1)')\n  expr = expr.replace(/\\^{([^{}]*)}/g, '^($1)')\n  expr = expr.replace(/_\\{[^{}]*\\}/g, '')\n  expr = expr.replace(/_\\w/g, '')\n\n  expr = expr.replace(/\\\\pi/g, 'pi')\n  expr = expr.replace(\n    /\\\\(alpha|beta|gamma|delta|epsilon|theta|lambda|mu|sigma|tau|phi|omega)/g,\n    '$1'\n  )\n\n  expr = expr.replace(/\\\\cdot/g, '*')\n  expr = expr.replace(/\\\\times/g, '*')\n  expr = expr.replace(/\\\\div/g, '/')\n  expr = expr.replace(/\\\\infty/g, 'Infinity')\n  expr = expr.replace(/\\\\left\\s*([([{|])/g, '$1')\n  expr = expr.replace(/\\\\right\\s*([)\\]}|])/g, '$1')\n  expr = expr.replace(/\\\\sum/g, 'sum')\n  expr = expr.replace(/\\\\prod/g, 'prod')\n  expr = expr.replace(/\\\\,/g, ' ')\n  expr = expr.replace(/\\\\;/g, ' ')\n  expr = expr.replace(/\\\\quad/g, ' ')\n  expr = expr.replace(/\\\\qquad/g, ' ')\n  expr = expr.replace(/\\\\text\\{([^{}]*)\\}/g, '')\n  expr = expr.replace(/(\\d)([a-zA-Z(])/g, '$1*$2')\n  expr = expr.replace(/\\)\\s*\\(/g, ')*(')\n  expr = expr.replace(/\\s+/g, ' ').trim()\n\n  return expr\n}\n\n// ─── Numeric calculus ─────────────────────────────────────────────────────────\n//\n// `evaluate_katex` is a numeric evaluator. mathjs has no symbolic integration, and its symbolic\n// `derivative` is intentionally blocklisted above, so calculus is computed NUMERICALLY: definite\n// integrals via composite Simpson quadrature, derivatives via central finite differences, and limits\n// via a two-sided approach. These are approximations (correct to ~1e-9 for the smooth expressions a\n// model emits), surfaced under a `Result (numeric):` label so the distinction is explicit.\n//\n// Detection runs on the RAW LaTeX, before `translateLatex` flattens it — its subscript stripping\n// would otherwise destroy integral bounds (`\\int_{0}^{1}` → `\\int^(1)`) and limit targets. The\n// extracted sub-expressions (integrand, bounds, body, point) are then translated by the existing\n// `translateLatex` and evaluated per-point with a scope, which works under the security blocklist.\n\n/** A tagged error whose message is surfaced to the model verbatim (caught by {@link tryCalculus}). */\nclass CalculusError extends Error {}\n\n/** Evaluate a mathjs expression at a single point, guarding against non-finite results. */\nfunction evalAt(expr: string, varName: string, x: number): number {\n  const y = math.evaluate!(expr, { [varName]: x })\n  if (typeof y !== 'number' || !Number.isFinite(y)) {\n    throw new CalculusError('NON_FINITE')\n  }\n  return y\n}\n\n/** Composite Simpson's rule over a finite interval. Throws {@link CalculusError} on a singularity. */\nfunction simpson(fn: (x: number) => number, a: number, b: number, n = 1000): number {\n  if (n % 2 === 1) n++\n  const h = (b - a) / n\n  let sum = fn(a) + fn(b)\n  for (let i = 1; i < n; i++) {\n    sum += (i % 2 === 1 ? 4 : 2) * fn(a + i * h)\n  }\n  const result = (h / 3) * sum\n  if (!Number.isFinite(result)) throw new CalculusError('NON_FINITE')\n  return result\n}\n\n/** Round numeric output to 12 significant digits, collapsing floating-point noise. */\nfunction formatNumeric(n: number): string {\n  // Snap values that are zero-to-within-tolerance to exactly 0 (e.g. lim_{x->inf} 1/x ≈ 1e-8).\n  if (Math.abs(n) < 1e-9) return '0'\n  return math.format!(n, { precision: 12 })\n}\n\n/**\n * Reads a single `_`/`^` script starting at `i`, supporting braced (`_{0}`, `^{\\pi}`), command\n * (`^\\pi`), and bare-token (`_0`, `^1`) forms. Returns the mark, its raw-LaTeX value, and the next\n * index, or `null` when there is no script at `i`.\n */\nfunction readScript(s: string, i: number): { mark: '_' | '^'; val: string; next: number } | null {\n  while (s[i] === ' ') i++\n  const mark = s[i]\n  if (mark !== '_' && mark !== '^') return null\n  i++\n  while (s[i] === ' ') i++\n  if (s[i] === '{') {\n    let depth = 0\n    const start = ++i\n    for (; i < s.length; i++) {\n      if (s[i] === '{') depth++\n      else if (s[i] === '}') {\n        if (depth === 0) break\n        depth--\n      }\n    }\n    return { mark, val: s.slice(start, i), next: i + 1 }\n  }\n  if (s[i] === '\\\\') {\n    const m = /^\\\\[a-zA-Z]+/.exec(s.slice(i))\n    if (!m) return null\n    return { mark, val: m[0], next: i + m[0].length }\n  }\n  const m = /^[A-Za-z0-9.]+/.exec(s.slice(i))\n  if (!m) return null\n  return { mark, val: m[0], next: i + m[0].length }\n}\n\n/** Translate a raw-LaTeX bound/target fragment and evaluate it to a finite number. */\nfunction evalBound(latex: string): number {\n  const trimmed = latex.trim()\n  if (/\\\\infty/.test(trimmed)) throw new CalculusError('INFINITE_BOUND')\n  const mathjsExpr = translateLatex(trimmed)\n  const value = math.evaluate!(mathjsExpr)\n  if (typeof value !== 'number' || !Number.isFinite(value)) {\n    throw new CalculusError('BAD_BOUND')\n  }\n  return value\n}\n\n/** Evaluate a definite integral `\\int_{a}^{b} f \\,dx` by Simpson quadrature. */\nfunction evalIntegral(s: string): string {\n  // Strip the operator (\\int, optionally with \\limits).\n  const m = /\\\\int(?:\\\\limits)?/.exec(s)\n  if (!m) throw new CalculusError('NOT_INTEGRAL')\n  let i = m.index + m[0].length\n\n  // Read up to two scripts (bounds), in either order.\n  const scripts: Record<'_' | '^', string | undefined> = { '_': undefined, '^': undefined }\n  for (let k = 0; k < 2; k++) {\n    const sc = readScript(s, i)\n    if (!sc) break\n    scripts[sc.mark] = sc.val\n    i = sc.next\n  }\n  if (scripts._ === undefined || scripts['^'] === undefined) {\n    throw new CalculusError('INDEFINITE')\n  }\n\n  // The remainder is `integrand … d<var>`. Pull the trailing differential off the end.\n  const rest = s.slice(i)\n  const diff = /\\\\?,?\\s*\\bd\\s*([a-zA-Z])\\s*$/.exec(rest)\n  if (!diff) throw new CalculusError('NO_DIFFERENTIAL')\n  const variable = diff[1]\n  const integrandLatex = rest.slice(0, diff.index)\n  if (integrandLatex.trim().length === 0) throw new CalculusError('NO_INTEGRAND')\n\n  const a = evalBound(scripts._)\n  const b = evalBound(scripts['^'])\n  const integrand = translateLatex(integrandLatex)\n  const fn = (x: number) => evalAt(integrand, variable, x)\n\n  let result: number\n  if (a === b) result = 0\n  else if (a < b) result = simpson(fn, a, b)\n  else result = -simpson(fn, b, a)\n\n  return `Converted: ∫(${integrand}) d${variable} from ${formatNumeric(a)} to ${formatNumeric(b)}\\nResult (numeric): ${formatNumeric(result)}`\n}\n\n/** Evaluate a derivative `\\frac{d}{dx} f \\big|_{x=a}` at a point via central finite difference. */\nfunction evalDerivative(s: string): string {\n  // Operator + variable: \\frac{d}{dx} … or bare d/dx ….\n  let variable: string | undefined\n  let body = s\n  const fracOp = /\\\\frac\\s*\\{\\s*d\\s*\\}\\s*\\{\\s*d\\s*([a-zA-Z])\\s*\\}/.exec(s)\n  if (fracOp) {\n    variable = fracOp[1]\n    body = s.slice(fracOp.index + fracOp[0].length)\n  } else {\n    const bareOp = /(?:^|[^a-zA-Z])d\\s*\\/\\s*d([a-zA-Z])/.exec(s)\n    if (bareOp) {\n      variable = bareOp[1]\n      body = s.slice(bareOp.index + bareOp[0].length)\n    }\n  }\n  if (!variable) throw new CalculusError('NOT_DERIVATIVE')\n\n  // Remove pure \\left. / \\right. delimiters.\n  body = body.replace(/\\\\left\\.?/g, '').replace(/\\\\right\\.?/g, '')\n\n  // Evaluation bar + point at the end: …|_{x=3} (optionally \\Big| etc.).\n  const bar = /\\\\?(?:Big|big|bigg|Bigg)?\\s*\\|\\s*_\\s*\\{?\\s*([a-zA-Z])\\s*=\\s*([^}]+?)\\s*\\}?\\s*$/.exec(\n    body\n  )\n  if (!bar) throw new CalculusError('NO_POINT')\n  const point = evalBound(bar[2])\n  let fnLatex = body.slice(0, bar.index).trim()\n\n  // Strip one layer of wrapping parentheses/brackets around the function body.\n  fnLatex = fnLatex\n    .replace(/^\\\\?\\(([\\s\\S]*)\\\\?\\)$/, '$1')\n    .replace(/^\\[([\\s\\S]*)\\]$/, '$1')\n    .trim()\n  if (fnLatex.length === 0) throw new CalculusError('NO_FUNCTION')\n\n  const expr = translateLatex(fnLatex)\n  const h = 1e-6\n  const fn = (x: number) => evalAt(expr, variable, x)\n  const result = (fn(point + h) - fn(point - h)) / (2 * h)\n  if (!Number.isFinite(result)) throw new CalculusError('NON_FINITE')\n\n  return `Converted: d/d${variable}(${expr}) at ${variable}=${formatNumeric(point)}\\nResult (numeric): ${formatNumeric(result)}`\n}\n\n/** Evaluate a limit `\\lim_{x \\to a} f(x)` by a two-sided numeric approach. */\nfunction evalLimit(s: string): string {\n  const head = /\\\\lim\\s*_\\s*\\{\\s*([a-zA-Z])\\s*\\\\to\\s*([\\s\\S]+?)\\s*\\}/.exec(s)\n  if (!head) throw new CalculusError('NOT_LIMIT')\n  const variable = head[1]\n  let targetLatex = head[2].trim()\n  const bodyLatex = s.slice(head.index + head[0].length).trim()\n  if (bodyLatex.length === 0) throw new CalculusError('NO_FUNCTION')\n\n  // One-sided markers (0^+, 0^-, 0^{+}) — record the side, strip the marker.\n  let side: 'both' | 'plus' | 'minus' = 'both'\n  const oneSided = /\\^\\s*\\{?\\s*([+-])\\s*\\}?\\s*$/.exec(targetLatex)\n  if (oneSided) {\n    side = oneSided[1] === '+' ? 'plus' : 'minus'\n    targetLatex = targetLatex.slice(0, oneSided.index).trim()\n  }\n\n  const expr = translateLatex(bodyLatex)\n  const fn = (x: number) => evalAt(expr, variable, x)\n  const eps = 1e-6\n\n  // Infinite targets via large-magnitude substitution.\n  let result: number\n  let targetLabel: string\n  if (/^-\\s*\\\\infty$/.test(targetLatex)) {\n    result = fn(-1e8)\n    targetLabel = '-∞'\n  } else if (/^\\\\infty$/.test(targetLatex)) {\n    result = fn(1e8)\n    targetLabel = '∞'\n  } else {\n    const target = evalBound(targetLatex)\n    targetLabel = formatNumeric(target)\n    if (side === 'plus') {\n      result = fn(target + eps)\n    } else if (side === 'minus') {\n      result = fn(target - eps)\n    } else {\n      const lo = fn(target - eps)\n      const hi = fn(target + eps)\n      const avg = (lo + hi) / 2\n      if (Math.abs(hi - lo) > 1e-3 * Math.max(1, Math.abs(avg))) {\n        throw new CalculusError('LIMIT_MISMATCH')\n      }\n      result = avg\n    }\n  }\n  if (!Number.isFinite(result)) throw new CalculusError('LIMIT_UNBOUNDED')\n\n  // Infinite-target substitution (±1e8) and the eps offset leave more residue than Simpson or the\n  // derivative difference, so snap a limit result to a nearby round value before formatting:\n  // 0.99999998 → 1, 1e-8 → 0. The tolerance is loose enough to absorb the substitution error yet\n  // far tighter than the divergence check that already rejected genuinely non-convergent limits.\n  const nearest = Math.round(result)\n  if (Math.abs(result - nearest) < 1e-6) result = nearest\n\n  return `Converted: lim ${variable}→${targetLabel} of (${expr})\\nResult (numeric): ${formatNumeric(result)}`\n}\n\n/** Human-readable, model-actionable message for each {@link CalculusError} tag. */\nfunction calculusErrorMessage(tag: string): string {\n  switch (tag) {\n    case 'INDEFINITE':\n      return 'Cannot evaluate an indefinite integral numerically. Provide bounds, e.g. \\\\int_{0}^{1} x dx.'\n    case 'NO_DIFFERENTIAL':\n      return \"Could not find the integration variable. Expected a trailing differential like 'dx'.\"\n    case 'NO_INTEGRAND':\n      return 'The integral has no integrand to evaluate.'\n    case 'INFINITE_BOUND':\n      return 'Infinite integration bounds are not supported. Provide finite numeric bounds, e.g. \\\\int_{0}^{1} f dx.'\n    case 'BAD_BOUND':\n      return 'Could not evaluate the integration bounds to numbers.'\n    case 'NO_POINT':\n      return 'Cannot evaluate a derivative numerically without a point. Specify where, e.g. \\\\frac{d}{dx}(x^2)\\\\Big|_{x=3}.'\n    case 'NO_FUNCTION':\n      return 'Could not find the function to evaluate.'\n    case 'LIMIT_MISMATCH':\n      return 'The limit may not exist (left and right values disagree).'\n    case 'LIMIT_UNBOUNDED':\n      return 'The limit appears to diverge (function is unbounded near the target).'\n    case 'NON_FINITE':\n      return 'The expression is not finite over the requested range (possible singularity); cannot evaluate numerically.'\n    default:\n      return 'Could not evaluate the calculus expression.'\n  }\n}\n\n/**\n * Detects a calculus construct in raw LaTeX and routes it to the matching numeric handler. Returns\n * the result/error string, or `null` when the input is not a calculus expression (so the caller\n * falls through to the scalar evaluation path unchanged).\n */\nfunction tryCalculus(latex: string): string | null {\n  let s = latex.trim()\n  s = s.replace(/^\\$\\$?|\\$\\$?$/g, '')\n  s = s.replace(/^\\\\[[(]|\\\\[\\])]$/g, '').trim()\n\n  let handler: ((expr: string) => string) | undefined\n  if (/\\\\int/.test(s)) handler = evalIntegral\n  else if (/\\\\lim/.test(s)) handler = evalLimit\n  else if (\n    /\\\\frac\\s*\\{\\s*d\\s*\\}\\s*\\{\\s*d\\s*[a-zA-Z]\\s*\\}/.test(s) ||\n    /(?:^|[^a-zA-Z])d\\s*\\/\\s*d[a-zA-Z]/.test(s)\n  )\n    handler = evalDerivative\n  if (!handler) return null\n\n  try {\n    return handler(s)\n  } catch (err) {\n    if (isInstanceOf(err, 'CalculusError', CalculusError)) {\n      return `Error: ${calculusErrorMessage(err.message)}`\n    }\n    return `Error: ${isError(err) ? err.message : String(err)}`\n  }\n}\n\n/**\n * Evaluates a mathjs-syntax expression and returns the numeric result alongside the KaTeX\n * representation of the parsed expression.\n *\n * @remarks\n * Supports arithmetic, trigonometric, logarithmic, exponential, factorial, matrix, and unit\n * operations via `mathjs`. The mathjs instance is hardened: dangerous functions (`import`,\n * `createUnit`, `simplify`, `derivative`, `compile`, `chain`, `reviver`, `replacer`) are\n * disabled to prevent interpreter-surface exposure.\n *\n * Expressions over 1000 characters are rejected with an error string (not thrown). Parse and\n * evaluation errors are also returned as error strings — the tool surfaces math errors as\n * content rather than exceptions, so the model can react to them in-line.\n */\nexport const calculateTool = new Tool({\n  name: 'calculate',\n  description:\n    'Evaluate a math expression. Supports arithmetic, trig, log, sqrt, factorial, matrices.',\n  inputSchema: validator.object({\n    expression: validator.string().required().description('Math expression, e.g. \"sin(pi/4) + 5!\"'),\n  }),\n  handler: async (args) => {\n    const { expression } = args as { expression: string }\n\n    const lengthError = validateExpression(expression)\n    if (lengthError) return lengthError\n\n    try {\n      const result = math.evaluate!(expression)\n      const node = math.parse!(expression)\n      const katex = node.toTex()\n      return `Result: ${result}\\nKaTeX: $${katex} = ${result}$`\n    } catch (err) {\n      return `Error: ${isError(err) ? err.message : String(err)}`\n    }\n  },\n})\n\n/**\n * Translates a LaTeX/KaTeX expression using evaluatex and returns the numeric result.\n *\n * @remarks\n * Uses the evaluatex library to parse and evaluate LaTeX expressions. Handles common constructs\n * (`\\frac{a}{b}`, `\\sqrt{...}`, `\\cdot`, `\\times`, Greek macros like `\\pi`, inverse trig,\n * `\\left`/`\\right` delimiters, `\\text{...}`, subscripts, etc.) with a proper parser rather than\n * brittle regex.\n *\n * Also evaluates three calculus constructs **numerically** (mathjs has no symbolic integration, and\n * its symbolic `derivative` is blocklisted here for safety):\n * - Definite integrals — `\\int_{a}^{b} f \\,dx` via composite Simpson quadrature.\n * - Derivatives at a point — `\\frac{d}{dx} f \\big|_{x=a}` via central finite difference.\n * - Limits — `\\lim_{x \\to a} f` (including `a = \\pm\\infty`) via a two-sided numeric approach.\n *\n * Numeric results are rounded with `math.format(..., { precision: 12 })` and labelled\n * `Result (numeric):` to flag that they are approximations. Constructs that cannot be evaluated\n * numerically (indefinite integrals, derivatives without a point, infinite integration bounds,\n * singular integrands, divergent limits) return a specific, guiding error string.\n *\n * Parse and evaluation errors are returned as error strings rather than thrown.\n */\nexport const evaluateKatexTool = new Tool({\n  name: 'evaluate_katex',\n  description:\n    'Evaluate a KaTeX/LaTeX math expression and return the numeric result. Supports arithmetic, trig, logs, roots, and numeric calculus: definite integrals (\\\\int_{a}^{b} f dx), derivatives at a point (\\\\frac{d}{dx} f|_{x=a}), and limits (\\\\lim_{x \\\\to a} f).',\n  inputSchema: validator.object({\n    katex: validator\n      .string()\n      .required()\n      .description('LaTeX expression, e.g. \"\\\\frac{1}{2} + \\\\sqrt{9}\" or \"\\\\int_{0}^{1} x^2 dx\"'),\n  }),\n  handler: async (args) => {\n    const { katex } = args as { katex: string }\n\n    const lengthError = validateExpression(katex)\n    if (lengthError) return lengthError\n\n    try {\n      // Calculus (\\int, \\lim, d/dx) is detected on the raw LaTeX and evaluated numerically before\n      // the scalar flattening path, which would otherwise mangle bounds/targets. Returns null for\n      // non-calculus input, falling through to the scalar evaluator below unchanged.\n      const calculus = tryCalculus(katex)\n      if (calculus !== null) return calculus\n\n      const result = evaluateLatex(katex)\n      return `Result: ${result}`\n    } catch (err) {\n      return `Error: ${isError(err) ? err.message : String(err)}`\n    }\n  },\n})\n"],"mappings":";;;;;;;;;;;;;;;;;AAgBA,IAAM,OAAO,OAAO,GAAG;AAavB,KAAK,MAAM,MAAM;CAVf;CACA;CACA;CACA;CACA;CACA;CACA;CACA;AAGe,GACf,IAAI,MAAM,MACP,KAAc,MAAM,KAAA;AAIzB,IAAM,wBAAwB;AAE9B,SAAS,mBAAmB,MAAkC;CAC5D,IAAI,KAAK,SAAS,uBAChB,OAAO,4BAA4B,sBAAsB;AAG7D;;;;;;AAOA,IAAM,kBAA2C;CAE/C,IAAI,KAAK;CACT,GAAG,KAAK;CACR,UAAU;CAEV,OAAO,KAAA;CACP,MAAM,KAAA;CACN,OAAO,KAAA;CACP,OAAO,KAAA;CACP,SAAS,KAAA;CACT,OAAO,KAAA;CACP,QAAQ,KAAA;CACR,IAAI,KAAA;CACJ,OAAO,KAAA;CACP,KAAK,KAAA;CACL,KAAK,KAAA;CACL,OAAO,KAAA;CAGP,IAAI,KAAK;CACT,QAAQ,MAAc,KAAK,IAAI,CAAC,IAAI,KAAK;CACzC,OAAO,MAAc,KAAK,IAAI,CAAC,IAAI,KAAK;CACxC,UAAU,GAAW,MAAc,KAAK,IAAI,GAAG,IAAI,CAAC;CAEpD,MAAM,MAAc;AACtB;;;;;;;;;AAUA,SAAS,cAAc,OAAuB;CAC5C,IAAI,OAAO,MAAM,KAAK;CAGtB,OAAO,KAAK,QAAQ,kBAAkB,EAAE;CAExC,OAAO,KAAK,QAAQ,qBAAqB,EAAE;CAK3C,KAAK,IAAI,IAAI,GAAG,IAAI,IAAI,KAAK;EAC3B,MAAM,SAAS;EACf,OAAO,KAAK,QAAQ,uCAAuC,WAAW;EACtE,IAAI,SAAS,QAAQ;CACvB;CAGA,OAAO,KAAK,QAAQ,qCAAqC,iBAAiB;CAE1E,OAAO,KAAK,QAAQ,yBAAyB,UAAU;CAGvD,OAAO,KAAK,QAAQ,aAAa,MAAM;CACvC,OAAO,KAAK,QAAQ,aAAa,MAAM;CACvC,OAAO,KAAK,QAAQ,aAAa,MAAM;CAIvC,OAAO,KAAK,QAAQ,kEAAkE,IAAI;CAG1F,OAAO,KAAK,QAAQ,uBAAuB,GAAG,SAAS;EACrD,MAAM,YAAY,KAAK,YAAY;EACnC,IAAI,cAAc,MAAM,OAAO;EAC/B,IAAI,cAAc,KAAK,OAAO;EAC9B,IAAI,cAAc,KAAK,OAAO;EAG9B,OAAO,UAAU,KAAK;CACxB,CAAC;CAED,OAAO,KAAK,QAAQ,eAAe,EAAE;CACrC,OAAO,KAAK,QAAQ,QAAQ,EAAE;CAG9B,OAAO,KAAK,QAAQ,iBAAiB,OAAO;CAG5C,OAAO,KAAK,QAAQ,SAAS,IAAI;CACjC,OAAO,KAAK,QACV,2EACA,IACF;CAGA,OAAO,KAAK,QAAQ,WAAW,GAAG;CAClC,OAAO,KAAK,QAAQ,YAAY,GAAG;CACnC,OAAO,KAAK,QAAQ,UAAU,GAAG;CACjC,OAAO,KAAK,QAAQ,YAAY,UAAU;CAC1C,OAAO,KAAK,QAAQ,sBAAsB,IAAI;CAC9C,OAAO,KAAK,QAAQ,wBAAwB,IAAI;CAChD,OAAO,KAAK,QAAQ,UAAU,KAAK;CACnC,OAAO,KAAK,QAAQ,WAAW,MAAM;CACrC,OAAO,KAAK,QAAQ,QAAQ,GAAG;CAC/B,OAAO,KAAK,QAAQ,QAAQ,GAAG;CAC/B,OAAO,KAAK,QAAQ,WAAW,GAAG;CAClC,OAAO,KAAK,QAAQ,YAAY,GAAG;CAEnC,OAAO,KAAK,QAAQ,uBAAuB,EAAE;CAG7C,OAAO,KAAK,QAAQ,oBAAoB,OAAO;CAC/C,OAAO,KAAK,QAAQ,YAAY,KAAK;CAGrC,OAAO,KAAK,QAAQ,QAAQ,GAAG,EAAE,KAAK;CAGtC,MAAM,SADK,UAAU,MAAM,eACZ,EAAG;CAClB,IAAI,OAAO,WAAW,YAAY,CAAC,OAAO,SAAS,MAAM,GACvD,MAAM,IAAI,MAAM,sBAAsB;CAExC,OAAO;AACT;;;;;;;;;AAUA,SAAS,eAAe,OAAuB;CAC7C,IAAI,OAAO,MAAM,KAAK;CACtB,OAAO,KAAK,QAAQ,kBAAkB,EAAE;CACxC,OAAO,KAAK,QAAQ,qBAAqB,EAAE;CAE3C,KAAK,IAAI,IAAI,GAAG,IAAI,IAAI,KAAK;EAC3B,MAAM,SAAS;EACf,OAAO,KAAK,QAAQ,uCAAuC,WAAW;EACtE,IAAI,SAAS,QAAQ;CACvB;CAEA,OAAO,KAAK,QAAQ,qCAAqC,iBAAiB;CAC1E,OAAO,KAAK,QAAQ,yBAAyB,UAAU;CAEvD,OAAO,KAAK,QAAQ,aAAa,MAAM;CACvC,OAAO,KAAK,QAAQ,aAAa,MAAM;CACvC,OAAO,KAAK,QAAQ,aAAa,MAAM;CAEvC,OAAO,KAAK,QAAQ,kEAAkE,IAAI;CAE1F,OAAO,KAAK,QAAQ,kCAAkC,aAAa;CACnE,OAAO,KAAK,QAAQ,iBAAiB,OAAO;CAC5C,OAAO,KAAK,QAAQ,gBAAgB,EAAE;CACtC,OAAO,KAAK,QAAQ,QAAQ,EAAE;CAE9B,OAAO,KAAK,QAAQ,SAAS,IAAI;CACjC,OAAO,KAAK,QACV,2EACA,IACF;CAEA,OAAO,KAAK,QAAQ,WAAW,GAAG;CAClC,OAAO,KAAK,QAAQ,YAAY,GAAG;CACnC,OAAO,KAAK,QAAQ,UAAU,GAAG;CACjC,OAAO,KAAK,QAAQ,YAAY,UAAU;CAC1C,OAAO,KAAK,QAAQ,sBAAsB,IAAI;CAC9C,OAAO,KAAK,QAAQ,wBAAwB,IAAI;CAChD,OAAO,KAAK,QAAQ,UAAU,KAAK;CACnC,OAAO,KAAK,QAAQ,WAAW,MAAM;CACrC,OAAO,KAAK,QAAQ,QAAQ,GAAG;CAC/B,OAAO,KAAK,QAAQ,QAAQ,GAAG;CAC/B,OAAO,KAAK,QAAQ,WAAW,GAAG;CAClC,OAAO,KAAK,QAAQ,YAAY,GAAG;CACnC,OAAO,KAAK,QAAQ,uBAAuB,EAAE;CAC7C,OAAO,KAAK,QAAQ,oBAAoB,OAAO;CAC/C,OAAO,KAAK,QAAQ,YAAY,KAAK;CACrC,OAAO,KAAK,QAAQ,QAAQ,GAAG,EAAE,KAAK;CAEtC,OAAO;AACT;;AAgBA,IAAM,gBAAN,cAA4B,MAAM,CAAC;;AAGnC,SAAS,OAAO,MAAc,SAAiB,GAAmB;CAChE,MAAM,IAAI,KAAK,SAAU,MAAM,GAAG,UAAU,EAAE,CAAC;CAC/C,IAAI,OAAO,MAAM,YAAY,CAAC,OAAO,SAAS,CAAC,GAC7C,MAAM,IAAI,cAAc,YAAY;CAEtC,OAAO;AACT;;AAGA,SAAS,QAAQ,IAA2B,GAAW,GAAW,IAAI,KAAc;CAClF,IAAI,IAAI,MAAM,GAAG;CACjB,MAAM,KAAK,IAAI,KAAK;CACpB,IAAI,MAAM,GAAG,CAAC,IAAI,GAAG,CAAC;CACtB,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KACrB,QAAQ,IAAI,MAAM,IAAI,IAAI,KAAK,GAAG,IAAI,IAAI,CAAC;CAE7C,MAAM,SAAU,IAAI,IAAK;CACzB,IAAI,CAAC,OAAO,SAAS,MAAM,GAAG,MAAM,IAAI,cAAc,YAAY;CAClE,OAAO;AACT;;AAGA,SAAS,cAAc,GAAmB;CAExC,IAAI,KAAK,IAAI,CAAC,IAAI,MAAM,OAAO;CAC/B,OAAO,KAAK,OAAQ,GAAG,EAAE,WAAW,GAAG,CAAC;AAC1C;;;;;;AAOA,SAAS,WAAW,GAAW,GAAkE;CAC/F,OAAO,EAAE,OAAO,KAAK;CACrB,MAAM,OAAO,EAAE;CACf,IAAI,SAAS,OAAO,SAAS,KAAK,OAAO;CACzC;CACA,OAAO,EAAE,OAAO,KAAK;CACrB,IAAI,EAAE,OAAO,KAAK;EAChB,IAAI,QAAQ;EACZ,MAAM,QAAQ,EAAE;EAChB,OAAO,IAAI,EAAE,QAAQ,KACnB,IAAI,EAAE,OAAO,KAAK;OACb,IAAI,EAAE,OAAO,KAAK;GACrB,IAAI,UAAU,GAAG;GACjB;EACF;EAEF,OAAO;GAAE;GAAM,KAAK,EAAE,MAAM,OAAO,CAAC;GAAG,MAAM,IAAI;EAAE;CACrD;CACA,IAAI,EAAE,OAAO,MAAM;EACjB,MAAM,IAAI,eAAe,KAAK,EAAE,MAAM,CAAC,CAAC;EACxC,IAAI,CAAC,GAAG,OAAO;EACf,OAAO;GAAE;GAAM,KAAK,EAAE;GAAI,MAAM,IAAI,EAAE,GAAG;EAAO;CAClD;CACA,MAAM,IAAI,iBAAiB,KAAK,EAAE,MAAM,CAAC,CAAC;CAC1C,IAAI,CAAC,GAAG,OAAO;CACf,OAAO;EAAE;EAAM,KAAK,EAAE;EAAI,MAAM,IAAI,EAAE,GAAG;CAAO;AAClD;;AAGA,SAAS,UAAU,OAAuB;CACxC,MAAM,UAAU,MAAM,KAAK;CAC3B,IAAI,UAAU,KAAK,OAAO,GAAG,MAAM,IAAI,cAAc,gBAAgB;CACrE,MAAM,aAAa,eAAe,OAAO;CACzC,MAAM,QAAQ,KAAK,SAAU,UAAU;CACvC,IAAI,OAAO,UAAU,YAAY,CAAC,OAAO,SAAS,KAAK,GACrD,MAAM,IAAI,cAAc,WAAW;CAErC,OAAO;AACT;;AAGA,SAAS,aAAa,GAAmB;CAEvC,MAAM,IAAI,qBAAqB,KAAK,CAAC;CACrC,IAAI,CAAC,GAAG,MAAM,IAAI,cAAc,cAAc;CAC9C,IAAI,IAAI,EAAE,QAAQ,EAAE,GAAG;CAGvB,MAAM,UAAiD;EAAE,KAAK,KAAA;EAAW,KAAK,KAAA;CAAU;CACxF,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK;EAC1B,MAAM,KAAK,WAAW,GAAG,CAAC;EAC1B,IAAI,CAAC,IAAI;EACT,QAAQ,GAAG,QAAQ,GAAG;EACtB,IAAI,GAAG;CACT;CACA,IAAI,QAAQ,MAAM,KAAA,KAAa,QAAQ,SAAS,KAAA,GAC9C,MAAM,IAAI,cAAc,YAAY;CAItC,MAAM,OAAO,EAAE,MAAM,CAAC;CACtB,MAAM,OAAO,+BAA+B,KAAK,IAAI;CACrD,IAAI,CAAC,MAAM,MAAM,IAAI,cAAc,iBAAiB;CACpD,MAAM,WAAW,KAAK;CACtB,MAAM,iBAAiB,KAAK,MAAM,GAAG,KAAK,KAAK;CAC/C,IAAI,eAAe,KAAK,EAAE,WAAW,GAAG,MAAM,IAAI,cAAc,cAAc;CAE9E,MAAM,IAAI,UAAU,QAAQ,CAAC;CAC7B,MAAM,IAAI,UAAU,QAAQ,IAAI;CAChC,MAAM,YAAY,eAAe,cAAc;CAC/C,MAAM,MAAM,MAAc,OAAO,WAAW,UAAU,CAAC;CAEvD,IAAI;CACJ,IAAI,MAAM,GAAG,SAAS;MACjB,IAAI,IAAI,GAAG,SAAS,QAAQ,IAAI,GAAG,CAAC;MACpC,SAAS,CAAC,QAAQ,IAAI,GAAG,CAAC;CAE/B,OAAO,gBAAgB,UAAU,KAAK,SAAS,QAAQ,cAAc,CAAC,EAAE,MAAM,cAAc,CAAC,EAAE,sBAAsB,cAAc,MAAM;AAC3I;;AAGA,SAAS,eAAe,GAAmB;CAEzC,IAAI;CACJ,IAAI,OAAO;CACX,MAAM,SAAS,kDAAkD,KAAK,CAAC;CACvE,IAAI,QAAQ;EACV,WAAW,OAAO;EAClB,OAAO,EAAE,MAAM,OAAO,QAAQ,OAAO,GAAG,MAAM;CAChD,OAAO;EACL,MAAM,SAAS,sCAAsC,KAAK,CAAC;EAC3D,IAAI,QAAQ;GACV,WAAW,OAAO;GAClB,OAAO,EAAE,MAAM,OAAO,QAAQ,OAAO,GAAG,MAAM;EAChD;CACF;CACA,IAAI,CAAC,UAAU,MAAM,IAAI,cAAc,gBAAgB;CAGvD,OAAO,KAAK,QAAQ,cAAc,EAAE,EAAE,QAAQ,eAAe,EAAE;CAG/D,MAAM,MAAM,iFAAiF,KAC3F,IACF;CACA,IAAI,CAAC,KAAK,MAAM,IAAI,cAAc,UAAU;CAC5C,MAAM,QAAQ,UAAU,IAAI,EAAE;CAC9B,IAAI,UAAU,KAAK,MAAM,GAAG,IAAI,KAAK,EAAE,KAAK;CAG5C,UAAU,QACP,QAAQ,yBAAyB,IAAI,EACrC,QAAQ,mBAAmB,IAAI,EAC/B,KAAK;CACR,IAAI,QAAQ,WAAW,GAAG,MAAM,IAAI,cAAc,aAAa;CAE/D,MAAM,OAAO,eAAe,OAAO;CACnC,MAAM,IAAI;CACV,MAAM,MAAM,MAAc,OAAO,MAAM,UAAU,CAAC;CAClD,MAAM,UAAU,GAAG,QAAQ,CAAC,IAAI,GAAG,QAAQ,CAAC,MAAM,IAAI;CACtD,IAAI,CAAC,OAAO,SAAS,MAAM,GAAG,MAAM,IAAI,cAAc,YAAY;CAElE,OAAO,iBAAiB,SAAS,GAAG,KAAK,OAAO,SAAS,GAAG,cAAc,KAAK,EAAE,sBAAsB,cAAc,MAAM;AAC7H;;AAGA,SAAS,UAAU,GAAmB;CACpC,MAAM,OAAO,uDAAuD,KAAK,CAAC;CAC1E,IAAI,CAAC,MAAM,MAAM,IAAI,cAAc,WAAW;CAC9C,MAAM,WAAW,KAAK;CACtB,IAAI,cAAc,KAAK,GAAG,KAAK;CAC/B,MAAM,YAAY,EAAE,MAAM,KAAK,QAAQ,KAAK,GAAG,MAAM,EAAE,KAAK;CAC5D,IAAI,UAAU,WAAW,GAAG,MAAM,IAAI,cAAc,aAAa;CAGjE,IAAI,OAAkC;CACtC,MAAM,WAAW,8BAA8B,KAAK,WAAW;CAC/D,IAAI,UAAU;EACZ,OAAO,SAAS,OAAO,MAAM,SAAS;EACtC,cAAc,YAAY,MAAM,GAAG,SAAS,KAAK,EAAE,KAAK;CAC1D;CAEA,MAAM,OAAO,eAAe,SAAS;CACrC,MAAM,MAAM,MAAc,OAAO,MAAM,UAAU,CAAC;CAClD,MAAM,MAAM;CAGZ,IAAI;CACJ,IAAI;CACJ,IAAI,gBAAgB,KAAK,WAAW,GAAG;EACrC,SAAS,GAAG,IAAI;EAChB,cAAc;CAChB,OAAO,IAAI,YAAY,KAAK,WAAW,GAAG;EACxC,SAAS,GAAG,GAAG;EACf,cAAc;CAChB,OAAO;EACL,MAAM,SAAS,UAAU,WAAW;EACpC,cAAc,cAAc,MAAM;EAClC,IAAI,SAAS,QACX,SAAS,GAAG,SAAS,GAAG;OACnB,IAAI,SAAS,SAClB,SAAS,GAAG,SAAS,GAAG;OACnB;GACL,MAAM,KAAK,GAAG,SAAS,GAAG;GAC1B,MAAM,KAAK,GAAG,SAAS,GAAG;GAC1B,MAAM,OAAO,KAAK,MAAM;GACxB,IAAI,KAAK,IAAI,KAAK,EAAE,IAAI,OAAO,KAAK,IAAI,GAAG,KAAK,IAAI,GAAG,CAAC,GACtD,MAAM,IAAI,cAAc,gBAAgB;GAE1C,SAAS;EACX;CACF;CACA,IAAI,CAAC,OAAO,SAAS,MAAM,GAAG,MAAM,IAAI,cAAc,iBAAiB;CAMvE,MAAM,UAAU,KAAK,MAAM,MAAM;CACjC,IAAI,KAAK,IAAI,SAAS,OAAO,IAAI,MAAM,SAAS;CAEhD,OAAO,kBAAkB,SAAS,GAAG,YAAY,OAAO,KAAK,uBAAuB,cAAc,MAAM;AAC1G;;AAGA,SAAS,qBAAqB,KAAqB;CACjD,QAAQ,KAAR;EACE,KAAK,cACH,OAAO;EACT,KAAK,mBACH,OAAO;EACT,KAAK,gBACH,OAAO;EACT,KAAK,kBACH,OAAO;EACT,KAAK,aACH,OAAO;EACT,KAAK,YACH,OAAO;EACT,KAAK,eACH,OAAO;EACT,KAAK,kBACH,OAAO;EACT,KAAK,mBACH,OAAO;EACT,KAAK,cACH,OAAO;EACT,SACE,OAAO;CACX;AACF;;;;;;AAOA,SAAS,YAAY,OAA8B;CACjD,IAAI,IAAI,MAAM,KAAK;CACnB,IAAI,EAAE,QAAQ,kBAAkB,EAAE;CAClC,IAAI,EAAE,QAAQ,qBAAqB,EAAE,EAAE,KAAK;CAE5C,IAAI;CACJ,IAAI,QAAQ,KAAK,CAAC,GAAG,UAAU;MAC1B,IAAI,QAAQ,KAAK,CAAC,GAAG,UAAU;MAC/B,IACH,gDAAgD,KAAK,CAAC,KACtD,oCAAoC,KAAK,CAAC,GAE1C,UAAU;CACZ,IAAI,CAAC,SAAS,OAAO;CAErB,IAAI;EACF,OAAO,QAAQ,CAAC;CAClB,SAAS,KAAK;EACZ,IAAI,aAAa,KAAK,iBAAiB,aAAa,GAClD,OAAO,UAAU,qBAAqB,IAAI,OAAO;EAEnD,OAAO,UAAU,QAAQ,GAAG,IAAI,IAAI,UAAU,OAAO,GAAG;CAC1D;AACF;;;;;;;;;;;;;;;AAgBA,IAAa,gBAAgB,IAAI,KAAK;CACpC,MAAM;CACN,aACE;CACF,aAAa,UAAU,OAAO,EAC5B,YAAY,UAAU,OAAO,EAAE,SAAS,EAAE,YAAY,0CAAwC,EAChG,CAAC;CACD,SAAS,OAAO,SAAS;EACvB,MAAM,EAAE,eAAe;EAEvB,MAAM,cAAc,mBAAmB,UAAU;EACjD,IAAI,aAAa,OAAO;EAExB,IAAI;GACF,MAAM,SAAS,KAAK,SAAU,UAAU;GAGxC,OAAO,WAAW,OAAO,YAFZ,KAAK,MAAO,UACX,EAAK,MACkB,EAAM,KAAK,OAAO;EACzD,SAAS,KAAK;GACZ,OAAO,UAAU,QAAQ,GAAG,IAAI,IAAI,UAAU,OAAO,GAAG;EAC1D;CACF;AACF,CAAC;;;;;;;;;;;;;;;;;;;;;;;AAwBD,IAAa,oBAAoB,IAAI,KAAK;CACxC,MAAM;CACN,aACE;CACF,aAAa,UAAU,OAAO,EAC5B,OAAO,UACJ,OAAO,EACP,SAAS,EACT,YAAY,iFAA6E,EAC9F,CAAC;CACD,SAAS,OAAO,SAAS;EACvB,MAAM,EAAE,UAAU;EAElB,MAAM,cAAc,mBAAmB,KAAK;EAC5C,IAAI,aAAa,OAAO;EAExB,IAAI;GAIF,MAAM,WAAW,YAAY,KAAK;GAClC,IAAI,aAAa,MAAM,OAAO;GAG9B,OAAO,WADQ,cAAc,KACX;EACpB,SAAS,KAAK;GACZ,OAAO,UAAU,QAAQ,GAAG,IAAI,IAAI,UAAU,OAAO,GAAG;EAC1D;CACF;AACF,CAAC"}
+{"version":3,"file":"math.mjs","names":[],"sources":["../../../src/batteries/tools/math/index.ts"],"sourcesContent":["/**\n * Pre-constructed tools for safe arithmetic, expression evaluation, and numeric operations.\n *\n * @module @nhtio/adk/batteries/tools/math\n *\n * @remarks\n * Pre-constructed bundled tools for the `math` category. Import individually, the whole\n * category, or import every tool via `@nhtio/adk/batteries`.\n */\n\nimport { create, all } from 'mathjs'\nimport { Tool } from '@nhtio/adk/common'\nimport { validator } from '@nhtio/validation'\nimport { default as evaluatex } from 'evaluatex'\nimport { isError, isInstanceOf } from '@nhtio/adk/guards'\n\nconst math = create(all)\n\nconst BLOCKED_FUNCTIONS = [\n  'import',\n  'createUnit',\n  'simplify',\n  'derivative',\n  'compile',\n  'chain',\n  'reviver',\n  'replacer',\n]\n\nfor (const fn of BLOCKED_FUNCTIONS) {\n  if (fn in math) {\n    ;(math as any)[fn] = undefined\n  }\n}\n\nconst MAX_EXPRESSION_LENGTH = 1000\n\nfunction validateExpression(expr: string): string | undefined {\n  if (expr.length > MAX_EXPRESSION_LENGTH) {\n    return `Expression too long (max ${MAX_EXPRESSION_LENGTH} characters).`\n  }\n  return undefined\n}\n\n/**\n * EvaluateX scope providing constants and function aliases that evaluatex does not ship\n * out-of-the-box, matching the capabilities that were previously provided by the mathjs\n * translation layer.\n */\nconst EVALUATEX_SCOPE: Record<string, unknown> = {\n  // Mathematical constants\n  pi: Math.PI,\n  e: Math.E,\n  infinity: Infinity,\n  // Greek letters as named constants (matching LaTeX macro names)\n  alpha: undefined,\n  beta: undefined,\n  gamma: undefined,\n  delta: undefined,\n  epsilon: undefined,\n  theta: undefined,\n  lambda: undefined,\n  mu: undefined,\n  sigma: undefined,\n  tau: undefined,\n  phi: undefined,\n  omega: undefined,\n  // Function aliases — evaluatex uses log for natural log; provide ln as alias,\n  // plus common log bases and nthRoot for \\sqrt[n]{...}.\n  ln: Math.log,\n  log10: (x: number) => Math.log(x) / Math.LN10,\n  log2: (x: number) => Math.log(x) / Math.LN2,\n  nthRoot: (x: number, n: number) => Math.pow(x, 1 / n),\n  // Determinant (identity for scalars — det([a,b;c,d]) is not supported in the scalar path)\n  det: (x: number) => x,\n}\n\n/**\n * Translate a LaTeX/KaTeX expression to evaluatex-compatible syntax and evaluate it.\n *\n * The translation is a lightweight pass over the LaTeX source that handles common constructs\n * (frac, sqrt, trig, Greek macros, delimiters, etc.) and feeds the result to evaluatex with\n * a pre-built scope providing constants and function aliases. This replaces the previous\n * hand-rolled regex → mathjs pipeline.\n */\nfunction evaluateLatex(latex: string): number {\n  let expr = latex.trim()\n\n  // Strip display/inline math delimiters: $$...$$ or $...$\n  expr = expr.replace(/^\\$\\$?|\\$\\$?$/g, '')\n  // Strip \\[ ... \\] or \\( ... \\) delimiters\n  expr = expr.replace(/^\\\\[[(]|\\\\[\\])]$/g, '')\n\n  // ---- LaTeX command translation ----\n\n  // \\frac{a}{b} → (a)/(b) — iterates to handle nested fractions\n  for (let i = 0; i < 20; i++) {\n    const before = expr\n    expr = expr.replace(/\\\\frac\\s*\\{([^}]*)\\}\\s*\\{([^}]*)\\}/g, '($1)/($2)')\n    if (expr === before) break\n  }\n\n  // \\sqrt[n]{x} → nthRoot(x, n)\n  expr = expr.replace(/\\\\sqrt\\[([^\\]]+)\\]\\s*\\{([^}]*)\\}/g, 'nthRoot($2, $1)')\n  // \\sqrt{x} → sqrt(x)\n  expr = expr.replace(/\\\\sqrt\\s*\\{([^}]*)\\}/g, 'sqrt($1)')\n\n  // Inverse trig: \\arcsin → asin (evaluatex uses asin/acos/atan natively)\n  expr = expr.replace(/\\\\arcsin/g, 'asin')\n  expr = expr.replace(/\\\\arccos/g, 'acos')\n  expr = expr.replace(/\\\\arctan/g, 'atan')\n\n  // Strip backslash from known function macros: \\sin, \\cos, \\tan, \\cot, \\sec, \\csc,\n  // \\sinh, \\cosh, \\tanh, \\ln, \\log, \\exp, \\abs, etc.\n  expr = expr.replace(/\\\\(sin|cos|tan|cot|sec|csc|sinh|cosh|tanh|ln|log|exp|abs|det)/g, '$1')\n\n  // Subscript-based log: \\log_2(x) → log2(x), \\log_10(x) → log10(x), \\log_e(x) → ln(x), and a\n  // generic base \\log_b(arg) → (ln(arg)/ln(b)) via change of base. The argument is captured here\n  // (single level of nested parens) so the change-of-base form is well-formed — previously the\n  // argument was not captured and the output was the malformed `ln(/ln(b)`.\n  expr = expr.replace(\n    /log_\\{?(\\w+)\\}?\\(((?:[^()]|\\([^()]*\\))*)\\)/g,\n    (_, base: string, arg: string) => {\n      const baseLower = base.toLowerCase()\n      if (baseLower === '10') return `log10(${arg})`\n      if (baseLower === '2') return `log2(${arg})`\n      if (baseLower === 'e') return `ln(${arg})`\n      return `(ln(${arg})/ln(${base}))`\n    }\n  )\n  // Strip any remaining subscripts (e.g. x_1, a_n)\n  expr = expr.replace(/_\\{[^}]*\\}/g, '')\n  expr = expr.replace(/_\\w/g, '')\n\n  // Powers: ^{...} → ^(...)\n  expr = expr.replace(/\\^{([^{}]*)}/g, '^($1)')\n\n  // Greek letter macros\n  expr = expr.replace(/\\\\pi/g, 'pi')\n  expr = expr.replace(\n    /\\\\(alpha|beta|gamma|delta|epsilon|theta|lambda|mu|sigma|tau|phi|omega)/g,\n    '$1'\n  )\n\n  // Spacing and operators\n  expr = expr.replace(/\\\\cdot/g, '*')\n  expr = expr.replace(/\\\\times/g, '*')\n  expr = expr.replace(/\\\\div/g, '/')\n  expr = expr.replace(/\\\\infty/g, 'infinity')\n  expr = expr.replace(/\\\\left\\s*([([{|])/g, '$1')\n  expr = expr.replace(/\\\\right\\s*([)\\]}|])/g, '$1')\n  expr = expr.replace(/\\\\sum/g, 'sum')\n  expr = expr.replace(/\\\\prod/g, 'prod')\n  expr = expr.replace(/\\\\,/g, ' ')\n  expr = expr.replace(/\\\\;/g, ' ')\n  expr = expr.replace(/\\\\quad/g, ' ')\n  expr = expr.replace(/\\\\qquad/g, ' ')\n  // Strip \\text{...} blocks entirely\n  expr = expr.replace(/\\\\text\\{([^{}]*)\\}/g, '')\n\n  // Scientific notation: evaluatex doesn't understand `2e3` natively (it reads `e3` as a symbol),\n  // so rewrite a numeric literal's exponent into an explicit power: `2e3` → `(2*10^(3))`,\n  // `1.5e-8` → `(1.5*10^(-8))`. Done BEFORE implicit-multiplication insertion.\n  expr = expr.replace(/(\\d(?:\\.\\d+)?)[eE]([+-]?\\d+)/g, '($1*10^($2))')\n\n  // Implicit multiplication: 2x, 3(x+1), etc.\n  expr = expr.replace(/(\\d)([a-zA-Z(])/g, '$1*$2')\n  expr = expr.replace(/\\)\\s*\\(/g, ')*(')\n\n  // Collapse whitespace\n  expr = expr.replace(/\\s+/g, ' ').trim()\n\n  const fn = evaluatex(expr, EVALUATEX_SCOPE)\n  const result = fn()\n  if (typeof result !== 'number' || !Number.isFinite(result)) {\n    throw new Error('Result is not finite')\n  }\n  return result\n}\n\n/**\n * Lightweight LaTeX-to-string translator for internal use by the numeric calculus path.\n *\n * This is the same translation pass as {@link evaluateLatex}, but returns the translated string\n * (compatible with mathjs syntax) rather than evaluating it. Used by the calculus handlers to\n * convert integrands, function bodies, and bound expressions before passing them to\n * `math.evaluate` for specific-point evaluation.\n */\nfunction translateLatex(latex: string): string {\n  let expr = latex.trim()\n  expr = expr.replace(/^\\$\\$?|\\$\\$?$/g, '')\n  expr = expr.replace(/^\\\\[[(]|\\\\[\\])]$/g, '')\n\n  for (let i = 0; i < 20; i++) {\n    const before = expr\n    expr = expr.replace(/\\\\frac\\s*\\{([^}]*)\\}\\s*\\{([^}]*)\\}/g, '($1)/($2)')\n    if (expr === before) break\n  }\n\n  expr = expr.replace(/\\\\sqrt\\[([^\\]]+)\\]\\s*\\{([^}]*)\\}/g, 'nthRoot($2, $1)')\n  expr = expr.replace(/\\\\sqrt\\s*\\{([^}]*)\\}/g, 'sqrt($1)')\n\n  expr = expr.replace(/\\\\arcsin/g, 'asin')\n  expr = expr.replace(/\\\\arccos/g, 'acos')\n  expr = expr.replace(/\\\\arctan/g, 'atan')\n\n  expr = expr.replace(/\\\\(sin|cos|tan|cot|sec|csc|sinh|cosh|tanh|ln|log|exp|abs|det)/g, '$1')\n\n  expr = expr.replace(/log_\\{?(\\w+)\\}?\\s*\\(([^)]+)\\)/g, 'log($2, $1)')\n  expr = expr.replace(/\\^{([^{}]*)}/g, '^($1)')\n  expr = expr.replace(/_\\{[^{}]*\\}/g, '')\n  expr = expr.replace(/_\\w/g, '')\n\n  expr = expr.replace(/\\\\pi/g, 'pi')\n  expr = expr.replace(\n    /\\\\(alpha|beta|gamma|delta|epsilon|theta|lambda|mu|sigma|tau|phi|omega)/g,\n    '$1'\n  )\n\n  expr = expr.replace(/\\\\cdot/g, '*')\n  expr = expr.replace(/\\\\times/g, '*')\n  expr = expr.replace(/\\\\div/g, '/')\n  expr = expr.replace(/\\\\infty/g, 'Infinity')\n  expr = expr.replace(/\\\\left\\s*([([{|])/g, '$1')\n  expr = expr.replace(/\\\\right\\s*([)\\]}|])/g, '$1')\n  expr = expr.replace(/\\\\sum/g, 'sum')\n  expr = expr.replace(/\\\\prod/g, 'prod')\n  expr = expr.replace(/\\\\,/g, ' ')\n  expr = expr.replace(/\\\\;/g, ' ')\n  expr = expr.replace(/\\\\quad/g, ' ')\n  expr = expr.replace(/\\\\qquad/g, ' ')\n  expr = expr.replace(/\\\\text\\{([^{}]*)\\}/g, '')\n  expr = expr.replace(/(\\d)([a-zA-Z(])/g, '$1*$2')\n  expr = expr.replace(/\\)\\s*\\(/g, ')*(')\n  expr = expr.replace(/\\s+/g, ' ').trim()\n\n  return expr\n}\n\n// ─── Numeric calculus ─────────────────────────────────────────────────────────\n//\n// `evaluate_katex` is a numeric evaluator. mathjs has no symbolic integration, and its symbolic\n// `derivative` is intentionally blocklisted above, so calculus is computed NUMERICALLY: definite\n// integrals via composite Simpson quadrature, derivatives via central finite differences, and limits\n// via a two-sided approach. These are approximations (correct to ~1e-9 for the smooth expressions a\n// model emits), surfaced under a `Result (numeric):` label so the distinction is explicit.\n//\n// Detection runs on the RAW LaTeX, before `translateLatex` flattens it — its subscript stripping\n// would otherwise destroy integral bounds (`\\int_{0}^{1}` → `\\int^(1)`) and limit targets. The\n// extracted sub-expressions (integrand, bounds, body, point) are then translated by the existing\n// `translateLatex` and evaluated per-point with a scope, which works under the security blocklist.\n\n/** A tagged error whose message is surfaced to the model verbatim (caught by {@link tryCalculus}). */\nclass CalculusError extends Error {}\n\n/** Evaluate a mathjs expression at a single point, guarding against non-finite results. */\nfunction evalAt(expr: string, varName: string, x: number): number {\n  const y = math.evaluate!(expr, { [varName]: x })\n  if (typeof y !== 'number' || !Number.isFinite(y)) {\n    throw new CalculusError('NON_FINITE')\n  }\n  return y\n}\n\n/** Composite Simpson's rule over a finite interval. Throws {@link CalculusError} on a singularity. */\nfunction simpson(fn: (x: number) => number, a: number, b: number, n = 1000): number {\n  if (n % 2 === 1) n++\n  const h = (b - a) / n\n  let sum = fn(a) + fn(b)\n  for (let i = 1; i < n; i++) {\n    sum += (i % 2 === 1 ? 4 : 2) * fn(a + i * h)\n  }\n  const result = (h / 3) * sum\n  if (!Number.isFinite(result)) throw new CalculusError('NON_FINITE')\n  return result\n}\n\n/** Round numeric output to 12 significant digits, collapsing floating-point noise. */\nfunction formatNumeric(n: number): string {\n  // Snap values that are zero-to-within-tolerance to exactly 0 (e.g. lim_{x->inf} 1/x ≈ 1e-8).\n  if (Math.abs(n) < 1e-9) return '0'\n  return math.format!(n, { precision: 12 })\n}\n\n/**\n * Reads a single `_`/`^` script starting at `i`, supporting braced (`_{0}`, `^{\\pi}`), command\n * (`^\\pi`), and bare-token (`_0`, `^1`) forms. Returns the mark, its raw-LaTeX value, and the next\n * index, or `null` when there is no script at `i`.\n */\nfunction readScript(s: string, i: number): { mark: '_' | '^'; val: string; next: number } | null {\n  while (s[i] === ' ') i++\n  const mark = s[i]\n  if (mark !== '_' && mark !== '^') return null\n  i++\n  while (s[i] === ' ') i++\n  if (s[i] === '{') {\n    let depth = 0\n    const start = ++i\n    for (; i < s.length; i++) {\n      if (s[i] === '{') depth++\n      else if (s[i] === '}') {\n        if (depth === 0) break\n        depth--\n      }\n    }\n    return { mark, val: s.slice(start, i), next: i + 1 }\n  }\n  if (s[i] === '\\\\') {\n    const m = /^\\\\[a-zA-Z]+/.exec(s.slice(i))\n    if (!m) return null\n    return { mark, val: m[0], next: i + m[0].length }\n  }\n  const m = /^[A-Za-z0-9.]+/.exec(s.slice(i))\n  if (!m) return null\n  return { mark, val: m[0], next: i + m[0].length }\n}\n\n/** Translate a raw-LaTeX bound/target fragment and evaluate it to a finite number. */\nfunction evalBound(latex: string): number {\n  const trimmed = latex.trim()\n  if (/\\\\infty/.test(trimmed)) throw new CalculusError('INFINITE_BOUND')\n  const mathjsExpr = translateLatex(trimmed)\n  const value = math.evaluate!(mathjsExpr)\n  if (typeof value !== 'number' || !Number.isFinite(value)) {\n    throw new CalculusError('BAD_BOUND')\n  }\n  return value\n}\n\n/** Evaluate a definite integral `\\int_{a}^{b} f \\,dx` by Simpson quadrature. */\nfunction evalIntegral(s: string): string {\n  // Strip the operator (\\int, optionally with \\limits).\n  const m = /\\\\int(?:\\\\limits)?/.exec(s)\n  if (!m) throw new CalculusError('NOT_INTEGRAL')\n  let i = m.index + m[0].length\n\n  // Read up to two scripts (bounds), in either order.\n  const scripts: Record<'_' | '^', string | undefined> = { '_': undefined, '^': undefined }\n  for (let k = 0; k < 2; k++) {\n    const sc = readScript(s, i)\n    if (!sc) break\n    scripts[sc.mark] = sc.val\n    i = sc.next\n  }\n  if (scripts._ === undefined || scripts['^'] === undefined) {\n    throw new CalculusError('INDEFINITE')\n  }\n\n  // The remainder is `integrand … d<var>`. Pull the trailing differential off the end.\n  const rest = s.slice(i)\n  const diff = /\\\\?,?\\s*\\bd\\s*([a-zA-Z])\\s*$/.exec(rest)\n  if (!diff) throw new CalculusError('NO_DIFFERENTIAL')\n  const variable = diff[1]\n  const integrandLatex = rest.slice(0, diff.index)\n  if (integrandLatex.trim().length === 0) throw new CalculusError('NO_INTEGRAND')\n\n  const a = evalBound(scripts._)\n  const b = evalBound(scripts['^'])\n  const integrand = translateLatex(integrandLatex)\n  const fn = (x: number) => evalAt(integrand, variable, x)\n\n  let result: number\n  if (a === b) result = 0\n  else if (a < b) result = simpson(fn, a, b)\n  else result = -simpson(fn, b, a)\n\n  return `Converted: ∫(${integrand}) d${variable} from ${formatNumeric(a)} to ${formatNumeric(b)}\\nResult (numeric): ${formatNumeric(result)}`\n}\n\n/** Evaluate a derivative `\\frac{d}{dx} f \\big|_{x=a}` at a point via central finite difference. */\nfunction evalDerivative(s: string): string {\n  // Operator + variable: \\frac{d}{dx} … or bare d/dx ….\n  let variable: string | undefined\n  let body = s\n  const fracOp = /\\\\frac\\s*\\{\\s*d\\s*\\}\\s*\\{\\s*d\\s*([a-zA-Z])\\s*\\}/.exec(s)\n  if (fracOp) {\n    variable = fracOp[1]\n    body = s.slice(fracOp.index + fracOp[0].length)\n  } else {\n    const bareOp = /(?:^|[^a-zA-Z])d\\s*\\/\\s*d([a-zA-Z])/.exec(s)\n    if (bareOp) {\n      variable = bareOp[1]\n      body = s.slice(bareOp.index + bareOp[0].length)\n    }\n  }\n  if (!variable) throw new CalculusError('NOT_DERIVATIVE')\n\n  // Remove pure \\left. / \\right. delimiters.\n  body = body.replace(/\\\\left\\.?/g, '').replace(/\\\\right\\.?/g, '')\n\n  // Evaluation bar + point at the end: …|_{x=3} (optionally \\Big| etc.).\n  const bar = /\\\\?(?:Big|big|bigg|Bigg)?\\s*\\|\\s*_\\s*\\{?\\s*([a-zA-Z])\\s*=\\s*([^}]+?)\\s*\\}?\\s*$/.exec(\n    body\n  )\n  if (!bar) throw new CalculusError('NO_POINT')\n  const point = evalBound(bar[2])\n  let fnLatex = body.slice(0, bar.index).trim()\n\n  // Strip one layer of wrapping parentheses/brackets around the function body.\n  fnLatex = fnLatex\n    .replace(/^\\\\?\\(([\\s\\S]*)\\\\?\\)$/, '$1')\n    .replace(/^\\[([\\s\\S]*)\\]$/, '$1')\n    .trim()\n  if (fnLatex.length === 0) throw new CalculusError('NO_FUNCTION')\n\n  const expr = translateLatex(fnLatex)\n  const h = 1e-6\n  const fn = (x: number) => evalAt(expr, variable, x)\n  const result = (fn(point + h) - fn(point - h)) / (2 * h)\n  if (!Number.isFinite(result)) throw new CalculusError('NON_FINITE')\n\n  return `Converted: d/d${variable}(${expr}) at ${variable}=${formatNumeric(point)}\\nResult (numeric): ${formatNumeric(result)}`\n}\n\n/** Evaluate a limit `\\lim_{x \\to a} f(x)` by a two-sided numeric approach. */\nfunction evalLimit(s: string): string {\n  const head = /\\\\lim\\s*_\\s*\\{\\s*([a-zA-Z])\\s*\\\\to\\s*([\\s\\S]+?)\\s*\\}/.exec(s)\n  if (!head) throw new CalculusError('NOT_LIMIT')\n  const variable = head[1]\n  let targetLatex = head[2].trim()\n  const bodyLatex = s.slice(head.index + head[0].length).trim()\n  if (bodyLatex.length === 0) throw new CalculusError('NO_FUNCTION')\n\n  // One-sided markers (0^+, 0^-, 0^{+}) — record the side, strip the marker.\n  let side: 'both' | 'plus' | 'minus' = 'both'\n  const oneSided = /\\^\\s*\\{?\\s*([+-])\\s*\\}?\\s*$/.exec(targetLatex)\n  if (oneSided) {\n    side = oneSided[1] === '+' ? 'plus' : 'minus'\n    targetLatex = targetLatex.slice(0, oneSided.index).trim()\n  }\n\n  const expr = translateLatex(bodyLatex)\n  const fn = (x: number) => evalAt(expr, variable, x)\n  const eps = 1e-6\n\n  // Infinite targets via large-magnitude substitution.\n  let result: number\n  let targetLabel: string\n  if (/^-\\s*\\\\infty$/.test(targetLatex)) {\n    result = fn(-1e8)\n    targetLabel = '-∞'\n  } else if (/^\\\\infty$/.test(targetLatex)) {\n    result = fn(1e8)\n    targetLabel = '∞'\n  } else {\n    const target = evalBound(targetLatex)\n    targetLabel = formatNumeric(target)\n    if (side === 'plus') {\n      result = fn(target + eps)\n    } else if (side === 'minus') {\n      result = fn(target - eps)\n    } else {\n      const lo = fn(target - eps)\n      const hi = fn(target + eps)\n      const avg = (lo + hi) / 2\n      if (Math.abs(hi - lo) > 1e-3 * Math.max(1, Math.abs(avg))) {\n        throw new CalculusError('LIMIT_MISMATCH')\n      }\n      result = avg\n    }\n  }\n  if (!Number.isFinite(result)) throw new CalculusError('LIMIT_UNBOUNDED')\n\n  // Infinite-target substitution (±1e8) and the eps offset leave more residue than Simpson or the\n  // derivative difference, so snap a limit result to a nearby round value before formatting:\n  // 0.99999998 → 1, 1e-8 → 0. The tolerance is loose enough to absorb the substitution error yet\n  // far tighter than the divergence check that already rejected genuinely non-convergent limits.\n  const nearest = Math.round(result)\n  if (Math.abs(result - nearest) < 1e-6) result = nearest\n\n  return `Converted: lim ${variable}→${targetLabel} of (${expr})\\nResult (numeric): ${formatNumeric(result)}`\n}\n\n/** Human-readable, model-actionable message for each {@link CalculusError} tag. */\nfunction calculusErrorMessage(tag: string): string {\n  switch (tag) {\n    case 'INDEFINITE':\n      return 'Cannot evaluate an indefinite integral numerically. Provide bounds, e.g. \\\\int_{0}^{1} x dx.'\n    case 'NO_DIFFERENTIAL':\n      return \"Could not find the integration variable. Expected a trailing differential like 'dx'.\"\n    case 'NO_INTEGRAND':\n      return 'The integral has no integrand to evaluate.'\n    case 'INFINITE_BOUND':\n      return 'Infinite integration bounds are not supported. Provide finite numeric bounds, e.g. \\\\int_{0}^{1} f dx.'\n    case 'BAD_BOUND':\n      return 'Could not evaluate the integration bounds to numbers.'\n    case 'NO_POINT':\n      return 'Cannot evaluate a derivative numerically without a point. Specify where, e.g. \\\\frac{d}{dx}(x^2)\\\\Big|_{x=3}.'\n    case 'NO_FUNCTION':\n      return 'Could not find the function to evaluate.'\n    case 'LIMIT_MISMATCH':\n      return 'The limit may not exist (left and right values disagree).'\n    case 'LIMIT_UNBOUNDED':\n      return 'The limit appears to diverge (function is unbounded near the target).'\n    case 'NON_FINITE':\n      return 'The expression is not finite over the requested range (possible singularity); cannot evaluate numerically.'\n    default:\n      return 'Could not evaluate the calculus expression.'\n  }\n}\n\n/**\n * Detects a calculus construct in raw LaTeX and routes it to the matching numeric handler. Returns\n * the result/error string, or `null` when the input is not a calculus expression (so the caller\n * falls through to the scalar evaluation path unchanged).\n */\nfunction tryCalculus(latex: string): string | null {\n  let s = latex.trim()\n  s = s.replace(/^\\$\\$?|\\$\\$?$/g, '')\n  s = s.replace(/^\\\\[[(]|\\\\[\\])]$/g, '').trim()\n\n  let handler: ((expr: string) => string) | undefined\n  if (/\\\\int/.test(s)) handler = evalIntegral\n  else if (/\\\\lim/.test(s)) handler = evalLimit\n  else if (\n    /\\\\frac\\s*\\{\\s*d\\s*\\}\\s*\\{\\s*d\\s*[a-zA-Z]\\s*\\}/.test(s) ||\n    /(?:^|[^a-zA-Z])d\\s*\\/\\s*d[a-zA-Z]/.test(s)\n  )\n    handler = evalDerivative\n  if (!handler) return null\n\n  try {\n    return handler(s)\n  } catch (err) {\n    if (isInstanceOf(err, 'CalculusError', CalculusError)) {\n      return `Error: ${calculusErrorMessage(err.message)}`\n    }\n    return `Error: ${isError(err) ? err.message : String(err)}`\n  }\n}\n\n/**\n * Evaluates a mathjs-syntax expression and returns the numeric result alongside the KaTeX\n * representation of the parsed expression.\n *\n * @remarks\n * Supports arithmetic, trigonometric, logarithmic, exponential, factorial, matrix, and unit\n * operations via `mathjs`. The mathjs instance is hardened: dangerous functions (`import`,\n * `createUnit`, `simplify`, `derivative`, `compile`, `chain`, `reviver`, `replacer`) are\n * disabled to prevent interpreter-surface exposure.\n *\n * Expressions over 1000 characters are rejected with an error string (not thrown). Parse and\n * evaluation errors are also returned as error strings — the tool surfaces math errors as\n * content rather than exceptions, so the model can react to them in-line.\n */\nexport const calculateTool = new Tool({\n  name: 'calculate',\n  description:\n    'Evaluate a math expression. Supports arithmetic, trig, log, sqrt, factorial, matrices.',\n  inputSchema: validator.object({\n    expression: validator.string().required().description('Math expression, e.g. \"sin(pi/4) + 5!\"'),\n  }),\n  handler: async (args) => {\n    const { expression } = args as { expression: string }\n\n    const lengthError = validateExpression(expression)\n    if (lengthError) return lengthError\n\n    try {\n      const result = math.evaluate!(expression)\n      // A scalar that overflowed float64 (e.g. `2^5000`, `factorial(200)`) comes back as\n      // `Infinity`/`NaN`. Surface that as a clear error rather than printing `Result: Infinity`,\n      // which reads like a genuine answer.\n      if (typeof result === 'number' && !Number.isFinite(result)) {\n        return `Error: result is not finite (${result}) — the value overflows JavaScript's numeric range.`\n      }\n      const node = math.parse!(expression)\n      const katex = node.toTex()\n      return `Result: ${result}\\nKaTeX: $${katex} = ${result}$`\n    } catch (err) {\n      return `Error: ${isError(err) ? err.message : String(err)}`\n    }\n  },\n})\n\n/**\n * Translates a LaTeX/KaTeX expression using evaluatex and returns the numeric result.\n *\n * @remarks\n * Uses the evaluatex library to parse and evaluate LaTeX expressions. Handles common constructs\n * (`\\frac{a}{b}`, `\\sqrt{...}`, `\\cdot`, `\\times`, Greek macros like `\\pi`, inverse trig,\n * `\\left`/`\\right` delimiters, `\\text{...}`, subscripts, etc.) with a proper parser rather than\n * brittle regex.\n *\n * Also evaluates three calculus constructs **numerically** (mathjs has no symbolic integration, and\n * its symbolic `derivative` is blocklisted here for safety):\n * - Definite integrals — `\\int_{a}^{b} f \\,dx` via composite Simpson quadrature.\n * - Derivatives at a point — `\\frac{d}{dx} f \\big|_{x=a}` via central finite difference.\n * - Limits — `\\lim_{x \\to a} f` (including `a = \\pm\\infty`) via a two-sided numeric approach.\n *\n * Numeric results are rounded with `math.format(..., { precision: 12 })` and labelled\n * `Result (numeric):` to flag that they are approximations. Constructs that cannot be evaluated\n * numerically (indefinite integrals, derivatives without a point, infinite integration bounds,\n * singular integrands, divergent limits) return a specific, guiding error string.\n *\n * Parse and evaluation errors are returned as error strings rather than thrown.\n */\nexport const evaluateKatexTool = new Tool({\n  name: 'evaluate_katex',\n  description:\n    'Evaluate a KaTeX/LaTeX math expression and return the numeric result. Supports arithmetic, trig, logs, roots, and numeric calculus: definite integrals (\\\\int_{a}^{b} f dx), derivatives at a point (\\\\frac{d}{dx} f|_{x=a}), and limits (\\\\lim_{x \\\\to a} f).',\n  inputSchema: validator.object({\n    katex: validator\n      .string()\n      .required()\n      .description('LaTeX expression, e.g. \"\\\\frac{1}{2} + \\\\sqrt{9}\" or \"\\\\int_{0}^{1} x^2 dx\"'),\n  }),\n  handler: async (args) => {\n    const { katex } = args as { katex: string }\n\n    const lengthError = validateExpression(katex)\n    if (lengthError) return lengthError\n\n    try {\n      // Calculus (\\int, \\lim, d/dx) is detected on the raw LaTeX and evaluated numerically before\n      // the scalar flattening path, which would otherwise mangle bounds/targets. Returns null for\n      // non-calculus input, falling through to the scalar evaluator below unchanged.\n      const calculus = tryCalculus(katex)\n      if (calculus !== null) return calculus\n\n      const result = evaluateLatex(katex)\n      return `Result: ${result}`\n    } catch (err) {\n      return `Error: ${isError(err) ? err.message : String(err)}`\n    }\n  },\n})\n"],"mappings":";;;;;;;;;;;;;;;;;AAgBA,IAAM,OAAO,OAAO,GAAG;AAavB,KAAK,MAAM,MAAM;CAVf;CACA;CACA;CACA;CACA;CACA;CACA;CACA;AAGe,GACf,IAAI,MAAM,MACP,KAAc,MAAM,KAAA;AAIzB,IAAM,wBAAwB;AAE9B,SAAS,mBAAmB,MAAkC;CAC5D,IAAI,KAAK,SAAS,uBAChB,OAAO,4BAA4B,sBAAsB;AAG7D;;;;;;AAOA,IAAM,kBAA2C;CAE/C,IAAI,KAAK;CACT,GAAG,KAAK;CACR,UAAU;CAEV,OAAO,KAAA;CACP,MAAM,KAAA;CACN,OAAO,KAAA;CACP,OAAO,KAAA;CACP,SAAS,KAAA;CACT,OAAO,KAAA;CACP,QAAQ,KAAA;CACR,IAAI,KAAA;CACJ,OAAO,KAAA;CACP,KAAK,KAAA;CACL,KAAK,KAAA;CACL,OAAO,KAAA;CAGP,IAAI,KAAK;CACT,QAAQ,MAAc,KAAK,IAAI,CAAC,IAAI,KAAK;CACzC,OAAO,MAAc,KAAK,IAAI,CAAC,IAAI,KAAK;CACxC,UAAU,GAAW,MAAc,KAAK,IAAI,GAAG,IAAI,CAAC;CAEpD,MAAM,MAAc;AACtB;;;;;;;;;AAUA,SAAS,cAAc,OAAuB;CAC5C,IAAI,OAAO,MAAM,KAAK;CAGtB,OAAO,KAAK,QAAQ,kBAAkB,EAAE;CAExC,OAAO,KAAK,QAAQ,qBAAqB,EAAE;CAK3C,KAAK,IAAI,IAAI,GAAG,IAAI,IAAI,KAAK;EAC3B,MAAM,SAAS;EACf,OAAO,KAAK,QAAQ,uCAAuC,WAAW;EACtE,IAAI,SAAS,QAAQ;CACvB;CAGA,OAAO,KAAK,QAAQ,qCAAqC,iBAAiB;CAE1E,OAAO,KAAK,QAAQ,yBAAyB,UAAU;CAGvD,OAAO,KAAK,QAAQ,aAAa,MAAM;CACvC,OAAO,KAAK,QAAQ,aAAa,MAAM;CACvC,OAAO,KAAK,QAAQ,aAAa,MAAM;CAIvC,OAAO,KAAK,QAAQ,kEAAkE,IAAI;CAM1F,OAAO,KAAK,QACV,gDACC,GAAG,MAAc,QAAgB;EAChC,MAAM,YAAY,KAAK,YAAY;EACnC,IAAI,cAAc,MAAM,OAAO,SAAS,IAAI;EAC5C,IAAI,cAAc,KAAK,OAAO,QAAQ,IAAI;EAC1C,IAAI,cAAc,KAAK,OAAO,MAAM,IAAI;EACxC,OAAO,OAAO,IAAI,OAAO,KAAK;CAChC,CACF;CAEA,OAAO,KAAK,QAAQ,eAAe,EAAE;CACrC,OAAO,KAAK,QAAQ,QAAQ,EAAE;CAG9B,OAAO,KAAK,QAAQ,iBAAiB,OAAO;CAG5C,OAAO,KAAK,QAAQ,SAAS,IAAI;CACjC,OAAO,KAAK,QACV,2EACA,IACF;CAGA,OAAO,KAAK,QAAQ,WAAW,GAAG;CAClC,OAAO,KAAK,QAAQ,YAAY,GAAG;CACnC,OAAO,KAAK,QAAQ,UAAU,GAAG;CACjC,OAAO,KAAK,QAAQ,YAAY,UAAU;CAC1C,OAAO,KAAK,QAAQ,sBAAsB,IAAI;CAC9C,OAAO,KAAK,QAAQ,wBAAwB,IAAI;CAChD,OAAO,KAAK,QAAQ,UAAU,KAAK;CACnC,OAAO,KAAK,QAAQ,WAAW,MAAM;CACrC,OAAO,KAAK,QAAQ,QAAQ,GAAG;CAC/B,OAAO,KAAK,QAAQ,QAAQ,GAAG;CAC/B,OAAO,KAAK,QAAQ,WAAW,GAAG;CAClC,OAAO,KAAK,QAAQ,YAAY,GAAG;CAEnC,OAAO,KAAK,QAAQ,uBAAuB,EAAE;CAK7C,OAAO,KAAK,QAAQ,iCAAiC,cAAc;CAGnE,OAAO,KAAK,QAAQ,oBAAoB,OAAO;CAC/C,OAAO,KAAK,QAAQ,YAAY,KAAK;CAGrC,OAAO,KAAK,QAAQ,QAAQ,GAAG,EAAE,KAAK;CAGtC,MAAM,SADK,UAAU,MAAM,eACZ,EAAG;CAClB,IAAI,OAAO,WAAW,YAAY,CAAC,OAAO,SAAS,MAAM,GACvD,MAAM,IAAI,MAAM,sBAAsB;CAExC,OAAO;AACT;;;;;;;;;AAUA,SAAS,eAAe,OAAuB;CAC7C,IAAI,OAAO,MAAM,KAAK;CACtB,OAAO,KAAK,QAAQ,kBAAkB,EAAE;CACxC,OAAO,KAAK,QAAQ,qBAAqB,EAAE;CAE3C,KAAK,IAAI,IAAI,GAAG,IAAI,IAAI,KAAK;EAC3B,MAAM,SAAS;EACf,OAAO,KAAK,QAAQ,uCAAuC,WAAW;EACtE,IAAI,SAAS,QAAQ;CACvB;CAEA,OAAO,KAAK,QAAQ,qCAAqC,iBAAiB;CAC1E,OAAO,KAAK,QAAQ,yBAAyB,UAAU;CAEvD,OAAO,KAAK,QAAQ,aAAa,MAAM;CACvC,OAAO,KAAK,QAAQ,aAAa,MAAM;CACvC,OAAO,KAAK,QAAQ,aAAa,MAAM;CAEvC,OAAO,KAAK,QAAQ,kEAAkE,IAAI;CAE1F,OAAO,KAAK,QAAQ,kCAAkC,aAAa;CACnE,OAAO,KAAK,QAAQ,iBAAiB,OAAO;CAC5C,OAAO,KAAK,QAAQ,gBAAgB,EAAE;CACtC,OAAO,KAAK,QAAQ,QAAQ,EAAE;CAE9B,OAAO,KAAK,QAAQ,SAAS,IAAI;CACjC,OAAO,KAAK,QACV,2EACA,IACF;CAEA,OAAO,KAAK,QAAQ,WAAW,GAAG;CAClC,OAAO,KAAK,QAAQ,YAAY,GAAG;CACnC,OAAO,KAAK,QAAQ,UAAU,GAAG;CACjC,OAAO,KAAK,QAAQ,YAAY,UAAU;CAC1C,OAAO,KAAK,QAAQ,sBAAsB,IAAI;CAC9C,OAAO,KAAK,QAAQ,wBAAwB,IAAI;CAChD,OAAO,KAAK,QAAQ,UAAU,KAAK;CACnC,OAAO,KAAK,QAAQ,WAAW,MAAM;CACrC,OAAO,KAAK,QAAQ,QAAQ,GAAG;CAC/B,OAAO,KAAK,QAAQ,QAAQ,GAAG;CAC/B,OAAO,KAAK,QAAQ,WAAW,GAAG;CAClC,OAAO,KAAK,QAAQ,YAAY,GAAG;CACnC,OAAO,KAAK,QAAQ,uBAAuB,EAAE;CAC7C,OAAO,KAAK,QAAQ,oBAAoB,OAAO;CAC/C,OAAO,KAAK,QAAQ,YAAY,KAAK;CACrC,OAAO,KAAK,QAAQ,QAAQ,GAAG,EAAE,KAAK;CAEtC,OAAO;AACT;;AAgBA,IAAM,gBAAN,cAA4B,MAAM,CAAC;;AAGnC,SAAS,OAAO,MAAc,SAAiB,GAAmB;CAChE,MAAM,IAAI,KAAK,SAAU,MAAM,GAAG,UAAU,EAAE,CAAC;CAC/C,IAAI,OAAO,MAAM,YAAY,CAAC,OAAO,SAAS,CAAC,GAC7C,MAAM,IAAI,cAAc,YAAY;CAEtC,OAAO;AACT;;AAGA,SAAS,QAAQ,IAA2B,GAAW,GAAW,IAAI,KAAc;CAClF,IAAI,IAAI,MAAM,GAAG;CACjB,MAAM,KAAK,IAAI,KAAK;CACpB,IAAI,MAAM,GAAG,CAAC,IAAI,GAAG,CAAC;CACtB,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KACrB,QAAQ,IAAI,MAAM,IAAI,IAAI,KAAK,GAAG,IAAI,IAAI,CAAC;CAE7C,MAAM,SAAU,IAAI,IAAK;CACzB,IAAI,CAAC,OAAO,SAAS,MAAM,GAAG,MAAM,IAAI,cAAc,YAAY;CAClE,OAAO;AACT;;AAGA,SAAS,cAAc,GAAmB;CAExC,IAAI,KAAK,IAAI,CAAC,IAAI,MAAM,OAAO;CAC/B,OAAO,KAAK,OAAQ,GAAG,EAAE,WAAW,GAAG,CAAC;AAC1C;;;;;;AAOA,SAAS,WAAW,GAAW,GAAkE;CAC/F,OAAO,EAAE,OAAO,KAAK;CACrB,MAAM,OAAO,EAAE;CACf,IAAI,SAAS,OAAO,SAAS,KAAK,OAAO;CACzC;CACA,OAAO,EAAE,OAAO,KAAK;CACrB,IAAI,EAAE,OAAO,KAAK;EAChB,IAAI,QAAQ;EACZ,MAAM,QAAQ,EAAE;EAChB,OAAO,IAAI,EAAE,QAAQ,KACnB,IAAI,EAAE,OAAO,KAAK;OACb,IAAI,EAAE,OAAO,KAAK;GACrB,IAAI,UAAU,GAAG;GACjB;EACF;EAEF,OAAO;GAAE;GAAM,KAAK,EAAE,MAAM,OAAO,CAAC;GAAG,MAAM,IAAI;EAAE;CACrD;CACA,IAAI,EAAE,OAAO,MAAM;EACjB,MAAM,IAAI,eAAe,KAAK,EAAE,MAAM,CAAC,CAAC;EACxC,IAAI,CAAC,GAAG,OAAO;EACf,OAAO;GAAE;GAAM,KAAK,EAAE;GAAI,MAAM,IAAI,EAAE,GAAG;EAAO;CAClD;CACA,MAAM,IAAI,iBAAiB,KAAK,EAAE,MAAM,CAAC,CAAC;CAC1C,IAAI,CAAC,GAAG,OAAO;CACf,OAAO;EAAE;EAAM,KAAK,EAAE;EAAI,MAAM,IAAI,EAAE,GAAG;CAAO;AAClD;;AAGA,SAAS,UAAU,OAAuB;CACxC,MAAM,UAAU,MAAM,KAAK;CAC3B,IAAI,UAAU,KAAK,OAAO,GAAG,MAAM,IAAI,cAAc,gBAAgB;CACrE,MAAM,aAAa,eAAe,OAAO;CACzC,MAAM,QAAQ,KAAK,SAAU,UAAU;CACvC,IAAI,OAAO,UAAU,YAAY,CAAC,OAAO,SAAS,KAAK,GACrD,MAAM,IAAI,cAAc,WAAW;CAErC,OAAO;AACT;;AAGA,SAAS,aAAa,GAAmB;CAEvC,MAAM,IAAI,qBAAqB,KAAK,CAAC;CACrC,IAAI,CAAC,GAAG,MAAM,IAAI,cAAc,cAAc;CAC9C,IAAI,IAAI,EAAE,QAAQ,EAAE,GAAG;CAGvB,MAAM,UAAiD;EAAE,KAAK,KAAA;EAAW,KAAK,KAAA;CAAU;CACxF,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK;EAC1B,MAAM,KAAK,WAAW,GAAG,CAAC;EAC1B,IAAI,CAAC,IAAI;EACT,QAAQ,GAAG,QAAQ,GAAG;EACtB,IAAI,GAAG;CACT;CACA,IAAI,QAAQ,MAAM,KAAA,KAAa,QAAQ,SAAS,KAAA,GAC9C,MAAM,IAAI,cAAc,YAAY;CAItC,MAAM,OAAO,EAAE,MAAM,CAAC;CACtB,MAAM,OAAO,+BAA+B,KAAK,IAAI;CACrD,IAAI,CAAC,MAAM,MAAM,IAAI,cAAc,iBAAiB;CACpD,MAAM,WAAW,KAAK;CACtB,MAAM,iBAAiB,KAAK,MAAM,GAAG,KAAK,KAAK;CAC/C,IAAI,eAAe,KAAK,EAAE,WAAW,GAAG,MAAM,IAAI,cAAc,cAAc;CAE9E,MAAM,IAAI,UAAU,QAAQ,CAAC;CAC7B,MAAM,IAAI,UAAU,QAAQ,IAAI;CAChC,MAAM,YAAY,eAAe,cAAc;CAC/C,MAAM,MAAM,MAAc,OAAO,WAAW,UAAU,CAAC;CAEvD,IAAI;CACJ,IAAI,MAAM,GAAG,SAAS;MACjB,IAAI,IAAI,GAAG,SAAS,QAAQ,IAAI,GAAG,CAAC;MACpC,SAAS,CAAC,QAAQ,IAAI,GAAG,CAAC;CAE/B,OAAO,gBAAgB,UAAU,KAAK,SAAS,QAAQ,cAAc,CAAC,EAAE,MAAM,cAAc,CAAC,EAAE,sBAAsB,cAAc,MAAM;AAC3I;;AAGA,SAAS,eAAe,GAAmB;CAEzC,IAAI;CACJ,IAAI,OAAO;CACX,MAAM,SAAS,kDAAkD,KAAK,CAAC;CACvE,IAAI,QAAQ;EACV,WAAW,OAAO;EAClB,OAAO,EAAE,MAAM,OAAO,QAAQ,OAAO,GAAG,MAAM;CAChD,OAAO;EACL,MAAM,SAAS,sCAAsC,KAAK,CAAC;EAC3D,IAAI,QAAQ;GACV,WAAW,OAAO;GAClB,OAAO,EAAE,MAAM,OAAO,QAAQ,OAAO,GAAG,MAAM;EAChD;CACF;CACA,IAAI,CAAC,UAAU,MAAM,IAAI,cAAc,gBAAgB;CAGvD,OAAO,KAAK,QAAQ,cAAc,EAAE,EAAE,QAAQ,eAAe,EAAE;CAG/D,MAAM,MAAM,iFAAiF,KAC3F,IACF;CACA,IAAI,CAAC,KAAK,MAAM,IAAI,cAAc,UAAU;CAC5C,MAAM,QAAQ,UAAU,IAAI,EAAE;CAC9B,IAAI,UAAU,KAAK,MAAM,GAAG,IAAI,KAAK,EAAE,KAAK;CAG5C,UAAU,QACP,QAAQ,yBAAyB,IAAI,EACrC,QAAQ,mBAAmB,IAAI,EAC/B,KAAK;CACR,IAAI,QAAQ,WAAW,GAAG,MAAM,IAAI,cAAc,aAAa;CAE/D,MAAM,OAAO,eAAe,OAAO;CACnC,MAAM,IAAI;CACV,MAAM,MAAM,MAAc,OAAO,MAAM,UAAU,CAAC;CAClD,MAAM,UAAU,GAAG,QAAQ,CAAC,IAAI,GAAG,QAAQ,CAAC,MAAM,IAAI;CACtD,IAAI,CAAC,OAAO,SAAS,MAAM,GAAG,MAAM,IAAI,cAAc,YAAY;CAElE,OAAO,iBAAiB,SAAS,GAAG,KAAK,OAAO,SAAS,GAAG,cAAc,KAAK,EAAE,sBAAsB,cAAc,MAAM;AAC7H;;AAGA,SAAS,UAAU,GAAmB;CACpC,MAAM,OAAO,uDAAuD,KAAK,CAAC;CAC1E,IAAI,CAAC,MAAM,MAAM,IAAI,cAAc,WAAW;CAC9C,MAAM,WAAW,KAAK;CACtB,IAAI,cAAc,KAAK,GAAG,KAAK;CAC/B,MAAM,YAAY,EAAE,MAAM,KAAK,QAAQ,KAAK,GAAG,MAAM,EAAE,KAAK;CAC5D,IAAI,UAAU,WAAW,GAAG,MAAM,IAAI,cAAc,aAAa;CAGjE,IAAI,OAAkC;CACtC,MAAM,WAAW,8BAA8B,KAAK,WAAW;CAC/D,IAAI,UAAU;EACZ,OAAO,SAAS,OAAO,MAAM,SAAS;EACtC,cAAc,YAAY,MAAM,GAAG,SAAS,KAAK,EAAE,KAAK;CAC1D;CAEA,MAAM,OAAO,eAAe,SAAS;CACrC,MAAM,MAAM,MAAc,OAAO,MAAM,UAAU,CAAC;CAClD,MAAM,MAAM;CAGZ,IAAI;CACJ,IAAI;CACJ,IAAI,gBAAgB,KAAK,WAAW,GAAG;EACrC,SAAS,GAAG,IAAI;EAChB,cAAc;CAChB,OAAO,IAAI,YAAY,KAAK,WAAW,GAAG;EACxC,SAAS,GAAG,GAAG;EACf,cAAc;CAChB,OAAO;EACL,MAAM,SAAS,UAAU,WAAW;EACpC,cAAc,cAAc,MAAM;EAClC,IAAI,SAAS,QACX,SAAS,GAAG,SAAS,GAAG;OACnB,IAAI,SAAS,SAClB,SAAS,GAAG,SAAS,GAAG;OACnB;GACL,MAAM,KAAK,GAAG,SAAS,GAAG;GAC1B,MAAM,KAAK,GAAG,SAAS,GAAG;GAC1B,MAAM,OAAO,KAAK,MAAM;GACxB,IAAI,KAAK,IAAI,KAAK,EAAE,IAAI,OAAO,KAAK,IAAI,GAAG,KAAK,IAAI,GAAG,CAAC,GACtD,MAAM,IAAI,cAAc,gBAAgB;GAE1C,SAAS;EACX;CACF;CACA,IAAI,CAAC,OAAO,SAAS,MAAM,GAAG,MAAM,IAAI,cAAc,iBAAiB;CAMvE,MAAM,UAAU,KAAK,MAAM,MAAM;CACjC,IAAI,KAAK,IAAI,SAAS,OAAO,IAAI,MAAM,SAAS;CAEhD,OAAO,kBAAkB,SAAS,GAAG,YAAY,OAAO,KAAK,uBAAuB,cAAc,MAAM;AAC1G;;AAGA,SAAS,qBAAqB,KAAqB;CACjD,QAAQ,KAAR;EACE,KAAK,cACH,OAAO;EACT,KAAK,mBACH,OAAO;EACT,KAAK,gBACH,OAAO;EACT,KAAK,kBACH,OAAO;EACT,KAAK,aACH,OAAO;EACT,KAAK,YACH,OAAO;EACT,KAAK,eACH,OAAO;EACT,KAAK,kBACH,OAAO;EACT,KAAK,mBACH,OAAO;EACT,KAAK,cACH,OAAO;EACT,SACE,OAAO;CACX;AACF;;;;;;AAOA,SAAS,YAAY,OAA8B;CACjD,IAAI,IAAI,MAAM,KAAK;CACnB,IAAI,EAAE,QAAQ,kBAAkB,EAAE;CAClC,IAAI,EAAE,QAAQ,qBAAqB,EAAE,EAAE,KAAK;CAE5C,IAAI;CACJ,IAAI,QAAQ,KAAK,CAAC,GAAG,UAAU;MAC1B,IAAI,QAAQ,KAAK,CAAC,GAAG,UAAU;MAC/B,IACH,gDAAgD,KAAK,CAAC,KACtD,oCAAoC,KAAK,CAAC,GAE1C,UAAU;CACZ,IAAI,CAAC,SAAS,OAAO;CAErB,IAAI;EACF,OAAO,QAAQ,CAAC;CAClB,SAAS,KAAK;EACZ,IAAI,aAAa,KAAK,iBAAiB,aAAa,GAClD,OAAO,UAAU,qBAAqB,IAAI,OAAO;EAEnD,OAAO,UAAU,QAAQ,GAAG,IAAI,IAAI,UAAU,OAAO,GAAG;CAC1D;AACF;;;;;;;;;;;;;;;AAgBA,IAAa,gBAAgB,IAAI,KAAK;CACpC,MAAM;CACN,aACE;CACF,aAAa,UAAU,OAAO,EAC5B,YAAY,UAAU,OAAO,EAAE,SAAS,EAAE,YAAY,0CAAwC,EAChG,CAAC;CACD,SAAS,OAAO,SAAS;EACvB,MAAM,EAAE,eAAe;EAEvB,MAAM,cAAc,mBAAmB,UAAU;EACjD,IAAI,aAAa,OAAO;EAExB,IAAI;GACF,MAAM,SAAS,KAAK,SAAU,UAAU;GAIxC,IAAI,OAAO,WAAW,YAAY,CAAC,OAAO,SAAS,MAAM,GACvD,OAAO,gCAAgC,OAAO;GAIhD,OAAO,WAAW,OAAO,YAFZ,KAAK,MAAO,UACX,EAAK,MACkB,EAAM,KAAK,OAAO;EACzD,SAAS,KAAK;GACZ,OAAO,UAAU,QAAQ,GAAG,IAAI,IAAI,UAAU,OAAO,GAAG;EAC1D;CACF;AACF,CAAC;;;;;;;;;;;;;;;;;;;;;;;AAwBD,IAAa,oBAAoB,IAAI,KAAK;CACxC,MAAM;CACN,aACE;CACF,aAAa,UAAU,OAAO,EAC5B,OAAO,UACJ,OAAO,EACP,SAAS,EACT,YAAY,iFAA6E,EAC9F,CAAC;CACD,SAAS,OAAO,SAAS;EACvB,MAAM,EAAE,UAAU;EAElB,MAAM,cAAc,mBAAmB,KAAK;EAC5C,IAAI,aAAa,OAAO;EAExB,IAAI;GAIF,MAAM,WAAW,YAAY,KAAK;GAClC,IAAI,aAAa,MAAM,OAAO;GAG9B,OAAO,WADQ,cAAc,KACX;EACpB,SAAS,KAAK;GACZ,OAAO,UAAU,QAAQ,GAAG,IAAI,IAAI,UAAU,OAAO,GAAG;EAC1D;CACF;AACF,CAAC"}

package/batteries/tools/memory.cjs

@@ -1,10 +1,10 @@
 Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
 require("../../chunk-Ble4zEEl.js");
-const require_tool_registry = require("../../tool_registry-DYUYqXvo.js");
-const require_thought = require("../../thought-BbwhJ1wb.js");
-const require_tool = require("../../tool-CVyZkFC7.js");
-require("../../common-Cj8TaQ9U.js");
-const require_spooled_markdown_artifact = require("../../spooled_markdown_artifact-CALSDxIx.js");
+const require_tool_registry = require("../../tool_registry-CKJPze3j.js");
+const require_thought = require("../../thought-DLwpF7MI.js");
+const require_tool = require("../../tool-D5WGVIcI.js");
+require("../../common-DZl3ADJs.js");
+const require_spooled_markdown_artifact = require("../../spooled_markdown_artifact-ClX72lek.js");
 require("../../guards.cjs");
 let _nhtio_validation = require("@nhtio/validation");
 let luxon = require("luxon");

package/batteries/tools/memory.mjs

@@ -1,8 +1,8 @@
-import { o as isError } from "../../tool_registry-D1pSSlsd.mjs";
-import { r as Memory } from "../../thought-D34QQZZ9.mjs";
-import { t as Tool } from "../../tool-CMhaDRNd.mjs";
-import "../../common-BT0nfCi9.mjs";
-import { n as SpooledJsonArtifact } from "../../spooled_markdown_artifact-Ci5UL7l4.mjs";
+import { o as isError } from "../../tool_registry-791Vrjtf.mjs";
+import { r as Memory } from "../../thought-B_vxAiKU.mjs";
+import { t as Tool } from "../../tool-wMYMVl60.mjs";
+import "../../common-DYDUi99O.mjs";
+import { n as SpooledJsonArtifact } from "../../spooled_markdown_artifact-wkrBF3oX.mjs";
 import "../../guards.mjs";
 import { validator } from "@nhtio/validation";
 import { DateTime } from "luxon";

package/batteries/tools/parsing.cjs

@@ -1,9 +1,9 @@
 Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
 const require_chunk = require("../../chunk-Ble4zEEl.js");
-const require_tool_registry = require("../../tool_registry-DYUYqXvo.js");
-const require_tool = require("../../tool-CVyZkFC7.js");
-require("../../common-Cj8TaQ9U.js");
-const require_spooled_markdown_artifact = require("../../spooled_markdown_artifact-CALSDxIx.js");
+const require_tool_registry = require("../../tool_registry-CKJPze3j.js");
+const require_tool = require("../../tool-D5WGVIcI.js");
+require("../../common-DZl3ADJs.js");
+const require_spooled_markdown_artifact = require("../../spooled_markdown_artifact-ClX72lek.js");
 require("../../guards.cjs");
 let _nhtio_validation = require("@nhtio/validation");
 let js_yaml = require("js-yaml");
@@ -73,7 +73,11 @@ var parseYamlTool = new require_tool.Tool({
 		const { text } = args;
 		try {
 			const parsed = (0, js_yaml.load)(text);
-			return JSON.stringify(parsed, null, 2);
+			if (parsed === void 0) return "null";
+			return JSON.stringify(parsed, (_key, value) => {
+				if (typeof value === "number" && !Number.isFinite(value)) return Number.isNaN(value) ? ".NaN" : value > 0 ? ".inf" : "-.inf";
+				return value;
+			}, 2);
 		} catch (err) {
 			return `Error: Invalid YAML — ${require_tool_registry.isError(err) ? err.message : String(err)}`;
 		}

package/batteries/tools/parsing.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"parsing.cjs","names":[],"sources":["../../../src/batteries/tools/parsing/index.ts"],"sourcesContent":["/**\n * Pre-constructed tools for parsing CSV, TSV, JSON, YAML, and other structured text formats.\n *\n * @module @nhtio/adk/batteries/tools/parsing\n *\n * @remarks\n * Pre-constructed bundled tools for the `parsing` category. Import individually, the whole\n * category, or import every tool via `@nhtio/adk/batteries`.\n */\n\nimport { load as parseYaml } from 'js-yaml'\nimport { default as Papa } from 'papaparse'\nimport { isError } from '@nhtio/adk/guards'\nimport { validator } from '@nhtio/validation'\nimport { Tool, SpooledJsonArtifact } from '@nhtio/adk/common'\n\n/**\n * Parse a CSV or TSV string into a JSON array.\n *\n * @remarks\n * With `has_header: true` (default), each row becomes an object keyed by column name. Without a\n * header, rows are returned as positional arrays. `delimiter` auto-detects when omitted; pass\n * `\"\\t\"` for TSV. Rows are clipped to `limit` (default 1000, max 10000). Parse warnings are\n * prepended to the output.\n */\nexport const parseCsvTool = new Tool({\n  name: 'parse_csv',\n  description:\n    'Parse a CSV or TSV string into a JSON array. With a header row, returns objects keyed by column name. Without, returns arrays of values.',\n  inputSchema: validator.object({\n    text: validator.string().required().description('CSV or TSV text to parse'),\n    has_header: validator\n      .boolean()\n      .default(true)\n      .description('First row is a header row (default: true)'),\n    delimiter: validator\n      .string()\n      .default('')\n      .allow('')\n      .description('Field delimiter — auto-detected if omitted. Use \"\\\\t\" for TSV.'),\n    limit: validator.number().default(1000).description('Maximum rows to return (default: 1000)'),\n  }),\n  artifactConstructor: () => SpooledJsonArtifact,\n  handler: async (args) => {\n    const {\n      text,\n      has_header: hasHeader,\n      delimiter,\n      limit: rawLimit,\n    } = args as {\n      text: string\n      has_header: boolean\n      delimiter: string\n      limit: number\n    }\n    const limit = Math.min(10_000, Math.max(1, Math.floor(rawLimit)))\n\n    try {\n      const result = Papa.parse<unknown>(text.trim(), {\n        header: hasHeader,\n        delimiter: delimiter || undefined,\n        skipEmptyLines: true,\n        dynamicTyping: true,\n      })\n\n      const rows = (result.data as unknown[]).slice(0, limit)\n      const warnings =\n        result.errors.length > 0\n          ? `Parse warnings: ${result.errors\n              .slice(0, 3)\n              .map((e) => e.message)\n              .join('; ')}\\n\\n`\n          : ''\n      const truncated =\n        result.data.length > limit ? `\\n\\n(Showing ${limit} of ${result.data.length} rows)` : ''\n\n      return warnings + JSON.stringify(rows, null, 2) + truncated\n    } catch (err) {\n      return `Error: ${isError(err) ? err.message : String(err)}`\n    }\n  },\n})\n\n/**\n * Parse a YAML string into JSON.\n *\n * @remarks\n * Returns a pretty-printed JSON representation of the parsed YAML document. Invalid YAML\n * returns an error string.\n */\nexport const parseYamlTool = new Tool({\n  name: 'parse_yaml',\n  description: 'Parse a YAML string and return the equivalent JSON.',\n  inputSchema: validator.object({\n    text: validator.string().required().description('YAML text to parse'),\n  }),\n  artifactConstructor: () => SpooledJsonArtifact,\n  handler: async (args) => {\n    const { text } = args as { text: string }\n    try {\n      const parsed = parseYaml(text)\n      return JSON.stringify(parsed, null, 2)\n    } catch (err) {\n      return `Error: Invalid YAML — ${isError(err) ? err.message : String(err)}`\n    }\n  },\n})\n\n/**\n * Extract key-value pairs from text.\n *\n * @remarks\n * Handles `.env` files, config files, and query strings. `kv_delimiter` chooses the\n * key→value separator (`=`, `:`, or `auto`); `pair_delimiter` selects how pairs are separated\n * (`newline`, `comma`, `semicolon`, `ampersand`). Surrounding single or double quotes around\n * values are stripped. Comment lines starting with `#` are skipped by default.\n */\nexport const parseKvTool = new Tool({\n  name: 'parse_kv',\n  description:\n    'Extract key-value pairs from text (e.g. .env files, config files, query strings). Returns a JSON object.',\n  inputSchema: validator.object({\n    text: validator.string().required().description('Text containing key-value pairs'),\n    kv_delimiter: validator\n      .string()\n      .valid('=', ':', 'auto')\n      .default('auto')\n      .description('Separator between key and value (default: auto-detect)'),\n    pair_delimiter: validator\n      .string()\n      .valid('newline', 'comma', 'semicolon', 'ampersand')\n      .default('newline')\n      .description('Separator between pairs (default: newline)'),\n    skip_comments: validator\n      .boolean()\n      .default(true)\n      .description('Skip lines starting with # (default: true)'),\n  }),\n  artifactConstructor: () => SpooledJsonArtifact,\n  handler: async (args) => {\n    const {\n      text,\n      kv_delimiter: kvDelim,\n      pair_delimiter: pairDelimKey,\n      skip_comments: skipComments,\n    } = args as {\n      text: string\n      kv_delimiter: string\n      pair_delimiter: string\n      skip_comments: boolean\n    }\n\n    const pairDelimMap: Record<string, string> = {\n      newline: '\\n',\n      comma: ',',\n      semicolon: ';',\n      ampersand: '&',\n    }\n    const pairDelim = pairDelimMap[pairDelimKey] ?? '\\n'\n\n    const result: Record<string, string> = {}\n\n    for (const raw of text.split(pairDelim)) {\n      const line = raw.trim()\n      if (line === '') continue\n      if (skipComments && line.startsWith('#')) continue\n\n      const delim =\n        kvDelim === 'auto' ? (line.includes('=') ? '=' : line.includes(':') ? ':' : null) : kvDelim\n      if (!delim) continue\n\n      const sepIdx = line.indexOf(delim)\n      if (sepIdx === -1) continue\n\n      const key = line.slice(0, sepIdx).trim()\n      let value = line.slice(sepIdx + delim.length).trim()\n\n      if (\n        (value.startsWith('\"') && value.endsWith('\"')) ||\n        (value.startsWith(\"'\") && value.endsWith(\"'\"))\n      ) {\n        value = value.slice(1, -1)\n      }\n\n      if (key) result[key] = value\n    }\n\n    return JSON.stringify(result, null, 2)\n  },\n})\n\n/**\n * Detect the most likely field delimiter in a CSV-like text sample.\n *\n * @remarks\n * Tries comma, tab, semicolon, pipe, and colon. Scores each by mean field count divided by\n * variance (so consistent row widths beat noisy splits). Looks at up to the first 20 lines of\n * the first 5000 characters.\n */\nexport const detectDelimiterTool = new Tool({\n  name: 'detect_delimiter',\n  description: 'Detect the most likely field delimiter in a CSV-like text sample.',\n  inputSchema: validator.object({\n    text: validator.string().required().description('Sample of the delimited text to analyze'),\n  }),\n  handler: async (args) => {\n    const { text } = args as { text: string }\n    const sample = text.slice(0, 5000)\n    const lines = sample\n      .split('\\n')\n      .map((l) => l.trim())\n      .filter((l) => l.length > 0)\n      .slice(0, 20)\n\n    if (lines.length === 0) return 'Error: No lines to analyze.'\n\n    const candidates: Array<{ delim: string; name: string }> = [\n      { delim: ',', name: 'comma' },\n      { delim: '\\t', name: 'tab' },\n      { delim: ';', name: 'semicolon' },\n      { delim: '|', name: 'pipe' },\n      { delim: ':', name: 'colon' },\n    ]\n\n    let best = { name: 'comma', delim: ',', score: -1, avgFields: 0 }\n\n    for (const { delim, name } of candidates) {\n      const counts = lines.map((l) => l.split(delim).length - 1)\n      const avg = counts.reduce((a, b) => a + b, 0) / counts.length\n      if (avg === 0) continue\n      const fieldVariance = counts.reduce((a, b) => a + (b - avg) ** 2, 0) / counts.length\n      const score = avg / (1 + fieldVariance)\n      if (score > best.score) {\n        best = { name, delim, score, avgFields: Number.parseFloat((avg + 1).toFixed(1)) }\n      }\n    }\n\n    return `Detected delimiter: ${best.name} (\"${best.delim === '\\t' ? '\\\\t' : best.delim}\") — ~${best.avgFields} fields per row`\n  },\n})\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAyBA,IAAa,eAAe,IAAI,aAAA,KAAK;CACnC,MAAM;CACN,aACE;CACF,aAAa,kBAAA,UAAU,OAAO;EAC5B,MAAM,kBAAA,UAAU,OAAO,EAAE,SAAS,EAAE,YAAY,0BAA0B;EAC1E,YAAY,kBAAA,UACT,QAAQ,EACR,QAAQ,IAAI,EACZ,YAAY,2CAA2C;EAC1D,WAAW,kBAAA,UACR,OAAO,EACP,QAAQ,EAAE,EACV,MAAM,EAAE,EACR,YAAY,kEAAgE;EAC/E,OAAO,kBAAA,UAAU,OAAO,EAAE,QAAQ,GAAI,EAAE,YAAY,wCAAwC;CAC9F,CAAC;CACD,2BAA2B,kCAAA;CAC3B,SAAS,OAAO,SAAS;EACvB,MAAM,EACJ,MACA,YAAY,WACZ,WACA,OAAO,aACL;EAMJ,MAAM,QAAQ,KAAK,IAAI,KAAQ,KAAK,IAAI,GAAG,KAAK,MAAM,QAAQ,CAAC,CAAC;EAEhE,IAAI;GACF,MAAM,SAAS,UAAA,QAAK,MAAe,KAAK,KAAK,GAAG;IAC9C,QAAQ;IACR,WAAW,aAAa,KAAA;IACxB,gBAAgB;IAChB,eAAe;GACjB,CAAC;GAED,MAAM,OAAQ,OAAO,KAAmB,MAAM,GAAG,KAAK;GACtD,MAAM,WACJ,OAAO,OAAO,SAAS,IACnB,mBAAmB,OAAO,OACvB,MAAM,GAAG,CAAC,EACV,KAAK,MAAM,EAAE,OAAO,EACpB,KAAK,IAAI,EAAE,QACd;GACN,MAAM,YACJ,OAAO,KAAK,SAAS,QAAQ,gBAAgB,MAAM,MAAM,OAAO,KAAK,OAAO,UAAU;GAExF,OAAO,WAAW,KAAK,UAAU,MAAM,MAAM,CAAC,IAAI;EACpD,SAAS,KAAK;GACZ,OAAO,UAAU,sBAAA,QAAQ,GAAG,IAAI,IAAI,UAAU,OAAO,GAAG;EAC1D;CACF;AACF,CAAC;;;;;;;;AASD,IAAa,gBAAgB,IAAI,aAAA,KAAK;CACpC,MAAM;CACN,aAAa;CACb,aAAa,kBAAA,UAAU,OAAO,EAC5B,MAAM,kBAAA,UAAU,OAAO,EAAE,SAAS,EAAE,YAAY,oBAAoB,EACtE,CAAC;CACD,2BAA2B,kCAAA;CAC3B,SAAS,OAAO,SAAS;EACvB,MAAM,EAAE,SAAS;EACjB,IAAI;GACF,MAAM,UAAA,GAAA,QAAA,MAAmB,IAAI;GAC7B,OAAO,KAAK,UAAU,QAAQ,MAAM,CAAC;EACvC,SAAS,KAAK;GACZ,OAAO,yBAAyB,sBAAA,QAAQ,GAAG,IAAI,IAAI,UAAU,OAAO,GAAG;EACzE;CACF;AACF,CAAC;;;;;;;;;;AAWD,IAAa,cAAc,IAAI,aAAA,KAAK;CAClC,MAAM;CACN,aACE;CACF,aAAa,kBAAA,UAAU,OAAO;EAC5B,MAAM,kBAAA,UAAU,OAAO,EAAE,SAAS,EAAE,YAAY,iCAAiC;EACjF,cAAc,kBAAA,UACX,OAAO,EACP,MAAM,KAAK,KAAK,MAAM,EACtB,QAAQ,MAAM,EACd,YAAY,wDAAwD;EACvE,gBAAgB,kBAAA,UACb,OAAO,EACP,MAAM,WAAW,SAAS,aAAa,WAAW,EAClD,QAAQ,SAAS,EACjB,YAAY,4CAA4C;EAC3D,eAAe,kBAAA,UACZ,QAAQ,EACR,QAAQ,IAAI,EACZ,YAAY,4CAA4C;CAC7D,CAAC;CACD,2BAA2B,kCAAA;CAC3B,SAAS,OAAO,SAAS;EACvB,MAAM,EACJ,MACA,cAAc,SACd,gBAAgB,cAChB,eAAe,iBACb;EAaJ,MAAM,YAAY;GALhB,SAAS;GACT,OAAO;GACP,WAAW;GACX,WAAW;EAEK,EAAa,iBAAiB;EAEhD,MAAM,SAAiC,CAAC;EAExC,KAAK,MAAM,OAAO,KAAK,MAAM,SAAS,GAAG;GACvC,MAAM,OAAO,IAAI,KAAK;GACtB,IAAI,SAAS,IAAI;GACjB,IAAI,gBAAgB,KAAK,WAAW,GAAG,GAAG;GAE1C,MAAM,QACJ,YAAY,SAAU,KAAK,SAAS,GAAG,IAAI,MAAM,KAAK,SAAS,GAAG,IAAI,MAAM,OAAQ;GACtF,IAAI,CAAC,OAAO;GAEZ,MAAM,SAAS,KAAK,QAAQ,KAAK;GACjC,IAAI,WAAW,IAAI;GAEnB,MAAM,MAAM,KAAK,MAAM,GAAG,MAAM,EAAE,KAAK;GACvC,IAAI,QAAQ,KAAK,MAAM,SAAS,MAAM,MAAM,EAAE,KAAK;GAEnD,IACG,MAAM,WAAW,IAAG,KAAK,MAAM,SAAS,IAAG,KAC3C,MAAM,WAAW,GAAG,KAAK,MAAM,SAAS,GAAG,GAE5C,QAAQ,MAAM,MAAM,GAAG,EAAE;GAG3B,IAAI,KAAK,OAAO,OAAO;EACzB;EAEA,OAAO,KAAK,UAAU,QAAQ,MAAM,CAAC;CACvC;AACF,CAAC;;;;;;;;;AAUD,IAAa,sBAAsB,IAAI,aAAA,KAAK;CAC1C,MAAM;CACN,aAAa;CACb,aAAa,kBAAA,UAAU,OAAO,EAC5B,MAAM,kBAAA,UAAU,OAAO,EAAE,SAAS,EAAE,YAAY,yCAAyC,EAC3F,CAAC;CACD,SAAS,OAAO,SAAS;EACvB,MAAM,EAAE,SAAS;EAEjB,MAAM,QADS,KAAK,MAAM,GAAG,GACf,EACX,MAAM,IAAI,EACV,KAAK,MAAM,EAAE,KAAK,CAAC,EACnB,QAAQ,MAAM,EAAE,SAAS,CAAC,EAC1B,MAAM,GAAG,EAAE;EAEd,IAAI,MAAM,WAAW,GAAG,OAAO;EAE/B,MAAM,aAAqD;GACzD;IAAE,OAAO;IAAK,MAAM;GAAQ;GAC5B;IAAE,OAAO;IAAM,MAAM;GAAM;GAC3B;IAAE,OAAO;IAAK,MAAM;GAAY;GAChC;IAAE,OAAO;IAAK,MAAM;GAAO;GAC3B;IAAE,OAAO;IAAK,MAAM;GAAQ;EAC9B;EAEA,IAAI,OAAO;GAAE,MAAM;GAAS,OAAO;GAAK,OAAO;GAAI,WAAW;EAAE;EAEhE,KAAK,MAAM,EAAE,OAAO,UAAU,YAAY;GACxC,MAAM,SAAS,MAAM,KAAK,MAAM,EAAE,MAAM,KAAK,EAAE,SAAS,CAAC;GACzD,MAAM,MAAM,OAAO,QAAQ,GAAG,MAAM,IAAI,GAAG,CAAC,IAAI,OAAO;GACvD,IAAI,QAAQ,GAAG;GAEf,MAAM,QAAQ,OAAO,IADC,OAAO,QAAQ,GAAG,MAAM,KAAK,IAAI,QAAQ,GAAG,CAAC,IAAI,OAAO;GAE9E,IAAI,QAAQ,KAAK,OACf,OAAO;IAAE;IAAM;IAAO;IAAO,WAAW,OAAO,YAAY,MAAM,GAAG,QAAQ,CAAC,CAAC;GAAE;EAEpF;EAEA,OAAO,uBAAuB,KAAK,KAAK,KAAK,KAAK,UAAU,MAAO,QAAQ,KAAK,MAAM,QAAQ,KAAK,UAAU;CAC/G;AACF,CAAC"}
+{"version":3,"file":"parsing.cjs","names":[],"sources":["../../../src/batteries/tools/parsing/index.ts"],"sourcesContent":["/**\n * Pre-constructed tools for parsing CSV, TSV, JSON, YAML, and other structured text formats.\n *\n * @module @nhtio/adk/batteries/tools/parsing\n *\n * @remarks\n * Pre-constructed bundled tools for the `parsing` category. Import individually, the whole\n * category, or import every tool via `@nhtio/adk/batteries`.\n */\n\nimport { load as parseYaml } from 'js-yaml'\nimport { default as Papa } from 'papaparse'\nimport { isError } from '@nhtio/adk/guards'\nimport { validator } from '@nhtio/validation'\nimport { Tool, SpooledJsonArtifact } from '@nhtio/adk/common'\n\n/**\n * Parse a CSV or TSV string into a JSON array.\n *\n * @remarks\n * With `has_header: true` (default), each row becomes an object keyed by column name. Without a\n * header, rows are returned as positional arrays. `delimiter` auto-detects when omitted; pass\n * `\"\\t\"` for TSV. Rows are clipped to `limit` (default 1000, max 10000). Parse warnings are\n * prepended to the output.\n */\nexport const parseCsvTool = new Tool({\n  name: 'parse_csv',\n  description:\n    'Parse a CSV or TSV string into a JSON array. With a header row, returns objects keyed by column name. Without, returns arrays of values.',\n  inputSchema: validator.object({\n    text: validator.string().required().description('CSV or TSV text to parse'),\n    has_header: validator\n      .boolean()\n      .default(true)\n      .description('First row is a header row (default: true)'),\n    delimiter: validator\n      .string()\n      .default('')\n      .allow('')\n      .description('Field delimiter — auto-detected if omitted. Use \"\\\\t\" for TSV.'),\n    limit: validator.number().default(1000).description('Maximum rows to return (default: 1000)'),\n  }),\n  artifactConstructor: () => SpooledJsonArtifact,\n  handler: async (args) => {\n    const {\n      text,\n      has_header: hasHeader,\n      delimiter,\n      limit: rawLimit,\n    } = args as {\n      text: string\n      has_header: boolean\n      delimiter: string\n      limit: number\n    }\n    const limit = Math.min(10_000, Math.max(1, Math.floor(rawLimit)))\n\n    try {\n      const result = Papa.parse<unknown>(text.trim(), {\n        header: hasHeader,\n        delimiter: delimiter || undefined,\n        skipEmptyLines: true,\n        dynamicTyping: true,\n      })\n\n      const rows = (result.data as unknown[]).slice(0, limit)\n      const warnings =\n        result.errors.length > 0\n          ? `Parse warnings: ${result.errors\n              .slice(0, 3)\n              .map((e) => e.message)\n              .join('; ')}\\n\\n`\n          : ''\n      const truncated =\n        result.data.length > limit ? `\\n\\n(Showing ${limit} of ${result.data.length} rows)` : ''\n\n      return warnings + JSON.stringify(rows, null, 2) + truncated\n    } catch (err) {\n      return `Error: ${isError(err) ? err.message : String(err)}`\n    }\n  },\n})\n\n/**\n * Parse a YAML string into JSON.\n *\n * @remarks\n * Returns a pretty-printed JSON representation of the parsed YAML document. Invalid YAML\n * returns an error string.\n */\nexport const parseYamlTool = new Tool({\n  name: 'parse_yaml',\n  description: 'Parse a YAML string and return the equivalent JSON.',\n  inputSchema: validator.object({\n    text: validator.string().required().description('YAML text to parse'),\n  }),\n  artifactConstructor: () => SpooledJsonArtifact,\n  handler: async (args) => {\n    const { text } = args as { text: string }\n    try {\n      const parsed = parseYaml(text)\n      // An empty / whitespace-only / BOM-only document parses to `undefined`, and\n      // `JSON.stringify(undefined)` returns the JS value `undefined` (not a string), breaking the\n      // tool's string-return contract. Normalise that empty document to JSON `null`.\n      if (parsed === undefined) return 'null'\n      // YAML permits .NaN / .inf / -.inf, which `JSON.stringify` would silently turn into `null`,\n      // losing the value. Render non-finite numbers as their YAML token strings so the information\n      // survives the JSON round-trip instead of being corrupted to null.\n      return JSON.stringify(\n        parsed,\n        (_key, value) => {\n          if (typeof value === 'number' && !Number.isFinite(value)) {\n            return Number.isNaN(value) ? '.NaN' : value > 0 ? '.inf' : '-.inf'\n          }\n          return value\n        },\n        2\n      )\n    } catch (err) {\n      return `Error: Invalid YAML — ${isError(err) ? err.message : String(err)}`\n    }\n  },\n})\n\n/**\n * Extract key-value pairs from text.\n *\n * @remarks\n * Handles `.env` files, config files, and query strings. `kv_delimiter` chooses the\n * key→value separator (`=`, `:`, or `auto`); `pair_delimiter` selects how pairs are separated\n * (`newline`, `comma`, `semicolon`, `ampersand`). Surrounding single or double quotes around\n * values are stripped. Comment lines starting with `#` are skipped by default.\n */\nexport const parseKvTool = new Tool({\n  name: 'parse_kv',\n  description:\n    'Extract key-value pairs from text (e.g. .env files, config files, query strings). Returns a JSON object.',\n  inputSchema: validator.object({\n    text: validator.string().required().description('Text containing key-value pairs'),\n    kv_delimiter: validator\n      .string()\n      .valid('=', ':', 'auto')\n      .default('auto')\n      .description('Separator between key and value (default: auto-detect)'),\n    pair_delimiter: validator\n      .string()\n      .valid('newline', 'comma', 'semicolon', 'ampersand')\n      .default('newline')\n      .description('Separator between pairs (default: newline)'),\n    skip_comments: validator\n      .boolean()\n      .default(true)\n      .description('Skip lines starting with # (default: true)'),\n  }),\n  artifactConstructor: () => SpooledJsonArtifact,\n  handler: async (args) => {\n    const {\n      text,\n      kv_delimiter: kvDelim,\n      pair_delimiter: pairDelimKey,\n      skip_comments: skipComments,\n    } = args as {\n      text: string\n      kv_delimiter: string\n      pair_delimiter: string\n      skip_comments: boolean\n    }\n\n    const pairDelimMap: Record<string, string> = {\n      newline: '\\n',\n      comma: ',',\n      semicolon: ';',\n      ampersand: '&',\n    }\n    const pairDelim = pairDelimMap[pairDelimKey] ?? '\\n'\n\n    const result: Record<string, string> = {}\n\n    for (const raw of text.split(pairDelim)) {\n      const line = raw.trim()\n      if (line === '') continue\n      if (skipComments && line.startsWith('#')) continue\n\n      const delim =\n        kvDelim === 'auto' ? (line.includes('=') ? '=' : line.includes(':') ? ':' : null) : kvDelim\n      if (!delim) continue\n\n      const sepIdx = line.indexOf(delim)\n      if (sepIdx === -1) continue\n\n      const key = line.slice(0, sepIdx).trim()\n      let value = line.slice(sepIdx + delim.length).trim()\n\n      if (\n        (value.startsWith('\"') && value.endsWith('\"')) ||\n        (value.startsWith(\"'\") && value.endsWith(\"'\"))\n      ) {\n        value = value.slice(1, -1)\n      }\n\n      if (key) result[key] = value\n    }\n\n    return JSON.stringify(result, null, 2)\n  },\n})\n\n/**\n * Detect the most likely field delimiter in a CSV-like text sample.\n *\n * @remarks\n * Tries comma, tab, semicolon, pipe, and colon. Scores each by mean field count divided by\n * variance (so consistent row widths beat noisy splits). Looks at up to the first 20 lines of\n * the first 5000 characters.\n */\nexport const detectDelimiterTool = new Tool({\n  name: 'detect_delimiter',\n  description: 'Detect the most likely field delimiter in a CSV-like text sample.',\n  inputSchema: validator.object({\n    text: validator.string().required().description('Sample of the delimited text to analyze'),\n  }),\n  handler: async (args) => {\n    const { text } = args as { text: string }\n    const sample = text.slice(0, 5000)\n    const lines = sample\n      .split('\\n')\n      .map((l) => l.trim())\n      .filter((l) => l.length > 0)\n      .slice(0, 20)\n\n    if (lines.length === 0) return 'Error: No lines to analyze.'\n\n    const candidates: Array<{ delim: string; name: string }> = [\n      { delim: ',', name: 'comma' },\n      { delim: '\\t', name: 'tab' },\n      { delim: ';', name: 'semicolon' },\n      { delim: '|', name: 'pipe' },\n      { delim: ':', name: 'colon' },\n    ]\n\n    let best = { name: 'comma', delim: ',', score: -1, avgFields: 0 }\n\n    for (const { delim, name } of candidates) {\n      const counts = lines.map((l) => l.split(delim).length - 1)\n      const avg = counts.reduce((a, b) => a + b, 0) / counts.length\n      if (avg === 0) continue\n      const fieldVariance = counts.reduce((a, b) => a + (b - avg) ** 2, 0) / counts.length\n      const score = avg / (1 + fieldVariance)\n      if (score > best.score) {\n        best = { name, delim, score, avgFields: Number.parseFloat((avg + 1).toFixed(1)) }\n      }\n    }\n\n    return `Detected delimiter: ${best.name} (\"${best.delim === '\\t' ? '\\\\t' : best.delim}\") — ~${best.avgFields} fields per row`\n  },\n})\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAyBA,IAAa,eAAe,IAAI,aAAA,KAAK;CACnC,MAAM;CACN,aACE;CACF,aAAa,kBAAA,UAAU,OAAO;EAC5B,MAAM,kBAAA,UAAU,OAAO,EAAE,SAAS,EAAE,YAAY,0BAA0B;EAC1E,YAAY,kBAAA,UACT,QAAQ,EACR,QAAQ,IAAI,EACZ,YAAY,2CAA2C;EAC1D,WAAW,kBAAA,UACR,OAAO,EACP,QAAQ,EAAE,EACV,MAAM,EAAE,EACR,YAAY,kEAAgE;EAC/E,OAAO,kBAAA,UAAU,OAAO,EAAE,QAAQ,GAAI,EAAE,YAAY,wCAAwC;CAC9F,CAAC;CACD,2BAA2B,kCAAA;CAC3B,SAAS,OAAO,SAAS;EACvB,MAAM,EACJ,MACA,YAAY,WACZ,WACA,OAAO,aACL;EAMJ,MAAM,QAAQ,KAAK,IAAI,KAAQ,KAAK,IAAI,GAAG,KAAK,MAAM,QAAQ,CAAC,CAAC;EAEhE,IAAI;GACF,MAAM,SAAS,UAAA,QAAK,MAAe,KAAK,KAAK,GAAG;IAC9C,QAAQ;IACR,WAAW,aAAa,KAAA;IACxB,gBAAgB;IAChB,eAAe;GACjB,CAAC;GAED,MAAM,OAAQ,OAAO,KAAmB,MAAM,GAAG,KAAK;GACtD,MAAM,WACJ,OAAO,OAAO,SAAS,IACnB,mBAAmB,OAAO,OACvB,MAAM,GAAG,CAAC,EACV,KAAK,MAAM,EAAE,OAAO,EACpB,KAAK,IAAI,EAAE,QACd;GACN,MAAM,YACJ,OAAO,KAAK,SAAS,QAAQ,gBAAgB,MAAM,MAAM,OAAO,KAAK,OAAO,UAAU;GAExF,OAAO,WAAW,KAAK,UAAU,MAAM,MAAM,CAAC,IAAI;EACpD,SAAS,KAAK;GACZ,OAAO,UAAU,sBAAA,QAAQ,GAAG,IAAI,IAAI,UAAU,OAAO,GAAG;EAC1D;CACF;AACF,CAAC;;;;;;;;AASD,IAAa,gBAAgB,IAAI,aAAA,KAAK;CACpC,MAAM;CACN,aAAa;CACb,aAAa,kBAAA,UAAU,OAAO,EAC5B,MAAM,kBAAA,UAAU,OAAO,EAAE,SAAS,EAAE,YAAY,oBAAoB,EACtE,CAAC;CACD,2BAA2B,kCAAA;CAC3B,SAAS,OAAO,SAAS;EACvB,MAAM,EAAE,SAAS;EACjB,IAAI;GACF,MAAM,UAAA,GAAA,QAAA,MAAmB,IAAI;GAI7B,IAAI,WAAW,KAAA,GAAW,OAAO;GAIjC,OAAO,KAAK,UACV,SACC,MAAM,UAAU;IACf,IAAI,OAAO,UAAU,YAAY,CAAC,OAAO,SAAS,KAAK,GACrD,OAAO,OAAO,MAAM,KAAK,IAAI,SAAS,QAAQ,IAAI,SAAS;IAE7D,OAAO;GACT,GACA,CACF;EACF,SAAS,KAAK;GACZ,OAAO,yBAAyB,sBAAA,QAAQ,GAAG,IAAI,IAAI,UAAU,OAAO,GAAG;EACzE;CACF;AACF,CAAC;;;;;;;;;;AAWD,IAAa,cAAc,IAAI,aAAA,KAAK;CAClC,MAAM;CACN,aACE;CACF,aAAa,kBAAA,UAAU,OAAO;EAC5B,MAAM,kBAAA,UAAU,OAAO,EAAE,SAAS,EAAE,YAAY,iCAAiC;EACjF,cAAc,kBAAA,UACX,OAAO,EACP,MAAM,KAAK,KAAK,MAAM,EACtB,QAAQ,MAAM,EACd,YAAY,wDAAwD;EACvE,gBAAgB,kBAAA,UACb,OAAO,EACP,MAAM,WAAW,SAAS,aAAa,WAAW,EAClD,QAAQ,SAAS,EACjB,YAAY,4CAA4C;EAC3D,eAAe,kBAAA,UACZ,QAAQ,EACR,QAAQ,IAAI,EACZ,YAAY,4CAA4C;CAC7D,CAAC;CACD,2BAA2B,kCAAA;CAC3B,SAAS,OAAO,SAAS;EACvB,MAAM,EACJ,MACA,cAAc,SACd,gBAAgB,cAChB,eAAe,iBACb;EAaJ,MAAM,YAAY;GALhB,SAAS;GACT,OAAO;GACP,WAAW;GACX,WAAW;EAEK,EAAa,iBAAiB;EAEhD,MAAM,SAAiC,CAAC;EAExC,KAAK,MAAM,OAAO,KAAK,MAAM,SAAS,GAAG;GACvC,MAAM,OAAO,IAAI,KAAK;GACtB,IAAI,SAAS,IAAI;GACjB,IAAI,gBAAgB,KAAK,WAAW,GAAG,GAAG;GAE1C,MAAM,QACJ,YAAY,SAAU,KAAK,SAAS,GAAG,IAAI,MAAM,KAAK,SAAS,GAAG,IAAI,MAAM,OAAQ;GACtF,IAAI,CAAC,OAAO;GAEZ,MAAM,SAAS,KAAK,QAAQ,KAAK;GACjC,IAAI,WAAW,IAAI;GAEnB,MAAM,MAAM,KAAK,MAAM,GAAG,MAAM,EAAE,KAAK;GACvC,IAAI,QAAQ,KAAK,MAAM,SAAS,MAAM,MAAM,EAAE,KAAK;GAEnD,IACG,MAAM,WAAW,IAAG,KAAK,MAAM,SAAS,IAAG,KAC3C,MAAM,WAAW,GAAG,KAAK,MAAM,SAAS,GAAG,GAE5C,QAAQ,MAAM,MAAM,GAAG,EAAE;GAG3B,IAAI,KAAK,OAAO,OAAO;EACzB;EAEA,OAAO,KAAK,UAAU,QAAQ,MAAM,CAAC;CACvC;AACF,CAAC;;;;;;;;;AAUD,IAAa,sBAAsB,IAAI,aAAA,KAAK;CAC1C,MAAM;CACN,aAAa;CACb,aAAa,kBAAA,UAAU,OAAO,EAC5B,MAAM,kBAAA,UAAU,OAAO,EAAE,SAAS,EAAE,YAAY,yCAAyC,EAC3F,CAAC;CACD,SAAS,OAAO,SAAS;EACvB,MAAM,EAAE,SAAS;EAEjB,MAAM,QADS,KAAK,MAAM,GAAG,GACf,EACX,MAAM,IAAI,EACV,KAAK,MAAM,EAAE,KAAK,CAAC,EACnB,QAAQ,MAAM,EAAE,SAAS,CAAC,EAC1B,MAAM,GAAG,EAAE;EAEd,IAAI,MAAM,WAAW,GAAG,OAAO;EAE/B,MAAM,aAAqD;GACzD;IAAE,OAAO;IAAK,MAAM;GAAQ;GAC5B;IAAE,OAAO;IAAM,MAAM;GAAM;GAC3B;IAAE,OAAO;IAAK,MAAM;GAAY;GAChC;IAAE,OAAO;IAAK,MAAM;GAAO;GAC3B;IAAE,OAAO;IAAK,MAAM;GAAQ;EAC9B;EAEA,IAAI,OAAO;GAAE,MAAM;GAAS,OAAO;GAAK,OAAO;GAAI,WAAW;EAAE;EAEhE,KAAK,MAAM,EAAE,OAAO,UAAU,YAAY;GACxC,MAAM,SAAS,MAAM,KAAK,MAAM,EAAE,MAAM,KAAK,EAAE,SAAS,CAAC;GACzD,MAAM,MAAM,OAAO,QAAQ,GAAG,MAAM,IAAI,GAAG,CAAC,IAAI,OAAO;GACvD,IAAI,QAAQ,GAAG;GAEf,MAAM,QAAQ,OAAO,IADC,OAAO,QAAQ,GAAG,MAAM,KAAK,IAAI,QAAQ,GAAG,CAAC,IAAI,OAAO;GAE9E,IAAI,QAAQ,KAAK,OACf,OAAO;IAAE;IAAM;IAAO;IAAO,WAAW,OAAO,YAAY,MAAM,GAAG,QAAQ,CAAC,CAAC;GAAE;EAEpF;EAEA,OAAO,uBAAuB,KAAK,KAAK,KAAK,KAAK,UAAU,MAAO,QAAQ,KAAK,MAAM,QAAQ,KAAK,UAAU;CAC/G;AACF,CAAC"}

package/batteries/tools/parsing.mjs

@@ -1,7 +1,7 @@
-import { o as isError } from "../../tool_registry-D1pSSlsd.mjs";
-import { t as Tool } from "../../tool-CMhaDRNd.mjs";
-import "../../common-BT0nfCi9.mjs";
-import { n as SpooledJsonArtifact } from "../../spooled_markdown_artifact-Ci5UL7l4.mjs";
+import { o as isError } from "../../tool_registry-791Vrjtf.mjs";
+import { t as Tool } from "../../tool-wMYMVl60.mjs";
+import "../../common-DYDUi99O.mjs";
+import { n as SpooledJsonArtifact } from "../../spooled_markdown_artifact-wkrBF3oX.mjs";
 import "../../guards.mjs";
 import { validator } from "@nhtio/validation";
 import { load } from "js-yaml";
@@ -70,7 +70,11 @@ var parseYamlTool = new Tool({
 		const { text } = args;
 		try {
 			const parsed = load(text);
-			return JSON.stringify(parsed, null, 2);
+			if (parsed === void 0) return "null";
+			return JSON.stringify(parsed, (_key, value) => {
+				if (typeof value === "number" && !Number.isFinite(value)) return Number.isNaN(value) ? ".NaN" : value > 0 ? ".inf" : "-.inf";
+				return value;
+			}, 2);
 		} catch (err) {
 			return `Error: Invalid YAML — ${isError(err) ? err.message : String(err)}`;
 		}

package/batteries/tools/parsing.mjs.map

@@ -1 +1 @@
-{"version":3,"file":"parsing.mjs","names":[],"sources":["../../../src/batteries/tools/parsing/index.ts"],"sourcesContent":["/**\n * Pre-constructed tools for parsing CSV, TSV, JSON, YAML, and other structured text formats.\n *\n * @module @nhtio/adk/batteries/tools/parsing\n *\n * @remarks\n * Pre-constructed bundled tools for the `parsing` category. Import individually, the whole\n * category, or import every tool via `@nhtio/adk/batteries`.\n */\n\nimport { load as parseYaml } from 'js-yaml'\nimport { default as Papa } from 'papaparse'\nimport { isError } from '@nhtio/adk/guards'\nimport { validator } from '@nhtio/validation'\nimport { Tool, SpooledJsonArtifact } from '@nhtio/adk/common'\n\n/**\n * Parse a CSV or TSV string into a JSON array.\n *\n * @remarks\n * With `has_header: true` (default), each row becomes an object keyed by column name. Without a\n * header, rows are returned as positional arrays. `delimiter` auto-detects when omitted; pass\n * `\"\\t\"` for TSV. Rows are clipped to `limit` (default 1000, max 10000). Parse warnings are\n * prepended to the output.\n */\nexport const parseCsvTool = new Tool({\n  name: 'parse_csv',\n  description:\n    'Parse a CSV or TSV string into a JSON array. With a header row, returns objects keyed by column name. Without, returns arrays of values.',\n  inputSchema: validator.object({\n    text: validator.string().required().description('CSV or TSV text to parse'),\n    has_header: validator\n      .boolean()\n      .default(true)\n      .description('First row is a header row (default: true)'),\n    delimiter: validator\n      .string()\n      .default('')\n      .allow('')\n      .description('Field delimiter — auto-detected if omitted. Use \"\\\\t\" for TSV.'),\n    limit: validator.number().default(1000).description('Maximum rows to return (default: 1000)'),\n  }),\n  artifactConstructor: () => SpooledJsonArtifact,\n  handler: async (args) => {\n    const {\n      text,\n      has_header: hasHeader,\n      delimiter,\n      limit: rawLimit,\n    } = args as {\n      text: string\n      has_header: boolean\n      delimiter: string\n      limit: number\n    }\n    const limit = Math.min(10_000, Math.max(1, Math.floor(rawLimit)))\n\n    try {\n      const result = Papa.parse<unknown>(text.trim(), {\n        header: hasHeader,\n        delimiter: delimiter || undefined,\n        skipEmptyLines: true,\n        dynamicTyping: true,\n      })\n\n      const rows = (result.data as unknown[]).slice(0, limit)\n      const warnings =\n        result.errors.length > 0\n          ? `Parse warnings: ${result.errors\n              .slice(0, 3)\n              .map((e) => e.message)\n              .join('; ')}\\n\\n`\n          : ''\n      const truncated =\n        result.data.length > limit ? `\\n\\n(Showing ${limit} of ${result.data.length} rows)` : ''\n\n      return warnings + JSON.stringify(rows, null, 2) + truncated\n    } catch (err) {\n      return `Error: ${isError(err) ? err.message : String(err)}`\n    }\n  },\n})\n\n/**\n * Parse a YAML string into JSON.\n *\n * @remarks\n * Returns a pretty-printed JSON representation of the parsed YAML document. Invalid YAML\n * returns an error string.\n */\nexport const parseYamlTool = new Tool({\n  name: 'parse_yaml',\n  description: 'Parse a YAML string and return the equivalent JSON.',\n  inputSchema: validator.object({\n    text: validator.string().required().description('YAML text to parse'),\n  }),\n  artifactConstructor: () => SpooledJsonArtifact,\n  handler: async (args) => {\n    const { text } = args as { text: string }\n    try {\n      const parsed = parseYaml(text)\n      return JSON.stringify(parsed, null, 2)\n    } catch (err) {\n      return `Error: Invalid YAML — ${isError(err) ? err.message : String(err)}`\n    }\n  },\n})\n\n/**\n * Extract key-value pairs from text.\n *\n * @remarks\n * Handles `.env` files, config files, and query strings. `kv_delimiter` chooses the\n * key→value separator (`=`, `:`, or `auto`); `pair_delimiter` selects how pairs are separated\n * (`newline`, `comma`, `semicolon`, `ampersand`). Surrounding single or double quotes around\n * values are stripped. Comment lines starting with `#` are skipped by default.\n */\nexport const parseKvTool = new Tool({\n  name: 'parse_kv',\n  description:\n    'Extract key-value pairs from text (e.g. .env files, config files, query strings). Returns a JSON object.',\n  inputSchema: validator.object({\n    text: validator.string().required().description('Text containing key-value pairs'),\n    kv_delimiter: validator\n      .string()\n      .valid('=', ':', 'auto')\n      .default('auto')\n      .description('Separator between key and value (default: auto-detect)'),\n    pair_delimiter: validator\n      .string()\n      .valid('newline', 'comma', 'semicolon', 'ampersand')\n      .default('newline')\n      .description('Separator between pairs (default: newline)'),\n    skip_comments: validator\n      .boolean()\n      .default(true)\n      .description('Skip lines starting with # (default: true)'),\n  }),\n  artifactConstructor: () => SpooledJsonArtifact,\n  handler: async (args) => {\n    const {\n      text,\n      kv_delimiter: kvDelim,\n      pair_delimiter: pairDelimKey,\n      skip_comments: skipComments,\n    } = args as {\n      text: string\n      kv_delimiter: string\n      pair_delimiter: string\n      skip_comments: boolean\n    }\n\n    const pairDelimMap: Record<string, string> = {\n      newline: '\\n',\n      comma: ',',\n      semicolon: ';',\n      ampersand: '&',\n    }\n    const pairDelim = pairDelimMap[pairDelimKey] ?? '\\n'\n\n    const result: Record<string, string> = {}\n\n    for (const raw of text.split(pairDelim)) {\n      const line = raw.trim()\n      if (line === '') continue\n      if (skipComments && line.startsWith('#')) continue\n\n      const delim =\n        kvDelim === 'auto' ? (line.includes('=') ? '=' : line.includes(':') ? ':' : null) : kvDelim\n      if (!delim) continue\n\n      const sepIdx = line.indexOf(delim)\n      if (sepIdx === -1) continue\n\n      const key = line.slice(0, sepIdx).trim()\n      let value = line.slice(sepIdx + delim.length).trim()\n\n      if (\n        (value.startsWith('\"') && value.endsWith('\"')) ||\n        (value.startsWith(\"'\") && value.endsWith(\"'\"))\n      ) {\n        value = value.slice(1, -1)\n      }\n\n      if (key) result[key] = value\n    }\n\n    return JSON.stringify(result, null, 2)\n  },\n})\n\n/**\n * Detect the most likely field delimiter in a CSV-like text sample.\n *\n * @remarks\n * Tries comma, tab, semicolon, pipe, and colon. Scores each by mean field count divided by\n * variance (so consistent row widths beat noisy splits). Looks at up to the first 20 lines of\n * the first 5000 characters.\n */\nexport const detectDelimiterTool = new Tool({\n  name: 'detect_delimiter',\n  description: 'Detect the most likely field delimiter in a CSV-like text sample.',\n  inputSchema: validator.object({\n    text: validator.string().required().description('Sample of the delimited text to analyze'),\n  }),\n  handler: async (args) => {\n    const { text } = args as { text: string }\n    const sample = text.slice(0, 5000)\n    const lines = sample\n      .split('\\n')\n      .map((l) => l.trim())\n      .filter((l) => l.length > 0)\n      .slice(0, 20)\n\n    if (lines.length === 0) return 'Error: No lines to analyze.'\n\n    const candidates: Array<{ delim: string; name: string }> = [\n      { delim: ',', name: 'comma' },\n      { delim: '\\t', name: 'tab' },\n      { delim: ';', name: 'semicolon' },\n      { delim: '|', name: 'pipe' },\n      { delim: ':', name: 'colon' },\n    ]\n\n    let best = { name: 'comma', delim: ',', score: -1, avgFields: 0 }\n\n    for (const { delim, name } of candidates) {\n      const counts = lines.map((l) => l.split(delim).length - 1)\n      const avg = counts.reduce((a, b) => a + b, 0) / counts.length\n      if (avg === 0) continue\n      const fieldVariance = counts.reduce((a, b) => a + (b - avg) ** 2, 0) / counts.length\n      const score = avg / (1 + fieldVariance)\n      if (score > best.score) {\n        best = { name, delim, score, avgFields: Number.parseFloat((avg + 1).toFixed(1)) }\n      }\n    }\n\n    return `Detected delimiter: ${best.name} (\"${best.delim === '\\t' ? '\\\\t' : best.delim}\") — ~${best.avgFields} fields per row`\n  },\n})\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;AAyBA,IAAa,eAAe,IAAI,KAAK;CACnC,MAAM;CACN,aACE;CACF,aAAa,UAAU,OAAO;EAC5B,MAAM,UAAU,OAAO,EAAE,SAAS,EAAE,YAAY,0BAA0B;EAC1E,YAAY,UACT,QAAQ,EACR,QAAQ,IAAI,EACZ,YAAY,2CAA2C;EAC1D,WAAW,UACR,OAAO,EACP,QAAQ,EAAE,EACV,MAAM,EAAE,EACR,YAAY,kEAAgE;EAC/E,OAAO,UAAU,OAAO,EAAE,QAAQ,GAAI,EAAE,YAAY,wCAAwC;CAC9F,CAAC;CACD,2BAA2B;CAC3B,SAAS,OAAO,SAAS;EACvB,MAAM,EACJ,MACA,YAAY,WACZ,WACA,OAAO,aACL;EAMJ,MAAM,QAAQ,KAAK,IAAI,KAAQ,KAAK,IAAI,GAAG,KAAK,MAAM,QAAQ,CAAC,CAAC;EAEhE,IAAI;GACF,MAAM,SAAS,KAAK,MAAe,KAAK,KAAK,GAAG;IAC9C,QAAQ;IACR,WAAW,aAAa,KAAA;IACxB,gBAAgB;IAChB,eAAe;GACjB,CAAC;GAED,MAAM,OAAQ,OAAO,KAAmB,MAAM,GAAG,KAAK;GACtD,MAAM,WACJ,OAAO,OAAO,SAAS,IACnB,mBAAmB,OAAO,OACvB,MAAM,GAAG,CAAC,EACV,KAAK,MAAM,EAAE,OAAO,EACpB,KAAK,IAAI,EAAE,QACd;GACN,MAAM,YACJ,OAAO,KAAK,SAAS,QAAQ,gBAAgB,MAAM,MAAM,OAAO,KAAK,OAAO,UAAU;GAExF,OAAO,WAAW,KAAK,UAAU,MAAM,MAAM,CAAC,IAAI;EACpD,SAAS,KAAK;GACZ,OAAO,UAAU,QAAQ,GAAG,IAAI,IAAI,UAAU,OAAO,GAAG;EAC1D;CACF;AACF,CAAC;;;;;;;;AASD,IAAa,gBAAgB,IAAI,KAAK;CACpC,MAAM;CACN,aAAa;CACb,aAAa,UAAU,OAAO,EAC5B,MAAM,UAAU,OAAO,EAAE,SAAS,EAAE,YAAY,oBAAoB,EACtE,CAAC;CACD,2BAA2B;CAC3B,SAAS,OAAO,SAAS;EACvB,MAAM,EAAE,SAAS;EACjB,IAAI;GACF,MAAM,SAAS,KAAU,IAAI;GAC7B,OAAO,KAAK,UAAU,QAAQ,MAAM,CAAC;EACvC,SAAS,KAAK;GACZ,OAAO,yBAAyB,QAAQ,GAAG,IAAI,IAAI,UAAU,OAAO,GAAG;EACzE;CACF;AACF,CAAC;;;;;;;;;;AAWD,IAAa,cAAc,IAAI,KAAK;CAClC,MAAM;CACN,aACE;CACF,aAAa,UAAU,OAAO;EAC5B,MAAM,UAAU,OAAO,EAAE,SAAS,EAAE,YAAY,iCAAiC;EACjF,cAAc,UACX,OAAO,EACP,MAAM,KAAK,KAAK,MAAM,EACtB,QAAQ,MAAM,EACd,YAAY,wDAAwD;EACvE,gBAAgB,UACb,OAAO,EACP,MAAM,WAAW,SAAS,aAAa,WAAW,EAClD,QAAQ,SAAS,EACjB,YAAY,4CAA4C;EAC3D,eAAe,UACZ,QAAQ,EACR,QAAQ,IAAI,EACZ,YAAY,4CAA4C;CAC7D,CAAC;CACD,2BAA2B;CAC3B,SAAS,OAAO,SAAS;EACvB,MAAM,EACJ,MACA,cAAc,SACd,gBAAgB,cAChB,eAAe,iBACb;EAaJ,MAAM,YAAY;GALhB,SAAS;GACT,OAAO;GACP,WAAW;GACX,WAAW;EAEK,EAAa,iBAAiB;EAEhD,MAAM,SAAiC,CAAC;EAExC,KAAK,MAAM,OAAO,KAAK,MAAM,SAAS,GAAG;GACvC,MAAM,OAAO,IAAI,KAAK;GACtB,IAAI,SAAS,IAAI;GACjB,IAAI,gBAAgB,KAAK,WAAW,GAAG,GAAG;GAE1C,MAAM,QACJ,YAAY,SAAU,KAAK,SAAS,GAAG,IAAI,MAAM,KAAK,SAAS,GAAG,IAAI,MAAM,OAAQ;GACtF,IAAI,CAAC,OAAO;GAEZ,MAAM,SAAS,KAAK,QAAQ,KAAK;GACjC,IAAI,WAAW,IAAI;GAEnB,MAAM,MAAM,KAAK,MAAM,GAAG,MAAM,EAAE,KAAK;GACvC,IAAI,QAAQ,KAAK,MAAM,SAAS,MAAM,MAAM,EAAE,KAAK;GAEnD,IACG,MAAM,WAAW,IAAG,KAAK,MAAM,SAAS,IAAG,KAC3C,MAAM,WAAW,GAAG,KAAK,MAAM,SAAS,GAAG,GAE5C,QAAQ,MAAM,MAAM,GAAG,EAAE;GAG3B,IAAI,KAAK,OAAO,OAAO;EACzB;EAEA,OAAO,KAAK,UAAU,QAAQ,MAAM,CAAC;CACvC;AACF,CAAC;;;;;;;;;AAUD,IAAa,sBAAsB,IAAI,KAAK;CAC1C,MAAM;CACN,aAAa;CACb,aAAa,UAAU,OAAO,EAC5B,MAAM,UAAU,OAAO,EAAE,SAAS,EAAE,YAAY,yCAAyC,EAC3F,CAAC;CACD,SAAS,OAAO,SAAS;EACvB,MAAM,EAAE,SAAS;EAEjB,MAAM,QADS,KAAK,MAAM,GAAG,GACf,EACX,MAAM,IAAI,EACV,KAAK,MAAM,EAAE,KAAK,CAAC,EACnB,QAAQ,MAAM,EAAE,SAAS,CAAC,EAC1B,MAAM,GAAG,EAAE;EAEd,IAAI,MAAM,WAAW,GAAG,OAAO;EAE/B,MAAM,aAAqD;GACzD;IAAE,OAAO;IAAK,MAAM;GAAQ;GAC5B;IAAE,OAAO;IAAM,MAAM;GAAM;GAC3B;IAAE,OAAO;IAAK,MAAM;GAAY;GAChC;IAAE,OAAO;IAAK,MAAM;GAAO;GAC3B;IAAE,OAAO;IAAK,MAAM;GAAQ;EAC9B;EAEA,IAAI,OAAO;GAAE,MAAM;GAAS,OAAO;GAAK,OAAO;GAAI,WAAW;EAAE;EAEhE,KAAK,MAAM,EAAE,OAAO,UAAU,YAAY;GACxC,MAAM,SAAS,MAAM,KAAK,MAAM,EAAE,MAAM,KAAK,EAAE,SAAS,CAAC;GACzD,MAAM,MAAM,OAAO,QAAQ,GAAG,MAAM,IAAI,GAAG,CAAC,IAAI,OAAO;GACvD,IAAI,QAAQ,GAAG;GAEf,MAAM,QAAQ,OAAO,IADC,OAAO,QAAQ,GAAG,MAAM,KAAK,IAAI,QAAQ,GAAG,CAAC,IAAI,OAAO;GAE9E,IAAI,QAAQ,KAAK,OACf,OAAO;IAAE;IAAM;IAAO;IAAO,WAAW,OAAO,YAAY,MAAM,GAAG,QAAQ,CAAC,CAAC;GAAE;EAEpF;EAEA,OAAO,uBAAuB,KAAK,KAAK,KAAK,KAAK,UAAU,MAAO,QAAQ,KAAK,MAAM,QAAQ,KAAK,UAAU;CAC/G;AACF,CAAC"}
+{"version":3,"file":"parsing.mjs","names":[],"sources":["../../../src/batteries/tools/parsing/index.ts"],"sourcesContent":["/**\n * Pre-constructed tools for parsing CSV, TSV, JSON, YAML, and other structured text formats.\n *\n * @module @nhtio/adk/batteries/tools/parsing\n *\n * @remarks\n * Pre-constructed bundled tools for the `parsing` category. Import individually, the whole\n * category, or import every tool via `@nhtio/adk/batteries`.\n */\n\nimport { load as parseYaml } from 'js-yaml'\nimport { default as Papa } from 'papaparse'\nimport { isError } from '@nhtio/adk/guards'\nimport { validator } from '@nhtio/validation'\nimport { Tool, SpooledJsonArtifact } from '@nhtio/adk/common'\n\n/**\n * Parse a CSV or TSV string into a JSON array.\n *\n * @remarks\n * With `has_header: true` (default), each row becomes an object keyed by column name. Without a\n * header, rows are returned as positional arrays. `delimiter` auto-detects when omitted; pass\n * `\"\\t\"` for TSV. Rows are clipped to `limit` (default 1000, max 10000). Parse warnings are\n * prepended to the output.\n */\nexport const parseCsvTool = new Tool({\n  name: 'parse_csv',\n  description:\n    'Parse a CSV or TSV string into a JSON array. With a header row, returns objects keyed by column name. Without, returns arrays of values.',\n  inputSchema: validator.object({\n    text: validator.string().required().description('CSV or TSV text to parse'),\n    has_header: validator\n      .boolean()\n      .default(true)\n      .description('First row is a header row (default: true)'),\n    delimiter: validator\n      .string()\n      .default('')\n      .allow('')\n      .description('Field delimiter — auto-detected if omitted. Use \"\\\\t\" for TSV.'),\n    limit: validator.number().default(1000).description('Maximum rows to return (default: 1000)'),\n  }),\n  artifactConstructor: () => SpooledJsonArtifact,\n  handler: async (args) => {\n    const {\n      text,\n      has_header: hasHeader,\n      delimiter,\n      limit: rawLimit,\n    } = args as {\n      text: string\n      has_header: boolean\n      delimiter: string\n      limit: number\n    }\n    const limit = Math.min(10_000, Math.max(1, Math.floor(rawLimit)))\n\n    try {\n      const result = Papa.parse<unknown>(text.trim(), {\n        header: hasHeader,\n        delimiter: delimiter || undefined,\n        skipEmptyLines: true,\n        dynamicTyping: true,\n      })\n\n      const rows = (result.data as unknown[]).slice(0, limit)\n      const warnings =\n        result.errors.length > 0\n          ? `Parse warnings: ${result.errors\n              .slice(0, 3)\n              .map((e) => e.message)\n              .join('; ')}\\n\\n`\n          : ''\n      const truncated =\n        result.data.length > limit ? `\\n\\n(Showing ${limit} of ${result.data.length} rows)` : ''\n\n      return warnings + JSON.stringify(rows, null, 2) + truncated\n    } catch (err) {\n      return `Error: ${isError(err) ? err.message : String(err)}`\n    }\n  },\n})\n\n/**\n * Parse a YAML string into JSON.\n *\n * @remarks\n * Returns a pretty-printed JSON representation of the parsed YAML document. Invalid YAML\n * returns an error string.\n */\nexport const parseYamlTool = new Tool({\n  name: 'parse_yaml',\n  description: 'Parse a YAML string and return the equivalent JSON.',\n  inputSchema: validator.object({\n    text: validator.string().required().description('YAML text to parse'),\n  }),\n  artifactConstructor: () => SpooledJsonArtifact,\n  handler: async (args) => {\n    const { text } = args as { text: string }\n    try {\n      const parsed = parseYaml(text)\n      // An empty / whitespace-only / BOM-only document parses to `undefined`, and\n      // `JSON.stringify(undefined)` returns the JS value `undefined` (not a string), breaking the\n      // tool's string-return contract. Normalise that empty document to JSON `null`.\n      if (parsed === undefined) return 'null'\n      // YAML permits .NaN / .inf / -.inf, which `JSON.stringify` would silently turn into `null`,\n      // losing the value. Render non-finite numbers as their YAML token strings so the information\n      // survives the JSON round-trip instead of being corrupted to null.\n      return JSON.stringify(\n        parsed,\n        (_key, value) => {\n          if (typeof value === 'number' && !Number.isFinite(value)) {\n            return Number.isNaN(value) ? '.NaN' : value > 0 ? '.inf' : '-.inf'\n          }\n          return value\n        },\n        2\n      )\n    } catch (err) {\n      return `Error: Invalid YAML — ${isError(err) ? err.message : String(err)}`\n    }\n  },\n})\n\n/**\n * Extract key-value pairs from text.\n *\n * @remarks\n * Handles `.env` files, config files, and query strings. `kv_delimiter` chooses the\n * key→value separator (`=`, `:`, or `auto`); `pair_delimiter` selects how pairs are separated\n * (`newline`, `comma`, `semicolon`, `ampersand`). Surrounding single or double quotes around\n * values are stripped. Comment lines starting with `#` are skipped by default.\n */\nexport const parseKvTool = new Tool({\n  name: 'parse_kv',\n  description:\n    'Extract key-value pairs from text (e.g. .env files, config files, query strings). Returns a JSON object.',\n  inputSchema: validator.object({\n    text: validator.string().required().description('Text containing key-value pairs'),\n    kv_delimiter: validator\n      .string()\n      .valid('=', ':', 'auto')\n      .default('auto')\n      .description('Separator between key and value (default: auto-detect)'),\n    pair_delimiter: validator\n      .string()\n      .valid('newline', 'comma', 'semicolon', 'ampersand')\n      .default('newline')\n      .description('Separator between pairs (default: newline)'),\n    skip_comments: validator\n      .boolean()\n      .default(true)\n      .description('Skip lines starting with # (default: true)'),\n  }),\n  artifactConstructor: () => SpooledJsonArtifact,\n  handler: async (args) => {\n    const {\n      text,\n      kv_delimiter: kvDelim,\n      pair_delimiter: pairDelimKey,\n      skip_comments: skipComments,\n    } = args as {\n      text: string\n      kv_delimiter: string\n      pair_delimiter: string\n      skip_comments: boolean\n    }\n\n    const pairDelimMap: Record<string, string> = {\n      newline: '\\n',\n      comma: ',',\n      semicolon: ';',\n      ampersand: '&',\n    }\n    const pairDelim = pairDelimMap[pairDelimKey] ?? '\\n'\n\n    const result: Record<string, string> = {}\n\n    for (const raw of text.split(pairDelim)) {\n      const line = raw.trim()\n      if (line === '') continue\n      if (skipComments && line.startsWith('#')) continue\n\n      const delim =\n        kvDelim === 'auto' ? (line.includes('=') ? '=' : line.includes(':') ? ':' : null) : kvDelim\n      if (!delim) continue\n\n      const sepIdx = line.indexOf(delim)\n      if (sepIdx === -1) continue\n\n      const key = line.slice(0, sepIdx).trim()\n      let value = line.slice(sepIdx + delim.length).trim()\n\n      if (\n        (value.startsWith('\"') && value.endsWith('\"')) ||\n        (value.startsWith(\"'\") && value.endsWith(\"'\"))\n      ) {\n        value = value.slice(1, -1)\n      }\n\n      if (key) result[key] = value\n    }\n\n    return JSON.stringify(result, null, 2)\n  },\n})\n\n/**\n * Detect the most likely field delimiter in a CSV-like text sample.\n *\n * @remarks\n * Tries comma, tab, semicolon, pipe, and colon. Scores each by mean field count divided by\n * variance (so consistent row widths beat noisy splits). Looks at up to the first 20 lines of\n * the first 5000 characters.\n */\nexport const detectDelimiterTool = new Tool({\n  name: 'detect_delimiter',\n  description: 'Detect the most likely field delimiter in a CSV-like text sample.',\n  inputSchema: validator.object({\n    text: validator.string().required().description('Sample of the delimited text to analyze'),\n  }),\n  handler: async (args) => {\n    const { text } = args as { text: string }\n    const sample = text.slice(0, 5000)\n    const lines = sample\n      .split('\\n')\n      .map((l) => l.trim())\n      .filter((l) => l.length > 0)\n      .slice(0, 20)\n\n    if (lines.length === 0) return 'Error: No lines to analyze.'\n\n    const candidates: Array<{ delim: string; name: string }> = [\n      { delim: ',', name: 'comma' },\n      { delim: '\\t', name: 'tab' },\n      { delim: ';', name: 'semicolon' },\n      { delim: '|', name: 'pipe' },\n      { delim: ':', name: 'colon' },\n    ]\n\n    let best = { name: 'comma', delim: ',', score: -1, avgFields: 0 }\n\n    for (const { delim, name } of candidates) {\n      const counts = lines.map((l) => l.split(delim).length - 1)\n      const avg = counts.reduce((a, b) => a + b, 0) / counts.length\n      if (avg === 0) continue\n      const fieldVariance = counts.reduce((a, b) => a + (b - avg) ** 2, 0) / counts.length\n      const score = avg / (1 + fieldVariance)\n      if (score > best.score) {\n        best = { name, delim, score, avgFields: Number.parseFloat((avg + 1).toFixed(1)) }\n      }\n    }\n\n    return `Detected delimiter: ${best.name} (\"${best.delim === '\\t' ? '\\\\t' : best.delim}\") — ~${best.avgFields} fields per row`\n  },\n})\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;AAyBA,IAAa,eAAe,IAAI,KAAK;CACnC,MAAM;CACN,aACE;CACF,aAAa,UAAU,OAAO;EAC5B,MAAM,UAAU,OAAO,EAAE,SAAS,EAAE,YAAY,0BAA0B;EAC1E,YAAY,UACT,QAAQ,EACR,QAAQ,IAAI,EACZ,YAAY,2CAA2C;EAC1D,WAAW,UACR,OAAO,EACP,QAAQ,EAAE,EACV,MAAM,EAAE,EACR,YAAY,kEAAgE;EAC/E,OAAO,UAAU,OAAO,EAAE,QAAQ,GAAI,EAAE,YAAY,wCAAwC;CAC9F,CAAC;CACD,2BAA2B;CAC3B,SAAS,OAAO,SAAS;EACvB,MAAM,EACJ,MACA,YAAY,WACZ,WACA,OAAO,aACL;EAMJ,MAAM,QAAQ,KAAK,IAAI,KAAQ,KAAK,IAAI,GAAG,KAAK,MAAM,QAAQ,CAAC,CAAC;EAEhE,IAAI;GACF,MAAM,SAAS,KAAK,MAAe,KAAK,KAAK,GAAG;IAC9C,QAAQ;IACR,WAAW,aAAa,KAAA;IACxB,gBAAgB;IAChB,eAAe;GACjB,CAAC;GAED,MAAM,OAAQ,OAAO,KAAmB,MAAM,GAAG,KAAK;GACtD,MAAM,WACJ,OAAO,OAAO,SAAS,IACnB,mBAAmB,OAAO,OACvB,MAAM,GAAG,CAAC,EACV,KAAK,MAAM,EAAE,OAAO,EACpB,KAAK,IAAI,EAAE,QACd;GACN,MAAM,YACJ,OAAO,KAAK,SAAS,QAAQ,gBAAgB,MAAM,MAAM,OAAO,KAAK,OAAO,UAAU;GAExF,OAAO,WAAW,KAAK,UAAU,MAAM,MAAM,CAAC,IAAI;EACpD,SAAS,KAAK;GACZ,OAAO,UAAU,QAAQ,GAAG,IAAI,IAAI,UAAU,OAAO,GAAG;EAC1D;CACF;AACF,CAAC;;;;;;;;AASD,IAAa,gBAAgB,IAAI,KAAK;CACpC,MAAM;CACN,aAAa;CACb,aAAa,UAAU,OAAO,EAC5B,MAAM,UAAU,OAAO,EAAE,SAAS,EAAE,YAAY,oBAAoB,EACtE,CAAC;CACD,2BAA2B;CAC3B,SAAS,OAAO,SAAS;EACvB,MAAM,EAAE,SAAS;EACjB,IAAI;GACF,MAAM,SAAS,KAAU,IAAI;GAI7B,IAAI,WAAW,KAAA,GAAW,OAAO;GAIjC,OAAO,KAAK,UACV,SACC,MAAM,UAAU;IACf,IAAI,OAAO,UAAU,YAAY,CAAC,OAAO,SAAS,KAAK,GACrD,OAAO,OAAO,MAAM,KAAK,IAAI,SAAS,QAAQ,IAAI,SAAS;IAE7D,OAAO;GACT,GACA,CACF;EACF,SAAS,KAAK;GACZ,OAAO,yBAAyB,QAAQ,GAAG,IAAI,IAAI,UAAU,OAAO,GAAG;EACzE;CACF;AACF,CAAC;;;;;;;;;;AAWD,IAAa,cAAc,IAAI,KAAK;CAClC,MAAM;CACN,aACE;CACF,aAAa,UAAU,OAAO;EAC5B,MAAM,UAAU,OAAO,EAAE,SAAS,EAAE,YAAY,iCAAiC;EACjF,cAAc,UACX,OAAO,EACP,MAAM,KAAK,KAAK,MAAM,EACtB,QAAQ,MAAM,EACd,YAAY,wDAAwD;EACvE,gBAAgB,UACb,OAAO,EACP,MAAM,WAAW,SAAS,aAAa,WAAW,EAClD,QAAQ,SAAS,EACjB,YAAY,4CAA4C;EAC3D,eAAe,UACZ,QAAQ,EACR,QAAQ,IAAI,EACZ,YAAY,4CAA4C;CAC7D,CAAC;CACD,2BAA2B;CAC3B,SAAS,OAAO,SAAS;EACvB,MAAM,EACJ,MACA,cAAc,SACd,gBAAgB,cAChB,eAAe,iBACb;EAaJ,MAAM,YAAY;GALhB,SAAS;GACT,OAAO;GACP,WAAW;GACX,WAAW;EAEK,EAAa,iBAAiB;EAEhD,MAAM,SAAiC,CAAC;EAExC,KAAK,MAAM,OAAO,KAAK,MAAM,SAAS,GAAG;GACvC,MAAM,OAAO,IAAI,KAAK;GACtB,IAAI,SAAS,IAAI;GACjB,IAAI,gBAAgB,KAAK,WAAW,GAAG,GAAG;GAE1C,MAAM,QACJ,YAAY,SAAU,KAAK,SAAS,GAAG,IAAI,MAAM,KAAK,SAAS,GAAG,IAAI,MAAM,OAAQ;GACtF,IAAI,CAAC,OAAO;GAEZ,MAAM,SAAS,KAAK,QAAQ,KAAK;GACjC,IAAI,WAAW,IAAI;GAEnB,MAAM,MAAM,KAAK,MAAM,GAAG,MAAM,EAAE,KAAK;GACvC,IAAI,QAAQ,KAAK,MAAM,SAAS,MAAM,MAAM,EAAE,KAAK;GAEnD,IACG,MAAM,WAAW,IAAG,KAAK,MAAM,SAAS,IAAG,KAC3C,MAAM,WAAW,GAAG,KAAK,MAAM,SAAS,GAAG,GAE5C,QAAQ,MAAM,MAAM,GAAG,EAAE;GAG3B,IAAI,KAAK,OAAO,OAAO;EACzB;EAEA,OAAO,KAAK,UAAU,QAAQ,MAAM,CAAC;CACvC;AACF,CAAC;;;;;;;;;AAUD,IAAa,sBAAsB,IAAI,KAAK;CAC1C,MAAM;CACN,aAAa;CACb,aAAa,UAAU,OAAO,EAC5B,MAAM,UAAU,OAAO,EAAE,SAAS,EAAE,YAAY,yCAAyC,EAC3F,CAAC;CACD,SAAS,OAAO,SAAS;EACvB,MAAM,EAAE,SAAS;EAEjB,MAAM,QADS,KAAK,MAAM,GAAG,GACf,EACX,MAAM,IAAI,EACV,KAAK,MAAM,EAAE,KAAK,CAAC,EACnB,QAAQ,MAAM,EAAE,SAAS,CAAC,EAC1B,MAAM,GAAG,EAAE;EAEd,IAAI,MAAM,WAAW,GAAG,OAAO;EAE/B,MAAM,aAAqD;GACzD;IAAE,OAAO;IAAK,MAAM;GAAQ;GAC5B;IAAE,OAAO;IAAM,MAAM;GAAM;GAC3B;IAAE,OAAO;IAAK,MAAM;GAAY;GAChC;IAAE,OAAO;IAAK,MAAM;GAAO;GAC3B;IAAE,OAAO;IAAK,MAAM;GAAQ;EAC9B;EAEA,IAAI,OAAO;GAAE,MAAM;GAAS,OAAO;GAAK,OAAO;GAAI,WAAW;EAAE;EAEhE,KAAK,MAAM,EAAE,OAAO,UAAU,YAAY;GACxC,MAAM,SAAS,MAAM,KAAK,MAAM,EAAE,MAAM,KAAK,EAAE,SAAS,CAAC;GACzD,MAAM,MAAM,OAAO,QAAQ,GAAG,MAAM,IAAI,GAAG,CAAC,IAAI,OAAO;GACvD,IAAI,QAAQ,GAAG;GAEf,MAAM,QAAQ,OAAO,IADC,OAAO,QAAQ,GAAG,MAAM,KAAK,IAAI,QAAQ,GAAG,CAAC,IAAI,OAAO;GAE9E,IAAI,QAAQ,KAAK,OACf,OAAO;IAAE;IAAM;IAAO;IAAO,WAAW,OAAO,YAAY,MAAM,GAAG,QAAQ,CAAC,CAAC;GAAE;EAEpF;EAEA,OAAO,uBAAuB,KAAK,KAAK,KAAK,KAAK,UAAU,MAAO,QAAQ,KAAK,MAAM,QAAQ,KAAK,UAAU;CAC/G;AACF,CAAC"}

package/batteries/tools/retrievables.cjs

@@ -1,9 +1,9 @@
 Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
 require("../../chunk-Ble4zEEl.js");
-const require_tool_registry = require("../../tool_registry-DYUYqXvo.js");
-const require_tool = require("../../tool-CVyZkFC7.js");
-const require_common = require("../../common-Cj8TaQ9U.js");
-const require_spooled_markdown_artifact = require("../../spooled_markdown_artifact-CALSDxIx.js");
+const require_tool_registry = require("../../tool_registry-CKJPze3j.js");
+const require_tool = require("../../tool-D5WGVIcI.js");
+const require_common = require("../../common-DZl3ADJs.js");
+const require_spooled_markdown_artifact = require("../../spooled_markdown_artifact-ClX72lek.js");
 require("../../guards.cjs");
 let _nhtio_validation = require("@nhtio/validation");
 let luxon = require("luxon");

package/batteries/tools/retrievables.mjs

@@ -1,7 +1,7 @@
-import { o as isError } from "../../tool_registry-D1pSSlsd.mjs";
-import { t as Tool } from "../../tool-CMhaDRNd.mjs";
-import { o as Retrievable } from "../../common-BT0nfCi9.mjs";
-import { n as SpooledJsonArtifact } from "../../spooled_markdown_artifact-Ci5UL7l4.mjs";
+import { o as isError } from "../../tool_registry-791Vrjtf.mjs";
+import { t as Tool } from "../../tool-wMYMVl60.mjs";
+import { o as Retrievable } from "../../common-DYDUi99O.mjs";
+import { n as SpooledJsonArtifact } from "../../spooled_markdown_artifact-wkrBF3oX.mjs";
 import "../../guards.mjs";
 import { validator } from "@nhtio/validation";
 import { DateTime } from "luxon";

package/batteries/tools/searxng/exceptions.d.ts

@@ -0,0 +1,21 @@
+/**
+ * Battery-scoped exception constructors for the SearXNG search tool.
+ *
+ * @remarks
+ * Battery-scoped exception classes owned by the SearXNG tool battery (not the ADK core). Minted
+ * via `createException` from `@nhtio/adk/factories` and re-exported from the battery's barrel
+ * (`@nhtio/adk/batteries/tools/searxng`). This file intentionally carries **no** `@module` tag:
+ * it is an internal sibling relative-imported by `index.ts`, so it does not mint its own
+ * `…/searxng/exceptions` entrypoint (whose `exceptions` leaf basename would collide with sibling
+ * batteries under the `vite-plugin-dts` rolled-up `.d.ts` rule).
+ */
+/**
+ * Thrown when {@link createSearxngSearchTool} receives invalid configuration.
+ *
+ * @remarks
+ * Fatal: config bugs (missing or unparseable `instanceUrl`) fail loud at factory-call time
+ * rather than at the first search.
+ */
+export declare const E_INVALID_SEARXNG_CONFIG: import("../../../factories").CreatedException<[
+    string
+]>;