@nhtio/adk 1.20260607.2 → 1.20260609.0

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

@@ -0,0 +1,150 @@
+/**
+ * Factory for a configured SearXNG metasearch tool.
+ *
+ * @module @nhtio/adk/batteries/tools/searxng
+ *
+ * @remarks
+ * Unlike the other bundled tool categories — every one of which exports a ready-made,
+ * stateless `Tool` constant — the SearXNG battery exports a **factory**,
+ * {@link createSearxngSearchTool}. A search tool has to talk to a *specific* SearXNG instance,
+ * usually behind custom authentication, so it needs per-deployment configuration (a base URL
+ * and headers) that cannot be baked in at module load.
+ *
+ * Because this module exports a factory rather than a `Tool` instance, it MUST NOT be
+ * bulk-registered via `Object.values(batteries)`. Call the factory first, then register the
+ * returned tool: `new ToolRegistry([createSearxngSearchTool({ instanceUrl })])`.
+ *
+ * @see https://docs.searxng.org/dev/search_api.html
+ */
+import { Tool, type ArtifactConstructorResolver } from "../../../common";
+import type { NextFn } from '@nhtio/middleware';
+export { E_INVALID_SEARXNG_CONFIG } from "./exceptions";
+/** A static set of request headers (used for custom authentication). */
+export type SearxngHeaders = Record<string, string>;
+/**
+ * A resolver returning request headers, sync or async. Use this form when the auth token is
+ * refreshable — the resolver runs on every search, so a fresh token can be minted per call.
+ */
+export type SearxngHeadersResolver = () => SearxngHeaders | Promise<SearxngHeaders>;
+/** The output shape the tool serialises. `either` lets the model pick per call. */
+export type SearxngResultFormat = 'normalized' | 'raw' | 'either';
+/**
+ * A single normalised SearXNG result. SearXNG result items are deliberately untyped upstream,
+ * so every field except a best-effort `title`/`url` is optional.
+ */
+export interface SearxngResult {
+    /** Result title, when the source engine provided one. */
+    title?: string;
+    /** Result URL, when the source engine provided one. */
+    url?: string;
+    /** Snippet / summary text for the result. */
+    content?: string;
+    /** The SearXNG engine that produced this result (e.g. `google`, `duckduckgo`). */
+    engine?: string;
+    /** Relevance score as reported by SearXNG (higher is more relevant). */
+    score?: number;
+    /** Publication date, when the source engine exposed one (ISO-ish string, engine-dependent). */
+    publishedDate?: string;
+}
+/**
+ * Mutable context handed to each input-pipeline stage **before** the HTTP request is sent.
+ *
+ * @remarks
+ * Stages mutate this in place (onion `(ctx, next)` style) to adjust the outgoing request —
+ * inject or rotate auth headers, force a language, rewrite the query — or call
+ * {@link SearxngRequestContext.shortCircuit} to skip the fetch entirely (e.g. a cache hit).
+ */
+export interface SearxngRequestContext {
+    /** The tool's name (read-only). */
+    readonly toolName: string;
+    /** The search query. Mutable. */
+    query: string;
+    /** Extra SearXNG query parameters (`categories`, `engines`, `language`, …). Mutable. */
+    params: Record<string, string>;
+    /** Resolved request headers. Mutable — inject, redact, or rotate auth here. */
+    headers: SearxngHeaders;
+    /** The target instance base URL (read-only). */
+    readonly instanceUrl: string;
+    /** Cross-stage scratch space; also carried onto the response context. */
+    readonly stash: Map<string, unknown>;
+    /** Skip the fetch and return `result` verbatim as the tool's output. */
+    shortCircuit(result: string): void;
+}
+/**
+ * Mutable context handed to each output-pipeline stage **after** the response JSON is parsed.
+ *
+ * @remarks
+ * Stages reshape, redact, enrich, or re-rank {@link SearxngResponseContext.results}, mutate the
+ * raw body, or set {@link SearxngResponseContext.output} to override the serialised string
+ * verbatim (e.g. to render markdown that matches a markdown `artifactConstructor`).
+ */
+export interface SearxngResponseContext {
+    /** The tool's name (read-only). */
+    readonly toolName: string;
+    /** The request context as it was sent (post-input-pipeline). */
+    readonly request: SearxngRequestContext;
+    /** The parsed SearXNG JSON body. Mutable (used when `format` is `raw`). */
+    raw: unknown;
+    /** The normalised result list. Mutable — filter, redact, or re-rank. */
+    results: SearxngResult[];
+    /** The effective payload shape for this call. */
+    format: 'normalized' | 'raw';
+    /** When set, used verbatim as the tool's output (overrides serialisation). */
+    output?: string;
+    /** Cross-stage scratch space; carried over from the request context. */
+    readonly stash: Map<string, unknown>;
+}
+/** An input-pipeline stage. Onion middleware over {@link SearxngRequestContext}. */
+export type SearxngInputMiddlewareFn = (ctx: SearxngRequestContext, next: NextFn) => void | Promise<void>;
+/** An output-pipeline stage. Onion middleware over {@link SearxngResponseContext}. */
+export type SearxngOutputMiddlewareFn = (ctx: SearxngResponseContext, next: NextFn) => void | Promise<void>;
+/** Configuration for {@link createSearxngSearchTool}. */
+export interface SearxngToolConfig {
+    /** Base URL of the SearXNG instance, e.g. `https://searx.example.org`. Required. */
+    instanceUrl: string;
+    /** Custom request headers — a static object or a (sync/async) resolver for refreshable auth. */
+    headers?: SearxngHeaders | SearxngHeadersResolver;
+    /** Request timeout in milliseconds. Default `10_000`. */
+    timeout?: number;
+    /**
+     * Output shape. `normalized`/`raw` pin the shape (the model cannot change it); `either`
+     * (default) exposes a `format` argument so the model chooses per call.
+     */
+    resultFormat?: SearxngResultFormat;
+    /** Tool name. Default `searxng_search`. */
+    name?: string;
+    /** Tool description override. */
+    description?: string;
+    /**
+     * Spool artifact constructor for the tool's output. Default `() => SpooledJsonArtifact`.
+     * Pass `() => SpooledMarkdownArtifact` (paired with an output stage that renders markdown into
+     * `ctx.output`) or `() => SpooledArtifact` for plain text.
+     */
+    artifactConstructor?: ArtifactConstructorResolver;
+    /** Stages run before the HTTP request. See {@link SearxngRequestContext}. */
+    inputPipeline?: SearxngInputMiddlewareFn[];
+    /** Stages run after the response is parsed. See {@link SearxngResponseContext}. */
+    outputPipeline?: SearxngOutputMiddlewareFn[];
+}
+/**
+ * Create a configured SearXNG search {@link Tool}.
+ *
+ * @remarks
+ * The handler always requests `format=json`. Note that SearXNG ships with JSON output
+ * **disabled** by default (it is abused by bots); an instance that has not enabled
+ * `search.formats: [json]` in its `settings.yml` answers with HTTP 403, which the tool returns
+ * as a graceful `Error:` string naming the setting.
+ *
+ * @warning
+ * Do not trust the `number_of_results` field for a result count — SearXNG frequently reports `0`
+ * in JSON output even when `results` is non-empty. This is a long-standing upstream quirk, not a
+ * tool defect (see {@link https://github.com/searxng/searxng/issues/2987 | searxng#2987} and
+ * {@link https://github.com/searxng/searxng/issues/2457 | searxng#2457}). The tool passes the
+ * field through verbatim; use `results.length` as the authoritative count.
+ *
+ * @param config - The instance URL, optional custom headers, output-format policy, artifact
+ *   type, and input/output middleware pipelines. See {@link SearxngToolConfig}.
+ * @returns A `Tool` ready to register in a `ToolRegistry`.
+ * @throws {@link E_INVALID_SEARXNG_CONFIG} when `instanceUrl` is missing or unparseable.
+ */
+export declare const createSearxngSearchTool: (config: SearxngToolConfig) => Tool;

package/batteries/tools/searxng.cjs

@@ -0,0 +1,5 @@
+Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
+require("../../chunk-Ble4zEEl.js");
+const require_searxng = require("../../searxng-Bkrwhwhw.js");
+exports.E_INVALID_SEARXNG_CONFIG = require_searxng.E_INVALID_SEARXNG_CONFIG;
+exports.createSearxngSearchTool = require_searxng.createSearxngSearchTool;

package/batteries/tools/searxng.mjs

@@ -0,0 +1,2 @@
+import { n as E_INVALID_SEARXNG_CONFIG, t as createSearxngSearchTool } from "../../searxng-CyA-nEu5.mjs";
+export { E_INVALID_SEARXNG_CONFIG, createSearxngSearchTool };

package/batteries/tools/standing_instructions.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");
-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");
 //#region src/batteries/tools/standing_instructions/index.ts

package/batteries/tools/standing_instructions.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";
 //#region src/batteries/tools/standing_instructions/index.ts

package/batteries/tools/statistics.cjs

@@ -1,10 +1,11 @@
 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");
-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");
+const require_lib_helpers_bignum = require("../../lib/helpers/bignum.cjs");
 let _nhtio_validation = require("@nhtio/validation");
 let simple_statistics = require("simple-statistics");
 //#region src/batteries/tools/statistics/index.ts
@@ -17,18 +18,24 @@ let simple_statistics = require("simple-statistics");
 * Pre-constructed bundled tools for the `statistics` category. Import individually, the whole
 * category, or import every tool via `@nhtio/adk/batteries`.
 */
+/**
+* Normalise the `numbers`/`x`/`y` input to a `number[]`.
+*
+* @remarks
+* The input schema is `validator.array().items(validator.number())`, which already rejects
+* `NaN`, `±Infinity`, and magnitudes `> Number.MAX_SAFE_INTEGER` before the handler runs — so by
+* the time a value reaches here it is a finite, in-range float64. This guard only enforces
+* non-emptiness (and defensively re-checks the array shape). It deliberately NO LONGER silently
+* drops non-finite entries: those can't arrive through the typed schema, and a silent filter hid
+* real input errors.
+*/
 function parseNumbers(input) {
-	let arr = input;
-	if (typeof input === "string") try {
-		arr = JSON.parse(input);
-	} catch {
-		return { error: "Invalid JSON — expected an array of numbers." };
-	}
-	if (!Array.isArray(arr)) return { error: "Input must be a JSON array of numbers." };
-	const nums = arr.filter((v) => typeof v === "number" && Number.isFinite(v));
-	if (nums.length === 0) return { error: "No finite numbers found in the array." };
-	return nums;
+	if (!Array.isArray(input)) return { error: "Input must be an array of numbers." };
+	if (input.length === 0) return { error: "Array must contain at least one number." };
+	return input;
 }
+/** Shared `precision` schema fragment (significant digits for numeric output, default 8). */
+var precisionField = _nhtio_validation.validator.number().default(8).description(`Significant digits for numeric output (default: 8).`);
 /**
 * Compute descriptive statistics for a JSON array of numbers.
 *
@@ -40,25 +47,29 @@ function parseNumbers(input) {
 var statsDescribeTool = new require_tool.Tool({
 	name: "stats_describe",
 	description: "Compute descriptive statistics for a numeric array: count, sum, min, max, range, mean, median, mode, variance, standard deviation, quartiles (Q1–Q3), IQR, and key percentiles.",
-	inputSchema: _nhtio_validation.validator.object({ numbers: _nhtio_validation.validator.string().required().description("JSON array of numbers") }),
+	inputSchema: _nhtio_validation.validator.object({
+		numbers: _nhtio_validation.validator.array().items(_nhtio_validation.validator.number()).required().description("Array of numbers"),
+		precision: precisionField
+	}),
 	artifactConstructor: () => require_spooled_markdown_artifact.SpooledJsonArtifact,
 	handler: async (args) => {
-		const { numbers } = args;
+		const { numbers, precision } = args;
 		const nums = parseNumbers(numbers);
 		if ("error" in nums) return `Error: ${nums.error}`;
 		const sorted = [...nums].sort((a, b) => a - b);
 		const modeVal = (0, simple_statistics.mode)(nums);
+		const fmt = (n) => require_lib_helpers_bignum.formatBig(n, precision);
 		return JSON.stringify({
 			count: nums.length,
-			sum: Number.parseFloat((0, simple_statistics.sum)(nums).toPrecision(12)),
+			sum: require_lib_helpers_bignum.formatBig(require_lib_helpers_bignum.bigSum(nums), precision),
 			min: (0, simple_statistics.min)(nums),
 			max: (0, simple_statistics.max)(nums),
 			range: (0, simple_statistics.max)(nums) - (0, simple_statistics.min)(nums),
-			mean: Number.parseFloat((0, simple_statistics.mean)(nums).toPrecision(10)),
+			mean: require_lib_helpers_bignum.formatBig(require_lib_helpers_bignum.bigMean(nums), precision),
 			median: (0, simple_statistics.median)(nums),
 			mode: modeVal,
-			variance: Number.parseFloat((0, simple_statistics.variance)(nums).toPrecision(8)),
-			std_dev: Number.parseFloat((0, simple_statistics.standardDeviation)(nums).toPrecision(8)),
+			variance: fmt((0, simple_statistics.variance)(nums)),
+			std_dev: fmt((0, simple_statistics.standardDeviation)(nums)),
 			q1: (0, simple_statistics.quantile)(sorted, .25),
 			q2: (0, simple_statistics.quantile)(sorted, .5),
 			q3: (0, simple_statistics.quantile)(sorted, .75),
@@ -81,8 +92,8 @@ var statsCorrelateTool = new require_tool.Tool({
 	name: "stats_correlate",
 	description: "Compute the Pearson correlation coefficient between two numeric arrays. Returns the r value (-1 to 1), r², and a plain-English interpretation.",
 	inputSchema: _nhtio_validation.validator.object({
-		x: _nhtio_validation.validator.string().required().description("JSON array of numbers (first variable)"),
-		y: _nhtio_validation.validator.string().required().description("JSON array of numbers (second variable, same length as x)")
+		x: _nhtio_validation.validator.array().items(_nhtio_validation.validator.number()).required().description("Array of numbers (first variable)"),
+		y: _nhtio_validation.validator.array().items(_nhtio_validation.validator.number()).required().description("Array of numbers (second variable, same length as x)")
 	}),
 	handler: async (args) => {
 		const { x: rawX, y: rawY } = args;
@@ -92,6 +103,7 @@ var statsCorrelateTool = new require_tool.Tool({
 		if ("error" in y) return `Error in y: ${y.error}`;
 		if (x.length !== y.length) return `Error: Arrays must be the same length (x: ${x.length}, y: ${y.length}).`;
 		if (x.length < 2) return "Error: At least 2 data points required.";
+		if ((0, simple_statistics.standardDeviation)(x) === 0 || (0, simple_statistics.standardDeviation)(y) === 0) return "Correlation is undefined: at least one variable is constant (zero variance), so Pearson r cannot be computed.";
 		try {
 			const r = (0, simple_statistics.sampleCorrelation)(x, y);
 			const absR = Math.abs(r);
@@ -116,47 +128,45 @@ var statsTransformTool = new require_tool.Tool({
 	name: "stats_transform",
 	description: "Transform a numeric array: normalize (min-max or z-score), compute running totals, rolling averages, percent change between consecutive values, rank each value, or detect outliers.",
 	inputSchema: _nhtio_validation.validator.object({
-		numbers: _nhtio_validation.validator.string().required().description("JSON array of numbers"),
+		numbers: _nhtio_validation.validator.array().items(_nhtio_validation.validator.number()).required().description("Array of numbers"),
 		operation: _nhtio_validation.validator.string().valid("normalize_min_max", "normalize_z_score", "normalize_percent_of_sum", "running_total", "rolling_avg", "pct_change", "rank", "outliers_iqr", "outliers_zscore").required().description("Transformation to apply"),
 		window: _nhtio_validation.validator.number().default(3).description("For rolling_avg: window size (default: 3)"),
-		threshold: _nhtio_validation.validator.number().default(3).description("For outliers_zscore: z-score threshold (default: 3.0)")
+		threshold: _nhtio_validation.validator.number().default(3).description("For outliers_zscore: z-score threshold (default: 3.0)"),
+		precision: precisionField
 	}),
 	handler: async (args) => {
-		const { numbers, operation, window, threshold } = args;
+		const { numbers, operation, window, threshold, precision } = args;
 		const nums = parseNumbers(numbers);
 		if ("error" in nums) return `Error: ${nums.error}`;
+		const round = (n) => Number.parseFloat(require_lib_helpers_bignum.formatBig(n, precision));
 		switch (operation) {
 			case "normalize_min_max": {
 				const lo = (0, simple_statistics.min)(nums);
 				const hi = (0, simple_statistics.max)(nums);
 				if (lo === hi) return JSON.stringify(nums.map(() => 0));
-				return JSON.stringify(nums.map((v) => Number.parseFloat(((v - lo) / (hi - lo)).toFixed(8))));
+				return JSON.stringify(nums.map((v) => round((v - lo) / (hi - lo))));
 			}
 			case "normalize_z_score": {
 				const m = (0, simple_statistics.mean)(nums);
 				const sd = (0, simple_statistics.standardDeviation)(nums);
 				if (sd === 0) return JSON.stringify(nums.map(() => 0));
-				return JSON.stringify(nums.map((v) => Number.parseFloat((0, simple_statistics.zScore)(v, m, sd).toFixed(8))));
+				return JSON.stringify(nums.map((v) => round((0, simple_statistics.zScore)(v, m, sd))));
 			}
 			case "normalize_percent_of_sum": {
 				const total = (0, simple_statistics.sum)(nums);
 				if (total === 0) return JSON.stringify(nums.map(() => 0));
-				return JSON.stringify(nums.map((v) => Number.parseFloat((v / total * 100).toFixed(4))));
-			}
-			case "running_total": {
-				const totals = [];
-				let acc = 0;
-				for (const v of nums) {
-					acc += v;
-					totals.push(Number.parseFloat(acc.toPrecision(12)));
-				}
-				return JSON.stringify(totals);
+				return JSON.stringify(nums.map((v) => round(v / total * 100)));
 			}
+			case "running_total": return JSON.stringify(nums.map((_, i) => {
+				const big = require_lib_helpers_bignum.bigSum(nums.slice(0, i + 1));
+				const asNum = require_lib_helpers_bignum.bigToNumber(big);
+				if (Number.isFinite(asNum) && Math.abs(asNum) <= Number.MAX_SAFE_INTEGER) return round(asNum);
+				return require_lib_helpers_bignum.formatBig(big, precision);
+			}));
 			case "rolling_avg": {
 				const w = Math.max(1, Math.floor(window));
 				return JSON.stringify(nums.map((_, i) => {
-					const slice = nums.slice(Math.max(0, i - w + 1), i + 1);
-					return Number.parseFloat((0, simple_statistics.mean)(slice).toPrecision(8));
+					return round((0, simple_statistics.mean)(nums.slice(Math.max(0, i - w + 1), i + 1)));
 				}));
 			}
 			case "pct_change": {
@@ -210,11 +220,12 @@ var statsHistogramTool = new require_tool.Tool({
 	name: "stats_histogram",
 	description: "Bin a numeric array into equal-width histogram buckets and display counts.",
 	inputSchema: _nhtio_validation.validator.object({
-		numbers: _nhtio_validation.validator.string().required().description("JSON array of numbers"),
-		bins: _nhtio_validation.validator.number().default(10).description("Number of bins (default: 10, max: 100)")
+		numbers: _nhtio_validation.validator.array().items(_nhtio_validation.validator.number()).required().description("Array of numbers"),
+		bins: _nhtio_validation.validator.number().default(10).description("Number of bins (default: 10, max: 100)"),
+		precision: precisionField
 	}),
 	handler: async (args) => {
-		const { numbers, bins } = args;
+		const { numbers, bins, precision } = args;
 		const nums = parseNumbers(numbers);
 		if ("error" in nums) return `Error: ${nums.error}`;
 		const binCount = Math.max(2, Math.min(100, Math.floor(bins)));
@@ -235,7 +246,7 @@ var statsHistogramTool = new require_tool.Tool({
 				const count = nums.filter((v) => isLast ? v >= breaks[i] && v <= breaks[i + 1] : v >= breaks[i] && v < breaks[i + 1]).length;
 				const pct = (count / nums.length * 100).toFixed(1);
 				const bar = "█".repeat(maxCount > 0 ? Math.round(count / maxCount * 20) : 0);
-				const range = `[${breaks[i].toPrecision(4)}, ${breaks[i + 1].toPrecision(4)}${isLast ? "]" : ")"}`;
+				const range = `[${require_lib_helpers_bignum.formatBig(breaks[i], precision)}, ${require_lib_helpers_bignum.formatBig(breaks[i + 1], precision)}${isLast ? "]" : ")"}`;
 				rows.push(`${range.padEnd(22)} ${String(count).padStart(4)} (${pct.padStart(5)}%) ${bar}`);
 			}
 			return rows.join("\n");

package/batteries/tools/statistics.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"statistics.cjs","names":[],"sources":["../../../src/batteries/tools/statistics/index.ts"],"sourcesContent":["/**\n * Pre-constructed tools for descriptive statistics, correlation, quantiles, and numeric summaries.\n *\n * @module @nhtio/adk/batteries/tools/statistics\n *\n * @remarks\n * Pre-constructed bundled tools for the `statistics` category. Import individually, the whole\n * category, or import every tool via `@nhtio/adk/batteries`.\n */\n\nimport { isError } from '@nhtio/adk/guards'\nimport { validator } from '@nhtio/validation'\nimport { Tool, SpooledJsonArtifact } from '@nhtio/adk/common'\nimport {\n  equalIntervalBreaks,\n  interquartileRange,\n  max,\n  mean,\n  median,\n  min,\n  mode,\n  quantile,\n  sampleCorrelation,\n  standardDeviation,\n  sum,\n  variance,\n  zScore,\n} from 'simple-statistics'\n\nfunction parseNumbers(input: unknown): number[] | { error: string } {\n  let arr: unknown = input\n  if (typeof input === 'string') {\n    try {\n      arr = JSON.parse(input)\n    } catch {\n      return { error: 'Invalid JSON — expected an array of numbers.' }\n    }\n  }\n  if (!Array.isArray(arr)) return { error: 'Input must be a JSON array of numbers.' }\n  const nums = (arr as unknown[]).filter(\n    (v): v is number => typeof v === 'number' && Number.isFinite(v)\n  )\n  if (nums.length === 0) return { error: 'No finite numbers found in the array.' }\n  return nums\n}\n\n/**\n * Compute descriptive statistics for a JSON array of numbers.\n *\n * @remarks\n * Returns count, sum, min/max/range, mean, median, mode, variance, standard deviation,\n * quartiles (Q1/Q2/Q3), IQR, and key percentiles (P10/P90/P95/P99) as a pretty-printed JSON\n * object. Non-numeric and non-finite entries are silently filtered.\n */\nexport const statsDescribeTool = new Tool({\n  name: 'stats_describe',\n  description:\n    'Compute descriptive statistics for a numeric array: count, sum, min, max, range, mean, median, mode, variance, standard deviation, quartiles (Q1–Q3), IQR, and key percentiles.',\n  inputSchema: validator.object({\n    numbers: validator.string().required().description('JSON array of numbers'),\n  }),\n  artifactConstructor: () => SpooledJsonArtifact,\n  handler: async (args) => {\n    const { numbers } = args as { numbers: string }\n    const nums = parseNumbers(numbers)\n    if ('error' in nums) return `Error: ${nums.error}`\n\n    const sorted = [...nums].sort((a, b) => a - b)\n    const modeVal = mode(nums)\n\n    return JSON.stringify(\n      {\n        count: nums.length,\n        sum: Number.parseFloat(sum(nums).toPrecision(12)),\n        min: min(nums),\n        max: max(nums),\n        range: max(nums) - min(nums),\n        mean: Number.parseFloat(mean(nums).toPrecision(10)),\n        median: median(nums),\n        mode: modeVal,\n        variance: Number.parseFloat(variance(nums).toPrecision(8)),\n        std_dev: Number.parseFloat(standardDeviation(nums).toPrecision(8)),\n        q1: quantile(sorted, 0.25),\n        q2: quantile(sorted, 0.5),\n        q3: quantile(sorted, 0.75),\n        iqr: interquartileRange(nums),\n        p10: quantile(sorted, 0.1),\n        p90: quantile(sorted, 0.9),\n        p95: quantile(sorted, 0.95),\n        p99: quantile(sorted, 0.99),\n      },\n      null,\n      2\n    )\n  },\n})\n\n/**\n * Compute the Pearson correlation coefficient between two numeric arrays.\n *\n * @remarks\n * Returns `r`, `r²` (as a percentage of explained variance), and a plain-English interpretation\n * of strength and direction. Arrays must be the same length and contain at least two points.\n */\nexport const statsCorrelateTool = new Tool({\n  name: 'stats_correlate',\n  description:\n    'Compute the Pearson correlation coefficient between two numeric arrays. Returns the r value (-1 to 1), r², and a plain-English interpretation.',\n  inputSchema: validator.object({\n    x: validator.string().required().description('JSON array of numbers (first variable)'),\n    y: validator\n      .string()\n      .required()\n      .description('JSON array of numbers (second variable, same length as x)'),\n  }),\n  handler: async (args) => {\n    const { x: rawX, y: rawY } = args as { x: string; y: string }\n    const x = parseNumbers(rawX)\n    if ('error' in x) return `Error in x: ${x.error}`\n    const y = parseNumbers(rawY)\n    if ('error' in y) return `Error in y: ${y.error}`\n\n    if (x.length !== y.length)\n      return `Error: Arrays must be the same length (x: ${x.length}, y: ${y.length}).`\n    if (x.length < 2) return 'Error: At least 2 data points required.'\n\n    try {\n      const r = sampleCorrelation(x, y)\n      const absR = Math.abs(r)\n      const direction = r > 0 ? 'positive' : r < 0 ? 'negative' : 'no'\n      const strength =\n        absR >= 0.9\n          ? 'very strong'\n          : absR >= 0.7\n            ? 'strong'\n            : absR >= 0.5\n              ? 'moderate'\n              : absR >= 0.3\n                ? 'weak'\n                : 'very weak / negligible'\n      return `r = ${r.toFixed(6)}\\nr² = ${(r * r * 100).toFixed(2)}% (explained variance)\\nInterpretation: ${strength} ${direction} correlation`\n    } catch (err) {\n      return `Error: ${isError(err) ? err.message : String(err)}`\n    }\n  },\n})\n\n/**\n * Transform a numeric array — normalise, smooth, rank, or detect outliers.\n *\n * @remarks\n * Supported operations: `normalize_min_max`, `normalize_z_score`, `normalize_percent_of_sum`,\n * `running_total`, `rolling_avg`, `pct_change`, `rank`, `outliers_iqr`, `outliers_zscore`. Most\n * operations return a JSON array of transformed values; outlier operations return a\n * human-readable report.\n */\nexport const statsTransformTool = new Tool({\n  name: 'stats_transform',\n  description:\n    'Transform a numeric array: normalize (min-max or z-score), compute running totals, rolling averages, percent change between consecutive values, rank each value, or detect outliers.',\n  inputSchema: validator.object({\n    numbers: validator.string().required().description('JSON array of numbers'),\n    operation: validator\n      .string()\n      .valid(\n        'normalize_min_max',\n        'normalize_z_score',\n        'normalize_percent_of_sum',\n        'running_total',\n        'rolling_avg',\n        'pct_change',\n        'rank',\n        'outliers_iqr',\n        'outliers_zscore'\n      )\n      .required()\n      .description('Transformation to apply'),\n    window: validator.number().default(3).description('For rolling_avg: window size (default: 3)'),\n    threshold: validator\n      .number()\n      .default(3.0)\n      .description('For outliers_zscore: z-score threshold (default: 3.0)'),\n  }),\n  handler: async (args) => {\n    const { numbers, operation, window, threshold } = args as {\n      numbers: string\n      operation: string\n      window: number\n      threshold: number\n    }\n    const nums = parseNumbers(numbers)\n    if ('error' in nums) return `Error: ${nums.error}`\n\n    switch (operation) {\n      case 'normalize_min_max': {\n        const lo = min(nums)\n        const hi = max(nums)\n        if (lo === hi) return JSON.stringify(nums.map(() => 0))\n        return JSON.stringify(nums.map((v) => Number.parseFloat(((v - lo) / (hi - lo)).toFixed(8))))\n      }\n\n      case 'normalize_z_score': {\n        const m = mean(nums)\n        const sd = standardDeviation(nums)\n        if (sd === 0) return JSON.stringify(nums.map(() => 0))\n        return JSON.stringify(nums.map((v) => Number.parseFloat(zScore(v, m, sd).toFixed(8))))\n      }\n\n      case 'normalize_percent_of_sum': {\n        const total = sum(nums)\n        if (total === 0) return JSON.stringify(nums.map(() => 0))\n        return JSON.stringify(nums.map((v) => Number.parseFloat(((v / total) * 100).toFixed(4))))\n      }\n\n      case 'running_total': {\n        const totals: number[] = []\n        let acc = 0\n        for (const v of nums) {\n          acc += v\n          totals.push(Number.parseFloat(acc.toPrecision(12)))\n        }\n        return JSON.stringify(totals)\n      }\n\n      case 'rolling_avg': {\n        const w = Math.max(1, Math.floor(window))\n        return JSON.stringify(\n          nums.map((_, i) => {\n            const slice = nums.slice(Math.max(0, i - w + 1), i + 1)\n            return Number.parseFloat(mean(slice).toPrecision(8))\n          })\n        )\n      }\n\n      case 'pct_change': {\n        const changes: (number | null)[] = [null]\n        for (let i = 1; i < nums.length; i++) {\n          if (nums[i - 1] === 0) {\n            changes.push(null)\n          } else {\n            changes.push(\n              Number.parseFloat(\n                (((nums[i] - nums[i - 1]) / Math.abs(nums[i - 1])) * 100).toFixed(4)\n              )\n            )\n          }\n        }\n        return JSON.stringify(changes)\n      }\n\n      case 'rank': {\n        const sorted = [...nums].sort((a, b) => a - b)\n        return JSON.stringify(nums.map((v) => sorted.indexOf(v) + 1))\n      }\n\n      case 'outliers_iqr': {\n        const sorted = [...nums].sort((a, b) => a - b)\n        const q1 = quantile(sorted, 0.25)\n        const q3 = quantile(sorted, 0.75)\n        const iqr = q3 - q1\n        const lo = q1 - 1.5 * iqr\n        const hi = q3 + 1.5 * iqr\n        const outliers = nums\n          .map((v, i) => ({ index: i, value: v }))\n          .filter(({ value }) => value < lo || value > hi)\n        if (outliers.length === 0) return 'No outliers detected (IQR method).'\n        return `${outliers.length} outlier(s) detected:\\n${outliers.map((o) => `  [${o.index}] = ${o.value}`).join('\\n')}`\n      }\n\n      case 'outliers_zscore': {\n        const m = mean(nums)\n        const sd = standardDeviation(nums)\n        const outliers = nums\n          .map((v, i) => ({ index: i, value: v, z: sd === 0 ? 0 : Math.abs(zScore(v, m, sd)) }))\n          .filter((o) => o.z > threshold)\n        if (outliers.length === 0) return `No outliers detected (|z| > ${threshold}).`\n        return `${outliers.length} outlier(s) detected (|z| > ${threshold}):\\n${outliers.map((o) => `  [${o.index}] = ${o.value} (z = ${o.z.toFixed(3)})`).join('\\n')}`\n      }\n\n      default:\n        return `Error: Unknown operation \"${operation}\".`\n    }\n  },\n})\n\n/**\n * Bin a numeric array into equal-width histogram buckets.\n *\n * @remarks\n * Output is a text histogram showing each bin's range, count, percentage of total, and a bar\n * chart. The last bin is inclusive on both ends; preceding bins are half-open. `bins` is clamped\n * to `[2, 100]`.\n */\nexport const statsHistogramTool = new Tool({\n  name: 'stats_histogram',\n  description: 'Bin a numeric array into equal-width histogram buckets and display counts.',\n  inputSchema: validator.object({\n    numbers: validator.string().required().description('JSON array of numbers'),\n    bins: validator.number().default(10).description('Number of bins (default: 10, max: 100)'),\n  }),\n  handler: async (args) => {\n    const { numbers, bins } = args as { numbers: string; bins: number }\n    const nums = parseNumbers(numbers)\n    if ('error' in nums) return `Error: ${nums.error}`\n\n    const binCount = Math.max(2, Math.min(100, Math.floor(bins)))\n\n    try {\n      const breaks = equalIntervalBreaks(nums, binCount)\n      const rows: string[] = []\n      const maxCount = (() => {\n        let m = 0\n        for (let i = 0; i < breaks.length - 1; i++) {\n          const isLast = i === breaks.length - 2\n          const count = nums.filter((v) =>\n            isLast ? v >= breaks[i] && v <= breaks[i + 1] : v >= breaks[i] && v < breaks[i + 1]\n          ).length\n          if (count > m) m = count\n        }\n        return m\n      })()\n\n      for (let i = 0; i < breaks.length - 1; i++) {\n        const isLast = i === breaks.length - 2\n        const count = nums.filter((v) =>\n          isLast ? v >= breaks[i] && v <= breaks[i + 1] : v >= breaks[i] && v < breaks[i + 1]\n        ).length\n        const pct = ((count / nums.length) * 100).toFixed(1)\n        const bar = '█'.repeat(maxCount > 0 ? Math.round((count / maxCount) * 20) : 0)\n        const range = `[${breaks[i].toPrecision(4)}, ${breaks[i + 1].toPrecision(4)}${isLast ? ']' : ')'}`\n        rows.push(`${range.padEnd(22)} ${String(count).padStart(4)} (${pct.padStart(5)}%) ${bar}`)\n      }\n\n      return rows.join('\\n')\n    } catch (err) {\n      return `Error: ${isError(err) ? err.message : String(err)}`\n    }\n  },\n})\n"],"mappings":";;;;;;;;;;;;;;;;;;;AA6BA,SAAS,aAAa,OAA8C;CAClE,IAAI,MAAe;CACnB,IAAI,OAAO,UAAU,UACnB,IAAI;EACF,MAAM,KAAK,MAAM,KAAK;CACxB,QAAQ;EACN,OAAO,EAAE,OAAO,+CAA+C;CACjE;CAEF,IAAI,CAAC,MAAM,QAAQ,GAAG,GAAG,OAAO,EAAE,OAAO,yCAAyC;CAClF,MAAM,OAAQ,IAAkB,QAC7B,MAAmB,OAAO,MAAM,YAAY,OAAO,SAAS,CAAC,CAChE;CACA,IAAI,KAAK,WAAW,GAAG,OAAO,EAAE,OAAO,wCAAwC;CAC/E,OAAO;AACT;;;;;;;;;AAUA,IAAa,oBAAoB,IAAI,aAAA,KAAK;CACxC,MAAM;CACN,aACE;CACF,aAAa,kBAAA,UAAU,OAAO,EAC5B,SAAS,kBAAA,UAAU,OAAO,EAAE,SAAS,EAAE,YAAY,uBAAuB,EAC5E,CAAC;CACD,2BAA2B,kCAAA;CAC3B,SAAS,OAAO,SAAS;EACvB,MAAM,EAAE,YAAY;EACpB,MAAM,OAAO,aAAa,OAAO;EACjC,IAAI,WAAW,MAAM,OAAO,UAAU,KAAK;EAE3C,MAAM,SAAS,CAAC,GAAG,IAAI,EAAE,MAAM,GAAG,MAAM,IAAI,CAAC;EAC7C,MAAM,WAAA,GAAA,kBAAA,MAAe,IAAI;EAEzB,OAAO,KAAK,UACV;GACE,OAAO,KAAK;GACZ,KAAK,OAAO,YAAA,GAAA,kBAAA,KAAe,IAAI,EAAE,YAAY,EAAE,CAAC;GAChD,MAAA,GAAA,kBAAA,KAAS,IAAI;GACb,MAAA,GAAA,kBAAA,KAAS,IAAI;GACb,QAAA,GAAA,kBAAA,KAAW,IAAI,KAAA,GAAA,kBAAA,KAAQ,IAAI;GAC3B,MAAM,OAAO,YAAA,GAAA,kBAAA,MAAgB,IAAI,EAAE,YAAY,EAAE,CAAC;GAClD,SAAA,GAAA,kBAAA,QAAe,IAAI;GACnB,MAAM;GACN,UAAU,OAAO,YAAA,GAAA,kBAAA,UAAoB,IAAI,EAAE,YAAY,CAAC,CAAC;GACzD,SAAS,OAAO,YAAA,GAAA,kBAAA,mBAA6B,IAAI,EAAE,YAAY,CAAC,CAAC;GACjE,KAAA,GAAA,kBAAA,UAAa,QAAQ,GAAI;GACzB,KAAA,GAAA,kBAAA,UAAa,QAAQ,EAAG;GACxB,KAAA,GAAA,kBAAA,UAAa,QAAQ,GAAI;GACzB,MAAA,GAAA,kBAAA,oBAAwB,IAAI;GAC5B,MAAA,GAAA,kBAAA,UAAc,QAAQ,EAAG;GACzB,MAAA,GAAA,kBAAA,UAAc,QAAQ,EAAG;GACzB,MAAA,GAAA,kBAAA,UAAc,QAAQ,GAAI;GAC1B,MAAA,GAAA,kBAAA,UAAc,QAAQ,GAAI;EAC5B,GACA,MACA,CACF;CACF;AACF,CAAC;;;;;;;;AASD,IAAa,qBAAqB,IAAI,aAAA,KAAK;CACzC,MAAM;CACN,aACE;CACF,aAAa,kBAAA,UAAU,OAAO;EAC5B,GAAG,kBAAA,UAAU,OAAO,EAAE,SAAS,EAAE,YAAY,wCAAwC;EACrF,GAAG,kBAAA,UACA,OAAO,EACP,SAAS,EACT,YAAY,2DAA2D;CAC5E,CAAC;CACD,SAAS,OAAO,SAAS;EACvB,MAAM,EAAE,GAAG,MAAM,GAAG,SAAS;EAC7B,MAAM,IAAI,aAAa,IAAI;EAC3B,IAAI,WAAW,GAAG,OAAO,eAAe,EAAE;EAC1C,MAAM,IAAI,aAAa,IAAI;EAC3B,IAAI,WAAW,GAAG,OAAO,eAAe,EAAE;EAE1C,IAAI,EAAE,WAAW,EAAE,QACjB,OAAO,6CAA6C,EAAE,OAAO,OAAO,EAAE,OAAO;EAC/E,IAAI,EAAE,SAAS,GAAG,OAAO;EAEzB,IAAI;GACF,MAAM,KAAA,GAAA,kBAAA,mBAAsB,GAAG,CAAC;GAChC,MAAM,OAAO,KAAK,IAAI,CAAC;GACvB,MAAM,YAAY,IAAI,IAAI,aAAa,IAAI,IAAI,aAAa;GAC5D,MAAM,WACJ,QAAQ,KACJ,gBACA,QAAQ,KACN,WACA,QAAQ,KACN,aACA,QAAQ,KACN,SACA;GACZ,OAAO,OAAO,EAAE,QAAQ,CAAC,EAAE,UAAU,IAAI,IAAI,KAAK,QAAQ,CAAC,EAAE,0CAA0C,SAAS,GAAG,UAAU;EAC/H,SAAS,KAAK;GACZ,OAAO,UAAU,sBAAA,QAAQ,GAAG,IAAI,IAAI,UAAU,OAAO,GAAG;EAC1D;CACF;AACF,CAAC;;;;;;;;;;AAWD,IAAa,qBAAqB,IAAI,aAAA,KAAK;CACzC,MAAM;CACN,aACE;CACF,aAAa,kBAAA,UAAU,OAAO;EAC5B,SAAS,kBAAA,UAAU,OAAO,EAAE,SAAS,EAAE,YAAY,uBAAuB;EAC1E,WAAW,kBAAA,UACR,OAAO,EACP,MACC,qBACA,qBACA,4BACA,iBACA,eACA,cACA,QACA,gBACA,iBACF,EACC,SAAS,EACT,YAAY,yBAAyB;EACxC,QAAQ,kBAAA,UAAU,OAAO,EAAE,QAAQ,CAAC,EAAE,YAAY,2CAA2C;EAC7F,WAAW,kBAAA,UACR,OAAO,EACP,QAAQ,CAAG,EACX,YAAY,uDAAuD;CACxE,CAAC;CACD,SAAS,OAAO,SAAS;EACvB,MAAM,EAAE,SAAS,WAAW,QAAQ,cAAc;EAMlD,MAAM,OAAO,aAAa,OAAO;EACjC,IAAI,WAAW,MAAM,OAAO,UAAU,KAAK;EAE3C,QAAQ,WAAR;GACE,KAAK,qBAAqB;IACxB,MAAM,MAAA,GAAA,kBAAA,KAAS,IAAI;IACnB,MAAM,MAAA,GAAA,kBAAA,KAAS,IAAI;IACnB,IAAI,OAAO,IAAI,OAAO,KAAK,UAAU,KAAK,UAAU,CAAC,CAAC;IACtD,OAAO,KAAK,UAAU,KAAK,KAAK,MAAM,OAAO,aAAa,IAAI,OAAO,KAAK,KAAK,QAAQ,CAAC,CAAC,CAAC,CAAC;GAC7F;GAEA,KAAK,qBAAqB;IACxB,MAAM,KAAA,GAAA,kBAAA,MAAS,IAAI;IACnB,MAAM,MAAA,GAAA,kBAAA,mBAAuB,IAAI;IACjC,IAAI,OAAO,GAAG,OAAO,KAAK,UAAU,KAAK,UAAU,CAAC,CAAC;IACrD,OAAO,KAAK,UAAU,KAAK,KAAK,MAAM,OAAO,YAAA,GAAA,kBAAA,QAAkB,GAAG,GAAG,EAAE,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC;GACvF;GAEA,KAAK,4BAA4B;IAC/B,MAAM,SAAA,GAAA,kBAAA,KAAY,IAAI;IACtB,IAAI,UAAU,GAAG,OAAO,KAAK,UAAU,KAAK,UAAU,CAAC,CAAC;IACxD,OAAO,KAAK,UAAU,KAAK,KAAK,MAAM,OAAO,YAAa,IAAI,QAAS,KAAK,QAAQ,CAAC,CAAC,CAAC,CAAC;GAC1F;GAEA,KAAK,iBAAiB;IACpB,MAAM,SAAmB,CAAC;IAC1B,IAAI,MAAM;IACV,KAAK,MAAM,KAAK,MAAM;KACpB,OAAO;KACP,OAAO,KAAK,OAAO,WAAW,IAAI,YAAY,EAAE,CAAC,CAAC;IACpD;IACA,OAAO,KAAK,UAAU,MAAM;GAC9B;GAEA,KAAK,eAAe;IAClB,MAAM,IAAI,KAAK,IAAI,GAAG,KAAK,MAAM,MAAM,CAAC;IACxC,OAAO,KAAK,UACV,KAAK,KAAK,GAAG,MAAM;KACjB,MAAM,QAAQ,KAAK,MAAM,KAAK,IAAI,GAAG,IAAI,IAAI,CAAC,GAAG,IAAI,CAAC;KACtD,OAAO,OAAO,YAAA,GAAA,kBAAA,MAAgB,KAAK,EAAE,YAAY,CAAC,CAAC;IACrD,CAAC,CACH;GACF;GAEA,KAAK,cAAc;IACjB,MAAM,UAA6B,CAAC,IAAI;IACxC,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,QAAQ,KAC/B,IAAI,KAAK,IAAI,OAAO,GAClB,QAAQ,KAAK,IAAI;SAEjB,QAAQ,KACN,OAAO,aACF,KAAK,KAAK,KAAK,IAAI,MAAM,KAAK,IAAI,KAAK,IAAI,EAAE,IAAK,KAAK,QAAQ,CAAC,CACrE,CACF;IAGJ,OAAO,KAAK,UAAU,OAAO;GAC/B;GAEA,KAAK,QAAQ;IACX,MAAM,SAAS,CAAC,GAAG,IAAI,EAAE,MAAM,GAAG,MAAM,IAAI,CAAC;IAC7C,OAAO,KAAK,UAAU,KAAK,KAAK,MAAM,OAAO,QAAQ,CAAC,IAAI,CAAC,CAAC;GAC9D;GAEA,KAAK,gBAAgB;IACnB,MAAM,SAAS,CAAC,GAAG,IAAI,EAAE,MAAM,GAAG,MAAM,IAAI,CAAC;IAC7C,MAAM,MAAA,GAAA,kBAAA,UAAc,QAAQ,GAAI;IAChC,MAAM,MAAA,GAAA,kBAAA,UAAc,QAAQ,GAAI;IAChC,MAAM,MAAM,KAAK;IACjB,MAAM,KAAK,KAAK,MAAM;IACtB,MAAM,KAAK,KAAK,MAAM;IACtB,MAAM,WAAW,KACd,KAAK,GAAG,OAAO;KAAE,OAAO;KAAG,OAAO;IAAE,EAAE,EACtC,QAAQ,EAAE,YAAY,QAAQ,MAAM,QAAQ,EAAE;IACjD,IAAI,SAAS,WAAW,GAAG,OAAO;IAClC,OAAO,GAAG,SAAS,OAAO,yBAAyB,SAAS,KAAK,MAAM,MAAM,EAAE,MAAM,MAAM,EAAE,OAAO,EAAE,KAAK,IAAI;GACjH;GAEA,KAAK,mBAAmB;IACtB,MAAM,KAAA,GAAA,kBAAA,MAAS,IAAI;IACnB,MAAM,MAAA,GAAA,kBAAA,mBAAuB,IAAI;IACjC,MAAM,WAAW,KACd,KAAK,GAAG,OAAO;KAAE,OAAO;KAAG,OAAO;KAAG,GAAG,OAAO,IAAI,IAAI,KAAK,KAAA,GAAA,kBAAA,QAAW,GAAG,GAAG,EAAE,CAAC;IAAE,EAAE,EACpF,QAAQ,MAAM,EAAE,IAAI,SAAS;IAChC,IAAI,SAAS,WAAW,GAAG,OAAO,+BAA+B,UAAU;IAC3E,OAAO,GAAG,SAAS,OAAO,8BAA8B,UAAU,MAAM,SAAS,KAAK,MAAM,MAAM,EAAE,MAAM,MAAM,EAAE,MAAM,QAAQ,EAAE,EAAE,QAAQ,CAAC,EAAE,EAAE,EAAE,KAAK,IAAI;GAC9J;GAEA,SACE,OAAO,6BAA6B,UAAU;EAClD;CACF;AACF,CAAC;;;;;;;;;AAUD,IAAa,qBAAqB,IAAI,aAAA,KAAK;CACzC,MAAM;CACN,aAAa;CACb,aAAa,kBAAA,UAAU,OAAO;EAC5B,SAAS,kBAAA,UAAU,OAAO,EAAE,SAAS,EAAE,YAAY,uBAAuB;EAC1E,MAAM,kBAAA,UAAU,OAAO,EAAE,QAAQ,EAAE,EAAE,YAAY,wCAAwC;CAC3F,CAAC;CACD,SAAS,OAAO,SAAS;EACvB,MAAM,EAAE,SAAS,SAAS;EAC1B,MAAM,OAAO,aAAa,OAAO;EACjC,IAAI,WAAW,MAAM,OAAO,UAAU,KAAK;EAE3C,MAAM,WAAW,KAAK,IAAI,GAAG,KAAK,IAAI,KAAK,KAAK,MAAM,IAAI,CAAC,CAAC;EAE5D,IAAI;GACF,MAAM,UAAA,GAAA,kBAAA,qBAA6B,MAAM,QAAQ;GACjD,MAAM,OAAiB,CAAC;GACxB,MAAM,kBAAkB;IACtB,IAAI,IAAI;IACR,KAAK,IAAI,IAAI,GAAG,IAAI,OAAO,SAAS,GAAG,KAAK;KAC1C,MAAM,SAAS,MAAM,OAAO,SAAS;KACrC,MAAM,QAAQ,KAAK,QAAQ,MACzB,SAAS,KAAK,OAAO,MAAM,KAAK,OAAO,IAAI,KAAK,KAAK,OAAO,MAAM,IAAI,OAAO,IAAI,EACnF,EAAE;KACF,IAAI,QAAQ,GAAG,IAAI;IACrB;IACA,OAAO;GACT,GAAG;GAEH,KAAK,IAAI,IAAI,GAAG,IAAI,OAAO,SAAS,GAAG,KAAK;IAC1C,MAAM,SAAS,MAAM,OAAO,SAAS;IACrC,MAAM,QAAQ,KAAK,QAAQ,MACzB,SAAS,KAAK,OAAO,MAAM,KAAK,OAAO,IAAI,KAAK,KAAK,OAAO,MAAM,IAAI,OAAO,IAAI,EACnF,EAAE;IACF,MAAM,OAAQ,QAAQ,KAAK,SAAU,KAAK,QAAQ,CAAC;IACnD,MAAM,MAAM,IAAI,OAAO,WAAW,IAAI,KAAK,MAAO,QAAQ,WAAY,EAAE,IAAI,CAAC;IAC7E,MAAM,QAAQ,IAAI,OAAO,GAAG,YAAY,CAAC,EAAE,IAAI,OAAO,IAAI,GAAG,YAAY,CAAC,IAAI,SAAS,MAAM;IAC7F,KAAK,KAAK,GAAG,MAAM,OAAO,EAAE,EAAE,GAAG,OAAO,KAAK,EAAE,SAAS,CAAC,EAAE,IAAI,IAAI,SAAS,CAAC,EAAE,KAAK,KAAK;GAC3F;GAEA,OAAO,KAAK,KAAK,IAAI;EACvB,SAAS,KAAK;GACZ,OAAO,UAAU,sBAAA,QAAQ,GAAG,IAAI,IAAI,UAAU,OAAO,GAAG;EAC1D;CACF;AACF,CAAC"}
+{"version":3,"file":"statistics.cjs","names":[],"sources":["../../../src/batteries/tools/statistics/index.ts"],"sourcesContent":["/**\n * Pre-constructed tools for descriptive statistics, correlation, quantiles, and numeric summaries.\n *\n * @module @nhtio/adk/batteries/tools/statistics\n *\n * @remarks\n * Pre-constructed bundled tools for the `statistics` category. Import individually, the whole\n * category, or import every tool via `@nhtio/adk/batteries`.\n */\n\nimport { isError } from '@nhtio/adk/guards'\nimport { validator } from '@nhtio/validation'\nimport { Tool, SpooledJsonArtifact } from '@nhtio/adk/common'\nimport {\n  bigSum,\n  bigMean,\n  formatBig,\n  bigToNumber,\n  DEFAULT_PRECISION,\n} from '@nhtio/adk/lib/helpers/bignum'\nimport {\n  equalIntervalBreaks,\n  interquartileRange,\n  max,\n  mean,\n  median,\n  min,\n  mode,\n  quantile,\n  sampleCorrelation,\n  standardDeviation,\n  sum,\n  variance,\n  zScore,\n} from 'simple-statistics'\n\n/**\n * Normalise the `numbers`/`x`/`y` input to a `number[]`.\n *\n * @remarks\n * The input schema is `validator.array().items(validator.number())`, which already rejects\n * `NaN`, `±Infinity`, and magnitudes `> Number.MAX_SAFE_INTEGER` before the handler runs — so by\n * the time a value reaches here it is a finite, in-range float64. This guard only enforces\n * non-emptiness (and defensively re-checks the array shape). It deliberately NO LONGER silently\n * drops non-finite entries: those can't arrive through the typed schema, and a silent filter hid\n * real input errors.\n */\nfunction parseNumbers(input: unknown): number[] | { error: string } {\n  if (!Array.isArray(input)) return { error: 'Input must be an array of numbers.' }\n  if (input.length === 0) return { error: 'Array must contain at least one number.' }\n  return input as number[]\n}\n\n/** Shared `precision` schema fragment (significant digits for numeric output, default 8). */\nconst precisionField = validator\n  .number()\n  .default(DEFAULT_PRECISION)\n  .description(`Significant digits for numeric output (default: ${DEFAULT_PRECISION}).`)\n\n/**\n * Compute descriptive statistics for a JSON array of numbers.\n *\n * @remarks\n * Returns count, sum, min/max/range, mean, median, mode, variance, standard deviation,\n * quartiles (Q1/Q2/Q3), IQR, and key percentiles (P10/P90/P95/P99) as a pretty-printed JSON\n * object. Non-numeric and non-finite entries are silently filtered.\n */\nexport const statsDescribeTool = new Tool({\n  name: 'stats_describe',\n  description:\n    'Compute descriptive statistics for a numeric array: count, sum, min, max, range, mean, median, mode, variance, standard deviation, quartiles (Q1–Q3), IQR, and key percentiles.',\n  inputSchema: validator.object({\n    numbers: validator.array().items(validator.number()).required().description('Array of numbers'),\n    precision: precisionField,\n  }),\n  artifactConstructor: () => SpooledJsonArtifact,\n  handler: async (args) => {\n    const { numbers, precision } = args as { numbers: number[]; precision: number }\n    const nums = parseNumbers(numbers)\n    if ('error' in nums) return `Error: ${nums.error}`\n\n    const sorted = [...nums].sort((a, b) => a - b)\n    const modeVal = mode(nums)\n    // Computed aggregates (sum/mean/variance/std_dev) are emitted as `precision`-significant-digit\n    // STRINGS via BigNumber: this is lossless (no toPrecision round-trip) and overflow-safe (a sum\n    // exceeding float64 stays exact, e.g. 2e308 instead of Infinity). Order statistics\n    // (min/max/median/quartiles/range) are always input elements or midpoints — in-range by\n    // construction — so they remain numbers.\n    const fmt = (n: number): string => formatBig(n, precision)\n\n    return JSON.stringify(\n      {\n        count: nums.length,\n        sum: formatBig(bigSum(nums), precision),\n        min: min(nums),\n        max: max(nums),\n        range: max(nums) - min(nums),\n        mean: formatBig(bigMean(nums), precision),\n        median: median(nums),\n        mode: modeVal,\n        variance: fmt(variance(nums)),\n        std_dev: fmt(standardDeviation(nums)),\n        q1: quantile(sorted, 0.25),\n        q2: quantile(sorted, 0.5),\n        q3: quantile(sorted, 0.75),\n        iqr: interquartileRange(nums),\n        p10: quantile(sorted, 0.1),\n        p90: quantile(sorted, 0.9),\n        p95: quantile(sorted, 0.95),\n        p99: quantile(sorted, 0.99),\n      },\n      null,\n      2\n    )\n  },\n})\n\n/**\n * Compute the Pearson correlation coefficient between two numeric arrays.\n *\n * @remarks\n * Returns `r`, `r²` (as a percentage of explained variance), and a plain-English interpretation\n * of strength and direction. Arrays must be the same length and contain at least two points.\n */\nexport const statsCorrelateTool = new Tool({\n  name: 'stats_correlate',\n  description:\n    'Compute the Pearson correlation coefficient between two numeric arrays. Returns the r value (-1 to 1), r², and a plain-English interpretation.',\n  inputSchema: validator.object({\n    x: validator\n      .array()\n      .items(validator.number())\n      .required()\n      .description('Array of numbers (first variable)'),\n    y: validator\n      .array()\n      .items(validator.number())\n      .required()\n      .description('Array of numbers (second variable, same length as x)'),\n  }),\n  handler: async (args) => {\n    const { x: rawX, y: rawY } = args as { x: number[]; y: number[] }\n    const x = parseNumbers(rawX)\n    if ('error' in x) return `Error in x: ${x.error}`\n    const y = parseNumbers(rawY)\n    if ('error' in y) return `Error in y: ${y.error}`\n\n    if (x.length !== y.length)\n      return `Error: Arrays must be the same length (x: ${x.length}, y: ${y.length}).`\n    if (x.length < 2) return 'Error: At least 2 data points required.'\n\n    // Pearson r is undefined when either variable has zero variance (constant) — the formula\n    // divides by a standard deviation of 0. Report that explicitly instead of emitting `r = NaN`,\n    // which reads like a real (negligible) correlation.\n    if (standardDeviation(x) === 0 || standardDeviation(y) === 0) {\n      return 'Correlation is undefined: at least one variable is constant (zero variance), so Pearson r cannot be computed.'\n    }\n\n    try {\n      const r = sampleCorrelation(x, y)\n      const absR = Math.abs(r)\n      const direction = r > 0 ? 'positive' : r < 0 ? 'negative' : 'no'\n      const strength =\n        absR >= 0.9\n          ? 'very strong'\n          : absR >= 0.7\n            ? 'strong'\n            : absR >= 0.5\n              ? 'moderate'\n              : absR >= 0.3\n                ? 'weak'\n                : 'very weak / negligible'\n      return `r = ${r.toFixed(6)}\\nr² = ${(r * r * 100).toFixed(2)}% (explained variance)\\nInterpretation: ${strength} ${direction} correlation`\n    } catch (err) {\n      return `Error: ${isError(err) ? err.message : String(err)}`\n    }\n  },\n})\n\n/**\n * Transform a numeric array — normalise, smooth, rank, or detect outliers.\n *\n * @remarks\n * Supported operations: `normalize_min_max`, `normalize_z_score`, `normalize_percent_of_sum`,\n * `running_total`, `rolling_avg`, `pct_change`, `rank`, `outliers_iqr`, `outliers_zscore`. Most\n * operations return a JSON array of transformed values; outlier operations return a\n * human-readable report.\n */\nexport const statsTransformTool = new Tool({\n  name: 'stats_transform',\n  description:\n    'Transform a numeric array: normalize (min-max or z-score), compute running totals, rolling averages, percent change between consecutive values, rank each value, or detect outliers.',\n  inputSchema: validator.object({\n    numbers: validator.array().items(validator.number()).required().description('Array of numbers'),\n    operation: validator\n      .string()\n      .valid(\n        'normalize_min_max',\n        'normalize_z_score',\n        'normalize_percent_of_sum',\n        'running_total',\n        'rolling_avg',\n        'pct_change',\n        'rank',\n        'outliers_iqr',\n        'outliers_zscore'\n      )\n      .required()\n      .description('Transformation to apply'),\n    window: validator.number().default(3).description('For rolling_avg: window size (default: 3)'),\n    threshold: validator\n      .number()\n      .default(3.0)\n      .description('For outliers_zscore: z-score threshold (default: 3.0)'),\n    precision: precisionField,\n  }),\n  handler: async (args) => {\n    const { numbers, operation, window, threshold, precision } = args as {\n      numbers: number[]\n      operation: string\n      window: number\n      threshold: number\n      precision: number\n    }\n    const nums = parseNumbers(numbers)\n    if ('error' in nums) return `Error: ${nums.error}`\n\n    // Round a float to `precision` significant digits without the toPrecision/parse noise.\n    const round = (n: number): number => Number.parseFloat(formatBig(n, precision))\n\n    switch (operation) {\n      case 'normalize_min_max': {\n        const lo = min(nums)\n        const hi = max(nums)\n        if (lo === hi) return JSON.stringify(nums.map(() => 0))\n        return JSON.stringify(nums.map((v) => round((v - lo) / (hi - lo))))\n      }\n\n      case 'normalize_z_score': {\n        const m = mean(nums)\n        const sd = standardDeviation(nums)\n        if (sd === 0) return JSON.stringify(nums.map(() => 0))\n        return JSON.stringify(nums.map((v) => round(zScore(v, m, sd))))\n      }\n\n      case 'normalize_percent_of_sum': {\n        const total = sum(nums)\n        if (total === 0) return JSON.stringify(nums.map(() => 0))\n        return JSON.stringify(nums.map((v) => round((v / total) * 100)))\n      }\n\n      case 'running_total': {\n        // Each prefix sum is computed exactly via BigNumber (so a cumulative total exceeding\n        // float64 stays exact instead of overflowing to Infinity). Each entry is a plain number\n        // when it fits float64 (the common case), or a precise string when it would otherwise\n        // overflow to Infinity → JSON null.\n        return JSON.stringify(\n          nums.map((_, i) => {\n            const big = bigSum(nums.slice(0, i + 1))\n            const asNum = bigToNumber(big)\n            // Number only when exactly representable; otherwise the exact string (covers both\n            // overflow and the silent-rounding gap above 2^53).\n            if (Number.isFinite(asNum) && Math.abs(asNum) <= Number.MAX_SAFE_INTEGER) {\n              return round(asNum)\n            }\n            return formatBig(big, precision)\n          })\n        )\n      }\n\n      case 'rolling_avg': {\n        const w = Math.max(1, Math.floor(window))\n        return JSON.stringify(\n          nums.map((_, i) => {\n            const slice = nums.slice(Math.max(0, i - w + 1), i + 1)\n            return round(mean(slice))\n          })\n        )\n      }\n\n      case 'pct_change': {\n        const changes: (number | null)[] = [null]\n        for (let i = 1; i < nums.length; i++) {\n          if (nums[i - 1] === 0) {\n            changes.push(null)\n          } else {\n            changes.push(\n              Number.parseFloat(\n                (((nums[i] - nums[i - 1]) / Math.abs(nums[i - 1])) * 100).toFixed(4)\n              )\n            )\n          }\n        }\n        return JSON.stringify(changes)\n      }\n\n      case 'rank': {\n        const sorted = [...nums].sort((a, b) => a - b)\n        return JSON.stringify(nums.map((v) => sorted.indexOf(v) + 1))\n      }\n\n      case 'outliers_iqr': {\n        const sorted = [...nums].sort((a, b) => a - b)\n        const q1 = quantile(sorted, 0.25)\n        const q3 = quantile(sorted, 0.75)\n        const iqr = q3 - q1\n        const lo = q1 - 1.5 * iqr\n        const hi = q3 + 1.5 * iqr\n        const outliers = nums\n          .map((v, i) => ({ index: i, value: v }))\n          .filter(({ value }) => value < lo || value > hi)\n        if (outliers.length === 0) return 'No outliers detected (IQR method).'\n        return `${outliers.length} outlier(s) detected:\\n${outliers.map((o) => `  [${o.index}] = ${o.value}`).join('\\n')}`\n      }\n\n      case 'outliers_zscore': {\n        const m = mean(nums)\n        const sd = standardDeviation(nums)\n        const outliers = nums\n          .map((v, i) => ({ index: i, value: v, z: sd === 0 ? 0 : Math.abs(zScore(v, m, sd)) }))\n          .filter((o) => o.z > threshold)\n        if (outliers.length === 0) return `No outliers detected (|z| > ${threshold}).`\n        return `${outliers.length} outlier(s) detected (|z| > ${threshold}):\\n${outliers.map((o) => `  [${o.index}] = ${o.value} (z = ${o.z.toFixed(3)})`).join('\\n')}`\n      }\n\n      default:\n        return `Error: Unknown operation \"${operation}\".`\n    }\n  },\n})\n\n/**\n * Bin a numeric array into equal-width histogram buckets.\n *\n * @remarks\n * Output is a text histogram showing each bin's range, count, percentage of total, and a bar\n * chart. The last bin is inclusive on both ends; preceding bins are half-open. `bins` is clamped\n * to `[2, 100]`.\n */\nexport const statsHistogramTool = new Tool({\n  name: 'stats_histogram',\n  description: 'Bin a numeric array into equal-width histogram buckets and display counts.',\n  inputSchema: validator.object({\n    numbers: validator.array().items(validator.number()).required().description('Array of numbers'),\n    bins: validator.number().default(10).description('Number of bins (default: 10, max: 100)'),\n    precision: precisionField,\n  }),\n  handler: async (args) => {\n    const { numbers, bins, precision } = args as {\n      numbers: number[]\n      bins: number\n      precision: number\n    }\n    const nums = parseNumbers(numbers)\n    if ('error' in nums) return `Error: ${nums.error}`\n\n    const binCount = Math.max(2, Math.min(100, Math.floor(bins)))\n\n    try {\n      const breaks = equalIntervalBreaks(nums, binCount)\n      const rows: string[] = []\n      const maxCount = (() => {\n        let m = 0\n        for (let i = 0; i < breaks.length - 1; i++) {\n          const isLast = i === breaks.length - 2\n          const count = nums.filter((v) =>\n            isLast ? v >= breaks[i] && v <= breaks[i + 1] : v >= breaks[i] && v < breaks[i + 1]\n          ).length\n          if (count > m) m = count\n        }\n        return m\n      })()\n\n      for (let i = 0; i < breaks.length - 1; i++) {\n        const isLast = i === breaks.length - 2\n        const count = nums.filter((v) =>\n          isLast ? v >= breaks[i] && v <= breaks[i + 1] : v >= breaks[i] && v < breaks[i + 1]\n        ).length\n        const pct = ((count / nums.length) * 100).toFixed(1)\n        const bar = '█'.repeat(maxCount > 0 ? Math.round((count / maxCount) * 20) : 0)\n        const range = `[${formatBig(breaks[i], precision)}, ${formatBig(breaks[i + 1], precision)}${isLast ? ']' : ')'}`\n        rows.push(`${range.padEnd(22)} ${String(count).padStart(4)} (${pct.padStart(5)}%) ${bar}`)\n      }\n\n      return rows.join('\\n')\n    } catch (err) {\n      return `Error: ${isError(err) ? err.message : String(err)}`\n    }\n  },\n})\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA+CA,SAAS,aAAa,OAA8C;CAClE,IAAI,CAAC,MAAM,QAAQ,KAAK,GAAG,OAAO,EAAE,OAAO,qCAAqC;CAChF,IAAI,MAAM,WAAW,GAAG,OAAO,EAAE,OAAO,0CAA0C;CAClF,OAAO;AACT;;AAGA,IAAM,iBAAiB,kBAAA,UACpB,OAAO,EACP,QAAA,CAAyB,EACzB,YAAY,qDAAwE;;;;;;;;;AAUvF,IAAa,oBAAoB,IAAI,aAAA,KAAK;CACxC,MAAM;CACN,aACE;CACF,aAAa,kBAAA,UAAU,OAAO;EAC5B,SAAS,kBAAA,UAAU,MAAM,EAAE,MAAM,kBAAA,UAAU,OAAO,CAAC,EAAE,SAAS,EAAE,YAAY,kBAAkB;EAC9F,WAAW;CACb,CAAC;CACD,2BAA2B,kCAAA;CAC3B,SAAS,OAAO,SAAS;EACvB,MAAM,EAAE,SAAS,cAAc;EAC/B,MAAM,OAAO,aAAa,OAAO;EACjC,IAAI,WAAW,MAAM,OAAO,UAAU,KAAK;EAE3C,MAAM,SAAS,CAAC,GAAG,IAAI,EAAE,MAAM,GAAG,MAAM,IAAI,CAAC;EAC7C,MAAM,WAAA,GAAA,kBAAA,MAAe,IAAI;EAMzB,MAAM,OAAO,MAAsB,2BAAA,UAAU,GAAG,SAAS;EAEzD,OAAO,KAAK,UACV;GACE,OAAO,KAAK;GACZ,KAAK,2BAAA,UAAU,2BAAA,OAAO,IAAI,GAAG,SAAS;GACtC,MAAA,GAAA,kBAAA,KAAS,IAAI;GACb,MAAA,GAAA,kBAAA,KAAS,IAAI;GACb,QAAA,GAAA,kBAAA,KAAW,IAAI,KAAA,GAAA,kBAAA,KAAQ,IAAI;GAC3B,MAAM,2BAAA,UAAU,2BAAA,QAAQ,IAAI,GAAG,SAAS;GACxC,SAAA,GAAA,kBAAA,QAAe,IAAI;GACnB,MAAM;GACN,UAAU,KAAA,GAAA,kBAAA,UAAa,IAAI,CAAC;GAC5B,SAAS,KAAA,GAAA,kBAAA,mBAAsB,IAAI,CAAC;GACpC,KAAA,GAAA,kBAAA,UAAa,QAAQ,GAAI;GACzB,KAAA,GAAA,kBAAA,UAAa,QAAQ,EAAG;GACxB,KAAA,GAAA,kBAAA,UAAa,QAAQ,GAAI;GACzB,MAAA,GAAA,kBAAA,oBAAwB,IAAI;GAC5B,MAAA,GAAA,kBAAA,UAAc,QAAQ,EAAG;GACzB,MAAA,GAAA,kBAAA,UAAc,QAAQ,EAAG;GACzB,MAAA,GAAA,kBAAA,UAAc,QAAQ,GAAI;GAC1B,MAAA,GAAA,kBAAA,UAAc,QAAQ,GAAI;EAC5B,GACA,MACA,CACF;CACF;AACF,CAAC;;;;;;;;AASD,IAAa,qBAAqB,IAAI,aAAA,KAAK;CACzC,MAAM;CACN,aACE;CACF,aAAa,kBAAA,UAAU,OAAO;EAC5B,GAAG,kBAAA,UACA,MAAM,EACN,MAAM,kBAAA,UAAU,OAAO,CAAC,EACxB,SAAS,EACT,YAAY,mCAAmC;EAClD,GAAG,kBAAA,UACA,MAAM,EACN,MAAM,kBAAA,UAAU,OAAO,CAAC,EACxB,SAAS,EACT,YAAY,sDAAsD;CACvE,CAAC;CACD,SAAS,OAAO,SAAS;EACvB,MAAM,EAAE,GAAG,MAAM,GAAG,SAAS;EAC7B,MAAM,IAAI,aAAa,IAAI;EAC3B,IAAI,WAAW,GAAG,OAAO,eAAe,EAAE;EAC1C,MAAM,IAAI,aAAa,IAAI;EAC3B,IAAI,WAAW,GAAG,OAAO,eAAe,EAAE;EAE1C,IAAI,EAAE,WAAW,EAAE,QACjB,OAAO,6CAA6C,EAAE,OAAO,OAAO,EAAE,OAAO;EAC/E,IAAI,EAAE,SAAS,GAAG,OAAO;EAKzB,KAAA,GAAA,kBAAA,mBAAsB,CAAC,MAAM,MAAA,GAAA,kBAAA,mBAAuB,CAAC,MAAM,GACzD,OAAO;EAGT,IAAI;GACF,MAAM,KAAA,GAAA,kBAAA,mBAAsB,GAAG,CAAC;GAChC,MAAM,OAAO,KAAK,IAAI,CAAC;GACvB,MAAM,YAAY,IAAI,IAAI,aAAa,IAAI,IAAI,aAAa;GAC5D,MAAM,WACJ,QAAQ,KACJ,gBACA,QAAQ,KACN,WACA,QAAQ,KACN,aACA,QAAQ,KACN,SACA;GACZ,OAAO,OAAO,EAAE,QAAQ,CAAC,EAAE,UAAU,IAAI,IAAI,KAAK,QAAQ,CAAC,EAAE,0CAA0C,SAAS,GAAG,UAAU;EAC/H,SAAS,KAAK;GACZ,OAAO,UAAU,sBAAA,QAAQ,GAAG,IAAI,IAAI,UAAU,OAAO,GAAG;EAC1D;CACF;AACF,CAAC;;;;;;;;;;AAWD,IAAa,qBAAqB,IAAI,aAAA,KAAK;CACzC,MAAM;CACN,aACE;CACF,aAAa,kBAAA,UAAU,OAAO;EAC5B,SAAS,kBAAA,UAAU,MAAM,EAAE,MAAM,kBAAA,UAAU,OAAO,CAAC,EAAE,SAAS,EAAE,YAAY,kBAAkB;EAC9F,WAAW,kBAAA,UACR,OAAO,EACP,MACC,qBACA,qBACA,4BACA,iBACA,eACA,cACA,QACA,gBACA,iBACF,EACC,SAAS,EACT,YAAY,yBAAyB;EACxC,QAAQ,kBAAA,UAAU,OAAO,EAAE,QAAQ,CAAC,EAAE,YAAY,2CAA2C;EAC7F,WAAW,kBAAA,UACR,OAAO,EACP,QAAQ,CAAG,EACX,YAAY,uDAAuD;EACtE,WAAW;CACb,CAAC;CACD,SAAS,OAAO,SAAS;EACvB,MAAM,EAAE,SAAS,WAAW,QAAQ,WAAW,cAAc;EAO7D,MAAM,OAAO,aAAa,OAAO;EACjC,IAAI,WAAW,MAAM,OAAO,UAAU,KAAK;EAG3C,MAAM,SAAS,MAAsB,OAAO,WAAW,2BAAA,UAAU,GAAG,SAAS,CAAC;EAE9E,QAAQ,WAAR;GACE,KAAK,qBAAqB;IACxB,MAAM,MAAA,GAAA,kBAAA,KAAS,IAAI;IACnB,MAAM,MAAA,GAAA,kBAAA,KAAS,IAAI;IACnB,IAAI,OAAO,IAAI,OAAO,KAAK,UAAU,KAAK,UAAU,CAAC,CAAC;IACtD,OAAO,KAAK,UAAU,KAAK,KAAK,MAAM,OAAO,IAAI,OAAO,KAAK,GAAG,CAAC,CAAC;GACpE;GAEA,KAAK,qBAAqB;IACxB,MAAM,KAAA,GAAA,kBAAA,MAAS,IAAI;IACnB,MAAM,MAAA,GAAA,kBAAA,mBAAuB,IAAI;IACjC,IAAI,OAAO,GAAG,OAAO,KAAK,UAAU,KAAK,UAAU,CAAC,CAAC;IACrD,OAAO,KAAK,UAAU,KAAK,KAAK,MAAM,OAAA,GAAA,kBAAA,QAAa,GAAG,GAAG,EAAE,CAAC,CAAC,CAAC;GAChE;GAEA,KAAK,4BAA4B;IAC/B,MAAM,SAAA,GAAA,kBAAA,KAAY,IAAI;IACtB,IAAI,UAAU,GAAG,OAAO,KAAK,UAAU,KAAK,UAAU,CAAC,CAAC;IACxD,OAAO,KAAK,UAAU,KAAK,KAAK,MAAM,MAAO,IAAI,QAAS,GAAG,CAAC,CAAC;GACjE;GAEA,KAAK,iBAKH,OAAO,KAAK,UACV,KAAK,KAAK,GAAG,MAAM;IACjB,MAAM,MAAM,2BAAA,OAAO,KAAK,MAAM,GAAG,IAAI,CAAC,CAAC;IACvC,MAAM,QAAQ,2BAAA,YAAY,GAAG;IAG7B,IAAI,OAAO,SAAS,KAAK,KAAK,KAAK,IAAI,KAAK,KAAK,OAAO,kBACtD,OAAO,MAAM,KAAK;IAEpB,OAAO,2BAAA,UAAU,KAAK,SAAS;GACjC,CAAC,CACH;GAGF,KAAK,eAAe;IAClB,MAAM,IAAI,KAAK,IAAI,GAAG,KAAK,MAAM,MAAM,CAAC;IACxC,OAAO,KAAK,UACV,KAAK,KAAK,GAAG,MAAM;KAEjB,OAAO,OAAA,GAAA,kBAAA,MADO,KAAK,MAAM,KAAK,IAAI,GAAG,IAAI,IAAI,CAAC,GAAG,IAAI,CACnC,CAAK,CAAC;IAC1B,CAAC,CACH;GACF;GAEA,KAAK,cAAc;IACjB,MAAM,UAA6B,CAAC,IAAI;IACxC,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,QAAQ,KAC/B,IAAI,KAAK,IAAI,OAAO,GAClB,QAAQ,KAAK,IAAI;SAEjB,QAAQ,KACN,OAAO,aACF,KAAK,KAAK,KAAK,IAAI,MAAM,KAAK,IAAI,KAAK,IAAI,EAAE,IAAK,KAAK,QAAQ,CAAC,CACrE,CACF;IAGJ,OAAO,KAAK,UAAU,OAAO;GAC/B;GAEA,KAAK,QAAQ;IACX,MAAM,SAAS,CAAC,GAAG,IAAI,EAAE,MAAM,GAAG,MAAM,IAAI,CAAC;IAC7C,OAAO,KAAK,UAAU,KAAK,KAAK,MAAM,OAAO,QAAQ,CAAC,IAAI,CAAC,CAAC;GAC9D;GAEA,KAAK,gBAAgB;IACnB,MAAM,SAAS,CAAC,GAAG,IAAI,EAAE,MAAM,GAAG,MAAM,IAAI,CAAC;IAC7C,MAAM,MAAA,GAAA,kBAAA,UAAc,QAAQ,GAAI;IAChC,MAAM,MAAA,GAAA,kBAAA,UAAc,QAAQ,GAAI;IAChC,MAAM,MAAM,KAAK;IACjB,MAAM,KAAK,KAAK,MAAM;IACtB,MAAM,KAAK,KAAK,MAAM;IACtB,MAAM,WAAW,KACd,KAAK,GAAG,OAAO;KAAE,OAAO;KAAG,OAAO;IAAE,EAAE,EACtC,QAAQ,EAAE,YAAY,QAAQ,MAAM,QAAQ,EAAE;IACjD,IAAI,SAAS,WAAW,GAAG,OAAO;IAClC,OAAO,GAAG,SAAS,OAAO,yBAAyB,SAAS,KAAK,MAAM,MAAM,EAAE,MAAM,MAAM,EAAE,OAAO,EAAE,KAAK,IAAI;GACjH;GAEA,KAAK,mBAAmB;IACtB,MAAM,KAAA,GAAA,kBAAA,MAAS,IAAI;IACnB,MAAM,MAAA,GAAA,kBAAA,mBAAuB,IAAI;IACjC,MAAM,WAAW,KACd,KAAK,GAAG,OAAO;KAAE,OAAO;KAAG,OAAO;KAAG,GAAG,OAAO,IAAI,IAAI,KAAK,KAAA,GAAA,kBAAA,QAAW,GAAG,GAAG,EAAE,CAAC;IAAE,EAAE,EACpF,QAAQ,MAAM,EAAE,IAAI,SAAS;IAChC,IAAI,SAAS,WAAW,GAAG,OAAO,+BAA+B,UAAU;IAC3E,OAAO,GAAG,SAAS,OAAO,8BAA8B,UAAU,MAAM,SAAS,KAAK,MAAM,MAAM,EAAE,MAAM,MAAM,EAAE,MAAM,QAAQ,EAAE,EAAE,QAAQ,CAAC,EAAE,EAAE,EAAE,KAAK,IAAI;GAC9J;GAEA,SACE,OAAO,6BAA6B,UAAU;EAClD;CACF;AACF,CAAC;;;;;;;;;AAUD,IAAa,qBAAqB,IAAI,aAAA,KAAK;CACzC,MAAM;CACN,aAAa;CACb,aAAa,kBAAA,UAAU,OAAO;EAC5B,SAAS,kBAAA,UAAU,MAAM,EAAE,MAAM,kBAAA,UAAU,OAAO,CAAC,EAAE,SAAS,EAAE,YAAY,kBAAkB;EAC9F,MAAM,kBAAA,UAAU,OAAO,EAAE,QAAQ,EAAE,EAAE,YAAY,wCAAwC;EACzF,WAAW;CACb,CAAC;CACD,SAAS,OAAO,SAAS;EACvB,MAAM,EAAE,SAAS,MAAM,cAAc;EAKrC,MAAM,OAAO,aAAa,OAAO;EACjC,IAAI,WAAW,MAAM,OAAO,UAAU,KAAK;EAE3C,MAAM,WAAW,KAAK,IAAI,GAAG,KAAK,IAAI,KAAK,KAAK,MAAM,IAAI,CAAC,CAAC;EAE5D,IAAI;GACF,MAAM,UAAA,GAAA,kBAAA,qBAA6B,MAAM,QAAQ;GACjD,MAAM,OAAiB,CAAC;GACxB,MAAM,kBAAkB;IACtB,IAAI,IAAI;IACR,KAAK,IAAI,IAAI,GAAG,IAAI,OAAO,SAAS,GAAG,KAAK;KAC1C,MAAM,SAAS,MAAM,OAAO,SAAS;KACrC,MAAM,QAAQ,KAAK,QAAQ,MACzB,SAAS,KAAK,OAAO,MAAM,KAAK,OAAO,IAAI,KAAK,KAAK,OAAO,MAAM,IAAI,OAAO,IAAI,EACnF,EAAE;KACF,IAAI,QAAQ,GAAG,IAAI;IACrB;IACA,OAAO;GACT,GAAG;GAEH,KAAK,IAAI,IAAI,GAAG,IAAI,OAAO,SAAS,GAAG,KAAK;IAC1C,MAAM,SAAS,MAAM,OAAO,SAAS;IACrC,MAAM,QAAQ,KAAK,QAAQ,MACzB,SAAS,KAAK,OAAO,MAAM,KAAK,OAAO,IAAI,KAAK,KAAK,OAAO,MAAM,IAAI,OAAO,IAAI,EACnF,EAAE;IACF,MAAM,OAAQ,QAAQ,KAAK,SAAU,KAAK,QAAQ,CAAC;IACnD,MAAM,MAAM,IAAI,OAAO,WAAW,IAAI,KAAK,MAAO,QAAQ,WAAY,EAAE,IAAI,CAAC;IAC7E,MAAM,QAAQ,IAAI,2BAAA,UAAU,OAAO,IAAI,SAAS,EAAE,IAAI,2BAAA,UAAU,OAAO,IAAI,IAAI,SAAS,IAAI,SAAS,MAAM;IAC3G,KAAK,KAAK,GAAG,MAAM,OAAO,EAAE,EAAE,GAAG,OAAO,KAAK,EAAE,SAAS,CAAC,EAAE,IAAI,IAAI,SAAS,CAAC,EAAE,KAAK,KAAK;GAC3F;GAEA,OAAO,KAAK,KAAK,IAAI;EACvB,SAAS,KAAK;GACZ,OAAO,UAAU,sBAAA,QAAQ,GAAG,IAAI,IAAI,UAAU,OAAO,GAAG;EAC1D;CACF;AACF,CAAC"}